diff --git a/.github/workflows/documentation.yml b/.github/workflows/documentation.yml
new file mode 100644
index 0000000000..648796e416
--- /dev/null
+++ b/.github/workflows/documentation.yml
@@ -0,0 +1,26 @@
+name: Build and Deploy
+on: [push]
+permissions:
+  contents: write
+jobs:
+  build-and-deploy:
+    concurrency: ci-${{ github.ref }} # Recommended if you intend to make multiple deployments in quick succession.
+    runs-on: ubuntu-latest
+    steps:
+      - name: Checkout 🛎️
+        uses: actions/checkout@v4
+
+      - name: Install Pandoc
+        run: sudo apt-get update && sudo apt-get install -y pandoc && pandoc --version
+
+      - name: Install and Build 🔧 # This example project is built using npm and outputs the result to the 'build' folder. Replace with the commands required to build your project, or remove this step entirely if your site is pre-built.
+        run: |
+          export NODE_OPTIONS="--max_old_space_size=8192"
+          cd docs/docusaurus
+          yarn install
+          yarn build
+
+      - name: Deploy 🚀
+        uses: JamesIves/github-pages-deploy-action@v4
+        with:
+          folder: docs/docusaurus/build # The folder the action should deploy.
diff --git a/docs/docusaurus/.gitignore b/docs/docusaurus/.gitignore
new file mode 100644
index 0000000000..f63e3cc918
--- /dev/null
+++ b/docs/docusaurus/.gitignore
@@ -0,0 +1,21 @@
+# Dependencies
+/node_modules
+
+# Production
+/build
+/docs
+
+# Generated files
+.docusaurus
+.cache-loader
+
+# Misc
+.DS_Store
+.env.local
+.env.development.local
+.env.test.local
+.env.production.local
+
+npm-debug.log*
+yarn-debug.log*
+yarn-error.log*
diff --git a/docs/docusaurus/README.md b/docs/docusaurus/README.md
new file mode 100644
index 0000000000..0c6c2c27be
--- /dev/null
+++ b/docs/docusaurus/README.md
@@ -0,0 +1,41 @@
+# Website
+
+This website is built using [Docusaurus](https://docusaurus.io/), a modern static website generator.
+
+### Installation
+
+```
+$ yarn
+```
+
+### Local Development
+
+```
+$ yarn start
+```
+
+This command starts a local development server and opens up a browser window. Most changes are reflected live without having to restart the server.
+
+### Build
+
+```
+$ yarn build
+```
+
+This command generates static content into the `build` directory and can be served using any static contents hosting service.
+
+### Deployment
+
+Using SSH:
+
+```
+$ USE_SSH=true yarn deploy
+```
+
+Not using SSH:
+
+```
+$ GIT_USER=<Your GitHub username> yarn deploy
+```
+
+If you are using GitHub pages for hosting, this command is a convenient way to build the website and push to the `gh-pages` branch.
diff --git a/docs/docusaurus/babel.config.js b/docs/docusaurus/babel.config.js
new file mode 100644
index 0000000000..e00595dae7
--- /dev/null
+++ b/docs/docusaurus/babel.config.js
@@ -0,0 +1,3 @@
+module.exports = {
+  presets: [require.resolve('@docusaurus/core/lib/babel/preset')],
+};
diff --git a/docs/docusaurus/docusaurus.config.ts b/docs/docusaurus/docusaurus.config.ts
new file mode 100644
index 0000000000..7390918c6f
--- /dev/null
+++ b/docs/docusaurus/docusaurus.config.ts
@@ -0,0 +1,286 @@
+import { themes as prismThemes } from "prism-react-renderer";
+import type { Config } from "@docusaurus/types";
+import type { Options as DocsOptions } from "@docusaurus/plugin-content-docs";
+import type * as Preset from "@docusaurus/preset-classic";
+
+const config: Config = {
+  title: "TuGraph 文档中心",
+  tagline:
+    "高性能图数据库TuGraph由蚂蚁集团和清华大学共同研发，历经蚂蚁实际业务场景锤炼，在国际图数据库基准测试中获得性能第一",
+  favicon:
+    "https://mdn.alipayobjects.com/huamei_qcdryc/afts/img/A*AbamQ5lxv0IAAAAAAAAAAAAADgOBAQ/original",
+
+  // Set the production url of your site here
+  url: "https://tugraph.tech/",
+  // Set the /<baseUrl>/ pathname under which your site is served
+  // For GitHub pages deployment, it is often '/<projectName>/'
+  baseUrl: "/tugraph-db",
+
+  // GitHub pages deployment config.
+  // If you aren't using GitHub pages, you don't need these.
+  organizationName: "facebook", // Usually your GitHub org/user name.
+  projectName: "Tugraph Docs", // Usually your repo name.
+
+  onBrokenLinks: "warn",
+  onBrokenMarkdownLinks: "warn",
+  onBrokenAnchors: "warn",
+
+  trailingSlash: false,
+
+  markdown: {
+    format: "md",
+    mermaid: true,
+  },
+
+  i18n: {
+    defaultLocale: "zh-CN",
+    locales: ["zh-CN", "en-US"],
+  },
+
+  presets: [
+    [
+      "classic",
+      {
+        // docs: {
+        //   sidebarPath: "./sidebars.ts",
+        //   path: "../docs/zh-CN/source",
+        //   routeBasePath: "zh/latest",
+        // },
+        docs: {
+          id: "4-5-1_zh",
+          sidebarPath: "./versions_sidebars/version-4.5.1_zh.ts",
+          path: "./versions/version-4.5.1/zh-CN/source",
+          routeBasePath: "zh/4.5.1",
+        },
+        theme: {
+          customCss: "./src/css/custom.css",
+        },
+      } satisfies Preset.Options,
+    ],
+  ],
+
+  plugins: [
+    // [
+    //   "content-docs",
+    //   {
+    //     id: "latest-en",
+    //     sidebarPath: "./sidebarsEn.ts",
+    //     path: "../docs/en-US/source",
+    //     routeBasePath: "en/latest",
+    //   } satisfies DocsOptions,
+    // ],
+    [
+      "content-docs",
+      {
+        id: "4-5-1_en",
+        sidebarPath: "./versions_sidebars/version-4.5.1_en.ts",
+        path: "./versions/version-4.5.1/en-US/source",
+        routeBasePath: "en/4.5.1",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-3-2_en",
+        sidebarPath: "./versions_sidebars/version-4.3.2_en.ts",
+        path: "./versions/version-4.3.2/en-US/source",
+        routeBasePath: "en/4.3.2",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-3-2_zh",
+        sidebarPath: "./versions_sidebars/version-4.3.2_zh.ts",
+        path: "./versions/version-4.3.2/zh-CN/source",
+        routeBasePath: "zh/4.3.2",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-3-1_en",
+        sidebarPath: "./versions_sidebars/version-4.3.1_en.ts",
+        path: "./versions/version-4.3.1/en-US/source",
+        routeBasePath: "en/4.3.1",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-3-1_zh",
+        sidebarPath: "./versions_sidebars/version-4.3.1_zh.ts",
+        path: "./versions/version-4.3.1/zh-CN/source",
+        routeBasePath: "zh/4.3.1",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-3-0_en",
+        sidebarPath: "./versions_sidebars/version-4.3.0_en.ts",
+        path: "./versions/version-4.3.0/en-US/source",
+        routeBasePath: "en/4.3.0",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-3-0_zh",
+        sidebarPath: "./versions_sidebars/version-4.3.0_zh.ts",
+        path: "./versions/version-4.3.0/zh-CN/source",
+        routeBasePath: "zh/4.3.0",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-2-0_en",
+        sidebarPath: "./versions_sidebars/version-4.2.0_en.ts",
+        path: "./versions/version-4.2.0/en-US/source",
+        routeBasePath: "en/4.2.0",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-2-0_zh",
+        sidebarPath: "./versions_sidebars/version-4.2.0_zh.ts",
+        path: "./versions/version-4.2.0/zh-CN/source",
+        routeBasePath: "zh/4.2.0",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-1-0_en",
+        sidebarPath: "./versions_sidebars/version-4.1.0_en.ts",
+        path: "./versions/version-4.1.0/en-US/source",
+        routeBasePath: "en/4.1.0",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-1-0_zh",
+        sidebarPath: "./versions_sidebars/version-4.1.0_zh.ts",
+        path: "./versions/version-4.1.0/zh-CN/source",
+        routeBasePath: "zh/4.1.0",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-0-1_en",
+        sidebarPath: "./versions_sidebars/version-4.0.1_en.ts",
+        path: "./versions/version-4.0.1/en-US/source",
+        routeBasePath: "en/4.0.1",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "4-0-1_zh",
+        sidebarPath: "./versions_sidebars/version-4.0.1_zh.ts",
+        path: "./versions/version-4.0.1/zh-CN/source",
+        routeBasePath: "zh/4.0.1",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+
+    [
+      "content-docs",
+      {
+        id: "3-6-0_en",
+        sidebarPath: "./versions_sidebars/version-3.6.0_en.ts",
+        path: "./versions/version-3.6.0/en-US/source",
+        routeBasePath: "en/3.6.0",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "3-6-0_zh",
+        sidebarPath: "./versions_sidebars/version-3.6.0_zh.ts",
+        path: "./versions/version-3.6.0/zh-CN/source",
+        routeBasePath: "zh/3.6.0",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "3-5-1_en",
+        sidebarPath: "./versions_sidebars/version-3.5.1_en.ts",
+        path: "./versions/version-3.5.1/en-US/source",
+        routeBasePath: "en/3.5.1",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+    [
+      "content-docs",
+      {
+        id: "3-5-1_zh",
+        sidebarPath: "./versions_sidebars/version-3.5.1_zh.ts",
+        path: "./versions/version-3.5.1/zh-CN/source",
+        routeBasePath: "zh/3.5.1",
+        editCurrentVersion: false,
+      } satisfies DocsOptions,
+    ],
+  ],
+
+  themeConfig: {
+    // Replace with your project's social card‘
+    image: "img/docusaurus-social-card.jpg",
+    tableOfContents: {
+      maxHeadingLevel: 5,
+    },
+    algolia: {
+      apiKey: "829a7e48ddbd6916e159c003391543a0",
+      indexName: "zhongyunwanio",
+      appId: "DGYVABHR0M",
+    },
+    navbar: {
+      logo: {
+        alt: "Tugraph Site Logo",
+        src: "https://mdn.alipayobjects.com/huamei_qcdryc/afts/img/A*AbamQ5lxv0IAAAAAAAAAAAAADgOBAQ/original",
+      },
+      items: [
+        {
+          href: "https://github.com/TuGraph-family/tugraph-db",
+          label: "GitHub",
+          position: "right",
+        },
+      ],
+    },
+    prism: {
+      theme: prismThemes.github,
+      darkTheme: prismThemes.dracula,
+    },
+  } satisfies Preset.ThemeConfig,
+
+  headTags: [
+    {
+      tagName: "meta",
+      attributes: {
+        name: "algolia-site-verification",
+        content: "FC204AA054194DE3",
+      },
+    },
+  ],
+};
+
+export default config;
diff --git a/docs/docusaurus/package-lock.json b/docs/docusaurus/package-lock.json
new file mode 100644
index 0000000000..019d6f79eb
--- /dev/null
+++ b/docs/docusaurus/package-lock.json
@@ -0,0 +1,16697 @@
+{
+  "name": "docusaurus",
+  "version": "0.0.0",
+  "lockfileVersion": 3,
+  "requires": true,
+  "packages": {
+    "": {
+      "name": "docusaurus",
+      "version": "0.0.0",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/preset-classic": "3.5.2",
+        "@mdx-js/react": "^3.0.0",
+        "antd": "^5.21.5",
+        "clsx": "^2.0.0",
+        "fs-extra": "^11.2.0",
+        "prism-react-renderer": "^2.3.0",
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      },
+      "devDependencies": {
+        "@docusaurus/module-type-aliases": "3.5.2",
+        "@docusaurus/tsconfig": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "typescript": "~5.5.2"
+      },
+      "engines": {
+        "node": ">=18.0"
+      }
+    },
+    "node_modules/@algolia/autocomplete-core": {
+      "version": "1.9.3",
+      "resolved": "https://registry.npmmirror.com/@algolia/autocomplete-core/-/autocomplete-core-1.9.3.tgz",
+      "integrity": "sha512-009HdfugtGCdC4JdXUbVJClA0q0zh24yyePn+KUGk3rP7j8FEe/m5Yo/z65gn6nP/cM39PxpzqKrL7A6fP6PPw==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/autocomplete-plugin-algolia-insights": "1.9.3",
+        "@algolia/autocomplete-shared": "1.9.3"
+      }
+    },
+    "node_modules/@algolia/autocomplete-plugin-algolia-insights": {
+      "version": "1.9.3",
+      "resolved": "https://registry.npmmirror.com/@algolia/autocomplete-plugin-algolia-insights/-/autocomplete-plugin-algolia-insights-1.9.3.tgz",
+      "integrity": "sha512-a/yTUkcO/Vyy+JffmAnTWbr4/90cLzw+CC3bRbhnULr/EM0fGNvM13oQQ14f2moLMcVDyAx/leczLlAOovhSZg==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/autocomplete-shared": "1.9.3"
+      },
+      "peerDependencies": {
+        "search-insights": ">= 1 < 3"
+      }
+    },
+    "node_modules/@algolia/autocomplete-preset-algolia": {
+      "version": "1.9.3",
+      "resolved": "https://registry.npmmirror.com/@algolia/autocomplete-preset-algolia/-/autocomplete-preset-algolia-1.9.3.tgz",
+      "integrity": "sha512-d4qlt6YmrLMYy95n5TB52wtNDr6EgAIPH81dvvvW8UmuWRgxEtY0NJiPwl/h95JtG2vmRM804M0DSwMCNZlzRA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/autocomplete-shared": "1.9.3"
+      },
+      "peerDependencies": {
+        "@algolia/client-search": ">= 4.9.1 < 6",
+        "algoliasearch": ">= 4.9.1 < 6"
+      }
+    },
+    "node_modules/@algolia/autocomplete-shared": {
+      "version": "1.9.3",
+      "resolved": "https://registry.npmmirror.com/@algolia/autocomplete-shared/-/autocomplete-shared-1.9.3.tgz",
+      "integrity": "sha512-Wnm9E4Ye6Rl6sTTqjoymD+l8DjSTHsHboVRYrKgEt8Q7UHm9nYbqhN/i0fhUYA3OAEH7WA8x3jfpnmJm3rKvaQ==",
+      "license": "MIT",
+      "peerDependencies": {
+        "@algolia/client-search": ">= 4.9.1 < 6",
+        "algoliasearch": ">= 4.9.1 < 6"
+      }
+    },
+    "node_modules/@algolia/cache-browser-local-storage": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/cache-browser-local-storage/-/cache-browser-local-storage-4.24.0.tgz",
+      "integrity": "sha512-t63W9BnoXVrGy9iYHBgObNXqYXM3tYXCjDSHeNwnsc324r4o5UiVKUiAB4THQ5z9U5hTj6qUvwg/Ez43ZD85ww==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/cache-common": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/cache-common": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/cache-common/-/cache-common-4.24.0.tgz",
+      "integrity": "sha512-emi+v+DmVLpMGhp0V9q9h5CdkURsNmFC+cOS6uK9ndeJm9J4TiqSvPYVu+THUP8P/S08rxf5x2P+p3CfID0Y4g==",
+      "license": "MIT"
+    },
+    "node_modules/@algolia/cache-in-memory": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/cache-in-memory/-/cache-in-memory-4.24.0.tgz",
+      "integrity": "sha512-gDrt2so19jW26jY3/MkFg5mEypFIPbPoXsQGQWAi6TrCPsNOSEYepBMPlucqWigsmEy/prp5ug2jy/N3PVG/8w==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/cache-common": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/client-account": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-account/-/client-account-4.24.0.tgz",
+      "integrity": "sha512-adcvyJ3KjPZFDybxlqnf+5KgxJtBjwTPTeyG2aOyoJvx0Y8dUQAEOEVOJ/GBxX0WWNbmaSrhDURMhc+QeevDsA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/client-common": "4.24.0",
+        "@algolia/client-search": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/client-account/node_modules/@algolia/client-common": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-common/-/client-common-4.24.0.tgz",
+      "integrity": "sha512-bc2ROsNL6w6rqpl5jj/UywlIYC21TwSSoFHKl01lYirGMW+9Eek6r02Tocg4gZ8HAw3iBvu6XQiM3BEbmEMoiA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/client-account/node_modules/@algolia/client-search": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-search/-/client-search-4.24.0.tgz",
+      "integrity": "sha512-uRW6EpNapmLAD0mW47OXqTP8eiIx5F6qN9/x/7HHO6owL3N1IXqydGwW5nhDFBrV+ldouro2W1VX3XlcUXEFCA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/client-common": "4.24.0",
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/client-analytics": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-analytics/-/client-analytics-4.24.0.tgz",
+      "integrity": "sha512-y8jOZt1OjwWU4N2qr8G4AxXAzaa8DBvyHTWlHzX/7Me1LX8OayfgHexqrsL4vSBcoMmVw2XnVW9MhL+Y2ZDJXg==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/client-common": "4.24.0",
+        "@algolia/client-search": "4.24.0",
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/client-analytics/node_modules/@algolia/client-common": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-common/-/client-common-4.24.0.tgz",
+      "integrity": "sha512-bc2ROsNL6w6rqpl5jj/UywlIYC21TwSSoFHKl01lYirGMW+9Eek6r02Tocg4gZ8HAw3iBvu6XQiM3BEbmEMoiA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/client-analytics/node_modules/@algolia/client-search": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-search/-/client-search-4.24.0.tgz",
+      "integrity": "sha512-uRW6EpNapmLAD0mW47OXqTP8eiIx5F6qN9/x/7HHO6owL3N1IXqydGwW5nhDFBrV+ldouro2W1VX3XlcUXEFCA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/client-common": "4.24.0",
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/client-common": {
+      "version": "5.8.1",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-common/-/client-common-5.8.1.tgz",
+      "integrity": "sha512-MLX/gipPFEhJPCExsxXf9tnt+kLfWCe9JWRp1adcoVySkhzPxpIeSiWaQaOqyy0TYIgIpdeVx/emlBT9Ni8GFw==",
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">= 14.0.0"
+      }
+    },
+    "node_modules/@algolia/client-personalization": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-personalization/-/client-personalization-4.24.0.tgz",
+      "integrity": "sha512-l5FRFm/yngztweU0HdUzz1rC4yoWCFo3IF+dVIVTfEPg906eZg5BOd1k0K6rZx5JzyyoP4LdmOikfkfGsKVE9w==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/client-common": "4.24.0",
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/client-personalization/node_modules/@algolia/client-common": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-common/-/client-common-4.24.0.tgz",
+      "integrity": "sha512-bc2ROsNL6w6rqpl5jj/UywlIYC21TwSSoFHKl01lYirGMW+9Eek6r02Tocg4gZ8HAw3iBvu6XQiM3BEbmEMoiA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/client-search": {
+      "version": "5.8.1",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-search/-/client-search-5.8.1.tgz",
+      "integrity": "sha512-zy3P4fI28GfzKihUw5+L76pEedQxyLDiMsdDYEWghIz8yAnELDatPNEThyWuUk8fD0PeVoCi1M4tr1iz00fOtQ==",
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@algolia/client-common": "5.8.1",
+        "@algolia/requester-browser-xhr": "5.8.1",
+        "@algolia/requester-fetch": "5.8.1",
+        "@algolia/requester-node-http": "5.8.1"
+      },
+      "engines": {
+        "node": ">= 14.0.0"
+      }
+    },
+    "node_modules/@algolia/events": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmmirror.com/@algolia/events/-/events-4.0.1.tgz",
+      "integrity": "sha512-FQzvOCgoFXAbf5Y6mYozw2aj5KCJoA3m4heImceldzPSMbdyS4atVjJzXKMsfX3wnZTFYwkkt8/z8UesLHlSBQ==",
+      "license": "MIT"
+    },
+    "node_modules/@algolia/logger-common": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/logger-common/-/logger-common-4.24.0.tgz",
+      "integrity": "sha512-LLUNjkahj9KtKYrQhFKCzMx0BY3RnNP4FEtO+sBybCjJ73E8jNdaKJ/Dd8A/VA4imVHP5tADZ8pn5B8Ga/wTMA==",
+      "license": "MIT"
+    },
+    "node_modules/@algolia/logger-console": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/logger-console/-/logger-console-4.24.0.tgz",
+      "integrity": "sha512-X4C8IoHgHfiUROfoRCV+lzSy+LHMgkoEEU1BbKcsfnV0i0S20zyy0NLww9dwVHUWNfPPxdMU+/wKmLGYf96yTg==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/logger-common": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/recommend": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/recommend/-/recommend-4.24.0.tgz",
+      "integrity": "sha512-P9kcgerfVBpfYHDfVZDvvdJv0lEoCvzNlOy2nykyt5bK8TyieYyiD0lguIJdRZZYGre03WIAFf14pgE+V+IBlw==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/cache-browser-local-storage": "4.24.0",
+        "@algolia/cache-common": "4.24.0",
+        "@algolia/cache-in-memory": "4.24.0",
+        "@algolia/client-common": "4.24.0",
+        "@algolia/client-search": "4.24.0",
+        "@algolia/logger-common": "4.24.0",
+        "@algolia/logger-console": "4.24.0",
+        "@algolia/requester-browser-xhr": "4.24.0",
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/requester-node-http": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/recommend/node_modules/@algolia/client-common": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-common/-/client-common-4.24.0.tgz",
+      "integrity": "sha512-bc2ROsNL6w6rqpl5jj/UywlIYC21TwSSoFHKl01lYirGMW+9Eek6r02Tocg4gZ8HAw3iBvu6XQiM3BEbmEMoiA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/recommend/node_modules/@algolia/client-search": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-search/-/client-search-4.24.0.tgz",
+      "integrity": "sha512-uRW6EpNapmLAD0mW47OXqTP8eiIx5F6qN9/x/7HHO6owL3N1IXqydGwW5nhDFBrV+ldouro2W1VX3XlcUXEFCA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/client-common": "4.24.0",
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/recommend/node_modules/@algolia/requester-browser-xhr": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/requester-browser-xhr/-/requester-browser-xhr-4.24.0.tgz",
+      "integrity": "sha512-Z2NxZMb6+nVXSjF13YpjYTdvV3032YTBSGm2vnYvYPA6mMxzM3v5rsCiSspndn9rzIW4Qp1lPHBvuoKJV6jnAA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/requester-common": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/recommend/node_modules/@algolia/requester-node-http": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/requester-node-http/-/requester-node-http-4.24.0.tgz",
+      "integrity": "sha512-JF18yTjNOVYvU/L3UosRcvbPMGT9B+/GQWNWnenIImglzNVGpyzChkXLnrSf6uxwVNO6ESGu6oN8MqcGQcjQJw==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/requester-common": "4.24.0"
+      }
+    },
+    "node_modules/@algolia/requester-browser-xhr": {
+      "version": "5.8.1",
+      "resolved": "https://registry.npmmirror.com/@algolia/requester-browser-xhr/-/requester-browser-xhr-5.8.1.tgz",
+      "integrity": "sha512-x0iULVrx5PocaYBqH+G6jyEsEHf7m5FDiZW7CP8AaJdzdCzoUyx7YH6e6TSCNlkFEjwmn8uj05coN8uljCHXTg==",
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@algolia/client-common": "5.8.1"
+      },
+      "engines": {
+        "node": ">= 14.0.0"
+      }
+    },
+    "node_modules/@algolia/requester-common": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/requester-common/-/requester-common-4.24.0.tgz",
+      "integrity": "sha512-k3CXJ2OVnvgE3HMwcojpvY6d9kgKMPRxs/kVohrwF5WMr2fnqojnycZkxPoEg+bXm8fi5BBfFmOqgYztRtHsQA==",
+      "license": "MIT"
+    },
+    "node_modules/@algolia/requester-fetch": {
+      "version": "5.8.1",
+      "resolved": "https://registry.npmmirror.com/@algolia/requester-fetch/-/requester-fetch-5.8.1.tgz",
+      "integrity": "sha512-SRWGrNsKSLNYIDNlVKVkf4wxsm6h57xI+0b8JPm0wUe0ly0jymAgQU2yW2GDzNuXyiPiS7U1oWwaVGs71IT5Pw==",
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@algolia/client-common": "5.8.1"
+      },
+      "engines": {
+        "node": ">= 14.0.0"
+      }
+    },
+    "node_modules/@algolia/requester-node-http": {
+      "version": "5.8.1",
+      "resolved": "https://registry.npmmirror.com/@algolia/requester-node-http/-/requester-node-http-5.8.1.tgz",
+      "integrity": "sha512-pYylr2gBsV68E88bltaVoJHIc3YNIllVmA12d+jefAcutR9ytQM7iP6dXbCYuRqF4CHF32YvZuwvqNI3J4kowA==",
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@algolia/client-common": "5.8.1"
+      },
+      "engines": {
+        "node": ">= 14.0.0"
+      }
+    },
+    "node_modules/@algolia/transporter": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/transporter/-/transporter-4.24.0.tgz",
+      "integrity": "sha512-86nI7w6NzWxd1Zp9q3413dRshDqAzSbsQjhcDhPIatEFiZrL1/TjnHL8S7jVKFePlIMzDsZWXAXwXzcok9c5oA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/cache-common": "4.24.0",
+        "@algolia/logger-common": "4.24.0",
+        "@algolia/requester-common": "4.24.0"
+      }
+    },
+    "node_modules/@ampproject/remapping": {
+      "version": "2.3.0",
+      "resolved": "https://registry.npmmirror.com/@ampproject/remapping/-/remapping-2.3.0.tgz",
+      "integrity": "sha512-30iZtAPgz+LTIYoeivqYo853f02jBYSd5uGnGpkFV0M3xOt9aN73erkgYAmZU43x4VfqcnLxW9Kpg3R5LC4YYw==",
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@jridgewell/gen-mapping": "^0.3.5",
+        "@jridgewell/trace-mapping": "^0.3.24"
+      },
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/@ant-design/colors": {
+      "version": "7.1.0",
+      "resolved": "https://registry.npmmirror.com/@ant-design/colors/-/colors-7.1.0.tgz",
+      "integrity": "sha512-MMoDGWn1y9LdQJQSHiCC20x3uZ3CwQnv9QMz6pCmJOrqdgM9YxsoVVY0wtrdXbmfSgnV0KNk6zi09NAhMR2jvg==",
+      "license": "MIT",
+      "dependencies": {
+        "@ctrl/tinycolor": "^3.6.1"
+      }
+    },
+    "node_modules/@ant-design/cssinjs": {
+      "version": "1.21.1",
+      "resolved": "https://registry.npmmirror.com/@ant-design/cssinjs/-/cssinjs-1.21.1.tgz",
+      "integrity": "sha512-tyWnlK+XH7Bumd0byfbCiZNK43HEubMoCcu9VxwsAwiHdHTgWa+tMN0/yvxa+e8EzuFP1WdUNNPclRpVtD33lg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.11.1",
+        "@emotion/hash": "^0.8.0",
+        "@emotion/unitless": "^0.7.5",
+        "classnames": "^2.3.1",
+        "csstype": "^3.1.3",
+        "rc-util": "^5.35.0",
+        "stylis": "^4.3.3"
+      },
+      "peerDependencies": {
+        "react": ">=16.0.0",
+        "react-dom": ">=16.0.0"
+      }
+    },
+    "node_modules/@ant-design/cssinjs-utils": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmmirror.com/@ant-design/cssinjs-utils/-/cssinjs-utils-1.1.1.tgz",
+      "integrity": "sha512-2HAiyGGGnM0es40SxdszeQAU5iWp41wBIInq+ONTCKjlSKOrzQfnw4JDtB8IBmqE6tQaEKwmzTP2LGdt5DSwYQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@ant-design/cssinjs": "^1.21.0",
+        "@babel/runtime": "^7.23.2",
+        "rc-util": "^5.38.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/@ant-design/fast-color": {
+      "version": "2.0.6",
+      "resolved": "https://registry.npmmirror.com/@ant-design/fast-color/-/fast-color-2.0.6.tgz",
+      "integrity": "sha512-y2217gk4NqL35giHl72o6Zzqji9O7vHh9YmhUVkPtAOpoTCH4uWxo/pr4VE8t0+ChEPs0qo4eJRC5Q1eXWo3vA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.24.7"
+      },
+      "engines": {
+        "node": ">=8.x"
+      }
+    },
+    "node_modules/@ant-design/icons": {
+      "version": "5.5.1",
+      "resolved": "https://registry.npmmirror.com/@ant-design/icons/-/icons-5.5.1.tgz",
+      "integrity": "sha512-0UrM02MA2iDIgvLatWrj6YTCYe0F/cwXvVE0E2SqGrL7PZireQwgEKTKBisWpZyal5eXZLvuM98kju6YtYne8w==",
+      "license": "MIT",
+      "dependencies": {
+        "@ant-design/colors": "^7.0.0",
+        "@ant-design/icons-svg": "^4.4.0",
+        "@babel/runtime": "^7.24.8",
+        "classnames": "^2.2.6",
+        "rc-util": "^5.31.1"
+      },
+      "engines": {
+        "node": ">=8"
+      },
+      "peerDependencies": {
+        "react": ">=16.0.0",
+        "react-dom": ">=16.0.0"
+      }
+    },
+    "node_modules/@ant-design/icons-svg": {
+      "version": "4.4.2",
+      "resolved": "https://registry.npmmirror.com/@ant-design/icons-svg/-/icons-svg-4.4.2.tgz",
+      "integrity": "sha512-vHbT+zJEVzllwP+CM+ul7reTEfBR0vgxFe7+lREAsAA7YGsYpboiq2sQNeQeRvh09GfQgs/GyFEvZpJ9cLXpXA==",
+      "license": "MIT"
+    },
+    "node_modules/@ant-design/react-slick": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmmirror.com/@ant-design/react-slick/-/react-slick-1.1.2.tgz",
+      "integrity": "sha512-EzlvzE6xQUBrZuuhSAFTdsr4P2bBBHGZwKFemEfq8gIGyIQCxalYfZW/T2ORbtQx5rU69o+WycP3exY/7T1hGA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.4",
+        "classnames": "^2.2.5",
+        "json2mq": "^0.2.0",
+        "resize-observer-polyfill": "^1.5.1",
+        "throttle-debounce": "^5.0.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0"
+      }
+    },
+    "node_modules/@babel/code-frame": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/code-frame/-/code-frame-7.25.7.tgz",
+      "integrity": "sha512-0xZJFNE5XMpENsgfHYTw8FbX4kv53mFLn2i3XPoq69LyhYSCBJtitaHx9QnsVTrsogI4Z3+HtEfZ2/GFPOtf5g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/highlight": "^7.25.7",
+        "picocolors": "^1.0.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/compat-data": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/compat-data/-/compat-data-7.25.8.tgz",
+      "integrity": "sha512-ZsysZyXY4Tlx+Q53XdnOFmqwfB9QDTHYxaZYajWRoBLuLEAwI2UIbtxOjWh/cFaa9IKUlcB+DDuoskLuKu56JA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/core": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/core/-/core-7.25.8.tgz",
+      "integrity": "sha512-Oixnb+DzmRT30qu9d3tJSQkxuygWm32DFykT4bRoORPa9hZ/L4KhVB/XiRm6KG+roIEM7DBQlmg27kw2HZkdZg==",
+      "license": "MIT",
+      "dependencies": {
+        "@ampproject/remapping": "^2.2.0",
+        "@babel/code-frame": "^7.25.7",
+        "@babel/generator": "^7.25.7",
+        "@babel/helper-compilation-targets": "^7.25.7",
+        "@babel/helper-module-transforms": "^7.25.7",
+        "@babel/helpers": "^7.25.7",
+        "@babel/parser": "^7.25.8",
+        "@babel/template": "^7.25.7",
+        "@babel/traverse": "^7.25.7",
+        "@babel/types": "^7.25.8",
+        "convert-source-map": "^2.0.0",
+        "debug": "^4.1.0",
+        "gensync": "^1.0.0-beta.2",
+        "json5": "^2.2.3",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/babel"
+      }
+    },
+    "node_modules/@babel/core/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmmirror.com/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/generator": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/generator/-/generator-7.25.7.tgz",
+      "integrity": "sha512-5Dqpl5fyV9pIAD62yK9P7fcA768uVPUyrQmqpqstHWgMma4feF1x/oFysBCVZLY5wJ2GkMUCdsNDnGZrPoR6rA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/types": "^7.25.7",
+        "@jridgewell/gen-mapping": "^0.3.5",
+        "@jridgewell/trace-mapping": "^0.3.25",
+        "jsesc": "^3.0.2"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-annotate-as-pure": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-annotate-as-pure/-/helper-annotate-as-pure-7.25.7.tgz",
+      "integrity": "sha512-4xwU8StnqnlIhhioZf1tqnVWeQ9pvH/ujS8hRfw/WOza+/a+1qv69BWNy+oY231maTCWgKWhfBU7kDpsds6zAA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-builder-binary-assignment-operator-visitor": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-builder-binary-assignment-operator-visitor/-/helper-builder-binary-assignment-operator-visitor-7.25.7.tgz",
+      "integrity": "sha512-12xfNeKNH7jubQNm7PAkzlLwEmCs1tfuX3UjIw6vP6QXi+leKh6+LyC/+Ed4EIQermwd58wsyh070yjDHFlNGg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/traverse": "^7.25.7",
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-compilation-targets": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-compilation-targets/-/helper-compilation-targets-7.25.7.tgz",
+      "integrity": "sha512-DniTEax0sv6isaw6qSQSfV4gVRNtw2rte8HHM45t9ZR0xILaufBRNkpMifCRiAPyvL4ACD6v0gfCwCmtOQaV4A==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/compat-data": "^7.25.7",
+        "@babel/helper-validator-option": "^7.25.7",
+        "browserslist": "^4.24.0",
+        "lru-cache": "^5.1.1",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-compilation-targets/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmmirror.com/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/helper-create-class-features-plugin": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.25.7.tgz",
+      "integrity": "sha512-bD4WQhbkx80mAyj/WCm4ZHcF4rDxkoLFO6ph8/5/mQ3z4vAzltQXAmbc7GvVJx5H+lk5Mi5EmbTeox5nMGCsbw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.25.7",
+        "@babel/helper-member-expression-to-functions": "^7.25.7",
+        "@babel/helper-optimise-call-expression": "^7.25.7",
+        "@babel/helper-replace-supers": "^7.25.7",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.25.7",
+        "@babel/traverse": "^7.25.7",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-create-class-features-plugin/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmmirror.com/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/helper-create-regexp-features-plugin": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-create-regexp-features-plugin/-/helper-create-regexp-features-plugin-7.25.7.tgz",
+      "integrity": "sha512-byHhumTj/X47wJ6C6eLpK7wW/WBEcnUeb7D0FNc/jFQnQVw7DOso3Zz5u9x/zLrFVkHa89ZGDbkAa1D54NdrCQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.25.7",
+        "regexpu-core": "^6.1.1",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-create-regexp-features-plugin/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmmirror.com/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/helper-define-polyfill-provider": {
+      "version": "0.6.2",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.6.2.tgz",
+      "integrity": "sha512-LV76g+C502biUK6AyZ3LK10vDpDyCzZnhZFXkH1L75zHPj68+qc8Zfpx2th+gzwA2MzyK+1g/3EPl62yFnVttQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-compilation-targets": "^7.22.6",
+        "@babel/helper-plugin-utils": "^7.22.5",
+        "debug": "^4.1.1",
+        "lodash.debounce": "^4.0.8",
+        "resolve": "^1.14.2"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
+      }
+    },
+    "node_modules/@babel/helper-member-expression-to-functions": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.25.7.tgz",
+      "integrity": "sha512-O31Ssjd5K6lPbTX9AAYpSKrZmLeagt9uwschJd+Ixo6QiRyfpvgtVQp8qrDR9UNFjZ8+DO34ZkdrN+BnPXemeA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/traverse": "^7.25.7",
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-module-imports": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-module-imports/-/helper-module-imports-7.25.7.tgz",
+      "integrity": "sha512-o0xCgpNmRohmnoWKQ0Ij8IdddjyBFE4T2kagL/x6M3+4zUgc+4qTOUBoNe4XxDskt1HPKO007ZPiMgLDq2s7Kw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/traverse": "^7.25.7",
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-module-transforms": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-module-transforms/-/helper-module-transforms-7.25.7.tgz",
+      "integrity": "sha512-k/6f8dKG3yDz/qCwSM+RKovjMix563SLxQFo0UhRNo239SP6n9u5/eLtKD6EAjwta2JHJ49CsD8pms2HdNiMMQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-module-imports": "^7.25.7",
+        "@babel/helper-simple-access": "^7.25.7",
+        "@babel/helper-validator-identifier": "^7.25.7",
+        "@babel/traverse": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-optimise-call-expression": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-optimise-call-expression/-/helper-optimise-call-expression-7.25.7.tgz",
+      "integrity": "sha512-VAwcwuYhv/AT+Vfr28c9y6SHzTan1ryqrydSTFGjU0uDJHw3uZ+PduI8plCLkRsDnqK2DMEDmwrOQRsK/Ykjng==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-plugin-utils": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-plugin-utils/-/helper-plugin-utils-7.25.7.tgz",
+      "integrity": "sha512-eaPZai0PiqCi09pPs3pAFfl/zYgGaE6IdXtYvmf0qlcDTd3WCtO7JWCcRd64e0EQrcYgiHibEZnOGsSY4QSgaw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-remap-async-to-generator": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-remap-async-to-generator/-/helper-remap-async-to-generator-7.25.7.tgz",
+      "integrity": "sha512-kRGE89hLnPfcz6fTrlNU+uhgcwv0mBE4Gv3P9Ke9kLVJYpi4AMVVEElXvB5CabrPZW4nCM8P8UyyjrzCM0O2sw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.25.7",
+        "@babel/helper-wrap-function": "^7.25.7",
+        "@babel/traverse": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-replace-supers": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-replace-supers/-/helper-replace-supers-7.25.7.tgz",
+      "integrity": "sha512-iy8JhqlUW9PtZkd4pHM96v6BdJ66Ba9yWSE4z0W4TvSZwLBPkyDsiIU3ENe4SmrzRBs76F7rQXTy1lYC49n6Lw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-member-expression-to-functions": "^7.25.7",
+        "@babel/helper-optimise-call-expression": "^7.25.7",
+        "@babel/traverse": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-simple-access": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-simple-access/-/helper-simple-access-7.25.7.tgz",
+      "integrity": "sha512-FPGAkJmyoChQeM+ruBGIDyrT2tKfZJO8NcxdC+CWNJi7N8/rZpSxK7yvBJ5O/nF1gfu5KzN7VKG3YVSLFfRSxQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/traverse": "^7.25.7",
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-skip-transparent-expression-wrappers": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-skip-transparent-expression-wrappers/-/helper-skip-transparent-expression-wrappers-7.25.7.tgz",
+      "integrity": "sha512-pPbNbchZBkPMD50K0p3JGcFMNLVUCuU/ABybm/PGNj4JiHrpmNyqqCphBk4i19xXtNV0JhldQJJtbSW5aUvbyA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/traverse": "^7.25.7",
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-string-parser": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-string-parser/-/helper-string-parser-7.25.7.tgz",
+      "integrity": "sha512-CbkjYdsJNHFk8uqpEkpCvRs3YRp9tY6FmFY7wLMSYuGYkrdUi7r2lc4/wqsvlHoMznX3WJ9IP8giGPq68T/Y6g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-validator-identifier": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-validator-identifier/-/helper-validator-identifier-7.25.7.tgz",
+      "integrity": "sha512-AM6TzwYqGChO45oiuPqwL2t20/HdMC1rTPAesnBCgPCSF1x3oN9MVUwQV2iyz4xqWrctwK5RNC8LV22kaQCNYg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-validator-option": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-validator-option/-/helper-validator-option-7.25.7.tgz",
+      "integrity": "sha512-ytbPLsm+GjArDYXJ8Ydr1c/KJuutjF2besPNbIZnZ6MKUxi/uTA22t2ymmA4WFjZFpjiAMO0xuuJPqK2nvDVfQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-wrap-function": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helper-wrap-function/-/helper-wrap-function-7.25.7.tgz",
+      "integrity": "sha512-MA0roW3JF2bD1ptAaJnvcabsVlNQShUaThyJbCDD4bCp8NEgiFvpoqRI2YS22hHlc2thjO/fTg2ShLMC3jygAg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/template": "^7.25.7",
+        "@babel/traverse": "^7.25.7",
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helpers": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/helpers/-/helpers-7.25.7.tgz",
+      "integrity": "sha512-Sv6pASx7Esm38KQpF/U/OXLwPPrdGHNKoeblRxgZRLXnAtnkEe4ptJPDtAZM7fBLadbc1Q07kQpSiGQ0Jg6tRA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/template": "^7.25.7",
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/highlight": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/highlight/-/highlight-7.25.7.tgz",
+      "integrity": "sha512-iYyACpW3iW8Fw+ZybQK+drQre+ns/tKpXbNESfrhNnPLIklLbXr7MYJ6gPEd0iETGLOK+SxMjVvKb/ffmk+FEw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-validator-identifier": "^7.25.7",
+        "chalk": "^2.4.2",
+        "js-tokens": "^4.0.0",
+        "picocolors": "^1.0.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/highlight/node_modules/ansi-styles": {
+      "version": "3.2.1",
+      "resolved": "https://registry.npmmirror.com/ansi-styles/-/ansi-styles-3.2.1.tgz",
+      "integrity": "sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==",
+      "license": "MIT",
+      "dependencies": {
+        "color-convert": "^1.9.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/@babel/highlight/node_modules/chalk": {
+      "version": "2.4.2",
+      "resolved": "https://registry.npmmirror.com/chalk/-/chalk-2.4.2.tgz",
+      "integrity": "sha512-Mti+f9lpJNcwF4tWV8/OrTTtF1gZi+f8FqlyAdouralcFWFQWF2+NgCHShjkCb+IFBLq9buZwE1xckQU4peSuQ==",
+      "license": "MIT",
+      "dependencies": {
+        "ansi-styles": "^3.2.1",
+        "escape-string-regexp": "^1.0.5",
+        "supports-color": "^5.3.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/@babel/highlight/node_modules/color-convert": {
+      "version": "1.9.3",
+      "resolved": "https://registry.npmmirror.com/color-convert/-/color-convert-1.9.3.tgz",
+      "integrity": "sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==",
+      "license": "MIT",
+      "dependencies": {
+        "color-name": "1.1.3"
+      }
+    },
+    "node_modules/@babel/highlight/node_modules/color-name": {
+      "version": "1.1.3",
+      "resolved": "https://registry.npmmirror.com/color-name/-/color-name-1.1.3.tgz",
+      "integrity": "sha512-72fSenhMw2HZMTVHeCA9KCmpEIbzWiQsjN+BHcBbS9vr1mtt+vJjPdksIBNUmKAW8TFUDPJK5SUU3QhE9NEXDw==",
+      "license": "MIT"
+    },
+    "node_modules/@babel/highlight/node_modules/escape-string-regexp": {
+      "version": "1.0.5",
+      "resolved": "https://registry.npmmirror.com/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz",
+      "integrity": "sha512-vbRorB5FUQWvla16U8R/qgaFIya2qGzwDrNmCZuYKrbdSUMG6I1ZCGQRefkRVhuOkIGVne7BQ35DSfo1qvJqFg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.8.0"
+      }
+    },
+    "node_modules/@babel/highlight/node_modules/has-flag": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/has-flag/-/has-flag-3.0.0.tgz",
+      "integrity": "sha512-sKJf1+ceQBr4SMkvQnBDNDtf4TXpVhVGateu0t918bl30FnbE2m4vNLX+VWe/dpjlb+HugGYzW7uQXH98HPEYw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/@babel/highlight/node_modules/supports-color": {
+      "version": "5.5.0",
+      "resolved": "https://registry.npmmirror.com/supports-color/-/supports-color-5.5.0.tgz",
+      "integrity": "sha512-QjVjwdXIt408MIiAqCX4oUKsgU2EqAGzs2Ppkm4aQYbjm+ZEWEcW4SfFNTr4uMNZma0ey4f5lgLrkB0aX0QMow==",
+      "license": "MIT",
+      "dependencies": {
+        "has-flag": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/@babel/parser": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/parser/-/parser-7.25.8.tgz",
+      "integrity": "sha512-HcttkxzdPucv3nNFmfOOMfFf64KgdJVqm1KaCm25dPGMLElo9nsLvXeJECQg8UzPuBGLyTSA0ZzqCtDSzKTEoQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/types": "^7.25.8"
+      },
+      "bin": {
+        "parser": "bin/babel-parser.js"
+      },
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-firefox-class-in-computed-class-key": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-bugfix-firefox-class-in-computed-class-key/-/plugin-bugfix-firefox-class-in-computed-class-key-7.25.7.tgz",
+      "integrity": "sha512-UV9Lg53zyebzD1DwQoT9mzkEKa922LNUp5YkTJ6Uta0RbyXaQNUgcvSt7qIu1PpPzVb6rd10OVNTzkyBGeVmxQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/traverse": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-safari-class-field-initializer-scope": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-bugfix-safari-class-field-initializer-scope/-/plugin-bugfix-safari-class-field-initializer-scope-7.25.7.tgz",
+      "integrity": "sha512-GDDWeVLNxRIkQTnJn2pDOM1pkCgYdSqPeT1a9vh9yIqu2uzzgw1zcqEb+IJOhy+dTBMlNdThrDIksr2o09qrrQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.25.7.tgz",
+      "integrity": "sha512-wxyWg2RYaSUYgmd9MR0FyRGyeOMQE/Uzr1wzd/g5cf5bwi9A4v6HFdDm7y1MgDtod/fLOSTZY6jDgV0xU9d5bA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.25.7.tgz",
+      "integrity": "sha512-Xwg6tZpLxc4iQjorYsyGMyfJE7nP5MV8t/Ka58BgiA7Jw0fRqQNcANlLfdJ/yvBt9z9LD2We+BEkT7vLqZRWng==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.25.7",
+        "@babel/plugin-transform-optional-chaining": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.13.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.25.7.tgz",
+      "integrity": "sha512-UVATLMidXrnH+GMUIuxq55nejlj02HP7F5ETyBONzP6G87fPBogG4CH6kxrSrdIuAjdwNO9VzyaYsrZPscWUrw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/traverse": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-proposal-private-property-in-object": {
+      "version": "7.21.0-placeholder-for-preset-env.2",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-proposal-private-property-in-object/-/plugin-proposal-private-property-in-object-7.21.0-placeholder-for-preset-env.2.tgz",
+      "integrity": "sha512-SOSkfJDddaM7mak6cPEpswyTRnuRltl429hMraQEglW+OkovnCzsiszTmsrlY//qLFjCpQDFRvjdm2wA5pPm9w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-syntax-dynamic-import": {
+      "version": "7.8.3",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-syntax-dynamic-import/-/plugin-syntax-dynamic-import-7.8.3.tgz",
+      "integrity": "sha512-5gdGbFon+PszYzqs83S3E5mpi7/y/8M9eC90MRTZfduQOYW76ig6SOSPNe41IG5LoP3FGBn2N0RjVDSQiS94kQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.8.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-syntax-import-assertions": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.25.7.tgz",
+      "integrity": "sha512-ZvZQRmME0zfJnDQnVBKYzHxXT7lYBB3Revz1GuS7oLXWMgqUPX4G+DDbT30ICClht9WKV34QVrZhSw6WdklwZQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-syntax-import-attributes": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.25.7.tgz",
+      "integrity": "sha512-AqVo+dguCgmpi/3mYBdu9lkngOBlQ2w2vnNpa6gfiCxQZLzV4ZbhsXitJ2Yblkoe1VQwtHSaNmIaGll/26YWRw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-syntax-jsx": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-syntax-jsx/-/plugin-syntax-jsx-7.25.7.tgz",
+      "integrity": "sha512-ruZOnKO+ajVL/MVx+PwNBPOkrnXTXoWMtte1MBpegfCArhqOe3Bj52avVj1huLLxNKYKXYaSxZ2F+woK1ekXfw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-syntax-typescript": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-syntax-typescript/-/plugin-syntax-typescript-7.25.7.tgz",
+      "integrity": "sha512-rR+5FDjpCHqqZN2bzZm18bVYGaejGq5ZkpVCJLXor/+zlSrSoc4KWcHI0URVWjl/68Dyr1uwZUz/1njycEAv9g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-syntax-unicode-sets-regex": {
+      "version": "7.18.6",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-syntax-unicode-sets-regex/-/plugin-syntax-unicode-sets-regex-7.18.6.tgz",
+      "integrity": "sha512-727YkEAPwSIQTv5im8QHz3upqp92JTWhidIC81Tdx4VJYIte/VndKf1qKrfnnhPLiPghStWfvC/iFaMCQu7Nqg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.18.6",
+        "@babel/helper-plugin-utils": "^7.18.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-arrow-functions": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.25.7.tgz",
+      "integrity": "sha512-EJN2mKxDwfOUCPxMO6MUI58RN3ganiRAG/MS/S3HfB6QFNjroAMelQo/gybyYq97WerCBAZoyrAoW8Tzdq2jWg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-async-generator-functions": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.25.8.tgz",
+      "integrity": "sha512-9ypqkozyzpG+HxlH4o4gdctalFGIjjdufzo7I2XPda0iBnZ6a+FO0rIEQcdSPXp02CkvGsII1exJhmROPQd5oA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-remap-async-to-generator": "^7.25.7",
+        "@babel/traverse": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-async-to-generator": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.25.7.tgz",
+      "integrity": "sha512-ZUCjAavsh5CESCmi/xCpX1qcCaAglzs/7tmuvoFnJgA1dM7gQplsguljoTg+Ru8WENpX89cQyAtWoaE0I3X3Pg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-module-imports": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-remap-async-to-generator": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-block-scoped-functions": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.25.7.tgz",
+      "integrity": "sha512-xHttvIM9fvqW+0a3tZlYcZYSBpSWzGBFIt/sYG3tcdSzBB8ZeVgz2gBP7Df+sM0N1850jrviYSSeUuc+135dmQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-block-scoping": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.25.7.tgz",
+      "integrity": "sha512-ZEPJSkVZaeTFG/m2PARwLZQ+OG0vFIhPlKHK/JdIMy8DbRJ/htz6LRrTFtdzxi9EHmcwbNPAKDnadpNSIW+Aow==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-class-properties": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.25.7.tgz",
+      "integrity": "sha512-mhyfEW4gufjIqYFo9krXHJ3ElbFLIze5IDp+wQTxoPd+mwFb1NxatNAwmv8Q8Iuxv7Zc+q8EkiMQwc9IhyGf4g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-class-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-class-static-block": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.25.8.tgz",
+      "integrity": "sha512-e82gl3TCorath6YLf9xUwFehVvjvfqFhdOo4+0iVIVju+6XOi5XHkqB3P2AXnSwoeTX0HBoXq5gJFtvotJzFnQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-class-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.12.0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-classes": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-classes/-/plugin-transform-classes-7.25.7.tgz",
+      "integrity": "sha512-9j9rnl+YCQY0IGoeipXvnk3niWicIB6kCsWRGLwX241qSXpbA4MKxtp/EdvFxsc4zI5vqfLxzOd0twIJ7I99zg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.25.7",
+        "@babel/helper-compilation-targets": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-replace-supers": "^7.25.7",
+        "@babel/traverse": "^7.25.7",
+        "globals": "^11.1.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-computed-properties": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.25.7.tgz",
+      "integrity": "sha512-QIv+imtM+EtNxg/XBKL3hiWjgdLjMOmZ+XzQwSgmBfKbfxUjBzGgVPklUuE55eq5/uVoh8gg3dqlrwR/jw3ZeA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/template": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-destructuring": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.25.7.tgz",
+      "integrity": "sha512-xKcfLTlJYUczdaM1+epcdh1UGewJqr9zATgrNHcLBcV2QmfvPPEixo/sK/syql9cEmbr7ulu5HMFG5vbbt/sEA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-dotall-regex": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.25.7.tgz",
+      "integrity": "sha512-kXzXMMRzAtJdDEgQBLF4oaiT6ZCU3oWHgpARnTKDAqPkDJ+bs3NrZb310YYevR5QlRo3Kn7dzzIdHbZm1VzJdQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-duplicate-keys": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.25.7.tgz",
+      "integrity": "sha512-by+v2CjoL3aMnWDOyCIg+yxU9KXSRa9tN6MbqggH5xvymmr9p4AMjYkNlQy4brMceBnUyHZ9G8RnpvT8wP7Cfg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-duplicate-named-capturing-groups-regex": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-duplicate-named-capturing-groups-regex/-/plugin-transform-duplicate-named-capturing-groups-regex-7.25.7.tgz",
+      "integrity": "sha512-HvS6JF66xSS5rNKXLqkk7L9c/jZ/cdIVIcoPVrnl8IsVpLggTjXs8OWekbLHs/VtYDDh5WXnQyeE3PPUGm22MA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-dynamic-import": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.25.8.tgz",
+      "integrity": "sha512-gznWY+mr4ZQL/EWPcbBQUP3BXS5FwZp8RUOw06BaRn8tQLzN4XLIxXejpHN9Qo8x8jjBmAAKp6FoS51AgkSA/A==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-exponentiation-operator": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.25.7.tgz",
+      "integrity": "sha512-yjqtpstPfZ0h/y40fAXRv2snciYr0OAoMXY/0ClC7tm4C/nG5NJKmIItlaYlLbIVAWNfrYuy9dq1bE0SbX0PEg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-builder-binary-assignment-operator-visitor": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-export-namespace-from": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.25.8.tgz",
+      "integrity": "sha512-sPtYrduWINTQTW7FtOy99VCTWp4H23UX7vYcut7S4CIMEXU+54zKX9uCoGkLsWXteyaMXzVHgzWbLfQ1w4GZgw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-for-of": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.25.7.tgz",
+      "integrity": "sha512-n/TaiBGJxYFWvpJDfsxSj9lEEE44BFM1EPGz4KEiTipTgkoFVVcCmzAL3qA7fdQU96dpo4gGf5HBx/KnDvqiHw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-function-name": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.25.7.tgz",
+      "integrity": "sha512-5MCTNcjCMxQ63Tdu9rxyN6cAWurqfrDZ76qvVPrGYdBxIj+EawuuxTu/+dgJlhK5eRz3v1gLwp6XwS8XaX2NiQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-compilation-targets": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/traverse": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-json-strings": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.25.8.tgz",
+      "integrity": "sha512-4OMNv7eHTmJ2YXs3tvxAfa/I43di+VcF+M4Wt66c88EAED1RoGaf1D64cL5FkRpNL+Vx9Hds84lksWvd/wMIdA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-literals": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-literals/-/plugin-transform-literals-7.25.7.tgz",
+      "integrity": "sha512-fwzkLrSu2fESR/cm4t6vqd7ebNIopz2QHGtjoU+dswQo/P6lwAG04Q98lliE3jkz/XqnbGFLnUcE0q0CVUf92w==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-logical-assignment-operators": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.25.8.tgz",
+      "integrity": "sha512-f5W0AhSbbI+yY6VakT04jmxdxz+WsID0neG7+kQZbCOjuyJNdL5Nn4WIBm4hRpKnUcO9lP0eipUhFN12JpoH8g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-member-expression-literals": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.25.7.tgz",
+      "integrity": "sha512-Std3kXwpXfRV0QtQy5JJcRpkqP8/wG4XL7hSKZmGlxPlDqmpXtEPRmhF7ztnlTCtUN3eXRUJp+sBEZjaIBVYaw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-modules-amd": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.25.7.tgz",
+      "integrity": "sha512-CgselSGCGzjQvKzghCvDTxKHP3iooenLpJDO842ehn5D2G5fJB222ptnDwQho0WjEvg7zyoxb9P+wiYxiJX5yA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-module-transforms": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-modules-commonjs": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.25.7.tgz",
+      "integrity": "sha512-L9Gcahi0kKFYXvweO6n0wc3ZG1ChpSFdgG+eV1WYZ3/dGbJK7vvk91FgGgak8YwRgrCuihF8tE/Xg07EkL5COg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-module-transforms": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-simple-access": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-modules-systemjs": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.25.7.tgz",
+      "integrity": "sha512-t9jZIvBmOXJsiuyOwhrIGs8dVcD6jDyg2icw1VL4A/g+FnWyJKwUfSSU2nwJuMV2Zqui856El9u+ElB+j9fV1g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-module-transforms": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-validator-identifier": "^7.25.7",
+        "@babel/traverse": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-modules-umd": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.25.7.tgz",
+      "integrity": "sha512-p88Jg6QqsaPh+EB7I9GJrIqi1Zt4ZBHUQtjw3z1bzEXcLh6GfPqzZJ6G+G1HBGKUNukT58MnKG7EN7zXQBCODw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-module-transforms": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-named-capturing-groups-regex": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-named-capturing-groups-regex/-/plugin-transform-named-capturing-groups-regex-7.25.7.tgz",
+      "integrity": "sha512-BtAT9LzCISKG3Dsdw5uso4oV1+v2NlVXIIomKJgQybotJY3OwCwJmkongjHgwGKoZXd0qG5UZ12JUlDQ07W6Ow==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-new-target": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.25.7.tgz",
+      "integrity": "sha512-CfCS2jDsbcZaVYxRFo2qtavW8SpdzmBXC2LOI4oO0rP+JSRDxxF3inF4GcPsLgfb5FjkhXG5/yR/lxuRs2pySA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-nullish-coalescing-operator": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.25.8.tgz",
+      "integrity": "sha512-Z7WJJWdQc8yCWgAmjI3hyC+5PXIubH9yRKzkl9ZEG647O9szl9zvmKLzpbItlijBnVhTUf1cpyWBsZ3+2wjWPQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-numeric-separator": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.25.8.tgz",
+      "integrity": "sha512-rm9a5iEFPS4iMIy+/A/PiS0QN0UyjPIeVvbU5EMZFKJZHt8vQnasbpo3T3EFcxzCeYO0BHfc4RqooCZc51J86Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-object-rest-spread": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.25.8.tgz",
+      "integrity": "sha512-LkUu0O2hnUKHKE7/zYOIjByMa4VRaV2CD/cdGz0AxU9we+VA3kDDggKEzI0Oz1IroG+6gUP6UmWEHBMWZU316g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-compilation-targets": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/plugin-transform-parameters": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-object-super": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.25.7.tgz",
+      "integrity": "sha512-pWT6UXCEW3u1t2tcAGtE15ornCBvopHj9Bps9D2DsH15APgNVOTwwczGckX+WkAvBmuoYKRCFa4DK+jM8vh5AA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-replace-supers": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-optional-catch-binding": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.25.8.tgz",
+      "integrity": "sha512-EbQYweoMAHOn7iJ9GgZo14ghhb9tTjgOc88xFgYngifx7Z9u580cENCV159M4xDh3q/irbhSjZVpuhpC2gKBbg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-optional-chaining": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.25.8.tgz",
+      "integrity": "sha512-q05Bk7gXOxpTHoQ8RSzGSh/LHVB9JEIkKnk3myAWwZHnYiTGYtbdrYkIsS8Xyh4ltKf7GNUSgzs/6P2bJtBAQg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-parameters": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.25.7.tgz",
+      "integrity": "sha512-FYiTvku63me9+1Nz7TOx4YMtW3tWXzfANZtrzHhUZrz4d47EEtMQhzFoZWESfXuAMMT5mwzD4+y1N8ONAX6lMQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-private-methods": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.25.7.tgz",
+      "integrity": "sha512-KY0hh2FluNxMLwOCHbxVOKfdB5sjWG4M183885FmaqWWiGMhRZq4DQRKH6mHdEucbJnyDyYiZNwNG424RymJjA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-class-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-private-property-in-object": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.25.8.tgz",
+      "integrity": "sha512-8Uh966svuB4V8RHHg0QJOB32QK287NBksJOByoKmHMp1TAobNniNalIkI2i5IPj5+S9NYCG4VIjbEuiSN8r+ow==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.25.7",
+        "@babel/helper-create-class-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-property-literals": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.25.7.tgz",
+      "integrity": "sha512-lQEeetGKfFi0wHbt8ClQrUSUMfEeI3MMm74Z73T9/kuz990yYVtfofjf3NuA42Jy3auFOpbjDyCSiIkTs1VIYw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-react-constant-elements": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-react-constant-elements/-/plugin-transform-react-constant-elements-7.25.7.tgz",
+      "integrity": "sha512-/qXt69Em8HgsjCLu7G3zdIQn7A2QwmYND7Wa0LTp09Na+Zn8L5d0A7wSXrKi18TJRc/Q5S1i1De/SU1LzVkSvA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-react-display-name": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-react-display-name/-/plugin-transform-react-display-name-7.25.7.tgz",
+      "integrity": "sha512-r0QY7NVU8OnrwE+w2IWiRom0wwsTbjx4+xH2RTd7AVdof3uurXOF+/mXHQDRk+2jIvWgSaCHKMgggfvM4dyUGA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-react-jsx": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-react-jsx/-/plugin-transform-react-jsx-7.25.7.tgz",
+      "integrity": "sha512-vILAg5nwGlR9EXE8JIOX4NHXd49lrYbN8hnjffDtoULwpL9hUx/N55nqh2qd0q6FyNDfjl9V79ecKGvFbcSA0Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.25.7",
+        "@babel/helper-module-imports": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/plugin-syntax-jsx": "^7.25.7",
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-react-jsx-development": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-react-jsx-development/-/plugin-transform-react-jsx-development-7.25.7.tgz",
+      "integrity": "sha512-5yd3lH1PWxzW6IZj+p+Y4OLQzz0/LzlOG8vGqonHfVR3euf1vyzyMUJk9Ac+m97BH46mFc/98t9PmYLyvgL3qg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/plugin-transform-react-jsx": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-react-pure-annotations": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-react-pure-annotations/-/plugin-transform-react-pure-annotations-7.25.7.tgz",
+      "integrity": "sha512-6YTHJ7yjjgYqGc8S+CbEXhLICODk0Tn92j+vNJo07HFk9t3bjFgAKxPLFhHwF2NjmQVSI1zBRfBWUeVBa2osfA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-regenerator": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.25.7.tgz",
+      "integrity": "sha512-mgDoQCRjrY3XK95UuV60tZlFCQGXEtMg8H+IsW72ldw1ih1jZhzYXbJvghmAEpg5UVhhnCeia1CkGttUvCkiMQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "regenerator-transform": "^0.15.2"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-reserved-words": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.25.7.tgz",
+      "integrity": "sha512-3OfyfRRqiGeOvIWSagcwUTVk2hXBsr/ww7bLn6TRTuXnexA+Udov2icFOxFX9abaj4l96ooYkcNN1qi2Zvqwng==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-runtime": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-runtime/-/plugin-transform-runtime-7.25.7.tgz",
+      "integrity": "sha512-Y9p487tyTzB0yDYQOtWnC+9HGOuogtP3/wNpun1xJXEEvI6vip59BSBTsHnekZLqxmPcgsrAKt46HAAb//xGhg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-module-imports": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "babel-plugin-polyfill-corejs2": "^0.4.10",
+        "babel-plugin-polyfill-corejs3": "^0.10.6",
+        "babel-plugin-polyfill-regenerator": "^0.6.1",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-runtime/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmmirror.com/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/plugin-transform-shorthand-properties": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.25.7.tgz",
+      "integrity": "sha512-uBbxNwimHi5Bv3hUccmOFlUy3ATO6WagTApenHz9KzoIdn0XeACdB12ZJ4cjhuB2WSi80Ez2FWzJnarccriJeA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-spread": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-spread/-/plugin-transform-spread-7.25.7.tgz",
+      "integrity": "sha512-Mm6aeymI0PBh44xNIv/qvo8nmbkpZze1KvR8MkEqbIREDxoiWTi18Zr2jryfRMwDfVZF9foKh060fWgni44luw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-sticky-regex": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.25.7.tgz",
+      "integrity": "sha512-ZFAeNkpGuLnAQ/NCsXJ6xik7Id+tHuS+NT+ue/2+rn/31zcdnupCdmunOizEaP0JsUmTFSTOPoQY7PkK2pttXw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-template-literals": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.25.7.tgz",
+      "integrity": "sha512-SI274k0nUsFFmyQupiO7+wKATAmMFf8iFgq2O+vVFXZ0SV9lNfT1NGzBEhjquFmD8I9sqHLguH+gZVN3vww2AA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-typeof-symbol": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.25.7.tgz",
+      "integrity": "sha512-OmWmQtTHnO8RSUbL0NTdtpbZHeNTnm68Gj5pA4Y2blFNh+V4iZR68V1qL9cI37J21ZN7AaCnkfdHtLExQPf2uA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-typescript": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-typescript/-/plugin-transform-typescript-7.25.7.tgz",
+      "integrity": "sha512-VKlgy2vBzj8AmEzunocMun2fF06bsSWV+FvVXohtL6FGve/+L217qhHxRTVGHEDO/YR8IANcjzgJsd04J8ge5Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.25.7",
+        "@babel/helper-create-class-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.25.7",
+        "@babel/plugin-syntax-typescript": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-unicode-escapes": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.25.7.tgz",
+      "integrity": "sha512-BN87D7KpbdiABA+t3HbVqHzKWUDN3dymLaTnPFAMyc8lV+KN3+YzNhVRNdinaCPA4AUqx7ubXbQ9shRjYBl3SQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-unicode-property-regex": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.25.7.tgz",
+      "integrity": "sha512-IWfR89zcEPQGB/iB408uGtSPlQd3Jpq11Im86vUgcmSTcoWAiQMCTOa2K2yNNqFJEBVICKhayctee65Ka8OB0w==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-unicode-regex": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.25.7.tgz",
+      "integrity": "sha512-8JKfg/hiuA3qXnlLx8qtv5HWRbgyFx2hMMtpDDuU2rTckpKkGu4ycK5yYHwuEa16/quXfoxHBIApEsNyMWnt0g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-unicode-sets-regex": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.25.7.tgz",
+      "integrity": "sha512-YRW8o9vzImwmh4Q3Rffd09bH5/hvY0pxg+1H1i0f7APoUeg12G7+HhLj9ZFNIrYkgBXhIijPJ+IXypN0hLTIbw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/preset-env": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/preset-env/-/preset-env-7.25.8.tgz",
+      "integrity": "sha512-58T2yulDHMN8YMUxiLq5YmWUnlDCyY1FsHM+v12VMx+1/FlrUj5tY50iDCpofFQEM8fMYOaY9YRvym2jcjn1Dg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/compat-data": "^7.25.8",
+        "@babel/helper-compilation-targets": "^7.25.7",
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-validator-option": "^7.25.7",
+        "@babel/plugin-bugfix-firefox-class-in-computed-class-key": "^7.25.7",
+        "@babel/plugin-bugfix-safari-class-field-initializer-scope": "^7.25.7",
+        "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.25.7",
+        "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.25.7",
+        "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.25.7",
+        "@babel/plugin-proposal-private-property-in-object": "7.21.0-placeholder-for-preset-env.2",
+        "@babel/plugin-syntax-import-assertions": "^7.25.7",
+        "@babel/plugin-syntax-import-attributes": "^7.25.7",
+        "@babel/plugin-syntax-unicode-sets-regex": "^7.18.6",
+        "@babel/plugin-transform-arrow-functions": "^7.25.7",
+        "@babel/plugin-transform-async-generator-functions": "^7.25.8",
+        "@babel/plugin-transform-async-to-generator": "^7.25.7",
+        "@babel/plugin-transform-block-scoped-functions": "^7.25.7",
+        "@babel/plugin-transform-block-scoping": "^7.25.7",
+        "@babel/plugin-transform-class-properties": "^7.25.7",
+        "@babel/plugin-transform-class-static-block": "^7.25.8",
+        "@babel/plugin-transform-classes": "^7.25.7",
+        "@babel/plugin-transform-computed-properties": "^7.25.7",
+        "@babel/plugin-transform-destructuring": "^7.25.7",
+        "@babel/plugin-transform-dotall-regex": "^7.25.7",
+        "@babel/plugin-transform-duplicate-keys": "^7.25.7",
+        "@babel/plugin-transform-duplicate-named-capturing-groups-regex": "^7.25.7",
+        "@babel/plugin-transform-dynamic-import": "^7.25.8",
+        "@babel/plugin-transform-exponentiation-operator": "^7.25.7",
+        "@babel/plugin-transform-export-namespace-from": "^7.25.8",
+        "@babel/plugin-transform-for-of": "^7.25.7",
+        "@babel/plugin-transform-function-name": "^7.25.7",
+        "@babel/plugin-transform-json-strings": "^7.25.8",
+        "@babel/plugin-transform-literals": "^7.25.7",
+        "@babel/plugin-transform-logical-assignment-operators": "^7.25.8",
+        "@babel/plugin-transform-member-expression-literals": "^7.25.7",
+        "@babel/plugin-transform-modules-amd": "^7.25.7",
+        "@babel/plugin-transform-modules-commonjs": "^7.25.7",
+        "@babel/plugin-transform-modules-systemjs": "^7.25.7",
+        "@babel/plugin-transform-modules-umd": "^7.25.7",
+        "@babel/plugin-transform-named-capturing-groups-regex": "^7.25.7",
+        "@babel/plugin-transform-new-target": "^7.25.7",
+        "@babel/plugin-transform-nullish-coalescing-operator": "^7.25.8",
+        "@babel/plugin-transform-numeric-separator": "^7.25.8",
+        "@babel/plugin-transform-object-rest-spread": "^7.25.8",
+        "@babel/plugin-transform-object-super": "^7.25.7",
+        "@babel/plugin-transform-optional-catch-binding": "^7.25.8",
+        "@babel/plugin-transform-optional-chaining": "^7.25.8",
+        "@babel/plugin-transform-parameters": "^7.25.7",
+        "@babel/plugin-transform-private-methods": "^7.25.7",
+        "@babel/plugin-transform-private-property-in-object": "^7.25.8",
+        "@babel/plugin-transform-property-literals": "^7.25.7",
+        "@babel/plugin-transform-regenerator": "^7.25.7",
+        "@babel/plugin-transform-reserved-words": "^7.25.7",
+        "@babel/plugin-transform-shorthand-properties": "^7.25.7",
+        "@babel/plugin-transform-spread": "^7.25.7",
+        "@babel/plugin-transform-sticky-regex": "^7.25.7",
+        "@babel/plugin-transform-template-literals": "^7.25.7",
+        "@babel/plugin-transform-typeof-symbol": "^7.25.7",
+        "@babel/plugin-transform-unicode-escapes": "^7.25.7",
+        "@babel/plugin-transform-unicode-property-regex": "^7.25.7",
+        "@babel/plugin-transform-unicode-regex": "^7.25.7",
+        "@babel/plugin-transform-unicode-sets-regex": "^7.25.7",
+        "@babel/preset-modules": "0.1.6-no-external-plugins",
+        "babel-plugin-polyfill-corejs2": "^0.4.10",
+        "babel-plugin-polyfill-corejs3": "^0.10.6",
+        "babel-plugin-polyfill-regenerator": "^0.6.1",
+        "core-js-compat": "^3.38.1",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/preset-env/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmmirror.com/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/preset-modules": {
+      "version": "0.1.6-no-external-plugins",
+      "resolved": "https://registry.npmmirror.com/@babel/preset-modules/-/preset-modules-0.1.6-no-external-plugins.tgz",
+      "integrity": "sha512-HrcgcIESLm9aIR842yhJ5RWan/gebQUJ6E/E5+rf0y9o6oj7w0Br+sWuL6kEQ/o/AdfvR1Je9jG18/gnpwjEyA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.0.0",
+        "@babel/types": "^7.4.4",
+        "esutils": "^2.0.2"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0 || ^8.0.0-0 <8.0.0"
+      }
+    },
+    "node_modules/@babel/preset-react": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/preset-react/-/preset-react-7.25.7.tgz",
+      "integrity": "sha512-GjV0/mUEEXpi1U5ZgDprMRRgajGMRW3G5FjMr5KLKD8nT2fTG8+h/klV3+6Dm5739QE+K5+2e91qFKAYI3pmRg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-validator-option": "^7.25.7",
+        "@babel/plugin-transform-react-display-name": "^7.25.7",
+        "@babel/plugin-transform-react-jsx": "^7.25.7",
+        "@babel/plugin-transform-react-jsx-development": "^7.25.7",
+        "@babel/plugin-transform-react-pure-annotations": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/preset-typescript": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/preset-typescript/-/preset-typescript-7.25.7.tgz",
+      "integrity": "sha512-rkkpaXJZOFN45Fb+Gki0c+KMIglk4+zZXOoMJuyEK8y8Kkc8Jd3BDmP7qPsz0zQMJj+UD7EprF+AqAXcILnexw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.25.7",
+        "@babel/helper-validator-option": "^7.25.7",
+        "@babel/plugin-syntax-jsx": "^7.25.7",
+        "@babel/plugin-transform-modules-commonjs": "^7.25.7",
+        "@babel/plugin-transform-typescript": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/runtime": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/runtime/-/runtime-7.25.7.tgz",
+      "integrity": "sha512-FjoyLe754PMiYsFaN5C94ttGiOmBNYTf6pLr4xXHAT5uctHb092PBszndLDR5XA/jghQvn4n7JMHl7dmTgbm9w==",
+      "license": "MIT",
+      "dependencies": {
+        "regenerator-runtime": "^0.14.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/runtime-corejs3": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/runtime-corejs3/-/runtime-corejs3-7.25.7.tgz",
+      "integrity": "sha512-gMmIEhg35sXk9Te5qbGp3W9YKrvLt3HV658/d3odWrHSqT0JeG5OzsJWFHRLiOohRyjRsJc/x03DhJm3i8VJxg==",
+      "license": "MIT",
+      "dependencies": {
+        "core-js-pure": "^3.30.2",
+        "regenerator-runtime": "^0.14.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/template": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/template/-/template-7.25.7.tgz",
+      "integrity": "sha512-wRwtAgI3bAS+JGU2upWNL9lSlDcRCqD05BZ1n3X2ONLH1WilFP6O1otQjeMK/1g0pvYcXC7b/qVUB1keofjtZA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/code-frame": "^7.25.7",
+        "@babel/parser": "^7.25.7",
+        "@babel/types": "^7.25.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/traverse": {
+      "version": "7.25.7",
+      "resolved": "https://registry.npmmirror.com/@babel/traverse/-/traverse-7.25.7.tgz",
+      "integrity": "sha512-jatJPT1Zjqvh/1FyJs6qAHL+Dzb7sTb+xr7Q+gM1b+1oBsMsQQ4FkVKb6dFlJvLlVssqkRzV05Jzervt9yhnzg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/code-frame": "^7.25.7",
+        "@babel/generator": "^7.25.7",
+        "@babel/parser": "^7.25.7",
+        "@babel/template": "^7.25.7",
+        "@babel/types": "^7.25.7",
+        "debug": "^4.3.1",
+        "globals": "^11.1.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/types": {
+      "version": "7.25.8",
+      "resolved": "https://registry.npmmirror.com/@babel/types/-/types-7.25.8.tgz",
+      "integrity": "sha512-JWtuCu8VQsMladxVz/P4HzHUGCAwpuqacmowgXFs5XjxIgKuNjnLokQzuVjlTvIzODaDmpjT3oxcC48vyk9EWg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-string-parser": "^7.25.7",
+        "@babel/helper-validator-identifier": "^7.25.7",
+        "to-fast-properties": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@colors/colors": {
+      "version": "1.5.0",
+      "resolved": "https://registry.npmmirror.com/@colors/colors/-/colors-1.5.0.tgz",
+      "integrity": "sha512-ooWCrlZP11i8GImSjTHYHLkvFDP48nS4+204nGb1RiX/WXYHmJA2III9/e2DWVabCESdW7hBAEzHRqUn9OUVvQ==",
+      "license": "MIT",
+      "optional": true,
+      "engines": {
+        "node": ">=0.1.90"
+      }
+    },
+    "node_modules/@ctrl/tinycolor": {
+      "version": "3.6.1",
+      "resolved": "https://registry.npmmirror.com/@ctrl/tinycolor/-/tinycolor-3.6.1.tgz",
+      "integrity": "sha512-SITSV6aIXsuVNV3f3O0f2n/cgyEDWoSqtZMYiAmcsYHydcKrOz3gUxB/iXd/Qf08+IZX4KpgNbvUdMBmWz+kcA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/@discoveryjs/json-ext": {
+      "version": "0.5.7",
+      "resolved": "https://registry.npmmirror.com/@discoveryjs/json-ext/-/json-ext-0.5.7.tgz",
+      "integrity": "sha512-dBVuXR082gk3jsFp7Rd/JI4kytwGHecnCoTtXFb7DB6CNHp4rg5k1bhg0nWdLGLnOV71lmDzGQaLMy8iPLY0pw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10.0.0"
+      }
+    },
+    "node_modules/@docsearch/css": {
+      "version": "3.6.2",
+      "resolved": "https://registry.npmmirror.com/@docsearch/css/-/css-3.6.2.tgz",
+      "integrity": "sha512-vKNZepO2j7MrYBTZIGXvlUOIR+v9KRf70FApRgovWrj3GTs1EITz/Xb0AOlm1xsQBp16clVZj1SY/qaOJbQtZw==",
+      "license": "MIT"
+    },
+    "node_modules/@docsearch/react": {
+      "version": "3.6.2",
+      "resolved": "https://registry.npmmirror.com/@docsearch/react/-/react-3.6.2.tgz",
+      "integrity": "sha512-rtZce46OOkVflCQH71IdbXSFK+S8iJZlUF56XBW5rIgx/eG5qoomC7Ag3anZson1bBac/JFQn7XOBfved/IMRA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/autocomplete-core": "1.9.3",
+        "@algolia/autocomplete-preset-algolia": "1.9.3",
+        "@docsearch/css": "3.6.2",
+        "algoliasearch": "^4.19.1"
+      },
+      "peerDependencies": {
+        "@types/react": ">= 16.8.0 < 19.0.0",
+        "react": ">= 16.8.0 < 19.0.0",
+        "react-dom": ">= 16.8.0 < 19.0.0",
+        "search-insights": ">= 1 < 3"
+      },
+      "peerDependenciesMeta": {
+        "@types/react": {
+          "optional": true
+        },
+        "react": {
+          "optional": true
+        },
+        "react-dom": {
+          "optional": true
+        },
+        "search-insights": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@docusaurus/core": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/core/-/core-3.5.2.tgz",
+      "integrity": "sha512-4Z1WkhCSkX4KO0Fw5m/Vuc7Q3NxBG53NE5u59Rs96fWkMPZVSrzEPP16/Nk6cWb/shK7xXPndTmalJtw7twL/w==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/core": "^7.23.3",
+        "@babel/generator": "^7.23.3",
+        "@babel/plugin-syntax-dynamic-import": "^7.8.3",
+        "@babel/plugin-transform-runtime": "^7.22.9",
+        "@babel/preset-env": "^7.22.9",
+        "@babel/preset-react": "^7.22.5",
+        "@babel/preset-typescript": "^7.22.5",
+        "@babel/runtime": "^7.22.6",
+        "@babel/runtime-corejs3": "^7.22.6",
+        "@babel/traverse": "^7.22.8",
+        "@docusaurus/cssnano-preset": "3.5.2",
+        "@docusaurus/logger": "3.5.2",
+        "@docusaurus/mdx-loader": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-common": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "autoprefixer": "^10.4.14",
+        "babel-loader": "^9.1.3",
+        "babel-plugin-dynamic-import-node": "^2.3.3",
+        "boxen": "^6.2.1",
+        "chalk": "^4.1.2",
+        "chokidar": "^3.5.3",
+        "clean-css": "^5.3.2",
+        "cli-table3": "^0.6.3",
+        "combine-promises": "^1.1.0",
+        "commander": "^5.1.0",
+        "copy-webpack-plugin": "^11.0.0",
+        "core-js": "^3.31.1",
+        "css-loader": "^6.8.1",
+        "css-minimizer-webpack-plugin": "^5.0.1",
+        "cssnano": "^6.1.2",
+        "del": "^6.1.1",
+        "detect-port": "^1.5.1",
+        "escape-html": "^1.0.3",
+        "eta": "^2.2.0",
+        "eval": "^0.1.8",
+        "file-loader": "^6.2.0",
+        "fs-extra": "^11.1.1",
+        "html-minifier-terser": "^7.2.0",
+        "html-tags": "^3.3.1",
+        "html-webpack-plugin": "^5.5.3",
+        "leven": "^3.1.0",
+        "lodash": "^4.17.21",
+        "mini-css-extract-plugin": "^2.7.6",
+        "p-map": "^4.0.0",
+        "postcss": "^8.4.26",
+        "postcss-loader": "^7.3.3",
+        "prompts": "^2.4.2",
+        "react-dev-utils": "^12.0.1",
+        "react-helmet-async": "^1.3.0",
+        "react-loadable": "npm:@docusaurus/react-loadable@6.0.0",
+        "react-loadable-ssr-addon-v5-slorber": "^1.0.1",
+        "react-router": "^5.3.4",
+        "react-router-config": "^5.1.1",
+        "react-router-dom": "^5.3.4",
+        "rtl-detect": "^1.0.4",
+        "semver": "^7.5.4",
+        "serve-handler": "^6.1.5",
+        "shelljs": "^0.8.5",
+        "terser-webpack-plugin": "^5.3.9",
+        "tslib": "^2.6.0",
+        "update-notifier": "^6.0.2",
+        "url-loader": "^4.1.1",
+        "webpack": "^5.88.1",
+        "webpack-bundle-analyzer": "^4.9.0",
+        "webpack-dev-server": "^4.15.1",
+        "webpack-merge": "^5.9.0",
+        "webpackbar": "^5.0.2"
+      },
+      "bin": {
+        "docusaurus": "bin/docusaurus.mjs"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "@mdx-js/react": "^3.0.0",
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/cssnano-preset": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/cssnano-preset/-/cssnano-preset-3.5.2.tgz",
+      "integrity": "sha512-D3KiQXOMA8+O0tqORBrTOEQyQxNIfPm9jEaJoALjjSjc2M/ZAWcUfPQEnwr2JB2TadHw2gqWgpZckQmrVWkytA==",
+      "license": "MIT",
+      "dependencies": {
+        "cssnano-preset-advanced": "^6.1.2",
+        "postcss": "^8.4.38",
+        "postcss-sort-media-queries": "^5.2.0",
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      }
+    },
+    "node_modules/@docusaurus/logger": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/logger/-/logger-3.5.2.tgz",
+      "integrity": "sha512-LHC540SGkeLfyT3RHK3gAMK6aS5TRqOD4R72BEU/DE2M/TY8WwEUAMY576UUc/oNJXv8pGhBmQB6N9p3pt8LQw==",
+      "license": "MIT",
+      "dependencies": {
+        "chalk": "^4.1.2",
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      }
+    },
+    "node_modules/@docusaurus/mdx-loader": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/mdx-loader/-/mdx-loader-3.5.2.tgz",
+      "integrity": "sha512-ku3xO9vZdwpiMIVd8BzWV0DCqGEbCP5zs1iHfKX50vw6jX8vQo0ylYo1YJMZyz6e+JFJ17HYHT5FzVidz2IflA==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/logger": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "@mdx-js/mdx": "^3.0.0",
+        "@slorber/remark-comment": "^1.0.0",
+        "escape-html": "^1.0.3",
+        "estree-util-value-to-estree": "^3.0.1",
+        "file-loader": "^6.2.0",
+        "fs-extra": "^11.1.1",
+        "image-size": "^1.0.2",
+        "mdast-util-mdx": "^3.0.0",
+        "mdast-util-to-string": "^4.0.0",
+        "rehype-raw": "^7.0.0",
+        "remark-directive": "^3.0.0",
+        "remark-emoji": "^4.0.0",
+        "remark-frontmatter": "^5.0.0",
+        "remark-gfm": "^4.0.0",
+        "stringify-object": "^3.3.0",
+        "tslib": "^2.6.0",
+        "unified": "^11.0.3",
+        "unist-util-visit": "^5.0.0",
+        "url-loader": "^4.1.1",
+        "vfile": "^6.0.1",
+        "webpack": "^5.88.1"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/module-type-aliases": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/module-type-aliases/-/module-type-aliases-3.5.2.tgz",
+      "integrity": "sha512-Z+Xu3+2rvKef/YKTMxZHsEXp1y92ac0ngjDiExRdqGTmEKtCUpkbNYH8v5eXo5Ls+dnW88n6WTa+Q54kLOkwPg==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/types": "3.5.2",
+        "@types/history": "^4.7.11",
+        "@types/react": "*",
+        "@types/react-router-config": "*",
+        "@types/react-router-dom": "*",
+        "react-helmet-async": "*",
+        "react-loadable": "npm:@docusaurus/react-loadable@6.0.0"
+      },
+      "peerDependencies": {
+        "react": "*",
+        "react-dom": "*"
+      }
+    },
+    "node_modules/@docusaurus/plugin-content-blog": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/plugin-content-blog/-/plugin-content-blog-3.5.2.tgz",
+      "integrity": "sha512-R7ghWnMvjSf+aeNDH0K4fjyQnt5L0KzUEnUhmf1e3jZrv3wogeytZNN6n7X8yHcMsuZHPOrctQhXWnmxu+IRRg==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/logger": "3.5.2",
+        "@docusaurus/mdx-loader": "3.5.2",
+        "@docusaurus/theme-common": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-common": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "cheerio": "1.0.0-rc.12",
+        "feed": "^4.2.2",
+        "fs-extra": "^11.1.1",
+        "lodash": "^4.17.21",
+        "reading-time": "^1.5.0",
+        "srcset": "^4.0.0",
+        "tslib": "^2.6.0",
+        "unist-util-visit": "^5.0.0",
+        "utility-types": "^3.10.0",
+        "webpack": "^5.88.1"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "@docusaurus/plugin-content-docs": "*",
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/plugin-content-docs": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/plugin-content-docs/-/plugin-content-docs-3.5.2.tgz",
+      "integrity": "sha512-Bt+OXn/CPtVqM3Di44vHjE7rPCEsRCB/DMo2qoOuozB9f7+lsdrHvD0QCHdBs0uhz6deYJDppAr2VgqybKPlVQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/logger": "3.5.2",
+        "@docusaurus/mdx-loader": "3.5.2",
+        "@docusaurus/module-type-aliases": "3.5.2",
+        "@docusaurus/theme-common": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-common": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "@types/react-router-config": "^5.0.7",
+        "combine-promises": "^1.1.0",
+        "fs-extra": "^11.1.1",
+        "js-yaml": "^4.1.0",
+        "lodash": "^4.17.21",
+        "tslib": "^2.6.0",
+        "utility-types": "^3.10.0",
+        "webpack": "^5.88.1"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/plugin-content-pages": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/plugin-content-pages/-/plugin-content-pages-3.5.2.tgz",
+      "integrity": "sha512-WzhHjNpoQAUz/ueO10cnundRz+VUtkjFhhaQ9jApyv1a46FPURO4cef89pyNIOMny1fjDz/NUN2z6Yi+5WUrCw==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/mdx-loader": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "fs-extra": "^11.1.1",
+        "tslib": "^2.6.0",
+        "webpack": "^5.88.1"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/plugin-debug": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/plugin-debug/-/plugin-debug-3.5.2.tgz",
+      "integrity": "sha512-kBK6GlN0itCkrmHuCS6aX1wmoWc5wpd5KJlqQ1FyrF0cLDnvsYSnh7+ftdwzt7G6lGBho8lrVwkkL9/iQvaSOA==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "fs-extra": "^11.1.1",
+        "react-json-view-lite": "^1.2.0",
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/plugin-google-analytics": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/plugin-google-analytics/-/plugin-google-analytics-3.5.2.tgz",
+      "integrity": "sha512-rjEkJH/tJ8OXRE9bwhV2mb/WP93V441rD6XnM6MIluu7rk8qg38iSxS43ga2V2Q/2ib53PcqbDEJDG/yWQRJhQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/plugin-google-gtag": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/plugin-google-gtag/-/plugin-google-gtag-3.5.2.tgz",
+      "integrity": "sha512-lm8XL3xLkTPHFKKjLjEEAHUrW0SZBSHBE1I+i/tmYMBsjCcUB5UJ52geS5PSiOCFVR74tbPGcPHEV/gaaxFeSA==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "@types/gtag.js": "^0.0.12",
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/plugin-google-tag-manager": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/plugin-google-tag-manager/-/plugin-google-tag-manager-3.5.2.tgz",
+      "integrity": "sha512-QkpX68PMOMu10Mvgvr5CfZAzZQFx8WLlOiUQ/Qmmcl6mjGK6H21WLT5x7xDmcpCoKA/3CegsqIqBR+nA137lQg==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/plugin-sitemap": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/plugin-sitemap/-/plugin-sitemap-3.5.2.tgz",
+      "integrity": "sha512-DnlqYyRAdQ4NHY28TfHuVk414ft2uruP4QWCH//jzpHjqvKyXjj2fmDtI8RPUBh9K8iZKFMHRnLtzJKySPWvFA==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/logger": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-common": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "fs-extra": "^11.1.1",
+        "sitemap": "^7.1.1",
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/preset-classic": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/preset-classic/-/preset-classic-3.5.2.tgz",
+      "integrity": "sha512-3ihfXQ95aOHiLB5uCu+9PRy2gZCeSZoDcqpnDvf3B+sTrMvMTr8qRUzBvWkoIqc82yG5prCboRjk1SVILKx6sg==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/plugin-content-blog": "3.5.2",
+        "@docusaurus/plugin-content-docs": "3.5.2",
+        "@docusaurus/plugin-content-pages": "3.5.2",
+        "@docusaurus/plugin-debug": "3.5.2",
+        "@docusaurus/plugin-google-analytics": "3.5.2",
+        "@docusaurus/plugin-google-gtag": "3.5.2",
+        "@docusaurus/plugin-google-tag-manager": "3.5.2",
+        "@docusaurus/plugin-sitemap": "3.5.2",
+        "@docusaurus/theme-classic": "3.5.2",
+        "@docusaurus/theme-common": "3.5.2",
+        "@docusaurus/theme-search-algolia": "3.5.2",
+        "@docusaurus/types": "3.5.2"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/theme-classic": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/theme-classic/-/theme-classic-3.5.2.tgz",
+      "integrity": "sha512-XRpinSix3NBv95Rk7xeMF9k4safMkwnpSgThn0UNQNumKvmcIYjfkwfh2BhwYh/BxMXQHJ/PdmNh22TQFpIaYg==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/mdx-loader": "3.5.2",
+        "@docusaurus/module-type-aliases": "3.5.2",
+        "@docusaurus/plugin-content-blog": "3.5.2",
+        "@docusaurus/plugin-content-docs": "3.5.2",
+        "@docusaurus/plugin-content-pages": "3.5.2",
+        "@docusaurus/theme-common": "3.5.2",
+        "@docusaurus/theme-translations": "3.5.2",
+        "@docusaurus/types": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-common": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "@mdx-js/react": "^3.0.0",
+        "clsx": "^2.0.0",
+        "copy-text-to-clipboard": "^3.2.0",
+        "infima": "0.2.0-alpha.44",
+        "lodash": "^4.17.21",
+        "nprogress": "^0.2.0",
+        "postcss": "^8.4.26",
+        "prism-react-renderer": "^2.3.0",
+        "prismjs": "^1.29.0",
+        "react-router-dom": "^5.3.4",
+        "rtlcss": "^4.1.0",
+        "tslib": "^2.6.0",
+        "utility-types": "^3.10.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/theme-common": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/theme-common/-/theme-common-3.5.2.tgz",
+      "integrity": "sha512-QXqlm9S6x9Ibwjs7I2yEDgsCocp708DrCrgHgKwg2n2AY0YQ6IjU0gAK35lHRLOvAoJUfCKpQAwUykB0R7+Eew==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/mdx-loader": "3.5.2",
+        "@docusaurus/module-type-aliases": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-common": "3.5.2",
+        "@types/history": "^4.7.11",
+        "@types/react": "*",
+        "@types/react-router-config": "*",
+        "clsx": "^2.0.0",
+        "parse-numeric-range": "^1.3.0",
+        "prism-react-renderer": "^2.3.0",
+        "tslib": "^2.6.0",
+        "utility-types": "^3.10.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "@docusaurus/plugin-content-docs": "*",
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/theme-search-algolia": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/theme-search-algolia/-/theme-search-algolia-3.5.2.tgz",
+      "integrity": "sha512-qW53kp3VzMnEqZGjakaV90sst3iN1o32PH+nawv1uepROO8aEGxptcq2R5rsv7aBShSRbZwIobdvSYKsZ5pqvA==",
+      "license": "MIT",
+      "dependencies": {
+        "@docsearch/react": "^3.5.2",
+        "@docusaurus/core": "3.5.2",
+        "@docusaurus/logger": "3.5.2",
+        "@docusaurus/plugin-content-docs": "3.5.2",
+        "@docusaurus/theme-common": "3.5.2",
+        "@docusaurus/theme-translations": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-validation": "3.5.2",
+        "algoliasearch": "^4.18.0",
+        "algoliasearch-helper": "^3.13.3",
+        "clsx": "^2.0.0",
+        "eta": "^2.2.0",
+        "fs-extra": "^11.1.1",
+        "lodash": "^4.17.21",
+        "tslib": "^2.6.0",
+        "utility-types": "^3.10.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/theme-translations": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/theme-translations/-/theme-translations-3.5.2.tgz",
+      "integrity": "sha512-GPZLcu4aT1EmqSTmbdpVrDENGR2yObFEX8ssEFYTCiAIVc0EihNSdOIBTazUvgNqwvnoU1A8vIs1xyzc3LITTw==",
+      "license": "MIT",
+      "dependencies": {
+        "fs-extra": "^11.1.1",
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      }
+    },
+    "node_modules/@docusaurus/tsconfig": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/tsconfig/-/tsconfig-3.5.2.tgz",
+      "integrity": "sha512-rQ7toURCFnWAIn8ubcquDs0ewhPwviMzxh6WpRjBW7sJVCXb6yzwUaY3HMNa0VXCFw+qkIbFywrMTf+Pb4uHWQ==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/@docusaurus/types": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/types/-/types-3.5.2.tgz",
+      "integrity": "sha512-N6GntLXoLVUwkZw7zCxwy9QiuEXIcTVzA9AkmNw16oc0AP3SXLrMmDMMBIfgqwuKWa6Ox6epHol9kMtJqekACw==",
+      "license": "MIT",
+      "dependencies": {
+        "@mdx-js/mdx": "^3.0.0",
+        "@types/history": "^4.7.11",
+        "@types/react": "*",
+        "commander": "^5.1.0",
+        "joi": "^17.9.2",
+        "react-helmet-async": "^1.3.0",
+        "utility-types": "^3.10.0",
+        "webpack": "^5.88.1",
+        "webpack-merge": "^5.9.0"
+      },
+      "peerDependencies": {
+        "react": "^18.0.0",
+        "react-dom": "^18.0.0"
+      }
+    },
+    "node_modules/@docusaurus/utils": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/utils/-/utils-3.5.2.tgz",
+      "integrity": "sha512-33QvcNFh+Gv+C2dP9Y9xWEzMgf3JzrpL2nW9PopidiohS1nDcyknKRx2DWaFvyVTTYIkkABVSr073VTj/NITNA==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/logger": "3.5.2",
+        "@docusaurus/utils-common": "3.5.2",
+        "@svgr/webpack": "^8.1.0",
+        "escape-string-regexp": "^4.0.0",
+        "file-loader": "^6.2.0",
+        "fs-extra": "^11.1.1",
+        "github-slugger": "^1.5.0",
+        "globby": "^11.1.0",
+        "gray-matter": "^4.0.3",
+        "jiti": "^1.20.0",
+        "js-yaml": "^4.1.0",
+        "lodash": "^4.17.21",
+        "micromatch": "^4.0.5",
+        "prompts": "^2.4.2",
+        "resolve-pathname": "^3.0.0",
+        "shelljs": "^0.8.5",
+        "tslib": "^2.6.0",
+        "url-loader": "^4.1.1",
+        "utility-types": "^3.10.0",
+        "webpack": "^5.88.1"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "@docusaurus/types": "*"
+      },
+      "peerDependenciesMeta": {
+        "@docusaurus/types": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@docusaurus/utils-common": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/utils-common/-/utils-common-3.5.2.tgz",
+      "integrity": "sha512-i0AZjHiRgJU6d7faQngIhuHKNrszpL/SHQPgF1zH4H+Ij6E9NBYGy6pkcGWToIv7IVPbs+pQLh1P3whn0gWXVg==",
+      "license": "MIT",
+      "dependencies": {
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      },
+      "peerDependencies": {
+        "@docusaurus/types": "*"
+      },
+      "peerDependenciesMeta": {
+        "@docusaurus/types": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@docusaurus/utils-validation": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/utils-validation/-/utils-validation-3.5.2.tgz",
+      "integrity": "sha512-m+Foq7augzXqB6HufdS139PFxDC5d5q2QKZy8q0qYYvGdI6nnlNsGH4cIGsgBnV7smz+mopl3g4asbSDvMV0jA==",
+      "license": "MIT",
+      "dependencies": {
+        "@docusaurus/logger": "3.5.2",
+        "@docusaurus/utils": "3.5.2",
+        "@docusaurus/utils-common": "3.5.2",
+        "fs-extra": "^11.2.0",
+        "joi": "^17.9.2",
+        "js-yaml": "^4.1.0",
+        "lodash": "^4.17.21",
+        "tslib": "^2.6.0"
+      },
+      "engines": {
+        "node": ">=18.0"
+      }
+    },
+    "node_modules/@emotion/hash": {
+      "version": "0.8.0",
+      "resolved": "https://registry.npmmirror.com/@emotion/hash/-/hash-0.8.0.tgz",
+      "integrity": "sha512-kBJtf7PH6aWwZ6fka3zQ0p6SBYzx4fl1LoZXE2RrnYST9Xljm7WfKJrU4g/Xr3Beg72MLrp1AWNUmuYJTL7Cow==",
+      "license": "MIT"
+    },
+    "node_modules/@emotion/unitless": {
+      "version": "0.7.5",
+      "resolved": "https://registry.npmmirror.com/@emotion/unitless/-/unitless-0.7.5.tgz",
+      "integrity": "sha512-OWORNpfjMsSSUBVrRBVGECkhWcULOAJz9ZW8uK9qgxD+87M7jHRcvh/A96XXNhXTLmKcoYSQtBEX7lHMO7YRwg==",
+      "license": "MIT"
+    },
+    "node_modules/@hapi/hoek": {
+      "version": "9.3.0",
+      "resolved": "https://registry.npmmirror.com/@hapi/hoek/-/hoek-9.3.0.tgz",
+      "integrity": "sha512-/c6rf4UJlmHlC9b5BaNvzAcFv7HZ2QHaV0D4/HNlBdvFnvQq8RI4kYdhyPCl7Xj+oWvTWQ8ujhqS53LIgAe6KQ==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@hapi/topo": {
+      "version": "5.1.0",
+      "resolved": "https://registry.npmmirror.com/@hapi/topo/-/topo-5.1.0.tgz",
+      "integrity": "sha512-foQZKJig7Ob0BMAYBfcJk8d77QtOe7Wo4ox7ff1lQYoNNAb6jwcY1ncdoy2e9wQZzvNy7ODZCYJkK8kzmcAnAg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^9.0.0"
+      }
+    },
+    "node_modules/@jest/schemas": {
+      "version": "29.6.3",
+      "resolved": "https://registry.npmmirror.com/@jest/schemas/-/schemas-29.6.3.tgz",
+      "integrity": "sha512-mo5j5X+jIZmJQveBKeS/clAueipV7KgiX1vMgCxam1RNYiqE1w62n0/tJJnHtjW8ZHcQco5gY85jA3mi0L+nSA==",
+      "license": "MIT",
+      "dependencies": {
+        "@sinclair/typebox": "^0.27.8"
+      },
+      "engines": {
+        "node": "^14.15.0 || ^16.10.0 || >=18.0.0"
+      }
+    },
+    "node_modules/@jest/types": {
+      "version": "29.6.3",
+      "resolved": "https://registry.npmmirror.com/@jest/types/-/types-29.6.3.tgz",
+      "integrity": "sha512-u3UPsIilWKOM3F9CXtrG8LEJmNxwoCQC/XVj4IKYXvvpx7QIi/Kg1LI5uDmDpKlac62NUtX7eLjRh+jVZcLOzw==",
+      "license": "MIT",
+      "dependencies": {
+        "@jest/schemas": "^29.6.3",
+        "@types/istanbul-lib-coverage": "^2.0.0",
+        "@types/istanbul-reports": "^3.0.0",
+        "@types/node": "*",
+        "@types/yargs": "^17.0.8",
+        "chalk": "^4.0.0"
+      },
+      "engines": {
+        "node": "^14.15.0 || ^16.10.0 || >=18.0.0"
+      }
+    },
+    "node_modules/@jridgewell/gen-mapping": {
+      "version": "0.3.5",
+      "resolved": "https://registry.npmmirror.com/@jridgewell/gen-mapping/-/gen-mapping-0.3.5.tgz",
+      "integrity": "sha512-IzL8ZoEDIBRWEzlCcRhOaCupYyN5gdIK+Q6fbFdPDg6HqX6jpkItn7DFIpW9LQzXG6Df9sA7+OKnq0qlz/GaQg==",
+      "license": "MIT",
+      "dependencies": {
+        "@jridgewell/set-array": "^1.2.1",
+        "@jridgewell/sourcemap-codec": "^1.4.10",
+        "@jridgewell/trace-mapping": "^0.3.24"
+      },
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/@jridgewell/resolve-uri": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmmirror.com/@jridgewell/resolve-uri/-/resolve-uri-3.1.2.tgz",
+      "integrity": "sha512-bRISgCIjP20/tbWSPWMEi54QVPRZExkuD9lJL+UIxUKtwVJA8wW1Trb1jMs1RFXo1CBTNZ/5hpC9QvmKWdopKw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/@jridgewell/set-array": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmmirror.com/@jridgewell/set-array/-/set-array-1.2.1.tgz",
+      "integrity": "sha512-R8gLRTZeyp03ymzP/6Lil/28tGeGEzhx1q2k703KGWRAI1VdvPIXdG70VJc2pAMw3NA6JKL5hhFu1sJX0Mnn/A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/@jridgewell/source-map": {
+      "version": "0.3.6",
+      "resolved": "https://registry.npmmirror.com/@jridgewell/source-map/-/source-map-0.3.6.tgz",
+      "integrity": "sha512-1ZJTZebgqllO79ue2bm3rIGud/bOe0pP5BjSRCRxxYkEZS8STV7zN84UBbiYu7jy+eCKSnVIUgoWWE/tt+shMQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@jridgewell/gen-mapping": "^0.3.5",
+        "@jridgewell/trace-mapping": "^0.3.25"
+      }
+    },
+    "node_modules/@jridgewell/sourcemap-codec": {
+      "version": "1.5.0",
+      "resolved": "https://registry.npmmirror.com/@jridgewell/sourcemap-codec/-/sourcemap-codec-1.5.0.tgz",
+      "integrity": "sha512-gv3ZRaISU3fjPAgNsriBRqGWQL6quFx04YMPW/zD8XMLsU32mhCCbfbO6KZFLjvYpCZ8zyDEgqsgf+PwPaM7GQ==",
+      "license": "MIT"
+    },
+    "node_modules/@jridgewell/trace-mapping": {
+      "version": "0.3.25",
+      "resolved": "https://registry.npmmirror.com/@jridgewell/trace-mapping/-/trace-mapping-0.3.25.tgz",
+      "integrity": "sha512-vNk6aEwybGtawWmy/PzwnGDOjCkLWSD2wqvjGGAgOAwCGWySYXfYoxt00IJkTF+8Lb57DwOb3Aa0o9CApepiYQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@jridgewell/resolve-uri": "^3.1.0",
+        "@jridgewell/sourcemap-codec": "^1.4.14"
+      }
+    },
+    "node_modules/@leichtgewicht/ip-codec": {
+      "version": "2.0.5",
+      "resolved": "https://registry.npmmirror.com/@leichtgewicht/ip-codec/-/ip-codec-2.0.5.tgz",
+      "integrity": "sha512-Vo+PSpZG2/fmgmiNzYK9qWRh8h/CHrwD0mo1h1DzL4yzHNSfWYujGTYsWGreD000gcgmZ7K4Ys6Tx9TxtsKdDw==",
+      "license": "MIT"
+    },
+    "node_modules/@mdx-js/mdx": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/@mdx-js/mdx/-/mdx-3.0.1.tgz",
+      "integrity": "sha512-eIQ4QTrOWyL3LWEe/bu6Taqzq2HQvHcyTMaOrI95P2/LmJE7AsfPfgJGuFLPVqBUE1BC1rik3VIhU+s9u72arA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0",
+        "@types/estree-jsx": "^1.0.0",
+        "@types/hast": "^3.0.0",
+        "@types/mdx": "^2.0.0",
+        "collapse-white-space": "^2.0.0",
+        "devlop": "^1.0.0",
+        "estree-util-build-jsx": "^3.0.0",
+        "estree-util-is-identifier-name": "^3.0.0",
+        "estree-util-to-js": "^2.0.0",
+        "estree-walker": "^3.0.0",
+        "hast-util-to-estree": "^3.0.0",
+        "hast-util-to-jsx-runtime": "^2.0.0",
+        "markdown-extensions": "^2.0.0",
+        "periscopic": "^3.0.0",
+        "remark-mdx": "^3.0.0",
+        "remark-parse": "^11.0.0",
+        "remark-rehype": "^11.0.0",
+        "source-map": "^0.7.0",
+        "unified": "^11.0.0",
+        "unist-util-position-from-estree": "^2.0.0",
+        "unist-util-stringify-position": "^4.0.0",
+        "unist-util-visit": "^5.0.0",
+        "vfile": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/@mdx-js/react": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/@mdx-js/react/-/react-3.0.1.tgz",
+      "integrity": "sha512-9ZrPIU4MGf6et1m1ov3zKf+q9+deetI51zprKB1D/z3NOb+rUxxtEl3mCjW5wTGh6VhRdwPueh1oRzi6ezkA8A==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdx": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      },
+      "peerDependencies": {
+        "@types/react": ">=16",
+        "react": ">=16"
+      }
+    },
+    "node_modules/@nodelib/fs.scandir": {
+      "version": "2.1.5",
+      "resolved": "https://registry.npmmirror.com/@nodelib/fs.scandir/-/fs.scandir-2.1.5.tgz",
+      "integrity": "sha512-vq24Bq3ym5HEQm2NKCr3yXDwjc7vTsEThRDnkp2DK9p1uqLR+DHurm/NOTo0KG7HYHU7eppKZj3MyqYuMBf62g==",
+      "license": "MIT",
+      "dependencies": {
+        "@nodelib/fs.stat": "2.0.5",
+        "run-parallel": "^1.1.9"
+      },
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/@nodelib/fs.stat": {
+      "version": "2.0.5",
+      "resolved": "https://registry.npmmirror.com/@nodelib/fs.stat/-/fs.stat-2.0.5.tgz",
+      "integrity": "sha512-RkhPPp2zrqDAQA/2jNhnztcPAlv64XdhIp7a7454A5ovI7Bukxgt7MX7udwAu3zg1DcpPU0rz3VV1SeaqvY4+A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/@nodelib/fs.walk": {
+      "version": "1.2.8",
+      "resolved": "https://registry.npmmirror.com/@nodelib/fs.walk/-/fs.walk-1.2.8.tgz",
+      "integrity": "sha512-oGB+UxlgWcgQkgwo8GcEGwemoTFt3FIO9ababBmaGwXIoBKZ+GTy0pP185beGg7Llih/NSHSV2XAs1lnznocSg==",
+      "license": "MIT",
+      "dependencies": {
+        "@nodelib/fs.scandir": "2.1.5",
+        "fastq": "^1.6.0"
+      },
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/@pnpm/config.env-replace": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/@pnpm/config.env-replace/-/config.env-replace-1.1.0.tgz",
+      "integrity": "sha512-htyl8TWnKL7K/ESFa1oW2UB5lVDxuF5DpM7tBi6Hu2LNL3mWkIzNLG6N4zoCUP1lCKNxWy/3iu8mS8MvToGd6w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12.22.0"
+      }
+    },
+    "node_modules/@pnpm/network.ca-file": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/@pnpm/network.ca-file/-/network.ca-file-1.0.2.tgz",
+      "integrity": "sha512-YcPQ8a0jwYU9bTdJDpXjMi7Brhkr1mXsXrUJvjqM2mQDgkRiz8jFaQGOdaLxgjtUfQgZhKy/O3cG/YwmgKaxLA==",
+      "license": "MIT",
+      "dependencies": {
+        "graceful-fs": "4.2.10"
+      },
+      "engines": {
+        "node": ">=12.22.0"
+      }
+    },
+    "node_modules/@pnpm/network.ca-file/node_modules/graceful-fs": {
+      "version": "4.2.10",
+      "resolved": "https://registry.npmmirror.com/graceful-fs/-/graceful-fs-4.2.10.tgz",
+      "integrity": "sha512-9ByhssR2fPVsNZj478qUUbKfmL0+t5BDVyjShtyZZLiK7ZDAArFFfopyOTj0M05wE2tJPisA4iTnnXl2YoPvOA==",
+      "license": "ISC"
+    },
+    "node_modules/@pnpm/npm-conf": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmmirror.com/@pnpm/npm-conf/-/npm-conf-2.3.1.tgz",
+      "integrity": "sha512-c83qWb22rNRuB0UaVCI0uRPNRr8Z0FWnEIvT47jiHAmOIUHbBOg5XvV7pM5x+rKn9HRpjxquDbXYSXr3fAKFcw==",
+      "license": "MIT",
+      "dependencies": {
+        "@pnpm/config.env-replace": "^1.1.0",
+        "@pnpm/network.ca-file": "^1.0.1",
+        "config-chain": "^1.1.11"
+      },
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/@polka/url": {
+      "version": "1.0.0-next.28",
+      "resolved": "https://registry.npmmirror.com/@polka/url/-/url-1.0.0-next.28.tgz",
+      "integrity": "sha512-8LduaNlMZGwdZ6qWrKlfa+2M4gahzFkprZiAt2TF8uS0qQgBizKXpXURqvTJ4WtmupWxaLqjRb2UCTe72mu+Aw==",
+      "license": "MIT"
+    },
+    "node_modules/@rc-component/async-validator": {
+      "version": "5.0.4",
+      "resolved": "https://registry.npmmirror.com/@rc-component/async-validator/-/async-validator-5.0.4.tgz",
+      "integrity": "sha512-qgGdcVIF604M9EqjNF0hbUTz42bz/RDtxWdWuU5EQe3hi7M8ob54B6B35rOsvX5eSvIHIzT9iH1R3n+hk3CGfg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.24.4"
+      },
+      "engines": {
+        "node": ">=14.x"
+      }
+    },
+    "node_modules/@rc-component/color-picker": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/@rc-component/color-picker/-/color-picker-2.0.1.tgz",
+      "integrity": "sha512-WcZYwAThV/b2GISQ8F+7650r5ZZJ043E57aVBFkQ+kSY4C6wdofXgB0hBx+GPGpIU0Z81eETNoDUJMr7oy/P8Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@ant-design/fast-color": "^2.0.6",
+        "@babel/runtime": "^7.23.6",
+        "classnames": "^2.2.6",
+        "rc-util": "^5.38.1"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/@rc-component/context": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmmirror.com/@rc-component/context/-/context-1.4.0.tgz",
+      "integrity": "sha512-kFcNxg9oLRMoL3qki0OMxK+7g5mypjgaaJp/pkOis/6rVxma9nJBF/8kCIuTYHUQNr0ii7MxqE33wirPZLJQ2w==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "rc-util": "^5.27.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/@rc-component/mini-decimal": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/@rc-component/mini-decimal/-/mini-decimal-1.1.0.tgz",
+      "integrity": "sha512-jS4E7T9Li2GuYwI6PyiVXmxTiM6b07rlD9Ge8uGZSCz3WlzcG5ZK7g5bbuKNeZ9pgUuPK/5guV781ujdVpm4HQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.18.0"
+      },
+      "engines": {
+        "node": ">=8.x"
+      }
+    },
+    "node_modules/@rc-component/mutate-observer": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/@rc-component/mutate-observer/-/mutate-observer-1.1.0.tgz",
+      "integrity": "sha512-QjrOsDXQusNwGZPf4/qRQasg7UFEj06XiCJ8iuiq/Io7CrHrgVi6Uuetw60WAMG1799v+aM8kyc+1L/GBbHSlw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.18.0",
+        "classnames": "^2.3.2",
+        "rc-util": "^5.24.4"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/@rc-component/portal": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmmirror.com/@rc-component/portal/-/portal-1.1.2.tgz",
+      "integrity": "sha512-6f813C0IsasTZms08kfA8kPAGxbbkYToa8ALaiDIGGECU4i9hj8Plgbx0sNJDrey3EtHO30hmdaxtT0138xZcg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.18.0",
+        "classnames": "^2.3.2",
+        "rc-util": "^5.24.4"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/@rc-component/qrcode": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/@rc-component/qrcode/-/qrcode-1.0.0.tgz",
+      "integrity": "sha512-L+rZ4HXP2sJ1gHMGHjsg9jlYBX/SLN2D6OxP9Zn3qgtpMWtO2vUfxVFwiogHpAIqs54FnALxraUy/BCO1yRIgg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.24.7",
+        "classnames": "^2.3.2",
+        "rc-util": "^5.38.0"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/@rc-component/tour": {
+      "version": "1.15.1",
+      "resolved": "https://registry.npmmirror.com/@rc-component/tour/-/tour-1.15.1.tgz",
+      "integrity": "sha512-Tr2t7J1DKZUpfJuDZWHxyxWpfmj8EZrqSgyMZ+BCdvKZ6r1UDsfU46M/iWAAFBy961Ssfom2kv5f3UcjIL2CmQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.18.0",
+        "@rc-component/portal": "^1.0.0-9",
+        "@rc-component/trigger": "^2.0.0",
+        "classnames": "^2.3.2",
+        "rc-util": "^5.24.4"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/@rc-component/trigger": {
+      "version": "2.2.3",
+      "resolved": "https://registry.npmmirror.com/@rc-component/trigger/-/trigger-2.2.3.tgz",
+      "integrity": "sha512-X1oFIpKoXAMXNDYCviOmTfuNuYxE4h5laBsyCqVAVMjNHxoF3/uiyA7XdegK1XbCvBbCZ6P6byWrEoDRpKL8+A==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.23.2",
+        "@rc-component/portal": "^1.1.0",
+        "classnames": "^2.3.2",
+        "rc-motion": "^2.0.0",
+        "rc-resize-observer": "^1.3.1",
+        "rc-util": "^5.38.0"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/@sideway/address": {
+      "version": "4.1.5",
+      "resolved": "https://registry.npmmirror.com/@sideway/address/-/address-4.1.5.tgz",
+      "integrity": "sha512-IqO/DUQHUkPeixNQ8n0JA6102hT9CmaljNTPmQ1u8MEhBo/R4Q8eKLN/vGZxuebwOroDB4cbpjheD4+/sKFK4Q==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^9.0.0"
+      }
+    },
+    "node_modules/@sideway/formula": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/@sideway/formula/-/formula-3.0.1.tgz",
+      "integrity": "sha512-/poHZJJVjx3L+zVD6g9KgHfYnb443oi7wLu/XKojDviHy6HOEOA6z1Trk5aR1dGcmPenJEgb2sK2I80LeS3MIg==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@sideway/pinpoint": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/@sideway/pinpoint/-/pinpoint-2.0.0.tgz",
+      "integrity": "sha512-RNiOoTPkptFtSVzQevY/yWtZwf/RxyVnPy/OcA9HBM3MlGDnBEYL5B41H0MTn0Uec8Hi+2qUtTfG2WWZBmMejQ==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@sinclair/typebox": {
+      "version": "0.27.8",
+      "resolved": "https://registry.npmmirror.com/@sinclair/typebox/-/typebox-0.27.8.tgz",
+      "integrity": "sha512-+Fj43pSMwJs4KRrH/938Uf+uAELIgVBmQzg/q1YG10djyfA3TnrU8N8XzqCh/okZdszqBQTZf96idMfE5lnwTA==",
+      "license": "MIT"
+    },
+    "node_modules/@sindresorhus/is": {
+      "version": "4.6.0",
+      "resolved": "https://registry.npmmirror.com/@sindresorhus/is/-/is-4.6.0.tgz",
+      "integrity": "sha512-t09vSN3MdfsyCHoFcTRCH/iUtG7OJ0CsjzB8cjAmKc/va/kIgeDI/TxsigdncE/4be734m0cvIYwNaV4i2XqAw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sindresorhus/is?sponsor=1"
+      }
+    },
+    "node_modules/@slorber/remark-comment": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/@slorber/remark-comment/-/remark-comment-1.0.0.tgz",
+      "integrity": "sha512-RCE24n7jsOj1M0UPvIQCHTe7fI0sFL4S2nwKVWwHyVr/wI/H8GosgsJGyhnsZoGFnD/P2hLf1mSbrrgSLN93NA==",
+      "license": "MIT",
+      "dependencies": {
+        "micromark-factory-space": "^1.0.0",
+        "micromark-util-character": "^1.1.0",
+        "micromark-util-symbol": "^1.0.1"
+      }
+    },
+    "node_modules/@svgr/babel-plugin-add-jsx-attribute": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/babel-plugin-add-jsx-attribute/-/babel-plugin-add-jsx-attribute-8.0.0.tgz",
+      "integrity": "sha512-b9MIk7yhdS1pMCZM8VeNfUlSKVRhsHZNMl5O9SfaX0l0t5wjdgu4IDzGB8bpnGBBOjGST3rRFVsaaEtI4W6f7g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@svgr/babel-plugin-remove-jsx-attribute": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/babel-plugin-remove-jsx-attribute/-/babel-plugin-remove-jsx-attribute-8.0.0.tgz",
+      "integrity": "sha512-BcCkm/STipKvbCl6b7QFrMh/vx00vIP63k2eM66MfHJzPr6O2U0jYEViXkHJWqXqQYjdeA9cuCl5KWmlwjDvbA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@svgr/babel-plugin-remove-jsx-empty-expression": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/babel-plugin-remove-jsx-empty-expression/-/babel-plugin-remove-jsx-empty-expression-8.0.0.tgz",
+      "integrity": "sha512-5BcGCBfBxB5+XSDSWnhTThfI9jcO5f0Ai2V24gZpG+wXF14BzwxxdDb4g6trdOux0rhibGs385BeFMSmxtS3uA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@svgr/babel-plugin-replace-jsx-attribute-value": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/babel-plugin-replace-jsx-attribute-value/-/babel-plugin-replace-jsx-attribute-value-8.0.0.tgz",
+      "integrity": "sha512-KVQ+PtIjb1BuYT3ht8M5KbzWBhdAjjUPdlMtpuw/VjT8coTrItWX6Qafl9+ji831JaJcu6PJNKCV0bp01lBNzQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@svgr/babel-plugin-svg-dynamic-title": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/babel-plugin-svg-dynamic-title/-/babel-plugin-svg-dynamic-title-8.0.0.tgz",
+      "integrity": "sha512-omNiKqwjNmOQJ2v6ge4SErBbkooV2aAWwaPFs2vUY7p7GhVkzRkJ00kILXQvRhA6miHnNpXv7MRnnSjdRjK8og==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@svgr/babel-plugin-svg-em-dimensions": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/babel-plugin-svg-em-dimensions/-/babel-plugin-svg-em-dimensions-8.0.0.tgz",
+      "integrity": "sha512-mURHYnu6Iw3UBTbhGwE/vsngtCIbHE43xCRK7kCw4t01xyGqb2Pd+WXekRRoFOBIY29ZoOhUCTEweDMdrjfi9g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@svgr/babel-plugin-transform-react-native-svg": {
+      "version": "8.1.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/babel-plugin-transform-react-native-svg/-/babel-plugin-transform-react-native-svg-8.1.0.tgz",
+      "integrity": "sha512-Tx8T58CHo+7nwJ+EhUwx3LfdNSG9R2OKfaIXXs5soiy5HtgoAEkDay9LIimLOcG8dJQH1wPZp/cnAv6S9CrR1Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@svgr/babel-plugin-transform-svg-component": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/babel-plugin-transform-svg-component/-/babel-plugin-transform-svg-component-8.0.0.tgz",
+      "integrity": "sha512-DFx8xa3cZXTdb/k3kfPeaixecQLgKh5NVBMwD0AQxOzcZawK4oo1Jh9LbrcACUivsCA7TLG8eeWgrDXjTMhRmw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@svgr/babel-preset": {
+      "version": "8.1.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/babel-preset/-/babel-preset-8.1.0.tgz",
+      "integrity": "sha512-7EYDbHE7MxHpv4sxvnVPngw5fuR6pw79SkcrILHJ/iMpuKySNCl5W1qcwPEpU+LgyRXOaAFgH0KhwD18wwg6ug==",
+      "license": "MIT",
+      "dependencies": {
+        "@svgr/babel-plugin-add-jsx-attribute": "8.0.0",
+        "@svgr/babel-plugin-remove-jsx-attribute": "8.0.0",
+        "@svgr/babel-plugin-remove-jsx-empty-expression": "8.0.0",
+        "@svgr/babel-plugin-replace-jsx-attribute-value": "8.0.0",
+        "@svgr/babel-plugin-svg-dynamic-title": "8.0.0",
+        "@svgr/babel-plugin-svg-em-dimensions": "8.0.0",
+        "@svgr/babel-plugin-transform-react-native-svg": "8.1.0",
+        "@svgr/babel-plugin-transform-svg-component": "8.0.0"
+      },
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@svgr/core": {
+      "version": "8.1.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/core/-/core-8.1.0.tgz",
+      "integrity": "sha512-8QqtOQT5ACVlmsvKOJNEaWmRPmcojMOzCz4Hs2BGG/toAp/K38LcsMRyLp349glq5AzJbCEeimEoxaX6v/fLrA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/core": "^7.21.3",
+        "@svgr/babel-preset": "8.1.0",
+        "camelcase": "^6.2.0",
+        "cosmiconfig": "^8.1.3",
+        "snake-case": "^3.0.4"
+      },
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      }
+    },
+    "node_modules/@svgr/hast-util-to-babel-ast": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/hast-util-to-babel-ast/-/hast-util-to-babel-ast-8.0.0.tgz",
+      "integrity": "sha512-EbDKwO9GpfWP4jN9sGdYwPBU0kdomaPIL2Eu4YwmgP+sJeXT+L7bMwJUBnhzfH8Q2qMBqZ4fJwpCyYsAN3mt2Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/types": "^7.21.3",
+        "entities": "^4.4.0"
+      },
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      }
+    },
+    "node_modules/@svgr/plugin-jsx": {
+      "version": "8.1.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/plugin-jsx/-/plugin-jsx-8.1.0.tgz",
+      "integrity": "sha512-0xiIyBsLlr8quN+WyuxooNW9RJ0Dpr8uOnH/xrCVO8GLUcwHISwj1AG0k+LFzteTkAA0GbX0kj9q6Dk70PTiPA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/core": "^7.21.3",
+        "@svgr/babel-preset": "8.1.0",
+        "@svgr/hast-util-to-babel-ast": "8.0.0",
+        "svg-parser": "^2.0.4"
+      },
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@svgr/core": "*"
+      }
+    },
+    "node_modules/@svgr/plugin-svgo": {
+      "version": "8.1.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/plugin-svgo/-/plugin-svgo-8.1.0.tgz",
+      "integrity": "sha512-Ywtl837OGO9pTLIN/onoWLmDQ4zFUycI1g76vuKGEz6evR/ZTJlJuz3G/fIkb6OVBJ2g0o6CGJzaEjfmEo3AHA==",
+      "license": "MIT",
+      "dependencies": {
+        "cosmiconfig": "^8.1.3",
+        "deepmerge": "^4.3.1",
+        "svgo": "^3.0.2"
+      },
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      },
+      "peerDependencies": {
+        "@svgr/core": "*"
+      }
+    },
+    "node_modules/@svgr/webpack": {
+      "version": "8.1.0",
+      "resolved": "https://registry.npmmirror.com/@svgr/webpack/-/webpack-8.1.0.tgz",
+      "integrity": "sha512-LnhVjMWyMQV9ZmeEy26maJk+8HTIbd59cH4F2MJ439k9DqejRisfFNGAPvRYlKETuh9LrImlS8aKsBgKjMA8WA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/core": "^7.21.3",
+        "@babel/plugin-transform-react-constant-elements": "^7.21.3",
+        "@babel/preset-env": "^7.20.2",
+        "@babel/preset-react": "^7.18.6",
+        "@babel/preset-typescript": "^7.21.0",
+        "@svgr/core": "8.1.0",
+        "@svgr/plugin-jsx": "8.1.0",
+        "@svgr/plugin-svgo": "8.1.0"
+      },
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/gregberge"
+      }
+    },
+    "node_modules/@szmarczak/http-timer": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmmirror.com/@szmarczak/http-timer/-/http-timer-5.0.1.tgz",
+      "integrity": "sha512-+PmQX0PiAYPMeVYe237LJAYvOMYW1j2rH5YROyS3b4CTVJum34HfRvKvAzozHAQG0TnHNdUfY9nCeUyRAs//cw==",
+      "license": "MIT",
+      "dependencies": {
+        "defer-to-connect": "^2.0.1"
+      },
+      "engines": {
+        "node": ">=14.16"
+      }
+    },
+    "node_modules/@trysound/sax": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmmirror.com/@trysound/sax/-/sax-0.2.0.tgz",
+      "integrity": "sha512-L7z9BgrNEcYyUYtF+HaEfiS5ebkh9jXqbszz7pC0hRBPaatV0XjSD3+eHrpqFemQfgwiFF0QPIarnIihIDn7OA==",
+      "license": "ISC",
+      "engines": {
+        "node": ">=10.13.0"
+      }
+    },
+    "node_modules/@types/acorn": {
+      "version": "4.0.6",
+      "resolved": "https://registry.npmmirror.com/@types/acorn/-/acorn-4.0.6.tgz",
+      "integrity": "sha512-veQTnWP+1D/xbxVrPC3zHnCZRjSrKfhbMUlEA43iMZLu7EsnTtkJklIuwrCPbOi8YkvDQAiW05VQQFvvz9oieQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "*"
+      }
+    },
+    "node_modules/@types/body-parser": {
+      "version": "1.19.5",
+      "resolved": "https://registry.npmmirror.com/@types/body-parser/-/body-parser-1.19.5.tgz",
+      "integrity": "sha512-fB3Zu92ucau0iQ0JMCFQE7b/dv8Ot07NI3KaZIkIUNXq82k4eBAqUaneXfleGY9JWskeS9y+u0nXMyspcuQrCg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/connect": "*",
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/bonjour": {
+      "version": "3.5.13",
+      "resolved": "https://registry.npmmirror.com/@types/bonjour/-/bonjour-3.5.13.tgz",
+      "integrity": "sha512-z9fJ5Im06zvUL548KvYNecEVlA7cVDkGUi6kZusb04mpyEFKCIZJvloCcmpmLaIahDpOQGHaHmG6imtPMmPXGQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/connect": {
+      "version": "3.4.38",
+      "resolved": "https://registry.npmmirror.com/@types/connect/-/connect-3.4.38.tgz",
+      "integrity": "sha512-K6uROf1LD88uDQqJCktA4yzL1YYAK6NgfsI0v/mTgyPKWsX1CnJ0XPSDhViejru1GcRkLWb8RlzFYJRqGUbaug==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/connect-history-api-fallback": {
+      "version": "1.5.4",
+      "resolved": "https://registry.npmmirror.com/@types/connect-history-api-fallback/-/connect-history-api-fallback-1.5.4.tgz",
+      "integrity": "sha512-n6Cr2xS1h4uAulPRdlw6Jl6s1oG8KrVilPN2yUITEs+K48EzMJJ3W1xy8K5eWuFvjp3R74AOIGSmp2UfBJ8HFw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/express-serve-static-core": "*",
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/debug": {
+      "version": "4.1.12",
+      "resolved": "https://registry.npmmirror.com/@types/debug/-/debug-4.1.12.tgz",
+      "integrity": "sha512-vIChWdVG3LG1SMxEvI/AK+FWJthlrqlTu7fbrlywTkkaONwk/UAGaULXRlf8vkzFBLVm0zkMdCquhL5aOjhXPQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/ms": "*"
+      }
+    },
+    "node_modules/@types/estree": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmmirror.com/@types/estree/-/estree-1.0.6.tgz",
+      "integrity": "sha512-AYnb1nQyY49te+VRAVgmzfcgjYS91mY5P0TKUDCLEM+gNnA+3T6rWITXRLYCpahpqSQbN5cE+gHpnPyXjHWxcw==",
+      "license": "MIT"
+    },
+    "node_modules/@types/estree-jsx": {
+      "version": "1.0.5",
+      "resolved": "https://registry.npmmirror.com/@types/estree-jsx/-/estree-jsx-1.0.5.tgz",
+      "integrity": "sha512-52CcUVNFyfb1A2ALocQw/Dd1BQFNmSdkuC3BkZ6iqhdMfQz7JWOFRuJFloOzjk+6WijU56m9oKXFAXc7o3Towg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "*"
+      }
+    },
+    "node_modules/@types/express": {
+      "version": "4.17.21",
+      "resolved": "https://registry.npmmirror.com/@types/express/-/express-4.17.21.tgz",
+      "integrity": "sha512-ejlPM315qwLpaQlQDTjPdsUFSc6ZsP4AN6AlWnogPjQ7CVi7PYF3YVz+CY3jE2pwYf7E/7HlDAN0rV2GxTG0HQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/body-parser": "*",
+        "@types/express-serve-static-core": "^4.17.33",
+        "@types/qs": "*",
+        "@types/serve-static": "*"
+      }
+    },
+    "node_modules/@types/express-serve-static-core": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmmirror.com/@types/express-serve-static-core/-/express-serve-static-core-5.0.0.tgz",
+      "integrity": "sha512-AbXMTZGt40T+KON9/Fdxx0B2WK5hsgxcfXJLr5bFpZ7b4JCex2WyQPTEKdXqfHiY5nKKBScZ7yCoO6Pvgxfvnw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*",
+        "@types/qs": "*",
+        "@types/range-parser": "*",
+        "@types/send": "*"
+      }
+    },
+    "node_modules/@types/express/node_modules/@types/express-serve-static-core": {
+      "version": "4.19.6",
+      "resolved": "https://registry.npmmirror.com/@types/express-serve-static-core/-/express-serve-static-core-4.19.6.tgz",
+      "integrity": "sha512-N4LZ2xG7DatVqhCZzOGb1Yi5lMbXSZcmdLDe9EzSndPV2HpWYWzRbaerl2n27irrm94EPpprqa8KpskPT085+A==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*",
+        "@types/qs": "*",
+        "@types/range-parser": "*",
+        "@types/send": "*"
+      }
+    },
+    "node_modules/@types/gtag.js": {
+      "version": "0.0.12",
+      "resolved": "https://registry.npmmirror.com/@types/gtag.js/-/gtag.js-0.0.12.tgz",
+      "integrity": "sha512-YQV9bUsemkzG81Ea295/nF/5GijnD2Af7QhEofh7xu+kvCN6RdodgNwwGWXB5GMI3NoyvQo0odNctoH/qLMIpg==",
+      "license": "MIT"
+    },
+    "node_modules/@types/hast": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmmirror.com/@types/hast/-/hast-3.0.4.tgz",
+      "integrity": "sha512-WPs+bbQw5aCj+x6laNGWLH3wviHtoCv/P3+otBhbOhJgG8qtpdAMlTCxLtsTWA7LH1Oh/bFCHsBn0TPS5m30EQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "*"
+      }
+    },
+    "node_modules/@types/history": {
+      "version": "4.7.11",
+      "resolved": "https://registry.npmmirror.com/@types/history/-/history-4.7.11.tgz",
+      "integrity": "sha512-qjDJRrmvBMiTx+jyLxvLfJU7UznFuokDv4f3WRuriHKERccVpFU+8XMQUAbDzoiJCsmexxRExQeMwwCdamSKDA==",
+      "license": "MIT"
+    },
+    "node_modules/@types/html-minifier-terser": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/@types/html-minifier-terser/-/html-minifier-terser-6.1.0.tgz",
+      "integrity": "sha512-oh/6byDPnL1zeNXFrDXFLyZjkr1MsBG667IM792caf1L2UPOOMf65NFzjUH/ltyfwjAGfs1rsX1eftK0jC/KIg==",
+      "license": "MIT"
+    },
+    "node_modules/@types/http-cache-semantics": {
+      "version": "4.0.4",
+      "resolved": "https://registry.npmmirror.com/@types/http-cache-semantics/-/http-cache-semantics-4.0.4.tgz",
+      "integrity": "sha512-1m0bIFVc7eJWyve9S0RnuRgcQqF/Xd5QsUZAZeQFr1Q3/p9JWoQQEqmVy+DPTNpGXwhgIetAoYF8JSc33q29QA==",
+      "license": "MIT"
+    },
+    "node_modules/@types/http-errors": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmmirror.com/@types/http-errors/-/http-errors-2.0.4.tgz",
+      "integrity": "sha512-D0CFMMtydbJAegzOyHjtiKPLlvnm3iTZyZRSZoLq2mRhDdmLfIWOCYPfQJ4cu2erKghU++QvjcUjp/5h7hESpA==",
+      "license": "MIT"
+    },
+    "node_modules/@types/http-proxy": {
+      "version": "1.17.15",
+      "resolved": "https://registry.npmmirror.com/@types/http-proxy/-/http-proxy-1.17.15.tgz",
+      "integrity": "sha512-25g5atgiVNTIv0LBDTg1H74Hvayx0ajtJPLLcYE3whFv75J0pWNtOBzaXJQgDTmrX1bx5U9YC2w/n65BN1HwRQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/istanbul-lib-coverage": {
+      "version": "2.0.6",
+      "resolved": "https://registry.npmmirror.com/@types/istanbul-lib-coverage/-/istanbul-lib-coverage-2.0.6.tgz",
+      "integrity": "sha512-2QF/t/auWm0lsy8XtKVPG19v3sSOQlJe/YHZgfjb/KBBHOGSV+J2q/S671rcq9uTBrLAXmZpqJiaQbMT+zNU1w==",
+      "license": "MIT"
+    },
+    "node_modules/@types/istanbul-lib-report": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmmirror.com/@types/istanbul-lib-report/-/istanbul-lib-report-3.0.3.tgz",
+      "integrity": "sha512-NQn7AHQnk/RSLOxrBbGyJM/aVQ+pjj5HCgasFxc0K/KhoATfQ/47AyUl15I2yBUpihjmas+a+VJBOqecrFH+uA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/istanbul-lib-coverage": "*"
+      }
+    },
+    "node_modules/@types/istanbul-reports": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmmirror.com/@types/istanbul-reports/-/istanbul-reports-3.0.4.tgz",
+      "integrity": "sha512-pk2B1NWalF9toCRu6gjBzR69syFjP4Od8WRAX+0mmf9lAjCRicLOWc+ZrxZHx/0XRjotgkF9t6iaMJ+aXcOdZQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/istanbul-lib-report": "*"
+      }
+    },
+    "node_modules/@types/json-schema": {
+      "version": "7.0.15",
+      "resolved": "https://registry.npmmirror.com/@types/json-schema/-/json-schema-7.0.15.tgz",
+      "integrity": "sha512-5+fP8P8MFNC+AyZCDxrB2pkZFPGzqQWUzpSeuuVLvm8VMcorNYavBqoFcxK8bQz4Qsbn4oUEEem4wDLfcysGHA==",
+      "license": "MIT"
+    },
+    "node_modules/@types/mdast": {
+      "version": "4.0.4",
+      "resolved": "https://registry.npmmirror.com/@types/mdast/-/mdast-4.0.4.tgz",
+      "integrity": "sha512-kGaNbPh1k7AFzgpud/gMdvIm5xuECykRR+JnWKQno9TAXVa6WIVCGTPvYGekIDL4uwCZQSYbUxNBSb1aUo79oA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "*"
+      }
+    },
+    "node_modules/@types/mdx": {
+      "version": "2.0.13",
+      "resolved": "https://registry.npmmirror.com/@types/mdx/-/mdx-2.0.13.tgz",
+      "integrity": "sha512-+OWZQfAYyio6YkJb3HLxDrvnx6SWWDbC0zVPfBRzUk0/nqoDyf6dNxQi3eArPe8rJ473nobTMQ/8Zk+LxJ+Yuw==",
+      "license": "MIT"
+    },
+    "node_modules/@types/mime": {
+      "version": "1.3.5",
+      "resolved": "https://registry.npmmirror.com/@types/mime/-/mime-1.3.5.tgz",
+      "integrity": "sha512-/pyBZWSLD2n0dcHE3hq8s8ZvcETHtEuF+3E7XVt0Ig2nvsVQXdghHVcEkIWjy9A0wKfTn97a/PSDYohKIlnP/w==",
+      "license": "MIT"
+    },
+    "node_modules/@types/ms": {
+      "version": "0.7.34",
+      "resolved": "https://registry.npmmirror.com/@types/ms/-/ms-0.7.34.tgz",
+      "integrity": "sha512-nG96G3Wp6acyAgJqGasjODb+acrI7KltPiRxzHPXnP3NgI28bpQDRv53olbqGXbfcgF5aiiHmO3xpwEpS5Ld9g==",
+      "license": "MIT"
+    },
+    "node_modules/@types/node": {
+      "version": "22.7.5",
+      "resolved": "https://registry.npmmirror.com/@types/node/-/node-22.7.5.tgz",
+      "integrity": "sha512-jML7s2NAzMWc//QSJ1a3prpk78cOPchGvXJsC3C6R6PSMoooztvRVQEz89gmBTBY1SPMaqo5teB4uNHPdetShQ==",
+      "license": "MIT",
+      "dependencies": {
+        "undici-types": "~6.19.2"
+      }
+    },
+    "node_modules/@types/node-forge": {
+      "version": "1.3.11",
+      "resolved": "https://registry.npmmirror.com/@types/node-forge/-/node-forge-1.3.11.tgz",
+      "integrity": "sha512-FQx220y22OKNTqaByeBGqHWYz4cl94tpcxeFdvBo3wjG6XPBuZ0BNgNZRV5J5TFmmcsJ4IzsLkmGRiQbnYsBEQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/parse-json": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmmirror.com/@types/parse-json/-/parse-json-4.0.2.tgz",
+      "integrity": "sha512-dISoDXWWQwUquiKsyZ4Ng+HX2KsPL7LyHKHQwgGFEA3IaKac4Obd+h2a/a6waisAoepJlBcx9paWqjA8/HVjCw==",
+      "license": "MIT"
+    },
+    "node_modules/@types/prismjs": {
+      "version": "1.26.4",
+      "resolved": "https://registry.npmmirror.com/@types/prismjs/-/prismjs-1.26.4.tgz",
+      "integrity": "sha512-rlAnzkW2sZOjbqZ743IHUhFcvzaGbqijwOu8QZnZCjfQzBqFE3s4lOTJEsxikImav9uzz/42I+O7YUs1mWgMlg==",
+      "license": "MIT"
+    },
+    "node_modules/@types/prop-types": {
+      "version": "15.7.13",
+      "resolved": "https://registry.npmmirror.com/@types/prop-types/-/prop-types-15.7.13.tgz",
+      "integrity": "sha512-hCZTSvwbzWGvhqxp/RqVqwU999pBf2vp7hzIjiYOsl8wqOmUxkQ6ddw1cV3l8811+kdUFus/q4d1Y3E3SyEifA==",
+      "license": "MIT"
+    },
+    "node_modules/@types/qs": {
+      "version": "6.9.16",
+      "resolved": "https://registry.npmmirror.com/@types/qs/-/qs-6.9.16.tgz",
+      "integrity": "sha512-7i+zxXdPD0T4cKDuxCUXJ4wHcsJLwENa6Z3dCu8cfCK743OGy5Nu1RmAGqDPsoTDINVEcdXKRvR/zre+P2Ku1A==",
+      "license": "MIT"
+    },
+    "node_modules/@types/range-parser": {
+      "version": "1.2.7",
+      "resolved": "https://registry.npmmirror.com/@types/range-parser/-/range-parser-1.2.7.tgz",
+      "integrity": "sha512-hKormJbkJqzQGhziax5PItDUTMAM9uE2XXQmM37dyd4hVM+5aVl7oVxMVUiVQn2oCQFN/LKCZdvSM0pFRqbSmQ==",
+      "license": "MIT"
+    },
+    "node_modules/@types/react": {
+      "version": "18.3.11",
+      "resolved": "https://registry.npmmirror.com/@types/react/-/react-18.3.11.tgz",
+      "integrity": "sha512-r6QZ069rFTjrEYgFdOck1gK7FLVsgJE7tTz0pQBczlBNUhBNk0MQH4UbnFSwjpQLMkLzgqvBBa+qGpLje16eTQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/prop-types": "*",
+        "csstype": "^3.0.2"
+      }
+    },
+    "node_modules/@types/react-router": {
+      "version": "5.1.20",
+      "resolved": "https://registry.npmmirror.com/@types/react-router/-/react-router-5.1.20.tgz",
+      "integrity": "sha512-jGjmu/ZqS7FjSH6owMcD5qpq19+1RS9DeVRqfl1FeBMxTDQAGwlMWOcs52NDoXaNKyG3d1cYQFMs9rCrb88o9Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/history": "^4.7.11",
+        "@types/react": "*"
+      }
+    },
+    "node_modules/@types/react-router-config": {
+      "version": "5.0.11",
+      "resolved": "https://registry.npmmirror.com/@types/react-router-config/-/react-router-config-5.0.11.tgz",
+      "integrity": "sha512-WmSAg7WgqW7m4x8Mt4N6ZyKz0BubSj/2tVUMsAHp+Yd2AMwcSbeFq9WympT19p5heCFmF97R9eD5uUR/t4HEqw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/history": "^4.7.11",
+        "@types/react": "*",
+        "@types/react-router": "^5.1.0"
+      }
+    },
+    "node_modules/@types/react-router-dom": {
+      "version": "5.3.3",
+      "resolved": "https://registry.npmmirror.com/@types/react-router-dom/-/react-router-dom-5.3.3.tgz",
+      "integrity": "sha512-kpqnYK4wcdm5UaWI3fLcELopqLrHgLqNsdpHauzlQktfkHL3npOSwtj1Uz9oKBAzs7lFtVkV8j83voAz2D8fhw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/history": "^4.7.11",
+        "@types/react": "*",
+        "@types/react-router": "*"
+      }
+    },
+    "node_modules/@types/retry": {
+      "version": "0.12.0",
+      "resolved": "https://registry.npmmirror.com/@types/retry/-/retry-0.12.0.tgz",
+      "integrity": "sha512-wWKOClTTiizcZhXnPY4wikVAwmdYHp8q6DmC+EJUzAMsycb7HB32Kh9RN4+0gExjmPmZSAQjgURXIGATPegAvA==",
+      "license": "MIT"
+    },
+    "node_modules/@types/sax": {
+      "version": "1.2.7",
+      "resolved": "https://registry.npmmirror.com/@types/sax/-/sax-1.2.7.tgz",
+      "integrity": "sha512-rO73L89PJxeYM3s3pPPjiPgVVcymqU490g0YO5n5By0k2Erzj6tay/4lr1CHAAU4JyOWd1rpQ8bCf6cZfHU96A==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/send": {
+      "version": "0.17.4",
+      "resolved": "https://registry.npmmirror.com/@types/send/-/send-0.17.4.tgz",
+      "integrity": "sha512-x2EM6TJOybec7c52BX0ZspPodMsQUd5L6PRwOunVyVUhXiBSKf3AezDL8Dgvgt5o0UfKNfuA0eMLr2wLT4AiBA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mime": "^1",
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/serve-index": {
+      "version": "1.9.4",
+      "resolved": "https://registry.npmmirror.com/@types/serve-index/-/serve-index-1.9.4.tgz",
+      "integrity": "sha512-qLpGZ/c2fhSs5gnYsQxtDEq3Oy8SXPClIXkW5ghvAvsNuVSA8k+gCONcUCS/UjLEYvYps+e8uBtfgXgvhwfNug==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/express": "*"
+      }
+    },
+    "node_modules/@types/serve-static": {
+      "version": "1.15.7",
+      "resolved": "https://registry.npmmirror.com/@types/serve-static/-/serve-static-1.15.7.tgz",
+      "integrity": "sha512-W8Ym+h8nhuRwaKPaDw34QUkwsGi6Rc4yYqvKFo5rm2FUEhCFbzVWrxXUxuKK8TASjWsysJY0nsmNCGhCOIsrOw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/http-errors": "*",
+        "@types/node": "*",
+        "@types/send": "*"
+      }
+    },
+    "node_modules/@types/sockjs": {
+      "version": "0.3.36",
+      "resolved": "https://registry.npmmirror.com/@types/sockjs/-/sockjs-0.3.36.tgz",
+      "integrity": "sha512-MK9V6NzAS1+Ud7JV9lJLFqW85VbC9dq3LmwZCuBe4wBDgKC0Kj/jd8Xl+nSviU+Qc3+m7umHHyHg//2KSa0a0Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/unist": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmmirror.com/@types/unist/-/unist-3.0.3.tgz",
+      "integrity": "sha512-ko/gIFJRv177XgZsZcBwnqJN5x/Gien8qNOn0D5bQU/zAzVf9Zt3BlcUiLqhV9y4ARk0GbT3tnUiPNgnTXzc/Q==",
+      "license": "MIT"
+    },
+    "node_modules/@types/ws": {
+      "version": "8.5.12",
+      "resolved": "https://registry.npmmirror.com/@types/ws/-/ws-8.5.12.tgz",
+      "integrity": "sha512-3tPRkv1EtkDpzlgyKyI8pGsGZAGPEaXeu0DOj5DI25Ja91bdAYddYHbADRYVrZMRbfW+1l5YwXVDKohDJNQxkQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*"
+      }
+    },
+    "node_modules/@types/yargs": {
+      "version": "17.0.33",
+      "resolved": "https://registry.npmmirror.com/@types/yargs/-/yargs-17.0.33.tgz",
+      "integrity": "sha512-WpxBCKWPLr4xSsHgz511rFJAM+wS28w2zEO1QDNY5zM/S8ok70NNfztH0xwhqKyaK0OHCbN98LDAZuy1ctxDkA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/yargs-parser": "*"
+      }
+    },
+    "node_modules/@types/yargs-parser": {
+      "version": "21.0.3",
+      "resolved": "https://registry.npmmirror.com/@types/yargs-parser/-/yargs-parser-21.0.3.tgz",
+      "integrity": "sha512-I4q9QU9MQv4oEOz4tAHJtNz1cwuLxn2F3xcc2iV5WdqLPpUnj30aUuxt1mAxYTG+oe8CZMV/+6rU4S4gRDzqtQ==",
+      "license": "MIT"
+    },
+    "node_modules/@ungap/structured-clone": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmmirror.com/@ungap/structured-clone/-/structured-clone-1.2.0.tgz",
+      "integrity": "sha512-zuVdFrMJiuCDQUMCzQaD6KL28MjnqqN8XnAqiEq9PNm/hCPTSGfrXCOfwj1ow4LFb/tNymJPwsNbVePc1xFqrQ==",
+      "license": "ISC"
+    },
+    "node_modules/@webassemblyjs/ast": {
+      "version": "1.12.1",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/ast/-/ast-1.12.1.tgz",
+      "integrity": "sha512-EKfMUOPRRUTy5UII4qJDGPpqfwjOmZ5jeGFwid9mnoqIFK+e0vqoi1qH56JpmZSzEL53jKnNzScdmftJyG5xWg==",
+      "license": "MIT",
+      "dependencies": {
+        "@webassemblyjs/helper-numbers": "1.11.6",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.6"
+      }
+    },
+    "node_modules/@webassemblyjs/floating-point-hex-parser": {
+      "version": "1.11.6",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/floating-point-hex-parser/-/floating-point-hex-parser-1.11.6.tgz",
+      "integrity": "sha512-ejAj9hfRJ2XMsNHk/v6Fu2dGS+i4UaXBXGemOfQ/JfQ6mdQg/WXtwleQRLLS4OvfDhv8rYnVwH27YJLMyYsxhw==",
+      "license": "MIT"
+    },
+    "node_modules/@webassemblyjs/helper-api-error": {
+      "version": "1.11.6",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/helper-api-error/-/helper-api-error-1.11.6.tgz",
+      "integrity": "sha512-o0YkoP4pVu4rN8aTJgAyj9hC2Sv5UlkzCHhxqWj8butaLvnpdc2jOwh4ewE6CX0txSfLn/UYaV/pheS2Txg//Q==",
+      "license": "MIT"
+    },
+    "node_modules/@webassemblyjs/helper-buffer": {
+      "version": "1.12.1",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/helper-buffer/-/helper-buffer-1.12.1.tgz",
+      "integrity": "sha512-nzJwQw99DNDKr9BVCOZcLuJJUlqkJh+kVzVl6Fmq/tI5ZtEyWT1KZMyOXltXLZJmDtvLCDgwsyrkohEtopTXCw==",
+      "license": "MIT"
+    },
+    "node_modules/@webassemblyjs/helper-numbers": {
+      "version": "1.11.6",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/helper-numbers/-/helper-numbers-1.11.6.tgz",
+      "integrity": "sha512-vUIhZ8LZoIWHBohiEObxVm6hwP034jwmc9kuq5GdHZH0wiLVLIPcMCdpJzG4C11cHoQ25TFIQj9kaVADVX7N3g==",
+      "license": "MIT",
+      "dependencies": {
+        "@webassemblyjs/floating-point-hex-parser": "1.11.6",
+        "@webassemblyjs/helper-api-error": "1.11.6",
+        "@xtuc/long": "4.2.2"
+      }
+    },
+    "node_modules/@webassemblyjs/helper-wasm-bytecode": {
+      "version": "1.11.6",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/helper-wasm-bytecode/-/helper-wasm-bytecode-1.11.6.tgz",
+      "integrity": "sha512-sFFHKwcmBprO9e7Icf0+gddyWYDViL8bpPjJJl0WHxCdETktXdmtWLGVzoHbqUcY4Be1LkNfwTmXOJUFZYSJdA==",
+      "license": "MIT"
+    },
+    "node_modules/@webassemblyjs/helper-wasm-section": {
+      "version": "1.12.1",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.12.1.tgz",
+      "integrity": "sha512-Jif4vfB6FJlUlSbgEMHUyk1j234GTNG9dBJ4XJdOySoj518Xj0oGsNi59cUQF4RRMS9ouBUxDDdyBVfPTypa5g==",
+      "license": "MIT",
+      "dependencies": {
+        "@webassemblyjs/ast": "1.12.1",
+        "@webassemblyjs/helper-buffer": "1.12.1",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.6",
+        "@webassemblyjs/wasm-gen": "1.12.1"
+      }
+    },
+    "node_modules/@webassemblyjs/ieee754": {
+      "version": "1.11.6",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/ieee754/-/ieee754-1.11.6.tgz",
+      "integrity": "sha512-LM4p2csPNvbij6U1f19v6WR56QZ8JcHg3QIJTlSwzFcmx6WSORicYj6I63f9yU1kEUtrpG+kjkiIAkevHpDXrg==",
+      "license": "MIT",
+      "dependencies": {
+        "@xtuc/ieee754": "^1.2.0"
+      }
+    },
+    "node_modules/@webassemblyjs/leb128": {
+      "version": "1.11.6",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/leb128/-/leb128-1.11.6.tgz",
+      "integrity": "sha512-m7a0FhE67DQXgouf1tbN5XQcdWoNgaAuoULHIfGFIEVKA6tu/edls6XnIlkmS6FrXAquJRPni3ZZKjw6FSPjPQ==",
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@xtuc/long": "4.2.2"
+      }
+    },
+    "node_modules/@webassemblyjs/utf8": {
+      "version": "1.11.6",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/utf8/-/utf8-1.11.6.tgz",
+      "integrity": "sha512-vtXf2wTQ3+up9Zsg8sa2yWiQpzSsMyXj0qViVP6xKGCUT8p8YJ6HqI7l5eCnWx1T/FYdsv07HQs2wTFbbof/RA==",
+      "license": "MIT"
+    },
+    "node_modules/@webassemblyjs/wasm-edit": {
+      "version": "1.12.1",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/wasm-edit/-/wasm-edit-1.12.1.tgz",
+      "integrity": "sha512-1DuwbVvADvS5mGnXbE+c9NfA8QRcZ6iKquqjjmR10k6o+zzsRVesil54DKexiowcFCPdr/Q0qaMgB01+SQ1u6g==",
+      "license": "MIT",
+      "dependencies": {
+        "@webassemblyjs/ast": "1.12.1",
+        "@webassemblyjs/helper-buffer": "1.12.1",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.6",
+        "@webassemblyjs/helper-wasm-section": "1.12.1",
+        "@webassemblyjs/wasm-gen": "1.12.1",
+        "@webassemblyjs/wasm-opt": "1.12.1",
+        "@webassemblyjs/wasm-parser": "1.12.1",
+        "@webassemblyjs/wast-printer": "1.12.1"
+      }
+    },
+    "node_modules/@webassemblyjs/wasm-gen": {
+      "version": "1.12.1",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/wasm-gen/-/wasm-gen-1.12.1.tgz",
+      "integrity": "sha512-TDq4Ojh9fcohAw6OIMXqiIcTq5KUXTGRkVxbSo1hQnSy6lAM5GSdfwWeSxpAo0YzgsgF182E/U0mDNhuA0tW7w==",
+      "license": "MIT",
+      "dependencies": {
+        "@webassemblyjs/ast": "1.12.1",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.6",
+        "@webassemblyjs/ieee754": "1.11.6",
+        "@webassemblyjs/leb128": "1.11.6",
+        "@webassemblyjs/utf8": "1.11.6"
+      }
+    },
+    "node_modules/@webassemblyjs/wasm-opt": {
+      "version": "1.12.1",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/wasm-opt/-/wasm-opt-1.12.1.tgz",
+      "integrity": "sha512-Jg99j/2gG2iaz3hijw857AVYekZe2SAskcqlWIZXjji5WStnOpVoat3gQfT/Q5tb2djnCjBtMocY/Su1GfxPBg==",
+      "license": "MIT",
+      "dependencies": {
+        "@webassemblyjs/ast": "1.12.1",
+        "@webassemblyjs/helper-buffer": "1.12.1",
+        "@webassemblyjs/wasm-gen": "1.12.1",
+        "@webassemblyjs/wasm-parser": "1.12.1"
+      }
+    },
+    "node_modules/@webassemblyjs/wasm-parser": {
+      "version": "1.12.1",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/wasm-parser/-/wasm-parser-1.12.1.tgz",
+      "integrity": "sha512-xikIi7c2FHXysxXe3COrVUPSheuBtpcfhbpFj4gmu7KRLYOzANztwUU0IbsqvMqzuNK2+glRGWCEqZo1WCLyAQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@webassemblyjs/ast": "1.12.1",
+        "@webassemblyjs/helper-api-error": "1.11.6",
+        "@webassemblyjs/helper-wasm-bytecode": "1.11.6",
+        "@webassemblyjs/ieee754": "1.11.6",
+        "@webassemblyjs/leb128": "1.11.6",
+        "@webassemblyjs/utf8": "1.11.6"
+      }
+    },
+    "node_modules/@webassemblyjs/wast-printer": {
+      "version": "1.12.1",
+      "resolved": "https://registry.npmmirror.com/@webassemblyjs/wast-printer/-/wast-printer-1.12.1.tgz",
+      "integrity": "sha512-+X4WAlOisVWQMikjbcvY2e0rwPsKQ9F688lksZhBcPycBBuii3O7m8FACbDMWDojpAqvjIncrG8J0XHKyQfVeA==",
+      "license": "MIT",
+      "dependencies": {
+        "@webassemblyjs/ast": "1.12.1",
+        "@xtuc/long": "4.2.2"
+      }
+    },
+    "node_modules/@xtuc/ieee754": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmmirror.com/@xtuc/ieee754/-/ieee754-1.2.0.tgz",
+      "integrity": "sha512-DX8nKgqcGwsc0eJSqYt5lwP4DH5FlHnmuWWBRy7X0NcaGR0ZtuyeESgMwTYVEtxmsNGY+qit4QYT/MIYTOTPeA==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@xtuc/long": {
+      "version": "4.2.2",
+      "resolved": "https://registry.npmmirror.com/@xtuc/long/-/long-4.2.2.tgz",
+      "integrity": "sha512-NuHqBY1PB/D8xU6s/thBgOAiAP7HOYDQ32+BFZILJ8ivkUkAHQnWfn6WhL79Owj1qmUnoN/YPhktdIoucipkAQ==",
+      "license": "Apache-2.0"
+    },
+    "node_modules/accepts": {
+      "version": "1.3.8",
+      "resolved": "https://registry.npmmirror.com/accepts/-/accepts-1.3.8.tgz",
+      "integrity": "sha512-PYAthTa2m2VKxuvSD3DPC/Gy+U+sOA1LAuT8mkmRuvw+NACSaeXEQ+NHcVF7rONl6qcaxV3Uuemwawk+7+SJLw==",
+      "license": "MIT",
+      "dependencies": {
+        "mime-types": "~2.1.34",
+        "negotiator": "0.6.3"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/accepts/node_modules/mime-db": {
+      "version": "1.52.0",
+      "resolved": "https://registry.npmmirror.com/mime-db/-/mime-db-1.52.0.tgz",
+      "integrity": "sha512-sPU4uV7dYlvtWJxwwxHD0PuihVNiE7TyAbQ5SWxDCB9mUYvOgroQOwYQQOKPJ8CIbE+1ETVlOoK1UC2nU3gYvg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/accepts/node_modules/mime-types": {
+      "version": "2.1.35",
+      "resolved": "https://registry.npmmirror.com/mime-types/-/mime-types-2.1.35.tgz",
+      "integrity": "sha512-ZDY+bPm5zTTF+YpCrAU9nK0UgICYPT0QtT1NZWFv4s++TNkcgVaT0g6+4R2uI4MjQjzysHB1zxuWL50hzaeXiw==",
+      "license": "MIT",
+      "dependencies": {
+        "mime-db": "1.52.0"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/acorn": {
+      "version": "8.12.1",
+      "resolved": "https://registry.npmmirror.com/acorn/-/acorn-8.12.1.tgz",
+      "integrity": "sha512-tcpGyI9zbizT9JbV6oYE477V6mTlXvvi0T0G3SNIYE2apm/G5huBa1+K89VGeovbg+jycCrfhl3ADxErOuO6Jg==",
+      "license": "MIT",
+      "bin": {
+        "acorn": "bin/acorn"
+      },
+      "engines": {
+        "node": ">=0.4.0"
+      }
+    },
+    "node_modules/acorn-import-attributes": {
+      "version": "1.9.5",
+      "resolved": "https://registry.npmmirror.com/acorn-import-attributes/-/acorn-import-attributes-1.9.5.tgz",
+      "integrity": "sha512-n02Vykv5uA3eHGM/Z2dQrcD56kL8TyDb2p1+0P83PClMnC/nc+anbQRhIOWnSq4Ke/KvDPrY3C9hDtC/A3eHnQ==",
+      "license": "MIT",
+      "peerDependencies": {
+        "acorn": "^8"
+      }
+    },
+    "node_modules/acorn-jsx": {
+      "version": "5.3.2",
+      "resolved": "https://registry.npmmirror.com/acorn-jsx/-/acorn-jsx-5.3.2.tgz",
+      "integrity": "sha512-rq9s+JNhf0IChjtDXxllJ7g41oZk5SlXtp0LHwyA5cejwn7vKmKp4pPri6YEePv2PU65sAsegbXtIinmDFDXgQ==",
+      "license": "MIT",
+      "peerDependencies": {
+        "acorn": "^6.0.0 || ^7.0.0 || ^8.0.0"
+      }
+    },
+    "node_modules/acorn-walk": {
+      "version": "8.3.4",
+      "resolved": "https://registry.npmmirror.com/acorn-walk/-/acorn-walk-8.3.4.tgz",
+      "integrity": "sha512-ueEepnujpqee2o5aIYnvHU6C0A42MNdsIDeqy5BydrkuC5R1ZuUFnm27EeFJGoEHJQgn3uleRvmTXaJgfXbt4g==",
+      "license": "MIT",
+      "dependencies": {
+        "acorn": "^8.11.0"
+      },
+      "engines": {
+        "node": ">=0.4.0"
+      }
+    },
+    "node_modules/address": {
+      "version": "1.2.2",
+      "resolved": "https://registry.npmmirror.com/address/-/address-1.2.2.tgz",
+      "integrity": "sha512-4B/qKCfeE/ODUaAUpSwfzazo5x29WD4r3vXiWsB7I2mSDAihwEqKO+g8GELZUQSSAo5e1XTYh3ZVfLyxBc12nA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 10.0.0"
+      }
+    },
+    "node_modules/aggregate-error": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/aggregate-error/-/aggregate-error-3.1.0.tgz",
+      "integrity": "sha512-4I7Td01quW/RpocfNayFdFVk1qSuoh0E7JrbRJ16nH01HhKFQ88INq9Sd+nd72zqRySlr9BmDA8xlEJ6vJMrYA==",
+      "license": "MIT",
+      "dependencies": {
+        "clean-stack": "^2.0.0",
+        "indent-string": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/ajv": {
+      "version": "8.17.1",
+      "resolved": "https://registry.npmmirror.com/ajv/-/ajv-8.17.1.tgz",
+      "integrity": "sha512-B/gBuNg5SiMTrPkC+A2+cW0RszwxYmn6VYxB/inlBStS5nx6xHIt/ehKRhIMhqusl7a8LjQoZnjCs5vhwxOQ1g==",
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.3",
+        "fast-uri": "^3.0.1",
+        "json-schema-traverse": "^1.0.0",
+        "require-from-string": "^2.0.2"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/epoberezkin"
+      }
+    },
+    "node_modules/ajv-formats": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmmirror.com/ajv-formats/-/ajv-formats-2.1.1.tgz",
+      "integrity": "sha512-Wx0Kx52hxE7C18hkMEggYlEifqWZtYaRgouJor+WMdPnQyEK13vgEWyVNup7SoeeoLMsr4kf5h6dOW11I15MUA==",
+      "license": "MIT",
+      "dependencies": {
+        "ajv": "^8.0.0"
+      },
+      "peerDependencies": {
+        "ajv": "^8.0.0"
+      },
+      "peerDependenciesMeta": {
+        "ajv": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/ajv-keywords": {
+      "version": "5.1.0",
+      "resolved": "https://registry.npmmirror.com/ajv-keywords/-/ajv-keywords-5.1.0.tgz",
+      "integrity": "sha512-YCS/JNFAUyr5vAuhk1DWm1CBxRHW9LbJ2ozWeemrIqpbsqKjHVxYPyi5GC0rjZIT5JxJ3virVTS8wk4i/Z+krw==",
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.3"
+      },
+      "peerDependencies": {
+        "ajv": "^8.8.2"
+      }
+    },
+    "node_modules/algoliasearch": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/algoliasearch/-/algoliasearch-4.24.0.tgz",
+      "integrity": "sha512-bf0QV/9jVejssFBmz2HQLxUadxk574t4iwjCKp5E7NBzwKkrDEhKPISIIjAU/p6K5qDx3qoeh4+26zWN1jmw3g==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/cache-browser-local-storage": "4.24.0",
+        "@algolia/cache-common": "4.24.0",
+        "@algolia/cache-in-memory": "4.24.0",
+        "@algolia/client-account": "4.24.0",
+        "@algolia/client-analytics": "4.24.0",
+        "@algolia/client-common": "4.24.0",
+        "@algolia/client-personalization": "4.24.0",
+        "@algolia/client-search": "4.24.0",
+        "@algolia/logger-common": "4.24.0",
+        "@algolia/logger-console": "4.24.0",
+        "@algolia/recommend": "4.24.0",
+        "@algolia/requester-browser-xhr": "4.24.0",
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/requester-node-http": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/algoliasearch-helper": {
+      "version": "3.22.5",
+      "resolved": "https://registry.npmmirror.com/algoliasearch-helper/-/algoliasearch-helper-3.22.5.tgz",
+      "integrity": "sha512-lWvhdnc+aKOKx8jyA3bsdEgHzm/sglC4cYdMG4xSQyRiPLJVJtH/IVYZG3Hp6PkTEhQqhyVYkeP9z2IlcHJsWw==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/events": "^4.0.1"
+      },
+      "peerDependencies": {
+        "algoliasearch": ">= 3.1 < 6"
+      }
+    },
+    "node_modules/algoliasearch/node_modules/@algolia/client-common": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-common/-/client-common-4.24.0.tgz",
+      "integrity": "sha512-bc2ROsNL6w6rqpl5jj/UywlIYC21TwSSoFHKl01lYirGMW+9Eek6r02Tocg4gZ8HAw3iBvu6XQiM3BEbmEMoiA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/algoliasearch/node_modules/@algolia/client-search": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/client-search/-/client-search-4.24.0.tgz",
+      "integrity": "sha512-uRW6EpNapmLAD0mW47OXqTP8eiIx5F6qN9/x/7HHO6owL3N1IXqydGwW5nhDFBrV+ldouro2W1VX3XlcUXEFCA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/client-common": "4.24.0",
+        "@algolia/requester-common": "4.24.0",
+        "@algolia/transporter": "4.24.0"
+      }
+    },
+    "node_modules/algoliasearch/node_modules/@algolia/requester-browser-xhr": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/requester-browser-xhr/-/requester-browser-xhr-4.24.0.tgz",
+      "integrity": "sha512-Z2NxZMb6+nVXSjF13YpjYTdvV3032YTBSGm2vnYvYPA6mMxzM3v5rsCiSspndn9rzIW4Qp1lPHBvuoKJV6jnAA==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/requester-common": "4.24.0"
+      }
+    },
+    "node_modules/algoliasearch/node_modules/@algolia/requester-node-http": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/@algolia/requester-node-http/-/requester-node-http-4.24.0.tgz",
+      "integrity": "sha512-JF18yTjNOVYvU/L3UosRcvbPMGT9B+/GQWNWnenIImglzNVGpyzChkXLnrSf6uxwVNO6ESGu6oN8MqcGQcjQJw==",
+      "license": "MIT",
+      "dependencies": {
+        "@algolia/requester-common": "4.24.0"
+      }
+    },
+    "node_modules/ansi-align": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/ansi-align/-/ansi-align-3.0.1.tgz",
+      "integrity": "sha512-IOfwwBF5iczOjp/WeY4YxyjqAFMQoZufdQWDd19SEExbVLNXqvpzSJ/M7Za4/sCPmQ0+GRquoA7bGcINcxew6w==",
+      "license": "ISC",
+      "dependencies": {
+        "string-width": "^4.1.0"
+      }
+    },
+    "node_modules/ansi-align/node_modules/emoji-regex": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/emoji-regex/-/emoji-regex-8.0.0.tgz",
+      "integrity": "sha512-MSjYzcWNOA0ewAHpz0MxpYFvwg6yjy1NG3xteoqz644VCo/RPgnr1/GGt+ic3iJTzQ8Eu3TdM14SawnVUmGE6A==",
+      "license": "MIT"
+    },
+    "node_modules/ansi-align/node_modules/string-width": {
+      "version": "4.2.3",
+      "resolved": "https://registry.npmmirror.com/string-width/-/string-width-4.2.3.tgz",
+      "integrity": "sha512-wKyQRQpjJ0sIp62ErSZdGsjMJWsap5oRNihHhu6G7JVO/9jIB6UyevL+tXuOqrng8j/cxKTWyWUwvSTriiZz/g==",
+      "license": "MIT",
+      "dependencies": {
+        "emoji-regex": "^8.0.0",
+        "is-fullwidth-code-point": "^3.0.0",
+        "strip-ansi": "^6.0.1"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/ansi-html-community": {
+      "version": "0.0.8",
+      "resolved": "https://registry.npmmirror.com/ansi-html-community/-/ansi-html-community-0.0.8.tgz",
+      "integrity": "sha512-1APHAyr3+PCamwNw3bXCPp4HFLONZt/yIH0sZp0/469KWNTEy+qN5jQ3GVX6DMZ1UXAi34yVwtTeaG/HpBuuzw==",
+      "engines": [
+        "node >= 0.8.0"
+      ],
+      "license": "Apache-2.0",
+      "bin": {
+        "ansi-html": "bin/ansi-html"
+      }
+    },
+    "node_modules/ansi-regex": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmmirror.com/ansi-regex/-/ansi-regex-5.0.1.tgz",
+      "integrity": "sha512-quJQXlTSUGL2LH9SUXo8VwsY4soanhgo6LNSm84E1LBcE8s3O0wpdiRzyR9z/ZZJMlMWv37qOOb9pdJlMUEKFQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/ansi-styles": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmmirror.com/ansi-styles/-/ansi-styles-4.3.0.tgz",
+      "integrity": "sha512-zbB9rCJAT1rbjiVDb2hqKFHNYLxgtk8NURxZ3IZwD3F6NtxbXZQCnnSi1Lkx+IDohdPlFp222wVALIheZJQSEg==",
+      "license": "MIT",
+      "dependencies": {
+        "color-convert": "^2.0.1"
+      },
+      "engines": {
+        "node": ">=8"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/ansi-styles?sponsor=1"
+      }
+    },
+    "node_modules/antd": {
+      "version": "5.21.5",
+      "resolved": "https://registry.npmmirror.com/antd/-/antd-5.21.5.tgz",
+      "integrity": "sha512-g/c8VkdruKDCVA6di9Ow1fG6dLtYJ1IOraPo7vXaY7DoQ56A3HExaFaH0fBEwTYKC0ICeftC4iA5eAjrF6/b9w==",
+      "license": "MIT",
+      "dependencies": {
+        "@ant-design/colors": "^7.1.0",
+        "@ant-design/cssinjs": "^1.21.1",
+        "@ant-design/cssinjs-utils": "^1.1.1",
+        "@ant-design/icons": "^5.5.1",
+        "@ant-design/react-slick": "~1.1.2",
+        "@babel/runtime": "^7.25.6",
+        "@ctrl/tinycolor": "^3.6.1",
+        "@rc-component/color-picker": "~2.0.1",
+        "@rc-component/mutate-observer": "^1.1.0",
+        "@rc-component/qrcode": "~1.0.0",
+        "@rc-component/tour": "~1.15.1",
+        "@rc-component/trigger": "^2.2.3",
+        "classnames": "^2.5.1",
+        "copy-to-clipboard": "^3.3.3",
+        "dayjs": "^1.11.11",
+        "rc-cascader": "~3.28.2",
+        "rc-checkbox": "~3.3.0",
+        "rc-collapse": "~3.8.0",
+        "rc-dialog": "~9.6.0",
+        "rc-drawer": "~7.2.0",
+        "rc-dropdown": "~4.2.0",
+        "rc-field-form": "~2.4.0",
+        "rc-image": "~7.11.0",
+        "rc-input": "~1.6.3",
+        "rc-input-number": "~9.2.0",
+        "rc-mentions": "~2.16.1",
+        "rc-menu": "~9.15.1",
+        "rc-motion": "^2.9.3",
+        "rc-notification": "~5.6.2",
+        "rc-pagination": "~4.3.0",
+        "rc-picker": "~4.6.15",
+        "rc-progress": "~4.0.0",
+        "rc-rate": "~2.13.0",
+        "rc-resize-observer": "^1.4.0",
+        "rc-segmented": "~2.5.0",
+        "rc-select": "~14.15.2",
+        "rc-slider": "~11.1.7",
+        "rc-steps": "~6.0.1",
+        "rc-switch": "~4.1.0",
+        "rc-table": "~7.47.5",
+        "rc-tabs": "~15.3.0",
+        "rc-textarea": "~1.8.2",
+        "rc-tooltip": "~6.2.1",
+        "rc-tree": "~5.9.0",
+        "rc-tree-select": "~5.23.0",
+        "rc-upload": "~4.8.1",
+        "rc-util": "^5.43.0",
+        "scroll-into-view-if-needed": "^3.1.0",
+        "throttle-debounce": "^5.0.2"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/ant-design"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/anymatch": {
+      "version": "3.1.3",
+      "resolved": "https://registry.npmmirror.com/anymatch/-/anymatch-3.1.3.tgz",
+      "integrity": "sha512-KMReFUr0B4t+D+OBkjR3KYqvocp2XaSzO55UcB6mgQMd3KbcE+mWTyvVV7D/zsdEbNnV6acZUutkiHQXvTr1Rw==",
+      "license": "ISC",
+      "dependencies": {
+        "normalize-path": "^3.0.0",
+        "picomatch": "^2.0.4"
+      },
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/arg": {
+      "version": "5.0.2",
+      "resolved": "https://registry.npmmirror.com/arg/-/arg-5.0.2.tgz",
+      "integrity": "sha512-PYjyFOLKQ9y57JvQ6QLo8dAgNqswh8M1RMJYdQduT6xbWSgK36P/Z/v+p888pM69jMMfS8Xd8F6I1kQ/I9HUGg==",
+      "license": "MIT"
+    },
+    "node_modules/argparse": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/argparse/-/argparse-2.0.1.tgz",
+      "integrity": "sha512-8+9WqebbFzpX9OR+Wa6O29asIogeRMzcGtAINdpMHHyAg10f05aSFVBbcEqGf/PXw1EjAZ+q2/bEBg3DvurK3Q==",
+      "license": "Python-2.0"
+    },
+    "node_modules/array-flatten": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmmirror.com/array-flatten/-/array-flatten-1.1.1.tgz",
+      "integrity": "sha512-PCVAQswWemu6UdxsDFFX/+gVeYqKAod3D3UVm91jHwynguOwAvYPhx8nNlM++NqRcK6CxxpUafjmhIdKiHibqg==",
+      "license": "MIT"
+    },
+    "node_modules/array-tree-filter": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/array-tree-filter/-/array-tree-filter-2.1.0.tgz",
+      "integrity": "sha512-4ROwICNlNw/Hqa9v+rk5h22KjmzB1JGTMVKP2AKJBOCgb0yL0ASf0+YvCcLNNwquOHNX48jkeZIJ3a+oOQqKcw==",
+      "license": "MIT"
+    },
+    "node_modules/array-union": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/array-union/-/array-union-2.1.0.tgz",
+      "integrity": "sha512-HGyxoOTYUyCM6stUe6EJgnd4EoewAI7zMdfqO+kGjnlZmBDz/cR5pf8r/cR4Wq60sL/p0IkcjUEEPwS3GFrIyw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/astring": {
+      "version": "1.9.0",
+      "resolved": "https://registry.npmmirror.com/astring/-/astring-1.9.0.tgz",
+      "integrity": "sha512-LElXdjswlqjWrPpJFg1Fx4wpkOCxj1TDHlSV4PlaRxHGWko024xICaa97ZkMfs6DRKlCguiAI+rbXv5GWwXIkg==",
+      "license": "MIT",
+      "bin": {
+        "astring": "bin/astring"
+      }
+    },
+    "node_modules/at-least-node": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/at-least-node/-/at-least-node-1.0.0.tgz",
+      "integrity": "sha512-+q/t7Ekv1EDY2l6Gda6LLiX14rU9TV20Wa3ofeQmwPFZbOMo9DXrLbOjFaaclkXKWidIaopwAObQDqwWtGUjqg==",
+      "license": "ISC",
+      "engines": {
+        "node": ">= 4.0.0"
+      }
+    },
+    "node_modules/autoprefixer": {
+      "version": "10.4.20",
+      "resolved": "https://registry.npmmirror.com/autoprefixer/-/autoprefixer-10.4.20.tgz",
+      "integrity": "sha512-XY25y5xSv/wEoqzDyXXME4AFfkZI0P23z6Fs3YgymDnKJkCGOnkL0iTxCa85UTqaSgfcqyf3UA6+c7wUvx/16g==",
+      "funding": [
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/postcss/"
+        },
+        {
+          "type": "tidelift",
+          "url": "https://tidelift.com/funding/github/npm/autoprefixer"
+        },
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/ai"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.3",
+        "caniuse-lite": "^1.0.30001646",
+        "fraction.js": "^4.3.7",
+        "normalize-range": "^0.1.2",
+        "picocolors": "^1.0.1",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "bin": {
+        "autoprefixer": "bin/autoprefixer"
+      },
+      "engines": {
+        "node": "^10 || ^12 || >=14"
+      },
+      "peerDependencies": {
+        "postcss": "^8.1.0"
+      }
+    },
+    "node_modules/babel-loader": {
+      "version": "9.2.1",
+      "resolved": "https://registry.npmmirror.com/babel-loader/-/babel-loader-9.2.1.tgz",
+      "integrity": "sha512-fqe8naHt46e0yIdkjUZYqddSXfej3AHajX+CSO5X7oy0EmPc6o5Xh+RClNoHjnieWz9AW4kZxW9yyFMhVB1QLA==",
+      "license": "MIT",
+      "dependencies": {
+        "find-cache-dir": "^4.0.0",
+        "schema-utils": "^4.0.0"
+      },
+      "engines": {
+        "node": ">= 14.15.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.12.0",
+        "webpack": ">=5"
+      }
+    },
+    "node_modules/babel-plugin-dynamic-import-node": {
+      "version": "2.3.3",
+      "resolved": "https://registry.npmmirror.com/babel-plugin-dynamic-import-node/-/babel-plugin-dynamic-import-node-2.3.3.tgz",
+      "integrity": "sha512-jZVI+s9Zg3IqA/kdi0i6UDCybUI3aSBLnglhYbSSjKlV7yF1F/5LWv8MakQmvYpnbJDS6fcBL2KzHSxNCMtWSQ==",
+      "license": "MIT",
+      "dependencies": {
+        "object.assign": "^4.1.0"
+      }
+    },
+    "node_modules/babel-plugin-polyfill-corejs2": {
+      "version": "0.4.11",
+      "resolved": "https://registry.npmmirror.com/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.11.tgz",
+      "integrity": "sha512-sMEJ27L0gRHShOh5G54uAAPaiCOygY/5ratXuiyb2G46FmlSpc9eFCzYVyDiPxfNbwzA7mYahmjQc5q+CZQ09Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/compat-data": "^7.22.6",
+        "@babel/helper-define-polyfill-provider": "^0.6.2",
+        "semver": "^6.3.1"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
+      }
+    },
+    "node_modules/babel-plugin-polyfill-corejs2/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmmirror.com/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/babel-plugin-polyfill-corejs3": {
+      "version": "0.10.6",
+      "resolved": "https://registry.npmmirror.com/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.10.6.tgz",
+      "integrity": "sha512-b37+KR2i/khY5sKmWNVQAnitvquQbNdWy6lJdsr0kmquCKEEUgMKK4SboVM3HtfnZilfjr4MMQ7vY58FVWDtIA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-define-polyfill-provider": "^0.6.2",
+        "core-js-compat": "^3.38.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
+      }
+    },
+    "node_modules/babel-plugin-polyfill-regenerator": {
+      "version": "0.6.2",
+      "resolved": "https://registry.npmmirror.com/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.6.2.tgz",
+      "integrity": "sha512-2R25rQZWP63nGwaAswvDazbPXfrM3HwVoBXK6HcqeKrSrL/JqcC/rDcf95l4r7LXLyxDXc8uQDa064GubtCABg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-define-polyfill-provider": "^0.6.2"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
+      }
+    },
+    "node_modules/bail": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/bail/-/bail-2.0.2.tgz",
+      "integrity": "sha512-0xO6mYd7JB2YesxDKplafRpsiOzPt9V02ddPCLbY1xYGPOX24NTyN50qnUxgCPcSoYMhKpAuBTjQoRZCAkUDRw==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/balanced-match": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/balanced-match/-/balanced-match-1.0.2.tgz",
+      "integrity": "sha512-3oSeUO0TMV67hN1AmbXsK4yaqU7tjiHlbxRDZOpH0KW9+CeX4bRAaX0Anxt0tx2MrpRpWwQaPwIlISEJhYU5Pw==",
+      "license": "MIT"
+    },
+    "node_modules/batch": {
+      "version": "0.6.1",
+      "resolved": "https://registry.npmmirror.com/batch/-/batch-0.6.1.tgz",
+      "integrity": "sha512-x+VAiMRL6UPkx+kudNvxTl6hB2XNNCG2r+7wixVfIYwu/2HKRXimwQyaumLjMveWvT2Hkd/cAJw+QBMfJ/EKVw==",
+      "license": "MIT"
+    },
+    "node_modules/big.js": {
+      "version": "5.2.2",
+      "resolved": "https://registry.npmmirror.com/big.js/-/big.js-5.2.2.tgz",
+      "integrity": "sha512-vyL2OymJxmarO8gxMr0mhChsO9QGwhynfuu4+MHTAW6czfq9humCB7rKpUjDd9YUiDPU4mzpyupFSvOClAwbmQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "*"
+      }
+    },
+    "node_modules/binary-extensions": {
+      "version": "2.3.0",
+      "resolved": "https://registry.npmmirror.com/binary-extensions/-/binary-extensions-2.3.0.tgz",
+      "integrity": "sha512-Ceh+7ox5qe7LJuLHoY0feh3pHuUDHAcRUeyL2VYghZwfpkNIy/+8Ocg0a3UuSoYzavmylwuLWQOf3hl0jjMMIw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/body-parser": {
+      "version": "1.20.3",
+      "resolved": "https://registry.npmmirror.com/body-parser/-/body-parser-1.20.3.tgz",
+      "integrity": "sha512-7rAxByjUMqQ3/bHJy7D6OGXvx/MMc4IqBn/X0fcM1QUcAItpZrBEYhWGem+tzXH90c+G01ypMcYJBO9Y30203g==",
+      "license": "MIT",
+      "dependencies": {
+        "bytes": "3.1.2",
+        "content-type": "~1.0.5",
+        "debug": "2.6.9",
+        "depd": "2.0.0",
+        "destroy": "1.2.0",
+        "http-errors": "2.0.0",
+        "iconv-lite": "0.4.24",
+        "on-finished": "2.4.1",
+        "qs": "6.13.0",
+        "raw-body": "2.5.2",
+        "type-is": "~1.6.18",
+        "unpipe": "1.0.0"
+      },
+      "engines": {
+        "node": ">= 0.8",
+        "npm": "1.2.8000 || >= 1.4.16"
+      }
+    },
+    "node_modules/body-parser/node_modules/bytes": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmmirror.com/bytes/-/bytes-3.1.2.tgz",
+      "integrity": "sha512-/Nf7TyzTx6S3yRJObOAV7956r8cr2+Oj8AC5dt8wSP3BQAoeX58NoHyCU8P8zGkNXStjTSi6fzO6F0pBdcYbEg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/body-parser/node_modules/debug": {
+      "version": "2.6.9",
+      "resolved": "https://registry.npmmirror.com/debug/-/debug-2.6.9.tgz",
+      "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "2.0.0"
+      }
+    },
+    "node_modules/body-parser/node_modules/ms": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/ms/-/ms-2.0.0.tgz",
+      "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==",
+      "license": "MIT"
+    },
+    "node_modules/bonjour-service": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmmirror.com/bonjour-service/-/bonjour-service-1.2.1.tgz",
+      "integrity": "sha512-oSzCS2zV14bh2kji6vNe7vrpJYCHGvcZnlffFQ1MEoX/WOeQ/teD8SYWKR942OI3INjq8OMNJlbPK5LLLUxFDw==",
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.3",
+        "multicast-dns": "^7.2.5"
+      }
+    },
+    "node_modules/boolbase": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/boolbase/-/boolbase-1.0.0.tgz",
+      "integrity": "sha512-JZOSA7Mo9sNGB8+UjSgzdLtokWAky1zbztM3WRLCbZ70/3cTANmQmOdR7y2g+J0e2WXywy1yS468tY+IruqEww==",
+      "license": "ISC"
+    },
+    "node_modules/boxen": {
+      "version": "6.2.1",
+      "resolved": "https://registry.npmmirror.com/boxen/-/boxen-6.2.1.tgz",
+      "integrity": "sha512-H4PEsJXfFI/Pt8sjDWbHlQPx4zL/bvSQjcilJmaulGt5mLDorHOHpmdXAJcBcmru7PhYSp/cDMWRko4ZUMFkSw==",
+      "license": "MIT",
+      "dependencies": {
+        "ansi-align": "^3.0.1",
+        "camelcase": "^6.2.0",
+        "chalk": "^4.1.2",
+        "cli-boxes": "^3.0.0",
+        "string-width": "^5.0.1",
+        "type-fest": "^2.5.0",
+        "widest-line": "^4.0.1",
+        "wrap-ansi": "^8.0.1"
+      },
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/brace-expansion": {
+      "version": "1.1.11",
+      "resolved": "https://registry.npmmirror.com/brace-expansion/-/brace-expansion-1.1.11.tgz",
+      "integrity": "sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==",
+      "license": "MIT",
+      "dependencies": {
+        "balanced-match": "^1.0.0",
+        "concat-map": "0.0.1"
+      }
+    },
+    "node_modules/braces": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmmirror.com/braces/-/braces-3.0.3.tgz",
+      "integrity": "sha512-yQbXgO/OSZVD2IsiLlro+7Hf6Q18EJrKSEsdoMzKePKXct3gvD8oLcOQdIzGupr5Fj+EDe8gO/lxc1BzfMpxvA==",
+      "license": "MIT",
+      "dependencies": {
+        "fill-range": "^7.1.1"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/browserslist": {
+      "version": "4.24.0",
+      "resolved": "https://registry.npmmirror.com/browserslist/-/browserslist-4.24.0.tgz",
+      "integrity": "sha512-Rmb62sR1Zpjql25eSanFGEhAxcFwfA1K0GuQcLoaJBAcENegrQut3hYdhXFF1obQfiDyqIW/cLM5HSJ/9k884A==",
+      "funding": [
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/browserslist"
+        },
+        {
+          "type": "tidelift",
+          "url": "https://tidelift.com/funding/github/npm/browserslist"
+        },
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/ai"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "caniuse-lite": "^1.0.30001663",
+        "electron-to-chromium": "^1.5.28",
+        "node-releases": "^2.0.18",
+        "update-browserslist-db": "^1.1.0"
+      },
+      "bin": {
+        "browserslist": "cli.js"
+      },
+      "engines": {
+        "node": "^6 || ^7 || ^8 || ^9 || ^10 || ^11 || ^12 || >=13.7"
+      }
+    },
+    "node_modules/buffer-from": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmmirror.com/buffer-from/-/buffer-from-1.1.2.tgz",
+      "integrity": "sha512-E+XQCRwSbaaiChtv6k6Dwgc+bx+Bs6vuKJHHl5kox/BaKbhiXzqQOwK4cO22yElGp2OCmjwVhT3HmxgyPGnJfQ==",
+      "license": "MIT"
+    },
+    "node_modules/bytes": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/bytes/-/bytes-3.0.0.tgz",
+      "integrity": "sha512-pMhOfFDPiv9t5jjIXkHosWmkSyQbvsgEVNkz0ERHbuLh2T/7j4Mqqpz523Fe8MVY89KC6Sh/QfS2sM+SjgFDcw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/cacheable-lookup": {
+      "version": "7.0.0",
+      "resolved": "https://registry.npmmirror.com/cacheable-lookup/-/cacheable-lookup-7.0.0.tgz",
+      "integrity": "sha512-+qJyx4xiKra8mZrcwhjMRMUhD5NR1R8esPkzIYxX96JiecFoxAXFuz/GpR3+ev4PE1WamHip78wV0vcmPQtp8w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14.16"
+      }
+    },
+    "node_modules/cacheable-request": {
+      "version": "10.2.14",
+      "resolved": "https://registry.npmmirror.com/cacheable-request/-/cacheable-request-10.2.14.tgz",
+      "integrity": "sha512-zkDT5WAF4hSSoUgyfg5tFIxz8XQK+25W/TLVojJTMKBaxevLBBtLxgqguAuVQB8PVW79FVjHcU+GJ9tVbDZ9mQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/http-cache-semantics": "^4.0.2",
+        "get-stream": "^6.0.1",
+        "http-cache-semantics": "^4.1.1",
+        "keyv": "^4.5.3",
+        "mimic-response": "^4.0.0",
+        "normalize-url": "^8.0.0",
+        "responselike": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=14.16"
+      }
+    },
+    "node_modules/call-bind": {
+      "version": "1.0.7",
+      "resolved": "https://registry.npmmirror.com/call-bind/-/call-bind-1.0.7.tgz",
+      "integrity": "sha512-GHTSNSYICQ7scH7sZ+M2rFopRoLh8t2bLSW6BbgrtLsahOIB5iyAVJf9GjWK3cYTDaMj4XdBpM1cA6pIS0Kv2w==",
+      "license": "MIT",
+      "dependencies": {
+        "es-define-property": "^1.0.0",
+        "es-errors": "^1.3.0",
+        "function-bind": "^1.1.2",
+        "get-intrinsic": "^1.2.4",
+        "set-function-length": "^1.2.1"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/callsites": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/callsites/-/callsites-3.1.0.tgz",
+      "integrity": "sha512-P8BjAsXvZS+VIDUI11hHCQEv74YT67YUi5JJFNWIqL235sBmjX4+qx9Muvls5ivyNENctx46xQLQ3aTuE7ssaQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/camel-case": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmmirror.com/camel-case/-/camel-case-4.1.2.tgz",
+      "integrity": "sha512-gxGWBrTT1JuMx6R+o5PTXMmUnhnVzLQ9SNutD4YqKtI6ap897t3tKECYla6gCWEkplXnlNybEkZg9GEGxKFCgw==",
+      "license": "MIT",
+      "dependencies": {
+        "pascal-case": "^3.1.2",
+        "tslib": "^2.0.3"
+      }
+    },
+    "node_modules/camelcase": {
+      "version": "6.3.0",
+      "resolved": "https://registry.npmmirror.com/camelcase/-/camelcase-6.3.0.tgz",
+      "integrity": "sha512-Gmy6FhYlCY7uOElZUSbxo2UCDH8owEk996gkbrpsgGtrJLM3J7jGxl9Ic7Qwwj4ivOE5AWZWRMecDdF7hqGjFA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/caniuse-api": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/caniuse-api/-/caniuse-api-3.0.0.tgz",
+      "integrity": "sha512-bsTwuIg/BZZK/vreVTYYbSWoe2F+71P7K5QGEX+pT250DZbfU1MQ5prOKpPR+LL6uWKK3KMwMCAS74QB3Um1uw==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.0.0",
+        "caniuse-lite": "^1.0.0",
+        "lodash.memoize": "^4.1.2",
+        "lodash.uniq": "^4.5.0"
+      }
+    },
+    "node_modules/caniuse-lite": {
+      "version": "1.0.30001668",
+      "resolved": "https://registry.npmmirror.com/caniuse-lite/-/caniuse-lite-1.0.30001668.tgz",
+      "integrity": "sha512-nWLrdxqCdblixUO+27JtGJJE/txpJlyUy5YN1u53wLZkP0emYCo5zgS6QYft7VUYR42LGgi/S5hdLZTrnyIddw==",
+      "funding": [
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/browserslist"
+        },
+        {
+          "type": "tidelift",
+          "url": "https://tidelift.com/funding/github/npm/caniuse-lite"
+        },
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/ai"
+        }
+      ],
+      "license": "CC-BY-4.0"
+    },
+    "node_modules/ccount": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/ccount/-/ccount-2.0.1.tgz",
+      "integrity": "sha512-eyrF0jiFpY+3drT6383f1qhkbGsLSifNAjA61IUjZjmLCWjItY6LB9ft9YhoDgwfmclB2zhu51Lc7+95b8NRAg==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/chalk": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmmirror.com/chalk/-/chalk-4.1.2.tgz",
+      "integrity": "sha512-oKnbhFyRIXpUuez8iBMmyEa4nbj4IOQyuhc/wy9kY7/WVPcwIO9VA668Pu8RkO7+0G76SLROeyw9CpQ061i4mA==",
+      "license": "MIT",
+      "dependencies": {
+        "ansi-styles": "^4.1.0",
+        "supports-color": "^7.1.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/chalk?sponsor=1"
+      }
+    },
+    "node_modules/char-regex": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/char-regex/-/char-regex-1.0.2.tgz",
+      "integrity": "sha512-kWWXztvZ5SBQV+eRgKFeh8q5sLuZY2+8WUIzlxWVTg+oGwY14qylx1KbKzHd8P6ZYkAg0xyIDU9JMHhyJMZ1jw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/character-entities": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/character-entities/-/character-entities-2.0.2.tgz",
+      "integrity": "sha512-shx7oQ0Awen/BRIdkjkvz54PnEEI/EjwXDSIZp86/KKdbafHh1Df/RYGBhn4hbe2+uKC9FnT5UCEdyPz3ai9hQ==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/character-entities-html4": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/character-entities-html4/-/character-entities-html4-2.1.0.tgz",
+      "integrity": "sha512-1v7fgQRj6hnSwFpq1Eu0ynr/CDEw0rXo2B61qXrLNdHZmPKgb7fqS1a2JwF0rISo9q77jDI8VMEHoApn8qDoZA==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/character-entities-legacy": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/character-entities-legacy/-/character-entities-legacy-3.0.0.tgz",
+      "integrity": "sha512-RpPp0asT/6ufRm//AJVwpViZbGM/MkjQFxJccQRHmISF/22NBtsHqAWmL+/pmkPWoIUJdWyeVleTl1wydHATVQ==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/character-reference-invalid": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/character-reference-invalid/-/character-reference-invalid-2.0.1.tgz",
+      "integrity": "sha512-iBZ4F4wRbyORVsu0jPV7gXkOsGYjGHPmAyv+HiHG8gi5PtC9KI2j1+v8/tlibRvjoWX027ypmG/n0HtO5t7unw==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/cheerio": {
+      "version": "1.0.0-rc.12",
+      "resolved": "https://registry.npmmirror.com/cheerio/-/cheerio-1.0.0-rc.12.tgz",
+      "integrity": "sha512-VqR8m68vM46BNnuZ5NtnGBKIE/DfN0cRIzg9n40EIq9NOv90ayxLBXA8fXC5gquFRGJSTRqBq25Jt2ECLR431Q==",
+      "license": "MIT",
+      "dependencies": {
+        "cheerio-select": "^2.1.0",
+        "dom-serializer": "^2.0.0",
+        "domhandler": "^5.0.3",
+        "domutils": "^3.0.1",
+        "htmlparser2": "^8.0.1",
+        "parse5": "^7.0.0",
+        "parse5-htmlparser2-tree-adapter": "^7.0.0"
+      },
+      "engines": {
+        "node": ">= 6"
+      },
+      "funding": {
+        "url": "https://github.com/cheeriojs/cheerio?sponsor=1"
+      }
+    },
+    "node_modules/cheerio-select": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/cheerio-select/-/cheerio-select-2.1.0.tgz",
+      "integrity": "sha512-9v9kG0LvzrlcungtnJtpGNxY+fzECQKhK4EGJX2vByejiMX84MFNQw4UxPJl3bFbTMw+Dfs37XaIkCwTZfLh4g==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "boolbase": "^1.0.0",
+        "css-select": "^5.1.0",
+        "css-what": "^6.1.0",
+        "domelementtype": "^2.3.0",
+        "domhandler": "^5.0.3",
+        "domutils": "^3.0.1"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/fb55"
+      }
+    },
+    "node_modules/chokidar": {
+      "version": "3.6.0",
+      "resolved": "https://registry.npmmirror.com/chokidar/-/chokidar-3.6.0.tgz",
+      "integrity": "sha512-7VT13fmjotKpGipCW9JEQAusEPE+Ei8nl6/g4FBAmIm0GOOLMua9NDDo/DWp0ZAxCr3cPq5ZpBqmPAQgDda2Pw==",
+      "license": "MIT",
+      "dependencies": {
+        "anymatch": "~3.1.2",
+        "braces": "~3.0.2",
+        "glob-parent": "~5.1.2",
+        "is-binary-path": "~2.1.0",
+        "is-glob": "~4.0.1",
+        "normalize-path": "~3.0.0",
+        "readdirp": "~3.6.0"
+      },
+      "engines": {
+        "node": ">= 8.10.0"
+      },
+      "funding": {
+        "url": "https://paulmillr.com/funding/"
+      },
+      "optionalDependencies": {
+        "fsevents": "~2.3.2"
+      }
+    },
+    "node_modules/chrome-trace-event": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmmirror.com/chrome-trace-event/-/chrome-trace-event-1.0.4.tgz",
+      "integrity": "sha512-rNjApaLzuwaOTjCiT8lSDdGN1APCiqkChLMJxJPWLunPAt5fy8xgU9/jNOchV84wfIxrA0lRQB7oCT8jrn/wrQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.0"
+      }
+    },
+    "node_modules/ci-info": {
+      "version": "3.9.0",
+      "resolved": "https://registry.npmmirror.com/ci-info/-/ci-info-3.9.0.tgz",
+      "integrity": "sha512-NIxF55hv4nSqQswkAeiOi1r83xy8JldOFDTWiug55KBu9Jnblncd2U6ViHmYgHf01TPZS77NJBhBMKdWj9HQMQ==",
+      "funding": [
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/sibiraj-s"
+        }
+      ],
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/classnames": {
+      "version": "2.5.1",
+      "resolved": "https://registry.npmmirror.com/classnames/-/classnames-2.5.1.tgz",
+      "integrity": "sha512-saHYOzhIQs6wy2sVxTM6bUDsQO4F50V9RQ22qBpEdCW+I+/Wmke2HOl6lS6dTpdxVhb88/I6+Hs+438c3lfUow==",
+      "license": "MIT"
+    },
+    "node_modules/clean-css": {
+      "version": "5.3.3",
+      "resolved": "https://registry.npmmirror.com/clean-css/-/clean-css-5.3.3.tgz",
+      "integrity": "sha512-D5J+kHaVb/wKSFcyyV75uCn8fiY4sV38XJoe4CUyGQ+mOU/fMVYUdH1hJC+CJQ5uY3EnW27SbJYS4X8BiLrAFg==",
+      "license": "MIT",
+      "dependencies": {
+        "source-map": "~0.6.0"
+      },
+      "engines": {
+        "node": ">= 10.0"
+      }
+    },
+    "node_modules/clean-css/node_modules/source-map": {
+      "version": "0.6.1",
+      "resolved": "https://registry.npmmirror.com/source-map/-/source-map-0.6.1.tgz",
+      "integrity": "sha512-UjgapumWlbMhkBgzT7Ykc5YXUT46F0iKu8SGXq0bcwP5dz/h0Plj6enJqjz1Zbq2l5WaqYnrVbwWOWMyF3F47g==",
+      "license": "BSD-3-Clause",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/clean-stack": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/clean-stack/-/clean-stack-2.2.0.tgz",
+      "integrity": "sha512-4diC9HaTE+KRAMWhDhrGOECgWZxoevMc5TlkObMqNSsVU62PYzXZ/SMTjzyGAFF1YusgxGcSWTEXBhp0CPwQ1A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/cli-boxes": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/cli-boxes/-/cli-boxes-3.0.0.tgz",
+      "integrity": "sha512-/lzGpEWL/8PfI0BmBOPRwp0c/wFNX1RdUML3jK/RcSBA9T8mZDdQpqYBKtCFTOfQbwPqWEOpjqW+Fnayc0969g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/cli-table3": {
+      "version": "0.6.5",
+      "resolved": "https://registry.npmmirror.com/cli-table3/-/cli-table3-0.6.5.tgz",
+      "integrity": "sha512-+W/5efTR7y5HRD7gACw9yQjqMVvEMLBHmboM/kPWam+H+Hmyrgjh6YncVKK122YZkXrLudzTuAukUw9FnMf7IQ==",
+      "license": "MIT",
+      "dependencies": {
+        "string-width": "^4.2.0"
+      },
+      "engines": {
+        "node": "10.* || >= 12.*"
+      },
+      "optionalDependencies": {
+        "@colors/colors": "1.5.0"
+      }
+    },
+    "node_modules/cli-table3/node_modules/emoji-regex": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/emoji-regex/-/emoji-regex-8.0.0.tgz",
+      "integrity": "sha512-MSjYzcWNOA0ewAHpz0MxpYFvwg6yjy1NG3xteoqz644VCo/RPgnr1/GGt+ic3iJTzQ8Eu3TdM14SawnVUmGE6A==",
+      "license": "MIT"
+    },
+    "node_modules/cli-table3/node_modules/string-width": {
+      "version": "4.2.3",
+      "resolved": "https://registry.npmmirror.com/string-width/-/string-width-4.2.3.tgz",
+      "integrity": "sha512-wKyQRQpjJ0sIp62ErSZdGsjMJWsap5oRNihHhu6G7JVO/9jIB6UyevL+tXuOqrng8j/cxKTWyWUwvSTriiZz/g==",
+      "license": "MIT",
+      "dependencies": {
+        "emoji-regex": "^8.0.0",
+        "is-fullwidth-code-point": "^3.0.0",
+        "strip-ansi": "^6.0.1"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/clone-deep": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmmirror.com/clone-deep/-/clone-deep-4.0.1.tgz",
+      "integrity": "sha512-neHB9xuzh/wk0dIHweyAXv2aPGZIVk3pLMe+/RNzINf17fe0OG96QroktYAUm7SM1PBnzTabaLboqqxDyMU+SQ==",
+      "license": "MIT",
+      "dependencies": {
+        "is-plain-object": "^2.0.4",
+        "kind-of": "^6.0.2",
+        "shallow-clone": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/clsx": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmmirror.com/clsx/-/clsx-2.1.1.tgz",
+      "integrity": "sha512-eYm0QWBtUrBWZWG0d386OGAw16Z995PiOVo2B7bjWSbHedGl5e0ZWaq65kOGgUSNesEIDkB9ISbTg/JK9dhCZA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/collapse-white-space": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/collapse-white-space/-/collapse-white-space-2.1.0.tgz",
+      "integrity": "sha512-loKTxY1zCOuG4j9f6EPnuyyYkf58RnhhWTvRoZEokgB+WbdXehfjFviyOVYkqzEWz1Q5kRiZdBYS5SwxbQYwzw==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/color-convert": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/color-convert/-/color-convert-2.0.1.tgz",
+      "integrity": "sha512-RRECPsj7iu/xb5oKYcsFHSppFNnsj/52OVTRKb4zP5onXwVF3zVmmToNcOfGC+CRDpfK/U584fMg38ZHCaElKQ==",
+      "license": "MIT",
+      "dependencies": {
+        "color-name": "~1.1.4"
+      },
+      "engines": {
+        "node": ">=7.0.0"
+      }
+    },
+    "node_modules/color-name": {
+      "version": "1.1.4",
+      "resolved": "https://registry.npmmirror.com/color-name/-/color-name-1.1.4.tgz",
+      "integrity": "sha512-dOy+3AuW3a2wNbZHIuMZpTcgjGuLU/uBL/ubcZF9OXbDo8ff4O8yVp5Bf0efS8uEoYo5q4Fx7dY9OgQGXgAsQA==",
+      "license": "MIT"
+    },
+    "node_modules/colord": {
+      "version": "2.9.3",
+      "resolved": "https://registry.npmmirror.com/colord/-/colord-2.9.3.tgz",
+      "integrity": "sha512-jeC1axXpnb0/2nn/Y1LPuLdgXBLH7aDcHu4KEKfqw3CUhX7ZpfBSlPKyqXE6btIgEzfWtrX3/tyBCaCvXvMkOw==",
+      "license": "MIT"
+    },
+    "node_modules/colorette": {
+      "version": "2.0.20",
+      "resolved": "https://registry.npmmirror.com/colorette/-/colorette-2.0.20.tgz",
+      "integrity": "sha512-IfEDxwoWIjkeXL1eXcDiow4UbKjhLdq6/EuSVR9GMN7KVH3r9gQ83e73hsz1Nd1T3ijd5xv1wcWRYO+D6kCI2w==",
+      "license": "MIT"
+    },
+    "node_modules/combine-promises": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmmirror.com/combine-promises/-/combine-promises-1.2.0.tgz",
+      "integrity": "sha512-VcQB1ziGD0NXrhKxiwyNbCDmRzs/OShMs2GqW2DlU2A/Sd0nQxE1oWDAE5O0ygSx5mgQOn9eIFh7yKPgFRVkPQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/comma-separated-tokens": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmmirror.com/comma-separated-tokens/-/comma-separated-tokens-2.0.3.tgz",
+      "integrity": "sha512-Fu4hJdvzeylCfQPp9SGWidpzrMs7tTrlu6Vb8XGaRGck8QSNZJJp538Wrb60Lax4fPwR64ViY468OIUTbRlGZg==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/commander": {
+      "version": "5.1.0",
+      "resolved": "https://registry.npmmirror.com/commander/-/commander-5.1.0.tgz",
+      "integrity": "sha512-P0CysNDQ7rtVw4QIQtm+MRxV66vKFSvlsQvGYXZWR3qFU0jlMKHZZZgw8e+8DSah4UDKMqnknRDQz+xuQXQ/Zg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 6"
+      }
+    },
+    "node_modules/common-path-prefix": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/common-path-prefix/-/common-path-prefix-3.0.0.tgz",
+      "integrity": "sha512-QE33hToZseCH3jS0qN96O/bSh3kaw/h+Tq7ngyY9eWDUnTlTNUyqfqvCXioLe5Na5jFsL78ra/wuBU4iuEgd4w==",
+      "license": "ISC"
+    },
+    "node_modules/compressible": {
+      "version": "2.0.18",
+      "resolved": "https://registry.npmmirror.com/compressible/-/compressible-2.0.18.tgz",
+      "integrity": "sha512-AF3r7P5dWxL8MxyITRMlORQNaOA2IkAFaTr4k7BUumjPtRpGDTZpl0Pb1XCO6JeDCBdp126Cgs9sMxqSjgYyRg==",
+      "license": "MIT",
+      "dependencies": {
+        "mime-db": ">= 1.43.0 < 2"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/compressible/node_modules/mime-db": {
+      "version": "1.53.0",
+      "resolved": "https://registry.npmmirror.com/mime-db/-/mime-db-1.53.0.tgz",
+      "integrity": "sha512-oHlN/w+3MQ3rba9rqFr6V/ypF10LSkdwUysQL7GkXoTgIWeV+tcXGA852TBxH+gsh8UWoyhR1hKcoMJTuWflpg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/compression": {
+      "version": "1.7.4",
+      "resolved": "https://registry.npmmirror.com/compression/-/compression-1.7.4.tgz",
+      "integrity": "sha512-jaSIDzP9pZVS4ZfQ+TzvtiWhdpFhE2RDHz8QJkpX9SIpLq88VueF5jJw6t+6CUQcAoA6t+x89MLrWAqpfDE8iQ==",
+      "license": "MIT",
+      "dependencies": {
+        "accepts": "~1.3.5",
+        "bytes": "3.0.0",
+        "compressible": "~2.0.16",
+        "debug": "2.6.9",
+        "on-headers": "~1.0.2",
+        "safe-buffer": "5.1.2",
+        "vary": "~1.1.2"
+      },
+      "engines": {
+        "node": ">= 0.8.0"
+      }
+    },
+    "node_modules/compression/node_modules/debug": {
+      "version": "2.6.9",
+      "resolved": "https://registry.npmmirror.com/debug/-/debug-2.6.9.tgz",
+      "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "2.0.0"
+      }
+    },
+    "node_modules/compression/node_modules/ms": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/ms/-/ms-2.0.0.tgz",
+      "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==",
+      "license": "MIT"
+    },
+    "node_modules/compression/node_modules/safe-buffer": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmmirror.com/safe-buffer/-/safe-buffer-5.1.2.tgz",
+      "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
+      "license": "MIT"
+    },
+    "node_modules/compute-scroll-into-view": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/compute-scroll-into-view/-/compute-scroll-into-view-3.1.0.tgz",
+      "integrity": "sha512-rj8l8pD4bJ1nx+dAkMhV1xB5RuZEyVysfxJqB1pRchh1KVvwOv9b7CGB8ZfjTImVv2oF+sYMUkMZq6Na5Ftmbg==",
+      "license": "MIT"
+    },
+    "node_modules/concat-map": {
+      "version": "0.0.1",
+      "resolved": "https://registry.npmmirror.com/concat-map/-/concat-map-0.0.1.tgz",
+      "integrity": "sha512-/Srv4dswyQNBfohGpz9o6Yb3Gz3SrUDqBH5rTuhGR7ahtlbYKnVxw2bCFMRljaA7EXHaXZ8wsHdodFvbkhKmqg==",
+      "license": "MIT"
+    },
+    "node_modules/config-chain": {
+      "version": "1.1.13",
+      "resolved": "https://registry.npmmirror.com/config-chain/-/config-chain-1.1.13.tgz",
+      "integrity": "sha512-qj+f8APARXHrM0hraqXYb2/bOVSV4PvJQlNZ/DVj0QrmNM2q2euizkeuVckQ57J+W0mRH6Hvi+k50M4Jul2VRQ==",
+      "license": "MIT",
+      "dependencies": {
+        "ini": "^1.3.4",
+        "proto-list": "~1.2.1"
+      }
+    },
+    "node_modules/configstore": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmmirror.com/configstore/-/configstore-6.0.0.tgz",
+      "integrity": "sha512-cD31W1v3GqUlQvbBCGcXmd2Nj9SvLDOP1oQ0YFuLETufzSPaKp11rYBsSOm7rCsW3OnIRAFM3OxRhceaXNYHkA==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "dot-prop": "^6.0.1",
+        "graceful-fs": "^4.2.6",
+        "unique-string": "^3.0.0",
+        "write-file-atomic": "^3.0.3",
+        "xdg-basedir": "^5.0.1"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/yeoman/configstore?sponsor=1"
+      }
+    },
+    "node_modules/connect-history-api-fallback": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/connect-history-api-fallback/-/connect-history-api-fallback-2.0.0.tgz",
+      "integrity": "sha512-U73+6lQFmfiNPrYbXqr6kZ1i1wiRqXnp2nhMsINseWXO8lDau0LGEffJ8kQi4EjLZympVgRdvqjAgiZ1tgzDDA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.8"
+      }
+    },
+    "node_modules/consola": {
+      "version": "2.15.3",
+      "resolved": "https://registry.npmmirror.com/consola/-/consola-2.15.3.tgz",
+      "integrity": "sha512-9vAdYbHj6x2fLKC4+oPH0kFzY/orMZyG2Aj+kNylHxKGJ/Ed4dpNyAQYwJOdqO4zdM7XpVHmyejQDcQHrnuXbw==",
+      "license": "MIT"
+    },
+    "node_modules/content-disposition": {
+      "version": "0.5.2",
+      "resolved": "https://registry.npmmirror.com/content-disposition/-/content-disposition-0.5.2.tgz",
+      "integrity": "sha512-kRGRZw3bLlFISDBgwTSA1TMBFN6J6GWDeubmDE3AF+3+yXL8hTWv8r5rkLbqYXY4RjPk/EzHnClI3zQf1cFmHA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/content-type": {
+      "version": "1.0.5",
+      "resolved": "https://registry.npmmirror.com/content-type/-/content-type-1.0.5.tgz",
+      "integrity": "sha512-nTjqfcBFEipKdXCv4YDQWCfmcLZKm81ldF0pAopTvyrFGVbcR6P/VAAd5G7N+0tTr8QqiU0tFadD6FK4NtJwOA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/convert-source-map": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/convert-source-map/-/convert-source-map-2.0.0.tgz",
+      "integrity": "sha512-Kvp459HrV2FEJ1CAsi1Ku+MY3kasH19TFykTz2xWmMeq6bk2NU3XXvfJ+Q61m0xktWwt+1HSYf3JZsTms3aRJg==",
+      "license": "MIT"
+    },
+    "node_modules/cookie": {
+      "version": "0.7.1",
+      "resolved": "https://registry.npmmirror.com/cookie/-/cookie-0.7.1.tgz",
+      "integrity": "sha512-6DnInpx7SJ2AK3+CTUE/ZM0vWTUboZCegxhC2xiIydHR9jNuTAASBrfEpHhiGOZw/nX51bHt6YQl8jsGo4y/0w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/cookie-signature": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmmirror.com/cookie-signature/-/cookie-signature-1.0.6.tgz",
+      "integrity": "sha512-QADzlaHc8icV8I7vbaJXJwod9HWYp8uCqf1xa4OfNu1T7JVxQIrUgOWtHdNDtPiywmFbiS12VjotIXLrKM3orQ==",
+      "license": "MIT"
+    },
+    "node_modules/copy-text-to-clipboard": {
+      "version": "3.2.0",
+      "resolved": "https://registry.npmmirror.com/copy-text-to-clipboard/-/copy-text-to-clipboard-3.2.0.tgz",
+      "integrity": "sha512-RnJFp1XR/LOBDckxTib5Qjr/PMfkatD0MUCQgdpqS8MdKiNUzBjAQBEN6oUy+jW7LI93BBG3DtMB2KOOKpGs2Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/copy-to-clipboard": {
+      "version": "3.3.3",
+      "resolved": "https://registry.npmmirror.com/copy-to-clipboard/-/copy-to-clipboard-3.3.3.tgz",
+      "integrity": "sha512-2KV8NhB5JqC3ky0r9PMCAZKbUHSwtEo4CwCs0KXgruG43gX5PMqDEBbVU4OUzw2MuAWUfsuFmWvEKG5QRfSnJA==",
+      "license": "MIT",
+      "dependencies": {
+        "toggle-selection": "^1.0.6"
+      }
+    },
+    "node_modules/copy-webpack-plugin": {
+      "version": "11.0.0",
+      "resolved": "https://registry.npmmirror.com/copy-webpack-plugin/-/copy-webpack-plugin-11.0.0.tgz",
+      "integrity": "sha512-fX2MWpamkW0hZxMEg0+mYnA40LTosOSa5TqZ9GYIBzyJa9C3QUaMPSE2xAi/buNr8u89SfD9wHSQVBzrRa/SOQ==",
+      "license": "MIT",
+      "dependencies": {
+        "fast-glob": "^3.2.11",
+        "glob-parent": "^6.0.1",
+        "globby": "^13.1.1",
+        "normalize-path": "^3.0.0",
+        "schema-utils": "^4.0.0",
+        "serialize-javascript": "^6.0.0"
+      },
+      "engines": {
+        "node": ">= 14.15.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "webpack": "^5.1.0"
+      }
+    },
+    "node_modules/copy-webpack-plugin/node_modules/glob-parent": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/glob-parent/-/glob-parent-6.0.2.tgz",
+      "integrity": "sha512-XxwI8EOhVQgWp6iDL+3b0r86f4d6AX6zSU55HfB4ydCEuXLXc5FcYeOu+nnGftS4TEju/11rt4KJPTMgbfmv4A==",
+      "license": "ISC",
+      "dependencies": {
+        "is-glob": "^4.0.3"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      }
+    },
+    "node_modules/copy-webpack-plugin/node_modules/globby": {
+      "version": "13.2.2",
+      "resolved": "https://registry.npmmirror.com/globby/-/globby-13.2.2.tgz",
+      "integrity": "sha512-Y1zNGV+pzQdh7H39l9zgB4PJqjRNqydvdYCDG4HFXM4XuvSaQQlEc91IU1yALL8gUTDomgBAfz3XJdmUS+oo0w==",
+      "license": "MIT",
+      "dependencies": {
+        "dir-glob": "^3.0.1",
+        "fast-glob": "^3.3.0",
+        "ignore": "^5.2.4",
+        "merge2": "^1.4.1",
+        "slash": "^4.0.0"
+      },
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/copy-webpack-plugin/node_modules/slash": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/slash/-/slash-4.0.0.tgz",
+      "integrity": "sha512-3dOsAHXXUkQTpOYcoAxLIorMTp4gIQr5IW3iVb7A7lFIp0VHhnynm9izx6TssdrIcVIESAlVjtnO2K8bg+Coew==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/core-js": {
+      "version": "3.38.1",
+      "resolved": "https://registry.npmmirror.com/core-js/-/core-js-3.38.1.tgz",
+      "integrity": "sha512-OP35aUorbU3Zvlx7pjsFdu1rGNnD4pgw/CWoYzRY3t2EzoVT7shKHY1dlAy3f41cGIO7ZDPQimhGFTlEYkG/Hw==",
+      "hasInstallScript": true,
+      "license": "MIT",
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/core-js"
+      }
+    },
+    "node_modules/core-js-compat": {
+      "version": "3.38.1",
+      "resolved": "https://registry.npmmirror.com/core-js-compat/-/core-js-compat-3.38.1.tgz",
+      "integrity": "sha512-JRH6gfXxGmrzF3tZ57lFx97YARxCXPaMzPo6jELZhv88pBH5VXpQ+y0znKGlFnzuaihqhLbefxSJxWJMPtfDzw==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.3"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/core-js"
+      }
+    },
+    "node_modules/core-js-pure": {
+      "version": "3.38.1",
+      "resolved": "https://registry.npmmirror.com/core-js-pure/-/core-js-pure-3.38.1.tgz",
+      "integrity": "sha512-BY8Etc1FZqdw1glX0XNOq2FDwfrg/VGqoZOZCdaL+UmdaqDwQwYXkMJT4t6In+zfEfOJDcM9T0KdbBeJg8KKCQ==",
+      "hasInstallScript": true,
+      "license": "MIT",
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/core-js"
+      }
+    },
+    "node_modules/core-util-is": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmmirror.com/core-util-is/-/core-util-is-1.0.3.tgz",
+      "integrity": "sha512-ZQBvi1DcpJ4GDqanjucZ2Hj3wEO5pZDS89BWbkcrvdxksJorwUDDZamX9ldFkp9aw2lmBDLgkObEA4DWNJ9FYQ==",
+      "license": "MIT"
+    },
+    "node_modules/cosmiconfig": {
+      "version": "8.3.6",
+      "resolved": "https://registry.npmmirror.com/cosmiconfig/-/cosmiconfig-8.3.6.tgz",
+      "integrity": "sha512-kcZ6+W5QzcJ3P1Mt+83OUv/oHFqZHIx8DuxG6eZ5RGMERoLqp4BuGjhHLYGK+Kf5XVkQvqBSmAy/nGWN3qDgEA==",
+      "license": "MIT",
+      "dependencies": {
+        "import-fresh": "^3.3.0",
+        "js-yaml": "^4.1.0",
+        "parse-json": "^5.2.0",
+        "path-type": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/d-fischer"
+      },
+      "peerDependencies": {
+        "typescript": ">=4.9.5"
+      },
+      "peerDependenciesMeta": {
+        "typescript": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/cross-spawn": {
+      "version": "7.0.3",
+      "resolved": "https://registry.npmmirror.com/cross-spawn/-/cross-spawn-7.0.3.tgz",
+      "integrity": "sha512-iRDPJKUPVEND7dHPO8rkbOnPpyDygcDFtWjpeWNCgy8WP2rXcxXL8TskReQl6OrB2G7+UJrags1q15Fudc7G6w==",
+      "license": "MIT",
+      "dependencies": {
+        "path-key": "^3.1.0",
+        "shebang-command": "^2.0.0",
+        "which": "^2.0.1"
+      },
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/crypto-random-string": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/crypto-random-string/-/crypto-random-string-4.0.0.tgz",
+      "integrity": "sha512-x8dy3RnvYdlUcPOjkEHqozhiwzKNSq7GcPuXFbnyMOCHxX8V3OgIg/pYuabl2sbUPfIJaeAQB7PMOK8DFIdoRA==",
+      "license": "MIT",
+      "dependencies": {
+        "type-fest": "^1.0.1"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/crypto-random-string/node_modules/type-fest": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmmirror.com/type-fest/-/type-fest-1.4.0.tgz",
+      "integrity": "sha512-yGSza74xk0UG8k+pLh5oeoYirvIiWo5t0/o3zHHAO2tRDiZcxWP7fywNlXhqb6/r6sWvwi+RsyQMWhVLe4BVuA==",
+      "license": "(MIT OR CC0-1.0)",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/css-declaration-sorter": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmmirror.com/css-declaration-sorter/-/css-declaration-sorter-7.2.0.tgz",
+      "integrity": "sha512-h70rUM+3PNFuaBDTLe8wF/cdWu+dOZmb7pJt8Z2sedYbAcQVQV/tEchueg3GWxwqS0cxtbxmaHEdkNACqcvsow==",
+      "license": "ISC",
+      "engines": {
+        "node": "^14 || ^16 || >=18"
+      },
+      "peerDependencies": {
+        "postcss": "^8.0.9"
+      }
+    },
+    "node_modules/css-loader": {
+      "version": "6.11.0",
+      "resolved": "https://registry.npmmirror.com/css-loader/-/css-loader-6.11.0.tgz",
+      "integrity": "sha512-CTJ+AEQJjq5NzLga5pE39qdiSV56F8ywCIsqNIRF0r7BDgWsN25aazToqAFg7ZrtA/U016xudB3ffgweORxX7g==",
+      "license": "MIT",
+      "dependencies": {
+        "icss-utils": "^5.1.0",
+        "postcss": "^8.4.33",
+        "postcss-modules-extract-imports": "^3.1.0",
+        "postcss-modules-local-by-default": "^4.0.5",
+        "postcss-modules-scope": "^3.2.0",
+        "postcss-modules-values": "^4.0.0",
+        "postcss-value-parser": "^4.2.0",
+        "semver": "^7.5.4"
+      },
+      "engines": {
+        "node": ">= 12.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "@rspack/core": "0.x || 1.x",
+        "webpack": "^5.0.0"
+      },
+      "peerDependenciesMeta": {
+        "@rspack/core": {
+          "optional": true
+        },
+        "webpack": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/css-minimizer-webpack-plugin": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmmirror.com/css-minimizer-webpack-plugin/-/css-minimizer-webpack-plugin-5.0.1.tgz",
+      "integrity": "sha512-3caImjKFQkS+ws1TGcFn0V1HyDJFq1Euy589JlD6/3rV2kj+w7r5G9WDMgSHvpvXHNZ2calVypZWuEDQd9wfLg==",
+      "license": "MIT",
+      "dependencies": {
+        "@jridgewell/trace-mapping": "^0.3.18",
+        "cssnano": "^6.0.1",
+        "jest-worker": "^29.4.3",
+        "postcss": "^8.4.24",
+        "schema-utils": "^4.0.1",
+        "serialize-javascript": "^6.0.1"
+      },
+      "engines": {
+        "node": ">= 14.15.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "webpack": "^5.0.0"
+      },
+      "peerDependenciesMeta": {
+        "@parcel/css": {
+          "optional": true
+        },
+        "@swc/css": {
+          "optional": true
+        },
+        "clean-css": {
+          "optional": true
+        },
+        "csso": {
+          "optional": true
+        },
+        "esbuild": {
+          "optional": true
+        },
+        "lightningcss": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/css-select": {
+      "version": "5.1.0",
+      "resolved": "https://registry.npmmirror.com/css-select/-/css-select-5.1.0.tgz",
+      "integrity": "sha512-nwoRF1rvRRnnCqqY7updORDsuqKzqYJ28+oSMaJMMgOauh3fvwHqMS7EZpIPqK8GL+g9mKxF1vP/ZjSeNjEVHg==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "boolbase": "^1.0.0",
+        "css-what": "^6.1.0",
+        "domhandler": "^5.0.2",
+        "domutils": "^3.0.1",
+        "nth-check": "^2.0.1"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/fb55"
+      }
+    },
+    "node_modules/css-tree": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmmirror.com/css-tree/-/css-tree-2.3.1.tgz",
+      "integrity": "sha512-6Fv1DV/TYw//QF5IzQdqsNDjx/wc8TrMBZsqjL9eW01tWb7R7k/mq+/VXfJCl7SoD5emsJop9cOByJZfs8hYIw==",
+      "license": "MIT",
+      "dependencies": {
+        "mdn-data": "2.0.30",
+        "source-map-js": "^1.0.1"
+      },
+      "engines": {
+        "node": "^10 || ^12.20.0 || ^14.13.0 || >=15.0.0"
+      }
+    },
+    "node_modules/css-what": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/css-what/-/css-what-6.1.0.tgz",
+      "integrity": "sha512-HTUrgRJ7r4dsZKU6GjmpfRK1O76h97Z8MfS1G0FozR+oF2kG6Vfe8JE6zwrkbxigziPHinCJ+gCPjA9EaBDtRw==",
+      "license": "BSD-2-Clause",
+      "engines": {
+        "node": ">= 6"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/fb55"
+      }
+    },
+    "node_modules/cssesc": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/cssesc/-/cssesc-3.0.0.tgz",
+      "integrity": "sha512-/Tb/JcjK111nNScGob5MNtsntNM1aCNUDipB/TkwZFhyDrrE47SOx/18wF2bbjgc3ZzCSKW1T5nt5EbFoAz/Vg==",
+      "license": "MIT",
+      "bin": {
+        "cssesc": "bin/cssesc"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/cssnano": {
+      "version": "6.1.2",
+      "resolved": "https://registry.npmmirror.com/cssnano/-/cssnano-6.1.2.tgz",
+      "integrity": "sha512-rYk5UeX7VAM/u0lNqewCdasdtPK81CgX8wJFLEIXHbV2oldWRgJAsZrdhRXkV1NJzA2g850KiFm9mMU2HxNxMA==",
+      "license": "MIT",
+      "dependencies": {
+        "cssnano-preset-default": "^6.1.2",
+        "lilconfig": "^3.1.1"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/cssnano"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/cssnano-preset-advanced": {
+      "version": "6.1.2",
+      "resolved": "https://registry.npmmirror.com/cssnano-preset-advanced/-/cssnano-preset-advanced-6.1.2.tgz",
+      "integrity": "sha512-Nhao7eD8ph2DoHolEzQs5CfRpiEP0xa1HBdnFZ82kvqdmbwVBUr2r1QuQ4t1pi+D1ZpqpcO4T+wy/7RxzJ/WPQ==",
+      "license": "MIT",
+      "dependencies": {
+        "autoprefixer": "^10.4.19",
+        "browserslist": "^4.23.0",
+        "cssnano-preset-default": "^6.1.2",
+        "postcss-discard-unused": "^6.0.5",
+        "postcss-merge-idents": "^6.0.3",
+        "postcss-reduce-idents": "^6.0.3",
+        "postcss-zindex": "^6.0.2"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/cssnano-preset-default": {
+      "version": "6.1.2",
+      "resolved": "https://registry.npmmirror.com/cssnano-preset-default/-/cssnano-preset-default-6.1.2.tgz",
+      "integrity": "sha512-1C0C+eNaeN8OcHQa193aRgYexyJtU8XwbdieEjClw+J9d94E41LwT6ivKH0WT+fYwYWB0Zp3I3IZ7tI/BbUbrg==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.0",
+        "css-declaration-sorter": "^7.2.0",
+        "cssnano-utils": "^4.0.2",
+        "postcss-calc": "^9.0.1",
+        "postcss-colormin": "^6.1.0",
+        "postcss-convert-values": "^6.1.0",
+        "postcss-discard-comments": "^6.0.2",
+        "postcss-discard-duplicates": "^6.0.3",
+        "postcss-discard-empty": "^6.0.3",
+        "postcss-discard-overridden": "^6.0.2",
+        "postcss-merge-longhand": "^6.0.5",
+        "postcss-merge-rules": "^6.1.1",
+        "postcss-minify-font-values": "^6.1.0",
+        "postcss-minify-gradients": "^6.0.3",
+        "postcss-minify-params": "^6.1.0",
+        "postcss-minify-selectors": "^6.0.4",
+        "postcss-normalize-charset": "^6.0.2",
+        "postcss-normalize-display-values": "^6.0.2",
+        "postcss-normalize-positions": "^6.0.2",
+        "postcss-normalize-repeat-style": "^6.0.2",
+        "postcss-normalize-string": "^6.0.2",
+        "postcss-normalize-timing-functions": "^6.0.2",
+        "postcss-normalize-unicode": "^6.1.0",
+        "postcss-normalize-url": "^6.0.2",
+        "postcss-normalize-whitespace": "^6.0.2",
+        "postcss-ordered-values": "^6.0.2",
+        "postcss-reduce-initial": "^6.1.0",
+        "postcss-reduce-transforms": "^6.0.2",
+        "postcss-svgo": "^6.0.3",
+        "postcss-unique-selectors": "^6.0.4"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/cssnano-utils": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmmirror.com/cssnano-utils/-/cssnano-utils-4.0.2.tgz",
+      "integrity": "sha512-ZR1jHg+wZ8o4c3zqf1SIUSTIvm/9mU343FMR6Obe/unskbvpGhZOo1J6d/r8D1pzkRQYuwbcH3hToOuoA2G7oQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/csso": {
+      "version": "5.0.5",
+      "resolved": "https://registry.npmmirror.com/csso/-/csso-5.0.5.tgz",
+      "integrity": "sha512-0LrrStPOdJj+SPCCrGhzryycLjwcgUSHBtxNA8aIDxf0GLsRh1cKYhB00Gd1lDOS4yGH69+SNn13+TWbVHETFQ==",
+      "license": "MIT",
+      "dependencies": {
+        "css-tree": "~2.2.0"
+      },
+      "engines": {
+        "node": "^10 || ^12.20.0 || ^14.13.0 || >=15.0.0",
+        "npm": ">=7.0.0"
+      }
+    },
+    "node_modules/csso/node_modules/css-tree": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmmirror.com/css-tree/-/css-tree-2.2.1.tgz",
+      "integrity": "sha512-OA0mILzGc1kCOCSJerOeqDxDQ4HOh+G8NbOJFOTgOCzpw7fCBubk0fEyxp8AgOL/jvLgYA/uV0cMbe43ElF1JA==",
+      "license": "MIT",
+      "dependencies": {
+        "mdn-data": "2.0.28",
+        "source-map-js": "^1.0.1"
+      },
+      "engines": {
+        "node": "^10 || ^12.20.0 || ^14.13.0 || >=15.0.0",
+        "npm": ">=7.0.0"
+      }
+    },
+    "node_modules/csso/node_modules/mdn-data": {
+      "version": "2.0.28",
+      "resolved": "https://registry.npmmirror.com/mdn-data/-/mdn-data-2.0.28.tgz",
+      "integrity": "sha512-aylIc7Z9y4yzHYAJNuESG3hfhC+0Ibp/MAMiaOZgNv4pmEdFyfZhhhny4MNiAfWdBQ1RQ2mfDWmM1x8SvGyp8g==",
+      "license": "CC0-1.0"
+    },
+    "node_modules/csstype": {
+      "version": "3.1.3",
+      "resolved": "https://registry.npmmirror.com/csstype/-/csstype-3.1.3.tgz",
+      "integrity": "sha512-M1uQkMl8rQK/szD0LNhtqxIPLpimGm8sOBwU7lLnCpSbTyY3yeU1Vc7l4KT5zT4s/yOxHH5O7tIuuLOCnLADRw==",
+      "license": "MIT"
+    },
+    "node_modules/dayjs": {
+      "version": "1.11.13",
+      "resolved": "https://registry.npmmirror.com/dayjs/-/dayjs-1.11.13.tgz",
+      "integrity": "sha512-oaMBel6gjolK862uaPQOVTA7q3TZhuSvuMQAAglQDOWYO9A91IrAOUJEyKVlqJlHE0vq5p5UXxzdPfMH/x6xNg==",
+      "license": "MIT"
+    },
+    "node_modules/debounce": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmmirror.com/debounce/-/debounce-1.2.1.tgz",
+      "integrity": "sha512-XRRe6Glud4rd/ZGQfiV1ruXSfbvfJedlV9Y6zOlP+2K04vBYiJEte6stfFkCP03aMnY5tsipamumUjL14fofug==",
+      "license": "MIT"
+    },
+    "node_modules/debug": {
+      "version": "4.3.7",
+      "resolved": "https://registry.npmmirror.com/debug/-/debug-4.3.7.tgz",
+      "integrity": "sha512-Er2nc/H7RrMXZBFCEim6TCmMk02Z8vLC2Rbi1KEBggpo0fS6l0S1nnapwmIi3yW/+GOJap1Krg4w0Hg80oCqgQ==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "^2.1.3"
+      },
+      "engines": {
+        "node": ">=6.0"
+      },
+      "peerDependenciesMeta": {
+        "supports-color": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/decode-named-character-reference": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/decode-named-character-reference/-/decode-named-character-reference-1.0.2.tgz",
+      "integrity": "sha512-O8x12RzrUF8xyVcY0KJowWsmaJxQbmy0/EtnNtHRpsOcT7dFk5W598coHqBVpmWo1oQQfsCqfCmkZN5DJrZVdg==",
+      "license": "MIT",
+      "dependencies": {
+        "character-entities": "^2.0.0"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/decompress-response": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmmirror.com/decompress-response/-/decompress-response-6.0.0.tgz",
+      "integrity": "sha512-aW35yZM6Bb/4oJlZncMH2LCoZtJXTRxES17vE3hoRiowU2kWHaJKFkSBDnDR+cm9J+9QhXmREyIfv0pji9ejCQ==",
+      "license": "MIT",
+      "dependencies": {
+        "mimic-response": "^3.1.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/decompress-response/node_modules/mimic-response": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/mimic-response/-/mimic-response-3.1.0.tgz",
+      "integrity": "sha512-z0yWI+4FDrrweS8Zmt4Ej5HdJmky15+L2e6Wgn3+iK5fWzb6T3fhNFq2+MeTRb064c6Wr4N/wv0DzQTjNzHNGQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/deep-extend": {
+      "version": "0.6.0",
+      "resolved": "https://registry.npmmirror.com/deep-extend/-/deep-extend-0.6.0.tgz",
+      "integrity": "sha512-LOHxIOaPYdHlJRtCQfDIVZtfw/ufM8+rVj649RIHzcm/vGwQRXFt6OPqIFWsm2XEMrNIEtWR64sY1LEKD2vAOA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4.0.0"
+      }
+    },
+    "node_modules/deepmerge": {
+      "version": "4.3.1",
+      "resolved": "https://registry.npmmirror.com/deepmerge/-/deepmerge-4.3.1.tgz",
+      "integrity": "sha512-3sUqbMEc77XqpdNO7FRyRog+eW3ph+GYCbj+rK+uYyRMuwsVy0rMiVtPn+QJlKFvWP/1PYpapqYn0Me2knFn+A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/default-gateway": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmmirror.com/default-gateway/-/default-gateway-6.0.3.tgz",
+      "integrity": "sha512-fwSOJsbbNzZ/CUFpqFBqYfYNLj1NbMPm8MMCIzHjC83iSJRBEGmDUxU+WP661BaBQImeC2yHwXtz+P/O9o+XEg==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "execa": "^5.0.0"
+      },
+      "engines": {
+        "node": ">= 10"
+      }
+    },
+    "node_modules/defer-to-connect": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/defer-to-connect/-/defer-to-connect-2.0.1.tgz",
+      "integrity": "sha512-4tvttepXG1VaYGrRibk5EwJd1t4udunSOVMdLSAL6mId1ix438oPwPZMALY41FCijukO1L0twNcGsdzS7dHgDg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/define-data-property": {
+      "version": "1.1.4",
+      "resolved": "https://registry.npmmirror.com/define-data-property/-/define-data-property-1.1.4.tgz",
+      "integrity": "sha512-rBMvIzlpA8v6E+SJZoo++HAYqsLrkg7MSfIinMPFhmkorw7X+dOXVJQs+QT69zGkzMyfDnIMN2Wid1+NbL3T+A==",
+      "license": "MIT",
+      "dependencies": {
+        "es-define-property": "^1.0.0",
+        "es-errors": "^1.3.0",
+        "gopd": "^1.0.1"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/define-lazy-prop": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/define-lazy-prop/-/define-lazy-prop-2.0.0.tgz",
+      "integrity": "sha512-Ds09qNh8yw3khSjiJjiUInaGX9xlqZDY7JVryGxdxV7NPeuqQfplOpQ66yJFZut3jLa5zOwkXw1g9EI2uKh4Og==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/define-properties": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmmirror.com/define-properties/-/define-properties-1.2.1.tgz",
+      "integrity": "sha512-8QmQKqEASLd5nx0U1B1okLElbUuuttJ/AnYmRXbbbGDWh6uS208EjD4Xqq/I9wK7u0v6O08XhTWnt5XtEbR6Dg==",
+      "license": "MIT",
+      "dependencies": {
+        "define-data-property": "^1.0.1",
+        "has-property-descriptors": "^1.0.0",
+        "object-keys": "^1.1.1"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/del": {
+      "version": "6.1.1",
+      "resolved": "https://registry.npmmirror.com/del/-/del-6.1.1.tgz",
+      "integrity": "sha512-ua8BhapfP0JUJKC/zV9yHHDW/rDoDxP4Zhn3AkA6/xT6gY7jYXJiaeyBZznYVujhZZET+UgcbZiQ7sN3WqcImg==",
+      "license": "MIT",
+      "dependencies": {
+        "globby": "^11.0.1",
+        "graceful-fs": "^4.2.4",
+        "is-glob": "^4.0.1",
+        "is-path-cwd": "^2.2.0",
+        "is-path-inside": "^3.0.2",
+        "p-map": "^4.0.0",
+        "rimraf": "^3.0.2",
+        "slash": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/depd": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/depd/-/depd-2.0.0.tgz",
+      "integrity": "sha512-g7nH6P6dyDioJogAAGprGpCtVImJhpPk/roCzdb3fIh61/s/nPsfR6onyMwkCAR/OlC3yBC0lESvUoQEAssIrw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/dequal": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmmirror.com/dequal/-/dequal-2.0.3.tgz",
+      "integrity": "sha512-0je+qPKHEMohvfRTCEo3CrPG6cAzAYgmzKyxRiYSSDkS6eGJdyVJm7WaYA5ECaAD9wLB2T4EEeymA5aFVcYXCA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/destroy": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmmirror.com/destroy/-/destroy-1.2.0.tgz",
+      "integrity": "sha512-2sJGJTaXIIaR1w4iJSNoN0hnMY7Gpc/n8D4qSCJw8QqFWXf7cuAgnEHxBpweaVcPevC2l3KpjYCx3NypQQgaJg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8",
+        "npm": "1.2.8000 || >= 1.4.16"
+      }
+    },
+    "node_modules/detect-node": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/detect-node/-/detect-node-2.1.0.tgz",
+      "integrity": "sha512-T0NIuQpnTvFDATNuHN5roPwSBG83rFsuO+MXXH9/3N1eFbn4wcPjttvjMLEPWJ0RGUYgQE7cGgS3tNxbqCGM7g==",
+      "license": "MIT"
+    },
+    "node_modules/detect-port": {
+      "version": "1.6.1",
+      "resolved": "https://registry.npmmirror.com/detect-port/-/detect-port-1.6.1.tgz",
+      "integrity": "sha512-CmnVc+Hek2egPx1PeTFVta2W78xy2K/9Rkf6cC4T59S50tVnzKj+tnx5mmx5lwvCkujZ4uRrpRSuV+IVs3f90Q==",
+      "license": "MIT",
+      "dependencies": {
+        "address": "^1.0.1",
+        "debug": "4"
+      },
+      "bin": {
+        "detect": "bin/detect-port.js",
+        "detect-port": "bin/detect-port.js"
+      },
+      "engines": {
+        "node": ">= 4.0.0"
+      }
+    },
+    "node_modules/detect-port-alt": {
+      "version": "1.1.6",
+      "resolved": "https://registry.npmmirror.com/detect-port-alt/-/detect-port-alt-1.1.6.tgz",
+      "integrity": "sha512-5tQykt+LqfJFBEYaDITx7S7cR7mJ/zQmLXZ2qt5w04ainYZw6tBf9dBunMjVeVOdYVRUzUOE4HkY5J7+uttb5Q==",
+      "license": "MIT",
+      "dependencies": {
+        "address": "^1.0.1",
+        "debug": "^2.6.0"
+      },
+      "bin": {
+        "detect": "bin/detect-port",
+        "detect-port": "bin/detect-port"
+      },
+      "engines": {
+        "node": ">= 4.2.1"
+      }
+    },
+    "node_modules/detect-port-alt/node_modules/debug": {
+      "version": "2.6.9",
+      "resolved": "https://registry.npmmirror.com/debug/-/debug-2.6.9.tgz",
+      "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "2.0.0"
+      }
+    },
+    "node_modules/detect-port-alt/node_modules/ms": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/ms/-/ms-2.0.0.tgz",
+      "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==",
+      "license": "MIT"
+    },
+    "node_modules/devlop": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/devlop/-/devlop-1.1.0.tgz",
+      "integrity": "sha512-RWmIqhcFf1lRYBvNmr7qTNuyCt/7/ns2jbpp1+PalgE/rDQcBT0fioSMUpJ93irlUhC5hrg4cYqe6U+0ImW0rA==",
+      "license": "MIT",
+      "dependencies": {
+        "dequal": "^2.0.0"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/dir-glob": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/dir-glob/-/dir-glob-3.0.1.tgz",
+      "integrity": "sha512-WkrWp9GR4KXfKGYzOLmTuGVi1UWFfws377n9cc55/tb6DuqyF6pcQ5AbiHEshaDpY9v6oaSr2XCDidGmMwdzIA==",
+      "license": "MIT",
+      "dependencies": {
+        "path-type": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/dns-packet": {
+      "version": "5.6.1",
+      "resolved": "https://registry.npmmirror.com/dns-packet/-/dns-packet-5.6.1.tgz",
+      "integrity": "sha512-l4gcSouhcgIKRvyy99RNVOgxXiicE+2jZoNmaNmZ6JXiGajBOJAesk1OBlJuM5k2c+eudGdLxDqXuPCKIj6kpw==",
+      "license": "MIT",
+      "dependencies": {
+        "@leichtgewicht/ip-codec": "^2.0.1"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/dom-converter": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmmirror.com/dom-converter/-/dom-converter-0.2.0.tgz",
+      "integrity": "sha512-gd3ypIPfOMr9h5jIKq8E3sHOTCjeirnl0WK5ZdS1AW0Odt0b1PaWaHdJ4Qk4klv+YB9aJBS7mESXjFoDQPu6DA==",
+      "license": "MIT",
+      "dependencies": {
+        "utila": "~0.4"
+      }
+    },
+    "node_modules/dom-serializer": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/dom-serializer/-/dom-serializer-2.0.0.tgz",
+      "integrity": "sha512-wIkAryiqt/nV5EQKqQpo3SToSOV9J0DnbJqwK7Wv/Trc92zIAYZ4FlMu+JPFW1DfGFt81ZTCGgDEabffXeLyJg==",
+      "license": "MIT",
+      "dependencies": {
+        "domelementtype": "^2.3.0",
+        "domhandler": "^5.0.2",
+        "entities": "^4.2.0"
+      },
+      "funding": {
+        "url": "https://github.com/cheeriojs/dom-serializer?sponsor=1"
+      }
+    },
+    "node_modules/domelementtype": {
+      "version": "2.3.0",
+      "resolved": "https://registry.npmmirror.com/domelementtype/-/domelementtype-2.3.0.tgz",
+      "integrity": "sha512-OLETBj6w0OsagBwdXnPdN0cnMfF9opN69co+7ZrbfPGrdpPVNBUj02spi6B1N7wChLQiPn4CSH/zJvXw56gmHw==",
+      "funding": [
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/fb55"
+        }
+      ],
+      "license": "BSD-2-Clause"
+    },
+    "node_modules/domhandler": {
+      "version": "5.0.3",
+      "resolved": "https://registry.npmmirror.com/domhandler/-/domhandler-5.0.3.tgz",
+      "integrity": "sha512-cgwlv/1iFQiFnU96XXgROh8xTeetsnJiDsTc7TYCLFd9+/WNkIqPTxiM/8pSd8VIrhXGTf1Ny1q1hquVqDJB5w==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "domelementtype": "^2.3.0"
+      },
+      "engines": {
+        "node": ">= 4"
+      },
+      "funding": {
+        "url": "https://github.com/fb55/domhandler?sponsor=1"
+      }
+    },
+    "node_modules/domutils": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/domutils/-/domutils-3.1.0.tgz",
+      "integrity": "sha512-H78uMmQtI2AhgDJjWeQmHwJJ2bLPD3GMmO7Zja/ZZh84wkm+4ut+IUnUdRa8uCGX88DiVx1j6FRe1XfxEgjEZA==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "dom-serializer": "^2.0.0",
+        "domelementtype": "^2.3.0",
+        "domhandler": "^5.0.3"
+      },
+      "funding": {
+        "url": "https://github.com/fb55/domutils?sponsor=1"
+      }
+    },
+    "node_modules/dot-case": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmmirror.com/dot-case/-/dot-case-3.0.4.tgz",
+      "integrity": "sha512-Kv5nKlh6yRrdrGvxeJ2e5y2eRUpkUosIW4A2AS38zwSz27zu7ufDwQPi5Jhs3XAlGNetl3bmnGhQsMtkKJnj3w==",
+      "license": "MIT",
+      "dependencies": {
+        "no-case": "^3.0.4",
+        "tslib": "^2.0.3"
+      }
+    },
+    "node_modules/dot-prop": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmmirror.com/dot-prop/-/dot-prop-6.0.1.tgz",
+      "integrity": "sha512-tE7ztYzXHIeyvc7N+hR3oi7FIbf/NIjVP9hmAt3yMXzrQ072/fpjGLx2GxNxGxUl5V73MEqYzioOMoVhGMJ5cA==",
+      "license": "MIT",
+      "dependencies": {
+        "is-obj": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/dot-prop/node_modules/is-obj": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/is-obj/-/is-obj-2.0.0.tgz",
+      "integrity": "sha512-drqDG3cbczxxEJRoOXcOjtdp1J/lyp1mNn0xaznRs8+muBhgQcrnbspox5X5fOw0HnMnbfDzvnEMEtqDEJEo8w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/duplexer": {
+      "version": "0.1.2",
+      "resolved": "https://registry.npmmirror.com/duplexer/-/duplexer-0.1.2.tgz",
+      "integrity": "sha512-jtD6YG370ZCIi/9GTaJKQxWTZD045+4R4hTk/x1UyoqadyJ9x9CgSi1RlVDQF8U2sxLLSnFkCaMihqljHIWgMg==",
+      "license": "MIT"
+    },
+    "node_modules/eastasianwidth": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmmirror.com/eastasianwidth/-/eastasianwidth-0.2.0.tgz",
+      "integrity": "sha512-I88TYZWc9XiYHRQ4/3c5rjjfgkjhLyW2luGIheGERbNQ6OY7yTybanSpDXZa8y7VUP9YmDcYa+eyq4ca7iLqWA==",
+      "license": "MIT"
+    },
+    "node_modules/ee-first": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmmirror.com/ee-first/-/ee-first-1.1.1.tgz",
+      "integrity": "sha512-WMwm9LhRUo+WUaRN+vRuETqG89IgZphVSNkdFgeb6sS/E4OrDIN7t48CAewSHXc6C8lefD8KKfr5vY61brQlow==",
+      "license": "MIT"
+    },
+    "node_modules/electron-to-chromium": {
+      "version": "1.5.38",
+      "resolved": "https://registry.npmmirror.com/electron-to-chromium/-/electron-to-chromium-1.5.38.tgz",
+      "integrity": "sha512-VbeVexmZ1IFh+5EfrYz1I0HTzHVIlJa112UEWhciPyeOcKJGeTv6N8WnG4wsQB81DGCaVEGhpSb6o6a8WYFXXg==",
+      "license": "ISC"
+    },
+    "node_modules/emoji-regex": {
+      "version": "9.2.2",
+      "resolved": "https://registry.npmmirror.com/emoji-regex/-/emoji-regex-9.2.2.tgz",
+      "integrity": "sha512-L18DaJsXSUk2+42pv8mLs5jJT2hqFkFE4j21wOmgbUqsZ2hL72NsUU785g9RXgo3s0ZNgVl42TiHp3ZtOv/Vyg==",
+      "license": "MIT"
+    },
+    "node_modules/emojilib": {
+      "version": "2.4.0",
+      "resolved": "https://registry.npmmirror.com/emojilib/-/emojilib-2.4.0.tgz",
+      "integrity": "sha512-5U0rVMU5Y2n2+ykNLQqMoqklN9ICBT/KsvC1Gz6vqHbz2AXXGkG+Pm5rMWk/8Vjrr/mY9985Hi8DYzn1F09Nyw==",
+      "license": "MIT"
+    },
+    "node_modules/emojis-list": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/emojis-list/-/emojis-list-3.0.0.tgz",
+      "integrity": "sha512-/kyM18EfinwXZbno9FyUGeFh87KC8HRQBQGildHZbEuRyWFOmv1U10o9BBp8XVZDVNNuQKyIGIu5ZYAAXJ0V2Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 4"
+      }
+    },
+    "node_modules/emoticon": {
+      "version": "4.1.0",
+      "resolved": "https://registry.npmmirror.com/emoticon/-/emoticon-4.1.0.tgz",
+      "integrity": "sha512-VWZfnxqwNcc51hIy/sbOdEem6D+cVtpPzEEtVAFdaas30+1dgkyaOQ4sQ6Bp0tOMqWO1v+HQfYaoodOkdhK6SQ==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/encodeurl": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/encodeurl/-/encodeurl-2.0.0.tgz",
+      "integrity": "sha512-Q0n9HRi4m6JuGIV1eFlmvJB7ZEVxu93IrMyiMsGC0lrMJMWzRgx6WGquyfQgZVb31vhGgXnfmPNNXmxnOkRBrg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/enhanced-resolve": {
+      "version": "5.17.1",
+      "resolved": "https://registry.npmmirror.com/enhanced-resolve/-/enhanced-resolve-5.17.1.tgz",
+      "integrity": "sha512-LMHl3dXhTcfv8gM4kEzIUeTQ+7fpdA0l2tUf34BddXPkz2A5xJ5L/Pchd5BL6rdccM9QGvu0sWZzK1Z1t4wwyg==",
+      "license": "MIT",
+      "dependencies": {
+        "graceful-fs": "^4.2.4",
+        "tapable": "^2.2.0"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      }
+    },
+    "node_modules/entities": {
+      "version": "4.5.0",
+      "resolved": "https://registry.npmmirror.com/entities/-/entities-4.5.0.tgz",
+      "integrity": "sha512-V0hjH4dGPh9Ao5p0MoRY6BVqtwCjhz6vI5LT8AJ55H+4g9/4vbHx1I54fS0XuclLhDHArPQCiMjDxjaL8fPxhw==",
+      "license": "BSD-2-Clause",
+      "engines": {
+        "node": ">=0.12"
+      },
+      "funding": {
+        "url": "https://github.com/fb55/entities?sponsor=1"
+      }
+    },
+    "node_modules/error-ex": {
+      "version": "1.3.2",
+      "resolved": "https://registry.npmmirror.com/error-ex/-/error-ex-1.3.2.tgz",
+      "integrity": "sha512-7dFHNmqeFSEt2ZBsCriorKnn3Z2pj+fd9kmI6QoWw4//DL+icEBfc0U7qJCisqrTsKTjw4fNFy2pW9OqStD84g==",
+      "license": "MIT",
+      "dependencies": {
+        "is-arrayish": "^0.2.1"
+      }
+    },
+    "node_modules/es-define-property": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/es-define-property/-/es-define-property-1.0.0.tgz",
+      "integrity": "sha512-jxayLKShrEqqzJ0eumQbVhTYQM27CfT1T35+gCgDFoL82JLsXqTJ76zv6A0YLOgEnLUMvLzsDsGIrl8NFpT2gQ==",
+      "license": "MIT",
+      "dependencies": {
+        "get-intrinsic": "^1.2.4"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      }
+    },
+    "node_modules/es-errors": {
+      "version": "1.3.0",
+      "resolved": "https://registry.npmmirror.com/es-errors/-/es-errors-1.3.0.tgz",
+      "integrity": "sha512-Zf5H2Kxt2xjTvbJvP2ZWLEICxA6j+hAmMzIlypy4xcBg1vKVnx89Wy0GbS+kf5cwCVFFzdCFh2XSCFNULS6csw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      }
+    },
+    "node_modules/es-module-lexer": {
+      "version": "1.5.4",
+      "resolved": "https://registry.npmmirror.com/es-module-lexer/-/es-module-lexer-1.5.4.tgz",
+      "integrity": "sha512-MVNK56NiMrOwitFB7cqDwq0CQutbw+0BvLshJSse0MUNU+y1FC3bUS/AQg7oUng+/wKrrki7JfmwtVHkVfPLlw==",
+      "license": "MIT"
+    },
+    "node_modules/escalade": {
+      "version": "3.2.0",
+      "resolved": "https://registry.npmmirror.com/escalade/-/escalade-3.2.0.tgz",
+      "integrity": "sha512-WUj2qlxaQtO4g6Pq5c29GTcWGDyd8itL8zTlipgECz3JesAiiOKotd8JU6otB3PACgG6xkJUyVhboMS+bje/jA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/escape-goat": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/escape-goat/-/escape-goat-4.0.0.tgz",
+      "integrity": "sha512-2Sd4ShcWxbx6OY1IHyla/CVNwvg7XwZVoXZHcSu9w9SReNP1EzzD5T8NWKIR38fIqEns9kDWKUQTXXAmlDrdPg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/escape-html": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmmirror.com/escape-html/-/escape-html-1.0.3.tgz",
+      "integrity": "sha512-NiSupZ4OeuGwr68lGIeym/ksIZMJodUGOSCZ/FSnTxcrekbvqrgdUxlJOMpijaKZVjAJrWrGs/6Jy8OMuyj9ow==",
+      "license": "MIT"
+    },
+    "node_modules/escape-string-regexp": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/escape-string-regexp/-/escape-string-regexp-4.0.0.tgz",
+      "integrity": "sha512-TtpcNJ3XAzx3Gq8sWRzJaVajRs0uVxA2YAkdb1jm2YkPz4G6egUFAyA3n5vtEIZefPk5Wa4UXbKuS5fKkJWdgA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/eslint-scope": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmmirror.com/eslint-scope/-/eslint-scope-5.1.1.tgz",
+      "integrity": "sha512-2NxwbF/hZ0KpepYN0cNbo+FN6XoK7GaHlQhgx/hIZl6Va0bF45RQOOwhLIy8lQDbuCiadSLCBnH2CFYquit5bw==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "esrecurse": "^4.3.0",
+        "estraverse": "^4.1.1"
+      },
+      "engines": {
+        "node": ">=8.0.0"
+      }
+    },
+    "node_modules/esprima": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmmirror.com/esprima/-/esprima-4.0.1.tgz",
+      "integrity": "sha512-eGuFFw7Upda+g4p+QHvnW0RyTX/SVeJBDM/gCtMARO0cLuT2HcEKnTPvhjV6aGeqrCB/sbNop0Kszm0jsaWU4A==",
+      "license": "BSD-2-Clause",
+      "bin": {
+        "esparse": "bin/esparse.js",
+        "esvalidate": "bin/esvalidate.js"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/esrecurse": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmmirror.com/esrecurse/-/esrecurse-4.3.0.tgz",
+      "integrity": "sha512-KmfKL3b6G+RXvP8N1vr3Tq1kL/oCFgn2NYXEtqP8/L3pKapUA4G8cFVaoF3SU323CD4XypR/ffioHmkti6/Tag==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "estraverse": "^5.2.0"
+      },
+      "engines": {
+        "node": ">=4.0"
+      }
+    },
+    "node_modules/esrecurse/node_modules/estraverse": {
+      "version": "5.3.0",
+      "resolved": "https://registry.npmmirror.com/estraverse/-/estraverse-5.3.0.tgz",
+      "integrity": "sha512-MMdARuVEQziNTeJD8DgMqmhwR11BRQ/cBP+pLtYdSTnf3MIO8fFeiINEbX36ZdNlfU/7A9f3gUw49B3oQsvwBA==",
+      "license": "BSD-2-Clause",
+      "engines": {
+        "node": ">=4.0"
+      }
+    },
+    "node_modules/estraverse": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmmirror.com/estraverse/-/estraverse-4.3.0.tgz",
+      "integrity": "sha512-39nnKffWz8xN1BU/2c79n9nB9HDzo0niYUqx6xyqUnyoAnQyyWpOTdZEeiCch8BBu515t4wp9ZmgVfVhn9EBpw==",
+      "license": "BSD-2-Clause",
+      "engines": {
+        "node": ">=4.0"
+      }
+    },
+    "node_modules/estree-util-attach-comments": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/estree-util-attach-comments/-/estree-util-attach-comments-3.0.0.tgz",
+      "integrity": "sha512-cKUwm/HUcTDsYh/9FgnuFqpfquUbwIqwKM26BVCGDPVgvaCl/nDCCjUfiLlx6lsEZ3Z4RFxNbOQ60pkaEwFxGw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/estree-util-build-jsx": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/estree-util-build-jsx/-/estree-util-build-jsx-3.0.1.tgz",
+      "integrity": "sha512-8U5eiL6BTrPxp/CHbs2yMgP8ftMhR5ww1eIKoWRMlqvltHF8fZn5LRDvTKuxD3DUn+shRbLGqXemcP51oFCsGQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree-jsx": "^1.0.0",
+        "devlop": "^1.0.0",
+        "estree-util-is-identifier-name": "^3.0.0",
+        "estree-walker": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/estree-util-is-identifier-name": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/estree-util-is-identifier-name/-/estree-util-is-identifier-name-3.0.0.tgz",
+      "integrity": "sha512-hFtqIDZTIUZ9BXLb8y4pYGyk6+wekIivNVTcmvk8NoOh+VeRn5y6cEHzbURrWbfp1fIqdVipilzj+lfaadNZmg==",
+      "license": "MIT",
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/estree-util-to-js": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/estree-util-to-js/-/estree-util-to-js-2.0.0.tgz",
+      "integrity": "sha512-WDF+xj5rRWmD5tj6bIqRi6CkLIXbbNQUcxQHzGysQzvHmdYG2G7p/Tf0J0gpxGgkeMZNTIjT/AoSvC9Xehcgdg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree-jsx": "^1.0.0",
+        "astring": "^1.8.0",
+        "source-map": "^0.7.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/estree-util-value-to-estree": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmmirror.com/estree-util-value-to-estree/-/estree-util-value-to-estree-3.1.2.tgz",
+      "integrity": "sha512-S0gW2+XZkmsx00tU2uJ4L9hUT7IFabbml9pHh2WQqFmAbxit++YGZne0sKJbNwkj9Wvg9E4uqWl4nCIFQMmfag==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/remcohaszing"
+      }
+    },
+    "node_modules/estree-util-visit": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/estree-util-visit/-/estree-util-visit-2.0.0.tgz",
+      "integrity": "sha512-m5KgiH85xAhhW8Wta0vShLcUvOsh3LLPI2YVwcbio1l7E09NTLL1EyMZFM1OyWowoH0skScNbhOPl4kcBgzTww==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree-jsx": "^1.0.0",
+        "@types/unist": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/estree-walker": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmmirror.com/estree-walker/-/estree-walker-3.0.3.tgz",
+      "integrity": "sha512-7RUKfXgSMMkzt6ZuXmqapOurLGPPfgj6l9uRZ7lRGolvk0y2yocc35LdcxKC5PQZdn2DMqioAQ2NoWcrTKmm6g==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0"
+      }
+    },
+    "node_modules/esutils": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmmirror.com/esutils/-/esutils-2.0.3.tgz",
+      "integrity": "sha512-kVscqXk4OCp68SZ0dkgEKVi6/8ij300KBWTJq32P/dYeWTSwK41WyTxalN1eRmA5Z9UU/LX9D7FWSmV9SAYx6g==",
+      "license": "BSD-2-Clause",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/eta": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/eta/-/eta-2.2.0.tgz",
+      "integrity": "sha512-UVQ72Rqjy/ZKQalzV5dCCJP80GrmPrMxh6NlNf+erV6ObL0ZFkhCstWRawS85z3smdr3d2wXPsZEY7rDPfGd2g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/eta-dev/eta?sponsor=1"
+      }
+    },
+    "node_modules/etag": {
+      "version": "1.8.1",
+      "resolved": "https://registry.npmmirror.com/etag/-/etag-1.8.1.tgz",
+      "integrity": "sha512-aIL5Fx7mawVa300al2BnEE4iNvo1qETxLrPI/o05L7z6go7fCw1J6EQmbK4FmJ2AS7kgVF/KEZWufBfdClMcPg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/eval": {
+      "version": "0.1.8",
+      "resolved": "https://registry.npmmirror.com/eval/-/eval-0.1.8.tgz",
+      "integrity": "sha512-EzV94NYKoO09GLXGjXj9JIlXijVck4ONSr5wiCWDvhsvj5jxSrzTmRU/9C1DyB6uToszLs8aifA6NQ7lEQdvFw==",
+      "dependencies": {
+        "@types/node": "*",
+        "require-like": ">= 0.1.1"
+      },
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/eventemitter3": {
+      "version": "4.0.7",
+      "resolved": "https://registry.npmmirror.com/eventemitter3/-/eventemitter3-4.0.7.tgz",
+      "integrity": "sha512-8guHBZCwKnFhYdHr2ysuRWErTwhoN2X8XELRlrRwpmfeY2jjuUN4taQMsULKUVo1K4DvZl+0pgfyoysHxvmvEw==",
+      "license": "MIT"
+    },
+    "node_modules/events": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmmirror.com/events/-/events-3.3.0.tgz",
+      "integrity": "sha512-mQw+2fkQbALzQ7V0MY0IqdnXNOeTtP4r0lN9z7AAawCXgqea7bDii20AYrIBrFd/Hx0M2Ocz6S111CaFkUcb0Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.8.x"
+      }
+    },
+    "node_modules/execa": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmmirror.com/execa/-/execa-5.1.1.tgz",
+      "integrity": "sha512-8uSpZZocAZRBAPIEINJj3Lo9HyGitllczc27Eh5YYojjMFMn8yHMDMaUHE2Jqfq05D/wucwI4JGURyXt1vchyg==",
+      "license": "MIT",
+      "dependencies": {
+        "cross-spawn": "^7.0.3",
+        "get-stream": "^6.0.0",
+        "human-signals": "^2.1.0",
+        "is-stream": "^2.0.0",
+        "merge-stream": "^2.0.0",
+        "npm-run-path": "^4.0.1",
+        "onetime": "^5.1.2",
+        "signal-exit": "^3.0.3",
+        "strip-final-newline": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sindresorhus/execa?sponsor=1"
+      }
+    },
+    "node_modules/express": {
+      "version": "4.21.1",
+      "resolved": "https://registry.npmmirror.com/express/-/express-4.21.1.tgz",
+      "integrity": "sha512-YSFlK1Ee0/GC8QaO91tHcDxJiE/X4FbpAyQWkxAvG6AXCuR65YzK8ua6D9hvi/TzUfZMpc+BwuM1IPw8fmQBiQ==",
+      "license": "MIT",
+      "dependencies": {
+        "accepts": "~1.3.8",
+        "array-flatten": "1.1.1",
+        "body-parser": "1.20.3",
+        "content-disposition": "0.5.4",
+        "content-type": "~1.0.4",
+        "cookie": "0.7.1",
+        "cookie-signature": "1.0.6",
+        "debug": "2.6.9",
+        "depd": "2.0.0",
+        "encodeurl": "~2.0.0",
+        "escape-html": "~1.0.3",
+        "etag": "~1.8.1",
+        "finalhandler": "1.3.1",
+        "fresh": "0.5.2",
+        "http-errors": "2.0.0",
+        "merge-descriptors": "1.0.3",
+        "methods": "~1.1.2",
+        "on-finished": "2.4.1",
+        "parseurl": "~1.3.3",
+        "path-to-regexp": "0.1.10",
+        "proxy-addr": "~2.0.7",
+        "qs": "6.13.0",
+        "range-parser": "~1.2.1",
+        "safe-buffer": "5.2.1",
+        "send": "0.19.0",
+        "serve-static": "1.16.2",
+        "setprototypeof": "1.2.0",
+        "statuses": "2.0.1",
+        "type-is": "~1.6.18",
+        "utils-merge": "1.0.1",
+        "vary": "~1.1.2"
+      },
+      "engines": {
+        "node": ">= 0.10.0"
+      }
+    },
+    "node_modules/express/node_modules/content-disposition": {
+      "version": "0.5.4",
+      "resolved": "https://registry.npmmirror.com/content-disposition/-/content-disposition-0.5.4.tgz",
+      "integrity": "sha512-FveZTNuGw04cxlAiWbzi6zTAL/lhehaWbTtgluJh4/E95DqMwTmha3KZN1aAWA8cFIhHzMZUvLevkw5Rqk+tSQ==",
+      "license": "MIT",
+      "dependencies": {
+        "safe-buffer": "5.2.1"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/express/node_modules/debug": {
+      "version": "2.6.9",
+      "resolved": "https://registry.npmmirror.com/debug/-/debug-2.6.9.tgz",
+      "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "2.0.0"
+      }
+    },
+    "node_modules/express/node_modules/ms": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/ms/-/ms-2.0.0.tgz",
+      "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==",
+      "license": "MIT"
+    },
+    "node_modules/express/node_modules/path-to-regexp": {
+      "version": "0.1.10",
+      "resolved": "https://registry.npmmirror.com/path-to-regexp/-/path-to-regexp-0.1.10.tgz",
+      "integrity": "sha512-7lf7qcQidTku0Gu3YDPc8DJ1q7OOucfa/BSsIwjuh56VU7katFvuM8hULfkwB3Fns/rsVF7PwPKVw1sl5KQS9w==",
+      "license": "MIT"
+    },
+    "node_modules/express/node_modules/range-parser": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmmirror.com/range-parser/-/range-parser-1.2.1.tgz",
+      "integrity": "sha512-Hrgsx+orqoygnmhFbKaHE6c296J+HTAQXoxEF6gNupROmmGJRoyzfG3ccAveqCBrwr/2yxQ5BVd/GTl5agOwSg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/extend": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmmirror.com/extend/-/extend-3.0.2.tgz",
+      "integrity": "sha512-fjquC59cD7CyW6urNXK0FBufkZcoiGG80wTuPujX590cB5Ttln20E2UB4S/WARVqhXffZl2LNgS+gQdPIIim/g==",
+      "license": "MIT"
+    },
+    "node_modules/extend-shallow": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/extend-shallow/-/extend-shallow-2.0.1.tgz",
+      "integrity": "sha512-zCnTtlxNoAiDc3gqY2aYAWFx7XWWiasuF2K8Me5WbN8otHKTUKBwjPtNpRs/rbUZm7KxWAaNj7P1a/p52GbVug==",
+      "license": "MIT",
+      "dependencies": {
+        "is-extendable": "^0.1.0"
+      },
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/fast-deep-equal": {
+      "version": "3.1.3",
+      "resolved": "https://registry.npmmirror.com/fast-deep-equal/-/fast-deep-equal-3.1.3.tgz",
+      "integrity": "sha512-f3qQ9oQy9j2AhBe/H9VC91wLmKBCCU/gDOnKNAYG5hswO7BLKj09Hc5HYNz9cGI++xlpDCIgDaitVs03ATR84Q==",
+      "license": "MIT"
+    },
+    "node_modules/fast-glob": {
+      "version": "3.3.2",
+      "resolved": "https://registry.npmmirror.com/fast-glob/-/fast-glob-3.3.2.tgz",
+      "integrity": "sha512-oX2ruAFQwf/Orj8m737Y5adxDQO0LAB7/S5MnxCdTNDd4p6BsyIVsv9JQsATbTSq8KHRpLwIHbVlUNatxd+1Ow==",
+      "license": "MIT",
+      "dependencies": {
+        "@nodelib/fs.stat": "^2.0.2",
+        "@nodelib/fs.walk": "^1.2.3",
+        "glob-parent": "^5.1.2",
+        "merge2": "^1.3.0",
+        "micromatch": "^4.0.4"
+      },
+      "engines": {
+        "node": ">=8.6.0"
+      }
+    },
+    "node_modules/fast-json-stable-stringify": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/fast-json-stable-stringify/-/fast-json-stable-stringify-2.1.0.tgz",
+      "integrity": "sha512-lhd/wF+Lk98HZoTCtlVraHtfh5XYijIjalXck7saUtuanSDyLMxnHhSXEDJqHxD7msR8D0uCmqlkwjCV8xvwHw==",
+      "license": "MIT"
+    },
+    "node_modules/fast-uri": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmmirror.com/fast-uri/-/fast-uri-3.0.2.tgz",
+      "integrity": "sha512-GR6f0hD7XXyNJa25Tb9BuIdN0tdr+0BMi6/CJPH3wJO1JjNG3n/VsSw38AwRdKZABm8lGbPfakLRkYzx2V9row==",
+      "license": "MIT"
+    },
+    "node_modules/fast-url-parser": {
+      "version": "1.1.3",
+      "resolved": "https://registry.npmmirror.com/fast-url-parser/-/fast-url-parser-1.1.3.tgz",
+      "integrity": "sha512-5jOCVXADYNuRkKFzNJ0dCCewsZiYo0dz8QNYljkOpFC6r2U4OBmKtvm/Tsuh4w1YYdDqDb31a8TVhBJ2OJKdqQ==",
+      "license": "MIT",
+      "dependencies": {
+        "punycode": "^1.3.2"
+      }
+    },
+    "node_modules/fastq": {
+      "version": "1.17.1",
+      "resolved": "https://registry.npmmirror.com/fastq/-/fastq-1.17.1.tgz",
+      "integrity": "sha512-sRVD3lWVIXWg6By68ZN7vho9a1pQcN/WBFaAAsDDFzlJjvoGx0P8z7V1t72grFJfJhu3YPZBuu25f7Kaw2jN1w==",
+      "license": "ISC",
+      "dependencies": {
+        "reusify": "^1.0.4"
+      }
+    },
+    "node_modules/fault": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/fault/-/fault-2.0.1.tgz",
+      "integrity": "sha512-WtySTkS4OKev5JtpHXnib4Gxiurzh5NCGvWrFaZ34m6JehfTUhKZvn9njTfw48t6JumVQOmrKqpmGcdwxnhqBQ==",
+      "license": "MIT",
+      "dependencies": {
+        "format": "^0.2.0"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/faye-websocket": {
+      "version": "0.11.4",
+      "resolved": "https://registry.npmmirror.com/faye-websocket/-/faye-websocket-0.11.4.tgz",
+      "integrity": "sha512-CzbClwlXAuiRQAlUyfqPgvPoNKTckTPGfwZV4ZdAhVcP2lh9KUxJg2b5GkE7XbjKQ3YJnQ9z6D9ntLAlB+tP8g==",
+      "license": "Apache-2.0",
+      "dependencies": {
+        "websocket-driver": ">=0.5.1"
+      },
+      "engines": {
+        "node": ">=0.8.0"
+      }
+    },
+    "node_modules/feed": {
+      "version": "4.2.2",
+      "resolved": "https://registry.npmmirror.com/feed/-/feed-4.2.2.tgz",
+      "integrity": "sha512-u5/sxGfiMfZNtJ3OvQpXcvotFpYkL0n9u9mM2vkui2nGo8b4wvDkJ8gAkYqbA8QpGyFCv3RK0Z+Iv+9veCS9bQ==",
+      "license": "MIT",
+      "dependencies": {
+        "xml-js": "^1.6.11"
+      },
+      "engines": {
+        "node": ">=0.4.0"
+      }
+    },
+    "node_modules/file-loader": {
+      "version": "6.2.0",
+      "resolved": "https://registry.npmmirror.com/file-loader/-/file-loader-6.2.0.tgz",
+      "integrity": "sha512-qo3glqyTa61Ytg4u73GultjHGjdRyig3tG6lPtyX/jOEJvHif9uB0/OCI2Kif6ctF3caQTW2G5gym21oAsI4pw==",
+      "license": "MIT",
+      "dependencies": {
+        "loader-utils": "^2.0.0",
+        "schema-utils": "^3.0.0"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "webpack": "^4.0.0 || ^5.0.0"
+      }
+    },
+    "node_modules/file-loader/node_modules/ajv": {
+      "version": "6.12.6",
+      "resolved": "https://registry.npmmirror.com/ajv/-/ajv-6.12.6.tgz",
+      "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.1",
+        "fast-json-stable-stringify": "^2.0.0",
+        "json-schema-traverse": "^0.4.1",
+        "uri-js": "^4.2.2"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/epoberezkin"
+      }
+    },
+    "node_modules/file-loader/node_modules/ajv-keywords": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/ajv-keywords/-/ajv-keywords-3.5.2.tgz",
+      "integrity": "sha512-5p6WTN0DdTGVQk6VjcEju19IgaHudalcfabD7yhDGeA6bcQnmL+CpveLJq/3hvfwd1aof6L386Ougkx6RfyMIQ==",
+      "license": "MIT",
+      "peerDependencies": {
+        "ajv": "^6.9.1"
+      }
+    },
+    "node_modules/file-loader/node_modules/json-schema-traverse": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmmirror.com/json-schema-traverse/-/json-schema-traverse-0.4.1.tgz",
+      "integrity": "sha512-xbbCH5dCYU5T8LcEhhuh7HJ88HXuW3qsI3Y0zOZFKfZEHcpWiHU/Jxzk629Brsab/mMiHQti9wMP+845RPe3Vg==",
+      "license": "MIT"
+    },
+    "node_modules/file-loader/node_modules/schema-utils": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmmirror.com/schema-utils/-/schema-utils-3.3.0.tgz",
+      "integrity": "sha512-pN/yOAvcC+5rQ5nERGuwrjLlYvLTbCibnZ1I7B1LaiAz9BRBlE9GMgE/eqV30P7aJQUf7Ddimy/RsbYO/GrVGg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/json-schema": "^7.0.8",
+        "ajv": "^6.12.5",
+        "ajv-keywords": "^3.5.2"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      }
+    },
+    "node_modules/filesize": {
+      "version": "8.0.7",
+      "resolved": "https://registry.npmmirror.com/filesize/-/filesize-8.0.7.tgz",
+      "integrity": "sha512-pjmC+bkIF8XI7fWaH8KxHcZL3DPybs1roSKP4rKDvy20tAWwIObE4+JIseG2byfGKhud5ZnM4YSGKBz7Sh0ndQ==",
+      "license": "BSD-3-Clause",
+      "engines": {
+        "node": ">= 0.4.0"
+      }
+    },
+    "node_modules/fill-range": {
+      "version": "7.1.1",
+      "resolved": "https://registry.npmmirror.com/fill-range/-/fill-range-7.1.1.tgz",
+      "integrity": "sha512-YsGpe3WHLK8ZYi4tWDg2Jy3ebRz2rXowDxnld4bkQB00cc/1Zw9AWnC0i9ztDJitivtQvaI9KaLyKrc+hBW0yg==",
+      "license": "MIT",
+      "dependencies": {
+        "to-regex-range": "^5.0.1"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/finalhandler": {
+      "version": "1.3.1",
+      "resolved": "https://registry.npmmirror.com/finalhandler/-/finalhandler-1.3.1.tgz",
+      "integrity": "sha512-6BN9trH7bp3qvnrRyzsBz+g3lZxTNZTbVO2EV1CS0WIcDbawYVdYvGflME/9QP0h0pYlCDBCTjYa9nZzMDpyxQ==",
+      "license": "MIT",
+      "dependencies": {
+        "debug": "2.6.9",
+        "encodeurl": "~2.0.0",
+        "escape-html": "~1.0.3",
+        "on-finished": "2.4.1",
+        "parseurl": "~1.3.3",
+        "statuses": "2.0.1",
+        "unpipe": "~1.0.0"
+      },
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/finalhandler/node_modules/debug": {
+      "version": "2.6.9",
+      "resolved": "https://registry.npmmirror.com/debug/-/debug-2.6.9.tgz",
+      "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "2.0.0"
+      }
+    },
+    "node_modules/finalhandler/node_modules/ms": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/ms/-/ms-2.0.0.tgz",
+      "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==",
+      "license": "MIT"
+    },
+    "node_modules/find-cache-dir": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/find-cache-dir/-/find-cache-dir-4.0.0.tgz",
+      "integrity": "sha512-9ZonPT4ZAK4a+1pUPVPZJapbi7O5qbbJPdYw/NOQWZZbVLdDTYM3A4R9z/DpAM08IDaFGsvPgiGZ82WEwUDWjg==",
+      "license": "MIT",
+      "dependencies": {
+        "common-path-prefix": "^3.0.0",
+        "pkg-dir": "^7.0.0"
+      },
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/find-up": {
+      "version": "6.3.0",
+      "resolved": "https://registry.npmmirror.com/find-up/-/find-up-6.3.0.tgz",
+      "integrity": "sha512-v2ZsoEuVHYy8ZIlYqwPe/39Cy+cFDzp4dXPaxNvkEuouymu+2Jbz0PxpKarJHYJTmv2HWT3O382qY8l4jMWthw==",
+      "license": "MIT",
+      "dependencies": {
+        "locate-path": "^7.1.0",
+        "path-exists": "^5.0.0"
+      },
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/flat": {
+      "version": "5.0.2",
+      "resolved": "https://registry.npmmirror.com/flat/-/flat-5.0.2.tgz",
+      "integrity": "sha512-b6suED+5/3rTpUBdG1gupIl8MPFCAMA0QXwmljLhvCUKcUvdE4gWky9zpuGCcXHOsz4J9wPGNWq6OKpmIzz3hQ==",
+      "license": "BSD-3-Clause",
+      "bin": {
+        "flat": "cli.js"
+      }
+    },
+    "node_modules/follow-redirects": {
+      "version": "1.15.9",
+      "resolved": "https://registry.npmmirror.com/follow-redirects/-/follow-redirects-1.15.9.tgz",
+      "integrity": "sha512-gew4GsXizNgdoRyqmyfMHyAmXsZDk6mHkSxZFCzW9gwlbtOW44CDtYavM+y+72qD/Vq2l550kMF52DT8fOLJqQ==",
+      "funding": [
+        {
+          "type": "individual",
+          "url": "https://github.com/sponsors/RubenVerborgh"
+        }
+      ],
+      "license": "MIT",
+      "engines": {
+        "node": ">=4.0"
+      },
+      "peerDependenciesMeta": {
+        "debug": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/fork-ts-checker-webpack-plugin": {
+      "version": "6.5.3",
+      "resolved": "https://registry.npmmirror.com/fork-ts-checker-webpack-plugin/-/fork-ts-checker-webpack-plugin-6.5.3.tgz",
+      "integrity": "sha512-SbH/l9ikmMWycd5puHJKTkZJKddF4iRLyW3DeZ08HTI7NGyLS38MXd/KGgeWumQO7YNQbW2u/NtPT2YowbPaGQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/code-frame": "^7.8.3",
+        "@types/json-schema": "^7.0.5",
+        "chalk": "^4.1.0",
+        "chokidar": "^3.4.2",
+        "cosmiconfig": "^6.0.0",
+        "deepmerge": "^4.2.2",
+        "fs-extra": "^9.0.0",
+        "glob": "^7.1.6",
+        "memfs": "^3.1.2",
+        "minimatch": "^3.0.4",
+        "schema-utils": "2.7.0",
+        "semver": "^7.3.2",
+        "tapable": "^1.0.0"
+      },
+      "engines": {
+        "node": ">=10",
+        "yarn": ">=1.0.0"
+      },
+      "peerDependencies": {
+        "eslint": ">= 6",
+        "typescript": ">= 2.7",
+        "vue-template-compiler": "*",
+        "webpack": ">= 4"
+      },
+      "peerDependenciesMeta": {
+        "eslint": {
+          "optional": true
+        },
+        "vue-template-compiler": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/fork-ts-checker-webpack-plugin/node_modules/ajv": {
+      "version": "6.12.6",
+      "resolved": "https://registry.npmmirror.com/ajv/-/ajv-6.12.6.tgz",
+      "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.1",
+        "fast-json-stable-stringify": "^2.0.0",
+        "json-schema-traverse": "^0.4.1",
+        "uri-js": "^4.2.2"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/epoberezkin"
+      }
+    },
+    "node_modules/fork-ts-checker-webpack-plugin/node_modules/ajv-keywords": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/ajv-keywords/-/ajv-keywords-3.5.2.tgz",
+      "integrity": "sha512-5p6WTN0DdTGVQk6VjcEju19IgaHudalcfabD7yhDGeA6bcQnmL+CpveLJq/3hvfwd1aof6L386Ougkx6RfyMIQ==",
+      "license": "MIT",
+      "peerDependencies": {
+        "ajv": "^6.9.1"
+      }
+    },
+    "node_modules/fork-ts-checker-webpack-plugin/node_modules/cosmiconfig": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmmirror.com/cosmiconfig/-/cosmiconfig-6.0.0.tgz",
+      "integrity": "sha512-xb3ZL6+L8b9JLLCx3ZdoZy4+2ECphCMo2PwqgP1tlfVq6M6YReyzBJtvWWtbDSpNr9hn96pkCiZqUcFEc+54Qg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/parse-json": "^4.0.0",
+        "import-fresh": "^3.1.0",
+        "parse-json": "^5.0.0",
+        "path-type": "^4.0.0",
+        "yaml": "^1.7.2"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/fork-ts-checker-webpack-plugin/node_modules/fs-extra": {
+      "version": "9.1.0",
+      "resolved": "https://registry.npmmirror.com/fs-extra/-/fs-extra-9.1.0.tgz",
+      "integrity": "sha512-hcg3ZmepS30/7BSFqRvoo3DOMQu7IjqxO5nCDt+zM9XWjb33Wg7ziNT+Qvqbuc3+gWpzO02JubVyk2G4Zvo1OQ==",
+      "license": "MIT",
+      "dependencies": {
+        "at-least-node": "^1.0.0",
+        "graceful-fs": "^4.2.0",
+        "jsonfile": "^6.0.1",
+        "universalify": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/fork-ts-checker-webpack-plugin/node_modules/json-schema-traverse": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmmirror.com/json-schema-traverse/-/json-schema-traverse-0.4.1.tgz",
+      "integrity": "sha512-xbbCH5dCYU5T8LcEhhuh7HJ88HXuW3qsI3Y0zOZFKfZEHcpWiHU/Jxzk629Brsab/mMiHQti9wMP+845RPe3Vg==",
+      "license": "MIT"
+    },
+    "node_modules/fork-ts-checker-webpack-plugin/node_modules/schema-utils": {
+      "version": "2.7.0",
+      "resolved": "https://registry.npmmirror.com/schema-utils/-/schema-utils-2.7.0.tgz",
+      "integrity": "sha512-0ilKFI6QQF5nxDZLFn2dMjvc4hjg/Wkg7rHd3jK6/A4a1Hl9VFdQWvgB1UMGoU94pad1P/8N7fMcEnLnSiju8A==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/json-schema": "^7.0.4",
+        "ajv": "^6.12.2",
+        "ajv-keywords": "^3.4.1"
+      },
+      "engines": {
+        "node": ">= 8.9.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      }
+    },
+    "node_modules/fork-ts-checker-webpack-plugin/node_modules/tapable": {
+      "version": "1.1.3",
+      "resolved": "https://registry.npmmirror.com/tapable/-/tapable-1.1.3.tgz",
+      "integrity": "sha512-4WK/bYZmj8xLr+HUCODHGF1ZFzsYffasLUgEiMBY4fgtltdO6B4WJtlSbPaDTLpYTcGVwM2qLnFTICEcNxs3kA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/form-data-encoder": {
+      "version": "2.1.4",
+      "resolved": "https://registry.npmmirror.com/form-data-encoder/-/form-data-encoder-2.1.4.tgz",
+      "integrity": "sha512-yDYSgNMraqvnxiEXO4hi88+YZxaHC6QKzb5N84iRCTDeRO7ZALpir/lVmf/uXUhnwUr2O4HU8s/n6x+yNjQkHw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 14.17"
+      }
+    },
+    "node_modules/format": {
+      "version": "0.2.2",
+      "resolved": "https://registry.npmmirror.com/format/-/format-0.2.2.tgz",
+      "integrity": "sha512-wzsgA6WOq+09wrU1tsJ09udeR/YZRaeArL9e1wPbFg3GG2yDnC2ldKpxs4xunpFF9DgqCqOIra3bc1HWrJ37Ww==",
+      "engines": {
+        "node": ">=0.4.x"
+      }
+    },
+    "node_modules/forwarded": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmmirror.com/forwarded/-/forwarded-0.2.0.tgz",
+      "integrity": "sha512-buRG0fpBtRHSTCOASe6hD258tEubFoRLb4ZNA6NxMVHNw2gOcwHo9wyablzMzOA5z9xA9L1KNjk/Nt6MT9aYow==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/fraction.js": {
+      "version": "4.3.7",
+      "resolved": "https://registry.npmmirror.com/fraction.js/-/fraction.js-4.3.7.tgz",
+      "integrity": "sha512-ZsDfxO51wGAXREY55a7la9LScWpwv9RxIrYABrlvOFBlH/ShPnrtsXeuUIfXKKOVicNxQ+o8JTbJvjS4M89yew==",
+      "license": "MIT",
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "patreon",
+        "url": "https://github.com/sponsors/rawify"
+      }
+    },
+    "node_modules/fresh": {
+      "version": "0.5.2",
+      "resolved": "https://registry.npmmirror.com/fresh/-/fresh-0.5.2.tgz",
+      "integrity": "sha512-zJ2mQYM18rEFOudeV4GShTGIQ7RbzA7ozbU9I/XBpm7kqgMywgmylMwXHxZJmkVoYkna9d2pVXVXPdYTP9ej8Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/fs-extra": {
+      "version": "11.2.0",
+      "resolved": "https://registry.npmmirror.com/fs-extra/-/fs-extra-11.2.0.tgz",
+      "integrity": "sha512-PmDi3uwK5nFuXh7XDTlVnS17xJS7vW36is2+w3xcv8SVxiB4NyATf4ctkVY5bkSjX0Y4nbvZCq1/EjtEyr9ktw==",
+      "license": "MIT",
+      "dependencies": {
+        "graceful-fs": "^4.2.0",
+        "jsonfile": "^6.0.1",
+        "universalify": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=14.14"
+      }
+    },
+    "node_modules/fs-monkey": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmmirror.com/fs-monkey/-/fs-monkey-1.0.6.tgz",
+      "integrity": "sha512-b1FMfwetIKymC0eioW7mTywihSQE4oLzQn1dB6rZB5fx/3NpNEdAWeCSMB+60/AeT0TCXsxzAlcYVEFCTAksWg==",
+      "license": "Unlicense"
+    },
+    "node_modules/fs.realpath": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/fs.realpath/-/fs.realpath-1.0.0.tgz",
+      "integrity": "sha512-OO0pH2lK6a0hZnAdau5ItzHPI6pUlvI7jMVnxUQRtw4owF2wk8lOSabtGDCTP4Ggrg2MbGnWO9X8K1t4+fGMDw==",
+      "license": "ISC"
+    },
+    "node_modules/fsevents": {
+      "version": "2.3.3",
+      "resolved": "https://registry.npmmirror.com/fsevents/-/fsevents-2.3.3.tgz",
+      "integrity": "sha512-5xoDfX+fL7faATnagmWPpbFtwh/R77WmMMqqHGS65C3vvB0YHrgF+B1YmZ3441tMj5n63k0212XNoJwzlhffQw==",
+      "hasInstallScript": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "darwin"
+      ],
+      "engines": {
+        "node": "^8.16.0 || ^10.6.0 || >=11.0.0"
+      }
+    },
+    "node_modules/function-bind": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmmirror.com/function-bind/-/function-bind-1.1.2.tgz",
+      "integrity": "sha512-7XHNxH7qX9xG5mIwxkhumTox/MIRNcOgDrxWsMt2pAr23WHp6MrRlN7FBSFpCpr+oVO0F744iUgR82nJMfG2SA==",
+      "license": "MIT",
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/gensync": {
+      "version": "1.0.0-beta.2",
+      "resolved": "https://registry.npmmirror.com/gensync/-/gensync-1.0.0-beta.2.tgz",
+      "integrity": "sha512-3hN7NaskYvMDLQY55gnW3NQ+mesEAepTqlg+VEbj7zzqEMBVNhzcGYYeqFo/TlYz6eQiFcp1HcsCZO+nGgS8zg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/get-intrinsic": {
+      "version": "1.2.4",
+      "resolved": "https://registry.npmmirror.com/get-intrinsic/-/get-intrinsic-1.2.4.tgz",
+      "integrity": "sha512-5uYhsJH8VJBTv7oslg4BznJYhDoRI6waYCxMmCdnTrcCrHA/fCFKoTFz2JKKE0HdDFUF7/oQuhzumXJK7paBRQ==",
+      "license": "MIT",
+      "dependencies": {
+        "es-errors": "^1.3.0",
+        "function-bind": "^1.1.2",
+        "has-proto": "^1.0.1",
+        "has-symbols": "^1.0.3",
+        "hasown": "^2.0.0"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/get-own-enumerable-property-symbols": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmmirror.com/get-own-enumerable-property-symbols/-/get-own-enumerable-property-symbols-3.0.2.tgz",
+      "integrity": "sha512-I0UBV/XOz1XkIJHEUDMZAbzCThU/H8DxmSfmdGcKPnVhu2VfFqr34jr9777IyaTYvxjedWhqVIilEDsCdP5G6g==",
+      "license": "ISC"
+    },
+    "node_modules/get-stream": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmmirror.com/get-stream/-/get-stream-6.0.1.tgz",
+      "integrity": "sha512-ts6Wi+2j3jQjqi70w5AlN8DFnkSwC+MqmxEzdEALB2qXZYV3X/b1CTfgPLGJNMeAWxdPfU8FO1ms3NUfaHCPYg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/github-slugger": {
+      "version": "1.5.0",
+      "resolved": "https://registry.npmmirror.com/github-slugger/-/github-slugger-1.5.0.tgz",
+      "integrity": "sha512-wIh+gKBI9Nshz2o46B0B3f5k/W+WI9ZAv6y5Dn5WJ5SK1t0TnDimB4WE5rmTD05ZAIn8HALCZVmCsvj0w0v0lw==",
+      "license": "ISC"
+    },
+    "node_modules/glob": {
+      "version": "7.2.3",
+      "resolved": "https://registry.npmmirror.com/glob/-/glob-7.2.3.tgz",
+      "integrity": "sha512-nFR0zLpU2YCaRxwoCJvL6UvCH2JFyFVIvwTLsIf21AuHlMskA1hhTdk+LlYJtOlYt9v6dvszD2BGRqBL+iQK9Q==",
+      "deprecated": "Glob versions prior to v9 are no longer supported",
+      "license": "ISC",
+      "dependencies": {
+        "fs.realpath": "^1.0.0",
+        "inflight": "^1.0.4",
+        "inherits": "2",
+        "minimatch": "^3.1.1",
+        "once": "^1.3.0",
+        "path-is-absolute": "^1.0.0"
+      },
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/isaacs"
+      }
+    },
+    "node_modules/glob-parent": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmmirror.com/glob-parent/-/glob-parent-5.1.2.tgz",
+      "integrity": "sha512-AOIgSQCepiJYwP3ARnGx+5VnTu2HBYdzbGP45eLw1vr3zB3vZLeyed1sC9hnbcOc9/SrMyM5RPQrkGz4aS9Zow==",
+      "license": "ISC",
+      "dependencies": {
+        "is-glob": "^4.0.1"
+      },
+      "engines": {
+        "node": ">= 6"
+      }
+    },
+    "node_modules/glob-to-regexp": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmmirror.com/glob-to-regexp/-/glob-to-regexp-0.4.1.tgz",
+      "integrity": "sha512-lkX1HJXwyMcprw/5YUZc2s7DrpAiHB21/V+E1rHUrVNokkvB6bqMzT0VfV6/86ZNabt1k14YOIaT7nDvOX3Iiw==",
+      "license": "BSD-2-Clause"
+    },
+    "node_modules/global-dirs": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/global-dirs/-/global-dirs-3.0.1.tgz",
+      "integrity": "sha512-NBcGGFbBA9s1VzD41QXDG+3++t9Mn5t1FpLdhESY6oKY4gYTFpX4wO3sqGUa0Srjtbfj3szX0RnemmrVRUdULA==",
+      "license": "MIT",
+      "dependencies": {
+        "ini": "2.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/global-dirs/node_modules/ini": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/ini/-/ini-2.0.0.tgz",
+      "integrity": "sha512-7PnF4oN3CvZF23ADhA5wRaYEQpJ8qygSkbtTXWBeXWXmEVRXK+1ITciHWwHhsjv1TmW0MgacIv6hEi5pX5NQdA==",
+      "license": "ISC",
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/global-modules": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/global-modules/-/global-modules-2.0.0.tgz",
+      "integrity": "sha512-NGbfmJBp9x8IxyJSd1P+otYK8vonoJactOogrVfFRIAEY1ukil8RSKDz2Yo7wh1oihl51l/r6W4epkeKJHqL8A==",
+      "license": "MIT",
+      "dependencies": {
+        "global-prefix": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/global-prefix": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/global-prefix/-/global-prefix-3.0.0.tgz",
+      "integrity": "sha512-awConJSVCHVGND6x3tmMaKcQvwXLhjdkmomy2W+Goaui8YPgYgXJZewhg3fWC+DlfqqQuWg8AwqjGTD2nAPVWg==",
+      "license": "MIT",
+      "dependencies": {
+        "ini": "^1.3.5",
+        "kind-of": "^6.0.2",
+        "which": "^1.3.1"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/global-prefix/node_modules/which": {
+      "version": "1.3.1",
+      "resolved": "https://registry.npmmirror.com/which/-/which-1.3.1.tgz",
+      "integrity": "sha512-HxJdYWq1MTIQbJ3nw0cqssHoTNU267KlrDuGZ1WYlxDStUtKUhOaJmh112/TZmHxxUfuJqPXSOm7tDyas0OSIQ==",
+      "license": "ISC",
+      "dependencies": {
+        "isexe": "^2.0.0"
+      },
+      "bin": {
+        "which": "bin/which"
+      }
+    },
+    "node_modules/globals": {
+      "version": "11.12.0",
+      "resolved": "https://registry.npmmirror.com/globals/-/globals-11.12.0.tgz",
+      "integrity": "sha512-WOBp/EEGUiIsJSp7wcv/y6MO+lV9UoncWqxuFfm8eBwzWNgyfBd6Gz+IeKQ9jCmyhoH99g15M3T+QaVHFjizVA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/globby": {
+      "version": "11.1.0",
+      "resolved": "https://registry.npmmirror.com/globby/-/globby-11.1.0.tgz",
+      "integrity": "sha512-jhIXaOzy1sb8IyocaruWSn1TjmnBVs8Ayhcy83rmxNJ8q2uWKCAj3CnJY+KpGSXCueAPc0i05kVvVKtP1t9S3g==",
+      "license": "MIT",
+      "dependencies": {
+        "array-union": "^2.1.0",
+        "dir-glob": "^3.0.1",
+        "fast-glob": "^3.2.9",
+        "ignore": "^5.2.0",
+        "merge2": "^1.4.1",
+        "slash": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/gopd": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmmirror.com/gopd/-/gopd-1.0.1.tgz",
+      "integrity": "sha512-d65bNlIadxvpb/A2abVdlqKqV563juRnZ1Wtk6s1sIR8uNsXR70xqIzVqxVf1eTqDunwT2MkczEeaezCKTZhwA==",
+      "license": "MIT",
+      "dependencies": {
+        "get-intrinsic": "^1.1.3"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/got": {
+      "version": "12.6.1",
+      "resolved": "https://registry.npmmirror.com/got/-/got-12.6.1.tgz",
+      "integrity": "sha512-mThBblvlAF1d4O5oqyvN+ZxLAYwIJK7bpMxgYqPD9okW0C3qm5FFn7k811QrcuEBwaogR3ngOFoCfs6mRv7teQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@sindresorhus/is": "^5.2.0",
+        "@szmarczak/http-timer": "^5.0.1",
+        "cacheable-lookup": "^7.0.0",
+        "cacheable-request": "^10.2.8",
+        "decompress-response": "^6.0.0",
+        "form-data-encoder": "^2.1.2",
+        "get-stream": "^6.0.1",
+        "http2-wrapper": "^2.1.10",
+        "lowercase-keys": "^3.0.0",
+        "p-cancelable": "^3.0.0",
+        "responselike": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sindresorhus/got?sponsor=1"
+      }
+    },
+    "node_modules/got/node_modules/@sindresorhus/is": {
+      "version": "5.6.0",
+      "resolved": "https://registry.npmmirror.com/@sindresorhus/is/-/is-5.6.0.tgz",
+      "integrity": "sha512-TV7t8GKYaJWsn00tFDqBw8+Uqmr8A0fRU1tvTQhyZzGv0sJCGRQL3JGMI3ucuKo3XIZdUP+Lx7/gh2t3lewy7g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sindresorhus/is?sponsor=1"
+      }
+    },
+    "node_modules/graceful-fs": {
+      "version": "4.2.11",
+      "resolved": "https://registry.npmmirror.com/graceful-fs/-/graceful-fs-4.2.11.tgz",
+      "integrity": "sha512-RbJ5/jmFcNNCcDV5o9eTnBLJ/HszWV0P73bc+Ff4nS/rJj+YaS6IGyiOL0VoBYX+l1Wrl3k63h/KrH+nhJ0XvQ==",
+      "license": "ISC"
+    },
+    "node_modules/gray-matter": {
+      "version": "4.0.3",
+      "resolved": "https://registry.npmmirror.com/gray-matter/-/gray-matter-4.0.3.tgz",
+      "integrity": "sha512-5v6yZd4JK3eMI3FqqCouswVqwugaA9r4dNZB1wwcmrD02QkV5H0y7XBQW8QwQqEaZY1pM9aqORSORhJRdNK44Q==",
+      "license": "MIT",
+      "dependencies": {
+        "js-yaml": "^3.13.1",
+        "kind-of": "^6.0.2",
+        "section-matter": "^1.0.0",
+        "strip-bom-string": "^1.0.0"
+      },
+      "engines": {
+        "node": ">=6.0"
+      }
+    },
+    "node_modules/gray-matter/node_modules/argparse": {
+      "version": "1.0.10",
+      "resolved": "https://registry.npmmirror.com/argparse/-/argparse-1.0.10.tgz",
+      "integrity": "sha512-o5Roy6tNG4SL/FOkCAN6RzjiakZS25RLYFrcMttJqbdd8BWrnA+fGz57iN5Pb06pvBGvl5gQ0B48dJlslXvoTg==",
+      "license": "MIT",
+      "dependencies": {
+        "sprintf-js": "~1.0.2"
+      }
+    },
+    "node_modules/gray-matter/node_modules/js-yaml": {
+      "version": "3.14.1",
+      "resolved": "https://registry.npmmirror.com/js-yaml/-/js-yaml-3.14.1.tgz",
+      "integrity": "sha512-okMH7OXXJ7YrN9Ok3/SXrnu4iX9yOk+25nqX4imS2npuvTYDmo/QEZoqwZkYaIDk3jVvBOTOIEgEhaLOynBS9g==",
+      "license": "MIT",
+      "dependencies": {
+        "argparse": "^1.0.7",
+        "esprima": "^4.0.0"
+      },
+      "bin": {
+        "js-yaml": "bin/js-yaml.js"
+      }
+    },
+    "node_modules/gzip-size": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmmirror.com/gzip-size/-/gzip-size-6.0.0.tgz",
+      "integrity": "sha512-ax7ZYomf6jqPTQ4+XCpUGyXKHk5WweS+e05MBO4/y3WJ5RkmPXNKvX+bx1behVILVwr6JSQvZAku021CHPXG3Q==",
+      "license": "MIT",
+      "dependencies": {
+        "duplexer": "^0.1.2"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/handle-thing": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/handle-thing/-/handle-thing-2.0.1.tgz",
+      "integrity": "sha512-9Qn4yBxelxoh2Ow62nP+Ka/kMnOXRi8BXnRaUwezLNhqelnN49xKz4F/dPP8OYLxLxq6JDtZb2i9XznUQbNPTg==",
+      "license": "MIT"
+    },
+    "node_modules/has-flag": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/has-flag/-/has-flag-4.0.0.tgz",
+      "integrity": "sha512-EykJT/Q1KjTWctppgIAgfSO0tKVuZUjhgMr17kqTumMl6Afv3EISleU7qZUzoXDFTAHTDC4NOoG/ZxU3EvlMPQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/has-property-descriptors": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/has-property-descriptors/-/has-property-descriptors-1.0.2.tgz",
+      "integrity": "sha512-55JNKuIW+vq4Ke1BjOTjM2YctQIvCT7GFzHwmfZPGo5wnrgkid0YQtnAleFSqumZm4az3n2BS+erby5ipJdgrg==",
+      "license": "MIT",
+      "dependencies": {
+        "es-define-property": "^1.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/has-proto": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmmirror.com/has-proto/-/has-proto-1.0.3.tgz",
+      "integrity": "sha512-SJ1amZAJUiZS+PhsVLf5tGydlaVB8EdFpaSO4gmiUKUOxk8qzn5AIy4ZeJUmh22znIdk/uMAUT2pl3FxzVUH+Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/has-symbols": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmmirror.com/has-symbols/-/has-symbols-1.0.3.tgz",
+      "integrity": "sha512-l3LCuF6MgDNwTDKkdYGEihYjt5pRPbEg46rtlmnSPlUbgmB8LOIrKJbYYFBSbnPaJexMKtiPO8hmeRjRz2Td+A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/has-yarn": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/has-yarn/-/has-yarn-3.0.0.tgz",
+      "integrity": "sha512-IrsVwUHhEULx3R8f/aA8AHuEzAorplsab/v8HBzEiIukwq5i/EC+xmOW+HfP1OaDP+2JkgT1yILHN2O3UFIbcA==",
+      "license": "MIT",
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/hasown": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/hasown/-/hasown-2.0.2.tgz",
+      "integrity": "sha512-0hJU9SCPvmMzIBdZFqNPXWa6dqh7WdH0cII9y+CyS8rG3nL48Bclra9HmKhVVUHyPWNH5Y7xDwAB7bfgSjkUMQ==",
+      "license": "MIT",
+      "dependencies": {
+        "function-bind": "^1.1.2"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      }
+    },
+    "node_modules/hast-util-from-parse5": {
+      "version": "8.0.1",
+      "resolved": "https://registry.npmmirror.com/hast-util-from-parse5/-/hast-util-from-parse5-8.0.1.tgz",
+      "integrity": "sha512-Er/Iixbc7IEa7r/XLtuG52zoqn/b3Xng/w6aZQ0xGVxzhw5xUFxcRqdPzP6yFi/4HBYRaifaI5fQ1RH8n0ZeOQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/hast": "^3.0.0",
+        "@types/unist": "^3.0.0",
+        "devlop": "^1.0.0",
+        "hastscript": "^8.0.0",
+        "property-information": "^6.0.0",
+        "vfile": "^6.0.0",
+        "vfile-location": "^5.0.0",
+        "web-namespaces": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/hast-util-parse-selector": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/hast-util-parse-selector/-/hast-util-parse-selector-4.0.0.tgz",
+      "integrity": "sha512-wkQCkSYoOGCRKERFWcxMVMOcYE2K1AaNLU8DXS9arxnLOUEWbOXKXiJUNzEpqZ3JOKpnha3jkFrumEjVliDe7A==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/hast": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/hast-util-raw": {
+      "version": "9.0.4",
+      "resolved": "https://registry.npmmirror.com/hast-util-raw/-/hast-util-raw-9.0.4.tgz",
+      "integrity": "sha512-LHE65TD2YiNsHD3YuXcKPHXPLuYh/gjp12mOfU8jxSrm1f/yJpsb0F/KKljS6U9LJoP0Ux+tCe8iJ2AsPzTdgA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/hast": "^3.0.0",
+        "@types/unist": "^3.0.0",
+        "@ungap/structured-clone": "^1.0.0",
+        "hast-util-from-parse5": "^8.0.0",
+        "hast-util-to-parse5": "^8.0.0",
+        "html-void-elements": "^3.0.0",
+        "mdast-util-to-hast": "^13.0.0",
+        "parse5": "^7.0.0",
+        "unist-util-position": "^5.0.0",
+        "unist-util-visit": "^5.0.0",
+        "vfile": "^6.0.0",
+        "web-namespaces": "^2.0.0",
+        "zwitch": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/hast-util-to-estree": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/hast-util-to-estree/-/hast-util-to-estree-3.1.0.tgz",
+      "integrity": "sha512-lfX5g6hqVh9kjS/B9E2gSkvHH4SZNiQFiqWS0x9fENzEl+8W12RqdRxX6d/Cwxi30tPQs3bIO+aolQJNp1bIyw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0",
+        "@types/estree-jsx": "^1.0.0",
+        "@types/hast": "^3.0.0",
+        "comma-separated-tokens": "^2.0.0",
+        "devlop": "^1.0.0",
+        "estree-util-attach-comments": "^3.0.0",
+        "estree-util-is-identifier-name": "^3.0.0",
+        "hast-util-whitespace": "^3.0.0",
+        "mdast-util-mdx-expression": "^2.0.0",
+        "mdast-util-mdx-jsx": "^3.0.0",
+        "mdast-util-mdxjs-esm": "^2.0.0",
+        "property-information": "^6.0.0",
+        "space-separated-tokens": "^2.0.0",
+        "style-to-object": "^0.4.0",
+        "unist-util-position": "^5.0.0",
+        "zwitch": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/hast-util-to-jsx-runtime": {
+      "version": "2.3.2",
+      "resolved": "https://registry.npmmirror.com/hast-util-to-jsx-runtime/-/hast-util-to-jsx-runtime-2.3.2.tgz",
+      "integrity": "sha512-1ngXYb+V9UT5h+PxNRa1O1FYguZK/XL+gkeqvp7EdHlB9oHUG0eYRo/vY5inBdcqo3RkPMC58/H94HvkbfGdyg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0",
+        "@types/hast": "^3.0.0",
+        "@types/unist": "^3.0.0",
+        "comma-separated-tokens": "^2.0.0",
+        "devlop": "^1.0.0",
+        "estree-util-is-identifier-name": "^3.0.0",
+        "hast-util-whitespace": "^3.0.0",
+        "mdast-util-mdx-expression": "^2.0.0",
+        "mdast-util-mdx-jsx": "^3.0.0",
+        "mdast-util-mdxjs-esm": "^2.0.0",
+        "property-information": "^6.0.0",
+        "space-separated-tokens": "^2.0.0",
+        "style-to-object": "^1.0.0",
+        "unist-util-position": "^5.0.0",
+        "vfile-message": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/hast-util-to-jsx-runtime/node_modules/inline-style-parser": {
+      "version": "0.2.4",
+      "resolved": "https://registry.npmmirror.com/inline-style-parser/-/inline-style-parser-0.2.4.tgz",
+      "integrity": "sha512-0aO8FkhNZlj/ZIbNi7Lxxr12obT7cL1moPfE4tg1LkX7LlLfC6DeX4l2ZEud1ukP9jNQyNnfzQVqwbwmAATY4Q==",
+      "license": "MIT"
+    },
+    "node_modules/hast-util-to-jsx-runtime/node_modules/style-to-object": {
+      "version": "1.0.8",
+      "resolved": "https://registry.npmmirror.com/style-to-object/-/style-to-object-1.0.8.tgz",
+      "integrity": "sha512-xT47I/Eo0rwJmaXC4oilDGDWLohVhR6o/xAQcPQN8q6QBuZVL8qMYL85kLmST5cPjAorwvqIA4qXTRQoYHaL6g==",
+      "license": "MIT",
+      "dependencies": {
+        "inline-style-parser": "0.2.4"
+      }
+    },
+    "node_modules/hast-util-to-parse5": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/hast-util-to-parse5/-/hast-util-to-parse5-8.0.0.tgz",
+      "integrity": "sha512-3KKrV5ZVI8if87DVSi1vDeByYrkGzg4mEfeu4alwgmmIeARiBLKCZS2uw5Gb6nU9x9Yufyj3iudm6i7nl52PFw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/hast": "^3.0.0",
+        "comma-separated-tokens": "^2.0.0",
+        "devlop": "^1.0.0",
+        "property-information": "^6.0.0",
+        "space-separated-tokens": "^2.0.0",
+        "web-namespaces": "^2.0.0",
+        "zwitch": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/hast-util-whitespace": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/hast-util-whitespace/-/hast-util-whitespace-3.0.0.tgz",
+      "integrity": "sha512-88JUN06ipLwsnv+dVn+OIYOvAuvBMy/Qoi6O7mQHxdPXpjy+Cd6xRkWwux7DKO+4sYILtLBRIKgsdpS2gQc7qw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/hast": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/hastscript": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmmirror.com/hastscript/-/hastscript-8.0.0.tgz",
+      "integrity": "sha512-dMOtzCEd3ABUeSIISmrETiKuyydk1w0pa+gE/uormcTpSYuaNJPbX1NU3JLyscSLjwAQM8bWMhhIlnCqnRvDTw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/hast": "^3.0.0",
+        "comma-separated-tokens": "^2.0.0",
+        "hast-util-parse-selector": "^4.0.0",
+        "property-information": "^6.0.0",
+        "space-separated-tokens": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/he": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmmirror.com/he/-/he-1.2.0.tgz",
+      "integrity": "sha512-F/1DnUGPopORZi0ni+CvrCgHQ5FyEAHRLSApuYWMmrbSwoN2Mn/7k+Gl38gJnR7yyDZk6WLXwiGod1JOWNDKGw==",
+      "license": "MIT",
+      "bin": {
+        "he": "bin/he"
+      }
+    },
+    "node_modules/history": {
+      "version": "4.10.1",
+      "resolved": "https://registry.npmmirror.com/history/-/history-4.10.1.tgz",
+      "integrity": "sha512-36nwAD620w12kuzPAsyINPWJqlNbij+hpK1k9XRloDtym8mxzGYl2c17LnV6IAGB2Dmg4tEa7G7DlawS0+qjew==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.1.2",
+        "loose-envify": "^1.2.0",
+        "resolve-pathname": "^3.0.0",
+        "tiny-invariant": "^1.0.2",
+        "tiny-warning": "^1.0.0",
+        "value-equal": "^1.0.1"
+      }
+    },
+    "node_modules/hoist-non-react-statics": {
+      "version": "3.3.2",
+      "resolved": "https://registry.npmmirror.com/hoist-non-react-statics/-/hoist-non-react-statics-3.3.2.tgz",
+      "integrity": "sha512-/gGivxi8JPKWNm/W0jSmzcMPpfpPLc3dY/6GxhX2hQ9iGj3aDfklV4ET7NjKpSinLpJ5vafa9iiGIEZg10SfBw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "react-is": "^16.7.0"
+      }
+    },
+    "node_modules/hpack.js": {
+      "version": "2.1.6",
+      "resolved": "https://registry.npmmirror.com/hpack.js/-/hpack.js-2.1.6.tgz",
+      "integrity": "sha512-zJxVehUdMGIKsRaNt7apO2Gqp0BdqW5yaiGHXXmbpvxgBYVZnAql+BJb4RO5ad2MgpbZKn5G6nMnegrH1FcNYQ==",
+      "license": "MIT",
+      "dependencies": {
+        "inherits": "^2.0.1",
+        "obuf": "^1.0.0",
+        "readable-stream": "^2.0.1",
+        "wbuf": "^1.1.0"
+      }
+    },
+    "node_modules/hpack.js/node_modules/isarray": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/isarray/-/isarray-1.0.0.tgz",
+      "integrity": "sha512-VLghIWNM6ELQzo7zwmcg0NmTVyWKYjvIeM83yjp0wRDTmUnrM678fQbcKBo6n2CJEF0szoG//ytg+TKla89ALQ==",
+      "license": "MIT"
+    },
+    "node_modules/hpack.js/node_modules/readable-stream": {
+      "version": "2.3.8",
+      "resolved": "https://registry.npmmirror.com/readable-stream/-/readable-stream-2.3.8.tgz",
+      "integrity": "sha512-8p0AUk4XODgIewSi0l8Epjs+EVnWiK7NoDIEGU0HhE7+ZyY8D1IMY7odu5lRrFXGg71L15KG8QrPmum45RTtdA==",
+      "license": "MIT",
+      "dependencies": {
+        "core-util-is": "~1.0.0",
+        "inherits": "~2.0.3",
+        "isarray": "~1.0.0",
+        "process-nextick-args": "~2.0.0",
+        "safe-buffer": "~5.1.1",
+        "string_decoder": "~1.1.1",
+        "util-deprecate": "~1.0.1"
+      }
+    },
+    "node_modules/hpack.js/node_modules/safe-buffer": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmmirror.com/safe-buffer/-/safe-buffer-5.1.2.tgz",
+      "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
+      "license": "MIT"
+    },
+    "node_modules/hpack.js/node_modules/string_decoder": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmmirror.com/string_decoder/-/string_decoder-1.1.1.tgz",
+      "integrity": "sha512-n/ShnvDi6FHbbVfviro+WojiFzv+s8MPMHBczVePfUpDJLwoLT0ht1l4YwBCbi8pJAveEEdnkHyPyTP/mzRfwg==",
+      "license": "MIT",
+      "dependencies": {
+        "safe-buffer": "~5.1.0"
+      }
+    },
+    "node_modules/html-entities": {
+      "version": "2.5.2",
+      "resolved": "https://registry.npmmirror.com/html-entities/-/html-entities-2.5.2.tgz",
+      "integrity": "sha512-K//PSRMQk4FZ78Kyau+mZurHn3FH0Vwr+H36eE0rPbeYkRRi9YxceYPhuN60UwWorxyKHhqoAJl2OFKa4BVtaA==",
+      "funding": [
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/mdevils"
+        },
+        {
+          "type": "patreon",
+          "url": "https://patreon.com/mdevils"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/html-escaper": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/html-escaper/-/html-escaper-2.0.2.tgz",
+      "integrity": "sha512-H2iMtd0I4Mt5eYiapRdIDjp+XzelXQ0tFE4JS7YFwFevXXMmOp9myNrUvCg0D6ws8iqkRPBfKHgbwig1SmlLfg==",
+      "license": "MIT"
+    },
+    "node_modules/html-minifier-terser": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmmirror.com/html-minifier-terser/-/html-minifier-terser-7.2.0.tgz",
+      "integrity": "sha512-tXgn3QfqPIpGl9o+K5tpcj3/MN4SfLtsx2GWwBC3SSd0tXQGyF3gsSqad8loJgKZGM3ZxbYDd5yhiBIdWpmvLA==",
+      "license": "MIT",
+      "dependencies": {
+        "camel-case": "^4.1.2",
+        "clean-css": "~5.3.2",
+        "commander": "^10.0.0",
+        "entities": "^4.4.0",
+        "param-case": "^3.0.4",
+        "relateurl": "^0.2.7",
+        "terser": "^5.15.1"
+      },
+      "bin": {
+        "html-minifier-terser": "cli.js"
+      },
+      "engines": {
+        "node": "^14.13.1 || >=16.0.0"
+      }
+    },
+    "node_modules/html-minifier-terser/node_modules/commander": {
+      "version": "10.0.1",
+      "resolved": "https://registry.npmmirror.com/commander/-/commander-10.0.1.tgz",
+      "integrity": "sha512-y4Mg2tXshplEbSGzx7amzPwKKOCGuoSRP/CjEdwwk0FOGlUbq6lKuoyDZTNZkmxHdJtp54hdfY/JUrdL7Xfdug==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      }
+    },
+    "node_modules/html-tags": {
+      "version": "3.3.1",
+      "resolved": "https://registry.npmmirror.com/html-tags/-/html-tags-3.3.1.tgz",
+      "integrity": "sha512-ztqyC3kLto0e9WbNp0aeP+M3kTt+nbaIveGmUxAtZa+8iFgKLUOD4YKM5j+f3QD89bra7UeumolZHKuOXnTmeQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/html-void-elements": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/html-void-elements/-/html-void-elements-3.0.0.tgz",
+      "integrity": "sha512-bEqo66MRXsUGxWHV5IP0PUiAWwoEjba4VCzg0LjFJBpchPaTfyfCKTG6bc5F8ucKec3q5y6qOdGyYTSBEvhCrg==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/html-webpack-plugin": {
+      "version": "5.6.0",
+      "resolved": "https://registry.npmmirror.com/html-webpack-plugin/-/html-webpack-plugin-5.6.0.tgz",
+      "integrity": "sha512-iwaY4wzbe48AfKLZ/Cc8k0L+FKG6oSNRaZ8x5A/T/IVDGyXcbHncM9TdDa93wn0FsSm82FhTKW7f3vS61thXAw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/html-minifier-terser": "^6.0.0",
+        "html-minifier-terser": "^6.0.2",
+        "lodash": "^4.17.21",
+        "pretty-error": "^4.0.0",
+        "tapable": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/html-webpack-plugin"
+      },
+      "peerDependencies": {
+        "@rspack/core": "0.x || 1.x",
+        "webpack": "^5.20.0"
+      },
+      "peerDependenciesMeta": {
+        "@rspack/core": {
+          "optional": true
+        },
+        "webpack": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/html-webpack-plugin/node_modules/commander": {
+      "version": "8.3.0",
+      "resolved": "https://registry.npmmirror.com/commander/-/commander-8.3.0.tgz",
+      "integrity": "sha512-OkTL9umf+He2DZkUq8f8J9of7yL6RJKI24dVITBmNfZBmri9zYZQrKkuXiKhyfPSu8tUhnVBB1iKXevvnlR4Ww==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 12"
+      }
+    },
+    "node_modules/html-webpack-plugin/node_modules/html-minifier-terser": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/html-minifier-terser/-/html-minifier-terser-6.1.0.tgz",
+      "integrity": "sha512-YXxSlJBZTP7RS3tWnQw74ooKa6L9b9i9QYXY21eUEvhZ3u9XLfv6OnFsQq6RxkhHygsaUMvYsZRV5rU/OVNZxw==",
+      "license": "MIT",
+      "dependencies": {
+        "camel-case": "^4.1.2",
+        "clean-css": "^5.2.2",
+        "commander": "^8.3.0",
+        "he": "^1.2.0",
+        "param-case": "^3.0.4",
+        "relateurl": "^0.2.7",
+        "terser": "^5.10.0"
+      },
+      "bin": {
+        "html-minifier-terser": "cli.js"
+      },
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/htmlparser2": {
+      "version": "8.0.2",
+      "resolved": "https://registry.npmmirror.com/htmlparser2/-/htmlparser2-8.0.2.tgz",
+      "integrity": "sha512-GYdjWKDkbRLkZ5geuHs5NY1puJ+PXwP7+fHPRz06Eirsb9ugf6d8kkXav6ADhcODhFFPMIXyxkxSuMf3D6NCFA==",
+      "funding": [
+        "https://github.com/fb55/htmlparser2?sponsor=1",
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/fb55"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "domelementtype": "^2.3.0",
+        "domhandler": "^5.0.3",
+        "domutils": "^3.0.1",
+        "entities": "^4.4.0"
+      }
+    },
+    "node_modules/http-cache-semantics": {
+      "version": "4.1.1",
+      "resolved": "https://registry.npmmirror.com/http-cache-semantics/-/http-cache-semantics-4.1.1.tgz",
+      "integrity": "sha512-er295DKPVsV82j5kw1Gjt+ADA/XYHsajl82cGNQG2eyoPkvgUhX+nDIyelzhIWbbsXP39EHcI6l5tYs2FYqYXQ==",
+      "license": "BSD-2-Clause"
+    },
+    "node_modules/http-deceiver": {
+      "version": "1.2.7",
+      "resolved": "https://registry.npmmirror.com/http-deceiver/-/http-deceiver-1.2.7.tgz",
+      "integrity": "sha512-LmpOGxTfbpgtGVxJrj5k7asXHCgNZp5nLfp+hWc8QQRqtb7fUy6kRY3BO1h9ddF6yIPYUARgxGOwB42DnxIaNw==",
+      "license": "MIT"
+    },
+    "node_modules/http-errors": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/http-errors/-/http-errors-2.0.0.tgz",
+      "integrity": "sha512-FtwrG/euBzaEjYeRqOgly7G0qviiXoJWnvEH2Z1plBdXgbyjv34pHTSb9zoeHMyDy33+DWy5Wt9Wo+TURtOYSQ==",
+      "license": "MIT",
+      "dependencies": {
+        "depd": "2.0.0",
+        "inherits": "2.0.4",
+        "setprototypeof": "1.2.0",
+        "statuses": "2.0.1",
+        "toidentifier": "1.0.1"
+      },
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/http-parser-js": {
+      "version": "0.5.8",
+      "resolved": "https://registry.npmmirror.com/http-parser-js/-/http-parser-js-0.5.8.tgz",
+      "integrity": "sha512-SGeBX54F94Wgu5RH3X5jsDtf4eHyRogWX1XGT3b4HuW3tQPM4AaBzoUji/4AAJNXCEOWZ5O0DgZmJw1947gD5Q==",
+      "license": "MIT"
+    },
+    "node_modules/http-proxy": {
+      "version": "1.18.1",
+      "resolved": "https://registry.npmmirror.com/http-proxy/-/http-proxy-1.18.1.tgz",
+      "integrity": "sha512-7mz/721AbnJwIVbnaSv1Cz3Am0ZLT/UBwkC92VlxhXv/k/BBQfM2fXElQNC27BVGr0uwUpplYPQM9LnaBMR5NQ==",
+      "license": "MIT",
+      "dependencies": {
+        "eventemitter3": "^4.0.0",
+        "follow-redirects": "^1.0.0",
+        "requires-port": "^1.0.0"
+      },
+      "engines": {
+        "node": ">=8.0.0"
+      }
+    },
+    "node_modules/http-proxy-middleware": {
+      "version": "2.0.7",
+      "resolved": "https://registry.npmmirror.com/http-proxy-middleware/-/http-proxy-middleware-2.0.7.tgz",
+      "integrity": "sha512-fgVY8AV7qU7z/MmXJ/rxwbrtQH4jBQ9m7kp3llF0liB7glmFeVZFBepQb32T3y8n8k2+AEYuMPCpinYW+/CuRA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/http-proxy": "^1.17.8",
+        "http-proxy": "^1.18.1",
+        "is-glob": "^4.0.1",
+        "is-plain-obj": "^3.0.0",
+        "micromatch": "^4.0.2"
+      },
+      "engines": {
+        "node": ">=12.0.0"
+      },
+      "peerDependencies": {
+        "@types/express": "^4.17.13"
+      },
+      "peerDependenciesMeta": {
+        "@types/express": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/http-proxy-middleware/node_modules/is-plain-obj": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/is-plain-obj/-/is-plain-obj-3.0.0.tgz",
+      "integrity": "sha512-gwsOE28k+23GP1B6vFl1oVh/WOzmawBrKwo5Ev6wMKzPkaXaCDIQKzLnvsA42DRlbVTWorkgTKIviAKCWkfUwA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/http2-wrapper": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmmirror.com/http2-wrapper/-/http2-wrapper-2.2.1.tgz",
+      "integrity": "sha512-V5nVw1PAOgfI3Lmeaj2Exmeg7fenjhRUgz1lPSezy1CuhPYbgQtbQj4jZfEAEMlaL+vupsvhjqCyjzob0yxsmQ==",
+      "license": "MIT",
+      "dependencies": {
+        "quick-lru": "^5.1.1",
+        "resolve-alpn": "^1.2.0"
+      },
+      "engines": {
+        "node": ">=10.19.0"
+      }
+    },
+    "node_modules/human-signals": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/human-signals/-/human-signals-2.1.0.tgz",
+      "integrity": "sha512-B4FFZ6q/T2jhhksgkbEW3HBvWIfDW85snkQgawt07S7J5QXTk6BkNV+0yAeZrM5QpMAdYlocGoljn0sJ/WQkFw==",
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=10.17.0"
+      }
+    },
+    "node_modules/iconv-lite": {
+      "version": "0.4.24",
+      "resolved": "https://registry.npmmirror.com/iconv-lite/-/iconv-lite-0.4.24.tgz",
+      "integrity": "sha512-v3MXnZAcvnywkTUEZomIActle7RXXeedOR31wwl7VlyoXO4Qi9arvSenNQWne1TcRwhCL1HwLI21bEqdpj8/rA==",
+      "license": "MIT",
+      "dependencies": {
+        "safer-buffer": ">= 2.1.2 < 3"
+      },
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/icss-utils": {
+      "version": "5.1.0",
+      "resolved": "https://registry.npmmirror.com/icss-utils/-/icss-utils-5.1.0.tgz",
+      "integrity": "sha512-soFhflCVWLfRNOPU3iv5Z9VUdT44xFRbzjLsEzSr5AQmgqPMTHdU3PMT1Cf1ssx8fLNJDA1juftYl+PUcv3MqA==",
+      "license": "ISC",
+      "engines": {
+        "node": "^10 || ^12 || >= 14"
+      },
+      "peerDependencies": {
+        "postcss": "^8.1.0"
+      }
+    },
+    "node_modules/ignore": {
+      "version": "5.3.2",
+      "resolved": "https://registry.npmmirror.com/ignore/-/ignore-5.3.2.tgz",
+      "integrity": "sha512-hsBTNUqQTDwkWtcdYI2i06Y/nUBEsNEDJKjWdigLvegy8kDuJAS8uRlpkkcQpyEXL0Z/pjDy5HBmMjRCJ2gq+g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 4"
+      }
+    },
+    "node_modules/image-size": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmmirror.com/image-size/-/image-size-1.1.1.tgz",
+      "integrity": "sha512-541xKlUw6jr/6gGuk92F+mYM5zaFAc5ahphvkqvNe2bQ6gVBkd6bfrmVJ2t4KDAfikAYZyIqTnktX3i6/aQDrQ==",
+      "license": "MIT",
+      "dependencies": {
+        "queue": "6.0.2"
+      },
+      "bin": {
+        "image-size": "bin/image-size.js"
+      },
+      "engines": {
+        "node": ">=16.x"
+      }
+    },
+    "node_modules/immer": {
+      "version": "9.0.21",
+      "resolved": "https://registry.npmmirror.com/immer/-/immer-9.0.21.tgz",
+      "integrity": "sha512-bc4NBHqOqSfRW7POMkHd51LvClaeMXpm8dx0e8oE2GORbq5aRK7Bxl4FyzVLdGtLmvLKL7BTDBG5ACQm4HWjTA==",
+      "license": "MIT",
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/immer"
+      }
+    },
+    "node_modules/import-fresh": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmmirror.com/import-fresh/-/import-fresh-3.3.0.tgz",
+      "integrity": "sha512-veYYhQa+D1QBKznvhUHxb8faxlrwUnxseDAbAp457E0wLNio2bOSKnjYDhMj+YiAq61xrMGhQk9iXVk5FzgQMw==",
+      "license": "MIT",
+      "dependencies": {
+        "parent-module": "^1.0.0",
+        "resolve-from": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/import-lazy": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/import-lazy/-/import-lazy-4.0.0.tgz",
+      "integrity": "sha512-rKtvo6a868b5Hu3heneU+L4yEQ4jYKLtjpnPeUdK7h0yzXGmyBTypknlkCvHFBqfX9YlorEiMM6Dnq/5atfHkw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/imurmurhash": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmmirror.com/imurmurhash/-/imurmurhash-0.1.4.tgz",
+      "integrity": "sha512-JmXMZ6wuvDmLiHEml9ykzqO6lwFbof0GG4IkcGaENdCRDDmMVnny7s5HsIgHCbaq0w2MyPhDqkhTUgS2LU2PHA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.8.19"
+      }
+    },
+    "node_modules/indent-string": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/indent-string/-/indent-string-4.0.0.tgz",
+      "integrity": "sha512-EdDDZu4A2OyIK7Lr/2zG+w5jmbuk1DVBnEwREQvBzspBJkCEbRa8GxU1lghYcaGJCnRWibjDXlq779X1/y5xwg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/infima": {
+      "version": "0.2.0-alpha.44",
+      "resolved": "https://registry.npmmirror.com/infima/-/infima-0.2.0-alpha.44.tgz",
+      "integrity": "sha512-tuRkUSO/lB3rEhLJk25atwAjgLuzq070+pOW8XcvpHky/YbENnRRdPd85IBkyeTgttmOy5ah+yHYsK1HhUd4lQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/inflight": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmmirror.com/inflight/-/inflight-1.0.6.tgz",
+      "integrity": "sha512-k92I/b08q4wvFscXCLvqfsHCrjrF7yiXsQuIVvVE7N82W3+aqpzuUdBbfhWcy/FZR3/4IgflMgKLOsvPDrGCJA==",
+      "deprecated": "This module is not supported, and leaks memory. Do not use it. Check out lru-cache if you want a good and tested way to coalesce async requests by a key value, which is much more comprehensive and powerful.",
+      "license": "ISC",
+      "dependencies": {
+        "once": "^1.3.0",
+        "wrappy": "1"
+      }
+    },
+    "node_modules/inherits": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmmirror.com/inherits/-/inherits-2.0.4.tgz",
+      "integrity": "sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ==",
+      "license": "ISC"
+    },
+    "node_modules/ini": {
+      "version": "1.3.8",
+      "resolved": "https://registry.npmmirror.com/ini/-/ini-1.3.8.tgz",
+      "integrity": "sha512-JV/yugV2uzW5iMRSiZAyDtQd+nxtUnjeLt0acNdw98kKLrvuRVyB80tsREOE7yvGVgalhZ6RNXCmEHkUKBKxew==",
+      "license": "ISC"
+    },
+    "node_modules/inline-style-parser": {
+      "version": "0.1.1",
+      "resolved": "https://registry.npmmirror.com/inline-style-parser/-/inline-style-parser-0.1.1.tgz",
+      "integrity": "sha512-7NXolsK4CAS5+xvdj5OMMbI962hU/wvwoxk+LWR9Ek9bVtyuuYScDN6eS0rUm6TxApFpw7CX1o4uJzcd4AyD3Q==",
+      "license": "MIT"
+    },
+    "node_modules/interpret": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmmirror.com/interpret/-/interpret-1.4.0.tgz",
+      "integrity": "sha512-agE4QfB2Lkp9uICn7BAqoscw4SZP9kTE2hxiFI3jBPmXJfdqiahTbUuKGsMoN2GtqL9AxhYioAcVvgsb1HvRbA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.10"
+      }
+    },
+    "node_modules/invariant": {
+      "version": "2.2.4",
+      "resolved": "https://registry.npmmirror.com/invariant/-/invariant-2.2.4.tgz",
+      "integrity": "sha512-phJfQVBuaJM5raOpJjSfkiD6BpbCE4Ns//LaXl6wGYtUBY83nWS6Rf9tXm2e8VaK60JEjYldbPif/A2B1C2gNA==",
+      "license": "MIT",
+      "dependencies": {
+        "loose-envify": "^1.0.0"
+      }
+    },
+    "node_modules/ipaddr.js": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/ipaddr.js/-/ipaddr.js-2.2.0.tgz",
+      "integrity": "sha512-Ag3wB2o37wslZS19hZqorUnrnzSkpOVy+IiiDEiTqNubEYpYuHWIf6K4psgN2ZWKExS4xhVCrRVfb/wfW8fWJA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 10"
+      }
+    },
+    "node_modules/is-alphabetical": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/is-alphabetical/-/is-alphabetical-2.0.1.tgz",
+      "integrity": "sha512-FWyyY60MeTNyeSRpkM2Iry0G9hpr7/9kD40mD/cGQEuilcZYS4okz8SN2Q6rLCJ8gbCt6fN+rC+6tMGS99LaxQ==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/is-alphanumerical": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/is-alphanumerical/-/is-alphanumerical-2.0.1.tgz",
+      "integrity": "sha512-hmbYhX/9MUMF5uh7tOXyK/n0ZvWpad5caBA17GsC6vyuCqaWliRG5K1qS9inmUhEMaOBIW7/whAnSwveW/LtZw==",
+      "license": "MIT",
+      "dependencies": {
+        "is-alphabetical": "^2.0.0",
+        "is-decimal": "^2.0.0"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/is-arrayish": {
+      "version": "0.2.1",
+      "resolved": "https://registry.npmmirror.com/is-arrayish/-/is-arrayish-0.2.1.tgz",
+      "integrity": "sha512-zz06S8t0ozoDXMG+ube26zeCTNXcKIPJZJi8hBrF4idCLms4CG9QtK7qBl1boi5ODzFpjswb5JPmHCbMpjaYzg==",
+      "license": "MIT"
+    },
+    "node_modules/is-binary-path": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/is-binary-path/-/is-binary-path-2.1.0.tgz",
+      "integrity": "sha512-ZMERYes6pDydyuGidse7OsHxtbI7WVeUEozgR/g7rd0xUimYNlvZRE/K2MgZTjWy725IfelLeVcEM97mmtRGXw==",
+      "license": "MIT",
+      "dependencies": {
+        "binary-extensions": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/is-ci": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/is-ci/-/is-ci-3.0.1.tgz",
+      "integrity": "sha512-ZYvCgrefwqoQ6yTyYUbQu64HsITZ3NfKX1lzaEYdkTDcfKzzCI/wthRRYKkdjHKFVgNiXKAKm65Zo1pk2as/QQ==",
+      "license": "MIT",
+      "dependencies": {
+        "ci-info": "^3.2.0"
+      },
+      "bin": {
+        "is-ci": "bin.js"
+      }
+    },
+    "node_modules/is-core-module": {
+      "version": "2.15.1",
+      "resolved": "https://registry.npmmirror.com/is-core-module/-/is-core-module-2.15.1.tgz",
+      "integrity": "sha512-z0vtXSwucUJtANQWldhbtbt7BnL0vxiFjIdDLAatwhDYty2bad6s+rijD6Ri4YuYJubLzIJLUidCh09e1djEVQ==",
+      "license": "MIT",
+      "dependencies": {
+        "hasown": "^2.0.2"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/is-decimal": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/is-decimal/-/is-decimal-2.0.1.tgz",
+      "integrity": "sha512-AAB9hiomQs5DXWcRB1rqsxGUstbRroFOPPVAomNk/3XHR5JyEZChOyTWe2oayKnsSsr/kcGqF+z6yuH6HHpN0A==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/is-docker": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmmirror.com/is-docker/-/is-docker-2.2.1.tgz",
+      "integrity": "sha512-F+i2BKsFrH66iaUFc0woD8sLy8getkwTwtOBjvs56Cx4CgJDeKQeqfz8wAYiSb8JOprWhHH5p77PbmYCvvUuXQ==",
+      "license": "MIT",
+      "bin": {
+        "is-docker": "cli.js"
+      },
+      "engines": {
+        "node": ">=8"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/is-extendable": {
+      "version": "0.1.1",
+      "resolved": "https://registry.npmmirror.com/is-extendable/-/is-extendable-0.1.1.tgz",
+      "integrity": "sha512-5BMULNob1vgFX6EjQw5izWDxrecWK9AM72rugNr0TFldMOi0fj6Jk+zeKIt0xGj4cEfQIJth4w3OKWOJ4f+AFw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/is-extglob": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmmirror.com/is-extglob/-/is-extglob-2.1.1.tgz",
+      "integrity": "sha512-SbKbANkN603Vi4jEZv49LeVJMn4yGwsbzZworEoyEiutsN3nJYdbO36zfhGJ6QEDpOZIFkDtnq5JRxmvl3jsoQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/is-fullwidth-code-point": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/is-fullwidth-code-point/-/is-fullwidth-code-point-3.0.0.tgz",
+      "integrity": "sha512-zymm5+u+sCsSWyD9qNaejV3DFvhCKclKdizYaJUuHA83RLjb7nSuGnddCHGv0hk+KY7BMAlsWeK4Ueg6EV6XQg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/is-glob": {
+      "version": "4.0.3",
+      "resolved": "https://registry.npmmirror.com/is-glob/-/is-glob-4.0.3.tgz",
+      "integrity": "sha512-xelSayHH36ZgE7ZWhli7pW34hNbNl8Ojv5KVmkJD4hBdD3th8Tfk9vYasLM+mXWOZhFkgZfxhLSnrwRr4elSSg==",
+      "license": "MIT",
+      "dependencies": {
+        "is-extglob": "^2.1.1"
+      },
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/is-hexadecimal": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/is-hexadecimal/-/is-hexadecimal-2.0.1.tgz",
+      "integrity": "sha512-DgZQp241c8oO6cA1SbTEWiXeoxV42vlcJxgH+B3hi1AiqqKruZR3ZGF8In3fj4+/y/7rHvlOZLZtgJ/4ttYGZg==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/is-installed-globally": {
+      "version": "0.4.0",
+      "resolved": "https://registry.npmmirror.com/is-installed-globally/-/is-installed-globally-0.4.0.tgz",
+      "integrity": "sha512-iwGqO3J21aaSkC7jWnHP/difazwS7SFeIqxv6wEtLU8Y5KlzFTjyqcSIT0d8s4+dDhKytsk9PJZ2BkS5eZwQRQ==",
+      "license": "MIT",
+      "dependencies": {
+        "global-dirs": "^3.0.0",
+        "is-path-inside": "^3.0.2"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/is-npm": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmmirror.com/is-npm/-/is-npm-6.0.0.tgz",
+      "integrity": "sha512-JEjxbSmtPSt1c8XTkVrlujcXdKV1/tvuQ7GwKcAlyiVLeYFQ2VHat8xfrDJsIkhCdF/tZ7CiIR3sy141c6+gPQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/is-number": {
+      "version": "7.0.0",
+      "resolved": "https://registry.npmmirror.com/is-number/-/is-number-7.0.0.tgz",
+      "integrity": "sha512-41Cifkg6e8TylSpdtTpeLVMqvSBEVzTttHvERD741+pnZ8ANv0004MRL43QKPDlK9cGvNp6NZWZUBlbGXYxxng==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.12.0"
+      }
+    },
+    "node_modules/is-obj": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmmirror.com/is-obj/-/is-obj-1.0.1.tgz",
+      "integrity": "sha512-l4RyHgRqGN4Y3+9JHVrNqO+tN0rV5My76uW5/nuO4K1b6vw5G8d/cmFjP9tRfEsdhZNt0IFdZuK/c2Vr4Nb+Qg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/is-path-cwd": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/is-path-cwd/-/is-path-cwd-2.2.0.tgz",
+      "integrity": "sha512-w942bTcih8fdJPJmQHFzkS76NEP8Kzzvmw92cXsazb8intwLqPibPPdXf4ANdKV3rYMuuQYGIWtvz9JilB3NFQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/is-path-inside": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmmirror.com/is-path-inside/-/is-path-inside-3.0.3.tgz",
+      "integrity": "sha512-Fd4gABb+ycGAmKou8eMftCupSir5lRxqf4aD/vd0cD2qc4HL07OjCeuHMr8Ro4CoMaeCKDB0/ECBOVWjTwUvPQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/is-plain-obj": {
+      "version": "4.1.0",
+      "resolved": "https://registry.npmmirror.com/is-plain-obj/-/is-plain-obj-4.1.0.tgz",
+      "integrity": "sha512-+Pgi+vMuUNkJyExiMBt5IlFoMyKnr5zhJ4Uspz58WOhBF5QoIZkFyNHIbBAtHwzVAgk5RtndVNsDRN61/mmDqg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/is-plain-object": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmmirror.com/is-plain-object/-/is-plain-object-2.0.4.tgz",
+      "integrity": "sha512-h5PpgXkWitc38BBMYawTYMWJHFZJVnBquFE57xFpjB8pJFiF6gZ+bU+WyI/yqXiFR5mdLsgYNaPe8uao6Uv9Og==",
+      "license": "MIT",
+      "dependencies": {
+        "isobject": "^3.0.1"
+      },
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/is-reference": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmmirror.com/is-reference/-/is-reference-3.0.2.tgz",
+      "integrity": "sha512-v3rht/LgVcsdZa3O2Nqs+NMowLOxeOm7Ay9+/ARQ2F+qEoANRcqrjAZKGN0v8ymUetZGgkp26LTnGT7H0Qo9Pg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "*"
+      }
+    },
+    "node_modules/is-regexp": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/is-regexp/-/is-regexp-1.0.0.tgz",
+      "integrity": "sha512-7zjFAPO4/gwyQAAgRRmqeEeyIICSdmCqa3tsVHMdBzaXXRiqopZL4Cyghg/XulGWrtABTpbnYYzzIRffLkP4oA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/is-root": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/is-root/-/is-root-2.1.0.tgz",
+      "integrity": "sha512-AGOriNp96vNBd3HtU+RzFEc75FfR5ymiYv8E553I71SCeXBiMsVDUtdio1OEFvrPyLIQ9tVR5RxXIFe5PUFjMg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/is-stream": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/is-stream/-/is-stream-2.0.1.tgz",
+      "integrity": "sha512-hFoiJiTl63nn+kstHGBtewWSKnQLpyb155KHheA1l39uvtO9nWIop1p3udqPcUd/xbF1VLMO4n7OI6p7RbngDg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/is-typedarray": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/is-typedarray/-/is-typedarray-1.0.0.tgz",
+      "integrity": "sha512-cyA56iCMHAh5CdzjJIa4aohJyeO1YbwLi3Jc35MmRU6poroFjIGZzUzupGiRPOjgHg9TLu43xbpwXk523fMxKA==",
+      "license": "MIT"
+    },
+    "node_modules/is-wsl": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/is-wsl/-/is-wsl-2.2.0.tgz",
+      "integrity": "sha512-fKzAra0rGJUUBwGBgNkHZuToZcn+TtXHpeCgmkMJMMYx1sQDYaCSyjJBSCa2nH1DGm7s3n1oBnohoVTBaN7Lww==",
+      "license": "MIT",
+      "dependencies": {
+        "is-docker": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/is-yarn-global": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmmirror.com/is-yarn-global/-/is-yarn-global-0.4.1.tgz",
+      "integrity": "sha512-/kppl+R+LO5VmhYSEWARUFjodS25D68gvj8W7z0I7OWhUla5xWu8KL6CtB2V0R6yqhnRgbcaREMr4EEM6htLPQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/isarray": {
+      "version": "0.0.1",
+      "resolved": "https://registry.npmmirror.com/isarray/-/isarray-0.0.1.tgz",
+      "integrity": "sha512-D2S+3GLxWH+uhrNEcoh/fnmYeP8E8/zHl644d/jdA0g2uyXvy3sb0qxotE+ne0LtccHknQzWwZEzhak7oJ0COQ==",
+      "license": "MIT"
+    },
+    "node_modules/isexe": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/isexe/-/isexe-2.0.0.tgz",
+      "integrity": "sha512-RHxMLp9lnKHGHRng9QFhRCMbYAcVpn69smSGcq3f36xjgVVWThj4qqLbTLlq7Ssj8B+fIQ1EuCEGI2lKsyQeIw==",
+      "license": "ISC"
+    },
+    "node_modules/isobject": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/isobject/-/isobject-3.0.1.tgz",
+      "integrity": "sha512-WhB9zCku7EGTj/HQQRz5aUQEUeoQZH2bWcltRErOpymJ4boYE6wL9Tbr23krRPSZ+C5zqNSrSw+Cc7sZZ4b7vg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/jest-util": {
+      "version": "29.7.0",
+      "resolved": "https://registry.npmmirror.com/jest-util/-/jest-util-29.7.0.tgz",
+      "integrity": "sha512-z6EbKajIpqGKU56y5KBUgy1dt1ihhQJgWzUlZHArA/+X2ad7Cb5iF+AK1EWVL/Bo7Rz9uurpqw6SiBCefUbCGA==",
+      "license": "MIT",
+      "dependencies": {
+        "@jest/types": "^29.6.3",
+        "@types/node": "*",
+        "chalk": "^4.0.0",
+        "ci-info": "^3.2.0",
+        "graceful-fs": "^4.2.9",
+        "picomatch": "^2.2.3"
+      },
+      "engines": {
+        "node": "^14.15.0 || ^16.10.0 || >=18.0.0"
+      }
+    },
+    "node_modules/jest-worker": {
+      "version": "29.7.0",
+      "resolved": "https://registry.npmmirror.com/jest-worker/-/jest-worker-29.7.0.tgz",
+      "integrity": "sha512-eIz2msL/EzL9UFTFFx7jBTkeZfku0yUAyZZZmJ93H2TYEiroIx2PQjEXcwYtYl8zXCxb+PAmA2hLIt/6ZEkPHw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*",
+        "jest-util": "^29.7.0",
+        "merge-stream": "^2.0.0",
+        "supports-color": "^8.0.0"
+      },
+      "engines": {
+        "node": "^14.15.0 || ^16.10.0 || >=18.0.0"
+      }
+    },
+    "node_modules/jest-worker/node_modules/supports-color": {
+      "version": "8.1.1",
+      "resolved": "https://registry.npmmirror.com/supports-color/-/supports-color-8.1.1.tgz",
+      "integrity": "sha512-MpUEN2OodtUzxvKQl72cUF7RQ5EiHsGvSsVG0ia9c5RbWGL2CI4C7EpPS8UTBIplnlzZiNuV56w+FuNxy3ty2Q==",
+      "license": "MIT",
+      "dependencies": {
+        "has-flag": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/supports-color?sponsor=1"
+      }
+    },
+    "node_modules/jiti": {
+      "version": "1.21.6",
+      "resolved": "https://registry.npmmirror.com/jiti/-/jiti-1.21.6.tgz",
+      "integrity": "sha512-2yTgeWTWzMWkHu6Jp9NKgePDaYHbntiwvYuuJLbbN9vl7DC9DvXKOB2BC3ZZ92D3cvV/aflH0osDfwpHepQ53w==",
+      "license": "MIT",
+      "bin": {
+        "jiti": "bin/jiti.js"
+      }
+    },
+    "node_modules/joi": {
+      "version": "17.13.3",
+      "resolved": "https://registry.npmmirror.com/joi/-/joi-17.13.3.tgz",
+      "integrity": "sha512-otDA4ldcIx+ZXsKHWmp0YizCweVRZG96J10b0FevjfuncLO1oX59THoAmHkNubYJ+9gWsYsp5k8v4ib6oDv1fA==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^9.3.0",
+        "@hapi/topo": "^5.1.0",
+        "@sideway/address": "^4.1.5",
+        "@sideway/formula": "^3.0.1",
+        "@sideway/pinpoint": "^2.0.0"
+      }
+    },
+    "node_modules/js-tokens": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/js-tokens/-/js-tokens-4.0.0.tgz",
+      "integrity": "sha512-RdJUflcE3cUzKiMqQgsCu06FPu9UdIJO0beYbPhHN4k6apgJtifcoCtT9bcxOpYBtpD2kCM6Sbzg4CausW/PKQ==",
+      "license": "MIT"
+    },
+    "node_modules/js-yaml": {
+      "version": "4.1.0",
+      "resolved": "https://registry.npmmirror.com/js-yaml/-/js-yaml-4.1.0.tgz",
+      "integrity": "sha512-wpxZs9NoxZaJESJGIZTyDEaYpl0FKSA+FB9aJiyemKhMwkxQg63h4T1KJgUGHpTqPDNRcmmYLugrRjJlBtWvRA==",
+      "license": "MIT",
+      "dependencies": {
+        "argparse": "^2.0.1"
+      },
+      "bin": {
+        "js-yaml": "bin/js-yaml.js"
+      }
+    },
+    "node_modules/jsesc": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmmirror.com/jsesc/-/jsesc-3.0.2.tgz",
+      "integrity": "sha512-xKqzzWXDttJuOcawBt4KnKHHIf5oQ/Cxax+0PWFG+DFDgHNAdi+TXECADI+RYiFUMmx8792xsMbbgXj4CwnP4g==",
+      "license": "MIT",
+      "bin": {
+        "jsesc": "bin/jsesc"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/json-buffer": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/json-buffer/-/json-buffer-3.0.1.tgz",
+      "integrity": "sha512-4bV5BfR2mqfQTJm+V5tPPdf+ZpuhiIvTuAB5g8kcrXOZpTT/QwwVRWBywX1ozr6lEuPdbHxwaJlm9G6mI2sfSQ==",
+      "license": "MIT"
+    },
+    "node_modules/json-parse-even-better-errors": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmmirror.com/json-parse-even-better-errors/-/json-parse-even-better-errors-2.3.1.tgz",
+      "integrity": "sha512-xyFwyhro/JEof6Ghe2iz2NcXoj2sloNsWr/XsERDK/oiPCfaNhl5ONfp+jQdAZRQQ0IJWNzH9zIZF7li91kh2w==",
+      "license": "MIT"
+    },
+    "node_modules/json-schema-traverse": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/json-schema-traverse/-/json-schema-traverse-1.0.0.tgz",
+      "integrity": "sha512-NM8/P9n3XjXhIZn1lLhkFaACTOURQXjWhV4BA/RnOv8xvgqtqpAX9IO4mRQxSx1Rlo4tqzeqb0sOlruaOy3dug==",
+      "license": "MIT"
+    },
+    "node_modules/json2mq": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmmirror.com/json2mq/-/json2mq-0.2.0.tgz",
+      "integrity": "sha512-SzoRg7ux5DWTII9J2qkrZrqV1gt+rTaoufMxEzXbS26Uid0NwaJd123HcoB80TgubEppxxIGdNxCx50fEoEWQA==",
+      "license": "MIT",
+      "dependencies": {
+        "string-convert": "^0.2.0"
+      }
+    },
+    "node_modules/json5": {
+      "version": "2.2.3",
+      "resolved": "https://registry.npmmirror.com/json5/-/json5-2.2.3.tgz",
+      "integrity": "sha512-XmOWe7eyHYH14cLdVPoyg+GOH3rYX++KpzrylJwSW98t3Nk+U8XOl8FWKOgwtzdb8lXGf6zYwDUzeHMWfxasyg==",
+      "license": "MIT",
+      "bin": {
+        "json5": "lib/cli.js"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/jsonfile": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/jsonfile/-/jsonfile-6.1.0.tgz",
+      "integrity": "sha512-5dgndWOriYSm5cnYaJNhalLNDKOqFwyDB/rr1E9ZsGciGvKPs8R2xYGCacuf3z6K1YKDz182fd+fY3cn3pMqXQ==",
+      "license": "MIT",
+      "dependencies": {
+        "universalify": "^2.0.0"
+      },
+      "optionalDependencies": {
+        "graceful-fs": "^4.1.6"
+      }
+    },
+    "node_modules/keyv": {
+      "version": "4.5.4",
+      "resolved": "https://registry.npmmirror.com/keyv/-/keyv-4.5.4.tgz",
+      "integrity": "sha512-oxVHkHR/EJf2CNXnWxRLW6mg7JyCCUcG0DtEGmL2ctUo1PNTin1PUil+r/+4r5MpVgC/fn1kjsx7mjSujKqIpw==",
+      "license": "MIT",
+      "dependencies": {
+        "json-buffer": "3.0.1"
+      }
+    },
+    "node_modules/kind-of": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmmirror.com/kind-of/-/kind-of-6.0.3.tgz",
+      "integrity": "sha512-dcS1ul+9tmeD95T+x28/ehLgd9mENa3LsvDTtzm3vyBEO7RPptvAD+t44WVXaUjTBRcrpFeFlC8WCruUR456hw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/kleur": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmmirror.com/kleur/-/kleur-3.0.3.tgz",
+      "integrity": "sha512-eTIzlVOSUR+JxdDFepEYcBMtZ9Qqdef+rnzWdRZuMbOywu5tO2w2N7rqjoANZ5k9vywhL6Br1VRjUIgTQx4E8w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/latest-version": {
+      "version": "7.0.0",
+      "resolved": "https://registry.npmmirror.com/latest-version/-/latest-version-7.0.0.tgz",
+      "integrity": "sha512-KvNT4XqAMzdcL6ka6Tl3i2lYeFDgXNCuIX+xNx6ZMVR1dFq+idXd9FLKNMOIx0t9mJ9/HudyX4oZWXZQ0UJHeg==",
+      "license": "MIT",
+      "dependencies": {
+        "package-json": "^8.1.0"
+      },
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/launch-editor": {
+      "version": "2.9.1",
+      "resolved": "https://registry.npmmirror.com/launch-editor/-/launch-editor-2.9.1.tgz",
+      "integrity": "sha512-Gcnl4Bd+hRO9P9icCP/RVVT2o8SFlPXofuCxvA2SaZuH45whSvf5p8x5oih5ftLiVhEI4sp5xDY+R+b3zJBh5w==",
+      "license": "MIT",
+      "dependencies": {
+        "picocolors": "^1.0.0",
+        "shell-quote": "^1.8.1"
+      }
+    },
+    "node_modules/leven": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/leven/-/leven-3.1.0.tgz",
+      "integrity": "sha512-qsda+H8jTaUaN/x5vzW2rzc+8Rw4TAQ/4KjB46IwK5VH+IlVeeeje/EoZRpiXvIqjFgK84QffqPztGI3VBLG1A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/lilconfig": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmmirror.com/lilconfig/-/lilconfig-3.1.2.tgz",
+      "integrity": "sha512-eop+wDAvpItUys0FWkHIKeC9ybYrTGbU41U5K7+bttZZeohvnY7M9dZ5kB21GNWiFT2q1OoPTvncPCgSOVO5ow==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/antonk52"
+      }
+    },
+    "node_modules/lines-and-columns": {
+      "version": "1.2.4",
+      "resolved": "https://registry.npmmirror.com/lines-and-columns/-/lines-and-columns-1.2.4.tgz",
+      "integrity": "sha512-7ylylesZQ/PV29jhEDl3Ufjo6ZX7gCqJr5F7PKrqc93v7fzSymt1BpwEU8nAUXs8qzzvqhbjhK5QZg6Mt/HkBg==",
+      "license": "MIT"
+    },
+    "node_modules/loader-runner": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmmirror.com/loader-runner/-/loader-runner-4.3.0.tgz",
+      "integrity": "sha512-3R/1M+yS3j5ou80Me59j7F9IMs4PXs3VqRrm0TU3AbKPxlmpoY1TNscJV/oGJXo8qCatFGTfDbY6W6ipGOYXfg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.11.5"
+      }
+    },
+    "node_modules/loader-utils": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmmirror.com/loader-utils/-/loader-utils-2.0.4.tgz",
+      "integrity": "sha512-xXqpXoINfFhgua9xiqD8fPFHgkoq1mmmpE92WlDbm9rNRd/EbRb+Gqf908T2DMfuHjjJlksiK2RbHVOdD/MqSw==",
+      "license": "MIT",
+      "dependencies": {
+        "big.js": "^5.2.2",
+        "emojis-list": "^3.0.0",
+        "json5": "^2.1.2"
+      },
+      "engines": {
+        "node": ">=8.9.0"
+      }
+    },
+    "node_modules/locate-path": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmmirror.com/locate-path/-/locate-path-7.2.0.tgz",
+      "integrity": "sha512-gvVijfZvn7R+2qyPX8mAuKcFGDf6Nc61GdvGafQsHL0sBIxfKzA+usWn4GFC/bk+QdwPUD4kWFJLhElipq+0VA==",
+      "license": "MIT",
+      "dependencies": {
+        "p-locate": "^6.0.0"
+      },
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/lodash": {
+      "version": "4.17.21",
+      "resolved": "https://registry.npmmirror.com/lodash/-/lodash-4.17.21.tgz",
+      "integrity": "sha512-v2kDEe57lecTulaDIuNTPy3Ry4gLGJ6Z1O3vE1krgXZNrsQ+LFTGHVxVjcXPs17LhbZVGedAJv8XZ1tvj5FvSg==",
+      "license": "MIT"
+    },
+    "node_modules/lodash.debounce": {
+      "version": "4.0.8",
+      "resolved": "https://registry.npmmirror.com/lodash.debounce/-/lodash.debounce-4.0.8.tgz",
+      "integrity": "sha512-FT1yDzDYEoYWhnSGnpE/4Kj1fLZkDFyqRb7fNt6FdYOSxlUWAtp42Eh6Wb0rGIv/m9Bgo7x4GhQbm5Ys4SG5ow==",
+      "license": "MIT"
+    },
+    "node_modules/lodash.memoize": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmmirror.com/lodash.memoize/-/lodash.memoize-4.1.2.tgz",
+      "integrity": "sha512-t7j+NzmgnQzTAYXcsHYLgimltOV1MXHtlOWf6GjL9Kj8GK5FInw5JotxvbOs+IvV1/Dzo04/fCGfLVs7aXb4Ag==",
+      "license": "MIT"
+    },
+    "node_modules/lodash.uniq": {
+      "version": "4.5.0",
+      "resolved": "https://registry.npmmirror.com/lodash.uniq/-/lodash.uniq-4.5.0.tgz",
+      "integrity": "sha512-xfBaXQd9ryd9dlSDvnvI0lvxfLJlYAZzXomUYzLKtUeOQvOP5piqAWuGtrhWeqaXK9hhoM/iyJc5AV+XfsX3HQ==",
+      "license": "MIT"
+    },
+    "node_modules/longest-streak": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/longest-streak/-/longest-streak-3.1.0.tgz",
+      "integrity": "sha512-9Ri+o0JYgehTaVBBDoMqIl8GXtbWg711O3srftcHhZ0dqnETqLaoIK0x17fUw9rFSlK/0NlsKe0Ahhyl5pXE2g==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/loose-envify": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmmirror.com/loose-envify/-/loose-envify-1.4.0.tgz",
+      "integrity": "sha512-lyuxPGr/Wfhrlem2CL/UcnUc1zcqKAImBDzukY7Y5F/yQiNdko6+fRLevlw1HgMySw7f611UIY408EtxRSoK3Q==",
+      "license": "MIT",
+      "dependencies": {
+        "js-tokens": "^3.0.0 || ^4.0.0"
+      },
+      "bin": {
+        "loose-envify": "cli.js"
+      }
+    },
+    "node_modules/lower-case": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/lower-case/-/lower-case-2.0.2.tgz",
+      "integrity": "sha512-7fm3l3NAF9WfN6W3JOmf5drwpVqX78JtoGJ3A6W0a6ZnldM41w2fV5D490psKFTpMds8TJse/eHLFFsNHHjHgg==",
+      "license": "MIT",
+      "dependencies": {
+        "tslib": "^2.0.3"
+      }
+    },
+    "node_modules/lowercase-keys": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/lowercase-keys/-/lowercase-keys-3.0.0.tgz",
+      "integrity": "sha512-ozCC6gdQ+glXOQsveKD0YsDy8DSQFjDTz4zyzEHNV5+JP5D62LmfDZ6o1cycFx9ouG940M5dE8C8CTewdj2YWQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/lru-cache": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmmirror.com/lru-cache/-/lru-cache-5.1.1.tgz",
+      "integrity": "sha512-KpNARQA3Iwv+jTA0utUVVbrh+Jlrr1Fv0e56GGzAFOXN7dk/FviaDW8LHmK52DlcH4WP2n6gI8vN1aesBFgo9w==",
+      "license": "ISC",
+      "dependencies": {
+        "yallist": "^3.0.2"
+      }
+    },
+    "node_modules/markdown-extensions": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/markdown-extensions/-/markdown-extensions-2.0.0.tgz",
+      "integrity": "sha512-o5vL7aDWatOTX8LzaS1WMoaoxIiLRQJuIKKe2wAw6IeULDHaqbiqiggmx+pKvZDb1Sj+pE46Sn1T7lCqfFtg1Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=16"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/markdown-table": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmmirror.com/markdown-table/-/markdown-table-3.0.3.tgz",
+      "integrity": "sha512-Z1NL3Tb1M9wH4XESsCDEksWoKTdlUafKc4pt0GRwjUyXaCFZ+dc3g2erqB6zm3szA2IUSi7VnPI+o/9jnxh9hw==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/mdast-util-directive": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-directive/-/mdast-util-directive-3.0.0.tgz",
+      "integrity": "sha512-JUpYOqKI4mM3sZcNxmF/ox04XYFFkNwr0CFlrQIkCwbvH0xzMCqkMqAde9wRd80VAhaUrwFwKm2nxretdT1h7Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "@types/unist": "^3.0.0",
+        "devlop": "^1.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0",
+        "parse-entities": "^4.0.0",
+        "stringify-entities": "^4.0.0",
+        "unist-util-visit-parents": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-find-and-replace": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/mdast-util-find-and-replace/-/mdast-util-find-and-replace-3.0.1.tgz",
+      "integrity": "sha512-SG21kZHGC3XRTSUhtofZkBzZTJNM5ecCi0SK2IMKmSXR8vO3peL+kb1O0z7Zl83jKtutG4k5Wv/W7V3/YHvzPA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "escape-string-regexp": "^5.0.0",
+        "unist-util-is": "^6.0.0",
+        "unist-util-visit-parents": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-find-and-replace/node_modules/escape-string-regexp": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmmirror.com/escape-string-regexp/-/escape-string-regexp-5.0.0.tgz",
+      "integrity": "sha512-/veY75JbMK4j1yjvuUxuVsiS/hr/4iHs9FTT6cgTexxdE0Ly/glccBAkloH/DofkjRbZU3bnoj38mOmhkZ0lHw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/mdast-util-from-markdown": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/mdast-util-from-markdown/-/mdast-util-from-markdown-2.0.1.tgz",
+      "integrity": "sha512-aJEUyzZ6TzlsX2s5B4Of7lN7EQtAxvtradMMglCQDyaTFgse6CmtmdJ15ElnVRlCg1vpNyVtbem0PWzlNieZsA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "@types/unist": "^3.0.0",
+        "decode-named-character-reference": "^1.0.0",
+        "devlop": "^1.0.0",
+        "mdast-util-to-string": "^4.0.0",
+        "micromark": "^4.0.0",
+        "micromark-util-decode-numeric-character-reference": "^2.0.0",
+        "micromark-util-decode-string": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0",
+        "unist-util-stringify-position": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-from-markdown/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/mdast-util-frontmatter": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/mdast-util-frontmatter/-/mdast-util-frontmatter-2.0.1.tgz",
+      "integrity": "sha512-LRqI9+wdgC25P0URIJY9vwocIzCcksduHQ9OF2joxQoyTNVduwLAFUzjoopuRJbJAReaKrNQKAZKL3uCMugWJA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "devlop": "^1.0.0",
+        "escape-string-regexp": "^5.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0",
+        "micromark-extension-frontmatter": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-frontmatter/node_modules/escape-string-regexp": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmmirror.com/escape-string-regexp/-/escape-string-regexp-5.0.0.tgz",
+      "integrity": "sha512-/veY75JbMK4j1yjvuUxuVsiS/hr/4iHs9FTT6cgTexxdE0Ly/glccBAkloH/DofkjRbZU3bnoj38mOmhkZ0lHw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/mdast-util-gfm": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-gfm/-/mdast-util-gfm-3.0.0.tgz",
+      "integrity": "sha512-dgQEX5Amaq+DuUqf26jJqSK9qgixgd6rYDHAv4aTBuA92cTknZlKpPfa86Z/s8Dj8xsAQpFfBmPUHWJBWqS4Bw==",
+      "license": "MIT",
+      "dependencies": {
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-gfm-autolink-literal": "^2.0.0",
+        "mdast-util-gfm-footnote": "^2.0.0",
+        "mdast-util-gfm-strikethrough": "^2.0.0",
+        "mdast-util-gfm-table": "^2.0.0",
+        "mdast-util-gfm-task-list-item": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-gfm-autolink-literal": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/mdast-util-gfm-autolink-literal/-/mdast-util-gfm-autolink-literal-2.0.1.tgz",
+      "integrity": "sha512-5HVP2MKaP6L+G6YaxPNjuL0BPrq9orG3TsrZ9YXbA3vDw/ACI4MEsnoDpn6ZNm7GnZgtAcONJyPhOP8tNJQavQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "ccount": "^2.0.0",
+        "devlop": "^1.0.0",
+        "mdast-util-find-and-replace": "^3.0.0",
+        "micromark-util-character": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-gfm-autolink-literal/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/mdast-util-gfm-autolink-literal/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/mdast-util-gfm-footnote": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-gfm-footnote/-/mdast-util-gfm-footnote-2.0.0.tgz",
+      "integrity": "sha512-5jOT2boTSVkMnQ7LTrd6n/18kqwjmuYqo7JUPe+tRCY6O7dAuTFMtTPauYYrMPpox9hlN0uOx/FL8XvEfG9/mQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "devlop": "^1.1.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-gfm-strikethrough": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-gfm-strikethrough/-/mdast-util-gfm-strikethrough-2.0.0.tgz",
+      "integrity": "sha512-mKKb915TF+OC5ptj5bJ7WFRPdYtuHv0yTRxK2tJvi+BDqbkiG7h7u/9SI89nRAYcmap2xHQL9D+QG/6wSrTtXg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-gfm-table": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-gfm-table/-/mdast-util-gfm-table-2.0.0.tgz",
+      "integrity": "sha512-78UEvebzz/rJIxLvE7ZtDd/vIQ0RHv+3Mh5DR96p7cS7HsBhYIICDBCu8csTNWNO6tBWfqXPWekRuj2FNOGOZg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "devlop": "^1.0.0",
+        "markdown-table": "^3.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-gfm-task-list-item": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-gfm-task-list-item/-/mdast-util-gfm-task-list-item-2.0.0.tgz",
+      "integrity": "sha512-IrtvNvjxC1o06taBAVJznEnkiHxLFTzgonUdy8hzFVeDun0uTjxxrRGVaNFqkU1wJR3RBPEfsxmU6jDWPofrTQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "devlop": "^1.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-mdx": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-mdx/-/mdast-util-mdx-3.0.0.tgz",
+      "integrity": "sha512-JfbYLAW7XnYTTbUsmpu0kdBUVe+yKVJZBItEjwyYJiDJuZ9w4eeaqks4HQO+R7objWgS2ymV60GYpI14Ug554w==",
+      "license": "MIT",
+      "dependencies": {
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-mdx-expression": "^2.0.0",
+        "mdast-util-mdx-jsx": "^3.0.0",
+        "mdast-util-mdxjs-esm": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-mdx-expression": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/mdast-util-mdx-expression/-/mdast-util-mdx-expression-2.0.1.tgz",
+      "integrity": "sha512-J6f+9hUp+ldTZqKRSg7Vw5V6MqjATc+3E4gf3CFNcuZNWD8XdyI6zQ8GqH7f8169MM6P7hMBRDVGnn7oHB9kXQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree-jsx": "^1.0.0",
+        "@types/hast": "^3.0.0",
+        "@types/mdast": "^4.0.0",
+        "devlop": "^1.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-mdx-jsx": {
+      "version": "3.1.3",
+      "resolved": "https://registry.npmmirror.com/mdast-util-mdx-jsx/-/mdast-util-mdx-jsx-3.1.3.tgz",
+      "integrity": "sha512-bfOjvNt+1AcbPLTFMFWY149nJz0OjmewJs3LQQ5pIyVGxP4CdOqNVJL6kTaM5c68p8q82Xv3nCyFfUnuEcH3UQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree-jsx": "^1.0.0",
+        "@types/hast": "^3.0.0",
+        "@types/mdast": "^4.0.0",
+        "@types/unist": "^3.0.0",
+        "ccount": "^2.0.0",
+        "devlop": "^1.1.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0",
+        "parse-entities": "^4.0.0",
+        "stringify-entities": "^4.0.0",
+        "unist-util-stringify-position": "^4.0.0",
+        "vfile-message": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-mdxjs-esm": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/mdast-util-mdxjs-esm/-/mdast-util-mdxjs-esm-2.0.1.tgz",
+      "integrity": "sha512-EcmOpxsZ96CvlP03NghtH1EsLtr0n9Tm4lPUJUBccV9RwUOneqSycg19n5HGzCf+10LozMRSObtVr3ee1WoHtg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree-jsx": "^1.0.0",
+        "@types/hast": "^3.0.0",
+        "@types/mdast": "^4.0.0",
+        "devlop": "^1.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-phrasing": {
+      "version": "4.1.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-phrasing/-/mdast-util-phrasing-4.1.0.tgz",
+      "integrity": "sha512-TqICwyvJJpBwvGAMZjj4J2n0X8QWp21b9l0o7eXyVJ25YNWYbJDVIyD1bZXE6WtV6RmKJVYmQAKWa0zWOABz2w==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "unist-util-is": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-to-hast": {
+      "version": "13.2.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-to-hast/-/mdast-util-to-hast-13.2.0.tgz",
+      "integrity": "sha512-QGYKEuUsYT9ykKBCMOEDLsU5JRObWQusAolFMeko/tYPufNkRffBAQjIE+99jbA87xv6FgmjLtwjh9wBWajwAA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/hast": "^3.0.0",
+        "@types/mdast": "^4.0.0",
+        "@ungap/structured-clone": "^1.0.0",
+        "devlop": "^1.0.0",
+        "micromark-util-sanitize-uri": "^2.0.0",
+        "trim-lines": "^3.0.0",
+        "unist-util-position": "^5.0.0",
+        "unist-util-visit": "^5.0.0",
+        "vfile": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-to-markdown": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-to-markdown/-/mdast-util-to-markdown-2.1.0.tgz",
+      "integrity": "sha512-SR2VnIEdVNCJbP6y7kVTJgPLifdr8WEU440fQec7qHoHOUz/oJ2jmNRqdDQ3rbiStOXb2mCDGTuwsK5OPUgYlQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "@types/unist": "^3.0.0",
+        "longest-streak": "^3.0.0",
+        "mdast-util-phrasing": "^4.0.0",
+        "mdast-util-to-string": "^4.0.0",
+        "micromark-util-decode-string": "^2.0.0",
+        "unist-util-visit": "^5.0.0",
+        "zwitch": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-to-string": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/mdast-util-to-string/-/mdast-util-to-string-4.0.0.tgz",
+      "integrity": "sha512-0H44vDimn51F0YwvxSJSm0eCDOJTRlmN0R1yBh4HLj9wiV1Dn0QoXGbvFAWj2hSItVTlCmBF1hqKlIyUBVFLPg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdn-data": {
+      "version": "2.0.30",
+      "resolved": "https://registry.npmmirror.com/mdn-data/-/mdn-data-2.0.30.tgz",
+      "integrity": "sha512-GaqWWShW4kv/G9IEucWScBx9G1/vsFZZJUO+tD26M8J8z3Kw5RDQjaoZe03YAClgeS/SWPOcb4nkFBTEi5DUEA==",
+      "license": "CC0-1.0"
+    },
+    "node_modules/media-typer": {
+      "version": "0.3.0",
+      "resolved": "https://registry.npmmirror.com/media-typer/-/media-typer-0.3.0.tgz",
+      "integrity": "sha512-dq+qelQ9akHpcOl/gUVRTxVIOkAJ1wR3QAvb4RsVjS8oVoFjDGTc679wJYmUmknUF5HwMLOgb5O+a3KxfWapPQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/memfs": {
+      "version": "3.5.3",
+      "resolved": "https://registry.npmmirror.com/memfs/-/memfs-3.5.3.tgz",
+      "integrity": "sha512-UERzLsxzllchadvbPs5aolHh65ISpKpM+ccLbOJ8/vvpBKmAWf+la7dXFy7Mr0ySHbdHrFv5kGFCUHHe6GFEmw==",
+      "license": "Unlicense",
+      "dependencies": {
+        "fs-monkey": "^1.0.4"
+      },
+      "engines": {
+        "node": ">= 4.0.0"
+      }
+    },
+    "node_modules/merge-descriptors": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmmirror.com/merge-descriptors/-/merge-descriptors-1.0.3.tgz",
+      "integrity": "sha512-gaNvAS7TZ897/rVaZ0nMtAyxNyi/pdbjbAwUpFQpN70GqnVfOiXpeUUMKRBmzXaSQ8DdTX4/0ms62r2K+hE6mQ==",
+      "license": "MIT",
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/merge-stream": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/merge-stream/-/merge-stream-2.0.0.tgz",
+      "integrity": "sha512-abv/qOcuPfk3URPfDzmZU1LKmuw8kT+0nIHvKrKgFrwifol/doWcdA4ZqsWQ8ENrFKkd67Mfpo/LovbIUsbt3w==",
+      "license": "MIT"
+    },
+    "node_modules/merge2": {
+      "version": "1.4.1",
+      "resolved": "https://registry.npmmirror.com/merge2/-/merge2-1.4.1.tgz",
+      "integrity": "sha512-8q7VEgMJW4J8tcfVPy8g09NcQwZdbwFEqhe/WZkoIzjn/3TGDwtOCYtXGxA3O8tPzpczCCDgv+P2P5y00ZJOOg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/methods": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmmirror.com/methods/-/methods-1.1.2.tgz",
+      "integrity": "sha512-iclAHeNqNm68zFtnZ0e+1L2yUIdvzNoauKU4WBA3VvH/vPFieF7qfRlwUZU+DA9P9bPXIS90ulxoUoCH23sV2w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/micromark": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark/-/micromark-4.0.0.tgz",
+      "integrity": "sha512-o/sd0nMof8kYff+TqcDx3VSrgBTcZpSvYcAHIfHhv5VAuNmisCxjhx6YmxS8PFEpb9z5WKWKPdzf0jM23ro3RQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "@types/debug": "^4.0.0",
+        "debug": "^4.0.0",
+        "decode-named-character-reference": "^1.0.0",
+        "devlop": "^1.0.0",
+        "micromark-core-commonmark": "^2.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-combine-extensions": "^2.0.0",
+        "micromark-util-decode-numeric-character-reference": "^2.0.0",
+        "micromark-util-encode": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0",
+        "micromark-util-resolve-all": "^2.0.0",
+        "micromark-util-sanitize-uri": "^2.0.0",
+        "micromark-util-subtokenize": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-core-commonmark": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/micromark-core-commonmark/-/micromark-core-commonmark-2.0.1.tgz",
+      "integrity": "sha512-CUQyKr1e///ZODyD1U3xit6zXwy1a8q2a1S1HKtIlmgvurrEpaw/Y9y6KSIbF8P59cn/NjzHyO+Q2fAyYLQrAA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "decode-named-character-reference": "^1.0.0",
+        "devlop": "^1.0.0",
+        "micromark-factory-destination": "^2.0.0",
+        "micromark-factory-label": "^2.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-factory-title": "^2.0.0",
+        "micromark-factory-whitespace": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-classify-character": "^2.0.0",
+        "micromark-util-html-tag-name": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0",
+        "micromark-util-resolve-all": "^2.0.0",
+        "micromark-util-subtokenize": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-core-commonmark/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-core-commonmark/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-core-commonmark/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-directive": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-directive/-/micromark-extension-directive-3.0.2.tgz",
+      "integrity": "sha512-wjcXHgk+PPdmvR58Le9d7zQYWy+vKEU9Se44p2CrCDPiLr2FMyiT4Fyb5UFKFC66wGB3kPlgD7q3TnoqPS7SZA==",
+      "license": "MIT",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-factory-whitespace": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0",
+        "parse-entities": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-directive/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-directive/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-directive/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-frontmatter": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-frontmatter/-/micromark-extension-frontmatter-2.0.0.tgz",
+      "integrity": "sha512-C4AkuM3dA58cgZha7zVnuVxBhDsbttIMiytjgsM2XbHAB2faRVaHRle40558FBN+DJcrLNCoqG5mlrpdU4cRtg==",
+      "license": "MIT",
+      "dependencies": {
+        "fault": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-frontmatter/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-frontmatter/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-gfm": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-gfm/-/micromark-extension-gfm-3.0.0.tgz",
+      "integrity": "sha512-vsKArQsicm7t0z2GugkCKtZehqUm31oeGBV/KVSorWSy8ZlNAv7ytjFhvaryUiCUJYqs+NoE6AFhpQvBTM6Q4w==",
+      "license": "MIT",
+      "dependencies": {
+        "micromark-extension-gfm-autolink-literal": "^2.0.0",
+        "micromark-extension-gfm-footnote": "^2.0.0",
+        "micromark-extension-gfm-strikethrough": "^2.0.0",
+        "micromark-extension-gfm-table": "^2.0.0",
+        "micromark-extension-gfm-tagfilter": "^2.0.0",
+        "micromark-extension-gfm-task-list-item": "^2.0.0",
+        "micromark-util-combine-extensions": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-autolink-literal": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-gfm-autolink-literal/-/micromark-extension-gfm-autolink-literal-2.1.0.tgz",
+      "integrity": "sha512-oOg7knzhicgQ3t4QCjCWgTmfNhvQbDDnJeVu9v81r7NltNCVmhPy1fJRX27pISafdjL+SVc4d3l48Gb6pbRypw==",
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-sanitize-uri": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-autolink-literal/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-gfm-autolink-literal/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-gfm-footnote": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-gfm-footnote/-/micromark-extension-gfm-footnote-2.1.0.tgz",
+      "integrity": "sha512-/yPhxI1ntnDNsiHtzLKYnE3vf9JZ6cAisqVDauhp4CEHxlb4uoOTxOCJ+9s51bIB8U1N1FJ1RXOKTIlD5B/gqw==",
+      "license": "MIT",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-core-commonmark": "^2.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0",
+        "micromark-util-sanitize-uri": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-footnote/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-gfm-footnote/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-gfm-footnote/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-gfm-strikethrough": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-gfm-strikethrough/-/micromark-extension-gfm-strikethrough-2.1.0.tgz",
+      "integrity": "sha512-ADVjpOOkjz1hhkZLlBiYA9cR2Anf8F4HqZUO6e5eDcPQd0Txw5fxLzzxnEkSkfnD0wziSGiv7sYhk/ktvbf1uw==",
+      "license": "MIT",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-classify-character": "^2.0.0",
+        "micromark-util-resolve-all": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-strikethrough/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-gfm-table": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-gfm-table/-/micromark-extension-gfm-table-2.1.0.tgz",
+      "integrity": "sha512-Ub2ncQv+fwD70/l4ou27b4YzfNaCJOvyX4HxXU15m7mpYY+rjuWzsLIPZHJL253Z643RpbcP1oeIJlQ/SKW67g==",
+      "license": "MIT",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-table/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-gfm-table/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-gfm-table/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-gfm-tagfilter": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-gfm-tagfilter/-/micromark-extension-gfm-tagfilter-2.0.0.tgz",
+      "integrity": "sha512-xHlTOmuCSotIA8TW1mDIM6X2O1SiX5P9IuDtqGonFhEK0qgRI4yeC6vMxEV2dgyr2TiD+2PQ10o+cOhdVAcwfg==",
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-task-list-item": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-gfm-task-list-item/-/micromark-extension-gfm-task-list-item-2.1.0.tgz",
+      "integrity": "sha512-qIBZhqxqI6fjLDYFTBIa4eivDMnP+OZqsNwmQ3xNLE4Cxwc+zfQEfbs6tzAo2Hjq+bh6q5F+Z8/cksrLFYWQQw==",
+      "license": "MIT",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-task-list-item/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-gfm-task-list-item/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-gfm-task-list-item/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-mdx-expression": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-mdx-expression/-/micromark-extension-mdx-expression-3.0.0.tgz",
+      "integrity": "sha512-sI0nwhUDz97xyzqJAbHQhp5TfaxEvZZZ2JDqUo+7NvyIYG6BZ5CPPqj2ogUoPJlmXHBnyZUzISg9+oUmU6tUjQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0",
+        "devlop": "^1.0.0",
+        "micromark-factory-mdx-expression": "^2.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-events-to-acorn": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-mdx-expression/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-mdx-expression/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-mdx-expression/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-mdx-jsx": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-mdx-jsx/-/micromark-extension-mdx-jsx-3.0.1.tgz",
+      "integrity": "sha512-vNuFb9czP8QCtAQcEJn0UJQJZA8Dk6DXKBqx+bg/w0WGuSxDxNr7hErW89tHUY31dUW4NqEOWwmEUNhjTFmHkg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/acorn": "^4.0.0",
+        "@types/estree": "^1.0.0",
+        "devlop": "^1.0.0",
+        "estree-util-is-identifier-name": "^3.0.0",
+        "micromark-factory-mdx-expression": "^2.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-events-to-acorn": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0",
+        "vfile-message": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-mdx-jsx/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-mdx-jsx/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-mdx-jsx/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-extension-mdx-md": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-mdx-md/-/micromark-extension-mdx-md-2.0.0.tgz",
+      "integrity": "sha512-EpAiszsB3blw4Rpba7xTOUptcFeBFi+6PY8VnJ2hhimH+vCQDirWgsMpz7w1XcZE7LVrSAUGb9VJpG9ghlYvYQ==",
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-mdxjs": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-mdxjs/-/micromark-extension-mdxjs-3.0.0.tgz",
+      "integrity": "sha512-A873fJfhnJ2siZyUrJ31l34Uqwy4xIFmvPY1oj+Ean5PHcPBYzEsvqvWGaWcfEIr11O5Dlw3p2y0tZWpKHDejQ==",
+      "license": "MIT",
+      "dependencies": {
+        "acorn": "^8.0.0",
+        "acorn-jsx": "^5.0.0",
+        "micromark-extension-mdx-expression": "^3.0.0",
+        "micromark-extension-mdx-jsx": "^3.0.0",
+        "micromark-extension-mdx-md": "^2.0.0",
+        "micromark-extension-mdxjs-esm": "^3.0.0",
+        "micromark-util-combine-extensions": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-mdxjs-esm": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-extension-mdxjs-esm/-/micromark-extension-mdxjs-esm-3.0.0.tgz",
+      "integrity": "sha512-DJFl4ZqkErRpq/dAPyeWp15tGrcrrJho1hKK5uBS70BCtfrIFg81sqcTVu3Ta+KD1Tk5vAtBNElWxtAa+m8K9A==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0",
+        "devlop": "^1.0.0",
+        "micromark-core-commonmark": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-events-to-acorn": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0",
+        "unist-util-position-from-estree": "^2.0.0",
+        "vfile-message": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-mdxjs-esm/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-mdxjs-esm/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-factory-destination": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-destination/-/micromark-factory-destination-2.0.0.tgz",
+      "integrity": "sha512-j9DGrQLm/Uhl2tCzcbLhy5kXsgkHUrjJHg4fFAeoMRwJmJerT9aw4FEhIbZStWN8A3qMwOp1uzHr4UL8AInxtA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-destination/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-destination/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-factory-label": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-label/-/micromark-factory-label-2.0.0.tgz",
+      "integrity": "sha512-RR3i96ohZGde//4WSe/dJsxOX6vxIg9TimLAS3i4EhBAFx8Sm5SmqVfR8E87DPSR31nEAjZfbt91OMZWcNgdZw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-label/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-label/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-factory-mdx-expression": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-mdx-expression/-/micromark-factory-mdx-expression-2.0.2.tgz",
+      "integrity": "sha512-5E5I2pFzJyg2CtemqAbcyCktpHXuJbABnsb32wX2U8IQKhhVFBqkcZR5LRm1WVoFqa4kTueZK4abep7wdo9nrw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0",
+        "devlop": "^1.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-events-to-acorn": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0",
+        "unist-util-position-from-estree": "^2.0.0",
+        "vfile-message": "^4.0.0"
+      }
+    },
+    "node_modules/micromark-factory-mdx-expression/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-mdx-expression/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-mdx-expression/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-factory-space": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-1.1.0.tgz",
+      "integrity": "sha512-cRzEj7c0OL4Mw2v6nwzttyOZe8XY/Z8G0rzmWQZTBi/jjwyw/U4uqKtUORXQrR5bAZZnbTI/feRV/R7hc4jQYQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^1.0.0",
+        "micromark-util-types": "^1.0.0"
+      }
+    },
+    "node_modules/micromark-factory-space/node_modules/micromark-util-types": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-types/-/micromark-util-types-1.1.0.tgz",
+      "integrity": "sha512-ukRBgie8TIAcacscVHSiddHjO4k/q3pnedmzMQ4iwDcK0FtFCohKOlFbaOL/mPgfnPsL3C1ZyxJa4sbWrBl3jg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-factory-title": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-title/-/micromark-factory-title-2.0.0.tgz",
+      "integrity": "sha512-jY8CSxmpWLOxS+t8W+FG3Xigc0RDQA9bKMY/EwILvsesiRniiVMejYTE4wumNc2f4UbAa4WsHqe3J1QS1sli+A==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-title/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-title/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-title/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-factory-whitespace": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-whitespace/-/micromark-factory-whitespace-2.0.0.tgz",
+      "integrity": "sha512-28kbwaBjc5yAI1XadbdPYHX/eDnqaUFVikLwrO7FDnKG7lpgxnvk/XGRhX/PN0mOZ+dBSZ+LgunHS+6tYQAzhA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-whitespace/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-whitespace/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-whitespace/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-character": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-1.2.0.tgz",
+      "integrity": "sha512-lXraTwcX3yH/vMDaFWCQJP1uIszLVebzUa3ZHdrgxr7KEU/9mL4mVgCpGbyhvNLNlauROiNUq7WN5u7ndbY6xg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^1.0.0",
+        "micromark-util-types": "^1.0.0"
+      }
+    },
+    "node_modules/micromark-util-character/node_modules/micromark-util-types": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-types/-/micromark-util-types-1.1.0.tgz",
+      "integrity": "sha512-ukRBgie8TIAcacscVHSiddHjO4k/q3pnedmzMQ4iwDcK0FtFCohKOlFbaOL/mPgfnPsL3C1ZyxJa4sbWrBl3jg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-chunked": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-chunked/-/micromark-util-chunked-2.0.0.tgz",
+      "integrity": "sha512-anK8SWmNphkXdaKgz5hJvGa7l00qmcaUQoMYsBwDlSKFKjc6gjGXPDw3FNL3Nbwq5L8gE+RCbGqTw49FK5Qyvg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-chunked/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-classify-character": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-classify-character/-/micromark-util-classify-character-2.0.0.tgz",
+      "integrity": "sha512-S0ze2R9GH+fu41FA7pbSqNWObo/kzwf8rN/+IGlW/4tC6oACOs8B++bh+i9bVyNnwCcuksbFwsBme5OCKXCwIw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-classify-character/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-classify-character/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-combine-extensions": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-combine-extensions/-/micromark-util-combine-extensions-2.0.0.tgz",
+      "integrity": "sha512-vZZio48k7ON0fVS3CUgFatWHoKbbLTK/rT7pzpJ4Bjp5JjkZeasRfrS9wsBdDJK2cJLHMckXZdzPSSr1B8a4oQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-decode-numeric-character-reference": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/micromark-util-decode-numeric-character-reference/-/micromark-util-decode-numeric-character-reference-2.0.1.tgz",
+      "integrity": "sha512-bmkNc7z8Wn6kgjZmVHOX3SowGmVdhYS7yBpMnuMnPzDq/6xwVA604DuOXMZTO1lvq01g+Adfa0pE2UKGlxL1XQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-decode-numeric-character-reference/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-decode-string": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-decode-string/-/micromark-util-decode-string-2.0.0.tgz",
+      "integrity": "sha512-r4Sc6leeUTn3P6gk20aFMj2ntPwn6qpDZqWvYmAG6NgvFTIlj4WtrAudLi65qYoaGdXYViXYw2pkmn7QnIFasA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "decode-named-character-reference": "^1.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-decode-numeric-character-reference": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-decode-string/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-decode-string/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-encode": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-encode/-/micromark-util-encode-2.0.0.tgz",
+      "integrity": "sha512-pS+ROfCXAGLWCOc8egcBvT0kf27GoWMqtdarNfDcjb6YLuV5cM3ioG45Ys2qOVqeqSbjaKg72vU+Wby3eddPsA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-events-to-acorn": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/micromark-util-events-to-acorn/-/micromark-util-events-to-acorn-2.0.2.tgz",
+      "integrity": "sha512-Fk+xmBrOv9QZnEDguL9OI9/NQQp6Hz4FuQ4YmCb/5V7+9eAh1s6AYSvL20kHkD67YIg7EpE54TiSlcsf3vyZgA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "@types/acorn": "^4.0.0",
+        "@types/estree": "^1.0.0",
+        "@types/unist": "^3.0.0",
+        "devlop": "^1.0.0",
+        "estree-util-visit": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0",
+        "vfile-message": "^4.0.0"
+      }
+    },
+    "node_modules/micromark-util-events-to-acorn/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-html-tag-name": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-html-tag-name/-/micromark-util-html-tag-name-2.0.0.tgz",
+      "integrity": "sha512-xNn4Pqkj2puRhKdKTm8t1YHC/BAjx6CEwRFXntTaRf/x16aqka6ouVoutm+QdkISTlT7e2zU7U4ZdlDLJd2Mcw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-normalize-identifier": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-normalize-identifier/-/micromark-util-normalize-identifier-2.0.0.tgz",
+      "integrity": "sha512-2xhYT0sfo85FMrUPtHcPo2rrp1lwbDEEzpx7jiH2xXJLqBuy4H0GgXk5ToU8IEwoROtXuL8ND0ttVa4rNqYK3w==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-normalize-identifier/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-resolve-all": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-resolve-all/-/micromark-util-resolve-all-2.0.0.tgz",
+      "integrity": "sha512-6KU6qO7DZ7GJkaCgwBNtplXCvGkJToU86ybBAUdavvgsCiG8lSSvYxr9MhwmQ+udpzywHsl4RpGJsYWG1pDOcA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-sanitize-uri": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-sanitize-uri/-/micromark-util-sanitize-uri-2.0.0.tgz",
+      "integrity": "sha512-WhYv5UEcZrbAtlsnPuChHUAsu/iBPOVaEVsntLBIdpibO0ddy8OzavZz3iL2xVvBZOpolujSliP65Kq0/7KIYw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-encode": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-sanitize-uri/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-sanitize-uri/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-subtokenize": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/micromark-util-subtokenize/-/micromark-util-subtokenize-2.0.1.tgz",
+      "integrity": "sha512-jZNtiFl/1aY73yS3UGQkutD0UbhTt68qnRpw2Pifmz5wV9h8gOVsN70v+Lq/f1rKaU/W8pxRe8y8Q9FX1AOe1Q==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-subtokenize/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-symbol": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-1.1.0.tgz",
+      "integrity": "sha512-uEjpEYY6KMs1g7QfJ2eX1SQEV+ZT4rUD3UcF6l57acZvLNK7PBZL+ty82Z1qhK1/yXIY4bdx04FKMgR0g4IAag==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark-util-types": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-types/-/micromark-util-types-2.0.0.tgz",
+      "integrity": "sha512-oNh6S2WMHWRZrmutsRmDDfkzKtxF+bc2VxLC9dvtrDIRFln627VsFP6fLMgTryGDljgLPjkrzQSDcPrjPyDJ5w==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromark/node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark/node_modules/micromark-util-character": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-character/-/micromark-util-character-2.1.0.tgz",
+      "integrity": "sha512-KvOVV+X1yLBfs9dCBSopq/+G1PcgT3lAK07mC4BzXi5E7ahzMAF8oIupDDJ6mievI6F+lAATkbQQlQixJfT3aQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark/node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/micromatch": {
+      "version": "4.0.8",
+      "resolved": "https://registry.npmmirror.com/micromatch/-/micromatch-4.0.8.tgz",
+      "integrity": "sha512-PXwfBhYu0hBCPw8Dn0E+WDYb7af3dSLVWKi3HGv84IdF4TyFoC0ysxFd0Goxw7nSv4T/PzEJQxsYsEiFCKo2BA==",
+      "license": "MIT",
+      "dependencies": {
+        "braces": "^3.0.3",
+        "picomatch": "^2.3.1"
+      },
+      "engines": {
+        "node": ">=8.6"
+      }
+    },
+    "node_modules/mime": {
+      "version": "1.6.0",
+      "resolved": "https://registry.npmmirror.com/mime/-/mime-1.6.0.tgz",
+      "integrity": "sha512-x0Vn8spI+wuJ1O6S7gnbaQg8Pxh4NNHb7KSINmEWKiPE4RKOplvijn+NkmYmmRgP68mc70j2EbeTFRsrswaQeg==",
+      "license": "MIT",
+      "bin": {
+        "mime": "cli.js"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/mime-db": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmmirror.com/mime-db/-/mime-db-1.33.0.tgz",
+      "integrity": "sha512-BHJ/EKruNIqJf/QahvxwQZXKygOQ256myeN/Ew+THcAa5q+PjyTTMMeNQC4DZw5AwfvelsUrA6B67NKMqXDbzQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/mime-types": {
+      "version": "2.1.18",
+      "resolved": "https://registry.npmmirror.com/mime-types/-/mime-types-2.1.18.tgz",
+      "integrity": "sha512-lc/aahn+t4/SWV/qcmumYjymLsWfN3ELhpmVuUFjgsORruuZPVSwAQryq+HHGvO/SI2KVX26bx+En+zhM8g8hQ==",
+      "license": "MIT",
+      "dependencies": {
+        "mime-db": "~1.33.0"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/mimic-fn": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/mimic-fn/-/mimic-fn-2.1.0.tgz",
+      "integrity": "sha512-OqbOk5oEQeAZ8WXWydlu9HJjz9WVdEIvamMCcXmuqUYjTknH/sqsWvhQ3vgwKFRR1HpjvNBKQ37nbJgYzGqGcg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/mimic-response": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/mimic-response/-/mimic-response-4.0.0.tgz",
+      "integrity": "sha512-e5ISH9xMYU0DzrT+jl8q2ze9D6eWBto+I8CNpe+VI+K2J/F/k3PdkdTdz4wvGVH4NTpo+NRYTVIuMQEMMcsLqg==",
+      "license": "MIT",
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/mini-css-extract-plugin": {
+      "version": "2.9.1",
+      "resolved": "https://registry.npmmirror.com/mini-css-extract-plugin/-/mini-css-extract-plugin-2.9.1.tgz",
+      "integrity": "sha512-+Vyi+GCCOHnrJ2VPS+6aPoXN2k2jgUzDRhTFLjjTBn23qyXJXkjUWQgTL+mXpF5/A8ixLdCc6kWsoeOjKGejKQ==",
+      "license": "MIT",
+      "dependencies": {
+        "schema-utils": "^4.0.0",
+        "tapable": "^2.2.1"
+      },
+      "engines": {
+        "node": ">= 12.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "webpack": "^5.0.0"
+      }
+    },
+    "node_modules/minimalistic-assert": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmmirror.com/minimalistic-assert/-/minimalistic-assert-1.0.1.tgz",
+      "integrity": "sha512-UtJcAD4yEaGtjPezWuO9wC4nwUnVH/8/Im3yEHQP4b67cXlD/Qr9hdITCU1xDbSEXg2XKNaP8jsReV7vQd00/A==",
+      "license": "ISC"
+    },
+    "node_modules/minimatch": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmmirror.com/minimatch/-/minimatch-3.1.2.tgz",
+      "integrity": "sha512-J7p63hRiAjw1NDEww1W7i37+ByIrOWO5XQQAzZ3VOcL0PNybwpfmV/N05zFAzwQ9USyEcX6t3UO+K5aqBQOIHw==",
+      "license": "ISC",
+      "dependencies": {
+        "brace-expansion": "^1.1.7"
+      },
+      "engines": {
+        "node": "*"
+      }
+    },
+    "node_modules/minimist": {
+      "version": "1.2.8",
+      "resolved": "https://registry.npmmirror.com/minimist/-/minimist-1.2.8.tgz",
+      "integrity": "sha512-2yyAR8qBkN3YuheJanUpWC5U3bb5osDywNB8RzDVlDwDHbocAJveqqj1u8+SVD7jkWT4yvsHCpWqqWqAxb0zCA==",
+      "license": "MIT",
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/mrmime": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/mrmime/-/mrmime-2.0.0.tgz",
+      "integrity": "sha512-eu38+hdgojoyq63s+yTpN4XMBdt5l8HhMhc4VKLO9KM5caLIBvUm4thi7fFaxyTmCKeNnXZ5pAlBwCUnhA09uw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/ms": {
+      "version": "2.1.3",
+      "resolved": "https://registry.npmmirror.com/ms/-/ms-2.1.3.tgz",
+      "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==",
+      "license": "MIT"
+    },
+    "node_modules/multicast-dns": {
+      "version": "7.2.5",
+      "resolved": "https://registry.npmmirror.com/multicast-dns/-/multicast-dns-7.2.5.tgz",
+      "integrity": "sha512-2eznPJP8z2BFLX50tf0LuODrpINqP1RVIm/CObbTcBRITQgmC/TjcREF1NeTBzIcR5XO/ukWo+YHOjBbFwIupg==",
+      "license": "MIT",
+      "dependencies": {
+        "dns-packet": "^5.2.2",
+        "thunky": "^1.0.2"
+      },
+      "bin": {
+        "multicast-dns": "cli.js"
+      }
+    },
+    "node_modules/nanoid": {
+      "version": "3.3.7",
+      "resolved": "https://registry.npmmirror.com/nanoid/-/nanoid-3.3.7.tgz",
+      "integrity": "sha512-eSRppjcPIatRIMC1U6UngP8XFcz8MQWGQdt1MTBQ7NaAmvXDfvNxbvWV3x2y6CdEUciCSsDHDQZbhYaB8QEo2g==",
+      "funding": [
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/ai"
+        }
+      ],
+      "license": "MIT",
+      "bin": {
+        "nanoid": "bin/nanoid.cjs"
+      },
+      "engines": {
+        "node": "^10 || ^12 || ^13.7 || ^14 || >=15.0.1"
+      }
+    },
+    "node_modules/negotiator": {
+      "version": "0.6.3",
+      "resolved": "https://registry.npmmirror.com/negotiator/-/negotiator-0.6.3.tgz",
+      "integrity": "sha512-+EUsqGPLsM+j/zdChZjsnX51g4XrHFOIXwfnCVPGlQk/k5giakcKsuxCObBRu6DSm9opw/O6slWbJdghQM4bBg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/neo-async": {
+      "version": "2.6.2",
+      "resolved": "https://registry.npmmirror.com/neo-async/-/neo-async-2.6.2.tgz",
+      "integrity": "sha512-Yd3UES5mWCSqR+qNT93S3UoYUkqAZ9lLg8a7g9rimsWmYGK8cVToA4/sF3RrshdyV3sAGMXVUmpMYOw+dLpOuw==",
+      "license": "MIT"
+    },
+    "node_modules/no-case": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmmirror.com/no-case/-/no-case-3.0.4.tgz",
+      "integrity": "sha512-fgAN3jGAh+RoxUGZHTSOLJIqUc2wmoBwGR4tbpNAKmmovFoWq0OdRkb0VkldReO2a2iBT/OEulG9XSUc10r3zg==",
+      "license": "MIT",
+      "dependencies": {
+        "lower-case": "^2.0.2",
+        "tslib": "^2.0.3"
+      }
+    },
+    "node_modules/node-emoji": {
+      "version": "2.1.3",
+      "resolved": "https://registry.npmmirror.com/node-emoji/-/node-emoji-2.1.3.tgz",
+      "integrity": "sha512-E2WEOVsgs7O16zsURJ/eH8BqhF029wGpEOnv7Urwdo2wmQanOACwJQh0devF9D9RhoZru0+9JXIS0dBXIAz+lA==",
+      "license": "MIT",
+      "dependencies": {
+        "@sindresorhus/is": "^4.6.0",
+        "char-regex": "^1.0.2",
+        "emojilib": "^2.4.0",
+        "skin-tone": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=18"
+      }
+    },
+    "node_modules/node-forge": {
+      "version": "1.3.1",
+      "resolved": "https://registry.npmmirror.com/node-forge/-/node-forge-1.3.1.tgz",
+      "integrity": "sha512-dPEtOeMvF9VMcYV/1Wb8CPoVAXtp6MKMlcbAt4ddqmGqUJ6fQZFXkNZNkNlfevtNkGtaSoXf/vNNNSvgrdXwtA==",
+      "license": "(BSD-3-Clause OR GPL-2.0)",
+      "engines": {
+        "node": ">= 6.13.0"
+      }
+    },
+    "node_modules/node-releases": {
+      "version": "2.0.18",
+      "resolved": "https://registry.npmmirror.com/node-releases/-/node-releases-2.0.18.tgz",
+      "integrity": "sha512-d9VeXT4SJ7ZeOqGX6R5EM022wpL+eWPooLI+5UpWn2jCT1aosUQEhQP214x33Wkwx3JQMvIm+tIoVOdodFS40g==",
+      "license": "MIT"
+    },
+    "node_modules/normalize-path": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/normalize-path/-/normalize-path-3.0.0.tgz",
+      "integrity": "sha512-6eZs5Ls3WtCisHWp9S2GUy8dqkpGi4BVSz3GaqiE6ezub0512ESztXUwUB6C6IKbQkY2Pnb/mD4WYojCRwcwLA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/normalize-range": {
+      "version": "0.1.2",
+      "resolved": "https://registry.npmmirror.com/normalize-range/-/normalize-range-0.1.2.tgz",
+      "integrity": "sha512-bdok/XvKII3nUpklnV6P2hxtMNrCboOjAcyBuQnWEhO665FwrSNRxU+AqpsyvO6LgGYPspN+lu5CLtw4jPRKNA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/normalize-url": {
+      "version": "8.0.1",
+      "resolved": "https://registry.npmmirror.com/normalize-url/-/normalize-url-8.0.1.tgz",
+      "integrity": "sha512-IO9QvjUMWxPQQhs60oOu10CRkWCiZzSUkzbXGGV9pviYl1fXYcvkzQ5jV9z8Y6un8ARoVRl4EtC6v6jNqbaJ/w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/npm-run-path": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmmirror.com/npm-run-path/-/npm-run-path-4.0.1.tgz",
+      "integrity": "sha512-S48WzZW777zhNIrn7gxOlISNAqi9ZC/uQFnRdbeIHhZhCA6UqpkOT8T1G7BvfdgP4Er8gF4sUbaS0i7QvIfCWw==",
+      "license": "MIT",
+      "dependencies": {
+        "path-key": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/nprogress": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmmirror.com/nprogress/-/nprogress-0.2.0.tgz",
+      "integrity": "sha512-I19aIingLgR1fmhftnbWWO3dXc0hSxqHQHQb3H8m+K3TnEn/iSeTZZOyvKXWqQESMwuUVnatlCnZdLBZZt2VSA==",
+      "license": "MIT"
+    },
+    "node_modules/nth-check": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmmirror.com/nth-check/-/nth-check-2.1.1.tgz",
+      "integrity": "sha512-lqjrjmaOoAnWfMmBPL+XNnynZh2+swxiX3WUE0s4yEHI6m+AwrK2UZOimIRl3X/4QctVqS8AiZjFqyOGrMXb/w==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "boolbase": "^1.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/fb55/nth-check?sponsor=1"
+      }
+    },
+    "node_modules/object-assign": {
+      "version": "4.1.1",
+      "resolved": "https://registry.npmmirror.com/object-assign/-/object-assign-4.1.1.tgz",
+      "integrity": "sha512-rJgTQnkUnH1sFw8yT6VSU3zD3sWmu6sZhIseY8VX+GRu3P6F7Fu+JNDoXfklElbLJSnc3FUQHVe4cU5hj+BcUg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/object-inspect": {
+      "version": "1.13.2",
+      "resolved": "https://registry.npmmirror.com/object-inspect/-/object-inspect-1.13.2.tgz",
+      "integrity": "sha512-IRZSRuzJiynemAXPYtPe5BoI/RESNYR7TYm50MC5Mqbd3Jmw5y790sErYw3V6SryFJD64b74qQQs9wn5Bg/k3g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/object-keys": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmmirror.com/object-keys/-/object-keys-1.1.1.tgz",
+      "integrity": "sha512-NuAESUOUMrlIXOfHKzD6bpPu3tYt3xvjNdRIQ+FeT0lNb4K8WR70CaDxhuNguS2XG+GjkyMwOzsN5ZktImfhLA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      }
+    },
+    "node_modules/object.assign": {
+      "version": "4.1.5",
+      "resolved": "https://registry.npmmirror.com/object.assign/-/object.assign-4.1.5.tgz",
+      "integrity": "sha512-byy+U7gp+FVwmyzKPYhW2h5l3crpmGsxl7X2s8y43IgxvG4g3QZ6CffDtsNQy1WsmZpQbO+ybo0AlW7TY6DcBQ==",
+      "license": "MIT",
+      "dependencies": {
+        "call-bind": "^1.0.5",
+        "define-properties": "^1.2.1",
+        "has-symbols": "^1.0.3",
+        "object-keys": "^1.1.1"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/obuf": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmmirror.com/obuf/-/obuf-1.1.2.tgz",
+      "integrity": "sha512-PX1wu0AmAdPqOL1mWhqmlOd8kOIZQwGZw6rh7uby9fTc5lhaOWFLX3I6R1hrF9k3zUY40e6igsLGkDXK92LJNg==",
+      "license": "MIT"
+    },
+    "node_modules/on-finished": {
+      "version": "2.4.1",
+      "resolved": "https://registry.npmmirror.com/on-finished/-/on-finished-2.4.1.tgz",
+      "integrity": "sha512-oVlzkg3ENAhCk2zdv7IJwd/QUD4z2RxRwpkcGY8psCVcCYZNq4wYnVWALHM+brtuJjePWiYF/ClmuDr8Ch5+kg==",
+      "license": "MIT",
+      "dependencies": {
+        "ee-first": "1.1.1"
+      },
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/on-headers": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/on-headers/-/on-headers-1.0.2.tgz",
+      "integrity": "sha512-pZAE+FJLoyITytdqK0U5s+FIpjN0JP3OzFi/u8Rx+EV5/W+JTWGXG8xFzevE7AjBfDqHv/8vL8qQsIhHnqRkrA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/once": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmmirror.com/once/-/once-1.4.0.tgz",
+      "integrity": "sha512-lNaJgI+2Q5URQBkccEKHTQOPaXdUxnZZElQTZY0MFUAuaEqe1E+Nyvgdz/aIyNi6Z9MzO5dv1H8n58/GELp3+w==",
+      "license": "ISC",
+      "dependencies": {
+        "wrappy": "1"
+      }
+    },
+    "node_modules/onetime": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmmirror.com/onetime/-/onetime-5.1.2.tgz",
+      "integrity": "sha512-kbpaSSGJTWdAY5KPVeMOKXSrPtr8C8C7wodJbcsd51jRnmD+GZu8Y0VoU6Dm5Z4vWr0Ig/1NKuWRKf7j5aaYSg==",
+      "license": "MIT",
+      "dependencies": {
+        "mimic-fn": "^2.1.0"
+      },
+      "engines": {
+        "node": ">=6"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/open": {
+      "version": "8.4.2",
+      "resolved": "https://registry.npmmirror.com/open/-/open-8.4.2.tgz",
+      "integrity": "sha512-7x81NCL719oNbsq/3mh+hVrAWmFuEYUqrq/Iw3kUzH8ReypT9QQ0BLoJS7/G9k6N81XjW4qHWtjWwe/9eLy1EQ==",
+      "license": "MIT",
+      "dependencies": {
+        "define-lazy-prop": "^2.0.0",
+        "is-docker": "^2.1.1",
+        "is-wsl": "^2.2.0"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/opener": {
+      "version": "1.5.2",
+      "resolved": "https://registry.npmmirror.com/opener/-/opener-1.5.2.tgz",
+      "integrity": "sha512-ur5UIdyw5Y7yEj9wLzhqXiy6GZ3Mwx0yGI+5sMn2r0N0v3cKJvUmFH5yPP+WXh9e0xfyzyJX95D8l088DNFj7A==",
+      "license": "(WTFPL OR MIT)",
+      "bin": {
+        "opener": "bin/opener-bin.js"
+      }
+    },
+    "node_modules/p-cancelable": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/p-cancelable/-/p-cancelable-3.0.0.tgz",
+      "integrity": "sha512-mlVgR3PGuzlo0MmTdk4cXqXWlwQDLnONTAg6sm62XkMJEiRxN3GL3SffkYvqwonbkJBcrI7Uvv5Zh9yjvn2iUw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12.20"
+      }
+    },
+    "node_modules/p-limit": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/p-limit/-/p-limit-4.0.0.tgz",
+      "integrity": "sha512-5b0R4txpzjPWVw/cXXUResoD4hb6U/x9BH08L7nw+GN1sezDzPdxeRvpc9c433fZhBan/wusjbCsqwqm4EIBIQ==",
+      "license": "MIT",
+      "dependencies": {
+        "yocto-queue": "^1.0.0"
+      },
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/p-locate": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmmirror.com/p-locate/-/p-locate-6.0.0.tgz",
+      "integrity": "sha512-wPrq66Llhl7/4AGC6I+cqxT07LhXvWL08LNXz1fENOw0Ap4sRZZ/gZpTTJ5jpurzzzfS2W/Ge9BY3LgLjCShcw==",
+      "license": "MIT",
+      "dependencies": {
+        "p-limit": "^4.0.0"
+      },
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/p-map": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/p-map/-/p-map-4.0.0.tgz",
+      "integrity": "sha512-/bjOqmgETBYB5BoEeGVea8dmvHb2m9GLy1E9W43yeyfP6QQCZGFNa+XRceJEuDB6zqr+gKpIAmlLebMpykw/MQ==",
+      "license": "MIT",
+      "dependencies": {
+        "aggregate-error": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/p-retry": {
+      "version": "4.6.2",
+      "resolved": "https://registry.npmmirror.com/p-retry/-/p-retry-4.6.2.tgz",
+      "integrity": "sha512-312Id396EbJdvRONlngUx0NydfrIQ5lsYu0znKVUzVvArzEIt08V1qhtyESbGVd1FGX7UKtiFp5uwKZdM8wIuQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/retry": "0.12.0",
+        "retry": "^0.13.1"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/p-try": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/p-try/-/p-try-2.2.0.tgz",
+      "integrity": "sha512-R4nPAVTAU0B9D35/Gk3uJf/7XYbQcyohSKdvAxIRSNghFl4e71hVoGnBNQz9cWaXxO2I10KTC+3jMdvvoKw6dQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/package-json": {
+      "version": "8.1.1",
+      "resolved": "https://registry.npmmirror.com/package-json/-/package-json-8.1.1.tgz",
+      "integrity": "sha512-cbH9IAIJHNj9uXi196JVsRlt7cHKak6u/e6AkL/bkRelZ7rlL3X1YKxsZwa36xipOEKAsdtmaG6aAJoM1fx2zA==",
+      "license": "MIT",
+      "dependencies": {
+        "got": "^12.1.0",
+        "registry-auth-token": "^5.0.1",
+        "registry-url": "^6.0.0",
+        "semver": "^7.3.7"
+      },
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/param-case": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmmirror.com/param-case/-/param-case-3.0.4.tgz",
+      "integrity": "sha512-RXlj7zCYokReqWpOPH9oYivUzLYZ5vAPIfEmCTNViosC78F8F0H9y7T7gG2M39ymgutxF5gcFEsyZQSph9Bp3A==",
+      "license": "MIT",
+      "dependencies": {
+        "dot-case": "^3.0.4",
+        "tslib": "^2.0.3"
+      }
+    },
+    "node_modules/parent-module": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmmirror.com/parent-module/-/parent-module-1.0.1.tgz",
+      "integrity": "sha512-GQ2EWRpQV8/o+Aw8YqtfZZPfNRWZYkbidE9k5rpl/hC3vtHHBfGm2Ifi6qWV+coDGkrUKZAxE3Lot5kcsRlh+g==",
+      "license": "MIT",
+      "dependencies": {
+        "callsites": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/parse-entities": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmmirror.com/parse-entities/-/parse-entities-4.0.1.tgz",
+      "integrity": "sha512-SWzvYcSJh4d/SGLIOQfZ/CoNv6BTlI6YEQ7Nj82oDVnRpwe/Z/F1EMx42x3JAOwGBlCjeCH0BRJQbQ/opHL17w==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "character-entities": "^2.0.0",
+        "character-entities-legacy": "^3.0.0",
+        "character-reference-invalid": "^2.0.0",
+        "decode-named-character-reference": "^1.0.0",
+        "is-alphanumerical": "^2.0.0",
+        "is-decimal": "^2.0.0",
+        "is-hexadecimal": "^2.0.0"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/parse-entities/node_modules/@types/unist": {
+      "version": "2.0.11",
+      "resolved": "https://registry.npmmirror.com/@types/unist/-/unist-2.0.11.tgz",
+      "integrity": "sha512-CmBKiL6NNo/OqgmMn95Fk9Whlp2mtvIv+KNpQKN2F4SjvrEesubTRWGYSg+BnWZOnlCaSTU1sMpsBOzgbYhnsA==",
+      "license": "MIT"
+    },
+    "node_modules/parse-json": {
+      "version": "5.2.0",
+      "resolved": "https://registry.npmmirror.com/parse-json/-/parse-json-5.2.0.tgz",
+      "integrity": "sha512-ayCKvm/phCGxOkYRSCM82iDwct8/EonSEgCSxWxD7ve6jHggsFl4fZVQBPRNgQoKiuV/odhFrGzQXZwbifC8Rg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/code-frame": "^7.0.0",
+        "error-ex": "^1.3.1",
+        "json-parse-even-better-errors": "^2.3.0",
+        "lines-and-columns": "^1.1.6"
+      },
+      "engines": {
+        "node": ">=8"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/parse-numeric-range": {
+      "version": "1.3.0",
+      "resolved": "https://registry.npmmirror.com/parse-numeric-range/-/parse-numeric-range-1.3.0.tgz",
+      "integrity": "sha512-twN+njEipszzlMJd4ONUYgSfZPDxgHhT9Ahed5uTigpQn90FggW4SA/AIPq/6a149fTbE9qBEcSwE3FAEp6wQQ==",
+      "license": "ISC"
+    },
+    "node_modules/parse5": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmmirror.com/parse5/-/parse5-7.2.0.tgz",
+      "integrity": "sha512-ZkDsAOcxsUMZ4Lz5fVciOehNcJ+Gb8gTzcA4yl3wnc273BAybYWrQ+Ks/OjCjSEpjvQkDSeZbybK9qj2VHHdGA==",
+      "license": "MIT",
+      "dependencies": {
+        "entities": "^4.5.0"
+      },
+      "funding": {
+        "url": "https://github.com/inikulin/parse5?sponsor=1"
+      }
+    },
+    "node_modules/parse5-htmlparser2-tree-adapter": {
+      "version": "7.1.0",
+      "resolved": "https://registry.npmmirror.com/parse5-htmlparser2-tree-adapter/-/parse5-htmlparser2-tree-adapter-7.1.0.tgz",
+      "integrity": "sha512-ruw5xyKs6lrpo9x9rCZqZZnIUntICjQAd0Wsmp396Ul9lN/h+ifgVV1x1gZHi8euej6wTfpqX8j+BFQxF0NS/g==",
+      "license": "MIT",
+      "dependencies": {
+        "domhandler": "^5.0.3",
+        "parse5": "^7.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/inikulin/parse5?sponsor=1"
+      }
+    },
+    "node_modules/parseurl": {
+      "version": "1.3.3",
+      "resolved": "https://registry.npmmirror.com/parseurl/-/parseurl-1.3.3.tgz",
+      "integrity": "sha512-CiyeOxFT/JZyN5m0z9PfXw4SCBJ6Sygz1Dpl0wqjlhDEGGBP1GnsUVEL0p63hoG1fcj3fHynXi9NYO4nWOL+qQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/pascal-case": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmmirror.com/pascal-case/-/pascal-case-3.1.2.tgz",
+      "integrity": "sha512-uWlGT3YSnK9x3BQJaOdcZwrnV6hPpd8jFH1/ucpiLRPh/2zCVJKS19E4GvYHvaCcACn3foXZ0cLB9Wrx1KGe5g==",
+      "license": "MIT",
+      "dependencies": {
+        "no-case": "^3.0.4",
+        "tslib": "^2.0.3"
+      }
+    },
+    "node_modules/path-exists": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmmirror.com/path-exists/-/path-exists-5.0.0.tgz",
+      "integrity": "sha512-RjhtfwJOxzcFmNOi6ltcbcu4Iu+FL3zEj83dk4kAS+fVpTxXLO1b38RvJgT/0QwvV/L3aY9TAnyv0EOqW4GoMQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      }
+    },
+    "node_modules/path-is-absolute": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmmirror.com/path-is-absolute/-/path-is-absolute-1.0.1.tgz",
+      "integrity": "sha512-AVbw3UJ2e9bq64vSaS9Am0fje1Pa8pbGqTTsmXfaIiMpnr5DlDhfJOuLj9Sf95ZPVDAUerDfEk88MPmPe7UCQg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/path-is-inside": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/path-is-inside/-/path-is-inside-1.0.2.tgz",
+      "integrity": "sha512-DUWJr3+ULp4zXmol/SZkFf3JGsS9/SIv+Y3Rt93/UjPpDpklB5f1er4O3POIbUuUJ3FXgqte2Q7SrU6zAqwk8w==",
+      "license": "(WTFPL OR MIT)"
+    },
+    "node_modules/path-key": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmmirror.com/path-key/-/path-key-3.1.1.tgz",
+      "integrity": "sha512-ojmeN0qd+y0jszEtoY48r0Peq5dwMEkIlCOu6Q5f41lfkswXuKtYrhgoTpLnyIcHm24Uhqx+5Tqm2InSwLhE6Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/path-parse": {
+      "version": "1.0.7",
+      "resolved": "https://registry.npmmirror.com/path-parse/-/path-parse-1.0.7.tgz",
+      "integrity": "sha512-LDJzPVEEEPR+y48z93A0Ed0yXb8pAByGWo/k5YYdYgpY2/2EsOsksJrq7lOHxryrVOn1ejG6oAp8ahvOIQD8sw==",
+      "license": "MIT"
+    },
+    "node_modules/path-to-regexp": {
+      "version": "1.9.0",
+      "resolved": "https://registry.npmmirror.com/path-to-regexp/-/path-to-regexp-1.9.0.tgz",
+      "integrity": "sha512-xIp7/apCFJuUHdDLWe8O1HIkb0kQrOMb/0u6FXQjemHn/ii5LrIzU6bdECnsiTF/GjZkMEKg1xdiZwNqDYlZ6g==",
+      "license": "MIT",
+      "dependencies": {
+        "isarray": "0.0.1"
+      }
+    },
+    "node_modules/path-type": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/path-type/-/path-type-4.0.0.tgz",
+      "integrity": "sha512-gDKb8aZMDeD/tZWs9P6+q0J9Mwkdl6xMV8TjnGP3qJVJ06bdMgkbBlLU8IdfOsIsFz2BW1rNVT3XuNEl8zPAvw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/periscopic": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/periscopic/-/periscopic-3.1.0.tgz",
+      "integrity": "sha512-vKiQ8RRtkl9P+r/+oefh25C3fhybptkHKCZSPlcXiJux2tJF55GnEj3BVn4A5gKfq9NWWXXrxkHBwVPUfH0opw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0",
+        "estree-walker": "^3.0.0",
+        "is-reference": "^3.0.0"
+      }
+    },
+    "node_modules/picocolors": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/picocolors/-/picocolors-1.1.0.tgz",
+      "integrity": "sha512-TQ92mBOW0l3LeMeyLV6mzy/kWr8lkd/hp3mTg7wYK7zJhuBStmGMBG0BdeDZS/dZx1IukaX6Bk11zcln25o1Aw==",
+      "license": "ISC"
+    },
+    "node_modules/picomatch": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmmirror.com/picomatch/-/picomatch-2.3.1.tgz",
+      "integrity": "sha512-JU3teHTNjmE2VCGFzuY8EXzCDVwEqB2a8fsIvwaStHhAWJEeVd1o1QD80CU6+ZdEXXSLbSsuLwJjkCBWqRQUVA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8.6"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/jonschlinkert"
+      }
+    },
+    "node_modules/pkg-dir": {
+      "version": "7.0.0",
+      "resolved": "https://registry.npmmirror.com/pkg-dir/-/pkg-dir-7.0.0.tgz",
+      "integrity": "sha512-Ie9z/WINcxxLp27BKOCHGde4ITq9UklYKDzVo1nhk5sqGEXU3FpkwP5GM2voTGJkGd9B3Otl+Q4uwSOeSUtOBA==",
+      "license": "MIT",
+      "dependencies": {
+        "find-up": "^6.3.0"
+      },
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/pkg-up": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/pkg-up/-/pkg-up-3.1.0.tgz",
+      "integrity": "sha512-nDywThFk1i4BQK4twPQ6TA4RT8bDY96yeuCVBWL3ePARCiEKDRSrNGbFIgUJpLp+XeIR65v8ra7WuJOFUBtkMA==",
+      "license": "MIT",
+      "dependencies": {
+        "find-up": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/pkg-up/node_modules/find-up": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/find-up/-/find-up-3.0.0.tgz",
+      "integrity": "sha512-1yD6RmLI1XBfxugvORwlck6f75tYL+iR0jqwsOrOxMZyGYqUuDhJ0l4AXdO1iX/FTs9cBAMEk1gWSEx1kSbylg==",
+      "license": "MIT",
+      "dependencies": {
+        "locate-path": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/pkg-up/node_modules/locate-path": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/locate-path/-/locate-path-3.0.0.tgz",
+      "integrity": "sha512-7AO748wWnIhNqAuaty2ZWHkQHRSNfPVIsPIfwEOWO22AmaoVrWavlOcMR5nzTLNYvp36X220/maaRsrec1G65A==",
+      "license": "MIT",
+      "dependencies": {
+        "p-locate": "^3.0.0",
+        "path-exists": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/pkg-up/node_modules/p-limit": {
+      "version": "2.3.0",
+      "resolved": "https://registry.npmmirror.com/p-limit/-/p-limit-2.3.0.tgz",
+      "integrity": "sha512-//88mFWSJx8lxCzwdAABTJL2MyWB12+eIY7MDL2SqLmAkeKU9qxRvWuSyTjm3FUmpBEMuFfckAIqEaVGUDxb6w==",
+      "license": "MIT",
+      "dependencies": {
+        "p-try": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/pkg-up/node_modules/p-locate": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/p-locate/-/p-locate-3.0.0.tgz",
+      "integrity": "sha512-x+12w/To+4GFfgJhBEpiDcLozRJGegY+Ei7/z0tSLkMmxGZNybVMSfWj9aJn8Z5Fc7dBUNJOOVgPv2H7IwulSQ==",
+      "license": "MIT",
+      "dependencies": {
+        "p-limit": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/pkg-up/node_modules/path-exists": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/path-exists/-/path-exists-3.0.0.tgz",
+      "integrity": "sha512-bpC7GYwiDYQ4wYLe+FA8lhRjhQCMcQGuSgGGqDkg/QerRWw9CmGRT0iSOVRSZJ29NMLZgIzqaljJ63oaL4NIJQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/postcss": {
+      "version": "8.4.47",
+      "resolved": "https://registry.npmmirror.com/postcss/-/postcss-8.4.47.tgz",
+      "integrity": "sha512-56rxCq7G/XfB4EkXq9Egn5GCqugWvDFjafDOThIdMBsI15iqPqR5r15TfSr1YPYeEI19YeaXMCbY6u88Y76GLQ==",
+      "funding": [
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/postcss/"
+        },
+        {
+          "type": "tidelift",
+          "url": "https://tidelift.com/funding/github/npm/postcss"
+        },
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/ai"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "nanoid": "^3.3.7",
+        "picocolors": "^1.1.0",
+        "source-map-js": "^1.2.1"
+      },
+      "engines": {
+        "node": "^10 || ^12 || >=14"
+      }
+    },
+    "node_modules/postcss-calc": {
+      "version": "9.0.1",
+      "resolved": "https://registry.npmmirror.com/postcss-calc/-/postcss-calc-9.0.1.tgz",
+      "integrity": "sha512-TipgjGyzP5QzEhsOZUaIkeO5mKeMFpebWzRogWG/ysonUlnHcq5aJe0jOjpfzUU8PeSaBQnrE8ehR0QA5vs8PQ==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-selector-parser": "^6.0.11",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.2.2"
+      }
+    },
+    "node_modules/postcss-colormin": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/postcss-colormin/-/postcss-colormin-6.1.0.tgz",
+      "integrity": "sha512-x9yX7DOxeMAR+BgGVnNSAxmAj98NX/YxEMNFP+SDCEeNLb2r3i6Hh1ksMsnW8Ub5SLCpbescQqn9YEbE9554Sw==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.0",
+        "caniuse-api": "^3.0.0",
+        "colord": "^2.9.3",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-convert-values": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/postcss-convert-values/-/postcss-convert-values-6.1.0.tgz",
+      "integrity": "sha512-zx8IwP/ts9WvUM6NkVSkiU902QZL1bwPhaVaLynPtCsOTqp+ZKbNi+s6XJg3rfqpKGA/oc7Oxk5t8pOQJcwl/w==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.0",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-discard-comments": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-discard-comments/-/postcss-discard-comments-6.0.2.tgz",
+      "integrity": "sha512-65w/uIqhSBBfQmYnG92FO1mWZjJ4GL5b8atm5Yw2UgrwD7HiNiSSNwJor1eCFGzUgYnN/iIknhNRVqjrrpuglw==",
+      "license": "MIT",
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-discard-duplicates": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmmirror.com/postcss-discard-duplicates/-/postcss-discard-duplicates-6.0.3.tgz",
+      "integrity": "sha512-+JA0DCvc5XvFAxwx6f/e68gQu/7Z9ud584VLmcgto28eB8FqSFZwtrLwB5Kcp70eIoWP/HXqz4wpo8rD8gpsTw==",
+      "license": "MIT",
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-discard-empty": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmmirror.com/postcss-discard-empty/-/postcss-discard-empty-6.0.3.tgz",
+      "integrity": "sha512-znyno9cHKQsK6PtxL5D19Fj9uwSzC2mB74cpT66fhgOadEUPyXFkbgwm5tvc3bt3NAy8ltE5MrghxovZRVnOjQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-discard-overridden": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-discard-overridden/-/postcss-discard-overridden-6.0.2.tgz",
+      "integrity": "sha512-j87xzI4LUggC5zND7KdjsI25APtyMuynXZSujByMaav2roV6OZX+8AaCUcZSWqckZpjAjRyFDdpqybgjFO0HJQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-discard-unused": {
+      "version": "6.0.5",
+      "resolved": "https://registry.npmmirror.com/postcss-discard-unused/-/postcss-discard-unused-6.0.5.tgz",
+      "integrity": "sha512-wHalBlRHkaNnNwfC8z+ppX57VhvS+HWgjW508esjdaEYr3Mx7Gnn2xA4R/CKf5+Z9S5qsqC+Uzh4ueENWwCVUA==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-selector-parser": "^6.0.16"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-loader": {
+      "version": "7.3.4",
+      "resolved": "https://registry.npmmirror.com/postcss-loader/-/postcss-loader-7.3.4.tgz",
+      "integrity": "sha512-iW5WTTBSC5BfsBJ9daFMPVrLT36MrNiC6fqOZTTaHjBNX6Pfd5p+hSBqe/fEeNd7pc13QiAyGt7VdGMw4eRC4A==",
+      "license": "MIT",
+      "dependencies": {
+        "cosmiconfig": "^8.3.5",
+        "jiti": "^1.20.0",
+        "semver": "^7.5.4"
+      },
+      "engines": {
+        "node": ">= 14.15.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "postcss": "^7.0.0 || ^8.0.1",
+        "webpack": "^5.0.0"
+      }
+    },
+    "node_modules/postcss-merge-idents": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmmirror.com/postcss-merge-idents/-/postcss-merge-idents-6.0.3.tgz",
+      "integrity": "sha512-1oIoAsODUs6IHQZkLQGO15uGEbK3EAl5wi9SS8hs45VgsxQfMnxvt+L+zIr7ifZFIH14cfAeVe2uCTa+SPRa3g==",
+      "license": "MIT",
+      "dependencies": {
+        "cssnano-utils": "^4.0.2",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-merge-longhand": {
+      "version": "6.0.5",
+      "resolved": "https://registry.npmmirror.com/postcss-merge-longhand/-/postcss-merge-longhand-6.0.5.tgz",
+      "integrity": "sha512-5LOiordeTfi64QhICp07nzzuTDjNSO8g5Ksdibt44d+uvIIAE1oZdRn8y/W5ZtYgRH/lnLDlvi9F8btZcVzu3w==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0",
+        "stylehacks": "^6.1.1"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-merge-rules": {
+      "version": "6.1.1",
+      "resolved": "https://registry.npmmirror.com/postcss-merge-rules/-/postcss-merge-rules-6.1.1.tgz",
+      "integrity": "sha512-KOdWF0gju31AQPZiD+2Ar9Qjowz1LTChSjFFbS+e2sFgc4uHOp3ZvVX4sNeTlk0w2O31ecFGgrFzhO0RSWbWwQ==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.0",
+        "caniuse-api": "^3.0.0",
+        "cssnano-utils": "^4.0.2",
+        "postcss-selector-parser": "^6.0.16"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-minify-font-values": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/postcss-minify-font-values/-/postcss-minify-font-values-6.1.0.tgz",
+      "integrity": "sha512-gklfI/n+9rTh8nYaSJXlCo3nOKqMNkxuGpTn/Qm0gstL3ywTr9/WRKznE+oy6fvfolH6dF+QM4nCo8yPLdvGJg==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-minify-gradients": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmmirror.com/postcss-minify-gradients/-/postcss-minify-gradients-6.0.3.tgz",
+      "integrity": "sha512-4KXAHrYlzF0Rr7uc4VrfwDJ2ajrtNEpNEuLxFgwkhFZ56/7gaE4Nr49nLsQDZyUe+ds+kEhf+YAUolJiYXF8+Q==",
+      "license": "MIT",
+      "dependencies": {
+        "colord": "^2.9.3",
+        "cssnano-utils": "^4.0.2",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-minify-params": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/postcss-minify-params/-/postcss-minify-params-6.1.0.tgz",
+      "integrity": "sha512-bmSKnDtyyE8ujHQK0RQJDIKhQ20Jq1LYiez54WiaOoBtcSuflfK3Nm596LvbtlFcpipMjgClQGyGr7GAs+H1uA==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.0",
+        "cssnano-utils": "^4.0.2",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-minify-selectors": {
+      "version": "6.0.4",
+      "resolved": "https://registry.npmmirror.com/postcss-minify-selectors/-/postcss-minify-selectors-6.0.4.tgz",
+      "integrity": "sha512-L8dZSwNLgK7pjTto9PzWRoMbnLq5vsZSTu8+j1P/2GB8qdtGQfn+K1uSvFgYvgh83cbyxT5m43ZZhUMTJDSClQ==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-selector-parser": "^6.0.16"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-modules-extract-imports": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/postcss-modules-extract-imports/-/postcss-modules-extract-imports-3.1.0.tgz",
+      "integrity": "sha512-k3kNe0aNFQDAZGbin48pL2VNidTF0w4/eASDsxlyspobzU3wZQLOGj7L9gfRe0Jo9/4uud09DsjFNH7winGv8Q==",
+      "license": "ISC",
+      "engines": {
+        "node": "^10 || ^12 || >= 14"
+      },
+      "peerDependencies": {
+        "postcss": "^8.1.0"
+      }
+    },
+    "node_modules/postcss-modules-local-by-default": {
+      "version": "4.0.5",
+      "resolved": "https://registry.npmmirror.com/postcss-modules-local-by-default/-/postcss-modules-local-by-default-4.0.5.tgz",
+      "integrity": "sha512-6MieY7sIfTK0hYfafw1OMEG+2bg8Q1ocHCpoWLqOKj3JXlKu4G7btkmM/B7lFubYkYWmRSPLZi5chid63ZaZYw==",
+      "license": "MIT",
+      "dependencies": {
+        "icss-utils": "^5.0.0",
+        "postcss-selector-parser": "^6.0.2",
+        "postcss-value-parser": "^4.1.0"
+      },
+      "engines": {
+        "node": "^10 || ^12 || >= 14"
+      },
+      "peerDependencies": {
+        "postcss": "^8.1.0"
+      }
+    },
+    "node_modules/postcss-modules-scope": {
+      "version": "3.2.0",
+      "resolved": "https://registry.npmmirror.com/postcss-modules-scope/-/postcss-modules-scope-3.2.0.tgz",
+      "integrity": "sha512-oq+g1ssrsZOsx9M96c5w8laRmvEu9C3adDSjI8oTcbfkrTE8hx/zfyobUoWIxaKPO8bt6S62kxpw5GqypEw1QQ==",
+      "license": "ISC",
+      "dependencies": {
+        "postcss-selector-parser": "^6.0.4"
+      },
+      "engines": {
+        "node": "^10 || ^12 || >= 14"
+      },
+      "peerDependencies": {
+        "postcss": "^8.1.0"
+      }
+    },
+    "node_modules/postcss-modules-values": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/postcss-modules-values/-/postcss-modules-values-4.0.0.tgz",
+      "integrity": "sha512-RDxHkAiEGI78gS2ofyvCsu7iycRv7oqw5xMWn9iMoR0N/7mf9D50ecQqUo5BZ9Zh2vH4bCUR/ktCqbB9m8vJjQ==",
+      "license": "ISC",
+      "dependencies": {
+        "icss-utils": "^5.0.0"
+      },
+      "engines": {
+        "node": "^10 || ^12 || >= 14"
+      },
+      "peerDependencies": {
+        "postcss": "^8.1.0"
+      }
+    },
+    "node_modules/postcss-normalize-charset": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-normalize-charset/-/postcss-normalize-charset-6.0.2.tgz",
+      "integrity": "sha512-a8N9czmdnrjPHa3DeFlwqst5eaL5W8jYu3EBbTTkI5FHkfMhFZh1EGbku6jhHhIzTA6tquI2P42NtZ59M/H/kQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-normalize-display-values": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-normalize-display-values/-/postcss-normalize-display-values-6.0.2.tgz",
+      "integrity": "sha512-8H04Mxsb82ON/aAkPeq8kcBbAtI5Q2a64X/mnRRfPXBq7XeogoQvReqxEfc0B4WPq1KimjezNC8flUtC3Qz6jg==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-normalize-positions": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-normalize-positions/-/postcss-normalize-positions-6.0.2.tgz",
+      "integrity": "sha512-/JFzI441OAB9O7VnLA+RtSNZvQ0NCFZDOtp6QPFo1iIyawyXg0YI3CYM9HBy1WvwCRHnPep/BvI1+dGPKoXx/Q==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-normalize-repeat-style": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-normalize-repeat-style/-/postcss-normalize-repeat-style-6.0.2.tgz",
+      "integrity": "sha512-YdCgsfHkJ2jEXwR4RR3Tm/iOxSfdRt7jplS6XRh9Js9PyCR/aka/FCb6TuHT2U8gQubbm/mPmF6L7FY9d79VwQ==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-normalize-string": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-normalize-string/-/postcss-normalize-string-6.0.2.tgz",
+      "integrity": "sha512-vQZIivlxlfqqMp4L9PZsFE4YUkWniziKjQWUtsxUiVsSSPelQydwS8Wwcuw0+83ZjPWNTl02oxlIvXsmmG+CiQ==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-normalize-timing-functions": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-normalize-timing-functions/-/postcss-normalize-timing-functions-6.0.2.tgz",
+      "integrity": "sha512-a+YrtMox4TBtId/AEwbA03VcJgtyW4dGBizPl7e88cTFULYsprgHWTbfyjSLyHeBcK/Q9JhXkt2ZXiwaVHoMzA==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-normalize-unicode": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/postcss-normalize-unicode/-/postcss-normalize-unicode-6.1.0.tgz",
+      "integrity": "sha512-QVC5TQHsVj33otj8/JD869Ndr5Xcc/+fwRh4HAsFsAeygQQXm+0PySrKbr/8tkDKzW+EVT3QkqZMfFrGiossDg==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.0",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-normalize-url": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-normalize-url/-/postcss-normalize-url-6.0.2.tgz",
+      "integrity": "sha512-kVNcWhCeKAzZ8B4pv/DnrU1wNh458zBNp8dh4y5hhxih5RZQ12QWMuQrDgPRw3LRl8mN9vOVfHl7uhvHYMoXsQ==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-normalize-whitespace": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-normalize-whitespace/-/postcss-normalize-whitespace-6.0.2.tgz",
+      "integrity": "sha512-sXZ2Nj1icbJOKmdjXVT9pnyHQKiSAyuNQHSgRCUgThn2388Y9cGVDR+E9J9iAYbSbLHI+UUwLVl1Wzco/zgv0Q==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-ordered-values": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-ordered-values/-/postcss-ordered-values-6.0.2.tgz",
+      "integrity": "sha512-VRZSOB+JU32RsEAQrO94QPkClGPKJEL/Z9PCBImXMhIeK5KAYo6slP/hBYlLgrCjFxyqvn5VC81tycFEDBLG1Q==",
+      "license": "MIT",
+      "dependencies": {
+        "cssnano-utils": "^4.0.2",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-reduce-idents": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmmirror.com/postcss-reduce-idents/-/postcss-reduce-idents-6.0.3.tgz",
+      "integrity": "sha512-G3yCqZDpsNPoQgbDUy3T0E6hqOQ5xigUtBQyrmq3tn2GxlyiL0yyl7H+T8ulQR6kOcHJ9t7/9H4/R2tv8tJbMA==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-reduce-initial": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/postcss-reduce-initial/-/postcss-reduce-initial-6.1.0.tgz",
+      "integrity": "sha512-RarLgBK/CrL1qZags04oKbVbrrVK2wcxhvta3GCxrZO4zveibqbRPmm2VI8sSgCXwoUHEliRSbOfpR0b/VIoiw==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.0",
+        "caniuse-api": "^3.0.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-reduce-transforms": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-reduce-transforms/-/postcss-reduce-transforms-6.0.2.tgz",
+      "integrity": "sha512-sB+Ya++3Xj1WaT9+5LOOdirAxP7dJZms3GRcYheSPi1PiTMigsxHAdkrbItHxwYHr4kt1zL7mmcHstgMYT+aiA==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-selector-parser": {
+      "version": "6.1.2",
+      "resolved": "https://registry.npmmirror.com/postcss-selector-parser/-/postcss-selector-parser-6.1.2.tgz",
+      "integrity": "sha512-Q8qQfPiZ+THO/3ZrOrO0cJJKfpYCagtMUkXbnEfmgUjwXg6z/WBeOyS9APBBPCTSiDV+s4SwQGu8yFsiMRIudg==",
+      "license": "MIT",
+      "dependencies": {
+        "cssesc": "^3.0.0",
+        "util-deprecate": "^1.0.2"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/postcss-sort-media-queries": {
+      "version": "5.2.0",
+      "resolved": "https://registry.npmmirror.com/postcss-sort-media-queries/-/postcss-sort-media-queries-5.2.0.tgz",
+      "integrity": "sha512-AZ5fDMLD8SldlAYlvi8NIqo0+Z8xnXU2ia0jxmuhxAU+Lqt9K+AlmLNJ/zWEnE9x+Zx3qL3+1K20ATgNOr3fAA==",
+      "license": "MIT",
+      "dependencies": {
+        "sort-css-media-queries": "2.2.0"
+      },
+      "engines": {
+        "node": ">=14.0.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.23"
+      }
+    },
+    "node_modules/postcss-svgo": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmmirror.com/postcss-svgo/-/postcss-svgo-6.0.3.tgz",
+      "integrity": "sha512-dlrahRmxP22bX6iKEjOM+c8/1p+81asjKT+V5lrgOH944ryx/OHpclnIbGsKVd3uWOXFLYJwCVf0eEkJGvO96g==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-value-parser": "^4.2.0",
+        "svgo": "^3.2.0"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >= 18"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-unique-selectors": {
+      "version": "6.0.4",
+      "resolved": "https://registry.npmmirror.com/postcss-unique-selectors/-/postcss-unique-selectors-6.0.4.tgz",
+      "integrity": "sha512-K38OCaIrO8+PzpArzkLKB42dSARtC2tmG6PvD4b1o1Q2E9Os8jzfWFfSy/rixsHwohtsDdFtAWGjFVFUdwYaMg==",
+      "license": "MIT",
+      "dependencies": {
+        "postcss-selector-parser": "^6.0.16"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/postcss-value-parser": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmmirror.com/postcss-value-parser/-/postcss-value-parser-4.2.0.tgz",
+      "integrity": "sha512-1NNCs6uurfkVbeXG4S8JFT9t19m45ICnif8zWLd5oPSZ50QnwMfK+H3jv408d4jw/7Bttv5axS5IiHoLaVNHeQ==",
+      "license": "MIT"
+    },
+    "node_modules/postcss-zindex": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/postcss-zindex/-/postcss-zindex-6.0.2.tgz",
+      "integrity": "sha512-5BxW9l1evPB/4ZIc+2GobEBoKC+h8gPGCMi+jxsYvd2x0mjq7wazk6DrP71pStqxE9Foxh5TVnonbWpFZzXaYg==",
+      "license": "MIT",
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/pretty-error": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/pretty-error/-/pretty-error-4.0.0.tgz",
+      "integrity": "sha512-AoJ5YMAcXKYxKhuJGdcvse+Voc6v1RgnsR3nWcYU7q4t6z0Q6T86sv5Zq8VIRbOWWFpvdGE83LtdSMNd+6Y0xw==",
+      "license": "MIT",
+      "dependencies": {
+        "lodash": "^4.17.20",
+        "renderkid": "^3.0.0"
+      }
+    },
+    "node_modules/pretty-time": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/pretty-time/-/pretty-time-1.1.0.tgz",
+      "integrity": "sha512-28iF6xPQrP8Oa6uxE6a1biz+lWeTOAPKggvjB8HAs6nVMKZwf5bG++632Dx614hIWgUPkgivRfG+a8uAXGTIbA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/prism-react-renderer": {
+      "version": "2.4.0",
+      "resolved": "https://registry.npmmirror.com/prism-react-renderer/-/prism-react-renderer-2.4.0.tgz",
+      "integrity": "sha512-327BsVCD/unU4CNLZTWVHyUHKnsqcvj2qbPlQ8MiBE2eq2rgctjigPA1Gp9HLF83kZ20zNN6jgizHJeEsyFYOw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/prismjs": "^1.26.0",
+        "clsx": "^2.0.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.0.0"
+      }
+    },
+    "node_modules/prismjs": {
+      "version": "1.29.0",
+      "resolved": "https://registry.npmmirror.com/prismjs/-/prismjs-1.29.0.tgz",
+      "integrity": "sha512-Kx/1w86q/epKcmte75LNrEoT+lX8pBpavuAbvJWRXar7Hz8jrtF+e3vY751p0R8H9HdArwaCTNDDzHg/ScJK1Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/process-nextick-args": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/process-nextick-args/-/process-nextick-args-2.0.1.tgz",
+      "integrity": "sha512-3ouUOpQhtgrbOa17J7+uxOTpITYWaGP7/AhoR3+A+/1e9skrzelGi/dXzEYyvbxubEF6Wn2ypscTKiKJFFn1ag==",
+      "license": "MIT"
+    },
+    "node_modules/prompts": {
+      "version": "2.4.2",
+      "resolved": "https://registry.npmmirror.com/prompts/-/prompts-2.4.2.tgz",
+      "integrity": "sha512-NxNv/kLguCA7p3jE8oL2aEBsrJWgAakBpgmgK6lpPWV+WuOmY6r2/zbAVnP+T8bQlA0nzHXSJSJW0Hq7ylaD2Q==",
+      "license": "MIT",
+      "dependencies": {
+        "kleur": "^3.0.3",
+        "sisteransi": "^1.0.5"
+      },
+      "engines": {
+        "node": ">= 6"
+      }
+    },
+    "node_modules/prop-types": {
+      "version": "15.8.1",
+      "resolved": "https://registry.npmmirror.com/prop-types/-/prop-types-15.8.1.tgz",
+      "integrity": "sha512-oj87CgZICdulUohogVAR7AjlC0327U4el4L6eAvOqCeudMDVU0NThNaV+b9Df4dXgSP1gXMTnPdhfe/2qDH5cg==",
+      "license": "MIT",
+      "dependencies": {
+        "loose-envify": "^1.4.0",
+        "object-assign": "^4.1.1",
+        "react-is": "^16.13.1"
+      }
+    },
+    "node_modules/property-information": {
+      "version": "6.5.0",
+      "resolved": "https://registry.npmmirror.com/property-information/-/property-information-6.5.0.tgz",
+      "integrity": "sha512-PgTgs/BlvHxOu8QuEN7wi5A0OmXaBcHpmCSTehcs6Uuu9IkDIEo13Hy7n898RHfrQ49vKCoGeWZSaAK01nwVig==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/proto-list": {
+      "version": "1.2.4",
+      "resolved": "https://registry.npmmirror.com/proto-list/-/proto-list-1.2.4.tgz",
+      "integrity": "sha512-vtK/94akxsTMhe0/cbfpR+syPuszcuwhqVjJq26CuNDgFGj682oRBXOP5MJpv2r7JtE8MsiepGIqvvOTBwn2vA==",
+      "license": "ISC"
+    },
+    "node_modules/proxy-addr": {
+      "version": "2.0.7",
+      "resolved": "https://registry.npmmirror.com/proxy-addr/-/proxy-addr-2.0.7.tgz",
+      "integrity": "sha512-llQsMLSUDUPT44jdrU/O37qlnifitDP+ZwrmmZcoSKyLKvtZxpyV0n2/bD/N4tBAAZ/gJEdZU7KMraoK1+XYAg==",
+      "license": "MIT",
+      "dependencies": {
+        "forwarded": "0.2.0",
+        "ipaddr.js": "1.9.1"
+      },
+      "engines": {
+        "node": ">= 0.10"
+      }
+    },
+    "node_modules/proxy-addr/node_modules/ipaddr.js": {
+      "version": "1.9.1",
+      "resolved": "https://registry.npmmirror.com/ipaddr.js/-/ipaddr.js-1.9.1.tgz",
+      "integrity": "sha512-0KI/607xoxSToH7GjN1FfSbLoU0+btTicjsQSWQlh/hZykN8KpmMf7uYwPW3R+akZ6R/w18ZlXSHBYXiYUPO3g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.10"
+      }
+    },
+    "node_modules/punycode": {
+      "version": "1.4.1",
+      "resolved": "https://registry.npmmirror.com/punycode/-/punycode-1.4.1.tgz",
+      "integrity": "sha512-jmYNElW7yvO7TV33CjSmvSiE2yco3bV2czu/OzDKdMNVZQWfxCblURLhf+47syQRBntjfLdd/H0egrzIG+oaFQ==",
+      "license": "MIT"
+    },
+    "node_modules/pupa": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/pupa/-/pupa-3.1.0.tgz",
+      "integrity": "sha512-FLpr4flz5xZTSJxSeaheeMKN/EDzMdK7b8PTOC6a5PYFKTucWbdqjgqaEyH0shFiSJrVB1+Qqi4Tk19ccU6Aug==",
+      "license": "MIT",
+      "dependencies": {
+        "escape-goat": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=12.20"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/qs": {
+      "version": "6.13.0",
+      "resolved": "https://registry.npmmirror.com/qs/-/qs-6.13.0.tgz",
+      "integrity": "sha512-+38qI9SOr8tfZ4QmJNplMUxqjbe7LKvvZgWdExBOmd+egZTtjLB67Gu0HRX3u/XOq7UU2Nx6nsjvS16Z9uwfpg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "side-channel": "^1.0.6"
+      },
+      "engines": {
+        "node": ">=0.6"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/queue": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/queue/-/queue-6.0.2.tgz",
+      "integrity": "sha512-iHZWu+q3IdFZFX36ro/lKBkSvfkztY5Y7HMiPlOUjhupPcG2JMfst2KKEpu5XndviX/3UhFbRngUPNKtgvtZiA==",
+      "license": "MIT",
+      "dependencies": {
+        "inherits": "~2.0.3"
+      }
+    },
+    "node_modules/queue-microtask": {
+      "version": "1.2.3",
+      "resolved": "https://registry.npmmirror.com/queue-microtask/-/queue-microtask-1.2.3.tgz",
+      "integrity": "sha512-NuaNSa6flKT5JaSYQzJok04JzTL1CA6aGhv5rfLW3PgqA+M2ChpZQnAC8h8i4ZFkBS8X5RqkDBHA7r4hej3K9A==",
+      "funding": [
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/feross"
+        },
+        {
+          "type": "patreon",
+          "url": "https://www.patreon.com/feross"
+        },
+        {
+          "type": "consulting",
+          "url": "https://feross.org/support"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/quick-lru": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmmirror.com/quick-lru/-/quick-lru-5.1.1.tgz",
+      "integrity": "sha512-WuyALRjWPDGtt/wzJiadO5AXY+8hZ80hVpe6MyivgraREW751X3SbhRvG3eLKOYN+8VEvqLcf3wdnt44Z4S4SA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/randombytes": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/randombytes/-/randombytes-2.1.0.tgz",
+      "integrity": "sha512-vYl3iOX+4CKUWuxGi9Ukhie6fsqXqS9FE2Zaic4tNFD2N2QQaXOMFbuKK4QmDHC0JO6B1Zp41J0LpT0oR68amQ==",
+      "license": "MIT",
+      "dependencies": {
+        "safe-buffer": "^5.1.0"
+      }
+    },
+    "node_modules/range-parser": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmmirror.com/range-parser/-/range-parser-1.2.0.tgz",
+      "integrity": "sha512-kA5WQoNVo4t9lNx2kQNFCxKeBl5IbbSNBl1M/tLkw9WCn+hxNBAW5Qh8gdhs63CJnhjJ2zQWFoqPJP2sK1AV5A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/raw-body": {
+      "version": "2.5.2",
+      "resolved": "https://registry.npmmirror.com/raw-body/-/raw-body-2.5.2.tgz",
+      "integrity": "sha512-8zGqypfENjCIqGhgXToC8aB2r7YrBX+AQAfIPs/Mlk+BtPTztOvTS01NRW/3Eh60J+a48lt8qsCzirQ6loCVfA==",
+      "license": "MIT",
+      "dependencies": {
+        "bytes": "3.1.2",
+        "http-errors": "2.0.0",
+        "iconv-lite": "0.4.24",
+        "unpipe": "1.0.0"
+      },
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/raw-body/node_modules/bytes": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmmirror.com/bytes/-/bytes-3.1.2.tgz",
+      "integrity": "sha512-/Nf7TyzTx6S3yRJObOAV7956r8cr2+Oj8AC5dt8wSP3BQAoeX58NoHyCU8P8zGkNXStjTSi6fzO6F0pBdcYbEg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/rc": {
+      "version": "1.2.8",
+      "resolved": "https://registry.npmmirror.com/rc/-/rc-1.2.8.tgz",
+      "integrity": "sha512-y3bGgqKj3QBdxLbLkomlohkvsA8gdAiUQlSBJnBhfn+BPxg4bc62d8TcBW15wavDfgexCgccckhcZvywyQYPOw==",
+      "license": "(BSD-2-Clause OR MIT OR Apache-2.0)",
+      "dependencies": {
+        "deep-extend": "^0.6.0",
+        "ini": "~1.3.0",
+        "minimist": "^1.2.0",
+        "strip-json-comments": "~2.0.1"
+      },
+      "bin": {
+        "rc": "cli.js"
+      }
+    },
+    "node_modules/rc-cascader": {
+      "version": "3.28.2",
+      "resolved": "https://registry.npmmirror.com/rc-cascader/-/rc-cascader-3.28.2.tgz",
+      "integrity": "sha512-8f+JgM83iLTvjgdkgU7GfI4qY8icXOBP0cGZjOdx2iJAkEe8ucobxDQAVE69UD/c3ehCxZlcgEHeD5hFmypbUw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.12.5",
+        "array-tree-filter": "^2.1.0",
+        "classnames": "^2.3.1",
+        "rc-select": "~14.15.0",
+        "rc-tree": "~5.9.0",
+        "rc-util": "^5.37.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-checkbox": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmmirror.com/rc-checkbox/-/rc-checkbox-3.3.0.tgz",
+      "integrity": "sha512-Ih3ZaAcoAiFKJjifzwsGiT/f/quIkxJoklW4yKGho14Olulwn8gN7hOBve0/WGDg5o/l/5mL0w7ff7/YGvefVw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "^2.3.2",
+        "rc-util": "^5.25.2"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-collapse": {
+      "version": "3.8.0",
+      "resolved": "https://registry.npmmirror.com/rc-collapse/-/rc-collapse-3.8.0.tgz",
+      "integrity": "sha512-YVBkssrKPBG09TGfcWWGj8zJBYD9G3XuTy89t5iUmSXrIXEAnO1M+qjUxRW6b4Qi0+wNWG6MHJF/+US+nmIlzA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "2.x",
+        "rc-motion": "^2.3.4",
+        "rc-util": "^5.27.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-dialog": {
+      "version": "9.6.0",
+      "resolved": "https://registry.npmmirror.com/rc-dialog/-/rc-dialog-9.6.0.tgz",
+      "integrity": "sha512-ApoVi9Z8PaCQg6FsUzS8yvBEQy0ZL2PkuvAgrmohPkN3okps5WZ5WQWPc1RNuiOKaAYv8B97ACdsFU5LizzCqg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "@rc-component/portal": "^1.0.0-8",
+        "classnames": "^2.2.6",
+        "rc-motion": "^2.3.0",
+        "rc-util": "^5.21.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-drawer": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmmirror.com/rc-drawer/-/rc-drawer-7.2.0.tgz",
+      "integrity": "sha512-9lOQ7kBekEJRdEpScHvtmEtXnAsy+NGDXiRWc2ZVC7QXAazNVbeT4EraQKYwCME8BJLa8Bxqxvs5swwyOepRwg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.23.9",
+        "@rc-component/portal": "^1.1.1",
+        "classnames": "^2.2.6",
+        "rc-motion": "^2.6.1",
+        "rc-util": "^5.38.1"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-dropdown": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmmirror.com/rc-dropdown/-/rc-dropdown-4.2.0.tgz",
+      "integrity": "sha512-odM8Ove+gSh0zU27DUj5cG1gNKg7mLWBYzB5E4nNLrLwBmYEgYP43vHKDGOVZcJSVElQBI0+jTQgjnq0NfLjng==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.18.3",
+        "@rc-component/trigger": "^2.0.0",
+        "classnames": "^2.2.6",
+        "rc-util": "^5.17.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.11.0",
+        "react-dom": ">=16.11.0"
+      }
+    },
+    "node_modules/rc-field-form": {
+      "version": "2.4.0",
+      "resolved": "https://registry.npmmirror.com/rc-field-form/-/rc-field-form-2.4.0.tgz",
+      "integrity": "sha512-XZ/lF9iqf9HXApIHQHqzJK5v2w4mkUMsVqAzOyWVzoiwwXEavY6Tpuw7HavgzIoD+huVff4JghSGcgEfX6eycg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.18.0",
+        "@rc-component/async-validator": "^5.0.3",
+        "rc-util": "^5.32.2"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-image": {
+      "version": "7.11.0",
+      "resolved": "https://registry.npmmirror.com/rc-image/-/rc-image-7.11.0.tgz",
+      "integrity": "sha512-aZkTEZXqeqfPZtnSdNUnKQA0N/3MbgR7nUnZ+/4MfSFWPFHZau4p5r5ShaI0KPEMnNjv4kijSCFq/9wtJpwykw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.11.2",
+        "@rc-component/portal": "^1.0.2",
+        "classnames": "^2.2.6",
+        "rc-dialog": "~9.6.0",
+        "rc-motion": "^2.6.2",
+        "rc-util": "^5.34.1"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-input": {
+      "version": "1.6.3",
+      "resolved": "https://registry.npmmirror.com/rc-input/-/rc-input-1.6.3.tgz",
+      "integrity": "sha512-wI4NzuqBS8vvKr8cljsvnTUqItMfG1QbJoxovCgL+DX4eVUcHIjVwharwevIxyy7H/jbLryh+K7ysnJr23aWIA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.11.1",
+        "classnames": "^2.2.1",
+        "rc-util": "^5.18.1"
+      },
+      "peerDependencies": {
+        "react": ">=16.0.0",
+        "react-dom": ">=16.0.0"
+      }
+    },
+    "node_modules/rc-input-number": {
+      "version": "9.2.0",
+      "resolved": "https://registry.npmmirror.com/rc-input-number/-/rc-input-number-9.2.0.tgz",
+      "integrity": "sha512-5XZFhBCV5f9UQ62AZ2hFbEY8iZT/dm23Q1kAg0H8EvOgD3UDbYYJAayoVIkM3lQaCqYAW5gV0yV3vjw1XtzWHg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "@rc-component/mini-decimal": "^1.0.1",
+        "classnames": "^2.2.5",
+        "rc-input": "~1.6.0",
+        "rc-util": "^5.40.1"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-mentions": {
+      "version": "2.16.1",
+      "resolved": "https://registry.npmmirror.com/rc-mentions/-/rc-mentions-2.16.1.tgz",
+      "integrity": "sha512-GnhSTGP9Mtv6pqFFGQze44LlrtWOjHNrUUAcsdo9DnNAhN4pwVPEWy4z+2jpjkiGlJ3VoXdvMHcNDQdfI9fEaw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.22.5",
+        "@rc-component/trigger": "^2.0.0",
+        "classnames": "^2.2.6",
+        "rc-input": "~1.6.0",
+        "rc-menu": "~9.15.1",
+        "rc-textarea": "~1.8.0",
+        "rc-util": "^5.34.1"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-menu": {
+      "version": "9.15.1",
+      "resolved": "https://registry.npmmirror.com/rc-menu/-/rc-menu-9.15.1.tgz",
+      "integrity": "sha512-UKporqU6LPfHnpPmtP6hdEK4iO5Q+b7BRv/uRpxdIyDGplZy9jwUjsnpev5bs3PQKB0H0n34WAPDfjAfn3kAPA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "@rc-component/trigger": "^2.0.0",
+        "classnames": "2.x",
+        "rc-motion": "^2.4.3",
+        "rc-overflow": "^1.3.1",
+        "rc-util": "^5.27.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-motion": {
+      "version": "2.9.3",
+      "resolved": "https://registry.npmmirror.com/rc-motion/-/rc-motion-2.9.3.tgz",
+      "integrity": "sha512-rkW47ABVkic7WEB0EKJqzySpvDqwl60/tdkY7hWP7dYnh5pm0SzJpo54oW3TDUGXV5wfxXFmMkxrzRRbotQ0+w==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.11.1",
+        "classnames": "^2.2.1",
+        "rc-util": "^5.43.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-notification": {
+      "version": "5.6.2",
+      "resolved": "https://registry.npmmirror.com/rc-notification/-/rc-notification-5.6.2.tgz",
+      "integrity": "sha512-Id4IYMoii3zzrG0lB0gD6dPgJx4Iu95Xu0BQrhHIbp7ZnAZbLqdqQ73aIWH0d0UFcElxwaKjnzNovTjo7kXz7g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "2.x",
+        "rc-motion": "^2.9.0",
+        "rc-util": "^5.20.1"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-overflow": {
+      "version": "1.3.2",
+      "resolved": "https://registry.npmmirror.com/rc-overflow/-/rc-overflow-1.3.2.tgz",
+      "integrity": "sha512-nsUm78jkYAoPygDAcGZeC2VwIg/IBGSodtOY3pMof4W3M9qRJgqaDYm03ZayHlde3I6ipliAxbN0RUcGf5KOzw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.11.1",
+        "classnames": "^2.2.1",
+        "rc-resize-observer": "^1.0.0",
+        "rc-util": "^5.37.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-pagination": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmmirror.com/rc-pagination/-/rc-pagination-4.3.0.tgz",
+      "integrity": "sha512-UubEWA0ShnroQ1tDa291Fzw6kj0iOeF26IsUObxYTpimgj4/qPCWVFl18RLZE+0Up1IZg0IK4pMn6nB3mjvB7g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "^2.3.2",
+        "rc-util": "^5.38.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-picker": {
+      "version": "4.6.15",
+      "resolved": "https://registry.npmmirror.com/rc-picker/-/rc-picker-4.6.15.tgz",
+      "integrity": "sha512-OWZ1yrMie+KN2uEUfYCfS4b2Vu6RC1FWwNI0s+qypsc3wRt7g+peuZKVIzXCTaJwyyZruo80+akPg2+GmyiJjw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.24.7",
+        "@rc-component/trigger": "^2.0.0",
+        "classnames": "^2.2.1",
+        "rc-overflow": "^1.3.2",
+        "rc-resize-observer": "^1.4.0",
+        "rc-util": "^5.43.0"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "date-fns": ">= 2.x",
+        "dayjs": ">= 1.x",
+        "luxon": ">= 3.x",
+        "moment": ">= 2.x",
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      },
+      "peerDependenciesMeta": {
+        "date-fns": {
+          "optional": true
+        },
+        "dayjs": {
+          "optional": true
+        },
+        "luxon": {
+          "optional": true
+        },
+        "moment": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/rc-progress": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/rc-progress/-/rc-progress-4.0.0.tgz",
+      "integrity": "sha512-oofVMMafOCokIUIBnZLNcOZFsABaUw8PPrf1/y0ZBvKZNpOiu5h4AO9vv11Sw0p4Hb3D0yGWuEattcQGtNJ/aw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "^2.2.6",
+        "rc-util": "^5.16.1"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-rate": {
+      "version": "2.13.0",
+      "resolved": "https://registry.npmmirror.com/rc-rate/-/rc-rate-2.13.0.tgz",
+      "integrity": "sha512-oxvx1Q5k5wD30sjN5tqAyWTvJfLNNJn7Oq3IeS4HxWfAiC4BOXMITNAsw7u/fzdtO4MS8Ki8uRLOzcnEuoQiAw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "^2.2.5",
+        "rc-util": "^5.0.1"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-resize-observer": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmmirror.com/rc-resize-observer/-/rc-resize-observer-1.4.0.tgz",
+      "integrity": "sha512-PnMVyRid9JLxFavTjeDXEXo65HCRqbmLBw9xX9gfC4BZiSzbLXKzW3jPz+J0P71pLbD5tBMTT+mkstV5gD0c9Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.20.7",
+        "classnames": "^2.2.1",
+        "rc-util": "^5.38.0",
+        "resize-observer-polyfill": "^1.5.1"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-segmented": {
+      "version": "2.5.0",
+      "resolved": "https://registry.npmmirror.com/rc-segmented/-/rc-segmented-2.5.0.tgz",
+      "integrity": "sha512-B28Fe3J9iUFOhFJET3RoXAPFJ2u47QvLSYcZWC4tFYNGPEjug5LAxEasZlA/PpAxhdOPqGWsGbSj7ftneukJnw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.11.1",
+        "classnames": "^2.2.1",
+        "rc-motion": "^2.4.4",
+        "rc-util": "^5.17.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.0.0",
+        "react-dom": ">=16.0.0"
+      }
+    },
+    "node_modules/rc-select": {
+      "version": "14.15.2",
+      "resolved": "https://registry.npmmirror.com/rc-select/-/rc-select-14.15.2.tgz",
+      "integrity": "sha512-oNoXlaFmpqXYcQDzcPVLrEqS2J9c+/+oJuGrlXeVVX/gVgrbHa5YcyiRUXRydFjyuA7GP3elRuLF7Y3Tfwltlw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "@rc-component/trigger": "^2.1.1",
+        "classnames": "2.x",
+        "rc-motion": "^2.0.1",
+        "rc-overflow": "^1.3.1",
+        "rc-util": "^5.16.1",
+        "rc-virtual-list": "^3.5.2"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": "*",
+        "react-dom": "*"
+      }
+    },
+    "node_modules/rc-slider": {
+      "version": "11.1.7",
+      "resolved": "https://registry.npmmirror.com/rc-slider/-/rc-slider-11.1.7.tgz",
+      "integrity": "sha512-ytYbZei81TX7otdC0QvoYD72XSlxvTihNth5OeZ6PMXyEDq/vHdWFulQmfDGyXK1NwKwSlKgpvINOa88uT5g2A==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "^2.2.5",
+        "rc-util": "^5.36.0"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-steps": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmmirror.com/rc-steps/-/rc-steps-6.0.1.tgz",
+      "integrity": "sha512-lKHL+Sny0SeHkQKKDJlAjV5oZ8DwCdS2hFhAkIjuQt1/pB81M0cA0ErVFdHq9+jmPmFw1vJB2F5NBzFXLJxV+g==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.16.7",
+        "classnames": "^2.2.3",
+        "rc-util": "^5.16.1"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-switch": {
+      "version": "4.1.0",
+      "resolved": "https://registry.npmmirror.com/rc-switch/-/rc-switch-4.1.0.tgz",
+      "integrity": "sha512-TI8ufP2Az9oEbvyCeVE4+90PDSljGyuwix3fV58p7HV2o4wBnVToEyomJRVyTaZeqNPAp+vqeo4Wnj5u0ZZQBg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.21.0",
+        "classnames": "^2.2.1",
+        "rc-util": "^5.30.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-table": {
+      "version": "7.47.5",
+      "resolved": "https://registry.npmmirror.com/rc-table/-/rc-table-7.47.5.tgz",
+      "integrity": "sha512-fzq+V9j/atbPIcvs3emuclaEoXulwQpIiJA6/7ey52j8+9cJ4P8DGmp4YzfUVDrb3qhgedcVeD6eRgUrokwVEQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "@rc-component/context": "^1.4.0",
+        "classnames": "^2.2.5",
+        "rc-resize-observer": "^1.1.0",
+        "rc-util": "^5.41.0",
+        "rc-virtual-list": "^3.14.2"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-tabs": {
+      "version": "15.3.0",
+      "resolved": "https://registry.npmmirror.com/rc-tabs/-/rc-tabs-15.3.0.tgz",
+      "integrity": "sha512-lzE18r+zppT/jZWOAWS6ntdkDUKHOLJzqMi5UAij1LeKwOaQaupupAoI9Srn73GRzVpmGznkECMRrzkRusC40A==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.11.2",
+        "classnames": "2.x",
+        "rc-dropdown": "~4.2.0",
+        "rc-menu": "~9.15.1",
+        "rc-motion": "^2.6.2",
+        "rc-resize-observer": "^1.0.0",
+        "rc-util": "^5.34.1"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-textarea": {
+      "version": "1.8.2",
+      "resolved": "https://registry.npmmirror.com/rc-textarea/-/rc-textarea-1.8.2.tgz",
+      "integrity": "sha512-UFAezAqltyR00a8Lf0IPAyTd29Jj9ee8wt8DqXyDMal7r/Cg/nDt3e1OOv3Th4W6mKaZijjgwuPXhAfVNTN8sw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "^2.2.1",
+        "rc-input": "~1.6.0",
+        "rc-resize-observer": "^1.0.0",
+        "rc-util": "^5.27.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-tooltip": {
+      "version": "6.2.1",
+      "resolved": "https://registry.npmmirror.com/rc-tooltip/-/rc-tooltip-6.2.1.tgz",
+      "integrity": "sha512-rws0duD/3sHHsD905Nex7FvoUGy2UBQRhTkKxeEvr2FB+r21HsOxcDJI0TzyO8NHhnAA8ILr8pfbSBg5Jj5KBg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.11.2",
+        "@rc-component/trigger": "^2.0.0",
+        "classnames": "^2.3.1"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-tree": {
+      "version": "5.9.0",
+      "resolved": "https://registry.npmmirror.com/rc-tree/-/rc-tree-5.9.0.tgz",
+      "integrity": "sha512-CPrgOvm9d/9E+izTONKSngNzQdIEjMox2PBufWjS1wf7vxtvmCWzK1SlpHbRY6IaBfJIeZ+88RkcIevf729cRg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "2.x",
+        "rc-motion": "^2.0.1",
+        "rc-util": "^5.16.1",
+        "rc-virtual-list": "^3.5.1"
+      },
+      "engines": {
+        "node": ">=10.x"
+      },
+      "peerDependencies": {
+        "react": "*",
+        "react-dom": "*"
+      }
+    },
+    "node_modules/rc-tree-select": {
+      "version": "5.23.0",
+      "resolved": "https://registry.npmmirror.com/rc-tree-select/-/rc-tree-select-5.23.0.tgz",
+      "integrity": "sha512-aQGi2tFSRw1WbXv0UVXPzHm09E0cSvUVZMLxQtMv3rnZZpNmdRXWrnd9QkLNlVH31F+X5rgghmdSFF3yZW0N9A==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.1",
+        "classnames": "2.x",
+        "rc-select": "~14.15.0",
+        "rc-tree": "~5.9.0",
+        "rc-util": "^5.16.1"
+      },
+      "peerDependencies": {
+        "react": "*",
+        "react-dom": "*"
+      }
+    },
+    "node_modules/rc-upload": {
+      "version": "4.8.1",
+      "resolved": "https://registry.npmmirror.com/rc-upload/-/rc-upload-4.8.1.tgz",
+      "integrity": "sha512-toEAhwl4hjLAI1u8/CgKWt30BR06ulPa4iGQSMvSXoHzO88gPCslxqV/mnn4gJU7PDoltGIC9Eh+wkeudqgHyw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.18.3",
+        "classnames": "^2.2.5",
+        "rc-util": "^5.2.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-util": {
+      "version": "5.43.0",
+      "resolved": "https://registry.npmmirror.com/rc-util/-/rc-util-5.43.0.tgz",
+      "integrity": "sha512-AzC7KKOXFqAdIBqdGWepL9Xn7cm3vnAmjlHqUnoQaTMZYhM4VlXGLkkHHxj/BZ7Td0+SOPKB4RGPboBVKT9htw==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.18.3",
+        "react-is": "^18.2.0"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc-util/node_modules/react-is": {
+      "version": "18.3.1",
+      "resolved": "https://registry.npmmirror.com/react-is/-/react-is-18.3.1.tgz",
+      "integrity": "sha512-/LLMVyas0ljjAtoYiPqYiL8VWXzUUdThrmU5+n20DZv+a+ClRoevUzw5JxU+Ieh5/c87ytoTBV9G1FiKfNJdmg==",
+      "license": "MIT"
+    },
+    "node_modules/rc-virtual-list": {
+      "version": "3.14.8",
+      "resolved": "https://registry.npmmirror.com/rc-virtual-list/-/rc-virtual-list-3.14.8.tgz",
+      "integrity": "sha512-8D0KfzpRYi6YZvlOWIxiOm9BGt4Wf2hQyEaM6RXlDDiY2NhLheuYI+RA+7ZaZj1lq+XQqy3KHlaeeXQfzI5fGg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.20.0",
+        "classnames": "^2.2.6",
+        "rc-resize-observer": "^1.0.0",
+        "rc-util": "^5.36.0"
+      },
+      "engines": {
+        "node": ">=8.x"
+      },
+      "peerDependencies": {
+        "react": ">=16.9.0",
+        "react-dom": ">=16.9.0"
+      }
+    },
+    "node_modules/rc/node_modules/strip-json-comments": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/strip-json-comments/-/strip-json-comments-2.0.1.tgz",
+      "integrity": "sha512-4gB8na07fecVVkOI6Rs4e7T6NOTki5EmL7TUduTs6bu3EdnSycntVJ4re8kgZA+wx9IueI2Y11bfbgwtzuE0KQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/react": {
+      "version": "18.3.1",
+      "resolved": "https://registry.npmmirror.com/react/-/react-18.3.1.tgz",
+      "integrity": "sha512-wS+hAgJShR0KhEvPJArfuPVN1+Hz1t0Y6n5jLrGQbkb4urgPE/0Rve+1kMB1v/oWgHgm4WIcV+i7F2pTVj+2iQ==",
+      "license": "MIT",
+      "dependencies": {
+        "loose-envify": "^1.1.0"
+      },
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/react-dev-utils": {
+      "version": "12.0.1",
+      "resolved": "https://registry.npmmirror.com/react-dev-utils/-/react-dev-utils-12.0.1.tgz",
+      "integrity": "sha512-84Ivxmr17KjUupyqzFode6xKhjwuEJDROWKJy/BthkL7Wn6NJ8h4WE6k/exAv6ImS+0oZLRRW5j/aINMHyeGeQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/code-frame": "^7.16.0",
+        "address": "^1.1.2",
+        "browserslist": "^4.18.1",
+        "chalk": "^4.1.2",
+        "cross-spawn": "^7.0.3",
+        "detect-port-alt": "^1.1.6",
+        "escape-string-regexp": "^4.0.0",
+        "filesize": "^8.0.6",
+        "find-up": "^5.0.0",
+        "fork-ts-checker-webpack-plugin": "^6.5.0",
+        "global-modules": "^2.0.0",
+        "globby": "^11.0.4",
+        "gzip-size": "^6.0.0",
+        "immer": "^9.0.7",
+        "is-root": "^2.1.0",
+        "loader-utils": "^3.2.0",
+        "open": "^8.4.0",
+        "pkg-up": "^3.1.0",
+        "prompts": "^2.4.2",
+        "react-error-overlay": "^6.0.11",
+        "recursive-readdir": "^2.2.2",
+        "shell-quote": "^1.7.3",
+        "strip-ansi": "^6.0.1",
+        "text-table": "^0.2.0"
+      },
+      "engines": {
+        "node": ">=14"
+      }
+    },
+    "node_modules/react-dev-utils/node_modules/find-up": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmmirror.com/find-up/-/find-up-5.0.0.tgz",
+      "integrity": "sha512-78/PXT1wlLLDgTzDs7sjq9hzz0vXD+zn+7wypEe4fXQxCmdmqfGsEPQxmiCSQI3ajFV91bVSsvNtrJRiW6nGng==",
+      "license": "MIT",
+      "dependencies": {
+        "locate-path": "^6.0.0",
+        "path-exists": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/react-dev-utils/node_modules/loader-utils": {
+      "version": "3.3.1",
+      "resolved": "https://registry.npmmirror.com/loader-utils/-/loader-utils-3.3.1.tgz",
+      "integrity": "sha512-FMJTLMXfCLMLfJxcX9PFqX5qD88Z5MRGaZCVzfuqeZSPsyiBzs+pahDQjbIWz2QIzPZz0NX9Zy4FX3lmK6YHIg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 12.13.0"
+      }
+    },
+    "node_modules/react-dev-utils/node_modules/locate-path": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmmirror.com/locate-path/-/locate-path-6.0.0.tgz",
+      "integrity": "sha512-iPZK6eYjbxRu3uB4/WZ3EsEIMJFMqAoopl3R+zuq0UjcAm/MO6KCweDgPfP3elTztoKP3KtnVHxTn2NHBSDVUw==",
+      "license": "MIT",
+      "dependencies": {
+        "p-locate": "^5.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/react-dev-utils/node_modules/p-limit": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/p-limit/-/p-limit-3.1.0.tgz",
+      "integrity": "sha512-TYOanM3wGwNGsZN2cVTYPArw454xnXj5qmWF1bEoAc4+cU/ol7GVh7odevjp1FNHduHc3KZMcFduxU5Xc6uJRQ==",
+      "license": "MIT",
+      "dependencies": {
+        "yocto-queue": "^0.1.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/react-dev-utils/node_modules/p-locate": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmmirror.com/p-locate/-/p-locate-5.0.0.tgz",
+      "integrity": "sha512-LaNjtRWUBY++zB5nE/NwcaoMylSPk+S+ZHNB1TzdbMJMny6dynpAGt7X/tl/QYq3TIeE6nxHppbo2LGymrG5Pw==",
+      "license": "MIT",
+      "dependencies": {
+        "p-limit": "^3.0.2"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/react-dev-utils/node_modules/path-exists": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/path-exists/-/path-exists-4.0.0.tgz",
+      "integrity": "sha512-ak9Qy5Q7jYb2Wwcey5Fpvg2KoAc/ZIhLSLOSBmRmygPsGwkVVt0fZa0qrtMz+m6tJTAHfZQ8FnmB4MG4LWy7/w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/react-dev-utils/node_modules/yocto-queue": {
+      "version": "0.1.0",
+      "resolved": "https://registry.npmmirror.com/yocto-queue/-/yocto-queue-0.1.0.tgz",
+      "integrity": "sha512-rVksvsnNCdJ/ohGc6xgPwyN8eheCxsiLM8mxuE/t/mOVqJewPuO1miLpTHQiRgTKCLexL4MeAFVagts7HmNZ2Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/react-dom": {
+      "version": "18.3.1",
+      "resolved": "https://registry.npmmirror.com/react-dom/-/react-dom-18.3.1.tgz",
+      "integrity": "sha512-5m4nQKp+rZRb09LNH59GM4BxTh9251/ylbKIbpe7TpGxfJ+9kv6BLkLBXIjjspbgbnIBNqlI23tRnTWT0snUIw==",
+      "license": "MIT",
+      "dependencies": {
+        "loose-envify": "^1.1.0",
+        "scheduler": "^0.23.2"
+      },
+      "peerDependencies": {
+        "react": "^18.3.1"
+      }
+    },
+    "node_modules/react-error-overlay": {
+      "version": "6.0.11",
+      "resolved": "https://registry.npmmirror.com/react-error-overlay/-/react-error-overlay-6.0.11.tgz",
+      "integrity": "sha512-/6UZ2qgEyH2aqzYZgQPxEnz33NJ2gNsnHA2o5+o4wW9bLM/JYQitNP9xPhsXwC08hMMovfGe/8retsdDsczPRg==",
+      "license": "MIT"
+    },
+    "node_modules/react-fast-compare": {
+      "version": "3.2.2",
+      "resolved": "https://registry.npmmirror.com/react-fast-compare/-/react-fast-compare-3.2.2.tgz",
+      "integrity": "sha512-nsO+KSNgo1SbJqJEYRE9ERzo7YtYbou/OqjSQKxV7jcKox7+usiUVZOAC+XnDOABXggQTno0Y1CpVnuWEc1boQ==",
+      "license": "MIT"
+    },
+    "node_modules/react-helmet-async": {
+      "version": "1.3.0",
+      "resolved": "https://registry.npmmirror.com/react-helmet-async/-/react-helmet-async-1.3.0.tgz",
+      "integrity": "sha512-9jZ57/dAn9t3q6hneQS0wukqC2ENOBgMNVEhb/ZG9ZSxUetzVIw4iAmEU38IaVg3QGYauQPhSeUTuIUtFglWpg==",
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@babel/runtime": "^7.12.5",
+        "invariant": "^2.2.4",
+        "prop-types": "^15.7.2",
+        "react-fast-compare": "^3.2.0",
+        "shallowequal": "^1.1.0"
+      },
+      "peerDependencies": {
+        "react": "^16.6.0 || ^17.0.0 || ^18.0.0",
+        "react-dom": "^16.6.0 || ^17.0.0 || ^18.0.0"
+      }
+    },
+    "node_modules/react-is": {
+      "version": "16.13.1",
+      "resolved": "https://registry.npmmirror.com/react-is/-/react-is-16.13.1.tgz",
+      "integrity": "sha512-24e6ynE2H+OKt4kqsOvNd8kBpV65zoxbA4BVsEOB3ARVWQki/DHzaUoC5KuON/BiccDaCCTZBuOcfZs70kR8bQ==",
+      "license": "MIT"
+    },
+    "node_modules/react-json-view-lite": {
+      "version": "1.5.0",
+      "resolved": "https://registry.npmmirror.com/react-json-view-lite/-/react-json-view-lite-1.5.0.tgz",
+      "integrity": "sha512-nWqA1E4jKPklL2jvHWs6s+7Na0qNgw9HCP6xehdQJeg6nPBTFZgGwyko9Q0oj+jQWKTTVRS30u0toM5wiuL3iw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14"
+      },
+      "peerDependencies": {
+        "react": "^16.13.1 || ^17.0.0 || ^18.0.0"
+      }
+    },
+    "node_modules/react-loadable": {
+      "name": "@docusaurus/react-loadable",
+      "version": "6.0.0",
+      "resolved": "https://registry.npmmirror.com/@docusaurus/react-loadable/-/react-loadable-6.0.0.tgz",
+      "integrity": "sha512-YMMxTUQV/QFSnbgrP3tjDzLHRg7vsbMn8e9HAa8o/1iXoiomo48b7sk/kkmWEuWNDPJVlKSJRB6Y2fHqdJk+SQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/react": "*"
+      },
+      "peerDependencies": {
+        "react": "*"
+      }
+    },
+    "node_modules/react-loadable-ssr-addon-v5-slorber": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmmirror.com/react-loadable-ssr-addon-v5-slorber/-/react-loadable-ssr-addon-v5-slorber-1.0.1.tgz",
+      "integrity": "sha512-lq3Lyw1lGku8zUEJPDxsNm1AfYHBrO9Y1+olAYwpUJ2IGFBskM0DMKok97A6LWUpHm+o7IvQBOWu9MLenp9Z+A==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.10.3"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      },
+      "peerDependencies": {
+        "react-loadable": "*",
+        "webpack": ">=4.41.1 || 5.x"
+      }
+    },
+    "node_modules/react-router": {
+      "version": "5.3.4",
+      "resolved": "https://registry.npmmirror.com/react-router/-/react-router-5.3.4.tgz",
+      "integrity": "sha512-Ys9K+ppnJah3QuaRiLxk+jDWOR1MekYQrlytiXxC1RyfbdsZkS5pvKAzCCr031xHixZwpnsYNT5xysdFHQaYsA==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.12.13",
+        "history": "^4.9.0",
+        "hoist-non-react-statics": "^3.1.0",
+        "loose-envify": "^1.3.1",
+        "path-to-regexp": "^1.7.0",
+        "prop-types": "^15.6.2",
+        "react-is": "^16.6.0",
+        "tiny-invariant": "^1.0.2",
+        "tiny-warning": "^1.0.0"
+      },
+      "peerDependencies": {
+        "react": ">=15"
+      }
+    },
+    "node_modules/react-router-config": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmmirror.com/react-router-config/-/react-router-config-5.1.1.tgz",
+      "integrity": "sha512-DuanZjaD8mQp1ppHjgnnUnyOlqYXZVjnov/JzFhjLEwd3Z4dYjMSnqrEzzGThH47vpCOqPPwJM2FtthLeJ8Pbg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.1.2"
+      },
+      "peerDependencies": {
+        "react": ">=15",
+        "react-router": ">=5"
+      }
+    },
+    "node_modules/react-router-dom": {
+      "version": "5.3.4",
+      "resolved": "https://registry.npmmirror.com/react-router-dom/-/react-router-dom-5.3.4.tgz",
+      "integrity": "sha512-m4EqFMHv/Ih4kpcBCONHbkT68KoAeHN4p3lAGoNryfHi0dMy0kCzEZakiKRsvg5wHZ/JLrLW8o8KomWiz/qbYQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.12.13",
+        "history": "^4.9.0",
+        "loose-envify": "^1.3.1",
+        "prop-types": "^15.6.2",
+        "react-router": "5.3.4",
+        "tiny-invariant": "^1.0.2",
+        "tiny-warning": "^1.0.0"
+      },
+      "peerDependencies": {
+        "react": ">=15"
+      }
+    },
+    "node_modules/readable-stream": {
+      "version": "3.6.2",
+      "resolved": "https://registry.npmmirror.com/readable-stream/-/readable-stream-3.6.2.tgz",
+      "integrity": "sha512-9u/sniCrY3D5WdsERHzHE4G2YCXqoG5FTHUiCC4SIbr6XcLZBY05ya9EKjYek9O5xOAwjGq+1JdGBAS7Q9ScoA==",
+      "license": "MIT",
+      "dependencies": {
+        "inherits": "^2.0.3",
+        "string_decoder": "^1.1.1",
+        "util-deprecate": "^1.0.1"
+      },
+      "engines": {
+        "node": ">= 6"
+      }
+    },
+    "node_modules/readdirp": {
+      "version": "3.6.0",
+      "resolved": "https://registry.npmmirror.com/readdirp/-/readdirp-3.6.0.tgz",
+      "integrity": "sha512-hOS089on8RduqdbhvQ5Z37A0ESjsqz6qnRcffsMU3495FuTdqSm+7bhJ29JvIOsBDEEnan5DPu9t3To9VRlMzA==",
+      "license": "MIT",
+      "dependencies": {
+        "picomatch": "^2.2.1"
+      },
+      "engines": {
+        "node": ">=8.10.0"
+      }
+    },
+    "node_modules/reading-time": {
+      "version": "1.5.0",
+      "resolved": "https://registry.npmmirror.com/reading-time/-/reading-time-1.5.0.tgz",
+      "integrity": "sha512-onYyVhBNr4CmAxFsKS7bz+uTLRakypIe4R+5A824vBSkQy/hB3fZepoVEf8OVAxzLvK+H/jm9TzpI3ETSm64Kg==",
+      "license": "MIT"
+    },
+    "node_modules/rechoir": {
+      "version": "0.6.2",
+      "resolved": "https://registry.npmmirror.com/rechoir/-/rechoir-0.6.2.tgz",
+      "integrity": "sha512-HFM8rkZ+i3zrV+4LQjwQ0W+ez98pApMGM3HUrN04j3CqzPOzl9nmP15Y8YXNm8QHGv/eacOVEjqhmWpkRV0NAw==",
+      "dependencies": {
+        "resolve": "^1.1.6"
+      },
+      "engines": {
+        "node": ">= 0.10"
+      }
+    },
+    "node_modules/recursive-readdir": {
+      "version": "2.2.3",
+      "resolved": "https://registry.npmmirror.com/recursive-readdir/-/recursive-readdir-2.2.3.tgz",
+      "integrity": "sha512-8HrF5ZsXk5FAH9dgsx3BlUer73nIhuj+9OrQwEbLTPOBzGkL1lsFCR01am+v+0m2Cmbs1nP12hLDl5FA7EszKA==",
+      "license": "MIT",
+      "dependencies": {
+        "minimatch": "^3.0.5"
+      },
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/regenerate": {
+      "version": "1.4.2",
+      "resolved": "https://registry.npmmirror.com/regenerate/-/regenerate-1.4.2.tgz",
+      "integrity": "sha512-zrceR/XhGYU/d/opr2EKO7aRHUeiBI8qjtfHqADTwZd6Szfy16la6kqD0MIUs5z5hx6AaKa+PixpPrR289+I0A==",
+      "license": "MIT"
+    },
+    "node_modules/regenerate-unicode-properties": {
+      "version": "10.2.0",
+      "resolved": "https://registry.npmmirror.com/regenerate-unicode-properties/-/regenerate-unicode-properties-10.2.0.tgz",
+      "integrity": "sha512-DqHn3DwbmmPVzeKj9woBadqmXxLvQoQIwu7nopMc72ztvxVmVk2SBhSnx67zuye5TP+lJsb/TBQsjLKhnDf3MA==",
+      "license": "MIT",
+      "dependencies": {
+        "regenerate": "^1.4.2"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/regenerator-runtime": {
+      "version": "0.14.1",
+      "resolved": "https://registry.npmmirror.com/regenerator-runtime/-/regenerator-runtime-0.14.1.tgz",
+      "integrity": "sha512-dYnhHh0nJoMfnkZs6GmmhFknAGRrLznOu5nc9ML+EJxGvrx6H7teuevqVqCuPcPK//3eDrrjQhehXVx9cnkGdw==",
+      "license": "MIT"
+    },
+    "node_modules/regenerator-transform": {
+      "version": "0.15.2",
+      "resolved": "https://registry.npmmirror.com/regenerator-transform/-/regenerator-transform-0.15.2.tgz",
+      "integrity": "sha512-hfMp2BoF0qOk3uc5V20ALGDS2ddjQaLrdl7xrGXvAIow7qeWRM2VA2HuCHkUKk9slq3VwEwLNK3DFBqDfPGYtg==",
+      "license": "MIT",
+      "dependencies": {
+        "@babel/runtime": "^7.8.4"
+      }
+    },
+    "node_modules/regexpu-core": {
+      "version": "6.1.1",
+      "resolved": "https://registry.npmmirror.com/regexpu-core/-/regexpu-core-6.1.1.tgz",
+      "integrity": "sha512-k67Nb9jvwJcJmVpw0jPttR1/zVfnKf8Km0IPatrU/zJ5XeG3+Slx0xLXs9HByJSzXzrlz5EDvN6yLNMDc2qdnw==",
+      "license": "MIT",
+      "dependencies": {
+        "regenerate": "^1.4.2",
+        "regenerate-unicode-properties": "^10.2.0",
+        "regjsgen": "^0.8.0",
+        "regjsparser": "^0.11.0",
+        "unicode-match-property-ecmascript": "^2.0.0",
+        "unicode-match-property-value-ecmascript": "^2.1.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/registry-auth-token": {
+      "version": "5.0.2",
+      "resolved": "https://registry.npmmirror.com/registry-auth-token/-/registry-auth-token-5.0.2.tgz",
+      "integrity": "sha512-o/3ikDxtXaA59BmZuZrJZDJv8NMDGSj+6j6XaeBmHw8eY1i1qd9+6H+LjVvQXx3HN6aRCGa1cUdJ9RaJZUugnQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@pnpm/npm-conf": "^2.1.0"
+      },
+      "engines": {
+        "node": ">=14"
+      }
+    },
+    "node_modules/registry-url": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmmirror.com/registry-url/-/registry-url-6.0.1.tgz",
+      "integrity": "sha512-+crtS5QjFRqFCoQmvGduwYWEBng99ZvmFvF+cUJkGYF1L1BfU8C6Zp9T7f5vPAwyLkUExpvK+ANVZmGU49qi4Q==",
+      "license": "MIT",
+      "dependencies": {
+        "rc": "1.2.8"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/regjsgen": {
+      "version": "0.8.0",
+      "resolved": "https://registry.npmmirror.com/regjsgen/-/regjsgen-0.8.0.tgz",
+      "integrity": "sha512-RvwtGe3d7LvWiDQXeQw8p5asZUmfU1G/l6WbUXeHta7Y2PEIvBTwH6E2EfmYUK8pxcxEdEmaomqyp0vZZ7C+3Q==",
+      "license": "MIT"
+    },
+    "node_modules/regjsparser": {
+      "version": "0.11.1",
+      "resolved": "https://registry.npmmirror.com/regjsparser/-/regjsparser-0.11.1.tgz",
+      "integrity": "sha512-1DHODs4B8p/mQHU9kr+jv8+wIC9mtG4eBHxWxIq5mhjE3D5oORhCc6deRKzTjs9DcfRFmj9BHSDguZklqCGFWQ==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "jsesc": "~3.0.2"
+      },
+      "bin": {
+        "regjsparser": "bin/parser"
+      }
+    },
+    "node_modules/rehype-raw": {
+      "version": "7.0.0",
+      "resolved": "https://registry.npmmirror.com/rehype-raw/-/rehype-raw-7.0.0.tgz",
+      "integrity": "sha512-/aE8hCfKlQeA8LmyeyQvQF3eBiLRGNlfBJEvWH7ivp9sBqs7TNqBL5X3v157rM4IFETqDnIOO+z5M/biZbo9Ww==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/hast": "^3.0.0",
+        "hast-util-raw": "^9.0.0",
+        "vfile": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/relateurl": {
+      "version": "0.2.7",
+      "resolved": "https://registry.npmmirror.com/relateurl/-/relateurl-0.2.7.tgz",
+      "integrity": "sha512-G08Dxvm4iDN3MLM0EsP62EDV9IuhXPR6blNz6Utcp7zyV3tr4HVNINt6MpaRWbxoOHT3Q7YN2P+jaHX8vUbgog==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.10"
+      }
+    },
+    "node_modules/remark-directive": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/remark-directive/-/remark-directive-3.0.0.tgz",
+      "integrity": "sha512-l1UyWJ6Eg1VPU7Hm/9tt0zKtReJQNOA4+iDMAxTyZNWnJnFlbS/7zhiel/rogTLQ2vMYwDzSJa4BiVNqGlqIMA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "mdast-util-directive": "^3.0.0",
+        "micromark-extension-directive": "^3.0.0",
+        "unified": "^11.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-emoji": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmmirror.com/remark-emoji/-/remark-emoji-4.0.1.tgz",
+      "integrity": "sha512-fHdvsTR1dHkWKev9eNyhTo4EFwbUvJ8ka9SgeWkMPYFX4WoI7ViVBms3PjlQYgw5TLvNQso3GUB/b/8t3yo+dg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.2",
+        "emoticon": "^4.0.1",
+        "mdast-util-find-and-replace": "^3.0.1",
+        "node-emoji": "^2.1.0",
+        "unified": "^11.0.4"
+      },
+      "engines": {
+        "node": "^12.20.0 || ^14.13.1 || >=16.0.0"
+      }
+    },
+    "node_modules/remark-frontmatter": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmmirror.com/remark-frontmatter/-/remark-frontmatter-5.0.0.tgz",
+      "integrity": "sha512-XTFYvNASMe5iPN0719nPrdItC9aU0ssC4v14mH1BCi1u0n1gAocqcujWUrByftZTbLhRtiKRyjYTSIOcr69UVQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "mdast-util-frontmatter": "^2.0.0",
+        "micromark-extension-frontmatter": "^2.0.0",
+        "unified": "^11.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-gfm": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/remark-gfm/-/remark-gfm-4.0.0.tgz",
+      "integrity": "sha512-U92vJgBPkbw4Zfu/IiW2oTZLSL3Zpv+uI7My2eq8JxKgqraFdU8YUGicEJCEgSbeaG+QDFqIcwwfMTOEelPxuA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "mdast-util-gfm": "^3.0.0",
+        "micromark-extension-gfm": "^3.0.0",
+        "remark-parse": "^11.0.0",
+        "remark-stringify": "^11.0.0",
+        "unified": "^11.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-mdx": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/remark-mdx/-/remark-mdx-3.0.1.tgz",
+      "integrity": "sha512-3Pz3yPQ5Rht2pM5R+0J2MrGoBSrzf+tJG94N+t/ilfdh8YLyyKYtidAYwTveB20BoHAcwIopOUqhcmh2F7hGYA==",
+      "license": "MIT",
+      "dependencies": {
+        "mdast-util-mdx": "^3.0.0",
+        "micromark-extension-mdxjs": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-parse": {
+      "version": "11.0.0",
+      "resolved": "https://registry.npmmirror.com/remark-parse/-/remark-parse-11.0.0.tgz",
+      "integrity": "sha512-FCxlKLNGknS5ba/1lmpYijMUzX2esxW5xQqjWxw2eHFfS2MSdaHVINFmhjo+qN1WhZhNimq0dZATN9pH0IDrpA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "micromark-util-types": "^2.0.0",
+        "unified": "^11.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-rehype": {
+      "version": "11.1.1",
+      "resolved": "https://registry.npmmirror.com/remark-rehype/-/remark-rehype-11.1.1.tgz",
+      "integrity": "sha512-g/osARvjkBXb6Wo0XvAeXQohVta8i84ACbenPpoSsxTOQH/Ae0/RGP4WZgnMH5pMLpsj4FG7OHmcIcXxpza8eQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/hast": "^3.0.0",
+        "@types/mdast": "^4.0.0",
+        "mdast-util-to-hast": "^13.0.0",
+        "unified": "^11.0.0",
+        "vfile": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-stringify": {
+      "version": "11.0.0",
+      "resolved": "https://registry.npmmirror.com/remark-stringify/-/remark-stringify-11.0.0.tgz",
+      "integrity": "sha512-1OSmLd3awB/t8qdoEOMazZkNsfVTeY4fTsgzcQFdXNq8ToTN4ZGwrMnlda4K6smTFKD+GRV6O48i6Z4iKgPPpw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "mdast-util-to-markdown": "^2.0.0",
+        "unified": "^11.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/renderkid": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/renderkid/-/renderkid-3.0.0.tgz",
+      "integrity": "sha512-q/7VIQA8lmM1hF+jn+sFSPWGlMkSAeNYcPLmDQx2zzuiDfaLrOmumR8iaUKlenFgh0XRPIUeSPlH3A+AW3Z5pg==",
+      "license": "MIT",
+      "dependencies": {
+        "css-select": "^4.1.3",
+        "dom-converter": "^0.2.0",
+        "htmlparser2": "^6.1.0",
+        "lodash": "^4.17.21",
+        "strip-ansi": "^6.0.1"
+      }
+    },
+    "node_modules/renderkid/node_modules/css-select": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmmirror.com/css-select/-/css-select-4.3.0.tgz",
+      "integrity": "sha512-wPpOYtnsVontu2mODhA19JrqWxNsfdatRKd64kmpRbQgh1KtItko5sTnEpPdpSaJszTOhEMlF/RPz28qj4HqhQ==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "boolbase": "^1.0.0",
+        "css-what": "^6.0.1",
+        "domhandler": "^4.3.1",
+        "domutils": "^2.8.0",
+        "nth-check": "^2.0.1"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/fb55"
+      }
+    },
+    "node_modules/renderkid/node_modules/dom-serializer": {
+      "version": "1.4.1",
+      "resolved": "https://registry.npmmirror.com/dom-serializer/-/dom-serializer-1.4.1.tgz",
+      "integrity": "sha512-VHwB3KfrcOOkelEG2ZOfxqLZdfkil8PtJi4P8N2MMXucZq2yLp75ClViUlOVwyoHEDjYU433Aq+5zWP61+RGag==",
+      "license": "MIT",
+      "dependencies": {
+        "domelementtype": "^2.0.1",
+        "domhandler": "^4.2.0",
+        "entities": "^2.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/cheeriojs/dom-serializer?sponsor=1"
+      }
+    },
+    "node_modules/renderkid/node_modules/domhandler": {
+      "version": "4.3.1",
+      "resolved": "https://registry.npmmirror.com/domhandler/-/domhandler-4.3.1.tgz",
+      "integrity": "sha512-GrwoxYN+uWlzO8uhUXRl0P+kHE4GtVPfYzVLcUxPL7KNdHKj66vvlhiweIHqYYXWlw+T8iLMp42Lm67ghw4WMQ==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "domelementtype": "^2.2.0"
+      },
+      "engines": {
+        "node": ">= 4"
+      },
+      "funding": {
+        "url": "https://github.com/fb55/domhandler?sponsor=1"
+      }
+    },
+    "node_modules/renderkid/node_modules/domutils": {
+      "version": "2.8.0",
+      "resolved": "https://registry.npmmirror.com/domutils/-/domutils-2.8.0.tgz",
+      "integrity": "sha512-w96Cjofp72M5IIhpjgobBimYEfoPjx1Vx0BSX9P30WBdZW2WIKU0T1Bd0kz2eNZ9ikjKgHbEyKx8BB6H1L3h3A==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "dom-serializer": "^1.0.1",
+        "domelementtype": "^2.2.0",
+        "domhandler": "^4.2.0"
+      },
+      "funding": {
+        "url": "https://github.com/fb55/domutils?sponsor=1"
+      }
+    },
+    "node_modules/renderkid/node_modules/entities": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/entities/-/entities-2.2.0.tgz",
+      "integrity": "sha512-p92if5Nz619I0w+akJrLZH0MX0Pb5DX39XOwQTtXSdQQOaYH03S1uIQp4mhOZtAXrxq4ViO67YTiLBo2638o9A==",
+      "license": "BSD-2-Clause",
+      "funding": {
+        "url": "https://github.com/fb55/entities?sponsor=1"
+      }
+    },
+    "node_modules/renderkid/node_modules/htmlparser2": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/htmlparser2/-/htmlparser2-6.1.0.tgz",
+      "integrity": "sha512-gyyPk6rgonLFEDGoeRgQNaEUvdJ4ktTmmUh/h2t7s+M8oPpIPxgNACWa+6ESR57kXstwqPiCut0V8NRpcwgU7A==",
+      "funding": [
+        "https://github.com/fb55/htmlparser2?sponsor=1",
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/fb55"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "domelementtype": "^2.0.1",
+        "domhandler": "^4.0.0",
+        "domutils": "^2.5.2",
+        "entities": "^2.0.0"
+      }
+    },
+    "node_modules/require-from-string": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/require-from-string/-/require-from-string-2.0.2.tgz",
+      "integrity": "sha512-Xf0nWe6RseziFMu+Ap9biiUbmplq6S9/p+7w7YXP/JBHhrUDDUhwa+vANyubuqfZWTveU//DYVGsDG7RKL/vEw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/require-like": {
+      "version": "0.1.2",
+      "resolved": "https://registry.npmmirror.com/require-like/-/require-like-0.1.2.tgz",
+      "integrity": "sha512-oyrU88skkMtDdauHDuKVrgR+zuItqr6/c//FXzvmxRGMexSDc6hNvJInGW3LL46n+8b50RykrvwSUIIQH2LQ5A==",
+      "engines": {
+        "node": "*"
+      }
+    },
+    "node_modules/requires-port": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/requires-port/-/requires-port-1.0.0.tgz",
+      "integrity": "sha512-KigOCHcocU3XODJxsu8i/j8T9tzT4adHiecwORRQ0ZZFcp7ahwXuRU1m+yuO90C5ZUyGeGfocHDI14M3L3yDAQ==",
+      "license": "MIT"
+    },
+    "node_modules/resize-observer-polyfill": {
+      "version": "1.5.1",
+      "resolved": "https://registry.npmmirror.com/resize-observer-polyfill/-/resize-observer-polyfill-1.5.1.tgz",
+      "integrity": "sha512-LwZrotdHOo12nQuZlHEmtuXdqGoOD0OhaxopaNFxWzInpEgaLWoVuAMbTzixuosCx2nEG58ngzW3vxdWoxIgdg==",
+      "license": "MIT"
+    },
+    "node_modules/resolve": {
+      "version": "1.22.8",
+      "resolved": "https://registry.npmmirror.com/resolve/-/resolve-1.22.8.tgz",
+      "integrity": "sha512-oKWePCxqpd6FlLvGV1VU0x7bkPmmCNolxzjMf4NczoDnQcIWrAF+cPtZn5i6n+RfD2d9i0tzpKnG6Yk168yIyw==",
+      "license": "MIT",
+      "dependencies": {
+        "is-core-module": "^2.13.0",
+        "path-parse": "^1.0.7",
+        "supports-preserve-symlinks-flag": "^1.0.0"
+      },
+      "bin": {
+        "resolve": "bin/resolve"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/resolve-alpn": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmmirror.com/resolve-alpn/-/resolve-alpn-1.2.1.tgz",
+      "integrity": "sha512-0a1F4l73/ZFZOakJnQ3FvkJ2+gSTQWz/r2KE5OdDY0TxPm5h4GkqkWWfM47T7HsbnOtcJVEF4epCVy6u7Q3K+g==",
+      "license": "MIT"
+    },
+    "node_modules/resolve-from": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/resolve-from/-/resolve-from-4.0.0.tgz",
+      "integrity": "sha512-pb/MYmXstAkysRFx8piNI1tGFNQIFA3vkE3Gq4EuA1dF6gHp/+vgZqsCGJapvy8N3Q+4o7FwvquPJcnZ7RYy4g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/resolve-pathname": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/resolve-pathname/-/resolve-pathname-3.0.0.tgz",
+      "integrity": "sha512-C7rARubxI8bXFNB/hqcp/4iUeIXJhJZvFPFPiSPRnhU5UPxzMFIl+2E6yY6c4k9giDJAhtV+enfA+G89N6Csng==",
+      "license": "MIT"
+    },
+    "node_modules/responselike": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/responselike/-/responselike-3.0.0.tgz",
+      "integrity": "sha512-40yHxbNcl2+rzXvZuVkrYohathsSJlMTXKryG5y8uciHv1+xDLHQpgjG64JUO9nrEq2jGLH6IZ8BcZyw3wrweg==",
+      "license": "MIT",
+      "dependencies": {
+        "lowercase-keys": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/retry": {
+      "version": "0.13.1",
+      "resolved": "https://registry.npmmirror.com/retry/-/retry-0.13.1.tgz",
+      "integrity": "sha512-XQBQ3I8W1Cge0Seh+6gjj03LbmRFWuoszgK9ooCpwYIrhhoO80pfq4cUkU5DkknwfOfFteRwlZ56PYOGYyFWdg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 4"
+      }
+    },
+    "node_modules/reusify": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmmirror.com/reusify/-/reusify-1.0.4.tgz",
+      "integrity": "sha512-U9nH88a3fc/ekCF1l0/UP1IosiuIjyTh7hBvXVMHYgVcfGvt897Xguj2UOLDeI5BG2m7/uwyaLVT6fbtCwTyzw==",
+      "license": "MIT",
+      "engines": {
+        "iojs": ">=1.0.0",
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/rimraf": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmmirror.com/rimraf/-/rimraf-3.0.2.tgz",
+      "integrity": "sha512-JZkJMZkAGFFPP2YqXZXPbMlMBgsxzE8ILs4lMIX/2o0L9UBw9O/Y3o6wFw/i9YLapcUJWwqbi3kdxIPdC62TIA==",
+      "deprecated": "Rimraf versions prior to v4 are no longer supported",
+      "license": "ISC",
+      "dependencies": {
+        "glob": "^7.1.3"
+      },
+      "bin": {
+        "rimraf": "bin.js"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/isaacs"
+      }
+    },
+    "node_modules/rtl-detect": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmmirror.com/rtl-detect/-/rtl-detect-1.1.2.tgz",
+      "integrity": "sha512-PGMBq03+TTG/p/cRB7HCLKJ1MgDIi07+QU1faSjiYRfmY5UsAttV9Hs08jDAHVwcOwmVLcSJkpwyfXszVjWfIQ==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/rtlcss": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmmirror.com/rtlcss/-/rtlcss-4.3.0.tgz",
+      "integrity": "sha512-FI+pHEn7Wc4NqKXMXFM+VAYKEj/mRIcW4h24YVwVtyjI+EqGrLc2Hx/Ny0lrZ21cBWU2goLy36eqMcNj3AQJig==",
+      "license": "MIT",
+      "dependencies": {
+        "escalade": "^3.1.1",
+        "picocolors": "^1.0.0",
+        "postcss": "^8.4.21",
+        "strip-json-comments": "^3.1.1"
+      },
+      "bin": {
+        "rtlcss": "bin/rtlcss.js"
+      },
+      "engines": {
+        "node": ">=12.0.0"
+      }
+    },
+    "node_modules/run-parallel": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmmirror.com/run-parallel/-/run-parallel-1.2.0.tgz",
+      "integrity": "sha512-5l4VyZR86LZ/lDxZTR6jqL8AFE2S0IFLMP26AbjsLVADxHdhB/c0GUsH+y39UfCi3dzz8OlQuPmnaJOMoDHQBA==",
+      "funding": [
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/feross"
+        },
+        {
+          "type": "patreon",
+          "url": "https://www.patreon.com/feross"
+        },
+        {
+          "type": "consulting",
+          "url": "https://feross.org/support"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "queue-microtask": "^1.2.2"
+      }
+    },
+    "node_modules/safe-buffer": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmmirror.com/safe-buffer/-/safe-buffer-5.2.1.tgz",
+      "integrity": "sha512-rp3So07KcdmmKbGvgaNxQSJr7bGVSVk5S9Eq1F+ppbRo70+YeaDxkw5Dd8NPN+GD6bjnYm2VuPuCXmpuYvmCXQ==",
+      "funding": [
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/feross"
+        },
+        {
+          "type": "patreon",
+          "url": "https://www.patreon.com/feross"
+        },
+        {
+          "type": "consulting",
+          "url": "https://feross.org/support"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/safer-buffer": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmmirror.com/safer-buffer/-/safer-buffer-2.1.2.tgz",
+      "integrity": "sha512-YZo3K82SD7Riyi0E1EQPojLz7kpepnSQI9IyPbHHg1XXXevb5dJI7tpyN2ADxGcQbHG7vcyRHk0cbwqcQriUtg==",
+      "license": "MIT"
+    },
+    "node_modules/sax": {
+      "version": "1.4.1",
+      "resolved": "https://registry.npmmirror.com/sax/-/sax-1.4.1.tgz",
+      "integrity": "sha512-+aWOz7yVScEGoKNd4PA10LZ8sk0A/z5+nXQG5giUO5rprX9jgYsTdov9qCchZiPIZezbZH+jRut8nPodFAX4Jg==",
+      "license": "ISC"
+    },
+    "node_modules/scheduler": {
+      "version": "0.23.2",
+      "resolved": "https://registry.npmmirror.com/scheduler/-/scheduler-0.23.2.tgz",
+      "integrity": "sha512-UOShsPwz7NrMUqhR6t0hWjFduvOzbtv7toDH1/hIrfRNIDBnnBWd0CwJTGvTpngVlmwGCdP9/Zl/tVrDqcuYzQ==",
+      "license": "MIT",
+      "dependencies": {
+        "loose-envify": "^1.1.0"
+      }
+    },
+    "node_modules/schema-utils": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmmirror.com/schema-utils/-/schema-utils-4.2.0.tgz",
+      "integrity": "sha512-L0jRsrPpjdckP3oPug3/VxNKt2trR8TcabrM6FOAAlvC/9Phcmm+cuAgTlxBqdBR1WJx7Naj9WHw+aOmheSVbw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/json-schema": "^7.0.9",
+        "ajv": "^8.9.0",
+        "ajv-formats": "^2.1.1",
+        "ajv-keywords": "^5.1.0"
+      },
+      "engines": {
+        "node": ">= 12.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      }
+    },
+    "node_modules/scroll-into-view-if-needed": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmmirror.com/scroll-into-view-if-needed/-/scroll-into-view-if-needed-3.1.0.tgz",
+      "integrity": "sha512-49oNpRjWRvnU8NyGVmUaYG4jtTkNonFZI86MmGRDqBphEK2EXT9gdEUoQPZhuBM8yWHxCWbobltqYO5M4XrUvQ==",
+      "license": "MIT",
+      "dependencies": {
+        "compute-scroll-into-view": "^3.0.2"
+      }
+    },
+    "node_modules/search-insights": {
+      "version": "2.17.2",
+      "resolved": "https://registry.npmmirror.com/search-insights/-/search-insights-2.17.2.tgz",
+      "integrity": "sha512-zFNpOpUO+tY2D85KrxJ+aqwnIfdEGi06UH2+xEb+Bp9Mwznmauqc9djbnBibJO5mpfUPPa8st6Sx65+vbeO45g==",
+      "license": "MIT",
+      "peer": true
+    },
+    "node_modules/section-matter": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/section-matter/-/section-matter-1.0.0.tgz",
+      "integrity": "sha512-vfD3pmTzGpufjScBh50YHKzEu2lxBWhVEHsNGoEXmCmn2hKGfeNLYMzCJpe8cD7gqX7TJluOVpBkAequ6dgMmA==",
+      "license": "MIT",
+      "dependencies": {
+        "extend-shallow": "^2.0.1",
+        "kind-of": "^6.0.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/select-hose": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/select-hose/-/select-hose-2.0.0.tgz",
+      "integrity": "sha512-mEugaLK+YfkijB4fx0e6kImuJdCIt2LxCRcbEYPqRGCs4F2ogyfZU5IAZRdjCP8JPq2AtdNoC/Dux63d9Kiryg==",
+      "license": "MIT"
+    },
+    "node_modules/selfsigned": {
+      "version": "2.4.1",
+      "resolved": "https://registry.npmmirror.com/selfsigned/-/selfsigned-2.4.1.tgz",
+      "integrity": "sha512-th5B4L2U+eGLq1TVh7zNRGBapioSORUeymIydxgFpwww9d2qyKvtuPU2jJuHvYAwwqi2Y596QBL3eEqcPEYL8Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node-forge": "^1.3.0",
+        "node-forge": "^1"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/semver": {
+      "version": "7.6.3",
+      "resolved": "https://registry.npmmirror.com/semver/-/semver-7.6.3.tgz",
+      "integrity": "sha512-oVekP1cKtI+CTDvHWYFUcMtsK/00wmAEfyqKfNdARm8u1wNVhSgaX7A8d4UuIlUI5e84iEwOhs7ZPYRmzU9U6A==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/semver-diff": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/semver-diff/-/semver-diff-4.0.0.tgz",
+      "integrity": "sha512-0Ju4+6A8iOnpL/Thra7dZsSlOHYAHIeMxfhWQRI1/VLcT3WDBZKKtQt/QkBOsiIN9ZpuvHE6cGZ0x4glCMmfiA==",
+      "license": "MIT",
+      "dependencies": {
+        "semver": "^7.3.5"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/send": {
+      "version": "0.19.0",
+      "resolved": "https://registry.npmmirror.com/send/-/send-0.19.0.tgz",
+      "integrity": "sha512-dW41u5VfLXu8SJh5bwRmyYUbAoSB3c9uQh6L8h/KtsFREPWpbX1lrljJo186Jc4nmci/sGUZ9a0a0J2zgfq2hw==",
+      "license": "MIT",
+      "dependencies": {
+        "debug": "2.6.9",
+        "depd": "2.0.0",
+        "destroy": "1.2.0",
+        "encodeurl": "~1.0.2",
+        "escape-html": "~1.0.3",
+        "etag": "~1.8.1",
+        "fresh": "0.5.2",
+        "http-errors": "2.0.0",
+        "mime": "1.6.0",
+        "ms": "2.1.3",
+        "on-finished": "2.4.1",
+        "range-parser": "~1.2.1",
+        "statuses": "2.0.1"
+      },
+      "engines": {
+        "node": ">= 0.8.0"
+      }
+    },
+    "node_modules/send/node_modules/debug": {
+      "version": "2.6.9",
+      "resolved": "https://registry.npmmirror.com/debug/-/debug-2.6.9.tgz",
+      "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "2.0.0"
+      }
+    },
+    "node_modules/send/node_modules/debug/node_modules/ms": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/ms/-/ms-2.0.0.tgz",
+      "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==",
+      "license": "MIT"
+    },
+    "node_modules/send/node_modules/encodeurl": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/encodeurl/-/encodeurl-1.0.2.tgz",
+      "integrity": "sha512-TPJXq8JqFaVYm2CWmPvnP2Iyo4ZSM7/QKcSmuMLDObfpH5fi7RUGmd/rTDf+rut/saiDiQEeVTNgAmJEdAOx0w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/send/node_modules/range-parser": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmmirror.com/range-parser/-/range-parser-1.2.1.tgz",
+      "integrity": "sha512-Hrgsx+orqoygnmhFbKaHE6c296J+HTAQXoxEF6gNupROmmGJRoyzfG3ccAveqCBrwr/2yxQ5BVd/GTl5agOwSg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/serialize-javascript": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/serialize-javascript/-/serialize-javascript-6.0.2.tgz",
+      "integrity": "sha512-Saa1xPByTTq2gdeFZYLLo+RFE35NHZkAbqZeWNd3BpzppeVisAqpDjcp8dyf6uIvEqJRd46jemmyA4iFIeVk8g==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "randombytes": "^2.1.0"
+      }
+    },
+    "node_modules/serve-handler": {
+      "version": "6.1.5",
+      "resolved": "https://registry.npmmirror.com/serve-handler/-/serve-handler-6.1.5.tgz",
+      "integrity": "sha512-ijPFle6Hwe8zfmBxJdE+5fta53fdIY0lHISJvuikXB3VYFafRjMRpOffSPvCYsbKyBA7pvy9oYr/BT1O3EArlg==",
+      "license": "MIT",
+      "dependencies": {
+        "bytes": "3.0.0",
+        "content-disposition": "0.5.2",
+        "fast-url-parser": "1.1.3",
+        "mime-types": "2.1.18",
+        "minimatch": "3.1.2",
+        "path-is-inside": "1.0.2",
+        "path-to-regexp": "2.2.1",
+        "range-parser": "1.2.0"
+      }
+    },
+    "node_modules/serve-handler/node_modules/path-to-regexp": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmmirror.com/path-to-regexp/-/path-to-regexp-2.2.1.tgz",
+      "integrity": "sha512-gu9bD6Ta5bwGrrU8muHzVOBFFREpp2iRkVfhBJahwJ6p6Xw20SjT0MxLnwkjOibQmGSYhiUnf2FLe7k+jcFmGQ==",
+      "license": "MIT"
+    },
+    "node_modules/serve-index": {
+      "version": "1.9.1",
+      "resolved": "https://registry.npmmirror.com/serve-index/-/serve-index-1.9.1.tgz",
+      "integrity": "sha512-pXHfKNP4qujrtteMrSBb0rc8HJ9Ms/GrXwcUtUtD5s4ewDJI8bT3Cz2zTVRMKtri49pLx2e0Ya8ziP5Ya2pZZw==",
+      "license": "MIT",
+      "dependencies": {
+        "accepts": "~1.3.4",
+        "batch": "0.6.1",
+        "debug": "2.6.9",
+        "escape-html": "~1.0.3",
+        "http-errors": "~1.6.2",
+        "mime-types": "~2.1.17",
+        "parseurl": "~1.3.2"
+      },
+      "engines": {
+        "node": ">= 0.8.0"
+      }
+    },
+    "node_modules/serve-index/node_modules/debug": {
+      "version": "2.6.9",
+      "resolved": "https://registry.npmmirror.com/debug/-/debug-2.6.9.tgz",
+      "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "2.0.0"
+      }
+    },
+    "node_modules/serve-index/node_modules/depd": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmmirror.com/depd/-/depd-1.1.2.tgz",
+      "integrity": "sha512-7emPTl6Dpo6JRXOXjLRxck+FlLRX5847cLKEn00PLAgc3g2hTZZgr+e4c2v6QpSmLeFP3n5yUo7ft6avBK/5jQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/serve-index/node_modules/http-errors": {
+      "version": "1.6.3",
+      "resolved": "https://registry.npmmirror.com/http-errors/-/http-errors-1.6.3.tgz",
+      "integrity": "sha512-lks+lVC8dgGyh97jxvxeYTWQFvh4uw4yC12gVl63Cg30sjPX4wuGcdkICVXDAESr6OJGjqGA8Iz5mkeN6zlD7A==",
+      "license": "MIT",
+      "dependencies": {
+        "depd": "~1.1.2",
+        "inherits": "2.0.3",
+        "setprototypeof": "1.1.0",
+        "statuses": ">= 1.4.0 < 2"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/serve-index/node_modules/inherits": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmmirror.com/inherits/-/inherits-2.0.3.tgz",
+      "integrity": "sha512-x00IRNXNy63jwGkJmzPigoySHbaqpNuzKbBOmzK+g2OdZpQ9w+sxCN+VSB3ja7IAge2OP2qpfxTjeNcyjmW1uw==",
+      "license": "ISC"
+    },
+    "node_modules/serve-index/node_modules/ms": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/ms/-/ms-2.0.0.tgz",
+      "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==",
+      "license": "MIT"
+    },
+    "node_modules/serve-index/node_modules/setprototypeof": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/setprototypeof/-/setprototypeof-1.1.0.tgz",
+      "integrity": "sha512-BvE/TwpZX4FXExxOxZyRGQQv651MSwmWKZGqvmPcRIjDqWub67kTKuIMx43cZZrS/cBBzwBcNDWoFxt2XEFIpQ==",
+      "license": "ISC"
+    },
+    "node_modules/serve-index/node_modules/statuses": {
+      "version": "1.5.0",
+      "resolved": "https://registry.npmmirror.com/statuses/-/statuses-1.5.0.tgz",
+      "integrity": "sha512-OpZ3zP+jT1PI7I8nemJX4AKmAX070ZkYPVWV/AaKTJl+tXCTGyVdC1a4SL8RUQYEwk/f34ZX8UTykN68FwrqAA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/serve-static": {
+      "version": "1.16.2",
+      "resolved": "https://registry.npmmirror.com/serve-static/-/serve-static-1.16.2.tgz",
+      "integrity": "sha512-VqpjJZKadQB/PEbEwvFdO43Ax5dFBZ2UECszz8bQ7pi7wt//PWe1P6MN7eCnjsatYtBT6EuiClbjSWP2WrIoTw==",
+      "license": "MIT",
+      "dependencies": {
+        "encodeurl": "~2.0.0",
+        "escape-html": "~1.0.3",
+        "parseurl": "~1.3.3",
+        "send": "0.19.0"
+      },
+      "engines": {
+        "node": ">= 0.8.0"
+      }
+    },
+    "node_modules/set-function-length": {
+      "version": "1.2.2",
+      "resolved": "https://registry.npmmirror.com/set-function-length/-/set-function-length-1.2.2.tgz",
+      "integrity": "sha512-pgRc4hJ4/sNjWCSS9AmnS40x3bNMDTknHgL5UaMBTMyJnU90EgWh1Rz+MC9eFu4BuN/UwZjKQuY/1v3rM7HMfg==",
+      "license": "MIT",
+      "dependencies": {
+        "define-data-property": "^1.1.4",
+        "es-errors": "^1.3.0",
+        "function-bind": "^1.1.2",
+        "get-intrinsic": "^1.2.4",
+        "gopd": "^1.0.1",
+        "has-property-descriptors": "^1.0.2"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      }
+    },
+    "node_modules/setprototypeof": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmmirror.com/setprototypeof/-/setprototypeof-1.2.0.tgz",
+      "integrity": "sha512-E5LDX7Wrp85Kil5bhZv46j8jOeboKq5JMmYM3gVGdGH8xFpPWXUMsNrlODCrkoxMEeNi/XZIwuRvY4XNwYMJpw==",
+      "license": "ISC"
+    },
+    "node_modules/shallow-clone": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/shallow-clone/-/shallow-clone-3.0.1.tgz",
+      "integrity": "sha512-/6KqX+GVUdqPuPPd2LxDDxzX6CAbjJehAAOKlNpqqUpAqPM6HeL8f+o3a+JsyGjn2lv0WY8UsTgUJjU9Ok55NA==",
+      "license": "MIT",
+      "dependencies": {
+        "kind-of": "^6.0.2"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/shallowequal": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/shallowequal/-/shallowequal-1.1.0.tgz",
+      "integrity": "sha512-y0m1JoUZSlPAjXVtPPW70aZWfIL/dSP7AFkRnniLCrK/8MDKog3TySTBmckD+RObVxH0v4Tox67+F14PdED2oQ==",
+      "license": "MIT"
+    },
+    "node_modules/shebang-command": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/shebang-command/-/shebang-command-2.0.0.tgz",
+      "integrity": "sha512-kHxr2zZpYtdmrN1qDjrrX/Z1rR1kG8Dx+gkpK1G4eXmvXswmcE1hTWBWYUzlraYw1/yZp6YuDY77YtvbN0dmDA==",
+      "license": "MIT",
+      "dependencies": {
+        "shebang-regex": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/shebang-regex": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/shebang-regex/-/shebang-regex-3.0.0.tgz",
+      "integrity": "sha512-7++dFhtcx3353uBaq8DDR4NuxBetBzC7ZQOhmTQInHEd6bSrXdiEyzCvG07Z44UYdLShWUyXt5M/yhz8ekcb1A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/shell-quote": {
+      "version": "1.8.1",
+      "resolved": "https://registry.npmmirror.com/shell-quote/-/shell-quote-1.8.1.tgz",
+      "integrity": "sha512-6j1W9l1iAs/4xYBI1SYOVZyFcCis9b4KCLQ8fgAGG07QvzaRLVVRQvAy85yNmmZSjYjg4MWh4gNvlPujU/5LpA==",
+      "license": "MIT",
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/shelljs": {
+      "version": "0.8.5",
+      "resolved": "https://registry.npmmirror.com/shelljs/-/shelljs-0.8.5.tgz",
+      "integrity": "sha512-TiwcRcrkhHvbrZbnRcFYMLl30Dfov3HKqzp5tO5b4pt6G/SezKcYhmDg15zXVBswHmctSAQKznqNW2LO5tTDow==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "glob": "^7.0.0",
+        "interpret": "^1.0.0",
+        "rechoir": "^0.6.2"
+      },
+      "bin": {
+        "shjs": "bin/shjs"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/side-channel": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmmirror.com/side-channel/-/side-channel-1.0.6.tgz",
+      "integrity": "sha512-fDW/EZ6Q9RiO8eFG8Hj+7u/oW+XrPTIChwCOM2+th2A6OblDtYYIpve9m+KvI9Z4C9qSEXlaGR6bTEYHReuglA==",
+      "license": "MIT",
+      "dependencies": {
+        "call-bind": "^1.0.7",
+        "es-errors": "^1.3.0",
+        "get-intrinsic": "^1.2.4",
+        "object-inspect": "^1.13.1"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/signal-exit": {
+      "version": "3.0.7",
+      "resolved": "https://registry.npmmirror.com/signal-exit/-/signal-exit-3.0.7.tgz",
+      "integrity": "sha512-wnD2ZE+l+SPC/uoS0vXeE9L1+0wuaMqKlfz9AMUo38JsyLSBWSFcHR1Rri62LZc12vLr1gb3jl7iwQhgwpAbGQ==",
+      "license": "ISC"
+    },
+    "node_modules/sirv": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmmirror.com/sirv/-/sirv-2.0.4.tgz",
+      "integrity": "sha512-94Bdh3cC2PKrbgSOUqTiGPWVZeSiXfKOVZNJniWoqrWrRkB1CJzBU3NEbiTsPcYy1lDsANA/THzS+9WBiy5nfQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@polka/url": "^1.0.0-next.24",
+        "mrmime": "^2.0.0",
+        "totalist": "^3.0.0"
+      },
+      "engines": {
+        "node": ">= 10"
+      }
+    },
+    "node_modules/sisteransi": {
+      "version": "1.0.5",
+      "resolved": "https://registry.npmmirror.com/sisteransi/-/sisteransi-1.0.5.tgz",
+      "integrity": "sha512-bLGGlR1QxBcynn2d5YmDX4MGjlZvy2MRBDRNHLJ8VI6l6+9FUiyTFNJ0IveOSP0bcXgVDPRcfGqA0pjaqUpfVg==",
+      "license": "MIT"
+    },
+    "node_modules/sitemap": {
+      "version": "7.1.2",
+      "resolved": "https://registry.npmmirror.com/sitemap/-/sitemap-7.1.2.tgz",
+      "integrity": "sha512-ARCqzHJ0p4gWt+j7NlU5eDlIO9+Rkr/JhPFZKKQ1l5GCus7rJH4UdrlVAh0xC/gDS/Qir2UMxqYNHtsKr2rpCw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "^17.0.5",
+        "@types/sax": "^1.2.1",
+        "arg": "^5.0.0",
+        "sax": "^1.2.4"
+      },
+      "bin": {
+        "sitemap": "dist/cli.js"
+      },
+      "engines": {
+        "node": ">=12.0.0",
+        "npm": ">=5.6.0"
+      }
+    },
+    "node_modules/sitemap/node_modules/@types/node": {
+      "version": "17.0.45",
+      "resolved": "https://registry.npmmirror.com/@types/node/-/node-17.0.45.tgz",
+      "integrity": "sha512-w+tIMs3rq2afQdsPJlODhoUEKzFP1ayaoyl1CcnwtIlsVe7K7bA1NGm4s3PraqTLlXnbIN84zuBlxBWo1u9BLw==",
+      "license": "MIT"
+    },
+    "node_modules/skin-tone": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/skin-tone/-/skin-tone-2.0.0.tgz",
+      "integrity": "sha512-kUMbT1oBJCpgrnKoSr0o6wPtvRWT9W9UKvGLwfJYO2WuahZRHOpEyL1ckyMGgMWh0UdpmaoFqKKD29WTomNEGA==",
+      "license": "MIT",
+      "dependencies": {
+        "unicode-emoji-modifier-base": "^1.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/slash": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/slash/-/slash-3.0.0.tgz",
+      "integrity": "sha512-g9Q1haeby36OSStwb4ntCGGGaKsaVSjQ68fBxoQcutl5fS1vuY18H3wSt3jFyFtrkx+Kz0V1G85A4MyAdDMi2Q==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/snake-case": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmmirror.com/snake-case/-/snake-case-3.0.4.tgz",
+      "integrity": "sha512-LAOh4z89bGQvl9pFfNF8V146i7o7/CqFPbqzYgP+yYzDIDeS9HaNFtXABamRW+AQzEVODcvE79ljJ+8a9YSdMg==",
+      "license": "MIT",
+      "dependencies": {
+        "dot-case": "^3.0.4",
+        "tslib": "^2.0.3"
+      }
+    },
+    "node_modules/sockjs": {
+      "version": "0.3.24",
+      "resolved": "https://registry.npmmirror.com/sockjs/-/sockjs-0.3.24.tgz",
+      "integrity": "sha512-GJgLTZ7vYb/JtPSSZ10hsOYIvEYsjbNU+zPdIHcUaWVNUEPivzxku31865sSSud0Da0W4lEeOPlmw93zLQchuQ==",
+      "license": "MIT",
+      "dependencies": {
+        "faye-websocket": "^0.11.3",
+        "uuid": "^8.3.2",
+        "websocket-driver": "^0.7.4"
+      }
+    },
+    "node_modules/sort-css-media-queries": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/sort-css-media-queries/-/sort-css-media-queries-2.2.0.tgz",
+      "integrity": "sha512-0xtkGhWCC9MGt/EzgnvbbbKhqWjl1+/rncmhTh5qCpbYguXh6S/qwePfv/JQ8jePXXmqingylxoC49pCkSPIbA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 6.3.0"
+      }
+    },
+    "node_modules/source-map": {
+      "version": "0.7.4",
+      "resolved": "https://registry.npmmirror.com/source-map/-/source-map-0.7.4.tgz",
+      "integrity": "sha512-l3BikUxvPOcn5E74dZiq5BGsTb5yEwhaTSzccU6t4sDOH8NWJCstKO5QT2CvtFoK6F0saL7p9xHAqHOlCPJygA==",
+      "license": "BSD-3-Clause",
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/source-map-js": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmmirror.com/source-map-js/-/source-map-js-1.2.1.tgz",
+      "integrity": "sha512-UXWMKhLOwVKb728IUtQPXxfYU+usdybtUrK/8uGE8CQMvrhOpwvzDBwj0QhSL7MQc7vIsISBG8VQ8+IDQxpfQA==",
+      "license": "BSD-3-Clause",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/source-map-support": {
+      "version": "0.5.21",
+      "resolved": "https://registry.npmmirror.com/source-map-support/-/source-map-support-0.5.21.tgz",
+      "integrity": "sha512-uBHU3L3czsIyYXKX88fdrGovxdSCoTGDRZ6SYXtSRxLZUzHg5P/66Ht6uoUlHu9EZod+inXhKo3qQgwXUT/y1w==",
+      "license": "MIT",
+      "dependencies": {
+        "buffer-from": "^1.0.0",
+        "source-map": "^0.6.0"
+      }
+    },
+    "node_modules/source-map-support/node_modules/source-map": {
+      "version": "0.6.1",
+      "resolved": "https://registry.npmmirror.com/source-map/-/source-map-0.6.1.tgz",
+      "integrity": "sha512-UjgapumWlbMhkBgzT7Ykc5YXUT46F0iKu8SGXq0bcwP5dz/h0Plj6enJqjz1Zbq2l5WaqYnrVbwWOWMyF3F47g==",
+      "license": "BSD-3-Clause",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/space-separated-tokens": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/space-separated-tokens/-/space-separated-tokens-2.0.2.tgz",
+      "integrity": "sha512-PEGlAwrG8yXGXRjW32fGbg66JAlOAwbObuqVoJpv/mRgoWDQfgH1wDPvtzWyUSNAXBGSk8h755YDbbcEy3SH2Q==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/spdy": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmmirror.com/spdy/-/spdy-4.0.2.tgz",
+      "integrity": "sha512-r46gZQZQV+Kl9oItvl1JZZqJKGr+oEkB08A6BzkiR7593/7IbtuncXHd2YoYeTsG4157ZssMu9KYvUHLcjcDoA==",
+      "license": "MIT",
+      "dependencies": {
+        "debug": "^4.1.0",
+        "handle-thing": "^2.0.0",
+        "http-deceiver": "^1.2.7",
+        "select-hose": "^2.0.0",
+        "spdy-transport": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/spdy-transport": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/spdy-transport/-/spdy-transport-3.0.0.tgz",
+      "integrity": "sha512-hsLVFE5SjA6TCisWeJXFKniGGOpBgMLmerfO2aCyCU5s7nJ/rpAepqmFifv/GCbSbueEeAJJnmSQ2rKC/g8Fcw==",
+      "license": "MIT",
+      "dependencies": {
+        "debug": "^4.1.0",
+        "detect-node": "^2.0.4",
+        "hpack.js": "^2.1.6",
+        "obuf": "^1.1.2",
+        "readable-stream": "^3.0.6",
+        "wbuf": "^1.7.3"
+      }
+    },
+    "node_modules/sprintf-js": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmmirror.com/sprintf-js/-/sprintf-js-1.0.3.tgz",
+      "integrity": "sha512-D9cPgkvLlV3t3IzL0D0YLvGA9Ahk4PcvVwUbN0dSGr1aP0Nrt4AEnTUbuGvquEC0mA64Gqt1fzirlRs5ibXx8g==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/srcset": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/srcset/-/srcset-4.0.0.tgz",
+      "integrity": "sha512-wvLeHgcVHKO8Sc/H/5lkGreJQVeYMm9rlmt8PuR1xE31rIuXhuzznUUqAt8MqLhB3MqJdFzlNAfpcWnxiFUcPw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/statuses": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/statuses/-/statuses-2.0.1.tgz",
+      "integrity": "sha512-RwNA9Z/7PrK06rYLIzFMlaF+l73iwpzsqRIFgbMLbTcLD6cOao82TaWefPXQvB2fOC4AjuYSEndS7N/mTCbkdQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/std-env": {
+      "version": "3.7.0",
+      "resolved": "https://registry.npmmirror.com/std-env/-/std-env-3.7.0.tgz",
+      "integrity": "sha512-JPbdCEQLj1w5GilpiHAx3qJvFndqybBysA3qUOnznweH4QbNYUsW/ea8QzSrnh0vNsezMMw5bcVool8lM0gwzg==",
+      "license": "MIT"
+    },
+    "node_modules/string_decoder": {
+      "version": "1.3.0",
+      "resolved": "https://registry.npmmirror.com/string_decoder/-/string_decoder-1.3.0.tgz",
+      "integrity": "sha512-hkRX8U1WjJFd8LsDJ2yQ/wWWxaopEsABU1XfkM8A+j0+85JAGppt16cr1Whg6KIbb4okU6Mql6BOj+uup/wKeA==",
+      "license": "MIT",
+      "dependencies": {
+        "safe-buffer": "~5.2.0"
+      }
+    },
+    "node_modules/string-convert": {
+      "version": "0.2.1",
+      "resolved": "https://registry.npmmirror.com/string-convert/-/string-convert-0.2.1.tgz",
+      "integrity": "sha512-u/1tdPl4yQnPBjnVrmdLo9gtuLvELKsAoRapekWggdiQNvvvum+jYF329d84NAa660KQw7pB2n36KrIKVoXa3A==",
+      "license": "MIT"
+    },
+    "node_modules/string-width": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmmirror.com/string-width/-/string-width-5.1.2.tgz",
+      "integrity": "sha512-HnLOCR3vjcY8beoNLtcjZ5/nxn2afmME6lhrDrebokqMap+XbeW8n9TXpPDOqdGK5qcI3oT0GKTW6wC7EMiVqA==",
+      "license": "MIT",
+      "dependencies": {
+        "eastasianwidth": "^0.2.0",
+        "emoji-regex": "^9.2.2",
+        "strip-ansi": "^7.0.1"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/string-width/node_modules/ansi-regex": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/ansi-regex/-/ansi-regex-6.1.0.tgz",
+      "integrity": "sha512-7HSX4QQb4CspciLpVFwyRe79O3xsIZDDLER21kERQ71oaPodF8jL725AgJMFAYbooIqolJoRLuM81SpeUkpkvA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/ansi-regex?sponsor=1"
+      }
+    },
+    "node_modules/string-width/node_modules/strip-ansi": {
+      "version": "7.1.0",
+      "resolved": "https://registry.npmmirror.com/strip-ansi/-/strip-ansi-7.1.0.tgz",
+      "integrity": "sha512-iq6eVVI64nQQTRYq2KtEg2d2uU7LElhTJwsH4YzIHZshxlgZms/wIc4VoDQTlG/IvVIrBKG06CrZnp0qv7hkcQ==",
+      "license": "MIT",
+      "dependencies": {
+        "ansi-regex": "^6.0.1"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/strip-ansi?sponsor=1"
+      }
+    },
+    "node_modules/stringify-entities": {
+      "version": "4.0.4",
+      "resolved": "https://registry.npmmirror.com/stringify-entities/-/stringify-entities-4.0.4.tgz",
+      "integrity": "sha512-IwfBptatlO+QCJUo19AqvrPNqlVMpW9YEL2LIVY+Rpv2qsjCGxaDLNRgeGsQWJhfItebuJhsGSLjaBbNSQ+ieg==",
+      "license": "MIT",
+      "dependencies": {
+        "character-entities-html4": "^2.0.0",
+        "character-entities-legacy": "^3.0.0"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/stringify-object": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmmirror.com/stringify-object/-/stringify-object-3.3.0.tgz",
+      "integrity": "sha512-rHqiFh1elqCQ9WPLIC8I0Q/g/wj5J1eMkyoiD6eoQApWHP0FtlK7rqnhmabL5VUY9JQCcqwwvlOaSuutekgyrw==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "get-own-enumerable-property-symbols": "^3.0.0",
+        "is-obj": "^1.0.1",
+        "is-regexp": "^1.0.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/strip-ansi": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmmirror.com/strip-ansi/-/strip-ansi-6.0.1.tgz",
+      "integrity": "sha512-Y38VPSHcqkFrCpFnQ9vuSXmquuv5oXOKpGeT6aGrr3o3Gc9AlVa6JBfUSOCnbxGGZF+/0ooI7KrPuUSztUdU5A==",
+      "license": "MIT",
+      "dependencies": {
+        "ansi-regex": "^5.0.1"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/strip-bom-string": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/strip-bom-string/-/strip-bom-string-1.0.0.tgz",
+      "integrity": "sha512-uCC2VHvQRYu+lMh4My/sFNmF2klFymLX1wHJeXnbEJERpV/ZsVuonzerjfrGpIGF7LBVa1O7i9kjiWvJiFck8g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/strip-final-newline": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/strip-final-newline/-/strip-final-newline-2.0.0.tgz",
+      "integrity": "sha512-BrpvfNAE3dcvq7ll3xVumzjKjZQ5tI1sEUIKr3Uoks0XUl45St3FlatVqef9prk4jRDzhW6WZg+3bk93y6pLjA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/strip-json-comments": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmmirror.com/strip-json-comments/-/strip-json-comments-3.1.1.tgz",
+      "integrity": "sha512-6fPc+R4ihwqP6N/aIv2f1gMH8lOVtWQHoqC4yK6oSDVVocumAsfCqjkXnqiYMhmMwS/mEHLp7Vehlt3ql6lEig==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/style-to-object": {
+      "version": "0.4.4",
+      "resolved": "https://registry.npmmirror.com/style-to-object/-/style-to-object-0.4.4.tgz",
+      "integrity": "sha512-HYNoHZa2GorYNyqiCaBgsxvcJIn7OHq6inEga+E6Ke3m5JkoqpQbnFssk4jwe+K7AhGa2fcha4wSOf1Kn01dMg==",
+      "license": "MIT",
+      "dependencies": {
+        "inline-style-parser": "0.1.1"
+      }
+    },
+    "node_modules/stylehacks": {
+      "version": "6.1.1",
+      "resolved": "https://registry.npmmirror.com/stylehacks/-/stylehacks-6.1.1.tgz",
+      "integrity": "sha512-gSTTEQ670cJNoaeIp9KX6lZmm8LJ3jPB5yJmX8Zq/wQxOsAFXV3qjWzHas3YYk1qesuVIyYWWUpZ0vSE/dTSGg==",
+      "license": "MIT",
+      "dependencies": {
+        "browserslist": "^4.23.0",
+        "postcss-selector-parser": "^6.0.16"
+      },
+      "engines": {
+        "node": "^14 || ^16 || >=18.0"
+      },
+      "peerDependencies": {
+        "postcss": "^8.4.31"
+      }
+    },
+    "node_modules/stylis": {
+      "version": "4.3.4",
+      "resolved": "https://registry.npmmirror.com/stylis/-/stylis-4.3.4.tgz",
+      "integrity": "sha512-osIBl6BGUmSfDkyH2mB7EFvCJntXDrLhKjHTRj/rK6xLH0yuPrHULDRQzKokSOD4VoorhtKpfcfW1GAntu8now==",
+      "license": "MIT"
+    },
+    "node_modules/supports-color": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmmirror.com/supports-color/-/supports-color-7.2.0.tgz",
+      "integrity": "sha512-qpCAvRl9stuOHveKsn7HncJRvv501qIacKzQlO/+Lwxc9+0q2wLyv4Dfvt80/DPn2pqOBsJdDiogXGR9+OvwRw==",
+      "license": "MIT",
+      "dependencies": {
+        "has-flag": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/supports-preserve-symlinks-flag": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/supports-preserve-symlinks-flag/-/supports-preserve-symlinks-flag-1.0.0.tgz",
+      "integrity": "sha512-ot0WnXS9fgdkgIcePe6RHNk1WA8+muPa6cSjeR3V8K27q9BB1rTE3R1p7Hv0z1ZyAc8s6Vvv8DIyWf681MAt0w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/svg-parser": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmmirror.com/svg-parser/-/svg-parser-2.0.4.tgz",
+      "integrity": "sha512-e4hG1hRwoOdRb37cIMSgzNsxyzKfayW6VOflrwvR+/bzrkyxY/31WkbgnQpgtrNp1SdpJvpUAGTa/ZoiPNDuRQ==",
+      "license": "MIT"
+    },
+    "node_modules/svgo": {
+      "version": "3.3.2",
+      "resolved": "https://registry.npmmirror.com/svgo/-/svgo-3.3.2.tgz",
+      "integrity": "sha512-OoohrmuUlBs8B8o6MB2Aevn+pRIH9zDALSR+6hhqVfa6fRwG/Qw9VUMSMW9VNg2CFc/MTIfabtdOVl9ODIJjpw==",
+      "license": "MIT",
+      "dependencies": {
+        "@trysound/sax": "0.2.0",
+        "commander": "^7.2.0",
+        "css-select": "^5.1.0",
+        "css-tree": "^2.3.1",
+        "css-what": "^6.1.0",
+        "csso": "^5.0.5",
+        "picocolors": "^1.0.0"
+      },
+      "bin": {
+        "svgo": "bin/svgo"
+      },
+      "engines": {
+        "node": ">=14.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/svgo"
+      }
+    },
+    "node_modules/svgo/node_modules/commander": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmmirror.com/commander/-/commander-7.2.0.tgz",
+      "integrity": "sha512-QrWXB+ZQSVPmIWIhtEO9H+gwHaMGYiF5ChvoJ+K9ZGHG/sVsa6yiesAD1GC/x46sET00Xlwo1u49RVVVzvcSkw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 10"
+      }
+    },
+    "node_modules/tapable": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmmirror.com/tapable/-/tapable-2.2.1.tgz",
+      "integrity": "sha512-GNzQvQTOIP6RyTfE2Qxb8ZVlNmw0n88vp1szwWRimP02mnTsx3Wtn5qRdqY9w2XduFNUgvOwhNnQsjwCp+kqaQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/terser": {
+      "version": "5.34.1",
+      "resolved": "https://registry.npmmirror.com/terser/-/terser-5.34.1.tgz",
+      "integrity": "sha512-FsJZ7iZLd/BXkz+4xrRTGJ26o/6VTjQytUk8b8OxkwcD2I+79VPJlz7qss1+zE7h8GNIScFqXcDyJ/KqBYZFVA==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "@jridgewell/source-map": "^0.3.3",
+        "acorn": "^8.8.2",
+        "commander": "^2.20.0",
+        "source-map-support": "~0.5.20"
+      },
+      "bin": {
+        "terser": "bin/terser"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/terser-webpack-plugin": {
+      "version": "5.3.10",
+      "resolved": "https://registry.npmmirror.com/terser-webpack-plugin/-/terser-webpack-plugin-5.3.10.tgz",
+      "integrity": "sha512-BKFPWlPDndPs+NGGCr1U59t0XScL5317Y0UReNrHaw9/FwhPENlq6bfgs+4yPfyP51vqC1bQ4rp1EfXW5ZSH9w==",
+      "license": "MIT",
+      "dependencies": {
+        "@jridgewell/trace-mapping": "^0.3.20",
+        "jest-worker": "^27.4.5",
+        "schema-utils": "^3.1.1",
+        "serialize-javascript": "^6.0.1",
+        "terser": "^5.26.0"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "webpack": "^5.1.0"
+      },
+      "peerDependenciesMeta": {
+        "@swc/core": {
+          "optional": true
+        },
+        "esbuild": {
+          "optional": true
+        },
+        "uglify-js": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/terser-webpack-plugin/node_modules/ajv": {
+      "version": "6.12.6",
+      "resolved": "https://registry.npmmirror.com/ajv/-/ajv-6.12.6.tgz",
+      "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.1",
+        "fast-json-stable-stringify": "^2.0.0",
+        "json-schema-traverse": "^0.4.1",
+        "uri-js": "^4.2.2"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/epoberezkin"
+      }
+    },
+    "node_modules/terser-webpack-plugin/node_modules/ajv-keywords": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/ajv-keywords/-/ajv-keywords-3.5.2.tgz",
+      "integrity": "sha512-5p6WTN0DdTGVQk6VjcEju19IgaHudalcfabD7yhDGeA6bcQnmL+CpveLJq/3hvfwd1aof6L386Ougkx6RfyMIQ==",
+      "license": "MIT",
+      "peerDependencies": {
+        "ajv": "^6.9.1"
+      }
+    },
+    "node_modules/terser-webpack-plugin/node_modules/jest-worker": {
+      "version": "27.5.1",
+      "resolved": "https://registry.npmmirror.com/jest-worker/-/jest-worker-27.5.1.tgz",
+      "integrity": "sha512-7vuh85V5cdDofPyxn58nrPjBktZo0u9x1g8WtjQol+jZDaE+fhN+cIvTj11GndBnMnyfrUOG1sZQxCdjKh+DKg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/node": "*",
+        "merge-stream": "^2.0.0",
+        "supports-color": "^8.0.0"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      }
+    },
+    "node_modules/terser-webpack-plugin/node_modules/json-schema-traverse": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmmirror.com/json-schema-traverse/-/json-schema-traverse-0.4.1.tgz",
+      "integrity": "sha512-xbbCH5dCYU5T8LcEhhuh7HJ88HXuW3qsI3Y0zOZFKfZEHcpWiHU/Jxzk629Brsab/mMiHQti9wMP+845RPe3Vg==",
+      "license": "MIT"
+    },
+    "node_modules/terser-webpack-plugin/node_modules/schema-utils": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmmirror.com/schema-utils/-/schema-utils-3.3.0.tgz",
+      "integrity": "sha512-pN/yOAvcC+5rQ5nERGuwrjLlYvLTbCibnZ1I7B1LaiAz9BRBlE9GMgE/eqV30P7aJQUf7Ddimy/RsbYO/GrVGg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/json-schema": "^7.0.8",
+        "ajv": "^6.12.5",
+        "ajv-keywords": "^3.5.2"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      }
+    },
+    "node_modules/terser-webpack-plugin/node_modules/supports-color": {
+      "version": "8.1.1",
+      "resolved": "https://registry.npmmirror.com/supports-color/-/supports-color-8.1.1.tgz",
+      "integrity": "sha512-MpUEN2OodtUzxvKQl72cUF7RQ5EiHsGvSsVG0ia9c5RbWGL2CI4C7EpPS8UTBIplnlzZiNuV56w+FuNxy3ty2Q==",
+      "license": "MIT",
+      "dependencies": {
+        "has-flag": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/supports-color?sponsor=1"
+      }
+    },
+    "node_modules/terser/node_modules/commander": {
+      "version": "2.20.3",
+      "resolved": "https://registry.npmmirror.com/commander/-/commander-2.20.3.tgz",
+      "integrity": "sha512-GpVkmM8vF2vQUkj2LvZmD35JxeJOLCwJ9cUkugyk2nuhbv3+mJvpLYYt+0+USMxE+oj+ey/lJEnhZw75x/OMcQ==",
+      "license": "MIT"
+    },
+    "node_modules/text-table": {
+      "version": "0.2.0",
+      "resolved": "https://registry.npmmirror.com/text-table/-/text-table-0.2.0.tgz",
+      "integrity": "sha512-N+8UisAXDGk8PFXP4HAzVR9nbfmVJ3zYLAWiTIoqC5v5isinhr+r5uaO8+7r3BMfuNIufIsA7RdpVgacC2cSpw==",
+      "license": "MIT"
+    },
+    "node_modules/throttle-debounce": {
+      "version": "5.0.2",
+      "resolved": "https://registry.npmmirror.com/throttle-debounce/-/throttle-debounce-5.0.2.tgz",
+      "integrity": "sha512-B71/4oyj61iNH0KeCamLuE2rmKuTO5byTOSVwECM5FA7TiAiAW+UqTKZ9ERueC4qvgSttUhdmq1mXC3kJqGX7A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12.22"
+      }
+    },
+    "node_modules/thunky": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmmirror.com/thunky/-/thunky-1.1.0.tgz",
+      "integrity": "sha512-eHY7nBftgThBqOyHGVN+l8gF0BucP09fMo0oO/Lb0w1OF80dJv+lDVpXG60WMQvkcxAkNybKsrEIE3ZtKGmPrA==",
+      "license": "MIT"
+    },
+    "node_modules/tiny-invariant": {
+      "version": "1.3.3",
+      "resolved": "https://registry.npmmirror.com/tiny-invariant/-/tiny-invariant-1.3.3.tgz",
+      "integrity": "sha512-+FbBPE1o9QAYvviau/qC5SE3caw21q3xkvWKBtja5vgqOWIHHJ3ioaq1VPfn/Szqctz2bU/oYeKd9/z5BL+PVg==",
+      "license": "MIT"
+    },
+    "node_modules/tiny-warning": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmmirror.com/tiny-warning/-/tiny-warning-1.0.3.tgz",
+      "integrity": "sha512-lBN9zLN/oAf68o3zNXYrdCt1kP8WsiGW8Oo2ka41b2IM5JL/S1CTyX1rW0mb/zSuJun0ZUrDxx4sqvYS2FWzPA==",
+      "license": "MIT"
+    },
+    "node_modules/to-fast-properties": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/to-fast-properties/-/to-fast-properties-2.0.0.tgz",
+      "integrity": "sha512-/OaKK0xYrs3DmxRYqL/yDc+FxFUVYhDlXMhRmv3z915w2HF1tnN1omB354j8VUGO/hbRzyD6Y3sA7v7GS/ceog==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/to-regex-range": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmmirror.com/to-regex-range/-/to-regex-range-5.0.1.tgz",
+      "integrity": "sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==",
+      "license": "MIT",
+      "dependencies": {
+        "is-number": "^7.0.0"
+      },
+      "engines": {
+        "node": ">=8.0"
+      }
+    },
+    "node_modules/toggle-selection": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmmirror.com/toggle-selection/-/toggle-selection-1.0.6.tgz",
+      "integrity": "sha512-BiZS+C1OS8g/q2RRbJmy59xpyghNBqrr6k5L/uKBGRsTfxmu3ffiRnd8mlGPUVayg8pvfi5urfnu8TU7DVOkLQ==",
+      "license": "MIT"
+    },
+    "node_modules/toidentifier": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmmirror.com/toidentifier/-/toidentifier-1.0.1.tgz",
+      "integrity": "sha512-o5sSPKEkg/DIQNmH43V0/uerLrpzVedkUh8tGNvaeXpfpuwjKenlSox/2O/BTlZUtEe+JG7s5YhEz608PlAHRA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.6"
+      }
+    },
+    "node_modules/totalist": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/totalist/-/totalist-3.0.1.tgz",
+      "integrity": "sha512-sf4i37nQ2LBx4m3wB74y+ubopq6W/dIzXg0FDGjsYnZHVa1Da8FH853wlL2gtUhg+xJXjfk3kUZS3BRoQeoQBQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/trim-lines": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmmirror.com/trim-lines/-/trim-lines-3.0.1.tgz",
+      "integrity": "sha512-kRj8B+YHZCc9kQYdWfJB2/oUl9rA99qbowYYBtr4ui4mZyAQ2JpvVBd/6U2YloATfqBhBTSMhTpgBHtU0Mf3Rg==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/trough": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/trough/-/trough-2.2.0.tgz",
+      "integrity": "sha512-tmMpK00BjZiUyVyvrBK7knerNgmgvcV/KLVyuma/SC+TQN167GrMRciANTz09+k3zW8L8t60jWO1GpfkZdjTaw==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/tslib": {
+      "version": "2.7.0",
+      "resolved": "https://registry.npmmirror.com/tslib/-/tslib-2.7.0.tgz",
+      "integrity": "sha512-gLXCKdN1/j47AiHiOkJN69hJmcbGTHI0ImLmbYLHykhgeN0jVGola9yVjFgzCUklsZQMW55o+dW7IXv3RCXDzA==",
+      "license": "0BSD"
+    },
+    "node_modules/type-fest": {
+      "version": "2.19.0",
+      "resolved": "https://registry.npmmirror.com/type-fest/-/type-fest-2.19.0.tgz",
+      "integrity": "sha512-RAH822pAdBgcNMAfWnCBU3CFZcfZ/i1eZjwFU/dsLKumyuuP3niueg2UAukXYF0E2AAoc82ZSSf9J0WQBinzHA==",
+      "license": "(MIT OR CC0-1.0)",
+      "engines": {
+        "node": ">=12.20"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/type-is": {
+      "version": "1.6.18",
+      "resolved": "https://registry.npmmirror.com/type-is/-/type-is-1.6.18.tgz",
+      "integrity": "sha512-TkRKr9sUTxEH8MdfuCSP7VizJyzRNMjj2J2do2Jr3Kym598JVdEksuzPQCnlFPW4ky9Q+iA+ma9BGm06XQBy8g==",
+      "license": "MIT",
+      "dependencies": {
+        "media-typer": "0.3.0",
+        "mime-types": "~2.1.24"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/type-is/node_modules/mime-db": {
+      "version": "1.52.0",
+      "resolved": "https://registry.npmmirror.com/mime-db/-/mime-db-1.52.0.tgz",
+      "integrity": "sha512-sPU4uV7dYlvtWJxwwxHD0PuihVNiE7TyAbQ5SWxDCB9mUYvOgroQOwYQQOKPJ8CIbE+1ETVlOoK1UC2nU3gYvg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/type-is/node_modules/mime-types": {
+      "version": "2.1.35",
+      "resolved": "https://registry.npmmirror.com/mime-types/-/mime-types-2.1.35.tgz",
+      "integrity": "sha512-ZDY+bPm5zTTF+YpCrAU9nK0UgICYPT0QtT1NZWFv4s++TNkcgVaT0g6+4R2uI4MjQjzysHB1zxuWL50hzaeXiw==",
+      "license": "MIT",
+      "dependencies": {
+        "mime-db": "1.52.0"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/typedarray-to-buffer": {
+      "version": "3.1.5",
+      "resolved": "https://registry.npmmirror.com/typedarray-to-buffer/-/typedarray-to-buffer-3.1.5.tgz",
+      "integrity": "sha512-zdu8XMNEDepKKR+XYOXAVPtWui0ly0NtohUscw+UmaHiAWT8hrV1rr//H6V+0DvJ3OQ19S979M0laLfX8rm82Q==",
+      "license": "MIT",
+      "dependencies": {
+        "is-typedarray": "^1.0.0"
+      }
+    },
+    "node_modules/typescript": {
+      "version": "5.5.4",
+      "resolved": "https://registry.npmmirror.com/typescript/-/typescript-5.5.4.tgz",
+      "integrity": "sha512-Mtq29sKDAEYP7aljRgtPOpTvOfbwRWlS6dPRzwjdE+C0R4brX/GUyhHSecbHMFLNBLcJIPt9nl9yG5TZ1weH+Q==",
+      "license": "Apache-2.0",
+      "bin": {
+        "tsc": "bin/tsc",
+        "tsserver": "bin/tsserver"
+      },
+      "engines": {
+        "node": ">=14.17"
+      }
+    },
+    "node_modules/undici-types": {
+      "version": "6.19.8",
+      "resolved": "https://registry.npmmirror.com/undici-types/-/undici-types-6.19.8.tgz",
+      "integrity": "sha512-ve2KP6f/JnbPBFyobGHuerC9g1FYGn/F8n1LWTwNxCEzd6IfqTwUQcNXgEtmmQ6DlRrC1hrSrBnCZPokRrDHjw==",
+      "license": "MIT"
+    },
+    "node_modules/unicode-canonical-property-names-ecmascript": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/unicode-canonical-property-names-ecmascript/-/unicode-canonical-property-names-ecmascript-2.0.1.tgz",
+      "integrity": "sha512-dA8WbNeb2a6oQzAQ55YlT5vQAWGV9WXOsi3SskE3bcCdM0P4SDd+24zS/OCacdRq5BkdsRj9q3Pg6YyQoxIGqg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/unicode-emoji-modifier-base": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/unicode-emoji-modifier-base/-/unicode-emoji-modifier-base-1.0.0.tgz",
+      "integrity": "sha512-yLSH4py7oFH3oG/9K+XWrz1pSi3dfUrWEnInbxMfArOfc1+33BlGPQtLsOYwvdMy11AwUBetYuaRxSPqgkq+8g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/unicode-match-property-ecmascript": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/unicode-match-property-ecmascript/-/unicode-match-property-ecmascript-2.0.0.tgz",
+      "integrity": "sha512-5kaZCrbp5mmbz5ulBkDkbY0SsPOjKqVS35VpL9ulMPfSl0J0Xsm+9Evphv9CoIZFwre7aJoa94AY6seMKGVN5Q==",
+      "license": "MIT",
+      "dependencies": {
+        "unicode-canonical-property-names-ecmascript": "^2.0.0",
+        "unicode-property-aliases-ecmascript": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/unicode-match-property-value-ecmascript": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmmirror.com/unicode-match-property-value-ecmascript/-/unicode-match-property-value-ecmascript-2.2.0.tgz",
+      "integrity": "sha512-4IehN3V/+kkr5YeSSDDQG8QLqO26XpL2XP3GQtqwlT/QYSECAwFztxVHjlbh0+gjJ3XmNLS0zDsbgs9jWKExLg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/unicode-property-aliases-ecmascript": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmmirror.com/unicode-property-aliases-ecmascript/-/unicode-property-aliases-ecmascript-2.1.0.tgz",
+      "integrity": "sha512-6t3foTQI9qne+OZoVQB/8x8rk2k1eVy1gRXhV3oFQ5T6R1dqQ1xtin3XqSlx3+ATBkliTaR/hHyJBm+LVPNM8w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/unified": {
+      "version": "11.0.5",
+      "resolved": "https://registry.npmmirror.com/unified/-/unified-11.0.5.tgz",
+      "integrity": "sha512-xKvGhPWw3k84Qjh8bI3ZeJjqnyadK+GEFtazSfZv/rKeTkTjOJho6mFqh2SM96iIcZokxiOpg78GazTSg8+KHA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0",
+        "bail": "^2.0.0",
+        "devlop": "^1.0.0",
+        "extend": "^3.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/unique-string": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmmirror.com/unique-string/-/unique-string-3.0.0.tgz",
+      "integrity": "sha512-VGXBUVwxKMBUznyffQweQABPRRW1vHZAbadFZud4pLFAqRGvv/96vafgjWFqzourzr8YonlQiPgH0YCJfawoGQ==",
+      "license": "MIT",
+      "dependencies": {
+        "crypto-random-string": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/unist-util-is": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmmirror.com/unist-util-is/-/unist-util-is-6.0.0.tgz",
+      "integrity": "sha512-2qCTHimwdxLfz+YzdGfkqNlH0tLi9xjTnHddPmJwtIG9MGsdbutfTc4P+haPD7l7Cjxf/WZj+we5qfVPvvxfYw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/unist-util-position": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmmirror.com/unist-util-position/-/unist-util-position-5.0.0.tgz",
+      "integrity": "sha512-fucsC7HjXvkB5R3kTCO7kUjRdrS0BJt3M/FPxmHMBOm8JQi2BsHAHFsy27E0EolP8rp0NzXsJ+jNPyDWvOJZPA==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/unist-util-position-from-estree": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmmirror.com/unist-util-position-from-estree/-/unist-util-position-from-estree-2.0.0.tgz",
+      "integrity": "sha512-KaFVRjoqLyF6YXCbVLNad/eS4+OfPQQn2yOd7zF/h5T/CSL2v8NpN6a5TPvtbXthAGw5nG+PuTtq+DdIZr+cRQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/unist-util-stringify-position": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmmirror.com/unist-util-stringify-position/-/unist-util-stringify-position-4.0.0.tgz",
+      "integrity": "sha512-0ASV06AAoKCDkS2+xw5RXJywruurpbC4JZSm7nr7MOt1ojAzvyyaO+UxZf18j8FCF6kmzCZKcAgN/yu2gm2XgQ==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/unist-util-visit": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmmirror.com/unist-util-visit/-/unist-util-visit-5.0.0.tgz",
+      "integrity": "sha512-MR04uvD+07cwl/yhVuVWAtw+3GOR/knlL55Nd/wAdblk27GCVt3lqpTivy/tkJcZoNPzTwS1Y+KMojlLDhoTzg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0",
+        "unist-util-is": "^6.0.0",
+        "unist-util-visit-parents": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/unist-util-visit-parents": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmmirror.com/unist-util-visit-parents/-/unist-util-visit-parents-6.0.1.tgz",
+      "integrity": "sha512-L/PqWzfTP9lzzEa6CKs0k2nARxTdZduw3zyh8d2NVBnsyvHjSX4TWse388YrrQKbvI8w20fGjGlhgT96WwKykw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0",
+        "unist-util-is": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/universalify": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/universalify/-/universalify-2.0.1.tgz",
+      "integrity": "sha512-gptHNQghINnc/vTGIk0SOFGFNXw7JVrlRUtConJRlvaw6DuX0wO5Jeko9sWrMBhh+PsYAZ7oXAiOnf/UKogyiw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 10.0.0"
+      }
+    },
+    "node_modules/unpipe": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmmirror.com/unpipe/-/unpipe-1.0.0.tgz",
+      "integrity": "sha512-pjy2bYhSsufwWlKwPc+l3cN7+wuJlK6uz0YdJEOlQDbl6jo/YlPi4mb8agUkVC8BF7V8NuzeyPNqRksA3hztKQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/update-browserslist-db": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmmirror.com/update-browserslist-db/-/update-browserslist-db-1.1.1.tgz",
+      "integrity": "sha512-R8UzCaa9Az+38REPiJ1tXlImTJXlVfgHZsglwBD/k6nj76ctsH1E3q4doGrukiLQd3sGQYu56r5+lo5r94l29A==",
+      "funding": [
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/browserslist"
+        },
+        {
+          "type": "tidelift",
+          "url": "https://tidelift.com/funding/github/npm/browserslist"
+        },
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/ai"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "escalade": "^3.2.0",
+        "picocolors": "^1.1.0"
+      },
+      "bin": {
+        "update-browserslist-db": "cli.js"
+      },
+      "peerDependencies": {
+        "browserslist": ">= 4.21.0"
+      }
+    },
+    "node_modules/update-notifier": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmmirror.com/update-notifier/-/update-notifier-6.0.2.tgz",
+      "integrity": "sha512-EDxhTEVPZZRLWYcJ4ZXjGFN0oP7qYvbXWzEgRm/Yql4dHX5wDbvh89YHP6PK1lzZJYrMtXUuZZz8XGK+U6U1og==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "boxen": "^7.0.0",
+        "chalk": "^5.0.1",
+        "configstore": "^6.0.0",
+        "has-yarn": "^3.0.0",
+        "import-lazy": "^4.0.0",
+        "is-ci": "^3.0.1",
+        "is-installed-globally": "^0.4.0",
+        "is-npm": "^6.0.0",
+        "is-yarn-global": "^0.4.0",
+        "latest-version": "^7.0.0",
+        "pupa": "^3.1.0",
+        "semver": "^7.3.7",
+        "semver-diff": "^4.0.0",
+        "xdg-basedir": "^5.1.0"
+      },
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/yeoman/update-notifier?sponsor=1"
+      }
+    },
+    "node_modules/update-notifier/node_modules/boxen": {
+      "version": "7.1.1",
+      "resolved": "https://registry.npmmirror.com/boxen/-/boxen-7.1.1.tgz",
+      "integrity": "sha512-2hCgjEmP8YLWQ130n2FerGv7rYpfBmnmp9Uy2Le1vge6X3gZIfSmEzP5QTDElFxcvVcXlEn8Aq6MU/PZygIOog==",
+      "license": "MIT",
+      "dependencies": {
+        "ansi-align": "^3.0.1",
+        "camelcase": "^7.0.1",
+        "chalk": "^5.2.0",
+        "cli-boxes": "^3.0.0",
+        "string-width": "^5.1.2",
+        "type-fest": "^2.13.0",
+        "widest-line": "^4.0.1",
+        "wrap-ansi": "^8.1.0"
+      },
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/update-notifier/node_modules/camelcase": {
+      "version": "7.0.1",
+      "resolved": "https://registry.npmmirror.com/camelcase/-/camelcase-7.0.1.tgz",
+      "integrity": "sha512-xlx1yCK2Oc1APsPXDL2LdlNP6+uu8OCDdhOBSVT279M/S+y75O30C2VuD8T2ogdePBBl7PfPF4504tnLgX3zfw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=14.16"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/update-notifier/node_modules/chalk": {
+      "version": "5.3.0",
+      "resolved": "https://registry.npmmirror.com/chalk/-/chalk-5.3.0.tgz",
+      "integrity": "sha512-dLitG79d+GV1Nb/VYcCDFivJeK1hiukt9QjRNVOsUtTy1rR1YJsmpGGTZ3qJos+uw7WmWF4wUwBd9jxjocFC2w==",
+      "license": "MIT",
+      "engines": {
+        "node": "^12.17.0 || ^14.13 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/chalk?sponsor=1"
+      }
+    },
+    "node_modules/uri-js": {
+      "version": "4.4.1",
+      "resolved": "https://registry.npmmirror.com/uri-js/-/uri-js-4.4.1.tgz",
+      "integrity": "sha512-7rKUyy33Q1yc98pQ1DAmLtwX109F7TIfWlW1Ydo8Wl1ii1SeHieeh0HHfPeL2fMXK6z0s8ecKs9frCuLJvndBg==",
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "punycode": "^2.1.0"
+      }
+    },
+    "node_modules/uri-js/node_modules/punycode": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmmirror.com/punycode/-/punycode-2.3.1.tgz",
+      "integrity": "sha512-vYt7UD1U9Wg6138shLtLOvdAu+8DsC/ilFtEVHcH+wydcSpNE20AfSOduf6MkRFahL5FY7X1oU7nKVZFtfq8Fg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/url-loader": {
+      "version": "4.1.1",
+      "resolved": "https://registry.npmmirror.com/url-loader/-/url-loader-4.1.1.tgz",
+      "integrity": "sha512-3BTV812+AVHHOJQO8O5MkWgZ5aosP7GnROJwvzLS9hWDj00lZ6Z0wNak423Lp9PBZN05N+Jk/N5Si8jRAlGyWA==",
+      "license": "MIT",
+      "dependencies": {
+        "loader-utils": "^2.0.0",
+        "mime-types": "^2.1.27",
+        "schema-utils": "^3.0.0"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "file-loader": "*",
+        "webpack": "^4.0.0 || ^5.0.0"
+      },
+      "peerDependenciesMeta": {
+        "file-loader": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/url-loader/node_modules/ajv": {
+      "version": "6.12.6",
+      "resolved": "https://registry.npmmirror.com/ajv/-/ajv-6.12.6.tgz",
+      "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.1",
+        "fast-json-stable-stringify": "^2.0.0",
+        "json-schema-traverse": "^0.4.1",
+        "uri-js": "^4.2.2"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/epoberezkin"
+      }
+    },
+    "node_modules/url-loader/node_modules/ajv-keywords": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/ajv-keywords/-/ajv-keywords-3.5.2.tgz",
+      "integrity": "sha512-5p6WTN0DdTGVQk6VjcEju19IgaHudalcfabD7yhDGeA6bcQnmL+CpveLJq/3hvfwd1aof6L386Ougkx6RfyMIQ==",
+      "license": "MIT",
+      "peerDependencies": {
+        "ajv": "^6.9.1"
+      }
+    },
+    "node_modules/url-loader/node_modules/json-schema-traverse": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmmirror.com/json-schema-traverse/-/json-schema-traverse-0.4.1.tgz",
+      "integrity": "sha512-xbbCH5dCYU5T8LcEhhuh7HJ88HXuW3qsI3Y0zOZFKfZEHcpWiHU/Jxzk629Brsab/mMiHQti9wMP+845RPe3Vg==",
+      "license": "MIT"
+    },
+    "node_modules/url-loader/node_modules/mime-db": {
+      "version": "1.52.0",
+      "resolved": "https://registry.npmmirror.com/mime-db/-/mime-db-1.52.0.tgz",
+      "integrity": "sha512-sPU4uV7dYlvtWJxwwxHD0PuihVNiE7TyAbQ5SWxDCB9mUYvOgroQOwYQQOKPJ8CIbE+1ETVlOoK1UC2nU3gYvg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/url-loader/node_modules/mime-types": {
+      "version": "2.1.35",
+      "resolved": "https://registry.npmmirror.com/mime-types/-/mime-types-2.1.35.tgz",
+      "integrity": "sha512-ZDY+bPm5zTTF+YpCrAU9nK0UgICYPT0QtT1NZWFv4s++TNkcgVaT0g6+4R2uI4MjQjzysHB1zxuWL50hzaeXiw==",
+      "license": "MIT",
+      "dependencies": {
+        "mime-db": "1.52.0"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/url-loader/node_modules/schema-utils": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmmirror.com/schema-utils/-/schema-utils-3.3.0.tgz",
+      "integrity": "sha512-pN/yOAvcC+5rQ5nERGuwrjLlYvLTbCibnZ1I7B1LaiAz9BRBlE9GMgE/eqV30P7aJQUf7Ddimy/RsbYO/GrVGg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/json-schema": "^7.0.8",
+        "ajv": "^6.12.5",
+        "ajv-keywords": "^3.5.2"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      }
+    },
+    "node_modules/util-deprecate": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/util-deprecate/-/util-deprecate-1.0.2.tgz",
+      "integrity": "sha512-EPD5q1uXyFxJpCrLnCc1nHnq3gOa6DZBocAIiI2TaSCA7VCJ1UJDMagCzIkXNsUYfD1daK//LTEQ8xiIbrHtcw==",
+      "license": "MIT"
+    },
+    "node_modules/utila": {
+      "version": "0.4.0",
+      "resolved": "https://registry.npmmirror.com/utila/-/utila-0.4.0.tgz",
+      "integrity": "sha512-Z0DbgELS9/L/75wZbro8xAnT50pBVFQZ+hUEueGDU5FN51YSCYM+jdxsfCiHjwNP/4LCDD0i/graKpeBnOXKRA==",
+      "license": "MIT"
+    },
+    "node_modules/utility-types": {
+      "version": "3.11.0",
+      "resolved": "https://registry.npmmirror.com/utility-types/-/utility-types-3.11.0.tgz",
+      "integrity": "sha512-6Z7Ma2aVEWisaL6TvBCy7P8rm2LQoPv6dJ7ecIaIixHcwfbJ0x7mWdbcwlIM5IGQxPZSFYeqRCqlOOeKoJYMkw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 4"
+      }
+    },
+    "node_modules/utils-merge": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmmirror.com/utils-merge/-/utils-merge-1.0.1.tgz",
+      "integrity": "sha512-pMZTvIkT1d+TFGvDOqodOclx0QWkkgi6Tdoa8gC8ffGAAqz9pzPTZWAybbsHHoED/ztMtkv/VoYTYyShUn81hA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4.0"
+      }
+    },
+    "node_modules/uuid": {
+      "version": "8.3.2",
+      "resolved": "https://registry.npmmirror.com/uuid/-/uuid-8.3.2.tgz",
+      "integrity": "sha512-+NYs2QeMWy+GWFOEm9xnn6HCDp0l7QBD7ml8zLUmJ+93Q5NF0NocErnwkTkXVFNiX3/fpC6afS8Dhb/gz7R7eg==",
+      "license": "MIT",
+      "bin": {
+        "uuid": "dist/bin/uuid"
+      }
+    },
+    "node_modules/value-equal": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmmirror.com/value-equal/-/value-equal-1.0.1.tgz",
+      "integrity": "sha512-NOJ6JZCAWr0zlxZt+xqCHNTEKOsrks2HQd4MqhP1qy4z1SkbEP467eNx6TgDKXMvUOb+OENfJCZwM+16n7fRfw==",
+      "license": "MIT"
+    },
+    "node_modules/vary": {
+      "version": "1.1.2",
+      "resolved": "https://registry.npmmirror.com/vary/-/vary-1.1.2.tgz",
+      "integrity": "sha512-BNGbWLfd0eUPabhkXUVm0j8uuvREyTh5ovRa/dyow/BqAbZJyC+5fU+IzQOzmAKzYqYRAISoRhdQr3eIZ/PXqg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8"
+      }
+    },
+    "node_modules/vfile": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmmirror.com/vfile/-/vfile-6.0.3.tgz",
+      "integrity": "sha512-KzIbH/9tXat2u30jf+smMwFCsno4wHVdNmzFyL+T/L3UGqqk6JKfVqOFOZEpZSHADH1k40ab6NUIXZq422ov3Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0",
+        "vfile-message": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/vfile-location": {
+      "version": "5.0.3",
+      "resolved": "https://registry.npmmirror.com/vfile-location/-/vfile-location-5.0.3.tgz",
+      "integrity": "sha512-5yXvWDEgqeiYiBe1lbxYF7UMAIm/IcopxMHrMQDq3nvKcjPKIhZklUKL+AE7J7uApI4kwe2snsK+eI6UTj9EHg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0",
+        "vfile": "^6.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/vfile-message": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmmirror.com/vfile-message/-/vfile-message-4.0.2.tgz",
+      "integrity": "sha512-jRDZ1IMLttGj41KcZvlrYAaI3CfqpLpfpf+Mfig13viT6NKvRzWZ+lXz0Y5D60w6uJIBAOGq9mSHf0gktF0duw==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/unist": "^3.0.0",
+        "unist-util-stringify-position": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/watchpack": {
+      "version": "2.4.2",
+      "resolved": "https://registry.npmmirror.com/watchpack/-/watchpack-2.4.2.tgz",
+      "integrity": "sha512-TnbFSbcOCcDgjZ4piURLCbJ3nJhznVh9kw6F6iokjiFPl8ONxe9A6nMDVXDiNbrSfLILs6vB07F7wLBrwPYzJw==",
+      "license": "MIT",
+      "dependencies": {
+        "glob-to-regexp": "^0.4.1",
+        "graceful-fs": "^4.1.2"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      }
+    },
+    "node_modules/wbuf": {
+      "version": "1.7.3",
+      "resolved": "https://registry.npmmirror.com/wbuf/-/wbuf-1.7.3.tgz",
+      "integrity": "sha512-O84QOnr0icsbFGLS0O3bI5FswxzRr8/gHwWkDlQFskhSPryQXvrTMxjxGP4+iWYoauLoBvfDpkrOauZ+0iZpDA==",
+      "license": "MIT",
+      "dependencies": {
+        "minimalistic-assert": "^1.0.0"
+      }
+    },
+    "node_modules/web-namespaces": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/web-namespaces/-/web-namespaces-2.0.1.tgz",
+      "integrity": "sha512-bKr1DkiNa2krS7qxNtdrtHAmzuYGFQLiQ13TsorsdT6ULTkPLKuu5+GsFpDlg6JFjUTwX2DyhMPG2be8uPrqsQ==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    },
+    "node_modules/webpack": {
+      "version": "5.95.0",
+      "resolved": "https://registry.npmmirror.com/webpack/-/webpack-5.95.0.tgz",
+      "integrity": "sha512-2t3XstrKULz41MNMBF+cJ97TyHdyQ8HCt//pqErqDvNjU9YQBnZxIHa11VXsi7F3mb5/aO2tuDxdeTPdU7xu9Q==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.5",
+        "@webassemblyjs/ast": "^1.12.1",
+        "@webassemblyjs/wasm-edit": "^1.12.1",
+        "@webassemblyjs/wasm-parser": "^1.12.1",
+        "acorn": "^8.7.1",
+        "acorn-import-attributes": "^1.9.5",
+        "browserslist": "^4.21.10",
+        "chrome-trace-event": "^1.0.2",
+        "enhanced-resolve": "^5.17.1",
+        "es-module-lexer": "^1.2.1",
+        "eslint-scope": "5.1.1",
+        "events": "^3.2.0",
+        "glob-to-regexp": "^0.4.1",
+        "graceful-fs": "^4.2.11",
+        "json-parse-even-better-errors": "^2.3.1",
+        "loader-runner": "^4.2.0",
+        "mime-types": "^2.1.27",
+        "neo-async": "^2.6.2",
+        "schema-utils": "^3.2.0",
+        "tapable": "^2.1.1",
+        "terser-webpack-plugin": "^5.3.10",
+        "watchpack": "^2.4.1",
+        "webpack-sources": "^3.2.3"
+      },
+      "bin": {
+        "webpack": "bin/webpack.js"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependenciesMeta": {
+        "webpack-cli": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/webpack-bundle-analyzer": {
+      "version": "4.10.2",
+      "resolved": "https://registry.npmmirror.com/webpack-bundle-analyzer/-/webpack-bundle-analyzer-4.10.2.tgz",
+      "integrity": "sha512-vJptkMm9pk5si4Bv922ZbKLV8UTT4zib4FPgXMhgzUny0bfDDkLXAVQs3ly3fS4/TN9ROFtb0NFrm04UXFE/Vw==",
+      "license": "MIT",
+      "dependencies": {
+        "@discoveryjs/json-ext": "0.5.7",
+        "acorn": "^8.0.4",
+        "acorn-walk": "^8.0.0",
+        "commander": "^7.2.0",
+        "debounce": "^1.2.1",
+        "escape-string-regexp": "^4.0.0",
+        "gzip-size": "^6.0.0",
+        "html-escaper": "^2.0.2",
+        "opener": "^1.5.2",
+        "picocolors": "^1.0.0",
+        "sirv": "^2.0.3",
+        "ws": "^7.3.1"
+      },
+      "bin": {
+        "webpack-bundle-analyzer": "lib/bin/analyzer.js"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      }
+    },
+    "node_modules/webpack-bundle-analyzer/node_modules/commander": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmmirror.com/commander/-/commander-7.2.0.tgz",
+      "integrity": "sha512-QrWXB+ZQSVPmIWIhtEO9H+gwHaMGYiF5ChvoJ+K9ZGHG/sVsa6yiesAD1GC/x46sET00Xlwo1u49RVVVzvcSkw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 10"
+      }
+    },
+    "node_modules/webpack-dev-middleware": {
+      "version": "5.3.4",
+      "resolved": "https://registry.npmmirror.com/webpack-dev-middleware/-/webpack-dev-middleware-5.3.4.tgz",
+      "integrity": "sha512-BVdTqhhs+0IfoeAf7EoH5WE+exCmqGerHfDM0IL096Px60Tq2Mn9MAbnaGUe6HiMa41KMCYF19gyzZmBcq/o4Q==",
+      "license": "MIT",
+      "dependencies": {
+        "colorette": "^2.0.10",
+        "memfs": "^3.4.3",
+        "mime-types": "^2.1.31",
+        "range-parser": "^1.2.1",
+        "schema-utils": "^4.0.0"
+      },
+      "engines": {
+        "node": ">= 12.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "webpack": "^4.0.0 || ^5.0.0"
+      }
+    },
+    "node_modules/webpack-dev-middleware/node_modules/mime-db": {
+      "version": "1.52.0",
+      "resolved": "https://registry.npmmirror.com/mime-db/-/mime-db-1.52.0.tgz",
+      "integrity": "sha512-sPU4uV7dYlvtWJxwwxHD0PuihVNiE7TyAbQ5SWxDCB9mUYvOgroQOwYQQOKPJ8CIbE+1ETVlOoK1UC2nU3gYvg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/webpack-dev-middleware/node_modules/mime-types": {
+      "version": "2.1.35",
+      "resolved": "https://registry.npmmirror.com/mime-types/-/mime-types-2.1.35.tgz",
+      "integrity": "sha512-ZDY+bPm5zTTF+YpCrAU9nK0UgICYPT0QtT1NZWFv4s++TNkcgVaT0g6+4R2uI4MjQjzysHB1zxuWL50hzaeXiw==",
+      "license": "MIT",
+      "dependencies": {
+        "mime-db": "1.52.0"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/webpack-dev-middleware/node_modules/range-parser": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmmirror.com/range-parser/-/range-parser-1.2.1.tgz",
+      "integrity": "sha512-Hrgsx+orqoygnmhFbKaHE6c296J+HTAQXoxEF6gNupROmmGJRoyzfG3ccAveqCBrwr/2yxQ5BVd/GTl5agOwSg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/webpack-dev-server": {
+      "version": "4.15.2",
+      "resolved": "https://registry.npmmirror.com/webpack-dev-server/-/webpack-dev-server-4.15.2.tgz",
+      "integrity": "sha512-0XavAZbNJ5sDrCbkpWL8mia0o5WPOd2YGtxrEiZkBK9FjLppIUK2TgxK6qGD2P3hUXTJNNPVibrerKcx5WkR1g==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/bonjour": "^3.5.9",
+        "@types/connect-history-api-fallback": "^1.3.5",
+        "@types/express": "^4.17.13",
+        "@types/serve-index": "^1.9.1",
+        "@types/serve-static": "^1.13.10",
+        "@types/sockjs": "^0.3.33",
+        "@types/ws": "^8.5.5",
+        "ansi-html-community": "^0.0.8",
+        "bonjour-service": "^1.0.11",
+        "chokidar": "^3.5.3",
+        "colorette": "^2.0.10",
+        "compression": "^1.7.4",
+        "connect-history-api-fallback": "^2.0.0",
+        "default-gateway": "^6.0.3",
+        "express": "^4.17.3",
+        "graceful-fs": "^4.2.6",
+        "html-entities": "^2.3.2",
+        "http-proxy-middleware": "^2.0.3",
+        "ipaddr.js": "^2.0.1",
+        "launch-editor": "^2.6.0",
+        "open": "^8.0.9",
+        "p-retry": "^4.5.0",
+        "rimraf": "^3.0.2",
+        "schema-utils": "^4.0.0",
+        "selfsigned": "^2.1.1",
+        "serve-index": "^1.9.1",
+        "sockjs": "^0.3.24",
+        "spdy": "^4.0.2",
+        "webpack-dev-middleware": "^5.3.4",
+        "ws": "^8.13.0"
+      },
+      "bin": {
+        "webpack-dev-server": "bin/webpack-dev-server.js"
+      },
+      "engines": {
+        "node": ">= 12.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "webpack": "^4.37.0 || ^5.0.0"
+      },
+      "peerDependenciesMeta": {
+        "webpack": {
+          "optional": true
+        },
+        "webpack-cli": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/webpack-dev-server/node_modules/ws": {
+      "version": "8.18.0",
+      "resolved": "https://registry.npmmirror.com/ws/-/ws-8.18.0.tgz",
+      "integrity": "sha512-8VbfWfHLbbwu3+N6OKsOMpBdT4kXPDDB9cJk2bJ6mh9ucxdlnNvH1e+roYkKmN9Nxw2yjz7VzeO9oOz2zJ04Pw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10.0.0"
+      },
+      "peerDependencies": {
+        "bufferutil": "^4.0.1",
+        "utf-8-validate": ">=5.0.2"
+      },
+      "peerDependenciesMeta": {
+        "bufferutil": {
+          "optional": true
+        },
+        "utf-8-validate": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/webpack-merge": {
+      "version": "5.10.0",
+      "resolved": "https://registry.npmmirror.com/webpack-merge/-/webpack-merge-5.10.0.tgz",
+      "integrity": "sha512-+4zXKdx7UnO+1jaN4l2lHVD+mFvnlZQP/6ljaJVb4SZiwIKeUnrT5l0gkT8z+n4hKpC+jpOv6O9R+gLtag7pSA==",
+      "license": "MIT",
+      "dependencies": {
+        "clone-deep": "^4.0.1",
+        "flat": "^5.0.2",
+        "wildcard": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=10.0.0"
+      }
+    },
+    "node_modules/webpack-sources": {
+      "version": "3.2.3",
+      "resolved": "https://registry.npmmirror.com/webpack-sources/-/webpack-sources-3.2.3.tgz",
+      "integrity": "sha512-/DyMEOrDgLKKIG0fmvtz+4dUX/3Ghozwgm6iPp8KRhvn+eQf9+Q7GWxVNMk3+uCPWfdXYC4ExGBckIXdFEfH1w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=10.13.0"
+      }
+    },
+    "node_modules/webpack/node_modules/ajv": {
+      "version": "6.12.6",
+      "resolved": "https://registry.npmmirror.com/ajv/-/ajv-6.12.6.tgz",
+      "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.1",
+        "fast-json-stable-stringify": "^2.0.0",
+        "json-schema-traverse": "^0.4.1",
+        "uri-js": "^4.2.2"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/epoberezkin"
+      }
+    },
+    "node_modules/webpack/node_modules/ajv-keywords": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmmirror.com/ajv-keywords/-/ajv-keywords-3.5.2.tgz",
+      "integrity": "sha512-5p6WTN0DdTGVQk6VjcEju19IgaHudalcfabD7yhDGeA6bcQnmL+CpveLJq/3hvfwd1aof6L386Ougkx6RfyMIQ==",
+      "license": "MIT",
+      "peerDependencies": {
+        "ajv": "^6.9.1"
+      }
+    },
+    "node_modules/webpack/node_modules/json-schema-traverse": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmmirror.com/json-schema-traverse/-/json-schema-traverse-0.4.1.tgz",
+      "integrity": "sha512-xbbCH5dCYU5T8LcEhhuh7HJ88HXuW3qsI3Y0zOZFKfZEHcpWiHU/Jxzk629Brsab/mMiHQti9wMP+845RPe3Vg==",
+      "license": "MIT"
+    },
+    "node_modules/webpack/node_modules/mime-db": {
+      "version": "1.52.0",
+      "resolved": "https://registry.npmmirror.com/mime-db/-/mime-db-1.52.0.tgz",
+      "integrity": "sha512-sPU4uV7dYlvtWJxwwxHD0PuihVNiE7TyAbQ5SWxDCB9mUYvOgroQOwYQQOKPJ8CIbE+1ETVlOoK1UC2nU3gYvg==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/webpack/node_modules/mime-types": {
+      "version": "2.1.35",
+      "resolved": "https://registry.npmmirror.com/mime-types/-/mime-types-2.1.35.tgz",
+      "integrity": "sha512-ZDY+bPm5zTTF+YpCrAU9nK0UgICYPT0QtT1NZWFv4s++TNkcgVaT0g6+4R2uI4MjQjzysHB1zxuWL50hzaeXiw==",
+      "license": "MIT",
+      "dependencies": {
+        "mime-db": "1.52.0"
+      },
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/webpack/node_modules/schema-utils": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmmirror.com/schema-utils/-/schema-utils-3.3.0.tgz",
+      "integrity": "sha512-pN/yOAvcC+5rQ5nERGuwrjLlYvLTbCibnZ1I7B1LaiAz9BRBlE9GMgE/eqV30P7aJQUf7Ddimy/RsbYO/GrVGg==",
+      "license": "MIT",
+      "dependencies": {
+        "@types/json-schema": "^7.0.8",
+        "ajv": "^6.12.5",
+        "ajv-keywords": "^3.5.2"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      }
+    },
+    "node_modules/webpackbar": {
+      "version": "5.0.2",
+      "resolved": "https://registry.npmmirror.com/webpackbar/-/webpackbar-5.0.2.tgz",
+      "integrity": "sha512-BmFJo7veBDgQzfWXl/wwYXr/VFus0614qZ8i9znqcl9fnEdiVkdbi0TedLQ6xAK92HZHDJ0QmyQ0fmuZPAgCYQ==",
+      "license": "MIT",
+      "dependencies": {
+        "chalk": "^4.1.0",
+        "consola": "^2.15.3",
+        "pretty-time": "^1.1.0",
+        "std-env": "^3.0.1"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "peerDependencies": {
+        "webpack": "3 || 4 || 5"
+      }
+    },
+    "node_modules/websocket-driver": {
+      "version": "0.7.4",
+      "resolved": "https://registry.npmmirror.com/websocket-driver/-/websocket-driver-0.7.4.tgz",
+      "integrity": "sha512-b17KeDIQVjvb0ssuSDF2cYXSg2iztliJ4B9WdsuB6J952qCPKmnVq4DyW5motImXHDC1cBT/1UezrJVsKw5zjg==",
+      "license": "Apache-2.0",
+      "dependencies": {
+        "http-parser-js": ">=0.5.1",
+        "safe-buffer": ">=5.1.0",
+        "websocket-extensions": ">=0.1.1"
+      },
+      "engines": {
+        "node": ">=0.8.0"
+      }
+    },
+    "node_modules/websocket-extensions": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmmirror.com/websocket-extensions/-/websocket-extensions-0.1.4.tgz",
+      "integrity": "sha512-OqedPIGOfsDlo31UNwYbCFMSaO9m9G/0faIHj5/dZFDMFqPTcx6UwqyOy3COEaEOg/9VsGIpdqn62W5KhoKSpg==",
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=0.8.0"
+      }
+    },
+    "node_modules/which": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmmirror.com/which/-/which-2.0.2.tgz",
+      "integrity": "sha512-BLI3Tl1TW3Pvl70l3yq3Y64i+awpwXqsGBYWkkqMtnbXgrMD+yj7rhW0kuEDxzJaYXGjEW5ogapKNMEKNMjibA==",
+      "license": "ISC",
+      "dependencies": {
+        "isexe": "^2.0.0"
+      },
+      "bin": {
+        "node-which": "bin/node-which"
+      },
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/widest-line": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmmirror.com/widest-line/-/widest-line-4.0.1.tgz",
+      "integrity": "sha512-o0cyEG0e8GPzT4iGHphIOh0cJOV8fivsXxddQasHPHfoZf1ZexrfeA21w2NaEN1RHE+fXlfISmOE8R9N3u3Qig==",
+      "license": "MIT",
+      "dependencies": {
+        "string-width": "^5.0.1"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/wildcard": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmmirror.com/wildcard/-/wildcard-2.0.1.tgz",
+      "integrity": "sha512-CC1bOL87PIWSBhDcTrdeLo6eGT7mCFtrg0uIJtqJUFyK+eJnzl8A1niH56uu7KMa5XFrtiV+AQuHO3n7DsHnLQ==",
+      "license": "MIT"
+    },
+    "node_modules/wrap-ansi": {
+      "version": "8.1.0",
+      "resolved": "https://registry.npmmirror.com/wrap-ansi/-/wrap-ansi-8.1.0.tgz",
+      "integrity": "sha512-si7QWI6zUMq56bESFvagtmzMdGOtoxfR+Sez11Mobfc7tm+VkUckk9bW2UeffTGVUbOksxmSw0AA2gs8g71NCQ==",
+      "license": "MIT",
+      "dependencies": {
+        "ansi-styles": "^6.1.0",
+        "string-width": "^5.0.1",
+        "strip-ansi": "^7.0.1"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/wrap-ansi?sponsor=1"
+      }
+    },
+    "node_modules/wrap-ansi/node_modules/ansi-regex": {
+      "version": "6.1.0",
+      "resolved": "https://registry.npmmirror.com/ansi-regex/-/ansi-regex-6.1.0.tgz",
+      "integrity": "sha512-7HSX4QQb4CspciLpVFwyRe79O3xsIZDDLER21kERQ71oaPodF8jL725AgJMFAYbooIqolJoRLuM81SpeUkpkvA==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/ansi-regex?sponsor=1"
+      }
+    },
+    "node_modules/wrap-ansi/node_modules/ansi-styles": {
+      "version": "6.2.1",
+      "resolved": "https://registry.npmmirror.com/ansi-styles/-/ansi-styles-6.2.1.tgz",
+      "integrity": "sha512-bN798gFfQX+viw3R7yrGWRqnrN2oRkEkUjjl4JNn4E8GxxbjtG3FbrEIIY3l8/hrwUwIeCZvi4QuOTP4MErVug==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/ansi-styles?sponsor=1"
+      }
+    },
+    "node_modules/wrap-ansi/node_modules/strip-ansi": {
+      "version": "7.1.0",
+      "resolved": "https://registry.npmmirror.com/strip-ansi/-/strip-ansi-7.1.0.tgz",
+      "integrity": "sha512-iq6eVVI64nQQTRYq2KtEg2d2uU7LElhTJwsH4YzIHZshxlgZms/wIc4VoDQTlG/IvVIrBKG06CrZnp0qv7hkcQ==",
+      "license": "MIT",
+      "dependencies": {
+        "ansi-regex": "^6.0.1"
+      },
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/chalk/strip-ansi?sponsor=1"
+      }
+    },
+    "node_modules/wrappy": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmmirror.com/wrappy/-/wrappy-1.0.2.tgz",
+      "integrity": "sha512-l4Sp/DRseor9wL6EvV2+TuQn63dMkPjZ/sp9XkghTEbV9KlPS1xUsZ3u7/IQO4wxtcFB4bgpQPRcR3QCvezPcQ==",
+      "license": "ISC"
+    },
+    "node_modules/write-file-atomic": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmmirror.com/write-file-atomic/-/write-file-atomic-3.0.3.tgz",
+      "integrity": "sha512-AvHcyZ5JnSfq3ioSyjrBkH9yW4m7Ayk8/9My/DD9onKeu/94fwrMocemO2QAJFAlnnDN+ZDS+ZjAR5ua1/PV/Q==",
+      "license": "ISC",
+      "dependencies": {
+        "imurmurhash": "^0.1.4",
+        "is-typedarray": "^1.0.0",
+        "signal-exit": "^3.0.2",
+        "typedarray-to-buffer": "^3.1.5"
+      }
+    },
+    "node_modules/ws": {
+      "version": "7.5.10",
+      "resolved": "https://registry.npmmirror.com/ws/-/ws-7.5.10.tgz",
+      "integrity": "sha512-+dbF1tHwZpXcbOJdVOkzLDxZP1ailvSxM6ZweXTegylPny803bFhA+vqBYw4s31NSAk4S2Qz+AKXK9a4wkdjcQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=8.3.0"
+      },
+      "peerDependencies": {
+        "bufferutil": "^4.0.1",
+        "utf-8-validate": "^5.0.2"
+      },
+      "peerDependenciesMeta": {
+        "bufferutil": {
+          "optional": true
+        },
+        "utf-8-validate": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/xdg-basedir": {
+      "version": "5.1.0",
+      "resolved": "https://registry.npmmirror.com/xdg-basedir/-/xdg-basedir-5.1.0.tgz",
+      "integrity": "sha512-GCPAHLvrIH13+c0SuacwvRYj2SxJXQ4kaVTT5xgL3kPrz56XxkF21IGhjSE1+W0aw7gpBWRGXLCPnPby6lSpmQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/xml-js": {
+      "version": "1.6.11",
+      "resolved": "https://registry.npmmirror.com/xml-js/-/xml-js-1.6.11.tgz",
+      "integrity": "sha512-7rVi2KMfwfWFl+GpPg6m80IVMWXLRjO+PxTq7V2CDhoGak0wzYzFgUY2m4XJ47OGdXd8eLE8EmwfAmdjw7lC1g==",
+      "license": "MIT",
+      "dependencies": {
+        "sax": "^1.2.4"
+      },
+      "bin": {
+        "xml-js": "bin/cli.js"
+      }
+    },
+    "node_modules/yallist": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmmirror.com/yallist/-/yallist-3.1.1.tgz",
+      "integrity": "sha512-a4UGQaWPH59mOXUYnAG2ewncQS4i4F43Tv3JoAM+s2VDAmS9NsK8GpDMLrCHPksFT7h3K6TOoUNn2pb7RoXx4g==",
+      "license": "ISC"
+    },
+    "node_modules/yaml": {
+      "version": "1.10.2",
+      "resolved": "https://registry.npmmirror.com/yaml/-/yaml-1.10.2.tgz",
+      "integrity": "sha512-r3vXyErRCYJ7wg28yvBY5VSoAF8ZvlcW9/BwUzEtUsjvX/DKs24dIkuwjtuprwJJHsbyUbLApepYTR1BN4uHrg==",
+      "license": "ISC",
+      "engines": {
+        "node": ">= 6"
+      }
+    },
+    "node_modules/yocto-queue": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmmirror.com/yocto-queue/-/yocto-queue-1.1.1.tgz",
+      "integrity": "sha512-b4JR1PFR10y1mKjhHY9LaGo6tmrgjit7hxVIeAmyMw3jegXR4dhYqLaQF5zMXZxY7tLpMyJeLjr1C4rLmkVe8g==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12.20"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/zwitch": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmmirror.com/zwitch/-/zwitch-2.0.4.tgz",
+      "integrity": "sha512-bXE4cR/kVZhKZX/RjPEflHaKVhUVl85noU3v6b8apfQEc1x4A+zBxjZ4lN8LqGd6WZ3dl98pY4o717VFmoPp+A==",
+      "license": "MIT",
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/wooorm"
+      }
+    }
+  }
+}
diff --git a/docs/docusaurus/package.json b/docs/docusaurus/package.json
new file mode 100644
index 0000000000..d1aed166c6
--- /dev/null
+++ b/docs/docusaurus/package.json
@@ -0,0 +1,56 @@
+{
+  "name": "docusaurus",
+  "version": "0.0.0",
+  "private": true,
+  "scripts": {
+    "docusaurus": "docusaurus",
+    "start": "docusaurus start",
+    "build": "docusaurus build",
+    "docusaurus:start": "docusaurus start",
+    "docusaurus:build": "docusaurus build",
+    "swizzle": "docusaurus swizzle",
+    "deploy": "docusaurus deploy",
+    "clear": "docusaurus clear",
+    "serve": "docusaurus serve",
+    "write-translations": "docusaurus write-translations",
+    "write-heading-ids": "docusaurus write-heading-ids",
+    "typecheck": "tsc"
+  },
+  "dependencies": {
+    "@docsearch/react": "^3.6.2",
+    "@docusaurus/core": "3.5.2",
+    "@docusaurus/preset-classic": "3.5.2",
+    "@mdx-js/react": "^3.0.0",
+    "antd": "^5.21.6",
+    "cheerio": "^1.0.0",
+    "clsx": "^2.0.0",
+    "fs-extra": "^11.2.0",
+    "node-fetch": "^3.3.2",
+    "prism-react-renderer": "^2.3.0",
+    "react": "^18.0.0",
+    "react-dom": "^18.0.0",
+    "react-select": "^5.8.2"
+  },
+  "devDependencies": {
+    "@docusaurus/module-type-aliases": "3.5.2",
+    "@docusaurus/tsconfig": "3.5.2",
+    "@docusaurus/types": "3.5.2",
+    "typescript": "~5.5.2"
+  },
+  "browserslist": {
+    "production": [
+      ">0.5%",
+      "not dead",
+      "not op_mini all"
+    ],
+    "development": [
+      "last 3 chrome version",
+      "last 3 firefox version",
+      "last 5 safari version"
+    ]
+  },
+  "engines": {
+    "node": ">=18.0"
+  },
+  "repository": "git@github.com:zhongyunWan/tugraph-db.git"
+}
diff --git a/docs/docusaurus/script/convert.js b/docs/docusaurus/script/convert.js
new file mode 100644
index 0000000000..b61acd939e
--- /dev/null
+++ b/docs/docusaurus/script/convert.js
@@ -0,0 +1,92 @@
+const fs = require('fs-extra');
+const path = require('path');
+
+const fetchDocHtmlMap = {
+  'version-4.5.0': {
+    'zh-CN': {
+      '3.C++-procedure': 'https://tugraph-db.readthedocs.io/zh-cn/v4.5.0/9.olap%26procedure/1.procedure/3.C%2B%2B-procedure.html',
+      '4.Python-procedure': 'https://tugraph-db.readthedocs.io/zh-cn/v4.5.0/9.olap%26procedure/1.procedure/4.Python-procedure.html'
+    },
+    'en-US': {
+      '3.C++-procedure': 'https://tugraph-db.readthedocs.io/en/v4.5.0/9.olap%26procedure/1.procedure/3.C%2B%2B-procedure.html',
+      '4.Python-procedure': 'https://tugraph-db.readthedocs.io/en/v4.5.0/9.olap%26procedure/1.procedure/4.Python-procedure.html'
+    }
+  },
+  'version-4.3.2': {
+    'zh-CN': {
+      '3.C++-procedure': 'https://tugraph-db.readthedocs.io/zh-cn/v4.3.2/9.olap%26procedure/1.procedure/3.C%2B%2B-procedure.html',
+      '4.Python-procedure': 'https://tugraph-db.readthedocs.io/zh-cn/v4.3.2/9.olap%26procedure/1.procedure/4.Python-procedure.html'
+    },
+    'en-US': {
+      '3.C++-procedure': 'https://tugraph-db.readthedocs.io/en/v4.3.2/9.olap%26procedure/1.procedure/3.C%2B%2B-procedure.html',
+      '4.Python-procedure': 'https://tugraph-db.readthedocs.io/en/v4.3.2/9.olap%26procedure/1.procedure/4.Python-procedure.html'
+    }
+  },
+  'version-4.3.0': {
+    'zh-CN': {
+      '3.C++-procedure': 'https://tugraph-db.readthedocs.io/zh-cn/v4.3.0/9.olap%26procedure/1.procedure/3.C%2B%2B-procedure.html',
+      '4.Python-procedure': 'https://tugraph-db.readthedocs.io/zh-cn/v4.3.0/9.olap%26procedure/1.procedure/4.Python-procedure.html'
+    },
+    'en-US': {
+      '3.C++-procedure': 'https://tugraph-db.readthedocs.io/en/v4.3.0/9.olap%26procedure/1.procedure/3.C%2B%2B-procedure.html',
+      '4.Python-procedure': 'https://tugraph-db.readthedocs.io/en/v4.3.0/9.olap%26procedure/1.procedure/4.Python-procedure.html'
+    }
+  },
+  'version-4.2.0': {
+    'zh-CN': {
+      '3.C++-procedure': 'https://tugraph-db.readthedocs.io/zh-cn/v4.2.0/9.olap%26procedure/1.procedure/3.C%2B%2B-procedure.html',
+      '4.Python-procedure': 'https://tugraph-db.readthedocs.io/zh-cn/v4.2.0/9.olap%26procedure/1.procedure/4.Python-procedure.html'
+    },
+    'en-US': {
+      '3.C++-procedure': 'https://tugraph-db.readthedocs.io/en/v4.2.0/9.olap%26procedure/1.procedure/3.C%2B%2B-procedure.html',
+      '4.Python-procedure': 'https://tugraph-db.readthedocs.io/en/v4.2.0/9.olap%26procedure/1.procedure/4.Python-procedure.html'
+    }
+  }
+};
+
+async function fetchAndSaveMarkdown(url, outputFilePath) {
+  const fetch = (await import('node-fetch')).default;
+  const cheerio = (await import('cheerio'));
+  try {
+    const response = await fetch(url);
+    if (!response.ok) {
+      throw new Error(`Network response was not ok ${response.statusText}`);
+    }
+    const htmlData = await response.text();
+
+    const $ = cheerio.load(htmlData);
+    const mainContent = $('div[itemprop="articleBody"]');
+
+    if (mainContent.length) {
+      mainContent.find('h1').remove();
+
+      const cleanedHtml = mainContent.html();
+      const markdownData = `\n${cleanedHtml}\n`;
+
+      await fs.writeFile(outputFilePath, markdownData, 'utf8');
+      console.log(`File has been saved: ${outputFilePath}`);
+    } else {
+      console.error('No <div itemprop="articleBody"> found in the HTML.');
+    }
+  } catch (error) {
+    console.error(`Fetch operation failed: ${error.message}`);
+  }
+}
+
+async function processVersionDocs(basePath, version, langMap) {
+  for (const [lang, docMap] of Object.entries(langMap)) {
+    for (const [docType, url] of Object.entries(docMap)) {
+      const mdFilePath = path.join(basePath, version, lang, 'source', '9.olap&procedure', '1.procedure', `${docType}.md`);
+      await fetchAndSaveMarkdown(url, mdFilePath);
+    }
+  }
+}
+
+async function main() {
+  const basePath = path.join(__dirname, '../versions');
+  for (const [version, langMap] of Object.entries(fetchDocHtmlMap)) {
+    await processVersionDocs(basePath, version, langMap);
+  }
+}
+
+main();
diff --git a/docs/docusaurus/sidebars.ts b/docs/docusaurus/sidebars.ts
new file mode 100644
index 0000000000..4eaa7129e8
--- /dev/null
+++ b/docs/docusaurus/sidebars.ts
@@ -0,0 +1,209 @@
+import type {SidebarsConfig} from '@docusaurus/plugin-content-docs';
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    'guide',
+    {
+      type: 'category',
+      label: 'Tugraph 入门',
+      items: [
+        'introduction/what-is-graph',
+        'introduction/what-is-gdbms',
+        'introduction/what-is-tugraph',
+        'introduction/schema',
+        {
+          type: 'category',
+          label: '产品特点',
+          items: [
+            'introduction/characteristics/performance-oriented',
+            'introduction/characteristics/multi-level-Interfaces',
+            'introduction/characteristics/htap'
+          ]
+        },
+        'introduction/architecture',
+        'introduction/functionality',
+        'introduction/scenarios',
+        'introduction/glossary'
+      ],
+    },
+    {
+      type: 'category',
+      label: '快速上手',
+      items: [
+        'quick-start/preparation',
+        {
+          type: 'category',
+          label: 'demo 示例',
+          items: [
+            'quick-start/demo/movie',
+            'quick-start/demo/wandering-earth',
+            'quick-start/demo/the-three-body',
+            'quick-start/demo/three-kingdoms',
+            'quick-start/demo/round-the-world'
+          ]
+        }
+      ]
+    },
+    {
+      type: 'category',
+      label: '可视化操作指南',
+      items: [
+        'user-guide/tugraph-browser',
+        'user-guide/tugraph-browser-legacy'
+      ]
+    },
+    {
+      type: 'category',
+      label: '安装和运行',
+      items: [
+        'installation&running/environment',
+        'installation&running/environment-mode',
+        'installation&running/docker-deployment',
+        'installation&running/local-package-deployment',
+        'installation&running/cloud-deployment',
+        'installation&running/compile',
+        'installation&running/tugraph-running',
+        'installation&running/high-availability-mode'
+      ]
+    },
+    {
+      type: 'category',
+      label: '实用工具',
+      items: [
+        'utility-tools/data-import',
+        'utility-tools/data-export',
+        'utility-tools/backup-and-restore',
+        'utility-tools/data-warmup',
+        'utility-tools/ha-cluster-management',
+        'utility-tools/tugraph-cli',
+        'utility-tools/tugraph-datax',
+        'utility-tools/tugraph-explorer',
+        'utility-tools/restful'
+      ]
+    },
+    {
+      type: 'category',
+      label: '客户端工具',
+      items: [
+        'client-tools/python-client',
+        'client-tools/cpp-client',
+        'client-tools/java-client',
+        'client-tools/tugraph-ogm',
+        'client-tools/bolt-client',
+        'client-tools/bolt-console-client',
+        'client-tools/restful-api',
+        'client-tools/rpc-api',
+        'client-tools/restful-api-legacy'
+      ]
+    },
+    {
+      type: 'category',
+      label: '查询语言',
+      items: [
+        'query/cypher',
+        'query/gql'
+      ]
+    },
+    {
+      type: 'category',
+      label: '存储过程和分析接口',
+      items: [
+        {
+          type: 'category',
+          label: '存储过程',
+          link: {
+            type: 'doc',
+            id: 'olap&procedure/procedure/procedure',
+          },
+          items: [
+            'olap&procedure/procedure/traversal',
+            // 'olap&procedure/procedure/C++-procedure',
+            // 'olap&procedure/procedure/Python-procedure',
+            'olap&procedure/procedure/Rust-procedure'
+          ]
+        },
+        {
+          type: 'category',
+          label: '分析接口',
+          items: [
+            'olap&procedure/olap/tutorial',
+            'olap&procedure/olap/olap-base-api',
+            'olap&procedure/olap/olap-on-db-api',
+            'olap&procedure/olap/olap-on-disk-api',
+            'olap&procedure/olap/python-api',
+            'olap&procedure/olap/algorithms'
+          ]
+        },
+        {
+          type: 'category',
+          label: '图学习',
+          items: [
+            'olap&procedure/learn/tutorial',
+            'olap&procedure/learn/sampling_api',
+            'olap&procedure/learn/training',
+            'olap&procedure/learn/heterogeneous_graph'
+          ]
+        }
+      ]
+    },
+    {
+      type: 'category',
+      label: '运维和权限管理',
+      items: [
+        'permission/privilege',
+        'permission/token',
+        'permission/reset_admin_password',
+        'permission/monitoring',
+        'permission/log'
+      ]
+    },
+    {
+      type: 'category',
+      label: '测试与质量保障',
+      items: [
+        'quality/unit-testing',
+        'quality/integration-testing'
+      ]
+    },
+    {
+      type: 'category',
+      label: '贡献者文档',
+      items: [
+        'contributor-manual/contributing',
+        'contributor-manual/community-roles',
+        'contributor-manual/individual-cla',
+        'contributor-manual/corporate-cla',
+        'contributor-manual/roadmap'
+      ]
+    },
+    {
+      type: 'category',
+      label: '最佳实践',
+      items: [
+        'best-practices/rdbms-to-tugraph',
+        'best-practices/learn_practices',
+        'best-practices/data_migration',
+        'best-practices/selection',
+        'best-practices/spatial'
+      ]
+    },
+    'faq',
+    'contacts'
+  ],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/sidebarsEn.ts b/docs/docusaurus/sidebarsEn.ts
new file mode 100644
index 0000000000..510690f715
--- /dev/null
+++ b/docs/docusaurus/sidebarsEn.ts
@@ -0,0 +1,18 @@
+import type {SidebarsConfig} from '@docusaurus/plugin-content-docs';
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/src/components/HomepageFeatures/index.tsx b/docs/docusaurus/src/components/HomepageFeatures/index.tsx
new file mode 100644
index 0000000000..7e72738d82
--- /dev/null
+++ b/docs/docusaurus/src/components/HomepageFeatures/index.tsx
@@ -0,0 +1,70 @@
+import clsx from 'clsx';
+import Heading from '@theme/Heading';
+import styles from './styles.module.css';
+
+type FeatureItem = {
+  title: string;
+  Svg: React.ComponentType<React.ComponentProps<'svg'>>;
+  description: JSX.Element;
+};
+
+const FeatureList: FeatureItem[] = [
+  {
+    title: 'Easy to Use',
+    Svg: require('@site/static/img/undraw_docusaurus_mountain.svg').default,
+    description: (
+      <>
+        Docusaurus was designed from the ground up to be easily installed and
+        used to get your website up and running quickly.
+      </>
+    ),
+  },
+  {
+    title: 'Focus on What Matters',
+    Svg: require('@site/static/img/undraw_docusaurus_tree.svg').default,
+    description: (
+      <>
+        Docusaurus lets you focus on your docs, and we&apos;ll do the chores. Go
+        ahead and move your docs into the <code>docs</code> directory.
+      </>
+    ),
+  },
+  {
+    title: 'Powered by React',
+    Svg: require('@site/static/img/undraw_docusaurus_react.svg').default,
+    description: (
+      <>
+        Extend or customize your website layout by reusing React. Docusaurus can
+        be extended while reusing the same header and footer.
+      </>
+    ),
+  },
+];
+
+function Feature({ title, Svg, description }: FeatureItem) {
+  return (
+    <div className={clsx('col col--4')}>
+      <div className="text--center">
+        <Svg className={styles.featureSvg} role="img" />
+      </div>
+      <div className="text--center padding-horiz--md">
+        <Heading as="h3">{title}</Heading>
+        <p>{description}</p>
+      </div>
+    </div>
+  );
+}
+
+export default function HomepageFeatures(): JSX.Element {
+  return (
+    <section className={styles.features}>
+      <div className="container">
+        <div className="row">
+          {FeatureList.map((props, idx) => (
+            <Feature key={idx} {...props} />
+          ))}
+        </div>
+      </div>
+    </section>
+  );
+}
diff --git a/docs/docusaurus/src/components/HomepageFeatures/styles.module.css b/docs/docusaurus/src/components/HomepageFeatures/styles.module.css
new file mode 100644
index 0000000000..b248eb2e5d
--- /dev/null
+++ b/docs/docusaurus/src/components/HomepageFeatures/styles.module.css
@@ -0,0 +1,11 @@
+.features {
+  display: flex;
+  align-items: center;
+  padding: 2rem 0;
+  width: 100%;
+}
+
+.featureSvg {
+  height: 200px;
+  width: 200px;
+}
diff --git a/docs/docusaurus/src/constants/index.ts b/docs/docusaurus/src/constants/index.ts
new file mode 100644
index 0000000000..3b51498ebe
--- /dev/null
+++ b/docs/docusaurus/src/constants/index.ts
@@ -0,0 +1,153 @@
+import { DocSearchTranslations } from "@docsearch/react";
+
+const EN_TRANSLATIONS: DocSearchTranslations = {
+  button: {
+    buttonText: "Search",
+    buttonAriaLabel: "Search",
+  },
+  modal: {
+    searchBox: {
+      resetButtonTitle: "Clear the query",
+      resetButtonAriaLabel: "Clear the query",
+      cancelButtonText: "Cancel",
+      cancelButtonAriaLabel: "Cancel",
+      searchInputLabel: "Search",
+    },
+    startScreen: {
+      recentSearchesTitle: "Recent",
+      noRecentSearchesText: "No recent searches",
+      saveRecentSearchButtonTitle: "Save this search",
+      removeRecentSearchButtonTitle: "Remove this search from history",
+      favoriteSearchesTitle: "Favorite",
+      removeFavoriteSearchButtonTitle: "Remove this search from favorites",
+    },
+    errorScreen: {
+      titleText: "Unable to fetch results",
+      helpText: "You might want to check your network connection.",
+    },
+    footer: {
+      selectText: "to select",
+      selectKeyAriaLabel: "Enter key",
+      navigateText: "to navigate",
+      navigateUpKeyAriaLabel: "Arrow up",
+      navigateDownKeyAriaLabel: "Arrow down",
+      closeText: "to close",
+      closeKeyAriaLabel: "Escape key",
+      searchByText: "Search by",
+    },
+    noResultsScreen: {
+      noResultsText: "No results for",
+      suggestedQueryText: "Try searching for",
+      reportMissingResultsText: "Believe this query should return results?",
+      reportMissingResultsLinkText: "Let us know.",
+    },
+  },
+};
+
+const ZH_TRANSLATIONS: DocSearchTranslations = {
+  button: {
+    buttonText: "搜索",
+    buttonAriaLabel: "搜索",
+  },
+  modal: {
+    searchBox: {
+      resetButtonTitle: "盒子",
+      resetButtonAriaLabel: "清除查询",
+      cancelButtonText: "取消",
+      cancelButtonAriaLabel: "取消",
+      searchInputLabel: "搜索文档",
+    },
+    startScreen: {
+      recentSearchesTitle: "最近的",
+      noRecentSearchesText: "没有最近搜索记录",
+      saveRecentSearchButtonTitle: "保存此搜索",
+      removeRecentSearchButtonTitle: "从历史记录中删除此搜索",
+      favoriteSearchesTitle: "最喜欢的",
+      removeFavoriteSearchButtonTitle: "从收藏夹中删除此搜索",
+    },
+    errorScreen: {
+      titleText: "无法获取结果",
+      helpText: "您可能想检查您的网络连接.",
+    },
+    footer: {
+      selectText: "选择",
+      selectKeyAriaLabel: "输入键",
+      navigateText: "导航",
+      navigateUpKeyAriaLabel: "向上箭头",
+      navigateDownKeyAriaLabel: "向下箭头",
+      closeText: "关闭",
+      closeKeyAriaLabel: "退出键",
+      searchByText: "搜索提供",
+    },
+    noResultsScreen: {
+      noResultsText: "未搜索到",
+      suggestedQueryText: "尝试搜索",
+      reportMissingResultsText: "相信这个查询应该返回结果?",
+      reportMissingResultsLinkText: "让我们知道.",
+    },
+  },
+};
+
+const EN_NOT_FOUND_CONFIG = {
+  title: "Page Not Found",
+  descriptions: [
+    "We could not find what you were looking for.",
+    "Please contact the owner of the site that linked you to the original URL and let them know their link is broken.",
+  ],
+  homeBtnText: "Back to Home",
+};
+
+const ZH_NOT_FOUND_CONFIG = {
+  title: "找不到页面",
+  descriptions: [
+    "我们找不到您要找的页面",
+    "请联系原始链接来源网站的所有者，并告知他们链接已损坏",
+  ],
+  homeBtnText: "返回首页",
+};
+
+const versions = [
+  "4.5.1",
+  "4.3.2",
+  "4.3.1",
+  "4.3.0",
+  "4.2.0",
+  "4.1.0",
+  "4.0.1",
+  "3.6.0",
+  "3.5.1",
+];
+
+const EN_DOC_OPTIONS = [
+  {
+    label: "TuGraph DB Community",
+    value: "TuGraph_DB",
+    children: versions.map((item) => ({ value: item, label: item })),
+  },
+  {
+    label: "TuGraph Analytics Streaming Graph Computing Engine",
+    value: "TuGraph_Analytics",
+  },
+];
+
+const ZH_DOC_OPTIONS = [
+  {
+    label: "TuGraph DB 社区版",
+    value: "TuGraph_DB",
+    children: versions.map((item) => ({ value: item, label: item })),
+  },
+  {
+    label: "TuGraph Analytics 实时图计算引擎",
+    value: "TuGraph_Analytics",
+  },
+];
+
+export {
+  EN_TRANSLATIONS,
+  ZH_TRANSLATIONS,
+  ZH_NOT_FOUND_CONFIG,
+  EN_NOT_FOUND_CONFIG,
+  ZH_DOC_OPTIONS,
+  EN_DOC_OPTIONS,
+  versions,
+};
diff --git a/docs/docusaurus/src/css/custom.css b/docs/docusaurus/src/css/custom.css
new file mode 100644
index 0000000000..7c07cf816a
--- /dev/null
+++ b/docs/docusaurus/src/css/custom.css
@@ -0,0 +1,272 @@
+/**
+ * Any CSS included here will be global. The classic template
+ * bundles Infima by default. Infima is a CSS framework designed to
+ * work well for content-centric websites.
+ */
+
+/* You can override the default Infima variables here. */
+:root {
+  --ifm-color-primary: #1650ff;
+  --ifm-color-primary-dark: #003ef9;
+  --ifm-color-primary-darker: #003beb;
+  --ifm-color-primary-darkest: #0030c2;
+  --ifm-color-primary-light: #3265ff;
+  --ifm-color-primary-lighter: #406fff;
+  --ifm-color-primary-lightest: #698eff;
+  --ifm-code-font-size: 95%;
+  --ifm-navbar-height: 0px;
+  --docusaurus-highlighted-code-line-bg: rgba(0, 0, 0, 0.1);
+}
+
+:root {
+  --doc-sidebar-width: 208px !important;
+}
+
+/* For readability concerns, you should choose a lighter palette in dark mode. */
+[data-theme="dark"] {
+  --ifm-color-primary: #25c2a0;
+  --ifm-color-primary-dark: #21af90;
+  --ifm-color-primary-darker: #1fa588;
+  --ifm-color-primary-darkest: #1a8870;
+  --ifm-color-primary-light: #29d5b0;
+  --ifm-color-primary-lighter: #32d8b4;
+  --ifm-color-primary-lightest: #4fddbf;
+  --docusaurus-highlighted-code-line-bg: rgba(0, 0, 0, 0.3);
+}
+
+.navbar {
+  display: none;
+}
+
+#__docusaurus {
+  padding: 0 120px;
+  background-color: transparent;
+  cursor: pointer !important;
+}
+
+.headerlink {
+  display: none;
+}
+
+/* Sidebar Style */
+.thin-scrollbar {
+  padding: 0 !important;
+}
+
+.menu__link--sublist-caret:after {
+  transform: rotate(180deg) !important;
+  background-size: 1rem 1rem;
+}
+
+.theme-doc-sidebar-container {
+  margin-right: 20px;
+  border: none !important;
+}
+
+.menu__link {
+  font-size: 14px !important;
+  color: #545762 !important;
+  font-weight: 400;
+}
+
+.menu__list-item-collapsible,
+.menu__list-item {
+  border-radius: 8px;
+}
+
+.menu__list-item-collapsible > a,
+.menu__list-item > a {
+  line-height: 22px;
+}
+
+.menu__link--active {
+  background: #0e0b3b0d;
+  border-radius: 8px;
+  font-size: 14px;
+  color: #292d3b !important;
+  line-height: 22px;
+  font-weight: 500;
+}
+
+.clean-btn::before {
+  background-size: 1rem 1rem;
+}
+
+.sidebarViewport_aRkj::-webkit-scrollbar {
+  display: none; /* 隐藏滚动条 */
+}
+.sidebarViewport_aRkj {
+  -ms-overflow-style: none; /* IE 和 Edge */
+  scrollbar-width: none; /* Firefox */
+  overflow-y: auto !important; /* 保持内容可滚动 */
+}
+
+/* Docs container Style */
+.container {
+  background: #ffffff;
+  border-radius: 12px;
+  padding: 14px 32px;
+  font-size: 14px !important;
+}
+
+.markdown > h2,
+.markdown > h3,
+.markdown > h4,
+.markdown > h5 {
+  color: #292d3b !important;
+  font-weight: 600 !important;
+}
+
+.markdown h1:first-child {
+  font-size: 26px !important;
+  color: #292d3b !important;
+  font-weight: 600 !important;
+}
+
+.markdown > h2 {
+  font-size: 20px !important;
+  margin-top: 28px !important;
+}
+
+.markdown > h3 {
+  font-size: 18px !important;
+}
+.markdown > h4 {
+  font-size: 16px !important;
+}
+.markdown > h5 {
+  font-size: 14px !important;
+}
+
+.markdown > a {
+  font-size: 14px !important;
+  color: #2e5dfe !important;
+}
+
+.breadcrumbs__item:not(:last-child):after {
+  content: "/";
+  background: none;
+  margin: 0 0 0 5px !important;
+  font-size: 14px !important;
+}
+
+.breadcrumbs__link {
+  background-color: transparent !important;
+  font-size: 12px !important;
+  color: #0a0a0ae1 !important;
+  line-height: 20px;
+  padding: 0;
+}
+
+.markdown p,
+.markdown th,
+.markdown td,
+.markdown li,
+.markdown span {
+  font-size: 14px !important;
+  color: #1a1b25e0 !important;
+  line-height: 22px !important;
+}
+
+.table-of-contents li > a {
+  font-size: 14px;
+  color: #768191;
+}
+
+.table-of-contents > li > .table-of-contents__link--active {
+  font-size: 14px;
+  color: #2e5dfe;
+  font-weight: 500;
+}
+
+/* Cascader style */
+
+.ant-cascader-menu {
+  height: fit-content !important;
+}
+.itemWrapper {
+  display: flex;
+  flex-direction: column;
+  align-self: center;
+}
+
+.titleBlock {
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+}
+
+.titleText {
+  color: #31333d;
+  font-size: 14px;
+  font-weight: bold;
+}
+
+.downIcon {
+  flex-shrink: 0;
+  margin-left: 8px;
+  border: 4px solid transparent;
+  border-color: transparent transparent #4e5969 #4e5969;
+  transform: translateY(-2px) rotate(-45deg);
+  border-radius: 2px;
+}
+
+.contentArea {
+  display: flex;
+  flex-direction: row;
+  align-items: center;
+  margin-right: 5px;
+  margin-left: 2px;
+}
+
+#engineDescription {
+  color: #788495 !important;
+  font-size: 14px;
+}
+
+.versionLabel {
+  margin-left: 8px;
+  white-space: nowrap;
+  color: #788495;
+  font-size: 14px;
+}
+
+/* Search Style */
+.searchWrapper {
+  margin-top: 5px;
+  width: 16px;
+  height: 16px;
+  text-align: center;
+  overflow: hidden;
+  display: flex;
+  justify-content: center;
+  align-items: center;
+  cursor: pointer;
+  border-radius: 4px;
+}
+
+.searchWrapper:hover {
+  background: #0e0b3b0d;
+}
+
+.DocSearch-Button {
+  align-items: flex-start !important;
+  background: transparent !important;
+  padding: 0 !important;
+  height: fit-content !important;
+}
+
+.DocSearch-Button:hover {
+  box-shadow: none !important;
+  border: transparent;
+}
+
+.DocSearch-Button-Placeholder,
+.DocSearch-Button-Keys {
+  display: none !important;
+}
+
+.DocSearch-Search-Icon {
+  width: 13px !important;
+  height: 12px !important;
+}
diff --git a/docs/docusaurus/src/pages/index.module.css b/docs/docusaurus/src/pages/index.module.css
new file mode 100644
index 0000000000..ce4c5578c0
--- /dev/null
+++ b/docs/docusaurus/src/pages/index.module.css
@@ -0,0 +1,28 @@
+/**
+ * CSS files with the .module.css suffix will be treated as CSS modules
+ * and scoped locally.
+ */
+
+.heroBanner {
+  padding: 4rem 0;
+  text-align: center;
+  position: relative;
+  overflow: hidden;
+}
+
+@media screen and (max-width: 996px) {
+  .heroBanner {
+    padding: 2rem;
+  }
+}
+
+.buttons {
+  display: flex;
+  align-items: center;
+  justify-content: center;
+}
+
+.getStartedBtn {
+  background-color: #1650ff;
+  color: #fff !important;
+}
diff --git a/docs/docusaurus/src/pages/index.tsx b/docs/docusaurus/src/pages/index.tsx
new file mode 100644
index 0000000000..d1cbc59745
--- /dev/null
+++ b/docs/docusaurus/src/pages/index.tsx
@@ -0,0 +1,48 @@
+import clsx from "clsx";
+import Link from "@docusaurus/Link";
+import useDocusaurusContext from "@docusaurus/useDocusaurusContext";
+import Layout from "@theme/Layout";
+import HomepageFeatures from "@site/src/components/HomepageFeatures";
+import Heading from "@theme/Heading";
+
+import styles from "./index.module.css";
+
+function HomepageHeader() {
+  const { siteConfig } = useDocusaurusContext();
+  return (
+    <header className={clsx("hero", styles.heroBanner)}>
+      <div className="container">
+        <Heading as="h1" className="hero__title">
+          {siteConfig.title}
+        </Heading>
+        <p className="hero__subtitle">{siteConfig.tagline}</p>
+        <div className={styles.buttons}>
+          <Link
+            className={clsx(
+              "button button--secondary button--lg",
+              styles.getStartedBtn
+            )}
+            to="/zh/4.5.1/guide"
+          >
+            Get Started
+          </Link>
+        </div>
+      </div>
+    </header>
+  );
+}
+
+export default function Home(): JSX.Element {
+  const { siteConfig } = useDocusaurusContext();
+  return (
+    <Layout
+      title={`Hello from ${siteConfig.title}`}
+      description="Description will go into a meta tag in <head />"
+    >
+      <HomepageHeader />
+      <main>
+        <HomepageFeatures />
+      </main>
+    </Layout>
+  );
+}
diff --git a/docs/docusaurus/src/pages/markdown-page.md b/docs/docusaurus/src/pages/markdown-page.md
new file mode 100644
index 0000000000..9756c5b668
--- /dev/null
+++ b/docs/docusaurus/src/pages/markdown-page.md
@@ -0,0 +1,7 @@
+---
+title: Markdown page example
+---
+
+# Markdown page example
+
+You don't need React to write simple standalone pages.
diff --git a/docs/docusaurus/src/theme/DocBreadcrumbs/Items/Home/index.tsx b/docs/docusaurus/src/theme/DocBreadcrumbs/Items/Home/index.tsx
new file mode 100644
index 0000000000..a053a4a0a9
--- /dev/null
+++ b/docs/docusaurus/src/theme/DocBreadcrumbs/Items/Home/index.tsx
@@ -0,0 +1,50 @@
+import React from "react";
+import Link from "@docusaurus/Link";
+import { translate } from "@docusaurus/Translate";
+
+import { useLocation } from "@docusaurus/router";
+
+export default function HomeBreadcrumbItem(): JSX.Element {
+  const { pathname } = useLocation();
+
+  const homeHref = () => {
+    try {
+      const pathSegments = pathname
+        .split("/")
+        .filter((segment) => segment !== "");
+
+      // 截取前三个路径段
+      const basePathSegments = pathSegments.slice(0, 3);
+      const basePath = `/${basePathSegments.join("/")}/guide`;
+      return basePath;
+    } catch (error) {
+      console.error("Invalid URL:", error);
+      return "";
+    }
+  };
+
+  const homeText = () => {
+    const lang =
+      pathname?.split("/")?.find((item) => ["zh", "en"].includes(item)) || "en";
+    if (lang === "en") {
+      return "Docs";
+    }
+    return "文档";
+  };
+
+  return (
+    <li className="breadcrumbs__item">
+      <Link
+        aria-label={translate({
+          id: "theme.docs.breadcrumbs.home",
+          message: "Home page",
+          description: "The ARIA label for the home page in the breadcrumbs",
+        })}
+        className="breadcrumbs__link"
+        href={homeHref()}
+      >
+        <div style={{ color: "#1a1b2572" }}>{homeText()}</div>
+      </Link>
+    </li>
+  );
+}
diff --git a/docs/docusaurus/src/theme/DocSidebar/index.tsx b/docs/docusaurus/src/theme/DocSidebar/index.tsx
new file mode 100644
index 0000000000..aec4089f6f
--- /dev/null
+++ b/docs/docusaurus/src/theme/DocSidebar/index.tsx
@@ -0,0 +1,275 @@
+import React, { useEffect, useMemo, useRef } from "react";
+import DocSidebar from "@theme-original/DocSidebar";
+import type DocSidebarType from "@theme/DocSidebar";
+import type { WrapperProps } from "@docusaurus/types";
+import { useLocation, useHistory } from "react-router-dom";
+import { DocSearch } from "@docsearch/react";
+import Link from "@docusaurus/Link";
+import {
+  EN_DOC_OPTIONS,
+  EN_TRANSLATIONS,
+  ZH_DOC_OPTIONS,
+  ZH_TRANSLATIONS,
+} from "@site/src/constants";
+import { Cascader, Tooltip } from "antd";
+
+type Props = WrapperProps<typeof DocSidebarType>;
+
+export default function DocSidebarWrapper(props: Props): JSX.Element {
+  const location = useLocation();
+  const history = useHistory();
+  const { pathname } = location;
+  const languages = ["en", "zh"];
+  const versions = [
+    "4.5.1",
+    "4.3.2",
+    "4.3.1",
+    "4.3.0",
+    "4.2.0",
+    "4.1.0",
+    "4.0.1",
+    "3.6.0",
+    "3.5.1",
+  ];
+
+  const getCurrentLanguage = () => {
+    const segments = pathname.split("/");
+    return languages.find((lang) => segments.includes(lang)) || "en";
+  };
+
+  const getCurrentVersion = () => {
+    const segments = pathname.split("/");
+    const langIndex = segments.indexOf(getCurrentLanguage());
+    const versionIndex = langIndex + 1;
+
+    if (
+      segments.length > versionIndex &&
+      versions.includes(segments[versionIndex])
+    ) {
+      return { label: segments[versionIndex], value: segments[versionIndex] };
+    }
+    return { label: "4.5.1", value: "4.5.1" };
+  };
+
+  const formatDocSearchVersion = (tag: string) => {
+    return tag.replace(
+      /docs-(\d+\.\d+\.\d+)|docs-latest_zh/g,
+      (match, version) => {
+        if (["3.5.1", "3.5.0"].includes(version)) {
+          return "docs-3-6-0";
+        }
+
+        if (["4.0.1", "4.0.0"].includes(version)) {
+          return "docs-4-1-0";
+        }
+
+        if (["4.3.2", "4.3.1", "4.3.0", "4.2.0"].includes(version)) {
+          return "docs-4-5-0";
+        }
+
+        return `docs-${version.replace(/\./g, "-")}`;
+      }
+    );
+  };
+
+  const onVersionChange = (values) => {
+    const [type, version] = values;
+    const lang = getCurrentLanguage();
+    if (type === "TuGraph_Analytics") {
+      window.location.href = `https://liukaiming-alipay.github.io/tugraph-analytics/${lang}/introduction`;
+      return;
+    }
+
+    if (type === "TuGraph_Learn") {
+      const learnPath = `/tugraph-db/${lang}/${version}/olap&procedure/learn/tutorial`;
+      history.push(learnPath);
+      return;
+    }
+
+    const prefix = "/tugraph-db";
+    const basePath = `${prefix}/${lang}`;
+
+    // 构造新路径
+    const newPath = `${basePath}/${version}/guide`;
+    history.push(newPath);
+  };
+
+  const navigator = useRef({
+    navigate({ itemUrl }: { itemUrl?: string }) {
+      history.push(itemUrl!);
+    },
+  }).current;
+
+  const Hit: React.FC = ({ hit, children }) => {
+    return <Link to={hit.url}>{children}</Link>;
+  };
+
+  const replaceVersionInLink = (baseLink: string): string => {
+    const { value } = getCurrentVersion();
+    const updatedLink = baseLink.replace(/\/\d+\.\d+\.\d+\//, `/${value}/`);
+    return updatedLink;
+  };
+
+  const getDocSearchKey = useMemo(() => {
+    const { value } = getCurrentVersion();
+
+    if (
+      ["4.1.0", "4.0.1", "4.0.0", "3.6.0", "3.5.1", "3.5.0"].includes(value)
+    ) {
+      return {
+        apiKey: "7d995257839cea75cceb969a6d96e40a",
+        indexName: "zhongyunwanio",
+        appId: "FHM90YCZ2Z",
+      };
+    }
+
+    return {
+      apiKey: "829a7e48ddbd6916e159c003391543a0",
+      indexName: "zhongyunwanio",
+      appId: "DGYVABHR0M",
+    };
+  }, [location.pathname]);
+
+  const getTranslationsByLanguage = (lang: string) => {
+    if (lang === "zh") {
+      return ZH_TRANSLATIONS;
+    }
+    return EN_TRANSLATIONS;
+  };
+
+  const getPlaceholderByLanguage = (lang: string) => {
+    if (lang === "zh") {
+      return "搜索文档";
+    }
+    return "Search docs";
+  };
+
+  const getDescByLanguage = (lang: string) => {
+    if (lang === "zh") {
+      return "社区版";
+    }
+    return "Community";
+  };
+
+  const getOptions = (lang: string) => {
+    if (lang === "zh") {
+      return ZH_DOC_OPTIONS;
+    }
+    return EN_DOC_OPTIONS;
+  };
+
+  const customStyles = {
+    control: (provided: React.CSSProperties) => ({
+      ...provided,
+      width: "120px",
+      minHeight: "36px",
+      height: "36px",
+      margin: "10px 4px 0 8px",
+    }),
+    valueContainer: (provided: React.CSSProperties) => ({
+      ...provided,
+      padding: "0 8px",
+    }),
+  };
+
+  useEffect(() => {
+    const sendPostMsg = () => {
+      window.parent.postMessage({ path: window.location.pathname }, "*");
+    };
+
+    const sendPostHashMsg = () => {
+      window.parent.postMessage(
+        { path: window.location.pathname + window.location.hash },
+        "*"
+      );
+    };
+
+    window.addEventListener("click", sendPostMsg);
+    window.addEventListener("hashchange", sendPostHashMsg);
+
+    sendPostMsg();
+
+    return () => {
+      window.removeEventListener("click", sendPostMsg);
+      window.removeEventListener("hashchange", sendPostHashMsg);
+    };
+  }, []);
+
+  return (
+    <div
+      className="docsearch-wrapper"
+      style={{
+        display: "flex",
+        justifyContent: "center",
+        flexDirection: "column",
+      }}
+    >
+      <div
+        style={{
+          display: "flex",
+          justifyContent: "space-between",
+          marginBottom: "8px",
+        }}
+      >
+        <Cascader
+          allowClear={false}
+          value={["TuGraph_DB", getCurrentVersion()?.label]}
+          options={getOptions(getCurrentLanguage())}
+          onChange={onVersionChange}
+        >
+          <div className="itemWrapper">
+            <div className="titleBlock">
+              <span className="titleText">TuGraph DB</span>
+              <div className="downIcon" />
+            </div>
+            <div className="contentArea">
+              <span id="engineDescription">
+                {getDescByLanguage(getCurrentLanguage())}
+              </span>
+              <span className="versionLabel">
+                V{getCurrentVersion()?.label}
+              </span>
+            </div>
+          </div>
+        </Cascader>
+
+        <Tooltip
+          title={getPlaceholderByLanguage(getCurrentLanguage())}
+          trigger={["hover", "click"]}
+        >
+          <div className="searchWrapper">
+            <DocSearch
+              {...{
+                ...getDocSearchKey,
+                searchParameters: {
+                  facetFilters: [
+                    formatDocSearchVersion(
+                      `docusaurus_tag:docs-${
+                        getCurrentVersion()?.value
+                      }_${getCurrentLanguage()}-current`
+                    ),
+                  ],
+                },
+                hitComponent: Hit,
+                transformItems: (items) => {
+                  return items.map((item) => {
+                    return {
+                      ...item,
+                      url: replaceVersionInLink(
+                        "/tugraph-db" + item?.url?.split("/tugraph-db")[1] ?? ""
+                      ),
+                    };
+                  });
+                },
+                navigator: navigator,
+                translations: getTranslationsByLanguage(getCurrentLanguage()),
+                placeholder: getPlaceholderByLanguage(getCurrentLanguage()),
+              }}
+            />
+          </div>
+        </Tooltip>
+      </div>
+      <DocSidebar {...props} />
+    </div>
+  );
+}
diff --git a/docs/docusaurus/src/theme/NotFound/Content/index.tsx b/docs/docusaurus/src/theme/NotFound/Content/index.tsx
new file mode 100644
index 0000000000..d0acd4c2f9
--- /dev/null
+++ b/docs/docusaurus/src/theme/NotFound/Content/index.tsx
@@ -0,0 +1,54 @@
+import React, { useMemo } from "react";
+import clsx from "clsx";
+import { useLocation } from "react-router-dom";
+import type { Props } from "@theme/NotFound/Content";
+import Heading from "@theme/Heading";
+import { EN_NOT_FOUND_CONFIG, ZH_NOT_FOUND_CONFIG } from "@site/src/constants";
+
+export default function NotFoundContent({ className }: Props): JSX.Element {
+  const { pathname } = useLocation();
+
+  const getHomeHref = () => {
+    try {
+      const pathSegments = pathname
+        .split("/")
+        .filter((segment) => segment !== "");
+
+      // 截取前三个路径段
+      const basePathSegments = pathSegments.slice(0, 3);
+      const basePath = `/${basePathSegments.join("/")}/guide`;
+      return basePath;
+    } catch (error) {
+      console.error("Invalid URL:", error);
+      return "";
+    }
+  };
+
+  const contentConfig = useMemo(() => {
+    const lang =
+      pathname?.split("/")?.find((item) => ["zh", "en"].includes(item)) || "en";
+
+    if (lang === "en") {
+      return EN_NOT_FOUND_CONFIG;
+    }
+    return ZH_NOT_FOUND_CONFIG;
+  }, [pathname]);
+
+  return (
+    <main className={clsx(" margin-vert--xl", className)}>
+      <div className="row" >
+        <div className="col col--6 col--offset-3">
+          <Heading as="h1" className="hero__title">
+            {contentConfig.title}
+          </Heading>
+          {contentConfig.descriptions?.map((desc) => (
+            <p>{desc}</p>
+          ))}
+          <a href={getHomeHref()}>
+            {contentConfig.homeBtnText}
+          </a>
+        </div>
+      </div>
+    </main>
+  );
+}
diff --git a/docs/docusaurus/src/theme/NotFound/index.tsx b/docs/docusaurus/src/theme/NotFound/index.tsx
new file mode 100644
index 0000000000..16131e582d
--- /dev/null
+++ b/docs/docusaurus/src/theme/NotFound/index.tsx
@@ -0,0 +1,20 @@
+import React from "react";
+import { translate } from "@docusaurus/Translate";
+import { PageMetadata } from "@docusaurus/theme-common";
+import Layout from "@theme/Layout";
+import NotFoundContent from "@theme/NotFound/Content";
+
+export default function Index(): JSX.Element {
+  const title = translate({
+    id: "theme.NotFound.title",
+    message: "Page Not Found",
+  });
+  return (
+    <>
+      <PageMetadata title={title} />
+      <Layout>
+        <NotFoundContent />
+      </Layout>
+    </>
+  );
+}
diff --git a/docs/docusaurus/static/.nojekyll b/docs/docusaurus/static/.nojekyll
new file mode 100644
index 0000000000..e69de29bb2
diff --git a/docs/docusaurus/static/img/docusaurus-social-card.jpg b/docs/docusaurus/static/img/docusaurus-social-card.jpg
new file mode 100644
index 0000000000..ffcb448210
Binary files /dev/null and b/docs/docusaurus/static/img/docusaurus-social-card.jpg differ
diff --git a/docs/docusaurus/static/img/docusaurus.png b/docs/docusaurus/static/img/docusaurus.png
new file mode 100644
index 0000000000..f458149e3c
Binary files /dev/null and b/docs/docusaurus/static/img/docusaurus.png differ
diff --git a/docs/docusaurus/static/img/favicon.ico b/docs/docusaurus/static/img/favicon.ico
new file mode 100644
index 0000000000..c01d54bcd3
Binary files /dev/null and b/docs/docusaurus/static/img/favicon.ico differ
diff --git a/docs/docusaurus/static/img/logo.svg b/docs/docusaurus/static/img/logo.svg
new file mode 100644
index 0000000000..9db6d0d066
--- /dev/null
+++ b/docs/docusaurus/static/img/logo.svg
@@ -0,0 +1 @@
+<svg width="200" height="200" viewBox="0 0 200 200" xmlns="http://www.w3.org/2000/svg"><g fill="none" fill-rule="evenodd"><path fill="#FFF" d="M99 52h84v34H99z"/><path d="M23 163c-7.398 0-13.843-4.027-17.303-10A19.886 19.886 0 0 0 3 163c0 11.046 8.954 20 20 20h20v-20H23z" fill="#3ECC5F"/><path d="M112.98 57.376L183 53V43c0-11.046-8.954-20-20-20H73l-2.5-4.33c-1.112-1.925-3.889-1.925-5 0L63 23l-2.5-4.33c-1.111-1.925-3.889-1.925-5 0L53 23l-2.5-4.33c-1.111-1.925-3.889-1.925-5 0L43 23c-.022 0-.042.003-.065.003l-4.142-4.141c-1.57-1.571-4.252-.853-4.828 1.294l-1.369 5.104-5.192-1.392c-2.148-.575-4.111 1.389-3.535 3.536l1.39 5.193-5.102 1.367c-2.148.576-2.867 3.259-1.296 4.83l4.142 4.142c0 .021-.003.042-.003.064l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 53l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 63l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 73l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 83l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 93l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 103l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 113l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 123l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 133l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 143l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 153l-4.33 2.5c-1.925 1.111-1.925 3.889 0 5L23 163c0 11.046 8.954 20 20 20h120c11.046 0 20-8.954 20-20V83l-70.02-4.376A10.645 10.645 0 0 1 103 68c0-5.621 4.37-10.273 9.98-10.624" fill="#3ECC5F"/><path fill="#3ECC5F" d="M143 183h30v-40h-30z"/><path d="M193 158c-.219 0-.428.037-.639.064-.038-.15-.074-.301-.116-.451A5 5 0 0 0 190.32 148a4.96 4.96 0 0 0-3.016 1.036 26.531 26.531 0 0 0-.335-.336 4.955 4.955 0 0 0 1.011-2.987 5 5 0 0 0-9.599-1.959c-.148-.042-.297-.077-.445-.115.027-.211.064-.42.064-.639a5 5 0 0 0-5-5 5 5 0 0 0-5 5c0 .219.037.428.064.639-.148.038-.297.073-.445.115a4.998 4.998 0 0 0-9.599 1.959c0 1.125.384 2.151 1.011 2.987-3.717 3.632-6.031 8.693-6.031 14.3 0 11.046 8.954 20 20 20 9.339 0 17.16-6.41 19.361-15.064.211.027.42.064.639.064a5 5 0 0 0 5-5 5 5 0 0 0-5-5" fill="#44D860"/><path fill="#3ECC5F" d="M153 123h30v-20h-30z"/><path d="M193 115.5a2.5 2.5 0 1 0 0-5c-.109 0-.214.019-.319.032-.02-.075-.037-.15-.058-.225a2.501 2.501 0 0 0-.963-4.807c-.569 0-1.088.197-1.508.518a6.653 6.653 0 0 0-.168-.168c.314-.417.506-.931.506-1.494a2.5 2.5 0 0 0-4.8-.979A9.987 9.987 0 0 0 183 103c-5.522 0-10 4.478-10 10s4.478 10 10 10c.934 0 1.833-.138 2.69-.377a2.5 2.5 0 0 0 4.8-.979c0-.563-.192-1.077-.506-1.494.057-.055.113-.111.168-.168.42.321.939.518 1.508.518a2.5 2.5 0 0 0 .963-4.807c.021-.074.038-.15.058-.225.105.013.21.032.319.032" fill="#44D860"/><path d="M63 55.5a2.5 2.5 0 0 1-2.5-2.5c0-4.136-3.364-7.5-7.5-7.5s-7.5 3.364-7.5 7.5a2.5 2.5 0 1 1-5 0c0-6.893 5.607-12.5 12.5-12.5S65.5 46.107 65.5 53a2.5 2.5 0 0 1-2.5 2.5" fill="#000"/><path d="M103 183h60c11.046 0 20-8.954 20-20V93h-60c-11.046 0-20 8.954-20 20v70z" fill="#FFFF50"/><path d="M168.02 124h-50.04a1 1 0 1 1 0-2h50.04a1 1 0 1 1 0 2m0 20h-50.04a1 1 0 1 1 0-2h50.04a1 1 0 1 1 0 2m0 20h-50.04a1 1 0 1 1 0-2h50.04a1 1 0 1 1 0 2m0-49.814h-50.04a1 1 0 1 1 0-2h50.04a1 1 0 1 1 0 2m0 19.814h-50.04a1 1 0 1 1 0-2h50.04a1 1 0 1 1 0 2m0 20h-50.04a1 1 0 1 1 0-2h50.04a1 1 0 1 1 0 2M183 61.611c-.012 0-.022-.006-.034-.005-3.09.105-4.552 3.196-5.842 5.923-1.346 2.85-2.387 4.703-4.093 4.647-1.889-.068-2.969-2.202-4.113-4.46-1.314-2.594-2.814-5.536-5.963-5.426-3.046.104-4.513 2.794-5.807 5.167-1.377 2.528-2.314 4.065-4.121 3.994-1.927-.07-2.951-1.805-4.136-3.813-1.321-2.236-2.848-4.75-5.936-4.664-2.994.103-4.465 2.385-5.763 4.4-1.373 2.13-2.335 3.428-4.165 3.351-1.973-.07-2.992-1.51-4.171-3.177-1.324-1.873-2.816-3.993-5.895-3.89-2.928.1-4.399 1.97-5.696 3.618-1.232 1.564-2.194 2.802-4.229 2.724a1 1 0 0 0-.072 2c3.017.101 4.545-1.8 5.872-3.487 1.177-1.496 2.193-2.787 4.193-2.855 1.926-.082 2.829 1.115 4.195 3.045 1.297 1.834 2.769 3.914 5.731 4.021 3.103.104 4.596-2.215 5.918-4.267 1.182-1.834 2.202-3.417 4.15-3.484 1.793-.067 2.769 1.35 4.145 3.681 1.297 2.197 2.766 4.686 5.787 4.796 3.125.108 4.634-2.62 5.949-5.035 1.139-2.088 2.214-4.06 4.119-4.126 1.793-.042 2.728 1.595 4.111 4.33 1.292 2.553 2.757 5.445 5.825 5.556l.169.003c3.064 0 4.518-3.075 5.805-5.794 1.139-2.41 2.217-4.68 4.067-4.773v-2z" fill="#000"/><path fill="#3ECC5F" d="M83 183h40v-40H83z"/><path d="M143 158c-.219 0-.428.037-.639.064-.038-.15-.074-.301-.116-.451A5 5 0 0 0 140.32 148a4.96 4.96 0 0 0-3.016 1.036 26.531 26.531 0 0 0-.335-.336 4.955 4.955 0 0 0 1.011-2.987 5 5 0 0 0-9.599-1.959c-.148-.042-.297-.077-.445-.115.027-.211.064-.42.064-.639a5 5 0 0 0-5-5 5 5 0 0 0-5 5c0 .219.037.428.064.639-.148.038-.297.073-.445.115a4.998 4.998 0 0 0-9.599 1.959c0 1.125.384 2.151 1.011 2.987-3.717 3.632-6.031 8.693-6.031 14.3 0 11.046 8.954 20 20 20 9.339 0 17.16-6.41 19.361-15.064.211.027.42.064.639.064a5 5 0 0 0 5-5 5 5 0 0 0-5-5" fill="#44D860"/><path fill="#3ECC5F" d="M83 123h40v-20H83z"/><path d="M133 115.5a2.5 2.5 0 1 0 0-5c-.109 0-.214.019-.319.032-.02-.075-.037-.15-.058-.225a2.501 2.501 0 0 0-.963-4.807c-.569 0-1.088.197-1.508.518a6.653 6.653 0 0 0-.168-.168c.314-.417.506-.931.506-1.494a2.5 2.5 0 0 0-4.8-.979A9.987 9.987 0 0 0 123 103c-5.522 0-10 4.478-10 10s4.478 10 10 10c.934 0 1.833-.138 2.69-.377a2.5 2.5 0 0 0 4.8-.979c0-.563-.192-1.077-.506-1.494.057-.055.113-.111.168-.168.42.321.939.518 1.508.518a2.5 2.5 0 0 0 .963-4.807c.021-.074.038-.15.058-.225.105.013.21.032.319.032" fill="#44D860"/><path d="M143 41.75c-.16 0-.33-.02-.49-.05a2.52 2.52 0 0 1-.47-.14c-.15-.06-.29-.14-.431-.23-.13-.09-.259-.2-.38-.31-.109-.12-.219-.24-.309-.38s-.17-.28-.231-.43a2.619 2.619 0 0 1-.189-.96c0-.16.02-.33.05-.49.03-.16.08-.31.139-.47.061-.15.141-.29.231-.43.09-.13.2-.26.309-.38.121-.11.25-.22.38-.31.141-.09.281-.17.431-.23.149-.06.31-.11.47-.14.32-.07.65-.07.98 0 .159.03.32.08.47.14.149.06.29.14.43.23.13.09.259.2.38.31.11.12.22.25.31.38.09.14.17.28.23.43.06.16.11.31.14.47.029.16.05.33.05.49 0 .66-.271 1.31-.73 1.77-.121.11-.25.22-.38.31-.14.09-.281.17-.43.23a2.565 2.565 0 0 1-.96.19m20-1.25c-.66 0-1.3-.27-1.771-.73a3.802 3.802 0 0 1-.309-.38c-.09-.14-.17-.28-.231-.43a2.619 2.619 0 0 1-.189-.96c0-.66.27-1.3.729-1.77.121-.11.25-.22.38-.31.141-.09.281-.17.431-.23.149-.06.31-.11.47-.14.32-.07.66-.07.98 0 .159.03.32.08.47.14.149.06.29.14.43.23.13.09.259.2.38.31.459.47.73 1.11.73 1.77 0 .16-.021.33-.05.49-.03.16-.08.32-.14.47-.07.15-.14.29-.23.43-.09.13-.2.26-.31.38-.121.11-.25.22-.38.31-.14.09-.281.17-.43.23a2.565 2.565 0 0 1-.96.19" fill="#000"/></g></svg>
\ No newline at end of file
diff --git a/docs/docusaurus/static/img/undraw_docusaurus_mountain.svg b/docs/docusaurus/static/img/undraw_docusaurus_mountain.svg
new file mode 100644
index 0000000000..af961c49a8
--- /dev/null
+++ b/docs/docusaurus/static/img/undraw_docusaurus_mountain.svg
@@ -0,0 +1,171 @@
+<svg xmlns="http://www.w3.org/2000/svg" width="1088" height="687.962" viewBox="0 0 1088 687.962">
+  <title>Easy to Use</title>
+  <g id="Group_12" data-name="Group 12" transform="translate(-57 -56)">
+    <g id="Group_11" data-name="Group 11" transform="translate(57 56)">
+      <path id="Path_83" data-name="Path 83" d="M1017.81,560.461c-5.27,45.15-16.22,81.4-31.25,110.31-20,38.52-54.21,54.04-84.77,70.28a193.275,193.275,0,0,1-27.46,11.94c-55.61,19.3-117.85,14.18-166.74,3.99a657.282,657.282,0,0,0-104.09-13.16q-14.97-.675-29.97-.67c-15.42.02-293.07,5.29-360.67-131.57-16.69-33.76-28.13-75-32.24-125.27-11.63-142.12,52.29-235.46,134.74-296.47,155.97-115.41,369.76-110.57,523.43,7.88C941.15,276.621,1036.99,396.031,1017.81,560.461Z" transform="translate(-56 -106.019)" fill="#3f3d56"/>
+      <path id="Path_84" data-name="Path 84" d="M986.56,670.771c-20,38.52-47.21,64.04-77.77,80.28a193.272,193.272,0,0,1-27.46,11.94c-55.61,19.3-117.85,14.18-166.74,3.99a657.3,657.3,0,0,0-104.09-13.16q-14.97-.675-29.97-.67-23.13.03-46.25,1.72c-100.17,7.36-253.82-6.43-321.42-143.29L382,283.981,444.95,445.6l20.09,51.59,55.37-75.98L549,381.981l130.2,149.27,36.8-81.27L970.78,657.9l14.21,11.59Z" transform="translate(-56 -106.019)" fill="#f2f2f2"/>
+      <path id="Path_85" data-name="Path 85" d="M302,282.962l26-57,36,83-31-60Z" opacity="0.1"/>
+      <path id="Path_86" data-name="Path 86" d="M610.5,753.821q-14.97-.675-29.97-.67L465.04,497.191Z" transform="translate(-56 -106.019)" opacity="0.1"/>
+      <path id="Path_87" data-name="Path 87" d="M464.411,315.191,493,292.962l130,150-132-128Z" opacity="0.1"/>
+      <path id="Path_88" data-name="Path 88" d="M908.79,751.051a193.265,193.265,0,0,1-27.46,11.94L679.2,531.251Z" transform="translate(-56 -106.019)" opacity="0.1"/>
+      <circle id="Ellipse_11" data-name="Ellipse 11" cx="3" cy="3" r="3" transform="translate(479 98.962)" fill="#f2f2f2"/>
+      <circle id="Ellipse_12" data-name="Ellipse 12" cx="3" cy="3" r="3" transform="translate(396 201.962)" fill="#f2f2f2"/>
+      <circle id="Ellipse_13" data-name="Ellipse 13" cx="2" cy="2" r="2" transform="translate(600 220.962)" fill="#f2f2f2"/>
+      <circle id="Ellipse_14" data-name="Ellipse 14" cx="2" cy="2" r="2" transform="translate(180 265.962)" fill="#f2f2f2"/>
+      <circle id="Ellipse_15" data-name="Ellipse 15" cx="2" cy="2" r="2" transform="translate(612 96.962)" fill="#f2f2f2"/>
+      <circle id="Ellipse_16" data-name="Ellipse 16" cx="2" cy="2" r="2" transform="translate(736 192.962)" fill="#f2f2f2"/>
+      <circle id="Ellipse_17" data-name="Ellipse 17" cx="2" cy="2" r="2" transform="translate(858 344.962)" fill="#f2f2f2"/>
+      <path id="Path_89" data-name="Path 89" d="M306,121.222h-2.76v-2.76h-1.48v2.76H299V122.7h2.76v2.759h1.48V122.7H306Z" fill="#f2f2f2"/>
+      <path id="Path_90" data-name="Path 90" d="M848,424.222h-2.76v-2.76h-1.48v2.76H841V425.7h2.76v2.759h1.48V425.7H848Z" fill="#f2f2f2"/>
+      <path id="Path_91" data-name="Path 91" d="M1144,719.981c0,16.569-243.557,74-544,74s-544-57.431-544-74,243.557,14,544,14S1144,703.413,1144,719.981Z" transform="translate(-56 -106.019)" fill="#3f3d56"/>
+      <path id="Path_92" data-name="Path 92" d="M1144,719.981c0,16.569-243.557,74-544,74s-544-57.431-544-74,243.557,14,544,14S1144,703.413,1144,719.981Z" transform="translate(-56 -106.019)" opacity="0.1"/>
+      <ellipse id="Ellipse_18" data-name="Ellipse 18" cx="544" cy="30" rx="544" ry="30" transform="translate(0 583.962)" fill="#3f3d56"/>
+      <path id="Path_93" data-name="Path 93" d="M624,677.981c0,33.137-14.775,24-33,24s-33,9.137-33-24,33-96,33-96S624,644.844,624,677.981Z" transform="translate(-56 -106.019)" fill="#ff6584"/>
+      <path id="Path_94" data-name="Path 94" d="M606,690.66c0,15.062-6.716,10.909-15,10.909s-15,4.153-15-10.909,15-43.636,15-43.636S606,675.6,606,690.66Z" transform="translate(-56 -106.019)" opacity="0.1"/>
+      <rect id="Rectangle_97" data-name="Rectangle 97" width="92" height="18" rx="9" transform="translate(489 604.962)" fill="#2f2e41"/>
+      <rect id="Rectangle_98" data-name="Rectangle 98" width="92" height="18" rx="9" transform="translate(489 586.962)" fill="#2f2e41"/>
+      <path id="Path_95" data-name="Path 95" d="M193,596.547c0,55.343,34.719,100.126,77.626,100.126" transform="translate(-56 -106.019)" fill="#3f3d56"/>
+      <path id="Path_96" data-name="Path 96" d="M270.626,696.673c0-55.965,38.745-101.251,86.626-101.251" transform="translate(-56 -106.019)" fill="#6c63ff"/>
+      <path id="Path_97" data-name="Path 97" d="M221.125,601.564c0,52.57,22.14,95.109,49.5,95.109" transform="translate(-56 -106.019)" fill="#6c63ff"/>
+      <path id="Path_98" data-name="Path 98" d="M270.626,696.673c0-71.511,44.783-129.377,100.126-129.377" transform="translate(-56 -106.019)" fill="#3f3d56"/>
+      <path id="Path_99" data-name="Path 99" d="M254.3,697.379s11.009-.339,14.326-2.7,16.934-5.183,17.757-1.395,16.544,18.844,4.115,18.945-28.879-1.936-32.19-3.953S254.3,697.379,254.3,697.379Z" transform="translate(-56 -106.019)" fill="#a8a8a8"/>
+      <path id="Path_100" data-name="Path 100" d="M290.716,710.909c-12.429.1-28.879-1.936-32.19-3.953-2.522-1.536-3.527-7.048-3.863-9.591l-.368.014s.7,8.879,4.009,10.9,19.761,4.053,32.19,3.953c3.588-.029,4.827-1.305,4.759-3.2C294.755,710.174,293.386,710.887,290.716,710.909Z" transform="translate(-56 -106.019)" opacity="0.2"/>
+      <path id="Path_101" data-name="Path 101" d="M777.429,633.081c0,38.029,23.857,68.8,53.341,68.8" transform="translate(-56 -106.019)" fill="#3f3d56"/>
+      <path id="Path_102" data-name="Path 102" d="M830.769,701.882c0-38.456,26.623-69.575,59.525-69.575" transform="translate(-56 -106.019)" fill="#6c63ff"/>
+      <path id="Path_103" data-name="Path 103" d="M796.755,636.528c0,36.124,15.213,65.354,34.014,65.354" transform="translate(-56 -106.019)" fill="#6c63ff"/>
+      <path id="Path_104" data-name="Path 104" d="M830.769,701.882c0-49.139,30.773-88.9,68.8-88.9" transform="translate(-56 -106.019)" fill="#3f3d56"/>
+      <path id="Path_105" data-name="Path 105" d="M819.548,702.367s7.565-.233,9.844-1.856,11.636-3.562,12.2-.958,11.368,12.949,2.828,13.018-19.844-1.33-22.119-2.716S819.548,702.367,819.548,702.367Z" transform="translate(-56 -106.019)" fill="#a8a8a8"/>
+      <path id="Path_106" data-name="Path 106" d="M844.574,711.664c-8.54.069-19.844-1.33-22.119-2.716-1.733-1.056-2.423-4.843-2.654-6.59l-.253.01s.479,6.1,2.755,7.487,13.579,2.785,22.119,2.716c2.465-.02,3.317-.9,3.27-2.2C847.349,711.159,846.409,711.649,844.574,711.664Z" transform="translate(-56 -106.019)" opacity="0.2"/>
+      <path id="Path_107" data-name="Path 107" d="M949.813,724.718s11.36-1.729,14.5-4.591,16.89-7.488,18.217-3.667,19.494,17.447,6.633,19.107-30.153,1.609-33.835-.065S949.813,724.718,949.813,724.718Z" transform="translate(-56 -106.019)" fill="#a8a8a8"/>
+      <path id="Path_108" data-name="Path 108" d="M989.228,734.173c-12.86,1.659-30.153,1.609-33.835-.065-2.8-1.275-4.535-6.858-5.2-9.45l-.379.061s1.833,9.109,5.516,10.783,20.975,1.725,33.835.065c3.712-.479,4.836-1.956,4.529-3.906C993.319,732.907,991.991,733.817,989.228,734.173Z" transform="translate(-56 -106.019)" opacity="0.2"/>
+      <path id="Path_109" data-name="Path 109" d="M670.26,723.9s9.587-1.459,12.237-3.875,14.255-6.32,15.374-3.095,16.452,14.725,5.6,16.125-25.448,1.358-28.555-.055S670.26,723.9,670.26,723.9Z" transform="translate(-56 -106.019)" fill="#a8a8a8"/>
+      <path id="Path_110" data-name="Path 110" d="M703.524,731.875c-10.853,1.4-25.448,1.358-28.555-.055-2.367-1.076-3.827-5.788-4.39-7.976l-.32.051s1.547,7.687,4.655,9.1,17.7,1.456,28.555.055c3.133-.4,4.081-1.651,3.822-3.3C706.977,730.807,705.856,731.575,703.524,731.875Z" transform="translate(-56 -106.019)" opacity="0.2"/>
+      <path id="Path_111" data-name="Path 111" d="M178.389,719.109s7.463-1.136,9.527-3.016,11.1-4.92,11.969-2.409,12.808,11.463,4.358,12.553-19.811,1.057-22.23-.043S178.389,719.109,178.389,719.109Z" transform="translate(-56 -106.019)" fill="#a8a8a8"/>
+      <path id="Path_112" data-name="Path 112" d="M204.285,725.321c-8.449,1.09-19.811,1.057-22.23-.043-1.842-.838-2.979-4.506-3.417-6.209l-.249.04s1.2,5.984,3.624,7.085,13.781,1.133,22.23.043c2.439-.315,3.177-1.285,2.976-2.566C206.973,724.489,206.1,725.087,204.285,725.321Z" transform="translate(-56 -106.019)" opacity="0.2"/>
+      <path id="Path_113" data-name="Path 113" d="M439.7,707.337c0,30.22-42.124,20.873-93.7,20.873s-93.074,9.347-93.074-20.873,42.118-36.793,93.694-36.793S439.7,677.117,439.7,707.337Z" transform="translate(-56 -106.019)" opacity="0.1"/>
+      <path id="Path_114" data-name="Path 114" d="M439.7,699.9c0,30.22-42.124,20.873-93.7,20.873s-93.074,9.347-93.074-20.873S295.04,663.1,346.616,663.1,439.7,669.676,439.7,699.9Z" transform="translate(-56 -106.019)" fill="#3f3d56"/>
+    </g>
+    <g id="docusaurus_keytar" transform="translate(312.271 493.733)">
+      <path id="Path_40" data-name="Path 40" d="M99,52h91.791V89.153H99Z" transform="translate(5.904 -14.001)" fill="#fff" fill-rule="evenodd"/>
+      <path id="Path_41" data-name="Path 41" d="M24.855,163.927A21.828,21.828,0,0,1,5.947,153a21.829,21.829,0,0,0,18.908,32.782H46.71V163.927Z" transform="translate(-3 -4.634)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_42" data-name="Path 42" d="M121.861,61.1l76.514-4.782V45.39A21.854,21.854,0,0,0,176.52,23.535H78.173L75.441,18.8a3.154,3.154,0,0,0-5.464,0l-2.732,4.732L64.513,18.8a3.154,3.154,0,0,0-5.464,0l-2.732,4.732L53.586,18.8a3.154,3.154,0,0,0-5.464,0L45.39,23.535c-.024,0-.046,0-.071,0l-4.526-4.525a3.153,3.153,0,0,0-5.276,1.414l-1.5,5.577-5.674-1.521a3.154,3.154,0,0,0-3.863,3.864L26,34.023l-5.575,1.494a3.155,3.155,0,0,0-1.416,5.278l4.526,4.526c0,.023,0,.046,0,.07L18.8,48.122a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,59.05a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,69.977a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,80.9a3.154,3.154,0,0,0,0,5.464L23.535,89.1,18.8,91.832a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,102.76a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,113.687a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,124.615a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,135.542a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,146.469a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,157.4a3.154,3.154,0,0,0,0,5.464l4.732,2.732L18.8,168.324a3.154,3.154,0,0,0,0,5.464l4.732,2.732A21.854,21.854,0,0,0,45.39,198.375H176.52a21.854,21.854,0,0,0,21.855-21.855V89.1l-76.514-4.782a11.632,11.632,0,0,1,0-23.219" transform="translate(-1.681 -17.226)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_43" data-name="Path 43" d="M143,186.71h32.782V143H143Z" transform="translate(9.984 -5.561)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_44" data-name="Path 44" d="M196.71,159.855a5.438,5.438,0,0,0-.7.07c-.042-.164-.081-.329-.127-.493a5.457,5.457,0,1,0-5.4-9.372q-.181-.185-.366-.367a5.454,5.454,0,1,0-9.384-5.4c-.162-.046-.325-.084-.486-.126a5.467,5.467,0,1,0-10.788,0c-.162.042-.325.08-.486.126a5.457,5.457,0,1,0-9.384,5.4,21.843,21.843,0,1,0,36.421,21.02,5.452,5.452,0,1,0,.7-10.858" transform="translate(10.912 -6.025)" fill="#44d860" fill-rule="evenodd"/>
+      <path id="Path_45" data-name="Path 45" d="M153,124.855h32.782V103H153Z" transform="translate(10.912 -9.271)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_46" data-name="Path 46" d="M194.855,116.765a2.732,2.732,0,1,0,0-5.464,2.811,2.811,0,0,0-.349.035c-.022-.082-.04-.164-.063-.246a2.733,2.733,0,0,0-1.052-5.253,2.7,2.7,0,0,0-1.648.566q-.09-.093-.184-.184a2.7,2.7,0,0,0,.553-1.633,2.732,2.732,0,0,0-5.245-1.07,10.928,10.928,0,1,0,0,21.031,2.732,2.732,0,0,0,5.245-1.07,2.7,2.7,0,0,0-.553-1.633q.093-.09.184-.184a2.7,2.7,0,0,0,1.648.566,2.732,2.732,0,0,0,1.052-5.253c.023-.081.042-.164.063-.246a2.814,2.814,0,0,0,.349.035" transform="translate(12.767 -9.377)" fill="#44d860" fill-rule="evenodd"/>
+      <path id="Path_47" data-name="Path 47" d="M65.087,56.891a2.732,2.732,0,0,1-2.732-2.732,8.2,8.2,0,0,0-16.391,0,2.732,2.732,0,0,1-5.464,0,13.659,13.659,0,0,1,27.319,0,2.732,2.732,0,0,1-2.732,2.732" transform="translate(0.478 -15.068)" fill-rule="evenodd"/>
+      <path id="Path_48" data-name="Path 48" d="M103,191.347h65.565a21.854,21.854,0,0,0,21.855-21.855V93H124.855A21.854,21.854,0,0,0,103,114.855Z" transform="translate(6.275 -10.199)" fill="#ffff50" fill-rule="evenodd"/>
+      <path id="Path_49" data-name="Path 49" d="M173.216,129.787H118.535a1.093,1.093,0,1,1,0-2.185h54.681a1.093,1.093,0,0,1,0,2.185m0,21.855H118.535a1.093,1.093,0,1,1,0-2.186h54.681a1.093,1.093,0,0,1,0,2.186m0,21.855H118.535a1.093,1.093,0,1,1,0-2.185h54.681a1.093,1.093,0,0,1,0,2.185m0-54.434H118.535a1.093,1.093,0,1,1,0-2.185h54.681a1.093,1.093,0,0,1,0,2.185m0,21.652H118.535a1.093,1.093,0,1,1,0-2.186h54.681a1.093,1.093,0,0,1,0,2.186m0,21.855H118.535a1.093,1.093,0,1,1,0-2.186h54.681a1.093,1.093,0,0,1,0,2.186M189.585,61.611c-.013,0-.024-.007-.037-.005-3.377.115-4.974,3.492-6.384,6.472-1.471,3.114-2.608,5.139-4.473,5.078-2.064-.074-3.244-2.406-4.494-4.874-1.436-2.835-3.075-6.049-6.516-5.929-3.329.114-4.932,3.053-6.346,5.646-1.5,2.762-2.529,4.442-4.5,4.364-2.106-.076-3.225-1.972-4.52-4.167-1.444-2.443-3.112-5.191-6.487-5.1-3.272.113-4.879,2.606-6.3,4.808-1.5,2.328-2.552,3.746-4.551,3.662-2.156-.076-3.27-1.65-4.558-3.472-1.447-2.047-3.077-4.363-6.442-4.251-3.2.109-4.807,2.153-6.224,3.954-1.346,1.709-2.4,3.062-4.621,2.977a1.093,1.093,0,0,0-.079,2.186c3.3.11,4.967-1.967,6.417-3.81,1.286-1.635,2.4-3.045,4.582-3.12,2.1-.09,3.091,1.218,4.584,3.327,1.417,2,3.026,4.277,6.263,4.394,3.391.114,5.022-2.42,6.467-4.663,1.292-2,2.406-3.734,4.535-3.807,1.959-.073,3.026,1.475,4.529,4.022,1.417,2.4,3.023,5.121,6.324,5.241,3.415.118,5.064-2.863,6.5-5.5,1.245-2.282,2.419-4.437,4.5-4.509,1.959-.046,2.981,1.743,4.492,4.732,1.412,2.79,3.013,5.95,6.365,6.071l.185,0c3.348,0,4.937-3.36,6.343-6.331,1.245-2.634,2.423-5.114,4.444-5.216Z" transform="translate(7.109 -13.11)" fill-rule="evenodd"/>
+      <path id="Path_50" data-name="Path 50" d="M83,186.71h43.71V143H83Z" transform="translate(4.42 -5.561)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <g id="Group_8" data-name="Group 8" transform="matrix(0.966, -0.259, 0.259, 0.966, 109.327, 91.085)">
+        <rect id="Rectangle_3" data-name="Rectangle 3" width="92.361" height="36.462" rx="2" transform="translate(0 0)" fill="#d8d8d8"/>
+        <g id="Group_2" data-name="Group 2" transform="translate(1.531 23.03)">
+          <rect id="Rectangle_4" data-name="Rectangle 4" width="5.336" height="5.336" rx="1" transform="translate(16.797 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_5" data-name="Rectangle 5" width="5.336" height="5.336" rx="1" transform="translate(23.12 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_6" data-name="Rectangle 6" width="5.336" height="5.336" rx="1" transform="translate(29.444 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_7" data-name="Rectangle 7" width="5.336" height="5.336" rx="1" transform="translate(35.768 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_8" data-name="Rectangle 8" width="5.336" height="5.336" rx="1" transform="translate(42.091 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_9" data-name="Rectangle 9" width="5.336" height="5.336" rx="1" transform="translate(48.415 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_10" data-name="Rectangle 10" width="5.336" height="5.336" rx="1" transform="translate(54.739 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_11" data-name="Rectangle 11" width="5.336" height="5.336" rx="1" transform="translate(61.063 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_12" data-name="Rectangle 12" width="5.336" height="5.336" rx="1" transform="translate(67.386 0)" fill="#4a4a4a"/>
+          <path id="Path_51" data-name="Path 51" d="M1.093,0H14.518a1.093,1.093,0,0,1,1.093,1.093V4.243a1.093,1.093,0,0,1-1.093,1.093H1.093A1.093,1.093,0,0,1,0,4.243V1.093A1.093,1.093,0,0,1,1.093,0ZM75,0H88.426a1.093,1.093,0,0,1,1.093,1.093V4.243a1.093,1.093,0,0,1-1.093,1.093H75a1.093,1.093,0,0,1-1.093-1.093V1.093A1.093,1.093,0,0,1,75,0Z" transform="translate(0 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+        </g>
+        <g id="Group_3" data-name="Group 3" transform="translate(1.531 10.261)">
+          <path id="Path_52" data-name="Path 52" d="M1.093,0H6.218A1.093,1.093,0,0,1,7.31,1.093V4.242A1.093,1.093,0,0,1,6.218,5.335H1.093A1.093,1.093,0,0,1,0,4.242V1.093A1.093,1.093,0,0,1,1.093,0Z" transform="translate(0 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+          <rect id="Rectangle_13" data-name="Rectangle 13" width="5.336" height="5.336" rx="1" transform="translate(8.299 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_14" data-name="Rectangle 14" width="5.336" height="5.336" rx="1" transform="translate(14.623 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_15" data-name="Rectangle 15" width="5.336" height="5.336" rx="1" transform="translate(20.947 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_16" data-name="Rectangle 16" width="5.336" height="5.336" rx="1" transform="translate(27.271 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_17" data-name="Rectangle 17" width="5.336" height="5.336" rx="1" transform="translate(33.594 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_18" data-name="Rectangle 18" width="5.336" height="5.336" rx="1" transform="translate(39.918 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_19" data-name="Rectangle 19" width="5.336" height="5.336" rx="1" transform="translate(46.242 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_20" data-name="Rectangle 20" width="5.336" height="5.336" rx="1" transform="translate(52.565 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_21" data-name="Rectangle 21" width="5.336" height="5.336" rx="1" transform="translate(58.888 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_22" data-name="Rectangle 22" width="5.336" height="5.336" rx="1" transform="translate(65.212 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_23" data-name="Rectangle 23" width="5.336" height="5.336" rx="1" transform="translate(71.536 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_24" data-name="Rectangle 24" width="5.336" height="5.336" rx="1" transform="translate(77.859 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_25" data-name="Rectangle 25" width="5.336" height="5.336" rx="1" transform="translate(84.183 0)" fill="#4a4a4a"/>
+        </g>
+        <g id="Group_4" data-name="Group 4" transform="translate(91.05 9.546) rotate(180)">
+          <path id="Path_53" data-name="Path 53" d="M1.093,0H6.219A1.093,1.093,0,0,1,7.312,1.093v3.15A1.093,1.093,0,0,1,6.219,5.336H1.093A1.093,1.093,0,0,1,0,4.243V1.093A1.093,1.093,0,0,1,1.093,0Z" transform="translate(0 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+          <rect id="Rectangle_26" data-name="Rectangle 26" width="5.336" height="5.336" rx="1" transform="translate(8.299 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_27" data-name="Rectangle 27" width="5.336" height="5.336" rx="1" transform="translate(14.623 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_28" data-name="Rectangle 28" width="5.336" height="5.336" rx="1" transform="translate(20.947 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_29" data-name="Rectangle 29" width="5.336" height="5.336" rx="1" transform="translate(27.271 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_30" data-name="Rectangle 30" width="5.336" height="5.336" rx="1" transform="translate(33.594 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_31" data-name="Rectangle 31" width="5.336" height="5.336" rx="1" transform="translate(39.918 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_32" data-name="Rectangle 32" width="5.336" height="5.336" rx="1" transform="translate(46.242 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_33" data-name="Rectangle 33" width="5.336" height="5.336" rx="1" transform="translate(52.565 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_34" data-name="Rectangle 34" width="5.336" height="5.336" rx="1" transform="translate(58.889 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_35" data-name="Rectangle 35" width="5.336" height="5.336" rx="1" transform="translate(65.213 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_36" data-name="Rectangle 36" width="5.336" height="5.336" rx="1" transform="translate(71.537 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_37" data-name="Rectangle 37" width="5.336" height="5.336" rx="1" transform="translate(77.86 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_38" data-name="Rectangle 38" width="5.336" height="5.336" rx="1" transform="translate(84.183 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_39" data-name="Rectangle 39" width="5.336" height="5.336" rx="1" transform="translate(8.299 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_40" data-name="Rectangle 40" width="5.336" height="5.336" rx="1" transform="translate(14.623 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_41" data-name="Rectangle 41" width="5.336" height="5.336" rx="1" transform="translate(20.947 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_42" data-name="Rectangle 42" width="5.336" height="5.336" rx="1" transform="translate(27.271 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_43" data-name="Rectangle 43" width="5.336" height="5.336" rx="1" transform="translate(33.594 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_44" data-name="Rectangle 44" width="5.336" height="5.336" rx="1" transform="translate(39.918 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_45" data-name="Rectangle 45" width="5.336" height="5.336" rx="1" transform="translate(46.242 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_46" data-name="Rectangle 46" width="5.336" height="5.336" rx="1" transform="translate(52.565 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_47" data-name="Rectangle 47" width="5.336" height="5.336" rx="1" transform="translate(58.889 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_48" data-name="Rectangle 48" width="5.336" height="5.336" rx="1" transform="translate(65.213 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_49" data-name="Rectangle 49" width="5.336" height="5.336" rx="1" transform="translate(71.537 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_50" data-name="Rectangle 50" width="5.336" height="5.336" rx="1" transform="translate(77.86 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_51" data-name="Rectangle 51" width="5.336" height="5.336" rx="1" transform="translate(84.183 0)" fill="#4a4a4a"/>
+        </g>
+        <g id="Group_6" data-name="Group 6" transform="translate(1.531 16.584)">
+          <path id="Path_54" data-name="Path 54" d="M1.093,0h7.3A1.093,1.093,0,0,1,9.485,1.093v3.15A1.093,1.093,0,0,1,8.392,5.336h-7.3A1.093,1.093,0,0,1,0,4.243V1.094A1.093,1.093,0,0,1,1.093,0Z" transform="translate(0 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+          <g id="Group_5" data-name="Group 5" transform="translate(10.671 0)">
+            <rect id="Rectangle_52" data-name="Rectangle 52" width="5.336" height="5.336" rx="1" fill="#4a4a4a"/>
+            <rect id="Rectangle_53" data-name="Rectangle 53" width="5.336" height="5.336" rx="1" transform="translate(6.324 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_54" data-name="Rectangle 54" width="5.336" height="5.336" rx="1" transform="translate(12.647 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_55" data-name="Rectangle 55" width="5.336" height="5.336" rx="1" transform="translate(18.971 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_56" data-name="Rectangle 56" width="5.336" height="5.336" rx="1" transform="translate(25.295 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_57" data-name="Rectangle 57" width="5.336" height="5.336" rx="1" transform="translate(31.619 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_58" data-name="Rectangle 58" width="5.336" height="5.336" rx="1" transform="translate(37.942 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_59" data-name="Rectangle 59" width="5.336" height="5.336" rx="1" transform="translate(44.265 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_60" data-name="Rectangle 60" width="5.336" height="5.336" rx="1" transform="translate(50.589 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_61" data-name="Rectangle 61" width="5.336" height="5.336" rx="1" transform="translate(56.912 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_62" data-name="Rectangle 62" width="5.336" height="5.336" rx="1" transform="translate(63.236 0)" fill="#4a4a4a"/>
+          </g>
+          <path id="Path_55" data-name="Path 55" d="M1.094,0H8A1.093,1.093,0,0,1,9.091,1.093v3.15A1.093,1.093,0,0,1,8,5.336H1.093A1.093,1.093,0,0,1,0,4.243V1.094A1.093,1.093,0,0,1,1.093,0Z" transform="translate(80.428 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+        </g>
+        <g id="Group_7" data-name="Group 7" transform="translate(1.531 29.627)">
+          <rect id="Rectangle_63" data-name="Rectangle 63" width="5.336" height="5.336" rx="1" transform="translate(0 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_64" data-name="Rectangle 64" width="5.336" height="5.336" rx="1" transform="translate(6.324 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_65" data-name="Rectangle 65" width="5.336" height="5.336" rx="1" transform="translate(12.647 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_66" data-name="Rectangle 66" width="5.336" height="5.336" rx="1" transform="translate(18.971 0)" fill="#4a4a4a"/>
+          <path id="Path_56" data-name="Path 56" d="M1.093,0H31.515a1.093,1.093,0,0,1,1.093,1.093V4.244a1.093,1.093,0,0,1-1.093,1.093H1.093A1.093,1.093,0,0,1,0,4.244V1.093A1.093,1.093,0,0,1,1.093,0ZM34.687,0h3.942a1.093,1.093,0,0,1,1.093,1.093V4.244a1.093,1.093,0,0,1-1.093,1.093H34.687a1.093,1.093,0,0,1-1.093-1.093V1.093A1.093,1.093,0,0,1,34.687,0Z" transform="translate(25.294 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+          <rect id="Rectangle_67" data-name="Rectangle 67" width="5.336" height="5.336" rx="1" transform="translate(66.003 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_68" data-name="Rectangle 68" width="5.336" height="5.336" rx="1" transform="translate(72.327 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_69" data-name="Rectangle 69" width="5.336" height="5.336" rx="1" transform="translate(84.183 0)" fill="#4a4a4a"/>
+          <path id="Path_57" data-name="Path 57" d="M5.336,0V1.18A1.093,1.093,0,0,1,4.243,2.273H1.093A1.093,1.093,0,0,1,0,1.18V0Z" transform="translate(83.59 2.273) rotate(180)" fill="#4a4a4a"/>
+          <path id="Path_58" data-name="Path 58" d="M5.336,0V1.18A1.093,1.093,0,0,1,4.243,2.273H1.093A1.093,1.093,0,0,1,0,1.18V0Z" transform="translate(78.255 3.063)" fill="#4a4a4a"/>
+        </g>
+        <rect id="Rectangle_70" data-name="Rectangle 70" width="88.927" height="2.371" rx="1.085" transform="translate(1.925 1.17)" fill="#4a4a4a"/>
+        <rect id="Rectangle_71" data-name="Rectangle 71" width="4.986" height="1.581" rx="0.723" transform="translate(4.1 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_72" data-name="Rectangle 72" width="4.986" height="1.581" rx="0.723" transform="translate(10.923 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_73" data-name="Rectangle 73" width="4.986" height="1.581" rx="0.723" transform="translate(16.173 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_74" data-name="Rectangle 74" width="4.986" height="1.581" rx="0.723" transform="translate(21.421 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_75" data-name="Rectangle 75" width="4.986" height="1.581" rx="0.723" transform="translate(26.671 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_76" data-name="Rectangle 76" width="4.986" height="1.581" rx="0.723" transform="translate(33.232 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_77" data-name="Rectangle 77" width="4.986" height="1.581" rx="0.723" transform="translate(38.48 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_78" data-name="Rectangle 78" width="4.986" height="1.581" rx="0.723" transform="translate(43.73 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_79" data-name="Rectangle 79" width="4.986" height="1.581" rx="0.723" transform="translate(48.978 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_80" data-name="Rectangle 80" width="4.986" height="1.581" rx="0.723" transform="translate(55.54 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_81" data-name="Rectangle 81" width="4.986" height="1.581" rx="0.723" transform="translate(60.788 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_82" data-name="Rectangle 82" width="4.986" height="1.581" rx="0.723" transform="translate(66.038 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_83" data-name="Rectangle 83" width="4.986" height="1.581" rx="0.723" transform="translate(72.599 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_84" data-name="Rectangle 84" width="4.986" height="1.581" rx="0.723" transform="translate(77.847 1.566)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_85" data-name="Rectangle 85" width="4.986" height="1.581" rx="0.723" transform="translate(83.097 1.566)" fill="#d8d8d8" opacity="0.136"/>
+      </g>
+      <path id="Path_59" data-name="Path 59" d="M146.71,159.855a5.439,5.439,0,0,0-.7.07c-.042-.164-.081-.329-.127-.493a5.457,5.457,0,1,0-5.4-9.372q-.181-.185-.366-.367a5.454,5.454,0,1,0-9.384-5.4c-.162-.046-.325-.084-.486-.126a5.467,5.467,0,1,0-10.788,0c-.162.042-.325.08-.486.126a5.457,5.457,0,1,0-9.384,5.4,21.843,21.843,0,1,0,36.421,21.02,5.452,5.452,0,1,0,.7-10.858" transform="translate(6.275 -6.025)" fill="#44d860" fill-rule="evenodd"/>
+      <path id="Path_60" data-name="Path 60" d="M83,124.855h43.71V103H83Z" transform="translate(4.42 -9.271)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_61" data-name="Path 61" d="M134.855,116.765a2.732,2.732,0,1,0,0-5.464,2.811,2.811,0,0,0-.349.035c-.022-.082-.04-.164-.063-.246a2.733,2.733,0,0,0-1.052-5.253,2.7,2.7,0,0,0-1.648.566q-.09-.093-.184-.184a2.7,2.7,0,0,0,.553-1.633,2.732,2.732,0,0,0-5.245-1.07,10.928,10.928,0,1,0,0,21.031,2.732,2.732,0,0,0,5.245-1.07,2.7,2.7,0,0,0-.553-1.633q.093-.09.184-.184a2.7,2.7,0,0,0,1.648.566,2.732,2.732,0,0,0,1.052-5.253c.023-.081.042-.164.063-.246a2.811,2.811,0,0,0,.349.035" transform="translate(7.202 -9.377)" fill="#44d860" fill-rule="evenodd"/>
+      <path id="Path_62" data-name="Path 62" d="M143.232,42.33a2.967,2.967,0,0,1-.535-.055,2.754,2.754,0,0,1-.514-.153,2.838,2.838,0,0,1-.471-.251,4.139,4.139,0,0,1-.415-.339,3.2,3.2,0,0,1-.338-.415A2.7,2.7,0,0,1,140.5,39.6a2.968,2.968,0,0,1,.055-.535,3.152,3.152,0,0,1,.152-.514,2.874,2.874,0,0,1,.252-.47,2.633,2.633,0,0,1,.753-.754,2.837,2.837,0,0,1,.471-.251,2.753,2.753,0,0,1,.514-.153,2.527,2.527,0,0,1,1.071,0,2.654,2.654,0,0,1,.983.4,4.139,4.139,0,0,1,.415.339,4.019,4.019,0,0,1,.339.415,2.786,2.786,0,0,1,.251.47,2.864,2.864,0,0,1,.208,1.049,2.77,2.77,0,0,1-.8,1.934,4.139,4.139,0,0,1-.415.339,2.722,2.722,0,0,1-1.519.459m21.855-1.366a2.789,2.789,0,0,1-1.935-.8,4.162,4.162,0,0,1-.338-.415,2.7,2.7,0,0,1-.459-1.519,2.789,2.789,0,0,1,.8-1.934,4.139,4.139,0,0,1,.415-.339,2.838,2.838,0,0,1,.471-.251,2.752,2.752,0,0,1,.514-.153,2.527,2.527,0,0,1,1.071,0,2.654,2.654,0,0,1,.983.4,4.139,4.139,0,0,1,.415.339,2.79,2.79,0,0,1,.8,1.934,3.069,3.069,0,0,1-.055.535,2.779,2.779,0,0,1-.153.514,3.885,3.885,0,0,1-.251.47,4.02,4.02,0,0,1-.339.415,4.138,4.138,0,0,1-.415.339,2.722,2.722,0,0,1-1.519.459" transform="translate(9.753 -15.532)" fill-rule="evenodd"/>
+    </g>
+  </g>
+</svg>
diff --git a/docs/docusaurus/static/img/undraw_docusaurus_react.svg b/docs/docusaurus/static/img/undraw_docusaurus_react.svg
new file mode 100644
index 0000000000..94b5cf08f8
--- /dev/null
+++ b/docs/docusaurus/static/img/undraw_docusaurus_react.svg
@@ -0,0 +1,170 @@
+<svg xmlns="http://www.w3.org/2000/svg" width="1041.277" height="554.141" viewBox="0 0 1041.277 554.141">
+  <title>Powered by React</title>
+  <g id="Group_24" data-name="Group 24" transform="translate(-440 -263)">
+    <g id="Group_23" data-name="Group 23" transform="translate(439.989 262.965)">
+      <path id="Path_299" data-name="Path 299" d="M1040.82,611.12q-1.74,3.75-3.47,7.4-2.7,5.67-5.33,11.12c-.78,1.61-1.56,3.19-2.32,4.77-8.6,17.57-16.63,33.11-23.45,45.89A73.21,73.21,0,0,1,942.44,719l-151.65,1.65h-1.6l-13,.14-11.12.12-34.1.37h-1.38l-17.36.19h-.53l-107,1.16-95.51,1-11.11.12-69,.75H429l-44.75.48h-.48l-141.5,1.53-42.33.46a87.991,87.991,0,0,1-10.79-.54h0c-1.22-.14-2.44-.3-3.65-.49a87.38,87.38,0,0,1-51.29-27.54C116,678.37,102.75,655,93.85,629.64q-1.93-5.49-3.6-11.12C59.44,514.37,97,380,164.6,290.08q4.25-5.64,8.64-11l.07-.08c20.79-25.52,44.1-46.84,68.93-62,44-26.91,92.75-34.49,140.7-11.9,40.57,19.12,78.45,28.11,115.17,30.55,3.71.24,7.42.42,11.11.53,84.23,2.65,163.17-27.7,255.87-47.29,3.69-.78,7.39-1.55,11.12-2.28,66.13-13.16,139.49-20.1,226.73-5.51a189.089,189.089,0,0,1,26.76,6.4q5.77,1.86,11.12,4c41.64,16.94,64.35,48.24,74,87.46q1.37,5.46,2.37,11.11C1134.3,384.41,1084.19,518.23,1040.82,611.12Z" transform="translate(-79.34 -172.91)" fill="#f2f2f2"/>
+      <path id="Path_300" data-name="Path 300" d="M576.36,618.52a95.21,95.21,0,0,1-1.87,11.12h93.7V618.52Zm-78.25,62.81,11.11-.09V653.77c-3.81-.17-7.52-.34-11.11-.52ZM265.19,618.52v11.12h198.5V618.52ZM1114.87,279h-74V191.51q-5.35-2.17-11.12-4V279H776.21V186.58c-3.73.73-7.43,1.5-11.12,2.28V279H509.22V236.15c-3.69-.11-7.4-.29-11.11-.53V279H242.24V217c-24.83,15.16-48.14,36.48-68.93,62h-.07v.08q-4.4,5.4-8.64,11h8.64V618.52h-83q1.66,5.63,3.6,11.12h79.39v93.62a87,87,0,0,0,12.2,2.79c1.21.19,2.43.35,3.65.49h0a87.991,87.991,0,0,0,10.79.54l42.33-.46v-97H498.11v94.21l11.11-.12V629.64H765.09V721l11.12-.12V629.64H1029.7v4.77c.76-1.58,1.54-3.16,2.32-4.77q2.63-5.45,5.33-11.12,1.73-3.64,3.47-7.4v-321h76.42Q1116.23,284.43,1114.87,279ZM242.24,618.52V290.08H498.11V618.52Zm267,0V290.08H765.09V618.52Zm520.48,0H776.21V290.08H1029.7Z" transform="translate(-79.34 -172.91)" opacity="0.1"/>
+      <path id="Path_301" data-name="Path 301" d="M863.09,533.65v13l-151.92,1.4-1.62.03-57.74.53-1.38.02-17.55.15h-.52l-106.98.99L349.77,551.4h-.15l-44.65.42-.48.01-198.4,1.82v-15l46.65-28,93.6-.78,2-.01.66-.01,2-.03,44.94-.37,2.01-.01.64-.01,2-.01L315,509.3l.38-.01,35.55-.3h.29l277.4-2.34,6.79-.05h.68l5.18-.05,37.65-.31,2-.03,1.85-.02h.96l11.71-.09,2.32-.03,3.11-.02,9.75-.09,15.47-.13,2-.02,3.48-.02h.65l74.71-.64Z" fill="#65617d"/>
+      <path id="Path_302" data-name="Path 302" d="M863.09,533.65v13l-151.92,1.4-1.62.03-57.74.53-1.38.02-17.55.15h-.52l-106.98.99L349.77,551.4h-.15l-44.65.42-.48.01-198.4,1.82v-15l46.65-28,93.6-.78,2-.01.66-.01,2-.03,44.94-.37,2.01-.01.64-.01,2-.01L315,509.3l.38-.01,35.55-.3h.29l277.4-2.34,6.79-.05h.68l5.18-.05,37.65-.31,2-.03,1.85-.02h.96l11.71-.09,2.32-.03,3.11-.02,9.75-.09,15.47-.13,2-.02,3.48-.02h.65l74.71-.64Z" opacity="0.2"/>
+      <path id="Path_303" data-name="Path 303" d="M375.44,656.57v24.49a6.13,6.13,0,0,1-3.5,5.54,6,6,0,0,1-2.5.6l-34.9.74a6,6,0,0,1-2.7-.57,6.12,6.12,0,0,1-3.57-5.57V656.57Z" transform="translate(-79.34 -172.91)" fill="#3f3d56"/>
+      <path id="Path_304" data-name="Path 304" d="M375.44,656.57v24.49a6.13,6.13,0,0,1-3.5,5.54,6,6,0,0,1-2.5.6l-34.9.74a6,6,0,0,1-2.7-.57,6.12,6.12,0,0,1-3.57-5.57V656.57Z" transform="translate(-79.34 -172.91)" opacity="0.1"/>
+      <path id="Path_305" data-name="Path 305" d="M377.44,656.57v24.49a6.13,6.13,0,0,1-3.5,5.54,6,6,0,0,1-2.5.6l-34.9.74a6,6,0,0,1-2.7-.57,6.12,6.12,0,0,1-3.57-5.57V656.57Z" transform="translate(-79.34 -172.91)" fill="#3f3d56"/>
+      <rect id="Rectangle_137" data-name="Rectangle 137" width="47.17" height="31.5" transform="translate(680.92 483.65)" fill="#3f3d56"/>
+      <rect id="Rectangle_138" data-name="Rectangle 138" width="47.17" height="31.5" transform="translate(680.92 483.65)" opacity="0.1"/>
+      <rect id="Rectangle_139" data-name="Rectangle 139" width="47.17" height="31.5" transform="translate(678.92 483.65)" fill="#3f3d56"/>
+      <path id="Path_306" data-name="Path 306" d="M298.09,483.65v4.97l-47.17,1.26v-6.23Z" opacity="0.1"/>
+      <path id="Path_307" data-name="Path 307" d="M460.69,485.27v168.2a4,4,0,0,1-3.85,3.95l-191.65,5.1h-.05a4,4,0,0,1-3.95-3.95V485.27a4,4,0,0,1,3.95-3.95h191.6a4,4,0,0,1,3.95,3.95Z" transform="translate(-79.34 -172.91)" fill="#65617d"/>
+      <path id="Path_308" data-name="Path 308" d="M265.19,481.32v181.2h-.05a4,4,0,0,1-3.95-3.95V485.27a4,4,0,0,1,3.95-3.95Z" transform="translate(-79.34 -172.91)" opacity="0.1"/>
+      <path id="Path_309" data-name="Path 309" d="M194.59,319.15h177.5V467.4l-177.5,4Z" fill="#39374d"/>
+      <path id="Path_310" data-name="Path 310" d="M726.09,483.65v6.41l-47.17-1.26v-5.15Z" opacity="0.1"/>
+      <path id="Path_311" data-name="Path 311" d="M867.69,485.27v173.3a4,4,0,0,1-4,3.95h0L672,657.42a4,4,0,0,1-3.85-3.95V485.27a4,4,0,0,1,3.95-3.95H863.7a4,4,0,0,1,3.99,3.95Z" transform="translate(-79.34 -172.91)" fill="#65617d"/>
+      <path id="Path_312" data-name="Path 312" d="M867.69,485.27v173.3a4,4,0,0,1-4,3.95h0V481.32h0a4,4,0,0,1,4,3.95Z" transform="translate(-79.34 -172.91)" opacity="0.1"/>
+      <path id="Path_313" data-name="Path 313" d="M775.59,319.15H598.09V467.4l177.5,4Z" fill="#39374d"/>
+      <path id="Path_314" data-name="Path 314" d="M663.19,485.27v168.2a4,4,0,0,1-3.85,3.95l-191.65,5.1h0a4,4,0,0,1-4-3.95V485.27a4,4,0,0,1,3.95-3.95h191.6A4,4,0,0,1,663.19,485.27Z" transform="translate(-79.34 -172.91)" fill="#65617d"/>
+      <path id="Path_315" data-name="Path 315" d="M397.09,319.15h177.5V467.4l-177.5,4Z" fill="#4267b2"/>
+      <path id="Path_316" data-name="Path 316" d="M863.09,533.65v13l-151.92,1.4-1.62.03-57.74.53-1.38.02-17.55.15h-.52l-106.98.99L349.77,551.4h-.15l-44.65.42-.48.01-198.4,1.82v-15l202.51-1.33h.48l40.99-.28h.19l283.08-1.87h.29l.17-.01h.47l4.79-.03h1.46l74.49-.5,4.4-.02.98-.01Z" opacity="0.1"/>
+      <circle id="Ellipse_111" data-name="Ellipse 111" cx="51.33" cy="51.33" r="51.33" transform="translate(435.93 246.82)" fill="#fbbebe"/>
+      <path id="Path_317" data-name="Path 317" d="M617.94,550.07s-99.5,12-90,0c3.44-4.34,4.39-17.2,4.2-31.85-.06-4.45-.22-9.06-.45-13.65-1.1-22-3.75-43.5-3.75-43.5s87-41,77-8.5c-4,13.13-2.69,31.57.35,48.88.89,5.05,1.92,10,3,14.7a344.66,344.66,0,0,0,9.65,33.92Z" transform="translate(-79.34 -172.91)" fill="#fbbebe"/>
+      <path id="Path_318" data-name="Path 318" d="M585.47,546c11.51-2.13,23.7-6,34.53-1.54,2.85,1.17,5.47,2.88,8.39,3.86s6.12,1.22,9.16,1.91c10.68,2.42,19.34,10.55,24.9,20s8.44,20.14,11.26,30.72l6.9,25.83c6,22.45,12,45.09,13.39,68.3a2437.506,2437.506,0,0,1-250.84,1.43c5.44-10.34,11-21.31,10.54-33s-7.19-23.22-4.76-34.74c1.55-7.34,6.57-13.39,9.64-20.22,8.75-19.52,1.94-45.79,17.32-60.65,6.92-6.68,17-9.21,26.63-8.89,12.28.41,24.85,4.24,37,6.11C555.09,547.48,569.79,548.88,585.47,546Z" transform="translate(-79.34 -172.91)" fill="#ff6584"/>
+      <path id="Path_319" data-name="Path 319" d="M716.37,657.17l-.1,1.43v.1l-.17,2.3-1.33,18.51-1.61,22.3-.46,6.28-1,13.44v.17l-107,1-175.59,1.9v.84h-.14v-1.12l.45-14.36.86-28.06.74-23.79.07-2.37a10.53,10.53,0,0,1,11.42-10.17c4.72.4,10.85.89,18.18,1.41l3,.22c42.33,2.94,120.56,6.74,199.5,2,1.66-.09,3.33-.19,5-.31,12.24-.77,24.47-1.76,36.58-3a10.53,10.53,0,0,1,11.6,11.23Z" transform="translate(-79.34 -172.91)" opacity="0.1"/>
+      <path id="Path_320" data-name="Path 320" d="M429.08,725.44v-.84l175.62-1.91,107-1h.3v-.17l1-13.44.43-6,1.64-22.61,1.29-17.9v-.44a10.617,10.617,0,0,0-.11-2.47.3.3,0,0,0,0-.1,10.391,10.391,0,0,0-2-4.64,10.54,10.54,0,0,0-9.42-4c-12.11,1.24-24.34,2.23-36.58,3-1.67.12-3.34.22-5,.31-78.94,4.69-157.17.89-199.5-2l-3-.22c-7.33-.52-13.46-1-18.18-1.41a10.54,10.54,0,0,0-11.24,8.53,11,11,0,0,0-.18,1.64l-.68,22.16L429.54,710l-.44,14.36v1.12Z" transform="translate(-79.34 -172.91)" fill="#3f3d56"/>
+      <path id="Path_321" data-name="Path 321" d="M716.67,664.18l-1.23,15.33-1.83,22.85-.46,5.72-1,12.81-.06.64v.17h0l-.15,1.48.11-1.48h-.29l-107,1-175.65,1.9v-.28l.49-14.36,1-28.06.64-18.65A6.36,6.36,0,0,1,434.3,658a6.25,6.25,0,0,1,3.78-.9c2.1.17,4.68.37,7.69.59,4.89.36,10.92.78,17.94,1.22,13,.82,29.31,1.7,48,2.42,52,2,122.2,2.67,188.88-3.17,3-.26,6.1-.55,9.13-.84a6.26,6.26,0,0,1,3.48.66,5.159,5.159,0,0,1,.86.54,6.14,6.14,0,0,1,2,2.46,3.564,3.564,0,0,1,.25.61A6.279,6.279,0,0,1,716.67,664.18Z" transform="translate(-79.34 -172.91)" opacity="0.1"/>
+      <path id="Path_322" data-name="Path 322" d="M377.44,677.87v3.19a6.13,6.13,0,0,1-3.5,5.54l-40.1.77a6.12,6.12,0,0,1-3.57-5.57v-3Z" transform="translate(-79.34 -172.91)" opacity="0.1"/>
+      <path id="Path_323" data-name="Path 323" d="M298.59,515.57l-52.25,1V507.9l52.25-1Z" fill="#3f3d56"/>
+      <path id="Path_324" data-name="Path 324" d="M298.59,515.57l-52.25,1V507.9l52.25-1Z" opacity="0.1"/>
+      <path id="Path_325" data-name="Path 325" d="M300.59,515.57l-52.25,1V507.9l52.25-1Z" fill="#3f3d56"/>
+      <path id="Path_326" data-name="Path 326" d="M758.56,679.87v3.19a6.13,6.13,0,0,0,3.5,5.54l40.1.77a6.12,6.12,0,0,0,3.57-5.57v-3Z" transform="translate(-79.34 -172.91)" opacity="0.1"/>
+      <path id="Path_327" data-name="Path 327" d="M678.72,517.57l52.25,1V509.9l-52.25-1Z" opacity="0.1"/>
+      <path id="Path_328" data-name="Path 328" d="M676.72,517.57l52.25,1V509.9l-52.25-1Z" fill="#3f3d56"/>
+      <path id="Path_329" data-name="Path 329" d="M534.13,486.79c.08,7-3.16,13.6-5.91,20.07a163.491,163.491,0,0,0-12.66,74.71c.73,11,2.58,22,.73,32.9s-8.43,21.77-19,24.9c17.53,10.45,41.26,9.35,57.76-2.66,8.79-6.4,15.34-15.33,21.75-24.11a97.86,97.86,0,0,1-13.31,44.75A103.43,103.43,0,0,0,637,616.53c4.31-5.81,8.06-12.19,9.72-19.23,3.09-13-1.22-26.51-4.51-39.5a266.055,266.055,0,0,1-6.17-33c-.43-3.56-.78-7.22.1-10.7,1-4.07,3.67-7.51,5.64-11.22,5.6-10.54,5.73-23.3,2.86-34.88s-8.49-22.26-14.06-32.81c-4.46-8.46-9.3-17.31-17.46-22.28-5.1-3.1-11-4.39-16.88-5.64l-25.37-5.43c-5.55-1.19-11.26-2.38-16.87-1.51-9.47,1.48-16.14,8.32-22,15.34-4.59,5.46-15.81,15.71-16.6,22.86-.72,6.59,5.1,17.63,6.09,24.58,1.3,9,2.22,6,7.3,11.52C532,478.05,534.07,482,534.13,486.79Z" transform="translate(-79.34 -172.91)" fill="#3f3d56"/>
+    </g>
+    <g id="docusaurus_keytar" transform="translate(670.271 615.768)">
+      <path id="Path_40" data-name="Path 40" d="M99,52h43.635V69.662H99Z" transform="translate(-49.132 -33.936)" fill="#fff" fill-rule="evenodd"/>
+      <path id="Path_41" data-name="Path 41" d="M13.389,158.195A10.377,10.377,0,0,1,4.4,153a10.377,10.377,0,0,0,8.988,15.584H23.779V158.195Z" transform="translate(-3 -82.47)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_42" data-name="Path 42" d="M66.967,38.083l36.373-2.273V30.615A10.389,10.389,0,0,0,92.95,20.226H46.2l-1.3-2.249a1.5,1.5,0,0,0-2.6,0L41,20.226l-1.3-2.249a1.5,1.5,0,0,0-2.6,0l-1.3,2.249-1.3-2.249a1.5,1.5,0,0,0-2.6,0l-1.3,2.249-.034,0-2.152-2.151a1.5,1.5,0,0,0-2.508.672L25.21,21.4l-2.7-.723a1.5,1.5,0,0,0-1.836,1.837l.722,2.7-2.65.71a1.5,1.5,0,0,0-.673,2.509l2.152,2.152c0,.011,0,.022,0,.033l-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6L20.226,41l-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3-2.249,1.3a1.5,1.5,0,0,0,0,2.6l2.249,1.3A10.389,10.389,0,0,0,30.615,103.34H92.95A10.389,10.389,0,0,0,103.34,92.95V51.393L66.967,49.12a5.53,5.53,0,0,1,0-11.038" transform="translate(-9.836 -17.226)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_43" data-name="Path 43" d="M143,163.779h15.584V143H143Z" transform="translate(-70.275 -77.665)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_44" data-name="Path 44" d="M173.779,148.389a2.582,2.582,0,0,0-.332.033c-.02-.078-.038-.156-.06-.234a2.594,2.594,0,1,0-2.567-4.455q-.086-.088-.174-.175a2.593,2.593,0,1,0-4.461-2.569c-.077-.022-.154-.04-.231-.06a2.6,2.6,0,1,0-5.128,0c-.077.02-.154.038-.231.06a2.594,2.594,0,1,0-4.461,2.569,10.384,10.384,0,1,0,17.314,9.992,2.592,2.592,0,1,0,.332-5.161" transform="translate(-75.08 -75.262)" fill="#44d860" fill-rule="evenodd"/>
+      <path id="Path_45" data-name="Path 45" d="M153,113.389h15.584V103H153Z" transform="translate(-75.08 -58.444)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_46" data-name="Path 46" d="M183.389,108.944a1.3,1.3,0,1,0,0-2.6,1.336,1.336,0,0,0-.166.017c-.01-.039-.019-.078-.03-.117a1.3,1.3,0,0,0-.5-2.5,1.285,1.285,0,0,0-.783.269q-.043-.044-.087-.087a1.285,1.285,0,0,0,.263-.776,1.3,1.3,0,0,0-2.493-.509,5.195,5.195,0,1,0,0,10,1.3,1.3,0,0,0,2.493-.509,1.285,1.285,0,0,0-.263-.776q.044-.043.087-.087a1.285,1.285,0,0,0,.783.269,1.3,1.3,0,0,0,.5-2.5c.011-.038.02-.078.03-.117a1.337,1.337,0,0,0,.166.017" transform="translate(-84.691 -57.894)" fill="#44d860" fill-rule="evenodd"/>
+      <path id="Path_47" data-name="Path 47" d="M52.188,48.292a1.3,1.3,0,0,1-1.3-1.3,3.9,3.9,0,0,0-7.792,0,1.3,1.3,0,1,1-2.6,0,6.493,6.493,0,0,1,12.987,0,1.3,1.3,0,0,1-1.3,1.3" transform="translate(-21.02 -28.41)" fill-rule="evenodd"/>
+      <path id="Path_48" data-name="Path 48" d="M103,139.752h31.168a10.389,10.389,0,0,0,10.389-10.389V93H113.389A10.389,10.389,0,0,0,103,103.389Z" transform="translate(-51.054 -53.638)" fill="#ffff50" fill-rule="evenodd"/>
+      <path id="Path_49" data-name="Path 49" d="M141.1,94.017H115.106a.519.519,0,1,1,0-1.039H141.1a.519.519,0,0,1,0,1.039m0,10.389H115.106a.519.519,0,1,1,0-1.039H141.1a.519.519,0,0,1,0,1.039m0,10.389H115.106a.519.519,0,1,1,0-1.039H141.1a.519.519,0,0,1,0,1.039m0-25.877H115.106a.519.519,0,1,1,0-1.039H141.1a.519.519,0,0,1,0,1.039m0,10.293H115.106a.519.519,0,1,1,0-1.039H141.1a.519.519,0,0,1,0,1.039m0,10.389H115.106a.519.519,0,1,1,0-1.039H141.1a.519.519,0,0,1,0,1.039m7.782-47.993c-.006,0-.011,0-.018,0-1.605.055-2.365,1.66-3.035,3.077-.7,1.48-1.24,2.443-2.126,2.414-.981-.035-1.542-1.144-2.137-2.317-.683-1.347-1.462-2.876-3.1-2.819-1.582.054-2.344,1.451-3.017,2.684-.715,1.313-1.2,2.112-2.141,2.075-1-.036-1.533-.938-2.149-1.981-.686-1.162-1.479-2.467-3.084-2.423-1.555.053-2.319,1.239-2.994,2.286-.713,1.106-1.213,1.781-2.164,1.741-1.025-.036-1.554-.784-2.167-1.65-.688-.973-1.463-2.074-3.062-2.021a3.815,3.815,0,0,0-2.959,1.879c-.64.812-1.14,1.456-2.2,1.415a.52.52,0,0,0-.037,1.039,3.588,3.588,0,0,0,3.05-1.811c.611-.777,1.139-1.448,2.178-1.483,1-.043,1.47.579,2.179,1.582.674.953,1.438,2.033,2.977,2.089,1.612.054,2.387-1.151,3.074-2.217.614-.953,1.144-1.775,2.156-1.81.931-.035,1.438.7,2.153,1.912.674,1.141,1.437,2.434,3.006,2.491,1.623.056,2.407-1.361,3.09-2.616.592-1.085,1.15-2.109,2.14-2.143.931-.022,1.417.829,2.135,2.249.671,1.326,1.432,2.828,3.026,2.886l.088,0c1.592,0,2.347-1.6,3.015-3.01.592-1.252,1.152-2.431,2.113-2.479Z" transform="translate(-55.378 -38.552)" fill-rule="evenodd"/>
+      <path id="Path_50" data-name="Path 50" d="M83,163.779h20.779V143H83Z" transform="translate(-41.443 -77.665)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <g id="Group_8" data-name="Group 8" transform="matrix(0.966, -0.259, 0.259, 0.966, 51.971, 43.3)">
+        <rect id="Rectangle_3" data-name="Rectangle 3" width="43.906" height="17.333" rx="2" transform="translate(0 0)" fill="#d8d8d8"/>
+        <g id="Group_2" data-name="Group 2" transform="translate(0.728 10.948)">
+          <rect id="Rectangle_4" data-name="Rectangle 4" width="2.537" height="2.537" rx="1" transform="translate(7.985 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_5" data-name="Rectangle 5" width="2.537" height="2.537" rx="1" transform="translate(10.991 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_6" data-name="Rectangle 6" width="2.537" height="2.537" rx="1" transform="translate(13.997 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_7" data-name="Rectangle 7" width="2.537" height="2.537" rx="1" transform="translate(17.003 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_8" data-name="Rectangle 8" width="2.537" height="2.537" rx="1" transform="translate(20.009 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_9" data-name="Rectangle 9" width="2.537" height="2.537" rx="1" transform="translate(23.015 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_10" data-name="Rectangle 10" width="2.537" height="2.537" rx="1" transform="translate(26.021 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_11" data-name="Rectangle 11" width="2.537" height="2.537" rx="1" transform="translate(29.028 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_12" data-name="Rectangle 12" width="2.537" height="2.537" rx="1" transform="translate(32.034 0)" fill="#4a4a4a"/>
+          <path id="Path_51" data-name="Path 51" d="M.519,0H6.9A.519.519,0,0,1,7.421.52v1.5a.519.519,0,0,1-.519.519H.519A.519.519,0,0,1,0,2.017V.519A.519.519,0,0,1,.519,0ZM35.653,0h6.383a.519.519,0,0,1,.519.519v1.5a.519.519,0,0,1-.519.519H35.652a.519.519,0,0,1-.519-.519V.519A.519.519,0,0,1,35.652,0Z" transform="translate(0 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+        </g>
+        <g id="Group_3" data-name="Group 3" transform="translate(0.728 4.878)">
+          <path id="Path_52" data-name="Path 52" d="M.519,0H2.956a.519.519,0,0,1,.519.519v1.5a.519.519,0,0,1-.519.519H.519A.519.519,0,0,1,0,2.017V.519A.519.519,0,0,1,.519,0Z" transform="translate(0 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+          <rect id="Rectangle_13" data-name="Rectangle 13" width="2.537" height="2.537" rx="1" transform="translate(3.945 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_14" data-name="Rectangle 14" width="2.537" height="2.537" rx="1" transform="translate(6.951 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_15" data-name="Rectangle 15" width="2.537" height="2.537" rx="1" transform="translate(9.958 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_16" data-name="Rectangle 16" width="2.537" height="2.537" rx="1" transform="translate(12.964 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_17" data-name="Rectangle 17" width="2.537" height="2.537" rx="1" transform="translate(15.97 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_18" data-name="Rectangle 18" width="2.537" height="2.537" rx="1" transform="translate(18.976 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_19" data-name="Rectangle 19" width="2.537" height="2.537" rx="1" transform="translate(21.982 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_20" data-name="Rectangle 20" width="2.537" height="2.537" rx="1" transform="translate(24.988 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_21" data-name="Rectangle 21" width="2.537" height="2.537" rx="1" transform="translate(27.994 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_22" data-name="Rectangle 22" width="2.537" height="2.537" rx="1" transform="translate(31 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_23" data-name="Rectangle 23" width="2.537" height="2.537" rx="1" transform="translate(34.006 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_24" data-name="Rectangle 24" width="2.537" height="2.537" rx="1" transform="translate(37.012 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_25" data-name="Rectangle 25" width="2.537" height="2.537" rx="1" transform="translate(40.018 0)" fill="#4a4a4a"/>
+        </g>
+        <g id="Group_4" data-name="Group 4" transform="translate(43.283 4.538) rotate(180)">
+          <path id="Path_53" data-name="Path 53" d="M.519,0H2.956a.519.519,0,0,1,.519.519v1.5a.519.519,0,0,1-.519.519H.519A.519.519,0,0,1,0,2.017V.519A.519.519,0,0,1,.519,0Z" transform="translate(0 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+          <rect id="Rectangle_26" data-name="Rectangle 26" width="2.537" height="2.537" rx="1" transform="translate(3.945 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_27" data-name="Rectangle 27" width="2.537" height="2.537" rx="1" transform="translate(6.951 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_28" data-name="Rectangle 28" width="2.537" height="2.537" rx="1" transform="translate(9.958 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_29" data-name="Rectangle 29" width="2.537" height="2.537" rx="1" transform="translate(12.964 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_30" data-name="Rectangle 30" width="2.537" height="2.537" rx="1" transform="translate(15.97 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_31" data-name="Rectangle 31" width="2.537" height="2.537" rx="1" transform="translate(18.976 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_32" data-name="Rectangle 32" width="2.537" height="2.537" rx="1" transform="translate(21.982 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_33" data-name="Rectangle 33" width="2.537" height="2.537" rx="1" transform="translate(24.988 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_34" data-name="Rectangle 34" width="2.537" height="2.537" rx="1" transform="translate(27.994 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_35" data-name="Rectangle 35" width="2.537" height="2.537" rx="1" transform="translate(31.001 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_36" data-name="Rectangle 36" width="2.537" height="2.537" rx="1" transform="translate(34.007 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_37" data-name="Rectangle 37" width="2.537" height="2.537" rx="1" transform="translate(37.013 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_38" data-name="Rectangle 38" width="2.537" height="2.537" rx="1" transform="translate(40.018 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_39" data-name="Rectangle 39" width="2.537" height="2.537" rx="1" transform="translate(3.945 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_40" data-name="Rectangle 40" width="2.537" height="2.537" rx="1" transform="translate(6.951 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_41" data-name="Rectangle 41" width="2.537" height="2.537" rx="1" transform="translate(9.958 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_42" data-name="Rectangle 42" width="2.537" height="2.537" rx="1" transform="translate(12.964 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_43" data-name="Rectangle 43" width="2.537" height="2.537" rx="1" transform="translate(15.97 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_44" data-name="Rectangle 44" width="2.537" height="2.537" rx="1" transform="translate(18.976 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_45" data-name="Rectangle 45" width="2.537" height="2.537" rx="1" transform="translate(21.982 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_46" data-name="Rectangle 46" width="2.537" height="2.537" rx="1" transform="translate(24.988 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_47" data-name="Rectangle 47" width="2.537" height="2.537" rx="1" transform="translate(27.994 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_48" data-name="Rectangle 48" width="2.537" height="2.537" rx="1" transform="translate(31.001 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_49" data-name="Rectangle 49" width="2.537" height="2.537" rx="1" transform="translate(34.007 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_50" data-name="Rectangle 50" width="2.537" height="2.537" rx="1" transform="translate(37.013 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_51" data-name="Rectangle 51" width="2.537" height="2.537" rx="1" transform="translate(40.018 0)" fill="#4a4a4a"/>
+        </g>
+        <g id="Group_6" data-name="Group 6" transform="translate(0.728 7.883)">
+          <path id="Path_54" data-name="Path 54" d="M.519,0h3.47a.519.519,0,0,1,.519.519v1.5a.519.519,0,0,1-.519.519H.519A.519.519,0,0,1,0,2.017V.52A.519.519,0,0,1,.519,0Z" transform="translate(0 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+          <g id="Group_5" data-name="Group 5" transform="translate(5.073 0)">
+            <rect id="Rectangle_52" data-name="Rectangle 52" width="2.537" height="2.537" rx="1" transform="translate(0 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_53" data-name="Rectangle 53" width="2.537" height="2.537" rx="1" transform="translate(3.006 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_54" data-name="Rectangle 54" width="2.537" height="2.537" rx="1" transform="translate(6.012 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_55" data-name="Rectangle 55" width="2.537" height="2.537" rx="1" transform="translate(9.018 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_56" data-name="Rectangle 56" width="2.537" height="2.537" rx="1" transform="translate(12.025 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_57" data-name="Rectangle 57" width="2.537" height="2.537" rx="1" transform="translate(15.031 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_58" data-name="Rectangle 58" width="2.537" height="2.537" rx="1" transform="translate(18.037 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_59" data-name="Rectangle 59" width="2.537" height="2.537" rx="1" transform="translate(21.042 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_60" data-name="Rectangle 60" width="2.537" height="2.537" rx="1" transform="translate(24.049 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_61" data-name="Rectangle 61" width="2.537" height="2.537" rx="1" transform="translate(27.055 0)" fill="#4a4a4a"/>
+            <rect id="Rectangle_62" data-name="Rectangle 62" width="2.537" height="2.537" rx="1" transform="translate(30.061 0)" fill="#4a4a4a"/>
+          </g>
+          <path id="Path_55" data-name="Path 55" d="M.52,0H3.8a.519.519,0,0,1,.519.519v1.5a.519.519,0,0,1-.519.519H.519A.519.519,0,0,1,0,2.017V.52A.519.519,0,0,1,.519,0Z" transform="translate(38.234 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+        </g>
+        <g id="Group_7" data-name="Group 7" transform="translate(0.728 14.084)">
+          <rect id="Rectangle_63" data-name="Rectangle 63" width="2.537" height="2.537" rx="1" transform="translate(0 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_64" data-name="Rectangle 64" width="2.537" height="2.537" rx="1" transform="translate(3.006 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_65" data-name="Rectangle 65" width="2.537" height="2.537" rx="1" transform="translate(6.012 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_66" data-name="Rectangle 66" width="2.537" height="2.537" rx="1" transform="translate(9.018 0)" fill="#4a4a4a"/>
+          <path id="Path_56" data-name="Path 56" d="M.519,0H14.981A.519.519,0,0,1,15.5.519v1.5a.519.519,0,0,1-.519.519H.519A.519.519,0,0,1,0,2.018V.519A.519.519,0,0,1,.519,0Zm15.97,0h1.874a.519.519,0,0,1,.519.519v1.5a.519.519,0,0,1-.519.519H16.489a.519.519,0,0,1-.519-.519V.519A.519.519,0,0,1,16.489,0Z" transform="translate(12.024 0)" fill="#4a4a4a" fill-rule="evenodd"/>
+          <rect id="Rectangle_67" data-name="Rectangle 67" width="2.537" height="2.537" rx="1" transform="translate(31.376 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_68" data-name="Rectangle 68" width="2.537" height="2.537" rx="1" transform="translate(34.382 0)" fill="#4a4a4a"/>
+          <rect id="Rectangle_69" data-name="Rectangle 69" width="2.537" height="2.537" rx="1" transform="translate(40.018 0)" fill="#4a4a4a"/>
+          <path id="Path_57" data-name="Path 57" d="M2.537,0V.561a.519.519,0,0,1-.519.519H.519A.519.519,0,0,1,0,.561V0Z" transform="translate(39.736 1.08) rotate(180)" fill="#4a4a4a"/>
+          <path id="Path_58" data-name="Path 58" d="M2.537,0V.561a.519.519,0,0,1-.519.519H.519A.519.519,0,0,1,0,.561V0Z" transform="translate(37.2 1.456)" fill="#4a4a4a"/>
+        </g>
+        <rect id="Rectangle_70" data-name="Rectangle 70" width="42.273" height="1.127" rx="0.564" transform="translate(0.915 0.556)" fill="#4a4a4a"/>
+        <rect id="Rectangle_71" data-name="Rectangle 71" width="2.37" height="0.752" rx="0.376" transform="translate(1.949 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_72" data-name="Rectangle 72" width="2.37" height="0.752" rx="0.376" transform="translate(5.193 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_73" data-name="Rectangle 73" width="2.37" height="0.752" rx="0.376" transform="translate(7.688 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_74" data-name="Rectangle 74" width="2.37" height="0.752" rx="0.376" transform="translate(10.183 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_75" data-name="Rectangle 75" width="2.37" height="0.752" rx="0.376" transform="translate(12.679 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_76" data-name="Rectangle 76" width="2.37" height="0.752" rx="0.376" transform="translate(15.797 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_77" data-name="Rectangle 77" width="2.37" height="0.752" rx="0.376" transform="translate(18.292 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_78" data-name="Rectangle 78" width="2.37" height="0.752" rx="0.376" transform="translate(20.788 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_79" data-name="Rectangle 79" width="2.37" height="0.752" rx="0.376" transform="translate(23.283 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_80" data-name="Rectangle 80" width="2.37" height="0.752" rx="0.376" transform="translate(26.402 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_81" data-name="Rectangle 81" width="2.37" height="0.752" rx="0.376" transform="translate(28.897 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_82" data-name="Rectangle 82" width="2.37" height="0.752" rx="0.376" transform="translate(31.393 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_83" data-name="Rectangle 83" width="2.37" height="0.752" rx="0.376" transform="translate(34.512 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_84" data-name="Rectangle 84" width="2.37" height="0.752" rx="0.376" transform="translate(37.007 0.744)" fill="#d8d8d8" opacity="0.136"/>
+        <rect id="Rectangle_85" data-name="Rectangle 85" width="2.37" height="0.752" rx="0.376" transform="translate(39.502 0.744)" fill="#d8d8d8" opacity="0.136"/>
+      </g>
+      <path id="Path_59" data-name="Path 59" d="M123.779,148.389a2.583,2.583,0,0,0-.332.033c-.02-.078-.038-.156-.06-.234a2.594,2.594,0,1,0-2.567-4.455q-.086-.088-.174-.175a2.593,2.593,0,1,0-4.461-2.569c-.077-.022-.154-.04-.231-.06a2.6,2.6,0,1,0-5.128,0c-.077.02-.154.038-.231.06a2.594,2.594,0,1,0-4.461,2.569,10.384,10.384,0,1,0,17.314,9.992,2.592,2.592,0,1,0,.332-5.161" transform="translate(-51.054 -75.262)" fill="#44d860" fill-rule="evenodd"/>
+      <path id="Path_60" data-name="Path 60" d="M83,113.389h20.779V103H83Z" transform="translate(-41.443 -58.444)" fill="#3ecc5f" fill-rule="evenodd"/>
+      <path id="Path_61" data-name="Path 61" d="M123.389,108.944a1.3,1.3,0,1,0,0-2.6,1.338,1.338,0,0,0-.166.017c-.01-.039-.019-.078-.03-.117a1.3,1.3,0,0,0-.5-2.5,1.285,1.285,0,0,0-.783.269q-.043-.044-.087-.087a1.285,1.285,0,0,0,.263-.776,1.3,1.3,0,0,0-2.493-.509,5.195,5.195,0,1,0,0,10,1.3,1.3,0,0,0,2.493-.509,1.285,1.285,0,0,0-.263-.776q.044-.043.087-.087a1.285,1.285,0,0,0,.783.269,1.3,1.3,0,0,0,.5-2.5c.011-.038.02-.078.03-.117a1.335,1.335,0,0,0,.166.017" transform="translate(-55.859 -57.894)" fill="#44d860" fill-rule="evenodd"/>
+      <path id="Path_62" data-name="Path 62" d="M141.8,38.745a1.41,1.41,0,0,1-.255-.026,1.309,1.309,0,0,1-.244-.073,1.349,1.349,0,0,1-.224-.119,1.967,1.967,0,0,1-.2-.161,1.52,1.52,0,0,1-.161-.2,1.282,1.282,0,0,1-.218-.722,1.41,1.41,0,0,1,.026-.255,1.5,1.5,0,0,1,.072-.244,1.364,1.364,0,0,1,.12-.223,1.252,1.252,0,0,1,.358-.358,1.349,1.349,0,0,1,.224-.119,1.309,1.309,0,0,1,.244-.073,1.2,1.2,0,0,1,.509,0,1.262,1.262,0,0,1,.468.192,1.968,1.968,0,0,1,.2.161,1.908,1.908,0,0,1,.161.2,1.322,1.322,0,0,1,.12.223,1.361,1.361,0,0,1,.1.5,1.317,1.317,0,0,1-.379.919,1.968,1.968,0,0,1-.2.161,1.346,1.346,0,0,1-.223.119,1.332,1.332,0,0,1-.5.1m10.389-.649a1.326,1.326,0,0,1-.92-.379,1.979,1.979,0,0,1-.161-.2,1.282,1.282,0,0,1-.218-.722,1.326,1.326,0,0,1,.379-.919,1.967,1.967,0,0,1,.2-.161,1.351,1.351,0,0,1,.224-.119,1.308,1.308,0,0,1,.244-.073,1.2,1.2,0,0,1,.509,0,1.262,1.262,0,0,1,.468.192,1.967,1.967,0,0,1,.2.161,1.326,1.326,0,0,1,.379.919,1.461,1.461,0,0,1-.026.255,1.323,1.323,0,0,1-.073.244,1.847,1.847,0,0,1-.119.223,1.911,1.911,0,0,1-.161.2,1.967,1.967,0,0,1-.2.161,1.294,1.294,0,0,1-.722.218" transform="translate(-69.074 -26.006)" fill-rule="evenodd"/>
+    </g>
+    <g id="React-icon" transform="translate(906.3 541.56)">
+      <path id="Path_330" data-name="Path 330" d="M263.668,117.179c0-5.827-7.3-11.35-18.487-14.775,2.582-11.4,1.434-20.477-3.622-23.382a7.861,7.861,0,0,0-4.016-1v4a4.152,4.152,0,0,1,2.044.466c2.439,1.4,3.5,6.724,2.672,13.574-.2,1.685-.52,3.461-.914,5.272a86.9,86.9,0,0,0-11.386-1.954,87.469,87.469,0,0,0-7.459-8.965c5.845-5.433,11.332-8.41,15.062-8.41V78h0c-4.931,0-11.386,3.514-17.913,9.611-6.527-6.061-12.982-9.539-17.913-9.539v4c3.712,0,9.216,2.959,15.062,8.356a84.687,84.687,0,0,0-7.405,8.947,83.732,83.732,0,0,0-11.4,1.972c-.412-1.793-.717-3.532-.932-5.2-.843-6.85.2-12.175,2.618-13.592a3.991,3.991,0,0,1,2.062-.466v-4h0a8,8,0,0,0-4.052,1c-5.039,2.9-6.168,11.96-3.568,23.328-11.153,3.443-18.415,8.947-18.415,14.757,0,5.828,7.3,11.35,18.487,14.775-2.582,11.4-1.434,20.477,3.622,23.382a7.882,7.882,0,0,0,4.034,1c4.931,0,11.386-3.514,17.913-9.611,6.527,6.061,12.982,9.539,17.913,9.539a8,8,0,0,0,4.052-1c5.039-2.9,6.168-11.96,3.568-23.328C256.406,128.511,263.668,122.988,263.668,117.179Zm-23.346-11.96c-.663,2.313-1.488,4.7-2.421,7.083-.735-1.434-1.506-2.869-2.349-4.3-.825-1.434-1.7-2.833-2.582-4.2C235.517,104.179,237.974,104.645,240.323,105.219Zm-8.212,19.1c-1.4,2.421-2.833,4.716-4.321,6.85-2.672.233-5.379.359-8.1.359-2.708,0-5.415-.126-8.069-.341q-2.232-3.2-4.339-6.814-2.044-3.523-3.73-7.136c1.112-2.4,2.367-4.805,3.712-7.154,1.4-2.421,2.833-4.716,4.321-6.85,2.672-.233,5.379-.359,8.1-.359,2.708,0,5.415.126,8.069.341q2.232,3.2,4.339,6.814,2.044,3.523,3.73,7.136C234.692,119.564,233.455,121.966,232.11,124.315Zm5.792-2.331c.968,2.4,1.793,4.805,2.474,7.136-2.349.574-4.823,1.058-7.387,1.434.879-1.381,1.757-2.8,2.582-4.25C236.4,124.871,237.167,123.419,237.9,121.984ZM219.72,141.116a73.921,73.921,0,0,1-4.985-5.738c1.614.072,3.263.126,4.931.126,1.685,0,3.353-.036,4.985-.126A69.993,69.993,0,0,1,219.72,141.116ZM206.38,130.555c-2.546-.377-5-.843-7.352-1.417.663-2.313,1.488-4.7,2.421-7.083.735,1.434,1.506,2.869,2.349,4.3S205.5,129.192,206.38,130.555ZM219.63,93.241a73.924,73.924,0,0,1,4.985,5.738c-1.614-.072-3.263-.126-4.931-.126-1.686,0-3.353.036-4.985.126A69.993,69.993,0,0,1,219.63,93.241ZM206.362,103.8c-.879,1.381-1.757,2.8-2.582,4.25-.825,1.434-1.6,2.869-2.331,4.3-.968-2.4-1.793-4.805-2.474-7.136C201.323,104.663,203.8,104.179,206.362,103.8Zm-16.227,22.449c-6.348-2.708-10.454-6.258-10.454-9.073s4.106-6.383,10.454-9.073c1.542-.663,3.228-1.255,4.967-1.811a86.122,86.122,0,0,0,4.034,10.92,84.9,84.9,0,0,0-3.981,10.866C193.38,127.525,191.694,126.915,190.134,126.252Zm9.647,25.623c-2.439-1.4-3.5-6.724-2.672-13.574.2-1.686.52-3.461.914-5.272a86.9,86.9,0,0,0,11.386,1.954,87.465,87.465,0,0,0,7.459,8.965c-5.845,5.433-11.332,8.41-15.062,8.41A4.279,4.279,0,0,1,199.781,151.875Zm42.532-13.663c.843,6.85-.2,12.175-2.618,13.592a3.99,3.99,0,0,1-2.062.466c-3.712,0-9.216-2.959-15.062-8.356a84.689,84.689,0,0,0,7.405-8.947,83.731,83.731,0,0,0,11.4-1.972A50.194,50.194,0,0,1,242.313,138.212Zm6.9-11.96c-1.542.663-3.228,1.255-4.967,1.811a86.12,86.12,0,0,0-4.034-10.92,84.9,84.9,0,0,0,3.981-10.866c1.775.556,3.461,1.165,5.039,1.829,6.348,2.708,10.454,6.258,10.454,9.073C259.67,119.994,255.564,123.562,249.216,126.252Z" fill="#61dafb"/>
+      <path id="Path_331" data-name="Path 331" d="M320.8,78.4Z" transform="translate(-119.082 -0.328)" fill="#61dafb"/>
+      <circle id="Ellipse_112" data-name="Ellipse 112" cx="8.194" cy="8.194" r="8.194" transform="translate(211.472 108.984)" fill="#61dafb"/>
+      <path id="Path_332" data-name="Path 332" d="M520.5,78.1Z" transform="translate(-282.975 -0.082)" fill="#61dafb"/>
+    </g>
+  </g>
+</svg>
diff --git a/docs/docusaurus/static/img/undraw_docusaurus_tree.svg b/docs/docusaurus/static/img/undraw_docusaurus_tree.svg
new file mode 100644
index 0000000000..d9161d3392
--- /dev/null
+++ b/docs/docusaurus/static/img/undraw_docusaurus_tree.svg
@@ -0,0 +1,40 @@
+<svg xmlns="http://www.w3.org/2000/svg" width="1129" height="663" viewBox="0 0 1129 663">
+  <title>Focus on What Matters</title>
+  <circle cx="321" cy="321" r="321" fill="#f2f2f2" />
+  <ellipse cx="559" cy="635.49998" rx="514" ry="27.50002" fill="#3f3d56" />
+  <ellipse cx="558" cy="627" rx="460" ry="22" opacity="0.2" />
+  <rect x="131" y="152.5" width="840" height="50" fill="#3f3d56" />
+  <path d="M166.5,727.3299A21.67009,21.67009,0,0,0,188.1701,749H984.8299A21.67009,21.67009,0,0,0,1006.5,727.3299V296h-840Z" transform="translate(-35.5 -118.5)" fill="#3f3d56" />
+  <path d="M984.8299,236H188.1701A21.67009,21.67009,0,0,0,166.5,257.6701V296h840V257.6701A21.67009,21.67009,0,0,0,984.8299,236Z" transform="translate(-35.5 -118.5)" fill="#3f3d56" />
+  <path d="M984.8299,236H188.1701A21.67009,21.67009,0,0,0,166.5,257.6701V296h840V257.6701A21.67009,21.67009,0,0,0,984.8299,236Z" transform="translate(-35.5 -118.5)" opacity="0.2" />
+  <circle cx="181" cy="147.5" r="13" fill="#3f3d56" />
+  <circle cx="217" cy="147.5" r="13" fill="#3f3d56" />
+  <circle cx="253" cy="147.5" r="13" fill="#3f3d56" />
+  <rect x="168" y="213.5" width="337" height="386" rx="5.33505" fill="#606060" />
+  <rect x="603" y="272.5" width="284" height="22" rx="5.47638" fill="#2e8555" />
+  <rect x="537" y="352.5" width="416" height="15" rx="5.47638" fill="#2e8555" />
+  <rect x="537" y="396.5" width="416" height="15" rx="5.47638" fill="#2e8555" />
+  <rect x="537" y="440.5" width="416" height="15" rx="5.47638" fill="#2e8555" />
+  <rect x="537" y="484.5" width="416" height="15" rx="5.47638" fill="#2e8555" />
+  <rect x="865" y="552.5" width="88" height="26" rx="7.02756" fill="#3ecc5f" />
+  <path d="M1088.60287,624.61594a30.11371,30.11371,0,0,0,3.98291-15.266c0-13.79652-8.54358-24.98081-19.08256-24.98081s-19.08256,11.18429-19.08256,24.98081a30.11411,30.11411,0,0,0,3.98291,15.266,31.248,31.248,0,0,0,0,30.53213,31.248,31.248,0,0,0,0,30.53208,31.248,31.248,0,0,0,0,30.53208,30.11408,30.11408,0,0,0-3.98291,15.266c0,13.79652,8.54353,24.98081,19.08256,24.98081s19.08256-11.18429,19.08256-24.98081a30.11368,30.11368,0,0,0-3.98291-15.266,31.248,31.248,0,0,0,0-30.53208,31.248,31.248,0,0,0,0-30.53208,31.248,31.248,0,0,0,0-30.53213Z" transform="translate(-35.5 -118.5)" fill="#3f3d56" />
+  <ellipse cx="1038.00321" cy="460.31783" rx="19.08256" ry="24.9808" fill="#3f3d56" />
+  <ellipse cx="1038.00321" cy="429.78574" rx="19.08256" ry="24.9808" fill="#3f3d56" />
+  <path d="M1144.93871,339.34489a91.61081,91.61081,0,0,0,7.10658-10.46092l-50.141-8.23491,54.22885.4033a91.566,91.566,0,0,0,1.74556-72.42605l-72.75449,37.74139,67.09658-49.32086a91.41255,91.41255,0,1,0-150.971,102.29805,91.45842,91.45842,0,0,0-10.42451,16.66946l65.0866,33.81447-69.40046-23.292a91.46011,91.46011,0,0,0,14.73837,85.83669,91.40575,91.40575,0,1,0,143.68892,0,91.41808,91.41808,0,0,0,0-113.02862Z" transform="translate(-35.5 -118.5)" fill="#3ecc5f" fill-rule="evenodd" />
+  <path d="M981.6885,395.8592a91.01343,91.01343,0,0,0,19.56129,56.51431,91.40575,91.40575,0,1,0,143.68892,0C1157.18982,436.82067,981.6885,385.60008,981.6885,395.8592Z" transform="translate(-35.5 -118.5)" opacity="0.1" />
+  <path d="M365.62,461.43628H477.094v45.12043H365.62Z" transform="translate(-35.5 -118.5)" fill="#fff" fill-rule="evenodd" />
+  <path d="M264.76252,608.74122a26.50931,26.50931,0,0,1-22.96231-13.27072,26.50976,26.50976,0,0,0,22.96231,39.81215H291.304V608.74122Z" transform="translate(-35.5 -118.5)" fill="#3ecc5f" fill-rule="evenodd" />
+  <path d="M384.17242,468.57061l92.92155-5.80726V449.49263a26.54091,26.54091,0,0,0-26.54143-26.54143H331.1161l-3.31768-5.74622a3.83043,3.83043,0,0,0-6.63536,0l-3.31768,5.74622-3.31767-5.74622a3.83043,3.83043,0,0,0-6.63536,0l-3.31768,5.74622L301.257,417.205a3.83043,3.83043,0,0,0-6.63536,0L291.304,422.9512c-.02919,0-.05573.004-.08625.004l-5.49674-5.49541a3.8293,3.8293,0,0,0-6.4071,1.71723l-1.81676,6.77338L270.607,424.1031a3.82993,3.82993,0,0,0-4.6912,4.69253l1.84463,6.89148-6.77072,1.81411a3.8315,3.8315,0,0,0-1.71988,6.40975l5.49673,5.49673c0,.02787-.004.05574-.004.08493l-5.74622,3.31768a3.83043,3.83043,0,0,0,0,6.63536l5.74621,3.31768L259.0163,466.081a3.83043,3.83043,0,0,0,0,6.63536l5.74622,3.31768-5.74622,3.31767a3.83043,3.83043,0,0,0,0,6.63536l5.74622,3.31768-5.74622,3.31768a3.83043,3.83043,0,0,0,0,6.63536l5.74622,3.31768-5.74622,3.31767a3.83043,3.83043,0,0,0,0,6.63536l5.74622,3.31768-5.74622,3.31768a3.83043,3.83043,0,0,0,0,6.63536l5.74622,3.31768-5.74622,3.31768a3.83042,3.83042,0,0,0,0,6.63535l5.74622,3.31768-5.74622,3.31768a3.83043,3.83043,0,0,0,0,6.63536l5.74622,3.31768L259.0163,558.976a3.83042,3.83042,0,0,0,0,6.63535l5.74622,3.31768-5.74622,3.31768a3.83043,3.83043,0,0,0,0,6.63536l5.74622,3.31768-5.74622,3.31768a3.83042,3.83042,0,0,0,0,6.63535l5.74622,3.31768-5.74622,3.31768a3.83043,3.83043,0,0,0,0,6.63536l5.74622,3.31768A26.54091,26.54091,0,0,0,291.304,635.28265H450.55254A26.5409,26.5409,0,0,0,477.094,608.74122V502.5755l-92.92155-5.80727a14.12639,14.12639,0,0,1,0-28.19762" transform="translate(-35.5 -118.5)" fill="#3ecc5f" fill-rule="evenodd" />
+  <path d="M424.01111,635.28265h39.81214V582.19979H424.01111Z" transform="translate(-35.5 -118.5)" fill="#3ecc5f" fill-rule="evenodd" />
+  <path d="M490.36468,602.10586a6.60242,6.60242,0,0,0-.848.08493c-.05042-.19906-.09821-.39945-.15393-.59852A6.62668,6.62668,0,1,0,482.80568,590.21q-.2203-.22491-.44457-.44589a6.62391,6.62391,0,1,0-11.39689-6.56369c-.1964-.05575-.39414-.10218-.59056-.15262a6.63957,6.63957,0,1,0-13.10086,0c-.1964.05042-.39414.09687-.59056.15262a6.62767,6.62767,0,1,0-11.39688,6.56369,26.52754,26.52754,0,1,0,44.23127,25.52756,6.6211,6.6211,0,1,0,.848-13.18579" transform="translate(-35.5 -118.5)" fill="#44d860" fill-rule="evenodd" />
+  <path d="M437.28182,555.65836H477.094V529.11693H437.28182Z" transform="translate(-35.5 -118.5)" fill="#3ecc5f" fill-rule="evenodd" />
+  <path d="M490.36468,545.70532a3.31768,3.31768,0,0,0,0-6.63536,3.41133,3.41133,0,0,0-.42333.04247c-.02655-.09953-.04911-.19907-.077-.29859a3.319,3.319,0,0,0-1.278-6.37923,3.28174,3.28174,0,0,0-2.00122.68742q-.10947-.11346-.22294-.22295a3.282,3.282,0,0,0,.67149-1.98265,3.31768,3.31768,0,0,0-6.37-1.2992,13.27078,13.27078,0,1,0,0,25.54082,3.31768,3.31768,0,0,0,6.37-1.2992,3.282,3.282,0,0,0-.67149-1.98265q.11347-.10947.22294-.22294a3.28174,3.28174,0,0,0,2.00122.68742,3.31768,3.31768,0,0,0,1.278-6.37923c.02786-.0982.05042-.19907.077-.29859a3.41325,3.41325,0,0,0,.42333.04246" transform="translate(-35.5 -118.5)" fill="#44d860" fill-rule="evenodd" />
+  <path d="M317.84538,466.081a3.31768,3.31768,0,0,1-3.31767-3.31768,9.953,9.953,0,1,0-19.90608,0,3.31768,3.31768,0,1,1-6.63535,0,16.58839,16.58839,0,1,1,33.17678,0,3.31768,3.31768,0,0,1-3.31768,3.31768" transform="translate(-35.5 -118.5)" fill-rule="evenodd" />
+  <path d="M370.92825,635.28265h79.62429A26.5409,26.5409,0,0,0,477.094,608.74122v-92.895H397.46968a26.54091,26.54091,0,0,0-26.54143,26.54143Z" transform="translate(-35.5 -118.5)" fill="#ffff50" fill-rule="evenodd" />
+  <path d="M457.21444,556.98543H390.80778a1.32707,1.32707,0,0,1,0-2.65414h66.40666a1.32707,1.32707,0,0,1,0,2.65414m0,26.54143H390.80778a1.32707,1.32707,0,1,1,0-2.65414h66.40666a1.32707,1.32707,0,0,1,0,2.65414m0,26.54143H390.80778a1.32707,1.32707,0,1,1,0-2.65414h66.40666a1.32707,1.32707,0,0,1,0,2.65414m0-66.10674H390.80778a1.32707,1.32707,0,0,1,0-2.65414h66.40666a1.32707,1.32707,0,0,1,0,2.65414m0,26.29459H390.80778a1.32707,1.32707,0,0,1,0-2.65414h66.40666a1.32707,1.32707,0,0,1,0,2.65414m0,26.54143H390.80778a1.32707,1.32707,0,0,1,0-2.65414h66.40666a1.32707,1.32707,0,0,1,0,2.65414M477.094,474.19076c-.01592,0-.0292-.008-.04512-.00663-4.10064.13934-6.04083,4.24132-7.75274,7.86024-1.78623,3.78215-3.16771,6.24122-5.43171,6.16691-2.50685-.09024-3.94007-2.92222-5.45825-5.91874-1.74377-3.44243-3.73438-7.34667-7.91333-7.20069-4.04227.138-5.98907,3.70784-7.70631,6.857-1.82738,3.35484-3.07084,5.39455-5.46887,5.30033-2.55727-.09289-3.91619-2.39536-5.48877-5.06013-1.75306-2.96733-3.77951-6.30359-7.8775-6.18946-3.97326.13669-5.92537,3.16507-7.64791,5.83912-1.82207,2.82666-3.09872,4.5492-5.52725,4.447-2.61832-.09289-3.9706-2.00388-5.53522-4.21611-1.757-2.4856-3.737-5.299-7.82308-5.16231-3.88567.13271-5.83779,2.61434-7.559,4.80135-1.635,2.07555-2.9116,3.71846-5.61218,3.615a1.32793,1.32793,0,1,0-.09555,2.65414c4.00377.134,6.03154-2.38873,7.79257-4.6275,1.562-1.9853,2.91027-3.69855,5.56441-3.78879,2.55594-.10882,3.75429,1.47968,5.56707,4.04093,1.7212,2.43385,3.67465,5.19416,7.60545,5.33616,4.11789.138,6.09921-2.93946,7.8536-5.66261,1.56861-2.43385,2.92221-4.53461,5.50734-4.62352,2.37944-.08892,3.67466,1.79154,5.50072,4.885,1.72121,2.91557,3.67069,6.21865,7.67977,6.36463,4.14709.14332,6.14965-3.47693,7.89475-6.68181,1.51155-2.77092,2.93814-5.38791,5.46621-5.4755,2.37944-.05573,3.62025,2.11668,5.45558,5.74622,1.71459,3.388,3.65875,7.22591,7.73019,7.37321l.22429.004c4.06614,0,5.99571-4.08074,7.70364-7.68905,1.51154-3.19825,2.94211-6.21069,5.3972-6.33411Z" transform="translate(-35.5 -118.5)" fill-rule="evenodd" />
+  <path d="M344.38682,635.28265h53.08286V582.19979H344.38682Z" transform="translate(-35.5 -118.5)" fill="#3ecc5f" fill-rule="evenodd" />
+  <path d="M424.01111,602.10586a6.60242,6.60242,0,0,0-.848.08493c-.05042-.19906-.09821-.39945-.15394-.59852A6.62667,6.62667,0,1,0,416.45211,590.21q-.2203-.22491-.44458-.44589a6.62391,6.62391,0,1,0-11.39689-6.56369c-.1964-.05575-.39413-.10218-.59054-.15262a6.63957,6.63957,0,1,0-13.10084,0c-.19641.05042-.39414.09687-.59055.15262a6.62767,6.62767,0,1,0-11.39689,6.56369,26.52755,26.52755,0,1,0,44.2313,25.52756,6.6211,6.6211,0,1,0,.848-13.18579" transform="translate(-35.5 -118.5)" fill="#44d860" fill-rule="evenodd" />
+  <path d="M344.38682,555.65836h53.08286V529.11693H344.38682Z" transform="translate(-35.5 -118.5)" fill="#3ecc5f" fill-rule="evenodd" />
+  <path d="M410.74039,545.70532a3.31768,3.31768,0,1,0,0-6.63536,3.41133,3.41133,0,0,0-.42333.04247c-.02655-.09953-.04911-.19907-.077-.29859a3.319,3.319,0,0,0-1.278-6.37923,3.28174,3.28174,0,0,0-2.00122.68742q-.10947-.11346-.22294-.22295a3.282,3.282,0,0,0,.67149-1.98265,3.31768,3.31768,0,0,0-6.37-1.2992,13.27078,13.27078,0,1,0,0,25.54082,3.31768,3.31768,0,0,0,6.37-1.2992,3.282,3.282,0,0,0-.67149-1.98265q.11347-.10947.22294-.22294a3.28174,3.28174,0,0,0,2.00122.68742,3.31768,3.31768,0,0,0,1.278-6.37923c.02786-.0982.05042-.19907.077-.29859a3.41325,3.41325,0,0,0,.42333.04246" transform="translate(-35.5 -118.5)" fill="#44d860" fill-rule="evenodd" />
+  <path d="M424.01111,447.8338a3.60349,3.60349,0,0,1-.65028-.06636,3.34415,3.34415,0,0,1-.62372-.18579,3.44679,3.44679,0,0,1-.572-.30522,5.02708,5.02708,0,0,1-.50429-.4114,3.88726,3.88726,0,0,1-.41007-.50428,3.27532,3.27532,0,0,1-.55737-1.84463,3.60248,3.60248,0,0,1,.06636-.65027,3.82638,3.82638,0,0,1,.18447-.62373,3.48858,3.48858,0,0,1,.30656-.57064,3.197,3.197,0,0,1,.91436-.91568,3.44685,3.44685,0,0,1,.572-.30523,3.344,3.344,0,0,1,.62372-.18578,3.06907,3.06907,0,0,1,1.30053,0,3.22332,3.22332,0,0,1,1.19436.491,5.02835,5.02835,0,0,1,.50429.41139,4.8801,4.8801,0,0,1,.41139.50429,3.38246,3.38246,0,0,1,.30522.57064,3.47806,3.47806,0,0,1,.25215,1.274A3.36394,3.36394,0,0,1,426.36,446.865a5.02708,5.02708,0,0,1-.50429.4114,3.3057,3.3057,0,0,1-1.84463.55737m26.54143-1.65884a3.38754,3.38754,0,0,1-2.35024-.96877,5.04185,5.04185,0,0,1-.41007-.50428,3.27532,3.27532,0,0,1-.55737-1.84463,3.38659,3.38659,0,0,1,.96744-2.34892,5.02559,5.02559,0,0,1,.50429-.41139,3.44685,3.44685,0,0,1,.572-.30523,3.3432,3.3432,0,0,1,.62373-.18579,3.06952,3.06952,0,0,1,1.30052,0,3.22356,3.22356,0,0,1,1.19436.491,5.02559,5.02559,0,0,1,.50429.41139,3.38792,3.38792,0,0,1,.96876,2.34892,3.72635,3.72635,0,0,1-.06636.65026,3.37387,3.37387,0,0,1-.18579.62373,4.71469,4.71469,0,0,1-.30522.57064,4.8801,4.8801,0,0,1-.41139.50429,5.02559,5.02559,0,0,1-.50429.41139,3.30547,3.30547,0,0,1-1.84463.55737" transform="translate(-35.5 -118.5)" fill-rule="evenodd" />
+</svg>
diff --git a/docs/docusaurus/tsconfig.json b/docs/docusaurus/tsconfig.json
new file mode 100644
index 0000000000..314eab8a41
--- /dev/null
+++ b/docs/docusaurus/tsconfig.json
@@ -0,0 +1,7 @@
+{
+  // This file is not used in compilation. It is here just for a nice editor experience.
+  "extends": "@docusaurus/tsconfig",
+  "compilerOptions": {
+    "baseUrl": "."
+  }
+}
diff --git a/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile
new file mode 100644
index 0000000000..a2f30e3591
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 3.5.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-CPP-Procedure-API/run.sh b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-CPP-Procedure-API/run.sh
new file mode 100644
index 0000000000..e2455bfbc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-CPP-Procedure-API/run.sh
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+# 0. install: yum install doxygen, graphviz
+# 1. run this script
+doxygen Doxyfile
diff --git a/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/Makefile b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/Makefile
new file mode 100644
index 0000000000..e58ac30a31
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+SPHINXPROJ    = TuGraph
+SOURCEDIR     = .
+BUILDDIR      = _build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/conf.py b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/conf.py
new file mode 100644
index 0000000000..8af367a431
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/conf.py
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+#
+# Configuration file for the Sphinx documentation builder.
+#
+# This file does only contain a selection of the most common options. For a
+# full list see the documentation:
+# http://www.sphinx-doc.org/en/master/config
+
+# -- Path setup --------------------------------------------------------------
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#
+import os
+import sys
+sys.path.insert(0, os.path.abspath('../../../build/output/'))
+
+
+# -- Project information -----------------------------------------------------
+
+project = u'TuGraph'
+copyright = u'2018-2022, Ant Group'
+author = u'Ant Group'
+
+# The short X.Y version
+version = u''
+# The full version, including alpha/beta/rc tags
+release = u''
+
+
+# -- General configuration ---------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#
+# needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.autodoc',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+#
+# source_suffix = ['.rst', '.md']
+source_suffix = '.rst'
+
+# The master toctree document.
+master_doc = 'index'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+# This pattern also affects html_static_path and html_extra_path .
+exclude_patterns = [u'_build', 'Thumbs.db', '.DS_Store']
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+
+# -- Options for HTML output -------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+#
+html_theme = 'nature'
+#html_theme = 'haiku'
+#html_theme = 'pyramid'
+#html_theme = 'sphinxdoc'
+#html_theme = 'bizstyle'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#
+# html_theme_options = {}
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Custom sidebar templates, must be a dictionary that maps document names
+# to template names.
+#
+# The default sidebars (for documents that don't match any pattern) are
+# defined by theme itself.  Builtin themes are using these templates by
+# default: ``['localtoc.html', 'relations.html', 'sourcelink.html',
+# 'searchbox.html']``.
+#
+# html_sidebars = {}
+
+
+# -- Options for HTMLHelp output ---------------------------------------------
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'TuGraphdoc'
+
+
+# -- Options for LaTeX output ------------------------------------------------
+
+latex_elements = {
+    # The paper size ('letterpaper' or 'a4paper').
+    #
+    # 'papersize': 'letterpaper',
+
+    # The font size ('10pt', '11pt' or '12pt').
+    #
+    # 'pointsize': '10pt',
+
+    # Additional stuff for the LaTeX preamble.
+    #
+    # 'preamble': '',
+
+    # Latex figure (float) alignment
+    #
+    # 'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'TuGraph.tex', u'TuGraph Documentation',
+     u'Ant Group', 'manual'),
+]
+
+
+# -- Options for manual page output ------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'tugraph', u'TuGraph Documentation',
+     [author], 1)
+]
+
+
+# -- Options for Texinfo output ----------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'TuGraph', u'TuGraph Documentation',
+     author, 'TuGraph', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+
+# -- Extension configuration -------------------------------------------------
diff --git a/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/index.rst b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/index.rst
new file mode 100644
index 0000000000..c66f5892b5
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/index.rst
@@ -0,0 +1,37 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+TuGraph Procedure API - Python
+====================================
+Version: 3.5.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Noe4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
+
+
+Indices and tables
+-------------------
+
+* :ref:`genindex`
+* :ref:`modindex`
+* :ref:`search`
diff --git a/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/make.bat b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/make.bat
new file mode 100644
index 0000000000..b1d0c9a1dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=.
+set BUILDDIR=_build
+set SPHINXPROJ=TuGraph
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.http://sphinx-doc.org/
+	exit /b 1
+)
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/run.sh b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/run.sh
new file mode 100755
index 0000000000..d10e0a2b1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/autogen/TuGraph-Python-Procedure-API/run.sh
@@ -0,0 +1,7 @@
+# 0. install sphinx-build: yum install python3-sphinx
+# 1. default lgrpah module path: ../../../build/output/lgraph_python.so
+# 2. make lgraph_python
+# 3. run this script
+rm output -rf
+mkdir -p _static _templates
+sphinx-build -W -b html . output
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/.readthedocs.yaml b/docs/docusaurus/versions/version-3.5.1/en-US/.readthedocs.yaml
new file mode 100644
index 0000000000..92cd0965f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/en-US/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/Makefile b/docs/docusaurus/versions/version-3.5.1/en-US/Makefile
new file mode 100644
index 0000000000..a4de0bff18
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?= -W
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/make.bat b/docs/docusaurus/versions/version-3.5.1/en-US/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/1.guide.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/1.guide.md
new file mode 100644
index 0000000000..9609f693fa
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/1.guide.md
@@ -0,0 +1,35 @@
+# Guide
+
+> Here is the document map that helps users learn and use the TuGraph community version quickly.
+
+## Quick Start
+
+> Understand graph technology and TuGraph:[What is a Graph](./2.introduction/1.what-is-graph.md),[What is a Graph database](./2.introduction/2.what-is-gdbms.md),[What is TuGraph](./2.introduction/3.what-is-tugraph.md),[TuGraph Product Architecture](./2.introduction/5.architecture.md)。
+
+> Quickly get started with TuGraph：[Quick Start](./3.quick-start/1.preparation.md),[Movie Demo](./3.quick-start/2.demo/1.movie.md),[TuGraph Browser](./4.user-guide/1.tugraph-browser.md)。
+
+> Install and deploy TuGraph:[Cloud Deployment](./5.developer-manual/1.installation/5.cloud-deployment.md),[Docker Deployment](./5.developer-manual/1.installation/3.docker-deployment.md),[Local Package Deployment](./5.developer-manual/1.installation/4.local-package-deployment.md)。
+
+> Start and run TuGraph:[Tugraph Running](./5.developer-manual/2.running/2.tugraph-running.md),[Compile](./5.developer-manual/2.running/1.compile.md),[Data Warmup](./5.developer-manual/3.server-tools/4.data-warmup.md),[Backup and Restore](./5.developer-manual/3.server-tools/3.backup-and-restore.md),[Log](./5.developer-manual/5.ecosystem-tools/4.log.md)。
+
+## Development Guide
+
+> Client Tools:[Cpp Client](./5.developer-manual/4.client-tools/2.cpp-client.md),[Java Client](./5.developer-manual/4.client-tools/3.java-client.md),[Python Client](./5.developer-manual/4.client-tools/1.python-client.md),[CLI](./5.developer-manual/4.client-tools/5.tugraph-cli.md),[OGM](./5.developer-manual/4.client-tools/4.tugraph-ogm.md)。
+
+> Ecological Tools:[Monitoring](./5.developer-manual/5.ecosystem-tools/1.monitoring.md),[TuGraph DataX](./5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md),[TuGraph Explorer](./5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md)。
+
+> Interface:[Cypher API](./5.developer-manual/6.interface/1.cypher.md),[OLAP API](./5.developer-manual/6.interface/2.olap/1.tutorial.md),[Procedure API](5.developer-manual/6.interface/3.procedure/1.procedure.md),[RESTful API](./5.developer-manual/6.interface/4.protocol/1.restful-api.md),[RPC API](./5.developer-manual/6.interface/4.protocol/2.rpc-api.md)。
+
+## Community Contribution
+
+> Before starting to contribute, you can learn [how to contribute](./6.community-manual/1.contributing.md)
+
+> If you want to understand the division of community roles, please visit [community roles](./6.community-manual/2.community-roles.md)
+
+## Video Center
+
+> [Quick start with TuGraph](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph technology sharing collection](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [Understand graph computing in 3 minutes](https://www.bilibili.com/video/BV15U4y1r7AW/?spm_id_from=333.999.0.0)
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..549043a94c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,15 @@
+# What is Graph
+
+The graph that we're going to introduce today, it's neither a picture, nor a diagram，it's a class of mathematics called graph theory. We can see on the screen that there are two graphs on the left and right, which represent things and their relationship. We abstract it out in a form, and we call such a form a graph.
+
+![alt what is graph](../../../images/what-is-graph-en.png)
+
+The basic elements of a graph are a vertex, and an edge, a vertex is a representation of the thing, of the entity, and an edge is a representation of the relationship between them.
+
+We see the graph on the left, the dots have companies, they have employees, and they have projects. What are their sides? The relationship between the company and the employees is an employment relationship, and there can be a friend relationship between the employees, and there can be a participation relationship between the project and the employees. That is, we can use graphs to abstract things and their relationships.
+
+The diagram on the right is a schematic diagram of a financial transaction. Each of us has a bank account, and when our bank account makes a consumption or makes a transfer, this account is the point on the graph, and this edge can indicate that there is such a transfer relationship between us.
+
+We can also see from this example that edges can attach information and points can attach information. The point can attach which bank this account is in and what the account is. The value of the transaction can be attached to the edge, and many times, if your transaction is large, it indicates that special attention is needed. This edge might not necessarily be the amount of a particular transfer, it might be the amount accumulated over a period of time and so on. Graphs can actually be very expressive.
+
+On the other hand, for a graph like finance, it can be very large. There could be more than a billion points, a hundred billion or even a trillion edges. As you can imagine, it's actually quite challenging to actually work with these graphs.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..935aa4ffa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# What is a graph database
+
+> This document mainly introduce what is a graph database, the advantages of graph database compared with relational database, and the comparison between graph database and relational database
+
+## 1. Introduction
+
+Graph database is a database based on graph model. The main function of graph database is to manage graph data, so it needs to support efficient vertex/edge query and update; To facilitate user use, it is usually necessary to add transaction support to ensure the normal operation of concurrent operations.
+
+## 2. Advantages of graph databases over relational databases
+
+The function of graph database is an extension of traditional relational database. Compared with relational database, the graph structure supported by graph data is more flexible. Graph database is different from other databases in terms of data addition, deletion, query and modification based on graph. On the operation abstraction of graph data, a vertex-based perspective is adopted, for example, a vertex accesses its neighboring vertices through all its outgoing edges. This kind of operation is also the core of the design of graph database system.
+
+The uniqueness of graph database can be reflected in the following three aspects:
+
+### 2.1 Performance
+
+Handling the relationship between data, it is inevitable to use table JOIN operation in relational database, which has a great impact on performance. Graph database is a direct access, similar to pointer access, which is more efficient operation of associated data, compared with relational database performance improvement of 2 to 4 orders of magnitude.
+
+### 2.2 Compatibility
+
+In reality, the process of a project is often evolutionary. The content and even the format of the data are constantly changing. In a relational database, this means that a change in the table structure, or the creation of multiple new tables, significantly changes the source data. In the graph database, you simply add new vertices, edges, and attributes, and set them to the corresponding types. In essence, a table represents a type of data, and a vertex represents a specific data, meaning that relational databases pay more attention to the type of data, while graph databases pay more attention to the individuals of data and identify their association relationships.
+
+### 2.3 Intuitive
+
+Using graphs (or nets) to express real-world relationships is more straightforward and natural, especially in the Internet of Things era. If relational data used, a high degree of abstract thinking required to build a table of characters first, then a table of relations, and finally a map of data. When analyzing and querying the graph data, you can also intuitively find the desired data interactively through the point-edge connection topology, without any professional knowledge.
+
+## 3. Comparison between graph database and relational database
+
+| classification      | model           | advantage                                                            | disadvantage                                                                 | example        |
+| ------------------- | --------------- | -------------------------------------------------------------------- | ---------------------------------------------------------------------------- | -------------- |
+| Relational database | Table structure | Data is highly structured, consistent, and software maturity is high | The multi-hop association query is inefficient or not supported              | MySQL、Oracle  |
+| Graph database      | graph structure | Modeling and manipulating associations is very efficient             | Highly structured data processing is not as powerful as relational databases | Neo4j、TuGraph |
+
+In a word, in the face of massive data storage and processing problems, the traditional relational database has been unable to meet most of the daily data storage needs. Graph database technology can store relational information as entities and expand data model flexibly. Because it provides the most direct expression of related data, and the graph model is naturally tolerant to heterogeneous data. In the future, graph database technology will become one of the most popular technologies, which will provide powerful support for enterprises to store and analyze large-scale graph data.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..5b14941d5d
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,103 @@
+# What is TuGraph
+
+> This document mainly introduces the main features and characteristics of TuGraph Community Edition, as well as the differences between TuGraph Enterprise Edition and Community Edition.
+
+
+## 1.Introduction
+
+Graph database is a non-relational database that stores data by vertices and edges. It can be used to store complex data network models, such as social networks and transaction networks. TuGraph is a graph database developed by Ant Group. This manual introduces the functions and usage of TuGraph.
+
+## 2.TuGraph Community Edition
+
+The Community Edition is a fully functional version of TuGraph, suitable for single-instance deployment. It provides complete basic fuctions of graph database, such as ACID-compatible transactions, programming APIs, and associated tools. It is ideal for learning TuGraph and implementing small projects.
+
+## 3.TuGraph features
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property graph model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+## 4.The data model
+
+### 4.1.Graph model
+TuGraph is a strong schema, directed property graph database with multi-graph capability.
+
+- Graph Project: Each database service can host multiple graph projects (multi-graphs), and each graph project can have its own access control configuration. The database administrator can create or delete specified graph projects.
+- Vertex: Refers to entity, generally used to express real-world entities, such as a movie or an actor.
+    - Primary Key: User-defined vertex data primary key, unique in the corresponding graph project and vertex type.
+    - VID: Refers to the auto-generated unique ID of the vertex, which cannot be modified by the user.
+    - Upper Limit: Each graph project can store up to 2^(40) vertex data.
+- Edge: Used to express the relationship between vertexs, such as an actor appears in a movie.
+    - Directed Edge: The edge is a directed edge. If you want to simulate an undirected edge, the user can create two edges with opposite directions.
+    - Duplicate Edge: TuGraph currently supports duplicate edges. If you want to ensure the uniqueness of the edge, you need to implement it through business policies.
+    - Upper Limit: Up to 2^(32) edge data can be stored between two vertex data.
+- Property Graph: vertexs and edges can have properties associated with them, and each property can have a different type.
+- Strong-typed: Each vertex and edge has only one label, and after creating a label, there is a cost to modify the number and type of attributes.
+    - Specify the starting/ending vertex type of the edge: You can limit the starting and ending vertex types of the edge, and support different vertex types of the starting and ending vertexs of the same type of edge, such as individuals transferring money to companies, companies transferring money to companies. After specifying the starting/ending vertex type of the edge, you can add multiple sets of starting/ending vertex types, but you cannot delete the restricted starting/ending vertex types.
+    - Unrestricted Mode: Supports creating edge data of this type between any two vertex types without specifying the starting and ending vertex types of the edge. Note: After specifying the starting/ending vertex type of the edge, the unrestricted mode cannot be used again.
+
+### 4.2.The data type
+
+TuGraph Supports a variety of data types that can be used as attributes, the specific supported data types are as follows:
+
+<caption>Table 1. TuGraph supported data types</caption>
+
+| **Type** | **Min**             | **Max**             | **Description**                                  |
+|----------|---------------------|---------------------|--------------------------------------------------|
+| BOOL     | false               | true                | Boolean                                          |
+| INT8     | -128                | 127                 | 8-bit int                                        |
+| INT16    | -32768              | 32767               | 16-bit int                                       |
+| INT32    | - 2^31              | 2^31 - 1            | 32-bit int                                       |
+| INT64    | - 2^63              | 2^63 - 1            | 64-bit int                                       |
+| DATE     | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" Date of format                      |
+| DATETIME | 0000-00-00 00:00:00 | 9999-12-31 23:59:59 | "YYYY-MM-DD hh:mm:ss"Format of the date and time |
+| FLOAT    |                     |                     | 32-bit float                                     |
+| DOUBLE   |                     |                     | 64-bit float                                     |
+| STRING   |                     |                     | A string of variable length                      |
+| BLOB     |                     |                     | Binary data                                      |
+
+_BLOB data is BASE64 encoded in input and output_
+
+### 4.3.Index
+
+TuGraph supports indexing vertex fields.
+
+Indexes can be unique or non-unique. If a unique index is created for a vertex label, TuGraph will perform a data integrity check to ensure the uniqueness of the index before modifying the vertex of the label.
+
+Each index built on a single field of a label, and multiple fields can be indexed using the same label.
+
+BLOB fields cannot be indexed.
+
+TuGraph supports creating indexes on properties of vertexs or edges to improve query efficiency.
+- The index can be a unique or non-unique index.
+- If a unique index is created for a vertex label, when modifying the vertex of the label, data integrity check will be performed first to ensure the uniqueness of the index.
+- Each index is created based on a property of a vertex or edge, and indexes can be created on multiple properties of the same vertex or edge.
+- An index cannot be created on a BLOB-type property.
+
+## 5.TuGraph Enterprise Edition
+
+The Enterprise Edition has more comprehensive support for commercial features, including distributed cluster architecture, a one-stop graph platform covering exploration, research and development, service and operation and maintenance throughout the lifecycle, online, near-line, and offline graph computing engines, support for streaming and big data data sources, multi-site and multi-center deployment, making it an ideal choice for commercial solutions.
+
+```text
+    If you need to implement production-level high-availability cluster architecture, operation and maintenance and other enterprise-level services, please contact us to obtain commercial support:
+    Email:tugraph@service.alipay.com
+    Tel:0571-85022088,extension number 83789993#
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..de894fa1b0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# Performance Oriented
+
+> This document mainly introduces TuGraph's performance-oriented design philosophy as an open-source graph database.
+
+## 1.Introduction
+
+TuGraph is currently the fastest graph database in the world, ranking first in the LDBC SNB Interactive graph database standard evaluation (March 2023). The design of TuGraph is based on performance optimization, and is committed to building a high-performance single-machine graph database. This document describes the core design of TuGraph's storage layer based on performance optimization.
+
+## 2.Characteristics of Graph Operations
+
+Operations on property graphs involve reading, writing, and their attributes, and the access patterns of some special attributes such as timestamps can also affect overall performance. Here, by summarizing the regularities of some graph operation characteristics, we can guide the final performance.
+
+We observe that many graph applications have similar data access patterns. For example, in credit risk control, we use recursive path filtering to search for many-to-one patterns to find suspicious credit fraud users and behaviors. For online gambling, we can identify gambling-related fund accounts by recognizing multiple fund transfers in a short period of time. The equity penetration scenario recursively calculates the equity relationship between entities. These scenarios have common patterns such as multi-hop entity and relationship access, time window constraints, and read/write transactions.
+Furthermore, from the discussion in the introduction and the analysis of graph workloads, the following characteristics can be summarized:
+
+**Characteristic 1** KHop is the most typical operation in a graph, based on the data access pattern of the graph topology of points and edges, and has essential differences from relational databases. The typicality of KHop is not only reflected in the different data access patterns, but it is also the performance point that graph databases need to pay attention to the most.
+
+**Characteristic 2** Data access of graph workloads has a certain degree of locality on the topology, and the edges of the same point are usually accessed simultaneously. When the labels of these edges are the same, there is a greater probability of simultaneous access.
+
+**Characteristic 3** When accessing points and edges in graph workloads, their corresponding attributes are usually accessed as a traversal filter condition.
+
+**Characteristic 4** In time-based graph workloads, filtering of points and edges is usually within a certain time range, such as the past week.
+
+**Characteristic 5** Write operations may be accompanied by a large number of read operations, which need to be processed in a single transaction cycle.
+
+Through the analysis of actual online graph applications, the read/write ratio of graph workloads is about 20:1, although the scenarios are limited to the financial field and the number of clusters is also limited, the scale of the data involved and the number of users are very large, which is representative to some extent. The 20:1 read/write ratio of graph workloads indicates that the impact of read workload on overall performance is greater, and the performance of write workload cannot be ignored either.
+
+## 3.Storage Data Structures
+
+TuGraph uses B+ trees as the underlying data structure to support real-time transactional operations for insertion, deletion, querying, and updating.
+
+In sorting tree data structures, B+ trees and LSM trees are the main representatives. B+ trees use a split and merge method to update sorted data in tree nodes, while LSM trees append updates to logs for delayed data merging. B+ trees were originally used in file system implementations, solving the problem of differences in performance between sequential and random operations on hard disks by storing data in adaptive-length leaf nodes, and have a relatively balanced read/write performance. The main advantage of LSM trees is to use WAL (Write Ahead Log) to perform updates, which turns update operations into sequential operations, especially in the case of small key-value pairs. WAL means that the update of data is deferred until it is merged in batches, which can improve the comprehensive efficiency of batch updates, but also makes the system scheduling more complicated. If the update merge is not completed, and the data is read again, LSM trees need to read several levels of locally merged logs, which will cause read amplification and space amplification, thereby affecting read efficiency.
+
+To sum up, B+ trees have better sequential read/write performance, while LSM trees have advantages in random write data. In addition, the way of LSM trees using background merging makes the performance fluctuation difficult to predict, and the correlation between performance fluctuation and upper-level storage and computation is weak, which increases the overall design cost. Considering the above factors, TuGraph chooses B+ trees as the implementation for read performance optimization.
+
+## 4.Data Encoding
+
+For property graph models, in addition to graph topology encoding, property data also greatly affects functionality and performance. We first discuss how property data can be encoded together with topology data. From current research, there are two ways of encoding properties: discrete encoding, which stores property data separately based on pointer indexes, and compact encoding, which packs property data and topology data together. Discrete encoding can store each property separately or pack each edge's properties separately, and the following discussion applies to both situations.
+
+Vertex Query: Property encoding mainly focuses on edges and does not involve vertex queries.
+
+Single-Edge Query: Discrete encoding locates edges through pointers, while compact encoding requires binary search to locate the edge position. Discrete encoding has a slight advantage.
+
+Edge Traversal: Discrete encoding requires constant random access through pointer jumps during edge traversal, while compact encoding arranges data together in advance, greatly improving efficiency due to its sequential access feature. Since edge traversal operations are common according to Rule 3, compact encoding has obvious advantages in edge traversal.
+
+Single-Edge Update: Discrete encoding only requires finding the corresponding pointer position and modifying the pointer's location before and after inserting data. Compact encoding needs to re-encode the compactly arranged data and rewrite the entire edge value, resulting in significant overhead compared to discrete encoding.
+
+Batch Edge Update: Batch updates can pre-build all edge properties for a vertex in memory and write them in one encoding, making both discrete encoding and compact encoding equivalent. However, compact encoding does not require storing pointer variables, so it has higher storage space efficiency.
+
+The performance issues of discrete encoding and compact encoding for a certain type of query discussed above can be alleviated through optimization. Overall, due to the 20:1 read-write load of graphs and the characteristics of property access revealed by Rule 3, TuGraph tends to use compact encoding to ensure read performance. Its main weakness is the overhead of re-encoding during single-edge updates, which can be solved using adaptive mapping technology.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..c60df29973
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,33 @@
+# Multi Level Interfaces
+
+> This document mainly introduces the design concept of TuGraph's multi-level interfaces.
+
+## 1.Introduction
+
+The multi-level interface is a balance between usability and high performance that TuGraph has designed to meet a variety of use cases. For example, Cypher, a declarative graph query language, can abstract away the implementation details of a graph database and express queries based on the graph model. However, Cypher's high-level descriptions cannot be efficiently translated into low-level execution, so TuGraph provides a procedural language, Procedure API, to achieve optimal database performance.
+
+Interfaces can be roughly divided into client interfaces and server interfaces. Most operations are performed on the server, and the client only does data encapsulation and parsing. The client and server are connected through a network, and TuGraph supports both flexible short-connection REST protocol and more efficient long-connection RPC protocol, which can be selected according to different business scenarios.
+
+The server interfaces are all at the calculation layer and are logically separated from the graph data storage by a Core API layer.
+
+![Multi Level Interfaces](../../../../images/multi-level-Interfaces-en.png)
+
+### 1.1.Client Interface
+
+The client interface refers to the interface executed on the client and is typically used for integration into software applications. TuGraph's client interface is relatively simple, including login/logout, data import/export, stored procedure loading and calling, and Cypher operations. Cypher integrates most of the functions, including data operations, graph model operations, operations and account management.
+
+Since the parameters and return values of Cypher are strings, JAVA OGM is a structured wrapper for Cypher, meaning that query results can be encapsulated into a typed object for ease of use.
+
+### 1.2.Server Interface
+
+The server interface includes Cypher, Procedure API, OLAP API, and GNN PI, which provide services for graph transaction engines, graph analysis engines, and graph neural network engines. The characteristics of each interface are explained in detail below.
+
+> __Cypher__ is an abstract description of query logic that is independent of execution logic and is more user-friendly for graph database applications, similar to the SQL language of relational databases. TuGraph's Cypher language mainly follows the OpenCypher query standard open-sourced by Neo4j and extends auxiliary functions such as operations and maintenance management. Descriptive graph query language will become the main data operation method for graph databases, but generating the optimal execution plan between description and execution still requires a long way to go in both academia and industry.
+
+> __Procedure API__ is designed to bridge the gap between descriptive graph query language and optimal performance. TuGraph's Procedure API provides a simple wrapper on top of the Core API, which maximizes the storage's performance efficiency and is the upper limit of Cypher optimization performance. Python Procedure API is a cross-language wrapper on top of C++ Procedure API, but the copying of values during translation may result in some performance loss, and its advantage lies mainly in the ease of use of the Python language. The traversal API is a parallel-executing Procedure interface that is more similar to set operations in terms of description, such as expanding all outgoing neighbors of a point set to obtain a new point set.
+
+> __OLAP API__ belongs to the category of "graph computing systems" and exports snapshots of graph data from storage that supports insert, update, delete, and query operations to support read-only complex graph analysis in a more compact data storage format. OLAP API encapsulates data structures that support high-concurrency execution, including Vector, Bitmap, and CSR-based graph snapshot data structures, and provides a set of concurrent fast point-edge operation frameworks. After the graph analysis task is completed, the data can be written back to the graph database through the interface.
+
+> __GNN API__ mainly provides the interfaces needed for graph neural network applications and can be integrated with machine learning frameworks such as PyTorch. TuGraph's GNN PI mainly integrates DGL and completes the entire process from graph storage to graph neural network application in the Python language environment.
+
+Except for Cypher's interpretive execution, all other server interfaces are compiled and executed, meaning that the corresponding code needs to be sent to the server and compiled (which may take some time) before execution on the server. Therefore, it is usually necessary to load the program first, then find it in the list of loaded applications, and execute it after passing in the input parameters.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/3.htap.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/3.htap.md
new file mode 100644
index 0000000000..080cc02e48
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> This document mainly introduces the design philosophy of TuGraph's HTAP.
+
+## 1.Introduction
+
+![htap](../../../../images/htap-en.png)
+
+There are different ways to implement HTAP in architecture: one is to use two different copies to handle OLTP and OLAP tasks separately, with the core being data consistency synchronization and additional resource overhead; the other is to use the same data storage at all times, but this implementation has memory bloat in its data structure and needs further work for industrialization. In TuGraph's design, simple OLAP and OLTP operations share the same data, while complex OLAP operations are exported and handled separately as snapshots.
+
+## 2.Design
+
+In TuGraph, OLTP is the graph transaction engine, corresponding to transaction operations in Figure; OLAP is the graph analysis engine, corresponding to simple graph analysis operations (such as SPSP) and complex graph analysis operations (such as PageRank), the former of which can be executed directly on the graph storage, while the latter requires exporting a snapshot for execution.
+
+- Transaction operations, measured by the graph transaction engine, are local graph add, delete, query and modify operations, typically used for K-hop access.
+- Simple analysis operations are the simpler part of the graph analysis engine, usually local graph analysis operations, such as the shortest path algorithm SPSP and Jaccard algorithm.
+- Complex analysis operations are the more complex part of the graph analysis engine, usually involving multi-round data iteration operations across the entire graph, such as the PageRank algorithm for webpage ranking and the Louvain algorithm for community discovery.
+
+As shown in Figure , external storage is added to the architecture diagram, making the data source for graph analysis not limited to the graph database and can be directly read from text files.
+
+- Graph storage, which is the storage in the graph database, has carefully designed data structures that can perform real-time add, delete, query and modify operations.
+- External storage, which can be an RDBMS or text file, is stored in a simple way as an edge table, only for one-time batch reading and batch result writing. In the calculation layer, it corresponds to the interface in the overall architecture diagram.
+- Cypher, the declarative graph query language, can be executed concurrently.
+- Procedure API, the procedural graph query language, is flexible and can support both transaction operations and graph analysis operations, but its efficiency is not sufficient to complete complex graph analysis operations, and it can be executed concurrently.
+- OLAP API, for multi-round iteration of complex graph analysis. Applications need to first export the graph data in storage into a snapshot in memory, which is only used for fast access and does not need to consider the write support of ACID, so it can be arranged more compactly, and the read efficiency of CSR arrangement is much higher than that of graph storage data arrangement. OLAP API can only be executed serially, and each operation uses full CPU resources.
+
+OLAP API snapshots can be created from external storage, where the edge table data is formatted as CSR, or from the graph storage. It should be noted that OLAP API requires that the IDs of the vertices be consecutive natural numbers, which may require additional ID mapping. This step can be mapped to a specified attribute when creating a snapshot or directly using the attribute value as the ID.
+
+Corresponding to the calculation interface and storage, there are four operating modes.
+
+- Transaction mode, each operation corresponds to a Cypher statement, which is a transaction by default.
+- Plugin mode, call through plugins, after the calculation logic is loaded on the server, also known as stored procedures.
+- Embed mode, which has the same interface as Plugin mode but the graph database service does not need to be started and can directly call the data in the database through the interface. This mode is usually used for debugging Procedure API and OLAP API code, and the debugging information and operation steps are more friendly than Plugin mode.
+- Standalone mode, which maximally separates from the graph database, is more direct when only using the graph analysis engine for data analysis. Standalone mode will directly use the data of the external storage.
+
+The use of the graph neural network engine is similar to the 'complex graph analysis operation', which calls part of the OLAP API and GNN API at the same time, which is not elaborated here.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/index.rst
new file mode 100644
index 0000000000..b42c13eac8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/4.characteristics/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Characteristics
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/5.architecture.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/5.architecture.md
new file mode 100644
index 0000000000..198facd84b
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/5.architecture.md
@@ -0,0 +1,15 @@
+# Architecture
+
+> This document mainly introduces the product architecture of TuGraph.
+
+## 1.Introduction
+
+![Architecture](../../../images/architecture-en.png)
+
+The following diagram shows the overall architecture of an enterprise-level graph database from the perspective of functional modules, using TuGraph as an example, from bottom to top:
+
+- Software and hardware environment. This involves the development and use environment of the graph database. TuGraph is mainly developed based on the underlying C++ language, and is compatible with most operating systems and CPUs on the market.
+- Storage layer, including the KV storage layer and the graph storage layer. The storage layer needs to support various functions required by the calculation layer.
+- Calculation layer. The calculation layer should include the graph transaction engine, graph analysis engine, and graph neural network engine. It also includes a variety of programming interfaces provided by the server, including descriptive query language Cypher, stored procedures, and so on.
+- Client. The client SDK should support multiple languages such as Java, Python, and C++, and also support command-line interaction. The Browser and Explorer reduce the threshold for using the graph database through web-based interaction.
+- In terms of ecological tools, it covers the development, operation, and management links of enterprise-level graph databases, improving usability.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/6.functionality.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/6.functionality.md
new file mode 100644
index 0000000000..eaf709f08e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/6.functionality.md
@@ -0,0 +1,101 @@
+# Functionality
+
+> This document mainly introduces the main functions and features of TuGraph.
+
+## 1.Installation
+
+## 1.1.Installation
+
+Deployment methods TuGraph currently provides three deployment methods: cloud deployment, Docker deployment, and local package deployment. Users can choose the appropriate deployment method according to their actual situation.
+
+## 1.2.Software and Hardware Environment
+
+TuGraph core is developed in C++, and the default compiler used is GCC8.4, using c++14 standard. Some functions use other compilers, such as ApacheLucene-based full-text indexing, which uses JNI interface and requires a Java compiler. In addition, the Python Procedure API is provided in the stored procedure, which requires a Python environment. TuGraph does not require special hardware such as GPUs, and can naturally adapt to general hardware upgrades such as RDMA and HBM with high latency and low bandwidth.
+
+TuGraph has been tested on CPUs based on X86 and ARM, including Intel, AMD, Kunpeng, Hygon, Feiteng, etc., and also runs on multiple operating systems, including mainstream versions of Ubuntu, CentOS, SUSE, Galaxy Kylin, Zhongbiao Kylin, and UOS, without special requirements for operating systems and CPUs.
+
+The software and hardware environment also includes the environment of dependent libraries. Since the default KV storage in TuGraph's storage layer is LMDB, the file system needs to support POSIX interfaces. The compilation and parameter configuration in different environments will be slightly different. For example, in the packaging of point-edge data in graph storage, it should match the page table size of the operating system, which is 4KB by default, and it is recommended to set the system's page table size to 4KB.
+
+## 2.Storage layer
+
+In the graph data model, TUGraph supports the attribute graph model, which can be divided into subgraphs, tags (including vertex tags and edge tags), and attributes according to the hierarchy.
+
+From the perspective of the storage layer, TuGraph uses an intuitive multi-layered tree model, without tags across subgraphs or attributes across tags, and only retains the core logic of the graph model. In terms of subgraph storage, TuGraph has performed data physical isolation for multiple graphs, and each graph corresponds to an instance of LMDB. The metadata description information of multiple graphs is saved in a special public LMDB instance called meta. The storage of vertex and edge tags and their attributes maps graph data adaptively to KV key-value pairs, maximizing read performance. At the same time, multi-threaded writing is implemented at the KV layer, solving the disadvantage of low write performance of LMDB. Primary key indexes and secondary indexes correspond to B+ tables in LMDB, supporting index value addition, deletion, query, and modification based on comparison.
+
+The storage layer also retains some other non-core functional data, including permission data, pre-compiled plugin data, and monitoring data.
+
+## 3.Calculation layer
+
+The calculation layer is divided into three parts in terms of function, including the TP-class graph transaction engine, the AP-class graph analysis engine, and the graph neural network engine.
+
+__The graph transaction engine__ is mainly used to process concurrent graph operations, including single-point queries, neighbor queries, and path traversal. The graph transaction engine focuses on ACID transactions of concurrent operations, ensuring that the operation logic will not interfere with each other. The main performance indicator is QPS, which is the number of completed queries per second.
+
+__The graph analysis engine__ usually operates as a full-graph iteration. Some simple analysis tasks (such as SPSP) can be completed by the graph transaction engine, and complex analysis tasks are completed by the graph analysis engine, which usually takes several seconds to several hours for a single task. Therefore, a single graph analysis task should use all hardware resources in parallel, and the performance indicator is the total time for completing the task.
+
+__The graph neural network engine__ usually operates as a full-graph iteration. In addition to graph topology-based operations, the graph neural network engine also needs to integrate a machine learning framework to handle vector operations, such as PyTorch, MXNet, and TenserFlow.
+
+The logic of the three engines is different and independently configured for resource pools. The graph transaction engine sets up a thread pool based on RPC operations. For each operation received from the client, a thread is taken from the pool to process it, and the number of concurrent executions is equal to the capacity of the RPC thread pool, which is usually configured as the number of server cores. The graph analysis engine has an analysis thread pool, and each graph analysis task is executed concurrently, that is, all threads are used to execute a task to speed up the performance of the operation. The serial execution feature of TuGraph graph analysis operations will restrict the user experience to a certain extent. The demand for concurrent graph analysis can be processed by deploying high-availability, increasing machine resources, or connecting to an external task scheduler to transfer data to a container for real-time scheduling and calculation. Graph neural network operations will reuse the resources of the graph transaction
+
+## 4.Core Features
+
+### 4.1.Query Language
+
+TuGraph provides Cypher graph query language that follows the OpenCypher standard.
+- Supports Procedure embedding.
+- Supports pluggable optimization frameworks with various optimization features.
+- Supports extensible security check framework for Cypher.
+
+### 4.2.Stored Procedures
+
+When users need to express complex query/update logic that Cypher cannot describe, or when high performance is required, TuGraph's stored procedures (Procedure) is a more concise and efficient choice than calling multiple REST requests and completing the entire processing flow on the client-side.
+
+### 4.3.Data Import/Export
+
+Although TuGraph supports data insertion, batch import can greatly improve efficiency. The import function can be divided into importing into an empty database (offline import) and incremental import. The former refers to importing when the subgraph is empty, and the additional assumption can greatly improve the import performance. In TuGraph, the throughput rate of empty database import and incremental import differs by 10 times. Data consistency needs to be considered in data export, which is based on exporting data based on a snapshot.
+
+TuGraph can perform data export on graph data already stored in TuGraph using the command-line tool `lgraph_export`. The export format supports CSV and JSON.
+
+### 4.4.Backup and Restore
+
+ TuGraph's backup function can be divided into active/scheduled, offline/online, and full/incremental backup. The goal is to complete the backup with the smallest storage and computing costs possible. The Restore function can restore to the latest state or a historical marked time point, ensuring that the database is in a consistent state.
+
+### 4.5 Data Warmup
+
+TuGraph is a disk-based graph database, and data is loaded into memory only when it is accessed. Therefore, system performance may deteriorate due to frequent IO operations in the first period after the server is opened. We can improve this problem by preheating the data in advance.
+
+### 4.6 High Availability Mode
+
+High availability means that by configuring a cluster, real-time multi-replica data hot backup can be achieved, and the cluster can still provide services when some replicas are not in use. TuGraph uses the multi-machine hot backup mechanism of the RAFT protocol, which can reduce RPO to near 0. Data synchronization is performed at the computation layer through RPC interfaces for write operations. The high availability cluster of TuGraph adopts a master-slave mode, where only the master node processes write requests, and both master and slave nodes can process read requests. The write request processing of the master node needs to be synchronized to more than half of the total nodes. The write request is considered complete when the majority of the nodes have written successfully.
+
+## 5.Client Tools
+
+Client Tools Client tools mainly include SDKs for various programming languages, OGM, and command-line tools.
+
+The client SDK is mainly used for secondary development and can be linked to the server through RPC or REST protocols. RPC has better performance based on long links, and data needs to be uniformly serialized through protobuf. TuGraph uses brpc, which supports rpc clients in Java, Python, and C++. REST's protocol is more flexible and can be easily adapted to more diverse environments, and different programming languages can easily connect. TuGraph provides a Python REST client instance, and command-line interaction is also implemented using REST.
+
+OGM (Object Graph Mapping) is a graph object mapping tool for TuGraph, which supports mapping JAVA objects (POJO) to TuGraph. Classes in JAVA are mapped to nodes in the graph, collections in classes are mapped to edges, and properties of classes are mapped to properties of graph objects. It also provides corresponding function to operate the graph database. Therefore, JAVA developers can easily use TuGraph database in a familiar ecosystem.
+
+The command-line tool `lgraph_cypher` is a query client that can be used to submit OpenCypher requests to the TuGraph server. `lgraph_cypher` client has two execution modes: single-command mode and interactive mode.
+
+
+## 6.Ecological Tools
+
+Ecological tools are a crucial component of enterprise-level databases, and a rich array of ecological tools can greatly enhance the usability and stability of graph databases.
+
+### 6.1.TuGraph DataX
+
+![Import&Export](../../../images/tugraph-datax.png)
+
+TuGraph's core supports importing and exporting CSV and JSON data, offering both full database and incremental importing modes. In practice, there may be a need to import from multiple data sources such as MySQL, Kafka, and Hive, and TuGraph connects to these sources using DataX. Due to the differences between relational and graph models, data cleaning processes can be quickly processed using SparkSQL. TuGraph focuses only on the reliability and performance of simple CSV and JSON scenario imports.
+
+### 6.2.Visual Interaction
+
+TuGraph Browser is a visual interface for direct users of graph databases, covering most of TuGraph's capabilities, including data import, graph model building, data addition/deletion/query/modify, and monitoring and maintenance operations.
+
+TuGraph Explorer targets graph business users and focuses more on business logic. Explorer is a visual interactive interface generated using Graph Insight's zero-code programming framework, which can easily add more user-friendly interactive elements to present the graph as an underlying image of understanding.
+
+### 6.3.Monitoring
+
+TuGraph uses the Prometheus + Grafana monitoring framework in a loosely coupled manner. Prometheus obtains monitoring information from TuGraph's monitoring interface, stores it in a local time-series database, and then displays it interactively on the web using Grafana.
+
+The monitoring states provided by TuGraph include the state of the graph database and the state of the server. The former includes the database-side status such as read/write load and number of vertices/edges, while the latter includes the real-time status of the server's memory, CPU, and hard disk. If some monitoring state exceeds the expected threshold, proactive alerts are necessary, usually requiring integration with other operations and control systems such as group messaging and email alerts.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/7.scenarios.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/7.scenarios.md
new file mode 100644
index 0000000000..9d5a7ac434
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/7.scenarios.md
@@ -0,0 +1,61 @@
+# Scenarios
+
+> This document mainly introduces the application scenarios of graph databases.
+
+## 1.Financial Industry
+
+The entities in the financial industry mainly involve people, companies, accounts, products, etc., and their relationships include transaction relationships, logging relationships, equity relationships, employment relationships, etc. These entities form a financial graph data network. By applying graph databases, we can discover a lot of useful information from the financial graph data network, which helps us make more accurate financial decisions.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Loan review|By analyzing the applicant's relationship and transaction history, etc., it is auxiliary to judge the applicant's repayment ability and willingness. It can be applied to retail loan review, small and micro loan review, supply chain finance, etc. This method can complement the traditional audit mechanism based on the applicant's own information, which is particularly useful for small and micro loan audits with low individual information coverage.|
+|Post-loan|By analyzing the borrower's transaction history, it assists in analyzing whether the borrower has default risk. Compared with the traditional method of issuing alerts only when loan funds flow to specific users, this method can assign a risk value to each account and issue warnings when the loan flows to high-risk accounts.|
+|Missing recovery|By analyzing the social and shopping data of missing borrowers, other contact methods can be found. This method can significantly improve the recovery rate of missing borrowers.|
+|Guarantor loop detection|Special guarantee structures such as cyclic, chain, family-style, and cross can be found in the guarantee relationship graph to expose potential risks. Compared with the JOIN method of a relational database, the solution based on graph algorithms is more efficient, can detect any length of guarantee loop, and can achieve more complex limited condition detection.|
+|Credit card fraud detection|A relationship network of addresses, contact information, etc. in credit card application information is constructed, and a community discovery algorithm is run in the application relationship network to detect suspected fraudulent gangs, thereby rejecting suspected fraudulent applications and reducing economic losses.|
+|Anti-money laundering|Suspected money laundering behaviors and links can be found through the transaction network and medium network. Money laundering is a complex process involving multiple parties. By conducting graph analysis in transaction and social networks, we can more accurately detect money laundering behaviors.|
+|Car insurance anti-fraud|For insurance fraud involving repair shops, by analyzing the relationship between the insured person, the case location, and the repair shop, fraudulent claims can be more accurately identified, reducing economic losses.|
+
+## 2.Industrial Industry
+
+A large amount of heterogeneous data will be generated in the production and manufacturing process, and how to effectively organize and manage these data is one of the most important issues in industrial big data. These data include design documents, equipment data, simulation plans and results, experimental results, experience documents, etc. The relationships between these data are complex, and traditional data management systems can only accumulate data, and they are often unable to search for related materials. Using graph models, these different types of data are organized into a network, which makes it easy to browse and search for data.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Supply chain management|Supply chain data mainly concerns the correspondence between products, components, and parts, the correspondence between parts and suppliers, and sensitive components in parts. Compared with the traditional BOM system, the solution using graph databases can more conveniently maintain complex networks of multiple component levels and multiple supplier levels, thereby providing basic support for a through supply chain.|
+|Document management|Using graph databases can organize different types of documents together organically according to different relationships. For example, design documents for components, component-part relationships, component test documents, relevant experience documents, etc. can be organized together so that all relevant information for the component can be obtained easily when needed.|
+|R&D process management|A large amount of simulation, experimentation, and testing needs to be performed in the product development and verification process. Each test process involves many different steps, the connection between the steps, the data versions used in each step, and the algorithm versions all make up a complicated relationship network. Using graph databases can better manage this relationship network, providing a good foundation for data reuse and process improvement in the R&D process.|
+|Equipment information management|Manufacturing requires the management of a large number of devices, which are interrelated (power supply, feeding, spatial relationship) to form a complex network. Traditional databases are difficult to reflect this complex relationship. Using graph databases can easily represent these relationships, thereby better managing equipment information.|
+
+## 3.Smart City
+
+With the development of technology, intelligent management of cities has become a major trend. Intelligent management requires a strong system software to support it, built on a good information management platform. In an intelligent city management system, an intelligent decision-making system needs to make decisions based on a large amount of different information, including various topology information (such as roads, pipelines, etc.), supply and demand information (such as electricity transmission, drinking water supply, sewage discharge, etc.), environmental information (such as temperature, humidity, rainfall, etc.), and so on. To manage these complex and heterogeneous data organically and make decisions based on them, a mature system is needed. Traditional data management systems based on relational data models are not suitable for managing such complex and heterogeneous data. Using a graph model can solve this problem well. If we manage these different data using a graph database, we can achieve many complex intelligent management scenarios.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Smart Traffic|Based on road topology, road capacity, and current traffic flow, intelligent traffic signal scheduling can be performed to improve traffic efficiency.|
+|Smart Drainage|Based on drainage system information and current rainfall, the drainage system can be scheduled to reduce the occurrence of waterlogging.|
+|Pipeline Management|Organizing the production, installation, topology information, and historical status information of pipelines can help us manage the pipelines throughout their lifecycle, including fault diagnosis, life assessment, etc.|
+|Crowd Evacuation|When a large number of people need to be evacuated, multiple transportation modes such as buses, subways, taxis, shared bicycles, etc., need to be considered, as well as the road carrying capacity. Using a graph database to organically integrate this information can help us make better decisions and provide better support for large public events.|
+
+## 4.Social Governance
+
+Social governance involves public safety, legal affairs, public opinion, network security, and more. Social governance is a comprehensive, multi-system linkage problem. It requires the synthesis of a large amount of data and global considerations to make better decisions. In this multidimensional and complex data problem, the graph data model can provide better adaptability and provide a solid foundation for intelligent social governance decision-making platforms.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Criminal Gang|Conspiratorial gangs will inevitably make contact through some means, including face-to-face meetings (appearing in the same place), phone calls, or internet contacts, and they may also have economic exchanges. If we store all of this data in a unified graph, we can use graph analysis algorithms to identify closely connected groups and then discover and identify the entire criminal gang.|
+|Stakeholder Case Investigation|Stakeholder cases, especially stakeholder economic cases, often involve a large number of personnel and elements (money, location, events, etc.). How to effectively organize this information to provide evidence for handling cases is a difficulty in stakeholder case investigation. Using graph databases to store and analyze this information can help us quickly locate the data, analyze the personnel structure, and provide better technical support for case investigation.|
+|Illegal Website Identification|Illegal websites, phishing websites, yellow websites, and so on, often use different domain names and IPs to avoid being blocked. The filter method based on a blacklist can only block known illegal websites and cannot effectively identify new domain names and IPs. Based on the IP-domain name network mapping relationship, we can create a graph and then use graph calculations to establish a "trustworthiness" model for domain names and IPs to determine whether a website belongs to an illegal website.|
+|Court File Management|Case files are often complex, and different cases may be linked through parties, locations, case nature, judges, and so on. These links constitute a complex network. Using a graph database, we can more conveniently manage these complex relationships and improve case handling and query efficiency.|
+
+## 5.Internet
+
+Social networks and person-product purchase relationships can all form a network. By analyzing this network data, we can provide users with better services, including relevant recommendations, user information collection, important user identification, and spam user identification, and so on.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|ID-Mapping|Graph databases can store all user-related information, including the relationships between users, in one database, and can also use these relationships to identify situations where one person has multiple accounts or multiple people share an account, thus providing decision support for future risk control, recommendations, and other businesses.|
+|Friend Recommendation|Based on the analysis of social networks, we can provide friend recommendations such as "friends of friends" and "common friends".|
+|Product Recommendation|Based on the user-product relationship graph, we can find users with similar interests and recommend other products that similar users have chosen.|
+|Spam User Identification|Traditional spam user identification is mainly based on user account information, such as registration information and posting information, but these types of information are relatively easy to forge. On the other hand, network-based information doesn't have this problem: it's difficult to forge. Therefore, spam user identification based on network information can be more accurate and efficient.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/8.glossary.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/8.glossary.md
new file mode 100644
index 0000000000..6f2aa1629a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/8.glossary.md
@@ -0,0 +1,27 @@
+# Glossary
+
+## 1.Graph Technology
+
+> __Graph Computing__:Generalized graph computing, including graph databases, graph analysis, and graph learning; Narrowly defined graph computing only includes graph analysis. The generalized definition is used by default.
+
+> __Graph Database__:Focuses on operations such as adding, deleting, modifying, querying, and transaction processing for graph data, such as TuGraph DB.
+
+> __Graph Analysis__:Focuses on algorithmic analysis and pattern analysis of entire graph data, such as TuGraph Analytics.
+
+> __Graph Learning__:Refers to the same meaning as graph neural networks and graph machine learning, such as TuGraph Learn.
+
+> __Graph Intelligence__:Same as generalized graph computing, including graph databases, graph analysis, and graph learning. It is usually used for conceptual promotion and not for products.
+
+## 2.Specific Concepts
+
+> __Vertex__:Also known as node or point. Avoid using the term "node" as it is often used to refer to the number of servers and can be easily confused. "Node" refers to the meaning of combination, intersection, and crossing; "node" can refer to a milestone on a timeline (key node) or a processing entity in a computer system (such as a server in a computer network).
+
+> __Edge__:Refers to the connection between two vertices.
+
+> __Degree__:Refers to the number of incoming or outgoing edges on a vertex. Note that in non-graph theory scenarios, "hops" are often referred to as "degrees".
+
+> __Hop__:Refers to the number of vertices between two vertices on a path (excluding the starting point and including the endpoint). "K-Hop" in the algorithm performance test refers to this meaning.
+
+> __Vertex Label__:Refers to the type of a vertex, also known as a point label.
+
+> __Edge Label__:Refers to the type of an edge, also known as an edge label.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/index.rst
new file mode 100644
index 0000000000..a42b1d7c5a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/2.introduction/index.rst
@@ -0,0 +1,16 @@
+TuGraph DB Introduction
+=================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.characteristics/index.rst
+   5.architecture
+   6.functionality
+   7.scenarios
+   8.glossary
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..09d47e172f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/1.preparation.md
@@ -0,0 +1,86 @@
+# Quick Start
+
+> This document is intended for new users to get started quickly and contains an introduction, features, installation, and use of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property Graph Model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+### 1.1.Supported Platforms
+
+TuGraph supports both X86_64 and ARM64 architectures in physical, virtual, and containerized environments.
+
+### 1.2.Hardware requirements
+
+_You are advised to use NVMe SSDS with large memory configurations for optimal performance。_
+
+| Hardware | Minimum Configuration | Recommended configuration |
+| -------- | --------------------- | ------------------------- |
+| CPU      | X86_64                | Xeon E5 2670 v4           |
+| Memory   | 4GB                   | 256GB                     |
+| Disk     | 100GB                 | 1TB NVMe SSD              |
+| System   | Linux 2.6             | Ubuntu 18.04, CentOS 7.3  |
+
+## 2.Installation
+
+TuGraph can be installed quickly via Docker Image or locally via RPM /deb packages.In addition, TuGraph offers community edition services on Alibaba Cloud Computing Nest, which means you don't need to purchase your own cloud host to quickly deploy TuGraph services and achieve operational monitoring, thus building your own graph application.
+
+> Official Website RPM /deb packages Download:[TuGraph DownLoad]( https://www.tugraph.org/download ).
+
+> The TuGraph image is hosted on DockerHub[DockerHub]( https://hub.docker.com/u/tugraph ).
+
+> The Cloud deployment can be searched on Aliyun Computing Nest or accessed quickly through the [deployment link]( https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true).
+
+### 2.1.Fast experience through Docker
+
+1. The Docker environment installed locally
+
+   The docker official documentation：https://docs.docker.com/get-started/
+
+2. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. Start docker
+
+   ```shell
+   docker run -d -p 7070:7070 -p 9090:9090 --name tugraph_demo tugraph/tugraph-runtime-centos7 lgraph_server
+   # 7070 is default http port，for web visiting。
+   # 9090 is default RPC port，for RPC client visiting。
+   ```
+
+4. Open by browser
+
+   `http://x.x.x.x:7070`
+
+   > Default account `admin`,Default password `73@TuGraph`
+
+5. Start
+   ```shell
+   docker run -dt -p 7070:7070 --name tugraph_demo tugraph/tugraph-runtime-centos7
+   docker exec -it tugraph_demo bash
+   # start the service
+   lgraph_server -d start
+   ```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..2ec92747d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# DEMO:Movie
+
+> This document mainly introduces the usage of the movie demo.
+
+## 1.Modeling and Data Import
+
+After logging in, click "Help", click "Quick Start", click "One-Click Model Creation", click "One-Click Data Creation", and complete the creation of the Movie Scene Graph.
+
+Movie：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| Label       | Type   | Description                                                                                           |
+|-------------|--------|-------------------------------------------------------------------------------------------------------|
+| movie       | Vertex | Represents a specific movie, such as "Forrest Gump".                                                  |
+| person      | Vertex | Represents a person, who may be an actor, director, or screenwriter for a movie.                      |
+| genre       | Vertex | Represents the genre of a movie, such as drama, horror.                                               |
+| keyword     | Vertex | Represents some keywords related to the movie, such as "save the world", "virtual reality", "subway". |
+| user        | Vertex | Represents a user who watches movies.                                                                 |
+| produce     | Edge   | Represents the relationship between the producer of a movie.                                          |
+| acted_in    | Edge   | Represents the relationship between actors and the movies they have appeared in.                      |
+| direct      | Edge   | Represents the relationship between a movie and its director.                                         |
+| write       | Edge   | Represents the screenwriting relationship of a movie.                                                 |
+| has_genre   | Edge   | Represents the genre classification of a movie.                                                       |
+| has_keyword | Edge   | Represents some keywords of a movie, which are more specific labels for classification.               |
+| rate        | Edge   | Represents the rating given by a user to a movie.                                                     |
+
+## 2.Query Examples
+
+### 2.1.Example One
+
+Query all actors of the movie 'Forrest Gump' and return the subgraph composed of the movie and the actors.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.Example Two
+
+Query all actors of the movie 'Forrest Gump' and list the roles they played in the movie.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.Example Three
+
+Query all movies rated below 3 by Michael.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.Example Four
+
+Query users who have the same dislike of movies as Michael, where the standard for dislike is a rating of less than three.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.Example Five
+
+Recommend movies to Michael by first finding users who dislike the same movies as Michael, and then filtering out the movies that these users like.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.Example Six
+
+Query the movies that Michael's friends like.
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.Example Seven
+
+By querying the movies that people who gave 'Forrest Gump' a high rating also like, recommend similar movies to users who like 'Forrest Gump'.
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..e07192fa2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,48 @@
+# DEMO:Wandering Earth
+
+> This document mainly introduces the usage of the Wandering Earth demo.
+
+## 1.Demo Scene Design
+
+The demo is based on the story background of The Wandering Earth 1 and The Wandering Earth 2.
+
+- Based on the plot, a graph structure is designed, including three types of points: organization, character, celestial body, and facility, and two types of edges: event and relationship.
+- Prepared data corresponding to the schema based on the plot.
+- Prepared some queries to ask questions about the plot.
+
+## 2.Directory structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to queries.
+- control.sh: Script to control the start and stop of TuGraph Server.
+lgraph_standalone.json: Configuration file for starting TuGraph Server.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 4.Data Import
+
+- Modify DATA_PATH in import.json according to the data storage directory.
+- Refer to the load function in control.sh to load data.
+- Refer to the start function in control.sh to start TuGraph Server.
+- After starting TuGraph Server, access ${HOST_IP}:8888 to open the web page and confirm whether the data is successfully imported.
+
+## 5.Cypher Query
+
+Refer to the Cypher document and enter Cypher in the TuGraph web page frontend for queries.
+
+## 6.Usage Display
+
+### 6.1.Data Import Display
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.Query Display
+Query all event processes related to the crisis on Jupiter.
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+Query all event processes related to all crises.
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..64ea337fa8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# The Three Body
+
+> This document mainly introduces the usage of Three-Body demo.
+
+## 1.Demo Scenario Design
+The demo scenario is designed based on the story background of Three-Body 1, 2, and 3.
+
+According to the setting of the Three-Body story, we have designed 4 types of nodes and 6 types of edges. The nodes include "character", "organization", "plan", and "timeline", while the edges include "character-character relationship", "character-plan relationship", "character-organization relationship", "organization-plan relationship", and "organization-organization relationship". According to the plot, corresponding schema data and some queries have been prepared to propose some questions about the plot.
+
+## 2.Directory Structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to the query.
+- control.sh: Script to start and stop TuGraph Server.
+- lgraph_standalone.json: Configuration file for TuGraph Server startup.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+### 4.Data Import
+
+- Manual import
+    - Modify DATA_PATH in import.json according to the data storage directory.
+    - Refer to the load function in control.sh to load the data.
+    - Refer to the start function in control.sh to start the TuGraph service.
+    - After starting the TuGraph service, access ${HOST_IP}:8888 to open the web page and confirm whether the data is imported successfully.
+- Automatic creation
+    - Click `New Graph Project`, select Three-Body data, fill in the graph project configuration, and the system will automatically create the Three-Body scenario graph project.
+    - Alternatively, use the pre-installed Three-Body graph project provided by the product.
+
+### 5.Cypher Query
+
+Refer to the TuGraph documentation and enter Cypher in the TuGraph web page frontend to execute a query.
+
+## 6.Usage Demo
+
+### 6.1.Data Import Demo
+
+![data](../../../../images/three-body-data.png)
+
+### 7.Query Demo
+
+#### 7.1.Character Relationship Query
+In the plot of Three-Body 1, a large number of scientists committed suicide all over the world at the beginning, which aroused the attention of the police. During the investigation process, the truth behind it gradually surfaced step by step according to the clues of the character relationships, as shown in the above graph. Shi Qiang and Wang Miao discovered that most people had direct or indirect connections with Ye Wenjie, and sent Wang Miao undercover to finally discover Ye Wenjie's ultimate commander identity. As can be seen in the graph, there are many edge relationships (many one-degree or two-degree neighbors) around Ye Wenjie's vertex.
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.Neighbor Vertex Analysis
+There are many plans in Three-Body, and sometimes we may be confused. At this time, we can use the graph's neighbor vertex query to view the relevant characters and organizations of the plan. For example, in the "Wallfacer Project", we can see that there are four characters related to it, and these four are also the "Wallfacers" who are highly expected by the world.
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.Query Common Neighbors of Node A and B
+We often want to know who are the common related characters between two characters, so that we can quickly grasp the relationship between these two characters. In the case of large amounts of data, it is very convenient to use Cypher for graph relationship analysis!
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.Set/Change Properties
+As the plot progresses, we gradually learn about the various labels on "Ye Wenjie", so we can also update these labels to the "Ye Wenjie" node:
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.Add/Delete Nodes
+Later, we learned about characters such as Luo Ji and Cheng Xin, and organizations such as PIA and the Star Ring Group, and wanted to add them as nodes to the graph:
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..0bb359cbe0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# Three Kingdoms
+
+> This document mainly introduces the usage of the Three Kingdoms demo.
+
+## 1. Introduction
+Due to the lack of historical records, there are often many mysteries surrounding even well-known historical events. Taking the history of the Three Kingdoms as an example, why did Zhuge Liang come out of seclusion to help Liu Bei, and why there was a huge gap in achievements between Cao Cao and Liu Bei, both heroes of the time, are some of the unsolved mysteries. Historians in the past often used two-dimensional relationship analysis of history, and the conclusions drawn were often one-sided. Using TuGraph to import historical figures and events of the Three Kingdoms into a graph model, and analyzing them using graph calculation methods can help us obtain more valuable knowledge from limited information, which is a very meaningful interdisciplinary attempt.
+## 2. Data Modeling
+We designed 5 types of vertices and 5 types of edges. The vertices include "Lord", "Province", "Civilian", "Military Officer", and "Battle"; the edges include "Father", "Brother", "Belongs To", "Native Place", and "Participate In". The specific modeling information is shown below:
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. Data Import
+- Manual import
+    - To import data into TuGraph, you can use the lgraph_import tool to import it offline. The import command of lgraph_import is as follows:
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- Automatic creation
+    - Click `New Graph Project`, select the Three Kingdoms data, fill in the graph project configuration, and the system will automatically create the Three Kingdoms scene graph project.
+    - Or use the built-in Three Kingdoms graph project provided by the product directly.
+## 4. Cypher Query
+### 4.1. Why did Zhuge Liang Choose Liu Bei?
+The following Cypher command can be used to view the relationship between Zhuge Liang, Cao Cao, and Liu Bei:
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+From the graph, we can intuitively see that one of the shortest paths between Cao Cao and Zhuge Liang includes the battle of Xuzhou. Cao Cao once committed a massacre in Xuzhou because his father was killed, and nobody would choose a warlord who had previously massacred their hometown as their lord. In contrast, Liu Bei once prevented Cao Cao's violence during the battle of Xuzhou, which should be one of the reasons why Zhuge Liang had a good impression of Liu Bei.
+
+### 4.2. Why Did Cao Cao Achieve More Than Liu Bei?
+The following Cypher command can be used to view the family's support for Cao Cao's career:
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+The most important thing for pacifying the world is military talent. Cao Cao's father originally had the surname Xiahou, but was adopted into the Cao family. The Cao and Xiahou families were both local big clans in Qiao County, providing Cao Cao with a large number of military talents such as Xiahou Dun, Xiahou Yuan, Cao Ren, and Cao Hong in the early days of his career. In contrast, Liu Bei's father died early and he didn't have any family support. He only gathered his Five Tiger Generals when he was over 50 years old, by which time the best time to fight for land in the chaotic world had passed. Cao Cao had already controlled six of the nine provinces in the world.
+
+### 4.3. Why Did the Most Powerful Wei Kingdom in the Three Kingdoms Perish First?
+The following Cypher command can be used to view the important civilian officials of the Cao Cao group:
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+In fact, Cao Wei was overthrown in the Gao Ping Ling incident in 249 AD, after only 29 years of existence, which was shorter than Shu Han (43 years) and Dong Wu (51 years). The reason why the most powerful Wei Kingdom in the Three Kingdoms perished first was that the civilian official system of Cao Wei (the nine-rank system) made it easy for power to be concentrated in the hands of aristocratic families. From the graph, we can see that almost all the important civilian officials of Cao Cao and Cao Pi's generations were from aristocratic families, such as Xun Clan of Yingchuan, Zhong Clan of Yingchuan, Chen Clan of Yingchuan, Jia Clan of Wuxi, etc. There was even a trend of regionalization, centered on Yingchuan. Ultimately, the regime was usurped by the Sima family of Henei, which had close ties with the Xun Clan of Yingchuan.
+
+### 4.4. What Were the Strengths of Each of the Three Kingdoms?
+The following Cypher command can be used to view the population strength of each group in the Three Kingdoms:
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+The query result is shown in the following table:
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+In ancient society, an important indicator of a country's strength was its population. Since population data is missing, we estimate the population of each province using the birthplace data of all lords, civilians, and military officers in the Three Kingdoms. It is found that among the main characters of the Three Kingdoms, 60 belong to Wei, 23 belong to Wu, and only 2 belong to Shu, which proves that Wei was indeed the most powerful country in the Three Kingdoms.
+
+### 4.5. How Should Cao Cao's Military Ability Be Evaluated?
+The following Cypher command can be used to view the main battles that Cao Cao participated in:
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+From the graph, we can see that Cao Cao participated in 8 out of the 15 major battles in the Three Kingdoms, with a high participation rate. However, Cao Cao only won the battles of Xuzhou, Yanzhou, Guandu, and Xiangyang, while losing the battles of Hanzhong, Wancheng, the Campaign against Dong Zhuo and the Battle of Red Cliffs. His overall win rate was 50%, which proves that Cao Cao was not a very outstanding military strategist.
+
+## 5. Remarks
+More analysis is needed and encouraged to be added by everyone!
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..106f943e05
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo example
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..b2ed78a618
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+TuGraph DB Quick Start
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..d17ba97366
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,526 @@
+# TuGraph Browser
+
+> This document focuses on the use of TuGraph Browser.
+
+## 1.Introduction
+
+TuGraph Browser (hereinafter referred to as Browser) is a powerful product visualization development tool that presents graph data in an intuitive visual way, allowing users to easily manage, maintain, and view the database running status. This tool not only supports graph data management and visualization but also supports system account management, providing users with a comprehensive operation and management experience, enabling users to manage and utilize graph databases more efficiently.
+
+## 2.User Guide
+
+### 2.1.Accessing
+
+After the user completes the installation of the graph database, they can access the Browser through a browser. Users only need to enter the IP:Port of the server where TuGraph is located in the browser address bar. The default port used is 8888.
+
+- For example:127.0.0.1:8888
+- Recommend using Chrome
+
+### 2.2.Logging in
+
+![login](../../../images/browser/login.png)
+
+- After successfully accessing the Browser, the login page appears first (as shown above), where users need to fill in their account and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change their initial password promptly after logging in.
+
+### 2.3.Quick Start
+
+For first-time users of TuGraph, you can quickly build a graph project with the built-in demo data and get started with graph data projects quickly.
+
+#### 2.3.1.Creating a Graph Project
+
+In the `Graph Project` homepage tab, click `Create New Graph Project` to create a new graph project.
+
+![quickstart-creategraph](../../../images/browser/quickstart-creategraph.png)
+
+Select a built-in demo data, and click the `Next` button.
+
+![quickstart-selectdemo](../../../images/browser/quickstart-selectdemo.png)
+
+In the Fill in Configurations interface, enter the graph project information. Since the demo data is relatively small in size, set the Maximum Storage Space to 1 GB. After entering the graph project information, click the Create button, and the system will automatically create the graph model of the demo data and import the graph data.
+
+![quickstart-configure](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.Starting a Graph Project
+
+After creating a graph project with demo data, you can find the corresponding graph project in the `Graph Project` tab, and then click `Graph Query` to query graph data.
+
+![quickstart-graphtab](../../../images/browser/quickstart-graphtab.png)
+
+Execute the default query statement to browse the graph data in the demo.
+
+![quickstart-result](../../../images/browser/quickstart-result.png)
+
+For more quick start documents, please visit the[Quick Start Documents](../3.quick-start/1.preparation.md)
+
+### 2.4.Graph Project
+
+`Graph Project` provides visualized graph project management and graph data development functions, providing users with a series of convenient graph data visualization operations, including graph project creation, modification, deletion, and other management operations, as well as graph data queries, vertex-edge statistics, and other operations. In addition, it also supports graph model management, making it more convenient for users to manage and maintain graph data.
+
+#### 2.4.1.Graph Project Management
+
+On the `Graph Project` page, you can see the graph projects in the current graph database.
+
+![graphmanagement-homepage](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.Creating a Graph Project
+
+On the `Graph Project` page, click the `Create New Graph Project` button to create a new graph project.
+
+![graphmanagement-creategraph](../../../images/browser/graphmanagement-creategraph.png)
+
+Creating a new graph project requires completing the creation of the graph project through two pages: `Select Template` and `Fill in Configurations`.
+
+- __Select Template__: The product provides two types of templates: empty templates and demo templates.
+    - Empty templates: A brand new graph project where users need to create their own graph model and import graph data, generally used for formal project development.
+    - Demo templates: Built-in demo data in the product. After the graph project is created successfully, the system will automatically create a demo graph model and import demo graph data, usually used for trial and learning.
+
+![graphmanagement-selecttemplate](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __Fill in Configurations__: Users need to fill in basic information about the graph project and click the `Create` button to create the graph project.
+    - Graph Name: The name of the new graph project, which is also the unique primary key of the graph project. Supports Chinese characters, letters, numbers, and underscores, but does not support spaces or other special characters.
+    - Graph Description: The description of the new graph project can be used to describe the background and objectives of the project in detail.
+    - Advanced Configuration - Maximum Storage Space: Set the maximum storage space that the graph project can occupy. It does not actually occupy physical storage space in advance. After the actual data volume reaches the maximum storage space threshold, no more data can be written.
+
+![graphmanagement-configure](../../../images/browser/graphmanagement-configure.png)
+
+After creation, the graph project can be viewed in the graph project tab on the `Graph Project` page.
+
+##### 2.4.1.2.Editing a Graph Project
+
+On the `Graph Project` page, click the `Edit button` (pencil icon) in the graph project tab to edit the basic information of the corresponding graph project.
+
+![graphmanagement-editgraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+graphmanagement-editgraph-button
+
+![graphmanagement-editgraph](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.Deleting a Graph Project
+
+On the `Graph Project` page, click the `Delete` button (trash can icon) in the graph project tab to delete the corresponding graph project.
+
+![graphmanagement-deletegraph-button](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_Note: Graph projects cannot be restored after deletion._
+
+##### 2.4.1.4.Vertex-Edge Statistics
+
+On the `Graph Project` page, click the `Vertex-Edge Statistics` button (line graph icon or refresh icon) in the graph project tab to count the number of vertexs and edges in the corresponding graph project.
+
+![graphmanagement-statistics-button](../../../images/browser/graphmanagement-statistics-button.png)
+
+The statistical results will be displayed on the graph project tab. Graph projects that have not been vertex-edge statistics will display `No vertex-edge data`, and graph projects that have already been vertex-edge statistics need to click the `Refresh` button to count again.
+
+![graphmanagement-statistics](../../../images/browser/graphmanagement-statistics.png)
+
+![graphmanagement-statistics-refresh-button](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.Graph Building
+
+The `Graph Building` function in Browser is mainly used for graph project model definition and data import. On the `Graph Project` page, click the `Graph Building` button in the graph project tab.
+
+![graphbuild-button](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.Model Definition
+
+Browser provides a visualization way to create and maintain graph models.
+
+- Graph models can also be created and maintained through the `Cypher` tool and the `lgraph_import` tool. For details, please refer to the [Cypher API Document](../5.developer-manual/6.interface/1.cypher.md) and [Data Import Document](../5.developer-manual/3.server-tools/1.data-import.md).
+
+###### a.Browse Graph Models
+
+On the `Model Definition` page, you can view detailed graph model settings, support list and canvas view of the graph model, support list display of vertex type properties and indexes, edge type properties and start/end vertex types.
+
+![graphbuild](../../../images/browser/graphbuild.png)
+
+- Supports list view of vertex types and edge types.
+    - Supports the display of the number of vertexs or edges in the corresponding vertex type or edge type in the vertex type or edge type tab.
+    - Supports keyword search for vertex type or edge type names. Enter the keyword in the `search box` to display the corresponding vertexs or edges.
+
+        ![graphbuild-list-search](../../../images/browser/graphbuild-list-search.png)
+    - Supports copying vertex type or edge type names. Click the `Copy` button to copy the name of the vertex or edge to the clipboard.
+
+        ![graphbuild-list-copy](../../../images/browser/graphbuild-list-copy.png)
+    - Supports deleting vertex types or edge types. Click the `Delete` button to delete the corresponding vertex or edge.
+
+        ![graphbuild-list-delete](../../../images/browser/graphbuild-list-delete.png)
+- Supports canvas view of vertex types and edge types.
+- Clicking the corresponding vertex type or edge type in the list or canvas can display the model details.
+        ![graphbuild-select](../../../images/browser/graphbuild-select.png)
+
+###### b.Add Vertex
+
+Click the `Add Vertex` button on the `Model Definition` page to add a vertex type in the right sliding window.
+
+![graphbuild-addvertex-button](../../../images/browser/graphbuild-addvertex-button.png)
+
+The user needs to enter the Vertex type name, properties, and indexes, and click the `Complete` button to complete the creation of the Vertex type.
+- Vertex Type Name: The name of the Vertex, which is also the unique identifier of the Vertex.
+- Properties: The attributes of the Vertex, and one attribute needs to be used as the primary key.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating Vertexs.
+- Indexes: The indexing attributes of the Vertex, you need to create attributes first and then set the attribute as an index.
+    - Attribute: The attribute that needs to be indexed.
+    - Unique:Set the attribute field as a unique value.
+    - Primary Key: Whether the corresponding attribute is a primary key. The Unique option must be `Yes` after selecting `Yes`.
+    - Delete: Indexes can be deleted arbitrarily during Vertex creation.
+
+![graphbuild-addvertex](../../../images/browser/graphbuild-addvertex.png)
+
+- Edit Vertex: You can add Vertex properties, modify the data type of existing properties, and add or delete indexes. You need to click the `Save` button for each newly added or modified attribute to take effect.
+_Note: Once the primary key field attribute is created, it cannot be modified._
+
+![graphbuild-editvertex](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.Add Edges
+
+Click the `Add Edge` button on the `Model Definition` page to add an edge type in the right sliding window.
+
+![graphbuild-addedge-button](../../../images/browser/graphbuild-addedge-button.png)
+
+The user needs to enter the edge type name, properties, select the start vertex type and end vertex type, and click the `Complete` button to complete the creation of the edge type.
+- Edge Type Name: The name of the edge, which is also the unique identifier of the edge.
+- Properties: The attributes of the edge, which may not exist on the edge.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating edges.
+- Selecting start vertex type and end vertex type: Set the start vertex type and end vertex type of the edge, and support multiple start vertex types and end vertex types.
+    - Start vertex: Select the vertex type of the start vertex.
+    - End vertex: Select the vertex type of the end vertex.
+    - At least one vertex type needs to be created in advance to set the start vertex type and end vertex of the edge.
+    - If not selected, it means that the start vertex and end vertex can be any vertex type, and the corresponding edge is not displayed on the canvas, and you need to view the edge type in the left list.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+- Edit Edge: You can add edge properties and modify the data type of existing properties. You need to click the `Save` button for each newly added or modified attribute to take effect.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+###### d.Import Model
+
+Click the `Import Model` button on the `Model Definition` page to upload a model file and quickly create a model.
+
+![graphbuild-importmodel-button](../../../images/browser/graphbuild-importmodel-button.png)
+
+Click the `Upload File` button on the `Import Model` page to upload the model file. After the upload is successful, click `OK` to import the graph model.
+
+- Overwrite the current canvas model: If this option is selected, the existing graph model will be cleared before importing the graph model in the model file; if not selected, the vertex types and edge types in the model file will be imported, but the existing vertex types and edge types will not be modified.
+
+![graphbuild-importmodel](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.Export Model
+
+Click the `Export Model` button on the `Model Definition` page to export the graph model in the current graph project to a JSON file.
+
+![graphbuild-exportmodel-button](../../../images/browser/graphbuild-exportmodel-button.png)
+
+The model file is in JSON format and is not recommended to be manually modified.
+
+![graphbuild-exportmodel](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.Data Import
+
+After completing the `Model Definition`, click the `Next` button to enter the data import page.
+
+###### a.Data Preparation
+
+Data needs to be prepared in advance before importing data. The current browser supports the uploading of CSV files, and the data file suffix needs to be ensured to be CSV.
+- The header is not mandatory.
+- Text qualifiers are supported, and the text qualifier is double quotes. Data Import - CSV
+
+![graphbuild-import-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.Upload Files
+
+Upload the required data files on the `Data Import` page and import the data into the graph project.
+
+![graphbuild-import](../../../images/browser/graphbuild-import.png)
+
+- Separator: The column separator of the data file.
+- File upload: Supports uploading multiple files.
+    - Supports selecting multiple upload files in the pop-up window.
+    - Supports dragging and dropping files to upload on the page.
+    - Supports uploading vertex files and edge files at the same time.
+
+###### c.Data Mapping
+
+After the file is successfully uploaded, you need to set the `Data Corresponding Table` on the `Data Import` page to establish a mapping relationship between the data columns in the data file and the target vertexs/edges and corresponding attributes.
+
+- Data Corresponding Table: Displays uploaded data problems.
+    - File Name: The name of the uploaded data file.
+    - File Size: The size of the uploaded data file.
+    - Read Result: The result of uploading the data file, success means uploaded successfully.
+    - Delete: Delete on the page, the local file will not be deleted.
+- Data File Mapping: Each uploaded data file needs to configure a mapping relationship.
+    - Label: Select the corresponding vertex or edge type for the file, and you can only select one type of vertex or one type of edge.
+    - Starting from the Nth row: Start reading data from the Nth row. The system defaults to start reading data from the 0th row. To skip the header, you can enter 1.
+    - Attribute Mapping: Select the attribute field corresponding to the data column from the drop-down list.
+    - Data Preview: The system will pre-read the first 5 rows of the data file.
+
+![graphbuild-import-datamapping](../../../images/browser/graphbuild-import-datamapping.png)
+
+After the file is successfully uploaded, you can click the `Continue Import` button to continue importing other data or click the `Go to Graph Query` button to query the imported data on the `Graph Query` page.
+
+![graphbuild-import-success](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.Graph Query
+
+Click the `Graph Query` button in the `graph project tab` on the `Graph Project` page to query and access graph data in the graph project. The product provides multiple modes for querying graph data, such as Statement Query, Path Query, and Vertex Query, and supports switching between graph projects and query result display.
+
+![query-button](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.Switch Graph Project
+
+The `Graph Query` function can only access one graph project data. Users can select and switch to other graph data in the `Switch Graph Project drop-down list`.
+
+![query-selectgraph](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.Statement Query
+
+The Browser provides a visual way to develop and debug graph query statements. Users can enter graph query statements, execute and return results, and support collecting statements and viewing graph models.
+
+![query-view](../../../images/browser/query-view.png)
+
+###### a.Statement Query Window
+
+Users enter graph query statements in the `Statement Query Window`, click the `Execute` button to run the corresponding statement, and display the result in the `Execution Result tab`.
+
+- Switch Query Language: Provides switching between different graph query language modes.
+    - _Currently only supports Cypher syntax._
+
+![query-selectgql](../../../images/browser/query-selectgql.png)
+
+- Statement Query Window: Provides syntax prompts for the current query language.
+
+![query-gqltips](../../../images/browser/query-gqltips.png)
+
+- Execute: Click the `Execute` button to send the entered query statement to the background for execution.
+
+![query-execute-button](../../../images/browser/query-execute-button.png)
+
+- Bookmark: Click the `Bookmark` button to save the content of the current statement query window as a template for future use.
+
+![query-bookmark-button](../../../images/browser/query-bookmark-button.png)
+
+- Download: Click the `Download` button to save the content of the current statement query window as a text file and download it to the local computer for future use.
+
+![query-download-button](../../../images/browser/query-download-button.png)
+
+For detailed Cypher usage guidelines, please refer to the document: [Cypher API](../5.developer-manual/6.interface/1.cypher.md)
+
+###### b.Bookmark List
+
+Displays the collected query statements in a list, and clicking on a bookmark in the list allows using the statement. Supports keyword search, name modification, and deletion.
+
+![query-bookmark](../../../images/browser/query-bookmark.png)
+
+###### c.View Graph Model
+
+The Browser provides a graph model query for the current graph project, which allows users to query vertex types and edge types conveniently. It supports both list display and canvas graph display, and can be hidden.
+
+![query-schema-list](../../../images/browser/query-schema-list.png)
+![query-schema-graph](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.Path Query
+
+The Browser provides `Path Query templates`. Users can search whether corresponding paths exist in the graph data of the graph project by selecting paths.
+
+![pathquery-result](../../../images/browser/pathquery-result.png)
+
+- Path: Select the path to search in the path selection drop-down list.
+    - Select a Path: Based on the definition of the graph model, the system will automatically match the corresponding first-degree relationship path. Clicking the path drop-down box again will automatically match the next-degree relationship path based on the endvertex vertex type of the path.
+![pathquery-select](../../../images/browser/pathquery-select.png)
+    - Execute: Click the `Execute` button to return the matched paths in the graph project.
+    - Advanced Configuration: Set the number of paths to scan. The default is 100 paths.
+![pathquery-configuration](../../../images/browser/pathquery-configuration.png)
+
+_Note: The edges in the graph model need to set the starting vertex and endvertex. If no edge in the graph project has set the starting vertex and endvertex, the drop-down list will have no results._
+
+##### 2.4.3.4.Vertex Query
+
+The Browser provides `Vertex Query templates`. Users can query vertex data in the graph project by selecting vertex attributes.
+
+![vertexquery](../../../images/browser/vertexquery.png)
+
+- Select Vertex: Select the vertex type to be queried.
+    - Attribute: The system will automatically match the schema of the vertex type, set the corresponding query conditions, and click the execute button to return the results.
+- Return vertex Limit: Set the upper limit of the returned vertex data.
+
+![vertexquery-criteria](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.Execution Result Tab
+
+The Browser provides multiple ways to display graph query results, such as JSON view, JSON text, vertex-edge list, and vertex-edge view. It supports result download, data insertion, and full-screen display.
+
+###### a.JSON View
+
+The Browser provides JSON view to display query results.
+
+![query-result-jsonview](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON Text
+
+![query-result-jsontxt](../../../images/browser/query-result-jsontxt.png)
+
+###### c.Vertex-Edge List
+
+The Browser provides vertex and edge list to display query results.
+
+![query-result-list](../../../images/browser/query-result-list.png)
+
+###### d.Vertex-Edge View
+
+The Browser provides canvas view to display query results.
+
+![query-result-graph](../../../images/browser/query-result-graph.png)
+
+###### e.Data Insertion
+
+The Browser provides a visual way to insert vertex or edge data in the corresponding graph project. Click the `Insert Data` button, select the Vertex Type or Edge Type on the Insert Data tab, enter the attribute values, and click `OK` to complete the data insertion.
+
+![query-result-insert-button](../../../images/browser/query-result-insert-button.png)
+
+![query-result-insert](../../../images/browser/query-result-insert.png)
+
+###### f.Download Execution Result
+
+The Browser provides a function to export graph query results as text files. Click the `Download Execution Result` button, and the system will automatically save the result as a text file and download it to the local computer.
+
+![query-result-download](../../../images/browser/query-result-download.png)
+![query-result-downloadtxt](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.Full-Screen Display
+
+The Browser provides full-screen display for graph query results. Click the `Full-Screen` Display button to display the results in full screen, and click the `Exit Full Screen` button to exit full-screen display.
+
+![query-result-fullscreen-button](../../../images/browser/query-result-fullscreen-button.png)
+![query-result-fullscreen](../../../images/browser/query-result-fullscreen.png)
+![query-result-fullscreen-close](../../../images/browser/query-result-fullscreen-close.png)
+
+### 2.5.Console
+
+The `Console` provides a visualized account management and database information viewing function. It provides users with comprehensive account and role management functions, including adding, deleting, modifying, and disabling accounts and roles. In addition, it also provides users with convenient database information viewing function, allowing users to easily view the basic information and configuration information of the graph database. Basic information mainly includes version number, running time, CPP compilation version number, etc., while database configuration information includes port number, system function parameter configuration, etc.
+
+#### 2.5.1.Account Management
+
+##### 2.5.1.1.Account Management
+
+##### 2.5.1.1.1.Add Account
+
+Click the `Add` button in the `Account Management` interface to create a new account. Users need to enter the account name, account description, account password, and related roles.
+
+- Account Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Related Roles: When creating a new account, you must select a role. After the account is added successfully, the system will automatically generate a role with the same name as the account name.
+
+![account-add-button](../../../images/browser/account-add-button.png)
+![account-add](../../../images/browser/account-add.png)
+
+##### 2.5.1.1.2.Edit Account
+
+Click the `Edit` button in the `Account Management` interface to edit the account description, account password, and related roles.
+
+![account-edit](../../../images/browser/account-edit.png)
+
+##### 2.5.1.1.3.Disable Account
+
+Click the `Disable` button in the `Account Management` interface to prevent the corresponding account from logging in and accessing. Click the `Enable` button to enable the corresponding account login and access permissions.
+
+![account-disable](../../../images/browser/account-disable.png)
+![account-enable](../../../images/browser/account-enable.png)
+
+##### 2.5.1.1.4.Delete Account
+
+Click the `Delete` button in the `Account Management` interface to delete the corresponding account.
+
+![account-delete](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.Role Management
+
+##### 2.5.1.1.1.Add Role
+
+Click the `Add` button in the `Role Management` interface to create a new role. Users need to enter the role name, role description, and graph permissions.
+
+![role-add-button](../../../images/browser/role-add-button.png)
+
+- Role Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Graph Permissions: The browser supports four types of graph permission configurations: All, Read/Write, Read-Only, and None.
+    - All: corresponds to the read and write permissions of the graph, including editing the graph model permissions (schema).
+    - Read/Write: corresponds to the write permission of the graph, but does not include the permission to edit the graph model (schema).
+    - Read-Only: corresponds to the read permission of the graph.
+    - None: cannot access or operate the corresponding graph.
+- Role Conflict: When two roles have different graph permissions for the same graph, and both roles are authorized to the same account, the graph permission of the account for the graph is the union of the graph permissions of the two roles.
+
+![role-add](../../../images/browser/role-add.png)
+
+##### 2.5.1.1.2.Edit Role
+
+Click the `Edit` button in the `Role Management` interface to edit an existing role. Users can edit the role description and graph permissions.
+
+![role-edit](../../../images/browser/role-edit.png)
+
+##### 2.5.1.1.3.Disable Role
+
+Click the `Disable` button in the `Role Management` interface to disable the corresponding role. Click the `Enable` button to enable the corresponding role. After the role is disabled, the corresponding graph permissions of the role become invalid.
+
+- Disabled Role: After the role is disabled, the corresponding graph permissions become invalid.
+    - When a user has two roles with operating permissions on the same graph, if one of the roles is disabled, the permission of the other role is still valid.
+
+![role-disable](../../../images/browser/role-disable.png)
+![role-enable](../../../images/browser/role-enable.png)
+
+##### 2.5.1.1.4.Delete Role
+
+Click the `Delete` button in the `Role Management` interface to delete the corresponding role.
+
+![role-delete](../../../images/browser/role-delete.png)
+
+#### 2.5.2.Database Information
+
+##### 2.5.2.1.Basic Information
+
+`Basic Information` obtains the current running status of the system and displays key information.
+
+![db_basic](../../../images/browser/db_basic.png)
+
+|Parameter    |Meaning    |
+|-------|--------|
+|TuGraph Version Number|The current version number of TuGraph, x.x.x|
+|Running Time|The time from when TuGraph service starts to now|
+|Server Code Version|The current commit of the tugraph-db repository|
+|Front-end Code Version|The current commit of the tugraph-web repository|
+|CPP Compiler Version|The CPP version number when compiling TuGraph|
+|Python Version Number|The Python version number when compiling TuGraph|
+|CPP Compiler ID|The CPP type when compiling TuGraph|
+
+The current running status of the system can also be obtained through commands.
+
+```cypher
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.Database Configuration Information
+
+`Database Configuration Information` obtains the current configuration parameters of the system and displays key information. To adjust the configuration parameters or understand the detailed configuration parameters, please refer to [Database Running-Service Configuration](../5.developer-manual/2.running/2.tugraph-running.md).
+
+![db_configuration](../../../images/browser/db_configuration.png)
+
+| Parameter                   | Meaning                                                                                                                                         |
+|-----------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------|
+| bind_host                   | The host set when the system starts, usually 0.0.0.0                                                                                            |
+| disable_auth                | Whether to disable the regular update of token authentication. If set to true, the token can be used permanently                                |
+| durable                     | Whether to enable persistent storage of the underlying layer. If set to false, the data is updated asynchronously to the disk                   |
+| enable_audit_log            | Whether to enable audit log                                                                                                                     |
+| enable_backup_log           | Whether to enable real-time incremental backup                                                                                                  |
+| enable_fulltext_index       | Whether to enable full-text indexing                                                                                                            |
+| enable_ip_check             | Whether to enable IP whitelist                                                                                                                  |
+| enable_rpc                  | Whether to enable the RPC port                                                                                                                  |
+| enable_ssl                  | Whether to enable SSL encrypted transmission                                                                                                    |
+| optimistic_txn              | Whether to enable optimistic multi-threaded write transactions                                                                                  |
+| port                        | The REST access port of the current system                                                                                                      |
+| rpc_port                    | The port used by the RPC and HA services                                                                                                        |
+| subprocess_max_idle_seconds | The maximum idle time of the subprocess, a thread pool parameter                                                                                |
+| thread_limit                | The maximum number of threads used by the server at the same time                                                                               |
+| verbose                     | The level of detail of the log output information. It can be set to 0, 1, or 2, with larger values indicating more detailed output information. |
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..b7e5e9f2fa
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,167 @@
+# TuGraph Browser(old version)
+
+> This document focuses on the use of TuGraph Browser
+
+## Definition
+
+TuGraph Browser is a visual development tool provided by TuGraph.
+
+## Functionality
+
+TuGraph Browser provides graph database developers with functions such as visual graph data development, graph data management and maintenance.
+
+## How to use it
+
+### 1. Connect to the database
+
+When the user completes the installation of the graph database, you can access it through the Browser, TuGraph Browser tool. The user only needs to type in the browser address bar: IP of the server where TuGraph is located :Port. The default port is 7090.
+
+### 2. Login
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- When the page is opened successfully, the first thing you see is the login page, and the user needs to fill in the account number and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change the initialized password in time after logging in
+
+### 3. Workbench
+
+#### 3.1 Quick Start
+
+- When you log in for the first time, the system will create an empty graph by default
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- The user clicks on the help option and selects Get Started quickly
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- Then click "One-click Create Model" -- >" One-click Create Data "to complete the construction of the built-in Movie data graph
+
+#### 3.2 Create subgraphs and examples
+
+##### 3.2.1 Create a subgraph
+
+- Click on New subgraph
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- Fill in the form information
+  ![alt Fill out the form](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+- Subgraph name
+- Subgraph description
+- Configuration information
+- Click OK to prompt that creation succeeded
+- Toggle the subgraph
+  ![alt Toggle subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- Click New Example
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- Select the example and click Create
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 query
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 User Interface Layout
+
+- Cypher input box
+- Result set display area
+
+##### 3.3.2 Result set display area function details
+
+- Result set tag display and functions
+  ![alt Result set tag](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+- All types of statistics for the result set are shown here
+- Click on the different "label" to make the following changes
+  -Change the display color
+- Modify the node size or edge thickness
+- Modify default display properties or system properties
+- Layout modification
+- Force guide layout
+- Grid layout
+- Tree layout
+- Environment layout
+- edge polymerization
+- Edges of the same type and direction can be merged
+- Create nodes
+- Click the Create Node button
+- Select the node type
+- Add node content
+- Create relationships
+- Select start and end points in the canvas
+- Select the type that can be matched
+- Enter node information
+- Stop layout
+- When too much data is causing the browser page to stall, you can click this stop layout button to improve the smoothness of the experience
+- Mouse hover
+- Enable this feature to highlight the one-degree neighbors of the mouse-over node
+- Result set export
+- Result sets can be exported as png, json, csv three different file forms
+- the refresh
+- Clicking the refresh button will re-execute the initial cypher statement for the current page and refresh the result set
+  Maximize -
+  -Click Maximize button, the result set display area will be displayed in full screen
+- Result set display mode switching
+  - Support graph, table and text modes
+
+##### 3.3.3 Schema
+
+- model
+  ![Modeling Alt](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- schema supports real-time addition, deletion, modification and query
+
+- schema supports import and export
+
+##### 3.3.4 Data import
+
+- Local data import
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+- Select the file encoding format
+- Select a local CSV file
+- Select the model for the corresponding node or edge
+- Do the data mapping
+  -Complete the data import
+
+##### 3.3.5 plug-in (Stored Procedure)
+
+- Use of plug-ins
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+- Users can upload the plug-in program written locally, execute it in the visual page, and view the execution result
+- Users can perform, uninstall, execute, and download plug-ins in the visualization page
+
+##### 3.3.6 Help
+
+- where it records how TuGraph-browser is used
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 Console
+
+##### 3.4.1 Basic database information
+
+- Displays basic database configuration information
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 Permission management
+
+- A function module used to create users and roles. Users can manage permissions here
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 Live status
+
+- This shows the database real-time status, including: CPU usage, memory usage, disk usage, number of data requests, disk IO
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 Task Management
+
+- Here the user can see the task in execution and stop the task
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 Audit logs
+
+- Database related audit logs recorded here, used to troubleshoot problems encountered in use
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6c4d063e26
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB User Guide
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/1.environment.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/1.environment.md
new file mode 100644
index 0000000000..f2cdffe578
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/1.environment.md
@@ -0,0 +1,41 @@
+# Environment
+
+> This document provides an overview of the required hardware and software environment for deploying TuGraph.
+
+## 1.Hardware Environment
+
+### 1.1. CPU
+TuGraph supports X86_64 and ARM64 architectures for both physical, virtual, and containerized environments. Tested and certified hardware platforms include Intel, AMD, Kunpeng, Hygon, Feiteng, and others.
+
+### 1.2. Memory
+We recommend having a memory capacity that is equal to or greater than the actual data size. For optimal performance, caching all data in memory is ideal. In terms of data locality, graph databases have poorer locality compared to relational databases. Therefore, if the data cannot fit in memory, frequent swapping may occur.
+
+### 1.3. Storage
+We strongly recommend using NVMe SSD as external storage. The database performs numerous synchronous write operations, often in a random manner, making the read/write performance of the external storage critical to the overall database performance. Hence, high IOPS and low-latency NVMe SSDs are the optimal choice.
+
+If circumstances permit only the use of SATA interface SSDs or cloud-based network disks, although performance may be affected, TuGraph can still run correctly.
+
+It is recommended to have external storage size at least four times the actual data size. For example, if the data size is 1TB, preparing a 4TB hard drive would be more reliable.
+
+
+
+## 2. Software environment
+
+### 2.1. Operating System
+
+TuGraph is compatible with popular operating systems, including Ubuntu, CentOS, SUSE, Galaxy Kylin, China Standard Software, UOS, and others, all of which have been tested and certified.
+
+Among them, the most stable system versions are Ubuntu 18.04, CentOS 7, and CentOS 8.
+
+### 2.2. System Libraries
+
+The requirements for system libraries differ between the compilation environment and the runtime environment. For specific details, please refer to the[environment mode](2.environment-mode.md)。
+
+## 3.Recommended Configuration
+
+| Hardware | Minimum Configuration	   | Recommended Configuration                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| Memory   | 4GB       | 512GB                    |
+| Storage  | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/2.environment-mode.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/2.environment-mode.md
new file mode 100644
index 0000000000..4699967ffb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/2.environment-mode.md
@@ -0,0 +1,25 @@
+# Environment Mode
+
+> This document primarily introduces the three types of environments involved in TuGraph.
+
+## 1.Classification
+
+Based on the different functionalities supported by the environments, they can be categorized into the following:
+
+* Compilation Environment: This environment includes all the dependencies required for compiling TuGraph. It contains all the dependencies of the runtime environment and is capable of compiling TuGraph source code. However, it does not include pre-compiled TuGraph executable files and library files. It is intended for developers to compile the source code.
+
+* Runtime Environment: This environment includes GCC/Java/Python environments, enabling the execution of all TuGraph functionalities. It can support full-text indexing, Java client, uploading C++ source code as a plugin, and running Python plugins. It comes with pre-compiled TuGraph executable files and library files, allowing customers to directly install and use TuGraph without the need for source code compilation.
+
+* Mini-Runtime Environment: This environment is equivalent to a bare system with pre-compiled TuGraph. It can only run the basic functionalities of TuGraph, without the ability to compile and run C++ plugins, lack of full-text indexing, and absence of Python plugins. It is designed for quick deployment and trial purposes.
+
+After compiling TuGraph, all the required dependencies are packaged together in the form of .a files, eliminating the need for unnecessary additional dependencies during runtime. However, since TuGraph supports stored procedures, which involve compiling C++ code on the server, the required compilers still need to be present in the environment.
+
+## 2.System Library
+
+For the three types of environments, the required system libraries, excluding the TuGraph runtime package, are as follows:
+
+* Compilation Environment: It includes GCC, Python, Java compilers, as well as libraries such as ANTLR4 and Pybind11. Please refer to the tugraph-compile-*-Dockerfile for more details.
+
+* Runtime Environment: The main dependencies introduced by stored procedures include GCC, Boost, CMake, and others. Please refer to the tugraph-runtime-*-Dockerfile for more details.
+
+* Mini-Runtime Environment: There are no additional system library dependencies. Please refer to the tugraph-mini-runtime-*-Dockerfile for more details.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md
new file mode 100644
index 0000000000..030654580a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md
@@ -0,0 +1,82 @@
+# Docker Deployment
+
+>This document introduces the creation and download of Docker images for TuGraph Compile and TuGraph Runtime.
+
+## 1.Introduction
+
+- TuGraph Compile Image: Provides a compilation environment and can be used for TuGraph compilation and testing.
+- TuGraph Runtime Image: Provides a binary executable environment with TuGraph library and executable files.
+- TuGraph Mini Runtime Image: Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+## 2.Existing Docker Images
+
+### 2.1.Image Download
+
+The images are hosted on [DockerHub]( https://hub.docker.com/u/tugraph ) and can be downloaded and used directly.
+
+### 2.2.Naming Convention
+
+#### 2.2.1.TuGraph Compile Image
+
+Provides a compilation environment and can be used for TuGraph compilation.
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+For example: `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+Provides a binary executable environment with TuGraph library and executable files.
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example:`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example: `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+## 2.3.Common Docker Operations
+
+Docker is generated from Dockerfile. Note that creating images requires downloading dependencies, so network issues may cause slow creation or creation failure. Do not overwrite images unless the tag is `latest`.
+
+build Compile image
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+build Runtime / Mini Runtime image
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+Modify image name
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+push image
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+pull image
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+save image
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+load image
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+Refer to the [docker official documentation](https://docs.docker.com/engine/reference/commandline/cli ) for other Docker operations.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md
new file mode 100644
index 0000000000..4e80855e38
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md
@@ -0,0 +1,31 @@
+# Local Package Deployment
+
+> This document describes TuGraph Local Package Deployment.
+
+## 1.Download Local Package
+
+Please visit the Github for download：[TuGraph Download](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 2.Ubuntu
+
+The.deb installation package for TuGraph installed on Ubuntu, which contains the TuGraph executable along with the header files and associated library files needed to write embedded programs and stored procedures.
+
+To install the tugraph_x.y.z.deb 'installation package on the terminal, run the following command:
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+This command installs TuGraph in the /usr/local directory by default. Users can also change the installation directory by specifying the `--instdir=<directory>` option.
+
+## 3.CentOS
+
+rpm installation package for TuGraph installed on CentOS, which contains TuGraph executables as well as headers and associated libraries for writing embedded programs and stored procedures.
+
+To install the tugraph_x.y.z.rpm package on the terminal, run the following command:
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+The user can also specify the installation directory by specifying the `--prefix` option.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md
new file mode 100644
index 0000000000..9551dc6e32
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md
@@ -0,0 +1,128 @@
+# Cloud Deployment
+
+> This document mainly introduces the cloud deployment of TuGraph, and you can also refer to the[Alibaba Cloud ComputeNest deployment document.](https://aliyun-computenest.github.io/quickstart-tugraph/)。
+
+## 1.Introduction
+
+TuGraph (tugraph.antgroup.com) is a high-performance graph database of Alibaba Group. TuGraph provides community version services on ComputeNest, so you can quickly deploy TuGraph services on ComputeNest and achieve operation and maintenance monitoring, thereby building your own graph application. This document introduces how to open TuGraph community version services on ComputeNest, as well as deployment process and usage instructions.
+
+## 2.Instance Description
+
+TuGraph is deployed as a community open source version, and the source code can be found in the Github Repo. Currently, the available instance specifications are as follows:
+
+| Instance Family | vCPU and Memory             | System Disk                | Public Bandwidth         |
+|-----------------|-----------------------------|----------------------------|--------------------------|
+| ecs.r7a.xlarge  | AMD Memory r7a, 4vCPU 32GiB | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+| ecs.r6.xlarge   | Memory r6, 4vCPU 32GiB      | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+
+Estimated costs can be seen in real time when creating instances (currently free). If you need more specifications or other services (such as cluster high availability requirements, enterprise-level support services, etc.), please contact us at tugraph@service.alipay.com.
+
+## 3.Deployment Process
+
+### 3.1.Preparation
+
+Before starting to use, you need an Alibaba Cloud account to access and create resources such as ECS and VPC.
+
+- If you use a personal account, you can directly create a service instance.
+- If you create a service instance using a RAM user and use Alibaba Cloud ComputeNest for the first time:
+    - Before creating a service instance, you need to add permissions for the corresponding resources to the account of the RAM user. For detailed operations on adding RAM permissions, please see Grant RAM user permissions. The required permissions are shown in the following table.
+    - Authorization to create associated roles is also required. Refer to the following figure and select Agree to authorize and create associated roles.
+
+| Permission Policy Name          | Remark                                                                       |
+|---------------------------------|------------------------------------------------------------------------------|
+| AliyunECSFullAccess             | Permissions for managing cloud server services (ECS)                         |
+| AliyunVPCFullAccess             | Permissions for managing Virtual Private Cloud (VPC)                         |
+| AliyunROSFullAccess             | Permissions for managing Resource Orchestration Service (ROS)                |
+| AliyunComputeNestUserFullAccess | Permissions for managing ComputeNest services (ComputeNest) on the user side |
+| AliyunCloudMonitorFullAccess    | Permissions for managing Alibaba Cloud Monitor (CloudMonitor)                |
+
+![Cloud Deployment](../../../../images/cloud-deployment-1.png)
+
+### 3.2.Deployment Entrance
+
+You can search in Alibaba Cloud ComputeNest, or quickly access it through the following deployment link.
+
+[Deployment Link](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.Apply for Trial Use
+
+Before formal trial use, you need to apply for trial use, fill in the information as prompted, and create the TuGraph service after passing the review.
+
+![Apply for Trial Use](../../../../images/cloud-deployment-2.png)
+
+### 3.4.Create TuGraph Service
+
+#### 3.4.1.Parameter List
+
+During the process of creating a service instance, you need to configure the parameter list of the service instance information. The specific parameters are as follows.
+
+| Parameter Group                              | Parameter Item  | Example                 | Description                                                                                                                            |
+|----------------------------------------------|-----------------|-------------------------|----------------------------------------------------------------------------------------------------------------------------------------|
+| Service Instance Name                        | N/A             | test                    | The name of the instance.                                                                                                              |
+| Region                                       | N/A             | China East 1 (Hangzhou) | Select the region of the service instance. It is recommended to select nearby regions to obtain better network latency.                |
+| Payment Type Configuration                   | Payment Type    | Pay-As-You-Go           | For free use, please select Pay-As-You-Go.                                                                                             |
+| Availability Zone Configuration              | Deployment Area | Availability ZoneI      | Different available zones under the region, ensure that the instance is not empty.                                                     |
+| Select Existing Basic Resource Configuration | VPC ID          | vpc-xxx                 | Select the ID of the Virtual Private Cloud according to the actual situation.                                                          |
+| Select Existing Basic Resource Configuration | Switch ID       | vsw-xxx                 | Select the Switch ID according to the actual situation. If the Switch ID cannot be found, try switching the region and available zone. |
+| ECS Instance Configuration                   | Instance Type   | ecs.r6.xlarge           | Currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications.                                                                    |
+|ECS Instance Configuration|	Instance Password|	**|	Set the instance password. Length of 8-30 characters, must include three items (uppercase letters, lowercase letters, numbers, special characters in ()`~!@#$%^&*_-+={}[]:;'<>,.?/).
+|
+
+#### 3.4.2.Specific Steps
+
+The creation of the service is carried out according to the following steps, refer to the figure below:
+
+- Create an instance name, such as "test" in the figure below
+- Select the region, such as "China East 1 (Hangzhou)" in the figure below
+
+![Create Instance](../../../../images/cloud-deployment-3.png)
+
+- Select the instance type, currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications. If there is no model available in the list, try selecting other deployment areas.
+- Select the model
+- Configure the password for the instance
+- Select the deployment area, such as "Availability Zone I" in the figure below
+
+![Select Region](../../../../images/cloud-deployment-4.png)
+
+- Click next to enter the order confirmation page
+- Check the checkboxes for "Permission Confirmation" and "Service Terms"
+- Click the green "Start Free Trial" button in the lower left corner to create a service instance
+
+![Confirmation](../../../../images/cloud-deployment-5.png)
+
+### 3.5.Start TuGraph Service
+
+- View the service instance: After the service instance is created successfully, it takes about 2 minutes for deployment. After the deployment is complete, you can see the corresponding service instance on the page, as shown in the figure below.
+
+![View Instance](../../../../images/cloud-deployment-6.png)
+
+- Click the service instance to access TuGraph. After entering the corresponding service instance, you can get 3 ways to
+  use it on the page: web, rpc, ssh. You can also see the password of user admin on the page.
+
+![Access Method](../../../../images/cloud-deployment-7.png)
+
+- Click the link of web to jump to the deployed TuGraph Web. It is recommended that novice users first use the demo to quickly get started with TuGraph.
+    - First, on the TuGraph Web login page, enter the default username (admin) and the password on the page to log in, as shown in the figure below.
+    - After the login is completed, click "New Instance" -> "Create Instance" in sequence, wait for the creation to be completed, and the steps in 3 will change to green in turn, and it will automatically switch to the subgraph MovieDemo1, as shown in the figure below.
+
+![Login](../../../../images/cloud-deployment-8.png)
+![Create Demo](../../../../images/cloud-deployment-9.png)
+
+## 4.Common FAQs
+
+### No available resources in the selected deployment area
+
+Sometimes, the selected deployment area (such as Availability Zone G) does not have available resources for the selected package, and an error will be reported as shown in the figure below.
+
+![Deployment Error](../../../../images/cloud-deployment-10.png)
+
+__Solution__:Try selecting other regions, such as Availability Zone I
+
+### Unaccessible to the web port
+
+It takes some time for the server to get ready. Just wait for a few seconds.
+
+
+### Username or password is not correct
+
+Please make sure that you are using the password on the page instead of the default one.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/index.rst
new file mode 100644
index 0000000000..9bf6be2bc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/1.installation/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Installation
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/1.compile.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/1.compile.md
new file mode 100644
index 0000000000..7d95401dbd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/1.compile.md
@@ -0,0 +1,17 @@
+# Compile
+
+> This document mainly describes how to compile TuGraph from source code.
+
+## 1.Prerequisites
+
+It is recommended to build TuGraph on a Linux system. Meanwhile, Docker is a good choice. If you want to set up a new environment, please refer to [Dockerfile](../1.installation/3.docker-deployment.md)。
+
+## 2.compile
+
+The following are the steps for compiling TuGraph:
+1. `deps/build_deps.sh` or `SKIP_WEB=1 deps/build_deps.sh` to skip building web interface
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If support shell lgraph_cypher,
+   |||use `-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+4. `make`
+5. `make package` or `cpack --config CPackConfig.cmake`
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/2.tugraph-running.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/2.tugraph-running.md
new file mode 100644
index 0000000000..d6968d6d04
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/2.tugraph-running.md
@@ -0,0 +1,187 @@
+# Tugraph Running
+
+> This document describes the operation mode of the TuGraph service, starting, stopping, and restarting operations.And TuGraph's service configuration parameters, configuration file format, and command-line configuration parameters.
+
+## 1. Prerequisites
+TuGraph has the following prerequisites for its execution: a correct [installation of TuGraph](../1.installation/1.environment.md).
+
+TuGraph execution requires ensuring that the library file "liblgraph.so" is located in the environment variable LD_LIBRARY_PATH.
+
+The user running the TuGraph process does not need superuser privileges. However, they need read permissions for the configuration file (usually lgraph.json) and any files referenced within it. Additionally, they should have write permissions for data folders, log files, etc.
+
+## 2.The operation mode
+
+TuGraph can be started as a normal process in the foreground or as a daemon in the background.
+
+When running as a normal process, TuGraph can print logs directly to the terminal, which is handy when debugging server configurations. However, because the foreground process is terminated after the terminal exits, the user must ensure that the terminal remains open while the TuGraph server is running. In daemon mode, on the other hand, the TuGraph server can continue to run even if the terminal that started it exits. If TuGraph needs to run for a long time, it is recommended to start the TuGraph server in daemon mode.
+
+### 2.1.Running a normal process
+
+The 'lgraph_server -d run' command runs TuGraph as a normal process. Normal processes depend on the command line terminal, so when the terminal ends, the TuGraph process is automatically terminated. Normal process mode with '--log_dir ""' can output the process log directly to the terminal, so it is easier to debug.
+
+Start the command：
+
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+Example of running output in normal mode：
+
+```shell
+20200508120723.039: **********************************************************************
+20200508120723.039: *                  TuGraph Graph Database v3.1.0                     *
+20200508120723.040: *                                                                    *
+20200508120723.041: *        Copyright(C) 2018 Ant Group. All rights reserved.           *
+20200508120723.041: *                                                                    *
+20200508120723.044: *             Licensed host: hostname      threads:0, ha:0           *
+20200508120723.044: **********************************************************************
+20200508120723.044: Server is configured with the following parameters:
+20200508120723.045:   data directory:    ./lgraph_db
+20200508120723.045:   license:           ./fma.lic
+20200508120723.046:   enable ha:          0
+20200508120723.046:   async:              0
+20200508120723.047:   host:               127.0.0.1
+20200508120723.047:   REST port:          7071
+20200508120723.048:   RPC port:           9091
+20200508120723.048:   enable rpc:         0
+20200508120723.051:   optimistic txn:     0
+20200508120723.059:   verbose:            1
+20200508120723.074:   log_dir:
+20200508120723.074:   ssl_auth:           0
+20200508120723.075:   resource dir:       ./resource
+
+20200508120723.077: Loading DB state from disk
+20200508120723.110: [RestServer] Listening for REST on port 7090
+20200508120723.110: [LGraphService] Server started.
+```
+
+In normal process mode, the user can prematurely terminate the TuGraph process by pressing 'CTRL+C'.
+
+### 2.2.Run process daemon mode
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+Example output from running in daemon mode:
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+## 3.Service operation
+
+### 3.1.Start the service
+
+TuGraph needs to be started using the 'lgraph_server -d start' command line. The following is an example of the command to start TuGraph:
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+### 3.2.Stop the service
+
+You can stop the TuGraph daemon using the 'kill' command and the 'lgraph_server -d stop' command. Since it is possible to run multiple TuGraph server processes on the same computer, we distinguish between the different server processes using the '.pid 'file, which is written to the working directory where the process was started. Therefore, you need to run the command 'lgraph_server-d stop' in the same working directory to stop the correct server process.
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.Restart the service
+
+Users can also restart the TuGraph service by 'lgraph_server -d restart' :
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.Service configuration
+
+The TuGraph server loads configurations from the configuration file and command line options at startup, and if different values are specified for the same option in the configuration file and command line, the value specified in the command line will be used preferentially.
+
+### 4.1.Configuration parameters
+
+The parameters and their types are described as follows:
+
+| **Parameter names**           | **<nobr>Type</nobr>** | **Instructions**                                                                                                                                                                   |
+| ----------------------------- | --------------------- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| license                       | string                | Path of the authorization file. The default value is /var/lib/lgraph/fma.lic.                                                                                                      |
+| directory                     | string                | Directory where data files are stored. If the directory does not exist, it is automatically created. The default directory is /var/lib/lgraph/data.                                |
+| async                         | boolean               | Whether to use asynchronous mode. Asynchronous mode can reduce disk I/O overhead, but data can be lost in extreme cases such as machine power outages. The default value is false. |
+| host                          | string                | The IP address on which the REST server listens. The default address is 0.0.0.0.                                                                 |
+| port                          | int                   | The Port on which the REST server listens. The default port is 7070.                                                                                                              |
+| enable_rpc                    | boolean               | Whether to use RPC services. The default value is 0.                                                                                                                               |
+| rpc_port                      | int                   | Port used by RPC and HA services. The default port number is 9090.                                                                                                                 |
+| enable_ha                     | boolean               | Whether to enable the HA mode. The default value is false.                                                                                                                         |
+| ha_log_dir                    | string                | HA log directory. The HA mode needs to be enabled. The default value is null.                                                                                                      |
+| master                        | string                | Initialize a node based on host1:port1 and host2:port2. The default value is null.                                                                                                 |
+| verbose                       | int                   | Detail level of log output information. The value can be 0,1,2. The larger the value, the more detailed the output information. The default value is 1.                            |
+| log_dir                       | string                | Directory where log files are stored. The default directory is /var/log/lgraph/.                                                                                                   |
+| ssl_auth                      | boolean               | Whether to use SSL authentication. When HTTPS is enabled, only the HTTPS service is enabled on the REST server. The default value is false.                                        |
+| web                           | string                | The directory where the web files (including the visual part) are located. The default directory is/usr/local/share/lgraph/resource.                                               |
+| server_cert                   | string                | certificate file path used by the server when SSL authentication is enabled. The default path is/usr/local/etc/lgraph/server - cert.pem.                                           |
+| server_key                    | string                | The public key file used by the server when SSL authentication is enabled. The default directory is/usr/local/etc/lgraph/server - key.pem。                                        |
+| enable_audit_log              | boolean               | Whether to enable audit logs. The default value is false.                                                                                                                          |
+| audit_log_expire              | int                   | When audit logs are enabled, the validity period (hours) of audit logs is automatically cleared upon timeout. If the value is 0, the logs are not cleared. The default value is 0. |
+| audit_log_dir                 | string                | Specifies the directory for storing log files when audit logs are enabled. The default directory is $directory/_audit_log_.                                                        |
+| load_plugins                  | boolean               | Import all stored procedures when starting the service. The default value is 1.                                                                                                    |
+| optimistic_txn                | boolean               | Enable optimistic multithreaded write transactions for Cypher. The default is 0.                                                                                                   |
+| disable_auth                  | boolean               | Disable REST authentication. The default is 0.                                                                                                                                     |
+| snapshot_interval             | int                   | Snapshot interval (in seconds) The default value is 86400.                                                                                                                         |
+| heartbeat_interval_ms         | int                   | Heartbeat interval in milliseconds. The default value is 1000.                                                                                                                     |
+| heartbeat_failure_duration_ms | int                   | The heartbeat times out and the interval (in milliseconds) between nodes going offline. The default value is 60000.                                                                |
+| node_dead_duration_ms         | int                   | The interval (in milliseconds) at which a node is considered completely dead and removed from the list. The default value is 120000.                                               |
+| enable_ip_check               | boolean               | Allow IP address whitelists. The default value is 0。                                                                                                                              |
+| idle_seconds                  | int                   | The maximum number of seconds a child process can be idle. The default value is 600.                                                                                               |
+| enable_backup_log             | boolean               | Whether to enable backup logging. The default value is 0.                                                                                                                          |
+| backup_log_dir                | string                | The directory where backup files are stored. The default value is null.                                                                                                            |
+| snapshot_dir                  | string                | Directory where snapshot files are stored. The default value is null.                                                                                                              |
+| thread_limit                  | int                   | The maximum number of threads that can be used simultaneously. The default value is 0, which means that no restriction is imposed. The license file prevails.                      |
+| unlimited_token               | boolean               | Whether to set the link token to be infinite. The default value is 0 and the validity period is 24 hours.                                                                                                                           |
+| help                          | boolean               | Print the help message. The default value is 0.                                                                                                                                    |
+
+### 4.2.Server configuration file
+
+TuGraph's configuration file is stored in JSON format. It is recommended that most configuration be stored in configuration files and that some configuration parameters be modified only temporarily using command-line options when needed.
+
+A typical configuration file looks like this:
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+  "license": "/var/lib/lgraph/fma.lic",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md
new file mode 100644
index 0000000000..6d5c858851
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md
@@ -0,0 +1,109 @@
+# High Availability mode
+
+> This document describes the principles, preparations, and server operations of the high availability mode
+
+## 1.Theory
+
+TuGraph provides high availability mode (HA mode) through multiple server hot backups. In high availability mode, writes are synchronized to all servers so that service availability is not affected even if some servers go down.
+
+In high availability mode, multiple TuGraph servers form a backup group. Each backup group consists of three or more TuGraph servers, one of which serves as the 'leader' and the other replication group servers serve as the 'follower'. Write requests are serviced by the 'leader' who replicates each request to the 'follower' and responds to the client only after the request has been synchronized to the server. This way, if any server fails, the other servers will still have all the data that has been written so far. If the 'leader' server fails, other servers will automatically select a new 'leader'.
+
+The high availability mode is only available in the enterprise edition. The open-source Community Edition does not include this feature.
+
+## 2.Preparation
+
+To enable high availability mode, users need to:
+
+- Three or more instances of TuGraph servers.
+
+- To obtain a license file with high availability, please contact our distributor for details.
+- To enable high availability mode when starting lgraph_server, the 'enable_ha' option can be set to 'true' using a configuration file or the command line.
+- Set the correct rpc_port through the configuration file or command line
+
+## 3.Start the initial backup group
+
+### 3.1.The initial data is consistent
+
+When the data in all servers is the same or there is no data at startup, the user can
+specify `--conf host1:port1,host2:port2` to start the server.
+In this way, all prepared TuGraph instances can be added to the initial backup group at one time,
+All servers in the backup group elect `leader` according to the RAFT protocol, and other
+servers join the backup group with the role of `follower`.
+
+An example command to start an initial backup group is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+After the first server is started, it will elect itself as the 'leader' and organize a backup group with only itself.
+
+The first server is started with the '--master "" or' --master BOOTSTRAP 'options, depending on whether the first server already has data.
+
+- '--master "":' If there is no data in the first server, the user can start the server directly with the '--master ""' option.
+
+- '--master BOOTSTRAP:' if the data already exists in the first server (imported using lgraph_import or transferred from a server not in high availability mode) and has not been used in high availability mode before, Then the user should use the 'BOOTSTRAP' option to start the server in boot mode. In boot mode, the server copies its data to the new server before adding the new server to the backup group, so that the data in each server is consistent.
+
+The following is an example of the command line for starting the first server that already has data:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --master BOOTSTRAP
+```
+
+### 3.2.Inconsistent initial data
+If there is already data in the first server (imported by the `lgraph_import` tool or transferred from a server in non-high availability mode),
+And it has not been used in high availability mode before, the user should use the `enable_bootstrap` parameter
+Start the server in boot mode. In bootstrap mode, the server will add its own
+The data is copied to the new server so that the data in each server is consistent.
+
+An example command to start a data server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --enable_bootstrap true
+```
+
+Other servers without data do not need to specify the `enable_bootstrap` parameter, just specify the `leader` through the `conf` parameter, the command example is as follows
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+## 4.Scale out other servers
+
+After starting the initial backup group, if you want to scale out the backup group, add new servers to the backup group,
+The `--conf HOST:PORT` option should be used, where `HOST` can be the IP address of any server already in this backup group,
+And `PORT` is its RPC port. E.g:
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+
+This command will start a TuGraph server in high availability mode and try to add it to the backup group containing the server `172.22.224.15:9090`.
+Note that joining a backup group requires a server to synchronize its data with the backup group's `leader` server, and this process may take a considerable amount of time, depending on the size of the data.
+
+## 5.Stopping the Server
+
+When a server goes offline via 'CTRL-C', it will notify the current 'leader' server to remove the server from the backup group. If the leader server goes offline, it will pass the leader identity permission to another server before going offline.
+
+If a server is terminated or disconnected from other servers in the backup group, the server is considered a failed node and the leader server will remove it from the backup group after a specified time limit.
+
+If any server leaves the backup group and wishes to rejoin, it must start with the '--master {HOST: PORT}' option, where 'HOST' is the IP address of a server in the current backup group.
+
+## 6.Restarting the Server
+
+Restarting the entire backup group is not recommended because it can interrupt service. You can shut down all servers if you need to. However, on a restart, the last server that went down must be started first.
+
+## 7.Server Status
+
+The current status of the backup group can be obtained from the TuGraph visualization tool, REST API, and Cypher query.
+
+In the TuGraph visualization tool, you can find the list of servers and their roles in the backup group in the DBInfo section.
+
+With the REST API, you can use `GET /info/peers` to request information.
+
+In Cypher, the `CALL dbms.listServers()` statement is used to query the status information of the current backup group.
+
+## 8.Data synchronization in high availability mode
+
+In high availability mode, different servers in the same backup group may not always be in the same state. For performance reasons, if a request has been synchronized to more than half of the servers, the leader server will consider the request to be in the committed state. Although the rest of the servers will eventually receive the new request, the inconsistent state of the servers will persist for some time. A client may also send a request to a server that has just restarted, thus having an older state and waiting to join a backup group.
+
+To ensure that the client sees consistently continuous data, and in particular to get rid of the 'reverse time travel' problem, where the client reads a state older than it has seen before, each TuGraph server keeps a monotonically increasing data version number. The mapping of the data version number to the database state in the backup group is globally consistent, meaning that if two servers have the same data version number, they must have the same data. When responding to a request, the server includes its data version number in the response. Thus, the client can tell which version it has seen. The client can choose to send this data version number along with the request. Upon receiving a request with a data version number, the server compares the data version number to its current version and rejects the request if its own version is lower than the requested version. This mechanism ensures that the client never reads a state that is older than before.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/index.rst
new file mode 100644
index 0000000000..6d3b240af9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/2.running/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Running
+====================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/1.data-import.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/1.data-import.md
new file mode 100644
index 0000000000..110735815f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/1.data-import.md
@@ -0,0 +1,367 @@
+# Data Importing
+
+> This document describes the data import function of TuGraph. These include delimiters in CSV format, sample formats for jsonline, and two modes for importing online and offline.
+
+## 1. Introduction
+
+After the installation is successful, you can use the `lgraph_import` batch import tool to import existing data into TuGraph. `lgraph_import` supports importing data from CSV files and JSON data sources.
+
+> `sonline format, a row of a json array string`
+
+> CSV format
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline format
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph supports two data importing modes：
+
+- _offline_：Read the data and import it into a data file for the specified server, it should only be done when the server is offline.
+- _online_：Read the data and send it to the running server, which then imports the data into its database.
+
+## 2.CSV file format delimiter
+
+    CSV delimiters can be single-character or multi-character strings, which cannot contain 'r' or 'n'. Note that different shells handle input strings differently, so different escape handling may be required for different shell input parameters.
+
+In addition, 'lgraph_import' also supports the following escape characters for entering special symbols:
+
+| Escape character | Instructions                                                                                              |
+| ---------------- | --------------------------------------------------------------------------------------------------------- |
+| \\               | The backslash`\\`                                                                                         |
+| \\a              | ASCII code 0x07                                                                                           |
+| \\f              | form-feed，ASCII code 0x0c                                                                                |
+| \\t              | Horizontal tab characters， ASCII code 0x09                                                               |
+| \\v              | Vertical tab characters， ASCII code 0x0b                                                                 |
+| \\xnn            | Two hexadecimal digits representing one byte，example \\x9A                                               |
+| \\nnn            | A three-digit octal number representing a single byte，example \\001, \\443，data range cannot exceed 255 |
+
+Demo：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.The configuration file
+
+    `lgraph_import`tool configures the environment using the specified configuration file. The configuration file describes the paths to the input files, the vertices/edges they represent, and the vertex/edge format.
+
+### 3.1.Configuration File Format
+
+The configuration file consists of two parts: schema and files. The 'schema' part defines label, and the 'files' part describes the data files to be imported.
+
+#### 3.1.1.The keyword
+
+- schema (Array）
+  - label（required，string）
+  - type（required， VERTEX or EDGE）
+  - properties（Array，required for vertex，If there is no property for the edge, you can leave it unconfigured）
+    - name（required, string）
+    - type （required,，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（optional，Indicates that the field can be configured or not configured）
+    - index（optional，Whether the field needs to be indexed）
+    - unique（Optional, whether the field indexed and is of type unique）
+  - primary (Specify a property that uniquely identifies a point in the primary key field)
+  - constraints (Edge-only configuration, optional, array form, start and end labels, unconfigured or empty means unrestricted)
+  - detach_property (optional, both Edge and Vertex can config，default is `false`. `true` means the property data is stored in detached model, which can reduce io read amplification in cases with less memory and much property data.)
+- files （Array）
+  - path（required，string，The value can be a file path or a directory path. If it is a directory, all files in the directory will be imported. Ensure that they have the same schema）
+  - header（Optional, numeric, header in the first few lines of the file, or 0）
+  - format（required，JSON or CSV）
+  - label（required，string）
+  - columns（Array）
+    - SRC_ID (Special string，only on the edges,That means this column is the source data)
+    - DST_ID (A special string, only on the edges, indicates that this column is the destination data)
+    - SKIP   (A special string to skip this column of data)
+    - [property]
+  - SRC_ID (Edge-only configuration. The value is the start label)
+  - DST_ID (Edge-only configuration. The value is the destination point label)
+
+### 3.1.2.Example Configuration File
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+For the above Example Configuration File, three labels defined: two point types' actor 'and' movie ', and one edge type 'role'. Each label describes: the name of the label, the type (dot or edge), which attribute fields are available, and the type of each field. For points, the primary field also defined; For edges, the constraints field also defined, which limits the starting and ending points of the edges.
+
+It also describes three data files, two dot data files' actors.csv 'and' movies.csv ', and one edge data file 'roles.csv'. Each section describes the path of the file, the format of the data, the first few lines of the header, the label of the data, and the corresponding field of each column in each row of data in the file.
+
+For the above configuration files, the import tool will first create labels' actor ', 'movie', and 'role' in TuGraph, and then perform data import of the three files.
+
+## 4.Offline full import
+
+The offline mode can be used only on offline servers. An offline import creates a new graph, so it's more suitable for your first data import on a newly installed TuGraph server.
+
+To use the 'lgraph_import' tool in offline mode, you can specify the 'lgraph_import --online false' option. To see the command-line options available, use 'lgraph_import --online false --help' :
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+Command line arguments:
+
+- **-c, --config_file** `config_file`: Import the configuration file name in the following format:
+- **--log** `log_dir`: Log directory. The default is an empty string, in which case the log information output to the console.
+- **--verbose** `0/1/2`: Log level. The higher the log level, the more detailed the output information is. The default value is 1.
+- **-i, --continue_on_error** `true/false`: If an error occurs, skip the error and continue. The default is false. If an error occurs, exit.
+- **-d, --dir** `{diretory}`:The database directory to which the import tool will write data. Default is'./db '.
+- **--delimiter** `{delimiter}`: Data file separator. This is used only when the data source is in CSV format. The default is', '。
+- **-u, --username** `{user}`: Username of the database. You need to be an administrator to perform offline import.
+- **-p, --password** `{password}`: Specifies the password of the database user
+- **--overwrite** `true/false`: Whether to overwrite data. When set to true, the data directory overwritten if it already exists. Default to 'false'.
+- **-g, --graph** `{graph_name}`: Specify the kind of graph to import.
+- **-h, --help**: The help information displayed.
+
+### 4.1.Offline Import Example
+
+    In this example, we use the movie-actor data described above to demonstrate the use of the import tool. The data to be imported is divided into three files: 'movies.csv', 'actors.csv', and 'roles.csv'.
+
+'movies.csv' contains information about movies, where each movie has an id (as a primary key for retrieval), and each movie also has attributes such as title, year, and rating. (Data from [IMDb](http://www.imdb.com)).
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+> The jsonline format is as follows:
+> All fields can be strings, which will be converted to the corresponding type when imported
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`It contains information about the actors. Each actor also has an id, as well as properties such as name.
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`It contains information about which role an actor played in which movie. Each row records a character played by a given actor in a given movie, corresponding to an edge in the database.`SRC_ID` and `DST_ID` are the source and target vertices of the edge, which are the 'primary' properties defined in 'actors.csv' and 'movies.csv', respectively.
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+'configuration file import.conf', notice that there are two HEADER lines in each file, so we need to specify the 'HEADER=2' option.
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+Using the import configuration file, we can now import data using the following command:
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # Read configuration information from import.conf
+        --dir /data/lgraph_db      # Store the data in /data/lgraph_db
+        --graph mygraph            # Import the graph named mygraph
+```
+
+**Notice**：
+
+- If a graph named 'mygraph' already exists, the import tool will print an error message and exit. To force a graph to be overwritten, use the '--overwrite true' option.
+- Configuration and data files must be stored in UTF-8 encoding (or normal ASCII encoding, which is a subset of UTF-8). If any file uses an encoding other than UTF-8 (for example, UTF-8 with BOM or GBK), the import will fail and output a profiler error.
+
+## 5.Online incremental Import
+
+    The online import mode can be used to import a batch of files into an already running instance of TuGraph. This is handy for processing incremental batch updates that typically occur at fixed intervals. The 'lgraph_import --online true' option enables the import tool to work in online mode. Like offline mode, online mode has its own set of command-line options, which can be printed using the '-h, --help' options:
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+The configuration related to the file specified in the configuration file, and its format is exactly the same as' offline mode '. However, instead of importing the data into a local database, we are now sending the data to a running TuGraph instance, which is typically running on a different computer than the client machine on which the import tool is running. Therefore, we need to specify the URL, DB user, and password for the HTTP address of the remote machine.
+
+If the user and password are valid, and the specified graph exists, the import tool sends the data to the server, which then parses the data and writes it to the specified graph. The data will be sent in a packet of about 16 MB, interrupted at the nearest newline. Each package imported atomically, which means that if the package is successfully imported, all data is successfully imported; otherwise, none of the data enters the database. If '--continue_on_error true' is specified, data integrity errors are ignored and offending lines are ignored. Otherwise, the import stops at the first error package and prints out the number of packages that have been imported. In this case, the user can modify the data to eliminate errors, and then use '--skip_packages N' to redo the import to skip the imported packages.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/2.data-export.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/2.data-export.md
new file mode 100644
index 0000000000..b1ad57de6f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# Data Export
+
+> This document mainly introduces the data export function of TuGraph.
+
+## 1.Introduction
+
+TuGraph can use the tool `lgraph_export` to export data from the database that has been imported successfully. The 'lgraph_export' tool can export the data of the specified TuGraph database to the specified directory in the form of 'csv' or 'json' file, and export the configuration file 'import.config'. That required for re-importing the data.
+
+## 2.Data Export
+
+The following is an example of a command for the tool:
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+Details:
+
+- `-d {database_dir}` specifies the directory of the database from which the data will be exported. The default value is./testdb '.
+- `-e {export_destination_dir}` specifies the directory where the export file is stored. The default value is./exportdir.
+- `-g {graph_to_use}` specifies the type of graph database. default is' default '.
+- `-u {username}` Specifies the name of the user who performs the export operation.
+- `-p {password}` Specifies the password of the user who performs the export operation.
+- `-s {field_separator}` specifies the separator for the exported file. The default is comma.
+- `-f {output_format}` specifies the format of the exported data. It can be 'json' or 'csv'.
+- `-h` In addition to the specified parameters, you can also use this parameter to view the help of the tool.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..fa1839724b
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
@@ -0,0 +1,32 @@
+# Backup and Restore
+
+> This document mainly introduces the data backup and restore function of TuGraph.
+
+## 1.Data Backup
+
+TuGraph can use the 'lgraph_backup' tool to backup data.
+The 'lgraph_backup' tool can backup data from a TuGraph database to another directory. It can be used as follows:
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+Details:
+
+- `-s {source_dir}` specifies the directory where the database (source database) to be backed up resides.
+- `-d {destination_dir}` specifies the directory where the backup file (destination database) is stored.
+  If the target database is not empty, 'lgraph_backup' prompts you whether to overwrite the database.
+- `-c {true/false}` indicates whether a compaction occurs during backup.
+  Every compaction creates a tighter backup, but every compaction takes longer to create. This option defaults to 'true'.
+
+## 2.Data Restore
+
+The target database `{destination_dir}` obtained using the `lgraph_backup` tool backs up all subgraphs of the source database `{source_dir}`, but does not include the raft information of the HA cluster, thereby ensuring that the service and cluster can be successfully restarted with the backup database and the data is consistent with the source database. The following command can be used to restart the service with the backup database. When the service starts, the storage process of all subgraphs will be restored to ensure that the backup service is completely consistent with the original service.
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+Details
+
+- `-d {destination_dir}` Specify the directory where the backup file (target database) is located.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md
new file mode 100644
index 0000000000..6782a43d0e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# Data Warmup
+
+> This document mainly introduces the data Warmup function of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a disk-based database where data loaded into memory only when accessed. Therefore, for a period of time after the server just turned on, the system performance may be degraded due to frequent IO operations. At this point, we can improve this problem by data warm-up.
+
+## 2.lgraph_warmup
+
+Data warmup can be done using the tool lgraph_warmup. An example of its use is as follows:
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+Details:
+
+The - '-d {db_dir}' option specifies the data directory for the TuGraph server
+
+The - '-g {graph_list}' option specifies the names of graphs to be warmed-up, separated by commas
+
+The warm-up process takes different times depending on the data size and the type of disk being used. Preheating a large database on a mechanical disk may take a long time. Please wait patiently.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/index.rst
new file mode 100644
index 0000000000..d2d7ed7240
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/3.server-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Server Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/1.python-client.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/1.python-client.md
new file mode 100644
index 0000000000..bc565966cd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/1.python-client.md
@@ -0,0 +1,29 @@
+# TuGraph Python SDK
+
+> This document is the usage instruction of TuGraph Python SDK
+
+## **Demo**
+
+### 1.Call cypher
+
+```python
+TuGraphClient import TuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+```
+
+### 2.Call stored procedure
+
+```python
+TuGraphClient import TuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..2cbf08eb5c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md
@@ -0,0 +1,186 @@
+# TuGraph C++ SDK
+
+> This document is the usage instruction of TuGraph C++ SDK
+
+## 1.Instructions
+
+C++ Client can use RPC to connect to lgraph_server to import data, execute stored procedures, call Cypher and other operations.
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+```C++
+RpcClient client3("0.0.0.0:19099", "admin", "73@TuGraph");
+```
+
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+### 2.2.Call cypher
+
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+        const std::string& graph = "default",
+        bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+
+### 2.3.Call stored procedure
+
+```C++
+    std::string str;
+    bool ret = client.CallPlugin(str, "CPP", "test_plugin1", "bcefg");
+```
+
+```
+    bool CallPlugin(std::string& result, const std::string& plugin_type,
+        const std::string& plugin_name, const std::string& param,
+        double plugin_time_out = 0.0, bool in_process = false,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param plugin_type: the plugin type, currently supported CPP and PY
+    @param plugin_name: plugin name
+    @param param: the execution parameters
+    @param plugin_timeout: Maximum execution time, overruns will be interrupted
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+
+### 2.4.Load stored procedure
+
+```C++
+    std::string str;
+    bool ret = client.LoadPlugin(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin",
+```
+
+```
+    bool LoadPlugin(std::string& result, const std::string& source_file,
+        const std::string& plugin_type, const std::string& plugin_name,
+        const std::string& code_type, const std::string& plugin_description,
+        bool read_only, const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param source_file: the source_file contain plugin code
+    @param plugin_type: the plugin type, currently supported CPP and PY
+    @param plugin_name: plugin name
+    @param code_type: code type, currently supported PY, SO, CPP, ZIP
+    @param plugin_description: plugin description
+    @param read_only: plugin is read only or not
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+
+### 2.5.Import from a byte stream schema
+
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+
+### 2.6.Import node and edge data from a byte stream
+
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+        const std::string& data, const std::string& delimiter,
+        bool continue_on_error = false, int thread_nums = 8,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+
+### 2.7.Import schema from a file
+
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+
+### 2.8.Import edge data from a file
+
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+        const std::string& delimiter, bool continue_on_error = false,
+        int thread_nums = 8, int skip_packages = 0,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param conf_file: data file contain format description and data
+    @param delimiter: data separator
+    @param continue_on_error: whether to continue when importing data fails
+    @param thread_nums: maximum number of threads
+    @param skip_packages: skip packages number
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/3.java-client.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/3.java-client.md
new file mode 100644
index 0000000000..1e7cbda43d
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/3.java-client.md
@@ -0,0 +1,159 @@
+# TuGraph Java SDK
+
+## 1.Compile java client code
+
+```shell
+cd src/client/java/TuGraphRpcClient
+sh local_build.sh
+```
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+```java
+import com.alipay.tugraph.TuGraphRpcClient;
+TuGraphRpcClient client = new TuGraphRpcClient(url, user, password);
+```
+
+```shell
+# If tugraph is launched from docker
+url      : list://ip:9090
+user     : admin
+password : 73@TuGraph
+```
+
+```
+public TuGraphRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like list://ip:port
+@param user: login user name
+@param password: login password
+```
+
+### 2.2.Call cypher
+
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout)
+```
+
+### 2.3.Call stored procedure
+
+```java
+    String result = client.callPlugin("CPP", "khop", kHopParamGen(), 1000, false, "default", 1000);
+    log.info("testCallPlugin : " + result);
+```
+
+```
+    @param pluginType: the plugin type, currently supported CPP and PY
+    @param pluginName: plugin name
+    @param param: the execution parameters
+    @param pluginTimeOut: Maximum execution time, overruns will be interrupted
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of plugin execution
+    public String callPlugin(String pluginType, String pluginName, String param, double pluginTimeOut,
+            boolean inProcess, String graph, double timeout)
+```
+
+### 2.4.Load stored procedure
+
+```java
+    String result = client.loadPlugin("./test/plugin/khop.so", "CPP", "khop", "SO", "test loadplugin", true, "default", 1000);
+    log.info("loadPlugin : " + result);
+```
+
+```
+    @param sourceFile: the source_file contain plugin code
+    @param pluginType: the plugin type, currently supported CPP and PY
+    @param pluginName: plugin name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param pluginDescription: plugin description
+    @param readOnly: plugin is read only or not
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of plugin execution
+    public boolean loadPlugin(String sourceFile, String pluginType, String pluginName, String codeType,
+            String pluginDescription, boolean readOnly, String graph, double timeout) throws IOException
+```
+
+### 2.5.Import from a byte stream schema
+
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException
+```
+
+### 2.6.Import point edge data from byte stream
+
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+
+### 2.7.Import from a file schema
+
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout)
+            throws UnsupportedEncodingException, IOException
+```
+
+### 2.8.Import edge data from a file
+
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..1a778b73ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,176 @@
+# TuGraph-OGM
+
+@TODO
+
+## 1.Introduction
+
+> TuGraph-OGM project is open source on other repositories.
+
+TuGraph-OGM (Object Graph Mapping) is a graph object mapping tool designed for TuGraph. It supports the mapping of Java objects (POJO) into TuGraph. The classes in Java are mapped to nodes in the graph, the collections in the classes are mapped to edges, and the properties of the classes are mapped to the attributes of the graph objects. It also provides corresponding functions to manipulate the graph database. Therefore, Java developers can easily use TuGraph database in the familiar ecosystem. TuGraph-OGM is also compatible with Neo4j-OGM. Neo4j ecosystem users can migrate seamlessly to TuGraph database.
+
+### 1.1.Functions of TuGraph-OGM
+
+TuGraph-OGM provides the following functions for operating TuGraph:
+
+| Function                            | Usage                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| Insert single vertex/edge                 | void session.save(T object)                                                      |
+| Batch insert vertexs/edges                 | void session.save(T object)                                                      |
+| Delete vertex and its corresponding edges                | void session.delete(T object)                                                    |
+| Delete all vertexs with specific label       | void session.deleteAll(Class\<T> type)                                           |
+| Clear the database                      | void purgeDatabase()                                                             |
+| Update vertex                        | void session.save(T newObject)                                                   |
+| Query single node by id            | T load(Class<T> type, ID id)                                                     |
+| Query multiple nodes by ids           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| Query all nodes with specific label         | Collection\<T> loadAll(Class\<T> type)                                           |
+| Query with conditions                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher query (specify the return type) | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher query                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.Compile TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.Use TuGraph-OGM
+
+Please refer to the detailed examples in TuGraphOGMDemo under the demo folder.How to import dependencies in `pom.xml`.
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // create Movie vertex
+    @Id
+    private Long id;      // Movie id
+    private String title; // title attribute
+    private int released; // released attribute
+
+    // create Edge ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // create Actor vertex
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// configuration
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//Start driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// Open session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.Perform CRUD operations through OGM
+
+```java
+// new
+Movie jokes = new Movie("Jokes", 1990);  // Create Movie-vertex "jokes"
+session.save(jokes);                     // Store "jokes" in TuGraph
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // Connect the "speed" vertex with the "alice" vertex through the ACTS_IN relationship
+session.save(speed);                    // Store two vertexs and one edge
+
+// delete
+session.delete(alice);                  // Delete the "alice" vertex and its connected edge
+Movie m = session.load(Movie.class, jokes.getId());   // Get the "jokes" vertex based on its id
+session.delete(m);                                    // Delete the "jokes" node
+
+// update
+speed.setReleased(2018);
+session.save(speed);                   // Update the "speed" attribute
+
+// get
+Collection<Movie> movies = session.loadAll(Movie.class);  // Get all Movie vertexs
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // Query all movies released before 1995
+
+// Call Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // Query the Movie with "Speed" of 2018
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // Create vertex label "Director"
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // Create edge label "DIRECT"
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // Get the create result
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // View the number of vertexs created
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //View the number of edges created
+
+// Clear the database
+session.deleteAll(Movie.class);        // Delete all Movie vertexs
+session.purgeDatabase();               // Delete all data
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
new file mode 100644
index 0000000000..dd74d08869
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
@@ -0,0 +1,145 @@
+# Tugraph CLI
+
+> This document mainly introduces the CLI tool lgraph_cypher of TuGraph.
+
+## 1.Instructions
+
+The TuGraph release comes with a query client named 'lgraph_cypher' that can be used to submit OpenCypher requests to the TuGraph server. The 'lgraph_cypher' client has two execution modes: single command mode and interactive mode.
+
+## Single command mode
+
+In single-command mode, 'lgraph_cypher' can be used to submit a single Cypher query and print the result directly to the terminal. The printed result can also be easily redirected to a specified file. This is handy when users need to get a lot of results from the server and save them in files.
+
+In this mode, the 'lgraph_cypher' tool has the following options:
+
+### Command line Parameters:
+
+| Parameter | Type   | Instructions                                                                                                                                                                                                                           |
+| --------- | ------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| --help    | \\     | List all parameters and descriptions.                                                                                                                                                                                                  |
+| -example  | \\     | List the command instances.                                                                                                                                                                                                            |
+| -c        | string | A database configuration file used to obtain ip and port information.                                                                                                                                                                  |
+| -h        | string | Database server IP address. Omit this parameter if you have a configuration file. The default value is' 127.0.0.1 '                                                                                               |
+| -p        | string | Database server port. Omit this parameter if you have a configuration file. The default value is 7071                                                                                                                                  |
+| -u        | string | User name for logging in to the database.                                                                                                                                                                                              |
+| -P        | string | Password for logging in to the database.                                                                                                                                                                                               |
+| -f        | string | Contains the path to a single Cypher query single text file.                                                                                                                                                                           |
+| -s        | string | Single-line cypher query command. Start and end with `"`.                                                                                                                                                                              |
+| -t        | int    | Specifies the server timeout threshold for cypher queries. The default value is 150 seconds.                                                                                                                                           |
+| -format   | string | Query result display mode. Supports two formats: 'plain' and 'table'. The 'plain' format prints the query results in a single column. The 'table' format displays the query results in a tabular format. The default value is' table ' |
+
+### Examples:
+
+**cypher command file query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+
+```
+
+**cypher command single-sentence query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+
+```
+
+## Interactive mode
+
+'lgraph_cypher' can also be run in interactive mode. In interactive mode, the client stays connected to the server and interacts with the user in read-evaluate-print-loop.
+
+### Enter lgraph_cypher interaction mode:
+
+If no '-f' or '-s' command line option added, 'lgraph_cypher' will enter interactive mode when running. how to use it:
+
+```
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+
+```
+
+If the login is successful, the corresponding login success message will be displayed:
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2018 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+Now we also provide an interactive shell for users to enter Cypher queries or use the ':help' command to check for available commands.
+
+### Command Description
+
+In addition to the Cypher query, the shell of 'lgraph_cypher' accepts the following commands:
+
+| Command                  | Parameters                                         | instructions                                                                                                                                              |
+| ------------------------ | -------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                                 | Displays the server information and the corresponding description of all commands.                                                                        |
+| :db_info                 | \\                                                 | Query the current server status. /db/info for the corresponding REST API.                                                                                 |
+| :clear                   | \\                                                 | Clear the screen.                                                                                                                                         |
+| :use                     | {Graph Name}                                       | The graph specified with this name defaults to `default`                                                                                                  |
+| :source                  | `-t {Query the timeout value} -f {The query file}` | cypher command file query in interactive mode. The default timeout threshold is 150 seconds. Query file format reference No interactive query parameters. |
+| :exit                    | \\                                                 | Exit interactive mode and return to the original command line.                                                                                            |
+| :format                  | `plain` or `table`                                 | Change the display mode of cypher query results. Support 'plain' and 'table' modes.                                                                       |
+| :save all/command/result | `-f {The file path}` `{Cypher}`                    | The cypher command (command), query result (result) or both (all) are stored. The default location is' /saved_cypher.txt '                                |
+
+**Note:**
+
+- Each command should start with a colon `:`.
+
+**:save command example :**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+
+```
+
+### cypher query command:
+
+In interactive mode, users can also directly input a single sentence cypher command for query, with "'; ` "end. Enter commands that are case insensitive. Here's an example:
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher` supports multi-line input when typing commands. Users can use the `ENTER` key to type long query statements into multiple lines. In the case of multi-line input, the beginning of the command line will change from `>` to `=>`, and the user can continue to type the rest of the query.
+
+Example:
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### Auxiliary Features:
+
+**Input History:** Press the up and down arrow keys in interactive mode to display the input history.
+
+**Auto Completion:** lgraph_cypher will automatically complete based on the input history. In the event of a completion prompt, pressing the right arrow key will automatically complete the command.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/index.rst
new file mode 100644
index 0000000000..f9acd8d9e1
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/4.client-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Client Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
new file mode 100644
index 0000000000..6695299a7d
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
@@ -0,0 +1,1019 @@
+# Monitoring
+
+> This document mainly introduces the visualization operation and maintenance monitoring of TuGraph.
+
+## 1.Design Concept
+
+Visualization monitoring is not an indispensable part of TuGraph itself. Therefore, in the design, visualization monitoring is regarded as an application in the peripheral ecology of TuGraph to reduce the coupling with TuGraph database and its own impact. TuGraph visualization monitoring adopts the hottest open source solution - TuGraph Monitor + Prometheus + Grafana. Wherein, TuGraph Monitor is the client of TuGraph service, which initiates Procedure requests to TuGraph service through TCP connection. After receiving the request, TuGraph service collects statistics of CPU, memory, disk, IO, and number of requests on its own machine and responds. TuGraph Monitor packages the index data received from TuGraph into the format required by Prometheus and saves it in memory, waiting for Prometheus to obtain it through HTTP request. Prometheus regularly obtains packaged request data from TuGraph Monitor through HTTP requests and saves it in its own time-series database according to the time obtained. Grafana can obtain the statistical data within a certain time period from Prometheus according to user configuration and draw easy-to-understand graphics on the web interface to display the final result. In the entire request chain, the active acquisition, i.e. pull model, is used, which has the advantages of minimizing the coupling between data producers and data consumers, making development simpler, and not requiring data producers to consider the data processing capability of data consumers. Even if the data processing ability of a consumer is weak, it will not be crushed by the data producer producing data too fast. One of the shortcomings of the active pulling model is that the real-time performance of the data is insufficient. However, in this scenario, data does not have high real-time requirements.
+
+### 1.1.TuGraph
+
+TuGraph database provides the ability to collect multiple data information, such as disk, memory, network IO, and query requests, in the service machine, and provides queries through standard Procedure methods. This action of collecting data only occurs when a user queries through the interface, avoiding the impact of TuGraph monitoring service on user business query requests when users do not need the indicators on TuGraph monitoring service machine.
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor is a tool in the peripheral ecology of TuGraph. It communicates with TuGraph through C++ RPC Client as one of the many users of TuGraph and queries the performance indicators of the machine where TuGraph service is located through the Procedure query interface. It packages the results returned by TuGraph into the data model required by Prometheus and waits for Prometheus to obtain them. Users can set the query time interval to minimize the impact of obtaining monitoring indicators on business queries.
+
+### 1.3.Prometheus
+
+Prometheus is an open-source monitoring platform with a dedicated time-series database. It regularly obtains statistical indicators from the TuGraph Monitor service through HTTP requests and saves them in its own time-series database. For details, please refer to the official website:[https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana is an open-source visualization and analysis software. It can obtain data from multiple data sources, including Prometheus, and can convert data in the time-series database into tools for beautiful graphics and visual effects. For specific information, please refer to the official website:[https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.Deployment Solution
+
+### 2.1.Step 1
+
+Start the TuGraph service. For details, please refer to the documentation:[https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.Step 2
+
+Start the TuGraph Monitor tool. The startup command is as follows:
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+The meanings of the parameters are as follows:
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.Step Three
+
++ Download the Prometheus tarball that matches your machine architecture and system version. Download link:[https://prometheus.io/download/](https://prometheus.io/download/)
+
++ Unzip the tarball with the following command:
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ Modify the configuration file prometheus.yml and add the following configuration to enable Prometheus to scrape performance data packaged by TuGraph Monitor.
+
+```
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ Start Prometheus. You can obtain specific startup parameters with the following command:
+
+```shell
+./prometheus -h
+```
+
++ Verify if the Prometheus service is running properly by logging into the Prometheus service through the web portal, and querying whether the monitoring index resources_report has been obtained. If the data can be successfully queried, the operation is successful.
+
+### 2.4.Step Four
+
++ Download the Grafana installation package that matches your machine architecture and system version. Download link:[https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ Install Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Start Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Configure Grafana. First, configure the IP address of Prometheus in the data source settings. After the configuration is completed, verify if the data source is connected successfully by testing the connection function. Then, import the following template and modify the correct interface IP and port in the page according to the actual situation. Finally, set the refresh time and monitoring time range according to the actual situation.
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana",
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{label_name}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "memory",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \n  QPS exceeds 1000",
+        "name": "Request statistics alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "Request statistics",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "disk",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \nCPU usage rate exceeds 90%",
+        "name": "CPU usage rate alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU usage rate",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] Disk IO exceeds 10MB/S",
+        "name": "Disk IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph Monitoring Web",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+Verify the effect by refreshing the browser page. If the pie chart and line chart are displayed correctly, the configuration is completed.
+
+## 3.Future Plans
+
+Currently, visual monitoring only supports single-machine monitoring and can monitor performance indicators such as CPU, disk, network IO, and request QPS of the machine on which the service is located. In the future, monitoring for HA clusters will be implemented, and more meaningful indicators will be included in the monitoring scope.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
new file mode 100644
index 0000000000..a9c069a34a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
@@ -0,0 +1,439 @@
+# TuGraph DataX
+
+> This document mainly introduces the installation, compilation and usage examples of TuGraph DataX
+
+## 1.Introduction
+
+On the basis of Ali's open source DataX, TuGraph implements the support of writing plug-ins and jsonline data format, and other data sources can write data into TuGraph through DataX.
+DataX introduces reference [https://github.com/alibaba/DataX] (https://github.com/alibaba/DataX)
+Supported features include:
+
+- Import TuGraph from various heterogeneous data sources such as MySQL, SQL Server,Oracle, PostgreSQL, HDFS, Hive, HBase, OTS, ODPS, Kafka and so on. 
+  
+- Import TuGraph to the corresponding target source (to be developed)
+
+## 2.Compile and Install
+
+```bash
+git clone git@code.alipay.com:fma/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+The compiled DataX file is in the target directory
+
+## 3.Text data imported into TuGraph with DataX
+
+Using the data from the lgraph_import section of the TuGraph manual as an example, we have three csv data files, as follows:
+`actors.csv`
+
+```
+
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+
+```
+
+`movies.csv`
+
+```
+
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+
+```
+
+`roles.csv`
+
+```
+
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+
+```
+
+Then create three DataX job profiles:
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`/lgraph_server -c lgraph_standalone.json -d 'run'` 'Start TuGraph and run the following commands in sequence:
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## MySQL's data imported into TuGraph with DataX
+
+We create the following table of movies under 'test' database
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+Insert some data into the table
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+Create a DataX job configuration file
+
+`job_mysql_to_tugraph.json`
+
+**Configuring Field**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**Write simple sql**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` Start TuGraph and run the following command：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
new file mode 100644
index 0000000000..e9fd4bc8cd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
@@ -0,0 +1,146 @@
+# TuGraph Explorer
+
+TuGraph Explorer is strongly dependent on TuGraph, so before starting Explorer, we need to start TuGraph first.
+<a name="lGD6j"></a>
+
+## 1.Introduction
+
+TuGraph is a graph database independently developed by Ant Group, which provides graph database engine and graph analysis engine. Its main features are large data storage and computation, and it also supports efficient online transaction processing (OLTP) and Online analysis processing (OLAP).
+<a name="BOZFL"></a>
+
+## 2.Install TuGraph
+
+> Refer to the official documentation () for more information.
+
+TuGraph needs to be installed via Docker Image, follow these steps to install it locally:
+
+- install local Docker environment: reference[official documentation](https://docs.docker.com/get-started/);
+
+```shell
+$ sudo docker --version
+```
+
+If the above command can print the docker version number successfully, it indicates that the docker environment has been installed.
+
+- To download TuGraph images:[Download TuGraph Image](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.3.0/TuGraph-Image-3.3.0.tar.gz)
+
+Currently, TuGraph provides an image file based on Ubuntu 16.04 LTS and CenterOS 7.3. The image file is a compressed file named lgraph_x.y.z.ar, where x.y.z is the version number of TuGraph.
+
+- Load the TuGraph image:
+
+```shell
+// lgraph_lastest.tar.gz 是 TuGraph 镜像文件名
+$ docker import lgraph_lastest.tar.gz
+
+// After the loading is complete, a message is displayed indicating that the image has been loaded
+```
+
+- Start Docker
+
+```shell
+$ docker run -d -v {host_data_dir}:/mnt -p 7090:7090 -it reg.docker.alibaba-inc.com/tugraph/tugraph:x.y.z
+$ docker exec -it {container_id} bash
+
+// host_data_dir = /Users/moyee/tugraph
+// container_id = xxx
+$ docker run -d -v /Users/moyee/tugraph:/mnt -p 7090:7090 -it reg.docker.alibaba-inc.com/tugraph/tugraph:3.1.1
+$ docker exec -it xxx bash
+
+```
+
+Parameter Description
+
+- -v volume mapping
+- {host_data_dir} is a directory where the user wants to store data, such as/home/user1/workspace
+- -p The function of Docker is port mapping. The example maps Docker's port 7090 to the local port 7090
+- {container_id} is the container id of Docker, which can be obtained through docker ps
+
+<a name="LOzYE"></a>
+
+## 3.TuGraph operation
+
+<a name="zLris"></a>
+
+### 3.1.Start TuGraph Service
+
+```shell
+$ lgraph_server --license /mnt/fma.lic --config ~/demo/movie/lgraph.json
+```
+
+- fma.lic is the authorization file, should be placed in {host_data_dir} folder, mapped to the /mnt directory of docker
+- lgraph.json is the configuration file for TuGraph
+
+<a name="OUx1A"></a>
+
+### 3.2.TuGraph Browser Query
+
+TuGraph Browser Is a visual query tool provided by TuGraph. Users can open the browser, type {IP}:{Port}, enter the default username by 'admin', password by '73@TuGraph' to complete the login. Enter the TuGraph Query page after successful login.<br />![image.png](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+<a name="wGOCA"></a>
+
+## 4.Introduction to TuGraph Explorer
+
+TuGraph Explorer is a GraphInsight based visual graph analysis platform that provides complete graph exploration and analysis capabilities to help users gain valuable insights from massive graph data.
+
+<a name="uw3UH"></a>
+
+## 5.Start TuGraph Explorer
+
+Once TuGraph is installed successfully, you can start installing TuGraph Explorer.
+
+- Load TuGraph Explorer image：
+
+```shell
+// lgraph_lastest.tar.gz TuGraph image file name
+$ docker import tugraph_explore.tar.gz
+
+// After the loading is complete, a message is displayed indicating that the image has been loaded
+```
+
+- Start Docker
+
+```shell
+$ docker run -d -p 7091:7091 -it reg.docker.alibaba-inc.com/tugraph-explore:1.0.1
+$ docker exec -it {container_id} bash
+```
+
+Parameter Description:
+
+- -p The function of Docker is port mapping. In this example, Docker port 7091 is mapped to local port 7091
+- {container_id} is the id of a Docker container, which can be obtained through docker ps
+
+- Start TuGraph Explorer
+
+```shell
+$ cd /usr/src/tugraphexplore
+$ npm run dev -- -p 7091
+```
+
+After the TuGraph Explorer service started, it can be accessed through `**http://localhost:7091/tugraph/explore.html**` ，If everything is normal, you will see the following page.![image.png](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/tugraph-expolore/tugraph-explore-index.png)
+
+## 6.Connect TuGraph
+
+Once TuGraph Explorer is up, the first step is to connect to the TuGraph database. Click the "Connect" button to bring up the page for connecting to the Graph database, as shown in the image below.
+![image.png](https://gw.alipayobjects.com/mdn/rms_fa12c2/afts/img/A*JEUKRYMH--4AAAAAAAAAAAAAARQnAQ)
+
+To connect to TuGraph data, we need to provide the following information:
+
+- Graph database account
+- Graph database password
+- Address of the graph database: The format is ip:port
+
+**The IP address needs to be the container IP address, which can be queried by running the following command**。
+
+```
+$ docker run -d -v /Users/xx/tugraph:/mnt -p 7090:7090 -it reg.docker.alibaba-inc.com/tugraph/tugraph:3.3.0
+$ docker exec -it 8408b49033bc1698(TuGraph container) bash
+$ cat /etc/hosts
+127.0.0.1	localhost
+::1	localhost ip6-localhost ip6-loopback
+fe00::0	ip6-localnet
+ff00::0	ip6-mcastprefix
+ff02::1	ip6-allnodes
+ff02::2	ip6-allrouters
+172.17.0.4	8408b543243bc69
+```
+
+As shown above, the address to connect the graph database should be filled in:**172.17.0.4:7090**。
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md
new file mode 100644
index 0000000000..d20882d228
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md
@@ -0,0 +1,17 @@
+# Log
+
+> This document mainly introduces the logging function of TuGraph.
+
+## 1.Introduction
+
+TuGraph keeps two types of logs: server logs and audit logs. Server logs record human-readable server status information, while audit logs maintain encrypted information for every operation performed on the server.
+
+## 2.Server log
+
+Server logs track server status (such as server startup/stop), and the requests that the server has provided and their corresponding responses. The details of server logs can be configured using the 'verbose' option. The log location is specified in the 'log_dir' option.
+
+The default 'verbose' level is' 1 '. Under this level, the server only prints logs about major events, such as server startup/stop. Requests and responses are not logged at this level.
+
+## 3.Audit log
+
+Audit logs record each request and response, as well as the user who sent the request and when the request received. Audit logging can only be turned on or off. The results can be queried using the TuGraph visualization tool and the REST API.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst
new file mode 100644
index 0000000000..4be6ec9ad4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Ecosystem-Tools
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/1.cypher.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/1.cypher.md
new file mode 100644
index 0000000000..9014044c0b
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/1.cypher.md
@@ -0,0 +1,2530 @@
+# Cypher API
+
+> This document mainly introduces the detailed usage instructions of TuGraph-Cypher.
+
+## Table of contents
+- [1.Operators](#1operators)
+  - [1.1.Summary](#11summary)
+  - [1.2.General Operators](#12general-operators)
+  - [1.3.Mathematical Operators](#13mathematical-operators)
+  - [1.4.Comparison Operators](#14comparison-operators)
+  - [1.5.String Specific Comparison Operators](#15string-specific-comparison-operators)
+  - [1.6.Boolean Operators](#16boolean-operators)
+  - [1.7.String Operators](#17string-operators)
+  - [1.8.List Operators](#18list-operators)
+- [2.Clauses](#2clauses)
+  - [2.1.Summary](#21summary)
+  - [2.2.Match](#22match)
+  - [2.3.Return](#23return)
+  - [2.4.Where](#24where)
+  - [2.5.Skip](#25skip)
+  - [2.6.Limit](#26limit)
+  - [2.7.Create](#27create)
+  - [2.8.Callyield](#28callyield)
+  - [2.9.Union](#29union)
+- [3.Functions](#3functions)
+  - [3.1.Whole List of Functions](#31whole-list-of-functions)
+  - [3.2.Predicate Functions](#32predicate-functions)
+  - [3.3.Scalar Functions](#33scalar-functions)
+  - [3.4.Aggregating Functions](#34aggregating-functions)
+  - [3.5.List Funtions](#35list-funtions)
+  - [3.6.Mathematical Functions](#36mathematical-functions)
+- [4.Extensions to Opencypher](#4extensions-to-opencypher)
+- [5.Procedures](#5procedures)
+  - [5.1.Procedures Demos](#51procedures-demos)
+  - [5.2.Whole List of Procedures](#52whole-list-of-procedures)
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators support progress overview：
+
+| category                             | supported                                                                                                                                                       | unsupported                                 |
+| ------------------------------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------- |
+| General operators                    | <code>DISTINCT</code>, <code>.</code> for property access                                                                                                       | <code>[]</code> for dynamic property access |
+| Mathematical operators               | <code>+</code>, <code>-</code>, <code>\*</code>, <code>/</code>, <code>%</code>, <code>^</code>                                                                 |                                             |
+| Comparison operators                 | <code>=</code>, <code>&lt;&gt;</code>, <code>&lt;</code>, <code>&gt;</code>, <code>⇐</code>, <code>&gt;=</code>, <code>IS NULL</code>, <code>IS NOT NULL</code> |                                             |
+| String-specific comparison operators | <code>STARTS WITH</code>, <code>ENDS WITH</code>, <code>CONTAINS</code>, <code>REGEXP</code>                                                                    |                                             |
+| Boolean operators                    | <code>AND</code>, <code>OR</code>, <code>XOR</code>, <code>NOT</code>                                                                                           |                                             |
+| String operators                     | <code>+</code> for concatenation                                                                                                                                |                                             |
+| List operators                       | <code>+</code> for concatenation, <code>IN</code> to check existence of an element in a list, <code>[]</code> for accessing element(s)                          |                                             |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+  ```
+  CREATE (a:Person {name: 'Anne', eyeColor: 'blue'}),
+         (b:Person {name: 'Bill', eyeColor: 'brown'}),
+         (c:Person {name: 'Carol', eyeColor: 'blue'})
+  ```
+
+  ```
+  MATCH (p:Person ) RETURN DISTINCT p.eyeColor
+  ```
+
+- ✓ Accessing properties of a nested literal map using the `.` operator
+
+  ```
+  WITH {person: {name: 'Anne', age: 25}} AS p
+  RETURN p.person.name
+  ```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+  ```
+  CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+         (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+         (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+  ```
+  ```
+  MATCH (restaurant:Restaurant), (category:Category)
+  WHERE restaurant["rating_" + category.name] > 6
+  RETURN DISTINCT restaurant.name
+  ```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator `^`
+
+  ```
+  WITH 2 AS number, 3 AS exponent
+  RETURN number ^ exponent AS result
+  ```
+
+- ✓ Using the unary minus operator `-`
+  ```
+  WITH -3 AS a, 4 AS b
+  RETURN b - a AS result
+  ```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+  ```
+  WITH 4 AS one, 3 AS two
+  RETURN one > two AS result
+  ```
+
+### 1.5.String-specific comparison operators
+
+<span id="jump"></span>
+
+- ✓ Using STARTS WITH to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate STARTS WITH 'Jo'
+  RETURN candidate
+  ```
+
+- ✓ Using REGEXP to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate REGEXP 'Jo.*n'
+  RETURN candidate
+  ```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+  ```
+  WITH [2, 4, 7, 9, 12] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number = 4 OR (number > 6 AND number < 10)
+  RETURN number
+  ```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+  More details on string-specific comparison operators can be found [here](#jump)
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+  ```
+  RETURN [1,2,3,4,5]+[6,7] AS myList
+  ```
+- ✓ Using IN to check if a number is in a list
+
+  ```
+  WITH [2, 3, 4, 5] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number IN [2, 3, 8]
+  RETURN number
+  ```
+
+- ✓ Accessing elements in a list using the [] operator
+  ```
+  WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+  RETURN names[1..3] AS result
+  ```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses support progress list：
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>grammar</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="3"><p>Reading clauses</p></td>
+			<td><p>MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>OPTIONAL MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>MANDATORY MATCH</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="3"><p>Projecting clauses</p></td>
+			<td><p>RETURN … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>WITH … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>UNWIND … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="4"><p>Reading sub-clauses</p></td>
+			<td><p>WHERE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>ORDER BY [ASC[ENDING] / DESC[ENDING]]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>SKIP</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>LIMIT</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>Writing clauses</p></td>
+			<td><p>CREATE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>DETACH DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>SET</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>REMOVE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Reading/Writing clauses</p></td>
+			<td><p>MERGE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>CALL […YIELD]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Set operations</p></td>
+			<td><p>UNION</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>UNION ALL</p></td>
+			<td><p>supported</p></td>
+		</tr>
+	</tbody>
+</table>
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+    ```
+    MATCH (n)
+    RETURN n
+    ```
+  - ✓ Get all nodes with a label
+    ```
+    MATCH (movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Related nodes
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+  - ✓ Match with labels
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[]->(movie)
+    RETURN movie.title
+    ```
+  - ✓ Directed relationships and variable
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[r]->(movie)
+    RETURN type(r)
+    ```
+  - ✓ Match on relationship type
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})<-[:ACTED_IN]-(actor)
+    RETURN actor.name
+    ```
+  - ✓ Match on multiple relationship types
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[:ACTED_IN|:DIRECTED]-(person)
+    RETURN person.name
+    ```
+  - ✓ Match on relationship type and use a variable
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[r:ACTED_IN]-(actor)
+    RETURN r.role
+    ```
+
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+    ```
+    MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+    RETURN type(r)
+    ```
+  - ✓ Multiple relationships
+    ```
+    MATCH (charlie {name: 'Charlie Sheen'})-[:ACTED_IN]->(movie)<-[:DIRECTED]-(director)
+    RETURN movie.title, director.name
+    ```
+  - ✓ Variable-length relationships
+    ```
+    MATCH (martin {name: 'Charlie Sheen'})-[:ACTED_IN*1..3]-(movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Relationship variable in variable-length relationships
+    ```
+    MATCH p = (actor {name: 'Charlie Sheen'})-[:ACTED_IN*2]-(co_actor)
+    RETURN relationships(p)
+    ```
+  - ❏ Match with properties on a variable-length path
+    ```
+    MATCH p = (charlie:Person)-[* {blocked:false}]-(martin:Person)
+    WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+    RETURN p
+    ```
+  - ✓ Zero-length paths
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})-[*0..1]-(x)
+    RETURN x
+    ```
+  - ✓ Named paths
+
+    ```
+    MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+    ```
+
+  - ✓ Matching on a bound relationship
+
+    ```
+    MATCH (a)-[r]-(b)
+    WHERE id(r)= 0
+    RETURN a,b
+    ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (oliver:Person {name: 'Oliver Stone'}),
+    p = shortestPath((martin)-[*..15]-(oliver))
+    RETURN p
+    ```
+  - ✓ All shortest paths
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (michael:Person {name: 'Michael
+    Douglas'}), p = allShortestPaths((martin)-[*]-(michael))
+    RETURN p
+    ```
+
+- Get node or relationship by id
+
+  - ✓ Node by id
+    ```
+    MATCH (n)
+    WHERE id(n)= 0
+    RETURN n
+    ```
+  - ☒ Relationship by id
+    ```
+    MATCH ()-[r]->()
+    WHERE id(r) = 0
+    RETURN r
+    ```
+  - ✓ Multiple nodes by id
+    ```
+    MATCH (n)
+    WHERE id(n) IN [0, 3, 5]
+    RETURN n
+    ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+  ```
+  MATCH (n {name: 'B'}) RETURN n
+  ```
+
+  > **Note**
+  >
+  > Return `id` of n.
+
+- ✓ Return relationships
+
+  ```
+  MATCH (n {name: 'A'})-[r:KNOWS]->(c)
+  RETURN r
+  ```
+
+  > **Note**
+  >
+  > Return `EdgeUid` of r.
+
+- ✓ Return property
+  ```
+  MATCH (n {name: 'A'}) RETURN n.name
+  ```
+- ❏ Return all elements
+  ```
+  MATCH p = (a {name: 'A'})-[r]->(b)
+  RETURN *
+  ```
+- ❏ Variable with uncommon characters
+  ```
+  MATCH (`This isn\'t a common variable`)
+  WHERE `This isn\'t a common variable`.name = 'A'
+  RETURN `This isn\'t a common variable`.happy
+  ```
+- ✓ Aliasing a field
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age AS SomethingTotallyDifferent
+  ```
+- ✓ Optional properties
+  ```
+  MATCH (n)
+  RETURN n.age
+  ```
+- ❏ Other expressions
+
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age > 30, "I'm a literal", (a)-[]->()
+  ```
+
+  `(a)-[]->()` not supported.
+
+- ✓ Unique results
+  ```
+  MATCH (a {name: 'A'})-[]->(b)
+  RETURN DISTINCT b
+  ```
+
+### 2.4.WHERE
+
+- Basic usage
+
+  - ✓ Boolean operations
+    ```
+    MATCH (n)
+    WHERE n.name = 'Peter' XOR (n.age < 30 AND n.name = 'Tobias') OR NOT (n.name =
+    'Tobias' OR n.name = 'Peter')
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node label
+    ```
+    MATCH (n)
+    WHERE n:Swedish
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node property
+    ```
+    MATCH (n)
+    WHERE n.age < 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on relationship property
+    ```
+    MATCH (n)-[k:KNOWS]->(f)
+    WHERE k.since < 2000
+    RETURN f.name, f.age, f.email
+    ```
+  - ❏ Filter on dynamically-computed property
+    ```
+    WITH 'AGE' AS propname
+    MATCH (n)
+    WHERE n[toLower(propname)]< 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Property existence checking
+    ```
+    MATCH (n)
+    WHERE exists(n.belt)
+    RETURN n.name, n.belt
+    ```
+
+- String matching
+
+  - ✓ Match the beginning of a string
+    ```
+    MATCH (n)
+    WHERE n.name STARTS WITH 'Pet'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match the ending of a string
+    ```
+    MATCH (n)
+    WHERE n.name ENDS WITH 'ter'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match anywhere within a string
+    ```
+    MATCH (n)
+    WHERE n.name CONTAINS 'ete'
+    RETURN n.name, n.age
+    ```
+  - ✓ String matching negation
+    ```
+    MATCH (n)
+    WHERE NOT n.name ENDS WITH 's'
+    RETURN n.name, n.age
+    ```
+
+- Using path patterns in `WHERE`
+
+  - ✓ Filter on patterns
+    ```
+    MATCH (tobias {name: 'Tobias'}), (others)
+    WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+    RETURN others.name, others.age
+    ```
+  - ✓ Filter on patterns using NOT
+    ```
+    MATCH (persons), (peter {name: 'Peter'})
+    WHERE NOT (persons)-[]->(peter)
+    RETURN persons.name, persons.age
+    ```
+  - ✓ Filter on patterns with properties
+
+    ```
+    MATCH (n)
+    WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+    RETURN n.name, n.age
+    ```
+
+  - ✓ Filter on relationship type
+    ```
+    MATCH (n)-[r]->()
+    WHERE n.name='Andres' AND type(r) STARTS WITH 'K'
+    RETURN type(r), r.since
+    ```
+
+- Lists
+
+  - ✓ IN operator
+    ```
+    MATCH (a)
+    WHERE a.name IN ['Peter', 'Tobias']
+    RETURN a.name, a.age
+    ```
+
+- Missing properties and values
+
+  - ✓ Default to false if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white'
+    RETURN n.name, n.age, n.belt
+    ```
+  - ✓ Default to true if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+    ORDER BY n.name
+    ```
+  - ✓ Filter on null
+    ```
+    MATCH (person)
+    WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+    person.belt
+    ```
+
+- Using ranges
+
+  - ✓ Simple range
+    ```
+    MATCH (a)
+    WHERE a.name >= 'Peter'
+    RETURN a.name, a.age
+    ```
+  - ✓ Composite range
+    ```
+    MATCH (a)
+    WHERE a.name > 'Andres' AND a.name < 'Tobias'
+    RETURN a.name, a.age
+    ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 3
+  ```
+- ✓ Return middle two records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 1
+  LIMIT 2
+  ```
+- ✓ Using an expression with SKIP to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP toInteger(3*rand())+ 1
+  ```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT 3
+  ```
+- ✓ Using an expression with LIMIT to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT toInteger(3 * rand())+ 1
+  ```
+
+### 2.7.CREATE
+
+- Create nodes
+
+  > **Note**
+  >
+  > TuGraph does not support creating empty nodes and does not support multiple labels.
+
+  - ☒ Create single node
+    ```
+    CREATE (n)
+    ```
+  - ☒ Create multiple nodes
+    ```
+    CREATE (n), (m)
+    ```
+  - ✓ Create a node with a label
+    ```
+    CREATE (n:Person)
+    ```
+  - ☒ Create a node with multiple labels
+    ```
+    CREATE (n:Person:Swedish)
+    ```
+  - ✓ Create node and add labels and properties
+    ```
+    CREATE (n:Person {name: 'Andres', title: 'Developer'})
+    ```
+  - ✓ Return created node
+    ```
+    CREATE (a {name: 'Andres'})
+    RETURN a
+    ```
+
+- Create relationships
+
+  - ✓ Create a relationship between two nodes
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE]->(b)
+    ```
+  - ✓ Create a relationship and set properties
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE {name: a.name + '<->' + b.name}]->(b)
+    ```
+  - ✓ Create a full path
+    ```
+    CREATE p = (andres {name:'Andres'})-[:WORKS_AT]->(neo)<-[:WORKS_AT]-(michael {name:'Michael'})
+    RETURN p
+    ```
+
+- Use parameters with CREATE
+
+  - ❏ Create node with a parameter for the properties
+    ```
+    CREATE (n:Person $props)
+    RETURN n
+    ```
+  - ☒ Create multiple nodes with a parameter for their properties
+    ```
+    UNWIND $props AS map
+    CREATE (n)
+    SET n = map
+    ```
+    cannot create vertex without label.
+
+### 2.8.CALL\[…YIELD\]
+
+- ✓ Call a procedure using CALL
+  ```
+  CALL db.vertexLabels
+  ```
+- ✓ View the signature for a procedure
+  ```
+  CALL dbms.procedures() YIELD name, signature
+  WHERE name='dbms.listConfig'
+  RETURN signature
+  ```
+- ❏ Call a procedure using a quoted namespace and name
+  ```
+  CALL `db`.`vertexLabels`
+  ```
+- ✓ Call a procedure with literal arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+  ```
+- ❏ Call a procedure with parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+  ```
+- ❏ Call a procedure with mixed literal and parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+  ```
+- ✓ Call a procedure with literal and default arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+  ```
+- ✓ Call a procedure within a complex query using CALL…YIELD
+  ```
+  CALL db.vertexLabels() YIELD label
+  RETURN count(label) AS numLabels
+  ```
+- ✓ Call a procedure and filter its results
+  ```
+  CALL db.vertexLabels() YIELD label
+  WHERE label CONTAINS 'User'
+  RETURN count(label) AS numLabels
+  ```
+- ❏ Call a procedure within a complex query and rename its outputs
+  ```
+  CALL db.propertyKeys() YIELD propertyKey AS prop
+  MATCH (n)
+  WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+  ```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION ALL MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+- ❏ Combine two queries and remove duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION
+  MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>function</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="5"><p>Predicate functions</p></td>
+			<td><p>exists()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>all()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>any()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>single()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>none()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="14"><p>Scalar functions</p></td>
+			<td><p>id()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>properties()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>head()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>last()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toBoolean()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>toFloat()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toInteger()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toString()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>type()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>startnode()</p></td>
+            <td><p></p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>size()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>length()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>label()</p></td>
+            <td><p>OpenCypher extension method</p></td>
+		</tr>
+        <tr class="even">
+			<td rowspan="12"><p>Aggregating functions</p></td>
+			<td><p>avg()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>collect()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>count()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>max()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>min()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>percentileCont()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>percentileDisc()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>stDev()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>stDevP()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+                <td><p>variance()</p></td>
+                <td></td>
+            </tr>
+        <tr class="odd">
+                <td><p>varianceP()</p></td>
+                <td></td>
+            </tr>
+        <tr class="even">
+                <td><p>sum()</p></td>
+                <td></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>List functions</p></td>
+			<td><p>keys()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>labels()</p></td>
+			<td><p></p></td>
+		</tr>
+	<tr class="odd">
+			<td><p>nodes()</p></td>
+			<td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>range()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>subscript()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="6"><p>Mathematical functions</p></td>
+			<td><p>abs()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>ceil()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>floor()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>rand()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>round()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>sign()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>String functions</p></td>
+			<td><p>/</p></td>
+			<td></td>
+		</tr>
+	</tbody>
+</table>
+
+### 3.2.Predicate functions
+
+- exists()
+
+  judge it whether a vertex or edge has the field .
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE exists(n.belt)
+  RETURN n.name, n.belt
+  ```
+
+  **Example output:**
+
+  | exists(name) |
+  | ------------ |
+  | true         |
+
+### 3.3.Scalar functions
+
+- id()
+
+  get the id of vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  RETURN id(a)
+  ```
+
+  **Example output:**
+
+  | vid |
+  | --- |
+  | 1   |
+  | 2   |
+  | ... |
+
+- properties()
+
+  get a map containing all the properties of a node or relationship.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  CREATE (p:Person {name: 'Stefan', city: 'Berlin'})
+  RETURN properties(p)
+  ```
+
+  **Example output:**
+
+  | properties                |
+  | ------------------------- |
+  | {name:Stefan,city:Berlin} |
+
+- head()
+
+  get the first element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, head(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | head(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "one"         |
+
+- last()
+
+  get the last element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, last(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | last(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "three"       |
+
+- toFloat()
+
+  Converts an integer or string value to a floating point number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toFloat('11.5'), toFloat('not a number')
+  ```
+
+  **Example output:**
+  | float |
+  | ----- |
+  | 11.5 |
+  |null|
+
+- toInteger()
+
+  Converts a floating point or string value to an integer value.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toInteger('2.3') AS integer
+  ```
+
+  **Example output:**
+
+  | integer |
+  | ------- |
+  | 2       |
+
+- toString()
+
+  Converts an integer, float, boolean value to a string.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toString(2.3)
+  ```
+
+- type()
+
+  get the string representation of the relationship type.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name = 'Alice'
+  RETURN type(r)
+  ```
+
+  **Example output:**
+
+  | type     |
+  | -------- |
+  | acted_in |
+  | acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+
+  Returns the average of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN avg(n.age)
+  ```
+
+  **Example output:**
+
+  | avg(n.born)        |
+  | ------------------ |
+  | 1869.2661654135338 |
+
+- collect()
+
+  Returns a list containing the values returned by an expression.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN collect(n.age)
+  ```
+
+  **Example output:**
+
+  | collect(n.born) |
+  | --------------- |
+  | [1967,...]      |
+
+- count()
+
+  Returns the number of values or records.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n {name: 'A'})-[]->(x)
+  RETURN labels(n), n.age, count(*)
+  ```
+
+  **Example output:**
+
+  | labels(n)  | n.age | count(\*) |
+  | ---------- | ----- | --------- |
+  | ["Person"] | 13    | 3         |
+
+- max()
+
+  Returns the maximum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN max(n.age)
+  ```
+
+  **Example output:**
+
+  | max(n.age) |
+  | ---------- |
+  | 44         |
+
+- min()
+
+  Returns the minimum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN min(n.age)
+  ```
+
+  **Example output:**
+
+  | min(n.age) |
+  | ---------- |
+  | 13         |
+
+- percentileCont()
+
+  Returns the percentile of a value over a group using linear interpolation.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileCont(n.age, 0.4)
+  ```
+
+  **Example output:**
+
+  | percentileCont(n.age, 0.4) |
+  | -------------------------- |
+  | 29                         |
+
+* percentileDisc()
+
+  Returns the nearest value to the given percentile over a group using a rounding method.
+
+  **Scope:** whole instance.
+
+  **Output:** the percentile of the given value over a group.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileDisc(n.age, 0.5)
+  ```
+
+  **Example output:**
+
+  | percentileDisc(n.age, 0.5) |
+  | -------------------------- |
+  | 33                         |
+
+* stDev()
+
+  Returns the standard deviation for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDev(n.age)
+  ```
+
+  **Example output:**
+
+  | stDev(n.age)       |
+  | ------------------ |
+  | 15.716233645501712 |
+
+* stDevP()
+
+  Returns the standard deviation for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDevP(n.age)
+  ```
+
+  **Example output:**
+
+  | stDevP(n.age)      |
+  | ------------------ |
+  | 12.832251036613439 |
+
+* variance()
+
+  Returns the variance for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN variance(n.age)
+  ```
+
+  **Example output:**
+
+  | variance(n.age) |
+  | --------------- |
+  | 247             |
+
+* varianceP()
+
+  Returns the variance for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN varianceP(n.age)
+  ```
+
+  **Example output:**
+
+  | varianceP(n.age) |
+  | ---------------- |
+  | 164.66666666667  |
+
+* sum()
+
+  Returns the sum of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN sum(n.age)
+  ```
+
+  **Example output:**
+
+  | sum(n.age) |
+  | ---------- |
+  | 90         |
+
+### 3.5.List Funtions:
+
+- keys()
+
+  get the field names of some vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN keys(a)
+  ```
+
+  **Example output:**
+
+  | keys(a)               |
+  | --------------------- |
+  | ["name","age","eyes"] |
+
+- labels()/label()
+
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN labels(a)
+  ```
+
+  **Example output:**
+
+  | labels                 |
+  | ---------------------- |
+  | ["Person","Developer"] |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice'})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+### 3.6.Mathematical functions
+
+- abs()
+
+  get the absolute value of some data.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a), (e)
+  WHERE a.name = 'Alice' AND e.name = 'Eskil'
+  RETURN a.age, e.age, abs(a.age - e.age)
+  ```
+
+  **Example output:**
+
+  | a.age | e.age | abs(a.age - e.age) |
+  | ----- | ----- | ------------------ |
+  | 38    | 41    | 1                  |
+
+- ceil()
+
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+  **Example input:**
+
+  ```
+  RETURN ceil(0.1)
+  ```
+
+  **Example output:**
+
+  | ceil(0.1) |
+  | --------- |
+  | 1.0       |
+
+- floor()
+
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN floor(0.9)
+  ```
+
+  **Example output:**
+
+  | floor(0.9) |
+  | ---------- |
+  | 0.0        |
+
+- round()
+
+  Returns the value of a number rounded to the nearest integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN round(3.141592)
+  ```
+
+  **Example output:**
+
+  | round |
+  | ----- |
+  | 3     |
+
+- rand()
+
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN rand()
+  ```
+
+  **Example output:**
+
+  | rand()             |
+  | ------------------ |
+  | 0.9797131960534085 |
+
+- sign()
+
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN sign(-17), sign(0.1)
+  ```
+
+  **Example output:**
+
+  | sign(-17) | sign(0.1) |
+  | --------- | --------- |
+  | -1        | 1         |
+
+## 4.Extensions To OpenCypher
+
+- Number of Labels
+
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+
+  - OpenCypher: One node/relationship may have 0 to many labels.
+
+- Schema.
+
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.Procedures
+
+### 5.1.procedures' demos
+
+- dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                               | name            |
+  | --------------------------------------- | --------------- |
+  | db.vertexLabels() :: (label::STRING)    | db.vertexLabels |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels   |
+  | db.indexes() :: (index::LIST)           | db.indexes      |
+  | ...                                     | ...             |
+
+- db.vertexLabels()
+
+  Lists all available labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+
+  **Example output:**
+
+  | label   |
+  | ------- |
+  | genre   |
+  | keyword |
+  | movie   |
+  | ...     |
+
+- db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edgeLabels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | edgeLabel |
+  | --------- |
+  | acted_in  |
+  | directed  |
+  | ...       |
+
+- db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter     | parameter type | description                   |
+  | ------------- | -------------- | ----------------------------- |
+  | label_name    | string         | name of vertex label          |
+  | primary_field | string         | primary field of vertex label |
+  | field_spec    | list           | specification of a field      |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+  **Output:** If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added label [Person]
+  ```
+
+- db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description                   |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field             |
+  | type       | string     | type of the field             |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name         | type   | optional |
+  | ------------ | ------ | -------- |
+  | id           | INT32  | false    |
+  | born         | INT32  | true     |
+  | name         | STRING | true     |
+  | poster_image | STRING | true     |
+
+- db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | label_type | string         | either 'vertex' or 'edge'                                             |
+  | label_name | string         | name of the label                                                     |
+  | extra      | string         | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list           | specification of a field                                              |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.
+  for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+- db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:**
+
+  | field_name | field_type | description                      |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description                   |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string          | either 'vertex' or 'edge'     |
+  | label_name  | string          | name of the label             |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description               |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string         | either 'vertex' or 'edge' |
+  | label_name       | string         | name of the label         |
+  | field_value_spec | list           | specification of a field  |
+
+  in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, 'optional']`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+  | field_spec | list           | specification of a field  |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelModFields(
+  'vertex',
+  'new_label',
+  ['birth_date', 'DATETIME', '1900-01-01 00:00:00'],
+  ['gender', 'BOOL', false])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description              |
+  | ---------------- | -------------- | ------------------------ |
+  | label_name       | string         | name of the label        |
+  | edge_constraints | string         | edge constraints         |
+  | field_spec       | list           | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for optional fields.
+
+- `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32,true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+- db.addIndex(label_name, field_name, is_unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | is_unique  | boolean        | Specifies whether the index is unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+- dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description          |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string         | the current password |
+  | new_password     | string         | new password         |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string         | the user's name |
+  | new_password | string         | new password    |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.createUser(user_name, password)
+
+  create new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | ------------------------ |
+  | user_name | string         | the new user name        |
+  | password  | string         | the password of new user |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string         | the user name to be deleted |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string         | the user name               |
+  | is.admin  | boolean        | the permission of this user |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       | ...      |
+
+- dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description           |
+  | --------- | -------------- | --------------------- |
+  | user.user | string         | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+- dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+  a list of ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host         |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...          |
+
+- dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been deleted.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description                      |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string         | the name of new subgraph         |
+  | description | string         | description of new subgraph      |
+  | max_size_GB | integer        | Upper limit of subgraph capacity |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+  | config     | map            | the configuration to be modified     |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.listGraphs()
+
+  get all subgraph in this graph database .
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.config.list()
+
+  get some config of this graph database .
+
+  **Output:**
+
+  a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  | --------- | ------- |
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       | ...     |
+
+- dbms.config.update(updates)
+
+  get some config of this graph database .
+
+  **Output:**
+
+  If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+      enable_ip_check:false,
+      durable:true,
+      optimistic_txn:true,
+      enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+- dbms.takeSnapshot()
+
+  take the snapshot on this current graph database.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+- dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path                       |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+- algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                                                             |
+  | --------- | -------------- | --------------------------------------------------------------------------------------- |
+  | startNode | Node           | the source node of paths                                                                |
+  | endNode   | Node           | the destination node paths                                                              |
+  | config    | MAP            | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+  If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2         | 1         |
+
+- algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+- algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                               |
+  | --------- | -------------- | --------------------------------------------------------- |
+  | id        | ANY            | the id of vertexes or edges , the id must be variable     |
+  | config    | MAP            | the configuration of this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or it is an edge id.
+
+  **Output:**
+
+  If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.Whole List Of Procedures
+
+| Name                                  | Description                                                          | Signature                                                                                                                                                        |
+|---------------------------------------|----------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.vertexLabels                       | list all vertex labels                                               | db.vertexLabels() :: (label::STRING)                                                                                                                             |
+| db.edgeLabels                         | list all edge labels                                                 | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                          |
+| db.indexes                            | list all indexes                                                     | db.indexes() :: (label::STRING,field::STRING,unique::BOOLEAN)                                                                                                    |
+| db.warmup                             | warm up the DB                                                       | db.warmup() :: (time_used::STRING)                                                                                                                               |
+| db.createVertexLabel                  | create a vertex label                                                | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                           |
+| db.createLabel                        | create a vertex/edge label                                           | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                      |
+| db.getLabelSchema                     | get the schema of label                                              | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                        |
+| db.getVertexSchema                    | get the schema of vertex label                                       | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                               |
+| db.getEdgeSchema                      | get the schema of edge label                                         | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                 |
+| db.deleteLabel                        | delete vertex/edge label                                             | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                |
+| db.alterLabelDelFields                | delete some fields of a label on a subgraph                          | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                     |
+| db.alterLabelAddFields                | add some fields of a label on a subgraph                             | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                          |
+| db.alterLabelModFields                | modify some fields of a label on a subgraph                          | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                |
+| db.createEdgeLabel                    | create a edge label                                                  | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                              |
+| db.addIndex                           | add an index                                                         | db.addIndex(label_name::STRING,field_name::STRING,is_unique::BOOLEAN) :: (::VOID)                                                                                |
+| db.deleteIndex                        | delete an index                                                      | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                |
+| db.backup                             | backup the db                                                        | db.backup(destination::STRING) :: ()                                                                                                                             |
+| dbms.procedures                       | list all procedures                                                  | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                            |
+| dbms.security.changePassword          | change current user password                                         | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                          |
+| dbms.security.changeUserPassword      | change user password                                                 | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                             |
+| dbms.security.createUser              | create an account                                                    | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                         |
+| dbms.security.deleteUser              | delete an account                                                    | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.listUsers               | list all accounts                                                    | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                  |
+| dbms.security.showCurrentUser         | get current user name                                                | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                        |
+| dbms.security.getUserPermissions      | get the permissions of a specified user                              | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                          |
+| dbms.graph.createGraph                | create a subgraph                                                    | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                |
+| dbms.graph.modGraph                   | modify the config of a subgraph                                      | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                  |
+| dbms.graph.deleteGraph                | delete a subgraph                                                    | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                           |
+| dbms.graph.listGraphs                 | list all subgraphs                                                   | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                               |
+| dbms.graph.getGraphInfo               | get the information of a specified graph                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                             |
+| dbms.security.addAllowedHosts         | add to the trust list                                                | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                 |
+| dbms.security.deleteAllowedHosts      | remove from the trust list                                           | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                      |
+| dbms.security.listAllowedHosts        | list the trust list                                                  | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                               |
+| dbms.config.update                    | update the configuration                                             | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                            |
+| dbms.config.list                      | list the configuration                                               | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                  |
+| algo.shortestPath                     | get a shortest path between two vertexes                             | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                            |
+| algo.allShortestPaths                 | get all the shortest paths between two vertexes                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                             |
+| algo.native.extract                   | get the field values of a list of vertexes or edges specified id     | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                         |
+| db.flushDB                            | flush the db                                                         | db.flushDB() :: (::VOID)                                                                                                                                         |
+| dbms.security.listRoles               | list all roles                                                       | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                  |
+| dbms.security.createRole              | create a role                                                        | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                             |
+| dbms.security.deleteRole              | delete a role                                                        | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.getRoleInfo             | get the role information                                             | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                      |
+| dbms.security.disableRole             | enable/disable the role                                              | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.modRoleDesc             | modify the description of a role                                     | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.rebuildRoleAccessLevel  | rebuild the user subgraph access rights                              | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                 |
+| dbms.security.modRoleAccessLevel      | modify the user subgraph access rights                               | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                     |
+| dbms.security.modRoleFieldAccessLevel | modify the user property access rights                               | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)          |
+| dbms.security.getUserInfo             | get the user information                                             | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                      |
+| dbms.security.getUserMemoryUsage      | get the memory usage for a user                                      | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                        |
+| dbms.security.disableUser             | enable/disable the user                                              | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.setCurrentDesc          | set the current user description                                     | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.setUserDesc             | set user description                                                 | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.setUserMemoryLimit      | set user memory limit                                                | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                  |
+| dbms.security.deleteUserRoles         | delete roles from the user                                           | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                              |
+| dbms.security.rebuildUserRoles        | rebuild the relationship between the user and the role               | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                             |
+| dbms.security.addUserRoles            | add the user roles                                                   | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                 |
+| db.plugin.loadPlugin                  | load a plugin                                                        | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN) :: (::VOID) |
+| db.plugin.deletePlugin                | unload a plugin                                                      | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                      |
+| db.plugin.listPlugin                  | list all plugins                                                     | db.plugin.listPlugin(plugin_type::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | get the information of a specified plugin                            | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                   |
+| db.plugin.callPlugin                  | execute the plugins                                                  | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)             |
+| db.importor.dataImportor              | import vertex/edge data                                              | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                      |
+| db.importor.schemaImportor            | import vertex/edge schema                                            | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                      |
+| dbms.meta.count                       | get the total number of vertex and edge                              | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                          |
+| dbms.meta.countDetail                 | get the number of vertex and edge for each label                     | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                |
+| dbms.meta.refreshCount                | recount the number of vertex and edge, stop writing during the count | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                          |
+| dbms.task.listTasks                   | list running tasks                                                   | dbms.task.listTasks()::(tasks::LIST)                                                                                                                             |
+| dbms.task.terminateTask               | terminate task                                                       | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                               |
+| dbms.ha.clusterInfo                   | get cluster info in HA mode                                          | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                |
+| db.dropDB                             | empty the db                                                         | db.dropDB() :: (::VOID)                                                                                                                                          |
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..f93f48839a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
@@ -0,0 +1,214 @@
+# Bootstrap program
+
+>This document is a bootstrap program designed for TuGraph users. Before reading the detailed documents, users should read this document first to have a general understanding of TuGraph's graph computing operation process, and it will be more convenient to read the detailed documents later. The bootstrap program is a simple instance of a bfs (breadth-first search) program based on Tugraph, and we will focus on how it is used.
+
+## 1.Introduction to TuGraph-Graph Analysis Engine
+
+TuGraph's graph analysis engine is mainly used for full graph/full data analysis tasks. With the help of TuGraph's C++ / Python graph analysis engine API, users can quickly derive a complex subgraph from different data sources, and then run iterative graph algorithms such as PageRank, LPA, WCC on the subgraph, and finally make corresponding countermeasures according to the running results.
+
+In TuGraph, the process of both exporting and computing can be accelerated by in-memory parallel processing, resulting in near-real-time processing and analysis. Compared to traditional methods, this approach can avoid the overhead of data export and disk drop, and can achieve ideal performance by using a compact graph data structure.
+
+TuGraph has 6 built-in algorithms in the community version and 25 built-in algorithms in the commercial version. Users hardly need to implement the specific graph calculation process themselves. For details, please refer to algorithms.md.
+
+According to different data sources and implementations, it can be divided into Procedure, Embed and Standalone, which all inherit from OlapBase API. OlapBase API interface documentation can be found in OlAPBase-APi.md.
+
+The data source of Procedure and Embed is the db data preloaded in the graph database, which can be compiled to generate the.so file used by TuGraph-Web loading and the embed file used by the background terminal respectively. The input graph data are loaded in the form of db. The interface document can refer to olapondb-api.md.
+
+Standalone is used to compile and generate a standalone file. Different from the former, the input graph data of the file is loaded in the form of txt, binary, and ODPS files, and the interface document can refer to olapondisk-api.md.
+
+## 2.Procedure compile and run
+
+This mode is mainly used for visual loading and running on the TuGraph-web interface. The usage method is as follows:
+
+### 2.1.C++
+Run bash make_so.sh bfs in the TuGraph/plugins directory to the BFs.so file in the TuGraph/plugins directory, upload the file as a plug-in to Tugraph-web, input parameters and then execute.
+
+### 2.2.Python
+Upload the python file as a plugin to TuGraph-web, and execute it after inputting parameters.
+
+Example:
+Compile the.so algorithm file at TuGraph/plugins
+`bash make_so.sh bfs`
+
+After loading the bfs.so (or TuGraph/plugins/cython/bfs.py) file as a plug-in to TuGraph-web, enter the following json parameters:
+
+```json
+{
+  "root_id": "0",
+  "label": "node",
+  "field": "id"
+}
+```
+
+The following result
+
+result:"{"core_cost":0.013641119003295898,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":8.821487426757813e-06,
+"prepare_cost":0.03479194641113281,
+"total_cost":0.04844188690185547}"
+
+The output ：
+
+- num_edges: the number of edges in the graph
+- num_vertices: the number of nodes in the graph
+- prepare_cost: Represents the time required for the preprocessing phase. The preprocessing phase works: loading parameters, graph data loading, index initialization.
+- core_cost: Represents the time required for the algorithm to run.
+- found_vertices: Number of vertices found.
+- output_cost: the time it takes for the algorithm result to be written back to db.。
+- total_cost: The overall running time of the algorithm is executed.
+
+make_so.sh This file is used to compile the graph algorithm files involved in TuGraph-OLAP into a.so file available for TuGraph-web.
+
+## 3.Embed compile and run
+
+This way is mainly used for TuGraph in the background program on the preloaded db graph data algorithm analysis. Its use method is as follows:
+
+To complete the embed_main.cpp file in TuGraph/plugins directory, add the data name, input parameters, data path and other information, as shown in the following example:
+
+### 3.1.C++
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path Specifies the path for saving the preloaded graph data
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // Specifies the name of the graph
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // Enter the algorithm parameters in json format
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+
+Run bash make_so.sh bfs in TuGraph/plugins to bfs_procedure in TuGraph/plugins/cpp.
+`bash make_embed.sh bfs`
+
+Do this in the TuGraph/plugins folder
+`./cpp/bfs_procedure`
+The result is returned.
+
+Input: {"root_id":"0", "label":"node","field":"id"}
+found_vertices = 3829
+{"core_cost":0.025603055953979492,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":9.059906005859375e-06,
+"prepare_cost":0.056738853454589844,
+"total_cost":0.0823509693145752}
+
+`Input` indicates the input parameters.The other parameters are described as above.
+
+### 3.2.Python
+
+To compile bfs.so, run `bash make_cython_so.sh bfs` in TuGraph/plugins or `python3 setup.py build_ext -i` in TuGraph/plugins/cython.
+
+After obtaining bfs.so, it can be imported and used in Python, as shown in TuGraph/plugins/embed_main.py:
+
+```python
+# TuGraph/plugins/embed_main.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+
+# shell
+python3 embed_main.py
+```
+The output is the same as C++
+
+
+## 4.Standalone compile and run
+
+This file is mainly used to load the graph data directly at the terminal and run the printout results. Here's how to use it:
+
+In TuGraph/build directory `make bfs_standalone` (need to include boost/sort/sort.hpp in the g++ default include path) can get bfs_standalone file, the file is generated with TuGraph/build/output/algo folder.
+
+Run: Go to the TuGraph/build directory and do`./output/algo/bfs_standalone -- type [type] -- input_dir [input_dir] --id_mapping [id_mapping] -- vertices [vertices] --root (root) - output_dir [output_dir]`
+
+Ready to run.
+
+- `[type]` : indicates the type source of the input graph file, including text file, BINARY_FILE binary file, and ODPS source.
+
+- `[input_dir]` : indicates the path of the input graph file folder, which may contain one or more input files. TuGraph will read all the files under [input_dir] when reading the input file. It is required that [input_dir] can only contain the input file and cannot contain other files. Parameters cannot be omitted.
+
+- `[id_mapping]`：When reading the side table, whether to do id mapping for the input data to make it conform to the form of algorithm operation. 1 is required for id mapping, 0 is not required. This process will take some time. The parameter can be omitted, and the default value is 0.
+
+- `[vertices]` : represents the number of vertices in the graph. 0 indicates the number of vertices that the user wants the system to automatically recognize. When is non-zero, it indicates the number of vertices that the user wants to customize. The number of user-defined vertices must be greater than the maximum vertex ID. This parameter can be omitted. The default value is 0.
+
+- `[root]` : indicates the starting vertex id for bfs. The argument cannot be omitted.
+
+- `[output_dir]` : indicates the path of the folder where the output data is saved. The output content is saved to this file, and the parameter cannot be omitted.
+
+Example
+
+### 4.1.C++
+
+Compile the standalone algorithm program at TuGraph/build
+
+```shell
+make bfs_standalone
+```
+
+Run the text source file in TuGraph/build/output
+
+```
+    ./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+Result：
+
+```
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+Result Parameter description is the same as above.
+
+If you do not know the required parameters of a new algorithm, run the`./output/algo/bfs_standalone -h` to view the parameters.
+
+### 4.2.Python
+The bfs extension compilation process of the Python language is the same as that of the embed mode. It is called through the `Standalone` interface at runtime. The example is as follows:
+
+```python
+# TuGraph/plugins/standalone_main.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(
+        input_dir="../test/integration/data/algo/fb_unweighted",
+        root=0)
+
+# shell
+python3 standalone_main.py
+```
+
+At this point, the process of bfs operation on the figure above by TuGraph is complete.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..85a8b51db4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
@@ -0,0 +1,195 @@
+# OlapBase API
+
+> This document will introduce how to use the OlapBase API
+
+## 1.The overview
+
+This manual will introduce the configuration of the TuGraph graph computing system. Combined with the code, several important files and interfaces in TuGraph are introduced.
+
+## 2.Configuration requirements
+
+To develop and compile applications using the TuGraph graph computing system, the configuration required:
+
+- linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+
+- Compiler that supports C++ 14, requires GCC version 5.4.1 or later.
+
+## 3.Atomic operations
+
+TuGraph uses multi-threading technology for batch operations, in which case memory access conflicts may occur. In order to ensure the correctness of modification operations in parallel computing, TuGraph implements atomic operations. The code section can be found in the lgraph_atomic.cpp file under the lgraph folder.
+
+TuGraph also customizes 4 commonly used atomic operations. When we need to modify the data of vertices in multithreaded mode, we should use atomic operations to ensure the correctness of the modification operation in parallel environment. In addition to these four atomic operations, users can also use "cas" to build their own atomic operation functions.
+
+- `bool cas(T \* ptr, T oldv, T newv)` : If the value pointed to by ptr is equal to oldv, the value pointed to by ptr is assigned to newv and returns true. Otherwise, false is returned
+- `bool write_min(T \*a, T b)` : If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `bool write_max(T \*a, T b)` : If b is larger than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `void write_add(T \*a, T b)` : adds the value of b to the value pointed to by a.
+- `void write_sub(T \*a, T b)` : subtract the value of b from the value pointed to by a.
+
+## 4.Vertex Class ParallelBitset
+
+When using TuGraph for batch operations, you need to use a vertex set to represent the vertices you want to process. ParallelBitset implements a vertex collection class that represents vertices in bits and thus saves a significant amount of memory. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 4.1ParallelBitset Class
+
+- `size_t Size()`：Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size_t size)`：Initialize size and data, the length of data is (size >> 6)+1.
+- `void Clear()`：clears the collection.
+- `void Fill()`：add all vertices to the set.
+- `bool Has(size_t i)`：check if vertex i is in the set.
+- `bool Add(size_t i)`：add vertex i to the set.
+- `void Swap(ParallelBitset &other)`：exchange elements with another set of ParallelBitset.
+
+## 5.Vertex Array Class ParallelVector
+
+When using TuGraph for batch operations, you need to use an array of vertices to represent the result of processing vertices. ParallelVector implements the vertex array class. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 5.1.ParallelVector Class
+
+- `ParallelVector(size_t capacity)` Builds ParallelVector. capacity is the initial size of the vertex array
+- `T& operator[](size_t i)` : data with subscript i
+- `T \*begin()` : ParallelVector the starting pointer
+- `T \*end()` : ParallelVector the end pointer to Parallelvector. begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to access an array sequentially
+- `T&Back ()` : ParallelVector the last data
+- `T \*Data()` : represents the data in the array itself
+- `void Destroy()' : empty the ParallelVector array and delete the array
+- `size_t Size()` : indicates the number of data in ParallelVector
+- `void Resize(size_t size)` : Change ParallelVector to size, which must be greater than or equal to the size before the change
+- `void Clear()` : empty the data in ParallelVector
+- `void ReAlloc(size_t capacity)` : ParallelVector is allocated with new capacity. If data exists in the array, it is migrated to the new memory
+- `void Fill(T elem)` : Assign elem to all data on ParallelVector
+- `void Append(const T&elem, bool atomic = true)` : Add a piece of data at the end of ParallelVector
+- `void Swap(ParallelVector<t> &other)` : to exchange data with other parallelvectors</t>
+- `ParallelVector<t> Copy()` : copies the current ParallelVector data into the Copy array</t>
+
+## 6.Customize data structures
+
+### 6.1.Basic data types
+
+We customize the data structure representation of points and edges to save memory space while covering all vertices:
+
+- 'Empty' : indicates a special data type with empty content.
+
+### 6.2.Combining data structures
+
+In order to facilitate calculation, we define several data structures of point and edge data according to different calculation scenarios, which are as follows:
+
+- `EdgeUnit<edgedata>` : represents an edge of weight type EdgeData, used to parse the input file, and contains three member variables:</edgedata>
+- `size_t src` : the starting vertex of an edge
+- `size_t dst` : the end of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjUnit<edgedata>` : represents an edge of weight type EdgeData, used during batch computation, and contains two member variables:</edgedata>
+- `size_t neighbour` : indicates the neighbor vertex of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjList<edgedata>` : Adjacency list of vertices with weights of type EdgeData, often used to represent the set of incoming and outgoing edges of vertices and containing two member variables:</edgedata>
+- `AdjUnit<t> \* begin` : indicates the start pointer of the list</t>
+- `AdjUnit<t> \* end` : The end pointer of the list.</t> begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to loop through the adjacency list.
+
+## 7.Graph class OlapBase
+
+Graph class OlapBase is the main class for TuGraph to load graphs and calculate graphs. OlapBase is commonly used to represent graphs with weights of type EdgeData. See olap_base.hpp under lgraph folder for the code. This chapter covers the types and API interfaces commonly used in Graph classes. The classes used by the Procedure, Embed, and Standalone functions described above are all subclasses of this class.
+
+### 7.1.Basic Information
+
+- `size_t NumVertices()` : obtains the number of vertices
+
+- `size_t NumEdges()` : Gets the number of edges
+
+- `size_t OutDegree(size_t vid)` : indicates the outdegree of the vid of the vertex
+
+- `size_t InDegree(size_t vid)` : indicates the input degree of vertex vid
+
+### 7.2.node sets and edge sets and their related operations
+
+- `ParallelVector AllocVertexArray()` : Allocates an array of type VertexData with size as the number of vertices
+
+- `void fill_vertex_array(V \* array, V value)` : assigns values to all elements in the array
+
+- `ParallelBitset AllocVertexSubset()` : Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+
+- `AdjList OutEdges(size_t vid)'`: gets the set of all outgoing edges of vertex v
+
+- `AdjList InEdges(size_t vid)` : Obtains the set of all incoming edges of vertex v
+
+- `void Transpose()` : transpose of a directed graph
+
+- `LoadFromArray(char \* edge_array, VertexId input_vertices, EdgeId input_edges, EdgeDirectionPolicy (edge_direction_policy) `: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+`edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+`input_vertices`: specifies the number of vertices read into the graph by the array.
+
+`input_edges` : specifies the number of edges that the array reads into the image.
+
+`edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+### 7.3.Locking mechanism
+
+TuGraph implements a pair of locks to control the program's access to vertex data. Respectively is:
+
+- `void AcquireVertexLock(size_t vid)` : locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(size_t vid)` : unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+- `VertexLockGuard GuardVertexLock(size_t vid)` : When the vid operation is performed, the vertex vid is locked, and the lock is automatically released upon exiting the scope
+
+### 7.4.Batch Processing Operations
+
+TuGraph provides two batch operations to do a point-centered batch process in parallel. Respectively is:
+
+```c++
+/*
+    Function Name:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    The work function executes the work function on nodes whose numbers are between lower and upper in the Graph. The fourth parameter indicates the accumulated base, which defaults to 0.The fifth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+For details, please refer to include/lgraph/olap_base.h
+
+    Example: Count the number of vertices in the parent array that have outgoing edges
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+graph is the instantiated object of graph class OlapBase
+
+```C++
+/*
+    Function Name:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    Function: Execute the work function for the node that corresponds to 1 in active_vertices. The third parameter represents the cumulative cardinality, which is 0 by default.
+
+    The fourth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+
+    For specific implementation, please refer to the specific code in /include/lgraph/olap_base
+
+
+
+    Example: Output all the out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..6015d7e1ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,303 @@
+# OlapOnDB API
+
+> This document provides detailed instructions for using the OlapOnDB API
+
+## 1.Introduction
+
+Generally speaking, users need to implement the process of subgraph extraction by themselves. Then use the rich interface in TuGraph to implement your own graph analysis algorithm.
+
+This document mainly introduces the Procedure and Embed interface design, and introduces some common interface, specific interface information see include/lgraph/olap_on_db.h file.
+
+## 2.Schema
+
+Procedure and Embed auxiliary functions are mainly included in the OlapOnDB class, and some more frequently used functions will be introduced one by one
+
+OLAP is associated with the following common data structures in TuGraph:
+
+1. DB graph analysis class `OlapOnDB`
+
+2. Vertex array `ParallelVector`
+
+3. Vertex set `ParallelBitset`
+
+4. Side data structure `AdjUnit/AdjUnit`
+
+5. Edge collection data structure `AdjList`
+
+### 2.1.Snapshot Based Storage Structure
+
+The OlapOnDB class in TuGraph provides a data "snapshot," that is, a fully usable copy of a given data set that includes a mirror image of the corresponding data at a certain point in time (the point at which the copy was started). Because OLAP operations involve only reads and not writes, OlapOnDB arranges data in a more compact manner, saving space while improving data access locality.
+
+### 2.2.BSP Calculation Model
+
+TuGraph uses the BSP (Bulk Synchronous Parallel) model in the process of calculation, which makes the process can be executed in parallel, and greatly improves the efficiency of the program.
+
+The core idea of BSP calculation model is to propose and use Super Step. After OlapOnDB is created, the computation on this data is divided into multiple supersteps, such as PageRank, which is divided into multiple iterations, and each iteration is a Super Step. There is explicit synchronization between different Super Steps to ensure that all threads proceed to the next Super Step at the same time after completing the same superstep. Within a Super Step, all threads execute asynchronously, using parallelism to improve computational efficiency.
+
+BSP calculation model can effectively avoid deadlock, and achieve coarse-grained global synchronization in hardware mode by means of obstacle synchronization, so that graph computation can be executed in parallel, and programmers do not need to spend much time on synchronization mutual exclusion.
+
+## 3.Algorithm example
+
+Here is an explanation of the PageRank algorithm, which is mainly divided into the main function Process and the PageRank algorithm process function.
+
+### 3.1.Main function
+
+The main function has three input parameters, 'TuGraph' database parameter 'db', the request 'request' obtained from the web side, and the return value 'response' given to the web side. The overall process can be divided into the following steps:
+
+1. Obtain related parameters
+
+2. Create a snapshot class
+
+3. Main process of PageRank algorithm
+
+4. Obtain and send the return value of the web page
+
+```c
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+
+    // Obtain the number of iterations from web side requests (num_iterations)，
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // Read transaction creation and snapshot class creation
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+
+    // Create a pr array to store the pr value for each node
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank algorithm main process, obtain the pagerank value of each node
+    PageRankCore(olapondb, num_iterations, pr);
+
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        Function Purpose: Gets the number of the node with the largest pagerank among all nodes
+
+        Function flow description: This function executes Func A for node vi (also known as the active vertices) corresponding to all bits of 1 in the vertex set all_vertices. The return value of Func A is then used as the second input parameter of Func B to obtain the local maximum value (because the first input parameter is 0. So the return value is actually the pagerank value of each node). Finally, the return value of all threads is summarized, and Func B is executed again to get the global return value, and stored in the max_pr_vi variable
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+
+    // Retrieve and send the return value from the web page
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2.PageRank Algorithm process
+
+`pagerank` main process has two input parameters, snapshot class (subgraph) and iteration times, the overall process can be divided into the following steps:
+
+1. Initialization of related data structures
+2. Initialize the pagerank value of each node
+3. Calculation of pagerank value of each node, active vertices for all vertices (means that all vertices need to calculate pagerank value)
+4. Obtain the pagerank value after 'num_iterations' of each node
+
+```c
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+
+    // Initialization of related data structures
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // The initialization of the pagerank value of each node is inversely proportional to the degree of the node
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // Total iteration process
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            Function Purpose: Calculates the pagerank of all nodes
+
+            Function flow description: This function is used to calculate the pagerank value of all nodes. Execute Func C on node vi corresponding to all the bits of 1 in all_vertices to obtain the pagerank value of vi in the current iteration and return the pagerank change value of vi node. The total change value of all active nodes is finally summarized and returned through the internal processing of the function, which is stored in the delta variable
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // Gets the pagerank value of the current node from its neighbor
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank value calculation core formula
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+
+                    // Statistics of relevant intermediate variables
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // The pagerank value obtained in this iteration is output as the input of the next iteration
+        curr.Swap(next);
+    }
+}
+```
+
+### 4.1.Transaction creation
+
+```c
+// Create a read transaction
+auto txn = db.CreateReadTxn();
+
+// Write transaction creation
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2.Parallelization to create a directed graph
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3.Create undirected graphs in parallel
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED;
+)
+```
+
+### 4.4.Obtain the output degree
+
+```c
+size_t OutDegree(size_t vid)
+```
+
+### 4.5.Obtain the input degree
+
+```c
+size_t InDegree(size_t vid)
+```
+
+### 4.6.Gets the outgoing edge set
+
+```c
+/*
+    Function name: AdjList OutEdges(size_t vid)
+
+    Data structure:
+
+    An AdjList can be understood as an array of structures of type AdjUnit
+
+    AdjUnit has two member variables: 1. size_t neighbour 2. edge_data: neighbour indicates the number of the target node pointed by the outgoing edge. If the value is a licensed graph, the data type of edge_data is the same as the weight value of the edge in the input file
+
+    Example Output all outgoing neighbors of node vid
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7.Gets the incoming edge set
+
+```c
+AdjList<edgedata> InEdges(size_t vid)</edgedata>
+
+// Example: Outputs all inbound neighbors of node vid
+for (auto & edge : olapondb.InEdges(vid)) {
+size_t dst = edge.neighbour;
+printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8.Get the node ID of OlapOnDB corresponding to the node in TuGraph
+
+```c
+size_t OriginalVid(size_t vid)
+
+// Note: The node numbers entered in TuGraph can be non-numbers, such as names. When OlapOnDB subgraphs are generated, names and other names will be converted to numbers for subsequent processing. Therefore, this method may not be applicable to some specific scenarios
+```
+
+### 4.9.Gets the node number of TuGraph corresponding to a node in OlapOnDB
+
+```c
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10.Description of active vertices
+
+Active vertices refer to the vertices that need to be processed in the batch function. In this example, we simply output the number of active vertices and summarize the number of active vertices:
+
+```c
+ParallelBitset temp = 000111; // The current active vertices are vertices 3, 4 and 5
+
+size_t delta = ForEachActiveVertex<double>(</double>
+//void c
+[&](size_t vi) {
+printf("active_vertexId = %lu\n",vi);
+return 1;
+},
+all_vertices
+);
+```
+
+The result of this function is obvious. Because of multiple threads, the output order may vary:
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+The local return value is 1. This function will add all the local return values in a thread-safe manner to the final return value, which is stored in the delta variable, and the final value is 3
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..bb3c784f13
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,213 @@
+# OlapOnDisk API
+
+> This document mainly introduces the usage instructions of OlapOnDisk API in detail
+
+## Table of contents
+
+- [1. Introduction](#1introduction)
+- [2. Algorithm Example](#2algorithm-example)
+     - [2.1 header files](#21head-file)
+     - [2.2 Configuration class MyConfig](#22configuration-class-myconfig)
+     - [2.3 Main function](#23main-function)
+     - [2.4 bfs algorithm flow](#24bfs-algorithm-process)
+- [3. Function description of other commonly used functions](#3description-of-other-commonly-used-functions)
+     - [3.1 Image Loading](#31graph-load)
+     - [3.2 Image writing](#32graph-write)
+     - [3.3 Graph Analysis Function](#33graph-parse-function)
+    
+### 1.Introduction
+
+The Standalone mode of TuGraph can be used to load graph data files, where the sources of graph data files can include text files, BINARY_FILE binary files, and ODPS sources. In this mode, TuGraph can quickly load multiple data sources into a graph, and then run iterative algorithms such as BFS, WCC, SSSP, etc. on the graph, and output the final result to the terminal.
+
+In TuGraph, the export and calculation process can be accelerated through parallel processing in memory, so as to achieve near real-time processing and analysis. Compared with traditional methods, it avoids the overhead of data export and storage, and can use compact Graph data structures achieve desirable performance for computation.
+
+TuGraph has built-in a large number of common graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement the specific graph calculation process by themselves. They only need to include the header file (.h) of the corresponding algorithm library when implementing their own stored procedures. To your own program, and link your own dynamic library files in the compilation phase.
+
+This document mainly introduces the common interfaces of Standalone, and the auxiliary functions used are mainly contained in the OlapOnDB class. At the same time, in order to help users understand and facilitate, the BFS algorithm is illustrated with examples.
+
+### 2.Algorithm example
+
+Here, the BFS algorithm is explained in blocks, which are roughly divided into the main function `main`, the BFS algorithm process `BFSCore` function and the configuration class MyConfig.
+
+#### 2.1.Head file
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //Header files to include when using TuGraph
+#include "./algo.h"   //A header file containing various algorithmic logic functions
+```
+
+When using TuGraph to realize the calculation application of graph data files, generally, the StandaloneGraph class object graph is first created, the graph file data is loaded into the graph, and then the graph calculation process is realized by calling the graph logic function, and finally the result of the graph calculation is printed out.
+
+#### 2.2.Configuration class MyConfig
+
+The MyConfig configuration class function is used to provide the configuration information required for the algorithm logic calculation, inherited from ConfigBase<EdgeData>, where EdgeDate can choose Empty (unweighted graph), int (the weight of the weighted graph is an integer) or double (the weight of the weighted graph is double) type.
+
+The MyConfig configuration class generally depends on the algorithm, and additional configuration information is required as follows:
+
+1. Parameters required by the algorithm
+2. Algorithm name
+3. Configure the Print function in the class
+Other common members inherit from ConfigBase, please refer to src/olap/olap_config.h for reference.
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // The parameters required by the algorithm are initialized
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // The configuration file accepts command line parameters. This use case will sequentially read the parameters when calling the algorithm from the command line. The value specified by the user is preferred. If the user does not specify it, the default parameter is selected.
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+#### 2.3.main function
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // Statistical memory consumption class MemUsage instantiation
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // Configuration class MyConfig instantiation
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk class instantiation
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // Statistical graph loading time consumption
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // Create an array to count whether a node has been traversed
+    auto parent = graph.AllocVertexArray<size_t>();
+    // Breadth-first search algorithm, returns the number of nodes connected to the root_vid root node in the graph
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // Print relevant information to the terminal
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+#### 2.4.bfs algorithm process
+
+The main process of `bfs` has two input parameters, the snapshot class (subgraph) and the number of iterations. The overall process can be divided into the following steps:
+
+1. Relevant definitions and initialization of data structures
+2. Use the batch function to perform cyclic calculations on each node, find all nodes adjacent to the current node in each round, and exchange them when the round ends.
+3. Until all nodes are found, return the number of nodes discovered_vertices.
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //Allocate an array, active_in is used to store the nodes found in the previous cycle stage
+  active_in.Add(root);            //Add the root node to the array
+  auto active_out = graph.AllocVertexSubset();  //Allocate the array active_out to store the nodes found in the current cycle stage
+  parent.Fill((size_t)-1);               //Assign a value of -1 to the node in the parent array, -1 means not found
+  parent[root] = root;
+  size_t num_activations = 1;       //Indicates the number of nodes found in the current loop phase
+  size_t discovered_vertices = 0;    //Indicates the total number of nodes found in the current cycle phase
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations indicates the number of nodes found in the current loop phase
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices indicates the total number of nodes found in the current cycle phase
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //Each cycle starts from the root node, finds adjacent adjacent nodes, changes its parent value, and operates num_activations+1
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //Store the nodes found in the current loop phase
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // return all nodes
+  return discovered_vertices;
+}
+```
+
+### 3.Description of other commonly used functions
+
+#### 3.1.Graph load
+
+TuGraph-StandaloneThe loading sources of graph data files are mainly divided into three categories: text files, binary files, and ODPS. The binary file is a file in which the binary representation of the edge data is arranged in order, which can save a lot of storage space. Its loading function is divided into three types, namely:
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：The loading method of the graph data file contains two parameters, and their meanings represent respectively
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `edge_direction_policy`：Specifies whether the graph is directed or undirected, including three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. Among them, DUAL_DIRECTION is the default graph loading method.
+  DUAL_DIRECTION : The input file is an asymmetric graph and the loaded graph is an asymmetric graph.
+  MAKE_SYMMETRIC : The input file is an asymmetric graph and the loaded graph is a symmetric graph.
+  INPUT_SYMMETRIC : The input file is a symmetric graph and the loaded graph is a symmetric graph.
+  For details, see `enum EdgeDirectionPolicy` in the olap_config.h file under the lgraph folder.
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：Load the vertices in the file into an array in the order of their ids. The meanings of each parameter are:
+  - `array`：array of data to be read
+  - `path`：The path to read the file, each line in the file represents a pair of vertex
+  - `parse_line`：A user-defined function that tells the system how to parse a line of text data into a vertex pair.
+
+
+#### 3.2.Graph write
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：Write the data in the array back to the file, and the meanings of each parameter are:
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `array`：array of data to be written
+  - `array_size`：The length of the number of data to be written
+  - `name`：algorithm name
+  - `filter_output`：Write data rule function, the data to be written needs to meet the requirements of this function.
+
+#### 3.3.graph parse function
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：Parse the graph data file, and load the graph as an unweighted graph.
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：Parse the graph data file, load the graph as a weighted graph, and specify the weight data type by modifying <EdgeData>.
+
+This function can be specified through the constructor parse_line when the MyConfig class is defined.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md
new file mode 100644
index 0000000000..6f1bfc6602
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md
@@ -0,0 +1,447 @@
+# Python Olap API
+
+> This document mainly introduces the API usage of OlapBase OlapOnDB and OlapOnDisk in Python
+
+## Table of contents
+- [1.Overview](#1-overview)
+- [2.Configuration Requirements](#2-configuration-requirements)
+- [3.Cython](#3-cython)
+- [4.Olap API](#4-olap-api)
+    - [4.1. Atomic operations](#atomic-operations)
+    - [4.2. Vertex collection class ParallelBitset](#vertex-collection-class-parallelbitset)
+    - [4.3. Vertex array class ParallelVector](#vertex-array-class-parallelvector)
+    - [4.4. Custom data structure](#custom-data-structure)
+    - [4.5.Graph class OlapBase](#graph-class-olapbase)
+    - [4.6. Graph Class OlapOnDB](#graph-class-olapondb)
+    - [4.7.Graph class OlapOnDisk](#graph-class-olapondisk)
+- [5.lgraph DB API](#5-lgraph_db-api)
+- [6.Algorithm plugin example](#6-algorithm-plug-in-example)
+
+## 1 Overview
+
+This manual will introduce the simple configuration required to use the Python interface of the TuGraph graph computing system, and explain the TuGraph Python API in conjunction with the code. For details about the functions of class ParallelBitset, OlapBase, etc., see olap-base-api.md, olap-on-db-api.md and olap-on-disk-api.md.
+
+## 2. Configuration requirements
+
+If you want to use TuGraph to write and compile your own applications, the required configuration requirements are:
+
+- Linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+- A compiler that supports C++17 requires GCC version 5.4.1 or later.
+- Cython, version 3.0a1 or above is required, and the tested version is 3.0.0a11
+
+## 3. Cython
+Cython is an efficient programming language that is a superset of Python. Cython can translate .py files into C/C++ codes and compile them into Python extension modules, which can be called through import in Python. In TuGraph, all Python plugins are compiled into Python extension modules by Cython and then used.
+
+The main advantage of using Cython is that it combines the simplicity and ease of use of Python with the performance of C/C++. The TuGraph Python interface is implemented using Cython.
+
+[Cython Documentation](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+The Olap API is used for graph computing and is implemented in C++. The usage and functions are basically the same as the C++ interface. To use the API in a Python file, the interfaces declared in plugins/cython/olap_base.pxd must be imported using `cython.cimports.olap_base import *`. The Python file can only be run after being compiled by Cython.
+
+### Atomic operations
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`: If the value pointed to by ptr is equal to oldv, assign the value pointed to by ptr to newv and return True, otherwise return False.
+- `write_min[T](a: cython.pointer(T), b: T)->cython.bint`: If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_max[T](a: cython.pointer(T), b: T)->cython.bint`: If b is greater than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_add[T](a: cython.pointer(T), b: T)->cython.bint`: Add the value of b to the value pointed to by a.
+- `write_sub[T](a: cython.pointer(T), b: T)->cython.bint`: Subtract the value pointed to by a from the value of b.
+
+### Vertex collection class ParallelBitset
+- `Size() -> size_t`: Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size: size_t)`: Initializes size and data, where the length of data is (size >> 6) + 1.
+- `Clear() -> cython.void`: Empties the collection.
+- `Fill() -> cython.void`: Adds all vertices to the set.
+- `Has(i: size_t) -> cython.bint`: Checks if vertex i is in the set.
+- `Add(i: size_t) -> cython.bint`: Adds vertex i to the set.
+- `Swap(other: ParallelBitset) -> cython.void`: Exchanges elements with another ParallelBitset set.
+
+### Vertex array class ParallelVector
+- `ParallelVector[T](size_t capacity)`: Constructs a ParallelVector, where capacity is the initial capacity of the vertex array.
+- `operator[](i: size_t) -> T`: Returns the data at index i.
+- `begin() -> cython.pointer(T)`: Returns the start pointer of ParallelVector.
+- `end() -> cython.pointer(T)`: Returns the end pointer of ParallelVector. The usage of begin() and end() is similar to the begin and end pointers of the vector container, and these two pointers can be used to sequentially access the array.
+- `Back() -> T`: Returns the last data of ParallelVector.
+- `Data() -> cython.pointer(T)`: Indicates the data of the array itself.
+- `Destroy() -> cython.void`: Clears the data in the ParallelVector array and deletes the array.
+- `Size() -> size_t`: Indicates the number of data in ParallelVector.
+- `Resize(size: size_t) -> cython.void`: Changes ParallelVector to size, which should be greater than or equal to the size before the change and less than capacity.
+- `Clear() -> cython.void`: Clears the data in ParallelVector.
+- `ReAlloc(capacity: size_t) -> cython.void`: Allocates a new capacity size to ParallelVector. If the array has data, it migrates the data to the new memory.
+- `Fill(elem: T) -> cython.void`: Assigns elem to all data of ParallelVector.
+- `Append(elem: T, atomic: cython.bint = true) -> cython.void`: Adds a data to the end of ParallelVector.
+- `Swap(other: ParallelVector[T]) -> cython.void`: Exchanges data with another ParallelVector.
+- `Copy() -> ParallelVector[T]`: Copies the current ParallelVector data and stores it in the copy array.
+
+
+### Custom Data Structure
+- `Empty`: A special data type whose content is empty.
+- `EdgeUnit[EdgeData]`: Indicates the edge whose weight type is EdgeData, used to parse the input file, including three member variables:
+    - `src: size_t`: starting vertex of the edge
+    - `dst: size_t`: end of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjUnit[EdgeData]`: indicates the edge whose weight type is EdgeData, which is used in the batch calculation process and contains two member variables:
+    - `neighbor: size_t`: neighbor vertex of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjList[EdgeData]`: The adjacency list of vertices whose weight type is EdgeData, often used to represent the set of incoming and outgoing edges of vertices, including three member functions:
+    - `begin()->cython.pointer(AdjUnit[T])`: the starting pointer of the list
+    - `end()->cython.pointer(AdjUnit[T])`: the end pointer of the list
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: the data whose subscript is i
+
+### Graph class OlapBase
+- `NumVertices()->size_t`: get the number of vertices
+- `NumEdges()-> size_t`: get the number of edges
+- `OutDegree(vid: size_t)-> size_t`: out-degree of vertex vid
+- `InDegree(vid: size_t)->size_t`: in-degree of the vertex vid
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`: Allocates an array of type VertexData with size as the number of vertices
+- `AllocVertexSubset()-> ParallelBitset`: Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all outgoing edges of vertex v
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all incoming edges of vertex v
+- `Transpose()->cython.void`: transpose of a directed graph
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+    - `edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+    - `input_vertices`: specifies the number of vertices read into the graph by the array.
+
+    - `input_edges` : specifies the number of edges that the array reads into the image.
+
+    - `edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`: locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`: unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+
+TuGraph provides two batch operations to perform point-centric batch processing in parallel, which is slightly different from C++ in Python.
+
+```python
+# Function name: ProcessVertexInRange[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# lower: size_t, upper: size_t,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Executes the work function on nodes whose node numbers are between lower and upper in the Graph. The fourth parameter indicates the base of accumulation, which is 0 by default.
+# The fifth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in include/lgraph/olap_base.h
+#
+# Example usage: Count the number of vertices with edges in the parent array.
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython.pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+g is the instantiated object of graph class OlapBase
+
+```python
+# Function name: ProcessVertexActive[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# active: ParallelBitset,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Execute the work function on the nodes corresponding to 1 in the active_vertices bitset. The third parameter indicates the base of accumulation, which is 0 by default;
+# The fourth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in /include/lgraph/olap_base.h
+#
+# Usage example: Output all out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes.
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self. graph. OutDegree(vi)
+        dst: size_t
+        edges = self. graph. OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbor
+            printf("node %lu has neighbor %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+As shown in the above two examples, ProcessVertexActive and ProcessVertexInRange in Python require an additional algorithm class pointer parameter compared to their C++ counterparts. The Work function is generally used as a member function of the algorithm class to access member variables, such as in the graph and ParallelVector parent examples shown above. When calling the batch function, the Work function and the self pointer of the algorithm class are passed to the batch function.
+
+The Work function will be called in multiple threads, so the @cython.nogil decorator is added to release the Python global interpretation lock. In code executed by multiple threads, such as the Work function in the batch function, variables are better declared as C/C++ types using `dst: type` or `dst = cython.declare(type)`. This is because Python objects cannot be used in multi-threaded code.
+
+### Graph class OlapOnDB:
+Parallelize to create a directed graph:
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+Parallelize to create an undirected graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING creates a directed graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### Graph class OlapOnDisk
+
+#### ConfigBase:
+- `ConfigBase()`: Constructor
+- `std::string input_dir`: graph edge table data path
+- `std::string output_dir`: output path
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: read in graph data
+
+## 5. lgraph_db API
+Please refer to the files plugins/cython/lgraph_db.pxd and lgraph_db_python.py for the lgraph_db API.
+
+The usage and functions of the interface in lgraph_db.pxd are basically the same as the C++ interface. The interface declared in lgraph_db.pxd is implemented in C++. In the py file, it must be imported by `cython.cimports.olap_db import *` and compiled by the Cython file to run.
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: Get the vid of the vertex
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: constructor, dir_path is the db path
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: set user
+- `SetUser(user: std::string)-> cython.void`: set user
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: create GraphDB
+
+### GraphDB:
+- `CreateReadTxn()-> Transaction`: create a read-only transaction
+- `CreateWriteTxn()-> Transaction`: create a write transaction
+- `ForkTxn(txn: Transaction)-> Transaction`: Copy transactions, only read transactions can be copied
+
+### Transaction:
+```
+GetVertexIndexIterator(
+                 label: std::string,
+                 field: std::string,
+                 key_start: std::string,
+                 key_end: std::string) -> VertexIndexIterator
+```
+Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v
+
+
+
+lgraph_db_python.py packages the C++ classes Galaxy and GraphDB from lgraph_db.pxd as Python classes. After compiling lgraph_db_python.py into a Python extension, you can directly access it in a Python file or from the Python command line by importing it with `import lgraph_db_python`.
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: constructor, dir_path is the db path
+- `SetCurrentUser(self, user: str password: str)-> void`: set user
+- `SetUser(self, user: std::string)-> void`: set user
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: create PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)->cython.Py_ssize_t`: address of C++ class GraphDB
+
+## 6. Algorithm plug-in example
+The following is a code example of the BFS algorithm implemented in Python:
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# Comments work as follows:
+# language_level=3: use Python3
+# cpp_locals=True: C++17 is required, and std::optional is used to manage C++ objects in Python code, which can avoid copy construction of C++ objects
+# boundscheck=False: Turn off bounds checking for indexes
+# wraparound=False: Turn off the processing of negative subscripts (similar to Python List)
+# initializedcheck=False: Turn off checking whether the memory is initialized, and the running performance will be faster after turning off the check
+# language = c++: translate this .py file to C++ instead of C file. TuGraph uses a lot of template functions, so C++ should be used
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# From plugins/cython/ cimportolap_base.pxd and lgraph_db.pxd, similar to #include "xxx.h" in C++
+
+from cython.cimports.libc.stdio import printf
+# Similar to #include <stdio.h> in C++
+# Other common ones include cython.cimports.libcpp.unordered_map, etc.
+
+import time
+import lgraph_db_python
+
+@cython.cclass
+# cython.cclass indicates that BFSCore is a C-type Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty]) indicates the pointer of OlapBase[Empty], similar to OlapBase[Empty]* in C++
+    # Cython provides common types of pointers, such as cython.p_int, cython.p_char, etc.
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t declares root as a C++ size_t type variable, equivalent to root = cython.declare(size_t)
+    # Variables that do not declare a type are Python object types
+    # Declaring variable types will greatly improve performance, and in the multi-threaded part, only C/C++ type variables can be accessed
+
+    @cython.cfunc
+    # cython.cfunc indicates that Work is a C-type function, and the parameters and return values should be declared
+    # cfunc has good performance and can accept C/C++ objects as parameters and return values, but it cannot be called in other python files
+    # Similar to cython.ccall, such as Standalone function, which can be called in other python files
+    @cython.nogil
+    # cython.nogil means to release the Python global interpretation lock. In the part modified by nogil, Python objects cannot be accessed
+    # In the multi-threaded part, there should be nogil decorator
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) means that exception propagation is disabled, and Python exceptions raised inside the function will be ignored
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbor
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 means that dst has not been visited by bfs
+                if self.active_out.Add(dst):
+                    # Set dst as an active node; ParallelBitmap.Add is an atomic operation to prevent double calculation
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython. size_t:
+        self. graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self. parent. Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self. active_in. Add(self. root)
+        while num_activations > 0:
+            self. active_out. Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self. active_out. Swap(self. active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time. time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # Create OlapOnDB in parallel
+    # Cython does not support dereference operations such as *db, use db[0] to dereference
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # Get the iterator of the root node through GetVertexIndexIterator based on the root node label name, field name and field value (root_id),
+    # and get the vid through the iterator. When there is no ID_MAPPING, the vid is the same as the id in OlapOnDB
+    cost = time. time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time. time()
+    count = a. run(cython. address(olapondb), root_vid)
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb. NumVertices()
+    response["num_edges"] = olapondb. NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone is the plug-in entry in Standalone mode, modified with cython.ccall
+    # You can set parameters arbitrarily, and modify plugins/cython/standalone_main.py accordingly
+    cost = time. time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config is a C++ class, config.input_dir is std::string, Python str needs to be encoded to be passed to std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # read in graph
+    cost = time. time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time. time()
+    a = BFSCore()
+    count = a. run(cython. address(graph), root)
+    # cython.address(graph), address, similar to &graph in C++
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices". format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process is the plug-in entry in embed mode and procedure mode, modified with cython.ccall
+    # The Process function must be named Process, and the parameters are lgraph_db_python.PyGraphDB and bytes
+    # The return value must be (bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # Get the address of the GraphDB object in the PyGraphDB, convert it to a pointer and pass it
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..f86dc4107c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
@@ -0,0 +1,191 @@
+# TuGraph Built-in Algorithm Description
+
+> This document mainly introduces the TuGraph built-in algorithm program in detail, the community version of 6 algorithms can refer to the basic algorithm newspaper
+
+## 1.Introduction
+
+TuGraph currently contains the following 6 basic algorithms and 28 extended algorithms, a total of 34 graph algorithms:
+
+### 1.1.Basic algorithms:
+
+|    Algorithm name            | The program name |
+| :--------------------------: | :--------------: |
+|     Breadth-First Search     |       bfs        |
+|           Pagerank           |     pagerank     |
+| Single-Source Shortest Path  |       sssp       |
+| Weakly Connected Components  |       wcc        |
+| Local Clustering Coefficient |       lcc        |
+| Label Propagation Algorithm  |       lpa        |
+
+### 1.2.Extended algorithms:
+
+|            Algorithm name                    |   The program name   |
+| :------------------------------------------: | :------------------: |
+|            All-Pair Shortest Path            |         apsp         |
+|            Betweenness Centrality            |          bc          |
+|              Belief Propagation              |          bp          |
+|             Closeness Centrality             |          cc          |
+|             Common Neighborhood              |          cn          |
+|              Degree Correlation              |          dc          |
+|             Dimension Estimation             |          de          |
+|                    EgoNet                    |          en          |
+|        Hyperlink-Induced Topic Search        |         hits         |
+|                Jaccard Index                 |          ji          |
+|                    K-core                    |        kcore         |
+|                   Louvain                    |       louvain        |
+|        Multiple-source Shortest Paths        |         mssp         |
+|            Personalized PageRank             |         ppr          |
+|        Strongly Connected Components         |         scc          |
+| Speaker-listener Label Propagation Algorithm |         slpa         |
+|          Single-Pair Shortest Path           |         spsp         |
+|              Triangle Counting               |       triangle       |
+|                  Trustrank                   |      trustrank       |
+|     Weighted Label Propagation Algorithm     |         wlpa         |
+|         Weighted Pagerank Algorithm          |      wpagerank       |
+|           Maximal independent set            |         mis          |
+|                  Sybil Rank                  |      sybilrank       |
+|             Subgraph Isomorphism             | subgraph_isomorphism |
+|                    Motif                     |        motif         |
+|                   Kcliques                   |       kcliques       |
+|                    Ktruss                    |        ktruss        |
+|                    Leiden                    |        leiden        |
+
+## 2.Basic algorithms
+
+### 2.1.Breadth-First Search
+
+Breadth first Search implements the Breadth-first Search algorithm, which starts from the root vertex and traverses all accessible vertices along the width of the graph. Returns the number of vertices traversed. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 2.2.Pagerank
+
+Web page sorting program to achieve the commonly used Pagerank algorithm. The algorithm calculates the importance ranking of all vertices according to the edge and edge weight in the graph. The higher the PageRank value, the higher the importance of the vertex in the graph. The reciprocal of the number of vertices is used as the initial Rank value of each vertex, and then the Rank value of the vertices is transferred to the adjacent vertices on average according to the outgoing edges, and the transfer process is repeated until the given convergence threshold is met or the given number of iterations is reached. At the end of each pass round, a certain proportion of the Rank values of all vertices will be randomly transferred to any vertex. Please refer to the algorithm content [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 2.3.Single-Source Shortest Path
+
+The Single Source Shortest Path algorithm realizes the Single Source Shortest Path algorithm. It calculates the shortest path length from a given source vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 2.4.Weakly Connected Components
+
+The program of Weakly Connected Components has implemented the algorithm. It can calculate all the weakly connected components in the graph. A weakly connected component is a subgraph of a graph in which reachable paths exist between any two points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Connected*component*(graph_theory)](<https://en.wikipedia.org/wiki/Connected_component_(graph_theory)> "scc wiki")。
+
+### 2.5.Local Clustering Coefficient
+
+The average Clustering Coefficient program implements the Local Clustering Coefficient algorithm to calculate the coefficient of the degree of clustering between vertices in the graph. The returned results include the overall clustering coefficient and the vertex clustering coefficient. The overall agglomeration coefficient reflects the evaluation of the overall agglomeration degree in the graph, and the vertex agglomeration coefficient includes the agglomeration coefficient of any vertex, which reflects the agglomeration degree near the vertex. The higher the agglomeration coefficient, the higher the agglomeration degree. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 2.6.Label Propagation Algorithm
+
+The program implements Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and computes unauthorised graphs. In label passing, each vertex adds up all the labels received, and randomly selects one of the labels with the highest sum. The iteration converges or the algorithm terminates after a given number of rounds. The final output is a label for each vertex, and vertices with the same label value are considered to be in the same community. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+## 3.Extended algorithms
+
+### 3.1.All-Pair Shortest Path
+
+The All-Pair Shortest Path program realizes the all-pair Shortest Path algorithm and calculates the shortest path between any two points in the graph. Returns the shortest path length between any pair of vertices where the path exists. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 3.2.Betweenness Centrality
+
+Betweenness Centrality algorithm is implemented in Betweenness centrality program to estimate the betweenness centrality value of all vertices in a graph. The value of intermediate centrality reflects the possibility that any shortest path in the graph passes through the vertex, and the higher the value, the more shortest paths pass through the vertex. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 3.3.Belief Propagation
+
+The Belief Propagation algorithm is implemented in the confidence propagation program. Given the edge distribution of the observed vertices, the algorithm estimates the edge distribution of the unobserved vertices by using the mechanism of passing messages among vertices. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 3.4.Closeness Centrality
+
+The Distance Centrality program implements an algorithm to estimate the average length of an arbitrary vertex to Closeness the shortest path to another vertex in the graph. The smaller the distance from the center, the smallest the average shortest distance from the vertex to other vertices, which means that the vertex is more centrally located in the graph from the geometric point of view. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "cc wiki")。
+
+### 3.5.Common Neighborhood
+
+The Common Neighborhood program implements the common Neighborhood algorithm to count the number of common neighbors between any given pair of neighboring vertices. Given several pairs of vertices to be queried, the result is the number of common neighbors of any pair of vertices to be queried.
+
+### 3.6.Degree Correlation
+
+The Degree Correlation algorithm is implemented in the degree correlation program. It calculates the degree correlation degree of a graph by calculating the Pearson correlation coefficient between any adjacent vertex pairs, which can be used to characterize the correlation degree between high-degree vertices in the graph. A higher degree of correlation indicates a higher degree of correlation between vertices of higher degree in the graph. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 3.7.Dimension Estimation
+
+The diameter Estimation program implements the Dimension Estimation algorithm. The algorithm calculates the length of the longest shortest path in the graph, which is used to characterize the diameter of the graph. Please refer to the algorithm content[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### 3.8.EgoNet
+
+The EgoNet algorithm requires a given root vertex and K value, and takes the root vertex as the source vertex to conduct a width-first search to find the subgraph composed of all neighbors within K degrees. The found subgraph is called the EgoNet of the root vertex.
+
+### 3.9.Hyperlink-Induced Topic Search
+
+The Hyperlink Topic Search algorithm implements the Hyperlink-induced topic search algorithm, which assumes that each vertex has two attributes: Authority and Hub. A good hub vertex should point to many vertices with high authority. And a good authority vertex should be pointed to by many vertices of high pivot type. The algorithm returns the authority value and the hub value for each vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 3.10.Jaccard Index
+
+The Jaccard coefficient program implements the Jaccard Index algorithm. The algorithm calculates the Jaccard coefficient between a given pair of vertices, which can be used to represent the similarity of the two vertices. A higher Jaccard coefficient indicates a higher degree of similarity between pairs of vertices. Given several pairs of vertices with the query, the Jaccard coefficients of these pairs are returned. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### 3.11.K-core
+
+k accounting method implements k-core algorithm. The algorithm computes the number of kernels of all vertices, or finds all K-nucleon graphs in the graph. K-nucleon graph is a special subgraph in which the degree of any vertex is not less than a given K value. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Degeneracy\_(graph_theory)](<https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)> "kcore wiki")。
+
+### 3.12.Louvain
+
+The Louvain community discovery program implements the Fast-unfolding algorithm. The algorithm is a community discovery algorithm based on modularity. It maximizes the modularity of the graph by constantly merging vertex communities, and can discover the hierarchical community structure. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 3.13.Multiple-source Shortest Paths
+
+The multisource Shortest Paths program implements the multiple-source Shortest Paths algorithm to calculate the shortest path value to any vertex from the given Multiple source vertices. Where, the shortest path value of multiple source vertices to a vertex is the minimum value of the shortest path from each source vertex to the vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 3.14.Personalized PageRank
+
+Personalized web ranking program has Personalized PageRank algorithm. According to the given source vertex, the algorithm calculates the importance ranking of all vertices to the source vertex based on the source vertex. The higher the Rank value, the more important the vertex is to the source vertex. Unlike PageRank, the source vertex Rank value is 1, the rest of the vertex Rank value is 0; And a certain proportion of Rank value will be immediately transferred back to the source vertex after each round of transmission. Please refer to the algorithm content [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 3.15.Strongly Connected Components
+
+Strongly Connected component program realizes the Strongly Connected Components algorithm. The algorithm computes all strongly connected components of the graph, which is a subgraph of the graph that can start from any vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 3.16.Speaker-listener Label Propagation Algorithm
+
+The program realizes the Speaker-listener Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and historical tag record, which is an extension of tag propagation algorithm. Different from the label propagation algorithm, this algorithm records the historical labels of all vertices. When the labels are accumulated in the iteration, the historical labels are also counted. The final output is all the historical label records for each vertex. Please refer to the paper for the algorithm content:“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 3.17.Single-Pair Shortest Path
+
+The program of the shortest path between two points implements the Bidirectional point-first Search algorithm. It searches forward width First along the outgoing edge from the starting point and reverse width first along the incoming edge from the end point on the directed undirected graph. The shortest path length from the starting point to the ending point is determined by traversing the vertices of the starting point and the ending point together. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 3.18.Triangle Counting
+
+The Triangle-counting algorithm is implemented to calculate the number of triangles in an undirected graph, which can be used to characterize the correlation degree of the vertices in the graph. The higher the number of triangles, the higher the degree of correlation of the vertices in the graph. For the algorithm content, please refer to the paper, "Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study".
+
+### 3.19.Trustrank
+
+The Trust Index Sorting Algorithm implements the Trustrank algorithm, which can calculate the Trust Index of any vertex based on a given whitelist. The higher the trust score, the less likely the vertex is to be illegal. Please refer to the algorithm content for details. [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 3.20.Weighted Label Propagation Algorithm
+
+Weighted Label Propagation Algorithm is implemented in the program. = Different from the label propagation algorithm, the label transmission is related to the weight of the edge. During label transmission, the weight of each vertex will be accumulated according to the incoming edge of the label, and the label with the highest sum will be randomly selected. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 3.21.Weighted Pagerank Algorithm
+
+Weighted Pagerank is implemented in the weighted Pagerank algorithm. Different from PageRank algorithm, the transfer of Rank value is related to the weight of the edge. The Rank value of the vertex will be transferred to the adjacent vertices according to the weight of the edge. Please refer to the algorithm content[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 3.22.Maximal independent set
+
+Maximal independent set algorithm implements Maximal Independent Set algorithm. A maximum independent set means that there are no vertices outside the independent set that can join it. A graph may have many MIS that vary greatly in size, and the algorithm finds one of them. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### 3.23.Sybil Rank
+
+Sybil detection algorithm implements Sybil Rank algorithm. The SybilRank algorithm starts from non-Sybil nodes and performs a random walk with premature termination. Please refer to the paper for the algorithm content:“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 3.24.Subgraph Isomorphism
+
+The subgraph matching algorithm implements the subgraph_isomorphism algorithm. The subgraph_isomorphism algorithm matches all nodes in the whole graph and outputs the number of times each node is matched. Algorithm Content Reference [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 3.25.Motif
+
+Pattern matching algorithm implements motif algorithm. motif algorithm matches k-order subgraphs for the specified nodes, and finally outputs the number of each kind of K-order subgraphs for each specified node. Each K-order subgraph is represented by a 64-bit integer, and the $i \times k + j$bit is 1, indicating that there is an edge i->j in the subgraph. Algorithm Content Reference [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### 3.26.Kcliques
+
+The K-order clique counting algorithm implements the k-cliques algorithm. The k-cliques algorithm calculates the number of all K-order complete subgraphs in the graph, and finally outputs the number of k-order complete subgraphs of each node. Algorithm Content Reference [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### 3.27.Ktruss
+
+The k-order truss counting algorithm implements the k-truss algorithm. A k-truss is a subgraph in which each edge is the edge of at least k-2 triangles. The k-truss algorithm finds out the k-truss subgraph of the graph, and finally outputs the neighbor node list of each node in the subgraph. Algorithm Content Reference[https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+
+### 3.28.Leiden
+
+Leiden algorithm implements Leiden's algorithm. leiden algorithm is a community discovery algorithm based on modularity. Compared with louvain algorithm, leiden algorithm has the advantage that Leiden algorithm detects the broken links in the community to ensure that each community has good connectivity. Algorithm Content Reference [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/index.rst
new file mode 100644
index 0000000000..dc955b3b91
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/2.olap/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
new file mode 100644
index 0000000000..47c814d627
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
@@ -0,0 +1,337 @@
+# TuGraph Stored Procedure Guide
+
+> This document mainly explains the instructions for using the TuGraph stored procedure.
+
+## 1. Introduction
+
+When the query/update logic that users need to express is more complex (such as cannot be described by Cypher or has high performance requirements), compared to calling multiple requests and completing the entire processing flow on the client, the stored procedure provided by TuGraph is a more concise and efficient choice.
+
+Similar to traditional databases, the TuGraph stored procedure runs on the server side. Users can encapsulate the processing logic (i.e., multiple operations) into a procedure call, and further improve performance by parallel processing (such as using relevant C++ OLAP interfaces and built-in algorithms) during implementation.
+
+There is a special type of API in the stored procedure for parallel data operations, which we call the Traversal API. Please refer to the [documentation](2.traversal.md) for more information.
+
+## 2. Stored Procedure Version
+
+Currently, TuGraph supports two versions of stored procedures, which are suitable for different scenarios. Version 3.5 only supports v1, which can be directly called through the REST or RPC interface. Starting from version 3.5, v2 is supported, which allows embedding calls in graph query languages ​​(such as Cypher). We call it POG (Procedure On Graph query language, APOC).
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+|Applicable Scenarios	|Extreme performance or complex multi-transaction management scenarios	|General scenarios, highly integrated with Cypher|
+|Transaction	|Created internally in the function, multiple transactions |can be freely controlled	Passed into the external function, single transaction|
+|Signature (parameter definition)	|Not required	|Required|
+|Input and output parameter types	|Not required to specify	|Need to specify parameter types|
+|Cypher Standalone Call	|Supported	|Supported
+|Cypher Embeded Call	|Not supported	|Supported|
+|Language	|C++/Python/Rust	|C++|
+|Calling mode	|Directly pass the string, usually in JSON format	|Through variables in Cypher statements|
+
+
+In TuGraph, stored procedures v1 and v2 are managed separately, and support for create, delete, and query operations is provided. However, it is still not recommended to have the same name for multiple stored procedures.
+
+## 3. Supported Languages
+
+In TuGraph, users can dynamically load, update, and delete stored procedures. TuGraph supports the use of C++, Python, and Rust languages to write stored procedures. Among them, C++ language has the most complete support and the best performance.
+
+Note that the stored procedure is the logic compiled and executed on the server side, which is independent of the language support on the client side.
+
+## 4. Procedure v1 Interface
+
+## 4.1.Write stored procedures
+### 4.1.1.Write C++ stored procedure
+
+Users can write C stored procedures by using core API or Traversal API. An example of a simple C stored procedure is as follows:
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## Count all students whose age is 10
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+From the code, we can see the entry of a TuGraph C++ stored procedure is the `Process` function, with three parameters:
+
+- `db`: the TuGraph database instance
+- `request`: the input data, which can be a binary byte array, or any other format such as JSON string.
+- `response`: the output data, which can be a string or directly return binary data.
+
+The return value of the `Process` function is a boolean value. When it returns `true`, it means that the request is successfully completed, otherwise it means that the stored procedure found an error during execution, and the user can return an error message through `response` to facilitate debugging.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which is `age_10` in the above example. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, age_10.so will be generated, which can then be loaded into the server by the user.
+
+### 4.1.2 Writing Python stored procedures
+
+The following snippet does the same thing as the above C++ stored procedure, but via TuGraph Python API:
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+The Python stored procedure returns a tuple, the first element of which is a Boolean value indicating whether the stored procedure was successfully executed; the second element is a `str`, which contains the result to be returned.
+
+Python stored procedures do not need to be compiled and can be loaded directly.
+
+## 4.2.How to use stored procedures
+
+### 4.2.1.Install Stored Procedures
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `age_10.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+                  headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `age_10.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+### 4.2.2.List Stored Procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.Retrieve Stored Procedures Detail
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.Uninstall Stored Procedures
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+### 4.2.6.Upgrade Stored Procedures
+
+You can upgrade a stored procedure with the following two steps:
+
+1. Uninstall the existing one.
+2. Install the new on.
+
+TuGraph carefully manages the concurrency of stored procedure operations. Upgrading stored procedures will not affect concurrent runs of existing ones.
+
+## 5. Procedure v2 Interface
+
+### 5.1.Writing stored procedures
+
+Users can write C++ stored procedures by using lgraph API. A simple C++ stored procedure example is as follows:
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   std::string &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response = std::string("error parsing json: ") + e.what();
+        return false;
+    }
+
+    Result result({{"node", LGraphType::NODE},
+                   {"salt", LGraphType::FLOAT},
+                   });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = result.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    response = result.Dump();
+    return true;
+}
+```
+
+From the code we can see:
+- The stored procedure defines a method `GetSignature` to get the signature. This method returns the signature of the stored procedure, which includes input parameter names and their types, and return parameters and their types. This enables the Cypher query statement to use the signature information to verify whether the input data and the returned data are reasonable when calling the stored procedure.
+- The entry function is the `ProcessInTxn` function, which has three parameters, which are:
+
+- `txn`: The transaction of the stored procedure, generally speaking, the transaction of the Cypher statement that calls the stored procedure.
+- `request`: input data, its content is the string of the input parameter type defined in `GetSignature` and the value passed in the Cypher query statement after json serialization. e.g. `{num_iteration: 10}`
+- `response`: output data, in order to ensure compatibility in the Cypher language, users can write the data processed by the stored procedure to `lgraph_api::Result`, and finally use `lgraph_api::Result::Dump` to serialize it into data in json format.
+
+The return value of the `ProcessInTxn` function is a boolean value. When it returns `true`, it means that the request was successfully completed, otherwise it means that the stored procedure found an error during execution.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which in the above example is `custom_pagerank`. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, custom_pagerank.so will be generated, which can then be loaded into the server by the user.
+
+### 5.2.Load stored procedure
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `custom_pagerank.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `custom_pagerank.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+#### 5.2.1.List loaded stored procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.Get stored procedure details
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.Delete stored procedure
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+#### 5.2.5.Update stored procedure
+
+Updating a stored procedure requires the following two steps:
+
+1. Delete the existing stored procedure
+2. Install the new stored procedure
+
+TuGraph carefully manages the concurrency of stored procedure operations, and updating stored procedures will not affect the operation of existing stored procedures.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
new file mode 100644
index 0000000000..0b970e908a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
@@ -0,0 +1,124 @@
+# Traversal API
+
+> This document mainly explains the Traversal API in the stored procedure of TuGraph.
+
+1. Introduction
+The powerful online analytical processing (OLAP) capability of TuGraph is an important feature that sets it apart from other graph databases. With the help of the C++ OLAP API (olap_on_db.h), users can quickly export a subgraph that needs to be analyzed, and then run iterative graph computing processes such as PageRank, connected components, and community detection on it, and then make corresponding decisions based on the results. The export and computation processes can be accelerated through parallel processing, achieving almost real-time analysis and processing, and avoiding the lengthy steps of traditional solutions that require exporting, transforming, and reimporting (ETL) data into dedicated analytical systems for offline processing.
+
+TuGraph has built-in many commonly used graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement specific graph computing processes themselves. They just need to include the header files (.h files) of the corresponding algorithm library in their own programs when implementing their own storage procedures, and link the corresponding dynamic library files (.so) during compilation. In general, the only process that users need to implement themselves is the extraction of the subgraph to be analyzed.
+
+Currently, the Traversal API only supports C++.
+
+## 2. Interface
+
+### 2.1. Snapshot
+
+The Snapshot template class in C++ OLAP API is used to represent extracted static subgraphs. The EdgeData is used to represent the data type of the weight used for each edge in the subgraph. If the edges do not require weights, Empty is used as the EdgeData.
+
+The extracted subgraph can be described using the constructor of the Snapshot class.
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+In the above text, "db" represents the database handle, "txn" represents the transaction handle, and "flags" represents the options used during generation, with the optional values including the following combinations: SNAPSHOT_PARALLEL indicates that multiple threads are used for parallel extraction during export; SNAPSHOT_UNDIRECTED indicates that the exported graph needs to be transformed into an undirected graph.
+
+"vertex_filter" is a user-defined filtering function for vertices, where a return value of true indicates that the vertex needs to be included in the extracted subgraph, and vice versa.
+
+"out_edge_filter" is a user-defined filtering function for edges, where a return value of true indicates that the edge needs to be included in the extracted subgraph, and vice versa.
+
+When the filtering functions are set to default values, it means that all vertices/edges should be included.
+
+For other methods provided by the Snapshot class, please refer to the detailed C++ API documentation (olap_on_db.h).
+
+### 2.2. Traversal
+
+A common type of analysis in graph databases is to start from one or more vertices and iteratively expand and access their neighbors. Although this type of analysis can be done using Cypher, its performance is limited by the serial interpretation and execution when the depth of traversal is large. Writing stored procedures using the C++ Core API eliminates the overhead of interpretation but is still limited by the processing power of a single thread.
+
+In order to enable users to accelerate these types of analysis tasks through parallel processing, we have wrapped a Traversal framework based on the C++ OLAP API. Users can directly use the FrontierTraversal and PathTraversal classes in this framework to perform iterative traversal analysis tasks. For specific usage instructions, please refer to the corresponding C++ API documentation (lgraph_traversal.h).
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+This method can be used to find all vertices that satisfy a certain condition (when the filter returns true). When the "parallel" parameter is set to true, the search process will be executed in parallel.
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+This method can be used to extract (VertexData type) properties from a specified set of vertices (frontier) using the extract method. When the "parallel" parameter is set to true, the extraction process will be executed in parallel.
+
+FrontierTraversal is suitable for cases where only the traversed set of vertices is of interest. When a user needs to access information along the path (vertices/edges along the path) in the traversal process or result, PathTraversal needs to be used. Both types of traversal have three parameters in their constructor, namely the database handle db, transaction handle txn, and options flags. The available options include the following combinations: TRAVERSAL_PARALLEL indicates that multiple threads are used for parallel traversal; TRAVERSAL_ALLOW_REVISITS indicates that vertices can be visited repeatedly during traversal (PathTraversal implicitly includes this option).
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+Both types of traversal have three ways to set the starting vertex/vertex set for traversal. The first two methods directly specify the vertex ID, while the last method is similar to FindVertices.
+
+Both types of traversal start from the set of vertices in the current layer. They use the extension function to access each outgoing edge/incoming edge/outgoing and incoming edges, and use a user-defined filter function to determine if the extension is successful. If successful, the neighboring vertex/appended path with the edge is added to the set of vertices/paths in the next layer.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+The above describes the three traversal methods of FrontierTraversal. It starts from the current set of vertices and, for each vertex in the set, iterates through each outgoing edge/incoming edge/outgoing and incoming edges. If the edge or neighbor vertex satisfies the user-defined filter conditions (where edge_filter is the filter function for edges and neighbour_filter is the filter function for neighbor vertices), the neighbor vertex is added to the new set of vertices.
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+After the expansion of the current set of vertices is finished, the new set of vertices can be obtained using the above method.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+The three traversal methods of PathTraversal are similar to FrontierTraversal, except that the user-defined filter function adds two additional parameters: Path, which contains the path before the new edge is expanded, and IteratorHelper, which can be used to convert the vertices/edges in the path to corresponding iterators in the database. The relevant documentation can be found in the corresponding C++ API documentation.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
new file mode 100644
index 0000000000..abc5ce2ccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
@@ -0,0 +1,5 @@
+base64_encode
+===================================
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
new file mode 100644
index 0000000000..b321c843d6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
@@ -0,0 +1,5 @@
+lgraph_result
+===================================
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
new file mode 100644
index 0000000000..0f53077dbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
@@ -0,0 +1,5 @@
+lgraph_rpc_client
+===================================
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
new file mode 100644
index 0000000000..d7a9d7b97c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
@@ -0,0 +1,5 @@
+lgraph_traversal
+===================================
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
new file mode 100644
index 0000000000..4b0be46a21
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
@@ -0,0 +1,5 @@
+lgraph_txn
+===================================
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
new file mode 100644
index 0000000000..4047340ef0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
@@ -0,0 +1,5 @@
+lgraph_types
+===================================
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
new file mode 100644
index 0000000000..12814e7618
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
@@ -0,0 +1,5 @@
+lgraph_utils
+===================================
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
new file mode 100644
index 0000000000..572f9ae7c0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
new file mode 100644
index 0000000000..5bfa8a1dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
new file mode 100644
index 0000000000..8680a93ee9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
@@ -0,0 +1,5 @@
+olap_base
+===================================
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
new file mode 100644
index 0000000000..9ce3afba80
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
@@ -0,0 +1,5 @@
+olap_on_db
+===================================
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
new file mode 100644
index 0000000000..5bed2e061c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
@@ -0,0 +1,5 @@
+lgraph
+===================================
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
new file mode 100644
index 0000000000..82bf0941c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
@@ -0,0 +1,5 @@
+olap_profile
+===================================
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
new file mode 100644
index 0000000000..8723e9f1d0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
@@ -0,0 +1,5 @@
+lgraph_atomic
+===================================
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
new file mode 100644
index 0000000000..ec8af7bb8f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
@@ -0,0 +1,5 @@
+lgraph_date_time
+===================================
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
new file mode 100644
index 0000000000..07d6076327
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
@@ -0,0 +1,5 @@
+lgraph_db
+===================================
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
new file mode 100644
index 0000000000..07f4be3f67
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
new file mode 100644
index 0000000000..5be9e6547e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
new file mode 100644
index 0000000000..70a0bd4cbf
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
@@ -0,0 +1,5 @@
+lgraph_exceptions
+===================================
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
new file mode 100644
index 0000000000..a4f9af0582
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
@@ -0,0 +1,5 @@
+lgraph_galaxy
+===================================
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
new file mode 100644
index 0000000000..1c343152d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
@@ -0,0 +1,8 @@
+C++ stored procedure API
+===================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..496c5210fc
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
@@ -0,0 +1,29 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python stored procedure API
+====================================
+Version: 3.5.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..7e12ce4db1
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
@@ -0,0 +1,17 @@
+# Rust Stored Procedures
+
+## 1. Introduction
+Rust stored procedures currently only support v1 version. TuGraph supports plugins in any language that can be compiled into a dynamic library. Rust, as a rising star in system programming languages, has significant advantages in terms of safety, reliability, and ergonomics compared to C++.
+
+We provide the Rust binding library for TuGraph to support calling lgrahp API in Rust. We also provide the [tugraph-plugin-util](https://crates.io/crates/tugraph-plugin-util ) utility library to help simplify the process of writing Rust plugins.
+
+## 2. How to Use
+
+Using Rust stored procedures involves three steps:
+* Compilation: Compile the Rust source code into a dynamic library (so file). We have prepared a comprehensive plugin development tutorial that covers everything from IDE plugin installation and environment setup to compilation. Please refer to the `rust-tugraph-plugin-tutorial` for detailed instructions.
+* Loading: Load the dynamic library (so file) into the server. This can be done through the REST or RPC interface, similar to the usage of C++ libraries. Please refer to the documentation for more details on the [Procedure v1 API](1.procedure.md#4.Procedure v1 interface).
+* Execution: Once the library is loaded, use it as you would with a C++ stored procedure. The process is the same and does not need further explanation.
+
+## 3. API Documentation
+
+In the Rust community, all code and documentation can be found on [`crates.io`](https://crates.io/crates/tugraph ) and [`docs.rs`](https://docs.rs/tugraph/latest/tugraph ).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile
new file mode 100644
index 0000000000..7ab9297a21
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 3.5.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst
new file mode 100644
index 0000000000..9dee2a39b9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst
@@ -0,0 +1,12 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure/index.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
new file mode 100644
index 0000000000..83cc10c52e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
new file mode 100644
index 0000000000..1183184e51
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
@@ -0,0 +1,2736 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+:warning: **All the other RESTful APIs excluding the three below will be deprived after 4/30/2023.**
+- **Login**
+- **Query**
+- **Store Procedures**
+
+## 2.Protocols And Data Format
+
+### 2.1.Protocols
+
+Both HTTP and HTTPS protocols are supported by TuGraph. The system uses HTTP protocol by default. To use HTTPS, the `ssl_auth` option should be set to `true` in the DB configuration.
+
+### 2.2.Request
+
+TuGraph supports HTTP GET/POST/PUT/DELETE requests, in which:
+
+- `GET` requests are used for read-only requests, such as getting vertex properties, edge properties, etc.
+
+- `POST` requests are used to create entities, submit Cypher, and to manage and call stored procedures;
+
+- `PUT` requests are used to modify existing entities, for example, to modify vertex properties, edge properties, etc.
+
+- `DELETE` requests are used to delete existing entities, such as vertices, edges, etc.
+
+In high-availability mode, users can set `ServerVersion` in the request header to make sure the request is never served with an outdated version.
+The current `ServerVersion` can be obtained from the header returned by the server.
+
+### 2.3.Response
+
+TuGraph returns the following HTTP status codes:
+
+- **200 OK**: operation is successful.
+- **307 Temporary Redirect**: the operation is redirected, typically in high-availability mode, to the master.
+- **400 Bad Request**: incorrect input, such as URI error, or invalid parameters.
+- **500 Internal Server Error**: server error.
+
+When the operation is successful, the JSON response contains the return value of the operation. When the operation is redirected, the `location` field in the returned HTTP header contains the redirect destination address.
+When an input error or server error occurs, the JSON response contains a `error_message` field that describes the error.
+
+In high-availability mode, the server will set `server_version` field in the header to inform the client of the data version of the current server. When clients switch between several different servers, this version number guarantees that the client will not read from an outdated server.
+
+### 2.4.Data Format
+
+The server and clients exchange data in JSON format. When sending a request, the header of the HTTP request should be set with `Accept:application/json, Content-Type:app/json`.
+For example, to create a new vertex, the request header should look like the following:
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.5.URI Format
+
+TuGraph REST API provides access to: web visualization, login, db info, label, index, node, relationship, cypher, task, cpp_plugin, and python_plugin.
+The URI format used for each function is as follows:
+
+| URI     | Description                     |
+| ------- | ------------------------------- |
+| /web    | web visualization               |
+| /cypher | cypher request                  |
+| /acl    | access control                  |
+| /user   | user management                 |
+| /login  | user login                      |
+| /info   | database status and information |
+| /task   | task management                 |
+| /db     | subgraph management             |
+
+For each subgraph, the following interfaces are provided:
+
+| URI                              | Description                         |
+| -------------------------------- | ----------------------------------- |
+| /db                              | create, modify, and delete subgraph |
+| /db/_{graph_name}_/node          | vertex operations                   |
+| /db/_{graph_name}_/relationship  | edge operations                     |
+| /db/_{graph_name}_/label         | label-related operations            |
+| /db/_{graph_name}_/index         | index-related operations            |
+| /db/_{graph_name}_/cypher        | subgraph-specific cypher operation  |
+| /db/_{graph_name}_/cpp_plugin    | C++ plugin(stored procedure)        |
+| /db/_{graph_name}_/python_plugin | Python plugin(stored procedure)     |
+| /db/_{graph_name}_/import        | online import                       |
+| /db/_{graph_name}_/misc          | other operations                    |
+
+## 3.Login
+
+The system creates an administrator by default, whose username is _admin_ and password is _73@TuGraph_. For security reasons, please remember to change your password after first starting the server.
+
+### 3.1.User Login
+
+TuGraph provides JWT-based user authentication. To login to the server, a REST client should send login request with username and password. On success, the client will receive a signed token in the form of Json Web Token (JWT), which should be stored by the client and used for every request that follows.
+
+- **URI**: `/login`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| user     | username    | String |
+| password | password    | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.2.Token Refresh
+
+After the token expires, the front-end initiates a refresh token interface, and the back-end verifies the validity of the token.
+If the verification passes, a new token is generated; if the verification fails, status code 401 is returned.
+
+- **URI**: `/refresh`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.Modify Token Validity Period
+
+To modify the validity period of Token, three parameters need to be transmitted: jwt, refresh_time and expire_time, among which jwt is used to verify the user’s identity. When refresh_time and expire_time are equal to 0, the validity period is indefinite. When refresh_time exceeds, you need to call the refresh interface to obtain a new Token; When expire_time expires, you need to log in again. (This interface call needs to confirm the security by itself, do not call unless necessary)
+
+- **URI**: `/update_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+| refresh_time | Valid time (deafult set to 0) | Int64 |
+| expire_time | Expire time (deafult set to 0) | Int64 |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.Query Token validity period
+To query the validity period of the Token, you need to transmit jwt to verify the user's identity, and return, refresh_time and expire_time, where refresh_time indicates the refresh time, and you need to call the refresh interface to obtain a new Token when it exceeds; expire_time indicates the expiration time, and you need to log in again when it exceeds.
+
+- **URI**: `/get_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return "refresh_time" and "expire_time".
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+### 3.5.Logout
+
+The user logs out and deletes the token at the same time.
+
+- **URI**: `/logout`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+## 4.Query
+
+URI format is:
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.Call Cypher
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description   | Type   |
+| ------ | ------------- | ------ |
+| graph  | subgraph name | String |
+| cypher | Cypher query  | String |
+
+- **RESPONSE**:
+
+| Field   | Description             | Type    |
+| ------- | ----------------------- | ------- |
+| result  | running results         | List    |
+| elapsed | running time in seconds | Float   |
+| header  | header of the results   | List    |
+| size    | number of results       | Integer |
+
+in which `header` is a list with each element in the form of:
+
+| Field | Description                                                | Type   |
+| ----- | ---------------------------------------------------------- | ------ |
+| name  | the name of column                                         | String |
+| type  | column data type, 0 is scalar, 1 is vertex id, 2 is vector |        |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.Call Cypher with Parameters
+
+Cypher supports querying with parameters. When a Cypher query with parameters is called, TuGraph caches the execution plan for that query to speed up the following queries of the same kind.
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type   |
+| ---------- | ------------- | ------ |
+| graph      | subgraph name | String |
+| cypher     | Cypher query  | String |
+| parameters | parameters    | List   |
+
+- **RESPONSE**:
+
+Same as [Call Cypher](#Call-Cypher).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+## 5.Stored Procedures
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.Create Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                                                                       | Type   |
+| ----------- | --------------------------------------------------------------------------------- | ------ |
+| name        | name of the plugin                                                                | String |
+| description | description of the plugin                                                         | String |
+| code_base64 | code of plugin encoded in base64                                                  | String |
+| read_only   | whether it is a read-only stored procedure                                        | Bool   |
+| code_type   | type of plugin code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String |
+
+_Note: read-only plugins are more efficient than write plugins. Always specify `read-only=true` for read-only transactions._
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.so}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 5.2.List Stored Procedures
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list in which each element is a plugin description, in the format of:
+
+| Field       | Description                               | Type   |
+| ----------- | ----------------------------------------- | ------ |
+| name        | name of the stored procedure              | String |
+| description | description of the stored procedure       | String |
+| read_only   | whether the stored procedure is read-only | Bool   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.Retrieve Stored Procedure Detail
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Procedure detail, including code, in the format of:
+
+| Field       | Description                                                                         | Type                   |
+| ----------- | ----------------------------------------------------------------------------------- | ---------------------- |
+| name        | Procedure name                                                                      | String                 |
+| description | Procedure descrition                                                                | String                 |
+| read_only   | Read only or not                                                                    | Bool                   |
+| code_base64 | 存储过程的代码                                                                      | String, Base64 encoded |
+| code_type   | Type of procedue code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String                 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.Call Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: POST
+
+- **REQUEST**: String input.
+
+| Field   | Description                                               | Type   |
+| ------- | --------------------------------------------------------- | ------ |
+| data    | input data                                                | String |
+| timeout | timeout in seconds, defaults to 0, which means no timeout | Float  |
+
+- **RESPONSE**:
+
+| Field  | Description     | Type   |
+| ------ | --------------- | ------ |
+| result | running results | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.Delete Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+## 6.Deprecated
+
+The APIs below will be removed after 4/30/2023.
+
+### 6.1.User Management
+
+#### 6.1.1.Add User
+
+Add a new user and set the initial password for the user. Only administrators have permission to add new users. The username can only have letters, numbers, and underscores, and should not begin with a number. The password can contain any character. The username and password have a maximum length of 64 bytes.
+
+- **URI**: `/user`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                                 | Type   |
+| -------- | ------------------------------------------- | ------ |
+| user     | username                                    | String |
+| password | password                                    | String |
+| is_admin | whether the user is an administrator or not | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "is_admin": false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.Change Password
+
+Users can change their own passwords, in which case the original password needs to be verified.
+
+Administrators can change the passwords of any user and promote non-admin users to administrators, or demote administrator users to regular users. When modifying another user's password, the original password of the user is not needed.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field            | Description                                                                     | Type   |
+| ---------------- | ------------------------------------------------------------------------------- | ------ |
+| current_password | user's current password, if modifying its own password                          | String |
+| new_password     | user's new password                                                             | String |
+| is_admin         | should this user be administrator or not, used when promoting or demoting users | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user/user1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+        "is_admin": true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.3.List All Users
+
+List all users of the database. Only administrators are allowed to perform this operation.
+
+- **URI**: `/user/`
+
+- **METHOD**: GET
+
+- **RESPONSE**: a dictionary of {`user_name`:`is_admin`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+    • 200: OK
+    Output:
+    {
+        "admin": true,
+        "guest1": false
+    }
+
+#### 6.1.4.Delete User
+
+Delete a user from the DB. Only administrators have permission to do so.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.2.Access Control
+
+TuGraph has four access levels. Different users can have different permissions for each subgraph. The four access levels are as follows:
+
+| Access Level | Description                                                                                                               |
+| ------------ | ------------------------------------------------------------------------------------------------------------------------- |
+| NONE         | no access                                                                                                                 |
+| READ         | read-only                                                                                                                 |
+| WRITE        | can read and write vertexes and edges of the subgraph                                                                     |
+| FULL         | full access, including changing metadata (label, index), managing stored procedures and deleting all data in the subgraph |
+
+Administrators have full access on all subgraphs, and a newly created non-admin user does not have access for any subgraph. Users who have full access on a subgraph can set the access level for other users on that subgraph.
+
+#### 6.2.1.Query User's Access Level
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+When both `user` and `graph` are specified, the user's access level for the subgraph is returned, such as `READ`.
+
+When only `user` is specified, all subgraphs that the user can access (access level not `NONE`) are returned, as well as the user's access level on the subgraph.
+
+When only `graph` is specified, all users who have access level on this graph (excluding administrators, who have implicit `FULL` access) and their access levels are returned. This operation requires administrator permission.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/acl/?user=user1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "graph1": "READ",
+      "graph2": "WRITE",
+      "graph3": "FULL"
+    }
+```
+
+#### 6.2.2.Change User's Access Level
+
+- **URI**: `/acl`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field | Description     | Type   |
+| ----- | --------------- | ------ |
+| user  | username        | String |
+| graph | subgraph's name | String |
+| acl   | access level    | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/acl
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "user1",
+        "graph": "graph1",
+        "acl": "FULL"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.Remove User's Access Right
+
+This is equivalent to setting access level to `NONE`.
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/acl/?user=user1&graph=graph1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.Server Status
+
+#### 6.3.1.Modify Server Configuration
+
+Modifying the server configuration will take effect immediately after the configuration modification and will affect all servers. These configurations take precedence over configuration files and command line arguments.
+
+- **URI**: `/config`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+  | Field            | Description                                           | Type |
+  | ---------------- | ----------------------------------------------------- | ---- |
+  | db_async         | Whether to enable asynchronous mode                   | Bool |
+  | optimistic_txn   | Whether to use optimistic transaction lock by default | Bool |
+  | enable_audit_log | Whether to enable audit logging                       | Bool |
+
+- **RESPONSE**: If successful, return status code 200.
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "db_async": true,
+        "enable_audit_log": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.Current Server Status
+
+- **URI**: `/info`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field          | Description                    | Type                                                                                    |
+| -------------- | ------------------------------ | --------------------------------------------------------------------------------------- |
+| lgraph_version | TuGraph version                | String                                                                                  |
+| git_branch     | server's git branch            | String                                                                                  |
+| git_commit     | server's git commit version    | String                                                                                  |
+| web_commit     | web client commit version      | String                                                                                  |
+| cpp_id         | cpp compiler id                | String                                                                                  |
+| cpp_version    | cpp compiler version           | String                                                                                  |
+| python_version | python lib version             | String                                                                                  |
+| cpu            | cpu information                | Dictionary, format refers [CPU Status](#CPU-Status)                                     |
+| disk           | disk IO information            | Dictionary, format refers [Disk Status](#Disk-Status)                                   |
+| memory         | memory information             | Dictionary, format refers [Memory Status](#Memory-Status)                               |
+| db_space       | graph database storage         | Dictionary, format refers [Graph Database Storage](#Graph-Database-Storage)             |
+| db_config      | graph database configuration   | Dictionary, format refers [Graph Database Configuration](#Graph-Database-Configuration) |
+| up_time        | database's online running time | Integer                                                                                 |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.CPU Status
+
+- **URI**: `/info/cpu`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description        | Type    |
+| ------ | ------------------ | ------- |
+| self   | TuGraph CPU usage  | Integer |
+| server | server's CPU usage | Integer |
+| unit   | metric unit        | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.Disk Status
+
+- **URI**: `/info/disk`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description              | Type    |
+| ----- | ------------------------ | ------- |
+| read  | server's disk read rate  | Integer |
+| write | server's disk wrtie rate | Integer |
+| unit  | metric unit              | String  |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.Memory Status
+
+- **URI**: `/info/memory`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description               | Type    |
+| ------------ | ------------------------- | ------- |
+| self         | TuGraph memory usage      | Integer |
+| server_avail | server's available memory | Integer |
+| server_total | server's total memory     | Integer |
+| unit         | metric unit               | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.Database Size
+
+- **URI**: `/info/db_space`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                | Type    |
+| ----- | -------------------------- | ------- |
+| space | total size of the database | Integer |
+| unit  | metric unit                | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.DB Configuration
+
+- **URI**: `/info/db_config`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description                                       | Type    |
+| ------------ | ------------------------------------------------- | ------- |
+| async        | asynchronous mode                                 | Bool    |
+| disable_auth | whether to disable authentication                 | Bool    |
+| enable_ha    | whether to enable high-availability mode          | Bool    |
+| enable_rpc   | whether to enable RPC server                      | Bool    |
+| host         | bound host address                                | String  |
+| port         | port of REST server                               | Integer |
+| rpc_port     | port of RPC server                                | Integer |
+| thread_limit | limit of available threads for the graph database | Integer |
+| use_ssl      | whether to use SSL for authentication             | Bool    |
+| verbose      | verbose level of the output                       | Integer |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "host":"127.0.0.1",
+      "port":7070,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "use_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.7.High Availability Server List
+
+Get a list of replication servers. Valid only in high-availability mode.
+
+- **URI**: `/info/peers`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of server information, each of server information is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+| state        | server state          | String |
+
+The server state can be `MASTER`, `SLAVE`, or `OFFLINE`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.8.Current Leader Information
+
+Get information of current leader. Valid only in HA mode.
+
+- **URI**: `/info/leader`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current leader server information, which is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.9.Server Statistics
+
+- **URI**: `/info/statistics`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current server statistics, which is formatted as:
+
+| Field           | Description                                   | Type    |
+| --------------- | --------------------------------------------- | ------- |
+| requests/second | number of requests processed per second       | Float   |
+| writes/second   | number of write requests processed per second | Float   |
+| running_tasks   | number of requests in progress                | Integer |
+| failure_rate    | request failure rate                          | Float   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 0.023,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.10.Get Audit Logs
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+
+| Field            | Description                                                                                                             | Type      |
+| ---------------- | ----------------------------------------------------------------------------------------------------------------------- | --------- |
+| begin_time       | start time of the queried log (required, format YYYY-mm-dd HH:MM:SS)                                                    | Timestamp |
+| end_time         | end time of the queried log (default is current time, format YYYY-mm-dd HH:MM:SS)                                       | Timestamp |
+| user             | the operator of the queried log (administrator can query all users' logs, ordinary users can only query their own logs) | String    |
+| num_log          | maximum number of logs to return (default 100)                                                                          | Integer   |
+| descending_order | whether to sort the result in descending order(default is true)                                                         | Bool      |
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of audit logs, each of which is an action log in the format of:
+
+| Field      | Description                                        | Type    |
+| ---------- | -------------------------------------------------- | ------- |
+| index      | the index of the operation                         | Integer |
+| begin_time | the start time of the operation                    | String  |
+| end_time   | the end time of the operation                      | String  |
+| user       | the user of the operation                          | String  |
+| graph      | the graph of the operation                         | String  |
+| type       | the type of the operation                          | String  |
+| read_write | the operation is read operation or write operation | String  |
+| success    | whether the operation is successful                | Bool    |
+| content    | the content of the operation                       | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.Task Management
+
+TuGraph tracks long-running tasks such as complex Cypher queries and plugins. Administrators can query currently running tasks through the REST API and choose to abort the queries if necessary.
+
+The URI format for task management is :
+
+```
+    http://{host}:{port}/task/{task_id}
+```
+
+#### 6.4.1.List Running Tasks
+
+- **URI**: `/task`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+The returned JSON is an array, each of which is formatted as follows:
+
+| Field        | Description                                      | Type   |
+| ------------ | ------------------------------------------------ | ------ |
+| description  | the description of the task                      | String |
+| time_elapsed | time the task has been executing for, in seconds | Float  |
+| task_id      | the ID of the task                               | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.Abort Task
+
+- **URI**: `/task/{task_id}`
+
+Where `task_id` is the `task_id` returned by `GET /task` .
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.5.Subgraph Management
+
+TuGraph supports multiple subgraphs and all subgraphs are completely independent from others. Different subgraphs can have different permissions to different users. Administrators can add, modify and delete subgraphs.
+
+#### 6.5.1.Create New Subgraph
+
+- **URI**: `/db`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description                   | Type                                                                |
+| ------ | ----------------------------- | ------------------------------------------------------------------- |
+| name   | the name of subgraph          | String                                                              |
+| config | the configuration of subgraph | Dictionary, in the format of {{column name 1}:{column value 1},...} |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1"
+        "config" : {
+            "max_size_GB":2048,
+            "async":True
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.Delete Subgraph
+
+- **URI**: `/db/{graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.List All Subgraphs
+
+- **URI**: `/db`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of all subgraphs.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_gb":1024,
+            "async":false
+        }
+    }
+```
+
+### 6.6.Label
+
+TuGraph is a strong-schema database. In each subgraph, each vertex and edge need to have a predefined data format. The data format is determined by Label. Users can use the REST API to add, delete, and query labels and their corresponding data format.
+
+The URI format of the Label operation is
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+Where the {type} can be `node` or `relationship`.
+
+#### 6.6.1.Create Label
+
+A label is created with a fixed data format. A label must be defined before any node or relationship can be created with that label.
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field            | Description                  | Type   |
+| ---------------- | ---------------------------- | ------ |
+| name             | the name of label            | String |
+| fields           | data column definition       | List   |
+| is_vertex        | whether it is a vertex Label | Bool   |
+| primary          | vertex primary property      | String |
+| edge_constraints | edge constraints             | List   |
+
+`primary` should be set when `is_vertex` is `true`. This field is only available for Vertex, and must be set when creating Vertex.
+
+`edge_constraints` could be set when `is_vertex` is `false`, This field is only available for Edge. This field limits the combination of starting and ending vertex of the edge, for example: `[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, just leave this field unset.
+
+In which `fields` is an array, in which each element defines a column of data, as follows:
+
+| Field    | Description                                                | Type                                                                                                         |
+| -------- | ---------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------ |
+| name     | the name of the column                                     | String                                                                                                       |
+| type     | the data type of the column                                | String, with following types: int8, int16, int32, int64, float, double, string, date, datetime, binary, blob |
+| optional | whether the data can be empty (optional, default is false) | Bool                                                                                                         |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.List All Labels
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description               | Type |
+| ------ | ------------------------- | ---- |
+| edge   | the list of edge labels   | List |
+| vertex | the list of vertex labels | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.Get Label Data Format
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Data column definition table as a dictionary, in which each key is the column name, and corresponding value is the column definition defined as follows:
+- | Field    | Description                           | Type   |
+  | -------- | ------------------------------------- | ------ |
+  | optional | whether the column value can be empty | Bool   |
+  | type     | the type of the column value          | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema Import
+
+- **URI**: `/db/{graph_name}/schema/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description              | Type   |
+| ----------- | ------------------------ | ------ |
+| description | Graph labels description | String |
+
+The detail description can refer to `TuGraph Manual`.
+
+- **RESPONSE**:
+
+Schema import will check the new schema and original schema in database if compatible or not. If yes, this request will add the label only in new schema. If no, will return an error code.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.Vertex Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+in which `vid` is a unique integer identifying the vertex, which can be obtained when creating new vertexes or by looking up index.
+
+#### 6.7.1.List Vertex and Label Number
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field      | Description                | Type    |
+| ---------- | -------------------------- | ------- |
+| num_label  | the number of vertex label | Integer |
+| num_vertex | the number of vertex       | Integer |
+
+_Note: `num_vertex` returns an estimate of the number of vertexes, not the exact number. To get the exact number, please use Cypher queries._
+
+#### 6.7.2.Create New Vertex
+
+Insert a vertex into the database.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                  | Type       |
+| -------- | ---------------------------- | ---------- |
+| label    | the name of label            | String     |
+| property | the properties of the vertex | Dictionary |
+
+in which `property` is a dictionary of {`column_name`:`column_value`}.
+
+- **RESPONSE**: if successful, return status code 200 and the new vertex's vid, which can be used in later vertex operations.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.Batch Create Vertexes
+
+TuGraph allows multiple vertices to be inserted as one batch to reduce network overhead.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description               | Type   |
+| ------ | ------------------------- | ------ |
+| label  | the name of Label         | String |
+| fields | the column names          | List   |
+| values | the values of each vertex | List   |
+
+in which `fields` is a list of strings specifying column names, and `values` is a list in which each element is a list of `column_values` corresponding to the column names as specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200, and return the vid list of newly added vertices in the JSON content, where each vid corresponds to each vertex in the request.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.Get Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description       | Type                                                             |
+| -------- | ----------------- | ---------------------------------------------------------------- |
+| label    | the name of Label | String                                                           |
+| property | property          | Dictionary, in the format of {column_name_1:column_value_1, ...} |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.Delete Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200, and also the following content in JSON:
+
+| Field | Description                                    | Type    |
+| ----- | ---------------------------------------------- | ------- |
+| in    | number of incoming edges of the deleted vertex | Integer |
+| out   | number of outgoing edges of the deleted vertex | Integer |
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.Get Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Vertex properties as a dictionary of {`column_name`:`column_value`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.Get Vertex Field
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Value corresponding to the specified `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.Update Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description          | Type       |
+| -------- | -------------------- | ---------- |
+| property | properties to update | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "13737299333"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.8.Edge Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+in which `euid` is a string uniquely identifying the edge, which can be obtained when creating edges or by iterating through the edges of a vertex.
+
+#### 6.8.1.Create Edge
+
+- **URI**: `/db/{graph_name}/node/{src_vid}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                     | Type       |
+| ----------- | ------------------------------- | ---------- |
+| label       | the label of edge               | String     |
+| destination | the `vid` of destination vertex | Integer    |
+| property    | the property of edge            | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200 and the `euid` of new created edge (type is String).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.Batch Create Edges
+
+- **URI**: `/db/{graph_name}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description          | Type   |
+| ------ | -------------------- | ------ |
+| label  | the label of edge    | String |
+| fields | the data column name | List   |
+| edge   | the data of edge     | List   |
+
+where the edge is a list of data, each of which specifies and edge, defined as follows:
+
+| Field       | Description           | Type    |
+| ----------- | --------------------- | ------- |
+| source      | source vertex id      | Integer |
+| destination | destination vertex id | Integer |
+| values      | the data list         | List    |
+
+in which `values` is a list of column values, each of which correspond to the a column name specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200 and the list of `euid`s of the newly created edges.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.List Out-going Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of source vertex's out-going edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.List Incoming Edges
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of destination vertex's incoming edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.List All Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                     | Type |
+| ----- | ------------------------------- | ---- |
+| in    | list of incoming edges' `euid`s | List |
+| out   | list of outgoing edges' `euid`s | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.Get Edge Information
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description                | Type       |
+| -------- | -------------------------- | ---------- |
+| label    | the label of the edge      | String     |
+| property | the properties of the edge | Dictionary |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.Delete Edge
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.Get Edge Properties
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The dictionary of edge's properties.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.Get Edge Field
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the value corresponding to given `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.Update Edge Property
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description              | Type       |
+| -------- | ------------------------ | ---------- |
+| property | properties to be updated | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.9.Index
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+#### 6.9.1.Create Index
+
+Create an index on a (label, field) pair. Blocks until the index is successfully built.
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field     | Description                          | Type   |
+| --------- | ------------------------------------ | ------ |
+| label     | the name of label                    | String |
+| field     | field to be indexed                  | String |
+| is_unique | whether this index is a unique index | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.List All Indexes
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.List Indexes Related with Specified Label
+
+- **URI**: `/db/{graph_name}/index/{label}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.Delete Index
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.Get Vertex by Index
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of `vid`s.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+
+
+
+### 6.10.Data Import
+
+- **URI**: `/db/{graph_name}/import/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field             | Description                                                                                        | Type                       |
+|-------------------|----------------------------------------------------------------------------------------------------|----------------------------|
+| description       | description of the file content                                                                    | String                     |
+| data              | contents of the file to be imported (recommended to have a size of 16MB, has a hard limit of 17MB) | Strings / Arrays / Objects |
+| continue_on_error | whether to continue import when an error occurred (optional, default is `false`)                   | Bool                       |
+| delimiter         | delimiter used in the data file (optional, default is `“,”`)                                       | String                     |
+
+The details of the `description` field can be found in [TuGraph Import Tool](../../3.server-tools/1.data-import.md).
+
+`delimiter` can be a single character or multi-character string, but must not contain `\r` or `\n`.
+
+`data` can be one of the following:
+
+- String, such as `"1,2\n3,4\n"`
+- Array of ASCII codes, such as `[49,44,50,10,51,44,52,10]`
+- Dictionary shaped like the above array, such as `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+* **RESPONSE**:
+
+The system **will not** automatically perform actions such as creating a new label, adding an index, and so on. Before you do this, please make sure that the label involved already exists and has an appropriate index.
+
+If the import is successful, return code 200 and return log information (possibly empty) in the `log` field. Otherwise, returns status code 400. None of the data is imported on failure, and error message is set in `error_message`.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+Because the request specifies `continue_on_error: true`, the returned `log` indicates that the first edge cannot be inserted because there is no vertex with uid==1, while the second edge was imported successfully.
+
+### 6.11.Miscellany
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.Extract Subgraph
+
+Give a set of `vid`s and return the minimum subgraph which contains the vertex set and the edges between them.
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type |
+| ---------- | ------------- | ---- |
+| vertex_ids | vertex id set | List |
+
+- **RESPONSE**:
+
+| Field         | description        | Type                                                               |
+| ------------- | ------------------ | ------------------------------------------------------------------ |
+| nodes         | vertex information | List, each element contains vid, label, and properties.            |
+| relationships | edge information   | List, each element contains src, dst, euid, label, and properties. |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
new file mode 100644
index 0000000000..30d3e01fa5
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
@@ -0,0 +1,268 @@
+# RPC API
+
+> This document mainly introduces the details of calling TuGraph's RPC API.
+
+## 1.Introduction
+
+TuGraph provides rich RPC APIs for developers to remotely call the services provided by TuGraph through RPC requests.
+
+RPC (Remote Procedure Call) is a protocol for requesting services from remote computer programs through a network without the need to understand the underlying network technology.
+Compared with REST, RPC is method-oriented and mainly used for calling function methods. It is suitable for more complex communication scenarios and has higher performance.
+brpc is an industrial-grade RPC framework written in C++. Based on brpc, TuGraph provides rich RPC APIs. This document describes how to use TuGraph's RPC API.
+
+## 2.Request
+
+### 2.1.Establishing a Connection
+
+When developers send RPC requests to TuGraph services, they must first establish a connection. Taking C++ as an example, developers create a channel with the specified URL and create a specified service stub (LGraphRPCService_Stub) from the channel. Subsequently, they can send requests to the remote server through the stub like calling local methods.
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.Request Types
+
+TuGraph supports 10 types of RPC requests, and each request's functionality is shown in the following table:
+
+| Request              | Functionality         |
+|-----------------|------------|
+| GraphApiRequest | Vertex-Edge Index   |
+| CypherRequest   | cypher   |
+| PluginRequest   | Stored Procedures     |
+| HARequest       | High Availability    |
+| ImportRequest   | Data Import     |
+| GraphRequest    | Subgraph Operations     |
+| AclRequest      | Access Control     |
+| ConfigRequest   | Configuration     |
+| RestoreRequest  | Backup       |
+| SchemaRequest   | Schema Management |
+
+When a user sends a request, the following parameters need to be passed in:
+- client_version: an optional parameter, in HA mode, it can prevent outdated responses by comparing `client_version` and `server_version`
+- token: a necessary parameter, the client obtains the token after logging in, and the token is passed in with each request to verify the user's identity
+- is_write_op: an optional parameter, indicating whether the request is a write request
+- user: an optional parameter, set user when synchronizing requests between master and slave in HA mode, and no token verification is required After the service processes the RPC request, it sends back a response.
+
+In addition to containing separate response information for each request, the response message also includes the following parameters:
+- error_code: a necessary parameter, indicating the processing status of the request
+- redirect: an optional parameter, when processing fails to send a write request to a follower in HA mode, set redirect as the request forwarding address, that is, the leader address
+- error: an optional parameter, indicating the error information of the request
+- server_version: an optional parameter, set `server_version` in the HA mode request response to avoid reverse time travel when client reads data
+
+:warning:  **Except for CypherRequest, PluginRequest, HARequest and AclRequest, all other RPC interfaces will be gradually deprecated, and their functions will be unified into the CypherRequest interface.**
+
+## 3.Login
+
+The login request message contains the following parameters:
+- user: a necessary parameter, the username
+- pass: a necessary parameter, the password
+
+Taking C++ as an example, the user sends a login request using the constructed service stub:
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+The login response message contains the following parameters:
+- token: a necessary parameter. After successful login, a signed token, namely Json Web Token, will be received. The client stores the token and uses it for each subsequent request. If the login fails, an "Authentication failed" error will be received.
+
+## 4.Query
+Users can interact with TuGraph through Cypher queries. The Cypher request message contains the following parameters:
+- query: a necessary parameter, the Cypher query statement
+- param_names: an optional parameter, the parameter name
+- param_values: an optional parameter, the parameter value
+- result_in_json_format: a necessary parameter, whether to return the query results in JSON format
+- graph: an optional parameter, the subgraph name for executing the Cypher statement
+- timeout: an optional parameter, the timeout for executing the Cypher statement
+
+Taking C++ as an example, the user sends a Cypher request as follows:
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+The Cypher request response contains one of the following two parameters:
+- json_result: the Cypher query result in JSON format
+- binary_result: the Cypher query result in the CypherResult format
+
+## 5.Stored Procedures
+To meet users' more complex query/update logic, TuGraph supports stored procedures written in C and Python. Users can use RPC requests to perform CRUD operations on stored procedures.
+
+### 5.1.Load Stored Procedures
+The request for loading stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- read_only: a necessary parameter, whether it is read-only
+- code: a necessary parameter, the ByteString generated by reading the stored procedure file
+- desc: an optional parameter, the stored procedure description
+- code_type: an optional parameter, the stored procedure code type, which can be PY, SO, CPP, or ZIP
+
+Taking C++ as an example, the user loads the stored procedure as follows:
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for loading the stored procedure does not contain parameters, and if the loading fails, a BadInput exception will be thrown.
+
+### 5.2.Invoke Stored Procedures
+
+The request for invoking stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- param: a necessary parameter, the stored procedure parameters
+- result_in_json_format: an optional parameter, whether to return the invocation result in JSON format
+- in_process: an optional parameter, to be supported in the future
+- timeout: an optional parameter, the timeout for invoking the stored procedure
+
+Taking C++ as an example, the user invokes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+The response for invoking the stored procedure contains one of the following two parameters:
+- reply: the stored procedure invocation result in the ByteString format
+- json_result: the stored procedure invocation result in JSON format
+
+### 5.3.Delete Stored Procedures
+
+The request for deleting stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+
+Taking C++ as an example, the user deletes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for deleting the stored procedure does not contain parameters, and if the deletion fails, a BadInput exception will be thrown.
+
+### 5.4.List Stored Procedures
+
+The request for listing stored procedures does not require parameters. Taking C++ as an example, the user lists the stored procedures as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+The response for listing the stored procedures contains the following parameter:
+- reply: the procedure list in JSON format
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst
new file mode 100644
index 0000000000..484e600e87
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Protocol
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
new file mode 100644
index 0000000000..9015bc7e20
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
@@ -0,0 +1,70 @@
+# Learning Tutorial
+
+> This document is designed as a guide for TuGraph users. Before reading the detailed documentation, users should first read this document to have a general understanding of the graph learning process of TuGraph, which will make it easier to read the detailed documentation later. The guide program is based on a simple program instance of TuGraph, and we will focus on its usage.
+
+## 1. TuGraph Graph Learning Module
+The TuGraph graph learning module samples graph data in TuGraph, and the sampled nodes and edges are used as features for graph learning and training. The running process is shown in the following figure:
+
+![Alt text](../../../../../images/learn_flow_chart_en.png)
+
+## 2. Data Import
+Please refer to [Data Import](../../../5.developer-manual/3.server-tools/1.data-import.md) for data import.
+
+Taking the cora dataset as an example for the import process:
+
+Execute in the build/output directory:
+
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+Where cora.conf is the graph schema file representing the format of the graph data. cora_db is the imported graph data file name representing the storage location of the graph data.
+
+## 3. Feature Conversion
+Since the features in graph learning are generally represented as long float arrays, TuGraph does not support loading float array types, so they can be imported as string types and converted to char* for subsequent storage and access, and the implementation details can refer to the feature_float.cpp file.
+
+The specific execution process is as follows:
+
+Compile the imported plugin in the build directory:
+
+`make feature_float_embed`
+
+Execute in the build/output directory:
+
+`./algo/feature_float_embed ./cora_db`
+
+Then the conversion can be performed.
+
+## 4. Sampling Operators and Compilation
+TuGraph implements an operator for obtaining the full graph data and four sampling operators at the cython layer, as follows:
+
+### 4.1.Sampling Operator Introduction
+|Sampling Operator | Sampling Method |
+| --- | --- |
+|GetDB | Get the graph data from the database and convert it into the required data structure |
+|Neighbor Sampling | Sample the neighboring nodes of the given node to obtain the sampling subgraph |
+|Edge Sampling | Sample the edges in the graph according to the sampling rate to obtain the sampling subgraph |
+|Random Walk Sampling | Conduct a random walk based on the given node to obtain the sampling subgraph |
+|Negative Sampling | Generate a subgraph of non-existent edges|
+### 4.2.Compilation
+Execute in the tugraph-db/build folder:
+
+`make -j2`
+
+Or execute in the tugraph-db/learn/procedures folder:
+
+`python3 setup.py build_ext -i`
+
+Once the algorithm so is obtained, it can be used by importing it in Python.
+
+5. Training
+TuGraph calls the cython layer operator at the Python layer to implement graph learning and training.
+
+The usage of the TuGraph graph learning module is as follows:
+
+Execute in the tugraph-db/learn/example folder:
+
+`python3 train_full_cora.py`
+
+Then training can be performed.
+
+If the final printed loss value is less than 0.9, the training is successful.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
new file mode 100644
index 0000000000..c649fa50e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
@@ -0,0 +1,102 @@
+# Sampling API
+
+>This document provides a detailed guide on using the Sampling API of TuGraph.
+
+## 1. Overview
+This manual introduces the Sampling API using TuGraph.
+
+## 2. Graph Data Instantiation
+Before the sampling operation, load the graph data according to the graph data path, and map it into the olapondb graph analysis class, the code is as follows:
+
+```python
+galaxy = PyGalaxy(args.db_path) # Create a galaxy instance based on the path
+galaxy.SetCurrentUser(args.username, args.password) # Set the current user
+db = galaxy.OpenGraph('default', False) # Open the graph database specified by db
+txn = db.CreateReadTxn() # Create a transaction instance
+olapondb = PyOlapOnDB('Empty', db, txn) # Instantiate OlapOnDB based on the graph loading method, graph database instance, and transaction instance
+del txn
+del db
+del galaxy
+```
+## 3. Introduction to Sampling Operators
+The graph sampling operator is implemented in the cython layer and is used to sample the input graph. The generated NodeInfo is used to save point information such as feature attributes and label attributes, and EdgeInfo is used to save edge information. These metadata information can be used for features Extraction, network embedding and other tasks. Currently, the TuGraph graph learning module supports five sampling operators: GetDB, NeighborSampling, EdgeSampling, RandomWalkSampling, and NegativeSampling.
+
+### 3.1.RandomWalk Operator
+Random walks are performed a specified number of times around the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.2.NeighborSampling Operator
+A certain number of nodes are sampled from the first-degree neighbors of the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.3.NegativeSampling Operator
+The negative sampling algorithm is used to generate a subgraph of non-existent edges.
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+num_samples: The number of false edges to be generated.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.4.EdgeSampling Operator
+The edge sampling algorithm is used to generate a subgraph of sampled edges.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_rate: The sampling rate of the edges to be selected.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.5.GetDB Operator
+Get the graph data from the database and convert it into the required data structure.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+## 4. User-Defined Sampling Algorithm
+Users can also implement a custom sampling algorithm through the TuGraph Olap interface. For the interface document, see [here](../2.olap/5.python-api.md). This document mainly introduces the interface of related functions used by the graph sampling algorithm design.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md
new file mode 100644
index 0000000000..a5a03f8d23
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md
@@ -0,0 +1,101 @@
+# Training
+> This document details how to use TuGraph for training Graph Neural Networks (GNNs).
+
+## 1. Training
+When using TuGraph's graph learning module for training, it can be divided into two categories: full graph training and mini-batch training.
+
+Full graph training involves loading the entire graph from the TuGraph db into memory and training the GNN. Mini-batch training uses the sampling operator of the TuGraph graph learning module to sample the entire graph data and then input it into the training framework for training.
+
+## 2. Mini-Batch Training
+Mini-batch training requires the use of TuGraph's graph learning module's sampling operators, which currently support Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. The sampling result of the TuGraph graph learning module's sampling operator is returned in the form of a List.
+
+The following takes Neighbor Sampling as an example to introduce how to convert the sampled results into the training framework for format conversion.
+The user needs to provide a Sample class:
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. Load graph data
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+        # 2. Sampling method, the result is stored in NodeInfo and EdgeInfo
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+        # 3. Format conversion of the result to fit the training format
+        src = EdgeInfo[0].astype('int64')
+        dst = EdgeInfo[1].astype('int64')
+        nodes_idx = NodeInfo[0].astype('int64')
+        remap(src, dst, nodes_idx)
+        features = NodeInfo[1].astype('float32')
+        labels = NodeInfo[2].astype('int64')
+        g = dgl.graph((src, dst))
+        g.ndata['feat'] = torch.tensor(features)
+        g.ndata['label'] = torch.tensor(labels)
+        return g
+```
+As shown in the code, the graph data is first loaded into memory. Then use the sampling operator to sample the graph data, and the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and the stored information results are as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Finally, we format the result to fit the training format. Here we use the DGL training framework, so we construct a DGL Graph using the result data, and then return the DGL Graph.
+
+Once we provide the TuGraphSample class, we can use it for Mini-Batch training. Let the data loading part of DGL use the sampler instance of TuGraphSample as follows:
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+Use DGL for model training:
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+## 3. Full-Batch training
+Full-Batch training of GNNs (Graph Neural Networks) is a type of training that involves processing the entire training dataset at once. It is one of the simplest and most straightforward training methods for GNNs, where the entire graph is treated as a single instance. In full-batch training, the entire dataset is loaded into memory and the model is trained on the entire graph. This type of training is especially useful for small to medium-sized graphs, and is mainly used for static graphs that do not change over time.
+```python
+getdb. Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+The full graph are then fed into the training framework for training.
+Full code: learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/index.rst
new file mode 100644
index 0000000000..fbc920ad54
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/5.learn/index.rst
@@ -0,0 +1,8 @@
+TuGraph Learn
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/index.rst
new file mode 100644
index 0000000000..8391b4f678
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/6.interface/index.rst
@@ -0,0 +1,12 @@
+TuGraph DB Interface
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.cypher.md
+   2.olap/index.rst
+   3.procedure/index.rst
+   4.protocol/index.rst
+   5.learn/index.rst
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/7.quality/1.unit-testing.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/7.quality/1.unit-testing.md
new file mode 100644
index 0000000000..2cdb8d3f31
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/7.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# Unit Testing
+
+> This document is the unit testing documentation for TuGraph.
+
+## 1.Introduction
+
+TuGraph unit testing uses the gtest framework, which can choose to run all tests at once or specify certain tests.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/7.quality/2.integration-testing.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/7.quality/2.integration-testing.md
new file mode 100644
index 0000000000..4cfb4dea4a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/7.quality/2.integration-testing.md
@@ -0,0 +1,400 @@
+# Integration Testing
+
+> This document mainly introduces how to use the TuGraph integration testing framework.
+
+## 1.The Significance of TuGraph Integration Testing
+
+In unit tests and function tests, some test cases directly use Galaxy or Statemachine to perform tests, which is not a complete process. In the complete CS architecture, user requests are sent to the server through the client, and network communication is essential. To avoid bugs caused by incomplete unit testing, TuGraph uses an integration testing framework to perform end-to-end testing.
+
+## 2.TuGraph Integration Testing Framework
+
+TuGraph uses the Pytest framework as its integration testing framework. Pytest is currently the most widely used CS-side integration testing framework. It is known for its flexibility, ease of use, and the ability to support parameterization. Based on the functionality provided by Pytest, TuGraph abstracts different tools and controls the processing logic of each tool through parameters to facilitate efficient testing code development.
+
+For more information on Pytest, please refer to the official website: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.Component Description
+
+| Component Name    |Component Function      | Implementation Method                              |
+| --------------- | -------------------------- | ------------------------------------------------ |
+| server          | TuGraph standalone service | Start a child process and launch the service       |
+| client          | TuGraph Rpc Client         | Open TuGraph Python Rpc Client in the current process and send requests  |
+| importor        | TuGraph Importor           | Start a child process to process import requests               |
+| exportor        | TuGraph Exportor           | Start a child process to process export requests               |
+| backup_binlog   | TuGraph Backup Binlog      | Start a child process to process binlog backup requests       |
+| backup_copy_dir | TuGraph Backup             | Start a child process to process full db backup requests       |
+| build_so        | Component for compiling C++ dynamic libraries    | Start a child process to handle GCC compilation logic            |
+| copy_snapshot   | TuGraph Copy Snapshot      | Handle backup snapshot requests in the current process                 |
+| copydir         | Folder copy                 | Handle folder copy requests in the current process                     |
+| exec            | Execute C++/Java executable files     | Start a child process to launch the C++ executable file  |
+| algo            | Execute algorithm                   | Start a child process to run the algorithm     |
+| bash            | Execute bash commands               | Start a child process to execute bash commands      |
+| rest            | TuGraph Python Rest Client | Open TuGraph Python Rest Client in the current process and send requests|
+
+### 2.2.Component Usage
+
+#### 2.2.1.server
+
+##### 2.2.1.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The server will be started before the function starts executing, and the server will be stopped and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ host is the IP and port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to the user in the TuGraph Server
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The client will be started before the function starts executing, and the client will be stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.Startup Command
+
+Import the tool through the fixtures component and control the import of different data through startup parameters. The data will be imported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.Startup Command
+
+Import the tool through the fixtures component and control the export of different data through startup parameters. The data will be exported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.Startup Parameters
+采用python字典传入
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different binlogs through startup parameters. The binlogs will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different databases through startup parameters. The database will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command, passed in as a Python list, and multiple so can be compiled at once
++ so_name is the dynamic library that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_plugins/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_plugins/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.Startup Command
+
+Import the tool through the fixtures component and control the compilation of different dynamic libraries through startup parameters. The dynamic libraries will be generated to the specified directory before the function starts executing, and the dynamic libraries specified in the so_name list will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original database
++ dst is the snapshot copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.Startup Command
+Import the tool through the fixtures component and control the copying of different snapshots through startup parameters. The snapshot in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original directory
++ dst is the directory copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.Startup Command
+Import the tool through the fixtures component and control the copying of different directories through startup parameters. The directory in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+EXECOPT = {
+        "cmd" : "rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.Startup Command
+Import the tool through the fixtures component and control the execution of different logic through startup parameters. A child process will be started to execute the command passed in through the cmd parameter before the function starts executing.
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ result is the expected execution result of the algorithm. After execution is completed, the actual result will be compared with the expected result. If they are different, the test will fail.
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.Startup Command
+Import the tool through the fixtures component and control the execution of different algorithm logic through startup parameters. A child process will be started to execute the algorithm passed in through the cmd parameter before the function starts executing. The function body will wait for the algorithm to complete and compare the result with the expected result.
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.Startup Command
+
+Import the tool through the fixtures component and control the execution of different bash commands through startup parameters. A child process will be started to execute the bash command passed in through the cmd parameter before the function starts executing. The function body will wait for the command to complete.
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ port is the port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to user in TuGraph Server
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.Startup Command
+
+Import the tool through the fixtures component and link to different TuGraph Rest Servers through startup parameters. The client will be started before the function starts executing and stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.Test Cases
+
+#### 2.3.1.rest
+
+In the sample code, before the test_get_info function is executed, the server is started, and a rest client is started after the server is started. After entering the test_get_info function, some information about the server is obtained, and assert is used to determine whether cpu information is obtained.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+In the sample code, before the test_flushdb function is executed, the offline data import logic is executed and the server is started. After creating a connection through the client, the function enters the test_flushdb function. The number of points is queried to determine whether the import is successful. After the import is successful, the flushDB operation is executed. assert is used again to determine whether the db can be emptied normally.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+In the sample code, before the test_export_default function is executed, the offline data import logic is executed. After the import is successful, the data of the current db is exported. Then, the offline import logic is used again to import the exported data into a new directory. The newly imported data is used to start the db and create a connection. In the body of the test_export_default function, it is determined whether the data after export and import is consistent with the original data.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.Other Tests
+For more test cases, please refer to the integration test code [https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/7.quality/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/7.quality/index.rst
new file mode 100644
index 0000000000..c6be070cb8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/7.quality/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Quality
+==============================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/8.other/1.privilege.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/8.other/1.privilege.md
new file mode 100644
index 0000000000..59c569b9f7
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/8.other/1.privilege.md
@@ -0,0 +1,135 @@
+# Privilege
+
+## 1.Introduce
+
+> The permissions of TuGraph are managed based on role-based access control. The permissions that define access control are assigned to roles, and the roles are then assigned to users.
+
+## 2.Level of permissions
+
+- Global layer: indicates global permissions, which have permissions for management and graph operations.
+- Graph layer: control permissions on each graph;
+- Property level (Commercial version only) : control permissions on a property
+
+## 3.Permission keyword
+
+At present, the control of permissions is relatively simple
+
+- The Global layer currently has admin permission, and the admin user is preset.
+
+* The Graph layer has four operation permissions: none, read, write, and full
+
+- none: No permission, no operation permission for the graph
+- read: Read-only permission, only has read permission for the graph
+- write: Read and write permission, not only has read permission for the graph, but also has write permission
+- full: All permissions, not only have read and write permissions for graphs, but also have permissions to delete graphs, modify graphs, and modify schemas
+
+* The Property layer (Commercial version only)  has the following permissions: none, read, and write
+
+- none: No permission, no operation permission for the property
+- read: Read-only permission, only has read permission for the property
+- write: Read and write permission, not only has read permission for the property, but also has write permission
+
+## 4.Common permission operations
+
+### 4.1.User action
+
+- Creating a user
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- Deleting a user
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- Change the password of the current user
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- Changes the password of a specified user
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- Disable or enable a user
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- List all users
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- Lists the current user information
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- Obtain user details
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.Role actions
+
+- Create a role
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- Delete a role
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- List all characters
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- Disable or enable the role
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.Assign roles to users
+
+- Adds the association between the user and the role
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- Deletes the association between the user and the role
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- Clears the relationship between user roles and rebuilds them
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.Role empowerment
+
+- Modifies the access permission of a role to a specified graph
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/8.other/2.token.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/8.other/2.token.md
new file mode 100644
index 0000000000..ecf60e2ce9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/8.other/2.token.md
@@ -0,0 +1,39 @@
+# Token Usage Guide
+## 1. Introduction to Token
+JWT (JSON Web Token) is an open standard used for authentication and authorization. It is based on the JSON (JavaScript Object Notation) format and is designed for securely transmitting claim information between network applications.
+
+JWT consists of three parts: the header, payload, and signature. The header contains the type of JWT and the signature algorithm used, the payload contains the information to be transmitted, and the signature is used to verify the integrity and authenticity of the JWT.
+
+In TuGraph, JWT is used to implement a stateless authentication and authorization mechanism. After a user logs in successfully, the server generates a JWT and returns it to the client. The client passes this JWT as an identity credential in subsequent requests to the server. Upon receiving the JWT, the server verifies the signature and parses the information in the payload to determine the user's identity and permissions, and decides whether to allow the execution of the request.
+
+## 2. Token Expiration
+### 2.1. Browser Token Interaction Logic
+1. The user opens the browser, enters the username and password, and clicks login.
+2. The frontend calls the login interface and inputs the account and password to the backend.
+3. After receiving the account and password, the backend verifies them and returns a Token.
+4. The frontend stores the Token in the browser cache, and all subsequent requests must carry this Token.
+5. If the frontend actively clicks logout or closes the page, it should actively call the logout interface and pass the Token to the backend.
+6. After receiving the Token, the backend invalidates it, returns a status code 200, and "logout successful". After receiving the message, the frontend clears the Token in the browser memory, and returns to the login page.
+7. The Token expires (initially set to 24 hours), and the user needs to log in again.
+### 2.3. Token Expiration Refresh Mechanism
+Token expiration has a refresh mechanism that is turned off by default. If turned on, the security of the Token will be higher, and there will be two timestamps.
+
+The first timestamp `refresh_time` is used to determine whether the Token has expired (default 24 hours): after expiration, the refresh interface can be called to obtain a new Token, which can be set to a shorter time, such as 1 hour.
+
+The second timestamp `expire_time` is the forced expiration timestamp (default 24 hours): after expiration, the user must log in again.
+
+### 2.4. Token Expiration Modification
+To facilitate developers to develop on their own, TuGraph provides two ways to modify the expiration time, both of which require admin privileges.
+
+* Set through the interface call. The interfaces involved in modifying the expiration time are `update_token_time` and `get_token_time` for querying the expiration time. For details, please refer to the [REST interface document](../../5.developer-manual/6.interface/4.protocol/1.restful-api.md).
+* Set through startup parameters. When the server-side is started, adding the parameter `-unlimited_token 1` can set the Token to be unlimited. Please refer to the [service running document](../../5.developer-manual/2.running/2.tugraph-running.md) for details.
+## 3. Introduction to Token-Related Requests Sent by Clients
+The client handles two types of protocol-related requests: REST and RPC.
+
+### 3.1. REST
+If the client uses the REST protocol (including the browser), because it is a short connection, Token needs to be carried in every request, and a new Token needs to be obtained after it expires.
+
+For self-developed clients, if the REST protocol is used, Token logic needs to be considered.
+
+### 3.2. RPC
+If the client uses the RPC protocol (including the official C++/Java/Python), it uses a long connection to maintain, and no Token operation is involved after login.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/8.other/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/8.other/index.rst
new file mode 100644
index 0000000000..d2e81f6ec7
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/8.other/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Other
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/index.rst
new file mode 100644
index 0000000000..4900dd0189
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/5.developer-manual/index.rst
@@ -0,0 +1,15 @@
+TuGraph DB Developer Manual
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.installation/index.rst
+   2.running/index.rst
+   3.server-tools/index.rst
+   4.client-tools/index.rst
+   5.ecosystem-tools/index.rst
+   6.interface/index.rst
+   7.quality/index.rst
+   8.other/index.rst
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/1.contributing.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/1.contributing.md
new file mode 100644
index 0000000000..f68e91fda6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/1.contributing.md
@@ -0,0 +1,81 @@
+# TuGraph Contribution Guide
+
+## 1. Preface
+
+Thank you for your contribution to TuGraph. We sincerely hope that more students from the community will join in and build a better graph database project together.
+
+Before contributing code, please take some time to understand the process of contributing code to TuGraph, and read the "Contributor License Agreement". Participating in the contribution is deemed to agree to the above agreement.
+
+Individual Contributor License Agreement: [4.individual_cla.md]
+
+Corporate Contributor License Agreement: [5.corporate_cla.md]
+
+## 2. What to contribute
+
+We welcome any contribution at any time, whether it's a simple typo fix, bug fix, or new feature addition. Feel free to ask questions or initiate PRs. We also value documentation and integration with other open source projects, and welcome contributions in this regard. For any modification, especially the more complex modification, it is recommended to create an issue and fill it out according to the BUG or PR template.
+
+## 3. Preparation
+
+Before contributing code, you need to understand the use of git tools and the use of GitHub website.
+
+## 4. Contribute code process
+
+### 4.1. Submit the issue
+
+Whether you are fixing a bug in TuGraph or adding a new feature to TuGraph, before you submit the code, submit an issue on TuGraph's GitHub, describing the problem you want to fix or the function you want to add. There are several advantages to doing this:
+
+- There will be no duplication of work in conflict with other developers or their plans for the project.
+- TuGraph maintainers will discuss the bugs or new features you mentioned to determine whether the modification is necessary, whether there is room for improvement or a better way.
+- After reaching an agreement, develop and submit the code, reducing the cost of communication between the two parties and reducing the rejection of pull requests.
+
+### 4.2. Pull the branch
+
+All modifications of TuGraph are made on branches. After modification, the pull request is submitted and merged into the Master by the project maintenance personnel after Code Review. Therefore, after the source code steps are described, you need:
+
+1. Download the code to a local directory. In this step, you can choose git or https. In recent years, github has stricter permission requirements. The git approach, for example, requires the more complex ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)). https authentication cannot be performed using the user name and password. git clone https://github.com/ Your account name /tugraph-db
+2. Pull branch ready to modify code:
+   git branch add_xxx_feature
+3. After executing the above command, your code repository switches to the appropriate branch. Run the following command to view your current branch: git branch -a
+4. If you want to switch back to Master, run the git checkout -b master command
+5. If you want to switch back to branching, run the following command: git checkout -b "branchName"
+
+### 4.3. Configuring Github Information
+
+Run git config --list on your machine to view git's global username and mailbox. Check whether the displayed user.name and user.email match your github user name and email address.
+
+If a company has its own gitlab in-house or uses other commercial GitLabs, a mismatch may occur. At this point, you need to set up a separate user name and mailbox for the tugraph-db project. For details about how to set the user name and email address, see github's official documentation.
+
+### 4.4. Change the code and submit it locally
+
+Once you've pulled the branch, you're ready to change the code.
+
+**Code modification Notes**
+
+Code style consistency: TuGraph uses cpplint to keep code in the same format, and IDE can use.clang to configure the style. Be sure to check the code style locally before submitting it, or ACI will report an error.
+
+Add unit test code: New changes should pass through existing unit tests. New unit tests should be provided to prove that there are bugs in the previous code and that the new code has resolved these bugs. You can run all tests with the following command:./unit_test
+It can also be run with the help of an IDE.
+
+**Other precautions**
+
+Please keep the code you are editing in the original style, especially the space feed, etc. For unnecessary comments, delete them directly. Add comments where logic and functionality are not easily understood. Keep documentation up to date. After modifying the code, run the following command to submit all the changes to the local computer:
+git commit -am '(feat) Add the xx function 'git commit -am '(fix) fix xx problem' '
+
+Submit the code to the remote repository
+After the code is committed locally, you can then synchronize the code with the remote repository. Run the following command to submit local changes to github: git push origin "branchname"
+
+If you were forking earlier, the origin here is pushed to your code repository, not TuGraph's.
+
+After the code has been submitted to GitHub, you can send a request to merge your changes into the TuGraph Master. At this point, you need to go to your corresponding repository on GitHub and press the pull request button in the upper right corner. Select the target branch, which is usually the master, and the system will notify the TuGraph staff, who will Review your code, and when it meets the requirements, it will join the main branch and become part of TuGraph.
+
+Please note that the CI will be automatically checked, as well as all Commits signing the cla, with green signs on the commits.
+
+### 4.5. Code Review
+
+After you submit your code, your code will be assigned to a maintainer for Review. Please wait patiently. If no one has responded to your submission after two working days, you can leave a message under PR and @ the corresponding person.
+
+Comments on code Review will be directly noted to the corresponding PR or Issue. If you find the suggestions reasonable, please update them to your code.
+
+### 4.6. Merge code into Master
+
+After the code Review is approved, the TuGraph maintainer will put it into the Master. During this process, the maintainer may specify a new Reviewer and put forward new comments that need to be revised. Normally this step is omitted, and after the code is merged, you will receive an indication that the merge was successful.
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/2.community-roles.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/2.community-roles.md
new file mode 100644
index 0000000000..27cff88ae8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/2.community-roles.md
@@ -0,0 +1,72 @@
+# TuGraph community roles
+
+## 1. Preface
+
+This document describes the roles of membership in the TuGraph community, the requirements and permissions for each role.
+
+## 2. Role summary
+
+This is the division of roles in the TuGraph community, describing the responsibilities of each role, the requirements to become and remain a role, and the permissions of the corresponding role.
+
+Our community is divided into three roles based on the Apache specification:
+
+- Contributor
+- Maintainer
+- PMC
+
+The requirements, responsibilities, and authorities for each role are described below.
+
+## 3. Contributor
+
+### 3.1. requirements
+
+Successfully submit a PR and merge in any of TuGraph's official projects.
+
+### 3.2. responsibility
+
+- Actively respond to issues or PR assigned to you
+- Help reply the issue/pr together and assign the issue to the person in charge of the corresponding module
+
+### 3.3. permissions
+
+- Join the TuGraph GitHub organization and become a member of the TuGraph open source community.
+
+## 4 Maintainer
+
+### 4.1. requirements
+
+The new Committer is recommended by the existing PMC and approved by 2/3 of the votes. The Commiter meets at least one of the following conditions:
+
+- Been a community member for more than three months
+- More than 10 PR for PMC approve
+- Complete major functions
+- Fixed serious bugs
+- Follow project development and participate in community discussion
+
+### 4.2. responsibility
+
+- Community counseling support
+- Actively respond to issues or PR assigned to you
+- The right to vote on major community decisions
+- Review community PR
+
+### 4.4. permissions
+
+- Pull Request review permission
+
+## 5. PMC
+
+### 5.1. requirements
+
+- Not open at the moment, if you have a strong desire please contact PMC
+
+### 5.2. responsibility
+
+- Actively participate in community discussions and give guidance to major community decisions
+- Responsible for ensuring that the community activities of open source projects are running smoothly
+
+### 5.3. permissions
+
+- Pull Request review permission
+- Pull Request approve permission
+- Community role member management
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/3.individual-cla.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/3.individual-cla.md
new file mode 100644
index 0000000000..18295236c1
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/3.individual-cla.md
@@ -0,0 +1,71 @@
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+# 个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..cc47087c32
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/4.corporate-cla.md
@@ -0,0 +1,82 @@
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+# 公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/5.roadmap.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/5.roadmap.md
new file mode 100644
index 0000000000..379ecef880
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/5.roadmap.md
@@ -0,0 +1,68 @@
+# TuGraph Roadmap
+
+## 1. Introduction
+
+This document outlines the future development plans for TuGraph, including features currently under development, those not in the development pipeline, and completed functionalities not included in the open-source version.
+
+TuGraph aims to be an open-source, high-performance graph database. It adopts a centralized storage approach for graph data and, in the short term, does not consider data sharding. Instead, it employs a master-slave replication mode to address high-concurrency read scenarios, while utilizing cloud-based storage solutions to address storage capacity challenges.
+
+## 2. Completed Functionalities
+
+TuGraph was open-sourced on September 1, 2022, and has received regular bug fixes and enhancements based on community feedback.
+
+| Version | Functionality | Date |
+| --- | --- | --- |
+| 3.3.0 | Initial open-source release | 2022.9.1 |
+| 3.3.1 | Refactored graph analysis engine with multi-mode support | 2022.10.14 |
+| 3.3.2 | Added OGM support and improved unit test coverage | 2022.11.21 |
+| 3.3.3 | Iterative improvements to link authentication mechanism and addition of English documentation | 2022.12.23 |
+| 3.3.4 | Cloud deployment support and streamlined LDBC SNB Audit process | 2023.1.28 |
+| 3.4.0 | Added support for OLAP Python API and upgraded offline data import | 2023.3.11 |
+| 3.5.0 | Introduced POG (Procedures On Graph query language), frontend upgrades | 2023.6.5 |
+| 3.5.1 | Added learning engine, Procedure Rust API, and storage-property separation | 2023.7.14 |
+
+In addition, TuGraph has established a comprehensive quality system, including automated unit testing, integration testing, and performance testing.
+
+
+
+## 3. Roadmap of 2023 S2
+
+The planned high availability feature was delayed in the first half of the year, while the graph learning capability was iterated earlier than scheduled. The second half of the year will focus on completing the high availability feature and being the first to support a pre-print version of ISO GQL.
+
+| Version | Functionality | Planned Date |
+| 3.6.0 | High availability support | 2023.8 |
+| 4.0.0 | ISO GQL language support  | 2023.10 |
+
+## 4. Functional Updates in 2023
+
+In addition to the aforementioned core functionalities, the following components are planned for development in 2023.
+
+|Version|	Functionality|	Planned Date|
+| --- | --- | --- |
+|3.5.x	|Optimization of the logging system|2023.7|
+|3.5.x	|Cold backup support|	2023.9|
+|3.5.x	|Support for edge upsert import|	2023.9|
+|x.x.x	|Trigger support exploration|	2023.12|
+|x.x.x	|Exploring new storage engines|	TBD|
+|x.x.x	|Rapid schema addition and deletion|	TBD|
+|x.x.x	|TuGraph Browser version iteration|	TBD|
+|x.x.x	|Iteration of stored procedure Python API|	TBD|
+
+## 5. Community Collaboration Features
+
+Currently, the development team's resources are limited, and we cannot implement all the desired features for TuGraph. However, during the feature planning process, we have identified a range of ideas worth exploring. The team has conducted some initial exploration, and we welcome community collaboration in developing the following features:
+
+|Version	|Functionality	|Planned Date|
+| --- | --- | --- |
+|x.x.x	|Documentation improvements	|TBD|
+|x.x.x	|Enrichment of APOC tools	|TBD|
+|x.x.x	|Support for default property values	|TBD|
+|x.x.x	|Composite index for multiple properties	|TBD|
+|x.x.x	|Online full import support	|TBD|
+|x.x.x	|Enhanced graph permissions	|TBD|
+|x.x.x	|NLP (Natural Language Processing) support	|TBD|
+|x.x.x	|Java Procedure API	|TBD|
+|x.x.x	|Rapid database migration	|TBD|
+|x.x.x	|Spatiotemporal data support	|TBD|
+
+For simpler features, we will label them as "good first issue" on GitHub issues, and we welcome discussions from technology enthusiasts interested in graph databases.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/index.rst
new file mode 100644
index 0000000000..cb2cde62f4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/6.community-manual/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Community Manual
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/7.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/7.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..f7b3d46bc8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/7.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# Importing Data from Relational Databases to TuGraph
+
+> Content to be added
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/7.best-practices/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/7.best-practices/index.rst
new file mode 100644
index 0000000000..a18b7de056
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/7.best-practices/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Best Practices
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.rdbms-to-tugraph.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/8.faq.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/8.faq.md
new file mode 100644
index 0000000000..0ff9399d75
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/8.faq.md
@@ -0,0 +1,33 @@
+# FAQ
+
+During the use of TuGraph, if you encounter problems, you can first check [User Documentation](https://github.com/TuGraph-db/tugraph-db/tree/master/doc/zh-CN). Second, check to see if the FAQ list below matches your question.
+
+1. **[Kernel Engine QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussion-4575385)**
+   1.1 [Does the edge of TuGraph support index? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165379)
+   1.2 [What is the QPS of a single TuGraph machine? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussion-4575381)**
+   2.1 [How to update the tugraph service after the visualization file is built? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165364)
+   2.2 [How to connect the existing tugraph service through npm run dev? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165366)
+   2.3 [TuGraph Browser version 3.3.0 failed to delete node label? ](https://github.com/TuGraph-db/tugraph-db/discussions/82#discussion-4465791)
+3. **[Client QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussion-4575378)**
+   3.1 [What programming languages ​​does the client currently have, and does it support node js? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165351)
+   3.2 [Does the python client support pip install? Where is the client referenced? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165353)
+4. **[Data Import QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussion-4575373)**
+   4.1 [Which common databases can TuGraph connect to? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165335)
+   4.2 [How to import data? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[Stored Procedure QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussion-4575369)**
+   5.1 [How to load stored procedure or algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165313)
+   5.2 [How to call or execute the stored procedure? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165317)
+   5.3 [Where is the open source built-in algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[Installation and deployment QA summary](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussion-4575364)**
+   6.1 [How to install using docker image? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165287)
+   6.2 [After the rpm package and deb package are installed, start the lgraph_server service. Prompt missing 'liblgraph.so' error? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165289)
+   6.3 [How to compile TuGraph on Mac's M1 chip? ](https://github.com/TuGraph-db/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussion-4575018)**
+   7.1 [Does it support conditional query of indefinite length? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165252)
+   7.2 [How to query the shortest path, how to use the shortestPath function? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165256)
+   7.3 [Using and after the query statement Where to splice the query speed is slow, how should the statement be optimized and improved? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165260)
+   7.4 [How to query the edge of any jump? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165262)
+   7.5 [Is there a date() function in Cypher? ](https://github.com/TuGraph-db/tugraph-db/discussions/91#discussion-4482858)
+
+If the problem is still not resolved, we recommend you follow up or create a new thread describing your problem. At the same time, the TuGraph QA summary will be updated regularly based on the posts initiated by everyone in the discussion area.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/9.contacts.md b/docs/docusaurus/versions/version-3.5.1/en-US/source/9.contacts.md
new file mode 100644
index 0000000000..2019a8b998
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/9.contacts.md
@@ -0,0 +1,28 @@
+# Contacts
+
+If you have any feedback or suggestions for the product, You are welcome to join the discussion or make suggestions through the following contact methods.
+
+Official website: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue:
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions:
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack:
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+Dingtalk Group Chat (Discussions):
+
+![alert](../../images/dingtalk.png)
+
+WeChat Group Chat (Discussions):
+
+![alert](../../images/wechat_tech.png)
+
+Official Accounts (Information Release):
+
+![alert](../../images/wechat.png)
+
+Email（Enterprise version consultation）: tugraph@service.alipay.com
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/conf.py b/docs/docusaurus/versions/version-3.5.1/en-US/source/conf.py
new file mode 100644
index 0000000000..b8e3705b60
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/conf.py
@@ -0,0 +1,46 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('5.developer-manual/6.interface/3.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="5.developer-manual/6.interface/3.procedure/")
+    breathe_projects = {"cpp_procedure": "5.developer-manual/6.interface/3.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    subprocess.run(shlex.split("rm -rf 3.C++-procedure 4.Python-procedure.rst index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
+    subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
diff --git a/docs/docusaurus/versions/version-3.5.1/en-US/source/index.rst b/docs/docusaurus/versions/version-3.5.1/en-US/source/index.rst
new file mode 100644
index 0000000000..6a546ea885
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/en-US/source/index.rst
@@ -0,0 +1,17 @@
+TuGraph DB
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.developer-manual/index.rst
+   6.community-manual/index.rst
+   7.best-practices/index.rst
+   8.faq.md
+   9.contacts.md
diff --git a/docs/docusaurus/versions/version-3.5.1/images/architecture-en.png b/docs/docusaurus/versions/version-3.5.1/images/architecture-en.png
new file mode 100644
index 0000000000..edf2bc873a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/architecture-en.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/architecture.png b/docs/docusaurus/versions/version-3.5.1/images/architecture.png
new file mode 100644
index 0000000000..e8eeea87e0
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/architecture.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/account-add-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/account-add-button.png
new file mode 100644
index 0000000000..5b9c7e9378
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/account-add-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/account-add.png b/docs/docusaurus/versions/version-3.5.1/images/browser/account-add.png
new file mode 100644
index 0000000000..b0b5068027
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/account-add.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/account-delete.png b/docs/docusaurus/versions/version-3.5.1/images/browser/account-delete.png
new file mode 100644
index 0000000000..bfe49fb093
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/account-delete.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/account-disable.png b/docs/docusaurus/versions/version-3.5.1/images/browser/account-disable.png
new file mode 100644
index 0000000000..f8ff994f21
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/account-disable.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/account-edit.png b/docs/docusaurus/versions/version-3.5.1/images/browser/account-edit.png
new file mode 100644
index 0000000000..939c374f25
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/account-edit.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/account-enable.png b/docs/docusaurus/versions/version-3.5.1/images/browser/account-enable.png
new file mode 100644
index 0000000000..ddc8cef578
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/account-enable.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/account.png b/docs/docusaurus/versions/version-3.5.1/images/browser/account.png
new file mode 100644
index 0000000000..0aa0cd195c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/account.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/db_basic.png b/docs/docusaurus/versions/version-3.5.1/images/browser/db_basic.png
new file mode 100644
index 0000000000..b78298825b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/db_basic.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/db_configuration.png b/docs/docusaurus/versions/version-3.5.1/images/browser/db_configuration.png
new file mode 100644
index 0000000000..2de3da502c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/db_configuration.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addedge-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addedge-button.png
new file mode 100644
index 0000000000..b38900728e
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addedge-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addedge.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addedge.png
new file mode 100644
index 0000000000..39eca4a772
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addedge.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addvertex-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addvertex-button.png
new file mode 100644
index 0000000000..e616ce0f89
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addvertex-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addvertex.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addvertex.png
new file mode 100644
index 0000000000..df56d537bb
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-addvertex.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-button.png
new file mode 100644
index 0000000000..abf1fab48f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-editedge.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-editedge.png
new file mode 100644
index 0000000000..eb7206b771
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-editedge.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-editvertex.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-editvertex.png
new file mode 100644
index 0000000000..eb252761bf
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-editvertex.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-exportmodel-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-exportmodel-button.png
new file mode 100644
index 0000000000..acbaa80189
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-exportmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-exportmodel.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-exportmodel.png
new file mode 100644
index 0000000000..4991dc7378
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-exportmodel.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import-csv.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import-csv.png
new file mode 100644
index 0000000000..2301c01cfc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import-csv.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import-datamapping.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import-datamapping.png
new file mode 100644
index 0000000000..5d55861a95
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import-datamapping.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import-success.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import-success.png
new file mode 100644
index 0000000000..20a48beb0f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import-success.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import.png
new file mode 100644
index 0000000000..0154bac688
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-import.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-importmodel-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-importmodel-button.png
new file mode 100644
index 0000000000..bb7822aaef
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-importmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-importmodel.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-importmodel.png
new file mode 100644
index 0000000000..252b082100
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-importmodel.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-list-copy.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-list-copy.png
new file mode 100644
index 0000000000..ea210495fc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-list-copy.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-list-delete.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-list-delete.png
new file mode 100644
index 0000000000..aeba09b532
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-list-delete.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-list-search.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-list-search.png
new file mode 100644
index 0000000000..9313c8eb7e
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-list-search.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-select.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-select.png
new file mode 100644
index 0000000000..18bfb3be74
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild-select.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild.png
new file mode 100644
index 0000000000..cd1f0bda1c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphbuild.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-configure.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-configure.png
new file mode 100644
index 0000000000..91fa18814f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-configure.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-creategraph.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-deletegraph-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-deletegraph-button.png
new file mode 100644
index 0000000000..34a4efd42a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-deletegraph-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-editgraph-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-editgraph-button.png
new file mode 100644
index 0000000000..773798b78b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-editgraph-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-editgraph.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-editgraph.png
new file mode 100644
index 0000000000..f6cc706f41
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-editgraph.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-homepage.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-homepage.png
new file mode 100644
index 0000000000..c3af5618ed
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-homepage.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-selecttemplate.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-selecttemplate.png
new file mode 100644
index 0000000000..8a19d8da39
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-selecttemplate.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-statistics-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-statistics-button.png
new file mode 100644
index 0000000000..cdb25ed397
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-statistics-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-statistics-refresh-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-statistics-refresh-button.png
new file mode 100644
index 0000000000..e2ec35cbe1
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-statistics-refresh-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-statistics.png b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-statistics.png
new file mode 100644
index 0000000000..49db6e652f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/graphmanagement-statistics.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/login.png b/docs/docusaurus/versions/version-3.5.1/images/browser/login.png
new file mode 100644
index 0000000000..3f4109b059
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/login.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/pathquery-configuration.png b/docs/docusaurus/versions/version-3.5.1/images/browser/pathquery-configuration.png
new file mode 100644
index 0000000000..579a7d99ee
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/pathquery-configuration.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/pathquery-result.png b/docs/docusaurus/versions/version-3.5.1/images/browser/pathquery-result.png
new file mode 100644
index 0000000000..0cd90cad46
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/pathquery-result.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/pathquery-select.png b/docs/docusaurus/versions/version-3.5.1/images/browser/pathquery-select.png
new file mode 100644
index 0000000000..3c5d0f7751
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/pathquery-select.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-bookmark-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-bookmark-button.png
new file mode 100644
index 0000000000..9a6f73bf7c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-bookmark-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-bookmark.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-bookmark.png
new file mode 100644
index 0000000000..a93315ab17
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-bookmark.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-button.png
new file mode 100644
index 0000000000..cd00d7f3fe
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-download-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-download-button.png
new file mode 100644
index 0000000000..ec59f7a0ed
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-download-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-execute-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-execute-button.png
new file mode 100644
index 0000000000..6c38e68c62
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-execute-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-gqltips.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-gqltips.png
new file mode 100644
index 0000000000..bdabee92e7
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-gqltips.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-download.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-download.png
new file mode 100644
index 0000000000..48890083fa
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-download.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-downloadtxt.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-downloadtxt.png
new file mode 100644
index 0000000000..3554ef592c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-downloadtxt.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-fullscreen-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-fullscreen-button.png
new file mode 100644
index 0000000000..13925db74f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-fullscreen-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-fullscreen-close.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-fullscreen-close.png
new file mode 100644
index 0000000000..2a63926742
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-fullscreen-close.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-fullscreen.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-fullscreen.png
new file mode 100644
index 0000000000..2dcf0ca0b4
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-fullscreen.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-graph.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-graph.png
new file mode 100644
index 0000000000..9b3edecb5f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-graph.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-insert-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-insert-button.png
new file mode 100644
index 0000000000..8879b2c4bb
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-insert-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-insert.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-insert.png
new file mode 100644
index 0000000000..2cd23b6e84
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-insert.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-jsontxt.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-jsontxt.png
new file mode 100644
index 0000000000..5f265cfff1
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-jsontxt.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-jsonview.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-jsonview.png
new file mode 100644
index 0000000000..8a774f91c9
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-jsonview.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-list.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-list.png
new file mode 100644
index 0000000000..4692c49eca
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-result-list.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-schema-graph.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-schema-graph.png
new file mode 100644
index 0000000000..ccc9e3126b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-schema-graph.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-schema-list.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-schema-list.png
new file mode 100644
index 0000000000..3649b41272
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-schema-list.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-selectgql.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-selectgql.png
new file mode 100644
index 0000000000..1ea624b81f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-selectgql.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-selectgraph.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-selectgraph.png
new file mode 100644
index 0000000000..6dc14e486d
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-selectgraph.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/query-view.png b/docs/docusaurus/versions/version-3.5.1/images/browser/query-view.png
new file mode 100644
index 0000000000..8d1884ad82
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/query-view.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-configure.png b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-configure.png
new file mode 100644
index 0000000000..166e54cb75
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-configure.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-creategraph.png b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-graphtab.png b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-graphtab.png
new file mode 100644
index 0000000000..0f7980bc46
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-graphtab.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-result.png b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-result.png
new file mode 100644
index 0000000000..2a2a59ce02
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-result.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-selectdemo.png b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-selectdemo.png
new file mode 100644
index 0000000000..7dda3f06b0
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/quickstart-selectdemo.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/role-add-button.png b/docs/docusaurus/versions/version-3.5.1/images/browser/role-add-button.png
new file mode 100644
index 0000000000..a4590ac431
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/role-add-button.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/role-add.png b/docs/docusaurus/versions/version-3.5.1/images/browser/role-add.png
new file mode 100644
index 0000000000..8f56b24bd7
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/role-add.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/role-delete.png b/docs/docusaurus/versions/version-3.5.1/images/browser/role-delete.png
new file mode 100644
index 0000000000..3c09e7caa8
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/role-delete.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/role-disable.png b/docs/docusaurus/versions/version-3.5.1/images/browser/role-disable.png
new file mode 100644
index 0000000000..eb2e355d58
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/role-disable.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/role-edit.png b/docs/docusaurus/versions/version-3.5.1/images/browser/role-edit.png
new file mode 100644
index 0000000000..7b5db6e48c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/role-edit.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/role-enable.png b/docs/docusaurus/versions/version-3.5.1/images/browser/role-enable.png
new file mode 100644
index 0000000000..40b7909289
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/role-enable.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/vertexquery-criteria.png b/docs/docusaurus/versions/version-3.5.1/images/browser/vertexquery-criteria.png
new file mode 100644
index 0000000000..b5f95c3d83
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/vertexquery-criteria.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/browser/vertexquery.png b/docs/docusaurus/versions/version-3.5.1/images/browser/vertexquery.png
new file mode 100644
index 0000000000..97aa28122b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/browser/vertexquery.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-1.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-1.png
new file mode 100644
index 0000000000..c7202ff3de
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-1.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-10.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-10.png
new file mode 100644
index 0000000000..d6ed55c8bc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-10.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-2.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-2.png
new file mode 100644
index 0000000000..6fc79fde54
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-2.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-3.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-3.png
new file mode 100644
index 0000000000..0e59f028c7
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-3.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-4.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-4.png
new file mode 100644
index 0000000000..b606ec8bb8
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-4.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-5.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-5.png
new file mode 100644
index 0000000000..18d5845ec1
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-5.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-6.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-6.png
new file mode 100644
index 0000000000..d939108e3b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-6.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-7.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-7.png
new file mode 100644
index 0000000000..5c5d1800af
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-7.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-8.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-8.png
new file mode 100644
index 0000000000..5beb0628b3
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-8.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-9.png b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-9.png
new file mode 100644
index 0000000000..d04282d95a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/cloud-deployment-9.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/dingtalk.png b/docs/docusaurus/versions/version-3.5.1/images/dingtalk.png
new file mode 100644
index 0000000000..2a6576a0cd
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/dingtalk.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/htap-en.png b/docs/docusaurus/versions/version-3.5.1/images/htap-en.png
new file mode 100644
index 0000000000..85479ac1e1
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/htap-en.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/htap.png b/docs/docusaurus/versions/version-3.5.1/images/htap.png
new file mode 100644
index 0000000000..c7764a3fa7
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/htap.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/learn_flow_chart_en.png b/docs/docusaurus/versions/version-3.5.1/images/learn_flow_chart_en.png
new file mode 100644
index 0000000000..c9e55a52a5
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/learn_flow_chart_en.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/learn_flow_chart_zh.png b/docs/docusaurus/versions/version-3.5.1/images/learn_flow_chart_zh.png
new file mode 100644
index 0000000000..9977dcfb6c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/learn_flow_chart_zh.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/multi-level-Interfaces-en.png b/docs/docusaurus/versions/version-3.5.1/images/multi-level-Interfaces-en.png
new file mode 100644
index 0000000000..b7de07422c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/multi-level-Interfaces-en.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/multi-level-Interfaces.png b/docs/docusaurus/versions/version-3.5.1/images/multi-level-Interfaces.png
new file mode 100644
index 0000000000..2c9694a476
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/multi-level-Interfaces.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-body-cypher1.png b/docs/docusaurus/versions/version-3.5.1/images/three-body-cypher1.png
new file mode 100644
index 0000000000..3f85fd8412
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-body-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-body-cypher2.png b/docs/docusaurus/versions/version-3.5.1/images/three-body-cypher2.png
new file mode 100644
index 0000000000..41f0f914cc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-body-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-body-cypher3.png b/docs/docusaurus/versions/version-3.5.1/images/three-body-cypher3.png
new file mode 100644
index 0000000000..4776f26d77
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-body-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-body-data.png b/docs/docusaurus/versions/version-3.5.1/images/three-body-data.png
new file mode 100644
index 0000000000..1913b39cbc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-body-data.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher1.png b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher1.png
new file mode 100644
index 0000000000..4b5745b96d
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher2.png b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher2.png
new file mode 100644
index 0000000000..fef4592cf3
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher3.png b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher3.png
new file mode 100644
index 0000000000..c0790d5d7e
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher4.png b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher4.png
new file mode 100644
index 0000000000..49a6498d4a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher4.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher5.png b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher5.png
new file mode 100644
index 0000000000..5d3cc55cdf
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-cypher5.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-schema.png b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-schema.png
new file mode 100644
index 0000000000..24aebca93a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/three-kingdoms-schema.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/tugraph-datax.png b/docs/docusaurus/versions/version-3.5.1/images/tugraph-datax.png
new file mode 100644
index 0000000000..c2968c0c38
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/tugraph-datax.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/wandering-earth-1.png b/docs/docusaurus/versions/version-3.5.1/images/wandering-earth-1.png
new file mode 100644
index 0000000000..955c565303
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/wandering-earth-1.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/wandering-earth-2.png b/docs/docusaurus/versions/version-3.5.1/images/wandering-earth-2.png
new file mode 100644
index 0000000000..9cb17764ed
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/wandering-earth-2.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/wandering-earth-3.png b/docs/docusaurus/versions/version-3.5.1/images/wandering-earth-3.png
new file mode 100644
index 0000000000..c6dabbec97
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/wandering-earth-3.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/wechat.png b/docs/docusaurus/versions/version-3.5.1/images/wechat.png
new file mode 100644
index 0000000000..b490b48afd
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/wechat.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/wechat_tech.png b/docs/docusaurus/versions/version-3.5.1/images/wechat_tech.png
new file mode 100644
index 0000000000..7307a12e38
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/wechat_tech.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/what-is-graph-en.png b/docs/docusaurus/versions/version-3.5.1/images/what-is-graph-en.png
new file mode 100644
index 0000000000..53d5ba05ca
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/what-is-graph-en.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/images/what-is-graph.png b/docs/docusaurus/versions/version-3.5.1/images/what-is-graph.png
new file mode 100644
index 0000000000..6f3aa196fa
Binary files /dev/null and b/docs/docusaurus/versions/version-3.5.1/images/what-is-graph.png differ
diff --git a/docs/docusaurus/versions/version-3.5.1/requirements.txt b/docs/docusaurus/versions/version-3.5.1/requirements.txt
new file mode 100644
index 0000000000..0201af0943
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/requirements.txt
@@ -0,0 +1,5 @@
+sphinx
+myst-parser
+sphinx-panels
+sphinx-rtd-theme
+breathe
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/.readthedocs.yaml b/docs/docusaurus/versions/version-3.5.1/zh-CN/.readthedocs.yaml
new file mode 100644
index 0000000000..5b91d3cd6c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/zh-CN/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/Makefile b/docs/docusaurus/versions/version-3.5.1/zh-CN/Makefile
new file mode 100644
index 0000000000..d0c3cbf102
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?=
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/make.bat b/docs/docusaurus/versions/version-3.5.1/zh-CN/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/1.guide.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/1.guide.md
new file mode 100644
index 0000000000..6be7576bc8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/1.guide.md
@@ -0,0 +1,35 @@
+# 文档地图
+
+> 这里是文档地图，帮助用户快速学习和使用TuGraph社区版。
+
+## 快速上手
+
+> 了解图技术和TuGraph：[什么是图](./2.introduction/1.what-is-graph.md)、[什么是图数据库](./2.introduction/2.what-is-gdbms.md)、[什么是TuGraph](./2.introduction/3.what-is-tugraph.md)、[TuGraph产品架构](./2.introduction/5.architecture.md)。
+
+> 快速开始体验TuGraph：[快速上手](./3.quick-start/1.preparation.md)、[影视场景Demo](./3.quick-start/2.demo/1.movie.md)、[可视化操作手册](./4.user-guide/1.tugraph-browser.md)。
+
+> 安装部署TuGraph：[云部署](./5.developer-manual/1.installation/5.cloud-deployment.md)、[Docker部署](./5.developer-manual/1.installation/3.docker-deployment.md)、[本地包部署](./5.developer-manual/1.installation/4.local-package-deployment.md)。
+
+> 启动及运行TuGraph：[数据库运行](./5.developer-manual/2.running/2.tugraph-running.md)、[从源码编译](./5.developer-manual/2.running/1.compile.md)、[数据预热](./5.developer-manual/3.server-tools/4.data-warmup.md)、[备份恢复](./5.developer-manual/3.server-tools/3.backup-and-restore.md)、[日志信息](./5.developer-manual/5.ecosystem-tools/4.log.md)。
+
+## 开发指南
+
+> 客户端：[C++](./5.developer-manual/4.client-tools/2.cpp-client.md)、[Java](./5.developer-manual/4.client-tools/3.java-client.md)、[Python](./5.developer-manual/4.client-tools/1.python-client.md)、[命令行](./5.developer-manual/4.client-tools/5.tugraph-cli.md)、[OGM](./5.developer-manual/4.client-tools/4.tugraph-ogm.md)。
+
+> 生态工具：[运维监控](./5.developer-manual/5.ecosystem-tools/1.monitoring.md)、[TuGraph-DataX](./5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md)、[TuGraph-Explorer](./5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md)。
+
+> 接口文档：[Cypher API](./5.developer-manual/6.interface/1.cypher.md)、[OLAP API](./5.developer-manual/6.interface/2.olap/1.tutorial.md)、[Procedure API (POG API)](./5.developer-manual/6.interface/3.procedure/1.procedure.md)、[RESTful API](./5.developer-manual/6.interface/4.protocol/1.restful-api.md)、[RPC API](./5.developer-manual/6.interface/4.protocol/2.rpc-api.md)。
+
+## 社区贡献
+
+> 在开始贡献前，可以先了解[如何贡献](./6.community-manual/1.contributing.md)
+
+> 如果想了解社区角色的划分，请访问[社区角色](./6.community-manual/2.community-roles.md)
+
+## 视频中心
+
+> [TuGraph快速上手](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph技术分享集合](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [3分钟读懂图计算](https://www.bilibili.com/video/BV15U4y1r7AW/)
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..4cbe4ce767
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,13 @@
+# 什么是图
+
+> 本文面向初学者，介绍图（Graph）的基本概念。
+
+我们今天介绍的图，是图论中使用点和边表示的图（Graph），而非图像的图（Image）。
+
+![alt what is graph](../../../images/what-is-graph.png)
+
+图的基本元素是点和边，其中点表示事物或实体，边表示点之间的关联关系。
+
+如上图左侧所示，点表示的有公司、员工、项目。边表示的是他们之间的关系，包括：公司和员工之间的雇佣关系，员工和员工之间的好友关系，项目和员工之间的参与关系。除此之外，点和边上可以附加属性，比如员工的工号，雇佣的时间，这样的图是属性图。也就是说，我们可以用图的方式来抽象地表示实体及其关联关系，图有非常丰富的表达能力。
+
+除了上述的员工图谱，图还可以用于金融、工业、医疗等各个领域。在实际应用中，图的规模越来越大，比如金融交易图，点边规模可能到达百亿，与其同时，基于图的查询通常会复杂，最典型的是K跳查询，每增加一跳访问的数据都呈指数增长。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..eeb4dfd11f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# 什么是图数据库
+
+> 本文主要介绍什么是图数据库，图数据库相比于关系型数据库的优势，以及两者特点的对比。
+
+## 1. 图数据库介绍
+
+图数据库是基于图模型的数据库。与关系型数据库相比，图数据库真正注重“关系”。图数据库的主要功能是管理图数据，因此需要支持高效的点、边查询和更新；为方便用户使用，通常还需要增加对事务（transaction）的支持，以确保并发操作下的正常运行。
+
+## 2. 图数据库相比较于关系型数据库的优势
+
+图数据库的功能是传统关系型数据库的扩展。与关系型数据库仅支持的“表结构”相比，图数据库所支持的“图结构”更为灵活。图数据库在基于图的增加、删除、查询和修改方面采用不同于其他数据库的设计。在图数据操作抽象上，采用基于点的视角，例如点通过其所有“出边”（从一个点出发，连接到其他点的边）访问其邻接点。这是图数据库系统设计的核心。
+
+图数据库的独特性体现在以下三个方面:
+
+### 2.1. 性能
+
+在关联关系处理上，使用关系型数据库不可避免地要使用表的JOIN操作，这会对性能产生较大影响；而图数据库则直接跳转访问类指针，操作关联数据的效率更高，比关系型数据库提高2到4个数量级的性能。
+
+### 2.2. 兼容性
+
+现实中，项目进程通常不断演变，数据的内容甚至数据格式也在不断变化。在关系型数据库中，这意味着表结构的变化或建立多个新表，对源数据的修改非常大。而在图数据库中，仅需添加新的点、边和属性，并将其设置为对应的类型即可。从本质上说，一个表代表一种类型的数据，一个点代表一个特定的数据。这意味着关系型数据库更关注数据类型，而图数据库更关注数据个体及其关联关系。
+
+### 2.3. 直观性
+
+使用图的方式表达现实世界的关系更直接和自然，在万物互联的时代尤为突出。如果使用关系型数据，先建立实体表，再建立关系表，最后映射数据，需要高度的抽象思维。在图数据上进行分析查询时，可以直观地通过点边连接的拓扑结构找到所需数据，无需任何专业知识。
+
+## 3. 图数据库与关系型数据库对比
+
+| 分类         | 模型   | 优势                                   | 劣势                                     | 举例           |
+| ------------ | ------ | -------------------------------------- | ---------------------------------------- | -------------- |
+| 关系型数据库 | 表结构 | 数据高度结构化，一致性强，软件成熟度高 | 面向多跳的关联关系查询低效或不支持       | MySQL、Oracle  |
+| 图数据库     | 图结构 | 针对关联关系的建模建模和操作效率非常高 | 高度结构化的数据处理能力不及关系型数据库 | Neo4j、TuGraph |
+
+总之，面对海量数据的存储和处理问题，传统的关系数据库已经无法满足大部分的日常数据存储需求。图数据库技术可以将关系信息存储为实体，灵活拓展数据模型。由于提供了对关联数据最直接的表达方式和图模型对异构数据的天然包容性，图数据库技术必将成为未来最热点的技术之一，为企业提供存储和分析大规模图数据的有力支持。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..4c2c6e1a44
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,95 @@
+# 什么是TuGraph
+
+> 本文主要介绍TuGraph社区版的主要功能和特性，以及TuGraph企业版和社区版的差异。
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群，解决了图数据分析面临的大数据量、高吞吐率和低延迟等重大挑战，是蚂蚁集团金融风控能力的重要基础设施，显著提升了欺诈洗钱等金融风险的实时识别能力和审理分析效率，并面向金融、工业、政务服务等行业客户。
+
+## 2. TuGraph社区版
+
+2022年9月，TuGraph单机版开源，提供了完备的图数据库基础功能和成熟的产品设计，支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台。
+
+TuGraph社区版于2022年9月开源，提供了完整的图数据库基础功能和成熟的产品设计（如ACID兼容的事务、编程API和配套工具等），适用于单实例部署。社区版支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台，是学习TuGraph和实现小型项目的理想选择。
+
+## 3. TuGraph特性
+
+TuGraph是支持大数据量、低延迟查找和快速图分析功能的高效图数据库。TuGraph也是基于磁盘的数据库，支持存储多达数十TB的数据。TuGraph提供多种API，使用户能够轻松构建应用程序，并使其易于扩展和优化。
+
+它具有如下功能特征：
+
+- 属性图模型
+- 实时增删查改
+- 多重图（点间允许多重边）
+- 多图（大图与多个子图）
+- 完善的ACID事务处理，隔离级别为可串行化（serializable）
+- 点边索引、全文索引
+- 混合事务和分析处理（HTAP），支持图查询、图分析、图学习
+- 主流图查询语言（OpenCypher、ISO GQL等）
+- 支持OLAP API，内置30多种图分析算法
+- 基于C++/Python的存储过程，含事务内并行Traversal API
+- 提供图可视化工具
+
+在性能和可扩展性方面的支持：
+
+- 千万点/秒的高吞吐率
+- TB级大容量
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线的备份恢复
+
+## 4. 数据模型
+
+### 4.1. 图模型
+
+TuGraph是一个具备多图能力的强类型、有向属性图数据库。
+
+- 图项目：每个数据库服务可以承载多个图项目（多图），每个图项目可以有自己的访问控制配置，数据库管理员可以创建或删除指定图项目。
+- 点：指实体，一般用于表达现实中的实体对象，如一部电影、一个演员。
+    - 主键：用户自定义的点数据主键，默认唯一索引，在对应的点类型中唯一。
+    - VID：点在存储层自动分配图项目中的唯一ID，用户不可修改。
+    - 上限：每个图项目存储最多2^(40)个点数据。
+- 边：用于表达点与点之间的关系，如演员出演电影。
+    - 有向边：边为有向边。若要模拟无向边，用户可以创建两个方向相反的边。
+    - 多条边：两个点数据之间可以有多条边数据。当前TuGraph支持重复边，如要确保边边唯一，需要通过业务策略实现。
+    - 上限：两个点数据之间存储最多2^(32)条边数据。
+- 属性图：点和边可以具有与其关联的属性，每个属性可以有不同的类型。
+- 强类型：每个点和边有且仅有一个标签，创建标签后，修改属性数量及类型有代价。
+    - 指定边的起/终点类型：可限制边的起点和终点点类型，支持同类型边的起点和终点的点类型不同，如个人转账给公司、公司转账给公司；当指定边的起/终点类型后，可增加多组起/终点类型，不可删除已限制的起/终点类型。
+    - 无限制模式：支持不指定边的起点和终点的点类型，任意两个点类型间均可创建该类型的边数据。注：当指定边的起/终点类型后无法再采用无限制模式。
+
+### 4.2. 数据类型
+
+TuGraph支持多种可用于属性的数据类型。具体支持的数据类型如下：
+
+| **数据类型** | **最小值**          | **最大值**          | **描述**                            |
+| ------------ | ------------------- | ------------------- | ----------------------------------- |
+| BOOL         | false               | true                | 布尔值                              |
+| INT8         | -128                | 127                 | 8位整型                          |
+| INT16        | -32768              | 32767               | 16位整型                         |
+| INT32        | - 2^31              | 2^31 - 1            | 32位整型                         |
+| INT64        | - 2^63              | 2^63 - 1            | 64位整型                         |
+| DATE         | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" 格式的日期             |
+| DATETIME     | 0000-00-00 00:00:00 | 9999-12-31 23:59:59 | "YYYY-MM-DD HH:mm:ss" 格式的日期时间 |
+| FLOAT        |                     |                     | 32位浮点数                       |
+| DOUBLE       |                     |                     | 64位浮点数                       |
+| STRING       |                     |                     | 不定长度的字符串                    |
+| BLOB         |                     |                     | 二进制数据（在输入输出时使用Base64编码） |
+
+### 4.3. 索引
+
+TuGraph支持对点或边的属性创建索引，以提升查询效率。
+- 索引可以是唯一或非唯一索引。
+- 如果为点标签创建了唯一索引，在修改该标签的点时，会先执行数据完整性检查，以确保该索引的唯一性。
+- 每个索引都基于一个点或边的一个属性创建，可以对同一点或边的多个属性创建索引。
+- BLOB类型的属性不能建立索引。
+
+## 5. TuGraph企业版
+
+企业版对商业化功能支持更加完善，包括分布式集群架构，覆盖探索、研发、服务、运维管理全生命周期的一站式图平台，在线、近线、离线的图计算引擎，支持流式、大数据类数据源，多地多中心的部署形态，以及专家支持服务等。企业版是商业化解决方案的理想选择。
+
+如需商业支持，请联系我们：
+
+- 电话：400-903-0809
+- 邮件：tugraph@service.alipay.com
+- 官网：https://tugraph.antgroup.com
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..612c0430ad
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# 性能优先
+
+> 此文档主要介绍 TuGraph 性能优先的设计理念。
+
+## 1.简介
+
+TuGraph目前是世界上最快的图数据库，在图数据库标准评测LDBC SNB Interactive位居榜首（2023.3）。TuGraph的设计基于性能优先，致力于打造高性能的单机图数据库。该文档是TuGraph基于性能优先在存储层的核心设计。
+
+## 2.图操作的特性
+
+在属性图上的操作涉及读、写及其属性，对一些特殊的属性比如时间戳也访问模式也会影响到整体性能。这里通过对一些图操作特性的规律总结，来指导最终的性能。
+
+我们观察到很多图应用有类似的数据访问模式。例如，在信贷风险控制中，我们使用递归路径过滤搜索多对一模式，以找到可疑的信用欺诈用户和行为。针对网络赌博，可以通过识别短时间内的多笔资金转移，来发现涉赌的资金账号。股权穿透场景对实体间的股权关系进行递归计算。这些场景具有多跳实体和关系访问、时间窗口约束和读写事务等常见模式。
+更进一步，从介绍中的讨论和图负载的分析中，归纳出以下特征:
+
+**规律一** KHop是图中最典型的操作，它基于点和边的图拓扑的数据访问模式，和关系型数据库有着本质的区别。KHop 的典型性除了表现在数据访问模式不同，它同时也是图数据库最需要关注的性能点。
+
+**规律二** 图负载的数据访问在拓扑上有一定的局部性，同一个点的边通常会被同时访问。当这些边的标签相同时，有更大的概率会被同时访问。
+
+**规律三** 图负载在访问点边时，通常会访问其对应的属性，来作为遍历过滤的条件。
+
+**规律四** 在基于时序的图负载，对点边的过滤通常是在某个时间范围，比如最近的一周。
+
+**规律五** 写操作可能伴随着大量的读操作，需要在单个事务周期里处理。
+
+通过对实际线上图应用的分析，图负载的读写比率大约为 20:1，虽然场景局限在金融场景，集群数也有限，但涉及的数据规模和用户量非常庞大，具有一定代表性。20:1 的图负载读写比率，说明读工作负载对整体性能的影响更大， 而写工作负载的性能也不能忽视。
+
+## 3.存储数据结构
+
+TuGraph底层采用B+树来支持实时的增删查改事务。
+
+在排序树的数据结构中，B+树和LSM树为主要代表。B+树在树节点中使用拆分和合并式来更新排序数据，而 LSM 树在日志中追加更新，以进行延迟数据合并。B+ 早期用在文件系统的实现中，通过将数据保存 在自适应长度的叶子节点中，解决硬盘顺序操作和随机操作性能存在数据量级差别的问题，有较均衡的读写性能。LSM 树的主要优势使用 WAL(Write Ahead Log) 进行更新，将更新操作变成顺序操作，在键值较小时性能优势尤为突出。WAL 意味着将数据的更新合并推迟，批量更新能提升综合效率，也使得系统的调度变得复杂。如果更新合并完成前，恰好对其中的数据继续读取，LSM 树就需要读取几个层级局部合并的日志，会导致读取放大和空间放大，从而影响读效率。
+
+总结来说，B+ 树有较好的顺序读写性能，而 LSM 树在数据随机写方面占优。此外 LSM 树采用后台合并的方式，使得性能的波动难以预期，性能波动和上层存储和计算的关联性较弱，增加了整体设计的成本。综上考虑，TuGraph 选用 B+ 树作为读性能优先的实现。
+
+## 4.数据编码
+
+对于属性图模型而言，除了图拓扑编码外，属性数据也会很大程度影响功能和性能，我们先讨论属性数据如何与拓扑数据共存的编码格式。从目前的调研来看，属性编码有两种方式，我们称之为基于指针索引将属性数据单独存储的离散编码，和将属性数据和拓扑数据打包在一起的紧凑编码。离散编码根据程度的不同，可以每个属性都单独存储，或者每条边的属性打包后各自存储，下面的讨论对两种情况都适用。
+
+点查询。属性编码主要针对边，不涉及点查询。
+
+单边查询。离散编码通过指针定位边，紧凑编码则需要二分查找定位边的位置，离散编码有略微的优势。
+
+边遍历。离散编码在边遍历过程需要不断地进行指针跳转进行随机数据访问，而紧凑编码提前把数据排列在一起，顺序访问的特性使得效率大大提升。 由规律三知对边的遍历操作很普遍，紧凑编码在边遍历的优势明显。
+
+单边更新。离散编码对边的更新仅需找到对应的指针位置，插入数据后修改前后指针指向。紧凑编码则需要对紧凑排列的数据进行重编码，对整个边值进行重新写入，开销显著大于离散编码的情形。
+
+批量边更新。批量更新可以在内存中预先构建点的所有边属性，一次性编码写入，离散编码和紧凑编码相当。但紧凑编码不需要存储指针变量，更少的存储空间效率也会更高。
+
+以上离散编码和紧凑编码在某一类的查询的性能问题，可以通过优化的来缓解。整体上说，由于图负载读写 20:1 的特性，读性能在整体性能中占比更高。以及规律三所揭示的对属性访问的特征，TuGraph 更倾向于采用紧凑编码来保证读性能。其主要弱势为单边更新时重编码的开销，可以用自适应映射的技术来解决，
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..0e4b70768c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,34 @@
+# 多层级接口
+
+
+> 此文档主要介绍 TuGraph 的多层级接口的设计理念。
+
+## 1.简介
+
+多层级接口是 TuGraph 针对多丰富的使用场景，在易用性和高性中作出的平衡。比如描述式图查询语言 Cypher 能够抹去图数据库实现的细节，基于图模型的抽象来进行表达。Cypher 过于高层的表述，无法高效转化成底层的执行，因此提供了 Procedure API 的过程式语言，来发挥图数据库的最佳性能。
+
+接口可以大致分为客户端接口和服务端接口，大部分操作都在服务端完成，客户端只做数据的封装和解析。客户端和服务端通过网络连接，TuGraph 支持更加灵活的短连接 REST 协议，以及更加高效的长链接 RPC 协议，可根据不同的业务场景来选择。
+
+服务端接口均处在计算层，和图数据存储间用一层 Core API 在逻辑上隔开。
+
+![多层级接口架构](../../../../images/multi-level-Interfaces.png)
+
+### 1.1.客户端接口
+
+客户端接口指在客户端执行的接口，通常用于集成到软件应用中。TuGraph 的客户端的接口比较简单，包括登录登出、数据导入导出、存储过程加载调用、Cypher操作等。其中 Cypher 中集成了大部分的功能，包括数据操作、图模型操作、运维管理、账户管理等。
+
+由于 Cypher 的参数和返回值都是字符串，JAVA OGM 是对 Cypher 的结构化封装，即查询结果能够被封装为一个有类型的对象，方便使用。
+
+### 1.2.服务端接口
+
+服务端接口包括描述式图查询语言 Cypher、过程式图查询语言 Procedure API、图分析编程框架 OLAP API 和图神经网络编程框架 GNN PI，为图事务引擎、图分析引擎、图神经网络引擎提供服务，下面先展开介绍各个接口的特点。
+
+> __描述式图查询语言__ 是对查询逻辑的抽象描述，而与执行逻辑无关，对图数据库应用者比较友好，类比关系型数据库的 SQL 语言。TuGraph 的 Cypher 语言主要依照 Neo4j 开源的 OpenCypher 查询标准，同时对运维管理等辅助功能进行了扩展，在功能上囊括了 TuGraph 的大部分操作。描述式图查询语言会成为图数据库的主要数据操作方式，但由于描述到执行之间需要生成执行计划（Execution Plan），生成最优执行计划在学术界和工业界均有很长的路要走。
+
+> __过程式图查询语言__ 是为了解决描述式图查询语言与最优性能间的鸿沟。TuGraph的 Procedure API 是在 Core API 上做了一层简单的封装，C++ Procedure API的灵活性和高效性能够充分发挥存储的极致性能，也是 Cypher 优化的上限性能。Python Procedure API 是 C++ Procedure API 上的一层跨语言封装，翻译过程中值的拷贝会带来一定的性能损失，优势则主要是 python 语言本身的易用性。raversal API 是并行执行的 Procedure 接口，描述上更接近于集合的操作，比如扩展点集合所有出度邻居，获得一个新的点集。
+
+> __图分析编程框架__ 属于 ‘图计算系统’ 的范畴，会将图数据从支持增删改查的存储中导出快照，以更紧凑的数据存储格式来支持只读的复杂图分析，这里叫做OLAP API。OLAP API 封装了高并发执行的数据结构，包括 Vector、Bitmap等，以及基于 CSR 格式的图快照数据结构，然后提供一套并发的快速点边操作框架。在图分析任务完成后，数据可以通过接口写回图数据库。
+
+> __图神经网络编程框架__ 主要提供了图神经网络应用编程所需要的接口，能够对接PyTorch 等机器学习框架。TuGraph 的图神经网络编程框架主要集成了 DGL，在 Python 的语言环境中完成从图存储到图神经网络应用的完整流程。
+
+除了 Cypher 是解释执行外，其余服务端接口都是编译执行，即需要将对应代码传到服务端后，进行编译（可能会有时间开销），再在服务端执行。所以通常需要先加载，然后再已加载的应用列表中找到程序，传输入参数后执行
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/3.htap.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/3.htap.md
new file mode 100644
index 0000000000..16eff8e94f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> 此文档主要介绍 TuGraph 的HTAP的设计理念。
+
+## 1.简介
+
+![htap架构](../../../../images/htap.png)
+
+HTAP 的实现在架构上有多种不同的方式：一是用两个不同的副本来分别处理 OLTP 和 OLAP 的任务，核心是数据的一致性同步和额外的资源开销；二是在任何时候都使用同一份数据存储，该实现的数据结构存在内存膨胀，在工业化落地还需要进一步工作。在 TuGraph 的设计中，简单的 OLAP 操作和 OLTP 操作共用一份数据，而复杂的 OLAP 操作则单独导出快照处理。
+
+## 2.设计
+
+在 TuGraph 中，OLTP 为图事务引擎，在图 4.4对应事务操作；OLAP 为图分析引擎，对应简单图分析操作（比如 SPSP）和复杂图分析操作（比如 PageRank），前者可以直接在图存储上执行，而后者需要额外导出快照执行。
+
+- 事务操作，即图事务引擎测的操作，为局部图的增删查改操作，典型的应用为 K 跳访问 K-Hop。
+- 简单分析操作，是图分析引擎中较为简单的部分，通常也是局部的图分析操作，比如两点间最短路算法 SPSP、Jaccard 算法。
+- 复杂分析操作，是图分析引擎中较为复杂的部分，通常涉及全图的多轮数据迭代操作，比如网页排序算法 PageRank、社区发现算法 Louvain。
+
+如图 4.4所示，我们在架构图中增加了外部存储，使得图分析的数据源不局限在图数据库中，可以直接从文本文件读取。
+
+- 图存储，即图数据库中的存储，有精心设计的数据结构，能够完成实时增删查改。
+- 外部存储，可以是 RDBMS 或文本文件，以边表的简单方式存储，仅供一次性批量读取，和批量结果写入。在计算层，和整体架构图中的接口对应。
+- Cypher，描述式图查询语言，可以并发执行。
+- Procedure API，过程式图查询语言，其灵活性能够同时支持事务操作和图分析操作，但效率上不足以完成复杂图分析操作，可以并发执行。
+- OLAP API，针对多轮迭代的复杂图分析。应用需要先将存储中的图数据导出成内存中的一个快照，该快照仅用来快速访问，而不需要考虑 ACID 的写支持，因此可以排布地更加紧凑，CSR 排布的读效率要远高于图存储的数据排布。OLAP API 只能串行执行，每个操作都用满 CPU 资源。
+
+OLAP API 的快照可以从外部存储创建，即将边表数据构成件 CSR 的格式；或者从图存储中创建。需要注意的是，OLAP API 要求点的 ID 是连续的自然数，可能需要额外的 ID 映射，该步骤在创建快照时可以在指定一个属性进行映射，或直接取属性值作为 ID。
+
+与计算接口和存储相对应，有四种运行模式。
+
+- 事务模式，每个操作对应一条 Cypher 语句，默认是一个事务。
+- Plugin 模式，通过插件的方式，在计算逻辑加载到服务端后调用，也叫存储过程。
+- Embed 模式，和 Plugin 模式的使用接口一致，区别是图数据库服务不需要起来，就可以直接用接口调用数据库中的数据，通常用于调试 Procedure API 和OLAP API 的代码，调试信息和操作步骤比 Plugin 模式更加友好。
+- Standalone 模式，最大程度剥离与图数据库的关系，仅想用图分析引擎做数据分析时，该模式会比较直接。Standalone 模式会直接使用外部存储的数据。
+
+图神经网络引擎的使用方式和 ‘复杂图分析操作’ 类似，会同时调用部分 OLAP API 和 GNN API，不在这里展开。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/index.rst
new file mode 100644
index 0000000000..853243ed8c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/4.characteristics/index.rst
@@ -0,0 +1,10 @@
+产品特点
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
+    
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/5.architecture.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/5.architecture.md
new file mode 100644
index 0000000000..cf901d31cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/5.architecture.md
@@ -0,0 +1,15 @@
+# TuGraph产品架构
+
+> 此文档主要介绍 TuGraph 的产品架构。
+
+## 1.简介
+
+![产品架构](../../../images/architecture.png)
+
+上图从功能模块的角度，以 TuGraph 为例，给出了企业级图数据库的整体架构，自下而上包括：
+
+- 软硬件环境。涉及图数据库的开发和使用环境。TuGraph 主要基于底层的 C++语言开发，能够兼容市面上大部分操作系统和 CPU。
+- 存储层，包括 KV 存储层和图存储层。存储层需要支持计算层所需的各个功能。
+- 计算层。计算层应包括图事务引擎、图分析引擎和图神经网络引擎，也包含了服务端提供的多种编程接口，包括描述式查询语言 Cypher，存储过程等。
+- 客户端。客户端 SDK 应支持 Java、Python、C++ 等多种语言，也支持命令行的交互方式。Browser 和 Explorer 通过网页端交互的方式，降低了图数据库的使用门槛。
+- 在生态工具方面，覆盖了企业级图数据库的开发、运维、管理等链路，提升可用性。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/6.functionality.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/6.functionality.md
new file mode 100644
index 0000000000..934032187e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/6.functionality.md
@@ -0,0 +1,112 @@
+# 功能概览
+
+> 此文档主要介绍 TuGraph 的主要功能和特性。
+
+## 1.安装部署
+
+## 1.1.部署方式
+
+TuGraph目前提供云部署、Docker部署以及安装包部署三种部署方式，用户可根据实际情况选择适合的部署方式。
+
+## 1.2.软硬件环境
+
+TuGraph核心是由C++开发，默认使用的编译器为GCC8.4，使用c++14标准。部分功能使用了其他编译器，比如全文索引的实现基于ApacheLucene，采用JNI接口需要Java编译器。此外，存储过程中额外提供了Python Procedure API，该功能需要Python环境。TuGraph不需要特殊的硬件比如GPU，对RDMA、HBM等高延迟低带宽的通用硬件升级可以天然适配。
+
+TuGraph测试过基于X86和ARM的CPU，包括Intel、AMD、Kunpeng、Hygon、飞腾等，也同时在多个操作系统上运行，包括Ubuntu、CentOS、SUSE、银河麒麟、中标麒麟、UOS的主流版本，对操作系统和CPU没有特殊的要求。
+
+软硬件环境也包括依赖库的环境，由于TuGraph的存储层中默认的KV存储是LMDB，需要文件系统能够支持POSIX接口。在不同的环境下编译和参数配置会略有不同，比如在图存储的点边数据打包中，应和操作系统的页表大小匹配，默认为4KB，建议将系统的页表大小也设置为4KB。
+
+## 2.存储层
+
+在图数据模型上，TUGraph支持属性图模型，按照层次可以分为子图、标签（包括点标签和边标签）、属性。从存储层看，TuGraph使用使用直观的多层的树状模型，没有跨子图的标签，也没有跨标签的属性，仅保留图模型的核心逻辑。
+
+在子图的存储上，TuGraph对多图做了数据的物理隔离，每个图对应一个LMDB的实例。多图的元数据描述信息，保存在meta的特殊的公共LMDB实例中。点边标签及其属性的存储，通过将图数据自适应地映射到KV键值对，最大程度发挥读性能。同时在KV层实现了多线程写，解决了LMDB写性能较低的劣势。主键索引和二级索引，对应LMDB中B+的表，支持基于比较的索引值增删查改。
+
+存储层还保留了一些其他非核心功能的数据，包括权限数据、预编译的插件数据、监控数据等。
+
+## 3.计算层
+
+计算层在功能上分成三个部分，包括TP类的图事务引擎，AP类的图分析引擎和图神经网络引擎。
+
+- __图事务引擎__，主要用来处理并发的图操作，包括单点查询、邻居查询、路径遍历。图事务引擎侧重并发操作的ACID事务，确保操作逻辑不会互相干扰，主要性能指标为 QPS，即每秒完成的查询数量。
+
+- __图分析引擎__，操作类型通常为全图迭代。部分简单的分析任务（比如SPSP）可以由图事务引擎完成，复杂的分析任务均由图分析引擎完成，单个任务通常需要数秒至数小时。因此单个图分析任务要并发利用所有的硬件资源，性能指标为任务完成的总时长。
+
+- __图神经网络引擎__，通常也为全图迭代。图神经网络引擎除了基于图拓扑的操作，也需要集成一个机器学习的框架来处理向量操作，比如 PyTorch、MXNet、TenserFlow。
+
+三个引擎的操作逻辑不尽相同，独立配置资源池。事图事务引擎基于RPC操作设置了一个线程池，每接受客户端的一个操作，从线程中取一个线程来处理，并发执行的数量等于RPC线程池的容量，通常配置为服务器的核数。图分析引擎有一个分析线程池，每个图分析任务会并发执行，即用所有的线程来执行一个任务，来加速操作的性能。TuGraph图分析操作串行执行的特性会一定程度限制用户的使用体验，并发的图分析的需求可以通过高可用部署的方式，增加机器资源来处理，或者接入外部的任务调度器，将数据传到实时调度的容器来计算。图神经网络操作在图上的操作会复用图事务引擎或图分析引擎的资源，向量的操作会起单独的资源，在机器学习框架中可以使用GPU等单独的加速硬件。
+
+## 4.核心功能
+
+### 4.1.查询语言
+
+TuGraph 提供 Cypher 图查询语言，遵循OpenCypher标准。
+- __支持Procedure嵌入__
+
+- __可插拔优化框架__ 各类优化功能
+
+- __可扩展安全性检查框架__ 对于cypher进行
+
+### 4.2.存储过程
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个 REST 请求并在客户端完成整个
+处理流程的方式，TuGraph 提供的存储过程（Procedure）是更简洁和高效的选择。
+
+从 3.5 版本开始，TuGraph 重新设计了新的存储过程编程范式，支持定义标准的签名和结果，支持POG编程。
+
+TuGraph 支持 POG (Procedres on Graph Query Languages) 编程和 POG 库，其中“Graph Query Languages”包含 Cypher 以及
+制定中的 ISO GQL 等图查询语言。POG 库提供在查询语言中对用户定义的存储过程的访问，打破了查询语言和存储过程之间的界限，扩展了查询
+语言的使用范围。
+
+> 这个文档描述了 [新的 Procedure 编程范式以及 POG](../5.developer-manual/6.interface/3.procedure/1.procedure.md)。
+
+### 4.3.数据导入导出
+
+尽管TuGraph本身支持数据的插入，但批量导入能够大幅提升的效率。导入的功能可以分为空库导入（离线导入）和增量导入，前者指子图是空的时候进行导入，额外的假设能够大幅提升导入的性能，在 TuGraph 中，空库导入和增量导入的吞吐率差了10 倍。在数据导出中，需要考虑导出数据的一致性，即是基于一个快照数据导出的。
+
+TuGraph 可以通过 命令行工具`lgraph_export` 来对已经存放在TuGraph的图数据进行数据导出，导出格式支持CSV和JSON。
+
+### 4.4.备份恢复
+
+TUGraph的备份在功能上可分为主动/定时、离线/在线、全量/增量备份，用尽量小的存储和计算代价来完成备份。恢复功能可以恢复到最新的状态，或者历史标注的时间点，需要保证数据库是一致的状态。
+
+### 4.5 数据预热
+
+TuGraph 是基于磁盘的图数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+### 4.6 高可用
+
+高可用是指通过通过集群配置，做到实时多副本数据热备，在部分副本不用时，集群仍然能正常提供服务，TuGraph采用 RAFT 协议的多机热备机制，能够将 RPO 降低到接近 0 的程度。TuGraph 选择在计算层进行数据同步，同步的对象是写操作，通过 RPC 接口快速同步。TuGraph 的高可用集群采用主从模式，只有主节点处理写请求，主从节点均能处理读请求。主节点的写请求处理需要同步到多于二分之一的总节点上，多数节点写成功，该写请求才算完成。
+
+## 5.客户端工具
+
+客户端主要分为各种编程语言的SDK，OGM以及命令行工具。
+
+客户端 SDK 主要用于二次开发，可以通过 RPC 或 REST 协议链接服务端。RPC 基于长链接有较好的性能，数据需要通过 protobuf 统一序列化。TuGraph 使用brpc，支持 Java、Python、C++ 的 rpc 客户端。REST 的协议比较宽泛，能够简单适配更加多样的环境，不同的编程语言能够简单对接。TuGraph 给出了 Python 的REST 客户端实例，命令行的交互也是用 REST 实现。
+
+OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。
+
+命令行工具`lgraph_cypher`是查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+
+## 6.生态工具
+
+生态工具是企业级数据库一个非常重要的组成部分，丰富的生态工具能够大大提升图数据库的可用性，稳定性。
+
+### 6.1.TuGraph DataX
+
+![导入导出](../../../images/tugraph-datax.png)
+
+TuGraph 核心支持 CSV 和 JSON 合适的导入导出，提供空库导入和增量导入的模式。实际中会存在 MySQL、Kafka、Hive 等多数据源导入的需求，TuGraph 通过 DataX 做多数据源的对接。由于关系模型和图模型存在的差异，数据清洗的流程可以使用 SparkSQL 快速处理，TuGraph 本身仅关注 CSV 和 JSON 的简单场景导入可靠性和性能。
+
+### 6.2.可视化交互
+
+TuGraph Browser 是面向图数据库直接使用者的可视化交互界面，功能上覆盖了 TuGraph 的绝大部分能力，包括数据导入、图模型建立、数据增删查改、监控运维等操作链路。
+
+TuGraph Explorer 则是面向图业务方，更侧重业务逻辑。Explorer 是基于Graph Insight的零代码编程框架生成的可视化交互界面，可以比较方便地添加业务更加友好的交互元素，把图作为一个底层的理解形象的展现出来。
+
+### 6.3.运维监控
+
+TuGraph 使用 Prometheus 加 Grafana 的监控框架，采用松耦合的方式。Prometheus 从 TuGraph 的监控接口获取监控信息，存储在本地时序数据库中，然后通过 Grafana 在网页端交互展示。
+
+TuGraph 提供的监控的状态包括图数据库的状态和服务器的状态，前者包括读写负载、点边数量等数据库端的状态，后者包括内存、CPU、硬盘等服务器的实时状态。如果某些监控状态超过了预期的阈值，就需要主动告警，通常需要对接其他运维管控系统，比如群消息、邮件告警等。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/7.scenarios.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/7.scenarios.md
new file mode 100644
index 0000000000..4cc5c0c10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/7.scenarios.md
@@ -0,0 +1,61 @@
+# 应用场景
+
+> 此文档主要介绍图数据库适用的应用场景。
+
+## 1. 金融领域
+
+金融领域的实体主要涉及人、公司、账户、产品等，它们之间的关系包括交易关系、登录关系、股权关系、雇佣关系等。这些实体构成了一张金融图数据网络。应用图数据库，我们可以从金融图数据网络里发掘出大量有用信息，帮助我们做出更准确的金融决策。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|贷款审核|通过分析申请人的关联关系、交易情况等辅助判断申请人的偿还能力和偿还意愿，可应用于零售贷款审核、小微贷款审核、供应链金融等。此方法可与传统的基于申请人自身信息的审核机制互补，在个体信息录覆盖较低的小微贷款审核中尤其有用。|
+|贷后管理|通过分析借款人交易情况，辅助分析借款人是否有逾期风险。相比于传统只在贷款资金流向特定用户的情况下发出警报的方式不同，该方法可以给每个账户赋予一个风险值，并在贷款流向高风险账户时给出预警。|
+|失联修复|通过分析失联贷款人的社交和购物数据，找出其它联系方式。该方法可以大幅改进失联修复率。|
+|担保环检测|可在担保关系图中找出环状、链式、家族式、交叉等特殊担保结构，揭露潜在风险。相比于关系型数据库的JOIN方法，基于图算法的方案更高效，可以检测出任意长的担保环，且可以实现更复杂限定条件的检测。|
+|信用卡团伙欺诈检测|构建信用卡申请信息中的地址、联系方式等关系网络，在申请关系网络中运行社区发现算法，可以检测出疑似欺诈的团伙，从而拒绝涉嫌欺诈的申请件，减少经济损失。|
+|反洗钱|通过交易网络和介质网络，找出疑似洗钱的行为和链路。洗钱是一个复杂的多方参与的过程，通过在交易和社交网络中进行图分析，我们可以更精准的检测出洗钱行为。|
+|车险反欺诈|针对有修理厂参与的骗保行为，通过分析被保人、案件地点和修理厂之间的关系，可以更精准的识别出骗保行为，减少经济损失。|
+
+## 2. 工业领域
+
+在生产和制造过程中会产生大量异构数据，如何有效的组织和管理这些数据是工业大数据中最重要的问题之一。这些数据包括设计文档、设备数据、仿真方案和结果、实验结果、经验文档等，关系错综复杂。传统的数据管理系统只能累积数据，而查找相关材料则往往力不从心。使用图模型，将这些不同类型的数据组织成一张网络，就可以方便地浏览和查找数据。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|供应链管理|供应链数据主要关心产品—部件—零件的对应关系、零件与供应商的对应关系、零件中的敏感成分等。相比于传统的物料管理（BOM）系统，使用图数据库的方案可以更方便地维护多个部件层次、多个供应商级别的复杂网络，从而为穿透式供应链提供基础支持。|
+|文档管理|使用图数据库可以将不同类型的文档按不同关系有机地组织在一起。例如将部件设计文档、部件—零件关系、部件测试文档、相关经验文档等组织起来，在需要查找时就可以方便获取该部件的所有相关信息。|
+|研发过程管理|产品研发和验证过程中需要进行大量仿真、试验和测试，每一个测试流程都会涉及大量不同的步骤。步骤之间的连接关系、每个步骤中使用的数据版本、算法版本等就构成了一张复杂的关系网络。使用图数据库可以更好管理这个关系网络，从而为研发过程中的数据复用、流程改进提供良好基础。|
+|设备信息管理|制造业需要管理大量设备，设备之间又互相关联（供电关系、供料关系、空间关系），从而形成了一张复杂的网络。传统的数据库很难体现这种复杂关系。而使用图数据库则可以便捷表示这些关系，从而更好的管理设备信息。|
+
+## 3. 智慧城市
+
+随着科技的发展，城市的智能化管理已成为一个大趋势。智能化管理需要建立在良好的信息管理平台之上，因此需要强大的系统软件做支撑。在智能化城市管理系统中，智能化决策系统需要基于大量不同信息做出决策，这些信息包括各种拓扑信息（道路、管线），供求信息（电力输送、饮用水供应、污水排放），环境信息（温度、湿度、雨量）等。要将这些复杂的异构数据有机管理起来，并基于它们做出决策，就需要一个成熟的系统。传统的数据管理系统基于关系数据模型，并不适合管理这种复杂异构数据。而使用图模型就可以很好的解决这一问题。如果我们将这些不同的数据利用图数据库进行管理，就可以实现很多复杂的智能管理场景。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|智能交通|基于道路拓扑、道路容量及当前流量，可以进行智能信号灯调度，从而提高通行效率。|
+|智能排水|基于排水系统信息及当前雨量，可以对排水系统进行调度，从而减少内涝的产生。|
+|管线管理|将管线的生产、安装、拓扑信息，以及历史状态信息有机组织起来，可以帮助我们对管线进行全周期管理，包括故障排查、寿命评估等。|
+|人群疏散|大量人群需要疏散时，需要考虑公交、地铁、出租车、共享单车等多种交通方式，同时还需要考虑道路承载量。使用图数据库将这些信息有机整合在一起，可以帮助我们更好的做出决策，以便为大型公共活动提供更好的支持。|
+
+## 4. 社会治理
+
+社会治理包括公共安全、法律事务、舆论、网络安全等多方面。社会治理是一个综合性的、多系统联动问题。它需要综合大量数据、全局考量才能做出更好的决策。在这种多维度复杂数据问题上，图数据模型可以提供更好的适应性，从而为智能化的社会治理决策平台提供坚实的基础。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|犯罪团伙发现|合谋团伙必然会通过某些方式产生联系，这种联系包括面谈（出现在同一地点）、电话联系、或者互联网联系，他们还可能有经济往来。如果我们将这些数据统一存放在一张图中，我们就可以通过图分析算法查找出联系紧密的群体，从而发现和识别整个犯罪团伙。|
+|涉众案件调查|涉众案件，特别是涉众经济案件往往涉及大量的人员和要素（货币、地点、事件等）。如何有效的组织这些资料，从而为办案提供证据支持是涉众案件调查的一个难点。使用图数据库来存储和分析这些资料，可以让我们快速定位资料、分析人员构成、为案件调查提供更好的技术支持。|
+|违法网站甄别|违法网站、钓鱼网站、黄色网站等往往通过使用不同的域名和IP来避免被封杀。基于黑名单的过滤方法只能封禁已知的违法网站，无法对新出现的域名和IP进行有效甄别。基于IP—域名网络的映射关系，我们可以建立一张图，然后通过图计算建立起域名和IP的“可信度”模型，利用该模型来判断网站是否属于违法网站。|
+|法院卷宗管理|卷宗往往错综复杂，不同的案件之间可能通过当事人产生联系，也可能通过案发地、案件性质、审判人员等产生联系。这些联系构成了一张复杂的网络。使用图数据库我们可以更方便的管理这些复杂关系，提高办案和查询效率。|
+
+## 5. 互联网
+
+人—人关系的社交网络、人—商品的购买关系都能构成图。通过分析这些网络数据，我们可以为用户提供更优质的服务，包括相关推荐、用户信息归集、重要用户识别、垃圾用户识别等。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|ID映射|图数据库可以将用户相关的所有信息，包括用户之间的关系统一存储在一个数据库中，同时还能通过这些关系来找出疑似单人多号和多人一号的情况，从而为后期的风控、推荐等业务提供决策支持。|
+|好友推荐|基于分析社交网络，我们可以提供“好友的好友”，“共同好友”等好友推荐。|
+|商品推荐|基于用户—商品关系图，我们可以找出兴趣爱好类似的用户，向他们推荐类似用户选择的其他商品。|
+|垃圾用户识别|传统的垃圾用户识别主要基于用户账号本身的信息，如注册信息、发帖信息等，但是这些信息都比较容易伪造。而基于网络的信息则不存在这个问题：它们很难被伪造。因此基于网络信息的垃圾用户识别可以更加精准和高效。|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/8.glossary.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/8.glossary.md
new file mode 100644
index 0000000000..5171d5ece8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/8.glossary.md
@@ -0,0 +1,38 @@
+# 名词解释
+
+## 1.图技术
+
+> __图计算__：广义图计算，技术上包括图查询、图分析、图学习；狭义图计算，包括图计算任务和图分析。
+
+> __图查询__：指图数据库的查询能力，通常通过Cypher/ISO GQL等查询语言实现。
+
+> __图分析__：侧重于对全图数据的算法分析、模式分析等。
+
+> __图学习__：与图神经网络、图机器学习含义相同。
+
+> __图智能__：等于广义图计算，包括图数据库、图分析、图学习，通常用于概念推广，不用于产品。
+
+## 2.图产品
+
+> __图计算系统__：一般包括图数据库、图分析系统、图学习系统，有时也特指图分析系统。
+
+> __图数据库__：侧重于对图数据的增删改查、事务性操作等，如TuGraph DB、Neo4j、JanusGraph等。
+
+> __图分析系统__：解决图分析问题，可以细分为流水图分析、离线图分析，如TuGraph Analytics、GraphX等。
+
+> __图学习系统__：解决图学习问题，比如TuGraph Learn、DGL等。
+
+## 3.具体概念
+
+
+> __Vertex__：点，也叫顶点，也指 Vertex Value。尽量避免Node（结点、节点）的叫法，一般用Node表示服务器个数，容易叫混。结点指结合、交结、交叉的意思；节点可以指一个时间线上的里程碑（关键节点）或计算机系统里的一个处理实体（如计算机网络里的一台服务器）。
+
+> __Edge__：边，也指 Edge Value。
+
+> __Vertex Label__：点类型，也叫 Vertex Type。
+
+> __Edge Label__：边类型，也叫 Edge Type。
+
+> __Degree__：度，入度/出度，表示一个点的入边、出边的条数。注意，在非图论的场景中，往往把“跳”也称作“度”。
+
+> __Hop__：跳，表示一个点到另一个点之间的路径经过的点数（不含起点、含终点）。算法性能测试里K-Hop即为此义。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/index.rst
new file mode 100644
index 0000000000..3346808f92
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/2.introduction/index.rst
@@ -0,0 +1,16 @@
+TuGraph入门
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.characteristics/index.rst
+   5.architecture
+   6.functionality
+   7.scenarios
+   8.glossary
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..94a84fd721
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/1.preparation.md
@@ -0,0 +1,85 @@
+# 快速上手
+
+> 此文档主要用于新用户快速上手，其中包含了 TuGraph 的简介、特征、安装和使用。
+
+## 1.简介
+
+TuGraph 是蚂蚁集团自主研发的大规模图计算系统，提供图数据库引擎和图分析引擎。其主要特点是大数据量存储和计算，高吞吐率，以及灵活的 API，同时支持高效的在线事务处理（OLTP）和在线分析处理（OLAP）。 LightGraph、GeaGraph 是 TuGraph 的曾用名。
+
+主要功能特征包括：
+
+- 标签属性图模型
+- 支持多图
+- 完善的 ACID 事务处理
+- 内置 34 图分析算法
+- 基于 web 客户端的图可视化工具
+- 支持 RESTful API 和 RPC
+- OpenCypher 图查询语言
+- 基于 C++/Python/Java 的存储过程
+- 适用于高效图算法开发的 Traversal API
+
+性能及可扩展性特征包括：
+
+- TB 级大容量
+- 千万点/秒的高吞吐率
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线备份
+
+
+### 1.1.支持的平台
+
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的的平台。
+
+### 1.2.硬件要求
+
+_目前我们建议用户使用 NVMe SSD 配合较大的内存配置以获取最佳性能。_
+
+| 硬件     | 最低配置  | 建议配置                 |
+| -------- | --------- | ------------------------ |
+| CPU      | X86_64    | Xeon E5 2670 v4          |
+| 内存     | 4GB       | 256GB                    |
+| 硬盘     | 100GB     | 1TB NVMe SSD             |
+| 操作系统 | Linux 2.6 | Ubuntu 18.04, CentOS 7.3 |
+
+## 2.安装
+
+TuGraph 可以通过 Docker Image 快速安装，或者通过 rpm/deb 包本地安装。另外TuGraph在阿里云计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。
+
+> 安装包下载：官网下载地址[TuGraph DownLoad]( https://www.tugraph.org/download )。
+
+> 镜像下载：镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用；或者直接拉取镜像，如下文所示。
+
+> 计算巢部署：可以在阿里云计算巢自行搜索，也可以通过[部署链接]( https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true )快速访问。
+
+### 2.1.通过docker快速体验
+
+1. 本地安装 docker 环境
+
+   参考 docker 官方文档：https://docs.docker.com/get-started/
+
+2. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. 启动docker
+   ```shell
+   docker run -d -p 7070:7070 -p 9090:9090 --name tugraph_demo tugraph/tugraph-runtime-centos7 lgraph_server
+   # 7070是默认的http端口，web访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   ```
+
+4. web 访问
+
+   `http://x.x.x.x:7070`
+
+   > 默认用户名为 `admin`，密码为 `73@TuGraph`
+
+5. 手动启动方式
+   ```shell
+   docker run -dt -p 7070:7070 --name tugraph_demo tugraph/tugraph-runtime-centos7
+   docker exec -it tugraph_demo bash
+   # 进入docker环境后执行如下命令启动服务
+   lgraph_server -d start
+   ```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..b8dd8d03ec
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# 影视场景Demo
+
+> 此文档主要介绍 影视场景Demo 的使用方法。
+
+## 1.建模和数据导入
+
+完成登录后，点击`新建图项目`，选择movie数据，填写图项目配置，系统会自动完成Movie场景图项目创建。或者直接使用产品自带的movie图项目（带有官方图标）。
+
+Movie 场景图：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| 标签          | 类型  | 说明                                  |
+|-------------|-----|-------------------------------------|
+| movie       | 实体  | 表示某一部具体的影片，比如"阿甘正传"。                |
+| person      | 实体  | 表示个人，对影片来说可能是演员、导演，或编剧。             |
+| genre       | 实体  | 表示影片的类型，比如剧情片、恐怖片。                  |
+| keyword     | 实体  | 表示与影片相关的一些关键字，比如"拯救世界"、"虚拟现实"、"地铁"。 |
+| user        | 实体  | 表示观影的用户。                            |
+| produce     | 关系  | 表示影片的出品人关系。                         |
+| acted_in    | 关系  | 表示演员出演了哪些影片。                        |
+| direct      | 关系  | 表示影片的导演是谁。                          |
+| write       | 关系  | 表示影片的编剧关系。                          |
+| has_genre   | 关系  | 表示影片的类型分类。                          |
+| has_keyword | 关系  | 表示影片的一些关键字，即更细分类的标签。                |
+| rate        | 关系  | 表示用户对影片的打分。                         |
+
+## 2.查询示例
+
+### 2.1.示例一
+
+查询影片 'Forrest Gump' 的所有演员，返回影片和演员构成的子图。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.示例二
+
+查询影片 'Forrest Gump' 的所有演员，列出演员在影片中扮演的角色。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.示例三
+
+查询 Michael 所有评分低于 3 分的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.示例四
+
+查询和 Michael 有相同讨厌的影片的用户，讨厌标准为评分小于三分。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.示例五
+
+给 Michael 推荐影片，方法为先找出和 Michael 讨厌同样影片的用户，再筛选出这部分用户喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.示例六
+
+查询 Michael 的好友们喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.示例七
+
+通过查询给'Forrest Gump'打高分的人也喜欢哪些影片，给喜欢'Forrest Gump'的用户推荐类似的影片。
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..c39e48f40d
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,62 @@
+# 场景：流浪地球
+
+> 此文档主要介绍 流浪地球 demo的使用方法。
+
+## 1.Demo场景设计
+
+Demo背景基于流浪地球1、流浪地球2的故事背景进行设计
+
+- 基于剧情，设计了图结构，包含组织、角色、天体与设施3类点，事件、关系两类边
+- 根据剧情准备了对应Schema的数据
+- 准备了一些query，提出一些关于剧情的问题
+
+## 2.目录结构
+
+- rawdata: 原始剧情数据和schema定义文件
+- case.cypher: 查询相关的Cypher语句
+- control.sh: 控制TuGraph Server启动停止的脚本
+- lgraph_standalone.json: TuGraph Server启动的配置文件
+
+## 3.使用说明
+
+前置条件：TuGraph已安装
+
+## 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择流浪地球数据，填写图项目配置，系统会自动完成流浪地球场景图项目创建。
+    - 或者直接使用产品自带的流浪地球图项目（带有官方图标）。
+
+## 5.Cypher查询
+
+参考cypher文档，在TuGraph的Web页面前端输入Cypher进行查询
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.查询展示
+查询木星危机的所有事件经过
+
+```
+MATCH (n)-[e:事件关系]-(m) where e.title='木星危机' RETURN n,e
+```
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+查询所以危机的相关事件经过
+
+```cypher
+MATCH (n)-[e1]-(m)-[e2]-(p)
+where e1.title REGEXP ".*危机" and e2.title REGEXP ".*危机" and e1.title <> e2.title
+RETURN n,e1,e2,p
+```
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..13d98b4db8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# 场景：三体
+
+> 此文档主要介绍 三体 demo的使用方法。
+
+## 1.Demo场景设计
+Demo背景基于三体1、三体2、三体3的故事背景进行设计。
+
+根据三体故事的设定，我们设计了4类点和6类边，点包括“人物”、“组织”、“计划”、“时间线”，边包括“人物-人物关系”、“人物-计划关系”、“人物-组织关系”、“组织-计划关系”、“组织-组织关系”。
+根据剧情准备了对应Schema的数据，准备了一些query，提出一些关于剧情的问题。
+
+## 2.目录结构
+rawdata: 原始剧情数据和schema定义文件。
+case.cypher: 查询相关的Cypher语句。
+control.sh: 控制TuGraph Server启动停止的脚本。
+lgraph_standalone.json: TuGraph Server启动的配置文件。
+
+## 3.使用说明
+
+前置条件：TuGraph已安装。
+
+### 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三体数据，填写图项目配置，系统会自动完成三体场景图项目创建。
+    - 或者直接使用产品自带的三体图项目（带有官方图标）。
+
+### 5.Cypher查询
+
+参考TuGraph文档，在TuGraph的Web页面前端输入Cypher进行查询。
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![data](../../../../images/three-body-data.png)
+
+### 7.查询展示
+
+#### 7.1.人物关系查询
+三体一剧情中，一开始全世界各地发生了大量科学家自杀事件，引起了警方重视，查案过程根据人物关系线索一步步排查，就如上面的图所示，随着线索越来越多，背后的真相逐步浮出水面。史强和汪淼发现大多数人都和叶文洁有着直接或者间接的联系，并派汪淼卧底，最终发现叶文洁的最终统帅身份。在图中也可以看出，叶文洁顶点周围有很多边关系（一度或二度邻居很多）。
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.邻域顶点分析
+三体中的各种计划比较多，有的时候可能会被绕晕，这时候我们可以通过图的邻居顶点查询来查看该计划的相关人物和组织等。如"面壁计划"中,我们可以看到有四位人物与之相关，这四位也是被世人所寄予厚望的“面壁者”。
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.查询a节点和b节点的共同邻居
+我们往往希望知道两个人物之间的共同关联的人物都有谁，这样就能很快的掌握这两个人物之间的关系，在大数据量的情况下，使用cypher进行图关系分析就很方便！
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.设置/更改属性
+随着剧情推进，我们逐步了解了"叶文洁"身上的多个标签，那么我们也可以将这些标签更新至“叶文洁”节点上：
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.增加/删除节点
+后续我们了解到了罗辑、程心等等人物和PIA、星环集团等组织，希望把这些作为节点添加至图中：
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..3252a13eb5
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# 场景：三国
+
+> 此文档主要介绍 三国 demo的使用方法。
+
+## 1. 简介
+由于史料的缺失，一些即使为人们熟知的历史事件也往往存在着很多未解之谜。以三国历史为例，诸葛亮为什么出山帮助当时势力弱小的刘备，同为天下英雄的曹操和刘备为什么成就差距巨大等等。以往学者往往采用二维关系分析历史，这样得出的结论往往比较片面。使用TuGraph将三国的历史人物和事件导入图模型中，使用图计算方式进行分析，能够帮助我们从有限的信息中获得更有价值的知识，是一种非常有意义的跨学科尝试。
+## 2. 数据建模
+我们设计了5类顶点和5类边，点包括“主公”，“州”，“文臣”，“武将”，“战役”，边包括“父亲”，“兄长”，“隶属”，“籍贯”，“参战”。其具体建模信息如下所示：
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. 数据导入
+- 手动导入
+    - 向TuGraph导入数据，既可以使用TuGraph的`lgraph_import`工具离线导入。lgraph_import导入命令如下所示
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- 自动创建
+    - 点击`新建图项目`，选择三国数据，填写图项目配置，系统会自动完成三国场景图项目创建。
+    - 或者直接使用产品自带的三国图项目（带有官方图标）。
+## 4. Cypher分析
+### 4.1. 诸葛亮为什么选择刘备
+通过如下cypher命令可以查看诸葛亮和曹操、刘备之间的关系
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+从图中可以很直观的看出，曹操和诸葛亮之间的最短路径之一包含徐州之战，曹操曾经因父亲被杀对徐州进行过屠城，而诸葛亮是徐州琅琊郡人，任何人都断然不会选择一个屠杀过自己家乡的军阀作为主公。而相反，刘备曾经在徐州之战中阻止过曹操的暴行，这应当是诸葛亮对刘备好感的原因之一。
+
+### 4.2. 曹操为什么成就比刘备高
+通过如下cypher命令可以查看家族对曹操创业的助力
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+平定天下最重要的就是军事人才，曹操其父本姓夏侯，过继于曹氏，曹氏和夏侯氏在谯县都属于地方大族，在曹操创业初期提供了夏侯惇，夏侯渊，曹仁，曹洪在内大量的军事人才。而刘备其父早丧，没有家族助力，年过50才凑齐了自己的五虎上将，而这时已经过了天下大乱争夺地盘的最佳时机，曹操已经天下九州居其六了。
+
+### 4.3. 三国中最强大的魏国为何最先灭亡
+通过如下cypher命令可以查看曹操集团的重要文官组成
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+曹魏事实上于249年灭亡于高平陵之变，立国29年，少于蜀汉（43年）和东吴（51年）。三国中实力最强大的魏国最先灭亡的原因就在于曹魏的文官制度（九品中正制）使得权力很容易集中在世家大族手中。从图中可以看出，曹操曹丕父子两代的重要文臣几乎都是世家大族，颍川荀氏，颍川钟氏，颍川陈氏，武威贾氏等，甚至还出现了地区化趋势，集中于颍川，最终政权也为和颍川荀氏关系密切的河内司马氏所篡夺。
+
+### 4.4. 三国各自的实力究竟如何
+通过如下cypher命令可以查看三国各集团的人口实力
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+得到的查询结果如下表所示
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+古代社会衡量一个国家实力的重要指标是人口数量，由于人口数据缺失，我们使用三国所有主公和文臣武将的籍贯数据估计每个州的人口数量。发现三国主要人物中，按籍贯有60个属于魏国，有23个属于吴国，仅有2个属于蜀国，证明魏国确实是三国中最强大的国家。
+
+### 4.5. 曹操的军事能力如何评价
+通过如下cypher命令可以查看曹操参与的主要战役
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+从图中可以看出，曹操在三国主要的15场战役中参加了8场，出场率比较高。但是曹操只获胜了徐州之战、兖州之战、官渡之战和襄樊之战，汉中之战、宛城之战、群雄讨董和赤壁之战都失败了，综合胜率50%，证明曹操并不算一个非常优秀的军事家。
+
+## 5. 备注
+更多的分析有待大家积极补充和尝试！
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..4a29f62826
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo示例
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..e630bd12bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+快速上手
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..d93a71dbf5
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,526 @@
+# 可视化操作手册
+
+> 此文档主要介绍 TuGraph Browser 的使用和操作方法。
+
+## 1.简介
+
+TuGraph Browser（以下简称Browser）是一款功能强大的产品可视化开发工具，它以直观的可视化方式呈现图数据，使用户可以轻松地管理、维护和查看数据库运行状态。此工具不仅支持图数据的管理和可视化，还支持对系统账户的管理，为用户提供了全面的操作和管理体验，让用户能够更加高效地管理和利用图数据库。
+
+## 2.操作指南
+
+### 2.1.访问
+
+当用户完成图数据库的安装后，可以通过浏览器访问Browser。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 8888。
+
+- 例如：127.0.0.1:8888
+- 推荐使用Chrome
+
+### 2.2.登录
+
+![login](../../../images/browser/login.png)
+
+- 浏览器成功访问Browser后，首先进入的是登录页面（如上图所示），用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 2.3.快速上手
+
+对于首次使用TuGraph的用户，可以通过产品内置的demo数据快速构建一个图项目，快速上手图数据项目。
+
+#### 2.3.1.创建图项目
+
+在`图项目`首页的选项卡中，点击`新建图项目`创建新的图项目。
+
+![快速上手-新建图项目](../../../images/browser/quickstart-creategraph.png)
+
+选择一个产品内置的demo数据，点击`下一步`按钮。
+
+![快速上手-选择一个demo](../../../images/browser/quickstart-selectdemo.png)
+
+在`填写配置`界面输入图项目信息，demo数据量都相对较小，`最大存储空间`设置为1G即可。输入完图项目信息后，点击`创建`按钮后，系统会自动创建demo数据的图模型、导入图数据。
+
+![快速上手-填写配置](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.开始图项目
+
+demo数据的图项目创建完成后，可以在`图项目`的选项卡中找到相应的图项目，可以点击`图查询`查询图数据。
+
+![快速上手-图项目选项卡](../../../images/browser/quickstart-graphtab.png)
+
+执行默认的查询语句，浏览demo里的图数据。
+
+![快速上手-验证结果](../../../images/browser/quickstart-result.png)
+
+更多快速上手文档请浏览[快速上手文档](../3.quick-start/1.preparation.md)
+
+### 2.4.图项目
+
+`图项目`提供可视化的图项目管理和图数据研发功能，它为用户提供了一系列便捷的图数据可视化操作，包括图项目的创建、修改、删除等管理操作，以及图数据的查询、点边统计等操作。此外，它也支持图模型的管理，使用户可以更加方便地进行图数据的管理和维护。
+
+#### 2.4.1.图项目管理
+
+在`图项目`界面，可以看到当前图数据库中的图项目。
+
+![图项目-首页](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.新建图项目
+
+在`图项目`界面，点击`新建图项目`按钮创建一个新的图项目。
+
+![图项目-新建图项目按钮](../../../images/browser/graphmanagement-creategraph.png)
+
+新建图项目需要通过`选择模板`和`填写配置`两个页面完成图项目的创建。
+
+- __选择模板__：产品提供空模板和demo模板两类模板。
+    - 空模板：全新的图项目，用户需要自己创建图模型和导入图数据，一般用于正式项目开发。
+    - demo模板：产品内置的demo数据，图项目创建成功后，系统会自动创建demo图模型并导入demo图数据，一般用于试用和学习。
+
+![图项目-选择模板](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __填写配置__：用户需要填写图项目基本信息，并点击`创建`按钮创建图项目。
+    - 图名称：新建图项目的名称，同时作为该图项目的唯一主键。支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+    - 图描述：新建图项目的描述，可用于详细说明该项目的背景和目标。
+    - 高级配置-最大存储空间：设置图项目最大可占用的存储空间，实际并不会提前占用物理存储空间，实际数据量达到最大存储空间阈值后不可再写入数据。
+
+![图项目-填写配置](../../../images/browser/graphmanagement-configure.png)
+
+创建成功后，可在`图项目`页面的图项目选项卡中查看。
+
+##### 2.4.1.2.编辑图项目
+
+在`图项目`界面，点击图项目选项卡中的`编辑`按钮（笔形图标），编辑对应图项目的基础信息。
+
+![图项目-编辑图项目按钮](../../../images/browser/graphmanagement-editgraph-button.png)
+
+编辑图项目功能可以修改`图名称`和`图描述`。
+
+![图项目-编辑图项目](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.删除图项目
+
+在`图项目`界面，点击图项目选项卡中的`删除`按钮（垃圾桶图标），删除对应的图项目。
+
+![图项目-删除图项目按钮](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_需要注意：图项目删除后无法恢复_。
+
+##### 2.4.1.4.点边统计
+
+在`图项目`界面，点击图项目选项卡中的`点边统计`按钮（折线图标或刷新图标），统计对应图项目的点边数量。
+
+![图项目-点边统计按钮](../../../images/browser/graphmanagement-statistics-button.png)
+
+统计结果将展示展示图项目选项卡上，未进行过点边统计的图项目会显示`暂无点边数据`，已经统计过点边数据的图项目再次统计需要点击`刷新`按钮。
+
+![图项目-点边统计](../../../images/browser/graphmanagement-statistics.png)
+
+![图项目-刷新点边统计按钮](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.图构建
+
+Browser的`图构建`功能主要用于图项目的模型定义和数据导入。在`图项目`页面中，点击图项目选项卡中的`图构建`按钮。
+
+![图构建-按钮](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.模型定义
+
+Browser提供可视化的方式创建和维护图模型。
+
+- 也可用通过`cypher`工具和`lgraph_import`工具创建和维护图模型，详见[Cypher API](../5.developer-manual/6.interface/1.cypher.md)和[数据导入](../5.developer-manual/3.server-tools/1.data-import.md)文档。
+
+###### a.浏览图模型
+
+在`模型定义`界面可以查看详细的图模型设置，支持列表和画布方式查看图模型，支持列表展示点类型的属性和索引、边类型的属性和起点/终点类型。
+
+![图构建-浏览图模型](../../../images/browser/graphbuild.png)
+
+- 支持列表查看点类型和边类型。
+    - 支持点类型和边类型的个数展示，在点类型或边类型页签中展示对应的点或边数量。
+    - 支持点类型和边类型的名称关键字搜索，在`搜索框`输入关键字可展示对应的点或边。
+
+        ![图构建-浏览图模型-搜索](../../../images/browser/graphbuild-list-search.png)
+    - 支持点类型和边类型的名称复制，点击`复制`按钮可以复制点或边的名称至粘贴板。
+
+        ![图构建-浏览图模型-复制](../../../images/browser/graphbuild-list-copy.png)
+    - 支持点类型和边类型的删除，点击`删除`按钮可以删除对应的点或边。
+
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-list-delete.png)
+- 支持画布方式查看点类型和边类型。
+- 在列表或画布中点击相应的点类型或边类型，可以展示模型详情。
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-select.png)
+
+###### b.添加点
+
+在`模型定义`界面点击`添加点`按钮，在右侧滑动窗口中添加点类型。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex-button.png)
+
+用户需要输入点类型名称、属性和索引，点击`完成`按钮完成点类型的创建。
+- 点类型名称：点的名称，也是该点的唯一标识。
+- 属性：点的属性，需要一个属性作为主键。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建点时可以任意删除属性。
+- 索引：点的索引属性，需要先创建属性再设置该属性为索引，索引创建成功后无法修改。
+    - 属性：需要配置索引的属性。
+    - 唯一：设置该属性字段为唯一值。
+    - 主键：对应属性是否为主键，选择`是`后`唯一`选项必须为`是`。
+    - 删除：在创建点时可以任意删除索引。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex.png)
+
+- 编辑点：可以增加点的属性和修改已有属性的数据类型，新增或删除索引。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+_注：主键字段的属性创建后无修改_
+
+![图构建-编辑点](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.添加边
+
+在`模型定义`界面点击`添加边`按钮，在右侧滑动窗口中添加边类型。
+
+![图构建-添加边按钮](../../../images/browser/graphbuild-addedge-button.png)
+
+用户需要输入边类型名称、属性、选择起点类型和终点类型，点击`完成`按钮完成边类型的创建。
+- 边类型名称：边的名称，也是该边的唯一标识。
+- 属性：边的属性，边上可以没有属性。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建边时可以任意删除属性。
+- 选择起点类型和终点类型：设置边的起点点类型和终点点类型，支持多个起点类型和终点类型。
+    - 起点：选择起点的点类型。
+    - 终点：选择终点的点类型。
+    - 需要提前创建至少一个点类型才能设置边的起点类型和终点。
+    - 如果不选择则表示起点和终点可以为任意点类型，同时画布上不展示对应的边，需要在左侧列表查看边类型。
+
+![图构建-添加边](../../../images/browser/graphbuild-addedge.png)
+
+- 编辑边：可以增加边的属性和修改已有属性的数据类型。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+
+![图构建-编辑边](../../../images/browser/graphbuild-editedge.png)
+
+###### d.导入模型
+
+在`模型定义`界面点击`导入模型`按钮，可以上传模型文件快速创建模型。
+
+![图构建-导入模型按钮](../../../images/browser/graphbuild-importmodel-button.png)
+
+在`导入模型`界面点击`上传文件`按钮，上传模型文件成功后，点击确定可以导入图模型。
+
+- 覆盖当前画布中的模型：选中该选项，导入时会先清空已有图模型再导入模型文件中的图模型；不选择，会导入模型文件中新增的点类型和边类型，但不会修改已有的点类型和边类型。
+
+![图构建-导入模型](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.导出模型
+
+在`模型定义`界面点击`导出模型`按钮，可以将当前图项目中的图模型导出成json文件。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel-button.png)
+
+模型文件为json格式，不建议手动修改。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.数据导入
+
+完成`模型定义`之后，点击`下一步`按钮进入数据导入页面。
+
+###### a.数据准备
+
+在数据导入前需要提前准备数据，当前Browser支持CSV文件的上传，需要保证数据文件后缀为csv。
+- 不强制要求包含表头。
+- 支持文本限定符，文本限定符为双引号。
+
+![数据导入-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.上传文件
+
+在`数据导入`页面上传需要导入的数据文件，将数据导入到图项目中。
+
+![数据导入-上传文件](../../../images/browser/graphbuild-import.png)
+
+- 分隔符：数据文件的列分隔符。
+- 文件上传：支持上传多个文件。
+    - 支持弹窗中选择多个上传文件。
+    - 支持将文件拖拽至页面中上传。
+    - 支持同时上传点文件和边文件。
+
+###### c.数据映射
+
+文件上传成功后，需要在`数据导入`页面设置`数据对应表`，将数据文件中的数据列和目标点/边、对应属性建立映射关系。
+
+- 数据对应表：展示已经上传的数据问题。
+    - 文件名称：上传的数据文件名称。
+    - 文件大小：上传的数据文件大小。
+    - 读取结果：数据文件上传结果，success为读取成功。
+    - 删除：在页面中删除，不会删除本地文件。
+- 数据文件映射：每个已上传的数据文件都需要配置映射关系。
+    - 标签：选择该文件对应的点或边类型，只能选择一类点或一类边。
+    - 从第N行，开始：从第N行开始读取数据，系统默认从第0行开始读取数据，如需跳过表头可输入1。
+    - 属性映射：下拉选择数据列对应的属性字段。
+    - 数据预览：系统会预读数据文件的前5行。
+
+![数据导入-数据映射](../../../images/browser/graphbuild-import-datamapping.png)
+
+文件上传成功后，可以点击`继续导入`按钮继续导入其他数据，或者点击`前往图查询`按钮在`图查询`页面查询已导入的数据。
+
+![数据导入-导入成功](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.图查询
+
+在`图项目`界面点击图项目选项卡中的`图查询`按钮，可以查询和访问图项目中的图数据，产品提供`语句查询`、`路径查询`、`点查询`等多种模式查询图数据，支持切换图项目和查询结果展示。
+
+![图查询-按钮](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.切换图项目
+
+`图查询`功能只能访问一个图项目数据，用户可以在`切换图项目`下拉框中选择并切换至其他图数据。
+
+![图查询-切换图项目](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.语句查询
+
+Browser提供可视化方式开发和调试图查询语句，用户可以输入图查询语句、执行并返回结果，支持收藏语句和查看图模型。
+
+![图查询-语句查询](../../../images/browser/query-view.png)
+
+###### a.语句查询窗口
+
+用户在`语句查询窗口`输入图查询语句，点击`执行`按钮可以运行对应语句，并在`执行结果页签`展示结果。
+
+- 切换查询语言：提供不同图查询语言模式的切换。_当前只支持Cypher语法_
+
+![图查询-切换语言](../../../images/browser/query-selectgql.png)
+
+- 语句查询窗口：提供当前查询语言的语法提示。
+
+![图查询-语法提示](../../../images/browser/query-gqltips.png)
+
+- 执行：点击`执行`按钮，发送输入的查询语句至后台运行。
+
+![图查询-执行按钮](../../../images/browser/query-execute-button.png)
+
+- 收藏：点击`收藏`按钮，将当前语句查询窗口的内容保存成模板，以便下次使用。
+
+![图查询-收藏按钮](../../../images/browser/query-bookmark-button.png)
+
+- 下载：点击`下载`按钮，将当前语句查询窗口的内容保存成文本文件并下载至本地，以便下次使用。
+
+![图查询-下载按钮](../../../images/browser/query-download-button.png)
+
+详细Cypher使用指南请参考文档：[Cypher API](../5.developer-manual/6.interface/1.cypher.md)
+
+###### b.收藏列表
+
+以列表方式展示已经收藏的查询语句，点击列表中的收藏模板可以使用其中的语句。支持关键字搜索、名称修改以及删除。
+
+![图查询-语句收藏](../../../images/browser/query-bookmark.png)
+
+###### c.查看图模型
+
+Browser提供当前图项目中的图模型查询，方便用户查询有些点类型和边类型，支持列表展示和画布图谱展示方式，支持隐藏查看图模型窗口。
+
+![图查询-图模型列表](../../../images/browser/query-schema-list.png)
+![图查询-图模型图谱](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.路径查询
+
+Browser提供`路径查询`模板，用户可以通过选择路径的方式，查找图项目中的图数据是否存在相应的路径。
+
+![路径查询](../../../images/browser/pathquery-result.png)
+
+- 路径：在路径选择下拉框内选择需要查找的路径。
+    - 选择路径：根据图模型的定义，系统会自动匹配出对应的一度关系路径；再次点击路径下拉框会，系统会根据路径终点的点类型自动匹配下一度关系路径。
+![路径查询-选择路径](../../../images/browser/pathquery-select.png)
+    - 执行：点击`执行`按钮返回图项目中匹配的路径。
+    - 高级配置：设置扫描的路径数目，默认为100条路径。
+![路径查询-高级配置](../../../images/browser/pathquery-configuration.png)
+
+_注：需要图模型中的边设置起点和终点，如果图项目中的边均未设置起点和终点，下拉选项无结果_
+
+##### 2.4.3.4.点查询
+
+Browser提供`点查询`模板，用户可以通过选择点属性进行查询，查找图项目中的点数据。
+
+![点查询](../../../images/browser/vertexquery.png)
+
+- 选择点：选择需要查询的点类型。
+    - 属性：系统会自动匹配点类型的schema，设置相应的查询条件，点击执行按钮返回结果。
+- 返回节点数目：设置返回点数据的上限。
+
+![点查询-条件](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.执行结果页签
+
+Browser提供JSON视图、JSON文本、点边列表、点边视图等多种方式展示图查询结果，支持结果下载、插入数据、全屏展示。
+
+###### a.JSON视图
+
+Browser提供以JSON视图方式展示查询结果。
+
+![JSON视图](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON文本
+
+![JSON文本](../../../images/browser/query-result-jsontxt.png)
+
+###### c.点边列表
+
+Browser提供以点和边列表方式展示查询结果。
+
+![点边列表](../../../images/browser/query-result-list.png)
+
+###### d.点边视图
+
+Browser提供以画布方式展示查询结果。
+
+![点边视图](../../../images/browser/query-result-graph.png)
+
+###### e.插入数据
+
+Browser提供可视化方式在对应图项目中插入点或边数据。点击`插入数据`按钮，在`插入数据`页签选择点类型或边类型，输入属性值，点击确定完成数据插入。
+
+![插入数据-按钮](../../../images/browser/query-result-insert-button.png)
+
+![插入数据](../../../images/browser/query-result-insert.png)
+
+###### f.下载执行结果
+
+Browser提供图查询结果导出成文本文件功能。点击`下载执行结果`按钮，系统会自动将结果保存成文本文件并下载至本地。
+
+![下载执行结果-按钮](../../../images/browser/query-result-download.png)
+![下载执行结果-按钮](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.全屏展示
+
+Browser提供全屏方式展示图查询结果，点击`全屏显示`按钮全屏展示结果，点击`退出全屏`按钮退出全屏展示。
+
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-button.png)
+![全屏展示](../../../images/browser/query-result-fullscreen.png)
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-close.png)
+
+### 2.5.控制台
+
+`控制台`提供可视化的的账户管理和数据库信息查看功能，它为用户提供了全面的账户和角色管理功能，包括账户的增删改查以及禁用，角色的增删改查以及禁用。此外，它也为用户提供了便捷的数据库信息查看功能，让用户可以轻松地查看图数据库的基础信息和配置信息。其中，基础信息主要包括版本号、运行时间、CPP编译版本号等，而数据库配置信息则包括端口号、系统功能参数配置等。
+
+#### 2.5.1.账户管理
+
+##### 2.5.1.1.账户管理
+
+##### 2.5.1.1.1.添加账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户需要输入账户名称、账户描述、账户密码以及相关角色。
+
+![账户管理-添加账户按钮](../../../images/browser/account-add-button.png)
+
+- 账户名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 相关角色：新建账户时必须要选择一个角色，在账户添加成功后，系统会自动生成一个与账户名称一样的角色。
+
+![账户管理-添加账户](../../../images/browser/account-add.png)
+
+##### 2.5.1.1.2.编辑账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户可以编辑账户描述、账户密码以及相关角色。
+
+![账户管理-编辑账户](../../../images/browser/account-edit.png)
+
+##### 2.5.1.1.3.禁用账户
+
+在`账户管理`界面点击`禁用`按钮禁止对应的账户登录和访问，点击`启用`按钮开启对应的账户登录和访问权限。
+
+![账户管理-禁用](../../../images/browser/account-disable.png)
+![账户管理-启用](../../../images/browser/account-enable.png)
+
+##### 2.5.1.1.4.删除账户
+
+在`账户管理`界面点击`删除`按钮删除对应的账户。
+
+![账户管理-删除](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.角色管理
+
+##### 2.5.1.1.1.添加角色
+
+在`角色管理`界面点击`添加`按钮创建新的角色，用户需要输入角色名称、角色描述以及图权限。
+
+![角色管理-添加角色按钮](../../../images/browser/role-add-button.png)
+
+- 角色名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 图权限：browser支持全部、读、写和无共四类图权限配置。
+    - 全部：对应图的读和写权限，包含编辑图模型权限（schema）。
+    - 读写：对应图的写权限，不包含编辑图模型权限（schema）。
+    - 只读：对应图的读权限。
+    - 无：无法访问和操作对应图。
+- 角色冲突：当两个角色对同一个图有不同图权限，同时对一个账户授权了这两个角色，该账户对该图的图权限为两个角色的并集。
+
+![角色管理-添加角色](../../../images/browser/role-add.png)
+
+##### 2.5.1.1.2.编辑角色
+
+在`角色管理`界面点击`编辑`按钮编辑已有角色，用户可以编辑角色描述以及图权限。
+
+![角色管理-编辑角色](../../../images/browser/role-edit.png)
+
+##### 2.5.1.1.3.禁用角色
+
+在`角色管理`界面点击`禁用`按钮禁止对应的角色，点击`启用`按钮开启对应的角色。禁用角色后，对应角色图访问权限失效。
+
+- 禁用角色：禁用之后，对应角色图访问权限失效。
+    - 当一个用户拥有两个角色对同一个图有操作权限时，当禁用其中一个角色时，另一个角色权限同样有效。
+
+![角色管理-禁用](../../../images/browser/role-disable.png)
+![角色管理-启用](../../../images/browser/role-enable.png)
+
+##### 2.5.1.1.4.删除角色
+
+在`角色管理`界面点击`删除`按钮删除对应的角色。
+
+![角色管理-删除](../../../images/browser/role-delete.png)
+
+#### 2.5.2.数据库信息
+
+##### 2.5.2.1.基础信息
+
+`基础信息`获取当前系统运行的状态，并展示关键信息。
+
+![数据库信息-基础信息](../../../images/browser/db_basic.png)
+
+|参数    |含义    |
+|-------|--------|
+|TuGraph版本号|当前TuGraph的版本号，x.x.x|
+|运行时间|TuGraph服务启动到现在的时间|
+|服务器代码版本|tugraph-db仓库的当前commit|
+|前端代码版本|tugraph-web仓库的当前commit|
+|CPP编译器版本号|编译TuGraph时的CPP版本号|
+|Python版本号|编译TuGraph时的Python版本号|
+|CPP编译器ID|编译TuGraph时的CPP类型|
+
+也可以通过命令获取当前系统运行状态。
+
+```
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.数据库配置信息
+
+`数据库配置信息`获取当前系统运行的配置参数，并展示关键信息。调整配置参数或了解详细配置参数请参考[数据库运行-服务配置](../5.developer-manual/2.running/2.tugraph-running.md)。
+
+![数据库信息-数据库配置信息](../../../images/browser/db_configuration.png)
+
+| 参数                          | 含义                                  |
+|-----------------------------|-------------------------------------|
+| bind_host                   | 系统启动时设置的host，一般为0.0.0.0             |
+| disable_auth                | 是否关闭token认证的定期更新，如为true则token可以永久使用 |
+| durable                     | 是否开启存储底层持久化，如为false，数据异步更新到磁盘       |
+| enable_audit_log            | 是否开启审计日志                            |
+| enable_backup_log           | 是否开启实时增量备份                          |
+| enable_fulltext_index       | 是否开启全文索引                            |
+| enable_ip_check             | 是否开启IP白名单                           |
+| enable_rpc                  | 是否开启RPC端口                           |
+| enable_ssl                  | 是否开启ssl加密传输                         |
+| optimistic_txn              | 是否开启乐观多线程写入事务                       |
+| port                        | 当前系统的REST访问端口                       |
+| rpc_port                    | RPC 及 HA 服务所用端口                     |
+| subprocess_max_idle_seconds | 自进程最大空闲时间，线程池参数                     |
+| thread_limit                | 服务端同时使用的最大线程数                       |
+| verbose                     | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。  |
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..2a422f569e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,167 @@
+# 可视化操作手册（旧版）
+
+> 此文档主要介绍 TuGraph Browser 的使用
+
+## 定义
+
+TuGraph Browser 是 TuGraph 提供的可视化开发工具。
+
+## 作用
+
+TuGraph Browser 的主要功能是为使用图数据库的开发人员，提供可视化的图数据开发，图数据管理和维护等功能。
+
+## 操作详情
+
+### 1.连接数据库
+
+当用户完成图数据库的安装后，可以通过浏览器进行访问，TuGraph Browser 工具。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7090。
+
+### 2.登录数据库
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- 页面打开成功会，首先进图的是登录页面，用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 3.工作台
+
+#### 3.1 快速上手
+
+- 首次登录，系统会默认创建 default 空图
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- 用户点击帮助选项，并选择快速上手
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- 然后点击“一键创建模型”——>"一键创建数据"，就可以完成内置的 Movie 数据图谱的构建
+
+#### 3.2 创建子图和示例
+
+##### 3.2.1 创建子图
+
+- 点击新建子图
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- 填写表单信息
+  ![alt 填写表单](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+  - 子图名称
+  - 子图描述
+  - 配置信息
+  - 点击确认，提示创建成功
+- 切换子图
+  ![alt 切换子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- 点击新建示例
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- 选择示例并点击创建
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 查询
+
+![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 页面组成
+
+- cypher 输入框
+- 结果集展示区域
+
+##### 3.3.2 结果集展示区域功能详情
+
+- 结果集标签展示及功能
+  ![alt 结果集标签](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+  - 这里展示了结果集的所有类型统计
+  - 点击不同的“label（标签）”，可以进行以下修改操作
+    - 修改展示颜色
+    - 修改节点大小或边的粗细
+    - 修改默认展示属性或系统属性
+    - 布局修改
+      - 力导布局
+      - 网格布局
+      - 树形布局
+      - 环境布局
+    - 边聚合
+      - 相同类型，方向的边可以进行合并
+    - 创建节点
+      - 点击创建节点按钮
+      - 选择节点类型
+      - 添写节点内容
+    - 创建关系
+      - 在画布中选择起点和终点
+      - 选择可以匹配的类型
+      - 填写节点信息
+    - 停止布局
+      - 当数据量过大，导致浏览器页面卡顿时候，可以点击这个停止布局的按钮，能够提高体验的流畅度
+    - 鼠标悬停
+      - 开启此功能，可以高亮显示鼠标悬停节点的一度邻居节点
+    - 结果集导出
+      - 可以将结果集导出为 png，json，csv 三种不同的文件形式
+    - 刷新
+      - 点击刷新按钮，会重新执行当前页面的初始 cypher 语句，并刷新结果集
+    - 最大化
+      - 点击最大化，结果集展示区域将全屏展示
+    - 结果集展示形式切换
+      - 支持图谱、表格、文本三种形式
+
+##### 3.3.3 建模
+
+- 点边模型
+  ![alt 建模](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- 点边模型支持实时的、增、删、改、查
+
+- 点边模型支持导入和导出
+
+##### 3.3.4 数据导入
+
+- 本地数据导入
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+  - 选择文件编码格式
+  - 选择本地 CSV 文件
+  - 选择对应的节点或边的模型
+  - 进行数据映射
+  - 完成数据导入
+
+##### 3.3.5 插件
+
+- 存储过程的使用
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+  - 用户可以上传本地编写的 Plugin 程序，并在可视化页面进行执行，并查看执行结果
+  - 用户可以在可视化对插件进行、卸载、执行、下载等操作
+
+##### 3.3.6 帮助
+
+- 其中记录了 TuGraph-browser 的使用方式
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 控制台
+
+##### 3.4.1 数据库基础信息
+
+- 展示数据库相关的基础配置信息
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 权限管理
+
+- 用来创建用户和角色的功能模块，用户可以在这里进行权限的管理操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 实时状态
+
+- 这里展示了数据库实时状态，包括：CPU 使用率、内存用率、磁盘使用率、数据请求次数、磁盘 IO
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 任务管理
+
+- 在这里用户可以看到在正在执行中的任务，可以在此进行停止任务的操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 审计日志
+
+- 这里记录的数据库相关的审计日志，用来排查使用遇到的问题
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6da5aae0ac
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+操作指南
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/1.environment.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/1.environment.md
new file mode 100644
index 0000000000..e2524b4134
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/1.environment.md
@@ -0,0 +1,40 @@
+# 环境准备
+
+> 此文档主要介绍 TuGraph 部署时所需的软硬件环境。
+
+## 1.硬件环境
+
+### 1.1. CPU
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的硬件平台，测试认证过的硬件平台包括 Intel、AMD、Kunpeng、Hygon、飞腾等。
+
+### 1.2. 内存
+
+我们建议内存容量不小于实际的数据大小。如果最求极致的性能，把所有的数据缓存到内存里是最理想的。在数据访问的局部性上，图数据库的局部性要比关系型数据库差，因此如果数据在内存中放不下，通常会频繁地换入换出。
+
+### 1.3. 外存
+我们强烈建议用户使用 NVMe SSD 作为外存，数据库有大量的写操作需要同步的外存，通常为随机写，外存的读写性能很容易成为整体数据库运行的性能瓶颈。因此，高IOPS、低延迟的 NVMe SSD 是最优的选择。
+
+如果现实条件只能使用 SATA接口的SSD，或者云上的网盘，性能虽然会受到影响，但 TuGraph 依然能正确的运行。
+
+外存大小建议为实际数据大小的4倍，比如数据为1TB，则准备4TB的硬盘会比较稳妥。
+
+## 2.软件环境
+
+### 2.1. 操作系统
+
+TuGraph 能够兼容主流操作系统，包括Ubuntu、CentOS、SUSE、银河麒麟、 中标麒麟、UOS等，均通过测试认证。
+
+其中最稳定使用的系统版本是 Ubuntu 18.04、CentOS 7、CentOS 8。
+
+### 2.2. 系统库
+
+编译环境和运行环境对系统库的要求不一样，具体请参考[环境分类](2.environment-mode.md)。
+
+## 3.典型配置推荐
+
+| 硬件      | 最低配置   | 建议配置                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| 内存      | 4GB       | 512GB                    |
+| 外存      | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md
new file mode 100644
index 0000000000..9a4d4f85d7
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md
@@ -0,0 +1,19 @@
+# 环境分类
+
+> 此文档主要介绍 TuGraph 涉及的三种环境。
+
+## 1.分类
+
+根据环境所承载功能的不同，区分为编译环境，运行环境，以及精简运行环境。
+* 编译环境，具备TuGraph编译的所有依赖库，包含运行环境的所有依赖，并且能够编译TuGraph源码，但不包含预编译好的TuGraph可执行文件和库文件，供开发者编译源码使用。
+* 运行环境，具备GCC/Java/Python环境，能够运行TuGraph的所有功能，并且能承载全文索引，java client，c++源码上传为plugin，以及python plugin的完整功能，内置TuGraph预编译好的可执行文件和库文件，供客户直接安装使用，无需编译源码。
+* 精简运行环境，约等于裸系统加预编译TuGraph，仅能运行TuGraph的基本功能，无C++ plugin编译运行，仅so上传，无全文索引，无python plugin，供快速搭建试用。
+
+TuGraph编译后，会把所有的依赖库以.a的形式打包在一起，因此原则上运行不需要的其他的依赖库。但TuGraph支持存储过程，即在服务端编译C++代码，因此在环境中依然需要涉及的编译器。
+
+## 2.依赖系统库
+
+针对三种环境，除去TuGraph的运行包，所需要的系统库如下：
+* 编译环境，包括gcc、python、java等编译器，也包含antlr4、pybind11等，具体参见 tugraph-compile-*-Dockerfile。
+* 运行环境，主要由存储过程引入，包括gcc、boost、cmake等，具体参见 tugraph-runtime-*-Dockerfile。
+* 精简运行环境，无，可以参见 tugraph-mini-runtime-*-Dockerfile。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md
new file mode 100644
index 0000000000..8b270dff2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md
@@ -0,0 +1,82 @@
+# Docker部署
+
+>本文档介绍TuGraph Compile及TuGraph Runtime的Docker镜像的创建、下载。
+
+## 1.简介
+
+- TuGraph Compile Image：提供编译环境，可以用于TuGraph的编译，测试；
+- TuGraph Runtime Image：提供二进制可运行环境，附带TuGraph库和可执行文件；
+- TuGraph Mini Runtime Image: 提供二进制可运行环境，不包含TuGraph中Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+## 2.现有Docker Image
+
+### 2.1.镜像下载方式
+
+镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用。
+
+### 2.2.命名规范
+
+#### 2.2.1.TuGraph Compile Image
+
+提供编译环境，可以用于TuGraph的编译。
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+例如： `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+提供二进制可运行环境，附带TuGraph库和可执行文件。
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如：`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+提供二进制可运行环境，不包含TuGraph种Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如： `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+## 2.3.常见Docker操作
+
+Docker由Dockerfile生成，注意创建镜像需要下载依赖，因此网络问题可能会导致创建较慢或者创建失败。注意不要覆盖镜像，除非tag为 `latest`。
+
+创建Compile镜像
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+创建Runtime / Mini Runtine镜像
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+修改镜像名称
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+上传镜像
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+获取镜像
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+导出镜像
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+导入镜像
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+其他Docker操作请参考[docker官方文档](https://docs.docker.com/engine/reference/commandline/cli )
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md
new file mode 100644
index 0000000000..d66501bcec
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md
@@ -0,0 +1,31 @@
+# 本地包部署
+
+> 此文档主要介绍 TuGraph 的本地包部署。
+
+## 1.安装包下载
+
+请访问Github进行下载：[TuGraph Download](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 2.Ubuntu 下的安装方法
+
+用于在 Ubuntu 上安装的 TuGraph 的.deb 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.deb`安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+该命令默认将 TuGraph 安装于`/usr/local`目录下。用户也可以通过指定 `--instdir=<directory>` 选项更改安装目录。
+
+## 3.CentOS 下的安装方法
+
+用于在 CentOS 上安装的 TuGraph 的.rpm 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.rpm 安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+用户也可以通过指定`--prefix`选项指定安装目录。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md
new file mode 100644
index 0000000000..9d4184acdf
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md
@@ -0,0 +1,125 @@
+# 云部署
+
+> 此文档主要介绍 TuGraph 的云部署，也可参见[阿里云计算巢部署文档]( https://aliyun-computenest.github.io/quickstart-tugraph/ )。
+
+## 1.简介
+
+TuGraph（tugraph.antgroup.com）是蚂蚁集团研发的高性能图数据库（Graph Database）。TuGraph在计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。本文向您介绍如何开通计算巢上的TuGraph社区版服务，以及部署流程和使用说明。
+
+## 2.实例说明
+
+TuGraph部署的为社区开源版本，源码参考Github Repo，目前可以选择的实例规格如下：
+
+| 规格族         | vCPU与内存                 | 系统盘              | 公网带宽      |
+|----------------|-------------------------|-------------------|-----------|
+| ecs.r7a.xlarge | AMD 内存型 r7a，4vCPU 32GiB | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+| ecs.r6.xlarge  | 内存型r6，4vCPU 32GiB       | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+
+预估费用在创建实例时可实时看到（目前为免费）。 如需更多规格、其他服务（如集群高可用性要求、企业级支持服务等），请联系我们 tugraph@service.alipay.com。
+
+## 3.部署流程
+
+### 3.1.准备工作
+
+在正式开始使用前，您需要一个阿里云账号，对ECS、VPC等资源进行访问和创建操作。
+
+- 若您使用个人账号，可以直接创建服务实例
+- 若您使用RAM用户创建服务实例，且是第一次使用阿里云计算巢
+    - 需要在创建服务实例前，对使用的RAM用户的账号添加相应资源的权限。添加RAM权限的详细操作，请参见为 __RAM用户授权__。所需权限如下表所示。
+    - 且需要授权创建关联角色，参考下图，选中 __同意授权并创建关联角色__
+
+| 权限策略名称                    | 备注                                    |
+|---------------------------------|---------------------------------------|
+| AliyunECSFullAccess             | 管理云服务器服务（ECS）的权限             |
+| AliyunVPCFullAccess             | 管理专有网络（VPC）的权限                 |
+| AliyunROSFullAccess             | 管理资源编排服务（ROS）的权限             |
+| AliyunComputeNestUserFullAccess | 管理计算巢服务（ComputeNest）的用户侧权限 |
+| AliyunCloudMonitorFullAccess    | 管理云监控（CloudMonitor）的权限          |
+
+![同意授权并创建关联角色](../../../../images/cloud-deployment-1.png)
+
+### 3.2.部署入口
+
+您可以在阿里云计算巢自行搜索，也可以通过下述部署链接快速到达。
+
+[部署链接](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.申请试用
+
+在正式试用前，需要申请试用，按照提示填写信息，在审核通过后就可以创建TuGraph服务。
+
+![申请试用](../../../../images/cloud-deployment-2.png)
+
+### 3.4.创建TuGraph服务
+
+#### 3.4.1.参数列表
+
+您在创建服务实例的过程中，需要配置服务实例信息的参数列表，具体如下。
+
+| 参数组               | 参数项   | 示例          | 说明                                                           |
+|--------------------|----------|---------------|--------------------------------------------------------------|
+| 服务实例名称         | N/A      | test          | 实例的名称                                                     |
+| 地域                 | N/A      | 华东1（杭州）   | 选中服务实例的地域，建议就近选中，以获取更好的网络延时。          |
+| 付费类型配置         | 付费类型 | 按量付费      | 免费使用请选用按量付费                                         |
+| 可用区配置           | 部署区域 | 可用区I       | 地域下的不同可用区域，确保实例非空                              |
+| 选择已有基础资源配置 | VPC ID   | vpc-xxx       | 按实际情况，选择专有网络的ID。                                   |
+| 选择已有基础资源配置 | 交换机ID | vsw-xxx       | 按实际情况，选择交换机ID。若找不到交换机, 可尝试切换地域和可用区 |
+| ECS实例配置          | 实例类型 | ecs.r6.xlarge | 当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格                      |
+|ECS实例配置|	实例密码|	**|	设置实例密码。长度8~30个字符，必须包含三项（大写字母、小写字母、数字、 ()`~!@#$%^&*_-+={}[]:;'<>,.?/ 中的特殊符号）。|
+
+#### 3.4.2.具体步骤
+
+创建服务按如下步骤进行，参考下图：
+
+- 创建实例名称，如下图中“test”
+- 选择地域，如下图中“华东1（杭州）”
+
+![创建实例](../../../../images/cloud-deployment-3.png)
+
+- 选择实例类型，当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格。如果列表中无机型可选，请尝试选择其他的部署区域
+- 选中机型
+- 配置实例的密码
+- 选择部署区域，如下图中“可用区I”
+
+![选择区域](../../../../images/cloud-deployment-4.png)
+
+- 点击下一步，进入订单确认页面
+- 勾选“权限确认”和“服务条款”中的复选框
+- 点击左下角绿色背景的开始免费试用，即可创建服务实例
+
+![确认](../../../../images/cloud-deployment-5.png)
+
+### 3.5.启动TuGraph服务
+
+- 查看服务实例：服务实例创建成功后，部署时间大约需要2分钟。部署完成后，页面上可以看到对应的服务实例，如下图
+
+![查看实例](../../../../images/cloud-deployment-6.png)
+
+- 点击该服务实例访问TuGraph。进入到对应的服务实例后，可以在页面上获取到web、rpc、ssh共3种使用方式，并且页面上展示了admin用户的密码
+
+![访问方式](../../../../images/cloud-deployment-7.png)
+
+- 点击web的链接，即可跳转访问已经部署好的TuGraph Web。建议新手先通过TuGraph Web，快速使用demo上手。
+    - 首先在TuGraph Web的登录页面上，输入默认用户名admin和页面上展示的admin用户的密码进行登录，参考下图
+    - 登录完成后，选择任意一个带有官方图标的图项目，其中内置了demo数据，开启图数据的探索和发现！
+
+![登录](../../../../images/cloud-deployment-8.png)
+![创建demo](../../../../images/cloud-deployment-9.png)
+
+## 4.常见FAQ
+
+### 问题一：部署区域无可用资源
+
+有时，所选部署区域（如可用区G）没有所选套餐的可用资源，会报错如下图所示
+
+![部署区域错误](../../../../images/cloud-deployment-10.png)
+
+__解决办法__：尝试选择其他区域，如可用区I等
+
+### 问题二: 启动后web访问不通
+
+web的启动需要一点点时间，请稍后刷新页面即可。
+
+### 问题三: 登录时的用户名密码不正确
+
+请注意检查，登录时使用的密码应为详情页面展示的密码。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/index.rst
new file mode 100644
index 0000000000..16187666e3
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/1.installation/index.rst
@@ -0,0 +1,8 @@
+安装
+====
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/1.compile.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/1.compile.md
new file mode 100644
index 0000000000..f8d60b38d3
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/1.compile.md
@@ -0,0 +1,16 @@
+# 从源码编译
+
+> 本文档主要描述 TuGraph 从源码进行编译。
+
+## 1.前置条件
+
+推荐在linux系统下搭建TuGraph。同时docker环境是个不错的选择,如果你想设置一个新的环境，请参考[Dockerfile](../1.installation/3.docker-deployment.md)。
+
+## 2.编译介绍
+
+以下是编译TuGraph的步骤：
+1. `deps/build_deps.sh` or `SKIP_WEB=1 deps/build_deps.sh` to skip building web interface
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If support shell lgraph_cypher, use `-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+4. `make`
+5. `make package` or `cpack --config CPackConfig.cmake`
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md
new file mode 100644
index 0000000000..ae587748b1
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md
@@ -0,0 +1,183 @@
+# 数据库运行
+
+> 本文档主要描述 TuGraph 服务的运行模式、启动、停止和重启的操作,以及 TuGraph 的服务配置参数、配置文件格式和命令行配置参数。
+
+## 1.前置条件
+
+TuGraph 运行的前置条件为 TuGraph 正确安装，参考[安装流程](../1.installation/1.environment.md)。
+
+TuGraph 运行需要保证库文件 liblgraph.so 的文件位置在环境变量 LD_LIBRARY_PATH。
+
+运行 TuGraph 进程的用户不需要超级权限，但需要对配置文件（一般为lgraph.json）及文件中涉及的文件有读权限，并且对数据文件夹、日志文件夹等有写权限。
+
+## 2.运行模式
+
+TuGraph 可以作为前台普通进程启动，也可以作为后台守护进程启动。
+当作为普通进程运行时，TuGraph 可以直接将日志打印到终端，这在调试服务器配置时非常方便。但是，由于前台进程在终端退出后被终止，因此用户须确保在 TuGraph 服务器处于运行状态时，终端保持打开状态。另一方面，在守护进程模式下，即使启动它的终端退出，TuGraph 服务器也可以继续运行。因此，在长时间运行的服务器下推荐以守护进程模式启动 TuGraph 服务器。
+
+### 2.1.运行普通进程
+
+`lgraph_server -d run`命令可以将 TuGraph 作为普通进程运行。普通进程依赖命令行终端，因此终端结束时，TuGraph 进程也会自动终止。普通进程模式配合`--log_dir ""`可以将进程日志直接输出到终端，因此更方便调试。
+
+启动命令：
+
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+普通模式的运行输出示例：
+
+```shell
+20200508120723.039: **********************************************************************
+20200508120723.039: *                  TuGraph Graph Database v3.4.0                     *
+20200508120723.040: *                                                                    *
+20200508120723.041: *        Copyright(C) 2023 Ant Group. All rights reserved.           *
+20200508120723.041: *                                                                    *
+20200508120723.044: *             Licensed host: hostname      threads:0, ha:0           *
+20200508120723.044: **********************************************************************
+20200508120723.044: Server is configured with the following parameters:
+20200508120723.045:   data directory:    ./lgraph_db
+20200508120723.046:   enable ha:          0
+20200508120723.046:   async:              0
+20200508120723.047:   host:               127.0.0.1
+20200508120723.047:   REST port:          7071
+20200508120723.048:   RPC port:           9091
+20200508120723.048:   enable rpc:         0
+20200508120723.051:   optimistic txn:     0
+20200508120723.059:   verbose:            1
+20200508120723.074:   log_dir:
+20200508120723.074:   ssl_auth:           0
+20200508120723.075:   resource dir:       ./resource
+
+20200508120723.077: Loading DB state from disk
+20200508120723.110: [RestServer] Listening for REST on port 7090
+20200508120723.110: [LGraphService] Server started.
+```
+
+普通进程模式下，用户可以通过按 `CTRL+C` 来提前终止 TuGraph 进程。
+
+### 2.2.运行进程守护模式
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+守护模式的运行输出示例：
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+## 3.服务操作
+
+### 3.1.启动服务
+
+TuGraph 需要通过 `lgraph_server -d start` 命令行启动，启动命令示例如下：
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+### 3.2.停止服务
+
+用户可以使用`kill`命令以及`lgraph_server -d stop`命令停止 TuGraph 守护进程。由于可能在同一台计算机上运行多个 TuGraph 服务器进程，因此我们使用`.pid`文件区分不同的服务器进程，该文件写入启动该进程的工作目录。因此，需要在相同工作目录中运行`lgraph_server-d stop`命令，以停止正确的服务器进程。
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.重启服务
+
+用户也可以通过`lgraph_server -d restart`来重启 TuGraph 服务：
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.服务配置
+
+TuGraph 服务器在启动时从配置文件和命令行选项加载配置，如果在配置文件和命令行中同一选项指定了不同的值，将优先使用命令行中指定的值。
+
+### 4.1.配置参数
+
+具体参数及其类型描述如下：
+
+| **参数名**                    | **<nobr>参数类型</nobr>** | **参数说明**                                                                                               |
+| ----------------------------- | ------------------------- | ---------------------------------------------------------------------------------------------------------- |
+| directory                     | 字符串                    | 数据文件所在目录。如果目录不存在 ，则自动创建。默认目录为 /var/lib/lgraph/data。                           |
+| async                         | 布尔值                    | 是否使用异步模式。异步模式可以减少磁盘 IO 开销，但是在机器断电等极端情况下可能丢失数据。默认值为 false。   |
+| host                          | 字符串                    | REST 服务器监听时使用的地址，一般为服务器的 IP 地址。默认地址为 0.0.0.0。                                  |
+| port                          | 整型                      | REST 服务器监听时使用的端口。默认端口为 7070。                                                             |
+| enable_rpc                    | 布尔值                    | 是否使用 RPC 服务。默认值为 0。                                                                            |
+| rpc_port                      | 整型                      | RPC 及 HA 服务所用端口。默认端口为 9090。                                                                  |
+| enable_ha                     | 布尔值                    | 是否启动高可用模式。默认值为 false。                                                                       |
+| ha_log_dir                    | 字符串                    | HA 日志所在目录，需要启动 HA 模式。默认值为空。                                                            |
+| master                        | 字符串                    | 根据 host1:port1,host2:port2 初始化节点。默认值为空。                                                      |
+| verbose                       | 整型                      | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。默认值为 1。                               |
+| log_dir                       | 字符串                    | 日志文件所在的目录。默认目录为 /var/log/lgraph/。                                                          |
+| ssl_auth                      | 布尔值                    | 是否使用 SSL 安全认证。当开启时，REST 服务器只开启 HTTPS 服务。默认值为 false。                            |
+| web                           | 字符串                    | web 文件（包含可视化部分）所在目录。默认目录为 /usr/local/share/lgraph/resource。                          |
+| server_cert                   | 字符串                    | 在 SSL 认证开启时，服务器所使用的 certificate 文件路径。默认路径为 /usr/local/etc/lgraph/server-cert.pem。 |
+| server_key                    | 字符串                    | 在 SSL 认证开启时，服务器所使用的公钥文件。默认目录为 /usr/local/etc/lgraph/server-key.pem。               |
+| enable_audit_log              | 布尔值                    | 是否启用审计日志，默认值为 false。                                                                         |
+| audit_log_expire              | 整型                      | 启用审计日志时，日志的有效时间（小时），超时自动清理，值为 0 时表示不清理。默认值为 0。                    |
+| audit_log_dir                 | 字符串                    | 启用审计日志时，日志文件的存放目录。默认目录为 $directory/_audit_log_。                                    |
+| load_plugins                  | 布尔值                    | 启动服务时导入所有存储过程。默认值为 1。                                                                   |
+| optimistic_txn                | 布尔值                    | 为 Cypher 开启乐观多线程写入事务。默认为 0。                                                               |
+| disable_auth                  | 布尔值                    | 关闭 REST 验证。默认为 0。                                                                                 |
+| snapshot_interval             | 整型                      | 快照间隔（以秒为单位）。 默认值为 86400。                                                                  |
+| heartbeat_interval_ms         | 整型                      | 心跳间隔（以毫秒为单位）。 默认值为 1000。                                                                 |
+| heartbeat_failure_duration_ms | 整型                      | 心跳超时且节点下线间隔（以毫秒为单位）。默认为 60000。                                                     |
+| node_dead_duration_ms         | 整型                      | 节点被视为完全死亡并从列表中删除的间隔（以毫秒为单位）。默认值为 120000。                                  |
+| enable_ip_check               | 布尔值                    | 允许 IP 白名单，默认值为 0。                                                                               |
+| idle_seconds                  | 整型                      | 子进程可以处于空闲状态的最大秒数。 默认值为 600。                                                          |
+| enable_backup_log             | 布尔值                    | 是否启用备份日志记录。 默认值为 0。                                                                        |
+| backup_log_dir                | 字符串                    | 存储备份文件的目录。 默认值为空。                                                                          |
+| snapshot_dir                  | 字符串                    | 存储快照文件的目录。 默认值为空。                                                                          |
+| thread_limit                  | 整型                      | 同时使用的最大线程数。 默认值为 0，即不做限制，以 license 为准。                                           |
+| unlimited_token               | 布尔值                    | 是否将链接token设置为无期限。 默认值为 0，有效期为24小时。 |
+| help                          | 布尔值                    | 打印此帮助消息。 默认值为 0。                                                                              |
+
+### 4.2.服务器配置文件
+
+TuGraph 的配置文件以 JSON 格式存储。建议将大多数配置存储在配置文件中，并且仅在需要时使用命令行选项临时修改某些配置参数。
+一个典型的配置文件如下：
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md
new file mode 100644
index 0000000000..8d26981618
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md
@@ -0,0 +1,109 @@
+# 部署高可用模式
+
+> 此文档主要介绍了高可用模式的原理、准备工作、以及服务器的操作说明
+
+## 1.原理
+
+TuGraph 通过多机热备份来提供高可用模式（HA 模式）。在高可用模式下，对数据库的写操作会被同步到所有服务器上，这样即使有部分服务器宕机也不会影响服务的可用性。
+
+在高可用模式下，多个 TuGraph 服务器组成一个备份组。每个备份组由三个或更多 TuGraph 服务器组成，其中某台服务器会作为`leader`，而其他复制组服务器则作为`follower`。写入请求由`leader`
+提供服务，该`leader`将每个请求复制同步到`follower`，并在请求同步到服务器后才能响应客户端。这样，如果任何服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选择出新的`leader`。
+
+高可用模式仅企业版可用，开源社区版不含此功能。
+
+## 2.准备工作
+
+要启用高可用模式，用户需要：
+
+- 三台及以上的 TuGraph 服务器实例。
+
+- 获得一个具有高可用的 license 文件，具体请洽我们的经销商。
+
+- 在启动 lgraph_server 时打开高可用模式，可以使用配置文件或者命令行将`enable_ha`选项设置为`true`。
+
+- 设置正确的`rpc_port`，可通过配置文件或者命令行设置。
+
+## 3.启动初始备份组
+
+### 3.1.初始数据一致
+
+当启动时所有服务器中的数据相同或没有数据时，用户可以通过
+指定`--conf host1:port1,host2:port2`启动服务器。
+这种方式可以将准备好的所有TuGraph实例一次性加入初始备份组，
+由备份组中的所有服务器根据raft协议选举出`leader`，并将其他
+服务器以`follower`的角色加入备份组。
+
+启动初始备份组的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+### 3.2.初始数据不一致
+
+如果第一台服务器中已有数据（以`lgraph_import`工具导入或从非高可用模式的服务器传输得到），
+并且之前并未在高可用模式下使用，则用户应使用`enable_bootstrap`参数
+在引导模式下启动服务器。在引导模式下，服务器在将新加入的服务器添加到备份组之前会将自己的
+数据复制到新服务器中，以使每个服务器中的数据保持一致。
+
+启动有数据服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --enable_bootstrap true
+```
+
+其他无数据的服务器不需要指定`enable_bootstrap`参数，只需通过`conf`参数指定`leader`即可，命令示例如下所示
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+
+## 4.横向扩展其他服务器
+
+启动初始备份组后，如果想对备份组进行横向扩展，要将新服务器添加到备份组，
+应使用`--conf HOST：PORT`选项，其中`HOST`可以是该备份组中已有的任何服务器的 IP 地址，
+而`PORT`是其 RPC 端口。例如：
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+
+此命令将启动一台高可用模式的 TuGraph 服务器，并尝试将其添加到包含服务器`172.22.224.15:9090`的备份组中。
+请注意，加入备份组需要服务器将其数据与备份组的`leader`服务器同步，此过程可能需要相当长的时间，具体取决于数据的大小。
+
+## 5.停止服务器
+
+当服务器通过`CTRL-C`下线时，它将通知当前的`leader`服务器，告知其从备份组中删除该下线的服务器。如果`leader`服务器下线，
+它将在下线前将`leader`身份权限传给另一台服务器。
+
+如果服务器被终止或者与备份组中的其他服务器失去连接，则该服务器将被视为失败节点，`leader`服务器将在特定时限后将其从备份组中删除。
+
+如果任何服务器离开备份组并希望重新加入，则必须从`--conf HOST:PORT`选项开始，其中`HOST`是当前备份组中的某台服务器的 IP 地址。
+
+## 6.重启服务器
+
+不建议重新启动整个备份组，因为它会中断服务。如果需要，可以关闭所有服务器。但在重新启动时，
+必须保证关闭时的备份组中至少有N/2+1的服务器能正常启动，否则启动失败。 并且，
+无论初始启动复制组时是否指定`enable_bootstrap`为true，重启服务器时都只需通过
+指定`--conf host1:port1,host2:port2`参数一次性重启所有服务器即可，命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 7.查看服务器状态
+
+备份组的当前状态可以在 TuGraph 可视化工具、REST API 以及 Cypher 查询中获取。
+
+在 TuGraph 可视化工具中，可以在 DBInfo 部分中找到备份组中的服务器及其角色列表。
+
+使用 REST API 时，可以使用`GET /info/peers` 请求获取信息。
+
+在 Cypher 中，使用`CALL dbms.listServers()`语句来查询当前备份组的状态信息。
+
+## 8.高可用模式下数据同步问题
+
+在高可用模式下，同一备份组中的不同服务器可能并不总是处于相同的状态。出于性能原因，如果请求已同步到超过一半的服务器，则`leader`服务器将认为该请求属于`committed`状态。尽管其余服务器最终将收到新请求，但服务器的状态不一致将持续一段时间。客户端也可能向刚刚重新启动的服务器发送请求，从而具有较旧的状态。
+
+为了确保客户端看到一致连续的数据，特别是为了摆脱`反向时间旅行`问题（其中客户端读取比以前看到的状态更旧的状态），每个 TuGraph 服务器都会保持一个单调增加的数据版本号。备份组中数据版本号到数据库状态的映射全局一致，这意味着如果两台服务器具有相同的数据版本号，则它们必须具有相同的数据。响应请求时，服务器在响应中包含了其数据版本号。因此，客户端可以知道它看到了哪个版本。客户端收到旧版本的数据之后可以重新向Master发送请求，从而获取到最新的数据。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/index.rst
new file mode 100644
index 0000000000..a653bf13ab
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/2.running/index.rst
@@ -0,0 +1,8 @@
+运行
+====
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md
new file mode 100644
index 0000000000..fc8337c9c7
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md
@@ -0,0 +1,364 @@
+# 数据导入
+
+> 此文档主要介绍 TuGraph 的数据导入功能。其中包括 CSV 格式的分隔符，jsonline 的格式示例，以及导入在线和离线的两种模式。
+
+## 1.简介
+
+在图数据库服务安装成功后，您可以使用`lgraph_import`批量导入工具将现有数据导入 TuGraph。`lgraph_import`支持从 CSV 文件和 JSON 数据源导入数据。
+
+> CSV 格式
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline 格式
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph 支持两种导入模式：
+
+- _离线模式_：读取数据并将其导入指定服务器的数据文件，应仅在服务器离线时完成。
+- _在线模式_：读取数据并将其发送到工作中的服务器，然后将数据导入其数据库。
+
+## 2.CSV文件格式分隔符
+
+    CSV格式的分隔符可以是单字符或多字符组成的字符串，其中不能包含`\r`或`\n`。注意不同的shell会对输入字符串做不同的处理，因此针对不同的shell输入参数可能需要不同的转义处理。
+
+此外，`lgraph_import`还支持以下转义字符，以便输入特殊符号：
+
+| 转义符 | 说明                                                             |
+| ------ | ---------------------------------------------------------------- |
+| \\     | 反斜杠`\\`                                                       |
+| \\a    | 响铃，即 ASCII 码 0x07                                           |
+| \\f    | form-feed，即 ASCII 码 0x0c                                      |
+| \\t    | 水平制表符，即 ASCII 码 0x09                                     |
+| \\v    | 垂直制表符，即 ASCII 码 0x0b                                     |
+| \\xnn  | 两位十六进制数，表示一个字节，如\\x9A                            |
+| \\nnn  | 三位八进制数，表示一个字节，如\\001, \\443，数值范围不能超过 255 |
+
+例：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.配置文件
+
+`lgraph_import`工具通过指定的配置文件进行环境配置。配置文件描述输入文件的路径、它们所代表的点/边以及点/边的格式。
+
+### 3.1.配置文件格式
+
+配置文件包含两部分：schema 和 files。`schema`部分定义 label，`files`部分描述要导入的数据文件。
+
+#### 3.1.1.关键字
+
+- schema (数组形式）
+  - label（必选，字符串形式）
+  - type（必选，值只能是 VERTEX 或者 EDGE）
+  - properties（数组形式，对于点必选，对于边如果没有属性可以不配置）
+    - name（必选，字符串形式）
+    - type （必选，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（可选，代表该字段可以配置，也可以不配置）
+    - index（可选，该字段是否需要建索引）
+    - unique（可选，该字段是否建索引，并且是 unique 类型的）
+  - primary (仅点配置，必选，主键字段，需指定一个 property，用来唯一确定一个点)
+  - constraints (仅边配置，可选，数组形式，起点和终点的 label，不配置或者为空代表不限制)
+  - detach_property (点边都可配置，可选，默认是`false`。`true` 代表属性数据单独存放，在内存不够，属性数据比较多的场景下可以减少io读放大)
+- files （数组形式）
+  - path（必选，字符串，可以是文件路径或者目录的路径，如果是目录会导入此目录下的所有文件，需要保证有相同的 schema）
+  - header（可选，数字，头信息占文件起始的几行，没有就是 0）
+  - format（必须选，只能是 JSON 或者 CSV）
+  - label（必选，字符串）
+  - columns（数组形式）
+    - SRC_ID (特殊字符串，仅边有，代表这列是起始点数据)
+    - DST_ID (特殊字符串，仅边有，代表这列是目的点数据)
+    - SKIP   (特殊字符串，代表跳过这列数据)
+    - [property]
+  - SRC_ID (仅边配置，值是起始点标签)
+  - DST_ID (仅边配置，值是目的点标签)
+
+### 3.2.配置文件示例
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+对于上述配置文件，定义了三个 label：两个点类型`actor`和`movie`，一个边类型`role`。每个 label 都描述了：label 的名字、类型（点还是边）、属性字段有哪些以及每个字段的类型。对于点，另外定义了 primary 字段是哪个；对于边，另外定义了 constraints 字段，用来限制边的起点和终点只能是哪些组合。
+
+还描述了三个数据文件，两个点的数据文件`actors.csv`和`movies.csv`，一个边的数据文件`roles.csv`。每个部分都描述了：文件的路径（path）、数据类型（format）、信息头占开头几行（header）、是哪个 label 的数据（label）、文件中每行数据中的每个列对应的字段是哪个。
+
+对于上述配置文件，import 工具在执行的过程中会先在 TuGraph 中创建`actor`、`movie`、`role`这三个 label，然后再执行三个文件的数据导入。
+
+## 4.离线全量导入
+
+离线模式只能在离线状态的服务器使用。离线导入会创建一张新图，因此更适合新安装的 TuGraph 服务器上的第一次数据导入。
+要在离线模式下使用`lgraph_import`工具，可以指定`lgraph_import --online false`选项。要了解可用的命令行选项，请使用`lgraph_import --online false --help`：
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+命令行参数：
+
+- **-c, --config_file** `config_file`: 导入配置文件名，其格式要求见下述。
+- **--log** `log_dir`: 日志目录。默认为空字符串，此时将日志信息输出到控制台。
+- **--verbose** `0/1/2`: 日志等级，等级越高输出信息越详细。默认为 1。
+- **-i, --continue_on_error** `true/false`: 在碰到错误时跳过错误并继续，默认为 false，碰到错误立即退出。
+- **-d, --dir** `{diretory}`: 数据库目录，导入工具会将数据写到这个目录。默认为`./db`。
+- **--delimiter** `{delimiter}`: 数据文件分隔符。只在数据源是 CSV 格式时使用，默认为`","`。
+- **-u, --username** `{user}`: 数据库用户名。需要是管理员用户才能执行离线导入。
+- **-p, --password** `{password}`: 指定的数据库用户的密码
+- **--overwrite** `true/false`: 是否覆盖数据。设为 true 时，如果数据目录已经存在，则覆盖数据。默认为`false`。
+- **-g, --graph** `{graph_name}`: 指定需要导入的图种类。
+- **-h, --help**: 输出帮助信息。
+
+### 4.1.离线导入示例
+
+在这个例子中，我们使用上面描述的电影-演员数据来演示导入工具的使用方法。待导入数据分为三个文件：`movies.csv`，`actors.csv`，`roles.csv`。
+
+`movies.csv`包含的是电影的信息，其中每部电影有一个 id（作为检索的 primary key），此外每部电影还拥有 title、year 和 rating 等属性。（数据来自[IMDb](http://www.imdb.com)）。
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+对应的 jsonline 格式如下:
+也可以所有字段都是字符串形式，导入的时候会转换成对应的类型
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`包含的是演员的信息。每个演员也拥有一个 id，以及 name 等属性。
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> 对应的 jsonline 格式如下:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`则包含了演员在哪个电影中扮演了哪个角色的信息。其中每一行记录的是指定演员在指定电影里饰演的角色，对应数据库中的一条边。`SRC_ID` 和 `DST_ID` 分别是边的源点和目标点，他们分别是`actors.csv`和`movies.csv`中定义的`primary`属性。
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+对应的 jsonline 格式如下:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+`配置文件import.conf`，注意每个文件中有两个标题行，因此我们需要指定`HEADER=2`选项。
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+使用导入配置文件，我们现在可以使用以下命令导入数据：
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # 从import.conf读取配置信息
+        --dir /data/lgraph_db      # 将数据存放在/data/lgraph_db
+        --graph mygraph            # 导入名为 mygraph 的图
+```
+
+**注意**：
+
+- 如果名为`mygraph`的图已存在，导入工具将打印错误消息并退出。要强制覆盖图形，可以使用`--overwrite true` 选项。
+- 配置文件和数据文件必须使用 UTF-8 编码（或普通 ASCII 编码，即 UTF-8 的子集）存储。如果任何文件使用 UTF-8 以外的编码（例如，带有 BOM 或 GBK 的 UTF-8）编码，则导入将失败，并输出分析器错误。
+
+## 5.在线增量导入
+
+在线导入模式可用于将一批文件导入已在运行中的 TuGraph 实例中。这对于处理通常以固定的时间间隔进行的增量批处理更新非常便利。`lgraph_import --online true`选项使导入工具能够在线模式工作。与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据发送到正在运行的 TuGraph 实例中，该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+
+如果用户和密码有效，并且指定的图存在，导入工具将将数据发送到服务器，服务器随后解析数据并将其写入指定的图。数据将以大约 16MB 大小的包发送，在最近的换行符处中断。每个包都是以原子方式导入的，这意味着如果成功导入包，则成功导入所有数据，否则，任何数据都不会进入数据库。如果指定了`--continue_on_error true`，则忽略数据完整性错误，并忽略违规行。否则，导入将在第一个错误包处停止，并打印出已导入的包数。在这种情况下，用户可以修改数据以消除错误，然后使用`--skip_packages N`重做导入以跳过已导入的包。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md
new file mode 100644
index 0000000000..5544169de0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# 数据导出
+
+> 此文档主要介绍 TuGraph 的数据导出功能。
+
+## 1.简介
+
+TuGraph 可以通过 `lgraph_export` 工具来对已经存放在TuGraph的图数据进行数据导出。 `lgraph_export` 工具可以将指定 TuGraph 数据库的数据以 `csv` 或者 `json` 文件形式导出到指定目录，同时导出这些数据进行再导入时需要的配置文件 `import.config` ，详细描述可参见[配置文件](1.data-import.md)。
+
+## 2.导出命令
+
+该工具的命令示例如下：
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+其中：
+
+- `-d {database_dir}` 指定需要进行数据导出的数据库所在目录，默认值为 `./testdb`。
+- `-e {export_destination_dir}` 指定导出文件存放的目录，默认值为 `./exportdir`。
+- `-g {graph_to_use}` 指定图数据库的种类，默认为 `default` 。
+- `-u {username}` 指定进行该导出操作的用户的用户名。
+- `-p {password}` 指定进行该导出操作的用户的用户密码。
+- `-s {field_separator}` 指定导出文件的分隔符，默认为逗号。
+- `-f {output_format}` 指定导出数据的格式，`json`或者`csv`，默认为`csv`。
+- `-h` 除上述指定参数外，也可以使用该参数查看该工具的使用帮助。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..ce113ad0a4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
@@ -0,0 +1,35 @@
+# 备份恢复
+
+> 此文档主要介绍 TuGraph 的数据备份和恢复功能。
+
+## 1.数据备份
+
+TuGraph 可以通过 `lgraph_backup` 工具来进行数据备份。
+`lgraph_backup` 工具可以将一个 TuGraph 数据库中的数据备份到另一个目录下，它的用法如下：
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+其中：
+
+- `-s {source_dir}` 指定需要备份的数据库（源数据库）所在目录。
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
+  如果目标数据库不为空，`lgraph_backup` 会提示是否覆盖该数据库。
+- `-c {true/false}` 指明是否在备份过程中进行 compaction。
+  compaction 能使产生的备份文件更紧凑，但备份时间也会变长。该选项默认为 `true`。
+
+## 2.数据恢复
+
+使用`lgraph_backup` 工具得到的目标数据库`{destination_dir}`备份了源数据库
+`{source_dir}`的所有子图，但不包含HA集群的raft信息，从而保证服务和集群能
+以备份数据库成功重启并与源数据库的数据一致。使用如下命令可以用备份数据库重启服务，
+在服务启动时会恢复所有子图的存储过程，保证备份服务和原服务完全一致。
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+其中：
+
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md
new file mode 100644
index 0000000000..c0c5afb7eb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# 数据预热
+
+> 此文档主要介绍 TuGraph 的数据预热功能。
+
+## 1.简介
+
+TuGraph 是基于磁盘的数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+## 1.数据预热命令
+
+数据预热可以通过工具 `lgraph_warmup` 来进行。它的使用示例如下：
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+其中：
+
+- `-d {db_dir}` 选项指定了 TuGraph 服务器的数据目录
+
+- `-g {graph_list}` 选项指定需要进行数据预热的图名称，用逗号分隔
+
+根据数据大小和所使用的磁盘类型不同，预热过程运行时间也不同。机械磁盘上预热一个大数据库可能耗时较长，请耐心等待。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/index.rst
new file mode 100644
index 0000000000..3b01353109
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/3.server-tools/index.rst
@@ -0,0 +1,8 @@
+服务端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md
new file mode 100644
index 0000000000..0e8d08926d
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md
@@ -0,0 +1,38 @@
+# Python客户端
+
+> 此文档主要是TuGraph Python SDK的使用说明。
+
+## 1.使用示例
+
+### 1.1.调用Cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = await aclient.call_cypher(cypher)
+print(res)
+```
+
+### 1.2.调用存储过程
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+res = await aclient.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..01a17612c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md
@@ -0,0 +1,162 @@
+# C++客户端
+
+> 此文档主要是TuGraph C++ SDK的使用说明。
+
+## 1.概述
+C++ Client 能够使用 RPC 连接lgraph_server，进行数据导入、执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+``` C++
+RpcClient client3("0.0.0.0:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+
+### 2.2.调用cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+        const std::string& graph = "default",
+        bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+### 2.3.调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallPlugin(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallPlugin(std::string& result, const std::string& plugin_type,
+        const std::string& plugin_name, const std::string& param,
+        double plugin_time_out = 0.0, bool in_process = false,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param plugin_type: the plugin type, currently supported CPP and PY
+    @param plugin_name: plugin name
+    @param param: the execution parameters
+    @param plugin_timeout: Maximum execution time, overruns will be interrupted
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+### 2.4.加载存储过程
+```C++
+    std::string str;
+    bool ret = client.LoadPlugin(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin",
+```
+```
+    bool LoadPlugin(std::string& result, const std::string& source_file,
+        const std::string& plugin_type, const std::string& plugin_name,
+        const std::string& code_type, const std::string& plugin_description,
+        bool read_only, const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param source_file: the source_file contain plugin code
+    @param plugin_type: the plugin type, currently supported CPP and PY
+    @param plugin_name: plugin name
+    @param code_type: code type, currently supported PY, SO, CPP, ZIP
+    @param plugin_description: plugin description
+    @param read_only: plugin is read only or not
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+### 2.5.从字节流中导入schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+### 2.6.从字节流中导入点边数据
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+        const std::string& data, const std::string& delimiter,
+        bool continue_on_error = false, int thread_nums = 8,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+### 2.7.从文件中导入schema
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
+### 2.8.从文件中导入点边数据
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+        const std::string& delimiter, bool continue_on_error = false,
+        int thread_nums = 8, int skip_packages = 0,
+        const std::string& graph = "default", bool json_format = true,
+        double timeout = 0);
+    @param result: the result returned by the service.
+    @param conf_file: data file contain format description and data
+    @param delimiter: data separator
+    @param continue_on_error: whether to continue when importing data fails
+    @param thread_nums: maximum number of threads
+    @param skip_packages: skip packages number
+    @param graph: the graph to query.
+    @param json_format: The result is returned in JSON format
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: whether the command is executed successfully
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md
new file mode 100644
index 0000000000..b2a51fe757
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md
@@ -0,0 +1,137 @@
+# Java客户端
+
+> 此文档主要是TuGraph Java SDK的使用说明。
+
+## 1.编译java client代码
+```shell
+cd src/client/java/TuGraphRpcClient
+sh local_build.sh
+```
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+```java
+import com.alipay.tugraph.TuGraphRpcClient;
+TuGraphRpcClient client = new TuGraphRpcClient(url, user, password);
+```
+
+```shell
+# 如果是从docker启动的tugraph
+url      : list://ip:9090
+user     : admin
+password : 73@TuGraph
+```
+
+```
+public TuGraphRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like list://ip:port
+@param user: login user name 
+@param password: login password
+```
+
+### 2.2.调用cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout) 
+```
+### 2.3.调用存储过程
+```java
+    String result = client.callPlugin("CPP", "khop", kHopParamGen(), 1000, false, "default", 1000);
+    log.info("testCallPlugin : " + result);
+```
+```
+    @param pluginType: the plugin type, currently supported CPP and PY
+    @param pluginName: plugin name
+    @param param: the execution parameters
+    @param pluginTimeOut: Maximum execution time, overruns will be interrupted
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of plugin execution
+    public String callPlugin(String pluginType, String pluginName, String param, double pluginTimeOut,
+            boolean inProcess, String graph, double timeout)
+```
+### 2.4.加载存储过程
+```java
+    String result = client.loadPlugin("./test/plugin/khop.so", "CPP", "khop", "SO", "test loadplugin", true, "default", 1000);
+    log.info("loadPlugin : " + result);
+```
+```
+    @param sourceFile: the source_file contain plugin code
+    @param pluginType: the plugin type, currently supported CPP and PY
+    @param pluginName: plugin name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param pluginDescription: plugin description
+    @param readOnly: plugin is read only or not
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of plugin execution
+    public boolean loadPlugin(String sourceFile, String pluginType, String pluginName, String codeType,
+            String pluginDescription, boolean readOnly, String graph, double timeout) throws IOException
+```
+### 2.5.从字节流中导入schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException 
+```
+### 2.6.从字节流中导入点边数据
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+### 2.7.从文件中导入schema
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout) 
+            throws UnsupportedEncodingException, IOException
+```
+### 2.8.从文件中导入点边数据
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..a9c06de71b
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,174 @@
+# TuGraph-OGM
+
+## 1.简介
+
+> TuGraph-OGM 项目在其他仓库开源。
+
+TuGraph-OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。同时 TuGraph-OGM 兼容 Neo4j-OGM，Neo4j 生态用户可以无缝迁移到 TuGraph 数据库上。
+
+### 1.1.TuGraph-OGM 功能
+
+TuGraph-OGM 提供以下函数操作 TuGraph：
+
+| 功能                            | 用法                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| 插入单个节点\边                 | void session.save(T object)                                                      |
+| 批量插入节点\边                 | void session.save(T object)                                                      |
+| 删除节点与对应边                | void session.delete(T object)                                                    |
+| 删除指定 label 的全部节点       | void session.deleteAll(Class\<T> type)                                           |
+| 清空数据库                      | void purgeDatabase()                                                             |
+| 更新节点                        | void session.save(T newObject)                                                   |
+| 根据 id 查询单个节点            | T load(Class<T> type, ID id)                                                     |
+| 根据 ids 查询多个节点           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| 根据 label 查询全部节点         | Collection\<T> loadAll(Class\<T> type)                                           |
+| 条件查询                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher 查询（指定返回结果类型） | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher 查询                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.编译 TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.使用 TuGraph-OGM
+
+详细示例请参考 demo 文件夹下的 TuGraphOGMDemo ###在`pom.xml`中引入依赖
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // 构建Movie节点
+    @Id
+    private Long id;      // Movie节点的id
+    private String title; // title属性
+    private int released; // released属性
+
+    // 构建边ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // 构建Actor节点
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// 配置
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//启动driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// 开启session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.通过OGM进行增删改查
+
+```java
+// 增
+Movie jokes = new Movie("Jokes", 1990);  // 新建Movie节点jokes
+session.save(jokes);                     // 将jokes存储在TuGraph中
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // 将speed节点与alice节点通过ACTS_IN进行连接
+session.save(speed);                    // 存储两个节点与一条边
+
+// 删
+session.delete(alice);                  // 删除alice节点以及相连的边
+Movie m = session.load(Movie.class, jokes.getId());   // 根据jokes节点的id获取jokes节点
+session.delete(m);                                    // 删除jokes节点
+
+// 改
+speed.setReleased(2018);
+session.save(speed);                   // 更新speed节点属性
+
+// 查
+Collection<Movie> movies = session.loadAll(Movie.class);  // 获取所有Movie节点
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // 查询所有小于1995年发布的电影
+
+// 调用Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // 查询Speed为2018的Movie
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // 创建节点Label Director
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // 创建边Label DIRECT
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // 获取create结果
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // 查看创建节点数目
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //查看创建边数目
+
+// 清空数据库
+session.deleteAll(Movie.class);        // 删除所有Movie节点
+session.purgeDatabase();               // 删除全部数据
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
new file mode 100644
index 0000000000..8c68a5fd64
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
@@ -0,0 +1,134 @@
+# 命令行工具
+
+> 此文档主要介绍 lgraph_cypher 文档的使用
+
+TuGraph 发布版本附带名为`lgraph_cypher`的查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+## 1.单命令模式
+
+在单命令模式下，`lgraph_cypher`可用于提交单个 Cypher 查询并将结果直接打印到终端，打印结果也可以容易地重定向写入指定文件。当用户需要从服务器获取大量结果并将其保存在文件中时，这非常便利。
+在此模式下，`lgraph_cypher`工具具有以下选项：
+
+### 1.1.命令行参数:
+
+| 参数     | 类型   | 说明                                                                     |
+| -------- | ------ | ------------------------------------------------------------------------ | ------ | ----------------------------------------------------------------------------------------------------------------------------------------- |
+| --help   | \\     | 列出所有参数及说明。                                                     |
+| -example | \\     | 列出命令实例。                                                           |
+| -c       | string | 数据库的配置文件，用于获取 ip 与 port 信息。                             |
+| -h       | string | 数据库服务器 ip 地址，如有配置文件则可舍去此参数。默认值为`127.0.0.1` 。 |
+| -p       | string | 数据库服务器端口，如有配置文件则可舍去此参数。默认值为`7071` 。          |
+| -u       | string | 数据库登录用户名。                                                       |
+| -P       | string | 数据库登录密码。                                                         |
+| -f       | string | 包含单条 Cypher 查询单文本文件的路径。                                   |
+| -s       | string | 单行 cypher 查询命令。以`"`开头结尾。                                    |
+| -t       | int    | 进行 cypher 查询时服务器的超时阈值。默认值为`150`秒。 -format            | string | 查询结果显示模式。支持`plain`与`table`两种格式。`plain`格式会将查询结果单列打印。`table`格式会将查询结果以表格方式显示。默认值为`table`。 |
+
+### 1.2.命令示例:
+
+**cypher 命令文件查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+```
+
+**cypher 命令单句查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+```
+
+## 2.交互模式
+
+`lgraph_cypher`也可以在交互模式下运行。在交互式模式下，客户端与服务器保持连接，并在读取-评估-打印-循环中与用户进行交互。
+
+### 2.1.进入 lgraph_cypher 交互模式:
+
+如不加`-f`或`-s`命令行选项，运行`lgraph_cypher`时将会进入交互模式。使用方式如下：
+
+```
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+```
+
+如成功进入则会显示相应登录成功信息：
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2023 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+现在我们也提供一个交互式 shell ，用于用户输入 Cypher 查询语句或使用`:help`命令来检查可用命令。
+
+### 2.2.command种类与说明:
+
+除 Cypher 查询外，`lgraph_cypher` 的 shell 还接受以下命令：
+
+| 命令                     | 对应参数                           | 说明                                                                                                |
+| ------------------------ | ---------------------------------- | --------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                 | 显示服务器信息与所有 command 对应说明。                                                             |
+| :db_info                 | \\                                 | 当前服务器状态查询。对应 REST API 的/db/info。                                                      |
+| :clear                   | \\                                 | 清空屏幕。                                                                                          |
+| :use                     | {图的名称}                         | 使用该名称指定的图，默认值为`default` 。                                                            |
+| :source                  | `-t {查询timeout值} -f {查询文件}` | 可交互模式下的 cypher 命令文件查询。超时阈值默认值为`150`秒。查询文件格式参考无交互式查询参数。     |
+| :exit                    | \\                                 | 退出交互模式并返回原命令行。                                                                        |
+| :format                  | `plain` or `table`                 | 更改 cypher 查询结果的显示模式。支持`plain`与`table`模式。                                          |
+| :save all/command/result | `-f {文件路径}` `{cypher语句}`     | 存储 cypher 命令（command）或查询结果（result）或以上二者（all）。默认存储位置为`/saved_cypher.txt` |
+
+**注意:**
+
+- 每条命令都应该以冒号开始 `:`.
+
+**:save 命令例子:**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+```
+
+### 2.3.cypher 查询命令:
+
+在交互模式下，用户也可直接输入单句 cypher 命令进行查询，以"`;`"结束。输入命令不区分大小写。例子如下：
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher`输入命令时支持多行输入，用户可使用`ENTER`键将长查询语句分多行输入。多行输入情况下命令行开头会从`>`变为`=>`，然后用户可以继续输入查询的其余部分。
+
+例子如下：
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### 2.4.辅助功能:
+
+**历史查询：** 在交互模式下按上下方向键可查询输入历史。
+
+**自动补全：** lgraph_cypher 会根据输入历史进行自动补全。在补全提示出现的情况下，按下右方向键就会自动补全命令。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/index.rst
new file mode 100644
index 0000000000..8d59c09305
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/4.client-tools/index.rst
@@ -0,0 +1,8 @@
+客户端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
new file mode 100644
index 0000000000..b79cc13cc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
@@ -0,0 +1,1020 @@
+# 运维监控
+
+> 此文档主要介绍 TuGraph 的可视化运维监控
+
+## 1.设计思路
+
+可视化监控并不是TuGraph自身不可或缺的一部分，因此在设计时将可视化监控作为TuGraph周边生态中的一个应用，来减少和TuGraph数据库的耦合度，以及对于TuGraph自身的影响。TuGraph可视化监控采用目前最火热的开源解决方案，TuGraph Monitor + Prometheus + Grafana来实现。其中TuGraph Monitor作为TuGraph服务的客户端，通过TCP链接向TuGraph服务发起Procedure请求，TuGraph服务在接收到请求后收集自身所在机器的cpu，memory，disk，io，以及请求数量等指标的统计结果进行响应。TuGraph Monitor在接收到TuGraph响应的指标数据后，将数据包装成prometheus需要的格式，保存在内存中，等待Prometheus服务通过http请求获取。Prometheus服务会定期通过http请求从TuGraph Monitor获取封装好的请求数据，按照获取的时间保存在自己的时序数据库中。Grafana可以根据用户的配置，从Prometheus处获取某个时间段内的统计数据，并在web界面上绘制浅显易懂的图形来展示最终结果。整个请求链路中，都采用了主动获取，即PULL的模型，好处之一是它能最大限度的避免数据生产者和数据消费者之间的耦合度，使得开发更简单，好处之二是数据生产者不需要考虑数据消费者的数据处理能力，即使某个消费者的数据处理能力较弱，也不会因为生产者生产数据过快而压垮消费者。主动拉取模型的不足之处在于数据的实时性不够，但在这个场景中，数据并没有很高的实时性要求。
+
+### 1.1.TuGraph
+
+TuGraph数据库提供了收集服务所在机器中磁盘，内存，网络IO，以及查询请求等多种数据信息的能力，并通过标准Procedure方式提供查询。收集数据这一动作仅在有用户通过接口查询时才会发生，避免了在用户不需要TuGraph监控服务所在机器的指标时对用户业务查询请求带来的影响。
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor是TuGraph周边生态中的一个工具，它作为TuGraph众多用户中的一个，通过C++ RPC Client与TuGraph进行通信，通过Procedure查询接口来查询TuGraph服务所在机器的性能指标，并将TuGraph返回的结果包装成Prometheus需要的数据模型，等待Prometheus获取。用户可以通过设置查询时间间隔来保证获取监控指标对于业务查询的影响最小化。
+
+### 1.3.Prometheus
+
+Prometheus是一个开源的监控平台，并配备有专属的时序数据库，它会定期通过http请求从TuGraph Monitor服务获取统计指标，并保存在自己的时序数据库中。详细信息请参考官网: [https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana是一个开源的可视化和分析软件，它可以从包含Prometheus在内的多个数据源中获取数据，并且可以将时序数据库中的数据转换为精美图形和可视化效果的工具。具体信息请参考官网: [https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.部署方案
+
+### 2.1.第一步
+
+启动TuGraph服务，详细方法请参考文档: [https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.第二步
+
+启动TuGraph Monitor工具，启动命令如下：
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+参数含义如下
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.第三步
+
++ 下载符合您机器架构以及系统版本的Prometheus tar包，下载地址: [https://prometheus.io/download/](https://prometheus.io/download/)
+
++ 解压tar包，命令如下
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ 修改配置文件prometheus.yml，新增如下配置，使其可以抓取TuGraph Monitor包装好的性能数据
+
+```yaml
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ 启动prometheus，具体的启动参数可以通过如下命令获取
+
+```shell
+./prometheus -h
+```
+
++ 验证prometheus服务是否正常，可以通过web端登陆prometheus服务，查询监控指标resources_report是否已经获取到，能成功查询到数据则正确
+
+### 2.4.第四步
+
++ 下载符合您机器架构以及系统版本的Grafana安装包，下载地址: [https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ 安装Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 启动Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 配置Grafana，首先在数据源设置中配置Prometheus的IP地址，配置完成后可以通过测试连接功能，验证是否成功连接数据源。然后，导入如下模版，并在页面中根据实际情况，修改正确的接口IP和端口。最后可以根据实际情况设置刷新时间和监控时间范围
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana"
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {label_name} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "内存",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  QPS超过1000",
+        "name": "请求统计 alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "请求统计",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "磁盘",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\nCPU使用率超过90%",
+        "name": "CPU使用率 alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU使用率",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  磁盘IO超过10MB/S",
+        "name": "磁盘IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph监控页面",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+验证效果，刷新浏览器页面。如果正确显示饼图和折线图，则配置完成。
+
+## 3.未来计划
+
+目前可视化监控只支持单机监控，能监控服务所在机器的cpu，磁盘，网络io，请求qps等性能指标，未来将会实现监控ha集群的功能，也会将更多有意义的指标纳入监控范围
+
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
new file mode 100644
index 0000000000..6091df21fc
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
@@ -0,0 +1,434 @@
+# TuGraph-DataX
+
+> 此文档主要介绍 TuGraph DataX 的安装编译和使用示例
+
+## 1.简介
+
+TuGraph 在阿里开源的 DataX 基础上添加了 TuGraph 的写插件以及 TuGraph jsonline 数据格式的支持，其他数据源可以通过 DataX 往 TuGraph 里面写数据。
+DataX 介绍参考 [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+支持的功能包括：
+
+- 从 MySQL、SQL Server、Oracle、PostgreSQL、HDFS、Hive、HBase、OTS、ODPS、Kafka 等各种异构数据源导入 TuGraph
+- 将 TuGraph 导入相应的目标源 （待开发）
+
+![导入导出](../../../../images/tugraph-datax.png)
+
+## 2.编译安装
+
+```bash
+git clone git@code.alipay.com:fma/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+编译出来的 DataX 文件在 target 目录下
+
+## 3.文本数据通过DataX导入TuGraph
+
+我们以 TuGraph 手册中导入工具 lgraph_import 章节举的数据为例子，有三个 csv 数据文件，如下：
+`actors.csv`
+
+```
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+```
+
+`movies.csv`
+
+```
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+`roles.csv`
+
+```
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+```
+
+然后建三个 DataX 的 job 配置文件：
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后依次执行如下三个命令：
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## 4.MySQL数据通过DataX导入TuGraph
+
+我们在 `test` database 下建立如下电影 `movies` 表
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+往表中插入几条数据
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+建立一个 DataX 的 job 配置文件
+
+`job_mysql_to_tugraph.json`
+
+**配置字段方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**写简单 sql 方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后执行如下命令：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
new file mode 100644
index 0000000000..f34f415719
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
@@ -0,0 +1,69 @@
+# TuGraph-Explorer
+
+> TuGraph Explorer 强依赖 TuGraph，因此，在启动 Explorer 之前，我们先需要先启动 TuGraph。
+
+## 1.TuGraph Explorer 简介
+
+TuGraph Explorer 是基于 GraphInsight 构建的图可视分析平台，提供了完整的图探索分析能力，能够帮助用户从海量的图数据中洞察出有价值的信息。TuGraph Explorer 当前提供了Docker部署方式。
+
+## 2.启动 TuGraph Explorer
+
+TuGraph 安装成功以后，就可以开始安装 TuGraph Explorer。
+
+- 加载 TuGraph Explorer 镜像：
+
+```shell
+// lgraph_lastest.tar.gz 是 TuGraph 镜像文件名
+$ docker import tugraph_explore.tar.gz
+
+// 加载完毕后, 提示已加载镜像
+```
+
+- 启动 Docker
+
+```shell
+$ docker run -d -p 7091:7091 -it reg.docker.alibaba-inc.com/tugraph-explore:1.0.1
+$ docker exec -it {container_id} bash
+```
+
+参数说明：
+
+- -p 的作用是端口映射，示例中将 Docker 的 7091 端口映射到本地的 7091 端口
+- {container_id} 是 Docker 的 container id，可以通过 docker ps 获得
+
+- 启动 TuGraph Explorer
+
+```shell
+$ cd /usr/src/tugraphexplore
+$ npm run dev -- -p 7091
+```
+
+TuGraph Explorer 服务启动起来以后，通过 **http://localhost:7091/tugraph/explore.html** 就可以访问了，如果一切正常，就会看到如下页面。![image.png](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/tugraph-expolore/tugraph-explore-index.png)
+
+## 3.连接 TuGraph
+
+TuGraph Explorer 启动起来以后，第一步就是需要连接 TuGraph 数据库。点击「连接」按钮，弹出连接图数据库的页面，如下图所示。
+![image.png](https://gw.alipayobjects.com/mdn/rms_fa12c2/afts/img/A*JEUKRYMH--4AAAAAAAAAAAAAARQnAQ)
+
+连接 TuGraph 数据，我们需要提供以下信息：
+
+- 图数据库的账号
+- 图数据库的密码
+- 图数据库的地址：格式为 ip:port
+
+**地址需要填写容器 IP，可以通过如下指令查看**。
+
+```
+$ docker run -d -v /Users/xx/tugraph:/mnt -p 7090:7090 -it reg.docker.alibaba-inc.com/tugraph/tugraph:3.3.0
+$ docker exec -it 8408b49033bc1698(TuGraph 的容器) bash
+$ cat /etc/hosts
+127.0.0.1	localhost
+::1	localhost ip6-localhost ip6-loopback
+fe00::0	ip6-localnet
+ff00::0	ip6-mcastprefix
+ff02::1	ip6-allnodes
+ff02::2	ip6-allrouters
+172.17.0.4	8408b543243bc69
+```
+
+如上所示，连接图数据库的地址应该填写：**172.17.0.4:7090**。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md
new file mode 100644
index 0000000000..31eb9441c4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md
@@ -0,0 +1,17 @@
+# 日志信息
+
+> 此文档主要介绍 TuGraph 的日志功能。
+
+## 1.简介
+
+TuGraph 保留两种类型的日志：服务器日志和审计日志。服务器日志记录人为可读的服务器状态信息，而审核日志维护服务器上执行的每个操作加密后的信息。
+
+## 2.服务器日志
+
+服务器日志会跟踪服务器的状态信息（如服务器启动和停止等）以及服务器已提供的请求及其相应的响应。服务器日志的详细程度可通过`verbose`选项进行配置。日志的位置在`log_dir`选项中指定。
+
+默认的`verbose`等级为`1`，此等级下，服务器将仅打印主要事件的日志，如服务器启动/停止。请求和响应不会记录在此级别。
+
+## 3.审计日志
+
+审核日志记录每个请求和响应，以及发送请求的用户以及收到请求的时间。审核日志只能是打开或关闭状态。可以使用 TuGraph 可视化工具和 REST API 查询结果。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md
new file mode 100644
index 0000000000..1a62bd27a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md
@@ -0,0 +1,198 @@
+# TuGraph-Restful-Server
+
+> TuGraph Restful Server 强依赖 TuGraph，Restful Server 与 Tugraph 共存
+
+## 1.TuGraph-Restful-Server 简介
+TuGraph Restful Server 使用brpc框架支持的http协议，提供restful接口查询功能，在实现中，restful server 与rpc server 使用同一个端口。目前restful接口提供文件上传，数据导入，导入进度查询，cypher查询，文件删除等功能
+
+## 2.启动 TuGraph-Restful-Server
+需要在启动Tugraph时设置enable_rpc参数为true的方式，正常启动TuGraph
+
+## 3.连接 TuGraph-Restful-Server
+TuGraph正常启动后，Restful Server 将监听在rpc_port上， 通过访问 http://${ip}:${rpc_port}/LGraphHttpService/Query/ url可以链接到TuGraph
+
+## 4.数据格式
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+## 5.返回值
+
+通用返回格式
+
+|  body参数  | 参数说明  |  参数类型  |  是否必填  |
+|:--------:|:-----:|:------:| :-----: |
+| errorCode |  状态码  |  字符串  |  是  |
+| errorMessage | 错误信息  |  字符串  |  是  |
+| data | 返回的数据 |  字符串  |  是  |
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 401 Unauthorized: 未通过鉴权认证，例如用户名密码错误，token超过有效期等
+- 500 Internal Server Error: 服务器端错误
+  当操作成功时，返回的 data 中包含操作的返回值。
+  当发生输入错误或者服务器错误时，返回的 errorMessage 中包含错误提示。
+
+## 6.URI格式
+
+| URI               | 说明                 |
+|-------------------|--------------------|
+| /cypher           | 执行cypher查询请求       |
+| /refresh          | 刷新token请求          |
+| /login            | 用户登陆请求             |
+| /logout           | 用户登出请求             |
+| /upload_files     | 上传文件请求             |
+| /clear_cache      | 清理用户上传文件请求         |
+| /check_file       | 文件认证请求             |
+| /import_data      | 数据导入请求             |
+| /import_progress  | 导入进度查询请求           |
+| /import_schema    | 批量创建schema请求       |
+
+## 7.接口
+### 7.1 用户登陆
+用于用户第一次与服务端通信时的鉴权操作，请求报文在 http body 中携带用户名和密码，响应报文在 http body 中会返回一个带有有效期的token，后续请求中需要在http header中携带该token作为凭证
+#### 7.1.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/login
+#### 7.1.2 REQUEST
+|  body参数  |  参数说明  |  参数类型  |  是否必填  |
+|:--------:|:------:|:------:| :-----: |
+ | userName |  用户名  |  字符串  |  是  |
+ | password |   密码   |  字符串  |  是  |
+#### 7.1.3 RESPONSE
+|    body参数     | 参数说明  |  参数类型  |  是否必填  |
+|:-------------:|:-----:|:------:| :-----: |
+| authorization | token |  字符串  |  是  |
+
+### 7.2 刷新token
+token到期后将无法使用此token与服务端正常通信，需要获取新的token作为后续请求的凭证，请求报文在http header中携带旧的token，响应报文在http body中返回新的token
+#### 7.2.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/refresh
+#### 7.2.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+#### 7.2.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| authorization | 新的token |  字符串  |  是  |
+
+### 7.3 用户登出
+用户不再需要与服务端进行通信时，需要请求登出接口，释放自己的token。请求报文在http header中携带旧的token，如果拿到返回errorCode为200的响应报文即为正常登出
+#### 7.3.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/logout
+#### 7.3.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+### 7.4 执行cypher查询请求
+用户通过此类请求发cypher给server端执行并获取执行结果，请求报文在http body 中将执行的cypher语句和目标子图发送给server，server执行完成后在响应报文的http body中返回执行结果
+#### 7.4.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/cypher
+
+#### 7.4.2 REQUEST
+| body参数 |    参数说明    |  参数类型  |  是否必填  |
+|:------:|:----------:|:------:| :-----: |
+| graph  |   查询目标子图   |  字符串  |  是  |
+| script | cypher查询语句 |  字符串  |  是  |
+
+#### 7.4.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| result | 返回结果 |  字符串  |  是  |
+
+### 7.5 上传文件请求
+用户通过此类请求向server发送文件，可以对文件进行分片，分片大小不大于1MB，支持多线程乱序发送，请求报文在http header 中包含文件名，第一字节内容在文件中的偏移和分片大小，在body中包含文件内容，server收到请求后将验证分片大小是否与分片内容一致，一致时将文件分段写入文件。不一致时将返回errorCode为400的响应
+#### 7.5.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/upload_files
+
+#### 7.5.2 REQUEST
+| header参数  |    参数说明    |  参数类型  |  是否必填  |
+|:---------:|:----------:|:------:| :-----: |
+| File-Name |   文件名   |  字符串  |  是  |
+| Begin-Pos | 开始位置在文件内的偏移 |  字符串  |  是  |
+|   Size    | 文件分片大小 |  字符串  |  是  |
+|  body参数   |  参数说明   |  参数类型  |  是否必填  |
+|     -     | 文件内容 |  字符串  |  是  |
+
+### 7.6 文件认证请求
+用户通过此类请求验证发送到server端的文件是否与期望一致，server端使用两种验证方式，md5值和文件长度，目前已支持文件长度验证。
+#### 7.6.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/check_file
+#### 7.6.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| fileName |           文件名           |  字符串  |  是  |
+| checkSum |        文件对应md5值         |  字符串  |  否  |
+| fileSize |       文件长度(以字节计算)       |  字符串  |  否  |
+| flag | 标记位，为1时校验md5值，为2时校验文件长度 |  字符串  |  是  |
+
+#### 7.6.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| pass | 检查成功为true，否则为false |  bool  |  是  |
+
+### 7.7 批量创建schema请求
+用户通过此类请求批量创建schema，请求报文在http body 中将创建schema的目标子图和schema信息发送给server，如果拿到返回errorCode为200的响应报文即为正常创建
+#### 7.7.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_schema
+#### 7.7.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| graph |   创建目标子图   |  字符串  |  是  |
+| schema | schema描述信息 |  字符串  |  是  |
+
+### 7.8 数据导入请求
+用户通过此类请求导入已经上传的数据文件。导入不论成功或失败，都将删除已上传文件。数据导入请求在server中实现为一个异步任务，响应返回并不意味着导入已完成，返回的是任务id，后续可以通过此任务id查询导入进度
+#### 7.8.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_data
+#### 7.8.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  | 是否必填 |
+|:--------:|:-----------------------:|:------:|:----:|
+| graph |         导入目标子图          |  字符串  |  是   |
+| schema |       导入schema描述        | json字符串  |  是   |
+| delimiter |           分隔符           |  字符串  |  是   |
+| continueOnError |     单行数据出错是否跳过错误并继续     |  boolean  |  否   |
+| skipPackages |         跳过的包个数          |  字符串  |  否   |
+| taskId |  任务id   |  字符串  |  否   |
+| other | 其他参数 |  json字符串  |  否   |
+
+#### 7.8.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| taskId | 任务编号 |  字符串  |  是  |
+
+### 7.9 清理用户上传文件请求
+用户通过此类请求清理已经上传的文件，如果拿到返回errorCode为200的响应报文即为正常清理
+#### 7.9.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/clear_cache
+#### 7.9.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| fileName |    文件名称    |  字符串  |  否  |
+| userName |    用户名称    |  字符串  |  否  |
+| flag | 标记位， flag = 0时删除fileName指定文件, flag = 1时删除userName指定用户已经上传的所有文件， flag = 2时删除所有用户上传的文件 |  字符串  |  是  |
+
+### 7.10. 导入进度查询请求
+用户通过此类请求获得导入任务的状态
+#### 7.10.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_progress
+#### 7.10.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| taskId |           任务编号           |  字符串  |  是  |
+
+#### 7.10.3 RESPONSE
+| body参数 |                  参数说明                   |  参数类型  |  是否必填  |
+|:------:|:---------------------------------------:|:------:| :-----: |
+| state  | 状态标记，为0表示准备导入，为1表示导入中，为2表示导入成功，为3表示导入失败 |  字符串  |  是  |
+|  progress  |             导入进度，state为1时包含             |  字符串  |  否  |
+|  reason  |             失败原因，state为3时包含             |  字符串  |  否  |
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst
new file mode 100644
index 0000000000..bf92f16478
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst
@@ -0,0 +1,8 @@
+生态工具
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/1.cypher.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/1.cypher.md
new file mode 100644
index 0000000000..1331eb54f4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/1.cypher.md
@@ -0,0 +1,2320 @@
+# Cypher API
+
+> 此文档主要介绍了TuGraph-Cypher的详细使用说明
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators支持进度一览：
+
+| 类别                                 | 支持                                                                                                        | 待支持                             |
+| ------------------------------------ | ----------------------------------------------------------------------------------------------------------- | ---------------------------------- |
+| General operators                    | `DISTINCT`, `.` for property access                                                                     | `[]` for dynamic property access |
+| Mathematical operators               | `+`, `-`, `*`, `/`, `%`, `^`                                                                    |                                    |
+| Comparison operators                 | `=`, `<>`, `<`, `>`, `<=`, `>=`, `IS NULL`, `IS NOT NULL`                                   |                                    |
+| String-specific comparison operators | `STARTS WITH`, `ENDS WITH`, `CONTAINS`, `REGEXP`                                                    |                                    |
+| Boolean operators                    | `AND`, `OR`, `XOR`, `NOT`                                                                           |                                    |
+| String operators                     | `+` for concatenation                                                                                     |                                    |
+| List operators                       | `+` for concatenation, `IN` to check existence of an element in a list, `[]` for accessing element(s) |                                    |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+```
+MATCH (p:person) RETURN DISTINCT p.born
+```
+
+- ❏ Accessing properties of a nested literal map using the `.` operator
+
+```
+WITH {person: {name: 'Anne', age: 25}} AS p
+RETURN p.person.name
+```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+
+```
+CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+       (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+       (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+```
+
+```
+MATCH (restaurant:Restaurant), (category:Category)
+WHERE restaurant["rating_" + category.name] > 6
+RETURN DISTINCT restaurant.name
+```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator  `^`
+
+```
+WITH 2 AS number, 3 AS exponent
+RETURN number ^ exponent AS result
+```
+
+- ✓ Using the unary minus operator `-`
+
+```
+WITH -3 AS a, 4 AS b
+RETURN b - a AS result
+```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+
+```
+WITH 4 AS one, 3 AS two
+RETURN one > two AS result
+```
+ 
+### 1.5.String-specific comparison operators
+
+- ✓ Using STARTS WITH to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate STARTS WITH 'Jo'
+RETURN candidate
+```
+
+- ✓ Using REGEXP to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate REGEXP 'Jo.*n'
+RETURN candidate
+```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+```
+WITH [2, 4, 7, 9, 12] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number = 4 OR (number > 6 AND number < 10)
+RETURN number
+```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+
+```
+RETURN [1,2,3,4,5]+[6,7] AS myList
+```
+
+- ✓ Using IN to check if a number is in a list
+
+```
+WITH [2, 3, 4, 5] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number IN [2, 3, 8]
+RETURN number
+```
+
+- ✓ Accessing elements in a list using the [] operator
+
+```
+WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+RETURN names[1..3] AS result
+```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses支持进度一览：
+
+| 类别                    | 语法                                  | 备注   |
+| ----------------------- | ------------------------------------- | ------ |
+| Reading clauses         | MATCH                                 | 支持   |
+|                         | OPTIONAL MATCH                        | 支持   |
+|                         | MANDATORY MATCH                       | 待支持 |
+| Projecting clauses      | RETURN … [AS]                        | 支持   |
+|                         | WITH … [AS]                          | 支持   |
+|                         | UNWIND … [AS]                        | 支持   |
+| Reading sub-clauses     | WHERE                                 | 支持   |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | 支持   |
+|                         | SKIP                                  | 支持   |
+|                         | LIMIT                                 | 支持   |
+| Writing clauses         | CREATE                                | 支持   |
+|                         | DELETE                                | 支持   |
+|                         | DETACH DELETE                         | 支持   |
+|                         | SET                                   | 支持   |
+|                         | REMOVE                                | 支持   |
+| Reading/Writing clauses | MERGE                                 | 支持   |
+|                         | CALL […YIELD]                        | 支持   |
+| Set operations          | UNION                                 | 待支持 |
+|                         | UNION ALL                             | 支持   |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+
+  ```
+  MATCH (n)
+  RETURN n
+  ```
+
+  - ✓ Get all nodes with a label
+
+  ```
+  MATCH (movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Related nodes
+
+  ```
+  MATCH (person {name: 'Laurence Fishburne'})-[]-(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Match with labels
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]-(movie:movie)
+  RETURN movie.title
+  ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]->(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Directed relationships and variable
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[r]->(movie)
+  RETURN type(r)
+  ```
+
+  - ✓ Match on relationship type
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})<-[:acted_in]-(actor)
+  RETURN actor.name
+  ```
+
+  - ✓ Match on multiple relationship types
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[:acted_in|:directed]-(person)
+  RETURN person.name
+  ```
+
+  - ✓ Match on relationship type and use a variable
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[r:acted_in]-(actor)
+  RETURN r.role
+  ```
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+
+  ```
+  MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+  RETURN type(r)
+  ```
+
+  - ✓ Multiple relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in]->(movie)<-[:directed]-(director)
+  RETURN movie.title, director.name
+  ```
+
+  - ✓ Variable-length relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in*1..3]-(movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Relationship variable in variable-length relationships
+
+  ```
+  MATCH p = (laurence {name: 'Laurence Fishburne'})-[:acted_in*2]-(co_actor)
+  RETURN p
+  ```
+
+  - ❏ Match with properties on a variable-length path
+
+  ```
+  MATCH p = (charlie:person)-[* {blocked:false}]-(martin:person)
+  WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+  RETURN p
+  ```
+
+  - ✓ Zero-length paths
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})-[*0..1]-(x)
+  RETURN x
+  ```
+
+  - ✓ Named paths
+
+  ```
+  MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+  ```
+
+  - ✓ Matching on a bound relationship
+
+  ```
+  MATCH (a)-[r]->(b)
+  WHERE euid(r)="0_3937_0_0_0"
+  RETURN a,b
+  ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+  CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+  ```
+
+  - ✓ All shortest paths
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+  CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN
+  nodeIds,relationshipIds,cost
+  ```
+- Get node or relationship by id
+
+  - ✓ Node by id
+
+  ```
+  MATCH (n)
+  WHERE id(n)= 0
+  RETURN n
+  ```
+
+  - ✓ Relationship by id
+
+  ```
+  MATCH ()-[r]->()
+  WHERE euid(r) = "0_3937_0_0_0"
+  RETURN r
+  ```
+
+  - ✓ Multiple nodes by id
+
+  ```
+  MATCH (n)
+  WHERE id(n) IN [0, 3, 5]
+  RETURN n
+  ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n
+```
+
+- ✓ Return relationships
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'})-[r:acted_in]->(c)
+RETURN r
+```
+
+- ✓ Return property
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n.born
+```
+
+- ❏ Return all elements
+
+```
+MATCH p = (a {name: 'A'})-[r]->(b)
+RETURN *
+```
+
+- ❏ Variable with uncommon characters
+
+```
+MATCH (`This isn\'t a common variable`)
+WHERE `This isn\'t a common variable`.name = 'A'
+RETURN `This isn\'t a common variable`.happy
+```
+
+- ✓ Aliasing a field
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born AS SomethingTotallyDifferent
+```
+
+- ✓ Optional properties
+
+```
+MATCH (n)
+RETURN n.age
+```
+
+- ❏ Other expressions
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born > 1900, "I'm a literal", (a)-[]->()
+```
+
+`(a)-[]->()`  not supported.
+
+- ✓ Unique results
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})-[]->(b)
+RETURN DISTINCT b
+```
+
+### 2.4.WHERE
+
+- Basic usage
+  - ✓ Boolean operations
+
+  ```
+  MATCH (n)
+  WHERE n.name = 'Laurence Fishburne' XOR (n.born > 1965 AND n.name = 'Carrie-Anne Moss')
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node label
+
+  ```
+  MATCH (n)
+  WHERE n:person
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node property
+
+  ```
+  MATCH (n)
+  WHERE n.born > 2000
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on relationship property
+
+  ```
+  MATCH (n)-[k:acted_in]->(f)
+  WHERE k.role = "Trinity"
+  RETURN f.title
+  ```
+
+  - ❏ Filter on dynamically-computed property
+
+  ```
+  WITH 'AGE' AS propname
+  MATCH (n)
+  WHERE n[toLower(propname)]< 30
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Property existence checking
+
+  ```
+  MATCH (n)
+  WHERE exists(n.born)
+  RETURN n.name, n.born
+  ```
+
+- String matching
+  - ✓ Match the beginning of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name STARTS WITH 'Pet'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match the ending of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name ENDS WITH 'ter'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match anywhere within a string
+
+  ```
+  MATCH (n)
+  WHERE n.name CONTAINS 'ete'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ String matching negation
+
+  ```
+  MATCH (n)
+  WHERE NOT n.name ENDS WITH 's'
+  RETURN n.name, n.born
+  ```
+
+- Using path patterns in `WHERE`
+  - ❏ Filter on patterns
+
+  ```
+  MATCH (tobias {name: 'Tobias'}), (others)
+  WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+  RETURN others.name, others.age
+  ```
+
+  - ❏ Filter on patterns using NOT
+
+  ```
+  MATCH (persons), (peter {name: 'Peter'})
+  WHERE NOT (persons)-[]->(peter)
+  RETURN persons.name, persons.age
+  ```
+
+  - ❏ Filter on patterns with properties
+
+  ```
+  MATCH (n)
+  WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Filter on relationship type
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name='Laurence Fishburne' AND type(r) STARTS WITH 'ac'
+  RETURN type(r), r.role
+  ```
+
+- Lists
+  - ✓ IN operator
+
+  ```
+  MATCH (a)
+  WHERE a.name IN ['Laurence Fishburne', 'Tobias']
+  RETURN a.name, a.born
+  ```
+
+- Missing properties and values
+  - ✓ Default to false if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white'
+  RETURN n.name, n.age, n.belt
+  ```
+
+  - ✓ Default to true if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+  ORDER BY n.name
+  ```
+
+  - ✓ Filter on null
+
+  ```
+  MATCH (person)
+  WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+  person.belt
+  ```
+
+- Using ranges
+  - ✓ Simple range
+
+  ```
+  MATCH (a)
+  WHERE a.name >= 'Peter'
+  RETURN a.name, a.born
+  ```
+
+  - ✓ Composite range
+
+  ```
+  MATCH (a)
+  WHERE a.name > 'Andres' AND a.name < 'Tobias'
+  RETURN a.name, a.born
+  ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 3
+```
+
+- ✓ Return middle two records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 1
+LIMIT 2
+```
+
+- ❏ Using an expression with SKIP to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP toInteger(3*rand())+ 1
+```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT 3
+```
+
+- ❏ Using an expression with LIMIT to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT toInteger(3 * rand())+ 1
+```
+
+### 2.7.CREATE
+
+- Create nodes
+
+> **Note**
+> TuGraph不支持创建空的nodes，不支持多labels。
+
+  - ☒ Create single node
+
+  ```
+  CREATE (n)
+  ```
+
+  - ☒ Create multiple nodes
+
+  ```
+  CREATE (n), (m)
+  ```
+
+  - ☒ Create a node with a label
+
+  ```
+  CREATE (n:person)
+  ```
+
+  - ☒ Create a node with multiple labels
+
+  ```
+  CREATE (n:Person:Swedish)
+  ```
+
+  - ✓ Create node and add labels and properties
+
+  ```
+  CREATE (n:person {id:2001, name: 'Andres'})
+  ```
+
+  - ✓ Return created node
+
+  ```
+  CREATE (n:person {id:2002, name: 'Andres'})
+  RETURN n
+  ```
+
+- Create relationships
+  - ✓ Create a relationship between two nodes
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:write]->(m)
+  ```
+
+  - ✓ Create a relationship and set properties
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:acted_in{role: 'Trinity'}]->(m)
+  ```
+
+  - ❏ Create a full path
+
+  ```
+  CREATE p = (andres:person {id: 2005, name:'Andres'})-[:acted_in {role: 'Trinity'}]->
+  (m:movie {id: 2006})<-[:acted_in {role: 'Trinity'}]-(michael {id: 2006, name:'Michael'})
+  RETURN p
+  ```
+
+- Use parameters with CREATE
+  - ❏ Create node with a parameter for the properties
+
+  ```
+  CREATE (n:Person $props)
+  RETURN n
+  ```
+
+  - ☒ Create multiple nodes with a parameter for their properties
+
+  ```
+  UNWIND $props AS map
+  CREATE (n)
+  SET n = map
+  ```
+  cannot create vertex without label.
+
+### 2.8.CALL[…YIELD]
+
+- ✓ Call a procedure using CALL
+
+```
+CALL db.vertexLabels
+```
+
+- ✓ View the signature for a procedure
+
+```
+CALL dbms.procedures() YIELD name, signature
+RETURN signature
+```
+
+- ❏ Call a procedure using a quoted namespace and name
+
+```
+CALL `db`.`vertexLabels`
+```
+
+- ✓ Call a procedure with literal arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+```
+
+- ❏ Call a procedure with parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+```
+
+- ❏ Call a procedure with mixed literal and parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+```
+
+- ✓ Call a procedure with literal and default arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+```
+
+- ✓ Call a procedure within a complex query using CALL…YIELD
+
+```
+CALL db.vertexLabels() YIELD label
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure and filter its results
+
+```
+CALL db.vertexLabels() YIELD label
+WHERE label CONTAINS 'User'
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure within a complex query and rename its outputs
+
+```
+CALL db.propertyKeys() YIELD propertyKey AS prop
+MATCH (n)
+WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+
+```
+MATCH (n:person)
+RETURN n.name AS name
+UNION ALL MATCH (n:movie)
+RETURN n.title AS name
+```
+
+- ❏ Combine two queries and remove duplicates
+
+```
+MATCH (n:Actor)
+RETURN n.name AS name
+UNION
+MATCH (n:Movie)
+RETURN n.title AS name
+```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| 种类                   | 功能               | 备注                      |
+| ---------------------- | ------------------ | ------------------------- |
+| Predicate functions    | exists()           |                           |
+|                        | all()              | 不支持                    |
+|                        | any()              | 不支持                    |
+|                        | single()           | 不支持                    |
+|                        | none()             | 不支持                    |
+| Scalar functions       | id()               |                           |
+|                        | euid()             |                           |
+|                        | properties()       |                           |
+|                        | head()             |                           |
+|                        | last()             |                           |
+|                        | toBoolean()        |                           |
+|                        | toFloat()          |                           |
+|                        | toInteger()        |                           |
+|                        | toString()         |                           |
+|                        | type()             |                           |
+|                        | startnode()        |                           |
+|                        | endnode()          |                           |
+|                        | size()             |                           |
+|                        | length()           |                           |
+|                        | label()            | OpenCypher扩展方法      |
+| Aggregating functions  | avg()              |                           |
+|                        | collect()          |                           |
+|                        | count()            |                           |
+|                        | max()              |                           |
+|                        | min()              |                           |
+|                        | percentileCont()   |                           |
+|                        | percentileDisc()   |                           |
+|                        | stDev()            |                           |
+|                        | stDevP()           |                           |
+|                        | variance()         |                           |
+|                        | varianceP()        |                           |
+|                        | sum()              |                           |
+| List functions         | keys()             |                           |
+|                        | labels()           | 返回结果有且只有一个label |
+|                        | nodes()            |                           |
+|                        | range()            |                           |
+|                        | subscript()        | 不支持                    |
+| Mathematical functions | abs()              |                           |
+|                        | ceil()             |                           |
+|                        | floor()            |                           |
+|                        | rand()             |                           |
+|                        | round()            |                           |
+|                        | sign()             |                           |
+| String functions       | /                  |                           |
+
+### 3.2.Predicate functions
+
+- exists()
+  judge it whether a vertex or edge has the field  .
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+WHERE exists(n.born)
+RETURN n.name, n.born
+```
+
+**Example output:**
+
+| exists(name) |
+| ------------ |
+| true         |
+
+### 3.3.Scalar functions
+
+- id()
+  get the id of vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN id(a)
+```
+
+**Example output:**
+
+| vid |
+| --- |
+| 1   |
+| 2   |
+| ... |
+
+- properties()
+  get  a map containing all the properties of a node or relationship.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person {name: 'Laurence Fishburne'})
+RETURN n
+```
+
+- head()
+  get the first element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, head(coll)
+```
+
+**Example output:**
+
+| coll                  | head(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "one"         |
+
+- last()
+  get the last element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, last(coll)
+```
+
+**Example output:**
+
+| coll                  | last(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "three"       |
+
+- toFloat()
+  Converts an integer or string value to a floating point number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toFloat('11.5')
+```
+
+**Example output:**
+
+| float |
+| ----- |
+| 11.5  |
+
+- toInteger()
+  Converts a floating point or string value to an integer value.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toInteger('2.3') AS integer
+```
+
+**Example output:**
+
+| integer |
+| ------- |
+| 2       |
+
+- toString()
+  Converts an integer, float, boolean value to a string.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toString(2.3)
+```
+
+- type()
+  get the string representation of the relationship type.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)-[r]->()
+WHERE n.name = 'Laurence Fishburne'
+RETURN type(r)
+```
+
+**Example output:**
+
+| type     |
+| -------- |
+| acted_in |
+| acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+  Returns the average of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN avg(n.born)
+```
+
+**Example output:**
+
+| avg(n.born)        |
+| ------------------ |
+| 1869.2661654135338 |
+
+- collect()
+  Returns a list containing the values returned by an expression.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN collect(n.born)
+```
+
+**Example output:**
+
+| collect(n.born) |
+| --------------- |
+| [1967,...]      |
+
+- count()
+  Returns the number of values or records.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n {name: 'Laurence Fishburne'})-[]->(x)
+RETURN labels(n), n.born, count(*)
+```
+
+**Example output:**
+
+| labels(n)  | n.born | count(*) |
+| ---------- | ------ | -------- |
+| ["person"] | 1961   | 3        |
+
+- max()
+  Returns the maximum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN max(n.born)
+```
+
+**Example output:**
+
+| max(n.born) |
+| ----------- |
+| 2003        |
+
+- min()
+  Returns the minimum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN min(n.born)
+```
+
+**Example output:**
+
+| min(n.born) |
+| ----------- |
+| 1000        |
+
+- percentileCont()
+  Returns the percentile of a value over a group using linear interpolation.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileCont(n.born, 0.4)
+```
+
+**Example output:**
+
+| percentileCont(n.born, 0.4) |
+| --------------------------- |
+| 1953                        |
+
+- percentileDisc()
+  Returns the nearest value to the given percentile over a group using a rounding method.
+  **Scope:** whole instance.
+  **Output:** the percentile of the given value over a group.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileDisc(n.born, 0.5)
+```
+
+**Example output:**
+
+| percentileDisc(n.age, 0.5) |
+| -------------------------- |
+| 1959                       |
+
+- stDev()
+  Returns the standard deviation for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDev(n.born)
+```
+
+**Example output:**
+
+| stDev(n.born)      |
+| ------------------ |
+| 279.53117993401725 |
+
+- stDevP()
+  Returns the standard deviation for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDevP(n.born)
+```
+
+**Example output:**
+
+| stDevP(n.born)     |
+| ------------------ |
+| 279.3209270423399  |
+
+- variance()
+  Returns the variance for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN variance(n.born)
+```
+
+**Example output:**
+
+| variance(n.age)   |
+| ----------------- |
+| 78137.68055530392 |
+
+- varianceP()
+  Returns the variance for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN varianceP(n.born)
+```
+
+**Example output:**
+
+| varianceP(n.age)  |
+| ----------------- |
+| 78020.18028379219 |
+
+- sum()
+  Returns the sum of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN sum(n.born)
+```
+
+**Example output:**
+
+| sum(n.born) |
+| ----------- |
+| 1243062     |
+
+### 3.5.List Funtions:
+
+- keys()
+  get the field names of some vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN keys(a) LIMIT 1
+```
+
+**Example output:**
+
+| keys(a)               |
+| --------------------- |
+| ["name","age","eyes"] |
+
+- labels()/label()
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN labels(a) LIMIT 1
+```
+
+**Example output:**
+
+| labels                 |
+| ---------------------- |
+| ["Person"]             |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice"})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+
+### 3.6.Mathematical functions
+
+- abs()
+  get the absolute value of some data.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a:person {name: 'Laurence Fishburne'}),
+(e:person {name: 'Carrie-Anne Moss'})
+RETURN a.born, e.born, abs(a.born-e.born)
+```
+
+**Example output:**
+
+| a.born | e.born | abs(a.born - e.born) |
+| ------ | ------ | -------------------- |
+| 38     | 41     | 1                    |
+
+- ceil()
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN ceil(0.1)
+```
+
+**Example output:**
+
+| ceil(0.1) |
+| --------- |
+| 1.0       |
+
+- floor()
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN floor(0.9)
+```
+
+**Example output:**
+
+| floor(0.9) |
+| ---------- |
+| 0.0        |
+
+- round()
+  Returns the value of a number rounded to the nearest integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN round(3.141592)
+```
+
+**Example output:**
+
+| round |
+| ----- |
+| 3     |
+
+- rand()
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN rand()
+```
+
+**Example output:**
+
+| rand()             |
+| ------------------ |
+| 0.9797131960534085 |
+
+- sign()
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN sign(-17), sign(0.1)
+```
+
+**Example output:**
+
+| sign(-17) | sign(0.1) |
+| --------- | --------- |
+| -1        | 1         |
+
+TuGraph 查询语言与 OpenCypher 的不同点如下：
+
+- Label 数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 4.附录1. 语法扩充及不同
+
+TuGraph查询语言与OpenCypher的不同点如下：
+
+- Label数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.附录2. 内置procedures列表
+### 5.1.procedures样例
+
+* dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                        | name         |
+  | ---------------------------------------------------- | -------------------- |
+  | db.vertexLabels() :: (label::STRING)               | db.vertexLabels        |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels |
+  | db.indexes() :: (index::LIST)            | db.indexes       |
+  | ...                          | ...          |
+
+* db.subgraph()
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | vids       | list           | list of vertex id                                                     |
+
+  **Output:**
+
+  Get a json containing all the properties of nodes and relationships.
+
+  **Example input:**
+
+  ```
+  CALL db.subgraph([3937,4126,4066,4010])
+  ```
+
+  **Example output**
+
+  | subgraph |
+  | -------- |
+  | {"nodes":[{"identity":3937,"label":"movie","properties":{"duration":136,"id":1,"poster_image":"http://image.tmdb.org/t/p/w185/gynBNzwyaHKtXqlEKKLioNkjKgN.jpg","rated":"R","summary":"Thomas A. Anderson is a man living two lives. By day he is an average computer programmer and by night a malevolent hacker known as Neo who finds himself targeted by the police when he is contacted by Morpheus a legendary computer hacker who reveals the shocking truth about our reality.","tagline":"Welcome to the Real World.","title":"The Matrix"}},{"identity":4010,"label":"user","properties":{"id":44,"login":"Howard"}},{"identity":4066,"label":"user","properties":{"id":202,"login":"Enoch"}},{"identity":4126,"label":"user","properties":{"id":464,"login":"Wilburn"}}],"relationships":[{"dst":4126,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4010,"temporal_id":0},{"dst":4010,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4066,"temporal_id":0},{"dst":4066,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4126,"temporal_id":0}]} |
+
+* db.vertexLabels()
+
+  Lists all available vertex labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+  **Example output:**
+
+    | label   |
+    | ------- |
+    | genre   |
+    | keyword |
+    | movie   |
+    | ...     |
+
+* db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edge labels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | relationshipType |
+  | ---------------- |
+  | acted_in     |
+  | directed     |
+  | ...          |
+
+* db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of  vertex label    |
+  | primary_field | string  | primary field of vertex label |
+  | field_spec | list       | specification of a field |
+
+   in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+    **Output:** If successful, it returns a success message.
+
+    **Example input:**
+
+    ```
+    CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+    ```
+
+    **Example output:**
+
+    ```
+    Added label [Person]
+    ```
+
+* db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description           |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field         |
+  | type       | string     | type of the field         |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name     | type   | optional |
+  | ------------ | ------ | -------- |
+  | id       | INT32  | false    |
+  | born     | INT32  | true     |
+  | name     | STRING | true     |
+  | poster_image | STRING | true     |
+
+* db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | extra      | string     | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.
+    for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+* db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:**
+
+  | field_name | field_type | description              |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description           |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string      | either 'vertex' or 'edge'     |
+  | label_name  | string      | name of the label         |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description           |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string     | either 'vertex' or 'edge' |
+  | label_name       | string     | name of the label     |
+  | field_value_spec | list       | specification of a field  |
+
+    in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, optional]`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+    ```
+    CALL db.alterLabelModFields(
+    'vertex',
+    'new_label',
+    ['birth_date', DATETIME, true],
+    ['gender', BOOL, true])
+    ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of the label    |
+  | edge_constraints | string | edge constraints |
+  | field_spec | list       | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for  optional fields.
+
+  `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+* db.addIndex(label_name, field_name, is_unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | is_unique  | boolean    | Specifies whether the index is unique |
+
+   **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+   **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+* dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description      |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string     | the current password |
+  | new_password     | string     | new password     |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+   **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string     | the user's name |
+  | new_password | string     | new password    |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.createUser(user_name, password)
+
+  create  new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | -------------------------------- |
+  | user_name | string     | the new user name        |
+  | password  | string     | the password of new user     |
+  
+   **Output:**
+  
+    If successful, it returns a success message.
+  
+   **Example input:**
+  
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+  
+   **Example output:**
+  
+  ```
+  true
+  ```
+  
+* dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string     | the user name to be deleted |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+   a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string     | the user name           |
+  | is.admin  | boolean    | the permission of this user |
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       |  ...    |
+
+* dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+    a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description       |
+  | --------- | -------------- | --------------------- |
+  | user.user | string     | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+* dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+   a list of  ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host     |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...      |
+
+* dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+   the number of ip which been deleted.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+    the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description              |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string     | the name of new subgraph     |
+  | description | string     | description of new subgraph      |
+  | max_size_GB | integer    | Upper limit of subgraph capacity |
+
+   **Output:**
+
+    if successful , it will return true.
+
+   **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+   **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+  | config     | map        | the configuration to be modified     |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.listGraphs()
+
+  get all subgraphs in this graph database.
+
+  **Output:**
+
+    a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+
+* dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+    | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+* dbms.config.list()
+
+  get config of this graph database.
+
+  **Output:**
+
+    a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  |-----------| ---------|
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       |  ...    |
+
+* dbms.config.update(updates)
+
+  get some config of this graph database.
+
+  **Output:**
+
+    If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+    enable_ip_check:false,
+    durable:true,
+    optimistic_txn:true,
+    enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+* dbms.takeSnapshot()
+
+  take the  snapshot  on this current graph database.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+* dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path               |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+* algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                          |
+  | --------- | -------------- | ------------------------------------------------------------ |
+  | startNode | Node       | the source node of paths                     |
+  | endNode   | Node       | the destination node paths                   |
+  | config    | MAP        | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+    If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2     | 1     |
+
+* algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+* algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                        |
+  | --------- | -------------- | ---------------------------------------------------------- |
+  | id    | ANY        | the id of vertexes or edges , the id must be variable      |
+  | config    | MAP        | the configuration of  this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or  it is an edge id.
+
+  **Output:**
+
+    If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.内置procedures完整列表
+
+| Name                                  | Description                           | Signature                                                                                                                                                        |
+|---------------------------------------|---------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.subgraph                           | 列出点的子图                                | db.subgraph(vids::LIST) :: (subgraph::STRING)                                                                                                                    |
+| db.vertexLabels                       | 列出所有Vertex Label                      | db.vertexLabels() :: (label::STRING)                                                                                                                             |
+| db.edgeLabels                         | 列出所有Edge Label                        | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                          |
+| db.indexes                            | 列出所有索引                                | db.indexes() :: (label::STRING,field::STRING,unique::BOOLEAN)                                                                                                    |
+| db.listLabelIndexes(label_name)       | 列出所有与某个Label相关的索引                     | db.listLabelIndexes(label_name:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN)                                                                          |
+| db.warmup                             | 预热数据                                  | db.warmup() :: (time_used::STRING)                                                                                                                               |
+| db.createVertexLabel                  | 创建Vertex Label                        | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                           |
+| db.createLabel                        | 创建Vertex/Edge Label                   | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                      |
+| db.getLabelSchema                     | 列出label schema                        | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                        |
+| db.getVertexSchema                    | 列出点的 schema                           | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                               |
+| db.getEdgeSchema                      | 列出边的 schema                           | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                 |
+| db.deleteLabel                        | 删除Vertex/Edge Label                   | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                |
+| db.alterLabelDelFields                | 修改label删除属性                           | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                     |
+| db.alterLabelAddFields                | 修改label添加field                        | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                          |
+| db.alterLabelModFields                | 修改label field                         | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                |
+| db.createEdgeLabel                    | 创建Edge Label                          | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                              |
+| db.addIndex                           | 创建索引                                  | db.addIndex(label_name::STRING,field_name::STRING,is_unique::BOOLEAN) :: (::VOID)                                                                                |
+| db.deleteIndex                        | 删除索引                                  | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                |
+| db.backup                             | 备份数据                                  | db.backup(destination::STRING) :: ()                                                                                                                             |
+| dbms.procedures                       | 列出所有procedures                        | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                            |
+| dbms.security.changePassword          | 更改当前用户的密码                             | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                          |
+| dbms.security.changeUserPassword      | 更改指定用户的密码                             | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                             |
+| dbms.security.createUser              | 创建用户                                  | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                         |
+| dbms.security.deleteUser              | 删除用户                                  | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.listUsers               | 列出所有用户                                | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                  |
+| dbms.security.showCurrentUser         | 列出当前用户信息                              | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                        |
+| dbms.security.getUserPermissions      | 列出指定用户的权限                             | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                          |
+| dbms.graph.createGraph                | 创建子图                                  | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                |
+| dbms.graph.modGraph                   | 修改子图属性                                | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                  |
+| dbms.graph.deleteGraph                | 删除子图                                  | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                           |
+| dbms.graph.listGraphs                 | 列出所有子图                                | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                               |
+| dbms.graph.getGraphInfo               | 列出指定子图的信息                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                             |
+| dbms.security.addAllowedHosts         | 添加ip到信任列表                             | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                 |
+| dbms.security.deleteAllowedHosts      | 从信任列表删除ip                             | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                      |
+| dbms.security.listAllowedHosts        | 列出信任列表中的主机ip                          | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                               |
+| dbms.config.update                    | 更新TuGraph配置                           | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                            |
+| dbms.config.list                      | 列出TuGraph配置                           | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                  |
+| algo.shortestPath                     | 查询两个点间的最短路径                           | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                            |
+| algo.allShortestPaths                 | 查询两个点间的所有最短路径                         | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                             |
+| algo.native.extract                   | 查询指定VertexId/EdgeUid（列表）指定field的值（列表） | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                         |
+| db.flushDB                            | 刷新db                                  | db.flushDB() :: (::VOID)                                                                                                                                         |
+| dbms.security.listRoles               | 列出所有角色                                | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                  |
+| dbms.security.createRole              | 创建角色                                  | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                             |
+| dbms.security.deleteRole              | 删除角色                                  | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.getRoleInfo             | 获取角色详细信息                              | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                      |
+| dbms.security.disableRole             | 禁用/启用角色                               | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.modRoleDesc             | 修改角色描述信息                              | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.rebuildRoleAccessLevel  | 删除角色权限并重建                             | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                 |
+| dbms.security.modRoleAccessLevel      | 修改角色对指定图的访问权限                         | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                     |
+| dbms.security.modRoleFieldAccessLevel | 修改角色对指定属性的访问权限                        | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)          |
+| dbms.security.getUserInfo             | 获取用户详细信息                              | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                      |
+| dbms.security.disableUser             | 禁用/启用用户                               | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.setCurrentDesc          | 设置当前用户描述信息                            | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.setUserDesc             | 设置用户描述信息                              | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.getUserMemoryUsage      | 获取用户内存用量                              | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                        |
+| dbms.security.setUserMemoryLimit      | 设置用户内存限制                              | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                  |
+| dbms.security.deleteUserRoles         | 删除用户与角色的联系                            | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                              |
+| dbms.security.rebuildUserRoles        | 清空用户角色的关系并重建                          | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                             |
+| dbms.security.addUserRoles            | 新增用户与角色的联系                            | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                 |
+| db.plugin.loadPlugin                  | 装载plugin                              | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN) :: (::VOID) |
+| db.plugin.deletePlugin                | 删除plugin                              | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                      |
+| db.plugin.listPlugin                  | 列出已装载的plugin                          | db.plugin.listPlugin(plugin_type::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | 获取plugin的详细信息                         | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                   |
+| db.plugin.callPlugin                  | 执行plugin                              | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)             |
+| db.importor.dataImportor              | 导入点或边数据                               | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                      |
+| db.importor.schemaImportor            | 导入点或边schema                           | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                      |
+| db.addFullTextIndex                   | 添加全文索引                                | db.addFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                      |
+| db.deleteFullTextIndex                | 删除全文索引                                | db.deleteFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                   |
+| db.rebuildFullTextIndex               | 重建全文索引                                | db.rebuildFullTextIndex(vertex_labels::STRING, edge_labels::STRING) :: (::VOID)                                                                                  |
+| db.fullTextIndexes                    | 查看全文索引                                | db.fullTextIndexes() :: (is_vertex::BOOLEAN, label::STRING, field::STRING)                                                                                       |
+| dbms.meta.count                       | 查看点边总数                                | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                          |
+| dbms.meta.countDetail                 | 查看点边总数详情                              | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                |
+| dbms.meta.refreshCount                | 重新统计点边数量，统计期间停写。                      | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                          |
+| dbms.task.listTasks                   | 查询正在执行的任务                             | dbms.task.listTasks()::(tasks::LIST)                                                                                                                             |
+| dbms.task.terminateTask               | 中止任务                                  | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                               |
+| dbms.ha.clusterInfo                   | HA模式下查看集群状态                           | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                |
+| db.dropDB                             | 清空数据库                                 | db.dropDB() :: (::VOID)                                                                                                                                          |
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..b22c6b3855
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
@@ -0,0 +1,207 @@
+# OLAP API
+
+> 本文档是为TuGraph的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对TuGraph的图计算运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于Tugraph的一个简单的[BFS(宽度优先搜索)](https://en.wikipedia.org/wiki/Breadth-first_search "wikipedia")程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图分析引擎介绍
+
+TuGraph的图分析引擎，面向的场景主要是全图/全量数据分析类的任务。借助TuGraph的 C++ / Python 图分析引擎 API ，用户可以对不同数据来源的图数据快速导出一个待处理的复杂子图，然后在该子图上运行诸如PageRank、LPA、WCC等迭代式图算法，最后根据运行结果做出相应的对策。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph图计算系统社区版内置6个算法，商业版内置了25种算法，用户几乎不需要自己实现具体的图计算过程。其详细介绍可参考algorithms.md。
+
+根据数据来源及实现不同，可分为Procedure、Embed和Standalone三种运行方式，均继承于OlapBase API，OlapBase API接口文档可参考olapbase-api.md。
+
+其中Procedure和Embed的数据来源是图数据库中预加载的db数据，可以分别编译生成tugraph-web加载使用的.so文件和后台终端使用的embed文件，输入的图数据均通过db的加载形式，其接口文档可参考olapondb-api.md。
+Standalone用于编译生成standalone文件，区别于前者，该文件的输入图数据通过txt、二进制、ODPS文件的形式加载，其接口文档可参考olapondisk-api.md。
+
+## 2. Procedure 编译与运行
+
+该种方式主要用于tugraph-web界面进行可视化加载及运行。使用方法如下：
+
+### C++:
+在tugraph-db/plugins目录下执行`bash make_so.sh bfs`即可在tugraph-db/plugins目录下得到bfs.so文件，将该文件以插件形式上传至tugraph-web，输入参数后即可执行。
+
+### Python:
+在tugraph-web的前端将python文件以插件形式上传，输入参数后即可执行。
+
+示例：
+在tugraph-db/plugins编译.so算法文件
+`bash make_so.sh bfs`
+
+将bfs.so（或tugraph-db/plugins/cython/bfs.py）文件以插件形式加载至tugraph-web后，输入如下json参数：
+
+```json
+{
+    "root_id":"0",
+    "label":"node",
+    "field":"id"
+}
+```
+即可得到返回结果如下。
+
+```json
+{
+  "core_cost": 0.013641119003295898,
+  "found_vertices": 3829,
+  "num_edges": 88234,
+  "num_vertices": 4039,
+  "output_cost": 8.821487426757813e-06,
+  "prepare_cost": 0.03479194641113281,
+  "total_cost": 0.04844188690185547
+}
+```
+
+输出内容解释如下：
+- core_cost: 表示算法运行所需要的时间。
+- found_vertices: 表示查找到点的个数。
+- num_edges: 表示该图数据的边数量。
+- num_vertices: 表示该图数据点的数量。
+- output_cost: 表示算法结果写回db所需要的时间。
+- prepare_cost: 表示预处理阶段所需要的时间。预处理阶段的工作：加载参数、图数据加载、索引初始化等。
+- total_cost: 表示执行该算法整体运行时间。
+
+make_so.sh文件介绍：该文件用于将TuGraph-OLAP所涉及到的图算法文件编译成一个可供tugraph-web使用的.so文件。
+
+## 3. Embed 编译与运行
+
+该种方式主要用于TuGraph在后台程序中对预加载的db图数据进行算法分析。其使用方法如下：
+在tugraph-db/plugins目录下对embed_main.cpp文件完善，补充数据名称、输入参数、数据路径等信息，示例如下：
+
+### C++:
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path表示预加载图数据存放的路径
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // 指定图数据的名称
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // 以json形式输入算法参数
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+保存后在tugraph-db/plugins目录下执行`bash make_embed.sh bfs`即可在tugraph-db/plugins/cpp目录下得到bfs_procedure文件。
+
+在tugraph-db/plugins文件夹下执行`./cpp/bfs_procedure` 即可得到返回结果：
+
+```json
+{
+  "core_cost":0.025603055953979492,
+  "found_vertices":3829,
+  "num_edges":88234,
+  "num_vertices":4039,
+  "output_cost":9.059906005859375e-06,
+  "prepare_cost":0.056738853454589844,
+  "total_cost":0.0823509693145752
+}
+```
+
+参数解释同上。
+
+### Python：
+在tugraph-db/plugins文件夹下执行
+`bash make_cython_so.sh bfs`
+或在tugraph-db/plugins/cython文件夹下执行
+`python3 setup.py build_ext -i`
+得到bfs.so后，在Python中import bfs可使用，如tugraph-db/plugins/embed_main.py所示
+
+```python
+# tugraph-db/plugins/embed_main.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+```
+通过如下命令执行
+
+```bash
+python3 embed_main.py
+```
+
+输出结果与C++相同。
+
+## 4. Standalone 编译与运行
+
+该文件主要用于在终端处直接加载图数据，并运行打印输出结果。使用方法如下：
+在tugraph-db/build目录下执行`make bfs_standalone` (需要在g++默认include路径中包含boost/sort/sort.hpp)即可得到bfs_standalone文件,该文件生成于tugraph-db/build/output/algo文件夹下。
+运行方式：在tugraph-db/build目录下执行`./output/algo/bfs_standalone -–type [type] –-input_dir [input_dir] --id_mapping [id_mapping] -–vertices [vertices] --root [root] –-output_dir [output_dir]`即可运行。
+
+- `[type]`：表示输入图文件的类型来源，包含text文本文件、BINARY_FILE二进制文件和ODPS源。
+- `[input_dir]`：表示输入图文件的文件夹路径，文件夹下可包含一个或多个输入文件。TuGraph在读取输入文件时会读取[input_dir]下的所有文件，要求[input_dir]下只能包含输入文件，不能包含其它文件。参数不可省略。
+- `[id_mapping]`：当读入边表时，是否对输入数据做id映射，使达到符合算法运行的形式。1为需要做id映射，0为不需要做。该过程会消耗一定时间。参数可省略，默认值为0。
+- `[vertices]`：表示图的点个数，为0时表示用户希望系统自动识别点数量；为非零值时表示用户希望自定义点个数，要求用户自定义点个数需大于最大的点ID。参数可省略，默认值为0。
+- `[root]`：表示进行bfs的起始点id。参数不可省略。
+- `[output_dir]`：表示输出数据保存的文件夹路径，将输出内容保存至该文件中，参数不可省略。
+
+示例：
+
+### C++:
+在tugraph-db/build编译standalone算法程序
+
+```bash
+make bfs_standalone
+```
+
+在tugraph-db/build/output目录下运行text源文件
+
+```bash
+./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+得到运行结果：
+
+```text
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+结果参数解释同上。
+
+对于新的算法，运行时不了解该算法的所需参数时，可通过`./output/algo/bfs_standalone -h`进行查阅对应参数。
+
+### Python:
+Python语言的bfs拓展编译过程与embed模式无区别，在运行时通过`Standalone`接口调用，示例如下：
+```python
+# tugraph-db/plugins/standalone_main.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(input_dir=
+                             "../test/integration/data/algo/fb_unweighted",
+                             root=0)
+```
+
+通过如下命令执行
+
+```bash
+python3 standalone_main.py
+```
+
+至此，通过TuGraph对上图进行bfs运算的过程已经完成。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..79692f147e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
@@ -0,0 +1,178 @@
+# OlapBase API
+
+> 此文档主要详细介绍了OlapBase API的使用说明
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统需要的简单配置，同时结合代码对TuGraph中几个共同的重要文件和接口进行解释。
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+
+## 3. 原子操作
+
+TuGraph使用了多线程技术进行批处理操作，在这种情况下可能会出现访存冲突现象。为了保证并行计算时修改操作的正确性，TuGraph实现了原子操作。代码部分见lgraph文件夹下的lgraph_atomic.cpp文件。
+TuGraph还自定义了4个常用的原子操作。当我们需要在多线程模式下修改点的数据时，我们都应该使用原子操作来确保并行环境下修改操作的正确性。除了这4个原子操作外，用户也可以使用“cas”来构建自己的原子操作函数。
+
+- `bool cas(T * ptr, T oldv, T newv)`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `bool write_min(T *a, T b)`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `bool write_max(T *a, T b)`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `void write_add(T *a, T b)`：将b的值加到a指向的值上。
+- `void write_sub(T *a, T b)`：将a指向的值减去b的值。
+
+## 4. 点集合类ParallelBitset
+
+在使用TuGraph进行批处理操作时，需要使用点集合来表示需要处理的点。ParallelBitset实现了点集合类，以bit为单位表示点，因此能够节省大量内存。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 4.1 ParallelBitset类成员
+
+- `size_t Size()`：表示Bitmap中的点个数。
+- `ParallelBitset(size_t size)`：初始化size和data，data长度为(size >> 6)+1
+- `void Clear()`：清空集合
+- `void Fill()`：将所有点加入集合
+- `bool Has(size_t i)`：检查点i是否在集合中
+- `bool Add(size_t i)`：将点i加入集合中
+- `void Swap(ParallelBitset &other)`：和另一组ParallelBitset集合交换元素
+
+## 5. 点数组类ParallelVector
+
+在使用TuGraph进行批处理操作时，需要使用点数组来表示对点的处理结果。ParallelVector实现了点数组类。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 5.1 ParallelVector类成员
+
+- `ParallelVector(size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `T &operator[](size_t i)`：下标为i的数据
+- `T *begin()`：ParallelVector的起始指针
+- `T *end()`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `T &Back()`：ParallelVector最后一个数据
+- `T *Data()`：表示数组本身数据
+- `void Destroy()`：清空ParallelVector数组内数据并删除数组
+- `size_t Size()`：表示ParallelVector中的数据个数
+- `void Resize(size_t size)`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `void Clear()`：清空ParallelVector内数据
+- `void ReAlloc(size_t capacity)`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `void Fill(T elem)`：为ParallelVector的全部数据赋值为elem
+- `void Append(const T &elem, bool atomic = true)`：向ParallelVector结尾添加一个数据
+- `void Swap(ParallelVector<T> &other)`：和其他的ParallelVector交换数据
+- `ParallelVector<T> Copy()`：复制当前的ParallelVector数据存至Copy数组中
+
+## 6. 自定义数据结构
+
+### 6.1 基本数据类型
+
+我们自定义了点和边的数据结构表示，用于在覆盖所有点的同时节省内存空间：
+
+- `Empty`：内容为空的特殊数据类型。
+
+### 6.2 组合数据结构
+
+为了便于计算，我们根据计算场景不同，定义了几种点和边数据的数据结构，分别是：
+
+- `EdgeUnit<EdgeData>`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+  - `size_t src`：边的起始点
+  - `size_t dst`：边的终点
+  - `EdgeData edge_data`：边的权值
+- `AdjUnit<EdgeData>`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+  - `size_t neighbour`：边的邻居点
+  - `EdgeData edge_data`：边的权值
+- `AdjList<EdgeData>`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+  - `AdjUnit<T> * begin`：列表的起始指针
+  - `AdjUnit<T> * end`：列表的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对邻接表进行循环访问。
+
+## 7. 图类OlapBase
+
+图类OlapBase是TuGraph用于加载图以及进行图计算操作的主类，常用OlapBase<EdgeData>表示权值类型为EdgeData的图，代码部分见lgraph文件夹下的olap_base.hpp。本章将介绍Graph类中常用的类型和API接口。上文介绍Procedure、Embed及Standalone功能所使用的类均为该类的子类。
+
+### 7.1 基本信息
+
+- `size_t NumVertices()`：获取点数
+- `size_t NumEdges()`：获取边数
+- `size_t OutDegree(size_t vid)`：点vid的出度
+- `size_t InDegree(size_t vid)`：点vid的入度
+
+### 7.2 点集和边集及其相关操作
+
+- `ParallelVector<VertexData> AllocVertexArray<VertexData>()`：分配一个类型为VertexData的数组，大小为点个数
+- `void fill_vertex_array<V>(V * array, V value)`：将数组array中的所有元素赋值为value
+- `ParallelBitset AllocVertexSubset()`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `AdjList<EdgeData> OutEdges(size_t vid)`：获取点v的所有出边集合
+- `AdjList<EdgeData> InEdges(size_t vid)`：获取点v的所有入边集合
+- `void Transpose()`：对有向图进行图反转
+- `LoadFromArray(char * edge_array, VertexId input_vertices, EdgeId input_edges,  EdgeDirectionPolicy edge_direction_policy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+  - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+  - `input_vertices`：指定数组读入图的点个数。
+  - `input_edges`：指定数组读入图的边的条数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+### 7.3 锁机制
+
+TuGraph实现了一对锁机制，来控制程序对于点数据的访存权限。分别是：
+
+- `void AcquireVertexLock(size_t vid)`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(size_t vid)`：对点vid解锁，所有线程均可访存该锁对应的点数据
+- `VertexLockGuard GuardVertexLock(size_t vid)`：在对vid操作时，对点vid加锁，退出作用域时时自动释放锁
+
+### 7.4 批处理操作
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程。分别是：
+
+```c++
+/*
+    函数名称:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+    第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考include/lgraph/olap_base.h中具体代码
+
+    使用示例:统计数组parent数组中有出边的点个数
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+其中graph为图类OlapBase的实例化对象
+
+```C++
+/*
+    函数名称:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+    第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考/include/lgraph/olap_base.h中具体代码
+    
+    使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..1e94fb946e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,296 @@
+# OlapOnDB API
+
+> 此文档主要详细介绍了OlapOnDB API的使用说明
+
+
+## 1. 简介
+
+一般用户需要自己实现的只是将需要分析的子图抽取出来的过程。用户也可以通过使用TuGraph中丰富的辅助接口实现自己的图分析算法。
+
+该文档主要介绍Procedure及Embed的接口设计，并介绍部分常用接口，具体的接口信息参见include/lgraph/olap_on_db.h文件。
+
+## 2. 模型
+
+Procedure及Embed使用到的辅助函数主要包含在OlapOnDB类，还有一些使用频率较高的函数都会逐一介绍
+
+在TuGraph中OLAP相关的有以下常用的数据结构：
+
+1. DB图分析类 `OlapOnDB<EdgeData>`
+2. 点数组`ParallelVector<VertexData>`
+3. 点集合`ParallelBitset`
+4. 边数据结构`AdjUnit/AdjUnit<Empty>`
+5. 边集合数据结构`AdjList<EdgeData>`
+
+### 2.1 基于快照的存储结构
+
+TuGraph中的OlapOnDB类能够提供数据“快照”，即建立一个对指定数据集的完全可用拷贝，该拷贝包括相应数据在某个时间点（拷贝开始的时间点）的镜像。由于OLAP的操作仅涉及读操作而不涉及写操作，OlapOnDB会以一种更紧凑的方式对数据进行排布，在节省空间的同时，提高数据访问的局部性。
+
+### 2.2 BSP计算模型
+
+TuGraph在计算的过程中使用了BSP（Bulk Synchronous Parallel）模型，使得该过程能够并行执行，极大的提高了程序运行效率。
+
+BSP计算模型的核心思路为超步（Super Step）的提出和使用。在OlapOnDB创建后，在该数据上的计算分为多个超步，比如PageRank，分为多轮迭代，每轮迭代就是一个超步。不同超步之间用存在显式同步，从而保证所有线程在完成同一超步后同时进入下一个超步。在一个超步内部，所有的线程异步执行，利用并行提升计算效率。
+
+利用BSP计算模型能够有效避免死锁，通过障碍同步的方式能够以硬件方式实现粗粒度的全局同步，使得图计算能够并行化执行，而程序员无需在同步互斥上大费周章。
+
+## 3. 算法举例
+
+在这里对PageRank算法分块做解释，大体上分为主函数`Process`和PageRank算法流程`PageRank`函数
+
+### 3.1 主函数
+
+主函数输入有三个参数，`TuGraph`数据库参数`db`，从网页端获取的请求`request`，给网页端的返回值`response`，整体流程可以分为一下几步：
+
+1. 相关参数的获取
+2. 快照类的创建
+3. PageRank算法主流程
+4. 网页端返回值的获取和发送
+
+```C++
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+    
+    // 从网页端请求中获取迭代次数（num_iterations），
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // 读事务的创建以及快照类的创建
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+	
+    // 创建pr数组用于存储每个节点的pr值
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank算法主流程，获取每个节点的pagerank值
+    PageRankCore(olapondb, num_iterations, pr);
+    
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        函数用途：从所有节点中获取pagerank值最大的节点编号
+    
+        函数流程描述：该函数对点集合all_vertices中所有为1的位对应的节点vi（又称为活跃点）执行Func A，再将Func A的返回值作为Func B的第二个输入参数，得到局部最大值（因为第一个输入参数为0，因此实际上返回值就是每个节点的pagerank值），最后再将所有线程的返回值汇总，再次 执行Func B得到全局返回值，并存入max_pr_vi变量中
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+        
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+        
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+    
+    // 网页端返回值的获取和发送
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2 PageRank算法流程
+
+`pagerank`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关数据结构的初始化
+1. 每个节点pagerank值的初始化
+1. 每个节点pagerank值的计算，活跃点为所有点（意味着所有点都需要计算pagerank值）
+1. 得到每个节点经过`num_iterations`次迭代后的pagerank值
+
+```C++
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+    
+    // 相关数据结构的初始化
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // 每个节点pagerank值的初始化，和该节点的出度成反比
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // 总迭代过程
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            函数用途：计算所有节点的pagerank值
+
+            函数流程描述：该函数用于计算所有节点的pagerank值，对all_vertices中所有为1的位对应的节点vi执行Func C，得到本轮迭代中vi的pagerank值，并返回vi节点的pagerank变化值，最终经过函数内部处理汇总所有活跃节点的总变化值并返回，该值被存储在delta变量中
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // 从邻居中获取当前节点的pagerank值
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank值计算核心公式
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+    
+                    // 相关中间变量统计
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // 将本轮迭代得到的pagerank值输出作为下一轮迭代的输入
+        curr.Swap(next);
+    }
+}
+```
+
+## 4. 其他常用函数功能描述
+
+### 4.1 事务的创建
+
+```C++
+//读事务的创建
+auto txn = db.CreateReadTxn();
+
+//写事务的创建
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2 并行化创建有向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3 并行化创建无向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED
+)
+```
+
+### 4.4 获取出度
+
+```C++
+size_t OutDegree(size_t vid)
+```
+
+### 4.5 获取入度
+
+```C++
+size_t InDegree(size_t vid)
+```
+
+### 4.6 获取出边集合
+
+```C++
+/*
+    函数名称：AdjList<EdgeData> OutEdges(size_t vid)
+    数据结构:
+        AdjList 可以理解为类型为AdjUnit结构体的数组
+        AdjUnit 有两个成员变量： 1. size_t neighbour 2. edge_data，其中neighbour表示该出边指向的目标节点编号，如果为有权图，则edge_data数据类型和输入文件中边的权重值相同，否则数据类型为Empty
+
+    使用示例：输出节点vid的所有出度邻居
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7 获取入边集合
+
+```C++
+AdjList<EdgeData> InEdges(size_t vid)
+
+// 使用示例：输出节点vid的所有入度邻居
+for (auto & edge : olapondb.InEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8 获取TuGraph中节点对应OlapOnDB的节点编号
+
+```C++
+size_t OriginalVid(size_t vid)
+
+// 备注： TuGraph中输入的节点编号可以是非数字，比如人名等，在生成OlapOnDB子图的时候，会将人名等转化为数字进行后续处理，因此该方法可能不适用于某些特定场景
+```
+
+### 4.9 获取OlapOnDB中节点对应TuGraph的节点编号
+
+```C++
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10 活跃点的描述
+
+活跃点指的是在批处理函数中需要处理的点，在本例子中只是输出了活跃点的编号，并且汇总活跃点的数量：
+
+```C++
+ParallelBitset temp = 000111;	//当前活跃点为3，4，5号点
+
+size_t delta = ForEachActiveVertex<double>(
+    //void c
+    [&](size_t vi) {
+        printf("active_vertexId = %lu\n",vi);
+        return 1;
+    },
+    all_vertices
+);
+```
+
+函数的运行结果显而易见，因为多线程的关系，一下输出顺序可能有所变化：
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+局部返回值均为1，该函数会在保证线程安全的情况下将所有的局部返回值累加得到最终的返回值，并存储在`delta`变量中，该值最终为3
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..1ece4cc8e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,202 @@
+# OlapOnDisk API
+
+> 此文档主要详细介绍了OlapOnDisk API的使用说明
+
+    
+## 1. 简介
+
+TuGraph的Standalone模式可用于加载图数据文件，其中图数据文件来源可包含text文本文件、BINARY_FILE二进制文件和ODPS源。在该模式下，TuGraph可实现多数据来源快速加载成图，然后在该图上运行如BFS、WCC、SSSP等迭代式算法，并输出最终结果至终端。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph内置了大量的常见图分析算法和丰富的辅助接口，因此用户几乎不需要自己实现具体的图计算过程，只需要在实现自己的存储过程的时候将相应算法库的头文件(.h)包含到自己的程序中，并在编译阶段链接自己的动态库文件即可。
+
+该文档主要介绍了Standalone的常用接口，使用到的辅助函数主要包含在OlapOnDB类。同时为帮助用户理解方便，对BFS算法进行举例说明。
+
+## 2. 算法举例
+
+在这里对BFS算法分块做解释，大体上分为主函数`main`、BFS算法流程`BFSCore`函数和配置类MyConfig。
+
+### 2.1 头文件
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //使用 TuGraph 时需要包含的头文件
+#include "./algo.h"   //包含各种算法逻辑函数的头文件
+```
+
+在使用 TuGraph 实现图数据文件计算应用时，一般首先建立StandaloneGraph类对象graph，将图文件数据加载进graph中，之后通过调用图逻辑函数实现图计算过程，最后对图计算的结果进行打印输出。
+
+### 2.2 配置类MyConfig
+
+MyConfig配置类函数用于提供算法逻辑计算时所需的配置信息，继承于ConfigBase<EdgeData>,其中EdgeDate可根据加载图类型不同选择Empty（无权图）、int（带权图权重为整数）或者double（带权图权重为double）类型。
+
+MyConfig配置类一般根据算法不同，需要额外配置信息如下：
+
+1.算法所需参数
+2.算法名称
+3.配置类内Print函数
+其余公用成员继承与ConfigBase，可参考src/olap/olap_config.h查阅。
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // 算法所需参数初始化
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // 配置文件接受命令行参数，该用例会顺次读取命令行调用算法时的参数，优先使用用户指定数值，若用户并未指定则选择默认参数。
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+### 2.3 主函数
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // 统计内存消耗类MemUsage实例化
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // 配置类MyConfig实例化
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk类实例化
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // 统计图加载消耗时间
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // 创建数组用于统计某节点是否遍历过
+    auto parent = graph.AllocVertexArray<size_t>();
+    // 宽度优先搜索算法，返回图内root_vid根结点连接的节点个数
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // 打印相关信息至终端
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+### 2.4 bfs算法流程
+
+`bfs`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关定义、数据结构的初始化
+2. 使用批处理函数对每个节点进行循环计算，每一轮找到与当前节点相邻的全部节点，并在该轮次终止时进行交换。
+3. 直到找到全部节点，返回节点个数discovered_vertices。
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //分配数组，active_in用于存放上一循环阶段已找到的节点
+  active_in.Add(root);            //把跟节点加入数组中
+  auto active_out = graph.AllocVertexSubset();  //分配数组active_out用于存放当前循环阶段找到的节点
+  parent.Fill((size_t)-1);               //将parent数组中的节点赋值为-1，-1表示未被找到
+  parent[root] = root;
+  size_t num_activations = 1;       //表示当前循环阶段找到的节点个数
+  size_t discovered_vertices = 0;    //表示当前循环阶段找到节点的总个数
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations表示当前循环阶段找到的节点个数
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices表示当前循环阶段找到节点的总个数
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //每一次循环从根节点出发，查找邻近的相邻节点，对其parent值改变，并num_activations+1操作
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //存放当前循环阶段找到的节点
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // 返回全部节点数
+  return discovered_vertices;
+}
+```
+
+## 3. 其他常用函数功能描述
+
+### 3.1 图加载
+
+TuGraph-Standalone对于图数据文件的加载来源主要分为三大类：文本文件、二进制文件和ODPS。二进制文件为将边数据的二进制表示按顺序排列的文件，能够节省大量存储空间。其加载函数分为三种，分别是：
+
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：图数据文件的加载方式，包含两个参数，其含义分别表示：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。其中DUAL_DIRECTION为默认的图加载方式。
+  DUAL_DIRECTION : 输入文件为非对称图，加载图为非对称图。
+  MAKE_SYMMETRIC : 输入文件为非对称图，加载图为对称图。
+  INPUT_SYMMETRIC : 输入文件为对称图，加载图为对称图。
+  对应的详细介绍见lgraph文件夹下的olap_config.h文件的`enum EdgeDirectionPolicy`。
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：将文件中的点-数据对按照点id的顺序加载到数组中。各参数表示意义分别为：
+  - `array`：待读入数据的数组
+  - `path`：读取文件的路径，文件中每行表示一对点-数据对
+  - `parse_line`：用户自定义函数，告诉系统如何将一行文本数据解析为一个点-数据对。
+
+
+### 3.2 图写入
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：把array中数据写回文件中，各参数表示意义分别是：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `array`：待写入数据的数组
+  - `array_size`：待写入数据的数字长度
+  - `name`：算法名称
+  - `filter_output`：写入数据规则函数，待写入数据需要满足该函数的要求。
+
+### 3.3 图解析函数
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：对图数据文件进行解析，加载图为无权图。
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：对图数据文件进行解析，加载图为有权图，权重数据类型可以通过修改<EdgeData>指定。
+
+该函数可通过MyConfig类定义时的构造函数parse_line进行指定。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md
new file mode 100644
index 0000000000..1681de3e44
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md
@@ -0,0 +1,428 @@
+# Python Olap API
+
+> 本文档主要介绍 OlapBase OlapOnDB 和 OlapOnDisk 在Python中的API用法
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统Python接口需要的简单配置，同时结合代码对TuGraph Python API进行解释。关于ParallelBitset、OlapBase各类的作用，详见olap-base-api.md，olap-on-db-api.md和olap-on-disk-api.md
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+- Cython，版本要求3.0.0以上，已测试可运行版本为3.0.0a11
+
+## 3. Cython
+Cython是一种高效的编程语言，是Python的超集。Cython能将py文件翻译为C/C++代码后编译为Python拓展类，在Python中通过import调用。在TuGraph中，所有的Python plugin都由Cython编译为Python拓展类后使用。
+
+Cython的Pure Python模式在保证Python语法的同时具有C/C++的性能，TuGraph Python接口均使用Cython实现。
+
+[Cython 文档](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+见plugins/cython/olap_base.pxd文件，用法与功能基本与C++接口相同，olap_base.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### 原子操作
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `write_min[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_max[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_add[T](a: cython.pointer(T), b: T)-> cython.bint`：将b的值加到a指向的值上。
+- `write_sub[T](a: cython.pointer(T), b: T)-> cython.bint`：将a指向的值减去b的值。
+
+### 点集合类ParallelBitset
+- `Size()-> size_t`：表示Bitmap中的点个数。
+- `ParallelBitset(size: size_t)`：初始化size和data，data长度为(size >> 6)+1
+- `Clear()-> cython.void`：清空集合
+- `Fill()-> cython.void`：将所有点加入集合
+- `Has(size_t i)-> cython.bint`：检查点i是否在集合中
+- `Add(size_t i)-> cython.bint`：将点i加入集合中
+- `Swap(ParallelBitset &other)-> cython.void`：和另一组ParallelBitset集合交换元素
+
+### 点数组类ParallelVector
+- `ParallelVector[T](size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `operator[](i: size_t)-> T`：下标为i的数据
+- `begin()-> cython.pointer(T)`：ParallelVector的起始指针
+- `end()-> cython.pointer(T)`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `Back()-> T`：ParallelVector最后一个数据
+- `Data()-> cython.pointer(T)`：表示数组本身数据
+- `Destroy()-> cython.void`：清空ParallelVector数组内数据并删除数组
+- `Size()-> size_t`：表示ParallelVector中的数据个数
+- `Resize(size: size_t)-> cython.void`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `Clear()-> cython.void`：清空ParallelVector内数据
+- `ReAlloc(capacity: size_t)-> cython.void`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `Fill(elem: T)-> cython.void`：为ParallelVector的全部数据赋值为elem
+- `Append(elem: T, atomic: cython.bint = true)-> cython.void`：向ParallelVector结尾添加一个数据
+- `Swap(other: ParallelVector[T])-> cython.void`：和其他的ParallelVector交换数据
+- `Copy()-> ParallelVector[T]`：复制当前的ParallelVector数据存至Copy数组中
+
+### 自定义数据结构
+- `Empty`：内容为空的特殊数据类型。
+- `EdgeUnit[EdgeData]`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+    - `src: size_t`：边的起始点
+    - `dst: size_t`：边的终点
+    - `edge_data: EdgeData`：边的权值
+- `AdjUnit[EdgeData]`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+    - `neighbour: size_t`：边的邻居点
+    - `edge_data: EdgeData`：边的权值
+- `AdjList[EdgeData]`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+    - `begin()-> cython.pointer(AdjUnit[T])`：列表的起始指针
+    - `end()-> cython.pointer(AdjUnit[T])`：列表的结束指针。
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: 下标为i的数据
+
+### 图类OlapBase
+- `NumVertices()-> size_t`：获取点数
+- `NumEdges()-> size_t`：获取边数
+- `OutDegree(size_t vid)-> size_t`：点vid的出度
+- `InDegree(size_t vid)-> size_t`：点vid的入度
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`：分配一个类型为VertexData的数组，大小为点个数
+- `AllocVertexSubset()-> ParallelBitset`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有出边集合
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有入边集合
+- `Transpose()-> cython.void`：对有向图进行图反转
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+    - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+    - `input_vertices`：指定数组读入图的点个数。
+    - `input_edges`：指定数组读入图的边的条数。
+    - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`：对点vid解锁，所有线程均可访存该锁对应的点数据
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程，在Python中与C++使用方法稍有不同。
+
+```python
+# 函数名称:ProcessVertexInRange[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           lower: size_t, upper: size_t,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#     函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+#     第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#     具体实现请参考include/lgraph/olap_base.h中具体代码
+#
+#     使用示例:统计数组parent数组中有出边的点个数
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython. pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython. pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+其中g为图类OlapBase的实例化对象
+
+```python
+# 函数名称:ProcessVertexActive[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           active: ParallelBitset,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#   函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+#   第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#   具体实现请参考/include/lgraph/olap_base.h中具体代码
+#
+# 使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self.graph.OutDegree(vi)
+        dst: size_t
+        edges = self.graph.OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbour
+            printf("node %lu has neighbour %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+如上面两个例子所展示，在Python中ProcessVertexActive与ProcessVertexInRange比在C++中额外需要一个算法类指针参数，Work函数一般也作为该算法类的成员函数，满足Work函数访问成员变量的需求（如图graph，点数组parent），在调用批处理函数时将Work函数和算法类的self指针传入批处理函数。
+
+其中Work函数会在多线程中调用，因此加上修饰器`@cython.nogil`释放Python全局解释锁，在多线程执行的代码中（例如批处理函数中的Work函数，`cython.parallel.prange`中），不能包含Python对象，最好通过`dst: type`或者`dst = cython.declare(type)`的方式声明变量为C/C++类型。
+
+### 图类OlapOnDB:
+并行化创建有向图：
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+并行化创建无向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING创建有向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### 图类OlapOnDisk
+
+#### ConfigBase：
+- `ConfigBase()`: 构造函数
+- `std::string input_dir`: 图边表数据路径
+- `std::string output_dir`: 输出结果路径
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: 读入图数据
+
+
+## 5. lgraph_db API
+见plugins/cython/lgraph_db.pxd与lgraph_db_python.py文件。
+
+lgraph_db.pxd中接口用法与功能基本与C++接口相同，lgraph_db.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: 获取点的vid
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: 设置用户
+- `SetUser(user: std::string)-> cython.void`: 设置用户
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: 创建GraphDB
+
+### GraphDB：
+- `CreateReadTxn()-> Transaction`: 创建只读事务
+- `CreateWriteTxn()-> Transaction`: 创建写事务
+- `ForkTxn(txn: Transaction)-> Transaction`: 复制事务，只能复制读事务
+
+### Transaction：
+```
+GetVertexIndexIterator(
+                label: std::string,
+                field: std::string,
+                key_start: std::string,
+                key_end: std::string)-> VertexIndexIterator
+```
+获取索引迭代器。迭代器的field值为 [key_start, key_end]。所以在key_start=key_end=v时，返回指向field值为v的点的迭代器
+
+lgraph_db_python.py是lgraph_db.pxd中C++类 Galaxy与GraphDB的包装，将C++类包装为Python类，将lgraph_db_python.py编译为Python拓展后，可以直接在Python文件或Python命令行中`import lgraph_db_python`访问lgraph_db_python.PyGraphDB与PyGraphDB.PyGalaxy。
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(self, user: str password: str)-> void`: 设置用户
+- `SetUser(self, user: std::string)-> void`: 设置用户
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: 创建PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)-> cython.Py_ssize_t`: C++ 类GraphDB的地址
+
+## 6. 算法插件示例
+下面为Python实现的BFS算法的代码示例：
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# 注释作用如下：
+# language_level=3: 使用Python3
+# cpp_locals=True: 需要c++17，使用std::optional管理Python代码中的C++对象，可以避免C++对象的拷贝构造
+# boundscheck=False: 关闭索引的边界检查
+# wraparound=False: 关闭负数下标的处理（类似Python List）
+# initializedcheck=False: 关闭检查内存是否初始化，关闭检查后运行性能更快
+# language = c++: 将此py文件翻译为C++而不是C文件，TuGraph使用大量模板函数，所以都应该使用C++
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# 从plugins/cython/ 中cimportolap_base.pxd与lgraph_db.pxd, 类似C++中#include "xxx.h"
+
+from cython.cimports.libc.stdio import printf
+# 类似C++中#include <stdio.h>
+# 其他常见的还有cython.cimports.libcpp.unordered_map等
+
+import time
+import lgraph_db_python
+
+
+@cython.cclass
+# cython.cclass 表示BFSCore为C类型的Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty])表示OlapBase[Empty]的指针，类似C++中OlapBase[Empty]*
+    # cython提供了常见类型的指针，如cython.p_int, cython.p_char等，表示int*, char*, ...
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t 声明root为C++ size_t类型变量，等效于root = cython.declare(size_t)
+    # 不声明类型的变量为Python object类型
+    # 声明变量类型会大幅提高性能，同时在多线程部分，只有C/C++类型的变量可以访问
+
+    @cython.cfunc
+    # cython.cfunc 表示Work为C类型的函数，参数与返回值应声明
+    # cfunc性能好，能接受C/C++对象为参数、返回值，但是不能在其他python文件中调用
+    # 类似的有cython.ccall，如Standalone函数，可以在其他python文件中调用
+    @cython.nogil
+    # cython.nogil 表示释放Python全局解释锁，在nogil修饰的部分，不能访问Python对象
+    # 在多线程部分，都应有nogil修饰器
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) 表示禁用异常传播，将忽略函数内部引发的Python异常
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbour
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 表示dst没有被bfs访问过
+                if self.active_out.Add(dst):
+                    # 将dst设置为为活跃节点；ParallelBitmap.Add为原子操作，防止重复计算
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython.size_t:
+        self.graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self.parent.Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self.active_in.Add(self.root)
+        while num_activations > 0:
+            self.active_out.Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self.active_out.Swap(self.active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time.time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # 并行创建OlapOnDB
+    # Cython不支持如 *db 的解引用操作，通过db[0]来解引用
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # 通过 GetVertexIndexIterator 根据root节点label名和filed名与filed值（root_id）
+    # 获取root节点的迭代器，通过迭代器获取vid，在无ID_MAPPING时，该vid与OlapOnDB中的id相同
+    cost = time.time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time.time()
+    count = a.run(cython.address(olapondb), root_vid)
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb.NumVertices()
+    response["num_edges"] = olapondb.NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone为Standalone模式下插件入口，用cython.ccall修饰
+    # 可以任意设置参数，相应修改plugins/cython/standalone_main.py即可
+    cost = time.time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config为C++类，config.input_dir为std::string，Python str需要encode才能传给std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # 读入图
+    cost = time.time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time.time()
+    a = BFSCore()
+    count = a.run(cython.address(graph), root)
+    # cython.address(graph)，取址，类似C++中&graph
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices".format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process为embed模式和procedure模式下插件入口，用cython.ccall修饰
+    # Process函数必须名为Process，参数为lgraph_db_python.PyGraphDB与bytes
+    # 返回值必须为(bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # 获取PyGraphDB中GraphDB对象的地址，转换为指针后传递
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..bc0fdb0e62
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
@@ -0,0 +1,189 @@
+# 内置算法
+
+> 此文档主要详细介绍了TuGraph内置的算法程序，社区版6种算法可参考基础算法报
+
+## 简介
+
+TuGraph目前包含以下6个基础算法28种扩展算法，共34个图算法：
+
+### 基础算法包：
+| 中文算法名 | 英文算法名 | 程序名
+|  :----:  | :----: | :----: |
+| 广度优先搜索 | Breadth-First Search  | bfs 
+| 网页排序 | Pagerank | pagerank 
+| 单源最短路径 | Single-Source Shortest Path | sssp 
+| 弱连通分量 | Weakly Connected Components | wcc 
+| 平均集聚系数 | Local Clustering Coefficient  | lcc
+| 标签传播 | Label Propagation Algorithm | lpa 
+
+### 扩展算法包：
+| 中文算法名 | 英文算法名 | 程序名
+| :----: | :----: | :----: |
+| 全对最短路径 | All-Pair Shortest Path  | apsp 
+| 介数中心度 | Betweenness Centrality | bc 
+| 置信度传播 | Belief Propagation | bp
+| 距离中心度 | Closeness Centrality | cc 
+| 共同邻居 | Common Neighborhood | cn 
+| 度数关联度 | Degree Correlation  | dc
+| 直径估计 | Dimension Estimation | de 
+| EgoNet算法 | EgoNet | en
+| 超链接主题搜索 | Hyperlink-Induced Topic Search | hits
+| 杰卡德系数 | Jaccard Index | ji
+| K核算法 | K-core | kcore
+| 鲁汶社区发现 | Louvain | louvain 
+| 多源最短路径 | Multiple-source Shortest Paths | mssp
+| 个性化网页排序 | Personalized PageRank | ppr
+| 强连通分量 | Strongly Connected Components | scc 
+| 监听标签传播 | Speaker-listener Label Propagation Algorithm | slpa
+| 两点间最短路径 | Single-Pair Shortest Path | spsp
+| 三角计数 | Triangle Counting | triangle 
+| 信任指数排名 | Trustrank | trustrank 
+| 带权重的标签传播 | Weighted Label Propagation Algorithm | wlpa 
+| 带权重的网页排序 | Weighted Pagerank Algorithm | wpagerank 
+| 最大独立集算法 | Maximal independent set | mis 
+| sybil检测算法 | Sybil Rank | sybilrank 
+| 子图匹配算法 | Subgraph Isomorphism | subgraph_isomorphism
+| 模式匹配算法 | Motif | motif
+| k阶团计数算法 | Kcliques | kcliques
+| k阶桁架计数算法 | Ktruss | ktruss 
+| 莱顿算法 | Leiden | leiden
+
+## 基础算法包
+
+### 广度优先搜索
+
+广度优先搜索实现了Breadth-first Search算法，从根点开始，沿着图的宽度遍历所有可访问点。返回结果为遍历点个数。算法内容请参考 [https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 网页排序
+
+网页排序程序实现了常用的Pagerank算法。该算法根据图中边和边权值计算所有点的重要性排名，PageRank值越高，表示该点在图中的重要性越高。计算时以点数量的倒数为各点初始Rank值，然后将点的Rank值按照出边平均传递到相邻点，重复该传递过程直到满足给定的收敛阈值或达到给定迭代轮数。每轮传递结束后，所有点的Rank值会有一定的的比例随机传递到任意点上。算法内容请参考 [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 单源最短路径
+
+单源最短路径实现了Single Source Shortest Path算法，根据给定的源点，计算从该源点出发到其他任意点的最短路径长度。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 弱连通分量
+
+弱连通分量程序实现了Weakly Connected Components算法，该算法会计算图中所有的弱连通分量。弱连通分量是图的一个子图，子图中任意两点之间均存在可达路径。算法内容请参考[https://en.wikipedia.org/wiki/Connected_component_(graph_theory)](https://en.wikipedia.org/wiki/Connected_component_(graph_theory) "scc wiki")。
+
+### 平均集聚系数
+
+平均集聚系数程序实现了Local Clustering Coefficient算法，计算图中点之间聚集程度的系数。返回结果包括整体集聚系数和点集聚系数。整体集聚系数反映了图中整体的集聚程度的评估，点集聚系数包括任意点的集聚系数，反映了该点附近的集聚程度。集聚系数越高，表示集聚程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 标签传播
+
+标签传播算法程序实现了Label Propagation Algorithm算法。该算法是基于标签传播的社区发现算法，计算对象为无权图。在标签传递时，每个点对收到的所有标签进行次数累加，在累加和最高的标签中随机选择一个。迭代收敛或执行到给定轮数后算法终止。最终输出结果为每个点的标签，标签值相同的点视为在同一社区。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+
+## 扩展算法包
+
+### 全对最短路径
+
+全对最短路径程序实现了All-Pair Shortest Path算法，计算图中任意两点间的最短路径。返回结果为任意存在路径的点对之间的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 介数中心度
+
+介数中心度程序实现了Betweenness Centrality算法，估算图中所有点的介数中心度值。介数中心度值反映了图中任一最短路径经过该点的可能性，值越高表示有越多的最短路径经过了该点。计算时需给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 置信度传播
+
+置信度传播程序实现了Belief Propagation算法。该算法给定已观测点的边缘分布，利用点之间相互传递消息的机制来估算未观测点的边缘分布。算法内容请参考[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 距离中心度
+
+距离中心度程序实现了Closeness Centrality算法，估算任意点到图中其他点的最短路径的平均长度。距离中心度越小，表示该点到其他点的平均最短距离最小，意味着该点从几何角度看更位于图的中心位置。计算时需要给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "cc wiki")。
+
+### 共同邻居
+
+共同邻居程序实现了Common Neighborhood算法，计算任意给定相邻点对之间的共同邻居数量。计算时给定待查询的若干个点对，返回结果为待查询的任意点对的共同邻居数量。
+
+### 度数关联度
+
+度数关联度程序实现了Degree Correlation算法，通过计算任意相邻点对之间的Pearson关联系数来计算图的度数关联度，可用来表征图中高度数点之间关联程度。度数关联度越高，表示图中高度数点之间的关联程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 直径估计
+
+直径估计程序实现了Dimension Estimation算法。该算法会计算图中最长的最短路径长度，用来表征图的直径大小。算法内容请参考[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### EgoNet算法
+
+EgoNet算法需要给定根点和K值，以根点为源点进行宽度优先搜索，找出所有K度以内的邻居组成的子图。找到的子图称为根点的EgoNet。
+
+### 超链接主题搜索
+
+超链接主题搜索算法实现了Hyperlink-Induced Topic Search算法，该算法假定每个点具有权威性Authority和枢纽性Hub两个属性，一个好的枢纽点应该指向许多高权威性的点，而一个良好的权威点应该被许多高枢纽型的点指向。算法将返回每个点的权威性值和枢纽性值。算法内容请参考[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 杰卡德系数
+
+杰卡德系数程序实现了Jaccard Index算法。该算法计算了给定点对之间的Jaccard系数，可用来表示这两个点的相似度。Jaccard系数越高，表示点对之间的相似程度越高。计算时给定带查询的若干点对，返回结果为这些点对的Jaccard系数。算法内容请参考[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### k核算法
+
+k核算法实现了k-core算法。该算法计算所有点的核数，或找出图中所有的K核子图。K核子图是一种特殊子图，子图中任意点度数都不小于给定K值。算法内容请参考 [https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)](https://en.wikipedia.org/wiki/Degeneracy_(graph_theory) "kcore wiki")。
+
+### 鲁汶社区发现
+
+鲁汶社区发现程序实现了Fast-unfolding算法。该算法是基于模块度的社区发现算法，通过不断合并点社区来最大化图的模块度，能够发现层次性的社区结构。算法内容请参考 [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 多源最短路径
+
+多源最短路径程序实现了Multiple-source Shortest Paths算法，根据给定的多个源点，从这些源点出发，计算到达任意点的最短路径值。其中，多个源点到某一点的最短路径值为分别从每个源点出发到达该点的最短路径的最小值。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 个性化网页排序
+
+个性化网页排序程序实现了Personalized PageRank算法。该算法根据给定的源点，基于该源点个性化计算所有点对于源点的重要性排名。Rank值越高，表示该点对于源点越重要。与PageRank不同的是，初始化时源点Rank值为1，其余点Rank值为0；并且每轮传递结束后，Rank值会有一定的比例随即传递回源点。算法内容请参考 [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 强连通分量
+
+强连通分量程序实现了Strongly Connected Components算法。该算法计算了图中所有的强连通分量，强连通分量是图的一个子图，子图中可从任意点出发到达其他任意点。算法内容请参考[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 监听标签传播
+
+监听标签传播算法程序实现了Speaker-listener Label Propagation Algorithm算法。该算法是基于标签传播和历史标签记录的社区发现算法，是对标签传播算法的扩展。与标签传播算法不同的是，本算法会对所有点记录其历史标签，在迭代中对标签进行累加时，会将历史标签也计算在内。最终输出结果为每个点的所有历史标签记录。算法内容请参考论文：“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 两点间最短路径
+
+两点间最短路径程序实现了Bidirectional Breadth-First Search算法，在有向无权图上从起点沿着出边做正向宽度优先搜搜，从终点沿着入边做反向宽度优先搜索，通过起点和终点共同遍历到的点来确定从起点到终点的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 三角计数
+
+三角计数实现了Triangle-counting算法，计算无向图中的三角形个数，可用来表征图中点的关联程度。三角形数越多，表示图中点的关联程度越高。算法内容请参考论文：“Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study” 。
+
+### 信任指数排名
+
+信任指数排名算法实现了Trustrank算法，可以根据给定的白名单，计算任意点的信任指数。信任指数越高，表示该点为非法点的可能性越小。算法内容请参考 [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 带权重的标签传播
+
+带权重的标签传播算法程序实现了Weighted Label Propagation Algorithm算法。=与标签传播算法不同的是，标签的传递跟边的权重相关，在标签传递时，每个点会根据标签的入边进行权重累加，在累加和最高的标签中随机选择一个。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 带权重的网页排序
+
+带权重的网页排序算法程序实现了Weighted Pagerank算法。与PageRank算法不同的是，Rank值的传递跟边的权重有关，点的Rank值将按照边权重加权传递到相邻点。算法内容请参考[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 最大独立集算法
+
+最大独立集算法实现了Maximal independent set算法。最大独立集是指在这个独立集之外没有可以加入它的点。一个图可能有许多大小差异很大的 MIS，算法找出其中一个。算法内容请参考 [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### Sybil检测算法
+
+Sybil检测算法实现了Sybil Rank算法。SybilRank算法从非Sybil节点开始进行提前终止的随机游走。算法内容请参考论文：“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 子图匹配算法
+
+子图匹配算法实现了subgraph_isomorphism算法。subgraph_isomorphism算法对全图所有节点匹配子图，最后输出每个节点被匹配的次数。算法内容参考 [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 模式匹配算法
+
+模式匹配算法实现了motif算法。motif算法对指定的节点匹配k阶子图，最后输出每个指定节点每种k阶子图个数，每个k阶子图用一个64位整数表示，整数的第$i \times k + j$位为1表示子图中有边i->j。算法内容参考 [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### k阶团计数算法
+
+k阶团计数算法实现了k-cliques算法。k-cliques算法对计算图中所有的k阶完全子图的个数，最后输出每个节点所在的k阶完全子图个数。算法内容参考 [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### k阶桁架计数算法
+
+k阶桁架计数算法实现了k-truss算法。k-truss指每条边都至少是k-2个三角形的边的子图。k-truss算法找出图的k-truss子图，最后输出每个节点在子图中的邻居节点列表。算法内容参考 [https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+### 莱顿算法
+
+莱顿算法实现了了leiden算法。leiden算法是基于模块度的社区发现算法，与louvain算法优势在于leiden算法检测出社区中的断链，保证每个社区具有良好的连通性。算法内容参考 [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst
new file mode 100644
index 0000000000..bc80c68c65
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst
@@ -0,0 +1,8 @@
+分析接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
new file mode 100644
index 0000000000..47d0207278
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
@@ -0,0 +1,344 @@
+# Procedure API
+
+> 此文档主要讲解 TuGraph 的存储过程使用说明
+
+## 1.简介
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个请求并在客户端完成整个处理流程的方式，TuGraph 提供的存储过程是更简洁和高效的选择。
+
+与传统数据库类似，TuGraph 的存储过程运行在服务器端，用户通过将处理逻辑（即多个操作）封装到一个过程单次调用，并且可以在实现时通过并行处理的方式（例如使用相关的 C++ OLAP 接口以及基于其实现的内置算法）进一步提升性能。
+
+存储过程中有一类特殊的API来进行数据的并行操作，我们叫 Traversal API，见[文档](2.traversal.md)。
+
+## 2.存储过程的版本支持
+
+目前TuGraph支持两个版本的存储过程，适用于不同的场景，v3.5版本只支持v1，可通过REST或RPC接口直接调用；从v3.5版本开始支持v2，能够在图查询语言（比如Cypher）中嵌入调用，我们称之为POG（Procedure On Graph query language，APOC）。
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+| 适用场景                 | 极致性能，或者复杂的多事务管理情形       | 一般情况，与Cypher高度联动 |
+| 事务                    | 函数内部创建，可自由控制多事务          | 外部传入函数，单一事务     |
+| 签名（参数定义）          | 无                                 | 有                    |
+| 输入输出参数类型          | 不需要指定                           | 需要指定参数类型        |
+| Cypher Standalone Call | 支持                                | 支持                  |
+| Cypher Embeded Call    | 不支持                              | 支持                  |
+| 语言                    | C++/Python/Rust                    | C++                  |
+| 调用模式                 | 直接传字符串，一般为JSON               | 通过Cypher语句中的变量  |
+
+在TuGraph中，存储过程v1和v2单独管理，支持增删查，但仍不建议重名。
+
+## 3.存储过程语言支持
+
+在 TuGraph 中，用户可以动态的加载，更新和删除存储过程。TuGraph 支持 C++ 语言、 Python 语言和 Rust 语言编写存储过程。在性能上 C++ 语言支持的最完整，性能最优。
+
+注意存储过程是在服务端编译执行的逻辑，和客户端的语言支持无关。
+
+## 4.Procedure v1接口
+
+## 4.1.编写存储过程
+
+### 4.1.1.编写C++存储过程
+
+用户可以通过使用 Procedure API 或者 Traversal API 来编写 C 存储过程。一个简单的 C 存储过程举例如下：
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## 统计所有年龄为10的学生数量
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+从代码中我们可以看到，存储过程的入口函数是`Process`函数，它的参数有三个，分别为：
+
+- `db`: 数据库实例
+- `request`: 输入请求数据，可以是二进制字节数组，或者 JSON 串等其它任意格式。
+- `response`: 输出数据，可以是字符串，也可以直接返回二进制数据。
+
+`Process`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误，此时用户可以通过`response`来返回错误信息以方便调试。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`age_10`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 age_10.so，然后用户就可以将它加载到服务器中了。
+
+### 4.1.2.编写Python存储过程
+
+与 C++类似，Python 存储过程也可以调用 core API，一个简单的例子如下：
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+Python 存储过程返回的是一个 tuple，其中第一个元素是一个布尔值，表示该存储过程是否成功执行；第二个元素是一个`str`，里面是需要返回的结果。
+
+Python 存储过程不需要编译，可以直接加载。
+
+## 4.2.如何使用存储过程
+### 4.2.1.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`age_10.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`age_10.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+### 4.2.2.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+### 4.2.6.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
+
+## 5.Procedure v2接口
+
+下面的说明以 REST API 为例，介绍存储过程v2的调用。
+
+### 5.1.编写存储过程
+
+
+用户可以通过使用 lgraph API 来编写 C++ 存储过程。一个简单的 C++ 存储过程举例如下：
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   std::string &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response = std::string("error parsing json: ") + e.what();
+        return false;
+    }
+
+    Result result({{"node", LGraphType::NODE},
+                   {"salt", LGraphType::FLOAT},
+                   });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = result.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    response = result.Dump();
+    return true;
+}
+```
+
+从代码中我们可以看到：
+- 存储过程定义了一个获取签名的方法`GetSignature`。该方法返回了存储过程的签名，其中包含输入参数名称及其类型，返回参数及其类型。这使得Cypher查询语句在调用存储过程能够利用签名信息校验输入数据以及返回数据是否合理。
+- 入口函数是`ProcessInTxn`函数，它的参数有三个，分别为：
+
+- `txn`: 存储过程所处的事务，通常来说即调用该存储过程的Cypher语句所处事务。
+- `request`: 输入数据，其内容为`GetSignature`中定义的输入参数类型及其Cypher查询语句中传入的值经过json序列化后的字符串。e.g. `{num_iteration: 10}`
+- `response`: 输出数据，为保证在Cypher语言中能够兼容，用户可以通过往`lgraph_api::Result` 写入存储过程处理后的数据，最后用`lgraph_api::Result::Dump`来序列化成json格式的数据。
+
+`ProcessInTxn`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`custom_pagerank`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 custom_pagerank.so，然后用户就可以将它加载到服务器中了。
+
+
+### 5.2.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`custom_pagerank.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`custom_pagerank.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+#### 5.2.1.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+#### 5.2.5.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
new file mode 100644
index 0000000000..f5b9cfbf25
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
@@ -0,0 +1,128 @@
+# Traversal API
+
+> 此文档主要讲解 TuGraph 的存储过程中的Traversal API
+
+## 1. 简介
+
+TuGraph 强大的在线分析处理（OLAP）能力是其区别于其它图数据库的一个重要特性。
+借助 C++ OLAP API（olap_on_db.h），用户可以快速地导出一个需要进行复杂分析的子图，然后在其上运行诸如 PageRank、连通分量、社区发现等迭代式图计算过程，最后根据结果做出相应决策。
+导出和计算的过程都可以通过并行处理的方式进行加速，从而实现几乎实时的分析处理，避免了传统解决方案需要将数据导出、转换、再导入（ETL）到专门的分析系统进行离线处理的冗长步骤。
+
+TuGraph 内置了大量常用的图分析算法和丰富的辅助接口，因此用户几乎不需要自己来实现具体的图计算过程，只需在实现自己的存储过程时将相应算法库的头文件（.h 文件）包含到自己程序中，并在编译时链接相应的动态库文件（.so）即可。
+一般情况下，用户需要自己实现的只有将需要分析的子图抽取出来的过程。
+
+目前 Traversal API 仅支持 C++。
+
+## 2. 接口说明
+
+### 2.1. Snapshot
+
+C++ OLAP API 中的 Snapshot 模版类用于表示抽取出来的静态子图，其中 EdgeData 用来表示该子图上每条边所用权值的数据类型（如果边不需要权值，使用 Empty 作为 EdgeData 即可）。
+
+抽取的子图通过 Snapshot 类的构造函数来描述：
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+其中，db 为数据库句柄，txn 为事务句柄，flags 为生成时使用的选项，可选值包括以下的组合：SNAPSHOT_PARALLEL 表示导出时使用多个线程进行并行；SNAPSHOT_UNDIRECTED 表示需要将导出的图变为无向图。
+vertex_filter 是面向点的用户自定义过滤函数，返回值为 true 表示该点需要被包含到待抽取的子图中，反之则表示需要被排除。
+out_edge_filter 是面向边的用户自定义过滤函数，返回值为 true 表示该边需要被包含到待抽取的子图中，反之则表示需要被排除。
+当过滤函数为缺省值时，则表示需要将所有点/边都包含进来。
+
+Snapshot 类提供的其它方法请参考详细的 C++ API 文档（olap_on_db.h）。
+
+### 2.2. Traversal
+
+图数据库中十分常见的一大类分析是基于一个或多个点出发，逐层地拓展并访问邻居。
+尽管这类分析也可以使用 Cypher 完成，但是当访问的层数较深时，其性能会受到串行解释执行的限制。
+使用 C++ Core API 编写存储过程尽管避免了解释执行，但依然受限于单个线程的处理能力。
+为了让用户能够方便地通过并行处理的方式加速这一类应用场景，我们基于 C++ OLAP API 封装了一个 Traversal 框架，用户可以直接使用其中的 FrontierTraversal 和 PathTraversal 类来完成这种逐层遍历的分析任务，具体的使用方法可以参考相应的 C++ API 文档（lgraph_traversal.h）。
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+该方法可用于找到所有满足条件（filter 返回 true）的点，当 parallel 为 true 时则会并行该查找过程。
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+该方法可用于从指定点集（frontier）中（通过 extract 方法）抽取（类型为 VertexData 的）属性，当 parallel 为 true 时会并行该抽取过程。
+
+FrontierTraversal 适用于只关注遍历扩展到的点集的情况；当用户在遍历过程或是结果中需要访问路径上的信息（路径上的点/边）时，则需要使用 PathTraversal。
+两类 Traversal 的构造函数均有三个参数，分别为数据库句柄 db、事务句柄 txn 和选项 flags。
+选项的可选值包括以下的组合：TRAVERSAL_PARALLEL 表示遍历时使用多个线程并行；TRAVERSAL_ALLOW_REVISITS 表示遍历时允许重复地访问点（PathTraversal 隐含了该选项）。
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+两类 Traversal 设置遍历的起始点/点集有上述三种方式，前两种通过点 ID 直接指定，最后一种方式则类似于 FindVertices。
+
+两类 Traversal 的遍历都是从当前层的点集合出发，根据使用的扩展函数访问每条出边/入边/出边和入边，通过用户自定义的过滤函数决定扩展是否成功，若成功则将邻居点/追加了该条边的路径加入下一层的点/路径集合。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+上述为 FrontierTraversal 的三种遍历方式，即从当前的点集合出发，对集合中的每个点，依次访问每条出边/入边/出边和入边，若满足用户自定义的过滤条件（其中，edge_filter 为面向边的过滤函数，neighbour_filter 则为面向邻居点的过滤函数），则将邻居点加入新的点集合。
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+当前点集合的扩展结束后，新的点集合可以通过上述方法取得。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+PathTraversal 的三种遍历方式与 FrontierTraversal 类似，只是用户自定义的过滤函数中增加了两个参数，其中：Path 包含了到新扩展的这条边之前的路径，IteratorHelper 可用于将路径中的点/边转为数据库中对应的迭代器，相关文档可参考对应的 C++ API 文档。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
new file mode 100644
index 0000000000..abc5ce2ccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
@@ -0,0 +1,5 @@
+base64_encode
+===================================
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
new file mode 100644
index 0000000000..b321c843d6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
@@ -0,0 +1,5 @@
+lgraph_result
+===================================
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
new file mode 100644
index 0000000000..0f53077dbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
@@ -0,0 +1,5 @@
+lgraph_rpc_client
+===================================
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
new file mode 100644
index 0000000000..d7a9d7b97c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
@@ -0,0 +1,5 @@
+lgraph_traversal
+===================================
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
new file mode 100644
index 0000000000..4b0be46a21
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
@@ -0,0 +1,5 @@
+lgraph_txn
+===================================
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
new file mode 100644
index 0000000000..4047340ef0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
@@ -0,0 +1,5 @@
+lgraph_types
+===================================
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
new file mode 100644
index 0000000000..12814e7618
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
@@ -0,0 +1,5 @@
+lgraph_utils
+===================================
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
new file mode 100644
index 0000000000..572f9ae7c0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
new file mode 100644
index 0000000000..5bfa8a1dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
new file mode 100644
index 0000000000..8680a93ee9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
@@ -0,0 +1,5 @@
+olap_base
+===================================
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
new file mode 100644
index 0000000000..9ce3afba80
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
@@ -0,0 +1,5 @@
+olap_on_db
+===================================
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
new file mode 100644
index 0000000000..5bed2e061c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
@@ -0,0 +1,5 @@
+lgraph
+===================================
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
new file mode 100644
index 0000000000..82bf0941c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
@@ -0,0 +1,5 @@
+olap_profile
+===================================
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
new file mode 100644
index 0000000000..8723e9f1d0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
@@ -0,0 +1,5 @@
+lgraph_atomic
+===================================
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
new file mode 100644
index 0000000000..ec8af7bb8f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
@@ -0,0 +1,5 @@
+lgraph_date_time
+===================================
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
new file mode 100644
index 0000000000..07d6076327
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
@@ -0,0 +1,5 @@
+lgraph_db
+===================================
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
new file mode 100644
index 0000000000..07f4be3f67
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
new file mode 100644
index 0000000000..5be9e6547e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
new file mode 100644
index 0000000000..70a0bd4cbf
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
@@ -0,0 +1,5 @@
+lgraph_exceptions
+===================================
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
new file mode 100644
index 0000000000..a4f9af0582
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
@@ -0,0 +1,5 @@
+lgraph_galaxy
+===================================
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
new file mode 100644
index 0000000000..445ef76484
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
@@ -0,0 +1,8 @@
+C++存储过程接口
+===================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..7faee6873a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
@@ -0,0 +1,25 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python存储过程接口
+====================================
+Version: 3.5.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+介绍
+------------------
+与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。
+
+这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。
+
+接口
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..6f3114566f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
@@ -0,0 +1,19 @@
+# Rust 存储过程
+
+## 1. 介绍
+Rust 存储过程目前仅支持v1版本，TuGraph能够支持一切编译成动态库的语言作为插件。Rust语言作为系统编程语言的新起之秀，在安全性上、可靠性以及人体工程学上相较于C++具有较大优势。
+
+我们提供了TuGraph的[Rust binding]库来支持在Rust中调用lgrahp api，同时提供[tugraph-plugin-util] 工具库来帮助大家更加简洁地编写Rust插件代码。
+
+[Rust binding]: https://crates.io/crates/tugraph
+[tugraph-plugin-util]: https://crates.io/crates/tugraph-plugin-util
+
+## 2. 如何使用
+
+Rust存储过程的使用分三步：
+* 编译，从rust源码编译出so库。我们准备了一份一站式的插件编写教程，从IDE的插件安装，环境配置，到编译，详细参考`rust-tugraph-plugin-tutorial`。
+* 加载，将so库加载到服务端，可以通过REST或RPC接口，这一步和C++库的使用方式类似，可以参考[文档](1.procedure.md#4.Procedure v1接口)。
+* 运行，和c++ procdure使用方式相同，不在赘述。
+
+## 3.API文档
+Rust社区习惯，所有的代码和文档都可以从[`crates.io`](https://crates.io/crates/tugraph )以及[`docs.rs`](https://docs.rs/tugraph/latest/tugraph )找到。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile
new file mode 100644
index 0000000000..32b39913ad
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 3.5.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = Chinese
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst
new file mode 100644
index 0000000000..1fbd71dffb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst
@@ -0,0 +1,12 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure/index.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
new file mode 100644
index 0000000000..81b77be986
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
new file mode 100644
index 0000000000..dae2eb6e32
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
@@ -0,0 +1,2916 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+**注意：除"登陆"、"查询"和"存储过程"外，其余接口自 **2023年4月30日** 起将不再提供支持，统一使用Cypher接口提供服务。**
+
+## 2.请求与数据格式
+
+### 2.1请求
+
+TuGraph 支持 HTTP GET/POST/PUT/DELETE 请求。其中：
+
+- GET 请求用于只读请求，如读取点属性，边属性等操作；
+- POST 请求用于创建实体，提交 Cypher，以及加载和调用存储过程；
+- PUT 请求用于修改已有实体，如修改点属性，边属性等；
+- DELETE 请求用于删除已有实体，如删除点，边等。
+
+在高可用模式下，用户可以在请求的报头(request header)中设置 `server_version` 来保证请求的服务器有足够新的数据。
+当前的 `server_version` 可以从服务器返回的报头中获取。
+
+### 2.2.数据格式
+
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.3.返回值
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 307 Temporary Redirect: 操作被重定向，一般用于高可用模式下，把操作重定向到 master 上
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 500 Internal Server Error: 服务器端错误
+
+当操作成功时，返回的 JSON 中包含操作的返回值。当操作重定向时，返回的 HTTP 报头中的 `location` 域包含重定向目的地址。
+当发生输入错误或者服务器错误时，返回的 JSON 中包含 `error_message` 域，其内容是错误提示。
+
+在高可用模式下，服务器还会在报头中设置 `server_version`，以告知客户端当前服务器的数据版本号。当客户端在不同的服务器之间切换时，该数据版本号可以保证客户端不会读到错误的历史数据。
+
+### 2.4.URI格式
+
+TuGraph REST API 提供以下功能：Service Root, login, info, label, index, node, relationship, cypher, cpp_plugin, 以及 python_plugin。
+各功能使用的 URI 格式如下：
+
+| URI     | 说明                 |
+| ------- | -------------------- |
+| /web    | web 可视化界面       |
+| /cypher | cypher 请求          |
+| /acl    | 权限控制             |
+| /user   | 用户管理             |
+| /login  | 用户登录             |
+| /info   | 数据库状态及提示信息 |
+| /task   | 任务管理             |
+| /db     | 子图操作             |
+
+其中子图操作又分为：
+
+| URI                              | 说明                 |
+| -------------------------------- | -------------------- |
+| /db                              | 子图的创建，删除     |
+| /db/_{graph_name}_/node          | 点操作             |
+| /db/_{graph_name}_/relationship  | 边操作               |
+| /db/_{graph_name}_/label         | Label 相关操作       |
+| /db/_{graph_name}_/index         | 索引相关操作         |
+| /db/_{graph_name}_/cypher        | 子图相关 cypher 操作 |
+| /db/_{graph_name}_/cpp_plugin    | C++存储过程          |
+| /db/_{graph_name}_/python_plugin | Python 存储过程      |
+| /db/_{graph_name}_/import        | 在线导入             |
+| /db/_{graph_name}_/misc          | 其它操作             |
+
+## 3.登录
+
+TuGraph 提供基于 JWT 的用户认证方式，可以使用 HTTP 或 HTTPS 协议进行传输。系统默认使用 HTTP 协议，如果需要使用 HTTPS，需要在 lgraph.json 配置文件中将 ssl_auth 设为 1。
+
+### 3.1.登录
+
+用户通过用户名和密码发送登录请求。登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**: `/login`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.2.身份刷新
+Token失效后，前端发起刷新token接口，后端验证token合法性。初次登录后，1小时内有效，需刷新使用。即使刷新，24小时后也会强制退出，需要重新登陆。
+验证通过，生成新的token；验证失败返回状态码401。
+
+- **URI**: `/refresh`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.修改Token有效期
+修改Token有效期，需要传输jwt，refresh_time和expire_time三个参数，其中jwt用于校验用户身份，refresh_time和expire_time等于0时，有效期为无期限，超过refresh_time时，需要调用refresh接口获取新的Token;超过expire_time时，需要重新登录。
+
+- **URI**: `/update_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+  | refresh_time | 有效时间（默认设置为0） | Int64 |
+  | expire_time | 有效时间（默认设置为0） | Int64 |
+
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0,
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.查询Token有效期
+查询Token有效期，需要传输jwt，用于校验用户身份，返回，refresh_time和expire_time，其中refresh_time表示刷新时间，超过时需要调用refresh接口获取新的Token;expire_time表示过期时间，超过时需要重新登录。
+- **URI**: `/get_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+
+- **RESPONSE**:  如果成功，返回"refresh_time"和"expire_time"。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+
+### 3.5.登出
+用户登出，同时删除token。
+
+- **URI**: `/logout`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/logout
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 4.查询
+
+URI 格式为
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.调用Cypher
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 列表 |
+  | elapsed | 运行时间（秒） | 浮点数 |
+  | header | 返回结果的表头 | 列表 |
+  | size | 结果数 | 整型 |
+
+其中 header 是一个列表，每一元素格式如下：
+
+| 域名 | 说明                                        | 类型   |
+| ---- | ------------------------------------------- | ------ |
+| name | 列名                                        | 字符串 |
+| type | 列数据类型，0 为标量，1 为点 id，2 为向量 |        |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.调用带参数的 Cypher
+
+Cypher 支持使用参数进行查询。当调用带参数的 Cypher 查询时，TuGraph 会缓存该查询的
+执行计划（execution plan），以加速后续同类查询的速度。
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+  | parameters | 参数 | 列表 |
+
+- **RESPONSE**:
+
+与 [调用 Cypher](#%E8%B0%83%E7%94%A8Cypher) 相同。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+
+## 5.存储过程
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.加载存储过程
+
+TuGraph 服务启动时，如果 load_plugins 为真，则会自动加载 plugin 目录下的所有 plugin。否则需要手动加载。此外，如果服务器运行过程中，管理员更新了 plugin 文件，也需要手动重新加载。重新加载 plugin 的调用格式为：
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 插件名称 | 字符串 |
+  | description | 插件说明 | 字符串 |
+  | code_base64 | 插件代码 | 字符串，使用 base64 编码 |
+  | read_only | 是否为只读存储过程 | 布尔值 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 5.2.列出所有存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程列表，其中每个元素是一个 plugin 的描述，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.获取存储过程的详细信息
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程信息，包括代码，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+  | code_base64 | 存储过程的代码 | 字符串，使用 base64 编码 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.调用存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: POST
+- **REQUEST**: 字符串输入
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | data | 输入数据 | 字符串 |
+  | timeout | 超时长度（秒，可选，缺省值为 0） | 浮点 |
+  | in_process | 是否在本进程调用（可选，缺省值为 false） | 布尔值 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.删除存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 6.Deprecated
+
+以下接口将在4/30/2023之后被删除。
+
+### 6.1.用户管理
+
+系统默认创建一个管理员，管理员用户名为 _admin_，密码为 _73@TuGraph_。为了安全起见，请用户在第一次启动服务器后更改密码。
+
+
+#### 6.1.1.添加用户
+
+添加一个新的用户，并为其设置初始密码。只有管理员有权限进行此操作。其中用户名只能由字母，数字以及下划线构成，密码则可以包含任意字符。用户名和密码长度不能超过 64 字节。添加用户时还可以为用户增加一个描述，用户描述可以包含任意字符，最长不超过 512 字节。
+
+新用户默认拥有同名的角色，不具备任何图的权限。
+
+- **URI**: `/user`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "description": "This is a user"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.列出所有用户
+
+列出数据库的所有用户。只有管理员拥有该操作权限。
+
+- **URI**: `/user/`
+- **METHOD**: GET
+- **RESPONSE**: 所有用户及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin admin user",
+        "roles": ["admin"]
+    },
+    "guest1": {
+        "disabled": true,
+        "description": "",
+        "roles": ["guest1", "some_other_role"]
+    }
+}
+```
+
+#### 6.1.3.获取用户信息
+
+列出给定用户的信息。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "A guest user"
+    "roles": ["guest1", "some_other_role"]
+}
+```
+
+#### 6.1.4.列出用户权限
+
+列出给定用户有权限访问的所有图及相应权限。
+
+- **URI**: `/user/{user_name}/graph`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1/graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "graph1" : "FULL",
+    "graph2" : "READ"
+}
+```
+
+#### 6.1.5.更改用户密码
+
+用户可以更改自己的密码，更改密码时需要同时提供原密码。管理员可以更改所有用户的密码。管理员更改其它用户密码时，可以不提供当前密码。
+
+- **URI**: `/user/{user_name}/password`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | current_password | 当前密码 | 字符串 |
+  | new_password | 新密码 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/password
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.6.修改用户描述
+
+用户可以修改自己的描述。管理员可以修改任意用户的描述。
+
+- **URI**: `/user/{user_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "New description for this user."
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.7.删除用户
+
+删除用户及其所有相关权限，只有管理员拥有该操作权限。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.8.禁用用户
+
+用户可以被禁用。被禁用的用户将不能登陆，但是其资料仍然保存。被禁用的用户可以被重新启用。
+
+- **URI**: `/user/{user_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.9.启用用户
+
+启用一个被禁用的用户。
+
+- **URI**: `/user/{user_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.10.设置用户角色
+
+为指定用户设置角色。只有管理员可以执行此操作。
+
+用户角色列表必须是“全量列表”，即该列表需要包含该用户需要的所有角色。唯一的例外是用户的同名角色，即使列表中不含该角色，它也会被加到用户角色中。
+
+- **URI**: `/user/{user_name}/role`
+- **METHOD**: POST
+- **REQUEST**: 角色列表
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+        ["role1", "role2"]
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+此时用户`guest1`拥有角色`guest1`, `role1`和`role2`。
+
+### 6.2.角色管理
+
+TuGraph 使用基于角色的权限管理。
+
+同一用户可以拥有多个角色。新用户默认拥有与其同名的角色。删除用户时，同名角色也会被删除。如果新建用户时同名角色已经存在，则创建失败。
+
+同一角色可以对多个图有不同的权限。用户对某张图的权限由其所有角色对该图的最高权限决定。
+
+TuGraph 使用四级权限，不用的用户对不同的子图可以有不同的权限，四种权限及其说明如下：
+
+| 权限  | 说明                                                                             |
+| ----- | -------------------------------------------------------------------------------- |
+| NONE  | 无权限                                                                           |
+| READ  | 只读                                                                             |
+| WRITE | 可读写子图中的点和边                                                           |
+| FULL  | 完全权限，包括更改元数据（label, index），管理存储过程，以及删除子图中的所有数据 |
+
+管理员对所有子图都有完全权限，新建的用户对所有子图都没有权限。将用户加入管理员角色中可以将用户提升为管理员。
+
+#### 6.2.1.添加角色
+
+添加一个新的角色，并设置其描述。只有管理员有权限进行此操作。
+
+角色名只能由字母，数字以及下划线构成，密码则可以包含任意字符。角色名长度不能超过 64 字节。
+
+角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | role | 角色名 | 字符串 |
+  | description | 角色描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "role": "new_role",
+        "description": "This is a new role.",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.2.修改角色描述
+
+修改角色的描述。只有管理员有权限进行此操作。角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role/{role_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 新描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "modified description"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.列出所有角色
+
+列出数据库的所有角色。只有管理员拥有该操作权限。
+
+- **URI**: `/role/`
+- **METHOD**: GET
+- **RESPONSE**: 所有角色及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin administrator group.",
+        "permissions": {"default":"FULL", "graph1":"FULL"}
+    },
+    "role1": {
+        "disabled": true,
+        "description": "Another role",
+        "permissions": {"default":"READ"}
+    }
+}
+```
+
+#### 6.2.4.获取角色信息
+
+列出给定角色的信息。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: GET
+- **RESPONSE**: 角色信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "Another role",
+    "permissions": {"default":"READ"}
+}
+```
+
+#### 6.2.5.删除角色
+
+删除指定角色，只有管理员拥有该操作权限。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.6.禁用角色
+
+角色可以被禁用。角色被禁用后，具有该角色的用户将不再从该角色中获得任何权限。只有管理员可以执行此操作。
+
+- **URI**: `/role/{role_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.7.启用角色
+
+启用一个被禁用的角色。
+
+- **URI**: `/role/{role_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.8.设置角色权限
+
+为指定角色设置权限。只有管理员可以执行此操作。
+
+角色权限列表必须是“全量列表”，即该列表需要包含该角色能操作的所有图及其权限。
+
+- **URI**: `/role/{role_name}/permissions`
+- **METHOD**: POST
+- **REQUEST**: 图名称及相应权限的字典。
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/permissions
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "graph1" : "FULL",
+        "graph2" : "READ"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.服务器状态
+
+#### 6.3.1.修改服务器配置
+
+修改服务器配置，配置修改后立即生效，并将影响所有服务器。这些配置的优先级高于配置文件以及命令行参数。
+
+- **URI**: `/config`
+- **METHOD**: PUT
+- **REQUEST**:
+
+请求为一个字典，使用 `{"opt1":v1}` 可以将名为`opt1`的配置修改为`v1`。
+
+| 配置名               | 说明                   | 值类型 |
+| -------------------- | ---------------------- | ------ |
+| OPT_DB_ASYNC         | 是否启用异步模式       | 布尔值 |
+| OPT_TXN_OPTIMISTIC   | 是否默认使用乐观事务锁 | 布尔值 |
+| OPT_AUDIT_LOG_ENABLE | 是否启用审计日志       | 布尔值 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "OPT_DB_ASYNC": true,
+        "OPT_AUDIT_LOG_ENABLE": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.当前服务器状态
+
+- **URI**: `/info`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | lgraph_version | 服务器版本号 | 字符串 |
+  | git_branch | 服务器代码分支 | 字符串 |
+  | git_commit | 服务器代码版本 | 字符串 |
+  | web_commit | 前端码版本 | 字符串 |
+  | cpp_id | CPP 编译器 ID | 字符串 |
+  | cpp_version | CPP 编译器版本 | 字符串 |
+  | python_version | PYTHON 版本 | 字符串 |
+  | node | 点 uri | 字符串 |
+  | relationship | 边 uri | 字符串 |
+  | cpu | cpu 信息 | 字典，格式参见[服务器 CPU 状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8CPU%E7%8A%B6%E6%80%81) |
+  | disk | 硬盘 IO 信息 | 字典，格式参见[服务器硬盘状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%A1%AC%E7%9B%98%E7%8A%B6%E6%80%81) |
+  | memory | 内存信息 | 字典，格式参见[服务器内存状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%86%85%E5%AD%98%E7%8A%B6%E6%80%81) |
+  | db_space | 图数据库占用空间 | 字典，格式参见[图数据库占用空间](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8D%A0%E7%94%A8%E7%A9%BA%E9%97%B4) |
+  | db_config | 图数据库配置信息 | 字典，格式参见[图数据库配置信息](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E9%85%8D%E7%BD%AE%E4%BF%A1%E6%81%AF) |
+  | up_time | 数据库在线时长（秒） | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.服务器 CPU 状态
+
+- **URI**: `/info/cpu`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序 CPU 使用率 | 整型 |
+  | server | 服务器 CPU 使用率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.服务器硬盘状态
+
+- **URI**: `/info/disk`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | read | 服务器硬盘读速率 | 整型 |
+  | write | 服务器硬盘写速率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.服务器内存状态
+
+- **URI**: `/info/memory`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序内存使用量 | 整型 |
+  | server_avail | 服务器可用内存 | 整型 |
+  | server_total | 服务器总内存 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.图数据库占用空间
+
+- **URI**: `/info/db_space`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | space | 图数据库占用空间 | 整型 |
+  | disk_avail | 图数据库可用空间 | 整型 |
+  | disk_total | 服务器硬盘总空间 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "disk_avail"::360074579968,
+      "disk_total"::984373800960,
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.图数据库配置信息
+
+- **URI**: `/info/db_config`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | db_async | 图数据库工作模式（同步或异步） | 布尔值 |
+  | disable_auth | 是否禁用身份验证 | 布尔值 |
+  | enable_ha | 是否启用高可用模式 | 布尔值 |
+  | enable_rpc | 是否启用 RPC 服务器 | 布尔值 |
+  | bind_host | REST 服务器的主机 | 字符串 |
+  | enable_audit_log | 是否启用日志审计 | 布尔值 |
+  | port | REST 服务器的端口 | 整型 |
+  | rpc_port | RPC 服务器的端口 | 整型 |
+  | optimistic_txn | 是否默认使用乐观事务锁 | 布尔值 |
+  | thread_limit | 图数据库应用程序的可用线程数 | 整型 |
+  | enable_ssl | 是否使用 SSL 进行身份验证 | 布尔值 |
+  | verbose | 输出的详细程度 | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "db_async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "bind_host":"127.0.0.1",
+      "enable_audit_log":false,
+      "port":7070,
+      "optimistic_txn":false,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "enable_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.8.高可用服务器列表
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/peers`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回一个服务器信息列表，其中每个服务器信息格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+  | state | 服务器状态 | 字符串 |
+
+其中服务器状态可为 `MASTER`,`SLAVE`,`OFFLINE`。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.9.当前 Leader 信息
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/leader`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前 leader 服务器信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.10.服务器统计信息
+
+- **URI**: `/info/statistics`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前服务器统计信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | requests/second | 每秒处理的请求数量 | 浮点型 |
+  | writes/second | 每秒处理的写请求数量 | 浮点型 |
+  | running_tasks | 正在执行的请求数量 | 整型 |
+  | failure_rate | 请求失败率 | 浮点型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 2.3,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.11.审计日志信息
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | begin_time | 查询日志的起始时间(必填，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | end_time | 查询日志的结束时间(默认为当前时间，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | user | 查询日志的操作者(管理员可查询所有用户的日志，普通用户只能查询本人日志) | 字符串 |
+  | num_log | 查询日志的数量(默认为 100) | 整型 |
+  | descending_order | 查询结果是否降序输出(默认为 true) | 布尔值 |
+
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回审计日志列表，其中每个元素是一条操作日志，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | index | 该操作的索引值 | 整型 |
+  | begin_time | 该操作的开始时间 | 字符串 |
+  | end_time | 该操作的结束时间 | 字符串 |
+  | user | 该操作的发起者 | 字符串 |
+  | graph | 该操作的图 | 字符串 |
+  | type | 该操作的类型 | 字符串 |
+  | read_write | 该操作为读操作或者写操作 | 字符串 |
+  | success | 该操作是否成功 | 布尔值 |
+  | content | 该操作的简要内容 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.任务管理
+
+TuGraph 提供长任务的跟踪和中止功能。用户可以通过 REST API 来查询当前正在运行的在 Cypher 和存储过程查询，并选择中止正在执行的查询。
+
+任务管理对应的 URI 格式为
+
+```
+    http://{host}:{port}/task/{thread_id}/{task_id}
+```
+
+#### 6.4.1.查询正在执行的任务
+
+- **URI**: `/task`
+- **METHOD**: GET
+- **RESPONSE**:
+
+返回的 JSON 为一个数组，其中每一个元素格式如下：
+
+| 域名         | 说明                         | 类型   |
+| ------------ | ---------------------------- | ------ |
+| description  | 任务描述                     | 字符串 |
+| time_elapsed | 任务已经执行的时间，单位为秒 | 浮点   |
+| task_id      | 任务 ID                      | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.中止任务
+
+- **URI**: `/task/{task_id}`
+  其中 `{task_id}` 是 `GET /task` 返回结果中的 `task_id`。
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.5.子图管理
+
+TuGraph 支持多子图，子图之间完全独立，不同的子图可以对不同用户开放不同权限。管理员可以添加和删除子图。
+
+#### 6.5.1.创建新子图
+
+- **URI**: `/db`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 子图名 | 字符串 |
+  | config | 配置 | 字典，格式为 { {列名 1}:{列值 1},... } |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1",
+        "config" : {
+            "max_size_GB":2048,
+            "description": "description of graph1"
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.删除子图
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.列出所有子图
+
+- **URI**: `/db`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_GB":1024,
+            "description":"description of graph1"
+        }
+    }
+```
+
+#### 6.5.4.获取子图信息
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "max_size_GB":1024,
+        "description":"description of graph1"
+    }
+```
+
+### 6.6.元数据管理
+
+TuGraph 是一个具备多图能力的强模式属性图数据库。在每一张子图中，每种点和边都需要有预定义的数据格式。数据格式由 Label 决定，每种 Label 都有自己的数据格式。用户可以使用 REST API 添加，删除和查询 Label 及其对应的数据格式。
+
+Label 操作对应的 URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+其中{type}可以是 node 或者 relationship。
+
+#### 6.6.1.创建Label
+
+创建 Label 的过程同时也是定义其数据类型的过程。只有创建了 Label 才能在图中插入相应类型的点或者边。
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | Label 名 | 字符串 |
+  | fields | 数据列定义 | 列表 |
+  | is_vertex | 是否是点 Label | 布尔值 |
+  | primary | 点的主键属性 | 字符串 |
+  | edge_constraints | 边的约束 | 列表 |
+
+`primary` 在 `is_vertex` 为 `true` 的时候设置，这个字段只有点才有, 创建点的时候必须设置。
+
+`edge_constraints` 在 `is_vertex` 为 `false` 的时候设置，这个字段只有边有。这个字段限制了该边的起点和终点只能是哪些点的组合，比如：`[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`，限制了该边只能是从 `vertex_label1` 到 `vertex_label2` 和 从 `vertex_label3` 到 `vertex_label4`。如果不想有任何限制，不设置该字段即可。
+
+其中`fields`为一个数组，其中每个元素定义数据的一列，内容如下：
+
+| 域名     | 说明                                     | 类型                                                                                                |
+| -------- | ---------------------------------------- | --------------------------------------------------------------------------------------------------- |
+| name     | 列名                                     | 字符串                                                                                              |
+| type     | 列数据类型                               | 字符串，有以下类型： int8, int16, int32, int64, float, double, string, date, datetime, binary, bool |
+| optional | 数据是否可以为空（可选，缺省值为 false） | 布尔值                                                                                              |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.列出所有 Label
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | edge | 边 Label 列表 | 列表 |
+  | vertex | 点 Label 列表 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.获取 Label 的数据格式定义
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+- **METHOD**: GET
+- **RESPONSE**: 数据列定义表，类型是一个词典，key 为列名，value 为列定义，列定义见如下：
+-
+
+| 域名     | 说明             | 类型   |
+| -------- | ---------------- | ------ |
+| optional | 该列值是否可为空 | 布尔值 |
+| type     | 列值类型         | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema 导入
+
+- **URI**: `/db/{graph_name}/schema/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+- **RESPONSE**:
+
+Schema 导入会根据 description 比较新的 Schema 和数据库中原有的 Schema 是否兼容，检查的粒度为 Label。如果不一致则出错，如果一致则添加原先 Schema 中不存在的 Label，返回 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串:
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.点操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+Nodes 提供节点（Vertex）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。
+
+#### 6.7.1.列出点数量和label数量
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | num_label | 点 label 数量 | 整数 |
+  | num_vertex | 点数量 | 整数 |
+
+_注意 num_vertex 返回的并不是准确的点数量，只是一个估计值。_
+
+#### 6.7.2.创建一个点
+
+向数据库中插入一个点。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 点属性 | 字典，其中 key 是列名，value 是相应值。value 必须是与列类型相应的类型，如列为 int32，则 value 只能是整数。 |
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新点 vid。该 ID 可用于后续的点操作中。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.批量创建点
+
+TuGraph 允许一次性插入多个点，以减少网络开销。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | fields | 点属性 | 列表 |
+  | values | 点数据 | 列表 |
+
+其中 fields 是一个字符串列表，列出一系列列名；values 是一个列表，其中每个元素是一个列表，列表中每个元素是列数据。
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新增加的点的 vid 列表，该列表中每一个 vid 按顺序对应请求中的每一个点。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.获取点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 属性 | 字典，格式为 { {列名 1}:{列值 1},...} |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.删除点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 被删掉的点的入边数量 | 整数值 |
+  | out | 被删掉的点的出边数量 | 整数值 |
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.获取点所有属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+- **METHOD**: GET
+- **RESPONSE**: Node 所有属性（字典）
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.获取点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: Node 某一属性
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.更新点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 点属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "********"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.8.边操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+与 Nodes 功能类似，Relationships 提供边（edge）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。每一条边都可以由一个唯一 ID（euid）来标识。这个 ID 可以从在插入边时获得，或者在 [列出所有边](#%E5%88%97%E5%87%BA%E6%89%80%E6%9C%89%E8%BE%B9) 操作中得到。
+
+#### 6.8.1.创建一条边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | destination | 目的点 ID | 整数值 |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid（字符串）。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.批量创建边
+
+- **URI**: `/db/{graph_name}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | fields | 数据列名 | 列表 |
+  | edge | 边数据 | 列表 |
+
+其中 edge 是一个数据列表，其中每个元素都是一条边，其定义如下：
+
+| 域名        | 说明     | 类型                                                   |
+| ----------- | -------- | ------------------------------------------------------ |
+| source      | 起点 id  | 整数                                                   |
+| destination | 终点 id  | 整数                                                   |
+| values      | 数据列表 | 列表，每列对应 fields 中的一个列，类型是该列对应的类型 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid 列表。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.列出所有出边（outgoing relationships）
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+- **METHOD**: GET
+- **RESPONSE**: 点 src 的所有出边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.列出所有入边（incoming relationships）
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+- **METHOD**: GET
+- **RESPONSE**: 点 dst 的所有入边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.列出所有边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 入边 | 列表 |
+  | out | 出边 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationships/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.获取边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | property | 边属性 | 字典 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.删除边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.获取边的所有属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+- **METHOD**: GET
+- **RESPONSE**: 边属性字典
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.获取边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功,返回代码 200,同时返回边的属性。如果失败,返回代码 400,同时返回 "Illegal field."。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.更新边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.9.索引
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+提供索引操作，接受 GET/POST 请求。
+
+#### 6.9.1.创建索引
+
+该操作会启动一个创建索引的后台任务，用户可以通过列出该 Label 相关的所有索引来检查新建索引的状态。
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: POST
+- **REQUEST**:
+
+| 域名      | 说明       | 类型                                                |
+| --------- | ---------- | --------------------------------------------------- |
+| label     | Label 名   | 字符串                                              |
+| field     | 域名       | 字符串                                              |
+| is_unique | 唯一性标识 | 布尔值，如果为 true，表示该 index 中的 key 是唯一的 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.列出所有索引
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.列出所有与某个 Label 相关的索引
+
+- **URI**: `/db/{graph_name}/index/{label}`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.删除索引
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.根据索引获取点
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+- **METHOD**: GET
+- **RESPONSE**: 点 vid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+### 6.10.在线增量导入
+
+#### 6.10.1.指定文件内容导入
+
+- **URI**: `/db/{graph_name}/import/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+  | data | 要导入的文件内容（建议最大在 16MB 左右，最长不超过 17MB） | 字符串 / 数组 / 对象 |
+  | continue_on_error | 出错后是否继续导入（可选，默认为`false`
+  ） | 布尔值 |
+  | delimiter | 分隔符（可选，默认为`“,”`
+  ） | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+分隔符可以是单字符，也可以是字符串，但不能包含`\r`或者`\n`。
+
+data 可以是如下形式之一：
+
+- 字符串如 `"1,2\n3,4\n"`
+- ASCII 码组成的数组如 `[49,44,50,10,51,44,52,10]`
+- 形如上述数组的字典如 `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+- **RESPONSE**:
+
+系统**不会**自动执行新建 label、添加索引等操作。在此操作之前需要保证涉及的 label 已经存在并具有适当的索引。
+
+如果成功导入完毕，返回代码 200，并在 `log` 字段返回一些日志信息（可能为空）；否则，保证所有的数据均未被导入，并在 `error_message` 字段返回错误信息。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true,
+      "delimiter": ","
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+由于请求中指定了在出错时继续，该返回信息说明 SRC_ID 为 1 的边没有被导入，而其他信息导入成功。
+
+### 6.11.其他
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.提取子图
+
+给出点 id 集合，返回包含该集合的最小子图。
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | vertex_ids | 点 id 集合 | 列表 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | nodes | 点数据 | 列表，每元素包含 vid, label, 以及属性 |
+  | relationships | 边数据 | 列表，每元素包含 src, dst, euid, label, 以及属性 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example response.**
+
+```
+• 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
new file mode 100644
index 0000000000..71afce44cd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
@@ -0,0 +1,272 @@
+# RPC API
+
+> 此文档主要介绍 TuGraph 的 RPC API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供丰富的 RPC API，以供开发者通过 RPC 请求远程调用 TuGraph 提供的服务。
+
+RPC（远程过程调用）是一种通过网络从远程计算机程序上请求服务，而不需要了解底层网络技术的协议。
+相比REST，RPC 面向方法，主要用于函数方法的调用，可以适合更复杂通信需求的场景，且性能更高。
+brpc是用c++语言编写的工业级RPC框架，基于brpc，TuGraph 提供了丰富的RPC API，本文档描述
+TuGraph 的 RPC API 使用方式。
+
+## 2.请求
+
+### 2.1.建立连接
+
+开发者向TuGraph服务发送RPC请求，首先要建立连接。以C++语言为例，开发者创建指定url的通道（channel），
+由通道创建指定的服务存根（LGraphRPCService_Stub），后续即可通过存根像调用本地方法一样向远程
+服务器发送请求。
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.请求类型
+
+TuGraph支持10种RPC请求，其中每种请求的功能如下表所示：
+
+| 请求              | 功能         |
+|-----------------|------------|
+| GraphApiRequest | 点边索引操作请求   |
+| CypherRequest   | cypher请求   |
+| PluginRequest   | 存储过程请求     |
+| HARequest       | 高可用模式请求    |
+| ImportRequest   | 数据导入请求     |
+| GraphRequest    | 子图操作请求     |
+| AclRequest      | 权限管理请求     |
+| ConfigRequest   | 配置管理请求     |
+| RestoreRequest  | 备份请求       |
+| SchemaRequest   | schema管理请求 |
+
+用户发送请求时，需要传入以下参数：
+- client_version: 可选参数，HA模式下可通过对比`client_version`和`server_version`防止响应过时的请求
+- token: 必要参数，客户端登陆之后获得token，每次请求传入token以校验用户身份
+- is_write_op: 可选参数，标志请求是否是写请求
+- user: 可选参数，HA模式下主从之间同步请求时设置user，不需验证token
+
+服务处理完RPC请求之后发回响应，响应消息中除了包含每个请求的单独响应信息之外，还包含以下参数：
+- error_code: 必要参数，标志请求处理状态
+- redirect: 可选参数，HA模式下向follower发送写请求时处理失败，设置redirect为请求转发地址，即leader地址
+- error: 可选参数，请求错误信息
+- server_version: 可选参数，HA模式的请求响应中设置`server_version`以避免client读取数据时发生反向时间旅行问题
+
+:warning:  **除CypherRequest、PluginRequest、HARequest和AclRequest外，其余RPC接口将逐步废弃，其功能统一至CypherRequest接口。**
+
+## 3.登录
+
+登录请求信息包含以下参数：
+- user: 必要参数，用户名
+- pass: 必要参数，密码
+以C++为例，用户使用构建好的服务存根发送登录请求：
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+登录响应信息包含以下参数：
+- token: 必要参数，登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。
+如果登录失败会收到“Authentication failed”错误。
+
+## 4.查询
+用户可以通过Cypher查询和TuGraph进行绝大多数的交互，Cypher请求信息包含以下参数：
+- query: 必要参数，Cypher查询语句
+- param_names: 可选参数，参数名
+- param_values: 可选参数，参数值
+- result_in_json_format: 必要参数，查询结果是否以JSON格式返回
+- graph: 可选参数，Cypher语句执行的子图名称
+- timeout: 可选参数，Cypher语句执行的超时时间
+
+以C++为例，用户发送Cypher请求的方式如下所示：
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+Cypher请求响应为以下两个参数之一：
+- json_result: JSON格式的cypher查询结果
+- binary_result: CypherResult格式的cypher查询结果
+
+## 5.存储过程
+为满足用户较为复杂的查询/更新逻辑，TuGraph支持 C 语言和 Python 语言编写的存储过程。
+用户可以使用RPC请求对存储过程进行增删改查操作。
+
+### 5.1.加载存储过程
+加载存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- read_only: 必要参数，是否只读
+- code: 必要参数，存储过程文件读入生成的ByteString
+- desc: 可选参数，存储过程描述
+- code_type: 可选参数，存储过程代码类型，PY、SO、CPP、ZIP四者之一
+
+以C++为例，用户加载存储过程的方式如下所示：
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+加载存储过程的响应不包含参数，如果加载失败则抛出BadInput异常
+
+### 5.2.调用存储过程
+
+调用存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- param: 必要参数，存储过程参数
+- result_in_json_format: 可选参数，调用结果是否以JSON格式返回
+- in_process: 可选参数，未来支持
+- timeout: 可选参数，调用存储过程的超时时间
+
+以C++为例，用户调用存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+调用存储过程的响应为以下两个参数之一：
+- reply: ByteString格式的存储过程调用结果
+- json_result: JSON格式的存储过程调用结果
+
+### 5.3.删除存储过程
+
+删除存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+
+以C++为例，用户删除存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+删除存储过程的响应不包含参数，如果删除失败则抛出BadInput异常
+
+### 5.4.列举存储过程
+
+列举存储过程请求不需要参数，以C++为例，用户列举存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+列举存储过程的响应的参数如下所示：
+- reply: JSON格式的procedure列表
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst
new file mode 100644
index 0000000000..f509ac8dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst
@@ -0,0 +1,8 @@
+网络协议
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
new file mode 100644
index 0000000000..94645aac0a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
@@ -0,0 +1,54 @@
+# Learn Tutorial
+
+> 本文档是为 TuGraph 的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对 TuGraph 的图学习运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于 Tugraph 的一个简单的程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图学习模块
+TuGraph 图学习模块将TuGraph中的图数据采样，采样后的节点和边作为图学习的特征，进行学习训练。运行流程如下图所示：
+![Alt text](../../../../../images/learn_flow_chart_zh.png)
+## 2. 数据导入
+数据导入请参考[数据导入](../../../5.developer-manual/3.server-tools/1.data-import.md)
+
+导入过程以cora数据集为例：
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+其中cora.conf为图schema文件，代表图数据的格式。cora_db为导入后的图数据文件名称，代表图数据的存储位置。
+## 3. feature特征转换
+由于图学习中的feature特征一般表示为较长的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./cora_db`
+即可进行转换。
+## 4. 采样算子及编译
+TuGraph在cython层实现了一种获取全图数据的算子及4种采样算子，具体如下：
+### 4.1.采样算子介绍
+| 采样算子 | 采样方式 |
+| --- | --- |
+| GetDB | 从数据库中获取图数据并转换成所需数据结构 |
+| Neighbor Sampling | 根据给定的节点采样其邻居节点，得到采样子图 |
+| Edge Sampling | 根据采样率采样图中的边，得到采样子图 |
+| Random Walk Sampling | 根据给定的节点，进行随机游走，得到采样子图 |
+| Negative Sampling | 生成不存在边的子图。 |
+
+### 4.2.编译
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+得到算子so后，在Python中import 即可使用。
+
+## 5. 训练
+TuGraph在python层调用cython层的算子，实现图学习的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在tugraph-db/learn/example文件夹下执行
+`python3 train_full_cora.py`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
new file mode 100644
index 0000000000..3534d7bc3a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
@@ -0,0 +1,97 @@
+# Sampling API
+
+> 此文档主要详细介绍了Sampling API的使用说明
+
+## 1. 概述
+
+本手册介绍使用TuGraph的Sampling API接口。
+
+## 2. 图数据预处理
+在采样操作之前，根据图数据路径加载图数据，并映射成olapondb图分析类，代码如下：
+
+```python
+galaxy = PyGalaxy(args.db_path) # 根据路径创建一个galaxy实例
+galaxy.SetCurrentUser(args.username, args.password) # 设置当前用户
+db = galaxy.OpenGraph('default', False) # 打开图数据库指定db
+txn = db.CreateReadTxn() # 创建一个事务实例
+olapondb = PyOlapOnDB('Empty', db, txn) # 根据图加载方式、图数据库实例、事务实例实例化OlapOnDB
+del txn
+del db
+del galaxy
+```
+## 3. 图采样算子介绍
+图采样算子在cython层实现，用于对输入的图进行采样处理，生成的NodeInfo用于保存feature属性、label属性等点信息，EdgeInfo用于保存边信息，这些元数据信息可以被用于特征抽取、网络嵌入等任务中。目前TuGraph图学习模块支持GetDB、NeighborSampling、EdgeSampling、RandomWalkSampling、NegativeSampling五种采样算子。
+### 3.1.RandomWalk算子：
+在给定的采样节点周围进行指定次数的随机游走，得到采样子图。
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样节点列表。
+step: size_t类型，采样步数。
+NodeInfo: list类型，节点属性字典的列表，表示节点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.2.NeighborSample算子：
+在给定采样节点的一度邻居中采样一定数量的节点，得到采样子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样节点列表。
+nei_num: size_t类型，邻居采样节点数。
+NodeInfo: list类型，节点属性字典的列表，表示节点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.3.Nagetive算子：
+采用负采样算法，生成不存在边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+num_samples: size_t类型，生成不存在边的数量。
+NodeInfo: list类型，节点属性字典的列表，表示节点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值： 无。
+
+### 3.4.EdgeSampling算子：
+根据边采样率，生成采样边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list,EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_rate: double类型，采样率。
+NodeInfo: list类型，一个节点属性字典的列表，表示节点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.5.GetDB算子：
+从数据库中获取图数据并转换成所需数据结构。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+NodeInfo: list类型，一个节点属性字典的列表，表示节点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+## 4. 用户自定义采样算法
+用户也可以通过TuGraph Olap接口实现自定义采样算法，接口文档参见[此处](../2.olap/5.python-api.md)，该文档主要介绍图采样算法使用的相关函数的接口设计。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md
new file mode 100644
index 0000000000..10cc244a09
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md
@@ -0,0 +1,106 @@
+# Training
+
+> 本文档详细介绍了如何使用TuGraph进行图神经网络（GNN）的训练。
+
+## 1. 训练
+使用TuGraph 图学习模块进行训练时，可以分为全图训练和mini-batch训练。
+全图训练即把全图从TuGraph db加载到内存中，再进行GNN的训练。而mini-batch训练则使用上面提到的TuGraph 图学习模块的采样算子，将全图数据进行采样后，再送入训练框架中进行训练。
+## 2. Mini-Batch训练
+Mini-Batch训练需要使用TuGraph 图学习模块的采样算子，目前支持Neighbor Sampling、Edge Sampling、Random Walk Sampling和Negative Sampling。
+TuGraph 图学习模块的采样算子进行采样后的结果以List的形式返回。
+下面以Neighbor Sampling为例，介绍如何将采样后的结果，进行格式转换，送入到训练框架中进行训练。
+用户需要提供一个Sample类：
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. 加载图数据
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+
+        # 2. 采样方法，结果存储在NodeInfo和EdgeInfo中
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+
+        # 3. 对结果进行格式转换，使之符合训练格式
+        src = EdgeInfo[0].astype('int64')
+        dst = EdgeInfo[1].astype('int64')
+        nodes_idx = NodeInfo[0].astype('int64')
+        remap(src, dst, nodes_idx)
+        features = NodeInfo[1].astype('float32')
+        labels = NodeInfo[2].astype('int64')
+        g = dgl.graph((src, dst))
+        g.ndata['feat'] = torch.tensor(features)
+        g.ndata['label'] = torch.tensor(labels)
+        return g
+```
+如代码所示，首先将图数据加载到内存中。然后使用采样算子对图数据进行采样，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+最后对结果进行格式转换，使之符合训练格式。这里我们使用的是DGL训练框架，因此使用结果数据构造了DGL Graph，最终将DGL Graph返回。
+我们提供TuGraphSample类之后，就可以使用它进行Mini-Batch训练了。
+令DGL的数据加载部分使用TuGraphSample的实例sampler：
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+使用DGL进行模型训练：
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+
+## 3. 全图训练
+GNN（图神经网络）的全图训练是一种涉及一次处理整个训练数据集的训练。它是 GNN 最简单、最直接的训练方法之一，整个图被视为单个实例。 在全图训练中，整个数据集被加载到内存中，模型在整个图上进行训练。这种类型的训练对于中小型图特别有用，并且主要用于不随时间变化的静态图。
+在算子调用时，使用以下方式：
+```python
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+获取全图数据，然后将全图送入训练框架中进行训练。
+完整代码：请参考learn/examples/train_full_cora.py。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst
new file mode 100644
index 0000000000..e79e36ea91
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst
@@ -0,0 +1,8 @@
+图学习
+======
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/index.rst
new file mode 100644
index 0000000000..59b8adc417
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/6.interface/index.rst
@@ -0,0 +1,12 @@
+编程接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.cypher.md
+   2.olap/index.rst
+   3.procedure/index.rst
+   4.protocol/index.rst
+   5.learn/index.rst
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md
new file mode 100644
index 0000000000..ff3fcd8048
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# 单元测试
+
+> 该文档是TuGraph的单元测试文档
+
+## 1.简介
+
+TuGraph单元测试采用gtest框架，可以选择一次跑全部test或者制定某些test。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md
new file mode 100644
index 0000000000..98a5ecf926
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md
@@ -0,0 +1,399 @@
+# 集成测试
+
+> 此文档主要介绍 TuGraph 的集成测试框架如何使用
+
+## 1.TuGraph集成测试的意义
+
+在单元测试与功能测试中，有部分用例直接开启galaxy或statemachine来进行测试，这并不是一个完整的流程。在完整的cs架构中，用户请求是通过客户端发往服务端，网络通信是必不可少的，为了避免单元测试不完整带来的bug，针对这种情况，使用集成测试框架进行全链路的完整测试。
+
+## 2.TuGraph集成测试框架
+
+TuGraph采用pytest框架作为自己的集成测试框架，pytest框架作为目前使用最广泛的cs端集成测试框架，以其灵活简单，容易上手，并且支持参数化的使用方式而著称，TuGraph基于pytest提供的功能，抽象出了不同的工具，通过参数来控制各个工具的处理逻辑，以方便大家进行高效的测试代码开发。
+
+更多pytest信息请参考官网: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.组件描述
+
+| 组件名称            | 组件功能                       | 实现方式                                  |
+|-----------------|----------------------------|---------------------------------------|
+| server          | TuGraph单机服务                | 开启子进程并在子进程中启动服务                       |
+| client          | TuGraph Rpc Client         | 当前进程中开启TuGraph Python Rpc Client发送请求  |
+| importor        | TuGraph Importor           | 开启子进程并在子进程中处理导入请求                     |
+| exportor        | TuGraph Exportor           | 开启子进程并在子进程中处理导出请求                     |
+| backup_binlog   | TuGraph Backup Binlog      | 开启子进程并在子进程中处理备份binlog的请求              |
+| backup_copy_dir | TuGraph Backup             | 开启子进程并在子进程中处理备份完整db的请求                |
+| build_so        | 编译c++动态连接库的组件              | 开启子进程并在子进程中处理gcc编译逻辑                  |
+| copy_snapshot   | TuGraph Copy Snapshot      | 当前进程中处理备份snapshot的请求                  |
+| copydir         | 文件夹拷贝                      | 当前进程中处理文件夹拷贝请求                        |
+| exec            | 执行c++/java可执行文件            | 开启子进程并在子进程中启动C++可执行文件                 |
+| algo            | 执行算法                       | 开启子进程并在子进程中执行算法                       |
+| bash            | 执行bash命令                   | 开启子进程并在子进程中执行bash命令                   |
+| rest            | TuGraph Python Rest Client | 当前进程中开启TuGraph Python Rest Client发送请求 |
+
+### 2.2.组件用法
+
+#### 2.2.1.server
+
+##### 2.2.1.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动server，函数执行完成后会停止server，并清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.启动参数
+采用python字典传入
++ host是TuGraph Server的ip和端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导入不同的数据，函数开始执行前会导入数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导出不同的数据，函数开始执行前会导出数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的binlog，函数开始执行前会拷贝binlog到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的db，函数开始执行前会拷贝db到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.启动参数
+采用python字典传入
++ cmd是启动命令，采用python列表传入，可以一次编译多个so
++ so_name是执行完成后需要清理的so，可以是多个，通过python列表传入
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_plugins/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_plugins/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制编译不同的so，函数开始执行前会生成so到指定的目录，函数执行完成后会清理so_name列表指定的动态库
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的snapshot，函数开始执行前会拷贝src中的snapshot到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的目录，函数开始执行前会拷贝src到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+EXECOPT = {
+        "cmd" : "rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的命令
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ result是算法预期的执行结果，执行完成会通过实际结果与预期结果进行比较，不同则测试失败
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的算法逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的算法，函数主体等待算法执行完成后对比结果
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的bash命令，函数开始执行前会开启子进程执行通过cmd参数传入的bash命令，函数主体等待算法执行完成
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.启动参数
+采用python字典传入
++ port是TuGraph Server的端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来链接不同的TuGraph Rest Server，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.测试样例
+
+#### 2.3.1.rest
+
+样例代码中在test_get_info函数执行之前先启动server，server启动后启动了rest client，进入test_get_info函数后获取server的一些信息，并通过assert判断是否有获取到cpu的信息。
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+样例代码中在test_flushdb函数执行之前先执行了数据离线导入逻辑，并启动server后，通过client创建链接，进入test_flushdb函数后，通过查询点的个数判断导入是否成功，导入成功后执行flushDB操作，再次通过assert判断是否能正常清空db
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+     assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+样例代码中在test_export_default函数执行之前先执行了数据离线导入逻辑，导入成功后将当前db的数据导出，然后再次通过离线导入逻辑将exportor导出的数据导入到新的目录中，以新导入的数据启动db，并且创建链接。在test_export_default函数主体中判断导出后再次导入的数据是否与原始数据一致
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.其他测试
+更多用例请参考集成测试代码 [https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration)
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/7.quality/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/7.quality/index.rst
new file mode 100644
index 0000000000..32345a1d33
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/7.quality/index.rst
@@ -0,0 +1,8 @@
+测试与质量保障
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/8.other/1.privilege.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/8.other/1.privilege.md
new file mode 100644
index 0000000000..30b26dd16f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/8.other/1.privilege.md
@@ -0,0 +1,132 @@
+# 用户权限
+
+## 1.介绍
+
+> TuGraph 的权限是基于角色的访问控制进行管理，定义访问控制的权限分配给角色，角色再分配给用户。
+
+## 2.权限层级
+
+- Global 层：即全局权限，对管理、图操作均有权限；
+- Graph 层：即图级别，对每个图的权限；
+- （仅商业化版本支持）Property 层：即属性级别，对某个属性的权限控制
+
+## 3.权限关键字
+
+目前权限的控制较为简洁
+
+- Global 层目前为 admin 权限，并且预置了 admin 用户；
+
+* Graph 层的操作权限分为四种：none，read，write，full
+  - none：无权限，对于图没有任何操作权限
+  - read：只读权限，对于图只具备读取权限
+  - write：读写权限，对于图不仅具备读取权限，还具备了写入的权限
+  - full：所有权限，对于图不仅具备读写权限，同时也具备删除图、修改图、修改 Schema 等权限
+* （仅商业化版本支持）Property 层的权限分别为：none，read，write
+  - none：无权限，对于该属性没有任何操作权限
+  - read：只读权限，对于该属性只具备读取权限
+  - write：读写权限，对于该属性不仅具备读取权限，还具备了写入的权限
+
+## 4.常用权限操作
+
+### 4.1.用户操作
+
+- 创建用户
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- 删除用户
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- 修改当前用户密码
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- 修改指定用户密码
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- 禁用/启用用户
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- 列出所有用户
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- 列出当前用户信息
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- 获取用户详情
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.角色操作
+
+- 创建角色
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- 删除角色
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- 列出所有角色
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- 禁用/启用角色
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.赋予用户角色
+
+- 新增用户与角色的联系
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- 删除用户与角色的联系
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- 清空用户角色的关系并重建
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.角色赋权
+
+- 修改角色对指定图的访问权限
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/8.other/2.token.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/8.other/2.token.md
new file mode 100644
index 0000000000..2bb5f4de01
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/8.other/2.token.md
@@ -0,0 +1,47 @@
+# Token使用说明
+
+## 1.Token介绍
+JWT（JSON Web Token）是一种用于认证和授权的开放标准。它基于JSON（JavaScript Object Notation）格式，并被设计用于在网络应用之间安全地传输声明（claims）信息。
+
+JWT由三部分组成：头部（Header）、负载（Payload）和签名（Signature）。头部包含了JWT的类型以及所使用的签名算法，负载包含了需要传输的信息，而签名用于验证JWT的完整性和真实性。
+
+在TuGraph中，JWT用于实现无状态的认证和授权机制。当用户登录成功后，服务端会生成一个JWT并将其返回给客户端。客户端在后续的请求中将这个JWT作为身份凭证传递给服务端。服务端收到JWT后，通过验证签名和解析负载中的信息，判断用户的身份和权限，并决定是否允许该请求的执行。
+
+## 2. Token有效期
+
+### 2.1. 浏览器Token交互逻辑
+1. 用户打开浏览器，输入账号密码，并点击登录。
+2. 前端调用登录接口，向后端输入账号和密码。
+3. 后端接收到账号密码后，进行校验，校验成功后，返回Token。
+4. 前端将Token存储在浏览器缓存中，后续请求都要携带此Token。
+5. 如果前端，主动点击登出和关闭页面，前端应主动调用登出接口，向后端传递Token。
+6. 后端接收后，将Token失效，返回状态码200，以及“等出成功”。前端接收到信息后，清空浏览器内存中的Token，并将页面退至登录页。
+7. Token失效（初始设置为24小时），需要用户重新登录。
+
+### 2.3. Token有效期刷新机制
+
+Token有效期存在刷新机制，默认关闭。如果打开后，Token的安全性会更高，实现上则存在两个时间戳。
+
+第一个时间戳`refresh_time`用于判定Token是否过期（默认24小时）：过期后可以调用刷新接口获取新的Token，可以设置为更短的时间，比如1小时。
+
+第二个时间戳`expire_time`为强制过期时间戳（默认24小时）：过期后必须重新登陆。
+
+### 2.4. Token有效期修改
+为了方便开发者自行开发，TuGraph提供了两种方式修改有效期，均需要admin权限。
+
+* 通过接口调用设置。涉及有效期修改的接口`update_token_time`和有效期查询接口`get_token_time`。
+具体可查询[REST接口文档](../../5.developer-manual/6.interface/4.protocol/1.restful-api.md)。
+
+* 通过启动参数设置。server端启动时，添加参数`-unlimited_token 1` 参数可以设置为无期限。可参考[服务运行文档](../../5.developer-manual/2.running/2.tugraph-running.md)。
+
+## 3. 客户端发送Token相关请求介绍
+
+客户端会两种协议处理相关请求，一种是REST，一种是RPC。
+
+### 3.1. REST
+如果客户端使用REST协议（包括Browser浏览器），由于是短链接，在每一次请求中都需要携带Token，过期后需要获取新的Token。
+
+对于自行开发的客户端，若采用REST协议则需要考虑Token的逻辑。
+
+### 3.2. RPC
+如果客户端使用RPC协议（包括官方的C++/Java/Python），使用长连接保持，登陆后不涉及Token操作。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/8.other/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/8.other/index.rst
new file mode 100644
index 0000000000..e23467ac4c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/8.other/index.rst
@@ -0,0 +1,8 @@
+权限管理
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/index.rst
new file mode 100644
index 0000000000..4a4dd53356
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/5.developer-manual/index.rst
@@ -0,0 +1,16 @@
+用户手册
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.installation/index.rst
+   2.running/index.rst
+   3.server-tools/index.rst
+   4.client-tools/index.rst
+   5.ecosystem-tools/index.rst
+   6.interface/index.rst
+   7.quality/index.rst
+   8.other/index.rst
+
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/1.contributing.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/1.contributing.md
new file mode 100644
index 0000000000..8a0386047c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/1.contributing.md
@@ -0,0 +1,78 @@
+# 如何贡献
+
+## 1. 前言
+感谢您为TuGraph做出贡献，我们由衷地希望有更多社区的同学加入进来，一起建设一个更好的图数据库项目。
+
+在贡献代码之前，请您稍微花一些时间了解为TuGraph贡献代码的流程，并阅读《贡献者许可协议》，参与贡献则视为同意上述协议。
+
+[个人贡献者许可协议](3.individual-cla.md)
+
+[公司贡献者许可协议](4.corporate-cla.md)
+
+## 2. 贡献什么
+我们随时都欢迎任何贡献，无论是简单的错别字修正，BUG 修复还是增加新功能。请踊跃提出问题或发起 PR。我们同样重视文档以及与其它开源项目的整合，欢迎在这方面做出贡献。
+对于任何修改，尤其是较为复杂的修改，建议新建一个issue ，按照BUG或者PR的模板填写。
+
+## 3. 准备工作
+贡献代码前需要先了解 git 工具的使用和 GitHub 网站的使用。
+
+## 4. 贡献代码流程
+### 4.1. 提交issue
+不论您是修复 TuGraph 的 bug 还是新增 TuGraph 的功能，在您提交代码之前，请在 TuGraph 的 GitHub 上提交一个 issue，描述您要修复的问题或者要增加的功能。这么做有几个好处:
+
+- 不会与其它开发者或是他们对这个项目的计划发生冲突，产生重复工作。
+- TuGraph 的维护人员会对您提的 bug 或者新增功能进行相关讨论，确定该修改是不是必要，有没有提升的空间或更好的办法。
+- 在达成一致后再开发，并提交代码，减少双方沟通成本，也减少 pull request 被拒绝的情况。
+### 4.2. 获取源码
+要修改或新增功能，在提交 issue 后，fork一份 TuGraph  Master代码到您的代码仓库。
+### 4.3. 拉分支
+TuGraph 所有修改都在分支上进行，修改完成后提交 pull request，在 Code Review 后由项目维护人员 Merge 到 Master。 因此，在获取源码步骤介绍后，您需要:
+
+1. 下载代码到本地，这一步您可以选择git/https方式，近年github的权限要求更加严格，比如git方式需要更复杂的ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent))，https方式不能直接使用用户名密码验证，请按照指引授权。 git clone https://github.com/您的账号名/tugraph-db
+2. 拉分支准备修改代码:
+git branch add_xxx_feature 
+3. 执行完上述命令后，您的代码仓库就切换到相应分支了。执行如下命令可以看到您当前分支: git branch -a 
+4. 如果您想切换回 Master，执行下面命令: git checkout -b master
+5. 如果您想切换回分支，执行下面命令: git checkout -b "branchName"
+
+### 4.4. 配置 Github 信息
+在您的机器执行 git config  --list ，查看 git 的全局用户名和邮箱。检查显示的 user.name 和 user.email 是不是与自己 github 的用户名和邮箱相匹配。
+
+如果公司内部有自己的 gitlab 或者使用了其他商业化的 gitlab，则可能会出现不匹配的情况。这时候，您需要为 TuGraph DB 项目单独设置用户名和邮箱。设置用户名和邮箱的方式请参考 github 官方文档。
+
+### 4.5. 修改代码提交到本地
+
+拉完分支后，就可以修改代码了。
+
+**修改代码注意事项 **
+
+代码⻛格保持一致：TuGraph 通过 cpplint 来保持代码格式一致，IDE可以通过.clang来配置风格。在提交代码前，务必本地检查代码风格，否则ACI将报错。
+
+补充单元测试代码：新有修改应该通过已有的单元测试,应该提供新的单元测试来证明以前的代码存在 bug，而新的代码已经解决了这些 bug ,您可以用如下命令运行所有测试: ./unit_test
+也可以通过IDE来辅助运行。
+
+**其它注意事项 **
+
+请保持您编辑的代码的原有⻛格，尤其是空格、换行等。 对于无用的注释，请直接删除。 对逻辑和功能不容易被理解的地方添加注释。 及时更新文档。 修改完代码后，请按照如下格式执行命令提交所有的修改到本地:
+git commit -am '(feat) 添加xx功能' git commit -am '(fix) 修复xx问题'`
+
+### 4.6. 提交代码到远程仓库
+在代码提交到本地后，接下来就可以与远程仓库同步代码了，执行如下命令提交本地修改到 github 上: git push origin "branchname"
+
+如果前面您是通过 fork 来做的，那么这里的 origin 是 push 到您的代码仓库，而不是 TuGraph 的代码仓库。
+
+提交合并代码到 Master 的请求 在的代码提交到 GitHub 后，您就可以发送请求来把您改好的代码合入 TuGraph Master 代码了。此时您需要进入您在 GitHub 上的对应仓库，按右上⻆的 pull request 按钮。选择目标分支，一般就是 master，系统会通知 TuGraph 的人员， TuGraph 人员会 Review 您的代码，符合要求后就会合入主干，成为 TuGraph 的一部分。 
+
+请注意会自动检查CI，以及所有Commits中的贡献者是否签署了cla，通过后会有绿色的标识。
+
+### 4.7. 代码 Review
+
+在您提交代码后，您的代码会被指派给维护人员 Review，请耐心等待。如果两个工作日后，仍然没有人对您的提交给予任何回复，可以在 PR 下面留言，并 @ 对应的人员。
+
+对于代码 Review 的意⻅会直接备注到到对应 PR 或者 Issue。如果觉得建议是合理的，也请您把这些建议更新到您的代码中。
+
+### 4.8. 合并代码到Master
+
+在代码 Review 通过后，就由 TuGraph 维护人员操作合入 Master，在此过程中维护人员可能会指定新的Reviewer，提出新的意见需要修改。一般这一步不用参与，代码合并之后，您会收到合并成功的提示。
+
+
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/2.community-roles.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/2.community-roles.md
new file mode 100644
index 0000000000..109a1d8f04
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/2.community-roles.md
@@ -0,0 +1,57 @@
+# 社区角色
+
+## 1. 前言
+本文档描述 TuGraph 社区中成员身份的⻆色，对每种⻆色的要求及权限。 
+
+## 2. ⻆色摘要
+
+这是 TuGraph 社区的⻆色划分，描述了每种⻆色的职责，成为某种⻆色并保持该⻆色的要求，以及相应⻆色的权限。
+
+TuGraph 社区参照 Apache 规范划分为以下三种⻆色：
+
+- Contributor 
+- Maintainer 
+- PMC 
+
+以下描述了每种⻆色的要求、职责和权限。 		 						 					
+## 3. Contributor
+### 3.1. 要求
+在 TuGraph 的任何一个正式项目中成功提交一个 PR 并合并。 
+### 3.2. 职责
+
+- 积极响应指派给您的 Issue 或 PR
+- 一起帮忙回复 Issue 或 PR，把 Issue 分配给对应模块的负责人
+### 3.3. 权限
+
+- 加入 TuGraph GitHub 组织，成为 TuGraph 开源社区的一员。 
+## 4. Maintainer
+### 4.1. 要求
+新的 Committer 由已有的 PMC 推荐，并通过 2/3 以上投票通过，Committer 至少满足以下一个条件：
+
+- 成为社区成员时间超过三个月 
+- 超过 10 个 PMC approve 的 PR 
+- 完成重大功能 
+- 修复严重 Bug 
+- 长期关注项目发展并参与社区讨论
+### 4.2. 职责
+
+- 社区咨询支持
+- 积极响应指派给您的 Issue 或 PR
+- 对于社区重大决定的投票权
+- Review 社区的 PR 
+### 4.3. 权限
+
+- Pull Request review 权限 
+## 5. PMC
+### 5.1. 要求
+
+- 暂不开放，如有强烈愿望请联系PMC
+### 5.2. 职责
+
+- 积极参与社区讨论，对社区重大决策给予指导 
+- 负责保证开源项目的社区活动都能运转良好 
+### 5.3. 权限
+
+- Pull Request review 权限 
+- Pull Request approve 权限 
+- 社区角色成员管理
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/3.individual-cla.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/3.individual-cla.md
new file mode 100644
index 0000000000..f320662638
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# 个人贡献者许可协议
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below. This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project. If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录 A 中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+1. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+1. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+1. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+1. 专利许可的授予。 受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+1. You represent that you are legally entitled to grant the above license.
+1. 您保证您依法有权授予上述许可。
+
+1. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others). You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+1. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第 7 节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+1. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+1. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+1. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+1. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+1. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+1. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+1. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws. The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply. Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+1. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+1. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+1. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign 请签署: ****************\_\_**************** Date 日期: ****\_\_\_\_****
+
+Full name 全名: **************************\_**************************
+
+Mailing Address 信件地址: **********************\_\_\_\_**********************
+
+Telephone 电话: **************************\_**************************
+
+E-Mail 电子邮箱: **************************\_\_**************************
+
+Schedule A 附录 A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..c982085db2
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/4.corporate-cla.md
@@ -0,0 +1,85 @@
+# 公司贡献者许可协议
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below. This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project. If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录 B 中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+3. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+4. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+5. 专利许可的授予。 受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+6. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+7. 您保证您依法有权授予上述许可。您进一步保证下文附表 A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+8. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others). You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+9. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第 7 节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+10. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+11. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+12. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+13. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+14. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+15. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+16. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws. The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply. Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+17. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+18. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+19. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign 请签署: ****************\_\_**************** Date 日期: ****\_\_\_\_****
+
+Company Name 公司名称: **********************\_\_\_\_**********************
+
+Full name 全名: **************************\_**************************
+
+Title 职务: **************************\_**************************
+
+Mailing Address 信件地址: **********************\_\_\_\_**********************
+
+Country 国家: **************************\_**************************
+
+Telephone 电话: **************************\_**************************
+
+E-Mail 电子邮箱: **************************\_\_**************************
+
+Schedule A 附录 A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录 B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/5.roadmap.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/5.roadmap.md
new file mode 100644
index 0000000000..4606b33755
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/5.roadmap.md
@@ -0,0 +1,70 @@
+# 技术规划
+
+## 1. 简介
+该文档是 TuGraph 未来开发的规划，包括正在开发中、不在开发计划里、已经开发完成但不在开源版本里的功能等。
+
+TuGraph定位开源高性能图数据库，图数据采用集中存储的方式，短期 **不会** 考虑基于分片（Sharding）的数据切分，
+而将支持主备复制的模式来解决高并发读的场景，采用云上存储解决存储容量的问题。
+
+## 2. 已完成功能
+
+TuGraph于2022年9月1日开源，TuGraph在社区的反馈声中，进行日常BUG修复，自身能力得到了完善。
+
+| 版本号 | 功能 | 时间 |
+| --- | --- | --- |
+| 3.3.0 | 开源初版 | 2022.9.1 |
+| 3.3.1 | 图分析引擎重构，多模式支持 | 2022.10.14 |
+| 3.3.2 | OGM支持，UT覆盖率提升 | 2022.11.21 |
+| 3.3.3 | 链接认证机制迭代，加入英文文档 | 2022.12.23 |
+| 3.3.4 | 支持上云，梳理LDBC SNB Audit流程 | 2023.1.28 |
+| 3.4.0 | 支持OLAP Python API, 离线导入升级 | 2023.3.11 |
+| 3.5.0 | 支持POG，前端升级，文档梳理 | 2023.6.5 |
+| 3.5.1 | 图学习引擎，Procedure Rust API，存储属性分离 | 2023.7.14 |
+
+除此之外，TuGraph搭建了较为完善的质量体系，涵盖自动化的单元测试、集成测试、性能测试等。
+
+更详细的描述可以在源码目录在的 "[root]/release/CHANGELOG.md" 文件查看。
+
+## 3. 2023年下半年核心版本迭代
+
+上半年高可用功能在计划上延后，图学习的能力提前迭代了一版，下半年将会完成高可用，以及率先支持ISO GQL的预印版本。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| 3.6.0 | 高可用支持 | 2023.8 |
+| 4.0.0 | ISO GQL 语言支持 | 2023.10 |
+
+## 4. 2023年功能更新
+
+在2023年度，除了上述核心功能，还包括如下组件的研发。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| 3.5.x | 日志系统优化 | 2023.7 |
+| 3.5.x | 冷备支持 | 2023.9 |
+| 3.5.x | 支持边upsert导入 | 2023.9 |
+| x.x.x | 支持trigger触发器 | 2023.12 |
+| x.x.x | 探索新存储引擎 | 2023.x |
+| x.x.x | 支持schema快速增删 | 2023.x |
+| x.x.x | TuGraph Brower版本迭代 | 2023.x |
+| x.x.x | 存储过程 Python API 迭代 | 2023.x |
+
+## 5. 期望社区共创的功能
+
+目前团队研发精力并不能实现我们对TuGraph的全部期望，在功能的梳理中，我们发现有一系列值得挖掘的想法，
+团队也有一些初步的探索，期望下面功能能够在社区中共同研发。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| x.x.x | 文档完善 | 2023.x |
+| x.x.x | APOC工具丰富 | 2023.x |
+| x.x.x | 属性默认值支持 | 2023.x |
+| x.x.x | 多属性联合索引 | 2023.x |
+| x.x.x | 在线全量Import支持 | 2023.x |
+| x.x.x | 图权限完善 | 2023.x |
+| x.x.x | NLP支持 | 2023.x |
+| x.x.x | Java Procedure API | 2023.x |
+| x.x.x | 数据库间快速迁移 | 2023.x |
+| x.x.x | 时空数据 | 2023.x |
+
+一些更加简单的功能，我们会在github的issue中打上 good first issue 的标签，欢迎对图数据库感兴趣的技术爱好者共同研讨。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/index.rst
new file mode 100644
index 0000000000..8f6b754ffa
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/6.community-manual/index.rst
@@ -0,0 +1,9 @@
+开发者文档
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..61c73cd6bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# 从关系型数据库导入TuGraph
+
+> 内容待补充
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/7.best-practices/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/7.best-practices/index.rst
new file mode 100644
index 0000000000..dc5546f1d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/7.best-practices/index.rst
@@ -0,0 +1,9 @@
+最佳实践
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/8.faq.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/8.faq.md
new file mode 100644
index 0000000000..61069859ad
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/8.faq.md
@@ -0,0 +1,54 @@
+# FAQ
+
+在 TuGraph 使用过程中，如果遇到问题可优先查看[用户文档](https://github.com/TuGraph-family/tugraph-db/tree/master/doc/zh-CN) 。其次，请查看如下 FAQ 列表是否能够匹配您的问题。
+
+1. **[内核引擎 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussion-4575385)**
+
+   1.1 [TuGraph 的边是否支持索引？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165379)
+
+   1.2 [TuGraph 单机的 QPS 是多少？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussion-4575381)**
+
+   2.1 [可视化文件 build 后如何更新到 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165364)
+
+   2.2 [如何通过 npm run dev，连接已有的 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165366)
+
+   2.3 [3.3.0 版本 TuGraph Browser 删除 node label 失败？](https://github.com/TuGraph-family/tugraph-db/discussions/82#discussion-4465791)
+3. **[客户端 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussion-4575378)**
+
+   3.1 [Client 目前有哪些编程语言，是否支持 Node.js？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165351)
+
+   3.2 [Python Client 是否支持 pip install？Client 在哪里进行引用？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165353)
+
+4. **[数据导入 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussion-4575373)**
+
+   4.1 [TuGraph 可以对接哪些常用数据库？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165335)
+
+   4.2 [如何进行数据导入？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[存储过程 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussion-4575369)**
+
+   5.1 [如何加载存储过程或算法包？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165313)
+
+   5.2 [如何调用或执行存储过程？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165317)
+
+   5.3 [开源内置的算法包在哪里？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[安装部署 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussion-4575364)**
+
+   6.1 [如何使用 docker 镜像安装？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165287)
+
+   6.2 [rpm 包和 deb 包安装后，启动 lgraph_server 服务，提示缺少'liblgraph.so'报错？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165289)
+
+   6.3 [如何在 Mac 的 M1 芯片上编译 TuGraph？](https://github.com/TuGraph-family/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussion-4575018)**
+
+   7.1 [是否支持不定长边的条件查询？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165252)
+
+   7.2 [如何查询最短路径，shortestPath 函数如何使用？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165256)
+
+   7.3 [查询语句 Where 后使用 and 进行拼接查询速度较慢，语句应如何优化改进？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165260)
+
+   7.4 [如何查询任意跳的边？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165262)
+
+   7.5 [Cypher 是否 date()函数？](https://github.com/TuGraph-family/tugraph-db/discussions/91#discussion-4482858)
+
+如果问题仍然无法得到解决，我们推荐您在[Discussions](https://github.com/TuGraph-family/tugraph-db/discussions)跟帖或发起新贴来描述您的问题。同时 TuGraph QA 大汇总也会根据大家在讨论区发起的帖子，进行定期的更新。
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/9.contacts.md b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/9.contacts.md
new file mode 100644
index 0000000000..8537a0f979
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/9.contacts.md
@@ -0,0 +1,28 @@
+# 联系方式
+
+您有任何对产品的意见和建议，欢迎通过以下联系方式加入讨论，或提出建议。
+
+官网: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue (错误反馈、功能讨论)
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions (技术讨论)
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack (在线开发沟通):
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+钉钉群 (技术交流)
+
+![alert](../../images/dingtalk.png)
+
+微信群 (技术交流)
+
+![alert](../../images/wechat_tech.png)
+
+微信公众号 (信息发布)
+
+![alert](../../images/wechat.png)
+
+邮箱（商务沟通等其他问题）: tugraph@service.alipay.com
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/conf.py b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/conf.py
new file mode 100644
index 0000000000..b6b64b9e64
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/conf.py
@@ -0,0 +1,45 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('5.developer-manual/6.interface/3.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="5.developer-manual/6.interface/3.procedure/")
+    breathe_projects = {"cpp_procedure": "5.developer-manual/6.interface/3.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    subprocess.run(shlex.split("rm -rf 3.C++-procedure 4.Python-procedure.rst index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
+    subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
diff --git a/docs/docusaurus/versions/version-3.5.1/zh-CN/source/index.rst b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/index.rst
new file mode 100644
index 0000000000..a993d697a0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.5.1/zh-CN/source/index.rst
@@ -0,0 +1,17 @@
+TuGraph高性能图数据库
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.developer-manual/index.rst
+   6.community-manual/index.rst
+   7.best-practices/index.rst
+   8.faq.md
+   9.contacts.md
diff --git a/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile
new file mode 100644
index 0000000000..d136439c1d
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 3.6.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-CPP-Procedure-API/run.sh b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-CPP-Procedure-API/run.sh
new file mode 100644
index 0000000000..e2455bfbc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-CPP-Procedure-API/run.sh
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+# 0. install: yum install doxygen, graphviz
+# 1. run this script
+doxygen Doxyfile
diff --git a/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/Makefile b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/Makefile
new file mode 100644
index 0000000000..e58ac30a31
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+SPHINXPROJ    = TuGraph
+SOURCEDIR     = .
+BUILDDIR      = _build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/conf.py b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/conf.py
new file mode 100644
index 0000000000..8af367a431
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/conf.py
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+#
+# Configuration file for the Sphinx documentation builder.
+#
+# This file does only contain a selection of the most common options. For a
+# full list see the documentation:
+# http://www.sphinx-doc.org/en/master/config
+
+# -- Path setup --------------------------------------------------------------
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#
+import os
+import sys
+sys.path.insert(0, os.path.abspath('../../../build/output/'))
+
+
+# -- Project information -----------------------------------------------------
+
+project = u'TuGraph'
+copyright = u'2018-2022, Ant Group'
+author = u'Ant Group'
+
+# The short X.Y version
+version = u''
+# The full version, including alpha/beta/rc tags
+release = u''
+
+
+# -- General configuration ---------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#
+# needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.autodoc',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+#
+# source_suffix = ['.rst', '.md']
+source_suffix = '.rst'
+
+# The master toctree document.
+master_doc = 'index'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+# This pattern also affects html_static_path and html_extra_path .
+exclude_patterns = [u'_build', 'Thumbs.db', '.DS_Store']
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+
+# -- Options for HTML output -------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+#
+html_theme = 'nature'
+#html_theme = 'haiku'
+#html_theme = 'pyramid'
+#html_theme = 'sphinxdoc'
+#html_theme = 'bizstyle'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#
+# html_theme_options = {}
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Custom sidebar templates, must be a dictionary that maps document names
+# to template names.
+#
+# The default sidebars (for documents that don't match any pattern) are
+# defined by theme itself.  Builtin themes are using these templates by
+# default: ``['localtoc.html', 'relations.html', 'sourcelink.html',
+# 'searchbox.html']``.
+#
+# html_sidebars = {}
+
+
+# -- Options for HTMLHelp output ---------------------------------------------
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'TuGraphdoc'
+
+
+# -- Options for LaTeX output ------------------------------------------------
+
+latex_elements = {
+    # The paper size ('letterpaper' or 'a4paper').
+    #
+    # 'papersize': 'letterpaper',
+
+    # The font size ('10pt', '11pt' or '12pt').
+    #
+    # 'pointsize': '10pt',
+
+    # Additional stuff for the LaTeX preamble.
+    #
+    # 'preamble': '',
+
+    # Latex figure (float) alignment
+    #
+    # 'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'TuGraph.tex', u'TuGraph Documentation',
+     u'Ant Group', 'manual'),
+]
+
+
+# -- Options for manual page output ------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'tugraph', u'TuGraph Documentation',
+     [author], 1)
+]
+
+
+# -- Options for Texinfo output ----------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'TuGraph', u'TuGraph Documentation',
+     author, 'TuGraph', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+
+# -- Extension configuration -------------------------------------------------
diff --git a/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/index.rst b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/index.rst
new file mode 100644
index 0000000000..3f4bd834af
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/index.rst
@@ -0,0 +1,37 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+TuGraph Procedure API - Python
+====================================
+Version: 3.6.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Noe4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
+
+
+Indices and tables
+-------------------
+
+* :ref:`genindex`
+* :ref:`modindex`
+* :ref:`search`
diff --git a/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/make.bat b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/make.bat
new file mode 100644
index 0000000000..b1d0c9a1dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=.
+set BUILDDIR=_build
+set SPHINXPROJ=TuGraph
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.http://sphinx-doc.org/
+	exit /b 1
+)
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/run.sh b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/run.sh
new file mode 100755
index 0000000000..d10e0a2b1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/autogen/TuGraph-Python-Procedure-API/run.sh
@@ -0,0 +1,7 @@
+# 0. install sphinx-build: yum install python3-sphinx
+# 1. default lgrpah module path: ../../../build/output/lgraph_python.so
+# 2. make lgraph_python
+# 3. run this script
+rm output -rf
+mkdir -p _static _templates
+sphinx-build -W -b html . output
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/.readthedocs.yaml b/docs/docusaurus/versions/version-3.6.0/en-US/.readthedocs.yaml
new file mode 100644
index 0000000000..92cd0965f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/en-US/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/Makefile b/docs/docusaurus/versions/version-3.6.0/en-US/Makefile
new file mode 100644
index 0000000000..a4de0bff18
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?= -W
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/make.bat b/docs/docusaurus/versions/version-3.6.0/en-US/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/1.guide.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/1.guide.md
new file mode 100644
index 0000000000..9609f693fa
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/1.guide.md
@@ -0,0 +1,35 @@
+# Guide
+
+> Here is the document map that helps users learn and use the TuGraph community version quickly.
+
+## Quick Start
+
+> Understand graph technology and TuGraph:[What is a Graph](./2.introduction/1.what-is-graph.md),[What is a Graph database](./2.introduction/2.what-is-gdbms.md),[What is TuGraph](./2.introduction/3.what-is-tugraph.md),[TuGraph Product Architecture](./2.introduction/5.architecture.md)。
+
+> Quickly get started with TuGraph：[Quick Start](./3.quick-start/1.preparation.md),[Movie Demo](./3.quick-start/2.demo/1.movie.md),[TuGraph Browser](./4.user-guide/1.tugraph-browser.md)。
+
+> Install and deploy TuGraph:[Cloud Deployment](./5.developer-manual/1.installation/5.cloud-deployment.md),[Docker Deployment](./5.developer-manual/1.installation/3.docker-deployment.md),[Local Package Deployment](./5.developer-manual/1.installation/4.local-package-deployment.md)。
+
+> Start and run TuGraph:[Tugraph Running](./5.developer-manual/2.running/2.tugraph-running.md),[Compile](./5.developer-manual/2.running/1.compile.md),[Data Warmup](./5.developer-manual/3.server-tools/4.data-warmup.md),[Backup and Restore](./5.developer-manual/3.server-tools/3.backup-and-restore.md),[Log](./5.developer-manual/5.ecosystem-tools/4.log.md)。
+
+## Development Guide
+
+> Client Tools:[Cpp Client](./5.developer-manual/4.client-tools/2.cpp-client.md),[Java Client](./5.developer-manual/4.client-tools/3.java-client.md),[Python Client](./5.developer-manual/4.client-tools/1.python-client.md),[CLI](./5.developer-manual/4.client-tools/5.tugraph-cli.md),[OGM](./5.developer-manual/4.client-tools/4.tugraph-ogm.md)。
+
+> Ecological Tools:[Monitoring](./5.developer-manual/5.ecosystem-tools/1.monitoring.md),[TuGraph DataX](./5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md),[TuGraph Explorer](./5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md)。
+
+> Interface:[Cypher API](./5.developer-manual/6.interface/1.cypher.md),[OLAP API](./5.developer-manual/6.interface/2.olap/1.tutorial.md),[Procedure API](5.developer-manual/6.interface/3.procedure/1.procedure.md),[RESTful API](./5.developer-manual/6.interface/4.protocol/1.restful-api.md),[RPC API](./5.developer-manual/6.interface/4.protocol/2.rpc-api.md)。
+
+## Community Contribution
+
+> Before starting to contribute, you can learn [how to contribute](./6.community-manual/1.contributing.md)
+
+> If you want to understand the division of community roles, please visit [community roles](./6.community-manual/2.community-roles.md)
+
+## Video Center
+
+> [Quick start with TuGraph](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph technology sharing collection](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [Understand graph computing in 3 minutes](https://www.bilibili.com/video/BV15U4y1r7AW/?spm_id_from=333.999.0.0)
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..549043a94c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,15 @@
+# What is Graph
+
+The graph that we're going to introduce today, it's neither a picture, nor a diagram，it's a class of mathematics called graph theory. We can see on the screen that there are two graphs on the left and right, which represent things and their relationship. We abstract it out in a form, and we call such a form a graph.
+
+![alt what is graph](../../../images/what-is-graph-en.png)
+
+The basic elements of a graph are a vertex, and an edge, a vertex is a representation of the thing, of the entity, and an edge is a representation of the relationship between them.
+
+We see the graph on the left, the dots have companies, they have employees, and they have projects. What are their sides? The relationship between the company and the employees is an employment relationship, and there can be a friend relationship between the employees, and there can be a participation relationship between the project and the employees. That is, we can use graphs to abstract things and their relationships.
+
+The diagram on the right is a schematic diagram of a financial transaction. Each of us has a bank account, and when our bank account makes a consumption or makes a transfer, this account is the point on the graph, and this edge can indicate that there is such a transfer relationship between us.
+
+We can also see from this example that edges can attach information and points can attach information. The point can attach which bank this account is in and what the account is. The value of the transaction can be attached to the edge, and many times, if your transaction is large, it indicates that special attention is needed. This edge might not necessarily be the amount of a particular transfer, it might be the amount accumulated over a period of time and so on. Graphs can actually be very expressive.
+
+On the other hand, for a graph like finance, it can be very large. There could be more than a billion points, a hundred billion or even a trillion edges. As you can imagine, it's actually quite challenging to actually work with these graphs.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..935aa4ffa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# What is a graph database
+
+> This document mainly introduce what is a graph database, the advantages of graph database compared with relational database, and the comparison between graph database and relational database
+
+## 1. Introduction
+
+Graph database is a database based on graph model. The main function of graph database is to manage graph data, so it needs to support efficient vertex/edge query and update; To facilitate user use, it is usually necessary to add transaction support to ensure the normal operation of concurrent operations.
+
+## 2. Advantages of graph databases over relational databases
+
+The function of graph database is an extension of traditional relational database. Compared with relational database, the graph structure supported by graph data is more flexible. Graph database is different from other databases in terms of data addition, deletion, query and modification based on graph. On the operation abstraction of graph data, a vertex-based perspective is adopted, for example, a vertex accesses its neighboring vertices through all its outgoing edges. This kind of operation is also the core of the design of graph database system.
+
+The uniqueness of graph database can be reflected in the following three aspects:
+
+### 2.1 Performance
+
+Handling the relationship between data, it is inevitable to use table JOIN operation in relational database, which has a great impact on performance. Graph database is a direct access, similar to pointer access, which is more efficient operation of associated data, compared with relational database performance improvement of 2 to 4 orders of magnitude.
+
+### 2.2 Compatibility
+
+In reality, the process of a project is often evolutionary. The content and even the format of the data are constantly changing. In a relational database, this means that a change in the table structure, or the creation of multiple new tables, significantly changes the source data. In the graph database, you simply add new vertices, edges, and attributes, and set them to the corresponding types. In essence, a table represents a type of data, and a vertex represents a specific data, meaning that relational databases pay more attention to the type of data, while graph databases pay more attention to the individuals of data and identify their association relationships.
+
+### 2.3 Intuitive
+
+Using graphs (or nets) to express real-world relationships is more straightforward and natural, especially in the Internet of Things era. If relational data used, a high degree of abstract thinking required to build a table of characters first, then a table of relations, and finally a map of data. When analyzing and querying the graph data, you can also intuitively find the desired data interactively through the point-edge connection topology, without any professional knowledge.
+
+## 3. Comparison between graph database and relational database
+
+| classification      | model           | advantage                                                            | disadvantage                                                                 | example        |
+| ------------------- | --------------- | -------------------------------------------------------------------- | ---------------------------------------------------------------------------- | -------------- |
+| Relational database | Table structure | Data is highly structured, consistent, and software maturity is high | The multi-hop association query is inefficient or not supported              | MySQL、Oracle  |
+| Graph database      | graph structure | Modeling and manipulating associations is very efficient             | Highly structured data processing is not as powerful as relational databases | Neo4j、TuGraph |
+
+In a word, in the face of massive data storage and processing problems, the traditional relational database has been unable to meet most of the daily data storage needs. Graph database technology can store relational information as entities and expand data model flexibly. Because it provides the most direct expression of related data, and the graph model is naturally tolerant to heterogeneous data. In the future, graph database technology will become one of the most popular technologies, which will provide powerful support for enterprises to store and analyze large-scale graph data.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..5ac85b65d2
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,103 @@
+# What is TuGraph
+
+> This document mainly introduces the main features and characteristics of TuGraph Community Edition, as well as the differences between TuGraph Enterprise Edition and Community Edition.
+
+
+## 1.Introduction
+
+Graph database is a non-relational database that stores data by vertices and edges. It can be used to store complex data network models, such as social networks and transaction networks. TuGraph is a graph database developed by Ant Group. This manual introduces the functions and usage of TuGraph.
+
+## 2.TuGraph Community Edition
+
+The Community Edition is a fully functional version of TuGraph, suitable for single-instance deployment. It provides complete basic fuctions of graph database, such as ACID-compatible transactions, programming APIs, and associated tools. It is ideal for learning TuGraph and implementing small projects.
+
+## 3.TuGraph features
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property graph model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+## 4.The data model
+
+### 4.1.Graph model
+TuGraph is a strong schema, directed property graph database with multi-graph capability.
+
+- Graph Project: Each database service can host multiple graph projects (multi-graphs), and each graph project can have its own access control configuration. The database administrator can create or delete specified graph projects.
+- Vertex: Refers to entity, generally used to express real-world entities, such as a movie or an actor.
+    - Primary Key: User-defined vertex data primary key, unique in the corresponding graph project and vertex type.
+    - VID: Refers to the auto-generated unique ID of the vertex, which cannot be modified by the user.
+    - Upper Limit: Each graph project can store up to 2^(40) vertex data.
+- Edge: Used to express the relationship between vertexs, such as an actor appears in a movie.
+    - Directed Edge: The edge is a directed edge. If you want to simulate an undirected edge, the user can create two edges with opposite directions.
+    - Duplicate Edge: TuGraph currently supports duplicate edges. If you want to ensure the uniqueness of the edge, you need to implement it through business policies.
+    - Upper Limit: Up to 2^(32) edge data can be stored between two vertex data.
+- Property Graph: vertexs and edges can have properties associated with them, and each property can have a different type.
+- Strong-typed: Each vertex and edge has only one label, and after creating a label, there is a cost to modify the number and type of attributes.
+    - Specify the starting/ending vertex type of the edge: You can limit the starting and ending vertex types of the edge, and support different vertex types of the starting and ending vertexs of the same type of edge, such as individuals transferring money to companies, companies transferring money to companies. After specifying the starting/ending vertex type of the edge, you can add multiple sets of starting/ending vertex types, but you cannot delete the restricted starting/ending vertex types.
+    - Unrestricted Mode: Supports creating edge data of this type between any two vertex types without specifying the starting and ending vertex types of the edge. Note: After specifying the starting/ending vertex type of the edge, the unrestricted mode cannot be used again.
+
+### 4.2.The data type
+
+TuGraph Supports a variety of data types that can be used as attributes, the specific supported data types are as follows:
+
+<caption>Table 1. TuGraph supported data types</caption>
+
+| **Type** | **Min**             | **Max**             | **Description**                                  |
+|----------|---------------------|---------------------|--------------------------------------------------|
+| BOOL     | false               | true                | Boolean                                          |
+| INT8     | -128                | 127                 | 8-bit int                                        |
+| INT16    | -32768              | 32767               | 16-bit int                                       |
+| INT32    | - 2^31              | 2^31 - 1            | 32-bit int                                       |
+| INT64    | - 2^63              | 2^63 - 1            | 64-bit int                                       |
+| DATE     | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" Date of format                      |
+| DATETIME | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD hh:mm:ss[.ffffff]"Format of the date and time |
+| FLOAT    |                     |                     | 32-bit float                                     |
+| DOUBLE   |                     |                     | 64-bit float                                     |
+| STRING   |                     |                     | A string of variable length                      |
+| BLOB     |                     |                     | Binary data                                      |
+
+_BLOB data is BASE64 encoded in input and output_
+
+### 4.3.Index
+
+TuGraph supports indexing vertex fields.
+
+Indexes can be unique or non-unique. If a unique index is created for a vertex label, TuGraph will perform a data integrity check to ensure the uniqueness of the index before modifying the vertex of the label.
+
+Each index built on a single field of a label, and multiple fields can be indexed using the same label.
+
+BLOB fields cannot be indexed.
+
+TuGraph supports creating indexes on properties of vertexs or edges to improve query efficiency.
+- The index can be a unique or non-unique index.
+- If a unique index is created for a vertex label, when modifying the vertex of the label, data integrity check will be performed first to ensure the uniqueness of the index.
+- Each index is created based on a property of a vertex or edge, and indexes can be created on multiple properties of the same vertex or edge.
+- An index cannot be created on a BLOB-type property.
+
+## 5.TuGraph Enterprise Edition
+
+The Enterprise Edition has more comprehensive support for commercial features, including distributed cluster architecture, a one-stop graph platform covering exploration, research and development, service and operation and maintenance throughout the lifecycle, online, near-line, and offline graph computing engines, support for streaming and big data data sources, multi-site and multi-center deployment, making it an ideal choice for commercial solutions.
+
+```text
+    If you need to implement production-level high-availability cluster architecture, operation and maintenance and other enterprise-level services, please contact us to obtain commercial support:
+    Email:tugraph@service.alipay.com
+    Tel:0571-85022088,extension number 83789993#
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..de894fa1b0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# Performance Oriented
+
+> This document mainly introduces TuGraph's performance-oriented design philosophy as an open-source graph database.
+
+## 1.Introduction
+
+TuGraph is currently the fastest graph database in the world, ranking first in the LDBC SNB Interactive graph database standard evaluation (March 2023). The design of TuGraph is based on performance optimization, and is committed to building a high-performance single-machine graph database. This document describes the core design of TuGraph's storage layer based on performance optimization.
+
+## 2.Characteristics of Graph Operations
+
+Operations on property graphs involve reading, writing, and their attributes, and the access patterns of some special attributes such as timestamps can also affect overall performance. Here, by summarizing the regularities of some graph operation characteristics, we can guide the final performance.
+
+We observe that many graph applications have similar data access patterns. For example, in credit risk control, we use recursive path filtering to search for many-to-one patterns to find suspicious credit fraud users and behaviors. For online gambling, we can identify gambling-related fund accounts by recognizing multiple fund transfers in a short period of time. The equity penetration scenario recursively calculates the equity relationship between entities. These scenarios have common patterns such as multi-hop entity and relationship access, time window constraints, and read/write transactions.
+Furthermore, from the discussion in the introduction and the analysis of graph workloads, the following characteristics can be summarized:
+
+**Characteristic 1** KHop is the most typical operation in a graph, based on the data access pattern of the graph topology of points and edges, and has essential differences from relational databases. The typicality of KHop is not only reflected in the different data access patterns, but it is also the performance point that graph databases need to pay attention to the most.
+
+**Characteristic 2** Data access of graph workloads has a certain degree of locality on the topology, and the edges of the same point are usually accessed simultaneously. When the labels of these edges are the same, there is a greater probability of simultaneous access.
+
+**Characteristic 3** When accessing points and edges in graph workloads, their corresponding attributes are usually accessed as a traversal filter condition.
+
+**Characteristic 4** In time-based graph workloads, filtering of points and edges is usually within a certain time range, such as the past week.
+
+**Characteristic 5** Write operations may be accompanied by a large number of read operations, which need to be processed in a single transaction cycle.
+
+Through the analysis of actual online graph applications, the read/write ratio of graph workloads is about 20:1, although the scenarios are limited to the financial field and the number of clusters is also limited, the scale of the data involved and the number of users are very large, which is representative to some extent. The 20:1 read/write ratio of graph workloads indicates that the impact of read workload on overall performance is greater, and the performance of write workload cannot be ignored either.
+
+## 3.Storage Data Structures
+
+TuGraph uses B+ trees as the underlying data structure to support real-time transactional operations for insertion, deletion, querying, and updating.
+
+In sorting tree data structures, B+ trees and LSM trees are the main representatives. B+ trees use a split and merge method to update sorted data in tree nodes, while LSM trees append updates to logs for delayed data merging. B+ trees were originally used in file system implementations, solving the problem of differences in performance between sequential and random operations on hard disks by storing data in adaptive-length leaf nodes, and have a relatively balanced read/write performance. The main advantage of LSM trees is to use WAL (Write Ahead Log) to perform updates, which turns update operations into sequential operations, especially in the case of small key-value pairs. WAL means that the update of data is deferred until it is merged in batches, which can improve the comprehensive efficiency of batch updates, but also makes the system scheduling more complicated. If the update merge is not completed, and the data is read again, LSM trees need to read several levels of locally merged logs, which will cause read amplification and space amplification, thereby affecting read efficiency.
+
+To sum up, B+ trees have better sequential read/write performance, while LSM trees have advantages in random write data. In addition, the way of LSM trees using background merging makes the performance fluctuation difficult to predict, and the correlation between performance fluctuation and upper-level storage and computation is weak, which increases the overall design cost. Considering the above factors, TuGraph chooses B+ trees as the implementation for read performance optimization.
+
+## 4.Data Encoding
+
+For property graph models, in addition to graph topology encoding, property data also greatly affects functionality and performance. We first discuss how property data can be encoded together with topology data. From current research, there are two ways of encoding properties: discrete encoding, which stores property data separately based on pointer indexes, and compact encoding, which packs property data and topology data together. Discrete encoding can store each property separately or pack each edge's properties separately, and the following discussion applies to both situations.
+
+Vertex Query: Property encoding mainly focuses on edges and does not involve vertex queries.
+
+Single-Edge Query: Discrete encoding locates edges through pointers, while compact encoding requires binary search to locate the edge position. Discrete encoding has a slight advantage.
+
+Edge Traversal: Discrete encoding requires constant random access through pointer jumps during edge traversal, while compact encoding arranges data together in advance, greatly improving efficiency due to its sequential access feature. Since edge traversal operations are common according to Rule 3, compact encoding has obvious advantages in edge traversal.
+
+Single-Edge Update: Discrete encoding only requires finding the corresponding pointer position and modifying the pointer's location before and after inserting data. Compact encoding needs to re-encode the compactly arranged data and rewrite the entire edge value, resulting in significant overhead compared to discrete encoding.
+
+Batch Edge Update: Batch updates can pre-build all edge properties for a vertex in memory and write them in one encoding, making both discrete encoding and compact encoding equivalent. However, compact encoding does not require storing pointer variables, so it has higher storage space efficiency.
+
+The performance issues of discrete encoding and compact encoding for a certain type of query discussed above can be alleviated through optimization. Overall, due to the 20:1 read-write load of graphs and the characteristics of property access revealed by Rule 3, TuGraph tends to use compact encoding to ensure read performance. Its main weakness is the overhead of re-encoding during single-edge updates, which can be solved using adaptive mapping technology.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..c60df29973
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,33 @@
+# Multi Level Interfaces
+
+> This document mainly introduces the design concept of TuGraph's multi-level interfaces.
+
+## 1.Introduction
+
+The multi-level interface is a balance between usability and high performance that TuGraph has designed to meet a variety of use cases. For example, Cypher, a declarative graph query language, can abstract away the implementation details of a graph database and express queries based on the graph model. However, Cypher's high-level descriptions cannot be efficiently translated into low-level execution, so TuGraph provides a procedural language, Procedure API, to achieve optimal database performance.
+
+Interfaces can be roughly divided into client interfaces and server interfaces. Most operations are performed on the server, and the client only does data encapsulation and parsing. The client and server are connected through a network, and TuGraph supports both flexible short-connection REST protocol and more efficient long-connection RPC protocol, which can be selected according to different business scenarios.
+
+The server interfaces are all at the calculation layer and are logically separated from the graph data storage by a Core API layer.
+
+![Multi Level Interfaces](../../../../images/multi-level-Interfaces-en.png)
+
+### 1.1.Client Interface
+
+The client interface refers to the interface executed on the client and is typically used for integration into software applications. TuGraph's client interface is relatively simple, including login/logout, data import/export, stored procedure loading and calling, and Cypher operations. Cypher integrates most of the functions, including data operations, graph model operations, operations and account management.
+
+Since the parameters and return values of Cypher are strings, JAVA OGM is a structured wrapper for Cypher, meaning that query results can be encapsulated into a typed object for ease of use.
+
+### 1.2.Server Interface
+
+The server interface includes Cypher, Procedure API, OLAP API, and GNN PI, which provide services for graph transaction engines, graph analysis engines, and graph neural network engines. The characteristics of each interface are explained in detail below.
+
+> __Cypher__ is an abstract description of query logic that is independent of execution logic and is more user-friendly for graph database applications, similar to the SQL language of relational databases. TuGraph's Cypher language mainly follows the OpenCypher query standard open-sourced by Neo4j and extends auxiliary functions such as operations and maintenance management. Descriptive graph query language will become the main data operation method for graph databases, but generating the optimal execution plan between description and execution still requires a long way to go in both academia and industry.
+
+> __Procedure API__ is designed to bridge the gap between descriptive graph query language and optimal performance. TuGraph's Procedure API provides a simple wrapper on top of the Core API, which maximizes the storage's performance efficiency and is the upper limit of Cypher optimization performance. Python Procedure API is a cross-language wrapper on top of C++ Procedure API, but the copying of values during translation may result in some performance loss, and its advantage lies mainly in the ease of use of the Python language. The traversal API is a parallel-executing Procedure interface that is more similar to set operations in terms of description, such as expanding all outgoing neighbors of a point set to obtain a new point set.
+
+> __OLAP API__ belongs to the category of "graph computing systems" and exports snapshots of graph data from storage that supports insert, update, delete, and query operations to support read-only complex graph analysis in a more compact data storage format. OLAP API encapsulates data structures that support high-concurrency execution, including Vector, Bitmap, and CSR-based graph snapshot data structures, and provides a set of concurrent fast point-edge operation frameworks. After the graph analysis task is completed, the data can be written back to the graph database through the interface.
+
+> __GNN API__ mainly provides the interfaces needed for graph neural network applications and can be integrated with machine learning frameworks such as PyTorch. TuGraph's GNN PI mainly integrates DGL and completes the entire process from graph storage to graph neural network application in the Python language environment.
+
+Except for Cypher's interpretive execution, all other server interfaces are compiled and executed, meaning that the corresponding code needs to be sent to the server and compiled (which may take some time) before execution on the server. Therefore, it is usually necessary to load the program first, then find it in the list of loaded applications, and execute it after passing in the input parameters.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/3.htap.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/3.htap.md
new file mode 100644
index 0000000000..080cc02e48
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> This document mainly introduces the design philosophy of TuGraph's HTAP.
+
+## 1.Introduction
+
+![htap](../../../../images/htap-en.png)
+
+There are different ways to implement HTAP in architecture: one is to use two different copies to handle OLTP and OLAP tasks separately, with the core being data consistency synchronization and additional resource overhead; the other is to use the same data storage at all times, but this implementation has memory bloat in its data structure and needs further work for industrialization. In TuGraph's design, simple OLAP and OLTP operations share the same data, while complex OLAP operations are exported and handled separately as snapshots.
+
+## 2.Design
+
+In TuGraph, OLTP is the graph transaction engine, corresponding to transaction operations in Figure; OLAP is the graph analysis engine, corresponding to simple graph analysis operations (such as SPSP) and complex graph analysis operations (such as PageRank), the former of which can be executed directly on the graph storage, while the latter requires exporting a snapshot for execution.
+
+- Transaction operations, measured by the graph transaction engine, are local graph add, delete, query and modify operations, typically used for K-hop access.
+- Simple analysis operations are the simpler part of the graph analysis engine, usually local graph analysis operations, such as the shortest path algorithm SPSP and Jaccard algorithm.
+- Complex analysis operations are the more complex part of the graph analysis engine, usually involving multi-round data iteration operations across the entire graph, such as the PageRank algorithm for webpage ranking and the Louvain algorithm for community discovery.
+
+As shown in Figure , external storage is added to the architecture diagram, making the data source for graph analysis not limited to the graph database and can be directly read from text files.
+
+- Graph storage, which is the storage in the graph database, has carefully designed data structures that can perform real-time add, delete, query and modify operations.
+- External storage, which can be an RDBMS or text file, is stored in a simple way as an edge table, only for one-time batch reading and batch result writing. In the calculation layer, it corresponds to the interface in the overall architecture diagram.
+- Cypher, the declarative graph query language, can be executed concurrently.
+- Procedure API, the procedural graph query language, is flexible and can support both transaction operations and graph analysis operations, but its efficiency is not sufficient to complete complex graph analysis operations, and it can be executed concurrently.
+- OLAP API, for multi-round iteration of complex graph analysis. Applications need to first export the graph data in storage into a snapshot in memory, which is only used for fast access and does not need to consider the write support of ACID, so it can be arranged more compactly, and the read efficiency of CSR arrangement is much higher than that of graph storage data arrangement. OLAP API can only be executed serially, and each operation uses full CPU resources.
+
+OLAP API snapshots can be created from external storage, where the edge table data is formatted as CSR, or from the graph storage. It should be noted that OLAP API requires that the IDs of the vertices be consecutive natural numbers, which may require additional ID mapping. This step can be mapped to a specified attribute when creating a snapshot or directly using the attribute value as the ID.
+
+Corresponding to the calculation interface and storage, there are four operating modes.
+
+- Transaction mode, each operation corresponds to a Cypher statement, which is a transaction by default.
+- Plugin mode, call through plugins, after the calculation logic is loaded on the server, also known as stored procedures.
+- Embed mode, which has the same interface as Plugin mode but the graph database service does not need to be started and can directly call the data in the database through the interface. This mode is usually used for debugging Procedure API and OLAP API code, and the debugging information and operation steps are more friendly than Plugin mode.
+- Standalone mode, which maximally separates from the graph database, is more direct when only using the graph analysis engine for data analysis. Standalone mode will directly use the data of the external storage.
+
+The use of the graph neural network engine is similar to the 'complex graph analysis operation', which calls part of the OLAP API and GNN API at the same time, which is not elaborated here.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/index.rst
new file mode 100644
index 0000000000..b42c13eac8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/4.characteristics/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Characteristics
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/5.architecture.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/5.architecture.md
new file mode 100644
index 0000000000..198facd84b
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/5.architecture.md
@@ -0,0 +1,15 @@
+# Architecture
+
+> This document mainly introduces the product architecture of TuGraph.
+
+## 1.Introduction
+
+![Architecture](../../../images/architecture-en.png)
+
+The following diagram shows the overall architecture of an enterprise-level graph database from the perspective of functional modules, using TuGraph as an example, from bottom to top:
+
+- Software and hardware environment. This involves the development and use environment of the graph database. TuGraph is mainly developed based on the underlying C++ language, and is compatible with most operating systems and CPUs on the market.
+- Storage layer, including the KV storage layer and the graph storage layer. The storage layer needs to support various functions required by the calculation layer.
+- Calculation layer. The calculation layer should include the graph transaction engine, graph analysis engine, and graph neural network engine. It also includes a variety of programming interfaces provided by the server, including descriptive query language Cypher, stored procedures, and so on.
+- Client. The client SDK should support multiple languages such as Java, Python, and C++, and also support command-line interaction. The Browser and Explorer reduce the threshold for using the graph database through web-based interaction.
+- In terms of ecological tools, it covers the development, operation, and management links of enterprise-level graph databases, improving usability.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/6.functionality.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/6.functionality.md
new file mode 100644
index 0000000000..eaf709f08e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/6.functionality.md
@@ -0,0 +1,101 @@
+# Functionality
+
+> This document mainly introduces the main functions and features of TuGraph.
+
+## 1.Installation
+
+## 1.1.Installation
+
+Deployment methods TuGraph currently provides three deployment methods: cloud deployment, Docker deployment, and local package deployment. Users can choose the appropriate deployment method according to their actual situation.
+
+## 1.2.Software and Hardware Environment
+
+TuGraph core is developed in C++, and the default compiler used is GCC8.4, using c++14 standard. Some functions use other compilers, such as ApacheLucene-based full-text indexing, which uses JNI interface and requires a Java compiler. In addition, the Python Procedure API is provided in the stored procedure, which requires a Python environment. TuGraph does not require special hardware such as GPUs, and can naturally adapt to general hardware upgrades such as RDMA and HBM with high latency and low bandwidth.
+
+TuGraph has been tested on CPUs based on X86 and ARM, including Intel, AMD, Kunpeng, Hygon, Feiteng, etc., and also runs on multiple operating systems, including mainstream versions of Ubuntu, CentOS, SUSE, Galaxy Kylin, Zhongbiao Kylin, and UOS, without special requirements for operating systems and CPUs.
+
+The software and hardware environment also includes the environment of dependent libraries. Since the default KV storage in TuGraph's storage layer is LMDB, the file system needs to support POSIX interfaces. The compilation and parameter configuration in different environments will be slightly different. For example, in the packaging of point-edge data in graph storage, it should match the page table size of the operating system, which is 4KB by default, and it is recommended to set the system's page table size to 4KB.
+
+## 2.Storage layer
+
+In the graph data model, TUGraph supports the attribute graph model, which can be divided into subgraphs, tags (including vertex tags and edge tags), and attributes according to the hierarchy.
+
+From the perspective of the storage layer, TuGraph uses an intuitive multi-layered tree model, without tags across subgraphs or attributes across tags, and only retains the core logic of the graph model. In terms of subgraph storage, TuGraph has performed data physical isolation for multiple graphs, and each graph corresponds to an instance of LMDB. The metadata description information of multiple graphs is saved in a special public LMDB instance called meta. The storage of vertex and edge tags and their attributes maps graph data adaptively to KV key-value pairs, maximizing read performance. At the same time, multi-threaded writing is implemented at the KV layer, solving the disadvantage of low write performance of LMDB. Primary key indexes and secondary indexes correspond to B+ tables in LMDB, supporting index value addition, deletion, query, and modification based on comparison.
+
+The storage layer also retains some other non-core functional data, including permission data, pre-compiled plugin data, and monitoring data.
+
+## 3.Calculation layer
+
+The calculation layer is divided into three parts in terms of function, including the TP-class graph transaction engine, the AP-class graph analysis engine, and the graph neural network engine.
+
+__The graph transaction engine__ is mainly used to process concurrent graph operations, including single-point queries, neighbor queries, and path traversal. The graph transaction engine focuses on ACID transactions of concurrent operations, ensuring that the operation logic will not interfere with each other. The main performance indicator is QPS, which is the number of completed queries per second.
+
+__The graph analysis engine__ usually operates as a full-graph iteration. Some simple analysis tasks (such as SPSP) can be completed by the graph transaction engine, and complex analysis tasks are completed by the graph analysis engine, which usually takes several seconds to several hours for a single task. Therefore, a single graph analysis task should use all hardware resources in parallel, and the performance indicator is the total time for completing the task.
+
+__The graph neural network engine__ usually operates as a full-graph iteration. In addition to graph topology-based operations, the graph neural network engine also needs to integrate a machine learning framework to handle vector operations, such as PyTorch, MXNet, and TenserFlow.
+
+The logic of the three engines is different and independently configured for resource pools. The graph transaction engine sets up a thread pool based on RPC operations. For each operation received from the client, a thread is taken from the pool to process it, and the number of concurrent executions is equal to the capacity of the RPC thread pool, which is usually configured as the number of server cores. The graph analysis engine has an analysis thread pool, and each graph analysis task is executed concurrently, that is, all threads are used to execute a task to speed up the performance of the operation. The serial execution feature of TuGraph graph analysis operations will restrict the user experience to a certain extent. The demand for concurrent graph analysis can be processed by deploying high-availability, increasing machine resources, or connecting to an external task scheduler to transfer data to a container for real-time scheduling and calculation. Graph neural network operations will reuse the resources of the graph transaction
+
+## 4.Core Features
+
+### 4.1.Query Language
+
+TuGraph provides Cypher graph query language that follows the OpenCypher standard.
+- Supports Procedure embedding.
+- Supports pluggable optimization frameworks with various optimization features.
+- Supports extensible security check framework for Cypher.
+
+### 4.2.Stored Procedures
+
+When users need to express complex query/update logic that Cypher cannot describe, or when high performance is required, TuGraph's stored procedures (Procedure) is a more concise and efficient choice than calling multiple REST requests and completing the entire processing flow on the client-side.
+
+### 4.3.Data Import/Export
+
+Although TuGraph supports data insertion, batch import can greatly improve efficiency. The import function can be divided into importing into an empty database (offline import) and incremental import. The former refers to importing when the subgraph is empty, and the additional assumption can greatly improve the import performance. In TuGraph, the throughput rate of empty database import and incremental import differs by 10 times. Data consistency needs to be considered in data export, which is based on exporting data based on a snapshot.
+
+TuGraph can perform data export on graph data already stored in TuGraph using the command-line tool `lgraph_export`. The export format supports CSV and JSON.
+
+### 4.4.Backup and Restore
+
+ TuGraph's backup function can be divided into active/scheduled, offline/online, and full/incremental backup. The goal is to complete the backup with the smallest storage and computing costs possible. The Restore function can restore to the latest state or a historical marked time point, ensuring that the database is in a consistent state.
+
+### 4.5 Data Warmup
+
+TuGraph is a disk-based graph database, and data is loaded into memory only when it is accessed. Therefore, system performance may deteriorate due to frequent IO operations in the first period after the server is opened. We can improve this problem by preheating the data in advance.
+
+### 4.6 High Availability Mode
+
+High availability means that by configuring a cluster, real-time multi-replica data hot backup can be achieved, and the cluster can still provide services when some replicas are not in use. TuGraph uses the multi-machine hot backup mechanism of the RAFT protocol, which can reduce RPO to near 0. Data synchronization is performed at the computation layer through RPC interfaces for write operations. The high availability cluster of TuGraph adopts a master-slave mode, where only the master node processes write requests, and both master and slave nodes can process read requests. The write request processing of the master node needs to be synchronized to more than half of the total nodes. The write request is considered complete when the majority of the nodes have written successfully.
+
+## 5.Client Tools
+
+Client Tools Client tools mainly include SDKs for various programming languages, OGM, and command-line tools.
+
+The client SDK is mainly used for secondary development and can be linked to the server through RPC or REST protocols. RPC has better performance based on long links, and data needs to be uniformly serialized through protobuf. TuGraph uses brpc, which supports rpc clients in Java, Python, and C++. REST's protocol is more flexible and can be easily adapted to more diverse environments, and different programming languages can easily connect. TuGraph provides a Python REST client instance, and command-line interaction is also implemented using REST.
+
+OGM (Object Graph Mapping) is a graph object mapping tool for TuGraph, which supports mapping JAVA objects (POJO) to TuGraph. Classes in JAVA are mapped to nodes in the graph, collections in classes are mapped to edges, and properties of classes are mapped to properties of graph objects. It also provides corresponding function to operate the graph database. Therefore, JAVA developers can easily use TuGraph database in a familiar ecosystem.
+
+The command-line tool `lgraph_cypher` is a query client that can be used to submit OpenCypher requests to the TuGraph server. `lgraph_cypher` client has two execution modes: single-command mode and interactive mode.
+
+
+## 6.Ecological Tools
+
+Ecological tools are a crucial component of enterprise-level databases, and a rich array of ecological tools can greatly enhance the usability and stability of graph databases.
+
+### 6.1.TuGraph DataX
+
+![Import&Export](../../../images/tugraph-datax.png)
+
+TuGraph's core supports importing and exporting CSV and JSON data, offering both full database and incremental importing modes. In practice, there may be a need to import from multiple data sources such as MySQL, Kafka, and Hive, and TuGraph connects to these sources using DataX. Due to the differences between relational and graph models, data cleaning processes can be quickly processed using SparkSQL. TuGraph focuses only on the reliability and performance of simple CSV and JSON scenario imports.
+
+### 6.2.Visual Interaction
+
+TuGraph Browser is a visual interface for direct users of graph databases, covering most of TuGraph's capabilities, including data import, graph model building, data addition/deletion/query/modify, and monitoring and maintenance operations.
+
+TuGraph Explorer targets graph business users and focuses more on business logic. Explorer is a visual interactive interface generated using Graph Insight's zero-code programming framework, which can easily add more user-friendly interactive elements to present the graph as an underlying image of understanding.
+
+### 6.3.Monitoring
+
+TuGraph uses the Prometheus + Grafana monitoring framework in a loosely coupled manner. Prometheus obtains monitoring information from TuGraph's monitoring interface, stores it in a local time-series database, and then displays it interactively on the web using Grafana.
+
+The monitoring states provided by TuGraph include the state of the graph database and the state of the server. The former includes the database-side status such as read/write load and number of vertices/edges, while the latter includes the real-time status of the server's memory, CPU, and hard disk. If some monitoring state exceeds the expected threshold, proactive alerts are necessary, usually requiring integration with other operations and control systems such as group messaging and email alerts.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/7.scenarios.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/7.scenarios.md
new file mode 100644
index 0000000000..9d5a7ac434
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/7.scenarios.md
@@ -0,0 +1,61 @@
+# Scenarios
+
+> This document mainly introduces the application scenarios of graph databases.
+
+## 1.Financial Industry
+
+The entities in the financial industry mainly involve people, companies, accounts, products, etc., and their relationships include transaction relationships, logging relationships, equity relationships, employment relationships, etc. These entities form a financial graph data network. By applying graph databases, we can discover a lot of useful information from the financial graph data network, which helps us make more accurate financial decisions.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Loan review|By analyzing the applicant's relationship and transaction history, etc., it is auxiliary to judge the applicant's repayment ability and willingness. It can be applied to retail loan review, small and micro loan review, supply chain finance, etc. This method can complement the traditional audit mechanism based on the applicant's own information, which is particularly useful for small and micro loan audits with low individual information coverage.|
+|Post-loan|By analyzing the borrower's transaction history, it assists in analyzing whether the borrower has default risk. Compared with the traditional method of issuing alerts only when loan funds flow to specific users, this method can assign a risk value to each account and issue warnings when the loan flows to high-risk accounts.|
+|Missing recovery|By analyzing the social and shopping data of missing borrowers, other contact methods can be found. This method can significantly improve the recovery rate of missing borrowers.|
+|Guarantor loop detection|Special guarantee structures such as cyclic, chain, family-style, and cross can be found in the guarantee relationship graph to expose potential risks. Compared with the JOIN method of a relational database, the solution based on graph algorithms is more efficient, can detect any length of guarantee loop, and can achieve more complex limited condition detection.|
+|Credit card fraud detection|A relationship network of addresses, contact information, etc. in credit card application information is constructed, and a community discovery algorithm is run in the application relationship network to detect suspected fraudulent gangs, thereby rejecting suspected fraudulent applications and reducing economic losses.|
+|Anti-money laundering|Suspected money laundering behaviors and links can be found through the transaction network and medium network. Money laundering is a complex process involving multiple parties. By conducting graph analysis in transaction and social networks, we can more accurately detect money laundering behaviors.|
+|Car insurance anti-fraud|For insurance fraud involving repair shops, by analyzing the relationship between the insured person, the case location, and the repair shop, fraudulent claims can be more accurately identified, reducing economic losses.|
+
+## 2.Industrial Industry
+
+A large amount of heterogeneous data will be generated in the production and manufacturing process, and how to effectively organize and manage these data is one of the most important issues in industrial big data. These data include design documents, equipment data, simulation plans and results, experimental results, experience documents, etc. The relationships between these data are complex, and traditional data management systems can only accumulate data, and they are often unable to search for related materials. Using graph models, these different types of data are organized into a network, which makes it easy to browse and search for data.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Supply chain management|Supply chain data mainly concerns the correspondence between products, components, and parts, the correspondence between parts and suppliers, and sensitive components in parts. Compared with the traditional BOM system, the solution using graph databases can more conveniently maintain complex networks of multiple component levels and multiple supplier levels, thereby providing basic support for a through supply chain.|
+|Document management|Using graph databases can organize different types of documents together organically according to different relationships. For example, design documents for components, component-part relationships, component test documents, relevant experience documents, etc. can be organized together so that all relevant information for the component can be obtained easily when needed.|
+|R&D process management|A large amount of simulation, experimentation, and testing needs to be performed in the product development and verification process. Each test process involves many different steps, the connection between the steps, the data versions used in each step, and the algorithm versions all make up a complicated relationship network. Using graph databases can better manage this relationship network, providing a good foundation for data reuse and process improvement in the R&D process.|
+|Equipment information management|Manufacturing requires the management of a large number of devices, which are interrelated (power supply, feeding, spatial relationship) to form a complex network. Traditional databases are difficult to reflect this complex relationship. Using graph databases can easily represent these relationships, thereby better managing equipment information.|
+
+## 3.Smart City
+
+With the development of technology, intelligent management of cities has become a major trend. Intelligent management requires a strong system software to support it, built on a good information management platform. In an intelligent city management system, an intelligent decision-making system needs to make decisions based on a large amount of different information, including various topology information (such as roads, pipelines, etc.), supply and demand information (such as electricity transmission, drinking water supply, sewage discharge, etc.), environmental information (such as temperature, humidity, rainfall, etc.), and so on. To manage these complex and heterogeneous data organically and make decisions based on them, a mature system is needed. Traditional data management systems based on relational data models are not suitable for managing such complex and heterogeneous data. Using a graph model can solve this problem well. If we manage these different data using a graph database, we can achieve many complex intelligent management scenarios.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Smart Traffic|Based on road topology, road capacity, and current traffic flow, intelligent traffic signal scheduling can be performed to improve traffic efficiency.|
+|Smart Drainage|Based on drainage system information and current rainfall, the drainage system can be scheduled to reduce the occurrence of waterlogging.|
+|Pipeline Management|Organizing the production, installation, topology information, and historical status information of pipelines can help us manage the pipelines throughout their lifecycle, including fault diagnosis, life assessment, etc.|
+|Crowd Evacuation|When a large number of people need to be evacuated, multiple transportation modes such as buses, subways, taxis, shared bicycles, etc., need to be considered, as well as the road carrying capacity. Using a graph database to organically integrate this information can help us make better decisions and provide better support for large public events.|
+
+## 4.Social Governance
+
+Social governance involves public safety, legal affairs, public opinion, network security, and more. Social governance is a comprehensive, multi-system linkage problem. It requires the synthesis of a large amount of data and global considerations to make better decisions. In this multidimensional and complex data problem, the graph data model can provide better adaptability and provide a solid foundation for intelligent social governance decision-making platforms.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Criminal Gang|Conspiratorial gangs will inevitably make contact through some means, including face-to-face meetings (appearing in the same place), phone calls, or internet contacts, and they may also have economic exchanges. If we store all of this data in a unified graph, we can use graph analysis algorithms to identify closely connected groups and then discover and identify the entire criminal gang.|
+|Stakeholder Case Investigation|Stakeholder cases, especially stakeholder economic cases, often involve a large number of personnel and elements (money, location, events, etc.). How to effectively organize this information to provide evidence for handling cases is a difficulty in stakeholder case investigation. Using graph databases to store and analyze this information can help us quickly locate the data, analyze the personnel structure, and provide better technical support for case investigation.|
+|Illegal Website Identification|Illegal websites, phishing websites, yellow websites, and so on, often use different domain names and IPs to avoid being blocked. The filter method based on a blacklist can only block known illegal websites and cannot effectively identify new domain names and IPs. Based on the IP-domain name network mapping relationship, we can create a graph and then use graph calculations to establish a "trustworthiness" model for domain names and IPs to determine whether a website belongs to an illegal website.|
+|Court File Management|Case files are often complex, and different cases may be linked through parties, locations, case nature, judges, and so on. These links constitute a complex network. Using a graph database, we can more conveniently manage these complex relationships and improve case handling and query efficiency.|
+
+## 5.Internet
+
+Social networks and person-product purchase relationships can all form a network. By analyzing this network data, we can provide users with better services, including relevant recommendations, user information collection, important user identification, and spam user identification, and so on.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|ID-Mapping|Graph databases can store all user-related information, including the relationships between users, in one database, and can also use these relationships to identify situations where one person has multiple accounts or multiple people share an account, thus providing decision support for future risk control, recommendations, and other businesses.|
+|Friend Recommendation|Based on the analysis of social networks, we can provide friend recommendations such as "friends of friends" and "common friends".|
+|Product Recommendation|Based on the user-product relationship graph, we can find users with similar interests and recommend other products that similar users have chosen.|
+|Spam User Identification|Traditional spam user identification is mainly based on user account information, such as registration information and posting information, but these types of information are relatively easy to forge. On the other hand, network-based information doesn't have this problem: it's difficult to forge. Therefore, spam user identification based on network information can be more accurate and efficient.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/8.glossary.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/8.glossary.md
new file mode 100644
index 0000000000..6f2aa1629a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/8.glossary.md
@@ -0,0 +1,27 @@
+# Glossary
+
+## 1.Graph Technology
+
+> __Graph Computing__:Generalized graph computing, including graph databases, graph analysis, and graph learning; Narrowly defined graph computing only includes graph analysis. The generalized definition is used by default.
+
+> __Graph Database__:Focuses on operations such as adding, deleting, modifying, querying, and transaction processing for graph data, such as TuGraph DB.
+
+> __Graph Analysis__:Focuses on algorithmic analysis and pattern analysis of entire graph data, such as TuGraph Analytics.
+
+> __Graph Learning__:Refers to the same meaning as graph neural networks and graph machine learning, such as TuGraph Learn.
+
+> __Graph Intelligence__:Same as generalized graph computing, including graph databases, graph analysis, and graph learning. It is usually used for conceptual promotion and not for products.
+
+## 2.Specific Concepts
+
+> __Vertex__:Also known as node or point. Avoid using the term "node" as it is often used to refer to the number of servers and can be easily confused. "Node" refers to the meaning of combination, intersection, and crossing; "node" can refer to a milestone on a timeline (key node) or a processing entity in a computer system (such as a server in a computer network).
+
+> __Edge__:Refers to the connection between two vertices.
+
+> __Degree__:Refers to the number of incoming or outgoing edges on a vertex. Note that in non-graph theory scenarios, "hops" are often referred to as "degrees".
+
+> __Hop__:Refers to the number of vertices between two vertices on a path (excluding the starting point and including the endpoint). "K-Hop" in the algorithm performance test refers to this meaning.
+
+> __Vertex Label__:Refers to the type of a vertex, also known as a point label.
+
+> __Edge Label__:Refers to the type of an edge, also known as an edge label.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/index.rst
new file mode 100644
index 0000000000..a42b1d7c5a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/2.introduction/index.rst
@@ -0,0 +1,16 @@
+TuGraph DB Introduction
+=================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.characteristics/index.rst
+   5.architecture
+   6.functionality
+   7.scenarios
+   8.glossary
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..09d47e172f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/1.preparation.md
@@ -0,0 +1,86 @@
+# Quick Start
+
+> This document is intended for new users to get started quickly and contains an introduction, features, installation, and use of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property Graph Model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+### 1.1.Supported Platforms
+
+TuGraph supports both X86_64 and ARM64 architectures in physical, virtual, and containerized environments.
+
+### 1.2.Hardware requirements
+
+_You are advised to use NVMe SSDS with large memory configurations for optimal performance。_
+
+| Hardware | Minimum Configuration | Recommended configuration |
+| -------- | --------------------- | ------------------------- |
+| CPU      | X86_64                | Xeon E5 2670 v4           |
+| Memory   | 4GB                   | 256GB                     |
+| Disk     | 100GB                 | 1TB NVMe SSD              |
+| System   | Linux 2.6             | Ubuntu 18.04, CentOS 7.3  |
+
+## 2.Installation
+
+TuGraph can be installed quickly via Docker Image or locally via RPM /deb packages.In addition, TuGraph offers community edition services on Alibaba Cloud Computing Nest, which means you don't need to purchase your own cloud host to quickly deploy TuGraph services and achieve operational monitoring, thus building your own graph application.
+
+> Official Website RPM /deb packages Download:[TuGraph DownLoad]( https://www.tugraph.org/download ).
+
+> The TuGraph image is hosted on DockerHub[DockerHub]( https://hub.docker.com/u/tugraph ).
+
+> The Cloud deployment can be searched on Aliyun Computing Nest or accessed quickly through the [deployment link]( https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true).
+
+### 2.1.Fast experience through Docker
+
+1. The Docker environment installed locally
+
+   The docker official documentation：https://docs.docker.com/get-started/
+
+2. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. Start docker
+
+   ```shell
+   docker run -d -p 7070:7070 -p 9090:9090 --name tugraph_demo tugraph/tugraph-runtime-centos7 lgraph_server
+   # 7070 is default http port，for web visiting。
+   # 9090 is default RPC port，for RPC client visiting。
+   ```
+
+4. Open by browser
+
+   `http://x.x.x.x:7070`
+
+   > Default account `admin`,Default password `73@TuGraph`
+
+5. Start
+   ```shell
+   docker run -dt -p 7070:7070 --name tugraph_demo tugraph/tugraph-runtime-centos7
+   docker exec -it tugraph_demo bash
+   # start the service
+   lgraph_server -d start
+   ```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..2ec92747d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# DEMO:Movie
+
+> This document mainly introduces the usage of the movie demo.
+
+## 1.Modeling and Data Import
+
+After logging in, click "Help", click "Quick Start", click "One-Click Model Creation", click "One-Click Data Creation", and complete the creation of the Movie Scene Graph.
+
+Movie：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| Label       | Type   | Description                                                                                           |
+|-------------|--------|-------------------------------------------------------------------------------------------------------|
+| movie       | Vertex | Represents a specific movie, such as "Forrest Gump".                                                  |
+| person      | Vertex | Represents a person, who may be an actor, director, or screenwriter for a movie.                      |
+| genre       | Vertex | Represents the genre of a movie, such as drama, horror.                                               |
+| keyword     | Vertex | Represents some keywords related to the movie, such as "save the world", "virtual reality", "subway". |
+| user        | Vertex | Represents a user who watches movies.                                                                 |
+| produce     | Edge   | Represents the relationship between the producer of a movie.                                          |
+| acted_in    | Edge   | Represents the relationship between actors and the movies they have appeared in.                      |
+| direct      | Edge   | Represents the relationship between a movie and its director.                                         |
+| write       | Edge   | Represents the screenwriting relationship of a movie.                                                 |
+| has_genre   | Edge   | Represents the genre classification of a movie.                                                       |
+| has_keyword | Edge   | Represents some keywords of a movie, which are more specific labels for classification.               |
+| rate        | Edge   | Represents the rating given by a user to a movie.                                                     |
+
+## 2.Query Examples
+
+### 2.1.Example One
+
+Query all actors of the movie 'Forrest Gump' and return the subgraph composed of the movie and the actors.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.Example Two
+
+Query all actors of the movie 'Forrest Gump' and list the roles they played in the movie.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.Example Three
+
+Query all movies rated below 3 by Michael.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.Example Four
+
+Query users who have the same dislike of movies as Michael, where the standard for dislike is a rating of less than three.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.Example Five
+
+Recommend movies to Michael by first finding users who dislike the same movies as Michael, and then filtering out the movies that these users like.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.Example Six
+
+Query the movies that Michael's friends like.
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.Example Seven
+
+By querying the movies that people who gave 'Forrest Gump' a high rating also like, recommend similar movies to users who like 'Forrest Gump'.
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..e07192fa2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,48 @@
+# DEMO:Wandering Earth
+
+> This document mainly introduces the usage of the Wandering Earth demo.
+
+## 1.Demo Scene Design
+
+The demo is based on the story background of The Wandering Earth 1 and The Wandering Earth 2.
+
+- Based on the plot, a graph structure is designed, including three types of points: organization, character, celestial body, and facility, and two types of edges: event and relationship.
+- Prepared data corresponding to the schema based on the plot.
+- Prepared some queries to ask questions about the plot.
+
+## 2.Directory structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to queries.
+- control.sh: Script to control the start and stop of TuGraph Server.
+lgraph_standalone.json: Configuration file for starting TuGraph Server.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 4.Data Import
+
+- Modify DATA_PATH in import.json according to the data storage directory.
+- Refer to the load function in control.sh to load data.
+- Refer to the start function in control.sh to start TuGraph Server.
+- After starting TuGraph Server, access ${HOST_IP}:8888 to open the web page and confirm whether the data is successfully imported.
+
+## 5.Cypher Query
+
+Refer to the Cypher document and enter Cypher in the TuGraph web page frontend for queries.
+
+## 6.Usage Display
+
+### 6.1.Data Import Display
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.Query Display
+Query all event processes related to the crisis on Jupiter.
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+Query all event processes related to all crises.
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..64ea337fa8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# The Three Body
+
+> This document mainly introduces the usage of Three-Body demo.
+
+## 1.Demo Scenario Design
+The demo scenario is designed based on the story background of Three-Body 1, 2, and 3.
+
+According to the setting of the Three-Body story, we have designed 4 types of nodes and 6 types of edges. The nodes include "character", "organization", "plan", and "timeline", while the edges include "character-character relationship", "character-plan relationship", "character-organization relationship", "organization-plan relationship", and "organization-organization relationship". According to the plot, corresponding schema data and some queries have been prepared to propose some questions about the plot.
+
+## 2.Directory Structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to the query.
+- control.sh: Script to start and stop TuGraph Server.
+- lgraph_standalone.json: Configuration file for TuGraph Server startup.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+### 4.Data Import
+
+- Manual import
+    - Modify DATA_PATH in import.json according to the data storage directory.
+    - Refer to the load function in control.sh to load the data.
+    - Refer to the start function in control.sh to start the TuGraph service.
+    - After starting the TuGraph service, access ${HOST_IP}:8888 to open the web page and confirm whether the data is imported successfully.
+- Automatic creation
+    - Click `New Graph Project`, select Three-Body data, fill in the graph project configuration, and the system will automatically create the Three-Body scenario graph project.
+    - Alternatively, use the pre-installed Three-Body graph project provided by the product.
+
+### 5.Cypher Query
+
+Refer to the TuGraph documentation and enter Cypher in the TuGraph web page frontend to execute a query.
+
+## 6.Usage Demo
+
+### 6.1.Data Import Demo
+
+![data](../../../../images/three-body-data.png)
+
+### 7.Query Demo
+
+#### 7.1.Character Relationship Query
+In the plot of Three-Body 1, a large number of scientists committed suicide all over the world at the beginning, which aroused the attention of the police. During the investigation process, the truth behind it gradually surfaced step by step according to the clues of the character relationships, as shown in the above graph. Shi Qiang and Wang Miao discovered that most people had direct or indirect connections with Ye Wenjie, and sent Wang Miao undercover to finally discover Ye Wenjie's ultimate commander identity. As can be seen in the graph, there are many edge relationships (many one-degree or two-degree neighbors) around Ye Wenjie's vertex.
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.Neighbor Vertex Analysis
+There are many plans in Three-Body, and sometimes we may be confused. At this time, we can use the graph's neighbor vertex query to view the relevant characters and organizations of the plan. For example, in the "Wallfacer Project", we can see that there are four characters related to it, and these four are also the "Wallfacers" who are highly expected by the world.
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.Query Common Neighbors of Node A and B
+We often want to know who are the common related characters between two characters, so that we can quickly grasp the relationship between these two characters. In the case of large amounts of data, it is very convenient to use Cypher for graph relationship analysis!
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.Set/Change Properties
+As the plot progresses, we gradually learn about the various labels on "Ye Wenjie", so we can also update these labels to the "Ye Wenjie" node:
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.Add/Delete Nodes
+Later, we learned about characters such as Luo Ji and Cheng Xin, and organizations such as PIA and the Star Ring Group, and wanted to add them as nodes to the graph:
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..0bb359cbe0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# Three Kingdoms
+
+> This document mainly introduces the usage of the Three Kingdoms demo.
+
+## 1. Introduction
+Due to the lack of historical records, there are often many mysteries surrounding even well-known historical events. Taking the history of the Three Kingdoms as an example, why did Zhuge Liang come out of seclusion to help Liu Bei, and why there was a huge gap in achievements between Cao Cao and Liu Bei, both heroes of the time, are some of the unsolved mysteries. Historians in the past often used two-dimensional relationship analysis of history, and the conclusions drawn were often one-sided. Using TuGraph to import historical figures and events of the Three Kingdoms into a graph model, and analyzing them using graph calculation methods can help us obtain more valuable knowledge from limited information, which is a very meaningful interdisciplinary attempt.
+## 2. Data Modeling
+We designed 5 types of vertices and 5 types of edges. The vertices include "Lord", "Province", "Civilian", "Military Officer", and "Battle"; the edges include "Father", "Brother", "Belongs To", "Native Place", and "Participate In". The specific modeling information is shown below:
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. Data Import
+- Manual import
+    - To import data into TuGraph, you can use the lgraph_import tool to import it offline. The import command of lgraph_import is as follows:
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- Automatic creation
+    - Click `New Graph Project`, select the Three Kingdoms data, fill in the graph project configuration, and the system will automatically create the Three Kingdoms scene graph project.
+    - Or use the built-in Three Kingdoms graph project provided by the product directly.
+## 4. Cypher Query
+### 4.1. Why did Zhuge Liang Choose Liu Bei?
+The following Cypher command can be used to view the relationship between Zhuge Liang, Cao Cao, and Liu Bei:
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+From the graph, we can intuitively see that one of the shortest paths between Cao Cao and Zhuge Liang includes the battle of Xuzhou. Cao Cao once committed a massacre in Xuzhou because his father was killed, and nobody would choose a warlord who had previously massacred their hometown as their lord. In contrast, Liu Bei once prevented Cao Cao's violence during the battle of Xuzhou, which should be one of the reasons why Zhuge Liang had a good impression of Liu Bei.
+
+### 4.2. Why Did Cao Cao Achieve More Than Liu Bei?
+The following Cypher command can be used to view the family's support for Cao Cao's career:
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+The most important thing for pacifying the world is military talent. Cao Cao's father originally had the surname Xiahou, but was adopted into the Cao family. The Cao and Xiahou families were both local big clans in Qiao County, providing Cao Cao with a large number of military talents such as Xiahou Dun, Xiahou Yuan, Cao Ren, and Cao Hong in the early days of his career. In contrast, Liu Bei's father died early and he didn't have any family support. He only gathered his Five Tiger Generals when he was over 50 years old, by which time the best time to fight for land in the chaotic world had passed. Cao Cao had already controlled six of the nine provinces in the world.
+
+### 4.3. Why Did the Most Powerful Wei Kingdom in the Three Kingdoms Perish First?
+The following Cypher command can be used to view the important civilian officials of the Cao Cao group:
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+In fact, Cao Wei was overthrown in the Gao Ping Ling incident in 249 AD, after only 29 years of existence, which was shorter than Shu Han (43 years) and Dong Wu (51 years). The reason why the most powerful Wei Kingdom in the Three Kingdoms perished first was that the civilian official system of Cao Wei (the nine-rank system) made it easy for power to be concentrated in the hands of aristocratic families. From the graph, we can see that almost all the important civilian officials of Cao Cao and Cao Pi's generations were from aristocratic families, such as Xun Clan of Yingchuan, Zhong Clan of Yingchuan, Chen Clan of Yingchuan, Jia Clan of Wuxi, etc. There was even a trend of regionalization, centered on Yingchuan. Ultimately, the regime was usurped by the Sima family of Henei, which had close ties with the Xun Clan of Yingchuan.
+
+### 4.4. What Were the Strengths of Each of the Three Kingdoms?
+The following Cypher command can be used to view the population strength of each group in the Three Kingdoms:
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+The query result is shown in the following table:
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+In ancient society, an important indicator of a country's strength was its population. Since population data is missing, we estimate the population of each province using the birthplace data of all lords, civilians, and military officers in the Three Kingdoms. It is found that among the main characters of the Three Kingdoms, 60 belong to Wei, 23 belong to Wu, and only 2 belong to Shu, which proves that Wei was indeed the most powerful country in the Three Kingdoms.
+
+### 4.5. How Should Cao Cao's Military Ability Be Evaluated?
+The following Cypher command can be used to view the main battles that Cao Cao participated in:
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+From the graph, we can see that Cao Cao participated in 8 out of the 15 major battles in the Three Kingdoms, with a high participation rate. However, Cao Cao only won the battles of Xuzhou, Yanzhou, Guandu, and Xiangyang, while losing the battles of Hanzhong, Wancheng, the Campaign against Dong Zhuo and the Battle of Red Cliffs. His overall win rate was 50%, which proves that Cao Cao was not a very outstanding military strategist.
+
+## 5. Remarks
+More analysis is needed and encouraged to be added by everyone!
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..106f943e05
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo example
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..b2ed78a618
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+TuGraph DB Quick Start
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..d17ba97366
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,526 @@
+# TuGraph Browser
+
+> This document focuses on the use of TuGraph Browser.
+
+## 1.Introduction
+
+TuGraph Browser (hereinafter referred to as Browser) is a powerful product visualization development tool that presents graph data in an intuitive visual way, allowing users to easily manage, maintain, and view the database running status. This tool not only supports graph data management and visualization but also supports system account management, providing users with a comprehensive operation and management experience, enabling users to manage and utilize graph databases more efficiently.
+
+## 2.User Guide
+
+### 2.1.Accessing
+
+After the user completes the installation of the graph database, they can access the Browser through a browser. Users only need to enter the IP:Port of the server where TuGraph is located in the browser address bar. The default port used is 8888.
+
+- For example:127.0.0.1:8888
+- Recommend using Chrome
+
+### 2.2.Logging in
+
+![login](../../../images/browser/login.png)
+
+- After successfully accessing the Browser, the login page appears first (as shown above), where users need to fill in their account and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change their initial password promptly after logging in.
+
+### 2.3.Quick Start
+
+For first-time users of TuGraph, you can quickly build a graph project with the built-in demo data and get started with graph data projects quickly.
+
+#### 2.3.1.Creating a Graph Project
+
+In the `Graph Project` homepage tab, click `Create New Graph Project` to create a new graph project.
+
+![quickstart-creategraph](../../../images/browser/quickstart-creategraph.png)
+
+Select a built-in demo data, and click the `Next` button.
+
+![quickstart-selectdemo](../../../images/browser/quickstart-selectdemo.png)
+
+In the Fill in Configurations interface, enter the graph project information. Since the demo data is relatively small in size, set the Maximum Storage Space to 1 GB. After entering the graph project information, click the Create button, and the system will automatically create the graph model of the demo data and import the graph data.
+
+![quickstart-configure](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.Starting a Graph Project
+
+After creating a graph project with demo data, you can find the corresponding graph project in the `Graph Project` tab, and then click `Graph Query` to query graph data.
+
+![quickstart-graphtab](../../../images/browser/quickstart-graphtab.png)
+
+Execute the default query statement to browse the graph data in the demo.
+
+![quickstart-result](../../../images/browser/quickstart-result.png)
+
+For more quick start documents, please visit the[Quick Start Documents](../3.quick-start/1.preparation.md)
+
+### 2.4.Graph Project
+
+`Graph Project` provides visualized graph project management and graph data development functions, providing users with a series of convenient graph data visualization operations, including graph project creation, modification, deletion, and other management operations, as well as graph data queries, vertex-edge statistics, and other operations. In addition, it also supports graph model management, making it more convenient for users to manage and maintain graph data.
+
+#### 2.4.1.Graph Project Management
+
+On the `Graph Project` page, you can see the graph projects in the current graph database.
+
+![graphmanagement-homepage](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.Creating a Graph Project
+
+On the `Graph Project` page, click the `Create New Graph Project` button to create a new graph project.
+
+![graphmanagement-creategraph](../../../images/browser/graphmanagement-creategraph.png)
+
+Creating a new graph project requires completing the creation of the graph project through two pages: `Select Template` and `Fill in Configurations`.
+
+- __Select Template__: The product provides two types of templates: empty templates and demo templates.
+    - Empty templates: A brand new graph project where users need to create their own graph model and import graph data, generally used for formal project development.
+    - Demo templates: Built-in demo data in the product. After the graph project is created successfully, the system will automatically create a demo graph model and import demo graph data, usually used for trial and learning.
+
+![graphmanagement-selecttemplate](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __Fill in Configurations__: Users need to fill in basic information about the graph project and click the `Create` button to create the graph project.
+    - Graph Name: The name of the new graph project, which is also the unique primary key of the graph project. Supports Chinese characters, letters, numbers, and underscores, but does not support spaces or other special characters.
+    - Graph Description: The description of the new graph project can be used to describe the background and objectives of the project in detail.
+    - Advanced Configuration - Maximum Storage Space: Set the maximum storage space that the graph project can occupy. It does not actually occupy physical storage space in advance. After the actual data volume reaches the maximum storage space threshold, no more data can be written.
+
+![graphmanagement-configure](../../../images/browser/graphmanagement-configure.png)
+
+After creation, the graph project can be viewed in the graph project tab on the `Graph Project` page.
+
+##### 2.4.1.2.Editing a Graph Project
+
+On the `Graph Project` page, click the `Edit button` (pencil icon) in the graph project tab to edit the basic information of the corresponding graph project.
+
+![graphmanagement-editgraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+graphmanagement-editgraph-button
+
+![graphmanagement-editgraph](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.Deleting a Graph Project
+
+On the `Graph Project` page, click the `Delete` button (trash can icon) in the graph project tab to delete the corresponding graph project.
+
+![graphmanagement-deletegraph-button](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_Note: Graph projects cannot be restored after deletion._
+
+##### 2.4.1.4.Vertex-Edge Statistics
+
+On the `Graph Project` page, click the `Vertex-Edge Statistics` button (line graph icon or refresh icon) in the graph project tab to count the number of vertexs and edges in the corresponding graph project.
+
+![graphmanagement-statistics-button](../../../images/browser/graphmanagement-statistics-button.png)
+
+The statistical results will be displayed on the graph project tab. Graph projects that have not been vertex-edge statistics will display `No vertex-edge data`, and graph projects that have already been vertex-edge statistics need to click the `Refresh` button to count again.
+
+![graphmanagement-statistics](../../../images/browser/graphmanagement-statistics.png)
+
+![graphmanagement-statistics-refresh-button](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.Graph Building
+
+The `Graph Building` function in Browser is mainly used for graph project model definition and data import. On the `Graph Project` page, click the `Graph Building` button in the graph project tab.
+
+![graphbuild-button](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.Model Definition
+
+Browser provides a visualization way to create and maintain graph models.
+
+- Graph models can also be created and maintained through the `Cypher` tool and the `lgraph_import` tool. For details, please refer to the [Cypher API Document](../5.developer-manual/6.interface/1.cypher.md) and [Data Import Document](../5.developer-manual/3.server-tools/1.data-import.md).
+
+###### a.Browse Graph Models
+
+On the `Model Definition` page, you can view detailed graph model settings, support list and canvas view of the graph model, support list display of vertex type properties and indexes, edge type properties and start/end vertex types.
+
+![graphbuild](../../../images/browser/graphbuild.png)
+
+- Supports list view of vertex types and edge types.
+    - Supports the display of the number of vertexs or edges in the corresponding vertex type or edge type in the vertex type or edge type tab.
+    - Supports keyword search for vertex type or edge type names. Enter the keyword in the `search box` to display the corresponding vertexs or edges.
+
+        ![graphbuild-list-search](../../../images/browser/graphbuild-list-search.png)
+    - Supports copying vertex type or edge type names. Click the `Copy` button to copy the name of the vertex or edge to the clipboard.
+
+        ![graphbuild-list-copy](../../../images/browser/graphbuild-list-copy.png)
+    - Supports deleting vertex types or edge types. Click the `Delete` button to delete the corresponding vertex or edge.
+
+        ![graphbuild-list-delete](../../../images/browser/graphbuild-list-delete.png)
+- Supports canvas view of vertex types and edge types.
+- Clicking the corresponding vertex type or edge type in the list or canvas can display the model details.
+        ![graphbuild-select](../../../images/browser/graphbuild-select.png)
+
+###### b.Add Vertex
+
+Click the `Add Vertex` button on the `Model Definition` page to add a vertex type in the right sliding window.
+
+![graphbuild-addvertex-button](../../../images/browser/graphbuild-addvertex-button.png)
+
+The user needs to enter the Vertex type name, properties, and indexes, and click the `Complete` button to complete the creation of the Vertex type.
+- Vertex Type Name: The name of the Vertex, which is also the unique identifier of the Vertex.
+- Properties: The attributes of the Vertex, and one attribute needs to be used as the primary key.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating Vertexs.
+- Indexes: The indexing attributes of the Vertex, you need to create attributes first and then set the attribute as an index.
+    - Attribute: The attribute that needs to be indexed.
+    - Unique:Set the attribute field as a unique value.
+    - Primary Key: Whether the corresponding attribute is a primary key. The Unique option must be `Yes` after selecting `Yes`.
+    - Delete: Indexes can be deleted arbitrarily during Vertex creation.
+
+![graphbuild-addvertex](../../../images/browser/graphbuild-addvertex.png)
+
+- Edit Vertex: You can add Vertex properties, modify the data type of existing properties, and add or delete indexes. You need to click the `Save` button for each newly added or modified attribute to take effect.
+_Note: Once the primary key field attribute is created, it cannot be modified._
+
+![graphbuild-editvertex](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.Add Edges
+
+Click the `Add Edge` button on the `Model Definition` page to add an edge type in the right sliding window.
+
+![graphbuild-addedge-button](../../../images/browser/graphbuild-addedge-button.png)
+
+The user needs to enter the edge type name, properties, select the start vertex type and end vertex type, and click the `Complete` button to complete the creation of the edge type.
+- Edge Type Name: The name of the edge, which is also the unique identifier of the edge.
+- Properties: The attributes of the edge, which may not exist on the edge.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating edges.
+- Selecting start vertex type and end vertex type: Set the start vertex type and end vertex type of the edge, and support multiple start vertex types and end vertex types.
+    - Start vertex: Select the vertex type of the start vertex.
+    - End vertex: Select the vertex type of the end vertex.
+    - At least one vertex type needs to be created in advance to set the start vertex type and end vertex of the edge.
+    - If not selected, it means that the start vertex and end vertex can be any vertex type, and the corresponding edge is not displayed on the canvas, and you need to view the edge type in the left list.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+- Edit Edge: You can add edge properties and modify the data type of existing properties. You need to click the `Save` button for each newly added or modified attribute to take effect.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+###### d.Import Model
+
+Click the `Import Model` button on the `Model Definition` page to upload a model file and quickly create a model.
+
+![graphbuild-importmodel-button](../../../images/browser/graphbuild-importmodel-button.png)
+
+Click the `Upload File` button on the `Import Model` page to upload the model file. After the upload is successful, click `OK` to import the graph model.
+
+- Overwrite the current canvas model: If this option is selected, the existing graph model will be cleared before importing the graph model in the model file; if not selected, the vertex types and edge types in the model file will be imported, but the existing vertex types and edge types will not be modified.
+
+![graphbuild-importmodel](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.Export Model
+
+Click the `Export Model` button on the `Model Definition` page to export the graph model in the current graph project to a JSON file.
+
+![graphbuild-exportmodel-button](../../../images/browser/graphbuild-exportmodel-button.png)
+
+The model file is in JSON format and is not recommended to be manually modified.
+
+![graphbuild-exportmodel](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.Data Import
+
+After completing the `Model Definition`, click the `Next` button to enter the data import page.
+
+###### a.Data Preparation
+
+Data needs to be prepared in advance before importing data. The current browser supports the uploading of CSV files, and the data file suffix needs to be ensured to be CSV.
+- The header is not mandatory.
+- Text qualifiers are supported, and the text qualifier is double quotes. Data Import - CSV
+
+![graphbuild-import-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.Upload Files
+
+Upload the required data files on the `Data Import` page and import the data into the graph project.
+
+![graphbuild-import](../../../images/browser/graphbuild-import.png)
+
+- Separator: The column separator of the data file.
+- File upload: Supports uploading multiple files.
+    - Supports selecting multiple upload files in the pop-up window.
+    - Supports dragging and dropping files to upload on the page.
+    - Supports uploading vertex files and edge files at the same time.
+
+###### c.Data Mapping
+
+After the file is successfully uploaded, you need to set the `Data Corresponding Table` on the `Data Import` page to establish a mapping relationship between the data columns in the data file and the target vertexs/edges and corresponding attributes.
+
+- Data Corresponding Table: Displays uploaded data problems.
+    - File Name: The name of the uploaded data file.
+    - File Size: The size of the uploaded data file.
+    - Read Result: The result of uploading the data file, success means uploaded successfully.
+    - Delete: Delete on the page, the local file will not be deleted.
+- Data File Mapping: Each uploaded data file needs to configure a mapping relationship.
+    - Label: Select the corresponding vertex or edge type for the file, and you can only select one type of vertex or one type of edge.
+    - Starting from the Nth row: Start reading data from the Nth row. The system defaults to start reading data from the 0th row. To skip the header, you can enter 1.
+    - Attribute Mapping: Select the attribute field corresponding to the data column from the drop-down list.
+    - Data Preview: The system will pre-read the first 5 rows of the data file.
+
+![graphbuild-import-datamapping](../../../images/browser/graphbuild-import-datamapping.png)
+
+After the file is successfully uploaded, you can click the `Continue Import` button to continue importing other data or click the `Go to Graph Query` button to query the imported data on the `Graph Query` page.
+
+![graphbuild-import-success](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.Graph Query
+
+Click the `Graph Query` button in the `graph project tab` on the `Graph Project` page to query and access graph data in the graph project. The product provides multiple modes for querying graph data, such as Statement Query, Path Query, and Vertex Query, and supports switching between graph projects and query result display.
+
+![query-button](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.Switch Graph Project
+
+The `Graph Query` function can only access one graph project data. Users can select and switch to other graph data in the `Switch Graph Project drop-down list`.
+
+![query-selectgraph](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.Statement Query
+
+The Browser provides a visual way to develop and debug graph query statements. Users can enter graph query statements, execute and return results, and support collecting statements and viewing graph models.
+
+![query-view](../../../images/browser/query-view.png)
+
+###### a.Statement Query Window
+
+Users enter graph query statements in the `Statement Query Window`, click the `Execute` button to run the corresponding statement, and display the result in the `Execution Result tab`.
+
+- Switch Query Language: Provides switching between different graph query language modes.
+    - _Currently only supports Cypher syntax._
+
+![query-selectgql](../../../images/browser/query-selectgql.png)
+
+- Statement Query Window: Provides syntax prompts for the current query language.
+
+![query-gqltips](../../../images/browser/query-gqltips.png)
+
+- Execute: Click the `Execute` button to send the entered query statement to the background for execution.
+
+![query-execute-button](../../../images/browser/query-execute-button.png)
+
+- Bookmark: Click the `Bookmark` button to save the content of the current statement query window as a template for future use.
+
+![query-bookmark-button](../../../images/browser/query-bookmark-button.png)
+
+- Download: Click the `Download` button to save the content of the current statement query window as a text file and download it to the local computer for future use.
+
+![query-download-button](../../../images/browser/query-download-button.png)
+
+For detailed Cypher usage guidelines, please refer to the document: [Cypher API](../5.developer-manual/6.interface/1.cypher.md)
+
+###### b.Bookmark List
+
+Displays the collected query statements in a list, and clicking on a bookmark in the list allows using the statement. Supports keyword search, name modification, and deletion.
+
+![query-bookmark](../../../images/browser/query-bookmark.png)
+
+###### c.View Graph Model
+
+The Browser provides a graph model query for the current graph project, which allows users to query vertex types and edge types conveniently. It supports both list display and canvas graph display, and can be hidden.
+
+![query-schema-list](../../../images/browser/query-schema-list.png)
+![query-schema-graph](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.Path Query
+
+The Browser provides `Path Query templates`. Users can search whether corresponding paths exist in the graph data of the graph project by selecting paths.
+
+![pathquery-result](../../../images/browser/pathquery-result.png)
+
+- Path: Select the path to search in the path selection drop-down list.
+    - Select a Path: Based on the definition of the graph model, the system will automatically match the corresponding first-degree relationship path. Clicking the path drop-down box again will automatically match the next-degree relationship path based on the endvertex vertex type of the path.
+![pathquery-select](../../../images/browser/pathquery-select.png)
+    - Execute: Click the `Execute` button to return the matched paths in the graph project.
+    - Advanced Configuration: Set the number of paths to scan. The default is 100 paths.
+![pathquery-configuration](../../../images/browser/pathquery-configuration.png)
+
+_Note: The edges in the graph model need to set the starting vertex and endvertex. If no edge in the graph project has set the starting vertex and endvertex, the drop-down list will have no results._
+
+##### 2.4.3.4.Vertex Query
+
+The Browser provides `Vertex Query templates`. Users can query vertex data in the graph project by selecting vertex attributes.
+
+![vertexquery](../../../images/browser/vertexquery.png)
+
+- Select Vertex: Select the vertex type to be queried.
+    - Attribute: The system will automatically match the schema of the vertex type, set the corresponding query conditions, and click the execute button to return the results.
+- Return vertex Limit: Set the upper limit of the returned vertex data.
+
+![vertexquery-criteria](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.Execution Result Tab
+
+The Browser provides multiple ways to display graph query results, such as JSON view, JSON text, vertex-edge list, and vertex-edge view. It supports result download, data insertion, and full-screen display.
+
+###### a.JSON View
+
+The Browser provides JSON view to display query results.
+
+![query-result-jsonview](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON Text
+
+![query-result-jsontxt](../../../images/browser/query-result-jsontxt.png)
+
+###### c.Vertex-Edge List
+
+The Browser provides vertex and edge list to display query results.
+
+![query-result-list](../../../images/browser/query-result-list.png)
+
+###### d.Vertex-Edge View
+
+The Browser provides canvas view to display query results.
+
+![query-result-graph](../../../images/browser/query-result-graph.png)
+
+###### e.Data Insertion
+
+The Browser provides a visual way to insert vertex or edge data in the corresponding graph project. Click the `Insert Data` button, select the Vertex Type or Edge Type on the Insert Data tab, enter the attribute values, and click `OK` to complete the data insertion.
+
+![query-result-insert-button](../../../images/browser/query-result-insert-button.png)
+
+![query-result-insert](../../../images/browser/query-result-insert.png)
+
+###### f.Download Execution Result
+
+The Browser provides a function to export graph query results as text files. Click the `Download Execution Result` button, and the system will automatically save the result as a text file and download it to the local computer.
+
+![query-result-download](../../../images/browser/query-result-download.png)
+![query-result-downloadtxt](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.Full-Screen Display
+
+The Browser provides full-screen display for graph query results. Click the `Full-Screen` Display button to display the results in full screen, and click the `Exit Full Screen` button to exit full-screen display.
+
+![query-result-fullscreen-button](../../../images/browser/query-result-fullscreen-button.png)
+![query-result-fullscreen](../../../images/browser/query-result-fullscreen.png)
+![query-result-fullscreen-close](../../../images/browser/query-result-fullscreen-close.png)
+
+### 2.5.Console
+
+The `Console` provides a visualized account management and database information viewing function. It provides users with comprehensive account and role management functions, including adding, deleting, modifying, and disabling accounts and roles. In addition, it also provides users with convenient database information viewing function, allowing users to easily view the basic information and configuration information of the graph database. Basic information mainly includes version number, running time, CPP compilation version number, etc., while database configuration information includes port number, system function parameter configuration, etc.
+
+#### 2.5.1.Account Management
+
+##### 2.5.1.1.Account Management
+
+##### 2.5.1.1.1.Add Account
+
+Click the `Add` button in the `Account Management` interface to create a new account. Users need to enter the account name, account description, account password, and related roles.
+
+- Account Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Related Roles: When creating a new account, you must select a role. After the account is added successfully, the system will automatically generate a role with the same name as the account name.
+
+![account-add-button](../../../images/browser/account-add-button.png)
+![account-add](../../../images/browser/account-add.png)
+
+##### 2.5.1.1.2.Edit Account
+
+Click the `Edit` button in the `Account Management` interface to edit the account description, account password, and related roles.
+
+![account-edit](../../../images/browser/account-edit.png)
+
+##### 2.5.1.1.3.Disable Account
+
+Click the `Disable` button in the `Account Management` interface to prevent the corresponding account from logging in and accessing. Click the `Enable` button to enable the corresponding account login and access permissions.
+
+![account-disable](../../../images/browser/account-disable.png)
+![account-enable](../../../images/browser/account-enable.png)
+
+##### 2.5.1.1.4.Delete Account
+
+Click the `Delete` button in the `Account Management` interface to delete the corresponding account.
+
+![account-delete](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.Role Management
+
+##### 2.5.1.1.1.Add Role
+
+Click the `Add` button in the `Role Management` interface to create a new role. Users need to enter the role name, role description, and graph permissions.
+
+![role-add-button](../../../images/browser/role-add-button.png)
+
+- Role Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Graph Permissions: The browser supports four types of graph permission configurations: All, Read/Write, Read-Only, and None.
+    - All: corresponds to the read and write permissions of the graph, including editing the graph model permissions (schema).
+    - Read/Write: corresponds to the write permission of the graph, but does not include the permission to edit the graph model (schema).
+    - Read-Only: corresponds to the read permission of the graph.
+    - None: cannot access or operate the corresponding graph.
+- Role Conflict: When two roles have different graph permissions for the same graph, and both roles are authorized to the same account, the graph permission of the account for the graph is the union of the graph permissions of the two roles.
+
+![role-add](../../../images/browser/role-add.png)
+
+##### 2.5.1.1.2.Edit Role
+
+Click the `Edit` button in the `Role Management` interface to edit an existing role. Users can edit the role description and graph permissions.
+
+![role-edit](../../../images/browser/role-edit.png)
+
+##### 2.5.1.1.3.Disable Role
+
+Click the `Disable` button in the `Role Management` interface to disable the corresponding role. Click the `Enable` button to enable the corresponding role. After the role is disabled, the corresponding graph permissions of the role become invalid.
+
+- Disabled Role: After the role is disabled, the corresponding graph permissions become invalid.
+    - When a user has two roles with operating permissions on the same graph, if one of the roles is disabled, the permission of the other role is still valid.
+
+![role-disable](../../../images/browser/role-disable.png)
+![role-enable](../../../images/browser/role-enable.png)
+
+##### 2.5.1.1.4.Delete Role
+
+Click the `Delete` button in the `Role Management` interface to delete the corresponding role.
+
+![role-delete](../../../images/browser/role-delete.png)
+
+#### 2.5.2.Database Information
+
+##### 2.5.2.1.Basic Information
+
+`Basic Information` obtains the current running status of the system and displays key information.
+
+![db_basic](../../../images/browser/db_basic.png)
+
+|Parameter    |Meaning    |
+|-------|--------|
+|TuGraph Version Number|The current version number of TuGraph, x.x.x|
+|Running Time|The time from when TuGraph service starts to now|
+|Server Code Version|The current commit of the tugraph-db repository|
+|Front-end Code Version|The current commit of the tugraph-web repository|
+|CPP Compiler Version|The CPP version number when compiling TuGraph|
+|Python Version Number|The Python version number when compiling TuGraph|
+|CPP Compiler ID|The CPP type when compiling TuGraph|
+
+The current running status of the system can also be obtained through commands.
+
+```cypher
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.Database Configuration Information
+
+`Database Configuration Information` obtains the current configuration parameters of the system and displays key information. To adjust the configuration parameters or understand the detailed configuration parameters, please refer to [Database Running-Service Configuration](../5.developer-manual/2.running/2.tugraph-running.md).
+
+![db_configuration](../../../images/browser/db_configuration.png)
+
+| Parameter                   | Meaning                                                                                                                                         |
+|-----------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------|
+| bind_host                   | The host set when the system starts, usually 0.0.0.0                                                                                            |
+| disable_auth                | Whether to disable the regular update of token authentication. If set to true, the token can be used permanently                                |
+| durable                     | Whether to enable persistent storage of the underlying layer. If set to false, the data is updated asynchronously to the disk                   |
+| enable_audit_log            | Whether to enable audit log                                                                                                                     |
+| enable_backup_log           | Whether to enable real-time incremental backup                                                                                                  |
+| enable_fulltext_index       | Whether to enable full-text indexing                                                                                                            |
+| enable_ip_check             | Whether to enable IP whitelist                                                                                                                  |
+| enable_rpc                  | Whether to enable the RPC port                                                                                                                  |
+| enable_ssl                  | Whether to enable SSL encrypted transmission                                                                                                    |
+| optimistic_txn              | Whether to enable optimistic multi-threaded write transactions                                                                                  |
+| port                        | The REST access port of the current system                                                                                                      |
+| rpc_port                    | The port used by the RPC and HA services                                                                                                        |
+| subprocess_max_idle_seconds | The maximum idle time of the subprocess, a thread pool parameter                                                                                |
+| thread_limit                | The maximum number of threads used by the server at the same time                                                                               |
+| verbose                     | The level of detail of the log output information. It can be set to 0, 1, or 2, with larger values indicating more detailed output information. |
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..b7e5e9f2fa
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,167 @@
+# TuGraph Browser(old version)
+
+> This document focuses on the use of TuGraph Browser
+
+## Definition
+
+TuGraph Browser is a visual development tool provided by TuGraph.
+
+## Functionality
+
+TuGraph Browser provides graph database developers with functions such as visual graph data development, graph data management and maintenance.
+
+## How to use it
+
+### 1. Connect to the database
+
+When the user completes the installation of the graph database, you can access it through the Browser, TuGraph Browser tool. The user only needs to type in the browser address bar: IP of the server where TuGraph is located :Port. The default port is 7090.
+
+### 2. Login
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- When the page is opened successfully, the first thing you see is the login page, and the user needs to fill in the account number and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change the initialized password in time after logging in
+
+### 3. Workbench
+
+#### 3.1 Quick Start
+
+- When you log in for the first time, the system will create an empty graph by default
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- The user clicks on the help option and selects Get Started quickly
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- Then click "One-click Create Model" -- >" One-click Create Data "to complete the construction of the built-in Movie data graph
+
+#### 3.2 Create subgraphs and examples
+
+##### 3.2.1 Create a subgraph
+
+- Click on New subgraph
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- Fill in the form information
+  ![alt Fill out the form](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+- Subgraph name
+- Subgraph description
+- Configuration information
+- Click OK to prompt that creation succeeded
+- Toggle the subgraph
+  ![alt Toggle subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- Click New Example
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- Select the example and click Create
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 query
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 User Interface Layout
+
+- Cypher input box
+- Result set display area
+
+##### 3.3.2 Result set display area function details
+
+- Result set tag display and functions
+  ![alt Result set tag](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+- All types of statistics for the result set are shown here
+- Click on the different "label" to make the following changes
+  -Change the display color
+- Modify the node size or edge thickness
+- Modify default display properties or system properties
+- Layout modification
+- Force guide layout
+- Grid layout
+- Tree layout
+- Environment layout
+- edge polymerization
+- Edges of the same type and direction can be merged
+- Create nodes
+- Click the Create Node button
+- Select the node type
+- Add node content
+- Create relationships
+- Select start and end points in the canvas
+- Select the type that can be matched
+- Enter node information
+- Stop layout
+- When too much data is causing the browser page to stall, you can click this stop layout button to improve the smoothness of the experience
+- Mouse hover
+- Enable this feature to highlight the one-degree neighbors of the mouse-over node
+- Result set export
+- Result sets can be exported as png, json, csv three different file forms
+- the refresh
+- Clicking the refresh button will re-execute the initial cypher statement for the current page and refresh the result set
+  Maximize -
+  -Click Maximize button, the result set display area will be displayed in full screen
+- Result set display mode switching
+  - Support graph, table and text modes
+
+##### 3.3.3 Schema
+
+- model
+  ![Modeling Alt](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- schema supports real-time addition, deletion, modification and query
+
+- schema supports import and export
+
+##### 3.3.4 Data import
+
+- Local data import
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+- Select the file encoding format
+- Select a local CSV file
+- Select the model for the corresponding node or edge
+- Do the data mapping
+  -Complete the data import
+
+##### 3.3.5 plug-in (Stored Procedure)
+
+- Use of plug-ins
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+- Users can upload the plug-in program written locally, execute it in the visual page, and view the execution result
+- Users can perform, uninstall, execute, and download plug-ins in the visualization page
+
+##### 3.3.6 Help
+
+- where it records how TuGraph-browser is used
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 Console
+
+##### 3.4.1 Basic database information
+
+- Displays basic database configuration information
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 Permission management
+
+- A function module used to create users and roles. Users can manage permissions here
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 Live status
+
+- This shows the database real-time status, including: CPU usage, memory usage, disk usage, number of data requests, disk IO
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 Task Management
+
+- Here the user can see the task in execution and stop the task
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 Audit logs
+
+- Database related audit logs recorded here, used to troubleshoot problems encountered in use
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6c4d063e26
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB User Guide
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/1.environment.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/1.environment.md
new file mode 100644
index 0000000000..f2cdffe578
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/1.environment.md
@@ -0,0 +1,41 @@
+# Environment
+
+> This document provides an overview of the required hardware and software environment for deploying TuGraph.
+
+## 1.Hardware Environment
+
+### 1.1. CPU
+TuGraph supports X86_64 and ARM64 architectures for both physical, virtual, and containerized environments. Tested and certified hardware platforms include Intel, AMD, Kunpeng, Hygon, Feiteng, and others.
+
+### 1.2. Memory
+We recommend having a memory capacity that is equal to or greater than the actual data size. For optimal performance, caching all data in memory is ideal. In terms of data locality, graph databases have poorer locality compared to relational databases. Therefore, if the data cannot fit in memory, frequent swapping may occur.
+
+### 1.3. Storage
+We strongly recommend using NVMe SSD as external storage. The database performs numerous synchronous write operations, often in a random manner, making the read/write performance of the external storage critical to the overall database performance. Hence, high IOPS and low-latency NVMe SSDs are the optimal choice.
+
+If circumstances permit only the use of SATA interface SSDs or cloud-based network disks, although performance may be affected, TuGraph can still run correctly.
+
+It is recommended to have external storage size at least four times the actual data size. For example, if the data size is 1TB, preparing a 4TB hard drive would be more reliable.
+
+
+
+## 2. Software environment
+
+### 2.1. Operating System
+
+TuGraph is compatible with popular operating systems, including Ubuntu, CentOS, SUSE, Galaxy Kylin, China Standard Software, UOS, and others, all of which have been tested and certified.
+
+Among them, the most stable system versions are Ubuntu 18.04, CentOS 7, and CentOS 8.
+
+### 2.2. System Libraries
+
+The requirements for system libraries differ between the compilation environment and the runtime environment. For specific details, please refer to the[environment mode](2.environment-mode.md)。
+
+## 3.Recommended Configuration
+
+| Hardware | Minimum Configuration	   | Recommended Configuration                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| Memory   | 4GB       | 512GB                    |
+| Storage  | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/2.environment-mode.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/2.environment-mode.md
new file mode 100644
index 0000000000..4699967ffb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/2.environment-mode.md
@@ -0,0 +1,25 @@
+# Environment Mode
+
+> This document primarily introduces the three types of environments involved in TuGraph.
+
+## 1.Classification
+
+Based on the different functionalities supported by the environments, they can be categorized into the following:
+
+* Compilation Environment: This environment includes all the dependencies required for compiling TuGraph. It contains all the dependencies of the runtime environment and is capable of compiling TuGraph source code. However, it does not include pre-compiled TuGraph executable files and library files. It is intended for developers to compile the source code.
+
+* Runtime Environment: This environment includes GCC/Java/Python environments, enabling the execution of all TuGraph functionalities. It can support full-text indexing, Java client, uploading C++ source code as a plugin, and running Python plugins. It comes with pre-compiled TuGraph executable files and library files, allowing customers to directly install and use TuGraph without the need for source code compilation.
+
+* Mini-Runtime Environment: This environment is equivalent to a bare system with pre-compiled TuGraph. It can only run the basic functionalities of TuGraph, without the ability to compile and run C++ plugins, lack of full-text indexing, and absence of Python plugins. It is designed for quick deployment and trial purposes.
+
+After compiling TuGraph, all the required dependencies are packaged together in the form of .a files, eliminating the need for unnecessary additional dependencies during runtime. However, since TuGraph supports stored procedures, which involve compiling C++ code on the server, the required compilers still need to be present in the environment.
+
+## 2.System Library
+
+For the three types of environments, the required system libraries, excluding the TuGraph runtime package, are as follows:
+
+* Compilation Environment: It includes GCC, Python, Java compilers, as well as libraries such as ANTLR4 and Pybind11. Please refer to the tugraph-compile-*-Dockerfile for more details.
+
+* Runtime Environment: The main dependencies introduced by stored procedures include GCC, Boost, CMake, and others. Please refer to the tugraph-runtime-*-Dockerfile for more details.
+
+* Mini-Runtime Environment: There are no additional system library dependencies. Please refer to the tugraph-mini-runtime-*-Dockerfile for more details.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md
new file mode 100644
index 0000000000..030654580a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md
@@ -0,0 +1,82 @@
+# Docker Deployment
+
+>This document introduces the creation and download of Docker images for TuGraph Compile and TuGraph Runtime.
+
+## 1.Introduction
+
+- TuGraph Compile Image: Provides a compilation environment and can be used for TuGraph compilation and testing.
+- TuGraph Runtime Image: Provides a binary executable environment with TuGraph library and executable files.
+- TuGraph Mini Runtime Image: Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+## 2.Existing Docker Images
+
+### 2.1.Image Download
+
+The images are hosted on [DockerHub]( https://hub.docker.com/u/tugraph ) and can be downloaded and used directly.
+
+### 2.2.Naming Convention
+
+#### 2.2.1.TuGraph Compile Image
+
+Provides a compilation environment and can be used for TuGraph compilation.
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+For example: `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+Provides a binary executable environment with TuGraph library and executable files.
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example:`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example: `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+## 2.3.Common Docker Operations
+
+Docker is generated from Dockerfile. Note that creating images requires downloading dependencies, so network issues may cause slow creation or creation failure. Do not overwrite images unless the tag is `latest`.
+
+build Compile image
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+build Runtime / Mini Runtime image
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+Modify image name
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+push image
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+pull image
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+save image
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+load image
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+Refer to the [docker official documentation](https://docs.docker.com/engine/reference/commandline/cli ) for other Docker operations.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md
new file mode 100644
index 0000000000..4e80855e38
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md
@@ -0,0 +1,31 @@
+# Local Package Deployment
+
+> This document describes TuGraph Local Package Deployment.
+
+## 1.Download Local Package
+
+Please visit the Github for download：[TuGraph Download](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 2.Ubuntu
+
+The.deb installation package for TuGraph installed on Ubuntu, which contains the TuGraph executable along with the header files and associated library files needed to write embedded programs and stored procedures.
+
+To install the tugraph_x.y.z.deb 'installation package on the terminal, run the following command:
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+This command installs TuGraph in the /usr/local directory by default. Users can also change the installation directory by specifying the `--instdir=<directory>` option.
+
+## 3.CentOS
+
+rpm installation package for TuGraph installed on CentOS, which contains TuGraph executables as well as headers and associated libraries for writing embedded programs and stored procedures.
+
+To install the tugraph_x.y.z.rpm package on the terminal, run the following command:
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+The user can also specify the installation directory by specifying the `--prefix` option.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md
new file mode 100644
index 0000000000..9551dc6e32
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md
@@ -0,0 +1,128 @@
+# Cloud Deployment
+
+> This document mainly introduces the cloud deployment of TuGraph, and you can also refer to the[Alibaba Cloud ComputeNest deployment document.](https://aliyun-computenest.github.io/quickstart-tugraph/)。
+
+## 1.Introduction
+
+TuGraph (tugraph.antgroup.com) is a high-performance graph database of Alibaba Group. TuGraph provides community version services on ComputeNest, so you can quickly deploy TuGraph services on ComputeNest and achieve operation and maintenance monitoring, thereby building your own graph application. This document introduces how to open TuGraph community version services on ComputeNest, as well as deployment process and usage instructions.
+
+## 2.Instance Description
+
+TuGraph is deployed as a community open source version, and the source code can be found in the Github Repo. Currently, the available instance specifications are as follows:
+
+| Instance Family | vCPU and Memory             | System Disk                | Public Bandwidth         |
+|-----------------|-----------------------------|----------------------------|--------------------------|
+| ecs.r7a.xlarge  | AMD Memory r7a, 4vCPU 32GiB | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+| ecs.r6.xlarge   | Memory r6, 4vCPU 32GiB      | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+
+Estimated costs can be seen in real time when creating instances (currently free). If you need more specifications or other services (such as cluster high availability requirements, enterprise-level support services, etc.), please contact us at tugraph@service.alipay.com.
+
+## 3.Deployment Process
+
+### 3.1.Preparation
+
+Before starting to use, you need an Alibaba Cloud account to access and create resources such as ECS and VPC.
+
+- If you use a personal account, you can directly create a service instance.
+- If you create a service instance using a RAM user and use Alibaba Cloud ComputeNest for the first time:
+    - Before creating a service instance, you need to add permissions for the corresponding resources to the account of the RAM user. For detailed operations on adding RAM permissions, please see Grant RAM user permissions. The required permissions are shown in the following table.
+    - Authorization to create associated roles is also required. Refer to the following figure and select Agree to authorize and create associated roles.
+
+| Permission Policy Name          | Remark                                                                       |
+|---------------------------------|------------------------------------------------------------------------------|
+| AliyunECSFullAccess             | Permissions for managing cloud server services (ECS)                         |
+| AliyunVPCFullAccess             | Permissions for managing Virtual Private Cloud (VPC)                         |
+| AliyunROSFullAccess             | Permissions for managing Resource Orchestration Service (ROS)                |
+| AliyunComputeNestUserFullAccess | Permissions for managing ComputeNest services (ComputeNest) on the user side |
+| AliyunCloudMonitorFullAccess    | Permissions for managing Alibaba Cloud Monitor (CloudMonitor)                |
+
+![Cloud Deployment](../../../../images/cloud-deployment-1.png)
+
+### 3.2.Deployment Entrance
+
+You can search in Alibaba Cloud ComputeNest, or quickly access it through the following deployment link.
+
+[Deployment Link](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.Apply for Trial Use
+
+Before formal trial use, you need to apply for trial use, fill in the information as prompted, and create the TuGraph service after passing the review.
+
+![Apply for Trial Use](../../../../images/cloud-deployment-2.png)
+
+### 3.4.Create TuGraph Service
+
+#### 3.4.1.Parameter List
+
+During the process of creating a service instance, you need to configure the parameter list of the service instance information. The specific parameters are as follows.
+
+| Parameter Group                              | Parameter Item  | Example                 | Description                                                                                                                            |
+|----------------------------------------------|-----------------|-------------------------|----------------------------------------------------------------------------------------------------------------------------------------|
+| Service Instance Name                        | N/A             | test                    | The name of the instance.                                                                                                              |
+| Region                                       | N/A             | China East 1 (Hangzhou) | Select the region of the service instance. It is recommended to select nearby regions to obtain better network latency.                |
+| Payment Type Configuration                   | Payment Type    | Pay-As-You-Go           | For free use, please select Pay-As-You-Go.                                                                                             |
+| Availability Zone Configuration              | Deployment Area | Availability ZoneI      | Different available zones under the region, ensure that the instance is not empty.                                                     |
+| Select Existing Basic Resource Configuration | VPC ID          | vpc-xxx                 | Select the ID of the Virtual Private Cloud according to the actual situation.                                                          |
+| Select Existing Basic Resource Configuration | Switch ID       | vsw-xxx                 | Select the Switch ID according to the actual situation. If the Switch ID cannot be found, try switching the region and available zone. |
+| ECS Instance Configuration                   | Instance Type   | ecs.r6.xlarge           | Currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications.                                                                    |
+|ECS Instance Configuration|	Instance Password|	**|	Set the instance password. Length of 8-30 characters, must include three items (uppercase letters, lowercase letters, numbers, special characters in ()`~!@#$%^&*_-+={}[]:;'<>,.?/).
+|
+
+#### 3.4.2.Specific Steps
+
+The creation of the service is carried out according to the following steps, refer to the figure below:
+
+- Create an instance name, such as "test" in the figure below
+- Select the region, such as "China East 1 (Hangzhou)" in the figure below
+
+![Create Instance](../../../../images/cloud-deployment-3.png)
+
+- Select the instance type, currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications. If there is no model available in the list, try selecting other deployment areas.
+- Select the model
+- Configure the password for the instance
+- Select the deployment area, such as "Availability Zone I" in the figure below
+
+![Select Region](../../../../images/cloud-deployment-4.png)
+
+- Click next to enter the order confirmation page
+- Check the checkboxes for "Permission Confirmation" and "Service Terms"
+- Click the green "Start Free Trial" button in the lower left corner to create a service instance
+
+![Confirmation](../../../../images/cloud-deployment-5.png)
+
+### 3.5.Start TuGraph Service
+
+- View the service instance: After the service instance is created successfully, it takes about 2 minutes for deployment. After the deployment is complete, you can see the corresponding service instance on the page, as shown in the figure below.
+
+![View Instance](../../../../images/cloud-deployment-6.png)
+
+- Click the service instance to access TuGraph. After entering the corresponding service instance, you can get 3 ways to
+  use it on the page: web, rpc, ssh. You can also see the password of user admin on the page.
+
+![Access Method](../../../../images/cloud-deployment-7.png)
+
+- Click the link of web to jump to the deployed TuGraph Web. It is recommended that novice users first use the demo to quickly get started with TuGraph.
+    - First, on the TuGraph Web login page, enter the default username (admin) and the password on the page to log in, as shown in the figure below.
+    - After the login is completed, click "New Instance" -> "Create Instance" in sequence, wait for the creation to be completed, and the steps in 3 will change to green in turn, and it will automatically switch to the subgraph MovieDemo1, as shown in the figure below.
+
+![Login](../../../../images/cloud-deployment-8.png)
+![Create Demo](../../../../images/cloud-deployment-9.png)
+
+## 4.Common FAQs
+
+### No available resources in the selected deployment area
+
+Sometimes, the selected deployment area (such as Availability Zone G) does not have available resources for the selected package, and an error will be reported as shown in the figure below.
+
+![Deployment Error](../../../../images/cloud-deployment-10.png)
+
+__Solution__:Try selecting other regions, such as Availability Zone I
+
+### Unaccessible to the web port
+
+It takes some time for the server to get ready. Just wait for a few seconds.
+
+
+### Username or password is not correct
+
+Please make sure that you are using the password on the page instead of the default one.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/index.rst
new file mode 100644
index 0000000000..9bf6be2bc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/1.installation/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Installation
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/1.compile.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/1.compile.md
new file mode 100644
index 0000000000..6993692bc4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/1.compile.md
@@ -0,0 +1,30 @@
+# Compile
+
+> This document mainly describes how to compile TuGraph from source code.
+
+## 1.Prerequisites
+
+It is recommended to build TuGraph on a Linux system. Meanwhile, Docker is a good choice. If you want to set up a new environment, please refer to [Dockerfile](../1.installation/3.docker-deployment.md)。
+
+## 2.compile
+
+Here are steps to compile TuGraph:
+
+1. `deps/build_deps.sh` or to skip building web interface `SKIP_WEB=1 deps/build_deps.sh`
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If support shell lgraph_cypher, use `-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+4. `make`
+5. `make package` or `cpack --config CPackConfig.cmake`
+
+Example:
+`tugraph/tugraph-compile-centos7`Docker environment
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/2.tugraph-running.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/2.tugraph-running.md
new file mode 100644
index 0000000000..6dbe0cec3b
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/2.tugraph-running.md
@@ -0,0 +1,192 @@
+# Tugraph Running
+
+> This document describes the operation mode of the TuGraph service, starting, stopping, and restarting operations.And TuGraph's service configuration parameters, configuration file format, and command-line configuration parameters.
+
+## 1. Prerequisites
+TuGraph has the following prerequisites for its execution: a correct [installation of TuGraph](../1.installation/1.environment.md).
+
+TuGraph execution requires ensuring that the library file "liblgraph.so" is located in the environment variable LD_LIBRARY_PATH.
+
+The user running the TuGraph process does not need superuser privileges. However, they need read permissions for the configuration file (usually lgraph.json) and any files referenced within it. Additionally, they should have write permissions for data folders, log files, etc.
+
+## 2.The operation mode
+
+TuGraph can be started as a normal process in the foreground or as a daemon in the background.
+
+When running as a normal process, TuGraph can print logs directly to the terminal, which is handy when debugging server configurations. However, because the foreground process is terminated after the terminal exits, the user must ensure that the terminal remains open while the TuGraph server is running. In daemon mode, on the other hand, the TuGraph server can continue to run even if the terminal that started it exits. If TuGraph needs to run for a long time, it is recommended to start the TuGraph server in daemon mode.
+
+### 2.1.Running a normal process
+
+The 'lgraph_server -d run' command runs TuGraph as a normal process. Normal processes depend on the command line terminal, so when the terminal ends, the TuGraph process is automatically terminated. Normal process mode with '--log_dir ""' can output the process log directly to the terminal, so it is easier to debug.
+
+Start the command：
+
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+Example of running output in normal mode：
+
+```shell
+20200508120723.039: **********************************************************************
+20200508120723.039: *                  TuGraph Graph Database v3.1.0                     *
+20200508120723.040: *                                                                    *
+20200508120723.041: *        Copyright(C) 2018 Ant Group. All rights reserved.           *
+20200508120723.041: *                                                                    *
+20200508120723.044: *             Licensed host: hostname      threads:0, ha:0           *
+20200508120723.044: **********************************************************************
+20200508120723.044: Server is configured with the following parameters:
+20200508120723.045:   data directory:    ./lgraph_db
+20200508120723.045:   license:           ./fma.lic
+20200508120723.046:   enable ha:          0
+20200508120723.046:   async:              0
+20200508120723.047:   host:               127.0.0.1
+20200508120723.047:   REST port:          7071
+20200508120723.048:   RPC port:           9091
+20200508120723.048:   enable rpc:         0
+20200508120723.051:   optimistic txn:     0
+20200508120723.059:   verbose:            1
+20200508120723.074:   log_dir:
+20200508120723.074:   ssl_auth:           0
+20200508120723.075:   resource dir:       ./resource
+
+20200508120723.077: Loading DB state from disk
+20200508120723.110: [RestServer] Listening for REST on port 7090
+20200508120723.110: [LGraphService] Server started.
+```
+
+In normal process mode, the user can prematurely terminate the TuGraph process by pressing 'CTRL+C'.
+
+### 2.2.Run process daemon mode
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+Example output from running in daemon mode:
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+## 3.Service operation
+
+### 3.1.Start the service
+
+TuGraph needs to be started using the 'lgraph_server -d start' command line. The following is an example of the command to start TuGraph:
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+### 3.2.Stop the service
+
+You can stop the TuGraph daemon using the 'kill' command and the 'lgraph_server -d stop' command. Since it is possible to run multiple TuGraph server processes on the same computer, we distinguish between the different server processes using the '.pid 'file, which is written to the working directory where the process was started. Therefore, you need to run the command 'lgraph_server-d stop' in the same working directory to stop the correct server process.
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.Restart the service
+
+Users can also restart the TuGraph service by 'lgraph_server -d restart' :
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.Service configuration
+
+The TuGraph server loads configurations from the configuration file and command line options at startup, and if different values are specified for the same option in the configuration file and command line, the value specified in the command line will be used preferentially.
+
+### 4.1.Configuration parameters
+
+The parameters and their types are described as follows:
+
+| **Parameter names**       | **<nobr>Type</nobr>** | **Instructions**                                                                                                                                                                                                                                                                                    |
+|---------------------------|-----------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                 | string                | Directory where data files are stored. If the directory does not exist, it is automatically created. The default directory is /var/lib/lgraph/data.                                                                                                                                                 |
+| durable                   | boolean               | Whether to enable real-time persistence. Turning off persistence can reduce the disk IO overhead when writing, but data may be lost in extreme cases such as machine power failure. The default value is `true`.                                                                                    |
+| host                      | string                | The IP address on which the REST server listens. The default address is 0.0.0.0.                                                                                                                                                                                                                    |
+| port                      | int                   | The Port on which the REST server listens. The default port is 7070.                                                                                                                                                                                                                                |
+| enable_rpc                | boolean               | Whether to use RPC services. The default value is 0.                                                                                                                                                                                                                                                |
+| rpc_port                  | int                   | Port used by RPC and HA services. The default port number is 9090.                                                                                                                                                                                                                                  |
+| enable_ha                 | boolean               | Whether to enable the HA mode. The default value is false.                                                                                                                                                                                                                                          |
+| ha_log_dir                | string                | HA log directory. The HA mode needs to be enabled. The default value is null.                                                                                                                                                                                                                       |
+| verbose                   | int                   | Detail level of log output information. The value can be 0,1,2. The larger the value, the more detailed the output information. The default value is 1.                                                                                                                                             |
+| log_dir                   | string                | Directory where log files are stored. The default directory is /var/log/lgraph/.                                                                                                                                                                                                                    |
+| ssl_auth                  | boolean               | Whether to use SSL authentication. When HTTPS is enabled, only the HTTPS service is enabled on the REST server. The default value is false.                                                                                                                                                         |
+| web                       | string                | The directory where the web files (including the visual part) are located. The default directory is/usr/local/share/lgraph/resource.                                                                                                                                                                |
+| server_cert               | string                | certificate file path used by the server when SSL authentication is enabled. The default path is/usr/local/etc/lgraph/server - cert.pem.                                                                                                                                                            |
+| server_key                | string                | The public key file used by the server when SSL authentication is enabled. The default directory is/usr/local/etc/lgraph/server - key.pem。                                                                                                                                                          |
+| enable_audit_log          | boolean               | Whether to enable audit logs. The default value is false.                                                                                                                                                                                                                                           |
+| audit_log_expire          | int                   | When audit logs are enabled, the validity period (hours) of audit logs is automatically cleared upon timeout. If the value is 0, the logs are not cleared. The default value is 0.                                                                                                                  |
+| audit_log_dir             | string                | Specifies the directory for storing log files when audit logs are enabled. The default directory is $directory/_audit_log_.                                                                                                                                                                         |
+| load_plugins              | boolean               | Import all stored procedures when starting the service. The default value is 1.                                                                                                                                                                                                                     |
+| optimistic_txn            | boolean               | Enable optimistic multithreaded write transactions for Cypher. The default is 0.                                                                                                                                                                                                                    |
+| disable_auth              | boolean               | Disable REST authentication. The default is 0.                                                                                                                                                                                                                                                      |
+| ha_snapshot_interval_s    | int                   | Snapshot interval (in seconds) The default value is 86400.                                                                                                                                                                                                                                          |
+| ha_heartbeat_interval_ms  | int                   | Heartbeat interval in milliseconds. The default value is 1000.                                                                                                                                                                                                                                      |
+| ha_node_offline_ms        | int                   | The heartbeat times out and the interval (in milliseconds) between nodes going offline. The default value is 60000.                                                                                                                                                                                 |
+| ha_node_remove_ms         | int                   | The interval (in milliseconds) at which a node is considered completely dead and removed from the list. The default value is 120000.                                                                                                                                                                |
+| enable_ip_check           | boolean               | Allow IP address whitelists. The default value is 0。                                                                                                                                                                                                                                                |
+| idle_seconds              | int                   | The maximum number of seconds a child process can be idle. The default value is 600.                                                                                                                                                                                                                |
+| enable_backup_log         | boolean               | Whether to enable backup logging. The default value is 0.                                                                                                                                                                                                                                           |
+| backup_log_dir            | string                | The directory where backup files are stored. The default value is null.                                                                                                                                                                                                                             |
+| snapshot_dir              | string                | Directory where snapshot files are stored. The default value is null.                                                                                                                                                                                                                               |
+| thread_limit              | int                   | The maximum number of threads that can be used simultaneously. The default value is 0, which means that no restriction is imposed. The license file prevails.                                                                                                                                       |
+| unlimited_token           | boolean               | Whether to set the link token to be infinite. The default value is 0 and the validity period is 24 hours.                                                                                                                                                                                           |
+| enable_fulltext_index     | boolean               | Whether to enable the full-text index function, the default value is 0.                                                                                                                                                                                                                             |
+| fulltext_analyzer         | string                | Full-text index tokenizer type. Can be set to `StandardAnalyzer` or `SmartChineseAnalyzer`. Default is `StandardAnalyzer`                                                                                                                                                                           |
+| fulltext_commit_interval  | int                   | Full-text index data submission period, for write operations, in seconds. The default is 0, which commits immediately.                                                                                                                                                                              |
+| fulltext_refresh_interval | int                   | Full-text index data refresh cycle, for read operations, in seconds. The default is 0, and the latest written data can be read immediately.                                                                                                                                                         |
+| conf                      | string                | Initialize the HA cluster according to host1:port1,host2:port2,host3:port3, the default value is empty.                                                                                                                                                                                             |
+| ha_node_join_group_s      | int                   | The waiting time for a node to try to join the high availability cluster, in seconds, the default is 10.                                                                                                                                                                                            |
+| ha_bootstrap_role         | int                   | Whether to use bootstrap to start, and the server role to start using this method, 0 means not to use bootstrap to start, 1 means to use bootstrap to start and this node is a leader, 2 means to use bootstrap to start and this node is a follower, only these 3 options. The default value is 0. |
+| help                      | boolean               | Print the help message. The default value is 0.                                                                                                                                                                                                                                                     |
+
+### 4.2.Server configuration file
+
+TuGraph's configuration file is stored in JSON format. It is recommended that most configuration be stored in configuration files and that some configuration parameters be modified only temporarily using command-line options when needed.
+
+A typical configuration file looks like this:
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+  "license": "/var/lib/lgraph/fma.lic",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md
new file mode 100644
index 0000000000..444b948a88
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md
@@ -0,0 +1,129 @@
+# High Availability mode
+
+> This document describes the principles, preparations, and server operations of the high availability mode
+
+## 1.Theory
+
+TuGraph provides high availability mode (HA mode) through multiple server hot backups. In high availability mode, writes are synchronized to all servers so that service availability is not affected even if some servers go down.
+
+In high availability mode, multiple TuGraph servers form a backup group. Each backup group consists of three or more TuGraph servers, one of which serves as the 'leader' and the other replication group servers serve as the 'follower'. Write requests are serviced by the 'leader' who replicates each request to the 'follower' and responds to the client only after the request has been synchronized to the server. This way, if any server fails, the other servers will still have all the data that has been written so far. If the 'leader' server fails, other servers will automatically select a new 'leader'.
+
+The high availability mode is only available in the enterprise edition. The open-source Community Edition does not include this feature.
+
+## 2.Preparation
+
+To enable high availability mode, users need to:
+
+- Three or more instances of TuGraph servers.
+- To enable high availability mode when starting lgraph_server, the 'enable_ha' option can be set to 'true' using a configuration file or the command line.
+- Set the correct rpc_port through the configuration file or command line
+
+## 3.Start the initial backup group
+
+### 3.1.The initial data is consistent
+
+When the data in all servers is the same or there is no data at startup, the user can
+specify `--conf host1:port1,host2:port2` to start the server.
+In this way, all prepared TuGraph instances can be added to the initial backup group at one time,
+All servers in the backup group elect `leader` according to the RAFT protocol, and other
+servers join the backup group with the role of `follower`.
+
+An example command to start an initial backup group is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+After the first server is started, it will elect itself as the 'leader' and organize a backup group with only itself.
+
+### 3.2.Inconsistent initial data
+If there is already data in the first server (imported by the `lgraph_import` tool or transferred from a server in non-high availability mode),
+And it has not been used in high-availability mode before, the user should use the boostrap method to start. Start the server with data in bootstrap
+mode with the `ha_bootstrap_role` parameter as 1, and specify the machine as the `leader` through the `conf`
+parameter. In bootstrap mode, the server will copy its own data to the new server before adding the newly
+joined server to the backup group, so that the data in each server is consistent.
+
+An example command to start a data server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 1
+```
+
+Other servers without data need to specify the `ha_bootstrap_role` parameter as 2, and specify the `leader` through the `conf` parameter. The command example is as follows
+
+```bash
+**$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 2
+```
+## 4.Scale out other servers
+
+After starting the initial backup group, if you want to scale out the backup group, add new servers to the backup group,
+The `--conf HOST:PORT` option should be used, where `HOST` can be the IP address of any server already in this backup group,
+And `PORT` is its RPC port. E.g:
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+
+This command will start a TuGraph server in high availability mode and try to add it to the backup group containing the server `172.22.224.15:9090`.
+Note that joining a backup group requires a server to synchronize its data with the backup group's `leader` server, and this process may take a considerable amount of time, depending on the size of the data.
+
+## 5.Stopping the Server
+
+When a server goes offline via 'CTRL-C', it will notify the current 'leader' server to remove the server from the backup group. If the leader server goes offline, it will pass the leader identity permission to another server before going offline.
+
+If a server is terminated or disconnected from other servers in the backup group, the server is considered a failed node and the leader server will remove it from the backup group after a specified time limit.
+
+If any server leaves the backup group and wishes to rejoin, it must start with the '--conf {HOST:PORT}' option, where 'HOST' is the IP address of a server in the current backup group.
+
+## 6.Restarting the Server
+
+Restarting the entire backup group is not recommended as it disrupts service. All servers can be shut down if desired. But on reboot,
+It must be ensured that at least N/2+1 servers in the backup group at shutdown can start normally, otherwise the startup will fail. and,
+Regardless of whether `enable_bootstrap` is specified as true when initially starting the replication group, restarting the server only needs to pass
+Specify the `--conf host1:port1,host2:port2` parameter to restart all servers at once. The command example is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 7.docker deploys a highly available cluster
+In real business scenarios, it is likely to encounter the need to deploy high-availability clusters on multiple operating systems or architectures.
+Differentiated environments may cause some dependencies to be missing when compiling TuGraph. therefore,
+Compiling software in docker and deploying high-availability clusters is very valuable. Take the centos7 version of docker as an example,
+The steps to deploy a highly available cluster are as follows.
+
+### 7.1.Install mirror
+Use the following command to download TuGraph's compiled docker image environment
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+Then pull the TuGraph source code and compile and install
+
+### 7.2.Create container
+Use the following command to create a container, use `--net=host` to make the container run in host mode, in this mode
+Docker and the host machine share the network namespace, that is, they share the same IP.
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 7.3.Start service
+Use the following command to start the service on each server, because docker and the host share IP, so you can directly specify to start the service on the host IP
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.Server Status
+
+The current status of the backup group can be obtained from the TuGraph visualization tool, REST API, and Cypher query.
+
+In the TuGraph visualization tool, you can find the list of servers and their roles in the backup group in the DBInfo section.
+
+With the REST API, you can use `GET /info/peers` to request information.
+
+In Cypher, the `CALL dbms.listServers()` statement is used to query the status information of the current backup group.
+
+## 9.Data synchronization in high availability mode
+
+In high availability mode, different servers in the same backup group may not always be in the same state. For performance reasons, if a request has been synchronized to more than half of the servers, the leader server will consider the request to be in the committed state. Although the rest of the servers will eventually receive the new request, the inconsistent state of the servers will persist for some time. A client may also send a request to a server that has just restarted, thus having an older state and waiting to join a backup group.
+
+To ensure that the client sees consistently continuous data, and in particular to get rid of the 'reverse time travel' problem, where the client reads a state older than it has seen before, each TuGraph server keeps a monotonically increasing data version number. The mapping of the data version number to the database state in the backup group is globally consistent, meaning that if two servers have the same data version number, they must have the same data. When responding to a request, the server includes its data version number in the response. Thus, the client can tell which version it has seen. The client can choose to send this data version number along with the request. Upon receiving a request with a data version number, the server compares the data version number to its current version and rejects the request if its own version is lower than the requested version. This mechanism ensures that the client never reads a state that is older than before.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/index.rst
new file mode 100644
index 0000000000..6d3b240af9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/2.running/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Running
+====================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/1.data-import.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/1.data-import.md
new file mode 100644
index 0000000000..110735815f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/1.data-import.md
@@ -0,0 +1,367 @@
+# Data Importing
+
+> This document describes the data import function of TuGraph. These include delimiters in CSV format, sample formats for jsonline, and two modes for importing online and offline.
+
+## 1. Introduction
+
+After the installation is successful, you can use the `lgraph_import` batch import tool to import existing data into TuGraph. `lgraph_import` supports importing data from CSV files and JSON data sources.
+
+> `sonline format, a row of a json array string`
+
+> CSV format
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline format
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph supports two data importing modes：
+
+- _offline_：Read the data and import it into a data file for the specified server, it should only be done when the server is offline.
+- _online_：Read the data and send it to the running server, which then imports the data into its database.
+
+## 2.CSV file format delimiter
+
+    CSV delimiters can be single-character or multi-character strings, which cannot contain 'r' or 'n'. Note that different shells handle input strings differently, so different escape handling may be required for different shell input parameters.
+
+In addition, 'lgraph_import' also supports the following escape characters for entering special symbols:
+
+| Escape character | Instructions                                                                                              |
+| ---------------- | --------------------------------------------------------------------------------------------------------- |
+| \\               | The backslash`\\`                                                                                         |
+| \\a              | ASCII code 0x07                                                                                           |
+| \\f              | form-feed，ASCII code 0x0c                                                                                |
+| \\t              | Horizontal tab characters， ASCII code 0x09                                                               |
+| \\v              | Vertical tab characters， ASCII code 0x0b                                                                 |
+| \\xnn            | Two hexadecimal digits representing one byte，example \\x9A                                               |
+| \\nnn            | A three-digit octal number representing a single byte，example \\001, \\443，data range cannot exceed 255 |
+
+Demo：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.The configuration file
+
+    `lgraph_import`tool configures the environment using the specified configuration file. The configuration file describes the paths to the input files, the vertices/edges they represent, and the vertex/edge format.
+
+### 3.1.Configuration File Format
+
+The configuration file consists of two parts: schema and files. The 'schema' part defines label, and the 'files' part describes the data files to be imported.
+
+#### 3.1.1.The keyword
+
+- schema (Array）
+  - label（required，string）
+  - type（required， VERTEX or EDGE）
+  - properties（Array，required for vertex，If there is no property for the edge, you can leave it unconfigured）
+    - name（required, string）
+    - type （required,，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（optional，Indicates that the field can be configured or not configured）
+    - index（optional，Whether the field needs to be indexed）
+    - unique（Optional, whether the field indexed and is of type unique）
+  - primary (Specify a property that uniquely identifies a point in the primary key field)
+  - constraints (Edge-only configuration, optional, array form, start and end labels, unconfigured or empty means unrestricted)
+  - detach_property (optional, both Edge and Vertex can config，default is `false`. `true` means the property data is stored in detached model, which can reduce io read amplification in cases with less memory and much property data.)
+- files （Array）
+  - path（required，string，The value can be a file path or a directory path. If it is a directory, all files in the directory will be imported. Ensure that they have the same schema）
+  - header（Optional, numeric, header in the first few lines of the file, or 0）
+  - format（required，JSON or CSV）
+  - label（required，string）
+  - columns（Array）
+    - SRC_ID (Special string，only on the edges,That means this column is the source data)
+    - DST_ID (A special string, only on the edges, indicates that this column is the destination data)
+    - SKIP   (A special string to skip this column of data)
+    - [property]
+  - SRC_ID (Edge-only configuration. The value is the start label)
+  - DST_ID (Edge-only configuration. The value is the destination point label)
+
+### 3.1.2.Example Configuration File
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+For the above Example Configuration File, three labels defined: two point types' actor 'and' movie ', and one edge type 'role'. Each label describes: the name of the label, the type (dot or edge), which attribute fields are available, and the type of each field. For points, the primary field also defined; For edges, the constraints field also defined, which limits the starting and ending points of the edges.
+
+It also describes three data files, two dot data files' actors.csv 'and' movies.csv ', and one edge data file 'roles.csv'. Each section describes the path of the file, the format of the data, the first few lines of the header, the label of the data, and the corresponding field of each column in each row of data in the file.
+
+For the above configuration files, the import tool will first create labels' actor ', 'movie', and 'role' in TuGraph, and then perform data import of the three files.
+
+## 4.Offline full import
+
+The offline mode can be used only on offline servers. An offline import creates a new graph, so it's more suitable for your first data import on a newly installed TuGraph server.
+
+To use the 'lgraph_import' tool in offline mode, you can specify the 'lgraph_import --online false' option. To see the command-line options available, use 'lgraph_import --online false --help' :
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+Command line arguments:
+
+- **-c, --config_file** `config_file`: Import the configuration file name in the following format:
+- **--log** `log_dir`: Log directory. The default is an empty string, in which case the log information output to the console.
+- **--verbose** `0/1/2`: Log level. The higher the log level, the more detailed the output information is. The default value is 1.
+- **-i, --continue_on_error** `true/false`: If an error occurs, skip the error and continue. The default is false. If an error occurs, exit.
+- **-d, --dir** `{diretory}`:The database directory to which the import tool will write data. Default is'./db '.
+- **--delimiter** `{delimiter}`: Data file separator. This is used only when the data source is in CSV format. The default is', '。
+- **-u, --username** `{user}`: Username of the database. You need to be an administrator to perform offline import.
+- **-p, --password** `{password}`: Specifies the password of the database user
+- **--overwrite** `true/false`: Whether to overwrite data. When set to true, the data directory overwritten if it already exists. Default to 'false'.
+- **-g, --graph** `{graph_name}`: Specify the kind of graph to import.
+- **-h, --help**: The help information displayed.
+
+### 4.1.Offline Import Example
+
+    In this example, we use the movie-actor data described above to demonstrate the use of the import tool. The data to be imported is divided into three files: 'movies.csv', 'actors.csv', and 'roles.csv'.
+
+'movies.csv' contains information about movies, where each movie has an id (as a primary key for retrieval), and each movie also has attributes such as title, year, and rating. (Data from [IMDb](http://www.imdb.com)).
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+> The jsonline format is as follows:
+> All fields can be strings, which will be converted to the corresponding type when imported
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`It contains information about the actors. Each actor also has an id, as well as properties such as name.
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`It contains information about which role an actor played in which movie. Each row records a character played by a given actor in a given movie, corresponding to an edge in the database.`SRC_ID` and `DST_ID` are the source and target vertices of the edge, which are the 'primary' properties defined in 'actors.csv' and 'movies.csv', respectively.
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+'configuration file import.conf', notice that there are two HEADER lines in each file, so we need to specify the 'HEADER=2' option.
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+Using the import configuration file, we can now import data using the following command:
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # Read configuration information from import.conf
+        --dir /data/lgraph_db      # Store the data in /data/lgraph_db
+        --graph mygraph            # Import the graph named mygraph
+```
+
+**Notice**：
+
+- If a graph named 'mygraph' already exists, the import tool will print an error message and exit. To force a graph to be overwritten, use the '--overwrite true' option.
+- Configuration and data files must be stored in UTF-8 encoding (or normal ASCII encoding, which is a subset of UTF-8). If any file uses an encoding other than UTF-8 (for example, UTF-8 with BOM or GBK), the import will fail and output a profiler error.
+
+## 5.Online incremental Import
+
+    The online import mode can be used to import a batch of files into an already running instance of TuGraph. This is handy for processing incremental batch updates that typically occur at fixed intervals. The 'lgraph_import --online true' option enables the import tool to work in online mode. Like offline mode, online mode has its own set of command-line options, which can be printed using the '-h, --help' options:
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+The configuration related to the file specified in the configuration file, and its format is exactly the same as' offline mode '. However, instead of importing the data into a local database, we are now sending the data to a running TuGraph instance, which is typically running on a different computer than the client machine on which the import tool is running. Therefore, we need to specify the URL, DB user, and password for the HTTP address of the remote machine.
+
+If the user and password are valid, and the specified graph exists, the import tool sends the data to the server, which then parses the data and writes it to the specified graph. The data will be sent in a packet of about 16 MB, interrupted at the nearest newline. Each package imported atomically, which means that if the package is successfully imported, all data is successfully imported; otherwise, none of the data enters the database. If '--continue_on_error true' is specified, data integrity errors are ignored and offending lines are ignored. Otherwise, the import stops at the first error package and prints out the number of packages that have been imported. In this case, the user can modify the data to eliminate errors, and then use '--skip_packages N' to redo the import to skip the imported packages.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/2.data-export.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/2.data-export.md
new file mode 100644
index 0000000000..b1ad57de6f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# Data Export
+
+> This document mainly introduces the data export function of TuGraph.
+
+## 1.Introduction
+
+TuGraph can use the tool `lgraph_export` to export data from the database that has been imported successfully. The 'lgraph_export' tool can export the data of the specified TuGraph database to the specified directory in the form of 'csv' or 'json' file, and export the configuration file 'import.config'. That required for re-importing the data.
+
+## 2.Data Export
+
+The following is an example of a command for the tool:
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+Details:
+
+- `-d {database_dir}` specifies the directory of the database from which the data will be exported. The default value is./testdb '.
+- `-e {export_destination_dir}` specifies the directory where the export file is stored. The default value is./exportdir.
+- `-g {graph_to_use}` specifies the type of graph database. default is' default '.
+- `-u {username}` Specifies the name of the user who performs the export operation.
+- `-p {password}` Specifies the password of the user who performs the export operation.
+- `-s {field_separator}` specifies the separator for the exported file. The default is comma.
+- `-f {output_format}` specifies the format of the exported data. It can be 'json' or 'csv'.
+- `-h` In addition to the specified parameters, you can also use this parameter to view the help of the tool.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..fa1839724b
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
@@ -0,0 +1,32 @@
+# Backup and Restore
+
+> This document mainly introduces the data backup and restore function of TuGraph.
+
+## 1.Data Backup
+
+TuGraph can use the 'lgraph_backup' tool to backup data.
+The 'lgraph_backup' tool can backup data from a TuGraph database to another directory. It can be used as follows:
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+Details:
+
+- `-s {source_dir}` specifies the directory where the database (source database) to be backed up resides.
+- `-d {destination_dir}` specifies the directory where the backup file (destination database) is stored.
+  If the target database is not empty, 'lgraph_backup' prompts you whether to overwrite the database.
+- `-c {true/false}` indicates whether a compaction occurs during backup.
+  Every compaction creates a tighter backup, but every compaction takes longer to create. This option defaults to 'true'.
+
+## 2.Data Restore
+
+The target database `{destination_dir}` obtained using the `lgraph_backup` tool backs up all subgraphs of the source database `{source_dir}`, but does not include the raft information of the HA cluster, thereby ensuring that the service and cluster can be successfully restarted with the backup database and the data is consistent with the source database. The following command can be used to restart the service with the backup database. When the service starts, the storage process of all subgraphs will be restored to ensure that the backup service is completely consistent with the original service.
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+Details
+
+- `-d {destination_dir}` Specify the directory where the backup file (target database) is located.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md
new file mode 100644
index 0000000000..6782a43d0e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# Data Warmup
+
+> This document mainly introduces the data Warmup function of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a disk-based database where data loaded into memory only when accessed. Therefore, for a period of time after the server just turned on, the system performance may be degraded due to frequent IO operations. At this point, we can improve this problem by data warm-up.
+
+## 2.lgraph_warmup
+
+Data warmup can be done using the tool lgraph_warmup. An example of its use is as follows:
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+Details:
+
+The - '-d {db_dir}' option specifies the data directory for the TuGraph server
+
+The - '-g {graph_list}' option specifies the names of graphs to be warmed-up, separated by commas
+
+The warm-up process takes different times depending on the data size and the type of disk being used. Preheating a large database on a mechanical disk may take a long time. Please wait patiently.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/index.rst
new file mode 100644
index 0000000000..d2d7ed7240
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/3.server-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Server Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/1.python-client.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/1.python-client.md
new file mode 100644
index 0000000000..3d21c53677
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/1.python-client.md
@@ -0,0 +1,32 @@
+# TuGraph Python SDK
+
+> This document is the usage instruction of TuGraph Python SDK
+
+## 1.Overview
+Python's TuGraph Rpc Client is a CPP Client SDK packaged with pybind11, so its interface details are not detailed in this document. This document only explains the use of TuGraph Python Restful Client SDK, including executing stored procedures, calling Cypher, and other operations.
+
+## 2.Demo
+
+### 2.1.Call cypher
+
+```python
+TuGraphClient import TuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+```
+
+### 2.2.Call stored procedure
+
+```python
+TuGraphClient import TuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..23741f2b5a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md
@@ -0,0 +1,245 @@
+# TuGraph C++ SDK
+
+> This document is the usage instruction of TuGraph C++ SDK
+
+## 1.Instructions
+
+C++ Client can use RPC to connect to lgraph_server to import data, execute stored procedures, call Cypher and other operations.
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+#### 2.1.1. Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2. Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3. Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+Among them, in the client in HA mode, by specifying the url parameter, a read request can be directed to a certain server.
+
+### 2.3.Call stored procedure
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+Among them, in the client in HA mode, by specifying the url parameter, a read request can be directed to a certain server.
+
+### 2.4.Load stored procedure
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.5.List stored procedures
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+Among them, in the client in HA mode, by specifying the url parameter, the request can be directed to a certain server.
+
+### 2.6.Delete stored procedure
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.7.Import from a byte stream schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.8.Import node and edge data from a byte stream
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.9.Import schema from a file
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.10.Import edge data from a file
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/3.java-client.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/3.java-client.md
new file mode 100644
index 0000000000..ad2daa1a85
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/3.java-client.md
@@ -0,0 +1,203 @@
+# TuGraph Java SDK
+
+## 1.Compile java client code
+
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies
+```java
+import com.alipay.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+Among them, in the client in HA mode, by specifying the url parameter, a read request can be directed to a certain server.
+
+### 2.3.Call stored procedure
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+Among them, in the client in HA mode, by specifying the url parameter, a read request can be directed to a certain server.
+
+### 2.4.Load stored procedure
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+
+### 2.5.List stored procedures
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+Among them, in the client in HA mode, by specifying the url parameter, the request can be directed to a certain server.
+
+### 2.6.Delete stored procedure
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+
+### 2.7.Import from a byte stream schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException
+```
+
+### 2.8.Import node and edge data from a byte stream
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+
+### 2.9.Import schema from a file
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout)
+            throws UnsupportedEncodingException, IOException
+```
+
+### 2.10.Import edge data from a file
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..1a778b73ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,176 @@
+# TuGraph-OGM
+
+@TODO
+
+## 1.Introduction
+
+> TuGraph-OGM project is open source on other repositories.
+
+TuGraph-OGM (Object Graph Mapping) is a graph object mapping tool designed for TuGraph. It supports the mapping of Java objects (POJO) into TuGraph. The classes in Java are mapped to nodes in the graph, the collections in the classes are mapped to edges, and the properties of the classes are mapped to the attributes of the graph objects. It also provides corresponding functions to manipulate the graph database. Therefore, Java developers can easily use TuGraph database in the familiar ecosystem. TuGraph-OGM is also compatible with Neo4j-OGM. Neo4j ecosystem users can migrate seamlessly to TuGraph database.
+
+### 1.1.Functions of TuGraph-OGM
+
+TuGraph-OGM provides the following functions for operating TuGraph:
+
+| Function                            | Usage                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| Insert single vertex/edge                 | void session.save(T object)                                                      |
+| Batch insert vertexs/edges                 | void session.save(T object)                                                      |
+| Delete vertex and its corresponding edges                | void session.delete(T object)                                                    |
+| Delete all vertexs with specific label       | void session.deleteAll(Class\<T> type)                                           |
+| Clear the database                      | void purgeDatabase()                                                             |
+| Update vertex                        | void session.save(T newObject)                                                   |
+| Query single node by id            | T load(Class<T> type, ID id)                                                     |
+| Query multiple nodes by ids           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| Query all nodes with specific label         | Collection\<T> loadAll(Class\<T> type)                                           |
+| Query with conditions                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher query (specify the return type) | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher query                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.Compile TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.Use TuGraph-OGM
+
+Please refer to the detailed examples in TuGraphOGMDemo under the demo folder.How to import dependencies in `pom.xml`.
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // create Movie vertex
+    @Id
+    private Long id;      // Movie id
+    private String title; // title attribute
+    private int released; // released attribute
+
+    // create Edge ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // create Actor vertex
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// configuration
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//Start driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// Open session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.Perform CRUD operations through OGM
+
+```java
+// new
+Movie jokes = new Movie("Jokes", 1990);  // Create Movie-vertex "jokes"
+session.save(jokes);                     // Store "jokes" in TuGraph
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // Connect the "speed" vertex with the "alice" vertex through the ACTS_IN relationship
+session.save(speed);                    // Store two vertexs and one edge
+
+// delete
+session.delete(alice);                  // Delete the "alice" vertex and its connected edge
+Movie m = session.load(Movie.class, jokes.getId());   // Get the "jokes" vertex based on its id
+session.delete(m);                                    // Delete the "jokes" node
+
+// update
+speed.setReleased(2018);
+session.save(speed);                   // Update the "speed" attribute
+
+// get
+Collection<Movie> movies = session.loadAll(Movie.class);  // Get all Movie vertexs
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // Query all movies released before 1995
+
+// Call Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // Query the Movie with "Speed" of 2018
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // Create vertex label "Director"
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // Create edge label "DIRECT"
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // Get the create result
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // View the number of vertexs created
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //View the number of edges created
+
+// Clear the database
+session.deleteAll(Movie.class);        // Delete all Movie vertexs
+session.purgeDatabase();               // Delete all data
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
new file mode 100644
index 0000000000..dd74d08869
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
@@ -0,0 +1,145 @@
+# Tugraph CLI
+
+> This document mainly introduces the CLI tool lgraph_cypher of TuGraph.
+
+## 1.Instructions
+
+The TuGraph release comes with a query client named 'lgraph_cypher' that can be used to submit OpenCypher requests to the TuGraph server. The 'lgraph_cypher' client has two execution modes: single command mode and interactive mode.
+
+## Single command mode
+
+In single-command mode, 'lgraph_cypher' can be used to submit a single Cypher query and print the result directly to the terminal. The printed result can also be easily redirected to a specified file. This is handy when users need to get a lot of results from the server and save them in files.
+
+In this mode, the 'lgraph_cypher' tool has the following options:
+
+### Command line Parameters:
+
+| Parameter | Type   | Instructions                                                                                                                                                                                                                           |
+| --------- | ------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| --help    | \\     | List all parameters and descriptions.                                                                                                                                                                                                  |
+| -example  | \\     | List the command instances.                                                                                                                                                                                                            |
+| -c        | string | A database configuration file used to obtain ip and port information.                                                                                                                                                                  |
+| -h        | string | Database server IP address. Omit this parameter if you have a configuration file. The default value is' 127.0.0.1 '                                                                                               |
+| -p        | string | Database server port. Omit this parameter if you have a configuration file. The default value is 7071                                                                                                                                  |
+| -u        | string | User name for logging in to the database.                                                                                                                                                                                              |
+| -P        | string | Password for logging in to the database.                                                                                                                                                                                               |
+| -f        | string | Contains the path to a single Cypher query single text file.                                                                                                                                                                           |
+| -s        | string | Single-line cypher query command. Start and end with `"`.                                                                                                                                                                              |
+| -t        | int    | Specifies the server timeout threshold for cypher queries. The default value is 150 seconds.                                                                                                                                           |
+| -format   | string | Query result display mode. Supports two formats: 'plain' and 'table'. The 'plain' format prints the query results in a single column. The 'table' format displays the query results in a tabular format. The default value is' table ' |
+
+### Examples:
+
+**cypher command file query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+
+```
+
+**cypher command single-sentence query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+
+```
+
+## Interactive mode
+
+'lgraph_cypher' can also be run in interactive mode. In interactive mode, the client stays connected to the server and interacts with the user in read-evaluate-print-loop.
+
+### Enter lgraph_cypher interaction mode:
+
+If no '-f' or '-s' command line option added, 'lgraph_cypher' will enter interactive mode when running. how to use it:
+
+```
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+
+```
+
+If the login is successful, the corresponding login success message will be displayed:
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2018 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+Now we also provide an interactive shell for users to enter Cypher queries or use the ':help' command to check for available commands.
+
+### Command Description
+
+In addition to the Cypher query, the shell of 'lgraph_cypher' accepts the following commands:
+
+| Command                  | Parameters                                         | instructions                                                                                                                                              |
+| ------------------------ | -------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                                 | Displays the server information and the corresponding description of all commands.                                                                        |
+| :db_info                 | \\                                                 | Query the current server status. /db/info for the corresponding REST API.                                                                                 |
+| :clear                   | \\                                                 | Clear the screen.                                                                                                                                         |
+| :use                     | {Graph Name}                                       | The graph specified with this name defaults to `default`                                                                                                  |
+| :source                  | `-t {Query the timeout value} -f {The query file}` | cypher command file query in interactive mode. The default timeout threshold is 150 seconds. Query file format reference No interactive query parameters. |
+| :exit                    | \\                                                 | Exit interactive mode and return to the original command line.                                                                                            |
+| :format                  | `plain` or `table`                                 | Change the display mode of cypher query results. Support 'plain' and 'table' modes.                                                                       |
+| :save all/command/result | `-f {The file path}` `{Cypher}`                    | The cypher command (command), query result (result) or both (all) are stored. The default location is' /saved_cypher.txt '                                |
+
+**Note:**
+
+- Each command should start with a colon `:`.
+
+**:save command example :**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+
+```
+
+### cypher query command:
+
+In interactive mode, users can also directly input a single sentence cypher command for query, with "'; ` "end. Enter commands that are case insensitive. Here's an example:
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher` supports multi-line input when typing commands. Users can use the `ENTER` key to type long query statements into multiple lines. In the case of multi-line input, the beginning of the command line will change from `>` to `=>`, and the user can continue to type the rest of the query.
+
+Example:
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### Auxiliary Features:
+
+**Input History:** Press the up and down arrow keys in interactive mode to display the input history.
+
+**Auto Completion:** lgraph_cypher will automatically complete based on the input history. In the event of a completion prompt, pressing the right arrow key will automatically complete the command.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/index.rst
new file mode 100644
index 0000000000..f9acd8d9e1
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/4.client-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Client Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
new file mode 100644
index 0000000000..6695299a7d
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
@@ -0,0 +1,1019 @@
+# Monitoring
+
+> This document mainly introduces the visualization operation and maintenance monitoring of TuGraph.
+
+## 1.Design Concept
+
+Visualization monitoring is not an indispensable part of TuGraph itself. Therefore, in the design, visualization monitoring is regarded as an application in the peripheral ecology of TuGraph to reduce the coupling with TuGraph database and its own impact. TuGraph visualization monitoring adopts the hottest open source solution - TuGraph Monitor + Prometheus + Grafana. Wherein, TuGraph Monitor is the client of TuGraph service, which initiates Procedure requests to TuGraph service through TCP connection. After receiving the request, TuGraph service collects statistics of CPU, memory, disk, IO, and number of requests on its own machine and responds. TuGraph Monitor packages the index data received from TuGraph into the format required by Prometheus and saves it in memory, waiting for Prometheus to obtain it through HTTP request. Prometheus regularly obtains packaged request data from TuGraph Monitor through HTTP requests and saves it in its own time-series database according to the time obtained. Grafana can obtain the statistical data within a certain time period from Prometheus according to user configuration and draw easy-to-understand graphics on the web interface to display the final result. In the entire request chain, the active acquisition, i.e. pull model, is used, which has the advantages of minimizing the coupling between data producers and data consumers, making development simpler, and not requiring data producers to consider the data processing capability of data consumers. Even if the data processing ability of a consumer is weak, it will not be crushed by the data producer producing data too fast. One of the shortcomings of the active pulling model is that the real-time performance of the data is insufficient. However, in this scenario, data does not have high real-time requirements.
+
+### 1.1.TuGraph
+
+TuGraph database provides the ability to collect multiple data information, such as disk, memory, network IO, and query requests, in the service machine, and provides queries through standard Procedure methods. This action of collecting data only occurs when a user queries through the interface, avoiding the impact of TuGraph monitoring service on user business query requests when users do not need the indicators on TuGraph monitoring service machine.
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor is a tool in the peripheral ecology of TuGraph. It communicates with TuGraph through C++ RPC Client as one of the many users of TuGraph and queries the performance indicators of the machine where TuGraph service is located through the Procedure query interface. It packages the results returned by TuGraph into the data model required by Prometheus and waits for Prometheus to obtain them. Users can set the query time interval to minimize the impact of obtaining monitoring indicators on business queries.
+
+### 1.3.Prometheus
+
+Prometheus is an open-source monitoring platform with a dedicated time-series database. It regularly obtains statistical indicators from the TuGraph Monitor service through HTTP requests and saves them in its own time-series database. For details, please refer to the official website:[https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana is an open-source visualization and analysis software. It can obtain data from multiple data sources, including Prometheus, and can convert data in the time-series database into tools for beautiful graphics and visual effects. For specific information, please refer to the official website:[https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.Deployment Solution
+
+### 2.1.Step 1
+
+Start the TuGraph service. For details, please refer to the documentation:[https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.Step 2
+
+Start the TuGraph Monitor tool. The startup command is as follows:
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+The meanings of the parameters are as follows:
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.Step Three
+
++ Download the Prometheus tarball that matches your machine architecture and system version. Download link:[https://prometheus.io/download/](https://prometheus.io/download/)
+
++ Unzip the tarball with the following command:
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ Modify the configuration file prometheus.yml and add the following configuration to enable Prometheus to scrape performance data packaged by TuGraph Monitor.
+
+```
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ Start Prometheus. You can obtain specific startup parameters with the following command:
+
+```shell
+./prometheus -h
+```
+
++ Verify if the Prometheus service is running properly by logging into the Prometheus service through the web portal, and querying whether the monitoring index resources_report has been obtained. If the data can be successfully queried, the operation is successful.
+
+### 2.4.Step Four
+
++ Download the Grafana installation package that matches your machine architecture and system version. Download link:[https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ Install Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Start Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Configure Grafana. First, configure the IP address of Prometheus in the data source settings. After the configuration is completed, verify if the data source is connected successfully by testing the connection function. Then, import the following template and modify the correct interface IP and port in the page according to the actual situation. Finally, set the refresh time and monitoring time range according to the actual situation.
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana",
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{label_name}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "memory",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \n  QPS exceeds 1000",
+        "name": "Request statistics alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "Request statistics",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "disk",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \nCPU usage rate exceeds 90%",
+        "name": "CPU usage rate alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU usage rate",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] Disk IO exceeds 10MB/S",
+        "name": "Disk IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph Monitoring Web",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+Verify the effect by refreshing the browser page. If the pie chart and line chart are displayed correctly, the configuration is completed.
+
+## 3.Future Plans
+
+Currently, visual monitoring only supports single-machine monitoring and can monitor performance indicators such as CPU, disk, network IO, and request QPS of the machine on which the service is located. In the future, monitoring for HA clusters will be implemented, and more meaningful indicators will be included in the monitoring scope.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
new file mode 100644
index 0000000000..a9c069a34a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
@@ -0,0 +1,439 @@
+# TuGraph DataX
+
+> This document mainly introduces the installation, compilation and usage examples of TuGraph DataX
+
+## 1.Introduction
+
+On the basis of Ali's open source DataX, TuGraph implements the support of writing plug-ins and jsonline data format, and other data sources can write data into TuGraph through DataX.
+DataX introduces reference [https://github.com/alibaba/DataX] (https://github.com/alibaba/DataX)
+Supported features include:
+
+- Import TuGraph from various heterogeneous data sources such as MySQL, SQL Server,Oracle, PostgreSQL, HDFS, Hive, HBase, OTS, ODPS, Kafka and so on. 
+  
+- Import TuGraph to the corresponding target source (to be developed)
+
+## 2.Compile and Install
+
+```bash
+git clone git@code.alipay.com:fma/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+The compiled DataX file is in the target directory
+
+## 3.Text data imported into TuGraph with DataX
+
+Using the data from the lgraph_import section of the TuGraph manual as an example, we have three csv data files, as follows:
+`actors.csv`
+
+```
+
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+
+```
+
+`movies.csv`
+
+```
+
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+
+```
+
+`roles.csv`
+
+```
+
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+
+```
+
+Then create three DataX job profiles:
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`/lgraph_server -c lgraph_standalone.json -d 'run'` 'Start TuGraph and run the following commands in sequence:
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## MySQL's data imported into TuGraph with DataX
+
+We create the following table of movies under 'test' database
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+Insert some data into the table
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+Create a DataX job configuration file
+
+`job_mysql_to_tugraph.json`
+
+**Configuring Field**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**Write simple sql**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` Start TuGraph and run the following command：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
new file mode 100644
index 0000000000..e9fd4bc8cd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
@@ -0,0 +1,146 @@
+# TuGraph Explorer
+
+TuGraph Explorer is strongly dependent on TuGraph, so before starting Explorer, we need to start TuGraph first.
+<a name="lGD6j"></a>
+
+## 1.Introduction
+
+TuGraph is a graph database independently developed by Ant Group, which provides graph database engine and graph analysis engine. Its main features are large data storage and computation, and it also supports efficient online transaction processing (OLTP) and Online analysis processing (OLAP).
+<a name="BOZFL"></a>
+
+## 2.Install TuGraph
+
+> Refer to the official documentation () for more information.
+
+TuGraph needs to be installed via Docker Image, follow these steps to install it locally:
+
+- install local Docker environment: reference[official documentation](https://docs.docker.com/get-started/);
+
+```shell
+$ sudo docker --version
+```
+
+If the above command can print the docker version number successfully, it indicates that the docker environment has been installed.
+
+- To download TuGraph images:[Download TuGraph Image](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.3.0/TuGraph-Image-3.3.0.tar.gz)
+
+Currently, TuGraph provides an image file based on Ubuntu 16.04 LTS and CenterOS 7.3. The image file is a compressed file named lgraph_x.y.z.ar, where x.y.z is the version number of TuGraph.
+
+- Load the TuGraph image:
+
+```shell
+// lgraph_lastest.tar.gz 是 TuGraph 镜像文件名
+$ docker import lgraph_lastest.tar.gz
+
+// After the loading is complete, a message is displayed indicating that the image has been loaded
+```
+
+- Start Docker
+
+```shell
+$ docker run -d -v {host_data_dir}:/mnt -p 7090:7090 -it reg.docker.alibaba-inc.com/tugraph/tugraph:x.y.z
+$ docker exec -it {container_id} bash
+
+// host_data_dir = /Users/moyee/tugraph
+// container_id = xxx
+$ docker run -d -v /Users/moyee/tugraph:/mnt -p 7090:7090 -it reg.docker.alibaba-inc.com/tugraph/tugraph:3.1.1
+$ docker exec -it xxx bash
+
+```
+
+Parameter Description
+
+- -v volume mapping
+- {host_data_dir} is a directory where the user wants to store data, such as/home/user1/workspace
+- -p The function of Docker is port mapping. The example maps Docker's port 7090 to the local port 7090
+- {container_id} is the container id of Docker, which can be obtained through docker ps
+
+<a name="LOzYE"></a>
+
+## 3.TuGraph operation
+
+<a name="zLris"></a>
+
+### 3.1.Start TuGraph Service
+
+```shell
+$ lgraph_server --license /mnt/fma.lic --config ~/demo/movie/lgraph.json
+```
+
+- fma.lic is the authorization file, should be placed in {host_data_dir} folder, mapped to the /mnt directory of docker
+- lgraph.json is the configuration file for TuGraph
+
+<a name="OUx1A"></a>
+
+### 3.2.TuGraph Browser Query
+
+TuGraph Browser Is a visual query tool provided by TuGraph. Users can open the browser, type {IP}:{Port}, enter the default username by 'admin', password by '73@TuGraph' to complete the login. Enter the TuGraph Query page after successful login.<br />![image.png](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+<a name="wGOCA"></a>
+
+## 4.Introduction to TuGraph Explorer
+
+TuGraph Explorer is a GraphInsight based visual graph analysis platform that provides complete graph exploration and analysis capabilities to help users gain valuable insights from massive graph data.
+
+<a name="uw3UH"></a>
+
+## 5.Start TuGraph Explorer
+
+Once TuGraph is installed successfully, you can start installing TuGraph Explorer.
+
+- Load TuGraph Explorer image：
+
+```shell
+// lgraph_lastest.tar.gz TuGraph image file name
+$ docker import tugraph_explore.tar.gz
+
+// After the loading is complete, a message is displayed indicating that the image has been loaded
+```
+
+- Start Docker
+
+```shell
+$ docker run -d -p 7091:7091 -it reg.docker.alibaba-inc.com/tugraph-explore:1.0.1
+$ docker exec -it {container_id} bash
+```
+
+Parameter Description:
+
+- -p The function of Docker is port mapping. In this example, Docker port 7091 is mapped to local port 7091
+- {container_id} is the id of a Docker container, which can be obtained through docker ps
+
+- Start TuGraph Explorer
+
+```shell
+$ cd /usr/src/tugraphexplore
+$ npm run dev -- -p 7091
+```
+
+After the TuGraph Explorer service started, it can be accessed through `**http://localhost:7091/tugraph/explore.html**` ，If everything is normal, you will see the following page.![image.png](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/tugraph-expolore/tugraph-explore-index.png)
+
+## 6.Connect TuGraph
+
+Once TuGraph Explorer is up, the first step is to connect to the TuGraph database. Click the "Connect" button to bring up the page for connecting to the Graph database, as shown in the image below.
+![image.png](https://gw.alipayobjects.com/mdn/rms_fa12c2/afts/img/A*JEUKRYMH--4AAAAAAAAAAAAAARQnAQ)
+
+To connect to TuGraph data, we need to provide the following information:
+
+- Graph database account
+- Graph database password
+- Address of the graph database: The format is ip:port
+
+**The IP address needs to be the container IP address, which can be queried by running the following command**。
+
+```
+$ docker run -d -v /Users/xx/tugraph:/mnt -p 7090:7090 -it reg.docker.alibaba-inc.com/tugraph/tugraph:3.3.0
+$ docker exec -it 8408b49033bc1698(TuGraph container) bash
+$ cat /etc/hosts
+127.0.0.1	localhost
+::1	localhost ip6-localhost ip6-loopback
+fe00::0	ip6-localnet
+ff00::0	ip6-mcastprefix
+ff02::1	ip6-allnodes
+ff02::2	ip6-allrouters
+172.17.0.4	8408b543243bc69
+```
+
+As shown above, the address to connect the graph database should be filled in:**172.17.0.4:7090**。
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md
new file mode 100644
index 0000000000..0c4e8fc28b
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md
@@ -0,0 +1,65 @@
+# Log
+
+> This document mainly introduces the logging function of TuGraph.
+
+## 1.Introduction
+
+TuGraph keeps two types of logs: server logs and audit logs. Server logs record human-readable server status information, while audit logs maintain encrypted information for every operation performed on the server.
+
+## 2.Server log
+
+### 2.1.Server Log Categories
+
+The server logs are currently divided into three categories: `general log`, `debug log`, and `query log`.
+
+The `general log` is for regular users and includes important information related to the database startup and shutdown, such as configuration information during database startup, the port listened for services, and whether the database has successfully started or shut down. It provides a clear indication of whether the database is running.
+
+The `debug log` is for database developers and includes debug-related information generated during runtime, such as network requests received by the database and the execution process of queries. It helps developers during development and developers can control the log level through the `verbose` configuration item.
+
+(to be implemented)The `query log` is for business developers and includes information about each query executed by database and the performance-related information of the database when executing the query, such as query execution time. It can filter queries whose execution time is lower than the specified threshold time through configuration setting, making it easier for business developers to analyze performance.
+
+### 2.2.Server Log Configuration Items
+The output directory of server logs can be specified through the `log_dir` configuration item. The level of detail in the debug log can be specified through the `verbose` configuration item.
+
+The `log_dir` configuration item is empty by default. If `log_dir` is empty, then all logs will be write to the console. If `log_dir` is manually specified, the following log folder structure will be generated in the corresponding path:
+
+```
+.
+├── debug.log
+├── general.log
+├── query.log(TODO)
+└── history_logs
+    ├── debug_logs
+    ├── general_logs
+    └── query_logs(TODO)
+```
+
+The `general log` is wrote into `general.log` file. The `debug log` is wrote into `debug.log` file. The `query log` is wrote into `query.log` file.
+
+The maximum size of a single log file is 64mb, and when it reaches the maximum file size, it will be rotated into the `history_logs` folder. `general.log` is rotated into the `general_logs` folder, and `debug.log` is rotated into the `debug_logs` folder.
+
+The `verbose` configuration item controls the level of detail of log records in `debug log`, and is divided into three levels of `0, 1, 2`. Ther verbosity of log record grows as the number grows. The default level is `2`, which records the most detailed log records. The server will print all log records in `DEBUG` level and above, and include the `[filename:function:line_number]` of the log records being printed, which is convenient for debugging. When the level is set to `1`, the server will only print major events log records in `INFO` level and above. When the level is set to `0`, the server will only print error log records in `ERROR` level and above.
+
+### 2.3.Example of Server Log Output Macro Usage
+
+If the developer wants to add logs to the code during development, they can refer to the following example:
+
+```
+#include "tools/lgraph_log.h" // add log dependency.
+
+
+void LogExample() {
+    // The log module has been initialized during the database startup, and developers can directly call the macro.
+    // The log level is divided into six levels: TRACE, DEBUG, INFO, WARNING, ERROR, and FATAL.
+
+    GENERAL_LOG(INFO) << "This is a info level general log message."; // general log的输出宏
+
+    DEBUG_LOG(ERROR) << "This is a error level debug log message."; // debug log的输出宏
+}
+```
+
+You can also refer to the log macro usage in test/test_lgraph_log.cpp.
+
+## 3.Audit log
+
+Audit logs record each request and response, as well as the user who sent the request and when the request received. Audit logging can only be turned on or off. The results can be queried using the TuGraph visualization tool and the REST API.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst
new file mode 100644
index 0000000000..4be6ec9ad4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Ecosystem-Tools
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/1.cypher.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/1.cypher.md
new file mode 100644
index 0000000000..7df4af1bcb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/1.cypher.md
@@ -0,0 +1,2530 @@
+# Cypher API
+
+> This document mainly introduces the detailed usage instructions of TuGraph-Cypher.
+
+## Table of contents
+- [1.Operators](#1operators)
+  - [1.1.Summary](#11summary)
+  - [1.2.General Operators](#12general-operators)
+  - [1.3.Mathematical Operators](#13mathematical-operators)
+  - [1.4.Comparison Operators](#14comparison-operators)
+  - [1.5.String Specific Comparison Operators](#15string-specific-comparison-operators)
+  - [1.6.Boolean Operators](#16boolean-operators)
+  - [1.7.String Operators](#17string-operators)
+  - [1.8.List Operators](#18list-operators)
+- [2.Clauses](#2clauses)
+  - [2.1.Summary](#21summary)
+  - [2.2.Match](#22match)
+  - [2.3.Return](#23return)
+  - [2.4.Where](#24where)
+  - [2.5.Skip](#25skip)
+  - [2.6.Limit](#26limit)
+  - [2.7.Create](#27create)
+  - [2.8.Callyield](#28callyield)
+  - [2.9.Union](#29union)
+- [3.Functions](#3functions)
+  - [3.1.Whole List of Functions](#31whole-list-of-functions)
+  - [3.2.Predicate Functions](#32predicate-functions)
+  - [3.3.Scalar Functions](#33scalar-functions)
+  - [3.4.Aggregating Functions](#34aggregating-functions)
+  - [3.5.List Funtions](#35list-funtions)
+  - [3.6.Mathematical Functions](#36mathematical-functions)
+- [4.Extensions to Opencypher](#4extensions-to-opencypher)
+- [5.Procedures](#5procedures)
+  - [5.1.Procedures Demos](#51procedures-demos)
+  - [5.2.Whole List of Procedures](#52whole-list-of-procedures)
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators support progress overview：
+
+| category                             | supported                                                                                                                                                       | unsupported                                 |
+| ------------------------------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------- |
+| General operators                    | <code>DISTINCT</code>, <code>.</code> for property access                                                                                                       | <code>[]</code> for dynamic property access |
+| Mathematical operators               | <code>+</code>, <code>-</code>, <code>\*</code>, <code>/</code>, <code>%</code>, <code>^</code>                                                                 |                                             |
+| Comparison operators                 | <code>=</code>, <code>&lt;&gt;</code>, <code>&lt;</code>, <code>&gt;</code>, <code>⇐</code>, <code>&gt;=</code>, <code>IS NULL</code>, <code>IS NOT NULL</code> |                                             |
+| String-specific comparison operators | <code>STARTS WITH</code>, <code>ENDS WITH</code>, <code>CONTAINS</code>, <code>REGEXP</code>                                                                    |                                             |
+| Boolean operators                    | <code>AND</code>, <code>OR</code>, <code>XOR</code>, <code>NOT</code>                                                                                           |                                             |
+| String operators                     | <code>+</code> for concatenation                                                                                                                                |                                             |
+| List operators                       | <code>+</code> for concatenation, <code>IN</code> to check existence of an element in a list, <code>[]</code> for accessing element(s)                          |                                             |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+  ```
+  CREATE (a:Person {name: 'Anne', eyeColor: 'blue'}),
+         (b:Person {name: 'Bill', eyeColor: 'brown'}),
+         (c:Person {name: 'Carol', eyeColor: 'blue'})
+  ```
+
+  ```
+  MATCH (p:Person ) RETURN DISTINCT p.eyeColor
+  ```
+
+- ✓ Accessing properties of a nested literal map using the `.` operator
+
+  ```
+  WITH {person: {name: 'Anne', age: 25}} AS p
+  RETURN p.person.name
+  ```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+  ```
+  CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+         (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+         (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+  ```
+  ```
+  MATCH (restaurant:Restaurant), (category:Category)
+  WHERE restaurant["rating_" + category.name] > 6
+  RETURN DISTINCT restaurant.name
+  ```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator `^`
+
+  ```
+  WITH 2 AS number, 3 AS exponent
+  RETURN number ^ exponent AS result
+  ```
+
+- ✓ Using the unary minus operator `-`
+  ```
+  WITH -3 AS a, 4 AS b
+  RETURN b - a AS result
+  ```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+  ```
+  WITH 4 AS one, 3 AS two
+  RETURN one > two AS result
+  ```
+
+### 1.5.String-specific comparison operators
+
+<span id="jump"></span>
+
+- ✓ Using STARTS WITH to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate STARTS WITH 'Jo'
+  RETURN candidate
+  ```
+
+- ✓ Using REGEXP to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate REGEXP 'Jo.*n'
+  RETURN candidate
+  ```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+  ```
+  WITH [2, 4, 7, 9, 12] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number = 4 OR (number > 6 AND number < 10)
+  RETURN number
+  ```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+  More details on string-specific comparison operators can be found [here](#jump)
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+  ```
+  RETURN [1,2,3,4,5]+[6,7] AS myList
+  ```
+- ✓ Using IN to check if a number is in a list
+
+  ```
+  WITH [2, 3, 4, 5] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number IN [2, 3, 8]
+  RETURN number
+  ```
+
+- ✓ Accessing elements in a list using the [] operator
+  ```
+  WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+  RETURN names[1..3] AS result
+  ```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses support progress list：
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>grammar</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="3"><p>Reading clauses</p></td>
+			<td><p>MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>OPTIONAL MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>MANDATORY MATCH</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="3"><p>Projecting clauses</p></td>
+			<td><p>RETURN … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>WITH … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>UNWIND … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="4"><p>Reading sub-clauses</p></td>
+			<td><p>WHERE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>ORDER BY [ASC[ENDING] / DESC[ENDING]]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>SKIP</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>LIMIT</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>Writing clauses</p></td>
+			<td><p>CREATE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>DETACH DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>SET</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>REMOVE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Reading/Writing clauses</p></td>
+			<td><p>MERGE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>CALL […YIELD]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Set operations</p></td>
+			<td><p>UNION</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>UNION ALL</p></td>
+			<td><p>supported</p></td>
+		</tr>
+	</tbody>
+</table>
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+    ```
+    MATCH (n)
+    RETURN n
+    ```
+  - ✓ Get all nodes with a label
+    ```
+    MATCH (movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Related nodes
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+  - ✓ Match with labels
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[]->(movie)
+    RETURN movie.title
+    ```
+  - ✓ Directed relationships and variable
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[r]->(movie)
+    RETURN type(r)
+    ```
+  - ✓ Match on relationship type
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})<-[:ACTED_IN]-(actor)
+    RETURN actor.name
+    ```
+  - ✓ Match on multiple relationship types
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[:ACTED_IN|:DIRECTED]-(person)
+    RETURN person.name
+    ```
+  - ✓ Match on relationship type and use a variable
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[r:ACTED_IN]-(actor)
+    RETURN r.role
+    ```
+
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+    ```
+    MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+    RETURN type(r)
+    ```
+  - ✓ Multiple relationships
+    ```
+    MATCH (charlie {name: 'Charlie Sheen'})-[:ACTED_IN]->(movie)<-[:DIRECTED]-(director)
+    RETURN movie.title, director.name
+    ```
+  - ✓ Variable-length relationships
+    ```
+    MATCH (martin {name: 'Charlie Sheen'})-[:ACTED_IN*1..3]-(movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Relationship variable in variable-length relationships
+    ```
+    MATCH p = (actor {name: 'Charlie Sheen'})-[:ACTED_IN*2]-(co_actor)
+    RETURN relationships(p)
+    ```
+  - ❏ Match with properties on a variable-length path
+    ```
+    MATCH p = (charlie:Person)-[* {blocked:false}]-(martin:Person)
+    WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+    RETURN p
+    ```
+  - ✓ Zero-length paths
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})-[*0..1]-(x)
+    RETURN x
+    ```
+  - ✓ Named paths
+
+    ```
+    MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+    ```
+
+  - ✓ Matching on a bound relationship
+
+    ```
+    MATCH (a)-[r]-(b)
+    WHERE id(r)= 0
+    RETURN a,b
+    ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (oliver:Person {name: 'Oliver Stone'}),
+    p = shortestPath((martin)-[*..15]-(oliver))
+    RETURN p
+    ```
+  - ✓ All shortest paths
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (michael:Person {name: 'Michael
+    Douglas'}), p = allShortestPaths((martin)-[*]-(michael))
+    RETURN p
+    ```
+
+- Get node or relationship by id
+
+  - ✓ Node by id
+    ```
+    MATCH (n)
+    WHERE id(n)= 0
+    RETURN n
+    ```
+  - ☒ Relationship by id
+    ```
+    MATCH ()-[r]->()
+    WHERE id(r) = 0
+    RETURN r
+    ```
+  - ✓ Multiple nodes by id
+    ```
+    MATCH (n)
+    WHERE id(n) IN [0, 3, 5]
+    RETURN n
+    ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+  ```
+  MATCH (n {name: 'B'}) RETURN n
+  ```
+
+  > **Note**
+  >
+  > Return `id` of n.
+
+- ✓ Return relationships
+
+  ```
+  MATCH (n {name: 'A'})-[r:KNOWS]->(c)
+  RETURN r
+  ```
+
+  > **Note**
+  >
+  > Return `EdgeUid` of r.
+
+- ✓ Return property
+  ```
+  MATCH (n {name: 'A'}) RETURN n.name
+  ```
+- ❏ Return all elements
+  ```
+  MATCH p = (a {name: 'A'})-[r]->(b)
+  RETURN *
+  ```
+- ❏ Variable with uncommon characters
+  ```
+  MATCH (`This isn\'t a common variable`)
+  WHERE `This isn\'t a common variable`.name = 'A'
+  RETURN `This isn\'t a common variable`.happy
+  ```
+- ✓ Aliasing a field
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age AS SomethingTotallyDifferent
+  ```
+- ✓ Optional properties
+  ```
+  MATCH (n)
+  RETURN n.age
+  ```
+- ❏ Other expressions
+
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age > 30, "I'm a literal", (a)-[]->()
+  ```
+
+  `(a)-[]->()` not supported.
+
+- ✓ Unique results
+  ```
+  MATCH (a {name: 'A'})-[]->(b)
+  RETURN DISTINCT b
+  ```
+
+### 2.4.WHERE
+
+- Basic usage
+
+  - ✓ Boolean operations
+    ```
+    MATCH (n)
+    WHERE n.name = 'Peter' XOR (n.age < 30 AND n.name = 'Tobias') OR NOT (n.name =
+    'Tobias' OR n.name = 'Peter')
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node label
+    ```
+    MATCH (n)
+    WHERE n:Swedish
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node property
+    ```
+    MATCH (n)
+    WHERE n.age < 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on relationship property
+    ```
+    MATCH (n)-[k:KNOWS]->(f)
+    WHERE k.since < 2000
+    RETURN f.name, f.age, f.email
+    ```
+  - ❏ Filter on dynamically-computed property
+    ```
+    WITH 'AGE' AS propname
+    MATCH (n)
+    WHERE n[toLower(propname)]< 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Property existence checking
+    ```
+    MATCH (n)
+    WHERE exists(n.belt)
+    RETURN n.name, n.belt
+    ```
+
+- String matching
+
+  - ✓ Match the beginning of a string
+    ```
+    MATCH (n)
+    WHERE n.name STARTS WITH 'Pet'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match the ending of a string
+    ```
+    MATCH (n)
+    WHERE n.name ENDS WITH 'ter'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match anywhere within a string
+    ```
+    MATCH (n)
+    WHERE n.name CONTAINS 'ete'
+    RETURN n.name, n.age
+    ```
+  - ✓ String matching negation
+    ```
+    MATCH (n)
+    WHERE NOT n.name ENDS WITH 's'
+    RETURN n.name, n.age
+    ```
+
+- Using path patterns in `WHERE`
+
+  - ✓ Filter on patterns
+    ```
+    MATCH (tobias {name: 'Tobias'}), (others)
+    WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+    RETURN others.name, others.age
+    ```
+  - ✓ Filter on patterns using NOT
+    ```
+    MATCH (persons), (peter {name: 'Peter'})
+    WHERE NOT (persons)-[]->(peter)
+    RETURN persons.name, persons.age
+    ```
+  - ✓ Filter on patterns with properties
+
+    ```
+    MATCH (n)
+    WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+    RETURN n.name, n.age
+    ```
+
+  - ✓ Filter on relationship type
+    ```
+    MATCH (n)-[r]->()
+    WHERE n.name='Andres' AND type(r) STARTS WITH 'K'
+    RETURN type(r), r.since
+    ```
+
+- Lists
+
+  - ✓ IN operator
+    ```
+    MATCH (a)
+    WHERE a.name IN ['Peter', 'Tobias']
+    RETURN a.name, a.age
+    ```
+
+- Missing properties and values
+
+  - ✓ Default to false if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white'
+    RETURN n.name, n.age, n.belt
+    ```
+  - ✓ Default to true if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+    ORDER BY n.name
+    ```
+  - ✓ Filter on null
+    ```
+    MATCH (person)
+    WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+    person.belt
+    ```
+
+- Using ranges
+
+  - ✓ Simple range
+    ```
+    MATCH (a)
+    WHERE a.name >= 'Peter'
+    RETURN a.name, a.age
+    ```
+  - ✓ Composite range
+    ```
+    MATCH (a)
+    WHERE a.name > 'Andres' AND a.name < 'Tobias'
+    RETURN a.name, a.age
+    ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 3
+  ```
+- ✓ Return middle two records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 1
+  LIMIT 2
+  ```
+- ✓ Using an expression with SKIP to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP toInteger(3*rand())+ 1
+  ```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT 3
+  ```
+- ✓ Using an expression with LIMIT to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT toInteger(3 * rand())+ 1
+  ```
+
+### 2.7.CREATE
+
+- Create nodes
+
+  > **Note**
+  >
+  > TuGraph does not support creating empty nodes and does not support multiple labels.
+
+  - ☒ Create single node
+    ```
+    CREATE (n)
+    ```
+  - ☒ Create multiple nodes
+    ```
+    CREATE (n), (m)
+    ```
+  - ✓ Create a node with a label
+    ```
+    CREATE (n:Person)
+    ```
+  - ☒ Create a node with multiple labels
+    ```
+    CREATE (n:Person:Swedish)
+    ```
+  - ✓ Create node and add labels and properties
+    ```
+    CREATE (n:Person {name: 'Andres', title: 'Developer'})
+    ```
+  - ✓ Return created node
+    ```
+    CREATE (a {name: 'Andres'})
+    RETURN a
+    ```
+
+- Create relationships
+
+  - ✓ Create a relationship between two nodes
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE]->(b)
+    ```
+  - ✓ Create a relationship and set properties
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE {name: a.name + '<->' + b.name}]->(b)
+    ```
+  - ✓ Create a full path
+    ```
+    CREATE p = (andres {name:'Andres'})-[:WORKS_AT]->(neo)<-[:WORKS_AT]-(michael {name:'Michael'})
+    RETURN p
+    ```
+
+- Use parameters with CREATE
+
+  - ❏ Create node with a parameter for the properties
+    ```
+    CREATE (n:Person $props)
+    RETURN n
+    ```
+  - ☒ Create multiple nodes with a parameter for their properties
+    ```
+    UNWIND $props AS map
+    CREATE (n)
+    SET n = map
+    ```
+    cannot create vertex without label.
+
+### 2.8.CALL\[…YIELD\]
+
+- ✓ Call a procedure using CALL
+  ```
+  CALL db.vertexLabels
+  ```
+- ✓ View the signature for a procedure
+  ```
+  CALL dbms.procedures() YIELD name, signature
+  WHERE name='dbms.listConfig'
+  RETURN signature
+  ```
+- ❏ Call a procedure using a quoted namespace and name
+  ```
+  CALL `db`.`vertexLabels`
+  ```
+- ✓ Call a procedure with literal arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+  ```
+- ❏ Call a procedure with parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+  ```
+- ❏ Call a procedure with mixed literal and parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+  ```
+- ✓ Call a procedure with literal and default arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+  ```
+- ✓ Call a procedure within a complex query using CALL…YIELD
+  ```
+  CALL db.vertexLabels() YIELD label
+  RETURN count(label) AS numLabels
+  ```
+- ✓ Call a procedure and filter its results
+  ```
+  CALL db.vertexLabels() YIELD label
+  WHERE label CONTAINS 'User'
+  RETURN count(label) AS numLabels
+  ```
+- ❏ Call a procedure within a complex query and rename its outputs
+  ```
+  CALL db.propertyKeys() YIELD propertyKey AS prop
+  MATCH (n)
+  WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+  ```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION ALL MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+- ❏ Combine two queries and remove duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION
+  MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>function</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="5"><p>Predicate functions</p></td>
+			<td><p>exists()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>all()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>any()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>single()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>none()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="14"><p>Scalar functions</p></td>
+			<td><p>id()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>properties()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>head()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>last()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toBoolean()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>toFloat()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toInteger()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toString()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>type()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>startnode()</p></td>
+            <td><p></p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>size()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>length()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>label()</p></td>
+            <td><p>OpenCypher extension method</p></td>
+		</tr>
+        <tr class="even">
+			<td rowspan="12"><p>Aggregating functions</p></td>
+			<td><p>avg()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>collect()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>count()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>max()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>min()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>percentileCont()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>percentileDisc()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>stDev()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>stDevP()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+                <td><p>variance()</p></td>
+                <td></td>
+            </tr>
+        <tr class="odd">
+                <td><p>varianceP()</p></td>
+                <td></td>
+            </tr>
+        <tr class="even">
+                <td><p>sum()</p></td>
+                <td></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>List functions</p></td>
+			<td><p>keys()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>labels()</p></td>
+			<td><p></p></td>
+		</tr>
+	<tr class="odd">
+			<td><p>nodes()</p></td>
+			<td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>range()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>subscript()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="6"><p>Mathematical functions</p></td>
+			<td><p>abs()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>ceil()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>floor()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>rand()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>round()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>sign()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>String functions</p></td>
+			<td><p>/</p></td>
+			<td></td>
+		</tr>
+	</tbody>
+</table>
+
+### 3.2.Predicate functions
+
+- exists()
+
+  judge it whether a vertex or edge has the field .
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE exists(n.belt)
+  RETURN n.name, n.belt
+  ```
+
+  **Example output:**
+
+  | exists(name) |
+  | ------------ |
+  | true         |
+
+### 3.3.Scalar functions
+
+- id()
+
+  get the id of vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  RETURN id(a)
+  ```
+
+  **Example output:**
+
+  | vid |
+  | --- |
+  | 1   |
+  | 2   |
+  | ... |
+
+- properties()
+
+  get a map containing all the properties of a node or relationship.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  CREATE (p:Person {name: 'Stefan', city: 'Berlin'})
+  RETURN properties(p)
+  ```
+
+  **Example output:**
+
+  | properties                |
+  | ------------------------- |
+  | {name:Stefan,city:Berlin} |
+
+- head()
+
+  get the first element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, head(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | head(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "one"         |
+
+- last()
+
+  get the last element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, last(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | last(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "three"       |
+
+- toFloat()
+
+  Converts an integer or string value to a floating point number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toFloat('11.5'), toFloat('not a number')
+  ```
+
+  **Example output:**
+  | float |
+  | ----- |
+  | 11.5 |
+  |null|
+
+- toInteger()
+
+  Converts a floating point or string value to an integer value.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toInteger('2.3') AS integer
+  ```
+
+  **Example output:**
+
+  | integer |
+  | ------- |
+  | 2       |
+
+- toString()
+
+  Converts an integer, float, boolean value to a string.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toString(2.3)
+  ```
+
+- type()
+
+  get the string representation of the relationship type.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name = 'Alice'
+  RETURN type(r)
+  ```
+
+  **Example output:**
+
+  | type     |
+  | -------- |
+  | acted_in |
+  | acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+
+  Returns the average of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN avg(n.age)
+  ```
+
+  **Example output:**
+
+  | avg(n.born)        |
+  | ------------------ |
+  | 1869.2661654135338 |
+
+- collect()
+
+  Returns a list containing the values returned by an expression.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN collect(n.age)
+  ```
+
+  **Example output:**
+
+  | collect(n.born) |
+  | --------------- |
+  | [1967,...]      |
+
+- count()
+
+  Returns the number of values or records.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n {name: 'A'})-[]->(x)
+  RETURN labels(n), n.age, count(*)
+  ```
+
+  **Example output:**
+
+  | labels(n)  | n.age | count(\*) |
+  | ---------- | ----- | --------- |
+  | ["Person"] | 13    | 3         |
+
+- max()
+
+  Returns the maximum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN max(n.age)
+  ```
+
+  **Example output:**
+
+  | max(n.age) |
+  | ---------- |
+  | 44         |
+
+- min()
+
+  Returns the minimum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN min(n.age)
+  ```
+
+  **Example output:**
+
+  | min(n.age) |
+  | ---------- |
+  | 13         |
+
+- percentileCont()
+
+  Returns the percentile of a value over a group using linear interpolation.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileCont(n.age, 0.4)
+  ```
+
+  **Example output:**
+
+  | percentileCont(n.age, 0.4) |
+  | -------------------------- |
+  | 29                         |
+
+* percentileDisc()
+
+  Returns the nearest value to the given percentile over a group using a rounding method.
+
+  **Scope:** whole instance.
+
+  **Output:** the percentile of the given value over a group.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileDisc(n.age, 0.5)
+  ```
+
+  **Example output:**
+
+  | percentileDisc(n.age, 0.5) |
+  | -------------------------- |
+  | 33                         |
+
+* stDev()
+
+  Returns the standard deviation for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDev(n.age)
+  ```
+
+  **Example output:**
+
+  | stDev(n.age)       |
+  | ------------------ |
+  | 15.716233645501712 |
+
+* stDevP()
+
+  Returns the standard deviation for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDevP(n.age)
+  ```
+
+  **Example output:**
+
+  | stDevP(n.age)      |
+  | ------------------ |
+  | 12.832251036613439 |
+
+* variance()
+
+  Returns the variance for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN variance(n.age)
+  ```
+
+  **Example output:**
+
+  | variance(n.age) |
+  | --------------- |
+  | 247             |
+
+* varianceP()
+
+  Returns the variance for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN varianceP(n.age)
+  ```
+
+  **Example output:**
+
+  | varianceP(n.age) |
+  | ---------------- |
+  | 164.66666666667  |
+
+* sum()
+
+  Returns the sum of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN sum(n.age)
+  ```
+
+  **Example output:**
+
+  | sum(n.age) |
+  | ---------- |
+  | 90         |
+
+### 3.5.List Funtions:
+
+- keys()
+
+  get the field names of some vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN keys(a)
+  ```
+
+  **Example output:**
+
+  | keys(a)               |
+  | --------------------- |
+  | ["name","age","eyes"] |
+
+- labels()/label()
+
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN labels(a)
+  ```
+
+  **Example output:**
+
+  | labels                 |
+  | ---------------------- |
+  | ["Person","Developer"] |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice'})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+### 3.6.Mathematical functions
+
+- abs()
+
+  get the absolute value of some data.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a), (e)
+  WHERE a.name = 'Alice' AND e.name = 'Eskil'
+  RETURN a.age, e.age, abs(a.age - e.age)
+  ```
+
+  **Example output:**
+
+  | a.age | e.age | abs(a.age - e.age) |
+  | ----- | ----- | ------------------ |
+  | 38    | 41    | 1                  |
+
+- ceil()
+
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+  **Example input:**
+
+  ```
+  RETURN ceil(0.1)
+  ```
+
+  **Example output:**
+
+  | ceil(0.1) |
+  | --------- |
+  | 1.0       |
+
+- floor()
+
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN floor(0.9)
+  ```
+
+  **Example output:**
+
+  | floor(0.9) |
+  | ---------- |
+  | 0.0        |
+
+- round()
+
+  Returns the value of a number rounded to the nearest integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN round(3.141592)
+  ```
+
+  **Example output:**
+
+  | round |
+  | ----- |
+  | 3     |
+
+- rand()
+
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN rand()
+  ```
+
+  **Example output:**
+
+  | rand()             |
+  | ------------------ |
+  | 0.9797131960534085 |
+
+- sign()
+
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN sign(-17), sign(0.1)
+  ```
+
+  **Example output:**
+
+  | sign(-17) | sign(0.1) |
+  | --------- | --------- |
+  | -1        | 1         |
+
+## 4.Extensions To OpenCypher
+
+- Number of Labels
+
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+
+  - OpenCypher: One node/relationship may have 0 to many labels.
+
+- Schema.
+
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.Procedures
+
+### 5.1.procedures' demos
+
+- dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                               | name            |
+  | --------------------------------------- | --------------- |
+  | db.vertexLabels() :: (label::STRING)    | db.vertexLabels |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels   |
+  | db.indexes() :: (index::LIST)           | db.indexes      |
+  | ...                                     | ...             |
+
+- db.vertexLabels()
+
+  Lists all available labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+
+  **Example output:**
+
+  | label   |
+  | ------- |
+  | genre   |
+  | keyword |
+  | movie   |
+  | ...     |
+
+- db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edgeLabels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | edgeLabel |
+  | --------- |
+  | acted_in  |
+  | directed  |
+  | ...       |
+
+- db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter     | parameter type | description                   |
+  | ------------- | -------------- | ----------------------------- |
+  | label_name    | string         | name of vertex label          |
+  | primary_field | string         | primary field of vertex label |
+  | field_spec    | list           | specification of a field      |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+  **Output:** If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added label [Person]
+  ```
+
+- db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description                   |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field             |
+  | type       | string     | type of the field             |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name         | type   | optional |
+  | ------------ | ------ | -------- |
+  | id           | INT32  | false    |
+  | born         | INT32  | true     |
+  | name         | STRING | true     |
+  | poster_image | STRING | true     |
+
+- db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | label_type | string         | either 'vertex' or 'edge'                                             |
+  | label_name | string         | name of the label                                                     |
+  | extra      | string         | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list           | specification of a field                                              |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.
+  for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+- db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:**
+
+  | field_name | field_type | description                      |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description                   |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string          | either 'vertex' or 'edge'     |
+  | label_name  | string          | name of the label             |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description               |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string         | either 'vertex' or 'edge' |
+  | label_name       | string         | name of the label         |
+  | field_value_spec | list           | specification of a field  |
+
+  in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, 'optional']`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+  | field_spec | list           | specification of a field  |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelModFields(
+  'vertex',
+  'new_label',
+  ['birth_date', 'DATETIME', '1900-01-01 00:00:00'],
+  ['gender', 'BOOL', false])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description              |
+  | ---------------- | -------------- | ------------------------ |
+  | label_name       | string         | name of the label        |
+  | edge_constraints | string         | edge constraints         |
+  | field_spec       | list           | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for optional fields.
+
+- `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32,true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+- db.addIndex(label_name, field_name, is_unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | is_unique  | boolean        | Specifies whether the index is unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+- dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description          |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string         | the current password |
+  | new_password     | string         | new password         |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string         | the user's name |
+  | new_password | string         | new password    |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.createUser(user_name, password)
+
+  create new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | ------------------------ |
+  | user_name | string         | the new user name        |
+  | password  | string         | the password of new user |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string         | the user name to be deleted |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string         | the user name               |
+  | is.admin  | boolean        | the permission of this user |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       | ...      |
+
+- dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description           |
+  | --------- | -------------- | --------------------- |
+  | user.user | string         | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+- dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+  a list of ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host         |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...          |
+
+- dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been deleted.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description                      |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string         | the name of new subgraph         |
+  | description | string         | description of new subgraph      |
+  | max_size_GB | integer        | Upper limit of subgraph capacity |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+  | config     | map            | the configuration to be modified     |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.listGraphs()
+
+  get all subgraph in this graph database .
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.config.list()
+
+  get some config of this graph database .
+
+  **Output:**
+
+  a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  | --------- | ------- |
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       | ...     |
+
+- dbms.config.update(updates)
+
+  get some config of this graph database .
+
+  **Output:**
+
+  If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+      enable_ip_check:false,
+      durable:true,
+      optimistic_txn:true,
+      enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+- dbms.takeSnapshot()
+
+  take the snapshot on this current graph database.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+- dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path                       |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+- algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                                                             |
+  | --------- | -------------- | --------------------------------------------------------------------------------------- |
+  | startNode | Node           | the source node of paths                                                                |
+  | endNode   | Node           | the destination node paths                                                              |
+  | config    | MAP            | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+  If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2         | 1         |
+
+- algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+- algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                               |
+  | --------- | -------------- | --------------------------------------------------------- |
+  | id        | ANY            | the id of vertexes or edges , the id must be variable     |
+  | config    | MAP            | the configuration of this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or it is an edge id.
+
+  **Output:**
+
+  If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.Whole List Of Procedures
+
+| Name                                  | Description                                                          | Signature                                                                                                                                                        |
+|---------------------------------------|----------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.vertexLabels                       | list all vertex labels                                               | db.vertexLabels() :: (label::STRING)                                                                                                                             |
+| db.edgeLabels                         | list all edge labels                                                 | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                          |
+| db.indexes                            | list all indexes                                                     | db.indexes() :: (label::STRING,field::STRING,unique::BOOLEAN)                                                                                                    |
+| db.warmup                             | warm up the DB                                                       | db.warmup() :: (time_used::STRING)                                                                                                                               |
+| db.createVertexLabel                  | create a vertex label                                                | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                           |
+| db.createLabel                        | create a vertex/edge label                                           | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                      |
+| db.getLabelSchema                     | get the schema of label                                              | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                        |
+| db.getVertexSchema                    | get the schema of vertex label                                       | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                               |
+| db.getEdgeSchema                      | get the schema of edge label                                         | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                 |
+| db.deleteLabel                        | delete vertex/edge label                                             | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                |
+| db.alterLabelDelFields                | delete some fields of a label on a subgraph                          | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                     |
+| db.alterLabelAddFields                | add some fields of a label on a subgraph                             | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                          |
+| db.alterLabelModFields                | modify some fields of a label on a subgraph                          | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                |
+| db.createEdgeLabel                    | create a edge label                                                  | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                              |
+| db.addIndex                           | add an index                                                         | db.addIndex(label_name::STRING,field_name::STRING,is_unique::BOOLEAN) :: (::VOID)                                                                                |
+| db.deleteIndex                        | delete an index                                                      | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                |
+| db.backup                             | backup the db                                                        | db.backup(destination::STRING) :: ()                                                                                                                             |
+| dbms.procedures                       | list all procedures                                                  | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                            |
+| dbms.security.changePassword          | change current user password                                         | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                          |
+| dbms.security.changeUserPassword      | change user password                                                 | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                             |
+| dbms.security.createUser              | create an account                                                    | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                         |
+| dbms.security.deleteUser              | delete an account                                                    | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.listUsers               | list all accounts                                                    | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                  |
+| dbms.security.showCurrentUser         | get current user name                                                | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                        |
+| dbms.security.getUserPermissions      | get the permissions of a specified user                              | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                          |
+| dbms.graph.createGraph                | create a subgraph                                                    | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                |
+| dbms.graph.modGraph                   | modify the config of a subgraph                                      | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                  |
+| dbms.graph.deleteGraph                | delete a subgraph                                                    | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                           |
+| dbms.graph.listGraphs                 | list all subgraphs                                                   | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                               |
+| dbms.graph.getGraphInfo               | get the information of a specified graph                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                             |
+| dbms.security.addAllowedHosts         | add to the trust list                                                | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                 |
+| dbms.security.deleteAllowedHosts      | remove from the trust list                                           | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                      |
+| dbms.security.listAllowedHosts        | list the trust list                                                  | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                               |
+| dbms.config.update                    | update the configuration                                             | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                            |
+| dbms.config.list                      | list the configuration                                               | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                  |
+| algo.shortestPath                     | get a shortest path between two vertexes                             | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                            |
+| algo.allShortestPaths                 | get all the shortest paths between two vertexes                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                             |
+| algo.native.extract                   | get the field values of a list of vertexes or edges specified id     | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                         |
+| db.flushDB                            | flush the db                                                         | db.flushDB() :: (::VOID)                                                                                                                                         |
+| dbms.security.listRoles               | list all roles                                                       | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                  |
+| dbms.security.createRole              | create a role                                                        | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                             |
+| dbms.security.deleteRole              | delete a role                                                        | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.getRoleInfo             | get the role information                                             | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                      |
+| dbms.security.disableRole             | enable/disable the role                                              | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.modRoleDesc             | modify the description of a role                                     | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.rebuildRoleAccessLevel  | rebuild the user subgraph access rights                              | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                 |
+| dbms.security.modRoleAccessLevel      | modify the user subgraph access rights                               | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                     |
+| dbms.security.modRoleFieldAccessLevel | modify the user property access rights                               | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)          |
+| dbms.security.getUserInfo             | get the user information                                             | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                      |
+| dbms.security.getUserMemoryUsage      | get the memory usage for a user                                      | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                        |
+| dbms.security.disableUser             | enable/disable the user                                              | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.setCurrentDesc          | set the current user description                                     | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.setUserDesc             | set user description                                                 | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.setUserMemoryLimit      | set user memory limit                                                | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                  |
+| dbms.security.deleteUserRoles         | delete roles from the user                                           | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                              |
+| dbms.security.rebuildUserRoles        | rebuild the relationship between the user and the role               | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                             |
+| dbms.security.addUserRoles            | add the user roles                                                   | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                 |
+| db.plugin.loadPlugin                  | load a plugin                                                        | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN, version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | unload a plugin                                                      | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                      |
+| db.plugin.listPlugin                  | list all plugins                                                     | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | get the information of a specified plugin                            | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                   |
+| db.plugin.callPlugin                  | execute the plugins                                                  | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)             |
+| db.importor.dataImportor              | import vertex/edge data                                              | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                      |
+| db.importor.schemaImportor            | import vertex/edge schema                                            | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                      |
+| dbms.meta.count                       | get the total number of vertex and edge                              | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                          |
+| dbms.meta.countDetail                 | get the number of vertex and edge for each label                     | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                |
+| dbms.meta.refreshCount                | recount the number of vertex and edge, stop writing during the count | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                          |
+| dbms.task.listTasks                   | list running tasks                                                   | dbms.task.listTasks()::(tasks::LIST)                                                                                                                             |
+| dbms.task.terminateTask               | terminate task                                                       | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                               |
+| dbms.ha.clusterInfo                   | get cluster info in HA mode                                          | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                |
+| db.dropDB                             | empty the db                                                         | db.dropDB() :: (::VOID)                                                                                                                                          |
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..f93f48839a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
@@ -0,0 +1,214 @@
+# Bootstrap program
+
+>This document is a bootstrap program designed for TuGraph users. Before reading the detailed documents, users should read this document first to have a general understanding of TuGraph's graph computing operation process, and it will be more convenient to read the detailed documents later. The bootstrap program is a simple instance of a bfs (breadth-first search) program based on Tugraph, and we will focus on how it is used.
+
+## 1.Introduction to TuGraph-Graph Analysis Engine
+
+TuGraph's graph analysis engine is mainly used for full graph/full data analysis tasks. With the help of TuGraph's C++ / Python graph analysis engine API, users can quickly derive a complex subgraph from different data sources, and then run iterative graph algorithms such as PageRank, LPA, WCC on the subgraph, and finally make corresponding countermeasures according to the running results.
+
+In TuGraph, the process of both exporting and computing can be accelerated by in-memory parallel processing, resulting in near-real-time processing and analysis. Compared to traditional methods, this approach can avoid the overhead of data export and disk drop, and can achieve ideal performance by using a compact graph data structure.
+
+TuGraph has 6 built-in algorithms in the community version and 25 built-in algorithms in the commercial version. Users hardly need to implement the specific graph calculation process themselves. For details, please refer to algorithms.md.
+
+According to different data sources and implementations, it can be divided into Procedure, Embed and Standalone, which all inherit from OlapBase API. OlapBase API interface documentation can be found in OlAPBase-APi.md.
+
+The data source of Procedure and Embed is the db data preloaded in the graph database, which can be compiled to generate the.so file used by TuGraph-Web loading and the embed file used by the background terminal respectively. The input graph data are loaded in the form of db. The interface document can refer to olapondb-api.md.
+
+Standalone is used to compile and generate a standalone file. Different from the former, the input graph data of the file is loaded in the form of txt, binary, and ODPS files, and the interface document can refer to olapondisk-api.md.
+
+## 2.Procedure compile and run
+
+This mode is mainly used for visual loading and running on the TuGraph-web interface. The usage method is as follows:
+
+### 2.1.C++
+Run bash make_so.sh bfs in the TuGraph/plugins directory to the BFs.so file in the TuGraph/plugins directory, upload the file as a plug-in to Tugraph-web, input parameters and then execute.
+
+### 2.2.Python
+Upload the python file as a plugin to TuGraph-web, and execute it after inputting parameters.
+
+Example:
+Compile the.so algorithm file at TuGraph/plugins
+`bash make_so.sh bfs`
+
+After loading the bfs.so (or TuGraph/plugins/cython/bfs.py) file as a plug-in to TuGraph-web, enter the following json parameters:
+
+```json
+{
+  "root_id": "0",
+  "label": "node",
+  "field": "id"
+}
+```
+
+The following result
+
+result:"{"core_cost":0.013641119003295898,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":8.821487426757813e-06,
+"prepare_cost":0.03479194641113281,
+"total_cost":0.04844188690185547}"
+
+The output ：
+
+- num_edges: the number of edges in the graph
+- num_vertices: the number of nodes in the graph
+- prepare_cost: Represents the time required for the preprocessing phase. The preprocessing phase works: loading parameters, graph data loading, index initialization.
+- core_cost: Represents the time required for the algorithm to run.
+- found_vertices: Number of vertices found.
+- output_cost: the time it takes for the algorithm result to be written back to db.。
+- total_cost: The overall running time of the algorithm is executed.
+
+make_so.sh This file is used to compile the graph algorithm files involved in TuGraph-OLAP into a.so file available for TuGraph-web.
+
+## 3.Embed compile and run
+
+This way is mainly used for TuGraph in the background program on the preloaded db graph data algorithm analysis. Its use method is as follows:
+
+To complete the embed_main.cpp file in TuGraph/plugins directory, add the data name, input parameters, data path and other information, as shown in the following example:
+
+### 3.1.C++
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path Specifies the path for saving the preloaded graph data
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // Specifies the name of the graph
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // Enter the algorithm parameters in json format
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+
+Run bash make_so.sh bfs in TuGraph/plugins to bfs_procedure in TuGraph/plugins/cpp.
+`bash make_embed.sh bfs`
+
+Do this in the TuGraph/plugins folder
+`./cpp/bfs_procedure`
+The result is returned.
+
+Input: {"root_id":"0", "label":"node","field":"id"}
+found_vertices = 3829
+{"core_cost":0.025603055953979492,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":9.059906005859375e-06,
+"prepare_cost":0.056738853454589844,
+"total_cost":0.0823509693145752}
+
+`Input` indicates the input parameters.The other parameters are described as above.
+
+### 3.2.Python
+
+To compile bfs.so, run `bash make_cython_so.sh bfs` in TuGraph/plugins or `python3 setup.py build_ext -i` in TuGraph/plugins/cython.
+
+After obtaining bfs.so, it can be imported and used in Python, as shown in TuGraph/plugins/embed_main.py:
+
+```python
+# TuGraph/plugins/embed_main.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+
+# shell
+python3 embed_main.py
+```
+The output is the same as C++
+
+
+## 4.Standalone compile and run
+
+This file is mainly used to load the graph data directly at the terminal and run the printout results. Here's how to use it:
+
+In TuGraph/build directory `make bfs_standalone` (need to include boost/sort/sort.hpp in the g++ default include path) can get bfs_standalone file, the file is generated with TuGraph/build/output/algo folder.
+
+Run: Go to the TuGraph/build directory and do`./output/algo/bfs_standalone -- type [type] -- input_dir [input_dir] --id_mapping [id_mapping] -- vertices [vertices] --root (root) - output_dir [output_dir]`
+
+Ready to run.
+
+- `[type]` : indicates the type source of the input graph file, including text file, BINARY_FILE binary file, and ODPS source.
+
+- `[input_dir]` : indicates the path of the input graph file folder, which may contain one or more input files. TuGraph will read all the files under [input_dir] when reading the input file. It is required that [input_dir] can only contain the input file and cannot contain other files. Parameters cannot be omitted.
+
+- `[id_mapping]`：When reading the side table, whether to do id mapping for the input data to make it conform to the form of algorithm operation. 1 is required for id mapping, 0 is not required. This process will take some time. The parameter can be omitted, and the default value is 0.
+
+- `[vertices]` : represents the number of vertices in the graph. 0 indicates the number of vertices that the user wants the system to automatically recognize. When is non-zero, it indicates the number of vertices that the user wants to customize. The number of user-defined vertices must be greater than the maximum vertex ID. This parameter can be omitted. The default value is 0.
+
+- `[root]` : indicates the starting vertex id for bfs. The argument cannot be omitted.
+
+- `[output_dir]` : indicates the path of the folder where the output data is saved. The output content is saved to this file, and the parameter cannot be omitted.
+
+Example
+
+### 4.1.C++
+
+Compile the standalone algorithm program at TuGraph/build
+
+```shell
+make bfs_standalone
+```
+
+Run the text source file in TuGraph/build/output
+
+```
+    ./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+Result：
+
+```
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+Result Parameter description is the same as above.
+
+If you do not know the required parameters of a new algorithm, run the`./output/algo/bfs_standalone -h` to view the parameters.
+
+### 4.2.Python
+The bfs extension compilation process of the Python language is the same as that of the embed mode. It is called through the `Standalone` interface at runtime. The example is as follows:
+
+```python
+# TuGraph/plugins/standalone_main.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(
+        input_dir="../test/integration/data/algo/fb_unweighted",
+        root=0)
+
+# shell
+python3 standalone_main.py
+```
+
+At this point, the process of bfs operation on the figure above by TuGraph is complete.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..af510f95c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
@@ -0,0 +1,196 @@
+# OlapBase API
+
+> This document will introduce how to use the OlapBase API
+
+## 1.The overview
+
+This manual will introduce the configuration of the TuGraph graph computing system. Combined with the code, several important files and interfaces in TuGraph are introduced.
+
+## 2.Configuration requirements
+
+To develop and compile applications using the TuGraph graph computing system, the configuration required:
+
+- linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+
+- Compiler that supports C++ 14, requires GCC version 5.4.1 or later.
+
+## 3.Atomic operations
+
+TuGraph uses multi-threading technology for batch operations, in which case memory access conflicts may occur. In order to ensure the correctness of modification operations in parallel computing, TuGraph implements atomic operations. The code section can be found in the lgraph_atomic.cpp file under the lgraph folder.
+
+TuGraph also customizes 4 commonly used atomic operations. When we need to modify the data of vertices in multithreaded mode, we should use atomic operations to ensure the correctness of the modification operation in parallel environment. In addition to these four atomic operations, users can also use "cas" to build their own atomic operation functions.
+
+- `bool cas(T \* ptr, T oldv, T newv)` : If the value pointed to by ptr is equal to oldv, the value pointed to by ptr is assigned to newv and returns true. Otherwise, false is returned
+- `bool write_min(T \*a, T b)` : If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `bool write_max(T \*a, T b)` : If b is larger than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `void write_add(T \*a, T b)` : adds the value of b to the value pointed to by a.
+- `void write_sub(T \*a, T b)` : subtract the value of b from the value pointed to by a.
+
+## 4.Vertex Class ParallelBitset
+
+When using TuGraph for batch operations, you need to use a vertex set to represent the vertices you want to process. ParallelBitset implements a vertex collection class that represents vertices in bits and thus saves a significant amount of memory. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 4.1ParallelBitset Class
+
+- `size_t Size()`：Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size_t size)`：Initialize size and data, the length of data is (size >> 6)+1.
+- `void Clear()`：clears the collection.
+- `void Fill()`：add all vertices to the set.
+- `bool Has(size_t i)`：check if vertex i is in the set.
+- `bool Add(size_t i)`：add vertex i to the set.
+- `void Swap(ParallelBitset &other)`：exchange elements with another set of ParallelBitset.
+
+## 5.Vertex Array Class ParallelVector
+
+When using TuGraph for batch operations, you need to use an array of vertices to represent the result of processing vertices. ParallelVector implements the vertex array class. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 5.1.ParallelVector Class
+
+- `ParallelVector(size_t capacity)` Builds ParallelVector. capacity is the initial size of the vertex array
+- `T& operator[](size_t i)` : data with subscript i
+- `T \*begin()` : ParallelVector the starting pointer
+- `T \*end()` : ParallelVector the end pointer to Parallelvector. begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to access an array sequentially
+- `T&Back ()` : ParallelVector the last data
+- `T \*Data()` : represents the data in the array itself
+- `void Destroy()' : empty the ParallelVector array and delete the array
+- `size_t Size()` : indicates the number of data in ParallelVector
+- `size_t Capacity()` : indicates the capacity of ParallelVector
+- `void Resize(size_t size)` : Change ParallelVector to size, which must be greater than or equal to the size before the change
+- `void Clear()` : empty the data in ParallelVector
+- `void ReAlloc(size_t capacity)` : ParallelVector is allocated with new capacity. If data exists in the array, it is migrated to the new memory
+- `void Fill(T elem)` : Assign elem to all data on ParallelVector
+- `void Append(const T&elem, bool atomic = true)` : Add a piece of data at the end of ParallelVector
+- `void Swap(ParallelVector<t> &other)` : to exchange data with other parallelvectors</t>
+- `ParallelVector<t> Copy()` : copies the current ParallelVector data into the Copy array</t>
+
+## 6.Customize data structures
+
+### 6.1.Basic data types
+
+We customize the data structure representation of points and edges to save memory space while covering all vertices:
+
+- 'Empty' : indicates a special data type with empty content.
+
+### 6.2.Combining data structures
+
+In order to facilitate calculation, we define several data structures of point and edge data according to different calculation scenarios, which are as follows:
+
+- `EdgeUnit<edgedata>` : represents an edge of weight type EdgeData, used to parse the input file, and contains three member variables:</edgedata>
+- `size_t src` : the starting vertex of an edge
+- `size_t dst` : the end of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjUnit<edgedata>` : represents an edge of weight type EdgeData, used during batch computation, and contains two member variables:</edgedata>
+- `size_t neighbour` : indicates the neighbor vertex of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjList<edgedata>` : Adjacency list of vertices with weights of type EdgeData, often used to represent the set of incoming and outgoing edges of vertices and containing two member variables:</edgedata>
+- `AdjUnit<t> \* begin` : indicates the start pointer of the list</t>
+- `AdjUnit<t> \* end` : The end pointer of the list.</t> begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to loop through the adjacency list.
+
+## 7.Graph class OlapBase
+
+Graph class OlapBase is the main class for TuGraph to load graphs and calculate graphs. OlapBase is commonly used to represent graphs with weights of type EdgeData. See olap_base.hpp under lgraph folder for the code. This chapter covers the types and API interfaces commonly used in Graph classes. The classes used by the Procedure, Embed, and Standalone functions described above are all subclasses of this class.
+
+### 7.1.Basic Information
+
+- `size_t NumVertices()` : obtains the number of vertices
+
+- `size_t NumEdges()` : Gets the number of edges
+
+- `size_t OutDegree(size_t vid)` : indicates the outdegree of the vid of the vertex
+
+- `size_t InDegree(size_t vid)` : indicates the input degree of vertex vid
+
+### 7.2.node sets and edge sets and their related operations
+
+- `ParallelVector AllocVertexArray()` : Allocates an array of type VertexData with size as the number of vertices
+
+- `void fill_vertex_array(V \* array, V value)` : assigns values to all elements in the array
+
+- `ParallelBitset AllocVertexSubset()` : Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+
+- `AdjList OutEdges(size_t vid)'`: gets the set of all outgoing edges of vertex v
+
+- `AdjList InEdges(size_t vid)` : Obtains the set of all incoming edges of vertex v
+
+- `void Transpose()` : transpose of a directed graph
+
+- `LoadFromArray(char \* edge_array, VertexId input_vertices, EdgeId input_edges, EdgeDirectionPolicy (edge_direction_policy) `: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+`edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+`input_vertices`: specifies the number of vertices read into the graph by the array.
+
+`input_edges` : specifies the number of edges that the array reads into the image.
+
+`edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+### 7.3.Locking mechanism
+
+TuGraph implements a pair of locks to control the program's access to vertex data. Respectively is:
+
+- `void AcquireVertexLock(size_t vid)` : locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(size_t vid)` : unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+- `VertexLockGuard GuardVertexLock(size_t vid)` : When the vid operation is performed, the vertex vid is locked, and the lock is automatically released upon exiting the scope
+
+### 7.4.Batch Processing Operations
+
+TuGraph provides two batch operations to do a point-centered batch process in parallel. Respectively is:
+
+```c++
+/*
+    Function Name:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    The work function executes the work function on nodes whose numbers are between lower and upper in the Graph. The fourth parameter indicates the accumulated base, which defaults to 0.The fifth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+For details, please refer to include/lgraph/olap_base.h
+
+    Example: Count the number of vertices in the parent array that have outgoing edges
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+graph is the instantiated object of graph class OlapBase
+
+```C++
+/*
+    Function Name:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    Function: Execute the work function for the node that corresponds to 1 in active_vertices. The third parameter represents the cumulative cardinality, which is 0 by default.
+
+    The fourth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+
+    For specific implementation, please refer to the specific code in /include/lgraph/olap_base
+
+
+
+    Example: Output all the out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..6015d7e1ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,303 @@
+# OlapOnDB API
+
+> This document provides detailed instructions for using the OlapOnDB API
+
+## 1.Introduction
+
+Generally speaking, users need to implement the process of subgraph extraction by themselves. Then use the rich interface in TuGraph to implement your own graph analysis algorithm.
+
+This document mainly introduces the Procedure and Embed interface design, and introduces some common interface, specific interface information see include/lgraph/olap_on_db.h file.
+
+## 2.Schema
+
+Procedure and Embed auxiliary functions are mainly included in the OlapOnDB class, and some more frequently used functions will be introduced one by one
+
+OLAP is associated with the following common data structures in TuGraph:
+
+1. DB graph analysis class `OlapOnDB`
+
+2. Vertex array `ParallelVector`
+
+3. Vertex set `ParallelBitset`
+
+4. Side data structure `AdjUnit/AdjUnit`
+
+5. Edge collection data structure `AdjList`
+
+### 2.1.Snapshot Based Storage Structure
+
+The OlapOnDB class in TuGraph provides a data "snapshot," that is, a fully usable copy of a given data set that includes a mirror image of the corresponding data at a certain point in time (the point at which the copy was started). Because OLAP operations involve only reads and not writes, OlapOnDB arranges data in a more compact manner, saving space while improving data access locality.
+
+### 2.2.BSP Calculation Model
+
+TuGraph uses the BSP (Bulk Synchronous Parallel) model in the process of calculation, which makes the process can be executed in parallel, and greatly improves the efficiency of the program.
+
+The core idea of BSP calculation model is to propose and use Super Step. After OlapOnDB is created, the computation on this data is divided into multiple supersteps, such as PageRank, which is divided into multiple iterations, and each iteration is a Super Step. There is explicit synchronization between different Super Steps to ensure that all threads proceed to the next Super Step at the same time after completing the same superstep. Within a Super Step, all threads execute asynchronously, using parallelism to improve computational efficiency.
+
+BSP calculation model can effectively avoid deadlock, and achieve coarse-grained global synchronization in hardware mode by means of obstacle synchronization, so that graph computation can be executed in parallel, and programmers do not need to spend much time on synchronization mutual exclusion.
+
+## 3.Algorithm example
+
+Here is an explanation of the PageRank algorithm, which is mainly divided into the main function Process and the PageRank algorithm process function.
+
+### 3.1.Main function
+
+The main function has three input parameters, 'TuGraph' database parameter 'db', the request 'request' obtained from the web side, and the return value 'response' given to the web side. The overall process can be divided into the following steps:
+
+1. Obtain related parameters
+
+2. Create a snapshot class
+
+3. Main process of PageRank algorithm
+
+4. Obtain and send the return value of the web page
+
+```c
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+
+    // Obtain the number of iterations from web side requests (num_iterations)，
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // Read transaction creation and snapshot class creation
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+
+    // Create a pr array to store the pr value for each node
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank algorithm main process, obtain the pagerank value of each node
+    PageRankCore(olapondb, num_iterations, pr);
+
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        Function Purpose: Gets the number of the node with the largest pagerank among all nodes
+
+        Function flow description: This function executes Func A for node vi (also known as the active vertices) corresponding to all bits of 1 in the vertex set all_vertices. The return value of Func A is then used as the second input parameter of Func B to obtain the local maximum value (because the first input parameter is 0. So the return value is actually the pagerank value of each node). Finally, the return value of all threads is summarized, and Func B is executed again to get the global return value, and stored in the max_pr_vi variable
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+
+    // Retrieve and send the return value from the web page
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2.PageRank Algorithm process
+
+`pagerank` main process has two input parameters, snapshot class (subgraph) and iteration times, the overall process can be divided into the following steps:
+
+1. Initialization of related data structures
+2. Initialize the pagerank value of each node
+3. Calculation of pagerank value of each node, active vertices for all vertices (means that all vertices need to calculate pagerank value)
+4. Obtain the pagerank value after 'num_iterations' of each node
+
+```c
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+
+    // Initialization of related data structures
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // The initialization of the pagerank value of each node is inversely proportional to the degree of the node
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // Total iteration process
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            Function Purpose: Calculates the pagerank of all nodes
+
+            Function flow description: This function is used to calculate the pagerank value of all nodes. Execute Func C on node vi corresponding to all the bits of 1 in all_vertices to obtain the pagerank value of vi in the current iteration and return the pagerank change value of vi node. The total change value of all active nodes is finally summarized and returned through the internal processing of the function, which is stored in the delta variable
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // Gets the pagerank value of the current node from its neighbor
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank value calculation core formula
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+
+                    // Statistics of relevant intermediate variables
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // The pagerank value obtained in this iteration is output as the input of the next iteration
+        curr.Swap(next);
+    }
+}
+```
+
+### 4.1.Transaction creation
+
+```c
+// Create a read transaction
+auto txn = db.CreateReadTxn();
+
+// Write transaction creation
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2.Parallelization to create a directed graph
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3.Create undirected graphs in parallel
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED;
+)
+```
+
+### 4.4.Obtain the output degree
+
+```c
+size_t OutDegree(size_t vid)
+```
+
+### 4.5.Obtain the input degree
+
+```c
+size_t InDegree(size_t vid)
+```
+
+### 4.6.Gets the outgoing edge set
+
+```c
+/*
+    Function name: AdjList OutEdges(size_t vid)
+
+    Data structure:
+
+    An AdjList can be understood as an array of structures of type AdjUnit
+
+    AdjUnit has two member variables: 1. size_t neighbour 2. edge_data: neighbour indicates the number of the target node pointed by the outgoing edge. If the value is a licensed graph, the data type of edge_data is the same as the weight value of the edge in the input file
+
+    Example Output all outgoing neighbors of node vid
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7.Gets the incoming edge set
+
+```c
+AdjList<edgedata> InEdges(size_t vid)</edgedata>
+
+// Example: Outputs all inbound neighbors of node vid
+for (auto & edge : olapondb.InEdges(vid)) {
+size_t dst = edge.neighbour;
+printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8.Get the node ID of OlapOnDB corresponding to the node in TuGraph
+
+```c
+size_t OriginalVid(size_t vid)
+
+// Note: The node numbers entered in TuGraph can be non-numbers, such as names. When OlapOnDB subgraphs are generated, names and other names will be converted to numbers for subsequent processing. Therefore, this method may not be applicable to some specific scenarios
+```
+
+### 4.9.Gets the node number of TuGraph corresponding to a node in OlapOnDB
+
+```c
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10.Description of active vertices
+
+Active vertices refer to the vertices that need to be processed in the batch function. In this example, we simply output the number of active vertices and summarize the number of active vertices:
+
+```c
+ParallelBitset temp = 000111; // The current active vertices are vertices 3, 4 and 5
+
+size_t delta = ForEachActiveVertex<double>(</double>
+//void c
+[&](size_t vi) {
+printf("active_vertexId = %lu\n",vi);
+return 1;
+},
+all_vertices
+);
+```
+
+The result of this function is obvious. Because of multiple threads, the output order may vary:
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+The local return value is 1. This function will add all the local return values in a thread-safe manner to the final return value, which is stored in the delta variable, and the final value is 3
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..bb3c784f13
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,213 @@
+# OlapOnDisk API
+
+> This document mainly introduces the usage instructions of OlapOnDisk API in detail
+
+## Table of contents
+
+- [1. Introduction](#1introduction)
+- [2. Algorithm Example](#2algorithm-example)
+     - [2.1 header files](#21head-file)
+     - [2.2 Configuration class MyConfig](#22configuration-class-myconfig)
+     - [2.3 Main function](#23main-function)
+     - [2.4 bfs algorithm flow](#24bfs-algorithm-process)
+- [3. Function description of other commonly used functions](#3description-of-other-commonly-used-functions)
+     - [3.1 Image Loading](#31graph-load)
+     - [3.2 Image writing](#32graph-write)
+     - [3.3 Graph Analysis Function](#33graph-parse-function)
+    
+### 1.Introduction
+
+The Standalone mode of TuGraph can be used to load graph data files, where the sources of graph data files can include text files, BINARY_FILE binary files, and ODPS sources. In this mode, TuGraph can quickly load multiple data sources into a graph, and then run iterative algorithms such as BFS, WCC, SSSP, etc. on the graph, and output the final result to the terminal.
+
+In TuGraph, the export and calculation process can be accelerated through parallel processing in memory, so as to achieve near real-time processing and analysis. Compared with traditional methods, it avoids the overhead of data export and storage, and can use compact Graph data structures achieve desirable performance for computation.
+
+TuGraph has built-in a large number of common graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement the specific graph calculation process by themselves. They only need to include the header file (.h) of the corresponding algorithm library when implementing their own stored procedures. To your own program, and link your own dynamic library files in the compilation phase.
+
+This document mainly introduces the common interfaces of Standalone, and the auxiliary functions used are mainly contained in the OlapOnDB class. At the same time, in order to help users understand and facilitate, the BFS algorithm is illustrated with examples.
+
+### 2.Algorithm example
+
+Here, the BFS algorithm is explained in blocks, which are roughly divided into the main function `main`, the BFS algorithm process `BFSCore` function and the configuration class MyConfig.
+
+#### 2.1.Head file
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //Header files to include when using TuGraph
+#include "./algo.h"   //A header file containing various algorithmic logic functions
+```
+
+When using TuGraph to realize the calculation application of graph data files, generally, the StandaloneGraph class object graph is first created, the graph file data is loaded into the graph, and then the graph calculation process is realized by calling the graph logic function, and finally the result of the graph calculation is printed out.
+
+#### 2.2.Configuration class MyConfig
+
+The MyConfig configuration class function is used to provide the configuration information required for the algorithm logic calculation, inherited from ConfigBase<EdgeData>, where EdgeDate can choose Empty (unweighted graph), int (the weight of the weighted graph is an integer) or double (the weight of the weighted graph is double) type.
+
+The MyConfig configuration class generally depends on the algorithm, and additional configuration information is required as follows:
+
+1. Parameters required by the algorithm
+2. Algorithm name
+3. Configure the Print function in the class
+Other common members inherit from ConfigBase, please refer to src/olap/olap_config.h for reference.
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // The parameters required by the algorithm are initialized
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // The configuration file accepts command line parameters. This use case will sequentially read the parameters when calling the algorithm from the command line. The value specified by the user is preferred. If the user does not specify it, the default parameter is selected.
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+#### 2.3.main function
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // Statistical memory consumption class MemUsage instantiation
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // Configuration class MyConfig instantiation
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk class instantiation
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // Statistical graph loading time consumption
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // Create an array to count whether a node has been traversed
+    auto parent = graph.AllocVertexArray<size_t>();
+    // Breadth-first search algorithm, returns the number of nodes connected to the root_vid root node in the graph
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // Print relevant information to the terminal
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+#### 2.4.bfs algorithm process
+
+The main process of `bfs` has two input parameters, the snapshot class (subgraph) and the number of iterations. The overall process can be divided into the following steps:
+
+1. Relevant definitions and initialization of data structures
+2. Use the batch function to perform cyclic calculations on each node, find all nodes adjacent to the current node in each round, and exchange them when the round ends.
+3. Until all nodes are found, return the number of nodes discovered_vertices.
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //Allocate an array, active_in is used to store the nodes found in the previous cycle stage
+  active_in.Add(root);            //Add the root node to the array
+  auto active_out = graph.AllocVertexSubset();  //Allocate the array active_out to store the nodes found in the current cycle stage
+  parent.Fill((size_t)-1);               //Assign a value of -1 to the node in the parent array, -1 means not found
+  parent[root] = root;
+  size_t num_activations = 1;       //Indicates the number of nodes found in the current loop phase
+  size_t discovered_vertices = 0;    //Indicates the total number of nodes found in the current cycle phase
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations indicates the number of nodes found in the current loop phase
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices indicates the total number of nodes found in the current cycle phase
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //Each cycle starts from the root node, finds adjacent adjacent nodes, changes its parent value, and operates num_activations+1
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //Store the nodes found in the current loop phase
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // return all nodes
+  return discovered_vertices;
+}
+```
+
+### 3.Description of other commonly used functions
+
+#### 3.1.Graph load
+
+TuGraph-StandaloneThe loading sources of graph data files are mainly divided into three categories: text files, binary files, and ODPS. The binary file is a file in which the binary representation of the edge data is arranged in order, which can save a lot of storage space. Its loading function is divided into three types, namely:
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：The loading method of the graph data file contains two parameters, and their meanings represent respectively
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `edge_direction_policy`：Specifies whether the graph is directed or undirected, including three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. Among them, DUAL_DIRECTION is the default graph loading method.
+  DUAL_DIRECTION : The input file is an asymmetric graph and the loaded graph is an asymmetric graph.
+  MAKE_SYMMETRIC : The input file is an asymmetric graph and the loaded graph is a symmetric graph.
+  INPUT_SYMMETRIC : The input file is a symmetric graph and the loaded graph is a symmetric graph.
+  For details, see `enum EdgeDirectionPolicy` in the olap_config.h file under the lgraph folder.
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：Load the vertices in the file into an array in the order of their ids. The meanings of each parameter are:
+  - `array`：array of data to be read
+  - `path`：The path to read the file, each line in the file represents a pair of vertex
+  - `parse_line`：A user-defined function that tells the system how to parse a line of text data into a vertex pair.
+
+
+#### 3.2.Graph write
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：Write the data in the array back to the file, and the meanings of each parameter are:
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `array`：array of data to be written
+  - `array_size`：The length of the number of data to be written
+  - `name`：algorithm name
+  - `filter_output`：Write data rule function, the data to be written needs to meet the requirements of this function.
+
+#### 3.3.graph parse function
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：Parse the graph data file, and load the graph as an unweighted graph.
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：Parse the graph data file, load the graph as a weighted graph, and specify the weight data type by modifying <EdgeData>.
+
+This function can be specified through the constructor parse_line when the MyConfig class is defined.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md
new file mode 100644
index 0000000000..6f1bfc6602
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md
@@ -0,0 +1,447 @@
+# Python Olap API
+
+> This document mainly introduces the API usage of OlapBase OlapOnDB and OlapOnDisk in Python
+
+## Table of contents
+- [1.Overview](#1-overview)
+- [2.Configuration Requirements](#2-configuration-requirements)
+- [3.Cython](#3-cython)
+- [4.Olap API](#4-olap-api)
+    - [4.1. Atomic operations](#atomic-operations)
+    - [4.2. Vertex collection class ParallelBitset](#vertex-collection-class-parallelbitset)
+    - [4.3. Vertex array class ParallelVector](#vertex-array-class-parallelvector)
+    - [4.4. Custom data structure](#custom-data-structure)
+    - [4.5.Graph class OlapBase](#graph-class-olapbase)
+    - [4.6. Graph Class OlapOnDB](#graph-class-olapondb)
+    - [4.7.Graph class OlapOnDisk](#graph-class-olapondisk)
+- [5.lgraph DB API](#5-lgraph_db-api)
+- [6.Algorithm plugin example](#6-algorithm-plug-in-example)
+
+## 1 Overview
+
+This manual will introduce the simple configuration required to use the Python interface of the TuGraph graph computing system, and explain the TuGraph Python API in conjunction with the code. For details about the functions of class ParallelBitset, OlapBase, etc., see olap-base-api.md, olap-on-db-api.md and olap-on-disk-api.md.
+
+## 2. Configuration requirements
+
+If you want to use TuGraph to write and compile your own applications, the required configuration requirements are:
+
+- Linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+- A compiler that supports C++17 requires GCC version 5.4.1 or later.
+- Cython, version 3.0a1 or above is required, and the tested version is 3.0.0a11
+
+## 3. Cython
+Cython is an efficient programming language that is a superset of Python. Cython can translate .py files into C/C++ codes and compile them into Python extension modules, which can be called through import in Python. In TuGraph, all Python plugins are compiled into Python extension modules by Cython and then used.
+
+The main advantage of using Cython is that it combines the simplicity and ease of use of Python with the performance of C/C++. The TuGraph Python interface is implemented using Cython.
+
+[Cython Documentation](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+The Olap API is used for graph computing and is implemented in C++. The usage and functions are basically the same as the C++ interface. To use the API in a Python file, the interfaces declared in plugins/cython/olap_base.pxd must be imported using `cython.cimports.olap_base import *`. The Python file can only be run after being compiled by Cython.
+
+### Atomic operations
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`: If the value pointed to by ptr is equal to oldv, assign the value pointed to by ptr to newv and return True, otherwise return False.
+- `write_min[T](a: cython.pointer(T), b: T)->cython.bint`: If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_max[T](a: cython.pointer(T), b: T)->cython.bint`: If b is greater than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_add[T](a: cython.pointer(T), b: T)->cython.bint`: Add the value of b to the value pointed to by a.
+- `write_sub[T](a: cython.pointer(T), b: T)->cython.bint`: Subtract the value pointed to by a from the value of b.
+
+### Vertex collection class ParallelBitset
+- `Size() -> size_t`: Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size: size_t)`: Initializes size and data, where the length of data is (size >> 6) + 1.
+- `Clear() -> cython.void`: Empties the collection.
+- `Fill() -> cython.void`: Adds all vertices to the set.
+- `Has(i: size_t) -> cython.bint`: Checks if vertex i is in the set.
+- `Add(i: size_t) -> cython.bint`: Adds vertex i to the set.
+- `Swap(other: ParallelBitset) -> cython.void`: Exchanges elements with another ParallelBitset set.
+
+### Vertex array class ParallelVector
+- `ParallelVector[T](size_t capacity)`: Constructs a ParallelVector, where capacity is the initial capacity of the vertex array.
+- `operator[](i: size_t) -> T`: Returns the data at index i.
+- `begin() -> cython.pointer(T)`: Returns the start pointer of ParallelVector.
+- `end() -> cython.pointer(T)`: Returns the end pointer of ParallelVector. The usage of begin() and end() is similar to the begin and end pointers of the vector container, and these two pointers can be used to sequentially access the array.
+- `Back() -> T`: Returns the last data of ParallelVector.
+- `Data() -> cython.pointer(T)`: Indicates the data of the array itself.
+- `Destroy() -> cython.void`: Clears the data in the ParallelVector array and deletes the array.
+- `Size() -> size_t`: Indicates the number of data in ParallelVector.
+- `Resize(size: size_t) -> cython.void`: Changes ParallelVector to size, which should be greater than or equal to the size before the change and less than capacity.
+- `Clear() -> cython.void`: Clears the data in ParallelVector.
+- `ReAlloc(capacity: size_t) -> cython.void`: Allocates a new capacity size to ParallelVector. If the array has data, it migrates the data to the new memory.
+- `Fill(elem: T) -> cython.void`: Assigns elem to all data of ParallelVector.
+- `Append(elem: T, atomic: cython.bint = true) -> cython.void`: Adds a data to the end of ParallelVector.
+- `Swap(other: ParallelVector[T]) -> cython.void`: Exchanges data with another ParallelVector.
+- `Copy() -> ParallelVector[T]`: Copies the current ParallelVector data and stores it in the copy array.
+
+
+### Custom Data Structure
+- `Empty`: A special data type whose content is empty.
+- `EdgeUnit[EdgeData]`: Indicates the edge whose weight type is EdgeData, used to parse the input file, including three member variables:
+    - `src: size_t`: starting vertex of the edge
+    - `dst: size_t`: end of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjUnit[EdgeData]`: indicates the edge whose weight type is EdgeData, which is used in the batch calculation process and contains two member variables:
+    - `neighbor: size_t`: neighbor vertex of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjList[EdgeData]`: The adjacency list of vertices whose weight type is EdgeData, often used to represent the set of incoming and outgoing edges of vertices, including three member functions:
+    - `begin()->cython.pointer(AdjUnit[T])`: the starting pointer of the list
+    - `end()->cython.pointer(AdjUnit[T])`: the end pointer of the list
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: the data whose subscript is i
+
+### Graph class OlapBase
+- `NumVertices()->size_t`: get the number of vertices
+- `NumEdges()-> size_t`: get the number of edges
+- `OutDegree(vid: size_t)-> size_t`: out-degree of vertex vid
+- `InDegree(vid: size_t)->size_t`: in-degree of the vertex vid
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`: Allocates an array of type VertexData with size as the number of vertices
+- `AllocVertexSubset()-> ParallelBitset`: Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all outgoing edges of vertex v
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all incoming edges of vertex v
+- `Transpose()->cython.void`: transpose of a directed graph
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+    - `edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+    - `input_vertices`: specifies the number of vertices read into the graph by the array.
+
+    - `input_edges` : specifies the number of edges that the array reads into the image.
+
+    - `edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`: locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`: unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+
+TuGraph provides two batch operations to perform point-centric batch processing in parallel, which is slightly different from C++ in Python.
+
+```python
+# Function name: ProcessVertexInRange[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# lower: size_t, upper: size_t,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Executes the work function on nodes whose node numbers are between lower and upper in the Graph. The fourth parameter indicates the base of accumulation, which is 0 by default.
+# The fifth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in include/lgraph/olap_base.h
+#
+# Example usage: Count the number of vertices with edges in the parent array.
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython.pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+g is the instantiated object of graph class OlapBase
+
+```python
+# Function name: ProcessVertexActive[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# active: ParallelBitset,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Execute the work function on the nodes corresponding to 1 in the active_vertices bitset. The third parameter indicates the base of accumulation, which is 0 by default;
+# The fourth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in /include/lgraph/olap_base.h
+#
+# Usage example: Output all out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes.
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self. graph. OutDegree(vi)
+        dst: size_t
+        edges = self. graph. OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbor
+            printf("node %lu has neighbor %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+As shown in the above two examples, ProcessVertexActive and ProcessVertexInRange in Python require an additional algorithm class pointer parameter compared to their C++ counterparts. The Work function is generally used as a member function of the algorithm class to access member variables, such as in the graph and ParallelVector parent examples shown above. When calling the batch function, the Work function and the self pointer of the algorithm class are passed to the batch function.
+
+The Work function will be called in multiple threads, so the @cython.nogil decorator is added to release the Python global interpretation lock. In code executed by multiple threads, such as the Work function in the batch function, variables are better declared as C/C++ types using `dst: type` or `dst = cython.declare(type)`. This is because Python objects cannot be used in multi-threaded code.
+
+### Graph class OlapOnDB:
+Parallelize to create a directed graph:
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+Parallelize to create an undirected graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING creates a directed graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### Graph class OlapOnDisk
+
+#### ConfigBase:
+- `ConfigBase()`: Constructor
+- `std::string input_dir`: graph edge table data path
+- `std::string output_dir`: output path
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: read in graph data
+
+## 5. lgraph_db API
+Please refer to the files plugins/cython/lgraph_db.pxd and lgraph_db_python.py for the lgraph_db API.
+
+The usage and functions of the interface in lgraph_db.pxd are basically the same as the C++ interface. The interface declared in lgraph_db.pxd is implemented in C++. In the py file, it must be imported by `cython.cimports.olap_db import *` and compiled by the Cython file to run.
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: Get the vid of the vertex
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: constructor, dir_path is the db path
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: set user
+- `SetUser(user: std::string)-> cython.void`: set user
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: create GraphDB
+
+### GraphDB:
+- `CreateReadTxn()-> Transaction`: create a read-only transaction
+- `CreateWriteTxn()-> Transaction`: create a write transaction
+- `ForkTxn(txn: Transaction)-> Transaction`: Copy transactions, only read transactions can be copied
+
+### Transaction:
+```
+GetVertexIndexIterator(
+                 label: std::string,
+                 field: std::string,
+                 key_start: std::string,
+                 key_end: std::string) -> VertexIndexIterator
+```
+Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v
+
+
+
+lgraph_db_python.py packages the C++ classes Galaxy and GraphDB from lgraph_db.pxd as Python classes. After compiling lgraph_db_python.py into a Python extension, you can directly access it in a Python file or from the Python command line by importing it with `import lgraph_db_python`.
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: constructor, dir_path is the db path
+- `SetCurrentUser(self, user: str password: str)-> void`: set user
+- `SetUser(self, user: std::string)-> void`: set user
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: create PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)->cython.Py_ssize_t`: address of C++ class GraphDB
+
+## 6. Algorithm plug-in example
+The following is a code example of the BFS algorithm implemented in Python:
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# Comments work as follows:
+# language_level=3: use Python3
+# cpp_locals=True: C++17 is required, and std::optional is used to manage C++ objects in Python code, which can avoid copy construction of C++ objects
+# boundscheck=False: Turn off bounds checking for indexes
+# wraparound=False: Turn off the processing of negative subscripts (similar to Python List)
+# initializedcheck=False: Turn off checking whether the memory is initialized, and the running performance will be faster after turning off the check
+# language = c++: translate this .py file to C++ instead of C file. TuGraph uses a lot of template functions, so C++ should be used
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# From plugins/cython/ cimportolap_base.pxd and lgraph_db.pxd, similar to #include "xxx.h" in C++
+
+from cython.cimports.libc.stdio import printf
+# Similar to #include <stdio.h> in C++
+# Other common ones include cython.cimports.libcpp.unordered_map, etc.
+
+import time
+import lgraph_db_python
+
+@cython.cclass
+# cython.cclass indicates that BFSCore is a C-type Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty]) indicates the pointer of OlapBase[Empty], similar to OlapBase[Empty]* in C++
+    # Cython provides common types of pointers, such as cython.p_int, cython.p_char, etc.
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t declares root as a C++ size_t type variable, equivalent to root = cython.declare(size_t)
+    # Variables that do not declare a type are Python object types
+    # Declaring variable types will greatly improve performance, and in the multi-threaded part, only C/C++ type variables can be accessed
+
+    @cython.cfunc
+    # cython.cfunc indicates that Work is a C-type function, and the parameters and return values should be declared
+    # cfunc has good performance and can accept C/C++ objects as parameters and return values, but it cannot be called in other python files
+    # Similar to cython.ccall, such as Standalone function, which can be called in other python files
+    @cython.nogil
+    # cython.nogil means to release the Python global interpretation lock. In the part modified by nogil, Python objects cannot be accessed
+    # In the multi-threaded part, there should be nogil decorator
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) means that exception propagation is disabled, and Python exceptions raised inside the function will be ignored
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbor
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 means that dst has not been visited by bfs
+                if self.active_out.Add(dst):
+                    # Set dst as an active node; ParallelBitmap.Add is an atomic operation to prevent double calculation
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython. size_t:
+        self. graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self. parent. Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self. active_in. Add(self. root)
+        while num_activations > 0:
+            self. active_out. Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self. active_out. Swap(self. active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time. time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # Create OlapOnDB in parallel
+    # Cython does not support dereference operations such as *db, use db[0] to dereference
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # Get the iterator of the root node through GetVertexIndexIterator based on the root node label name, field name and field value (root_id),
+    # and get the vid through the iterator. When there is no ID_MAPPING, the vid is the same as the id in OlapOnDB
+    cost = time. time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time. time()
+    count = a. run(cython. address(olapondb), root_vid)
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb. NumVertices()
+    response["num_edges"] = olapondb. NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone is the plug-in entry in Standalone mode, modified with cython.ccall
+    # You can set parameters arbitrarily, and modify plugins/cython/standalone_main.py accordingly
+    cost = time. time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config is a C++ class, config.input_dir is std::string, Python str needs to be encoded to be passed to std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # read in graph
+    cost = time. time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time. time()
+    a = BFSCore()
+    count = a. run(cython. address(graph), root)
+    # cython.address(graph), address, similar to &graph in C++
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices". format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process is the plug-in entry in embed mode and procedure mode, modified with cython.ccall
+    # The Process function must be named Process, and the parameters are lgraph_db_python.PyGraphDB and bytes
+    # The return value must be (bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # Get the address of the GraphDB object in the PyGraphDB, convert it to a pointer and pass it
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..f86dc4107c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
@@ -0,0 +1,191 @@
+# TuGraph Built-in Algorithm Description
+
+> This document mainly introduces the TuGraph built-in algorithm program in detail, the community version of 6 algorithms can refer to the basic algorithm newspaper
+
+## 1.Introduction
+
+TuGraph currently contains the following 6 basic algorithms and 28 extended algorithms, a total of 34 graph algorithms:
+
+### 1.1.Basic algorithms:
+
+|    Algorithm name            | The program name |
+| :--------------------------: | :--------------: |
+|     Breadth-First Search     |       bfs        |
+|           Pagerank           |     pagerank     |
+| Single-Source Shortest Path  |       sssp       |
+| Weakly Connected Components  |       wcc        |
+| Local Clustering Coefficient |       lcc        |
+| Label Propagation Algorithm  |       lpa        |
+
+### 1.2.Extended algorithms:
+
+|            Algorithm name                    |   The program name   |
+| :------------------------------------------: | :------------------: |
+|            All-Pair Shortest Path            |         apsp         |
+|            Betweenness Centrality            |          bc          |
+|              Belief Propagation              |          bp          |
+|             Closeness Centrality             |          cc          |
+|             Common Neighborhood              |          cn          |
+|              Degree Correlation              |          dc          |
+|             Dimension Estimation             |          de          |
+|                    EgoNet                    |          en          |
+|        Hyperlink-Induced Topic Search        |         hits         |
+|                Jaccard Index                 |          ji          |
+|                    K-core                    |        kcore         |
+|                   Louvain                    |       louvain        |
+|        Multiple-source Shortest Paths        |         mssp         |
+|            Personalized PageRank             |         ppr          |
+|        Strongly Connected Components         |         scc          |
+| Speaker-listener Label Propagation Algorithm |         slpa         |
+|          Single-Pair Shortest Path           |         spsp         |
+|              Triangle Counting               |       triangle       |
+|                  Trustrank                   |      trustrank       |
+|     Weighted Label Propagation Algorithm     |         wlpa         |
+|         Weighted Pagerank Algorithm          |      wpagerank       |
+|           Maximal independent set            |         mis          |
+|                  Sybil Rank                  |      sybilrank       |
+|             Subgraph Isomorphism             | subgraph_isomorphism |
+|                    Motif                     |        motif         |
+|                   Kcliques                   |       kcliques       |
+|                    Ktruss                    |        ktruss        |
+|                    Leiden                    |        leiden        |
+
+## 2.Basic algorithms
+
+### 2.1.Breadth-First Search
+
+Breadth first Search implements the Breadth-first Search algorithm, which starts from the root vertex and traverses all accessible vertices along the width of the graph. Returns the number of vertices traversed. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 2.2.Pagerank
+
+Web page sorting program to achieve the commonly used Pagerank algorithm. The algorithm calculates the importance ranking of all vertices according to the edge and edge weight in the graph. The higher the PageRank value, the higher the importance of the vertex in the graph. The reciprocal of the number of vertices is used as the initial Rank value of each vertex, and then the Rank value of the vertices is transferred to the adjacent vertices on average according to the outgoing edges, and the transfer process is repeated until the given convergence threshold is met or the given number of iterations is reached. At the end of each pass round, a certain proportion of the Rank values of all vertices will be randomly transferred to any vertex. Please refer to the algorithm content [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 2.3.Single-Source Shortest Path
+
+The Single Source Shortest Path algorithm realizes the Single Source Shortest Path algorithm. It calculates the shortest path length from a given source vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 2.4.Weakly Connected Components
+
+The program of Weakly Connected Components has implemented the algorithm. It can calculate all the weakly connected components in the graph. A weakly connected component is a subgraph of a graph in which reachable paths exist between any two points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Connected*component*(graph_theory)](<https://en.wikipedia.org/wiki/Connected_component_(graph_theory)> "scc wiki")。
+
+### 2.5.Local Clustering Coefficient
+
+The average Clustering Coefficient program implements the Local Clustering Coefficient algorithm to calculate the coefficient of the degree of clustering between vertices in the graph. The returned results include the overall clustering coefficient and the vertex clustering coefficient. The overall agglomeration coefficient reflects the evaluation of the overall agglomeration degree in the graph, and the vertex agglomeration coefficient includes the agglomeration coefficient of any vertex, which reflects the agglomeration degree near the vertex. The higher the agglomeration coefficient, the higher the agglomeration degree. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 2.6.Label Propagation Algorithm
+
+The program implements Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and computes unauthorised graphs. In label passing, each vertex adds up all the labels received, and randomly selects one of the labels with the highest sum. The iteration converges or the algorithm terminates after a given number of rounds. The final output is a label for each vertex, and vertices with the same label value are considered to be in the same community. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+## 3.Extended algorithms
+
+### 3.1.All-Pair Shortest Path
+
+The All-Pair Shortest Path program realizes the all-pair Shortest Path algorithm and calculates the shortest path between any two points in the graph. Returns the shortest path length between any pair of vertices where the path exists. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 3.2.Betweenness Centrality
+
+Betweenness Centrality algorithm is implemented in Betweenness centrality program to estimate the betweenness centrality value of all vertices in a graph. The value of intermediate centrality reflects the possibility that any shortest path in the graph passes through the vertex, and the higher the value, the more shortest paths pass through the vertex. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 3.3.Belief Propagation
+
+The Belief Propagation algorithm is implemented in the confidence propagation program. Given the edge distribution of the observed vertices, the algorithm estimates the edge distribution of the unobserved vertices by using the mechanism of passing messages among vertices. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 3.4.Closeness Centrality
+
+The Distance Centrality program implements an algorithm to estimate the average length of an arbitrary vertex to Closeness the shortest path to another vertex in the graph. The smaller the distance from the center, the smallest the average shortest distance from the vertex to other vertices, which means that the vertex is more centrally located in the graph from the geometric point of view. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "cc wiki")。
+
+### 3.5.Common Neighborhood
+
+The Common Neighborhood program implements the common Neighborhood algorithm to count the number of common neighbors between any given pair of neighboring vertices. Given several pairs of vertices to be queried, the result is the number of common neighbors of any pair of vertices to be queried.
+
+### 3.6.Degree Correlation
+
+The Degree Correlation algorithm is implemented in the degree correlation program. It calculates the degree correlation degree of a graph by calculating the Pearson correlation coefficient between any adjacent vertex pairs, which can be used to characterize the correlation degree between high-degree vertices in the graph. A higher degree of correlation indicates a higher degree of correlation between vertices of higher degree in the graph. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 3.7.Dimension Estimation
+
+The diameter Estimation program implements the Dimension Estimation algorithm. The algorithm calculates the length of the longest shortest path in the graph, which is used to characterize the diameter of the graph. Please refer to the algorithm content[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### 3.8.EgoNet
+
+The EgoNet algorithm requires a given root vertex and K value, and takes the root vertex as the source vertex to conduct a width-first search to find the subgraph composed of all neighbors within K degrees. The found subgraph is called the EgoNet of the root vertex.
+
+### 3.9.Hyperlink-Induced Topic Search
+
+The Hyperlink Topic Search algorithm implements the Hyperlink-induced topic search algorithm, which assumes that each vertex has two attributes: Authority and Hub. A good hub vertex should point to many vertices with high authority. And a good authority vertex should be pointed to by many vertices of high pivot type. The algorithm returns the authority value and the hub value for each vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 3.10.Jaccard Index
+
+The Jaccard coefficient program implements the Jaccard Index algorithm. The algorithm calculates the Jaccard coefficient between a given pair of vertices, which can be used to represent the similarity of the two vertices. A higher Jaccard coefficient indicates a higher degree of similarity between pairs of vertices. Given several pairs of vertices with the query, the Jaccard coefficients of these pairs are returned. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### 3.11.K-core
+
+k accounting method implements k-core algorithm. The algorithm computes the number of kernels of all vertices, or finds all K-nucleon graphs in the graph. K-nucleon graph is a special subgraph in which the degree of any vertex is not less than a given K value. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Degeneracy\_(graph_theory)](<https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)> "kcore wiki")。
+
+### 3.12.Louvain
+
+The Louvain community discovery program implements the Fast-unfolding algorithm. The algorithm is a community discovery algorithm based on modularity. It maximizes the modularity of the graph by constantly merging vertex communities, and can discover the hierarchical community structure. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 3.13.Multiple-source Shortest Paths
+
+The multisource Shortest Paths program implements the multiple-source Shortest Paths algorithm to calculate the shortest path value to any vertex from the given Multiple source vertices. Where, the shortest path value of multiple source vertices to a vertex is the minimum value of the shortest path from each source vertex to the vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 3.14.Personalized PageRank
+
+Personalized web ranking program has Personalized PageRank algorithm. According to the given source vertex, the algorithm calculates the importance ranking of all vertices to the source vertex based on the source vertex. The higher the Rank value, the more important the vertex is to the source vertex. Unlike PageRank, the source vertex Rank value is 1, the rest of the vertex Rank value is 0; And a certain proportion of Rank value will be immediately transferred back to the source vertex after each round of transmission. Please refer to the algorithm content [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 3.15.Strongly Connected Components
+
+Strongly Connected component program realizes the Strongly Connected Components algorithm. The algorithm computes all strongly connected components of the graph, which is a subgraph of the graph that can start from any vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 3.16.Speaker-listener Label Propagation Algorithm
+
+The program realizes the Speaker-listener Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and historical tag record, which is an extension of tag propagation algorithm. Different from the label propagation algorithm, this algorithm records the historical labels of all vertices. When the labels are accumulated in the iteration, the historical labels are also counted. The final output is all the historical label records for each vertex. Please refer to the paper for the algorithm content:“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 3.17.Single-Pair Shortest Path
+
+The program of the shortest path between two points implements the Bidirectional point-first Search algorithm. It searches forward width First along the outgoing edge from the starting point and reverse width first along the incoming edge from the end point on the directed undirected graph. The shortest path length from the starting point to the ending point is determined by traversing the vertices of the starting point and the ending point together. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 3.18.Triangle Counting
+
+The Triangle-counting algorithm is implemented to calculate the number of triangles in an undirected graph, which can be used to characterize the correlation degree of the vertices in the graph. The higher the number of triangles, the higher the degree of correlation of the vertices in the graph. For the algorithm content, please refer to the paper, "Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study".
+
+### 3.19.Trustrank
+
+The Trust Index Sorting Algorithm implements the Trustrank algorithm, which can calculate the Trust Index of any vertex based on a given whitelist. The higher the trust score, the less likely the vertex is to be illegal. Please refer to the algorithm content for details. [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 3.20.Weighted Label Propagation Algorithm
+
+Weighted Label Propagation Algorithm is implemented in the program. = Different from the label propagation algorithm, the label transmission is related to the weight of the edge. During label transmission, the weight of each vertex will be accumulated according to the incoming edge of the label, and the label with the highest sum will be randomly selected. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 3.21.Weighted Pagerank Algorithm
+
+Weighted Pagerank is implemented in the weighted Pagerank algorithm. Different from PageRank algorithm, the transfer of Rank value is related to the weight of the edge. The Rank value of the vertex will be transferred to the adjacent vertices according to the weight of the edge. Please refer to the algorithm content[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 3.22.Maximal independent set
+
+Maximal independent set algorithm implements Maximal Independent Set algorithm. A maximum independent set means that there are no vertices outside the independent set that can join it. A graph may have many MIS that vary greatly in size, and the algorithm finds one of them. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### 3.23.Sybil Rank
+
+Sybil detection algorithm implements Sybil Rank algorithm. The SybilRank algorithm starts from non-Sybil nodes and performs a random walk with premature termination. Please refer to the paper for the algorithm content:“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 3.24.Subgraph Isomorphism
+
+The subgraph matching algorithm implements the subgraph_isomorphism algorithm. The subgraph_isomorphism algorithm matches all nodes in the whole graph and outputs the number of times each node is matched. Algorithm Content Reference [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 3.25.Motif
+
+Pattern matching algorithm implements motif algorithm. motif algorithm matches k-order subgraphs for the specified nodes, and finally outputs the number of each kind of K-order subgraphs for each specified node. Each K-order subgraph is represented by a 64-bit integer, and the $i \times k + j$bit is 1, indicating that there is an edge i->j in the subgraph. Algorithm Content Reference [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### 3.26.Kcliques
+
+The K-order clique counting algorithm implements the k-cliques algorithm. The k-cliques algorithm calculates the number of all K-order complete subgraphs in the graph, and finally outputs the number of k-order complete subgraphs of each node. Algorithm Content Reference [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### 3.27.Ktruss
+
+The k-order truss counting algorithm implements the k-truss algorithm. A k-truss is a subgraph in which each edge is the edge of at least k-2 triangles. The k-truss algorithm finds out the k-truss subgraph of the graph, and finally outputs the neighbor node list of each node in the subgraph. Algorithm Content Reference[https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+
+### 3.28.Leiden
+
+Leiden algorithm implements Leiden's algorithm. leiden algorithm is a community discovery algorithm based on modularity. Compared with louvain algorithm, leiden algorithm has the advantage that Leiden algorithm detects the broken links in the community to ensure that each community has good connectivity. Algorithm Content Reference [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/index.rst
new file mode 100644
index 0000000000..dc955b3b91
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/2.olap/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
new file mode 100644
index 0000000000..47c814d627
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
@@ -0,0 +1,337 @@
+# TuGraph Stored Procedure Guide
+
+> This document mainly explains the instructions for using the TuGraph stored procedure.
+
+## 1. Introduction
+
+When the query/update logic that users need to express is more complex (such as cannot be described by Cypher or has high performance requirements), compared to calling multiple requests and completing the entire processing flow on the client, the stored procedure provided by TuGraph is a more concise and efficient choice.
+
+Similar to traditional databases, the TuGraph stored procedure runs on the server side. Users can encapsulate the processing logic (i.e., multiple operations) into a procedure call, and further improve performance by parallel processing (such as using relevant C++ OLAP interfaces and built-in algorithms) during implementation.
+
+There is a special type of API in the stored procedure for parallel data operations, which we call the Traversal API. Please refer to the [documentation](2.traversal.md) for more information.
+
+## 2. Stored Procedure Version
+
+Currently, TuGraph supports two versions of stored procedures, which are suitable for different scenarios. Version 3.5 only supports v1, which can be directly called through the REST or RPC interface. Starting from version 3.5, v2 is supported, which allows embedding calls in graph query languages ​​(such as Cypher). We call it POG (Procedure On Graph query language, APOC).
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+|Applicable Scenarios	|Extreme performance or complex multi-transaction management scenarios	|General scenarios, highly integrated with Cypher|
+|Transaction	|Created internally in the function, multiple transactions |can be freely controlled	Passed into the external function, single transaction|
+|Signature (parameter definition)	|Not required	|Required|
+|Input and output parameter types	|Not required to specify	|Need to specify parameter types|
+|Cypher Standalone Call	|Supported	|Supported
+|Cypher Embeded Call	|Not supported	|Supported|
+|Language	|C++/Python/Rust	|C++|
+|Calling mode	|Directly pass the string, usually in JSON format	|Through variables in Cypher statements|
+
+
+In TuGraph, stored procedures v1 and v2 are managed separately, and support for create, delete, and query operations is provided. However, it is still not recommended to have the same name for multiple stored procedures.
+
+## 3. Supported Languages
+
+In TuGraph, users can dynamically load, update, and delete stored procedures. TuGraph supports the use of C++, Python, and Rust languages to write stored procedures. Among them, C++ language has the most complete support and the best performance.
+
+Note that the stored procedure is the logic compiled and executed on the server side, which is independent of the language support on the client side.
+
+## 4. Procedure v1 Interface
+
+## 4.1.Write stored procedures
+### 4.1.1.Write C++ stored procedure
+
+Users can write C stored procedures by using core API or Traversal API. An example of a simple C stored procedure is as follows:
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## Count all students whose age is 10
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+From the code, we can see the entry of a TuGraph C++ stored procedure is the `Process` function, with three parameters:
+
+- `db`: the TuGraph database instance
+- `request`: the input data, which can be a binary byte array, or any other format such as JSON string.
+- `response`: the output data, which can be a string or directly return binary data.
+
+The return value of the `Process` function is a boolean value. When it returns `true`, it means that the request is successfully completed, otherwise it means that the stored procedure found an error during execution, and the user can return an error message through `response` to facilitate debugging.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which is `age_10` in the above example. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, age_10.so will be generated, which can then be loaded into the server by the user.
+
+### 4.1.2 Writing Python stored procedures
+
+The following snippet does the same thing as the above C++ stored procedure, but via TuGraph Python API:
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+The Python stored procedure returns a tuple, the first element of which is a Boolean value indicating whether the stored procedure was successfully executed; the second element is a `str`, which contains the result to be returned.
+
+Python stored procedures do not need to be compiled and can be loaded directly.
+
+## 4.2.How to use stored procedures
+
+### 4.2.1.Install Stored Procedures
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `age_10.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+                  headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `age_10.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+### 4.2.2.List Stored Procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.Retrieve Stored Procedures Detail
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.Uninstall Stored Procedures
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+### 4.2.6.Upgrade Stored Procedures
+
+You can upgrade a stored procedure with the following two steps:
+
+1. Uninstall the existing one.
+2. Install the new on.
+
+TuGraph carefully manages the concurrency of stored procedure operations. Upgrading stored procedures will not affect concurrent runs of existing ones.
+
+## 5. Procedure v2 Interface
+
+### 5.1.Writing stored procedures
+
+Users can write C++ stored procedures by using lgraph API. A simple C++ stored procedure example is as follows:
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   std::string &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response = std::string("error parsing json: ") + e.what();
+        return false;
+    }
+
+    Result result({{"node", LGraphType::NODE},
+                   {"salt", LGraphType::FLOAT},
+                   });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = result.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    response = result.Dump();
+    return true;
+}
+```
+
+From the code we can see:
+- The stored procedure defines a method `GetSignature` to get the signature. This method returns the signature of the stored procedure, which includes input parameter names and their types, and return parameters and their types. This enables the Cypher query statement to use the signature information to verify whether the input data and the returned data are reasonable when calling the stored procedure.
+- The entry function is the `ProcessInTxn` function, which has three parameters, which are:
+
+- `txn`: The transaction of the stored procedure, generally speaking, the transaction of the Cypher statement that calls the stored procedure.
+- `request`: input data, its content is the string of the input parameter type defined in `GetSignature` and the value passed in the Cypher query statement after json serialization. e.g. `{num_iteration: 10}`
+- `response`: output data, in order to ensure compatibility in the Cypher language, users can write the data processed by the stored procedure to `lgraph_api::Result`, and finally use `lgraph_api::Result::Dump` to serialize it into data in json format.
+
+The return value of the `ProcessInTxn` function is a boolean value. When it returns `true`, it means that the request was successfully completed, otherwise it means that the stored procedure found an error during execution.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which in the above example is `custom_pagerank`. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, custom_pagerank.so will be generated, which can then be loaded into the server by the user.
+
+### 5.2.Load stored procedure
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `custom_pagerank.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `custom_pagerank.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+#### 5.2.1.List loaded stored procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.Get stored procedure details
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.Delete stored procedure
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+#### 5.2.5.Update stored procedure
+
+Updating a stored procedure requires the following two steps:
+
+1. Delete the existing stored procedure
+2. Install the new stored procedure
+
+TuGraph carefully manages the concurrency of stored procedure operations, and updating stored procedures will not affect the operation of existing stored procedures.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
new file mode 100644
index 0000000000..e4abd3a263
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
@@ -0,0 +1,125 @@
+# Traversal API
+
+> This document mainly explains the Traversal API in the stored procedure of TuGraph.
+
+1. Introduction
+The powerful online analytical processing (OLAP) capability of TuGraph is an important feature that sets it apart from other graph databases. With the help of the C++ OLAP API (olap_on_db.h), users can quickly export a subgraph that needs to be analyzed, and then run iterative graph computing processes such as PageRank, connected components, and community detection on it, and then make corresponding decisions based on the results. The export and computation processes can be accelerated through parallel processing, achieving almost real-time analysis and processing, and avoiding the lengthy steps of traditional solutions that require exporting, transforming, and reimporting (ETL) data into dedicated analytical systems for offline processing.
+
+TuGraph has built-in many commonly used graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement specific graph computing processes themselves. They just need to include the header files (.h files) of the corresponding algorithm library in their own programs when implementing their own storage procedures, and link the corresponding dynamic library files (.so) during compilation. In general, the only process that users need to implement themselves is the extraction of the subgraph to be analyzed.
+
+Currently, the Traversal API only supports C++.
+
+## 2. Interface
+
+### 2.1. Snapshot
+
+The Snapshot template class in C++ OLAP API is used to represent extracted static subgraphs. The EdgeData is used to represent the data type of the weight used for each edge in the subgraph. If the edges do not require weights, Empty is used as the EdgeData.
+
+The extracted subgraph can be described using the constructor of the Snapshot class.
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+In the above text, "db" represents the database handle, "txn" represents the transaction handle, and "flags" represents the options used during generation, with the optional values including the following combinations: SNAPSHOT_PARALLEL indicates that multiple threads are used for parallel extraction during export; SNAPSHOT_UNDIRECTED indicates that the exported graph needs to be transformed into an undirected graph.
+
+"vertex_filter" is a user-defined filtering function for vertices, where a return value of true indicates that the vertex needs to be included in the extracted subgraph, and vice versa.
+
+"out_edge_filter" is a user-defined filtering function for edges, where a return value of true indicates that the edge needs to be included in the extracted subgraph, and vice versa.
+
+When the filtering functions are set to default values, it means that all vertices/edges should be included.
+
+For other methods provided by the Snapshot class, please refer to the detailed C++ API documentation (olap_on_db.h).
+
+### 2.2. Traversal
+
+A common type of analysis in graph databases is to start from one or more vertices and iteratively expand and access their neighbors. Although this type of analysis can be done using Cypher, its performance is limited by the serial interpretation and execution when the depth of traversal is large. Writing stored procedures using the C++ Core API eliminates the overhead of interpretation but is still limited by the processing power of a single thread.
+
+In order to enable users to accelerate these types of analysis tasks through parallel processing, we have wrapped a Traversal framework based on the C++ OLAP API. Users can directly use the FrontierTraversal and PathTraversal classes in this framework to perform iterative traversal analysis tasks. For specific usage instructions, please refer to the corresponding C++ API documentation (lgraph_traversal.h).
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+This method can be used to find all vertices that satisfy a certain condition (when the filter returns true). When the "parallel" parameter is set to true, the search process will be executed in parallel.
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+This method can be used to extract (VertexData type) properties from a specified set of vertices (frontier) using the extract method. When the "parallel" parameter is set to true, the extraction process will be executed in parallel.
+
+FrontierTraversal is suitable for cases where only the traversed set of vertices is of interest. When a user needs to access information along the path (vertices/edges along the path) in the traversal process or result, PathTraversal needs to be used. Both types of traversal have four parameters in their constructor, namely the database handle db, transaction handle txn, options flags and capacity. The available options include the following combinations: TRAVERSAL_PARALLEL indicates that multiple threads are used for parallel traversal; TRAVERSAL_ALLOW_REVISITS indicates that vertices can be visited repeatedly during traversal (PathTraversal implicitly includes this option).
+capacity indicates the capacity of the path collection during initialization.
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+Both types of traversal have three ways to set the starting vertex/vertex set for traversal. The first two methods directly specify the vertex ID, while the last method is similar to FindVertices.
+
+Both types of traversal start from the set of vertices in the current layer. They use the extension function to access each outgoing edge/incoming edge/outgoing and incoming edges, and use a user-defined filter function to determine if the extension is successful. If successful, the neighboring vertex/appended path with the edge is added to the set of vertices/paths in the next layer.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+The above describes the three traversal methods of FrontierTraversal. It starts from the current set of vertices and, for each vertex in the set, iterates through each outgoing edge/incoming edge/outgoing and incoming edges. If the edge or neighbor vertex satisfies the user-defined filter conditions (where edge_filter is the filter function for edges and neighbour_filter is the filter function for neighbor vertices), the neighbor vertex is added to the new set of vertices.
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+After the expansion of the current set of vertices is finished, the new set of vertices can be obtained using the above method.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+The three traversal methods of PathTraversal are similar to FrontierTraversal, except that the user-defined filter function adds two additional parameters: Path, which contains the path before the new edge is expanded, and IteratorHelper, which can be used to convert the vertices/edges in the path to corresponding iterators in the database. The relevant documentation can be found in the corresponding C++ API documentation.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
new file mode 100644
index 0000000000..abc5ce2ccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
@@ -0,0 +1,5 @@
+base64_encode
+===================================
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
new file mode 100644
index 0000000000..b321c843d6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
@@ -0,0 +1,5 @@
+lgraph_result
+===================================
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
new file mode 100644
index 0000000000..0f53077dbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
@@ -0,0 +1,5 @@
+lgraph_rpc_client
+===================================
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
new file mode 100644
index 0000000000..d7a9d7b97c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
@@ -0,0 +1,5 @@
+lgraph_traversal
+===================================
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
new file mode 100644
index 0000000000..4b0be46a21
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
@@ -0,0 +1,5 @@
+lgraph_txn
+===================================
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
new file mode 100644
index 0000000000..4047340ef0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
@@ -0,0 +1,5 @@
+lgraph_types
+===================================
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
new file mode 100644
index 0000000000..12814e7618
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
@@ -0,0 +1,5 @@
+lgraph_utils
+===================================
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
new file mode 100644
index 0000000000..572f9ae7c0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
new file mode 100644
index 0000000000..5bfa8a1dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
new file mode 100644
index 0000000000..8680a93ee9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
@@ -0,0 +1,5 @@
+olap_base
+===================================
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
new file mode 100644
index 0000000000..9ce3afba80
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
@@ -0,0 +1,5 @@
+olap_on_db
+===================================
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
new file mode 100644
index 0000000000..5bed2e061c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
@@ -0,0 +1,5 @@
+lgraph
+===================================
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
new file mode 100644
index 0000000000..82bf0941c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
@@ -0,0 +1,5 @@
+olap_profile
+===================================
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
new file mode 100644
index 0000000000..8723e9f1d0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
@@ -0,0 +1,5 @@
+lgraph_atomic
+===================================
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
new file mode 100644
index 0000000000..ec8af7bb8f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
@@ -0,0 +1,5 @@
+lgraph_date_time
+===================================
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
new file mode 100644
index 0000000000..07d6076327
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
@@ -0,0 +1,5 @@
+lgraph_db
+===================================
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
new file mode 100644
index 0000000000..07f4be3f67
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
new file mode 100644
index 0000000000..5be9e6547e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
new file mode 100644
index 0000000000..70a0bd4cbf
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
@@ -0,0 +1,5 @@
+lgraph_exceptions
+===================================
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
new file mode 100644
index 0000000000..a4f9af0582
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
@@ -0,0 +1,5 @@
+lgraph_galaxy
+===================================
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
new file mode 100644
index 0000000000..1c343152d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
@@ -0,0 +1,8 @@
+C++ stored procedure API
+===================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..8927c17846
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
@@ -0,0 +1,29 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python stored procedure API
+====================================
+Version: 3.6.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..7e12ce4db1
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
@@ -0,0 +1,17 @@
+# Rust Stored Procedures
+
+## 1. Introduction
+Rust stored procedures currently only support v1 version. TuGraph supports plugins in any language that can be compiled into a dynamic library. Rust, as a rising star in system programming languages, has significant advantages in terms of safety, reliability, and ergonomics compared to C++.
+
+We provide the Rust binding library for TuGraph to support calling lgrahp API in Rust. We also provide the [tugraph-plugin-util](https://crates.io/crates/tugraph-plugin-util ) utility library to help simplify the process of writing Rust plugins.
+
+## 2. How to Use
+
+Using Rust stored procedures involves three steps:
+* Compilation: Compile the Rust source code into a dynamic library (so file). We have prepared a comprehensive plugin development tutorial that covers everything from IDE plugin installation and environment setup to compilation. Please refer to the `rust-tugraph-plugin-tutorial` for detailed instructions.
+* Loading: Load the dynamic library (so file) into the server. This can be done through the REST or RPC interface, similar to the usage of C++ libraries. Please refer to the documentation for more details on the [Procedure v1 API](1.procedure.md#4.Procedure v1 interface).
+* Execution: Once the library is loaded, use it as you would with a C++ stored procedure. The process is the same and does not need further explanation.
+
+## 3. API Documentation
+
+In the Rust community, all code and documentation can be found on [`crates.io`](https://crates.io/crates/tugraph ) and [`docs.rs`](https://docs.rs/tugraph/latest/tugraph ).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile
new file mode 100644
index 0000000000..41426df6e6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 3.6.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst
new file mode 100644
index 0000000000..9dee2a39b9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst
@@ -0,0 +1,12 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure/index.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
new file mode 100644
index 0000000000..83cc10c52e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
new file mode 100644
index 0000000000..1183184e51
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
@@ -0,0 +1,2736 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+:warning: **All the other RESTful APIs excluding the three below will be deprived after 4/30/2023.**
+- **Login**
+- **Query**
+- **Store Procedures**
+
+## 2.Protocols And Data Format
+
+### 2.1.Protocols
+
+Both HTTP and HTTPS protocols are supported by TuGraph. The system uses HTTP protocol by default. To use HTTPS, the `ssl_auth` option should be set to `true` in the DB configuration.
+
+### 2.2.Request
+
+TuGraph supports HTTP GET/POST/PUT/DELETE requests, in which:
+
+- `GET` requests are used for read-only requests, such as getting vertex properties, edge properties, etc.
+
+- `POST` requests are used to create entities, submit Cypher, and to manage and call stored procedures;
+
+- `PUT` requests are used to modify existing entities, for example, to modify vertex properties, edge properties, etc.
+
+- `DELETE` requests are used to delete existing entities, such as vertices, edges, etc.
+
+In high-availability mode, users can set `ServerVersion` in the request header to make sure the request is never served with an outdated version.
+The current `ServerVersion` can be obtained from the header returned by the server.
+
+### 2.3.Response
+
+TuGraph returns the following HTTP status codes:
+
+- **200 OK**: operation is successful.
+- **307 Temporary Redirect**: the operation is redirected, typically in high-availability mode, to the master.
+- **400 Bad Request**: incorrect input, such as URI error, or invalid parameters.
+- **500 Internal Server Error**: server error.
+
+When the operation is successful, the JSON response contains the return value of the operation. When the operation is redirected, the `location` field in the returned HTTP header contains the redirect destination address.
+When an input error or server error occurs, the JSON response contains a `error_message` field that describes the error.
+
+In high-availability mode, the server will set `server_version` field in the header to inform the client of the data version of the current server. When clients switch between several different servers, this version number guarantees that the client will not read from an outdated server.
+
+### 2.4.Data Format
+
+The server and clients exchange data in JSON format. When sending a request, the header of the HTTP request should be set with `Accept:application/json, Content-Type:app/json`.
+For example, to create a new vertex, the request header should look like the following:
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.5.URI Format
+
+TuGraph REST API provides access to: web visualization, login, db info, label, index, node, relationship, cypher, task, cpp_plugin, and python_plugin.
+The URI format used for each function is as follows:
+
+| URI     | Description                     |
+| ------- | ------------------------------- |
+| /web    | web visualization               |
+| /cypher | cypher request                  |
+| /acl    | access control                  |
+| /user   | user management                 |
+| /login  | user login                      |
+| /info   | database status and information |
+| /task   | task management                 |
+| /db     | subgraph management             |
+
+For each subgraph, the following interfaces are provided:
+
+| URI                              | Description                         |
+| -------------------------------- | ----------------------------------- |
+| /db                              | create, modify, and delete subgraph |
+| /db/_{graph_name}_/node          | vertex operations                   |
+| /db/_{graph_name}_/relationship  | edge operations                     |
+| /db/_{graph_name}_/label         | label-related operations            |
+| /db/_{graph_name}_/index         | index-related operations            |
+| /db/_{graph_name}_/cypher        | subgraph-specific cypher operation  |
+| /db/_{graph_name}_/cpp_plugin    | C++ plugin(stored procedure)        |
+| /db/_{graph_name}_/python_plugin | Python plugin(stored procedure)     |
+| /db/_{graph_name}_/import        | online import                       |
+| /db/_{graph_name}_/misc          | other operations                    |
+
+## 3.Login
+
+The system creates an administrator by default, whose username is _admin_ and password is _73@TuGraph_. For security reasons, please remember to change your password after first starting the server.
+
+### 3.1.User Login
+
+TuGraph provides JWT-based user authentication. To login to the server, a REST client should send login request with username and password. On success, the client will receive a signed token in the form of Json Web Token (JWT), which should be stored by the client and used for every request that follows.
+
+- **URI**: `/login`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| user     | username    | String |
+| password | password    | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.2.Token Refresh
+
+After the token expires, the front-end initiates a refresh token interface, and the back-end verifies the validity of the token.
+If the verification passes, a new token is generated; if the verification fails, status code 401 is returned.
+
+- **URI**: `/refresh`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.Modify Token Validity Period
+
+To modify the validity period of Token, three parameters need to be transmitted: jwt, refresh_time and expire_time, among which jwt is used to verify the user’s identity. When refresh_time and expire_time are equal to 0, the validity period is indefinite. When refresh_time exceeds, you need to call the refresh interface to obtain a new Token; When expire_time expires, you need to log in again. (This interface call needs to confirm the security by itself, do not call unless necessary)
+
+- **URI**: `/update_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+| refresh_time | Valid time (deafult set to 0) | Int64 |
+| expire_time | Expire time (deafult set to 0) | Int64 |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.Query Token validity period
+To query the validity period of the Token, you need to transmit jwt to verify the user's identity, and return, refresh_time and expire_time, where refresh_time indicates the refresh time, and you need to call the refresh interface to obtain a new Token when it exceeds; expire_time indicates the expiration time, and you need to log in again when it exceeds.
+
+- **URI**: `/get_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return "refresh_time" and "expire_time".
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+### 3.5.Logout
+
+The user logs out and deletes the token at the same time.
+
+- **URI**: `/logout`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+## 4.Query
+
+URI format is:
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.Call Cypher
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description   | Type   |
+| ------ | ------------- | ------ |
+| graph  | subgraph name | String |
+| cypher | Cypher query  | String |
+
+- **RESPONSE**:
+
+| Field   | Description             | Type    |
+| ------- | ----------------------- | ------- |
+| result  | running results         | List    |
+| elapsed | running time in seconds | Float   |
+| header  | header of the results   | List    |
+| size    | number of results       | Integer |
+
+in which `header` is a list with each element in the form of:
+
+| Field | Description                                                | Type   |
+| ----- | ---------------------------------------------------------- | ------ |
+| name  | the name of column                                         | String |
+| type  | column data type, 0 is scalar, 1 is vertex id, 2 is vector |        |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.Call Cypher with Parameters
+
+Cypher supports querying with parameters. When a Cypher query with parameters is called, TuGraph caches the execution plan for that query to speed up the following queries of the same kind.
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type   |
+| ---------- | ------------- | ------ |
+| graph      | subgraph name | String |
+| cypher     | Cypher query  | String |
+| parameters | parameters    | List   |
+
+- **RESPONSE**:
+
+Same as [Call Cypher](#Call-Cypher).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+## 5.Stored Procedures
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.Create Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                                                                       | Type   |
+| ----------- | --------------------------------------------------------------------------------- | ------ |
+| name        | name of the plugin                                                                | String |
+| description | description of the plugin                                                         | String |
+| code_base64 | code of plugin encoded in base64                                                  | String |
+| read_only   | whether it is a read-only stored procedure                                        | Bool   |
+| code_type   | type of plugin code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String |
+
+_Note: read-only plugins are more efficient than write plugins. Always specify `read-only=true` for read-only transactions._
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.so}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 5.2.List Stored Procedures
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list in which each element is a plugin description, in the format of:
+
+| Field       | Description                               | Type   |
+| ----------- | ----------------------------------------- | ------ |
+| name        | name of the stored procedure              | String |
+| description | description of the stored procedure       | String |
+| read_only   | whether the stored procedure is read-only | Bool   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.Retrieve Stored Procedure Detail
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Procedure detail, including code, in the format of:
+
+| Field       | Description                                                                         | Type                   |
+| ----------- | ----------------------------------------------------------------------------------- | ---------------------- |
+| name        | Procedure name                                                                      | String                 |
+| description | Procedure descrition                                                                | String                 |
+| read_only   | Read only or not                                                                    | Bool                   |
+| code_base64 | 存储过程的代码                                                                      | String, Base64 encoded |
+| code_type   | Type of procedue code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String                 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.Call Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: POST
+
+- **REQUEST**: String input.
+
+| Field   | Description                                               | Type   |
+| ------- | --------------------------------------------------------- | ------ |
+| data    | input data                                                | String |
+| timeout | timeout in seconds, defaults to 0, which means no timeout | Float  |
+
+- **RESPONSE**:
+
+| Field  | Description     | Type   |
+| ------ | --------------- | ------ |
+| result | running results | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.Delete Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+## 6.Deprecated
+
+The APIs below will be removed after 4/30/2023.
+
+### 6.1.User Management
+
+#### 6.1.1.Add User
+
+Add a new user and set the initial password for the user. Only administrators have permission to add new users. The username can only have letters, numbers, and underscores, and should not begin with a number. The password can contain any character. The username and password have a maximum length of 64 bytes.
+
+- **URI**: `/user`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                                 | Type   |
+| -------- | ------------------------------------------- | ------ |
+| user     | username                                    | String |
+| password | password                                    | String |
+| is_admin | whether the user is an administrator or not | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "is_admin": false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.Change Password
+
+Users can change their own passwords, in which case the original password needs to be verified.
+
+Administrators can change the passwords of any user and promote non-admin users to administrators, or demote administrator users to regular users. When modifying another user's password, the original password of the user is not needed.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field            | Description                                                                     | Type   |
+| ---------------- | ------------------------------------------------------------------------------- | ------ |
+| current_password | user's current password, if modifying its own password                          | String |
+| new_password     | user's new password                                                             | String |
+| is_admin         | should this user be administrator or not, used when promoting or demoting users | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user/user1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+        "is_admin": true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.3.List All Users
+
+List all users of the database. Only administrators are allowed to perform this operation.
+
+- **URI**: `/user/`
+
+- **METHOD**: GET
+
+- **RESPONSE**: a dictionary of {`user_name`:`is_admin`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+    • 200: OK
+    Output:
+    {
+        "admin": true,
+        "guest1": false
+    }
+
+#### 6.1.4.Delete User
+
+Delete a user from the DB. Only administrators have permission to do so.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.2.Access Control
+
+TuGraph has four access levels. Different users can have different permissions for each subgraph. The four access levels are as follows:
+
+| Access Level | Description                                                                                                               |
+| ------------ | ------------------------------------------------------------------------------------------------------------------------- |
+| NONE         | no access                                                                                                                 |
+| READ         | read-only                                                                                                                 |
+| WRITE        | can read and write vertexes and edges of the subgraph                                                                     |
+| FULL         | full access, including changing metadata (label, index), managing stored procedures and deleting all data in the subgraph |
+
+Administrators have full access on all subgraphs, and a newly created non-admin user does not have access for any subgraph. Users who have full access on a subgraph can set the access level for other users on that subgraph.
+
+#### 6.2.1.Query User's Access Level
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+When both `user` and `graph` are specified, the user's access level for the subgraph is returned, such as `READ`.
+
+When only `user` is specified, all subgraphs that the user can access (access level not `NONE`) are returned, as well as the user's access level on the subgraph.
+
+When only `graph` is specified, all users who have access level on this graph (excluding administrators, who have implicit `FULL` access) and their access levels are returned. This operation requires administrator permission.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/acl/?user=user1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "graph1": "READ",
+      "graph2": "WRITE",
+      "graph3": "FULL"
+    }
+```
+
+#### 6.2.2.Change User's Access Level
+
+- **URI**: `/acl`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field | Description     | Type   |
+| ----- | --------------- | ------ |
+| user  | username        | String |
+| graph | subgraph's name | String |
+| acl   | access level    | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/acl
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "user1",
+        "graph": "graph1",
+        "acl": "FULL"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.Remove User's Access Right
+
+This is equivalent to setting access level to `NONE`.
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/acl/?user=user1&graph=graph1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.Server Status
+
+#### 6.3.1.Modify Server Configuration
+
+Modifying the server configuration will take effect immediately after the configuration modification and will affect all servers. These configurations take precedence over configuration files and command line arguments.
+
+- **URI**: `/config`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+  | Field            | Description                                           | Type |
+  | ---------------- | ----------------------------------------------------- | ---- |
+  | db_async         | Whether to enable asynchronous mode                   | Bool |
+  | optimistic_txn   | Whether to use optimistic transaction lock by default | Bool |
+  | enable_audit_log | Whether to enable audit logging                       | Bool |
+
+- **RESPONSE**: If successful, return status code 200.
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "db_async": true,
+        "enable_audit_log": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.Current Server Status
+
+- **URI**: `/info`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field          | Description                    | Type                                                                                    |
+| -------------- | ------------------------------ | --------------------------------------------------------------------------------------- |
+| lgraph_version | TuGraph version                | String                                                                                  |
+| git_branch     | server's git branch            | String                                                                                  |
+| git_commit     | server's git commit version    | String                                                                                  |
+| web_commit     | web client commit version      | String                                                                                  |
+| cpp_id         | cpp compiler id                | String                                                                                  |
+| cpp_version    | cpp compiler version           | String                                                                                  |
+| python_version | python lib version             | String                                                                                  |
+| cpu            | cpu information                | Dictionary, format refers [CPU Status](#CPU-Status)                                     |
+| disk           | disk IO information            | Dictionary, format refers [Disk Status](#Disk-Status)                                   |
+| memory         | memory information             | Dictionary, format refers [Memory Status](#Memory-Status)                               |
+| db_space       | graph database storage         | Dictionary, format refers [Graph Database Storage](#Graph-Database-Storage)             |
+| db_config      | graph database configuration   | Dictionary, format refers [Graph Database Configuration](#Graph-Database-Configuration) |
+| up_time        | database's online running time | Integer                                                                                 |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.CPU Status
+
+- **URI**: `/info/cpu`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description        | Type    |
+| ------ | ------------------ | ------- |
+| self   | TuGraph CPU usage  | Integer |
+| server | server's CPU usage | Integer |
+| unit   | metric unit        | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.Disk Status
+
+- **URI**: `/info/disk`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description              | Type    |
+| ----- | ------------------------ | ------- |
+| read  | server's disk read rate  | Integer |
+| write | server's disk wrtie rate | Integer |
+| unit  | metric unit              | String  |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.Memory Status
+
+- **URI**: `/info/memory`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description               | Type    |
+| ------------ | ------------------------- | ------- |
+| self         | TuGraph memory usage      | Integer |
+| server_avail | server's available memory | Integer |
+| server_total | server's total memory     | Integer |
+| unit         | metric unit               | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.Database Size
+
+- **URI**: `/info/db_space`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                | Type    |
+| ----- | -------------------------- | ------- |
+| space | total size of the database | Integer |
+| unit  | metric unit                | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.DB Configuration
+
+- **URI**: `/info/db_config`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description                                       | Type    |
+| ------------ | ------------------------------------------------- | ------- |
+| async        | asynchronous mode                                 | Bool    |
+| disable_auth | whether to disable authentication                 | Bool    |
+| enable_ha    | whether to enable high-availability mode          | Bool    |
+| enable_rpc   | whether to enable RPC server                      | Bool    |
+| host         | bound host address                                | String  |
+| port         | port of REST server                               | Integer |
+| rpc_port     | port of RPC server                                | Integer |
+| thread_limit | limit of available threads for the graph database | Integer |
+| use_ssl      | whether to use SSL for authentication             | Bool    |
+| verbose      | verbose level of the output                       | Integer |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "host":"127.0.0.1",
+      "port":7070,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "use_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.7.High Availability Server List
+
+Get a list of replication servers. Valid only in high-availability mode.
+
+- **URI**: `/info/peers`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of server information, each of server information is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+| state        | server state          | String |
+
+The server state can be `MASTER`, `SLAVE`, or `OFFLINE`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.8.Current Leader Information
+
+Get information of current leader. Valid only in HA mode.
+
+- **URI**: `/info/leader`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current leader server information, which is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.9.Server Statistics
+
+- **URI**: `/info/statistics`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current server statistics, which is formatted as:
+
+| Field           | Description                                   | Type    |
+| --------------- | --------------------------------------------- | ------- |
+| requests/second | number of requests processed per second       | Float   |
+| writes/second   | number of write requests processed per second | Float   |
+| running_tasks   | number of requests in progress                | Integer |
+| failure_rate    | request failure rate                          | Float   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 0.023,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.10.Get Audit Logs
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+
+| Field            | Description                                                                                                             | Type      |
+| ---------------- | ----------------------------------------------------------------------------------------------------------------------- | --------- |
+| begin_time       | start time of the queried log (required, format YYYY-mm-dd HH:MM:SS)                                                    | Timestamp |
+| end_time         | end time of the queried log (default is current time, format YYYY-mm-dd HH:MM:SS)                                       | Timestamp |
+| user             | the operator of the queried log (administrator can query all users' logs, ordinary users can only query their own logs) | String    |
+| num_log          | maximum number of logs to return (default 100)                                                                          | Integer   |
+| descending_order | whether to sort the result in descending order(default is true)                                                         | Bool      |
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of audit logs, each of which is an action log in the format of:
+
+| Field      | Description                                        | Type    |
+| ---------- | -------------------------------------------------- | ------- |
+| index      | the index of the operation                         | Integer |
+| begin_time | the start time of the operation                    | String  |
+| end_time   | the end time of the operation                      | String  |
+| user       | the user of the operation                          | String  |
+| graph      | the graph of the operation                         | String  |
+| type       | the type of the operation                          | String  |
+| read_write | the operation is read operation or write operation | String  |
+| success    | whether the operation is successful                | Bool    |
+| content    | the content of the operation                       | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.Task Management
+
+TuGraph tracks long-running tasks such as complex Cypher queries and plugins. Administrators can query currently running tasks through the REST API and choose to abort the queries if necessary.
+
+The URI format for task management is :
+
+```
+    http://{host}:{port}/task/{task_id}
+```
+
+#### 6.4.1.List Running Tasks
+
+- **URI**: `/task`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+The returned JSON is an array, each of which is formatted as follows:
+
+| Field        | Description                                      | Type   |
+| ------------ | ------------------------------------------------ | ------ |
+| description  | the description of the task                      | String |
+| time_elapsed | time the task has been executing for, in seconds | Float  |
+| task_id      | the ID of the task                               | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.Abort Task
+
+- **URI**: `/task/{task_id}`
+
+Where `task_id` is the `task_id` returned by `GET /task` .
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.5.Subgraph Management
+
+TuGraph supports multiple subgraphs and all subgraphs are completely independent from others. Different subgraphs can have different permissions to different users. Administrators can add, modify and delete subgraphs.
+
+#### 6.5.1.Create New Subgraph
+
+- **URI**: `/db`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description                   | Type                                                                |
+| ------ | ----------------------------- | ------------------------------------------------------------------- |
+| name   | the name of subgraph          | String                                                              |
+| config | the configuration of subgraph | Dictionary, in the format of {{column name 1}:{column value 1},...} |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1"
+        "config" : {
+            "max_size_GB":2048,
+            "async":True
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.Delete Subgraph
+
+- **URI**: `/db/{graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.List All Subgraphs
+
+- **URI**: `/db`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of all subgraphs.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_gb":1024,
+            "async":false
+        }
+    }
+```
+
+### 6.6.Label
+
+TuGraph is a strong-schema database. In each subgraph, each vertex and edge need to have a predefined data format. The data format is determined by Label. Users can use the REST API to add, delete, and query labels and their corresponding data format.
+
+The URI format of the Label operation is
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+Where the {type} can be `node` or `relationship`.
+
+#### 6.6.1.Create Label
+
+A label is created with a fixed data format. A label must be defined before any node or relationship can be created with that label.
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field            | Description                  | Type   |
+| ---------------- | ---------------------------- | ------ |
+| name             | the name of label            | String |
+| fields           | data column definition       | List   |
+| is_vertex        | whether it is a vertex Label | Bool   |
+| primary          | vertex primary property      | String |
+| edge_constraints | edge constraints             | List   |
+
+`primary` should be set when `is_vertex` is `true`. This field is only available for Vertex, and must be set when creating Vertex.
+
+`edge_constraints` could be set when `is_vertex` is `false`, This field is only available for Edge. This field limits the combination of starting and ending vertex of the edge, for example: `[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, just leave this field unset.
+
+In which `fields` is an array, in which each element defines a column of data, as follows:
+
+| Field    | Description                                                | Type                                                                                                         |
+| -------- | ---------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------ |
+| name     | the name of the column                                     | String                                                                                                       |
+| type     | the data type of the column                                | String, with following types: int8, int16, int32, int64, float, double, string, date, datetime, binary, blob |
+| optional | whether the data can be empty (optional, default is false) | Bool                                                                                                         |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.List All Labels
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description               | Type |
+| ------ | ------------------------- | ---- |
+| edge   | the list of edge labels   | List |
+| vertex | the list of vertex labels | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.Get Label Data Format
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Data column definition table as a dictionary, in which each key is the column name, and corresponding value is the column definition defined as follows:
+- | Field    | Description                           | Type   |
+  | -------- | ------------------------------------- | ------ |
+  | optional | whether the column value can be empty | Bool   |
+  | type     | the type of the column value          | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema Import
+
+- **URI**: `/db/{graph_name}/schema/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description              | Type   |
+| ----------- | ------------------------ | ------ |
+| description | Graph labels description | String |
+
+The detail description can refer to `TuGraph Manual`.
+
+- **RESPONSE**:
+
+Schema import will check the new schema and original schema in database if compatible or not. If yes, this request will add the label only in new schema. If no, will return an error code.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.Vertex Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+in which `vid` is a unique integer identifying the vertex, which can be obtained when creating new vertexes or by looking up index.
+
+#### 6.7.1.List Vertex and Label Number
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field      | Description                | Type    |
+| ---------- | -------------------------- | ------- |
+| num_label  | the number of vertex label | Integer |
+| num_vertex | the number of vertex       | Integer |
+
+_Note: `num_vertex` returns an estimate of the number of vertexes, not the exact number. To get the exact number, please use Cypher queries._
+
+#### 6.7.2.Create New Vertex
+
+Insert a vertex into the database.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                  | Type       |
+| -------- | ---------------------------- | ---------- |
+| label    | the name of label            | String     |
+| property | the properties of the vertex | Dictionary |
+
+in which `property` is a dictionary of {`column_name`:`column_value`}.
+
+- **RESPONSE**: if successful, return status code 200 and the new vertex's vid, which can be used in later vertex operations.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.Batch Create Vertexes
+
+TuGraph allows multiple vertices to be inserted as one batch to reduce network overhead.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description               | Type   |
+| ------ | ------------------------- | ------ |
+| label  | the name of Label         | String |
+| fields | the column names          | List   |
+| values | the values of each vertex | List   |
+
+in which `fields` is a list of strings specifying column names, and `values` is a list in which each element is a list of `column_values` corresponding to the column names as specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200, and return the vid list of newly added vertices in the JSON content, where each vid corresponds to each vertex in the request.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.Get Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description       | Type                                                             |
+| -------- | ----------------- | ---------------------------------------------------------------- |
+| label    | the name of Label | String                                                           |
+| property | property          | Dictionary, in the format of {column_name_1:column_value_1, ...} |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.Delete Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200, and also the following content in JSON:
+
+| Field | Description                                    | Type    |
+| ----- | ---------------------------------------------- | ------- |
+| in    | number of incoming edges of the deleted vertex | Integer |
+| out   | number of outgoing edges of the deleted vertex | Integer |
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.Get Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Vertex properties as a dictionary of {`column_name`:`column_value`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.Get Vertex Field
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Value corresponding to the specified `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.Update Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description          | Type       |
+| -------- | -------------------- | ---------- |
+| property | properties to update | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "13737299333"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.8.Edge Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+in which `euid` is a string uniquely identifying the edge, which can be obtained when creating edges or by iterating through the edges of a vertex.
+
+#### 6.8.1.Create Edge
+
+- **URI**: `/db/{graph_name}/node/{src_vid}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                     | Type       |
+| ----------- | ------------------------------- | ---------- |
+| label       | the label of edge               | String     |
+| destination | the `vid` of destination vertex | Integer    |
+| property    | the property of edge            | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200 and the `euid` of new created edge (type is String).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.Batch Create Edges
+
+- **URI**: `/db/{graph_name}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description          | Type   |
+| ------ | -------------------- | ------ |
+| label  | the label of edge    | String |
+| fields | the data column name | List   |
+| edge   | the data of edge     | List   |
+
+where the edge is a list of data, each of which specifies and edge, defined as follows:
+
+| Field       | Description           | Type    |
+| ----------- | --------------------- | ------- |
+| source      | source vertex id      | Integer |
+| destination | destination vertex id | Integer |
+| values      | the data list         | List    |
+
+in which `values` is a list of column values, each of which correspond to the a column name specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200 and the list of `euid`s of the newly created edges.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.List Out-going Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of source vertex's out-going edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.List Incoming Edges
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of destination vertex's incoming edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.List All Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                     | Type |
+| ----- | ------------------------------- | ---- |
+| in    | list of incoming edges' `euid`s | List |
+| out   | list of outgoing edges' `euid`s | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.Get Edge Information
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description                | Type       |
+| -------- | -------------------------- | ---------- |
+| label    | the label of the edge      | String     |
+| property | the properties of the edge | Dictionary |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.Delete Edge
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.Get Edge Properties
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The dictionary of edge's properties.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.Get Edge Field
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the value corresponding to given `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.Update Edge Property
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description              | Type       |
+| -------- | ------------------------ | ---------- |
+| property | properties to be updated | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.9.Index
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+#### 6.9.1.Create Index
+
+Create an index on a (label, field) pair. Blocks until the index is successfully built.
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field     | Description                          | Type   |
+| --------- | ------------------------------------ | ------ |
+| label     | the name of label                    | String |
+| field     | field to be indexed                  | String |
+| is_unique | whether this index is a unique index | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.List All Indexes
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.List Indexes Related with Specified Label
+
+- **URI**: `/db/{graph_name}/index/{label}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.Delete Index
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.Get Vertex by Index
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of `vid`s.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+
+
+
+### 6.10.Data Import
+
+- **URI**: `/db/{graph_name}/import/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field             | Description                                                                                        | Type                       |
+|-------------------|----------------------------------------------------------------------------------------------------|----------------------------|
+| description       | description of the file content                                                                    | String                     |
+| data              | contents of the file to be imported (recommended to have a size of 16MB, has a hard limit of 17MB) | Strings / Arrays / Objects |
+| continue_on_error | whether to continue import when an error occurred (optional, default is `false`)                   | Bool                       |
+| delimiter         | delimiter used in the data file (optional, default is `“,”`)                                       | String                     |
+
+The details of the `description` field can be found in [TuGraph Import Tool](../../3.server-tools/1.data-import.md).
+
+`delimiter` can be a single character or multi-character string, but must not contain `\r` or `\n`.
+
+`data` can be one of the following:
+
+- String, such as `"1,2\n3,4\n"`
+- Array of ASCII codes, such as `[49,44,50,10,51,44,52,10]`
+- Dictionary shaped like the above array, such as `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+* **RESPONSE**:
+
+The system **will not** automatically perform actions such as creating a new label, adding an index, and so on. Before you do this, please make sure that the label involved already exists and has an appropriate index.
+
+If the import is successful, return code 200 and return log information (possibly empty) in the `log` field. Otherwise, returns status code 400. None of the data is imported on failure, and error message is set in `error_message`.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+Because the request specifies `continue_on_error: true`, the returned `log` indicates that the first edge cannot be inserted because there is no vertex with uid==1, while the second edge was imported successfully.
+
+### 6.11.Miscellany
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.Extract Subgraph
+
+Give a set of `vid`s and return the minimum subgraph which contains the vertex set and the edges between them.
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type |
+| ---------- | ------------- | ---- |
+| vertex_ids | vertex id set | List |
+
+- **RESPONSE**:
+
+| Field         | description        | Type                                                               |
+| ------------- | ------------------ | ------------------------------------------------------------------ |
+| nodes         | vertex information | List, each element contains vid, label, and properties.            |
+| relationships | edge information   | List, each element contains src, dst, euid, label, and properties. |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
new file mode 100644
index 0000000000..911de26909
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
@@ -0,0 +1,269 @@
+# RPC API
+
+> This document mainly introduces the details of calling TuGraph's RPC API.
+
+## 1.Introduction
+
+TuGraph provides rich RPC APIs for developers to remotely call the services provided by TuGraph through RPC requests.
+
+RPC (Remote Procedure Call) is a protocol for requesting services from remote computer programs through a network without the need to understand the underlying network technology.
+Compared with REST, RPC is method-oriented and mainly used for calling function methods. It is suitable for more complex communication scenarios and has higher performance.
+brpc is an industrial-grade RPC framework written in C++. Based on brpc, TuGraph provides rich RPC APIs. This document describes how to use TuGraph's RPC API.
+
+## 2.Request
+
+### 2.1.Establishing a Connection
+
+When developers send RPC requests to TuGraph services, they must first establish a connection. Taking C++ as an example, developers create a channel with the specified URL and create a specified service stub (LGraphRPCService_Stub) from the channel. Subsequently, they can send requests to the remote server through the stub like calling local methods.
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.Request Types
+
+TuGraph supports 10 types of RPC requests, and each request's functionality is shown in the following table:
+
+| Request              | Functionality         |
+|-----------------|------------|
+| GraphApiRequest | Vertex-Edge Index   |
+| CypherRequest   | cypher   |
+| PluginRequest   | Stored Procedures     |
+| HARequest       | High Availability    |
+| ImportRequest   | Data Import     |
+| GraphRequest    | Subgraph Operations     |
+| AclRequest      | Access Control     |
+| ConfigRequest   | Configuration     |
+| RestoreRequest  | Backup       |
+| SchemaRequest   | Schema Management |
+
+When a user sends a request, the following parameters need to be passed in:
+- client_version: an optional parameter, in HA mode, it can prevent outdated responses by comparing `client_version` and `server_version`
+- token: a necessary parameter, the client obtains the token after logging in, and the token is passed in with each request to verify the user's identity
+- is_write_op: an optional parameter, indicating whether the request is a write request
+- user: an optional parameter, set user when synchronizing requests between master and slave in HA mode, and no token verification is required After the service processes the RPC request, it sends back a response.
+
+In addition to containing separate response information for each request, the response message also includes the following parameters:
+- error_code: a necessary parameter, indicating the processing status of the request
+- redirect: an optional parameter, when processing fails to send a write request to a follower in HA mode, set redirect as the request forwarding address, that is, the leader address
+- error: an optional parameter, indicating the error information of the request
+- server_version: an optional parameter, set `server_version` in the HA mode request response to avoid reverse time travel when client reads data
+
+:warning:  **Except for CypherRequest, PluginRequest, HARequest and AclRequest, all other RPC interfaces will be gradually deprecated, and their functions will be unified into the CypherRequest interface.**
+
+## 3.Login
+
+The login request message contains the following parameters:
+- user: a necessary parameter, the username
+- pass: a necessary parameter, the password
+
+Taking C++ as an example, the user sends a login request using the constructed service stub:
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+The login response message contains the following parameters:
+- token: a necessary parameter. After successful login, a signed token, namely Json Web Token, will be received. The client stores the token and uses it for each subsequent request. If the login fails, an "Authentication failed" error will be received.
+
+## 4.Query
+Users can interact with TuGraph through Cypher queries. The Cypher request message contains the following parameters:
+- query: a necessary parameter, the Cypher query statement
+- param_names: an optional parameter, the parameter name
+- param_values: an optional parameter, the parameter value
+- result_in_json_format: a necessary parameter, whether to return the query results in JSON format
+- graph: an optional parameter, the subgraph name for executing the Cypher statement
+- timeout: an optional parameter, the timeout for executing the Cypher statement
+
+Taking C++ as an example, the user sends a Cypher request as follows:
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+The Cypher request response contains one of the following two parameters:
+- json_result: the Cypher query result in JSON format
+- binary_result: the Cypher query result in the CypherResult format
+
+## 5.Stored Procedures
+To meet users' more complex query/update logic, TuGraph supports stored procedures written in C and Python. Users can use RPC requests to perform CRUD operations on stored procedures.
+
+### 5.1.Load Stored Procedures
+The request for loading stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- read_only: a necessary parameter, whether it is read-only
+- code: a necessary parameter, the ByteString generated by reading the stored procedure file
+- desc: an optional parameter, the stored procedure description
+- code_type: an optional parameter, the stored procedure code type, which can be PY, SO, CPP, or ZIP
+
+Taking C++ as an example, the user loads the stored procedure as follows:
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for loading the stored procedure does not contain parameters, and if the loading fails, a BadInput exception will be thrown.
+
+### 5.2.Invoke Stored Procedures
+
+The request for invoking stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- param: a necessary parameter, the stored procedure parameters
+- result_in_json_format: an optional parameter, whether to return the invocation result in JSON format
+- in_process: an optional parameter, to be supported in the future
+- timeout: an optional parameter, the timeout for invoking the stored procedure
+
+Taking C++ as an example, the user invokes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+The response for invoking the stored procedure contains one of the following two parameters:
+- reply: the stored procedure invocation result in the ByteString format
+- json_result: the stored procedure invocation result in JSON format
+
+### 5.3.Delete Stored Procedures
+
+The request for deleting stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+
+Taking C++ as an example, the user deletes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for deleting the stored procedure does not contain parameters, and if the deletion fails, a BadInput exception will be thrown.
+
+### 5.4.List Stored Procedures
+
+The request for listing stored procedures does not require parameters. Taking C++ as an example, the user lists the stored procedures as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+The response for listing the stored procedures contains the following parameter:
+- reply: the procedure list in JSON format
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst
new file mode 100644
index 0000000000..484e600e87
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Protocol
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
new file mode 100644
index 0000000000..92de7af893
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
@@ -0,0 +1,90 @@
+# Learning Tutorial
+
+> This document is designed as a guide for TuGraph users. Before reading the detailed documentation, users should first read this document to have a general understanding of the graph learning process of TuGraph, which will make it easier to read the detailed documentation later. The guide program is based on a simple program instance of TuGraph, and we will focus on its usage.
+
+## 1. Introduction to TuGraph Graph Learning Module
+Graph learning is a machine learning method that utilizes the topological information of a graph structure to analyze and model data. Unlike traditional machine learning methods, graph learning uses graph structures where vertices represent entities in data and edges represent relationships between entities. By extracting features and patterns from these vertices and edges, deep associations and patterns can be revealed in data that can be used in various practical applications.
+
+The TuGraph Graph Learning Module is a graph learning module based on a graph database that provides four sampling operators: Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. These operators can be used to sample vertices and edges in a graph to generate training data. The sampling process is performed in a parallel computing environment, providing high efficiency and scalability.
+
+After sampling, the obtained training data can be used to train a model that can be used for various graph learning tasks such as prediction and classification. Through training, the model can learn the relationships between vertices and edges in the graph, allowing for prediction and classification of new vertices and edges. In practical applications, this module can be used to handle large-scale graph data such as social networks, recommendation systems, and bioinformatics.
+
+## 2. Run Process
+The TuGraph graph learning module samples graph data in TuGraph, and the sampled vertices and edges are used as graph learning features for learning and training. The operation process is shown in the figure below:
+
+![Alt text](../../../../../images/learn_flow_chart_en.png)
+
+## 3. Data Import
+Please refer to [Data Import](../../../5.developer-manual/3.server-tools/1.data-import.md) for data import.
+
+Taking the cora dataset as an example for the import process:
+
+Execute in the build/output directory:
+
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+Where cora.conf is the graph schema file representing the format of the graph data. cora_db is the imported graph data file name representing the storage location of the graph data.
+
+## 4. Feature Conversion
+Since the features in graph learning are generally represented as long float arrays, TuGraph does not support loading float array types, so they can be imported as string types and converted to char* for subsequent storage and access, and the implementation details can refer to the feature_float.cpp file.
+
+The specific execution process is as follows:
+
+Compile the imported plugin in the build directory:
+
+`make feature_float_embed`
+
+Execute in the build/output directory:
+
+`./algo/feature_float_embed ./cora_db`
+
+Then the conversion can be performed.
+
+## 5. Sampling Operators and Compilation
+TuGraph implements an operator for obtaining the full graph data and four sampling operators at the cython layer, as follows:
+
+### 5.1.Sampling Operator Introduction
+|Sampling Operator | Sampling Method |
+| --- | --- |
+|GetDB | Get the graph data from the database and convert it into the required data structure |
+|Neighbor Sampling | Sample the neighboring nodes of the given node to obtain the sampling subgraph |
+|Edge Sampling | Sample the edges in the graph according to the sampling rate to obtain the sampling subgraph |
+|Random Walk Sampling | Conduct a random walk based on the given node to obtain the sampling subgraph |
+|Negative Sampling | Generate a subgraph of non-existent edges|
+
+### 5.2.Compilation
+Execute in the tugraph-db/build folder:
+
+`make -j2`
+
+Or execute in the tugraph-db/learn/procedures folder:
+
+`python3 setup.py build_ext -i`
+
+Once the algorithm so is obtained, it can be used by importing it in Python.
+
+## 6. Model Training and Storage
+TuGraph calls the cython layer operator at the Python layer to implement graph learning and training.
+
+The usage of the TuGraph graph learning module is as follows:
+
+Execute in the tugraph-db/learn/example folder:
+
+`python3 train_full_cora.py --model_save_path ./cora_model`
+
+Then training can be performed.
+
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+## 7. Model Loading
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+Before using a saved model, it is necessary to load it first. In the code above, the trained model is loaded using the provided code.
+
+After loading the model, we can use it to make predictions and classifications for new vertices and edges. For prediction, we can input one or multiple vertices and the model will output corresponding prediction results. For classification, we can input the whole graph, and the model will classify the vertices and edges in the graph to achieve the task goal.
+
+Using a trained model can save time and resources compared to retraining the model. Additionally, since the model has already learned the relationships between vertices and edges in the graph, it can adapt well to new data and improve the accuracy of predictions and classifications.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
new file mode 100644
index 0000000000..c649fa50e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
@@ -0,0 +1,102 @@
+# Sampling API
+
+>This document provides a detailed guide on using the Sampling API of TuGraph.
+
+## 1. Overview
+This manual introduces the Sampling API using TuGraph.
+
+## 2. Graph Data Instantiation
+Before the sampling operation, load the graph data according to the graph data path, and map it into the olapondb graph analysis class, the code is as follows:
+
+```python
+galaxy = PyGalaxy(args.db_path) # Create a galaxy instance based on the path
+galaxy.SetCurrentUser(args.username, args.password) # Set the current user
+db = galaxy.OpenGraph('default', False) # Open the graph database specified by db
+txn = db.CreateReadTxn() # Create a transaction instance
+olapondb = PyOlapOnDB('Empty', db, txn) # Instantiate OlapOnDB based on the graph loading method, graph database instance, and transaction instance
+del txn
+del db
+del galaxy
+```
+## 3. Introduction to Sampling Operators
+The graph sampling operator is implemented in the cython layer and is used to sample the input graph. The generated NodeInfo is used to save point information such as feature attributes and label attributes, and EdgeInfo is used to save edge information. These metadata information can be used for features Extraction, network embedding and other tasks. Currently, the TuGraph graph learning module supports five sampling operators: GetDB, NeighborSampling, EdgeSampling, RandomWalkSampling, and NegativeSampling.
+
+### 3.1.RandomWalk Operator
+Random walks are performed a specified number of times around the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.2.NeighborSampling Operator
+A certain number of nodes are sampled from the first-degree neighbors of the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.3.NegativeSampling Operator
+The negative sampling algorithm is used to generate a subgraph of non-existent edges.
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+num_samples: The number of false edges to be generated.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.4.EdgeSampling Operator
+The edge sampling algorithm is used to generate a subgraph of sampled edges.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_rate: The sampling rate of the edges to be selected.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.5.GetDB Operator
+Get the graph data from the database and convert it into the required data structure.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+## 4. User-Defined Sampling Algorithm
+Users can also implement a custom sampling algorithm through the TuGraph Olap interface. For the interface document, see [here](../2.olap/5.python-api.md). This document mainly introduces the interface of related functions used by the graph sampling algorithm design.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md
new file mode 100644
index 0000000000..a5a03f8d23
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md
@@ -0,0 +1,101 @@
+# Training
+> This document details how to use TuGraph for training Graph Neural Networks (GNNs).
+
+## 1. Training
+When using TuGraph's graph learning module for training, it can be divided into two categories: full graph training and mini-batch training.
+
+Full graph training involves loading the entire graph from the TuGraph db into memory and training the GNN. Mini-batch training uses the sampling operator of the TuGraph graph learning module to sample the entire graph data and then input it into the training framework for training.
+
+## 2. Mini-Batch Training
+Mini-batch training requires the use of TuGraph's graph learning module's sampling operators, which currently support Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. The sampling result of the TuGraph graph learning module's sampling operator is returned in the form of a List.
+
+The following takes Neighbor Sampling as an example to introduce how to convert the sampled results into the training framework for format conversion.
+The user needs to provide a Sample class:
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. Load graph data
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+        # 2. Sampling method, the result is stored in NodeInfo and EdgeInfo
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+        # 3. Format conversion of the result to fit the training format
+        src = EdgeInfo[0].astype('int64')
+        dst = EdgeInfo[1].astype('int64')
+        nodes_idx = NodeInfo[0].astype('int64')
+        remap(src, dst, nodes_idx)
+        features = NodeInfo[1].astype('float32')
+        labels = NodeInfo[2].astype('int64')
+        g = dgl.graph((src, dst))
+        g.ndata['feat'] = torch.tensor(features)
+        g.ndata['label'] = torch.tensor(labels)
+        return g
+```
+As shown in the code, the graph data is first loaded into memory. Then use the sampling operator to sample the graph data, and the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and the stored information results are as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Finally, we format the result to fit the training format. Here we use the DGL training framework, so we construct a DGL Graph using the result data, and then return the DGL Graph.
+
+Once we provide the TuGraphSample class, we can use it for Mini-Batch training. Let the data loading part of DGL use the sampler instance of TuGraphSample as follows:
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+Use DGL for model training:
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+## 3. Full-Batch training
+Full-Batch training of GNNs (Graph Neural Networks) is a type of training that involves processing the entire training dataset at once. It is one of the simplest and most straightforward training methods for GNNs, where the entire graph is treated as a single instance. In full-batch training, the entire dataset is loaded into memory and the model is trained on the entire graph. This type of training is especially useful for small to medium-sized graphs, and is mainly used for static graphs that do not change over time.
+```python
+getdb. Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+The full graph are then fed into the training framework for training.
+Full code: learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/index.rst
new file mode 100644
index 0000000000..fbc920ad54
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/5.learn/index.rst
@@ -0,0 +1,8 @@
+TuGraph Learn
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/index.rst
new file mode 100644
index 0000000000..8391b4f678
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/6.interface/index.rst
@@ -0,0 +1,12 @@
+TuGraph DB Interface
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.cypher.md
+   2.olap/index.rst
+   3.procedure/index.rst
+   4.protocol/index.rst
+   5.learn/index.rst
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/7.quality/1.unit-testing.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/7.quality/1.unit-testing.md
new file mode 100644
index 0000000000..2cdb8d3f31
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/7.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# Unit Testing
+
+> This document is the unit testing documentation for TuGraph.
+
+## 1.Introduction
+
+TuGraph unit testing uses the gtest framework, which can choose to run all tests at once or specify certain tests.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/7.quality/2.integration-testing.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/7.quality/2.integration-testing.md
new file mode 100644
index 0000000000..40d9e86c79
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/7.quality/2.integration-testing.md
@@ -0,0 +1,400 @@
+# Integration Testing
+
+> This document mainly introduces how to use the TuGraph integration testing framework.
+
+## 1.The Significance of TuGraph Integration Testing
+
+In unit tests and function tests, some test cases directly use Galaxy or Statemachine to perform tests, which is not a complete process. In the complete CS architecture, user requests are sent to the server through the client, and network communication is essential. To avoid bugs caused by incomplete unit testing, TuGraph uses an integration testing framework to perform end-to-end testing.
+
+## 2.TuGraph Integration Testing Framework
+
+TuGraph uses the Pytest framework as its integration testing framework. Pytest is currently the most widely used CS-side integration testing framework. It is known for its flexibility, ease of use, and the ability to support parameterization. Based on the functionality provided by Pytest, TuGraph abstracts different tools and controls the processing logic of each tool through parameters to facilitate efficient testing code development.
+
+For more information on Pytest, please refer to the official website: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.Component Description
+
+| Component Name    |Component Function      | Implementation Method                              |
+| --------------- | -------------------------- | ------------------------------------------------ |
+| server          | TuGraph standalone service | Start a child process and launch the service       |
+| client          | TuGraph Rpc Client         | Open TuGraph Python Rpc Client in the current process and send requests  |
+| importor        | TuGraph Importor           | Start a child process to process import requests               |
+| exportor        | TuGraph Exportor           | Start a child process to process export requests               |
+| backup_binlog   | TuGraph Backup Binlog      | Start a child process to process binlog backup requests       |
+| backup_copy_dir | TuGraph Backup             | Start a child process to process full db backup requests       |
+| build_so        | Component for compiling C++ dynamic libraries    | Start a child process to handle GCC compilation logic            |
+| copy_snapshot   | TuGraph Copy Snapshot      | Handle backup snapshot requests in the current process                 |
+| copydir         | Folder copy                 | Handle folder copy requests in the current process                     |
+| exec            | Execute C++/Java executable files     | Start a child process to launch the C++ executable file  |
+| algo            | Execute algorithm                   | Start a child process to run the algorithm     |
+| bash            | Execute bash commands               | Start a child process to execute bash commands      |
+| rest            | TuGraph Python Rest Client | Open TuGraph Python Rest Client in the current process and send requests|
+
+### 2.2.Component Usage
+
+#### 2.2.1.server
+
+##### 2.2.1.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The server will be started before the function starts executing, and the server will be stopped and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ host is the IP and port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to the user in the TuGraph Server
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The client will be started before the function starts executing, and the client will be stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.Startup Command
+
+Import the tool through the fixtures component and control the import of different data through startup parameters. The data will be imported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.Startup Command
+
+Import the tool through the fixtures component and control the export of different data through startup parameters. The data will be exported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.Startup Parameters
+采用python字典传入
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different binlogs through startup parameters. The binlogs will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different databases through startup parameters. The database will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command, passed in as a Python list, and multiple so can be compiled at once
++ so_name is the dynamic library that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_plugins/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_plugins/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.Startup Command
+
+Import the tool through the fixtures component and control the compilation of different dynamic libraries through startup parameters. The dynamic libraries will be generated to the specified directory before the function starts executing, and the dynamic libraries specified in the so_name list will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original database
++ dst is the snapshot copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.Startup Command
+Import the tool through the fixtures component and control the copying of different snapshots through startup parameters. The snapshot in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original directory
++ dst is the directory copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.Startup Command
+Import the tool through the fixtures component and control the copying of different directories through startup parameters. The directory in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.Startup Command
+Import the tool through the fixtures component and control the execution of different logic through startup parameters. A child process will be started to execute the command passed in through the cmd parameter before the function starts executing.
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ result is the expected execution result of the algorithm. After execution is completed, the actual result will be compared with the expected result. If they are different, the test will fail.
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.Startup Command
+Import the tool through the fixtures component and control the execution of different algorithm logic through startup parameters. A child process will be started to execute the algorithm passed in through the cmd parameter before the function starts executing. The function body will wait for the algorithm to complete and compare the result with the expected result.
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.Startup Command
+
+Import the tool through the fixtures component and control the execution of different bash commands through startup parameters. A child process will be started to execute the bash command passed in through the cmd parameter before the function starts executing. The function body will wait for the command to complete.
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ port is the port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to user in TuGraph Server
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.Startup Command
+
+Import the tool through the fixtures component and link to different TuGraph Rest Servers through startup parameters. The client will be started before the function starts executing and stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.Test Cases
+
+#### 2.3.1.rest
+
+In the sample code, before the test_get_info function is executed, the server is started, and a rest client is started after the server is started. After entering the test_get_info function, some information about the server is obtained, and assert is used to determine whether cpu information is obtained.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+In the sample code, before the test_flushdb function is executed, the offline data import logic is executed and the server is started. After creating a connection through the client, the function enters the test_flushdb function. The number of points is queried to determine whether the import is successful. After the import is successful, the flushDB operation is executed. assert is used again to determine whether the db can be emptied normally.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+In the sample code, before the test_export_default function is executed, the offline data import logic is executed. After the import is successful, the data of the current db is exported. Then, the offline import logic is used again to import the exported data into a new directory. The newly imported data is used to start the db and create a connection. In the body of the test_export_default function, it is determined whether the data after export and import is consistent with the original data.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.Other Tests
+For more test cases, please refer to the integration test code [https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/7.quality/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/7.quality/index.rst
new file mode 100644
index 0000000000..c6be070cb8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/7.quality/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Quality
+==============================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/8.other/1.privilege.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/8.other/1.privilege.md
new file mode 100644
index 0000000000..59c569b9f7
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/8.other/1.privilege.md
@@ -0,0 +1,135 @@
+# Privilege
+
+## 1.Introduce
+
+> The permissions of TuGraph are managed based on role-based access control. The permissions that define access control are assigned to roles, and the roles are then assigned to users.
+
+## 2.Level of permissions
+
+- Global layer: indicates global permissions, which have permissions for management and graph operations.
+- Graph layer: control permissions on each graph;
+- Property level (Commercial version only) : control permissions on a property
+
+## 3.Permission keyword
+
+At present, the control of permissions is relatively simple
+
+- The Global layer currently has admin permission, and the admin user is preset.
+
+* The Graph layer has four operation permissions: none, read, write, and full
+
+- none: No permission, no operation permission for the graph
+- read: Read-only permission, only has read permission for the graph
+- write: Read and write permission, not only has read permission for the graph, but also has write permission
+- full: All permissions, not only have read and write permissions for graphs, but also have permissions to delete graphs, modify graphs, and modify schemas
+
+* The Property layer (Commercial version only)  has the following permissions: none, read, and write
+
+- none: No permission, no operation permission for the property
+- read: Read-only permission, only has read permission for the property
+- write: Read and write permission, not only has read permission for the property, but also has write permission
+
+## 4.Common permission operations
+
+### 4.1.User action
+
+- Creating a user
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- Deleting a user
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- Change the password of the current user
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- Changes the password of a specified user
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- Disable or enable a user
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- List all users
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- Lists the current user information
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- Obtain user details
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.Role actions
+
+- Create a role
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- Delete a role
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- List all characters
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- Disable or enable the role
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.Assign roles to users
+
+- Adds the association between the user and the role
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- Deletes the association between the user and the role
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- Clears the relationship between user roles and rebuilds them
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.Role empowerment
+
+- Modifies the access permission of a role to a specified graph
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/8.other/2.token.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/8.other/2.token.md
new file mode 100644
index 0000000000..ecf60e2ce9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/8.other/2.token.md
@@ -0,0 +1,39 @@
+# Token Usage Guide
+## 1. Introduction to Token
+JWT (JSON Web Token) is an open standard used for authentication and authorization. It is based on the JSON (JavaScript Object Notation) format and is designed for securely transmitting claim information between network applications.
+
+JWT consists of three parts: the header, payload, and signature. The header contains the type of JWT and the signature algorithm used, the payload contains the information to be transmitted, and the signature is used to verify the integrity and authenticity of the JWT.
+
+In TuGraph, JWT is used to implement a stateless authentication and authorization mechanism. After a user logs in successfully, the server generates a JWT and returns it to the client. The client passes this JWT as an identity credential in subsequent requests to the server. Upon receiving the JWT, the server verifies the signature and parses the information in the payload to determine the user's identity and permissions, and decides whether to allow the execution of the request.
+
+## 2. Token Expiration
+### 2.1. Browser Token Interaction Logic
+1. The user opens the browser, enters the username and password, and clicks login.
+2. The frontend calls the login interface and inputs the account and password to the backend.
+3. After receiving the account and password, the backend verifies them and returns a Token.
+4. The frontend stores the Token in the browser cache, and all subsequent requests must carry this Token.
+5. If the frontend actively clicks logout or closes the page, it should actively call the logout interface and pass the Token to the backend.
+6. After receiving the Token, the backend invalidates it, returns a status code 200, and "logout successful". After receiving the message, the frontend clears the Token in the browser memory, and returns to the login page.
+7. The Token expires (initially set to 24 hours), and the user needs to log in again.
+### 2.3. Token Expiration Refresh Mechanism
+Token expiration has a refresh mechanism that is turned off by default. If turned on, the security of the Token will be higher, and there will be two timestamps.
+
+The first timestamp `refresh_time` is used to determine whether the Token has expired (default 24 hours): after expiration, the refresh interface can be called to obtain a new Token, which can be set to a shorter time, such as 1 hour.
+
+The second timestamp `expire_time` is the forced expiration timestamp (default 24 hours): after expiration, the user must log in again.
+
+### 2.4. Token Expiration Modification
+To facilitate developers to develop on their own, TuGraph provides two ways to modify the expiration time, both of which require admin privileges.
+
+* Set through the interface call. The interfaces involved in modifying the expiration time are `update_token_time` and `get_token_time` for querying the expiration time. For details, please refer to the [REST interface document](../../5.developer-manual/6.interface/4.protocol/1.restful-api.md).
+* Set through startup parameters. When the server-side is started, adding the parameter `-unlimited_token 1` can set the Token to be unlimited. Please refer to the [service running document](../../5.developer-manual/2.running/2.tugraph-running.md) for details.
+## 3. Introduction to Token-Related Requests Sent by Clients
+The client handles two types of protocol-related requests: REST and RPC.
+
+### 3.1. REST
+If the client uses the REST protocol (including the browser), because it is a short connection, Token needs to be carried in every request, and a new Token needs to be obtained after it expires.
+
+For self-developed clients, if the REST protocol is used, Token logic needs to be considered.
+
+### 3.2. RPC
+If the client uses the RPC protocol (including the official C++/Java/Python), it uses a long connection to maintain, and no Token operation is involved after login.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/8.other/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/8.other/index.rst
new file mode 100644
index 0000000000..d2e81f6ec7
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/8.other/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Other
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/index.rst
new file mode 100644
index 0000000000..4900dd0189
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/5.developer-manual/index.rst
@@ -0,0 +1,15 @@
+TuGraph DB Developer Manual
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.installation/index.rst
+   2.running/index.rst
+   3.server-tools/index.rst
+   4.client-tools/index.rst
+   5.ecosystem-tools/index.rst
+   6.interface/index.rst
+   7.quality/index.rst
+   8.other/index.rst
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/1.contributing.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/1.contributing.md
new file mode 100644
index 0000000000..f68e91fda6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/1.contributing.md
@@ -0,0 +1,81 @@
+# TuGraph Contribution Guide
+
+## 1. Preface
+
+Thank you for your contribution to TuGraph. We sincerely hope that more students from the community will join in and build a better graph database project together.
+
+Before contributing code, please take some time to understand the process of contributing code to TuGraph, and read the "Contributor License Agreement". Participating in the contribution is deemed to agree to the above agreement.
+
+Individual Contributor License Agreement: [4.individual_cla.md]
+
+Corporate Contributor License Agreement: [5.corporate_cla.md]
+
+## 2. What to contribute
+
+We welcome any contribution at any time, whether it's a simple typo fix, bug fix, or new feature addition. Feel free to ask questions or initiate PRs. We also value documentation and integration with other open source projects, and welcome contributions in this regard. For any modification, especially the more complex modification, it is recommended to create an issue and fill it out according to the BUG or PR template.
+
+## 3. Preparation
+
+Before contributing code, you need to understand the use of git tools and the use of GitHub website.
+
+## 4. Contribute code process
+
+### 4.1. Submit the issue
+
+Whether you are fixing a bug in TuGraph or adding a new feature to TuGraph, before you submit the code, submit an issue on TuGraph's GitHub, describing the problem you want to fix or the function you want to add. There are several advantages to doing this:
+
+- There will be no duplication of work in conflict with other developers or their plans for the project.
+- TuGraph maintainers will discuss the bugs or new features you mentioned to determine whether the modification is necessary, whether there is room for improvement or a better way.
+- After reaching an agreement, develop and submit the code, reducing the cost of communication between the two parties and reducing the rejection of pull requests.
+
+### 4.2. Pull the branch
+
+All modifications of TuGraph are made on branches. After modification, the pull request is submitted and merged into the Master by the project maintenance personnel after Code Review. Therefore, after the source code steps are described, you need:
+
+1. Download the code to a local directory. In this step, you can choose git or https. In recent years, github has stricter permission requirements. The git approach, for example, requires the more complex ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)). https authentication cannot be performed using the user name and password. git clone https://github.com/ Your account name /tugraph-db
+2. Pull branch ready to modify code:
+   git branch add_xxx_feature
+3. After executing the above command, your code repository switches to the appropriate branch. Run the following command to view your current branch: git branch -a
+4. If you want to switch back to Master, run the git checkout -b master command
+5. If you want to switch back to branching, run the following command: git checkout -b "branchName"
+
+### 4.3. Configuring Github Information
+
+Run git config --list on your machine to view git's global username and mailbox. Check whether the displayed user.name and user.email match your github user name and email address.
+
+If a company has its own gitlab in-house or uses other commercial GitLabs, a mismatch may occur. At this point, you need to set up a separate user name and mailbox for the tugraph-db project. For details about how to set the user name and email address, see github's official documentation.
+
+### 4.4. Change the code and submit it locally
+
+Once you've pulled the branch, you're ready to change the code.
+
+**Code modification Notes**
+
+Code style consistency: TuGraph uses cpplint to keep code in the same format, and IDE can use.clang to configure the style. Be sure to check the code style locally before submitting it, or ACI will report an error.
+
+Add unit test code: New changes should pass through existing unit tests. New unit tests should be provided to prove that there are bugs in the previous code and that the new code has resolved these bugs. You can run all tests with the following command:./unit_test
+It can also be run with the help of an IDE.
+
+**Other precautions**
+
+Please keep the code you are editing in the original style, especially the space feed, etc. For unnecessary comments, delete them directly. Add comments where logic and functionality are not easily understood. Keep documentation up to date. After modifying the code, run the following command to submit all the changes to the local computer:
+git commit -am '(feat) Add the xx function 'git commit -am '(fix) fix xx problem' '
+
+Submit the code to the remote repository
+After the code is committed locally, you can then synchronize the code with the remote repository. Run the following command to submit local changes to github: git push origin "branchname"
+
+If you were forking earlier, the origin here is pushed to your code repository, not TuGraph's.
+
+After the code has been submitted to GitHub, you can send a request to merge your changes into the TuGraph Master. At this point, you need to go to your corresponding repository on GitHub and press the pull request button in the upper right corner. Select the target branch, which is usually the master, and the system will notify the TuGraph staff, who will Review your code, and when it meets the requirements, it will join the main branch and become part of TuGraph.
+
+Please note that the CI will be automatically checked, as well as all Commits signing the cla, with green signs on the commits.
+
+### 4.5. Code Review
+
+After you submit your code, your code will be assigned to a maintainer for Review. Please wait patiently. If no one has responded to your submission after two working days, you can leave a message under PR and @ the corresponding person.
+
+Comments on code Review will be directly noted to the corresponding PR or Issue. If you find the suggestions reasonable, please update them to your code.
+
+### 4.6. Merge code into Master
+
+After the code Review is approved, the TuGraph maintainer will put it into the Master. During this process, the maintainer may specify a new Reviewer and put forward new comments that need to be revised. Normally this step is omitted, and after the code is merged, you will receive an indication that the merge was successful.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/2.community-roles.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/2.community-roles.md
new file mode 100644
index 0000000000..27cff88ae8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/2.community-roles.md
@@ -0,0 +1,72 @@
+# TuGraph community roles
+
+## 1. Preface
+
+This document describes the roles of membership in the TuGraph community, the requirements and permissions for each role.
+
+## 2. Role summary
+
+This is the division of roles in the TuGraph community, describing the responsibilities of each role, the requirements to become and remain a role, and the permissions of the corresponding role.
+
+Our community is divided into three roles based on the Apache specification:
+
+- Contributor
+- Maintainer
+- PMC
+
+The requirements, responsibilities, and authorities for each role are described below.
+
+## 3. Contributor
+
+### 3.1. requirements
+
+Successfully submit a PR and merge in any of TuGraph's official projects.
+
+### 3.2. responsibility
+
+- Actively respond to issues or PR assigned to you
+- Help reply the issue/pr together and assign the issue to the person in charge of the corresponding module
+
+### 3.3. permissions
+
+- Join the TuGraph GitHub organization and become a member of the TuGraph open source community.
+
+## 4 Maintainer
+
+### 4.1. requirements
+
+The new Committer is recommended by the existing PMC and approved by 2/3 of the votes. The Commiter meets at least one of the following conditions:
+
+- Been a community member for more than three months
+- More than 10 PR for PMC approve
+- Complete major functions
+- Fixed serious bugs
+- Follow project development and participate in community discussion
+
+### 4.2. responsibility
+
+- Community counseling support
+- Actively respond to issues or PR assigned to you
+- The right to vote on major community decisions
+- Review community PR
+
+### 4.4. permissions
+
+- Pull Request review permission
+
+## 5. PMC
+
+### 5.1. requirements
+
+- Not open at the moment, if you have a strong desire please contact PMC
+
+### 5.2. responsibility
+
+- Actively participate in community discussions and give guidance to major community decisions
+- Responsible for ensuring that the community activities of open source projects are running smoothly
+
+### 5.3. permissions
+
+- Pull Request review permission
+- Pull Request approve permission
+- Community role member management
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/3.individual-cla.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/3.individual-cla.md
new file mode 100644
index 0000000000..18295236c1
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/3.individual-cla.md
@@ -0,0 +1,71 @@
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+# 个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..cc47087c32
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/4.corporate-cla.md
@@ -0,0 +1,82 @@
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+# 公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/5.roadmap.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/5.roadmap.md
new file mode 100644
index 0000000000..379ecef880
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/5.roadmap.md
@@ -0,0 +1,68 @@
+# TuGraph Roadmap
+
+## 1. Introduction
+
+This document outlines the future development plans for TuGraph, including features currently under development, those not in the development pipeline, and completed functionalities not included in the open-source version.
+
+TuGraph aims to be an open-source, high-performance graph database. It adopts a centralized storage approach for graph data and, in the short term, does not consider data sharding. Instead, it employs a master-slave replication mode to address high-concurrency read scenarios, while utilizing cloud-based storage solutions to address storage capacity challenges.
+
+## 2. Completed Functionalities
+
+TuGraph was open-sourced on September 1, 2022, and has received regular bug fixes and enhancements based on community feedback.
+
+| Version | Functionality | Date |
+| --- | --- | --- |
+| 3.3.0 | Initial open-source release | 2022.9.1 |
+| 3.3.1 | Refactored graph analysis engine with multi-mode support | 2022.10.14 |
+| 3.3.2 | Added OGM support and improved unit test coverage | 2022.11.21 |
+| 3.3.3 | Iterative improvements to link authentication mechanism and addition of English documentation | 2022.12.23 |
+| 3.3.4 | Cloud deployment support and streamlined LDBC SNB Audit process | 2023.1.28 |
+| 3.4.0 | Added support for OLAP Python API and upgraded offline data import | 2023.3.11 |
+| 3.5.0 | Introduced POG (Procedures On Graph query language), frontend upgrades | 2023.6.5 |
+| 3.5.1 | Added learning engine, Procedure Rust API, and storage-property separation | 2023.7.14 |
+
+In addition, TuGraph has established a comprehensive quality system, including automated unit testing, integration testing, and performance testing.
+
+
+
+## 3. Roadmap of 2023 S2
+
+The planned high availability feature was delayed in the first half of the year, while the graph learning capability was iterated earlier than scheduled. The second half of the year will focus on completing the high availability feature and being the first to support a pre-print version of ISO GQL.
+
+| Version | Functionality | Planned Date |
+| 3.6.0 | High availability support | 2023.8 |
+| 4.0.0 | ISO GQL language support  | 2023.10 |
+
+## 4. Functional Updates in 2023
+
+In addition to the aforementioned core functionalities, the following components are planned for development in 2023.
+
+|Version|	Functionality|	Planned Date|
+| --- | --- | --- |
+|3.5.x	|Optimization of the logging system|2023.7|
+|3.5.x	|Cold backup support|	2023.9|
+|3.5.x	|Support for edge upsert import|	2023.9|
+|x.x.x	|Trigger support exploration|	2023.12|
+|x.x.x	|Exploring new storage engines|	TBD|
+|x.x.x	|Rapid schema addition and deletion|	TBD|
+|x.x.x	|TuGraph Browser version iteration|	TBD|
+|x.x.x	|Iteration of stored procedure Python API|	TBD|
+
+## 5. Community Collaboration Features
+
+Currently, the development team's resources are limited, and we cannot implement all the desired features for TuGraph. However, during the feature planning process, we have identified a range of ideas worth exploring. The team has conducted some initial exploration, and we welcome community collaboration in developing the following features:
+
+|Version	|Functionality	|Planned Date|
+| --- | --- | --- |
+|x.x.x	|Documentation improvements	|TBD|
+|x.x.x	|Enrichment of APOC tools	|TBD|
+|x.x.x	|Support for default property values	|TBD|
+|x.x.x	|Composite index for multiple properties	|TBD|
+|x.x.x	|Online full import support	|TBD|
+|x.x.x	|Enhanced graph permissions	|TBD|
+|x.x.x	|NLP (Natural Language Processing) support	|TBD|
+|x.x.x	|Java Procedure API	|TBD|
+|x.x.x	|Rapid database migration	|TBD|
+|x.x.x	|Spatiotemporal data support	|TBD|
+
+For simpler features, we will label them as "good first issue" on GitHub issues, and we welcome discussions from technology enthusiasts interested in graph databases.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/index.rst
new file mode 100644
index 0000000000..cb2cde62f4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/6.community-manual/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Community Manual
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/7.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/7.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..f7b3d46bc8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/7.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# Importing Data from Relational Databases to TuGraph
+
+> Content to be added
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/7.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/7.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..232b6bfa31
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/7.best-practices/2.learn_practices.md
@@ -0,0 +1,192 @@
+# Using TuGraph Graph Learning Module for Node Classification
+
+## 1. Introduction
+GNN is a powerful tool for many machine learning tasks on graphs. In this introductory tutorial, you will learn the basic workflow of using GNN for node classification, i.e., predicting the category of nodes in a graph.
+
+This document will show how to build a GNN for semi-supervised node classification on the Cora dataset with only a few labels, which is a citation network with papers as nodes and citations as edges. The task is to predict the category of a given paper.
+By completing this tutorial, you will be able to:
+
+Load the Cora dataset.
+
+Sample and build a GNN model using the sampling operator provided by TuGraph.
+Train the GNN model for node classification on CPU or GPU.
+
+This document requires some experience in using graph neural networks and DGL.
+
+## 2. Prerequisites
+The TuGraph graph learning module requires TuGraph-db version 3.5.1 or above.
+
+It is recommended to use Docker image tugraph-compile 1.2.4 or above for TuGraph deployment:
+
+tugraph/tugraph-compile-ubuntu18.04:latest
+
+tugraph/tugraph-compile-centos7:latest
+
+tugraph/tugraph-compile-centos8:latest
+
+The above images can be obtained on DockerHub.
+Please refer to [Quick Start](../3.quick-start/1.preparation.md) for specific operations.
+
+## 3. Import Cora Dataset to TuGraph Database
+### 3.1. Introduction to Cora Dataset
+The Cora dataset consists of 2708 papers, classified into 7 categories. Each paper is represented by a 1433-dimensional bag-of-words feature, indicating whether a certain word appears in the paper. These bag-of-words features have been preprocessed to be normalized to a range from 0 to 1. The edges represent citation relationships between papers.
+
+TuGraph has provided the Cora dataset import tool, which users can use directly.
+
+### 3.2. Data Import
+The Cora dataset is located in the test/integration/data/algo directory and contains the cora_vertices point set and the cora_edge edge set.
+
+First, the Cora dataset needs to be imported into the TuGraph database. Please refer to [Data Import](../5.developer-manual/3.server-tools/1.data-import.md).
+
+Execute the following command in the build/output directory:
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+Here, cora.conf is the graph schema file representing the format of graph data, which can be found in test/integration/data/algo/cora.conf. cora_db is the name of the graph data file after import, which represents the storage location of graph data.
+
+## 4. Feature Conversion
+Since the features in the Cora dataset are float arrays of length 1433, which are not supported by TuGraph for loading, they can be imported as strings and converted to char* for easier access later. The implementation can be referred to the feature_float.cpp file.
+The specific execution process is as follows:
+
+Compile the import plugin in the build directory:
+`make feature_float_embed`
+
+Execute the following command in the build/output directory to perform the conversion:
+`./algo/feature_float_embed ./cora_db`
+
+## 5. Compile Sampling Operator
+The sampling operator is used to obtain graph data from the database and convert it into the required data structure. The specific execution process is as follows:
+Execute the following command in the tugraph-db/build directory:
+`make -j2`
+
+or execute the following command in the tugraph-db/learn/procedures directory:
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *
+import importlib
+getdb = importlib.import_module("getdb")
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+As shown in the code, after obtaining the algorithm .so file, import and use it.
+
+## 6. Training Process
+### 6.1. Data Loading
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+As shown in the code, load the data into memory based on the path of the graph data, username, password, and subgraph name. TuGraph can load multiple subgraphs for graph training, but we only load one subgraph here.
+
+### 6.2. Build Sampler
+During the training process, the GetDB operator is first used to obtain the graph data from the database and convert it into the required data structure. The specific code is as follows:
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+As shown in the code, the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and their stored information is as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Then a sampler is constructed:
+```python
+batch_size = 5
+count = 2708
+sampler = TugraphSample(args)
+dataloader = dgl.dataloading.DataLoader(fake_g,
+    torch.arange(count),
+    sampler,
+    batch_size=batch_size,
+    num_workers=0,
+    )
+```
+
+### 6.3. Convert the results to the required format
+```python
+src = EdgeInfo[0].astype('int64')
+dst = EdgeInfo[1].astype('int64')
+nodes_idx = NodeInfo[0].astype('int64')
+remap(src, dst, nodes_idx)
+features = NodeInfo[1].astype('float32')
+labels = NodeInfo[2].astype('int64')
+g = dgl.graph((src, dst))
+g.ndata['feat'] = torch.tensor(features)
+g.ndata['label'] = torch.tensor(labels)
+return g
+```
+The results are converted to the required format to fit the training format.
+
+### 6.4. Build the GCN model
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+def build_model():
+    in_size = feature_len  # feature_len is the length of features, which is 1433 here
+    out_size = classes  # classes is the number of classes, which is 7 here
+    model = GCN(in_size, 16, out_size)  # 16 is the size of the hidden layer
+    return model
+```
+In this tutorial, a two-layer Graph Convolutional Network (GCN) will be built. Each layer aggregates neighbor information to compute new node representations.
+
+### 6.5. Train the GCN model
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    return float(loss)
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+As shown in the code, iterate and train 50 times based on the defined sampler, optimizer, and model.
+
+The output is as follows:
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+The graph learning module can be accelerated by using a GPU. If users want to run it on the GPU, they need to install the corresponding GPU driver and environment. For details, please refer to learn/README.md.
+
+The complete code can be found in learn/examples/train_full_cora.py.
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/7.best-practices/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/7.best-practices/index.rst
new file mode 100644
index 0000000000..4292d5488f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/7.best-practices/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Best Practices
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/8.faq.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/8.faq.md
new file mode 100644
index 0000000000..0ff9399d75
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/8.faq.md
@@ -0,0 +1,33 @@
+# FAQ
+
+During the use of TuGraph, if you encounter problems, you can first check [User Documentation](https://github.com/TuGraph-db/tugraph-db/tree/master/doc/zh-CN). Second, check to see if the FAQ list below matches your question.
+
+1. **[Kernel Engine QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussion-4575385)**
+   1.1 [Does the edge of TuGraph support index? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165379)
+   1.2 [What is the QPS of a single TuGraph machine? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussion-4575381)**
+   2.1 [How to update the tugraph service after the visualization file is built? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165364)
+   2.2 [How to connect the existing tugraph service through npm run dev? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165366)
+   2.3 [TuGraph Browser version 3.3.0 failed to delete node label? ](https://github.com/TuGraph-db/tugraph-db/discussions/82#discussion-4465791)
+3. **[Client QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussion-4575378)**
+   3.1 [What programming languages ​​does the client currently have, and does it support node js? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165351)
+   3.2 [Does the python client support pip install? Where is the client referenced? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165353)
+4. **[Data Import QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussion-4575373)**
+   4.1 [Which common databases can TuGraph connect to? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165335)
+   4.2 [How to import data? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[Stored Procedure QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussion-4575369)**
+   5.1 [How to load stored procedure or algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165313)
+   5.2 [How to call or execute the stored procedure? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165317)
+   5.3 [Where is the open source built-in algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[Installation and deployment QA summary](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussion-4575364)**
+   6.1 [How to install using docker image? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165287)
+   6.2 [After the rpm package and deb package are installed, start the lgraph_server service. Prompt missing 'liblgraph.so' error? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165289)
+   6.3 [How to compile TuGraph on Mac's M1 chip? ](https://github.com/TuGraph-db/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussion-4575018)**
+   7.1 [Does it support conditional query of indefinite length? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165252)
+   7.2 [How to query the shortest path, how to use the shortestPath function? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165256)
+   7.3 [Using and after the query statement Where to splice the query speed is slow, how should the statement be optimized and improved? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165260)
+   7.4 [How to query the edge of any jump? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165262)
+   7.5 [Is there a date() function in Cypher? ](https://github.com/TuGraph-db/tugraph-db/discussions/91#discussion-4482858)
+
+If the problem is still not resolved, we recommend you follow up or create a new thread describing your problem. At the same time, the TuGraph QA summary will be updated regularly based on the posts initiated by everyone in the discussion area.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/9.contacts.md b/docs/docusaurus/versions/version-3.6.0/en-US/source/9.contacts.md
new file mode 100644
index 0000000000..2019a8b998
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/9.contacts.md
@@ -0,0 +1,28 @@
+# Contacts
+
+If you have any feedback or suggestions for the product, You are welcome to join the discussion or make suggestions through the following contact methods.
+
+Official website: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue:
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions:
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack:
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+Dingtalk Group Chat (Discussions):
+
+![alert](../../images/dingtalk.png)
+
+WeChat Group Chat (Discussions):
+
+![alert](../../images/wechat_tech.png)
+
+Official Accounts (Information Release):
+
+![alert](../../images/wechat.png)
+
+Email（Enterprise version consultation）: tugraph@service.alipay.com
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/conf.py b/docs/docusaurus/versions/version-3.6.0/en-US/source/conf.py
new file mode 100644
index 0000000000..b8e3705b60
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/conf.py
@@ -0,0 +1,46 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('5.developer-manual/6.interface/3.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="5.developer-manual/6.interface/3.procedure/")
+    breathe_projects = {"cpp_procedure": "5.developer-manual/6.interface/3.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    subprocess.run(shlex.split("rm -rf 3.C++-procedure 4.Python-procedure.rst index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
+    subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
diff --git a/docs/docusaurus/versions/version-3.6.0/en-US/source/index.rst b/docs/docusaurus/versions/version-3.6.0/en-US/source/index.rst
new file mode 100644
index 0000000000..6a546ea885
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/en-US/source/index.rst
@@ -0,0 +1,17 @@
+TuGraph DB
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.developer-manual/index.rst
+   6.community-manual/index.rst
+   7.best-practices/index.rst
+   8.faq.md
+   9.contacts.md
diff --git a/docs/docusaurus/versions/version-3.6.0/images/architecture-en.png b/docs/docusaurus/versions/version-3.6.0/images/architecture-en.png
new file mode 100644
index 0000000000..edf2bc873a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/architecture-en.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/architecture.png b/docs/docusaurus/versions/version-3.6.0/images/architecture.png
new file mode 100644
index 0000000000..e8eeea87e0
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/architecture.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/account-add-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/account-add-button.png
new file mode 100644
index 0000000000..5b9c7e9378
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/account-add-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/account-add.png b/docs/docusaurus/versions/version-3.6.0/images/browser/account-add.png
new file mode 100644
index 0000000000..b0b5068027
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/account-add.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/account-delete.png b/docs/docusaurus/versions/version-3.6.0/images/browser/account-delete.png
new file mode 100644
index 0000000000..bfe49fb093
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/account-delete.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/account-disable.png b/docs/docusaurus/versions/version-3.6.0/images/browser/account-disable.png
new file mode 100644
index 0000000000..f8ff994f21
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/account-disable.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/account-edit.png b/docs/docusaurus/versions/version-3.6.0/images/browser/account-edit.png
new file mode 100644
index 0000000000..939c374f25
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/account-edit.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/account-enable.png b/docs/docusaurus/versions/version-3.6.0/images/browser/account-enable.png
new file mode 100644
index 0000000000..ddc8cef578
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/account-enable.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/account.png b/docs/docusaurus/versions/version-3.6.0/images/browser/account.png
new file mode 100644
index 0000000000..0aa0cd195c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/account.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/db_basic.png b/docs/docusaurus/versions/version-3.6.0/images/browser/db_basic.png
new file mode 100644
index 0000000000..b78298825b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/db_basic.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/db_configuration.png b/docs/docusaurus/versions/version-3.6.0/images/browser/db_configuration.png
new file mode 100644
index 0000000000..2de3da502c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/db_configuration.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addedge-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addedge-button.png
new file mode 100644
index 0000000000..b38900728e
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addedge-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addedge.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addedge.png
new file mode 100644
index 0000000000..39eca4a772
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addedge.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addvertex-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addvertex-button.png
new file mode 100644
index 0000000000..e616ce0f89
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addvertex-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addvertex.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addvertex.png
new file mode 100644
index 0000000000..df56d537bb
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-addvertex.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-button.png
new file mode 100644
index 0000000000..abf1fab48f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-editedge.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-editedge.png
new file mode 100644
index 0000000000..eb7206b771
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-editedge.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-editvertex.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-editvertex.png
new file mode 100644
index 0000000000..eb252761bf
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-editvertex.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-exportmodel-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-exportmodel-button.png
new file mode 100644
index 0000000000..acbaa80189
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-exportmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-exportmodel.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-exportmodel.png
new file mode 100644
index 0000000000..4991dc7378
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-exportmodel.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import-csv.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import-csv.png
new file mode 100644
index 0000000000..2301c01cfc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import-csv.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import-datamapping.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import-datamapping.png
new file mode 100644
index 0000000000..5d55861a95
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import-datamapping.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import-success.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import-success.png
new file mode 100644
index 0000000000..20a48beb0f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import-success.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import.png
new file mode 100644
index 0000000000..0154bac688
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-import.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-importmodel-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-importmodel-button.png
new file mode 100644
index 0000000000..bb7822aaef
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-importmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-importmodel.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-importmodel.png
new file mode 100644
index 0000000000..252b082100
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-importmodel.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-list-copy.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-list-copy.png
new file mode 100644
index 0000000000..ea210495fc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-list-copy.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-list-delete.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-list-delete.png
new file mode 100644
index 0000000000..aeba09b532
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-list-delete.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-list-search.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-list-search.png
new file mode 100644
index 0000000000..9313c8eb7e
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-list-search.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-select.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-select.png
new file mode 100644
index 0000000000..18bfb3be74
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild-select.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild.png
new file mode 100644
index 0000000000..cd1f0bda1c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphbuild.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-configure.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-configure.png
new file mode 100644
index 0000000000..91fa18814f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-configure.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-creategraph.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-deletegraph-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-deletegraph-button.png
new file mode 100644
index 0000000000..34a4efd42a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-deletegraph-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-editgraph-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-editgraph-button.png
new file mode 100644
index 0000000000..773798b78b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-editgraph-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-editgraph.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-editgraph.png
new file mode 100644
index 0000000000..f6cc706f41
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-editgraph.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-homepage.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-homepage.png
new file mode 100644
index 0000000000..c3af5618ed
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-homepage.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-selecttemplate.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-selecttemplate.png
new file mode 100644
index 0000000000..8a19d8da39
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-selecttemplate.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-statistics-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-statistics-button.png
new file mode 100644
index 0000000000..cdb25ed397
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-statistics-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-statistics-refresh-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-statistics-refresh-button.png
new file mode 100644
index 0000000000..e2ec35cbe1
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-statistics-refresh-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-statistics.png b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-statistics.png
new file mode 100644
index 0000000000..49db6e652f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/graphmanagement-statistics.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/login.png b/docs/docusaurus/versions/version-3.6.0/images/browser/login.png
new file mode 100644
index 0000000000..3f4109b059
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/login.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/pathquery-configuration.png b/docs/docusaurus/versions/version-3.6.0/images/browser/pathquery-configuration.png
new file mode 100644
index 0000000000..579a7d99ee
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/pathquery-configuration.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/pathquery-result.png b/docs/docusaurus/versions/version-3.6.0/images/browser/pathquery-result.png
new file mode 100644
index 0000000000..0cd90cad46
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/pathquery-result.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/pathquery-select.png b/docs/docusaurus/versions/version-3.6.0/images/browser/pathquery-select.png
new file mode 100644
index 0000000000..3c5d0f7751
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/pathquery-select.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-bookmark-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-bookmark-button.png
new file mode 100644
index 0000000000..9a6f73bf7c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-bookmark-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-bookmark.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-bookmark.png
new file mode 100644
index 0000000000..a93315ab17
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-bookmark.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-button.png
new file mode 100644
index 0000000000..cd00d7f3fe
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-download-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-download-button.png
new file mode 100644
index 0000000000..ec59f7a0ed
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-download-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-execute-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-execute-button.png
new file mode 100644
index 0000000000..6c38e68c62
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-execute-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-gqltips.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-gqltips.png
new file mode 100644
index 0000000000..bdabee92e7
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-gqltips.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-download.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-download.png
new file mode 100644
index 0000000000..48890083fa
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-download.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-downloadtxt.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-downloadtxt.png
new file mode 100644
index 0000000000..3554ef592c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-downloadtxt.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-fullscreen-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-fullscreen-button.png
new file mode 100644
index 0000000000..13925db74f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-fullscreen-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-fullscreen-close.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-fullscreen-close.png
new file mode 100644
index 0000000000..2a63926742
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-fullscreen-close.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-fullscreen.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-fullscreen.png
new file mode 100644
index 0000000000..2dcf0ca0b4
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-fullscreen.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-graph.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-graph.png
new file mode 100644
index 0000000000..9b3edecb5f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-graph.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-insert-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-insert-button.png
new file mode 100644
index 0000000000..8879b2c4bb
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-insert-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-insert.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-insert.png
new file mode 100644
index 0000000000..2cd23b6e84
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-insert.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-jsontxt.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-jsontxt.png
new file mode 100644
index 0000000000..5f265cfff1
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-jsontxt.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-jsonview.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-jsonview.png
new file mode 100644
index 0000000000..8a774f91c9
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-jsonview.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-list.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-list.png
new file mode 100644
index 0000000000..4692c49eca
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-result-list.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-schema-graph.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-schema-graph.png
new file mode 100644
index 0000000000..ccc9e3126b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-schema-graph.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-schema-list.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-schema-list.png
new file mode 100644
index 0000000000..3649b41272
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-schema-list.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-selectgql.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-selectgql.png
new file mode 100644
index 0000000000..1ea624b81f
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-selectgql.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-selectgraph.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-selectgraph.png
new file mode 100644
index 0000000000..6dc14e486d
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-selectgraph.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/query-view.png b/docs/docusaurus/versions/version-3.6.0/images/browser/query-view.png
new file mode 100644
index 0000000000..8d1884ad82
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/query-view.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-configure.png b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-configure.png
new file mode 100644
index 0000000000..166e54cb75
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-configure.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-creategraph.png b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-graphtab.png b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-graphtab.png
new file mode 100644
index 0000000000..0f7980bc46
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-graphtab.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-result.png b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-result.png
new file mode 100644
index 0000000000..2a2a59ce02
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-result.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-selectdemo.png b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-selectdemo.png
new file mode 100644
index 0000000000..7dda3f06b0
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/quickstart-selectdemo.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/role-add-button.png b/docs/docusaurus/versions/version-3.6.0/images/browser/role-add-button.png
new file mode 100644
index 0000000000..a4590ac431
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/role-add-button.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/role-add.png b/docs/docusaurus/versions/version-3.6.0/images/browser/role-add.png
new file mode 100644
index 0000000000..8f56b24bd7
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/role-add.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/role-delete.png b/docs/docusaurus/versions/version-3.6.0/images/browser/role-delete.png
new file mode 100644
index 0000000000..3c09e7caa8
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/role-delete.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/role-disable.png b/docs/docusaurus/versions/version-3.6.0/images/browser/role-disable.png
new file mode 100644
index 0000000000..eb2e355d58
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/role-disable.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/role-edit.png b/docs/docusaurus/versions/version-3.6.0/images/browser/role-edit.png
new file mode 100644
index 0000000000..7b5db6e48c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/role-edit.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/role-enable.png b/docs/docusaurus/versions/version-3.6.0/images/browser/role-enable.png
new file mode 100644
index 0000000000..40b7909289
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/role-enable.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/vertexquery-criteria.png b/docs/docusaurus/versions/version-3.6.0/images/browser/vertexquery-criteria.png
new file mode 100644
index 0000000000..b5f95c3d83
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/vertexquery-criteria.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/browser/vertexquery.png b/docs/docusaurus/versions/version-3.6.0/images/browser/vertexquery.png
new file mode 100644
index 0000000000..97aa28122b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/browser/vertexquery.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-1.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-1.png
new file mode 100644
index 0000000000..c7202ff3de
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-1.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-10.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-10.png
new file mode 100644
index 0000000000..d6ed55c8bc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-10.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-2.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-2.png
new file mode 100644
index 0000000000..6fc79fde54
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-2.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-3.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-3.png
new file mode 100644
index 0000000000..0e59f028c7
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-3.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-4.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-4.png
new file mode 100644
index 0000000000..b606ec8bb8
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-4.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-5.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-5.png
new file mode 100644
index 0000000000..18d5845ec1
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-5.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-6.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-6.png
new file mode 100644
index 0000000000..d939108e3b
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-6.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-7.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-7.png
new file mode 100644
index 0000000000..5c5d1800af
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-7.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-8.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-8.png
new file mode 100644
index 0000000000..5beb0628b3
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-8.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-9.png b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-9.png
new file mode 100644
index 0000000000..d04282d95a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/cloud-deployment-9.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/dingtalk.png b/docs/docusaurus/versions/version-3.6.0/images/dingtalk.png
new file mode 100644
index 0000000000..2a6576a0cd
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/dingtalk.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/htap-en.png b/docs/docusaurus/versions/version-3.6.0/images/htap-en.png
new file mode 100644
index 0000000000..85479ac1e1
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/htap-en.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/htap.png b/docs/docusaurus/versions/version-3.6.0/images/htap.png
new file mode 100644
index 0000000000..c7764a3fa7
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/htap.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/learn_flow_chart_en.png b/docs/docusaurus/versions/version-3.6.0/images/learn_flow_chart_en.png
new file mode 100644
index 0000000000..c9e55a52a5
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/learn_flow_chart_en.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/learn_flow_chart_zh.png b/docs/docusaurus/versions/version-3.6.0/images/learn_flow_chart_zh.png
new file mode 100644
index 0000000000..9977dcfb6c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/learn_flow_chart_zh.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/multi-level-Interfaces-en.png b/docs/docusaurus/versions/version-3.6.0/images/multi-level-Interfaces-en.png
new file mode 100644
index 0000000000..b7de07422c
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/multi-level-Interfaces-en.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/multi-level-Interfaces.png b/docs/docusaurus/versions/version-3.6.0/images/multi-level-Interfaces.png
new file mode 100644
index 0000000000..2c9694a476
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/multi-level-Interfaces.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-body-cypher1.png b/docs/docusaurus/versions/version-3.6.0/images/three-body-cypher1.png
new file mode 100644
index 0000000000..3f85fd8412
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-body-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-body-cypher2.png b/docs/docusaurus/versions/version-3.6.0/images/three-body-cypher2.png
new file mode 100644
index 0000000000..41f0f914cc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-body-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-body-cypher3.png b/docs/docusaurus/versions/version-3.6.0/images/three-body-cypher3.png
new file mode 100644
index 0000000000..4776f26d77
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-body-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-body-data.png b/docs/docusaurus/versions/version-3.6.0/images/three-body-data.png
new file mode 100644
index 0000000000..1913b39cbc
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-body-data.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher1.png b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher1.png
new file mode 100644
index 0000000000..4b5745b96d
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher2.png b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher2.png
new file mode 100644
index 0000000000..fef4592cf3
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher3.png b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher3.png
new file mode 100644
index 0000000000..c0790d5d7e
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher4.png b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher4.png
new file mode 100644
index 0000000000..49a6498d4a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher4.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher5.png b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher5.png
new file mode 100644
index 0000000000..5d3cc55cdf
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-cypher5.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-schema.png b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-schema.png
new file mode 100644
index 0000000000..24aebca93a
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/three-kingdoms-schema.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/tugraph-datax.png b/docs/docusaurus/versions/version-3.6.0/images/tugraph-datax.png
new file mode 100644
index 0000000000..c2968c0c38
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/tugraph-datax.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/wandering-earth-1.png b/docs/docusaurus/versions/version-3.6.0/images/wandering-earth-1.png
new file mode 100644
index 0000000000..955c565303
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/wandering-earth-1.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/wandering-earth-2.png b/docs/docusaurus/versions/version-3.6.0/images/wandering-earth-2.png
new file mode 100644
index 0000000000..9cb17764ed
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/wandering-earth-2.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/wandering-earth-3.png b/docs/docusaurus/versions/version-3.6.0/images/wandering-earth-3.png
new file mode 100644
index 0000000000..c6dabbec97
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/wandering-earth-3.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/wechat.png b/docs/docusaurus/versions/version-3.6.0/images/wechat.png
new file mode 100644
index 0000000000..b490b48afd
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/wechat.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/wechat_tech.png b/docs/docusaurus/versions/version-3.6.0/images/wechat_tech.png
new file mode 100644
index 0000000000..7307a12e38
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/wechat_tech.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/what-is-graph-en.png b/docs/docusaurus/versions/version-3.6.0/images/what-is-graph-en.png
new file mode 100644
index 0000000000..53d5ba05ca
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/what-is-graph-en.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/images/what-is-graph.png b/docs/docusaurus/versions/version-3.6.0/images/what-is-graph.png
new file mode 100644
index 0000000000..6f3aa196fa
Binary files /dev/null and b/docs/docusaurus/versions/version-3.6.0/images/what-is-graph.png differ
diff --git a/docs/docusaurus/versions/version-3.6.0/requirements.txt b/docs/docusaurus/versions/version-3.6.0/requirements.txt
new file mode 100644
index 0000000000..0201af0943
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/requirements.txt
@@ -0,0 +1,5 @@
+sphinx
+myst-parser
+sphinx-panels
+sphinx-rtd-theme
+breathe
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/.readthedocs.yaml b/docs/docusaurus/versions/version-3.6.0/zh-CN/.readthedocs.yaml
new file mode 100644
index 0000000000..5b91d3cd6c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/zh-CN/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/Makefile b/docs/docusaurus/versions/version-3.6.0/zh-CN/Makefile
new file mode 100644
index 0000000000..d0c3cbf102
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?=
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/make.bat b/docs/docusaurus/versions/version-3.6.0/zh-CN/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/1.guide.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/1.guide.md
new file mode 100644
index 0000000000..6be7576bc8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/1.guide.md
@@ -0,0 +1,35 @@
+# 文档地图
+
+> 这里是文档地图，帮助用户快速学习和使用TuGraph社区版。
+
+## 快速上手
+
+> 了解图技术和TuGraph：[什么是图](./2.introduction/1.what-is-graph.md)、[什么是图数据库](./2.introduction/2.what-is-gdbms.md)、[什么是TuGraph](./2.introduction/3.what-is-tugraph.md)、[TuGraph产品架构](./2.introduction/5.architecture.md)。
+
+> 快速开始体验TuGraph：[快速上手](./3.quick-start/1.preparation.md)、[影视场景Demo](./3.quick-start/2.demo/1.movie.md)、[可视化操作手册](./4.user-guide/1.tugraph-browser.md)。
+
+> 安装部署TuGraph：[云部署](./5.developer-manual/1.installation/5.cloud-deployment.md)、[Docker部署](./5.developer-manual/1.installation/3.docker-deployment.md)、[本地包部署](./5.developer-manual/1.installation/4.local-package-deployment.md)。
+
+> 启动及运行TuGraph：[数据库运行](./5.developer-manual/2.running/2.tugraph-running.md)、[从源码编译](./5.developer-manual/2.running/1.compile.md)、[数据预热](./5.developer-manual/3.server-tools/4.data-warmup.md)、[备份恢复](./5.developer-manual/3.server-tools/3.backup-and-restore.md)、[日志信息](./5.developer-manual/5.ecosystem-tools/4.log.md)。
+
+## 开发指南
+
+> 客户端：[C++](./5.developer-manual/4.client-tools/2.cpp-client.md)、[Java](./5.developer-manual/4.client-tools/3.java-client.md)、[Python](./5.developer-manual/4.client-tools/1.python-client.md)、[命令行](./5.developer-manual/4.client-tools/5.tugraph-cli.md)、[OGM](./5.developer-manual/4.client-tools/4.tugraph-ogm.md)。
+
+> 生态工具：[运维监控](./5.developer-manual/5.ecosystem-tools/1.monitoring.md)、[TuGraph-DataX](./5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md)、[TuGraph-Explorer](./5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md)。
+
+> 接口文档：[Cypher API](./5.developer-manual/6.interface/1.cypher.md)、[OLAP API](./5.developer-manual/6.interface/2.olap/1.tutorial.md)、[Procedure API (POG API)](./5.developer-manual/6.interface/3.procedure/1.procedure.md)、[RESTful API](./5.developer-manual/6.interface/4.protocol/1.restful-api.md)、[RPC API](./5.developer-manual/6.interface/4.protocol/2.rpc-api.md)。
+
+## 社区贡献
+
+> 在开始贡献前，可以先了解[如何贡献](./6.community-manual/1.contributing.md)
+
+> 如果想了解社区角色的划分，请访问[社区角色](./6.community-manual/2.community-roles.md)
+
+## 视频中心
+
+> [TuGraph快速上手](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph技术分享集合](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [3分钟读懂图计算](https://www.bilibili.com/video/BV15U4y1r7AW/)
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..4cbe4ce767
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,13 @@
+# 什么是图
+
+> 本文面向初学者，介绍图（Graph）的基本概念。
+
+我们今天介绍的图，是图论中使用点和边表示的图（Graph），而非图像的图（Image）。
+
+![alt what is graph](../../../images/what-is-graph.png)
+
+图的基本元素是点和边，其中点表示事物或实体，边表示点之间的关联关系。
+
+如上图左侧所示，点表示的有公司、员工、项目。边表示的是他们之间的关系，包括：公司和员工之间的雇佣关系，员工和员工之间的好友关系，项目和员工之间的参与关系。除此之外，点和边上可以附加属性，比如员工的工号，雇佣的时间，这样的图是属性图。也就是说，我们可以用图的方式来抽象地表示实体及其关联关系，图有非常丰富的表达能力。
+
+除了上述的员工图谱，图还可以用于金融、工业、医疗等各个领域。在实际应用中，图的规模越来越大，比如金融交易图，点边规模可能到达百亿，与其同时，基于图的查询通常会复杂，最典型的是K跳查询，每增加一跳访问的数据都呈指数增长。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..eeb4dfd11f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# 什么是图数据库
+
+> 本文主要介绍什么是图数据库，图数据库相比于关系型数据库的优势，以及两者特点的对比。
+
+## 1. 图数据库介绍
+
+图数据库是基于图模型的数据库。与关系型数据库相比，图数据库真正注重“关系”。图数据库的主要功能是管理图数据，因此需要支持高效的点、边查询和更新；为方便用户使用，通常还需要增加对事务（transaction）的支持，以确保并发操作下的正常运行。
+
+## 2. 图数据库相比较于关系型数据库的优势
+
+图数据库的功能是传统关系型数据库的扩展。与关系型数据库仅支持的“表结构”相比，图数据库所支持的“图结构”更为灵活。图数据库在基于图的增加、删除、查询和修改方面采用不同于其他数据库的设计。在图数据操作抽象上，采用基于点的视角，例如点通过其所有“出边”（从一个点出发，连接到其他点的边）访问其邻接点。这是图数据库系统设计的核心。
+
+图数据库的独特性体现在以下三个方面:
+
+### 2.1. 性能
+
+在关联关系处理上，使用关系型数据库不可避免地要使用表的JOIN操作，这会对性能产生较大影响；而图数据库则直接跳转访问类指针，操作关联数据的效率更高，比关系型数据库提高2到4个数量级的性能。
+
+### 2.2. 兼容性
+
+现实中，项目进程通常不断演变，数据的内容甚至数据格式也在不断变化。在关系型数据库中，这意味着表结构的变化或建立多个新表，对源数据的修改非常大。而在图数据库中，仅需添加新的点、边和属性，并将其设置为对应的类型即可。从本质上说，一个表代表一种类型的数据，一个点代表一个特定的数据。这意味着关系型数据库更关注数据类型，而图数据库更关注数据个体及其关联关系。
+
+### 2.3. 直观性
+
+使用图的方式表达现实世界的关系更直接和自然，在万物互联的时代尤为突出。如果使用关系型数据，先建立实体表，再建立关系表，最后映射数据，需要高度的抽象思维。在图数据上进行分析查询时，可以直观地通过点边连接的拓扑结构找到所需数据，无需任何专业知识。
+
+## 3. 图数据库与关系型数据库对比
+
+| 分类         | 模型   | 优势                                   | 劣势                                     | 举例           |
+| ------------ | ------ | -------------------------------------- | ---------------------------------------- | -------------- |
+| 关系型数据库 | 表结构 | 数据高度结构化，一致性强，软件成熟度高 | 面向多跳的关联关系查询低效或不支持       | MySQL、Oracle  |
+| 图数据库     | 图结构 | 针对关联关系的建模建模和操作效率非常高 | 高度结构化的数据处理能力不及关系型数据库 | Neo4j、TuGraph |
+
+总之，面对海量数据的存储和处理问题，传统的关系数据库已经无法满足大部分的日常数据存储需求。图数据库技术可以将关系信息存储为实体，灵活拓展数据模型。由于提供了对关联数据最直接的表达方式和图模型对异构数据的天然包容性，图数据库技术必将成为未来最热点的技术之一，为企业提供存储和分析大规模图数据的有力支持。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..a2808c9237
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,95 @@
+# 什么是TuGraph
+
+> 本文主要介绍TuGraph社区版的主要功能和特性，以及TuGraph企业版和社区版的差异。
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群，解决了图数据分析面临的大数据量、高吞吐率和低延迟等重大挑战，是蚂蚁集团金融风控能力的重要基础设施，显著提升了欺诈洗钱等金融风险的实时识别能力和审理分析效率，并面向金融、工业、政务服务等行业客户。
+
+## 2. TuGraph社区版
+
+2022年9月，TuGraph单机版开源，提供了完备的图数据库基础功能和成熟的产品设计，支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台。
+
+TuGraph社区版于2022年9月开源，提供了完整的图数据库基础功能和成熟的产品设计（如ACID兼容的事务、编程API和配套工具等），适用于单实例部署。社区版支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台，是学习TuGraph和实现小型项目的理想选择。
+
+## 3. TuGraph特性
+
+TuGraph是支持大数据量、低延迟查找和快速图分析功能的高效图数据库。TuGraph也是基于磁盘的数据库，支持存储多达数十TB的数据。TuGraph提供多种API，使用户能够轻松构建应用程序，并使其易于扩展和优化。
+
+它具有如下功能特征：
+
+- 属性图模型
+- 实时增删查改
+- 多重图（点间允许多重边）
+- 多图（大图与多个子图）
+- 完善的ACID事务处理，隔离级别为可串行化（serializable）
+- 点边索引、全文索引
+- 混合事务和分析处理（HTAP），支持图查询、图分析、图学习
+- 主流图查询语言（OpenCypher、ISO GQL等）
+- 支持OLAP API，内置30多种图分析算法
+- 基于C++/Python的存储过程，含事务内并行Traversal API
+- 提供图可视化工具
+
+在性能和可扩展性方面的支持：
+
+- 千万点/秒的高吞吐率
+- TB级大容量
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线的备份恢复
+
+## 4. 数据模型
+
+### 4.1. 图模型
+
+TuGraph是一个具备多图能力的强类型、有向属性图数据库。
+
+- 图项目：每个数据库服务可以承载多个图项目（多图），每个图项目可以有自己的访问控制配置，数据库管理员可以创建或删除指定图项目。
+- 点：指实体，一般用于表达现实中的实体对象，如一部电影、一个演员。
+    - 主键：用户自定义的点数据主键，默认唯一索引，在对应的点类型中唯一。
+    - VID：点在存储层自动分配图项目中的唯一ID，用户不可修改。
+    - 上限：每个图项目存储最多2^(40)个点数据。
+- 边：用于表达点与点之间的关系，如演员出演电影。
+    - 有向边：边为有向边。若要模拟无向边，用户可以创建两个方向相反的边。
+    - 多条边：两个点数据之间可以有多条边数据。当前TuGraph支持重复边，如要确保边边唯一，需要通过业务策略实现。
+    - 上限：两个点数据之间存储最多2^(32)条边数据。
+- 属性图：点和边可以具有与其关联的属性，每个属性可以有不同的类型。
+- 强类型：每个点和边有且仅有一个标签，创建标签后，修改属性数量及类型有代价。
+    - 指定边的起/终点类型：可限制边的起点和终点点类型，支持同类型边的起点和终点的点类型不同，如个人转账给公司、公司转账给公司；当指定边的起/终点类型后，可增加多组起/终点类型，不可删除已限制的起/终点类型。
+    - 无限制模式：支持不指定边的起点和终点的点类型，任意两个点类型间均可创建该类型的边数据。注：当指定边的起/终点类型后无法再采用无限制模式。
+
+### 4.2. 数据类型
+
+TuGraph支持多种可用于属性的数据类型。具体支持的数据类型如下：
+
+| **数据类型** | **最小值**          | **最大值**          | **描述**                            |
+| ------------ | ------------------- | ------------------- | ----------------------------------- |
+| BOOL         | false               | true                | 布尔值                              |
+| INT8         | -128                | 127                 | 8位整型                          |
+| INT16        | -32768              | 32767               | 16位整型                         |
+| INT32        | - 2^31              | 2^31 - 1            | 32位整型                         |
+| INT64        | - 2^63              | 2^63 - 1            | 64位整型                         |
+| DATE         | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" 格式的日期             |
+| DATETIME     | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD HH:mm:ss[.ffffff]" 格式的日期时间 |
+| FLOAT        |                     |                     | 32位浮点数                       |
+| DOUBLE       |                     |                     | 64位浮点数                       |
+| STRING       |                     |                     | 不定长度的字符串                    |
+| BLOB         |                     |                     | 二进制数据（在输入输出时使用Base64编码） |
+
+### 4.3. 索引
+
+TuGraph支持对点或边的属性创建索引，以提升查询效率。
+- 索引可以是唯一或非唯一索引。
+- 如果为点标签创建了唯一索引，在修改该标签的点时，会先执行数据完整性检查，以确保该索引的唯一性。
+- 每个索引都基于一个点或边的一个属性创建，可以对同一点或边的多个属性创建索引。
+- BLOB类型的属性不能建立索引。
+
+## 5. TuGraph企业版
+
+企业版对商业化功能支持更加完善，包括分布式集群架构，覆盖探索、研发、服务、运维管理全生命周期的一站式图平台，在线、近线、离线的图计算引擎，支持流式、大数据类数据源，多地多中心的部署形态，以及专家支持服务等。企业版是商业化解决方案的理想选择。
+
+如需商业支持，请联系我们：
+
+- 电话：400-903-0809
+- 邮件：tugraph@service.alipay.com
+- 官网：https://tugraph.antgroup.com
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..612c0430ad
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# 性能优先
+
+> 此文档主要介绍 TuGraph 性能优先的设计理念。
+
+## 1.简介
+
+TuGraph目前是世界上最快的图数据库，在图数据库标准评测LDBC SNB Interactive位居榜首（2023.3）。TuGraph的设计基于性能优先，致力于打造高性能的单机图数据库。该文档是TuGraph基于性能优先在存储层的核心设计。
+
+## 2.图操作的特性
+
+在属性图上的操作涉及读、写及其属性，对一些特殊的属性比如时间戳也访问模式也会影响到整体性能。这里通过对一些图操作特性的规律总结，来指导最终的性能。
+
+我们观察到很多图应用有类似的数据访问模式。例如，在信贷风险控制中，我们使用递归路径过滤搜索多对一模式，以找到可疑的信用欺诈用户和行为。针对网络赌博，可以通过识别短时间内的多笔资金转移，来发现涉赌的资金账号。股权穿透场景对实体间的股权关系进行递归计算。这些场景具有多跳实体和关系访问、时间窗口约束和读写事务等常见模式。
+更进一步，从介绍中的讨论和图负载的分析中，归纳出以下特征:
+
+**规律一** KHop是图中最典型的操作，它基于点和边的图拓扑的数据访问模式，和关系型数据库有着本质的区别。KHop 的典型性除了表现在数据访问模式不同，它同时也是图数据库最需要关注的性能点。
+
+**规律二** 图负载的数据访问在拓扑上有一定的局部性，同一个点的边通常会被同时访问。当这些边的标签相同时，有更大的概率会被同时访问。
+
+**规律三** 图负载在访问点边时，通常会访问其对应的属性，来作为遍历过滤的条件。
+
+**规律四** 在基于时序的图负载，对点边的过滤通常是在某个时间范围，比如最近的一周。
+
+**规律五** 写操作可能伴随着大量的读操作，需要在单个事务周期里处理。
+
+通过对实际线上图应用的分析，图负载的读写比率大约为 20:1，虽然场景局限在金融场景，集群数也有限，但涉及的数据规模和用户量非常庞大，具有一定代表性。20:1 的图负载读写比率，说明读工作负载对整体性能的影响更大， 而写工作负载的性能也不能忽视。
+
+## 3.存储数据结构
+
+TuGraph底层采用B+树来支持实时的增删查改事务。
+
+在排序树的数据结构中，B+树和LSM树为主要代表。B+树在树节点中使用拆分和合并式来更新排序数据，而 LSM 树在日志中追加更新，以进行延迟数据合并。B+ 早期用在文件系统的实现中，通过将数据保存 在自适应长度的叶子节点中，解决硬盘顺序操作和随机操作性能存在数据量级差别的问题，有较均衡的读写性能。LSM 树的主要优势使用 WAL(Write Ahead Log) 进行更新，将更新操作变成顺序操作，在键值较小时性能优势尤为突出。WAL 意味着将数据的更新合并推迟，批量更新能提升综合效率，也使得系统的调度变得复杂。如果更新合并完成前，恰好对其中的数据继续读取，LSM 树就需要读取几个层级局部合并的日志，会导致读取放大和空间放大，从而影响读效率。
+
+总结来说，B+ 树有较好的顺序读写性能，而 LSM 树在数据随机写方面占优。此外 LSM 树采用后台合并的方式，使得性能的波动难以预期，性能波动和上层存储和计算的关联性较弱，增加了整体设计的成本。综上考虑，TuGraph 选用 B+ 树作为读性能优先的实现。
+
+## 4.数据编码
+
+对于属性图模型而言，除了图拓扑编码外，属性数据也会很大程度影响功能和性能，我们先讨论属性数据如何与拓扑数据共存的编码格式。从目前的调研来看，属性编码有两种方式，我们称之为基于指针索引将属性数据单独存储的离散编码，和将属性数据和拓扑数据打包在一起的紧凑编码。离散编码根据程度的不同，可以每个属性都单独存储，或者每条边的属性打包后各自存储，下面的讨论对两种情况都适用。
+
+点查询。属性编码主要针对边，不涉及点查询。
+
+单边查询。离散编码通过指针定位边，紧凑编码则需要二分查找定位边的位置，离散编码有略微的优势。
+
+边遍历。离散编码在边遍历过程需要不断地进行指针跳转进行随机数据访问，而紧凑编码提前把数据排列在一起，顺序访问的特性使得效率大大提升。 由规律三知对边的遍历操作很普遍，紧凑编码在边遍历的优势明显。
+
+单边更新。离散编码对边的更新仅需找到对应的指针位置，插入数据后修改前后指针指向。紧凑编码则需要对紧凑排列的数据进行重编码，对整个边值进行重新写入，开销显著大于离散编码的情形。
+
+批量边更新。批量更新可以在内存中预先构建点的所有边属性，一次性编码写入，离散编码和紧凑编码相当。但紧凑编码不需要存储指针变量，更少的存储空间效率也会更高。
+
+以上离散编码和紧凑编码在某一类的查询的性能问题，可以通过优化的来缓解。整体上说，由于图负载读写 20:1 的特性，读性能在整体性能中占比更高。以及规律三所揭示的对属性访问的特征，TuGraph 更倾向于采用紧凑编码来保证读性能。其主要弱势为单边更新时重编码的开销，可以用自适应映射的技术来解决，
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..0e4b70768c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,34 @@
+# 多层级接口
+
+
+> 此文档主要介绍 TuGraph 的多层级接口的设计理念。
+
+## 1.简介
+
+多层级接口是 TuGraph 针对多丰富的使用场景，在易用性和高性中作出的平衡。比如描述式图查询语言 Cypher 能够抹去图数据库实现的细节，基于图模型的抽象来进行表达。Cypher 过于高层的表述，无法高效转化成底层的执行，因此提供了 Procedure API 的过程式语言，来发挥图数据库的最佳性能。
+
+接口可以大致分为客户端接口和服务端接口，大部分操作都在服务端完成，客户端只做数据的封装和解析。客户端和服务端通过网络连接，TuGraph 支持更加灵活的短连接 REST 协议，以及更加高效的长链接 RPC 协议，可根据不同的业务场景来选择。
+
+服务端接口均处在计算层，和图数据存储间用一层 Core API 在逻辑上隔开。
+
+![多层级接口架构](../../../../images/multi-level-Interfaces.png)
+
+### 1.1.客户端接口
+
+客户端接口指在客户端执行的接口，通常用于集成到软件应用中。TuGraph 的客户端的接口比较简单，包括登录登出、数据导入导出、存储过程加载调用、Cypher操作等。其中 Cypher 中集成了大部分的功能，包括数据操作、图模型操作、运维管理、账户管理等。
+
+由于 Cypher 的参数和返回值都是字符串，JAVA OGM 是对 Cypher 的结构化封装，即查询结果能够被封装为一个有类型的对象，方便使用。
+
+### 1.2.服务端接口
+
+服务端接口包括描述式图查询语言 Cypher、过程式图查询语言 Procedure API、图分析编程框架 OLAP API 和图神经网络编程框架 GNN PI，为图事务引擎、图分析引擎、图神经网络引擎提供服务，下面先展开介绍各个接口的特点。
+
+> __描述式图查询语言__ 是对查询逻辑的抽象描述，而与执行逻辑无关，对图数据库应用者比较友好，类比关系型数据库的 SQL 语言。TuGraph 的 Cypher 语言主要依照 Neo4j 开源的 OpenCypher 查询标准，同时对运维管理等辅助功能进行了扩展，在功能上囊括了 TuGraph 的大部分操作。描述式图查询语言会成为图数据库的主要数据操作方式，但由于描述到执行之间需要生成执行计划（Execution Plan），生成最优执行计划在学术界和工业界均有很长的路要走。
+
+> __过程式图查询语言__ 是为了解决描述式图查询语言与最优性能间的鸿沟。TuGraph的 Procedure API 是在 Core API 上做了一层简单的封装，C++ Procedure API的灵活性和高效性能够充分发挥存储的极致性能，也是 Cypher 优化的上限性能。Python Procedure API 是 C++ Procedure API 上的一层跨语言封装，翻译过程中值的拷贝会带来一定的性能损失，优势则主要是 python 语言本身的易用性。raversal API 是并行执行的 Procedure 接口，描述上更接近于集合的操作，比如扩展点集合所有出度邻居，获得一个新的点集。
+
+> __图分析编程框架__ 属于 ‘图计算系统’ 的范畴，会将图数据从支持增删改查的存储中导出快照，以更紧凑的数据存储格式来支持只读的复杂图分析，这里叫做OLAP API。OLAP API 封装了高并发执行的数据结构，包括 Vector、Bitmap等，以及基于 CSR 格式的图快照数据结构，然后提供一套并发的快速点边操作框架。在图分析任务完成后，数据可以通过接口写回图数据库。
+
+> __图神经网络编程框架__ 主要提供了图神经网络应用编程所需要的接口，能够对接PyTorch 等机器学习框架。TuGraph 的图神经网络编程框架主要集成了 DGL，在 Python 的语言环境中完成从图存储到图神经网络应用的完整流程。
+
+除了 Cypher 是解释执行外，其余服务端接口都是编译执行，即需要将对应代码传到服务端后，进行编译（可能会有时间开销），再在服务端执行。所以通常需要先加载，然后再已加载的应用列表中找到程序，传输入参数后执行
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/3.htap.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/3.htap.md
new file mode 100644
index 0000000000..16eff8e94f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> 此文档主要介绍 TuGraph 的HTAP的设计理念。
+
+## 1.简介
+
+![htap架构](../../../../images/htap.png)
+
+HTAP 的实现在架构上有多种不同的方式：一是用两个不同的副本来分别处理 OLTP 和 OLAP 的任务，核心是数据的一致性同步和额外的资源开销；二是在任何时候都使用同一份数据存储，该实现的数据结构存在内存膨胀，在工业化落地还需要进一步工作。在 TuGraph 的设计中，简单的 OLAP 操作和 OLTP 操作共用一份数据，而复杂的 OLAP 操作则单独导出快照处理。
+
+## 2.设计
+
+在 TuGraph 中，OLTP 为图事务引擎，在图 4.4对应事务操作；OLAP 为图分析引擎，对应简单图分析操作（比如 SPSP）和复杂图分析操作（比如 PageRank），前者可以直接在图存储上执行，而后者需要额外导出快照执行。
+
+- 事务操作，即图事务引擎测的操作，为局部图的增删查改操作，典型的应用为 K 跳访问 K-Hop。
+- 简单分析操作，是图分析引擎中较为简单的部分，通常也是局部的图分析操作，比如两点间最短路算法 SPSP、Jaccard 算法。
+- 复杂分析操作，是图分析引擎中较为复杂的部分，通常涉及全图的多轮数据迭代操作，比如网页排序算法 PageRank、社区发现算法 Louvain。
+
+如图 4.4所示，我们在架构图中增加了外部存储，使得图分析的数据源不局限在图数据库中，可以直接从文本文件读取。
+
+- 图存储，即图数据库中的存储，有精心设计的数据结构，能够完成实时增删查改。
+- 外部存储，可以是 RDBMS 或文本文件，以边表的简单方式存储，仅供一次性批量读取，和批量结果写入。在计算层，和整体架构图中的接口对应。
+- Cypher，描述式图查询语言，可以并发执行。
+- Procedure API，过程式图查询语言，其灵活性能够同时支持事务操作和图分析操作，但效率上不足以完成复杂图分析操作，可以并发执行。
+- OLAP API，针对多轮迭代的复杂图分析。应用需要先将存储中的图数据导出成内存中的一个快照，该快照仅用来快速访问，而不需要考虑 ACID 的写支持，因此可以排布地更加紧凑，CSR 排布的读效率要远高于图存储的数据排布。OLAP API 只能串行执行，每个操作都用满 CPU 资源。
+
+OLAP API 的快照可以从外部存储创建，即将边表数据构成件 CSR 的格式；或者从图存储中创建。需要注意的是，OLAP API 要求点的 ID 是连续的自然数，可能需要额外的 ID 映射，该步骤在创建快照时可以在指定一个属性进行映射，或直接取属性值作为 ID。
+
+与计算接口和存储相对应，有四种运行模式。
+
+- 事务模式，每个操作对应一条 Cypher 语句，默认是一个事务。
+- Plugin 模式，通过插件的方式，在计算逻辑加载到服务端后调用，也叫存储过程。
+- Embed 模式，和 Plugin 模式的使用接口一致，区别是图数据库服务不需要起来，就可以直接用接口调用数据库中的数据，通常用于调试 Procedure API 和OLAP API 的代码，调试信息和操作步骤比 Plugin 模式更加友好。
+- Standalone 模式，最大程度剥离与图数据库的关系，仅想用图分析引擎做数据分析时，该模式会比较直接。Standalone 模式会直接使用外部存储的数据。
+
+图神经网络引擎的使用方式和 ‘复杂图分析操作’ 类似，会同时调用部分 OLAP API 和 GNN API，不在这里展开。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/index.rst
new file mode 100644
index 0000000000..853243ed8c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/4.characteristics/index.rst
@@ -0,0 +1,10 @@
+产品特点
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
+    
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/5.architecture.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/5.architecture.md
new file mode 100644
index 0000000000..cf901d31cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/5.architecture.md
@@ -0,0 +1,15 @@
+# TuGraph产品架构
+
+> 此文档主要介绍 TuGraph 的产品架构。
+
+## 1.简介
+
+![产品架构](../../../images/architecture.png)
+
+上图从功能模块的角度，以 TuGraph 为例，给出了企业级图数据库的整体架构，自下而上包括：
+
+- 软硬件环境。涉及图数据库的开发和使用环境。TuGraph 主要基于底层的 C++语言开发，能够兼容市面上大部分操作系统和 CPU。
+- 存储层，包括 KV 存储层和图存储层。存储层需要支持计算层所需的各个功能。
+- 计算层。计算层应包括图事务引擎、图分析引擎和图神经网络引擎，也包含了服务端提供的多种编程接口，包括描述式查询语言 Cypher，存储过程等。
+- 客户端。客户端 SDK 应支持 Java、Python、C++ 等多种语言，也支持命令行的交互方式。Browser 和 Explorer 通过网页端交互的方式，降低了图数据库的使用门槛。
+- 在生态工具方面，覆盖了企业级图数据库的开发、运维、管理等链路，提升可用性。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/6.functionality.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/6.functionality.md
new file mode 100644
index 0000000000..934032187e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/6.functionality.md
@@ -0,0 +1,112 @@
+# 功能概览
+
+> 此文档主要介绍 TuGraph 的主要功能和特性。
+
+## 1.安装部署
+
+## 1.1.部署方式
+
+TuGraph目前提供云部署、Docker部署以及安装包部署三种部署方式，用户可根据实际情况选择适合的部署方式。
+
+## 1.2.软硬件环境
+
+TuGraph核心是由C++开发，默认使用的编译器为GCC8.4，使用c++14标准。部分功能使用了其他编译器，比如全文索引的实现基于ApacheLucene，采用JNI接口需要Java编译器。此外，存储过程中额外提供了Python Procedure API，该功能需要Python环境。TuGraph不需要特殊的硬件比如GPU，对RDMA、HBM等高延迟低带宽的通用硬件升级可以天然适配。
+
+TuGraph测试过基于X86和ARM的CPU，包括Intel、AMD、Kunpeng、Hygon、飞腾等，也同时在多个操作系统上运行，包括Ubuntu、CentOS、SUSE、银河麒麟、中标麒麟、UOS的主流版本，对操作系统和CPU没有特殊的要求。
+
+软硬件环境也包括依赖库的环境，由于TuGraph的存储层中默认的KV存储是LMDB，需要文件系统能够支持POSIX接口。在不同的环境下编译和参数配置会略有不同，比如在图存储的点边数据打包中，应和操作系统的页表大小匹配，默认为4KB，建议将系统的页表大小也设置为4KB。
+
+## 2.存储层
+
+在图数据模型上，TUGraph支持属性图模型，按照层次可以分为子图、标签（包括点标签和边标签）、属性。从存储层看，TuGraph使用使用直观的多层的树状模型，没有跨子图的标签，也没有跨标签的属性，仅保留图模型的核心逻辑。
+
+在子图的存储上，TuGraph对多图做了数据的物理隔离，每个图对应一个LMDB的实例。多图的元数据描述信息，保存在meta的特殊的公共LMDB实例中。点边标签及其属性的存储，通过将图数据自适应地映射到KV键值对，最大程度发挥读性能。同时在KV层实现了多线程写，解决了LMDB写性能较低的劣势。主键索引和二级索引，对应LMDB中B+的表，支持基于比较的索引值增删查改。
+
+存储层还保留了一些其他非核心功能的数据，包括权限数据、预编译的插件数据、监控数据等。
+
+## 3.计算层
+
+计算层在功能上分成三个部分，包括TP类的图事务引擎，AP类的图分析引擎和图神经网络引擎。
+
+- __图事务引擎__，主要用来处理并发的图操作，包括单点查询、邻居查询、路径遍历。图事务引擎侧重并发操作的ACID事务，确保操作逻辑不会互相干扰，主要性能指标为 QPS，即每秒完成的查询数量。
+
+- __图分析引擎__，操作类型通常为全图迭代。部分简单的分析任务（比如SPSP）可以由图事务引擎完成，复杂的分析任务均由图分析引擎完成，单个任务通常需要数秒至数小时。因此单个图分析任务要并发利用所有的硬件资源，性能指标为任务完成的总时长。
+
+- __图神经网络引擎__，通常也为全图迭代。图神经网络引擎除了基于图拓扑的操作，也需要集成一个机器学习的框架来处理向量操作，比如 PyTorch、MXNet、TenserFlow。
+
+三个引擎的操作逻辑不尽相同，独立配置资源池。事图事务引擎基于RPC操作设置了一个线程池，每接受客户端的一个操作，从线程中取一个线程来处理，并发执行的数量等于RPC线程池的容量，通常配置为服务器的核数。图分析引擎有一个分析线程池，每个图分析任务会并发执行，即用所有的线程来执行一个任务，来加速操作的性能。TuGraph图分析操作串行执行的特性会一定程度限制用户的使用体验，并发的图分析的需求可以通过高可用部署的方式，增加机器资源来处理，或者接入外部的任务调度器，将数据传到实时调度的容器来计算。图神经网络操作在图上的操作会复用图事务引擎或图分析引擎的资源，向量的操作会起单独的资源，在机器学习框架中可以使用GPU等单独的加速硬件。
+
+## 4.核心功能
+
+### 4.1.查询语言
+
+TuGraph 提供 Cypher 图查询语言，遵循OpenCypher标准。
+- __支持Procedure嵌入__
+
+- __可插拔优化框架__ 各类优化功能
+
+- __可扩展安全性检查框架__ 对于cypher进行
+
+### 4.2.存储过程
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个 REST 请求并在客户端完成整个
+处理流程的方式，TuGraph 提供的存储过程（Procedure）是更简洁和高效的选择。
+
+从 3.5 版本开始，TuGraph 重新设计了新的存储过程编程范式，支持定义标准的签名和结果，支持POG编程。
+
+TuGraph 支持 POG (Procedres on Graph Query Languages) 编程和 POG 库，其中“Graph Query Languages”包含 Cypher 以及
+制定中的 ISO GQL 等图查询语言。POG 库提供在查询语言中对用户定义的存储过程的访问，打破了查询语言和存储过程之间的界限，扩展了查询
+语言的使用范围。
+
+> 这个文档描述了 [新的 Procedure 编程范式以及 POG](../5.developer-manual/6.interface/3.procedure/1.procedure.md)。
+
+### 4.3.数据导入导出
+
+尽管TuGraph本身支持数据的插入，但批量导入能够大幅提升的效率。导入的功能可以分为空库导入（离线导入）和增量导入，前者指子图是空的时候进行导入，额外的假设能够大幅提升导入的性能，在 TuGraph 中，空库导入和增量导入的吞吐率差了10 倍。在数据导出中，需要考虑导出数据的一致性，即是基于一个快照数据导出的。
+
+TuGraph 可以通过 命令行工具`lgraph_export` 来对已经存放在TuGraph的图数据进行数据导出，导出格式支持CSV和JSON。
+
+### 4.4.备份恢复
+
+TUGraph的备份在功能上可分为主动/定时、离线/在线、全量/增量备份，用尽量小的存储和计算代价来完成备份。恢复功能可以恢复到最新的状态，或者历史标注的时间点，需要保证数据库是一致的状态。
+
+### 4.5 数据预热
+
+TuGraph 是基于磁盘的图数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+### 4.6 高可用
+
+高可用是指通过通过集群配置，做到实时多副本数据热备，在部分副本不用时，集群仍然能正常提供服务，TuGraph采用 RAFT 协议的多机热备机制，能够将 RPO 降低到接近 0 的程度。TuGraph 选择在计算层进行数据同步，同步的对象是写操作，通过 RPC 接口快速同步。TuGraph 的高可用集群采用主从模式，只有主节点处理写请求，主从节点均能处理读请求。主节点的写请求处理需要同步到多于二分之一的总节点上，多数节点写成功，该写请求才算完成。
+
+## 5.客户端工具
+
+客户端主要分为各种编程语言的SDK，OGM以及命令行工具。
+
+客户端 SDK 主要用于二次开发，可以通过 RPC 或 REST 协议链接服务端。RPC 基于长链接有较好的性能，数据需要通过 protobuf 统一序列化。TuGraph 使用brpc，支持 Java、Python、C++ 的 rpc 客户端。REST 的协议比较宽泛，能够简单适配更加多样的环境，不同的编程语言能够简单对接。TuGraph 给出了 Python 的REST 客户端实例，命令行的交互也是用 REST 实现。
+
+OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。
+
+命令行工具`lgraph_cypher`是查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+
+## 6.生态工具
+
+生态工具是企业级数据库一个非常重要的组成部分，丰富的生态工具能够大大提升图数据库的可用性，稳定性。
+
+### 6.1.TuGraph DataX
+
+![导入导出](../../../images/tugraph-datax.png)
+
+TuGraph 核心支持 CSV 和 JSON 合适的导入导出，提供空库导入和增量导入的模式。实际中会存在 MySQL、Kafka、Hive 等多数据源导入的需求，TuGraph 通过 DataX 做多数据源的对接。由于关系模型和图模型存在的差异，数据清洗的流程可以使用 SparkSQL 快速处理，TuGraph 本身仅关注 CSV 和 JSON 的简单场景导入可靠性和性能。
+
+### 6.2.可视化交互
+
+TuGraph Browser 是面向图数据库直接使用者的可视化交互界面，功能上覆盖了 TuGraph 的绝大部分能力，包括数据导入、图模型建立、数据增删查改、监控运维等操作链路。
+
+TuGraph Explorer 则是面向图业务方，更侧重业务逻辑。Explorer 是基于Graph Insight的零代码编程框架生成的可视化交互界面，可以比较方便地添加业务更加友好的交互元素，把图作为一个底层的理解形象的展现出来。
+
+### 6.3.运维监控
+
+TuGraph 使用 Prometheus 加 Grafana 的监控框架，采用松耦合的方式。Prometheus 从 TuGraph 的监控接口获取监控信息，存储在本地时序数据库中，然后通过 Grafana 在网页端交互展示。
+
+TuGraph 提供的监控的状态包括图数据库的状态和服务器的状态，前者包括读写负载、点边数量等数据库端的状态，后者包括内存、CPU、硬盘等服务器的实时状态。如果某些监控状态超过了预期的阈值，就需要主动告警，通常需要对接其他运维管控系统，比如群消息、邮件告警等。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/7.scenarios.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/7.scenarios.md
new file mode 100644
index 0000000000..4cc5c0c10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/7.scenarios.md
@@ -0,0 +1,61 @@
+# 应用场景
+
+> 此文档主要介绍图数据库适用的应用场景。
+
+## 1. 金融领域
+
+金融领域的实体主要涉及人、公司、账户、产品等，它们之间的关系包括交易关系、登录关系、股权关系、雇佣关系等。这些实体构成了一张金融图数据网络。应用图数据库，我们可以从金融图数据网络里发掘出大量有用信息，帮助我们做出更准确的金融决策。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|贷款审核|通过分析申请人的关联关系、交易情况等辅助判断申请人的偿还能力和偿还意愿，可应用于零售贷款审核、小微贷款审核、供应链金融等。此方法可与传统的基于申请人自身信息的审核机制互补，在个体信息录覆盖较低的小微贷款审核中尤其有用。|
+|贷后管理|通过分析借款人交易情况，辅助分析借款人是否有逾期风险。相比于传统只在贷款资金流向特定用户的情况下发出警报的方式不同，该方法可以给每个账户赋予一个风险值，并在贷款流向高风险账户时给出预警。|
+|失联修复|通过分析失联贷款人的社交和购物数据，找出其它联系方式。该方法可以大幅改进失联修复率。|
+|担保环检测|可在担保关系图中找出环状、链式、家族式、交叉等特殊担保结构，揭露潜在风险。相比于关系型数据库的JOIN方法，基于图算法的方案更高效，可以检测出任意长的担保环，且可以实现更复杂限定条件的检测。|
+|信用卡团伙欺诈检测|构建信用卡申请信息中的地址、联系方式等关系网络，在申请关系网络中运行社区发现算法，可以检测出疑似欺诈的团伙，从而拒绝涉嫌欺诈的申请件，减少经济损失。|
+|反洗钱|通过交易网络和介质网络，找出疑似洗钱的行为和链路。洗钱是一个复杂的多方参与的过程，通过在交易和社交网络中进行图分析，我们可以更精准的检测出洗钱行为。|
+|车险反欺诈|针对有修理厂参与的骗保行为，通过分析被保人、案件地点和修理厂之间的关系，可以更精准的识别出骗保行为，减少经济损失。|
+
+## 2. 工业领域
+
+在生产和制造过程中会产生大量异构数据，如何有效的组织和管理这些数据是工业大数据中最重要的问题之一。这些数据包括设计文档、设备数据、仿真方案和结果、实验结果、经验文档等，关系错综复杂。传统的数据管理系统只能累积数据，而查找相关材料则往往力不从心。使用图模型，将这些不同类型的数据组织成一张网络，就可以方便地浏览和查找数据。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|供应链管理|供应链数据主要关心产品—部件—零件的对应关系、零件与供应商的对应关系、零件中的敏感成分等。相比于传统的物料管理（BOM）系统，使用图数据库的方案可以更方便地维护多个部件层次、多个供应商级别的复杂网络，从而为穿透式供应链提供基础支持。|
+|文档管理|使用图数据库可以将不同类型的文档按不同关系有机地组织在一起。例如将部件设计文档、部件—零件关系、部件测试文档、相关经验文档等组织起来，在需要查找时就可以方便获取该部件的所有相关信息。|
+|研发过程管理|产品研发和验证过程中需要进行大量仿真、试验和测试，每一个测试流程都会涉及大量不同的步骤。步骤之间的连接关系、每个步骤中使用的数据版本、算法版本等就构成了一张复杂的关系网络。使用图数据库可以更好管理这个关系网络，从而为研发过程中的数据复用、流程改进提供良好基础。|
+|设备信息管理|制造业需要管理大量设备，设备之间又互相关联（供电关系、供料关系、空间关系），从而形成了一张复杂的网络。传统的数据库很难体现这种复杂关系。而使用图数据库则可以便捷表示这些关系，从而更好的管理设备信息。|
+
+## 3. 智慧城市
+
+随着科技的发展，城市的智能化管理已成为一个大趋势。智能化管理需要建立在良好的信息管理平台之上，因此需要强大的系统软件做支撑。在智能化城市管理系统中，智能化决策系统需要基于大量不同信息做出决策，这些信息包括各种拓扑信息（道路、管线），供求信息（电力输送、饮用水供应、污水排放），环境信息（温度、湿度、雨量）等。要将这些复杂的异构数据有机管理起来，并基于它们做出决策，就需要一个成熟的系统。传统的数据管理系统基于关系数据模型，并不适合管理这种复杂异构数据。而使用图模型就可以很好的解决这一问题。如果我们将这些不同的数据利用图数据库进行管理，就可以实现很多复杂的智能管理场景。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|智能交通|基于道路拓扑、道路容量及当前流量，可以进行智能信号灯调度，从而提高通行效率。|
+|智能排水|基于排水系统信息及当前雨量，可以对排水系统进行调度，从而减少内涝的产生。|
+|管线管理|将管线的生产、安装、拓扑信息，以及历史状态信息有机组织起来，可以帮助我们对管线进行全周期管理，包括故障排查、寿命评估等。|
+|人群疏散|大量人群需要疏散时，需要考虑公交、地铁、出租车、共享单车等多种交通方式，同时还需要考虑道路承载量。使用图数据库将这些信息有机整合在一起，可以帮助我们更好的做出决策，以便为大型公共活动提供更好的支持。|
+
+## 4. 社会治理
+
+社会治理包括公共安全、法律事务、舆论、网络安全等多方面。社会治理是一个综合性的、多系统联动问题。它需要综合大量数据、全局考量才能做出更好的决策。在这种多维度复杂数据问题上，图数据模型可以提供更好的适应性，从而为智能化的社会治理决策平台提供坚实的基础。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|犯罪团伙发现|合谋团伙必然会通过某些方式产生联系，这种联系包括面谈（出现在同一地点）、电话联系、或者互联网联系，他们还可能有经济往来。如果我们将这些数据统一存放在一张图中，我们就可以通过图分析算法查找出联系紧密的群体，从而发现和识别整个犯罪团伙。|
+|涉众案件调查|涉众案件，特别是涉众经济案件往往涉及大量的人员和要素（货币、地点、事件等）。如何有效的组织这些资料，从而为办案提供证据支持是涉众案件调查的一个难点。使用图数据库来存储和分析这些资料，可以让我们快速定位资料、分析人员构成、为案件调查提供更好的技术支持。|
+|违法网站甄别|违法网站、钓鱼网站、黄色网站等往往通过使用不同的域名和IP来避免被封杀。基于黑名单的过滤方法只能封禁已知的违法网站，无法对新出现的域名和IP进行有效甄别。基于IP—域名网络的映射关系，我们可以建立一张图，然后通过图计算建立起域名和IP的“可信度”模型，利用该模型来判断网站是否属于违法网站。|
+|法院卷宗管理|卷宗往往错综复杂，不同的案件之间可能通过当事人产生联系，也可能通过案发地、案件性质、审判人员等产生联系。这些联系构成了一张复杂的网络。使用图数据库我们可以更方便的管理这些复杂关系，提高办案和查询效率。|
+
+## 5. 互联网
+
+人—人关系的社交网络、人—商品的购买关系都能构成图。通过分析这些网络数据，我们可以为用户提供更优质的服务，包括相关推荐、用户信息归集、重要用户识别、垃圾用户识别等。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|ID映射|图数据库可以将用户相关的所有信息，包括用户之间的关系统一存储在一个数据库中，同时还能通过这些关系来找出疑似单人多号和多人一号的情况，从而为后期的风控、推荐等业务提供决策支持。|
+|好友推荐|基于分析社交网络，我们可以提供“好友的好友”，“共同好友”等好友推荐。|
+|商品推荐|基于用户—商品关系图，我们可以找出兴趣爱好类似的用户，向他们推荐类似用户选择的其他商品。|
+|垃圾用户识别|传统的垃圾用户识别主要基于用户账号本身的信息，如注册信息、发帖信息等，但是这些信息都比较容易伪造。而基于网络的信息则不存在这个问题：它们很难被伪造。因此基于网络信息的垃圾用户识别可以更加精准和高效。|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/8.glossary.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/8.glossary.md
new file mode 100644
index 0000000000..5171d5ece8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/8.glossary.md
@@ -0,0 +1,38 @@
+# 名词解释
+
+## 1.图技术
+
+> __图计算__：广义图计算，技术上包括图查询、图分析、图学习；狭义图计算，包括图计算任务和图分析。
+
+> __图查询__：指图数据库的查询能力，通常通过Cypher/ISO GQL等查询语言实现。
+
+> __图分析__：侧重于对全图数据的算法分析、模式分析等。
+
+> __图学习__：与图神经网络、图机器学习含义相同。
+
+> __图智能__：等于广义图计算，包括图数据库、图分析、图学习，通常用于概念推广，不用于产品。
+
+## 2.图产品
+
+> __图计算系统__：一般包括图数据库、图分析系统、图学习系统，有时也特指图分析系统。
+
+> __图数据库__：侧重于对图数据的增删改查、事务性操作等，如TuGraph DB、Neo4j、JanusGraph等。
+
+> __图分析系统__：解决图分析问题，可以细分为流水图分析、离线图分析，如TuGraph Analytics、GraphX等。
+
+> __图学习系统__：解决图学习问题，比如TuGraph Learn、DGL等。
+
+## 3.具体概念
+
+
+> __Vertex__：点，也叫顶点，也指 Vertex Value。尽量避免Node（结点、节点）的叫法，一般用Node表示服务器个数，容易叫混。结点指结合、交结、交叉的意思；节点可以指一个时间线上的里程碑（关键节点）或计算机系统里的一个处理实体（如计算机网络里的一台服务器）。
+
+> __Edge__：边，也指 Edge Value。
+
+> __Vertex Label__：点类型，也叫 Vertex Type。
+
+> __Edge Label__：边类型，也叫 Edge Type。
+
+> __Degree__：度，入度/出度，表示一个点的入边、出边的条数。注意，在非图论的场景中，往往把“跳”也称作“度”。
+
+> __Hop__：跳，表示一个点到另一个点之间的路径经过的点数（不含起点、含终点）。算法性能测试里K-Hop即为此义。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/index.rst
new file mode 100644
index 0000000000..3346808f92
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/2.introduction/index.rst
@@ -0,0 +1,16 @@
+TuGraph入门
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.characteristics/index.rst
+   5.architecture
+   6.functionality
+   7.scenarios
+   8.glossary
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..94a84fd721
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/1.preparation.md
@@ -0,0 +1,85 @@
+# 快速上手
+
+> 此文档主要用于新用户快速上手，其中包含了 TuGraph 的简介、特征、安装和使用。
+
+## 1.简介
+
+TuGraph 是蚂蚁集团自主研发的大规模图计算系统，提供图数据库引擎和图分析引擎。其主要特点是大数据量存储和计算，高吞吐率，以及灵活的 API，同时支持高效的在线事务处理（OLTP）和在线分析处理（OLAP）。 LightGraph、GeaGraph 是 TuGraph 的曾用名。
+
+主要功能特征包括：
+
+- 标签属性图模型
+- 支持多图
+- 完善的 ACID 事务处理
+- 内置 34 图分析算法
+- 基于 web 客户端的图可视化工具
+- 支持 RESTful API 和 RPC
+- OpenCypher 图查询语言
+- 基于 C++/Python/Java 的存储过程
+- 适用于高效图算法开发的 Traversal API
+
+性能及可扩展性特征包括：
+
+- TB 级大容量
+- 千万点/秒的高吞吐率
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线备份
+
+
+### 1.1.支持的平台
+
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的的平台。
+
+### 1.2.硬件要求
+
+_目前我们建议用户使用 NVMe SSD 配合较大的内存配置以获取最佳性能。_
+
+| 硬件     | 最低配置  | 建议配置                 |
+| -------- | --------- | ------------------------ |
+| CPU      | X86_64    | Xeon E5 2670 v4          |
+| 内存     | 4GB       | 256GB                    |
+| 硬盘     | 100GB     | 1TB NVMe SSD             |
+| 操作系统 | Linux 2.6 | Ubuntu 18.04, CentOS 7.3 |
+
+## 2.安装
+
+TuGraph 可以通过 Docker Image 快速安装，或者通过 rpm/deb 包本地安装。另外TuGraph在阿里云计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。
+
+> 安装包下载：官网下载地址[TuGraph DownLoad]( https://www.tugraph.org/download )。
+
+> 镜像下载：镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用；或者直接拉取镜像，如下文所示。
+
+> 计算巢部署：可以在阿里云计算巢自行搜索，也可以通过[部署链接]( https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true )快速访问。
+
+### 2.1.通过docker快速体验
+
+1. 本地安装 docker 环境
+
+   参考 docker 官方文档：https://docs.docker.com/get-started/
+
+2. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. 启动docker
+   ```shell
+   docker run -d -p 7070:7070 -p 9090:9090 --name tugraph_demo tugraph/tugraph-runtime-centos7 lgraph_server
+   # 7070是默认的http端口，web访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   ```
+
+4. web 访问
+
+   `http://x.x.x.x:7070`
+
+   > 默认用户名为 `admin`，密码为 `73@TuGraph`
+
+5. 手动启动方式
+   ```shell
+   docker run -dt -p 7070:7070 --name tugraph_demo tugraph/tugraph-runtime-centos7
+   docker exec -it tugraph_demo bash
+   # 进入docker环境后执行如下命令启动服务
+   lgraph_server -d start
+   ```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..b8dd8d03ec
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# 影视场景Demo
+
+> 此文档主要介绍 影视场景Demo 的使用方法。
+
+## 1.建模和数据导入
+
+完成登录后，点击`新建图项目`，选择movie数据，填写图项目配置，系统会自动完成Movie场景图项目创建。或者直接使用产品自带的movie图项目（带有官方图标）。
+
+Movie 场景图：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| 标签          | 类型  | 说明                                  |
+|-------------|-----|-------------------------------------|
+| movie       | 实体  | 表示某一部具体的影片，比如"阿甘正传"。                |
+| person      | 实体  | 表示个人，对影片来说可能是演员、导演，或编剧。             |
+| genre       | 实体  | 表示影片的类型，比如剧情片、恐怖片。                  |
+| keyword     | 实体  | 表示与影片相关的一些关键字，比如"拯救世界"、"虚拟现实"、"地铁"。 |
+| user        | 实体  | 表示观影的用户。                            |
+| produce     | 关系  | 表示影片的出品人关系。                         |
+| acted_in    | 关系  | 表示演员出演了哪些影片。                        |
+| direct      | 关系  | 表示影片的导演是谁。                          |
+| write       | 关系  | 表示影片的编剧关系。                          |
+| has_genre   | 关系  | 表示影片的类型分类。                          |
+| has_keyword | 关系  | 表示影片的一些关键字，即更细分类的标签。                |
+| rate        | 关系  | 表示用户对影片的打分。                         |
+
+## 2.查询示例
+
+### 2.1.示例一
+
+查询影片 'Forrest Gump' 的所有演员，返回影片和演员构成的子图。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.示例二
+
+查询影片 'Forrest Gump' 的所有演员，列出演员在影片中扮演的角色。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.示例三
+
+查询 Michael 所有评分低于 3 分的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.示例四
+
+查询和 Michael 有相同讨厌的影片的用户，讨厌标准为评分小于三分。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.示例五
+
+给 Michael 推荐影片，方法为先找出和 Michael 讨厌同样影片的用户，再筛选出这部分用户喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.示例六
+
+查询 Michael 的好友们喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.示例七
+
+通过查询给'Forrest Gump'打高分的人也喜欢哪些影片，给喜欢'Forrest Gump'的用户推荐类似的影片。
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..c39e48f40d
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,62 @@
+# 场景：流浪地球
+
+> 此文档主要介绍 流浪地球 demo的使用方法。
+
+## 1.Demo场景设计
+
+Demo背景基于流浪地球1、流浪地球2的故事背景进行设计
+
+- 基于剧情，设计了图结构，包含组织、角色、天体与设施3类点，事件、关系两类边
+- 根据剧情准备了对应Schema的数据
+- 准备了一些query，提出一些关于剧情的问题
+
+## 2.目录结构
+
+- rawdata: 原始剧情数据和schema定义文件
+- case.cypher: 查询相关的Cypher语句
+- control.sh: 控制TuGraph Server启动停止的脚本
+- lgraph_standalone.json: TuGraph Server启动的配置文件
+
+## 3.使用说明
+
+前置条件：TuGraph已安装
+
+## 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择流浪地球数据，填写图项目配置，系统会自动完成流浪地球场景图项目创建。
+    - 或者直接使用产品自带的流浪地球图项目（带有官方图标）。
+
+## 5.Cypher查询
+
+参考cypher文档，在TuGraph的Web页面前端输入Cypher进行查询
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.查询展示
+查询木星危机的所有事件经过
+
+```
+MATCH (n)-[e:事件关系]-(m) where e.title='木星危机' RETURN n,e
+```
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+查询所以危机的相关事件经过
+
+```cypher
+MATCH (n)-[e1]-(m)-[e2]-(p)
+where e1.title REGEXP ".*危机" and e2.title REGEXP ".*危机" and e1.title <> e2.title
+RETURN n,e1,e2,p
+```
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..13d98b4db8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# 场景：三体
+
+> 此文档主要介绍 三体 demo的使用方法。
+
+## 1.Demo场景设计
+Demo背景基于三体1、三体2、三体3的故事背景进行设计。
+
+根据三体故事的设定，我们设计了4类点和6类边，点包括“人物”、“组织”、“计划”、“时间线”，边包括“人物-人物关系”、“人物-计划关系”、“人物-组织关系”、“组织-计划关系”、“组织-组织关系”。
+根据剧情准备了对应Schema的数据，准备了一些query，提出一些关于剧情的问题。
+
+## 2.目录结构
+rawdata: 原始剧情数据和schema定义文件。
+case.cypher: 查询相关的Cypher语句。
+control.sh: 控制TuGraph Server启动停止的脚本。
+lgraph_standalone.json: TuGraph Server启动的配置文件。
+
+## 3.使用说明
+
+前置条件：TuGraph已安装。
+
+### 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三体数据，填写图项目配置，系统会自动完成三体场景图项目创建。
+    - 或者直接使用产品自带的三体图项目（带有官方图标）。
+
+### 5.Cypher查询
+
+参考TuGraph文档，在TuGraph的Web页面前端输入Cypher进行查询。
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![data](../../../../images/three-body-data.png)
+
+### 7.查询展示
+
+#### 7.1.人物关系查询
+三体一剧情中，一开始全世界各地发生了大量科学家自杀事件，引起了警方重视，查案过程根据人物关系线索一步步排查，就如上面的图所示，随着线索越来越多，背后的真相逐步浮出水面。史强和汪淼发现大多数人都和叶文洁有着直接或者间接的联系，并派汪淼卧底，最终发现叶文洁的最终统帅身份。在图中也可以看出，叶文洁顶点周围有很多边关系（一度或二度邻居很多）。
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.邻域顶点分析
+三体中的各种计划比较多，有的时候可能会被绕晕，这时候我们可以通过图的邻居顶点查询来查看该计划的相关人物和组织等。如"面壁计划"中,我们可以看到有四位人物与之相关，这四位也是被世人所寄予厚望的“面壁者”。
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.查询a节点和b节点的共同邻居
+我们往往希望知道两个人物之间的共同关联的人物都有谁，这样就能很快的掌握这两个人物之间的关系，在大数据量的情况下，使用cypher进行图关系分析就很方便！
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.设置/更改属性
+随着剧情推进，我们逐步了解了"叶文洁"身上的多个标签，那么我们也可以将这些标签更新至“叶文洁”节点上：
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.增加/删除节点
+后续我们了解到了罗辑、程心等等人物和PIA、星环集团等组织，希望把这些作为节点添加至图中：
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..3252a13eb5
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# 场景：三国
+
+> 此文档主要介绍 三国 demo的使用方法。
+
+## 1. 简介
+由于史料的缺失，一些即使为人们熟知的历史事件也往往存在着很多未解之谜。以三国历史为例，诸葛亮为什么出山帮助当时势力弱小的刘备，同为天下英雄的曹操和刘备为什么成就差距巨大等等。以往学者往往采用二维关系分析历史，这样得出的结论往往比较片面。使用TuGraph将三国的历史人物和事件导入图模型中，使用图计算方式进行分析，能够帮助我们从有限的信息中获得更有价值的知识，是一种非常有意义的跨学科尝试。
+## 2. 数据建模
+我们设计了5类顶点和5类边，点包括“主公”，“州”，“文臣”，“武将”，“战役”，边包括“父亲”，“兄长”，“隶属”，“籍贯”，“参战”。其具体建模信息如下所示：
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. 数据导入
+- 手动导入
+    - 向TuGraph导入数据，既可以使用TuGraph的`lgraph_import`工具离线导入。lgraph_import导入命令如下所示
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- 自动创建
+    - 点击`新建图项目`，选择三国数据，填写图项目配置，系统会自动完成三国场景图项目创建。
+    - 或者直接使用产品自带的三国图项目（带有官方图标）。
+## 4. Cypher分析
+### 4.1. 诸葛亮为什么选择刘备
+通过如下cypher命令可以查看诸葛亮和曹操、刘备之间的关系
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+从图中可以很直观的看出，曹操和诸葛亮之间的最短路径之一包含徐州之战，曹操曾经因父亲被杀对徐州进行过屠城，而诸葛亮是徐州琅琊郡人，任何人都断然不会选择一个屠杀过自己家乡的军阀作为主公。而相反，刘备曾经在徐州之战中阻止过曹操的暴行，这应当是诸葛亮对刘备好感的原因之一。
+
+### 4.2. 曹操为什么成就比刘备高
+通过如下cypher命令可以查看家族对曹操创业的助力
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+平定天下最重要的就是军事人才，曹操其父本姓夏侯，过继于曹氏，曹氏和夏侯氏在谯县都属于地方大族，在曹操创业初期提供了夏侯惇，夏侯渊，曹仁，曹洪在内大量的军事人才。而刘备其父早丧，没有家族助力，年过50才凑齐了自己的五虎上将，而这时已经过了天下大乱争夺地盘的最佳时机，曹操已经天下九州居其六了。
+
+### 4.3. 三国中最强大的魏国为何最先灭亡
+通过如下cypher命令可以查看曹操集团的重要文官组成
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+曹魏事实上于249年灭亡于高平陵之变，立国29年，少于蜀汉（43年）和东吴（51年）。三国中实力最强大的魏国最先灭亡的原因就在于曹魏的文官制度（九品中正制）使得权力很容易集中在世家大族手中。从图中可以看出，曹操曹丕父子两代的重要文臣几乎都是世家大族，颍川荀氏，颍川钟氏，颍川陈氏，武威贾氏等，甚至还出现了地区化趋势，集中于颍川，最终政权也为和颍川荀氏关系密切的河内司马氏所篡夺。
+
+### 4.4. 三国各自的实力究竟如何
+通过如下cypher命令可以查看三国各集团的人口实力
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+得到的查询结果如下表所示
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+古代社会衡量一个国家实力的重要指标是人口数量，由于人口数据缺失，我们使用三国所有主公和文臣武将的籍贯数据估计每个州的人口数量。发现三国主要人物中，按籍贯有60个属于魏国，有23个属于吴国，仅有2个属于蜀国，证明魏国确实是三国中最强大的国家。
+
+### 4.5. 曹操的军事能力如何评价
+通过如下cypher命令可以查看曹操参与的主要战役
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+从图中可以看出，曹操在三国主要的15场战役中参加了8场，出场率比较高。但是曹操只获胜了徐州之战、兖州之战、官渡之战和襄樊之战，汉中之战、宛城之战、群雄讨董和赤壁之战都失败了，综合胜率50%，证明曹操并不算一个非常优秀的军事家。
+
+## 5. 备注
+更多的分析有待大家积极补充和尝试！
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..4a29f62826
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo示例
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..e630bd12bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+快速上手
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..d93a71dbf5
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,526 @@
+# 可视化操作手册
+
+> 此文档主要介绍 TuGraph Browser 的使用和操作方法。
+
+## 1.简介
+
+TuGraph Browser（以下简称Browser）是一款功能强大的产品可视化开发工具，它以直观的可视化方式呈现图数据，使用户可以轻松地管理、维护和查看数据库运行状态。此工具不仅支持图数据的管理和可视化，还支持对系统账户的管理，为用户提供了全面的操作和管理体验，让用户能够更加高效地管理和利用图数据库。
+
+## 2.操作指南
+
+### 2.1.访问
+
+当用户完成图数据库的安装后，可以通过浏览器访问Browser。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 8888。
+
+- 例如：127.0.0.1:8888
+- 推荐使用Chrome
+
+### 2.2.登录
+
+![login](../../../images/browser/login.png)
+
+- 浏览器成功访问Browser后，首先进入的是登录页面（如上图所示），用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 2.3.快速上手
+
+对于首次使用TuGraph的用户，可以通过产品内置的demo数据快速构建一个图项目，快速上手图数据项目。
+
+#### 2.3.1.创建图项目
+
+在`图项目`首页的选项卡中，点击`新建图项目`创建新的图项目。
+
+![快速上手-新建图项目](../../../images/browser/quickstart-creategraph.png)
+
+选择一个产品内置的demo数据，点击`下一步`按钮。
+
+![快速上手-选择一个demo](../../../images/browser/quickstart-selectdemo.png)
+
+在`填写配置`界面输入图项目信息，demo数据量都相对较小，`最大存储空间`设置为1G即可。输入完图项目信息后，点击`创建`按钮后，系统会自动创建demo数据的图模型、导入图数据。
+
+![快速上手-填写配置](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.开始图项目
+
+demo数据的图项目创建完成后，可以在`图项目`的选项卡中找到相应的图项目，可以点击`图查询`查询图数据。
+
+![快速上手-图项目选项卡](../../../images/browser/quickstart-graphtab.png)
+
+执行默认的查询语句，浏览demo里的图数据。
+
+![快速上手-验证结果](../../../images/browser/quickstart-result.png)
+
+更多快速上手文档请浏览[快速上手文档](../3.quick-start/1.preparation.md)
+
+### 2.4.图项目
+
+`图项目`提供可视化的图项目管理和图数据研发功能，它为用户提供了一系列便捷的图数据可视化操作，包括图项目的创建、修改、删除等管理操作，以及图数据的查询、点边统计等操作。此外，它也支持图模型的管理，使用户可以更加方便地进行图数据的管理和维护。
+
+#### 2.4.1.图项目管理
+
+在`图项目`界面，可以看到当前图数据库中的图项目。
+
+![图项目-首页](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.新建图项目
+
+在`图项目`界面，点击`新建图项目`按钮创建一个新的图项目。
+
+![图项目-新建图项目按钮](../../../images/browser/graphmanagement-creategraph.png)
+
+新建图项目需要通过`选择模板`和`填写配置`两个页面完成图项目的创建。
+
+- __选择模板__：产品提供空模板和demo模板两类模板。
+    - 空模板：全新的图项目，用户需要自己创建图模型和导入图数据，一般用于正式项目开发。
+    - demo模板：产品内置的demo数据，图项目创建成功后，系统会自动创建demo图模型并导入demo图数据，一般用于试用和学习。
+
+![图项目-选择模板](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __填写配置__：用户需要填写图项目基本信息，并点击`创建`按钮创建图项目。
+    - 图名称：新建图项目的名称，同时作为该图项目的唯一主键。支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+    - 图描述：新建图项目的描述，可用于详细说明该项目的背景和目标。
+    - 高级配置-最大存储空间：设置图项目最大可占用的存储空间，实际并不会提前占用物理存储空间，实际数据量达到最大存储空间阈值后不可再写入数据。
+
+![图项目-填写配置](../../../images/browser/graphmanagement-configure.png)
+
+创建成功后，可在`图项目`页面的图项目选项卡中查看。
+
+##### 2.4.1.2.编辑图项目
+
+在`图项目`界面，点击图项目选项卡中的`编辑`按钮（笔形图标），编辑对应图项目的基础信息。
+
+![图项目-编辑图项目按钮](../../../images/browser/graphmanagement-editgraph-button.png)
+
+编辑图项目功能可以修改`图名称`和`图描述`。
+
+![图项目-编辑图项目](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.删除图项目
+
+在`图项目`界面，点击图项目选项卡中的`删除`按钮（垃圾桶图标），删除对应的图项目。
+
+![图项目-删除图项目按钮](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_需要注意：图项目删除后无法恢复_。
+
+##### 2.4.1.4.点边统计
+
+在`图项目`界面，点击图项目选项卡中的`点边统计`按钮（折线图标或刷新图标），统计对应图项目的点边数量。
+
+![图项目-点边统计按钮](../../../images/browser/graphmanagement-statistics-button.png)
+
+统计结果将展示展示图项目选项卡上，未进行过点边统计的图项目会显示`暂无点边数据`，已经统计过点边数据的图项目再次统计需要点击`刷新`按钮。
+
+![图项目-点边统计](../../../images/browser/graphmanagement-statistics.png)
+
+![图项目-刷新点边统计按钮](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.图构建
+
+Browser的`图构建`功能主要用于图项目的模型定义和数据导入。在`图项目`页面中，点击图项目选项卡中的`图构建`按钮。
+
+![图构建-按钮](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.模型定义
+
+Browser提供可视化的方式创建和维护图模型。
+
+- 也可用通过`cypher`工具和`lgraph_import`工具创建和维护图模型，详见[Cypher API](../5.developer-manual/6.interface/1.cypher.md)和[数据导入](../5.developer-manual/3.server-tools/1.data-import.md)文档。
+
+###### a.浏览图模型
+
+在`模型定义`界面可以查看详细的图模型设置，支持列表和画布方式查看图模型，支持列表展示点类型的属性和索引、边类型的属性和起点/终点类型。
+
+![图构建-浏览图模型](../../../images/browser/graphbuild.png)
+
+- 支持列表查看点类型和边类型。
+    - 支持点类型和边类型的个数展示，在点类型或边类型页签中展示对应的点或边数量。
+    - 支持点类型和边类型的名称关键字搜索，在`搜索框`输入关键字可展示对应的点或边。
+
+        ![图构建-浏览图模型-搜索](../../../images/browser/graphbuild-list-search.png)
+    - 支持点类型和边类型的名称复制，点击`复制`按钮可以复制点或边的名称至粘贴板。
+
+        ![图构建-浏览图模型-复制](../../../images/browser/graphbuild-list-copy.png)
+    - 支持点类型和边类型的删除，点击`删除`按钮可以删除对应的点或边。
+
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-list-delete.png)
+- 支持画布方式查看点类型和边类型。
+- 在列表或画布中点击相应的点类型或边类型，可以展示模型详情。
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-select.png)
+
+###### b.添加点
+
+在`模型定义`界面点击`添加点`按钮，在右侧滑动窗口中添加点类型。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex-button.png)
+
+用户需要输入点类型名称、属性和索引，点击`完成`按钮完成点类型的创建。
+- 点类型名称：点的名称，也是该点的唯一标识。
+- 属性：点的属性，需要一个属性作为主键。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建点时可以任意删除属性。
+- 索引：点的索引属性，需要先创建属性再设置该属性为索引，索引创建成功后无法修改。
+    - 属性：需要配置索引的属性。
+    - 唯一：设置该属性字段为唯一值。
+    - 主键：对应属性是否为主键，选择`是`后`唯一`选项必须为`是`。
+    - 删除：在创建点时可以任意删除索引。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex.png)
+
+- 编辑点：可以增加点的属性和修改已有属性的数据类型，新增或删除索引。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+_注：主键字段的属性创建后无修改_
+
+![图构建-编辑点](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.添加边
+
+在`模型定义`界面点击`添加边`按钮，在右侧滑动窗口中添加边类型。
+
+![图构建-添加边按钮](../../../images/browser/graphbuild-addedge-button.png)
+
+用户需要输入边类型名称、属性、选择起点类型和终点类型，点击`完成`按钮完成边类型的创建。
+- 边类型名称：边的名称，也是该边的唯一标识。
+- 属性：边的属性，边上可以没有属性。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建边时可以任意删除属性。
+- 选择起点类型和终点类型：设置边的起点点类型和终点点类型，支持多个起点类型和终点类型。
+    - 起点：选择起点的点类型。
+    - 终点：选择终点的点类型。
+    - 需要提前创建至少一个点类型才能设置边的起点类型和终点。
+    - 如果不选择则表示起点和终点可以为任意点类型，同时画布上不展示对应的边，需要在左侧列表查看边类型。
+
+![图构建-添加边](../../../images/browser/graphbuild-addedge.png)
+
+- 编辑边：可以增加边的属性和修改已有属性的数据类型。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+
+![图构建-编辑边](../../../images/browser/graphbuild-editedge.png)
+
+###### d.导入模型
+
+在`模型定义`界面点击`导入模型`按钮，可以上传模型文件快速创建模型。
+
+![图构建-导入模型按钮](../../../images/browser/graphbuild-importmodel-button.png)
+
+在`导入模型`界面点击`上传文件`按钮，上传模型文件成功后，点击确定可以导入图模型。
+
+- 覆盖当前画布中的模型：选中该选项，导入时会先清空已有图模型再导入模型文件中的图模型；不选择，会导入模型文件中新增的点类型和边类型，但不会修改已有的点类型和边类型。
+
+![图构建-导入模型](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.导出模型
+
+在`模型定义`界面点击`导出模型`按钮，可以将当前图项目中的图模型导出成json文件。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel-button.png)
+
+模型文件为json格式，不建议手动修改。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.数据导入
+
+完成`模型定义`之后，点击`下一步`按钮进入数据导入页面。
+
+###### a.数据准备
+
+在数据导入前需要提前准备数据，当前Browser支持CSV文件的上传，需要保证数据文件后缀为csv。
+- 不强制要求包含表头。
+- 支持文本限定符，文本限定符为双引号。
+
+![数据导入-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.上传文件
+
+在`数据导入`页面上传需要导入的数据文件，将数据导入到图项目中。
+
+![数据导入-上传文件](../../../images/browser/graphbuild-import.png)
+
+- 分隔符：数据文件的列分隔符。
+- 文件上传：支持上传多个文件。
+    - 支持弹窗中选择多个上传文件。
+    - 支持将文件拖拽至页面中上传。
+    - 支持同时上传点文件和边文件。
+
+###### c.数据映射
+
+文件上传成功后，需要在`数据导入`页面设置`数据对应表`，将数据文件中的数据列和目标点/边、对应属性建立映射关系。
+
+- 数据对应表：展示已经上传的数据问题。
+    - 文件名称：上传的数据文件名称。
+    - 文件大小：上传的数据文件大小。
+    - 读取结果：数据文件上传结果，success为读取成功。
+    - 删除：在页面中删除，不会删除本地文件。
+- 数据文件映射：每个已上传的数据文件都需要配置映射关系。
+    - 标签：选择该文件对应的点或边类型，只能选择一类点或一类边。
+    - 从第N行，开始：从第N行开始读取数据，系统默认从第0行开始读取数据，如需跳过表头可输入1。
+    - 属性映射：下拉选择数据列对应的属性字段。
+    - 数据预览：系统会预读数据文件的前5行。
+
+![数据导入-数据映射](../../../images/browser/graphbuild-import-datamapping.png)
+
+文件上传成功后，可以点击`继续导入`按钮继续导入其他数据，或者点击`前往图查询`按钮在`图查询`页面查询已导入的数据。
+
+![数据导入-导入成功](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.图查询
+
+在`图项目`界面点击图项目选项卡中的`图查询`按钮，可以查询和访问图项目中的图数据，产品提供`语句查询`、`路径查询`、`点查询`等多种模式查询图数据，支持切换图项目和查询结果展示。
+
+![图查询-按钮](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.切换图项目
+
+`图查询`功能只能访问一个图项目数据，用户可以在`切换图项目`下拉框中选择并切换至其他图数据。
+
+![图查询-切换图项目](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.语句查询
+
+Browser提供可视化方式开发和调试图查询语句，用户可以输入图查询语句、执行并返回结果，支持收藏语句和查看图模型。
+
+![图查询-语句查询](../../../images/browser/query-view.png)
+
+###### a.语句查询窗口
+
+用户在`语句查询窗口`输入图查询语句，点击`执行`按钮可以运行对应语句，并在`执行结果页签`展示结果。
+
+- 切换查询语言：提供不同图查询语言模式的切换。_当前只支持Cypher语法_
+
+![图查询-切换语言](../../../images/browser/query-selectgql.png)
+
+- 语句查询窗口：提供当前查询语言的语法提示。
+
+![图查询-语法提示](../../../images/browser/query-gqltips.png)
+
+- 执行：点击`执行`按钮，发送输入的查询语句至后台运行。
+
+![图查询-执行按钮](../../../images/browser/query-execute-button.png)
+
+- 收藏：点击`收藏`按钮，将当前语句查询窗口的内容保存成模板，以便下次使用。
+
+![图查询-收藏按钮](../../../images/browser/query-bookmark-button.png)
+
+- 下载：点击`下载`按钮，将当前语句查询窗口的内容保存成文本文件并下载至本地，以便下次使用。
+
+![图查询-下载按钮](../../../images/browser/query-download-button.png)
+
+详细Cypher使用指南请参考文档：[Cypher API](../5.developer-manual/6.interface/1.cypher.md)
+
+###### b.收藏列表
+
+以列表方式展示已经收藏的查询语句，点击列表中的收藏模板可以使用其中的语句。支持关键字搜索、名称修改以及删除。
+
+![图查询-语句收藏](../../../images/browser/query-bookmark.png)
+
+###### c.查看图模型
+
+Browser提供当前图项目中的图模型查询，方便用户查询有些点类型和边类型，支持列表展示和画布图谱展示方式，支持隐藏查看图模型窗口。
+
+![图查询-图模型列表](../../../images/browser/query-schema-list.png)
+![图查询-图模型图谱](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.路径查询
+
+Browser提供`路径查询`模板，用户可以通过选择路径的方式，查找图项目中的图数据是否存在相应的路径。
+
+![路径查询](../../../images/browser/pathquery-result.png)
+
+- 路径：在路径选择下拉框内选择需要查找的路径。
+    - 选择路径：根据图模型的定义，系统会自动匹配出对应的一度关系路径；再次点击路径下拉框会，系统会根据路径终点的点类型自动匹配下一度关系路径。
+![路径查询-选择路径](../../../images/browser/pathquery-select.png)
+    - 执行：点击`执行`按钮返回图项目中匹配的路径。
+    - 高级配置：设置扫描的路径数目，默认为100条路径。
+![路径查询-高级配置](../../../images/browser/pathquery-configuration.png)
+
+_注：需要图模型中的边设置起点和终点，如果图项目中的边均未设置起点和终点，下拉选项无结果_
+
+##### 2.4.3.4.点查询
+
+Browser提供`点查询`模板，用户可以通过选择点属性进行查询，查找图项目中的点数据。
+
+![点查询](../../../images/browser/vertexquery.png)
+
+- 选择点：选择需要查询的点类型。
+    - 属性：系统会自动匹配点类型的schema，设置相应的查询条件，点击执行按钮返回结果。
+- 返回节点数目：设置返回点数据的上限。
+
+![点查询-条件](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.执行结果页签
+
+Browser提供JSON视图、JSON文本、点边列表、点边视图等多种方式展示图查询结果，支持结果下载、插入数据、全屏展示。
+
+###### a.JSON视图
+
+Browser提供以JSON视图方式展示查询结果。
+
+![JSON视图](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON文本
+
+![JSON文本](../../../images/browser/query-result-jsontxt.png)
+
+###### c.点边列表
+
+Browser提供以点和边列表方式展示查询结果。
+
+![点边列表](../../../images/browser/query-result-list.png)
+
+###### d.点边视图
+
+Browser提供以画布方式展示查询结果。
+
+![点边视图](../../../images/browser/query-result-graph.png)
+
+###### e.插入数据
+
+Browser提供可视化方式在对应图项目中插入点或边数据。点击`插入数据`按钮，在`插入数据`页签选择点类型或边类型，输入属性值，点击确定完成数据插入。
+
+![插入数据-按钮](../../../images/browser/query-result-insert-button.png)
+
+![插入数据](../../../images/browser/query-result-insert.png)
+
+###### f.下载执行结果
+
+Browser提供图查询结果导出成文本文件功能。点击`下载执行结果`按钮，系统会自动将结果保存成文本文件并下载至本地。
+
+![下载执行结果-按钮](../../../images/browser/query-result-download.png)
+![下载执行结果-按钮](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.全屏展示
+
+Browser提供全屏方式展示图查询结果，点击`全屏显示`按钮全屏展示结果，点击`退出全屏`按钮退出全屏展示。
+
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-button.png)
+![全屏展示](../../../images/browser/query-result-fullscreen.png)
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-close.png)
+
+### 2.5.控制台
+
+`控制台`提供可视化的的账户管理和数据库信息查看功能，它为用户提供了全面的账户和角色管理功能，包括账户的增删改查以及禁用，角色的增删改查以及禁用。此外，它也为用户提供了便捷的数据库信息查看功能，让用户可以轻松地查看图数据库的基础信息和配置信息。其中，基础信息主要包括版本号、运行时间、CPP编译版本号等，而数据库配置信息则包括端口号、系统功能参数配置等。
+
+#### 2.5.1.账户管理
+
+##### 2.5.1.1.账户管理
+
+##### 2.5.1.1.1.添加账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户需要输入账户名称、账户描述、账户密码以及相关角色。
+
+![账户管理-添加账户按钮](../../../images/browser/account-add-button.png)
+
+- 账户名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 相关角色：新建账户时必须要选择一个角色，在账户添加成功后，系统会自动生成一个与账户名称一样的角色。
+
+![账户管理-添加账户](../../../images/browser/account-add.png)
+
+##### 2.5.1.1.2.编辑账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户可以编辑账户描述、账户密码以及相关角色。
+
+![账户管理-编辑账户](../../../images/browser/account-edit.png)
+
+##### 2.5.1.1.3.禁用账户
+
+在`账户管理`界面点击`禁用`按钮禁止对应的账户登录和访问，点击`启用`按钮开启对应的账户登录和访问权限。
+
+![账户管理-禁用](../../../images/browser/account-disable.png)
+![账户管理-启用](../../../images/browser/account-enable.png)
+
+##### 2.5.1.1.4.删除账户
+
+在`账户管理`界面点击`删除`按钮删除对应的账户。
+
+![账户管理-删除](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.角色管理
+
+##### 2.5.1.1.1.添加角色
+
+在`角色管理`界面点击`添加`按钮创建新的角色，用户需要输入角色名称、角色描述以及图权限。
+
+![角色管理-添加角色按钮](../../../images/browser/role-add-button.png)
+
+- 角色名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 图权限：browser支持全部、读、写和无共四类图权限配置。
+    - 全部：对应图的读和写权限，包含编辑图模型权限（schema）。
+    - 读写：对应图的写权限，不包含编辑图模型权限（schema）。
+    - 只读：对应图的读权限。
+    - 无：无法访问和操作对应图。
+- 角色冲突：当两个角色对同一个图有不同图权限，同时对一个账户授权了这两个角色，该账户对该图的图权限为两个角色的并集。
+
+![角色管理-添加角色](../../../images/browser/role-add.png)
+
+##### 2.5.1.1.2.编辑角色
+
+在`角色管理`界面点击`编辑`按钮编辑已有角色，用户可以编辑角色描述以及图权限。
+
+![角色管理-编辑角色](../../../images/browser/role-edit.png)
+
+##### 2.5.1.1.3.禁用角色
+
+在`角色管理`界面点击`禁用`按钮禁止对应的角色，点击`启用`按钮开启对应的角色。禁用角色后，对应角色图访问权限失效。
+
+- 禁用角色：禁用之后，对应角色图访问权限失效。
+    - 当一个用户拥有两个角色对同一个图有操作权限时，当禁用其中一个角色时，另一个角色权限同样有效。
+
+![角色管理-禁用](../../../images/browser/role-disable.png)
+![角色管理-启用](../../../images/browser/role-enable.png)
+
+##### 2.5.1.1.4.删除角色
+
+在`角色管理`界面点击`删除`按钮删除对应的角色。
+
+![角色管理-删除](../../../images/browser/role-delete.png)
+
+#### 2.5.2.数据库信息
+
+##### 2.5.2.1.基础信息
+
+`基础信息`获取当前系统运行的状态，并展示关键信息。
+
+![数据库信息-基础信息](../../../images/browser/db_basic.png)
+
+|参数    |含义    |
+|-------|--------|
+|TuGraph版本号|当前TuGraph的版本号，x.x.x|
+|运行时间|TuGraph服务启动到现在的时间|
+|服务器代码版本|tugraph-db仓库的当前commit|
+|前端代码版本|tugraph-web仓库的当前commit|
+|CPP编译器版本号|编译TuGraph时的CPP版本号|
+|Python版本号|编译TuGraph时的Python版本号|
+|CPP编译器ID|编译TuGraph时的CPP类型|
+
+也可以通过命令获取当前系统运行状态。
+
+```
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.数据库配置信息
+
+`数据库配置信息`获取当前系统运行的配置参数，并展示关键信息。调整配置参数或了解详细配置参数请参考[数据库运行-服务配置](../5.developer-manual/2.running/2.tugraph-running.md)。
+
+![数据库信息-数据库配置信息](../../../images/browser/db_configuration.png)
+
+| 参数                          | 含义                                  |
+|-----------------------------|-------------------------------------|
+| bind_host                   | 系统启动时设置的host，一般为0.0.0.0             |
+| disable_auth                | 是否关闭token认证的定期更新，如为true则token可以永久使用 |
+| durable                     | 是否开启存储底层持久化，如为false，数据异步更新到磁盘       |
+| enable_audit_log            | 是否开启审计日志                            |
+| enable_backup_log           | 是否开启实时增量备份                          |
+| enable_fulltext_index       | 是否开启全文索引                            |
+| enable_ip_check             | 是否开启IP白名单                           |
+| enable_rpc                  | 是否开启RPC端口                           |
+| enable_ssl                  | 是否开启ssl加密传输                         |
+| optimistic_txn              | 是否开启乐观多线程写入事务                       |
+| port                        | 当前系统的REST访问端口                       |
+| rpc_port                    | RPC 及 HA 服务所用端口                     |
+| subprocess_max_idle_seconds | 自进程最大空闲时间，线程池参数                     |
+| thread_limit                | 服务端同时使用的最大线程数                       |
+| verbose                     | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。  |
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..2a422f569e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,167 @@
+# 可视化操作手册（旧版）
+
+> 此文档主要介绍 TuGraph Browser 的使用
+
+## 定义
+
+TuGraph Browser 是 TuGraph 提供的可视化开发工具。
+
+## 作用
+
+TuGraph Browser 的主要功能是为使用图数据库的开发人员，提供可视化的图数据开发，图数据管理和维护等功能。
+
+## 操作详情
+
+### 1.连接数据库
+
+当用户完成图数据库的安装后，可以通过浏览器进行访问，TuGraph Browser 工具。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7090。
+
+### 2.登录数据库
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- 页面打开成功会，首先进图的是登录页面，用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 3.工作台
+
+#### 3.1 快速上手
+
+- 首次登录，系统会默认创建 default 空图
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- 用户点击帮助选项，并选择快速上手
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- 然后点击“一键创建模型”——>"一键创建数据"，就可以完成内置的 Movie 数据图谱的构建
+
+#### 3.2 创建子图和示例
+
+##### 3.2.1 创建子图
+
+- 点击新建子图
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- 填写表单信息
+  ![alt 填写表单](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+  - 子图名称
+  - 子图描述
+  - 配置信息
+  - 点击确认，提示创建成功
+- 切换子图
+  ![alt 切换子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- 点击新建示例
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- 选择示例并点击创建
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 查询
+
+![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 页面组成
+
+- cypher 输入框
+- 结果集展示区域
+
+##### 3.3.2 结果集展示区域功能详情
+
+- 结果集标签展示及功能
+  ![alt 结果集标签](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+  - 这里展示了结果集的所有类型统计
+  - 点击不同的“label（标签）”，可以进行以下修改操作
+    - 修改展示颜色
+    - 修改节点大小或边的粗细
+    - 修改默认展示属性或系统属性
+    - 布局修改
+      - 力导布局
+      - 网格布局
+      - 树形布局
+      - 环境布局
+    - 边聚合
+      - 相同类型，方向的边可以进行合并
+    - 创建节点
+      - 点击创建节点按钮
+      - 选择节点类型
+      - 添写节点内容
+    - 创建关系
+      - 在画布中选择起点和终点
+      - 选择可以匹配的类型
+      - 填写节点信息
+    - 停止布局
+      - 当数据量过大，导致浏览器页面卡顿时候，可以点击这个停止布局的按钮，能够提高体验的流畅度
+    - 鼠标悬停
+      - 开启此功能，可以高亮显示鼠标悬停节点的一度邻居节点
+    - 结果集导出
+      - 可以将结果集导出为 png，json，csv 三种不同的文件形式
+    - 刷新
+      - 点击刷新按钮，会重新执行当前页面的初始 cypher 语句，并刷新结果集
+    - 最大化
+      - 点击最大化，结果集展示区域将全屏展示
+    - 结果集展示形式切换
+      - 支持图谱、表格、文本三种形式
+
+##### 3.3.3 建模
+
+- 点边模型
+  ![alt 建模](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- 点边模型支持实时的、增、删、改、查
+
+- 点边模型支持导入和导出
+
+##### 3.3.4 数据导入
+
+- 本地数据导入
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+  - 选择文件编码格式
+  - 选择本地 CSV 文件
+  - 选择对应的节点或边的模型
+  - 进行数据映射
+  - 完成数据导入
+
+##### 3.3.5 插件
+
+- 存储过程的使用
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+  - 用户可以上传本地编写的 Plugin 程序，并在可视化页面进行执行，并查看执行结果
+  - 用户可以在可视化对插件进行、卸载、执行、下载等操作
+
+##### 3.3.6 帮助
+
+- 其中记录了 TuGraph-browser 的使用方式
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 控制台
+
+##### 3.4.1 数据库基础信息
+
+- 展示数据库相关的基础配置信息
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 权限管理
+
+- 用来创建用户和角色的功能模块，用户可以在这里进行权限的管理操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 实时状态
+
+- 这里展示了数据库实时状态，包括：CPU 使用率、内存用率、磁盘使用率、数据请求次数、磁盘 IO
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 任务管理
+
+- 在这里用户可以看到在正在执行中的任务，可以在此进行停止任务的操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 审计日志
+
+- 这里记录的数据库相关的审计日志，用来排查使用遇到的问题
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6da5aae0ac
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+操作指南
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/1.environment.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/1.environment.md
new file mode 100644
index 0000000000..e2524b4134
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/1.environment.md
@@ -0,0 +1,40 @@
+# 环境准备
+
+> 此文档主要介绍 TuGraph 部署时所需的软硬件环境。
+
+## 1.硬件环境
+
+### 1.1. CPU
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的硬件平台，测试认证过的硬件平台包括 Intel、AMD、Kunpeng、Hygon、飞腾等。
+
+### 1.2. 内存
+
+我们建议内存容量不小于实际的数据大小。如果最求极致的性能，把所有的数据缓存到内存里是最理想的。在数据访问的局部性上，图数据库的局部性要比关系型数据库差，因此如果数据在内存中放不下，通常会频繁地换入换出。
+
+### 1.3. 外存
+我们强烈建议用户使用 NVMe SSD 作为外存，数据库有大量的写操作需要同步的外存，通常为随机写，外存的读写性能很容易成为整体数据库运行的性能瓶颈。因此，高IOPS、低延迟的 NVMe SSD 是最优的选择。
+
+如果现实条件只能使用 SATA接口的SSD，或者云上的网盘，性能虽然会受到影响，但 TuGraph 依然能正确的运行。
+
+外存大小建议为实际数据大小的4倍，比如数据为1TB，则准备4TB的硬盘会比较稳妥。
+
+## 2.软件环境
+
+### 2.1. 操作系统
+
+TuGraph 能够兼容主流操作系统，包括Ubuntu、CentOS、SUSE、银河麒麟、 中标麒麟、UOS等，均通过测试认证。
+
+其中最稳定使用的系统版本是 Ubuntu 18.04、CentOS 7、CentOS 8。
+
+### 2.2. 系统库
+
+编译环境和运行环境对系统库的要求不一样，具体请参考[环境分类](2.environment-mode.md)。
+
+## 3.典型配置推荐
+
+| 硬件      | 最低配置   | 建议配置                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| 内存      | 4GB       | 512GB                    |
+| 外存      | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md
new file mode 100644
index 0000000000..9a4d4f85d7
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md
@@ -0,0 +1,19 @@
+# 环境分类
+
+> 此文档主要介绍 TuGraph 涉及的三种环境。
+
+## 1.分类
+
+根据环境所承载功能的不同，区分为编译环境，运行环境，以及精简运行环境。
+* 编译环境，具备TuGraph编译的所有依赖库，包含运行环境的所有依赖，并且能够编译TuGraph源码，但不包含预编译好的TuGraph可执行文件和库文件，供开发者编译源码使用。
+* 运行环境，具备GCC/Java/Python环境，能够运行TuGraph的所有功能，并且能承载全文索引，java client，c++源码上传为plugin，以及python plugin的完整功能，内置TuGraph预编译好的可执行文件和库文件，供客户直接安装使用，无需编译源码。
+* 精简运行环境，约等于裸系统加预编译TuGraph，仅能运行TuGraph的基本功能，无C++ plugin编译运行，仅so上传，无全文索引，无python plugin，供快速搭建试用。
+
+TuGraph编译后，会把所有的依赖库以.a的形式打包在一起，因此原则上运行不需要的其他的依赖库。但TuGraph支持存储过程，即在服务端编译C++代码，因此在环境中依然需要涉及的编译器。
+
+## 2.依赖系统库
+
+针对三种环境，除去TuGraph的运行包，所需要的系统库如下：
+* 编译环境，包括gcc、python、java等编译器，也包含antlr4、pybind11等，具体参见 tugraph-compile-*-Dockerfile。
+* 运行环境，主要由存储过程引入，包括gcc、boost、cmake等，具体参见 tugraph-runtime-*-Dockerfile。
+* 精简运行环境，无，可以参见 tugraph-mini-runtime-*-Dockerfile。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md
new file mode 100644
index 0000000000..8b270dff2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md
@@ -0,0 +1,82 @@
+# Docker部署
+
+>本文档介绍TuGraph Compile及TuGraph Runtime的Docker镜像的创建、下载。
+
+## 1.简介
+
+- TuGraph Compile Image：提供编译环境，可以用于TuGraph的编译，测试；
+- TuGraph Runtime Image：提供二进制可运行环境，附带TuGraph库和可执行文件；
+- TuGraph Mini Runtime Image: 提供二进制可运行环境，不包含TuGraph中Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+## 2.现有Docker Image
+
+### 2.1.镜像下载方式
+
+镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用。
+
+### 2.2.命名规范
+
+#### 2.2.1.TuGraph Compile Image
+
+提供编译环境，可以用于TuGraph的编译。
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+例如： `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+提供二进制可运行环境，附带TuGraph库和可执行文件。
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如：`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+提供二进制可运行环境，不包含TuGraph种Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如： `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+## 2.3.常见Docker操作
+
+Docker由Dockerfile生成，注意创建镜像需要下载依赖，因此网络问题可能会导致创建较慢或者创建失败。注意不要覆盖镜像，除非tag为 `latest`。
+
+创建Compile镜像
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+创建Runtime / Mini Runtine镜像
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+修改镜像名称
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+上传镜像
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+获取镜像
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+导出镜像
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+导入镜像
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+其他Docker操作请参考[docker官方文档](https://docs.docker.com/engine/reference/commandline/cli )
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md
new file mode 100644
index 0000000000..d66501bcec
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md
@@ -0,0 +1,31 @@
+# 本地包部署
+
+> 此文档主要介绍 TuGraph 的本地包部署。
+
+## 1.安装包下载
+
+请访问Github进行下载：[TuGraph Download](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 2.Ubuntu 下的安装方法
+
+用于在 Ubuntu 上安装的 TuGraph 的.deb 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.deb`安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+该命令默认将 TuGraph 安装于`/usr/local`目录下。用户也可以通过指定 `--instdir=<directory>` 选项更改安装目录。
+
+## 3.CentOS 下的安装方法
+
+用于在 CentOS 上安装的 TuGraph 的.rpm 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.rpm 安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+用户也可以通过指定`--prefix`选项指定安装目录。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md
new file mode 100644
index 0000000000..9d4184acdf
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md
@@ -0,0 +1,125 @@
+# 云部署
+
+> 此文档主要介绍 TuGraph 的云部署，也可参见[阿里云计算巢部署文档]( https://aliyun-computenest.github.io/quickstart-tugraph/ )。
+
+## 1.简介
+
+TuGraph（tugraph.antgroup.com）是蚂蚁集团研发的高性能图数据库（Graph Database）。TuGraph在计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。本文向您介绍如何开通计算巢上的TuGraph社区版服务，以及部署流程和使用说明。
+
+## 2.实例说明
+
+TuGraph部署的为社区开源版本，源码参考Github Repo，目前可以选择的实例规格如下：
+
+| 规格族         | vCPU与内存                 | 系统盘              | 公网带宽      |
+|----------------|-------------------------|-------------------|-----------|
+| ecs.r7a.xlarge | AMD 内存型 r7a，4vCPU 32GiB | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+| ecs.r6.xlarge  | 内存型r6，4vCPU 32GiB       | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+
+预估费用在创建实例时可实时看到（目前为免费）。 如需更多规格、其他服务（如集群高可用性要求、企业级支持服务等），请联系我们 tugraph@service.alipay.com。
+
+## 3.部署流程
+
+### 3.1.准备工作
+
+在正式开始使用前，您需要一个阿里云账号，对ECS、VPC等资源进行访问和创建操作。
+
+- 若您使用个人账号，可以直接创建服务实例
+- 若您使用RAM用户创建服务实例，且是第一次使用阿里云计算巢
+    - 需要在创建服务实例前，对使用的RAM用户的账号添加相应资源的权限。添加RAM权限的详细操作，请参见为 __RAM用户授权__。所需权限如下表所示。
+    - 且需要授权创建关联角色，参考下图，选中 __同意授权并创建关联角色__
+
+| 权限策略名称                    | 备注                                    |
+|---------------------------------|---------------------------------------|
+| AliyunECSFullAccess             | 管理云服务器服务（ECS）的权限             |
+| AliyunVPCFullAccess             | 管理专有网络（VPC）的权限                 |
+| AliyunROSFullAccess             | 管理资源编排服务（ROS）的权限             |
+| AliyunComputeNestUserFullAccess | 管理计算巢服务（ComputeNest）的用户侧权限 |
+| AliyunCloudMonitorFullAccess    | 管理云监控（CloudMonitor）的权限          |
+
+![同意授权并创建关联角色](../../../../images/cloud-deployment-1.png)
+
+### 3.2.部署入口
+
+您可以在阿里云计算巢自行搜索，也可以通过下述部署链接快速到达。
+
+[部署链接](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.申请试用
+
+在正式试用前，需要申请试用，按照提示填写信息，在审核通过后就可以创建TuGraph服务。
+
+![申请试用](../../../../images/cloud-deployment-2.png)
+
+### 3.4.创建TuGraph服务
+
+#### 3.4.1.参数列表
+
+您在创建服务实例的过程中，需要配置服务实例信息的参数列表，具体如下。
+
+| 参数组               | 参数项   | 示例          | 说明                                                           |
+|--------------------|----------|---------------|--------------------------------------------------------------|
+| 服务实例名称         | N/A      | test          | 实例的名称                                                     |
+| 地域                 | N/A      | 华东1（杭州）   | 选中服务实例的地域，建议就近选中，以获取更好的网络延时。          |
+| 付费类型配置         | 付费类型 | 按量付费      | 免费使用请选用按量付费                                         |
+| 可用区配置           | 部署区域 | 可用区I       | 地域下的不同可用区域，确保实例非空                              |
+| 选择已有基础资源配置 | VPC ID   | vpc-xxx       | 按实际情况，选择专有网络的ID。                                   |
+| 选择已有基础资源配置 | 交换机ID | vsw-xxx       | 按实际情况，选择交换机ID。若找不到交换机, 可尝试切换地域和可用区 |
+| ECS实例配置          | 实例类型 | ecs.r6.xlarge | 当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格                      |
+|ECS实例配置|	实例密码|	**|	设置实例密码。长度8~30个字符，必须包含三项（大写字母、小写字母、数字、 ()`~!@#$%^&*_-+={}[]:;'<>,.?/ 中的特殊符号）。|
+
+#### 3.4.2.具体步骤
+
+创建服务按如下步骤进行，参考下图：
+
+- 创建实例名称，如下图中“test”
+- 选择地域，如下图中“华东1（杭州）”
+
+![创建实例](../../../../images/cloud-deployment-3.png)
+
+- 选择实例类型，当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格。如果列表中无机型可选，请尝试选择其他的部署区域
+- 选中机型
+- 配置实例的密码
+- 选择部署区域，如下图中“可用区I”
+
+![选择区域](../../../../images/cloud-deployment-4.png)
+
+- 点击下一步，进入订单确认页面
+- 勾选“权限确认”和“服务条款”中的复选框
+- 点击左下角绿色背景的开始免费试用，即可创建服务实例
+
+![确认](../../../../images/cloud-deployment-5.png)
+
+### 3.5.启动TuGraph服务
+
+- 查看服务实例：服务实例创建成功后，部署时间大约需要2分钟。部署完成后，页面上可以看到对应的服务实例，如下图
+
+![查看实例](../../../../images/cloud-deployment-6.png)
+
+- 点击该服务实例访问TuGraph。进入到对应的服务实例后，可以在页面上获取到web、rpc、ssh共3种使用方式，并且页面上展示了admin用户的密码
+
+![访问方式](../../../../images/cloud-deployment-7.png)
+
+- 点击web的链接，即可跳转访问已经部署好的TuGraph Web。建议新手先通过TuGraph Web，快速使用demo上手。
+    - 首先在TuGraph Web的登录页面上，输入默认用户名admin和页面上展示的admin用户的密码进行登录，参考下图
+    - 登录完成后，选择任意一个带有官方图标的图项目，其中内置了demo数据，开启图数据的探索和发现！
+
+![登录](../../../../images/cloud-deployment-8.png)
+![创建demo](../../../../images/cloud-deployment-9.png)
+
+## 4.常见FAQ
+
+### 问题一：部署区域无可用资源
+
+有时，所选部署区域（如可用区G）没有所选套餐的可用资源，会报错如下图所示
+
+![部署区域错误](../../../../images/cloud-deployment-10.png)
+
+__解决办法__：尝试选择其他区域，如可用区I等
+
+### 问题二: 启动后web访问不通
+
+web的启动需要一点点时间，请稍后刷新页面即可。
+
+### 问题三: 登录时的用户名密码不正确
+
+请注意检查，登录时使用的密码应为详情页面展示的密码。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/index.rst
new file mode 100644
index 0000000000..16187666e3
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/1.installation/index.rst
@@ -0,0 +1,8 @@
+安装
+====
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/1.compile.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/1.compile.md
new file mode 100644
index 0000000000..9b47c6b3f8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/1.compile.md
@@ -0,0 +1,28 @@
+# 从源码编译
+
+> 本文档主要描述 TuGraph 从源码进行编译。
+
+## 1.前置条件
+
+推荐在linux系统下搭建TuGraph。同时docker环境是个不错的选择,如果你想设置一个新的环境，请参考[Dockerfile](../1.installation/3.docker-deployment.md)。
+
+## 2.编译介绍
+
+以下是编译TuGraph的步骤：
+
+1. 如果需要web接口运行`deps/build_deps.sh`，不需要web接口则运行`SKIP_WEB=1 deps/build_deps.sh`
+2. 根据容器系统信息执行`cmake .. -DOURSYSTEM=centos`或者`cmake .. -DOURSYSTEM=ubuntu`，如果需要shell运行lgraph_cypher，加上`-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+3. `make`
+4. `make package` 或者 `cpack --config CPackConfig.cmake`
+
+示例：`tugraph/tugraph-compile-centos7`Docker环境
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md
new file mode 100644
index 0000000000..0191118ee0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md
@@ -0,0 +1,189 @@
+# 数据库运行
+
+> 本文档主要描述 TuGraph 服务的运行模式、启动、停止和重启的操作,以及 TuGraph 的服务配置参数、配置文件格式和命令行配置参数。
+
+## 1.前置条件
+
+TuGraph 运行的前置条件为 TuGraph 正确安装，参考[安装流程](../1.installation/1.environment.md)。
+
+TuGraph 运行需要保证库文件 liblgraph.so 的文件位置在环境变量 LD_LIBRARY_PATH。
+
+运行 TuGraph 进程的用户不需要超级权限，但需要对配置文件（一般为lgraph.json）及文件中涉及的文件有读权限，并且对数据文件夹、日志文件夹等有写权限。
+
+## 2.运行模式
+
+TuGraph 可以作为前台普通进程启动，也可以作为后台守护进程启动。
+当作为普通进程运行时，TuGraph 可以直接将日志打印到终端，这在调试服务器配置时非常方便。但是，由于前台进程在终端退出后被终止，因此用户须确保在 TuGraph 服务器处于运行状态时，终端保持打开状态。另一方面，在守护进程模式下，即使启动它的终端退出，TuGraph 服务器也可以继续运行。因此，在长时间运行的服务器下推荐以守护进程模式启动 TuGraph 服务器。
+
+### 2.1.运行普通进程
+
+`lgraph_server -d run`命令可以将 TuGraph 作为普通进程运行。普通进程依赖命令行终端，因此终端结束时，TuGraph 进程也会自动终止。普通进程模式配合`--log_dir ""`可以将进程日志直接输出到终端，因此更方便调试。
+
+启动命令：
+
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+普通模式的运行输出示例：
+
+```shell
+20200508120723.039: **********************************************************************
+20200508120723.039: *                  TuGraph Graph Database v3.4.0                     *
+20200508120723.040: *                                                                    *
+20200508120723.041: *        Copyright(C) 2023 Ant Group. All rights reserved.           *
+20200508120723.041: *                                                                    *
+20200508120723.044: *             Licensed host: hostname      threads:0, ha:0           *
+20200508120723.044: **********************************************************************
+20200508120723.044: Server is configured with the following parameters:
+20200508120723.045:   data directory:    ./lgraph_db
+20200508120723.046:   enable ha:          0
+20200508120723.046:   async:              0
+20200508120723.047:   host:               127.0.0.1
+20200508120723.047:   REST port:          7071
+20200508120723.048:   RPC port:           9091
+20200508120723.048:   enable rpc:         0
+20200508120723.051:   optimistic txn:     0
+20200508120723.059:   verbose:            1
+20200508120723.074:   log_dir:
+20200508120723.074:   ssl_auth:           0
+20200508120723.075:   resource dir:       ./resource
+
+20200508120723.077: Loading DB state from disk
+20200508120723.110: [RestServer] Listening for REST on port 7090
+20200508120723.110: [LGraphService] Server started.
+```
+
+普通进程模式下，用户可以通过按 `CTRL+C` 来提前终止 TuGraph 进程。
+
+### 2.2.运行进程守护模式
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+守护模式的运行输出示例：
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+## 3.服务操作
+
+### 3.1.启动服务
+
+TuGraph 需要通过 `lgraph_server -d start` 命令行启动，启动命令示例如下：
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+### 3.2.停止服务
+
+用户可以使用`kill`命令以及`lgraph_server -d stop`命令停止 TuGraph 守护进程。由于可能在同一台计算机上运行多个 TuGraph 服务器进程，因此我们使用`.pid`文件区分不同的服务器进程，该文件写入启动该进程的工作目录。因此，需要在相同工作目录中运行`lgraph_server-d stop`命令，以停止正确的服务器进程。
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.重启服务
+
+用户也可以通过`lgraph_server -d restart`来重启 TuGraph 服务：
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.服务配置
+
+TuGraph 服务器在启动时从配置文件和命令行选项加载配置，如果在配置文件和命令行中同一选项指定了不同的值，将优先使用命令行中指定的值。
+
+### 4.1.配置参数
+
+具体参数及其类型描述如下：
+
+| **参数名**                       | **<nobr>参数类型</nobr>** | **参数说明**                                                                                                                             |
+|-------------------------------|-----------------------|--------------------------------------------------------------------------------------------------------------------------------------|
+| directory                     | 字符串                   | 数据文件所在目录。如果目录不存在 ，则自动创建。默认目录为 /var/lib/lgraph/data。                                                                                  |
+| durable                       | 布尔值                   | 是否开启实时持久化。关闭持久化可以减少写入时的磁盘 IO 开销，但是在机器断电等极端情况下可能丢失数据。默认值为 `true`。                                                                     |
+| host                          | 字符串                   | REST 服务器监听时使用的地址，一般为服务器的 IP 地址。默认地址为 0.0.0.0。                                                                                        |
+| port                          | 整型                    | REST 服务器监听时使用的端口。默认端口为 7070。                                                                                                         |
+| enable_rpc                    | 布尔值                   | 是否使用 RPC 服务。默认值为 0。                                                                                                                  |
+| rpc_port                      | 整型                    | RPC 及 HA 服务所用端口。默认端口为 9090。                                                                                                          |
+| enable_ha                     | 布尔值                   | 是否启动高可用模式。默认值为 false。                                                                                                                |
+| ha_log_dir                    | 字符串                   | HA 日志所在目录，需要启动 HA 模式。默认值为空。                                                                                                          |
+| verbose                       | 整型                    | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。默认值为 1。                                                                                            |
+| log_dir                       | 字符串                   | 日志文件所在的目录。默认目录为 /var/log/lgraph/。                                                                                                    |
+| ssl_auth                      | 布尔值                   | 是否使用 SSL 安全认证。当开启时，REST 服务器只开启 HTTPS 服务。默认值为 false。                                                                                  |
+| web                           | 字符串                   | web 文件（包含可视化部分）所在目录。默认目录为 /usr/local/share/lgraph/resource。                                                                          |
+| server_cert                   | 字符串                   | 在 SSL 认证开启时，服务器所使用的 certificate 文件路径。默认路径为 /usr/local/etc/lgraph/server-cert.pem。                                                    |
+| server_key                    | 字符串                   | 在 SSL 认证开启时，服务器所使用的公钥文件。默认目录为 /usr/local/etc/lgraph/server-key.pem。                                                                  |
+| enable_audit_log              | 布尔值                   | 是否启用审计日志，默认值为 false。                                                                                                                 |
+| audit_log_expire              | 整型                    | 启用审计日志时，日志的有效时间（小时），超时自动清理，值为 0 时表示不清理。默认值为 0。                                                                                       |
+| audit_log_dir                 | 字符串                   | 启用审计日志时，日志文件的存放目录。默认目录为 $directory/_audit_log_。                                                                                      |
+| load_plugins                  | 布尔值                   | 启动服务时导入所有存储过程。默认值为 1。                                                                                                                |
+| optimistic_txn                | 布尔值                   | 为 Cypher 开启乐观多线程写入事务。默认为 0。                                                                                                          |
+| disable_auth                  | 布尔值                   | 关闭 REST 验证。默认为 0。                                                                                                                    |
+| ha_snapshot_interval_s             | 整型                    | 快照间隔（以秒为单位）。 默认值为 86400。                                                                                                             |
+| ha_heartbeat_interval_ms         | 整型                    | 心跳间隔（以毫秒为单位）。 默认值为 1000。                                                                                                             |
+| ha_node_offline_ms | 整型                    | 心跳超时且节点下线间隔（以毫秒为单位）。默认为 60000。                                                                                                       |
+| ha_node_remove_ms         | 整型                    | 节点被视为完全死亡并从列表中删除的间隔（以毫秒为单位）。默认值为 120000。                                                                                             |
+| enable_ip_check               | 布尔值                   | 允许 IP 白名单，默认值为 0。                                                                                                                    |
+| idle_seconds                  | 整型                    | 子进程可以处于空闲状态的最大秒数。 默认值为 600。                                                                                                          |
+| enable_backup_log             | 布尔值                   | 是否启用备份日志记录。 默认值为 0。                                                                                                                  |
+| backup_log_dir                | 字符串                   | 存储备份文件的目录。 默认值为空。                                                                                                                    |
+| snapshot_dir                  | 字符串                   | 存储快照文件的目录。 默认值为空。                                                                                                                    |
+| thread_limit                  | 整型                    | 同时使用的最大线程数。 默认值为 0，即不做限制，以 license 为准。                                                                                               |
+| unlimited_token               | 布尔值                   | 是否将链接token设置为无期限。 默认值为 0，有效期为24小时。                                                                                                   |
+| enable_fulltext_index         | 布尔值                   | 是否启用全文索引功能，默认值为 0。                                                                                                                   |
+| fulltext_analyzer             | 字符串                   | 全文索引分词器类型。可设为`StandardAnalyzer`或者`SmartChineseAnalyzer`。默认是`StandardAnalyzer`                                                        |
+| fulltext_commit_interval      | 整形                    | 全文索引数据提交周期,针对写操作，单位秒。默认是 0，立即提交。                                                                                                     |
+| fulltext_refresh_interval     | 整形                    | 全文索引数据刷新周期，针对读操作，单位秒。默认是 0，立即可以读到最新写入的数据。                                                                                            |
+| conf                          | 字符串                   | 根据 host1:port1,host2:port2,host3:port3 初始化HA集群，默认值为空。                                                                                |
+| ha_node_join_group_s             | 整形                    | 节点尝试加入高可用集群的等待时长，单位秒，默认是 10。                                                                                                         |
+| ha_bootstrap_role                | 整形                    | 是否使用bootstrap方式启动，以及使用该方式启动的服务器角色，0代表不使用bootstrap方式启动，1代表使用bootstrap方式启动且本节点为leader，2代表使用bootstrap方式启动且本节点为follower，只有这3种选项。 默认值为 0。 |
+| help                          | 布尔值                   | 打印此帮助消息。 默认值为 0。                                                                                                                     |
+
+### 4.2.服务器配置文件
+
+TuGraph 的配置文件以 JSON 格式存储。建议将大多数配置存储在配置文件中，并且仅在需要时使用命令行选项临时修改某些配置参数。
+一个典型的配置文件如下：
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md
new file mode 100644
index 0000000000..0380d3d39a
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md
@@ -0,0 +1,134 @@
+# 部署高可用模式
+
+> 此文档主要介绍了高可用模式的原理、准备工作、以及服务器的操作说明
+
+## 1.原理
+
+TuGraph 通过多机热备份来提供高可用模式（HA 模式）。在高可用模式下，对数据库的写操作会被同步到所有服务器上，这样即使有部分服务器宕机也不会影响服务的可用性。
+
+在高可用模式下，多个 TuGraph 服务器组成一个备份组。每个备份组由三个或更多 TuGraph 服务器组成，其中某台服务器会作为`leader`，而其他复制组服务器则作为`follower`。写入请求由`leader`
+提供服务，该`leader`将每个请求复制同步到`follower`，并在请求同步到服务器后才能响应客户端。这样，如果任何服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选择出新的`leader`。
+
+高可用模式仅企业版可用，开源社区版不含此功能。
+
+## 2.准备工作
+
+要启用高可用模式，用户需要：
+
+- 三台及以上的 TuGraph 服务器实例。
+
+- 在启动 lgraph_server 时打开高可用模式，可以使用配置文件或者命令行将`enable_ha`选项设置为`true`。
+
+- 设置正确的`rpc_port`，可通过配置文件或者命令行设置。
+
+## 3.启动初始备份组
+
+### 3.1.初始数据一致
+
+当启动时所有服务器中的数据相同或没有数据时，用户可以通过
+指定`--conf host1:port1,host2:port2`启动服务器。
+这种方式可以将准备好的所有TuGraph实例一次性加入初始备份组，
+由备份组中的所有服务器根据raft协议选举出`leader`，并将其他
+服务器以`follower`的角色加入备份组。
+
+启动初始备份组的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+### 3.2.初始数据不一致
+
+如果第一台服务器中已有数据（以`lgraph_import`工具导入或从非高可用模式的服务器传输得到），
+并且之前并未在高可用模式下使用，则用户应使用boostrap方式启动。
+以`ha_bootstrap_role`参数为1在bootstrap模式下启动有数据的服务器，并通过`conf`参数指定本机为`leader`。
+在bootstrap模式下，服务器在将新加入的服务器添加到备份组之前会将自己的
+数据复制到新服务器中，以使每个服务器中的数据保持一致。
+
+启动有数据服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 1
+```
+
+其他无数据的服务器需要指定`ha_bootstrap_role`参数为2，并通过`conf`参数指定`leader`即可，命令示例如下所示
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 2
+```
+
+## 4.横向扩展其他服务器
+
+启动初始备份组后，如果想对备份组进行横向扩展，要将新服务器添加到备份组，
+应使用`--conf HOST：PORT`选项，其中`HOST`可以是该备份组中已有的任何服务器的 IP 地址，
+而`PORT`是其 RPC 端口。例如：
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+
+此命令将启动一台高可用模式的 TuGraph 服务器，并尝试将其添加到包含服务器`172.22.224.15:9090`的备份组中。
+请注意，加入备份组需要服务器将其数据与备份组的`leader`服务器同步，此过程可能需要相当长的时间，具体取决于数据的大小。
+
+## 5.停止服务器
+
+当服务器通过`CTRL-C`下线时，它将通知当前的`leader`服务器，告知其从备份组中删除该下线的服务器。如果`leader`服务器下线，
+它将在下线前将`leader`身份权限传给另一台服务器。
+
+如果服务器被终止或者与备份组中的其他服务器失去连接，则该服务器将被视为失败节点，`leader`服务器将在特定时限后将其从备份组中删除。
+
+如果任何服务器离开备份组并希望重新加入，则必须从`--conf HOST:PORT`选项开始，其中`HOST`是当前备份组中的某台服务器的 IP 地址。
+
+## 6.重启服务器
+
+不建议重新启动整个备份组，因为它会中断服务。如果需要，可以关闭所有服务器。但在重新启动时，
+必须保证关闭时的备份组中至少有N/2+1的服务器能正常启动，否则启动失败。 并且，
+无论初始启动复制组时是否指定`enable_bootstrap`为true，重启服务器时都只需通过
+指定`--conf host1:port1,host2:port2`参数一次性重启所有服务器即可，命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 7.docker部署高可用集群
+在真实业务场景中，很可能遇到在多种操作系统或架构上部署高可用集群的需求。
+差异化的环境可能导致编译TuGraph时缺少某些依赖。因此，
+在docker中编译软件并部署高可用集群是非常有应用价值的。以centos7版本的docker为例，
+部署高可用集群的步骤如下所示。
+
+### 7.1.安装镜像
+使用如下命令下载TuGraph的编译docker镜像环境
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+然后拉取TuGraph源码并编译安装
+
+### 7.2.创建容器
+使用如下命令创建容器，使用`--net=host`使得容器运行在host模式，此模式下
+docker和宿主机和共享网络namespace，即共用同一个IP。
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 7.3.启动服务
+在每台服务器上使用如下命令启动服务，因为docker和宿主机共享IP，所以可以直接指定在宿主机IP上启动服务
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.查看服务器状态
+
+备份组的当前状态可以在 TuGraph 可视化工具、REST API 以及 Cypher 查询中获取。
+
+在 TuGraph 可视化工具中，可以在 DBInfo 部分中找到备份组中的服务器及其角色列表。
+
+使用 REST API 时，可以使用`GET /info/peers` 请求获取信息。
+
+在 Cypher 中，使用`CALL dbms.listServers()`语句来查询当前备份组的状态信息。
+
+## 9.高可用模式下数据同步问题
+
+在高可用模式下，同一备份组中的不同服务器可能并不总是处于相同的状态。出于性能原因，如果请求已同步到超过一半的服务器，则`leader`服务器将认为该请求属于`committed`状态。尽管其余服务器最终将收到新请求，但服务器的状态不一致将持续一段时间。客户端也可能向刚刚重新启动的服务器发送请求，从而具有较旧的状态。
+
+为了确保客户端看到一致连续的数据，特别是为了摆脱`反向时间旅行`问题（其中客户端读取比以前看到的状态更旧的状态），每个 TuGraph 服务器都会保持一个单调增加的数据版本号。备份组中数据版本号到数据库状态的映射全局一致，这意味着如果两台服务器具有相同的数据版本号，则它们必须具有相同的数据。响应请求时，服务器在响应中包含了其数据版本号。因此，客户端可以知道它看到了哪个版本。客户端收到旧版本的数据之后可以重新向Leader发送请求，从而获取到最新的数据。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/index.rst
new file mode 100644
index 0000000000..a653bf13ab
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/2.running/index.rst
@@ -0,0 +1,8 @@
+运行
+====
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md
new file mode 100644
index 0000000000..fc8337c9c7
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md
@@ -0,0 +1,364 @@
+# 数据导入
+
+> 此文档主要介绍 TuGraph 的数据导入功能。其中包括 CSV 格式的分隔符，jsonline 的格式示例，以及导入在线和离线的两种模式。
+
+## 1.简介
+
+在图数据库服务安装成功后，您可以使用`lgraph_import`批量导入工具将现有数据导入 TuGraph。`lgraph_import`支持从 CSV 文件和 JSON 数据源导入数据。
+
+> CSV 格式
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline 格式
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph 支持两种导入模式：
+
+- _离线模式_：读取数据并将其导入指定服务器的数据文件，应仅在服务器离线时完成。
+- _在线模式_：读取数据并将其发送到工作中的服务器，然后将数据导入其数据库。
+
+## 2.CSV文件格式分隔符
+
+    CSV格式的分隔符可以是单字符或多字符组成的字符串，其中不能包含`\r`或`\n`。注意不同的shell会对输入字符串做不同的处理，因此针对不同的shell输入参数可能需要不同的转义处理。
+
+此外，`lgraph_import`还支持以下转义字符，以便输入特殊符号：
+
+| 转义符 | 说明                                                             |
+| ------ | ---------------------------------------------------------------- |
+| \\     | 反斜杠`\\`                                                       |
+| \\a    | 响铃，即 ASCII 码 0x07                                           |
+| \\f    | form-feed，即 ASCII 码 0x0c                                      |
+| \\t    | 水平制表符，即 ASCII 码 0x09                                     |
+| \\v    | 垂直制表符，即 ASCII 码 0x0b                                     |
+| \\xnn  | 两位十六进制数，表示一个字节，如\\x9A                            |
+| \\nnn  | 三位八进制数，表示一个字节，如\\001, \\443，数值范围不能超过 255 |
+
+例：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.配置文件
+
+`lgraph_import`工具通过指定的配置文件进行环境配置。配置文件描述输入文件的路径、它们所代表的点/边以及点/边的格式。
+
+### 3.1.配置文件格式
+
+配置文件包含两部分：schema 和 files。`schema`部分定义 label，`files`部分描述要导入的数据文件。
+
+#### 3.1.1.关键字
+
+- schema (数组形式）
+  - label（必选，字符串形式）
+  - type（必选，值只能是 VERTEX 或者 EDGE）
+  - properties（数组形式，对于点必选，对于边如果没有属性可以不配置）
+    - name（必选，字符串形式）
+    - type （必选，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（可选，代表该字段可以配置，也可以不配置）
+    - index（可选，该字段是否需要建索引）
+    - unique（可选，该字段是否建索引，并且是 unique 类型的）
+  - primary (仅点配置，必选，主键字段，需指定一个 property，用来唯一确定一个点)
+  - constraints (仅边配置，可选，数组形式，起点和终点的 label，不配置或者为空代表不限制)
+  - detach_property (点边都可配置，可选，默认是`false`。`true` 代表属性数据单独存放，在内存不够，属性数据比较多的场景下可以减少io读放大)
+- files （数组形式）
+  - path（必选，字符串，可以是文件路径或者目录的路径，如果是目录会导入此目录下的所有文件，需要保证有相同的 schema）
+  - header（可选，数字，头信息占文件起始的几行，没有就是 0）
+  - format（必须选，只能是 JSON 或者 CSV）
+  - label（必选，字符串）
+  - columns（数组形式）
+    - SRC_ID (特殊字符串，仅边有，代表这列是起始点数据)
+    - DST_ID (特殊字符串，仅边有，代表这列是目的点数据)
+    - SKIP   (特殊字符串，代表跳过这列数据)
+    - [property]
+  - SRC_ID (仅边配置，值是起始点标签)
+  - DST_ID (仅边配置，值是目的点标签)
+
+### 3.2.配置文件示例
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+对于上述配置文件，定义了三个 label：两个点类型`actor`和`movie`，一个边类型`role`。每个 label 都描述了：label 的名字、类型（点还是边）、属性字段有哪些以及每个字段的类型。对于点，另外定义了 primary 字段是哪个；对于边，另外定义了 constraints 字段，用来限制边的起点和终点只能是哪些组合。
+
+还描述了三个数据文件，两个点的数据文件`actors.csv`和`movies.csv`，一个边的数据文件`roles.csv`。每个部分都描述了：文件的路径（path）、数据类型（format）、信息头占开头几行（header）、是哪个 label 的数据（label）、文件中每行数据中的每个列对应的字段是哪个。
+
+对于上述配置文件，import 工具在执行的过程中会先在 TuGraph 中创建`actor`、`movie`、`role`这三个 label，然后再执行三个文件的数据导入。
+
+## 4.离线全量导入
+
+离线模式只能在离线状态的服务器使用。离线导入会创建一张新图，因此更适合新安装的 TuGraph 服务器上的第一次数据导入。
+要在离线模式下使用`lgraph_import`工具，可以指定`lgraph_import --online false`选项。要了解可用的命令行选项，请使用`lgraph_import --online false --help`：
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+命令行参数：
+
+- **-c, --config_file** `config_file`: 导入配置文件名，其格式要求见下述。
+- **--log** `log_dir`: 日志目录。默认为空字符串，此时将日志信息输出到控制台。
+- **--verbose** `0/1/2`: 日志等级，等级越高输出信息越详细。默认为 1。
+- **-i, --continue_on_error** `true/false`: 在碰到错误时跳过错误并继续，默认为 false，碰到错误立即退出。
+- **-d, --dir** `{diretory}`: 数据库目录，导入工具会将数据写到这个目录。默认为`./db`。
+- **--delimiter** `{delimiter}`: 数据文件分隔符。只在数据源是 CSV 格式时使用，默认为`","`。
+- **-u, --username** `{user}`: 数据库用户名。需要是管理员用户才能执行离线导入。
+- **-p, --password** `{password}`: 指定的数据库用户的密码
+- **--overwrite** `true/false`: 是否覆盖数据。设为 true 时，如果数据目录已经存在，则覆盖数据。默认为`false`。
+- **-g, --graph** `{graph_name}`: 指定需要导入的图种类。
+- **-h, --help**: 输出帮助信息。
+
+### 4.1.离线导入示例
+
+在这个例子中，我们使用上面描述的电影-演员数据来演示导入工具的使用方法。待导入数据分为三个文件：`movies.csv`，`actors.csv`，`roles.csv`。
+
+`movies.csv`包含的是电影的信息，其中每部电影有一个 id（作为检索的 primary key），此外每部电影还拥有 title、year 和 rating 等属性。（数据来自[IMDb](http://www.imdb.com)）。
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+对应的 jsonline 格式如下:
+也可以所有字段都是字符串形式，导入的时候会转换成对应的类型
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`包含的是演员的信息。每个演员也拥有一个 id，以及 name 等属性。
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> 对应的 jsonline 格式如下:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`则包含了演员在哪个电影中扮演了哪个角色的信息。其中每一行记录的是指定演员在指定电影里饰演的角色，对应数据库中的一条边。`SRC_ID` 和 `DST_ID` 分别是边的源点和目标点，他们分别是`actors.csv`和`movies.csv`中定义的`primary`属性。
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+对应的 jsonline 格式如下:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+`配置文件import.conf`，注意每个文件中有两个标题行，因此我们需要指定`HEADER=2`选项。
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+使用导入配置文件，我们现在可以使用以下命令导入数据：
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # 从import.conf读取配置信息
+        --dir /data/lgraph_db      # 将数据存放在/data/lgraph_db
+        --graph mygraph            # 导入名为 mygraph 的图
+```
+
+**注意**：
+
+- 如果名为`mygraph`的图已存在，导入工具将打印错误消息并退出。要强制覆盖图形，可以使用`--overwrite true` 选项。
+- 配置文件和数据文件必须使用 UTF-8 编码（或普通 ASCII 编码，即 UTF-8 的子集）存储。如果任何文件使用 UTF-8 以外的编码（例如，带有 BOM 或 GBK 的 UTF-8）编码，则导入将失败，并输出分析器错误。
+
+## 5.在线增量导入
+
+在线导入模式可用于将一批文件导入已在运行中的 TuGraph 实例中。这对于处理通常以固定的时间间隔进行的增量批处理更新非常便利。`lgraph_import --online true`选项使导入工具能够在线模式工作。与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据发送到正在运行的 TuGraph 实例中，该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+
+如果用户和密码有效，并且指定的图存在，导入工具将将数据发送到服务器，服务器随后解析数据并将其写入指定的图。数据将以大约 16MB 大小的包发送，在最近的换行符处中断。每个包都是以原子方式导入的，这意味着如果成功导入包，则成功导入所有数据，否则，任何数据都不会进入数据库。如果指定了`--continue_on_error true`，则忽略数据完整性错误，并忽略违规行。否则，导入将在第一个错误包处停止，并打印出已导入的包数。在这种情况下，用户可以修改数据以消除错误，然后使用`--skip_packages N`重做导入以跳过已导入的包。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md
new file mode 100644
index 0000000000..5544169de0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# 数据导出
+
+> 此文档主要介绍 TuGraph 的数据导出功能。
+
+## 1.简介
+
+TuGraph 可以通过 `lgraph_export` 工具来对已经存放在TuGraph的图数据进行数据导出。 `lgraph_export` 工具可以将指定 TuGraph 数据库的数据以 `csv` 或者 `json` 文件形式导出到指定目录，同时导出这些数据进行再导入时需要的配置文件 `import.config` ，详细描述可参见[配置文件](1.data-import.md)。
+
+## 2.导出命令
+
+该工具的命令示例如下：
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+其中：
+
+- `-d {database_dir}` 指定需要进行数据导出的数据库所在目录，默认值为 `./testdb`。
+- `-e {export_destination_dir}` 指定导出文件存放的目录，默认值为 `./exportdir`。
+- `-g {graph_to_use}` 指定图数据库的种类，默认为 `default` 。
+- `-u {username}` 指定进行该导出操作的用户的用户名。
+- `-p {password}` 指定进行该导出操作的用户的用户密码。
+- `-s {field_separator}` 指定导出文件的分隔符，默认为逗号。
+- `-f {output_format}` 指定导出数据的格式，`json`或者`csv`，默认为`csv`。
+- `-h` 除上述指定参数外，也可以使用该参数查看该工具的使用帮助。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..ce113ad0a4
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
@@ -0,0 +1,35 @@
+# 备份恢复
+
+> 此文档主要介绍 TuGraph 的数据备份和恢复功能。
+
+## 1.数据备份
+
+TuGraph 可以通过 `lgraph_backup` 工具来进行数据备份。
+`lgraph_backup` 工具可以将一个 TuGraph 数据库中的数据备份到另一个目录下，它的用法如下：
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+其中：
+
+- `-s {source_dir}` 指定需要备份的数据库（源数据库）所在目录。
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
+  如果目标数据库不为空，`lgraph_backup` 会提示是否覆盖该数据库。
+- `-c {true/false}` 指明是否在备份过程中进行 compaction。
+  compaction 能使产生的备份文件更紧凑，但备份时间也会变长。该选项默认为 `true`。
+
+## 2.数据恢复
+
+使用`lgraph_backup` 工具得到的目标数据库`{destination_dir}`备份了源数据库
+`{source_dir}`的所有子图，但不包含HA集群的raft信息，从而保证服务和集群能
+以备份数据库成功重启并与源数据库的数据一致。使用如下命令可以用备份数据库重启服务，
+在服务启动时会恢复所有子图的存储过程，保证备份服务和原服务完全一致。
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+其中：
+
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md
new file mode 100644
index 0000000000..c0c5afb7eb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# 数据预热
+
+> 此文档主要介绍 TuGraph 的数据预热功能。
+
+## 1.简介
+
+TuGraph 是基于磁盘的数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+## 1.数据预热命令
+
+数据预热可以通过工具 `lgraph_warmup` 来进行。它的使用示例如下：
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+其中：
+
+- `-d {db_dir}` 选项指定了 TuGraph 服务器的数据目录
+
+- `-g {graph_list}` 选项指定需要进行数据预热的图名称，用逗号分隔
+
+根据数据大小和所使用的磁盘类型不同，预热过程运行时间也不同。机械磁盘上预热一个大数据库可能耗时较长，请耐心等待。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/index.rst
new file mode 100644
index 0000000000..3b01353109
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/3.server-tools/index.rst
@@ -0,0 +1,8 @@
+服务端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md
new file mode 100644
index 0000000000..59e2ee030d
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md
@@ -0,0 +1,42 @@
+# Python客户端
+
+> 此文档主要是TuGraph Python SDK的使用说明。
+
+## 1. 概述
+   Python的TuGraph Rpc Client 是使用pybind11包装的CPP Client SDK，故其接口详情不在此文档中详述，本文档只
+讲解TuGraph Python Restful Client SDK的使用，包括执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.调用Cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = await aclient.call_cypher(cypher)
+print(res)
+```
+
+### 2.2.调用存储过程
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+res = await aclient.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..71282a9b27
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md
@@ -0,0 +1,246 @@
+# C++客户端
+
+> 此文档主要是TuGraph C++ SDK的使用说明。
+
+## 1.概述
+C++ Client 能够使用 RPC 连接lgraph_server，进行数据导入、执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直接连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化。
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.3.调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.4.加载存储过程
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.5.列举存储过程
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送请求。
+
+### 2.6.删除存储过程
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.7.从字节流中导入schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.8.从字节流中导入点边数据
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.9.从文件中导入schema
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.10.从文件中导入点边数据
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md
new file mode 100644
index 0000000000..4e714e1082
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md
@@ -0,0 +1,206 @@
+# Java客户端
+
+> 此文档主要是TuGraph Java SDK的使用说明。
+
+## 1.编译java client代码
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖
+```java
+import com.alipay.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.3.调用存储过程
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.4.加载存储过程
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+
+### 2.5.列举存储过程
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.6.删除存储过程
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+
+### 2.7.从字节流中导入schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException 
+```
+
+### 2.8.从字节流中导入点边数据
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+
+### 2.9.从文件中导入schema
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout) 
+            throws UnsupportedEncodingException, IOException
+```
+
+### 2.10.从文件中导入点边数据
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..a9c06de71b
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,174 @@
+# TuGraph-OGM
+
+## 1.简介
+
+> TuGraph-OGM 项目在其他仓库开源。
+
+TuGraph-OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。同时 TuGraph-OGM 兼容 Neo4j-OGM，Neo4j 生态用户可以无缝迁移到 TuGraph 数据库上。
+
+### 1.1.TuGraph-OGM 功能
+
+TuGraph-OGM 提供以下函数操作 TuGraph：
+
+| 功能                            | 用法                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| 插入单个节点\边                 | void session.save(T object)                                                      |
+| 批量插入节点\边                 | void session.save(T object)                                                      |
+| 删除节点与对应边                | void session.delete(T object)                                                    |
+| 删除指定 label 的全部节点       | void session.deleteAll(Class\<T> type)                                           |
+| 清空数据库                      | void purgeDatabase()                                                             |
+| 更新节点                        | void session.save(T newObject)                                                   |
+| 根据 id 查询单个节点            | T load(Class<T> type, ID id)                                                     |
+| 根据 ids 查询多个节点           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| 根据 label 查询全部节点         | Collection\<T> loadAll(Class\<T> type)                                           |
+| 条件查询                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher 查询（指定返回结果类型） | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher 查询                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.编译 TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.使用 TuGraph-OGM
+
+详细示例请参考 demo 文件夹下的 TuGraphOGMDemo ###在`pom.xml`中引入依赖
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // 构建Movie节点
+    @Id
+    private Long id;      // Movie节点的id
+    private String title; // title属性
+    private int released; // released属性
+
+    // 构建边ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // 构建Actor节点
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// 配置
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//启动driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// 开启session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.通过OGM进行增删改查
+
+```java
+// 增
+Movie jokes = new Movie("Jokes", 1990);  // 新建Movie节点jokes
+session.save(jokes);                     // 将jokes存储在TuGraph中
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // 将speed节点与alice节点通过ACTS_IN进行连接
+session.save(speed);                    // 存储两个节点与一条边
+
+// 删
+session.delete(alice);                  // 删除alice节点以及相连的边
+Movie m = session.load(Movie.class, jokes.getId());   // 根据jokes节点的id获取jokes节点
+session.delete(m);                                    // 删除jokes节点
+
+// 改
+speed.setReleased(2018);
+session.save(speed);                   // 更新speed节点属性
+
+// 查
+Collection<Movie> movies = session.loadAll(Movie.class);  // 获取所有Movie节点
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // 查询所有小于1995年发布的电影
+
+// 调用Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // 查询Speed为2018的Movie
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // 创建节点Label Director
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // 创建边Label DIRECT
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // 获取create结果
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // 查看创建节点数目
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //查看创建边数目
+
+// 清空数据库
+session.deleteAll(Movie.class);        // 删除所有Movie节点
+session.purgeDatabase();               // 删除全部数据
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
new file mode 100644
index 0000000000..8c68a5fd64
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
@@ -0,0 +1,134 @@
+# 命令行工具
+
+> 此文档主要介绍 lgraph_cypher 文档的使用
+
+TuGraph 发布版本附带名为`lgraph_cypher`的查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+## 1.单命令模式
+
+在单命令模式下，`lgraph_cypher`可用于提交单个 Cypher 查询并将结果直接打印到终端，打印结果也可以容易地重定向写入指定文件。当用户需要从服务器获取大量结果并将其保存在文件中时，这非常便利。
+在此模式下，`lgraph_cypher`工具具有以下选项：
+
+### 1.1.命令行参数:
+
+| 参数     | 类型   | 说明                                                                     |
+| -------- | ------ | ------------------------------------------------------------------------ | ------ | ----------------------------------------------------------------------------------------------------------------------------------------- |
+| --help   | \\     | 列出所有参数及说明。                                                     |
+| -example | \\     | 列出命令实例。                                                           |
+| -c       | string | 数据库的配置文件，用于获取 ip 与 port 信息。                             |
+| -h       | string | 数据库服务器 ip 地址，如有配置文件则可舍去此参数。默认值为`127.0.0.1` 。 |
+| -p       | string | 数据库服务器端口，如有配置文件则可舍去此参数。默认值为`7071` 。          |
+| -u       | string | 数据库登录用户名。                                                       |
+| -P       | string | 数据库登录密码。                                                         |
+| -f       | string | 包含单条 Cypher 查询单文本文件的路径。                                   |
+| -s       | string | 单行 cypher 查询命令。以`"`开头结尾。                                    |
+| -t       | int    | 进行 cypher 查询时服务器的超时阈值。默认值为`150`秒。 -format            | string | 查询结果显示模式。支持`plain`与`table`两种格式。`plain`格式会将查询结果单列打印。`table`格式会将查询结果以表格方式显示。默认值为`table`。 |
+
+### 1.2.命令示例:
+
+**cypher 命令文件查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+```
+
+**cypher 命令单句查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+```
+
+## 2.交互模式
+
+`lgraph_cypher`也可以在交互模式下运行。在交互式模式下，客户端与服务器保持连接，并在读取-评估-打印-循环中与用户进行交互。
+
+### 2.1.进入 lgraph_cypher 交互模式:
+
+如不加`-f`或`-s`命令行选项，运行`lgraph_cypher`时将会进入交互模式。使用方式如下：
+
+```
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+```
+
+如成功进入则会显示相应登录成功信息：
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2023 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+现在我们也提供一个交互式 shell ，用于用户输入 Cypher 查询语句或使用`:help`命令来检查可用命令。
+
+### 2.2.command种类与说明:
+
+除 Cypher 查询外，`lgraph_cypher` 的 shell 还接受以下命令：
+
+| 命令                     | 对应参数                           | 说明                                                                                                |
+| ------------------------ | ---------------------------------- | --------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                 | 显示服务器信息与所有 command 对应说明。                                                             |
+| :db_info                 | \\                                 | 当前服务器状态查询。对应 REST API 的/db/info。                                                      |
+| :clear                   | \\                                 | 清空屏幕。                                                                                          |
+| :use                     | {图的名称}                         | 使用该名称指定的图，默认值为`default` 。                                                            |
+| :source                  | `-t {查询timeout值} -f {查询文件}` | 可交互模式下的 cypher 命令文件查询。超时阈值默认值为`150`秒。查询文件格式参考无交互式查询参数。     |
+| :exit                    | \\                                 | 退出交互模式并返回原命令行。                                                                        |
+| :format                  | `plain` or `table`                 | 更改 cypher 查询结果的显示模式。支持`plain`与`table`模式。                                          |
+| :save all/command/result | `-f {文件路径}` `{cypher语句}`     | 存储 cypher 命令（command）或查询结果（result）或以上二者（all）。默认存储位置为`/saved_cypher.txt` |
+
+**注意:**
+
+- 每条命令都应该以冒号开始 `:`.
+
+**:save 命令例子:**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+```
+
+### 2.3.cypher 查询命令:
+
+在交互模式下，用户也可直接输入单句 cypher 命令进行查询，以"`;`"结束。输入命令不区分大小写。例子如下：
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher`输入命令时支持多行输入，用户可使用`ENTER`键将长查询语句分多行输入。多行输入情况下命令行开头会从`>`变为`=>`，然后用户可以继续输入查询的其余部分。
+
+例子如下：
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### 2.4.辅助功能:
+
+**历史查询：** 在交互模式下按上下方向键可查询输入历史。
+
+**自动补全：** lgraph_cypher 会根据输入历史进行自动补全。在补全提示出现的情况下，按下右方向键就会自动补全命令。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/index.rst
new file mode 100644
index 0000000000..8d59c09305
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/4.client-tools/index.rst
@@ -0,0 +1,8 @@
+客户端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
new file mode 100644
index 0000000000..b79cc13cc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
@@ -0,0 +1,1020 @@
+# 运维监控
+
+> 此文档主要介绍 TuGraph 的可视化运维监控
+
+## 1.设计思路
+
+可视化监控并不是TuGraph自身不可或缺的一部分，因此在设计时将可视化监控作为TuGraph周边生态中的一个应用，来减少和TuGraph数据库的耦合度，以及对于TuGraph自身的影响。TuGraph可视化监控采用目前最火热的开源解决方案，TuGraph Monitor + Prometheus + Grafana来实现。其中TuGraph Monitor作为TuGraph服务的客户端，通过TCP链接向TuGraph服务发起Procedure请求，TuGraph服务在接收到请求后收集自身所在机器的cpu，memory，disk，io，以及请求数量等指标的统计结果进行响应。TuGraph Monitor在接收到TuGraph响应的指标数据后，将数据包装成prometheus需要的格式，保存在内存中，等待Prometheus服务通过http请求获取。Prometheus服务会定期通过http请求从TuGraph Monitor获取封装好的请求数据，按照获取的时间保存在自己的时序数据库中。Grafana可以根据用户的配置，从Prometheus处获取某个时间段内的统计数据，并在web界面上绘制浅显易懂的图形来展示最终结果。整个请求链路中，都采用了主动获取，即PULL的模型，好处之一是它能最大限度的避免数据生产者和数据消费者之间的耦合度，使得开发更简单，好处之二是数据生产者不需要考虑数据消费者的数据处理能力，即使某个消费者的数据处理能力较弱，也不会因为生产者生产数据过快而压垮消费者。主动拉取模型的不足之处在于数据的实时性不够，但在这个场景中，数据并没有很高的实时性要求。
+
+### 1.1.TuGraph
+
+TuGraph数据库提供了收集服务所在机器中磁盘，内存，网络IO，以及查询请求等多种数据信息的能力，并通过标准Procedure方式提供查询。收集数据这一动作仅在有用户通过接口查询时才会发生，避免了在用户不需要TuGraph监控服务所在机器的指标时对用户业务查询请求带来的影响。
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor是TuGraph周边生态中的一个工具，它作为TuGraph众多用户中的一个，通过C++ RPC Client与TuGraph进行通信，通过Procedure查询接口来查询TuGraph服务所在机器的性能指标，并将TuGraph返回的结果包装成Prometheus需要的数据模型，等待Prometheus获取。用户可以通过设置查询时间间隔来保证获取监控指标对于业务查询的影响最小化。
+
+### 1.3.Prometheus
+
+Prometheus是一个开源的监控平台，并配备有专属的时序数据库，它会定期通过http请求从TuGraph Monitor服务获取统计指标，并保存在自己的时序数据库中。详细信息请参考官网: [https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana是一个开源的可视化和分析软件，它可以从包含Prometheus在内的多个数据源中获取数据，并且可以将时序数据库中的数据转换为精美图形和可视化效果的工具。具体信息请参考官网: [https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.部署方案
+
+### 2.1.第一步
+
+启动TuGraph服务，详细方法请参考文档: [https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.第二步
+
+启动TuGraph Monitor工具，启动命令如下：
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+参数含义如下
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.第三步
+
++ 下载符合您机器架构以及系统版本的Prometheus tar包，下载地址: [https://prometheus.io/download/](https://prometheus.io/download/)
+
++ 解压tar包，命令如下
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ 修改配置文件prometheus.yml，新增如下配置，使其可以抓取TuGraph Monitor包装好的性能数据
+
+```yaml
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ 启动prometheus，具体的启动参数可以通过如下命令获取
+
+```shell
+./prometheus -h
+```
+
++ 验证prometheus服务是否正常，可以通过web端登陆prometheus服务，查询监控指标resources_report是否已经获取到，能成功查询到数据则正确
+
+### 2.4.第四步
+
++ 下载符合您机器架构以及系统版本的Grafana安装包，下载地址: [https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ 安装Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 启动Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 配置Grafana，首先在数据源设置中配置Prometheus的IP地址，配置完成后可以通过测试连接功能，验证是否成功连接数据源。然后，导入如下模版，并在页面中根据实际情况，修改正确的接口IP和端口。最后可以根据实际情况设置刷新时间和监控时间范围
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana"
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {label_name} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "内存",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  QPS超过1000",
+        "name": "请求统计 alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "请求统计",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "磁盘",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\nCPU使用率超过90%",
+        "name": "CPU使用率 alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU使用率",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  磁盘IO超过10MB/S",
+        "name": "磁盘IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph监控页面",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+验证效果，刷新浏览器页面。如果正确显示饼图和折线图，则配置完成。
+
+## 3.未来计划
+
+目前可视化监控只支持单机监控，能监控服务所在机器的cpu，磁盘，网络io，请求qps等性能指标，未来将会实现监控ha集群的功能，也会将更多有意义的指标纳入监控范围
+
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
new file mode 100644
index 0000000000..6091df21fc
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
@@ -0,0 +1,434 @@
+# TuGraph-DataX
+
+> 此文档主要介绍 TuGraph DataX 的安装编译和使用示例
+
+## 1.简介
+
+TuGraph 在阿里开源的 DataX 基础上添加了 TuGraph 的写插件以及 TuGraph jsonline 数据格式的支持，其他数据源可以通过 DataX 往 TuGraph 里面写数据。
+DataX 介绍参考 [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+支持的功能包括：
+
+- 从 MySQL、SQL Server、Oracle、PostgreSQL、HDFS、Hive、HBase、OTS、ODPS、Kafka 等各种异构数据源导入 TuGraph
+- 将 TuGraph 导入相应的目标源 （待开发）
+
+![导入导出](../../../../images/tugraph-datax.png)
+
+## 2.编译安装
+
+```bash
+git clone git@code.alipay.com:fma/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+编译出来的 DataX 文件在 target 目录下
+
+## 3.文本数据通过DataX导入TuGraph
+
+我们以 TuGraph 手册中导入工具 lgraph_import 章节举的数据为例子，有三个 csv 数据文件，如下：
+`actors.csv`
+
+```
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+```
+
+`movies.csv`
+
+```
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+`roles.csv`
+
+```
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+```
+
+然后建三个 DataX 的 job 配置文件：
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后依次执行如下三个命令：
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## 4.MySQL数据通过DataX导入TuGraph
+
+我们在 `test` database 下建立如下电影 `movies` 表
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+往表中插入几条数据
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+建立一个 DataX 的 job 配置文件
+
+`job_mysql_to_tugraph.json`
+
+**配置字段方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**写简单 sql 方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后执行如下命令：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
new file mode 100644
index 0000000000..f34f415719
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
@@ -0,0 +1,69 @@
+# TuGraph-Explorer
+
+> TuGraph Explorer 强依赖 TuGraph，因此，在启动 Explorer 之前，我们先需要先启动 TuGraph。
+
+## 1.TuGraph Explorer 简介
+
+TuGraph Explorer 是基于 GraphInsight 构建的图可视分析平台，提供了完整的图探索分析能力，能够帮助用户从海量的图数据中洞察出有价值的信息。TuGraph Explorer 当前提供了Docker部署方式。
+
+## 2.启动 TuGraph Explorer
+
+TuGraph 安装成功以后，就可以开始安装 TuGraph Explorer。
+
+- 加载 TuGraph Explorer 镜像：
+
+```shell
+// lgraph_lastest.tar.gz 是 TuGraph 镜像文件名
+$ docker import tugraph_explore.tar.gz
+
+// 加载完毕后, 提示已加载镜像
+```
+
+- 启动 Docker
+
+```shell
+$ docker run -d -p 7091:7091 -it reg.docker.alibaba-inc.com/tugraph-explore:1.0.1
+$ docker exec -it {container_id} bash
+```
+
+参数说明：
+
+- -p 的作用是端口映射，示例中将 Docker 的 7091 端口映射到本地的 7091 端口
+- {container_id} 是 Docker 的 container id，可以通过 docker ps 获得
+
+- 启动 TuGraph Explorer
+
+```shell
+$ cd /usr/src/tugraphexplore
+$ npm run dev -- -p 7091
+```
+
+TuGraph Explorer 服务启动起来以后，通过 **http://localhost:7091/tugraph/explore.html** 就可以访问了，如果一切正常，就会看到如下页面。![image.png](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/tugraph-expolore/tugraph-explore-index.png)
+
+## 3.连接 TuGraph
+
+TuGraph Explorer 启动起来以后，第一步就是需要连接 TuGraph 数据库。点击「连接」按钮，弹出连接图数据库的页面，如下图所示。
+![image.png](https://gw.alipayobjects.com/mdn/rms_fa12c2/afts/img/A*JEUKRYMH--4AAAAAAAAAAAAAARQnAQ)
+
+连接 TuGraph 数据，我们需要提供以下信息：
+
+- 图数据库的账号
+- 图数据库的密码
+- 图数据库的地址：格式为 ip:port
+
+**地址需要填写容器 IP，可以通过如下指令查看**。
+
+```
+$ docker run -d -v /Users/xx/tugraph:/mnt -p 7090:7090 -it reg.docker.alibaba-inc.com/tugraph/tugraph:3.3.0
+$ docker exec -it 8408b49033bc1698(TuGraph 的容器) bash
+$ cat /etc/hosts
+127.0.0.1	localhost
+::1	localhost ip6-localhost ip6-loopback
+fe00::0	ip6-localnet
+ff00::0	ip6-mcastprefix
+ff02::1	ip6-allnodes
+ff02::2	ip6-allrouters
+172.17.0.4	8408b543243bc69
+```
+
+如上所示，连接图数据库的地址应该填写：**172.17.0.4:7090**。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md
new file mode 100644
index 0000000000..cdbda4b4d2
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md
@@ -0,0 +1,64 @@
+# 日志信息
+
+> 此文档主要介绍 TuGraph 的日志功能。
+
+## 1.简介
+
+TuGraph 保留两种类型的日志：服务器日志和审计日志。服务器日志记录人为可读的服务器状态信息，而审核日志维护服务器上执行的每个操作加密后的信息。
+
+## 2.服务器日志
+
+### 2.1.服务器日志分类
+
+当前服务器日志分为三类，`general log`，`debug log`与`query log`。
+
+`general log`面向普通用户，包含用户关注的数据库启动关闭时的关键信息，如数据库启动时的配置信息，服务监听的端口以及是否成功启动或关闭等信息，可以直观的看到数据库是否正在运行。
+
+`debug log`面向数据库开发者，包含开发者关注的数据库运行过程中产生的debug相关信息，如数据库收到的网络请求，query的执行过程等，可以协助开发者进行开发，并可以通过`verbose`配置项控制日志详细程度。
+
+（待实现）`query log`面向业务开发人员，包含业务开发者关注的每一次数据库执行的query语句以及执行该语句时数据库的性能相关信息，如查询时间等。可以通过设定时间阈值的方式过滤执行时间低于指定值的query，方便业务开发者进行性能分析。
+
+### 2.2.服务器日志配置项
+
+服务器日志的输出位置可以通过`log_dir`配置指定。服务器日志中`debug log`的详细程度可通过`verbose`配置项指定。
+
+`log_dir`配置项默认为空。若`log_dir`为空，则所有日志会输出到控制台。若手动指定`log_dir`，则会在对应路径下生成如下日志文件夹结构。
+
+```
+.
+├── debug.log
+├── general.log
+├── query.log(TODO)
+└── history_logs
+    ├── debug_logs
+    ├── general_logs
+    └── query_logs(TODO)
+```
+
+`general log`日志记录在`genreal.log`文件中。`debug log`日志记录在`debug.log`文件中。`query log`日志记录在`query.log`文件中。
+单个日志文件最大大小为64mb，在达到规定的最大文件大小后会被回收入`history_logs`文件夹中，`general.log`回收进入`general_logs`文件夹，`debug.log`回收进入`debug_logs`文件夹中。
+
+`verbose`配置项控制了`debug log`的详细程度，从粗到细分为`0, 1, 2`三个等级。默认等级为`2`，此等级下，日志记录最详细，服务器将打印`DEBUG`及以上等级的全部日志信息，同时附带上打印这条日志信息的`[文件名:函数名:行号]`，便于debug。等级为`1`时，服务器将仅打印`INFO`等级及以上的主要事件的日志。等级为`0`时，服务器将仅打印`ERROR`等级及以上的错误日志。
+
+### 2.3.服务器日志输出宏使用示例
+
+如果开发者在开发过程中希望在代码中添加日志，可以参考如下示例
+
+```
+#include "tools/lgraph_log.h" //添加日志依赖
+
+
+void LogExample() {
+    // 数据库启动阶段已经对日志模块进行了初始化，开发者只需直接调用宏即可
+    // 日志等级分为TRACE, DEBUG, INFO, WARNING, ERROR, FATAL六个等级
+
+    GENERAL_LOG(INFO) << "This is a info level general log message."; // general log的输出宏
+
+    DEBUG_LOG(ERROR) << "This is a error level debug log message."; // debug log的输出宏
+}
+```
+更多用法可以参考test/test_lgraph_log,cpp中的日志宏的使用方法
+
+## 3.审计日志
+
+审核日志记录每个请求和响应，以及发送请求的用户以及收到请求的时间。审核日志只能是打开或关闭状态。可以使用 TuGraph 可视化工具和 REST API 查询结果。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md
new file mode 100644
index 0000000000..1a62bd27a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md
@@ -0,0 +1,198 @@
+# TuGraph-Restful-Server
+
+> TuGraph Restful Server 强依赖 TuGraph，Restful Server 与 Tugraph 共存
+
+## 1.TuGraph-Restful-Server 简介
+TuGraph Restful Server 使用brpc框架支持的http协议，提供restful接口查询功能，在实现中，restful server 与rpc server 使用同一个端口。目前restful接口提供文件上传，数据导入，导入进度查询，cypher查询，文件删除等功能
+
+## 2.启动 TuGraph-Restful-Server
+需要在启动Tugraph时设置enable_rpc参数为true的方式，正常启动TuGraph
+
+## 3.连接 TuGraph-Restful-Server
+TuGraph正常启动后，Restful Server 将监听在rpc_port上， 通过访问 http://${ip}:${rpc_port}/LGraphHttpService/Query/ url可以链接到TuGraph
+
+## 4.数据格式
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+## 5.返回值
+
+通用返回格式
+
+|  body参数  | 参数说明  |  参数类型  |  是否必填  |
+|:--------:|:-----:|:------:| :-----: |
+| errorCode |  状态码  |  字符串  |  是  |
+| errorMessage | 错误信息  |  字符串  |  是  |
+| data | 返回的数据 |  字符串  |  是  |
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 401 Unauthorized: 未通过鉴权认证，例如用户名密码错误，token超过有效期等
+- 500 Internal Server Error: 服务器端错误
+  当操作成功时，返回的 data 中包含操作的返回值。
+  当发生输入错误或者服务器错误时，返回的 errorMessage 中包含错误提示。
+
+## 6.URI格式
+
+| URI               | 说明                 |
+|-------------------|--------------------|
+| /cypher           | 执行cypher查询请求       |
+| /refresh          | 刷新token请求          |
+| /login            | 用户登陆请求             |
+| /logout           | 用户登出请求             |
+| /upload_files     | 上传文件请求             |
+| /clear_cache      | 清理用户上传文件请求         |
+| /check_file       | 文件认证请求             |
+| /import_data      | 数据导入请求             |
+| /import_progress  | 导入进度查询请求           |
+| /import_schema    | 批量创建schema请求       |
+
+## 7.接口
+### 7.1 用户登陆
+用于用户第一次与服务端通信时的鉴权操作，请求报文在 http body 中携带用户名和密码，响应报文在 http body 中会返回一个带有有效期的token，后续请求中需要在http header中携带该token作为凭证
+#### 7.1.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/login
+#### 7.1.2 REQUEST
+|  body参数  |  参数说明  |  参数类型  |  是否必填  |
+|:--------:|:------:|:------:| :-----: |
+ | userName |  用户名  |  字符串  |  是  |
+ | password |   密码   |  字符串  |  是  |
+#### 7.1.3 RESPONSE
+|    body参数     | 参数说明  |  参数类型  |  是否必填  |
+|:-------------:|:-----:|:------:| :-----: |
+| authorization | token |  字符串  |  是  |
+
+### 7.2 刷新token
+token到期后将无法使用此token与服务端正常通信，需要获取新的token作为后续请求的凭证，请求报文在http header中携带旧的token，响应报文在http body中返回新的token
+#### 7.2.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/refresh
+#### 7.2.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+#### 7.2.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| authorization | 新的token |  字符串  |  是  |
+
+### 7.3 用户登出
+用户不再需要与服务端进行通信时，需要请求登出接口，释放自己的token。请求报文在http header中携带旧的token，如果拿到返回errorCode为200的响应报文即为正常登出
+#### 7.3.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/logout
+#### 7.3.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+### 7.4 执行cypher查询请求
+用户通过此类请求发cypher给server端执行并获取执行结果，请求报文在http body 中将执行的cypher语句和目标子图发送给server，server执行完成后在响应报文的http body中返回执行结果
+#### 7.4.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/cypher
+
+#### 7.4.2 REQUEST
+| body参数 |    参数说明    |  参数类型  |  是否必填  |
+|:------:|:----------:|:------:| :-----: |
+| graph  |   查询目标子图   |  字符串  |  是  |
+| script | cypher查询语句 |  字符串  |  是  |
+
+#### 7.4.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| result | 返回结果 |  字符串  |  是  |
+
+### 7.5 上传文件请求
+用户通过此类请求向server发送文件，可以对文件进行分片，分片大小不大于1MB，支持多线程乱序发送，请求报文在http header 中包含文件名，第一字节内容在文件中的偏移和分片大小，在body中包含文件内容，server收到请求后将验证分片大小是否与分片内容一致，一致时将文件分段写入文件。不一致时将返回errorCode为400的响应
+#### 7.5.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/upload_files
+
+#### 7.5.2 REQUEST
+| header参数  |    参数说明    |  参数类型  |  是否必填  |
+|:---------:|:----------:|:------:| :-----: |
+| File-Name |   文件名   |  字符串  |  是  |
+| Begin-Pos | 开始位置在文件内的偏移 |  字符串  |  是  |
+|   Size    | 文件分片大小 |  字符串  |  是  |
+|  body参数   |  参数说明   |  参数类型  |  是否必填  |
+|     -     | 文件内容 |  字符串  |  是  |
+
+### 7.6 文件认证请求
+用户通过此类请求验证发送到server端的文件是否与期望一致，server端使用两种验证方式，md5值和文件长度，目前已支持文件长度验证。
+#### 7.6.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/check_file
+#### 7.6.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| fileName |           文件名           |  字符串  |  是  |
+| checkSum |        文件对应md5值         |  字符串  |  否  |
+| fileSize |       文件长度(以字节计算)       |  字符串  |  否  |
+| flag | 标记位，为1时校验md5值，为2时校验文件长度 |  字符串  |  是  |
+
+#### 7.6.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| pass | 检查成功为true，否则为false |  bool  |  是  |
+
+### 7.7 批量创建schema请求
+用户通过此类请求批量创建schema，请求报文在http body 中将创建schema的目标子图和schema信息发送给server，如果拿到返回errorCode为200的响应报文即为正常创建
+#### 7.7.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_schema
+#### 7.7.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| graph |   创建目标子图   |  字符串  |  是  |
+| schema | schema描述信息 |  字符串  |  是  |
+
+### 7.8 数据导入请求
+用户通过此类请求导入已经上传的数据文件。导入不论成功或失败，都将删除已上传文件。数据导入请求在server中实现为一个异步任务，响应返回并不意味着导入已完成，返回的是任务id，后续可以通过此任务id查询导入进度
+#### 7.8.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_data
+#### 7.8.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  | 是否必填 |
+|:--------:|:-----------------------:|:------:|:----:|
+| graph |         导入目标子图          |  字符串  |  是   |
+| schema |       导入schema描述        | json字符串  |  是   |
+| delimiter |           分隔符           |  字符串  |  是   |
+| continueOnError |     单行数据出错是否跳过错误并继续     |  boolean  |  否   |
+| skipPackages |         跳过的包个数          |  字符串  |  否   |
+| taskId |  任务id   |  字符串  |  否   |
+| other | 其他参数 |  json字符串  |  否   |
+
+#### 7.8.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| taskId | 任务编号 |  字符串  |  是  |
+
+### 7.9 清理用户上传文件请求
+用户通过此类请求清理已经上传的文件，如果拿到返回errorCode为200的响应报文即为正常清理
+#### 7.9.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/clear_cache
+#### 7.9.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| fileName |    文件名称    |  字符串  |  否  |
+| userName |    用户名称    |  字符串  |  否  |
+| flag | 标记位， flag = 0时删除fileName指定文件, flag = 1时删除userName指定用户已经上传的所有文件， flag = 2时删除所有用户上传的文件 |  字符串  |  是  |
+
+### 7.10. 导入进度查询请求
+用户通过此类请求获得导入任务的状态
+#### 7.10.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_progress
+#### 7.10.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| taskId |           任务编号           |  字符串  |  是  |
+
+#### 7.10.3 RESPONSE
+| body参数 |                  参数说明                   |  参数类型  |  是否必填  |
+|:------:|:---------------------------------------:|:------:| :-----: |
+| state  | 状态标记，为0表示准备导入，为1表示导入中，为2表示导入成功，为3表示导入失败 |  字符串  |  是  |
+|  progress  |             导入进度，state为1时包含             |  字符串  |  否  |
+|  reason  |             失败原因，state为3时包含             |  字符串  |  否  |
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst
new file mode 100644
index 0000000000..bf92f16478
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst
@@ -0,0 +1,8 @@
+生态工具
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/1.cypher.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/1.cypher.md
new file mode 100644
index 0000000000..8de475baeb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/1.cypher.md
@@ -0,0 +1,2320 @@
+# Cypher API
+
+> 此文档主要介绍了TuGraph-Cypher的详细使用说明
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators支持进度一览：
+
+| 类别                                 | 支持                                                                                                        | 待支持                             |
+| ------------------------------------ | ----------------------------------------------------------------------------------------------------------- | ---------------------------------- |
+| General operators                    | `DISTINCT`, `.` for property access                                                                     | `[]` for dynamic property access |
+| Mathematical operators               | `+`, `-`, `*`, `/`, `%`, `^`                                                                    |                                    |
+| Comparison operators                 | `=`, `<>`, `<`, `>`, `<=`, `>=`, `IS NULL`, `IS NOT NULL`                                   |                                    |
+| String-specific comparison operators | `STARTS WITH`, `ENDS WITH`, `CONTAINS`, `REGEXP`                                                    |                                    |
+| Boolean operators                    | `AND`, `OR`, `XOR`, `NOT`                                                                           |                                    |
+| String operators                     | `+` for concatenation                                                                                     |                                    |
+| List operators                       | `+` for concatenation, `IN` to check existence of an element in a list, `[]` for accessing element(s) |                                    |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+```
+MATCH (p:person) RETURN DISTINCT p.born
+```
+
+- ❏ Accessing properties of a nested literal map using the `.` operator
+
+```
+WITH {person: {name: 'Anne', age: 25}} AS p
+RETURN p.person.name
+```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+
+```
+CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+       (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+       (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+```
+
+```
+MATCH (restaurant:Restaurant), (category:Category)
+WHERE restaurant["rating_" + category.name] > 6
+RETURN DISTINCT restaurant.name
+```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator  `^`
+
+```
+WITH 2 AS number, 3 AS exponent
+RETURN number ^ exponent AS result
+```
+
+- ✓ Using the unary minus operator `-`
+
+```
+WITH -3 AS a, 4 AS b
+RETURN b - a AS result
+```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+
+```
+WITH 4 AS one, 3 AS two
+RETURN one > two AS result
+```
+ 
+### 1.5.String-specific comparison operators
+
+- ✓ Using STARTS WITH to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate STARTS WITH 'Jo'
+RETURN candidate
+```
+
+- ✓ Using REGEXP to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate REGEXP 'Jo.*n'
+RETURN candidate
+```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+```
+WITH [2, 4, 7, 9, 12] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number = 4 OR (number > 6 AND number < 10)
+RETURN number
+```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+
+```
+RETURN [1,2,3,4,5]+[6,7] AS myList
+```
+
+- ✓ Using IN to check if a number is in a list
+
+```
+WITH [2, 3, 4, 5] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number IN [2, 3, 8]
+RETURN number
+```
+
+- ✓ Accessing elements in a list using the [] operator
+
+```
+WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+RETURN names[1..3] AS result
+```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses支持进度一览：
+
+| 类别                    | 语法                                  | 备注   |
+| ----------------------- | ------------------------------------- | ------ |
+| Reading clauses         | MATCH                                 | 支持   |
+|                         | OPTIONAL MATCH                        | 支持   |
+|                         | MANDATORY MATCH                       | 待支持 |
+| Projecting clauses      | RETURN … [AS]                        | 支持   |
+|                         | WITH … [AS]                          | 支持   |
+|                         | UNWIND … [AS]                        | 支持   |
+| Reading sub-clauses     | WHERE                                 | 支持   |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | 支持   |
+|                         | SKIP                                  | 支持   |
+|                         | LIMIT                                 | 支持   |
+| Writing clauses         | CREATE                                | 支持   |
+|                         | DELETE                                | 支持   |
+|                         | DETACH DELETE                         | 支持   |
+|                         | SET                                   | 支持   |
+|                         | REMOVE                                | 支持   |
+| Reading/Writing clauses | MERGE                                 | 支持   |
+|                         | CALL […YIELD]                        | 支持   |
+| Set operations          | UNION                                 | 待支持 |
+|                         | UNION ALL                             | 支持   |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+
+  ```
+  MATCH (n)
+  RETURN n
+  ```
+
+  - ✓ Get all nodes with a label
+
+  ```
+  MATCH (movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Related nodes
+
+  ```
+  MATCH (person {name: 'Laurence Fishburne'})-[]-(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Match with labels
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]-(movie:movie)
+  RETURN movie.title
+  ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]->(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Directed relationships and variable
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[r]->(movie)
+  RETURN type(r)
+  ```
+
+  - ✓ Match on relationship type
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})<-[:acted_in]-(actor)
+  RETURN actor.name
+  ```
+
+  - ✓ Match on multiple relationship types
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[:acted_in|:directed]-(person)
+  RETURN person.name
+  ```
+
+  - ✓ Match on relationship type and use a variable
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[r:acted_in]-(actor)
+  RETURN r.role
+  ```
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+
+  ```
+  MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+  RETURN type(r)
+  ```
+
+  - ✓ Multiple relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in]->(movie)<-[:directed]-(director)
+  RETURN movie.title, director.name
+  ```
+
+  - ✓ Variable-length relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in*1..3]-(movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Relationship variable in variable-length relationships
+
+  ```
+  MATCH p = (laurence {name: 'Laurence Fishburne'})-[:acted_in*2]-(co_actor)
+  RETURN p
+  ```
+
+  - ❏ Match with properties on a variable-length path
+
+  ```
+  MATCH p = (charlie:person)-[* {blocked:false}]-(martin:person)
+  WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+  RETURN p
+  ```
+
+  - ✓ Zero-length paths
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})-[*0..1]-(x)
+  RETURN x
+  ```
+
+  - ✓ Named paths
+
+  ```
+  MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+  ```
+
+  - ✓ Matching on a bound relationship
+
+  ```
+  MATCH (a)-[r]->(b)
+  WHERE euid(r)="0_3937_0_0_0"
+  RETURN a,b
+  ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+  CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+  ```
+
+  - ✓ All shortest paths
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+  CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN
+  nodeIds,relationshipIds,cost
+  ```
+- Get node or relationship by id
+
+  - ✓ Node by id
+
+  ```
+  MATCH (n)
+  WHERE id(n)= 0
+  RETURN n
+  ```
+
+  - ✓ Relationship by id
+
+  ```
+  MATCH ()-[r]->()
+  WHERE euid(r) = "0_3937_0_0_0"
+  RETURN r
+  ```
+
+  - ✓ Multiple nodes by id
+
+  ```
+  MATCH (n)
+  WHERE id(n) IN [0, 3, 5]
+  RETURN n
+  ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n
+```
+
+- ✓ Return relationships
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'})-[r:acted_in]->(c)
+RETURN r
+```
+
+- ✓ Return property
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n.born
+```
+
+- ❏ Return all elements
+
+```
+MATCH p = (a {name: 'A'})-[r]->(b)
+RETURN *
+```
+
+- ❏ Variable with uncommon characters
+
+```
+MATCH (`This isn\'t a common variable`)
+WHERE `This isn\'t a common variable`.name = 'A'
+RETURN `This isn\'t a common variable`.happy
+```
+
+- ✓ Aliasing a field
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born AS SomethingTotallyDifferent
+```
+
+- ✓ Optional properties
+
+```
+MATCH (n)
+RETURN n.age
+```
+
+- ❏ Other expressions
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born > 1900, "I'm a literal", (a)-[]->()
+```
+
+`(a)-[]->()`  not supported.
+
+- ✓ Unique results
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})-[]->(b)
+RETURN DISTINCT b
+```
+
+### 2.4.WHERE
+
+- Basic usage
+  - ✓ Boolean operations
+
+  ```
+  MATCH (n)
+  WHERE n.name = 'Laurence Fishburne' XOR (n.born > 1965 AND n.name = 'Carrie-Anne Moss')
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node label
+
+  ```
+  MATCH (n)
+  WHERE n:person
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node property
+
+  ```
+  MATCH (n)
+  WHERE n.born > 2000
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on relationship property
+
+  ```
+  MATCH (n)-[k:acted_in]->(f)
+  WHERE k.role = "Trinity"
+  RETURN f.title
+  ```
+
+  - ❏ Filter on dynamically-computed property
+
+  ```
+  WITH 'AGE' AS propname
+  MATCH (n)
+  WHERE n[toLower(propname)]< 30
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Property existence checking
+
+  ```
+  MATCH (n)
+  WHERE exists(n.born)
+  RETURN n.name, n.born
+  ```
+
+- String matching
+  - ✓ Match the beginning of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name STARTS WITH 'Pet'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match the ending of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name ENDS WITH 'ter'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match anywhere within a string
+
+  ```
+  MATCH (n)
+  WHERE n.name CONTAINS 'ete'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ String matching negation
+
+  ```
+  MATCH (n)
+  WHERE NOT n.name ENDS WITH 's'
+  RETURN n.name, n.born
+  ```
+
+- Using path patterns in `WHERE`
+  - ❏ Filter on patterns
+
+  ```
+  MATCH (tobias {name: 'Tobias'}), (others)
+  WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+  RETURN others.name, others.age
+  ```
+
+  - ❏ Filter on patterns using NOT
+
+  ```
+  MATCH (persons), (peter {name: 'Peter'})
+  WHERE NOT (persons)-[]->(peter)
+  RETURN persons.name, persons.age
+  ```
+
+  - ❏ Filter on patterns with properties
+
+  ```
+  MATCH (n)
+  WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Filter on relationship type
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name='Laurence Fishburne' AND type(r) STARTS WITH 'ac'
+  RETURN type(r), r.role
+  ```
+
+- Lists
+  - ✓ IN operator
+
+  ```
+  MATCH (a)
+  WHERE a.name IN ['Laurence Fishburne', 'Tobias']
+  RETURN a.name, a.born
+  ```
+
+- Missing properties and values
+  - ✓ Default to false if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white'
+  RETURN n.name, n.age, n.belt
+  ```
+
+  - ✓ Default to true if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+  ORDER BY n.name
+  ```
+
+  - ✓ Filter on null
+
+  ```
+  MATCH (person)
+  WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+  person.belt
+  ```
+
+- Using ranges
+  - ✓ Simple range
+
+  ```
+  MATCH (a)
+  WHERE a.name >= 'Peter'
+  RETURN a.name, a.born
+  ```
+
+  - ✓ Composite range
+
+  ```
+  MATCH (a)
+  WHERE a.name > 'Andres' AND a.name < 'Tobias'
+  RETURN a.name, a.born
+  ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 3
+```
+
+- ✓ Return middle two records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 1
+LIMIT 2
+```
+
+- ❏ Using an expression with SKIP to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP toInteger(3*rand())+ 1
+```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT 3
+```
+
+- ❏ Using an expression with LIMIT to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT toInteger(3 * rand())+ 1
+```
+
+### 2.7.CREATE
+
+- Create nodes
+
+> **Note**
+> TuGraph不支持创建空的nodes，不支持多labels。
+
+  - ☒ Create single node
+
+  ```
+  CREATE (n)
+  ```
+
+  - ☒ Create multiple nodes
+
+  ```
+  CREATE (n), (m)
+  ```
+
+  - ☒ Create a node with a label
+
+  ```
+  CREATE (n:person)
+  ```
+
+  - ☒ Create a node with multiple labels
+
+  ```
+  CREATE (n:Person:Swedish)
+  ```
+
+  - ✓ Create node and add labels and properties
+
+  ```
+  CREATE (n:person {id:2001, name: 'Andres'})
+  ```
+
+  - ✓ Return created node
+
+  ```
+  CREATE (n:person {id:2002, name: 'Andres'})
+  RETURN n
+  ```
+
+- Create relationships
+  - ✓ Create a relationship between two nodes
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:write]->(m)
+  ```
+
+  - ✓ Create a relationship and set properties
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:acted_in{role: 'Trinity'}]->(m)
+  ```
+
+  - ❏ Create a full path
+
+  ```
+  CREATE p = (andres:person {id: 2005, name:'Andres'})-[:acted_in {role: 'Trinity'}]->
+  (m:movie {id: 2006})<-[:acted_in {role: 'Trinity'}]-(michael {id: 2006, name:'Michael'})
+  RETURN p
+  ```
+
+- Use parameters with CREATE
+  - ❏ Create node with a parameter for the properties
+
+  ```
+  CREATE (n:Person $props)
+  RETURN n
+  ```
+
+  - ☒ Create multiple nodes with a parameter for their properties
+
+  ```
+  UNWIND $props AS map
+  CREATE (n)
+  SET n = map
+  ```
+  cannot create vertex without label.
+
+### 2.8.CALL[…YIELD]
+
+- ✓ Call a procedure using CALL
+
+```
+CALL db.vertexLabels
+```
+
+- ✓ View the signature for a procedure
+
+```
+CALL dbms.procedures() YIELD name, signature
+RETURN signature
+```
+
+- ❏ Call a procedure using a quoted namespace and name
+
+```
+CALL `db`.`vertexLabels`
+```
+
+- ✓ Call a procedure with literal arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+```
+
+- ❏ Call a procedure with parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+```
+
+- ❏ Call a procedure with mixed literal and parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+```
+
+- ✓ Call a procedure with literal and default arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+```
+
+- ✓ Call a procedure within a complex query using CALL…YIELD
+
+```
+CALL db.vertexLabels() YIELD label
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure and filter its results
+
+```
+CALL db.vertexLabels() YIELD label
+WHERE label CONTAINS 'User'
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure within a complex query and rename its outputs
+
+```
+CALL db.propertyKeys() YIELD propertyKey AS prop
+MATCH (n)
+WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+
+```
+MATCH (n:person)
+RETURN n.name AS name
+UNION ALL MATCH (n:movie)
+RETURN n.title AS name
+```
+
+- ❏ Combine two queries and remove duplicates
+
+```
+MATCH (n:Actor)
+RETURN n.name AS name
+UNION
+MATCH (n:Movie)
+RETURN n.title AS name
+```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| 种类                   | 功能               | 备注                      |
+| ---------------------- | ------------------ | ------------------------- |
+| Predicate functions    | exists()           |                           |
+|                        | all()              | 不支持                    |
+|                        | any()              | 不支持                    |
+|                        | single()           | 不支持                    |
+|                        | none()             | 不支持                    |
+| Scalar functions       | id()               |                           |
+|                        | euid()             |                           |
+|                        | properties()       |                           |
+|                        | head()             |                           |
+|                        | last()             |                           |
+|                        | toBoolean()        |                           |
+|                        | toFloat()          |                           |
+|                        | toInteger()        |                           |
+|                        | toString()         |                           |
+|                        | type()             |                           |
+|                        | startnode()        |                           |
+|                        | endnode()          |                           |
+|                        | size()             |                           |
+|                        | length()           |                           |
+|                        | label()            | OpenCypher扩展方法      |
+| Aggregating functions  | avg()              |                           |
+|                        | collect()          |                           |
+|                        | count()            |                           |
+|                        | max()              |                           |
+|                        | min()              |                           |
+|                        | percentileCont()   |                           |
+|                        | percentileDisc()   |                           |
+|                        | stDev()            |                           |
+|                        | stDevP()           |                           |
+|                        | variance()         |                           |
+|                        | varianceP()        |                           |
+|                        | sum()              |                           |
+| List functions         | keys()             |                           |
+|                        | labels()           | 返回结果有且只有一个label |
+|                        | nodes()            |                           |
+|                        | range()            |                           |
+|                        | subscript()        | 不支持                    |
+| Mathematical functions | abs()              |                           |
+|                        | ceil()             |                           |
+|                        | floor()            |                           |
+|                        | rand()             |                           |
+|                        | round()            |                           |
+|                        | sign()             |                           |
+| String functions       | /                  |                           |
+
+### 3.2.Predicate functions
+
+- exists()
+  judge it whether a vertex or edge has the field  .
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+WHERE exists(n.born)
+RETURN n.name, n.born
+```
+
+**Example output:**
+
+| exists(name) |
+| ------------ |
+| true         |
+
+### 3.3.Scalar functions
+
+- id()
+  get the id of vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN id(a)
+```
+
+**Example output:**
+
+| vid |
+| --- |
+| 1   |
+| 2   |
+| ... |
+
+- properties()
+  get  a map containing all the properties of a node or relationship.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person {name: 'Laurence Fishburne'})
+RETURN n
+```
+
+- head()
+  get the first element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, head(coll)
+```
+
+**Example output:**
+
+| coll                  | head(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "one"         |
+
+- last()
+  get the last element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, last(coll)
+```
+
+**Example output:**
+
+| coll                  | last(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "three"       |
+
+- toFloat()
+  Converts an integer or string value to a floating point number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toFloat('11.5')
+```
+
+**Example output:**
+
+| float |
+| ----- |
+| 11.5  |
+
+- toInteger()
+  Converts a floating point or string value to an integer value.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toInteger('2.3') AS integer
+```
+
+**Example output:**
+
+| integer |
+| ------- |
+| 2       |
+
+- toString()
+  Converts an integer, float, boolean value to a string.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toString(2.3)
+```
+
+- type()
+  get the string representation of the relationship type.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)-[r]->()
+WHERE n.name = 'Laurence Fishburne'
+RETURN type(r)
+```
+
+**Example output:**
+
+| type     |
+| -------- |
+| acted_in |
+| acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+  Returns the average of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN avg(n.born)
+```
+
+**Example output:**
+
+| avg(n.born)        |
+| ------------------ |
+| 1869.2661654135338 |
+
+- collect()
+  Returns a list containing the values returned by an expression.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN collect(n.born)
+```
+
+**Example output:**
+
+| collect(n.born) |
+| --------------- |
+| [1967,...]      |
+
+- count()
+  Returns the number of values or records.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n {name: 'Laurence Fishburne'})-[]->(x)
+RETURN labels(n), n.born, count(*)
+```
+
+**Example output:**
+
+| labels(n)  | n.born | count(*) |
+| ---------- | ------ | -------- |
+| ["person"] | 1961   | 3        |
+
+- max()
+  Returns the maximum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN max(n.born)
+```
+
+**Example output:**
+
+| max(n.born) |
+| ----------- |
+| 2003        |
+
+- min()
+  Returns the minimum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN min(n.born)
+```
+
+**Example output:**
+
+| min(n.born) |
+| ----------- |
+| 1000        |
+
+- percentileCont()
+  Returns the percentile of a value over a group using linear interpolation.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileCont(n.born, 0.4)
+```
+
+**Example output:**
+
+| percentileCont(n.born, 0.4) |
+| --------------------------- |
+| 1953                        |
+
+- percentileDisc()
+  Returns the nearest value to the given percentile over a group using a rounding method.
+  **Scope:** whole instance.
+  **Output:** the percentile of the given value over a group.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileDisc(n.born, 0.5)
+```
+
+**Example output:**
+
+| percentileDisc(n.age, 0.5) |
+| -------------------------- |
+| 1959                       |
+
+- stDev()
+  Returns the standard deviation for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDev(n.born)
+```
+
+**Example output:**
+
+| stDev(n.born)      |
+| ------------------ |
+| 279.53117993401725 |
+
+- stDevP()
+  Returns the standard deviation for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDevP(n.born)
+```
+
+**Example output:**
+
+| stDevP(n.born)     |
+| ------------------ |
+| 279.3209270423399  |
+
+- variance()
+  Returns the variance for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN variance(n.born)
+```
+
+**Example output:**
+
+| variance(n.age)   |
+| ----------------- |
+| 78137.68055530392 |
+
+- varianceP()
+  Returns the variance for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN varianceP(n.born)
+```
+
+**Example output:**
+
+| varianceP(n.age)  |
+| ----------------- |
+| 78020.18028379219 |
+
+- sum()
+  Returns the sum of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN sum(n.born)
+```
+
+**Example output:**
+
+| sum(n.born) |
+| ----------- |
+| 1243062     |
+
+### 3.5.List Funtions:
+
+- keys()
+  get the field names of some vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN keys(a) LIMIT 1
+```
+
+**Example output:**
+
+| keys(a)               |
+| --------------------- |
+| ["name","age","eyes"] |
+
+- labels()/label()
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN labels(a) LIMIT 1
+```
+
+**Example output:**
+
+| labels                 |
+| ---------------------- |
+| ["Person"]             |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice"})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+
+### 3.6.Mathematical functions
+
+- abs()
+  get the absolute value of some data.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a:person {name: 'Laurence Fishburne'}),
+(e:person {name: 'Carrie-Anne Moss'})
+RETURN a.born, e.born, abs(a.born-e.born)
+```
+
+**Example output:**
+
+| a.born | e.born | abs(a.born - e.born) |
+| ------ | ------ | -------------------- |
+| 38     | 41     | 1                    |
+
+- ceil()
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN ceil(0.1)
+```
+
+**Example output:**
+
+| ceil(0.1) |
+| --------- |
+| 1.0       |
+
+- floor()
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN floor(0.9)
+```
+
+**Example output:**
+
+| floor(0.9) |
+| ---------- |
+| 0.0        |
+
+- round()
+  Returns the value of a number rounded to the nearest integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN round(3.141592)
+```
+
+**Example output:**
+
+| round |
+| ----- |
+| 3     |
+
+- rand()
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN rand()
+```
+
+**Example output:**
+
+| rand()             |
+| ------------------ |
+| 0.9797131960534085 |
+
+- sign()
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN sign(-17), sign(0.1)
+```
+
+**Example output:**
+
+| sign(-17) | sign(0.1) |
+| --------- | --------- |
+| -1        | 1         |
+
+TuGraph 查询语言与 OpenCypher 的不同点如下：
+
+- Label 数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 4.附录1. 语法扩充及不同
+
+TuGraph查询语言与OpenCypher的不同点如下：
+
+- Label数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.附录2. 内置procedures列表
+### 5.1.procedures样例
+
+* dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                        | name         |
+  | ---------------------------------------------------- | -------------------- |
+  | db.vertexLabels() :: (label::STRING)               | db.vertexLabels        |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels |
+  | db.indexes() :: (index::LIST)            | db.indexes       |
+  | ...                          | ...          |
+
+* db.subgraph()
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | vids       | list           | list of vertex id                                                     |
+
+  **Output:**
+
+  Get a json containing all the properties of nodes and relationships.
+
+  **Example input:**
+
+  ```
+  CALL db.subgraph([3937,4126,4066,4010])
+  ```
+
+  **Example output**
+
+  | subgraph |
+  | -------- |
+  | {"nodes":[{"identity":3937,"label":"movie","properties":{"duration":136,"id":1,"poster_image":"http://image.tmdb.org/t/p/w185/gynBNzwyaHKtXqlEKKLioNkjKgN.jpg","rated":"R","summary":"Thomas A. Anderson is a man living two lives. By day he is an average computer programmer and by night a malevolent hacker known as Neo who finds himself targeted by the police when he is contacted by Morpheus a legendary computer hacker who reveals the shocking truth about our reality.","tagline":"Welcome to the Real World.","title":"The Matrix"}},{"identity":4010,"label":"user","properties":{"id":44,"login":"Howard"}},{"identity":4066,"label":"user","properties":{"id":202,"login":"Enoch"}},{"identity":4126,"label":"user","properties":{"id":464,"login":"Wilburn"}}],"relationships":[{"dst":4126,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4010,"temporal_id":0},{"dst":4010,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4066,"temporal_id":0},{"dst":4066,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4126,"temporal_id":0}]} |
+
+* db.vertexLabels()
+
+  Lists all available vertex labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+  **Example output:**
+
+    | label   |
+    | ------- |
+    | genre   |
+    | keyword |
+    | movie   |
+    | ...     |
+
+* db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edge labels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | relationshipType |
+  | ---------------- |
+  | acted_in     |
+  | directed     |
+  | ...          |
+
+* db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of  vertex label    |
+  | primary_field | string  | primary field of vertex label |
+  | field_spec | list       | specification of a field |
+
+   in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+    **Output:** If successful, it returns a success message.
+
+    **Example input:**
+
+    ```
+    CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+    ```
+
+    **Example output:**
+
+    ```
+    Added label [Person]
+    ```
+
+* db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description           |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field         |
+  | type       | string     | type of the field         |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name     | type   | optional |
+  | ------------ | ------ | -------- |
+  | id       | INT32  | false    |
+  | born     | INT32  | true     |
+  | name     | STRING | true     |
+  | poster_image | STRING | true     |
+
+* db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | extra      | string     | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.
+    for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+* db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:**
+
+  | field_name | field_type | description              |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description           |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string      | either 'vertex' or 'edge'     |
+  | label_name  | string      | name of the label         |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description           |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string     | either 'vertex' or 'edge' |
+  | label_name       | string     | name of the label     |
+  | field_value_spec | list       | specification of a field  |
+
+    in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, optional]`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+    ```
+    CALL db.alterLabelModFields(
+    'vertex',
+    'new_label',
+    ['birth_date', DATETIME, true],
+    ['gender', BOOL, true])
+    ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of the label    |
+  | edge_constraints | string | edge constraints |
+  | field_spec | list       | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for  optional fields.
+
+  `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+* db.addIndex(label_name, field_name, is_unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | is_unique  | boolean    | Specifies whether the index is unique |
+
+   **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+   **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+* dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description      |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string     | the current password |
+  | new_password     | string     | new password     |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+   **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string     | the user's name |
+  | new_password | string     | new password    |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.createUser(user_name, password)
+
+  create  new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | -------------------------------- |
+  | user_name | string     | the new user name        |
+  | password  | string     | the password of new user     |
+  
+   **Output:**
+  
+    If successful, it returns a success message.
+  
+   **Example input:**
+  
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+  
+   **Example output:**
+  
+  ```
+  true
+  ```
+  
+* dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string     | the user name to be deleted |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+   a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string     | the user name           |
+  | is.admin  | boolean    | the permission of this user |
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       |  ...    |
+
+* dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+    a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description       |
+  | --------- | -------------- | --------------------- |
+  | user.user | string     | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+* dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+   a list of  ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host     |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...      |
+
+* dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+   the number of ip which been deleted.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+    the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description              |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string     | the name of new subgraph     |
+  | description | string     | description of new subgraph      |
+  | max_size_GB | integer    | Upper limit of subgraph capacity |
+
+   **Output:**
+
+    if successful , it will return true.
+
+   **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+   **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+  | config     | map        | the configuration to be modified     |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.listGraphs()
+
+  get all subgraphs in this graph database.
+
+  **Output:**
+
+    a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+
+* dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+    | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+* dbms.config.list()
+
+  get config of this graph database.
+
+  **Output:**
+
+    a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  |-----------| ---------|
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       |  ...    |
+
+* dbms.config.update(updates)
+
+  get some config of this graph database.
+
+  **Output:**
+
+    If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+    enable_ip_check:false,
+    durable:true,
+    optimistic_txn:true,
+    enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+* dbms.takeSnapshot()
+
+  take the  snapshot  on this current graph database.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+* dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path               |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+* algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                          |
+  | --------- | -------------- | ------------------------------------------------------------ |
+  | startNode | Node       | the source node of paths                     |
+  | endNode   | Node       | the destination node paths                   |
+  | config    | MAP        | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+    If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2     | 1     |
+
+* algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+* algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                        |
+  | --------- | -------------- | ---------------------------------------------------------- |
+  | id    | ANY        | the id of vertexes or edges , the id must be variable      |
+  | config    | MAP        | the configuration of  this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or  it is an edge id.
+
+  **Output:**
+
+    If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.内置procedures完整列表
+
+| Name                                  | Description                           | Signature                                                                                                                                                        |
+|---------------------------------------|---------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.subgraph                           | 列出点的子图                                | db.subgraph(vids::LIST) :: (subgraph::STRING)                                                                                                                    |
+| db.vertexLabels                       | 列出所有Vertex Label                      | db.vertexLabels() :: (label::STRING)                                                                                                                             |
+| db.edgeLabels                         | 列出所有Edge Label                        | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                          |
+| db.indexes                            | 列出所有索引                                | db.indexes() :: (label::STRING,field::STRING,unique::BOOLEAN)                                                                                                    |
+| db.listLabelIndexes(label_name)       | 列出所有与某个Label相关的索引                     | db.listLabelIndexes(label_name:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN)                                                                          |
+| db.warmup                             | 预热数据                                  | db.warmup() :: (time_used::STRING)                                                                                                                               |
+| db.createVertexLabel                  | 创建Vertex Label                        | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                           |
+| db.createLabel                        | 创建Vertex/Edge Label                   | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                      |
+| db.getLabelSchema                     | 列出label schema                        | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                        |
+| db.getVertexSchema                    | 列出点的 schema                           | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                               |
+| db.getEdgeSchema                      | 列出边的 schema                           | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                 |
+| db.deleteLabel                        | 删除Vertex/Edge Label                   | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                |
+| db.alterLabelDelFields                | 修改label删除属性                           | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                     |
+| db.alterLabelAddFields                | 修改label添加field                        | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                          |
+| db.alterLabelModFields                | 修改label field                         | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                |
+| db.createEdgeLabel                    | 创建Edge Label                          | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                              |
+| db.addIndex                           | 创建索引                                  | db.addIndex(label_name::STRING,field_name::STRING,is_unique::BOOLEAN) :: (::VOID)                                                                                |
+| db.deleteIndex                        | 删除索引                                  | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                |
+| db.backup                             | 备份数据                                  | db.backup(destination::STRING) :: ()                                                                                                                             |
+| dbms.procedures                       | 列出所有procedures                        | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                            |
+| dbms.security.changePassword          | 更改当前用户的密码                             | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                          |
+| dbms.security.changeUserPassword      | 更改指定用户的密码                             | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                             |
+| dbms.security.createUser              | 创建用户                                  | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                         |
+| dbms.security.deleteUser              | 删除用户                                  | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.listUsers               | 列出所有用户                                | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                  |
+| dbms.security.showCurrentUser         | 列出当前用户信息                              | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                        |
+| dbms.security.getUserPermissions      | 列出指定用户的权限                             | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                          |
+| dbms.graph.createGraph                | 创建子图                                  | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                |
+| dbms.graph.modGraph                   | 修改子图属性                                | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                  |
+| dbms.graph.deleteGraph                | 删除子图                                  | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                           |
+| dbms.graph.listGraphs                 | 列出所有子图                                | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                               |
+| dbms.graph.getGraphInfo               | 列出指定子图的信息                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                             |
+| dbms.security.addAllowedHosts         | 添加ip到信任列表                             | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                 |
+| dbms.security.deleteAllowedHosts      | 从信任列表删除ip                             | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                      |
+| dbms.security.listAllowedHosts        | 列出信任列表中的主机ip                          | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                               |
+| dbms.config.update                    | 更新TuGraph配置                           | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                            |
+| dbms.config.list                      | 列出TuGraph配置                           | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                  |
+| algo.shortestPath                     | 查询两个点间的最短路径                           | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                            |
+| algo.allShortestPaths                 | 查询两个点间的所有最短路径                         | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                             |
+| algo.native.extract                   | 查询指定VertexId/EdgeUid（列表）指定field的值（列表） | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                         |
+| db.flushDB                            | 刷新db                                  | db.flushDB() :: (::VOID)                                                                                                                                         |
+| dbms.security.listRoles               | 列出所有角色                                | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                  |
+| dbms.security.createRole              | 创建角色                                  | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                             |
+| dbms.security.deleteRole              | 删除角色                                  | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.getRoleInfo             | 获取角色详细信息                              | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                      |
+| dbms.security.disableRole             | 禁用/启用角色                               | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.modRoleDesc             | 修改角色描述信息                              | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.rebuildRoleAccessLevel  | 删除角色权限并重建                             | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                 |
+| dbms.security.modRoleAccessLevel      | 修改角色对指定图的访问权限                         | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                     |
+| dbms.security.modRoleFieldAccessLevel | 修改角色对指定属性的访问权限                        | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)          |
+| dbms.security.getUserInfo             | 获取用户详细信息                              | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                      |
+| dbms.security.disableUser             | 禁用/启用用户                               | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.setCurrentDesc          | 设置当前用户描述信息                            | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.setUserDesc             | 设置用户描述信息                              | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.getUserMemoryUsage      | 获取用户内存用量                              | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                        |
+| dbms.security.setUserMemoryLimit      | 设置用户内存限制                              | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                  |
+| dbms.security.deleteUserRoles         | 删除用户与角色的联系                            | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                              |
+| dbms.security.rebuildUserRoles        | 清空用户角色的关系并重建                          | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                             |
+| dbms.security.addUserRoles            | 新增用户与角色的联系                            | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                 |
+| db.plugin.loadPlugin                  | 装载plugin                              | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN,version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | 删除plugin                              | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                      |
+| db.plugin.listPlugin                  | 列出已装载的plugin                          | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | 获取plugin的详细信息                         | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                   |
+| db.plugin.callPlugin                  | 执行plugin                              | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)             |
+| db.importor.dataImportor              | 导入点或边数据                               | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                      |
+| db.importor.schemaImportor            | 导入点或边schema                           | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                      |
+| db.addFullTextIndex                   | 添加全文索引                                | db.addFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                      |
+| db.deleteFullTextIndex                | 删除全文索引                                | db.deleteFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                   |
+| db.rebuildFullTextIndex               | 重建全文索引                                | db.rebuildFullTextIndex(vertex_labels::STRING, edge_labels::STRING) :: (::VOID)                                                                                  |
+| db.fullTextIndexes                    | 查看全文索引                                | db.fullTextIndexes() :: (is_vertex::BOOLEAN, label::STRING, field::STRING)                                                                                       |
+| dbms.meta.count                       | 查看点边总数                                | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                          |
+| dbms.meta.countDetail                 | 查看点边总数详情                              | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                |
+| dbms.meta.refreshCount                | 重新统计点边数量，统计期间停写。                      | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                          |
+| dbms.task.listTasks                   | 查询正在执行的任务                             | dbms.task.listTasks()::(tasks::LIST)                                                                                                                             |
+| dbms.task.terminateTask               | 中止任务                                  | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                               |
+| dbms.ha.clusterInfo                   | HA模式下查看集群状态                           | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                |
+| db.dropDB                             | 清空数据库                                 | db.dropDB() :: (::VOID)                                                                                                                                          |
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..b22c6b3855
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
@@ -0,0 +1,207 @@
+# OLAP API
+
+> 本文档是为TuGraph的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对TuGraph的图计算运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于Tugraph的一个简单的[BFS(宽度优先搜索)](https://en.wikipedia.org/wiki/Breadth-first_search "wikipedia")程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图分析引擎介绍
+
+TuGraph的图分析引擎，面向的场景主要是全图/全量数据分析类的任务。借助TuGraph的 C++ / Python 图分析引擎 API ，用户可以对不同数据来源的图数据快速导出一个待处理的复杂子图，然后在该子图上运行诸如PageRank、LPA、WCC等迭代式图算法，最后根据运行结果做出相应的对策。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph图计算系统社区版内置6个算法，商业版内置了25种算法，用户几乎不需要自己实现具体的图计算过程。其详细介绍可参考algorithms.md。
+
+根据数据来源及实现不同，可分为Procedure、Embed和Standalone三种运行方式，均继承于OlapBase API，OlapBase API接口文档可参考olapbase-api.md。
+
+其中Procedure和Embed的数据来源是图数据库中预加载的db数据，可以分别编译生成tugraph-web加载使用的.so文件和后台终端使用的embed文件，输入的图数据均通过db的加载形式，其接口文档可参考olapondb-api.md。
+Standalone用于编译生成standalone文件，区别于前者，该文件的输入图数据通过txt、二进制、ODPS文件的形式加载，其接口文档可参考olapondisk-api.md。
+
+## 2. Procedure 编译与运行
+
+该种方式主要用于tugraph-web界面进行可视化加载及运行。使用方法如下：
+
+### C++:
+在tugraph-db/plugins目录下执行`bash make_so.sh bfs`即可在tugraph-db/plugins目录下得到bfs.so文件，将该文件以插件形式上传至tugraph-web，输入参数后即可执行。
+
+### Python:
+在tugraph-web的前端将python文件以插件形式上传，输入参数后即可执行。
+
+示例：
+在tugraph-db/plugins编译.so算法文件
+`bash make_so.sh bfs`
+
+将bfs.so（或tugraph-db/plugins/cython/bfs.py）文件以插件形式加载至tugraph-web后，输入如下json参数：
+
+```json
+{
+    "root_id":"0",
+    "label":"node",
+    "field":"id"
+}
+```
+即可得到返回结果如下。
+
+```json
+{
+  "core_cost": 0.013641119003295898,
+  "found_vertices": 3829,
+  "num_edges": 88234,
+  "num_vertices": 4039,
+  "output_cost": 8.821487426757813e-06,
+  "prepare_cost": 0.03479194641113281,
+  "total_cost": 0.04844188690185547
+}
+```
+
+输出内容解释如下：
+- core_cost: 表示算法运行所需要的时间。
+- found_vertices: 表示查找到点的个数。
+- num_edges: 表示该图数据的边数量。
+- num_vertices: 表示该图数据点的数量。
+- output_cost: 表示算法结果写回db所需要的时间。
+- prepare_cost: 表示预处理阶段所需要的时间。预处理阶段的工作：加载参数、图数据加载、索引初始化等。
+- total_cost: 表示执行该算法整体运行时间。
+
+make_so.sh文件介绍：该文件用于将TuGraph-OLAP所涉及到的图算法文件编译成一个可供tugraph-web使用的.so文件。
+
+## 3. Embed 编译与运行
+
+该种方式主要用于TuGraph在后台程序中对预加载的db图数据进行算法分析。其使用方法如下：
+在tugraph-db/plugins目录下对embed_main.cpp文件完善，补充数据名称、输入参数、数据路径等信息，示例如下：
+
+### C++:
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path表示预加载图数据存放的路径
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // 指定图数据的名称
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // 以json形式输入算法参数
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+保存后在tugraph-db/plugins目录下执行`bash make_embed.sh bfs`即可在tugraph-db/plugins/cpp目录下得到bfs_procedure文件。
+
+在tugraph-db/plugins文件夹下执行`./cpp/bfs_procedure` 即可得到返回结果：
+
+```json
+{
+  "core_cost":0.025603055953979492,
+  "found_vertices":3829,
+  "num_edges":88234,
+  "num_vertices":4039,
+  "output_cost":9.059906005859375e-06,
+  "prepare_cost":0.056738853454589844,
+  "total_cost":0.0823509693145752
+}
+```
+
+参数解释同上。
+
+### Python：
+在tugraph-db/plugins文件夹下执行
+`bash make_cython_so.sh bfs`
+或在tugraph-db/plugins/cython文件夹下执行
+`python3 setup.py build_ext -i`
+得到bfs.so后，在Python中import bfs可使用，如tugraph-db/plugins/embed_main.py所示
+
+```python
+# tugraph-db/plugins/embed_main.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+```
+通过如下命令执行
+
+```bash
+python3 embed_main.py
+```
+
+输出结果与C++相同。
+
+## 4. Standalone 编译与运行
+
+该文件主要用于在终端处直接加载图数据，并运行打印输出结果。使用方法如下：
+在tugraph-db/build目录下执行`make bfs_standalone` (需要在g++默认include路径中包含boost/sort/sort.hpp)即可得到bfs_standalone文件,该文件生成于tugraph-db/build/output/algo文件夹下。
+运行方式：在tugraph-db/build目录下执行`./output/algo/bfs_standalone -–type [type] –-input_dir [input_dir] --id_mapping [id_mapping] -–vertices [vertices] --root [root] –-output_dir [output_dir]`即可运行。
+
+- `[type]`：表示输入图文件的类型来源，包含text文本文件、BINARY_FILE二进制文件和ODPS源。
+- `[input_dir]`：表示输入图文件的文件夹路径，文件夹下可包含一个或多个输入文件。TuGraph在读取输入文件时会读取[input_dir]下的所有文件，要求[input_dir]下只能包含输入文件，不能包含其它文件。参数不可省略。
+- `[id_mapping]`：当读入边表时，是否对输入数据做id映射，使达到符合算法运行的形式。1为需要做id映射，0为不需要做。该过程会消耗一定时间。参数可省略，默认值为0。
+- `[vertices]`：表示图的点个数，为0时表示用户希望系统自动识别点数量；为非零值时表示用户希望自定义点个数，要求用户自定义点个数需大于最大的点ID。参数可省略，默认值为0。
+- `[root]`：表示进行bfs的起始点id。参数不可省略。
+- `[output_dir]`：表示输出数据保存的文件夹路径，将输出内容保存至该文件中，参数不可省略。
+
+示例：
+
+### C++:
+在tugraph-db/build编译standalone算法程序
+
+```bash
+make bfs_standalone
+```
+
+在tugraph-db/build/output目录下运行text源文件
+
+```bash
+./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+得到运行结果：
+
+```text
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+结果参数解释同上。
+
+对于新的算法，运行时不了解该算法的所需参数时，可通过`./output/algo/bfs_standalone -h`进行查阅对应参数。
+
+### Python:
+Python语言的bfs拓展编译过程与embed模式无区别，在运行时通过`Standalone`接口调用，示例如下：
+```python
+# tugraph-db/plugins/standalone_main.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(input_dir=
+                             "../test/integration/data/algo/fb_unweighted",
+                             root=0)
+```
+
+通过如下命令执行
+
+```bash
+python3 standalone_main.py
+```
+
+至此，通过TuGraph对上图进行bfs运算的过程已经完成。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..6991d63290
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
@@ -0,0 +1,179 @@
+# OlapBase API
+
+> 此文档主要详细介绍了OlapBase API的使用说明
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统需要的简单配置，同时结合代码对TuGraph中几个共同的重要文件和接口进行解释。
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+
+## 3. 原子操作
+
+TuGraph使用了多线程技术进行批处理操作，在这种情况下可能会出现访存冲突现象。为了保证并行计算时修改操作的正确性，TuGraph实现了原子操作。代码部分见lgraph文件夹下的lgraph_atomic.cpp文件。
+TuGraph还自定义了4个常用的原子操作。当我们需要在多线程模式下修改点的数据时，我们都应该使用原子操作来确保并行环境下修改操作的正确性。除了这4个原子操作外，用户也可以使用“cas”来构建自己的原子操作函数。
+
+- `bool cas(T * ptr, T oldv, T newv)`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `bool write_min(T *a, T b)`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `bool write_max(T *a, T b)`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `void write_add(T *a, T b)`：将b的值加到a指向的值上。
+- `void write_sub(T *a, T b)`：将a指向的值减去b的值。
+
+## 4. 点集合类ParallelBitset
+
+在使用TuGraph进行批处理操作时，需要使用点集合来表示需要处理的点。ParallelBitset实现了点集合类，以bit为单位表示点，因此能够节省大量内存。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 4.1 ParallelBitset类成员
+
+- `size_t Size()`：表示Bitmap中的点个数。
+- `ParallelBitset(size_t size)`：初始化size和data，data长度为(size >> 6)+1
+- `void Clear()`：清空集合
+- `void Fill()`：将所有点加入集合
+- `bool Has(size_t i)`：检查点i是否在集合中
+- `bool Add(size_t i)`：将点i加入集合中
+- `void Swap(ParallelBitset &other)`：和另一组ParallelBitset集合交换元素
+
+## 5. 点数组类ParallelVector
+
+在使用TuGraph进行批处理操作时，需要使用点数组来表示对点的处理结果。ParallelVector实现了点数组类。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 5.1 ParallelVector类成员
+
+- `ParallelVector(size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `T &operator[](size_t i)`：下标为i的数据
+- `T *begin()`：ParallelVector的起始指针
+- `T *end()`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `T &Back()`：ParallelVector最后一个数据
+- `T *Data()`：表示数组本身数据
+- `void Destroy()`：清空ParallelVector数组内数据并删除数组
+- `size_t Size()`：表示ParallelVector中的数据个数
+- `size_t Capacity()`：表示ParallelVector的容量大小
+- `void Resize(size_t size)`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `void Clear()`：清空ParallelVector内数据
+- `void ReAlloc(size_t capacity)`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `void Fill(T elem)`：为ParallelVector的全部数据赋值为elem
+- `void Append(const T &elem, bool atomic = true)`：向ParallelVector结尾添加一个数据
+- `void Swap(ParallelVector<T> &other)`：和其他的ParallelVector交换数据
+- `ParallelVector<T> Copy()`：复制当前的ParallelVector数据存至Copy数组中
+
+## 6. 自定义数据结构
+
+### 6.1 基本数据类型
+
+我们自定义了点和边的数据结构表示，用于在覆盖所有点的同时节省内存空间：
+
+- `Empty`：内容为空的特殊数据类型。
+
+### 6.2 组合数据结构
+
+为了便于计算，我们根据计算场景不同，定义了几种点和边数据的数据结构，分别是：
+
+- `EdgeUnit<EdgeData>`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+  - `size_t src`：边的起始点
+  - `size_t dst`：边的终点
+  - `EdgeData edge_data`：边的权值
+- `AdjUnit<EdgeData>`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+  - `size_t neighbour`：边的邻居点
+  - `EdgeData edge_data`：边的权值
+- `AdjList<EdgeData>`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+  - `AdjUnit<T> * begin`：列表的起始指针
+  - `AdjUnit<T> * end`：列表的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对邻接表进行循环访问。
+
+## 7. 图类OlapBase
+
+图类OlapBase是TuGraph用于加载图以及进行图计算操作的主类，常用OlapBase<EdgeData>表示权值类型为EdgeData的图，代码部分见lgraph文件夹下的olap_base.hpp。本章将介绍Graph类中常用的类型和API接口。上文介绍Procedure、Embed及Standalone功能所使用的类均为该类的子类。
+
+### 7.1 基本信息
+
+- `size_t NumVertices()`：获取点数
+- `size_t NumEdges()`：获取边数
+- `size_t OutDegree(size_t vid)`：点vid的出度
+- `size_t InDegree(size_t vid)`：点vid的入度
+
+### 7.2 点集和边集及其相关操作
+
+- `ParallelVector<VertexData> AllocVertexArray<VertexData>()`：分配一个类型为VertexData的数组，大小为点个数
+- `void fill_vertex_array<V>(V * array, V value)`：将数组array中的所有元素赋值为value
+- `ParallelBitset AllocVertexSubset()`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `AdjList<EdgeData> OutEdges(size_t vid)`：获取点v的所有出边集合
+- `AdjList<EdgeData> InEdges(size_t vid)`：获取点v的所有入边集合
+- `void Transpose()`：对有向图进行图反转
+- `LoadFromArray(char * edge_array, VertexId input_vertices, EdgeId input_edges,  EdgeDirectionPolicy edge_direction_policy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+  - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+  - `input_vertices`：指定数组读入图的点个数。
+  - `input_edges`：指定数组读入图的边的条数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+### 7.3 锁机制
+
+TuGraph实现了一对锁机制，来控制程序对于点数据的访存权限。分别是：
+
+- `void AcquireVertexLock(size_t vid)`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(size_t vid)`：对点vid解锁，所有线程均可访存该锁对应的点数据
+- `VertexLockGuard GuardVertexLock(size_t vid)`：在对vid操作时，对点vid加锁，退出作用域时时自动释放锁
+
+### 7.4 批处理操作
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程。分别是：
+
+```c++
+/*
+    函数名称:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+    第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考include/lgraph/olap_base.h中具体代码
+
+    使用示例:统计数组parent数组中有出边的点个数
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+其中graph为图类OlapBase的实例化对象
+
+```C++
+/*
+    函数名称:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+    第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考/include/lgraph/olap_base.h中具体代码
+    
+    使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..1e94fb946e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,296 @@
+# OlapOnDB API
+
+> 此文档主要详细介绍了OlapOnDB API的使用说明
+
+
+## 1. 简介
+
+一般用户需要自己实现的只是将需要分析的子图抽取出来的过程。用户也可以通过使用TuGraph中丰富的辅助接口实现自己的图分析算法。
+
+该文档主要介绍Procedure及Embed的接口设计，并介绍部分常用接口，具体的接口信息参见include/lgraph/olap_on_db.h文件。
+
+## 2. 模型
+
+Procedure及Embed使用到的辅助函数主要包含在OlapOnDB类，还有一些使用频率较高的函数都会逐一介绍
+
+在TuGraph中OLAP相关的有以下常用的数据结构：
+
+1. DB图分析类 `OlapOnDB<EdgeData>`
+2. 点数组`ParallelVector<VertexData>`
+3. 点集合`ParallelBitset`
+4. 边数据结构`AdjUnit/AdjUnit<Empty>`
+5. 边集合数据结构`AdjList<EdgeData>`
+
+### 2.1 基于快照的存储结构
+
+TuGraph中的OlapOnDB类能够提供数据“快照”，即建立一个对指定数据集的完全可用拷贝，该拷贝包括相应数据在某个时间点（拷贝开始的时间点）的镜像。由于OLAP的操作仅涉及读操作而不涉及写操作，OlapOnDB会以一种更紧凑的方式对数据进行排布，在节省空间的同时，提高数据访问的局部性。
+
+### 2.2 BSP计算模型
+
+TuGraph在计算的过程中使用了BSP（Bulk Synchronous Parallel）模型，使得该过程能够并行执行，极大的提高了程序运行效率。
+
+BSP计算模型的核心思路为超步（Super Step）的提出和使用。在OlapOnDB创建后，在该数据上的计算分为多个超步，比如PageRank，分为多轮迭代，每轮迭代就是一个超步。不同超步之间用存在显式同步，从而保证所有线程在完成同一超步后同时进入下一个超步。在一个超步内部，所有的线程异步执行，利用并行提升计算效率。
+
+利用BSP计算模型能够有效避免死锁，通过障碍同步的方式能够以硬件方式实现粗粒度的全局同步，使得图计算能够并行化执行，而程序员无需在同步互斥上大费周章。
+
+## 3. 算法举例
+
+在这里对PageRank算法分块做解释，大体上分为主函数`Process`和PageRank算法流程`PageRank`函数
+
+### 3.1 主函数
+
+主函数输入有三个参数，`TuGraph`数据库参数`db`，从网页端获取的请求`request`，给网页端的返回值`response`，整体流程可以分为一下几步：
+
+1. 相关参数的获取
+2. 快照类的创建
+3. PageRank算法主流程
+4. 网页端返回值的获取和发送
+
+```C++
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+    
+    // 从网页端请求中获取迭代次数（num_iterations），
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // 读事务的创建以及快照类的创建
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+	
+    // 创建pr数组用于存储每个节点的pr值
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank算法主流程，获取每个节点的pagerank值
+    PageRankCore(olapondb, num_iterations, pr);
+    
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        函数用途：从所有节点中获取pagerank值最大的节点编号
+    
+        函数流程描述：该函数对点集合all_vertices中所有为1的位对应的节点vi（又称为活跃点）执行Func A，再将Func A的返回值作为Func B的第二个输入参数，得到局部最大值（因为第一个输入参数为0，因此实际上返回值就是每个节点的pagerank值），最后再将所有线程的返回值汇总，再次 执行Func B得到全局返回值，并存入max_pr_vi变量中
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+        
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+        
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+    
+    // 网页端返回值的获取和发送
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2 PageRank算法流程
+
+`pagerank`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关数据结构的初始化
+1. 每个节点pagerank值的初始化
+1. 每个节点pagerank值的计算，活跃点为所有点（意味着所有点都需要计算pagerank值）
+1. 得到每个节点经过`num_iterations`次迭代后的pagerank值
+
+```C++
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+    
+    // 相关数据结构的初始化
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // 每个节点pagerank值的初始化，和该节点的出度成反比
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // 总迭代过程
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            函数用途：计算所有节点的pagerank值
+
+            函数流程描述：该函数用于计算所有节点的pagerank值，对all_vertices中所有为1的位对应的节点vi执行Func C，得到本轮迭代中vi的pagerank值，并返回vi节点的pagerank变化值，最终经过函数内部处理汇总所有活跃节点的总变化值并返回，该值被存储在delta变量中
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // 从邻居中获取当前节点的pagerank值
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank值计算核心公式
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+    
+                    // 相关中间变量统计
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // 将本轮迭代得到的pagerank值输出作为下一轮迭代的输入
+        curr.Swap(next);
+    }
+}
+```
+
+## 4. 其他常用函数功能描述
+
+### 4.1 事务的创建
+
+```C++
+//读事务的创建
+auto txn = db.CreateReadTxn();
+
+//写事务的创建
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2 并行化创建有向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3 并行化创建无向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED
+)
+```
+
+### 4.4 获取出度
+
+```C++
+size_t OutDegree(size_t vid)
+```
+
+### 4.5 获取入度
+
+```C++
+size_t InDegree(size_t vid)
+```
+
+### 4.6 获取出边集合
+
+```C++
+/*
+    函数名称：AdjList<EdgeData> OutEdges(size_t vid)
+    数据结构:
+        AdjList 可以理解为类型为AdjUnit结构体的数组
+        AdjUnit 有两个成员变量： 1. size_t neighbour 2. edge_data，其中neighbour表示该出边指向的目标节点编号，如果为有权图，则edge_data数据类型和输入文件中边的权重值相同，否则数据类型为Empty
+
+    使用示例：输出节点vid的所有出度邻居
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7 获取入边集合
+
+```C++
+AdjList<EdgeData> InEdges(size_t vid)
+
+// 使用示例：输出节点vid的所有入度邻居
+for (auto & edge : olapondb.InEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8 获取TuGraph中节点对应OlapOnDB的节点编号
+
+```C++
+size_t OriginalVid(size_t vid)
+
+// 备注： TuGraph中输入的节点编号可以是非数字，比如人名等，在生成OlapOnDB子图的时候，会将人名等转化为数字进行后续处理，因此该方法可能不适用于某些特定场景
+```
+
+### 4.9 获取OlapOnDB中节点对应TuGraph的节点编号
+
+```C++
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10 活跃点的描述
+
+活跃点指的是在批处理函数中需要处理的点，在本例子中只是输出了活跃点的编号，并且汇总活跃点的数量：
+
+```C++
+ParallelBitset temp = 000111;	//当前活跃点为3，4，5号点
+
+size_t delta = ForEachActiveVertex<double>(
+    //void c
+    [&](size_t vi) {
+        printf("active_vertexId = %lu\n",vi);
+        return 1;
+    },
+    all_vertices
+);
+```
+
+函数的运行结果显而易见，因为多线程的关系，一下输出顺序可能有所变化：
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+局部返回值均为1，该函数会在保证线程安全的情况下将所有的局部返回值累加得到最终的返回值，并存储在`delta`变量中，该值最终为3
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..1ece4cc8e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,202 @@
+# OlapOnDisk API
+
+> 此文档主要详细介绍了OlapOnDisk API的使用说明
+
+    
+## 1. 简介
+
+TuGraph的Standalone模式可用于加载图数据文件，其中图数据文件来源可包含text文本文件、BINARY_FILE二进制文件和ODPS源。在该模式下，TuGraph可实现多数据来源快速加载成图，然后在该图上运行如BFS、WCC、SSSP等迭代式算法，并输出最终结果至终端。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph内置了大量的常见图分析算法和丰富的辅助接口，因此用户几乎不需要自己实现具体的图计算过程，只需要在实现自己的存储过程的时候将相应算法库的头文件(.h)包含到自己的程序中，并在编译阶段链接自己的动态库文件即可。
+
+该文档主要介绍了Standalone的常用接口，使用到的辅助函数主要包含在OlapOnDB类。同时为帮助用户理解方便，对BFS算法进行举例说明。
+
+## 2. 算法举例
+
+在这里对BFS算法分块做解释，大体上分为主函数`main`、BFS算法流程`BFSCore`函数和配置类MyConfig。
+
+### 2.1 头文件
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //使用 TuGraph 时需要包含的头文件
+#include "./algo.h"   //包含各种算法逻辑函数的头文件
+```
+
+在使用 TuGraph 实现图数据文件计算应用时，一般首先建立StandaloneGraph类对象graph，将图文件数据加载进graph中，之后通过调用图逻辑函数实现图计算过程，最后对图计算的结果进行打印输出。
+
+### 2.2 配置类MyConfig
+
+MyConfig配置类函数用于提供算法逻辑计算时所需的配置信息，继承于ConfigBase<EdgeData>,其中EdgeDate可根据加载图类型不同选择Empty（无权图）、int（带权图权重为整数）或者double（带权图权重为double）类型。
+
+MyConfig配置类一般根据算法不同，需要额外配置信息如下：
+
+1.算法所需参数
+2.算法名称
+3.配置类内Print函数
+其余公用成员继承与ConfigBase，可参考src/olap/olap_config.h查阅。
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // 算法所需参数初始化
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // 配置文件接受命令行参数，该用例会顺次读取命令行调用算法时的参数，优先使用用户指定数值，若用户并未指定则选择默认参数。
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+### 2.3 主函数
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // 统计内存消耗类MemUsage实例化
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // 配置类MyConfig实例化
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk类实例化
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // 统计图加载消耗时间
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // 创建数组用于统计某节点是否遍历过
+    auto parent = graph.AllocVertexArray<size_t>();
+    // 宽度优先搜索算法，返回图内root_vid根结点连接的节点个数
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // 打印相关信息至终端
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+### 2.4 bfs算法流程
+
+`bfs`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关定义、数据结构的初始化
+2. 使用批处理函数对每个节点进行循环计算，每一轮找到与当前节点相邻的全部节点，并在该轮次终止时进行交换。
+3. 直到找到全部节点，返回节点个数discovered_vertices。
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //分配数组，active_in用于存放上一循环阶段已找到的节点
+  active_in.Add(root);            //把跟节点加入数组中
+  auto active_out = graph.AllocVertexSubset();  //分配数组active_out用于存放当前循环阶段找到的节点
+  parent.Fill((size_t)-1);               //将parent数组中的节点赋值为-1，-1表示未被找到
+  parent[root] = root;
+  size_t num_activations = 1;       //表示当前循环阶段找到的节点个数
+  size_t discovered_vertices = 0;    //表示当前循环阶段找到节点的总个数
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations表示当前循环阶段找到的节点个数
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices表示当前循环阶段找到节点的总个数
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //每一次循环从根节点出发，查找邻近的相邻节点，对其parent值改变，并num_activations+1操作
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //存放当前循环阶段找到的节点
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // 返回全部节点数
+  return discovered_vertices;
+}
+```
+
+## 3. 其他常用函数功能描述
+
+### 3.1 图加载
+
+TuGraph-Standalone对于图数据文件的加载来源主要分为三大类：文本文件、二进制文件和ODPS。二进制文件为将边数据的二进制表示按顺序排列的文件，能够节省大量存储空间。其加载函数分为三种，分别是：
+
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：图数据文件的加载方式，包含两个参数，其含义分别表示：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。其中DUAL_DIRECTION为默认的图加载方式。
+  DUAL_DIRECTION : 输入文件为非对称图，加载图为非对称图。
+  MAKE_SYMMETRIC : 输入文件为非对称图，加载图为对称图。
+  INPUT_SYMMETRIC : 输入文件为对称图，加载图为对称图。
+  对应的详细介绍见lgraph文件夹下的olap_config.h文件的`enum EdgeDirectionPolicy`。
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：将文件中的点-数据对按照点id的顺序加载到数组中。各参数表示意义分别为：
+  - `array`：待读入数据的数组
+  - `path`：读取文件的路径，文件中每行表示一对点-数据对
+  - `parse_line`：用户自定义函数，告诉系统如何将一行文本数据解析为一个点-数据对。
+
+
+### 3.2 图写入
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：把array中数据写回文件中，各参数表示意义分别是：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `array`：待写入数据的数组
+  - `array_size`：待写入数据的数字长度
+  - `name`：算法名称
+  - `filter_output`：写入数据规则函数，待写入数据需要满足该函数的要求。
+
+### 3.3 图解析函数
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：对图数据文件进行解析，加载图为无权图。
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：对图数据文件进行解析，加载图为有权图，权重数据类型可以通过修改<EdgeData>指定。
+
+该函数可通过MyConfig类定义时的构造函数parse_line进行指定。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md
new file mode 100644
index 0000000000..1681de3e44
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md
@@ -0,0 +1,428 @@
+# Python Olap API
+
+> 本文档主要介绍 OlapBase OlapOnDB 和 OlapOnDisk 在Python中的API用法
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统Python接口需要的简单配置，同时结合代码对TuGraph Python API进行解释。关于ParallelBitset、OlapBase各类的作用，详见olap-base-api.md，olap-on-db-api.md和olap-on-disk-api.md
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+- Cython，版本要求3.0.0以上，已测试可运行版本为3.0.0a11
+
+## 3. Cython
+Cython是一种高效的编程语言，是Python的超集。Cython能将py文件翻译为C/C++代码后编译为Python拓展类，在Python中通过import调用。在TuGraph中，所有的Python plugin都由Cython编译为Python拓展类后使用。
+
+Cython的Pure Python模式在保证Python语法的同时具有C/C++的性能，TuGraph Python接口均使用Cython实现。
+
+[Cython 文档](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+见plugins/cython/olap_base.pxd文件，用法与功能基本与C++接口相同，olap_base.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### 原子操作
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `write_min[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_max[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_add[T](a: cython.pointer(T), b: T)-> cython.bint`：将b的值加到a指向的值上。
+- `write_sub[T](a: cython.pointer(T), b: T)-> cython.bint`：将a指向的值减去b的值。
+
+### 点集合类ParallelBitset
+- `Size()-> size_t`：表示Bitmap中的点个数。
+- `ParallelBitset(size: size_t)`：初始化size和data，data长度为(size >> 6)+1
+- `Clear()-> cython.void`：清空集合
+- `Fill()-> cython.void`：将所有点加入集合
+- `Has(size_t i)-> cython.bint`：检查点i是否在集合中
+- `Add(size_t i)-> cython.bint`：将点i加入集合中
+- `Swap(ParallelBitset &other)-> cython.void`：和另一组ParallelBitset集合交换元素
+
+### 点数组类ParallelVector
+- `ParallelVector[T](size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `operator[](i: size_t)-> T`：下标为i的数据
+- `begin()-> cython.pointer(T)`：ParallelVector的起始指针
+- `end()-> cython.pointer(T)`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `Back()-> T`：ParallelVector最后一个数据
+- `Data()-> cython.pointer(T)`：表示数组本身数据
+- `Destroy()-> cython.void`：清空ParallelVector数组内数据并删除数组
+- `Size()-> size_t`：表示ParallelVector中的数据个数
+- `Resize(size: size_t)-> cython.void`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `Clear()-> cython.void`：清空ParallelVector内数据
+- `ReAlloc(capacity: size_t)-> cython.void`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `Fill(elem: T)-> cython.void`：为ParallelVector的全部数据赋值为elem
+- `Append(elem: T, atomic: cython.bint = true)-> cython.void`：向ParallelVector结尾添加一个数据
+- `Swap(other: ParallelVector[T])-> cython.void`：和其他的ParallelVector交换数据
+- `Copy()-> ParallelVector[T]`：复制当前的ParallelVector数据存至Copy数组中
+
+### 自定义数据结构
+- `Empty`：内容为空的特殊数据类型。
+- `EdgeUnit[EdgeData]`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+    - `src: size_t`：边的起始点
+    - `dst: size_t`：边的终点
+    - `edge_data: EdgeData`：边的权值
+- `AdjUnit[EdgeData]`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+    - `neighbour: size_t`：边的邻居点
+    - `edge_data: EdgeData`：边的权值
+- `AdjList[EdgeData]`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+    - `begin()-> cython.pointer(AdjUnit[T])`：列表的起始指针
+    - `end()-> cython.pointer(AdjUnit[T])`：列表的结束指针。
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: 下标为i的数据
+
+### 图类OlapBase
+- `NumVertices()-> size_t`：获取点数
+- `NumEdges()-> size_t`：获取边数
+- `OutDegree(size_t vid)-> size_t`：点vid的出度
+- `InDegree(size_t vid)-> size_t`：点vid的入度
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`：分配一个类型为VertexData的数组，大小为点个数
+- `AllocVertexSubset()-> ParallelBitset`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有出边集合
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有入边集合
+- `Transpose()-> cython.void`：对有向图进行图反转
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+    - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+    - `input_vertices`：指定数组读入图的点个数。
+    - `input_edges`：指定数组读入图的边的条数。
+    - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`：对点vid解锁，所有线程均可访存该锁对应的点数据
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程，在Python中与C++使用方法稍有不同。
+
+```python
+# 函数名称:ProcessVertexInRange[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           lower: size_t, upper: size_t,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#     函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+#     第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#     具体实现请参考include/lgraph/olap_base.h中具体代码
+#
+#     使用示例:统计数组parent数组中有出边的点个数
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython. pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython. pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+其中g为图类OlapBase的实例化对象
+
+```python
+# 函数名称:ProcessVertexActive[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           active: ParallelBitset,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#   函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+#   第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#   具体实现请参考/include/lgraph/olap_base.h中具体代码
+#
+# 使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self.graph.OutDegree(vi)
+        dst: size_t
+        edges = self.graph.OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbour
+            printf("node %lu has neighbour %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+如上面两个例子所展示，在Python中ProcessVertexActive与ProcessVertexInRange比在C++中额外需要一个算法类指针参数，Work函数一般也作为该算法类的成员函数，满足Work函数访问成员变量的需求（如图graph，点数组parent），在调用批处理函数时将Work函数和算法类的self指针传入批处理函数。
+
+其中Work函数会在多线程中调用，因此加上修饰器`@cython.nogil`释放Python全局解释锁，在多线程执行的代码中（例如批处理函数中的Work函数，`cython.parallel.prange`中），不能包含Python对象，最好通过`dst: type`或者`dst = cython.declare(type)`的方式声明变量为C/C++类型。
+
+### 图类OlapOnDB:
+并行化创建有向图：
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+并行化创建无向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING创建有向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### 图类OlapOnDisk
+
+#### ConfigBase：
+- `ConfigBase()`: 构造函数
+- `std::string input_dir`: 图边表数据路径
+- `std::string output_dir`: 输出结果路径
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: 读入图数据
+
+
+## 5. lgraph_db API
+见plugins/cython/lgraph_db.pxd与lgraph_db_python.py文件。
+
+lgraph_db.pxd中接口用法与功能基本与C++接口相同，lgraph_db.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: 获取点的vid
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: 设置用户
+- `SetUser(user: std::string)-> cython.void`: 设置用户
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: 创建GraphDB
+
+### GraphDB：
+- `CreateReadTxn()-> Transaction`: 创建只读事务
+- `CreateWriteTxn()-> Transaction`: 创建写事务
+- `ForkTxn(txn: Transaction)-> Transaction`: 复制事务，只能复制读事务
+
+### Transaction：
+```
+GetVertexIndexIterator(
+                label: std::string,
+                field: std::string,
+                key_start: std::string,
+                key_end: std::string)-> VertexIndexIterator
+```
+获取索引迭代器。迭代器的field值为 [key_start, key_end]。所以在key_start=key_end=v时，返回指向field值为v的点的迭代器
+
+lgraph_db_python.py是lgraph_db.pxd中C++类 Galaxy与GraphDB的包装，将C++类包装为Python类，将lgraph_db_python.py编译为Python拓展后，可以直接在Python文件或Python命令行中`import lgraph_db_python`访问lgraph_db_python.PyGraphDB与PyGraphDB.PyGalaxy。
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(self, user: str password: str)-> void`: 设置用户
+- `SetUser(self, user: std::string)-> void`: 设置用户
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: 创建PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)-> cython.Py_ssize_t`: C++ 类GraphDB的地址
+
+## 6. 算法插件示例
+下面为Python实现的BFS算法的代码示例：
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# 注释作用如下：
+# language_level=3: 使用Python3
+# cpp_locals=True: 需要c++17，使用std::optional管理Python代码中的C++对象，可以避免C++对象的拷贝构造
+# boundscheck=False: 关闭索引的边界检查
+# wraparound=False: 关闭负数下标的处理（类似Python List）
+# initializedcheck=False: 关闭检查内存是否初始化，关闭检查后运行性能更快
+# language = c++: 将此py文件翻译为C++而不是C文件，TuGraph使用大量模板函数，所以都应该使用C++
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# 从plugins/cython/ 中cimportolap_base.pxd与lgraph_db.pxd, 类似C++中#include "xxx.h"
+
+from cython.cimports.libc.stdio import printf
+# 类似C++中#include <stdio.h>
+# 其他常见的还有cython.cimports.libcpp.unordered_map等
+
+import time
+import lgraph_db_python
+
+
+@cython.cclass
+# cython.cclass 表示BFSCore为C类型的Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty])表示OlapBase[Empty]的指针，类似C++中OlapBase[Empty]*
+    # cython提供了常见类型的指针，如cython.p_int, cython.p_char等，表示int*, char*, ...
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t 声明root为C++ size_t类型变量，等效于root = cython.declare(size_t)
+    # 不声明类型的变量为Python object类型
+    # 声明变量类型会大幅提高性能，同时在多线程部分，只有C/C++类型的变量可以访问
+
+    @cython.cfunc
+    # cython.cfunc 表示Work为C类型的函数，参数与返回值应声明
+    # cfunc性能好，能接受C/C++对象为参数、返回值，但是不能在其他python文件中调用
+    # 类似的有cython.ccall，如Standalone函数，可以在其他python文件中调用
+    @cython.nogil
+    # cython.nogil 表示释放Python全局解释锁，在nogil修饰的部分，不能访问Python对象
+    # 在多线程部分，都应有nogil修饰器
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) 表示禁用异常传播，将忽略函数内部引发的Python异常
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbour
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 表示dst没有被bfs访问过
+                if self.active_out.Add(dst):
+                    # 将dst设置为为活跃节点；ParallelBitmap.Add为原子操作，防止重复计算
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython.size_t:
+        self.graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self.parent.Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self.active_in.Add(self.root)
+        while num_activations > 0:
+            self.active_out.Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self.active_out.Swap(self.active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time.time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # 并行创建OlapOnDB
+    # Cython不支持如 *db 的解引用操作，通过db[0]来解引用
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # 通过 GetVertexIndexIterator 根据root节点label名和filed名与filed值（root_id）
+    # 获取root节点的迭代器，通过迭代器获取vid，在无ID_MAPPING时，该vid与OlapOnDB中的id相同
+    cost = time.time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time.time()
+    count = a.run(cython.address(olapondb), root_vid)
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb.NumVertices()
+    response["num_edges"] = olapondb.NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone为Standalone模式下插件入口，用cython.ccall修饰
+    # 可以任意设置参数，相应修改plugins/cython/standalone_main.py即可
+    cost = time.time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config为C++类，config.input_dir为std::string，Python str需要encode才能传给std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # 读入图
+    cost = time.time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time.time()
+    a = BFSCore()
+    count = a.run(cython.address(graph), root)
+    # cython.address(graph)，取址，类似C++中&graph
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices".format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process为embed模式和procedure模式下插件入口，用cython.ccall修饰
+    # Process函数必须名为Process，参数为lgraph_db_python.PyGraphDB与bytes
+    # 返回值必须为(bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # 获取PyGraphDB中GraphDB对象的地址，转换为指针后传递
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..bc0fdb0e62
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
@@ -0,0 +1,189 @@
+# 内置算法
+
+> 此文档主要详细介绍了TuGraph内置的算法程序，社区版6种算法可参考基础算法报
+
+## 简介
+
+TuGraph目前包含以下6个基础算法28种扩展算法，共34个图算法：
+
+### 基础算法包：
+| 中文算法名 | 英文算法名 | 程序名
+|  :----:  | :----: | :----: |
+| 广度优先搜索 | Breadth-First Search  | bfs 
+| 网页排序 | Pagerank | pagerank 
+| 单源最短路径 | Single-Source Shortest Path | sssp 
+| 弱连通分量 | Weakly Connected Components | wcc 
+| 平均集聚系数 | Local Clustering Coefficient  | lcc
+| 标签传播 | Label Propagation Algorithm | lpa 
+
+### 扩展算法包：
+| 中文算法名 | 英文算法名 | 程序名
+| :----: | :----: | :----: |
+| 全对最短路径 | All-Pair Shortest Path  | apsp 
+| 介数中心度 | Betweenness Centrality | bc 
+| 置信度传播 | Belief Propagation | bp
+| 距离中心度 | Closeness Centrality | cc 
+| 共同邻居 | Common Neighborhood | cn 
+| 度数关联度 | Degree Correlation  | dc
+| 直径估计 | Dimension Estimation | de 
+| EgoNet算法 | EgoNet | en
+| 超链接主题搜索 | Hyperlink-Induced Topic Search | hits
+| 杰卡德系数 | Jaccard Index | ji
+| K核算法 | K-core | kcore
+| 鲁汶社区发现 | Louvain | louvain 
+| 多源最短路径 | Multiple-source Shortest Paths | mssp
+| 个性化网页排序 | Personalized PageRank | ppr
+| 强连通分量 | Strongly Connected Components | scc 
+| 监听标签传播 | Speaker-listener Label Propagation Algorithm | slpa
+| 两点间最短路径 | Single-Pair Shortest Path | spsp
+| 三角计数 | Triangle Counting | triangle 
+| 信任指数排名 | Trustrank | trustrank 
+| 带权重的标签传播 | Weighted Label Propagation Algorithm | wlpa 
+| 带权重的网页排序 | Weighted Pagerank Algorithm | wpagerank 
+| 最大独立集算法 | Maximal independent set | mis 
+| sybil检测算法 | Sybil Rank | sybilrank 
+| 子图匹配算法 | Subgraph Isomorphism | subgraph_isomorphism
+| 模式匹配算法 | Motif | motif
+| k阶团计数算法 | Kcliques | kcliques
+| k阶桁架计数算法 | Ktruss | ktruss 
+| 莱顿算法 | Leiden | leiden
+
+## 基础算法包
+
+### 广度优先搜索
+
+广度优先搜索实现了Breadth-first Search算法，从根点开始，沿着图的宽度遍历所有可访问点。返回结果为遍历点个数。算法内容请参考 [https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 网页排序
+
+网页排序程序实现了常用的Pagerank算法。该算法根据图中边和边权值计算所有点的重要性排名，PageRank值越高，表示该点在图中的重要性越高。计算时以点数量的倒数为各点初始Rank值，然后将点的Rank值按照出边平均传递到相邻点，重复该传递过程直到满足给定的收敛阈值或达到给定迭代轮数。每轮传递结束后，所有点的Rank值会有一定的的比例随机传递到任意点上。算法内容请参考 [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 单源最短路径
+
+单源最短路径实现了Single Source Shortest Path算法，根据给定的源点，计算从该源点出发到其他任意点的最短路径长度。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 弱连通分量
+
+弱连通分量程序实现了Weakly Connected Components算法，该算法会计算图中所有的弱连通分量。弱连通分量是图的一个子图，子图中任意两点之间均存在可达路径。算法内容请参考[https://en.wikipedia.org/wiki/Connected_component_(graph_theory)](https://en.wikipedia.org/wiki/Connected_component_(graph_theory) "scc wiki")。
+
+### 平均集聚系数
+
+平均集聚系数程序实现了Local Clustering Coefficient算法，计算图中点之间聚集程度的系数。返回结果包括整体集聚系数和点集聚系数。整体集聚系数反映了图中整体的集聚程度的评估，点集聚系数包括任意点的集聚系数，反映了该点附近的集聚程度。集聚系数越高，表示集聚程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 标签传播
+
+标签传播算法程序实现了Label Propagation Algorithm算法。该算法是基于标签传播的社区发现算法，计算对象为无权图。在标签传递时，每个点对收到的所有标签进行次数累加，在累加和最高的标签中随机选择一个。迭代收敛或执行到给定轮数后算法终止。最终输出结果为每个点的标签，标签值相同的点视为在同一社区。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+
+## 扩展算法包
+
+### 全对最短路径
+
+全对最短路径程序实现了All-Pair Shortest Path算法，计算图中任意两点间的最短路径。返回结果为任意存在路径的点对之间的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 介数中心度
+
+介数中心度程序实现了Betweenness Centrality算法，估算图中所有点的介数中心度值。介数中心度值反映了图中任一最短路径经过该点的可能性，值越高表示有越多的最短路径经过了该点。计算时需给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 置信度传播
+
+置信度传播程序实现了Belief Propagation算法。该算法给定已观测点的边缘分布，利用点之间相互传递消息的机制来估算未观测点的边缘分布。算法内容请参考[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 距离中心度
+
+距离中心度程序实现了Closeness Centrality算法，估算任意点到图中其他点的最短路径的平均长度。距离中心度越小，表示该点到其他点的平均最短距离最小，意味着该点从几何角度看更位于图的中心位置。计算时需要给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "cc wiki")。
+
+### 共同邻居
+
+共同邻居程序实现了Common Neighborhood算法，计算任意给定相邻点对之间的共同邻居数量。计算时给定待查询的若干个点对，返回结果为待查询的任意点对的共同邻居数量。
+
+### 度数关联度
+
+度数关联度程序实现了Degree Correlation算法，通过计算任意相邻点对之间的Pearson关联系数来计算图的度数关联度，可用来表征图中高度数点之间关联程度。度数关联度越高，表示图中高度数点之间的关联程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 直径估计
+
+直径估计程序实现了Dimension Estimation算法。该算法会计算图中最长的最短路径长度，用来表征图的直径大小。算法内容请参考[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### EgoNet算法
+
+EgoNet算法需要给定根点和K值，以根点为源点进行宽度优先搜索，找出所有K度以内的邻居组成的子图。找到的子图称为根点的EgoNet。
+
+### 超链接主题搜索
+
+超链接主题搜索算法实现了Hyperlink-Induced Topic Search算法，该算法假定每个点具有权威性Authority和枢纽性Hub两个属性，一个好的枢纽点应该指向许多高权威性的点，而一个良好的权威点应该被许多高枢纽型的点指向。算法将返回每个点的权威性值和枢纽性值。算法内容请参考[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 杰卡德系数
+
+杰卡德系数程序实现了Jaccard Index算法。该算法计算了给定点对之间的Jaccard系数，可用来表示这两个点的相似度。Jaccard系数越高，表示点对之间的相似程度越高。计算时给定带查询的若干点对，返回结果为这些点对的Jaccard系数。算法内容请参考[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### k核算法
+
+k核算法实现了k-core算法。该算法计算所有点的核数，或找出图中所有的K核子图。K核子图是一种特殊子图，子图中任意点度数都不小于给定K值。算法内容请参考 [https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)](https://en.wikipedia.org/wiki/Degeneracy_(graph_theory) "kcore wiki")。
+
+### 鲁汶社区发现
+
+鲁汶社区发现程序实现了Fast-unfolding算法。该算法是基于模块度的社区发现算法，通过不断合并点社区来最大化图的模块度，能够发现层次性的社区结构。算法内容请参考 [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 多源最短路径
+
+多源最短路径程序实现了Multiple-source Shortest Paths算法，根据给定的多个源点，从这些源点出发，计算到达任意点的最短路径值。其中，多个源点到某一点的最短路径值为分别从每个源点出发到达该点的最短路径的最小值。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 个性化网页排序
+
+个性化网页排序程序实现了Personalized PageRank算法。该算法根据给定的源点，基于该源点个性化计算所有点对于源点的重要性排名。Rank值越高，表示该点对于源点越重要。与PageRank不同的是，初始化时源点Rank值为1，其余点Rank值为0；并且每轮传递结束后，Rank值会有一定的比例随即传递回源点。算法内容请参考 [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 强连通分量
+
+强连通分量程序实现了Strongly Connected Components算法。该算法计算了图中所有的强连通分量，强连通分量是图的一个子图，子图中可从任意点出发到达其他任意点。算法内容请参考[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 监听标签传播
+
+监听标签传播算法程序实现了Speaker-listener Label Propagation Algorithm算法。该算法是基于标签传播和历史标签记录的社区发现算法，是对标签传播算法的扩展。与标签传播算法不同的是，本算法会对所有点记录其历史标签，在迭代中对标签进行累加时，会将历史标签也计算在内。最终输出结果为每个点的所有历史标签记录。算法内容请参考论文：“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 两点间最短路径
+
+两点间最短路径程序实现了Bidirectional Breadth-First Search算法，在有向无权图上从起点沿着出边做正向宽度优先搜搜，从终点沿着入边做反向宽度优先搜索，通过起点和终点共同遍历到的点来确定从起点到终点的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 三角计数
+
+三角计数实现了Triangle-counting算法，计算无向图中的三角形个数，可用来表征图中点的关联程度。三角形数越多，表示图中点的关联程度越高。算法内容请参考论文：“Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study” 。
+
+### 信任指数排名
+
+信任指数排名算法实现了Trustrank算法，可以根据给定的白名单，计算任意点的信任指数。信任指数越高，表示该点为非法点的可能性越小。算法内容请参考 [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 带权重的标签传播
+
+带权重的标签传播算法程序实现了Weighted Label Propagation Algorithm算法。=与标签传播算法不同的是，标签的传递跟边的权重相关，在标签传递时，每个点会根据标签的入边进行权重累加，在累加和最高的标签中随机选择一个。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 带权重的网页排序
+
+带权重的网页排序算法程序实现了Weighted Pagerank算法。与PageRank算法不同的是，Rank值的传递跟边的权重有关，点的Rank值将按照边权重加权传递到相邻点。算法内容请参考[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 最大独立集算法
+
+最大独立集算法实现了Maximal independent set算法。最大独立集是指在这个独立集之外没有可以加入它的点。一个图可能有许多大小差异很大的 MIS，算法找出其中一个。算法内容请参考 [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### Sybil检测算法
+
+Sybil检测算法实现了Sybil Rank算法。SybilRank算法从非Sybil节点开始进行提前终止的随机游走。算法内容请参考论文：“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 子图匹配算法
+
+子图匹配算法实现了subgraph_isomorphism算法。subgraph_isomorphism算法对全图所有节点匹配子图，最后输出每个节点被匹配的次数。算法内容参考 [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 模式匹配算法
+
+模式匹配算法实现了motif算法。motif算法对指定的节点匹配k阶子图，最后输出每个指定节点每种k阶子图个数，每个k阶子图用一个64位整数表示，整数的第$i \times k + j$位为1表示子图中有边i->j。算法内容参考 [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### k阶团计数算法
+
+k阶团计数算法实现了k-cliques算法。k-cliques算法对计算图中所有的k阶完全子图的个数，最后输出每个节点所在的k阶完全子图个数。算法内容参考 [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### k阶桁架计数算法
+
+k阶桁架计数算法实现了k-truss算法。k-truss指每条边都至少是k-2个三角形的边的子图。k-truss算法找出图的k-truss子图，最后输出每个节点在子图中的邻居节点列表。算法内容参考 [https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+### 莱顿算法
+
+莱顿算法实现了了leiden算法。leiden算法是基于模块度的社区发现算法，与louvain算法优势在于leiden算法检测出社区中的断链，保证每个社区具有良好的连通性。算法内容参考 [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst
new file mode 100644
index 0000000000..bc80c68c65
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst
@@ -0,0 +1,8 @@
+分析接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
new file mode 100644
index 0000000000..47d0207278
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
@@ -0,0 +1,344 @@
+# Procedure API
+
+> 此文档主要讲解 TuGraph 的存储过程使用说明
+
+## 1.简介
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个请求并在客户端完成整个处理流程的方式，TuGraph 提供的存储过程是更简洁和高效的选择。
+
+与传统数据库类似，TuGraph 的存储过程运行在服务器端，用户通过将处理逻辑（即多个操作）封装到一个过程单次调用，并且可以在实现时通过并行处理的方式（例如使用相关的 C++ OLAP 接口以及基于其实现的内置算法）进一步提升性能。
+
+存储过程中有一类特殊的API来进行数据的并行操作，我们叫 Traversal API，见[文档](2.traversal.md)。
+
+## 2.存储过程的版本支持
+
+目前TuGraph支持两个版本的存储过程，适用于不同的场景，v3.5版本只支持v1，可通过REST或RPC接口直接调用；从v3.5版本开始支持v2，能够在图查询语言（比如Cypher）中嵌入调用，我们称之为POG（Procedure On Graph query language，APOC）。
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+| 适用场景                 | 极致性能，或者复杂的多事务管理情形       | 一般情况，与Cypher高度联动 |
+| 事务                    | 函数内部创建，可自由控制多事务          | 外部传入函数，单一事务     |
+| 签名（参数定义）          | 无                                 | 有                    |
+| 输入输出参数类型          | 不需要指定                           | 需要指定参数类型        |
+| Cypher Standalone Call | 支持                                | 支持                  |
+| Cypher Embeded Call    | 不支持                              | 支持                  |
+| 语言                    | C++/Python/Rust                    | C++                  |
+| 调用模式                 | 直接传字符串，一般为JSON               | 通过Cypher语句中的变量  |
+
+在TuGraph中，存储过程v1和v2单独管理，支持增删查，但仍不建议重名。
+
+## 3.存储过程语言支持
+
+在 TuGraph 中，用户可以动态的加载，更新和删除存储过程。TuGraph 支持 C++ 语言、 Python 语言和 Rust 语言编写存储过程。在性能上 C++ 语言支持的最完整，性能最优。
+
+注意存储过程是在服务端编译执行的逻辑，和客户端的语言支持无关。
+
+## 4.Procedure v1接口
+
+## 4.1.编写存储过程
+
+### 4.1.1.编写C++存储过程
+
+用户可以通过使用 Procedure API 或者 Traversal API 来编写 C 存储过程。一个简单的 C 存储过程举例如下：
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## 统计所有年龄为10的学生数量
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+从代码中我们可以看到，存储过程的入口函数是`Process`函数，它的参数有三个，分别为：
+
+- `db`: 数据库实例
+- `request`: 输入请求数据，可以是二进制字节数组，或者 JSON 串等其它任意格式。
+- `response`: 输出数据，可以是字符串，也可以直接返回二进制数据。
+
+`Process`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误，此时用户可以通过`response`来返回错误信息以方便调试。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`age_10`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 age_10.so，然后用户就可以将它加载到服务器中了。
+
+### 4.1.2.编写Python存储过程
+
+与 C++类似，Python 存储过程也可以调用 core API，一个简单的例子如下：
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+Python 存储过程返回的是一个 tuple，其中第一个元素是一个布尔值，表示该存储过程是否成功执行；第二个元素是一个`str`，里面是需要返回的结果。
+
+Python 存储过程不需要编译，可以直接加载。
+
+## 4.2.如何使用存储过程
+### 4.2.1.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`age_10.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`age_10.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+### 4.2.2.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+### 4.2.6.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
+
+## 5.Procedure v2接口
+
+下面的说明以 REST API 为例，介绍存储过程v2的调用。
+
+### 5.1.编写存储过程
+
+
+用户可以通过使用 lgraph API 来编写 C++ 存储过程。一个简单的 C++ 存储过程举例如下：
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   std::string &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response = std::string("error parsing json: ") + e.what();
+        return false;
+    }
+
+    Result result({{"node", LGraphType::NODE},
+                   {"salt", LGraphType::FLOAT},
+                   });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = result.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    response = result.Dump();
+    return true;
+}
+```
+
+从代码中我们可以看到：
+- 存储过程定义了一个获取签名的方法`GetSignature`。该方法返回了存储过程的签名，其中包含输入参数名称及其类型，返回参数及其类型。这使得Cypher查询语句在调用存储过程能够利用签名信息校验输入数据以及返回数据是否合理。
+- 入口函数是`ProcessInTxn`函数，它的参数有三个，分别为：
+
+- `txn`: 存储过程所处的事务，通常来说即调用该存储过程的Cypher语句所处事务。
+- `request`: 输入数据，其内容为`GetSignature`中定义的输入参数类型及其Cypher查询语句中传入的值经过json序列化后的字符串。e.g. `{num_iteration: 10}`
+- `response`: 输出数据，为保证在Cypher语言中能够兼容，用户可以通过往`lgraph_api::Result` 写入存储过程处理后的数据，最后用`lgraph_api::Result::Dump`来序列化成json格式的数据。
+
+`ProcessInTxn`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`custom_pagerank`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 custom_pagerank.so，然后用户就可以将它加载到服务器中了。
+
+
+### 5.2.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`custom_pagerank.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`custom_pagerank.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+#### 5.2.1.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+#### 5.2.5.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
new file mode 100644
index 0000000000..9613828c50
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
@@ -0,0 +1,128 @@
+# Traversal API
+
+> 此文档主要讲解 TuGraph 的存储过程中的Traversal API
+
+## 1. 简介
+
+TuGraph 强大的在线分析处理（OLAP）能力是其区别于其它图数据库的一个重要特性。
+借助 C++ OLAP API（olap_on_db.h），用户可以快速地导出一个需要进行复杂分析的子图，然后在其上运行诸如 PageRank、连通分量、社区发现等迭代式图计算过程，最后根据结果做出相应决策。
+导出和计算的过程都可以通过并行处理的方式进行加速，从而实现几乎实时的分析处理，避免了传统解决方案需要将数据导出、转换、再导入（ETL）到专门的分析系统进行离线处理的冗长步骤。
+
+TuGraph 内置了大量常用的图分析算法和丰富的辅助接口，因此用户几乎不需要自己来实现具体的图计算过程，只需在实现自己的存储过程时将相应算法库的头文件（.h 文件）包含到自己程序中，并在编译时链接相应的动态库文件（.so）即可。
+一般情况下，用户需要自己实现的只有将需要分析的子图抽取出来的过程。
+
+目前 Traversal API 仅支持 C++。
+
+## 2. 接口说明
+
+### 2.1. Snapshot
+
+C++ OLAP API 中的 Snapshot 模版类用于表示抽取出来的静态子图，其中 EdgeData 用来表示该子图上每条边所用权值的数据类型（如果边不需要权值，使用 Empty 作为 EdgeData 即可）。
+
+抽取的子图通过 Snapshot 类的构造函数来描述：
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+其中，db 为数据库句柄，txn 为事务句柄，flags 为生成时使用的选项，可选值包括以下的组合：SNAPSHOT_PARALLEL 表示导出时使用多个线程进行并行；SNAPSHOT_UNDIRECTED 表示需要将导出的图变为无向图。
+vertex_filter 是面向点的用户自定义过滤函数，返回值为 true 表示该点需要被包含到待抽取的子图中，反之则表示需要被排除。
+out_edge_filter 是面向边的用户自定义过滤函数，返回值为 true 表示该边需要被包含到待抽取的子图中，反之则表示需要被排除。
+当过滤函数为缺省值时，则表示需要将所有点/边都包含进来。
+
+Snapshot 类提供的其它方法请参考详细的 C++ API 文档（olap_on_db.h）。
+
+### 2.2. Traversal
+
+图数据库中十分常见的一大类分析是基于一个或多个点出发，逐层地拓展并访问邻居。
+尽管这类分析也可以使用 Cypher 完成，但是当访问的层数较深时，其性能会受到串行解释执行的限制。
+使用 C++ Core API 编写存储过程尽管避免了解释执行，但依然受限于单个线程的处理能力。
+为了让用户能够方便地通过并行处理的方式加速这一类应用场景，我们基于 C++ OLAP API 封装了一个 Traversal 框架，用户可以直接使用其中的 FrontierTraversal 和 PathTraversal 类来完成这种逐层遍历的分析任务，具体的使用方法可以参考相应的 C++ API 文档（lgraph_traversal.h）。
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+该方法可用于找到所有满足条件（filter 返回 true）的点，当 parallel 为 true 时则会并行该查找过程。
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+该方法可用于从指定点集（frontier）中（通过 extract 方法）抽取（类型为 VertexData 的）属性，当 parallel 为 true 时会并行该抽取过程。
+
+FrontierTraversal 适用于只关注遍历扩展到的点集的情况；当用户在遍历过程或是结果中需要访问路径上的信息（路径上的点/边）时，则需要使用 PathTraversal。
+两类 Traversal 的构造函数均有四个参数，分别为数据库句柄 db、事务句柄 txn、选项 flags 和 初始化数组容量 capacity。
+选项的可选值包括以下的组合：TRAVERSAL_PARALLEL 表示遍历时使用多个线程并行；TRAVERSAL_ALLOW_REVISITS 表示遍历时允许重复地访问点（PathTraversal 隐含了该选项）。capacity 表示初始化时路径集合的容量。
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+两类 Traversal 设置遍历的起始点/点集有上述三种方式，前两种通过点 ID 直接指定，最后一种方式则类似于 FindVertices。
+
+两类 Traversal 的遍历都是从当前层的点集合出发，根据使用的扩展函数访问每条出边/入边/出边和入边，通过用户自定义的过滤函数决定扩展是否成功，若成功则将邻居点/追加了该条边的路径加入下一层的点/路径集合。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+上述为 FrontierTraversal 的三种遍历方式，即从当前的点集合出发，对集合中的每个点，依次访问每条出边/入边/出边和入边，若满足用户自定义的过滤条件（其中，edge_filter 为面向边的过滤函数，neighbour_filter 则为面向邻居点的过滤函数），则将邻居点加入新的点集合。
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+当前点集合的扩展结束后，新的点集合可以通过上述方法取得。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+PathTraversal 的三种遍历方式与 FrontierTraversal 类似，只是用户自定义的过滤函数中增加了两个参数，其中：Path 包含了到新扩展的这条边之前的路径，IteratorHelper 可用于将路径中的点/边转为数据库中对应的迭代器，相关文档可参考对应的 C++ API 文档。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
new file mode 100644
index 0000000000..abc5ce2ccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
@@ -0,0 +1,5 @@
+base64_encode
+===================================
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
new file mode 100644
index 0000000000..b321c843d6
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
@@ -0,0 +1,5 @@
+lgraph_result
+===================================
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
new file mode 100644
index 0000000000..0f53077dbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
@@ -0,0 +1,5 @@
+lgraph_rpc_client
+===================================
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
new file mode 100644
index 0000000000..d7a9d7b97c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
@@ -0,0 +1,5 @@
+lgraph_traversal
+===================================
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
new file mode 100644
index 0000000000..4b0be46a21
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
@@ -0,0 +1,5 @@
+lgraph_txn
+===================================
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
new file mode 100644
index 0000000000..4047340ef0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
@@ -0,0 +1,5 @@
+lgraph_types
+===================================
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
new file mode 100644
index 0000000000..12814e7618
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
@@ -0,0 +1,5 @@
+lgraph_utils
+===================================
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
new file mode 100644
index 0000000000..572f9ae7c0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
new file mode 100644
index 0000000000..5bfa8a1dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
new file mode 100644
index 0000000000..8680a93ee9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
@@ -0,0 +1,5 @@
+olap_base
+===================================
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
new file mode 100644
index 0000000000..9ce3afba80
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
@@ -0,0 +1,5 @@
+olap_on_db
+===================================
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
new file mode 100644
index 0000000000..5bed2e061c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
@@ -0,0 +1,5 @@
+lgraph
+===================================
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
new file mode 100644
index 0000000000..82bf0941c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
@@ -0,0 +1,5 @@
+olap_profile
+===================================
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
new file mode 100644
index 0000000000..8723e9f1d0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
@@ -0,0 +1,5 @@
+lgraph_atomic
+===================================
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
new file mode 100644
index 0000000000..ec8af7bb8f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
@@ -0,0 +1,5 @@
+lgraph_date_time
+===================================
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
new file mode 100644
index 0000000000..07d6076327
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
@@ -0,0 +1,5 @@
+lgraph_db
+===================================
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
new file mode 100644
index 0000000000..07f4be3f67
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
new file mode 100644
index 0000000000..5be9e6547e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
new file mode 100644
index 0000000000..70a0bd4cbf
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
@@ -0,0 +1,5 @@
+lgraph_exceptions
+===================================
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
new file mode 100644
index 0000000000..a4f9af0582
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
@@ -0,0 +1,5 @@
+lgraph_galaxy
+===================================
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
new file mode 100644
index 0000000000..445ef76484
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
@@ -0,0 +1,8 @@
+C++存储过程接口
+===================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..9883e79c9f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
@@ -0,0 +1,25 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python存储过程接口
+====================================
+Version: 3.6.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+介绍
+------------------
+与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。
+
+这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。
+
+接口
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..6f3114566f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
@@ -0,0 +1,19 @@
+# Rust 存储过程
+
+## 1. 介绍
+Rust 存储过程目前仅支持v1版本，TuGraph能够支持一切编译成动态库的语言作为插件。Rust语言作为系统编程语言的新起之秀，在安全性上、可靠性以及人体工程学上相较于C++具有较大优势。
+
+我们提供了TuGraph的[Rust binding]库来支持在Rust中调用lgrahp api，同时提供[tugraph-plugin-util] 工具库来帮助大家更加简洁地编写Rust插件代码。
+
+[Rust binding]: https://crates.io/crates/tugraph
+[tugraph-plugin-util]: https://crates.io/crates/tugraph-plugin-util
+
+## 2. 如何使用
+
+Rust存储过程的使用分三步：
+* 编译，从rust源码编译出so库。我们准备了一份一站式的插件编写教程，从IDE的插件安装，环境配置，到编译，详细参考`rust-tugraph-plugin-tutorial`。
+* 加载，将so库加载到服务端，可以通过REST或RPC接口，这一步和C++库的使用方式类似，可以参考[文档](1.procedure.md#4.Procedure v1接口)。
+* 运行，和c++ procdure使用方式相同，不在赘述。
+
+## 3.API文档
+Rust社区习惯，所有的代码和文档都可以从[`crates.io`](https://crates.io/crates/tugraph )以及[`docs.rs`](https://docs.rs/tugraph/latest/tugraph )找到。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile
new file mode 100644
index 0000000000..acd2d79fa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 3.6.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = Chinese
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst
new file mode 100644
index 0000000000..1fbd71dffb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst
@@ -0,0 +1,12 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure/index.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
new file mode 100644
index 0000000000..81b77be986
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
new file mode 100644
index 0000000000..dae2eb6e32
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
@@ -0,0 +1,2916 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+**注意：除"登陆"、"查询"和"存储过程"外，其余接口自 **2023年4月30日** 起将不再提供支持，统一使用Cypher接口提供服务。**
+
+## 2.请求与数据格式
+
+### 2.1请求
+
+TuGraph 支持 HTTP GET/POST/PUT/DELETE 请求。其中：
+
+- GET 请求用于只读请求，如读取点属性，边属性等操作；
+- POST 请求用于创建实体，提交 Cypher，以及加载和调用存储过程；
+- PUT 请求用于修改已有实体，如修改点属性，边属性等；
+- DELETE 请求用于删除已有实体，如删除点，边等。
+
+在高可用模式下，用户可以在请求的报头(request header)中设置 `server_version` 来保证请求的服务器有足够新的数据。
+当前的 `server_version` 可以从服务器返回的报头中获取。
+
+### 2.2.数据格式
+
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.3.返回值
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 307 Temporary Redirect: 操作被重定向，一般用于高可用模式下，把操作重定向到 master 上
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 500 Internal Server Error: 服务器端错误
+
+当操作成功时，返回的 JSON 中包含操作的返回值。当操作重定向时，返回的 HTTP 报头中的 `location` 域包含重定向目的地址。
+当发生输入错误或者服务器错误时，返回的 JSON 中包含 `error_message` 域，其内容是错误提示。
+
+在高可用模式下，服务器还会在报头中设置 `server_version`，以告知客户端当前服务器的数据版本号。当客户端在不同的服务器之间切换时，该数据版本号可以保证客户端不会读到错误的历史数据。
+
+### 2.4.URI格式
+
+TuGraph REST API 提供以下功能：Service Root, login, info, label, index, node, relationship, cypher, cpp_plugin, 以及 python_plugin。
+各功能使用的 URI 格式如下：
+
+| URI     | 说明                 |
+| ------- | -------------------- |
+| /web    | web 可视化界面       |
+| /cypher | cypher 请求          |
+| /acl    | 权限控制             |
+| /user   | 用户管理             |
+| /login  | 用户登录             |
+| /info   | 数据库状态及提示信息 |
+| /task   | 任务管理             |
+| /db     | 子图操作             |
+
+其中子图操作又分为：
+
+| URI                              | 说明                 |
+| -------------------------------- | -------------------- |
+| /db                              | 子图的创建，删除     |
+| /db/_{graph_name}_/node          | 点操作             |
+| /db/_{graph_name}_/relationship  | 边操作               |
+| /db/_{graph_name}_/label         | Label 相关操作       |
+| /db/_{graph_name}_/index         | 索引相关操作         |
+| /db/_{graph_name}_/cypher        | 子图相关 cypher 操作 |
+| /db/_{graph_name}_/cpp_plugin    | C++存储过程          |
+| /db/_{graph_name}_/python_plugin | Python 存储过程      |
+| /db/_{graph_name}_/import        | 在线导入             |
+| /db/_{graph_name}_/misc          | 其它操作             |
+
+## 3.登录
+
+TuGraph 提供基于 JWT 的用户认证方式，可以使用 HTTP 或 HTTPS 协议进行传输。系统默认使用 HTTP 协议，如果需要使用 HTTPS，需要在 lgraph.json 配置文件中将 ssl_auth 设为 1。
+
+### 3.1.登录
+
+用户通过用户名和密码发送登录请求。登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**: `/login`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.2.身份刷新
+Token失效后，前端发起刷新token接口，后端验证token合法性。初次登录后，1小时内有效，需刷新使用。即使刷新，24小时后也会强制退出，需要重新登陆。
+验证通过，生成新的token；验证失败返回状态码401。
+
+- **URI**: `/refresh`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.修改Token有效期
+修改Token有效期，需要传输jwt，refresh_time和expire_time三个参数，其中jwt用于校验用户身份，refresh_time和expire_time等于0时，有效期为无期限，超过refresh_time时，需要调用refresh接口获取新的Token;超过expire_time时，需要重新登录。
+
+- **URI**: `/update_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+  | refresh_time | 有效时间（默认设置为0） | Int64 |
+  | expire_time | 有效时间（默认设置为0） | Int64 |
+
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0,
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.查询Token有效期
+查询Token有效期，需要传输jwt，用于校验用户身份，返回，refresh_time和expire_time，其中refresh_time表示刷新时间，超过时需要调用refresh接口获取新的Token;expire_time表示过期时间，超过时需要重新登录。
+- **URI**: `/get_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+
+- **RESPONSE**:  如果成功，返回"refresh_time"和"expire_time"。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+
+### 3.5.登出
+用户登出，同时删除token。
+
+- **URI**: `/logout`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/logout
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 4.查询
+
+URI 格式为
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.调用Cypher
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 列表 |
+  | elapsed | 运行时间（秒） | 浮点数 |
+  | header | 返回结果的表头 | 列表 |
+  | size | 结果数 | 整型 |
+
+其中 header 是一个列表，每一元素格式如下：
+
+| 域名 | 说明                                        | 类型   |
+| ---- | ------------------------------------------- | ------ |
+| name | 列名                                        | 字符串 |
+| type | 列数据类型，0 为标量，1 为点 id，2 为向量 |        |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.调用带参数的 Cypher
+
+Cypher 支持使用参数进行查询。当调用带参数的 Cypher 查询时，TuGraph 会缓存该查询的
+执行计划（execution plan），以加速后续同类查询的速度。
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+  | parameters | 参数 | 列表 |
+
+- **RESPONSE**:
+
+与 [调用 Cypher](#%E8%B0%83%E7%94%A8Cypher) 相同。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+
+## 5.存储过程
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.加载存储过程
+
+TuGraph 服务启动时，如果 load_plugins 为真，则会自动加载 plugin 目录下的所有 plugin。否则需要手动加载。此外，如果服务器运行过程中，管理员更新了 plugin 文件，也需要手动重新加载。重新加载 plugin 的调用格式为：
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 插件名称 | 字符串 |
+  | description | 插件说明 | 字符串 |
+  | code_base64 | 插件代码 | 字符串，使用 base64 编码 |
+  | read_only | 是否为只读存储过程 | 布尔值 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 5.2.列出所有存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程列表，其中每个元素是一个 plugin 的描述，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.获取存储过程的详细信息
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程信息，包括代码，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+  | code_base64 | 存储过程的代码 | 字符串，使用 base64 编码 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.调用存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: POST
+- **REQUEST**: 字符串输入
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | data | 输入数据 | 字符串 |
+  | timeout | 超时长度（秒，可选，缺省值为 0） | 浮点 |
+  | in_process | 是否在本进程调用（可选，缺省值为 false） | 布尔值 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.删除存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 6.Deprecated
+
+以下接口将在4/30/2023之后被删除。
+
+### 6.1.用户管理
+
+系统默认创建一个管理员，管理员用户名为 _admin_，密码为 _73@TuGraph_。为了安全起见，请用户在第一次启动服务器后更改密码。
+
+
+#### 6.1.1.添加用户
+
+添加一个新的用户，并为其设置初始密码。只有管理员有权限进行此操作。其中用户名只能由字母，数字以及下划线构成，密码则可以包含任意字符。用户名和密码长度不能超过 64 字节。添加用户时还可以为用户增加一个描述，用户描述可以包含任意字符，最长不超过 512 字节。
+
+新用户默认拥有同名的角色，不具备任何图的权限。
+
+- **URI**: `/user`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "description": "This is a user"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.列出所有用户
+
+列出数据库的所有用户。只有管理员拥有该操作权限。
+
+- **URI**: `/user/`
+- **METHOD**: GET
+- **RESPONSE**: 所有用户及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin admin user",
+        "roles": ["admin"]
+    },
+    "guest1": {
+        "disabled": true,
+        "description": "",
+        "roles": ["guest1", "some_other_role"]
+    }
+}
+```
+
+#### 6.1.3.获取用户信息
+
+列出给定用户的信息。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "A guest user"
+    "roles": ["guest1", "some_other_role"]
+}
+```
+
+#### 6.1.4.列出用户权限
+
+列出给定用户有权限访问的所有图及相应权限。
+
+- **URI**: `/user/{user_name}/graph`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1/graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "graph1" : "FULL",
+    "graph2" : "READ"
+}
+```
+
+#### 6.1.5.更改用户密码
+
+用户可以更改自己的密码，更改密码时需要同时提供原密码。管理员可以更改所有用户的密码。管理员更改其它用户密码时，可以不提供当前密码。
+
+- **URI**: `/user/{user_name}/password`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | current_password | 当前密码 | 字符串 |
+  | new_password | 新密码 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/password
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.6.修改用户描述
+
+用户可以修改自己的描述。管理员可以修改任意用户的描述。
+
+- **URI**: `/user/{user_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "New description for this user."
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.7.删除用户
+
+删除用户及其所有相关权限，只有管理员拥有该操作权限。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.8.禁用用户
+
+用户可以被禁用。被禁用的用户将不能登陆，但是其资料仍然保存。被禁用的用户可以被重新启用。
+
+- **URI**: `/user/{user_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.9.启用用户
+
+启用一个被禁用的用户。
+
+- **URI**: `/user/{user_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.10.设置用户角色
+
+为指定用户设置角色。只有管理员可以执行此操作。
+
+用户角色列表必须是“全量列表”，即该列表需要包含该用户需要的所有角色。唯一的例外是用户的同名角色，即使列表中不含该角色，它也会被加到用户角色中。
+
+- **URI**: `/user/{user_name}/role`
+- **METHOD**: POST
+- **REQUEST**: 角色列表
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+        ["role1", "role2"]
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+此时用户`guest1`拥有角色`guest1`, `role1`和`role2`。
+
+### 6.2.角色管理
+
+TuGraph 使用基于角色的权限管理。
+
+同一用户可以拥有多个角色。新用户默认拥有与其同名的角色。删除用户时，同名角色也会被删除。如果新建用户时同名角色已经存在，则创建失败。
+
+同一角色可以对多个图有不同的权限。用户对某张图的权限由其所有角色对该图的最高权限决定。
+
+TuGraph 使用四级权限，不用的用户对不同的子图可以有不同的权限，四种权限及其说明如下：
+
+| 权限  | 说明                                                                             |
+| ----- | -------------------------------------------------------------------------------- |
+| NONE  | 无权限                                                                           |
+| READ  | 只读                                                                             |
+| WRITE | 可读写子图中的点和边                                                           |
+| FULL  | 完全权限，包括更改元数据（label, index），管理存储过程，以及删除子图中的所有数据 |
+
+管理员对所有子图都有完全权限，新建的用户对所有子图都没有权限。将用户加入管理员角色中可以将用户提升为管理员。
+
+#### 6.2.1.添加角色
+
+添加一个新的角色，并设置其描述。只有管理员有权限进行此操作。
+
+角色名只能由字母，数字以及下划线构成，密码则可以包含任意字符。角色名长度不能超过 64 字节。
+
+角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | role | 角色名 | 字符串 |
+  | description | 角色描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "role": "new_role",
+        "description": "This is a new role.",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.2.修改角色描述
+
+修改角色的描述。只有管理员有权限进行此操作。角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role/{role_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 新描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "modified description"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.列出所有角色
+
+列出数据库的所有角色。只有管理员拥有该操作权限。
+
+- **URI**: `/role/`
+- **METHOD**: GET
+- **RESPONSE**: 所有角色及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin administrator group.",
+        "permissions": {"default":"FULL", "graph1":"FULL"}
+    },
+    "role1": {
+        "disabled": true,
+        "description": "Another role",
+        "permissions": {"default":"READ"}
+    }
+}
+```
+
+#### 6.2.4.获取角色信息
+
+列出给定角色的信息。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: GET
+- **RESPONSE**: 角色信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "Another role",
+    "permissions": {"default":"READ"}
+}
+```
+
+#### 6.2.5.删除角色
+
+删除指定角色，只有管理员拥有该操作权限。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.6.禁用角色
+
+角色可以被禁用。角色被禁用后，具有该角色的用户将不再从该角色中获得任何权限。只有管理员可以执行此操作。
+
+- **URI**: `/role/{role_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.7.启用角色
+
+启用一个被禁用的角色。
+
+- **URI**: `/role/{role_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.8.设置角色权限
+
+为指定角色设置权限。只有管理员可以执行此操作。
+
+角色权限列表必须是“全量列表”，即该列表需要包含该角色能操作的所有图及其权限。
+
+- **URI**: `/role/{role_name}/permissions`
+- **METHOD**: POST
+- **REQUEST**: 图名称及相应权限的字典。
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/permissions
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "graph1" : "FULL",
+        "graph2" : "READ"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.服务器状态
+
+#### 6.3.1.修改服务器配置
+
+修改服务器配置，配置修改后立即生效，并将影响所有服务器。这些配置的优先级高于配置文件以及命令行参数。
+
+- **URI**: `/config`
+- **METHOD**: PUT
+- **REQUEST**:
+
+请求为一个字典，使用 `{"opt1":v1}` 可以将名为`opt1`的配置修改为`v1`。
+
+| 配置名               | 说明                   | 值类型 |
+| -------------------- | ---------------------- | ------ |
+| OPT_DB_ASYNC         | 是否启用异步模式       | 布尔值 |
+| OPT_TXN_OPTIMISTIC   | 是否默认使用乐观事务锁 | 布尔值 |
+| OPT_AUDIT_LOG_ENABLE | 是否启用审计日志       | 布尔值 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "OPT_DB_ASYNC": true,
+        "OPT_AUDIT_LOG_ENABLE": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.当前服务器状态
+
+- **URI**: `/info`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | lgraph_version | 服务器版本号 | 字符串 |
+  | git_branch | 服务器代码分支 | 字符串 |
+  | git_commit | 服务器代码版本 | 字符串 |
+  | web_commit | 前端码版本 | 字符串 |
+  | cpp_id | CPP 编译器 ID | 字符串 |
+  | cpp_version | CPP 编译器版本 | 字符串 |
+  | python_version | PYTHON 版本 | 字符串 |
+  | node | 点 uri | 字符串 |
+  | relationship | 边 uri | 字符串 |
+  | cpu | cpu 信息 | 字典，格式参见[服务器 CPU 状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8CPU%E7%8A%B6%E6%80%81) |
+  | disk | 硬盘 IO 信息 | 字典，格式参见[服务器硬盘状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%A1%AC%E7%9B%98%E7%8A%B6%E6%80%81) |
+  | memory | 内存信息 | 字典，格式参见[服务器内存状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%86%85%E5%AD%98%E7%8A%B6%E6%80%81) |
+  | db_space | 图数据库占用空间 | 字典，格式参见[图数据库占用空间](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8D%A0%E7%94%A8%E7%A9%BA%E9%97%B4) |
+  | db_config | 图数据库配置信息 | 字典，格式参见[图数据库配置信息](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E9%85%8D%E7%BD%AE%E4%BF%A1%E6%81%AF) |
+  | up_time | 数据库在线时长（秒） | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.服务器 CPU 状态
+
+- **URI**: `/info/cpu`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序 CPU 使用率 | 整型 |
+  | server | 服务器 CPU 使用率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.服务器硬盘状态
+
+- **URI**: `/info/disk`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | read | 服务器硬盘读速率 | 整型 |
+  | write | 服务器硬盘写速率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.服务器内存状态
+
+- **URI**: `/info/memory`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序内存使用量 | 整型 |
+  | server_avail | 服务器可用内存 | 整型 |
+  | server_total | 服务器总内存 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.图数据库占用空间
+
+- **URI**: `/info/db_space`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | space | 图数据库占用空间 | 整型 |
+  | disk_avail | 图数据库可用空间 | 整型 |
+  | disk_total | 服务器硬盘总空间 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "disk_avail"::360074579968,
+      "disk_total"::984373800960,
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.图数据库配置信息
+
+- **URI**: `/info/db_config`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | db_async | 图数据库工作模式（同步或异步） | 布尔值 |
+  | disable_auth | 是否禁用身份验证 | 布尔值 |
+  | enable_ha | 是否启用高可用模式 | 布尔值 |
+  | enable_rpc | 是否启用 RPC 服务器 | 布尔值 |
+  | bind_host | REST 服务器的主机 | 字符串 |
+  | enable_audit_log | 是否启用日志审计 | 布尔值 |
+  | port | REST 服务器的端口 | 整型 |
+  | rpc_port | RPC 服务器的端口 | 整型 |
+  | optimistic_txn | 是否默认使用乐观事务锁 | 布尔值 |
+  | thread_limit | 图数据库应用程序的可用线程数 | 整型 |
+  | enable_ssl | 是否使用 SSL 进行身份验证 | 布尔值 |
+  | verbose | 输出的详细程度 | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "db_async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "bind_host":"127.0.0.1",
+      "enable_audit_log":false,
+      "port":7070,
+      "optimistic_txn":false,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "enable_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.8.高可用服务器列表
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/peers`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回一个服务器信息列表，其中每个服务器信息格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+  | state | 服务器状态 | 字符串 |
+
+其中服务器状态可为 `MASTER`,`SLAVE`,`OFFLINE`。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.9.当前 Leader 信息
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/leader`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前 leader 服务器信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.10.服务器统计信息
+
+- **URI**: `/info/statistics`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前服务器统计信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | requests/second | 每秒处理的请求数量 | 浮点型 |
+  | writes/second | 每秒处理的写请求数量 | 浮点型 |
+  | running_tasks | 正在执行的请求数量 | 整型 |
+  | failure_rate | 请求失败率 | 浮点型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 2.3,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.11.审计日志信息
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | begin_time | 查询日志的起始时间(必填，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | end_time | 查询日志的结束时间(默认为当前时间，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | user | 查询日志的操作者(管理员可查询所有用户的日志，普通用户只能查询本人日志) | 字符串 |
+  | num_log | 查询日志的数量(默认为 100) | 整型 |
+  | descending_order | 查询结果是否降序输出(默认为 true) | 布尔值 |
+
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回审计日志列表，其中每个元素是一条操作日志，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | index | 该操作的索引值 | 整型 |
+  | begin_time | 该操作的开始时间 | 字符串 |
+  | end_time | 该操作的结束时间 | 字符串 |
+  | user | 该操作的发起者 | 字符串 |
+  | graph | 该操作的图 | 字符串 |
+  | type | 该操作的类型 | 字符串 |
+  | read_write | 该操作为读操作或者写操作 | 字符串 |
+  | success | 该操作是否成功 | 布尔值 |
+  | content | 该操作的简要内容 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.任务管理
+
+TuGraph 提供长任务的跟踪和中止功能。用户可以通过 REST API 来查询当前正在运行的在 Cypher 和存储过程查询，并选择中止正在执行的查询。
+
+任务管理对应的 URI 格式为
+
+```
+    http://{host}:{port}/task/{thread_id}/{task_id}
+```
+
+#### 6.4.1.查询正在执行的任务
+
+- **URI**: `/task`
+- **METHOD**: GET
+- **RESPONSE**:
+
+返回的 JSON 为一个数组，其中每一个元素格式如下：
+
+| 域名         | 说明                         | 类型   |
+| ------------ | ---------------------------- | ------ |
+| description  | 任务描述                     | 字符串 |
+| time_elapsed | 任务已经执行的时间，单位为秒 | 浮点   |
+| task_id      | 任务 ID                      | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.中止任务
+
+- **URI**: `/task/{task_id}`
+  其中 `{task_id}` 是 `GET /task` 返回结果中的 `task_id`。
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.5.子图管理
+
+TuGraph 支持多子图，子图之间完全独立，不同的子图可以对不同用户开放不同权限。管理员可以添加和删除子图。
+
+#### 6.5.1.创建新子图
+
+- **URI**: `/db`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 子图名 | 字符串 |
+  | config | 配置 | 字典，格式为 { {列名 1}:{列值 1},... } |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1",
+        "config" : {
+            "max_size_GB":2048,
+            "description": "description of graph1"
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.删除子图
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.列出所有子图
+
+- **URI**: `/db`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_GB":1024,
+            "description":"description of graph1"
+        }
+    }
+```
+
+#### 6.5.4.获取子图信息
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "max_size_GB":1024,
+        "description":"description of graph1"
+    }
+```
+
+### 6.6.元数据管理
+
+TuGraph 是一个具备多图能力的强模式属性图数据库。在每一张子图中，每种点和边都需要有预定义的数据格式。数据格式由 Label 决定，每种 Label 都有自己的数据格式。用户可以使用 REST API 添加，删除和查询 Label 及其对应的数据格式。
+
+Label 操作对应的 URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+其中{type}可以是 node 或者 relationship。
+
+#### 6.6.1.创建Label
+
+创建 Label 的过程同时也是定义其数据类型的过程。只有创建了 Label 才能在图中插入相应类型的点或者边。
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | Label 名 | 字符串 |
+  | fields | 数据列定义 | 列表 |
+  | is_vertex | 是否是点 Label | 布尔值 |
+  | primary | 点的主键属性 | 字符串 |
+  | edge_constraints | 边的约束 | 列表 |
+
+`primary` 在 `is_vertex` 为 `true` 的时候设置，这个字段只有点才有, 创建点的时候必须设置。
+
+`edge_constraints` 在 `is_vertex` 为 `false` 的时候设置，这个字段只有边有。这个字段限制了该边的起点和终点只能是哪些点的组合，比如：`[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`，限制了该边只能是从 `vertex_label1` 到 `vertex_label2` 和 从 `vertex_label3` 到 `vertex_label4`。如果不想有任何限制，不设置该字段即可。
+
+其中`fields`为一个数组，其中每个元素定义数据的一列，内容如下：
+
+| 域名     | 说明                                     | 类型                                                                                                |
+| -------- | ---------------------------------------- | --------------------------------------------------------------------------------------------------- |
+| name     | 列名                                     | 字符串                                                                                              |
+| type     | 列数据类型                               | 字符串，有以下类型： int8, int16, int32, int64, float, double, string, date, datetime, binary, bool |
+| optional | 数据是否可以为空（可选，缺省值为 false） | 布尔值                                                                                              |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.列出所有 Label
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | edge | 边 Label 列表 | 列表 |
+  | vertex | 点 Label 列表 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.获取 Label 的数据格式定义
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+- **METHOD**: GET
+- **RESPONSE**: 数据列定义表，类型是一个词典，key 为列名，value 为列定义，列定义见如下：
+-
+
+| 域名     | 说明             | 类型   |
+| -------- | ---------------- | ------ |
+| optional | 该列值是否可为空 | 布尔值 |
+| type     | 列值类型         | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema 导入
+
+- **URI**: `/db/{graph_name}/schema/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+- **RESPONSE**:
+
+Schema 导入会根据 description 比较新的 Schema 和数据库中原有的 Schema 是否兼容，检查的粒度为 Label。如果不一致则出错，如果一致则添加原先 Schema 中不存在的 Label，返回 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串:
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.点操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+Nodes 提供节点（Vertex）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。
+
+#### 6.7.1.列出点数量和label数量
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | num_label | 点 label 数量 | 整数 |
+  | num_vertex | 点数量 | 整数 |
+
+_注意 num_vertex 返回的并不是准确的点数量，只是一个估计值。_
+
+#### 6.7.2.创建一个点
+
+向数据库中插入一个点。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 点属性 | 字典，其中 key 是列名，value 是相应值。value 必须是与列类型相应的类型，如列为 int32，则 value 只能是整数。 |
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新点 vid。该 ID 可用于后续的点操作中。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.批量创建点
+
+TuGraph 允许一次性插入多个点，以减少网络开销。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | fields | 点属性 | 列表 |
+  | values | 点数据 | 列表 |
+
+其中 fields 是一个字符串列表，列出一系列列名；values 是一个列表，其中每个元素是一个列表，列表中每个元素是列数据。
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新增加的点的 vid 列表，该列表中每一个 vid 按顺序对应请求中的每一个点。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.获取点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 属性 | 字典，格式为 { {列名 1}:{列值 1},...} |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.删除点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 被删掉的点的入边数量 | 整数值 |
+  | out | 被删掉的点的出边数量 | 整数值 |
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.获取点所有属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+- **METHOD**: GET
+- **RESPONSE**: Node 所有属性（字典）
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.获取点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: Node 某一属性
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.更新点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 点属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "********"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.8.边操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+与 Nodes 功能类似，Relationships 提供边（edge）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。每一条边都可以由一个唯一 ID（euid）来标识。这个 ID 可以从在插入边时获得，或者在 [列出所有边](#%E5%88%97%E5%87%BA%E6%89%80%E6%9C%89%E8%BE%B9) 操作中得到。
+
+#### 6.8.1.创建一条边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | destination | 目的点 ID | 整数值 |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid（字符串）。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.批量创建边
+
+- **URI**: `/db/{graph_name}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | fields | 数据列名 | 列表 |
+  | edge | 边数据 | 列表 |
+
+其中 edge 是一个数据列表，其中每个元素都是一条边，其定义如下：
+
+| 域名        | 说明     | 类型                                                   |
+| ----------- | -------- | ------------------------------------------------------ |
+| source      | 起点 id  | 整数                                                   |
+| destination | 终点 id  | 整数                                                   |
+| values      | 数据列表 | 列表，每列对应 fields 中的一个列，类型是该列对应的类型 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid 列表。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.列出所有出边（outgoing relationships）
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+- **METHOD**: GET
+- **RESPONSE**: 点 src 的所有出边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.列出所有入边（incoming relationships）
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+- **METHOD**: GET
+- **RESPONSE**: 点 dst 的所有入边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.列出所有边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 入边 | 列表 |
+  | out | 出边 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationships/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.获取边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | property | 边属性 | 字典 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.删除边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.获取边的所有属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+- **METHOD**: GET
+- **RESPONSE**: 边属性字典
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.获取边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功,返回代码 200,同时返回边的属性。如果失败,返回代码 400,同时返回 "Illegal field."。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.更新边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.9.索引
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+提供索引操作，接受 GET/POST 请求。
+
+#### 6.9.1.创建索引
+
+该操作会启动一个创建索引的后台任务，用户可以通过列出该 Label 相关的所有索引来检查新建索引的状态。
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: POST
+- **REQUEST**:
+
+| 域名      | 说明       | 类型                                                |
+| --------- | ---------- | --------------------------------------------------- |
+| label     | Label 名   | 字符串                                              |
+| field     | 域名       | 字符串                                              |
+| is_unique | 唯一性标识 | 布尔值，如果为 true，表示该 index 中的 key 是唯一的 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.列出所有索引
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.列出所有与某个 Label 相关的索引
+
+- **URI**: `/db/{graph_name}/index/{label}`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.删除索引
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.根据索引获取点
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+- **METHOD**: GET
+- **RESPONSE**: 点 vid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+### 6.10.在线增量导入
+
+#### 6.10.1.指定文件内容导入
+
+- **URI**: `/db/{graph_name}/import/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+  | data | 要导入的文件内容（建议最大在 16MB 左右，最长不超过 17MB） | 字符串 / 数组 / 对象 |
+  | continue_on_error | 出错后是否继续导入（可选，默认为`false`
+  ） | 布尔值 |
+  | delimiter | 分隔符（可选，默认为`“,”`
+  ） | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+分隔符可以是单字符，也可以是字符串，但不能包含`\r`或者`\n`。
+
+data 可以是如下形式之一：
+
+- 字符串如 `"1,2\n3,4\n"`
+- ASCII 码组成的数组如 `[49,44,50,10,51,44,52,10]`
+- 形如上述数组的字典如 `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+- **RESPONSE**:
+
+系统**不会**自动执行新建 label、添加索引等操作。在此操作之前需要保证涉及的 label 已经存在并具有适当的索引。
+
+如果成功导入完毕，返回代码 200，并在 `log` 字段返回一些日志信息（可能为空）；否则，保证所有的数据均未被导入，并在 `error_message` 字段返回错误信息。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true,
+      "delimiter": ","
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+由于请求中指定了在出错时继续，该返回信息说明 SRC_ID 为 1 的边没有被导入，而其他信息导入成功。
+
+### 6.11.其他
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.提取子图
+
+给出点 id 集合，返回包含该集合的最小子图。
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | vertex_ids | 点 id 集合 | 列表 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | nodes | 点数据 | 列表，每元素包含 vid, label, 以及属性 |
+  | relationships | 边数据 | 列表，每元素包含 src, dst, euid, label, 以及属性 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example response.**
+
+```
+• 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
new file mode 100644
index 0000000000..21ad033477
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
@@ -0,0 +1,273 @@
+# RPC API
+
+> 此文档主要介绍 TuGraph 的 RPC API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供丰富的 RPC API，以供开发者通过 RPC 请求远程调用 TuGraph 提供的服务。
+
+RPC（远程过程调用）是一种通过网络从远程计算机程序上请求服务，而不需要了解底层网络技术的协议。
+相比REST，RPC 面向方法，主要用于函数方法的调用，可以适合更复杂通信需求的场景，且性能更高。
+brpc是用c++语言编写的工业级RPC框架，基于brpc，TuGraph 提供了丰富的RPC API，本文档描述
+TuGraph 的 RPC API 使用方式。
+
+## 2.请求
+
+### 2.1.建立连接
+
+开发者向TuGraph服务发送RPC请求，首先要建立连接。以C++语言为例，开发者创建指定url的通道（channel），
+由通道创建指定的服务存根（LGraphRPCService_Stub），后续即可通过存根像调用本地方法一样向远程
+服务器发送请求。
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.请求类型
+
+TuGraph支持10种RPC请求，其中每种请求的功能如下表所示：
+
+| 请求              | 功能         |
+|-----------------|------------|
+| GraphApiRequest | 点边索引操作请求   |
+| CypherRequest   | cypher请求   |
+| PluginRequest   | 存储过程请求     |
+| HARequest       | 高可用模式请求    |
+| ImportRequest   | 数据导入请求     |
+| GraphRequest    | 子图操作请求     |
+| AclRequest      | 权限管理请求     |
+| ConfigRequest   | 配置管理请求     |
+| RestoreRequest  | 备份请求       |
+| SchemaRequest   | schema管理请求 |
+
+用户发送请求时，需要传入以下参数：
+- client_version: 可选参数，HA模式下可通过对比`client_version`和`server_version`防止响应过时的请求
+- token: 必要参数，客户端登陆之后获得token，每次请求传入token以校验用户身份
+- is_write_op: 可选参数，标志请求是否是写请求
+- user: 可选参数，HA模式下主从之间同步请求时设置user，不需验证token
+
+服务处理完RPC请求之后发回响应，响应消息中除了包含每个请求的单独响应信息之外，还包含以下参数：
+- error_code: 必要参数，标志请求处理状态
+- redirect: 可选参数，HA模式下向follower发送写请求时处理失败，设置redirect为请求转发地址，即leader地址
+- error: 可选参数，请求错误信息
+- server_version: 可选参数，HA模式的请求响应中设置`server_version`以避免client读取数据时发生反向时间旅行问题
+
+:warning:  **除CypherRequest、PluginRequest、HARequest和AclRequest外，其余RPC接口将逐步废弃，其功能统一至CypherRequest接口。**
+
+## 3.登录
+
+登录请求信息包含以下参数：
+- user: 必要参数，用户名
+- pass: 必要参数，密码
+以C++为例，用户使用构建好的服务存根发送登录请求：
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+登录响应信息包含以下参数：
+- token: 必要参数，登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。
+如果登录失败会收到“Authentication failed”错误。
+
+## 4.查询
+用户可以通过Cypher查询和TuGraph进行绝大多数的交互，Cypher请求信息包含以下参数：
+- query: 必要参数，Cypher查询语句
+- param_names: 可选参数，参数名
+- param_values: 可选参数，参数值
+- result_in_json_format: 必要参数，查询结果是否以JSON格式返回
+- graph: 可选参数，Cypher语句执行的子图名称
+- timeout: 可选参数，Cypher语句执行的超时时间
+
+以C++为例，用户发送Cypher请求的方式如下所示：
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+Cypher请求响应为以下两个参数之一：
+- json_result: JSON格式的cypher查询结果
+- binary_result: CypherResult格式的cypher查询结果
+
+## 5.存储过程
+为满足用户较为复杂的查询/更新逻辑，TuGraph支持 C 语言和 Python 语言编写的存储过程。
+用户可以使用RPC请求对存储过程进行增删改查操作。
+
+### 5.1.加载存储过程
+加载存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- read_only: 必要参数，是否只读
+- code: 必要参数，存储过程文件读入生成的ByteString
+- desc: 可选参数，存储过程描述
+- code_type: 可选参数，存储过程代码类型，PY、SO、CPP、ZIP四者之一
+
+以C++为例，用户加载存储过程的方式如下所示：
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+加载存储过程的响应不包含参数，如果加载失败则抛出BadInput异常
+
+### 5.2.调用存储过程
+
+调用存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- param: 必要参数，存储过程参数
+- result_in_json_format: 可选参数，调用结果是否以JSON格式返回
+- in_process: 可选参数，未来支持
+- timeout: 可选参数，调用存储过程的超时时间
+
+以C++为例，用户调用存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+调用存储过程的响应为以下两个参数之一：
+- reply: ByteString格式的存储过程调用结果
+- json_result: JSON格式的存储过程调用结果
+
+### 5.3.删除存储过程
+
+删除存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+
+以C++为例，用户删除存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+删除存储过程的响应不包含参数，如果删除失败则抛出BadInput异常
+
+### 5.4.列举存储过程
+
+列举存储过程请求不需要参数，以C++为例，用户列举存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+列举存储过程的响应的参数如下所示：
+- reply: JSON格式的procedure列表
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst
new file mode 100644
index 0000000000..f509ac8dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst
@@ -0,0 +1,8 @@
+网络协议
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
new file mode 100644
index 0000000000..2b3ed1f0ff
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
@@ -0,0 +1,72 @@
+# Learn Tutorial
+
+> 本文档是为 TuGraph 的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对 TuGraph 的图学习运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于 Tugraph 的一个简单的程序实例，我们将重点介绍其使用方式。
+
+## 1.TuGraph 图学习模块简介
+图学习是一种机器学习方法，其核心思想是利用图结构中的拓扑信息，通过顶点之间的联系及规律来进行数据分析和建模。不同于传统机器学习方法，图学习利用的数据形式为图结构，其中顶点表示数据中的实体，而边则表示实体之间的关系。通过对这些顶点和边进行特征提取和模式挖掘，可以揭示出数据中深层次的关联和规律，从而用于各种实际应用中。
+
+这个模块是一个基于图数据库的图学习模块，主要提供了四种采样算子：Neighbor Sampling、Edge Sampling、Random Walk Sampling 和 Negative Sampling。这些算子可以用于对图中的顶点和边进行采样，从而生成训练数据。采样过程是在并行计算环境下完成的，具有高效性和可扩展性。
+
+在采样后，我们可以使用得到的训练数据来训练一个模型。该模型可以用于各种图学习任务，比如预测、分类等。通过训练，模型可以学习到图中的顶点和边之间的关系，从而能够对新的顶点和边进行预测和分类。在实际应用中，这个模块可以被用来处理各种大规模的图数据，比如社交网络、推荐系统、生物信息学等。
+
+## 2. 运行流程
+TuGraph 图学习模块将TuGraph中的图数据采样，采样后的顶点和边作为图学习的特征，进行学习训练。运行流程如下图所示：
+![Alt text](../../../../../images/learn_flow_chart_zh.png)
+## 3. 数据导入
+数据导入请参考[数据导入](../../../5.developer-manual/3.server-tools/1.data-import.md)
+
+导入过程以cora数据集为例：
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+其中cora.conf为图schema文件，代表图数据的格式。cora_db为导入后的图数据文件名称，代表图数据的存储位置。
+## 4. feature特征转换
+由于图学习中的feature特征一般表示为较长的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./cora_db`
+即可进行转换。
+## 5. 采样算子及编译
+TuGraph在cython层实现了一种获取全图数据的算子及4种采样算子，具体如下：
+### 5.1.采样算子介绍
+| 采样算子 | 采样方式 |
+| --- | --- |
+| GetDB | 从数据库中获取图数据并转换成所需数据结构 |
+| Neighbor Sampling | 根据给定的顶点采样其邻居顶点，得到采样子图 |
+| Edge Sampling | 根据采样率采样图中的边，得到采样子图 |
+| Random Walk Sampling | 根据给定的顶点，进行随机游走，得到采样子图 |
+| Negative Sampling | 生成不存在边的子图。 |
+
+### 5.2.编译
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+得到算子so后，在Python中import 即可使用。
+
+## 6. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在tugraph-db/learn/example文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+## 7. 模型加载
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+在使用保存的模型之前，首先需要对其进行加载。代码中，使用如上的代码对已训练模型进行加载。
+
+加载之后，我们可以使用模型对新的顶点和边进行预测和分类。在预测时，我们可以输入一个或多个顶点，模型将输出相应的预测结果。在分类时，我们可以将整个图作为输入，模型将对图中的顶点和边进行分类，以实现任务的目标。
+使用已训练的模型可以避免重新训练模型的时间和资源消耗。此外，由于模型已经学习到了图数据中顶点和边之间的关系，它可以很好地适应新的数据，从而提高预测和分类的准确度。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
new file mode 100644
index 0000000000..2a1c0ac8d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
@@ -0,0 +1,97 @@
+# Sampling API
+
+> 此文档主要详细介绍了Sampling API的使用说明
+
+## 1. 概述
+
+本手册介绍使用TuGraph的Sampling API接口。
+
+## 2. 图数据预处理
+在采样操作之前，根据图数据路径加载图数据，并映射成olapondb图分析类，代码如下：
+
+```python
+galaxy = PyGalaxy(args.db_path) # 根据路径创建一个galaxy实例
+galaxy.SetCurrentUser(args.username, args.password) # 设置当前用户
+db = galaxy.OpenGraph('default', False) # 打开图数据库指定db
+txn = db.CreateReadTxn() # 创建一个事务实例
+olapondb = PyOlapOnDB('Empty', db, txn) # 根据图加载方式、图数据库实例、事务实例实例化OlapOnDB
+del txn
+del db
+del galaxy
+```
+## 3. 图采样算子介绍
+图采样算子在cython层实现，用于对输入的图进行采样处理，生成的NodeInfo用于保存feature属性、label属性等点信息，EdgeInfo用于保存边信息，这些元数据信息可以被用于特征抽取、网络嵌入等任务中。目前TuGraph图学习模块支持GetDB、NeighborSampling、EdgeSampling、RandomWalkSampling、NegativeSampling五种采样算子。
+### 3.1.RandomWalk算子：
+在给定的采样点周围进行指定次数的随机游走，得到采样子图。
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+step: size_t类型，采样步数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.2.NeighborSample算子：
+在给定采样点的一度邻居中采样一定数量的点，得到采样子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+nei_num: size_t类型，邻居采样点数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.3.Nagetive算子：
+采用负采样算法，生成不存在边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+num_samples: size_t类型，生成不存在边的数量。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值： 无。
+
+### 3.4.EdgeSampling算子：
+根据边采样率，生成采样边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list,EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_rate: double类型，采样率。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.5.GetDB算子：
+从数据库中获取图数据并转换成所需数据结构。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+## 4. 用户自定义采样算法
+用户也可以通过TuGraph Olap接口实现自定义采样算法，接口文档参见[此处](../2.olap/5.python-api.md)，该文档主要介绍图采样算法使用的相关函数的接口设计。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md
new file mode 100644
index 0000000000..67574cea1e
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md
@@ -0,0 +1,106 @@
+# Training
+
+> 本文档详细介绍了如何使用TuGraph进行图神经网络（GNN）的训练。
+
+## 1. 训练
+使用TuGraph 图学习模块进行训练时，可以分为全图训练和mini-batch训练。
+全图训练即把全图从TuGraph db加载到内存中，再进行GNN的训练。而mini-batch训练则使用上面提到的TuGraph 图学习模块的采样算子，将全图数据进行采样后，再送入训练框架中进行训练。
+## 2. Mini-Batch训练
+Mini-Batch训练需要使用TuGraph 图学习模块的采样算子，目前支持Neighbor Sampling、Edge Sampling、Random Walk Sampling和Negative Sampling。
+TuGraph 图学习模块的采样算子进行采样后的结果以List的形式返回。
+下面以Neighbor Sampling为例，介绍如何将采样后的结果，进行格式转换，送入到训练框架中进行训练。
+用户需要提供一个Sample类：
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. 加载图数据
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+
+        # 2. 采样方法，结果存储在NodeInfo和EdgeInfo中
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+
+        # 3. 对结果进行格式转换，使之符合训练格式
+        src = EdgeInfo[0].astype('int64')
+        dst = EdgeInfo[1].astype('int64')
+        nodes_idx = NodeInfo[0].astype('int64')
+        remap(src, dst, nodes_idx)
+        features = NodeInfo[1].astype('float32')
+        labels = NodeInfo[2].astype('int64')
+        g = dgl.graph((src, dst))
+        g.ndata['feat'] = torch.tensor(features)
+        g.ndata['label'] = torch.tensor(labels)
+        return g
+```
+如代码所示，首先将图数据加载到内存中。然后使用采样算子对图数据进行采样，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+最后对结果进行格式转换，使之符合训练格式。这里我们使用的是DGL训练框架，因此使用结果数据构造了DGL Graph，最终将DGL Graph返回。
+我们提供TuGraphSample类之后，就可以使用它进行Mini-Batch训练了。
+令DGL的数据加载部分使用TuGraphSample的实例sampler：
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+使用DGL进行模型训练：
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+
+## 3. 全图训练
+GNN（图神经网络）的全图训练是一种涉及一次处理整个训练数据集的训练。它是 GNN 最简单、最直接的训练方法之一，整个图被视为单个实例。 在全图训练中，整个数据集被加载到内存中，模型在整个图上进行训练。这种类型的训练对于中小型图特别有用，并且主要用于不随时间变化的静态图。
+在算子调用时，使用以下方式：
+```python
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+获取全图数据，然后将全图送入训练框架中进行训练。
+完整代码：请参考learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst
new file mode 100644
index 0000000000..e79e36ea91
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst
@@ -0,0 +1,8 @@
+图学习
+======
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/index.rst
new file mode 100644
index 0000000000..59b8adc417
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/6.interface/index.rst
@@ -0,0 +1,12 @@
+编程接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.cypher.md
+   2.olap/index.rst
+   3.procedure/index.rst
+   4.protocol/index.rst
+   5.learn/index.rst
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md
new file mode 100644
index 0000000000..ff3fcd8048
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# 单元测试
+
+> 该文档是TuGraph的单元测试文档
+
+## 1.简介
+
+TuGraph单元测试采用gtest框架，可以选择一次跑全部test或者制定某些test。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md
new file mode 100644
index 0000000000..c3deca2d59
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md
@@ -0,0 +1,399 @@
+# 集成测试
+
+> 此文档主要介绍 TuGraph 的集成测试框架如何使用
+
+## 1.TuGraph集成测试的意义
+
+在单元测试与功能测试中，有部分用例直接开启galaxy或statemachine来进行测试，这并不是一个完整的流程。在完整的cs架构中，用户请求是通过客户端发往服务端，网络通信是必不可少的，为了避免单元测试不完整带来的bug，针对这种情况，使用集成测试框架进行全链路的完整测试。
+
+## 2.TuGraph集成测试框架
+
+TuGraph采用pytest框架作为自己的集成测试框架，pytest框架作为目前使用最广泛的cs端集成测试框架，以其灵活简单，容易上手，并且支持参数化的使用方式而著称，TuGraph基于pytest提供的功能，抽象出了不同的工具，通过参数来控制各个工具的处理逻辑，以方便大家进行高效的测试代码开发。
+
+更多pytest信息请参考官网: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.组件描述
+
+| 组件名称            | 组件功能                       | 实现方式                                  |
+|-----------------|----------------------------|---------------------------------------|
+| server          | TuGraph单机服务                | 开启子进程并在子进程中启动服务                       |
+| client          | TuGraph Rpc Client         | 当前进程中开启TuGraph Python Rpc Client发送请求  |
+| importor        | TuGraph Importor           | 开启子进程并在子进程中处理导入请求                     |
+| exportor        | TuGraph Exportor           | 开启子进程并在子进程中处理导出请求                     |
+| backup_binlog   | TuGraph Backup Binlog      | 开启子进程并在子进程中处理备份binlog的请求              |
+| backup_copy_dir | TuGraph Backup             | 开启子进程并在子进程中处理备份完整db的请求                |
+| build_so        | 编译c++动态连接库的组件              | 开启子进程并在子进程中处理gcc编译逻辑                  |
+| copy_snapshot   | TuGraph Copy Snapshot      | 当前进程中处理备份snapshot的请求                  |
+| copydir         | 文件夹拷贝                      | 当前进程中处理文件夹拷贝请求                        |
+| exec            | 执行c++/java可执行文件            | 开启子进程并在子进程中启动C++可执行文件                 |
+| algo            | 执行算法                       | 开启子进程并在子进程中执行算法                       |
+| bash            | 执行bash命令                   | 开启子进程并在子进程中执行bash命令                   |
+| rest            | TuGraph Python Rest Client | 当前进程中开启TuGraph Python Rest Client发送请求 |
+
+### 2.2.组件用法
+
+#### 2.2.1.server
+
+##### 2.2.1.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动server，函数执行完成后会停止server，并清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.启动参数
+采用python字典传入
++ host是TuGraph Server的ip和端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导入不同的数据，函数开始执行前会导入数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导出不同的数据，函数开始执行前会导出数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的binlog，函数开始执行前会拷贝binlog到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的db，函数开始执行前会拷贝db到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.启动参数
+采用python字典传入
++ cmd是启动命令，采用python列表传入，可以一次编译多个so
++ so_name是执行完成后需要清理的so，可以是多个，通过python列表传入
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_plugins/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_plugins/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制编译不同的so，函数开始执行前会生成so到指定的目录，函数执行完成后会清理so_name列表指定的动态库
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的snapshot，函数开始执行前会拷贝src中的snapshot到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的目录，函数开始执行前会拷贝src到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的命令
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ result是算法预期的执行结果，执行完成会通过实际结果与预期结果进行比较，不同则测试失败
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的算法逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的算法，函数主体等待算法执行完成后对比结果
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的bash命令，函数开始执行前会开启子进程执行通过cmd参数传入的bash命令，函数主体等待算法执行完成
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.启动参数
+采用python字典传入
++ port是TuGraph Server的端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来链接不同的TuGraph Rest Server，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.测试样例
+
+#### 2.3.1.rest
+
+样例代码中在test_get_info函数执行之前先启动server，server启动后启动了rest client，进入test_get_info函数后获取server的一些信息，并通过assert判断是否有获取到cpu的信息。
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+样例代码中在test_flushdb函数执行之前先执行了数据离线导入逻辑，并启动server后，通过client创建链接，进入test_flushdb函数后，通过查询点的个数判断导入是否成功，导入成功后执行flushDB操作，再次通过assert判断是否能正常清空db
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+     assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+样例代码中在test_export_default函数执行之前先执行了数据离线导入逻辑，导入成功后将当前db的数据导出，然后再次通过离线导入逻辑将exportor导出的数据导入到新的目录中，以新导入的数据启动db，并且创建链接。在test_export_default函数主体中判断导出后再次导入的数据是否与原始数据一致
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.其他测试
+更多用例请参考集成测试代码 [https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration)
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/7.quality/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/7.quality/index.rst
new file mode 100644
index 0000000000..32345a1d33
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/7.quality/index.rst
@@ -0,0 +1,8 @@
+测试与质量保障
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/8.other/1.privilege.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/8.other/1.privilege.md
new file mode 100644
index 0000000000..30b26dd16f
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/8.other/1.privilege.md
@@ -0,0 +1,132 @@
+# 用户权限
+
+## 1.介绍
+
+> TuGraph 的权限是基于角色的访问控制进行管理，定义访问控制的权限分配给角色，角色再分配给用户。
+
+## 2.权限层级
+
+- Global 层：即全局权限，对管理、图操作均有权限；
+- Graph 层：即图级别，对每个图的权限；
+- （仅商业化版本支持）Property 层：即属性级别，对某个属性的权限控制
+
+## 3.权限关键字
+
+目前权限的控制较为简洁
+
+- Global 层目前为 admin 权限，并且预置了 admin 用户；
+
+* Graph 层的操作权限分为四种：none，read，write，full
+  - none：无权限，对于图没有任何操作权限
+  - read：只读权限，对于图只具备读取权限
+  - write：读写权限，对于图不仅具备读取权限，还具备了写入的权限
+  - full：所有权限，对于图不仅具备读写权限，同时也具备删除图、修改图、修改 Schema 等权限
+* （仅商业化版本支持）Property 层的权限分别为：none，read，write
+  - none：无权限，对于该属性没有任何操作权限
+  - read：只读权限，对于该属性只具备读取权限
+  - write：读写权限，对于该属性不仅具备读取权限，还具备了写入的权限
+
+## 4.常用权限操作
+
+### 4.1.用户操作
+
+- 创建用户
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- 删除用户
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- 修改当前用户密码
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- 修改指定用户密码
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- 禁用/启用用户
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- 列出所有用户
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- 列出当前用户信息
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- 获取用户详情
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.角色操作
+
+- 创建角色
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- 删除角色
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- 列出所有角色
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- 禁用/启用角色
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.赋予用户角色
+
+- 新增用户与角色的联系
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- 删除用户与角色的联系
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- 清空用户角色的关系并重建
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.角色赋权
+
+- 修改角色对指定图的访问权限
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/8.other/2.token.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/8.other/2.token.md
new file mode 100644
index 0000000000..2bb5f4de01
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/8.other/2.token.md
@@ -0,0 +1,47 @@
+# Token使用说明
+
+## 1.Token介绍
+JWT（JSON Web Token）是一种用于认证和授权的开放标准。它基于JSON（JavaScript Object Notation）格式，并被设计用于在网络应用之间安全地传输声明（claims）信息。
+
+JWT由三部分组成：头部（Header）、负载（Payload）和签名（Signature）。头部包含了JWT的类型以及所使用的签名算法，负载包含了需要传输的信息，而签名用于验证JWT的完整性和真实性。
+
+在TuGraph中，JWT用于实现无状态的认证和授权机制。当用户登录成功后，服务端会生成一个JWT并将其返回给客户端。客户端在后续的请求中将这个JWT作为身份凭证传递给服务端。服务端收到JWT后，通过验证签名和解析负载中的信息，判断用户的身份和权限，并决定是否允许该请求的执行。
+
+## 2. Token有效期
+
+### 2.1. 浏览器Token交互逻辑
+1. 用户打开浏览器，输入账号密码，并点击登录。
+2. 前端调用登录接口，向后端输入账号和密码。
+3. 后端接收到账号密码后，进行校验，校验成功后，返回Token。
+4. 前端将Token存储在浏览器缓存中，后续请求都要携带此Token。
+5. 如果前端，主动点击登出和关闭页面，前端应主动调用登出接口，向后端传递Token。
+6. 后端接收后，将Token失效，返回状态码200，以及“等出成功”。前端接收到信息后，清空浏览器内存中的Token，并将页面退至登录页。
+7. Token失效（初始设置为24小时），需要用户重新登录。
+
+### 2.3. Token有效期刷新机制
+
+Token有效期存在刷新机制，默认关闭。如果打开后，Token的安全性会更高，实现上则存在两个时间戳。
+
+第一个时间戳`refresh_time`用于判定Token是否过期（默认24小时）：过期后可以调用刷新接口获取新的Token，可以设置为更短的时间，比如1小时。
+
+第二个时间戳`expire_time`为强制过期时间戳（默认24小时）：过期后必须重新登陆。
+
+### 2.4. Token有效期修改
+为了方便开发者自行开发，TuGraph提供了两种方式修改有效期，均需要admin权限。
+
+* 通过接口调用设置。涉及有效期修改的接口`update_token_time`和有效期查询接口`get_token_time`。
+具体可查询[REST接口文档](../../5.developer-manual/6.interface/4.protocol/1.restful-api.md)。
+
+* 通过启动参数设置。server端启动时，添加参数`-unlimited_token 1` 参数可以设置为无期限。可参考[服务运行文档](../../5.developer-manual/2.running/2.tugraph-running.md)。
+
+## 3. 客户端发送Token相关请求介绍
+
+客户端会两种协议处理相关请求，一种是REST，一种是RPC。
+
+### 3.1. REST
+如果客户端使用REST协议（包括Browser浏览器），由于是短链接，在每一次请求中都需要携带Token，过期后需要获取新的Token。
+
+对于自行开发的客户端，若采用REST协议则需要考虑Token的逻辑。
+
+### 3.2. RPC
+如果客户端使用RPC协议（包括官方的C++/Java/Python），使用长连接保持，登陆后不涉及Token操作。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/8.other/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/8.other/index.rst
new file mode 100644
index 0000000000..e23467ac4c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/8.other/index.rst
@@ -0,0 +1,8 @@
+权限管理
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/index.rst
new file mode 100644
index 0000000000..4a4dd53356
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/5.developer-manual/index.rst
@@ -0,0 +1,16 @@
+用户手册
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.installation/index.rst
+   2.running/index.rst
+   3.server-tools/index.rst
+   4.client-tools/index.rst
+   5.ecosystem-tools/index.rst
+   6.interface/index.rst
+   7.quality/index.rst
+   8.other/index.rst
+
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/1.contributing.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/1.contributing.md
new file mode 100644
index 0000000000..8a0386047c
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/1.contributing.md
@@ -0,0 +1,78 @@
+# 如何贡献
+
+## 1. 前言
+感谢您为TuGraph做出贡献，我们由衷地希望有更多社区的同学加入进来，一起建设一个更好的图数据库项目。
+
+在贡献代码之前，请您稍微花一些时间了解为TuGraph贡献代码的流程，并阅读《贡献者许可协议》，参与贡献则视为同意上述协议。
+
+[个人贡献者许可协议](3.individual-cla.md)
+
+[公司贡献者许可协议](4.corporate-cla.md)
+
+## 2. 贡献什么
+我们随时都欢迎任何贡献，无论是简单的错别字修正，BUG 修复还是增加新功能。请踊跃提出问题或发起 PR。我们同样重视文档以及与其它开源项目的整合，欢迎在这方面做出贡献。
+对于任何修改，尤其是较为复杂的修改，建议新建一个issue ，按照BUG或者PR的模板填写。
+
+## 3. 准备工作
+贡献代码前需要先了解 git 工具的使用和 GitHub 网站的使用。
+
+## 4. 贡献代码流程
+### 4.1. 提交issue
+不论您是修复 TuGraph 的 bug 还是新增 TuGraph 的功能，在您提交代码之前，请在 TuGraph 的 GitHub 上提交一个 issue，描述您要修复的问题或者要增加的功能。这么做有几个好处:
+
+- 不会与其它开发者或是他们对这个项目的计划发生冲突，产生重复工作。
+- TuGraph 的维护人员会对您提的 bug 或者新增功能进行相关讨论，确定该修改是不是必要，有没有提升的空间或更好的办法。
+- 在达成一致后再开发，并提交代码，减少双方沟通成本，也减少 pull request 被拒绝的情况。
+### 4.2. 获取源码
+要修改或新增功能，在提交 issue 后，fork一份 TuGraph  Master代码到您的代码仓库。
+### 4.3. 拉分支
+TuGraph 所有修改都在分支上进行，修改完成后提交 pull request，在 Code Review 后由项目维护人员 Merge 到 Master。 因此，在获取源码步骤介绍后，您需要:
+
+1. 下载代码到本地，这一步您可以选择git/https方式，近年github的权限要求更加严格，比如git方式需要更复杂的ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent))，https方式不能直接使用用户名密码验证，请按照指引授权。 git clone https://github.com/您的账号名/tugraph-db
+2. 拉分支准备修改代码:
+git branch add_xxx_feature 
+3. 执行完上述命令后，您的代码仓库就切换到相应分支了。执行如下命令可以看到您当前分支: git branch -a 
+4. 如果您想切换回 Master，执行下面命令: git checkout -b master
+5. 如果您想切换回分支，执行下面命令: git checkout -b "branchName"
+
+### 4.4. 配置 Github 信息
+在您的机器执行 git config  --list ，查看 git 的全局用户名和邮箱。检查显示的 user.name 和 user.email 是不是与自己 github 的用户名和邮箱相匹配。
+
+如果公司内部有自己的 gitlab 或者使用了其他商业化的 gitlab，则可能会出现不匹配的情况。这时候，您需要为 TuGraph DB 项目单独设置用户名和邮箱。设置用户名和邮箱的方式请参考 github 官方文档。
+
+### 4.5. 修改代码提交到本地
+
+拉完分支后，就可以修改代码了。
+
+**修改代码注意事项 **
+
+代码⻛格保持一致：TuGraph 通过 cpplint 来保持代码格式一致，IDE可以通过.clang来配置风格。在提交代码前，务必本地检查代码风格，否则ACI将报错。
+
+补充单元测试代码：新有修改应该通过已有的单元测试,应该提供新的单元测试来证明以前的代码存在 bug，而新的代码已经解决了这些 bug ,您可以用如下命令运行所有测试: ./unit_test
+也可以通过IDE来辅助运行。
+
+**其它注意事项 **
+
+请保持您编辑的代码的原有⻛格，尤其是空格、换行等。 对于无用的注释，请直接删除。 对逻辑和功能不容易被理解的地方添加注释。 及时更新文档。 修改完代码后，请按照如下格式执行命令提交所有的修改到本地:
+git commit -am '(feat) 添加xx功能' git commit -am '(fix) 修复xx问题'`
+
+### 4.6. 提交代码到远程仓库
+在代码提交到本地后，接下来就可以与远程仓库同步代码了，执行如下命令提交本地修改到 github 上: git push origin "branchname"
+
+如果前面您是通过 fork 来做的，那么这里的 origin 是 push 到您的代码仓库，而不是 TuGraph 的代码仓库。
+
+提交合并代码到 Master 的请求 在的代码提交到 GitHub 后，您就可以发送请求来把您改好的代码合入 TuGraph Master 代码了。此时您需要进入您在 GitHub 上的对应仓库，按右上⻆的 pull request 按钮。选择目标分支，一般就是 master，系统会通知 TuGraph 的人员， TuGraph 人员会 Review 您的代码，符合要求后就会合入主干，成为 TuGraph 的一部分。 
+
+请注意会自动检查CI，以及所有Commits中的贡献者是否签署了cla，通过后会有绿色的标识。
+
+### 4.7. 代码 Review
+
+在您提交代码后，您的代码会被指派给维护人员 Review，请耐心等待。如果两个工作日后，仍然没有人对您的提交给予任何回复，可以在 PR 下面留言，并 @ 对应的人员。
+
+对于代码 Review 的意⻅会直接备注到到对应 PR 或者 Issue。如果觉得建议是合理的，也请您把这些建议更新到您的代码中。
+
+### 4.8. 合并代码到Master
+
+在代码 Review 通过后，就由 TuGraph 维护人员操作合入 Master，在此过程中维护人员可能会指定新的Reviewer，提出新的意见需要修改。一般这一步不用参与，代码合并之后，您会收到合并成功的提示。
+
+
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/2.community-roles.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/2.community-roles.md
new file mode 100644
index 0000000000..109a1d8f04
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/2.community-roles.md
@@ -0,0 +1,57 @@
+# 社区角色
+
+## 1. 前言
+本文档描述 TuGraph 社区中成员身份的⻆色，对每种⻆色的要求及权限。 
+
+## 2. ⻆色摘要
+
+这是 TuGraph 社区的⻆色划分，描述了每种⻆色的职责，成为某种⻆色并保持该⻆色的要求，以及相应⻆色的权限。
+
+TuGraph 社区参照 Apache 规范划分为以下三种⻆色：
+
+- Contributor 
+- Maintainer 
+- PMC 
+
+以下描述了每种⻆色的要求、职责和权限。 		 						 					
+## 3. Contributor
+### 3.1. 要求
+在 TuGraph 的任何一个正式项目中成功提交一个 PR 并合并。 
+### 3.2. 职责
+
+- 积极响应指派给您的 Issue 或 PR
+- 一起帮忙回复 Issue 或 PR，把 Issue 分配给对应模块的负责人
+### 3.3. 权限
+
+- 加入 TuGraph GitHub 组织，成为 TuGraph 开源社区的一员。 
+## 4. Maintainer
+### 4.1. 要求
+新的 Committer 由已有的 PMC 推荐，并通过 2/3 以上投票通过，Committer 至少满足以下一个条件：
+
+- 成为社区成员时间超过三个月 
+- 超过 10 个 PMC approve 的 PR 
+- 完成重大功能 
+- 修复严重 Bug 
+- 长期关注项目发展并参与社区讨论
+### 4.2. 职责
+
+- 社区咨询支持
+- 积极响应指派给您的 Issue 或 PR
+- 对于社区重大决定的投票权
+- Review 社区的 PR 
+### 4.3. 权限
+
+- Pull Request review 权限 
+## 5. PMC
+### 5.1. 要求
+
+- 暂不开放，如有强烈愿望请联系PMC
+### 5.2. 职责
+
+- 积极参与社区讨论，对社区重大决策给予指导 
+- 负责保证开源项目的社区活动都能运转良好 
+### 5.3. 权限
+
+- Pull Request review 权限 
+- Pull Request approve 权限 
+- 社区角色成员管理
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/3.individual-cla.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/3.individual-cla.md
new file mode 100644
index 0000000000..f320662638
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# 个人贡献者许可协议
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below. This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project. If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录 A 中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+1. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+1. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+1. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+1. 专利许可的授予。 受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+1. You represent that you are legally entitled to grant the above license.
+1. 您保证您依法有权授予上述许可。
+
+1. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others). You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+1. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第 7 节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+1. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+1. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+1. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+1. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+1. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+1. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+1. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws. The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply. Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+1. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+1. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+1. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign 请签署: ****************\_\_**************** Date 日期: ****\_\_\_\_****
+
+Full name 全名: **************************\_**************************
+
+Mailing Address 信件地址: **********************\_\_\_\_**********************
+
+Telephone 电话: **************************\_**************************
+
+E-Mail 电子邮箱: **************************\_\_**************************
+
+Schedule A 附录 A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..c982085db2
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/4.corporate-cla.md
@@ -0,0 +1,85 @@
+# 公司贡献者许可协议
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below. This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project. If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录 B 中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+3. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+4. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+5. 专利许可的授予。 受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+6. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+7. 您保证您依法有权授予上述许可。您进一步保证下文附表 A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+8. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others). You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+9. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第 7 节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+10. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+11. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+12. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+13. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+14. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+15. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+16. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws. The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply. Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+17. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+18. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+19. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign 请签署: ****************\_\_**************** Date 日期: ****\_\_\_\_****
+
+Company Name 公司名称: **********************\_\_\_\_**********************
+
+Full name 全名: **************************\_**************************
+
+Title 职务: **************************\_**************************
+
+Mailing Address 信件地址: **********************\_\_\_\_**********************
+
+Country 国家: **************************\_**************************
+
+Telephone 电话: **************************\_**************************
+
+E-Mail 电子邮箱: **************************\_\_**************************
+
+Schedule A 附录 A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录 B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/5.roadmap.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/5.roadmap.md
new file mode 100644
index 0000000000..4606b33755
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/5.roadmap.md
@@ -0,0 +1,70 @@
+# 技术规划
+
+## 1. 简介
+该文档是 TuGraph 未来开发的规划，包括正在开发中、不在开发计划里、已经开发完成但不在开源版本里的功能等。
+
+TuGraph定位开源高性能图数据库，图数据采用集中存储的方式，短期 **不会** 考虑基于分片（Sharding）的数据切分，
+而将支持主备复制的模式来解决高并发读的场景，采用云上存储解决存储容量的问题。
+
+## 2. 已完成功能
+
+TuGraph于2022年9月1日开源，TuGraph在社区的反馈声中，进行日常BUG修复，自身能力得到了完善。
+
+| 版本号 | 功能 | 时间 |
+| --- | --- | --- |
+| 3.3.0 | 开源初版 | 2022.9.1 |
+| 3.3.1 | 图分析引擎重构，多模式支持 | 2022.10.14 |
+| 3.3.2 | OGM支持，UT覆盖率提升 | 2022.11.21 |
+| 3.3.3 | 链接认证机制迭代，加入英文文档 | 2022.12.23 |
+| 3.3.4 | 支持上云，梳理LDBC SNB Audit流程 | 2023.1.28 |
+| 3.4.0 | 支持OLAP Python API, 离线导入升级 | 2023.3.11 |
+| 3.5.0 | 支持POG，前端升级，文档梳理 | 2023.6.5 |
+| 3.5.1 | 图学习引擎，Procedure Rust API，存储属性分离 | 2023.7.14 |
+
+除此之外，TuGraph搭建了较为完善的质量体系，涵盖自动化的单元测试、集成测试、性能测试等。
+
+更详细的描述可以在源码目录在的 "[root]/release/CHANGELOG.md" 文件查看。
+
+## 3. 2023年下半年核心版本迭代
+
+上半年高可用功能在计划上延后，图学习的能力提前迭代了一版，下半年将会完成高可用，以及率先支持ISO GQL的预印版本。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| 3.6.0 | 高可用支持 | 2023.8 |
+| 4.0.0 | ISO GQL 语言支持 | 2023.10 |
+
+## 4. 2023年功能更新
+
+在2023年度，除了上述核心功能，还包括如下组件的研发。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| 3.5.x | 日志系统优化 | 2023.7 |
+| 3.5.x | 冷备支持 | 2023.9 |
+| 3.5.x | 支持边upsert导入 | 2023.9 |
+| x.x.x | 支持trigger触发器 | 2023.12 |
+| x.x.x | 探索新存储引擎 | 2023.x |
+| x.x.x | 支持schema快速增删 | 2023.x |
+| x.x.x | TuGraph Brower版本迭代 | 2023.x |
+| x.x.x | 存储过程 Python API 迭代 | 2023.x |
+
+## 5. 期望社区共创的功能
+
+目前团队研发精力并不能实现我们对TuGraph的全部期望，在功能的梳理中，我们发现有一系列值得挖掘的想法，
+团队也有一些初步的探索，期望下面功能能够在社区中共同研发。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| x.x.x | 文档完善 | 2023.x |
+| x.x.x | APOC工具丰富 | 2023.x |
+| x.x.x | 属性默认值支持 | 2023.x |
+| x.x.x | 多属性联合索引 | 2023.x |
+| x.x.x | 在线全量Import支持 | 2023.x |
+| x.x.x | 图权限完善 | 2023.x |
+| x.x.x | NLP支持 | 2023.x |
+| x.x.x | Java Procedure API | 2023.x |
+| x.x.x | 数据库间快速迁移 | 2023.x |
+| x.x.x | 时空数据 | 2023.x |
+
+一些更加简单的功能，我们会在github的issue中打上 good first issue 的标签，欢迎对图数据库感兴趣的技术爱好者共同研讨。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/index.rst
new file mode 100644
index 0000000000..8f6b754ffa
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/6.community-manual/index.rst
@@ -0,0 +1,9 @@
+开发者文档
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..61c73cd6bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# 从关系型数据库导入TuGraph
+
+> 内容待补充
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/7.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/7.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..0eeb7a2bbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/7.best-practices/2.learn_practices.md
@@ -0,0 +1,200 @@
+# 使用 TuGraph 图学习模块进行点分类
+
+## 1.简介
+GNN 是许多图上机器学习任务的强大工具。在本介绍性教程中，您将学习使用 GNN 进行点分类的基本工作流程，即预测图中点的类别。
+
+此文档将展示如何构建一个 GNN 用于在 Cora 数据集上仅使用少量标签进行半监督点分类，这是一个以论文为点、引文为边的引文网络。任务是预测给定论文的类别。
+
+通过完成本教程，您可以
+
+使用 TuGraph 加载 cora 数据集。
+
+使用 TuGraph 提供的采样算子采样，并构建 GNN 模型。
+
+在 CPU 或 GPU 上训练用于点分类的 GNN 模型。
+
+此文档需要对图神经网络、DGL等使用有一定经验。
+
+## 2. 前置条件
+
+TuGraph图学习模块需要TuGraph-db 3.5.1及以上版本。
+
+TuGraph部署推荐采用Docker镜像tugraph-compile 1.2.4及以上版本:
+
+tugraph / tugraph-compile-ubuntu18.04:latest
+
+tugraph / tugraph-compile-centos7:latest
+
+tugraph / tugraph-compile-centos8:latest
+
+以上镜像均可在DockerHub上获取。
+具体操作请参考[快速上手](../3.quick-start/1.preparation.md)。
+
+## 3. Cora 数据集导入TuGraph数据库
+### 3.1. Cora 数据集介绍
+Cora 数据集由 2708 篇论文组成，分为 7 个类别。每篇论文由一个 1433 维的词袋表示，表示论文中的单词是否出现。这些词袋特征已经预处理，以从 0 到 1 的范围归一化。边表示论文之间的引用关系。
+
+TuGraph中已经提供了Cora数据集的导入工具，用户可以直接使用。
+
+### 3.2. 数据导入
+Cora数据集在test/integration/data/algo目录下，包含点集cora_vertices和边集cora_edge。
+
+首先需要将Cora数据集导入到TuGraph数据库中，具体操作请参考[数据导入](../5.developer-manual/3.server-tools/1.data-import.md)。
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+其中cora.conf为图schema文件，代表图数据的格式,可参考test/integration/data/algo/cora.conf。cora_db为导入后的图数据文件名称，代表图数据的存储位置。
+
+## 4. feature特征转换
+由于Cora数据集中的feature特征为长度为1433的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./cora_db`
+即可进行转换。
+
+## 5. 编译采样算子
+采样算子用于从数据库中获取图数据并转换成所需数据结构，具体执行过程如下：
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *  # 导入tugraph-db的python接口模块
+import importlib  # 导入importlib模块
+getdb = importlib.import_module("getdb")  #获取getdb算子
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo) #调用getdb算子
+```
+
+如代码所示，得到算子so文件后，import 导入使用。
+
+## 6. 训练过程
+### 6.1.数据加载
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+如代码所示，根据图数据路径、用户名、密码和子图名称将数据加载到内存中。TuGraph可以载入多个子图用于图训练，在此处我们只载入一个子图。
+
+### 6.2.构建采样器
+训练过程中，首先使用GetDB算子从数据库中获取图数据并转换成所需数据结构，具体代码如下：
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+如代码所示，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+然后构建采样器
+```python
+    batch_size = 5
+    count = 2708
+    sampler = TugraphSample(args)
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(count),
+        sampler,
+        batch_size=batch_size,
+        num_workers=0,
+        )
+```
+
+### 6.3.对结果进行格式转换
+```python
+    src = EdgeInfo[0].astype('int64')
+    dst = EdgeInfo[1].astype('int64')
+    nodes_idx = NodeInfo[0].astype('int64')
+    remap(src, dst, nodes_idx)
+    features = NodeInfo[1].astype('float32')
+    labels = NodeInfo[2].astype('int64')
+    g = dgl.graph((src, dst))
+    g.ndata['feat'] = torch.tensor(features)
+    g.ndata['label'] = torch.tensor(labels)
+    return g
+```
+对结果进行格式转换，使之符合训练格式
+
+### 6.4.构建GCN模型
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+
+def build_model():
+    in_size = feature_len  #feature_len为feature的长度，在此处为1433
+    out_size = classes  #classes为类别数，在此处为7
+    model = GCN(in_size, 16, out_size)  #16为隐藏层大小
+    return model
+```
+本教程将构建一个两层图卷积网络（GCN）。每层通过聚合邻居信息来计算新的点表示。
+
+### 6.5.训练GCN模型
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    return float(loss)
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+如代码所示，根据定义好的采样器、优化器和模型进行迭代训练50次。
+
+输出结果如下：
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+同时，图学习模块可采用GPU进行加速，用户如果需要再GPU上运行，需要用户自行安装相应的GPU驱动和环境。具体可参考learn/README.md。
+
+完整代码可参考learn/examples/train_full_cora.py
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/7.best-practices/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/7.best-practices/index.rst
new file mode 100644
index 0000000000..dc5546f1d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/7.best-practices/index.rst
@@ -0,0 +1,9 @@
+最佳实践
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/8.faq.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/8.faq.md
new file mode 100644
index 0000000000..61069859ad
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/8.faq.md
@@ -0,0 +1,54 @@
+# FAQ
+
+在 TuGraph 使用过程中，如果遇到问题可优先查看[用户文档](https://github.com/TuGraph-family/tugraph-db/tree/master/doc/zh-CN) 。其次，请查看如下 FAQ 列表是否能够匹配您的问题。
+
+1. **[内核引擎 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussion-4575385)**
+
+   1.1 [TuGraph 的边是否支持索引？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165379)
+
+   1.2 [TuGraph 单机的 QPS 是多少？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussion-4575381)**
+
+   2.1 [可视化文件 build 后如何更新到 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165364)
+
+   2.2 [如何通过 npm run dev，连接已有的 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165366)
+
+   2.3 [3.3.0 版本 TuGraph Browser 删除 node label 失败？](https://github.com/TuGraph-family/tugraph-db/discussions/82#discussion-4465791)
+3. **[客户端 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussion-4575378)**
+
+   3.1 [Client 目前有哪些编程语言，是否支持 Node.js？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165351)
+
+   3.2 [Python Client 是否支持 pip install？Client 在哪里进行引用？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165353)
+
+4. **[数据导入 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussion-4575373)**
+
+   4.1 [TuGraph 可以对接哪些常用数据库？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165335)
+
+   4.2 [如何进行数据导入？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[存储过程 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussion-4575369)**
+
+   5.1 [如何加载存储过程或算法包？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165313)
+
+   5.2 [如何调用或执行存储过程？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165317)
+
+   5.3 [开源内置的算法包在哪里？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[安装部署 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussion-4575364)**
+
+   6.1 [如何使用 docker 镜像安装？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165287)
+
+   6.2 [rpm 包和 deb 包安装后，启动 lgraph_server 服务，提示缺少'liblgraph.so'报错？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165289)
+
+   6.3 [如何在 Mac 的 M1 芯片上编译 TuGraph？](https://github.com/TuGraph-family/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussion-4575018)**
+
+   7.1 [是否支持不定长边的条件查询？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165252)
+
+   7.2 [如何查询最短路径，shortestPath 函数如何使用？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165256)
+
+   7.3 [查询语句 Where 后使用 and 进行拼接查询速度较慢，语句应如何优化改进？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165260)
+
+   7.4 [如何查询任意跳的边？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165262)
+
+   7.5 [Cypher 是否 date()函数？](https://github.com/TuGraph-family/tugraph-db/discussions/91#discussion-4482858)
+
+如果问题仍然无法得到解决，我们推荐您在[Discussions](https://github.com/TuGraph-family/tugraph-db/discussions)跟帖或发起新贴来描述您的问题。同时 TuGraph QA 大汇总也会根据大家在讨论区发起的帖子，进行定期的更新。
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/9.contacts.md b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/9.contacts.md
new file mode 100644
index 0000000000..8537a0f979
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/9.contacts.md
@@ -0,0 +1,28 @@
+# 联系方式
+
+您有任何对产品的意见和建议，欢迎通过以下联系方式加入讨论，或提出建议。
+
+官网: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue (错误反馈、功能讨论)
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions (技术讨论)
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack (在线开发沟通):
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+钉钉群 (技术交流)
+
+![alert](../../images/dingtalk.png)
+
+微信群 (技术交流)
+
+![alert](../../images/wechat_tech.png)
+
+微信公众号 (信息发布)
+
+![alert](../../images/wechat.png)
+
+邮箱（商务沟通等其他问题）: tugraph@service.alipay.com
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/conf.py b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/conf.py
new file mode 100644
index 0000000000..b6b64b9e64
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/conf.py
@@ -0,0 +1,45 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('5.developer-manual/6.interface/3.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="5.developer-manual/6.interface/3.procedure/")
+    breathe_projects = {"cpp_procedure": "5.developer-manual/6.interface/3.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    subprocess.run(shlex.split("rm -rf 3.C++-procedure 4.Python-procedure.rst index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
+    subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
diff --git a/docs/docusaurus/versions/version-3.6.0/zh-CN/source/index.rst b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/index.rst
new file mode 100644
index 0000000000..a993d697a0
--- /dev/null
+++ b/docs/docusaurus/versions/version-3.6.0/zh-CN/source/index.rst
@@ -0,0 +1,17 @@
+TuGraph高性能图数据库
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.developer-manual/index.rst
+   6.community-manual/index.rst
+   7.best-practices/index.rst
+   8.faq.md
+   9.contacts.md
diff --git a/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile
new file mode 100644
index 0000000000..8dcea940ed
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.0.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-CPP-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-CPP-Procedure-API/run.sh
new file mode 100644
index 0000000000..e2455bfbc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-CPP-Procedure-API/run.sh
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+# 0. install: yum install doxygen, graphviz
+# 1. run this script
+doxygen Doxyfile
diff --git a/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/Makefile b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/Makefile
new file mode 100644
index 0000000000..e58ac30a31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+SPHINXPROJ    = TuGraph
+SOURCEDIR     = .
+BUILDDIR      = _build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/conf.py b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/conf.py
new file mode 100644
index 0000000000..8af367a431
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/conf.py
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+#
+# Configuration file for the Sphinx documentation builder.
+#
+# This file does only contain a selection of the most common options. For a
+# full list see the documentation:
+# http://www.sphinx-doc.org/en/master/config
+
+# -- Path setup --------------------------------------------------------------
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#
+import os
+import sys
+sys.path.insert(0, os.path.abspath('../../../build/output/'))
+
+
+# -- Project information -----------------------------------------------------
+
+project = u'TuGraph'
+copyright = u'2018-2022, Ant Group'
+author = u'Ant Group'
+
+# The short X.Y version
+version = u''
+# The full version, including alpha/beta/rc tags
+release = u''
+
+
+# -- General configuration ---------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#
+# needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.autodoc',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+#
+# source_suffix = ['.rst', '.md']
+source_suffix = '.rst'
+
+# The master toctree document.
+master_doc = 'index'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+# This pattern also affects html_static_path and html_extra_path .
+exclude_patterns = [u'_build', 'Thumbs.db', '.DS_Store']
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+
+# -- Options for HTML output -------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+#
+html_theme = 'nature'
+#html_theme = 'haiku'
+#html_theme = 'pyramid'
+#html_theme = 'sphinxdoc'
+#html_theme = 'bizstyle'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#
+# html_theme_options = {}
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Custom sidebar templates, must be a dictionary that maps document names
+# to template names.
+#
+# The default sidebars (for documents that don't match any pattern) are
+# defined by theme itself.  Builtin themes are using these templates by
+# default: ``['localtoc.html', 'relations.html', 'sourcelink.html',
+# 'searchbox.html']``.
+#
+# html_sidebars = {}
+
+
+# -- Options for HTMLHelp output ---------------------------------------------
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'TuGraphdoc'
+
+
+# -- Options for LaTeX output ------------------------------------------------
+
+latex_elements = {
+    # The paper size ('letterpaper' or 'a4paper').
+    #
+    # 'papersize': 'letterpaper',
+
+    # The font size ('10pt', '11pt' or '12pt').
+    #
+    # 'pointsize': '10pt',
+
+    # Additional stuff for the LaTeX preamble.
+    #
+    # 'preamble': '',
+
+    # Latex figure (float) alignment
+    #
+    # 'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'TuGraph.tex', u'TuGraph Documentation',
+     u'Ant Group', 'manual'),
+]
+
+
+# -- Options for manual page output ------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'tugraph', u'TuGraph Documentation',
+     [author], 1)
+]
+
+
+# -- Options for Texinfo output ----------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'TuGraph', u'TuGraph Documentation',
+     author, 'TuGraph', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+
+# -- Extension configuration -------------------------------------------------
diff --git a/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/index.rst b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/index.rst
new file mode 100644
index 0000000000..4b8195b23d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/index.rst
@@ -0,0 +1,37 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+TuGraph Procedure API - Python
+====================================
+Version: 4.0.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Noe4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
+
+
+Indices and tables
+-------------------
+
+* :ref:`genindex`
+* :ref:`modindex`
+* :ref:`search`
diff --git a/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/make.bat b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/make.bat
new file mode 100644
index 0000000000..b1d0c9a1dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=.
+set BUILDDIR=_build
+set SPHINXPROJ=TuGraph
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.http://sphinx-doc.org/
+	exit /b 1
+)
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/run.sh
new file mode 100755
index 0000000000..d10e0a2b1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/autogen/TuGraph-Python-Procedure-API/run.sh
@@ -0,0 +1,7 @@
+# 0. install sphinx-build: yum install python3-sphinx
+# 1. default lgrpah module path: ../../../build/output/lgraph_python.so
+# 2. make lgraph_python
+# 3. run this script
+rm output -rf
+mkdir -p _static _templates
+sphinx-build -W -b html . output
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/.readthedocs.yaml b/docs/docusaurus/versions/version-4.0.1/en-US/.readthedocs.yaml
new file mode 100644
index 0000000000..92cd0965f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/en-US/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/Makefile b/docs/docusaurus/versions/version-4.0.1/en-US/Makefile
new file mode 100644
index 0000000000..a4de0bff18
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?= -W
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/make.bat b/docs/docusaurus/versions/version-4.0.1/en-US/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/1.guide.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/1.guide.md
new file mode 100644
index 0000000000..aa01fa3936
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/1.guide.md
@@ -0,0 +1,74 @@
+# Guide
+
+> Here is the document map that helps users learn and use the TuGraph community version quickly.
+
+## Quick Start
+
+> Understand [What is a Graph](./2.introduction/1.what-is-graph.md),[The application scenarios of graph](./2.introduction/7.scenarios.md),[What is TuGraph](./2.introduction/3.what-is-tugraph.md).
+
+> Quickly Install and deploy TuGraph:[Cloud Deployment](./5.developer-manual/1.installation/5.cloud-deployment.md),[Docker Deployment](./5.developer-manual/1.installation/3.docker-deployment.md).
+
+> Quickly get started with DEMO:[Movie](./3.quick-start/2.demo/1.movie.md),[The Wandering Earth](./3.quick-start/2.demo/2.wandering-earth.md),[Three Body](./3.quick-start/2.demo/3.the-three-body.md),[Three Kingdoms](./3.quick-start/2.demo/4.three-kingdoms.md).
+
+> User Guide:[TuGraph Browser](./4.user-guide/1.tugraph-browser.md),[TuGraph Browser Legacy](./4.user-guide/2.tugraph-browser-legacy.md).
+
+## Development Guide
+
+> Client Tools:[Cpp Client](./5.developer-manual/4.client-tools/2.cpp-client.md),[Java Client](./5.developer-manual/4.client-tools/3.java-client.md),[Python Client](./5.developer-manual/4.client-tools/1.python-client.md).
+
+> TuGraph Query Language:[Cypher API](./5.developer-manual/6.interface/1.query/1.cypher.md).
+
+> Interface:[Cypher API](./5.developer-manual/6.interface/1.query/1.cypher.md),[OLAP API](./5.developer-manual/6.interface/2.olap/1.tutorial.md),[Procedure API](5.developer-manual/6.interface/3.procedure/1.procedure.md),[RESTful API](./5.developer-manual/6.interface/4.protocol/1.restful-api.md),[RPC API](./5.developer-manual/6.interface/4.protocol/2.rpc-api.md)。
+
+## Community Contribution
+
+> Before starting to contribute, you can learn [how to contribute](./6.contributor-manual/1.contributing.md)
+
+> If you want to understand the division of community roles, please visit [community roles](./6.contributor-manual/2.community-roles.md)
+
+## Main warehouse
+
+> TuGraph-DB repository: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> Visual interface: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java client: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> Simple test method based on twitter data: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> Test method based on standard LDBC-SNB: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics repository: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## Video Center
+
+> [Get started quickly with TuGraph](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph technology sharing collection](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [Understand graph calculation in 3 minutes](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph-Latest-Version
+
+| Description | File | Link |
+|---------------------|--------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 runtime package | tugraph-4.0.1-1.el7.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-4.0.1-1.el7.x86_64.rpm) |
+| CentOS8 runtime package | tugraph-4.0.1-1.el8.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-4.0.1-1.el8.x86_64.rpm) |
+| Ubuntu18.04 runtime package | tugraph-4.0.1-1.x86_64.deb | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-4.0.1-1.x86_64.deb) |
+| CentOS7 runtime image | tugraph-runtime-centos7-4.0.1.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-runtime-centos7-4.0.1.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7) |
+| CentOS8 runtime image | tugraph-runtime-centos8-4.0.1.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-runtime-centos8-4.0.1.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8) |
+| Ubuntu18.04 runtime image | tugraph-runtime-ubuntu18.04-4.0.1.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-runtime-ubuntu18.04-4.0.1.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04) |
+| CentOS7 mini runtime package | tugraph-mini-4.0.1-1.el7.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-4.0.1-1.el7.x86_64.rpm) |
+| CentOS8 mini runtime package | tugraph-mini-4.0.1-1.el8.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-4.0.1-1.el8.x86_64.rpm) |
+| Ubuntu18.04 mini runtime package | tugraph-mini-4.0.1-1.x86_64.deb | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-4.0.1-1.x86_64.deb) |
+| CentOS7 mini runtime image | tugraph-mini-runtime-centos7-4.0.1.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-runtime-centos7-4.0.1.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7) |
+| CentOS8 mini runtime image | tugraph-mini-runtime-centos8-4.0.1.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-runtime-centos8-4.0.1.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8) |
+| Ubuntu18.04 mini runtime image | tugraph-mini-runtime-ubuntu18.04-4.0.1.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-runtime-ubuntu18.04-4.0.1.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 compilation image | tugraph-compile-centos7-1.2.7.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.2.7.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos7) |
+| CentOS8 compilation image | tugraph-compile-centos8-1.2.7.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.2.7.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos8) |
+| Ubuntu18.04 compilation image | tugraph-compile-ubuntu18.04-1.2.7.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.2.7.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04) |
+
+
+For the version update log, see: [Link](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md).
+
+If you don't know how to use installation packages and images, please refer to [Environment and Version Selection](./7.best-practices/4.selection.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..549043a94c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,15 @@
+# What is Graph
+
+The graph that we're going to introduce today, it's neither a picture, nor a diagram，it's a class of mathematics called graph theory. We can see on the screen that there are two graphs on the left and right, which represent things and their relationship. We abstract it out in a form, and we call such a form a graph.
+
+![alt what is graph](../../../images/what-is-graph-en.png)
+
+The basic elements of a graph are a vertex, and an edge, a vertex is a representation of the thing, of the entity, and an edge is a representation of the relationship between them.
+
+We see the graph on the left, the dots have companies, they have employees, and they have projects. What are their sides? The relationship between the company and the employees is an employment relationship, and there can be a friend relationship between the employees, and there can be a participation relationship between the project and the employees. That is, we can use graphs to abstract things and their relationships.
+
+The diagram on the right is a schematic diagram of a financial transaction. Each of us has a bank account, and when our bank account makes a consumption or makes a transfer, this account is the point on the graph, and this edge can indicate that there is such a transfer relationship between us.
+
+We can also see from this example that edges can attach information and points can attach information. The point can attach which bank this account is in and what the account is. The value of the transaction can be attached to the edge, and many times, if your transaction is large, it indicates that special attention is needed. This edge might not necessarily be the amount of a particular transfer, it might be the amount accumulated over a period of time and so on. Graphs can actually be very expressive.
+
+On the other hand, for a graph like finance, it can be very large. There could be more than a billion points, a hundred billion or even a trillion edges. As you can imagine, it's actually quite challenging to actually work with these graphs.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..935aa4ffa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# What is a graph database
+
+> This document mainly introduce what is a graph database, the advantages of graph database compared with relational database, and the comparison between graph database and relational database
+
+## 1. Introduction
+
+Graph database is a database based on graph model. The main function of graph database is to manage graph data, so it needs to support efficient vertex/edge query and update; To facilitate user use, it is usually necessary to add transaction support to ensure the normal operation of concurrent operations.
+
+## 2. Advantages of graph databases over relational databases
+
+The function of graph database is an extension of traditional relational database. Compared with relational database, the graph structure supported by graph data is more flexible. Graph database is different from other databases in terms of data addition, deletion, query and modification based on graph. On the operation abstraction of graph data, a vertex-based perspective is adopted, for example, a vertex accesses its neighboring vertices through all its outgoing edges. This kind of operation is also the core of the design of graph database system.
+
+The uniqueness of graph database can be reflected in the following three aspects:
+
+### 2.1 Performance
+
+Handling the relationship between data, it is inevitable to use table JOIN operation in relational database, which has a great impact on performance. Graph database is a direct access, similar to pointer access, which is more efficient operation of associated data, compared with relational database performance improvement of 2 to 4 orders of magnitude.
+
+### 2.2 Compatibility
+
+In reality, the process of a project is often evolutionary. The content and even the format of the data are constantly changing. In a relational database, this means that a change in the table structure, or the creation of multiple new tables, significantly changes the source data. In the graph database, you simply add new vertices, edges, and attributes, and set them to the corresponding types. In essence, a table represents a type of data, and a vertex represents a specific data, meaning that relational databases pay more attention to the type of data, while graph databases pay more attention to the individuals of data and identify their association relationships.
+
+### 2.3 Intuitive
+
+Using graphs (or nets) to express real-world relationships is more straightforward and natural, especially in the Internet of Things era. If relational data used, a high degree of abstract thinking required to build a table of characters first, then a table of relations, and finally a map of data. When analyzing and querying the graph data, you can also intuitively find the desired data interactively through the point-edge connection topology, without any professional knowledge.
+
+## 3. Comparison between graph database and relational database
+
+| classification      | model           | advantage                                                            | disadvantage                                                                 | example        |
+| ------------------- | --------------- | -------------------------------------------------------------------- | ---------------------------------------------------------------------------- | -------------- |
+| Relational database | Table structure | Data is highly structured, consistent, and software maturity is high | The multi-hop association query is inefficient or not supported              | MySQL、Oracle  |
+| Graph database      | graph structure | Modeling and manipulating associations is very efficient             | Highly structured data processing is not as powerful as relational databases | Neo4j、TuGraph |
+
+In a word, in the face of massive data storage and processing problems, the traditional relational database has been unable to meet most of the daily data storage needs. Graph database technology can store relational information as entities and expand data model flexibly. Because it provides the most direct expression of related data, and the graph model is naturally tolerant to heterogeneous data. In the future, graph database technology will become one of the most popular technologies, which will provide powerful support for enterprises to store and analyze large-scale graph data.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..5ac85b65d2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,103 @@
+# What is TuGraph
+
+> This document mainly introduces the main features and characteristics of TuGraph Community Edition, as well as the differences between TuGraph Enterprise Edition and Community Edition.
+
+
+## 1.Introduction
+
+Graph database is a non-relational database that stores data by vertices and edges. It can be used to store complex data network models, such as social networks and transaction networks. TuGraph is a graph database developed by Ant Group. This manual introduces the functions and usage of TuGraph.
+
+## 2.TuGraph Community Edition
+
+The Community Edition is a fully functional version of TuGraph, suitable for single-instance deployment. It provides complete basic fuctions of graph database, such as ACID-compatible transactions, programming APIs, and associated tools. It is ideal for learning TuGraph and implementing small projects.
+
+## 3.TuGraph features
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property graph model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+## 4.The data model
+
+### 4.1.Graph model
+TuGraph is a strong schema, directed property graph database with multi-graph capability.
+
+- Graph Project: Each database service can host multiple graph projects (multi-graphs), and each graph project can have its own access control configuration. The database administrator can create or delete specified graph projects.
+- Vertex: Refers to entity, generally used to express real-world entities, such as a movie or an actor.
+    - Primary Key: User-defined vertex data primary key, unique in the corresponding graph project and vertex type.
+    - VID: Refers to the auto-generated unique ID of the vertex, which cannot be modified by the user.
+    - Upper Limit: Each graph project can store up to 2^(40) vertex data.
+- Edge: Used to express the relationship between vertexs, such as an actor appears in a movie.
+    - Directed Edge: The edge is a directed edge. If you want to simulate an undirected edge, the user can create two edges with opposite directions.
+    - Duplicate Edge: TuGraph currently supports duplicate edges. If you want to ensure the uniqueness of the edge, you need to implement it through business policies.
+    - Upper Limit: Up to 2^(32) edge data can be stored between two vertex data.
+- Property Graph: vertexs and edges can have properties associated with them, and each property can have a different type.
+- Strong-typed: Each vertex and edge has only one label, and after creating a label, there is a cost to modify the number and type of attributes.
+    - Specify the starting/ending vertex type of the edge: You can limit the starting and ending vertex types of the edge, and support different vertex types of the starting and ending vertexs of the same type of edge, such as individuals transferring money to companies, companies transferring money to companies. After specifying the starting/ending vertex type of the edge, you can add multiple sets of starting/ending vertex types, but you cannot delete the restricted starting/ending vertex types.
+    - Unrestricted Mode: Supports creating edge data of this type between any two vertex types without specifying the starting and ending vertex types of the edge. Note: After specifying the starting/ending vertex type of the edge, the unrestricted mode cannot be used again.
+
+### 4.2.The data type
+
+TuGraph Supports a variety of data types that can be used as attributes, the specific supported data types are as follows:
+
+<caption>Table 1. TuGraph supported data types</caption>
+
+| **Type** | **Min**             | **Max**             | **Description**                                  |
+|----------|---------------------|---------------------|--------------------------------------------------|
+| BOOL     | false               | true                | Boolean                                          |
+| INT8     | -128                | 127                 | 8-bit int                                        |
+| INT16    | -32768              | 32767               | 16-bit int                                       |
+| INT32    | - 2^31              | 2^31 - 1            | 32-bit int                                       |
+| INT64    | - 2^63              | 2^63 - 1            | 64-bit int                                       |
+| DATE     | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" Date of format                      |
+| DATETIME | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD hh:mm:ss[.ffffff]"Format of the date and time |
+| FLOAT    |                     |                     | 32-bit float                                     |
+| DOUBLE   |                     |                     | 64-bit float                                     |
+| STRING   |                     |                     | A string of variable length                      |
+| BLOB     |                     |                     | Binary data                                      |
+
+_BLOB data is BASE64 encoded in input and output_
+
+### 4.3.Index
+
+TuGraph supports indexing vertex fields.
+
+Indexes can be unique or non-unique. If a unique index is created for a vertex label, TuGraph will perform a data integrity check to ensure the uniqueness of the index before modifying the vertex of the label.
+
+Each index built on a single field of a label, and multiple fields can be indexed using the same label.
+
+BLOB fields cannot be indexed.
+
+TuGraph supports creating indexes on properties of vertexs or edges to improve query efficiency.
+- The index can be a unique or non-unique index.
+- If a unique index is created for a vertex label, when modifying the vertex of the label, data integrity check will be performed first to ensure the uniqueness of the index.
+- Each index is created based on a property of a vertex or edge, and indexes can be created on multiple properties of the same vertex or edge.
+- An index cannot be created on a BLOB-type property.
+
+## 5.TuGraph Enterprise Edition
+
+The Enterprise Edition has more comprehensive support for commercial features, including distributed cluster architecture, a one-stop graph platform covering exploration, research and development, service and operation and maintenance throughout the lifecycle, online, near-line, and offline graph computing engines, support for streaming and big data data sources, multi-site and multi-center deployment, making it an ideal choice for commercial solutions.
+
+```text
+    If you need to implement production-level high-availability cluster architecture, operation and maintenance and other enterprise-level services, please contact us to obtain commercial support:
+    Email:tugraph@service.alipay.com
+    Tel:0571-85022088,extension number 83789993#
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..de894fa1b0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# Performance Oriented
+
+> This document mainly introduces TuGraph's performance-oriented design philosophy as an open-source graph database.
+
+## 1.Introduction
+
+TuGraph is currently the fastest graph database in the world, ranking first in the LDBC SNB Interactive graph database standard evaluation (March 2023). The design of TuGraph is based on performance optimization, and is committed to building a high-performance single-machine graph database. This document describes the core design of TuGraph's storage layer based on performance optimization.
+
+## 2.Characteristics of Graph Operations
+
+Operations on property graphs involve reading, writing, and their attributes, and the access patterns of some special attributes such as timestamps can also affect overall performance. Here, by summarizing the regularities of some graph operation characteristics, we can guide the final performance.
+
+We observe that many graph applications have similar data access patterns. For example, in credit risk control, we use recursive path filtering to search for many-to-one patterns to find suspicious credit fraud users and behaviors. For online gambling, we can identify gambling-related fund accounts by recognizing multiple fund transfers in a short period of time. The equity penetration scenario recursively calculates the equity relationship between entities. These scenarios have common patterns such as multi-hop entity and relationship access, time window constraints, and read/write transactions.
+Furthermore, from the discussion in the introduction and the analysis of graph workloads, the following characteristics can be summarized:
+
+**Characteristic 1** KHop is the most typical operation in a graph, based on the data access pattern of the graph topology of points and edges, and has essential differences from relational databases. The typicality of KHop is not only reflected in the different data access patterns, but it is also the performance point that graph databases need to pay attention to the most.
+
+**Characteristic 2** Data access of graph workloads has a certain degree of locality on the topology, and the edges of the same point are usually accessed simultaneously. When the labels of these edges are the same, there is a greater probability of simultaneous access.
+
+**Characteristic 3** When accessing points and edges in graph workloads, their corresponding attributes are usually accessed as a traversal filter condition.
+
+**Characteristic 4** In time-based graph workloads, filtering of points and edges is usually within a certain time range, such as the past week.
+
+**Characteristic 5** Write operations may be accompanied by a large number of read operations, which need to be processed in a single transaction cycle.
+
+Through the analysis of actual online graph applications, the read/write ratio of graph workloads is about 20:1, although the scenarios are limited to the financial field and the number of clusters is also limited, the scale of the data involved and the number of users are very large, which is representative to some extent. The 20:1 read/write ratio of graph workloads indicates that the impact of read workload on overall performance is greater, and the performance of write workload cannot be ignored either.
+
+## 3.Storage Data Structures
+
+TuGraph uses B+ trees as the underlying data structure to support real-time transactional operations for insertion, deletion, querying, and updating.
+
+In sorting tree data structures, B+ trees and LSM trees are the main representatives. B+ trees use a split and merge method to update sorted data in tree nodes, while LSM trees append updates to logs for delayed data merging. B+ trees were originally used in file system implementations, solving the problem of differences in performance between sequential and random operations on hard disks by storing data in adaptive-length leaf nodes, and have a relatively balanced read/write performance. The main advantage of LSM trees is to use WAL (Write Ahead Log) to perform updates, which turns update operations into sequential operations, especially in the case of small key-value pairs. WAL means that the update of data is deferred until it is merged in batches, which can improve the comprehensive efficiency of batch updates, but also makes the system scheduling more complicated. If the update merge is not completed, and the data is read again, LSM trees need to read several levels of locally merged logs, which will cause read amplification and space amplification, thereby affecting read efficiency.
+
+To sum up, B+ trees have better sequential read/write performance, while LSM trees have advantages in random write data. In addition, the way of LSM trees using background merging makes the performance fluctuation difficult to predict, and the correlation between performance fluctuation and upper-level storage and computation is weak, which increases the overall design cost. Considering the above factors, TuGraph chooses B+ trees as the implementation for read performance optimization.
+
+## 4.Data Encoding
+
+For property graph models, in addition to graph topology encoding, property data also greatly affects functionality and performance. We first discuss how property data can be encoded together with topology data. From current research, there are two ways of encoding properties: discrete encoding, which stores property data separately based on pointer indexes, and compact encoding, which packs property data and topology data together. Discrete encoding can store each property separately or pack each edge's properties separately, and the following discussion applies to both situations.
+
+Vertex Query: Property encoding mainly focuses on edges and does not involve vertex queries.
+
+Single-Edge Query: Discrete encoding locates edges through pointers, while compact encoding requires binary search to locate the edge position. Discrete encoding has a slight advantage.
+
+Edge Traversal: Discrete encoding requires constant random access through pointer jumps during edge traversal, while compact encoding arranges data together in advance, greatly improving efficiency due to its sequential access feature. Since edge traversal operations are common according to Rule 3, compact encoding has obvious advantages in edge traversal.
+
+Single-Edge Update: Discrete encoding only requires finding the corresponding pointer position and modifying the pointer's location before and after inserting data. Compact encoding needs to re-encode the compactly arranged data and rewrite the entire edge value, resulting in significant overhead compared to discrete encoding.
+
+Batch Edge Update: Batch updates can pre-build all edge properties for a vertex in memory and write them in one encoding, making both discrete encoding and compact encoding equivalent. However, compact encoding does not require storing pointer variables, so it has higher storage space efficiency.
+
+The performance issues of discrete encoding and compact encoding for a certain type of query discussed above can be alleviated through optimization. Overall, due to the 20:1 read-write load of graphs and the characteristics of property access revealed by Rule 3, TuGraph tends to use compact encoding to ensure read performance. Its main weakness is the overhead of re-encoding during single-edge updates, which can be solved using adaptive mapping technology.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..c60df29973
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,33 @@
+# Multi Level Interfaces
+
+> This document mainly introduces the design concept of TuGraph's multi-level interfaces.
+
+## 1.Introduction
+
+The multi-level interface is a balance between usability and high performance that TuGraph has designed to meet a variety of use cases. For example, Cypher, a declarative graph query language, can abstract away the implementation details of a graph database and express queries based on the graph model. However, Cypher's high-level descriptions cannot be efficiently translated into low-level execution, so TuGraph provides a procedural language, Procedure API, to achieve optimal database performance.
+
+Interfaces can be roughly divided into client interfaces and server interfaces. Most operations are performed on the server, and the client only does data encapsulation and parsing. The client and server are connected through a network, and TuGraph supports both flexible short-connection REST protocol and more efficient long-connection RPC protocol, which can be selected according to different business scenarios.
+
+The server interfaces are all at the calculation layer and are logically separated from the graph data storage by a Core API layer.
+
+![Multi Level Interfaces](../../../../images/multi-level-Interfaces-en.png)
+
+### 1.1.Client Interface
+
+The client interface refers to the interface executed on the client and is typically used for integration into software applications. TuGraph's client interface is relatively simple, including login/logout, data import/export, stored procedure loading and calling, and Cypher operations. Cypher integrates most of the functions, including data operations, graph model operations, operations and account management.
+
+Since the parameters and return values of Cypher are strings, JAVA OGM is a structured wrapper for Cypher, meaning that query results can be encapsulated into a typed object for ease of use.
+
+### 1.2.Server Interface
+
+The server interface includes Cypher, Procedure API, OLAP API, and GNN PI, which provide services for graph transaction engines, graph analysis engines, and graph neural network engines. The characteristics of each interface are explained in detail below.
+
+> __Cypher__ is an abstract description of query logic that is independent of execution logic and is more user-friendly for graph database applications, similar to the SQL language of relational databases. TuGraph's Cypher language mainly follows the OpenCypher query standard open-sourced by Neo4j and extends auxiliary functions such as operations and maintenance management. Descriptive graph query language will become the main data operation method for graph databases, but generating the optimal execution plan between description and execution still requires a long way to go in both academia and industry.
+
+> __Procedure API__ is designed to bridge the gap between descriptive graph query language and optimal performance. TuGraph's Procedure API provides a simple wrapper on top of the Core API, which maximizes the storage's performance efficiency and is the upper limit of Cypher optimization performance. Python Procedure API is a cross-language wrapper on top of C++ Procedure API, but the copying of values during translation may result in some performance loss, and its advantage lies mainly in the ease of use of the Python language. The traversal API is a parallel-executing Procedure interface that is more similar to set operations in terms of description, such as expanding all outgoing neighbors of a point set to obtain a new point set.
+
+> __OLAP API__ belongs to the category of "graph computing systems" and exports snapshots of graph data from storage that supports insert, update, delete, and query operations to support read-only complex graph analysis in a more compact data storage format. OLAP API encapsulates data structures that support high-concurrency execution, including Vector, Bitmap, and CSR-based graph snapshot data structures, and provides a set of concurrent fast point-edge operation frameworks. After the graph analysis task is completed, the data can be written back to the graph database through the interface.
+
+> __GNN API__ mainly provides the interfaces needed for graph neural network applications and can be integrated with machine learning frameworks such as PyTorch. TuGraph's GNN PI mainly integrates DGL and completes the entire process from graph storage to graph neural network application in the Python language environment.
+
+Except for Cypher's interpretive execution, all other server interfaces are compiled and executed, meaning that the corresponding code needs to be sent to the server and compiled (which may take some time) before execution on the server. Therefore, it is usually necessary to load the program first, then find it in the list of loaded applications, and execute it after passing in the input parameters.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/3.htap.md
new file mode 100644
index 0000000000..080cc02e48
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> This document mainly introduces the design philosophy of TuGraph's HTAP.
+
+## 1.Introduction
+
+![htap](../../../../images/htap-en.png)
+
+There are different ways to implement HTAP in architecture: one is to use two different copies to handle OLTP and OLAP tasks separately, with the core being data consistency synchronization and additional resource overhead; the other is to use the same data storage at all times, but this implementation has memory bloat in its data structure and needs further work for industrialization. In TuGraph's design, simple OLAP and OLTP operations share the same data, while complex OLAP operations are exported and handled separately as snapshots.
+
+## 2.Design
+
+In TuGraph, OLTP is the graph transaction engine, corresponding to transaction operations in Figure; OLAP is the graph analysis engine, corresponding to simple graph analysis operations (such as SPSP) and complex graph analysis operations (such as PageRank), the former of which can be executed directly on the graph storage, while the latter requires exporting a snapshot for execution.
+
+- Transaction operations, measured by the graph transaction engine, are local graph add, delete, query and modify operations, typically used for K-hop access.
+- Simple analysis operations are the simpler part of the graph analysis engine, usually local graph analysis operations, such as the shortest path algorithm SPSP and Jaccard algorithm.
+- Complex analysis operations are the more complex part of the graph analysis engine, usually involving multi-round data iteration operations across the entire graph, such as the PageRank algorithm for webpage ranking and the Louvain algorithm for community discovery.
+
+As shown in Figure , external storage is added to the architecture diagram, making the data source for graph analysis not limited to the graph database and can be directly read from text files.
+
+- Graph storage, which is the storage in the graph database, has carefully designed data structures that can perform real-time add, delete, query and modify operations.
+- External storage, which can be an RDBMS or text file, is stored in a simple way as an edge table, only for one-time batch reading and batch result writing. In the calculation layer, it corresponds to the interface in the overall architecture diagram.
+- Cypher, the declarative graph query language, can be executed concurrently.
+- Procedure API, the procedural graph query language, is flexible and can support both transaction operations and graph analysis operations, but its efficiency is not sufficient to complete complex graph analysis operations, and it can be executed concurrently.
+- OLAP API, for multi-round iteration of complex graph analysis. Applications need to first export the graph data in storage into a snapshot in memory, which is only used for fast access and does not need to consider the write support of ACID, so it can be arranged more compactly, and the read efficiency of CSR arrangement is much higher than that of graph storage data arrangement. OLAP API can only be executed serially, and each operation uses full CPU resources.
+
+OLAP API snapshots can be created from external storage, where the edge table data is formatted as CSR, or from the graph storage. It should be noted that OLAP API requires that the IDs of the vertices be consecutive natural numbers, which may require additional ID mapping. This step can be mapped to a specified attribute when creating a snapshot or directly using the attribute value as the ID.
+
+Corresponding to the calculation interface and storage, there are four operating modes.
+
+- Transaction mode, each operation corresponds to a Cypher statement, which is a transaction by default.
+- Plugin mode, call through plugins, after the calculation logic is loaded on the server, also known as stored procedures.
+- Embed mode, which has the same interface as Plugin mode but the graph database service does not need to be started and can directly call the data in the database through the interface. This mode is usually used for debugging Procedure API and OLAP API code, and the debugging information and operation steps are more friendly than Plugin mode.
+- Standalone mode, which maximally separates from the graph database, is more direct when only using the graph analysis engine for data analysis. Standalone mode will directly use the data of the external storage.
+
+The use of the graph neural network engine is similar to the 'complex graph analysis operation', which calls part of the OLAP API and GNN API at the same time, which is not elaborated here.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/index.rst
new file mode 100644
index 0000000000..b42c13eac8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/4.characteristics/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Characteristics
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/5.architecture.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/5.architecture.md
new file mode 100644
index 0000000000..198facd84b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/5.architecture.md
@@ -0,0 +1,15 @@
+# Architecture
+
+> This document mainly introduces the product architecture of TuGraph.
+
+## 1.Introduction
+
+![Architecture](../../../images/architecture-en.png)
+
+The following diagram shows the overall architecture of an enterprise-level graph database from the perspective of functional modules, using TuGraph as an example, from bottom to top:
+
+- Software and hardware environment. This involves the development and use environment of the graph database. TuGraph is mainly developed based on the underlying C++ language, and is compatible with most operating systems and CPUs on the market.
+- Storage layer, including the KV storage layer and the graph storage layer. The storage layer needs to support various functions required by the calculation layer.
+- Calculation layer. The calculation layer should include the graph transaction engine, graph analysis engine, and graph neural network engine. It also includes a variety of programming interfaces provided by the server, including descriptive query language Cypher, stored procedures, and so on.
+- Client. The client SDK should support multiple languages such as Java, Python, and C++, and also support command-line interaction. The Browser and Explorer reduce the threshold for using the graph database through web-based interaction.
+- In terms of ecological tools, it covers the development, operation, and management links of enterprise-level graph databases, improving usability.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/6.functionality.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/6.functionality.md
new file mode 100644
index 0000000000..eaf709f08e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/6.functionality.md
@@ -0,0 +1,101 @@
+# Functionality
+
+> This document mainly introduces the main functions and features of TuGraph.
+
+## 1.Installation
+
+## 1.1.Installation
+
+Deployment methods TuGraph currently provides three deployment methods: cloud deployment, Docker deployment, and local package deployment. Users can choose the appropriate deployment method according to their actual situation.
+
+## 1.2.Software and Hardware Environment
+
+TuGraph core is developed in C++, and the default compiler used is GCC8.4, using c++14 standard. Some functions use other compilers, such as ApacheLucene-based full-text indexing, which uses JNI interface and requires a Java compiler. In addition, the Python Procedure API is provided in the stored procedure, which requires a Python environment. TuGraph does not require special hardware such as GPUs, and can naturally adapt to general hardware upgrades such as RDMA and HBM with high latency and low bandwidth.
+
+TuGraph has been tested on CPUs based on X86 and ARM, including Intel, AMD, Kunpeng, Hygon, Feiteng, etc., and also runs on multiple operating systems, including mainstream versions of Ubuntu, CentOS, SUSE, Galaxy Kylin, Zhongbiao Kylin, and UOS, without special requirements for operating systems and CPUs.
+
+The software and hardware environment also includes the environment of dependent libraries. Since the default KV storage in TuGraph's storage layer is LMDB, the file system needs to support POSIX interfaces. The compilation and parameter configuration in different environments will be slightly different. For example, in the packaging of point-edge data in graph storage, it should match the page table size of the operating system, which is 4KB by default, and it is recommended to set the system's page table size to 4KB.
+
+## 2.Storage layer
+
+In the graph data model, TUGraph supports the attribute graph model, which can be divided into subgraphs, tags (including vertex tags and edge tags), and attributes according to the hierarchy.
+
+From the perspective of the storage layer, TuGraph uses an intuitive multi-layered tree model, without tags across subgraphs or attributes across tags, and only retains the core logic of the graph model. In terms of subgraph storage, TuGraph has performed data physical isolation for multiple graphs, and each graph corresponds to an instance of LMDB. The metadata description information of multiple graphs is saved in a special public LMDB instance called meta. The storage of vertex and edge tags and their attributes maps graph data adaptively to KV key-value pairs, maximizing read performance. At the same time, multi-threaded writing is implemented at the KV layer, solving the disadvantage of low write performance of LMDB. Primary key indexes and secondary indexes correspond to B+ tables in LMDB, supporting index value addition, deletion, query, and modification based on comparison.
+
+The storage layer also retains some other non-core functional data, including permission data, pre-compiled plugin data, and monitoring data.
+
+## 3.Calculation layer
+
+The calculation layer is divided into three parts in terms of function, including the TP-class graph transaction engine, the AP-class graph analysis engine, and the graph neural network engine.
+
+__The graph transaction engine__ is mainly used to process concurrent graph operations, including single-point queries, neighbor queries, and path traversal. The graph transaction engine focuses on ACID transactions of concurrent operations, ensuring that the operation logic will not interfere with each other. The main performance indicator is QPS, which is the number of completed queries per second.
+
+__The graph analysis engine__ usually operates as a full-graph iteration. Some simple analysis tasks (such as SPSP) can be completed by the graph transaction engine, and complex analysis tasks are completed by the graph analysis engine, which usually takes several seconds to several hours for a single task. Therefore, a single graph analysis task should use all hardware resources in parallel, and the performance indicator is the total time for completing the task.
+
+__The graph neural network engine__ usually operates as a full-graph iteration. In addition to graph topology-based operations, the graph neural network engine also needs to integrate a machine learning framework to handle vector operations, such as PyTorch, MXNet, and TenserFlow.
+
+The logic of the three engines is different and independently configured for resource pools. The graph transaction engine sets up a thread pool based on RPC operations. For each operation received from the client, a thread is taken from the pool to process it, and the number of concurrent executions is equal to the capacity of the RPC thread pool, which is usually configured as the number of server cores. The graph analysis engine has an analysis thread pool, and each graph analysis task is executed concurrently, that is, all threads are used to execute a task to speed up the performance of the operation. The serial execution feature of TuGraph graph analysis operations will restrict the user experience to a certain extent. The demand for concurrent graph analysis can be processed by deploying high-availability, increasing machine resources, or connecting to an external task scheduler to transfer data to a container for real-time scheduling and calculation. Graph neural network operations will reuse the resources of the graph transaction
+
+## 4.Core Features
+
+### 4.1.Query Language
+
+TuGraph provides Cypher graph query language that follows the OpenCypher standard.
+- Supports Procedure embedding.
+- Supports pluggable optimization frameworks with various optimization features.
+- Supports extensible security check framework for Cypher.
+
+### 4.2.Stored Procedures
+
+When users need to express complex query/update logic that Cypher cannot describe, or when high performance is required, TuGraph's stored procedures (Procedure) is a more concise and efficient choice than calling multiple REST requests and completing the entire processing flow on the client-side.
+
+### 4.3.Data Import/Export
+
+Although TuGraph supports data insertion, batch import can greatly improve efficiency. The import function can be divided into importing into an empty database (offline import) and incremental import. The former refers to importing when the subgraph is empty, and the additional assumption can greatly improve the import performance. In TuGraph, the throughput rate of empty database import and incremental import differs by 10 times. Data consistency needs to be considered in data export, which is based on exporting data based on a snapshot.
+
+TuGraph can perform data export on graph data already stored in TuGraph using the command-line tool `lgraph_export`. The export format supports CSV and JSON.
+
+### 4.4.Backup and Restore
+
+ TuGraph's backup function can be divided into active/scheduled, offline/online, and full/incremental backup. The goal is to complete the backup with the smallest storage and computing costs possible. The Restore function can restore to the latest state or a historical marked time point, ensuring that the database is in a consistent state.
+
+### 4.5 Data Warmup
+
+TuGraph is a disk-based graph database, and data is loaded into memory only when it is accessed. Therefore, system performance may deteriorate due to frequent IO operations in the first period after the server is opened. We can improve this problem by preheating the data in advance.
+
+### 4.6 High Availability Mode
+
+High availability means that by configuring a cluster, real-time multi-replica data hot backup can be achieved, and the cluster can still provide services when some replicas are not in use. TuGraph uses the multi-machine hot backup mechanism of the RAFT protocol, which can reduce RPO to near 0. Data synchronization is performed at the computation layer through RPC interfaces for write operations. The high availability cluster of TuGraph adopts a master-slave mode, where only the master node processes write requests, and both master and slave nodes can process read requests. The write request processing of the master node needs to be synchronized to more than half of the total nodes. The write request is considered complete when the majority of the nodes have written successfully.
+
+## 5.Client Tools
+
+Client Tools Client tools mainly include SDKs for various programming languages, OGM, and command-line tools.
+
+The client SDK is mainly used for secondary development and can be linked to the server through RPC or REST protocols. RPC has better performance based on long links, and data needs to be uniformly serialized through protobuf. TuGraph uses brpc, which supports rpc clients in Java, Python, and C++. REST's protocol is more flexible and can be easily adapted to more diverse environments, and different programming languages can easily connect. TuGraph provides a Python REST client instance, and command-line interaction is also implemented using REST.
+
+OGM (Object Graph Mapping) is a graph object mapping tool for TuGraph, which supports mapping JAVA objects (POJO) to TuGraph. Classes in JAVA are mapped to nodes in the graph, collections in classes are mapped to edges, and properties of classes are mapped to properties of graph objects. It also provides corresponding function to operate the graph database. Therefore, JAVA developers can easily use TuGraph database in a familiar ecosystem.
+
+The command-line tool `lgraph_cypher` is a query client that can be used to submit OpenCypher requests to the TuGraph server. `lgraph_cypher` client has two execution modes: single-command mode and interactive mode.
+
+
+## 6.Ecological Tools
+
+Ecological tools are a crucial component of enterprise-level databases, and a rich array of ecological tools can greatly enhance the usability and stability of graph databases.
+
+### 6.1.TuGraph DataX
+
+![Import&Export](../../../images/tugraph-datax.png)
+
+TuGraph's core supports importing and exporting CSV and JSON data, offering both full database and incremental importing modes. In practice, there may be a need to import from multiple data sources such as MySQL, Kafka, and Hive, and TuGraph connects to these sources using DataX. Due to the differences between relational and graph models, data cleaning processes can be quickly processed using SparkSQL. TuGraph focuses only on the reliability and performance of simple CSV and JSON scenario imports.
+
+### 6.2.Visual Interaction
+
+TuGraph Browser is a visual interface for direct users of graph databases, covering most of TuGraph's capabilities, including data import, graph model building, data addition/deletion/query/modify, and monitoring and maintenance operations.
+
+TuGraph Explorer targets graph business users and focuses more on business logic. Explorer is a visual interactive interface generated using Graph Insight's zero-code programming framework, which can easily add more user-friendly interactive elements to present the graph as an underlying image of understanding.
+
+### 6.3.Monitoring
+
+TuGraph uses the Prometheus + Grafana monitoring framework in a loosely coupled manner. Prometheus obtains monitoring information from TuGraph's monitoring interface, stores it in a local time-series database, and then displays it interactively on the web using Grafana.
+
+The monitoring states provided by TuGraph include the state of the graph database and the state of the server. The former includes the database-side status such as read/write load and number of vertices/edges, while the latter includes the real-time status of the server's memory, CPU, and hard disk. If some monitoring state exceeds the expected threshold, proactive alerts are necessary, usually requiring integration with other operations and control systems such as group messaging and email alerts.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/7.scenarios.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/7.scenarios.md
new file mode 100644
index 0000000000..9d5a7ac434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/7.scenarios.md
@@ -0,0 +1,61 @@
+# Scenarios
+
+> This document mainly introduces the application scenarios of graph databases.
+
+## 1.Financial Industry
+
+The entities in the financial industry mainly involve people, companies, accounts, products, etc., and their relationships include transaction relationships, logging relationships, equity relationships, employment relationships, etc. These entities form a financial graph data network. By applying graph databases, we can discover a lot of useful information from the financial graph data network, which helps us make more accurate financial decisions.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Loan review|By analyzing the applicant's relationship and transaction history, etc., it is auxiliary to judge the applicant's repayment ability and willingness. It can be applied to retail loan review, small and micro loan review, supply chain finance, etc. This method can complement the traditional audit mechanism based on the applicant's own information, which is particularly useful for small and micro loan audits with low individual information coverage.|
+|Post-loan|By analyzing the borrower's transaction history, it assists in analyzing whether the borrower has default risk. Compared with the traditional method of issuing alerts only when loan funds flow to specific users, this method can assign a risk value to each account and issue warnings when the loan flows to high-risk accounts.|
+|Missing recovery|By analyzing the social and shopping data of missing borrowers, other contact methods can be found. This method can significantly improve the recovery rate of missing borrowers.|
+|Guarantor loop detection|Special guarantee structures such as cyclic, chain, family-style, and cross can be found in the guarantee relationship graph to expose potential risks. Compared with the JOIN method of a relational database, the solution based on graph algorithms is more efficient, can detect any length of guarantee loop, and can achieve more complex limited condition detection.|
+|Credit card fraud detection|A relationship network of addresses, contact information, etc. in credit card application information is constructed, and a community discovery algorithm is run in the application relationship network to detect suspected fraudulent gangs, thereby rejecting suspected fraudulent applications and reducing economic losses.|
+|Anti-money laundering|Suspected money laundering behaviors and links can be found through the transaction network and medium network. Money laundering is a complex process involving multiple parties. By conducting graph analysis in transaction and social networks, we can more accurately detect money laundering behaviors.|
+|Car insurance anti-fraud|For insurance fraud involving repair shops, by analyzing the relationship between the insured person, the case location, and the repair shop, fraudulent claims can be more accurately identified, reducing economic losses.|
+
+## 2.Industrial Industry
+
+A large amount of heterogeneous data will be generated in the production and manufacturing process, and how to effectively organize and manage these data is one of the most important issues in industrial big data. These data include design documents, equipment data, simulation plans and results, experimental results, experience documents, etc. The relationships between these data are complex, and traditional data management systems can only accumulate data, and they are often unable to search for related materials. Using graph models, these different types of data are organized into a network, which makes it easy to browse and search for data.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Supply chain management|Supply chain data mainly concerns the correspondence between products, components, and parts, the correspondence between parts and suppliers, and sensitive components in parts. Compared with the traditional BOM system, the solution using graph databases can more conveniently maintain complex networks of multiple component levels and multiple supplier levels, thereby providing basic support for a through supply chain.|
+|Document management|Using graph databases can organize different types of documents together organically according to different relationships. For example, design documents for components, component-part relationships, component test documents, relevant experience documents, etc. can be organized together so that all relevant information for the component can be obtained easily when needed.|
+|R&D process management|A large amount of simulation, experimentation, and testing needs to be performed in the product development and verification process. Each test process involves many different steps, the connection between the steps, the data versions used in each step, and the algorithm versions all make up a complicated relationship network. Using graph databases can better manage this relationship network, providing a good foundation for data reuse and process improvement in the R&D process.|
+|Equipment information management|Manufacturing requires the management of a large number of devices, which are interrelated (power supply, feeding, spatial relationship) to form a complex network. Traditional databases are difficult to reflect this complex relationship. Using graph databases can easily represent these relationships, thereby better managing equipment information.|
+
+## 3.Smart City
+
+With the development of technology, intelligent management of cities has become a major trend. Intelligent management requires a strong system software to support it, built on a good information management platform. In an intelligent city management system, an intelligent decision-making system needs to make decisions based on a large amount of different information, including various topology information (such as roads, pipelines, etc.), supply and demand information (such as electricity transmission, drinking water supply, sewage discharge, etc.), environmental information (such as temperature, humidity, rainfall, etc.), and so on. To manage these complex and heterogeneous data organically and make decisions based on them, a mature system is needed. Traditional data management systems based on relational data models are not suitable for managing such complex and heterogeneous data. Using a graph model can solve this problem well. If we manage these different data using a graph database, we can achieve many complex intelligent management scenarios.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Smart Traffic|Based on road topology, road capacity, and current traffic flow, intelligent traffic signal scheduling can be performed to improve traffic efficiency.|
+|Smart Drainage|Based on drainage system information and current rainfall, the drainage system can be scheduled to reduce the occurrence of waterlogging.|
+|Pipeline Management|Organizing the production, installation, topology information, and historical status information of pipelines can help us manage the pipelines throughout their lifecycle, including fault diagnosis, life assessment, etc.|
+|Crowd Evacuation|When a large number of people need to be evacuated, multiple transportation modes such as buses, subways, taxis, shared bicycles, etc., need to be considered, as well as the road carrying capacity. Using a graph database to organically integrate this information can help us make better decisions and provide better support for large public events.|
+
+## 4.Social Governance
+
+Social governance involves public safety, legal affairs, public opinion, network security, and more. Social governance is a comprehensive, multi-system linkage problem. It requires the synthesis of a large amount of data and global considerations to make better decisions. In this multidimensional and complex data problem, the graph data model can provide better adaptability and provide a solid foundation for intelligent social governance decision-making platforms.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Criminal Gang|Conspiratorial gangs will inevitably make contact through some means, including face-to-face meetings (appearing in the same place), phone calls, or internet contacts, and they may also have economic exchanges. If we store all of this data in a unified graph, we can use graph analysis algorithms to identify closely connected groups and then discover and identify the entire criminal gang.|
+|Stakeholder Case Investigation|Stakeholder cases, especially stakeholder economic cases, often involve a large number of personnel and elements (money, location, events, etc.). How to effectively organize this information to provide evidence for handling cases is a difficulty in stakeholder case investigation. Using graph databases to store and analyze this information can help us quickly locate the data, analyze the personnel structure, and provide better technical support for case investigation.|
+|Illegal Website Identification|Illegal websites, phishing websites, yellow websites, and so on, often use different domain names and IPs to avoid being blocked. The filter method based on a blacklist can only block known illegal websites and cannot effectively identify new domain names and IPs. Based on the IP-domain name network mapping relationship, we can create a graph and then use graph calculations to establish a "trustworthiness" model for domain names and IPs to determine whether a website belongs to an illegal website.|
+|Court File Management|Case files are often complex, and different cases may be linked through parties, locations, case nature, judges, and so on. These links constitute a complex network. Using a graph database, we can more conveniently manage these complex relationships and improve case handling and query efficiency.|
+
+## 5.Internet
+
+Social networks and person-product purchase relationships can all form a network. By analyzing this network data, we can provide users with better services, including relevant recommendations, user information collection, important user identification, and spam user identification, and so on.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|ID-Mapping|Graph databases can store all user-related information, including the relationships between users, in one database, and can also use these relationships to identify situations where one person has multiple accounts or multiple people share an account, thus providing decision support for future risk control, recommendations, and other businesses.|
+|Friend Recommendation|Based on the analysis of social networks, we can provide friend recommendations such as "friends of friends" and "common friends".|
+|Product Recommendation|Based on the user-product relationship graph, we can find users with similar interests and recommend other products that similar users have chosen.|
+|Spam User Identification|Traditional spam user identification is mainly based on user account information, such as registration information and posting information, but these types of information are relatively easy to forge. On the other hand, network-based information doesn't have this problem: it's difficult to forge. Therefore, spam user identification based on network information can be more accurate and efficient.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/8.glossary.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/8.glossary.md
new file mode 100644
index 0000000000..6f2aa1629a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/8.glossary.md
@@ -0,0 +1,27 @@
+# Glossary
+
+## 1.Graph Technology
+
+> __Graph Computing__:Generalized graph computing, including graph databases, graph analysis, and graph learning; Narrowly defined graph computing only includes graph analysis. The generalized definition is used by default.
+
+> __Graph Database__:Focuses on operations such as adding, deleting, modifying, querying, and transaction processing for graph data, such as TuGraph DB.
+
+> __Graph Analysis__:Focuses on algorithmic analysis and pattern analysis of entire graph data, such as TuGraph Analytics.
+
+> __Graph Learning__:Refers to the same meaning as graph neural networks and graph machine learning, such as TuGraph Learn.
+
+> __Graph Intelligence__:Same as generalized graph computing, including graph databases, graph analysis, and graph learning. It is usually used for conceptual promotion and not for products.
+
+## 2.Specific Concepts
+
+> __Vertex__:Also known as node or point. Avoid using the term "node" as it is often used to refer to the number of servers and can be easily confused. "Node" refers to the meaning of combination, intersection, and crossing; "node" can refer to a milestone on a timeline (key node) or a processing entity in a computer system (such as a server in a computer network).
+
+> __Edge__:Refers to the connection between two vertices.
+
+> __Degree__:Refers to the number of incoming or outgoing edges on a vertex. Note that in non-graph theory scenarios, "hops" are often referred to as "degrees".
+
+> __Hop__:Refers to the number of vertices between two vertices on a path (excluding the starting point and including the endpoint). "K-Hop" in the algorithm performance test refers to this meaning.
+
+> __Vertex Label__:Refers to the type of a vertex, also known as a point label.
+
+> __Edge Label__:Refers to the type of an edge, also known as an edge label.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/index.rst
new file mode 100644
index 0000000000..a42b1d7c5a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/2.introduction/index.rst
@@ -0,0 +1,16 @@
+TuGraph DB Introduction
+=================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.characteristics/index.rst
+   5.architecture
+   6.functionality
+   7.scenarios
+   8.glossary
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..c16fb29f5a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/1.preparation.md
@@ -0,0 +1,84 @@
+# Quick Start
+
+> This document is intended for new users to get started quickly and contains an introduction, features, installation, and use of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property Graph Model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+### 1.1.Supported Platforms
+
+TuGraph supports both X86_64 and ARM64 architectures in physical, virtual, and containerized environments.
+
+### 1.2.Hardware requirements
+
+_You are advised to use NVMe SSDS with large memory configurations for optimal performance。_
+
+| Hardware | Minimum Configuration | Recommended configuration |
+|----------|-----------------------|---------------------------|
+| CPU      | X86_64                | Xeon E5 2670 v4           |
+| Memory   | 4GB                   | 256GB                     |
+| Disk     | 100GB                 | 1TB NVMe SSD              |
+| System   | Linux 2.6             | Ubuntu 18.04, CentOS 7.3  |
+
+## 2.Installation
+
+TuGraph can be installed quickly via Docker Image or locally via RPM /deb packages.In addition, TuGraph offers community edition services on Alibaba Cloud Computing Nest, which means you don't need to purchase your own cloud host to quickly deploy TuGraph services and achieve operational monitoring, thus building your own graph application.
+
+> Installation package/image download: [Download address](../1.guide.md#TuGraph-Latest-Version).
+
+> Computing Nest Deployment: You can search for it on Alibaba Cloud Computing Nest, or you can quickly access it through [deployment link] (../5.developer-manual/1.installation/5.cloud-deployment.md).
+
+### 2.1.Fast experience through Docker
+
+1. The Docker environment installed locally
+
+   The docker official documentation：https://docs.docker.com/get-started/
+
+2. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. Start docker
+
+   ```shell
+   docker run -d -p 7070:7070 -p 9090:9090 --name tugraph_demo tugraph/tugraph-runtime-centos7 lgraph_server
+   # 7070 is default http port，for web visiting。
+   # 9090 is default RPC port，for RPC client visiting。
+   ```
+
+4. Open by browser
+
+   `http://x.x.x.x:7070`
+
+   > Default account `admin`,Default password `73@TuGraph`
+
+5. Start
+   ```shell
+   docker run -dt -p 7070:7070 --name tugraph_demo tugraph/tugraph-runtime-centos7
+   docker exec -it tugraph_demo bash
+   # start the service
+   lgraph_server -d start
+   ```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..2ec92747d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# DEMO:Movie
+
+> This document mainly introduces the usage of the movie demo.
+
+## 1.Modeling and Data Import
+
+After logging in, click "Help", click "Quick Start", click "One-Click Model Creation", click "One-Click Data Creation", and complete the creation of the Movie Scene Graph.
+
+Movie：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| Label       | Type   | Description                                                                                           |
+|-------------|--------|-------------------------------------------------------------------------------------------------------|
+| movie       | Vertex | Represents a specific movie, such as "Forrest Gump".                                                  |
+| person      | Vertex | Represents a person, who may be an actor, director, or screenwriter for a movie.                      |
+| genre       | Vertex | Represents the genre of a movie, such as drama, horror.                                               |
+| keyword     | Vertex | Represents some keywords related to the movie, such as "save the world", "virtual reality", "subway". |
+| user        | Vertex | Represents a user who watches movies.                                                                 |
+| produce     | Edge   | Represents the relationship between the producer of a movie.                                          |
+| acted_in    | Edge   | Represents the relationship between actors and the movies they have appeared in.                      |
+| direct      | Edge   | Represents the relationship between a movie and its director.                                         |
+| write       | Edge   | Represents the screenwriting relationship of a movie.                                                 |
+| has_genre   | Edge   | Represents the genre classification of a movie.                                                       |
+| has_keyword | Edge   | Represents some keywords of a movie, which are more specific labels for classification.               |
+| rate        | Edge   | Represents the rating given by a user to a movie.                                                     |
+
+## 2.Query Examples
+
+### 2.1.Example One
+
+Query all actors of the movie 'Forrest Gump' and return the subgraph composed of the movie and the actors.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.Example Two
+
+Query all actors of the movie 'Forrest Gump' and list the roles they played in the movie.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.Example Three
+
+Query all movies rated below 3 by Michael.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.Example Four
+
+Query users who have the same dislike of movies as Michael, where the standard for dislike is a rating of less than three.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.Example Five
+
+Recommend movies to Michael by first finding users who dislike the same movies as Michael, and then filtering out the movies that these users like.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.Example Six
+
+Query the movies that Michael's friends like.
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.Example Seven
+
+By querying the movies that people who gave 'Forrest Gump' a high rating also like, recommend similar movies to users who like 'Forrest Gump'.
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..e07192fa2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,48 @@
+# DEMO:Wandering Earth
+
+> This document mainly introduces the usage of the Wandering Earth demo.
+
+## 1.Demo Scene Design
+
+The demo is based on the story background of The Wandering Earth 1 and The Wandering Earth 2.
+
+- Based on the plot, a graph structure is designed, including three types of points: organization, character, celestial body, and facility, and two types of edges: event and relationship.
+- Prepared data corresponding to the schema based on the plot.
+- Prepared some queries to ask questions about the plot.
+
+## 2.Directory structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to queries.
+- control.sh: Script to control the start and stop of TuGraph Server.
+lgraph_standalone.json: Configuration file for starting TuGraph Server.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 4.Data Import
+
+- Modify DATA_PATH in import.json according to the data storage directory.
+- Refer to the load function in control.sh to load data.
+- Refer to the start function in control.sh to start TuGraph Server.
+- After starting TuGraph Server, access ${HOST_IP}:8888 to open the web page and confirm whether the data is successfully imported.
+
+## 5.Cypher Query
+
+Refer to the Cypher document and enter Cypher in the TuGraph web page frontend for queries.
+
+## 6.Usage Display
+
+### 6.1.Data Import Display
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.Query Display
+Query all event processes related to the crisis on Jupiter.
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+Query all event processes related to all crises.
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..64ea337fa8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# The Three Body
+
+> This document mainly introduces the usage of Three-Body demo.
+
+## 1.Demo Scenario Design
+The demo scenario is designed based on the story background of Three-Body 1, 2, and 3.
+
+According to the setting of the Three-Body story, we have designed 4 types of nodes and 6 types of edges. The nodes include "character", "organization", "plan", and "timeline", while the edges include "character-character relationship", "character-plan relationship", "character-organization relationship", "organization-plan relationship", and "organization-organization relationship". According to the plot, corresponding schema data and some queries have been prepared to propose some questions about the plot.
+
+## 2.Directory Structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to the query.
+- control.sh: Script to start and stop TuGraph Server.
+- lgraph_standalone.json: Configuration file for TuGraph Server startup.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+### 4.Data Import
+
+- Manual import
+    - Modify DATA_PATH in import.json according to the data storage directory.
+    - Refer to the load function in control.sh to load the data.
+    - Refer to the start function in control.sh to start the TuGraph service.
+    - After starting the TuGraph service, access ${HOST_IP}:8888 to open the web page and confirm whether the data is imported successfully.
+- Automatic creation
+    - Click `New Graph Project`, select Three-Body data, fill in the graph project configuration, and the system will automatically create the Three-Body scenario graph project.
+    - Alternatively, use the pre-installed Three-Body graph project provided by the product.
+
+### 5.Cypher Query
+
+Refer to the TuGraph documentation and enter Cypher in the TuGraph web page frontend to execute a query.
+
+## 6.Usage Demo
+
+### 6.1.Data Import Demo
+
+![data](../../../../images/three-body-data.png)
+
+### 7.Query Demo
+
+#### 7.1.Character Relationship Query
+In the plot of Three-Body 1, a large number of scientists committed suicide all over the world at the beginning, which aroused the attention of the police. During the investigation process, the truth behind it gradually surfaced step by step according to the clues of the character relationships, as shown in the above graph. Shi Qiang and Wang Miao discovered that most people had direct or indirect connections with Ye Wenjie, and sent Wang Miao undercover to finally discover Ye Wenjie's ultimate commander identity. As can be seen in the graph, there are many edge relationships (many one-degree or two-degree neighbors) around Ye Wenjie's vertex.
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.Neighbor Vertex Analysis
+There are many plans in Three-Body, and sometimes we may be confused. At this time, we can use the graph's neighbor vertex query to view the relevant characters and organizations of the plan. For example, in the "Wallfacer Project", we can see that there are four characters related to it, and these four are also the "Wallfacers" who are highly expected by the world.
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.Query Common Neighbors of Node A and B
+We often want to know who are the common related characters between two characters, so that we can quickly grasp the relationship between these two characters. In the case of large amounts of data, it is very convenient to use Cypher for graph relationship analysis!
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.Set/Change Properties
+As the plot progresses, we gradually learn about the various labels on "Ye Wenjie", so we can also update these labels to the "Ye Wenjie" node:
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.Add/Delete Nodes
+Later, we learned about characters such as Luo Ji and Cheng Xin, and organizations such as PIA and the Star Ring Group, and wanted to add them as nodes to the graph:
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..0bb359cbe0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# Three Kingdoms
+
+> This document mainly introduces the usage of the Three Kingdoms demo.
+
+## 1. Introduction
+Due to the lack of historical records, there are often many mysteries surrounding even well-known historical events. Taking the history of the Three Kingdoms as an example, why did Zhuge Liang come out of seclusion to help Liu Bei, and why there was a huge gap in achievements between Cao Cao and Liu Bei, both heroes of the time, are some of the unsolved mysteries. Historians in the past often used two-dimensional relationship analysis of history, and the conclusions drawn were often one-sided. Using TuGraph to import historical figures and events of the Three Kingdoms into a graph model, and analyzing them using graph calculation methods can help us obtain more valuable knowledge from limited information, which is a very meaningful interdisciplinary attempt.
+## 2. Data Modeling
+We designed 5 types of vertices and 5 types of edges. The vertices include "Lord", "Province", "Civilian", "Military Officer", and "Battle"; the edges include "Father", "Brother", "Belongs To", "Native Place", and "Participate In". The specific modeling information is shown below:
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. Data Import
+- Manual import
+    - To import data into TuGraph, you can use the lgraph_import tool to import it offline. The import command of lgraph_import is as follows:
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- Automatic creation
+    - Click `New Graph Project`, select the Three Kingdoms data, fill in the graph project configuration, and the system will automatically create the Three Kingdoms scene graph project.
+    - Or use the built-in Three Kingdoms graph project provided by the product directly.
+## 4. Cypher Query
+### 4.1. Why did Zhuge Liang Choose Liu Bei?
+The following Cypher command can be used to view the relationship between Zhuge Liang, Cao Cao, and Liu Bei:
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+From the graph, we can intuitively see that one of the shortest paths between Cao Cao and Zhuge Liang includes the battle of Xuzhou. Cao Cao once committed a massacre in Xuzhou because his father was killed, and nobody would choose a warlord who had previously massacred their hometown as their lord. In contrast, Liu Bei once prevented Cao Cao's violence during the battle of Xuzhou, which should be one of the reasons why Zhuge Liang had a good impression of Liu Bei.
+
+### 4.2. Why Did Cao Cao Achieve More Than Liu Bei?
+The following Cypher command can be used to view the family's support for Cao Cao's career:
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+The most important thing for pacifying the world is military talent. Cao Cao's father originally had the surname Xiahou, but was adopted into the Cao family. The Cao and Xiahou families were both local big clans in Qiao County, providing Cao Cao with a large number of military talents such as Xiahou Dun, Xiahou Yuan, Cao Ren, and Cao Hong in the early days of his career. In contrast, Liu Bei's father died early and he didn't have any family support. He only gathered his Five Tiger Generals when he was over 50 years old, by which time the best time to fight for land in the chaotic world had passed. Cao Cao had already controlled six of the nine provinces in the world.
+
+### 4.3. Why Did the Most Powerful Wei Kingdom in the Three Kingdoms Perish First?
+The following Cypher command can be used to view the important civilian officials of the Cao Cao group:
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+In fact, Cao Wei was overthrown in the Gao Ping Ling incident in 249 AD, after only 29 years of existence, which was shorter than Shu Han (43 years) and Dong Wu (51 years). The reason why the most powerful Wei Kingdom in the Three Kingdoms perished first was that the civilian official system of Cao Wei (the nine-rank system) made it easy for power to be concentrated in the hands of aristocratic families. From the graph, we can see that almost all the important civilian officials of Cao Cao and Cao Pi's generations were from aristocratic families, such as Xun Clan of Yingchuan, Zhong Clan of Yingchuan, Chen Clan of Yingchuan, Jia Clan of Wuxi, etc. There was even a trend of regionalization, centered on Yingchuan. Ultimately, the regime was usurped by the Sima family of Henei, which had close ties with the Xun Clan of Yingchuan.
+
+### 4.4. What Were the Strengths of Each of the Three Kingdoms?
+The following Cypher command can be used to view the population strength of each group in the Three Kingdoms:
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+The query result is shown in the following table:
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+In ancient society, an important indicator of a country's strength was its population. Since population data is missing, we estimate the population of each province using the birthplace data of all lords, civilians, and military officers in the Three Kingdoms. It is found that among the main characters of the Three Kingdoms, 60 belong to Wei, 23 belong to Wu, and only 2 belong to Shu, which proves that Wei was indeed the most powerful country in the Three Kingdoms.
+
+### 4.5. How Should Cao Cao's Military Ability Be Evaluated?
+The following Cypher command can be used to view the main battles that Cao Cao participated in:
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+From the graph, we can see that Cao Cao participated in 8 out of the 15 major battles in the Three Kingdoms, with a high participation rate. However, Cao Cao only won the battles of Xuzhou, Yanzhou, Guandu, and Xiangyang, while losing the battles of Hanzhong, Wancheng, the Campaign against Dong Zhuo and the Battle of Red Cliffs. His overall win rate was 50%, which proves that Cao Cao was not a very outstanding military strategist.
+
+## 5. Remarks
+More analysis is needed and encouraged to be added by everyone!
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..106f943e05
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo example
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..b2ed78a618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+TuGraph DB Quick Start
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..c13f4e8b26
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,659 @@
+# TuGraph Browser
+
+> This document focuses on the use of TuGraph Browser.
+
+## 1.Introduction
+
+TuGraph Browser (hereinafter referred to as Browser) is a powerful product visualization development tool that presents graph data in an intuitive visual way, allowing users to easily manage, maintain, and view the database running status. This tool not only supports graph data management and visualization but also supports system account management, providing users with a comprehensive operation and management experience, enabling users to manage and utilize graph databases more efficiently.
+
+## 2.User Guide
+
+### 2.1.Accessing
+
+After the user completes the installation of the graph database, they can access the Browser through a browser. Users only need to enter the IP:Port of the server where TuGraph is located in the browser address bar. The default port used is 8888.
+
+- For example:127.0.0.1:8888
+- Recommend using Chrome
+
+### 2.2.Logging in
+
+![login](../../../images/browser/login.png)
+
+- After successfully accessing the Browser, the login page appears first (as shown above), where users need to fill in their account and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change their initial password promptly after logging in.
+
+### 2.3.Quick Start
+
+For first-time users of TuGraph, you can quickly build a graph project with the built-in demo data and get started with graph data projects quickly.
+
+#### 2.3.1.Creating a Graph Project
+
+In the `Graph Project` homepage tab, click `Create New Graph Project` to create a new graph project.
+
+![quickstart-creategraph](../../../images/browser/quickstart-creategraph.png)
+
+Select a built-in demo data, and click the `Next` button.
+
+![quickstart-selectdemo](../../../images/browser/quickstart-selectdemo.png)
+
+In the Fill in Configurations interface, enter the graph project information. Since the demo data is relatively small in size, set the Maximum Storage Space to 1 GB. After entering the graph project information, click the Create button, and the system will automatically create the graph model of the demo data and import the graph data.
+
+![quickstart-configure](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.Starting a Graph Project
+
+After creating a graph project with demo data, you can find the corresponding graph project in the `Graph Project` tab, and then click `Graph Query` to query graph data.
+
+![quickstart-graphtab](../../../images/browser/quickstart-graphtab.png)
+
+Execute the default query statement to browse the graph data in the demo.
+
+![quickstart-result](../../../images/browser/quickstart-result.png)
+
+For more quick start documents, please visit the[Quick Start Documents](../3.quick-start/1.preparation.md)
+
+### 2.4.Graph Project
+
+`Graph Project` provides visualized graph project management and graph data development functions, providing users with a series of convenient graph data visualization operations, including graph project creation, modification, deletion, and other management operations, as well as graph data queries, vertex-edge statistics, and other operations. In addition, it also supports graph model management, making it more convenient for users to manage and maintain graph data.
+
+#### 2.4.1.Graph Project Management
+
+On the `Graph Project` page, you can see the graph projects in the current graph database.
+
+![graphmanagement-homepage](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.Creating a Graph Project
+
+On the `Graph Project` page, click the `Create New Graph Project` button to create a new graph project.
+
+![graphmanagement-creategraph](../../../images/browser/graphmanagement-creategraph.png)
+
+Creating a new graph project requires completing the creation of the graph project through two pages: `Select Template` and `Fill in Configurations`.
+
+- __Select Template__: The product provides two types of templates: empty templates and demo templates.
+    - Empty templates: A brand new graph project where users need to create their own graph model and import graph data, generally used for formal project development.
+    - Demo templates: Built-in demo data in the product. After the graph project is created successfully, the system will automatically create a demo graph model and import demo graph data, usually used for trial and learning.
+
+![graphmanagement-selecttemplate](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __Fill in Configurations__: Users need to fill in basic information about the graph project and click the `Create` button to create the graph project.
+    - Graph Name: The name of the new graph project, which is also the unique primary key of the graph project. Supports Chinese characters, letters, numbers, and underscores, but does not support spaces or other special characters.
+    - Graph Description: The description of the new graph project can be used to describe the background and objectives of the project in detail.
+    - Advanced Configuration - Maximum Storage Space: Set the maximum storage space that the graph project can occupy. It does not actually occupy physical storage space in advance. After the actual data volume reaches the maximum storage space threshold, no more data can be written.
+
+![graphmanagement-configure](../../../images/browser/graphmanagement-configure.png)
+
+After creation, the graph project can be viewed in the graph project tab on the `Graph Project` page.
+
+##### 2.4.1.2.Editing a Graph Project
+
+On the `Graph Project` page, click the `Edit button` (pencil icon) in the graph project tab to edit the basic information of the corresponding graph project.
+
+![graphmanagement-editgraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+graphmanagement-editgraph-button
+
+![graphmanagement-editgraph](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.Deleting a Graph Project
+
+On the `Graph Project` page, click the `Delete` button (trash can icon) in the graph project tab to delete the corresponding graph project.
+
+![graphmanagement-deletegraph-button](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_Note: Graph projects cannot be restored after deletion._
+
+##### 2.4.1.4.Vertex-Edge Statistics
+
+On the `Graph Project` page, click the `Vertex-Edge Statistics` button (line graph icon or refresh icon) in the graph project tab to count the number of vertexs and edges in the corresponding graph project.
+
+![graphmanagement-statistics-button](../../../images/browser/graphmanagement-statistics-button.png)
+
+The statistical results will be displayed on the graph project tab. Graph projects that have not been vertex-edge statistics will display `No vertex-edge data`, and graph projects that have already been vertex-edge statistics need to click the `Refresh` button to count again.
+
+![graphmanagement-statistics](../../../images/browser/graphmanagement-statistics.png)
+
+![graphmanagement-statistics-refresh-button](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.Graph Building
+
+The `Graph Building` function in Browser is mainly used for graph project model definition and data import. On the `Graph Project` page, click the `Graph Building` button in the graph project tab.
+
+![graphbuild-button](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.Model Definition
+
+Browser provides a visualization way to create and maintain graph models.
+
+- Graph models can also be created and maintained through the `Cypher` tool and the `lgraph_import` tool. For details, please refer to the [Cypher API Document](../5.developer-manual/6.interface/1.query/1.cypher.md) and [Data Import Document](../5.developer-manual/3.server-tools/1.data-import.md).
+
+###### a.Browse Graph Models
+
+On the `Model Definition` page, you can view detailed graph model settings, support list and canvas view of the graph model, support list display of vertex type properties and indexes, edge type properties and start/end vertex types.
+
+![graphbuild](../../../images/browser/graphbuild.png)
+
+- Supports list view of vertex types and edge types.
+    - Supports the display of the number of vertexs or edges in the corresponding vertex type or edge type in the vertex type or edge type tab.
+    - Supports keyword search for vertex type or edge type names. Enter the keyword in the `search box` to display the corresponding vertexs or edges.
+
+        ![graphbuild-list-search](../../../images/browser/graphbuild-list-search.png)
+    - Supports copying vertex type or edge type names. Click the `Copy` button to copy the name of the vertex or edge to the clipboard.
+
+        ![graphbuild-list-copy](../../../images/browser/graphbuild-list-copy.png)
+    - Supports deleting vertex types or edge types. Click the `Delete` button to delete the corresponding vertex or edge.
+
+        ![graphbuild-list-delete](../../../images/browser/graphbuild-list-delete.png)
+- Supports canvas view of vertex types and edge types.
+- Clicking the corresponding vertex type or edge type in the list or canvas can display the model details.
+        ![graphbuild-select](../../../images/browser/graphbuild-select.png)
+
+###### b.Add Vertex
+
+Click the `Add Vertex` button on the `Model Definition` page to add a vertex type in the right sliding window.
+
+![graphbuild-addvertex-button](../../../images/browser/graphbuild-addvertex-button.png)
+
+The user needs to enter the Vertex type name, properties, and indexes, and click the `Complete` button to complete the creation of the Vertex type.
+- Vertex Type Name: The name of the Vertex, which is also the unique identifier of the Vertex.
+- Properties: The attributes of the Vertex, and one attribute needs to be used as the primary key.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating Vertexs.
+- Indexes: The indexing attributes of the Vertex, you need to create attributes first and then set the attribute as an index.
+    - Attribute: The attribute that needs to be indexed.
+    - Unique:Set the attribute field as a unique value.
+    - Primary Key: Whether the corresponding attribute is a primary key. The Unique option must be `Yes` after selecting `Yes`.
+    - Delete: Indexes can be deleted arbitrarily during Vertex creation.
+
+![graphbuild-addvertex](../../../images/browser/graphbuild-addvertex.png)
+
+- Edit Vertex: You can add Vertex properties, modify the data type of existing properties, and add or delete indexes. You need to click the `Save` button for each newly added or modified attribute to take effect.
+_Note: Once the primary key field attribute is created, it cannot be modified._
+
+![graphbuild-editvertex](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.Add Edges
+
+Click the `Add Edge` button on the `Model Definition` page to add an edge type in the right sliding window.
+
+![graphbuild-addedge-button](../../../images/browser/graphbuild-addedge-button.png)
+
+The user needs to enter the edge type name, properties, select the start vertex type and end vertex type, and click the `Complete` button to complete the creation of the edge type.
+- Edge Type Name: The name of the edge, which is also the unique identifier of the edge.
+- Properties: The attributes of the edge, which may not exist on the edge.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating edges.
+- Selecting start vertex type and end vertex type: Set the start vertex type and end vertex type of the edge, and support multiple start vertex types and end vertex types.
+    - Start vertex: Select the vertex type of the start vertex.
+    - End vertex: Select the vertex type of the end vertex.
+    - At least one vertex type needs to be created in advance to set the start vertex type and end vertex of the edge.
+    - If not selected, it means that the start vertex and end vertex can be any vertex type, and the corresponding edge is not displayed on the canvas, and you need to view the edge type in the left list.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+- Edit Edge: You can add edge properties and modify the data type of existing properties. You need to click the `Save` button for each newly added or modified attribute to take effect.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+###### d.Import Model
+
+Click the `Import Model` button on the `Model Definition` page to upload a model file and quickly create a model.
+
+![graphbuild-importmodel-button](../../../images/browser/graphbuild-importmodel-button.png)
+
+Click the `Upload File` button on the `Import Model` page to upload the model file. After the upload is successful, click `OK` to import the graph model.
+
+- Overwrite the current canvas model: If this option is selected, the existing graph model will be cleared before importing the graph model in the model file; if not selected, the vertex types and edge types in the model file will be imported, but the existing vertex types and edge types will not be modified.
+
+![graphbuild-importmodel](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.Export Model
+
+Click the `Export Model` button on the `Model Definition` page to export the graph model in the current graph project to a JSON file.
+
+![graphbuild-exportmodel-button](../../../images/browser/graphbuild-exportmodel-button.png)
+
+The model file is in JSON format and is not recommended to be manually modified.
+
+![graphbuild-exportmodel](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.Data Import
+
+After completing the `Model Definition`, click the `Next` button to enter the data import page.
+
+###### a.Data Preparation
+
+Data needs to be prepared in advance before importing data. The current browser supports the uploading of CSV files, and the data file suffix needs to be ensured to be CSV.
+- The header is not mandatory.
+- Text qualifiers are supported, and the text qualifier is double quotes. Data Import - CSV
+
+![graphbuild-import-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.Upload Files
+
+Upload the required data files on the `Data Import` page and import the data into the graph project.
+
+![graphbuild-import](../../../images/browser/graphbuild-import.png)
+
+- Separator: The column separator of the data file.
+- File upload: Supports uploading multiple files.
+    - Supports selecting multiple upload files in the pop-up window.
+    - Supports dragging and dropping files to upload on the page.
+    - Supports uploading vertex files and edge files at the same time.
+
+###### c.Data Mapping
+
+After the file is successfully uploaded, you need to set the `Data Corresponding Table` on the `Data Import` page to establish a mapping relationship between the data columns in the data file and the target vertexs/edges and corresponding attributes.
+
+- Data Corresponding Table: Displays uploaded data problems.
+    - File Name: The name of the uploaded data file.
+    - File Size: The size of the uploaded data file.
+    - Read Result: The result of uploading the data file, success means uploaded successfully.
+    - Delete: Delete on the page, the local file will not be deleted.
+- Data File Mapping: Each uploaded data file needs to configure a mapping relationship.
+    - Label: Select the corresponding vertex or edge type for the file, and you can only select one type of vertex or one type of edge.
+    - Starting from the Nth row: Start reading data from the Nth row. The system defaults to start reading data from the 0th row. To skip the header, you can enter 1.
+    - Attribute Mapping: Select the attribute field corresponding to the data column from the drop-down list.
+    - Data Preview: The system will pre-read the first 5 rows of the data file.
+
+![graphbuild-import-datamapping](../../../images/browser/graphbuild-import-datamapping.png)
+
+After the file is successfully uploaded, you can click the `Continue Import` button to continue importing other data or click the `Go to Graph Query` button to query the imported data on the `Graph Query` page.
+
+![graphbuild-import-success](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.Graph Query
+
+Click the `Graph Query` button in the `graph project tab` on the `Graph Project` page to query and access graph data in the graph project. The product provides multiple modes for querying graph data, such as Statement Query, Path Query, and Vertex Query, and supports switching between graph projects and query result display.
+
+![query-button](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.Switch Graph Project
+
+The `Graph Query` function can only access one graph project data. Users can select and switch to other graph data in the `Switch Graph Project drop-down list`.
+
+![query-selectgraph](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.Statement Query
+
+The Browser provides a visual way to develop and debug graph query statements. Users can enter graph query statements, execute and return results, and support collecting statements and viewing graph models.
+
+![query-view](../../../images/browser/query-view.png)
+
+###### a.Statement Query Window
+
+Users enter graph query statements in the `Statement Query Window`, click the `Execute` button to run the corresponding statement, and display the result in the `Execution Result tab`.
+
+- Switch Query Language: Provides switching between different graph query language modes.
+    - _Currently only supports Cypher syntax._
+
+![query-selectgql](../../../images/browser/query-selectgql.png)
+
+- Statement Query Window: Provides syntax prompts for the current query language.
+
+![query-gqltips](../../../images/browser/query-gqltips.png)
+
+- Execute: Click the `Execute` button to send the entered query statement to the background for execution.
+
+![query-execute-button](../../../images/browser/query-execute-button.png)
+
+- Bookmark: Click the `Bookmark` button to save the content of the current statement query window as a template for future use.
+
+![query-bookmark-button](../../../images/browser/query-bookmark-button.png)
+
+- Download: Click the `Download` button to save the content of the current statement query window as a text file and download it to the local computer for future use.
+
+![query-download-button](../../../images/browser/query-download-button.png)
+
+For detailed Cypher usage guidelines, please refer to the document: [Cypher API](../5.developer-manual/6.interface/1.query/1.cypher.md)
+
+###### b.Bookmark List
+
+Displays the collected query statements in a list, and clicking on a bookmark in the list allows using the statement. Supports keyword search, name modification, and deletion.
+
+![query-bookmark](../../../images/browser/query-bookmark.png)
+
+###### c.View Graph Model
+
+The Browser provides a graph model query for the current graph project, which allows users to query vertex types and edge types conveniently. It supports both list display and canvas graph display, and can be hidden.
+
+![query-schema-list](../../../images/browser/query-schema-list.png)
+![query-schema-graph](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.Path Query
+
+The Browser provides `Path Query templates`. Users can search whether corresponding paths exist in the graph data of the graph project by selecting paths.
+
+![pathquery-result](../../../images/browser/pathquery-result.png)
+
+- Path: Select the path to search in the path selection drop-down list.
+    - Select a Path: Based on the definition of the graph model, the system will automatically match the corresponding first-degree relationship path. Clicking the path drop-down box again will automatically match the next-degree relationship path based on the endvertex vertex type of the path.
+![pathquery-select](../../../images/browser/pathquery-select.png)
+    - Execute: Click the `Execute` button to return the matched paths in the graph project.
+    - Advanced Configuration: Set the number of paths to scan. The default is 100 paths.
+![pathquery-configuration](../../../images/browser/pathquery-configuration.png)
+
+_Note: The edges in the graph model need to set the starting vertex and endvertex. If no edge in the graph project has set the starting vertex and endvertex, the drop-down list will have no results._
+
+##### 2.4.3.4.Vertex Query
+
+The Browser provides `Vertex Query templates`. Users can query vertex data in the graph project by selecting vertex attributes.
+
+![vertexquery](../../../images/browser/vertexquery.png)
+
+- Select Vertex: Select the vertex type to be queried.
+    - Attribute: The system will automatically match the schema of the vertex type, set the corresponding query conditions, and click the execute button to return the results.
+- Return vertex Limit: Set the upper limit of the returned vertex data.
+
+![vertexquery-criteria](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.Execution Result Tab
+
+The Browser provides multiple ways to display graph query results, such as JSON view, JSON text, vertex-edge list, and vertex-edge view. It supports result download, data insertion, and full-screen display.
+
+###### a.JSON View
+
+The Browser provides JSON view to display query results.
+
+![query-result-jsonview](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON Text
+
+![query-result-jsontxt](../../../images/browser/query-result-jsontxt.png)
+
+###### c.Vertex-Edge List
+
+The Browser provides vertex and edge list to display query results.
+
+![query-result-list](../../../images/browser/query-result-list.png)
+
+###### d.Vertex-Edge View
+
+The Browser provides canvas view to display query results.
+
+![query-result-graph](../../../images/browser/query-result-graph.png)
+
+###### e.Data Insertion
+
+The Browser provides a visual way to insert vertex or edge data in the corresponding graph project. Click the `Insert Data` button, select the Vertex Type or Edge Type on the Insert Data tab, enter the attribute values, and click `OK` to complete the data insertion.
+
+![query-result-insert-button](../../../images/browser/query-result-insert-button.png)
+
+![query-result-insert](../../../images/browser/query-result-insert.png)
+
+###### f.Download Execution Result
+
+The Browser provides a function to export graph query results as text files. Click the `Download Execution Result` button, and the system will automatically save the result as a text file and download it to the local computer.
+
+![query-result-download](../../../images/browser/query-result-download.png)
+![query-result-downloadtxt](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.Full-Screen Display
+
+The Browser provides full-screen display for graph query results. Click the `Full-Screen` Display button to display the results in full screen, and click the `Exit Full Screen` button to exit full-screen display.
+
+![query-result-fullscreen-button](../../../images/browser/query-result-fullscreen-button.png)
+![query-result-fullscreen](../../../images/browser/query-result-fullscreen.png)
+![query-result-fullscreen-close](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.Graph Analysis
+
+Click the `Graph Analysis` button in the `Graph Project` tab in the `Graph Project` interface to display and analyze graph data on the canvas. The product provides `Query by Statement` and `Query by Configuration` to query and load data from the graph project to the canvas. It supports filtering, layout adjustment, and canvas operations on the canvas data.
+
+![graphanalysis-button](../../../images/browser/graphanalysis-button.png)
+
+As shown in the figure below, the graph analysis function mainly includes: 1. Operation bar: the main operation functions of graph analysis, including view switching, query filtering, layout style, and canvas operations; 2. Left sidebar: query, filter, and appearance operation area; 3. Canvas area: the area for displaying graph data, displaying vertex and edge data, supporting vertex expansion query, collapsing vertexs, fixing vertexs, deleting vertexs, and providing canvas graph data statistics; 4. Right sidebar: when a vertex or edge data is selected, the corresponding attribute information will be displayed; 5. Switch graph project: switch to different graph projects for analysis.
+
+![graphanalysis-operation-area](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.Query by Statement
+
+In the `Query by Statement` function, users can enter query statements to query graph data and load the data to the canvas area for display.
+- Syntax Description: TuGraph's query language and syntax documentation.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-query](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.Query by Configuration
+
+In the `Query by Configuration` function, users can select vertex types and enter attribute conditions to query graph data and load the data to the canvas area for display.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-configurequery](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.Canvas Analysis
+
+In the `Canvas Analysis` function, users can perform operations and analysis on the vertex or edge data on the canvas, including: expanding queries by selecting vertexs, collapsing/expanding vertexs, fixing vertexs, clearing the canvas, lassoing, vertex/edge retrieval, and canvas legend. The most basic operation on the canvas is dragging vertex data. By selecting a vertex with the left mouse button and moving the mouse, the position of the vertex data can be changed.
+
+###### a.Expand Query
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, move the mouse to `Expand Query`, and a secondary window will pop up. Click on the corresponding expansion degree to perform the query.
+- First-degree Query: Bidirectional expansion of first-degree relationships.
+- Second-degree Query: Bidirectional expansion of second-degree relationships.
+- Third-degree Query: Bidirectional expansion of third-degree relationships.
+- Custom Query: Expand based on selected conditions.
+    - Edge Direction: Set the direction of the expansion relationship, Bidirectional: includes outgoing edges and incoming edges, Outgoing: edges pointing outward from the selected starting vertex, Incoming: edges pointing to the selected starting vertex.
+    - Degree of Diffusion: The degree of expansion.
+    - Custom Return vertex Count: Configure the number of vertexs returned to the front end, default is 100, to prevent exceptions on the front end caused by super vertexs.
+    - Add Filter Group: Set the relationship type and attribute conditions of the expansion, multiple relationship types can be set.
+
+![graphanalysis-canvas-expand-before](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![graphanalysis-canvas-expand-after](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![graphanalysis-canvas-expand-custom](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.Collapse/Expand Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Collapse Vertexs` to hide the first-degree relationship Vertexs of the selected Vertexs; right-click on the collapsed Vertex data again to perform Expand Vertexs operation to show the hidden first-degree relationship Vertexs.
+
+![graphanalysis-canvas-collapse](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![graphanalysis-canvas-expand](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.Fix Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Fix vertexs` to fix the selected vertexs in place. The fixed vertexs cannot be moved (including layout adjustment); right-click on the fixed vertex data again to perform `Unfix vertexs` operation to restore the normal operation of the selected.
+
+![graphanalysis-canvas-fixed](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![graphanalysis-canvas-unfix](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.Delete Vertex
+
+Right-click on a vertex in the `Canvas` area to open the operation window. Click on `Delete Vertex` to remove the selected vertex from the canvas.
+
+![graphanalysis-canvas-delete](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.Clear Canvas
+
+Click on the `Clear Canvas` button in the `Toolbar` area to clear all data on the canvas.
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.Vertex/Edge Retrieval
+
+Select a vertex or edge in the `Vertex/Edge Retrieval` window and enter a keyword to perform a fuzzy search for attribute data on the canvas. After the search, you can locate the data position.
+
+![graphanalysis-canvas-retrieval](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.Canvas Legend
+
+In the legend area of the `Canvas` area, the vertex types in the canvas will be displayed. Click on a vertex type to select the corresponding vertex data. Click on the "More" button to display the statistics, which can be displayed in a list or chart format to show the number of vertexs or edges.
+
+![graphanalysis-canvas-legend-list](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![graphanalysis-canvas-legend-chart](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.Attribute Filter
+
+Click on the `Filter` button in the `Toolbar` area, and click on `Attribute Filter` in the `Sidebar` to perform filter and filtering. Users can select the vertex or edge types to be filtered, and set the corresponding attribute values. After retrieving the filtered group conditions, the corresponding vertex or edge data will be highlighted on the canvas.
+- Please select the vertex/edge type: Select the vertex type or edge type to be searched.
+- Attribute condition: Set the attribute conditions to be searched. Multiple groups can be set to take the union of the filtering results.
+- Add filter group: Multiple filter conditions can be set to take the union of the filtering results.
+- Reset: Clear the filter conditions.
+
+![graphanalysis-queryfilter-attributefilter](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.Statistical Filter
+
+Click on the Filter button in the Toolbar area, and click on Statistical Filter in the Sidebar to perform statistical filtering of canvas data. Users can select the vertex or edge types to be counted, and set the corresponding attribute values. The system will automatically group and count based on the selected vertex/edge types and attributes. The results can be displayed in chart and list formats. Clicking on the values in the chart or list area will highlight the corresponding data on the canvas.
+
+![graphanalysis-queryfilter-statisticalfilter](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![graphanalysis-queryfilter-statisticalfilter-chartswitch](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.Layout Style
+
+Click on the `Layout` button in the `Toolbar` area, and select the corresponding layout method to rearrange the data on the canvas. It supports force-directed layout, concentric circle layout, circular layout, radial layout, Dagre layout, and grid layout. Each layout method has different layout parameters. After adjusting the parameters, the data on the canvas will be rearranged.
+
+![graphanalysis-style-layout-button](../../../images/browser/graphanalysis-style-layout-button.png)
+![graphanalysis-style-layout-parameters](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+For detailed layout parameters, please refer to[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide).
+
+##### 2.4.4.6.Appearance Style
+
+Click on the `Appearance` button in the `Toolbar` area, and click on `Vertex Style` or `Edge Style` in the `Sidebar` to configure the appearance style.
+- Vertex Style
+    - Apply to vertex type: Set the display style for the corresponding vertex type. Multiple vertex types can be configured simultaneously.
+    - Size: The display size for the corresponding vertex type.
+    - Color: The display color for the corresponding vertex type.
+    - Icon: The icon style for the corresponding vertex type.
+    - Display Text: The text content displayed for the corresponding vertex type, defaulting to id.
+    - Advanced Configuration: Mark the corresponding vertex data based on the set conditions.
+- Edge Style
+    - Apply to Edge Type: Set the display style for the corresponding edge type, supports configuring the appearance of multiple edge types simultaneously.
+    - Color: The display color for the corresponding edge type.
+    - Width: The display width for the corresponding edge type.
+    - Display Text: The text content displayed for the corresponding edge type, not displayed by default.
+    - Advanced Configuration: Display the corresponding edge data based on the set conditions.
+
+![graphanalysis-style-appearance](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.Console
+
+The `Console` provides a visualized account management and database information viewing function. It provides users with comprehensive account and role management functions, including adding, deleting, modifying, and disabling accounts and roles. In addition, it also provides users with convenient database information viewing function, allowing users to easily view the basic information and configuration information of the graph database. Basic information mainly includes version number, running time, CPP compilation version number, etc., while database configuration information includes port number, system function parameter configuration, etc.
+
+#### 2.5.1.Account Management
+
+##### 2.5.1.1.Account Management
+
+##### a.Add Account
+
+Click the `Add` button in the `Account Management` interface to create a new account. Users need to enter the account name, account description, account password, and related roles.
+
+- Account Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Related Roles: When creating a new account, you must select a role. After the account is added successfully, the system will automatically generate a role with the same name as the account name.
+
+![account-add-button](../../../images/browser/account-add-button.png)
+![account-add](../../../images/browser/account-add.png)
+
+##### b.Edit Account
+
+Click the `Edit` button in the `Account Management` interface to edit the account description, account password, and related roles.
+
+![account-edit](../../../images/browser/account-edit.png)
+
+##### c.Disable Account
+
+Click the `Disable` button in the `Account Management` interface to prevent the corresponding account from logging in and accessing. Click the `Enable` button to enable the corresponding account login and access permissions.
+
+![account-disable](../../../images/browser/account-disable.png)
+![account-enable](../../../images/browser/account-enable.png)
+
+##### d.Delete Account
+
+Click the `Delete` button in the `Account Management` interface to delete the corresponding account.
+
+![account-delete](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.Role Management
+
+##### a.Add Role
+
+Click the `Add` button in the `Role Management` interface to create a new role. Users need to enter the role name, role description, and graph permissions.
+
+![role-add-button](../../../images/browser/role-add-button.png)
+
+- Role Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Graph Permissions: The browser supports four types of graph permission configurations: All, Read/Write, Read-Only, and None.
+    - All: corresponds to the read and write permissions of the graph, including editing the graph model permissions (schema).
+    - Read/Write: corresponds to the write permission of the graph, but does not include the permission to edit the graph model (schema).
+    - Read-Only: corresponds to the read permission of the graph.
+    - None: cannot access or operate the corresponding graph.
+- Role Conflict: When two roles have different graph permissions for the same graph, and both roles are authorized to the same account, the graph permission of the account for the graph is the union of the graph permissions of the two roles.
+
+![role-add](../../../images/browser/role-add.png)
+
+##### b.Edit Role
+
+Click the `Edit` button in the `Role Management` interface to edit an existing role. Users can edit the role description and graph permissions.
+
+![role-edit](../../../images/browser/role-edit.png)
+
+##### c.Disable Role
+
+Click the `Disable` button in the `Role Management` interface to disable the corresponding role. Click the `Enable` button to enable the corresponding role. After the role is disabled, the corresponding graph permissions of the role become invalid.
+
+- Disabled Role: After the role is disabled, the corresponding graph permissions become invalid.
+    - When a user has two roles with operating permissions on the same graph, if one of the roles is disabled, the permission of the other role is still valid.
+
+![role-disable](../../../images/browser/role-disable.png)
+![role-enable](../../../images/browser/role-enable.png)
+
+##### d.Delete Role
+
+Click the `Delete` button in the `Role Management` interface to delete the corresponding role.
+
+![role-delete](../../../images/browser/role-delete.png)
+
+#### 2.5.2.Database Information
+
+##### 2.5.2.1.Basic Information
+
+`Basic Information` obtains the current running status of the system and displays key information.
+
+![db_basic](../../../images/browser/db_basic.png)
+
+|Parameter    |Meaning    |
+|-------|--------|
+|TuGraph Version Number|The current version number of TuGraph, x.x.x|
+|Running Time|The time from when TuGraph service starts to now|
+|Server Code Version|The current commit of the tugraph-db repository|
+|Front-end Code Version|The current commit of the tugraph-web repository|
+|CPP Compiler Version|The CPP version number when compiling TuGraph|
+|Python Version Number|The Python version number when compiling TuGraph|
+|CPP Compiler ID|The CPP type when compiling TuGraph|
+
+The current running status of the system can also be obtained through commands.
+
+```cypher
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.Database Configuration Information
+
+`Database Configuration Information` obtains the current configuration parameters of the system and displays key information. To adjust the configuration parameters or understand the detailed configuration parameters, please refer to [Database Running-Service Configuration](../5.developer-manual/2.running/2.tugraph-running.md).
+
+![db_configuration](../../../images/browser/db_configuration.png)
+
+| Parameter                   | Meaning                                                                                                                                         |
+|-----------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------|
+| bind_host                   | The host set when the system starts, usually 0.0.0.0                                                                                            |
+| disable_auth                | Whether to disable the regular update of token authentication. If set to true, the token can be used permanently                                |
+| durable                     | Whether to enable persistent storage of the underlying layer. If set to false, the data is updated asynchronously to the disk                   |
+| enable_audit_log            | Whether to enable audit log                                                                                                                     |
+| enable_backup_log           | Whether to enable real-time incremental backup                                                                                                  |
+| enable_fulltext_index       | Whether to enable full-text indexing                                                                                                            |
+| enable_ip_check             | Whether to enable IP whitelist                                                                                                                  |
+| enable_rpc                  | Whether to enable the RPC port                                                                                                                  |
+| enable_ssl                  | Whether to enable SSL encrypted transmission                                                                                                    |
+| optimistic_txn              | Whether to enable optimistic multi-threaded write transactions                                                                                  |
+| port                        | The REST access port of the current system                                                                                                      |
+| rpc_port                    | The port used by the RPC and HA services                                                                                                        |
+| subprocess_max_idle_seconds | The maximum idle time of the subprocess, a thread pool parameter                                                                                |
+| thread_limit                | The maximum number of threads used by the server at the same time                                                                               |
+| verbose                     | The level of detail of the log output information. It can be set to 0, 1, or 2, with larger values indicating more detailed output information. |
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..b7e5e9f2fa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,167 @@
+# TuGraph Browser(old version)
+
+> This document focuses on the use of TuGraph Browser
+
+## Definition
+
+TuGraph Browser is a visual development tool provided by TuGraph.
+
+## Functionality
+
+TuGraph Browser provides graph database developers with functions such as visual graph data development, graph data management and maintenance.
+
+## How to use it
+
+### 1. Connect to the database
+
+When the user completes the installation of the graph database, you can access it through the Browser, TuGraph Browser tool. The user only needs to type in the browser address bar: IP of the server where TuGraph is located :Port. The default port is 7090.
+
+### 2. Login
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- When the page is opened successfully, the first thing you see is the login page, and the user needs to fill in the account number and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change the initialized password in time after logging in
+
+### 3. Workbench
+
+#### 3.1 Quick Start
+
+- When you log in for the first time, the system will create an empty graph by default
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- The user clicks on the help option and selects Get Started quickly
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- Then click "One-click Create Model" -- >" One-click Create Data "to complete the construction of the built-in Movie data graph
+
+#### 3.2 Create subgraphs and examples
+
+##### 3.2.1 Create a subgraph
+
+- Click on New subgraph
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- Fill in the form information
+  ![alt Fill out the form](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+- Subgraph name
+- Subgraph description
+- Configuration information
+- Click OK to prompt that creation succeeded
+- Toggle the subgraph
+  ![alt Toggle subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- Click New Example
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- Select the example and click Create
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 query
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 User Interface Layout
+
+- Cypher input box
+- Result set display area
+
+##### 3.3.2 Result set display area function details
+
+- Result set tag display and functions
+  ![alt Result set tag](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+- All types of statistics for the result set are shown here
+- Click on the different "label" to make the following changes
+  -Change the display color
+- Modify the node size or edge thickness
+- Modify default display properties or system properties
+- Layout modification
+- Force guide layout
+- Grid layout
+- Tree layout
+- Environment layout
+- edge polymerization
+- Edges of the same type and direction can be merged
+- Create nodes
+- Click the Create Node button
+- Select the node type
+- Add node content
+- Create relationships
+- Select start and end points in the canvas
+- Select the type that can be matched
+- Enter node information
+- Stop layout
+- When too much data is causing the browser page to stall, you can click this stop layout button to improve the smoothness of the experience
+- Mouse hover
+- Enable this feature to highlight the one-degree neighbors of the mouse-over node
+- Result set export
+- Result sets can be exported as png, json, csv three different file forms
+- the refresh
+- Clicking the refresh button will re-execute the initial cypher statement for the current page and refresh the result set
+  Maximize -
+  -Click Maximize button, the result set display area will be displayed in full screen
+- Result set display mode switching
+  - Support graph, table and text modes
+
+##### 3.3.3 Schema
+
+- model
+  ![Modeling Alt](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- schema supports real-time addition, deletion, modification and query
+
+- schema supports import and export
+
+##### 3.3.4 Data import
+
+- Local data import
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+- Select the file encoding format
+- Select a local CSV file
+- Select the model for the corresponding node or edge
+- Do the data mapping
+  -Complete the data import
+
+##### 3.3.5 plug-in (Stored Procedure)
+
+- Use of plug-ins
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+- Users can upload the plug-in program written locally, execute it in the visual page, and view the execution result
+- Users can perform, uninstall, execute, and download plug-ins in the visualization page
+
+##### 3.3.6 Help
+
+- where it records how TuGraph-browser is used
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 Console
+
+##### 3.4.1 Basic database information
+
+- Displays basic database configuration information
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 Permission management
+
+- A function module used to create users and roles. Users can manage permissions here
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 Live status
+
+- This shows the database real-time status, including: CPU usage, memory usage, disk usage, number of data requests, disk IO
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 Task Management
+
+- Here the user can see the task in execution and stop the task
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 Audit logs
+
+- Database related audit logs recorded here, used to troubleshoot problems encountered in use
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6c4d063e26
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB User Guide
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/1.environment.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/1.environment.md
new file mode 100644
index 0000000000..f2cdffe578
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/1.environment.md
@@ -0,0 +1,41 @@
+# Environment
+
+> This document provides an overview of the required hardware and software environment for deploying TuGraph.
+
+## 1.Hardware Environment
+
+### 1.1. CPU
+TuGraph supports X86_64 and ARM64 architectures for both physical, virtual, and containerized environments. Tested and certified hardware platforms include Intel, AMD, Kunpeng, Hygon, Feiteng, and others.
+
+### 1.2. Memory
+We recommend having a memory capacity that is equal to or greater than the actual data size. For optimal performance, caching all data in memory is ideal. In terms of data locality, graph databases have poorer locality compared to relational databases. Therefore, if the data cannot fit in memory, frequent swapping may occur.
+
+### 1.3. Storage
+We strongly recommend using NVMe SSD as external storage. The database performs numerous synchronous write operations, often in a random manner, making the read/write performance of the external storage critical to the overall database performance. Hence, high IOPS and low-latency NVMe SSDs are the optimal choice.
+
+If circumstances permit only the use of SATA interface SSDs or cloud-based network disks, although performance may be affected, TuGraph can still run correctly.
+
+It is recommended to have external storage size at least four times the actual data size. For example, if the data size is 1TB, preparing a 4TB hard drive would be more reliable.
+
+
+
+## 2. Software environment
+
+### 2.1. Operating System
+
+TuGraph is compatible with popular operating systems, including Ubuntu, CentOS, SUSE, Galaxy Kylin, China Standard Software, UOS, and others, all of which have been tested and certified.
+
+Among them, the most stable system versions are Ubuntu 18.04, CentOS 7, and CentOS 8.
+
+### 2.2. System Libraries
+
+The requirements for system libraries differ between the compilation environment and the runtime environment. For specific details, please refer to the[environment mode](2.environment-mode.md)。
+
+## 3.Recommended Configuration
+
+| Hardware | Minimum Configuration	   | Recommended Configuration                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| Memory   | 4GB       | 512GB                    |
+| Storage  | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/2.environment-mode.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/2.environment-mode.md
new file mode 100644
index 0000000000..98f9820ba2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/2.environment-mode.md
@@ -0,0 +1,24 @@
+# Environment Mode
+
+> This document primarily introduces the three types of environments involved in TuGraph.
+
+## 1.Classification
+
+Based on the different functionalities supported by the environments, they can be categorized into the following:
+
+* The compilation environment has all dependent libraries for TuGraph compilation, including all dependencies of the running environment, and can compile TuGraph source code, but does not include precompiled TuGraph executable files and library files for developers to compile source code.
+
+* Running environment, with GCC/Java/Python environment, can run all functions of TuGraph, and can host full-text indexing, java client, c++ source code uploaded as plugin, and complete functions of python plugin, built-in TuGraph precompiled executable file and library files for customers to install and use directly without compiling source code.
+
+* Simplified operating environment, which is approximately equivalent to a bare system plus precompiled TuGraph. It can only run the basic functions of TuGraph. There is no C++ plugin to compile and run, only so upload, no full-text index, and no python plugin. It is for quick setup and trial use.
+After compiling TuGraph, all the required dependencies are packaged together in the form of .a files, eliminating the need for unnecessary additional dependencies during runtime. However, since TuGraph supports stored procedures, which involve compiling C++ code on the server, the required compilers still need to be present in the environment.
+
+## 2.System Library
+
+For the three types of environments, the required system libraries, excluding the TuGraph runtime package, are as follows:
+
+* Compilation Environment: It includes GCC, Python, Java compilers, as well as libraries such as ANTLR4 and Pybind11. Please refer to the tugraph-compile-*-Dockerfile for more details.
+
+* Runtime Environment: The main dependencies introduced by stored procedures include GCC, Boost, CMake, and others. Please refer to the tugraph-runtime-*-Dockerfile for more details.
+
+* Mini-Runtime Environment: There are no additional system library dependencies. Please refer to the tugraph-mini-runtime-*-Dockerfile for more details.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md
new file mode 100644
index 0000000000..83b27c4585
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md
@@ -0,0 +1,105 @@
+# Docker Deployment
+
+>This document introduces the creation and download of Docker images for TuGraph Compile and TuGraph Runtime.
+
+## 1.Introduction
+
+- TuGraph Compile Image: Provides a compilation environment and can be used for TuGraph compilation and testing.
+- TuGraph Runtime Image: Provides a binary executable environment with TuGraph library and executable files.
+- TuGraph Mini Runtime Image: Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+## 2.Existing Docker Images
+
+### 2.1.Image Download
+
+The images are hosted on [DockerHub]( https://hub.docker.com/u/tugraph ) and can be downloaded and used directly.
+
+For the latest version of Docker address, see [Link](../../1.guide.md#TuGraph-Latest-Version).
+
+### 2.2.Naming Convention
+
+#### 2.2.1.TuGraph Compile Image
+
+Provides a compilation environment and can be used for TuGraph compilation.
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+For example: `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+Provides a binary executable environment with TuGraph library and executable files.
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example:`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example: `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.Common Docker Operations
+
+Docker is generated from Dockerfile. Note that creating images requires downloading dependencies, so network issues may cause slow creation or creation failure. Do not overwrite images unless the tag is `latest`.
+
+build Compile image
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+build Runtime / Mini Runtime image
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+Modify image name
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+push image
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+pull image
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+save image
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+load image
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+Refer to the [docker official documentation](https://docs.docker.com/engine/reference/commandline/cli ) for other Docker operations.
+
+### 2.4. M1 Supports
+
+Running amd64 containers on M1-chip machines may cause unknown errors. TuGraph provides arm64 images for M1 machines.
+Contains compile and runtime images:
+
+* `tugraph-runtime-arm64v8-centos7`
+* `tugraph-compile-arm64v8-centos7`
+
+## 3. Best Practice in Using and Developing Docker Images for TuGraph-DB
+
+Please carefully read the points below and follow them if you are new to contribute to TuGraph.
+
+- To get rid of too much docker layer, please add your dependency to the Docker with the style writing ENV and RUN in a
+  single line.
+- For the packages/resources you need to build the dependency, use the original ones instead of tweaking them without
+  tracking by VCS. And then contact TuGraph team to upload it to OSS to accelerate the building process, as the urls you
+  see in the Dockerfiles.
+- To make the development more efficient, you would better start from adding dependencies to base TuGraph Compile Images
+  and then reproduce the process in the Dockerfile after confirming the enviroment works.
+- CI uses the docker images. Please check the dependency problems if your CI fails.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md
new file mode 100644
index 0000000000..eed64b83e7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# Local Package Deployment
+
+> This document describes TuGraph Local Package Deployment.
+
+## 1. Environment preparation
+
+TuGraph local package deployment requires a corresponding environment, and quick verification can use streamlined installation packages, which require almost no third-party libraries.
+
+If you need to use the complete TuGraph function, please refer to the tugraph-db source code directory ci/images/tugraph-runtime-*-Dockerfile. This script contains the complete environment construction process.
+
+## 2. Download the installation package
+
+For the latest version of the installation package address, see [Link](../../1.guide.md/#TuGraphLatest Version).
+
+You can also visit Github to download: [TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. Installation method under CentOS
+
+The .rpm installation package for TuGraph installed on CentOS, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.rpm installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+Users can also specify the installation directory by specifying the `--prefix` option.
+
+## 4. Installation method under Ubuntu
+
+A .deb installation package for TuGraph installed on Ubuntu, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.deb` installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+This command installs TuGraph in the `/usr/local` directory by default. Users can also change the installation directory by specifying the `--instdir=<directory>` option.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md
new file mode 100644
index 0000000000..9551dc6e32
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md
@@ -0,0 +1,128 @@
+# Cloud Deployment
+
+> This document mainly introduces the cloud deployment of TuGraph, and you can also refer to the[Alibaba Cloud ComputeNest deployment document.](https://aliyun-computenest.github.io/quickstart-tugraph/)。
+
+## 1.Introduction
+
+TuGraph (tugraph.antgroup.com) is a high-performance graph database of Alibaba Group. TuGraph provides community version services on ComputeNest, so you can quickly deploy TuGraph services on ComputeNest and achieve operation and maintenance monitoring, thereby building your own graph application. This document introduces how to open TuGraph community version services on ComputeNest, as well as deployment process and usage instructions.
+
+## 2.Instance Description
+
+TuGraph is deployed as a community open source version, and the source code can be found in the Github Repo. Currently, the available instance specifications are as follows:
+
+| Instance Family | vCPU and Memory             | System Disk                | Public Bandwidth         |
+|-----------------|-----------------------------|----------------------------|--------------------------|
+| ecs.r7a.xlarge  | AMD Memory r7a, 4vCPU 32GiB | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+| ecs.r6.xlarge   | Memory r6, 4vCPU 32GiB      | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+
+Estimated costs can be seen in real time when creating instances (currently free). If you need more specifications or other services (such as cluster high availability requirements, enterprise-level support services, etc.), please contact us at tugraph@service.alipay.com.
+
+## 3.Deployment Process
+
+### 3.1.Preparation
+
+Before starting to use, you need an Alibaba Cloud account to access and create resources such as ECS and VPC.
+
+- If you use a personal account, you can directly create a service instance.
+- If you create a service instance using a RAM user and use Alibaba Cloud ComputeNest for the first time:
+    - Before creating a service instance, you need to add permissions for the corresponding resources to the account of the RAM user. For detailed operations on adding RAM permissions, please see Grant RAM user permissions. The required permissions are shown in the following table.
+    - Authorization to create associated roles is also required. Refer to the following figure and select Agree to authorize and create associated roles.
+
+| Permission Policy Name          | Remark                                                                       |
+|---------------------------------|------------------------------------------------------------------------------|
+| AliyunECSFullAccess             | Permissions for managing cloud server services (ECS)                         |
+| AliyunVPCFullAccess             | Permissions for managing Virtual Private Cloud (VPC)                         |
+| AliyunROSFullAccess             | Permissions for managing Resource Orchestration Service (ROS)                |
+| AliyunComputeNestUserFullAccess | Permissions for managing ComputeNest services (ComputeNest) on the user side |
+| AliyunCloudMonitorFullAccess    | Permissions for managing Alibaba Cloud Monitor (CloudMonitor)                |
+
+![Cloud Deployment](../../../../images/cloud-deployment-1.png)
+
+### 3.2.Deployment Entrance
+
+You can search in Alibaba Cloud ComputeNest, or quickly access it through the following deployment link.
+
+[Deployment Link](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.Apply for Trial Use
+
+Before formal trial use, you need to apply for trial use, fill in the information as prompted, and create the TuGraph service after passing the review.
+
+![Apply for Trial Use](../../../../images/cloud-deployment-2.png)
+
+### 3.4.Create TuGraph Service
+
+#### 3.4.1.Parameter List
+
+During the process of creating a service instance, you need to configure the parameter list of the service instance information. The specific parameters are as follows.
+
+| Parameter Group                              | Parameter Item  | Example                 | Description                                                                                                                            |
+|----------------------------------------------|-----------------|-------------------------|----------------------------------------------------------------------------------------------------------------------------------------|
+| Service Instance Name                        | N/A             | test                    | The name of the instance.                                                                                                              |
+| Region                                       | N/A             | China East 1 (Hangzhou) | Select the region of the service instance. It is recommended to select nearby regions to obtain better network latency.                |
+| Payment Type Configuration                   | Payment Type    | Pay-As-You-Go           | For free use, please select Pay-As-You-Go.                                                                                             |
+| Availability Zone Configuration              | Deployment Area | Availability ZoneI      | Different available zones under the region, ensure that the instance is not empty.                                                     |
+| Select Existing Basic Resource Configuration | VPC ID          | vpc-xxx                 | Select the ID of the Virtual Private Cloud according to the actual situation.                                                          |
+| Select Existing Basic Resource Configuration | Switch ID       | vsw-xxx                 | Select the Switch ID according to the actual situation. If the Switch ID cannot be found, try switching the region and available zone. |
+| ECS Instance Configuration                   | Instance Type   | ecs.r6.xlarge           | Currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications.                                                                    |
+|ECS Instance Configuration|	Instance Password|	**|	Set the instance password. Length of 8-30 characters, must include three items (uppercase letters, lowercase letters, numbers, special characters in ()`~!@#$%^&*_-+={}[]:;'<>,.?/).
+|
+
+#### 3.4.2.Specific Steps
+
+The creation of the service is carried out according to the following steps, refer to the figure below:
+
+- Create an instance name, such as "test" in the figure below
+- Select the region, such as "China East 1 (Hangzhou)" in the figure below
+
+![Create Instance](../../../../images/cloud-deployment-3.png)
+
+- Select the instance type, currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications. If there is no model available in the list, try selecting other deployment areas.
+- Select the model
+- Configure the password for the instance
+- Select the deployment area, such as "Availability Zone I" in the figure below
+
+![Select Region](../../../../images/cloud-deployment-4.png)
+
+- Click next to enter the order confirmation page
+- Check the checkboxes for "Permission Confirmation" and "Service Terms"
+- Click the green "Start Free Trial" button in the lower left corner to create a service instance
+
+![Confirmation](../../../../images/cloud-deployment-5.png)
+
+### 3.5.Start TuGraph Service
+
+- View the service instance: After the service instance is created successfully, it takes about 2 minutes for deployment. After the deployment is complete, you can see the corresponding service instance on the page, as shown in the figure below.
+
+![View Instance](../../../../images/cloud-deployment-6.png)
+
+- Click the service instance to access TuGraph. After entering the corresponding service instance, you can get 3 ways to
+  use it on the page: web, rpc, ssh. You can also see the password of user admin on the page.
+
+![Access Method](../../../../images/cloud-deployment-7.png)
+
+- Click the link of web to jump to the deployed TuGraph Web. It is recommended that novice users first use the demo to quickly get started with TuGraph.
+    - First, on the TuGraph Web login page, enter the default username (admin) and the password on the page to log in, as shown in the figure below.
+    - After the login is completed, click "New Instance" -> "Create Instance" in sequence, wait for the creation to be completed, and the steps in 3 will change to green in turn, and it will automatically switch to the subgraph MovieDemo1, as shown in the figure below.
+
+![Login](../../../../images/cloud-deployment-8.png)
+![Create Demo](../../../../images/cloud-deployment-9.png)
+
+## 4.Common FAQs
+
+### No available resources in the selected deployment area
+
+Sometimes, the selected deployment area (such as Availability Zone G) does not have available resources for the selected package, and an error will be reported as shown in the figure below.
+
+![Deployment Error](../../../../images/cloud-deployment-10.png)
+
+__Solution__:Try selecting other regions, such as Availability Zone I
+
+### Unaccessible to the web port
+
+It takes some time for the server to get ready. Just wait for a few seconds.
+
+
+### Username or password is not correct
+
+Please make sure that you are using the password on the page instead of the default one.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/index.rst
new file mode 100644
index 0000000000..9bf6be2bc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/1.installation/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Installation
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/1.compile.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/1.compile.md
new file mode 100644
index 0000000000..6993692bc4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/1.compile.md
@@ -0,0 +1,30 @@
+# Compile
+
+> This document mainly describes how to compile TuGraph from source code.
+
+## 1.Prerequisites
+
+It is recommended to build TuGraph on a Linux system. Meanwhile, Docker is a good choice. If you want to set up a new environment, please refer to [Dockerfile](../1.installation/3.docker-deployment.md)。
+
+## 2.compile
+
+Here are steps to compile TuGraph:
+
+1. `deps/build_deps.sh` or to skip building web interface `SKIP_WEB=1 deps/build_deps.sh`
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If support shell lgraph_cypher, use `-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+4. `make`
+5. `make package` or `cpack --config CPackConfig.cmake`
+
+Example:
+`tugraph/tugraph-compile-centos7`Docker environment
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/2.tugraph-running.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/2.tugraph-running.md
new file mode 100644
index 0000000000..5a173a862b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/2.tugraph-running.md
@@ -0,0 +1,196 @@
+# Tugraph Running
+
+> This document describes the operation mode of the TuGraph service, starting, stopping, and restarting operations.And TuGraph's service configuration parameters, configuration file format, and command-line configuration parameters.
+
+## 1. Prerequisites
+TuGraph has the following prerequisites for its execution: a correct [installation of TuGraph](../1.installation/1.environment.md).
+
+TuGraph execution requires ensuring that the library file "liblgraph.so" is located in the environment variable LD_LIBRARY_PATH.
+
+The user running the TuGraph process does not need superuser privileges. However, they need read permissions for the configuration file (usually lgraph.json) and any files referenced within it. Additionally, they should have write permissions for data folders, log files, etc.
+
+## 2.The operation mode
+
+TuGraph can be started as a normal process in the foreground or as a daemon in the background.
+
+When running as a normal process, TuGraph can print logs directly to the terminal, which is handy when debugging server configurations. However, because the foreground process is terminated after the terminal exits, the user must ensure that the terminal remains open while the TuGraph server is running. In daemon mode, on the other hand, the TuGraph server can continue to run even if the terminal that started it exits. If TuGraph needs to run for a long time, it is recommended to start the TuGraph server in daemon mode.
+
+### 2.1.Running a normal process
+
+The 'lgraph_server -d run' command runs TuGraph as a normal process. Normal processes depend on the command line terminal, so when the terminal ends, the TuGraph process is automatically terminated. Normal process mode with '--log_dir ""' can output the process log directly to the terminal, so it is easier to debug.
+
+Start the command：
+
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+Example of running output in normal mode：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+In normal process mode, the user can prematurely terminate the TuGraph process by pressing 'CTRL+C'.
+
+### 2.2.Run process daemon mode
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+Example output from running in daemon mode:
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+## 3.Service operation
+
+### 3.1.Start the service
+
+TuGraph needs to be started using the 'lgraph_server -d start' command line. The following is an example of the command to start TuGraph:
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+### 3.2.Stop the service
+
+You can stop the TuGraph daemon using the 'kill' command and the 'lgraph_server -d stop' command. Since it is possible to run multiple TuGraph server processes on the same computer, we distinguish between the different server processes using the '.pid 'file, which is written to the working directory where the process was started. Therefore, you need to run the command 'lgraph_server-d stop' in the same working directory to stop the correct server process.
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.Restart the service
+
+Users can also restart the TuGraph service by 'lgraph_server -d restart' :
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.Service configuration
+
+The TuGraph server loads configurations from the configuration file and command line options at startup, and if different values are specified for the same option in the configuration file and command line, the value specified in the command line will be used preferentially.
+
+### 4.1.Configuration parameters
+
+The parameters and their types are described as follows:
+
+| **Parameter names**       | **<nobr>Type</nobr>** | **Instructions**                                                                                                                                                                                                                                                                                    |
+|---------------------------|-----------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                 | string                | Directory where data files are stored. If the directory does not exist, it is automatically created. The default directory is /var/lib/lgraph/data.                                                                                                                                                 |
+| durable                   | boolean               | Whether to enable real-time persistence. Turning off persistence can reduce the disk IO overhead when writing, but data may be lost in extreme cases such as machine power failure. The default value is `true`.                                                                                    |
+| host                      | string                | The IP address on which the REST server listens. The default address is 0.0.0.0.                                                                                                                                                                                                                    |
+| port                      | int                   | The Port on which the REST server listens. The default port is 7070.                                                                                                                                                                                                                                |
+| enable_rpc                | boolean               | Whether to use RPC services. The default value is 0.                                                                                                                                                                                                                                                |
+| rpc_port                  | int                   | Port used by RPC and HA services. The default port number is 9090.                                                                                                                                                                                                                                  |
+| enable_ha                 | boolean               | Whether to enable the HA mode. The default value is false.                                                                                                                                                                                                                                          |
+| ha_log_dir                | string                | HA log directory. The HA mode needs to be enabled. The default value is null.                                                                                                                                                                                                                       |
+| verbose                   | int                   | Detail level of log output information. The value can be 0,1,2. The larger the value, the more detailed the output information. The default value is 1.                                                                                                                                             |
+| log_dir                   | string                | Directory where log files are stored. The default directory is /var/log/lgraph/.                                                                                                                                                                                                                    |
+| ssl_auth                  | boolean               | Whether to use SSL authentication. When HTTPS is enabled, only the HTTPS service is enabled on the REST server. The default value is false.                                                                                                                                                         |
+| web                       | string                | The directory where the web files (including the visual part) are located. The default directory is/usr/local/share/lgraph/resource.                                                                                                                                                                |
+| server_cert               | string                | certificate file path used by the server when SSL authentication is enabled. The default path is/usr/local/etc/lgraph/server - cert.pem.                                                                                                                                                            |
+| server_key                | string                | The public key file used by the server when SSL authentication is enabled. The default directory is/usr/local/etc/lgraph/server - key.pem。                                                                                                                                                          |
+| enable_audit_log          | boolean               | Whether to enable audit logs. The default value is false.                                                                                                                                                                                                                                           |
+| audit_log_expire          | int                   | When audit logs are enabled, the validity period (hours) of audit logs is automatically cleared upon timeout. If the value is 0, the logs are not cleared. The default value is 0.                                                                                                                  |
+| audit_log_dir             | string                | Specifies the directory for storing log files when audit logs are enabled. The default directory is $directory/_audit_log_.                                                                                                                                                                         |
+| load_plugins              | boolean               | Import all stored procedures when starting the service. The default value is 1.                                                                                                                                                                                                                     |
+| optimistic_txn            | boolean               | Enable optimistic multithreaded write transactions for Cypher. The default is 0.                                                                                                                                                                                                                    |
+| disable_auth              | boolean               | Disable REST authentication. The default is 0.                                                                                                                                                                                                                                                      |
+| ha_snapshot_interval_s    | int                   | Snapshot interval (in seconds) The default value is 86400.                                                                                                                                                                                                                                          |
+| ha_heartbeat_interval_ms  | int                   | Heartbeat interval in milliseconds. The default value is 1000.                                                                                                                                                                                                                                      |
+| ha_node_offline_ms        | int                   | The heartbeat times out and the interval (in milliseconds) between nodes going offline. The default value is 60000.                                                                                                                                                                                 |
+| ha_node_remove_ms         | int                   | The interval (in milliseconds) at which a node is considered completely dead and removed from the list. The default value is 120000.                                                                                                                                                                |
+| enable_ip_check           | boolean               | Allow IP address whitelists. The default value is 0。                                                                                                                                                                                                                                                |
+| idle_seconds              | int                   | The maximum number of seconds a child process can be idle. The default value is 600.                                                                                                                                                                                                                |
+| enable_backup_log         | boolean               | Whether to enable backup logging. The default value is 0.                                                                                                                                                                                                                                           |
+| backup_log_dir            | string                | The directory where backup files are stored. The default value is null.                                                                                                                                                                                                                             |
+| snapshot_dir              | string                | Directory where snapshot files are stored. The default value is null.                                                                                                                                                                                                                               |
+| thread_limit              | int                   | The maximum number of threads that can be used simultaneously. The default value is 0, which means that no restriction is imposed. The license file prevails.                                                                                                                                       |
+| unlimited_token           | boolean               | Whether to set the link token to be infinite. The default value is 0 and the validity period is 24 hours.                                                                                                                                                                                           |
+| enable_fulltext_index     | boolean               | Whether to enable the full-text index function, the default value is 0.                                                                                                                                                                                                                             |
+| fulltext_analyzer         | string                | Full-text index tokenizer type. Can be set to `StandardAnalyzer` or `SmartChineseAnalyzer`. Default is `StandardAnalyzer`                                                                                                                                                                           |
+| fulltext_commit_interval  | int                   | Full-text index data submission period, for write operations, in seconds. The default is 0, which commits immediately.                                                                                                                                                                              |
+| fulltext_refresh_interval | int                   | Full-text index data refresh cycle, for read operations, in seconds. The default is 0, and the latest written data can be read immediately.                                                                                                                                                         |
+| conf                      | string                | Initialize the HA cluster according to host1:port1,host2:port2,host3:port3, the default value is empty.                                                                                                                                                                                             |
+| ha_node_join_group_s      | int                   | The waiting time for a node to try to join the high availability cluster, in seconds, the default is 10.                                                                                                                                                                                            |
+| ha_bootstrap_role         | int                   | Whether to use bootstrap to start, and the server role to start using this method, 0 means not to use bootstrap to start, 1 means to use bootstrap to start and this node is a leader, 2 means to use bootstrap to start and this node is a follower, only these 3 options. The default value is 0. |
+| help                      | boolean               | Print the help message. The default value is 0.                                                                                                                                                                                                                                                     |
+
+### 4.2.Server configuration file
+
+TuGraph's configuration file is stored in JSON format. It is recommended that most configuration be stored in configuration files and that some configuration parameters be modified only temporarily using command-line options when needed.
+
+A typical configuration file looks like this:
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md
new file mode 100644
index 0000000000..444b948a88
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md
@@ -0,0 +1,129 @@
+# High Availability mode
+
+> This document describes the principles, preparations, and server operations of the high availability mode
+
+## 1.Theory
+
+TuGraph provides high availability mode (HA mode) through multiple server hot backups. In high availability mode, writes are synchronized to all servers so that service availability is not affected even if some servers go down.
+
+In high availability mode, multiple TuGraph servers form a backup group. Each backup group consists of three or more TuGraph servers, one of which serves as the 'leader' and the other replication group servers serve as the 'follower'. Write requests are serviced by the 'leader' who replicates each request to the 'follower' and responds to the client only after the request has been synchronized to the server. This way, if any server fails, the other servers will still have all the data that has been written so far. If the 'leader' server fails, other servers will automatically select a new 'leader'.
+
+The high availability mode is only available in the enterprise edition. The open-source Community Edition does not include this feature.
+
+## 2.Preparation
+
+To enable high availability mode, users need to:
+
+- Three or more instances of TuGraph servers.
+- To enable high availability mode when starting lgraph_server, the 'enable_ha' option can be set to 'true' using a configuration file or the command line.
+- Set the correct rpc_port through the configuration file or command line
+
+## 3.Start the initial backup group
+
+### 3.1.The initial data is consistent
+
+When the data in all servers is the same or there is no data at startup, the user can
+specify `--conf host1:port1,host2:port2` to start the server.
+In this way, all prepared TuGraph instances can be added to the initial backup group at one time,
+All servers in the backup group elect `leader` according to the RAFT protocol, and other
+servers join the backup group with the role of `follower`.
+
+An example command to start an initial backup group is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+After the first server is started, it will elect itself as the 'leader' and organize a backup group with only itself.
+
+### 3.2.Inconsistent initial data
+If there is already data in the first server (imported by the `lgraph_import` tool or transferred from a server in non-high availability mode),
+And it has not been used in high-availability mode before, the user should use the boostrap method to start. Start the server with data in bootstrap
+mode with the `ha_bootstrap_role` parameter as 1, and specify the machine as the `leader` through the `conf`
+parameter. In bootstrap mode, the server will copy its own data to the new server before adding the newly
+joined server to the backup group, so that the data in each server is consistent.
+
+An example command to start a data server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 1
+```
+
+Other servers without data need to specify the `ha_bootstrap_role` parameter as 2, and specify the `leader` through the `conf` parameter. The command example is as follows
+
+```bash
+**$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 2
+```
+## 4.Scale out other servers
+
+After starting the initial backup group, if you want to scale out the backup group, add new servers to the backup group,
+The `--conf HOST:PORT` option should be used, where `HOST` can be the IP address of any server already in this backup group,
+And `PORT` is its RPC port. E.g:
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+
+This command will start a TuGraph server in high availability mode and try to add it to the backup group containing the server `172.22.224.15:9090`.
+Note that joining a backup group requires a server to synchronize its data with the backup group's `leader` server, and this process may take a considerable amount of time, depending on the size of the data.
+
+## 5.Stopping the Server
+
+When a server goes offline via 'CTRL-C', it will notify the current 'leader' server to remove the server from the backup group. If the leader server goes offline, it will pass the leader identity permission to another server before going offline.
+
+If a server is terminated or disconnected from other servers in the backup group, the server is considered a failed node and the leader server will remove it from the backup group after a specified time limit.
+
+If any server leaves the backup group and wishes to rejoin, it must start with the '--conf {HOST:PORT}' option, where 'HOST' is the IP address of a server in the current backup group.
+
+## 6.Restarting the Server
+
+Restarting the entire backup group is not recommended as it disrupts service. All servers can be shut down if desired. But on reboot,
+It must be ensured that at least N/2+1 servers in the backup group at shutdown can start normally, otherwise the startup will fail. and,
+Regardless of whether `enable_bootstrap` is specified as true when initially starting the replication group, restarting the server only needs to pass
+Specify the `--conf host1:port1,host2:port2` parameter to restart all servers at once. The command example is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 7.docker deploys a highly available cluster
+In real business scenarios, it is likely to encounter the need to deploy high-availability clusters on multiple operating systems or architectures.
+Differentiated environments may cause some dependencies to be missing when compiling TuGraph. therefore,
+Compiling software in docker and deploying high-availability clusters is very valuable. Take the centos7 version of docker as an example,
+The steps to deploy a highly available cluster are as follows.
+
+### 7.1.Install mirror
+Use the following command to download TuGraph's compiled docker image environment
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+Then pull the TuGraph source code and compile and install
+
+### 7.2.Create container
+Use the following command to create a container, use `--net=host` to make the container run in host mode, in this mode
+Docker and the host machine share the network namespace, that is, they share the same IP.
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 7.3.Start service
+Use the following command to start the service on each server, because docker and the host share IP, so you can directly specify to start the service on the host IP
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.Server Status
+
+The current status of the backup group can be obtained from the TuGraph visualization tool, REST API, and Cypher query.
+
+In the TuGraph visualization tool, you can find the list of servers and their roles in the backup group in the DBInfo section.
+
+With the REST API, you can use `GET /info/peers` to request information.
+
+In Cypher, the `CALL dbms.listServers()` statement is used to query the status information of the current backup group.
+
+## 9.Data synchronization in high availability mode
+
+In high availability mode, different servers in the same backup group may not always be in the same state. For performance reasons, if a request has been synchronized to more than half of the servers, the leader server will consider the request to be in the committed state. Although the rest of the servers will eventually receive the new request, the inconsistent state of the servers will persist for some time. A client may also send a request to a server that has just restarted, thus having an older state and waiting to join a backup group.
+
+To ensure that the client sees consistently continuous data, and in particular to get rid of the 'reverse time travel' problem, where the client reads a state older than it has seen before, each TuGraph server keeps a monotonically increasing data version number. The mapping of the data version number to the database state in the backup group is globally consistent, meaning that if two servers have the same data version number, they must have the same data. When responding to a request, the server includes its data version number in the response. Thus, the client can tell which version it has seen. The client can choose to send this data version number along with the request. Upon receiving a request with a data version number, the server compares the data version number to its current version and rejects the request if its own version is lower than the requested version. This mechanism ensures that the client never reads a state that is older than before.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/index.rst
new file mode 100644
index 0000000000..6d3b240af9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/2.running/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Running
+====================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/1.data-import.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/1.data-import.md
new file mode 100644
index 0000000000..e3dbf145f6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/1.data-import.md
@@ -0,0 +1,369 @@
+# Data Importing
+
+> This document describes the data import function of TuGraph. These include delimiters in CSV format, sample formats for jsonline, and two modes for importing online and offline.
+
+## 1. Introduction
+
+After the installation is successful, you can use the `lgraph_import` batch import tool to import existing data into TuGraph. `lgraph_import` supports importing data from CSV files and JSON data sources.
+
+> `sonline format, a row of a json array string`
+
+> CSV format
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline format
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph supports two data importing modes：
+
+- _offline_：Read the data and import it into a data file for the specified server, it should only be done when the server is offline.
+- _online_：Read the data and send it to the running server, which then imports the data into its database.
+
+## 2.CSV file format delimiter
+
+    CSV delimiters can be single-character or multi-character strings, which cannot contain 'r' or 'n'. Note that different shells handle input strings differently, so different escape handling may be required for different shell input parameters.
+
+In addition, 'lgraph_import' also supports the following escape characters for entering special symbols:
+
+| Escape character | Instructions                                                                                              |
+| ---------------- | --------------------------------------------------------------------------------------------------------- |
+| \\               | The backslash`\\`                                                                                         |
+| \\a              | ASCII code 0x07                                                                                           |
+| \\f              | form-feed，ASCII code 0x0c                                                                                |
+| \\t              | Horizontal tab characters， ASCII code 0x09                                                               |
+| \\v              | Vertical tab characters， ASCII code 0x0b                                                                 |
+| \\xnn            | Two hexadecimal digits representing one byte，example \\x9A                                               |
+| \\nnn            | A three-digit octal number representing a single byte，example \\001, \\443，data range cannot exceed 255 |
+
+Demo：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.The configuration file
+
+    `lgraph_import`tool configures the environment using the specified configuration file. The configuration file describes the paths to the input files, the vertices/edges they represent, and the vertex/edge format.
+
+### 3.1.Configuration File Format
+
+The configuration file consists of two parts: schema and files. The 'schema' part defines label, and the 'files' part describes the data files to be imported.
+
+#### 3.1.1.The keyword
+
+- schema (Array）
+  - label（required，string）
+  - type（required， VERTEX or EDGE）
+  - properties（Array，required for vertex，If there is no property for the edge, you can leave it unconfigured）
+    - name（required, string）
+    - type （required,，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（optional，Indicates that the field can be configured or not configured）
+    - index（optional，Whether the field needs to be indexed）
+    - unique（optional, whether the field indexed and is of type unique）
+  - primary (vertex-only configuration, specify a property that uniquely identifies a point in the primary key field)
+  - temproal (edge-only configuration, optional, specifies the timestamp field for storage tier sorting)
+  - temporal_field_order (edge-only configuration, optional, the default value is ASC, indicating the ascending order, or DESC, indicating the descending order)
+  - constraints (edge-only configuration, optional, array form, start and end labels, unconfigured or empty means unrestricted)
+  - detach_property (optional, both Edge and Vertex can config，default is `false`. `true` means the property data is stored in detached model, which can reduce io read amplification in cases with less memory and much property data.)
+- files （Array）
+  - path（required，string，The value can be a file path or a directory path. If it is a directory, all files in the directory will be imported. Ensure that they have the same schema）
+  - header（Optional, numeric, header in the first few lines of the file, or 0）
+  - format（required，JSON or CSV）
+  - label（required，string）
+  - columns（Array）
+    - SRC_ID (Special string，only on the edges,That means this column is the source data)
+    - DST_ID (A special string, only on the edges, indicates that this column is the destination data)
+    - SKIP   (A special string to skip this column of data)
+    - [property]
+  - SRC_ID (Edge-only configuration. The value is the start label)
+  - DST_ID (Edge-only configuration. The value is the destination point label)
+
+### 3.1.2.Example Configuration File
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+For the above Example Configuration File, three labels defined: two point types' actor 'and' movie ', and one edge type 'role'. Each label describes: the name of the label, the type (dot or edge), which attribute fields are available, and the type of each field. For points, the primary field also defined; For edges, the constraints field also defined, which limits the starting and ending points of the edges.
+
+It also describes three data files, two dot data files' actors.csv 'and' movies.csv ', and one edge data file 'roles.csv'. Each section describes the path of the file, the format of the data, the first few lines of the header, the label of the data, and the corresponding field of each column in each row of data in the file.
+
+For the above configuration files, the import tool will first create labels' actor ', 'movie', and 'role' in TuGraph, and then perform data import of the three files.
+
+## 4.Offline full import
+
+The offline mode can be used only on offline servers. An offline import creates a new graph, so it's more suitable for your first data import on a newly installed TuGraph server.
+
+To use the 'lgraph_import' tool in offline mode, you can specify the 'lgraph_import --online false' option. To see the command-line options available, use 'lgraph_import --online false --help' :
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+Command line arguments:
+
+- **-c, --config_file** `config_file`: Import the configuration file name in the following format:
+- **--log** `log_dir`: Log directory. The default is an empty string, in which case the log information output to the console.
+- **--verbose** `0/1/2`: Log level. The higher the log level, the more detailed the output information is. The default value is 1.
+- **-i, --continue_on_error** `true/false`: If an error occurs, skip the error and continue. The default is false. If an error occurs, exit.
+- **-d, --dir** `{diretory}`:The database directory to which the import tool will write data. Default is'./db '.
+- **--delimiter** `{delimiter}`: Data file separator. This is used only when the data source is in CSV format. The default is', '。
+- **-u, --username** `{user}`: Username of the database. You need to be an administrator to perform offline import.
+- **-p, --password** `{password}`: Specifies the password of the database user
+- **--overwrite** `true/false`: Whether to overwrite data. When set to true, the data directory overwritten if it already exists. Default to 'false'.
+- **-g, --graph** `{graph_name}`: Specify the kind of graph to import.
+- **-h, --help**: The help information displayed.
+
+### 4.1.Offline Import Example
+
+    In this example, we use the movie-actor data described above to demonstrate the use of the import tool. The data to be imported is divided into three files: 'movies.csv', 'actors.csv', and 'roles.csv'.
+
+'movies.csv' contains information about movies, where each movie has an id (as a primary key for retrieval), and each movie also has attributes such as title, year, and rating. (Data from [IMDb](http://www.imdb.com)).
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+> The jsonline format is as follows:
+> All fields can be strings, which will be converted to the corresponding type when imported
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`It contains information about the actors. Each actor also has an id, as well as properties such as name.
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`It contains information about which role an actor played in which movie. Each row records a character played by a given actor in a given movie, corresponding to an edge in the database.`SRC_ID` and `DST_ID` are the source and target vertices of the edge, which are the 'primary' properties defined in 'actors.csv' and 'movies.csv', respectively.
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+'configuration file import.conf', notice that there are two HEADER lines in each file, so we need to specify the 'HEADER=2' option.
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+Using the import configuration file, we can now import data using the following command:
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # Read configuration information from import.conf
+        --dir /data/lgraph_db      # Store the data in /data/lgraph_db
+        --graph mygraph            # Import the graph named mygraph
+```
+
+**Notice**：
+
+- If a graph named 'mygraph' already exists, the import tool will print an error message and exit. To force a graph to be overwritten, use the '--overwrite true' option.
+- Configuration and data files must be stored in UTF-8 encoding (or normal ASCII encoding, which is a subset of UTF-8). If any file uses an encoding other than UTF-8 (for example, UTF-8 with BOM or GBK), the import will fail and output a profiler error.
+
+## 5.Online incremental Import
+
+    The online import mode can be used to import a batch of files into an already running instance of TuGraph. This is handy for processing incremental batch updates that typically occur at fixed intervals. The 'lgraph_import --online true' option enables the import tool to work in online mode. Like offline mode, online mode has its own set of command-line options, which can be printed using the '-h, --help' options:
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+The configuration related to the file specified in the configuration file, and its format is exactly the same as' offline mode '. However, instead of importing the data into a local database, we are now sending the data to a running TuGraph instance, which is typically running on a different computer than the client machine on which the import tool is running. Therefore, we need to specify the URL, DB user, and password for the HTTP address of the remote machine.
+
+If the user and password are valid, and the specified graph exists, the import tool sends the data to the server, which then parses the data and writes it to the specified graph. The data will be sent in a packet of about 16 MB, interrupted at the nearest newline. Each package imported atomically, which means that if the package is successfully imported, all data is successfully imported; otherwise, none of the data enters the database. If '--continue_on_error true' is specified, data integrity errors are ignored and offending lines are ignored. Otherwise, the import stops at the first error package and prints out the number of packages that have been imported. In this case, the user can modify the data to eliminate errors, and then use '--skip_packages N' to redo the import to skip the imported packages.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/2.data-export.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/2.data-export.md
new file mode 100644
index 0000000000..b1ad57de6f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# Data Export
+
+> This document mainly introduces the data export function of TuGraph.
+
+## 1.Introduction
+
+TuGraph can use the tool `lgraph_export` to export data from the database that has been imported successfully. The 'lgraph_export' tool can export the data of the specified TuGraph database to the specified directory in the form of 'csv' or 'json' file, and export the configuration file 'import.config'. That required for re-importing the data.
+
+## 2.Data Export
+
+The following is an example of a command for the tool:
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+Details:
+
+- `-d {database_dir}` specifies the directory of the database from which the data will be exported. The default value is./testdb '.
+- `-e {export_destination_dir}` specifies the directory where the export file is stored. The default value is./exportdir.
+- `-g {graph_to_use}` specifies the type of graph database. default is' default '.
+- `-u {username}` Specifies the name of the user who performs the export operation.
+- `-p {password}` Specifies the password of the user who performs the export operation.
+- `-s {field_separator}` specifies the separator for the exported file. The default is comma.
+- `-f {output_format}` specifies the format of the exported data. It can be 'json' or 'csv'.
+- `-h` In addition to the specified parameters, you can also use this parameter to view the help of the tool.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..fa1839724b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
@@ -0,0 +1,32 @@
+# Backup and Restore
+
+> This document mainly introduces the data backup and restore function of TuGraph.
+
+## 1.Data Backup
+
+TuGraph can use the 'lgraph_backup' tool to backup data.
+The 'lgraph_backup' tool can backup data from a TuGraph database to another directory. It can be used as follows:
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+Details:
+
+- `-s {source_dir}` specifies the directory where the database (source database) to be backed up resides.
+- `-d {destination_dir}` specifies the directory where the backup file (destination database) is stored.
+  If the target database is not empty, 'lgraph_backup' prompts you whether to overwrite the database.
+- `-c {true/false}` indicates whether a compaction occurs during backup.
+  Every compaction creates a tighter backup, but every compaction takes longer to create. This option defaults to 'true'.
+
+## 2.Data Restore
+
+The target database `{destination_dir}` obtained using the `lgraph_backup` tool backs up all subgraphs of the source database `{source_dir}`, but does not include the raft information of the HA cluster, thereby ensuring that the service and cluster can be successfully restarted with the backup database and the data is consistent with the source database. The following command can be used to restart the service with the backup database. When the service starts, the storage process of all subgraphs will be restored to ensure that the backup service is completely consistent with the original service.
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+Details
+
+- `-d {destination_dir}` Specify the directory where the backup file (target database) is located.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md
new file mode 100644
index 0000000000..6782a43d0e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# Data Warmup
+
+> This document mainly introduces the data Warmup function of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a disk-based database where data loaded into memory only when accessed. Therefore, for a period of time after the server just turned on, the system performance may be degraded due to frequent IO operations. At this point, we can improve this problem by data warm-up.
+
+## 2.lgraph_warmup
+
+Data warmup can be done using the tool lgraph_warmup. An example of its use is as follows:
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+Details:
+
+The - '-d {db_dir}' option specifies the data directory for the TuGraph server
+
+The - '-g {graph_list}' option specifies the names of graphs to be warmed-up, separated by commas
+
+The warm-up process takes different times depending on the data size and the type of disk being used. Preheating a large database on a mechanical disk may take a long time. Please wait patiently.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/index.rst
new file mode 100644
index 0000000000..d2d7ed7240
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/3.server-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Server Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/1.python-client.md
new file mode 100644
index 0000000000..3d21c53677
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/1.python-client.md
@@ -0,0 +1,32 @@
+# TuGraph Python SDK
+
+> This document is the usage instruction of TuGraph Python SDK
+
+## 1.Overview
+Python's TuGraph Rpc Client is a CPP Client SDK packaged with pybind11, so its interface details are not detailed in this document. This document only explains the use of TuGraph Python Restful Client SDK, including executing stored procedures, calling Cypher, and other operations.
+
+## 2.Demo
+
+### 2.1.Call cypher
+
+```python
+TuGraphClient import TuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+```
+
+### 2.2.Call stored procedure
+
+```python
+TuGraphClient import TuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..23741f2b5a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md
@@ -0,0 +1,245 @@
+# TuGraph C++ SDK
+
+> This document is the usage instruction of TuGraph C++ SDK
+
+## 1.Instructions
+
+C++ Client can use RPC to connect to lgraph_server to import data, execute stored procedures, call Cypher and other operations.
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+#### 2.1.1. Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2. Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3. Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+Among them, in the client in HA mode, by specifying the url parameter, a read request can be directed to a certain server.
+
+### 2.3.Call stored procedure
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+Among them, in the client in HA mode, by specifying the url parameter, a read request can be directed to a certain server.
+
+### 2.4.Load stored procedure
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.5.List stored procedures
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+Among them, in the client in HA mode, by specifying the url parameter, the request can be directed to a certain server.
+
+### 2.6.Delete stored procedure
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.7.Import from a byte stream schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.8.Import node and edge data from a byte stream
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.9.Import schema from a file
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.10.Import edge data from a file
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/3.java-client.md
new file mode 100644
index 0000000000..ad2daa1a85
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/3.java-client.md
@@ -0,0 +1,203 @@
+# TuGraph Java SDK
+
+## 1.Compile java client code
+
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies
+```java
+import com.alipay.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+Among them, in the client in HA mode, by specifying the url parameter, a read request can be directed to a certain server.
+
+### 2.3.Call stored procedure
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+Among them, in the client in HA mode, by specifying the url parameter, a read request can be directed to a certain server.
+
+### 2.4.Load stored procedure
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+
+### 2.5.List stored procedures
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+Among them, in the client in HA mode, by specifying the url parameter, the request can be directed to a certain server.
+
+### 2.6.Delete stored procedure
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+
+### 2.7.Import from a byte stream schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException
+```
+
+### 2.8.Import node and edge data from a byte stream
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+
+### 2.9.Import schema from a file
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout)
+            throws UnsupportedEncodingException, IOException
+```
+
+### 2.10.Import edge data from a file
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..1a778b73ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,176 @@
+# TuGraph-OGM
+
+@TODO
+
+## 1.Introduction
+
+> TuGraph-OGM project is open source on other repositories.
+
+TuGraph-OGM (Object Graph Mapping) is a graph object mapping tool designed for TuGraph. It supports the mapping of Java objects (POJO) into TuGraph. The classes in Java are mapped to nodes in the graph, the collections in the classes are mapped to edges, and the properties of the classes are mapped to the attributes of the graph objects. It also provides corresponding functions to manipulate the graph database. Therefore, Java developers can easily use TuGraph database in the familiar ecosystem. TuGraph-OGM is also compatible with Neo4j-OGM. Neo4j ecosystem users can migrate seamlessly to TuGraph database.
+
+### 1.1.Functions of TuGraph-OGM
+
+TuGraph-OGM provides the following functions for operating TuGraph:
+
+| Function                            | Usage                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| Insert single vertex/edge                 | void session.save(T object)                                                      |
+| Batch insert vertexs/edges                 | void session.save(T object)                                                      |
+| Delete vertex and its corresponding edges                | void session.delete(T object)                                                    |
+| Delete all vertexs with specific label       | void session.deleteAll(Class\<T> type)                                           |
+| Clear the database                      | void purgeDatabase()                                                             |
+| Update vertex                        | void session.save(T newObject)                                                   |
+| Query single node by id            | T load(Class<T> type, ID id)                                                     |
+| Query multiple nodes by ids           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| Query all nodes with specific label         | Collection\<T> loadAll(Class\<T> type)                                           |
+| Query with conditions                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher query (specify the return type) | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher query                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.Compile TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.Use TuGraph-OGM
+
+Please refer to the detailed examples in TuGraphOGMDemo under the demo folder.How to import dependencies in `pom.xml`.
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // create Movie vertex
+    @Id
+    private Long id;      // Movie id
+    private String title; // title attribute
+    private int released; // released attribute
+
+    // create Edge ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // create Actor vertex
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// configuration
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//Start driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// Open session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.Perform CRUD operations through OGM
+
+```java
+// new
+Movie jokes = new Movie("Jokes", 1990);  // Create Movie-vertex "jokes"
+session.save(jokes);                     // Store "jokes" in TuGraph
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // Connect the "speed" vertex with the "alice" vertex through the ACTS_IN relationship
+session.save(speed);                    // Store two vertexs and one edge
+
+// delete
+session.delete(alice);                  // Delete the "alice" vertex and its connected edge
+Movie m = session.load(Movie.class, jokes.getId());   // Get the "jokes" vertex based on its id
+session.delete(m);                                    // Delete the "jokes" node
+
+// update
+speed.setReleased(2018);
+session.save(speed);                   // Update the "speed" attribute
+
+// get
+Collection<Movie> movies = session.loadAll(Movie.class);  // Get all Movie vertexs
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // Query all movies released before 1995
+
+// Call Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // Query the Movie with "Speed" of 2018
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // Create vertex label "Director"
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // Create edge label "DIRECT"
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // Get the create result
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // View the number of vertexs created
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //View the number of edges created
+
+// Clear the database
+session.deleteAll(Movie.class);        // Delete all Movie vertexs
+session.purgeDatabase();               // Delete all data
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
new file mode 100644
index 0000000000..dd74d08869
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
@@ -0,0 +1,145 @@
+# Tugraph CLI
+
+> This document mainly introduces the CLI tool lgraph_cypher of TuGraph.
+
+## 1.Instructions
+
+The TuGraph release comes with a query client named 'lgraph_cypher' that can be used to submit OpenCypher requests to the TuGraph server. The 'lgraph_cypher' client has two execution modes: single command mode and interactive mode.
+
+## Single command mode
+
+In single-command mode, 'lgraph_cypher' can be used to submit a single Cypher query and print the result directly to the terminal. The printed result can also be easily redirected to a specified file. This is handy when users need to get a lot of results from the server and save them in files.
+
+In this mode, the 'lgraph_cypher' tool has the following options:
+
+### Command line Parameters:
+
+| Parameter | Type   | Instructions                                                                                                                                                                                                                           |
+| --------- | ------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| --help    | \\     | List all parameters and descriptions.                                                                                                                                                                                                  |
+| -example  | \\     | List the command instances.                                                                                                                                                                                                            |
+| -c        | string | A database configuration file used to obtain ip and port information.                                                                                                                                                                  |
+| -h        | string | Database server IP address. Omit this parameter if you have a configuration file. The default value is' 127.0.0.1 '                                                                                               |
+| -p        | string | Database server port. Omit this parameter if you have a configuration file. The default value is 7071                                                                                                                                  |
+| -u        | string | User name for logging in to the database.                                                                                                                                                                                              |
+| -P        | string | Password for logging in to the database.                                                                                                                                                                                               |
+| -f        | string | Contains the path to a single Cypher query single text file.                                                                                                                                                                           |
+| -s        | string | Single-line cypher query command. Start and end with `"`.                                                                                                                                                                              |
+| -t        | int    | Specifies the server timeout threshold for cypher queries. The default value is 150 seconds.                                                                                                                                           |
+| -format   | string | Query result display mode. Supports two formats: 'plain' and 'table'. The 'plain' format prints the query results in a single column. The 'table' format displays the query results in a tabular format. The default value is' table ' |
+
+### Examples:
+
+**cypher command file query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+
+```
+
+**cypher command single-sentence query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+
+```
+
+## Interactive mode
+
+'lgraph_cypher' can also be run in interactive mode. In interactive mode, the client stays connected to the server and interacts with the user in read-evaluate-print-loop.
+
+### Enter lgraph_cypher interaction mode:
+
+If no '-f' or '-s' command line option added, 'lgraph_cypher' will enter interactive mode when running. how to use it:
+
+```
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+
+```
+
+If the login is successful, the corresponding login success message will be displayed:
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2018 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+Now we also provide an interactive shell for users to enter Cypher queries or use the ':help' command to check for available commands.
+
+### Command Description
+
+In addition to the Cypher query, the shell of 'lgraph_cypher' accepts the following commands:
+
+| Command                  | Parameters                                         | instructions                                                                                                                                              |
+| ------------------------ | -------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                                 | Displays the server information and the corresponding description of all commands.                                                                        |
+| :db_info                 | \\                                                 | Query the current server status. /db/info for the corresponding REST API.                                                                                 |
+| :clear                   | \\                                                 | Clear the screen.                                                                                                                                         |
+| :use                     | {Graph Name}                                       | The graph specified with this name defaults to `default`                                                                                                  |
+| :source                  | `-t {Query the timeout value} -f {The query file}` | cypher command file query in interactive mode. The default timeout threshold is 150 seconds. Query file format reference No interactive query parameters. |
+| :exit                    | \\                                                 | Exit interactive mode and return to the original command line.                                                                                            |
+| :format                  | `plain` or `table`                                 | Change the display mode of cypher query results. Support 'plain' and 'table' modes.                                                                       |
+| :save all/command/result | `-f {The file path}` `{Cypher}`                    | The cypher command (command), query result (result) or both (all) are stored. The default location is' /saved_cypher.txt '                                |
+
+**Note:**
+
+- Each command should start with a colon `:`.
+
+**:save command example :**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+
+```
+
+### cypher query command:
+
+In interactive mode, users can also directly input a single sentence cypher command for query, with "'; ` "end. Enter commands that are case insensitive. Here's an example:
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher` supports multi-line input when typing commands. Users can use the `ENTER` key to type long query statements into multiple lines. In the case of multi-line input, the beginning of the command line will change from `>` to `=>`, and the user can continue to type the rest of the query.
+
+Example:
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### Auxiliary Features:
+
+**Input History:** Press the up and down arrow keys in interactive mode to display the input history.
+
+**Auto Completion:** lgraph_cypher will automatically complete based on the input history. In the event of a completion prompt, pressing the right arrow key will automatically complete the command.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/index.rst
new file mode 100644
index 0000000000..f9acd8d9e1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/4.client-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Client Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
new file mode 100644
index 0000000000..6695299a7d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
@@ -0,0 +1,1019 @@
+# Monitoring
+
+> This document mainly introduces the visualization operation and maintenance monitoring of TuGraph.
+
+## 1.Design Concept
+
+Visualization monitoring is not an indispensable part of TuGraph itself. Therefore, in the design, visualization monitoring is regarded as an application in the peripheral ecology of TuGraph to reduce the coupling with TuGraph database and its own impact. TuGraph visualization monitoring adopts the hottest open source solution - TuGraph Monitor + Prometheus + Grafana. Wherein, TuGraph Monitor is the client of TuGraph service, which initiates Procedure requests to TuGraph service through TCP connection. After receiving the request, TuGraph service collects statistics of CPU, memory, disk, IO, and number of requests on its own machine and responds. TuGraph Monitor packages the index data received from TuGraph into the format required by Prometheus and saves it in memory, waiting for Prometheus to obtain it through HTTP request. Prometheus regularly obtains packaged request data from TuGraph Monitor through HTTP requests and saves it in its own time-series database according to the time obtained. Grafana can obtain the statistical data within a certain time period from Prometheus according to user configuration and draw easy-to-understand graphics on the web interface to display the final result. In the entire request chain, the active acquisition, i.e. pull model, is used, which has the advantages of minimizing the coupling between data producers and data consumers, making development simpler, and not requiring data producers to consider the data processing capability of data consumers. Even if the data processing ability of a consumer is weak, it will not be crushed by the data producer producing data too fast. One of the shortcomings of the active pulling model is that the real-time performance of the data is insufficient. However, in this scenario, data does not have high real-time requirements.
+
+### 1.1.TuGraph
+
+TuGraph database provides the ability to collect multiple data information, such as disk, memory, network IO, and query requests, in the service machine, and provides queries through standard Procedure methods. This action of collecting data only occurs when a user queries through the interface, avoiding the impact of TuGraph monitoring service on user business query requests when users do not need the indicators on TuGraph monitoring service machine.
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor is a tool in the peripheral ecology of TuGraph. It communicates with TuGraph through C++ RPC Client as one of the many users of TuGraph and queries the performance indicators of the machine where TuGraph service is located through the Procedure query interface. It packages the results returned by TuGraph into the data model required by Prometheus and waits for Prometheus to obtain them. Users can set the query time interval to minimize the impact of obtaining monitoring indicators on business queries.
+
+### 1.3.Prometheus
+
+Prometheus is an open-source monitoring platform with a dedicated time-series database. It regularly obtains statistical indicators from the TuGraph Monitor service through HTTP requests and saves them in its own time-series database. For details, please refer to the official website:[https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana is an open-source visualization and analysis software. It can obtain data from multiple data sources, including Prometheus, and can convert data in the time-series database into tools for beautiful graphics and visual effects. For specific information, please refer to the official website:[https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.Deployment Solution
+
+### 2.1.Step 1
+
+Start the TuGraph service. For details, please refer to the documentation:[https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.Step 2
+
+Start the TuGraph Monitor tool. The startup command is as follows:
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+The meanings of the parameters are as follows:
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.Step Three
+
++ Download the Prometheus tarball that matches your machine architecture and system version. Download link:[https://prometheus.io/download/](https://prometheus.io/download/)
+
++ Unzip the tarball with the following command:
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ Modify the configuration file prometheus.yml and add the following configuration to enable Prometheus to scrape performance data packaged by TuGraph Monitor.
+
+```
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ Start Prometheus. You can obtain specific startup parameters with the following command:
+
+```shell
+./prometheus -h
+```
+
++ Verify if the Prometheus service is running properly by logging into the Prometheus service through the web portal, and querying whether the monitoring index resources_report has been obtained. If the data can be successfully queried, the operation is successful.
+
+### 2.4.Step Four
+
++ Download the Grafana installation package that matches your machine architecture and system version. Download link:[https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ Install Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Start Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Configure Grafana. First, configure the IP address of Prometheus in the data source settings. After the configuration is completed, verify if the data source is connected successfully by testing the connection function. Then, import the following template and modify the correct interface IP and port in the page according to the actual situation. Finally, set the refresh time and monitoring time range according to the actual situation.
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana",
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{label_name}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "memory",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \n  QPS exceeds 1000",
+        "name": "Request statistics alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "Request statistics",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "disk",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \nCPU usage rate exceeds 90%",
+        "name": "CPU usage rate alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU usage rate",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] Disk IO exceeds 10MB/S",
+        "name": "Disk IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph Monitoring Web",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+Verify the effect by refreshing the browser page. If the pie chart and line chart are displayed correctly, the configuration is completed.
+
+## 3.Future Plans
+
+Currently, visual monitoring only supports single-machine monitoring and can monitor performance indicators such as CPU, disk, network IO, and request QPS of the machine on which the service is located. In the future, monitoring for HA clusters will be implemented, and more meaningful indicators will be included in the monitoring scope.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
new file mode 100644
index 0000000000..a9c069a34a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
@@ -0,0 +1,439 @@
+# TuGraph DataX
+
+> This document mainly introduces the installation, compilation and usage examples of TuGraph DataX
+
+## 1.Introduction
+
+On the basis of Ali's open source DataX, TuGraph implements the support of writing plug-ins and jsonline data format, and other data sources can write data into TuGraph through DataX.
+DataX introduces reference [https://github.com/alibaba/DataX] (https://github.com/alibaba/DataX)
+Supported features include:
+
+- Import TuGraph from various heterogeneous data sources such as MySQL, SQL Server,Oracle, PostgreSQL, HDFS, Hive, HBase, OTS, ODPS, Kafka and so on. 
+  
+- Import TuGraph to the corresponding target source (to be developed)
+
+## 2.Compile and Install
+
+```bash
+git clone git@code.alipay.com:fma/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+The compiled DataX file is in the target directory
+
+## 3.Text data imported into TuGraph with DataX
+
+Using the data from the lgraph_import section of the TuGraph manual as an example, we have three csv data files, as follows:
+`actors.csv`
+
+```
+
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+
+```
+
+`movies.csv`
+
+```
+
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+
+```
+
+`roles.csv`
+
+```
+
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+
+```
+
+Then create three DataX job profiles:
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`/lgraph_server -c lgraph_standalone.json -d 'run'` 'Start TuGraph and run the following commands in sequence:
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## MySQL's data imported into TuGraph with DataX
+
+We create the following table of movies under 'test' database
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+Insert some data into the table
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+Create a DataX job configuration file
+
+`job_mysql_to_tugraph.json`
+
+**Configuring Field**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**Write simple sql**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` Start TuGraph and run the following command：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
new file mode 100644
index 0000000000..46afb76206
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph Explorer
+
+> TuGraph Explorer has merged to [TuGraph Browser](../../4.user-guide/1.tugraph-browser.md)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md
new file mode 100644
index 0000000000..0c4e8fc28b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md
@@ -0,0 +1,65 @@
+# Log
+
+> This document mainly introduces the logging function of TuGraph.
+
+## 1.Introduction
+
+TuGraph keeps two types of logs: server logs and audit logs. Server logs record human-readable server status information, while audit logs maintain encrypted information for every operation performed on the server.
+
+## 2.Server log
+
+### 2.1.Server Log Categories
+
+The server logs are currently divided into three categories: `general log`, `debug log`, and `query log`.
+
+The `general log` is for regular users and includes important information related to the database startup and shutdown, such as configuration information during database startup, the port listened for services, and whether the database has successfully started or shut down. It provides a clear indication of whether the database is running.
+
+The `debug log` is for database developers and includes debug-related information generated during runtime, such as network requests received by the database and the execution process of queries. It helps developers during development and developers can control the log level through the `verbose` configuration item.
+
+(to be implemented)The `query log` is for business developers and includes information about each query executed by database and the performance-related information of the database when executing the query, such as query execution time. It can filter queries whose execution time is lower than the specified threshold time through configuration setting, making it easier for business developers to analyze performance.
+
+### 2.2.Server Log Configuration Items
+The output directory of server logs can be specified through the `log_dir` configuration item. The level of detail in the debug log can be specified through the `verbose` configuration item.
+
+The `log_dir` configuration item is empty by default. If `log_dir` is empty, then all logs will be write to the console. If `log_dir` is manually specified, the following log folder structure will be generated in the corresponding path:
+
+```
+.
+├── debug.log
+├── general.log
+├── query.log(TODO)
+└── history_logs
+    ├── debug_logs
+    ├── general_logs
+    └── query_logs(TODO)
+```
+
+The `general log` is wrote into `general.log` file. The `debug log` is wrote into `debug.log` file. The `query log` is wrote into `query.log` file.
+
+The maximum size of a single log file is 64mb, and when it reaches the maximum file size, it will be rotated into the `history_logs` folder. `general.log` is rotated into the `general_logs` folder, and `debug.log` is rotated into the `debug_logs` folder.
+
+The `verbose` configuration item controls the level of detail of log records in `debug log`, and is divided into three levels of `0, 1, 2`. Ther verbosity of log record grows as the number grows. The default level is `2`, which records the most detailed log records. The server will print all log records in `DEBUG` level and above, and include the `[filename:function:line_number]` of the log records being printed, which is convenient for debugging. When the level is set to `1`, the server will only print major events log records in `INFO` level and above. When the level is set to `0`, the server will only print error log records in `ERROR` level and above.
+
+### 2.3.Example of Server Log Output Macro Usage
+
+If the developer wants to add logs to the code during development, they can refer to the following example:
+
+```
+#include "tools/lgraph_log.h" // add log dependency.
+
+
+void LogExample() {
+    // The log module has been initialized during the database startup, and developers can directly call the macro.
+    // The log level is divided into six levels: TRACE, DEBUG, INFO, WARNING, ERROR, and FATAL.
+
+    GENERAL_LOG(INFO) << "This is a info level general log message."; // general log的输出宏
+
+    DEBUG_LOG(ERROR) << "This is a error level debug log message."; // debug log的输出宏
+}
+```
+
+You can also refer to the log macro usage in test/test_lgraph_log.cpp.
+
+## 3.Audit log
+
+Audit logs record each request and response, as well as the user who sent the request and when the request received. Audit logging can only be turned on or off. The results can be queried using the TuGraph visualization tool and the REST API.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst
new file mode 100644
index 0000000000..4be6ec9ad4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Ecosystem-Tools
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/1.cypher.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/1.cypher.md
new file mode 100644
index 0000000000..7df4af1bcb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/1.cypher.md
@@ -0,0 +1,2530 @@
+# Cypher API
+
+> This document mainly introduces the detailed usage instructions of TuGraph-Cypher.
+
+## Table of contents
+- [1.Operators](#1operators)
+  - [1.1.Summary](#11summary)
+  - [1.2.General Operators](#12general-operators)
+  - [1.3.Mathematical Operators](#13mathematical-operators)
+  - [1.4.Comparison Operators](#14comparison-operators)
+  - [1.5.String Specific Comparison Operators](#15string-specific-comparison-operators)
+  - [1.6.Boolean Operators](#16boolean-operators)
+  - [1.7.String Operators](#17string-operators)
+  - [1.8.List Operators](#18list-operators)
+- [2.Clauses](#2clauses)
+  - [2.1.Summary](#21summary)
+  - [2.2.Match](#22match)
+  - [2.3.Return](#23return)
+  - [2.4.Where](#24where)
+  - [2.5.Skip](#25skip)
+  - [2.6.Limit](#26limit)
+  - [2.7.Create](#27create)
+  - [2.8.Callyield](#28callyield)
+  - [2.9.Union](#29union)
+- [3.Functions](#3functions)
+  - [3.1.Whole List of Functions](#31whole-list-of-functions)
+  - [3.2.Predicate Functions](#32predicate-functions)
+  - [3.3.Scalar Functions](#33scalar-functions)
+  - [3.4.Aggregating Functions](#34aggregating-functions)
+  - [3.5.List Funtions](#35list-funtions)
+  - [3.6.Mathematical Functions](#36mathematical-functions)
+- [4.Extensions to Opencypher](#4extensions-to-opencypher)
+- [5.Procedures](#5procedures)
+  - [5.1.Procedures Demos](#51procedures-demos)
+  - [5.2.Whole List of Procedures](#52whole-list-of-procedures)
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators support progress overview：
+
+| category                             | supported                                                                                                                                                       | unsupported                                 |
+| ------------------------------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------- |
+| General operators                    | <code>DISTINCT</code>, <code>.</code> for property access                                                                                                       | <code>[]</code> for dynamic property access |
+| Mathematical operators               | <code>+</code>, <code>-</code>, <code>\*</code>, <code>/</code>, <code>%</code>, <code>^</code>                                                                 |                                             |
+| Comparison operators                 | <code>=</code>, <code>&lt;&gt;</code>, <code>&lt;</code>, <code>&gt;</code>, <code>⇐</code>, <code>&gt;=</code>, <code>IS NULL</code>, <code>IS NOT NULL</code> |                                             |
+| String-specific comparison operators | <code>STARTS WITH</code>, <code>ENDS WITH</code>, <code>CONTAINS</code>, <code>REGEXP</code>                                                                    |                                             |
+| Boolean operators                    | <code>AND</code>, <code>OR</code>, <code>XOR</code>, <code>NOT</code>                                                                                           |                                             |
+| String operators                     | <code>+</code> for concatenation                                                                                                                                |                                             |
+| List operators                       | <code>+</code> for concatenation, <code>IN</code> to check existence of an element in a list, <code>[]</code> for accessing element(s)                          |                                             |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+  ```
+  CREATE (a:Person {name: 'Anne', eyeColor: 'blue'}),
+         (b:Person {name: 'Bill', eyeColor: 'brown'}),
+         (c:Person {name: 'Carol', eyeColor: 'blue'})
+  ```
+
+  ```
+  MATCH (p:Person ) RETURN DISTINCT p.eyeColor
+  ```
+
+- ✓ Accessing properties of a nested literal map using the `.` operator
+
+  ```
+  WITH {person: {name: 'Anne', age: 25}} AS p
+  RETURN p.person.name
+  ```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+  ```
+  CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+         (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+         (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+  ```
+  ```
+  MATCH (restaurant:Restaurant), (category:Category)
+  WHERE restaurant["rating_" + category.name] > 6
+  RETURN DISTINCT restaurant.name
+  ```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator `^`
+
+  ```
+  WITH 2 AS number, 3 AS exponent
+  RETURN number ^ exponent AS result
+  ```
+
+- ✓ Using the unary minus operator `-`
+  ```
+  WITH -3 AS a, 4 AS b
+  RETURN b - a AS result
+  ```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+  ```
+  WITH 4 AS one, 3 AS two
+  RETURN one > two AS result
+  ```
+
+### 1.5.String-specific comparison operators
+
+<span id="jump"></span>
+
+- ✓ Using STARTS WITH to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate STARTS WITH 'Jo'
+  RETURN candidate
+  ```
+
+- ✓ Using REGEXP to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate REGEXP 'Jo.*n'
+  RETURN candidate
+  ```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+  ```
+  WITH [2, 4, 7, 9, 12] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number = 4 OR (number > 6 AND number < 10)
+  RETURN number
+  ```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+  More details on string-specific comparison operators can be found [here](#jump)
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+  ```
+  RETURN [1,2,3,4,5]+[6,7] AS myList
+  ```
+- ✓ Using IN to check if a number is in a list
+
+  ```
+  WITH [2, 3, 4, 5] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number IN [2, 3, 8]
+  RETURN number
+  ```
+
+- ✓ Accessing elements in a list using the [] operator
+  ```
+  WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+  RETURN names[1..3] AS result
+  ```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses support progress list：
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>grammar</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="3"><p>Reading clauses</p></td>
+			<td><p>MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>OPTIONAL MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>MANDATORY MATCH</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="3"><p>Projecting clauses</p></td>
+			<td><p>RETURN … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>WITH … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>UNWIND … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="4"><p>Reading sub-clauses</p></td>
+			<td><p>WHERE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>ORDER BY [ASC[ENDING] / DESC[ENDING]]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>SKIP</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>LIMIT</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>Writing clauses</p></td>
+			<td><p>CREATE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>DETACH DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>SET</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>REMOVE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Reading/Writing clauses</p></td>
+			<td><p>MERGE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>CALL […YIELD]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Set operations</p></td>
+			<td><p>UNION</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>UNION ALL</p></td>
+			<td><p>supported</p></td>
+		</tr>
+	</tbody>
+</table>
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+    ```
+    MATCH (n)
+    RETURN n
+    ```
+  - ✓ Get all nodes with a label
+    ```
+    MATCH (movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Related nodes
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+  - ✓ Match with labels
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[]->(movie)
+    RETURN movie.title
+    ```
+  - ✓ Directed relationships and variable
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[r]->(movie)
+    RETURN type(r)
+    ```
+  - ✓ Match on relationship type
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})<-[:ACTED_IN]-(actor)
+    RETURN actor.name
+    ```
+  - ✓ Match on multiple relationship types
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[:ACTED_IN|:DIRECTED]-(person)
+    RETURN person.name
+    ```
+  - ✓ Match on relationship type and use a variable
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[r:ACTED_IN]-(actor)
+    RETURN r.role
+    ```
+
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+    ```
+    MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+    RETURN type(r)
+    ```
+  - ✓ Multiple relationships
+    ```
+    MATCH (charlie {name: 'Charlie Sheen'})-[:ACTED_IN]->(movie)<-[:DIRECTED]-(director)
+    RETURN movie.title, director.name
+    ```
+  - ✓ Variable-length relationships
+    ```
+    MATCH (martin {name: 'Charlie Sheen'})-[:ACTED_IN*1..3]-(movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Relationship variable in variable-length relationships
+    ```
+    MATCH p = (actor {name: 'Charlie Sheen'})-[:ACTED_IN*2]-(co_actor)
+    RETURN relationships(p)
+    ```
+  - ❏ Match with properties on a variable-length path
+    ```
+    MATCH p = (charlie:Person)-[* {blocked:false}]-(martin:Person)
+    WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+    RETURN p
+    ```
+  - ✓ Zero-length paths
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})-[*0..1]-(x)
+    RETURN x
+    ```
+  - ✓ Named paths
+
+    ```
+    MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+    ```
+
+  - ✓ Matching on a bound relationship
+
+    ```
+    MATCH (a)-[r]-(b)
+    WHERE id(r)= 0
+    RETURN a,b
+    ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (oliver:Person {name: 'Oliver Stone'}),
+    p = shortestPath((martin)-[*..15]-(oliver))
+    RETURN p
+    ```
+  - ✓ All shortest paths
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (michael:Person {name: 'Michael
+    Douglas'}), p = allShortestPaths((martin)-[*]-(michael))
+    RETURN p
+    ```
+
+- Get node or relationship by id
+
+  - ✓ Node by id
+    ```
+    MATCH (n)
+    WHERE id(n)= 0
+    RETURN n
+    ```
+  - ☒ Relationship by id
+    ```
+    MATCH ()-[r]->()
+    WHERE id(r) = 0
+    RETURN r
+    ```
+  - ✓ Multiple nodes by id
+    ```
+    MATCH (n)
+    WHERE id(n) IN [0, 3, 5]
+    RETURN n
+    ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+  ```
+  MATCH (n {name: 'B'}) RETURN n
+  ```
+
+  > **Note**
+  >
+  > Return `id` of n.
+
+- ✓ Return relationships
+
+  ```
+  MATCH (n {name: 'A'})-[r:KNOWS]->(c)
+  RETURN r
+  ```
+
+  > **Note**
+  >
+  > Return `EdgeUid` of r.
+
+- ✓ Return property
+  ```
+  MATCH (n {name: 'A'}) RETURN n.name
+  ```
+- ❏ Return all elements
+  ```
+  MATCH p = (a {name: 'A'})-[r]->(b)
+  RETURN *
+  ```
+- ❏ Variable with uncommon characters
+  ```
+  MATCH (`This isn\'t a common variable`)
+  WHERE `This isn\'t a common variable`.name = 'A'
+  RETURN `This isn\'t a common variable`.happy
+  ```
+- ✓ Aliasing a field
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age AS SomethingTotallyDifferent
+  ```
+- ✓ Optional properties
+  ```
+  MATCH (n)
+  RETURN n.age
+  ```
+- ❏ Other expressions
+
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age > 30, "I'm a literal", (a)-[]->()
+  ```
+
+  `(a)-[]->()` not supported.
+
+- ✓ Unique results
+  ```
+  MATCH (a {name: 'A'})-[]->(b)
+  RETURN DISTINCT b
+  ```
+
+### 2.4.WHERE
+
+- Basic usage
+
+  - ✓ Boolean operations
+    ```
+    MATCH (n)
+    WHERE n.name = 'Peter' XOR (n.age < 30 AND n.name = 'Tobias') OR NOT (n.name =
+    'Tobias' OR n.name = 'Peter')
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node label
+    ```
+    MATCH (n)
+    WHERE n:Swedish
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node property
+    ```
+    MATCH (n)
+    WHERE n.age < 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on relationship property
+    ```
+    MATCH (n)-[k:KNOWS]->(f)
+    WHERE k.since < 2000
+    RETURN f.name, f.age, f.email
+    ```
+  - ❏ Filter on dynamically-computed property
+    ```
+    WITH 'AGE' AS propname
+    MATCH (n)
+    WHERE n[toLower(propname)]< 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Property existence checking
+    ```
+    MATCH (n)
+    WHERE exists(n.belt)
+    RETURN n.name, n.belt
+    ```
+
+- String matching
+
+  - ✓ Match the beginning of a string
+    ```
+    MATCH (n)
+    WHERE n.name STARTS WITH 'Pet'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match the ending of a string
+    ```
+    MATCH (n)
+    WHERE n.name ENDS WITH 'ter'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match anywhere within a string
+    ```
+    MATCH (n)
+    WHERE n.name CONTAINS 'ete'
+    RETURN n.name, n.age
+    ```
+  - ✓ String matching negation
+    ```
+    MATCH (n)
+    WHERE NOT n.name ENDS WITH 's'
+    RETURN n.name, n.age
+    ```
+
+- Using path patterns in `WHERE`
+
+  - ✓ Filter on patterns
+    ```
+    MATCH (tobias {name: 'Tobias'}), (others)
+    WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+    RETURN others.name, others.age
+    ```
+  - ✓ Filter on patterns using NOT
+    ```
+    MATCH (persons), (peter {name: 'Peter'})
+    WHERE NOT (persons)-[]->(peter)
+    RETURN persons.name, persons.age
+    ```
+  - ✓ Filter on patterns with properties
+
+    ```
+    MATCH (n)
+    WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+    RETURN n.name, n.age
+    ```
+
+  - ✓ Filter on relationship type
+    ```
+    MATCH (n)-[r]->()
+    WHERE n.name='Andres' AND type(r) STARTS WITH 'K'
+    RETURN type(r), r.since
+    ```
+
+- Lists
+
+  - ✓ IN operator
+    ```
+    MATCH (a)
+    WHERE a.name IN ['Peter', 'Tobias']
+    RETURN a.name, a.age
+    ```
+
+- Missing properties and values
+
+  - ✓ Default to false if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white'
+    RETURN n.name, n.age, n.belt
+    ```
+  - ✓ Default to true if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+    ORDER BY n.name
+    ```
+  - ✓ Filter on null
+    ```
+    MATCH (person)
+    WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+    person.belt
+    ```
+
+- Using ranges
+
+  - ✓ Simple range
+    ```
+    MATCH (a)
+    WHERE a.name >= 'Peter'
+    RETURN a.name, a.age
+    ```
+  - ✓ Composite range
+    ```
+    MATCH (a)
+    WHERE a.name > 'Andres' AND a.name < 'Tobias'
+    RETURN a.name, a.age
+    ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 3
+  ```
+- ✓ Return middle two records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 1
+  LIMIT 2
+  ```
+- ✓ Using an expression with SKIP to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP toInteger(3*rand())+ 1
+  ```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT 3
+  ```
+- ✓ Using an expression with LIMIT to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT toInteger(3 * rand())+ 1
+  ```
+
+### 2.7.CREATE
+
+- Create nodes
+
+  > **Note**
+  >
+  > TuGraph does not support creating empty nodes and does not support multiple labels.
+
+  - ☒ Create single node
+    ```
+    CREATE (n)
+    ```
+  - ☒ Create multiple nodes
+    ```
+    CREATE (n), (m)
+    ```
+  - ✓ Create a node with a label
+    ```
+    CREATE (n:Person)
+    ```
+  - ☒ Create a node with multiple labels
+    ```
+    CREATE (n:Person:Swedish)
+    ```
+  - ✓ Create node and add labels and properties
+    ```
+    CREATE (n:Person {name: 'Andres', title: 'Developer'})
+    ```
+  - ✓ Return created node
+    ```
+    CREATE (a {name: 'Andres'})
+    RETURN a
+    ```
+
+- Create relationships
+
+  - ✓ Create a relationship between two nodes
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE]->(b)
+    ```
+  - ✓ Create a relationship and set properties
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE {name: a.name + '<->' + b.name}]->(b)
+    ```
+  - ✓ Create a full path
+    ```
+    CREATE p = (andres {name:'Andres'})-[:WORKS_AT]->(neo)<-[:WORKS_AT]-(michael {name:'Michael'})
+    RETURN p
+    ```
+
+- Use parameters with CREATE
+
+  - ❏ Create node with a parameter for the properties
+    ```
+    CREATE (n:Person $props)
+    RETURN n
+    ```
+  - ☒ Create multiple nodes with a parameter for their properties
+    ```
+    UNWIND $props AS map
+    CREATE (n)
+    SET n = map
+    ```
+    cannot create vertex without label.
+
+### 2.8.CALL\[…YIELD\]
+
+- ✓ Call a procedure using CALL
+  ```
+  CALL db.vertexLabels
+  ```
+- ✓ View the signature for a procedure
+  ```
+  CALL dbms.procedures() YIELD name, signature
+  WHERE name='dbms.listConfig'
+  RETURN signature
+  ```
+- ❏ Call a procedure using a quoted namespace and name
+  ```
+  CALL `db`.`vertexLabels`
+  ```
+- ✓ Call a procedure with literal arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+  ```
+- ❏ Call a procedure with parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+  ```
+- ❏ Call a procedure with mixed literal and parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+  ```
+- ✓ Call a procedure with literal and default arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+  ```
+- ✓ Call a procedure within a complex query using CALL…YIELD
+  ```
+  CALL db.vertexLabels() YIELD label
+  RETURN count(label) AS numLabels
+  ```
+- ✓ Call a procedure and filter its results
+  ```
+  CALL db.vertexLabels() YIELD label
+  WHERE label CONTAINS 'User'
+  RETURN count(label) AS numLabels
+  ```
+- ❏ Call a procedure within a complex query and rename its outputs
+  ```
+  CALL db.propertyKeys() YIELD propertyKey AS prop
+  MATCH (n)
+  WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+  ```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION ALL MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+- ❏ Combine two queries and remove duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION
+  MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>function</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="5"><p>Predicate functions</p></td>
+			<td><p>exists()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>all()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>any()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>single()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>none()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="14"><p>Scalar functions</p></td>
+			<td><p>id()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>properties()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>head()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>last()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toBoolean()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>toFloat()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toInteger()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toString()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>type()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>startnode()</p></td>
+            <td><p></p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>size()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>length()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>label()</p></td>
+            <td><p>OpenCypher extension method</p></td>
+		</tr>
+        <tr class="even">
+			<td rowspan="12"><p>Aggregating functions</p></td>
+			<td><p>avg()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>collect()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>count()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>max()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>min()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>percentileCont()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>percentileDisc()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>stDev()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>stDevP()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+                <td><p>variance()</p></td>
+                <td></td>
+            </tr>
+        <tr class="odd">
+                <td><p>varianceP()</p></td>
+                <td></td>
+            </tr>
+        <tr class="even">
+                <td><p>sum()</p></td>
+                <td></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>List functions</p></td>
+			<td><p>keys()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>labels()</p></td>
+			<td><p></p></td>
+		</tr>
+	<tr class="odd">
+			<td><p>nodes()</p></td>
+			<td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>range()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>subscript()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="6"><p>Mathematical functions</p></td>
+			<td><p>abs()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>ceil()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>floor()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>rand()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>round()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>sign()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>String functions</p></td>
+			<td><p>/</p></td>
+			<td></td>
+		</tr>
+	</tbody>
+</table>
+
+### 3.2.Predicate functions
+
+- exists()
+
+  judge it whether a vertex or edge has the field .
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE exists(n.belt)
+  RETURN n.name, n.belt
+  ```
+
+  **Example output:**
+
+  | exists(name) |
+  | ------------ |
+  | true         |
+
+### 3.3.Scalar functions
+
+- id()
+
+  get the id of vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  RETURN id(a)
+  ```
+
+  **Example output:**
+
+  | vid |
+  | --- |
+  | 1   |
+  | 2   |
+  | ... |
+
+- properties()
+
+  get a map containing all the properties of a node or relationship.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  CREATE (p:Person {name: 'Stefan', city: 'Berlin'})
+  RETURN properties(p)
+  ```
+
+  **Example output:**
+
+  | properties                |
+  | ------------------------- |
+  | {name:Stefan,city:Berlin} |
+
+- head()
+
+  get the first element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, head(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | head(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "one"         |
+
+- last()
+
+  get the last element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, last(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | last(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "three"       |
+
+- toFloat()
+
+  Converts an integer or string value to a floating point number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toFloat('11.5'), toFloat('not a number')
+  ```
+
+  **Example output:**
+  | float |
+  | ----- |
+  | 11.5 |
+  |null|
+
+- toInteger()
+
+  Converts a floating point or string value to an integer value.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toInteger('2.3') AS integer
+  ```
+
+  **Example output:**
+
+  | integer |
+  | ------- |
+  | 2       |
+
+- toString()
+
+  Converts an integer, float, boolean value to a string.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toString(2.3)
+  ```
+
+- type()
+
+  get the string representation of the relationship type.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name = 'Alice'
+  RETURN type(r)
+  ```
+
+  **Example output:**
+
+  | type     |
+  | -------- |
+  | acted_in |
+  | acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+
+  Returns the average of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN avg(n.age)
+  ```
+
+  **Example output:**
+
+  | avg(n.born)        |
+  | ------------------ |
+  | 1869.2661654135338 |
+
+- collect()
+
+  Returns a list containing the values returned by an expression.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN collect(n.age)
+  ```
+
+  **Example output:**
+
+  | collect(n.born) |
+  | --------------- |
+  | [1967,...]      |
+
+- count()
+
+  Returns the number of values or records.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n {name: 'A'})-[]->(x)
+  RETURN labels(n), n.age, count(*)
+  ```
+
+  **Example output:**
+
+  | labels(n)  | n.age | count(\*) |
+  | ---------- | ----- | --------- |
+  | ["Person"] | 13    | 3         |
+
+- max()
+
+  Returns the maximum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN max(n.age)
+  ```
+
+  **Example output:**
+
+  | max(n.age) |
+  | ---------- |
+  | 44         |
+
+- min()
+
+  Returns the minimum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN min(n.age)
+  ```
+
+  **Example output:**
+
+  | min(n.age) |
+  | ---------- |
+  | 13         |
+
+- percentileCont()
+
+  Returns the percentile of a value over a group using linear interpolation.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileCont(n.age, 0.4)
+  ```
+
+  **Example output:**
+
+  | percentileCont(n.age, 0.4) |
+  | -------------------------- |
+  | 29                         |
+
+* percentileDisc()
+
+  Returns the nearest value to the given percentile over a group using a rounding method.
+
+  **Scope:** whole instance.
+
+  **Output:** the percentile of the given value over a group.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileDisc(n.age, 0.5)
+  ```
+
+  **Example output:**
+
+  | percentileDisc(n.age, 0.5) |
+  | -------------------------- |
+  | 33                         |
+
+* stDev()
+
+  Returns the standard deviation for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDev(n.age)
+  ```
+
+  **Example output:**
+
+  | stDev(n.age)       |
+  | ------------------ |
+  | 15.716233645501712 |
+
+* stDevP()
+
+  Returns the standard deviation for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDevP(n.age)
+  ```
+
+  **Example output:**
+
+  | stDevP(n.age)      |
+  | ------------------ |
+  | 12.832251036613439 |
+
+* variance()
+
+  Returns the variance for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN variance(n.age)
+  ```
+
+  **Example output:**
+
+  | variance(n.age) |
+  | --------------- |
+  | 247             |
+
+* varianceP()
+
+  Returns the variance for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN varianceP(n.age)
+  ```
+
+  **Example output:**
+
+  | varianceP(n.age) |
+  | ---------------- |
+  | 164.66666666667  |
+
+* sum()
+
+  Returns the sum of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN sum(n.age)
+  ```
+
+  **Example output:**
+
+  | sum(n.age) |
+  | ---------- |
+  | 90         |
+
+### 3.5.List Funtions:
+
+- keys()
+
+  get the field names of some vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN keys(a)
+  ```
+
+  **Example output:**
+
+  | keys(a)               |
+  | --------------------- |
+  | ["name","age","eyes"] |
+
+- labels()/label()
+
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN labels(a)
+  ```
+
+  **Example output:**
+
+  | labels                 |
+  | ---------------------- |
+  | ["Person","Developer"] |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice'})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+### 3.6.Mathematical functions
+
+- abs()
+
+  get the absolute value of some data.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a), (e)
+  WHERE a.name = 'Alice' AND e.name = 'Eskil'
+  RETURN a.age, e.age, abs(a.age - e.age)
+  ```
+
+  **Example output:**
+
+  | a.age | e.age | abs(a.age - e.age) |
+  | ----- | ----- | ------------------ |
+  | 38    | 41    | 1                  |
+
+- ceil()
+
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+  **Example input:**
+
+  ```
+  RETURN ceil(0.1)
+  ```
+
+  **Example output:**
+
+  | ceil(0.1) |
+  | --------- |
+  | 1.0       |
+
+- floor()
+
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN floor(0.9)
+  ```
+
+  **Example output:**
+
+  | floor(0.9) |
+  | ---------- |
+  | 0.0        |
+
+- round()
+
+  Returns the value of a number rounded to the nearest integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN round(3.141592)
+  ```
+
+  **Example output:**
+
+  | round |
+  | ----- |
+  | 3     |
+
+- rand()
+
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN rand()
+  ```
+
+  **Example output:**
+
+  | rand()             |
+  | ------------------ |
+  | 0.9797131960534085 |
+
+- sign()
+
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN sign(-17), sign(0.1)
+  ```
+
+  **Example output:**
+
+  | sign(-17) | sign(0.1) |
+  | --------- | --------- |
+  | -1        | 1         |
+
+## 4.Extensions To OpenCypher
+
+- Number of Labels
+
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+
+  - OpenCypher: One node/relationship may have 0 to many labels.
+
+- Schema.
+
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.Procedures
+
+### 5.1.procedures' demos
+
+- dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                               | name            |
+  | --------------------------------------- | --------------- |
+  | db.vertexLabels() :: (label::STRING)    | db.vertexLabels |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels   |
+  | db.indexes() :: (index::LIST)           | db.indexes      |
+  | ...                                     | ...             |
+
+- db.vertexLabels()
+
+  Lists all available labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+
+  **Example output:**
+
+  | label   |
+  | ------- |
+  | genre   |
+  | keyword |
+  | movie   |
+  | ...     |
+
+- db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edgeLabels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | edgeLabel |
+  | --------- |
+  | acted_in  |
+  | directed  |
+  | ...       |
+
+- db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter     | parameter type | description                   |
+  | ------------- | -------------- | ----------------------------- |
+  | label_name    | string         | name of vertex label          |
+  | primary_field | string         | primary field of vertex label |
+  | field_spec    | list           | specification of a field      |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+  **Output:** If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added label [Person]
+  ```
+
+- db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description                   |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field             |
+  | type       | string     | type of the field             |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name         | type   | optional |
+  | ------------ | ------ | -------- |
+  | id           | INT32  | false    |
+  | born         | INT32  | true     |
+  | name         | STRING | true     |
+  | poster_image | STRING | true     |
+
+- db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | label_type | string         | either 'vertex' or 'edge'                                             |
+  | label_name | string         | name of the label                                                     |
+  | extra      | string         | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list           | specification of a field                                              |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.
+  for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+- db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:**
+
+  | field_name | field_type | description                      |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description                   |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string          | either 'vertex' or 'edge'     |
+  | label_name  | string          | name of the label             |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description               |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string         | either 'vertex' or 'edge' |
+  | label_name       | string         | name of the label         |
+  | field_value_spec | list           | specification of a field  |
+
+  in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, 'optional']`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+  | field_spec | list           | specification of a field  |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelModFields(
+  'vertex',
+  'new_label',
+  ['birth_date', 'DATETIME', '1900-01-01 00:00:00'],
+  ['gender', 'BOOL', false])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description              |
+  | ---------------- | -------------- | ------------------------ |
+  | label_name       | string         | name of the label        |
+  | edge_constraints | string         | edge constraints         |
+  | field_spec       | list           | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for optional fields.
+
+- `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32,true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+- db.addIndex(label_name, field_name, is_unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | is_unique  | boolean        | Specifies whether the index is unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+- dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description          |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string         | the current password |
+  | new_password     | string         | new password         |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string         | the user's name |
+  | new_password | string         | new password    |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.createUser(user_name, password)
+
+  create new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | ------------------------ |
+  | user_name | string         | the new user name        |
+  | password  | string         | the password of new user |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string         | the user name to be deleted |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string         | the user name               |
+  | is.admin  | boolean        | the permission of this user |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       | ...      |
+
+- dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description           |
+  | --------- | -------------- | --------------------- |
+  | user.user | string         | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+- dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+  a list of ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host         |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...          |
+
+- dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been deleted.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description                      |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string         | the name of new subgraph         |
+  | description | string         | description of new subgraph      |
+  | max_size_GB | integer        | Upper limit of subgraph capacity |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+  | config     | map            | the configuration to be modified     |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.listGraphs()
+
+  get all subgraph in this graph database .
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.config.list()
+
+  get some config of this graph database .
+
+  **Output:**
+
+  a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  | --------- | ------- |
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       | ...     |
+
+- dbms.config.update(updates)
+
+  get some config of this graph database .
+
+  **Output:**
+
+  If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+      enable_ip_check:false,
+      durable:true,
+      optimistic_txn:true,
+      enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+- dbms.takeSnapshot()
+
+  take the snapshot on this current graph database.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+- dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path                       |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+- algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                                                             |
+  | --------- | -------------- | --------------------------------------------------------------------------------------- |
+  | startNode | Node           | the source node of paths                                                                |
+  | endNode   | Node           | the destination node paths                                                              |
+  | config    | MAP            | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+  If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2         | 1         |
+
+- algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+- algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                               |
+  | --------- | -------------- | --------------------------------------------------------- |
+  | id        | ANY            | the id of vertexes or edges , the id must be variable     |
+  | config    | MAP            | the configuration of this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or it is an edge id.
+
+  **Output:**
+
+  If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.Whole List Of Procedures
+
+| Name                                  | Description                                                          | Signature                                                                                                                                                        |
+|---------------------------------------|----------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.vertexLabels                       | list all vertex labels                                               | db.vertexLabels() :: (label::STRING)                                                                                                                             |
+| db.edgeLabels                         | list all edge labels                                                 | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                          |
+| db.indexes                            | list all indexes                                                     | db.indexes() :: (label::STRING,field::STRING,unique::BOOLEAN)                                                                                                    |
+| db.warmup                             | warm up the DB                                                       | db.warmup() :: (time_used::STRING)                                                                                                                               |
+| db.createVertexLabel                  | create a vertex label                                                | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                           |
+| db.createLabel                        | create a vertex/edge label                                           | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                      |
+| db.getLabelSchema                     | get the schema of label                                              | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                        |
+| db.getVertexSchema                    | get the schema of vertex label                                       | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                               |
+| db.getEdgeSchema                      | get the schema of edge label                                         | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                 |
+| db.deleteLabel                        | delete vertex/edge label                                             | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                |
+| db.alterLabelDelFields                | delete some fields of a label on a subgraph                          | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                     |
+| db.alterLabelAddFields                | add some fields of a label on a subgraph                             | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                          |
+| db.alterLabelModFields                | modify some fields of a label on a subgraph                          | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                |
+| db.createEdgeLabel                    | create a edge label                                                  | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                              |
+| db.addIndex                           | add an index                                                         | db.addIndex(label_name::STRING,field_name::STRING,is_unique::BOOLEAN) :: (::VOID)                                                                                |
+| db.deleteIndex                        | delete an index                                                      | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                |
+| db.backup                             | backup the db                                                        | db.backup(destination::STRING) :: ()                                                                                                                             |
+| dbms.procedures                       | list all procedures                                                  | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                            |
+| dbms.security.changePassword          | change current user password                                         | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                          |
+| dbms.security.changeUserPassword      | change user password                                                 | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                             |
+| dbms.security.createUser              | create an account                                                    | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                         |
+| dbms.security.deleteUser              | delete an account                                                    | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.listUsers               | list all accounts                                                    | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                  |
+| dbms.security.showCurrentUser         | get current user name                                                | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                        |
+| dbms.security.getUserPermissions      | get the permissions of a specified user                              | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                          |
+| dbms.graph.createGraph                | create a subgraph                                                    | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                |
+| dbms.graph.modGraph                   | modify the config of a subgraph                                      | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                  |
+| dbms.graph.deleteGraph                | delete a subgraph                                                    | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                           |
+| dbms.graph.listGraphs                 | list all subgraphs                                                   | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                               |
+| dbms.graph.getGraphInfo               | get the information of a specified graph                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                             |
+| dbms.security.addAllowedHosts         | add to the trust list                                                | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                 |
+| dbms.security.deleteAllowedHosts      | remove from the trust list                                           | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                      |
+| dbms.security.listAllowedHosts        | list the trust list                                                  | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                               |
+| dbms.config.update                    | update the configuration                                             | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                            |
+| dbms.config.list                      | list the configuration                                               | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                  |
+| algo.shortestPath                     | get a shortest path between two vertexes                             | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                            |
+| algo.allShortestPaths                 | get all the shortest paths between two vertexes                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                             |
+| algo.native.extract                   | get the field values of a list of vertexes or edges specified id     | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                         |
+| db.flushDB                            | flush the db                                                         | db.flushDB() :: (::VOID)                                                                                                                                         |
+| dbms.security.listRoles               | list all roles                                                       | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                  |
+| dbms.security.createRole              | create a role                                                        | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                             |
+| dbms.security.deleteRole              | delete a role                                                        | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.getRoleInfo             | get the role information                                             | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                      |
+| dbms.security.disableRole             | enable/disable the role                                              | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.modRoleDesc             | modify the description of a role                                     | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.rebuildRoleAccessLevel  | rebuild the user subgraph access rights                              | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                 |
+| dbms.security.modRoleAccessLevel      | modify the user subgraph access rights                               | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                     |
+| dbms.security.modRoleFieldAccessLevel | modify the user property access rights                               | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)          |
+| dbms.security.getUserInfo             | get the user information                                             | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                      |
+| dbms.security.getUserMemoryUsage      | get the memory usage for a user                                      | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                        |
+| dbms.security.disableUser             | enable/disable the user                                              | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.setCurrentDesc          | set the current user description                                     | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.setUserDesc             | set user description                                                 | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.setUserMemoryLimit      | set user memory limit                                                | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                  |
+| dbms.security.deleteUserRoles         | delete roles from the user                                           | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                              |
+| dbms.security.rebuildUserRoles        | rebuild the relationship between the user and the role               | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                             |
+| dbms.security.addUserRoles            | add the user roles                                                   | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                 |
+| db.plugin.loadPlugin                  | load a plugin                                                        | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN, version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | unload a plugin                                                      | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                      |
+| db.plugin.listPlugin                  | list all plugins                                                     | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | get the information of a specified plugin                            | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                   |
+| db.plugin.callPlugin                  | execute the plugins                                                  | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)             |
+| db.importor.dataImportor              | import vertex/edge data                                              | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                      |
+| db.importor.schemaImportor            | import vertex/edge schema                                            | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                      |
+| dbms.meta.count                       | get the total number of vertex and edge                              | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                          |
+| dbms.meta.countDetail                 | get the number of vertex and edge for each label                     | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                |
+| dbms.meta.refreshCount                | recount the number of vertex and edge, stop writing during the count | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                          |
+| dbms.task.listTasks                   | list running tasks                                                   | dbms.task.listTasks()::(tasks::LIST)                                                                                                                             |
+| dbms.task.terminateTask               | terminate task                                                       | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                               |
+| dbms.ha.clusterInfo                   | get cluster info in HA mode                                          | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                |
+| db.dropDB                             | empty the db                                                         | db.dropDB() :: (::VOID)                                                                                                                                          |
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md
new file mode 100644
index 0000000000..ab5ed72369
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md
@@ -0,0 +1,18 @@
+# Introduction to ISO GQL
+
+Graph Query Language (GQL) is an upcoming International Standard language for property graph querying. It builds on the foundations of SQL and integrates proven ideas from the existing [openCypher, PGQL, GSQL, and G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/) languages. The standard is currently in the draft stage.
+
+TuGraph has implemented GQL based on the [ISO GQL (ISO/IEC 39075) Antlr4 grammar file](https://github.com/TuGraph-family/gql-grammar). It includes some extensions and modifications. Not all GQL syntax is fully supported at the moment, but we will continue to improve and enhance it in the future.
+
+## List of Clauses
+
+| Category            | Clauses        |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md
new file mode 100644
index 0000000000..99b03a27fd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md
@@ -0,0 +1,100 @@
+# MATCH
+
+The `MATCH` clause is the most basic clause in GQL, and almost all queries are expanded through `MATCH`.
+
+The `MATCH` clause is used to specify the matching pattern to search in the graph, to match vertices or paths that meet certain conditions.
+
+## Basic Usage
+
+### Vertex basics
+
+#### Get all vertices
+
+```
+MATCH (n)
+RETURN n
+```
+
+#### Get all vertices with a label
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+#### Vertex matching with property
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### Vertex matching with filter
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+### Edge basics
+
+#### Edge pointing right
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+#### Edge pointing left
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+#### Edge matching with filter
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+return
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+### Path matching
+
+#### Variable length
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+return
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md
new file mode 100644
index 0000000000..586676ea16
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md
@@ -0,0 +1,30 @@
+# OPTIONAL MATCH
+
+The `OPTIONAL MATCH` clause matches a graph pattern and returns `null` if there is no match.
+
+## Basic Usage
+
+### Match found
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+### Match Not Found
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+return
+
+```JSON
+[{"n.birthyear":null}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md
new file mode 100644
index 0000000000..3ba96e8a95
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md
@@ -0,0 +1,110 @@
+# RETURN
+
+The `RETURN` clause specifies the results to be returned, including vertices, edges, paths, properties, etc.
+
+## Basic Usage
+
+### Return vertices
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+return
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+### Return edges
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+return
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+### Return property
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+### Uncommon string used as variable name
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+### Alias
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+return
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+### Optional property
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+### Other expressions
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+return
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+### Distinct
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+return
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md
new file mode 100644
index 0000000000..e6222e5a5f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md
@@ -0,0 +1,21 @@
+# NEXT
+
+The `NEXT` clause is used to connect multiple clauses.
+
+## Basic Usage
+
+### Connecting MATCH clauses
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md
new file mode 100644
index 0000000000..6cd6c67fe5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md
@@ -0,0 +1,48 @@
+# WHERE
+
+`WHERE` clause is used to filter records.
+
+## Baisc Usage
+
+### Filter vertex
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+returns
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+### Filter edge
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+returns
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+### Boolean expressions
+
+`AND`, `OR`, `XOR`, and `NOT` Boolean expressions can be used in the `WHERE` clause to filter data.
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+returns
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md
new file mode 100644
index 0000000000..543270a624
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md
@@ -0,0 +1,19 @@
+# ORDER BY
+
+`ORDER BY` is a clause of `RETURN` that sorts the output result.
+
+## Basic Usage
+
+### Sorting the Result
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+return
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md
new file mode 100644
index 0000000000..16d6dbb2b7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md
@@ -0,0 +1,30 @@
+# SKIP
+
+`SKIP` specifies the offset of the result rows.
+
+## Baisc Usage
+
+### Without SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### Using SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md
new file mode 100644
index 0000000000..87a9e6f734
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md
@@ -0,0 +1,17 @@
+# LIMIT
+
+The `LIMIT` clause is used to limit the number of rows in the result.
+
+## Basic Usage
+
+### Using LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst
new file mode 100644
index 0000000000..e2cf9d0346
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst
@@ -0,0 +1,8 @@
+GQL Clauses
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/index.rst
new file mode 100644
index 0000000000..e39c0a8e24
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/2.gql/index.rst
@@ -0,0 +1,9 @@
+GQL
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.intro.md
+   2.clauses/index.rst
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/index.rst
new file mode 100644
index 0000000000..c430670454
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/1.query/index.rst
@@ -0,0 +1,9 @@
+Query
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.cypher.md
+   2.gql/index.rst
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..5e4000b6ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
@@ -0,0 +1,214 @@
+# Bootstrap program
+
+>This document is a bootstrap program designed for TuGraph users. Before reading the detailed documents, users should read this document first to have a general understanding of TuGraph's graph computing operation process, and it will be more convenient to read the detailed documents later. The bootstrap program is a simple instance of a bfs (breadth-first search) program based on Tugraph, and we will focus on how it is used.
+
+## 1.Introduction to TuGraph-Graph Analysis Engine
+
+TuGraph's graph analysis engine is mainly used for full graph/full data analysis tasks. With the help of TuGraph's C++ / Python graph analysis engine API, users can quickly derive a complex subgraph from different data sources, and then run iterative graph algorithms such as PageRank, LPA, WCC on the subgraph, and finally make corresponding countermeasures according to the running results.
+
+In TuGraph, the process of both exporting and computing can be accelerated by in-memory parallel processing, resulting in near-real-time processing and analysis. Compared to traditional methods, this approach can avoid the overhead of data export and disk drop, and can achieve ideal performance by using a compact graph data structure.
+
+TuGraph has 6 built-in algorithms in the community version and 25 built-in algorithms in the commercial version. Users hardly need to implement the specific graph calculation process themselves. For details, please refer to algorithms.md.
+
+According to different data sources and implementations, it can be divided into Procedure, Embed and Standalone, which all inherit from OlapBase API. OlapBase API interface documentation can be found in OlAPBase-APi.md.
+
+The data source of Procedure and Embed is the db data preloaded in the graph database, which can be compiled to generate the.so file used by TuGraph-Web loading and the embed file used by the background terminal respectively. The input graph data are loaded in the form of db. The interface document can refer to olapondb-api.md.
+
+Standalone is used to compile and generate a standalone file. Different from the former, the input graph data of the file is loaded in the form of txt, binary, and ODPS files, and the interface document can refer to olapondisk-api.md.
+
+## 2.Procedure compile and run
+
+This mode is mainly used for visual loading and running on the TuGraph-web interface. The usage method is as follows:
+
+### 2.1.C++
+Run bash make_so.sh bfs in the TuGraph/procedures directory to the BFs.so file in the TuGraph/procedures directory, upload the file as a plug-in to Tugraph-web, input parameters and then execute.
+
+### 2.2.Python
+Upload the python file as a plugin to TuGraph-web, and execute it after inputting parameters.
+
+Example:
+Compile the.so algorithm file at TuGraph/procedures
+`bash make_so.sh bfs`
+
+After loading the bfs.so (or TuGraph/procedures/algo_cython/bfs.py) file as a plug-in to TuGraph-web, enter the following json parameters:
+
+```json
+{
+  "root_id": "0",
+  "label": "node",
+  "field": "id"
+}
+```
+
+The following result
+
+result:"{"core_cost":0.013641119003295898,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":8.821487426757813e-06,
+"prepare_cost":0.03479194641113281,
+"total_cost":0.04844188690185547}"
+
+The output ：
+
+- num_edges: the number of edges in the graph
+- num_vertices: the number of nodes in the graph
+- prepare_cost: Represents the time required for the preprocessing phase. The preprocessing phase works: loading parameters, graph data loading, index initialization.
+- core_cost: Represents the time required for the algorithm to run.
+- found_vertices: Number of vertices found.
+- output_cost: the time it takes for the algorithm result to be written back to db.。
+- total_cost: The overall running time of the algorithm is executed.
+
+make_so.sh This file is used to compile the graph algorithm files involved in TuGraph-OLAP into a.so file available for TuGraph-web.
+
+## 3.Embed compile and run
+
+This way is mainly used for TuGraph in the background program on the preloaded db graph data algorithm analysis. Its use method is as follows:
+
+To complete the embed_main.cpp file in TuGraph/procedures directory, add the data name, input parameters, data path and other information, as shown in the following example:
+
+### 3.1.C++
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path Specifies the path for saving the preloaded graph data
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // Specifies the name of the graph
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // Enter the algorithm parameters in json format
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+
+Run bash make_so.sh bfs in TuGraph/procedures to bfs_procedure in TuGraph/procedures/algo_cpp.
+`bash make_embed.sh bfs`
+
+Do this in the TuGraph/procedures folder
+`./algo_cpp/bfs_procedure`
+The result is returned.
+
+Input: {"root_id":"0", "label":"node","field":"id"}
+found_vertices = 3829
+{"core_cost":0.025603055953979492,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":9.059906005859375e-06,
+"prepare_cost":0.056738853454589844,
+"total_cost":0.0823509693145752}
+
+`Input` indicates the input parameters.The other parameters are described as above.
+
+### 3.2.Python
+
+To compile bfs.so, run `bash make_so_cython.sh bfs` in TuGraph/procedures or `python3 setup.py build_ext -i` in TuGraph/procedures/algo_cython.
+
+After obtaining bfs.so, it can be imported and used in Python, as shown in TuGraph/procedures/run_embed.py:
+
+```python
+# TuGraph/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+
+# shell
+python3 run_embed.py
+```
+The output is the same as C++
+
+
+## 4.Standalone compile and run
+
+This file is mainly used to load the graph data directly at the terminal and run the printout results. Here's how to use it:
+
+In TuGraph/build directory `make bfs_standalone` (need to include boost/sort/sort.hpp in the g++ default include path) can get bfs_standalone file, the file is generated with TuGraph/build/output/algo folder.
+
+Run: Go to the TuGraph/build directory and do`./output/algo/bfs_standalone -- type [type] -- input_dir [input_dir] --id_mapping [id_mapping] -- vertices [vertices] --root (root) - output_dir [output_dir]`
+
+Ready to run.
+
+- `[type]` : indicates the type source of the input graph file, including text file, BINARY_FILE binary file, and ODPS source.
+
+- `[input_dir]` : indicates the path of the input graph file folder, which may contain one or more input files. TuGraph will read all the files under [input_dir] when reading the input file. It is required that [input_dir] can only contain the input file and cannot contain other files. Parameters cannot be omitted.
+
+- `[id_mapping]`：When reading the side table, whether to do id mapping for the input data to make it conform to the form of algorithm operation. 1 is required for id mapping, 0 is not required. This process will take some time. The parameter can be omitted, and the default value is 0.
+
+- `[vertices]` : represents the number of vertices in the graph. 0 indicates the number of vertices that the user wants the system to automatically recognize. When is non-zero, it indicates the number of vertices that the user wants to customize. The number of user-defined vertices must be greater than the maximum vertex ID. This parameter can be omitted. The default value is 0.
+
+- `[root]` : indicates the starting vertex id for bfs. The argument cannot be omitted.
+
+- `[output_dir]` : indicates the path of the folder where the output data is saved. The output content is saved to this file, and the parameter cannot be omitted.
+
+Example
+
+### 4.1.C++
+
+Compile the standalone algorithm program at TuGraph/build
+
+```shell
+make bfs_standalone
+```
+
+Run the text source file in TuGraph/build/output
+
+```
+    ./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+Result：
+
+```
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+Result Parameter description is the same as above.
+
+If you do not know the required parameters of a new algorithm, run the`./output/algo/bfs_standalone -h` to view the parameters.
+
+### 4.2.Python
+The bfs extension compilation process of the Python language is the same as that of the embed mode. It is called through the `Standalone` interface at runtime. The example is as follows:
+
+```python
+# TuGraph/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(
+        input_dir="../test/integration/data/algo/fb_unweighted",
+        root=0)
+
+# shell
+python3 run_standalone.py
+```
+
+At this point, the process of bfs operation on the figure above by TuGraph is complete.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..af510f95c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
@@ -0,0 +1,196 @@
+# OlapBase API
+
+> This document will introduce how to use the OlapBase API
+
+## 1.The overview
+
+This manual will introduce the configuration of the TuGraph graph computing system. Combined with the code, several important files and interfaces in TuGraph are introduced.
+
+## 2.Configuration requirements
+
+To develop and compile applications using the TuGraph graph computing system, the configuration required:
+
+- linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+
+- Compiler that supports C++ 14, requires GCC version 5.4.1 or later.
+
+## 3.Atomic operations
+
+TuGraph uses multi-threading technology for batch operations, in which case memory access conflicts may occur. In order to ensure the correctness of modification operations in parallel computing, TuGraph implements atomic operations. The code section can be found in the lgraph_atomic.cpp file under the lgraph folder.
+
+TuGraph also customizes 4 commonly used atomic operations. When we need to modify the data of vertices in multithreaded mode, we should use atomic operations to ensure the correctness of the modification operation in parallel environment. In addition to these four atomic operations, users can also use "cas" to build their own atomic operation functions.
+
+- `bool cas(T \* ptr, T oldv, T newv)` : If the value pointed to by ptr is equal to oldv, the value pointed to by ptr is assigned to newv and returns true. Otherwise, false is returned
+- `bool write_min(T \*a, T b)` : If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `bool write_max(T \*a, T b)` : If b is larger than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `void write_add(T \*a, T b)` : adds the value of b to the value pointed to by a.
+- `void write_sub(T \*a, T b)` : subtract the value of b from the value pointed to by a.
+
+## 4.Vertex Class ParallelBitset
+
+When using TuGraph for batch operations, you need to use a vertex set to represent the vertices you want to process. ParallelBitset implements a vertex collection class that represents vertices in bits and thus saves a significant amount of memory. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 4.1ParallelBitset Class
+
+- `size_t Size()`：Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size_t size)`：Initialize size and data, the length of data is (size >> 6)+1.
+- `void Clear()`：clears the collection.
+- `void Fill()`：add all vertices to the set.
+- `bool Has(size_t i)`：check if vertex i is in the set.
+- `bool Add(size_t i)`：add vertex i to the set.
+- `void Swap(ParallelBitset &other)`：exchange elements with another set of ParallelBitset.
+
+## 5.Vertex Array Class ParallelVector
+
+When using TuGraph for batch operations, you need to use an array of vertices to represent the result of processing vertices. ParallelVector implements the vertex array class. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 5.1.ParallelVector Class
+
+- `ParallelVector(size_t capacity)` Builds ParallelVector. capacity is the initial size of the vertex array
+- `T& operator[](size_t i)` : data with subscript i
+- `T \*begin()` : ParallelVector the starting pointer
+- `T \*end()` : ParallelVector the end pointer to Parallelvector. begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to access an array sequentially
+- `T&Back ()` : ParallelVector the last data
+- `T \*Data()` : represents the data in the array itself
+- `void Destroy()' : empty the ParallelVector array and delete the array
+- `size_t Size()` : indicates the number of data in ParallelVector
+- `size_t Capacity()` : indicates the capacity of ParallelVector
+- `void Resize(size_t size)` : Change ParallelVector to size, which must be greater than or equal to the size before the change
+- `void Clear()` : empty the data in ParallelVector
+- `void ReAlloc(size_t capacity)` : ParallelVector is allocated with new capacity. If data exists in the array, it is migrated to the new memory
+- `void Fill(T elem)` : Assign elem to all data on ParallelVector
+- `void Append(const T&elem, bool atomic = true)` : Add a piece of data at the end of ParallelVector
+- `void Swap(ParallelVector<t> &other)` : to exchange data with other parallelvectors</t>
+- `ParallelVector<t> Copy()` : copies the current ParallelVector data into the Copy array</t>
+
+## 6.Customize data structures
+
+### 6.1.Basic data types
+
+We customize the data structure representation of points and edges to save memory space while covering all vertices:
+
+- 'Empty' : indicates a special data type with empty content.
+
+### 6.2.Combining data structures
+
+In order to facilitate calculation, we define several data structures of point and edge data according to different calculation scenarios, which are as follows:
+
+- `EdgeUnit<edgedata>` : represents an edge of weight type EdgeData, used to parse the input file, and contains three member variables:</edgedata>
+- `size_t src` : the starting vertex of an edge
+- `size_t dst` : the end of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjUnit<edgedata>` : represents an edge of weight type EdgeData, used during batch computation, and contains two member variables:</edgedata>
+- `size_t neighbour` : indicates the neighbor vertex of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjList<edgedata>` : Adjacency list of vertices with weights of type EdgeData, often used to represent the set of incoming and outgoing edges of vertices and containing two member variables:</edgedata>
+- `AdjUnit<t> \* begin` : indicates the start pointer of the list</t>
+- `AdjUnit<t> \* end` : The end pointer of the list.</t> begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to loop through the adjacency list.
+
+## 7.Graph class OlapBase
+
+Graph class OlapBase is the main class for TuGraph to load graphs and calculate graphs. OlapBase is commonly used to represent graphs with weights of type EdgeData. See olap_base.hpp under lgraph folder for the code. This chapter covers the types and API interfaces commonly used in Graph classes. The classes used by the Procedure, Embed, and Standalone functions described above are all subclasses of this class.
+
+### 7.1.Basic Information
+
+- `size_t NumVertices()` : obtains the number of vertices
+
+- `size_t NumEdges()` : Gets the number of edges
+
+- `size_t OutDegree(size_t vid)` : indicates the outdegree of the vid of the vertex
+
+- `size_t InDegree(size_t vid)` : indicates the input degree of vertex vid
+
+### 7.2.node sets and edge sets and their related operations
+
+- `ParallelVector AllocVertexArray()` : Allocates an array of type VertexData with size as the number of vertices
+
+- `void fill_vertex_array(V \* array, V value)` : assigns values to all elements in the array
+
+- `ParallelBitset AllocVertexSubset()` : Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+
+- `AdjList OutEdges(size_t vid)'`: gets the set of all outgoing edges of vertex v
+
+- `AdjList InEdges(size_t vid)` : Obtains the set of all incoming edges of vertex v
+
+- `void Transpose()` : transpose of a directed graph
+
+- `LoadFromArray(char \* edge_array, VertexId input_vertices, EdgeId input_edges, EdgeDirectionPolicy (edge_direction_policy) `: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+`edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+`input_vertices`: specifies the number of vertices read into the graph by the array.
+
+`input_edges` : specifies the number of edges that the array reads into the image.
+
+`edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+### 7.3.Locking mechanism
+
+TuGraph implements a pair of locks to control the program's access to vertex data. Respectively is:
+
+- `void AcquireVertexLock(size_t vid)` : locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(size_t vid)` : unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+- `VertexLockGuard GuardVertexLock(size_t vid)` : When the vid operation is performed, the vertex vid is locked, and the lock is automatically released upon exiting the scope
+
+### 7.4.Batch Processing Operations
+
+TuGraph provides two batch operations to do a point-centered batch process in parallel. Respectively is:
+
+```c++
+/*
+    Function Name:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    The work function executes the work function on nodes whose numbers are between lower and upper in the Graph. The fourth parameter indicates the accumulated base, which defaults to 0.The fifth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+For details, please refer to include/lgraph/olap_base.h
+
+    Example: Count the number of vertices in the parent array that have outgoing edges
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+graph is the instantiated object of graph class OlapBase
+
+```C++
+/*
+    Function Name:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    Function: Execute the work function for the node that corresponds to 1 in active_vertices. The third parameter represents the cumulative cardinality, which is 0 by default.
+
+    The fourth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+
+    For specific implementation, please refer to the specific code in /include/lgraph/olap_base
+
+
+
+    Example: Output all the out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..6015d7e1ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,303 @@
+# OlapOnDB API
+
+> This document provides detailed instructions for using the OlapOnDB API
+
+## 1.Introduction
+
+Generally speaking, users need to implement the process of subgraph extraction by themselves. Then use the rich interface in TuGraph to implement your own graph analysis algorithm.
+
+This document mainly introduces the Procedure and Embed interface design, and introduces some common interface, specific interface information see include/lgraph/olap_on_db.h file.
+
+## 2.Schema
+
+Procedure and Embed auxiliary functions are mainly included in the OlapOnDB class, and some more frequently used functions will be introduced one by one
+
+OLAP is associated with the following common data structures in TuGraph:
+
+1. DB graph analysis class `OlapOnDB`
+
+2. Vertex array `ParallelVector`
+
+3. Vertex set `ParallelBitset`
+
+4. Side data structure `AdjUnit/AdjUnit`
+
+5. Edge collection data structure `AdjList`
+
+### 2.1.Snapshot Based Storage Structure
+
+The OlapOnDB class in TuGraph provides a data "snapshot," that is, a fully usable copy of a given data set that includes a mirror image of the corresponding data at a certain point in time (the point at which the copy was started). Because OLAP operations involve only reads and not writes, OlapOnDB arranges data in a more compact manner, saving space while improving data access locality.
+
+### 2.2.BSP Calculation Model
+
+TuGraph uses the BSP (Bulk Synchronous Parallel) model in the process of calculation, which makes the process can be executed in parallel, and greatly improves the efficiency of the program.
+
+The core idea of BSP calculation model is to propose and use Super Step. After OlapOnDB is created, the computation on this data is divided into multiple supersteps, such as PageRank, which is divided into multiple iterations, and each iteration is a Super Step. There is explicit synchronization between different Super Steps to ensure that all threads proceed to the next Super Step at the same time after completing the same superstep. Within a Super Step, all threads execute asynchronously, using parallelism to improve computational efficiency.
+
+BSP calculation model can effectively avoid deadlock, and achieve coarse-grained global synchronization in hardware mode by means of obstacle synchronization, so that graph computation can be executed in parallel, and programmers do not need to spend much time on synchronization mutual exclusion.
+
+## 3.Algorithm example
+
+Here is an explanation of the PageRank algorithm, which is mainly divided into the main function Process and the PageRank algorithm process function.
+
+### 3.1.Main function
+
+The main function has three input parameters, 'TuGraph' database parameter 'db', the request 'request' obtained from the web side, and the return value 'response' given to the web side. The overall process can be divided into the following steps:
+
+1. Obtain related parameters
+
+2. Create a snapshot class
+
+3. Main process of PageRank algorithm
+
+4. Obtain and send the return value of the web page
+
+```c
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+
+    // Obtain the number of iterations from web side requests (num_iterations)，
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // Read transaction creation and snapshot class creation
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+
+    // Create a pr array to store the pr value for each node
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank algorithm main process, obtain the pagerank value of each node
+    PageRankCore(olapondb, num_iterations, pr);
+
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        Function Purpose: Gets the number of the node with the largest pagerank among all nodes
+
+        Function flow description: This function executes Func A for node vi (also known as the active vertices) corresponding to all bits of 1 in the vertex set all_vertices. The return value of Func A is then used as the second input parameter of Func B to obtain the local maximum value (because the first input parameter is 0. So the return value is actually the pagerank value of each node). Finally, the return value of all threads is summarized, and Func B is executed again to get the global return value, and stored in the max_pr_vi variable
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+
+    // Retrieve and send the return value from the web page
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2.PageRank Algorithm process
+
+`pagerank` main process has two input parameters, snapshot class (subgraph) and iteration times, the overall process can be divided into the following steps:
+
+1. Initialization of related data structures
+2. Initialize the pagerank value of each node
+3. Calculation of pagerank value of each node, active vertices for all vertices (means that all vertices need to calculate pagerank value)
+4. Obtain the pagerank value after 'num_iterations' of each node
+
+```c
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+
+    // Initialization of related data structures
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // The initialization of the pagerank value of each node is inversely proportional to the degree of the node
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // Total iteration process
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            Function Purpose: Calculates the pagerank of all nodes
+
+            Function flow description: This function is used to calculate the pagerank value of all nodes. Execute Func C on node vi corresponding to all the bits of 1 in all_vertices to obtain the pagerank value of vi in the current iteration and return the pagerank change value of vi node. The total change value of all active nodes is finally summarized and returned through the internal processing of the function, which is stored in the delta variable
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // Gets the pagerank value of the current node from its neighbor
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank value calculation core formula
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+
+                    // Statistics of relevant intermediate variables
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // The pagerank value obtained in this iteration is output as the input of the next iteration
+        curr.Swap(next);
+    }
+}
+```
+
+### 4.1.Transaction creation
+
+```c
+// Create a read transaction
+auto txn = db.CreateReadTxn();
+
+// Write transaction creation
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2.Parallelization to create a directed graph
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3.Create undirected graphs in parallel
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED;
+)
+```
+
+### 4.4.Obtain the output degree
+
+```c
+size_t OutDegree(size_t vid)
+```
+
+### 4.5.Obtain the input degree
+
+```c
+size_t InDegree(size_t vid)
+```
+
+### 4.6.Gets the outgoing edge set
+
+```c
+/*
+    Function name: AdjList OutEdges(size_t vid)
+
+    Data structure:
+
+    An AdjList can be understood as an array of structures of type AdjUnit
+
+    AdjUnit has two member variables: 1. size_t neighbour 2. edge_data: neighbour indicates the number of the target node pointed by the outgoing edge. If the value is a licensed graph, the data type of edge_data is the same as the weight value of the edge in the input file
+
+    Example Output all outgoing neighbors of node vid
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7.Gets the incoming edge set
+
+```c
+AdjList<edgedata> InEdges(size_t vid)</edgedata>
+
+// Example: Outputs all inbound neighbors of node vid
+for (auto & edge : olapondb.InEdges(vid)) {
+size_t dst = edge.neighbour;
+printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8.Get the node ID of OlapOnDB corresponding to the node in TuGraph
+
+```c
+size_t OriginalVid(size_t vid)
+
+// Note: The node numbers entered in TuGraph can be non-numbers, such as names. When OlapOnDB subgraphs are generated, names and other names will be converted to numbers for subsequent processing. Therefore, this method may not be applicable to some specific scenarios
+```
+
+### 4.9.Gets the node number of TuGraph corresponding to a node in OlapOnDB
+
+```c
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10.Description of active vertices
+
+Active vertices refer to the vertices that need to be processed in the batch function. In this example, we simply output the number of active vertices and summarize the number of active vertices:
+
+```c
+ParallelBitset temp = 000111; // The current active vertices are vertices 3, 4 and 5
+
+size_t delta = ForEachActiveVertex<double>(</double>
+//void c
+[&](size_t vi) {
+printf("active_vertexId = %lu\n",vi);
+return 1;
+},
+all_vertices
+);
+```
+
+The result of this function is obvious. Because of multiple threads, the output order may vary:
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+The local return value is 1. This function will add all the local return values in a thread-safe manner to the final return value, which is stored in the delta variable, and the final value is 3
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..bb3c784f13
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,213 @@
+# OlapOnDisk API
+
+> This document mainly introduces the usage instructions of OlapOnDisk API in detail
+
+## Table of contents
+
+- [1. Introduction](#1introduction)
+- [2. Algorithm Example](#2algorithm-example)
+     - [2.1 header files](#21head-file)
+     - [2.2 Configuration class MyConfig](#22configuration-class-myconfig)
+     - [2.3 Main function](#23main-function)
+     - [2.4 bfs algorithm flow](#24bfs-algorithm-process)
+- [3. Function description of other commonly used functions](#3description-of-other-commonly-used-functions)
+     - [3.1 Image Loading](#31graph-load)
+     - [3.2 Image writing](#32graph-write)
+     - [3.3 Graph Analysis Function](#33graph-parse-function)
+    
+### 1.Introduction
+
+The Standalone mode of TuGraph can be used to load graph data files, where the sources of graph data files can include text files, BINARY_FILE binary files, and ODPS sources. In this mode, TuGraph can quickly load multiple data sources into a graph, and then run iterative algorithms such as BFS, WCC, SSSP, etc. on the graph, and output the final result to the terminal.
+
+In TuGraph, the export and calculation process can be accelerated through parallel processing in memory, so as to achieve near real-time processing and analysis. Compared with traditional methods, it avoids the overhead of data export and storage, and can use compact Graph data structures achieve desirable performance for computation.
+
+TuGraph has built-in a large number of common graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement the specific graph calculation process by themselves. They only need to include the header file (.h) of the corresponding algorithm library when implementing their own stored procedures. To your own program, and link your own dynamic library files in the compilation phase.
+
+This document mainly introduces the common interfaces of Standalone, and the auxiliary functions used are mainly contained in the OlapOnDB class. At the same time, in order to help users understand and facilitate, the BFS algorithm is illustrated with examples.
+
+### 2.Algorithm example
+
+Here, the BFS algorithm is explained in blocks, which are roughly divided into the main function `main`, the BFS algorithm process `BFSCore` function and the configuration class MyConfig.
+
+#### 2.1.Head file
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //Header files to include when using TuGraph
+#include "./algo.h"   //A header file containing various algorithmic logic functions
+```
+
+When using TuGraph to realize the calculation application of graph data files, generally, the StandaloneGraph class object graph is first created, the graph file data is loaded into the graph, and then the graph calculation process is realized by calling the graph logic function, and finally the result of the graph calculation is printed out.
+
+#### 2.2.Configuration class MyConfig
+
+The MyConfig configuration class function is used to provide the configuration information required for the algorithm logic calculation, inherited from ConfigBase<EdgeData>, where EdgeDate can choose Empty (unweighted graph), int (the weight of the weighted graph is an integer) or double (the weight of the weighted graph is double) type.
+
+The MyConfig configuration class generally depends on the algorithm, and additional configuration information is required as follows:
+
+1. Parameters required by the algorithm
+2. Algorithm name
+3. Configure the Print function in the class
+Other common members inherit from ConfigBase, please refer to src/olap/olap_config.h for reference.
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // The parameters required by the algorithm are initialized
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // The configuration file accepts command line parameters. This use case will sequentially read the parameters when calling the algorithm from the command line. The value specified by the user is preferred. If the user does not specify it, the default parameter is selected.
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+#### 2.3.main function
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // Statistical memory consumption class MemUsage instantiation
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // Configuration class MyConfig instantiation
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk class instantiation
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // Statistical graph loading time consumption
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // Create an array to count whether a node has been traversed
+    auto parent = graph.AllocVertexArray<size_t>();
+    // Breadth-first search algorithm, returns the number of nodes connected to the root_vid root node in the graph
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // Print relevant information to the terminal
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+#### 2.4.bfs algorithm process
+
+The main process of `bfs` has two input parameters, the snapshot class (subgraph) and the number of iterations. The overall process can be divided into the following steps:
+
+1. Relevant definitions and initialization of data structures
+2. Use the batch function to perform cyclic calculations on each node, find all nodes adjacent to the current node in each round, and exchange them when the round ends.
+3. Until all nodes are found, return the number of nodes discovered_vertices.
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //Allocate an array, active_in is used to store the nodes found in the previous cycle stage
+  active_in.Add(root);            //Add the root node to the array
+  auto active_out = graph.AllocVertexSubset();  //Allocate the array active_out to store the nodes found in the current cycle stage
+  parent.Fill((size_t)-1);               //Assign a value of -1 to the node in the parent array, -1 means not found
+  parent[root] = root;
+  size_t num_activations = 1;       //Indicates the number of nodes found in the current loop phase
+  size_t discovered_vertices = 0;    //Indicates the total number of nodes found in the current cycle phase
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations indicates the number of nodes found in the current loop phase
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices indicates the total number of nodes found in the current cycle phase
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //Each cycle starts from the root node, finds adjacent adjacent nodes, changes its parent value, and operates num_activations+1
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //Store the nodes found in the current loop phase
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // return all nodes
+  return discovered_vertices;
+}
+```
+
+### 3.Description of other commonly used functions
+
+#### 3.1.Graph load
+
+TuGraph-StandaloneThe loading sources of graph data files are mainly divided into three categories: text files, binary files, and ODPS. The binary file is a file in which the binary representation of the edge data is arranged in order, which can save a lot of storage space. Its loading function is divided into three types, namely:
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：The loading method of the graph data file contains two parameters, and their meanings represent respectively
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `edge_direction_policy`：Specifies whether the graph is directed or undirected, including three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. Among them, DUAL_DIRECTION is the default graph loading method.
+  DUAL_DIRECTION : The input file is an asymmetric graph and the loaded graph is an asymmetric graph.
+  MAKE_SYMMETRIC : The input file is an asymmetric graph and the loaded graph is a symmetric graph.
+  INPUT_SYMMETRIC : The input file is a symmetric graph and the loaded graph is a symmetric graph.
+  For details, see `enum EdgeDirectionPolicy` in the olap_config.h file under the lgraph folder.
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：Load the vertices in the file into an array in the order of their ids. The meanings of each parameter are:
+  - `array`：array of data to be read
+  - `path`：The path to read the file, each line in the file represents a pair of vertex
+  - `parse_line`：A user-defined function that tells the system how to parse a line of text data into a vertex pair.
+
+
+#### 3.2.Graph write
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：Write the data in the array back to the file, and the meanings of each parameter are:
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `array`：array of data to be written
+  - `array_size`：The length of the number of data to be written
+  - `name`：algorithm name
+  - `filter_output`：Write data rule function, the data to be written needs to meet the requirements of this function.
+
+#### 3.3.graph parse function
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：Parse the graph data file, and load the graph as an unweighted graph.
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：Parse the graph data file, load the graph as a weighted graph, and specify the weight data type by modifying <EdgeData>.
+
+This function can be specified through the constructor parse_line when the MyConfig class is defined.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md
new file mode 100644
index 0000000000..c51987fac4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md
@@ -0,0 +1,447 @@
+# Python Olap API
+
+> This document mainly introduces the API usage of OlapBase OlapOnDB and OlapOnDisk in Python
+
+## Table of contents
+- [1.Overview](#1-overview)
+- [2.Configuration Requirements](#2-configuration-requirements)
+- [3.Cython](#3-cython)
+- [4.Olap API](#4-olap-api)
+    - [4.1. Atomic operations](#atomic-operations)
+    - [4.2. Vertex collection class ParallelBitset](#vertex-collection-class-parallelbitset)
+    - [4.3. Vertex array class ParallelVector](#vertex-array-class-parallelvector)
+    - [4.4. Custom data structure](#custom-data-structure)
+    - [4.5.Graph class OlapBase](#graph-class-olapbase)
+    - [4.6. Graph Class OlapOnDB](#graph-class-olapondb)
+    - [4.7.Graph class OlapOnDisk](#graph-class-olapondisk)
+- [5.lgraph DB API](#5-lgraph_db-api)
+- [6.Algorithm plugin example](#6-algorithm-plug-in-example)
+
+## 1 Overview
+
+This manual will introduce the simple configuration required to use the Python interface of the TuGraph graph computing system, and explain the TuGraph Python API in conjunction with the code. For details about the functions of class ParallelBitset, OlapBase, etc., see olap-base-api.md, olap-on-db-api.md and olap-on-disk-api.md.
+
+## 2. Configuration requirements
+
+If you want to use TuGraph to write and compile your own applications, the required configuration requirements are:
+
+- Linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+- A compiler that supports C++17 requires GCC version 5.4.1 or later.
+- Cython, version 3.0a1 or above is required, and the tested version is 3.0.0a11
+
+## 3. Cython
+Cython is an efficient programming language that is a superset of Python. Cython can translate .py files into C/C++ codes and compile them into Python extension modules, which can be called through import in Python. In TuGraph, all Python procedures are compiled into Python extension modules by Cython and then used.
+
+The main advantage of using Cython is that it combines the simplicity and ease of use of Python with the performance of C/C++. The TuGraph Python interface is implemented using Cython.
+
+[Cython Documentation](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+The Olap API is used for graph computing and is implemented in C++. The usage and functions are basically the same as the C++ interface. To use the API in a Python file, the interfaces declared in procedures/algo_cython/olap_base.pxd must be imported using `cython.cimports.olap_base import *`. The Python file can only be run after being compiled by Cython.
+
+### Atomic operations
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`: If the value pointed to by ptr is equal to oldv, assign the value pointed to by ptr to newv and return True, otherwise return False.
+- `write_min[T](a: cython.pointer(T), b: T)->cython.bint`: If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_max[T](a: cython.pointer(T), b: T)->cython.bint`: If b is greater than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_add[T](a: cython.pointer(T), b: T)->cython.bint`: Add the value of b to the value pointed to by a.
+- `write_sub[T](a: cython.pointer(T), b: T)->cython.bint`: Subtract the value pointed to by a from the value of b.
+
+### Vertex collection class ParallelBitset
+- `Size() -> size_t`: Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size: size_t)`: Initializes size and data, where the length of data is (size >> 6) + 1.
+- `Clear() -> cython.void`: Empties the collection.
+- `Fill() -> cython.void`: Adds all vertices to the set.
+- `Has(i: size_t) -> cython.bint`: Checks if vertex i is in the set.
+- `Add(i: size_t) -> cython.bint`: Adds vertex i to the set.
+- `Swap(other: ParallelBitset) -> cython.void`: Exchanges elements with another ParallelBitset set.
+
+### Vertex array class ParallelVector
+- `ParallelVector[T](size_t capacity)`: Constructs a ParallelVector, where capacity is the initial capacity of the vertex array.
+- `operator[](i: size_t) -> T`: Returns the data at index i.
+- `begin() -> cython.pointer(T)`: Returns the start pointer of ParallelVector.
+- `end() -> cython.pointer(T)`: Returns the end pointer of ParallelVector. The usage of begin() and end() is similar to the begin and end pointers of the vector container, and these two pointers can be used to sequentially access the array.
+- `Back() -> T`: Returns the last data of ParallelVector.
+- `Data() -> cython.pointer(T)`: Indicates the data of the array itself.
+- `Destroy() -> cython.void`: Clears the data in the ParallelVector array and deletes the array.
+- `Size() -> size_t`: Indicates the number of data in ParallelVector.
+- `Resize(size: size_t) -> cython.void`: Changes ParallelVector to size, which should be greater than or equal to the size before the change and less than capacity.
+- `Clear() -> cython.void`: Clears the data in ParallelVector.
+- `ReAlloc(capacity: size_t) -> cython.void`: Allocates a new capacity size to ParallelVector. If the array has data, it migrates the data to the new memory.
+- `Fill(elem: T) -> cython.void`: Assigns elem to all data of ParallelVector.
+- `Append(elem: T, atomic: cython.bint = true) -> cython.void`: Adds a data to the end of ParallelVector.
+- `Swap(other: ParallelVector[T]) -> cython.void`: Exchanges data with another ParallelVector.
+- `Copy() -> ParallelVector[T]`: Copies the current ParallelVector data and stores it in the copy array.
+
+
+### Custom Data Structure
+- `Empty`: A special data type whose content is empty.
+- `EdgeUnit[EdgeData]`: Indicates the edge whose weight type is EdgeData, used to parse the input file, including three member variables:
+    - `src: size_t`: starting vertex of the edge
+    - `dst: size_t`: end of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjUnit[EdgeData]`: indicates the edge whose weight type is EdgeData, which is used in the batch calculation process and contains two member variables:
+    - `neighbor: size_t`: neighbor vertex of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjList[EdgeData]`: The adjacency list of vertices whose weight type is EdgeData, often used to represent the set of incoming and outgoing edges of vertices, including three member functions:
+    - `begin()->cython.pointer(AdjUnit[T])`: the starting pointer of the list
+    - `end()->cython.pointer(AdjUnit[T])`: the end pointer of the list
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: the data whose subscript is i
+
+### Graph class OlapBase
+- `NumVertices()->size_t`: get the number of vertices
+- `NumEdges()-> size_t`: get the number of edges
+- `OutDegree(vid: size_t)-> size_t`: out-degree of vertex vid
+- `InDegree(vid: size_t)->size_t`: in-degree of the vertex vid
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`: Allocates an array of type VertexData with size as the number of vertices
+- `AllocVertexSubset()-> ParallelBitset`: Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all outgoing edges of vertex v
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all incoming edges of vertex v
+- `Transpose()->cython.void`: transpose of a directed graph
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+    - `edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+    - `input_vertices`: specifies the number of vertices read into the graph by the array.
+
+    - `input_edges` : specifies the number of edges that the array reads into the image.
+
+    - `edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`: locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`: unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+
+TuGraph provides two batch operations to perform point-centric batch processing in parallel, which is slightly different from C++ in Python.
+
+```python
+# Function name: ProcessVertexInRange[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# lower: size_t, upper: size_t,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Executes the work function on nodes whose node numbers are between lower and upper in the Graph. The fourth parameter indicates the base of accumulation, which is 0 by default.
+# The fifth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in include/lgraph/olap_base.h
+#
+# Example usage: Count the number of vertices with edges in the parent array.
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython.pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+g is the instantiated object of graph class OlapBase
+
+```python
+# Function name: ProcessVertexActive[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# active: ParallelBitset,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Execute the work function on the nodes corresponding to 1 in the active_vertices bitset. The third parameter indicates the base of accumulation, which is 0 by default;
+# The fourth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in /include/lgraph/olap_base.h
+#
+# Usage example: Output all out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes.
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self. graph. OutDegree(vi)
+        dst: size_t
+        edges = self. graph. OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbor
+            printf("node %lu has neighbor %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+As shown in the above two examples, ProcessVertexActive and ProcessVertexInRange in Python require an additional algorithm class pointer parameter compared to their C++ counterparts. The Work function is generally used as a member function of the algorithm class to access member variables, such as in the graph and ParallelVector parent examples shown above. When calling the batch function, the Work function and the self pointer of the algorithm class are passed to the batch function.
+
+The Work function will be called in multiple threads, so the @cython.nogil decorator is added to release the Python global interpretation lock. In code executed by multiple threads, such as the Work function in the batch function, variables are better declared as C/C++ types using `dst: type` or `dst = cython.declare(type)`. This is because Python objects cannot be used in multi-threaded code.
+
+### Graph class OlapOnDB:
+Parallelize to create a directed graph:
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+Parallelize to create an undirected graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING creates a directed graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### Graph class OlapOnDisk
+
+#### ConfigBase:
+- `ConfigBase()`: Constructor
+- `std::string input_dir`: graph edge table data path
+- `std::string output_dir`: output path
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: read in graph data
+
+## 5. lgraph_db API
+Please refer to the files procedures/algo_cython/lgraph_db.pxd and lgraph_db_python.py for the lgraph_db API.
+
+The usage and functions of the interface in lgraph_db.pxd are basically the same as the C++ interface. The interface declared in lgraph_db.pxd is implemented in C++. In the py file, it must be imported by `cython.cimports.olap_db import *` and compiled by the Cython file to run.
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: Get the vid of the vertex
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: constructor, dir_path is the db path
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: set user
+- `SetUser(user: std::string)-> cython.void`: set user
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: create GraphDB
+
+### GraphDB:
+- `CreateReadTxn()-> Transaction`: create a read-only transaction
+- `CreateWriteTxn()-> Transaction`: create a write transaction
+- `ForkTxn(txn: Transaction)-> Transaction`: Copy transactions, only read transactions can be copied
+
+### Transaction:
+```
+GetVertexIndexIterator(
+                 label: std::string,
+                 field: std::string,
+                 key_start: std::string,
+                 key_end: std::string) -> VertexIndexIterator
+```
+Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v
+
+
+
+lgraph_db_python.py packages the C++ classes Galaxy and GraphDB from lgraph_db.pxd as Python classes. After compiling lgraph_db_python.py into a Python extension, you can directly access it in a Python file or from the Python command line by importing it with `import lgraph_db_python`.
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: constructor, dir_path is the db path
+- `SetCurrentUser(self, user: str password: str)-> void`: set user
+- `SetUser(self, user: std::string)-> void`: set user
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: create PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)->cython.Py_ssize_t`: address of C++ class GraphDB
+
+## 6. Algorithm plug-in example
+The following is a code example of the BFS algorithm implemented in Python:
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# Comments work as follows:
+# language_level=3: use Python3
+# cpp_locals=True: C++17 is required, and std::optional is used to manage C++ objects in Python code, which can avoid copy construction of C++ objects
+# boundscheck=False: Turn off bounds checking for indexes
+# wraparound=False: Turn off the processing of negative subscripts (similar to Python List)
+# initializedcheck=False: Turn off checking whether the memory is initialized, and the running performance will be faster after turning off the check
+# language = c++: translate this .py file to C++ instead of C file. TuGraph uses a lot of template functions, so C++ should be used
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# From procedures/algo_cython/ cimportolap_base.pxd and lgraph_db.pxd, similar to #include "xxx.h" in C++
+
+from cython.cimports.libc.stdio import printf
+# Similar to #include <stdio.h> in C++
+# Other common ones include cython.cimports.libcpp.unordered_map, etc.
+
+import time
+import lgraph_db_python
+
+@cython.cclass
+# cython.cclass indicates that BFSCore is a C-type Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty]) indicates the pointer of OlapBase[Empty], similar to OlapBase[Empty]* in C++
+    # Cython provides common types of pointers, such as cython.p_int, cython.p_char, etc.
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t declares root as a C++ size_t type variable, equivalent to root = cython.declare(size_t)
+    # Variables that do not declare a type are Python object types
+    # Declaring variable types will greatly improve performance, and in the multi-threaded part, only C/C++ type variables can be accessed
+
+    @cython.cfunc
+    # cython.cfunc indicates that Work is a C-type function, and the parameters and return values should be declared
+    # cfunc has good performance and can accept C/C++ objects as parameters and return values, but it cannot be called in other python files
+    # Similar to cython.ccall, such as Standalone function, which can be called in other python files
+    @cython.nogil
+    # cython.nogil means to release the Python global interpretation lock. In the part modified by nogil, Python objects cannot be accessed
+    # In the multi-threaded part, there should be nogil decorator
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) means that exception propagation is disabled, and Python exceptions raised inside the function will be ignored
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbor
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 means that dst has not been visited by bfs
+                if self.active_out.Add(dst):
+                    # Set dst as an active node; ParallelBitmap.Add is an atomic operation to prevent double calculation
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython. size_t:
+        self. graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self. parent. Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self. active_in. Add(self. root)
+        while num_activations > 0:
+            self. active_out. Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self. active_out. Swap(self. active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time. time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # Create OlapOnDB in parallel
+    # Cython does not support dereference operations such as *db, use db[0] to dereference
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # Get the iterator of the root node through GetVertexIndexIterator based on the root node label name, field name and field value (root_id),
+    # and get the vid through the iterator. When there is no ID_MAPPING, the vid is the same as the id in OlapOnDB
+    cost = time. time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time. time()
+    count = a. run(cython. address(olapondb), root_vid)
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb. NumVertices()
+    response["num_edges"] = olapondb. NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone is the plug-in entry in Standalone mode, modified with cython.ccall
+    # You can set parameters arbitrarily, and modify procedures/algo_cython/run_standalone.py accordingly
+    cost = time. time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config is a C++ class, config.input_dir is std::string, Python str needs to be encoded to be passed to std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # read in graph
+    cost = time. time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time. time()
+    a = BFSCore()
+    count = a. run(cython. address(graph), root)
+    # cython.address(graph), address, similar to &graph in C++
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices". format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process is the plug-in entry in embed mode and procedure mode, modified with cython.ccall
+    # The Process function must be named Process, and the parameters are lgraph_db_python.PyGraphDB and bytes
+    # The return value must be (bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # Get the address of the GraphDB object in the PyGraphDB, convert it to a pointer and pass it
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..e496945495
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
@@ -0,0 +1,191 @@
+# TuGraph Built-in Algorithm Description
+
+> This document mainly introduces the TuGraph built-in algorithm program in detail, the community version of 6 algorithms can refer to the basic algorithm newspaper
+
+## 1.Introduction
+
+TuGraph currently contains the following 6 basic algorithms and 28 extended algorithms, a total of 34 graph algorithms:
+
+### 1.1.Basic algorithms:
+
+|    Algorithm name            | The program name |
+| :--------------------------: | :--------------: |
+|     Breadth-First Search     |       bfs        |
+|           Pagerank           |     pagerank     |
+| Single-Source Shortest Path  |       sssp       |
+| Weakly Connected Components  |       wcc        |
+| Local Clustering Coefficient |       lcc        |
+| Label Propagation Algorithm  |       lpa        |
+
+### 1.2.Extended algorithms:
+
+|            Algorithm name                    |   The program name   |
+| :------------------------------------------: | :------------------: |
+|            All-Pair Shortest Path            |         apsp         |
+|            Betweenness Centrality            |          bc          |
+|              Belief Propagation              |          bp          |
+|             Closeness Centrality             |          clce        |
+|             Common Neighborhood              |          cn          |
+|              Degree Correlation              |          dc          |
+|             Dimension Estimation             |          de          |
+|                    EgoNet                    |          en          |
+|        Hyperlink-Induced Topic Search        |         hits         |
+|                Jaccard Index                 |          ji          |
+|                    K-core                    |        kcore         |
+|                   Louvain                    |       louvain        |
+|        Multiple-source Shortest Paths        |         mssp         |
+|            Personalized PageRank             |         ppr          |
+|        Strongly Connected Components         |         scc          |
+| Speaker-listener Label Propagation Algorithm |         slpa         |
+|          Single-Pair Shortest Path           |         spsp         |
+|              Triangle Counting               |       triangle       |
+|                  Trustrank                   |      trustrank       |
+|     Weighted Label Propagation Algorithm     |         wlpa         |
+|         Weighted Pagerank Algorithm          |      wpagerank       |
+|           Maximal independent set            |         mis          |
+|                  Sybil Rank                  |      sybilrank       |
+|             Subgraph Isomorphism             | subgraph_isomorphism |
+|                    Motif                     |        motif         |
+|                   Kcliques                   |       kcliques       |
+|                    Ktruss                    |        ktruss        |
+|                    Leiden                    |        leiden        |
+
+## 2.Basic algorithms
+
+### 2.1.Breadth-First Search
+
+Breadth first Search implements the Breadth-first Search algorithm, which starts from the root vertex and traverses all accessible vertices along the width of the graph. Returns the number of vertices traversed. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 2.2.Pagerank
+
+Web page sorting program to achieve the commonly used Pagerank algorithm. The algorithm calculates the importance ranking of all vertices according to the edge and edge weight in the graph. The higher the PageRank value, the higher the importance of the vertex in the graph. The reciprocal of the number of vertices is used as the initial Rank value of each vertex, and then the Rank value of the vertices is transferred to the adjacent vertices on average according to the outgoing edges, and the transfer process is repeated until the given convergence threshold is met or the given number of iterations is reached. At the end of each pass round, a certain proportion of the Rank values of all vertices will be randomly transferred to any vertex. Please refer to the algorithm content [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 2.3.Single-Source Shortest Path
+
+The Single Source Shortest Path algorithm realizes the Single Source Shortest Path algorithm. It calculates the shortest path length from a given source vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 2.4.Weakly Connected Components
+
+The program of Weakly Connected Components has implemented the algorithm. It can calculate all the weakly connected components in the graph. A weakly connected component is a subgraph of a graph in which reachable paths exist between any two points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Connected*component*(graph_theory)](<https://en.wikipedia.org/wiki/Connected_component_(graph_theory)> "scc wiki")。
+
+### 2.5.Local Clustering Coefficient
+
+The average Clustering Coefficient program implements the Local Clustering Coefficient algorithm to calculate the coefficient of the degree of clustering between vertices in the graph. The returned results include the overall clustering coefficient and the vertex clustering coefficient. The overall agglomeration coefficient reflects the evaluation of the overall agglomeration degree in the graph, and the vertex agglomeration coefficient includes the agglomeration coefficient of any vertex, which reflects the agglomeration degree near the vertex. The higher the agglomeration coefficient, the higher the agglomeration degree. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 2.6.Label Propagation Algorithm
+
+The program implements Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and computes unauthorised graphs. In label passing, each vertex adds up all the labels received, and randomly selects one of the labels with the highest sum. The iteration converges or the algorithm terminates after a given number of rounds. The final output is a label for each vertex, and vertices with the same label value are considered to be in the same community. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+## 3.Extended algorithms
+
+### 3.1.All-Pair Shortest Path
+
+The All-Pair Shortest Path program realizes the all-pair Shortest Path algorithm and calculates the shortest path between any two points in the graph. Returns the shortest path length between any pair of vertices where the path exists. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 3.2.Betweenness Centrality
+
+Betweenness Centrality algorithm is implemented in Betweenness centrality program to estimate the betweenness centrality value of all vertices in a graph. The value of intermediate centrality reflects the possibility that any shortest path in the graph passes through the vertex, and the higher the value, the more shortest paths pass through the vertex. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 3.3.Belief Propagation
+
+The Belief Propagation algorithm is implemented in the confidence propagation program. Given the edge distribution of the observed vertices, the algorithm estimates the edge distribution of the unobserved vertices by using the mechanism of passing messages among vertices. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 3.4.Closeness Centrality
+
+The Distance Centrality program implements the Closeness Centrality algorithm, which estimates the average shortest path length from any node to other nodes in the graph. A smaller distance centrality value indicates that the node has a smaller average shortest distance to other nodes, meaning it is more centrally located in the graph from a geometric perspective. The calculation requires specifying the number of sampling points, and the algorithm computes the centrality values for each of these sampling points. For the algorithm content, please refer to [https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki").
+
+### 3.5.Common Neighborhood
+
+The Common Neighborhood program implements the common Neighborhood algorithm to count the number of common neighbors between any given pair of neighboring vertices. Given several pairs of vertices to be queried, the result is the number of common neighbors of any pair of vertices to be queried.
+
+### 3.6.Degree Correlation
+
+The Degree Correlation algorithm is implemented in the degree correlation program. It calculates the degree correlation degree of a graph by calculating the Pearson correlation coefficient between any adjacent vertex pairs, which can be used to characterize the correlation degree between high-degree vertices in the graph. A higher degree of correlation indicates a higher degree of correlation between vertices of higher degree in the graph. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 3.7.Dimension Estimation
+
+The diameter Estimation program implements the Dimension Estimation algorithm. The algorithm calculates the length of the longest shortest path in the graph, which is used to characterize the diameter of the graph. Please refer to the algorithm content[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### 3.8.EgoNet
+
+The EgoNet algorithm requires a given root vertex and K value, and takes the root vertex as the source vertex to conduct a width-first search to find the subgraph composed of all neighbors within K degrees. The found subgraph is called the EgoNet of the root vertex.
+
+### 3.9.Hyperlink-Induced Topic Search
+
+The Hyperlink Topic Search algorithm implements the Hyperlink-induced topic search algorithm, which assumes that each vertex has two attributes: Authority and Hub. A good hub vertex should point to many vertices with high authority. And a good authority vertex should be pointed to by many vertices of high pivot type. The algorithm returns the authority value and the hub value for each vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 3.10.Jaccard Index
+
+The Jaccard coefficient program implements the Jaccard Index algorithm. The algorithm calculates the Jaccard coefficient between a given pair of vertices, which can be used to represent the similarity of the two vertices. A higher Jaccard coefficient indicates a higher degree of similarity between pairs of vertices. Given several pairs of vertices with the query, the Jaccard coefficients of these pairs are returned. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### 3.11.K-core
+
+k accounting method implements k-core algorithm. The algorithm computes the number of kernels of all vertices, or finds all K-nucleon graphs in the graph. K-nucleon graph is a special subgraph in which the degree of any vertex is not less than a given K value. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Degeneracy\_(graph_theory)](<https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)> "kcore wiki")。
+
+### 3.12.Louvain
+
+The Louvain community discovery program implements the Fast-unfolding algorithm. The algorithm is a community discovery algorithm based on modularity. It maximizes the modularity of the graph by constantly merging vertex communities, and can discover the hierarchical community structure. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 3.13.Multiple-source Shortest Paths
+
+The multisource Shortest Paths program implements the multiple-source Shortest Paths algorithm to calculate the shortest path value to any vertex from the given Multiple source vertices. Where, the shortest path value of multiple source vertices to a vertex is the minimum value of the shortest path from each source vertex to the vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 3.14.Personalized PageRank
+
+Personalized web ranking program has Personalized PageRank algorithm. According to the given source vertex, the algorithm calculates the importance ranking of all vertices to the source vertex based on the source vertex. The higher the Rank value, the more important the vertex is to the source vertex. Unlike PageRank, the source vertex Rank value is 1, the rest of the vertex Rank value is 0; And a certain proportion of Rank value will be immediately transferred back to the source vertex after each round of transmission. Please refer to the algorithm content [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 3.15.Strongly Connected Components
+
+Strongly Connected component program realizes the Strongly Connected Components algorithm. The algorithm computes all strongly connected components of the graph, which is a subgraph of the graph that can start from any vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 3.16.Speaker-listener Label Propagation Algorithm
+
+The program realizes the Speaker-listener Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and historical tag record, which is an extension of tag propagation algorithm. Different from the label propagation algorithm, this algorithm records the historical labels of all vertices. When the labels are accumulated in the iteration, the historical labels are also counted. The final output is all the historical label records for each vertex. Please refer to the paper for the algorithm content:“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 3.17.Single-Pair Shortest Path
+
+The program of the shortest path between two points implements the Bidirectional point-first Search algorithm. It searches forward width First along the outgoing edge from the starting point and reverse width first along the incoming edge from the end point on the directed undirected graph. The shortest path length from the starting point to the ending point is determined by traversing the vertices of the starting point and the ending point together. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 3.18.Triangle Counting
+
+The Triangle-counting algorithm is implemented to calculate the number of triangles in an undirected graph, which can be used to characterize the correlation degree of the vertices in the graph. The higher the number of triangles, the higher the degree of correlation of the vertices in the graph. For the algorithm content, please refer to the paper, "Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study".
+
+### 3.19.Trustrank
+
+The Trust Index Sorting Algorithm implements the Trustrank algorithm, which can calculate the Trust Index of any vertex based on a given whitelist. The higher the trust score, the less likely the vertex is to be illegal. Please refer to the algorithm content for details. [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 3.20.Weighted Label Propagation Algorithm
+
+Weighted Label Propagation Algorithm is implemented in the program. = Different from the label propagation algorithm, the label transmission is related to the weight of the edge. During label transmission, the weight of each vertex will be accumulated according to the incoming edge of the label, and the label with the highest sum will be randomly selected. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 3.21.Weighted Pagerank Algorithm
+
+Weighted Pagerank is implemented in the weighted Pagerank algorithm. Different from PageRank algorithm, the transfer of Rank value is related to the weight of the edge. The Rank value of the vertex will be transferred to the adjacent vertices according to the weight of the edge. Please refer to the algorithm content[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 3.22.Maximal independent set
+
+Maximal independent set algorithm implements Maximal Independent Set algorithm. A maximum independent set means that there are no vertices outside the independent set that can join it. A graph may have many MIS that vary greatly in size, and the algorithm finds one of them. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### 3.23.Sybil Rank
+
+Sybil detection algorithm implements Sybil Rank algorithm. The SybilRank algorithm starts from non-Sybil nodes and performs a random walk with premature termination. Please refer to the paper for the algorithm content:“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 3.24.Subgraph Isomorphism
+
+The subgraph matching algorithm implements the subgraph_isomorphism algorithm. The subgraph_isomorphism algorithm matches all nodes in the whole graph and outputs the number of times each node is matched. Algorithm Content Reference [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 3.25.Motif
+
+Pattern matching algorithm implements motif algorithm. motif algorithm matches k-order subgraphs for the specified nodes, and finally outputs the number of each kind of K-order subgraphs for each specified node. Each K-order subgraph is represented by a 64-bit integer, and the $i \times k + j$bit is 1, indicating that there is an edge i->j in the subgraph. Algorithm Content Reference [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### 3.26.Kcliques
+
+The K-order clique counting algorithm implements the k-cliques algorithm. The k-cliques algorithm calculates the number of all K-order complete subgraphs in the graph, and finally outputs the number of k-order complete subgraphs of each node. Algorithm Content Reference [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### 3.27.Ktruss
+
+The k-order truss counting algorithm implements the k-truss algorithm. A k-truss is a subgraph in which each edge is the edge of at least k-2 triangles. The k-truss algorithm finds out the k-truss subgraph of the graph, and finally outputs the neighbor node list of each node in the subgraph. Algorithm Content Reference[https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+
+### 3.28.Leiden
+
+Leiden algorithm implements Leiden's algorithm. leiden algorithm is a community discovery algorithm based on modularity. Compared with louvain algorithm, leiden algorithm has the advantage that Leiden algorithm detects the broken links in the community to ensure that each community has good connectivity. Algorithm Content Reference [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/index.rst
new file mode 100644
index 0000000000..dc955b3b91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/2.olap/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
new file mode 100644
index 0000000000..47c814d627
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
@@ -0,0 +1,337 @@
+# TuGraph Stored Procedure Guide
+
+> This document mainly explains the instructions for using the TuGraph stored procedure.
+
+## 1. Introduction
+
+When the query/update logic that users need to express is more complex (such as cannot be described by Cypher or has high performance requirements), compared to calling multiple requests and completing the entire processing flow on the client, the stored procedure provided by TuGraph is a more concise and efficient choice.
+
+Similar to traditional databases, the TuGraph stored procedure runs on the server side. Users can encapsulate the processing logic (i.e., multiple operations) into a procedure call, and further improve performance by parallel processing (such as using relevant C++ OLAP interfaces and built-in algorithms) during implementation.
+
+There is a special type of API in the stored procedure for parallel data operations, which we call the Traversal API. Please refer to the [documentation](2.traversal.md) for more information.
+
+## 2. Stored Procedure Version
+
+Currently, TuGraph supports two versions of stored procedures, which are suitable for different scenarios. Version 3.5 only supports v1, which can be directly called through the REST or RPC interface. Starting from version 3.5, v2 is supported, which allows embedding calls in graph query languages ​​(such as Cypher). We call it POG (Procedure On Graph query language, APOC).
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+|Applicable Scenarios	|Extreme performance or complex multi-transaction management scenarios	|General scenarios, highly integrated with Cypher|
+|Transaction	|Created internally in the function, multiple transactions |can be freely controlled	Passed into the external function, single transaction|
+|Signature (parameter definition)	|Not required	|Required|
+|Input and output parameter types	|Not required to specify	|Need to specify parameter types|
+|Cypher Standalone Call	|Supported	|Supported
+|Cypher Embeded Call	|Not supported	|Supported|
+|Language	|C++/Python/Rust	|C++|
+|Calling mode	|Directly pass the string, usually in JSON format	|Through variables in Cypher statements|
+
+
+In TuGraph, stored procedures v1 and v2 are managed separately, and support for create, delete, and query operations is provided. However, it is still not recommended to have the same name for multiple stored procedures.
+
+## 3. Supported Languages
+
+In TuGraph, users can dynamically load, update, and delete stored procedures. TuGraph supports the use of C++, Python, and Rust languages to write stored procedures. Among them, C++ language has the most complete support and the best performance.
+
+Note that the stored procedure is the logic compiled and executed on the server side, which is independent of the language support on the client side.
+
+## 4. Procedure v1 Interface
+
+## 4.1.Write stored procedures
+### 4.1.1.Write C++ stored procedure
+
+Users can write C stored procedures by using core API or Traversal API. An example of a simple C stored procedure is as follows:
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## Count all students whose age is 10
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+From the code, we can see the entry of a TuGraph C++ stored procedure is the `Process` function, with three parameters:
+
+- `db`: the TuGraph database instance
+- `request`: the input data, which can be a binary byte array, or any other format such as JSON string.
+- `response`: the output data, which can be a string or directly return binary data.
+
+The return value of the `Process` function is a boolean value. When it returns `true`, it means that the request is successfully completed, otherwise it means that the stored procedure found an error during execution, and the user can return an error message through `response` to facilitate debugging.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which is `age_10` in the above example. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, age_10.so will be generated, which can then be loaded into the server by the user.
+
+### 4.1.2 Writing Python stored procedures
+
+The following snippet does the same thing as the above C++ stored procedure, but via TuGraph Python API:
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+The Python stored procedure returns a tuple, the first element of which is a Boolean value indicating whether the stored procedure was successfully executed; the second element is a `str`, which contains the result to be returned.
+
+Python stored procedures do not need to be compiled and can be loaded directly.
+
+## 4.2.How to use stored procedures
+
+### 4.2.1.Install Stored Procedures
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `age_10.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+                  headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `age_10.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+### 4.2.2.List Stored Procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.Retrieve Stored Procedures Detail
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.Uninstall Stored Procedures
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+### 4.2.6.Upgrade Stored Procedures
+
+You can upgrade a stored procedure with the following two steps:
+
+1. Uninstall the existing one.
+2. Install the new on.
+
+TuGraph carefully manages the concurrency of stored procedure operations. Upgrading stored procedures will not affect concurrent runs of existing ones.
+
+## 5. Procedure v2 Interface
+
+### 5.1.Writing stored procedures
+
+Users can write C++ stored procedures by using lgraph API. A simple C++ stored procedure example is as follows:
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   std::string &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response = std::string("error parsing json: ") + e.what();
+        return false;
+    }
+
+    Result result({{"node", LGraphType::NODE},
+                   {"salt", LGraphType::FLOAT},
+                   });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = result.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    response = result.Dump();
+    return true;
+}
+```
+
+From the code we can see:
+- The stored procedure defines a method `GetSignature` to get the signature. This method returns the signature of the stored procedure, which includes input parameter names and their types, and return parameters and their types. This enables the Cypher query statement to use the signature information to verify whether the input data and the returned data are reasonable when calling the stored procedure.
+- The entry function is the `ProcessInTxn` function, which has three parameters, which are:
+
+- `txn`: The transaction of the stored procedure, generally speaking, the transaction of the Cypher statement that calls the stored procedure.
+- `request`: input data, its content is the string of the input parameter type defined in `GetSignature` and the value passed in the Cypher query statement after json serialization. e.g. `{num_iteration: 10}`
+- `response`: output data, in order to ensure compatibility in the Cypher language, users can write the data processed by the stored procedure to `lgraph_api::Result`, and finally use `lgraph_api::Result::Dump` to serialize it into data in json format.
+
+The return value of the `ProcessInTxn` function is a boolean value. When it returns `true`, it means that the request was successfully completed, otherwise it means that the stored procedure found an error during execution.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which in the above example is `custom_pagerank`. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, custom_pagerank.so will be generated, which can then be loaded into the server by the user.
+
+### 5.2.Load stored procedure
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `custom_pagerank.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `custom_pagerank.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+#### 5.2.1.List loaded stored procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.Get stored procedure details
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.Delete stored procedure
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+#### 5.2.5.Update stored procedure
+
+Updating a stored procedure requires the following two steps:
+
+1. Delete the existing stored procedure
+2. Install the new stored procedure
+
+TuGraph carefully manages the concurrency of stored procedure operations, and updating stored procedures will not affect the operation of existing stored procedures.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
new file mode 100644
index 0000000000..e4abd3a263
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
@@ -0,0 +1,125 @@
+# Traversal API
+
+> This document mainly explains the Traversal API in the stored procedure of TuGraph.
+
+1. Introduction
+The powerful online analytical processing (OLAP) capability of TuGraph is an important feature that sets it apart from other graph databases. With the help of the C++ OLAP API (olap_on_db.h), users can quickly export a subgraph that needs to be analyzed, and then run iterative graph computing processes such as PageRank, connected components, and community detection on it, and then make corresponding decisions based on the results. The export and computation processes can be accelerated through parallel processing, achieving almost real-time analysis and processing, and avoiding the lengthy steps of traditional solutions that require exporting, transforming, and reimporting (ETL) data into dedicated analytical systems for offline processing.
+
+TuGraph has built-in many commonly used graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement specific graph computing processes themselves. They just need to include the header files (.h files) of the corresponding algorithm library in their own programs when implementing their own storage procedures, and link the corresponding dynamic library files (.so) during compilation. In general, the only process that users need to implement themselves is the extraction of the subgraph to be analyzed.
+
+Currently, the Traversal API only supports C++.
+
+## 2. Interface
+
+### 2.1. Snapshot
+
+The Snapshot template class in C++ OLAP API is used to represent extracted static subgraphs. The EdgeData is used to represent the data type of the weight used for each edge in the subgraph. If the edges do not require weights, Empty is used as the EdgeData.
+
+The extracted subgraph can be described using the constructor of the Snapshot class.
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+In the above text, "db" represents the database handle, "txn" represents the transaction handle, and "flags" represents the options used during generation, with the optional values including the following combinations: SNAPSHOT_PARALLEL indicates that multiple threads are used for parallel extraction during export; SNAPSHOT_UNDIRECTED indicates that the exported graph needs to be transformed into an undirected graph.
+
+"vertex_filter" is a user-defined filtering function for vertices, where a return value of true indicates that the vertex needs to be included in the extracted subgraph, and vice versa.
+
+"out_edge_filter" is a user-defined filtering function for edges, where a return value of true indicates that the edge needs to be included in the extracted subgraph, and vice versa.
+
+When the filtering functions are set to default values, it means that all vertices/edges should be included.
+
+For other methods provided by the Snapshot class, please refer to the detailed C++ API documentation (olap_on_db.h).
+
+### 2.2. Traversal
+
+A common type of analysis in graph databases is to start from one or more vertices and iteratively expand and access their neighbors. Although this type of analysis can be done using Cypher, its performance is limited by the serial interpretation and execution when the depth of traversal is large. Writing stored procedures using the C++ Core API eliminates the overhead of interpretation but is still limited by the processing power of a single thread.
+
+In order to enable users to accelerate these types of analysis tasks through parallel processing, we have wrapped a Traversal framework based on the C++ OLAP API. Users can directly use the FrontierTraversal and PathTraversal classes in this framework to perform iterative traversal analysis tasks. For specific usage instructions, please refer to the corresponding C++ API documentation (lgraph_traversal.h).
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+This method can be used to find all vertices that satisfy a certain condition (when the filter returns true). When the "parallel" parameter is set to true, the search process will be executed in parallel.
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+This method can be used to extract (VertexData type) properties from a specified set of vertices (frontier) using the extract method. When the "parallel" parameter is set to true, the extraction process will be executed in parallel.
+
+FrontierTraversal is suitable for cases where only the traversed set of vertices is of interest. When a user needs to access information along the path (vertices/edges along the path) in the traversal process or result, PathTraversal needs to be used. Both types of traversal have four parameters in their constructor, namely the database handle db, transaction handle txn, options flags and capacity. The available options include the following combinations: TRAVERSAL_PARALLEL indicates that multiple threads are used for parallel traversal; TRAVERSAL_ALLOW_REVISITS indicates that vertices can be visited repeatedly during traversal (PathTraversal implicitly includes this option).
+capacity indicates the capacity of the path collection during initialization.
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+Both types of traversal have three ways to set the starting vertex/vertex set for traversal. The first two methods directly specify the vertex ID, while the last method is similar to FindVertices.
+
+Both types of traversal start from the set of vertices in the current layer. They use the extension function to access each outgoing edge/incoming edge/outgoing and incoming edges, and use a user-defined filter function to determine if the extension is successful. If successful, the neighboring vertex/appended path with the edge is added to the set of vertices/paths in the next layer.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+The above describes the three traversal methods of FrontierTraversal. It starts from the current set of vertices and, for each vertex in the set, iterates through each outgoing edge/incoming edge/outgoing and incoming edges. If the edge or neighbor vertex satisfies the user-defined filter conditions (where edge_filter is the filter function for edges and neighbour_filter is the filter function for neighbor vertices), the neighbor vertex is added to the new set of vertices.
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+After the expansion of the current set of vertices is finished, the new set of vertices can be obtained using the above method.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+The three traversal methods of PathTraversal are similar to FrontierTraversal, except that the user-defined filter function adds two additional parameters: Path, which contains the path before the new edge is expanded, and IteratorHelper, which can be used to convert the vertices/edges in the path to corresponding iterators in the database. The relevant documentation can be found in the corresponding C++ API documentation.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
new file mode 100644
index 0000000000..abc5ce2ccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
@@ -0,0 +1,5 @@
+base64_encode
+===================================
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
new file mode 100644
index 0000000000..b321c843d6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
@@ -0,0 +1,5 @@
+lgraph_result
+===================================
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
new file mode 100644
index 0000000000..0f53077dbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
@@ -0,0 +1,5 @@
+lgraph_rpc_client
+===================================
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
new file mode 100644
index 0000000000..d7a9d7b97c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
@@ -0,0 +1,5 @@
+lgraph_traversal
+===================================
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
new file mode 100644
index 0000000000..4b0be46a21
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
@@ -0,0 +1,5 @@
+lgraph_txn
+===================================
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
new file mode 100644
index 0000000000..4047340ef0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
@@ -0,0 +1,5 @@
+lgraph_types
+===================================
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
new file mode 100644
index 0000000000..12814e7618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
@@ -0,0 +1,5 @@
+lgraph_utils
+===================================
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
new file mode 100644
index 0000000000..572f9ae7c0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
new file mode 100644
index 0000000000..5bfa8a1dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
new file mode 100644
index 0000000000..8680a93ee9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
@@ -0,0 +1,5 @@
+olap_base
+===================================
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
new file mode 100644
index 0000000000..9ce3afba80
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
@@ -0,0 +1,5 @@
+olap_on_db
+===================================
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
new file mode 100644
index 0000000000..5bed2e061c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
@@ -0,0 +1,5 @@
+lgraph
+===================================
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
new file mode 100644
index 0000000000..82bf0941c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
@@ -0,0 +1,5 @@
+olap_profile
+===================================
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
new file mode 100644
index 0000000000..8723e9f1d0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
@@ -0,0 +1,5 @@
+lgraph_atomic
+===================================
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
new file mode 100644
index 0000000000..ec8af7bb8f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
@@ -0,0 +1,5 @@
+lgraph_date_time
+===================================
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
new file mode 100644
index 0000000000..07d6076327
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
@@ -0,0 +1,5 @@
+lgraph_db
+===================================
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
new file mode 100644
index 0000000000..07f4be3f67
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
new file mode 100644
index 0000000000..5be9e6547e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
new file mode 100644
index 0000000000..70a0bd4cbf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
@@ -0,0 +1,5 @@
+lgraph_exceptions
+===================================
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
new file mode 100644
index 0000000000..a4f9af0582
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
@@ -0,0 +1,5 @@
+lgraph_galaxy
+===================================
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
new file mode 100644
index 0000000000..1c343152d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
@@ -0,0 +1,8 @@
+C++ stored procedure API
+===================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..c19a0d32b5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
@@ -0,0 +1,29 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python stored procedure API
+====================================
+Version: 4.0.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..7e12ce4db1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
@@ -0,0 +1,17 @@
+# Rust Stored Procedures
+
+## 1. Introduction
+Rust stored procedures currently only support v1 version. TuGraph supports plugins in any language that can be compiled into a dynamic library. Rust, as a rising star in system programming languages, has significant advantages in terms of safety, reliability, and ergonomics compared to C++.
+
+We provide the Rust binding library for TuGraph to support calling lgrahp API in Rust. We also provide the [tugraph-plugin-util](https://crates.io/crates/tugraph-plugin-util ) utility library to help simplify the process of writing Rust plugins.
+
+## 2. How to Use
+
+Using Rust stored procedures involves three steps:
+* Compilation: Compile the Rust source code into a dynamic library (so file). We have prepared a comprehensive plugin development tutorial that covers everything from IDE plugin installation and environment setup to compilation. Please refer to the `rust-tugraph-plugin-tutorial` for detailed instructions.
+* Loading: Load the dynamic library (so file) into the server. This can be done through the REST or RPC interface, similar to the usage of C++ libraries. Please refer to the documentation for more details on the [Procedure v1 API](1.procedure.md#4.Procedure v1 interface).
+* Execution: Once the library is loaded, use it as you would with a C++ stored procedure. The process is the same and does not need further explanation.
+
+## 3. API Documentation
+
+In the Rust community, all code and documentation can be found on [`crates.io`](https://crates.io/crates/tugraph ) and [`docs.rs`](https://docs.rs/tugraph/latest/tugraph ).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile
new file mode 100644
index 0000000000..0ef611594e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.0.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst
new file mode 100644
index 0000000000..9dee2a39b9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst
@@ -0,0 +1,12 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure/index.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
new file mode 100644
index 0000000000..83cc10c52e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
new file mode 100644
index 0000000000..1183184e51
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
@@ -0,0 +1,2736 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+:warning: **All the other RESTful APIs excluding the three below will be deprived after 4/30/2023.**
+- **Login**
+- **Query**
+- **Store Procedures**
+
+## 2.Protocols And Data Format
+
+### 2.1.Protocols
+
+Both HTTP and HTTPS protocols are supported by TuGraph. The system uses HTTP protocol by default. To use HTTPS, the `ssl_auth` option should be set to `true` in the DB configuration.
+
+### 2.2.Request
+
+TuGraph supports HTTP GET/POST/PUT/DELETE requests, in which:
+
+- `GET` requests are used for read-only requests, such as getting vertex properties, edge properties, etc.
+
+- `POST` requests are used to create entities, submit Cypher, and to manage and call stored procedures;
+
+- `PUT` requests are used to modify existing entities, for example, to modify vertex properties, edge properties, etc.
+
+- `DELETE` requests are used to delete existing entities, such as vertices, edges, etc.
+
+In high-availability mode, users can set `ServerVersion` in the request header to make sure the request is never served with an outdated version.
+The current `ServerVersion` can be obtained from the header returned by the server.
+
+### 2.3.Response
+
+TuGraph returns the following HTTP status codes:
+
+- **200 OK**: operation is successful.
+- **307 Temporary Redirect**: the operation is redirected, typically in high-availability mode, to the master.
+- **400 Bad Request**: incorrect input, such as URI error, or invalid parameters.
+- **500 Internal Server Error**: server error.
+
+When the operation is successful, the JSON response contains the return value of the operation. When the operation is redirected, the `location` field in the returned HTTP header contains the redirect destination address.
+When an input error or server error occurs, the JSON response contains a `error_message` field that describes the error.
+
+In high-availability mode, the server will set `server_version` field in the header to inform the client of the data version of the current server. When clients switch between several different servers, this version number guarantees that the client will not read from an outdated server.
+
+### 2.4.Data Format
+
+The server and clients exchange data in JSON format. When sending a request, the header of the HTTP request should be set with `Accept:application/json, Content-Type:app/json`.
+For example, to create a new vertex, the request header should look like the following:
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.5.URI Format
+
+TuGraph REST API provides access to: web visualization, login, db info, label, index, node, relationship, cypher, task, cpp_plugin, and python_plugin.
+The URI format used for each function is as follows:
+
+| URI     | Description                     |
+| ------- | ------------------------------- |
+| /web    | web visualization               |
+| /cypher | cypher request                  |
+| /acl    | access control                  |
+| /user   | user management                 |
+| /login  | user login                      |
+| /info   | database status and information |
+| /task   | task management                 |
+| /db     | subgraph management             |
+
+For each subgraph, the following interfaces are provided:
+
+| URI                              | Description                         |
+| -------------------------------- | ----------------------------------- |
+| /db                              | create, modify, and delete subgraph |
+| /db/_{graph_name}_/node          | vertex operations                   |
+| /db/_{graph_name}_/relationship  | edge operations                     |
+| /db/_{graph_name}_/label         | label-related operations            |
+| /db/_{graph_name}_/index         | index-related operations            |
+| /db/_{graph_name}_/cypher        | subgraph-specific cypher operation  |
+| /db/_{graph_name}_/cpp_plugin    | C++ plugin(stored procedure)        |
+| /db/_{graph_name}_/python_plugin | Python plugin(stored procedure)     |
+| /db/_{graph_name}_/import        | online import                       |
+| /db/_{graph_name}_/misc          | other operations                    |
+
+## 3.Login
+
+The system creates an administrator by default, whose username is _admin_ and password is _73@TuGraph_. For security reasons, please remember to change your password after first starting the server.
+
+### 3.1.User Login
+
+TuGraph provides JWT-based user authentication. To login to the server, a REST client should send login request with username and password. On success, the client will receive a signed token in the form of Json Web Token (JWT), which should be stored by the client and used for every request that follows.
+
+- **URI**: `/login`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| user     | username    | String |
+| password | password    | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.2.Token Refresh
+
+After the token expires, the front-end initiates a refresh token interface, and the back-end verifies the validity of the token.
+If the verification passes, a new token is generated; if the verification fails, status code 401 is returned.
+
+- **URI**: `/refresh`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.Modify Token Validity Period
+
+To modify the validity period of Token, three parameters need to be transmitted: jwt, refresh_time and expire_time, among which jwt is used to verify the user’s identity. When refresh_time and expire_time are equal to 0, the validity period is indefinite. When refresh_time exceeds, you need to call the refresh interface to obtain a new Token; When expire_time expires, you need to log in again. (This interface call needs to confirm the security by itself, do not call unless necessary)
+
+- **URI**: `/update_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+| refresh_time | Valid time (deafult set to 0) | Int64 |
+| expire_time | Expire time (deafult set to 0) | Int64 |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.Query Token validity period
+To query the validity period of the Token, you need to transmit jwt to verify the user's identity, and return, refresh_time and expire_time, where refresh_time indicates the refresh time, and you need to call the refresh interface to obtain a new Token when it exceeds; expire_time indicates the expiration time, and you need to log in again when it exceeds.
+
+- **URI**: `/get_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return "refresh_time" and "expire_time".
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+### 3.5.Logout
+
+The user logs out and deletes the token at the same time.
+
+- **URI**: `/logout`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+## 4.Query
+
+URI format is:
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.Call Cypher
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description   | Type   |
+| ------ | ------------- | ------ |
+| graph  | subgraph name | String |
+| cypher | Cypher query  | String |
+
+- **RESPONSE**:
+
+| Field   | Description             | Type    |
+| ------- | ----------------------- | ------- |
+| result  | running results         | List    |
+| elapsed | running time in seconds | Float   |
+| header  | header of the results   | List    |
+| size    | number of results       | Integer |
+
+in which `header` is a list with each element in the form of:
+
+| Field | Description                                                | Type   |
+| ----- | ---------------------------------------------------------- | ------ |
+| name  | the name of column                                         | String |
+| type  | column data type, 0 is scalar, 1 is vertex id, 2 is vector |        |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.Call Cypher with Parameters
+
+Cypher supports querying with parameters. When a Cypher query with parameters is called, TuGraph caches the execution plan for that query to speed up the following queries of the same kind.
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type   |
+| ---------- | ------------- | ------ |
+| graph      | subgraph name | String |
+| cypher     | Cypher query  | String |
+| parameters | parameters    | List   |
+
+- **RESPONSE**:
+
+Same as [Call Cypher](#Call-Cypher).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+## 5.Stored Procedures
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.Create Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                                                                       | Type   |
+| ----------- | --------------------------------------------------------------------------------- | ------ |
+| name        | name of the plugin                                                                | String |
+| description | description of the plugin                                                         | String |
+| code_base64 | code of plugin encoded in base64                                                  | String |
+| read_only   | whether it is a read-only stored procedure                                        | Bool   |
+| code_type   | type of plugin code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String |
+
+_Note: read-only plugins are more efficient than write plugins. Always specify `read-only=true` for read-only transactions._
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.so}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 5.2.List Stored Procedures
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list in which each element is a plugin description, in the format of:
+
+| Field       | Description                               | Type   |
+| ----------- | ----------------------------------------- | ------ |
+| name        | name of the stored procedure              | String |
+| description | description of the stored procedure       | String |
+| read_only   | whether the stored procedure is read-only | Bool   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.Retrieve Stored Procedure Detail
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Procedure detail, including code, in the format of:
+
+| Field       | Description                                                                         | Type                   |
+| ----------- | ----------------------------------------------------------------------------------- | ---------------------- |
+| name        | Procedure name                                                                      | String                 |
+| description | Procedure descrition                                                                | String                 |
+| read_only   | Read only or not                                                                    | Bool                   |
+| code_base64 | 存储过程的代码                                                                      | String, Base64 encoded |
+| code_type   | Type of procedue code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String                 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.Call Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: POST
+
+- **REQUEST**: String input.
+
+| Field   | Description                                               | Type   |
+| ------- | --------------------------------------------------------- | ------ |
+| data    | input data                                                | String |
+| timeout | timeout in seconds, defaults to 0, which means no timeout | Float  |
+
+- **RESPONSE**:
+
+| Field  | Description     | Type   |
+| ------ | --------------- | ------ |
+| result | running results | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.Delete Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+## 6.Deprecated
+
+The APIs below will be removed after 4/30/2023.
+
+### 6.1.User Management
+
+#### 6.1.1.Add User
+
+Add a new user and set the initial password for the user. Only administrators have permission to add new users. The username can only have letters, numbers, and underscores, and should not begin with a number. The password can contain any character. The username and password have a maximum length of 64 bytes.
+
+- **URI**: `/user`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                                 | Type   |
+| -------- | ------------------------------------------- | ------ |
+| user     | username                                    | String |
+| password | password                                    | String |
+| is_admin | whether the user is an administrator or not | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "is_admin": false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.Change Password
+
+Users can change their own passwords, in which case the original password needs to be verified.
+
+Administrators can change the passwords of any user and promote non-admin users to administrators, or demote administrator users to regular users. When modifying another user's password, the original password of the user is not needed.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field            | Description                                                                     | Type   |
+| ---------------- | ------------------------------------------------------------------------------- | ------ |
+| current_password | user's current password, if modifying its own password                          | String |
+| new_password     | user's new password                                                             | String |
+| is_admin         | should this user be administrator or not, used when promoting or demoting users | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user/user1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+        "is_admin": true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.3.List All Users
+
+List all users of the database. Only administrators are allowed to perform this operation.
+
+- **URI**: `/user/`
+
+- **METHOD**: GET
+
+- **RESPONSE**: a dictionary of {`user_name`:`is_admin`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+    • 200: OK
+    Output:
+    {
+        "admin": true,
+        "guest1": false
+    }
+
+#### 6.1.4.Delete User
+
+Delete a user from the DB. Only administrators have permission to do so.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.2.Access Control
+
+TuGraph has four access levels. Different users can have different permissions for each subgraph. The four access levels are as follows:
+
+| Access Level | Description                                                                                                               |
+| ------------ | ------------------------------------------------------------------------------------------------------------------------- |
+| NONE         | no access                                                                                                                 |
+| READ         | read-only                                                                                                                 |
+| WRITE        | can read and write vertexes and edges of the subgraph                                                                     |
+| FULL         | full access, including changing metadata (label, index), managing stored procedures and deleting all data in the subgraph |
+
+Administrators have full access on all subgraphs, and a newly created non-admin user does not have access for any subgraph. Users who have full access on a subgraph can set the access level for other users on that subgraph.
+
+#### 6.2.1.Query User's Access Level
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+When both `user` and `graph` are specified, the user's access level for the subgraph is returned, such as `READ`.
+
+When only `user` is specified, all subgraphs that the user can access (access level not `NONE`) are returned, as well as the user's access level on the subgraph.
+
+When only `graph` is specified, all users who have access level on this graph (excluding administrators, who have implicit `FULL` access) and their access levels are returned. This operation requires administrator permission.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/acl/?user=user1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "graph1": "READ",
+      "graph2": "WRITE",
+      "graph3": "FULL"
+    }
+```
+
+#### 6.2.2.Change User's Access Level
+
+- **URI**: `/acl`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field | Description     | Type   |
+| ----- | --------------- | ------ |
+| user  | username        | String |
+| graph | subgraph's name | String |
+| acl   | access level    | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/acl
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "user1",
+        "graph": "graph1",
+        "acl": "FULL"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.Remove User's Access Right
+
+This is equivalent to setting access level to `NONE`.
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/acl/?user=user1&graph=graph1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.Server Status
+
+#### 6.3.1.Modify Server Configuration
+
+Modifying the server configuration will take effect immediately after the configuration modification and will affect all servers. These configurations take precedence over configuration files and command line arguments.
+
+- **URI**: `/config`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+  | Field            | Description                                           | Type |
+  | ---------------- | ----------------------------------------------------- | ---- |
+  | db_async         | Whether to enable asynchronous mode                   | Bool |
+  | optimistic_txn   | Whether to use optimistic transaction lock by default | Bool |
+  | enable_audit_log | Whether to enable audit logging                       | Bool |
+
+- **RESPONSE**: If successful, return status code 200.
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "db_async": true,
+        "enable_audit_log": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.Current Server Status
+
+- **URI**: `/info`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field          | Description                    | Type                                                                                    |
+| -------------- | ------------------------------ | --------------------------------------------------------------------------------------- |
+| lgraph_version | TuGraph version                | String                                                                                  |
+| git_branch     | server's git branch            | String                                                                                  |
+| git_commit     | server's git commit version    | String                                                                                  |
+| web_commit     | web client commit version      | String                                                                                  |
+| cpp_id         | cpp compiler id                | String                                                                                  |
+| cpp_version    | cpp compiler version           | String                                                                                  |
+| python_version | python lib version             | String                                                                                  |
+| cpu            | cpu information                | Dictionary, format refers [CPU Status](#CPU-Status)                                     |
+| disk           | disk IO information            | Dictionary, format refers [Disk Status](#Disk-Status)                                   |
+| memory         | memory information             | Dictionary, format refers [Memory Status](#Memory-Status)                               |
+| db_space       | graph database storage         | Dictionary, format refers [Graph Database Storage](#Graph-Database-Storage)             |
+| db_config      | graph database configuration   | Dictionary, format refers [Graph Database Configuration](#Graph-Database-Configuration) |
+| up_time        | database's online running time | Integer                                                                                 |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.CPU Status
+
+- **URI**: `/info/cpu`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description        | Type    |
+| ------ | ------------------ | ------- |
+| self   | TuGraph CPU usage  | Integer |
+| server | server's CPU usage | Integer |
+| unit   | metric unit        | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.Disk Status
+
+- **URI**: `/info/disk`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description              | Type    |
+| ----- | ------------------------ | ------- |
+| read  | server's disk read rate  | Integer |
+| write | server's disk wrtie rate | Integer |
+| unit  | metric unit              | String  |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.Memory Status
+
+- **URI**: `/info/memory`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description               | Type    |
+| ------------ | ------------------------- | ------- |
+| self         | TuGraph memory usage      | Integer |
+| server_avail | server's available memory | Integer |
+| server_total | server's total memory     | Integer |
+| unit         | metric unit               | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.Database Size
+
+- **URI**: `/info/db_space`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                | Type    |
+| ----- | -------------------------- | ------- |
+| space | total size of the database | Integer |
+| unit  | metric unit                | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.DB Configuration
+
+- **URI**: `/info/db_config`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description                                       | Type    |
+| ------------ | ------------------------------------------------- | ------- |
+| async        | asynchronous mode                                 | Bool    |
+| disable_auth | whether to disable authentication                 | Bool    |
+| enable_ha    | whether to enable high-availability mode          | Bool    |
+| enable_rpc   | whether to enable RPC server                      | Bool    |
+| host         | bound host address                                | String  |
+| port         | port of REST server                               | Integer |
+| rpc_port     | port of RPC server                                | Integer |
+| thread_limit | limit of available threads for the graph database | Integer |
+| use_ssl      | whether to use SSL for authentication             | Bool    |
+| verbose      | verbose level of the output                       | Integer |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "host":"127.0.0.1",
+      "port":7070,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "use_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.7.High Availability Server List
+
+Get a list of replication servers. Valid only in high-availability mode.
+
+- **URI**: `/info/peers`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of server information, each of server information is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+| state        | server state          | String |
+
+The server state can be `MASTER`, `SLAVE`, or `OFFLINE`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.8.Current Leader Information
+
+Get information of current leader. Valid only in HA mode.
+
+- **URI**: `/info/leader`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current leader server information, which is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.9.Server Statistics
+
+- **URI**: `/info/statistics`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current server statistics, which is formatted as:
+
+| Field           | Description                                   | Type    |
+| --------------- | --------------------------------------------- | ------- |
+| requests/second | number of requests processed per second       | Float   |
+| writes/second   | number of write requests processed per second | Float   |
+| running_tasks   | number of requests in progress                | Integer |
+| failure_rate    | request failure rate                          | Float   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 0.023,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.10.Get Audit Logs
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+
+| Field            | Description                                                                                                             | Type      |
+| ---------------- | ----------------------------------------------------------------------------------------------------------------------- | --------- |
+| begin_time       | start time of the queried log (required, format YYYY-mm-dd HH:MM:SS)                                                    | Timestamp |
+| end_time         | end time of the queried log (default is current time, format YYYY-mm-dd HH:MM:SS)                                       | Timestamp |
+| user             | the operator of the queried log (administrator can query all users' logs, ordinary users can only query their own logs) | String    |
+| num_log          | maximum number of logs to return (default 100)                                                                          | Integer   |
+| descending_order | whether to sort the result in descending order(default is true)                                                         | Bool      |
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of audit logs, each of which is an action log in the format of:
+
+| Field      | Description                                        | Type    |
+| ---------- | -------------------------------------------------- | ------- |
+| index      | the index of the operation                         | Integer |
+| begin_time | the start time of the operation                    | String  |
+| end_time   | the end time of the operation                      | String  |
+| user       | the user of the operation                          | String  |
+| graph      | the graph of the operation                         | String  |
+| type       | the type of the operation                          | String  |
+| read_write | the operation is read operation or write operation | String  |
+| success    | whether the operation is successful                | Bool    |
+| content    | the content of the operation                       | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.Task Management
+
+TuGraph tracks long-running tasks such as complex Cypher queries and plugins. Administrators can query currently running tasks through the REST API and choose to abort the queries if necessary.
+
+The URI format for task management is :
+
+```
+    http://{host}:{port}/task/{task_id}
+```
+
+#### 6.4.1.List Running Tasks
+
+- **URI**: `/task`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+The returned JSON is an array, each of which is formatted as follows:
+
+| Field        | Description                                      | Type   |
+| ------------ | ------------------------------------------------ | ------ |
+| description  | the description of the task                      | String |
+| time_elapsed | time the task has been executing for, in seconds | Float  |
+| task_id      | the ID of the task                               | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.Abort Task
+
+- **URI**: `/task/{task_id}`
+
+Where `task_id` is the `task_id` returned by `GET /task` .
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.5.Subgraph Management
+
+TuGraph supports multiple subgraphs and all subgraphs are completely independent from others. Different subgraphs can have different permissions to different users. Administrators can add, modify and delete subgraphs.
+
+#### 6.5.1.Create New Subgraph
+
+- **URI**: `/db`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description                   | Type                                                                |
+| ------ | ----------------------------- | ------------------------------------------------------------------- |
+| name   | the name of subgraph          | String                                                              |
+| config | the configuration of subgraph | Dictionary, in the format of {{column name 1}:{column value 1},...} |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1"
+        "config" : {
+            "max_size_GB":2048,
+            "async":True
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.Delete Subgraph
+
+- **URI**: `/db/{graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.List All Subgraphs
+
+- **URI**: `/db`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of all subgraphs.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_gb":1024,
+            "async":false
+        }
+    }
+```
+
+### 6.6.Label
+
+TuGraph is a strong-schema database. In each subgraph, each vertex and edge need to have a predefined data format. The data format is determined by Label. Users can use the REST API to add, delete, and query labels and their corresponding data format.
+
+The URI format of the Label operation is
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+Where the {type} can be `node` or `relationship`.
+
+#### 6.6.1.Create Label
+
+A label is created with a fixed data format. A label must be defined before any node or relationship can be created with that label.
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field            | Description                  | Type   |
+| ---------------- | ---------------------------- | ------ |
+| name             | the name of label            | String |
+| fields           | data column definition       | List   |
+| is_vertex        | whether it is a vertex Label | Bool   |
+| primary          | vertex primary property      | String |
+| edge_constraints | edge constraints             | List   |
+
+`primary` should be set when `is_vertex` is `true`. This field is only available for Vertex, and must be set when creating Vertex.
+
+`edge_constraints` could be set when `is_vertex` is `false`, This field is only available for Edge. This field limits the combination of starting and ending vertex of the edge, for example: `[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, just leave this field unset.
+
+In which `fields` is an array, in which each element defines a column of data, as follows:
+
+| Field    | Description                                                | Type                                                                                                         |
+| -------- | ---------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------ |
+| name     | the name of the column                                     | String                                                                                                       |
+| type     | the data type of the column                                | String, with following types: int8, int16, int32, int64, float, double, string, date, datetime, binary, blob |
+| optional | whether the data can be empty (optional, default is false) | Bool                                                                                                         |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.List All Labels
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description               | Type |
+| ------ | ------------------------- | ---- |
+| edge   | the list of edge labels   | List |
+| vertex | the list of vertex labels | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.Get Label Data Format
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Data column definition table as a dictionary, in which each key is the column name, and corresponding value is the column definition defined as follows:
+- | Field    | Description                           | Type   |
+  | -------- | ------------------------------------- | ------ |
+  | optional | whether the column value can be empty | Bool   |
+  | type     | the type of the column value          | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema Import
+
+- **URI**: `/db/{graph_name}/schema/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description              | Type   |
+| ----------- | ------------------------ | ------ |
+| description | Graph labels description | String |
+
+The detail description can refer to `TuGraph Manual`.
+
+- **RESPONSE**:
+
+Schema import will check the new schema and original schema in database if compatible or not. If yes, this request will add the label only in new schema. If no, will return an error code.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.Vertex Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+in which `vid` is a unique integer identifying the vertex, which can be obtained when creating new vertexes or by looking up index.
+
+#### 6.7.1.List Vertex and Label Number
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field      | Description                | Type    |
+| ---------- | -------------------------- | ------- |
+| num_label  | the number of vertex label | Integer |
+| num_vertex | the number of vertex       | Integer |
+
+_Note: `num_vertex` returns an estimate of the number of vertexes, not the exact number. To get the exact number, please use Cypher queries._
+
+#### 6.7.2.Create New Vertex
+
+Insert a vertex into the database.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                  | Type       |
+| -------- | ---------------------------- | ---------- |
+| label    | the name of label            | String     |
+| property | the properties of the vertex | Dictionary |
+
+in which `property` is a dictionary of {`column_name`:`column_value`}.
+
+- **RESPONSE**: if successful, return status code 200 and the new vertex's vid, which can be used in later vertex operations.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.Batch Create Vertexes
+
+TuGraph allows multiple vertices to be inserted as one batch to reduce network overhead.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description               | Type   |
+| ------ | ------------------------- | ------ |
+| label  | the name of Label         | String |
+| fields | the column names          | List   |
+| values | the values of each vertex | List   |
+
+in which `fields` is a list of strings specifying column names, and `values` is a list in which each element is a list of `column_values` corresponding to the column names as specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200, and return the vid list of newly added vertices in the JSON content, where each vid corresponds to each vertex in the request.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.Get Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description       | Type                                                             |
+| -------- | ----------------- | ---------------------------------------------------------------- |
+| label    | the name of Label | String                                                           |
+| property | property          | Dictionary, in the format of {column_name_1:column_value_1, ...} |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.Delete Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200, and also the following content in JSON:
+
+| Field | Description                                    | Type    |
+| ----- | ---------------------------------------------- | ------- |
+| in    | number of incoming edges of the deleted vertex | Integer |
+| out   | number of outgoing edges of the deleted vertex | Integer |
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.Get Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Vertex properties as a dictionary of {`column_name`:`column_value`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.Get Vertex Field
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Value corresponding to the specified `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.Update Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description          | Type       |
+| -------- | -------------------- | ---------- |
+| property | properties to update | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "13737299333"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.8.Edge Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+in which `euid` is a string uniquely identifying the edge, which can be obtained when creating edges or by iterating through the edges of a vertex.
+
+#### 6.8.1.Create Edge
+
+- **URI**: `/db/{graph_name}/node/{src_vid}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                     | Type       |
+| ----------- | ------------------------------- | ---------- |
+| label       | the label of edge               | String     |
+| destination | the `vid` of destination vertex | Integer    |
+| property    | the property of edge            | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200 and the `euid` of new created edge (type is String).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.Batch Create Edges
+
+- **URI**: `/db/{graph_name}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description          | Type   |
+| ------ | -------------------- | ------ |
+| label  | the label of edge    | String |
+| fields | the data column name | List   |
+| edge   | the data of edge     | List   |
+
+where the edge is a list of data, each of which specifies and edge, defined as follows:
+
+| Field       | Description           | Type    |
+| ----------- | --------------------- | ------- |
+| source      | source vertex id      | Integer |
+| destination | destination vertex id | Integer |
+| values      | the data list         | List    |
+
+in which `values` is a list of column values, each of which correspond to the a column name specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200 and the list of `euid`s of the newly created edges.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.List Out-going Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of source vertex's out-going edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.List Incoming Edges
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of destination vertex's incoming edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.List All Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                     | Type |
+| ----- | ------------------------------- | ---- |
+| in    | list of incoming edges' `euid`s | List |
+| out   | list of outgoing edges' `euid`s | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.Get Edge Information
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description                | Type       |
+| -------- | -------------------------- | ---------- |
+| label    | the label of the edge      | String     |
+| property | the properties of the edge | Dictionary |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.Delete Edge
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.Get Edge Properties
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The dictionary of edge's properties.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.Get Edge Field
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the value corresponding to given `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.Update Edge Property
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description              | Type       |
+| -------- | ------------------------ | ---------- |
+| property | properties to be updated | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.9.Index
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+#### 6.9.1.Create Index
+
+Create an index on a (label, field) pair. Blocks until the index is successfully built.
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field     | Description                          | Type   |
+| --------- | ------------------------------------ | ------ |
+| label     | the name of label                    | String |
+| field     | field to be indexed                  | String |
+| is_unique | whether this index is a unique index | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.List All Indexes
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.List Indexes Related with Specified Label
+
+- **URI**: `/db/{graph_name}/index/{label}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.Delete Index
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.Get Vertex by Index
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of `vid`s.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+
+
+
+### 6.10.Data Import
+
+- **URI**: `/db/{graph_name}/import/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field             | Description                                                                                        | Type                       |
+|-------------------|----------------------------------------------------------------------------------------------------|----------------------------|
+| description       | description of the file content                                                                    | String                     |
+| data              | contents of the file to be imported (recommended to have a size of 16MB, has a hard limit of 17MB) | Strings / Arrays / Objects |
+| continue_on_error | whether to continue import when an error occurred (optional, default is `false`)                   | Bool                       |
+| delimiter         | delimiter used in the data file (optional, default is `“,”`)                                       | String                     |
+
+The details of the `description` field can be found in [TuGraph Import Tool](../../3.server-tools/1.data-import.md).
+
+`delimiter` can be a single character or multi-character string, but must not contain `\r` or `\n`.
+
+`data` can be one of the following:
+
+- String, such as `"1,2\n3,4\n"`
+- Array of ASCII codes, such as `[49,44,50,10,51,44,52,10]`
+- Dictionary shaped like the above array, such as `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+* **RESPONSE**:
+
+The system **will not** automatically perform actions such as creating a new label, adding an index, and so on. Before you do this, please make sure that the label involved already exists and has an appropriate index.
+
+If the import is successful, return code 200 and return log information (possibly empty) in the `log` field. Otherwise, returns status code 400. None of the data is imported on failure, and error message is set in `error_message`.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+Because the request specifies `continue_on_error: true`, the returned `log` indicates that the first edge cannot be inserted because there is no vertex with uid==1, while the second edge was imported successfully.
+
+### 6.11.Miscellany
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.Extract Subgraph
+
+Give a set of `vid`s and return the minimum subgraph which contains the vertex set and the edges between them.
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type |
+| ---------- | ------------- | ---- |
+| vertex_ids | vertex id set | List |
+
+- **RESPONSE**:
+
+| Field         | description        | Type                                                               |
+| ------------- | ------------------ | ------------------------------------------------------------------ |
+| nodes         | vertex information | List, each element contains vid, label, and properties.            |
+| relationships | edge information   | List, each element contains src, dst, euid, label, and properties. |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
new file mode 100644
index 0000000000..911de26909
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
@@ -0,0 +1,269 @@
+# RPC API
+
+> This document mainly introduces the details of calling TuGraph's RPC API.
+
+## 1.Introduction
+
+TuGraph provides rich RPC APIs for developers to remotely call the services provided by TuGraph through RPC requests.
+
+RPC (Remote Procedure Call) is a protocol for requesting services from remote computer programs through a network without the need to understand the underlying network technology.
+Compared with REST, RPC is method-oriented and mainly used for calling function methods. It is suitable for more complex communication scenarios and has higher performance.
+brpc is an industrial-grade RPC framework written in C++. Based on brpc, TuGraph provides rich RPC APIs. This document describes how to use TuGraph's RPC API.
+
+## 2.Request
+
+### 2.1.Establishing a Connection
+
+When developers send RPC requests to TuGraph services, they must first establish a connection. Taking C++ as an example, developers create a channel with the specified URL and create a specified service stub (LGraphRPCService_Stub) from the channel. Subsequently, they can send requests to the remote server through the stub like calling local methods.
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.Request Types
+
+TuGraph supports 10 types of RPC requests, and each request's functionality is shown in the following table:
+
+| Request              | Functionality         |
+|-----------------|------------|
+| GraphApiRequest | Vertex-Edge Index   |
+| CypherRequest   | cypher   |
+| PluginRequest   | Stored Procedures     |
+| HARequest       | High Availability    |
+| ImportRequest   | Data Import     |
+| GraphRequest    | Subgraph Operations     |
+| AclRequest      | Access Control     |
+| ConfigRequest   | Configuration     |
+| RestoreRequest  | Backup       |
+| SchemaRequest   | Schema Management |
+
+When a user sends a request, the following parameters need to be passed in:
+- client_version: an optional parameter, in HA mode, it can prevent outdated responses by comparing `client_version` and `server_version`
+- token: a necessary parameter, the client obtains the token after logging in, and the token is passed in with each request to verify the user's identity
+- is_write_op: an optional parameter, indicating whether the request is a write request
+- user: an optional parameter, set user when synchronizing requests between master and slave in HA mode, and no token verification is required After the service processes the RPC request, it sends back a response.
+
+In addition to containing separate response information for each request, the response message also includes the following parameters:
+- error_code: a necessary parameter, indicating the processing status of the request
+- redirect: an optional parameter, when processing fails to send a write request to a follower in HA mode, set redirect as the request forwarding address, that is, the leader address
+- error: an optional parameter, indicating the error information of the request
+- server_version: an optional parameter, set `server_version` in the HA mode request response to avoid reverse time travel when client reads data
+
+:warning:  **Except for CypherRequest, PluginRequest, HARequest and AclRequest, all other RPC interfaces will be gradually deprecated, and their functions will be unified into the CypherRequest interface.**
+
+## 3.Login
+
+The login request message contains the following parameters:
+- user: a necessary parameter, the username
+- pass: a necessary parameter, the password
+
+Taking C++ as an example, the user sends a login request using the constructed service stub:
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+The login response message contains the following parameters:
+- token: a necessary parameter. After successful login, a signed token, namely Json Web Token, will be received. The client stores the token and uses it for each subsequent request. If the login fails, an "Authentication failed" error will be received.
+
+## 4.Query
+Users can interact with TuGraph through Cypher queries. The Cypher request message contains the following parameters:
+- query: a necessary parameter, the Cypher query statement
+- param_names: an optional parameter, the parameter name
+- param_values: an optional parameter, the parameter value
+- result_in_json_format: a necessary parameter, whether to return the query results in JSON format
+- graph: an optional parameter, the subgraph name for executing the Cypher statement
+- timeout: an optional parameter, the timeout for executing the Cypher statement
+
+Taking C++ as an example, the user sends a Cypher request as follows:
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+The Cypher request response contains one of the following two parameters:
+- json_result: the Cypher query result in JSON format
+- binary_result: the Cypher query result in the CypherResult format
+
+## 5.Stored Procedures
+To meet users' more complex query/update logic, TuGraph supports stored procedures written in C and Python. Users can use RPC requests to perform CRUD operations on stored procedures.
+
+### 5.1.Load Stored Procedures
+The request for loading stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- read_only: a necessary parameter, whether it is read-only
+- code: a necessary parameter, the ByteString generated by reading the stored procedure file
+- desc: an optional parameter, the stored procedure description
+- code_type: an optional parameter, the stored procedure code type, which can be PY, SO, CPP, or ZIP
+
+Taking C++ as an example, the user loads the stored procedure as follows:
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for loading the stored procedure does not contain parameters, and if the loading fails, a BadInput exception will be thrown.
+
+### 5.2.Invoke Stored Procedures
+
+The request for invoking stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- param: a necessary parameter, the stored procedure parameters
+- result_in_json_format: an optional parameter, whether to return the invocation result in JSON format
+- in_process: an optional parameter, to be supported in the future
+- timeout: an optional parameter, the timeout for invoking the stored procedure
+
+Taking C++ as an example, the user invokes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+The response for invoking the stored procedure contains one of the following two parameters:
+- reply: the stored procedure invocation result in the ByteString format
+- json_result: the stored procedure invocation result in JSON format
+
+### 5.3.Delete Stored Procedures
+
+The request for deleting stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+
+Taking C++ as an example, the user deletes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for deleting the stored procedure does not contain parameters, and if the deletion fails, a BadInput exception will be thrown.
+
+### 5.4.List Stored Procedures
+
+The request for listing stored procedures does not require parameters. Taking C++ as an example, the user lists the stored procedures as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+The response for listing the stored procedures contains the following parameter:
+- reply: the procedure list in JSON format
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst
new file mode 100644
index 0000000000..484e600e87
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Protocol
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
new file mode 100644
index 0000000000..92de7af893
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
@@ -0,0 +1,90 @@
+# Learning Tutorial
+
+> This document is designed as a guide for TuGraph users. Before reading the detailed documentation, users should first read this document to have a general understanding of the graph learning process of TuGraph, which will make it easier to read the detailed documentation later. The guide program is based on a simple program instance of TuGraph, and we will focus on its usage.
+
+## 1. Introduction to TuGraph Graph Learning Module
+Graph learning is a machine learning method that utilizes the topological information of a graph structure to analyze and model data. Unlike traditional machine learning methods, graph learning uses graph structures where vertices represent entities in data and edges represent relationships between entities. By extracting features and patterns from these vertices and edges, deep associations and patterns can be revealed in data that can be used in various practical applications.
+
+The TuGraph Graph Learning Module is a graph learning module based on a graph database that provides four sampling operators: Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. These operators can be used to sample vertices and edges in a graph to generate training data. The sampling process is performed in a parallel computing environment, providing high efficiency and scalability.
+
+After sampling, the obtained training data can be used to train a model that can be used for various graph learning tasks such as prediction and classification. Through training, the model can learn the relationships between vertices and edges in the graph, allowing for prediction and classification of new vertices and edges. In practical applications, this module can be used to handle large-scale graph data such as social networks, recommendation systems, and bioinformatics.
+
+## 2. Run Process
+The TuGraph graph learning module samples graph data in TuGraph, and the sampled vertices and edges are used as graph learning features for learning and training. The operation process is shown in the figure below:
+
+![Alt text](../../../../../images/learn_flow_chart_en.png)
+
+## 3. Data Import
+Please refer to [Data Import](../../../5.developer-manual/3.server-tools/1.data-import.md) for data import.
+
+Taking the cora dataset as an example for the import process:
+
+Execute in the build/output directory:
+
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+Where cora.conf is the graph schema file representing the format of the graph data. cora_db is the imported graph data file name representing the storage location of the graph data.
+
+## 4. Feature Conversion
+Since the features in graph learning are generally represented as long float arrays, TuGraph does not support loading float array types, so they can be imported as string types and converted to char* for subsequent storage and access, and the implementation details can refer to the feature_float.cpp file.
+
+The specific execution process is as follows:
+
+Compile the imported plugin in the build directory:
+
+`make feature_float_embed`
+
+Execute in the build/output directory:
+
+`./algo/feature_float_embed ./cora_db`
+
+Then the conversion can be performed.
+
+## 5. Sampling Operators and Compilation
+TuGraph implements an operator for obtaining the full graph data and four sampling operators at the cython layer, as follows:
+
+### 5.1.Sampling Operator Introduction
+|Sampling Operator | Sampling Method |
+| --- | --- |
+|GetDB | Get the graph data from the database and convert it into the required data structure |
+|Neighbor Sampling | Sample the neighboring nodes of the given node to obtain the sampling subgraph |
+|Edge Sampling | Sample the edges in the graph according to the sampling rate to obtain the sampling subgraph |
+|Random Walk Sampling | Conduct a random walk based on the given node to obtain the sampling subgraph |
+|Negative Sampling | Generate a subgraph of non-existent edges|
+
+### 5.2.Compilation
+Execute in the tugraph-db/build folder:
+
+`make -j2`
+
+Or execute in the tugraph-db/learn/procedures folder:
+
+`python3 setup.py build_ext -i`
+
+Once the algorithm so is obtained, it can be used by importing it in Python.
+
+## 6. Model Training and Storage
+TuGraph calls the cython layer operator at the Python layer to implement graph learning and training.
+
+The usage of the TuGraph graph learning module is as follows:
+
+Execute in the tugraph-db/learn/example folder:
+
+`python3 train_full_cora.py --model_save_path ./cora_model`
+
+Then training can be performed.
+
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+## 7. Model Loading
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+Before using a saved model, it is necessary to load it first. In the code above, the trained model is loaded using the provided code.
+
+After loading the model, we can use it to make predictions and classifications for new vertices and edges. For prediction, we can input one or multiple vertices and the model will output corresponding prediction results. For classification, we can input the whole graph, and the model will classify the vertices and edges in the graph to achieve the task goal.
+
+Using a trained model can save time and resources compared to retraining the model. Additionally, since the model has already learned the relationships between vertices and edges in the graph, it can adapt well to new data and improve the accuracy of predictions and classifications.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
new file mode 100644
index 0000000000..c649fa50e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
@@ -0,0 +1,102 @@
+# Sampling API
+
+>This document provides a detailed guide on using the Sampling API of TuGraph.
+
+## 1. Overview
+This manual introduces the Sampling API using TuGraph.
+
+## 2. Graph Data Instantiation
+Before the sampling operation, load the graph data according to the graph data path, and map it into the olapondb graph analysis class, the code is as follows:
+
+```python
+galaxy = PyGalaxy(args.db_path) # Create a galaxy instance based on the path
+galaxy.SetCurrentUser(args.username, args.password) # Set the current user
+db = galaxy.OpenGraph('default', False) # Open the graph database specified by db
+txn = db.CreateReadTxn() # Create a transaction instance
+olapondb = PyOlapOnDB('Empty', db, txn) # Instantiate OlapOnDB based on the graph loading method, graph database instance, and transaction instance
+del txn
+del db
+del galaxy
+```
+## 3. Introduction to Sampling Operators
+The graph sampling operator is implemented in the cython layer and is used to sample the input graph. The generated NodeInfo is used to save point information such as feature attributes and label attributes, and EdgeInfo is used to save edge information. These metadata information can be used for features Extraction, network embedding and other tasks. Currently, the TuGraph graph learning module supports five sampling operators: GetDB, NeighborSampling, EdgeSampling, RandomWalkSampling, and NegativeSampling.
+
+### 3.1.RandomWalk Operator
+Random walks are performed a specified number of times around the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.2.NeighborSampling Operator
+A certain number of nodes are sampled from the first-degree neighbors of the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.3.NegativeSampling Operator
+The negative sampling algorithm is used to generate a subgraph of non-existent edges.
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+num_samples: The number of false edges to be generated.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.4.EdgeSampling Operator
+The edge sampling algorithm is used to generate a subgraph of sampled edges.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_rate: The sampling rate of the edges to be selected.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.5.GetDB Operator
+Get the graph data from the database and convert it into the required data structure.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+## 4. User-Defined Sampling Algorithm
+Users can also implement a custom sampling algorithm through the TuGraph Olap interface. For the interface document, see [here](../2.olap/5.python-api.md). This document mainly introduces the interface of related functions used by the graph sampling algorithm design.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md
new file mode 100644
index 0000000000..a5a03f8d23
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md
@@ -0,0 +1,101 @@
+# Training
+> This document details how to use TuGraph for training Graph Neural Networks (GNNs).
+
+## 1. Training
+When using TuGraph's graph learning module for training, it can be divided into two categories: full graph training and mini-batch training.
+
+Full graph training involves loading the entire graph from the TuGraph db into memory and training the GNN. Mini-batch training uses the sampling operator of the TuGraph graph learning module to sample the entire graph data and then input it into the training framework for training.
+
+## 2. Mini-Batch Training
+Mini-batch training requires the use of TuGraph's graph learning module's sampling operators, which currently support Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. The sampling result of the TuGraph graph learning module's sampling operator is returned in the form of a List.
+
+The following takes Neighbor Sampling as an example to introduce how to convert the sampled results into the training framework for format conversion.
+The user needs to provide a Sample class:
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. Load graph data
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+        # 2. Sampling method, the result is stored in NodeInfo and EdgeInfo
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+        # 3. Format conversion of the result to fit the training format
+        src = EdgeInfo[0].astype('int64')
+        dst = EdgeInfo[1].astype('int64')
+        nodes_idx = NodeInfo[0].astype('int64')
+        remap(src, dst, nodes_idx)
+        features = NodeInfo[1].astype('float32')
+        labels = NodeInfo[2].astype('int64')
+        g = dgl.graph((src, dst))
+        g.ndata['feat'] = torch.tensor(features)
+        g.ndata['label'] = torch.tensor(labels)
+        return g
+```
+As shown in the code, the graph data is first loaded into memory. Then use the sampling operator to sample the graph data, and the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and the stored information results are as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Finally, we format the result to fit the training format. Here we use the DGL training framework, so we construct a DGL Graph using the result data, and then return the DGL Graph.
+
+Once we provide the TuGraphSample class, we can use it for Mini-Batch training. Let the data loading part of DGL use the sampler instance of TuGraphSample as follows:
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+Use DGL for model training:
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+## 3. Full-Batch training
+Full-Batch training of GNNs (Graph Neural Networks) is a type of training that involves processing the entire training dataset at once. It is one of the simplest and most straightforward training methods for GNNs, where the entire graph is treated as a single instance. In full-batch training, the entire dataset is loaded into memory and the model is trained on the entire graph. This type of training is especially useful for small to medium-sized graphs, and is mainly used for static graphs that do not change over time.
+```python
+getdb. Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+The full graph are then fed into the training framework for training.
+Full code: learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/index.rst
new file mode 100644
index 0000000000..fbc920ad54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/5.learn/index.rst
@@ -0,0 +1,8 @@
+TuGraph Learn
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/index.rst
new file mode 100644
index 0000000000..ea54cb9c63
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/6.interface/index.rst
@@ -0,0 +1,12 @@
+TuGraph DB Interface
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.query/index.rst
+   2.olap/index.rst
+   3.procedure/index.rst
+   4.protocol/index.rst
+   5.learn/index.rst
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/7.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/7.quality/1.unit-testing.md
new file mode 100644
index 0000000000..2cdb8d3f31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/7.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# Unit Testing
+
+> This document is the unit testing documentation for TuGraph.
+
+## 1.Introduction
+
+TuGraph unit testing uses the gtest framework, which can choose to run all tests at once or specify certain tests.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/7.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/7.quality/2.integration-testing.md
new file mode 100644
index 0000000000..b98cf7f62a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/7.quality/2.integration-testing.md
@@ -0,0 +1,400 @@
+# Integration Testing
+
+> This document mainly introduces how to use the TuGraph integration testing framework.
+
+## 1.The Significance of TuGraph Integration Testing
+
+In unit tests and function tests, some test cases directly use Galaxy or Statemachine to perform tests, which is not a complete process. In the complete CS architecture, user requests are sent to the server through the client, and network communication is essential. To avoid bugs caused by incomplete unit testing, TuGraph uses an integration testing framework to perform end-to-end testing.
+
+## 2.TuGraph Integration Testing Framework
+
+TuGraph uses the Pytest framework as its integration testing framework. Pytest is currently the most widely used CS-side integration testing framework. It is known for its flexibility, ease of use, and the ability to support parameterization. Based on the functionality provided by Pytest, TuGraph abstracts different tools and controls the processing logic of each tool through parameters to facilitate efficient testing code development.
+
+For more information on Pytest, please refer to the official website: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.Component Description
+
+| Component Name    |Component Function      | Implementation Method                              |
+| --------------- | -------------------------- | ------------------------------------------------ |
+| server          | TuGraph standalone service | Start a child process and launch the service       |
+| client          | TuGraph Rpc Client         | Open TuGraph Python Rpc Client in the current process and send requests  |
+| importor        | TuGraph Importor           | Start a child process to process import requests               |
+| exportor        | TuGraph Exportor           | Start a child process to process export requests               |
+| backup_binlog   | TuGraph Backup Binlog      | Start a child process to process binlog backup requests       |
+| backup_copy_dir | TuGraph Backup             | Start a child process to process full db backup requests       |
+| build_so        | Component for compiling C++ dynamic libraries    | Start a child process to handle GCC compilation logic            |
+| copy_snapshot   | TuGraph Copy Snapshot      | Handle backup snapshot requests in the current process                 |
+| copydir         | Folder copy                 | Handle folder copy requests in the current process                     |
+| exec            | Execute C++/Java executable files     | Start a child process to launch the C++ executable file  |
+| algo            | Execute algorithm                   | Start a child process to run the algorithm     |
+| bash            | Execute bash commands               | Start a child process to execute bash commands      |
+| rest            | TuGraph Python Rest Client | Open TuGraph Python Rest Client in the current process and send requests|
+
+### 2.2.Component Usage
+
+#### 2.2.1.server
+
+##### 2.2.1.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The server will be started before the function starts executing, and the server will be stopped and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ host is the IP and port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to the user in the TuGraph Server
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The client will be started before the function starts executing, and the client will be stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.Startup Command
+
+Import the tool through the fixtures component and control the import of different data through startup parameters. The data will be imported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.Startup Command
+
+Import the tool through the fixtures component and control the export of different data through startup parameters. The data will be exported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.Startup Parameters
+采用python字典传入
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different binlogs through startup parameters. The binlogs will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different databases through startup parameters. The database will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command, passed in as a Python list, and multiple so can be compiled at once
++ so_name is the dynamic library that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.Startup Command
+
+Import the tool through the fixtures component and control the compilation of different dynamic libraries through startup parameters. The dynamic libraries will be generated to the specified directory before the function starts executing, and the dynamic libraries specified in the so_name list will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original database
++ dst is the snapshot copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.Startup Command
+Import the tool through the fixtures component and control the copying of different snapshots through startup parameters. The snapshot in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original directory
++ dst is the directory copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.Startup Command
+Import the tool through the fixtures component and control the copying of different directories through startup parameters. The directory in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.Startup Command
+Import the tool through the fixtures component and control the execution of different logic through startup parameters. A child process will be started to execute the command passed in through the cmd parameter before the function starts executing.
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ result is the expected execution result of the algorithm. After execution is completed, the actual result will be compared with the expected result. If they are different, the test will fail.
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.Startup Command
+Import the tool through the fixtures component and control the execution of different algorithm logic through startup parameters. A child process will be started to execute the algorithm passed in through the cmd parameter before the function starts executing. The function body will wait for the algorithm to complete and compare the result with the expected result.
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.Startup Command
+
+Import the tool through the fixtures component and control the execution of different bash commands through startup parameters. A child process will be started to execute the bash command passed in through the cmd parameter before the function starts executing. The function body will wait for the command to complete.
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ port is the port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to user in TuGraph Server
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.Startup Command
+
+Import the tool through the fixtures component and link to different TuGraph Rest Servers through startup parameters. The client will be started before the function starts executing and stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.Test Cases
+
+#### 2.3.1.rest
+
+In the sample code, before the test_get_info function is executed, the server is started, and a rest client is started after the server is started. After entering the test_get_info function, some information about the server is obtained, and assert is used to determine whether cpu information is obtained.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+In the sample code, before the test_flushdb function is executed, the offline data import logic is executed and the server is started. After creating a connection through the client, the function enters the test_flushdb function. The number of points is queried to determine whether the import is successful. After the import is successful, the flushDB operation is executed. assert is used again to determine whether the db can be emptied normally.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+In the sample code, before the test_export_default function is executed, the offline data import logic is executed. After the import is successful, the data of the current db is exported. Then, the offline import logic is used again to import the exported data into a new directory. The newly imported data is used to start the db and create a connection. In the body of the test_export_default function, it is determined whether the data after export and import is consistent with the original data.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.Other Tests
+For more test cases, please refer to the integration test code [https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/7.quality/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/7.quality/index.rst
new file mode 100644
index 0000000000..c6be070cb8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/7.quality/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Quality
+==============================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/8.other/1.privilege.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/8.other/1.privilege.md
new file mode 100644
index 0000000000..59c569b9f7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/8.other/1.privilege.md
@@ -0,0 +1,135 @@
+# Privilege
+
+## 1.Introduce
+
+> The permissions of TuGraph are managed based on role-based access control. The permissions that define access control are assigned to roles, and the roles are then assigned to users.
+
+## 2.Level of permissions
+
+- Global layer: indicates global permissions, which have permissions for management and graph operations.
+- Graph layer: control permissions on each graph;
+- Property level (Commercial version only) : control permissions on a property
+
+## 3.Permission keyword
+
+At present, the control of permissions is relatively simple
+
+- The Global layer currently has admin permission, and the admin user is preset.
+
+* The Graph layer has four operation permissions: none, read, write, and full
+
+- none: No permission, no operation permission for the graph
+- read: Read-only permission, only has read permission for the graph
+- write: Read and write permission, not only has read permission for the graph, but also has write permission
+- full: All permissions, not only have read and write permissions for graphs, but also have permissions to delete graphs, modify graphs, and modify schemas
+
+* The Property layer (Commercial version only)  has the following permissions: none, read, and write
+
+- none: No permission, no operation permission for the property
+- read: Read-only permission, only has read permission for the property
+- write: Read and write permission, not only has read permission for the property, but also has write permission
+
+## 4.Common permission operations
+
+### 4.1.User action
+
+- Creating a user
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- Deleting a user
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- Change the password of the current user
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- Changes the password of a specified user
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- Disable or enable a user
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- List all users
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- Lists the current user information
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- Obtain user details
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.Role actions
+
+- Create a role
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- Delete a role
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- List all characters
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- Disable or enable the role
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.Assign roles to users
+
+- Adds the association between the user and the role
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- Deletes the association between the user and the role
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- Clears the relationship between user roles and rebuilds them
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.Role empowerment
+
+- Modifies the access permission of a role to a specified graph
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/8.other/2.token.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/8.other/2.token.md
new file mode 100644
index 0000000000..40c162bd45
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/8.other/2.token.md
@@ -0,0 +1,42 @@
+# Token Usage Guide
+## 1. Introduction to Token
+JWT (JSON Web Token) is an open standard used for authentication and authorization. It is based on the JSON (JavaScript Object Notation) format and is designed for securely transmitting claim information between network applications.
+
+JWT consists of three parts: the header, payload, and signature. The header contains the type of JWT and the signature algorithm used, the payload contains the information to be transmitted, and the signature is used to verify the integrity and authenticity of the JWT.
+
+In TuGraph, JWT is used to implement a stateless authentication and authorization mechanism. After a user logs in successfully, the server generates a JWT and returns it to the client. The client passes this JWT as an identity credential in subsequent requests to the server. Upon receiving the JWT, the server verifies the signature and parses the information in the payload to determine the user's identity and permissions, and decides whether to allow the execution of the request.
+
+## 2. Token Expiration
+### 2.1. Browser Token Interaction Logic
+1. The user opens the browser, enters the username and password, and clicks login.
+2. The frontend calls the login interface and inputs the account and password to the backend.
+3. After receiving the account and password, the backend verifies them and returns a Token.
+4. The frontend stores the Token in the browser cache, and all subsequent requests must carry this Token.
+5. If the frontend actively clicks logout or closes the page, it should actively call the logout interface and pass the Token to the backend.
+6. After receiving the Token, the backend invalidates it, returns a status code 200, and "logout successful". After receiving the message, the frontend clears the Token in the browser memory, and returns to the login page.
+7. The Token expires (initially set to 24 hours), and the user needs to log in again.
+### 2.3. Token Expiration Refresh Mechanism
+Token expiration has a refresh mechanism that is turned off by default. If turned on, the security of the Token will be higher, and there will be two timestamps.
+
+The first timestamp `refresh_time` is used to determine whether the Token has expired (default 24 hours): after expiration, the refresh interface can be called to obtain a new Token, which can be set to a shorter time, such as 1 hour.
+
+The second timestamp `expire_time` is the forced expiration timestamp (default 24 hours): after expiration, the user must log in again.
+
+### 2.4. Token Expiration Modification
+To facilitate developers to develop on their own, TuGraph provides two ways to modify the expiration time, both of which require admin privileges.
+
+* Set through the interface call. The interfaces involved in modifying the expiration time are `update_token_time` and `get_token_time` for querying the expiration time. For details, please refer to the [REST interface document](../../5.developer-manual/6.interface/4.protocol/1.restful-api.md).
+* Set through startup parameters. When the server-side is started, adding the parameter `-unlimited_token 1` can set the Token to be unlimited. Please refer to the [service running document](../../5.developer-manual/2.running/2.tugraph-running.md) for details.
+## 3. Introduction to Token-Related Requests Sent by Clients
+The client handles two types of protocol-related requests: REST and RPC.
+
+### 3.1. REST
+If the client uses the REST protocol (including the browser), because it is a short connection, Token needs to be carried in every request, and a new Token needs to be obtained after it expires.
+
+For self-developed clients, if the REST protocol is used, Token logic needs to be considered.
+
+### 3.2. RPC
+If the client uses the RPC protocol (including the official C++/Java/Python), it uses a long connection to maintain, and no Token operation is involved after login.
+
+## 4. Token upper limit
+The upper limit of Token refers to the maximum number of Tokens that a user can own at the same time. To prevent unlimited logins, the upper limit of Token is 10000 by default. Since the token generation logic is strongly related to time, a token will be generated for storage every time you log in. The validity period of the token is 24 hours by default. Therefore, it is recommended to log out the unused token in time after login.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/8.other/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/8.other/index.rst
new file mode 100644
index 0000000000..d2e81f6ec7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/8.other/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Other
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/index.rst
new file mode 100644
index 0000000000..4900dd0189
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/5.developer-manual/index.rst
@@ -0,0 +1,15 @@
+TuGraph DB Developer Manual
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.installation/index.rst
+   2.running/index.rst
+   3.server-tools/index.rst
+   4.client-tools/index.rst
+   5.ecosystem-tools/index.rst
+   6.interface/index.rst
+   7.quality/index.rst
+   8.other/index.rst
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..f68e91fda6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/1.contributing.md
@@ -0,0 +1,81 @@
+# TuGraph Contribution Guide
+
+## 1. Preface
+
+Thank you for your contribution to TuGraph. We sincerely hope that more students from the community will join in and build a better graph database project together.
+
+Before contributing code, please take some time to understand the process of contributing code to TuGraph, and read the "Contributor License Agreement". Participating in the contribution is deemed to agree to the above agreement.
+
+Individual Contributor License Agreement: [4.individual_cla.md]
+
+Corporate Contributor License Agreement: [5.corporate_cla.md]
+
+## 2. What to contribute
+
+We welcome any contribution at any time, whether it's a simple typo fix, bug fix, or new feature addition. Feel free to ask questions or initiate PRs. We also value documentation and integration with other open source projects, and welcome contributions in this regard. For any modification, especially the more complex modification, it is recommended to create an issue and fill it out according to the BUG or PR template.
+
+## 3. Preparation
+
+Before contributing code, you need to understand the use of git tools and the use of GitHub website.
+
+## 4. Contribute code process
+
+### 4.1. Submit the issue
+
+Whether you are fixing a bug in TuGraph or adding a new feature to TuGraph, before you submit the code, submit an issue on TuGraph's GitHub, describing the problem you want to fix or the function you want to add. There are several advantages to doing this:
+
+- There will be no duplication of work in conflict with other developers or their plans for the project.
+- TuGraph maintainers will discuss the bugs or new features you mentioned to determine whether the modification is necessary, whether there is room for improvement or a better way.
+- After reaching an agreement, develop and submit the code, reducing the cost of communication between the two parties and reducing the rejection of pull requests.
+
+### 4.2. Pull the branch
+
+All modifications of TuGraph are made on branches. After modification, the pull request is submitted and merged into the Master by the project maintenance personnel after Code Review. Therefore, after the source code steps are described, you need:
+
+1. Download the code to a local directory. In this step, you can choose git or https. In recent years, github has stricter permission requirements. The git approach, for example, requires the more complex ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)). https authentication cannot be performed using the user name and password. git clone https://github.com/ Your account name /tugraph-db
+2. Pull branch ready to modify code:
+   git branch add_xxx_feature
+3. After executing the above command, your code repository switches to the appropriate branch. Run the following command to view your current branch: git branch -a
+4. If you want to switch back to Master, run the git checkout -b master command
+5. If you want to switch back to branching, run the following command: git checkout -b "branchName"
+
+### 4.3. Configuring Github Information
+
+Run git config --list on your machine to view git's global username and mailbox. Check whether the displayed user.name and user.email match your github user name and email address.
+
+If a company has its own gitlab in-house or uses other commercial GitLabs, a mismatch may occur. At this point, you need to set up a separate user name and mailbox for the tugraph-db project. For details about how to set the user name and email address, see github's official documentation.
+
+### 4.4. Change the code and submit it locally
+
+Once you've pulled the branch, you're ready to change the code.
+
+**Code modification Notes**
+
+Code style consistency: TuGraph uses cpplint to keep code in the same format, and IDE can use.clang to configure the style. Be sure to check the code style locally before submitting it, or ACI will report an error.
+
+Add unit test code: New changes should pass through existing unit tests. New unit tests should be provided to prove that there are bugs in the previous code and that the new code has resolved these bugs. You can run all tests with the following command:./unit_test
+It can also be run with the help of an IDE.
+
+**Other precautions**
+
+Please keep the code you are editing in the original style, especially the space feed, etc. For unnecessary comments, delete them directly. Add comments where logic and functionality are not easily understood. Keep documentation up to date. After modifying the code, run the following command to submit all the changes to the local computer:
+git commit -am '(feat) Add the xx function 'git commit -am '(fix) fix xx problem' '
+
+Submit the code to the remote repository
+After the code is committed locally, you can then synchronize the code with the remote repository. Run the following command to submit local changes to github: git push origin "branchname"
+
+If you were forking earlier, the origin here is pushed to your code repository, not TuGraph's.
+
+After the code has been submitted to GitHub, you can send a request to merge your changes into the TuGraph Master. At this point, you need to go to your corresponding repository on GitHub and press the pull request button in the upper right corner. Select the target branch, which is usually the master, and the system will notify the TuGraph staff, who will Review your code, and when it meets the requirements, it will join the main branch and become part of TuGraph.
+
+Please note that the CI will be automatically checked, as well as all Commits signing the cla, with green signs on the commits.
+
+### 4.5. Code Review
+
+After you submit your code, your code will be assigned to a maintainer for Review. Please wait patiently. If no one has responded to your submission after two working days, you can leave a message under PR and @ the corresponding person.
+
+Comments on code Review will be directly noted to the corresponding PR or Issue. If you find the suggestions reasonable, please update them to your code.
+
+### 4.6. Merge code into Master
+
+After the code Review is approved, the TuGraph maintainer will put it into the Master. During this process, the maintainer may specify a new Reviewer and put forward new comments that need to be revised. Normally this step is omitted, and after the code is merged, you will receive an indication that the merge was successful.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..27cff88ae8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/2.community-roles.md
@@ -0,0 +1,72 @@
+# TuGraph community roles
+
+## 1. Preface
+
+This document describes the roles of membership in the TuGraph community, the requirements and permissions for each role.
+
+## 2. Role summary
+
+This is the division of roles in the TuGraph community, describing the responsibilities of each role, the requirements to become and remain a role, and the permissions of the corresponding role.
+
+Our community is divided into three roles based on the Apache specification:
+
+- Contributor
+- Maintainer
+- PMC
+
+The requirements, responsibilities, and authorities for each role are described below.
+
+## 3. Contributor
+
+### 3.1. requirements
+
+Successfully submit a PR and merge in any of TuGraph's official projects.
+
+### 3.2. responsibility
+
+- Actively respond to issues or PR assigned to you
+- Help reply the issue/pr together and assign the issue to the person in charge of the corresponding module
+
+### 3.3. permissions
+
+- Join the TuGraph GitHub organization and become a member of the TuGraph open source community.
+
+## 4 Maintainer
+
+### 4.1. requirements
+
+The new Committer is recommended by the existing PMC and approved by 2/3 of the votes. The Commiter meets at least one of the following conditions:
+
+- Been a community member for more than three months
+- More than 10 PR for PMC approve
+- Complete major functions
+- Fixed serious bugs
+- Follow project development and participate in community discussion
+
+### 4.2. responsibility
+
+- Community counseling support
+- Actively respond to issues or PR assigned to you
+- The right to vote on major community decisions
+- Review community PR
+
+### 4.4. permissions
+
+- Pull Request review permission
+
+## 5. PMC
+
+### 5.1. requirements
+
+- Not open at the moment, if you have a strong desire please contact PMC
+
+### 5.2. responsibility
+
+- Actively participate in community discussions and give guidance to major community decisions
+- Responsible for ensuring that the community activities of open source projects are running smoothly
+
+### 5.3. permissions
+
+- Pull Request review permission
+- Pull Request approve permission
+- Community role member management
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..18295236c1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/3.individual-cla.md
@@ -0,0 +1,71 @@
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+# 个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..cc47087c32
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,82 @@
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+# 公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..379ecef880
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/5.roadmap.md
@@ -0,0 +1,68 @@
+# TuGraph Roadmap
+
+## 1. Introduction
+
+This document outlines the future development plans for TuGraph, including features currently under development, those not in the development pipeline, and completed functionalities not included in the open-source version.
+
+TuGraph aims to be an open-source, high-performance graph database. It adopts a centralized storage approach for graph data and, in the short term, does not consider data sharding. Instead, it employs a master-slave replication mode to address high-concurrency read scenarios, while utilizing cloud-based storage solutions to address storage capacity challenges.
+
+## 2. Completed Functionalities
+
+TuGraph was open-sourced on September 1, 2022, and has received regular bug fixes and enhancements based on community feedback.
+
+| Version | Functionality | Date |
+| --- | --- | --- |
+| 3.3.0 | Initial open-source release | 2022.9.1 |
+| 3.3.1 | Refactored graph analysis engine with multi-mode support | 2022.10.14 |
+| 3.3.2 | Added OGM support and improved unit test coverage | 2022.11.21 |
+| 3.3.3 | Iterative improvements to link authentication mechanism and addition of English documentation | 2022.12.23 |
+| 3.3.4 | Cloud deployment support and streamlined LDBC SNB Audit process | 2023.1.28 |
+| 3.4.0 | Added support for OLAP Python API and upgraded offline data import | 2023.3.11 |
+| 3.5.0 | Introduced POG (Procedures On Graph query language), frontend upgrades | 2023.6.5 |
+| 3.5.1 | Added learning engine, Procedure Rust API, and storage-property separation | 2023.7.14 |
+
+In addition, TuGraph has established a comprehensive quality system, including automated unit testing, integration testing, and performance testing.
+
+
+
+## 3. Roadmap of 2023 S2
+
+The planned high availability feature was delayed in the first half of the year, while the graph learning capability was iterated earlier than scheduled. The second half of the year will focus on completing the high availability feature and being the first to support a pre-print version of ISO GQL.
+
+| Version | Functionality | Planned Date |
+| 3.6.0 | High availability support | 2023.8 |
+| 4.0.0 | ISO GQL language support  | 2023.10 |
+
+## 4. Functional Updates in 2023
+
+In addition to the aforementioned core functionalities, the following components are planned for development in 2023.
+
+|Version|	Functionality|	Planned Date|
+| --- | --- | --- |
+|3.5.x	|Optimization of the logging system|2023.7|
+|3.5.x	|Cold backup support|	2023.9|
+|3.5.x	|Support for edge upsert import|	2023.9|
+|x.x.x	|Trigger support exploration|	2023.12|
+|x.x.x	|Exploring new storage engines|	TBD|
+|x.x.x	|Rapid schema addition and deletion|	TBD|
+|x.x.x	|TuGraph Browser version iteration|	TBD|
+|x.x.x	|Iteration of stored procedure Python API|	TBD|
+
+## 5. Community Collaboration Features
+
+Currently, the development team's resources are limited, and we cannot implement all the desired features for TuGraph. However, during the feature planning process, we have identified a range of ideas worth exploring. The team has conducted some initial exploration, and we welcome community collaboration in developing the following features:
+
+|Version	|Functionality	|Planned Date|
+| --- | --- | --- |
+|x.x.x	|Documentation improvements	|TBD|
+|x.x.x	|Enrichment of APOC tools	|TBD|
+|x.x.x	|Support for default property values	|TBD|
+|x.x.x	|Composite index for multiple properties	|TBD|
+|x.x.x	|Online full import support	|TBD|
+|x.x.x	|Enhanced graph permissions	|TBD|
+|x.x.x	|NLP (Natural Language Processing) support	|TBD|
+|x.x.x	|Java Procedure API	|TBD|
+|x.x.x	|Rapid database migration	|TBD|
+|x.x.x	|Spatiotemporal data support	|TBD|
+
+For simpler features, we will label them as "good first issue" on GitHub issues, and we welcome discussions from technology enthusiasts interested in graph databases.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/index.rst
new file mode 100644
index 0000000000..07fee7bd7a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/6.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Contributor Manual
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..f7b3d46bc8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# Importing Data from Relational Databases to TuGraph
+
+> Content to be added
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..232b6bfa31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/2.learn_practices.md
@@ -0,0 +1,192 @@
+# Using TuGraph Graph Learning Module for Node Classification
+
+## 1. Introduction
+GNN is a powerful tool for many machine learning tasks on graphs. In this introductory tutorial, you will learn the basic workflow of using GNN for node classification, i.e., predicting the category of nodes in a graph.
+
+This document will show how to build a GNN for semi-supervised node classification on the Cora dataset with only a few labels, which is a citation network with papers as nodes and citations as edges. The task is to predict the category of a given paper.
+By completing this tutorial, you will be able to:
+
+Load the Cora dataset.
+
+Sample and build a GNN model using the sampling operator provided by TuGraph.
+Train the GNN model for node classification on CPU or GPU.
+
+This document requires some experience in using graph neural networks and DGL.
+
+## 2. Prerequisites
+The TuGraph graph learning module requires TuGraph-db version 3.5.1 or above.
+
+It is recommended to use Docker image tugraph-compile 1.2.4 or above for TuGraph deployment:
+
+tugraph/tugraph-compile-ubuntu18.04:latest
+
+tugraph/tugraph-compile-centos7:latest
+
+tugraph/tugraph-compile-centos8:latest
+
+The above images can be obtained on DockerHub.
+Please refer to [Quick Start](../3.quick-start/1.preparation.md) for specific operations.
+
+## 3. Import Cora Dataset to TuGraph Database
+### 3.1. Introduction to Cora Dataset
+The Cora dataset consists of 2708 papers, classified into 7 categories. Each paper is represented by a 1433-dimensional bag-of-words feature, indicating whether a certain word appears in the paper. These bag-of-words features have been preprocessed to be normalized to a range from 0 to 1. The edges represent citation relationships between papers.
+
+TuGraph has provided the Cora dataset import tool, which users can use directly.
+
+### 3.2. Data Import
+The Cora dataset is located in the test/integration/data/algo directory and contains the cora_vertices point set and the cora_edge edge set.
+
+First, the Cora dataset needs to be imported into the TuGraph database. Please refer to [Data Import](../5.developer-manual/3.server-tools/1.data-import.md).
+
+Execute the following command in the build/output directory:
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+Here, cora.conf is the graph schema file representing the format of graph data, which can be found in test/integration/data/algo/cora.conf. cora_db is the name of the graph data file after import, which represents the storage location of graph data.
+
+## 4. Feature Conversion
+Since the features in the Cora dataset are float arrays of length 1433, which are not supported by TuGraph for loading, they can be imported as strings and converted to char* for easier access later. The implementation can be referred to the feature_float.cpp file.
+The specific execution process is as follows:
+
+Compile the import plugin in the build directory:
+`make feature_float_embed`
+
+Execute the following command in the build/output directory to perform the conversion:
+`./algo/feature_float_embed ./cora_db`
+
+## 5. Compile Sampling Operator
+The sampling operator is used to obtain graph data from the database and convert it into the required data structure. The specific execution process is as follows:
+Execute the following command in the tugraph-db/build directory:
+`make -j2`
+
+or execute the following command in the tugraph-db/learn/procedures directory:
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *
+import importlib
+getdb = importlib.import_module("getdb")
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+As shown in the code, after obtaining the algorithm .so file, import and use it.
+
+## 6. Training Process
+### 6.1. Data Loading
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+As shown in the code, load the data into memory based on the path of the graph data, username, password, and subgraph name. TuGraph can load multiple subgraphs for graph training, but we only load one subgraph here.
+
+### 6.2. Build Sampler
+During the training process, the GetDB operator is first used to obtain the graph data from the database and convert it into the required data structure. The specific code is as follows:
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+As shown in the code, the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and their stored information is as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Then a sampler is constructed:
+```python
+batch_size = 5
+count = 2708
+sampler = TugraphSample(args)
+dataloader = dgl.dataloading.DataLoader(fake_g,
+    torch.arange(count),
+    sampler,
+    batch_size=batch_size,
+    num_workers=0,
+    )
+```
+
+### 6.3. Convert the results to the required format
+```python
+src = EdgeInfo[0].astype('int64')
+dst = EdgeInfo[1].astype('int64')
+nodes_idx = NodeInfo[0].astype('int64')
+remap(src, dst, nodes_idx)
+features = NodeInfo[1].astype('float32')
+labels = NodeInfo[2].astype('int64')
+g = dgl.graph((src, dst))
+g.ndata['feat'] = torch.tensor(features)
+g.ndata['label'] = torch.tensor(labels)
+return g
+```
+The results are converted to the required format to fit the training format.
+
+### 6.4. Build the GCN model
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+def build_model():
+    in_size = feature_len  # feature_len is the length of features, which is 1433 here
+    out_size = classes  # classes is the number of classes, which is 7 here
+    model = GCN(in_size, 16, out_size)  # 16 is the size of the hidden layer
+    return model
+```
+In this tutorial, a two-layer Graph Convolutional Network (GCN) will be built. Each layer aggregates neighbor information to compute new node representations.
+
+### 6.5. Train the GCN model
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    return float(loss)
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+As shown in the code, iterate and train 50 times based on the defined sampler, optimizer, and model.
+
+The output is as follows:
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+The graph learning module can be accelerated by using a GPU. If users want to run it on the GPU, they need to install the corresponding GPU driver and environment. For details, please refer to learn/README.md.
+
+The complete code can be found in learn/examples/train_full_cora.py.
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..3b7b8dd3d7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# data migration
+
+## 1 Introduction
+Data migration refers to the process of moving data from one system, storage medium, or application to another system, storage medium, or application. When TuGraph needs to be upgraded or the system hardware environment changes,
+The data in the original TuGraph service needs to be migrated. Based on the system hardware environment and software version, this paper divides data migration into three schemes:
+1. Compatible migration: When the system environment before and after the migration is consistent and the TuGraph software is compatible, you can directly use the backup and recovery method to migrate data;
+2. Upgrade and migration: When the system environment before and after the migration is inconsistent or the TuGraph software is not compatible, it is necessary to migrate the data by first exporting the data and then re-importing;
+3. Online migration: When data migration is performed on a high-availability cluster and the network environment of the cluster is good, the original cluster can be smoothly switched to the new cluster by adding or deleting nodes.
+The following article will introduce these three schemes in detail.
+
+## 2. Compatible Migration
+Compatible migration means that when the system environment remains unchanged and the TuGraph software version is compatible, the data and stored procedures of the original service can be used in the new service, so it can be directly migrated.
+Users can first use the `lgraph_backup` tool to back up the data, then transfer the data to a new machine and restart the service. The specific migration steps are as follows:
+
+### 2.1. Backup data
+Backup data using `lgraph_backup` tool
+```bash
+   lgraph_backup -s db -d db.bck
+```
+You can also directly use the `cp` command in this step, but the `cp` command will copy some redundant metadata, and the raft metadata will also be copied in the HA mode, causing the cluster to fail to restart after migration.
+Therefore, it is recommended to use the `lgraph_backup` tool instead of the `cp` command during data migration.
+
+### 2.2. Start a new service
+Use the following command to start the new service, and the stored procedure will be automatically loaded into the new service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. Stop the original service
+Use the following command to stop the original service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. Upgrade migration
+When the user wants to migrate the original service to a differentiated environment (such as migrating from centos7 to ubuntu18.04), or when the version of TuGraph changes greatly and is incompatible (such as 3.4.0 and 3.6.0),
+Users can first use the `lgraph_export` tool to export the data into a file, transfer it to a new machine, and then use the `lgraph_import` tool to re-import and restart the cluster.
+This can ensure that it can be used in the new environment, but the efficiency is low, and the stored procedure needs to be reloaded. The specific migration steps are as follows:
+
+### 3.1. Export data
+Use the `lgraph_export` tool to export the data and transfer the data to the new machine
+```bash
+   lgraph_export -d db -e db.export
+```
+
+### 3.2. Import data
+Use the `lgraph_import` tool to import data and manually load the stored procedure (see [client operation steps](../5.developer-manual/4.client-tools/2.cpp-client.md) for details)
+```bash
+   lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. Start a new service
+Start the new service with the following command
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. Stop the original service
+Use the following command to stop the original service
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. Online Migration
+When performing data migration on the server cluster deployed by the high-availability version of TuGraph, if the network bandwidth is sufficient, you can directly migrate the service online by adding or deleting nodes. The specific migration steps are as follows:
+
+### 4.1. Copy data
+Use the following commands to copy the data on the leader node and transfer it to the machine nodes of the new cluster. Since the leader node has the most complete raft log, copying the leader's data can minimize
+The time for the log to catch up.
+```bash
+   cp -r db db.cp
+```
+### 4.2. Starting a new node
+Use the following command to join the new node to the cluster. After joining the cluster, the incremental data will be automatically synchronized to the new node
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. Stop the original node
+Stop the original node service, and send subsequent application requests directly to the new cluster
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/4.selection.md
new file mode 100644
index 0000000000..159c9d3b35
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# Environment and version selection
+
+> This document introduces how to select the system environment and deployment method
+
+## 1 Introduction
+
+TuGraph provides differentiated system environments and deployment methods for users with different needs to meet the needs of different users such as novices, system developers, production operation and maintenance personnel, and researchers.
+
+## 2. Environmental capability selection
+
+Users can choose different environments based on actual usage scenarios. The compilation environment has the most complete capabilities and requires more third-party software. Correspondingly, the streamlined operating environment requires almost no installation of any dependent libraries and can run TuGraph's basic functions except stored procedures.
+
+| Environment                      | Purpose                                     | Remarks                                 |
+|----------------------------------|---------------------------------------------|-----------------------------------------|
+| Compilation environment          | Compile TuGraph from source                 | For developers                          |
+| Running environment              | Run TuGraph installation package            | Applicable to most users                |
+| Simplified operating environment | Run simplified TuGraph installation package | Less dependence on the operating system |
+
+For a detailed introduction to different environments, see [link](../5.developer-manual/1.installation/2.environment-mode.md).
+
+## 3. Deployment method selection
+
+TuGraph deployment only requires one server (high availability mode requires multiple servers), and you can choose a suitable deployment method based on actual resource conditions and usage scenarios.
+
+| Deployment method | Description | Remarks |
+|----------|-----------------------|--------------- -------------------------------------------------- --------------------------|
+| Cloud deployment | Alibaba Cloud Computing Nest one-click deployment, free trial | Suitable for novices, process reference [Link](../5.developer-manual/1.installation/5.cloud-deployment.md) |
+| Docker deployment | Cross-platform deployment through pre-prepared Docker images | Users with hardware requirements, such as performance testing, please refer to [link](../5.developer-manual/1.installation/3.docker-deployment. md) |
+| Local deployment | Tightly coupled deployment in existing systems | Applicable to specified production environment, refer to the process [Link](../5.developer-manual/1.installation/4.local-package-deployment.md) |
+
+## 4. Next steps
+
+After the deployment is completed, you can proceed to [Start Service](../5.developer-manual/2.running/2.tugraph-running.md) and [Data Import](../5.developer-manual/3. server-tools/1.data-import.md) and other operations, you can also experience the entire process through [Sample Data](../3.quick-start/2.demo/1.movie.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/index.rst
new file mode 100644
index 0000000000..4292d5488f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/7.best-practices/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Best Practices
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/8.faq.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/8.faq.md
new file mode 100644
index 0000000000..5288de0798
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/8.faq.md
@@ -0,0 +1,35 @@
+# FAQ
+
+During the use of TuGraph, if you encounter problems, you can first check [User Documentation](https://github.com/TuGraph-db/tugraph-db/tree/master/doc/zh-CN). Second, check to see if the FAQ list below matches your question.
+
+1. **[Kernel Engine QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussion-4575385)**
+   1.1 [Does the edge of TuGraph support index? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165379)
+   1.2 [What is the QPS of a single TuGraph machine? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussion-4575381)**
+   2.1 [How to update the tugraph service after the visualization file is built? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165364)
+   2.2 [How to connect the existing tugraph service through npm run dev? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165366)
+   2.3 [TuGraph Browser version 3.3.0 failed to delete node label? ](https://github.com/TuGraph-db/tugraph-db/discussions/82#discussion-4465791)
+3. **[Client QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussion-4575378)**
+   3.1 [What programming languages ​​does the client currently have, and does it support node js? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165351)
+   3.2 [Does the python client support pip install? Where is the client referenced? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165353)
+4. **[Data Import QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussion-4575373)**
+   4.1 [Which common databases can TuGraph connect to? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165335)
+   4.2 [How to import data? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[Stored Procedure QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussion-4575369)**
+   5.1 [How to load stored procedure or algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165313)
+   5.2 [How to call or execute the stored procedure? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165317)
+   5.3 [Where is the open source built-in algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[Installation and deployment QA summary](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussion-4575364)**
+   6.1 [How to install using docker image? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165287)
+   6.2 [After the rpm package and deb package are installed, start the lgraph_server service. Prompt missing 'liblgraph.so' error? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165289)
+   6.3 [How to compile TuGraph on Mac's M1 chip? ](https://github.com/TuGraph-db/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussion-4575018)**
+   7.1 [Does it support conditional query of indefinite length? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165252)
+   7.2 [How to query the shortest path, how to use the shortestPath function? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165256)
+   7.3 [Using and after the query statement Where to splice the query speed is slow, how should the statement be optimized and improved? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165260)
+   7.4 [How to query the edge of any jump? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165262)
+   7.5 [Is there a date() function in Cypher? ](https://github.com/TuGraph-db/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA Summay](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+   8.1 [What should I do after the error "User has reached the maximum number of tokens" is reported? ](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+If the problem is still not resolved, we recommend you follow up or create a new thread describing your problem. At the same time, the TuGraph QA summary will be updated regularly based on the posts initiated by everyone in the discussion area.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/9.contacts.md b/docs/docusaurus/versions/version-4.0.1/en-US/source/9.contacts.md
new file mode 100644
index 0000000000..2019a8b998
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/9.contacts.md
@@ -0,0 +1,28 @@
+# Contacts
+
+If you have any feedback or suggestions for the product, You are welcome to join the discussion or make suggestions through the following contact methods.
+
+Official website: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue:
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions:
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack:
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+Dingtalk Group Chat (Discussions):
+
+![alert](../../images/dingtalk.png)
+
+WeChat Group Chat (Discussions):
+
+![alert](../../images/wechat_tech.png)
+
+Official Accounts (Information Release):
+
+![alert](../../images/wechat.png)
+
+Email（Enterprise version consultation）: tugraph@service.alipay.com
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/conf.py b/docs/docusaurus/versions/version-4.0.1/en-US/source/conf.py
new file mode 100644
index 0000000000..b8e3705b60
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/conf.py
@@ -0,0 +1,46 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('5.developer-manual/6.interface/3.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="5.developer-manual/6.interface/3.procedure/")
+    breathe_projects = {"cpp_procedure": "5.developer-manual/6.interface/3.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    subprocess.run(shlex.split("rm -rf 3.C++-procedure 4.Python-procedure.rst index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
+    subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
diff --git a/docs/docusaurus/versions/version-4.0.1/en-US/source/index.rst b/docs/docusaurus/versions/version-4.0.1/en-US/source/index.rst
new file mode 100644
index 0000000000..25a07bee58
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/en-US/source/index.rst
@@ -0,0 +1,17 @@
+TuGraph DB
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.developer-manual/index.rst
+   6.contributor-manual/index.rst
+   7.best-practices/index.rst
+   8.faq.md
+   9.contacts.md
diff --git a/docs/docusaurus/versions/version-4.0.1/images/architecture-en.png b/docs/docusaurus/versions/version-4.0.1/images/architecture-en.png
new file mode 100644
index 0000000000..edf2bc873a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/architecture-en.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/architecture.png b/docs/docusaurus/versions/version-4.0.1/images/architecture.png
new file mode 100644
index 0000000000..e8eeea87e0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/architecture.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/account-add-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/account-add-button.png
new file mode 100644
index 0000000000..5b9c7e9378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/account-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/account-add.png b/docs/docusaurus/versions/version-4.0.1/images/browser/account-add.png
new file mode 100644
index 0000000000..b0b5068027
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/account-add.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/account-delete.png b/docs/docusaurus/versions/version-4.0.1/images/browser/account-delete.png
new file mode 100644
index 0000000000..bfe49fb093
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/account-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/account-disable.png b/docs/docusaurus/versions/version-4.0.1/images/browser/account-disable.png
new file mode 100644
index 0000000000..f8ff994f21
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/account-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/account-edit.png b/docs/docusaurus/versions/version-4.0.1/images/browser/account-edit.png
new file mode 100644
index 0000000000..939c374f25
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/account-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/account-enable.png b/docs/docusaurus/versions/version-4.0.1/images/browser/account-enable.png
new file mode 100644
index 0000000000..ddc8cef578
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/account-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/account.png b/docs/docusaurus/versions/version-4.0.1/images/browser/account.png
new file mode 100644
index 0000000000..0aa0cd195c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/account.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/db_basic.png b/docs/docusaurus/versions/version-4.0.1/images/browser/db_basic.png
new file mode 100644
index 0000000000..b78298825b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/db_basic.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/db_configuration.png b/docs/docusaurus/versions/version-4.0.1/images/browser/db_configuration.png
new file mode 100644
index 0000000000..2de3da502c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/db_configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-button.png
new file mode 100644
index 0000000000..dd8966d0d3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-clear.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-clear.png
new file mode 100644
index 0000000000..ee5d3c92a9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-clear.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-collapse.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-collapse.png
new file mode 100644
index 0000000000..e053061834
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-collapse.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-delete.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-delete.png
new file mode 100644
index 0000000000..5aefa20c43
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand-after.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand-after.png
new file mode 100644
index 0000000000..371efb6e6b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand-after.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand-before.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand-before.png
new file mode 100644
index 0000000000..80e74174af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand-before.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand-custom.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand-custom.png
new file mode 100644
index 0000000000..bed0a73705
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand-custom.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand.png
new file mode 100644
index 0000000000..75b0caf2b9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-expand.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-fixed.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-fixed.png
new file mode 100644
index 0000000000..aac4a18573
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-fixed.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-lasso.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-lasso.png
new file mode 100644
index 0000000000..53f743925b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-lasso.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-legend-chart.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-legend-chart.png
new file mode 100644
index 0000000000..0ddb63b926
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-legend-chart.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-legend-list.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-legend-list.png
new file mode 100644
index 0000000000..07d0bf0a4c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-legend-list.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-retrieval.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-retrieval.png
new file mode 100644
index 0000000000..57eafece0e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-retrieval.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-unfix.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-unfix.png
new file mode 100644
index 0000000000..80fa2c8b72
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-canvas-unfix.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-operation-area.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-operation-area.png
new file mode 100644
index 0000000000..b251837e26
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-operation-area.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-attributefilter.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-attributefilter.png
new file mode 100644
index 0000000000..8883301d09
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-attributefilter.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-configurequery.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-configurequery.png
new file mode 100644
index 0000000000..d294a8616b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-configurequery.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-query.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-query.png
new file mode 100644
index 0000000000..b745e4d5c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-query.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png
new file mode 100644
index 0000000000..afbaf3bfd5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-statisticalfilter.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-statisticalfilter.png
new file mode 100644
index 0000000000..7c2e3b635e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-queryfilter-statisticalfilter.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-appearance-Button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-appearance-Button.png
new file mode 100644
index 0000000000..dab00330b7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-appearance-Button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-appearance.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-appearance.png
new file mode 100644
index 0000000000..330ad3128e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-appearance.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-layout-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-layout-button.png
new file mode 100644
index 0000000000..49516d6427
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-layout-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-layout-parameters.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-layout-parameters.png
new file mode 100644
index 0000000000..d02772bfd9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphanalysis-style-layout-parameters.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addedge-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addedge-button.png
new file mode 100644
index 0000000000..b38900728e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addedge-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addedge.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addedge.png
new file mode 100644
index 0000000000..39eca4a772
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addedge.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addvertex-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addvertex-button.png
new file mode 100644
index 0000000000..e616ce0f89
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addvertex-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addvertex.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addvertex.png
new file mode 100644
index 0000000000..df56d537bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-addvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-button.png
new file mode 100644
index 0000000000..abf1fab48f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-editedge.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-editedge.png
new file mode 100644
index 0000000000..eb7206b771
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-editedge.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-editvertex.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-editvertex.png
new file mode 100644
index 0000000000..eb252761bf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-editvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-exportmodel-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-exportmodel-button.png
new file mode 100644
index 0000000000..acbaa80189
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-exportmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-exportmodel.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-exportmodel.png
new file mode 100644
index 0000000000..4991dc7378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-exportmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import-csv.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import-csv.png
new file mode 100644
index 0000000000..2301c01cfc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import-csv.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import-datamapping.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import-datamapping.png
new file mode 100644
index 0000000000..5d55861a95
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import-datamapping.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import-success.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import-success.png
new file mode 100644
index 0000000000..20a48beb0f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import-success.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import.png
new file mode 100644
index 0000000000..0154bac688
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-import.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-importmodel-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-importmodel-button.png
new file mode 100644
index 0000000000..bb7822aaef
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-importmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-importmodel.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-importmodel.png
new file mode 100644
index 0000000000..252b082100
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-importmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-list-copy.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-list-copy.png
new file mode 100644
index 0000000000..ea210495fc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-list-copy.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-list-delete.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-list-delete.png
new file mode 100644
index 0000000000..aeba09b532
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-list-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-list-search.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-list-search.png
new file mode 100644
index 0000000000..9313c8eb7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-list-search.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-select.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-select.png
new file mode 100644
index 0000000000..18bfb3be74
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild-select.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild.png
new file mode 100644
index 0000000000..cd1f0bda1c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphbuild.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-configure.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-configure.png
new file mode 100644
index 0000000000..91fa18814f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-creategraph.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-deletegraph-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-deletegraph-button.png
new file mode 100644
index 0000000000..34a4efd42a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-deletegraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-editgraph-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-editgraph-button.png
new file mode 100644
index 0000000000..773798b78b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-editgraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-editgraph.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-editgraph.png
new file mode 100644
index 0000000000..f6cc706f41
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-editgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-homepage.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-homepage.png
new file mode 100644
index 0000000000..c3af5618ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-homepage.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-selecttemplate.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-selecttemplate.png
new file mode 100644
index 0000000000..8a19d8da39
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-selecttemplate.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-statistics-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-statistics-button.png
new file mode 100644
index 0000000000..cdb25ed397
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-statistics-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-statistics-refresh-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-statistics-refresh-button.png
new file mode 100644
index 0000000000..e2ec35cbe1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-statistics-refresh-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-statistics.png b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-statistics.png
new file mode 100644
index 0000000000..49db6e652f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/graphmanagement-statistics.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/login.png b/docs/docusaurus/versions/version-4.0.1/images/browser/login.png
new file mode 100644
index 0000000000..3f4109b059
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/login.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/pathquery-configuration.png b/docs/docusaurus/versions/version-4.0.1/images/browser/pathquery-configuration.png
new file mode 100644
index 0000000000..579a7d99ee
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/pathquery-configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/pathquery-result.png b/docs/docusaurus/versions/version-4.0.1/images/browser/pathquery-result.png
new file mode 100644
index 0000000000..0cd90cad46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/pathquery-result.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/pathquery-select.png b/docs/docusaurus/versions/version-4.0.1/images/browser/pathquery-select.png
new file mode 100644
index 0000000000..3c5d0f7751
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/pathquery-select.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-bookmark-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-bookmark-button.png
new file mode 100644
index 0000000000..9a6f73bf7c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-bookmark-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-bookmark.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-bookmark.png
new file mode 100644
index 0000000000..a93315ab17
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-bookmark.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-button.png
new file mode 100644
index 0000000000..cd00d7f3fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-download-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-download-button.png
new file mode 100644
index 0000000000..ec59f7a0ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-download-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-execute-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-execute-button.png
new file mode 100644
index 0000000000..6c38e68c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-execute-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-gqltips.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-gqltips.png
new file mode 100644
index 0000000000..bdabee92e7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-gqltips.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-download.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-download.png
new file mode 100644
index 0000000000..48890083fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-download.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-downloadtxt.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-downloadtxt.png
new file mode 100644
index 0000000000..3554ef592c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-downloadtxt.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-fullscreen-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-fullscreen-button.png
new file mode 100644
index 0000000000..13925db74f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-fullscreen-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-fullscreen-close.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-fullscreen-close.png
new file mode 100644
index 0000000000..2a63926742
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-fullscreen-close.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-fullscreen.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-fullscreen.png
new file mode 100644
index 0000000000..2dcf0ca0b4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-fullscreen.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-graph.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-graph.png
new file mode 100644
index 0000000000..9b3edecb5f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-insert-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-insert-button.png
new file mode 100644
index 0000000000..8879b2c4bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-insert-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-insert.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-insert.png
new file mode 100644
index 0000000000..2cd23b6e84
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-insert.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-jsontxt.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-jsontxt.png
new file mode 100644
index 0000000000..5f265cfff1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-jsontxt.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-jsonview.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-jsonview.png
new file mode 100644
index 0000000000..8a774f91c9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-jsonview.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-list.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-list.png
new file mode 100644
index 0000000000..4692c49eca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-result-list.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-schema-graph.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-schema-graph.png
new file mode 100644
index 0000000000..ccc9e3126b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-schema-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-schema-list.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-schema-list.png
new file mode 100644
index 0000000000..3649b41272
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-schema-list.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-selectgql.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-selectgql.png
new file mode 100644
index 0000000000..1ea624b81f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-selectgql.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-selectgraph.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-selectgraph.png
new file mode 100644
index 0000000000..6dc14e486d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-selectgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/query-view.png b/docs/docusaurus/versions/version-4.0.1/images/browser/query-view.png
new file mode 100644
index 0000000000..8d1884ad82
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/query-view.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-configure.png b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-configure.png
new file mode 100644
index 0000000000..166e54cb75
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-creategraph.png b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-graphtab.png b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-graphtab.png
new file mode 100644
index 0000000000..0f7980bc46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-graphtab.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-result.png b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-result.png
new file mode 100644
index 0000000000..2a2a59ce02
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-result.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-selectdemo.png b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-selectdemo.png
new file mode 100644
index 0000000000..7dda3f06b0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/quickstart-selectdemo.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/role-add-button.png b/docs/docusaurus/versions/version-4.0.1/images/browser/role-add-button.png
new file mode 100644
index 0000000000..a4590ac431
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/role-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/role-add.png b/docs/docusaurus/versions/version-4.0.1/images/browser/role-add.png
new file mode 100644
index 0000000000..8f56b24bd7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/role-add.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/role-delete.png b/docs/docusaurus/versions/version-4.0.1/images/browser/role-delete.png
new file mode 100644
index 0000000000..3c09e7caa8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/role-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/role-disable.png b/docs/docusaurus/versions/version-4.0.1/images/browser/role-disable.png
new file mode 100644
index 0000000000..eb2e355d58
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/role-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/role-edit.png b/docs/docusaurus/versions/version-4.0.1/images/browser/role-edit.png
new file mode 100644
index 0000000000..7b5db6e48c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/role-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/role-enable.png b/docs/docusaurus/versions/version-4.0.1/images/browser/role-enable.png
new file mode 100644
index 0000000000..40b7909289
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/role-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/vertexquery-criteria.png b/docs/docusaurus/versions/version-4.0.1/images/browser/vertexquery-criteria.png
new file mode 100644
index 0000000000..b5f95c3d83
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/vertexquery-criteria.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/browser/vertexquery.png b/docs/docusaurus/versions/version-4.0.1/images/browser/vertexquery.png
new file mode 100644
index 0000000000..97aa28122b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/browser/vertexquery.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-1.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-1.png
new file mode 100644
index 0000000000..c7202ff3de
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-1.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-10.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-10.png
new file mode 100644
index 0000000000..d6ed55c8bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-10.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-2.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-2.png
new file mode 100644
index 0000000000..6fc79fde54
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-2.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-3.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-3.png
new file mode 100644
index 0000000000..0e59f028c7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-3.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-4.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-4.png
new file mode 100644
index 0000000000..b606ec8bb8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-4.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-5.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-5.png
new file mode 100644
index 0000000000..18d5845ec1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-5.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-6.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-6.png
new file mode 100644
index 0000000000..d939108e3b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-6.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-7.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-7.png
new file mode 100644
index 0000000000..5c5d1800af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-7.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-8.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-8.png
new file mode 100644
index 0000000000..5beb0628b3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-8.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-9.png b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-9.png
new file mode 100644
index 0000000000..d04282d95a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/cloud-deployment-9.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/dingtalk.png b/docs/docusaurus/versions/version-4.0.1/images/dingtalk.png
new file mode 100644
index 0000000000..2a6576a0cd
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/dingtalk.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/htap-en.png b/docs/docusaurus/versions/version-4.0.1/images/htap-en.png
new file mode 100644
index 0000000000..85479ac1e1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/htap-en.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/htap.png b/docs/docusaurus/versions/version-4.0.1/images/htap.png
new file mode 100644
index 0000000000..c7764a3fa7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/htap.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/learn_flow_chart_en.png b/docs/docusaurus/versions/version-4.0.1/images/learn_flow_chart_en.png
new file mode 100644
index 0000000000..c9e55a52a5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/learn_flow_chart_en.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/learn_flow_chart_zh.png b/docs/docusaurus/versions/version-4.0.1/images/learn_flow_chart_zh.png
new file mode 100644
index 0000000000..9977dcfb6c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/learn_flow_chart_zh.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/multi-level-Interfaces-en.png b/docs/docusaurus/versions/version-4.0.1/images/multi-level-Interfaces-en.png
new file mode 100644
index 0000000000..b7de07422c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/multi-level-Interfaces-en.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/multi-level-Interfaces.png b/docs/docusaurus/versions/version-4.0.1/images/multi-level-Interfaces.png
new file mode 100644
index 0000000000..2c9694a476
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/multi-level-Interfaces.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-body-cypher1.png b/docs/docusaurus/versions/version-4.0.1/images/three-body-cypher1.png
new file mode 100644
index 0000000000..3f85fd8412
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-body-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-body-cypher2.png b/docs/docusaurus/versions/version-4.0.1/images/three-body-cypher2.png
new file mode 100644
index 0000000000..41f0f914cc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-body-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-body-cypher3.png b/docs/docusaurus/versions/version-4.0.1/images/three-body-cypher3.png
new file mode 100644
index 0000000000..4776f26d77
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-body-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-body-data.png b/docs/docusaurus/versions/version-4.0.1/images/three-body-data.png
new file mode 100644
index 0000000000..1913b39cbc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-body-data.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher1.png b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher1.png
new file mode 100644
index 0000000000..4b5745b96d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher2.png b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher2.png
new file mode 100644
index 0000000000..fef4592cf3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher3.png b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher3.png
new file mode 100644
index 0000000000..c0790d5d7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher4.png b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher4.png
new file mode 100644
index 0000000000..49a6498d4a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher4.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher5.png b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher5.png
new file mode 100644
index 0000000000..5d3cc55cdf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-cypher5.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-schema.png b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-schema.png
new file mode 100644
index 0000000000..24aebca93a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/three-kingdoms-schema.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/tugraph-datax.png b/docs/docusaurus/versions/version-4.0.1/images/tugraph-datax.png
new file mode 100644
index 0000000000..c2968c0c38
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/tugraph-datax.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/wandering-earth-1.png b/docs/docusaurus/versions/version-4.0.1/images/wandering-earth-1.png
new file mode 100644
index 0000000000..955c565303
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/wandering-earth-1.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/wandering-earth-2.png b/docs/docusaurus/versions/version-4.0.1/images/wandering-earth-2.png
new file mode 100644
index 0000000000..9cb17764ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/wandering-earth-2.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/wandering-earth-3.png b/docs/docusaurus/versions/version-4.0.1/images/wandering-earth-3.png
new file mode 100644
index 0000000000..c6dabbec97
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/wandering-earth-3.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/wechat.png b/docs/docusaurus/versions/version-4.0.1/images/wechat.png
new file mode 100644
index 0000000000..b490b48afd
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/wechat.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/wechat_tech.png b/docs/docusaurus/versions/version-4.0.1/images/wechat_tech.png
new file mode 100644
index 0000000000..7307a12e38
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/wechat_tech.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/what-is-graph-en.png b/docs/docusaurus/versions/version-4.0.1/images/what-is-graph-en.png
new file mode 100644
index 0000000000..53d5ba05ca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/what-is-graph-en.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/images/what-is-graph.png b/docs/docusaurus/versions/version-4.0.1/images/what-is-graph.png
new file mode 100644
index 0000000000..6f3aa196fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.0.1/images/what-is-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.0.1/requirements.txt b/docs/docusaurus/versions/version-4.0.1/requirements.txt
new file mode 100644
index 0000000000..0201af0943
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/requirements.txt
@@ -0,0 +1,5 @@
+sphinx
+myst-parser
+sphinx-panels
+sphinx-rtd-theme
+breathe
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/.readthedocs.yaml b/docs/docusaurus/versions/version-4.0.1/zh-CN/.readthedocs.yaml
new file mode 100644
index 0000000000..5b91d3cd6c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/zh-CN/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/Makefile b/docs/docusaurus/versions/version-4.0.1/zh-CN/Makefile
new file mode 100644
index 0000000000..d0c3cbf102
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?=
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/make.bat b/docs/docusaurus/versions/version-4.0.1/zh-CN/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/1.guide.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/1.guide.md
new file mode 100644
index 0000000000..0716864fcd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/1.guide.md
@@ -0,0 +1,76 @@
+# 文档地图
+
+> 这里是文档地图，帮助用户快速学习和使用TuGraph社区版。
+
+## 快速上手
+
+> 可以先了解[什么是图](./2.introduction/1.what-is-graph.md)、图[可以做什么](./2.introduction/7.scenarios.md)、以及[什么是TuGraph](./2.introduction/3.what-is-tugraph.md)。
+
+> 基于[阿里云计算巢](./5.developer-manual/1.installation/5.cloud-deployment.md)或[Docker方式](./5.developer-manual/1.installation/3.docker-deployment.md)快速部署TuGraph。
+
+> 通过产品内置的场景上手体验：[电影](./3.quick-start/2.demo/1.movie.md)、[流浪地球](./3.quick-start/2.demo/2.wandering-earth.md)、[三体](./3.quick-start/2.demo/3.the-three-body.md)、[三国](./3.quick-start/2.demo/4.three-kingdoms.md)。
+
+> 可视化操作手册看这里：[可视化操作手册](./4.user-guide/1.tugraph-browser.md)、[可视化操作手册（旧版）](./4.user-guide/2.tugraph-browser-legacy.md)。
+
+## 开发指南
+
+> 通过客户端访问TuGraph：[C++](./5.developer-manual/4.client-tools/2.cpp-client.md)、[Java](./5.developer-manual/4.client-tools/3.java-client.md)、[Python](./5.developer-manual/4.client-tools/1.python-client.md)。
+
+> 查询语言、语句创建图模型看这里：[Cypher API](./5.developer-manual/6.interface/1.query/1.cypher.md).
+
+> 存储过程和算法介绍看这里：[Procedure API (POG API)](./5.developer-manual/6.interface/3.procedure/1.procedure.md)、[OLAP API](./5.developer-manual/6.interface/2.olap/1.tutorial.md)。
+
+> C++/Python开发存储过程接口看这里：[C++/Python Procedure API](./5.developer-manual/6.interface/3.procedure/index.rst)。
+
+## 参与社区贡献
+
+> 在开始贡献前，可以先了解[如何贡献](./6.contributor-manual/1.contributing.md)
+
+> 如果想了解社区角色的划分，请访问[社区角色](./6.contributor-manual/2.community-roles.md)
+
+## 主要仓库
+
+> TuGraph-DB 仓库: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> 可视化界面: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java客户端: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> 基于twitter数据的简单测试方法: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> 基于标准LDBC-SNB的测试方法: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics 仓库: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## 视频中心
+
+> [TuGraph快速上手](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph技术分享集合](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [3分钟读懂图计算](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph最新版本
+
+| 描述                  | 文件                                         | 链接                                                                                                                                                                                              |
+|---------------------|--------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 安装包         | tugraph-4.0.1-1.el7.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-4.0.1-1.el7.x86_64.rpm) |
+| CentOS8 安装包         | tugraph-4.0.1-1.el8.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-4.0.1-1.el8.x86_64.rpm) |
+| Ubuntu18.04 安装包     | tugraph-4.0.1-1.x86_64.deb                 | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-4.0.1-1.x86_64.deb)  |
+| CentOS7 预安装镜像       | tugraph-runtime-centos7-4.0.1.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-runtime-centos7-4.0.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                   |
+| CentOS8 预安装镜像       | tugraph-runtime-centos8-4.0.1.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-runtime-centos8-4.0.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8)                   |
+| Ubuntu18.04 预安装镜像   | tugraph-runtime-ubuntu18.04-4.0.1.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-runtime-ubuntu18.04-4.0.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04)           |
+| CentOS7 精简安装包       | tugraph-mini-4.0.1-1.el7.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-4.0.1-1.el7.x86_64.rpm)                                                                                 |
+| CentOS8 精简安装包       | tugraph-mini-4.0.1-1.el8.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-4.0.1-1.el8.x86_64.rpm)                                                                                 |
+| Ubuntu18.04 精简安装包   | tugraph-mini-4.0.1-1.x86_64.deb            | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-4.0.1-1.x86_64.deb)                                                                                     |
+| CentOS7 精简预安装镜像     | tugraph-mini-runtime-centos7-4.0.1.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-runtime-centos7-4.0.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7)         |
+| CentOS8 精简预安装镜像     | tugraph-mini-runtime-centos8-4.0.1.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-runtime-centos8-4.0.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8)         |
+| Ubuntu18.04 精简预安装镜像 | tugraph-mini-runtime-ubuntu18.04-4.0.1.tar | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.0.1/tugraph-mini-runtime-ubuntu18.04-4.0.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 编译镜像        | tugraph-compile-centos7-1.2.7.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.2.7.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)          |
+| CentOS8 编译镜像        | tugraph-compile-centos8-1.2.7.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.2.7.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)          |
+| Ubuntu18.04 编译镜像    | tugraph-compile-ubuntu18.04-1.2.7.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.2.7.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04)  |
+
+
+版本更新日志见：[链接](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md )。
+
+如果您不清楚使用安装包和镜像，请参考 [环境和版本选择](./7.best-practices/4.selection.md)。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..4cbe4ce767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,13 @@
+# 什么是图
+
+> 本文面向初学者，介绍图（Graph）的基本概念。
+
+我们今天介绍的图，是图论中使用点和边表示的图（Graph），而非图像的图（Image）。
+
+![alt what is graph](../../../images/what-is-graph.png)
+
+图的基本元素是点和边，其中点表示事物或实体，边表示点之间的关联关系。
+
+如上图左侧所示，点表示的有公司、员工、项目。边表示的是他们之间的关系，包括：公司和员工之间的雇佣关系，员工和员工之间的好友关系，项目和员工之间的参与关系。除此之外，点和边上可以附加属性，比如员工的工号，雇佣的时间，这样的图是属性图。也就是说，我们可以用图的方式来抽象地表示实体及其关联关系，图有非常丰富的表达能力。
+
+除了上述的员工图谱，图还可以用于金融、工业、医疗等各个领域。在实际应用中，图的规模越来越大，比如金融交易图，点边规模可能到达百亿，与其同时，基于图的查询通常会复杂，最典型的是K跳查询，每增加一跳访问的数据都呈指数增长。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..eeb4dfd11f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# 什么是图数据库
+
+> 本文主要介绍什么是图数据库，图数据库相比于关系型数据库的优势，以及两者特点的对比。
+
+## 1. 图数据库介绍
+
+图数据库是基于图模型的数据库。与关系型数据库相比，图数据库真正注重“关系”。图数据库的主要功能是管理图数据，因此需要支持高效的点、边查询和更新；为方便用户使用，通常还需要增加对事务（transaction）的支持，以确保并发操作下的正常运行。
+
+## 2. 图数据库相比较于关系型数据库的优势
+
+图数据库的功能是传统关系型数据库的扩展。与关系型数据库仅支持的“表结构”相比，图数据库所支持的“图结构”更为灵活。图数据库在基于图的增加、删除、查询和修改方面采用不同于其他数据库的设计。在图数据操作抽象上，采用基于点的视角，例如点通过其所有“出边”（从一个点出发，连接到其他点的边）访问其邻接点。这是图数据库系统设计的核心。
+
+图数据库的独特性体现在以下三个方面:
+
+### 2.1. 性能
+
+在关联关系处理上，使用关系型数据库不可避免地要使用表的JOIN操作，这会对性能产生较大影响；而图数据库则直接跳转访问类指针，操作关联数据的效率更高，比关系型数据库提高2到4个数量级的性能。
+
+### 2.2. 兼容性
+
+现实中，项目进程通常不断演变，数据的内容甚至数据格式也在不断变化。在关系型数据库中，这意味着表结构的变化或建立多个新表，对源数据的修改非常大。而在图数据库中，仅需添加新的点、边和属性，并将其设置为对应的类型即可。从本质上说，一个表代表一种类型的数据，一个点代表一个特定的数据。这意味着关系型数据库更关注数据类型，而图数据库更关注数据个体及其关联关系。
+
+### 2.3. 直观性
+
+使用图的方式表达现实世界的关系更直接和自然，在万物互联的时代尤为突出。如果使用关系型数据，先建立实体表，再建立关系表，最后映射数据，需要高度的抽象思维。在图数据上进行分析查询时，可以直观地通过点边连接的拓扑结构找到所需数据，无需任何专业知识。
+
+## 3. 图数据库与关系型数据库对比
+
+| 分类         | 模型   | 优势                                   | 劣势                                     | 举例           |
+| ------------ | ------ | -------------------------------------- | ---------------------------------------- | -------------- |
+| 关系型数据库 | 表结构 | 数据高度结构化，一致性强，软件成熟度高 | 面向多跳的关联关系查询低效或不支持       | MySQL、Oracle  |
+| 图数据库     | 图结构 | 针对关联关系的建模建模和操作效率非常高 | 高度结构化的数据处理能力不及关系型数据库 | Neo4j、TuGraph |
+
+总之，面对海量数据的存储和处理问题，传统的关系数据库已经无法满足大部分的日常数据存储需求。图数据库技术可以将关系信息存储为实体，灵活拓展数据模型。由于提供了对关联数据最直接的表达方式和图模型对异构数据的天然包容性，图数据库技术必将成为未来最热点的技术之一，为企业提供存储和分析大规模图数据的有力支持。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..a2808c9237
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,95 @@
+# 什么是TuGraph
+
+> 本文主要介绍TuGraph社区版的主要功能和特性，以及TuGraph企业版和社区版的差异。
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群，解决了图数据分析面临的大数据量、高吞吐率和低延迟等重大挑战，是蚂蚁集团金融风控能力的重要基础设施，显著提升了欺诈洗钱等金融风险的实时识别能力和审理分析效率，并面向金融、工业、政务服务等行业客户。
+
+## 2. TuGraph社区版
+
+2022年9月，TuGraph单机版开源，提供了完备的图数据库基础功能和成熟的产品设计，支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台。
+
+TuGraph社区版于2022年9月开源，提供了完整的图数据库基础功能和成熟的产品设计（如ACID兼容的事务、编程API和配套工具等），适用于单实例部署。社区版支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台，是学习TuGraph和实现小型项目的理想选择。
+
+## 3. TuGraph特性
+
+TuGraph是支持大数据量、低延迟查找和快速图分析功能的高效图数据库。TuGraph也是基于磁盘的数据库，支持存储多达数十TB的数据。TuGraph提供多种API，使用户能够轻松构建应用程序，并使其易于扩展和优化。
+
+它具有如下功能特征：
+
+- 属性图模型
+- 实时增删查改
+- 多重图（点间允许多重边）
+- 多图（大图与多个子图）
+- 完善的ACID事务处理，隔离级别为可串行化（serializable）
+- 点边索引、全文索引
+- 混合事务和分析处理（HTAP），支持图查询、图分析、图学习
+- 主流图查询语言（OpenCypher、ISO GQL等）
+- 支持OLAP API，内置30多种图分析算法
+- 基于C++/Python的存储过程，含事务内并行Traversal API
+- 提供图可视化工具
+
+在性能和可扩展性方面的支持：
+
+- 千万点/秒的高吞吐率
+- TB级大容量
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线的备份恢复
+
+## 4. 数据模型
+
+### 4.1. 图模型
+
+TuGraph是一个具备多图能力的强类型、有向属性图数据库。
+
+- 图项目：每个数据库服务可以承载多个图项目（多图），每个图项目可以有自己的访问控制配置，数据库管理员可以创建或删除指定图项目。
+- 点：指实体，一般用于表达现实中的实体对象，如一部电影、一个演员。
+    - 主键：用户自定义的点数据主键，默认唯一索引，在对应的点类型中唯一。
+    - VID：点在存储层自动分配图项目中的唯一ID，用户不可修改。
+    - 上限：每个图项目存储最多2^(40)个点数据。
+- 边：用于表达点与点之间的关系，如演员出演电影。
+    - 有向边：边为有向边。若要模拟无向边，用户可以创建两个方向相反的边。
+    - 多条边：两个点数据之间可以有多条边数据。当前TuGraph支持重复边，如要确保边边唯一，需要通过业务策略实现。
+    - 上限：两个点数据之间存储最多2^(32)条边数据。
+- 属性图：点和边可以具有与其关联的属性，每个属性可以有不同的类型。
+- 强类型：每个点和边有且仅有一个标签，创建标签后，修改属性数量及类型有代价。
+    - 指定边的起/终点类型：可限制边的起点和终点点类型，支持同类型边的起点和终点的点类型不同，如个人转账给公司、公司转账给公司；当指定边的起/终点类型后，可增加多组起/终点类型，不可删除已限制的起/终点类型。
+    - 无限制模式：支持不指定边的起点和终点的点类型，任意两个点类型间均可创建该类型的边数据。注：当指定边的起/终点类型后无法再采用无限制模式。
+
+### 4.2. 数据类型
+
+TuGraph支持多种可用于属性的数据类型。具体支持的数据类型如下：
+
+| **数据类型** | **最小值**          | **最大值**          | **描述**                            |
+| ------------ | ------------------- | ------------------- | ----------------------------------- |
+| BOOL         | false               | true                | 布尔值                              |
+| INT8         | -128                | 127                 | 8位整型                          |
+| INT16        | -32768              | 32767               | 16位整型                         |
+| INT32        | - 2^31              | 2^31 - 1            | 32位整型                         |
+| INT64        | - 2^63              | 2^63 - 1            | 64位整型                         |
+| DATE         | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" 格式的日期             |
+| DATETIME     | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD HH:mm:ss[.ffffff]" 格式的日期时间 |
+| FLOAT        |                     |                     | 32位浮点数                       |
+| DOUBLE       |                     |                     | 64位浮点数                       |
+| STRING       |                     |                     | 不定长度的字符串                    |
+| BLOB         |                     |                     | 二进制数据（在输入输出时使用Base64编码） |
+
+### 4.3. 索引
+
+TuGraph支持对点或边的属性创建索引，以提升查询效率。
+- 索引可以是唯一或非唯一索引。
+- 如果为点标签创建了唯一索引，在修改该标签的点时，会先执行数据完整性检查，以确保该索引的唯一性。
+- 每个索引都基于一个点或边的一个属性创建，可以对同一点或边的多个属性创建索引。
+- BLOB类型的属性不能建立索引。
+
+## 5. TuGraph企业版
+
+企业版对商业化功能支持更加完善，包括分布式集群架构，覆盖探索、研发、服务、运维管理全生命周期的一站式图平台，在线、近线、离线的图计算引擎，支持流式、大数据类数据源，多地多中心的部署形态，以及专家支持服务等。企业版是商业化解决方案的理想选择。
+
+如需商业支持，请联系我们：
+
+- 电话：400-903-0809
+- 邮件：tugraph@service.alipay.com
+- 官网：https://tugraph.antgroup.com
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..612c0430ad
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# 性能优先
+
+> 此文档主要介绍 TuGraph 性能优先的设计理念。
+
+## 1.简介
+
+TuGraph目前是世界上最快的图数据库，在图数据库标准评测LDBC SNB Interactive位居榜首（2023.3）。TuGraph的设计基于性能优先，致力于打造高性能的单机图数据库。该文档是TuGraph基于性能优先在存储层的核心设计。
+
+## 2.图操作的特性
+
+在属性图上的操作涉及读、写及其属性，对一些特殊的属性比如时间戳也访问模式也会影响到整体性能。这里通过对一些图操作特性的规律总结，来指导最终的性能。
+
+我们观察到很多图应用有类似的数据访问模式。例如，在信贷风险控制中，我们使用递归路径过滤搜索多对一模式，以找到可疑的信用欺诈用户和行为。针对网络赌博，可以通过识别短时间内的多笔资金转移，来发现涉赌的资金账号。股权穿透场景对实体间的股权关系进行递归计算。这些场景具有多跳实体和关系访问、时间窗口约束和读写事务等常见模式。
+更进一步，从介绍中的讨论和图负载的分析中，归纳出以下特征:
+
+**规律一** KHop是图中最典型的操作，它基于点和边的图拓扑的数据访问模式，和关系型数据库有着本质的区别。KHop 的典型性除了表现在数据访问模式不同，它同时也是图数据库最需要关注的性能点。
+
+**规律二** 图负载的数据访问在拓扑上有一定的局部性，同一个点的边通常会被同时访问。当这些边的标签相同时，有更大的概率会被同时访问。
+
+**规律三** 图负载在访问点边时，通常会访问其对应的属性，来作为遍历过滤的条件。
+
+**规律四** 在基于时序的图负载，对点边的过滤通常是在某个时间范围，比如最近的一周。
+
+**规律五** 写操作可能伴随着大量的读操作，需要在单个事务周期里处理。
+
+通过对实际线上图应用的分析，图负载的读写比率大约为 20:1，虽然场景局限在金融场景，集群数也有限，但涉及的数据规模和用户量非常庞大，具有一定代表性。20:1 的图负载读写比率，说明读工作负载对整体性能的影响更大， 而写工作负载的性能也不能忽视。
+
+## 3.存储数据结构
+
+TuGraph底层采用B+树来支持实时的增删查改事务。
+
+在排序树的数据结构中，B+树和LSM树为主要代表。B+树在树节点中使用拆分和合并式来更新排序数据，而 LSM 树在日志中追加更新，以进行延迟数据合并。B+ 早期用在文件系统的实现中，通过将数据保存 在自适应长度的叶子节点中，解决硬盘顺序操作和随机操作性能存在数据量级差别的问题，有较均衡的读写性能。LSM 树的主要优势使用 WAL(Write Ahead Log) 进行更新，将更新操作变成顺序操作，在键值较小时性能优势尤为突出。WAL 意味着将数据的更新合并推迟，批量更新能提升综合效率，也使得系统的调度变得复杂。如果更新合并完成前，恰好对其中的数据继续读取，LSM 树就需要读取几个层级局部合并的日志，会导致读取放大和空间放大，从而影响读效率。
+
+总结来说，B+ 树有较好的顺序读写性能，而 LSM 树在数据随机写方面占优。此外 LSM 树采用后台合并的方式，使得性能的波动难以预期，性能波动和上层存储和计算的关联性较弱，增加了整体设计的成本。综上考虑，TuGraph 选用 B+ 树作为读性能优先的实现。
+
+## 4.数据编码
+
+对于属性图模型而言，除了图拓扑编码外，属性数据也会很大程度影响功能和性能，我们先讨论属性数据如何与拓扑数据共存的编码格式。从目前的调研来看，属性编码有两种方式，我们称之为基于指针索引将属性数据单独存储的离散编码，和将属性数据和拓扑数据打包在一起的紧凑编码。离散编码根据程度的不同，可以每个属性都单独存储，或者每条边的属性打包后各自存储，下面的讨论对两种情况都适用。
+
+点查询。属性编码主要针对边，不涉及点查询。
+
+单边查询。离散编码通过指针定位边，紧凑编码则需要二分查找定位边的位置，离散编码有略微的优势。
+
+边遍历。离散编码在边遍历过程需要不断地进行指针跳转进行随机数据访问，而紧凑编码提前把数据排列在一起，顺序访问的特性使得效率大大提升。 由规律三知对边的遍历操作很普遍，紧凑编码在边遍历的优势明显。
+
+单边更新。离散编码对边的更新仅需找到对应的指针位置，插入数据后修改前后指针指向。紧凑编码则需要对紧凑排列的数据进行重编码，对整个边值进行重新写入，开销显著大于离散编码的情形。
+
+批量边更新。批量更新可以在内存中预先构建点的所有边属性，一次性编码写入，离散编码和紧凑编码相当。但紧凑编码不需要存储指针变量，更少的存储空间效率也会更高。
+
+以上离散编码和紧凑编码在某一类的查询的性能问题，可以通过优化的来缓解。整体上说，由于图负载读写 20:1 的特性，读性能在整体性能中占比更高。以及规律三所揭示的对属性访问的特征，TuGraph 更倾向于采用紧凑编码来保证读性能。其主要弱势为单边更新时重编码的开销，可以用自适应映射的技术来解决，
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..0e4b70768c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,34 @@
+# 多层级接口
+
+
+> 此文档主要介绍 TuGraph 的多层级接口的设计理念。
+
+## 1.简介
+
+多层级接口是 TuGraph 针对多丰富的使用场景，在易用性和高性中作出的平衡。比如描述式图查询语言 Cypher 能够抹去图数据库实现的细节，基于图模型的抽象来进行表达。Cypher 过于高层的表述，无法高效转化成底层的执行，因此提供了 Procedure API 的过程式语言，来发挥图数据库的最佳性能。
+
+接口可以大致分为客户端接口和服务端接口，大部分操作都在服务端完成，客户端只做数据的封装和解析。客户端和服务端通过网络连接，TuGraph 支持更加灵活的短连接 REST 协议，以及更加高效的长链接 RPC 协议，可根据不同的业务场景来选择。
+
+服务端接口均处在计算层，和图数据存储间用一层 Core API 在逻辑上隔开。
+
+![多层级接口架构](../../../../images/multi-level-Interfaces.png)
+
+### 1.1.客户端接口
+
+客户端接口指在客户端执行的接口，通常用于集成到软件应用中。TuGraph 的客户端的接口比较简单，包括登录登出、数据导入导出、存储过程加载调用、Cypher操作等。其中 Cypher 中集成了大部分的功能，包括数据操作、图模型操作、运维管理、账户管理等。
+
+由于 Cypher 的参数和返回值都是字符串，JAVA OGM 是对 Cypher 的结构化封装，即查询结果能够被封装为一个有类型的对象，方便使用。
+
+### 1.2.服务端接口
+
+服务端接口包括描述式图查询语言 Cypher、过程式图查询语言 Procedure API、图分析编程框架 OLAP API 和图神经网络编程框架 GNN PI，为图事务引擎、图分析引擎、图神经网络引擎提供服务，下面先展开介绍各个接口的特点。
+
+> __描述式图查询语言__ 是对查询逻辑的抽象描述，而与执行逻辑无关，对图数据库应用者比较友好，类比关系型数据库的 SQL 语言。TuGraph 的 Cypher 语言主要依照 Neo4j 开源的 OpenCypher 查询标准，同时对运维管理等辅助功能进行了扩展，在功能上囊括了 TuGraph 的大部分操作。描述式图查询语言会成为图数据库的主要数据操作方式，但由于描述到执行之间需要生成执行计划（Execution Plan），生成最优执行计划在学术界和工业界均有很长的路要走。
+
+> __过程式图查询语言__ 是为了解决描述式图查询语言与最优性能间的鸿沟。TuGraph的 Procedure API 是在 Core API 上做了一层简单的封装，C++ Procedure API的灵活性和高效性能够充分发挥存储的极致性能，也是 Cypher 优化的上限性能。Python Procedure API 是 C++ Procedure API 上的一层跨语言封装，翻译过程中值的拷贝会带来一定的性能损失，优势则主要是 python 语言本身的易用性。raversal API 是并行执行的 Procedure 接口，描述上更接近于集合的操作，比如扩展点集合所有出度邻居，获得一个新的点集。
+
+> __图分析编程框架__ 属于 ‘图计算系统’ 的范畴，会将图数据从支持增删改查的存储中导出快照，以更紧凑的数据存储格式来支持只读的复杂图分析，这里叫做OLAP API。OLAP API 封装了高并发执行的数据结构，包括 Vector、Bitmap等，以及基于 CSR 格式的图快照数据结构，然后提供一套并发的快速点边操作框架。在图分析任务完成后，数据可以通过接口写回图数据库。
+
+> __图神经网络编程框架__ 主要提供了图神经网络应用编程所需要的接口，能够对接PyTorch 等机器学习框架。TuGraph 的图神经网络编程框架主要集成了 DGL，在 Python 的语言环境中完成从图存储到图神经网络应用的完整流程。
+
+除了 Cypher 是解释执行外，其余服务端接口都是编译执行，即需要将对应代码传到服务端后，进行编译（可能会有时间开销），再在服务端执行。所以通常需要先加载，然后再已加载的应用列表中找到程序，传输入参数后执行
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/3.htap.md
new file mode 100644
index 0000000000..16eff8e94f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> 此文档主要介绍 TuGraph 的HTAP的设计理念。
+
+## 1.简介
+
+![htap架构](../../../../images/htap.png)
+
+HTAP 的实现在架构上有多种不同的方式：一是用两个不同的副本来分别处理 OLTP 和 OLAP 的任务，核心是数据的一致性同步和额外的资源开销；二是在任何时候都使用同一份数据存储，该实现的数据结构存在内存膨胀，在工业化落地还需要进一步工作。在 TuGraph 的设计中，简单的 OLAP 操作和 OLTP 操作共用一份数据，而复杂的 OLAP 操作则单独导出快照处理。
+
+## 2.设计
+
+在 TuGraph 中，OLTP 为图事务引擎，在图 4.4对应事务操作；OLAP 为图分析引擎，对应简单图分析操作（比如 SPSP）和复杂图分析操作（比如 PageRank），前者可以直接在图存储上执行，而后者需要额外导出快照执行。
+
+- 事务操作，即图事务引擎测的操作，为局部图的增删查改操作，典型的应用为 K 跳访问 K-Hop。
+- 简单分析操作，是图分析引擎中较为简单的部分，通常也是局部的图分析操作，比如两点间最短路算法 SPSP、Jaccard 算法。
+- 复杂分析操作，是图分析引擎中较为复杂的部分，通常涉及全图的多轮数据迭代操作，比如网页排序算法 PageRank、社区发现算法 Louvain。
+
+如图 4.4所示，我们在架构图中增加了外部存储，使得图分析的数据源不局限在图数据库中，可以直接从文本文件读取。
+
+- 图存储，即图数据库中的存储，有精心设计的数据结构，能够完成实时增删查改。
+- 外部存储，可以是 RDBMS 或文本文件，以边表的简单方式存储，仅供一次性批量读取，和批量结果写入。在计算层，和整体架构图中的接口对应。
+- Cypher，描述式图查询语言，可以并发执行。
+- Procedure API，过程式图查询语言，其灵活性能够同时支持事务操作和图分析操作，但效率上不足以完成复杂图分析操作，可以并发执行。
+- OLAP API，针对多轮迭代的复杂图分析。应用需要先将存储中的图数据导出成内存中的一个快照，该快照仅用来快速访问，而不需要考虑 ACID 的写支持，因此可以排布地更加紧凑，CSR 排布的读效率要远高于图存储的数据排布。OLAP API 只能串行执行，每个操作都用满 CPU 资源。
+
+OLAP API 的快照可以从外部存储创建，即将边表数据构成件 CSR 的格式；或者从图存储中创建。需要注意的是，OLAP API 要求点的 ID 是连续的自然数，可能需要额外的 ID 映射，该步骤在创建快照时可以在指定一个属性进行映射，或直接取属性值作为 ID。
+
+与计算接口和存储相对应，有四种运行模式。
+
+- 事务模式，每个操作对应一条 Cypher 语句，默认是一个事务。
+- Plugin 模式，通过插件的方式，在计算逻辑加载到服务端后调用，也叫存储过程。
+- Embed 模式，和 Plugin 模式的使用接口一致，区别是图数据库服务不需要起来，就可以直接用接口调用数据库中的数据，通常用于调试 Procedure API 和OLAP API 的代码，调试信息和操作步骤比 Plugin 模式更加友好。
+- Standalone 模式，最大程度剥离与图数据库的关系，仅想用图分析引擎做数据分析时，该模式会比较直接。Standalone 模式会直接使用外部存储的数据。
+
+图神经网络引擎的使用方式和 ‘复杂图分析操作’ 类似，会同时调用部分 OLAP API 和 GNN API，不在这里展开。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/index.rst
new file mode 100644
index 0000000000..853243ed8c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/4.characteristics/index.rst
@@ -0,0 +1,10 @@
+产品特点
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
+    
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/5.architecture.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/5.architecture.md
new file mode 100644
index 0000000000..cf901d31cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/5.architecture.md
@@ -0,0 +1,15 @@
+# TuGraph产品架构
+
+> 此文档主要介绍 TuGraph 的产品架构。
+
+## 1.简介
+
+![产品架构](../../../images/architecture.png)
+
+上图从功能模块的角度，以 TuGraph 为例，给出了企业级图数据库的整体架构，自下而上包括：
+
+- 软硬件环境。涉及图数据库的开发和使用环境。TuGraph 主要基于底层的 C++语言开发，能够兼容市面上大部分操作系统和 CPU。
+- 存储层，包括 KV 存储层和图存储层。存储层需要支持计算层所需的各个功能。
+- 计算层。计算层应包括图事务引擎、图分析引擎和图神经网络引擎，也包含了服务端提供的多种编程接口，包括描述式查询语言 Cypher，存储过程等。
+- 客户端。客户端 SDK 应支持 Java、Python、C++ 等多种语言，也支持命令行的交互方式。Browser 和 Explorer 通过网页端交互的方式，降低了图数据库的使用门槛。
+- 在生态工具方面，覆盖了企业级图数据库的开发、运维、管理等链路，提升可用性。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/6.functionality.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/6.functionality.md
new file mode 100644
index 0000000000..934032187e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/6.functionality.md
@@ -0,0 +1,112 @@
+# 功能概览
+
+> 此文档主要介绍 TuGraph 的主要功能和特性。
+
+## 1.安装部署
+
+## 1.1.部署方式
+
+TuGraph目前提供云部署、Docker部署以及安装包部署三种部署方式，用户可根据实际情况选择适合的部署方式。
+
+## 1.2.软硬件环境
+
+TuGraph核心是由C++开发，默认使用的编译器为GCC8.4，使用c++14标准。部分功能使用了其他编译器，比如全文索引的实现基于ApacheLucene，采用JNI接口需要Java编译器。此外，存储过程中额外提供了Python Procedure API，该功能需要Python环境。TuGraph不需要特殊的硬件比如GPU，对RDMA、HBM等高延迟低带宽的通用硬件升级可以天然适配。
+
+TuGraph测试过基于X86和ARM的CPU，包括Intel、AMD、Kunpeng、Hygon、飞腾等，也同时在多个操作系统上运行，包括Ubuntu、CentOS、SUSE、银河麒麟、中标麒麟、UOS的主流版本，对操作系统和CPU没有特殊的要求。
+
+软硬件环境也包括依赖库的环境，由于TuGraph的存储层中默认的KV存储是LMDB，需要文件系统能够支持POSIX接口。在不同的环境下编译和参数配置会略有不同，比如在图存储的点边数据打包中，应和操作系统的页表大小匹配，默认为4KB，建议将系统的页表大小也设置为4KB。
+
+## 2.存储层
+
+在图数据模型上，TUGraph支持属性图模型，按照层次可以分为子图、标签（包括点标签和边标签）、属性。从存储层看，TuGraph使用使用直观的多层的树状模型，没有跨子图的标签，也没有跨标签的属性，仅保留图模型的核心逻辑。
+
+在子图的存储上，TuGraph对多图做了数据的物理隔离，每个图对应一个LMDB的实例。多图的元数据描述信息，保存在meta的特殊的公共LMDB实例中。点边标签及其属性的存储，通过将图数据自适应地映射到KV键值对，最大程度发挥读性能。同时在KV层实现了多线程写，解决了LMDB写性能较低的劣势。主键索引和二级索引，对应LMDB中B+的表，支持基于比较的索引值增删查改。
+
+存储层还保留了一些其他非核心功能的数据，包括权限数据、预编译的插件数据、监控数据等。
+
+## 3.计算层
+
+计算层在功能上分成三个部分，包括TP类的图事务引擎，AP类的图分析引擎和图神经网络引擎。
+
+- __图事务引擎__，主要用来处理并发的图操作，包括单点查询、邻居查询、路径遍历。图事务引擎侧重并发操作的ACID事务，确保操作逻辑不会互相干扰，主要性能指标为 QPS，即每秒完成的查询数量。
+
+- __图分析引擎__，操作类型通常为全图迭代。部分简单的分析任务（比如SPSP）可以由图事务引擎完成，复杂的分析任务均由图分析引擎完成，单个任务通常需要数秒至数小时。因此单个图分析任务要并发利用所有的硬件资源，性能指标为任务完成的总时长。
+
+- __图神经网络引擎__，通常也为全图迭代。图神经网络引擎除了基于图拓扑的操作，也需要集成一个机器学习的框架来处理向量操作，比如 PyTorch、MXNet、TenserFlow。
+
+三个引擎的操作逻辑不尽相同，独立配置资源池。事图事务引擎基于RPC操作设置了一个线程池，每接受客户端的一个操作，从线程中取一个线程来处理，并发执行的数量等于RPC线程池的容量，通常配置为服务器的核数。图分析引擎有一个分析线程池，每个图分析任务会并发执行，即用所有的线程来执行一个任务，来加速操作的性能。TuGraph图分析操作串行执行的特性会一定程度限制用户的使用体验，并发的图分析的需求可以通过高可用部署的方式，增加机器资源来处理，或者接入外部的任务调度器，将数据传到实时调度的容器来计算。图神经网络操作在图上的操作会复用图事务引擎或图分析引擎的资源，向量的操作会起单独的资源，在机器学习框架中可以使用GPU等单独的加速硬件。
+
+## 4.核心功能
+
+### 4.1.查询语言
+
+TuGraph 提供 Cypher 图查询语言，遵循OpenCypher标准。
+- __支持Procedure嵌入__
+
+- __可插拔优化框架__ 各类优化功能
+
+- __可扩展安全性检查框架__ 对于cypher进行
+
+### 4.2.存储过程
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个 REST 请求并在客户端完成整个
+处理流程的方式，TuGraph 提供的存储过程（Procedure）是更简洁和高效的选择。
+
+从 3.5 版本开始，TuGraph 重新设计了新的存储过程编程范式，支持定义标准的签名和结果，支持POG编程。
+
+TuGraph 支持 POG (Procedres on Graph Query Languages) 编程和 POG 库，其中“Graph Query Languages”包含 Cypher 以及
+制定中的 ISO GQL 等图查询语言。POG 库提供在查询语言中对用户定义的存储过程的访问，打破了查询语言和存储过程之间的界限，扩展了查询
+语言的使用范围。
+
+> 这个文档描述了 [新的 Procedure 编程范式以及 POG](../5.developer-manual/6.interface/3.procedure/1.procedure.md)。
+
+### 4.3.数据导入导出
+
+尽管TuGraph本身支持数据的插入，但批量导入能够大幅提升的效率。导入的功能可以分为空库导入（离线导入）和增量导入，前者指子图是空的时候进行导入，额外的假设能够大幅提升导入的性能，在 TuGraph 中，空库导入和增量导入的吞吐率差了10 倍。在数据导出中，需要考虑导出数据的一致性，即是基于一个快照数据导出的。
+
+TuGraph 可以通过 命令行工具`lgraph_export` 来对已经存放在TuGraph的图数据进行数据导出，导出格式支持CSV和JSON。
+
+### 4.4.备份恢复
+
+TUGraph的备份在功能上可分为主动/定时、离线/在线、全量/增量备份，用尽量小的存储和计算代价来完成备份。恢复功能可以恢复到最新的状态，或者历史标注的时间点，需要保证数据库是一致的状态。
+
+### 4.5 数据预热
+
+TuGraph 是基于磁盘的图数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+### 4.6 高可用
+
+高可用是指通过通过集群配置，做到实时多副本数据热备，在部分副本不用时，集群仍然能正常提供服务，TuGraph采用 RAFT 协议的多机热备机制，能够将 RPO 降低到接近 0 的程度。TuGraph 选择在计算层进行数据同步，同步的对象是写操作，通过 RPC 接口快速同步。TuGraph 的高可用集群采用主从模式，只有主节点处理写请求，主从节点均能处理读请求。主节点的写请求处理需要同步到多于二分之一的总节点上，多数节点写成功，该写请求才算完成。
+
+## 5.客户端工具
+
+客户端主要分为各种编程语言的SDK，OGM以及命令行工具。
+
+客户端 SDK 主要用于二次开发，可以通过 RPC 或 REST 协议链接服务端。RPC 基于长链接有较好的性能，数据需要通过 protobuf 统一序列化。TuGraph 使用brpc，支持 Java、Python、C++ 的 rpc 客户端。REST 的协议比较宽泛，能够简单适配更加多样的环境，不同的编程语言能够简单对接。TuGraph 给出了 Python 的REST 客户端实例，命令行的交互也是用 REST 实现。
+
+OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。
+
+命令行工具`lgraph_cypher`是查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+
+## 6.生态工具
+
+生态工具是企业级数据库一个非常重要的组成部分，丰富的生态工具能够大大提升图数据库的可用性，稳定性。
+
+### 6.1.TuGraph DataX
+
+![导入导出](../../../images/tugraph-datax.png)
+
+TuGraph 核心支持 CSV 和 JSON 合适的导入导出，提供空库导入和增量导入的模式。实际中会存在 MySQL、Kafka、Hive 等多数据源导入的需求，TuGraph 通过 DataX 做多数据源的对接。由于关系模型和图模型存在的差异，数据清洗的流程可以使用 SparkSQL 快速处理，TuGraph 本身仅关注 CSV 和 JSON 的简单场景导入可靠性和性能。
+
+### 6.2.可视化交互
+
+TuGraph Browser 是面向图数据库直接使用者的可视化交互界面，功能上覆盖了 TuGraph 的绝大部分能力，包括数据导入、图模型建立、数据增删查改、监控运维等操作链路。
+
+TuGraph Explorer 则是面向图业务方，更侧重业务逻辑。Explorer 是基于Graph Insight的零代码编程框架生成的可视化交互界面，可以比较方便地添加业务更加友好的交互元素，把图作为一个底层的理解形象的展现出来。
+
+### 6.3.运维监控
+
+TuGraph 使用 Prometheus 加 Grafana 的监控框架，采用松耦合的方式。Prometheus 从 TuGraph 的监控接口获取监控信息，存储在本地时序数据库中，然后通过 Grafana 在网页端交互展示。
+
+TuGraph 提供的监控的状态包括图数据库的状态和服务器的状态，前者包括读写负载、点边数量等数据库端的状态，后者包括内存、CPU、硬盘等服务器的实时状态。如果某些监控状态超过了预期的阈值，就需要主动告警，通常需要对接其他运维管控系统，比如群消息、邮件告警等。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/7.scenarios.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/7.scenarios.md
new file mode 100644
index 0000000000..4cc5c0c10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/7.scenarios.md
@@ -0,0 +1,61 @@
+# 应用场景
+
+> 此文档主要介绍图数据库适用的应用场景。
+
+## 1. 金融领域
+
+金融领域的实体主要涉及人、公司、账户、产品等，它们之间的关系包括交易关系、登录关系、股权关系、雇佣关系等。这些实体构成了一张金融图数据网络。应用图数据库，我们可以从金融图数据网络里发掘出大量有用信息，帮助我们做出更准确的金融决策。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|贷款审核|通过分析申请人的关联关系、交易情况等辅助判断申请人的偿还能力和偿还意愿，可应用于零售贷款审核、小微贷款审核、供应链金融等。此方法可与传统的基于申请人自身信息的审核机制互补，在个体信息录覆盖较低的小微贷款审核中尤其有用。|
+|贷后管理|通过分析借款人交易情况，辅助分析借款人是否有逾期风险。相比于传统只在贷款资金流向特定用户的情况下发出警报的方式不同，该方法可以给每个账户赋予一个风险值，并在贷款流向高风险账户时给出预警。|
+|失联修复|通过分析失联贷款人的社交和购物数据，找出其它联系方式。该方法可以大幅改进失联修复率。|
+|担保环检测|可在担保关系图中找出环状、链式、家族式、交叉等特殊担保结构，揭露潜在风险。相比于关系型数据库的JOIN方法，基于图算法的方案更高效，可以检测出任意长的担保环，且可以实现更复杂限定条件的检测。|
+|信用卡团伙欺诈检测|构建信用卡申请信息中的地址、联系方式等关系网络，在申请关系网络中运行社区发现算法，可以检测出疑似欺诈的团伙，从而拒绝涉嫌欺诈的申请件，减少经济损失。|
+|反洗钱|通过交易网络和介质网络，找出疑似洗钱的行为和链路。洗钱是一个复杂的多方参与的过程，通过在交易和社交网络中进行图分析，我们可以更精准的检测出洗钱行为。|
+|车险反欺诈|针对有修理厂参与的骗保行为，通过分析被保人、案件地点和修理厂之间的关系，可以更精准的识别出骗保行为，减少经济损失。|
+
+## 2. 工业领域
+
+在生产和制造过程中会产生大量异构数据，如何有效的组织和管理这些数据是工业大数据中最重要的问题之一。这些数据包括设计文档、设备数据、仿真方案和结果、实验结果、经验文档等，关系错综复杂。传统的数据管理系统只能累积数据，而查找相关材料则往往力不从心。使用图模型，将这些不同类型的数据组织成一张网络，就可以方便地浏览和查找数据。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|供应链管理|供应链数据主要关心产品—部件—零件的对应关系、零件与供应商的对应关系、零件中的敏感成分等。相比于传统的物料管理（BOM）系统，使用图数据库的方案可以更方便地维护多个部件层次、多个供应商级别的复杂网络，从而为穿透式供应链提供基础支持。|
+|文档管理|使用图数据库可以将不同类型的文档按不同关系有机地组织在一起。例如将部件设计文档、部件—零件关系、部件测试文档、相关经验文档等组织起来，在需要查找时就可以方便获取该部件的所有相关信息。|
+|研发过程管理|产品研发和验证过程中需要进行大量仿真、试验和测试，每一个测试流程都会涉及大量不同的步骤。步骤之间的连接关系、每个步骤中使用的数据版本、算法版本等就构成了一张复杂的关系网络。使用图数据库可以更好管理这个关系网络，从而为研发过程中的数据复用、流程改进提供良好基础。|
+|设备信息管理|制造业需要管理大量设备，设备之间又互相关联（供电关系、供料关系、空间关系），从而形成了一张复杂的网络。传统的数据库很难体现这种复杂关系。而使用图数据库则可以便捷表示这些关系，从而更好的管理设备信息。|
+
+## 3. 智慧城市
+
+随着科技的发展，城市的智能化管理已成为一个大趋势。智能化管理需要建立在良好的信息管理平台之上，因此需要强大的系统软件做支撑。在智能化城市管理系统中，智能化决策系统需要基于大量不同信息做出决策，这些信息包括各种拓扑信息（道路、管线），供求信息（电力输送、饮用水供应、污水排放），环境信息（温度、湿度、雨量）等。要将这些复杂的异构数据有机管理起来，并基于它们做出决策，就需要一个成熟的系统。传统的数据管理系统基于关系数据模型，并不适合管理这种复杂异构数据。而使用图模型就可以很好的解决这一问题。如果我们将这些不同的数据利用图数据库进行管理，就可以实现很多复杂的智能管理场景。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|智能交通|基于道路拓扑、道路容量及当前流量，可以进行智能信号灯调度，从而提高通行效率。|
+|智能排水|基于排水系统信息及当前雨量，可以对排水系统进行调度，从而减少内涝的产生。|
+|管线管理|将管线的生产、安装、拓扑信息，以及历史状态信息有机组织起来，可以帮助我们对管线进行全周期管理，包括故障排查、寿命评估等。|
+|人群疏散|大量人群需要疏散时，需要考虑公交、地铁、出租车、共享单车等多种交通方式，同时还需要考虑道路承载量。使用图数据库将这些信息有机整合在一起，可以帮助我们更好的做出决策，以便为大型公共活动提供更好的支持。|
+
+## 4. 社会治理
+
+社会治理包括公共安全、法律事务、舆论、网络安全等多方面。社会治理是一个综合性的、多系统联动问题。它需要综合大量数据、全局考量才能做出更好的决策。在这种多维度复杂数据问题上，图数据模型可以提供更好的适应性，从而为智能化的社会治理决策平台提供坚实的基础。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|犯罪团伙发现|合谋团伙必然会通过某些方式产生联系，这种联系包括面谈（出现在同一地点）、电话联系、或者互联网联系，他们还可能有经济往来。如果我们将这些数据统一存放在一张图中，我们就可以通过图分析算法查找出联系紧密的群体，从而发现和识别整个犯罪团伙。|
+|涉众案件调查|涉众案件，特别是涉众经济案件往往涉及大量的人员和要素（货币、地点、事件等）。如何有效的组织这些资料，从而为办案提供证据支持是涉众案件调查的一个难点。使用图数据库来存储和分析这些资料，可以让我们快速定位资料、分析人员构成、为案件调查提供更好的技术支持。|
+|违法网站甄别|违法网站、钓鱼网站、黄色网站等往往通过使用不同的域名和IP来避免被封杀。基于黑名单的过滤方法只能封禁已知的违法网站，无法对新出现的域名和IP进行有效甄别。基于IP—域名网络的映射关系，我们可以建立一张图，然后通过图计算建立起域名和IP的“可信度”模型，利用该模型来判断网站是否属于违法网站。|
+|法院卷宗管理|卷宗往往错综复杂，不同的案件之间可能通过当事人产生联系，也可能通过案发地、案件性质、审判人员等产生联系。这些联系构成了一张复杂的网络。使用图数据库我们可以更方便的管理这些复杂关系，提高办案和查询效率。|
+
+## 5. 互联网
+
+人—人关系的社交网络、人—商品的购买关系都能构成图。通过分析这些网络数据，我们可以为用户提供更优质的服务，包括相关推荐、用户信息归集、重要用户识别、垃圾用户识别等。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|ID映射|图数据库可以将用户相关的所有信息，包括用户之间的关系统一存储在一个数据库中，同时还能通过这些关系来找出疑似单人多号和多人一号的情况，从而为后期的风控、推荐等业务提供决策支持。|
+|好友推荐|基于分析社交网络，我们可以提供“好友的好友”，“共同好友”等好友推荐。|
+|商品推荐|基于用户—商品关系图，我们可以找出兴趣爱好类似的用户，向他们推荐类似用户选择的其他商品。|
+|垃圾用户识别|传统的垃圾用户识别主要基于用户账号本身的信息，如注册信息、发帖信息等，但是这些信息都比较容易伪造。而基于网络的信息则不存在这个问题：它们很难被伪造。因此基于网络信息的垃圾用户识别可以更加精准和高效。|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/8.glossary.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/8.glossary.md
new file mode 100644
index 0000000000..5171d5ece8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/8.glossary.md
@@ -0,0 +1,38 @@
+# 名词解释
+
+## 1.图技术
+
+> __图计算__：广义图计算，技术上包括图查询、图分析、图学习；狭义图计算，包括图计算任务和图分析。
+
+> __图查询__：指图数据库的查询能力，通常通过Cypher/ISO GQL等查询语言实现。
+
+> __图分析__：侧重于对全图数据的算法分析、模式分析等。
+
+> __图学习__：与图神经网络、图机器学习含义相同。
+
+> __图智能__：等于广义图计算，包括图数据库、图分析、图学习，通常用于概念推广，不用于产品。
+
+## 2.图产品
+
+> __图计算系统__：一般包括图数据库、图分析系统、图学习系统，有时也特指图分析系统。
+
+> __图数据库__：侧重于对图数据的增删改查、事务性操作等，如TuGraph DB、Neo4j、JanusGraph等。
+
+> __图分析系统__：解决图分析问题，可以细分为流水图分析、离线图分析，如TuGraph Analytics、GraphX等。
+
+> __图学习系统__：解决图学习问题，比如TuGraph Learn、DGL等。
+
+## 3.具体概念
+
+
+> __Vertex__：点，也叫顶点，也指 Vertex Value。尽量避免Node（结点、节点）的叫法，一般用Node表示服务器个数，容易叫混。结点指结合、交结、交叉的意思；节点可以指一个时间线上的里程碑（关键节点）或计算机系统里的一个处理实体（如计算机网络里的一台服务器）。
+
+> __Edge__：边，也指 Edge Value。
+
+> __Vertex Label__：点类型，也叫 Vertex Type。
+
+> __Edge Label__：边类型，也叫 Edge Type。
+
+> __Degree__：度，入度/出度，表示一个点的入边、出边的条数。注意，在非图论的场景中，往往把“跳”也称作“度”。
+
+> __Hop__：跳，表示一个点到另一个点之间的路径经过的点数（不含起点、含终点）。算法性能测试里K-Hop即为此义。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/index.rst
new file mode 100644
index 0000000000..3346808f92
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/2.introduction/index.rst
@@ -0,0 +1,16 @@
+TuGraph入门
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.characteristics/index.rst
+   5.architecture
+   6.functionality
+   7.scenarios
+   8.glossary
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..186f7213aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/1.preparation.md
@@ -0,0 +1,83 @@
+# 快速上手
+
+> 此文档主要用于新用户快速上手，其中包含了 TuGraph 的简介、特征、安装和使用。
+
+## 1.简介
+
+TuGraph 是蚂蚁集团自主研发的大规模图计算系统，提供图数据库引擎和图分析引擎。其主要特点是大数据量存储和计算，高吞吐率，以及灵活的 API，同时支持高效的在线事务处理（OLTP）和在线分析处理（OLAP）。 LightGraph、GeaGraph 是 TuGraph 的曾用名。
+
+主要功能特征包括：
+
+- 标签属性图模型
+- 支持多图
+- 完善的 ACID 事务处理
+- 内置 34 图分析算法
+- 基于 web 客户端的图可视化工具
+- 支持 RESTful API 和 RPC
+- OpenCypher 图查询语言
+- 基于 C++/Python/Java 的存储过程
+- 适用于高效图算法开发的 Traversal API
+
+性能及可扩展性特征包括：
+
+- TB 级大容量
+- 千万点/秒的高吞吐率
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线备份
+
+
+### 1.1.支持的平台
+
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的的平台。
+
+### 1.2.硬件要求
+
+_目前我们建议用户使用 NVMe SSD 配合较大的内存配置以获取最佳性能。_
+
+| 硬件   | 最低配置      | 建议配置                     |
+|------|-----------|--------------------------|
+| CPU  | X86_64    | Xeon E5 2670 v4          |
+| 内存   | 4GB       | 256GB                    |
+| 硬盘   | 100GB     | 1TB NVMe SSD             |
+| 操作系统 | Linux 2.6 | Ubuntu 18.04, CentOS 7.3 |
+
+## 2.安装
+
+TuGraph 可以通过 Docker Image 快速安装，或者通过 rpm/deb 包本地安装。另外TuGraph在阿里云计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。
+
+> 安装包/镜像下载：[下载地址](../1.guide.md#TuGraph最新版本 )。
+
+> 计算巢部署：可以在阿里云计算巢自行搜索，也可以通过[部署链接]( ../5.developer-manual/1.installation/5.cloud-deployment.md )快速访问。
+
+### 2.1.通过docker快速体验
+
+1. 本地安装 docker 环境
+
+   参考 docker 官方文档：https://docs.docker.com/get-started/
+
+2. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. 启动docker
+   ```shell
+   docker run -d -p 7070:7070 -p 9090:9090 --name tugraph_demo tugraph/tugraph-runtime-centos7 lgraph_server
+   # 7070是默认的http端口，web访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   ```
+
+4. web 访问
+
+   `http://x.x.x.x:7070`
+
+   > 默认用户名为 `admin`，密码为 `73@TuGraph`
+
+5. 手动启动方式
+   ```shell
+   docker run -dt -p 7070:7070 --name tugraph_demo tugraph/tugraph-runtime-centos7
+   docker exec -it tugraph_demo bash
+   # 进入docker环境后执行如下命令启动服务
+   lgraph_server -d start
+   ```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..b8dd8d03ec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# 影视场景Demo
+
+> 此文档主要介绍 影视场景Demo 的使用方法。
+
+## 1.建模和数据导入
+
+完成登录后，点击`新建图项目`，选择movie数据，填写图项目配置，系统会自动完成Movie场景图项目创建。或者直接使用产品自带的movie图项目（带有官方图标）。
+
+Movie 场景图：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| 标签          | 类型  | 说明                                  |
+|-------------|-----|-------------------------------------|
+| movie       | 实体  | 表示某一部具体的影片，比如"阿甘正传"。                |
+| person      | 实体  | 表示个人，对影片来说可能是演员、导演，或编剧。             |
+| genre       | 实体  | 表示影片的类型，比如剧情片、恐怖片。                  |
+| keyword     | 实体  | 表示与影片相关的一些关键字，比如"拯救世界"、"虚拟现实"、"地铁"。 |
+| user        | 实体  | 表示观影的用户。                            |
+| produce     | 关系  | 表示影片的出品人关系。                         |
+| acted_in    | 关系  | 表示演员出演了哪些影片。                        |
+| direct      | 关系  | 表示影片的导演是谁。                          |
+| write       | 关系  | 表示影片的编剧关系。                          |
+| has_genre   | 关系  | 表示影片的类型分类。                          |
+| has_keyword | 关系  | 表示影片的一些关键字，即更细分类的标签。                |
+| rate        | 关系  | 表示用户对影片的打分。                         |
+
+## 2.查询示例
+
+### 2.1.示例一
+
+查询影片 'Forrest Gump' 的所有演员，返回影片和演员构成的子图。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.示例二
+
+查询影片 'Forrest Gump' 的所有演员，列出演员在影片中扮演的角色。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.示例三
+
+查询 Michael 所有评分低于 3 分的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.示例四
+
+查询和 Michael 有相同讨厌的影片的用户，讨厌标准为评分小于三分。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.示例五
+
+给 Michael 推荐影片，方法为先找出和 Michael 讨厌同样影片的用户，再筛选出这部分用户喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.示例六
+
+查询 Michael 的好友们喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.示例七
+
+通过查询给'Forrest Gump'打高分的人也喜欢哪些影片，给喜欢'Forrest Gump'的用户推荐类似的影片。
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..c39e48f40d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,62 @@
+# 场景：流浪地球
+
+> 此文档主要介绍 流浪地球 demo的使用方法。
+
+## 1.Demo场景设计
+
+Demo背景基于流浪地球1、流浪地球2的故事背景进行设计
+
+- 基于剧情，设计了图结构，包含组织、角色、天体与设施3类点，事件、关系两类边
+- 根据剧情准备了对应Schema的数据
+- 准备了一些query，提出一些关于剧情的问题
+
+## 2.目录结构
+
+- rawdata: 原始剧情数据和schema定义文件
+- case.cypher: 查询相关的Cypher语句
+- control.sh: 控制TuGraph Server启动停止的脚本
+- lgraph_standalone.json: TuGraph Server启动的配置文件
+
+## 3.使用说明
+
+前置条件：TuGraph已安装
+
+## 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择流浪地球数据，填写图项目配置，系统会自动完成流浪地球场景图项目创建。
+    - 或者直接使用产品自带的流浪地球图项目（带有官方图标）。
+
+## 5.Cypher查询
+
+参考cypher文档，在TuGraph的Web页面前端输入Cypher进行查询
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.查询展示
+查询木星危机的所有事件经过
+
+```
+MATCH (n)-[e:事件关系]-(m) where e.title='木星危机' RETURN n,e
+```
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+查询所以危机的相关事件经过
+
+```cypher
+MATCH (n)-[e1]-(m)-[e2]-(p)
+where e1.title REGEXP ".*危机" and e2.title REGEXP ".*危机" and e1.title <> e2.title
+RETURN n,e1,e2,p
+```
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..13d98b4db8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# 场景：三体
+
+> 此文档主要介绍 三体 demo的使用方法。
+
+## 1.Demo场景设计
+Demo背景基于三体1、三体2、三体3的故事背景进行设计。
+
+根据三体故事的设定，我们设计了4类点和6类边，点包括“人物”、“组织”、“计划”、“时间线”，边包括“人物-人物关系”、“人物-计划关系”、“人物-组织关系”、“组织-计划关系”、“组织-组织关系”。
+根据剧情准备了对应Schema的数据，准备了一些query，提出一些关于剧情的问题。
+
+## 2.目录结构
+rawdata: 原始剧情数据和schema定义文件。
+case.cypher: 查询相关的Cypher语句。
+control.sh: 控制TuGraph Server启动停止的脚本。
+lgraph_standalone.json: TuGraph Server启动的配置文件。
+
+## 3.使用说明
+
+前置条件：TuGraph已安装。
+
+### 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三体数据，填写图项目配置，系统会自动完成三体场景图项目创建。
+    - 或者直接使用产品自带的三体图项目（带有官方图标）。
+
+### 5.Cypher查询
+
+参考TuGraph文档，在TuGraph的Web页面前端输入Cypher进行查询。
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![data](../../../../images/three-body-data.png)
+
+### 7.查询展示
+
+#### 7.1.人物关系查询
+三体一剧情中，一开始全世界各地发生了大量科学家自杀事件，引起了警方重视，查案过程根据人物关系线索一步步排查，就如上面的图所示，随着线索越来越多，背后的真相逐步浮出水面。史强和汪淼发现大多数人都和叶文洁有着直接或者间接的联系，并派汪淼卧底，最终发现叶文洁的最终统帅身份。在图中也可以看出，叶文洁顶点周围有很多边关系（一度或二度邻居很多）。
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.邻域顶点分析
+三体中的各种计划比较多，有的时候可能会被绕晕，这时候我们可以通过图的邻居顶点查询来查看该计划的相关人物和组织等。如"面壁计划"中,我们可以看到有四位人物与之相关，这四位也是被世人所寄予厚望的“面壁者”。
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.查询a节点和b节点的共同邻居
+我们往往希望知道两个人物之间的共同关联的人物都有谁，这样就能很快的掌握这两个人物之间的关系，在大数据量的情况下，使用cypher进行图关系分析就很方便！
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.设置/更改属性
+随着剧情推进，我们逐步了解了"叶文洁"身上的多个标签，那么我们也可以将这些标签更新至“叶文洁”节点上：
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.增加/删除节点
+后续我们了解到了罗辑、程心等等人物和PIA、星环集团等组织，希望把这些作为节点添加至图中：
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..3252a13eb5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# 场景：三国
+
+> 此文档主要介绍 三国 demo的使用方法。
+
+## 1. 简介
+由于史料的缺失，一些即使为人们熟知的历史事件也往往存在着很多未解之谜。以三国历史为例，诸葛亮为什么出山帮助当时势力弱小的刘备，同为天下英雄的曹操和刘备为什么成就差距巨大等等。以往学者往往采用二维关系分析历史，这样得出的结论往往比较片面。使用TuGraph将三国的历史人物和事件导入图模型中，使用图计算方式进行分析，能够帮助我们从有限的信息中获得更有价值的知识，是一种非常有意义的跨学科尝试。
+## 2. 数据建模
+我们设计了5类顶点和5类边，点包括“主公”，“州”，“文臣”，“武将”，“战役”，边包括“父亲”，“兄长”，“隶属”，“籍贯”，“参战”。其具体建模信息如下所示：
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. 数据导入
+- 手动导入
+    - 向TuGraph导入数据，既可以使用TuGraph的`lgraph_import`工具离线导入。lgraph_import导入命令如下所示
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- 自动创建
+    - 点击`新建图项目`，选择三国数据，填写图项目配置，系统会自动完成三国场景图项目创建。
+    - 或者直接使用产品自带的三国图项目（带有官方图标）。
+## 4. Cypher分析
+### 4.1. 诸葛亮为什么选择刘备
+通过如下cypher命令可以查看诸葛亮和曹操、刘备之间的关系
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+从图中可以很直观的看出，曹操和诸葛亮之间的最短路径之一包含徐州之战，曹操曾经因父亲被杀对徐州进行过屠城，而诸葛亮是徐州琅琊郡人，任何人都断然不会选择一个屠杀过自己家乡的军阀作为主公。而相反，刘备曾经在徐州之战中阻止过曹操的暴行，这应当是诸葛亮对刘备好感的原因之一。
+
+### 4.2. 曹操为什么成就比刘备高
+通过如下cypher命令可以查看家族对曹操创业的助力
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+平定天下最重要的就是军事人才，曹操其父本姓夏侯，过继于曹氏，曹氏和夏侯氏在谯县都属于地方大族，在曹操创业初期提供了夏侯惇，夏侯渊，曹仁，曹洪在内大量的军事人才。而刘备其父早丧，没有家族助力，年过50才凑齐了自己的五虎上将，而这时已经过了天下大乱争夺地盘的最佳时机，曹操已经天下九州居其六了。
+
+### 4.3. 三国中最强大的魏国为何最先灭亡
+通过如下cypher命令可以查看曹操集团的重要文官组成
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+曹魏事实上于249年灭亡于高平陵之变，立国29年，少于蜀汉（43年）和东吴（51年）。三国中实力最强大的魏国最先灭亡的原因就在于曹魏的文官制度（九品中正制）使得权力很容易集中在世家大族手中。从图中可以看出，曹操曹丕父子两代的重要文臣几乎都是世家大族，颍川荀氏，颍川钟氏，颍川陈氏，武威贾氏等，甚至还出现了地区化趋势，集中于颍川，最终政权也为和颍川荀氏关系密切的河内司马氏所篡夺。
+
+### 4.4. 三国各自的实力究竟如何
+通过如下cypher命令可以查看三国各集团的人口实力
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+得到的查询结果如下表所示
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+古代社会衡量一个国家实力的重要指标是人口数量，由于人口数据缺失，我们使用三国所有主公和文臣武将的籍贯数据估计每个州的人口数量。发现三国主要人物中，按籍贯有60个属于魏国，有23个属于吴国，仅有2个属于蜀国，证明魏国确实是三国中最强大的国家。
+
+### 4.5. 曹操的军事能力如何评价
+通过如下cypher命令可以查看曹操参与的主要战役
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+从图中可以看出，曹操在三国主要的15场战役中参加了8场，出场率比较高。但是曹操只获胜了徐州之战、兖州之战、官渡之战和襄樊之战，汉中之战、宛城之战、群雄讨董和赤壁之战都失败了，综合胜率50%，证明曹操并不算一个非常优秀的军事家。
+
+## 5. 备注
+更多的分析有待大家积极补充和尝试！
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..4a29f62826
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo示例
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..e630bd12bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+快速上手
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..4b6ec8c40e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,659 @@
+# 可视化操作手册
+
+> 此文档主要介绍 TuGraph Browser 的使用和操作方法。
+
+## 1.简介
+
+TuGraph Browser（以下简称Browser）是一款功能强大的产品可视化开发工具，它以直观的可视化方式呈现图数据，使用户可以轻松地管理、维护和查看数据库运行状态。此工具不仅支持图数据的管理和可视化，还支持对系统账户的管理，为用户提供了全面的操作和管理体验，让用户能够更加高效地管理和利用图数据库。
+
+## 2.操作指南
+
+### 2.1.访问
+
+当用户完成图数据库的安装后，可以通过浏览器访问Browser。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 8888。
+
+- 例如：127.0.0.1:8888
+- 推荐使用Chrome
+
+### 2.2.登录
+
+![login](../../../images/browser/login.png)
+
+- 浏览器成功访问Browser后，首先进入的是登录页面（如上图所示），用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 2.3.快速上手
+
+对于首次使用TuGraph的用户，可以通过产品内置的demo数据快速构建一个图项目，快速上手图数据项目。
+
+#### 2.3.1.创建图项目
+
+在`图项目`首页的选项卡中，点击`新建图项目`创建新的图项目。
+
+![快速上手-新建图项目](../../../images/browser/quickstart-creategraph.png)
+
+选择一个产品内置的demo数据，点击`下一步`按钮。
+
+![快速上手-选择一个demo](../../../images/browser/quickstart-selectdemo.png)
+
+在`填写配置`界面输入图项目信息，demo数据量都相对较小，`最大存储空间`设置为1G即可。输入完图项目信息后，点击`创建`按钮后，系统会自动创建demo数据的图模型、导入图数据。
+
+![快速上手-填写配置](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.开始图项目
+
+demo数据的图项目创建完成后，可以在`图项目`的选项卡中找到相应的图项目，可以点击`图查询`查询图数据。
+
+![快速上手-图项目选项卡](../../../images/browser/quickstart-graphtab.png)
+
+执行默认的查询语句，浏览demo里的图数据。
+
+![快速上手-验证结果](../../../images/browser/quickstart-result.png)
+
+更多快速上手文档请浏览[快速上手文档](../3.quick-start/1.preparation.md)
+
+### 2.4.图项目
+
+`图项目`提供可视化的图项目管理和图数据研发功能，它为用户提供了一系列便捷的图数据可视化操作，包括图项目的创建、修改、删除等管理操作，以及图数据的查询、点边统计等操作。此外，它也支持图模型的管理，使用户可以更加方便地进行图数据的管理和维护。
+
+#### 2.4.1.图项目管理
+
+在`图项目`界面，可以看到当前图数据库中的图项目。
+
+![图项目-首页](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.新建图项目
+
+在`图项目`界面，点击`新建图项目`按钮创建一个新的图项目。
+
+![图项目-新建图项目按钮](../../../images/browser/graphmanagement-creategraph.png)
+
+新建图项目需要通过`选择模板`和`填写配置`两个页面完成图项目的创建。
+
+- __选择模板__：产品提供空模板和demo模板两类模板。
+    - 空模板：全新的图项目，用户需要自己创建图模型和导入图数据，一般用于正式项目开发。
+    - demo模板：产品内置的demo数据，图项目创建成功后，系统会自动创建demo图模型并导入demo图数据，一般用于试用和学习。
+
+![图项目-选择模板](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __填写配置__：用户需要填写图项目基本信息，并点击`创建`按钮创建图项目。
+    - 图名称：新建图项目的名称，同时作为该图项目的唯一主键。支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+    - 图描述：新建图项目的描述，可用于详细说明该项目的背景和目标。
+    - 高级配置-最大存储空间：设置图项目最大可占用的存储空间，实际并不会提前占用物理存储空间，实际数据量达到最大存储空间阈值后不可再写入数据。
+
+![图项目-填写配置](../../../images/browser/graphmanagement-configure.png)
+
+创建成功后，可在`图项目`页面的图项目选项卡中查看。
+
+##### 2.4.1.2.编辑图项目
+
+在`图项目`界面，点击图项目选项卡中的`编辑`按钮（笔形图标），编辑对应图项目的基础信息。
+
+![图项目-编辑图项目按钮](../../../images/browser/graphmanagement-editgraph-button.png)
+
+编辑图项目功能可以修改`图名称`和`图描述`。
+
+![图项目-编辑图项目](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.删除图项目
+
+在`图项目`界面，点击图项目选项卡中的`删除`按钮（垃圾桶图标），删除对应的图项目。
+
+![图项目-删除图项目按钮](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_需要注意：图项目删除后无法恢复_。
+
+##### 2.4.1.4.点边统计
+
+在`图项目`界面，点击图项目选项卡中的`点边统计`按钮（折线图标或刷新图标），统计对应图项目的点边数量。
+
+![图项目-点边统计按钮](../../../images/browser/graphmanagement-statistics-button.png)
+
+统计结果将展示展示图项目选项卡上，未进行过点边统计的图项目会显示`暂无点边数据`，已经统计过点边数据的图项目再次统计需要点击`刷新`按钮。
+
+![图项目-点边统计](../../../images/browser/graphmanagement-statistics.png)
+
+![图项目-刷新点边统计按钮](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.图构建
+
+Browser的`图构建`功能主要用于图项目的模型定义和数据导入。在`图项目`页面中，点击图项目选项卡中的`图构建`按钮。
+
+![图构建-按钮](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.模型定义
+
+Browser提供可视化的方式创建和维护图模型。
+
+- 也可用通过`cypher`工具和`lgraph_import`工具创建和维护图模型，详见[Cypher API](../5.developer-manual/6.interface/1.query/1.cypher.md)和[数据导入](../5.developer-manual/3.server-tools/1.data-import.md)文档。
+
+###### a.浏览图模型
+
+在`模型定义`界面可以查看详细的图模型设置，支持列表和画布方式查看图模型，支持列表展示点类型的属性和索引、边类型的属性和起点/终点类型。
+
+![图构建-浏览图模型](../../../images/browser/graphbuild.png)
+
+- 支持列表查看点类型和边类型。
+    - 支持点类型和边类型的个数展示，在点类型或边类型页签中展示对应的点或边数量。
+    - 支持点类型和边类型的名称关键字搜索，在`搜索框`输入关键字可展示对应的点或边。
+
+        ![图构建-浏览图模型-搜索](../../../images/browser/graphbuild-list-search.png)
+    - 支持点类型和边类型的名称复制，点击`复制`按钮可以复制点或边的名称至粘贴板。
+
+        ![图构建-浏览图模型-复制](../../../images/browser/graphbuild-list-copy.png)
+    - 支持点类型和边类型的删除，点击`删除`按钮可以删除对应的点或边。
+
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-list-delete.png)
+- 支持画布方式查看点类型和边类型。
+- 在列表或画布中点击相应的点类型或边类型，可以展示模型详情。
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-select.png)
+
+###### b.添加点
+
+在`模型定义`界面点击`添加点`按钮，在右侧滑动窗口中添加点类型。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex-button.png)
+
+用户需要输入点类型名称、属性和索引，点击`完成`按钮完成点类型的创建。
+- 点类型名称：点的名称，也是该点的唯一标识。
+- 属性：点的属性，需要一个属性作为主键。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建点时可以任意删除属性。
+- 索引：点的索引属性，需要先创建属性再设置该属性为索引，索引创建成功后无法修改。
+    - 属性：需要配置索引的属性。
+    - 唯一：设置该属性字段为唯一值。
+    - 主键：对应属性是否为主键，选择`是`后`唯一`选项必须为`是`。
+    - 删除：在创建点时可以任意删除索引。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex.png)
+
+- 编辑点：可以增加点的属性和修改已有属性的数据类型，新增或删除索引。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+_注：主键字段的属性创建后无修改_
+
+![图构建-编辑点](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.添加边
+
+在`模型定义`界面点击`添加边`按钮，在右侧滑动窗口中添加边类型。
+
+![图构建-添加边按钮](../../../images/browser/graphbuild-addedge-button.png)
+
+用户需要输入边类型名称、属性、选择起点类型和终点类型，点击`完成`按钮完成边类型的创建。
+- 边类型名称：边的名称，也是该边的唯一标识。
+- 属性：边的属性，边上可以没有属性。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建边时可以任意删除属性。
+- 选择起点类型和终点类型：设置边的起点点类型和终点点类型，支持多个起点类型和终点类型。
+    - 起点：选择起点的点类型。
+    - 终点：选择终点的点类型。
+    - 需要提前创建至少一个点类型才能设置边的起点类型和终点。
+    - 如果不选择则表示起点和终点可以为任意点类型，同时画布上不展示对应的边，需要在左侧列表查看边类型。
+
+![图构建-添加边](../../../images/browser/graphbuild-addedge.png)
+
+- 编辑边：可以增加边的属性和修改已有属性的数据类型。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+
+![图构建-编辑边](../../../images/browser/graphbuild-editedge.png)
+
+###### d.导入模型
+
+在`模型定义`界面点击`导入模型`按钮，可以上传模型文件快速创建模型。
+
+![图构建-导入模型按钮](../../../images/browser/graphbuild-importmodel-button.png)
+
+在`导入模型`界面点击`上传文件`按钮，上传模型文件成功后，点击确定可以导入图模型。
+
+- 覆盖当前画布中的模型：选中该选项，导入时会先清空已有图模型再导入模型文件中的图模型；不选择，会导入模型文件中新增的点类型和边类型，但不会修改已有的点类型和边类型。
+
+![图构建-导入模型](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.导出模型
+
+在`模型定义`界面点击`导出模型`按钮，可以将当前图项目中的图模型导出成json文件。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel-button.png)
+
+模型文件为json格式，不建议手动修改。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.数据导入
+
+完成`模型定义`之后，点击`下一步`按钮进入数据导入页面。
+
+###### a.数据准备
+
+在数据导入前需要提前准备数据，当前Browser支持CSV文件的上传，需要保证数据文件后缀为csv。
+- 不强制要求包含表头。
+- 支持文本限定符，文本限定符为双引号。
+
+![数据导入-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.上传文件
+
+在`数据导入`页面上传需要导入的数据文件，将数据导入到图项目中。
+
+![数据导入-上传文件](../../../images/browser/graphbuild-import.png)
+
+- 分隔符：数据文件的列分隔符。
+- 文件上传：支持上传多个文件。
+    - 支持弹窗中选择多个上传文件。
+    - 支持将文件拖拽至页面中上传。
+    - 支持同时上传点文件和边文件。
+
+###### c.数据映射
+
+文件上传成功后，需要在`数据导入`页面设置`数据对应表`，将数据文件中的数据列和目标点/边、对应属性建立映射关系。
+
+- 数据对应表：展示已经上传的数据问题。
+    - 文件名称：上传的数据文件名称。
+    - 文件大小：上传的数据文件大小。
+    - 读取结果：数据文件上传结果，success为读取成功。
+    - 删除：在页面中删除，不会删除本地文件。
+- 数据文件映射：每个已上传的数据文件都需要配置映射关系。
+    - 标签：选择该文件对应的点或边类型，只能选择一类点或一类边。
+    - 从第N行，开始：从第N行开始读取数据，系统默认从第0行开始读取数据，如需跳过表头可输入1。
+    - 属性映射：下拉选择数据列对应的属性字段。
+    - 数据预览：系统会预读数据文件的前5行。
+
+![数据导入-数据映射](../../../images/browser/graphbuild-import-datamapping.png)
+
+文件上传成功后，可以点击`继续导入`按钮继续导入其他数据，或者点击`前往图查询`按钮在`图查询`页面查询已导入的数据。
+
+![数据导入-导入成功](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.图查询
+
+在`图项目`界面点击图项目选项卡中的`图查询`按钮，可以查询和访问图项目中的图数据，产品提供`语句查询`、`路径查询`、`点查询`等多种模式查询图数据，支持切换图项目和查询结果展示。
+
+![图查询-按钮](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.切换图项目
+
+`图查询`功能只能访问一个图项目数据，用户可以在`切换图项目`下拉框中选择并切换至其他图数据。
+
+![图查询-切换图项目](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.语句查询
+
+Browser提供可视化方式开发和调试图查询语句，用户可以输入图查询语句、执行并返回结果，支持收藏语句和查看图模型。
+
+![图查询-语句查询](../../../images/browser/query-view.png)
+
+###### a.语句查询窗口
+
+用户在`语句查询窗口`输入图查询语句，点击`执行`按钮可以运行对应语句，并在`执行结果页签`展示结果。
+
+- 切换查询语言：提供不同图查询语言模式的切换。_当前只支持Cypher语法_
+
+![图查询-切换语言](../../../images/browser/query-selectgql.png)
+
+- 语句查询窗口：提供当前查询语言的语法提示。
+
+![图查询-语法提示](../../../images/browser/query-gqltips.png)
+
+- 执行：点击`执行`按钮，发送输入的查询语句至后台运行。
+
+![图查询-执行按钮](../../../images/browser/query-execute-button.png)
+
+- 收藏：点击`收藏`按钮，将当前语句查询窗口的内容保存成模板，以便下次使用。
+
+![图查询-收藏按钮](../../../images/browser/query-bookmark-button.png)
+
+- 下载：点击`下载`按钮，将当前语句查询窗口的内容保存成文本文件并下载至本地，以便下次使用。
+
+![图查询-下载按钮](../../../images/browser/query-download-button.png)
+
+详细Cypher使用指南请参考文档：[Cypher API](../5.developer-manual/6.interface/1.query/1.cypher.md)
+
+###### b.收藏列表
+
+以列表方式展示已经收藏的查询语句，点击列表中的收藏模板可以使用其中的语句。支持关键字搜索、名称修改以及删除。
+
+![图查询-语句收藏](../../../images/browser/query-bookmark.png)
+
+###### c.查看图模型
+
+Browser提供当前图项目中的图模型查询，方便用户查询有些点类型和边类型，支持列表展示和画布图谱展示方式，支持隐藏查看图模型窗口。
+
+![图查询-图模型列表](../../../images/browser/query-schema-list.png)
+![图查询-图模型图谱](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.路径查询
+
+Browser提供`路径查询`模板，用户可以通过选择路径的方式，查找图项目中的图数据是否存在相应的路径。
+
+![路径查询](../../../images/browser/pathquery-result.png)
+
+- 路径：在路径选择下拉框内选择需要查找的路径。
+    - 选择路径：根据图模型的定义，系统会自动匹配出对应的一度关系路径；再次点击路径下拉框会，系统会根据路径终点的点类型自动匹配下一度关系路径。
+![路径查询-选择路径](../../../images/browser/pathquery-select.png)
+    - 执行：点击`执行`按钮返回图项目中匹配的路径。
+    - 高级配置：设置扫描的路径数目，默认为100条路径。
+![路径查询-高级配置](../../../images/browser/pathquery-configuration.png)
+
+_注：需要图模型中的边设置起点和终点，如果图项目中的边均未设置起点和终点，下拉选项无结果_
+
+##### 2.4.3.4.点查询
+
+Browser提供`点查询`模板，用户可以通过选择点属性进行查询，查找图项目中的点数据。
+
+![点查询](../../../images/browser/vertexquery.png)
+
+- 选择点：选择需要查询的点类型。
+    - 属性：系统会自动匹配点类型的schema，设置相应的查询条件，点击执行按钮返回结果。
+- 返回节点数目：设置返回点数据的上限。
+
+![点查询-条件](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.执行结果页签
+
+Browser提供JSON视图、JSON文本、点边列表、点边视图等多种方式展示图查询结果，支持结果下载、插入数据、全屏展示。
+
+###### a.JSON视图
+
+Browser提供以JSON视图方式展示查询结果。
+
+![JSON视图](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON文本
+
+![JSON文本](../../../images/browser/query-result-jsontxt.png)
+
+###### c.点边列表
+
+Browser提供以点和边列表方式展示查询结果。
+
+![点边列表](../../../images/browser/query-result-list.png)
+
+###### d.点边视图
+
+Browser提供以画布方式展示查询结果。
+
+![点边视图](../../../images/browser/query-result-graph.png)
+
+###### e.插入数据
+
+Browser提供可视化方式在对应图项目中插入点或边数据。点击`插入数据`按钮，在`插入数据`页签选择点类型或边类型，输入属性值，点击确定完成数据插入。
+
+![插入数据-按钮](../../../images/browser/query-result-insert-button.png)
+
+![插入数据](../../../images/browser/query-result-insert.png)
+
+###### f.下载执行结果
+
+Browser提供图查询结果导出成文本文件功能。点击`下载执行结果`按钮，系统会自动将结果保存成文本文件并下载至本地。
+
+![下载执行结果-按钮](../../../images/browser/query-result-download.png)
+![下载执行结果-按钮](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.全屏展示
+
+Browser提供全屏方式展示图查询结果，点击`全屏显示`按钮全屏展示结果，点击`退出全屏`按钮退出全屏展示。
+
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-button.png)
+![全屏展示](../../../images/browser/query-result-fullscreen.png)
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.图分析
+
+在`图项目`界面点击图项目选项卡中的`图分析`按钮，可以在画布中展示和分析图数据，产品提供`语句查询`和`配置查询`将图项目中的数据查询并加载至画布，支持画布数据的筛选、布局样式调整以及画布操作。
+
+![图分析-按钮](../../../images/browser/graphanalysis-button.png)
+
+如下图所示，图分析功能主要包括：1、操作栏：图分析主要操作功能，包括视图切换、查询过滤、布局样式以及画布操作；2、左边栏：查询、筛选、外观功能操作区域；3、画布区域：展示图数据的区域，展示点和边数据，支持点扩展查询、收起节点、固定节点、删除节点，提供画布图数据统计等功能；4：右边栏：选中一个点数据或边数据后，会展示对应的属性信息；5、切换图项目：切换不同的图项目进行分析。
+
+![图分析-操作区域](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.语句查询
+
+在`语句查询`功能中，用户可以输入查询语句来查询图数据，并加载数据至画布区域进行展示。
+- 语法说明：TuGraph的查询语言及语法说明文档。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-语句查询](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.模板查询
+
+在`模板查询`功能中，用户可以选择节点类型和输入属性条件来查询图数据，并加载数据至画布区域进行展示。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-模板查询](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.画布分析
+
+在`画布分析`功能中，用户可以对画布中的节点或边数据进行操作和分析，主要包括：选中节点进行扩展查询、收起/展开节点、固定节点，清空画布，套索，点/边检索，画布图例等。画布上的最基础操作是拖拽点数据，鼠标左键选住一个节点并移动鼠标，可以完成点数据位置的移动。
+
+###### a.扩展查询
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，鼠标移至`扩展查询`处弹出二级悬窗，点击对应的扩展度数进行查询。
+- 一度查询：双向扩展一度关系。
+- 二度查询：双向扩展二度关系。
+- 三度查询：双向扩展三度关系。
+- 自定义查询：根据选择的条件进行扩展。
+    -边的方向：设置扩展关系的方向，双向：包含出边和入边，出边：选中起点向外指向的边，入边：指向选中起点的边。
+    -扩散度数：扩展的度数。
+    -自定义返回节点数量：配置返回至前端的节点数量，默认为100，防止遇到超级节点导致前端异常的情况。
+    -添加筛选组：设置扩展的关系类型和关系的属性条件，可以设置多组关系类型。
+
+![图分析-画布分析-扩展查询-按钮](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![图分析-画布分析-扩展查询-查询后](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![图分析-画布分析-扩展查询-自定义查询](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.收起/展开节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`收起节点`会隐藏所选节点的一度关系节点；再次右键已`收起节点`的点数据可以进行`展开节点`操作，展示已隐藏的一度关系节点。
+
+![图分析-画布分析-收起节点](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![图分析-画布分析-展开节点](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.固定节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`固定节点`会将所选节点固定在原处，固定后的节点不可移动（包括重新布局）；再次右键已`固定节点`的点数据可以进行`解除固定`操作，恢复所选节点的正常操作。
+
+![图分析-画布分析-固定节点](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![图分析-画布分析-解除固定](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.删除节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`删除节点`会将所选节点移出画布。
+
+![图分析-画布分析-删除节点](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.清空画布
+
+在`操作栏`区域点击`清空画布`按钮，会清除所有画布中的数据。
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.点/边检索
+
+在`点/边检索`窗口选择点或边，并输入关键字，会模糊检索画布中的属性数据，检索后可定位至数据位置。
+
+![图分析-画布分析-检索](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.画布图例
+
+在`画布`区域的图例位置，会展示画布中的点类型，点击点类型可以选中对应的点数据，点击更多按钮可以展示统计情况，支持列表或图表方式展示点或边的数量。
+
+![图分析-画布分析-列表](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![图分析-画布分析-图表](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.属性筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`属性筛选`进行筛选过滤。用户可以选择要筛选的点或边类型，以及对应的属性值进行设置，检索到筛选组条件的数据后会在画布上高亮选中对应的点或边数据。
+- 请选择点/边类型：选择需要检索的点类型或边类型。
+- 属性条件：设置需要检索的属性条件，可以设置多组，取并集筛选结果。
+- 添加筛选组：可以多组筛选条件，取并集筛选结果。
+- 重置：可以清空筛选条件。
+
+![图分析-筛选-属性筛选](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.统计筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`统计筛选`进行画布数据统计。用户可以选择要统计的点或边类型，以及对应的属性值进行设置，系统会自动根据用户选择的点/边类型和属性进行分组统计，支持按照图表和列表两种方式展示结果，同时点击图表或列表区域的数值可以高亮选中画布中的数据。
+
+![图分析-筛选-统计筛选](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![图分析-统计筛选-图表切换](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.布局样式
+
+在`操作栏`区域点击`布局`按钮，选择对应的布局方式会将画布中的数据进行重新排布，支持力导向布局、同心圆布局、圆形布局、辐射布局、Dagre布局以及网格布局，每种布局方式均有不同布局参数，调整参数后画布中的数据会进行重新排布。
+
+![图分析-布局样式-按钮](../../../images/browser/graphanalysis-style-layout-button.png)
+![图分析-布局样式-布局参数](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+详细布局参数可参考[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide)。
+
+##### 2.4.4.6.外观样式
+
+在`操作栏`区域点击`外观`按钮，在`左边栏`点击`点样式`或`边样式`进行外观样式配置。
+- 点样式
+    - 应用点类型：设置对应点类型的展示样式，支持同时配置多个点类型外观。
+    - 大小：对应点类型的展示大小。
+    - 颜色：对应点类型的展示颜色。
+    - 图标：对应点类型的图标样式。
+    - 显示文本：对应点类型显示的文本内容，默认为id。
+    - 高级配置：根据设置的条件标记对应的点数据。
+- 边样式
+    - 应用边类型：设置对应边类型的展示样式，支持同时配置多个边类型外观。
+    - 颜色：对应点类型的展示颜色。
+    - 边宽：对应边类型的展示宽度。
+    - 显示文本：对应边类型显示的文本内容，默认不显示。
+    - 高级配置：根据设置的条件按颜色展示对应的边数据。
+
+![图分析-外观](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.控制台
+
+`控制台`提供可视化的的账户管理和数据库信息查看功能，它为用户提供了全面的账户和角色管理功能，包括账户的增删改查以及禁用，角色的增删改查以及禁用。此外，它也为用户提供了便捷的数据库信息查看功能，让用户可以轻松地查看图数据库的基础信息和配置信息。其中，基础信息主要包括版本号、运行时间、CPP编译版本号等，而数据库配置信息则包括端口号、系统功能参数配置等。
+
+#### 2.5.1.账户管理
+
+##### 2.5.1.1.账户管理
+
+###### a.添加账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户需要输入账户名称、账户描述、账户密码以及相关角色。
+
+![账户管理-添加账户按钮](../../../images/browser/account-add-button.png)
+
+- 账户名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 相关角色：新建账户时必须要选择一个角色，在账户添加成功后，系统会自动生成一个与账户名称一样的角色。
+
+![账户管理-添加账户](../../../images/browser/account-add.png)
+
+###### b.编辑账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户可以编辑账户描述、账户密码以及相关角色。
+
+![账户管理-编辑账户](../../../images/browser/account-edit.png)
+
+###### c.禁用账户
+
+在`账户管理`界面点击`禁用`按钮禁止对应的账户登录和访问，点击`启用`按钮开启对应的账户登录和访问权限。
+
+![账户管理-禁用](../../../images/browser/account-disable.png)
+![账户管理-启用](../../../images/browser/account-enable.png)
+
+###### d.删除账户
+
+在`账户管理`界面点击`删除`按钮删除对应的账户。
+
+![账户管理-删除](../../../images/browser/account-delete.png)
+
+##### 2.5.1.2.角色管理
+
+###### a.添加角色
+
+在`角色管理`界面点击`添加`按钮创建新的角色，用户需要输入角色名称、角色描述以及图权限。
+
+![角色管理-添加角色按钮](../../../images/browser/role-add-button.png)
+
+- 角色名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 图权限：browser支持全部、读、写和无共四类图权限配置。
+    - 全部：对应图的读和写权限，包含编辑图模型权限（schema）。
+    - 读写：对应图的写权限，不包含编辑图模型权限（schema）。
+    - 只读：对应图的读权限。
+    - 无：无法访问和操作对应图。
+- 角色冲突：当两个角色对同一个图有不同图权限，同时对一个账户授权了这两个角色，该账户对该图的图权限为两个角色的并集。
+
+![角色管理-添加角色](../../../images/browser/role-add.png)
+
+###### b.编辑角色
+
+在`角色管理`界面点击`编辑`按钮编辑已有角色，用户可以编辑角色描述以及图权限。
+
+![角色管理-编辑角色](../../../images/browser/role-edit.png)
+
+###### c.禁用角色
+
+在`角色管理`界面点击`禁用`按钮禁止对应的角色，点击`启用`按钮开启对应的角色。禁用角色后，对应角色图访问权限失效。
+
+- 禁用角色：禁用之后，对应角色图访问权限失效。
+    - 当一个用户拥有两个角色对同一个图有操作权限时，当禁用其中一个角色时，另一个角色权限同样有效。
+
+![角色管理-禁用](../../../images/browser/role-disable.png)
+![角色管理-启用](../../../images/browser/role-enable.png)
+
+###### d.删除角色
+
+在`角色管理`界面点击`删除`按钮删除对应的角色。
+
+![角色管理-删除](../../../images/browser/role-delete.png)
+
+#### 2.5.2.数据库信息
+
+##### 2.5.2.1.基础信息
+
+`基础信息`获取当前系统运行的状态，并展示关键信息。
+
+![数据库信息-基础信息](../../../images/browser/db_basic.png)
+
+|参数    |含义    |
+|-------|--------|
+|TuGraph版本号|当前TuGraph的版本号，x.x.x|
+|运行时间|TuGraph服务启动到现在的时间|
+|服务器代码版本|tugraph-db仓库的当前commit|
+|前端代码版本|tugraph-web仓库的当前commit|
+|CPP编译器版本号|编译TuGraph时的CPP版本号|
+|Python版本号|编译TuGraph时的Python版本号|
+|CPP编译器ID|编译TuGraph时的CPP类型|
+
+也可以通过命令获取当前系统运行状态。
+
+```
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.数据库配置信息
+
+`数据库配置信息`获取当前系统运行的配置参数，并展示关键信息。调整配置参数或了解详细配置参数请参考[数据库运行-服务配置](../5.developer-manual/2.running/2.tugraph-running.md)。
+
+![数据库信息-数据库配置信息](../../../images/browser/db_configuration.png)
+
+| 参数                          | 含义                                  |
+|-----------------------------|-------------------------------------|
+| bind_host                   | 系统启动时设置的host，一般为0.0.0.0             |
+| disable_auth                | 是否关闭token认证的定期更新，如为true则token可以永久使用 |
+| durable                     | 是否开启存储底层持久化，如为false，数据异步更新到磁盘       |
+| enable_audit_log            | 是否开启审计日志                            |
+| enable_backup_log           | 是否开启实时增量备份                          |
+| enable_fulltext_index       | 是否开启全文索引                            |
+| enable_ip_check             | 是否开启IP白名单                           |
+| enable_rpc                  | 是否开启RPC端口                           |
+| enable_ssl                  | 是否开启ssl加密传输                         |
+| optimistic_txn              | 是否开启乐观多线程写入事务                       |
+| port                        | 当前系统的REST访问端口                       |
+| rpc_port                    | RPC 及 HA 服务所用端口                     |
+| subprocess_max_idle_seconds | 自进程最大空闲时间，线程池参数                     |
+| thread_limit                | 服务端同时使用的最大线程数                       |
+| verbose                     | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。  |
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..2a422f569e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,167 @@
+# 可视化操作手册（旧版）
+
+> 此文档主要介绍 TuGraph Browser 的使用
+
+## 定义
+
+TuGraph Browser 是 TuGraph 提供的可视化开发工具。
+
+## 作用
+
+TuGraph Browser 的主要功能是为使用图数据库的开发人员，提供可视化的图数据开发，图数据管理和维护等功能。
+
+## 操作详情
+
+### 1.连接数据库
+
+当用户完成图数据库的安装后，可以通过浏览器进行访问，TuGraph Browser 工具。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7090。
+
+### 2.登录数据库
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- 页面打开成功会，首先进图的是登录页面，用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 3.工作台
+
+#### 3.1 快速上手
+
+- 首次登录，系统会默认创建 default 空图
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- 用户点击帮助选项，并选择快速上手
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- 然后点击“一键创建模型”——>"一键创建数据"，就可以完成内置的 Movie 数据图谱的构建
+
+#### 3.2 创建子图和示例
+
+##### 3.2.1 创建子图
+
+- 点击新建子图
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- 填写表单信息
+  ![alt 填写表单](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+  - 子图名称
+  - 子图描述
+  - 配置信息
+  - 点击确认，提示创建成功
+- 切换子图
+  ![alt 切换子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- 点击新建示例
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- 选择示例并点击创建
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 查询
+
+![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 页面组成
+
+- cypher 输入框
+- 结果集展示区域
+
+##### 3.3.2 结果集展示区域功能详情
+
+- 结果集标签展示及功能
+  ![alt 结果集标签](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+  - 这里展示了结果集的所有类型统计
+  - 点击不同的“label（标签）”，可以进行以下修改操作
+    - 修改展示颜色
+    - 修改节点大小或边的粗细
+    - 修改默认展示属性或系统属性
+    - 布局修改
+      - 力导布局
+      - 网格布局
+      - 树形布局
+      - 环境布局
+    - 边聚合
+      - 相同类型，方向的边可以进行合并
+    - 创建节点
+      - 点击创建节点按钮
+      - 选择节点类型
+      - 添写节点内容
+    - 创建关系
+      - 在画布中选择起点和终点
+      - 选择可以匹配的类型
+      - 填写节点信息
+    - 停止布局
+      - 当数据量过大，导致浏览器页面卡顿时候，可以点击这个停止布局的按钮，能够提高体验的流畅度
+    - 鼠标悬停
+      - 开启此功能，可以高亮显示鼠标悬停节点的一度邻居节点
+    - 结果集导出
+      - 可以将结果集导出为 png，json，csv 三种不同的文件形式
+    - 刷新
+      - 点击刷新按钮，会重新执行当前页面的初始 cypher 语句，并刷新结果集
+    - 最大化
+      - 点击最大化，结果集展示区域将全屏展示
+    - 结果集展示形式切换
+      - 支持图谱、表格、文本三种形式
+
+##### 3.3.3 建模
+
+- 点边模型
+  ![alt 建模](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- 点边模型支持实时的、增、删、改、查
+
+- 点边模型支持导入和导出
+
+##### 3.3.4 数据导入
+
+- 本地数据导入
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+  - 选择文件编码格式
+  - 选择本地 CSV 文件
+  - 选择对应的节点或边的模型
+  - 进行数据映射
+  - 完成数据导入
+
+##### 3.3.5 插件
+
+- 存储过程的使用
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+  - 用户可以上传本地编写的 Plugin 程序，并在可视化页面进行执行，并查看执行结果
+  - 用户可以在可视化对插件进行、卸载、执行、下载等操作
+
+##### 3.3.6 帮助
+
+- 其中记录了 TuGraph-browser 的使用方式
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 控制台
+
+##### 3.4.1 数据库基础信息
+
+- 展示数据库相关的基础配置信息
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 权限管理
+
+- 用来创建用户和角色的功能模块，用户可以在这里进行权限的管理操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 实时状态
+
+- 这里展示了数据库实时状态，包括：CPU 使用率、内存用率、磁盘使用率、数据请求次数、磁盘 IO
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 任务管理
+
+- 在这里用户可以看到在正在执行中的任务，可以在此进行停止任务的操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 审计日志
+
+- 这里记录的数据库相关的审计日志，用来排查使用遇到的问题
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..811fbf0563
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+可视化操作指南
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/1.environment.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/1.environment.md
new file mode 100644
index 0000000000..e2524b4134
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/1.environment.md
@@ -0,0 +1,40 @@
+# 环境准备
+
+> 此文档主要介绍 TuGraph 部署时所需的软硬件环境。
+
+## 1.硬件环境
+
+### 1.1. CPU
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的硬件平台，测试认证过的硬件平台包括 Intel、AMD、Kunpeng、Hygon、飞腾等。
+
+### 1.2. 内存
+
+我们建议内存容量不小于实际的数据大小。如果最求极致的性能，把所有的数据缓存到内存里是最理想的。在数据访问的局部性上，图数据库的局部性要比关系型数据库差，因此如果数据在内存中放不下，通常会频繁地换入换出。
+
+### 1.3. 外存
+我们强烈建议用户使用 NVMe SSD 作为外存，数据库有大量的写操作需要同步的外存，通常为随机写，外存的读写性能很容易成为整体数据库运行的性能瓶颈。因此，高IOPS、低延迟的 NVMe SSD 是最优的选择。
+
+如果现实条件只能使用 SATA接口的SSD，或者云上的网盘，性能虽然会受到影响，但 TuGraph 依然能正确的运行。
+
+外存大小建议为实际数据大小的4倍，比如数据为1TB，则准备4TB的硬盘会比较稳妥。
+
+## 2.软件环境
+
+### 2.1. 操作系统
+
+TuGraph 能够兼容主流操作系统，包括Ubuntu、CentOS、SUSE、银河麒麟、 中标麒麟、UOS等，均通过测试认证。
+
+其中最稳定使用的系统版本是 Ubuntu 18.04、CentOS 7、CentOS 8。
+
+### 2.2. 系统库
+
+编译环境和运行环境对系统库的要求不一样，具体请参考[环境分类](2.environment-mode.md)。
+
+## 3.典型配置推荐
+
+| 硬件      | 最低配置   | 建议配置                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| 内存      | 4GB       | 512GB                    |
+| 外存      | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md
new file mode 100644
index 0000000000..3dbbe91ee5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md
@@ -0,0 +1,22 @@
+# 环境分类
+
+> 此文档主要介绍 TuGraph 涉及的三种环境。
+
+## 1.分类
+
+根据环境所承载功能的不同，区分为编译环境，运行环境，以及精简运行环境。
+* 编译环境，具备TuGraph编译的所有依赖库，包含运行环境的所有依赖，并且能够编译TuGraph源码，但不包含预编译好的TuGraph可执行文件和库文件，供开发者编译源码使用。
+* 运行环境，具备GCC/Java/Python环境，能够运行TuGraph的所有功能，并且能承载全文索引，java client，c++源码上传为plugin，以及python plugin的完整功能，内置TuGraph预编译好的可执行文件和库文件，供客户直接安装使用，无需编译源码。
+* 精简运行环境，约等于裸系统加预编译TuGraph，仅能运行TuGraph的基本功能，无C++ plugin编译运行，仅so上传，无全文索引，无python plugin，供快速搭建试用。
+
+TuGraph编译后，会把所有的依赖库以.a的形式打包在一起，因此原则上运行不需要的其他的依赖库。但TuGraph支持存储过程，即在服务端编译C++代码，因此在环境中依然需要涉及的编译器。
+
+## 2.依赖系统库
+
+针对三种环境，除去TuGraph的运行包，所需要的系统库如下：
+* 编译环境，包括gcc、python、java等编译器，也包含antlr4、pybind11等，具体参见tugraph-db源码目录 ci/images/tugraph-compile-*-Dockerfile。
+* 运行环境，主要由存储过程引入，包括gcc、boost、cmake等，具体参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile。
+* 精简运行环境，无，可以参见tugraph-db源码目录 ci/images/ tugraph-mini-runtime-*-Dockerfile。
+
+
+
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md
new file mode 100644
index 0000000000..8e0cf26b6d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md
@@ -0,0 +1,101 @@
+# Docker部署
+
+>本文档介绍TuGraph Compile及TuGraph Runtime的Docker镜像的创建、下载。
+
+## 1.简介
+
+- TuGraph Compile Image：提供编译环境，可以用于TuGraph的编译，测试；
+- TuGraph Runtime Image：提供二进制可运行环境，附带TuGraph库和可执行文件；
+- TuGraph Mini Runtime Image: 提供二进制可运行环境，不包含TuGraph中Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+## 2.现有Docker Image
+
+### 2.1.镜像下载方式
+
+镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用。
+
+最新版本的Docker地址参见 [链接](../../1.guide.md#TuGraph最新版本)。
+
+### 2.2.命名规范
+
+#### 2.2.1.TuGraph Compile Image
+
+提供编译环境，可以用于TuGraph的编译。
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+例如： `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+提供二进制可运行环境，附带TuGraph库和可执行文件。
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如：`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+提供二进制可运行环境，不包含TuGraph种Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如： `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.常见Docker操作
+
+Docker由Dockerfile生成，注意创建镜像需要下载依赖，因此网络问题可能会导致创建较慢或者创建失败。注意不要覆盖镜像，除非tag为 `latest`。
+
+创建Compile镜像
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+创建Runtime / Mini Runtine镜像
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+修改镜像名称
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+上传镜像
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+获取镜像
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+导出镜像
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+导入镜像
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+其他Docker操作请参考[docker官方文档](https://docs.docker.com/engine/reference/commandline/cli )
+
+
+### 2.4. M1芯片支持
+
+在 M1 芯片的机器上运行 amd64 容器可能造成未知错误。TuGraph提供 arm64 的镜像供 M1 机器使用。
+包含compile和runtime两种镜像：
+* `tugraph-runtime-arm64v8-centos7`
+* `tugraph-compile-arm64v8-centos7`
+
+## 3. 使用和开发TuGraph-DB Docker镜像时的最佳实践
+
+在您刚开始为TuGraph做出贡献时，请仔细阅读以下要点，并遵循它们。
+
+- 为了避免过多的Docker Layer，请尽量像现有的Dockerfile一样单行的写ENV和RUN将您的依赖项添加到Docker中。
+- 对于您需要构建依赖项的软件包/资源，请使用原始的软件包/资源，而不是在没有VCS跟踪的情况下修改这些资源。之后联系TuGraph团队将其上传到OSS以加速构建过程，如同您在Dockerfiles中看到的URL一样。
+- 为了使开发更加高效，最好从Base TuGraph编译镜像添加依赖项开始，完成开发确认依赖没问题后在Dockerfile中重新复制该过程。
+- CI使用了Docker镜像。如果您的CI失败，请检查依赖项问题。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md
new file mode 100644
index 0000000000..ef49670ad5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# 本地包部署
+
+> 此文档主要介绍 TuGraph 的本地包部署。
+
+## 1. 环境准备
+
+TuGraph本地包部署需要对应的环境，快速验证可以使用精简安装包，几乎不需要任何第三方库。
+
+如果您需要使用完整的TuGraph功能，请参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile，该脚本包含完整的环境构建流程。
+
+## 2. 安装包下载
+
+最新版本的安装包地址参见 [链接](../../1.guide.md/#TuGraph最新版本)。
+
+也可以访问Github进行下载：[TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. CentOS 下的安装方法
+
+用于在 CentOS 上安装的 TuGraph 的.rpm 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.rpm 安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+用户也可以通过指定`--prefix`选项指定安装目录。
+
+## 4. Ubuntu 下的安装方法
+
+用于在 Ubuntu 上安装的 TuGraph 的.deb 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.deb`安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+该命令默认将 TuGraph 安装于`/usr/local`目录下。用户也可以通过指定 `--instdir=<directory>` 选项更改安装目录。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md
new file mode 100644
index 0000000000..9d4184acdf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md
@@ -0,0 +1,125 @@
+# 云部署
+
+> 此文档主要介绍 TuGraph 的云部署，也可参见[阿里云计算巢部署文档]( https://aliyun-computenest.github.io/quickstart-tugraph/ )。
+
+## 1.简介
+
+TuGraph（tugraph.antgroup.com）是蚂蚁集团研发的高性能图数据库（Graph Database）。TuGraph在计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。本文向您介绍如何开通计算巢上的TuGraph社区版服务，以及部署流程和使用说明。
+
+## 2.实例说明
+
+TuGraph部署的为社区开源版本，源码参考Github Repo，目前可以选择的实例规格如下：
+
+| 规格族         | vCPU与内存                 | 系统盘              | 公网带宽      |
+|----------------|-------------------------|-------------------|-----------|
+| ecs.r7a.xlarge | AMD 内存型 r7a，4vCPU 32GiB | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+| ecs.r6.xlarge  | 内存型r6，4vCPU 32GiB       | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+
+预估费用在创建实例时可实时看到（目前为免费）。 如需更多规格、其他服务（如集群高可用性要求、企业级支持服务等），请联系我们 tugraph@service.alipay.com。
+
+## 3.部署流程
+
+### 3.1.准备工作
+
+在正式开始使用前，您需要一个阿里云账号，对ECS、VPC等资源进行访问和创建操作。
+
+- 若您使用个人账号，可以直接创建服务实例
+- 若您使用RAM用户创建服务实例，且是第一次使用阿里云计算巢
+    - 需要在创建服务实例前，对使用的RAM用户的账号添加相应资源的权限。添加RAM权限的详细操作，请参见为 __RAM用户授权__。所需权限如下表所示。
+    - 且需要授权创建关联角色，参考下图，选中 __同意授权并创建关联角色__
+
+| 权限策略名称                    | 备注                                    |
+|---------------------------------|---------------------------------------|
+| AliyunECSFullAccess             | 管理云服务器服务（ECS）的权限             |
+| AliyunVPCFullAccess             | 管理专有网络（VPC）的权限                 |
+| AliyunROSFullAccess             | 管理资源编排服务（ROS）的权限             |
+| AliyunComputeNestUserFullAccess | 管理计算巢服务（ComputeNest）的用户侧权限 |
+| AliyunCloudMonitorFullAccess    | 管理云监控（CloudMonitor）的权限          |
+
+![同意授权并创建关联角色](../../../../images/cloud-deployment-1.png)
+
+### 3.2.部署入口
+
+您可以在阿里云计算巢自行搜索，也可以通过下述部署链接快速到达。
+
+[部署链接](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.申请试用
+
+在正式试用前，需要申请试用，按照提示填写信息，在审核通过后就可以创建TuGraph服务。
+
+![申请试用](../../../../images/cloud-deployment-2.png)
+
+### 3.4.创建TuGraph服务
+
+#### 3.4.1.参数列表
+
+您在创建服务实例的过程中，需要配置服务实例信息的参数列表，具体如下。
+
+| 参数组               | 参数项   | 示例          | 说明                                                           |
+|--------------------|----------|---------------|--------------------------------------------------------------|
+| 服务实例名称         | N/A      | test          | 实例的名称                                                     |
+| 地域                 | N/A      | 华东1（杭州）   | 选中服务实例的地域，建议就近选中，以获取更好的网络延时。          |
+| 付费类型配置         | 付费类型 | 按量付费      | 免费使用请选用按量付费                                         |
+| 可用区配置           | 部署区域 | 可用区I       | 地域下的不同可用区域，确保实例非空                              |
+| 选择已有基础资源配置 | VPC ID   | vpc-xxx       | 按实际情况，选择专有网络的ID。                                   |
+| 选择已有基础资源配置 | 交换机ID | vsw-xxx       | 按实际情况，选择交换机ID。若找不到交换机, 可尝试切换地域和可用区 |
+| ECS实例配置          | 实例类型 | ecs.r6.xlarge | 当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格                      |
+|ECS实例配置|	实例密码|	**|	设置实例密码。长度8~30个字符，必须包含三项（大写字母、小写字母、数字、 ()`~!@#$%^&*_-+={}[]:;'<>,.?/ 中的特殊符号）。|
+
+#### 3.4.2.具体步骤
+
+创建服务按如下步骤进行，参考下图：
+
+- 创建实例名称，如下图中“test”
+- 选择地域，如下图中“华东1（杭州）”
+
+![创建实例](../../../../images/cloud-deployment-3.png)
+
+- 选择实例类型，当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格。如果列表中无机型可选，请尝试选择其他的部署区域
+- 选中机型
+- 配置实例的密码
+- 选择部署区域，如下图中“可用区I”
+
+![选择区域](../../../../images/cloud-deployment-4.png)
+
+- 点击下一步，进入订单确认页面
+- 勾选“权限确认”和“服务条款”中的复选框
+- 点击左下角绿色背景的开始免费试用，即可创建服务实例
+
+![确认](../../../../images/cloud-deployment-5.png)
+
+### 3.5.启动TuGraph服务
+
+- 查看服务实例：服务实例创建成功后，部署时间大约需要2分钟。部署完成后，页面上可以看到对应的服务实例，如下图
+
+![查看实例](../../../../images/cloud-deployment-6.png)
+
+- 点击该服务实例访问TuGraph。进入到对应的服务实例后，可以在页面上获取到web、rpc、ssh共3种使用方式，并且页面上展示了admin用户的密码
+
+![访问方式](../../../../images/cloud-deployment-7.png)
+
+- 点击web的链接，即可跳转访问已经部署好的TuGraph Web。建议新手先通过TuGraph Web，快速使用demo上手。
+    - 首先在TuGraph Web的登录页面上，输入默认用户名admin和页面上展示的admin用户的密码进行登录，参考下图
+    - 登录完成后，选择任意一个带有官方图标的图项目，其中内置了demo数据，开启图数据的探索和发现！
+
+![登录](../../../../images/cloud-deployment-8.png)
+![创建demo](../../../../images/cloud-deployment-9.png)
+
+## 4.常见FAQ
+
+### 问题一：部署区域无可用资源
+
+有时，所选部署区域（如可用区G）没有所选套餐的可用资源，会报错如下图所示
+
+![部署区域错误](../../../../images/cloud-deployment-10.png)
+
+__解决办法__：尝试选择其他区域，如可用区I等
+
+### 问题二: 启动后web访问不通
+
+web的启动需要一点点时间，请稍后刷新页面即可。
+
+### 问题三: 登录时的用户名密码不正确
+
+请注意检查，登录时使用的密码应为详情页面展示的密码。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/index.rst
new file mode 100644
index 0000000000..16187666e3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/1.installation/index.rst
@@ -0,0 +1,8 @@
+安装
+====
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/1.compile.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/1.compile.md
new file mode 100644
index 0000000000..9b47c6b3f8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/1.compile.md
@@ -0,0 +1,28 @@
+# 从源码编译
+
+> 本文档主要描述 TuGraph 从源码进行编译。
+
+## 1.前置条件
+
+推荐在linux系统下搭建TuGraph。同时docker环境是个不错的选择,如果你想设置一个新的环境，请参考[Dockerfile](../1.installation/3.docker-deployment.md)。
+
+## 2.编译介绍
+
+以下是编译TuGraph的步骤：
+
+1. 如果需要web接口运行`deps/build_deps.sh`，不需要web接口则运行`SKIP_WEB=1 deps/build_deps.sh`
+2. 根据容器系统信息执行`cmake .. -DOURSYSTEM=centos`或者`cmake .. -DOURSYSTEM=ubuntu`，如果需要shell运行lgraph_cypher，加上`-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+3. `make`
+4. `make package` 或者 `cpack --config CPackConfig.cmake`
+
+示例：`tugraph/tugraph-compile-centos7`Docker环境
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md
new file mode 100644
index 0000000000..c2113c3d71
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md
@@ -0,0 +1,195 @@
+# 数据库运行
+
+> 本文档主要描述 TuGraph 服务的运行模式、启动、停止和重启的操作,以及 TuGraph 的服务配置参数、配置文件格式和命令行配置参数。
+
+## 1.前置条件
+
+TuGraph 运行的前置条件为 TuGraph 正确安装，参考[安装流程](../1.installation/1.environment.md)。
+
+TuGraph 运行需要保证库文件 liblgraph.so 的文件位置在环境变量 LD_LIBRARY_PATH。
+
+运行 TuGraph 进程的用户不需要超级权限，但需要对配置文件（一般为lgraph.json）及文件中涉及的文件有读权限，并且对数据文件夹、日志文件夹等有写权限。
+
+## 2.运行模式
+
+TuGraph 可以作为前台普通进程启动，也可以作为后台守护进程启动。
+当作为普通进程运行时，TuGraph 可以直接将日志打印到终端，这在调试服务器配置时非常方便。但是，由于前台进程在终端退出后被终止，因此用户须确保在 TuGraph 服务器处于运行状态时，终端保持打开状态。另一方面，在守护进程模式下，即使启动它的终端退出，TuGraph 服务器也可以继续运行。因此，在长时间运行的服务器下推荐以守护进程模式启动 TuGraph 服务器。
+
+### 2.1.运行普通进程
+
+`lgraph_server -d run`命令可以将 TuGraph 作为普通进程运行。普通进程依赖命令行终端，因此终端结束时，TuGraph 进程也会自动终止。普通进程模式配合`--log_dir ""`可以将进程日志直接输出到终端，因此更方便调试。
+
+启动命令：
+
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+普通模式的运行输出示例：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+普通进程模式下，用户可以通过按 `CTRL+C` 来提前终止 TuGraph 进程。
+
+### 2.2.运行进程守护模式
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+守护模式的运行输出示例：
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+## 3.服务操作
+
+### 3.1.启动服务
+
+TuGraph 需要通过 `lgraph_server -d start` 命令行启动，启动命令示例如下：
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+### 3.2.停止服务
+
+用户可以使用`kill`命令以及`lgraph_server -d stop`命令停止 TuGraph 守护进程。由于可能在同一台计算机上运行多个 TuGraph 服务器进程，因此我们使用`.pid`文件区分不同的服务器进程，该文件写入启动该进程的工作目录。因此，需要在相同工作目录中运行`lgraph_server-d stop`命令，以停止正确的服务器进程。
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.重启服务
+
+用户也可以通过`lgraph_server -d restart`来重启 TuGraph 服务：
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.服务配置
+
+TuGraph 服务器在启动时从配置文件和命令行选项加载配置，如果在配置文件和命令行中同一选项指定了不同的值，将优先使用命令行中指定的值。
+
+### 4.1.配置参数
+
+具体参数及其类型描述如下：
+
+| **参数名**                       | **<nobr>参数类型</nobr>** | **参数说明**                                                                                                                             |
+|-------------------------------|-----------------------|--------------------------------------------------------------------------------------------------------------------------------------|
+| directory                     | 字符串                   | 数据文件所在目录。如果目录不存在 ，则自动创建。默认目录为 /var/lib/lgraph/data。                                                                                  |
+| durable                       | 布尔值                   | 是否开启实时持久化。关闭持久化可以减少写入时的磁盘 IO 开销，但是在机器断电等极端情况下可能丢失数据。默认值为 `true`。                                                                     |
+| host                          | 字符串                   | REST 服务器监听时使用的地址，一般为服务器的 IP 地址。默认地址为 0.0.0.0。                                                                                        |
+| port                          | 整型                    | REST 服务器监听时使用的端口。默认端口为 7070。                                                                                                         |
+| enable_rpc                    | 布尔值                   | 是否使用 RPC 服务。默认值为 0。                                                                                                                  |
+| rpc_port                      | 整型                    | RPC 及 HA 服务所用端口。默认端口为 9090。                                                                                                          |
+| enable_ha                     | 布尔值                   | 是否启动高可用模式。默认值为 false。                                                                                                                |
+| ha_log_dir                    | 字符串                   | HA 日志所在目录，需要启动 HA 模式。默认值为空。                                                                                                          |
+| verbose                       | 整型                    | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。默认值为 1。                                                                                            |
+| log_dir                       | 字符串                   | 日志文件所在的目录。默认目录为 /var/log/lgraph/。                                                                                                    |
+| ssl_auth                      | 布尔值                   | 是否使用 SSL 安全认证。当开启时，REST 服务器只开启 HTTPS 服务。默认值为 false。                                                                                  |
+| web                           | 字符串                   | web 文件（包含可视化部分）所在目录。默认目录为 /usr/local/share/lgraph/resource。                                                                          |
+| server_cert                   | 字符串                   | 在 SSL 认证开启时，服务器所使用的 certificate 文件路径。默认路径为 /usr/local/etc/lgraph/server-cert.pem。                                                    |
+| server_key                    | 字符串                   | 在 SSL 认证开启时，服务器所使用的公钥文件。默认目录为 /usr/local/etc/lgraph/server-key.pem。                                                                  |
+| enable_audit_log              | 布尔值                   | 是否启用审计日志，默认值为 false。                                                                                                                 |
+| audit_log_expire              | 整型                    | 启用审计日志时，日志的有效时间（小时），超时自动清理，值为 0 时表示不清理。默认值为 0。                                                                                       |
+| audit_log_dir                 | 字符串                   | 启用审计日志时，日志文件的存放目录。默认目录为 $directory/_audit_log_。                                                                                      |
+| load_plugins                  | 布尔值                   | 启动服务时导入所有存储过程。默认值为 1。                                                                                                                |
+| optimistic_txn                | 布尔值                   | 为 Cypher 开启乐观多线程写入事务。默认为 0。                                                                                                          |
+| disable_auth                  | 布尔值                   | 关闭 REST 验证。默认为 0。                                                                                                                    |
+| ha_snapshot_interval_s             | 整型                    | 快照间隔（以秒为单位）。 默认值为 86400。                                                                                                             |
+| ha_heartbeat_interval_ms         | 整型                    | 心跳间隔（以毫秒为单位）。 默认值为 1000。                                                                                                             |
+| ha_node_offline_ms | 整型                    | 心跳超时且节点下线间隔（以毫秒为单位）。默认为 60000。                                                                                                       |
+| ha_node_remove_ms         | 整型                    | 节点被视为完全死亡并从列表中删除的间隔（以毫秒为单位）。默认值为 120000。                                                                                             |
+| enable_ip_check               | 布尔值                   | 允许 IP 白名单，默认值为 0。                                                                                                                    |
+| idle_seconds                  | 整型                    | 子进程可以处于空闲状态的最大秒数。 默认值为 600。                                                                                                          |
+| enable_backup_log             | 布尔值                   | 是否启用备份日志记录。 默认值为 0。                                                                                                                  |
+| backup_log_dir                | 字符串                   | 存储备份文件的目录。 默认值为空。                                                                                                                    |
+| snapshot_dir                  | 字符串                   | 存储快照文件的目录。 默认值为空。                                                                                                                    |
+| thread_limit                  | 整型                    | 同时使用的最大线程数。 默认值为 0，即不做限制，以 license 为准。                                                                                               |
+| unlimited_token               | 布尔值                   | 是否将链接token设置为无期限。 默认值为 0，有效期为24小时。                                                                                                   |
+| enable_fulltext_index         | 布尔值                   | 是否启用全文索引功能，默认值为 0。                                                                                                                   |
+| fulltext_analyzer             | 字符串                   | 全文索引分词器类型。可设为`StandardAnalyzer`或者`SmartChineseAnalyzer`。默认是`StandardAnalyzer`                                                        |
+| fulltext_commit_interval      | 整形                    | 全文索引数据提交周期,针对写操作，单位秒。默认是 0，立即提交。                                                                                                     |
+| fulltext_refresh_interval     | 整形                    | 全文索引数据刷新周期，针对读操作，单位秒。默认是 0，立即可以读到最新写入的数据。                                                                                            |
+| conf                          | 字符串                   | 根据 host1:port1,host2:port2,host3:port3 初始化HA集群，默认值为空。                                                                                |
+| ha_node_join_group_s             | 整形                    | 节点尝试加入高可用集群的等待时长，单位秒，默认是 10。                                                                                                         |
+| ha_bootstrap_role                | 整形                    | 是否使用bootstrap方式启动，以及使用该方式启动的服务器角色，0代表不使用bootstrap方式启动，1代表使用bootstrap方式启动且本节点为leader，2代表使用bootstrap方式启动且本节点为follower，只有这3种选项。 默认值为 0。 |
+| help                          | 布尔值                   | 打印此帮助消息。 默认值为 0。                                                                                                                     |
+
+### 4.2.服务器配置文件
+
+TuGraph 的配置文件以 JSON 格式存储。建议将大多数配置存储在配置文件中，并且仅在需要时使用命令行选项临时修改某些配置参数。
+一个典型的配置文件如下：
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md
new file mode 100644
index 0000000000..0380d3d39a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md
@@ -0,0 +1,134 @@
+# 部署高可用模式
+
+> 此文档主要介绍了高可用模式的原理、准备工作、以及服务器的操作说明
+
+## 1.原理
+
+TuGraph 通过多机热备份来提供高可用模式（HA 模式）。在高可用模式下，对数据库的写操作会被同步到所有服务器上，这样即使有部分服务器宕机也不会影响服务的可用性。
+
+在高可用模式下，多个 TuGraph 服务器组成一个备份组。每个备份组由三个或更多 TuGraph 服务器组成，其中某台服务器会作为`leader`，而其他复制组服务器则作为`follower`。写入请求由`leader`
+提供服务，该`leader`将每个请求复制同步到`follower`，并在请求同步到服务器后才能响应客户端。这样，如果任何服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选择出新的`leader`。
+
+高可用模式仅企业版可用，开源社区版不含此功能。
+
+## 2.准备工作
+
+要启用高可用模式，用户需要：
+
+- 三台及以上的 TuGraph 服务器实例。
+
+- 在启动 lgraph_server 时打开高可用模式，可以使用配置文件或者命令行将`enable_ha`选项设置为`true`。
+
+- 设置正确的`rpc_port`，可通过配置文件或者命令行设置。
+
+## 3.启动初始备份组
+
+### 3.1.初始数据一致
+
+当启动时所有服务器中的数据相同或没有数据时，用户可以通过
+指定`--conf host1:port1,host2:port2`启动服务器。
+这种方式可以将准备好的所有TuGraph实例一次性加入初始备份组，
+由备份组中的所有服务器根据raft协议选举出`leader`，并将其他
+服务器以`follower`的角色加入备份组。
+
+启动初始备份组的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+### 3.2.初始数据不一致
+
+如果第一台服务器中已有数据（以`lgraph_import`工具导入或从非高可用模式的服务器传输得到），
+并且之前并未在高可用模式下使用，则用户应使用boostrap方式启动。
+以`ha_bootstrap_role`参数为1在bootstrap模式下启动有数据的服务器，并通过`conf`参数指定本机为`leader`。
+在bootstrap模式下，服务器在将新加入的服务器添加到备份组之前会将自己的
+数据复制到新服务器中，以使每个服务器中的数据保持一致。
+
+启动有数据服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 1
+```
+
+其他无数据的服务器需要指定`ha_bootstrap_role`参数为2，并通过`conf`参数指定`leader`即可，命令示例如下所示
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 2
+```
+
+## 4.横向扩展其他服务器
+
+启动初始备份组后，如果想对备份组进行横向扩展，要将新服务器添加到备份组，
+应使用`--conf HOST：PORT`选项，其中`HOST`可以是该备份组中已有的任何服务器的 IP 地址，
+而`PORT`是其 RPC 端口。例如：
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+
+此命令将启动一台高可用模式的 TuGraph 服务器，并尝试将其添加到包含服务器`172.22.224.15:9090`的备份组中。
+请注意，加入备份组需要服务器将其数据与备份组的`leader`服务器同步，此过程可能需要相当长的时间，具体取决于数据的大小。
+
+## 5.停止服务器
+
+当服务器通过`CTRL-C`下线时，它将通知当前的`leader`服务器，告知其从备份组中删除该下线的服务器。如果`leader`服务器下线，
+它将在下线前将`leader`身份权限传给另一台服务器。
+
+如果服务器被终止或者与备份组中的其他服务器失去连接，则该服务器将被视为失败节点，`leader`服务器将在特定时限后将其从备份组中删除。
+
+如果任何服务器离开备份组并希望重新加入，则必须从`--conf HOST:PORT`选项开始，其中`HOST`是当前备份组中的某台服务器的 IP 地址。
+
+## 6.重启服务器
+
+不建议重新启动整个备份组，因为它会中断服务。如果需要，可以关闭所有服务器。但在重新启动时，
+必须保证关闭时的备份组中至少有N/2+1的服务器能正常启动，否则启动失败。 并且，
+无论初始启动复制组时是否指定`enable_bootstrap`为true，重启服务器时都只需通过
+指定`--conf host1:port1,host2:port2`参数一次性重启所有服务器即可，命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 7.docker部署高可用集群
+在真实业务场景中，很可能遇到在多种操作系统或架构上部署高可用集群的需求。
+差异化的环境可能导致编译TuGraph时缺少某些依赖。因此，
+在docker中编译软件并部署高可用集群是非常有应用价值的。以centos7版本的docker为例，
+部署高可用集群的步骤如下所示。
+
+### 7.1.安装镜像
+使用如下命令下载TuGraph的编译docker镜像环境
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+然后拉取TuGraph源码并编译安装
+
+### 7.2.创建容器
+使用如下命令创建容器，使用`--net=host`使得容器运行在host模式，此模式下
+docker和宿主机和共享网络namespace，即共用同一个IP。
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 7.3.启动服务
+在每台服务器上使用如下命令启动服务，因为docker和宿主机共享IP，所以可以直接指定在宿主机IP上启动服务
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.查看服务器状态
+
+备份组的当前状态可以在 TuGraph 可视化工具、REST API 以及 Cypher 查询中获取。
+
+在 TuGraph 可视化工具中，可以在 DBInfo 部分中找到备份组中的服务器及其角色列表。
+
+使用 REST API 时，可以使用`GET /info/peers` 请求获取信息。
+
+在 Cypher 中，使用`CALL dbms.listServers()`语句来查询当前备份组的状态信息。
+
+## 9.高可用模式下数据同步问题
+
+在高可用模式下，同一备份组中的不同服务器可能并不总是处于相同的状态。出于性能原因，如果请求已同步到超过一半的服务器，则`leader`服务器将认为该请求属于`committed`状态。尽管其余服务器最终将收到新请求，但服务器的状态不一致将持续一段时间。客户端也可能向刚刚重新启动的服务器发送请求，从而具有较旧的状态。
+
+为了确保客户端看到一致连续的数据，特别是为了摆脱`反向时间旅行`问题（其中客户端读取比以前看到的状态更旧的状态），每个 TuGraph 服务器都会保持一个单调增加的数据版本号。备份组中数据版本号到数据库状态的映射全局一致，这意味着如果两台服务器具有相同的数据版本号，则它们必须具有相同的数据。响应请求时，服务器在响应中包含了其数据版本号。因此，客户端可以知道它看到了哪个版本。客户端收到旧版本的数据之后可以重新向Leader发送请求，从而获取到最新的数据。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/index.rst
new file mode 100644
index 0000000000..a653bf13ab
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/2.running/index.rst
@@ -0,0 +1,8 @@
+运行
+====
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md
new file mode 100644
index 0000000000..da0e0705f4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md
@@ -0,0 +1,366 @@
+# 数据导入
+
+> 此文档主要介绍 TuGraph 的数据导入功能。其中包括 CSV 格式的分隔符，jsonline 的格式示例，以及导入在线和离线的两种模式。
+
+## 1.简介
+
+在图数据库服务安装成功后，您可以使用`lgraph_import`批量导入工具将现有数据导入 TuGraph。`lgraph_import`支持从 CSV 文件和 JSON 数据源导入数据。
+
+> CSV 格式
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline 格式
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph 支持两种导入模式：
+
+- _离线模式_：读取数据并将其导入指定服务器的数据文件，应仅在服务器离线时完成。
+- _在线模式_：读取数据并将其发送到工作中的服务器，然后将数据导入其数据库。
+
+## 2.CSV文件格式分隔符
+
+    CSV格式的分隔符可以是单字符或多字符组成的字符串，其中不能包含`\r`或`\n`。注意不同的shell会对输入字符串做不同的处理，因此针对不同的shell输入参数可能需要不同的转义处理。
+
+此外，`lgraph_import`还支持以下转义字符，以便输入特殊符号：
+
+| 转义符 | 说明                                                             |
+| ------ | ---------------------------------------------------------------- |
+| \\     | 反斜杠`\\`                                                       |
+| \\a    | 响铃，即 ASCII 码 0x07                                           |
+| \\f    | form-feed，即 ASCII 码 0x0c                                      |
+| \\t    | 水平制表符，即 ASCII 码 0x09                                     |
+| \\v    | 垂直制表符，即 ASCII 码 0x0b                                     |
+| \\xnn  | 两位十六进制数，表示一个字节，如\\x9A                            |
+| \\nnn  | 三位八进制数，表示一个字节，如\\001, \\443，数值范围不能超过 255 |
+
+例：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.配置文件
+
+`lgraph_import`工具通过指定的配置文件进行环境配置。配置文件描述输入文件的路径、它们所代表的点/边以及点/边的格式。
+
+### 3.1.配置文件格式
+
+配置文件包含两部分：schema 和 files。`schema`部分定义 label，`files`部分描述要导入的数据文件。
+
+#### 3.1.1.关键字
+
+- schema (数组形式）
+  - label（必选，字符串形式）
+  - type（必选，值只能是 VERTEX 或者 EDGE）
+  - properties（数组形式，对于点必选，对于边如果没有属性可以不配置）
+    - name（必选，字符串形式）
+    - type （必选，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（可选，代表该字段可以配置，也可以不配置）
+    - index（可选，该字段是否需要建索引）
+    - unique（可选，该字段是否建索引，并且是 unique 类型的）
+  - primary (仅点配置，必选，主键字段，需指定一个 property，用来唯一确定一个点)
+  - temproal (仅边配置，可选，指定时间戳属性用于存储层排序)
+  - temporal_field_order (仅边配置，可选，默认为"ASC"，表示升序，也可配置为"DESC"，表示降序)
+  - constraints (仅边配置，可选，数组形式，起点和终点的 label，不配置或者为空代表不限制)
+  - detach_property (点边都可配置，可选，默认是`false`。`true` 代表属性数据单独存放，在内存不够，属性数据比较多的场景下可以减少io读放大)
+- files （数组形式）
+  - path（必选，字符串，可以是文件路径或者目录的路径，如果是目录会导入此目录下的所有文件，需要保证有相同的 schema）
+  - header（可选，数字，头信息占文件起始的几行，没有就是 0）
+  - format（必须选，只能是 JSON 或者 CSV）
+  - label（必选，字符串）
+  - columns（数组形式）
+    - SRC_ID (特殊字符串，仅边有，代表这列是起始点数据)
+    - DST_ID (特殊字符串，仅边有，代表这列是目的点数据)
+    - SKIP   (特殊字符串，代表跳过这列数据)
+    - [property]
+  - SRC_ID (仅边配置，值是起始点标签)
+  - DST_ID (仅边配置，值是目的点标签)
+
+### 3.2.配置文件示例
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+对于上述配置文件，定义了三个 label：两个点类型`actor`和`movie`，一个边类型`role`。每个 label 都描述了：label 的名字、类型（点还是边）、属性字段有哪些以及每个字段的类型。对于点，另外定义了 primary 字段是哪个；对于边，另外定义了 constraints 字段，用来限制边的起点和终点只能是哪些组合。
+
+还描述了三个数据文件，两个点的数据文件`actors.csv`和`movies.csv`，一个边的数据文件`roles.csv`。每个部分都描述了：文件的路径（path）、数据类型（format）、信息头占开头几行（header）、是哪个 label 的数据（label）、文件中每行数据中的每个列对应的字段是哪个。
+
+对于上述配置文件，import 工具在执行的过程中会先在 TuGraph 中创建`actor`、`movie`、`role`这三个 label，然后再执行三个文件的数据导入。
+
+## 4.离线全量导入
+
+离线模式只能在离线状态的服务器使用。离线导入会创建一张新图，因此更适合新安装的 TuGraph 服务器上的第一次数据导入。
+要在离线模式下使用`lgraph_import`工具，可以指定`lgraph_import --online false`选项。要了解可用的命令行选项，请使用`lgraph_import --online false --help`：
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+命令行参数：
+
+- **-c, --config_file** `config_file`: 导入配置文件名，其格式要求见下述。
+- **--log** `log_dir`: 日志目录。默认为空字符串，此时将日志信息输出到控制台。
+- **--verbose** `0/1/2`: 日志等级，等级越高输出信息越详细。默认为 1。
+- **-i, --continue_on_error** `true/false`: 在碰到错误时跳过错误并继续，默认为 false，碰到错误立即退出。
+- **-d, --dir** `{diretory}`: 数据库目录，导入工具会将数据写到这个目录。默认为`./db`。
+- **--delimiter** `{delimiter}`: 数据文件分隔符。只在数据源是 CSV 格式时使用，默认为`","`。
+- **-u, --username** `{user}`: 数据库用户名。需要是管理员用户才能执行离线导入。
+- **-p, --password** `{password}`: 指定的数据库用户的密码
+- **--overwrite** `true/false`: 是否覆盖数据。设为 true 时，如果数据目录已经存在，则覆盖数据。默认为`false`。
+- **-g, --graph** `{graph_name}`: 指定需要导入的图种类。
+- **-h, --help**: 输出帮助信息。
+
+### 4.1.离线导入示例
+
+在这个例子中，我们使用上面描述的电影-演员数据来演示导入工具的使用方法。待导入数据分为三个文件：`movies.csv`，`actors.csv`，`roles.csv`。
+
+`movies.csv`包含的是电影的信息，其中每部电影有一个 id（作为检索的 primary key），此外每部电影还拥有 title、year 和 rating 等属性。（数据来自[IMDb](http://www.imdb.com)）。
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+对应的 jsonline 格式如下:
+也可以所有字段都是字符串形式，导入的时候会转换成对应的类型
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`包含的是演员的信息。每个演员也拥有一个 id，以及 name 等属性。
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> 对应的 jsonline 格式如下:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`则包含了演员在哪个电影中扮演了哪个角色的信息。其中每一行记录的是指定演员在指定电影里饰演的角色，对应数据库中的一条边。`SRC_ID` 和 `DST_ID` 分别是边的源点和目标点，他们分别是`actors.csv`和`movies.csv`中定义的`primary`属性。
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+对应的 jsonline 格式如下:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+`配置文件import.conf`，注意每个文件中有两个标题行，因此我们需要指定`HEADER=2`选项。
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+使用导入配置文件，我们现在可以使用以下命令导入数据：
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # 从import.conf读取配置信息
+        --dir /data/lgraph_db      # 将数据存放在/data/lgraph_db
+        --graph mygraph            # 导入名为 mygraph 的图
+```
+
+**注意**：
+
+- 如果名为`mygraph`的图已存在，导入工具将打印错误消息并退出。要强制覆盖图形，可以使用`--overwrite true` 选项。
+- 配置文件和数据文件必须使用 UTF-8 编码（或普通 ASCII 编码，即 UTF-8 的子集）存储。如果任何文件使用 UTF-8 以外的编码（例如，带有 BOM 或 GBK 的 UTF-8）编码，则导入将失败，并输出分析器错误。
+
+## 5.在线增量导入
+
+在线导入模式可用于将一批文件导入已在运行中的 TuGraph 实例中。这对于处理通常以固定的时间间隔进行的增量批处理更新非常便利。`lgraph_import --online true`选项使导入工具能够在线模式工作。与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据发送到正在运行的 TuGraph 实例中，该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+
+如果用户和密码有效，并且指定的图存在，导入工具将将数据发送到服务器，服务器随后解析数据并将其写入指定的图。数据将以大约 16MB 大小的包发送，在最近的换行符处中断。每个包都是以原子方式导入的，这意味着如果成功导入包，则成功导入所有数据，否则，任何数据都不会进入数据库。如果指定了`--continue_on_error true`，则忽略数据完整性错误，并忽略违规行。否则，导入将在第一个错误包处停止，并打印出已导入的包数。在这种情况下，用户可以修改数据以消除错误，然后使用`--skip_packages N`重做导入以跳过已导入的包。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md
new file mode 100644
index 0000000000..5544169de0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# 数据导出
+
+> 此文档主要介绍 TuGraph 的数据导出功能。
+
+## 1.简介
+
+TuGraph 可以通过 `lgraph_export` 工具来对已经存放在TuGraph的图数据进行数据导出。 `lgraph_export` 工具可以将指定 TuGraph 数据库的数据以 `csv` 或者 `json` 文件形式导出到指定目录，同时导出这些数据进行再导入时需要的配置文件 `import.config` ，详细描述可参见[配置文件](1.data-import.md)。
+
+## 2.导出命令
+
+该工具的命令示例如下：
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+其中：
+
+- `-d {database_dir}` 指定需要进行数据导出的数据库所在目录，默认值为 `./testdb`。
+- `-e {export_destination_dir}` 指定导出文件存放的目录，默认值为 `./exportdir`。
+- `-g {graph_to_use}` 指定图数据库的种类，默认为 `default` 。
+- `-u {username}` 指定进行该导出操作的用户的用户名。
+- `-p {password}` 指定进行该导出操作的用户的用户密码。
+- `-s {field_separator}` 指定导出文件的分隔符，默认为逗号。
+- `-f {output_format}` 指定导出数据的格式，`json`或者`csv`，默认为`csv`。
+- `-h` 除上述指定参数外，也可以使用该参数查看该工具的使用帮助。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..ce113ad0a4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
@@ -0,0 +1,35 @@
+# 备份恢复
+
+> 此文档主要介绍 TuGraph 的数据备份和恢复功能。
+
+## 1.数据备份
+
+TuGraph 可以通过 `lgraph_backup` 工具来进行数据备份。
+`lgraph_backup` 工具可以将一个 TuGraph 数据库中的数据备份到另一个目录下，它的用法如下：
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+其中：
+
+- `-s {source_dir}` 指定需要备份的数据库（源数据库）所在目录。
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
+  如果目标数据库不为空，`lgraph_backup` 会提示是否覆盖该数据库。
+- `-c {true/false}` 指明是否在备份过程中进行 compaction。
+  compaction 能使产生的备份文件更紧凑，但备份时间也会变长。该选项默认为 `true`。
+
+## 2.数据恢复
+
+使用`lgraph_backup` 工具得到的目标数据库`{destination_dir}`备份了源数据库
+`{source_dir}`的所有子图，但不包含HA集群的raft信息，从而保证服务和集群能
+以备份数据库成功重启并与源数据库的数据一致。使用如下命令可以用备份数据库重启服务，
+在服务启动时会恢复所有子图的存储过程，保证备份服务和原服务完全一致。
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+其中：
+
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md
new file mode 100644
index 0000000000..c0c5afb7eb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# 数据预热
+
+> 此文档主要介绍 TuGraph 的数据预热功能。
+
+## 1.简介
+
+TuGraph 是基于磁盘的数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+## 1.数据预热命令
+
+数据预热可以通过工具 `lgraph_warmup` 来进行。它的使用示例如下：
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+其中：
+
+- `-d {db_dir}` 选项指定了 TuGraph 服务器的数据目录
+
+- `-g {graph_list}` 选项指定需要进行数据预热的图名称，用逗号分隔
+
+根据数据大小和所使用的磁盘类型不同，预热过程运行时间也不同。机械磁盘上预热一个大数据库可能耗时较长，请耐心等待。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/index.rst
new file mode 100644
index 0000000000..3b01353109
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/3.server-tools/index.rst
@@ -0,0 +1,8 @@
+服务端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md
new file mode 100644
index 0000000000..59e2ee030d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md
@@ -0,0 +1,42 @@
+# Python客户端
+
+> 此文档主要是TuGraph Python SDK的使用说明。
+
+## 1. 概述
+   Python的TuGraph Rpc Client 是使用pybind11包装的CPP Client SDK，故其接口详情不在此文档中详述，本文档只
+讲解TuGraph Python Restful Client SDK的使用，包括执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.调用Cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = await aclient.call_cypher(cypher)
+print(res)
+```
+
+### 2.2.调用存储过程
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+res = await aclient.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..71282a9b27
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md
@@ -0,0 +1,246 @@
+# C++客户端
+
+> 此文档主要是TuGraph C++ SDK的使用说明。
+
+## 1.概述
+C++ Client 能够使用 RPC 连接lgraph_server，进行数据导入、执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直接连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化。
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.3.调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.4.加载存储过程
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.5.列举存储过程
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送请求。
+
+### 2.6.删除存储过程
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.7.从字节流中导入schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.8.从字节流中导入点边数据
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.9.从文件中导入schema
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+
+### 2.10.从文件中导入点边数据
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md
new file mode 100644
index 0000000000..4e714e1082
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md
@@ -0,0 +1,206 @@
+# Java客户端
+
+> 此文档主要是TuGraph Java SDK的使用说明。
+
+## 1.编译java client代码
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖
+```java
+import com.alipay.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.3.调用存储过程
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.4.加载存储过程
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+
+### 2.5.列举存储过程
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.6.删除存储过程
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+
+### 2.7.从字节流中导入schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException 
+```
+
+### 2.8.从字节流中导入点边数据
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+
+### 2.9.从文件中导入schema
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout) 
+            throws UnsupportedEncodingException, IOException
+```
+
+### 2.10.从文件中导入点边数据
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..a9c06de71b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,174 @@
+# TuGraph-OGM
+
+## 1.简介
+
+> TuGraph-OGM 项目在其他仓库开源。
+
+TuGraph-OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。同时 TuGraph-OGM 兼容 Neo4j-OGM，Neo4j 生态用户可以无缝迁移到 TuGraph 数据库上。
+
+### 1.1.TuGraph-OGM 功能
+
+TuGraph-OGM 提供以下函数操作 TuGraph：
+
+| 功能                            | 用法                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| 插入单个节点\边                 | void session.save(T object)                                                      |
+| 批量插入节点\边                 | void session.save(T object)                                                      |
+| 删除节点与对应边                | void session.delete(T object)                                                    |
+| 删除指定 label 的全部节点       | void session.deleteAll(Class\<T> type)                                           |
+| 清空数据库                      | void purgeDatabase()                                                             |
+| 更新节点                        | void session.save(T newObject)                                                   |
+| 根据 id 查询单个节点            | T load(Class<T> type, ID id)                                                     |
+| 根据 ids 查询多个节点           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| 根据 label 查询全部节点         | Collection\<T> loadAll(Class\<T> type)                                           |
+| 条件查询                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher 查询（指定返回结果类型） | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher 查询                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.编译 TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.使用 TuGraph-OGM
+
+详细示例请参考 demo 文件夹下的 TuGraphOGMDemo ###在`pom.xml`中引入依赖
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // 构建Movie节点
+    @Id
+    private Long id;      // Movie节点的id
+    private String title; // title属性
+    private int released; // released属性
+
+    // 构建边ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // 构建Actor节点
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// 配置
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//启动driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// 开启session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.通过OGM进行增删改查
+
+```java
+// 增
+Movie jokes = new Movie("Jokes", 1990);  // 新建Movie节点jokes
+session.save(jokes);                     // 将jokes存储在TuGraph中
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // 将speed节点与alice节点通过ACTS_IN进行连接
+session.save(speed);                    // 存储两个节点与一条边
+
+// 删
+session.delete(alice);                  // 删除alice节点以及相连的边
+Movie m = session.load(Movie.class, jokes.getId());   // 根据jokes节点的id获取jokes节点
+session.delete(m);                                    // 删除jokes节点
+
+// 改
+speed.setReleased(2018);
+session.save(speed);                   // 更新speed节点属性
+
+// 查
+Collection<Movie> movies = session.loadAll(Movie.class);  // 获取所有Movie节点
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // 查询所有小于1995年发布的电影
+
+// 调用Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // 查询Speed为2018的Movie
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // 创建节点Label Director
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // 创建边Label DIRECT
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // 获取create结果
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // 查看创建节点数目
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //查看创建边数目
+
+// 清空数据库
+session.deleteAll(Movie.class);        // 删除所有Movie节点
+session.purgeDatabase();               // 删除全部数据
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
new file mode 100644
index 0000000000..8c68a5fd64
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
@@ -0,0 +1,134 @@
+# 命令行工具
+
+> 此文档主要介绍 lgraph_cypher 文档的使用
+
+TuGraph 发布版本附带名为`lgraph_cypher`的查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+## 1.单命令模式
+
+在单命令模式下，`lgraph_cypher`可用于提交单个 Cypher 查询并将结果直接打印到终端，打印结果也可以容易地重定向写入指定文件。当用户需要从服务器获取大量结果并将其保存在文件中时，这非常便利。
+在此模式下，`lgraph_cypher`工具具有以下选项：
+
+### 1.1.命令行参数:
+
+| 参数     | 类型   | 说明                                                                     |
+| -------- | ------ | ------------------------------------------------------------------------ | ------ | ----------------------------------------------------------------------------------------------------------------------------------------- |
+| --help   | \\     | 列出所有参数及说明。                                                     |
+| -example | \\     | 列出命令实例。                                                           |
+| -c       | string | 数据库的配置文件，用于获取 ip 与 port 信息。                             |
+| -h       | string | 数据库服务器 ip 地址，如有配置文件则可舍去此参数。默认值为`127.0.0.1` 。 |
+| -p       | string | 数据库服务器端口，如有配置文件则可舍去此参数。默认值为`7071` 。          |
+| -u       | string | 数据库登录用户名。                                                       |
+| -P       | string | 数据库登录密码。                                                         |
+| -f       | string | 包含单条 Cypher 查询单文本文件的路径。                                   |
+| -s       | string | 单行 cypher 查询命令。以`"`开头结尾。                                    |
+| -t       | int    | 进行 cypher 查询时服务器的超时阈值。默认值为`150`秒。 -format            | string | 查询结果显示模式。支持`plain`与`table`两种格式。`plain`格式会将查询结果单列打印。`table`格式会将查询结果以表格方式显示。默认值为`table`。 |
+
+### 1.2.命令示例:
+
+**cypher 命令文件查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+```
+
+**cypher 命令单句查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+```
+
+## 2.交互模式
+
+`lgraph_cypher`也可以在交互模式下运行。在交互式模式下，客户端与服务器保持连接，并在读取-评估-打印-循环中与用户进行交互。
+
+### 2.1.进入 lgraph_cypher 交互模式:
+
+如不加`-f`或`-s`命令行选项，运行`lgraph_cypher`时将会进入交互模式。使用方式如下：
+
+```
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+```
+
+如成功进入则会显示相应登录成功信息：
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2023 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+现在我们也提供一个交互式 shell ，用于用户输入 Cypher 查询语句或使用`:help`命令来检查可用命令。
+
+### 2.2.command种类与说明:
+
+除 Cypher 查询外，`lgraph_cypher` 的 shell 还接受以下命令：
+
+| 命令                     | 对应参数                           | 说明                                                                                                |
+| ------------------------ | ---------------------------------- | --------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                 | 显示服务器信息与所有 command 对应说明。                                                             |
+| :db_info                 | \\                                 | 当前服务器状态查询。对应 REST API 的/db/info。                                                      |
+| :clear                   | \\                                 | 清空屏幕。                                                                                          |
+| :use                     | {图的名称}                         | 使用该名称指定的图，默认值为`default` 。                                                            |
+| :source                  | `-t {查询timeout值} -f {查询文件}` | 可交互模式下的 cypher 命令文件查询。超时阈值默认值为`150`秒。查询文件格式参考无交互式查询参数。     |
+| :exit                    | \\                                 | 退出交互模式并返回原命令行。                                                                        |
+| :format                  | `plain` or `table`                 | 更改 cypher 查询结果的显示模式。支持`plain`与`table`模式。                                          |
+| :save all/command/result | `-f {文件路径}` `{cypher语句}`     | 存储 cypher 命令（command）或查询结果（result）或以上二者（all）。默认存储位置为`/saved_cypher.txt` |
+
+**注意:**
+
+- 每条命令都应该以冒号开始 `:`.
+
+**:save 命令例子:**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+```
+
+### 2.3.cypher 查询命令:
+
+在交互模式下，用户也可直接输入单句 cypher 命令进行查询，以"`;`"结束。输入命令不区分大小写。例子如下：
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher`输入命令时支持多行输入，用户可使用`ENTER`键将长查询语句分多行输入。多行输入情况下命令行开头会从`>`变为`=>`，然后用户可以继续输入查询的其余部分。
+
+例子如下：
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### 2.4.辅助功能:
+
+**历史查询：** 在交互模式下按上下方向键可查询输入历史。
+
+**自动补全：** lgraph_cypher 会根据输入历史进行自动补全。在补全提示出现的情况下，按下右方向键就会自动补全命令。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/index.rst
new file mode 100644
index 0000000000..8d59c09305
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/4.client-tools/index.rst
@@ -0,0 +1,8 @@
+客户端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
new file mode 100644
index 0000000000..b79cc13cc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
@@ -0,0 +1,1020 @@
+# 运维监控
+
+> 此文档主要介绍 TuGraph 的可视化运维监控
+
+## 1.设计思路
+
+可视化监控并不是TuGraph自身不可或缺的一部分，因此在设计时将可视化监控作为TuGraph周边生态中的一个应用，来减少和TuGraph数据库的耦合度，以及对于TuGraph自身的影响。TuGraph可视化监控采用目前最火热的开源解决方案，TuGraph Monitor + Prometheus + Grafana来实现。其中TuGraph Monitor作为TuGraph服务的客户端，通过TCP链接向TuGraph服务发起Procedure请求，TuGraph服务在接收到请求后收集自身所在机器的cpu，memory，disk，io，以及请求数量等指标的统计结果进行响应。TuGraph Monitor在接收到TuGraph响应的指标数据后，将数据包装成prometheus需要的格式，保存在内存中，等待Prometheus服务通过http请求获取。Prometheus服务会定期通过http请求从TuGraph Monitor获取封装好的请求数据，按照获取的时间保存在自己的时序数据库中。Grafana可以根据用户的配置，从Prometheus处获取某个时间段内的统计数据，并在web界面上绘制浅显易懂的图形来展示最终结果。整个请求链路中，都采用了主动获取，即PULL的模型，好处之一是它能最大限度的避免数据生产者和数据消费者之间的耦合度，使得开发更简单，好处之二是数据生产者不需要考虑数据消费者的数据处理能力，即使某个消费者的数据处理能力较弱，也不会因为生产者生产数据过快而压垮消费者。主动拉取模型的不足之处在于数据的实时性不够，但在这个场景中，数据并没有很高的实时性要求。
+
+### 1.1.TuGraph
+
+TuGraph数据库提供了收集服务所在机器中磁盘，内存，网络IO，以及查询请求等多种数据信息的能力，并通过标准Procedure方式提供查询。收集数据这一动作仅在有用户通过接口查询时才会发生，避免了在用户不需要TuGraph监控服务所在机器的指标时对用户业务查询请求带来的影响。
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor是TuGraph周边生态中的一个工具，它作为TuGraph众多用户中的一个，通过C++ RPC Client与TuGraph进行通信，通过Procedure查询接口来查询TuGraph服务所在机器的性能指标，并将TuGraph返回的结果包装成Prometheus需要的数据模型，等待Prometheus获取。用户可以通过设置查询时间间隔来保证获取监控指标对于业务查询的影响最小化。
+
+### 1.3.Prometheus
+
+Prometheus是一个开源的监控平台，并配备有专属的时序数据库，它会定期通过http请求从TuGraph Monitor服务获取统计指标，并保存在自己的时序数据库中。详细信息请参考官网: [https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana是一个开源的可视化和分析软件，它可以从包含Prometheus在内的多个数据源中获取数据，并且可以将时序数据库中的数据转换为精美图形和可视化效果的工具。具体信息请参考官网: [https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.部署方案
+
+### 2.1.第一步
+
+启动TuGraph服务，详细方法请参考文档: [https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.第二步
+
+启动TuGraph Monitor工具，启动命令如下：
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+参数含义如下
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.第三步
+
++ 下载符合您机器架构以及系统版本的Prometheus tar包，下载地址: [https://prometheus.io/download/](https://prometheus.io/download/)
+
++ 解压tar包，命令如下
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ 修改配置文件prometheus.yml，新增如下配置，使其可以抓取TuGraph Monitor包装好的性能数据
+
+```yaml
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ 启动prometheus，具体的启动参数可以通过如下命令获取
+
+```shell
+./prometheus -h
+```
+
++ 验证prometheus服务是否正常，可以通过web端登陆prometheus服务，查询监控指标resources_report是否已经获取到，能成功查询到数据则正确
+
+### 2.4.第四步
+
++ 下载符合您机器架构以及系统版本的Grafana安装包，下载地址: [https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ 安装Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 启动Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 配置Grafana，首先在数据源设置中配置Prometheus的IP地址，配置完成后可以通过测试连接功能，验证是否成功连接数据源。然后，导入如下模版，并在页面中根据实际情况，修改正确的接口IP和端口。最后可以根据实际情况设置刷新时间和监控时间范围
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana"
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {label_name} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "内存",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  QPS超过1000",
+        "name": "请求统计 alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "请求统计",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "磁盘",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\nCPU使用率超过90%",
+        "name": "CPU使用率 alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU使用率",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  磁盘IO超过10MB/S",
+        "name": "磁盘IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph监控页面",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+验证效果，刷新浏览器页面。如果正确显示饼图和折线图，则配置完成。
+
+## 3.未来计划
+
+目前可视化监控只支持单机监控，能监控服务所在机器的cpu，磁盘，网络io，请求qps等性能指标，未来将会实现监控ha集群的功能，也会将更多有意义的指标纳入监控范围
+
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
new file mode 100644
index 0000000000..6091df21fc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
@@ -0,0 +1,434 @@
+# TuGraph-DataX
+
+> 此文档主要介绍 TuGraph DataX 的安装编译和使用示例
+
+## 1.简介
+
+TuGraph 在阿里开源的 DataX 基础上添加了 TuGraph 的写插件以及 TuGraph jsonline 数据格式的支持，其他数据源可以通过 DataX 往 TuGraph 里面写数据。
+DataX 介绍参考 [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+支持的功能包括：
+
+- 从 MySQL、SQL Server、Oracle、PostgreSQL、HDFS、Hive、HBase、OTS、ODPS、Kafka 等各种异构数据源导入 TuGraph
+- 将 TuGraph 导入相应的目标源 （待开发）
+
+![导入导出](../../../../images/tugraph-datax.png)
+
+## 2.编译安装
+
+```bash
+git clone git@code.alipay.com:fma/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+编译出来的 DataX 文件在 target 目录下
+
+## 3.文本数据通过DataX导入TuGraph
+
+我们以 TuGraph 手册中导入工具 lgraph_import 章节举的数据为例子，有三个 csv 数据文件，如下：
+`actors.csv`
+
+```
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+```
+
+`movies.csv`
+
+```
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+`roles.csv`
+
+```
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+```
+
+然后建三个 DataX 的 job 配置文件：
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后依次执行如下三个命令：
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## 4.MySQL数据通过DataX导入TuGraph
+
+我们在 `test` database 下建立如下电影 `movies` 表
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+往表中插入几条数据
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+建立一个 DataX 的 job 配置文件
+
+`job_mysql_to_tugraph.json`
+
+**配置字段方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**写简单 sql 方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后执行如下命令：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
new file mode 100644
index 0000000000..5e31c46502
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph-Explorer
+
+> TuGraph Explorer 已经合并到 [TuGraph Browser](../../4.user-guide/1.tugraph-browser.md)
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md
new file mode 100644
index 0000000000..cdbda4b4d2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md
@@ -0,0 +1,64 @@
+# 日志信息
+
+> 此文档主要介绍 TuGraph 的日志功能。
+
+## 1.简介
+
+TuGraph 保留两种类型的日志：服务器日志和审计日志。服务器日志记录人为可读的服务器状态信息，而审核日志维护服务器上执行的每个操作加密后的信息。
+
+## 2.服务器日志
+
+### 2.1.服务器日志分类
+
+当前服务器日志分为三类，`general log`，`debug log`与`query log`。
+
+`general log`面向普通用户，包含用户关注的数据库启动关闭时的关键信息，如数据库启动时的配置信息，服务监听的端口以及是否成功启动或关闭等信息，可以直观的看到数据库是否正在运行。
+
+`debug log`面向数据库开发者，包含开发者关注的数据库运行过程中产生的debug相关信息，如数据库收到的网络请求，query的执行过程等，可以协助开发者进行开发，并可以通过`verbose`配置项控制日志详细程度。
+
+（待实现）`query log`面向业务开发人员，包含业务开发者关注的每一次数据库执行的query语句以及执行该语句时数据库的性能相关信息，如查询时间等。可以通过设定时间阈值的方式过滤执行时间低于指定值的query，方便业务开发者进行性能分析。
+
+### 2.2.服务器日志配置项
+
+服务器日志的输出位置可以通过`log_dir`配置指定。服务器日志中`debug log`的详细程度可通过`verbose`配置项指定。
+
+`log_dir`配置项默认为空。若`log_dir`为空，则所有日志会输出到控制台。若手动指定`log_dir`，则会在对应路径下生成如下日志文件夹结构。
+
+```
+.
+├── debug.log
+├── general.log
+├── query.log(TODO)
+└── history_logs
+    ├── debug_logs
+    ├── general_logs
+    └── query_logs(TODO)
+```
+
+`general log`日志记录在`genreal.log`文件中。`debug log`日志记录在`debug.log`文件中。`query log`日志记录在`query.log`文件中。
+单个日志文件最大大小为64mb，在达到规定的最大文件大小后会被回收入`history_logs`文件夹中，`general.log`回收进入`general_logs`文件夹，`debug.log`回收进入`debug_logs`文件夹中。
+
+`verbose`配置项控制了`debug log`的详细程度，从粗到细分为`0, 1, 2`三个等级。默认等级为`2`，此等级下，日志记录最详细，服务器将打印`DEBUG`及以上等级的全部日志信息，同时附带上打印这条日志信息的`[文件名:函数名:行号]`，便于debug。等级为`1`时，服务器将仅打印`INFO`等级及以上的主要事件的日志。等级为`0`时，服务器将仅打印`ERROR`等级及以上的错误日志。
+
+### 2.3.服务器日志输出宏使用示例
+
+如果开发者在开发过程中希望在代码中添加日志，可以参考如下示例
+
+```
+#include "tools/lgraph_log.h" //添加日志依赖
+
+
+void LogExample() {
+    // 数据库启动阶段已经对日志模块进行了初始化，开发者只需直接调用宏即可
+    // 日志等级分为TRACE, DEBUG, INFO, WARNING, ERROR, FATAL六个等级
+
+    GENERAL_LOG(INFO) << "This is a info level general log message."; // general log的输出宏
+
+    DEBUG_LOG(ERROR) << "This is a error level debug log message."; // debug log的输出宏
+}
+```
+更多用法可以参考test/test_lgraph_log,cpp中的日志宏的使用方法
+
+## 3.审计日志
+
+审核日志记录每个请求和响应，以及发送请求的用户以及收到请求的时间。审核日志只能是打开或关闭状态。可以使用 TuGraph 可视化工具和 REST API 查询结果。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md
new file mode 100644
index 0000000000..1a62bd27a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md
@@ -0,0 +1,198 @@
+# TuGraph-Restful-Server
+
+> TuGraph Restful Server 强依赖 TuGraph，Restful Server 与 Tugraph 共存
+
+## 1.TuGraph-Restful-Server 简介
+TuGraph Restful Server 使用brpc框架支持的http协议，提供restful接口查询功能，在实现中，restful server 与rpc server 使用同一个端口。目前restful接口提供文件上传，数据导入，导入进度查询，cypher查询，文件删除等功能
+
+## 2.启动 TuGraph-Restful-Server
+需要在启动Tugraph时设置enable_rpc参数为true的方式，正常启动TuGraph
+
+## 3.连接 TuGraph-Restful-Server
+TuGraph正常启动后，Restful Server 将监听在rpc_port上， 通过访问 http://${ip}:${rpc_port}/LGraphHttpService/Query/ url可以链接到TuGraph
+
+## 4.数据格式
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+## 5.返回值
+
+通用返回格式
+
+|  body参数  | 参数说明  |  参数类型  |  是否必填  |
+|:--------:|:-----:|:------:| :-----: |
+| errorCode |  状态码  |  字符串  |  是  |
+| errorMessage | 错误信息  |  字符串  |  是  |
+| data | 返回的数据 |  字符串  |  是  |
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 401 Unauthorized: 未通过鉴权认证，例如用户名密码错误，token超过有效期等
+- 500 Internal Server Error: 服务器端错误
+  当操作成功时，返回的 data 中包含操作的返回值。
+  当发生输入错误或者服务器错误时，返回的 errorMessage 中包含错误提示。
+
+## 6.URI格式
+
+| URI               | 说明                 |
+|-------------------|--------------------|
+| /cypher           | 执行cypher查询请求       |
+| /refresh          | 刷新token请求          |
+| /login            | 用户登陆请求             |
+| /logout           | 用户登出请求             |
+| /upload_files     | 上传文件请求             |
+| /clear_cache      | 清理用户上传文件请求         |
+| /check_file       | 文件认证请求             |
+| /import_data      | 数据导入请求             |
+| /import_progress  | 导入进度查询请求           |
+| /import_schema    | 批量创建schema请求       |
+
+## 7.接口
+### 7.1 用户登陆
+用于用户第一次与服务端通信时的鉴权操作，请求报文在 http body 中携带用户名和密码，响应报文在 http body 中会返回一个带有有效期的token，后续请求中需要在http header中携带该token作为凭证
+#### 7.1.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/login
+#### 7.1.2 REQUEST
+|  body参数  |  参数说明  |  参数类型  |  是否必填  |
+|:--------:|:------:|:------:| :-----: |
+ | userName |  用户名  |  字符串  |  是  |
+ | password |   密码   |  字符串  |  是  |
+#### 7.1.3 RESPONSE
+|    body参数     | 参数说明  |  参数类型  |  是否必填  |
+|:-------------:|:-----:|:------:| :-----: |
+| authorization | token |  字符串  |  是  |
+
+### 7.2 刷新token
+token到期后将无法使用此token与服务端正常通信，需要获取新的token作为后续请求的凭证，请求报文在http header中携带旧的token，响应报文在http body中返回新的token
+#### 7.2.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/refresh
+#### 7.2.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+#### 7.2.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| authorization | 新的token |  字符串  |  是  |
+
+### 7.3 用户登出
+用户不再需要与服务端进行通信时，需要请求登出接口，释放自己的token。请求报文在http header中携带旧的token，如果拿到返回errorCode为200的响应报文即为正常登出
+#### 7.3.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/logout
+#### 7.3.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+### 7.4 执行cypher查询请求
+用户通过此类请求发cypher给server端执行并获取执行结果，请求报文在http body 中将执行的cypher语句和目标子图发送给server，server执行完成后在响应报文的http body中返回执行结果
+#### 7.4.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/cypher
+
+#### 7.4.2 REQUEST
+| body参数 |    参数说明    |  参数类型  |  是否必填  |
+|:------:|:----------:|:------:| :-----: |
+| graph  |   查询目标子图   |  字符串  |  是  |
+| script | cypher查询语句 |  字符串  |  是  |
+
+#### 7.4.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| result | 返回结果 |  字符串  |  是  |
+
+### 7.5 上传文件请求
+用户通过此类请求向server发送文件，可以对文件进行分片，分片大小不大于1MB，支持多线程乱序发送，请求报文在http header 中包含文件名，第一字节内容在文件中的偏移和分片大小，在body中包含文件内容，server收到请求后将验证分片大小是否与分片内容一致，一致时将文件分段写入文件。不一致时将返回errorCode为400的响应
+#### 7.5.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/upload_files
+
+#### 7.5.2 REQUEST
+| header参数  |    参数说明    |  参数类型  |  是否必填  |
+|:---------:|:----------:|:------:| :-----: |
+| File-Name |   文件名   |  字符串  |  是  |
+| Begin-Pos | 开始位置在文件内的偏移 |  字符串  |  是  |
+|   Size    | 文件分片大小 |  字符串  |  是  |
+|  body参数   |  参数说明   |  参数类型  |  是否必填  |
+|     -     | 文件内容 |  字符串  |  是  |
+
+### 7.6 文件认证请求
+用户通过此类请求验证发送到server端的文件是否与期望一致，server端使用两种验证方式，md5值和文件长度，目前已支持文件长度验证。
+#### 7.6.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/check_file
+#### 7.6.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| fileName |           文件名           |  字符串  |  是  |
+| checkSum |        文件对应md5值         |  字符串  |  否  |
+| fileSize |       文件长度(以字节计算)       |  字符串  |  否  |
+| flag | 标记位，为1时校验md5值，为2时校验文件长度 |  字符串  |  是  |
+
+#### 7.6.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| pass | 检查成功为true，否则为false |  bool  |  是  |
+
+### 7.7 批量创建schema请求
+用户通过此类请求批量创建schema，请求报文在http body 中将创建schema的目标子图和schema信息发送给server，如果拿到返回errorCode为200的响应报文即为正常创建
+#### 7.7.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_schema
+#### 7.7.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| graph |   创建目标子图   |  字符串  |  是  |
+| schema | schema描述信息 |  字符串  |  是  |
+
+### 7.8 数据导入请求
+用户通过此类请求导入已经上传的数据文件。导入不论成功或失败，都将删除已上传文件。数据导入请求在server中实现为一个异步任务，响应返回并不意味着导入已完成，返回的是任务id，后续可以通过此任务id查询导入进度
+#### 7.8.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_data
+#### 7.8.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  | 是否必填 |
+|:--------:|:-----------------------:|:------:|:----:|
+| graph |         导入目标子图          |  字符串  |  是   |
+| schema |       导入schema描述        | json字符串  |  是   |
+| delimiter |           分隔符           |  字符串  |  是   |
+| continueOnError |     单行数据出错是否跳过错误并继续     |  boolean  |  否   |
+| skipPackages |         跳过的包个数          |  字符串  |  否   |
+| taskId |  任务id   |  字符串  |  否   |
+| other | 其他参数 |  json字符串  |  否   |
+
+#### 7.8.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| taskId | 任务编号 |  字符串  |  是  |
+
+### 7.9 清理用户上传文件请求
+用户通过此类请求清理已经上传的文件，如果拿到返回errorCode为200的响应报文即为正常清理
+#### 7.9.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/clear_cache
+#### 7.9.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| fileName |    文件名称    |  字符串  |  否  |
+| userName |    用户名称    |  字符串  |  否  |
+| flag | 标记位， flag = 0时删除fileName指定文件, flag = 1时删除userName指定用户已经上传的所有文件， flag = 2时删除所有用户上传的文件 |  字符串  |  是  |
+
+### 7.10. 导入进度查询请求
+用户通过此类请求获得导入任务的状态
+#### 7.10.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_progress
+#### 7.10.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| taskId |           任务编号           |  字符串  |  是  |
+
+#### 7.10.3 RESPONSE
+| body参数 |                  参数说明                   |  参数类型  |  是否必填  |
+|:------:|:---------------------------------------:|:------:| :-----: |
+| state  | 状态标记，为0表示准备导入，为1表示导入中，为2表示导入成功，为3表示导入失败 |  字符串  |  是  |
+|  progress  |             导入进度，state为1时包含             |  字符串  |  否  |
+|  reason  |             失败原因，state为3时包含             |  字符串  |  否  |
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst
new file mode 100644
index 0000000000..bf92f16478
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst
@@ -0,0 +1,8 @@
+生态工具
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/1.cypher.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/1.cypher.md
new file mode 100644
index 0000000000..8de475baeb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/1.cypher.md
@@ -0,0 +1,2320 @@
+# Cypher API
+
+> 此文档主要介绍了TuGraph-Cypher的详细使用说明
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators支持进度一览：
+
+| 类别                                 | 支持                                                                                                        | 待支持                             |
+| ------------------------------------ | ----------------------------------------------------------------------------------------------------------- | ---------------------------------- |
+| General operators                    | `DISTINCT`, `.` for property access                                                                     | `[]` for dynamic property access |
+| Mathematical operators               | `+`, `-`, `*`, `/`, `%`, `^`                                                                    |                                    |
+| Comparison operators                 | `=`, `<>`, `<`, `>`, `<=`, `>=`, `IS NULL`, `IS NOT NULL`                                   |                                    |
+| String-specific comparison operators | `STARTS WITH`, `ENDS WITH`, `CONTAINS`, `REGEXP`                                                    |                                    |
+| Boolean operators                    | `AND`, `OR`, `XOR`, `NOT`                                                                           |                                    |
+| String operators                     | `+` for concatenation                                                                                     |                                    |
+| List operators                       | `+` for concatenation, `IN` to check existence of an element in a list, `[]` for accessing element(s) |                                    |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+```
+MATCH (p:person) RETURN DISTINCT p.born
+```
+
+- ❏ Accessing properties of a nested literal map using the `.` operator
+
+```
+WITH {person: {name: 'Anne', age: 25}} AS p
+RETURN p.person.name
+```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+
+```
+CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+       (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+       (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+```
+
+```
+MATCH (restaurant:Restaurant), (category:Category)
+WHERE restaurant["rating_" + category.name] > 6
+RETURN DISTINCT restaurant.name
+```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator  `^`
+
+```
+WITH 2 AS number, 3 AS exponent
+RETURN number ^ exponent AS result
+```
+
+- ✓ Using the unary minus operator `-`
+
+```
+WITH -3 AS a, 4 AS b
+RETURN b - a AS result
+```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+
+```
+WITH 4 AS one, 3 AS two
+RETURN one > two AS result
+```
+ 
+### 1.5.String-specific comparison operators
+
+- ✓ Using STARTS WITH to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate STARTS WITH 'Jo'
+RETURN candidate
+```
+
+- ✓ Using REGEXP to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate REGEXP 'Jo.*n'
+RETURN candidate
+```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+```
+WITH [2, 4, 7, 9, 12] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number = 4 OR (number > 6 AND number < 10)
+RETURN number
+```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+
+```
+RETURN [1,2,3,4,5]+[6,7] AS myList
+```
+
+- ✓ Using IN to check if a number is in a list
+
+```
+WITH [2, 3, 4, 5] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number IN [2, 3, 8]
+RETURN number
+```
+
+- ✓ Accessing elements in a list using the [] operator
+
+```
+WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+RETURN names[1..3] AS result
+```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses支持进度一览：
+
+| 类别                    | 语法                                  | 备注   |
+| ----------------------- | ------------------------------------- | ------ |
+| Reading clauses         | MATCH                                 | 支持   |
+|                         | OPTIONAL MATCH                        | 支持   |
+|                         | MANDATORY MATCH                       | 待支持 |
+| Projecting clauses      | RETURN … [AS]                        | 支持   |
+|                         | WITH … [AS]                          | 支持   |
+|                         | UNWIND … [AS]                        | 支持   |
+| Reading sub-clauses     | WHERE                                 | 支持   |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | 支持   |
+|                         | SKIP                                  | 支持   |
+|                         | LIMIT                                 | 支持   |
+| Writing clauses         | CREATE                                | 支持   |
+|                         | DELETE                                | 支持   |
+|                         | DETACH DELETE                         | 支持   |
+|                         | SET                                   | 支持   |
+|                         | REMOVE                                | 支持   |
+| Reading/Writing clauses | MERGE                                 | 支持   |
+|                         | CALL […YIELD]                        | 支持   |
+| Set operations          | UNION                                 | 待支持 |
+|                         | UNION ALL                             | 支持   |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+
+  ```
+  MATCH (n)
+  RETURN n
+  ```
+
+  - ✓ Get all nodes with a label
+
+  ```
+  MATCH (movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Related nodes
+
+  ```
+  MATCH (person {name: 'Laurence Fishburne'})-[]-(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Match with labels
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]-(movie:movie)
+  RETURN movie.title
+  ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]->(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Directed relationships and variable
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[r]->(movie)
+  RETURN type(r)
+  ```
+
+  - ✓ Match on relationship type
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})<-[:acted_in]-(actor)
+  RETURN actor.name
+  ```
+
+  - ✓ Match on multiple relationship types
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[:acted_in|:directed]-(person)
+  RETURN person.name
+  ```
+
+  - ✓ Match on relationship type and use a variable
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[r:acted_in]-(actor)
+  RETURN r.role
+  ```
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+
+  ```
+  MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+  RETURN type(r)
+  ```
+
+  - ✓ Multiple relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in]->(movie)<-[:directed]-(director)
+  RETURN movie.title, director.name
+  ```
+
+  - ✓ Variable-length relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in*1..3]-(movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Relationship variable in variable-length relationships
+
+  ```
+  MATCH p = (laurence {name: 'Laurence Fishburne'})-[:acted_in*2]-(co_actor)
+  RETURN p
+  ```
+
+  - ❏ Match with properties on a variable-length path
+
+  ```
+  MATCH p = (charlie:person)-[* {blocked:false}]-(martin:person)
+  WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+  RETURN p
+  ```
+
+  - ✓ Zero-length paths
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})-[*0..1]-(x)
+  RETURN x
+  ```
+
+  - ✓ Named paths
+
+  ```
+  MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+  ```
+
+  - ✓ Matching on a bound relationship
+
+  ```
+  MATCH (a)-[r]->(b)
+  WHERE euid(r)="0_3937_0_0_0"
+  RETURN a,b
+  ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+  CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+  ```
+
+  - ✓ All shortest paths
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+  CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN
+  nodeIds,relationshipIds,cost
+  ```
+- Get node or relationship by id
+
+  - ✓ Node by id
+
+  ```
+  MATCH (n)
+  WHERE id(n)= 0
+  RETURN n
+  ```
+
+  - ✓ Relationship by id
+
+  ```
+  MATCH ()-[r]->()
+  WHERE euid(r) = "0_3937_0_0_0"
+  RETURN r
+  ```
+
+  - ✓ Multiple nodes by id
+
+  ```
+  MATCH (n)
+  WHERE id(n) IN [0, 3, 5]
+  RETURN n
+  ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n
+```
+
+- ✓ Return relationships
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'})-[r:acted_in]->(c)
+RETURN r
+```
+
+- ✓ Return property
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n.born
+```
+
+- ❏ Return all elements
+
+```
+MATCH p = (a {name: 'A'})-[r]->(b)
+RETURN *
+```
+
+- ❏ Variable with uncommon characters
+
+```
+MATCH (`This isn\'t a common variable`)
+WHERE `This isn\'t a common variable`.name = 'A'
+RETURN `This isn\'t a common variable`.happy
+```
+
+- ✓ Aliasing a field
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born AS SomethingTotallyDifferent
+```
+
+- ✓ Optional properties
+
+```
+MATCH (n)
+RETURN n.age
+```
+
+- ❏ Other expressions
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born > 1900, "I'm a literal", (a)-[]->()
+```
+
+`(a)-[]->()`  not supported.
+
+- ✓ Unique results
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})-[]->(b)
+RETURN DISTINCT b
+```
+
+### 2.4.WHERE
+
+- Basic usage
+  - ✓ Boolean operations
+
+  ```
+  MATCH (n)
+  WHERE n.name = 'Laurence Fishburne' XOR (n.born > 1965 AND n.name = 'Carrie-Anne Moss')
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node label
+
+  ```
+  MATCH (n)
+  WHERE n:person
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node property
+
+  ```
+  MATCH (n)
+  WHERE n.born > 2000
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on relationship property
+
+  ```
+  MATCH (n)-[k:acted_in]->(f)
+  WHERE k.role = "Trinity"
+  RETURN f.title
+  ```
+
+  - ❏ Filter on dynamically-computed property
+
+  ```
+  WITH 'AGE' AS propname
+  MATCH (n)
+  WHERE n[toLower(propname)]< 30
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Property existence checking
+
+  ```
+  MATCH (n)
+  WHERE exists(n.born)
+  RETURN n.name, n.born
+  ```
+
+- String matching
+  - ✓ Match the beginning of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name STARTS WITH 'Pet'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match the ending of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name ENDS WITH 'ter'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match anywhere within a string
+
+  ```
+  MATCH (n)
+  WHERE n.name CONTAINS 'ete'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ String matching negation
+
+  ```
+  MATCH (n)
+  WHERE NOT n.name ENDS WITH 's'
+  RETURN n.name, n.born
+  ```
+
+- Using path patterns in `WHERE`
+  - ❏ Filter on patterns
+
+  ```
+  MATCH (tobias {name: 'Tobias'}), (others)
+  WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+  RETURN others.name, others.age
+  ```
+
+  - ❏ Filter on patterns using NOT
+
+  ```
+  MATCH (persons), (peter {name: 'Peter'})
+  WHERE NOT (persons)-[]->(peter)
+  RETURN persons.name, persons.age
+  ```
+
+  - ❏ Filter on patterns with properties
+
+  ```
+  MATCH (n)
+  WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Filter on relationship type
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name='Laurence Fishburne' AND type(r) STARTS WITH 'ac'
+  RETURN type(r), r.role
+  ```
+
+- Lists
+  - ✓ IN operator
+
+  ```
+  MATCH (a)
+  WHERE a.name IN ['Laurence Fishburne', 'Tobias']
+  RETURN a.name, a.born
+  ```
+
+- Missing properties and values
+  - ✓ Default to false if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white'
+  RETURN n.name, n.age, n.belt
+  ```
+
+  - ✓ Default to true if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+  ORDER BY n.name
+  ```
+
+  - ✓ Filter on null
+
+  ```
+  MATCH (person)
+  WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+  person.belt
+  ```
+
+- Using ranges
+  - ✓ Simple range
+
+  ```
+  MATCH (a)
+  WHERE a.name >= 'Peter'
+  RETURN a.name, a.born
+  ```
+
+  - ✓ Composite range
+
+  ```
+  MATCH (a)
+  WHERE a.name > 'Andres' AND a.name < 'Tobias'
+  RETURN a.name, a.born
+  ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 3
+```
+
+- ✓ Return middle two records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 1
+LIMIT 2
+```
+
+- ❏ Using an expression with SKIP to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP toInteger(3*rand())+ 1
+```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT 3
+```
+
+- ❏ Using an expression with LIMIT to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT toInteger(3 * rand())+ 1
+```
+
+### 2.7.CREATE
+
+- Create nodes
+
+> **Note**
+> TuGraph不支持创建空的nodes，不支持多labels。
+
+  - ☒ Create single node
+
+  ```
+  CREATE (n)
+  ```
+
+  - ☒ Create multiple nodes
+
+  ```
+  CREATE (n), (m)
+  ```
+
+  - ☒ Create a node with a label
+
+  ```
+  CREATE (n:person)
+  ```
+
+  - ☒ Create a node with multiple labels
+
+  ```
+  CREATE (n:Person:Swedish)
+  ```
+
+  - ✓ Create node and add labels and properties
+
+  ```
+  CREATE (n:person {id:2001, name: 'Andres'})
+  ```
+
+  - ✓ Return created node
+
+  ```
+  CREATE (n:person {id:2002, name: 'Andres'})
+  RETURN n
+  ```
+
+- Create relationships
+  - ✓ Create a relationship between two nodes
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:write]->(m)
+  ```
+
+  - ✓ Create a relationship and set properties
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:acted_in{role: 'Trinity'}]->(m)
+  ```
+
+  - ❏ Create a full path
+
+  ```
+  CREATE p = (andres:person {id: 2005, name:'Andres'})-[:acted_in {role: 'Trinity'}]->
+  (m:movie {id: 2006})<-[:acted_in {role: 'Trinity'}]-(michael {id: 2006, name:'Michael'})
+  RETURN p
+  ```
+
+- Use parameters with CREATE
+  - ❏ Create node with a parameter for the properties
+
+  ```
+  CREATE (n:Person $props)
+  RETURN n
+  ```
+
+  - ☒ Create multiple nodes with a parameter for their properties
+
+  ```
+  UNWIND $props AS map
+  CREATE (n)
+  SET n = map
+  ```
+  cannot create vertex without label.
+
+### 2.8.CALL[…YIELD]
+
+- ✓ Call a procedure using CALL
+
+```
+CALL db.vertexLabels
+```
+
+- ✓ View the signature for a procedure
+
+```
+CALL dbms.procedures() YIELD name, signature
+RETURN signature
+```
+
+- ❏ Call a procedure using a quoted namespace and name
+
+```
+CALL `db`.`vertexLabels`
+```
+
+- ✓ Call a procedure with literal arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+```
+
+- ❏ Call a procedure with parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+```
+
+- ❏ Call a procedure with mixed literal and parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+```
+
+- ✓ Call a procedure with literal and default arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+```
+
+- ✓ Call a procedure within a complex query using CALL…YIELD
+
+```
+CALL db.vertexLabels() YIELD label
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure and filter its results
+
+```
+CALL db.vertexLabels() YIELD label
+WHERE label CONTAINS 'User'
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure within a complex query and rename its outputs
+
+```
+CALL db.propertyKeys() YIELD propertyKey AS prop
+MATCH (n)
+WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+
+```
+MATCH (n:person)
+RETURN n.name AS name
+UNION ALL MATCH (n:movie)
+RETURN n.title AS name
+```
+
+- ❏ Combine two queries and remove duplicates
+
+```
+MATCH (n:Actor)
+RETURN n.name AS name
+UNION
+MATCH (n:Movie)
+RETURN n.title AS name
+```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| 种类                   | 功能               | 备注                      |
+| ---------------------- | ------------------ | ------------------------- |
+| Predicate functions    | exists()           |                           |
+|                        | all()              | 不支持                    |
+|                        | any()              | 不支持                    |
+|                        | single()           | 不支持                    |
+|                        | none()             | 不支持                    |
+| Scalar functions       | id()               |                           |
+|                        | euid()             |                           |
+|                        | properties()       |                           |
+|                        | head()             |                           |
+|                        | last()             |                           |
+|                        | toBoolean()        |                           |
+|                        | toFloat()          |                           |
+|                        | toInteger()        |                           |
+|                        | toString()         |                           |
+|                        | type()             |                           |
+|                        | startnode()        |                           |
+|                        | endnode()          |                           |
+|                        | size()             |                           |
+|                        | length()           |                           |
+|                        | label()            | OpenCypher扩展方法      |
+| Aggregating functions  | avg()              |                           |
+|                        | collect()          |                           |
+|                        | count()            |                           |
+|                        | max()              |                           |
+|                        | min()              |                           |
+|                        | percentileCont()   |                           |
+|                        | percentileDisc()   |                           |
+|                        | stDev()            |                           |
+|                        | stDevP()           |                           |
+|                        | variance()         |                           |
+|                        | varianceP()        |                           |
+|                        | sum()              |                           |
+| List functions         | keys()             |                           |
+|                        | labels()           | 返回结果有且只有一个label |
+|                        | nodes()            |                           |
+|                        | range()            |                           |
+|                        | subscript()        | 不支持                    |
+| Mathematical functions | abs()              |                           |
+|                        | ceil()             |                           |
+|                        | floor()            |                           |
+|                        | rand()             |                           |
+|                        | round()            |                           |
+|                        | sign()             |                           |
+| String functions       | /                  |                           |
+
+### 3.2.Predicate functions
+
+- exists()
+  judge it whether a vertex or edge has the field  .
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+WHERE exists(n.born)
+RETURN n.name, n.born
+```
+
+**Example output:**
+
+| exists(name) |
+| ------------ |
+| true         |
+
+### 3.3.Scalar functions
+
+- id()
+  get the id of vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN id(a)
+```
+
+**Example output:**
+
+| vid |
+| --- |
+| 1   |
+| 2   |
+| ... |
+
+- properties()
+  get  a map containing all the properties of a node or relationship.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person {name: 'Laurence Fishburne'})
+RETURN n
+```
+
+- head()
+  get the first element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, head(coll)
+```
+
+**Example output:**
+
+| coll                  | head(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "one"         |
+
+- last()
+  get the last element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, last(coll)
+```
+
+**Example output:**
+
+| coll                  | last(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "three"       |
+
+- toFloat()
+  Converts an integer or string value to a floating point number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toFloat('11.5')
+```
+
+**Example output:**
+
+| float |
+| ----- |
+| 11.5  |
+
+- toInteger()
+  Converts a floating point or string value to an integer value.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toInteger('2.3') AS integer
+```
+
+**Example output:**
+
+| integer |
+| ------- |
+| 2       |
+
+- toString()
+  Converts an integer, float, boolean value to a string.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toString(2.3)
+```
+
+- type()
+  get the string representation of the relationship type.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)-[r]->()
+WHERE n.name = 'Laurence Fishburne'
+RETURN type(r)
+```
+
+**Example output:**
+
+| type     |
+| -------- |
+| acted_in |
+| acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+  Returns the average of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN avg(n.born)
+```
+
+**Example output:**
+
+| avg(n.born)        |
+| ------------------ |
+| 1869.2661654135338 |
+
+- collect()
+  Returns a list containing the values returned by an expression.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN collect(n.born)
+```
+
+**Example output:**
+
+| collect(n.born) |
+| --------------- |
+| [1967,...]      |
+
+- count()
+  Returns the number of values or records.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n {name: 'Laurence Fishburne'})-[]->(x)
+RETURN labels(n), n.born, count(*)
+```
+
+**Example output:**
+
+| labels(n)  | n.born | count(*) |
+| ---------- | ------ | -------- |
+| ["person"] | 1961   | 3        |
+
+- max()
+  Returns the maximum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN max(n.born)
+```
+
+**Example output:**
+
+| max(n.born) |
+| ----------- |
+| 2003        |
+
+- min()
+  Returns the minimum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN min(n.born)
+```
+
+**Example output:**
+
+| min(n.born) |
+| ----------- |
+| 1000        |
+
+- percentileCont()
+  Returns the percentile of a value over a group using linear interpolation.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileCont(n.born, 0.4)
+```
+
+**Example output:**
+
+| percentileCont(n.born, 0.4) |
+| --------------------------- |
+| 1953                        |
+
+- percentileDisc()
+  Returns the nearest value to the given percentile over a group using a rounding method.
+  **Scope:** whole instance.
+  **Output:** the percentile of the given value over a group.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileDisc(n.born, 0.5)
+```
+
+**Example output:**
+
+| percentileDisc(n.age, 0.5) |
+| -------------------------- |
+| 1959                       |
+
+- stDev()
+  Returns the standard deviation for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDev(n.born)
+```
+
+**Example output:**
+
+| stDev(n.born)      |
+| ------------------ |
+| 279.53117993401725 |
+
+- stDevP()
+  Returns the standard deviation for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDevP(n.born)
+```
+
+**Example output:**
+
+| stDevP(n.born)     |
+| ------------------ |
+| 279.3209270423399  |
+
+- variance()
+  Returns the variance for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN variance(n.born)
+```
+
+**Example output:**
+
+| variance(n.age)   |
+| ----------------- |
+| 78137.68055530392 |
+
+- varianceP()
+  Returns the variance for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN varianceP(n.born)
+```
+
+**Example output:**
+
+| varianceP(n.age)  |
+| ----------------- |
+| 78020.18028379219 |
+
+- sum()
+  Returns the sum of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN sum(n.born)
+```
+
+**Example output:**
+
+| sum(n.born) |
+| ----------- |
+| 1243062     |
+
+### 3.5.List Funtions:
+
+- keys()
+  get the field names of some vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN keys(a) LIMIT 1
+```
+
+**Example output:**
+
+| keys(a)               |
+| --------------------- |
+| ["name","age","eyes"] |
+
+- labels()/label()
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN labels(a) LIMIT 1
+```
+
+**Example output:**
+
+| labels                 |
+| ---------------------- |
+| ["Person"]             |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice"})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+
+### 3.6.Mathematical functions
+
+- abs()
+  get the absolute value of some data.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a:person {name: 'Laurence Fishburne'}),
+(e:person {name: 'Carrie-Anne Moss'})
+RETURN a.born, e.born, abs(a.born-e.born)
+```
+
+**Example output:**
+
+| a.born | e.born | abs(a.born - e.born) |
+| ------ | ------ | -------------------- |
+| 38     | 41     | 1                    |
+
+- ceil()
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN ceil(0.1)
+```
+
+**Example output:**
+
+| ceil(0.1) |
+| --------- |
+| 1.0       |
+
+- floor()
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN floor(0.9)
+```
+
+**Example output:**
+
+| floor(0.9) |
+| ---------- |
+| 0.0        |
+
+- round()
+  Returns the value of a number rounded to the nearest integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN round(3.141592)
+```
+
+**Example output:**
+
+| round |
+| ----- |
+| 3     |
+
+- rand()
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN rand()
+```
+
+**Example output:**
+
+| rand()             |
+| ------------------ |
+| 0.9797131960534085 |
+
+- sign()
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN sign(-17), sign(0.1)
+```
+
+**Example output:**
+
+| sign(-17) | sign(0.1) |
+| --------- | --------- |
+| -1        | 1         |
+
+TuGraph 查询语言与 OpenCypher 的不同点如下：
+
+- Label 数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 4.附录1. 语法扩充及不同
+
+TuGraph查询语言与OpenCypher的不同点如下：
+
+- Label数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.附录2. 内置procedures列表
+### 5.1.procedures样例
+
+* dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                        | name         |
+  | ---------------------------------------------------- | -------------------- |
+  | db.vertexLabels() :: (label::STRING)               | db.vertexLabels        |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels |
+  | db.indexes() :: (index::LIST)            | db.indexes       |
+  | ...                          | ...          |
+
+* db.subgraph()
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | vids       | list           | list of vertex id                                                     |
+
+  **Output:**
+
+  Get a json containing all the properties of nodes and relationships.
+
+  **Example input:**
+
+  ```
+  CALL db.subgraph([3937,4126,4066,4010])
+  ```
+
+  **Example output**
+
+  | subgraph |
+  | -------- |
+  | {"nodes":[{"identity":3937,"label":"movie","properties":{"duration":136,"id":1,"poster_image":"http://image.tmdb.org/t/p/w185/gynBNzwyaHKtXqlEKKLioNkjKgN.jpg","rated":"R","summary":"Thomas A. Anderson is a man living two lives. By day he is an average computer programmer and by night a malevolent hacker known as Neo who finds himself targeted by the police when he is contacted by Morpheus a legendary computer hacker who reveals the shocking truth about our reality.","tagline":"Welcome to the Real World.","title":"The Matrix"}},{"identity":4010,"label":"user","properties":{"id":44,"login":"Howard"}},{"identity":4066,"label":"user","properties":{"id":202,"login":"Enoch"}},{"identity":4126,"label":"user","properties":{"id":464,"login":"Wilburn"}}],"relationships":[{"dst":4126,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4010,"temporal_id":0},{"dst":4010,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4066,"temporal_id":0},{"dst":4066,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4126,"temporal_id":0}]} |
+
+* db.vertexLabels()
+
+  Lists all available vertex labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+  **Example output:**
+
+    | label   |
+    | ------- |
+    | genre   |
+    | keyword |
+    | movie   |
+    | ...     |
+
+* db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edge labels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | relationshipType |
+  | ---------------- |
+  | acted_in     |
+  | directed     |
+  | ...          |
+
+* db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of  vertex label    |
+  | primary_field | string  | primary field of vertex label |
+  | field_spec | list       | specification of a field |
+
+   in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+    **Output:** If successful, it returns a success message.
+
+    **Example input:**
+
+    ```
+    CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+    ```
+
+    **Example output:**
+
+    ```
+    Added label [Person]
+    ```
+
+* db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description           |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field         |
+  | type       | string     | type of the field         |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name     | type   | optional |
+  | ------------ | ------ | -------- |
+  | id       | INT32  | false    |
+  | born     | INT32  | true     |
+  | name     | STRING | true     |
+  | poster_image | STRING | true     |
+
+* db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | extra      | string     | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.
+    for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+* db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:**
+
+  | field_name | field_type | description              |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description           |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string      | either 'vertex' or 'edge'     |
+  | label_name  | string      | name of the label         |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description           |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string     | either 'vertex' or 'edge' |
+  | label_name       | string     | name of the label     |
+  | field_value_spec | list       | specification of a field  |
+
+    in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, optional]`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+    ```
+    CALL db.alterLabelModFields(
+    'vertex',
+    'new_label',
+    ['birth_date', DATETIME, true],
+    ['gender', BOOL, true])
+    ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of the label    |
+  | edge_constraints | string | edge constraints |
+  | field_spec | list       | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for  optional fields.
+
+  `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+* db.addIndex(label_name, field_name, is_unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | is_unique  | boolean    | Specifies whether the index is unique |
+
+   **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+   **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+* dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description      |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string     | the current password |
+  | new_password     | string     | new password     |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+   **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string     | the user's name |
+  | new_password | string     | new password    |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.createUser(user_name, password)
+
+  create  new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | -------------------------------- |
+  | user_name | string     | the new user name        |
+  | password  | string     | the password of new user     |
+  
+   **Output:**
+  
+    If successful, it returns a success message.
+  
+   **Example input:**
+  
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+  
+   **Example output:**
+  
+  ```
+  true
+  ```
+  
+* dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string     | the user name to be deleted |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+   a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string     | the user name           |
+  | is.admin  | boolean    | the permission of this user |
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       |  ...    |
+
+* dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+    a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description       |
+  | --------- | -------------- | --------------------- |
+  | user.user | string     | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+* dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+   a list of  ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host     |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...      |
+
+* dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+   the number of ip which been deleted.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+    the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description              |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string     | the name of new subgraph     |
+  | description | string     | description of new subgraph      |
+  | max_size_GB | integer    | Upper limit of subgraph capacity |
+
+   **Output:**
+
+    if successful , it will return true.
+
+   **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+   **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+  | config     | map        | the configuration to be modified     |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.listGraphs()
+
+  get all subgraphs in this graph database.
+
+  **Output:**
+
+    a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+
+* dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+    | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+* dbms.config.list()
+
+  get config of this graph database.
+
+  **Output:**
+
+    a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  |-----------| ---------|
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       |  ...    |
+
+* dbms.config.update(updates)
+
+  get some config of this graph database.
+
+  **Output:**
+
+    If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+    enable_ip_check:false,
+    durable:true,
+    optimistic_txn:true,
+    enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+* dbms.takeSnapshot()
+
+  take the  snapshot  on this current graph database.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+* dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path               |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+* algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                          |
+  | --------- | -------------- | ------------------------------------------------------------ |
+  | startNode | Node       | the source node of paths                     |
+  | endNode   | Node       | the destination node paths                   |
+  | config    | MAP        | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+    If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2     | 1     |
+
+* algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+* algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                        |
+  | --------- | -------------- | ---------------------------------------------------------- |
+  | id    | ANY        | the id of vertexes or edges , the id must be variable      |
+  | config    | MAP        | the configuration of  this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or  it is an edge id.
+
+  **Output:**
+
+    If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.内置procedures完整列表
+
+| Name                                  | Description                           | Signature                                                                                                                                                        |
+|---------------------------------------|---------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.subgraph                           | 列出点的子图                                | db.subgraph(vids::LIST) :: (subgraph::STRING)                                                                                                                    |
+| db.vertexLabels                       | 列出所有Vertex Label                      | db.vertexLabels() :: (label::STRING)                                                                                                                             |
+| db.edgeLabels                         | 列出所有Edge Label                        | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                          |
+| db.indexes                            | 列出所有索引                                | db.indexes() :: (label::STRING,field::STRING,unique::BOOLEAN)                                                                                                    |
+| db.listLabelIndexes(label_name)       | 列出所有与某个Label相关的索引                     | db.listLabelIndexes(label_name:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN)                                                                          |
+| db.warmup                             | 预热数据                                  | db.warmup() :: (time_used::STRING)                                                                                                                               |
+| db.createVertexLabel                  | 创建Vertex Label                        | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                           |
+| db.createLabel                        | 创建Vertex/Edge Label                   | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                      |
+| db.getLabelSchema                     | 列出label schema                        | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                        |
+| db.getVertexSchema                    | 列出点的 schema                           | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                               |
+| db.getEdgeSchema                      | 列出边的 schema                           | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                 |
+| db.deleteLabel                        | 删除Vertex/Edge Label                   | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                |
+| db.alterLabelDelFields                | 修改label删除属性                           | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                     |
+| db.alterLabelAddFields                | 修改label添加field                        | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                          |
+| db.alterLabelModFields                | 修改label field                         | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                |
+| db.createEdgeLabel                    | 创建Edge Label                          | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                              |
+| db.addIndex                           | 创建索引                                  | db.addIndex(label_name::STRING,field_name::STRING,is_unique::BOOLEAN) :: (::VOID)                                                                                |
+| db.deleteIndex                        | 删除索引                                  | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                |
+| db.backup                             | 备份数据                                  | db.backup(destination::STRING) :: ()                                                                                                                             |
+| dbms.procedures                       | 列出所有procedures                        | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                            |
+| dbms.security.changePassword          | 更改当前用户的密码                             | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                          |
+| dbms.security.changeUserPassword      | 更改指定用户的密码                             | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                             |
+| dbms.security.createUser              | 创建用户                                  | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                         |
+| dbms.security.deleteUser              | 删除用户                                  | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.listUsers               | 列出所有用户                                | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                  |
+| dbms.security.showCurrentUser         | 列出当前用户信息                              | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                        |
+| dbms.security.getUserPermissions      | 列出指定用户的权限                             | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                          |
+| dbms.graph.createGraph                | 创建子图                                  | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                |
+| dbms.graph.modGraph                   | 修改子图属性                                | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                  |
+| dbms.graph.deleteGraph                | 删除子图                                  | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                           |
+| dbms.graph.listGraphs                 | 列出所有子图                                | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                               |
+| dbms.graph.getGraphInfo               | 列出指定子图的信息                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                             |
+| dbms.security.addAllowedHosts         | 添加ip到信任列表                             | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                 |
+| dbms.security.deleteAllowedHosts      | 从信任列表删除ip                             | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                      |
+| dbms.security.listAllowedHosts        | 列出信任列表中的主机ip                          | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                               |
+| dbms.config.update                    | 更新TuGraph配置                           | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                            |
+| dbms.config.list                      | 列出TuGraph配置                           | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                  |
+| algo.shortestPath                     | 查询两个点间的最短路径                           | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                            |
+| algo.allShortestPaths                 | 查询两个点间的所有最短路径                         | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                             |
+| algo.native.extract                   | 查询指定VertexId/EdgeUid（列表）指定field的值（列表） | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                         |
+| db.flushDB                            | 刷新db                                  | db.flushDB() :: (::VOID)                                                                                                                                         |
+| dbms.security.listRoles               | 列出所有角色                                | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                  |
+| dbms.security.createRole              | 创建角色                                  | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                             |
+| dbms.security.deleteRole              | 删除角色                                  | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.getRoleInfo             | 获取角色详细信息                              | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                      |
+| dbms.security.disableRole             | 禁用/启用角色                               | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.modRoleDesc             | 修改角色描述信息                              | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.rebuildRoleAccessLevel  | 删除角色权限并重建                             | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                 |
+| dbms.security.modRoleAccessLevel      | 修改角色对指定图的访问权限                         | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                     |
+| dbms.security.modRoleFieldAccessLevel | 修改角色对指定属性的访问权限                        | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)          |
+| dbms.security.getUserInfo             | 获取用户详细信息                              | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                      |
+| dbms.security.disableUser             | 禁用/启用用户                               | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                             |
+| dbms.security.setCurrentDesc          | 设置当前用户描述信息                            | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.setUserDesc             | 设置用户描述信息                              | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                          |
+| dbms.security.getUserMemoryUsage      | 获取用户内存用量                              | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                        |
+| dbms.security.setUserMemoryLimit      | 设置用户内存限制                              | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                  |
+| dbms.security.deleteUserRoles         | 删除用户与角色的联系                            | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                              |
+| dbms.security.rebuildUserRoles        | 清空用户角色的关系并重建                          | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                             |
+| dbms.security.addUserRoles            | 新增用户与角色的联系                            | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                 |
+| db.plugin.loadPlugin                  | 装载plugin                              | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN,version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | 删除plugin                              | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                      |
+| db.plugin.listPlugin                  | 列出已装载的plugin                          | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | 获取plugin的详细信息                         | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                   |
+| db.plugin.callPlugin                  | 执行plugin                              | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)             |
+| db.importor.dataImportor              | 导入点或边数据                               | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                      |
+| db.importor.schemaImportor            | 导入点或边schema                           | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                      |
+| db.addFullTextIndex                   | 添加全文索引                                | db.addFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                      |
+| db.deleteFullTextIndex                | 删除全文索引                                | db.deleteFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                   |
+| db.rebuildFullTextIndex               | 重建全文索引                                | db.rebuildFullTextIndex(vertex_labels::STRING, edge_labels::STRING) :: (::VOID)                                                                                  |
+| db.fullTextIndexes                    | 查看全文索引                                | db.fullTextIndexes() :: (is_vertex::BOOLEAN, label::STRING, field::STRING)                                                                                       |
+| dbms.meta.count                       | 查看点边总数                                | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                          |
+| dbms.meta.countDetail                 | 查看点边总数详情                              | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                |
+| dbms.meta.refreshCount                | 重新统计点边数量，统计期间停写。                      | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                          |
+| dbms.task.listTasks                   | 查询正在执行的任务                             | dbms.task.listTasks()::(tasks::LIST)                                                                                                                             |
+| dbms.task.terminateTask               | 中止任务                                  | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                               |
+| dbms.ha.clusterInfo                   | HA模式下查看集群状态                           | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                |
+| db.dropDB                             | 清空数据库                                 | db.dropDB() :: (::VOID)                                                                                                                                          |
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md
new file mode 100644
index 0000000000..6e4cc06827
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md
@@ -0,0 +1,18 @@
+# ISO GQL 简介
+
+Graph Query Language(GQL, 图查询语言)是一种国际标准语言，用于属性图查询，该语言建立在SQL的基础上，并整合了现有的[openCypher、PGQL、GSQL和G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/)语言的成熟思想。目前该标准仍然处于草稿阶段。
+
+TuGraph基于[ISO GQL (ISO/IEC 39075) Antlr4 语法文件](https://github.com/TuGraph-family/gql-grammar)实现了GQL，并做了一些扩展与改造。目前并未完全支持所有的GQL语法，我们会在未来逐步完善。
+
+## 子句列表
+
+| 类别                | 子句           |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md
new file mode 100644
index 0000000000..3798f5661d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md
@@ -0,0 +1,100 @@
+# MATCH
+
+`MATCH`子句式是GQL最基础的子句，几乎所有查询都是通过 `MATCH`展开。
+
+`MATCH`子句用于指定在图中搜索的匹配模式，用来匹配满足一定条件的点或者路径。
+
+## 基本用法
+
+### 点查询
+
+#### 查询所有点
+
+```
+MATCH (n)
+RETURN n
+```
+
+#### 查询特定标签的点
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+#### 通过属性匹配点
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### 通过过滤条件匹配点
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+### 边查询
+
+#### 出边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+#### 入边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+#### 带过滤条件的边匹配
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+返回结果
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+### 路径匹配
+
+#### 不定跳查询
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md
new file mode 100644
index 0000000000..246e87fda9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md
@@ -0,0 +1,30 @@
+# OPTIONAL MATCH
+
+`OPTIONAL MATCH`匹配图模式，如果未命中，则返回`null`。
+
+## 基本用法
+
+### 查询命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+### 查询未命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+返回结果
+
+```JSON
+[{"n.birthyear":null}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md
new file mode 100644
index 0000000000..3775b5e2fb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md
@@ -0,0 +1,110 @@
+# RETURN
+
+`RETURN`子句指定返回结果，包括返回点、边、路径、属性等。
+
+## 基本用法
+
+### 返回点
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+### 返回边
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+### 返回属性
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+### 不常见字符串作为变量名
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+### 列别名
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+### 可选属性
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+### 其它表达式
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+### 结果唯一性
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+返回结果
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md
new file mode 100644
index 0000000000..87612e184f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md
@@ -0,0 +1,20 @@
+# NEXT
+
+`NEXT`子句用于连接多个子句。
+
+## 基本用法
+
+### 连接MATCH
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md
new file mode 100644
index 0000000000..44817da5dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md
@@ -0,0 +1,49 @@
+# WHERE
+
+`WHERE`子句用于过滤记录。
+
+## 基本用法
+
+### 过滤点
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+### 过滤边
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+返回结果
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+### 布尔表达式
+
+`AND`, `OR`, `XOR`和 `NOT`布尔表达式可以用在 `WHERE`中用来过滤数据。
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md
new file mode 100644
index 0000000000..56d0566a67
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md
@@ -0,0 +1,19 @@
+# ORDER BY
+
+`ORDER BY`是`RETURN`的子句，对输出的结果进行排序。
+
+## 基本用法
+
+### 对结果排序
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+返回结果
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md
new file mode 100644
index 0000000000..398429d355
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md
@@ -0,0 +1,30 @@
+# SKIP
+
+`SKIP`指定结果偏移行数。
+
+## 基本用法
+
+### 未使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md
new file mode 100644
index 0000000000..f47733baaa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md
@@ -0,0 +1,17 @@
+# LIMIT
+
+`LIMIT`限制结果行数。
+
+## 基本用法
+
+### 使用LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst
new file mode 100644
index 0000000000..770aa58ee2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst
@@ -0,0 +1,8 @@
+GQL子句
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/index.rst
new file mode 100644
index 0000000000..e39c0a8e24
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/index.rst
@@ -0,0 +1,9 @@
+GQL
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.intro.md
+   2.clauses/index.rst
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/index.rst
new file mode 100644
index 0000000000..027d7cc49a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/1.query/index.rst
@@ -0,0 +1,9 @@
+查询语言
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.cypher.md
+   2.gql/index.rst
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..418a3cad66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
@@ -0,0 +1,207 @@
+# OLAP API
+
+> 本文档是为TuGraph的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对TuGraph的图计算运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于Tugraph的一个简单的[BFS(宽度优先搜索)](https://en.wikipedia.org/wiki/Breadth-first_search "wikipedia")程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图分析引擎介绍
+
+TuGraph的图分析引擎，面向的场景主要是全图/全量数据分析类的任务。借助TuGraph的 C++ / Python 图分析引擎 API ，用户可以对不同数据来源的图数据快速导出一个待处理的复杂子图，然后在该子图上运行诸如PageRank、LPA、WCC等迭代式图算法，最后根据运行结果做出相应的对策。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph图计算系统社区版内置6个算法，商业版内置了25种算法，用户几乎不需要自己实现具体的图计算过程。其详细介绍可参考algorithms.md。
+
+根据数据来源及实现不同，可分为Procedure、Embed和Standalone三种运行方式，均继承于OlapBase API，OlapBase API接口文档可参考olapbase-api.md。
+
+其中Procedure和Embed的数据来源是图数据库中预加载的db数据，可以分别编译生成tugraph-web加载使用的.so文件和后台终端使用的embed文件，输入的图数据均通过db的加载形式，其接口文档可参考olapondb-api.md。
+Standalone用于编译生成standalone文件，区别于前者，该文件的输入图数据通过txt、二进制、ODPS文件的形式加载，其接口文档可参考olapondisk-api.md。
+
+## 2. Procedure 编译与运行
+
+该种方式主要用于tugraph-web界面进行可视化加载及运行。使用方法如下：
+
+### C++:
+在tugraph-db/procedures 目录下执行`bash make_so_cpp.sh bfs`即可在tugraph-db/procedures目录下得到bfs.so文件，将该文件以插件形式上传至tugraph-web，输入参数后即可执行。
+
+### Python:
+在tugraph-web的前端将python文件以插件形式上传，输入参数后即可执行。
+
+示例：
+在tugraph-db/procedures 编译.so算法文件
+`bash make_so_cpp.sh bfs`
+
+将bfs.so（或tugraph-db/procedures/algo_cython/bfs.py）文件以插件形式加载至tugraph-web后，输入如下json参数：
+
+```json
+{
+    "root_id":"0",
+    "label":"node",
+    "field":"id"
+}
+```
+即可得到返回结果如下。
+
+```json
+{
+  "core_cost": 0.013641119003295898,
+  "found_vertices": 3829,
+  "num_edges": 88234,
+  "num_vertices": 4039,
+  "output_cost": 8.821487426757813e-06,
+  "prepare_cost": 0.03479194641113281,
+  "total_cost": 0.04844188690185547
+}
+```
+
+输出内容解释如下：
+- core_cost: 表示算法运行所需要的时间。
+- found_vertices: 表示查找到点的个数。
+- num_edges: 表示该图数据的边数量。
+- num_vertices: 表示该图数据点的数量。
+- output_cost: 表示算法结果写回db所需要的时间。
+- prepare_cost: 表示预处理阶段所需要的时间。预处理阶段的工作：加载参数、图数据加载、索引初始化等。
+- total_cost: 表示执行该算法整体运行时间。
+
+make_so.sh文件介绍：该文件用于将TuGraph-OLAP所涉及到的图算法文件编译成一个可供tugraph-web使用的.so文件。
+
+## 3. Embed 编译与运行
+
+该种方式主要用于TuGraph在后台程序中对预加载的db图数据进行算法分析。其使用方法如下：
+在tugraph-db/procedures 目录下对embed_main.cpp文件完善，补充数据名称、输入参数、数据路径等信息，示例如下：
+
+### C++:
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path表示预加载图数据存放的路径
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // 指定图数据的名称
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // 以json形式输入算法参数
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+保存后在tugraph-db/procedures 目录下执行`bash make_embed.sh bfs`即可在tugraph-db/procedures/algo_cpp 目录下得到bfs_procedure文件。
+
+在tugraph-db/procedures 文件夹下执行`./algo_cpp/bfs_procedure` 即可得到返回结果：
+
+```json
+{
+  "core_cost":0.025603055953979492,
+  "found_vertices":3829,
+  "num_edges":88234,
+  "num_vertices":4039,
+  "output_cost":9.059906005859375e-06,
+  "prepare_cost":0.056738853454589844,
+  "total_cost":0.0823509693145752
+}
+```
+
+参数解释同上。
+
+### Python：
+在tugraph-db/procedures文件夹下执行
+`bash make_so_cython.sh bfs`
+或在tugraph-db/procedures/algo_cython文件夹下执行
+`python3 setup.py build_ext -i`
+得到bfs.so后，在Python中import bfs可使用，如tugraph-db/procedures/run_embed.py所示
+
+```python
+# tugraph-db/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+```
+通过如下命令执行
+
+```bash
+python3 run_embed.py
+```
+
+输出结果与C++相同。
+
+## 4. Standalone 编译与运行
+
+该文件主要用于在终端处直接加载图数据，并运行打印输出结果。使用方法如下：
+在tugraph-db/build目录下执行`make bfs_standalone` (需要在g++默认include路径中包含boost/sort/sort.hpp)即可得到bfs_standalone文件,该文件生成于tugraph-db/build/output/algo文件夹下。
+运行方式：在tugraph-db/build目录下执行`./output/algo/bfs_standalone -–type [type] –-input_dir [input_dir] --id_mapping [id_mapping] -–vertices [vertices] --root [root] –-output_dir [output_dir]`即可运行。
+
+- `[type]`：表示输入图文件的类型来源，包含text文本文件、BINARY_FILE二进制文件和ODPS源。
+- `[input_dir]`：表示输入图文件的文件夹路径，文件夹下可包含一个或多个输入文件。TuGraph在读取输入文件时会读取[input_dir]下的所有文件，要求[input_dir]下只能包含输入文件，不能包含其它文件。参数不可省略。
+- `[id_mapping]`：当读入边表时，是否对输入数据做id映射，使达到符合算法运行的形式。1为需要做id映射，0为不需要做。该过程会消耗一定时间。参数可省略，默认值为0。
+- `[vertices]`：表示图的点个数，为0时表示用户希望系统自动识别点数量；为非零值时表示用户希望自定义点个数，要求用户自定义点个数需大于最大的点ID。参数可省略，默认值为0。
+- `[root]`：表示进行bfs的起始点id。参数不可省略。
+- `[output_dir]`：表示输出数据保存的文件夹路径，将输出内容保存至该文件中，参数不可省略。
+
+示例：
+
+### C++:
+在tugraph-db/build编译standalone算法程序
+
+```bash
+make bfs_standalone
+```
+
+在tugraph-db/build/output目录下运行text源文件
+
+```bash
+./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+得到运行结果：
+
+```text
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+结果参数解释同上。
+
+对于新的算法，运行时不了解该算法的所需参数时，可通过`./output/algo/bfs_standalone -h`进行查阅对应参数。
+
+### Python:
+Python语言的bfs拓展编译过程与embed模式无区别，在运行时通过`Standalone`接口调用，示例如下：
+```python
+# tugraph-db/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(input_dir=
+                             "../test/integration/data/algo/fb_unweighted",
+                             root=0)
+```
+
+通过如下命令执行
+
+```bash
+python3 run_standalone.py
+```
+
+至此，通过TuGraph对上图进行bfs运算的过程已经完成。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..6991d63290
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
@@ -0,0 +1,179 @@
+# OlapBase API
+
+> 此文档主要详细介绍了OlapBase API的使用说明
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统需要的简单配置，同时结合代码对TuGraph中几个共同的重要文件和接口进行解释。
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+
+## 3. 原子操作
+
+TuGraph使用了多线程技术进行批处理操作，在这种情况下可能会出现访存冲突现象。为了保证并行计算时修改操作的正确性，TuGraph实现了原子操作。代码部分见lgraph文件夹下的lgraph_atomic.cpp文件。
+TuGraph还自定义了4个常用的原子操作。当我们需要在多线程模式下修改点的数据时，我们都应该使用原子操作来确保并行环境下修改操作的正确性。除了这4个原子操作外，用户也可以使用“cas”来构建自己的原子操作函数。
+
+- `bool cas(T * ptr, T oldv, T newv)`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `bool write_min(T *a, T b)`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `bool write_max(T *a, T b)`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `void write_add(T *a, T b)`：将b的值加到a指向的值上。
+- `void write_sub(T *a, T b)`：将a指向的值减去b的值。
+
+## 4. 点集合类ParallelBitset
+
+在使用TuGraph进行批处理操作时，需要使用点集合来表示需要处理的点。ParallelBitset实现了点集合类，以bit为单位表示点，因此能够节省大量内存。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 4.1 ParallelBitset类成员
+
+- `size_t Size()`：表示Bitmap中的点个数。
+- `ParallelBitset(size_t size)`：初始化size和data，data长度为(size >> 6)+1
+- `void Clear()`：清空集合
+- `void Fill()`：将所有点加入集合
+- `bool Has(size_t i)`：检查点i是否在集合中
+- `bool Add(size_t i)`：将点i加入集合中
+- `void Swap(ParallelBitset &other)`：和另一组ParallelBitset集合交换元素
+
+## 5. 点数组类ParallelVector
+
+在使用TuGraph进行批处理操作时，需要使用点数组来表示对点的处理结果。ParallelVector实现了点数组类。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 5.1 ParallelVector类成员
+
+- `ParallelVector(size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `T &operator[](size_t i)`：下标为i的数据
+- `T *begin()`：ParallelVector的起始指针
+- `T *end()`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `T &Back()`：ParallelVector最后一个数据
+- `T *Data()`：表示数组本身数据
+- `void Destroy()`：清空ParallelVector数组内数据并删除数组
+- `size_t Size()`：表示ParallelVector中的数据个数
+- `size_t Capacity()`：表示ParallelVector的容量大小
+- `void Resize(size_t size)`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `void Clear()`：清空ParallelVector内数据
+- `void ReAlloc(size_t capacity)`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `void Fill(T elem)`：为ParallelVector的全部数据赋值为elem
+- `void Append(const T &elem, bool atomic = true)`：向ParallelVector结尾添加一个数据
+- `void Swap(ParallelVector<T> &other)`：和其他的ParallelVector交换数据
+- `ParallelVector<T> Copy()`：复制当前的ParallelVector数据存至Copy数组中
+
+## 6. 自定义数据结构
+
+### 6.1 基本数据类型
+
+我们自定义了点和边的数据结构表示，用于在覆盖所有点的同时节省内存空间：
+
+- `Empty`：内容为空的特殊数据类型。
+
+### 6.2 组合数据结构
+
+为了便于计算，我们根据计算场景不同，定义了几种点和边数据的数据结构，分别是：
+
+- `EdgeUnit<EdgeData>`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+  - `size_t src`：边的起始点
+  - `size_t dst`：边的终点
+  - `EdgeData edge_data`：边的权值
+- `AdjUnit<EdgeData>`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+  - `size_t neighbour`：边的邻居点
+  - `EdgeData edge_data`：边的权值
+- `AdjList<EdgeData>`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+  - `AdjUnit<T> * begin`：列表的起始指针
+  - `AdjUnit<T> * end`：列表的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对邻接表进行循环访问。
+
+## 7. 图类OlapBase
+
+图类OlapBase是TuGraph用于加载图以及进行图计算操作的主类，常用OlapBase<EdgeData>表示权值类型为EdgeData的图，代码部分见lgraph文件夹下的olap_base.hpp。本章将介绍Graph类中常用的类型和API接口。上文介绍Procedure、Embed及Standalone功能所使用的类均为该类的子类。
+
+### 7.1 基本信息
+
+- `size_t NumVertices()`：获取点数
+- `size_t NumEdges()`：获取边数
+- `size_t OutDegree(size_t vid)`：点vid的出度
+- `size_t InDegree(size_t vid)`：点vid的入度
+
+### 7.2 点集和边集及其相关操作
+
+- `ParallelVector<VertexData> AllocVertexArray<VertexData>()`：分配一个类型为VertexData的数组，大小为点个数
+- `void fill_vertex_array<V>(V * array, V value)`：将数组array中的所有元素赋值为value
+- `ParallelBitset AllocVertexSubset()`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `AdjList<EdgeData> OutEdges(size_t vid)`：获取点v的所有出边集合
+- `AdjList<EdgeData> InEdges(size_t vid)`：获取点v的所有入边集合
+- `void Transpose()`：对有向图进行图反转
+- `LoadFromArray(char * edge_array, VertexId input_vertices, EdgeId input_edges,  EdgeDirectionPolicy edge_direction_policy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+  - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+  - `input_vertices`：指定数组读入图的点个数。
+  - `input_edges`：指定数组读入图的边的条数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+### 7.3 锁机制
+
+TuGraph实现了一对锁机制，来控制程序对于点数据的访存权限。分别是：
+
+- `void AcquireVertexLock(size_t vid)`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(size_t vid)`：对点vid解锁，所有线程均可访存该锁对应的点数据
+- `VertexLockGuard GuardVertexLock(size_t vid)`：在对vid操作时，对点vid加锁，退出作用域时时自动释放锁
+
+### 7.4 批处理操作
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程。分别是：
+
+```c++
+/*
+    函数名称:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+    第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考include/lgraph/olap_base.h中具体代码
+
+    使用示例:统计数组parent数组中有出边的点个数
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+其中graph为图类OlapBase的实例化对象
+
+```C++
+/*
+    函数名称:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+    第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考/include/lgraph/olap_base.h中具体代码
+    
+    使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..1e94fb946e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,296 @@
+# OlapOnDB API
+
+> 此文档主要详细介绍了OlapOnDB API的使用说明
+
+
+## 1. 简介
+
+一般用户需要自己实现的只是将需要分析的子图抽取出来的过程。用户也可以通过使用TuGraph中丰富的辅助接口实现自己的图分析算法。
+
+该文档主要介绍Procedure及Embed的接口设计，并介绍部分常用接口，具体的接口信息参见include/lgraph/olap_on_db.h文件。
+
+## 2. 模型
+
+Procedure及Embed使用到的辅助函数主要包含在OlapOnDB类，还有一些使用频率较高的函数都会逐一介绍
+
+在TuGraph中OLAP相关的有以下常用的数据结构：
+
+1. DB图分析类 `OlapOnDB<EdgeData>`
+2. 点数组`ParallelVector<VertexData>`
+3. 点集合`ParallelBitset`
+4. 边数据结构`AdjUnit/AdjUnit<Empty>`
+5. 边集合数据结构`AdjList<EdgeData>`
+
+### 2.1 基于快照的存储结构
+
+TuGraph中的OlapOnDB类能够提供数据“快照”，即建立一个对指定数据集的完全可用拷贝，该拷贝包括相应数据在某个时间点（拷贝开始的时间点）的镜像。由于OLAP的操作仅涉及读操作而不涉及写操作，OlapOnDB会以一种更紧凑的方式对数据进行排布，在节省空间的同时，提高数据访问的局部性。
+
+### 2.2 BSP计算模型
+
+TuGraph在计算的过程中使用了BSP（Bulk Synchronous Parallel）模型，使得该过程能够并行执行，极大的提高了程序运行效率。
+
+BSP计算模型的核心思路为超步（Super Step）的提出和使用。在OlapOnDB创建后，在该数据上的计算分为多个超步，比如PageRank，分为多轮迭代，每轮迭代就是一个超步。不同超步之间用存在显式同步，从而保证所有线程在完成同一超步后同时进入下一个超步。在一个超步内部，所有的线程异步执行，利用并行提升计算效率。
+
+利用BSP计算模型能够有效避免死锁，通过障碍同步的方式能够以硬件方式实现粗粒度的全局同步，使得图计算能够并行化执行，而程序员无需在同步互斥上大费周章。
+
+## 3. 算法举例
+
+在这里对PageRank算法分块做解释，大体上分为主函数`Process`和PageRank算法流程`PageRank`函数
+
+### 3.1 主函数
+
+主函数输入有三个参数，`TuGraph`数据库参数`db`，从网页端获取的请求`request`，给网页端的返回值`response`，整体流程可以分为一下几步：
+
+1. 相关参数的获取
+2. 快照类的创建
+3. PageRank算法主流程
+4. 网页端返回值的获取和发送
+
+```C++
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+    
+    // 从网页端请求中获取迭代次数（num_iterations），
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // 读事务的创建以及快照类的创建
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+	
+    // 创建pr数组用于存储每个节点的pr值
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank算法主流程，获取每个节点的pagerank值
+    PageRankCore(olapondb, num_iterations, pr);
+    
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        函数用途：从所有节点中获取pagerank值最大的节点编号
+    
+        函数流程描述：该函数对点集合all_vertices中所有为1的位对应的节点vi（又称为活跃点）执行Func A，再将Func A的返回值作为Func B的第二个输入参数，得到局部最大值（因为第一个输入参数为0，因此实际上返回值就是每个节点的pagerank值），最后再将所有线程的返回值汇总，再次 执行Func B得到全局返回值，并存入max_pr_vi变量中
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+        
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+        
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+    
+    // 网页端返回值的获取和发送
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2 PageRank算法流程
+
+`pagerank`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关数据结构的初始化
+1. 每个节点pagerank值的初始化
+1. 每个节点pagerank值的计算，活跃点为所有点（意味着所有点都需要计算pagerank值）
+1. 得到每个节点经过`num_iterations`次迭代后的pagerank值
+
+```C++
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+    
+    // 相关数据结构的初始化
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // 每个节点pagerank值的初始化，和该节点的出度成反比
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // 总迭代过程
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            函数用途：计算所有节点的pagerank值
+
+            函数流程描述：该函数用于计算所有节点的pagerank值，对all_vertices中所有为1的位对应的节点vi执行Func C，得到本轮迭代中vi的pagerank值，并返回vi节点的pagerank变化值，最终经过函数内部处理汇总所有活跃节点的总变化值并返回，该值被存储在delta变量中
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // 从邻居中获取当前节点的pagerank值
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank值计算核心公式
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+    
+                    // 相关中间变量统计
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // 将本轮迭代得到的pagerank值输出作为下一轮迭代的输入
+        curr.Swap(next);
+    }
+}
+```
+
+## 4. 其他常用函数功能描述
+
+### 4.1 事务的创建
+
+```C++
+//读事务的创建
+auto txn = db.CreateReadTxn();
+
+//写事务的创建
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2 并行化创建有向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3 并行化创建无向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED
+)
+```
+
+### 4.4 获取出度
+
+```C++
+size_t OutDegree(size_t vid)
+```
+
+### 4.5 获取入度
+
+```C++
+size_t InDegree(size_t vid)
+```
+
+### 4.6 获取出边集合
+
+```C++
+/*
+    函数名称：AdjList<EdgeData> OutEdges(size_t vid)
+    数据结构:
+        AdjList 可以理解为类型为AdjUnit结构体的数组
+        AdjUnit 有两个成员变量： 1. size_t neighbour 2. edge_data，其中neighbour表示该出边指向的目标节点编号，如果为有权图，则edge_data数据类型和输入文件中边的权重值相同，否则数据类型为Empty
+
+    使用示例：输出节点vid的所有出度邻居
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7 获取入边集合
+
+```C++
+AdjList<EdgeData> InEdges(size_t vid)
+
+// 使用示例：输出节点vid的所有入度邻居
+for (auto & edge : olapondb.InEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8 获取TuGraph中节点对应OlapOnDB的节点编号
+
+```C++
+size_t OriginalVid(size_t vid)
+
+// 备注： TuGraph中输入的节点编号可以是非数字，比如人名等，在生成OlapOnDB子图的时候，会将人名等转化为数字进行后续处理，因此该方法可能不适用于某些特定场景
+```
+
+### 4.9 获取OlapOnDB中节点对应TuGraph的节点编号
+
+```C++
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10 活跃点的描述
+
+活跃点指的是在批处理函数中需要处理的点，在本例子中只是输出了活跃点的编号，并且汇总活跃点的数量：
+
+```C++
+ParallelBitset temp = 000111;	//当前活跃点为3，4，5号点
+
+size_t delta = ForEachActiveVertex<double>(
+    //void c
+    [&](size_t vi) {
+        printf("active_vertexId = %lu\n",vi);
+        return 1;
+    },
+    all_vertices
+);
+```
+
+函数的运行结果显而易见，因为多线程的关系，一下输出顺序可能有所变化：
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+局部返回值均为1，该函数会在保证线程安全的情况下将所有的局部返回值累加得到最终的返回值，并存储在`delta`变量中，该值最终为3
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..1ece4cc8e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,202 @@
+# OlapOnDisk API
+
+> 此文档主要详细介绍了OlapOnDisk API的使用说明
+
+    
+## 1. 简介
+
+TuGraph的Standalone模式可用于加载图数据文件，其中图数据文件来源可包含text文本文件、BINARY_FILE二进制文件和ODPS源。在该模式下，TuGraph可实现多数据来源快速加载成图，然后在该图上运行如BFS、WCC、SSSP等迭代式算法，并输出最终结果至终端。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph内置了大量的常见图分析算法和丰富的辅助接口，因此用户几乎不需要自己实现具体的图计算过程，只需要在实现自己的存储过程的时候将相应算法库的头文件(.h)包含到自己的程序中，并在编译阶段链接自己的动态库文件即可。
+
+该文档主要介绍了Standalone的常用接口，使用到的辅助函数主要包含在OlapOnDB类。同时为帮助用户理解方便，对BFS算法进行举例说明。
+
+## 2. 算法举例
+
+在这里对BFS算法分块做解释，大体上分为主函数`main`、BFS算法流程`BFSCore`函数和配置类MyConfig。
+
+### 2.1 头文件
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //使用 TuGraph 时需要包含的头文件
+#include "./algo.h"   //包含各种算法逻辑函数的头文件
+```
+
+在使用 TuGraph 实现图数据文件计算应用时，一般首先建立StandaloneGraph类对象graph，将图文件数据加载进graph中，之后通过调用图逻辑函数实现图计算过程，最后对图计算的结果进行打印输出。
+
+### 2.2 配置类MyConfig
+
+MyConfig配置类函数用于提供算法逻辑计算时所需的配置信息，继承于ConfigBase<EdgeData>,其中EdgeDate可根据加载图类型不同选择Empty（无权图）、int（带权图权重为整数）或者double（带权图权重为double）类型。
+
+MyConfig配置类一般根据算法不同，需要额外配置信息如下：
+
+1.算法所需参数
+2.算法名称
+3.配置类内Print函数
+其余公用成员继承与ConfigBase，可参考src/olap/olap_config.h查阅。
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // 算法所需参数初始化
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // 配置文件接受命令行参数，该用例会顺次读取命令行调用算法时的参数，优先使用用户指定数值，若用户并未指定则选择默认参数。
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+### 2.3 主函数
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // 统计内存消耗类MemUsage实例化
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // 配置类MyConfig实例化
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk类实例化
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // 统计图加载消耗时间
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // 创建数组用于统计某节点是否遍历过
+    auto parent = graph.AllocVertexArray<size_t>();
+    // 宽度优先搜索算法，返回图内root_vid根结点连接的节点个数
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // 打印相关信息至终端
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+### 2.4 bfs算法流程
+
+`bfs`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关定义、数据结构的初始化
+2. 使用批处理函数对每个节点进行循环计算，每一轮找到与当前节点相邻的全部节点，并在该轮次终止时进行交换。
+3. 直到找到全部节点，返回节点个数discovered_vertices。
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //分配数组，active_in用于存放上一循环阶段已找到的节点
+  active_in.Add(root);            //把跟节点加入数组中
+  auto active_out = graph.AllocVertexSubset();  //分配数组active_out用于存放当前循环阶段找到的节点
+  parent.Fill((size_t)-1);               //将parent数组中的节点赋值为-1，-1表示未被找到
+  parent[root] = root;
+  size_t num_activations = 1;       //表示当前循环阶段找到的节点个数
+  size_t discovered_vertices = 0;    //表示当前循环阶段找到节点的总个数
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations表示当前循环阶段找到的节点个数
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices表示当前循环阶段找到节点的总个数
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //每一次循环从根节点出发，查找邻近的相邻节点，对其parent值改变，并num_activations+1操作
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //存放当前循环阶段找到的节点
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // 返回全部节点数
+  return discovered_vertices;
+}
+```
+
+## 3. 其他常用函数功能描述
+
+### 3.1 图加载
+
+TuGraph-Standalone对于图数据文件的加载来源主要分为三大类：文本文件、二进制文件和ODPS。二进制文件为将边数据的二进制表示按顺序排列的文件，能够节省大量存储空间。其加载函数分为三种，分别是：
+
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：图数据文件的加载方式，包含两个参数，其含义分别表示：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。其中DUAL_DIRECTION为默认的图加载方式。
+  DUAL_DIRECTION : 输入文件为非对称图，加载图为非对称图。
+  MAKE_SYMMETRIC : 输入文件为非对称图，加载图为对称图。
+  INPUT_SYMMETRIC : 输入文件为对称图，加载图为对称图。
+  对应的详细介绍见lgraph文件夹下的olap_config.h文件的`enum EdgeDirectionPolicy`。
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：将文件中的点-数据对按照点id的顺序加载到数组中。各参数表示意义分别为：
+  - `array`：待读入数据的数组
+  - `path`：读取文件的路径，文件中每行表示一对点-数据对
+  - `parse_line`：用户自定义函数，告诉系统如何将一行文本数据解析为一个点-数据对。
+
+
+### 3.2 图写入
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：把array中数据写回文件中，各参数表示意义分别是：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `array`：待写入数据的数组
+  - `array_size`：待写入数据的数字长度
+  - `name`：算法名称
+  - `filter_output`：写入数据规则函数，待写入数据需要满足该函数的要求。
+
+### 3.3 图解析函数
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：对图数据文件进行解析，加载图为无权图。
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：对图数据文件进行解析，加载图为有权图，权重数据类型可以通过修改<EdgeData>指定。
+
+该函数可通过MyConfig类定义时的构造函数parse_line进行指定。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md
new file mode 100644
index 0000000000..0ca16518f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md
@@ -0,0 +1,428 @@
+# Python Olap API
+
+> 本文档主要介绍 OlapBase OlapOnDB 和 OlapOnDisk 在Python中的API用法
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统Python接口需要的简单配置，同时结合代码对TuGraph Python API进行解释。关于ParallelBitset、OlapBase各类的作用，详见olap-base-api.md，olap-on-db-api.md和olap-on-disk-api.md
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+- Cython，版本要求3.0.0以上，已测试可运行版本为3.0.0a11
+
+## 3. Cython
+Cython是一种高效的编程语言，是Python的超集。Cython能将py文件翻译为C/C++代码后编译为Python拓展类，在Python中通过import调用。在TuGraph中，所有的Python plugin都由Cython编译为Python拓展类后使用。
+
+Cython的Pure Python模式在保证Python语法的同时具有C/C++的性能，TuGraph Python接口均使用Cython实现。
+
+[Cython 文档](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+见procedures/algo_cython/olap_base.pxd文件，用法与功能基本与C++接口相同，olap_base.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### 原子操作
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `write_min[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_max[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_add[T](a: cython.pointer(T), b: T)-> cython.bint`：将b的值加到a指向的值上。
+- `write_sub[T](a: cython.pointer(T), b: T)-> cython.bint`：将a指向的值减去b的值。
+
+### 点集合类ParallelBitset
+- `Size()-> size_t`：表示Bitmap中的点个数。
+- `ParallelBitset(size: size_t)`：初始化size和data，data长度为(size >> 6)+1
+- `Clear()-> cython.void`：清空集合
+- `Fill()-> cython.void`：将所有点加入集合
+- `Has(size_t i)-> cython.bint`：检查点i是否在集合中
+- `Add(size_t i)-> cython.bint`：将点i加入集合中
+- `Swap(ParallelBitset &other)-> cython.void`：和另一组ParallelBitset集合交换元素
+
+### 点数组类ParallelVector
+- `ParallelVector[T](size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `operator[](i: size_t)-> T`：下标为i的数据
+- `begin()-> cython.pointer(T)`：ParallelVector的起始指针
+- `end()-> cython.pointer(T)`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `Back()-> T`：ParallelVector最后一个数据
+- `Data()-> cython.pointer(T)`：表示数组本身数据
+- `Destroy()-> cython.void`：清空ParallelVector数组内数据并删除数组
+- `Size()-> size_t`：表示ParallelVector中的数据个数
+- `Resize(size: size_t)-> cython.void`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `Clear()-> cython.void`：清空ParallelVector内数据
+- `ReAlloc(capacity: size_t)-> cython.void`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `Fill(elem: T)-> cython.void`：为ParallelVector的全部数据赋值为elem
+- `Append(elem: T, atomic: cython.bint = true)-> cython.void`：向ParallelVector结尾添加一个数据
+- `Swap(other: ParallelVector[T])-> cython.void`：和其他的ParallelVector交换数据
+- `Copy()-> ParallelVector[T]`：复制当前的ParallelVector数据存至Copy数组中
+
+### 自定义数据结构
+- `Empty`：内容为空的特殊数据类型。
+- `EdgeUnit[EdgeData]`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+    - `src: size_t`：边的起始点
+    - `dst: size_t`：边的终点
+    - `edge_data: EdgeData`：边的权值
+- `AdjUnit[EdgeData]`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+    - `neighbour: size_t`：边的邻居点
+    - `edge_data: EdgeData`：边的权值
+- `AdjList[EdgeData]`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+    - `begin()-> cython.pointer(AdjUnit[T])`：列表的起始指针
+    - `end()-> cython.pointer(AdjUnit[T])`：列表的结束指针。
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: 下标为i的数据
+
+### 图类OlapBase
+- `NumVertices()-> size_t`：获取点数
+- `NumEdges()-> size_t`：获取边数
+- `OutDegree(size_t vid)-> size_t`：点vid的出度
+- `InDegree(size_t vid)-> size_t`：点vid的入度
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`：分配一个类型为VertexData的数组，大小为点个数
+- `AllocVertexSubset()-> ParallelBitset`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有出边集合
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有入边集合
+- `Transpose()-> cython.void`：对有向图进行图反转
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+    - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+    - `input_vertices`：指定数组读入图的点个数。
+    - `input_edges`：指定数组读入图的边的条数。
+    - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`：对点vid解锁，所有线程均可访存该锁对应的点数据
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程，在Python中与C++使用方法稍有不同。
+
+```python
+# 函数名称:ProcessVertexInRange[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           lower: size_t, upper: size_t,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#     函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+#     第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#     具体实现请参考include/lgraph/olap_base.h中具体代码
+#
+#     使用示例:统计数组parent数组中有出边的点个数
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython. pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython. pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+其中g为图类OlapBase的实例化对象
+
+```python
+# 函数名称:ProcessVertexActive[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           active: ParallelBitset,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#   函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+#   第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#   具体实现请参考/include/lgraph/olap_base.h中具体代码
+#
+# 使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self.graph.OutDegree(vi)
+        dst: size_t
+        edges = self.graph.OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbour
+            printf("node %lu has neighbour %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+如上面两个例子所展示，在Python中ProcessVertexActive与ProcessVertexInRange比在C++中额外需要一个算法类指针参数，Work函数一般也作为该算法类的成员函数，满足Work函数访问成员变量的需求（如图graph，点数组parent），在调用批处理函数时将Work函数和算法类的self指针传入批处理函数。
+
+其中Work函数会在多线程中调用，因此加上修饰器`@cython.nogil`释放Python全局解释锁，在多线程执行的代码中（例如批处理函数中的Work函数，`cython.parallel.prange`中），不能包含Python对象，最好通过`dst: type`或者`dst = cython.declare(type)`的方式声明变量为C/C++类型。
+
+### 图类OlapOnDB:
+并行化创建有向图：
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+并行化创建无向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING创建有向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### 图类OlapOnDisk
+
+#### ConfigBase：
+- `ConfigBase()`: 构造函数
+- `std::string input_dir`: 图边表数据路径
+- `std::string output_dir`: 输出结果路径
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: 读入图数据
+
+
+## 5. lgraph_db API
+见procedures/algo_cython/lgraph_db.pxd与lgraph_db_python.py文件。
+
+lgraph_db.pxd中接口用法与功能基本与C++接口相同，lgraph_db.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: 获取点的vid
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: 设置用户
+- `SetUser(user: std::string)-> cython.void`: 设置用户
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: 创建GraphDB
+
+### GraphDB：
+- `CreateReadTxn()-> Transaction`: 创建只读事务
+- `CreateWriteTxn()-> Transaction`: 创建写事务
+- `ForkTxn(txn: Transaction)-> Transaction`: 复制事务，只能复制读事务
+
+### Transaction：
+```
+GetVertexIndexIterator(
+                label: std::string,
+                field: std::string,
+                key_start: std::string,
+                key_end: std::string)-> VertexIndexIterator
+```
+获取索引迭代器。迭代器的field值为 [key_start, key_end]。所以在key_start=key_end=v时，返回指向field值为v的点的迭代器
+
+lgraph_db_python.py是lgraph_db.pxd中C++类 Galaxy与GraphDB的包装，将C++类包装为Python类，将lgraph_db_python.py编译为Python拓展后，可以直接在Python文件或Python命令行中`import lgraph_db_python`访问lgraph_db_python.PyGraphDB与PyGraphDB.PyGalaxy。
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(self, user: str password: str)-> void`: 设置用户
+- `SetUser(self, user: std::string)-> void`: 设置用户
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: 创建PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)-> cython.Py_ssize_t`: C++ 类GraphDB的地址
+
+## 6. 算法插件示例
+下面为Python实现的BFS算法的代码示例：
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# 注释作用如下：
+# language_level=3: 使用Python3
+# cpp_locals=True: 需要c++17，使用std::optional管理Python代码中的C++对象，可以避免C++对象的拷贝构造
+# boundscheck=False: 关闭索引的边界检查
+# wraparound=False: 关闭负数下标的处理（类似Python List）
+# initializedcheck=False: 关闭检查内存是否初始化，关闭检查后运行性能更快
+# language = c++: 将此py文件翻译为C++而不是C文件，TuGraph使用大量模板函数，所以都应该使用C++
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# 从procedures/algo_cython/ 中cimportolap_base.pxd与lgraph_db.pxd, 类似C++中#include "xxx.h"
+
+from cython.cimports.libc.stdio import printf
+# 类似C++中#include <stdio.h>
+# 其他常见的还有cython.cimports.libcpp.unordered_map等
+
+import time
+import lgraph_db_python
+
+
+@cython.cclass
+# cython.cclass 表示BFSCore为C类型的Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty])表示OlapBase[Empty]的指针，类似C++中OlapBase[Empty]*
+    # cython提供了常见类型的指针，如cython.p_int, cython.p_char等，表示int*, char*, ...
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t 声明root为C++ size_t类型变量，等效于root = cython.declare(size_t)
+    # 不声明类型的变量为Python object类型
+    # 声明变量类型会大幅提高性能，同时在多线程部分，只有C/C++类型的变量可以访问
+
+    @cython.cfunc
+    # cython.cfunc 表示Work为C类型的函数，参数与返回值应声明
+    # cfunc性能好，能接受C/C++对象为参数、返回值，但是不能在其他python文件中调用
+    # 类似的有cython.ccall，如Standalone函数，可以在其他python文件中调用
+    @cython.nogil
+    # cython.nogil 表示释放Python全局解释锁，在nogil修饰的部分，不能访问Python对象
+    # 在多线程部分，都应有nogil修饰器
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) 表示禁用异常传播，将忽略函数内部引发的Python异常
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbour
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 表示dst没有被bfs访问过
+                if self.active_out.Add(dst):
+                    # 将dst设置为为活跃节点；ParallelBitmap.Add为原子操作，防止重复计算
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython.size_t:
+        self.graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self.parent.Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self.active_in.Add(self.root)
+        while num_activations > 0:
+            self.active_out.Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self.active_out.Swap(self.active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time.time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # 并行创建OlapOnDB
+    # Cython不支持如 *db 的解引用操作，通过db[0]来解引用
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # 通过 GetVertexIndexIterator 根据root节点label名和filed名与filed值（root_id）
+    # 获取root节点的迭代器，通过迭代器获取vid，在无ID_MAPPING时，该vid与OlapOnDB中的id相同
+    cost = time.time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time.time()
+    count = a.run(cython.address(olapondb), root_vid)
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb.NumVertices()
+    response["num_edges"] = olapondb.NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone为Standalone模式下插件入口，用cython.ccall修饰
+    # 可以任意设置参数，相应修改procedures/algo_cython/run_standalone.py即可
+    cost = time.time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config为C++类，config.input_dir为std::string，Python str需要encode才能传给std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # 读入图
+    cost = time.time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time.time()
+    a = BFSCore()
+    count = a.run(cython.address(graph), root)
+    # cython.address(graph)，取址，类似C++中&graph
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices".format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process为embed模式和procedure模式下插件入口，用cython.ccall修饰
+    # Process函数必须名为Process，参数为lgraph_db_python.PyGraphDB与bytes
+    # 返回值必须为(bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # 获取PyGraphDB中GraphDB对象的地址，转换为指针后传递
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..7bf7f3ebf1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
@@ -0,0 +1,189 @@
+# 内置算法
+
+> 此文档主要详细介绍了TuGraph内置的算法程序，社区版6种算法可参考基础算法报
+
+## 简介
+
+TuGraph目前包含以下6个基础算法28种扩展算法，共34个图算法：
+
+### 基础算法包：
+| 中文算法名 | 英文算法名 | 程序名
+|  :----:  | :----: | :----: |
+| 广度优先搜索 | Breadth-First Search  | bfs 
+| 网页排序 | Pagerank | pagerank 
+| 单源最短路径 | Single-Source Shortest Path | sssp 
+| 弱连通分量 | Weakly Connected Components | wcc 
+| 平均集聚系数 | Local Clustering Coefficient  | lcc
+| 标签传播 | Label Propagation Algorithm | lpa 
+
+### 扩展算法包：
+| 中文算法名 | 英文算法名 | 程序名
+| :----: | :----: | :----: |
+| 全对最短路径 | All-Pair Shortest Path  | apsp 
+| 介数中心度 | Betweenness Centrality | bc 
+| 置信度传播 | Belief Propagation | bp
+| 距离中心度 | Closeness Centrality | clce
+| 共同邻居 | Common Neighborhood | cn 
+| 度数关联度 | Degree Correlation  | dc
+| 直径估计 | Dimension Estimation | de 
+| EgoNet算法 | EgoNet | en
+| 超链接主题搜索 | Hyperlink-Induced Topic Search | hits
+| 杰卡德系数 | Jaccard Index | ji
+| K核算法 | K-core | kcore
+| 鲁汶社区发现 | Louvain | louvain 
+| 多源最短路径 | Multiple-source Shortest Paths | mssp
+| 个性化网页排序 | Personalized PageRank | ppr
+| 强连通分量 | Strongly Connected Components | scc 
+| 监听标签传播 | Speaker-listener Label Propagation Algorithm | slpa
+| 两点间最短路径 | Single-Pair Shortest Path | spsp
+| 三角计数 | Triangle Counting | triangle 
+| 信任指数排名 | Trustrank | trustrank 
+| 带权重的标签传播 | Weighted Label Propagation Algorithm | wlpa 
+| 带权重的网页排序 | Weighted Pagerank Algorithm | wpagerank 
+| 最大独立集算法 | Maximal independent set | mis 
+| sybil检测算法 | Sybil Rank | sybilrank 
+| 子图匹配算法 | Subgraph Isomorphism | subgraph_isomorphism
+| 模式匹配算法 | Motif | motif
+| k阶团计数算法 | Kcliques | kcliques
+| k阶桁架计数算法 | Ktruss | ktruss 
+| 莱顿算法 | Leiden | leiden
+
+## 基础算法包
+
+### 广度优先搜索
+
+广度优先搜索实现了Breadth-first Search算法，从根点开始，沿着图的宽度遍历所有可访问点。返回结果为遍历点个数。算法内容请参考 [https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 网页排序
+
+网页排序程序实现了常用的Pagerank算法。该算法根据图中边和边权值计算所有点的重要性排名，PageRank值越高，表示该点在图中的重要性越高。计算时以点数量的倒数为各点初始Rank值，然后将点的Rank值按照出边平均传递到相邻点，重复该传递过程直到满足给定的收敛阈值或达到给定迭代轮数。每轮传递结束后，所有点的Rank值会有一定的的比例随机传递到任意点上。算法内容请参考 [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 单源最短路径
+
+单源最短路径实现了Single Source Shortest Path算法，根据给定的源点，计算从该源点出发到其他任意点的最短路径长度。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 弱连通分量
+
+弱连通分量程序实现了Weakly Connected Components算法，该算法会计算图中所有的弱连通分量。弱连通分量是图的一个子图，子图中任意两点之间均存在可达路径。算法内容请参考[https://en.wikipedia.org/wiki/Connected_component_(graph_theory)](https://en.wikipedia.org/wiki/Connected_component_(graph_theory) "scc wiki")。
+
+### 平均集聚系数
+
+平均集聚系数程序实现了Local Clustering Coefficient算法，计算图中点之间聚集程度的系数。返回结果包括整体集聚系数和点集聚系数。整体集聚系数反映了图中整体的集聚程度的评估，点集聚系数包括任意点的集聚系数，反映了该点附近的集聚程度。集聚系数越高，表示集聚程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 标签传播
+
+标签传播算法程序实现了Label Propagation Algorithm算法。该算法是基于标签传播的社区发现算法，计算对象为无权图。在标签传递时，每个点对收到的所有标签进行次数累加，在累加和最高的标签中随机选择一个。迭代收敛或执行到给定轮数后算法终止。最终输出结果为每个点的标签，标签值相同的点视为在同一社区。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+
+## 扩展算法包
+
+### 全对最短路径
+
+全对最短路径程序实现了All-Pair Shortest Path算法，计算图中任意两点间的最短路径。返回结果为任意存在路径的点对之间的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 介数中心度
+
+介数中心度程序实现了Betweenness Centrality算法，估算图中所有点的介数中心度值。介数中心度值反映了图中任一最短路径经过该点的可能性，值越高表示有越多的最短路径经过了该点。计算时需给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 置信度传播
+
+置信度传播程序实现了Belief Propagation算法。该算法给定已观测点的边缘分布，利用点之间相互传递消息的机制来估算未观测点的边缘分布。算法内容请参考[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 距离中心度
+
+距离中心度程序实现了Closeness Centrality算法，估算任意点到图中其他点的最短路径的平均长度。距离中心度越小，表示该点到其他点的平均最短距离最小，意味着该点从几何角度看更位于图的中心位置。计算时需要给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki")。
+
+### 共同邻居
+
+共同邻居程序实现了Common Neighborhood算法，计算任意给定相邻点对之间的共同邻居数量。计算时给定待查询的若干个点对，返回结果为待查询的任意点对的共同邻居数量。
+
+### 度数关联度
+
+度数关联度程序实现了Degree Correlation算法，通过计算任意相邻点对之间的Pearson关联系数来计算图的度数关联度，可用来表征图中高度数点之间关联程度。度数关联度越高，表示图中高度数点之间的关联程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 直径估计
+
+直径估计程序实现了Dimension Estimation算法。该算法会计算图中最长的最短路径长度，用来表征图的直径大小。算法内容请参考[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### EgoNet算法
+
+EgoNet算法需要给定根点和K值，以根点为源点进行宽度优先搜索，找出所有K度以内的邻居组成的子图。找到的子图称为根点的EgoNet。
+
+### 超链接主题搜索
+
+超链接主题搜索算法实现了Hyperlink-Induced Topic Search算法，该算法假定每个点具有权威性Authority和枢纽性Hub两个属性，一个好的枢纽点应该指向许多高权威性的点，而一个良好的权威点应该被许多高枢纽型的点指向。算法将返回每个点的权威性值和枢纽性值。算法内容请参考[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 杰卡德系数
+
+杰卡德系数程序实现了Jaccard Index算法。该算法计算了给定点对之间的Jaccard系数，可用来表示这两个点的相似度。Jaccard系数越高，表示点对之间的相似程度越高。计算时给定带查询的若干点对，返回结果为这些点对的Jaccard系数。算法内容请参考[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### k核算法
+
+k核算法实现了k-core算法。该算法计算所有点的核数，或找出图中所有的K核子图。K核子图是一种特殊子图，子图中任意点度数都不小于给定K值。算法内容请参考 [https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)](https://en.wikipedia.org/wiki/Degeneracy_(graph_theory) "kcore wiki")。
+
+### 鲁汶社区发现
+
+鲁汶社区发现程序实现了Fast-unfolding算法。该算法是基于模块度的社区发现算法，通过不断合并点社区来最大化图的模块度，能够发现层次性的社区结构。算法内容请参考 [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 多源最短路径
+
+多源最短路径程序实现了Multiple-source Shortest Paths算法，根据给定的多个源点，从这些源点出发，计算到达任意点的最短路径值。其中，多个源点到某一点的最短路径值为分别从每个源点出发到达该点的最短路径的最小值。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 个性化网页排序
+
+个性化网页排序程序实现了Personalized PageRank算法。该算法根据给定的源点，基于该源点个性化计算所有点对于源点的重要性排名。Rank值越高，表示该点对于源点越重要。与PageRank不同的是，初始化时源点Rank值为1，其余点Rank值为0；并且每轮传递结束后，Rank值会有一定的比例随即传递回源点。算法内容请参考 [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 强连通分量
+
+强连通分量程序实现了Strongly Connected Components算法。该算法计算了图中所有的强连通分量，强连通分量是图的一个子图，子图中可从任意点出发到达其他任意点。算法内容请参考[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 监听标签传播
+
+监听标签传播算法程序实现了Speaker-listener Label Propagation Algorithm算法。该算法是基于标签传播和历史标签记录的社区发现算法，是对标签传播算法的扩展。与标签传播算法不同的是，本算法会对所有点记录其历史标签，在迭代中对标签进行累加时，会将历史标签也计算在内。最终输出结果为每个点的所有历史标签记录。算法内容请参考论文：“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 两点间最短路径
+
+两点间最短路径程序实现了Bidirectional Breadth-First Search算法，在有向无权图上从起点沿着出边做正向宽度优先搜搜，从终点沿着入边做反向宽度优先搜索，通过起点和终点共同遍历到的点来确定从起点到终点的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 三角计数
+
+三角计数实现了Triangle-counting算法，计算无向图中的三角形个数，可用来表征图中点的关联程度。三角形数越多，表示图中点的关联程度越高。算法内容请参考论文：“Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study” 。
+
+### 信任指数排名
+
+信任指数排名算法实现了Trustrank算法，可以根据给定的白名单，计算任意点的信任指数。信任指数越高，表示该点为非法点的可能性越小。算法内容请参考 [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 带权重的标签传播
+
+带权重的标签传播算法程序实现了Weighted Label Propagation Algorithm算法。=与标签传播算法不同的是，标签的传递跟边的权重相关，在标签传递时，每个点会根据标签的入边进行权重累加，在累加和最高的标签中随机选择一个。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 带权重的网页排序
+
+带权重的网页排序算法程序实现了Weighted Pagerank算法。与PageRank算法不同的是，Rank值的传递跟边的权重有关，点的Rank值将按照边权重加权传递到相邻点。算法内容请参考[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 最大独立集算法
+
+最大独立集算法实现了Maximal independent set算法。最大独立集是指在这个独立集之外没有可以加入它的点。一个图可能有许多大小差异很大的 MIS，算法找出其中一个。算法内容请参考 [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### Sybil检测算法
+
+Sybil检测算法实现了Sybil Rank算法。SybilRank算法从非Sybil节点开始进行提前终止的随机游走。算法内容请参考论文：“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 子图匹配算法
+
+子图匹配算法实现了subgraph_isomorphism算法。subgraph_isomorphism算法对全图所有节点匹配子图，最后输出每个节点被匹配的次数。算法内容参考 [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 模式匹配算法
+
+模式匹配算法实现了motif算法。motif算法对指定的节点匹配k阶子图，最后输出每个指定节点每种k阶子图个数，每个k阶子图用一个64位整数表示，整数的第$i \times k + j$位为1表示子图中有边i->j。算法内容参考 [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### k阶团计数算法
+
+k阶团计数算法实现了k-cliques算法。k-cliques算法对计算图中所有的k阶完全子图的个数，最后输出每个节点所在的k阶完全子图个数。算法内容参考 [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### k阶桁架计数算法
+
+k阶桁架计数算法实现了k-truss算法。k-truss指每条边都至少是k-2个三角形的边的子图。k-truss算法找出图的k-truss子图，最后输出每个节点在子图中的邻居节点列表。算法内容参考 [https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+### 莱顿算法
+
+莱顿算法实现了了leiden算法。leiden算法是基于模块度的社区发现算法，与louvain算法优势在于leiden算法检测出社区中的断链，保证每个社区具有良好的连通性。算法内容参考 [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst
new file mode 100644
index 0000000000..bc80c68c65
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst
@@ -0,0 +1,8 @@
+分析接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
new file mode 100644
index 0000000000..47d0207278
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
@@ -0,0 +1,344 @@
+# Procedure API
+
+> 此文档主要讲解 TuGraph 的存储过程使用说明
+
+## 1.简介
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个请求并在客户端完成整个处理流程的方式，TuGraph 提供的存储过程是更简洁和高效的选择。
+
+与传统数据库类似，TuGraph 的存储过程运行在服务器端，用户通过将处理逻辑（即多个操作）封装到一个过程单次调用，并且可以在实现时通过并行处理的方式（例如使用相关的 C++ OLAP 接口以及基于其实现的内置算法）进一步提升性能。
+
+存储过程中有一类特殊的API来进行数据的并行操作，我们叫 Traversal API，见[文档](2.traversal.md)。
+
+## 2.存储过程的版本支持
+
+目前TuGraph支持两个版本的存储过程，适用于不同的场景，v3.5版本只支持v1，可通过REST或RPC接口直接调用；从v3.5版本开始支持v2，能够在图查询语言（比如Cypher）中嵌入调用，我们称之为POG（Procedure On Graph query language，APOC）。
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+| 适用场景                 | 极致性能，或者复杂的多事务管理情形       | 一般情况，与Cypher高度联动 |
+| 事务                    | 函数内部创建，可自由控制多事务          | 外部传入函数，单一事务     |
+| 签名（参数定义）          | 无                                 | 有                    |
+| 输入输出参数类型          | 不需要指定                           | 需要指定参数类型        |
+| Cypher Standalone Call | 支持                                | 支持                  |
+| Cypher Embeded Call    | 不支持                              | 支持                  |
+| 语言                    | C++/Python/Rust                    | C++                  |
+| 调用模式                 | 直接传字符串，一般为JSON               | 通过Cypher语句中的变量  |
+
+在TuGraph中，存储过程v1和v2单独管理，支持增删查，但仍不建议重名。
+
+## 3.存储过程语言支持
+
+在 TuGraph 中，用户可以动态的加载，更新和删除存储过程。TuGraph 支持 C++ 语言、 Python 语言和 Rust 语言编写存储过程。在性能上 C++ 语言支持的最完整，性能最优。
+
+注意存储过程是在服务端编译执行的逻辑，和客户端的语言支持无关。
+
+## 4.Procedure v1接口
+
+## 4.1.编写存储过程
+
+### 4.1.1.编写C++存储过程
+
+用户可以通过使用 Procedure API 或者 Traversal API 来编写 C 存储过程。一个简单的 C 存储过程举例如下：
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## 统计所有年龄为10的学生数量
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+从代码中我们可以看到，存储过程的入口函数是`Process`函数，它的参数有三个，分别为：
+
+- `db`: 数据库实例
+- `request`: 输入请求数据，可以是二进制字节数组，或者 JSON 串等其它任意格式。
+- `response`: 输出数据，可以是字符串，也可以直接返回二进制数据。
+
+`Process`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误，此时用户可以通过`response`来返回错误信息以方便调试。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`age_10`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 age_10.so，然后用户就可以将它加载到服务器中了。
+
+### 4.1.2.编写Python存储过程
+
+与 C++类似，Python 存储过程也可以调用 core API，一个简单的例子如下：
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+Python 存储过程返回的是一个 tuple，其中第一个元素是一个布尔值，表示该存储过程是否成功执行；第二个元素是一个`str`，里面是需要返回的结果。
+
+Python 存储过程不需要编译，可以直接加载。
+
+## 4.2.如何使用存储过程
+### 4.2.1.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`age_10.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`age_10.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+### 4.2.2.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+### 4.2.6.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
+
+## 5.Procedure v2接口
+
+下面的说明以 REST API 为例，介绍存储过程v2的调用。
+
+### 5.1.编写存储过程
+
+
+用户可以通过使用 lgraph API 来编写 C++ 存储过程。一个简单的 C++ 存储过程举例如下：
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   std::string &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response = std::string("error parsing json: ") + e.what();
+        return false;
+    }
+
+    Result result({{"node", LGraphType::NODE},
+                   {"salt", LGraphType::FLOAT},
+                   });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = result.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    response = result.Dump();
+    return true;
+}
+```
+
+从代码中我们可以看到：
+- 存储过程定义了一个获取签名的方法`GetSignature`。该方法返回了存储过程的签名，其中包含输入参数名称及其类型，返回参数及其类型。这使得Cypher查询语句在调用存储过程能够利用签名信息校验输入数据以及返回数据是否合理。
+- 入口函数是`ProcessInTxn`函数，它的参数有三个，分别为：
+
+- `txn`: 存储过程所处的事务，通常来说即调用该存储过程的Cypher语句所处事务。
+- `request`: 输入数据，其内容为`GetSignature`中定义的输入参数类型及其Cypher查询语句中传入的值经过json序列化后的字符串。e.g. `{num_iteration: 10}`
+- `response`: 输出数据，为保证在Cypher语言中能够兼容，用户可以通过往`lgraph_api::Result` 写入存储过程处理后的数据，最后用`lgraph_api::Result::Dump`来序列化成json格式的数据。
+
+`ProcessInTxn`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`custom_pagerank`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 custom_pagerank.so，然后用户就可以将它加载到服务器中了。
+
+
+### 5.2.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`custom_pagerank.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`custom_pagerank.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+#### 5.2.1.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+#### 5.2.5.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
new file mode 100644
index 0000000000..9613828c50
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
@@ -0,0 +1,128 @@
+# Traversal API
+
+> 此文档主要讲解 TuGraph 的存储过程中的Traversal API
+
+## 1. 简介
+
+TuGraph 强大的在线分析处理（OLAP）能力是其区别于其它图数据库的一个重要特性。
+借助 C++ OLAP API（olap_on_db.h），用户可以快速地导出一个需要进行复杂分析的子图，然后在其上运行诸如 PageRank、连通分量、社区发现等迭代式图计算过程，最后根据结果做出相应决策。
+导出和计算的过程都可以通过并行处理的方式进行加速，从而实现几乎实时的分析处理，避免了传统解决方案需要将数据导出、转换、再导入（ETL）到专门的分析系统进行离线处理的冗长步骤。
+
+TuGraph 内置了大量常用的图分析算法和丰富的辅助接口，因此用户几乎不需要自己来实现具体的图计算过程，只需在实现自己的存储过程时将相应算法库的头文件（.h 文件）包含到自己程序中，并在编译时链接相应的动态库文件（.so）即可。
+一般情况下，用户需要自己实现的只有将需要分析的子图抽取出来的过程。
+
+目前 Traversal API 仅支持 C++。
+
+## 2. 接口说明
+
+### 2.1. Snapshot
+
+C++ OLAP API 中的 Snapshot 模版类用于表示抽取出来的静态子图，其中 EdgeData 用来表示该子图上每条边所用权值的数据类型（如果边不需要权值，使用 Empty 作为 EdgeData 即可）。
+
+抽取的子图通过 Snapshot 类的构造函数来描述：
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+其中，db 为数据库句柄，txn 为事务句柄，flags 为生成时使用的选项，可选值包括以下的组合：SNAPSHOT_PARALLEL 表示导出时使用多个线程进行并行；SNAPSHOT_UNDIRECTED 表示需要将导出的图变为无向图。
+vertex_filter 是面向点的用户自定义过滤函数，返回值为 true 表示该点需要被包含到待抽取的子图中，反之则表示需要被排除。
+out_edge_filter 是面向边的用户自定义过滤函数，返回值为 true 表示该边需要被包含到待抽取的子图中，反之则表示需要被排除。
+当过滤函数为缺省值时，则表示需要将所有点/边都包含进来。
+
+Snapshot 类提供的其它方法请参考详细的 C++ API 文档（olap_on_db.h）。
+
+### 2.2. Traversal
+
+图数据库中十分常见的一大类分析是基于一个或多个点出发，逐层地拓展并访问邻居。
+尽管这类分析也可以使用 Cypher 完成，但是当访问的层数较深时，其性能会受到串行解释执行的限制。
+使用 C++ Core API 编写存储过程尽管避免了解释执行，但依然受限于单个线程的处理能力。
+为了让用户能够方便地通过并行处理的方式加速这一类应用场景，我们基于 C++ OLAP API 封装了一个 Traversal 框架，用户可以直接使用其中的 FrontierTraversal 和 PathTraversal 类来完成这种逐层遍历的分析任务，具体的使用方法可以参考相应的 C++ API 文档（lgraph_traversal.h）。
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+该方法可用于找到所有满足条件（filter 返回 true）的点，当 parallel 为 true 时则会并行该查找过程。
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+该方法可用于从指定点集（frontier）中（通过 extract 方法）抽取（类型为 VertexData 的）属性，当 parallel 为 true 时会并行该抽取过程。
+
+FrontierTraversal 适用于只关注遍历扩展到的点集的情况；当用户在遍历过程或是结果中需要访问路径上的信息（路径上的点/边）时，则需要使用 PathTraversal。
+两类 Traversal 的构造函数均有四个参数，分别为数据库句柄 db、事务句柄 txn、选项 flags 和 初始化数组容量 capacity。
+选项的可选值包括以下的组合：TRAVERSAL_PARALLEL 表示遍历时使用多个线程并行；TRAVERSAL_ALLOW_REVISITS 表示遍历时允许重复地访问点（PathTraversal 隐含了该选项）。capacity 表示初始化时路径集合的容量。
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+两类 Traversal 设置遍历的起始点/点集有上述三种方式，前两种通过点 ID 直接指定，最后一种方式则类似于 FindVertices。
+
+两类 Traversal 的遍历都是从当前层的点集合出发，根据使用的扩展函数访问每条出边/入边/出边和入边，通过用户自定义的过滤函数决定扩展是否成功，若成功则将邻居点/追加了该条边的路径加入下一层的点/路径集合。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+上述为 FrontierTraversal 的三种遍历方式，即从当前的点集合出发，对集合中的每个点，依次访问每条出边/入边/出边和入边，若满足用户自定义的过滤条件（其中，edge_filter 为面向边的过滤函数，neighbour_filter 则为面向邻居点的过滤函数），则将邻居点加入新的点集合。
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+当前点集合的扩展结束后，新的点集合可以通过上述方法取得。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+PathTraversal 的三种遍历方式与 FrontierTraversal 类似，只是用户自定义的过滤函数中增加了两个参数，其中：Path 包含了到新扩展的这条边之前的路径，IteratorHelper 可用于将路径中的点/边转为数据库中对应的迭代器，相关文档可参考对应的 C++ API 文档。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
new file mode 100644
index 0000000000..abc5ce2ccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
@@ -0,0 +1,5 @@
+base64_encode
+===================================
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
new file mode 100644
index 0000000000..b321c843d6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
@@ -0,0 +1,5 @@
+lgraph_result
+===================================
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
new file mode 100644
index 0000000000..0f53077dbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
@@ -0,0 +1,5 @@
+lgraph_rpc_client
+===================================
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
new file mode 100644
index 0000000000..d7a9d7b97c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
@@ -0,0 +1,5 @@
+lgraph_traversal
+===================================
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
new file mode 100644
index 0000000000..4b0be46a21
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
@@ -0,0 +1,5 @@
+lgraph_txn
+===================================
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
new file mode 100644
index 0000000000..4047340ef0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
@@ -0,0 +1,5 @@
+lgraph_types
+===================================
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
new file mode 100644
index 0000000000..12814e7618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
@@ -0,0 +1,5 @@
+lgraph_utils
+===================================
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
new file mode 100644
index 0000000000..572f9ae7c0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
new file mode 100644
index 0000000000..5bfa8a1dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
new file mode 100644
index 0000000000..8680a93ee9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
@@ -0,0 +1,5 @@
+olap_base
+===================================
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
new file mode 100644
index 0000000000..9ce3afba80
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
@@ -0,0 +1,5 @@
+olap_on_db
+===================================
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
new file mode 100644
index 0000000000..5bed2e061c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
@@ -0,0 +1,5 @@
+lgraph
+===================================
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
new file mode 100644
index 0000000000..82bf0941c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
@@ -0,0 +1,5 @@
+olap_profile
+===================================
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
new file mode 100644
index 0000000000..8723e9f1d0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
@@ -0,0 +1,5 @@
+lgraph_atomic
+===================================
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
new file mode 100644
index 0000000000..ec8af7bb8f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
@@ -0,0 +1,5 @@
+lgraph_date_time
+===================================
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
new file mode 100644
index 0000000000..07d6076327
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
@@ -0,0 +1,5 @@
+lgraph_db
+===================================
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
new file mode 100644
index 0000000000..07f4be3f67
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
new file mode 100644
index 0000000000..5be9e6547e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
new file mode 100644
index 0000000000..70a0bd4cbf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
@@ -0,0 +1,5 @@
+lgraph_exceptions
+===================================
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
new file mode 100644
index 0000000000..a4f9af0582
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
@@ -0,0 +1,5 @@
+lgraph_galaxy
+===================================
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
new file mode 100644
index 0000000000..445ef76484
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
@@ -0,0 +1,8 @@
+C++存储过程接口
+===================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..6cb685c909
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
@@ -0,0 +1,25 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python存储过程接口
+====================================
+Version: 4.0.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+介绍
+------------------
+与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。
+
+这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。
+
+接口
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..6f3114566f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
@@ -0,0 +1,19 @@
+# Rust 存储过程
+
+## 1. 介绍
+Rust 存储过程目前仅支持v1版本，TuGraph能够支持一切编译成动态库的语言作为插件。Rust语言作为系统编程语言的新起之秀，在安全性上、可靠性以及人体工程学上相较于C++具有较大优势。
+
+我们提供了TuGraph的[Rust binding]库来支持在Rust中调用lgrahp api，同时提供[tugraph-plugin-util] 工具库来帮助大家更加简洁地编写Rust插件代码。
+
+[Rust binding]: https://crates.io/crates/tugraph
+[tugraph-plugin-util]: https://crates.io/crates/tugraph-plugin-util
+
+## 2. 如何使用
+
+Rust存储过程的使用分三步：
+* 编译，从rust源码编译出so库。我们准备了一份一站式的插件编写教程，从IDE的插件安装，环境配置，到编译，详细参考`rust-tugraph-plugin-tutorial`。
+* 加载，将so库加载到服务端，可以通过REST或RPC接口，这一步和C++库的使用方式类似，可以参考[文档](1.procedure.md#4.Procedure v1接口)。
+* 运行，和c++ procdure使用方式相同，不在赘述。
+
+## 3.API文档
+Rust社区习惯，所有的代码和文档都可以从[`crates.io`](https://crates.io/crates/tugraph )以及[`docs.rs`](https://docs.rs/tugraph/latest/tugraph )找到。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile
new file mode 100644
index 0000000000..08229fb0f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.0.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = Chinese
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst
new file mode 100644
index 0000000000..1fbd71dffb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst
@@ -0,0 +1,12 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure/index.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
new file mode 100644
index 0000000000..81b77be986
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
new file mode 100644
index 0000000000..dae2eb6e32
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api.md
@@ -0,0 +1,2916 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+**注意：除"登陆"、"查询"和"存储过程"外，其余接口自 **2023年4月30日** 起将不再提供支持，统一使用Cypher接口提供服务。**
+
+## 2.请求与数据格式
+
+### 2.1请求
+
+TuGraph 支持 HTTP GET/POST/PUT/DELETE 请求。其中：
+
+- GET 请求用于只读请求，如读取点属性，边属性等操作；
+- POST 请求用于创建实体，提交 Cypher，以及加载和调用存储过程；
+- PUT 请求用于修改已有实体，如修改点属性，边属性等；
+- DELETE 请求用于删除已有实体，如删除点，边等。
+
+在高可用模式下，用户可以在请求的报头(request header)中设置 `server_version` 来保证请求的服务器有足够新的数据。
+当前的 `server_version` 可以从服务器返回的报头中获取。
+
+### 2.2.数据格式
+
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.3.返回值
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 307 Temporary Redirect: 操作被重定向，一般用于高可用模式下，把操作重定向到 master 上
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 500 Internal Server Error: 服务器端错误
+
+当操作成功时，返回的 JSON 中包含操作的返回值。当操作重定向时，返回的 HTTP 报头中的 `location` 域包含重定向目的地址。
+当发生输入错误或者服务器错误时，返回的 JSON 中包含 `error_message` 域，其内容是错误提示。
+
+在高可用模式下，服务器还会在报头中设置 `server_version`，以告知客户端当前服务器的数据版本号。当客户端在不同的服务器之间切换时，该数据版本号可以保证客户端不会读到错误的历史数据。
+
+### 2.4.URI格式
+
+TuGraph REST API 提供以下功能：Service Root, login, info, label, index, node, relationship, cypher, cpp_plugin, 以及 python_plugin。
+各功能使用的 URI 格式如下：
+
+| URI     | 说明                 |
+| ------- | -------------------- |
+| /web    | web 可视化界面       |
+| /cypher | cypher 请求          |
+| /acl    | 权限控制             |
+| /user   | 用户管理             |
+| /login  | 用户登录             |
+| /info   | 数据库状态及提示信息 |
+| /task   | 任务管理             |
+| /db     | 子图操作             |
+
+其中子图操作又分为：
+
+| URI                              | 说明                 |
+| -------------------------------- | -------------------- |
+| /db                              | 子图的创建，删除     |
+| /db/_{graph_name}_/node          | 点操作             |
+| /db/_{graph_name}_/relationship  | 边操作               |
+| /db/_{graph_name}_/label         | Label 相关操作       |
+| /db/_{graph_name}_/index         | 索引相关操作         |
+| /db/_{graph_name}_/cypher        | 子图相关 cypher 操作 |
+| /db/_{graph_name}_/cpp_plugin    | C++存储过程          |
+| /db/_{graph_name}_/python_plugin | Python 存储过程      |
+| /db/_{graph_name}_/import        | 在线导入             |
+| /db/_{graph_name}_/misc          | 其它操作             |
+
+## 3.登录
+
+TuGraph 提供基于 JWT 的用户认证方式，可以使用 HTTP 或 HTTPS 协议进行传输。系统默认使用 HTTP 协议，如果需要使用 HTTPS，需要在 lgraph.json 配置文件中将 ssl_auth 设为 1。
+
+### 3.1.登录
+
+用户通过用户名和密码发送登录请求。登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**: `/login`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.2.身份刷新
+Token失效后，前端发起刷新token接口，后端验证token合法性。初次登录后，1小时内有效，需刷新使用。即使刷新，24小时后也会强制退出，需要重新登陆。
+验证通过，生成新的token；验证失败返回状态码401。
+
+- **URI**: `/refresh`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.修改Token有效期
+修改Token有效期，需要传输jwt，refresh_time和expire_time三个参数，其中jwt用于校验用户身份，refresh_time和expire_time等于0时，有效期为无期限，超过refresh_time时，需要调用refresh接口获取新的Token;超过expire_time时，需要重新登录。
+
+- **URI**: `/update_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+  | refresh_time | 有效时间（默认设置为0） | Int64 |
+  | expire_time | 有效时间（默认设置为0） | Int64 |
+
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0,
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.查询Token有效期
+查询Token有效期，需要传输jwt，用于校验用户身份，返回，refresh_time和expire_time，其中refresh_time表示刷新时间，超过时需要调用refresh接口获取新的Token;expire_time表示过期时间，超过时需要重新登录。
+- **URI**: `/get_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+
+- **RESPONSE**:  如果成功，返回"refresh_time"和"expire_time"。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+
+### 3.5.登出
+用户登出，同时删除token。
+
+- **URI**: `/logout`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/logout
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 4.查询
+
+URI 格式为
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.调用Cypher
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 列表 |
+  | elapsed | 运行时间（秒） | 浮点数 |
+  | header | 返回结果的表头 | 列表 |
+  | size | 结果数 | 整型 |
+
+其中 header 是一个列表，每一元素格式如下：
+
+| 域名 | 说明                                        | 类型   |
+| ---- | ------------------------------------------- | ------ |
+| name | 列名                                        | 字符串 |
+| type | 列数据类型，0 为标量，1 为点 id，2 为向量 |        |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.调用带参数的 Cypher
+
+Cypher 支持使用参数进行查询。当调用带参数的 Cypher 查询时，TuGraph 会缓存该查询的
+执行计划（execution plan），以加速后续同类查询的速度。
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+  | parameters | 参数 | 列表 |
+
+- **RESPONSE**:
+
+与 [调用 Cypher](#%E8%B0%83%E7%94%A8Cypher) 相同。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+
+## 5.存储过程
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.加载存储过程
+
+TuGraph 服务启动时，如果 load_plugins 为真，则会自动加载 plugin 目录下的所有 plugin。否则需要手动加载。此外，如果服务器运行过程中，管理员更新了 plugin 文件，也需要手动重新加载。重新加载 plugin 的调用格式为：
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 插件名称 | 字符串 |
+  | description | 插件说明 | 字符串 |
+  | code_base64 | 插件代码 | 字符串，使用 base64 编码 |
+  | read_only | 是否为只读存储过程 | 布尔值 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 5.2.列出所有存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程列表，其中每个元素是一个 plugin 的描述，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.获取存储过程的详细信息
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程信息，包括代码，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+  | code_base64 | 存储过程的代码 | 字符串，使用 base64 编码 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.调用存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: POST
+- **REQUEST**: 字符串输入
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | data | 输入数据 | 字符串 |
+  | timeout | 超时长度（秒，可选，缺省值为 0） | 浮点 |
+  | in_process | 是否在本进程调用（可选，缺省值为 false） | 布尔值 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.删除存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 6.Deprecated
+
+以下接口将在4/30/2023之后被删除。
+
+### 6.1.用户管理
+
+系统默认创建一个管理员，管理员用户名为 _admin_，密码为 _73@TuGraph_。为了安全起见，请用户在第一次启动服务器后更改密码。
+
+
+#### 6.1.1.添加用户
+
+添加一个新的用户，并为其设置初始密码。只有管理员有权限进行此操作。其中用户名只能由字母，数字以及下划线构成，密码则可以包含任意字符。用户名和密码长度不能超过 64 字节。添加用户时还可以为用户增加一个描述，用户描述可以包含任意字符，最长不超过 512 字节。
+
+新用户默认拥有同名的角色，不具备任何图的权限。
+
+- **URI**: `/user`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "description": "This is a user"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.列出所有用户
+
+列出数据库的所有用户。只有管理员拥有该操作权限。
+
+- **URI**: `/user/`
+- **METHOD**: GET
+- **RESPONSE**: 所有用户及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin admin user",
+        "roles": ["admin"]
+    },
+    "guest1": {
+        "disabled": true,
+        "description": "",
+        "roles": ["guest1", "some_other_role"]
+    }
+}
+```
+
+#### 6.1.3.获取用户信息
+
+列出给定用户的信息。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "A guest user"
+    "roles": ["guest1", "some_other_role"]
+}
+```
+
+#### 6.1.4.列出用户权限
+
+列出给定用户有权限访问的所有图及相应权限。
+
+- **URI**: `/user/{user_name}/graph`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1/graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "graph1" : "FULL",
+    "graph2" : "READ"
+}
+```
+
+#### 6.1.5.更改用户密码
+
+用户可以更改自己的密码，更改密码时需要同时提供原密码。管理员可以更改所有用户的密码。管理员更改其它用户密码时，可以不提供当前密码。
+
+- **URI**: `/user/{user_name}/password`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | current_password | 当前密码 | 字符串 |
+  | new_password | 新密码 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/password
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.6.修改用户描述
+
+用户可以修改自己的描述。管理员可以修改任意用户的描述。
+
+- **URI**: `/user/{user_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "New description for this user."
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.7.删除用户
+
+删除用户及其所有相关权限，只有管理员拥有该操作权限。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.8.禁用用户
+
+用户可以被禁用。被禁用的用户将不能登陆，但是其资料仍然保存。被禁用的用户可以被重新启用。
+
+- **URI**: `/user/{user_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.9.启用用户
+
+启用一个被禁用的用户。
+
+- **URI**: `/user/{user_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.10.设置用户角色
+
+为指定用户设置角色。只有管理员可以执行此操作。
+
+用户角色列表必须是“全量列表”，即该列表需要包含该用户需要的所有角色。唯一的例外是用户的同名角色，即使列表中不含该角色，它也会被加到用户角色中。
+
+- **URI**: `/user/{user_name}/role`
+- **METHOD**: POST
+- **REQUEST**: 角色列表
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+        ["role1", "role2"]
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+此时用户`guest1`拥有角色`guest1`, `role1`和`role2`。
+
+### 6.2.角色管理
+
+TuGraph 使用基于角色的权限管理。
+
+同一用户可以拥有多个角色。新用户默认拥有与其同名的角色。删除用户时，同名角色也会被删除。如果新建用户时同名角色已经存在，则创建失败。
+
+同一角色可以对多个图有不同的权限。用户对某张图的权限由其所有角色对该图的最高权限决定。
+
+TuGraph 使用四级权限，不用的用户对不同的子图可以有不同的权限，四种权限及其说明如下：
+
+| 权限  | 说明                                                                             |
+| ----- | -------------------------------------------------------------------------------- |
+| NONE  | 无权限                                                                           |
+| READ  | 只读                                                                             |
+| WRITE | 可读写子图中的点和边                                                           |
+| FULL  | 完全权限，包括更改元数据（label, index），管理存储过程，以及删除子图中的所有数据 |
+
+管理员对所有子图都有完全权限，新建的用户对所有子图都没有权限。将用户加入管理员角色中可以将用户提升为管理员。
+
+#### 6.2.1.添加角色
+
+添加一个新的角色，并设置其描述。只有管理员有权限进行此操作。
+
+角色名只能由字母，数字以及下划线构成，密码则可以包含任意字符。角色名长度不能超过 64 字节。
+
+角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | role | 角色名 | 字符串 |
+  | description | 角色描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "role": "new_role",
+        "description": "This is a new role.",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.2.修改角色描述
+
+修改角色的描述。只有管理员有权限进行此操作。角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role/{role_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 新描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "modified description"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.列出所有角色
+
+列出数据库的所有角色。只有管理员拥有该操作权限。
+
+- **URI**: `/role/`
+- **METHOD**: GET
+- **RESPONSE**: 所有角色及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin administrator group.",
+        "permissions": {"default":"FULL", "graph1":"FULL"}
+    },
+    "role1": {
+        "disabled": true,
+        "description": "Another role",
+        "permissions": {"default":"READ"}
+    }
+}
+```
+
+#### 6.2.4.获取角色信息
+
+列出给定角色的信息。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: GET
+- **RESPONSE**: 角色信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "Another role",
+    "permissions": {"default":"READ"}
+}
+```
+
+#### 6.2.5.删除角色
+
+删除指定角色，只有管理员拥有该操作权限。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.6.禁用角色
+
+角色可以被禁用。角色被禁用后，具有该角色的用户将不再从该角色中获得任何权限。只有管理员可以执行此操作。
+
+- **URI**: `/role/{role_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.7.启用角色
+
+启用一个被禁用的角色。
+
+- **URI**: `/role/{role_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.8.设置角色权限
+
+为指定角色设置权限。只有管理员可以执行此操作。
+
+角色权限列表必须是“全量列表”，即该列表需要包含该角色能操作的所有图及其权限。
+
+- **URI**: `/role/{role_name}/permissions`
+- **METHOD**: POST
+- **REQUEST**: 图名称及相应权限的字典。
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/permissions
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "graph1" : "FULL",
+        "graph2" : "READ"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.服务器状态
+
+#### 6.3.1.修改服务器配置
+
+修改服务器配置，配置修改后立即生效，并将影响所有服务器。这些配置的优先级高于配置文件以及命令行参数。
+
+- **URI**: `/config`
+- **METHOD**: PUT
+- **REQUEST**:
+
+请求为一个字典，使用 `{"opt1":v1}` 可以将名为`opt1`的配置修改为`v1`。
+
+| 配置名               | 说明                   | 值类型 |
+| -------------------- | ---------------------- | ------ |
+| OPT_DB_ASYNC         | 是否启用异步模式       | 布尔值 |
+| OPT_TXN_OPTIMISTIC   | 是否默认使用乐观事务锁 | 布尔值 |
+| OPT_AUDIT_LOG_ENABLE | 是否启用审计日志       | 布尔值 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "OPT_DB_ASYNC": true,
+        "OPT_AUDIT_LOG_ENABLE": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.当前服务器状态
+
+- **URI**: `/info`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | lgraph_version | 服务器版本号 | 字符串 |
+  | git_branch | 服务器代码分支 | 字符串 |
+  | git_commit | 服务器代码版本 | 字符串 |
+  | web_commit | 前端码版本 | 字符串 |
+  | cpp_id | CPP 编译器 ID | 字符串 |
+  | cpp_version | CPP 编译器版本 | 字符串 |
+  | python_version | PYTHON 版本 | 字符串 |
+  | node | 点 uri | 字符串 |
+  | relationship | 边 uri | 字符串 |
+  | cpu | cpu 信息 | 字典，格式参见[服务器 CPU 状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8CPU%E7%8A%B6%E6%80%81) |
+  | disk | 硬盘 IO 信息 | 字典，格式参见[服务器硬盘状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%A1%AC%E7%9B%98%E7%8A%B6%E6%80%81) |
+  | memory | 内存信息 | 字典，格式参见[服务器内存状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%86%85%E5%AD%98%E7%8A%B6%E6%80%81) |
+  | db_space | 图数据库占用空间 | 字典，格式参见[图数据库占用空间](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8D%A0%E7%94%A8%E7%A9%BA%E9%97%B4) |
+  | db_config | 图数据库配置信息 | 字典，格式参见[图数据库配置信息](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E9%85%8D%E7%BD%AE%E4%BF%A1%E6%81%AF) |
+  | up_time | 数据库在线时长（秒） | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.服务器 CPU 状态
+
+- **URI**: `/info/cpu`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序 CPU 使用率 | 整型 |
+  | server | 服务器 CPU 使用率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.服务器硬盘状态
+
+- **URI**: `/info/disk`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | read | 服务器硬盘读速率 | 整型 |
+  | write | 服务器硬盘写速率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.服务器内存状态
+
+- **URI**: `/info/memory`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序内存使用量 | 整型 |
+  | server_avail | 服务器可用内存 | 整型 |
+  | server_total | 服务器总内存 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.图数据库占用空间
+
+- **URI**: `/info/db_space`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | space | 图数据库占用空间 | 整型 |
+  | disk_avail | 图数据库可用空间 | 整型 |
+  | disk_total | 服务器硬盘总空间 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "disk_avail"::360074579968,
+      "disk_total"::984373800960,
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.图数据库配置信息
+
+- **URI**: `/info/db_config`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | db_async | 图数据库工作模式（同步或异步） | 布尔值 |
+  | disable_auth | 是否禁用身份验证 | 布尔值 |
+  | enable_ha | 是否启用高可用模式 | 布尔值 |
+  | enable_rpc | 是否启用 RPC 服务器 | 布尔值 |
+  | bind_host | REST 服务器的主机 | 字符串 |
+  | enable_audit_log | 是否启用日志审计 | 布尔值 |
+  | port | REST 服务器的端口 | 整型 |
+  | rpc_port | RPC 服务器的端口 | 整型 |
+  | optimistic_txn | 是否默认使用乐观事务锁 | 布尔值 |
+  | thread_limit | 图数据库应用程序的可用线程数 | 整型 |
+  | enable_ssl | 是否使用 SSL 进行身份验证 | 布尔值 |
+  | verbose | 输出的详细程度 | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "db_async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "bind_host":"127.0.0.1",
+      "enable_audit_log":false,
+      "port":7070,
+      "optimistic_txn":false,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "enable_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.8.高可用服务器列表
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/peers`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回一个服务器信息列表，其中每个服务器信息格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+  | state | 服务器状态 | 字符串 |
+
+其中服务器状态可为 `MASTER`,`SLAVE`,`OFFLINE`。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.9.当前 Leader 信息
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/leader`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前 leader 服务器信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.10.服务器统计信息
+
+- **URI**: `/info/statistics`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前服务器统计信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | requests/second | 每秒处理的请求数量 | 浮点型 |
+  | writes/second | 每秒处理的写请求数量 | 浮点型 |
+  | running_tasks | 正在执行的请求数量 | 整型 |
+  | failure_rate | 请求失败率 | 浮点型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 2.3,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.11.审计日志信息
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | begin_time | 查询日志的起始时间(必填，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | end_time | 查询日志的结束时间(默认为当前时间，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | user | 查询日志的操作者(管理员可查询所有用户的日志，普通用户只能查询本人日志) | 字符串 |
+  | num_log | 查询日志的数量(默认为 100) | 整型 |
+  | descending_order | 查询结果是否降序输出(默认为 true) | 布尔值 |
+
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回审计日志列表，其中每个元素是一条操作日志，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | index | 该操作的索引值 | 整型 |
+  | begin_time | 该操作的开始时间 | 字符串 |
+  | end_time | 该操作的结束时间 | 字符串 |
+  | user | 该操作的发起者 | 字符串 |
+  | graph | 该操作的图 | 字符串 |
+  | type | 该操作的类型 | 字符串 |
+  | read_write | 该操作为读操作或者写操作 | 字符串 |
+  | success | 该操作是否成功 | 布尔值 |
+  | content | 该操作的简要内容 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.任务管理
+
+TuGraph 提供长任务的跟踪和中止功能。用户可以通过 REST API 来查询当前正在运行的在 Cypher 和存储过程查询，并选择中止正在执行的查询。
+
+任务管理对应的 URI 格式为
+
+```
+    http://{host}:{port}/task/{thread_id}/{task_id}
+```
+
+#### 6.4.1.查询正在执行的任务
+
+- **URI**: `/task`
+- **METHOD**: GET
+- **RESPONSE**:
+
+返回的 JSON 为一个数组，其中每一个元素格式如下：
+
+| 域名         | 说明                         | 类型   |
+| ------------ | ---------------------------- | ------ |
+| description  | 任务描述                     | 字符串 |
+| time_elapsed | 任务已经执行的时间，单位为秒 | 浮点   |
+| task_id      | 任务 ID                      | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.中止任务
+
+- **URI**: `/task/{task_id}`
+  其中 `{task_id}` 是 `GET /task` 返回结果中的 `task_id`。
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.5.子图管理
+
+TuGraph 支持多子图，子图之间完全独立，不同的子图可以对不同用户开放不同权限。管理员可以添加和删除子图。
+
+#### 6.5.1.创建新子图
+
+- **URI**: `/db`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 子图名 | 字符串 |
+  | config | 配置 | 字典，格式为 { {列名 1}:{列值 1},... } |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1",
+        "config" : {
+            "max_size_GB":2048,
+            "description": "description of graph1"
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.删除子图
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.列出所有子图
+
+- **URI**: `/db`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_GB":1024,
+            "description":"description of graph1"
+        }
+    }
+```
+
+#### 6.5.4.获取子图信息
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "max_size_GB":1024,
+        "description":"description of graph1"
+    }
+```
+
+### 6.6.元数据管理
+
+TuGraph 是一个具备多图能力的强模式属性图数据库。在每一张子图中，每种点和边都需要有预定义的数据格式。数据格式由 Label 决定，每种 Label 都有自己的数据格式。用户可以使用 REST API 添加，删除和查询 Label 及其对应的数据格式。
+
+Label 操作对应的 URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+其中{type}可以是 node 或者 relationship。
+
+#### 6.6.1.创建Label
+
+创建 Label 的过程同时也是定义其数据类型的过程。只有创建了 Label 才能在图中插入相应类型的点或者边。
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | Label 名 | 字符串 |
+  | fields | 数据列定义 | 列表 |
+  | is_vertex | 是否是点 Label | 布尔值 |
+  | primary | 点的主键属性 | 字符串 |
+  | edge_constraints | 边的约束 | 列表 |
+
+`primary` 在 `is_vertex` 为 `true` 的时候设置，这个字段只有点才有, 创建点的时候必须设置。
+
+`edge_constraints` 在 `is_vertex` 为 `false` 的时候设置，这个字段只有边有。这个字段限制了该边的起点和终点只能是哪些点的组合，比如：`[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`，限制了该边只能是从 `vertex_label1` 到 `vertex_label2` 和 从 `vertex_label3` 到 `vertex_label4`。如果不想有任何限制，不设置该字段即可。
+
+其中`fields`为一个数组，其中每个元素定义数据的一列，内容如下：
+
+| 域名     | 说明                                     | 类型                                                                                                |
+| -------- | ---------------------------------------- | --------------------------------------------------------------------------------------------------- |
+| name     | 列名                                     | 字符串                                                                                              |
+| type     | 列数据类型                               | 字符串，有以下类型： int8, int16, int32, int64, float, double, string, date, datetime, binary, bool |
+| optional | 数据是否可以为空（可选，缺省值为 false） | 布尔值                                                                                              |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.列出所有 Label
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | edge | 边 Label 列表 | 列表 |
+  | vertex | 点 Label 列表 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.获取 Label 的数据格式定义
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+- **METHOD**: GET
+- **RESPONSE**: 数据列定义表，类型是一个词典，key 为列名，value 为列定义，列定义见如下：
+-
+
+| 域名     | 说明             | 类型   |
+| -------- | ---------------- | ------ |
+| optional | 该列值是否可为空 | 布尔值 |
+| type     | 列值类型         | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema 导入
+
+- **URI**: `/db/{graph_name}/schema/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+- **RESPONSE**:
+
+Schema 导入会根据 description 比较新的 Schema 和数据库中原有的 Schema 是否兼容，检查的粒度为 Label。如果不一致则出错，如果一致则添加原先 Schema 中不存在的 Label，返回 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串:
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.点操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+Nodes 提供节点（Vertex）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。
+
+#### 6.7.1.列出点数量和label数量
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | num_label | 点 label 数量 | 整数 |
+  | num_vertex | 点数量 | 整数 |
+
+_注意 num_vertex 返回的并不是准确的点数量，只是一个估计值。_
+
+#### 6.7.2.创建一个点
+
+向数据库中插入一个点。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 点属性 | 字典，其中 key 是列名，value 是相应值。value 必须是与列类型相应的类型，如列为 int32，则 value 只能是整数。 |
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新点 vid。该 ID 可用于后续的点操作中。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.批量创建点
+
+TuGraph 允许一次性插入多个点，以减少网络开销。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | fields | 点属性 | 列表 |
+  | values | 点数据 | 列表 |
+
+其中 fields 是一个字符串列表，列出一系列列名；values 是一个列表，其中每个元素是一个列表，列表中每个元素是列数据。
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新增加的点的 vid 列表，该列表中每一个 vid 按顺序对应请求中的每一个点。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.获取点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 属性 | 字典，格式为 { {列名 1}:{列值 1},...} |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.删除点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 被删掉的点的入边数量 | 整数值 |
+  | out | 被删掉的点的出边数量 | 整数值 |
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.获取点所有属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+- **METHOD**: GET
+- **RESPONSE**: Node 所有属性（字典）
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.获取点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: Node 某一属性
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.更新点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 点属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "********"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.8.边操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+与 Nodes 功能类似，Relationships 提供边（edge）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。每一条边都可以由一个唯一 ID（euid）来标识。这个 ID 可以从在插入边时获得，或者在 [列出所有边](#%E5%88%97%E5%87%BA%E6%89%80%E6%9C%89%E8%BE%B9) 操作中得到。
+
+#### 6.8.1.创建一条边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | destination | 目的点 ID | 整数值 |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid（字符串）。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.批量创建边
+
+- **URI**: `/db/{graph_name}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | fields | 数据列名 | 列表 |
+  | edge | 边数据 | 列表 |
+
+其中 edge 是一个数据列表，其中每个元素都是一条边，其定义如下：
+
+| 域名        | 说明     | 类型                                                   |
+| ----------- | -------- | ------------------------------------------------------ |
+| source      | 起点 id  | 整数                                                   |
+| destination | 终点 id  | 整数                                                   |
+| values      | 数据列表 | 列表，每列对应 fields 中的一个列，类型是该列对应的类型 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid 列表。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.列出所有出边（outgoing relationships）
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+- **METHOD**: GET
+- **RESPONSE**: 点 src 的所有出边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.列出所有入边（incoming relationships）
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+- **METHOD**: GET
+- **RESPONSE**: 点 dst 的所有入边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.列出所有边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 入边 | 列表 |
+  | out | 出边 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationships/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.获取边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | property | 边属性 | 字典 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.删除边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.获取边的所有属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+- **METHOD**: GET
+- **RESPONSE**: 边属性字典
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.获取边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功,返回代码 200,同时返回边的属性。如果失败,返回代码 400,同时返回 "Illegal field."。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.更新边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.9.索引
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+提供索引操作，接受 GET/POST 请求。
+
+#### 6.9.1.创建索引
+
+该操作会启动一个创建索引的后台任务，用户可以通过列出该 Label 相关的所有索引来检查新建索引的状态。
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: POST
+- **REQUEST**:
+
+| 域名      | 说明       | 类型                                                |
+| --------- | ---------- | --------------------------------------------------- |
+| label     | Label 名   | 字符串                                              |
+| field     | 域名       | 字符串                                              |
+| is_unique | 唯一性标识 | 布尔值，如果为 true，表示该 index 中的 key 是唯一的 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.列出所有索引
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.列出所有与某个 Label 相关的索引
+
+- **URI**: `/db/{graph_name}/index/{label}`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.删除索引
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.根据索引获取点
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+- **METHOD**: GET
+- **RESPONSE**: 点 vid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+### 6.10.在线增量导入
+
+#### 6.10.1.指定文件内容导入
+
+- **URI**: `/db/{graph_name}/import/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+  | data | 要导入的文件内容（建议最大在 16MB 左右，最长不超过 17MB） | 字符串 / 数组 / 对象 |
+  | continue_on_error | 出错后是否继续导入（可选，默认为`false`
+  ） | 布尔值 |
+  | delimiter | 分隔符（可选，默认为`“,”`
+  ） | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+分隔符可以是单字符，也可以是字符串，但不能包含`\r`或者`\n`。
+
+data 可以是如下形式之一：
+
+- 字符串如 `"1,2\n3,4\n"`
+- ASCII 码组成的数组如 `[49,44,50,10,51,44,52,10]`
+- 形如上述数组的字典如 `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+- **RESPONSE**:
+
+系统**不会**自动执行新建 label、添加索引等操作。在此操作之前需要保证涉及的 label 已经存在并具有适当的索引。
+
+如果成功导入完毕，返回代码 200，并在 `log` 字段返回一些日志信息（可能为空）；否则，保证所有的数据均未被导入，并在 `error_message` 字段返回错误信息。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true,
+      "delimiter": ","
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+由于请求中指定了在出错时继续，该返回信息说明 SRC_ID 为 1 的边没有被导入，而其他信息导入成功。
+
+### 6.11.其他
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.提取子图
+
+给出点 id 集合，返回包含该集合的最小子图。
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | vertex_ids | 点 id 集合 | 列表 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | nodes | 点数据 | 列表，每元素包含 vid, label, 以及属性 |
+  | relationships | 边数据 | 列表，每元素包含 src, dst, euid, label, 以及属性 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example response.**
+
+```
+• 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
new file mode 100644
index 0000000000..21ad033477
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
@@ -0,0 +1,273 @@
+# RPC API
+
+> 此文档主要介绍 TuGraph 的 RPC API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供丰富的 RPC API，以供开发者通过 RPC 请求远程调用 TuGraph 提供的服务。
+
+RPC（远程过程调用）是一种通过网络从远程计算机程序上请求服务，而不需要了解底层网络技术的协议。
+相比REST，RPC 面向方法，主要用于函数方法的调用，可以适合更复杂通信需求的场景，且性能更高。
+brpc是用c++语言编写的工业级RPC框架，基于brpc，TuGraph 提供了丰富的RPC API，本文档描述
+TuGraph 的 RPC API 使用方式。
+
+## 2.请求
+
+### 2.1.建立连接
+
+开发者向TuGraph服务发送RPC请求，首先要建立连接。以C++语言为例，开发者创建指定url的通道（channel），
+由通道创建指定的服务存根（LGraphRPCService_Stub），后续即可通过存根像调用本地方法一样向远程
+服务器发送请求。
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.请求类型
+
+TuGraph支持10种RPC请求，其中每种请求的功能如下表所示：
+
+| 请求              | 功能         |
+|-----------------|------------|
+| GraphApiRequest | 点边索引操作请求   |
+| CypherRequest   | cypher请求   |
+| PluginRequest   | 存储过程请求     |
+| HARequest       | 高可用模式请求    |
+| ImportRequest   | 数据导入请求     |
+| GraphRequest    | 子图操作请求     |
+| AclRequest      | 权限管理请求     |
+| ConfigRequest   | 配置管理请求     |
+| RestoreRequest  | 备份请求       |
+| SchemaRequest   | schema管理请求 |
+
+用户发送请求时，需要传入以下参数：
+- client_version: 可选参数，HA模式下可通过对比`client_version`和`server_version`防止响应过时的请求
+- token: 必要参数，客户端登陆之后获得token，每次请求传入token以校验用户身份
+- is_write_op: 可选参数，标志请求是否是写请求
+- user: 可选参数，HA模式下主从之间同步请求时设置user，不需验证token
+
+服务处理完RPC请求之后发回响应，响应消息中除了包含每个请求的单独响应信息之外，还包含以下参数：
+- error_code: 必要参数，标志请求处理状态
+- redirect: 可选参数，HA模式下向follower发送写请求时处理失败，设置redirect为请求转发地址，即leader地址
+- error: 可选参数，请求错误信息
+- server_version: 可选参数，HA模式的请求响应中设置`server_version`以避免client读取数据时发生反向时间旅行问题
+
+:warning:  **除CypherRequest、PluginRequest、HARequest和AclRequest外，其余RPC接口将逐步废弃，其功能统一至CypherRequest接口。**
+
+## 3.登录
+
+登录请求信息包含以下参数：
+- user: 必要参数，用户名
+- pass: 必要参数，密码
+以C++为例，用户使用构建好的服务存根发送登录请求：
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+登录响应信息包含以下参数：
+- token: 必要参数，登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。
+如果登录失败会收到“Authentication failed”错误。
+
+## 4.查询
+用户可以通过Cypher查询和TuGraph进行绝大多数的交互，Cypher请求信息包含以下参数：
+- query: 必要参数，Cypher查询语句
+- param_names: 可选参数，参数名
+- param_values: 可选参数，参数值
+- result_in_json_format: 必要参数，查询结果是否以JSON格式返回
+- graph: 可选参数，Cypher语句执行的子图名称
+- timeout: 可选参数，Cypher语句执行的超时时间
+
+以C++为例，用户发送Cypher请求的方式如下所示：
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+Cypher请求响应为以下两个参数之一：
+- json_result: JSON格式的cypher查询结果
+- binary_result: CypherResult格式的cypher查询结果
+
+## 5.存储过程
+为满足用户较为复杂的查询/更新逻辑，TuGraph支持 C 语言和 Python 语言编写的存储过程。
+用户可以使用RPC请求对存储过程进行增删改查操作。
+
+### 5.1.加载存储过程
+加载存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- read_only: 必要参数，是否只读
+- code: 必要参数，存储过程文件读入生成的ByteString
+- desc: 可选参数，存储过程描述
+- code_type: 可选参数，存储过程代码类型，PY、SO、CPP、ZIP四者之一
+
+以C++为例，用户加载存储过程的方式如下所示：
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+加载存储过程的响应不包含参数，如果加载失败则抛出BadInput异常
+
+### 5.2.调用存储过程
+
+调用存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- param: 必要参数，存储过程参数
+- result_in_json_format: 可选参数，调用结果是否以JSON格式返回
+- in_process: 可选参数，未来支持
+- timeout: 可选参数，调用存储过程的超时时间
+
+以C++为例，用户调用存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+调用存储过程的响应为以下两个参数之一：
+- reply: ByteString格式的存储过程调用结果
+- json_result: JSON格式的存储过程调用结果
+
+### 5.3.删除存储过程
+
+删除存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+
+以C++为例，用户删除存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+删除存储过程的响应不包含参数，如果删除失败则抛出BadInput异常
+
+### 5.4.列举存储过程
+
+列举存储过程请求不需要参数，以C++为例，用户列举存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+列举存储过程的响应的参数如下所示：
+- reply: JSON格式的procedure列表
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst
new file mode 100644
index 0000000000..f509ac8dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst
@@ -0,0 +1,8 @@
+网络协议
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
new file mode 100644
index 0000000000..2b3ed1f0ff
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
@@ -0,0 +1,72 @@
+# Learn Tutorial
+
+> 本文档是为 TuGraph 的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对 TuGraph 的图学习运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于 Tugraph 的一个简单的程序实例，我们将重点介绍其使用方式。
+
+## 1.TuGraph 图学习模块简介
+图学习是一种机器学习方法，其核心思想是利用图结构中的拓扑信息，通过顶点之间的联系及规律来进行数据分析和建模。不同于传统机器学习方法，图学习利用的数据形式为图结构，其中顶点表示数据中的实体，而边则表示实体之间的关系。通过对这些顶点和边进行特征提取和模式挖掘，可以揭示出数据中深层次的关联和规律，从而用于各种实际应用中。
+
+这个模块是一个基于图数据库的图学习模块，主要提供了四种采样算子：Neighbor Sampling、Edge Sampling、Random Walk Sampling 和 Negative Sampling。这些算子可以用于对图中的顶点和边进行采样，从而生成训练数据。采样过程是在并行计算环境下完成的，具有高效性和可扩展性。
+
+在采样后，我们可以使用得到的训练数据来训练一个模型。该模型可以用于各种图学习任务，比如预测、分类等。通过训练，模型可以学习到图中的顶点和边之间的关系，从而能够对新的顶点和边进行预测和分类。在实际应用中，这个模块可以被用来处理各种大规模的图数据，比如社交网络、推荐系统、生物信息学等。
+
+## 2. 运行流程
+TuGraph 图学习模块将TuGraph中的图数据采样，采样后的顶点和边作为图学习的特征，进行学习训练。运行流程如下图所示：
+![Alt text](../../../../../images/learn_flow_chart_zh.png)
+## 3. 数据导入
+数据导入请参考[数据导入](../../../5.developer-manual/3.server-tools/1.data-import.md)
+
+导入过程以cora数据集为例：
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+其中cora.conf为图schema文件，代表图数据的格式。cora_db为导入后的图数据文件名称，代表图数据的存储位置。
+## 4. feature特征转换
+由于图学习中的feature特征一般表示为较长的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./cora_db`
+即可进行转换。
+## 5. 采样算子及编译
+TuGraph在cython层实现了一种获取全图数据的算子及4种采样算子，具体如下：
+### 5.1.采样算子介绍
+| 采样算子 | 采样方式 |
+| --- | --- |
+| GetDB | 从数据库中获取图数据并转换成所需数据结构 |
+| Neighbor Sampling | 根据给定的顶点采样其邻居顶点，得到采样子图 |
+| Edge Sampling | 根据采样率采样图中的边，得到采样子图 |
+| Random Walk Sampling | 根据给定的顶点，进行随机游走，得到采样子图 |
+| Negative Sampling | 生成不存在边的子图。 |
+
+### 5.2.编译
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+得到算子so后，在Python中import 即可使用。
+
+## 6. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在tugraph-db/learn/example文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+## 7. 模型加载
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+在使用保存的模型之前，首先需要对其进行加载。代码中，使用如上的代码对已训练模型进行加载。
+
+加载之后，我们可以使用模型对新的顶点和边进行预测和分类。在预测时，我们可以输入一个或多个顶点，模型将输出相应的预测结果。在分类时，我们可以将整个图作为输入，模型将对图中的顶点和边进行分类，以实现任务的目标。
+使用已训练的模型可以避免重新训练模型的时间和资源消耗。此外，由于模型已经学习到了图数据中顶点和边之间的关系，它可以很好地适应新的数据，从而提高预测和分类的准确度。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
new file mode 100644
index 0000000000..2a1c0ac8d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
@@ -0,0 +1,97 @@
+# Sampling API
+
+> 此文档主要详细介绍了Sampling API的使用说明
+
+## 1. 概述
+
+本手册介绍使用TuGraph的Sampling API接口。
+
+## 2. 图数据预处理
+在采样操作之前，根据图数据路径加载图数据，并映射成olapondb图分析类，代码如下：
+
+```python
+galaxy = PyGalaxy(args.db_path) # 根据路径创建一个galaxy实例
+galaxy.SetCurrentUser(args.username, args.password) # 设置当前用户
+db = galaxy.OpenGraph('default', False) # 打开图数据库指定db
+txn = db.CreateReadTxn() # 创建一个事务实例
+olapondb = PyOlapOnDB('Empty', db, txn) # 根据图加载方式、图数据库实例、事务实例实例化OlapOnDB
+del txn
+del db
+del galaxy
+```
+## 3. 图采样算子介绍
+图采样算子在cython层实现，用于对输入的图进行采样处理，生成的NodeInfo用于保存feature属性、label属性等点信息，EdgeInfo用于保存边信息，这些元数据信息可以被用于特征抽取、网络嵌入等任务中。目前TuGraph图学习模块支持GetDB、NeighborSampling、EdgeSampling、RandomWalkSampling、NegativeSampling五种采样算子。
+### 3.1.RandomWalk算子：
+在给定的采样点周围进行指定次数的随机游走，得到采样子图。
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+step: size_t类型，采样步数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.2.NeighborSample算子：
+在给定采样点的一度邻居中采样一定数量的点，得到采样子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+nei_num: size_t类型，邻居采样点数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.3.Nagetive算子：
+采用负采样算法，生成不存在边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+num_samples: size_t类型，生成不存在边的数量。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值： 无。
+
+### 3.4.EdgeSampling算子：
+根据边采样率，生成采样边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list,EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_rate: double类型，采样率。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.5.GetDB算子：
+从数据库中获取图数据并转换成所需数据结构。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+## 4. 用户自定义采样算法
+用户也可以通过TuGraph Olap接口实现自定义采样算法，接口文档参见[此处](../2.olap/5.python-api.md)，该文档主要介绍图采样算法使用的相关函数的接口设计。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md
new file mode 100644
index 0000000000..67574cea1e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md
@@ -0,0 +1,106 @@
+# Training
+
+> 本文档详细介绍了如何使用TuGraph进行图神经网络（GNN）的训练。
+
+## 1. 训练
+使用TuGraph 图学习模块进行训练时，可以分为全图训练和mini-batch训练。
+全图训练即把全图从TuGraph db加载到内存中，再进行GNN的训练。而mini-batch训练则使用上面提到的TuGraph 图学习模块的采样算子，将全图数据进行采样后，再送入训练框架中进行训练。
+## 2. Mini-Batch训练
+Mini-Batch训练需要使用TuGraph 图学习模块的采样算子，目前支持Neighbor Sampling、Edge Sampling、Random Walk Sampling和Negative Sampling。
+TuGraph 图学习模块的采样算子进行采样后的结果以List的形式返回。
+下面以Neighbor Sampling为例，介绍如何将采样后的结果，进行格式转换，送入到训练框架中进行训练。
+用户需要提供一个Sample类：
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. 加载图数据
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+
+        # 2. 采样方法，结果存储在NodeInfo和EdgeInfo中
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+
+        # 3. 对结果进行格式转换，使之符合训练格式
+        src = EdgeInfo[0].astype('int64')
+        dst = EdgeInfo[1].astype('int64')
+        nodes_idx = NodeInfo[0].astype('int64')
+        remap(src, dst, nodes_idx)
+        features = NodeInfo[1].astype('float32')
+        labels = NodeInfo[2].astype('int64')
+        g = dgl.graph((src, dst))
+        g.ndata['feat'] = torch.tensor(features)
+        g.ndata['label'] = torch.tensor(labels)
+        return g
+```
+如代码所示，首先将图数据加载到内存中。然后使用采样算子对图数据进行采样，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+最后对结果进行格式转换，使之符合训练格式。这里我们使用的是DGL训练框架，因此使用结果数据构造了DGL Graph，最终将DGL Graph返回。
+我们提供TuGraphSample类之后，就可以使用它进行Mini-Batch训练了。
+令DGL的数据加载部分使用TuGraphSample的实例sampler：
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+使用DGL进行模型训练：
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+
+## 3. 全图训练
+GNN（图神经网络）的全图训练是一种涉及一次处理整个训练数据集的训练。它是 GNN 最简单、最直接的训练方法之一，整个图被视为单个实例。 在全图训练中，整个数据集被加载到内存中，模型在整个图上进行训练。这种类型的训练对于中小型图特别有用，并且主要用于不随时间变化的静态图。
+在算子调用时，使用以下方式：
+```python
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+获取全图数据，然后将全图送入训练框架中进行训练。
+完整代码：请参考learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst
new file mode 100644
index 0000000000..e79e36ea91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst
@@ -0,0 +1,8 @@
+图学习
+======
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/index.rst
new file mode 100644
index 0000000000..2dbfe16fbd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/6.interface/index.rst
@@ -0,0 +1,12 @@
+编程接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.query/index.rst
+   2.olap/index.rst
+   3.procedure/index.rst
+   4.protocol/index.rst
+   5.learn/index.rst
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md
new file mode 100644
index 0000000000..ff3fcd8048
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# 单元测试
+
+> 该文档是TuGraph的单元测试文档
+
+## 1.简介
+
+TuGraph单元测试采用gtest框架，可以选择一次跑全部test或者制定某些test。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md
new file mode 100644
index 0000000000..5d49f35255
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md
@@ -0,0 +1,399 @@
+# 集成测试
+
+> 此文档主要介绍 TuGraph 的集成测试框架如何使用
+
+## 1.TuGraph集成测试的意义
+
+在单元测试与功能测试中，有部分用例直接开启galaxy或statemachine来进行测试，这并不是一个完整的流程。在完整的cs架构中，用户请求是通过客户端发往服务端，网络通信是必不可少的，为了避免单元测试不完整带来的bug，针对这种情况，使用集成测试框架进行全链路的完整测试。
+
+## 2.TuGraph集成测试框架
+
+TuGraph采用pytest框架作为自己的集成测试框架，pytest框架作为目前使用最广泛的cs端集成测试框架，以其灵活简单，容易上手，并且支持参数化的使用方式而著称，TuGraph基于pytest提供的功能，抽象出了不同的工具，通过参数来控制各个工具的处理逻辑，以方便大家进行高效的测试代码开发。
+
+更多pytest信息请参考官网: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.组件描述
+
+| 组件名称            | 组件功能                       | 实现方式                                  |
+|-----------------|----------------------------|---------------------------------------|
+| server          | TuGraph单机服务                | 开启子进程并在子进程中启动服务                       |
+| client          | TuGraph Rpc Client         | 当前进程中开启TuGraph Python Rpc Client发送请求  |
+| importor        | TuGraph Importor           | 开启子进程并在子进程中处理导入请求                     |
+| exportor        | TuGraph Exportor           | 开启子进程并在子进程中处理导出请求                     |
+| backup_binlog   | TuGraph Backup Binlog      | 开启子进程并在子进程中处理备份binlog的请求              |
+| backup_copy_dir | TuGraph Backup             | 开启子进程并在子进程中处理备份完整db的请求                |
+| build_so        | 编译c++动态连接库的组件              | 开启子进程并在子进程中处理gcc编译逻辑                  |
+| copy_snapshot   | TuGraph Copy Snapshot      | 当前进程中处理备份snapshot的请求                  |
+| copydir         | 文件夹拷贝                      | 当前进程中处理文件夹拷贝请求                        |
+| exec            | 执行c++/java可执行文件            | 开启子进程并在子进程中启动C++可执行文件                 |
+| algo            | 执行算法                       | 开启子进程并在子进程中执行算法                       |
+| bash            | 执行bash命令                   | 开启子进程并在子进程中执行bash命令                   |
+| rest            | TuGraph Python Rest Client | 当前进程中开启TuGraph Python Rest Client发送请求 |
+
+### 2.2.组件用法
+
+#### 2.2.1.server
+
+##### 2.2.1.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动server，函数执行完成后会停止server，并清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.启动参数
+采用python字典传入
++ host是TuGraph Server的ip和端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导入不同的数据，函数开始执行前会导入数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导出不同的数据，函数开始执行前会导出数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的binlog，函数开始执行前会拷贝binlog到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的db，函数开始执行前会拷贝db到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.启动参数
+采用python字典传入
++ cmd是启动命令，采用python列表传入，可以一次编译多个so
++ so_name是执行完成后需要清理的so，可以是多个，通过python列表传入
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制编译不同的so，函数开始执行前会生成so到指定的目录，函数执行完成后会清理so_name列表指定的动态库
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的snapshot，函数开始执行前会拷贝src中的snapshot到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的目录，函数开始执行前会拷贝src到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的命令
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ result是算法预期的执行结果，执行完成会通过实际结果与预期结果进行比较，不同则测试失败
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的算法逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的算法，函数主体等待算法执行完成后对比结果
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的bash命令，函数开始执行前会开启子进程执行通过cmd参数传入的bash命令，函数主体等待算法执行完成
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.启动参数
+采用python字典传入
++ port是TuGraph Server的端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来链接不同的TuGraph Rest Server，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.测试样例
+
+#### 2.3.1.rest
+
+样例代码中在test_get_info函数执行之前先启动server，server启动后启动了rest client，进入test_get_info函数后获取server的一些信息，并通过assert判断是否有获取到cpu的信息。
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+样例代码中在test_flushdb函数执行之前先执行了数据离线导入逻辑，并启动server后，通过client创建链接，进入test_flushdb函数后，通过查询点的个数判断导入是否成功，导入成功后执行flushDB操作，再次通过assert判断是否能正常清空db
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+     assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+样例代码中在test_export_default函数执行之前先执行了数据离线导入逻辑，导入成功后将当前db的数据导出，然后再次通过离线导入逻辑将exportor导出的数据导入到新的目录中，以新导入的数据启动db，并且创建链接。在test_export_default函数主体中判断导出后再次导入的数据是否与原始数据一致
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.其他测试
+更多用例请参考集成测试代码 [https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration)
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/7.quality/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/7.quality/index.rst
new file mode 100644
index 0000000000..32345a1d33
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/7.quality/index.rst
@@ -0,0 +1,8 @@
+测试与质量保障
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/8.other/1.privilege.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/8.other/1.privilege.md
new file mode 100644
index 0000000000..30b26dd16f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/8.other/1.privilege.md
@@ -0,0 +1,132 @@
+# 用户权限
+
+## 1.介绍
+
+> TuGraph 的权限是基于角色的访问控制进行管理，定义访问控制的权限分配给角色，角色再分配给用户。
+
+## 2.权限层级
+
+- Global 层：即全局权限，对管理、图操作均有权限；
+- Graph 层：即图级别，对每个图的权限；
+- （仅商业化版本支持）Property 层：即属性级别，对某个属性的权限控制
+
+## 3.权限关键字
+
+目前权限的控制较为简洁
+
+- Global 层目前为 admin 权限，并且预置了 admin 用户；
+
+* Graph 层的操作权限分为四种：none，read，write，full
+  - none：无权限，对于图没有任何操作权限
+  - read：只读权限，对于图只具备读取权限
+  - write：读写权限，对于图不仅具备读取权限，还具备了写入的权限
+  - full：所有权限，对于图不仅具备读写权限，同时也具备删除图、修改图、修改 Schema 等权限
+* （仅商业化版本支持）Property 层的权限分别为：none，read，write
+  - none：无权限，对于该属性没有任何操作权限
+  - read：只读权限，对于该属性只具备读取权限
+  - write：读写权限，对于该属性不仅具备读取权限，还具备了写入的权限
+
+## 4.常用权限操作
+
+### 4.1.用户操作
+
+- 创建用户
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- 删除用户
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- 修改当前用户密码
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- 修改指定用户密码
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- 禁用/启用用户
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- 列出所有用户
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- 列出当前用户信息
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- 获取用户详情
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.角色操作
+
+- 创建角色
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- 删除角色
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- 列出所有角色
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- 禁用/启用角色
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.赋予用户角色
+
+- 新增用户与角色的联系
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- 删除用户与角色的联系
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- 清空用户角色的关系并重建
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.角色赋权
+
+- 修改角色对指定图的访问权限
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/8.other/2.token.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/8.other/2.token.md
new file mode 100644
index 0000000000..f99a3fee35
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/8.other/2.token.md
@@ -0,0 +1,50 @@
+# Token使用说明
+
+## 1.Token介绍
+JWT（JSON Web Token）是一种用于认证和授权的开放标准。它基于JSON（JavaScript Object Notation）格式，并被设计用于在网络应用之间安全地传输声明（claims）信息。
+
+JWT由三部分组成：头部（Header）、负载（Payload）和签名（Signature）。头部包含了JWT的类型以及所使用的签名算法，负载包含了需要传输的信息，而签名用于验证JWT的完整性和真实性。
+
+在TuGraph中，JWT用于实现无状态的认证和授权机制。当用户登录成功后，服务端会生成一个JWT并将其返回给客户端。客户端在后续的请求中将这个JWT作为身份凭证传递给服务端。服务端收到JWT后，通过验证签名和解析负载中的信息，判断用户的身份和权限，并决定是否允许该请求的执行。
+
+## 2. Token有效期
+
+### 2.1. 浏览器Token交互逻辑
+1. 用户打开浏览器，输入账号密码，并点击登录。
+2. 前端调用登录接口，向后端输入账号和密码。
+3. 后端接收到账号密码后，进行校验，校验成功后，返回Token。
+4. 前端将Token存储在浏览器缓存中，后续请求都要携带此Token。
+5. 如果前端，主动点击登出和关闭页面，前端应主动调用登出接口，向后端传递Token。
+6. 后端接收后，将Token失效，返回状态码200，以及“等出成功”。前端接收到信息后，清空浏览器内存中的Token，并将页面退至登录页。
+7. Token失效（初始设置为24小时），需要用户重新登录。
+
+### 2.3. Token有效期刷新机制
+
+Token有效期存在刷新机制，默认关闭。如果打开后，Token的安全性会更高，实现上则存在两个时间戳。
+
+第一个时间戳`refresh_time`用于判定Token是否过期（默认24小时）：过期后可以调用刷新接口获取新的Token，可以设置为更短的时间，比如1小时。
+
+第二个时间戳`expire_time`为强制过期时间戳（默认24小时）：过期后必须重新登陆。
+
+### 2.4. Token有效期修改
+为了方便开发者自行开发，TuGraph提供了两种方式修改有效期，均需要admin权限。
+
+* 通过接口调用设置。涉及有效期修改的接口`update_token_time`和有效期查询接口`get_token_time`。
+具体可查询[REST接口文档](../../5.developer-manual/6.interface/4.protocol/1.restful-api.md)。
+
+* 通过启动参数设置。server端启动时，添加参数`-unlimited_token 1` 参数可以设置为无期限。可参考[服务运行文档](../../5.developer-manual/2.running/2.tugraph-running.md)。
+
+## 3. 客户端发送Token相关请求介绍
+
+客户端会两种协议处理相关请求，一种是REST，一种是RPC。
+
+### 3.1. REST
+如果客户端使用REST协议（包括Browser浏览器），由于是短链接，在每一次请求中都需要携带Token，过期后需要获取新的Token。
+
+对于自行开发的客户端，若采用REST协议则需要考虑Token的逻辑。
+
+### 3.2. RPC
+如果客户端使用RPC协议（包括官方的C++/Java/Python），使用长连接保持，登陆后不涉及Token操作。
+
+## 4. Token上限
+Token上限是指一个用户最多可以同时拥有的Token数量。为防止无限登陆，Token上限默认为10000。由于Token生成逻辑和时间强相关，每登录一次会生成一个Token进行存储，Token有效期默认为24小时，因此建议登录后不使用的Token及时登出。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/8.other/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/8.other/index.rst
new file mode 100644
index 0000000000..e23467ac4c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/8.other/index.rst
@@ -0,0 +1,8 @@
+权限管理
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/index.rst
new file mode 100644
index 0000000000..0a60fbc698
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/5.developer-manual/index.rst
@@ -0,0 +1,16 @@
+开发者文档
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.installation/index.rst
+   2.running/index.rst
+   3.server-tools/index.rst
+   4.client-tools/index.rst
+   5.ecosystem-tools/index.rst
+   6.interface/index.rst
+   7.quality/index.rst
+   8.other/index.rst
+
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..8a0386047c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/1.contributing.md
@@ -0,0 +1,78 @@
+# 如何贡献
+
+## 1. 前言
+感谢您为TuGraph做出贡献，我们由衷地希望有更多社区的同学加入进来，一起建设一个更好的图数据库项目。
+
+在贡献代码之前，请您稍微花一些时间了解为TuGraph贡献代码的流程，并阅读《贡献者许可协议》，参与贡献则视为同意上述协议。
+
+[个人贡献者许可协议](3.individual-cla.md)
+
+[公司贡献者许可协议](4.corporate-cla.md)
+
+## 2. 贡献什么
+我们随时都欢迎任何贡献，无论是简单的错别字修正，BUG 修复还是增加新功能。请踊跃提出问题或发起 PR。我们同样重视文档以及与其它开源项目的整合，欢迎在这方面做出贡献。
+对于任何修改，尤其是较为复杂的修改，建议新建一个issue ，按照BUG或者PR的模板填写。
+
+## 3. 准备工作
+贡献代码前需要先了解 git 工具的使用和 GitHub 网站的使用。
+
+## 4. 贡献代码流程
+### 4.1. 提交issue
+不论您是修复 TuGraph 的 bug 还是新增 TuGraph 的功能，在您提交代码之前，请在 TuGraph 的 GitHub 上提交一个 issue，描述您要修复的问题或者要增加的功能。这么做有几个好处:
+
+- 不会与其它开发者或是他们对这个项目的计划发生冲突，产生重复工作。
+- TuGraph 的维护人员会对您提的 bug 或者新增功能进行相关讨论，确定该修改是不是必要，有没有提升的空间或更好的办法。
+- 在达成一致后再开发，并提交代码，减少双方沟通成本，也减少 pull request 被拒绝的情况。
+### 4.2. 获取源码
+要修改或新增功能，在提交 issue 后，fork一份 TuGraph  Master代码到您的代码仓库。
+### 4.3. 拉分支
+TuGraph 所有修改都在分支上进行，修改完成后提交 pull request，在 Code Review 后由项目维护人员 Merge 到 Master。 因此，在获取源码步骤介绍后，您需要:
+
+1. 下载代码到本地，这一步您可以选择git/https方式，近年github的权限要求更加严格，比如git方式需要更复杂的ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent))，https方式不能直接使用用户名密码验证，请按照指引授权。 git clone https://github.com/您的账号名/tugraph-db
+2. 拉分支准备修改代码:
+git branch add_xxx_feature 
+3. 执行完上述命令后，您的代码仓库就切换到相应分支了。执行如下命令可以看到您当前分支: git branch -a 
+4. 如果您想切换回 Master，执行下面命令: git checkout -b master
+5. 如果您想切换回分支，执行下面命令: git checkout -b "branchName"
+
+### 4.4. 配置 Github 信息
+在您的机器执行 git config  --list ，查看 git 的全局用户名和邮箱。检查显示的 user.name 和 user.email 是不是与自己 github 的用户名和邮箱相匹配。
+
+如果公司内部有自己的 gitlab 或者使用了其他商业化的 gitlab，则可能会出现不匹配的情况。这时候，您需要为 TuGraph DB 项目单独设置用户名和邮箱。设置用户名和邮箱的方式请参考 github 官方文档。
+
+### 4.5. 修改代码提交到本地
+
+拉完分支后，就可以修改代码了。
+
+**修改代码注意事项 **
+
+代码⻛格保持一致：TuGraph 通过 cpplint 来保持代码格式一致，IDE可以通过.clang来配置风格。在提交代码前，务必本地检查代码风格，否则ACI将报错。
+
+补充单元测试代码：新有修改应该通过已有的单元测试,应该提供新的单元测试来证明以前的代码存在 bug，而新的代码已经解决了这些 bug ,您可以用如下命令运行所有测试: ./unit_test
+也可以通过IDE来辅助运行。
+
+**其它注意事项 **
+
+请保持您编辑的代码的原有⻛格，尤其是空格、换行等。 对于无用的注释，请直接删除。 对逻辑和功能不容易被理解的地方添加注释。 及时更新文档。 修改完代码后，请按照如下格式执行命令提交所有的修改到本地:
+git commit -am '(feat) 添加xx功能' git commit -am '(fix) 修复xx问题'`
+
+### 4.6. 提交代码到远程仓库
+在代码提交到本地后，接下来就可以与远程仓库同步代码了，执行如下命令提交本地修改到 github 上: git push origin "branchname"
+
+如果前面您是通过 fork 来做的，那么这里的 origin 是 push 到您的代码仓库，而不是 TuGraph 的代码仓库。
+
+提交合并代码到 Master 的请求 在的代码提交到 GitHub 后，您就可以发送请求来把您改好的代码合入 TuGraph Master 代码了。此时您需要进入您在 GitHub 上的对应仓库，按右上⻆的 pull request 按钮。选择目标分支，一般就是 master，系统会通知 TuGraph 的人员， TuGraph 人员会 Review 您的代码，符合要求后就会合入主干，成为 TuGraph 的一部分。 
+
+请注意会自动检查CI，以及所有Commits中的贡献者是否签署了cla，通过后会有绿色的标识。
+
+### 4.7. 代码 Review
+
+在您提交代码后，您的代码会被指派给维护人员 Review，请耐心等待。如果两个工作日后，仍然没有人对您的提交给予任何回复，可以在 PR 下面留言，并 @ 对应的人员。
+
+对于代码 Review 的意⻅会直接备注到到对应 PR 或者 Issue。如果觉得建议是合理的，也请您把这些建议更新到您的代码中。
+
+### 4.8. 合并代码到Master
+
+在代码 Review 通过后，就由 TuGraph 维护人员操作合入 Master，在此过程中维护人员可能会指定新的Reviewer，提出新的意见需要修改。一般这一步不用参与，代码合并之后，您会收到合并成功的提示。
+
+
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..109a1d8f04
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/2.community-roles.md
@@ -0,0 +1,57 @@
+# 社区角色
+
+## 1. 前言
+本文档描述 TuGraph 社区中成员身份的⻆色，对每种⻆色的要求及权限。 
+
+## 2. ⻆色摘要
+
+这是 TuGraph 社区的⻆色划分，描述了每种⻆色的职责，成为某种⻆色并保持该⻆色的要求，以及相应⻆色的权限。
+
+TuGraph 社区参照 Apache 规范划分为以下三种⻆色：
+
+- Contributor 
+- Maintainer 
+- PMC 
+
+以下描述了每种⻆色的要求、职责和权限。 		 						 					
+## 3. Contributor
+### 3.1. 要求
+在 TuGraph 的任何一个正式项目中成功提交一个 PR 并合并。 
+### 3.2. 职责
+
+- 积极响应指派给您的 Issue 或 PR
+- 一起帮忙回复 Issue 或 PR，把 Issue 分配给对应模块的负责人
+### 3.3. 权限
+
+- 加入 TuGraph GitHub 组织，成为 TuGraph 开源社区的一员。 
+## 4. Maintainer
+### 4.1. 要求
+新的 Committer 由已有的 PMC 推荐，并通过 2/3 以上投票通过，Committer 至少满足以下一个条件：
+
+- 成为社区成员时间超过三个月 
+- 超过 10 个 PMC approve 的 PR 
+- 完成重大功能 
+- 修复严重 Bug 
+- 长期关注项目发展并参与社区讨论
+### 4.2. 职责
+
+- 社区咨询支持
+- 积极响应指派给您的 Issue 或 PR
+- 对于社区重大决定的投票权
+- Review 社区的 PR 
+### 4.3. 权限
+
+- Pull Request review 权限 
+## 5. PMC
+### 5.1. 要求
+
+- 暂不开放，如有强烈愿望请联系PMC
+### 5.2. 职责
+
+- 积极参与社区讨论，对社区重大决策给予指导 
+- 负责保证开源项目的社区活动都能运转良好 
+### 5.3. 权限
+
+- Pull Request review 权限 
+- Pull Request approve 权限 
+- 社区角色成员管理
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..f320662638
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# 个人贡献者许可协议
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below. This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project. If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录 A 中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+1. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+1. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+1. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+1. 专利许可的授予。 受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+1. You represent that you are legally entitled to grant the above license.
+1. 您保证您依法有权授予上述许可。
+
+1. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others). You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+1. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第 7 节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+1. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+1. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+1. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+1. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+1. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+1. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+1. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws. The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply. Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+1. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+1. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+1. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign 请签署: ****************\_\_**************** Date 日期: ****\_\_\_\_****
+
+Full name 全名: **************************\_**************************
+
+Mailing Address 信件地址: **********************\_\_\_\_**********************
+
+Telephone 电话: **************************\_**************************
+
+E-Mail 电子邮箱: **************************\_\_**************************
+
+Schedule A 附录 A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..c982085db2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,85 @@
+# 公司贡献者许可协议
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below. This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project. If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录 B 中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+3. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+4. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+5. 专利许可的授予。 受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+6. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+7. 您保证您依法有权授予上述许可。您进一步保证下文附表 A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+8. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others). You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+9. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第 7 节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+10. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+11. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+12. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+13. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+14. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+15. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+16. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws. The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply. Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+17. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+18. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+19. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign 请签署: ****************\_\_**************** Date 日期: ****\_\_\_\_****
+
+Company Name 公司名称: **********************\_\_\_\_**********************
+
+Full name 全名: **************************\_**************************
+
+Title 职务: **************************\_**************************
+
+Mailing Address 信件地址: **********************\_\_\_\_**********************
+
+Country 国家: **************************\_**************************
+
+Telephone 电话: **************************\_**************************
+
+E-Mail 电子邮箱: **************************\_\_**************************
+
+Schedule A 附录 A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录 B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..4606b33755
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/5.roadmap.md
@@ -0,0 +1,70 @@
+# 技术规划
+
+## 1. 简介
+该文档是 TuGraph 未来开发的规划，包括正在开发中、不在开发计划里、已经开发完成但不在开源版本里的功能等。
+
+TuGraph定位开源高性能图数据库，图数据采用集中存储的方式，短期 **不会** 考虑基于分片（Sharding）的数据切分，
+而将支持主备复制的模式来解决高并发读的场景，采用云上存储解决存储容量的问题。
+
+## 2. 已完成功能
+
+TuGraph于2022年9月1日开源，TuGraph在社区的反馈声中，进行日常BUG修复，自身能力得到了完善。
+
+| 版本号 | 功能 | 时间 |
+| --- | --- | --- |
+| 3.3.0 | 开源初版 | 2022.9.1 |
+| 3.3.1 | 图分析引擎重构，多模式支持 | 2022.10.14 |
+| 3.3.2 | OGM支持，UT覆盖率提升 | 2022.11.21 |
+| 3.3.3 | 链接认证机制迭代，加入英文文档 | 2022.12.23 |
+| 3.3.4 | 支持上云，梳理LDBC SNB Audit流程 | 2023.1.28 |
+| 3.4.0 | 支持OLAP Python API, 离线导入升级 | 2023.3.11 |
+| 3.5.0 | 支持POG，前端升级，文档梳理 | 2023.6.5 |
+| 3.5.1 | 图学习引擎，Procedure Rust API，存储属性分离 | 2023.7.14 |
+
+除此之外，TuGraph搭建了较为完善的质量体系，涵盖自动化的单元测试、集成测试、性能测试等。
+
+更详细的描述可以在源码目录在的 "[root]/release/CHANGELOG.md" 文件查看。
+
+## 3. 2023年下半年核心版本迭代
+
+上半年高可用功能在计划上延后，图学习的能力提前迭代了一版，下半年将会完成高可用，以及率先支持ISO GQL的预印版本。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| 3.6.0 | 高可用支持 | 2023.8 |
+| 4.0.0 | ISO GQL 语言支持 | 2023.10 |
+
+## 4. 2023年功能更新
+
+在2023年度，除了上述核心功能，还包括如下组件的研发。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| 3.5.x | 日志系统优化 | 2023.7 |
+| 3.5.x | 冷备支持 | 2023.9 |
+| 3.5.x | 支持边upsert导入 | 2023.9 |
+| x.x.x | 支持trigger触发器 | 2023.12 |
+| x.x.x | 探索新存储引擎 | 2023.x |
+| x.x.x | 支持schema快速增删 | 2023.x |
+| x.x.x | TuGraph Brower版本迭代 | 2023.x |
+| x.x.x | 存储过程 Python API 迭代 | 2023.x |
+
+## 5. 期望社区共创的功能
+
+目前团队研发精力并不能实现我们对TuGraph的全部期望，在功能的梳理中，我们发现有一系列值得挖掘的想法，
+团队也有一些初步的探索，期望下面功能能够在社区中共同研发。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| x.x.x | 文档完善 | 2023.x |
+| x.x.x | APOC工具丰富 | 2023.x |
+| x.x.x | 属性默认值支持 | 2023.x |
+| x.x.x | 多属性联合索引 | 2023.x |
+| x.x.x | 在线全量Import支持 | 2023.x |
+| x.x.x | 图权限完善 | 2023.x |
+| x.x.x | NLP支持 | 2023.x |
+| x.x.x | Java Procedure API | 2023.x |
+| x.x.x | 数据库间快速迁移 | 2023.x |
+| x.x.x | 时空数据 | 2023.x |
+
+一些更加简单的功能，我们会在github的issue中打上 good first issue 的标签，欢迎对图数据库感兴趣的技术爱好者共同研讨。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/index.rst
new file mode 100644
index 0000000000..f2319d2358
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/6.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+贡献者文档
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..61c73cd6bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# 从关系型数据库导入TuGraph
+
+> 内容待补充
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..0eeb7a2bbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/2.learn_practices.md
@@ -0,0 +1,200 @@
+# 使用 TuGraph 图学习模块进行点分类
+
+## 1.简介
+GNN 是许多图上机器学习任务的强大工具。在本介绍性教程中，您将学习使用 GNN 进行点分类的基本工作流程，即预测图中点的类别。
+
+此文档将展示如何构建一个 GNN 用于在 Cora 数据集上仅使用少量标签进行半监督点分类，这是一个以论文为点、引文为边的引文网络。任务是预测给定论文的类别。
+
+通过完成本教程，您可以
+
+使用 TuGraph 加载 cora 数据集。
+
+使用 TuGraph 提供的采样算子采样，并构建 GNN 模型。
+
+在 CPU 或 GPU 上训练用于点分类的 GNN 模型。
+
+此文档需要对图神经网络、DGL等使用有一定经验。
+
+## 2. 前置条件
+
+TuGraph图学习模块需要TuGraph-db 3.5.1及以上版本。
+
+TuGraph部署推荐采用Docker镜像tugraph-compile 1.2.4及以上版本:
+
+tugraph / tugraph-compile-ubuntu18.04:latest
+
+tugraph / tugraph-compile-centos7:latest
+
+tugraph / tugraph-compile-centos8:latest
+
+以上镜像均可在DockerHub上获取。
+具体操作请参考[快速上手](../3.quick-start/1.preparation.md)。
+
+## 3. Cora 数据集导入TuGraph数据库
+### 3.1. Cora 数据集介绍
+Cora 数据集由 2708 篇论文组成，分为 7 个类别。每篇论文由一个 1433 维的词袋表示，表示论文中的单词是否出现。这些词袋特征已经预处理，以从 0 到 1 的范围归一化。边表示论文之间的引用关系。
+
+TuGraph中已经提供了Cora数据集的导入工具，用户可以直接使用。
+
+### 3.2. 数据导入
+Cora数据集在test/integration/data/algo目录下，包含点集cora_vertices和边集cora_edge。
+
+首先需要将Cora数据集导入到TuGraph数据库中，具体操作请参考[数据导入](../5.developer-manual/3.server-tools/1.data-import.md)。
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./../../test/integration/data/algo/cora.conf --dir ./cora_db --overwrite true
+```
+其中cora.conf为图schema文件，代表图数据的格式,可参考test/integration/data/algo/cora.conf。cora_db为导入后的图数据文件名称，代表图数据的存储位置。
+
+## 4. feature特征转换
+由于Cora数据集中的feature特征为长度为1433的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./cora_db`
+即可进行转换。
+
+## 5. 编译采样算子
+采样算子用于从数据库中获取图数据并转换成所需数据结构，具体执行过程如下：
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *  # 导入tugraph-db的python接口模块
+import importlib  # 导入importlib模块
+getdb = importlib.import_module("getdb")  #获取getdb算子
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo) #调用getdb算子
+```
+
+如代码所示，得到算子so文件后，import 导入使用。
+
+## 6. 训练过程
+### 6.1.数据加载
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+如代码所示，根据图数据路径、用户名、密码和子图名称将数据加载到内存中。TuGraph可以载入多个子图用于图训练，在此处我们只载入一个子图。
+
+### 6.2.构建采样器
+训练过程中，首先使用GetDB算子从数据库中获取图数据并转换成所需数据结构，具体代码如下：
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+如代码所示，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+然后构建采样器
+```python
+    batch_size = 5
+    count = 2708
+    sampler = TugraphSample(args)
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(count),
+        sampler,
+        batch_size=batch_size,
+        num_workers=0,
+        )
+```
+
+### 6.3.对结果进行格式转换
+```python
+    src = EdgeInfo[0].astype('int64')
+    dst = EdgeInfo[1].astype('int64')
+    nodes_idx = NodeInfo[0].astype('int64')
+    remap(src, dst, nodes_idx)
+    features = NodeInfo[1].astype('float32')
+    labels = NodeInfo[2].astype('int64')
+    g = dgl.graph((src, dst))
+    g.ndata['feat'] = torch.tensor(features)
+    g.ndata['label'] = torch.tensor(labels)
+    return g
+```
+对结果进行格式转换，使之符合训练格式
+
+### 6.4.构建GCN模型
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+
+def build_model():
+    in_size = feature_len  #feature_len为feature的长度，在此处为1433
+    out_size = classes  #classes为类别数，在此处为7
+    model = GCN(in_size, 16, out_size)  #16为隐藏层大小
+    return model
+```
+本教程将构建一个两层图卷积网络（GCN）。每层通过聚合邻居信息来计算新的点表示。
+
+### 6.5.训练GCN模型
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    return float(loss)
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+如代码所示，根据定义好的采样器、优化器和模型进行迭代训练50次。
+
+输出结果如下：
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+同时，图学习模块可采用GPU进行加速，用户如果需要再GPU上运行，需要用户自行安装相应的GPU驱动和环境。具体可参考learn/README.md。
+
+完整代码可参考learn/examples/train_full_cora.py
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..189f3015fe
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# 数据迁移
+
+## 1. 简介
+   数据迁移是指将数据从一个系统、存储介质或应用程序迁移到另一个系统、存储介质或应用程序的过程。当TuGraph要升级或者系统硬件环境发生变化时，
+需要对原TuGraph服务中的数据进行迁移。以系统硬件环境和软件版本为依据进行划分，本文将数据迁移分为三种方案：
+1. 兼容迁移：当迁移前后系统环境一致且TuGraph软件兼容时，可以直接使用备份恢复的方式迁移数据；
+2. 升级迁移：当迁移前后系统环境不一致或TuGraph软件不兼容时，需要使用先导出数据再重新导入的方式迁移数据；
+3. 在线迁移：当对高可用集群进行数据迁移且集群网络环境良好时，可以使用增删节点的的方式将原集群平滑切换到新集群。
+接下来本文将详细介绍这三种方案。
+
+## 2. 兼容迁移
+兼容迁移指的是在系统环境不变，且TuGraph软件版本兼容时，原服务的数据和存储过程可以在新服务中使用，所以可以直接迁移。
+用户可以先使用`lgraph_backup`工具备份数据，然后将数据传输到新机器中并重启服务。具体迁移步骤如下：
+
+### 2.1. 备份数据
+使用`lgraph_backup`工具备份数据
+```bash
+  lgraph_backup -s db -d db.bck
+```
+本步骤也可以直接使用`cp`命令，不过`cp`命令会拷贝一些多余的元数据，HA模式下也会拷贝raft的元数据导致迁移之后集群重启失败，
+因此建议数据迁移时使用`lgraph_backup`工具替代`cp`命令。
+
+### 2.2. 启动新服务
+使用如下命令启动新服务，存储过程会自动加载到新服务中
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. 停止原服务
+使用如下命令停止原服务
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. 升级迁移
+当用户要把原始服务迁移到一个差异化环境中（比如从centos7迁移到ubuntu18.04），或者TuGraph版本变化较大前后不兼容时（如3.4.0和3.6.0），
+用户可以先使用`lgraph_export`工具将数据导出成文件，传输到新机器中，再使用`lgraph_import`工具重新导入并重启集群。
+这样可以保证在新环境上能够使用，但是效率较低，存储过程也需要重新加载。具体的迁移步骤如下：
+
+### 3.1. 导出数据
+使用`lgraph_export`工具导出数据，并将数据传输到新机器上
+```bash
+  lgraph_export -d db -e db.export
+```
+
+### 3.2. 导入数据
+使用`lgraph_import`工具导入数据，并手动加载存储过程（详见[client操作步骤](../5.developer-manual/4.client-tools/2.cpp-client.md)）
+```bash
+  lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. 启动新服务
+使用如下命令启动新服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. 停止原服务
+使用如下命令停止原服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. 在线迁移
+当对TuGraph高可用版本部署的服务器集群进行数据迁移时，如果网络带宽充足，可以直接使用增删节点的方式对服务进行在线迁移。具体迁移步骤如下所示：
+
+### 4.1. 拷贝数据
+使用如下命令拷贝leader节点上的数据，并且传输到新集群的机器节点上。由于leader节点上有最完整的raft日志，拷贝leader的数据可以最大程度地减少
+日志追赶的时间。
+```bash
+  cp -r db db.cp
+```
+### 4.2. 启动新节点
+使用如下命令将新节点加入集群，加入集群后，增量数据自动同步到新节点
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. 停止原节点
+停止原节点服务，后续应用请求直接发给新集群
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/4.selection.md
new file mode 100644
index 0000000000..499d90a5c7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# 环境和版本选择
+
+> 该文档介绍如何选择系统环境，以及部署方式
+
+## 1. 简介
+
+TuGraph为不同需求的用户提供了差异化的系统环境和部署方式，来满足新手、系统开发者、生产运维人员、研究人员等不同用户的需求。
+
+## 2. 环境能力选择
+
+用户可以根据实际使用场景，来选择不同的环境。编译环境的能力最完备，所需的第三方软件也越多。与其相对应的，精简运行环境几乎不需要安装任何依赖库，能运行TuGraph除存储过程外的基础功能。
+
+| 环境     | 用途             | 备注        |
+|--------|----------------|-----------|
+| 编译环境   | 从源码编译TuGraph   | 适用于开发人员   |
+| 运行环境   | 运行TuGraph安装包   | 适用于大部分用户  |
+| 精简运行环境 | 运行精简TuGraph安装包 | 对系运行统依赖较小 |
+
+不同环境的具体介绍参见 [链接](../5.developer-manual/1.installation/2.environment-mode.md)。
+
+## 3. 部署方式选择
+
+TuGraph部署仅需一台服务器（高可用模式需要多台），可根据实际资源情况和使用场景，选择适合的部署方式。
+
+| 部署方式     | 描述                   | 备注                                                                                      |
+|----------|----------------------|-----------------------------------------------------------------------------------------|
+| 云部署      | 阿里云计算巢一键部署，免费试用      | 新手适用，流程参考 [链接](../5.developer-manual/1.installation/5.cloud-deployment.md)              |
+| Docker部署 | 通过预先准备的Docker镜像跨平台部署 | 对硬件有要求的用户，比如性能测试，流程参考 [链接](../5.developer-manual/1.installation/3.docker-deployment.md) |
+| 本地部署     | 在现有系统紧耦合部署           | 指定生产环境适用，流程参考 [链接](../5.developer-manual/1.installation/4.local-package-deployment.md)  |
+
+## 4. 后续步骤
+
+部署完成后，后续可以进行[启动服务](../5.developer-manual/2.running/2.tugraph-running.md)、[数据导入](../5.developer-manual/3.server-tools/1.data-import.md)等操作，也可以通过[样例数据](../3.quick-start/2.demo/1.movie.md)来体验整个流程。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/index.rst
new file mode 100644
index 0000000000..dc5546f1d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/7.best-practices/index.rst
@@ -0,0 +1,9 @@
+最佳实践
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/8.faq.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/8.faq.md
new file mode 100644
index 0000000000..4a94af5b3c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/8.faq.md
@@ -0,0 +1,57 @@
+# FAQ
+
+在 TuGraph 使用过程中，如果遇到问题可优先查看[用户文档](https://github.com/TuGraph-family/tugraph-db/tree/master/doc/zh-CN) 。其次，请查看如下 FAQ 列表是否能够匹配您的问题。
+
+1. **[内核引擎 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussion-4575385)**
+
+   1.1 [TuGraph 的边是否支持索引？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165379)
+
+   1.2 [TuGraph 单机的 QPS 是多少？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussion-4575381)**
+
+   2.1 [可视化文件 build 后如何更新到 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165364)
+
+   2.2 [如何通过 npm run dev，连接已有的 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165366)
+
+   2.3 [3.3.0 版本 TuGraph Browser 删除 node label 失败？](https://github.com/TuGraph-family/tugraph-db/discussions/82#discussion-4465791)
+3. **[客户端 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussion-4575378)**
+
+   3.1 [Client 目前有哪些编程语言，是否支持 Node.js？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165351)
+
+   3.2 [Python Client 是否支持 pip install？Client 在哪里进行引用？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165353)
+
+4. **[数据导入 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussion-4575373)**
+
+   4.1 [TuGraph 可以对接哪些常用数据库？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165335)
+
+   4.2 [如何进行数据导入？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[存储过程 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussion-4575369)**
+
+   5.1 [如何加载存储过程或算法包？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165313)
+
+   5.2 [如何调用或执行存储过程？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165317)
+
+   5.3 [开源内置的算法包在哪里？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[安装部署 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussion-4575364)**
+
+   6.1 [如何使用 docker 镜像安装？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165287)
+
+   6.2 [rpm 包和 deb 包安装后，启动 lgraph_server 服务，提示缺少'liblgraph.so'报错？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165289)
+
+   6.3 [如何在 Mac 的 M1 芯片上编译 TuGraph？](https://github.com/TuGraph-family/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussion-4575018)**
+
+   7.1 [是否支持不定长边的条件查询？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165252)
+
+   7.2 [如何查询最短路径，shortestPath 函数如何使用？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165256)
+
+   7.3 [查询语句 Where 后使用 and 进行拼接查询速度较慢，语句应如何优化改进？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165260)
+
+   7.4 [如何查询任意跳的边？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165262)
+
+   7.5 [Cypher 是否 date()函数？](https://github.com/TuGraph-family/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+
+   8.1 [报错“User has reached the maximum number of tokens”后该如何处理？](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+如果问题仍然无法得到解决，我们推荐您在[Discussions](https://github.com/TuGraph-family/tugraph-db/discussions)跟帖或发起新贴来描述您的问题。同时 TuGraph QA 大汇总也会根据大家在讨论区发起的帖子，进行定期的更新。
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/9.contacts.md b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/9.contacts.md
new file mode 100644
index 0000000000..8537a0f979
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/9.contacts.md
@@ -0,0 +1,28 @@
+# 联系方式
+
+您有任何对产品的意见和建议，欢迎通过以下联系方式加入讨论，或提出建议。
+
+官网: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue (错误反馈、功能讨论)
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions (技术讨论)
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack (在线开发沟通):
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+钉钉群 (技术交流)
+
+![alert](../../images/dingtalk.png)
+
+微信群 (技术交流)
+
+![alert](../../images/wechat_tech.png)
+
+微信公众号 (信息发布)
+
+![alert](../../images/wechat.png)
+
+邮箱（商务沟通等其他问题）: tugraph@service.alipay.com
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/conf.py b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/conf.py
new file mode 100644
index 0000000000..b6b64b9e64
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/conf.py
@@ -0,0 +1,45 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-3.5.0/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('5.developer-manual/6.interface/3.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="5.developer-manual/6.interface/3.procedure/")
+    breathe_projects = {"cpp_procedure": "5.developer-manual/6.interface/3.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    subprocess.run(shlex.split("rm -rf 3.C++-procedure 4.Python-procedure.rst index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
+    subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
diff --git a/docs/docusaurus/versions/version-4.0.1/zh-CN/source/index.rst b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/index.rst
new file mode 100644
index 0000000000..1e1f1abfa5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.0.1/zh-CN/source/index.rst
@@ -0,0 +1,17 @@
+TuGraph高性能图数据库
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.developer-manual/index.rst
+   6.contributor-manual/index.rst
+   7.best-practices/index.rst
+   8.faq.md
+   9.contacts.md
diff --git a/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile
new file mode 100644
index 0000000000..928a928f07
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.1.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-CPP-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-CPP-Procedure-API/run.sh
new file mode 100644
index 0000000000..e2455bfbc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-CPP-Procedure-API/run.sh
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+# 0. install: yum install doxygen, graphviz
+# 1. run this script
+doxygen Doxyfile
diff --git a/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/Makefile b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/Makefile
new file mode 100644
index 0000000000..e58ac30a31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+SPHINXPROJ    = TuGraph
+SOURCEDIR     = .
+BUILDDIR      = _build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/conf.py b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/conf.py
new file mode 100644
index 0000000000..8af367a431
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/conf.py
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+#
+# Configuration file for the Sphinx documentation builder.
+#
+# This file does only contain a selection of the most common options. For a
+# full list see the documentation:
+# http://www.sphinx-doc.org/en/master/config
+
+# -- Path setup --------------------------------------------------------------
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#
+import os
+import sys
+sys.path.insert(0, os.path.abspath('../../../build/output/'))
+
+
+# -- Project information -----------------------------------------------------
+
+project = u'TuGraph'
+copyright = u'2018-2022, Ant Group'
+author = u'Ant Group'
+
+# The short X.Y version
+version = u''
+# The full version, including alpha/beta/rc tags
+release = u''
+
+
+# -- General configuration ---------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#
+# needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.autodoc',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+#
+# source_suffix = ['.rst', '.md']
+source_suffix = '.rst'
+
+# The master toctree document.
+master_doc = 'index'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+# This pattern also affects html_static_path and html_extra_path .
+exclude_patterns = [u'_build', 'Thumbs.db', '.DS_Store']
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+
+# -- Options for HTML output -------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+#
+html_theme = 'nature'
+#html_theme = 'haiku'
+#html_theme = 'pyramid'
+#html_theme = 'sphinxdoc'
+#html_theme = 'bizstyle'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#
+# html_theme_options = {}
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Custom sidebar templates, must be a dictionary that maps document names
+# to template names.
+#
+# The default sidebars (for documents that don't match any pattern) are
+# defined by theme itself.  Builtin themes are using these templates by
+# default: ``['localtoc.html', 'relations.html', 'sourcelink.html',
+# 'searchbox.html']``.
+#
+# html_sidebars = {}
+
+
+# -- Options for HTMLHelp output ---------------------------------------------
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'TuGraphdoc'
+
+
+# -- Options for LaTeX output ------------------------------------------------
+
+latex_elements = {
+    # The paper size ('letterpaper' or 'a4paper').
+    #
+    # 'papersize': 'letterpaper',
+
+    # The font size ('10pt', '11pt' or '12pt').
+    #
+    # 'pointsize': '10pt',
+
+    # Additional stuff for the LaTeX preamble.
+    #
+    # 'preamble': '',
+
+    # Latex figure (float) alignment
+    #
+    # 'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'TuGraph.tex', u'TuGraph Documentation',
+     u'Ant Group', 'manual'),
+]
+
+
+# -- Options for manual page output ------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'tugraph', u'TuGraph Documentation',
+     [author], 1)
+]
+
+
+# -- Options for Texinfo output ----------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'TuGraph', u'TuGraph Documentation',
+     author, 'TuGraph', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+
+# -- Extension configuration -------------------------------------------------
diff --git a/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/index.rst b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/index.rst
new file mode 100644
index 0000000000..54bd806bc1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/index.rst
@@ -0,0 +1,37 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+TuGraph Procedure API - Python
+====================================
+Version: 4.1.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Noe4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
+
+
+Indices and tables
+-------------------
+
+* :ref:`genindex`
+* :ref:`modindex`
+* :ref:`search`
diff --git a/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/make.bat b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/make.bat
new file mode 100644
index 0000000000..b1d0c9a1dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=.
+set BUILDDIR=_build
+set SPHINXPROJ=TuGraph
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.http://sphinx-doc.org/
+	exit /b 1
+)
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/run.sh
new file mode 100755
index 0000000000..d10e0a2b1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/autogen/TuGraph-Python-Procedure-API/run.sh
@@ -0,0 +1,7 @@
+# 0. install sphinx-build: yum install python3-sphinx
+# 1. default lgrpah module path: ../../../build/output/lgraph_python.so
+# 2. make lgraph_python
+# 3. run this script
+rm output -rf
+mkdir -p _static _templates
+sphinx-build -W -b html . output
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/.readthedocs.yaml b/docs/docusaurus/versions/version-4.1.0/en-US/.readthedocs.yaml
new file mode 100644
index 0000000000..92cd0965f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/en-US/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/Makefile b/docs/docusaurus/versions/version-4.1.0/en-US/Makefile
new file mode 100644
index 0000000000..a4de0bff18
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?= -W
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/make.bat b/docs/docusaurus/versions/version-4.1.0/en-US/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/1.guide.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/1.guide.md
new file mode 100644
index 0000000000..0531cac912
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/1.guide.md
@@ -0,0 +1,76 @@
+# Guide
+
+> Here is the document map that helps users learn and use the TuGraph community version quickly.
+
+## Quick Start
+
+> Understand [What is a Graph](./2.introduction/1.what-is-graph.md),[The application scenarios of graph](./2.introduction/7.scenarios.md),[What is TuGraph](./2.introduction/3.what-is-tugraph.md).
+
+> Quickly Install and deploy TuGraph:[Cloud Deployment](./5.developer-manual/1.installation/5.cloud-deployment.md),[Docker Deployment](./5.developer-manual/1.installation/3.docker-deployment.md)Rapid deployment TuGraph.
+
+> Quickly get started with DEMO:[Movie](./3.quick-start/2.demo/1.movie.md),[The Wandering Earth](./3.quick-start/2.demo/2.wandering-earth.md),[Three Body](./3.quick-start/2.demo/3.the-three-body.md),[Three Kingdoms](./3.quick-start/2.demo/4.three-kingdoms.md).
+
+> User Guide:[TuGraph Browser](./4.user-guide/1.tugraph-browser.md),[TuGraph Browser Legacy](./4.user-guide/2.tugraph-browser-legacy.md).
+
+## Development Guide
+
+> Client Tools:[Cpp Client](./5.developer-manual/4.client-tools/2.cpp-client.md),[Java Client](./5.developer-manual/4.client-tools/3.java-client.md),[Python Client](./5.developer-manual/4.client-tools/1.python-client.md).
+
+> TuGraph Query Language:[Cypher API](./5.developer-manual/6.interface/1.query/1.cypher.md).
+
+> Procedure And Algorithm:[Procedure API (POG API)](./5.developer-manual/6.interface/3.procedure/1.procedure.md)、[OLAP API](./5.developer-manual/6.interface/2.olap/1.tutorial.md).
+
+> C++/Python Procedure Interfaces:[C++/Python Procedure API](./5.developer-manual/6.interface/3.procedure/index.rst)。
+
+## Community Contribution
+
+> Before starting to contribute, you can learn [how to contribute](./6.contributor-manual/1.contributing.md)
+
+> If you want to understand the division of community roles, please visit [community roles](./6.contributor-manual/2.community-roles.md)
+
+## Main warehouse
+
+> TuGraph-DB repository: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> Visual interface: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java client: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> Simple test method based on twitter data: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> Test method based on standard LDBC-SNB: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics repository: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## Video Center
+
+> [Get started quickly with TuGraph](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph technology sharing collection](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [Understand graph calculation in 3 minutes](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph-Latest-Version
+
+| Description | File | Link |
+|---------------------|--------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 runtime package | tugraph-4.1.0-1.el7.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-4.1.0-1.el7.x86_64.rpm) |
+| CentOS8 runtime package | tugraph-4.1.0-1.el8.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-4.1.0-1.el8.x86_64.rpm) |
+| Ubuntu18.04 runtime package | tugraph-4.1.0-1.x86_64.deb | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-4.1.0-1.x86_64.deb) |
+| CentOS7 runtime image | tugraph-runtime-centos7-4.1.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-runtime-centos7-4.1.0.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7) |
+| CentOS8 runtime image | tugraph-runtime-centos8-4.1.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-runtime-centos8-4.1.0.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8) |
+| Ubuntu18.04 runtime image | tugraph-runtime-ubuntu18.04-4.1.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-runtime-ubuntu18.04-4.1.0.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04) |
+| CentOS7 mini runtime package | tugraph-mini-4.1.0-1.el7.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-4.1.0-1.el7.x86_64.rpm) |
+| CentOS8 mini runtime package | tugraph-mini-4.1.0-1.el8.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-4.1.0-1.el8.x86_64.rpm) |
+| Ubuntu18.04 mini runtime package | tugraph-mini-4.1.0-1.x86_64.deb | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-4.1.0-1.x86_64.deb) |
+| CentOS7 mini runtime image | tugraph-mini-runtime-centos7-4.1.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-runtime-centos7-4.1.0.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7) |
+| CentOS8 mini runtime image | tugraph-mini-runtime-centos8-4.1.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-runtime-centos8-4.1.0.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8) |
+| Ubuntu18.04 mini runtime image | tugraph-mini-runtime-ubuntu18.04-4.1.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-runtime-ubuntu18.04-4.1.0.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 compilation image | tugraph-compile-centos7-1.2.9.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.2.9.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos7) |
+| CentOS8 compilation image | tugraph-compile-centos8-1.2.9.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.2.9.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos8) |
+| Ubuntu18.04 compilation image | tugraph-compile-ubuntu18.04-1.2.9.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.2.9.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04) |
+
+
+For the version update log, see: [Link](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md).
+
+If you don't know how to use installation packages and images, please refer to [Environment and Version Selection](./7.best-practices/4.selection.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..549043a94c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,15 @@
+# What is Graph
+
+The graph that we're going to introduce today, it's neither a picture, nor a diagram，it's a class of mathematics called graph theory. We can see on the screen that there are two graphs on the left and right, which represent things and their relationship. We abstract it out in a form, and we call such a form a graph.
+
+![alt what is graph](../../../images/what-is-graph-en.png)
+
+The basic elements of a graph are a vertex, and an edge, a vertex is a representation of the thing, of the entity, and an edge is a representation of the relationship between them.
+
+We see the graph on the left, the dots have companies, they have employees, and they have projects. What are their sides? The relationship between the company and the employees is an employment relationship, and there can be a friend relationship between the employees, and there can be a participation relationship between the project and the employees. That is, we can use graphs to abstract things and their relationships.
+
+The diagram on the right is a schematic diagram of a financial transaction. Each of us has a bank account, and when our bank account makes a consumption or makes a transfer, this account is the point on the graph, and this edge can indicate that there is such a transfer relationship between us.
+
+We can also see from this example that edges can attach information and points can attach information. The point can attach which bank this account is in and what the account is. The value of the transaction can be attached to the edge, and many times, if your transaction is large, it indicates that special attention is needed. This edge might not necessarily be the amount of a particular transfer, it might be the amount accumulated over a period of time and so on. Graphs can actually be very expressive.
+
+On the other hand, for a graph like finance, it can be very large. There could be more than a billion points, a hundred billion or even a trillion edges. As you can imagine, it's actually quite challenging to actually work with these graphs.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..935aa4ffa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# What is a graph database
+
+> This document mainly introduce what is a graph database, the advantages of graph database compared with relational database, and the comparison between graph database and relational database
+
+## 1. Introduction
+
+Graph database is a database based on graph model. The main function of graph database is to manage graph data, so it needs to support efficient vertex/edge query and update; To facilitate user use, it is usually necessary to add transaction support to ensure the normal operation of concurrent operations.
+
+## 2. Advantages of graph databases over relational databases
+
+The function of graph database is an extension of traditional relational database. Compared with relational database, the graph structure supported by graph data is more flexible. Graph database is different from other databases in terms of data addition, deletion, query and modification based on graph. On the operation abstraction of graph data, a vertex-based perspective is adopted, for example, a vertex accesses its neighboring vertices through all its outgoing edges. This kind of operation is also the core of the design of graph database system.
+
+The uniqueness of graph database can be reflected in the following three aspects:
+
+### 2.1 Performance
+
+Handling the relationship between data, it is inevitable to use table JOIN operation in relational database, which has a great impact on performance. Graph database is a direct access, similar to pointer access, which is more efficient operation of associated data, compared with relational database performance improvement of 2 to 4 orders of magnitude.
+
+### 2.2 Compatibility
+
+In reality, the process of a project is often evolutionary. The content and even the format of the data are constantly changing. In a relational database, this means that a change in the table structure, or the creation of multiple new tables, significantly changes the source data. In the graph database, you simply add new vertices, edges, and attributes, and set them to the corresponding types. In essence, a table represents a type of data, and a vertex represents a specific data, meaning that relational databases pay more attention to the type of data, while graph databases pay more attention to the individuals of data and identify their association relationships.
+
+### 2.3 Intuitive
+
+Using graphs (or nets) to express real-world relationships is more straightforward and natural, especially in the Internet of Things era. If relational data used, a high degree of abstract thinking required to build a table of characters first, then a table of relations, and finally a map of data. When analyzing and querying the graph data, you can also intuitively find the desired data interactively through the point-edge connection topology, without any professional knowledge.
+
+## 3. Comparison between graph database and relational database
+
+| classification      | model           | advantage                                                            | disadvantage                                                                 | example        |
+| ------------------- | --------------- | -------------------------------------------------------------------- | ---------------------------------------------------------------------------- | -------------- |
+| Relational database | Table structure | Data is highly structured, consistent, and software maturity is high | The multi-hop association query is inefficient or not supported              | MySQL、Oracle  |
+| Graph database      | graph structure | Modeling and manipulating associations is very efficient             | Highly structured data processing is not as powerful as relational databases | Neo4j、TuGraph |
+
+In a word, in the face of massive data storage and processing problems, the traditional relational database has been unable to meet most of the daily data storage needs. Graph database technology can store relational information as entities and expand data model flexibly. Because it provides the most direct expression of related data, and the graph model is naturally tolerant to heterogeneous data. In the future, graph database technology will become one of the most popular technologies, which will provide powerful support for enterprises to store and analyze large-scale graph data.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..a94a71b91c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,141 @@
+# What is TuGraph
+
+> This document mainly introduces the main features and characteristics of TuGraph Community Edition, as well as the differences between TuGraph Enterprise Edition and Community Edition.
+
+
+## 1.Introduction
+
+Graph database is a non-relational database that stores data by vertices and edges. It can be used to store complex data network models, such as social networks and transaction networks. TuGraph is a graph database developed by Ant Group. This manual introduces the functions and usage of TuGraph.
+
+## 2.TuGraph Community Edition
+
+The Community Edition is a fully functional version of TuGraph, suitable for single-instance deployment. It provides complete basic fuctions of graph database, such as ACID-compatible transactions, programming APIs, and associated tools. It is ideal for learning TuGraph and implementing small projects.
+
+## 3.TuGraph features
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property graph model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+## 4.The data model
+
+### 4.1.Graph model
+TuGraph is a strong schema, directed property graph database with multi-graph capability.
+
+- Graph Project: Each database service can host multiple graph projects (multi-graphs), and each graph project can have its own access control configuration. The database administrator can create or delete specified graph projects.
+- Vertex: Refers to entity, generally used to express real-world entities, such as a movie or an actor.
+    - Primary Key: User-defined vertex data primary key, unique in the corresponding graph project and vertex type.
+    - VID: Refers to the auto-generated unique ID of the vertex, which cannot be modified by the user.
+    - Upper Limit: Each graph project can store up to 2^(40) vertex data.
+- Edge: Used to express the relationship between vertexs, such as an actor appears in a movie.
+    - Directed Edge: The edge is a directed edge. If you want to simulate an undirected edge, the user can create two edges with opposite directions.
+    - Duplicate Edge: TuGraph currently supports duplicate edges. If you want to ensure the uniqueness of the edge, you need to implement it through business policies.
+    - Upper Limit: Up to 2^(32) edge data can be stored between two vertex data.
+- Property Graph: vertexs and edges can have properties associated with them, and each property can have a different type.
+- Strong-typed: Each vertex and edge has only one label, and after creating a label, there is a cost to modify the number and type of attributes.
+    - Specify the starting/ending vertex type of the edge: You can limit the starting and ending vertex types of the edge, and support different vertex types of the starting and ending vertexs of the same type of edge, such as individuals transferring money to companies, companies transferring money to companies. After specifying the starting/ending vertex type of the edge, you can add multiple sets of starting/ending vertex types, but you cannot delete the restricted starting/ending vertex types.
+    - Unrestricted Mode: Supports creating edge data of this type between any two vertex types without specifying the starting and ending vertex types of the edge. Note: After specifying the starting/ending vertex type of the edge, the unrestricted mode cannot be used again.
+
+### 4.2.The data type
+
+TuGraph Supports a variety of data types that can be used as attributes, the specific supported data types are as follows:
+
+<caption>Table 1. TuGraph supported data types</caption>
+
+| **Type** | **Min**             | **Max**             | **Description**                                  |
+|----------|---------------------|---------------------|--------------------------------------------------|
+| BOOL     | false               | true                | Boolean                                          |
+| INT8     | -128                | 127                 | 8-bit int                                        |
+| INT16    | -32768              | 32767               | 16-bit int                                       |
+| INT32    | - 2^31              | 2^31 - 1            | 32-bit int                                       |
+| INT64    | - 2^63              | 2^63 - 1            | 64-bit int                                       |
+| DATE     | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" Date of format                      |
+| DATETIME | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD hh:mm:ss[.ffffff]"Format of the date and time |
+| FLOAT    |                     |                     | 32-bit float                                     |
+| DOUBLE   |                     |                     | 64-bit float                                     |
+| STRING   |                     |                     | A string of variable length                      |
+| BLOB     |                     |                     | Binary data                                      |
+
+_BLOB data is BASE64 encoded in input and output_
+
+### 4.3.Index
+
+TuGraph supports indexing vertex fields.
+
+Indexes can be unique or non-unique. If a unique index is created for a vertex label, TuGraph will perform a data integrity check to ensure the uniqueness of the index before modifying the vertex of the label.
+
+Each index built on a single field of a label, and multiple fields can be indexed using the same label.
+
+BLOB fields cannot be indexed.
+
+TuGraph supports creating indexes on properties of vertexs or edges to improve query efficiency.
+- The index can be a unique or non-unique index.
+- If a unique index is created for a vertex label, when modifying the vertex of the label, data integrity check will be performed first to ensure the uniqueness of the index.
+- Each index is created based on a property of a vertex or edge, and indexes can be created on multiple properties of the same vertex or edge.
+- An index cannot be created on a BLOB-type property.
+
+## 5. Graph Project, Vertex, Edge, and Attribute Naming Conventions and suggestions
+
+### 5.1 Naming Rules
+Graph projects, vertices, edges, and attributes are identifiers. This section describes the allowed syntax for identifiers in TuGraph.
+The table below describes the maximum length and allowed characters for each type of identifier.
+
+|**Identifier** |**Length** |**Allowed Characters**|
+|---------  |---------  |---------  |
+|User, role, graph project	|1-64 characters	|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+|Vertex type, edge type, attribute	|1-256 characters		|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+
+### 5.2 Usage Restrictions
+
+|**Description**|	**Maximum number**|
+|-------- |--------- |
+|Number of users, number of roles	|65536|
+|Number of graphs	|4096|
+|Number of vertex and edge types per graph	|4096|
+|Number of attributes per type	|1024|
+
+Note:
+1.Special characters and keywords: When using special characters or keywords, they need to be enclosed in backquotes (``) for reference;
+
+Example: ```match (`match`:match) return `match`.id limit 1```
+
+2.Case sensitivity: TuGraph is case-sensitive;
+
+3.Graph project, vertex/edge, and attribute names can be reused, but attribute names under the same vertex or edge cannot be duplicated;
+
+4.Reserved keywords for attribute names: SRC_ID / DST_ID / SKIP.
+
+### 5.3 Naming Suggestions
+|**Identifier**|**Description**|**Suggestions**|
+|-------|-------|--------|
+|Graph project	|Start with a letter or Chinese character	|Examples: graph123, project123, etc.|
+|Vertex/edge type	|Start with a letter or Chinese character and use underscores to separate words		|Examples: person, act_in, etc.|
+|Attribute	|Letters or Chinese characters	|Examples: name, age, etc.|
+
+## 6.TuGraph Enterprise Edition
+
+The Enterprise Edition has more comprehensive support for commercial features, including distributed cluster architecture, a one-stop graph platform covering exploration, research and development, service and operation and maintenance throughout the lifecycle, online, near-line, and offline graph computing engines, support for streaming and big data data sources, multi-site and multi-center deployment, making it an ideal choice for commercial solutions.
+
+```text
+    If you need to implement production-level high-availability cluster architecture, operation and maintenance and other enterprise-level services, please contact us to obtain commercial support:
+    Email:tugraph@service.alipay.com
+    Tel:0571-85022088,extension number 83789993#
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..de894fa1b0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# Performance Oriented
+
+> This document mainly introduces TuGraph's performance-oriented design philosophy as an open-source graph database.
+
+## 1.Introduction
+
+TuGraph is currently the fastest graph database in the world, ranking first in the LDBC SNB Interactive graph database standard evaluation (March 2023). The design of TuGraph is based on performance optimization, and is committed to building a high-performance single-machine graph database. This document describes the core design of TuGraph's storage layer based on performance optimization.
+
+## 2.Characteristics of Graph Operations
+
+Operations on property graphs involve reading, writing, and their attributes, and the access patterns of some special attributes such as timestamps can also affect overall performance. Here, by summarizing the regularities of some graph operation characteristics, we can guide the final performance.
+
+We observe that many graph applications have similar data access patterns. For example, in credit risk control, we use recursive path filtering to search for many-to-one patterns to find suspicious credit fraud users and behaviors. For online gambling, we can identify gambling-related fund accounts by recognizing multiple fund transfers in a short period of time. The equity penetration scenario recursively calculates the equity relationship between entities. These scenarios have common patterns such as multi-hop entity and relationship access, time window constraints, and read/write transactions.
+Furthermore, from the discussion in the introduction and the analysis of graph workloads, the following characteristics can be summarized:
+
+**Characteristic 1** KHop is the most typical operation in a graph, based on the data access pattern of the graph topology of points and edges, and has essential differences from relational databases. The typicality of KHop is not only reflected in the different data access patterns, but it is also the performance point that graph databases need to pay attention to the most.
+
+**Characteristic 2** Data access of graph workloads has a certain degree of locality on the topology, and the edges of the same point are usually accessed simultaneously. When the labels of these edges are the same, there is a greater probability of simultaneous access.
+
+**Characteristic 3** When accessing points and edges in graph workloads, their corresponding attributes are usually accessed as a traversal filter condition.
+
+**Characteristic 4** In time-based graph workloads, filtering of points and edges is usually within a certain time range, such as the past week.
+
+**Characteristic 5** Write operations may be accompanied by a large number of read operations, which need to be processed in a single transaction cycle.
+
+Through the analysis of actual online graph applications, the read/write ratio of graph workloads is about 20:1, although the scenarios are limited to the financial field and the number of clusters is also limited, the scale of the data involved and the number of users are very large, which is representative to some extent. The 20:1 read/write ratio of graph workloads indicates that the impact of read workload on overall performance is greater, and the performance of write workload cannot be ignored either.
+
+## 3.Storage Data Structures
+
+TuGraph uses B+ trees as the underlying data structure to support real-time transactional operations for insertion, deletion, querying, and updating.
+
+In sorting tree data structures, B+ trees and LSM trees are the main representatives. B+ trees use a split and merge method to update sorted data in tree nodes, while LSM trees append updates to logs for delayed data merging. B+ trees were originally used in file system implementations, solving the problem of differences in performance between sequential and random operations on hard disks by storing data in adaptive-length leaf nodes, and have a relatively balanced read/write performance. The main advantage of LSM trees is to use WAL (Write Ahead Log) to perform updates, which turns update operations into sequential operations, especially in the case of small key-value pairs. WAL means that the update of data is deferred until it is merged in batches, which can improve the comprehensive efficiency of batch updates, but also makes the system scheduling more complicated. If the update merge is not completed, and the data is read again, LSM trees need to read several levels of locally merged logs, which will cause read amplification and space amplification, thereby affecting read efficiency.
+
+To sum up, B+ trees have better sequential read/write performance, while LSM trees have advantages in random write data. In addition, the way of LSM trees using background merging makes the performance fluctuation difficult to predict, and the correlation between performance fluctuation and upper-level storage and computation is weak, which increases the overall design cost. Considering the above factors, TuGraph chooses B+ trees as the implementation for read performance optimization.
+
+## 4.Data Encoding
+
+For property graph models, in addition to graph topology encoding, property data also greatly affects functionality and performance. We first discuss how property data can be encoded together with topology data. From current research, there are two ways of encoding properties: discrete encoding, which stores property data separately based on pointer indexes, and compact encoding, which packs property data and topology data together. Discrete encoding can store each property separately or pack each edge's properties separately, and the following discussion applies to both situations.
+
+Vertex Query: Property encoding mainly focuses on edges and does not involve vertex queries.
+
+Single-Edge Query: Discrete encoding locates edges through pointers, while compact encoding requires binary search to locate the edge position. Discrete encoding has a slight advantage.
+
+Edge Traversal: Discrete encoding requires constant random access through pointer jumps during edge traversal, while compact encoding arranges data together in advance, greatly improving efficiency due to its sequential access feature. Since edge traversal operations are common according to Rule 3, compact encoding has obvious advantages in edge traversal.
+
+Single-Edge Update: Discrete encoding only requires finding the corresponding pointer position and modifying the pointer's location before and after inserting data. Compact encoding needs to re-encode the compactly arranged data and rewrite the entire edge value, resulting in significant overhead compared to discrete encoding.
+
+Batch Edge Update: Batch updates can pre-build all edge properties for a vertex in memory and write them in one encoding, making both discrete encoding and compact encoding equivalent. However, compact encoding does not require storing pointer variables, so it has higher storage space efficiency.
+
+The performance issues of discrete encoding and compact encoding for a certain type of query discussed above can be alleviated through optimization. Overall, due to the 20:1 read-write load of graphs and the characteristics of property access revealed by Rule 3, TuGraph tends to use compact encoding to ensure read performance. Its main weakness is the overhead of re-encoding during single-edge updates, which can be solved using adaptive mapping technology.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..c60df29973
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,33 @@
+# Multi Level Interfaces
+
+> This document mainly introduces the design concept of TuGraph's multi-level interfaces.
+
+## 1.Introduction
+
+The multi-level interface is a balance between usability and high performance that TuGraph has designed to meet a variety of use cases. For example, Cypher, a declarative graph query language, can abstract away the implementation details of a graph database and express queries based on the graph model. However, Cypher's high-level descriptions cannot be efficiently translated into low-level execution, so TuGraph provides a procedural language, Procedure API, to achieve optimal database performance.
+
+Interfaces can be roughly divided into client interfaces and server interfaces. Most operations are performed on the server, and the client only does data encapsulation and parsing. The client and server are connected through a network, and TuGraph supports both flexible short-connection REST protocol and more efficient long-connection RPC protocol, which can be selected according to different business scenarios.
+
+The server interfaces are all at the calculation layer and are logically separated from the graph data storage by a Core API layer.
+
+![Multi Level Interfaces](../../../../images/multi-level-Interfaces-en.png)
+
+### 1.1.Client Interface
+
+The client interface refers to the interface executed on the client and is typically used for integration into software applications. TuGraph's client interface is relatively simple, including login/logout, data import/export, stored procedure loading and calling, and Cypher operations. Cypher integrates most of the functions, including data operations, graph model operations, operations and account management.
+
+Since the parameters and return values of Cypher are strings, JAVA OGM is a structured wrapper for Cypher, meaning that query results can be encapsulated into a typed object for ease of use.
+
+### 1.2.Server Interface
+
+The server interface includes Cypher, Procedure API, OLAP API, and GNN PI, which provide services for graph transaction engines, graph analysis engines, and graph neural network engines. The characteristics of each interface are explained in detail below.
+
+> __Cypher__ is an abstract description of query logic that is independent of execution logic and is more user-friendly for graph database applications, similar to the SQL language of relational databases. TuGraph's Cypher language mainly follows the OpenCypher query standard open-sourced by Neo4j and extends auxiliary functions such as operations and maintenance management. Descriptive graph query language will become the main data operation method for graph databases, but generating the optimal execution plan between description and execution still requires a long way to go in both academia and industry.
+
+> __Procedure API__ is designed to bridge the gap between descriptive graph query language and optimal performance. TuGraph's Procedure API provides a simple wrapper on top of the Core API, which maximizes the storage's performance efficiency and is the upper limit of Cypher optimization performance. Python Procedure API is a cross-language wrapper on top of C++ Procedure API, but the copying of values during translation may result in some performance loss, and its advantage lies mainly in the ease of use of the Python language. The traversal API is a parallel-executing Procedure interface that is more similar to set operations in terms of description, such as expanding all outgoing neighbors of a point set to obtain a new point set.
+
+> __OLAP API__ belongs to the category of "graph computing systems" and exports snapshots of graph data from storage that supports insert, update, delete, and query operations to support read-only complex graph analysis in a more compact data storage format. OLAP API encapsulates data structures that support high-concurrency execution, including Vector, Bitmap, and CSR-based graph snapshot data structures, and provides a set of concurrent fast point-edge operation frameworks. After the graph analysis task is completed, the data can be written back to the graph database through the interface.
+
+> __GNN API__ mainly provides the interfaces needed for graph neural network applications and can be integrated with machine learning frameworks such as PyTorch. TuGraph's GNN PI mainly integrates DGL and completes the entire process from graph storage to graph neural network application in the Python language environment.
+
+Except for Cypher's interpretive execution, all other server interfaces are compiled and executed, meaning that the corresponding code needs to be sent to the server and compiled (which may take some time) before execution on the server. Therefore, it is usually necessary to load the program first, then find it in the list of loaded applications, and execute it after passing in the input parameters.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/3.htap.md
new file mode 100644
index 0000000000..080cc02e48
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> This document mainly introduces the design philosophy of TuGraph's HTAP.
+
+## 1.Introduction
+
+![htap](../../../../images/htap-en.png)
+
+There are different ways to implement HTAP in architecture: one is to use two different copies to handle OLTP and OLAP tasks separately, with the core being data consistency synchronization and additional resource overhead; the other is to use the same data storage at all times, but this implementation has memory bloat in its data structure and needs further work for industrialization. In TuGraph's design, simple OLAP and OLTP operations share the same data, while complex OLAP operations are exported and handled separately as snapshots.
+
+## 2.Design
+
+In TuGraph, OLTP is the graph transaction engine, corresponding to transaction operations in Figure; OLAP is the graph analysis engine, corresponding to simple graph analysis operations (such as SPSP) and complex graph analysis operations (such as PageRank), the former of which can be executed directly on the graph storage, while the latter requires exporting a snapshot for execution.
+
+- Transaction operations, measured by the graph transaction engine, are local graph add, delete, query and modify operations, typically used for K-hop access.
+- Simple analysis operations are the simpler part of the graph analysis engine, usually local graph analysis operations, such as the shortest path algorithm SPSP and Jaccard algorithm.
+- Complex analysis operations are the more complex part of the graph analysis engine, usually involving multi-round data iteration operations across the entire graph, such as the PageRank algorithm for webpage ranking and the Louvain algorithm for community discovery.
+
+As shown in Figure , external storage is added to the architecture diagram, making the data source for graph analysis not limited to the graph database and can be directly read from text files.
+
+- Graph storage, which is the storage in the graph database, has carefully designed data structures that can perform real-time add, delete, query and modify operations.
+- External storage, which can be an RDBMS or text file, is stored in a simple way as an edge table, only for one-time batch reading and batch result writing. In the calculation layer, it corresponds to the interface in the overall architecture diagram.
+- Cypher, the declarative graph query language, can be executed concurrently.
+- Procedure API, the procedural graph query language, is flexible and can support both transaction operations and graph analysis operations, but its efficiency is not sufficient to complete complex graph analysis operations, and it can be executed concurrently.
+- OLAP API, for multi-round iteration of complex graph analysis. Applications need to first export the graph data in storage into a snapshot in memory, which is only used for fast access and does not need to consider the write support of ACID, so it can be arranged more compactly, and the read efficiency of CSR arrangement is much higher than that of graph storage data arrangement. OLAP API can only be executed serially, and each operation uses full CPU resources.
+
+OLAP API snapshots can be created from external storage, where the edge table data is formatted as CSR, or from the graph storage. It should be noted that OLAP API requires that the IDs of the vertices be consecutive natural numbers, which may require additional ID mapping. This step can be mapped to a specified attribute when creating a snapshot or directly using the attribute value as the ID.
+
+Corresponding to the calculation interface and storage, there are four operating modes.
+
+- Transaction mode, each operation corresponds to a Cypher statement, which is a transaction by default.
+- Plugin mode, call through plugins, after the calculation logic is loaded on the server, also known as stored procedures.
+- Embed mode, which has the same interface as Plugin mode but the graph database service does not need to be started and can directly call the data in the database through the interface. This mode is usually used for debugging Procedure API and OLAP API code, and the debugging information and operation steps are more friendly than Plugin mode.
+- Standalone mode, which maximally separates from the graph database, is more direct when only using the graph analysis engine for data analysis. Standalone mode will directly use the data of the external storage.
+
+The use of the graph neural network engine is similar to the 'complex graph analysis operation', which calls part of the OLAP API and GNN API at the same time, which is not elaborated here.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/index.rst
new file mode 100644
index 0000000000..b42c13eac8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/4.characteristics/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Characteristics
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/5.architecture.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/5.architecture.md
new file mode 100644
index 0000000000..198facd84b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/5.architecture.md
@@ -0,0 +1,15 @@
+# Architecture
+
+> This document mainly introduces the product architecture of TuGraph.
+
+## 1.Introduction
+
+![Architecture](../../../images/architecture-en.png)
+
+The following diagram shows the overall architecture of an enterprise-level graph database from the perspective of functional modules, using TuGraph as an example, from bottom to top:
+
+- Software and hardware environment. This involves the development and use environment of the graph database. TuGraph is mainly developed based on the underlying C++ language, and is compatible with most operating systems and CPUs on the market.
+- Storage layer, including the KV storage layer and the graph storage layer. The storage layer needs to support various functions required by the calculation layer.
+- Calculation layer. The calculation layer should include the graph transaction engine, graph analysis engine, and graph neural network engine. It also includes a variety of programming interfaces provided by the server, including descriptive query language Cypher, stored procedures, and so on.
+- Client. The client SDK should support multiple languages such as Java, Python, and C++, and also support command-line interaction. The Browser and Explorer reduce the threshold for using the graph database through web-based interaction.
+- In terms of ecological tools, it covers the development, operation, and management links of enterprise-level graph databases, improving usability.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/6.functionality.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/6.functionality.md
new file mode 100644
index 0000000000..eaf709f08e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/6.functionality.md
@@ -0,0 +1,101 @@
+# Functionality
+
+> This document mainly introduces the main functions and features of TuGraph.
+
+## 1.Installation
+
+## 1.1.Installation
+
+Deployment methods TuGraph currently provides three deployment methods: cloud deployment, Docker deployment, and local package deployment. Users can choose the appropriate deployment method according to their actual situation.
+
+## 1.2.Software and Hardware Environment
+
+TuGraph core is developed in C++, and the default compiler used is GCC8.4, using c++14 standard. Some functions use other compilers, such as ApacheLucene-based full-text indexing, which uses JNI interface and requires a Java compiler. In addition, the Python Procedure API is provided in the stored procedure, which requires a Python environment. TuGraph does not require special hardware such as GPUs, and can naturally adapt to general hardware upgrades such as RDMA and HBM with high latency and low bandwidth.
+
+TuGraph has been tested on CPUs based on X86 and ARM, including Intel, AMD, Kunpeng, Hygon, Feiteng, etc., and also runs on multiple operating systems, including mainstream versions of Ubuntu, CentOS, SUSE, Galaxy Kylin, Zhongbiao Kylin, and UOS, without special requirements for operating systems and CPUs.
+
+The software and hardware environment also includes the environment of dependent libraries. Since the default KV storage in TuGraph's storage layer is LMDB, the file system needs to support POSIX interfaces. The compilation and parameter configuration in different environments will be slightly different. For example, in the packaging of point-edge data in graph storage, it should match the page table size of the operating system, which is 4KB by default, and it is recommended to set the system's page table size to 4KB.
+
+## 2.Storage layer
+
+In the graph data model, TUGraph supports the attribute graph model, which can be divided into subgraphs, tags (including vertex tags and edge tags), and attributes according to the hierarchy.
+
+From the perspective of the storage layer, TuGraph uses an intuitive multi-layered tree model, without tags across subgraphs or attributes across tags, and only retains the core logic of the graph model. In terms of subgraph storage, TuGraph has performed data physical isolation for multiple graphs, and each graph corresponds to an instance of LMDB. The metadata description information of multiple graphs is saved in a special public LMDB instance called meta. The storage of vertex and edge tags and their attributes maps graph data adaptively to KV key-value pairs, maximizing read performance. At the same time, multi-threaded writing is implemented at the KV layer, solving the disadvantage of low write performance of LMDB. Primary key indexes and secondary indexes correspond to B+ tables in LMDB, supporting index value addition, deletion, query, and modification based on comparison.
+
+The storage layer also retains some other non-core functional data, including permission data, pre-compiled plugin data, and monitoring data.
+
+## 3.Calculation layer
+
+The calculation layer is divided into three parts in terms of function, including the TP-class graph transaction engine, the AP-class graph analysis engine, and the graph neural network engine.
+
+__The graph transaction engine__ is mainly used to process concurrent graph operations, including single-point queries, neighbor queries, and path traversal. The graph transaction engine focuses on ACID transactions of concurrent operations, ensuring that the operation logic will not interfere with each other. The main performance indicator is QPS, which is the number of completed queries per second.
+
+__The graph analysis engine__ usually operates as a full-graph iteration. Some simple analysis tasks (such as SPSP) can be completed by the graph transaction engine, and complex analysis tasks are completed by the graph analysis engine, which usually takes several seconds to several hours for a single task. Therefore, a single graph analysis task should use all hardware resources in parallel, and the performance indicator is the total time for completing the task.
+
+__The graph neural network engine__ usually operates as a full-graph iteration. In addition to graph topology-based operations, the graph neural network engine also needs to integrate a machine learning framework to handle vector operations, such as PyTorch, MXNet, and TenserFlow.
+
+The logic of the three engines is different and independently configured for resource pools. The graph transaction engine sets up a thread pool based on RPC operations. For each operation received from the client, a thread is taken from the pool to process it, and the number of concurrent executions is equal to the capacity of the RPC thread pool, which is usually configured as the number of server cores. The graph analysis engine has an analysis thread pool, and each graph analysis task is executed concurrently, that is, all threads are used to execute a task to speed up the performance of the operation. The serial execution feature of TuGraph graph analysis operations will restrict the user experience to a certain extent. The demand for concurrent graph analysis can be processed by deploying high-availability, increasing machine resources, or connecting to an external task scheduler to transfer data to a container for real-time scheduling and calculation. Graph neural network operations will reuse the resources of the graph transaction
+
+## 4.Core Features
+
+### 4.1.Query Language
+
+TuGraph provides Cypher graph query language that follows the OpenCypher standard.
+- Supports Procedure embedding.
+- Supports pluggable optimization frameworks with various optimization features.
+- Supports extensible security check framework for Cypher.
+
+### 4.2.Stored Procedures
+
+When users need to express complex query/update logic that Cypher cannot describe, or when high performance is required, TuGraph's stored procedures (Procedure) is a more concise and efficient choice than calling multiple REST requests and completing the entire processing flow on the client-side.
+
+### 4.3.Data Import/Export
+
+Although TuGraph supports data insertion, batch import can greatly improve efficiency. The import function can be divided into importing into an empty database (offline import) and incremental import. The former refers to importing when the subgraph is empty, and the additional assumption can greatly improve the import performance. In TuGraph, the throughput rate of empty database import and incremental import differs by 10 times. Data consistency needs to be considered in data export, which is based on exporting data based on a snapshot.
+
+TuGraph can perform data export on graph data already stored in TuGraph using the command-line tool `lgraph_export`. The export format supports CSV and JSON.
+
+### 4.4.Backup and Restore
+
+ TuGraph's backup function can be divided into active/scheduled, offline/online, and full/incremental backup. The goal is to complete the backup with the smallest storage and computing costs possible. The Restore function can restore to the latest state or a historical marked time point, ensuring that the database is in a consistent state.
+
+### 4.5 Data Warmup
+
+TuGraph is a disk-based graph database, and data is loaded into memory only when it is accessed. Therefore, system performance may deteriorate due to frequent IO operations in the first period after the server is opened. We can improve this problem by preheating the data in advance.
+
+### 4.6 High Availability Mode
+
+High availability means that by configuring a cluster, real-time multi-replica data hot backup can be achieved, and the cluster can still provide services when some replicas are not in use. TuGraph uses the multi-machine hot backup mechanism of the RAFT protocol, which can reduce RPO to near 0. Data synchronization is performed at the computation layer through RPC interfaces for write operations. The high availability cluster of TuGraph adopts a master-slave mode, where only the master node processes write requests, and both master and slave nodes can process read requests. The write request processing of the master node needs to be synchronized to more than half of the total nodes. The write request is considered complete when the majority of the nodes have written successfully.
+
+## 5.Client Tools
+
+Client Tools Client tools mainly include SDKs for various programming languages, OGM, and command-line tools.
+
+The client SDK is mainly used for secondary development and can be linked to the server through RPC or REST protocols. RPC has better performance based on long links, and data needs to be uniformly serialized through protobuf. TuGraph uses brpc, which supports rpc clients in Java, Python, and C++. REST's protocol is more flexible and can be easily adapted to more diverse environments, and different programming languages can easily connect. TuGraph provides a Python REST client instance, and command-line interaction is also implemented using REST.
+
+OGM (Object Graph Mapping) is a graph object mapping tool for TuGraph, which supports mapping JAVA objects (POJO) to TuGraph. Classes in JAVA are mapped to nodes in the graph, collections in classes are mapped to edges, and properties of classes are mapped to properties of graph objects. It also provides corresponding function to operate the graph database. Therefore, JAVA developers can easily use TuGraph database in a familiar ecosystem.
+
+The command-line tool `lgraph_cypher` is a query client that can be used to submit OpenCypher requests to the TuGraph server. `lgraph_cypher` client has two execution modes: single-command mode and interactive mode.
+
+
+## 6.Ecological Tools
+
+Ecological tools are a crucial component of enterprise-level databases, and a rich array of ecological tools can greatly enhance the usability and stability of graph databases.
+
+### 6.1.TuGraph DataX
+
+![Import&Export](../../../images/tugraph-datax.png)
+
+TuGraph's core supports importing and exporting CSV and JSON data, offering both full database and incremental importing modes. In practice, there may be a need to import from multiple data sources such as MySQL, Kafka, and Hive, and TuGraph connects to these sources using DataX. Due to the differences between relational and graph models, data cleaning processes can be quickly processed using SparkSQL. TuGraph focuses only on the reliability and performance of simple CSV and JSON scenario imports.
+
+### 6.2.Visual Interaction
+
+TuGraph Browser is a visual interface for direct users of graph databases, covering most of TuGraph's capabilities, including data import, graph model building, data addition/deletion/query/modify, and monitoring and maintenance operations.
+
+TuGraph Explorer targets graph business users and focuses more on business logic. Explorer is a visual interactive interface generated using Graph Insight's zero-code programming framework, which can easily add more user-friendly interactive elements to present the graph as an underlying image of understanding.
+
+### 6.3.Monitoring
+
+TuGraph uses the Prometheus + Grafana monitoring framework in a loosely coupled manner. Prometheus obtains monitoring information from TuGraph's monitoring interface, stores it in a local time-series database, and then displays it interactively on the web using Grafana.
+
+The monitoring states provided by TuGraph include the state of the graph database and the state of the server. The former includes the database-side status such as read/write load and number of vertices/edges, while the latter includes the real-time status of the server's memory, CPU, and hard disk. If some monitoring state exceeds the expected threshold, proactive alerts are necessary, usually requiring integration with other operations and control systems such as group messaging and email alerts.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/7.scenarios.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/7.scenarios.md
new file mode 100644
index 0000000000..9d5a7ac434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/7.scenarios.md
@@ -0,0 +1,61 @@
+# Scenarios
+
+> This document mainly introduces the application scenarios of graph databases.
+
+## 1.Financial Industry
+
+The entities in the financial industry mainly involve people, companies, accounts, products, etc., and their relationships include transaction relationships, logging relationships, equity relationships, employment relationships, etc. These entities form a financial graph data network. By applying graph databases, we can discover a lot of useful information from the financial graph data network, which helps us make more accurate financial decisions.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Loan review|By analyzing the applicant's relationship and transaction history, etc., it is auxiliary to judge the applicant's repayment ability and willingness. It can be applied to retail loan review, small and micro loan review, supply chain finance, etc. This method can complement the traditional audit mechanism based on the applicant's own information, which is particularly useful for small and micro loan audits with low individual information coverage.|
+|Post-loan|By analyzing the borrower's transaction history, it assists in analyzing whether the borrower has default risk. Compared with the traditional method of issuing alerts only when loan funds flow to specific users, this method can assign a risk value to each account and issue warnings when the loan flows to high-risk accounts.|
+|Missing recovery|By analyzing the social and shopping data of missing borrowers, other contact methods can be found. This method can significantly improve the recovery rate of missing borrowers.|
+|Guarantor loop detection|Special guarantee structures such as cyclic, chain, family-style, and cross can be found in the guarantee relationship graph to expose potential risks. Compared with the JOIN method of a relational database, the solution based on graph algorithms is more efficient, can detect any length of guarantee loop, and can achieve more complex limited condition detection.|
+|Credit card fraud detection|A relationship network of addresses, contact information, etc. in credit card application information is constructed, and a community discovery algorithm is run in the application relationship network to detect suspected fraudulent gangs, thereby rejecting suspected fraudulent applications and reducing economic losses.|
+|Anti-money laundering|Suspected money laundering behaviors and links can be found through the transaction network and medium network. Money laundering is a complex process involving multiple parties. By conducting graph analysis in transaction and social networks, we can more accurately detect money laundering behaviors.|
+|Car insurance anti-fraud|For insurance fraud involving repair shops, by analyzing the relationship between the insured person, the case location, and the repair shop, fraudulent claims can be more accurately identified, reducing economic losses.|
+
+## 2.Industrial Industry
+
+A large amount of heterogeneous data will be generated in the production and manufacturing process, and how to effectively organize and manage these data is one of the most important issues in industrial big data. These data include design documents, equipment data, simulation plans and results, experimental results, experience documents, etc. The relationships between these data are complex, and traditional data management systems can only accumulate data, and they are often unable to search for related materials. Using graph models, these different types of data are organized into a network, which makes it easy to browse and search for data.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Supply chain management|Supply chain data mainly concerns the correspondence between products, components, and parts, the correspondence between parts and suppliers, and sensitive components in parts. Compared with the traditional BOM system, the solution using graph databases can more conveniently maintain complex networks of multiple component levels and multiple supplier levels, thereby providing basic support for a through supply chain.|
+|Document management|Using graph databases can organize different types of documents together organically according to different relationships. For example, design documents for components, component-part relationships, component test documents, relevant experience documents, etc. can be organized together so that all relevant information for the component can be obtained easily when needed.|
+|R&D process management|A large amount of simulation, experimentation, and testing needs to be performed in the product development and verification process. Each test process involves many different steps, the connection between the steps, the data versions used in each step, and the algorithm versions all make up a complicated relationship network. Using graph databases can better manage this relationship network, providing a good foundation for data reuse and process improvement in the R&D process.|
+|Equipment information management|Manufacturing requires the management of a large number of devices, which are interrelated (power supply, feeding, spatial relationship) to form a complex network. Traditional databases are difficult to reflect this complex relationship. Using graph databases can easily represent these relationships, thereby better managing equipment information.|
+
+## 3.Smart City
+
+With the development of technology, intelligent management of cities has become a major trend. Intelligent management requires a strong system software to support it, built on a good information management platform. In an intelligent city management system, an intelligent decision-making system needs to make decisions based on a large amount of different information, including various topology information (such as roads, pipelines, etc.), supply and demand information (such as electricity transmission, drinking water supply, sewage discharge, etc.), environmental information (such as temperature, humidity, rainfall, etc.), and so on. To manage these complex and heterogeneous data organically and make decisions based on them, a mature system is needed. Traditional data management systems based on relational data models are not suitable for managing such complex and heterogeneous data. Using a graph model can solve this problem well. If we manage these different data using a graph database, we can achieve many complex intelligent management scenarios.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Smart Traffic|Based on road topology, road capacity, and current traffic flow, intelligent traffic signal scheduling can be performed to improve traffic efficiency.|
+|Smart Drainage|Based on drainage system information and current rainfall, the drainage system can be scheduled to reduce the occurrence of waterlogging.|
+|Pipeline Management|Organizing the production, installation, topology information, and historical status information of pipelines can help us manage the pipelines throughout their lifecycle, including fault diagnosis, life assessment, etc.|
+|Crowd Evacuation|When a large number of people need to be evacuated, multiple transportation modes such as buses, subways, taxis, shared bicycles, etc., need to be considered, as well as the road carrying capacity. Using a graph database to organically integrate this information can help us make better decisions and provide better support for large public events.|
+
+## 4.Social Governance
+
+Social governance involves public safety, legal affairs, public opinion, network security, and more. Social governance is a comprehensive, multi-system linkage problem. It requires the synthesis of a large amount of data and global considerations to make better decisions. In this multidimensional and complex data problem, the graph data model can provide better adaptability and provide a solid foundation for intelligent social governance decision-making platforms.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Criminal Gang|Conspiratorial gangs will inevitably make contact through some means, including face-to-face meetings (appearing in the same place), phone calls, or internet contacts, and they may also have economic exchanges. If we store all of this data in a unified graph, we can use graph analysis algorithms to identify closely connected groups and then discover and identify the entire criminal gang.|
+|Stakeholder Case Investigation|Stakeholder cases, especially stakeholder economic cases, often involve a large number of personnel and elements (money, location, events, etc.). How to effectively organize this information to provide evidence for handling cases is a difficulty in stakeholder case investigation. Using graph databases to store and analyze this information can help us quickly locate the data, analyze the personnel structure, and provide better technical support for case investigation.|
+|Illegal Website Identification|Illegal websites, phishing websites, yellow websites, and so on, often use different domain names and IPs to avoid being blocked. The filter method based on a blacklist can only block known illegal websites and cannot effectively identify new domain names and IPs. Based on the IP-domain name network mapping relationship, we can create a graph and then use graph calculations to establish a "trustworthiness" model for domain names and IPs to determine whether a website belongs to an illegal website.|
+|Court File Management|Case files are often complex, and different cases may be linked through parties, locations, case nature, judges, and so on. These links constitute a complex network. Using a graph database, we can more conveniently manage these complex relationships and improve case handling and query efficiency.|
+
+## 5.Internet
+
+Social networks and person-product purchase relationships can all form a network. By analyzing this network data, we can provide users with better services, including relevant recommendations, user information collection, important user identification, and spam user identification, and so on.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|ID-Mapping|Graph databases can store all user-related information, including the relationships between users, in one database, and can also use these relationships to identify situations where one person has multiple accounts or multiple people share an account, thus providing decision support for future risk control, recommendations, and other businesses.|
+|Friend Recommendation|Based on the analysis of social networks, we can provide friend recommendations such as "friends of friends" and "common friends".|
+|Product Recommendation|Based on the user-product relationship graph, we can find users with similar interests and recommend other products that similar users have chosen.|
+|Spam User Identification|Traditional spam user identification is mainly based on user account information, such as registration information and posting information, but these types of information are relatively easy to forge. On the other hand, network-based information doesn't have this problem: it's difficult to forge. Therefore, spam user identification based on network information can be more accurate and efficient.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/8.glossary.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/8.glossary.md
new file mode 100644
index 0000000000..6f2aa1629a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/8.glossary.md
@@ -0,0 +1,27 @@
+# Glossary
+
+## 1.Graph Technology
+
+> __Graph Computing__:Generalized graph computing, including graph databases, graph analysis, and graph learning; Narrowly defined graph computing only includes graph analysis. The generalized definition is used by default.
+
+> __Graph Database__:Focuses on operations such as adding, deleting, modifying, querying, and transaction processing for graph data, such as TuGraph DB.
+
+> __Graph Analysis__:Focuses on algorithmic analysis and pattern analysis of entire graph data, such as TuGraph Analytics.
+
+> __Graph Learning__:Refers to the same meaning as graph neural networks and graph machine learning, such as TuGraph Learn.
+
+> __Graph Intelligence__:Same as generalized graph computing, including graph databases, graph analysis, and graph learning. It is usually used for conceptual promotion and not for products.
+
+## 2.Specific Concepts
+
+> __Vertex__:Also known as node or point. Avoid using the term "node" as it is often used to refer to the number of servers and can be easily confused. "Node" refers to the meaning of combination, intersection, and crossing; "node" can refer to a milestone on a timeline (key node) or a processing entity in a computer system (such as a server in a computer network).
+
+> __Edge__:Refers to the connection between two vertices.
+
+> __Degree__:Refers to the number of incoming or outgoing edges on a vertex. Note that in non-graph theory scenarios, "hops" are often referred to as "degrees".
+
+> __Hop__:Refers to the number of vertices between two vertices on a path (excluding the starting point and including the endpoint). "K-Hop" in the algorithm performance test refers to this meaning.
+
+> __Vertex Label__:Refers to the type of a vertex, also known as a point label.
+
+> __Edge Label__:Refers to the type of an edge, also known as an edge label.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/index.rst
new file mode 100644
index 0000000000..a42b1d7c5a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/2.introduction/index.rst
@@ -0,0 +1,16 @@
+TuGraph DB Introduction
+=================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.characteristics/index.rst
+   5.architecture
+   6.functionality
+   7.scenarios
+   8.glossary
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..8c764fcffe
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/1.preparation.md
@@ -0,0 +1,85 @@
+# Quick Start
+
+> This document is intended for new users to get started quickly and contains an introduction, features, installation, and use of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property Graph Model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+### 1.1.Supported Platforms
+
+TuGraph supports both X86_64 and ARM64 architectures in physical, virtual, and containerized environments.
+
+### 1.2.Hardware requirements
+
+_You are advised to use NVMe SSDS with large memory configurations for optimal performance。_
+
+| Hardware | Minimum Configuration | Recommended configuration |
+|----------|-----------------------|---------------------------|
+| CPU      | X86_64                | Xeon E5 2670 v4           |
+| Memory   | 4GB                   | 256GB                     |
+| Disk     | 100GB                 | 1TB NVMe SSD              |
+| System   | Linux 2.6             | Ubuntu 18.04, CentOS 7.3  |
+
+## 2.Installation
+
+TuGraph can be installed quickly via Docker Image or locally via RPM /deb packages.In addition, TuGraph offers community edition services on Alibaba Cloud Computing Nest, which means you don't need to purchase your own cloud host to quickly deploy TuGraph services and achieve operational monitoring, thus building your own graph application.
+
+> Installation package/image download: [Download address](../1.guide.md#TuGraph-Latest-Version).
+
+> Computing Nest Deployment: You can search for it on Alibaba Cloud Computing Nest, or you can quickly access it through [deployment link] (../5.developer-manual/1.installation/5.cloud-deployment.md).
+
+### 2.1.Fast experience through Docker
+
+1. The Docker environment installed locally
+
+   The docker official documentation：https://docs.docker.com/get-started/
+
+2. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. Start docker
+
+   ```shell
+   docker run -d -p 7070:7070 -p 9090:9090 -p 7687:7687 --name tugraph_demo tugraph/tugraph-runtime-centos7 lgraph_server
+   # 7070 is default http port，for web accessing.
+   # 9090 is default RPC port，for RPC client accessing.
+   # 7687 is bolt port, for neo4j client accessing.
+   ```
+
+4. Open by browser
+
+   `http://x.x.x.x:7070`
+
+   > Default account `admin`,Default password `73@TuGraph`
+
+5. Start
+   ```shell
+   docker run -dt -p 7070:7070 -p 9090:9090 -p 7687:7687 --name tugraph_demo tugraph/tugraph-runtime-centos7
+   docker exec -it tugraph_demo bash
+   # start the service
+   lgraph_server -d start
+   ```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..2ec92747d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# DEMO:Movie
+
+> This document mainly introduces the usage of the movie demo.
+
+## 1.Modeling and Data Import
+
+After logging in, click "Help", click "Quick Start", click "One-Click Model Creation", click "One-Click Data Creation", and complete the creation of the Movie Scene Graph.
+
+Movie：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| Label       | Type   | Description                                                                                           |
+|-------------|--------|-------------------------------------------------------------------------------------------------------|
+| movie       | Vertex | Represents a specific movie, such as "Forrest Gump".                                                  |
+| person      | Vertex | Represents a person, who may be an actor, director, or screenwriter for a movie.                      |
+| genre       | Vertex | Represents the genre of a movie, such as drama, horror.                                               |
+| keyword     | Vertex | Represents some keywords related to the movie, such as "save the world", "virtual reality", "subway". |
+| user        | Vertex | Represents a user who watches movies.                                                                 |
+| produce     | Edge   | Represents the relationship between the producer of a movie.                                          |
+| acted_in    | Edge   | Represents the relationship between actors and the movies they have appeared in.                      |
+| direct      | Edge   | Represents the relationship between a movie and its director.                                         |
+| write       | Edge   | Represents the screenwriting relationship of a movie.                                                 |
+| has_genre   | Edge   | Represents the genre classification of a movie.                                                       |
+| has_keyword | Edge   | Represents some keywords of a movie, which are more specific labels for classification.               |
+| rate        | Edge   | Represents the rating given by a user to a movie.                                                     |
+
+## 2.Query Examples
+
+### 2.1.Example One
+
+Query all actors of the movie 'Forrest Gump' and return the subgraph composed of the movie and the actors.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.Example Two
+
+Query all actors of the movie 'Forrest Gump' and list the roles they played in the movie.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.Example Three
+
+Query all movies rated below 3 by Michael.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.Example Four
+
+Query users who have the same dislike of movies as Michael, where the standard for dislike is a rating of less than three.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.Example Five
+
+Recommend movies to Michael by first finding users who dislike the same movies as Michael, and then filtering out the movies that these users like.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.Example Six
+
+Query the movies that Michael's friends like.
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.Example Seven
+
+By querying the movies that people who gave 'Forrest Gump' a high rating also like, recommend similar movies to users who like 'Forrest Gump'.
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..e07192fa2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,48 @@
+# DEMO:Wandering Earth
+
+> This document mainly introduces the usage of the Wandering Earth demo.
+
+## 1.Demo Scene Design
+
+The demo is based on the story background of The Wandering Earth 1 and The Wandering Earth 2.
+
+- Based on the plot, a graph structure is designed, including three types of points: organization, character, celestial body, and facility, and two types of edges: event and relationship.
+- Prepared data corresponding to the schema based on the plot.
+- Prepared some queries to ask questions about the plot.
+
+## 2.Directory structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to queries.
+- control.sh: Script to control the start and stop of TuGraph Server.
+lgraph_standalone.json: Configuration file for starting TuGraph Server.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 4.Data Import
+
+- Modify DATA_PATH in import.json according to the data storage directory.
+- Refer to the load function in control.sh to load data.
+- Refer to the start function in control.sh to start TuGraph Server.
+- After starting TuGraph Server, access ${HOST_IP}:8888 to open the web page and confirm whether the data is successfully imported.
+
+## 5.Cypher Query
+
+Refer to the Cypher document and enter Cypher in the TuGraph web page frontend for queries.
+
+## 6.Usage Display
+
+### 6.1.Data Import Display
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.Query Display
+Query all event processes related to the crisis on Jupiter.
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+Query all event processes related to all crises.
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..64ea337fa8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# The Three Body
+
+> This document mainly introduces the usage of Three-Body demo.
+
+## 1.Demo Scenario Design
+The demo scenario is designed based on the story background of Three-Body 1, 2, and 3.
+
+According to the setting of the Three-Body story, we have designed 4 types of nodes and 6 types of edges. The nodes include "character", "organization", "plan", and "timeline", while the edges include "character-character relationship", "character-plan relationship", "character-organization relationship", "organization-plan relationship", and "organization-organization relationship". According to the plot, corresponding schema data and some queries have been prepared to propose some questions about the plot.
+
+## 2.Directory Structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to the query.
+- control.sh: Script to start and stop TuGraph Server.
+- lgraph_standalone.json: Configuration file for TuGraph Server startup.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+### 4.Data Import
+
+- Manual import
+    - Modify DATA_PATH in import.json according to the data storage directory.
+    - Refer to the load function in control.sh to load the data.
+    - Refer to the start function in control.sh to start the TuGraph service.
+    - After starting the TuGraph service, access ${HOST_IP}:8888 to open the web page and confirm whether the data is imported successfully.
+- Automatic creation
+    - Click `New Graph Project`, select Three-Body data, fill in the graph project configuration, and the system will automatically create the Three-Body scenario graph project.
+    - Alternatively, use the pre-installed Three-Body graph project provided by the product.
+
+### 5.Cypher Query
+
+Refer to the TuGraph documentation and enter Cypher in the TuGraph web page frontend to execute a query.
+
+## 6.Usage Demo
+
+### 6.1.Data Import Demo
+
+![data](../../../../images/three-body-data.png)
+
+### 7.Query Demo
+
+#### 7.1.Character Relationship Query
+In the plot of Three-Body 1, a large number of scientists committed suicide all over the world at the beginning, which aroused the attention of the police. During the investigation process, the truth behind it gradually surfaced step by step according to the clues of the character relationships, as shown in the above graph. Shi Qiang and Wang Miao discovered that most people had direct or indirect connections with Ye Wenjie, and sent Wang Miao undercover to finally discover Ye Wenjie's ultimate commander identity. As can be seen in the graph, there are many edge relationships (many one-degree or two-degree neighbors) around Ye Wenjie's vertex.
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.Neighbor Vertex Analysis
+There are many plans in Three-Body, and sometimes we may be confused. At this time, we can use the graph's neighbor vertex query to view the relevant characters and organizations of the plan. For example, in the "Wallfacer Project", we can see that there are four characters related to it, and these four are also the "Wallfacers" who are highly expected by the world.
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.Query Common Neighbors of Node A and B
+We often want to know who are the common related characters between two characters, so that we can quickly grasp the relationship between these two characters. In the case of large amounts of data, it is very convenient to use Cypher for graph relationship analysis!
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.Set/Change Properties
+As the plot progresses, we gradually learn about the various labels on "Ye Wenjie", so we can also update these labels to the "Ye Wenjie" node:
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.Add/Delete Nodes
+Later, we learned about characters such as Luo Ji and Cheng Xin, and organizations such as PIA and the Star Ring Group, and wanted to add them as nodes to the graph:
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..0bb359cbe0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# Three Kingdoms
+
+> This document mainly introduces the usage of the Three Kingdoms demo.
+
+## 1. Introduction
+Due to the lack of historical records, there are often many mysteries surrounding even well-known historical events. Taking the history of the Three Kingdoms as an example, why did Zhuge Liang come out of seclusion to help Liu Bei, and why there was a huge gap in achievements between Cao Cao and Liu Bei, both heroes of the time, are some of the unsolved mysteries. Historians in the past often used two-dimensional relationship analysis of history, and the conclusions drawn were often one-sided. Using TuGraph to import historical figures and events of the Three Kingdoms into a graph model, and analyzing them using graph calculation methods can help us obtain more valuable knowledge from limited information, which is a very meaningful interdisciplinary attempt.
+## 2. Data Modeling
+We designed 5 types of vertices and 5 types of edges. The vertices include "Lord", "Province", "Civilian", "Military Officer", and "Battle"; the edges include "Father", "Brother", "Belongs To", "Native Place", and "Participate In". The specific modeling information is shown below:
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. Data Import
+- Manual import
+    - To import data into TuGraph, you can use the lgraph_import tool to import it offline. The import command of lgraph_import is as follows:
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- Automatic creation
+    - Click `New Graph Project`, select the Three Kingdoms data, fill in the graph project configuration, and the system will automatically create the Three Kingdoms scene graph project.
+    - Or use the built-in Three Kingdoms graph project provided by the product directly.
+## 4. Cypher Query
+### 4.1. Why did Zhuge Liang Choose Liu Bei?
+The following Cypher command can be used to view the relationship between Zhuge Liang, Cao Cao, and Liu Bei:
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+From the graph, we can intuitively see that one of the shortest paths between Cao Cao and Zhuge Liang includes the battle of Xuzhou. Cao Cao once committed a massacre in Xuzhou because his father was killed, and nobody would choose a warlord who had previously massacred their hometown as their lord. In contrast, Liu Bei once prevented Cao Cao's violence during the battle of Xuzhou, which should be one of the reasons why Zhuge Liang had a good impression of Liu Bei.
+
+### 4.2. Why Did Cao Cao Achieve More Than Liu Bei?
+The following Cypher command can be used to view the family's support for Cao Cao's career:
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+The most important thing for pacifying the world is military talent. Cao Cao's father originally had the surname Xiahou, but was adopted into the Cao family. The Cao and Xiahou families were both local big clans in Qiao County, providing Cao Cao with a large number of military talents such as Xiahou Dun, Xiahou Yuan, Cao Ren, and Cao Hong in the early days of his career. In contrast, Liu Bei's father died early and he didn't have any family support. He only gathered his Five Tiger Generals when he was over 50 years old, by which time the best time to fight for land in the chaotic world had passed. Cao Cao had already controlled six of the nine provinces in the world.
+
+### 4.3. Why Did the Most Powerful Wei Kingdom in the Three Kingdoms Perish First?
+The following Cypher command can be used to view the important civilian officials of the Cao Cao group:
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+In fact, Cao Wei was overthrown in the Gao Ping Ling incident in 249 AD, after only 29 years of existence, which was shorter than Shu Han (43 years) and Dong Wu (51 years). The reason why the most powerful Wei Kingdom in the Three Kingdoms perished first was that the civilian official system of Cao Wei (the nine-rank system) made it easy for power to be concentrated in the hands of aristocratic families. From the graph, we can see that almost all the important civilian officials of Cao Cao and Cao Pi's generations were from aristocratic families, such as Xun Clan of Yingchuan, Zhong Clan of Yingchuan, Chen Clan of Yingchuan, Jia Clan of Wuxi, etc. There was even a trend of regionalization, centered on Yingchuan. Ultimately, the regime was usurped by the Sima family of Henei, which had close ties with the Xun Clan of Yingchuan.
+
+### 4.4. What Were the Strengths of Each of the Three Kingdoms?
+The following Cypher command can be used to view the population strength of each group in the Three Kingdoms:
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+The query result is shown in the following table:
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+In ancient society, an important indicator of a country's strength was its population. Since population data is missing, we estimate the population of each province using the birthplace data of all lords, civilians, and military officers in the Three Kingdoms. It is found that among the main characters of the Three Kingdoms, 60 belong to Wei, 23 belong to Wu, and only 2 belong to Shu, which proves that Wei was indeed the most powerful country in the Three Kingdoms.
+
+### 4.5. How Should Cao Cao's Military Ability Be Evaluated?
+The following Cypher command can be used to view the main battles that Cao Cao participated in:
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+From the graph, we can see that Cao Cao participated in 8 out of the 15 major battles in the Three Kingdoms, with a high participation rate. However, Cao Cao only won the battles of Xuzhou, Yanzhou, Guandu, and Xiangyang, while losing the battles of Hanzhong, Wancheng, the Campaign against Dong Zhuo and the Battle of Red Cliffs. His overall win rate was 50%, which proves that Cao Cao was not a very outstanding military strategist.
+
+## 5. Remarks
+More analysis is needed and encouraged to be added by everyone!
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..b2e7d4b257
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Demo:Round The World
+
+> This document mainly introduces the usage of the round-the-world demo.
+
+## Brief
+
+Based on the virtual background of "Around the World in 80 Days" and partial public historical flight data, it helps users design optimal flight plans for multiple cities.
+- Demo designed custom website service
+- The data source is a foreign open source website and does not include mainland city flight data
+- The flight prices in the data are simulated data and do not represent real prices.
+
+## Example
+
+### Login Page
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### Query Page
+
+Click on the login page to enter the query page.
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### Query Example
+
+Select no more than 8 cities from the city list in the lower left corner, click Query to return the recommended flight plan, and return the 10 path plans with the lowest cost and shortest flight time, provided that the interval between previous and later flights is 2-6 hours.
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+For detailed instructions, see the [manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "") document.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..106f943e05
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo example
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..b2ed78a618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+TuGraph DB Quick Start
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..8c10946a50
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,659 @@
+# TuGraph Browser
+
+> This document focuses on the use of TuGraph Browser.
+
+## 1.Introduction
+
+TuGraph Browser (hereinafter referred to as Browser) is a powerful product visualization development tool that presents graph data in an intuitive visual way, allowing users to easily manage, maintain, and view the database running status. This tool not only supports graph data management and visualization but also supports system account management, providing users with a comprehensive operation and management experience, enabling users to manage and utilize graph databases more efficiently.
+
+## 2.User Guide
+
+### 2.1.Accessing
+
+After the user completes the installation of the graph database, they can access the Browser through a browser. Users only need to enter the IP:Port of the server where TuGraph is located in the browser address bar. The default port used is 8888.
+
+- For example:127.0.0.1:8888
+- Recommend using Chrome
+
+### 2.2.Logging in
+
+![login](../../../images/browser/login.png)
+
+- After successfully accessing the Browser, the login page appears first (as shown above), where users need to fill in their account and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- After the user's first login, they will be redirected to the password modification page. Once the password is successfully modified, they can only use the new password to log in.
+
+### 2.3.Quick Start
+
+For first-time users of TuGraph, you can quickly build a graph project with the built-in demo data and get started with graph data projects quickly.
+
+#### 2.3.1.Creating a Graph Project
+
+In the `Graph Project` homepage tab, click `Create New Graph Project` to create a new graph project.
+
+![quickstart-creategraph](../../../images/browser/quickstart-creategraph.png)
+
+Select a built-in demo data, and click the `Next` button.
+
+![quickstart-selectdemo](../../../images/browser/quickstart-selectdemo.png)
+
+In the Fill in Configurations interface, enter the graph project information. Since the demo data is relatively small in size, set the Maximum Storage Space to 1 GB. After entering the graph project information, click the Create button, and the system will automatically create the graph model of the demo data and import the graph data.
+
+![quickstart-configure](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.Starting a Graph Project
+
+After creating a graph project with demo data, you can find the corresponding graph project in the `Graph Project` tab, and then click `Graph Query` to query graph data.
+
+![quickstart-graphtab](../../../images/browser/quickstart-graphtab.png)
+
+Execute the default query statement to browse the graph data in the demo.
+
+![quickstart-result](../../../images/browser/quickstart-result.png)
+
+For more quick start documents, please visit the[Quick Start Documents](../3.quick-start/1.preparation.md)
+
+### 2.4.Graph Project
+
+`Graph Project` provides visualized graph project management and graph data development functions, providing users with a series of convenient graph data visualization operations, including graph project creation, modification, deletion, and other management operations, as well as graph data queries, vertex-edge statistics, and other operations. In addition, it also supports graph model management, making it more convenient for users to manage and maintain graph data.
+
+#### 2.4.1.Graph Project Management
+
+On the `Graph Project` page, you can see the graph projects in the current graph database.
+
+![graphmanagement-homepage](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.Creating a Graph Project
+
+On the `Graph Project` page, click the `Create New Graph Project` button to create a new graph project.
+
+![graphmanagement-creategraph](../../../images/browser/graphmanagement-creategraph.png)
+
+Creating a new graph project requires completing the creation of the graph project through two pages: `Select Template` and `Fill in Configurations`.
+
+- __Select Template__: The product provides two types of templates: empty templates and demo templates.
+    - Empty templates: A brand new graph project where users need to create their own graph model and import graph data, generally used for formal project development.
+    - Demo templates: Built-in demo data in the product. After the graph project is created successfully, the system will automatically create a demo graph model and import demo graph data, usually used for trial and learning.
+
+![graphmanagement-selecttemplate](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __Fill in Configurations__: Users need to fill in basic information about the graph project and click the `Create` button to create the graph project.
+    - Graph Name: The name of the new graph project, which is also the unique primary key of the graph project. Supports Chinese characters, letters, numbers, and underscores, but does not support spaces or other special characters.
+    - Graph Description: The description of the new graph project can be used to describe the background and objectives of the project in detail.
+    - Advanced Configuration - Maximum Storage Space: Set the maximum storage space that the graph project can occupy. It does not actually occupy physical storage space in advance. After the actual data volume reaches the maximum storage space threshold, no more data can be written.
+
+![graphmanagement-configure](../../../images/browser/graphmanagement-configure.png)
+
+After creation, the graph project can be viewed in the graph project tab on the `Graph Project` page.
+
+##### 2.4.1.2.Editing a Graph Project
+
+On the `Graph Project` page, click the `Edit button` (pencil icon) in the graph project tab to edit the basic information of the corresponding graph project.
+
+![graphmanagement-editgraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+graphmanagement-editgraph-button
+
+![graphmanagement-editgraph](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.Deleting a Graph Project
+
+On the `Graph Project` page, click the `Delete` button (trash can icon) in the graph project tab to delete the corresponding graph project.
+
+![graphmanagement-deletegraph-button](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_Note: Graph projects cannot be restored after deletion._
+
+##### 2.4.1.4.Vertex-Edge Statistics
+
+On the `Graph Project` page, click the `Vertex-Edge Statistics` button (line graph icon or refresh icon) in the graph project tab to count the number of vertexs and edges in the corresponding graph project.
+
+![graphmanagement-statistics-button](../../../images/browser/graphmanagement-statistics-button.png)
+
+The statistical results will be displayed on the graph project tab. Graph projects that have not been vertex-edge statistics will display `No vertex-edge data`, and graph projects that have already been vertex-edge statistics need to click the `Refresh` button to count again.
+
+![graphmanagement-statistics](../../../images/browser/graphmanagement-statistics.png)
+
+![graphmanagement-statistics-refresh-button](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.Graph Building
+
+The `Graph Building` function in Browser is mainly used for graph project model definition and data import. On the `Graph Project` page, click the `Graph Building` button in the graph project tab.
+
+![graphbuild-button](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.Model Definition
+
+Browser provides a visualization way to create and maintain graph models.
+
+- Graph models can also be created and maintained through the `Cypher` tool and the `lgraph_import` tool. For details, please refer to the [Cypher API Document](../5.developer-manual/6.interface/1.query/1.cypher.md) and [Data Import Document](../5.developer-manual/3.server-tools/1.data-import.md).
+
+###### a.Browse Graph Models
+
+On the `Model Definition` page, you can view detailed graph model settings, support list and canvas view of the graph model, support list display of vertex type properties and indexes, edge type properties and start/end vertex types.
+
+![graphbuild](../../../images/browser/graphbuild.png)
+
+- Supports list view of vertex types and edge types.
+    - Supports the display of the number of vertexs or edges in the corresponding vertex type or edge type in the vertex type or edge type tab.
+    - Supports keyword search for vertex type or edge type names. Enter the keyword in the `search box` to display the corresponding vertexs or edges.
+
+        ![graphbuild-list-search](../../../images/browser/graphbuild-list-search.png)
+    - Supports copying vertex type or edge type names. Click the `Copy` button to copy the name of the vertex or edge to the clipboard.
+
+        ![graphbuild-list-copy](../../../images/browser/graphbuild-list-copy.png)
+    - Supports deleting vertex types or edge types. Click the `Delete` button to delete the corresponding vertex or edge.
+
+        ![graphbuild-list-delete](../../../images/browser/graphbuild-list-delete.png)
+- Supports canvas view of vertex types and edge types.
+- Clicking the corresponding vertex type or edge type in the list or canvas can display the model details.
+        ![graphbuild-select](../../../images/browser/graphbuild-select.png)
+
+###### b.Add Vertex
+
+Click the `Add Vertex` button on the `Model Definition` page to add a vertex type in the right sliding window.
+
+![graphbuild-addvertex-button](../../../images/browser/graphbuild-addvertex-button.png)
+
+The user needs to enter the Vertex type name, properties, and indexes, and click the `Complete` button to complete the creation of the Vertex type.
+- Vertex Type Name: The name of the Vertex, which is also the unique identifier of the Vertex.
+- Properties: The attributes of the Vertex, and one attribute needs to be used as the primary key.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating Vertexs.
+- Indexes: The indexing attributes of the Vertex, you need to create attributes first and then set the attribute as an index.
+    - Attribute: The attribute that needs to be indexed.
+    - Unique:Set the attribute field as a unique value.
+    - Primary Key: Whether the corresponding attribute is a primary key. The Unique option must be `Yes` after selecting `Yes`.
+    - Delete: Indexes can be deleted arbitrarily during Vertex creation.
+
+![graphbuild-addvertex](../../../images/browser/graphbuild-addvertex.png)
+
+- Edit Vertex: You can add Vertex properties, modify the data type of existing properties, and add or delete indexes. You need to click the `Save` button for each newly added or modified attribute to take effect.
+_Note: Once the primary key field attribute is created, it cannot be modified._
+
+![graphbuild-editvertex](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.Add Edges
+
+Click the `Add Edge` button on the `Model Definition` page to add an edge type in the right sliding window.
+
+![graphbuild-addedge-button](../../../images/browser/graphbuild-addedge-button.png)
+
+The user needs to enter the edge type name, properties, select the start vertex type and end vertex type, and click the `Complete` button to complete the creation of the edge type.
+- Edge Type Name: The name of the edge, which is also the unique identifier of the edge.
+- Properties: The attributes of the edge, which may not exist on the edge.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating edges.
+- Selecting start vertex type and end vertex type: Set the start vertex type and end vertex type of the edge, and support multiple start vertex types and end vertex types.
+    - Start vertex: Select the vertex type of the start vertex.
+    - End vertex: Select the vertex type of the end vertex.
+    - At least one vertex type needs to be created in advance to set the start vertex type and end vertex of the edge.
+    - If not selected, it means that the start vertex and end vertex can be any vertex type, and the corresponding edge is not displayed on the canvas, and you need to view the edge type in the left list.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+- Edit Edge: You can add edge properties and modify the data type of existing properties. You need to click the `Save` button for each newly added or modified attribute to take effect.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+###### d.Import Model
+
+Click the `Import Model` button on the `Model Definition` page to upload a model file and quickly create a model.
+
+![graphbuild-importmodel-button](../../../images/browser/graphbuild-importmodel-button.png)
+
+Click the `Upload File` button on the `Import Model` page to upload the model file. After the upload is successful, click `OK` to import the graph model.
+
+- Overwrite the current canvas model: If this option is selected, the existing graph model will be cleared before importing the graph model in the model file; if not selected, the vertex types and edge types in the model file will be imported, but the existing vertex types and edge types will not be modified.
+
+![graphbuild-importmodel](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.Export Model
+
+Click the `Export Model` button on the `Model Definition` page to export the graph model in the current graph project to a JSON file.
+
+![graphbuild-exportmodel-button](../../../images/browser/graphbuild-exportmodel-button.png)
+
+The model file is in JSON format and is not recommended to be manually modified.
+
+![graphbuild-exportmodel](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.Data Import
+
+After completing the `Model Definition`, click the `Next` button to enter the data import page.
+
+###### a.Data Preparation
+
+Data needs to be prepared in advance before importing data. The current browser supports the uploading of CSV files, and the data file suffix needs to be ensured to be CSV.
+- The header is not mandatory.
+- Text qualifiers are supported, and the text qualifier is double quotes. Data Import - CSV
+
+![graphbuild-import-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.Upload Files
+
+Upload the required data files on the `Data Import` page and import the data into the graph project.
+
+![graphbuild-import](../../../images/browser/graphbuild-import.png)
+
+- Separator: The column separator of the data file.
+- File upload: Supports uploading multiple files.
+    - Supports selecting multiple upload files in the pop-up window.
+    - Supports dragging and dropping files to upload on the page.
+    - Supports uploading vertex files and edge files at the same time.
+
+###### c.Data Mapping
+
+After the file is successfully uploaded, you need to set the `Data Corresponding Table` on the `Data Import` page to establish a mapping relationship between the data columns in the data file and the target vertexs/edges and corresponding attributes.
+
+- Data Corresponding Table: Displays uploaded data problems.
+    - File Name: The name of the uploaded data file.
+    - File Size: The size of the uploaded data file.
+    - Read Result: The result of uploading the data file, success means uploaded successfully.
+    - Delete: Delete on the page, the local file will not be deleted.
+- Data File Mapping: Each uploaded data file needs to configure a mapping relationship.
+    - Label: Select the corresponding vertex or edge type for the file, and you can only select one type of vertex or one type of edge.
+    - Starting from the Nth row: Start reading data from the Nth row. The system defaults to start reading data from the 0th row. To skip the header, you can enter 1.
+    - Attribute Mapping: Select the attribute field corresponding to the data column from the drop-down list.
+    - Data Preview: The system will pre-read the first 5 rows of the data file.
+
+![graphbuild-import-datamapping](../../../images/browser/graphbuild-import-datamapping.png)
+
+After the file is successfully uploaded, you can click the `Continue Import` button to continue importing other data or click the `Go to Graph Query` button to query the imported data on the `Graph Query` page.
+
+![graphbuild-import-success](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.Graph Query
+
+Click the `Graph Query` button in the `graph project tab` on the `Graph Project` page to query and access graph data in the graph project. The product provides multiple modes for querying graph data, such as Statement Query, Path Query, and Vertex Query, and supports switching between graph projects and query result display.
+
+![query-button](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.Switch Graph Project
+
+The `Graph Query` function can only access one graph project data. Users can select and switch to other graph data in the `Switch Graph Project drop-down list`.
+
+![query-selectgraph](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.Statement Query
+
+The Browser provides a visual way to develop and debug graph query statements. Users can enter graph query statements, execute and return results, and support collecting statements and viewing graph models.
+
+![query-view](../../../images/browser/query-view.png)
+
+###### a.Statement Query Window
+
+Users enter graph query statements in the `Statement Query Window`, click the `Execute` button to run the corresponding statement, and display the result in the `Execution Result tab`.
+
+- Switch Query Language: Provides switching between different graph query language modes.
+    - _Currently only supports Cypher syntax._
+
+![query-selectgql](../../../images/browser/query-selectgql.png)
+
+- Statement Query Window: Provides syntax prompts for the current query language.
+
+![query-gqltips](../../../images/browser/query-gqltips.png)
+
+- Execute: Click the `Execute` button to send the entered query statement to the background for execution.
+
+![query-execute-button](../../../images/browser/query-execute-button.png)
+
+- Bookmark: Click the `Bookmark` button to save the content of the current statement query window as a template for future use.
+
+![query-bookmark-button](../../../images/browser/query-bookmark-button.png)
+
+- Download: Click the `Download` button to save the content of the current statement query window as a text file and download it to the local computer for future use.
+
+![query-download-button](../../../images/browser/query-download-button.png)
+
+For detailed Cypher usage guidelines, please refer to the document: [Cypher API](../5.developer-manual/6.interface/1.query/1.cypher.md)
+
+###### b.Bookmark List
+
+Displays the collected query statements in a list, and clicking on a bookmark in the list allows using the statement. Supports keyword search, name modification, and deletion.
+
+![query-bookmark](../../../images/browser/query-bookmark.png)
+
+###### c.View Graph Model
+
+The Browser provides a graph model query for the current graph project, which allows users to query vertex types and edge types conveniently. It supports both list display and canvas graph display, and can be hidden.
+
+![query-schema-list](../../../images/browser/query-schema-list.png)
+![query-schema-graph](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.Path Query
+
+The Browser provides `Path Query templates`. Users can search whether corresponding paths exist in the graph data of the graph project by selecting paths.
+
+![pathquery-result](../../../images/browser/pathquery-result.png)
+
+- Path: Select the path to search in the path selection drop-down list.
+    - Select a Path: Based on the definition of the graph model, the system will automatically match the corresponding first-degree relationship path. Clicking the path drop-down box again will automatically match the next-degree relationship path based on the endvertex vertex type of the path.
+![pathquery-select](../../../images/browser/pathquery-select.png)
+    - Execute: Click the `Execute` button to return the matched paths in the graph project.
+    - Advanced Configuration: Set the number of paths to scan. The default is 100 paths.
+![pathquery-configuration](../../../images/browser/pathquery-configuration.png)
+
+_Note: The edges in the graph model need to set the starting vertex and endvertex. If no edge in the graph project has set the starting vertex and endvertex, the drop-down list will have no results._
+
+##### 2.4.3.4.Vertex Query
+
+The Browser provides `Vertex Query templates`. Users can query vertex data in the graph project by selecting vertex attributes.
+
+![vertexquery](../../../images/browser/vertexquery.png)
+
+- Select Vertex: Select the vertex type to be queried.
+    - Attribute: The system will automatically match the schema of the vertex type, set the corresponding query conditions, and click the execute button to return the results.
+- Return vertex Limit: Set the upper limit of the returned vertex data.
+
+![vertexquery-criteria](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.Execution Result Tab
+
+The Browser provides multiple ways to display graph query results, such as JSON view, JSON text, vertex-edge list, and vertex-edge view. It supports result download, data insertion, and full-screen display.
+
+###### a.JSON View
+
+The Browser provides JSON view to display query results.
+
+![query-result-jsonview](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON Text
+
+![query-result-jsontxt](../../../images/browser/query-result-jsontxt.png)
+
+###### c.Vertex-Edge List
+
+The Browser provides vertex and edge list to display query results.
+
+![query-result-list](../../../images/browser/query-result-list.png)
+
+###### d.Vertex-Edge View
+
+The Browser provides canvas view to display query results.
+
+![query-result-graph](../../../images/browser/query-result-graph.png)
+
+###### e.Data Insertion
+
+The Browser provides a visual way to insert vertex or edge data in the corresponding graph project. Click the `Insert Data` button, select the Vertex Type or Edge Type on the Insert Data tab, enter the attribute values, and click `OK` to complete the data insertion.
+
+![query-result-insert-button](../../../images/browser/query-result-insert-button.png)
+
+![query-result-insert](../../../images/browser/query-result-insert.png)
+
+###### f.Download Execution Result
+
+The Browser provides a function to export graph query results as text files. Click the `Download Execution Result` button, and the system will automatically save the result as a text file and download it to the local computer.
+
+![query-result-download](../../../images/browser/query-result-download.png)
+![query-result-downloadtxt](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.Full-Screen Display
+
+The Browser provides full-screen display for graph query results. Click the `Full-Screen` Display button to display the results in full screen, and click the `Exit Full Screen` button to exit full-screen display.
+
+![query-result-fullscreen-button](../../../images/browser/query-result-fullscreen-button.png)
+![query-result-fullscreen](../../../images/browser/query-result-fullscreen.png)
+![query-result-fullscreen-close](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.Graph Analysis
+
+Click the `Graph Analysis` button in the `Graph Project` tab in the `Graph Project` interface to display and analyze graph data on the canvas. The product provides `Query by Statement` and `Query by Configuration` to query and load data from the graph project to the canvas. It supports filtering, layout adjustment, and canvas operations on the canvas data.
+
+![graphanalysis-button](../../../images/browser/graphanalysis-button.png)
+
+As shown in the figure below, the graph analysis function mainly includes: 1. Operation bar: the main operation functions of graph analysis, including view switching, query filtering, layout style, and canvas operations; 2. Left sidebar: query, filter, and appearance operation area; 3. Canvas area: the area for displaying graph data, displaying vertex and edge data, supporting vertex expansion query, collapsing vertexs, fixing vertexs, deleting vertexs, and providing canvas graph data statistics; 4. Right sidebar: when a vertex or edge data is selected, the corresponding attribute information will be displayed; 5. Switch graph project: switch to different graph projects for analysis.
+
+![graphanalysis-operation-area](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.Query by Statement
+
+In the `Query by Statement` function, users can enter query statements to query graph data and load the data to the canvas area for display.
+- Syntax Description: TuGraph's query language and syntax documentation.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-query](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.Query by Configuration
+
+In the `Query by Configuration` function, users can select vertex types and enter attribute conditions to query graph data and load the data to the canvas area for display.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-configurequery](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.Canvas Analysis
+
+In the `Canvas Analysis` function, users can perform operations and analysis on the vertex or edge data on the canvas, including: expanding queries by selecting vertexs, collapsing/expanding vertexs, fixing vertexs, clearing the canvas, lassoing, vertex/edge retrieval, and canvas legend. The most basic operation on the canvas is dragging vertex data. By selecting a vertex with the left mouse button and moving the mouse, the position of the vertex data can be changed.
+
+###### a.Expand Query
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, move the mouse to `Expand Query`, and a secondary window will pop up. Click on the corresponding expansion degree to perform the query.
+- First-degree Query: Bidirectional expansion of first-degree relationships.
+- Second-degree Query: Bidirectional expansion of second-degree relationships.
+- Third-degree Query: Bidirectional expansion of third-degree relationships.
+- Custom Query: Expand based on selected conditions.
+    - Edge Direction: Set the direction of the expansion relationship, Bidirectional: includes outgoing edges and incoming edges, Outgoing: edges pointing outward from the selected starting vertex, Incoming: edges pointing to the selected starting vertex.
+    - Degree of Diffusion: The degree of expansion.
+    - Custom Return vertex Count: Configure the number of vertexs returned to the front end, default is 100, to prevent exceptions on the front end caused by super vertexs.
+    - Add Filter Group: Set the relationship type and attribute conditions of the expansion, multiple relationship types can be set.
+
+![graphanalysis-canvas-expand-before](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![graphanalysis-canvas-expand-after](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![graphanalysis-canvas-expand-custom](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.Collapse/Expand Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Collapse Vertexs` to hide the first-degree relationship Vertexs of the selected Vertexs; right-click on the collapsed Vertex data again to perform Expand Vertexs operation to show the hidden first-degree relationship Vertexs.
+
+![graphanalysis-canvas-collapse](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![graphanalysis-canvas-expand](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.Fix Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Fix vertexs` to fix the selected vertexs in place. The fixed vertexs cannot be moved (including layout adjustment); right-click on the fixed vertex data again to perform `Unfix vertexs` operation to restore the normal operation of the selected.
+
+![graphanalysis-canvas-fixed](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![graphanalysis-canvas-unfix](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.Delete Vertex
+
+Right-click on a vertex in the `Canvas` area to open the operation window. Click on `Delete Vertex` to remove the selected vertex from the canvas.
+
+![graphanalysis-canvas-delete](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.Clear Canvas
+
+Click on the `Clear Canvas` button in the `Toolbar` area to clear all data on the canvas.
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.Vertex/Edge Retrieval
+
+Select a vertex or edge in the `Vertex/Edge Retrieval` window and enter a keyword to perform a fuzzy search for attribute data on the canvas. After the search, you can locate the data position.
+
+![graphanalysis-canvas-retrieval](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.Canvas Legend
+
+In the legend area of the `Canvas` area, the vertex types in the canvas will be displayed. Click on a vertex type to select the corresponding vertex data. Click on the "More" button to display the statistics, which can be displayed in a list or chart format to show the number of vertexs or edges.
+
+![graphanalysis-canvas-legend-list](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![graphanalysis-canvas-legend-chart](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.Attribute Filter
+
+Click on the `Filter` button in the `Toolbar` area, and click on `Attribute Filter` in the `Sidebar` to perform filter and filtering. Users can select the vertex or edge types to be filtered, and set the corresponding attribute values. After retrieving the filtered group conditions, the corresponding vertex or edge data will be highlighted on the canvas.
+- Please select the vertex/edge type: Select the vertex type or edge type to be searched.
+- Attribute condition: Set the attribute conditions to be searched. Multiple groups can be set to take the union of the filtering results.
+- Add filter group: Multiple filter conditions can be set to take the union of the filtering results.
+- Reset: Clear the filter conditions.
+
+![graphanalysis-queryfilter-attributefilter](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.Statistical Filter
+
+Click on the Filter button in the Toolbar area, and click on Statistical Filter in the Sidebar to perform statistical filtering of canvas data. Users can select the vertex or edge types to be counted, and set the corresponding attribute values. The system will automatically group and count based on the selected vertex/edge types and attributes. The results can be displayed in chart and list formats. Clicking on the values in the chart or list area will highlight the corresponding data on the canvas.
+
+![graphanalysis-queryfilter-statisticalfilter](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![graphanalysis-queryfilter-statisticalfilter-chartswitch](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.Layout Style
+
+Click on the `Layout` button in the `Toolbar` area, and select the corresponding layout method to rearrange the data on the canvas. It supports force-directed layout, concentric circle layout, circular layout, radial layout, Dagre layout, and grid layout. Each layout method has different layout parameters. After adjusting the parameters, the data on the canvas will be rearranged.
+
+![graphanalysis-style-layout-button](../../../images/browser/graphanalysis-style-layout-button.png)
+![graphanalysis-style-layout-parameters](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+For detailed layout parameters, please refer to[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide).
+
+##### 2.4.4.6.Appearance Style
+
+Click on the `Appearance` button in the `Toolbar` area, and click on `Vertex Style` or `Edge Style` in the `Sidebar` to configure the appearance style.
+- Vertex Style
+    - Apply to vertex type: Set the display style for the corresponding vertex type. Multiple vertex types can be configured simultaneously.
+    - Size: The display size for the corresponding vertex type.
+    - Color: The display color for the corresponding vertex type.
+    - Icon: The icon style for the corresponding vertex type.
+    - Display Text: The text content displayed for the corresponding vertex type, defaulting to id.
+    - Advanced Configuration: Mark the corresponding vertex data based on the set conditions.
+- Edge Style
+    - Apply to Edge Type: Set the display style for the corresponding edge type, supports configuring the appearance of multiple edge types simultaneously.
+    - Color: The display color for the corresponding edge type.
+    - Width: The display width for the corresponding edge type.
+    - Display Text: The text content displayed for the corresponding edge type, not displayed by default.
+    - Advanced Configuration: Display the corresponding edge data based on the set conditions.
+
+![graphanalysis-style-appearance](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.Console
+
+The `Console` provides a visualized account management and database information viewing function. It provides users with comprehensive account and role management functions, including adding, deleting, modifying, and disabling accounts and roles. In addition, it also provides users with convenient database information viewing function, allowing users to easily view the basic information and configuration information of the graph database. Basic information mainly includes version number, running time, CPP compilation version number, etc., while database configuration information includes port number, system function parameter configuration, etc.
+
+#### 2.5.1.Account Management
+
+##### 2.5.1.1.Account Management
+
+##### a.Add Account
+
+Click the `Add` button in the `Account Management` interface to create a new account. Users need to enter the account name, account description, account password, and related roles.
+
+- Account Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Related Roles: When creating a new account, you must select a role. After the account is added successfully, the system will automatically generate a role with the same name as the account name.
+
+![account-add-button](../../../images/browser/account-add-button.png)
+![account-add](../../../images/browser/account-add.png)
+
+##### b.Edit Account
+
+Click the `Edit` button in the `Account Management` interface to edit the account description, account password, and related roles.
+
+![account-edit](../../../images/browser/account-edit.png)
+
+##### c.Disable Account
+
+Click the `Disable` button in the `Account Management` interface to prevent the corresponding account from logging in and accessing. Click the `Enable` button to enable the corresponding account login and access permissions.
+
+![account-disable](../../../images/browser/account-disable.png)
+![account-enable](../../../images/browser/account-enable.png)
+
+##### d.Delete Account
+
+Click the `Delete` button in the `Account Management` interface to delete the corresponding account.
+
+![account-delete](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.Role Management
+
+##### a.Add Role
+
+Click the `Add` button in the `Role Management` interface to create a new role. Users need to enter the role name, role description, and graph permissions.
+
+![role-add-button](../../../images/browser/role-add-button.png)
+
+- Role Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Graph Permissions: The browser supports four types of graph permission configurations: All, Read/Write, Read-Only, and None.
+    - All: corresponds to the read and write permissions of the graph, including editing the graph model permissions (schema).
+    - Read/Write: corresponds to the write permission of the graph, but does not include the permission to edit the graph model (schema).
+    - Read-Only: corresponds to the read permission of the graph.
+    - None: cannot access or operate the corresponding graph.
+- Role Conflict: When two roles have different graph permissions for the same graph, and both roles are authorized to the same account, the graph permission of the account for the graph is the union of the graph permissions of the two roles.
+
+![role-add](../../../images/browser/role-add.png)
+
+##### b.Edit Role
+
+Click the `Edit` button in the `Role Management` interface to edit an existing role. Users can edit the role description and graph permissions.
+
+![role-edit](../../../images/browser/role-edit.png)
+
+##### c.Disable Role
+
+Click the `Disable` button in the `Role Management` interface to disable the corresponding role. Click the `Enable` button to enable the corresponding role. After the role is disabled, the corresponding graph permissions of the role become invalid.
+
+- Disabled Role: After the role is disabled, the corresponding graph permissions become invalid.
+    - When a user has two roles with operating permissions on the same graph, if one of the roles is disabled, the permission of the other role is still valid.
+
+![role-disable](../../../images/browser/role-disable.png)
+![role-enable](../../../images/browser/role-enable.png)
+
+##### d.Delete Role
+
+Click the `Delete` button in the `Role Management` interface to delete the corresponding role.
+
+![role-delete](../../../images/browser/role-delete.png)
+
+#### 2.5.2.Database Information
+
+##### 2.5.2.1.Basic Information
+
+`Basic Information` obtains the current running status of the system and displays key information.
+
+![db_basic](../../../images/browser/db_basic.png)
+
+|Parameter    |Meaning    |
+|-------|--------|
+|TuGraph Version Number|The current version number of TuGraph, x.x.x|
+|Running Time|The time from when TuGraph service starts to now|
+|Server Code Version|The current commit of the tugraph-db repository|
+|Front-end Code Version|The current commit of the tugraph-web repository|
+|CPP Compiler Version|The CPP version number when compiling TuGraph|
+|Python Version Number|The Python version number when compiling TuGraph|
+|CPP Compiler ID|The CPP type when compiling TuGraph|
+
+The current running status of the system can also be obtained through commands.
+
+```cypher
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.Database Configuration Information
+
+`Database Configuration Information` obtains the current configuration parameters of the system and displays key information. To adjust the configuration parameters or understand the detailed configuration parameters, please refer to [Database Running-Service Configuration](../5.developer-manual/2.running/2.tugraph-running.md).
+
+![db_configuration](../../../images/browser/db_configuration.png)
+
+| Parameter                   | Meaning                                                                                                                                         |
+|-----------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------|
+| bind_host                   | The host set when the system starts, usually 0.0.0.0                                                                                            |
+| disable_auth                | Whether to disable the regular update of token authentication. If set to true, the token can be used permanently                                |
+| durable                     | Whether to enable persistent storage of the underlying layer. If set to false, the data is updated asynchronously to the disk                   |
+| enable_audit_log            | Whether to enable audit log                                                                                                                     |
+| enable_backup_log           | Whether to enable real-time incremental backup                                                                                                  |
+| enable_fulltext_index       | Whether to enable full-text indexing                                                                                                            |
+| enable_ip_check             | Whether to enable IP whitelist                                                                                                                  |
+| enable_rpc                  | Whether to enable the RPC port                                                                                                                  |
+| enable_ssl                  | Whether to enable SSL encrypted transmission                                                                                                    |
+| optimistic_txn              | Whether to enable optimistic multi-threaded write transactions                                                                                  |
+| port                        | The REST access port of the current system                                                                                                      |
+| rpc_port                    | The port used by the RPC and HA services                                                                                                        |
+| subprocess_max_idle_seconds | The maximum idle time of the subprocess, a thread pool parameter                                                                                |
+| thread_limit                | The maximum number of threads used by the server at the same time                                                                               |
+| verbose                     | The level of detail of the log output information. It can be set to 0, 1, or 2, with larger values indicating more detailed output information. |
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..b7e5e9f2fa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,167 @@
+# TuGraph Browser(old version)
+
+> This document focuses on the use of TuGraph Browser
+
+## Definition
+
+TuGraph Browser is a visual development tool provided by TuGraph.
+
+## Functionality
+
+TuGraph Browser provides graph database developers with functions such as visual graph data development, graph data management and maintenance.
+
+## How to use it
+
+### 1. Connect to the database
+
+When the user completes the installation of the graph database, you can access it through the Browser, TuGraph Browser tool. The user only needs to type in the browser address bar: IP of the server where TuGraph is located :Port. The default port is 7090.
+
+### 2. Login
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- When the page is opened successfully, the first thing you see is the login page, and the user needs to fill in the account number and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change the initialized password in time after logging in
+
+### 3. Workbench
+
+#### 3.1 Quick Start
+
+- When you log in for the first time, the system will create an empty graph by default
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- The user clicks on the help option and selects Get Started quickly
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- Then click "One-click Create Model" -- >" One-click Create Data "to complete the construction of the built-in Movie data graph
+
+#### 3.2 Create subgraphs and examples
+
+##### 3.2.1 Create a subgraph
+
+- Click on New subgraph
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- Fill in the form information
+  ![alt Fill out the form](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+- Subgraph name
+- Subgraph description
+- Configuration information
+- Click OK to prompt that creation succeeded
+- Toggle the subgraph
+  ![alt Toggle subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- Click New Example
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- Select the example and click Create
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 query
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 User Interface Layout
+
+- Cypher input box
+- Result set display area
+
+##### 3.3.2 Result set display area function details
+
+- Result set tag display and functions
+  ![alt Result set tag](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+- All types of statistics for the result set are shown here
+- Click on the different "label" to make the following changes
+  -Change the display color
+- Modify the node size or edge thickness
+- Modify default display properties or system properties
+- Layout modification
+- Force guide layout
+- Grid layout
+- Tree layout
+- Environment layout
+- edge polymerization
+- Edges of the same type and direction can be merged
+- Create nodes
+- Click the Create Node button
+- Select the node type
+- Add node content
+- Create relationships
+- Select start and end points in the canvas
+- Select the type that can be matched
+- Enter node information
+- Stop layout
+- When too much data is causing the browser page to stall, you can click this stop layout button to improve the smoothness of the experience
+- Mouse hover
+- Enable this feature to highlight the one-degree neighbors of the mouse-over node
+- Result set export
+- Result sets can be exported as png, json, csv three different file forms
+- the refresh
+- Clicking the refresh button will re-execute the initial cypher statement for the current page and refresh the result set
+  Maximize -
+  -Click Maximize button, the result set display area will be displayed in full screen
+- Result set display mode switching
+  - Support graph, table and text modes
+
+##### 3.3.3 Schema
+
+- model
+  ![Modeling Alt](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- schema supports real-time addition, deletion, modification and query
+
+- schema supports import and export
+
+##### 3.3.4 Data import
+
+- Local data import
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+- Select the file encoding format
+- Select a local CSV file
+- Select the model for the corresponding node or edge
+- Do the data mapping
+  -Complete the data import
+
+##### 3.3.5 plug-in (Stored Procedure)
+
+- Use of plug-ins
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+- Users can upload the plug-in program written locally, execute it in the visual page, and view the execution result
+- Users can perform, uninstall, execute, and download plug-ins in the visualization page
+
+##### 3.3.6 Help
+
+- where it records how TuGraph-browser is used
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 Console
+
+##### 3.4.1 Basic database information
+
+- Displays basic database configuration information
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 Permission management
+
+- A function module used to create users and roles. Users can manage permissions here
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 Live status
+
+- This shows the database real-time status, including: CPU usage, memory usage, disk usage, number of data requests, disk IO
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 Task Management
+
+- Here the user can see the task in execution and stop the task
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 Audit logs
+
+- Database related audit logs recorded here, used to troubleshoot problems encountered in use
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6c4d063e26
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB User Guide
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/1.environment.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/1.environment.md
new file mode 100644
index 0000000000..f2cdffe578
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/1.environment.md
@@ -0,0 +1,41 @@
+# Environment
+
+> This document provides an overview of the required hardware and software environment for deploying TuGraph.
+
+## 1.Hardware Environment
+
+### 1.1. CPU
+TuGraph supports X86_64 and ARM64 architectures for both physical, virtual, and containerized environments. Tested and certified hardware platforms include Intel, AMD, Kunpeng, Hygon, Feiteng, and others.
+
+### 1.2. Memory
+We recommend having a memory capacity that is equal to or greater than the actual data size. For optimal performance, caching all data in memory is ideal. In terms of data locality, graph databases have poorer locality compared to relational databases. Therefore, if the data cannot fit in memory, frequent swapping may occur.
+
+### 1.3. Storage
+We strongly recommend using NVMe SSD as external storage. The database performs numerous synchronous write operations, often in a random manner, making the read/write performance of the external storage critical to the overall database performance. Hence, high IOPS and low-latency NVMe SSDs are the optimal choice.
+
+If circumstances permit only the use of SATA interface SSDs or cloud-based network disks, although performance may be affected, TuGraph can still run correctly.
+
+It is recommended to have external storage size at least four times the actual data size. For example, if the data size is 1TB, preparing a 4TB hard drive would be more reliable.
+
+
+
+## 2. Software environment
+
+### 2.1. Operating System
+
+TuGraph is compatible with popular operating systems, including Ubuntu, CentOS, SUSE, Galaxy Kylin, China Standard Software, UOS, and others, all of which have been tested and certified.
+
+Among them, the most stable system versions are Ubuntu 18.04, CentOS 7, and CentOS 8.
+
+### 2.2. System Libraries
+
+The requirements for system libraries differ between the compilation environment and the runtime environment. For specific details, please refer to the[environment mode](2.environment-mode.md)。
+
+## 3.Recommended Configuration
+
+| Hardware | Minimum Configuration	   | Recommended Configuration                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| Memory   | 4GB       | 512GB                    |
+| Storage  | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/2.environment-mode.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/2.environment-mode.md
new file mode 100644
index 0000000000..98f9820ba2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/2.environment-mode.md
@@ -0,0 +1,24 @@
+# Environment Mode
+
+> This document primarily introduces the three types of environments involved in TuGraph.
+
+## 1.Classification
+
+Based on the different functionalities supported by the environments, they can be categorized into the following:
+
+* The compilation environment has all dependent libraries for TuGraph compilation, including all dependencies of the running environment, and can compile TuGraph source code, but does not include precompiled TuGraph executable files and library files for developers to compile source code.
+
+* Running environment, with GCC/Java/Python environment, can run all functions of TuGraph, and can host full-text indexing, java client, c++ source code uploaded as plugin, and complete functions of python plugin, built-in TuGraph precompiled executable file and library files for customers to install and use directly without compiling source code.
+
+* Simplified operating environment, which is approximately equivalent to a bare system plus precompiled TuGraph. It can only run the basic functions of TuGraph. There is no C++ plugin to compile and run, only so upload, no full-text index, and no python plugin. It is for quick setup and trial use.
+After compiling TuGraph, all the required dependencies are packaged together in the form of .a files, eliminating the need for unnecessary additional dependencies during runtime. However, since TuGraph supports stored procedures, which involve compiling C++ code on the server, the required compilers still need to be present in the environment.
+
+## 2.System Library
+
+For the three types of environments, the required system libraries, excluding the TuGraph runtime package, are as follows:
+
+* Compilation Environment: It includes GCC, Python, Java compilers, as well as libraries such as ANTLR4 and Pybind11. Please refer to the tugraph-compile-*-Dockerfile for more details.
+
+* Runtime Environment: The main dependencies introduced by stored procedures include GCC, Boost, CMake, and others. Please refer to the tugraph-runtime-*-Dockerfile for more details.
+
+* Mini-Runtime Environment: There are no additional system library dependencies. Please refer to the tugraph-mini-runtime-*-Dockerfile for more details.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md
new file mode 100644
index 0000000000..f90475b285
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/3.docker-deployment.md
@@ -0,0 +1,103 @@
+# Docker Deployment
+
+>This document introduces the creation and download of Docker images for TuGraph Compile and TuGraph Runtime.
+
+## 1.Introduction
+
+- TuGraph Compile Image: Provides a compilation environment and can be used for TuGraph compilation and testing.
+- TuGraph Runtime Image: Provides a binary executable environment with TuGraph library and executable files.
+- TuGraph Mini Runtime Image: Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+## 2.Existing Docker Images
+
+### 2.1.Image Download
+
+The images are hosted on [DockerHub]( https://hub.docker.com/u/tugraph ) and can be downloaded and used directly.
+
+For the latest version of Docker address, see [Link](../../1.guide.md#TuGraph-Latest-Version).
+
+### 2.2.Naming Convention
+
+#### 2.2.1.TuGraph Compile Image
+
+Provides a compilation environment and can be used for TuGraph compilation.
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+For example: `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+Provides a binary executable environment with TuGraph library and executable files.
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example:`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example: `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.Common Docker Operations
+
+Docker is generated from Dockerfile. Note that creating images requires downloading dependencies, so network issues may cause slow creation or creation failure. Do not overwrite images unless the tag is `latest`.
+
+build Compile image
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+build Runtime / Mini Runtime image
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+Modify image name
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+push image
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+pull image
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+save image
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+load image
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+Refer to the [docker official documentation](https://docs.docker.com/engine/reference/commandline/cli ) for other Docker operations.
+
+### 2.4. M1 Supports
+
+Running amd64 containers on M1-chip machines may cause unknown errors. TuGraph provides arm64 images for M1 machines. Contains compile and runtime images.
+
+In `tugraph-runtime-centos7:3.6.0` and `tugraph-compile-centos7:1.2.7` and later, `tugraph-runtime-centos7` and `tugraph-compile-centos7` provide images of two architectures: linux/amd64 and linux/arm64/v8. You can obtain the arm64 architecture image through docker pull on the M1 machine.
+
+## 3. Best Practice in Using and Developing Docker Images for TuGraph-DB
+
+Please carefully read the points below and follow them if you are new to contribute to TuGraph.
+
+- To get rid of too much docker layer, please add your dependency to the Docker with the style writing ENV and RUN in a
+  single line.
+- For the packages/resources you need to build the dependency, use the original ones instead of tweaking them without
+  tracking by VCS. And then contact TuGraph team to upload it to OSS to accelerate the building process, as the urls you
+  see in the Dockerfiles.
+- To make the development more efficient, you would better start from adding dependencies to base TuGraph Compile Images
+  and then reproduce the process in the Dockerfile after confirming the enviroment works.
+- CI uses the docker images. Please check the dependency problems if your CI fails.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md
new file mode 100644
index 0000000000..eed64b83e7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# Local Package Deployment
+
+> This document describes TuGraph Local Package Deployment.
+
+## 1. Environment preparation
+
+TuGraph local package deployment requires a corresponding environment, and quick verification can use streamlined installation packages, which require almost no third-party libraries.
+
+If you need to use the complete TuGraph function, please refer to the tugraph-db source code directory ci/images/tugraph-runtime-*-Dockerfile. This script contains the complete environment construction process.
+
+## 2. Download the installation package
+
+For the latest version of the installation package address, see [Link](../../1.guide.md/#TuGraphLatest Version).
+
+You can also visit Github to download: [TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. Installation method under CentOS
+
+The .rpm installation package for TuGraph installed on CentOS, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.rpm installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+Users can also specify the installation directory by specifying the `--prefix` option.
+
+## 4. Installation method under Ubuntu
+
+A .deb installation package for TuGraph installed on Ubuntu, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.deb` installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+This command installs TuGraph in the `/usr/local` directory by default. Users can also change the installation directory by specifying the `--instdir=<directory>` option.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md
new file mode 100644
index 0000000000..9551dc6e32
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/5.cloud-deployment.md
@@ -0,0 +1,128 @@
+# Cloud Deployment
+
+> This document mainly introduces the cloud deployment of TuGraph, and you can also refer to the[Alibaba Cloud ComputeNest deployment document.](https://aliyun-computenest.github.io/quickstart-tugraph/)。
+
+## 1.Introduction
+
+TuGraph (tugraph.antgroup.com) is a high-performance graph database of Alibaba Group. TuGraph provides community version services on ComputeNest, so you can quickly deploy TuGraph services on ComputeNest and achieve operation and maintenance monitoring, thereby building your own graph application. This document introduces how to open TuGraph community version services on ComputeNest, as well as deployment process and usage instructions.
+
+## 2.Instance Description
+
+TuGraph is deployed as a community open source version, and the source code can be found in the Github Repo. Currently, the available instance specifications are as follows:
+
+| Instance Family | vCPU and Memory             | System Disk                | Public Bandwidth         |
+|-----------------|-----------------------------|----------------------------|--------------------------|
+| ecs.r7a.xlarge  | AMD Memory r7a, 4vCPU 32GiB | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+| ecs.r6.xlarge   | Memory r6, 4vCPU 32GiB      | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+
+Estimated costs can be seen in real time when creating instances (currently free). If you need more specifications or other services (such as cluster high availability requirements, enterprise-level support services, etc.), please contact us at tugraph@service.alipay.com.
+
+## 3.Deployment Process
+
+### 3.1.Preparation
+
+Before starting to use, you need an Alibaba Cloud account to access and create resources such as ECS and VPC.
+
+- If you use a personal account, you can directly create a service instance.
+- If you create a service instance using a RAM user and use Alibaba Cloud ComputeNest for the first time:
+    - Before creating a service instance, you need to add permissions for the corresponding resources to the account of the RAM user. For detailed operations on adding RAM permissions, please see Grant RAM user permissions. The required permissions are shown in the following table.
+    - Authorization to create associated roles is also required. Refer to the following figure and select Agree to authorize and create associated roles.
+
+| Permission Policy Name          | Remark                                                                       |
+|---------------------------------|------------------------------------------------------------------------------|
+| AliyunECSFullAccess             | Permissions for managing cloud server services (ECS)                         |
+| AliyunVPCFullAccess             | Permissions for managing Virtual Private Cloud (VPC)                         |
+| AliyunROSFullAccess             | Permissions for managing Resource Orchestration Service (ROS)                |
+| AliyunComputeNestUserFullAccess | Permissions for managing ComputeNest services (ComputeNest) on the user side |
+| AliyunCloudMonitorFullAccess    | Permissions for managing Alibaba Cloud Monitor (CloudMonitor)                |
+
+![Cloud Deployment](../../../../images/cloud-deployment-1.png)
+
+### 3.2.Deployment Entrance
+
+You can search in Alibaba Cloud ComputeNest, or quickly access it through the following deployment link.
+
+[Deployment Link](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.Apply for Trial Use
+
+Before formal trial use, you need to apply for trial use, fill in the information as prompted, and create the TuGraph service after passing the review.
+
+![Apply for Trial Use](../../../../images/cloud-deployment-2.png)
+
+### 3.4.Create TuGraph Service
+
+#### 3.4.1.Parameter List
+
+During the process of creating a service instance, you need to configure the parameter list of the service instance information. The specific parameters are as follows.
+
+| Parameter Group                              | Parameter Item  | Example                 | Description                                                                                                                            |
+|----------------------------------------------|-----------------|-------------------------|----------------------------------------------------------------------------------------------------------------------------------------|
+| Service Instance Name                        | N/A             | test                    | The name of the instance.                                                                                                              |
+| Region                                       | N/A             | China East 1 (Hangzhou) | Select the region of the service instance. It is recommended to select nearby regions to obtain better network latency.                |
+| Payment Type Configuration                   | Payment Type    | Pay-As-You-Go           | For free use, please select Pay-As-You-Go.                                                                                             |
+| Availability Zone Configuration              | Deployment Area | Availability ZoneI      | Different available zones under the region, ensure that the instance is not empty.                                                     |
+| Select Existing Basic Resource Configuration | VPC ID          | vpc-xxx                 | Select the ID of the Virtual Private Cloud according to the actual situation.                                                          |
+| Select Existing Basic Resource Configuration | Switch ID       | vsw-xxx                 | Select the Switch ID according to the actual situation. If the Switch ID cannot be found, try switching the region and available zone. |
+| ECS Instance Configuration                   | Instance Type   | ecs.r6.xlarge           | Currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications.                                                                    |
+|ECS Instance Configuration|	Instance Password|	**|	Set the instance password. Length of 8-30 characters, must include three items (uppercase letters, lowercase letters, numbers, special characters in ()`~!@#$%^&*_-+={}[]:;'<>,.?/).
+|
+
+#### 3.4.2.Specific Steps
+
+The creation of the service is carried out according to the following steps, refer to the figure below:
+
+- Create an instance name, such as "test" in the figure below
+- Select the region, such as "China East 1 (Hangzhou)" in the figure below
+
+![Create Instance](../../../../images/cloud-deployment-3.png)
+
+- Select the instance type, currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications. If there is no model available in the list, try selecting other deployment areas.
+- Select the model
+- Configure the password for the instance
+- Select the deployment area, such as "Availability Zone I" in the figure below
+
+![Select Region](../../../../images/cloud-deployment-4.png)
+
+- Click next to enter the order confirmation page
+- Check the checkboxes for "Permission Confirmation" and "Service Terms"
+- Click the green "Start Free Trial" button in the lower left corner to create a service instance
+
+![Confirmation](../../../../images/cloud-deployment-5.png)
+
+### 3.5.Start TuGraph Service
+
+- View the service instance: After the service instance is created successfully, it takes about 2 minutes for deployment. After the deployment is complete, you can see the corresponding service instance on the page, as shown in the figure below.
+
+![View Instance](../../../../images/cloud-deployment-6.png)
+
+- Click the service instance to access TuGraph. After entering the corresponding service instance, you can get 3 ways to
+  use it on the page: web, rpc, ssh. You can also see the password of user admin on the page.
+
+![Access Method](../../../../images/cloud-deployment-7.png)
+
+- Click the link of web to jump to the deployed TuGraph Web. It is recommended that novice users first use the demo to quickly get started with TuGraph.
+    - First, on the TuGraph Web login page, enter the default username (admin) and the password on the page to log in, as shown in the figure below.
+    - After the login is completed, click "New Instance" -> "Create Instance" in sequence, wait for the creation to be completed, and the steps in 3 will change to green in turn, and it will automatically switch to the subgraph MovieDemo1, as shown in the figure below.
+
+![Login](../../../../images/cloud-deployment-8.png)
+![Create Demo](../../../../images/cloud-deployment-9.png)
+
+## 4.Common FAQs
+
+### No available resources in the selected deployment area
+
+Sometimes, the selected deployment area (such as Availability Zone G) does not have available resources for the selected package, and an error will be reported as shown in the figure below.
+
+![Deployment Error](../../../../images/cloud-deployment-10.png)
+
+__Solution__:Try selecting other regions, such as Availability Zone I
+
+### Unaccessible to the web port
+
+It takes some time for the server to get ready. Just wait for a few seconds.
+
+
+### Username or password is not correct
+
+Please make sure that you are using the password on the page instead of the default one.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/index.rst
new file mode 100644
index 0000000000..9bf6be2bc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/1.installation/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Installation
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/1.compile.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/1.compile.md
new file mode 100644
index 0000000000..9bb46958c1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/1.compile.md
@@ -0,0 +1,31 @@
+# Compile
+
+> This document mainly describes how to compile TuGraph from source code.
+
+## 1.Prerequisites
+
+It is recommended to build TuGraph on a Linux system. Meanwhile, Docker is a good choice. If you want to set up a new environment, please refer to [Dockerfile](../1.installation/3.docker-deployment.md)。
+
+## 2.compile
+
+Here are steps to compile TuGraph:
+
+1. `deps/build_deps.sh` or to skip building web interface `SKIP_WEB=1 deps/build_deps.sh`
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If support shell lgraph_cypher, use `-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+4. If compiling on an arm machine (such as a Mac with M1 chip), add `-DENABLE_BUILD_ON_AARCH64=ON`
+5`make`
+6`make package` or `cpack --config CPackConfig.cmake`
+
+Example:
+`tugraph/tugraph-compile-centos7`Docker environment
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/2.tugraph-running.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/2.tugraph-running.md
new file mode 100644
index 0000000000..3b5e56a444
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/2.tugraph-running.md
@@ -0,0 +1,197 @@
+# Tugraph Running
+
+> This document describes the operation mode of the TuGraph service, starting, stopping, and restarting operations.And TuGraph's service configuration parameters, configuration file format, and command-line configuration parameters.
+
+## 1. Prerequisites
+TuGraph has the following prerequisites for its execution: a correct [installation of TuGraph](../1.installation/1.environment.md).
+
+TuGraph execution requires ensuring that the library file "liblgraph.so" is located in the environment variable LD_LIBRARY_PATH.
+
+The user running the TuGraph process does not need superuser privileges. However, they need read permissions for the configuration file (usually lgraph.json) and any files referenced within it. Additionally, they should have write permissions for data folders, log files, etc.
+
+## 2.The operation mode
+
+TuGraph can be started as a normal process in the foreground or as a daemon in the background.
+
+When running as a normal process, TuGraph can print logs directly to the terminal, which is handy when debugging server configurations. However, because the foreground process is terminated after the terminal exits, the user must ensure that the terminal remains open while the TuGraph server is running. In daemon mode, on the other hand, the TuGraph server can continue to run even if the terminal that started it exits. If TuGraph needs to run for a long time, it is recommended to start the TuGraph server in daemon mode.
+
+### 2.1.Running a normal process
+
+The 'lgraph_server -d run' command runs TuGraph as a normal process. Normal processes depend on the command line terminal, so when the terminal ends, the TuGraph process is automatically terminated. Normal process mode with '--log_dir ""' can output the process log directly to the terminal, so it is easier to debug.
+
+Start the command：
+
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+Example of running output in normal mode：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+In normal process mode, the user can prematurely terminate the TuGraph process by pressing 'CTRL+C'.
+
+### 2.2.Run process daemon mode
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+Example output from running in daemon mode:
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+## 3.Service operation
+
+### 3.1.Start the service
+
+TuGraph needs to be started using the 'lgraph_server -d start' command line. The following is an example of the command to start TuGraph:
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+### 3.2.Stop the service
+
+You can stop the TuGraph daemon using the 'kill' command and the 'lgraph_server -d stop' command. Since it is possible to run multiple TuGraph server processes on the same computer, we distinguish between the different server processes using the '.pid 'file, which is written to the working directory where the process was started. Therefore, you need to run the command 'lgraph_server-d stop' in the same working directory to stop the correct server process.
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.Restart the service
+
+Users can also restart the TuGraph service by 'lgraph_server -d restart' :
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.Service configuration
+
+The TuGraph server loads configurations from the configuration file and command line options at startup, and if different values are specified for the same option in the configuration file and command line, the value specified in the command line will be used preferentially.
+
+### 4.1.Configuration parameters
+
+The parameters and their types are described as follows:
+
+| **Parameter names**       | **<nobr>Type</nobr>** | **Instructions**                                                                                                                                                                                                                                                                                    |
+|---------------------------|-----------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                 | string                | Directory where data files are stored. If the directory does not exist, it is automatically created. The default directory is /var/lib/lgraph/data.                                                                                                                                                 |
+| durable                   | boolean               | Whether to enable real-time persistence. Turning off persistence can reduce the disk IO overhead when writing, but data may be lost in extreme cases such as machine power failure. The default value is `true`.                                                                                    |
+| host                      | string                | The IP address on which the REST server listens. The default address is 0.0.0.0.                                                                                                                                                                                                                    |
+| port                      | int                   | The Port on which the REST server listens. The default port is 7070.                                                                                                                                                                                                                                |
+| enable_rpc                | boolean               | Whether to use RPC services. The default value is 0.                                                                                                                                                                                                                                                |
+| rpc_port                  | int                   | Port used by RPC and HA services. The default port number is 9090.                                                                                                                                                                                                                                  |
+| enable_ha                 | boolean               | Whether to enable the HA mode. The default value is false.                                                                                                                                                                                                                                          |
+| ha_log_dir                | string                | HA log directory. The HA mode needs to be enabled. The default value is null.                                                                                                                                                                                                                       |
+| verbose                   | int                   | Detail level of log output information. The value can be 0,1,2. The larger the value, the more detailed the output information. The default value is 1.                                                                                                                                             |
+| log_dir                   | string                | Directory where log files are stored. The default directory is /var/log/lgraph/.                                                                                                                                                                                                                    |
+| ssl_auth                  | boolean               | Whether to use SSL authentication. When HTTPS is enabled, only the HTTPS service is enabled on the REST server. The default value is false.                                                                                                                                                         |
+| web                       | string                | The directory where the web files (including the visual part) are located. The default directory is/usr/local/share/lgraph/resource.                                                                                                                                                                |
+| server_cert               | string                | certificate file path used by the server when SSL authentication is enabled. The default path is/usr/local/etc/lgraph/server - cert.pem.                                                                                                                                                            |
+| server_key                | string                | The public key file used by the server when SSL authentication is enabled. The default directory is/usr/local/etc/lgraph/server - key.pem。                                                                                                                                                          |
+| enable_audit_log          | boolean               | Whether to enable audit logs. The default value is false.                                                                                                                                                                                                                                           |
+| audit_log_expire          | int                   | When audit logs are enabled, the validity period (hours) of audit logs is automatically cleared upon timeout. If the value is 0, the logs are not cleared. The default value is 0.                                                                                                                  |
+| audit_log_dir             | string                | Specifies the directory for storing log files when audit logs are enabled. The default directory is $directory/_audit_log_.                                                                                                                                                                         |
+| load_plugins              | boolean               | Import all stored procedures when starting the service. The default value is 1.                                                                                                                                                                                                                     |
+| optimistic_txn            | boolean               | Enable optimistic multithreaded write transactions for Cypher. The default is 0.                                                                                                                                                                                                                    |
+| disable_auth              | boolean               | Disable REST authentication. The default is 0.                                                                                                                                                                                                                                                      |
+| ha_snapshot_interval_s    | int                   | Snapshot interval (in seconds) The default value is 86400.                                                                                                                                                                                                                                          |
+| ha_heartbeat_interval_ms  | int                   | Heartbeat interval in milliseconds. The default value is 1000.                                                                                                                                                                                                                                      |
+| ha_node_offline_ms        | int                   | The heartbeat times out and the interval (in milliseconds) between nodes going offline. The default value is 60000.                                                                                                                                                                                 |
+| ha_node_remove_ms         | int                   | The interval (in milliseconds) at which a node is considered completely dead and removed from the list. The default value is 120000.                                                                                                                                                                |
+| enable_ip_check           | boolean               | Allow IP address whitelists. The default value is 0。                                                                                                                                                                                                                                                |
+| idle_seconds              | int                   | The maximum number of seconds a child process can be idle. The default value is 600.                                                                                                                                                                                                                |
+| enable_backup_log         | boolean               | Whether to enable backup logging. The default value is 0.                                                                                                                                                                                                                                           |
+| backup_log_dir            | string                | The directory where backup files are stored. The default value is null.                                                                                                                                                                                                                             |
+| snapshot_dir              | string                | Directory where snapshot files are stored. The default value is null.                                                                                                                                                                                                                               |
+| thread_limit              | int                   | The maximum number of threads that can be used simultaneously. The default value is 0, which means that no restriction is imposed. The license file prevails.                                                                                                                                       |
+| unlimited_token           | boolean               | Whether to set the link token to be infinite. The default value is 0 and the validity period is 24 hours.                                                                                                                                                                                           |
+| reset_admin_password            | boolean               | Whether to reset the password. The default value is 0. When the value is 1, the password will be reset to "73@TuGraph"。                                                                                                                                  |
+| enable_fulltext_index     | boolean               | Whether to enable the full-text index function, the default value is 0.                                                                                                                                                                                                                             |
+| fulltext_analyzer         | string                | Full-text index tokenizer type. Can be set to `StandardAnalyzer` or `SmartChineseAnalyzer`. Default is `StandardAnalyzer`                                                                                                                                                                           |
+| fulltext_commit_interval  | int                   | Full-text index data submission period, for write operations, in seconds. The default is 0, which commits immediately.                                                                                                                                                                              |
+| fulltext_refresh_interval | int                   | Full-text index data refresh cycle, for read operations, in seconds. The default is 0, and the latest written data can be read immediately.                                                                                                                                                         |
+| conf                      | string                | Initialize the HA cluster according to host1:port1,host2:port2,host3:port3, the default value is empty.                                                                                                                                                                                             |
+| ha_node_join_group_s      | int                   | The waiting time for a node to try to join the high availability cluster, in seconds, the default is 10.                                                                                                                                                                                            |
+| ha_bootstrap_role         | int                   | Whether to use bootstrap to start, and the server role to start using this method, 0 means not to use bootstrap to start, 1 means to use bootstrap to start and this node is a leader, 2 means to use bootstrap to start and this node is a follower, only these 3 options. The default value is 0. |
+| help                      | boolean               | Print the help message. The default value is 0.                                                                                                                                                                                                                                                     |
+
+### 4.2.Server configuration file
+
+TuGraph's configuration file is stored in JSON format. It is recommended that most configuration be stored in configuration files and that some configuration parameters be modified only temporarily using command-line options when needed.
+
+A typical configuration file looks like this:
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md
new file mode 100644
index 0000000000..444b948a88
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/3.high-availability-mode.md
@@ -0,0 +1,129 @@
+# High Availability mode
+
+> This document describes the principles, preparations, and server operations of the high availability mode
+
+## 1.Theory
+
+TuGraph provides high availability mode (HA mode) through multiple server hot backups. In high availability mode, writes are synchronized to all servers so that service availability is not affected even if some servers go down.
+
+In high availability mode, multiple TuGraph servers form a backup group. Each backup group consists of three or more TuGraph servers, one of which serves as the 'leader' and the other replication group servers serve as the 'follower'. Write requests are serviced by the 'leader' who replicates each request to the 'follower' and responds to the client only after the request has been synchronized to the server. This way, if any server fails, the other servers will still have all the data that has been written so far. If the 'leader' server fails, other servers will automatically select a new 'leader'.
+
+The high availability mode is only available in the enterprise edition. The open-source Community Edition does not include this feature.
+
+## 2.Preparation
+
+To enable high availability mode, users need to:
+
+- Three or more instances of TuGraph servers.
+- To enable high availability mode when starting lgraph_server, the 'enable_ha' option can be set to 'true' using a configuration file or the command line.
+- Set the correct rpc_port through the configuration file or command line
+
+## 3.Start the initial backup group
+
+### 3.1.The initial data is consistent
+
+When the data in all servers is the same or there is no data at startup, the user can
+specify `--conf host1:port1,host2:port2` to start the server.
+In this way, all prepared TuGraph instances can be added to the initial backup group at one time,
+All servers in the backup group elect `leader` according to the RAFT protocol, and other
+servers join the backup group with the role of `follower`.
+
+An example command to start an initial backup group is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+After the first server is started, it will elect itself as the 'leader' and organize a backup group with only itself.
+
+### 3.2.Inconsistent initial data
+If there is already data in the first server (imported by the `lgraph_import` tool or transferred from a server in non-high availability mode),
+And it has not been used in high-availability mode before, the user should use the boostrap method to start. Start the server with data in bootstrap
+mode with the `ha_bootstrap_role` parameter as 1, and specify the machine as the `leader` through the `conf`
+parameter. In bootstrap mode, the server will copy its own data to the new server before adding the newly
+joined server to the backup group, so that the data in each server is consistent.
+
+An example command to start a data server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 1
+```
+
+Other servers without data need to specify the `ha_bootstrap_role` parameter as 2, and specify the `leader` through the `conf` parameter. The command example is as follows
+
+```bash
+**$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 2
+```
+## 4.Scale out other servers
+
+After starting the initial backup group, if you want to scale out the backup group, add new servers to the backup group,
+The `--conf HOST:PORT` option should be used, where `HOST` can be the IP address of any server already in this backup group,
+And `PORT` is its RPC port. E.g:
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+
+This command will start a TuGraph server in high availability mode and try to add it to the backup group containing the server `172.22.224.15:9090`.
+Note that joining a backup group requires a server to synchronize its data with the backup group's `leader` server, and this process may take a considerable amount of time, depending on the size of the data.
+
+## 5.Stopping the Server
+
+When a server goes offline via 'CTRL-C', it will notify the current 'leader' server to remove the server from the backup group. If the leader server goes offline, it will pass the leader identity permission to another server before going offline.
+
+If a server is terminated or disconnected from other servers in the backup group, the server is considered a failed node and the leader server will remove it from the backup group after a specified time limit.
+
+If any server leaves the backup group and wishes to rejoin, it must start with the '--conf {HOST:PORT}' option, where 'HOST' is the IP address of a server in the current backup group.
+
+## 6.Restarting the Server
+
+Restarting the entire backup group is not recommended as it disrupts service. All servers can be shut down if desired. But on reboot,
+It must be ensured that at least N/2+1 servers in the backup group at shutdown can start normally, otherwise the startup will fail. and,
+Regardless of whether `enable_bootstrap` is specified as true when initially starting the replication group, restarting the server only needs to pass
+Specify the `--conf host1:port1,host2:port2` parameter to restart all servers at once. The command example is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 7.docker deploys a highly available cluster
+In real business scenarios, it is likely to encounter the need to deploy high-availability clusters on multiple operating systems or architectures.
+Differentiated environments may cause some dependencies to be missing when compiling TuGraph. therefore,
+Compiling software in docker and deploying high-availability clusters is very valuable. Take the centos7 version of docker as an example,
+The steps to deploy a highly available cluster are as follows.
+
+### 7.1.Install mirror
+Use the following command to download TuGraph's compiled docker image environment
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+Then pull the TuGraph source code and compile and install
+
+### 7.2.Create container
+Use the following command to create a container, use `--net=host` to make the container run in host mode, in this mode
+Docker and the host machine share the network namespace, that is, they share the same IP.
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 7.3.Start service
+Use the following command to start the service on each server, because docker and the host share IP, so you can directly specify to start the service on the host IP
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.Server Status
+
+The current status of the backup group can be obtained from the TuGraph visualization tool, REST API, and Cypher query.
+
+In the TuGraph visualization tool, you can find the list of servers and their roles in the backup group in the DBInfo section.
+
+With the REST API, you can use `GET /info/peers` to request information.
+
+In Cypher, the `CALL dbms.listServers()` statement is used to query the status information of the current backup group.
+
+## 9.Data synchronization in high availability mode
+
+In high availability mode, different servers in the same backup group may not always be in the same state. For performance reasons, if a request has been synchronized to more than half of the servers, the leader server will consider the request to be in the committed state. Although the rest of the servers will eventually receive the new request, the inconsistent state of the servers will persist for some time. A client may also send a request to a server that has just restarted, thus having an older state and waiting to join a backup group.
+
+To ensure that the client sees consistently continuous data, and in particular to get rid of the 'reverse time travel' problem, where the client reads a state older than it has seen before, each TuGraph server keeps a monotonically increasing data version number. The mapping of the data version number to the database state in the backup group is globally consistent, meaning that if two servers have the same data version number, they must have the same data. When responding to a request, the server includes its data version number in the response. Thus, the client can tell which version it has seen. The client can choose to send this data version number along with the request. Upon receiving a request with a data version number, the server compares the data version number to its current version and rejects the request if its own version is lower than the requested version. This mechanism ensures that the client never reads a state that is older than before.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/index.rst
new file mode 100644
index 0000000000..6d3b240af9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/2.running/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Running
+====================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/1.data-import.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/1.data-import.md
new file mode 100644
index 0000000000..1abf2aed21
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/1.data-import.md
@@ -0,0 +1,379 @@
+# Data Importing
+
+> This document describes the data import function of TuGraph. These include delimiters in CSV format, sample formats for jsonline, and two modes for importing online and offline.
+
+## 1. Introduction
+
+After the installation is successful, you can use the `lgraph_import` batch import tool to import existing data into TuGraph. `lgraph_import` supports importing data from CSV files and JSON data sources.
+
+> `sonline format, a row of a json array string`
+
+> CSV format
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline format
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph supports two data importing modes：
+
+- _offline_：Read the data and import it into a data file for the specified server, it should only be done when the server is offline.
+- _online_：Read the data and send it to the running server, which then imports the data into its database.
+
+## 2.CSV file format delimiter
+
+    CSV delimiters can be single-character or multi-character strings, which cannot contain 'r' or 'n'. Note that different shells handle input strings differently, so different escape handling may be required for different shell input parameters.
+
+In addition, 'lgraph_import' also supports the following escape characters for entering special symbols:
+
+| Escape character | Instructions                                                                                              |
+| ---------------- | --------------------------------------------------------------------------------------------------------- |
+| \\               | The backslash`\\`                                                                                         |
+| \\a              | ASCII code 0x07                                                                                           |
+| \\f              | form-feed，ASCII code 0x0c                                                                                |
+| \\t              | Horizontal tab characters， ASCII code 0x09                                                               |
+| \\v              | Vertical tab characters， ASCII code 0x0b                                                                 |
+| \\xnn            | Two hexadecimal digits representing one byte，example \\x9A                                               |
+| \\nnn            | A three-digit octal number representing a single byte，example \\001, \\443，data range cannot exceed 255 |
+
+Demo：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.The configuration file
+
+    `lgraph_import`tool configures the environment using the specified configuration file. The configuration file describes the paths to the input files, the vertices/edges they represent, and the vertex/edge format.
+
+### 3.1.Configuration File Format
+
+The configuration file consists of two parts: schema and files. The 'schema' part defines label, and the 'files' part describes the data files to be imported.
+
+#### 3.1.1.The keyword
+
+- schema (Array）
+  - label（required，string）
+  - type（required， VERTEX or EDGE）
+  - properties（Array，required for vertex，If there is no property for the edge, you can leave it unconfigured）
+    - name（required, string）
+    - type （required,，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（optional，Indicates that the field can be configured or not configured）
+    - index（optional，Whether the field needs to be indexed）
+    - unique（optional, whether the field indexed and is of type unique）
+    - pair_unique（optional, whether the field indexed and is of type pair_unique）only one unique and pair_unique can be set. Setting up and running at the same time will terminate due to an input exception
+  - primary (vertex-only configuration, specify a property that uniquely identifies a point in the primary key field)
+  - temproal (edge-only configuration, optional, specifies the timestamp field for storage tier sorting)
+  - temporal_field_order (edge-only configuration, optional, the default value is ASC, indicating the ascending order, or DESC, indicating the descending order)
+  - constraints (edge-only configuration, optional, array form, start and end labels, unconfigured or empty means unrestricted)
+  - detach_property (optional, both Edge and Vertex can config，default is `false`. `true` means the property data is stored in detached model, which can reduce io read amplification in cases with less memory and much property data.)
+- files （Array）
+  - path（required，string，The value can be a file path or a directory path. If it is a directory, all files in the directory will be imported. Ensure that they have the same schema）
+  - header（Optional, numeric, header in the first few lines of the file, or 0）
+  - format（required，JSON or CSV）
+  - label（required，string）
+  - columns（Array）
+    - SRC_ID (Special string，only on the edges,That means this column is the source data)
+    - DST_ID (A special string, only on the edges, indicates that this column is the destination data)
+    - SKIP   (A special string to skip this column of data)
+    - [property]
+  - SRC_ID (Edge-only configuration. The value is the start label)
+  - DST_ID (Edge-only configuration. The value is the destination point label)
+
+#### 3.1.2.length of index
+TuGraph has a limit on the length of the key, when we creating an index for a column with a long attribute, it will be truncated. If it is a unique index, it should be noted that the content retained after truncation is still unique. In addition, when iterating through the index, the obtained key is truncated and may not be as expected. The truncation length is different for different types of indexes.
+##### 3.1.2.1.unique索引
+The unique index is globally unique, and the maximum length of the key is 480 bytes. primary is a special unique index, so the maximum key length is also 480 bytes
+##### 3.1.2.2.pair_unique索引
+The pair_unique index is a unique index between two points. This type of index can only be created in the schema of the edge. This index follows the user-specified key with the vid of the source and destination vertex, each of vid is 5 bytes long. Therefore, the maximum length of key is 470 bytes.
+##### 3.1.2.3.非唯一索引
+A non-unique index is one in which neither unique nor pair_unique is set to 1. In the TuGraph implementation, a key of this type index may map to multiple values. In order to speed up lookup and writing, a user-specified key is followed by the maximum value in a set of vids or euids. When a non-unique index created in a vertex schema, key is followed by vid, each vid is 5 bytes long, so the maximum length is 475 bytes. When a non-unique index created in a edge schema, key is followed by euid, each euid is 24 bytes long, so the maximum length is 456 bytes.
+
+### 3.2.Example Configuration File
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+For the above Example Configuration File, three labels defined: two point types' actor 'and' movie ', and one edge type 'role'. Each label describes: the name of the label, the type (dot or edge), which attribute fields are available, and the type of each field. For points, the primary field also defined; For edges, the constraints field also defined, which limits the starting and ending points of the edges.
+
+It also describes three data files, two dot data files' actors.csv 'and' movies.csv ', and one edge data file 'roles.csv'. Each section describes the path of the file, the format of the data, the first few lines of the header, the label of the data, and the corresponding field of each column in each row of data in the file.
+
+For the above configuration files, the import tool will first create labels' actor ', 'movie', and 'role' in TuGraph, and then perform data import of the three files.
+
+## 4.Offline full import
+
+The offline mode can be used only on offline servers. An offline import creates a new graph, so it's more suitable for your first data import on a newly installed TuGraph server.
+
+To use the 'lgraph_import' tool in offline mode, you can specify the 'lgraph_import --online false' option. To see the command-line options available, use 'lgraph_import --online false --help' :
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+Command line arguments:
+
+- **-c, --config_file** `config_file`: Import the configuration file name in the following format:
+- **--log** `log_dir`: Log directory. The default is an empty string, in which case the log information output to the console.
+- **--verbose** `0/1/2`: Log level. The higher the log level, the more detailed the output information is. The default value is 1.
+- **-i, --continue_on_error** `true/false`: If an error occurs, skip the error and continue. The default is false. If an error occurs, exit.
+- **-d, --dir** `{diretory}`:The database directory to which the import tool will write data. Default is'./db '.
+- **--delimiter** `{delimiter}`: Data file separator. This is used only when the data source is in CSV format. The default is', '。
+- **-u, --username** `{user}`: Username of the database. You need to be an administrator to perform offline import.
+- **-p, --password** `{password}`: Specifies the password of the database user
+- **--overwrite** `true/false`: Whether to overwrite data. When set to true, the data directory overwritten if it already exists. Default to 'false'.
+- **-g, --graph** `{graph_name}`: Specify the kind of graph to import.
+- **-h, --help**: The help information displayed.
+
+### 4.1.Offline Import Example
+
+    In this example, we use the movie-actor data described above to demonstrate the use of the import tool. The data to be imported is divided into three files: 'movies.csv', 'actors.csv', and 'roles.csv'.
+
+'movies.csv' contains information about movies, where each movie has an id (as a primary key for retrieval), and each movie also has attributes such as title, year, and rating. (Data from [IMDb](http://www.imdb.com)).
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+> The jsonline format is as follows:
+> All fields can be strings, which will be converted to the corresponding type when imported
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`It contains information about the actors. Each actor also has an id, as well as properties such as name.
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`It contains information about which role an actor played in which movie. Each row records a character played by a given actor in a given movie, corresponding to an edge in the database.`SRC_ID` and `DST_ID` are the source and target vertices of the edge, which are the 'primary' properties defined in 'actors.csv' and 'movies.csv', respectively.
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+'configuration file import.conf', notice that there are two HEADER lines in each file, so we need to specify the 'HEADER=2' option.
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+Using the import configuration file, we can now import data using the following command:
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # Read configuration information from import.conf
+        --dir /data/lgraph_db      # Store the data in /data/lgraph_db
+        --graph mygraph            # Import the graph named mygraph
+```
+
+**Notice**：
+
+- If a graph named 'mygraph' already exists, the import tool will print an error message and exit. To force a graph to be overwritten, use the '--overwrite true' option.
+- Configuration and data files must be stored in UTF-8 encoding (or normal ASCII encoding, which is a subset of UTF-8). If any file uses an encoding other than UTF-8 (for example, UTF-8 with BOM or GBK), the import will fail and output a profiler error.
+
+## 5.Online incremental Import
+
+    The online import mode can be used to import a batch of files into an already running instance of TuGraph. This is handy for processing incremental batch updates that typically occur at fixed intervals. The 'lgraph_import --online true' option enables the import tool to work in online mode. Like offline mode, online mode has its own set of command-line options, which can be printed using the '-h, --help' options:
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+The configuration related to the file specified in the configuration file, and its format is exactly the same as' offline mode '. However, instead of importing the data into a local database, we are now sending the data to a running TuGraph instance, which is typically running on a different computer than the client machine on which the import tool is running. Therefore, we need to specify the URL, DB user, and password for the HTTP address of the remote machine.
+
+If the user and password are valid, and the specified graph exists, the import tool sends the data to the server, which then parses the data and writes it to the specified graph. The data will be sent in a packet of about 16 MB, interrupted at the nearest newline. Each package imported atomically, which means that if the package is successfully imported, all data is successfully imported; otherwise, none of the data enters the database. If '--continue_on_error true' is specified, data integrity errors are ignored and offending lines are ignored. Otherwise, the import stops at the first error package and prints out the number of packages that have been imported. In this case, the user can modify the data to eliminate errors, and then use '--skip_packages N' to redo the import to skip the imported packages.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/2.data-export.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/2.data-export.md
new file mode 100644
index 0000000000..b1ad57de6f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# Data Export
+
+> This document mainly introduces the data export function of TuGraph.
+
+## 1.Introduction
+
+TuGraph can use the tool `lgraph_export` to export data from the database that has been imported successfully. The 'lgraph_export' tool can export the data of the specified TuGraph database to the specified directory in the form of 'csv' or 'json' file, and export the configuration file 'import.config'. That required for re-importing the data.
+
+## 2.Data Export
+
+The following is an example of a command for the tool:
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+Details:
+
+- `-d {database_dir}` specifies the directory of the database from which the data will be exported. The default value is./testdb '.
+- `-e {export_destination_dir}` specifies the directory where the export file is stored. The default value is./exportdir.
+- `-g {graph_to_use}` specifies the type of graph database. default is' default '.
+- `-u {username}` Specifies the name of the user who performs the export operation.
+- `-p {password}` Specifies the password of the user who performs the export operation.
+- `-s {field_separator}` specifies the separator for the exported file. The default is comma.
+- `-f {output_format}` specifies the format of the exported data. It can be 'json' or 'csv'.
+- `-h` In addition to the specified parameters, you can also use this parameter to view the help of the tool.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..fa1839724b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
@@ -0,0 +1,32 @@
+# Backup and Restore
+
+> This document mainly introduces the data backup and restore function of TuGraph.
+
+## 1.Data Backup
+
+TuGraph can use the 'lgraph_backup' tool to backup data.
+The 'lgraph_backup' tool can backup data from a TuGraph database to another directory. It can be used as follows:
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+Details:
+
+- `-s {source_dir}` specifies the directory where the database (source database) to be backed up resides.
+- `-d {destination_dir}` specifies the directory where the backup file (destination database) is stored.
+  If the target database is not empty, 'lgraph_backup' prompts you whether to overwrite the database.
+- `-c {true/false}` indicates whether a compaction occurs during backup.
+  Every compaction creates a tighter backup, but every compaction takes longer to create. This option defaults to 'true'.
+
+## 2.Data Restore
+
+The target database `{destination_dir}` obtained using the `lgraph_backup` tool backs up all subgraphs of the source database `{source_dir}`, but does not include the raft information of the HA cluster, thereby ensuring that the service and cluster can be successfully restarted with the backup database and the data is consistent with the source database. The following command can be used to restart the service with the backup database. When the service starts, the storage process of all subgraphs will be restored to ensure that the backup service is completely consistent with the original service.
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+Details
+
+- `-d {destination_dir}` Specify the directory where the backup file (target database) is located.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md
new file mode 100644
index 0000000000..6782a43d0e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# Data Warmup
+
+> This document mainly introduces the data Warmup function of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a disk-based database where data loaded into memory only when accessed. Therefore, for a period of time after the server just turned on, the system performance may be degraded due to frequent IO operations. At this point, we can improve this problem by data warm-up.
+
+## 2.lgraph_warmup
+
+Data warmup can be done using the tool lgraph_warmup. An example of its use is as follows:
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+Details:
+
+The - '-d {db_dir}' option specifies the data directory for the TuGraph server
+
+The - '-g {graph_list}' option specifies the names of graphs to be warmed-up, separated by commas
+
+The warm-up process takes different times depending on the data size and the type of disk being used. Preheating a large database on a mechanical disk may take a long time. Please wait patiently.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/index.rst
new file mode 100644
index 0000000000..d2d7ed7240
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/3.server-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Server Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/1.python-client.md
new file mode 100644
index 0000000000..8ebe10da56
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/1.python-client.md
@@ -0,0 +1,222 @@
+# TuGraph Python SDK
+
+> This document is the usage instruction of TuGraph Python SDK
+
+## 1.Overview
+There are two kinds of Python's TuGraph Client. One is the RESTful Client, which uses the HTTP method to send requests to the server. The other is the RPC Client, which uses the RPC method to call the server remote service. Both have their own advantages and disadvantages. The RESTful client is simple to use. You can find the source code file of the Client in the src/client/python/TuGraphClient directory of the project. You can install it directly into the user environment and use it. However, it supports fewer functions and its performance is not high. RPC Client supports both stand-alone servers and high-availability clusters and load balancing. It has many interfaces and powerful functions. However, the usage is more complicated. Users need to compile the TuGraph project themselves to obtain liblgraph_client_python.so, or directly find the dependent library in the /usr/local/lib64 directory when using the runtime image, and introduce it into the python project for normal use. Next, the usage of these two Clients will be introduced in detail.
+
+## 2.RESTful Client
+
+### 2.1. Install Client
+
+TuGraph's Python RESTful client uses the setuptools tool for packaging and distribution. Users can install the client directly into the local environment and introduce it directly when using it.
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+Note: When using the setuptools tool to install the python client, dependencies such as httpx will be installed and need to be executed in an environment with external network access.
+
+### 2.2.Call cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.Call stored procedure
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python's TuGraph Rpc Client is a CPP Client SDK packaged using pybind11. The following table lists the correspondence between Python and CPP Client SDK.
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+The use of Python RPC Client is more complicated. Users can compile TuGraph in the local environment to get liblgraph_client_python.so, or they can use the official runtime image. The dependent library can be found directly in the /usr/local/lib64 directory in the image. It can be used after introducing the user project.
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.Instantiate the client object
+
+#### 3.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+
+#### 3.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 3.2.Call cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.3.Send cypher request to leader
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.4.Call GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.5.Send GQL request to leader
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.6.Calling stored procedures
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.7.Call the stored procedure to the leader
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 3.8.Load stored procedure
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 3.9.List stored procedures
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.10.Delete stored procedures
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 3.11.Import schema from byte stream
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.12.Import edge data from byte stream
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 3.13.Import schema from file
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.14.Import point and edge data from file
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..260a8c6c29
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/2.cpp-client.md
@@ -0,0 +1,339 @@
+# TuGraph C++ SDK
+
+> This document is the usage instruction of TuGraph C++ SDK
+
+## 1.Instructions
+
+C++ Client can use RPC to connect to lgraph_server to import data, execute stored procedures, call Cypher and other operations.
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+#### 2.1.1. Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2. Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3. Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.3. Send cypher request to leader
+```C++
+     std::string str;
+     bool ret = client.CallCypherToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0);
+     @param [out] result The result.
+     @param [in] cypher inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```C++
+     std::string str;
+     bool ret = client.CallGql(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGql(std::string& result, const std::string& gql,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0, const std::string& url = "");
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @param [in] url (Optional) Node address of calling gql.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.5. Send GQL request to leader
+```C++
+     std::string str;
+     bool ret = client.CallGqlToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGqlToLeader(std::string& result, const std::string& gql,
+                  const std::string& graph = "default", bool json_format = true,
+                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```C++
+     std::string str;
+     bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedure(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true,
+                        const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] url (Optional) Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```C++
+     std::string str;
+     bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true);
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+
+### 2.8. Load stored procedure
+```C++
+     std::string str;
+     bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+     bool LoadProcedure(std::string& result, const std::string& source_file,
+                        const std::string& procedure_type, const std::string& procedure_name,
+                        const std::string& code_type, const std::string& procedure_description,
+                        bool read_only, const std::string& version = "v1",
+                        const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] source_file the source_file contain procedure code.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] code_type code type, currently supported PY, SO, CPP, ZIP.
+     @param [in] procedure_description procedure description.
+     @param [in] read_only procedure is read only or not.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```C++
+     std::string str;
+     bool ret = client.ListProcedures(str);
+```
+```
+     bool ListProcedures(std::string& result, const std::string& procedure_type,
+                         const std::string& version = "any",
+                         const std::string& graph = "default", const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type (Optional) the procedure type, "" for all procedures,
+                                  CPP and PY for special type.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] url Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, the request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```C++
+     std::string str;
+     bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+     bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                          const std::string& procedure_name, const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```C++
+     std::string str;
+     bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+     bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                  const std::string& graph = "default", bool json_format = true,
+                                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema the schema to be imported.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```C++
+     std::string str;
+     ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+     bool ImportDataFromContent(std::string& result, const std::string& desc,
+                                const std::string& data, const std::string& delimiter,
+                                bool continue_on_error = false, int thread_nums = 8,
+                                const std::string& graph = "default", bool json_format = true,
+                                double timeout = 0);
+     @param [out] result The result.
+     @param [in] desc data format description.
+     @param [in] data the data to be imported.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+     bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema_file the schema_file contain schema.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+     bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                             const std::string& delimiter, bool continue_on_error = false,
+                             int thread_nums = 8, int skip_packages = 0,
+                             const std::string& graph = "default", bool json_format = true,
+                             double timeout = 0);
+     @param [out] result The result.
+     @param [in] conf_file data file contains format description and data.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] skip_packages (Optional) skip packages number.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/3.java-client.md
new file mode 100644
index 0000000000..8677a59265
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/3.java-client.md
@@ -0,0 +1,277 @@
+# TuGraph Java SDK
+
+## 1.Compile java client code
+
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies
+```java
+import com.alipay.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.3. Send cypher request to leader
+```java
+     String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param cypher: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```java
+     String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @param url: (Optional) Node address of calling GQL
+     @return: the result of GQL query execution
+     public String callGql(String gql, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.5. Send GQL request to leader
+```java
+     String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```java
+     String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @param url: (Optional) Node address of calling procedure
+     @return: the result of procedure execution
+     public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph, String url)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```java
+     String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedureToLeader : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @return: the result of procedure execution
+     public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 2.8. Load stored procedure
+```java
+     boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param sourceFile: the source_file contains procedure code
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param codeType: code type, currently supported PY, SO, CPP, ZIP
+     @param procedureDescription: procedure description
+     @param readOnly: procedure is read only or not
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                               String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```java
+     String result = client.listProcedures("CPP", "any", "default");
+     log.info("listProcedures : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @param url: (Optional) Node address of listing procedure
+     @return: the list of procedures
+     public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```java
+     String result = client.deleteProcedure("CPP", "sortstr", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```java
+     boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+     log.info("importSchemaFromContent : " + ret);
+```
+```
+     @param schema: the schema to be imported
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```java
+     boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+     log.info("importDataFromContent : " + ret);
+```
+```
+     @param desc: data format description
+     @param data: the data to be imported
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+             int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```java
+     boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+     log.info("importSchemaFromFile : " + ret);
+```
+```
+     @param schemaFile: the schema_file contains schema
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromFile(String schemaFile, String graph, double timeout)
+             throws UnsupportedEncodingException, IOException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```java
+     boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+     log.info("importDataFromFile : " + ret);
+```
+```
+     @param confFile: data file contains format description and data
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param skipPackages: skip packages number
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+             int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..1a778b73ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,176 @@
+# TuGraph-OGM
+
+@TODO
+
+## 1.Introduction
+
+> TuGraph-OGM project is open source on other repositories.
+
+TuGraph-OGM (Object Graph Mapping) is a graph object mapping tool designed for TuGraph. It supports the mapping of Java objects (POJO) into TuGraph. The classes in Java are mapped to nodes in the graph, the collections in the classes are mapped to edges, and the properties of the classes are mapped to the attributes of the graph objects. It also provides corresponding functions to manipulate the graph database. Therefore, Java developers can easily use TuGraph database in the familiar ecosystem. TuGraph-OGM is also compatible with Neo4j-OGM. Neo4j ecosystem users can migrate seamlessly to TuGraph database.
+
+### 1.1.Functions of TuGraph-OGM
+
+TuGraph-OGM provides the following functions for operating TuGraph:
+
+| Function                            | Usage                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| Insert single vertex/edge                 | void session.save(T object)                                                      |
+| Batch insert vertexs/edges                 | void session.save(T object)                                                      |
+| Delete vertex and its corresponding edges                | void session.delete(T object)                                                    |
+| Delete all vertexs with specific label       | void session.deleteAll(Class\<T> type)                                           |
+| Clear the database                      | void purgeDatabase()                                                             |
+| Update vertex                        | void session.save(T newObject)                                                   |
+| Query single node by id            | T load(Class<T> type, ID id)                                                     |
+| Query multiple nodes by ids           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| Query all nodes with specific label         | Collection\<T> loadAll(Class\<T> type)                                           |
+| Query with conditions                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher query (specify the return type) | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher query                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.Compile TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.Use TuGraph-OGM
+
+Please refer to the detailed examples in TuGraphOGMDemo under the demo folder.How to import dependencies in `pom.xml`.
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // create Movie vertex
+    @Id
+    private Long id;      // Movie id
+    private String title; // title attribute
+    private int released; // released attribute
+
+    // create Edge ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // create Actor vertex
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// configuration
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//Start driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// Open session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.Perform CRUD operations through OGM
+
+```java
+// new
+Movie jokes = new Movie("Jokes", 1990);  // Create Movie-vertex "jokes"
+session.save(jokes);                     // Store "jokes" in TuGraph
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // Connect the "speed" vertex with the "alice" vertex through the ACTS_IN relationship
+session.save(speed);                    // Store two vertexs and one edge
+
+// delete
+session.delete(alice);                  // Delete the "alice" vertex and its connected edge
+Movie m = session.load(Movie.class, jokes.getId());   // Get the "jokes" vertex based on its id
+session.delete(m);                                    // Delete the "jokes" node
+
+// update
+speed.setReleased(2018);
+session.save(speed);                   // Update the "speed" attribute
+
+// get
+Collection<Movie> movies = session.loadAll(Movie.class);  // Get all Movie vertexs
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // Query all movies released before 1995
+
+// Call Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // Query the Movie with "Speed" of 2018
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // Create vertex label "Director"
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // Create edge label "DIRECT"
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // Get the create result
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // View the number of vertexs created
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //View the number of edges created
+
+// Clear the database
+session.deleteAll(Movie.class);        // Delete all Movie vertexs
+session.purgeDatabase();               // Delete all data
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
new file mode 100644
index 0000000000..dd74d08869
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
@@ -0,0 +1,145 @@
+# Tugraph CLI
+
+> This document mainly introduces the CLI tool lgraph_cypher of TuGraph.
+
+## 1.Instructions
+
+The TuGraph release comes with a query client named 'lgraph_cypher' that can be used to submit OpenCypher requests to the TuGraph server. The 'lgraph_cypher' client has two execution modes: single command mode and interactive mode.
+
+## Single command mode
+
+In single-command mode, 'lgraph_cypher' can be used to submit a single Cypher query and print the result directly to the terminal. The printed result can also be easily redirected to a specified file. This is handy when users need to get a lot of results from the server and save them in files.
+
+In this mode, the 'lgraph_cypher' tool has the following options:
+
+### Command line Parameters:
+
+| Parameter | Type   | Instructions                                                                                                                                                                                                                           |
+| --------- | ------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| --help    | \\     | List all parameters and descriptions.                                                                                                                                                                                                  |
+| -example  | \\     | List the command instances.                                                                                                                                                                                                            |
+| -c        | string | A database configuration file used to obtain ip and port information.                                                                                                                                                                  |
+| -h        | string | Database server IP address. Omit this parameter if you have a configuration file. The default value is' 127.0.0.1 '                                                                                               |
+| -p        | string | Database server port. Omit this parameter if you have a configuration file. The default value is 7071                                                                                                                                  |
+| -u        | string | User name for logging in to the database.                                                                                                                                                                                              |
+| -P        | string | Password for logging in to the database.                                                                                                                                                                                               |
+| -f        | string | Contains the path to a single Cypher query single text file.                                                                                                                                                                           |
+| -s        | string | Single-line cypher query command. Start and end with `"`.                                                                                                                                                                              |
+| -t        | int    | Specifies the server timeout threshold for cypher queries. The default value is 150 seconds.                                                                                                                                           |
+| -format   | string | Query result display mode. Supports two formats: 'plain' and 'table'. The 'plain' format prints the query results in a single column. The 'table' format displays the query results in a tabular format. The default value is' table ' |
+
+### Examples:
+
+**cypher command file query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+
+```
+
+**cypher command single-sentence query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+
+```
+
+## Interactive mode
+
+'lgraph_cypher' can also be run in interactive mode. In interactive mode, the client stays connected to the server and interacts with the user in read-evaluate-print-loop.
+
+### Enter lgraph_cypher interaction mode:
+
+If no '-f' or '-s' command line option added, 'lgraph_cypher' will enter interactive mode when running. how to use it:
+
+```
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+
+```
+
+If the login is successful, the corresponding login success message will be displayed:
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2018 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+Now we also provide an interactive shell for users to enter Cypher queries or use the ':help' command to check for available commands.
+
+### Command Description
+
+In addition to the Cypher query, the shell of 'lgraph_cypher' accepts the following commands:
+
+| Command                  | Parameters                                         | instructions                                                                                                                                              |
+| ------------------------ | -------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                                 | Displays the server information and the corresponding description of all commands.                                                                        |
+| :db_info                 | \\                                                 | Query the current server status. /db/info for the corresponding REST API.                                                                                 |
+| :clear                   | \\                                                 | Clear the screen.                                                                                                                                         |
+| :use                     | {Graph Name}                                       | The graph specified with this name defaults to `default`                                                                                                  |
+| :source                  | `-t {Query the timeout value} -f {The query file}` | cypher command file query in interactive mode. The default timeout threshold is 150 seconds. Query file format reference No interactive query parameters. |
+| :exit                    | \\                                                 | Exit interactive mode and return to the original command line.                                                                                            |
+| :format                  | `plain` or `table`                                 | Change the display mode of cypher query results. Support 'plain' and 'table' modes.                                                                       |
+| :save all/command/result | `-f {The file path}` `{Cypher}`                    | The cypher command (command), query result (result) or both (all) are stored. The default location is' /saved_cypher.txt '                                |
+
+**Note:**
+
+- Each command should start with a colon `:`.
+
+**:save command example :**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+
+```
+
+### cypher query command:
+
+In interactive mode, users can also directly input a single sentence cypher command for query, with "'; ` "end. Enter commands that are case insensitive. Here's an example:
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher` supports multi-line input when typing commands. Users can use the `ENTER` key to type long query statements into multiple lines. In the case of multi-line input, the beginning of the command line will change from `>` to `=>`, and the user can continue to type the rest of the query.
+
+Example:
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### Auxiliary Features:
+
+**Input History:** Press the up and down arrow keys in interactive mode to display the input history.
+
+**Auto Completion:** lgraph_cypher will automatically complete based on the input history. In the event of a completion prompt, pressing the right arrow key will automatically complete the command.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/6.bolt-client.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/6.bolt-client.md
new file mode 100644
index 0000000000..438c3c9313
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/6.bolt-client.md
@@ -0,0 +1,17 @@
+# Bolt client
+
+TuGraph implements Neo4j's bolt protocol, you can use Neo4j's client to access TuGraph.
+
+## Enable bolt port
+
+If you are using the TuGraph runtime docker image, the config file is `/usr/local/etc/lgraph.json`.
+
+Add `bolt_port=7687` (modify the port) to TuGraph's config file to enable the bolt port, Neo4j clients should connect to the bolt port.
+
+## Limitations on use
+
+TuGraph does not implement all the features of neo4j bolt protocol.
+
+Streaming read and explicit transactions are currently not supported and need to avoid using these features.
+
+There are some examples for reference under `demos/Bolt` in the code repository.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/7.bolt-console-client.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/7.bolt-console-client.md
new file mode 100644
index 0000000000..9514609e1b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/7.bolt-console-client.md
@@ -0,0 +1,87 @@
+# TuGraph console client
+
+`lgraph_cli` is a console client based on the bolt protocol, written in c++, which requires a connection to tugraph's bolt port.
+
+`lgraph_cypher` is a console client based on http, written in python, which requires a connection to tugraph's http port.
+
+`lgraph_cypher` needs some python libraries to be installed.
+
+`lgraph_cli` is a binary executable file that has no dependencies on other dynamic libraries and can be executed by copying it to a linux server.
+
+## `lgraph_cli`
+
+The statement ends with a semicolon, type `exit`, `quit` or Ctrl-C to exit the client.
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+The statement can be inputed on more than one line.
+
+```
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+non-interactive
+
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+read statements from file
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/index.rst
new file mode 100644
index 0000000000..f9acd8d9e1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/4.client-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Client Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
new file mode 100644
index 0000000000..6695299a7d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
@@ -0,0 +1,1019 @@
+# Monitoring
+
+> This document mainly introduces the visualization operation and maintenance monitoring of TuGraph.
+
+## 1.Design Concept
+
+Visualization monitoring is not an indispensable part of TuGraph itself. Therefore, in the design, visualization monitoring is regarded as an application in the peripheral ecology of TuGraph to reduce the coupling with TuGraph database and its own impact. TuGraph visualization monitoring adopts the hottest open source solution - TuGraph Monitor + Prometheus + Grafana. Wherein, TuGraph Monitor is the client of TuGraph service, which initiates Procedure requests to TuGraph service through TCP connection. After receiving the request, TuGraph service collects statistics of CPU, memory, disk, IO, and number of requests on its own machine and responds. TuGraph Monitor packages the index data received from TuGraph into the format required by Prometheus and saves it in memory, waiting for Prometheus to obtain it through HTTP request. Prometheus regularly obtains packaged request data from TuGraph Monitor through HTTP requests and saves it in its own time-series database according to the time obtained. Grafana can obtain the statistical data within a certain time period from Prometheus according to user configuration and draw easy-to-understand graphics on the web interface to display the final result. In the entire request chain, the active acquisition, i.e. pull model, is used, which has the advantages of minimizing the coupling between data producers and data consumers, making development simpler, and not requiring data producers to consider the data processing capability of data consumers. Even if the data processing ability of a consumer is weak, it will not be crushed by the data producer producing data too fast. One of the shortcomings of the active pulling model is that the real-time performance of the data is insufficient. However, in this scenario, data does not have high real-time requirements.
+
+### 1.1.TuGraph
+
+TuGraph database provides the ability to collect multiple data information, such as disk, memory, network IO, and query requests, in the service machine, and provides queries through standard Procedure methods. This action of collecting data only occurs when a user queries through the interface, avoiding the impact of TuGraph monitoring service on user business query requests when users do not need the indicators on TuGraph monitoring service machine.
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor is a tool in the peripheral ecology of TuGraph. It communicates with TuGraph through C++ RPC Client as one of the many users of TuGraph and queries the performance indicators of the machine where TuGraph service is located through the Procedure query interface. It packages the results returned by TuGraph into the data model required by Prometheus and waits for Prometheus to obtain them. Users can set the query time interval to minimize the impact of obtaining monitoring indicators on business queries.
+
+### 1.3.Prometheus
+
+Prometheus is an open-source monitoring platform with a dedicated time-series database. It regularly obtains statistical indicators from the TuGraph Monitor service through HTTP requests and saves them in its own time-series database. For details, please refer to the official website:[https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana is an open-source visualization and analysis software. It can obtain data from multiple data sources, including Prometheus, and can convert data in the time-series database into tools for beautiful graphics and visual effects. For specific information, please refer to the official website:[https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.Deployment Solution
+
+### 2.1.Step 1
+
+Start the TuGraph service. For details, please refer to the documentation:[https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.Step 2
+
+Start the TuGraph Monitor tool. The startup command is as follows:
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+The meanings of the parameters are as follows:
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.Step Three
+
++ Download the Prometheus tarball that matches your machine architecture and system version. Download link:[https://prometheus.io/download/](https://prometheus.io/download/)
+
++ Unzip the tarball with the following command:
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ Modify the configuration file prometheus.yml and add the following configuration to enable Prometheus to scrape performance data packaged by TuGraph Monitor.
+
+```
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ Start Prometheus. You can obtain specific startup parameters with the following command:
+
+```shell
+./prometheus -h
+```
+
++ Verify if the Prometheus service is running properly by logging into the Prometheus service through the web portal, and querying whether the monitoring index resources_report has been obtained. If the data can be successfully queried, the operation is successful.
+
+### 2.4.Step Four
+
++ Download the Grafana installation package that matches your machine architecture and system version. Download link:[https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ Install Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Start Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Configure Grafana. First, configure the IP address of Prometheus in the data source settings. After the configuration is completed, verify if the data source is connected successfully by testing the connection function. Then, import the following template and modify the correct interface IP and port in the page according to the actual situation. Finally, set the refresh time and monitoring time range according to the actual situation.
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana",
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{label_name}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "memory",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \n  QPS exceeds 1000",
+        "name": "Request statistics alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "Request statistics",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "disk",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \nCPU usage rate exceeds 90%",
+        "name": "CPU usage rate alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU usage rate",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] Disk IO exceeds 10MB/S",
+        "name": "Disk IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph Monitoring Web",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+Verify the effect by refreshing the browser page. If the pie chart and line chart are displayed correctly, the configuration is completed.
+
+## 3.Future Plans
+
+Currently, visual monitoring only supports single-machine monitoring and can monitor performance indicators such as CPU, disk, network IO, and request QPS of the machine on which the service is located. In the future, monitoring for HA clusters will be implemented, and more meaningful indicators will be included in the monitoring scope.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
new file mode 100644
index 0000000000..a9c069a34a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
@@ -0,0 +1,439 @@
+# TuGraph DataX
+
+> This document mainly introduces the installation, compilation and usage examples of TuGraph DataX
+
+## 1.Introduction
+
+On the basis of Ali's open source DataX, TuGraph implements the support of writing plug-ins and jsonline data format, and other data sources can write data into TuGraph through DataX.
+DataX introduces reference [https://github.com/alibaba/DataX] (https://github.com/alibaba/DataX)
+Supported features include:
+
+- Import TuGraph from various heterogeneous data sources such as MySQL, SQL Server,Oracle, PostgreSQL, HDFS, Hive, HBase, OTS, ODPS, Kafka and so on. 
+  
+- Import TuGraph to the corresponding target source (to be developed)
+
+## 2.Compile and Install
+
+```bash
+git clone git@code.alipay.com:fma/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+The compiled DataX file is in the target directory
+
+## 3.Text data imported into TuGraph with DataX
+
+Using the data from the lgraph_import section of the TuGraph manual as an example, we have three csv data files, as follows:
+`actors.csv`
+
+```
+
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+
+```
+
+`movies.csv`
+
+```
+
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+
+```
+
+`roles.csv`
+
+```
+
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+
+```
+
+Then create three DataX job profiles:
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`/lgraph_server -c lgraph_standalone.json -d 'run'` 'Start TuGraph and run the following commands in sequence:
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## MySQL's data imported into TuGraph with DataX
+
+We create the following table of movies under 'test' database
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+Insert some data into the table
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+Create a DataX job configuration file
+
+`job_mysql_to_tugraph.json`
+
+**Configuring Field**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**Write simple sql**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` Start TuGraph and run the following command：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
new file mode 100644
index 0000000000..46afb76206
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph Explorer
+
+> TuGraph Explorer has merged to [TuGraph Browser](../../4.user-guide/1.tugraph-browser.md)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md
new file mode 100644
index 0000000000..9a5d1d24b1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/4.log.md
@@ -0,0 +1,41 @@
+# Log
+
+> This document mainly introduces the logging function of TuGraph.
+
+## 1.Introduction
+
+TuGraph keeps two types of logs: server logs and audit logs. Server logs record human-readable server status information, while audit logs maintain encrypted information for every operation performed on the server.
+
+## 2.Server log
+
+### 2.1.Server Log Configuration Items
+The output directory of server logs can be specified through the `log_dir` configuration item. The level of log can be specified through the `verbose` configuration item.
+
+The `log_dir` configuration item is empty by default. If `log_dir` is empty, then all logs will be write to the console, the maximum size of a single log file is 256MB.
+
+The `verbose` configuration item controls the level of log, and is divided into three levels of `0, 1, 2`. Ther verbosity of log record grows as the number grows. The default level is `1`. When the level is set to `2`, the server will print logs in `DEBUG` level and above. When the level is set to `1`, the server will print logs in `INFO` level and above. When the level is set to `0`, the server will print log in `ERROR` level and above.
+
+### 2.3.Example of Server Log Output Macro Usage
+
+If the developer wants to add logs to the code during development, they can refer to the following example:
+
+```
+#include "tools/lgraph_log.h" // add log dependency.
+
+void LogExample() {
+    // The log module has been initialized during the database startup, and developers can directly call the macro.
+    // The log level is divided into five levels: DEBUG, INFO, WARNING, ERROR, and FATAL.
+
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+
+You can also refer to the log macro usage in test/test_lgraph_log.cpp.
+
+## 3.Audit log
+
+Audit logs record each request and response, as well as the user who sent the request and when the request received. Audit logging can only be turned on or off. The results can be queried using the TuGraph visualization tool and the REST API.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst
new file mode 100644
index 0000000000..4be6ec9ad4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/5.ecosystem-tools/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Ecosystem-Tools
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/1.cypher.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/1.cypher.md
new file mode 100644
index 0000000000..db7366fed0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/1.cypher.md
@@ -0,0 +1,2561 @@
+# Cypher API
+
+> This document mainly introduces the detailed usage instructions of TuGraph-Cypher.
+
+## Table of contents
+- [1.Operators](#1operators)
+  - [1.1.Summary](#11summary)
+  - [1.2.General Operators](#12general-operators)
+  - [1.3.Mathematical Operators](#13mathematical-operators)
+  - [1.4.Comparison Operators](#14comparison-operators)
+  - [1.5.String Specific Comparison Operators](#15string-specific-comparison-operators)
+  - [1.6.Boolean Operators](#16boolean-operators)
+  - [1.7.String Operators](#17string-operators)
+  - [1.8.List Operators](#18list-operators)
+- [2.Clauses](#2clauses)
+  - [2.1.Summary](#21summary)
+  - [2.2.Match](#22match)
+  - [2.3.Return](#23return)
+  - [2.4.Where](#24where)
+  - [2.5.Skip](#25skip)
+  - [2.6.Limit](#26limit)
+  - [2.7.Create](#27create)
+  - [2.8.Callyield](#28callyield)
+  - [2.9.Union](#29union)
+- [3.Functions](#3functions)
+  - [3.1.Whole List of Functions](#31whole-list-of-functions)
+  - [3.2.Predicate Functions](#32predicate-functions)
+  - [3.3.Scalar Functions](#33scalar-functions)
+  - [3.4.Aggregating Functions](#34aggregating-functions)
+  - [3.5.List Funtions](#35list-funtions)
+  - [3.6.Mathematical Functions](#36mathematical-functions)
+- [4.Extensions to Opencypher](#4extensions-to-opencypher)
+- [5.Procedures](#5procedures)
+  - [5.1.Procedures Demos](#51procedures-demos)
+  - [5.2.Whole List of Procedures](#52whole-list-of-procedures)
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators support progress overview：
+
+| category                             | supported                                                                                                                                                       | unsupported                                 |
+| ------------------------------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------- |
+| General operators                    | <code>DISTINCT</code>, <code>.</code> for property access                                                                                                       | <code>[]</code> for dynamic property access |
+| Mathematical operators               | <code>+</code>, <code>-</code>, <code>\*</code>, <code>/</code>, <code>%</code>, <code>^</code>                                                                 |                                             |
+| Comparison operators                 | <code>=</code>, <code>&lt;&gt;</code>, <code>&lt;</code>, <code>&gt;</code>, <code>⇐</code>, <code>&gt;=</code>, <code>IS NULL</code>, <code>IS NOT NULL</code> |                                             |
+| String-specific comparison operators | <code>STARTS WITH</code>, <code>ENDS WITH</code>, <code>CONTAINS</code>, <code>REGEXP</code>                                                                    |                                             |
+| Boolean operators                    | <code>AND</code>, <code>OR</code>, <code>XOR</code>, <code>NOT</code>                                                                                           |                                             |
+| String operators                     | <code>+</code> for concatenation                                                                                                                                |                                             |
+| List operators                       | <code>+</code> for concatenation, <code>IN</code> to check existence of an element in a list, <code>[]</code> for accessing element(s)                          |                                             |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+  ```
+  CREATE (a:Person {name: 'Anne', eyeColor: 'blue'}),
+         (b:Person {name: 'Bill', eyeColor: 'brown'}),
+         (c:Person {name: 'Carol', eyeColor: 'blue'})
+  ```
+
+  ```
+  MATCH (p:Person ) RETURN DISTINCT p.eyeColor
+  ```
+
+- ✓ Accessing properties of a nested literal map using the `.` operator
+
+  ```
+  WITH {person: {name: 'Anne', age: 25}} AS p
+  RETURN p.person.name
+  ```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+  ```
+  CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+         (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+         (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+  ```
+  ```
+  MATCH (restaurant:Restaurant), (category:Category)
+  WHERE restaurant["rating_" + category.name] > 6
+  RETURN DISTINCT restaurant.name
+  ```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator `^`
+
+  ```
+  WITH 2 AS number, 3 AS exponent
+  RETURN number ^ exponent AS result
+  ```
+
+- ✓ Using the unary minus operator `-`
+  ```
+  WITH -3 AS a, 4 AS b
+  RETURN b - a AS result
+  ```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+  ```
+  WITH 4 AS one, 3 AS two
+  RETURN one > two AS result
+  ```
+
+### 1.5.String-specific comparison operators
+
+<span id="jump"></span>
+
+- ✓ Using STARTS WITH to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate STARTS WITH 'Jo'
+  RETURN candidate
+  ```
+
+- ✓ Using REGEXP to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate REGEXP 'Jo.*n'
+  RETURN candidate
+  ```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+  ```
+  WITH [2, 4, 7, 9, 12] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number = 4 OR (number > 6 AND number < 10)
+  RETURN number
+  ```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+  More details on string-specific comparison operators can be found [here](#jump)
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+  ```
+  RETURN [1,2,3,4,5]+[6,7] AS myList
+  ```
+- ✓ Using IN to check if a number is in a list
+
+  ```
+  WITH [2, 3, 4, 5] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number IN [2, 3, 8]
+  RETURN number
+  ```
+
+- ✓ Accessing elements in a list using the [] operator
+  ```
+  WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+  RETURN names[1..3] AS result
+  ```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses support progress list：
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>grammar</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="3"><p>Reading clauses</p></td>
+			<td><p>MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>OPTIONAL MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>MANDATORY MATCH</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="3"><p>Projecting clauses</p></td>
+			<td><p>RETURN … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>WITH … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>UNWIND … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="4"><p>Reading sub-clauses</p></td>
+			<td><p>WHERE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>ORDER BY [ASC[ENDING] / DESC[ENDING]]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>SKIP</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>LIMIT</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>Writing clauses</p></td>
+			<td><p>CREATE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>DETACH DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>SET</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>REMOVE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Reading/Writing clauses</p></td>
+			<td><p>MERGE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>CALL […YIELD]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Set operations</p></td>
+			<td><p>UNION</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>UNION ALL</p></td>
+			<td><p>supported</p></td>
+		</tr>
+	</tbody>
+</table>
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+    ```
+    MATCH (n)
+    RETURN n
+    ```
+  - ✓ Get all nodes with a label
+    ```
+    MATCH (movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Related nodes
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+  - ✓ Match with labels
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[]->(movie)
+    RETURN movie.title
+    ```
+  - ✓ Directed relationships and variable
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[r]->(movie)
+    RETURN type(r)
+    ```
+  - ✓ Match on relationship type
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})<-[:ACTED_IN]-(actor)
+    RETURN actor.name
+    ```
+  - ✓ Match on multiple relationship types
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[:ACTED_IN|:DIRECTED]-(person)
+    RETURN person.name
+    ```
+  - ✓ Match on relationship type and use a variable
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[r:ACTED_IN]-(actor)
+    RETURN r.role
+    ```
+
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+    ```
+    MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+    RETURN type(r)
+    ```
+  - ✓ Multiple relationships
+    ```
+    MATCH (charlie {name: 'Charlie Sheen'})-[:ACTED_IN]->(movie)<-[:DIRECTED]-(director)
+    RETURN movie.title, director.name
+    ```
+  - ✓ Variable-length relationships
+    ```
+    MATCH (martin {name: 'Charlie Sheen'})-[:ACTED_IN*1..3]-(movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Relationship variable in variable-length relationships
+    ```
+    MATCH p = (actor {name: 'Charlie Sheen'})-[:ACTED_IN*2]-(co_actor)
+    RETURN relationships(p)
+    ```
+  - ❏ Match with properties on a variable-length path
+    ```
+    MATCH p = (charlie:Person)-[* {blocked:false}]-(martin:Person)
+    WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+    RETURN p
+    ```
+  - ✓ Zero-length paths
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})-[*0..1]-(x)
+    RETURN x
+    ```
+  - ✓ Named paths
+
+    ```
+    MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+    ```
+
+  - ✓ Matching on a bound relationship
+
+    ```
+    MATCH (a)-[r]-(b)
+    WHERE id(r)= 0
+    RETURN a,b
+    ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (oliver:Person {name: 'Oliver Stone'}),
+    p = shortestPath((martin)-[*..15]-(oliver))
+    RETURN p
+    ```
+  - ✓ All shortest paths
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (michael:Person {name: 'Michael
+    Douglas'}), p = allShortestPaths((martin)-[*]-(michael))
+    RETURN p
+    ```
+
+- Get node or relationship by id
+
+  - ✓ Node by id
+    ```
+    MATCH (n)
+    WHERE id(n)= 0
+    RETURN n
+    ```
+  - ☒ Relationship by id
+    ```
+    MATCH ()-[r]->()
+    WHERE id(r) = 0
+    RETURN r
+    ```
+  - ✓ Multiple nodes by id
+    ```
+    MATCH (n)
+    WHERE id(n) IN [0, 3, 5]
+    RETURN n
+    ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+  ```
+  MATCH (n {name: 'B'}) RETURN n
+  ```
+
+  > **Note**
+  >
+  > Return `id` of n.
+
+- ✓ Return relationships
+
+  ```
+  MATCH (n {name: 'A'})-[r:KNOWS]->(c)
+  RETURN r
+  ```
+
+  > **Note**
+  >
+  > Return `EdgeUid` of r.
+
+- ✓ Return property
+  ```
+  MATCH (n {name: 'A'}) RETURN n.name
+  ```
+- ❏ Return all elements
+  ```
+  MATCH p = (a {name: 'A'})-[r]->(b)
+  RETURN *
+  ```
+- ❏ Variable with uncommon characters
+  ```
+  MATCH (`This isn\'t a common variable`)
+  WHERE `This isn\'t a common variable`.name = 'A'
+  RETURN `This isn\'t a common variable`.happy
+  ```
+- ✓ Aliasing a field
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age AS SomethingTotallyDifferent
+  ```
+- ✓ Optional properties
+  ```
+  MATCH (n)
+  RETURN n.age
+  ```
+- ❏ Other expressions
+
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age > 30, "I'm a literal", (a)-[]->()
+  ```
+
+  `(a)-[]->()` not supported.
+
+- ✓ Unique results
+  ```
+  MATCH (a {name: 'A'})-[]->(b)
+  RETURN DISTINCT b
+  ```
+
+### 2.4.WHERE
+
+- Basic usage
+
+  - ✓ Boolean operations
+    ```
+    MATCH (n)
+    WHERE n.name = 'Peter' XOR (n.age < 30 AND n.name = 'Tobias') OR NOT (n.name =
+    'Tobias' OR n.name = 'Peter')
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node label
+    ```
+    MATCH (n)
+    WHERE n:Swedish
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node property
+    ```
+    MATCH (n)
+    WHERE n.age < 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on relationship property
+    ```
+    MATCH (n)-[k:KNOWS]->(f)
+    WHERE k.since < 2000
+    RETURN f.name, f.age, f.email
+    ```
+  - ❏ Filter on dynamically-computed property
+    ```
+    WITH 'AGE' AS propname
+    MATCH (n)
+    WHERE n[toLower(propname)]< 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Property existence checking
+    ```
+    MATCH (n)
+    WHERE exists(n.belt)
+    RETURN n.name, n.belt
+    ```
+
+- String matching
+
+  - ✓ Match the beginning of a string
+    ```
+    MATCH (n)
+    WHERE n.name STARTS WITH 'Pet'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match the ending of a string
+    ```
+    MATCH (n)
+    WHERE n.name ENDS WITH 'ter'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match anywhere within a string
+    ```
+    MATCH (n)
+    WHERE n.name CONTAINS 'ete'
+    RETURN n.name, n.age
+    ```
+  - ✓ String matching negation
+    ```
+    MATCH (n)
+    WHERE NOT n.name ENDS WITH 's'
+    RETURN n.name, n.age
+    ```
+
+- Using path patterns in `WHERE`
+
+  - ✓ Filter on patterns
+    ```
+    MATCH (tobias {name: 'Tobias'}), (others)
+    WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+    RETURN others.name, others.age
+    ```
+  - ✓ Filter on patterns using NOT
+    ```
+    MATCH (persons), (peter {name: 'Peter'})
+    WHERE NOT (persons)-[]->(peter)
+    RETURN persons.name, persons.age
+    ```
+  - ✓ Filter on patterns with properties
+
+    ```
+    MATCH (n)
+    WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+    RETURN n.name, n.age
+    ```
+
+  - ✓ Filter on relationship type
+    ```
+    MATCH (n)-[r]->()
+    WHERE n.name='Andres' AND type(r) STARTS WITH 'K'
+    RETURN type(r), r.since
+    ```
+
+- Lists
+
+  - ✓ IN operator
+    ```
+    MATCH (a)
+    WHERE a.name IN ['Peter', 'Tobias']
+    RETURN a.name, a.age
+    ```
+
+- Missing properties and values
+
+  - ✓ Default to false if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white'
+    RETURN n.name, n.age, n.belt
+    ```
+  - ✓ Default to true if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+    ORDER BY n.name
+    ```
+  - ✓ Filter on null
+    ```
+    MATCH (person)
+    WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+    person.belt
+    ```
+
+- Using ranges
+
+  - ✓ Simple range
+    ```
+    MATCH (a)
+    WHERE a.name >= 'Peter'
+    RETURN a.name, a.age
+    ```
+  - ✓ Composite range
+    ```
+    MATCH (a)
+    WHERE a.name > 'Andres' AND a.name < 'Tobias'
+    RETURN a.name, a.age
+    ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 3
+  ```
+- ✓ Return middle two records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 1
+  LIMIT 2
+  ```
+- ✓ Using an expression with SKIP to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP toInteger(3*rand())+ 1
+  ```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT 3
+  ```
+- ✓ Using an expression with LIMIT to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT toInteger(3 * rand())+ 1
+  ```
+
+### 2.7.CREATE
+
+- Create nodes
+
+  > **Note**
+  >
+  > TuGraph does not support creating empty nodes and does not support multiple labels.
+
+  - ☒ Create single node
+    ```
+    CREATE (n)
+    ```
+  - ☒ Create multiple nodes
+    ```
+    CREATE (n), (m)
+    ```
+  - ✓ Create a node with a label
+    ```
+    CREATE (n:Person)
+    ```
+  - ☒ Create a node with multiple labels
+    ```
+    CREATE (n:Person:Swedish)
+    ```
+  - ✓ Create node and add labels and properties
+    ```
+    CREATE (n:Person {name: 'Andres', title: 'Developer'})
+    ```
+  - ✓ Return created node
+    ```
+    CREATE (a {name: 'Andres'})
+    RETURN a
+    ```
+
+- Create relationships
+
+  - ✓ Create a relationship between two nodes
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE]->(b)
+    ```
+  - ✓ Create a relationship and set properties
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE {name: a.name + '<->' + b.name}]->(b)
+    ```
+  - ✓ Create a full path
+    ```
+    CREATE p = (andres {name:'Andres'})-[:WORKS_AT]->(neo)<-[:WORKS_AT]-(michael {name:'Michael'})
+    RETURN p
+    ```
+
+- Use parameters with CREATE
+
+  - ❏ Create node with a parameter for the properties
+    ```
+    CREATE (n:Person $props)
+    RETURN n
+    ```
+  - ☒ Create multiple nodes with a parameter for their properties
+    ```
+    UNWIND $props AS map
+    CREATE (n)
+    SET n = map
+    ```
+    cannot create vertex without label.
+
+### 2.8.CALL\[…YIELD\]
+
+- ✓ Call a procedure using CALL
+  ```
+  CALL db.vertexLabels
+  ```
+- ✓ View the signature for a procedure
+  ```
+  CALL dbms.procedures() YIELD name, signature
+  WHERE name='dbms.listConfig'
+  RETURN signature
+  ```
+- ❏ Call a procedure using a quoted namespace and name
+  ```
+  CALL `db`.`vertexLabels`
+  ```
+- ✓ Call a procedure with literal arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+  ```
+- ❏ Call a procedure with parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+  ```
+- ❏ Call a procedure with mixed literal and parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+  ```
+- ✓ Call a procedure with literal and default arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+  ```
+- ✓ Call a procedure within a complex query using CALL…YIELD
+  ```
+  CALL db.vertexLabels() YIELD label
+  RETURN count(label) AS numLabels
+  ```
+- ✓ Call a procedure and filter its results
+  ```
+  CALL db.vertexLabels() YIELD label
+  WHERE label CONTAINS 'User'
+  RETURN count(label) AS numLabels
+  ```
+- ❏ Call a procedure within a complex query and rename its outputs
+  ```
+  CALL db.propertyKeys() YIELD propertyKey AS prop
+  MATCH (n)
+  WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+  ```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION ALL MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+- ❏ Combine two queries and remove duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION
+  MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>function</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="5"><p>Predicate functions</p></td>
+			<td><p>exists()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>all()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>any()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>single()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>none()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="14"><p>Scalar functions</p></td>
+			<td><p>id()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>properties()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>head()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>last()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toBoolean()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>toFloat()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toInteger()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toString()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>type()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>startnode()</p></td>
+            <td><p></p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>size()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>length()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>label()</p></td>
+            <td><p>OpenCypher extension method</p></td>
+		</tr>
+        <tr class="even">
+			<td rowspan="12"><p>Aggregating functions</p></td>
+			<td><p>avg()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>collect()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>count()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>max()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>min()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>percentileCont()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>percentileDisc()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>stDev()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>stDevP()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+                <td><p>variance()</p></td>
+                <td></td>
+            </tr>
+        <tr class="odd">
+                <td><p>varianceP()</p></td>
+                <td></td>
+            </tr>
+        <tr class="even">
+                <td><p>sum()</p></td>
+                <td></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>List functions</p></td>
+			<td><p>keys()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>labels()</p></td>
+			<td><p></p></td>
+		</tr>
+	<tr class="odd">
+			<td><p>nodes()</p></td>
+			<td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>range()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>subscript()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="6"><p>Mathematical functions</p></td>
+			<td><p>abs()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>ceil()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>floor()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>rand()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>round()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>sign()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>String functions</p></td>
+			<td><p>/</p></td>
+			<td></td>
+		</tr>
+	</tbody>
+</table>
+
+### 3.2.Predicate functions
+
+- exists()
+
+  judge it whether a vertex or edge has the field .
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE exists(n.belt)
+  RETURN n.name, n.belt
+  ```
+
+  **Example output:**
+
+  | exists(name) |
+  | ------------ |
+  | true         |
+
+### 3.3.Scalar functions
+
+- id()
+
+  get the id of vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  RETURN id(a)
+  ```
+
+  **Example output:**
+
+  | vid |
+  | --- |
+  | 1   |
+  | 2   |
+  | ... |
+
+- properties()
+
+  get a map containing all the properties of a node or relationship.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  CREATE (p:Person {name: 'Stefan', city: 'Berlin'})
+  RETURN properties(p)
+  ```
+
+  **Example output:**
+
+  | properties                |
+  | ------------------------- |
+  | {name:Stefan,city:Berlin} |
+
+- head()
+
+  get the first element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, head(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | head(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "one"         |
+
+- last()
+
+  get the last element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, last(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | last(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "three"       |
+
+- toFloat()
+
+  Converts an integer or string value to a floating point number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toFloat('11.5'), toFloat('not a number')
+  ```
+
+  **Example output:**
+  | float |
+  | ----- |
+  | 11.5 |
+  |null|
+
+- toInteger()
+
+  Converts a floating point or string value to an integer value.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toInteger('2.3') AS integer
+  ```
+
+  **Example output:**
+
+  | integer |
+  | ------- |
+  | 2       |
+
+- toString()
+
+  Converts an integer, float, boolean value to a string.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toString(2.3)
+  ```
+
+- type()
+
+  get the string representation of the relationship type.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name = 'Alice'
+  RETURN type(r)
+  ```
+
+  **Example output:**
+
+  | type     |
+  | -------- |
+  | acted_in |
+  | acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+
+  Returns the average of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN avg(n.age)
+  ```
+
+  **Example output:**
+
+  | avg(n.born)        |
+  | ------------------ |
+  | 1869.2661654135338 |
+
+- collect()
+
+  Returns a list containing the values returned by an expression.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN collect(n.age)
+  ```
+
+  **Example output:**
+
+  | collect(n.born) |
+  | --------------- |
+  | [1967,...]      |
+
+- count()
+
+  Returns the number of values or records.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n {name: 'A'})-[]->(x)
+  RETURN labels(n), n.age, count(*)
+  ```
+
+  **Example output:**
+
+  | labels(n)  | n.age | count(\*) |
+  | ---------- | ----- | --------- |
+  | ["Person"] | 13    | 3         |
+
+- max()
+
+  Returns the maximum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN max(n.age)
+  ```
+
+  **Example output:**
+
+  | max(n.age) |
+  | ---------- |
+  | 44         |
+
+- min()
+
+  Returns the minimum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN min(n.age)
+  ```
+
+  **Example output:**
+
+  | min(n.age) |
+  | ---------- |
+  | 13         |
+
+- percentileCont()
+
+  Returns the percentile of a value over a group using linear interpolation.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileCont(n.age, 0.4)
+  ```
+
+  **Example output:**
+
+  | percentileCont(n.age, 0.4) |
+  | -------------------------- |
+  | 29                         |
+
+* percentileDisc()
+
+  Returns the nearest value to the given percentile over a group using a rounding method.
+
+  **Scope:** whole instance.
+
+  **Output:** the percentile of the given value over a group.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileDisc(n.age, 0.5)
+  ```
+
+  **Example output:**
+
+  | percentileDisc(n.age, 0.5) |
+  | -------------------------- |
+  | 33                         |
+
+* stDev()
+
+  Returns the standard deviation for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDev(n.age)
+  ```
+
+  **Example output:**
+
+  | stDev(n.age)       |
+  | ------------------ |
+  | 15.716233645501712 |
+
+* stDevP()
+
+  Returns the standard deviation for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDevP(n.age)
+  ```
+
+  **Example output:**
+
+  | stDevP(n.age)      |
+  | ------------------ |
+  | 12.832251036613439 |
+
+* variance()
+
+  Returns the variance for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN variance(n.age)
+  ```
+
+  **Example output:**
+
+  | variance(n.age) |
+  | --------------- |
+  | 247             |
+
+* varianceP()
+
+  Returns the variance for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN varianceP(n.age)
+  ```
+
+  **Example output:**
+
+  | varianceP(n.age) |
+  | ---------------- |
+  | 164.66666666667  |
+
+* sum()
+
+  Returns the sum of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN sum(n.age)
+  ```
+
+  **Example output:**
+
+  | sum(n.age) |
+  | ---------- |
+  | 90         |
+
+### 3.5.List Funtions:
+
+- keys()
+
+  get the field names of some vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN keys(a)
+  ```
+
+  **Example output:**
+
+  | keys(a)               |
+  | --------------------- |
+  | ["name","age","eyes"] |
+
+- labels()/label()
+
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN labels(a)
+  ```
+
+  **Example output:**
+
+  | labels                 |
+  | ---------------------- |
+  | ["Person","Developer"] |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice'})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+### 3.6.Mathematical functions
+
+- abs()
+
+  get the absolute value of some data.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a), (e)
+  WHERE a.name = 'Alice' AND e.name = 'Eskil'
+  RETURN a.age, e.age, abs(a.age - e.age)
+  ```
+
+  **Example output:**
+
+  | a.age | e.age | abs(a.age - e.age) |
+  | ----- | ----- | ------------------ |
+  | 38    | 41    | 1                  |
+
+- ceil()
+
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+  **Example input:**
+
+  ```
+  RETURN ceil(0.1)
+  ```
+
+  **Example output:**
+
+  | ceil(0.1) |
+  | --------- |
+  | 1.0       |
+
+- floor()
+
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN floor(0.9)
+  ```
+
+  **Example output:**
+
+  | floor(0.9) |
+  | ---------- |
+  | 0.0        |
+
+- round()
+
+  Returns the value of a number rounded to the nearest integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN round(3.141592)
+  ```
+
+  **Example output:**
+
+  | round |
+  | ----- |
+  | 3     |
+
+- rand()
+
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN rand()
+  ```
+
+  **Example output:**
+
+  | rand()             |
+  | ------------------ |
+  | 0.9797131960534085 |
+
+- sign()
+
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN sign(-17), sign(0.1)
+  ```
+
+  **Example output:**
+
+  | sign(-17) | sign(0.1) |
+  | --------- | --------- |
+  | -1        | 1         |
+
+## 4.Extensions To OpenCypher
+
+- Number of Labels
+
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+
+  - OpenCypher: One node/relationship may have 0 to many labels.
+
+- Schema.
+
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.Procedures
+
+### 5.1.procedures' demos
+
+- dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                               | name            |
+  | --------------------------------------- | --------------- |
+  | db.vertexLabels() :: (label::STRING)    | db.vertexLabels |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels   |
+  | db.indexes() :: (index::LIST)           | db.indexes      |
+  | ...                                     | ...             |
+
+- db.vertexLabels()
+
+  Lists all available labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+
+  **Example output:**
+
+  | label   |
+  | ------- |
+  | genre   |
+  | keyword |
+  | movie   |
+  | ...     |
+
+- db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edgeLabels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | edgeLabel |
+  | --------- |
+  | acted_in  |
+  | directed  |
+  | ...       |
+
+- db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter     | parameter type | description                   |
+  | ------------- | -------------- | ----------------------------- |
+  | label_name    | string         | name of vertex label          |
+  | primary_field | string         | primary field of vertex label |
+  | field_spec    | list           | specification of a field      |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+  **Output:** If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added label [Person]
+  ```
+
+- db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description                   |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field             |
+  | type       | string     | type of the field             |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name         | type   | optional |
+  | ------------ | ------ | -------- |
+  | id           | INT32  | false    |
+  | born         | INT32  | true     |
+  | name         | STRING | true     |
+  | poster_image | STRING | true     |
+
+- db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | label_type | string         | either 'vertex' or 'edge'                                             |
+  | label_name | string         | name of the label                                                     |
+  | extra      | string         | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list           | specification of a field                                              |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.
+  for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+- db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:**
+
+  | field_name | field_type | description                      |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description                   |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string          | either 'vertex' or 'edge'     |
+  | label_name  | string          | name of the label             |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description               |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string         | either 'vertex' or 'edge' |
+  | label_name       | string         | name of the label         |
+  | field_value_spec | list           | specification of a field  |
+
+  in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, 'optional']`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+  | field_spec | list           | specification of a field  |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelModFields(
+  'vertex',
+  'new_label',
+  ['birth_date', 'DATETIME', '1900-01-01 00:00:00'],
+  ['gender', 'BOOL', false])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description              |
+  | ---------------- | -------------- | ------------------------ |
+  | label_name       | string         | name of the label        |
+  | edge_constraints | string         | edge constraints         |
+  | field_spec       | list           | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for optional fields.
+
+- `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32,true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+- db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+- db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+- | pair_unique  | boolean        | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+- dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description          |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string         | the current password |
+  | new_password     | string         | new password         |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string         | the user's name |
+  | new_password | string         | new password    |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.createUser(user_name, password)
+
+  create new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | ------------------------ |
+  | user_name | string         | the new user name        |
+  | password  | string         | the password of new user |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string         | the user name to be deleted |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string         | the user name               |
+  | is.admin  | boolean        | the permission of this user |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       | ...      |
+
+- dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description           |
+  | --------- | -------------- | --------------------- |
+  | user.user | string         | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+- dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+  a list of ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host         |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...          |
+
+- dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been deleted.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description                      |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string         | the name of new subgraph         |
+  | description | string         | description of new subgraph      |
+  | max_size_GB | integer        | Upper limit of subgraph capacity |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+  | config     | map            | the configuration to be modified     |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.listGraphs()
+
+  get all subgraph in this graph database .
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.config.list()
+
+  get some config of this graph database .
+
+  **Output:**
+
+  a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  | --------- | ------- |
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       | ...     |
+
+- dbms.config.update(updates)
+
+  get some config of this graph database .
+
+  **Output:**
+
+  If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+      enable_ip_check:false,
+      durable:true,
+      optimistic_txn:true,
+      enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+- dbms.takeSnapshot()
+
+  take the snapshot on this current graph database.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+- dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path                       |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+- algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                                                             |
+  | --------- | -------------- | --------------------------------------------------------------------------------------- |
+  | startNode | Node           | the source node of paths                                                                |
+  | endNode   | Node           | the destination node paths                                                              |
+  | config    | MAP            | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+  If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2         | 1         |
+
+- algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+- algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                               |
+  | --------- | -------------- | --------------------------------------------------------- |
+  | id        | ANY            | the id of vertexes or edges , the id must be variable     |
+  | config    | MAP            | the configuration of this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or it is an edge id.
+
+  **Output:**
+
+  If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.Whole List Of Procedures
+
+| Name                                  | Description                                                          | Signature                                                                                                                                                                         |
+|---------------------------------------|----------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.vertexLabels                       | list all vertex labels                                               | db.vertexLabels() :: (label::STRING)                                                                                                                                              |
+| db.edgeLabels                         | list all edge labels                                                 | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                           |
+| db.indexes                            | list all indexes                                                     | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                              |
+| db.listLabelIndexes                   | list indexes by label                                                | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                    |
+| db.warmup                             | warm up the DB                                                       | db.warmup() :: (time_used::STRING)                                                                                                                                                |
+| db.createVertexLabel                  | create a vertex label                                                | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                            |
+| db.createLabel                        | create a vertex/edge label                                           | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                       |
+| db.getLabelSchema                     | get the schema of label                                              | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                         |
+| db.getVertexSchema                    | get the schema of vertex label                                       | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                |
+| db.getEdgeSchema                      | get the schema of edge label                                         | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                  |
+| db.deleteLabel                        | delete vertex/edge label                                             | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                 |
+| db.alterLabelDelFields                | delete some fields of a label on a subgraph                          | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                      |
+| db.alterLabelAddFields                | add some fields of a label on a subgraph                             | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                           |
+| db.alterLabelModFields                | modify some fields of a label on a subgraph                          | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                 |
+| db.createEdgeLabel                    | create a edge label                                                  | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                               |
+| db.addIndex                           | add an index                                                         | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                    |
+| db.addEdgeIndex                       | add an index                                                         | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                           |
+| db.deleteIndex                        | delete an index                                                      | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                 |
+| db.backup                             | backup the db                                                        | db.backup(destination::STRING) :: ()                                                                                                                                              |
+| dbms.procedures                       | list all procedures                                                  | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                             |
+| dbms.security.changePassword          | change current user password                                         | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                           |
+| dbms.security.changeUserPassword      | change user password                                                 | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                              |
+| dbms.security.createUser              | create an account                                                    | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.deleteUser              | delete an account                                                    | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                           |
+| dbms.security.listUsers               | list all accounts                                                    | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                   |
+| dbms.security.showCurrentUser         | get current user name                                                | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                         |
+| dbms.security.getUserPermissions      | get the permissions of a specified user                              | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                           |
+| dbms.graph.createGraph                | create a subgraph                                                    | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                 |
+| dbms.graph.modGraph                   | modify the config of a subgraph                                      | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                   |
+| dbms.graph.deleteGraph                | delete a subgraph                                                    | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                            |
+| dbms.graph.listGraphs                 | list all subgraphs                                                   | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                |
+| dbms.graph.getGraphInfo               | get the information of a specified graph                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                              |
+| dbms.security.addAllowedHosts         | add to the trust list                                                | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                  |
+| dbms.security.deleteAllowedHosts      | remove from the trust list                                           | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                       |
+| dbms.security.listAllowedHosts        | list the trust list                                                  | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                |
+| dbms.config.update                    | update the configuration                                             | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                             |
+| dbms.config.list                      | list the configuration                                               | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                   |
+| algo.shortestPath                     | get a shortest path between two vertexes                             | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                             |
+| algo.allShortestPaths                 | get all the shortest paths between two vertexes                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                              |
+| algo.native.extract                   | get the field values of a list of vertexes or edges specified id     | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                          |
+| db.flushDB                            | flush the db                                                         | db.flushDB() :: (::VOID)                                                                                                                                                          |
+| dbms.security.listRoles               | list all roles                                                       | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                   |
+| dbms.security.createRole              | create a role                                                        | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                              |
+| dbms.security.deleteRole              | delete a role                                                        | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                           |
+| dbms.security.getRoleInfo             | get the role information                                             | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                       |
+| dbms.security.disableRole             | enable/disable the role                                              | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                              |
+| dbms.security.modRoleDesc             | modify the description of a role                                     | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                           |
+| dbms.security.rebuildRoleAccessLevel  | rebuild the user subgraph access rights                              | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                  |
+| dbms.security.modRoleAccessLevel      | modify the user subgraph access rights                               | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                      |
+| dbms.security.modRoleFieldAccessLevel | modify the user property access rights                               | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                           |
+| dbms.security.getUserInfo             | get the user information                                             | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                       |
+| dbms.security.getUserMemoryUsage      | get the memory usage for a user                                      | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                         |
+| dbms.security.disableUser             | enable/disable the user                                              | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                              |
+| dbms.security.setCurrentDesc          | set the current user description                                     | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                     |
+| dbms.security.setUserDesc             | set user description                                                 | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                           |
+| dbms.security.setUserMemoryLimit      | set user memory limit                                                | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                   |
+| dbms.security.deleteUserRoles         | delete roles from the user                                           | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                               |
+| dbms.security.rebuildUserRoles        | rebuild the relationship between the user and the role               | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                              |
+| dbms.security.addUserRoles            | add the user roles                                                   | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                  |
+| db.plugin.loadPlugin                  | load a plugin                                                        | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN, version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | unload a plugin                                                      | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                       |
+| db.plugin.listPlugin                  | list all plugins                                                     | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                    |
+| db.plugin.getPluginInfo               | get the information of a specified plugin                            | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                    |
+| db.plugin.callPlugin                  | execute the plugins                                                  | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                              |
+| db.importor.dataImportor              | import vertex/edge data                                              | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                       |
+| db.importor.schemaImportor            | import vertex/edge schema                                            | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                       |
+| dbms.meta.count                       | get the total number of vertex and edge                              | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                           |
+| dbms.meta.countDetail                 | get the number of vertex and edge for each label                     | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                 |
+| dbms.meta.refreshCount                | recount the number of vertex and edge, stop writing during the count | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                           |
+| dbms.task.listTasks                   | list running tasks                                                   | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                              |
+| dbms.task.terminateTask               | terminate task                                                       | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                |
+| dbms.ha.clusterInfo                   | get cluster info in HA mode                                          | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                 |
+| db.dropDB                             | empty the db                                                         | db.dropDB() :: (::VOID)                                                                                                                                                           |
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md
new file mode 100644
index 0000000000..ab5ed72369
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md
@@ -0,0 +1,18 @@
+# Introduction to ISO GQL
+
+Graph Query Language (GQL) is an upcoming International Standard language for property graph querying. It builds on the foundations of SQL and integrates proven ideas from the existing [openCypher, PGQL, GSQL, and G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/) languages. The standard is currently in the draft stage.
+
+TuGraph has implemented GQL based on the [ISO GQL (ISO/IEC 39075) Antlr4 grammar file](https://github.com/TuGraph-family/gql-grammar). It includes some extensions and modifications. Not all GQL syntax is fully supported at the moment, but we will continue to improve and enhance it in the future.
+
+## List of Clauses
+
+| Category            | Clauses        |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md
new file mode 100644
index 0000000000..99b03a27fd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md
@@ -0,0 +1,100 @@
+# MATCH
+
+The `MATCH` clause is the most basic clause in GQL, and almost all queries are expanded through `MATCH`.
+
+The `MATCH` clause is used to specify the matching pattern to search in the graph, to match vertices or paths that meet certain conditions.
+
+## Basic Usage
+
+### Vertex basics
+
+#### Get all vertices
+
+```
+MATCH (n)
+RETURN n
+```
+
+#### Get all vertices with a label
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+#### Vertex matching with property
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### Vertex matching with filter
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+### Edge basics
+
+#### Edge pointing right
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+#### Edge pointing left
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+#### Edge matching with filter
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+return
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+### Path matching
+
+#### Variable length
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+return
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md
new file mode 100644
index 0000000000..586676ea16
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md
@@ -0,0 +1,30 @@
+# OPTIONAL MATCH
+
+The `OPTIONAL MATCH` clause matches a graph pattern and returns `null` if there is no match.
+
+## Basic Usage
+
+### Match found
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+### Match Not Found
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+return
+
+```JSON
+[{"n.birthyear":null}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md
new file mode 100644
index 0000000000..3ba96e8a95
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md
@@ -0,0 +1,110 @@
+# RETURN
+
+The `RETURN` clause specifies the results to be returned, including vertices, edges, paths, properties, etc.
+
+## Basic Usage
+
+### Return vertices
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+return
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+### Return edges
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+return
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+### Return property
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+### Uncommon string used as variable name
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+### Alias
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+return
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+### Optional property
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+### Other expressions
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+return
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+### Distinct
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+return
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md
new file mode 100644
index 0000000000..e6222e5a5f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md
@@ -0,0 +1,21 @@
+# NEXT
+
+The `NEXT` clause is used to connect multiple clauses.
+
+## Basic Usage
+
+### Connecting MATCH clauses
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md
new file mode 100644
index 0000000000..6cd6c67fe5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md
@@ -0,0 +1,48 @@
+# WHERE
+
+`WHERE` clause is used to filter records.
+
+## Baisc Usage
+
+### Filter vertex
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+returns
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+### Filter edge
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+returns
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+### Boolean expressions
+
+`AND`, `OR`, `XOR`, and `NOT` Boolean expressions can be used in the `WHERE` clause to filter data.
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+returns
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md
new file mode 100644
index 0000000000..543270a624
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md
@@ -0,0 +1,19 @@
+# ORDER BY
+
+`ORDER BY` is a clause of `RETURN` that sorts the output result.
+
+## Basic Usage
+
+### Sorting the Result
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+return
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md
new file mode 100644
index 0000000000..16d6dbb2b7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md
@@ -0,0 +1,30 @@
+# SKIP
+
+`SKIP` specifies the offset of the result rows.
+
+## Baisc Usage
+
+### Without SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### Using SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md
new file mode 100644
index 0000000000..87a9e6f734
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md
@@ -0,0 +1,17 @@
+# LIMIT
+
+The `LIMIT` clause is used to limit the number of rows in the result.
+
+## Basic Usage
+
+### Using LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst
new file mode 100644
index 0000000000..e2cf9d0346
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst
@@ -0,0 +1,8 @@
+GQL Clauses
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/index.rst
new file mode 100644
index 0000000000..e39c0a8e24
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/2.gql/index.rst
@@ -0,0 +1,9 @@
+GQL
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.intro.md
+   2.clauses/index.rst
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/index.rst
new file mode 100644
index 0000000000..c430670454
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/1.query/index.rst
@@ -0,0 +1,9 @@
+Query
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.cypher.md
+   2.gql/index.rst
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..5e4000b6ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
@@ -0,0 +1,214 @@
+# Bootstrap program
+
+>This document is a bootstrap program designed for TuGraph users. Before reading the detailed documents, users should read this document first to have a general understanding of TuGraph's graph computing operation process, and it will be more convenient to read the detailed documents later. The bootstrap program is a simple instance of a bfs (breadth-first search) program based on Tugraph, and we will focus on how it is used.
+
+## 1.Introduction to TuGraph-Graph Analysis Engine
+
+TuGraph's graph analysis engine is mainly used for full graph/full data analysis tasks. With the help of TuGraph's C++ / Python graph analysis engine API, users can quickly derive a complex subgraph from different data sources, and then run iterative graph algorithms such as PageRank, LPA, WCC on the subgraph, and finally make corresponding countermeasures according to the running results.
+
+In TuGraph, the process of both exporting and computing can be accelerated by in-memory parallel processing, resulting in near-real-time processing and analysis. Compared to traditional methods, this approach can avoid the overhead of data export and disk drop, and can achieve ideal performance by using a compact graph data structure.
+
+TuGraph has 6 built-in algorithms in the community version and 25 built-in algorithms in the commercial version. Users hardly need to implement the specific graph calculation process themselves. For details, please refer to algorithms.md.
+
+According to different data sources and implementations, it can be divided into Procedure, Embed and Standalone, which all inherit from OlapBase API. OlapBase API interface documentation can be found in OlAPBase-APi.md.
+
+The data source of Procedure and Embed is the db data preloaded in the graph database, which can be compiled to generate the.so file used by TuGraph-Web loading and the embed file used by the background terminal respectively. The input graph data are loaded in the form of db. The interface document can refer to olapondb-api.md.
+
+Standalone is used to compile and generate a standalone file. Different from the former, the input graph data of the file is loaded in the form of txt, binary, and ODPS files, and the interface document can refer to olapondisk-api.md.
+
+## 2.Procedure compile and run
+
+This mode is mainly used for visual loading and running on the TuGraph-web interface. The usage method is as follows:
+
+### 2.1.C++
+Run bash make_so.sh bfs in the TuGraph/procedures directory to the BFs.so file in the TuGraph/procedures directory, upload the file as a plug-in to Tugraph-web, input parameters and then execute.
+
+### 2.2.Python
+Upload the python file as a plugin to TuGraph-web, and execute it after inputting parameters.
+
+Example:
+Compile the.so algorithm file at TuGraph/procedures
+`bash make_so.sh bfs`
+
+After loading the bfs.so (or TuGraph/procedures/algo_cython/bfs.py) file as a plug-in to TuGraph-web, enter the following json parameters:
+
+```json
+{
+  "root_id": "0",
+  "label": "node",
+  "field": "id"
+}
+```
+
+The following result
+
+result:"{"core_cost":0.013641119003295898,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":8.821487426757813e-06,
+"prepare_cost":0.03479194641113281,
+"total_cost":0.04844188690185547}"
+
+The output ：
+
+- num_edges: the number of edges in the graph
+- num_vertices: the number of nodes in the graph
+- prepare_cost: Represents the time required for the preprocessing phase. The preprocessing phase works: loading parameters, graph data loading, index initialization.
+- core_cost: Represents the time required for the algorithm to run.
+- found_vertices: Number of vertices found.
+- output_cost: the time it takes for the algorithm result to be written back to db.。
+- total_cost: The overall running time of the algorithm is executed.
+
+make_so.sh This file is used to compile the graph algorithm files involved in TuGraph-OLAP into a.so file available for TuGraph-web.
+
+## 3.Embed compile and run
+
+This way is mainly used for TuGraph in the background program on the preloaded db graph data algorithm analysis. Its use method is as follows:
+
+To complete the embed_main.cpp file in TuGraph/procedures directory, add the data name, input parameters, data path and other information, as shown in the following example:
+
+### 3.1.C++
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path Specifies the path for saving the preloaded graph data
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // Specifies the name of the graph
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // Enter the algorithm parameters in json format
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+
+Run bash make_so.sh bfs in TuGraph/procedures to bfs_procedure in TuGraph/procedures/algo_cpp.
+`bash make_embed.sh bfs`
+
+Do this in the TuGraph/procedures folder
+`./algo_cpp/bfs_procedure`
+The result is returned.
+
+Input: {"root_id":"0", "label":"node","field":"id"}
+found_vertices = 3829
+{"core_cost":0.025603055953979492,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":9.059906005859375e-06,
+"prepare_cost":0.056738853454589844,
+"total_cost":0.0823509693145752}
+
+`Input` indicates the input parameters.The other parameters are described as above.
+
+### 3.2.Python
+
+To compile bfs.so, run `bash make_so_cython.sh bfs` in TuGraph/procedures or `python3 setup.py build_ext -i` in TuGraph/procedures/algo_cython.
+
+After obtaining bfs.so, it can be imported and used in Python, as shown in TuGraph/procedures/run_embed.py:
+
+```python
+# TuGraph/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+
+# shell
+python3 run_embed.py
+```
+The output is the same as C++
+
+
+## 4.Standalone compile and run
+
+This file is mainly used to load the graph data directly at the terminal and run the printout results. Here's how to use it:
+
+In TuGraph/build directory `make bfs_standalone` (need to include boost/sort/sort.hpp in the g++ default include path) can get bfs_standalone file, the file is generated with TuGraph/build/output/algo folder.
+
+Run: Go to the TuGraph/build directory and do`./output/algo/bfs_standalone -- type [type] -- input_dir [input_dir] --id_mapping [id_mapping] -- vertices [vertices] --root (root) - output_dir [output_dir]`
+
+Ready to run.
+
+- `[type]` : indicates the type source of the input graph file, including text file, BINARY_FILE binary file, and ODPS source.
+
+- `[input_dir]` : indicates the path of the input graph file folder, which may contain one or more input files. TuGraph will read all the files under [input_dir] when reading the input file. It is required that [input_dir] can only contain the input file and cannot contain other files. Parameters cannot be omitted.
+
+- `[id_mapping]`：When reading the side table, whether to do id mapping for the input data to make it conform to the form of algorithm operation. 1 is required for id mapping, 0 is not required. This process will take some time. The parameter can be omitted, and the default value is 0.
+
+- `[vertices]` : represents the number of vertices in the graph. 0 indicates the number of vertices that the user wants the system to automatically recognize. When is non-zero, it indicates the number of vertices that the user wants to customize. The number of user-defined vertices must be greater than the maximum vertex ID. This parameter can be omitted. The default value is 0.
+
+- `[root]` : indicates the starting vertex id for bfs. The argument cannot be omitted.
+
+- `[output_dir]` : indicates the path of the folder where the output data is saved. The output content is saved to this file, and the parameter cannot be omitted.
+
+Example
+
+### 4.1.C++
+
+Compile the standalone algorithm program at TuGraph/build
+
+```shell
+make bfs_standalone
+```
+
+Run the text source file in TuGraph/build/output
+
+```
+    ./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+Result：
+
+```
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+Result Parameter description is the same as above.
+
+If you do not know the required parameters of a new algorithm, run the`./output/algo/bfs_standalone -h` to view the parameters.
+
+### 4.2.Python
+The bfs extension compilation process of the Python language is the same as that of the embed mode. It is called through the `Standalone` interface at runtime. The example is as follows:
+
+```python
+# TuGraph/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(
+        input_dir="../test/integration/data/algo/fb_unweighted",
+        root=0)
+
+# shell
+python3 run_standalone.py
+```
+
+At this point, the process of bfs operation on the figure above by TuGraph is complete.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..af510f95c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
@@ -0,0 +1,196 @@
+# OlapBase API
+
+> This document will introduce how to use the OlapBase API
+
+## 1.The overview
+
+This manual will introduce the configuration of the TuGraph graph computing system. Combined with the code, several important files and interfaces in TuGraph are introduced.
+
+## 2.Configuration requirements
+
+To develop and compile applications using the TuGraph graph computing system, the configuration required:
+
+- linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+
+- Compiler that supports C++ 14, requires GCC version 5.4.1 or later.
+
+## 3.Atomic operations
+
+TuGraph uses multi-threading technology for batch operations, in which case memory access conflicts may occur. In order to ensure the correctness of modification operations in parallel computing, TuGraph implements atomic operations. The code section can be found in the lgraph_atomic.cpp file under the lgraph folder.
+
+TuGraph also customizes 4 commonly used atomic operations. When we need to modify the data of vertices in multithreaded mode, we should use atomic operations to ensure the correctness of the modification operation in parallel environment. In addition to these four atomic operations, users can also use "cas" to build their own atomic operation functions.
+
+- `bool cas(T \* ptr, T oldv, T newv)` : If the value pointed to by ptr is equal to oldv, the value pointed to by ptr is assigned to newv and returns true. Otherwise, false is returned
+- `bool write_min(T \*a, T b)` : If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `bool write_max(T \*a, T b)` : If b is larger than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `void write_add(T \*a, T b)` : adds the value of b to the value pointed to by a.
+- `void write_sub(T \*a, T b)` : subtract the value of b from the value pointed to by a.
+
+## 4.Vertex Class ParallelBitset
+
+When using TuGraph for batch operations, you need to use a vertex set to represent the vertices you want to process. ParallelBitset implements a vertex collection class that represents vertices in bits and thus saves a significant amount of memory. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 4.1ParallelBitset Class
+
+- `size_t Size()`：Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size_t size)`：Initialize size and data, the length of data is (size >> 6)+1.
+- `void Clear()`：clears the collection.
+- `void Fill()`：add all vertices to the set.
+- `bool Has(size_t i)`：check if vertex i is in the set.
+- `bool Add(size_t i)`：add vertex i to the set.
+- `void Swap(ParallelBitset &other)`：exchange elements with another set of ParallelBitset.
+
+## 5.Vertex Array Class ParallelVector
+
+When using TuGraph for batch operations, you need to use an array of vertices to represent the result of processing vertices. ParallelVector implements the vertex array class. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 5.1.ParallelVector Class
+
+- `ParallelVector(size_t capacity)` Builds ParallelVector. capacity is the initial size of the vertex array
+- `T& operator[](size_t i)` : data with subscript i
+- `T \*begin()` : ParallelVector the starting pointer
+- `T \*end()` : ParallelVector the end pointer to Parallelvector. begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to access an array sequentially
+- `T&Back ()` : ParallelVector the last data
+- `T \*Data()` : represents the data in the array itself
+- `void Destroy()' : empty the ParallelVector array and delete the array
+- `size_t Size()` : indicates the number of data in ParallelVector
+- `size_t Capacity()` : indicates the capacity of ParallelVector
+- `void Resize(size_t size)` : Change ParallelVector to size, which must be greater than or equal to the size before the change
+- `void Clear()` : empty the data in ParallelVector
+- `void ReAlloc(size_t capacity)` : ParallelVector is allocated with new capacity. If data exists in the array, it is migrated to the new memory
+- `void Fill(T elem)` : Assign elem to all data on ParallelVector
+- `void Append(const T&elem, bool atomic = true)` : Add a piece of data at the end of ParallelVector
+- `void Swap(ParallelVector<t> &other)` : to exchange data with other parallelvectors</t>
+- `ParallelVector<t> Copy()` : copies the current ParallelVector data into the Copy array</t>
+
+## 6.Customize data structures
+
+### 6.1.Basic data types
+
+We customize the data structure representation of points and edges to save memory space while covering all vertices:
+
+- 'Empty' : indicates a special data type with empty content.
+
+### 6.2.Combining data structures
+
+In order to facilitate calculation, we define several data structures of point and edge data according to different calculation scenarios, which are as follows:
+
+- `EdgeUnit<edgedata>` : represents an edge of weight type EdgeData, used to parse the input file, and contains three member variables:</edgedata>
+- `size_t src` : the starting vertex of an edge
+- `size_t dst` : the end of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjUnit<edgedata>` : represents an edge of weight type EdgeData, used during batch computation, and contains two member variables:</edgedata>
+- `size_t neighbour` : indicates the neighbor vertex of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjList<edgedata>` : Adjacency list of vertices with weights of type EdgeData, often used to represent the set of incoming and outgoing edges of vertices and containing two member variables:</edgedata>
+- `AdjUnit<t> \* begin` : indicates the start pointer of the list</t>
+- `AdjUnit<t> \* end` : The end pointer of the list.</t> begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to loop through the adjacency list.
+
+## 7.Graph class OlapBase
+
+Graph class OlapBase is the main class for TuGraph to load graphs and calculate graphs. OlapBase is commonly used to represent graphs with weights of type EdgeData. See olap_base.hpp under lgraph folder for the code. This chapter covers the types and API interfaces commonly used in Graph classes. The classes used by the Procedure, Embed, and Standalone functions described above are all subclasses of this class.
+
+### 7.1.Basic Information
+
+- `size_t NumVertices()` : obtains the number of vertices
+
+- `size_t NumEdges()` : Gets the number of edges
+
+- `size_t OutDegree(size_t vid)` : indicates the outdegree of the vid of the vertex
+
+- `size_t InDegree(size_t vid)` : indicates the input degree of vertex vid
+
+### 7.2.node sets and edge sets and their related operations
+
+- `ParallelVector AllocVertexArray()` : Allocates an array of type VertexData with size as the number of vertices
+
+- `void fill_vertex_array(V \* array, V value)` : assigns values to all elements in the array
+
+- `ParallelBitset AllocVertexSubset()` : Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+
+- `AdjList OutEdges(size_t vid)'`: gets the set of all outgoing edges of vertex v
+
+- `AdjList InEdges(size_t vid)` : Obtains the set of all incoming edges of vertex v
+
+- `void Transpose()` : transpose of a directed graph
+
+- `LoadFromArray(char \* edge_array, VertexId input_vertices, EdgeId input_edges, EdgeDirectionPolicy (edge_direction_policy) `: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+`edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+`input_vertices`: specifies the number of vertices read into the graph by the array.
+
+`input_edges` : specifies the number of edges that the array reads into the image.
+
+`edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+### 7.3.Locking mechanism
+
+TuGraph implements a pair of locks to control the program's access to vertex data. Respectively is:
+
+- `void AcquireVertexLock(size_t vid)` : locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(size_t vid)` : unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+- `VertexLockGuard GuardVertexLock(size_t vid)` : When the vid operation is performed, the vertex vid is locked, and the lock is automatically released upon exiting the scope
+
+### 7.4.Batch Processing Operations
+
+TuGraph provides two batch operations to do a point-centered batch process in parallel. Respectively is:
+
+```c++
+/*
+    Function Name:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    The work function executes the work function on nodes whose numbers are between lower and upper in the Graph. The fourth parameter indicates the accumulated base, which defaults to 0.The fifth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+For details, please refer to include/lgraph/olap_base.h
+
+    Example: Count the number of vertices in the parent array that have outgoing edges
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+graph is the instantiated object of graph class OlapBase
+
+```C++
+/*
+    Function Name:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    Function: Execute the work function for the node that corresponds to 1 in active_vertices. The third parameter represents the cumulative cardinality, which is 0 by default.
+
+    The fourth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+
+    For specific implementation, please refer to the specific code in /include/lgraph/olap_base
+
+
+
+    Example: Output all the out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..6015d7e1ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,303 @@
+# OlapOnDB API
+
+> This document provides detailed instructions for using the OlapOnDB API
+
+## 1.Introduction
+
+Generally speaking, users need to implement the process of subgraph extraction by themselves. Then use the rich interface in TuGraph to implement your own graph analysis algorithm.
+
+This document mainly introduces the Procedure and Embed interface design, and introduces some common interface, specific interface information see include/lgraph/olap_on_db.h file.
+
+## 2.Schema
+
+Procedure and Embed auxiliary functions are mainly included in the OlapOnDB class, and some more frequently used functions will be introduced one by one
+
+OLAP is associated with the following common data structures in TuGraph:
+
+1. DB graph analysis class `OlapOnDB`
+
+2. Vertex array `ParallelVector`
+
+3. Vertex set `ParallelBitset`
+
+4. Side data structure `AdjUnit/AdjUnit`
+
+5. Edge collection data structure `AdjList`
+
+### 2.1.Snapshot Based Storage Structure
+
+The OlapOnDB class in TuGraph provides a data "snapshot," that is, a fully usable copy of a given data set that includes a mirror image of the corresponding data at a certain point in time (the point at which the copy was started). Because OLAP operations involve only reads and not writes, OlapOnDB arranges data in a more compact manner, saving space while improving data access locality.
+
+### 2.2.BSP Calculation Model
+
+TuGraph uses the BSP (Bulk Synchronous Parallel) model in the process of calculation, which makes the process can be executed in parallel, and greatly improves the efficiency of the program.
+
+The core idea of BSP calculation model is to propose and use Super Step. After OlapOnDB is created, the computation on this data is divided into multiple supersteps, such as PageRank, which is divided into multiple iterations, and each iteration is a Super Step. There is explicit synchronization between different Super Steps to ensure that all threads proceed to the next Super Step at the same time after completing the same superstep. Within a Super Step, all threads execute asynchronously, using parallelism to improve computational efficiency.
+
+BSP calculation model can effectively avoid deadlock, and achieve coarse-grained global synchronization in hardware mode by means of obstacle synchronization, so that graph computation can be executed in parallel, and programmers do not need to spend much time on synchronization mutual exclusion.
+
+## 3.Algorithm example
+
+Here is an explanation of the PageRank algorithm, which is mainly divided into the main function Process and the PageRank algorithm process function.
+
+### 3.1.Main function
+
+The main function has three input parameters, 'TuGraph' database parameter 'db', the request 'request' obtained from the web side, and the return value 'response' given to the web side. The overall process can be divided into the following steps:
+
+1. Obtain related parameters
+
+2. Create a snapshot class
+
+3. Main process of PageRank algorithm
+
+4. Obtain and send the return value of the web page
+
+```c
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+
+    // Obtain the number of iterations from web side requests (num_iterations)，
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // Read transaction creation and snapshot class creation
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+
+    // Create a pr array to store the pr value for each node
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank algorithm main process, obtain the pagerank value of each node
+    PageRankCore(olapondb, num_iterations, pr);
+
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        Function Purpose: Gets the number of the node with the largest pagerank among all nodes
+
+        Function flow description: This function executes Func A for node vi (also known as the active vertices) corresponding to all bits of 1 in the vertex set all_vertices. The return value of Func A is then used as the second input parameter of Func B to obtain the local maximum value (because the first input parameter is 0. So the return value is actually the pagerank value of each node). Finally, the return value of all threads is summarized, and Func B is executed again to get the global return value, and stored in the max_pr_vi variable
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+
+    // Retrieve and send the return value from the web page
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2.PageRank Algorithm process
+
+`pagerank` main process has two input parameters, snapshot class (subgraph) and iteration times, the overall process can be divided into the following steps:
+
+1. Initialization of related data structures
+2. Initialize the pagerank value of each node
+3. Calculation of pagerank value of each node, active vertices for all vertices (means that all vertices need to calculate pagerank value)
+4. Obtain the pagerank value after 'num_iterations' of each node
+
+```c
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+
+    // Initialization of related data structures
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // The initialization of the pagerank value of each node is inversely proportional to the degree of the node
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // Total iteration process
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            Function Purpose: Calculates the pagerank of all nodes
+
+            Function flow description: This function is used to calculate the pagerank value of all nodes. Execute Func C on node vi corresponding to all the bits of 1 in all_vertices to obtain the pagerank value of vi in the current iteration and return the pagerank change value of vi node. The total change value of all active nodes is finally summarized and returned through the internal processing of the function, which is stored in the delta variable
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // Gets the pagerank value of the current node from its neighbor
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank value calculation core formula
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+
+                    // Statistics of relevant intermediate variables
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // The pagerank value obtained in this iteration is output as the input of the next iteration
+        curr.Swap(next);
+    }
+}
+```
+
+### 4.1.Transaction creation
+
+```c
+// Create a read transaction
+auto txn = db.CreateReadTxn();
+
+// Write transaction creation
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2.Parallelization to create a directed graph
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3.Create undirected graphs in parallel
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED;
+)
+```
+
+### 4.4.Obtain the output degree
+
+```c
+size_t OutDegree(size_t vid)
+```
+
+### 4.5.Obtain the input degree
+
+```c
+size_t InDegree(size_t vid)
+```
+
+### 4.6.Gets the outgoing edge set
+
+```c
+/*
+    Function name: AdjList OutEdges(size_t vid)
+
+    Data structure:
+
+    An AdjList can be understood as an array of structures of type AdjUnit
+
+    AdjUnit has two member variables: 1. size_t neighbour 2. edge_data: neighbour indicates the number of the target node pointed by the outgoing edge. If the value is a licensed graph, the data type of edge_data is the same as the weight value of the edge in the input file
+
+    Example Output all outgoing neighbors of node vid
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7.Gets the incoming edge set
+
+```c
+AdjList<edgedata> InEdges(size_t vid)</edgedata>
+
+// Example: Outputs all inbound neighbors of node vid
+for (auto & edge : olapondb.InEdges(vid)) {
+size_t dst = edge.neighbour;
+printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8.Get the node ID of OlapOnDB corresponding to the node in TuGraph
+
+```c
+size_t OriginalVid(size_t vid)
+
+// Note: The node numbers entered in TuGraph can be non-numbers, such as names. When OlapOnDB subgraphs are generated, names and other names will be converted to numbers for subsequent processing. Therefore, this method may not be applicable to some specific scenarios
+```
+
+### 4.9.Gets the node number of TuGraph corresponding to a node in OlapOnDB
+
+```c
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10.Description of active vertices
+
+Active vertices refer to the vertices that need to be processed in the batch function. In this example, we simply output the number of active vertices and summarize the number of active vertices:
+
+```c
+ParallelBitset temp = 000111; // The current active vertices are vertices 3, 4 and 5
+
+size_t delta = ForEachActiveVertex<double>(</double>
+//void c
+[&](size_t vi) {
+printf("active_vertexId = %lu\n",vi);
+return 1;
+},
+all_vertices
+);
+```
+
+The result of this function is obvious. Because of multiple threads, the output order may vary:
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+The local return value is 1. This function will add all the local return values in a thread-safe manner to the final return value, which is stored in the delta variable, and the final value is 3
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..bb3c784f13
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,213 @@
+# OlapOnDisk API
+
+> This document mainly introduces the usage instructions of OlapOnDisk API in detail
+
+## Table of contents
+
+- [1. Introduction](#1introduction)
+- [2. Algorithm Example](#2algorithm-example)
+     - [2.1 header files](#21head-file)
+     - [2.2 Configuration class MyConfig](#22configuration-class-myconfig)
+     - [2.3 Main function](#23main-function)
+     - [2.4 bfs algorithm flow](#24bfs-algorithm-process)
+- [3. Function description of other commonly used functions](#3description-of-other-commonly-used-functions)
+     - [3.1 Image Loading](#31graph-load)
+     - [3.2 Image writing](#32graph-write)
+     - [3.3 Graph Analysis Function](#33graph-parse-function)
+    
+### 1.Introduction
+
+The Standalone mode of TuGraph can be used to load graph data files, where the sources of graph data files can include text files, BINARY_FILE binary files, and ODPS sources. In this mode, TuGraph can quickly load multiple data sources into a graph, and then run iterative algorithms such as BFS, WCC, SSSP, etc. on the graph, and output the final result to the terminal.
+
+In TuGraph, the export and calculation process can be accelerated through parallel processing in memory, so as to achieve near real-time processing and analysis. Compared with traditional methods, it avoids the overhead of data export and storage, and can use compact Graph data structures achieve desirable performance for computation.
+
+TuGraph has built-in a large number of common graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement the specific graph calculation process by themselves. They only need to include the header file (.h) of the corresponding algorithm library when implementing their own stored procedures. To your own program, and link your own dynamic library files in the compilation phase.
+
+This document mainly introduces the common interfaces of Standalone, and the auxiliary functions used are mainly contained in the OlapOnDB class. At the same time, in order to help users understand and facilitate, the BFS algorithm is illustrated with examples.
+
+### 2.Algorithm example
+
+Here, the BFS algorithm is explained in blocks, which are roughly divided into the main function `main`, the BFS algorithm process `BFSCore` function and the configuration class MyConfig.
+
+#### 2.1.Head file
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //Header files to include when using TuGraph
+#include "./algo.h"   //A header file containing various algorithmic logic functions
+```
+
+When using TuGraph to realize the calculation application of graph data files, generally, the StandaloneGraph class object graph is first created, the graph file data is loaded into the graph, and then the graph calculation process is realized by calling the graph logic function, and finally the result of the graph calculation is printed out.
+
+#### 2.2.Configuration class MyConfig
+
+The MyConfig configuration class function is used to provide the configuration information required for the algorithm logic calculation, inherited from ConfigBase<EdgeData>, where EdgeDate can choose Empty (unweighted graph), int (the weight of the weighted graph is an integer) or double (the weight of the weighted graph is double) type.
+
+The MyConfig configuration class generally depends on the algorithm, and additional configuration information is required as follows:
+
+1. Parameters required by the algorithm
+2. Algorithm name
+3. Configure the Print function in the class
+Other common members inherit from ConfigBase, please refer to src/olap/olap_config.h for reference.
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // The parameters required by the algorithm are initialized
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // The configuration file accepts command line parameters. This use case will sequentially read the parameters when calling the algorithm from the command line. The value specified by the user is preferred. If the user does not specify it, the default parameter is selected.
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+#### 2.3.main function
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // Statistical memory consumption class MemUsage instantiation
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // Configuration class MyConfig instantiation
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk class instantiation
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // Statistical graph loading time consumption
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // Create an array to count whether a node has been traversed
+    auto parent = graph.AllocVertexArray<size_t>();
+    // Breadth-first search algorithm, returns the number of nodes connected to the root_vid root node in the graph
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // Print relevant information to the terminal
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+#### 2.4.bfs algorithm process
+
+The main process of `bfs` has two input parameters, the snapshot class (subgraph) and the number of iterations. The overall process can be divided into the following steps:
+
+1. Relevant definitions and initialization of data structures
+2. Use the batch function to perform cyclic calculations on each node, find all nodes adjacent to the current node in each round, and exchange them when the round ends.
+3. Until all nodes are found, return the number of nodes discovered_vertices.
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //Allocate an array, active_in is used to store the nodes found in the previous cycle stage
+  active_in.Add(root);            //Add the root node to the array
+  auto active_out = graph.AllocVertexSubset();  //Allocate the array active_out to store the nodes found in the current cycle stage
+  parent.Fill((size_t)-1);               //Assign a value of -1 to the node in the parent array, -1 means not found
+  parent[root] = root;
+  size_t num_activations = 1;       //Indicates the number of nodes found in the current loop phase
+  size_t discovered_vertices = 0;    //Indicates the total number of nodes found in the current cycle phase
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations indicates the number of nodes found in the current loop phase
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices indicates the total number of nodes found in the current cycle phase
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //Each cycle starts from the root node, finds adjacent adjacent nodes, changes its parent value, and operates num_activations+1
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //Store the nodes found in the current loop phase
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // return all nodes
+  return discovered_vertices;
+}
+```
+
+### 3.Description of other commonly used functions
+
+#### 3.1.Graph load
+
+TuGraph-StandaloneThe loading sources of graph data files are mainly divided into three categories: text files, binary files, and ODPS. The binary file is a file in which the binary representation of the edge data is arranged in order, which can save a lot of storage space. Its loading function is divided into three types, namely:
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：The loading method of the graph data file contains two parameters, and their meanings represent respectively
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `edge_direction_policy`：Specifies whether the graph is directed or undirected, including three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. Among them, DUAL_DIRECTION is the default graph loading method.
+  DUAL_DIRECTION : The input file is an asymmetric graph and the loaded graph is an asymmetric graph.
+  MAKE_SYMMETRIC : The input file is an asymmetric graph and the loaded graph is a symmetric graph.
+  INPUT_SYMMETRIC : The input file is a symmetric graph and the loaded graph is a symmetric graph.
+  For details, see `enum EdgeDirectionPolicy` in the olap_config.h file under the lgraph folder.
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：Load the vertices in the file into an array in the order of their ids. The meanings of each parameter are:
+  - `array`：array of data to be read
+  - `path`：The path to read the file, each line in the file represents a pair of vertex
+  - `parse_line`：A user-defined function that tells the system how to parse a line of text data into a vertex pair.
+
+
+#### 3.2.Graph write
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：Write the data in the array back to the file, and the meanings of each parameter are:
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `array`：array of data to be written
+  - `array_size`：The length of the number of data to be written
+  - `name`：algorithm name
+  - `filter_output`：Write data rule function, the data to be written needs to meet the requirements of this function.
+
+#### 3.3.graph parse function
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：Parse the graph data file, and load the graph as an unweighted graph.
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：Parse the graph data file, load the graph as a weighted graph, and specify the weight data type by modifying <EdgeData>.
+
+This function can be specified through the constructor parse_line when the MyConfig class is defined.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md
new file mode 100644
index 0000000000..c51987fac4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/5.python-api.md
@@ -0,0 +1,447 @@
+# Python Olap API
+
+> This document mainly introduces the API usage of OlapBase OlapOnDB and OlapOnDisk in Python
+
+## Table of contents
+- [1.Overview](#1-overview)
+- [2.Configuration Requirements](#2-configuration-requirements)
+- [3.Cython](#3-cython)
+- [4.Olap API](#4-olap-api)
+    - [4.1. Atomic operations](#atomic-operations)
+    - [4.2. Vertex collection class ParallelBitset](#vertex-collection-class-parallelbitset)
+    - [4.3. Vertex array class ParallelVector](#vertex-array-class-parallelvector)
+    - [4.4. Custom data structure](#custom-data-structure)
+    - [4.5.Graph class OlapBase](#graph-class-olapbase)
+    - [4.6. Graph Class OlapOnDB](#graph-class-olapondb)
+    - [4.7.Graph class OlapOnDisk](#graph-class-olapondisk)
+- [5.lgraph DB API](#5-lgraph_db-api)
+- [6.Algorithm plugin example](#6-algorithm-plug-in-example)
+
+## 1 Overview
+
+This manual will introduce the simple configuration required to use the Python interface of the TuGraph graph computing system, and explain the TuGraph Python API in conjunction with the code. For details about the functions of class ParallelBitset, OlapBase, etc., see olap-base-api.md, olap-on-db-api.md and olap-on-disk-api.md.
+
+## 2. Configuration requirements
+
+If you want to use TuGraph to write and compile your own applications, the required configuration requirements are:
+
+- Linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+- A compiler that supports C++17 requires GCC version 5.4.1 or later.
+- Cython, version 3.0a1 or above is required, and the tested version is 3.0.0a11
+
+## 3. Cython
+Cython is an efficient programming language that is a superset of Python. Cython can translate .py files into C/C++ codes and compile them into Python extension modules, which can be called through import in Python. In TuGraph, all Python procedures are compiled into Python extension modules by Cython and then used.
+
+The main advantage of using Cython is that it combines the simplicity and ease of use of Python with the performance of C/C++. The TuGraph Python interface is implemented using Cython.
+
+[Cython Documentation](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+The Olap API is used for graph computing and is implemented in C++. The usage and functions are basically the same as the C++ interface. To use the API in a Python file, the interfaces declared in procedures/algo_cython/olap_base.pxd must be imported using `cython.cimports.olap_base import *`. The Python file can only be run after being compiled by Cython.
+
+### Atomic operations
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`: If the value pointed to by ptr is equal to oldv, assign the value pointed to by ptr to newv and return True, otherwise return False.
+- `write_min[T](a: cython.pointer(T), b: T)->cython.bint`: If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_max[T](a: cython.pointer(T), b: T)->cython.bint`: If b is greater than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_add[T](a: cython.pointer(T), b: T)->cython.bint`: Add the value of b to the value pointed to by a.
+- `write_sub[T](a: cython.pointer(T), b: T)->cython.bint`: Subtract the value pointed to by a from the value of b.
+
+### Vertex collection class ParallelBitset
+- `Size() -> size_t`: Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size: size_t)`: Initializes size and data, where the length of data is (size >> 6) + 1.
+- `Clear() -> cython.void`: Empties the collection.
+- `Fill() -> cython.void`: Adds all vertices to the set.
+- `Has(i: size_t) -> cython.bint`: Checks if vertex i is in the set.
+- `Add(i: size_t) -> cython.bint`: Adds vertex i to the set.
+- `Swap(other: ParallelBitset) -> cython.void`: Exchanges elements with another ParallelBitset set.
+
+### Vertex array class ParallelVector
+- `ParallelVector[T](size_t capacity)`: Constructs a ParallelVector, where capacity is the initial capacity of the vertex array.
+- `operator[](i: size_t) -> T`: Returns the data at index i.
+- `begin() -> cython.pointer(T)`: Returns the start pointer of ParallelVector.
+- `end() -> cython.pointer(T)`: Returns the end pointer of ParallelVector. The usage of begin() and end() is similar to the begin and end pointers of the vector container, and these two pointers can be used to sequentially access the array.
+- `Back() -> T`: Returns the last data of ParallelVector.
+- `Data() -> cython.pointer(T)`: Indicates the data of the array itself.
+- `Destroy() -> cython.void`: Clears the data in the ParallelVector array and deletes the array.
+- `Size() -> size_t`: Indicates the number of data in ParallelVector.
+- `Resize(size: size_t) -> cython.void`: Changes ParallelVector to size, which should be greater than or equal to the size before the change and less than capacity.
+- `Clear() -> cython.void`: Clears the data in ParallelVector.
+- `ReAlloc(capacity: size_t) -> cython.void`: Allocates a new capacity size to ParallelVector. If the array has data, it migrates the data to the new memory.
+- `Fill(elem: T) -> cython.void`: Assigns elem to all data of ParallelVector.
+- `Append(elem: T, atomic: cython.bint = true) -> cython.void`: Adds a data to the end of ParallelVector.
+- `Swap(other: ParallelVector[T]) -> cython.void`: Exchanges data with another ParallelVector.
+- `Copy() -> ParallelVector[T]`: Copies the current ParallelVector data and stores it in the copy array.
+
+
+### Custom Data Structure
+- `Empty`: A special data type whose content is empty.
+- `EdgeUnit[EdgeData]`: Indicates the edge whose weight type is EdgeData, used to parse the input file, including three member variables:
+    - `src: size_t`: starting vertex of the edge
+    - `dst: size_t`: end of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjUnit[EdgeData]`: indicates the edge whose weight type is EdgeData, which is used in the batch calculation process and contains two member variables:
+    - `neighbor: size_t`: neighbor vertex of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjList[EdgeData]`: The adjacency list of vertices whose weight type is EdgeData, often used to represent the set of incoming and outgoing edges of vertices, including three member functions:
+    - `begin()->cython.pointer(AdjUnit[T])`: the starting pointer of the list
+    - `end()->cython.pointer(AdjUnit[T])`: the end pointer of the list
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: the data whose subscript is i
+
+### Graph class OlapBase
+- `NumVertices()->size_t`: get the number of vertices
+- `NumEdges()-> size_t`: get the number of edges
+- `OutDegree(vid: size_t)-> size_t`: out-degree of vertex vid
+- `InDegree(vid: size_t)->size_t`: in-degree of the vertex vid
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`: Allocates an array of type VertexData with size as the number of vertices
+- `AllocVertexSubset()-> ParallelBitset`: Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all outgoing edges of vertex v
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all incoming edges of vertex v
+- `Transpose()->cython.void`: transpose of a directed graph
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+    - `edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+    - `input_vertices`: specifies the number of vertices read into the graph by the array.
+
+    - `input_edges` : specifies the number of edges that the array reads into the image.
+
+    - `edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`: locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`: unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+
+TuGraph provides two batch operations to perform point-centric batch processing in parallel, which is slightly different from C++ in Python.
+
+```python
+# Function name: ProcessVertexInRange[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# lower: size_t, upper: size_t,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Executes the work function on nodes whose node numbers are between lower and upper in the Graph. The fourth parameter indicates the base of accumulation, which is 0 by default.
+# The fifth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in include/lgraph/olap_base.h
+#
+# Example usage: Count the number of vertices with edges in the parent array.
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython.pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+g is the instantiated object of graph class OlapBase
+
+```python
+# Function name: ProcessVertexActive[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# active: ParallelBitset,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Execute the work function on the nodes corresponding to 1 in the active_vertices bitset. The third parameter indicates the base of accumulation, which is 0 by default;
+# The fourth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in /include/lgraph/olap_base.h
+#
+# Usage example: Output all out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes.
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self. graph. OutDegree(vi)
+        dst: size_t
+        edges = self. graph. OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbor
+            printf("node %lu has neighbor %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+As shown in the above two examples, ProcessVertexActive and ProcessVertexInRange in Python require an additional algorithm class pointer parameter compared to their C++ counterparts. The Work function is generally used as a member function of the algorithm class to access member variables, such as in the graph and ParallelVector parent examples shown above. When calling the batch function, the Work function and the self pointer of the algorithm class are passed to the batch function.
+
+The Work function will be called in multiple threads, so the @cython.nogil decorator is added to release the Python global interpretation lock. In code executed by multiple threads, such as the Work function in the batch function, variables are better declared as C/C++ types using `dst: type` or `dst = cython.declare(type)`. This is because Python objects cannot be used in multi-threaded code.
+
+### Graph class OlapOnDB:
+Parallelize to create a directed graph:
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+Parallelize to create an undirected graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING creates a directed graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### Graph class OlapOnDisk
+
+#### ConfigBase:
+- `ConfigBase()`: Constructor
+- `std::string input_dir`: graph edge table data path
+- `std::string output_dir`: output path
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: read in graph data
+
+## 5. lgraph_db API
+Please refer to the files procedures/algo_cython/lgraph_db.pxd and lgraph_db_python.py for the lgraph_db API.
+
+The usage and functions of the interface in lgraph_db.pxd are basically the same as the C++ interface. The interface declared in lgraph_db.pxd is implemented in C++. In the py file, it must be imported by `cython.cimports.olap_db import *` and compiled by the Cython file to run.
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: Get the vid of the vertex
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: constructor, dir_path is the db path
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: set user
+- `SetUser(user: std::string)-> cython.void`: set user
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: create GraphDB
+
+### GraphDB:
+- `CreateReadTxn()-> Transaction`: create a read-only transaction
+- `CreateWriteTxn()-> Transaction`: create a write transaction
+- `ForkTxn(txn: Transaction)-> Transaction`: Copy transactions, only read transactions can be copied
+
+### Transaction:
+```
+GetVertexIndexIterator(
+                 label: std::string,
+                 field: std::string,
+                 key_start: std::string,
+                 key_end: std::string) -> VertexIndexIterator
+```
+Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v
+
+
+
+lgraph_db_python.py packages the C++ classes Galaxy and GraphDB from lgraph_db.pxd as Python classes. After compiling lgraph_db_python.py into a Python extension, you can directly access it in a Python file or from the Python command line by importing it with `import lgraph_db_python`.
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: constructor, dir_path is the db path
+- `SetCurrentUser(self, user: str password: str)-> void`: set user
+- `SetUser(self, user: std::string)-> void`: set user
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: create PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)->cython.Py_ssize_t`: address of C++ class GraphDB
+
+## 6. Algorithm plug-in example
+The following is a code example of the BFS algorithm implemented in Python:
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# Comments work as follows:
+# language_level=3: use Python3
+# cpp_locals=True: C++17 is required, and std::optional is used to manage C++ objects in Python code, which can avoid copy construction of C++ objects
+# boundscheck=False: Turn off bounds checking for indexes
+# wraparound=False: Turn off the processing of negative subscripts (similar to Python List)
+# initializedcheck=False: Turn off checking whether the memory is initialized, and the running performance will be faster after turning off the check
+# language = c++: translate this .py file to C++ instead of C file. TuGraph uses a lot of template functions, so C++ should be used
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# From procedures/algo_cython/ cimportolap_base.pxd and lgraph_db.pxd, similar to #include "xxx.h" in C++
+
+from cython.cimports.libc.stdio import printf
+# Similar to #include <stdio.h> in C++
+# Other common ones include cython.cimports.libcpp.unordered_map, etc.
+
+import time
+import lgraph_db_python
+
+@cython.cclass
+# cython.cclass indicates that BFSCore is a C-type Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty]) indicates the pointer of OlapBase[Empty], similar to OlapBase[Empty]* in C++
+    # Cython provides common types of pointers, such as cython.p_int, cython.p_char, etc.
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t declares root as a C++ size_t type variable, equivalent to root = cython.declare(size_t)
+    # Variables that do not declare a type are Python object types
+    # Declaring variable types will greatly improve performance, and in the multi-threaded part, only C/C++ type variables can be accessed
+
+    @cython.cfunc
+    # cython.cfunc indicates that Work is a C-type function, and the parameters and return values should be declared
+    # cfunc has good performance and can accept C/C++ objects as parameters and return values, but it cannot be called in other python files
+    # Similar to cython.ccall, such as Standalone function, which can be called in other python files
+    @cython.nogil
+    # cython.nogil means to release the Python global interpretation lock. In the part modified by nogil, Python objects cannot be accessed
+    # In the multi-threaded part, there should be nogil decorator
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) means that exception propagation is disabled, and Python exceptions raised inside the function will be ignored
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbor
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 means that dst has not been visited by bfs
+                if self.active_out.Add(dst):
+                    # Set dst as an active node; ParallelBitmap.Add is an atomic operation to prevent double calculation
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython. size_t:
+        self. graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self. parent. Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self. active_in. Add(self. root)
+        while num_activations > 0:
+            self. active_out. Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self. active_out. Swap(self. active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time. time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # Create OlapOnDB in parallel
+    # Cython does not support dereference operations such as *db, use db[0] to dereference
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # Get the iterator of the root node through GetVertexIndexIterator based on the root node label name, field name and field value (root_id),
+    # and get the vid through the iterator. When there is no ID_MAPPING, the vid is the same as the id in OlapOnDB
+    cost = time. time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time. time()
+    count = a. run(cython. address(olapondb), root_vid)
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb. NumVertices()
+    response["num_edges"] = olapondb. NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone is the plug-in entry in Standalone mode, modified with cython.ccall
+    # You can set parameters arbitrarily, and modify procedures/algo_cython/run_standalone.py accordingly
+    cost = time. time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config is a C++ class, config.input_dir is std::string, Python str needs to be encoded to be passed to std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # read in graph
+    cost = time. time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time. time()
+    a = BFSCore()
+    count = a. run(cython. address(graph), root)
+    # cython.address(graph), address, similar to &graph in C++
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices". format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process is the plug-in entry in embed mode and procedure mode, modified with cython.ccall
+    # The Process function must be named Process, and the parameters are lgraph_db_python.PyGraphDB and bytes
+    # The return value must be (bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # Get the address of the GraphDB object in the PyGraphDB, convert it to a pointer and pass it
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..e496945495
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
@@ -0,0 +1,191 @@
+# TuGraph Built-in Algorithm Description
+
+> This document mainly introduces the TuGraph built-in algorithm program in detail, the community version of 6 algorithms can refer to the basic algorithm newspaper
+
+## 1.Introduction
+
+TuGraph currently contains the following 6 basic algorithms and 28 extended algorithms, a total of 34 graph algorithms:
+
+### 1.1.Basic algorithms:
+
+|    Algorithm name            | The program name |
+| :--------------------------: | :--------------: |
+|     Breadth-First Search     |       bfs        |
+|           Pagerank           |     pagerank     |
+| Single-Source Shortest Path  |       sssp       |
+| Weakly Connected Components  |       wcc        |
+| Local Clustering Coefficient |       lcc        |
+| Label Propagation Algorithm  |       lpa        |
+
+### 1.2.Extended algorithms:
+
+|            Algorithm name                    |   The program name   |
+| :------------------------------------------: | :------------------: |
+|            All-Pair Shortest Path            |         apsp         |
+|            Betweenness Centrality            |          bc          |
+|              Belief Propagation              |          bp          |
+|             Closeness Centrality             |          clce        |
+|             Common Neighborhood              |          cn          |
+|              Degree Correlation              |          dc          |
+|             Dimension Estimation             |          de          |
+|                    EgoNet                    |          en          |
+|        Hyperlink-Induced Topic Search        |         hits         |
+|                Jaccard Index                 |          ji          |
+|                    K-core                    |        kcore         |
+|                   Louvain                    |       louvain        |
+|        Multiple-source Shortest Paths        |         mssp         |
+|            Personalized PageRank             |         ppr          |
+|        Strongly Connected Components         |         scc          |
+| Speaker-listener Label Propagation Algorithm |         slpa         |
+|          Single-Pair Shortest Path           |         spsp         |
+|              Triangle Counting               |       triangle       |
+|                  Trustrank                   |      trustrank       |
+|     Weighted Label Propagation Algorithm     |         wlpa         |
+|         Weighted Pagerank Algorithm          |      wpagerank       |
+|           Maximal independent set            |         mis          |
+|                  Sybil Rank                  |      sybilrank       |
+|             Subgraph Isomorphism             | subgraph_isomorphism |
+|                    Motif                     |        motif         |
+|                   Kcliques                   |       kcliques       |
+|                    Ktruss                    |        ktruss        |
+|                    Leiden                    |        leiden        |
+
+## 2.Basic algorithms
+
+### 2.1.Breadth-First Search
+
+Breadth first Search implements the Breadth-first Search algorithm, which starts from the root vertex and traverses all accessible vertices along the width of the graph. Returns the number of vertices traversed. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 2.2.Pagerank
+
+Web page sorting program to achieve the commonly used Pagerank algorithm. The algorithm calculates the importance ranking of all vertices according to the edge and edge weight in the graph. The higher the PageRank value, the higher the importance of the vertex in the graph. The reciprocal of the number of vertices is used as the initial Rank value of each vertex, and then the Rank value of the vertices is transferred to the adjacent vertices on average according to the outgoing edges, and the transfer process is repeated until the given convergence threshold is met or the given number of iterations is reached. At the end of each pass round, a certain proportion of the Rank values of all vertices will be randomly transferred to any vertex. Please refer to the algorithm content [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 2.3.Single-Source Shortest Path
+
+The Single Source Shortest Path algorithm realizes the Single Source Shortest Path algorithm. It calculates the shortest path length from a given source vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 2.4.Weakly Connected Components
+
+The program of Weakly Connected Components has implemented the algorithm. It can calculate all the weakly connected components in the graph. A weakly connected component is a subgraph of a graph in which reachable paths exist between any two points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Connected*component*(graph_theory)](<https://en.wikipedia.org/wiki/Connected_component_(graph_theory)> "scc wiki")。
+
+### 2.5.Local Clustering Coefficient
+
+The average Clustering Coefficient program implements the Local Clustering Coefficient algorithm to calculate the coefficient of the degree of clustering between vertices in the graph. The returned results include the overall clustering coefficient and the vertex clustering coefficient. The overall agglomeration coefficient reflects the evaluation of the overall agglomeration degree in the graph, and the vertex agglomeration coefficient includes the agglomeration coefficient of any vertex, which reflects the agglomeration degree near the vertex. The higher the agglomeration coefficient, the higher the agglomeration degree. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 2.6.Label Propagation Algorithm
+
+The program implements Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and computes unauthorised graphs. In label passing, each vertex adds up all the labels received, and randomly selects one of the labels with the highest sum. The iteration converges or the algorithm terminates after a given number of rounds. The final output is a label for each vertex, and vertices with the same label value are considered to be in the same community. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+## 3.Extended algorithms
+
+### 3.1.All-Pair Shortest Path
+
+The All-Pair Shortest Path program realizes the all-pair Shortest Path algorithm and calculates the shortest path between any two points in the graph. Returns the shortest path length between any pair of vertices where the path exists. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 3.2.Betweenness Centrality
+
+Betweenness Centrality algorithm is implemented in Betweenness centrality program to estimate the betweenness centrality value of all vertices in a graph. The value of intermediate centrality reflects the possibility that any shortest path in the graph passes through the vertex, and the higher the value, the more shortest paths pass through the vertex. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 3.3.Belief Propagation
+
+The Belief Propagation algorithm is implemented in the confidence propagation program. Given the edge distribution of the observed vertices, the algorithm estimates the edge distribution of the unobserved vertices by using the mechanism of passing messages among vertices. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 3.4.Closeness Centrality
+
+The Distance Centrality program implements the Closeness Centrality algorithm, which estimates the average shortest path length from any node to other nodes in the graph. A smaller distance centrality value indicates that the node has a smaller average shortest distance to other nodes, meaning it is more centrally located in the graph from a geometric perspective. The calculation requires specifying the number of sampling points, and the algorithm computes the centrality values for each of these sampling points. For the algorithm content, please refer to [https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki").
+
+### 3.5.Common Neighborhood
+
+The Common Neighborhood program implements the common Neighborhood algorithm to count the number of common neighbors between any given pair of neighboring vertices. Given several pairs of vertices to be queried, the result is the number of common neighbors of any pair of vertices to be queried.
+
+### 3.6.Degree Correlation
+
+The Degree Correlation algorithm is implemented in the degree correlation program. It calculates the degree correlation degree of a graph by calculating the Pearson correlation coefficient between any adjacent vertex pairs, which can be used to characterize the correlation degree between high-degree vertices in the graph. A higher degree of correlation indicates a higher degree of correlation between vertices of higher degree in the graph. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 3.7.Dimension Estimation
+
+The diameter Estimation program implements the Dimension Estimation algorithm. The algorithm calculates the length of the longest shortest path in the graph, which is used to characterize the diameter of the graph. Please refer to the algorithm content[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### 3.8.EgoNet
+
+The EgoNet algorithm requires a given root vertex and K value, and takes the root vertex as the source vertex to conduct a width-first search to find the subgraph composed of all neighbors within K degrees. The found subgraph is called the EgoNet of the root vertex.
+
+### 3.9.Hyperlink-Induced Topic Search
+
+The Hyperlink Topic Search algorithm implements the Hyperlink-induced topic search algorithm, which assumes that each vertex has two attributes: Authority and Hub. A good hub vertex should point to many vertices with high authority. And a good authority vertex should be pointed to by many vertices of high pivot type. The algorithm returns the authority value and the hub value for each vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 3.10.Jaccard Index
+
+The Jaccard coefficient program implements the Jaccard Index algorithm. The algorithm calculates the Jaccard coefficient between a given pair of vertices, which can be used to represent the similarity of the two vertices. A higher Jaccard coefficient indicates a higher degree of similarity between pairs of vertices. Given several pairs of vertices with the query, the Jaccard coefficients of these pairs are returned. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### 3.11.K-core
+
+k accounting method implements k-core algorithm. The algorithm computes the number of kernels of all vertices, or finds all K-nucleon graphs in the graph. K-nucleon graph is a special subgraph in which the degree of any vertex is not less than a given K value. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Degeneracy\_(graph_theory)](<https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)> "kcore wiki")。
+
+### 3.12.Louvain
+
+The Louvain community discovery program implements the Fast-unfolding algorithm. The algorithm is a community discovery algorithm based on modularity. It maximizes the modularity of the graph by constantly merging vertex communities, and can discover the hierarchical community structure. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 3.13.Multiple-source Shortest Paths
+
+The multisource Shortest Paths program implements the multiple-source Shortest Paths algorithm to calculate the shortest path value to any vertex from the given Multiple source vertices. Where, the shortest path value of multiple source vertices to a vertex is the minimum value of the shortest path from each source vertex to the vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 3.14.Personalized PageRank
+
+Personalized web ranking program has Personalized PageRank algorithm. According to the given source vertex, the algorithm calculates the importance ranking of all vertices to the source vertex based on the source vertex. The higher the Rank value, the more important the vertex is to the source vertex. Unlike PageRank, the source vertex Rank value is 1, the rest of the vertex Rank value is 0; And a certain proportion of Rank value will be immediately transferred back to the source vertex after each round of transmission. Please refer to the algorithm content [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 3.15.Strongly Connected Components
+
+Strongly Connected component program realizes the Strongly Connected Components algorithm. The algorithm computes all strongly connected components of the graph, which is a subgraph of the graph that can start from any vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 3.16.Speaker-listener Label Propagation Algorithm
+
+The program realizes the Speaker-listener Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and historical tag record, which is an extension of tag propagation algorithm. Different from the label propagation algorithm, this algorithm records the historical labels of all vertices. When the labels are accumulated in the iteration, the historical labels are also counted. The final output is all the historical label records for each vertex. Please refer to the paper for the algorithm content:“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 3.17.Single-Pair Shortest Path
+
+The program of the shortest path between two points implements the Bidirectional point-first Search algorithm. It searches forward width First along the outgoing edge from the starting point and reverse width first along the incoming edge from the end point on the directed undirected graph. The shortest path length from the starting point to the ending point is determined by traversing the vertices of the starting point and the ending point together. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 3.18.Triangle Counting
+
+The Triangle-counting algorithm is implemented to calculate the number of triangles in an undirected graph, which can be used to characterize the correlation degree of the vertices in the graph. The higher the number of triangles, the higher the degree of correlation of the vertices in the graph. For the algorithm content, please refer to the paper, "Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study".
+
+### 3.19.Trustrank
+
+The Trust Index Sorting Algorithm implements the Trustrank algorithm, which can calculate the Trust Index of any vertex based on a given whitelist. The higher the trust score, the less likely the vertex is to be illegal. Please refer to the algorithm content for details. [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 3.20.Weighted Label Propagation Algorithm
+
+Weighted Label Propagation Algorithm is implemented in the program. = Different from the label propagation algorithm, the label transmission is related to the weight of the edge. During label transmission, the weight of each vertex will be accumulated according to the incoming edge of the label, and the label with the highest sum will be randomly selected. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 3.21.Weighted Pagerank Algorithm
+
+Weighted Pagerank is implemented in the weighted Pagerank algorithm. Different from PageRank algorithm, the transfer of Rank value is related to the weight of the edge. The Rank value of the vertex will be transferred to the adjacent vertices according to the weight of the edge. Please refer to the algorithm content[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 3.22.Maximal independent set
+
+Maximal independent set algorithm implements Maximal Independent Set algorithm. A maximum independent set means that there are no vertices outside the independent set that can join it. A graph may have many MIS that vary greatly in size, and the algorithm finds one of them. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### 3.23.Sybil Rank
+
+Sybil detection algorithm implements Sybil Rank algorithm. The SybilRank algorithm starts from non-Sybil nodes and performs a random walk with premature termination. Please refer to the paper for the algorithm content:“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 3.24.Subgraph Isomorphism
+
+The subgraph matching algorithm implements the subgraph_isomorphism algorithm. The subgraph_isomorphism algorithm matches all nodes in the whole graph and outputs the number of times each node is matched. Algorithm Content Reference [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 3.25.Motif
+
+Pattern matching algorithm implements motif algorithm. motif algorithm matches k-order subgraphs for the specified nodes, and finally outputs the number of each kind of K-order subgraphs for each specified node. Each K-order subgraph is represented by a 64-bit integer, and the $i \times k + j$bit is 1, indicating that there is an edge i->j in the subgraph. Algorithm Content Reference [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### 3.26.Kcliques
+
+The K-order clique counting algorithm implements the k-cliques algorithm. The k-cliques algorithm calculates the number of all K-order complete subgraphs in the graph, and finally outputs the number of k-order complete subgraphs of each node. Algorithm Content Reference [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### 3.27.Ktruss
+
+The k-order truss counting algorithm implements the k-truss algorithm. A k-truss is a subgraph in which each edge is the edge of at least k-2 triangles. The k-truss algorithm finds out the k-truss subgraph of the graph, and finally outputs the neighbor node list of each node in the subgraph. Algorithm Content Reference[https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+
+### 3.28.Leiden
+
+Leiden algorithm implements Leiden's algorithm. leiden algorithm is a community discovery algorithm based on modularity. Compared with louvain algorithm, leiden algorithm has the advantage that Leiden algorithm detects the broken links in the community to ensure that each community has good connectivity. Algorithm Content Reference [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/index.rst
new file mode 100644
index 0000000000..dc955b3b91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/2.olap/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
new file mode 100644
index 0000000000..47c814d627
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
@@ -0,0 +1,337 @@
+# TuGraph Stored Procedure Guide
+
+> This document mainly explains the instructions for using the TuGraph stored procedure.
+
+## 1. Introduction
+
+When the query/update logic that users need to express is more complex (such as cannot be described by Cypher or has high performance requirements), compared to calling multiple requests and completing the entire processing flow on the client, the stored procedure provided by TuGraph is a more concise and efficient choice.
+
+Similar to traditional databases, the TuGraph stored procedure runs on the server side. Users can encapsulate the processing logic (i.e., multiple operations) into a procedure call, and further improve performance by parallel processing (such as using relevant C++ OLAP interfaces and built-in algorithms) during implementation.
+
+There is a special type of API in the stored procedure for parallel data operations, which we call the Traversal API. Please refer to the [documentation](2.traversal.md) for more information.
+
+## 2. Stored Procedure Version
+
+Currently, TuGraph supports two versions of stored procedures, which are suitable for different scenarios. Version 3.5 only supports v1, which can be directly called through the REST or RPC interface. Starting from version 3.5, v2 is supported, which allows embedding calls in graph query languages ​​(such as Cypher). We call it POG (Procedure On Graph query language, APOC).
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+|Applicable Scenarios	|Extreme performance or complex multi-transaction management scenarios	|General scenarios, highly integrated with Cypher|
+|Transaction	|Created internally in the function, multiple transactions |can be freely controlled	Passed into the external function, single transaction|
+|Signature (parameter definition)	|Not required	|Required|
+|Input and output parameter types	|Not required to specify	|Need to specify parameter types|
+|Cypher Standalone Call	|Supported	|Supported
+|Cypher Embeded Call	|Not supported	|Supported|
+|Language	|C++/Python/Rust	|C++|
+|Calling mode	|Directly pass the string, usually in JSON format	|Through variables in Cypher statements|
+
+
+In TuGraph, stored procedures v1 and v2 are managed separately, and support for create, delete, and query operations is provided. However, it is still not recommended to have the same name for multiple stored procedures.
+
+## 3. Supported Languages
+
+In TuGraph, users can dynamically load, update, and delete stored procedures. TuGraph supports the use of C++, Python, and Rust languages to write stored procedures. Among them, C++ language has the most complete support and the best performance.
+
+Note that the stored procedure is the logic compiled and executed on the server side, which is independent of the language support on the client side.
+
+## 4. Procedure v1 Interface
+
+## 4.1.Write stored procedures
+### 4.1.1.Write C++ stored procedure
+
+Users can write C stored procedures by using core API or Traversal API. An example of a simple C stored procedure is as follows:
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## Count all students whose age is 10
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+From the code, we can see the entry of a TuGraph C++ stored procedure is the `Process` function, with three parameters:
+
+- `db`: the TuGraph database instance
+- `request`: the input data, which can be a binary byte array, or any other format such as JSON string.
+- `response`: the output data, which can be a string or directly return binary data.
+
+The return value of the `Process` function is a boolean value. When it returns `true`, it means that the request is successfully completed, otherwise it means that the stored procedure found an error during execution, and the user can return an error message through `response` to facilitate debugging.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which is `age_10` in the above example. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, age_10.so will be generated, which can then be loaded into the server by the user.
+
+### 4.1.2 Writing Python stored procedures
+
+The following snippet does the same thing as the above C++ stored procedure, but via TuGraph Python API:
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+The Python stored procedure returns a tuple, the first element of which is a Boolean value indicating whether the stored procedure was successfully executed; the second element is a `str`, which contains the result to be returned.
+
+Python stored procedures do not need to be compiled and can be loaded directly.
+
+## 4.2.How to use stored procedures
+
+### 4.2.1.Install Stored Procedures
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `age_10.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+                  headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `age_10.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+### 4.2.2.List Stored Procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.Retrieve Stored Procedures Detail
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.Uninstall Stored Procedures
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+### 4.2.6.Upgrade Stored Procedures
+
+You can upgrade a stored procedure with the following two steps:
+
+1. Uninstall the existing one.
+2. Install the new on.
+
+TuGraph carefully manages the concurrency of stored procedure operations. Upgrading stored procedures will not affect concurrent runs of existing ones.
+
+## 5. Procedure v2 Interface
+
+### 5.1.Writing stored procedures
+
+Users can write C++ stored procedures by using lgraph API. A simple C++ stored procedure example is as follows:
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   std::string &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response = std::string("error parsing json: ") + e.what();
+        return false;
+    }
+
+    Result result({{"node", LGraphType::NODE},
+                   {"salt", LGraphType::FLOAT},
+                   });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = result.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    response = result.Dump();
+    return true;
+}
+```
+
+From the code we can see:
+- The stored procedure defines a method `GetSignature` to get the signature. This method returns the signature of the stored procedure, which includes input parameter names and their types, and return parameters and their types. This enables the Cypher query statement to use the signature information to verify whether the input data and the returned data are reasonable when calling the stored procedure.
+- The entry function is the `ProcessInTxn` function, which has three parameters, which are:
+
+- `txn`: The transaction of the stored procedure, generally speaking, the transaction of the Cypher statement that calls the stored procedure.
+- `request`: input data, its content is the string of the input parameter type defined in `GetSignature` and the value passed in the Cypher query statement after json serialization. e.g. `{num_iteration: 10}`
+- `response`: output data, in order to ensure compatibility in the Cypher language, users can write the data processed by the stored procedure to `lgraph_api::Result`, and finally use `lgraph_api::Result::Dump` to serialize it into data in json format.
+
+The return value of the `ProcessInTxn` function is a boolean value. When it returns `true`, it means that the request was successfully completed, otherwise it means that the stored procedure found an error during execution.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which in the above example is `custom_pagerank`. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, custom_pagerank.so will be generated, which can then be loaded into the server by the user.
+
+### 5.2.Load stored procedure
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `custom_pagerank.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `custom_pagerank.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+#### 5.2.1.List loaded stored procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.Get stored procedure details
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.Delete stored procedure
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+#### 5.2.5.Update stored procedure
+
+Updating a stored procedure requires the following two steps:
+
+1. Delete the existing stored procedure
+2. Install the new stored procedure
+
+TuGraph carefully manages the concurrency of stored procedure operations, and updating stored procedures will not affect the operation of existing stored procedures.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
new file mode 100644
index 0000000000..e4abd3a263
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
@@ -0,0 +1,125 @@
+# Traversal API
+
+> This document mainly explains the Traversal API in the stored procedure of TuGraph.
+
+1. Introduction
+The powerful online analytical processing (OLAP) capability of TuGraph is an important feature that sets it apart from other graph databases. With the help of the C++ OLAP API (olap_on_db.h), users can quickly export a subgraph that needs to be analyzed, and then run iterative graph computing processes such as PageRank, connected components, and community detection on it, and then make corresponding decisions based on the results. The export and computation processes can be accelerated through parallel processing, achieving almost real-time analysis and processing, and avoiding the lengthy steps of traditional solutions that require exporting, transforming, and reimporting (ETL) data into dedicated analytical systems for offline processing.
+
+TuGraph has built-in many commonly used graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement specific graph computing processes themselves. They just need to include the header files (.h files) of the corresponding algorithm library in their own programs when implementing their own storage procedures, and link the corresponding dynamic library files (.so) during compilation. In general, the only process that users need to implement themselves is the extraction of the subgraph to be analyzed.
+
+Currently, the Traversal API only supports C++.
+
+## 2. Interface
+
+### 2.1. Snapshot
+
+The Snapshot template class in C++ OLAP API is used to represent extracted static subgraphs. The EdgeData is used to represent the data type of the weight used for each edge in the subgraph. If the edges do not require weights, Empty is used as the EdgeData.
+
+The extracted subgraph can be described using the constructor of the Snapshot class.
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+In the above text, "db" represents the database handle, "txn" represents the transaction handle, and "flags" represents the options used during generation, with the optional values including the following combinations: SNAPSHOT_PARALLEL indicates that multiple threads are used for parallel extraction during export; SNAPSHOT_UNDIRECTED indicates that the exported graph needs to be transformed into an undirected graph.
+
+"vertex_filter" is a user-defined filtering function for vertices, where a return value of true indicates that the vertex needs to be included in the extracted subgraph, and vice versa.
+
+"out_edge_filter" is a user-defined filtering function for edges, where a return value of true indicates that the edge needs to be included in the extracted subgraph, and vice versa.
+
+When the filtering functions are set to default values, it means that all vertices/edges should be included.
+
+For other methods provided by the Snapshot class, please refer to the detailed C++ API documentation (olap_on_db.h).
+
+### 2.2. Traversal
+
+A common type of analysis in graph databases is to start from one or more vertices and iteratively expand and access their neighbors. Although this type of analysis can be done using Cypher, its performance is limited by the serial interpretation and execution when the depth of traversal is large. Writing stored procedures using the C++ Core API eliminates the overhead of interpretation but is still limited by the processing power of a single thread.
+
+In order to enable users to accelerate these types of analysis tasks through parallel processing, we have wrapped a Traversal framework based on the C++ OLAP API. Users can directly use the FrontierTraversal and PathTraversal classes in this framework to perform iterative traversal analysis tasks. For specific usage instructions, please refer to the corresponding C++ API documentation (lgraph_traversal.h).
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+This method can be used to find all vertices that satisfy a certain condition (when the filter returns true). When the "parallel" parameter is set to true, the search process will be executed in parallel.
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+This method can be used to extract (VertexData type) properties from a specified set of vertices (frontier) using the extract method. When the "parallel" parameter is set to true, the extraction process will be executed in parallel.
+
+FrontierTraversal is suitable for cases where only the traversed set of vertices is of interest. When a user needs to access information along the path (vertices/edges along the path) in the traversal process or result, PathTraversal needs to be used. Both types of traversal have four parameters in their constructor, namely the database handle db, transaction handle txn, options flags and capacity. The available options include the following combinations: TRAVERSAL_PARALLEL indicates that multiple threads are used for parallel traversal; TRAVERSAL_ALLOW_REVISITS indicates that vertices can be visited repeatedly during traversal (PathTraversal implicitly includes this option).
+capacity indicates the capacity of the path collection during initialization.
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+Both types of traversal have three ways to set the starting vertex/vertex set for traversal. The first two methods directly specify the vertex ID, while the last method is similar to FindVertices.
+
+Both types of traversal start from the set of vertices in the current layer. They use the extension function to access each outgoing edge/incoming edge/outgoing and incoming edges, and use a user-defined filter function to determine if the extension is successful. If successful, the neighboring vertex/appended path with the edge is added to the set of vertices/paths in the next layer.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+The above describes the three traversal methods of FrontierTraversal. It starts from the current set of vertices and, for each vertex in the set, iterates through each outgoing edge/incoming edge/outgoing and incoming edges. If the edge or neighbor vertex satisfies the user-defined filter conditions (where edge_filter is the filter function for edges and neighbour_filter is the filter function for neighbor vertices), the neighbor vertex is added to the new set of vertices.
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+After the expansion of the current set of vertices is finished, the new set of vertices can be obtained using the above method.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+The three traversal methods of PathTraversal are similar to FrontierTraversal, except that the user-defined filter function adds two additional parameters: Path, which contains the path before the new edge is expanded, and IteratorHelper, which can be used to convert the vertices/edges in the path to corresponding iterators in the database. The relevant documentation can be found in the corresponding C++ API documentation.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
new file mode 100644
index 0000000000..abc5ce2ccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
@@ -0,0 +1,5 @@
+base64_encode
+===================================
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
new file mode 100644
index 0000000000..b321c843d6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
@@ -0,0 +1,5 @@
+lgraph_result
+===================================
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
new file mode 100644
index 0000000000..0f53077dbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
@@ -0,0 +1,5 @@
+lgraph_rpc_client
+===================================
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
new file mode 100644
index 0000000000..d7a9d7b97c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
@@ -0,0 +1,5 @@
+lgraph_traversal
+===================================
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
new file mode 100644
index 0000000000..4b0be46a21
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
@@ -0,0 +1,5 @@
+lgraph_txn
+===================================
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
new file mode 100644
index 0000000000..4047340ef0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
@@ -0,0 +1,5 @@
+lgraph_types
+===================================
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
new file mode 100644
index 0000000000..12814e7618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
@@ -0,0 +1,5 @@
+lgraph_utils
+===================================
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
new file mode 100644
index 0000000000..572f9ae7c0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
new file mode 100644
index 0000000000..5bfa8a1dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
new file mode 100644
index 0000000000..8680a93ee9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
@@ -0,0 +1,5 @@
+olap_base
+===================================
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
new file mode 100644
index 0000000000..9ce3afba80
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
@@ -0,0 +1,5 @@
+olap_on_db
+===================================
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
new file mode 100644
index 0000000000..5bed2e061c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
@@ -0,0 +1,5 @@
+lgraph
+===================================
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
new file mode 100644
index 0000000000..82bf0941c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
@@ -0,0 +1,5 @@
+olap_profile
+===================================
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
new file mode 100644
index 0000000000..8723e9f1d0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
@@ -0,0 +1,5 @@
+lgraph_atomic
+===================================
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
new file mode 100644
index 0000000000..ec8af7bb8f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
@@ -0,0 +1,5 @@
+lgraph_date_time
+===================================
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
new file mode 100644
index 0000000000..07d6076327
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
@@ -0,0 +1,5 @@
+lgraph_db
+===================================
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
new file mode 100644
index 0000000000..07f4be3f67
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
new file mode 100644
index 0000000000..5be9e6547e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
new file mode 100644
index 0000000000..70a0bd4cbf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
@@ -0,0 +1,5 @@
+lgraph_exceptions
+===================================
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
new file mode 100644
index 0000000000..a4f9af0582
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
@@ -0,0 +1,5 @@
+lgraph_galaxy
+===================================
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
new file mode 100644
index 0000000000..1c343152d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
@@ -0,0 +1,8 @@
+C++ stored procedure API
+===================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..b876f7e8e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
@@ -0,0 +1,29 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python stored procedure API
+====================================
+Version: 4.1.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..7e12ce4db1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
@@ -0,0 +1,17 @@
+# Rust Stored Procedures
+
+## 1. Introduction
+Rust stored procedures currently only support v1 version. TuGraph supports plugins in any language that can be compiled into a dynamic library. Rust, as a rising star in system programming languages, has significant advantages in terms of safety, reliability, and ergonomics compared to C++.
+
+We provide the Rust binding library for TuGraph to support calling lgrahp API in Rust. We also provide the [tugraph-plugin-util](https://crates.io/crates/tugraph-plugin-util ) utility library to help simplify the process of writing Rust plugins.
+
+## 2. How to Use
+
+Using Rust stored procedures involves three steps:
+* Compilation: Compile the Rust source code into a dynamic library (so file). We have prepared a comprehensive plugin development tutorial that covers everything from IDE plugin installation and environment setup to compilation. Please refer to the `rust-tugraph-plugin-tutorial` for detailed instructions.
+* Loading: Load the dynamic library (so file) into the server. This can be done through the REST or RPC interface, similar to the usage of C++ libraries. Please refer to the documentation for more details on the [Procedure v1 API](1.procedure.md#4.Procedure v1 interface).
+* Execution: Once the library is loaded, use it as you would with a C++ stored procedure. The process is the same and does not need further explanation.
+
+## 3. API Documentation
+
+In the Rust community, all code and documentation can be found on [`crates.io`](https://crates.io/crates/tugraph ) and [`docs.rs`](https://docs.rs/tugraph/latest/tugraph ).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile
new file mode 100644
index 0000000000..b8026d7dce
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.1.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst
new file mode 100644
index 0000000000..9dee2a39b9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst
@@ -0,0 +1,12 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure/index.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
new file mode 100644
index 0000000000..83cc10c52e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api-legacy.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api-legacy.md
new file mode 100644
index 0000000000..3bc8acf78b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/1.restful-api-legacy.md
@@ -0,0 +1,2738 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+:warning: **All the other RESTful APIs excluding the three below will be deprived after 4/30/2023.**
+- **Login**
+- **Query**
+- **Store Procedures**
+
+## 2.Protocols And Data Format
+
+### 2.1.Protocols
+
+Both HTTP and HTTPS protocols are supported by TuGraph. The system uses HTTP protocol by default. To use HTTPS, the `ssl_auth` option should be set to `true` in the DB configuration.
+
+### 2.2.Request
+
+TuGraph supports HTTP GET/POST/PUT/DELETE requests, in which:
+
+- `GET` requests are used for read-only requests, such as getting vertex properties, edge properties, etc.
+
+- `POST` requests are used to create entities, submit Cypher, and to manage and call stored procedures;
+
+- `PUT` requests are used to modify existing entities, for example, to modify vertex properties, edge properties, etc.
+
+- `DELETE` requests are used to delete existing entities, such as vertices, edges, etc.
+
+In high-availability mode, users can set `ServerVersion` in the request header to make sure the request is never served with an outdated version.
+The current `ServerVersion` can be obtained from the header returned by the server.
+
+### 2.3.Response
+
+TuGraph returns the following HTTP status codes:
+
+- **200 OK**: operation is successful.
+- **307 Temporary Redirect**: the operation is redirected, typically in high-availability mode, to the master.
+- **400 Bad Request**: incorrect input, such as URI error, or invalid parameters.
+- **500 Internal Server Error**: server error.
+
+When the operation is successful, the JSON response contains the return value of the operation. When the operation is redirected, the `location` field in the returned HTTP header contains the redirect destination address.
+When an input error or server error occurs, the JSON response contains a `error_message` field that describes the error.
+
+In high-availability mode, the server will set `server_version` field in the header to inform the client of the data version of the current server. When clients switch between several different servers, this version number guarantees that the client will not read from an outdated server.
+
+### 2.4.Data Format
+
+The server and clients exchange data in JSON format. When sending a request, the header of the HTTP request should be set with `Accept:application/json, Content-Type:app/json`.
+For example, to create a new vertex, the request header should look like the following:
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.5.URI Format
+
+TuGraph REST API provides access to: web visualization, login, db info, label, index, node, relationship, cypher, task, cpp_plugin, and python_plugin.
+The URI format used for each function is as follows:
+
+| URI     | Description                     |
+| ------- | ------------------------------- |
+| /web    | web visualization               |
+| /cypher | cypher request                  |
+| /acl    | access control                  |
+| /user   | user management                 |
+| /login  | user login                      |
+| /info   | database status and information |
+| /task   | task management                 |
+| /db     | subgraph management             |
+
+For each subgraph, the following interfaces are provided:
+
+| URI                              | Description                         |
+| -------------------------------- | ----------------------------------- |
+| /db                              | create, modify, and delete subgraph |
+| /db/_{graph_name}_/node          | vertex operations                   |
+| /db/_{graph_name}_/relationship  | edge operations                     |
+| /db/_{graph_name}_/label         | label-related operations            |
+| /db/_{graph_name}_/index         | index-related operations            |
+| /db/_{graph_name}_/cypher        | subgraph-specific cypher operation  |
+| /db/_{graph_name}_/cpp_plugin    | C++ plugin(stored procedure)        |
+| /db/_{graph_name}_/python_plugin | Python plugin(stored procedure)     |
+| /db/_{graph_name}_/import        | online import                       |
+| /db/_{graph_name}_/misc          | other operations                    |
+
+## 3.Login
+
+The system creates an administrator by default, whose username is _admin_ and password is _73@TuGraph_. For security reasons, please remember to change your password after first starting the server.
+
+### 3.1.User Login
+
+TuGraph provides JWT-based user authentication. To log in to the server, the REST client should send a login request containing a username and password. Upon success, the client will receive a signed token in the form of a Json Web Token (JWT) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token should be stored by the client and used for each subsequent request.
+
+- **URI**: `/login`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| user     | username    | String |
+| password | password    | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+| default_password | whether it is the default password | Bool |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.Token Refresh
+
+After the token expires, the front-end initiates a refresh token interface, and the back-end verifies the validity of the token.
+If the verification passes, a new token is generated; if the verification fails, status code 401 is returned.
+
+- **URI**: `/refresh`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.Modify Token Validity Period
+
+To modify the validity period of Token, three parameters need to be transmitted: jwt, refresh_time and expire_time, among which jwt is used to verify the user’s identity. When refresh_time and expire_time are equal to 0, the validity period is indefinite. When refresh_time exceeds, you need to call the refresh interface to obtain a new Token; When expire_time expires, you need to log in again. (This interface call needs to confirm the security by itself, do not call unless necessary)
+
+- **URI**: `/update_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+| refresh_time | Valid time (deafult set to 0) | Int64 |
+| expire_time | Expire time (deafult set to 0) | Int64 |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.Query Token validity period
+To query the validity period of the Token, you need to transmit jwt to verify the user's identity, and return, refresh_time and expire_time, where refresh_time indicates the refresh time, and you need to call the refresh interface to obtain a new Token when it exceeds; expire_time indicates the expiration time, and you need to log in again when it exceeds.
+
+- **URI**: `/get_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return "refresh_time" and "expire_time".
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+### 3.5.Logout
+
+The user logs out and deletes the token at the same time.
+
+- **URI**: `/logout`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+## 4.Query
+
+URI format is:
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.Call Cypher
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description   | Type   |
+| ------ | ------------- | ------ |
+| graph  | subgraph name | String |
+| cypher | Cypher query  | String |
+
+- **RESPONSE**:
+
+| Field   | Description             | Type    |
+| ------- | ----------------------- | ------- |
+| result  | running results         | List    |
+| elapsed | running time in seconds | Float   |
+| header  | header of the results   | List    |
+| size    | number of results       | Integer |
+
+in which `header` is a list with each element in the form of:
+
+| Field | Description                                                | Type   |
+| ----- | ---------------------------------------------------------- | ------ |
+| name  | the name of column                                         | String |
+| type  | column data type, 0 is scalar, 1 is vertex id, 2 is vector |        |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.Call Cypher with Parameters
+
+Cypher supports querying with parameters. When a Cypher query with parameters is called, TuGraph caches the execution plan for that query to speed up the following queries of the same kind.
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type   |
+| ---------- | ------------- | ------ |
+| graph      | subgraph name | String |
+| cypher     | Cypher query  | String |
+| parameters | parameters    | List   |
+
+- **RESPONSE**:
+
+Same as [Call Cypher](#Call-Cypher).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+## 5.Stored Procedures
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.Create Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                                                                       | Type   |
+| ----------- | --------------------------------------------------------------------------------- | ------ |
+| name        | name of the plugin                                                                | String |
+| description | description of the plugin                                                         | String |
+| code_base64 | code of plugin encoded in base64                                                  | String |
+| read_only   | whether it is a read-only stored procedure                                        | Bool   |
+| code_type   | type of plugin code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String |
+
+_Note: read-only plugins are more efficient than write plugins. Always specify `read-only=true` for read-only transactions._
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.so}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 5.2.List Stored Procedures
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list in which each element is a plugin description, in the format of:
+
+| Field       | Description                               | Type   |
+| ----------- | ----------------------------------------- | ------ |
+| name        | name of the stored procedure              | String |
+| description | description of the stored procedure       | String |
+| read_only   | whether the stored procedure is read-only | Bool   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.Retrieve Stored Procedure Detail
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Procedure detail, including code, in the format of:
+
+| Field       | Description                                                                         | Type                   |
+| ----------- | ----------------------------------------------------------------------------------- | ---------------------- |
+| name        | Procedure name                                                                      | String                 |
+| description | Procedure descrition                                                                | String                 |
+| read_only   | Read only or not                                                                    | Bool                   |
+| code_base64 | 存储过程的代码                                                                      | String, Base64 encoded |
+| code_type   | Type of procedue code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String                 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.Call Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: POST
+
+- **REQUEST**: String input.
+
+| Field   | Description                                               | Type   |
+| ------- | --------------------------------------------------------- | ------ |
+| data    | input data                                                | String |
+| timeout | timeout in seconds, defaults to 0, which means no timeout | Float  |
+
+- **RESPONSE**:
+
+| Field  | Description     | Type   |
+| ------ | --------------- | ------ |
+| result | running results | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.Delete Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+## 6.Deprecated
+
+The APIs below will be removed after 4/30/2023.
+
+### 6.1.User Management
+
+#### 6.1.1.Add User
+
+Add a new user and set the initial password for the user. Only administrators have permission to add new users. The username can only have letters, numbers, and underscores, and should not begin with a number. The password can contain any character. The username and password have a maximum length of 64 bytes.
+
+- **URI**: `/user`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                                 | Type   |
+| -------- | ------------------------------------------- | ------ |
+| user     | username                                    | String |
+| password | password                                    | String |
+| is_admin | whether the user is an administrator or not | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "is_admin": false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.Change Password
+
+Users can change their own passwords, in which case the original password needs to be verified.
+
+Administrators can change the passwords of any user and promote non-admin users to administrators, or demote administrator users to regular users. When modifying another user's password, the original password of the user is not needed.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field            | Description                                                                     | Type   |
+| ---------------- | ------------------------------------------------------------------------------- | ------ |
+| current_password | user's current password, if modifying its own password                          | String |
+| new_password     | user's new password                                                             | String |
+| is_admin         | should this user be administrator or not, used when promoting or demoting users | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user/user1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+        "is_admin": true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.3.List All Users
+
+List all users of the database. Only administrators are allowed to perform this operation.
+
+- **URI**: `/user/`
+
+- **METHOD**: GET
+
+- **RESPONSE**: a dictionary of {`user_name`:`is_admin`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+    • 200: OK
+    Output:
+    {
+        "admin": true,
+        "guest1": false
+    }
+
+#### 6.1.4.Delete User
+
+Delete a user from the DB. Only administrators have permission to do so.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.2.Access Control
+
+TuGraph has four access levels. Different users can have different permissions for each subgraph. The four access levels are as follows:
+
+| Access Level | Description                                                                                                               |
+| ------------ | ------------------------------------------------------------------------------------------------------------------------- |
+| NONE         | no access                                                                                                                 |
+| READ         | read-only                                                                                                                 |
+| WRITE        | can read and write vertexes and edges of the subgraph                                                                     |
+| FULL         | full access, including changing metadata (label, index), managing stored procedures and deleting all data in the subgraph |
+
+Administrators have full access on all subgraphs, and a newly created non-admin user does not have access for any subgraph. Users who have full access on a subgraph can set the access level for other users on that subgraph.
+
+#### 6.2.1.Query User's Access Level
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+When both `user` and `graph` are specified, the user's access level for the subgraph is returned, such as `READ`.
+
+When only `user` is specified, all subgraphs that the user can access (access level not `NONE`) are returned, as well as the user's access level on the subgraph.
+
+When only `graph` is specified, all users who have access level on this graph (excluding administrators, who have implicit `FULL` access) and their access levels are returned. This operation requires administrator permission.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/acl/?user=user1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "graph1": "READ",
+      "graph2": "WRITE",
+      "graph3": "FULL"
+    }
+```
+
+#### 6.2.2.Change User's Access Level
+
+- **URI**: `/acl`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field | Description     | Type   |
+| ----- | --------------- | ------ |
+| user  | username        | String |
+| graph | subgraph's name | String |
+| acl   | access level    | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/acl
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "user1",
+        "graph": "graph1",
+        "acl": "FULL"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.Remove User's Access Right
+
+This is equivalent to setting access level to `NONE`.
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/acl/?user=user1&graph=graph1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.Server Status
+
+#### 6.3.1.Modify Server Configuration
+
+Modifying the server configuration will take effect immediately after the configuration modification and will affect all servers. These configurations take precedence over configuration files and command line arguments.
+
+- **URI**: `/config`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+  | Field            | Description                                           | Type |
+  | ---------------- | ----------------------------------------------------- | ---- |
+  | db_async         | Whether to enable asynchronous mode                   | Bool |
+  | optimistic_txn   | Whether to use optimistic transaction lock by default | Bool |
+  | enable_audit_log | Whether to enable audit logging                       | Bool |
+
+- **RESPONSE**: If successful, return status code 200.
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "db_async": true,
+        "enable_audit_log": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.Current Server Status
+
+- **URI**: `/info`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field          | Description                    | Type                                                                                    |
+| -------------- | ------------------------------ | --------------------------------------------------------------------------------------- |
+| lgraph_version | TuGraph version                | String                                                                                  |
+| git_branch     | server's git branch            | String                                                                                  |
+| git_commit     | server's git commit version    | String                                                                                  |
+| web_commit     | web client commit version      | String                                                                                  |
+| cpp_id         | cpp compiler id                | String                                                                                  |
+| cpp_version    | cpp compiler version           | String                                                                                  |
+| python_version | python lib version             | String                                                                                  |
+| cpu            | cpu information                | Dictionary, format refers [CPU Status](#CPU-Status)                                     |
+| disk           | disk IO information            | Dictionary, format refers [Disk Status](#Disk-Status)                                   |
+| memory         | memory information             | Dictionary, format refers [Memory Status](#Memory-Status)                               |
+| db_space       | graph database storage         | Dictionary, format refers [Graph Database Storage](#Graph-Database-Storage)             |
+| db_config      | graph database configuration   | Dictionary, format refers [Graph Database Configuration](#Graph-Database-Configuration) |
+| up_time        | database's online running time | Integer                                                                                 |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.CPU Status
+
+- **URI**: `/info/cpu`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description        | Type    |
+| ------ | ------------------ | ------- |
+| self   | TuGraph CPU usage  | Integer |
+| server | server's CPU usage | Integer |
+| unit   | metric unit        | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.Disk Status
+
+- **URI**: `/info/disk`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description              | Type    |
+| ----- | ------------------------ | ------- |
+| read  | server's disk read rate  | Integer |
+| write | server's disk wrtie rate | Integer |
+| unit  | metric unit              | String  |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.Memory Status
+
+- **URI**: `/info/memory`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description               | Type    |
+| ------------ | ------------------------- | ------- |
+| self         | TuGraph memory usage      | Integer |
+| server_avail | server's available memory | Integer |
+| server_total | server's total memory     | Integer |
+| unit         | metric unit               | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.Database Size
+
+- **URI**: `/info/db_space`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                | Type    |
+| ----- | -------------------------- | ------- |
+| space | total size of the database | Integer |
+| unit  | metric unit                | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.DB Configuration
+
+- **URI**: `/info/db_config`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description                                       | Type    |
+| ------------ | ------------------------------------------------- | ------- |
+| async        | asynchronous mode                                 | Bool    |
+| disable_auth | whether to disable authentication                 | Bool    |
+| enable_ha    | whether to enable high-availability mode          | Bool    |
+| enable_rpc   | whether to enable RPC server                      | Bool    |
+| host         | bound host address                                | String  |
+| port         | port of REST server                               | Integer |
+| rpc_port     | port of RPC server                                | Integer |
+| thread_limit | limit of available threads for the graph database | Integer |
+| use_ssl      | whether to use SSL for authentication             | Bool    |
+| verbose      | verbose level of the output                       | Integer |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "host":"127.0.0.1",
+      "port":7070,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "use_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.7.High Availability Server List
+
+Get a list of replication servers. Valid only in high-availability mode.
+
+- **URI**: `/info/peers`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of server information, each of server information is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+| state        | server state          | String |
+
+The server state can be `MASTER`, `SLAVE`, or `OFFLINE`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.8.Current Leader Information
+
+Get information of current leader. Valid only in HA mode.
+
+- **URI**: `/info/leader`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current leader server information, which is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.9.Server Statistics
+
+- **URI**: `/info/statistics`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current server statistics, which is formatted as:
+
+| Field           | Description                                   | Type    |
+| --------------- | --------------------------------------------- | ------- |
+| requests/second | number of requests processed per second       | Float   |
+| writes/second   | number of write requests processed per second | Float   |
+| running_tasks   | number of requests in progress                | Integer |
+| failure_rate    | request failure rate                          | Float   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 0.023,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.10.Get Audit Logs
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+
+| Field            | Description                                                                                                             | Type      |
+| ---------------- | ----------------------------------------------------------------------------------------------------------------------- | --------- |
+| begin_time       | start time of the queried log (required, format YYYY-mm-dd HH:MM:SS)                                                    | Timestamp |
+| end_time         | end time of the queried log (default is current time, format YYYY-mm-dd HH:MM:SS)                                       | Timestamp |
+| user             | the operator of the queried log (administrator can query all users' logs, ordinary users can only query their own logs) | String    |
+| num_log          | maximum number of logs to return (default 100)                                                                          | Integer   |
+| descending_order | whether to sort the result in descending order(default is true)                                                         | Bool      |
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of audit logs, each of which is an action log in the format of:
+
+| Field      | Description                                        | Type    |
+| ---------- | -------------------------------------------------- | ------- |
+| index      | the index of the operation                         | Integer |
+| begin_time | the start time of the operation                    | String  |
+| end_time   | the end time of the operation                      | String  |
+| user       | the user of the operation                          | String  |
+| graph      | the graph of the operation                         | String  |
+| type       | the type of the operation                          | String  |
+| read_write | the operation is read operation or write operation | String  |
+| success    | whether the operation is successful                | Bool    |
+| content    | the content of the operation                       | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.Task Management
+
+TuGraph tracks long-running tasks such as complex Cypher queries and plugins. Administrators can query currently running tasks through the REST API and choose to abort the queries if necessary.
+
+The URI format for task management is :
+
+```
+    http://{host}:{port}/task/{task_id}
+```
+
+#### 6.4.1.List Running Tasks
+
+- **URI**: `/task`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+The returned JSON is an array, each of which is formatted as follows:
+
+| Field        | Description                                      | Type   |
+| ------------ | ------------------------------------------------ | ------ |
+| description  | the description of the task                      | String |
+| time_elapsed | time the task has been executing for, in seconds | Float  |
+| task_id      | the ID of the task                               | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.Abort Task
+
+- **URI**: `/task/{task_id}`
+
+Where `task_id` is the `task_id` returned by `GET /task` .
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.5.Subgraph Management
+
+TuGraph supports multiple subgraphs and all subgraphs are completely independent from others. Different subgraphs can have different permissions to different users. Administrators can add, modify and delete subgraphs.
+
+#### 6.5.1.Create New Subgraph
+
+- **URI**: `/db`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description                   | Type                                                                |
+| ------ | ----------------------------- | ------------------------------------------------------------------- |
+| name   | the name of subgraph          | String                                                              |
+| config | the configuration of subgraph | Dictionary, in the format of {{column name 1}:{column value 1},...} |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1"
+        "config" : {
+            "max_size_GB":2048,
+            "async":True
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.Delete Subgraph
+
+- **URI**: `/db/{graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.List All Subgraphs
+
+- **URI**: `/db`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of all subgraphs.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_gb":1024,
+            "async":false
+        }
+    }
+```
+
+### 6.6.Label
+
+TuGraph is a strong-schema database. In each subgraph, each vertex and edge need to have a predefined data format. The data format is determined by Label. Users can use the REST API to add, delete, and query labels and their corresponding data format.
+
+The URI format of the Label operation is
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+Where the {type} can be `node` or `relationship`.
+
+#### 6.6.1.Create Label
+
+A label is created with a fixed data format. A label must be defined before any node or relationship can be created with that label.
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field            | Description                  | Type   |
+| ---------------- | ---------------------------- | ------ |
+| name             | the name of label            | String |
+| fields           | data column definition       | List   |
+| is_vertex        | whether it is a vertex Label | Bool   |
+| primary          | vertex primary property      | String |
+| edge_constraints | edge constraints             | List   |
+
+`primary` should be set when `is_vertex` is `true`. This field is only available for Vertex, and must be set when creating Vertex.
+
+`edge_constraints` could be set when `is_vertex` is `false`, This field is only available for Edge. This field limits the combination of starting and ending vertex of the edge, for example: `[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, just leave this field unset.
+
+In which `fields` is an array, in which each element defines a column of data, as follows:
+
+| Field    | Description                                                | Type                                                                                                         |
+| -------- | ---------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------ |
+| name     | the name of the column                                     | String                                                                                                       |
+| type     | the data type of the column                                | String, with following types: int8, int16, int32, int64, float, double, string, date, datetime, binary, blob |
+| optional | whether the data can be empty (optional, default is false) | Bool                                                                                                         |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.List All Labels
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description               | Type |
+| ------ | ------------------------- | ---- |
+| edge   | the list of edge labels   | List |
+| vertex | the list of vertex labels | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.Get Label Data Format
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Data column definition table as a dictionary, in which each key is the column name, and corresponding value is the column definition defined as follows:
+- | Field    | Description                           | Type   |
+  | -------- | ------------------------------------- | ------ |
+  | optional | whether the column value can be empty | Bool   |
+  | type     | the type of the column value          | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema Import
+
+- **URI**: `/db/{graph_name}/schema/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description              | Type   |
+| ----------- | ------------------------ | ------ |
+| description | Graph labels description | String |
+
+The detail description can refer to `TuGraph Manual`.
+
+- **RESPONSE**:
+
+Schema import will check the new schema and original schema in database if compatible or not. If yes, this request will add the label only in new schema. If no, will return an error code.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.Vertex Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+in which `vid` is a unique integer identifying the vertex, which can be obtained when creating new vertexes or by looking up index.
+
+#### 6.7.1.List Vertex and Label Number
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field      | Description                | Type    |
+| ---------- | -------------------------- | ------- |
+| num_label  | the number of vertex label | Integer |
+| num_vertex | the number of vertex       | Integer |
+
+_Note: `num_vertex` returns an estimate of the number of vertexes, not the exact number. To get the exact number, please use Cypher queries._
+
+#### 6.7.2.Create New Vertex
+
+Insert a vertex into the database.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                  | Type       |
+| -------- | ---------------------------- | ---------- |
+| label    | the name of label            | String     |
+| property | the properties of the vertex | Dictionary |
+
+in which `property` is a dictionary of {`column_name`:`column_value`}.
+
+- **RESPONSE**: if successful, return status code 200 and the new vertex's vid, which can be used in later vertex operations.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.Batch Create Vertexes
+
+TuGraph allows multiple vertices to be inserted as one batch to reduce network overhead.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description               | Type   |
+| ------ | ------------------------- | ------ |
+| label  | the name of Label         | String |
+| fields | the column names          | List   |
+| values | the values of each vertex | List   |
+
+in which `fields` is a list of strings specifying column names, and `values` is a list in which each element is a list of `column_values` corresponding to the column names as specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200, and return the vid list of newly added vertices in the JSON content, where each vid corresponds to each vertex in the request.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.Get Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description       | Type                                                             |
+| -------- | ----------------- | ---------------------------------------------------------------- |
+| label    | the name of Label | String                                                           |
+| property | property          | Dictionary, in the format of {column_name_1:column_value_1, ...} |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.Delete Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200, and also the following content in JSON:
+
+| Field | Description                                    | Type    |
+| ----- | ---------------------------------------------- | ------- |
+| in    | number of incoming edges of the deleted vertex | Integer |
+| out   | number of outgoing edges of the deleted vertex | Integer |
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.Get Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Vertex properties as a dictionary of {`column_name`:`column_value`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.Get Vertex Field
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Value corresponding to the specified `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.Update Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description          | Type       |
+| -------- | -------------------- | ---------- |
+| property | properties to update | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "13737299333"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.8.Edge Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+in which `euid` is a string uniquely identifying the edge, which can be obtained when creating edges or by iterating through the edges of a vertex.
+
+#### 6.8.1.Create Edge
+
+- **URI**: `/db/{graph_name}/node/{src_vid}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                     | Type       |
+| ----------- | ------------------------------- | ---------- |
+| label       | the label of edge               | String     |
+| destination | the `vid` of destination vertex | Integer    |
+| property    | the property of edge            | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200 and the `euid` of new created edge (type is String).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.Batch Create Edges
+
+- **URI**: `/db/{graph_name}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description          | Type   |
+| ------ | -------------------- | ------ |
+| label  | the label of edge    | String |
+| fields | the data column name | List   |
+| edge   | the data of edge     | List   |
+
+where the edge is a list of data, each of which specifies and edge, defined as follows:
+
+| Field       | Description           | Type    |
+| ----------- | --------------------- | ------- |
+| source      | source vertex id      | Integer |
+| destination | destination vertex id | Integer |
+| values      | the data list         | List    |
+
+in which `values` is a list of column values, each of which correspond to the a column name specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200 and the list of `euid`s of the newly created edges.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.List Out-going Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of source vertex's out-going edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.List Incoming Edges
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of destination vertex's incoming edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.List All Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                     | Type |
+| ----- | ------------------------------- | ---- |
+| in    | list of incoming edges' `euid`s | List |
+| out   | list of outgoing edges' `euid`s | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.Get Edge Information
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description                | Type       |
+| -------- | -------------------------- | ---------- |
+| label    | the label of the edge      | String     |
+| property | the properties of the edge | Dictionary |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.Delete Edge
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.Get Edge Properties
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The dictionary of edge's properties.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.Get Edge Field
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the value corresponding to given `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.Update Edge Property
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description              | Type       |
+| -------- | ------------------------ | ---------- |
+| property | properties to be updated | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.9.Index
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+#### 6.9.1.Create Index
+
+Create an index on a (label, field) pair. Blocks until the index is successfully built.
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field     | Description                                                                                 | Type   |
+| --------- |---------------------------------------------------------------------------------------------|--------|
+| label     | the name of label                                                                           | String |
+| field     | field to be indexed                                                                         | String |
+| type | the type of index, 0 means nonunique index, 1 means unique index, 2 means pair_unique index | int      |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.List All Indexes
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.List Indexes Related with Specified Label
+
+- **URI**: `/db/{graph_name}/index/{label}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.Delete Index
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.Get Vertex by Index
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of `vid`s.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+
+
+
+### 6.10.Data Import
+
+- **URI**: `/db/{graph_name}/import/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field             | Description                                                                                        | Type                       |
+|-------------------|----------------------------------------------------------------------------------------------------|----------------------------|
+| description       | description of the file content                                                                    | String                     |
+| data              | contents of the file to be imported (recommended to have a size of 16MB, has a hard limit of 17MB) | Strings / Arrays / Objects |
+| continue_on_error | whether to continue import when an error occurred (optional, default is `false`)                   | Bool                       |
+| delimiter         | delimiter used in the data file (optional, default is `“,”`)                                       | String                     |
+
+The details of the `description` field can be found in [TuGraph Import Tool](../../3.server-tools/1.data-import.md).
+
+`delimiter` can be a single character or multi-character string, but must not contain `\r` or `\n`.
+
+`data` can be one of the following:
+
+- String, such as `"1,2\n3,4\n"`
+- Array of ASCII codes, such as `[49,44,50,10,51,44,52,10]`
+- Dictionary shaped like the above array, such as `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+* **RESPONSE**:
+
+The system **will not** automatically perform actions such as creating a new label, adding an index, and so on. Before you do this, please make sure that the label involved already exists and has an appropriate index.
+
+If the import is successful, return code 200 and return log information (possibly empty) in the `log` field. Otherwise, returns status code 400. None of the data is imported on failure, and error message is set in `error_message`.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+Because the request specifies `continue_on_error: true`, the returned `log` indicates that the first edge cannot be inserted because there is no vertex with uid==1, while the second edge was imported successfully.
+
+### 6.11.Miscellany
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.Extract Subgraph
+
+Give a set of `vid`s and return the minimum subgraph which contains the vertex set and the edges between them.
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type |
+| ---------- | ------------- | ---- |
+| vertex_ids | vertex id set | List |
+
+- **RESPONSE**:
+
+| Field         | description        | Type                                                               |
+| ------------- | ------------------ | ------------------------------------------------------------------ |
+| nodes         | vertex information | List, each element contains vid, label, and properties.            |
+| relationships | edge information   | List, each element contains src, dst, euid, label, and properties. |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
new file mode 100644
index 0000000000..911de26909
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
@@ -0,0 +1,269 @@
+# RPC API
+
+> This document mainly introduces the details of calling TuGraph's RPC API.
+
+## 1.Introduction
+
+TuGraph provides rich RPC APIs for developers to remotely call the services provided by TuGraph through RPC requests.
+
+RPC (Remote Procedure Call) is a protocol for requesting services from remote computer programs through a network without the need to understand the underlying network technology.
+Compared with REST, RPC is method-oriented and mainly used for calling function methods. It is suitable for more complex communication scenarios and has higher performance.
+brpc is an industrial-grade RPC framework written in C++. Based on brpc, TuGraph provides rich RPC APIs. This document describes how to use TuGraph's RPC API.
+
+## 2.Request
+
+### 2.1.Establishing a Connection
+
+When developers send RPC requests to TuGraph services, they must first establish a connection. Taking C++ as an example, developers create a channel with the specified URL and create a specified service stub (LGraphRPCService_Stub) from the channel. Subsequently, they can send requests to the remote server through the stub like calling local methods.
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.Request Types
+
+TuGraph supports 10 types of RPC requests, and each request's functionality is shown in the following table:
+
+| Request              | Functionality         |
+|-----------------|------------|
+| GraphApiRequest | Vertex-Edge Index   |
+| CypherRequest   | cypher   |
+| PluginRequest   | Stored Procedures     |
+| HARequest       | High Availability    |
+| ImportRequest   | Data Import     |
+| GraphRequest    | Subgraph Operations     |
+| AclRequest      | Access Control     |
+| ConfigRequest   | Configuration     |
+| RestoreRequest  | Backup       |
+| SchemaRequest   | Schema Management |
+
+When a user sends a request, the following parameters need to be passed in:
+- client_version: an optional parameter, in HA mode, it can prevent outdated responses by comparing `client_version` and `server_version`
+- token: a necessary parameter, the client obtains the token after logging in, and the token is passed in with each request to verify the user's identity
+- is_write_op: an optional parameter, indicating whether the request is a write request
+- user: an optional parameter, set user when synchronizing requests between master and slave in HA mode, and no token verification is required After the service processes the RPC request, it sends back a response.
+
+In addition to containing separate response information for each request, the response message also includes the following parameters:
+- error_code: a necessary parameter, indicating the processing status of the request
+- redirect: an optional parameter, when processing fails to send a write request to a follower in HA mode, set redirect as the request forwarding address, that is, the leader address
+- error: an optional parameter, indicating the error information of the request
+- server_version: an optional parameter, set `server_version` in the HA mode request response to avoid reverse time travel when client reads data
+
+:warning:  **Except for CypherRequest, PluginRequest, HARequest and AclRequest, all other RPC interfaces will be gradually deprecated, and their functions will be unified into the CypherRequest interface.**
+
+## 3.Login
+
+The login request message contains the following parameters:
+- user: a necessary parameter, the username
+- pass: a necessary parameter, the password
+
+Taking C++ as an example, the user sends a login request using the constructed service stub:
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+The login response message contains the following parameters:
+- token: a necessary parameter. After successful login, a signed token, namely Json Web Token, will be received. The client stores the token and uses it for each subsequent request. If the login fails, an "Authentication failed" error will be received.
+
+## 4.Query
+Users can interact with TuGraph through Cypher queries. The Cypher request message contains the following parameters:
+- query: a necessary parameter, the Cypher query statement
+- param_names: an optional parameter, the parameter name
+- param_values: an optional parameter, the parameter value
+- result_in_json_format: a necessary parameter, whether to return the query results in JSON format
+- graph: an optional parameter, the subgraph name for executing the Cypher statement
+- timeout: an optional parameter, the timeout for executing the Cypher statement
+
+Taking C++ as an example, the user sends a Cypher request as follows:
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+The Cypher request response contains one of the following two parameters:
+- json_result: the Cypher query result in JSON format
+- binary_result: the Cypher query result in the CypherResult format
+
+## 5.Stored Procedures
+To meet users' more complex query/update logic, TuGraph supports stored procedures written in C and Python. Users can use RPC requests to perform CRUD operations on stored procedures.
+
+### 5.1.Load Stored Procedures
+The request for loading stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- read_only: a necessary parameter, whether it is read-only
+- code: a necessary parameter, the ByteString generated by reading the stored procedure file
+- desc: an optional parameter, the stored procedure description
+- code_type: an optional parameter, the stored procedure code type, which can be PY, SO, CPP, or ZIP
+
+Taking C++ as an example, the user loads the stored procedure as follows:
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for loading the stored procedure does not contain parameters, and if the loading fails, a BadInput exception will be thrown.
+
+### 5.2.Invoke Stored Procedures
+
+The request for invoking stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- param: a necessary parameter, the stored procedure parameters
+- result_in_json_format: an optional parameter, whether to return the invocation result in JSON format
+- in_process: an optional parameter, to be supported in the future
+- timeout: an optional parameter, the timeout for invoking the stored procedure
+
+Taking C++ as an example, the user invokes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+The response for invoking the stored procedure contains one of the following two parameters:
+- reply: the stored procedure invocation result in the ByteString format
+- json_result: the stored procedure invocation result in JSON format
+
+### 5.3.Delete Stored Procedures
+
+The request for deleting stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+
+Taking C++ as an example, the user deletes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for deleting the stored procedure does not contain parameters, and if the deletion fails, a BadInput exception will be thrown.
+
+### 5.4.List Stored Procedures
+
+The request for listing stored procedures does not require parameters. Taking C++ as an example, the user lists the stored procedures as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+The response for listing the stored procedures contains the following parameter:
+- reply: the procedure list in JSON format
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/3.restful-api.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/3.restful-api.md
new file mode 100644
index 0000000000..b5679e97fd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/3.restful-api.md
@@ -0,0 +1,341 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+## 2.Request And Response Format
+Tugraph HTTP Server receives requests in json format，After authentication, fields in the request are extracted, the request is processed according to the defined interface logic, and the response in json format is returned.
+
+### 2.1.Standard Response Format
+Each response is returned in the standard response format, as follows：
+
+| body parameter  | parameter description  | parameter type | necessary |
+|--------------|------------------------|----------|-----------|
+| errorCode    | error code             | int      | yes       |
+| success      | Whether the request was successful | int      | yes       |
+| errorMessage | error message          | string   | yes         |
+| data         | the response information returned when the request is successful | json string | yes         |
+
+### 2.2. Request Type
+
+#### 2.2.1. User Login
+The user sends the login request to the server with the user name and password. After successful login, the client receives a signed token (the Json Web Token) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token stored by the client and added to the Authorization domain of the request header in subsequent requests. If the login fails, you will receive the Authentication failed error.
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary       |
+| ------- |-----------------------|-------|------------|
+| userName   | name of the user      | string   | yes          |
+| password   | password of the user  | string | yes          |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00 and the token will be included in data
+
+| body parameter  | parameter description  | parameter type   | necessary |
+| ------- |-------|--------|------|
+| authorization   | token | string | yes  |
+| default_password  | whether the password is the default password | bool | yes  |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. User Logout
+When a user logs out, the authenticated token is deleted. and the user needs to log in again to obtain a new token when sending subsequent requests.
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and data is empty
+
+#### 2.2.3. Refresh Token
+If the delivered token becomes invalid, you need to invoke this interface for re-authentication. The token is valid within one hour after the first login and needs to be refreshed
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the token will be included in data
+
+| body parameter  | parameter description | parameter type | necessary       |
+| ------- |------|----------------|------------|
+| authorization   | token  | string         | yes          |
+
+#### 2.2.4. Call Cypher
+User manipulation of data and models in tugraph requires calling the cypher interface and is initiated through the standard cypher query language
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------------------|---------|-----------|
+| graph   | the name of the subgraph to be queried | string  | yes       |
+| script   | query statement  | string  | yes         |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the query results will be included in data
+
+| body parameter  | parameter description | parameter type | necessary    |
+| ------- |------|----------------|------------|
+| result   | query results | json string    | yes          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. Upload File
+This interface is used to upload local files to the TuGraph machine. You can upload text/binary files, large files, and small files. For large files, the client must split the files, and each file fragment must not be larger than 1MB. Parameters Begin-Pos and Size correspond to the offset and fragment size of this fragment in the complete file. The parameter must be placed in the header of the http request, and the request body contains only the file fragment content. The request header of this interface contains more than token parameters
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header parameter | parameter description                | parameter type | necessary |
+|------------------|--------------------------------------|---------|-------|
+| File-Name        | the name of the file                 | string  | yes   |
+| Begin-Pos        | Offset of the start position of the current file fragment within the file | string  | yes   |
+| Size             | the current file fragment size       | string | yes   |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+#### 2.2.6. Check File
+this interface is used to check the correctness of uploaded files. If the check succeeds, the system returns a success message when the same file is uploaded again
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description       | parameter type | necessary |
+| ------- |-----------------------------|----------------|-----------|
+| fileName   | the name of the file        | string         | yes       |
+| checkSum   | the checksum of the file    | string  | yes when flag set to "1" |
+| fileSize   | the size of the file        | string  | yes when flag set to "2" |
+| flag   | If flag is "1", check md5. If flag is "2"，check file size | string  | yes       |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------|------|------|
+| pass   | true on success, false otherwise | bool | yes  |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. Delete Cached File
+The admin user can delete all the files uploaded by anyone. Other users can delete their own files. You can delete a file with a specified name, a file uploaded by a specified user, or all files
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary |
+| ------- |-----------------------|--------|--------|
+| fileName   | the name of the file  | string | yes when flag set to "0" |
+| userName   | the name of the user  | string | yes when flag set to "1" |
+| flag   | When flag is set to 0, the file specified by fileName is deleted; when flag is set to 1, all files uploaded by userName are deleted; when flag is set to 2, all files are deleted | string | yes    |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. Import Schema
+This interface can create a schema model based on the schema information specified by description parameter. For details about the schema format, refer to data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |-----------------------|----------------|-----------|
+| graph   | name of the subgraph  | string         | yes       |
+| description   | schema infomation     | json string    | yes         |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. Import Data
+This interface allows users to specify uploaded and verified files as data files and import them to the subgraph specified by the graph parameter. The import process is asynchronous, and the server returns a task id after receiving the import request
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description     | parameter type | necessary |
+| ------- |---------------------------|--------|-----|
+| graph   | name of the subgraph      | string | yes |
+| schema   | schema infomation         | json string | yes |
+| delimiter   | column delimiter          | string | yes |
+| continueOnError   | Whether to skip the error and continue when an error occurs | boolean | no  |
+| skipPackages   | number of packets skipped | string | no  |
+| taskId   | used to restart the failed task | string | no  |
+| flag   | If flag is set to 1, the data file is deleted after the import is successful | string | no  |
+| other   | other parameter           | string | no  |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                 | parameter type   | necessary       |
+| ------- |---------------------------------------|--------|------------|
+| taskId   | task id is used to find a import task | string | yes          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. Import Progress Query
+This interface is used to query the execution progress of a import task
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description                     | parameter type    | necessary |
+| ------- |-------------------------------------------|---------|----|
+| taskId   | task id returned by import_data interface | string | 是 |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                | parameter type | necessary |
+| ------- |--------------------------------------|----------------|-----------|
+| success   | 	whether import is successful        | boolean        | yes       |
+| reason   | 	reason of the import failure        | string         | yes if success is false      |
+| progress   | 	import progress at the current time | string         | yes       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst
new file mode 100644
index 0000000000..484e600e87
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/4.protocol/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Protocol
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
new file mode 100644
index 0000000000..b1b1474940
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
@@ -0,0 +1,100 @@
+# Learning Tutorial
+
+> This document is designed as a guide for TuGraph users. Before reading the detailed documentation, users should first read this document to have a general understanding of the graph learning process of TuGraph, which will make it easier to read the detailed documentation later. The guide program is based on a simple program instance of TuGraph, and we will focus on its usage.
+
+## 1. Introduction to TuGraph Graph Learning Module
+Graph learning is a machine learning method that utilizes the topological information of a graph structure to analyze and model data. Unlike traditional machine learning methods, graph learning uses graph structures where vertices represent entities in data and edges represent relationships between entities. By extracting features and patterns from these vertices and edges, deep associations and patterns can be revealed in data that can be used in various practical applications.
+
+The TuGraph Graph Learning Module is a graph learning module based on a graph database that provides four sampling operators: Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. These operators can be used to sample vertices and edges in a graph to generate training data. The sampling process is performed in a parallel computing environment, providing high efficiency and scalability.
+
+After sampling, the obtained training data can be used to train a model that can be used for various graph learning tasks such as prediction and classification. Through training, the model can learn the relationships between vertices and edges in the graph, allowing for prediction and classification of new vertices and edges. In practical applications, this module can be used to handle large-scale graph data such as social networks, recommendation systems, and bioinformatics.
+
+## 2. Run Process
+The TuGraph graph learning module samples graph data in TuGraph, and the sampled vertices and edges are used as graph learning features for learning and training. The operation process is shown in the figure below:
+
+![Alt text](../../../../../images/learn_flow_chart_en.png)
+
+## 3. TuGraph compilation and data preparation
+For TuGraph compilation, please refer to: [Compile](../../../5.developer-manual/2.running/1.compile.md)
+Execute in the build/output directory:
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+This command copies the relevant files of the dataset to the build/output directory.
+
+## 4. Data Import
+Please refer to [Data Import](../../../5.developer-manual/3.server-tools/1.data-import.md) for data import.
+
+Taking the cora dataset as an example for the import process:
+
+Execute in the build/output directory:
+
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Where cora.conf is the graph schema file representing the format of the graph data. coradb is the imported graph data file name representing the storage location of the graph data.
+
+## 5. Feature Conversion
+Since the features in graph learning are generally represented as long float arrays, TuGraph does not support loading float array types, so they can be imported as string types and converted to char* for subsequent storage and access, and the implementation details can refer to the feature_float.cpp file.
+
+The specific execution process is as follows:
+
+Compile the imported plugin in the build directory.（Skip if TuGraph has been compiled）:
+
+`make feature_float_embed`
+
+Execute in the build/output directory:
+
+`./algo/feature_float_embed ./coradb`
+
+Then the conversion can be performed.
+
+## 6. Sampling Operators and Compilation
+TuGraph implements an operator for obtaining the full graph data and four sampling operators at the cython layer, as follows:
+
+### 6.1.Sampling Operator Introduction
+|Sampling Operator | Sampling Method |
+| --- | --- |
+|GetDB | Get the graph data from the database and convert it into the required data structure |
+|Neighbor Sampling | Sample the neighboring nodes of the given node to obtain the sampling subgraph |
+|Edge Sampling | Sample the edges in the graph according to the sampling rate to obtain the sampling subgraph |
+|Random Walk Sampling | Conduct a random walk based on the given node to obtain the sampling subgraph |
+|Negative Sampling | Generate a subgraph of non-existent edges|
+
+### 6.2.Compilation
+Skip if TuGraph has been compiled.
+Execute in the tugraph-db/build folder:
+
+`make -j2`
+
+Or execute in the tugraph-db/learn/procedures folder:
+
+`python3 setup.py build_ext -i`
+
+Once the algorithm so is obtained, it can be used by importing it in Python.
+
+## 7. Model Training and Storage
+TuGraph calls the cython layer operator at the Python layer to implement graph learning and training.
+
+The usage of the TuGraph graph learning module is as follows:
+
+Execute in the build/output folder:
+
+`python3 train_full_cora.py --model_save_path ./cora_model`
+
+Then training can be performed.
+
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+## 8. Model Loading
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+Before using a saved model, it is necessary to load it first. In the code above, the trained model is loaded using the provided code.
+
+After loading the model, we can use it to make predictions and classifications for new vertices and edges. For prediction, we can input one or multiple vertices and the model will output corresponding prediction results. For classification, we can input the whole graph, and the model will classify the vertices and edges in the graph to achieve the task goal.
+
+Using a trained model can save time and resources compared to retraining the model. Additionally, since the model has already learned the relationships between vertices and edges in the graph, it can adapt well to new data and improve the accuracy of predictions and classifications.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
new file mode 100644
index 0000000000..c649fa50e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
@@ -0,0 +1,102 @@
+# Sampling API
+
+>This document provides a detailed guide on using the Sampling API of TuGraph.
+
+## 1. Overview
+This manual introduces the Sampling API using TuGraph.
+
+## 2. Graph Data Instantiation
+Before the sampling operation, load the graph data according to the graph data path, and map it into the olapondb graph analysis class, the code is as follows:
+
+```python
+galaxy = PyGalaxy(args.db_path) # Create a galaxy instance based on the path
+galaxy.SetCurrentUser(args.username, args.password) # Set the current user
+db = galaxy.OpenGraph('default', False) # Open the graph database specified by db
+txn = db.CreateReadTxn() # Create a transaction instance
+olapondb = PyOlapOnDB('Empty', db, txn) # Instantiate OlapOnDB based on the graph loading method, graph database instance, and transaction instance
+del txn
+del db
+del galaxy
+```
+## 3. Introduction to Sampling Operators
+The graph sampling operator is implemented in the cython layer and is used to sample the input graph. The generated NodeInfo is used to save point information such as feature attributes and label attributes, and EdgeInfo is used to save edge information. These metadata information can be used for features Extraction, network embedding and other tasks. Currently, the TuGraph graph learning module supports five sampling operators: GetDB, NeighborSampling, EdgeSampling, RandomWalkSampling, and NegativeSampling.
+
+### 3.1.RandomWalk Operator
+Random walks are performed a specified number of times around the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.2.NeighborSampling Operator
+A certain number of nodes are sampled from the first-degree neighbors of the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.3.NegativeSampling Operator
+The negative sampling algorithm is used to generate a subgraph of non-existent edges.
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+num_samples: The number of false edges to be generated.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.4.EdgeSampling Operator
+The edge sampling algorithm is used to generate a subgraph of sampled edges.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_rate: The sampling rate of the edges to be selected.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.5.GetDB Operator
+Get the graph data from the database and convert it into the required data structure.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+## 4. User-Defined Sampling Algorithm
+Users can also implement a custom sampling algorithm through the TuGraph Olap interface. For the interface document, see [here](../2.olap/5.python-api.md). This document mainly introduces the interface of related functions used by the graph sampling algorithm design.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md
new file mode 100644
index 0000000000..510f3d4fcd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/3.training.md
@@ -0,0 +1,96 @@
+# Training
+> This document details how to use TuGraph for training Graph Neural Networks (GNNs).
+
+## 1. Training
+When using TuGraph's graph learning module for training, it can be divided into two categories: full graph training and mini-batch training.
+
+Full graph training involves loading the entire graph from the TuGraph db into memory and training the GNN. Mini-batch training uses the sampling operator of the TuGraph graph learning module to sample the entire graph data and then input it into the training framework for training.
+
+## 2. Mini-Batch Training
+Mini-batch training requires the use of TuGraph's graph learning module's sampling operators, which currently support Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. The sampling result of the TuGraph graph learning module's sampling operator is returned in the form of a List.
+
+The following takes Neighbor Sampling as an example to introduce how to convert the sampled results into the training framework for format conversion.
+The user needs to provide a Sample class:
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. Load graph data
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+        # 2. Sampling method, the result is stored in NodeInfo and EdgeInfo
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+        # 3. Format conversion of the result to fit the training format
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+As shown in the code, the graph data is first loaded into memory. Then use the sampling operator to sample the graph data, and the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and the stored information results are as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Finally, we format the result to fit the training format. Here we use the DGL training framework, so we construct a DGL Graph using the result data, and then return the DGL Graph.
+
+Once we provide the TuGraphSample class, we can use it for Mini-Batch training. Let the data loading part of DGL use the sampler instance of TuGraphSample as follows:
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+Use DGL for model training:
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+## 3. Full-Batch training
+Full-Batch training of GNNs (Graph Neural Networks) is a type of training that involves processing the entire training dataset at once. It is one of the simplest and most straightforward training methods for GNNs, where the entire graph is treated as a single instance. In full-batch training, the entire dataset is loaded into memory and the model is trained on the entire graph. This type of training is especially useful for small to medium-sized graphs, and is mainly used for static graphs that do not change over time.
+```python
+getdb. Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+The full graph are then fed into the training framework for training.
+Full code: learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..556c3c1fd0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/4.heterogeneous_graph.md
@@ -0,0 +1,101 @@
+# Heterogeneous Graph
+
+> This document describes how to use heterogeneous graphs for training.
+
+## 1. Introduction to Heterogeneous Graph
+A heterogeneous graph is a graph structure composed of nodes and edges of different types. In a heterogeneous graph, nodes and edges can have diverse attributes and relationships, representing different entities and their complex associations.
+
+In a heterogeneous graph, node types can represent different entities such as users, products, topics, etc., while edge types represent the relationships between different entities, such as the follow relationship between users, or the purchase relationship between users and products. Nodes and edges can have different attributes.
+
+Heterogeneous graphs provide a powerful graph model that can better express and analyze real-world systems with multiple entity types and complex relationships. They have broad application prospects and research value in various fields of data analysis and applications.
+
+## 2. Creating a Heterogeneous Graph
+In TuGraph, a heterogeneous graph is composed of a series of edge relationships. Each relationship is defined by a triplet of strings: (source node type, edge type, target node type). The creation of a heterogeneous graph is similar to that of a homogeneous graph, but the triplet definition needs to be specified when creating the graph. The following example demonstrates:
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+In the code snippet above, the fourth parameter is the edge relationship definition of the heterogeneous graph. By specifying this parameter, you can select specific node and edge types for graph construction and training. If this parameter is not specified, all node and edge types will be used for graph construction by default.
+
+## 3. Heterogeneous graph query interface
+To facilitate user usage, TuGraph provides interfaces for querying node and edge types when the fourth parameter is given. The following examples demonstrate these interfaces:
+
+### 3.1 Querying Node Types
+```python
+olapondb.ntypes()
+```
+The return value is a list of node types, such as ['node1', 'node2', 'node3'].
+
+### 3.2 Querying Edge Types
+```python
+olapondb.etypes()
+``` 
+The return value is a list of edge types, such as ['edge1', 'edge2', 'edge3'].
+
+### 3.3 Querying Node and Edge Types
+```python
+olapondb.metagraph()
+```
+The return value is a list of string triplets (source node type, edge type, target node type), such as
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')].
+
+## 4 Heterogeneous graph output format
+The same as the homogeneous graph, the sampling data results of the heterogeneous graph are also stored in NodeInfo and EdgeInfo.
+Output data can be obtained in the following ways.
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+
+The result of its stored information is as follows:
+| Graph Data | Storage Location |
+| --- | --- |
+| Edge Source | EdgeInfo[0] |
+| Edge Destination | EdgeInfo[1] |
+| Edge Type | EdgeInfo[2] |
+| Vertex ID | NodeInfo[0] |
+| Vertex Feature | NodeInfo[1] |
+| Vertex Label | NodeInfo[2] |
+| Vertex Type | NodeInfo[3] |
+
+## 5. Training Heterogeneous Graphs
+The goal of training a heterogeneous graph is to learn the representation of nodes and edges in the graph for subsequent tasks such as node classification, link prediction, and graph clustering. To achieve this goal, researchers have proposed a variety of models based on graph neural networks (GNNs). These models update the representation of nodes by aggregating the information of neighboring nodes, thereby capturing the complex relationships in the graph structure.
+
+Since heterogeneous graphs contain nodes and edges of multiple types, it is necessary to consider how to process these different types of information when designing GNN models. One common approach is to design different aggregation functions to process different types of neighboring nodes. In addition, it is also necessary to consider how to integrate these different types of information together so that the model can effectively learn the representation of nodes and edges.
+
+TuGraph provides a method for training heterogeneous graphs using the ogbn-mag dataset, which can be used for reference.
+
+The official docker provided by TuGraph does not yet provide an environment for heterogeneous graph training, so users need to install relevant dependency packages by themselves.
+Before training, you need to download the ogb and pandas packages. The specific installation method is as follows:
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+The training code looks like this:
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    # print('load time', load_time - s, 'train_time', train_time - load_time)
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+The complete training code can be found in tugraph/learn/examples/train_full_mag.py.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/index.rst
new file mode 100644
index 0000000000..fbc920ad54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/5.learn/index.rst
@@ -0,0 +1,8 @@
+TuGraph Learn
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/index.rst
new file mode 100644
index 0000000000..ea54cb9c63
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/6.interface/index.rst
@@ -0,0 +1,12 @@
+TuGraph DB Interface
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.query/index.rst
+   2.olap/index.rst
+   3.procedure/index.rst
+   4.protocol/index.rst
+   5.learn/index.rst
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/7.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/7.quality/1.unit-testing.md
new file mode 100644
index 0000000000..2cdb8d3f31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/7.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# Unit Testing
+
+> This document is the unit testing documentation for TuGraph.
+
+## 1.Introduction
+
+TuGraph unit testing uses the gtest framework, which can choose to run all tests at once or specify certain tests.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/7.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/7.quality/2.integration-testing.md
new file mode 100644
index 0000000000..b98cf7f62a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/7.quality/2.integration-testing.md
@@ -0,0 +1,400 @@
+# Integration Testing
+
+> This document mainly introduces how to use the TuGraph integration testing framework.
+
+## 1.The Significance of TuGraph Integration Testing
+
+In unit tests and function tests, some test cases directly use Galaxy or Statemachine to perform tests, which is not a complete process. In the complete CS architecture, user requests are sent to the server through the client, and network communication is essential. To avoid bugs caused by incomplete unit testing, TuGraph uses an integration testing framework to perform end-to-end testing.
+
+## 2.TuGraph Integration Testing Framework
+
+TuGraph uses the Pytest framework as its integration testing framework. Pytest is currently the most widely used CS-side integration testing framework. It is known for its flexibility, ease of use, and the ability to support parameterization. Based on the functionality provided by Pytest, TuGraph abstracts different tools and controls the processing logic of each tool through parameters to facilitate efficient testing code development.
+
+For more information on Pytest, please refer to the official website: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.Component Description
+
+| Component Name    |Component Function      | Implementation Method                              |
+| --------------- | -------------------------- | ------------------------------------------------ |
+| server          | TuGraph standalone service | Start a child process and launch the service       |
+| client          | TuGraph Rpc Client         | Open TuGraph Python Rpc Client in the current process and send requests  |
+| importor        | TuGraph Importor           | Start a child process to process import requests               |
+| exportor        | TuGraph Exportor           | Start a child process to process export requests               |
+| backup_binlog   | TuGraph Backup Binlog      | Start a child process to process binlog backup requests       |
+| backup_copy_dir | TuGraph Backup             | Start a child process to process full db backup requests       |
+| build_so        | Component for compiling C++ dynamic libraries    | Start a child process to handle GCC compilation logic            |
+| copy_snapshot   | TuGraph Copy Snapshot      | Handle backup snapshot requests in the current process                 |
+| copydir         | Folder copy                 | Handle folder copy requests in the current process                     |
+| exec            | Execute C++/Java executable files     | Start a child process to launch the C++ executable file  |
+| algo            | Execute algorithm                   | Start a child process to run the algorithm     |
+| bash            | Execute bash commands               | Start a child process to execute bash commands      |
+| rest            | TuGraph Python Rest Client | Open TuGraph Python Rest Client in the current process and send requests|
+
+### 2.2.Component Usage
+
+#### 2.2.1.server
+
+##### 2.2.1.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The server will be started before the function starts executing, and the server will be stopped and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ host is the IP and port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to the user in the TuGraph Server
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The client will be started before the function starts executing, and the client will be stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.Startup Command
+
+Import the tool through the fixtures component and control the import of different data through startup parameters. The data will be imported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.Startup Command
+
+Import the tool through the fixtures component and control the export of different data through startup parameters. The data will be exported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.Startup Parameters
+采用python字典传入
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different binlogs through startup parameters. The binlogs will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different databases through startup parameters. The database will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command, passed in as a Python list, and multiple so can be compiled at once
++ so_name is the dynamic library that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.Startup Command
+
+Import the tool through the fixtures component and control the compilation of different dynamic libraries through startup parameters. The dynamic libraries will be generated to the specified directory before the function starts executing, and the dynamic libraries specified in the so_name list will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original database
++ dst is the snapshot copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.Startup Command
+Import the tool through the fixtures component and control the copying of different snapshots through startup parameters. The snapshot in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original directory
++ dst is the directory copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.Startup Command
+Import the tool through the fixtures component and control the copying of different directories through startup parameters. The directory in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.Startup Command
+Import the tool through the fixtures component and control the execution of different logic through startup parameters. A child process will be started to execute the command passed in through the cmd parameter before the function starts executing.
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ result is the expected execution result of the algorithm. After execution is completed, the actual result will be compared with the expected result. If they are different, the test will fail.
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.Startup Command
+Import the tool through the fixtures component and control the execution of different algorithm logic through startup parameters. A child process will be started to execute the algorithm passed in through the cmd parameter before the function starts executing. The function body will wait for the algorithm to complete and compare the result with the expected result.
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.Startup Command
+
+Import the tool through the fixtures component and control the execution of different bash commands through startup parameters. A child process will be started to execute the bash command passed in through the cmd parameter before the function starts executing. The function body will wait for the command to complete.
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ port is the port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to user in TuGraph Server
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.Startup Command
+
+Import the tool through the fixtures component and link to different TuGraph Rest Servers through startup parameters. The client will be started before the function starts executing and stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.Test Cases
+
+#### 2.3.1.rest
+
+In the sample code, before the test_get_info function is executed, the server is started, and a rest client is started after the server is started. After entering the test_get_info function, some information about the server is obtained, and assert is used to determine whether cpu information is obtained.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+In the sample code, before the test_flushdb function is executed, the offline data import logic is executed and the server is started. After creating a connection through the client, the function enters the test_flushdb function. The number of points is queried to determine whether the import is successful. After the import is successful, the flushDB operation is executed. assert is used again to determine whether the db can be emptied normally.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+In the sample code, before the test_export_default function is executed, the offline data import logic is executed. After the import is successful, the data of the current db is exported. Then, the offline import logic is used again to import the exported data into a new directory. The newly imported data is used to start the db and create a connection. In the body of the test_export_default function, it is determined whether the data after export and import is consistent with the original data.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.Other Tests
+For more test cases, please refer to the integration test code [https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/7.quality/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/7.quality/index.rst
new file mode 100644
index 0000000000..c6be070cb8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/7.quality/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Quality
+==============================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/1.privilege.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/1.privilege.md
new file mode 100644
index 0000000000..59c569b9f7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/1.privilege.md
@@ -0,0 +1,135 @@
+# Privilege
+
+## 1.Introduce
+
+> The permissions of TuGraph are managed based on role-based access control. The permissions that define access control are assigned to roles, and the roles are then assigned to users.
+
+## 2.Level of permissions
+
+- Global layer: indicates global permissions, which have permissions for management and graph operations.
+- Graph layer: control permissions on each graph;
+- Property level (Commercial version only) : control permissions on a property
+
+## 3.Permission keyword
+
+At present, the control of permissions is relatively simple
+
+- The Global layer currently has admin permission, and the admin user is preset.
+
+* The Graph layer has four operation permissions: none, read, write, and full
+
+- none: No permission, no operation permission for the graph
+- read: Read-only permission, only has read permission for the graph
+- write: Read and write permission, not only has read permission for the graph, but also has write permission
+- full: All permissions, not only have read and write permissions for graphs, but also have permissions to delete graphs, modify graphs, and modify schemas
+
+* The Property layer (Commercial version only)  has the following permissions: none, read, and write
+
+- none: No permission, no operation permission for the property
+- read: Read-only permission, only has read permission for the property
+- write: Read and write permission, not only has read permission for the property, but also has write permission
+
+## 4.Common permission operations
+
+### 4.1.User action
+
+- Creating a user
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- Deleting a user
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- Change the password of the current user
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- Changes the password of a specified user
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- Disable or enable a user
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- List all users
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- Lists the current user information
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- Obtain user details
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.Role actions
+
+- Create a role
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- Delete a role
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- List all characters
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- Disable or enable the role
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.Assign roles to users
+
+- Adds the association between the user and the role
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- Deletes the association between the user and the role
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- Clears the relationship between user roles and rebuilds them
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.Role empowerment
+
+- Modifies the access permission of a role to a specified graph
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/2.token.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/2.token.md
new file mode 100644
index 0000000000..28d037abc2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/2.token.md
@@ -0,0 +1,42 @@
+# Token Usage Guide
+## 1. Introduction to Token
+JWT (JSON Web Token) is an open standard used for authentication and authorization. It is based on the JSON (JavaScript Object Notation) format and is designed for securely transmitting claim information between network applications.
+
+JWT consists of three parts: the header, payload, and signature. The header contains the type of JWT and the signature algorithm used, the payload contains the information to be transmitted, and the signature is used to verify the integrity and authenticity of the JWT.
+
+In TuGraph, JWT is used to implement a stateless authentication and authorization mechanism. After a user logs in successfully, the server generates a JWT and returns it to the client. The client passes this JWT as an identity credential in subsequent requests to the server. Upon receiving the JWT, the server verifies the signature and parses the information in the payload to determine the user's identity and permissions, and decides whether to allow the execution of the request.
+
+## 2. Token Expiration
+### 2.1. Browser Token Interaction Logic
+1. The user opens the browser, enters the username and password, and clicks login.
+2. The frontend calls the login interface and inputs the account and password to the backend.
+3. After receiving the account and password, the backend verifies them and returns a Token.
+4. The frontend stores the Token in the browser cache, and all subsequent requests must carry this Token.
+5. If the frontend actively clicks logout or closes the page, it should actively call the logout interface and pass the Token to the backend.
+6. After receiving the Token, the backend invalidates it, returns a status code 200, and "logout successful". After receiving the message, the frontend clears the Token in the browser memory, and returns to the login page.
+7. The Token expires (initially set to 24 hours), and the user needs to log in again.
+### 2.3. Token Expiration Refresh Mechanism
+Token expiration has a refresh mechanism that is turned off by default. If turned on, the security of the Token will be higher, and there will be two timestamps.
+
+The first timestamp `refresh_time` is used to determine whether the Token has expired (default 24 hours): after expiration, the refresh interface can be called to obtain a new Token, which can be set to a shorter time, such as 1 hour.
+
+The second timestamp `expire_time` is the forced expiration timestamp (default 24 hours): after expiration, the user must log in again.
+
+### 2.4. Token Expiration Modification
+To facilitate developers to develop on their own, TuGraph provides two ways to modify the expiration time, both of which require admin privileges.
+
+* Set through the interface call. The interfaces involved in modifying the expiration time are `update_token_time` and `get_token_time` for querying the expiration time. For details, please refer to the [REST interface document](../../5.developer-manual/6.interface/4.protocol/1.restful-api-legacy.md).
+* Set through startup parameters. When the server-side is started, adding the parameter `-unlimited_token 1` can set the Token to be unlimited. Please refer to the [service running document](../../5.developer-manual/2.running/2.tugraph-running.md) for details.
+## 3. Introduction to Token-Related Requests Sent by Clients
+The client handles two types of protocol-related requests: REST and RPC.
+
+### 3.1. REST
+If the client uses the REST protocol (including the browser), because it is a short connection, Token needs to be carried in every request, and a new Token needs to be obtained after it expires.
+
+For self-developed clients, if the REST protocol is used, Token logic needs to be considered.
+
+### 3.2. RPC
+If the client uses the RPC protocol (including the official C++/Java/Python), it uses a long connection to maintain, and no Token operation is involved after login.
+
+## 4. Token upper limit
+The upper limit of Token refers to the maximum number of Tokens that a user can own at the same time. To prevent unlimited logins, the upper limit of Token is 10000 by default. Since the token generation logic is strongly related to time, a token will be generated for storage every time you log in. The validity period of the token is 24 hours by default. Therefore, it is recommended to log out the unused token in time after login.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/3.reset_admin_password.md
new file mode 100644
index 0000000000..706d377c16
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/3.reset_admin_password.md
@@ -0,0 +1,20 @@
+# Forgot Admin Password
+> TuGraph provides a password reset feature. If you forget the password for the admin account, you can reset it by following these steps.
+
+## 1. Reset Password
+First, stop the TuGraph server.
+
+When starting the TuGraph server again, add the following parameter:
+```bash
+--reset_admin_password 1
+```
+
+Here is an example:
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+This operation will reset the password for the admin account to the default password: 73@TuGraph when starting the TuGraph server.
+If the password reset is successful, you will receive the message "Reset admin password successfully" and the current server process will be closed.
+
+You need to restart the server in normal mode and then use the default account and password to log in. After logging in, you can reset the password to continue using TuGraph.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/index.rst
new file mode 100644
index 0000000000..d2e81f6ec7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/8.other/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB Other
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/index.rst
new file mode 100644
index 0000000000..4900dd0189
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/5.developer-manual/index.rst
@@ -0,0 +1,15 @@
+TuGraph DB Developer Manual
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.installation/index.rst
+   2.running/index.rst
+   3.server-tools/index.rst
+   4.client-tools/index.rst
+   5.ecosystem-tools/index.rst
+   6.interface/index.rst
+   7.quality/index.rst
+   8.other/index.rst
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..c73d0e0624
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/1.contributing.md
@@ -0,0 +1,93 @@
+# TuGraph Contribution Guide
+
+## 1. Preface
+
+Thank you for your contribution to TuGraph. We sincerely hope that more students from the community will join in and build a better graph database project together.
+
+For outstanding community contributors, we will award the TuGraph Outstanding Community Contributor Certificate.
+
+## 2. What to contribute
+
+We welcome any contribution at any time, whether it's a simple typo fix, bug fix, or new feature addition. Feel free to ask questions or initiate PRs. We also value documentation and integration with other open source projects, and welcome contributions in this regard. For any modification, especially the more complex modification, it is recommended to create an issue and fill it out according to the BUG or PR template.
+
+## 3. Preparation
+
+## 3.1. Knowing TuGraph
+
+You can get start with TuGraph follow instrcutions in [Guide Doc](../1.guide.md).
+
+## 3.2. Environment
+
+For document contributions, you can directly modify and submit a pull request by clicking on "Edit on GitHub" in the upper right corner of the [documentation](https://tugraph-db.readthedocs.io/en/latest).
+
+For code contributions, it is usually necessary to set up the environment for compilation and execution. You can deploy using [Docker](../5.developer-manual/1.installation/3.docker-deployment.md) or [local package deployment](../5.developer-manual/1.installation/4.local-package-deployment.md).
+
+## 3.3. License Agreement
+
+Before contributing code, please take some time to understand the process of contributing code to TuGraph, and read the [Contributor License Agreement](3.individual-cla.md) or [Corporate Contributor License Agreement](4.corporate-cla.md). Participating in the contribution is deemed to agree to the above agreement.
+
+## 4. Contribute code process
+
+### 4.1. Submit the issue
+
+Whether you are fixing a bug in TuGraph or adding a new feature to TuGraph, before you submit the code, submit an issue on TuGraph's GitHub, describing the problem you want to fix or the function you want to add. There are several advantages to doing this:
+
+- There will be no duplication of work in conflict with other developers or their plans for the project.
+- TuGraph maintainers will discuss the bugs or new features you mentioned to determine whether the modification is necessary, whether there is room for improvement or a better way.
+- After reaching an agreement, develop and submit the code, reducing the cost of communication between the two parties and reducing the rejection of pull requests.
+
+### 4.2. Pull the branch
+
+All modifications of TuGraph are made on branches. After modification, the pull request is submitted and merged into the Master by the project maintenance personnel after Code Review. Therefore, after the source code steps are described, you need:
+
+1. Download the code to a local directory. In this step, you can choose git or https. In recent years, github has stricter permission requirements. The git approach, for example, requires the more complex ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)). https authentication cannot be performed using the user name and password. git clone https://github.com/ Your account name /tugraph-db
+2. Pull branch ready to modify code:
+   git branch add_xxx_feature
+3. After executing the above command, your code repository switches to the appropriate branch. Run the following command to view your current branch: git branch -a
+4. If you want to switch back to Master, run the git checkout -b master command
+5. If you want to switch back to branching, run the following command: git checkout -b "branchName"
+
+### 4.3. Configuring Github Information
+
+Run git config --list on your machine to view git's global username and mailbox. Check whether the displayed user.name and user.email match your github user name and email address.
+
+If a company has its own gitlab in-house or uses other commercial GitLabs, a mismatch may occur. At this point, you need to set up a separate user name and mailbox for the tugraph-db project. For details about how to set the user name and email address, see github's official documentation.
+
+### 4.4. Compile and Run
+
+The process of compile and run can reference [ci script](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. Change the code and submit it locally
+
+Once you've pulled the branch, you're ready to change the code.
+
+**Code modification Notes**
+
+Code style consistency: TuGraph uses cpplint to keep code in the same format, and IDE can use.clang to configure the style. Be sure to check the code style locally before submitting it, or ACI will report an error.
+
+Add unit test code: New changes should pass through existing unit tests. New unit tests should be provided to prove that there are bugs in the previous code and that the new code has resolved these bugs. You can run all tests with the following command:./unit_test
+It can also be run with the help of an IDE.
+
+**Other precautions**
+
+Please keep the code you are editing in the original style, especially the space feed, etc. For unnecessary comments, delete them directly. Add comments where logic and functionality are not easily understood. Keep documentation up to date. After modifying the code, run the following command to submit all the changes to the local computer:
+git commit -am '(feat) Add the xx function 'git commit -am '(fix) fix xx problem' '
+
+Submit the code to the remote repository
+After the code is committed locally, you can then synchronize the code with the remote repository. Run the following command to submit local changes to github: git push origin "branchname"
+
+If you were forking earlier, the origin here is pushed to your code repository, not TuGraph's.
+
+After the code has been submitted to GitHub, you can send a request to merge your changes into the TuGraph Master. At this point, you need to go to your corresponding repository on GitHub and press the pull request button in the upper right corner. Select the target branch, which is usually the master, and the system will notify the TuGraph staff, who will Review your code, and when it meets the requirements, it will join the main branch and become part of TuGraph.
+
+Please note that the CI will be automatically checked, as well as all Commits signing the cla, with green signs on the commits.
+
+### 4.6. Code Review
+
+After you submit your code, your code will be assigned to a maintainer for Review. Please wait patiently. If no one has responded to your submission after two working days, you can leave a message under PR and @ the corresponding person.
+
+Comments on code Review will be directly noted to the corresponding PR or Issue. If you find the suggestions reasonable, please update them to your code.
+
+### 4.7. Merge code into Master
+
+After the code Review is approved, the TuGraph maintainer will put it into the Master. During this process, the maintainer may specify a new Reviewer and put forward new comments that need to be revised. Normally this step is omitted, and after the code is merged, you will receive an indication that the merge was successful.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..27cff88ae8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/2.community-roles.md
@@ -0,0 +1,72 @@
+# TuGraph community roles
+
+## 1. Preface
+
+This document describes the roles of membership in the TuGraph community, the requirements and permissions for each role.
+
+## 2. Role summary
+
+This is the division of roles in the TuGraph community, describing the responsibilities of each role, the requirements to become and remain a role, and the permissions of the corresponding role.
+
+Our community is divided into three roles based on the Apache specification:
+
+- Contributor
+- Maintainer
+- PMC
+
+The requirements, responsibilities, and authorities for each role are described below.
+
+## 3. Contributor
+
+### 3.1. requirements
+
+Successfully submit a PR and merge in any of TuGraph's official projects.
+
+### 3.2. responsibility
+
+- Actively respond to issues or PR assigned to you
+- Help reply the issue/pr together and assign the issue to the person in charge of the corresponding module
+
+### 3.3. permissions
+
+- Join the TuGraph GitHub organization and become a member of the TuGraph open source community.
+
+## 4 Maintainer
+
+### 4.1. requirements
+
+The new Committer is recommended by the existing PMC and approved by 2/3 of the votes. The Commiter meets at least one of the following conditions:
+
+- Been a community member for more than three months
+- More than 10 PR for PMC approve
+- Complete major functions
+- Fixed serious bugs
+- Follow project development and participate in community discussion
+
+### 4.2. responsibility
+
+- Community counseling support
+- Actively respond to issues or PR assigned to you
+- The right to vote on major community decisions
+- Review community PR
+
+### 4.4. permissions
+
+- Pull Request review permission
+
+## 5. PMC
+
+### 5.1. requirements
+
+- Not open at the moment, if you have a strong desire please contact PMC
+
+### 5.2. responsibility
+
+- Actively participate in community discussions and give guidance to major community decisions
+- Responsible for ensuring that the community activities of open source projects are running smoothly
+
+### 5.3. permissions
+
+- Pull Request review permission
+- Pull Request approve permission
+- Community role member management
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..4798fc9db4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# Individual Contributor License Agreement
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..5ff3ff31e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# Corporate Contributor License Agreement
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..379ecef880
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/5.roadmap.md
@@ -0,0 +1,68 @@
+# TuGraph Roadmap
+
+## 1. Introduction
+
+This document outlines the future development plans for TuGraph, including features currently under development, those not in the development pipeline, and completed functionalities not included in the open-source version.
+
+TuGraph aims to be an open-source, high-performance graph database. It adopts a centralized storage approach for graph data and, in the short term, does not consider data sharding. Instead, it employs a master-slave replication mode to address high-concurrency read scenarios, while utilizing cloud-based storage solutions to address storage capacity challenges.
+
+## 2. Completed Functionalities
+
+TuGraph was open-sourced on September 1, 2022, and has received regular bug fixes and enhancements based on community feedback.
+
+| Version | Functionality | Date |
+| --- | --- | --- |
+| 3.3.0 | Initial open-source release | 2022.9.1 |
+| 3.3.1 | Refactored graph analysis engine with multi-mode support | 2022.10.14 |
+| 3.3.2 | Added OGM support and improved unit test coverage | 2022.11.21 |
+| 3.3.3 | Iterative improvements to link authentication mechanism and addition of English documentation | 2022.12.23 |
+| 3.3.4 | Cloud deployment support and streamlined LDBC SNB Audit process | 2023.1.28 |
+| 3.4.0 | Added support for OLAP Python API and upgraded offline data import | 2023.3.11 |
+| 3.5.0 | Introduced POG (Procedures On Graph query language), frontend upgrades | 2023.6.5 |
+| 3.5.1 | Added learning engine, Procedure Rust API, and storage-property separation | 2023.7.14 |
+
+In addition, TuGraph has established a comprehensive quality system, including automated unit testing, integration testing, and performance testing.
+
+
+
+## 3. Roadmap of 2023 S2
+
+The planned high availability feature was delayed in the first half of the year, while the graph learning capability was iterated earlier than scheduled. The second half of the year will focus on completing the high availability feature and being the first to support a pre-print version of ISO GQL.
+
+| Version | Functionality | Planned Date |
+| 3.6.0 | High availability support | 2023.8 |
+| 4.0.0 | ISO GQL language support  | 2023.10 |
+
+## 4. Functional Updates in 2023
+
+In addition to the aforementioned core functionalities, the following components are planned for development in 2023.
+
+|Version|	Functionality|	Planned Date|
+| --- | --- | --- |
+|3.5.x	|Optimization of the logging system|2023.7|
+|3.5.x	|Cold backup support|	2023.9|
+|3.5.x	|Support for edge upsert import|	2023.9|
+|x.x.x	|Trigger support exploration|	2023.12|
+|x.x.x	|Exploring new storage engines|	TBD|
+|x.x.x	|Rapid schema addition and deletion|	TBD|
+|x.x.x	|TuGraph Browser version iteration|	TBD|
+|x.x.x	|Iteration of stored procedure Python API|	TBD|
+
+## 5. Community Collaboration Features
+
+Currently, the development team's resources are limited, and we cannot implement all the desired features for TuGraph. However, during the feature planning process, we have identified a range of ideas worth exploring. The team has conducted some initial exploration, and we welcome community collaboration in developing the following features:
+
+|Version	|Functionality	|Planned Date|
+| --- | --- | --- |
+|x.x.x	|Documentation improvements	|TBD|
+|x.x.x	|Enrichment of APOC tools	|TBD|
+|x.x.x	|Support for default property values	|TBD|
+|x.x.x	|Composite index for multiple properties	|TBD|
+|x.x.x	|Online full import support	|TBD|
+|x.x.x	|Enhanced graph permissions	|TBD|
+|x.x.x	|NLP (Natural Language Processing) support	|TBD|
+|x.x.x	|Java Procedure API	|TBD|
+|x.x.x	|Rapid database migration	|TBD|
+|x.x.x	|Spatiotemporal data support	|TBD|
+
+For simpler features, we will label them as "good first issue" on GitHub issues, and we welcome discussions from technology enthusiasts interested in graph databases.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/index.rst
new file mode 100644
index 0000000000..07fee7bd7a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/6.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Contributor Manual
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..6d9e4c58a5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# Importing Data from Relational Databases to TuGraph
+
+> Using [DataX](../5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md)，to be completed.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..f8b19f86be
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/2.learn_practices.md
@@ -0,0 +1,217 @@
+# Using TuGraph Graph Learning Module for Node Classification
+
+## 1. Introduction
+GNN is a powerful tool for many machine learning tasks on graphs. In this introductory tutorial, you will learn the basic workflow of using GNN for node classification, i.e., predicting the category of nodes in a graph.
+
+This document will show how to build a GNN for semi-supervised node classification on the Cora dataset with only a few labels, which is a citation network with papers as nodes and citations as edges. The task is to predict the category of a given paper.
+By completing this tutorial, you will be able to:
+
+Load the Cora dataset.
+
+Sample and build a GNN model using the sampling operator provided by TuGraph.
+Train the GNN model for node classification on CPU or GPU.
+
+This document requires some experience in using graph neural networks and DGL.
+
+## 2. Prerequisites
+The TuGraph graph learning module requires TuGraph-db version 3.5.1 or above.
+
+It is recommended to use Docker image tugraph-compile 1.2.4 or above for TuGraph deployment:
+
+tugraph/tugraph-compile-ubuntu18.04:latest
+
+tugraph/tugraph-compile-centos7:latest
+
+tugraph/tugraph-compile-centos8:latest
+
+The above images can be obtained on DockerHub.
+Please refer to [Quick Start](../3.quick-start/1.preparation.md) for specific operations.
+
+## 3. Import Cora Dataset to TuGraph Database
+### 3.1. Introduction to Cora Dataset
+The Cora dataset consists of 2708 papers, classified into 7 categories. Each paper is represented by a 1433-dimensional bag-of-words feature, indicating whether a certain word appears in the paper. These bag-of-words features have been preprocessed to be normalized to a range from 0 to 1. The edges represent citation relationships between papers.
+
+TuGraph has provided the Cora dataset import tool, which users can use directly.
+
+### 3.2. Data Import
+The Cora dataset is located in the test/integration/data/algo directory and contains the cora_vertices point set and the cora_edge edge set.
+
+First, the Cora dataset needs to be imported into the TuGraph database. Please refer to [Data Import](../5.developer-manual/3.server-tools/1.data-import.md).
+
+In the build/output section below the line:
+``` bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+The number of commands related to the relevant document is to be built/output.
+
+Execute the following command in the build/output directory:
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Here, cora.conf is the graph schema file representing the format of graph data, which can be found in test/integration/data/algo/cora.conf. coradb is the name of the graph data file after import, which represents the storage location of graph data.
+
+## 4. Feature Conversion
+Since the features in the Cora dataset are float arrays of length 1433, which are not supported by TuGraph for loading, they can be imported as strings and converted to char* for easier access later. The implementation can be referred to the feature_float.cpp file.
+The specific execution process is as follows:
+
+Compile the import plugin in the build directory.(Can be skipped if TuGraph has been compiled):
+`make feature_float_embed`
+
+Execute the following command in the build/output directory to perform the conversion:
+`./algo/feature_float_embed ./coradb`
+
+## 5. Compile Sampling Operator
+The sampling operator is used to obtain graph data from the database and convert it into the required data structure. The specific execution process is as follows:
+Can be skipped if TuGraph has been compiled.
+Execute the following command in the tugraph-db/build directory:
+`make -j2`
+
+or execute the following command in the tugraph-db/learn/procedures directory:
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *
+import importlib
+getdb = importlib.import_module("getdb")
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+As shown in the code, after obtaining the algorithm .so file, import and use it.
+
+## 6. Model training and saving
+TuGraph calls the operators of the cython layer in the python layer to realize the training of the graph learning model.
+The usage of the TuGraph graph learning module is introduced as follows:
+Execute under the build/output folder
+`python3 train_full_cora.py --model_save_path ./cora_model`
+You can start training.
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+The detailed training process is as follows:
+### 6.1. Data Loading
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+As shown in the code, load the data into memory based on the path of the graph data, username, password, and subgraph name. TuGraph can load multiple subgraphs for graph training, but we only load one subgraph here.
+
+### 6.2. Build Sampler
+During the training process, the GetDB operator is first used to obtain the graph data from the database and convert it into the required data structure. The specific code is as follows:
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+As shown in the code, the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and their stored information is as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Then a sampler is constructed:
+```python
+batch_size = 5
+count = 2708
+sampler = TugraphSample(args)
+dataloader = dgl.dataloading.DataLoader(fake_g,
+    torch.arange(count),
+    sampler,
+    batch_size=batch_size,
+    num_workers=0,
+    )
+```
+
+### 6.3. Convert the results to the required format
+```python
+src = EdgeInfo[0].astype('int64')
+dst = EdgeInfo[1].astype('int64')
+nodes_idx = NodeInfo[0].astype('int64')
+remap(src, dst, nodes_idx)
+features = NodeInfo[1].astype('float32')
+labels = NodeInfo[2].astype('int64')
+g = dgl.graph((src, dst))
+g.ndata['feat'] = torch.tensor(features)
+g.ndata['label'] = torch.tensor(labels)
+return g
+```
+The results are converted to the required format to fit the training format.
+
+### 6.4. Build the GCN model
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+def build_model():
+    in_size = feature_len  # feature_len is the length of features, which is 1433 here
+    out_size = classes  # classes is the number of classes, which is 7 here
+    model = GCN(in_size, 16, out_size)  # 16 is the size of the hidden layer
+    return model
+```
+In this tutorial, a two-layer Graph Convolutional Network (GCN) will be built. Each layer aggregates neighbor information to compute new node representations.
+
+### 6.5. Train the GCN model
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #If you need to save the model, give the model save path
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+As shown in the code, iterative training is performed 50 times according to the defined sampler, optimizer and model, and the trained model is saved to the path model_save_path.
+
+The output is as follows:
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+The graph learning module can be accelerated by using a GPU. If users want to run it on the GPU, they need to install the corresponding GPU driver and environment. For details, please refer to learn/README.md.
+
+The complete code can be found in learn/examples/train_full_cora.py.
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..5eac1fdd6a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# Data Migration
+
+## 1 Introduction
+Data migration refers to the process of moving data from one system, storage medium, or application to another system, storage medium, or application. When TuGraph needs to be upgraded or the system hardware environment changes,
+The data in the original TuGraph service needs to be migrated. Based on the system hardware environment and software version, this paper divides data migration into three schemes:
+1. Compatible migration: When the system environment before and after the migration is consistent and the TuGraph software is compatible, you can directly use the backup and recovery method to migrate data;
+2. Upgrade and migration: When the system environment before and after the migration is inconsistent or the TuGraph software is not compatible, it is necessary to migrate the data by first exporting the data and then re-importing;
+3. Online migration: When data migration is performed on a high-availability cluster and the network environment of the cluster is good, the original cluster can be smoothly switched to the new cluster by adding or deleting nodes.
+The following article will introduce these three schemes in detail.
+
+## 2. Compatible Migration
+Compatible migration means that when the system environment remains unchanged and the TuGraph software version is compatible, the data and stored procedures of the original service can be used in the new service, so it can be directly migrated.
+Users can first use the `lgraph_backup` tool to back up the data, then transfer the data to a new machine and restart the service. The specific migration steps are as follows:
+
+### 2.1. Backup data
+Backup data using `lgraph_backup` tool
+```bash
+   lgraph_backup -s db -d db.bck
+```
+You can also directly use the `cp` command in this step, but the `cp` command will copy some redundant metadata, and the raft metadata will also be copied in the HA mode, causing the cluster to fail to restart after migration.
+Therefore, it is recommended to use the `lgraph_backup` tool instead of the `cp` command during data migration.
+
+### 2.2. Start a new service
+Use the following command to start the new service, and the stored procedure will be automatically loaded into the new service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. Stop the original service
+Use the following command to stop the original service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. Upgrade migration
+When the user wants to migrate the original service to a differentiated environment (such as migrating from centos7 to ubuntu18.04), or when the version of TuGraph changes greatly and is incompatible (such as 3.4.0 and 3.6.0),
+Users can first use the `lgraph_export` tool to export the data into a file, transfer it to a new machine, and then use the `lgraph_import` tool to re-import and restart the cluster.
+This can ensure that it can be used in the new environment, but the efficiency is low, and the stored procedure needs to be reloaded. The specific migration steps are as follows:
+
+### 3.1. Export data
+Use the `lgraph_export` tool to export the data and transfer the data to the new machine
+```bash
+   lgraph_export -d db -e db.export
+```
+
+### 3.2. Import data
+Use the `lgraph_import` tool to import data and manually load the stored procedure (see [client operation steps](../5.developer-manual/4.client-tools/2.cpp-client.md) for details)
+```bash
+   lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. Start a new service
+Start the new service with the following command
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. Stop the original service
+Use the following command to stop the original service
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. Online Migration
+When performing data migration on the server cluster deployed by the high-availability version of TuGraph, if the network bandwidth is sufficient, you can directly migrate the service online by adding or deleting nodes. The specific migration steps are as follows:
+
+### 4.1. Copy data
+Use the following commands to copy the data on the leader node and transfer it to the machine nodes of the new cluster. Since the leader node has the most complete raft log, copying the leader's data can minimize
+The time for the log to catch up.
+```bash
+   cp -r db db.cp
+```
+### 4.2. Starting a new node
+Use the following command to join the new node to the cluster. After joining the cluster, the incremental data will be automatically synchronized to the new node
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. Stop the original node
+Stop the original node service, and send subsequent application requests directly to the new cluster
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/4.selection.md
new file mode 100644
index 0000000000..159c9d3b35
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# Environment and version selection
+
+> This document introduces how to select the system environment and deployment method
+
+## 1 Introduction
+
+TuGraph provides differentiated system environments and deployment methods for users with different needs to meet the needs of different users such as novices, system developers, production operation and maintenance personnel, and researchers.
+
+## 2. Environmental capability selection
+
+Users can choose different environments based on actual usage scenarios. The compilation environment has the most complete capabilities and requires more third-party software. Correspondingly, the streamlined operating environment requires almost no installation of any dependent libraries and can run TuGraph's basic functions except stored procedures.
+
+| Environment                      | Purpose                                     | Remarks                                 |
+|----------------------------------|---------------------------------------------|-----------------------------------------|
+| Compilation environment          | Compile TuGraph from source                 | For developers                          |
+| Running environment              | Run TuGraph installation package            | Applicable to most users                |
+| Simplified operating environment | Run simplified TuGraph installation package | Less dependence on the operating system |
+
+For a detailed introduction to different environments, see [link](../5.developer-manual/1.installation/2.environment-mode.md).
+
+## 3. Deployment method selection
+
+TuGraph deployment only requires one server (high availability mode requires multiple servers), and you can choose a suitable deployment method based on actual resource conditions and usage scenarios.
+
+| Deployment method | Description | Remarks |
+|----------|-----------------------|--------------- -------------------------------------------------- --------------------------|
+| Cloud deployment | Alibaba Cloud Computing Nest one-click deployment, free trial | Suitable for novices, process reference [Link](../5.developer-manual/1.installation/5.cloud-deployment.md) |
+| Docker deployment | Cross-platform deployment through pre-prepared Docker images | Users with hardware requirements, such as performance testing, please refer to [link](../5.developer-manual/1.installation/3.docker-deployment. md) |
+| Local deployment | Tightly coupled deployment in existing systems | Applicable to specified production environment, refer to the process [Link](../5.developer-manual/1.installation/4.local-package-deployment.md) |
+
+## 4. Next steps
+
+After the deployment is completed, you can proceed to [Start Service](../5.developer-manual/2.running/2.tugraph-running.md) and [Data Import](../5.developer-manual/3. server-tools/1.data-import.md) and other operations, you can also experience the entire process through [Sample Data](../3.quick-start/2.demo/1.movie.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/index.rst
new file mode 100644
index 0000000000..4292d5488f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/7.best-practices/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Best Practices
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/8.faq.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/8.faq.md
new file mode 100644
index 0000000000..5288de0798
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/8.faq.md
@@ -0,0 +1,35 @@
+# FAQ
+
+During the use of TuGraph, if you encounter problems, you can first check [User Documentation](https://github.com/TuGraph-db/tugraph-db/tree/master/doc/zh-CN). Second, check to see if the FAQ list below matches your question.
+
+1. **[Kernel Engine QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussion-4575385)**
+   1.1 [Does the edge of TuGraph support index? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165379)
+   1.2 [What is the QPS of a single TuGraph machine? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussion-4575381)**
+   2.1 [How to update the tugraph service after the visualization file is built? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165364)
+   2.2 [How to connect the existing tugraph service through npm run dev? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165366)
+   2.3 [TuGraph Browser version 3.3.0 failed to delete node label? ](https://github.com/TuGraph-db/tugraph-db/discussions/82#discussion-4465791)
+3. **[Client QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussion-4575378)**
+   3.1 [What programming languages ​​does the client currently have, and does it support node js? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165351)
+   3.2 [Does the python client support pip install? Where is the client referenced? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165353)
+4. **[Data Import QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussion-4575373)**
+   4.1 [Which common databases can TuGraph connect to? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165335)
+   4.2 [How to import data? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[Stored Procedure QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussion-4575369)**
+   5.1 [How to load stored procedure or algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165313)
+   5.2 [How to call or execute the stored procedure? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165317)
+   5.3 [Where is the open source built-in algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[Installation and deployment QA summary](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussion-4575364)**
+   6.1 [How to install using docker image? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165287)
+   6.2 [After the rpm package and deb package are installed, start the lgraph_server service. Prompt missing 'liblgraph.so' error? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165289)
+   6.3 [How to compile TuGraph on Mac's M1 chip? ](https://github.com/TuGraph-db/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussion-4575018)**
+   7.1 [Does it support conditional query of indefinite length? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165252)
+   7.2 [How to query the shortest path, how to use the shortestPath function? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165256)
+   7.3 [Using and after the query statement Where to splice the query speed is slow, how should the statement be optimized and improved? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165260)
+   7.4 [How to query the edge of any jump? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165262)
+   7.5 [Is there a date() function in Cypher? ](https://github.com/TuGraph-db/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA Summay](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+   8.1 [What should I do after the error "User has reached the maximum number of tokens" is reported? ](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+If the problem is still not resolved, we recommend you follow up or create a new thread describing your problem. At the same time, the TuGraph QA summary will be updated regularly based on the posts initiated by everyone in the discussion area.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/9.contacts.md b/docs/docusaurus/versions/version-4.1.0/en-US/source/9.contacts.md
new file mode 100644
index 0000000000..2019a8b998
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/9.contacts.md
@@ -0,0 +1,28 @@
+# Contacts
+
+If you have any feedback or suggestions for the product, You are welcome to join the discussion or make suggestions through the following contact methods.
+
+Official website: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue:
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions:
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack:
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+Dingtalk Group Chat (Discussions):
+
+![alert](../../images/dingtalk.png)
+
+WeChat Group Chat (Discussions):
+
+![alert](../../images/wechat_tech.png)
+
+Official Accounts (Information Release):
+
+![alert](../../images/wechat.png)
+
+Email（Enterprise version consultation）: tugraph@service.alipay.com
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/conf.py b/docs/docusaurus/versions/version-4.1.0/en-US/source/conf.py
new file mode 100644
index 0000000000..889e5638e5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('5.developer-manual/6.interface/3.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="5.developer-manual/6.interface/3.procedure/")
+    breathe_projects = {"cpp_procedure": "5.developer-manual/6.interface/3.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("5.developer-manual/6.interface/3.procedure/3.C++-procedure") and \
+            os.path.exists("5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst") and \
+            os.path.exists("5.developer-manual/6.interface/3.procedure/index.rst") and \
+            os.path.exists("5.developer-manual/6.interface/3.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure 4.Python-procedure.rst index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
diff --git a/docs/docusaurus/versions/version-4.1.0/en-US/source/index.rst b/docs/docusaurus/versions/version-4.1.0/en-US/source/index.rst
new file mode 100644
index 0000000000..25a07bee58
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/en-US/source/index.rst
@@ -0,0 +1,17 @@
+TuGraph DB
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.developer-manual/index.rst
+   6.contributor-manual/index.rst
+   7.best-practices/index.rst
+   8.faq.md
+   9.contacts.md
diff --git a/docs/docusaurus/versions/version-4.1.0/images/architecture-en.png b/docs/docusaurus/versions/version-4.1.0/images/architecture-en.png
new file mode 100644
index 0000000000..edf2bc873a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/architecture-en.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/architecture.png b/docs/docusaurus/versions/version-4.1.0/images/architecture.png
new file mode 100644
index 0000000000..e8eeea87e0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/architecture.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/account-add-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/account-add-button.png
new file mode 100644
index 0000000000..5b9c7e9378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/account-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/account-add.png b/docs/docusaurus/versions/version-4.1.0/images/browser/account-add.png
new file mode 100644
index 0000000000..b0b5068027
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/account-add.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/account-delete.png b/docs/docusaurus/versions/version-4.1.0/images/browser/account-delete.png
new file mode 100644
index 0000000000..bfe49fb093
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/account-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/account-disable.png b/docs/docusaurus/versions/version-4.1.0/images/browser/account-disable.png
new file mode 100644
index 0000000000..f8ff994f21
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/account-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/account-edit.png b/docs/docusaurus/versions/version-4.1.0/images/browser/account-edit.png
new file mode 100644
index 0000000000..939c374f25
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/account-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/account-enable.png b/docs/docusaurus/versions/version-4.1.0/images/browser/account-enable.png
new file mode 100644
index 0000000000..ddc8cef578
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/account-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/account.png b/docs/docusaurus/versions/version-4.1.0/images/browser/account.png
new file mode 100644
index 0000000000..0aa0cd195c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/account.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/db_basic.png b/docs/docusaurus/versions/version-4.1.0/images/browser/db_basic.png
new file mode 100644
index 0000000000..b78298825b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/db_basic.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/db_configuration.png b/docs/docusaurus/versions/version-4.1.0/images/browser/db_configuration.png
new file mode 100644
index 0000000000..2de3da502c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/db_configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-button.png
new file mode 100644
index 0000000000..dd8966d0d3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-clear.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-clear.png
new file mode 100644
index 0000000000..ee5d3c92a9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-clear.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-collapse.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-collapse.png
new file mode 100644
index 0000000000..e053061834
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-collapse.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-delete.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-delete.png
new file mode 100644
index 0000000000..5aefa20c43
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand-after.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand-after.png
new file mode 100644
index 0000000000..371efb6e6b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand-after.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand-before.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand-before.png
new file mode 100644
index 0000000000..80e74174af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand-before.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand-custom.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand-custom.png
new file mode 100644
index 0000000000..bed0a73705
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand-custom.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand.png
new file mode 100644
index 0000000000..75b0caf2b9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-expand.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-fixed.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-fixed.png
new file mode 100644
index 0000000000..aac4a18573
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-fixed.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-lasso.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-lasso.png
new file mode 100644
index 0000000000..53f743925b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-lasso.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-legend-chart.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-legend-chart.png
new file mode 100644
index 0000000000..0ddb63b926
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-legend-chart.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-legend-list.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-legend-list.png
new file mode 100644
index 0000000000..07d0bf0a4c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-legend-list.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-retrieval.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-retrieval.png
new file mode 100644
index 0000000000..57eafece0e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-retrieval.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-unfix.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-unfix.png
new file mode 100644
index 0000000000..80fa2c8b72
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-canvas-unfix.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-operation-area.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-operation-area.png
new file mode 100644
index 0000000000..b251837e26
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-operation-area.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-attributefilter.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-attributefilter.png
new file mode 100644
index 0000000000..8883301d09
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-attributefilter.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-configurequery.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-configurequery.png
new file mode 100644
index 0000000000..d294a8616b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-configurequery.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-query.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-query.png
new file mode 100644
index 0000000000..b745e4d5c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-query.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png
new file mode 100644
index 0000000000..afbaf3bfd5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-statisticalfilter.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-statisticalfilter.png
new file mode 100644
index 0000000000..7c2e3b635e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-queryfilter-statisticalfilter.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-appearance-Button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-appearance-Button.png
new file mode 100644
index 0000000000..dab00330b7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-appearance-Button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-appearance.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-appearance.png
new file mode 100644
index 0000000000..330ad3128e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-appearance.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-layout-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-layout-button.png
new file mode 100644
index 0000000000..49516d6427
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-layout-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-layout-parameters.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-layout-parameters.png
new file mode 100644
index 0000000000..d02772bfd9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphanalysis-style-layout-parameters.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addedge-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addedge-button.png
new file mode 100644
index 0000000000..b38900728e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addedge-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addedge.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addedge.png
new file mode 100644
index 0000000000..39eca4a772
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addedge.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addvertex-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addvertex-button.png
new file mode 100644
index 0000000000..e616ce0f89
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addvertex-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addvertex.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addvertex.png
new file mode 100644
index 0000000000..df56d537bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-addvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-button.png
new file mode 100644
index 0000000000..abf1fab48f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-editedge.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-editedge.png
new file mode 100644
index 0000000000..eb7206b771
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-editedge.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-editvertex.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-editvertex.png
new file mode 100644
index 0000000000..eb252761bf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-editvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-exportmodel-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-exportmodel-button.png
new file mode 100644
index 0000000000..acbaa80189
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-exportmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-exportmodel.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-exportmodel.png
new file mode 100644
index 0000000000..4991dc7378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-exportmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import-csv.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import-csv.png
new file mode 100644
index 0000000000..2301c01cfc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import-csv.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import-datamapping.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import-datamapping.png
new file mode 100644
index 0000000000..5d55861a95
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import-datamapping.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import-success.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import-success.png
new file mode 100644
index 0000000000..20a48beb0f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import-success.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import.png
new file mode 100644
index 0000000000..0154bac688
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-import.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-importmodel-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-importmodel-button.png
new file mode 100644
index 0000000000..bb7822aaef
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-importmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-importmodel.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-importmodel.png
new file mode 100644
index 0000000000..252b082100
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-importmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-list-copy.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-list-copy.png
new file mode 100644
index 0000000000..ea210495fc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-list-copy.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-list-delete.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-list-delete.png
new file mode 100644
index 0000000000..aeba09b532
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-list-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-list-search.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-list-search.png
new file mode 100644
index 0000000000..9313c8eb7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-list-search.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-select.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-select.png
new file mode 100644
index 0000000000..18bfb3be74
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild-select.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild.png
new file mode 100644
index 0000000000..cd1f0bda1c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphbuild.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-configure.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-configure.png
new file mode 100644
index 0000000000..91fa18814f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-creategraph.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-deletegraph-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-deletegraph-button.png
new file mode 100644
index 0000000000..34a4efd42a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-deletegraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-editgraph-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-editgraph-button.png
new file mode 100644
index 0000000000..773798b78b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-editgraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-editgraph.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-editgraph.png
new file mode 100644
index 0000000000..f6cc706f41
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-editgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-homepage.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-homepage.png
new file mode 100644
index 0000000000..c3af5618ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-homepage.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-selecttemplate.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-selecttemplate.png
new file mode 100644
index 0000000000..8a19d8da39
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-selecttemplate.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-statistics-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-statistics-button.png
new file mode 100644
index 0000000000..cdb25ed397
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-statistics-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-statistics-refresh-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-statistics-refresh-button.png
new file mode 100644
index 0000000000..e2ec35cbe1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-statistics-refresh-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-statistics.png b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-statistics.png
new file mode 100644
index 0000000000..49db6e652f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/graphmanagement-statistics.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/login.png b/docs/docusaurus/versions/version-4.1.0/images/browser/login.png
new file mode 100644
index 0000000000..3f4109b059
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/login.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/pathquery-configuration.png b/docs/docusaurus/versions/version-4.1.0/images/browser/pathquery-configuration.png
new file mode 100644
index 0000000000..579a7d99ee
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/pathquery-configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/pathquery-result.png b/docs/docusaurus/versions/version-4.1.0/images/browser/pathquery-result.png
new file mode 100644
index 0000000000..0cd90cad46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/pathquery-result.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/pathquery-select.png b/docs/docusaurus/versions/version-4.1.0/images/browser/pathquery-select.png
new file mode 100644
index 0000000000..3c5d0f7751
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/pathquery-select.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-bookmark-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-bookmark-button.png
new file mode 100644
index 0000000000..9a6f73bf7c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-bookmark-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-bookmark.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-bookmark.png
new file mode 100644
index 0000000000..a93315ab17
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-bookmark.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-button.png
new file mode 100644
index 0000000000..cd00d7f3fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-download-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-download-button.png
new file mode 100644
index 0000000000..ec59f7a0ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-download-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-execute-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-execute-button.png
new file mode 100644
index 0000000000..6c38e68c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-execute-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-gqltips.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-gqltips.png
new file mode 100644
index 0000000000..bdabee92e7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-gqltips.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-download.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-download.png
new file mode 100644
index 0000000000..48890083fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-download.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-downloadtxt.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-downloadtxt.png
new file mode 100644
index 0000000000..3554ef592c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-downloadtxt.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-fullscreen-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-fullscreen-button.png
new file mode 100644
index 0000000000..13925db74f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-fullscreen-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-fullscreen-close.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-fullscreen-close.png
new file mode 100644
index 0000000000..2a63926742
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-fullscreen-close.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-fullscreen.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-fullscreen.png
new file mode 100644
index 0000000000..2dcf0ca0b4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-fullscreen.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-graph.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-graph.png
new file mode 100644
index 0000000000..9b3edecb5f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-insert-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-insert-button.png
new file mode 100644
index 0000000000..8879b2c4bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-insert-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-insert.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-insert.png
new file mode 100644
index 0000000000..2cd23b6e84
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-insert.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-jsontxt.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-jsontxt.png
new file mode 100644
index 0000000000..5f265cfff1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-jsontxt.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-jsonview.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-jsonview.png
new file mode 100644
index 0000000000..8a774f91c9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-jsonview.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-list.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-list.png
new file mode 100644
index 0000000000..4692c49eca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-result-list.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-schema-graph.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-schema-graph.png
new file mode 100644
index 0000000000..ccc9e3126b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-schema-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-schema-list.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-schema-list.png
new file mode 100644
index 0000000000..3649b41272
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-schema-list.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-selectgql.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-selectgql.png
new file mode 100644
index 0000000000..1ea624b81f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-selectgql.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-selectgraph.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-selectgraph.png
new file mode 100644
index 0000000000..6dc14e486d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-selectgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/query-view.png b/docs/docusaurus/versions/version-4.1.0/images/browser/query-view.png
new file mode 100644
index 0000000000..8d1884ad82
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/query-view.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-configure.png b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-configure.png
new file mode 100644
index 0000000000..166e54cb75
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-creategraph.png b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-graphtab.png b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-graphtab.png
new file mode 100644
index 0000000000..0f7980bc46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-graphtab.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-result.png b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-result.png
new file mode 100644
index 0000000000..2a2a59ce02
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-result.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-selectdemo.png b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-selectdemo.png
new file mode 100644
index 0000000000..7dda3f06b0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/quickstart-selectdemo.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/role-add-button.png b/docs/docusaurus/versions/version-4.1.0/images/browser/role-add-button.png
new file mode 100644
index 0000000000..a4590ac431
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/role-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/role-add.png b/docs/docusaurus/versions/version-4.1.0/images/browser/role-add.png
new file mode 100644
index 0000000000..8f56b24bd7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/role-add.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/role-delete.png b/docs/docusaurus/versions/version-4.1.0/images/browser/role-delete.png
new file mode 100644
index 0000000000..3c09e7caa8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/role-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/role-disable.png b/docs/docusaurus/versions/version-4.1.0/images/browser/role-disable.png
new file mode 100644
index 0000000000..eb2e355d58
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/role-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/role-edit.png b/docs/docusaurus/versions/version-4.1.0/images/browser/role-edit.png
new file mode 100644
index 0000000000..7b5db6e48c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/role-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/role-enable.png b/docs/docusaurus/versions/version-4.1.0/images/browser/role-enable.png
new file mode 100644
index 0000000000..40b7909289
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/role-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/vertexquery-criteria.png b/docs/docusaurus/versions/version-4.1.0/images/browser/vertexquery-criteria.png
new file mode 100644
index 0000000000..b5f95c3d83
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/vertexquery-criteria.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/browser/vertexquery.png b/docs/docusaurus/versions/version-4.1.0/images/browser/vertexquery.png
new file mode 100644
index 0000000000..97aa28122b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/browser/vertexquery.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-1.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-1.png
new file mode 100644
index 0000000000..c7202ff3de
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-1.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-10.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-10.png
new file mode 100644
index 0000000000..d6ed55c8bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-10.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-2.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-2.png
new file mode 100644
index 0000000000..6fc79fde54
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-2.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-3.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-3.png
new file mode 100644
index 0000000000..0e59f028c7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-3.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-4.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-4.png
new file mode 100644
index 0000000000..b606ec8bb8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-4.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-5.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-5.png
new file mode 100644
index 0000000000..18d5845ec1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-5.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-6.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-6.png
new file mode 100644
index 0000000000..d939108e3b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-6.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-7.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-7.png
new file mode 100644
index 0000000000..5c5d1800af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-7.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-8.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-8.png
new file mode 100644
index 0000000000..5beb0628b3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-8.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-9.png b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-9.png
new file mode 100644
index 0000000000..d04282d95a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/cloud-deployment-9.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/dingtalk.png b/docs/docusaurus/versions/version-4.1.0/images/dingtalk.png
new file mode 100644
index 0000000000..2a6576a0cd
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/dingtalk.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/htap-en.png b/docs/docusaurus/versions/version-4.1.0/images/htap-en.png
new file mode 100644
index 0000000000..85479ac1e1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/htap-en.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/htap.png b/docs/docusaurus/versions/version-4.1.0/images/htap.png
new file mode 100644
index 0000000000..c7764a3fa7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/htap.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/learn_flow_chart_en.png b/docs/docusaurus/versions/version-4.1.0/images/learn_flow_chart_en.png
new file mode 100644
index 0000000000..c9e55a52a5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/learn_flow_chart_en.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/learn_flow_chart_zh.png b/docs/docusaurus/versions/version-4.1.0/images/learn_flow_chart_zh.png
new file mode 100644
index 0000000000..9977dcfb6c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/learn_flow_chart_zh.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/multi-level-Interfaces-en.png b/docs/docusaurus/versions/version-4.1.0/images/multi-level-Interfaces-en.png
new file mode 100644
index 0000000000..b7de07422c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/multi-level-Interfaces-en.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/multi-level-Interfaces.png b/docs/docusaurus/versions/version-4.1.0/images/multi-level-Interfaces.png
new file mode 100644
index 0000000000..2c9694a476
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/multi-level-Interfaces.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/round-the-world/flight_page.jpg b/docs/docusaurus/versions/version-4.1.0/images/round-the-world/flight_page.jpg
new file mode 100644
index 0000000000..bd296766c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/round-the-world/flight_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/round-the-world/main_page.jpg b/docs/docusaurus/versions/version-4.1.0/images/round-the-world/main_page.jpg
new file mode 100644
index 0000000000..2edc617c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/round-the-world/main_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/round-the-world/search_example.jpg b/docs/docusaurus/versions/version-4.1.0/images/round-the-world/search_example.jpg
new file mode 100644
index 0000000000..154d387721
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/round-the-world/search_example.jpg differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-body-cypher1.png b/docs/docusaurus/versions/version-4.1.0/images/three-body-cypher1.png
new file mode 100644
index 0000000000..3f85fd8412
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-body-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-body-cypher2.png b/docs/docusaurus/versions/version-4.1.0/images/three-body-cypher2.png
new file mode 100644
index 0000000000..41f0f914cc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-body-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-body-cypher3.png b/docs/docusaurus/versions/version-4.1.0/images/three-body-cypher3.png
new file mode 100644
index 0000000000..4776f26d77
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-body-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-body-data.png b/docs/docusaurus/versions/version-4.1.0/images/three-body-data.png
new file mode 100644
index 0000000000..1913b39cbc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-body-data.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher1.png b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher1.png
new file mode 100644
index 0000000000..4b5745b96d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher2.png b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher2.png
new file mode 100644
index 0000000000..fef4592cf3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher3.png b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher3.png
new file mode 100644
index 0000000000..c0790d5d7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher4.png b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher4.png
new file mode 100644
index 0000000000..49a6498d4a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher4.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher5.png b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher5.png
new file mode 100644
index 0000000000..5d3cc55cdf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-cypher5.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-schema.png b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-schema.png
new file mode 100644
index 0000000000..24aebca93a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/three-kingdoms-schema.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/tugraph-datax.png b/docs/docusaurus/versions/version-4.1.0/images/tugraph-datax.png
new file mode 100644
index 0000000000..c2968c0c38
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/tugraph-datax.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/wandering-earth-1.png b/docs/docusaurus/versions/version-4.1.0/images/wandering-earth-1.png
new file mode 100644
index 0000000000..955c565303
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/wandering-earth-1.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/wandering-earth-2.png b/docs/docusaurus/versions/version-4.1.0/images/wandering-earth-2.png
new file mode 100644
index 0000000000..9cb17764ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/wandering-earth-2.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/wandering-earth-3.png b/docs/docusaurus/versions/version-4.1.0/images/wandering-earth-3.png
new file mode 100644
index 0000000000..c6dabbec97
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/wandering-earth-3.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/wechat.png b/docs/docusaurus/versions/version-4.1.0/images/wechat.png
new file mode 100644
index 0000000000..b490b48afd
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/wechat.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/wechat_tech.png b/docs/docusaurus/versions/version-4.1.0/images/wechat_tech.png
new file mode 100644
index 0000000000..7307a12e38
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/wechat_tech.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/what-is-graph-en.png b/docs/docusaurus/versions/version-4.1.0/images/what-is-graph-en.png
new file mode 100644
index 0000000000..53d5ba05ca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/what-is-graph-en.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/images/what-is-graph.png b/docs/docusaurus/versions/version-4.1.0/images/what-is-graph.png
new file mode 100644
index 0000000000..6f3aa196fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.1.0/images/what-is-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.1.0/requirements.txt b/docs/docusaurus/versions/version-4.1.0/requirements.txt
new file mode 100644
index 0000000000..0201af0943
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/requirements.txt
@@ -0,0 +1,5 @@
+sphinx
+myst-parser
+sphinx-panels
+sphinx-rtd-theme
+breathe
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/.readthedocs.yaml b/docs/docusaurus/versions/version-4.1.0/zh-CN/.readthedocs.yaml
new file mode 100644
index 0000000000..5b91d3cd6c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/zh-CN/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/Makefile b/docs/docusaurus/versions/version-4.1.0/zh-CN/Makefile
new file mode 100644
index 0000000000..d0c3cbf102
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?=
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/make.bat b/docs/docusaurus/versions/version-4.1.0/zh-CN/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/1.guide.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/1.guide.md
new file mode 100644
index 0000000000..171d27d498
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/1.guide.md
@@ -0,0 +1,76 @@
+# 文档地图
+
+> 这里是文档地图，帮助用户快速学习和使用TuGraph社区版。
+
+## 快速上手
+
+> 可以先了解[什么是图](./2.introduction/1.what-is-graph.md)、图[可以做什么](./2.introduction/7.scenarios.md)、以及[什么是TuGraph](./2.introduction/3.what-is-tugraph.md)。
+
+> 基于[阿里云计算巢](./5.developer-manual/1.installation/5.cloud-deployment.md)或[Docker方式](./5.developer-manual/1.installation/3.docker-deployment.md)快速部署TuGraph。
+
+> 通过产品内置的场景上手体验：[电影](./3.quick-start/2.demo/1.movie.md)、[流浪地球](./3.quick-start/2.demo/2.wandering-earth.md)、[三体](./3.quick-start/2.demo/3.the-three-body.md)、[三国](./3.quick-start/2.demo/4.three-kingdoms.md)。
+
+> 可视化操作手册看这里：[可视化操作手册](./4.user-guide/1.tugraph-browser.md)、[可视化操作手册（旧版）](./4.user-guide/2.tugraph-browser-legacy.md)。
+
+## 开发指南
+
+> 通过客户端访问TuGraph：[C++](./5.developer-manual/4.client-tools/2.cpp-client.md)、[Java](./5.developer-manual/4.client-tools/3.java-client.md)、[Python](./5.developer-manual/4.client-tools/1.python-client.md)。
+
+> 查询语言、语句创建图模型看这里：[Cypher API](./5.developer-manual/6.interface/1.query/1.cypher.md).
+
+> 存储过程和算法介绍看这里：[Procedure API (POG API)](./5.developer-manual/6.interface/3.procedure/1.procedure.md)、[OLAP API](./5.developer-manual/6.interface/2.olap/1.tutorial.md)。
+
+> C++/Python开发存储过程接口看这里：[C++/Python Procedure API](./5.developer-manual/6.interface/3.procedure/index.rst)。
+
+## 参与社区贡献
+
+> 在开始贡献前，可以先了解[如何贡献](./6.contributor-manual/1.contributing.md)
+
+> 如果想了解社区角色的划分，请访问[社区角色](./6.contributor-manual/2.community-roles.md)
+
+## 主要仓库
+
+> TuGraph-DB 仓库: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> 可视化界面: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java客户端: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> 基于twitter数据的简单测试方法: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> 基于标准LDBC-SNB的测试方法: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics 仓库: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## 视频中心
+
+> [TuGraph快速上手](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph技术分享集合](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [3分钟读懂图计算](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph最新版本
+
+| 描述                  | 文件                                         | 链接                                                                                                                                                                                              |
+|---------------------|--------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 安装包         | tugraph-4.1.0-1.el7.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-4.1.0-1.el7.x86_64.rpm) |
+| CentOS8 安装包         | tugraph-4.1.0-1.el8.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-4.1.0-1.el8.x86_64.rpm) |
+| Ubuntu18.04 安装包     | tugraph-4.1.0-1.x86_64.deb                 | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-4.1.0-1.x86_64.deb)  |
+| CentOS7 预安装镜像       | tugraph-runtime-centos7-4.1.0.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-runtime-centos7-4.1.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                   |
+| CentOS8 预安装镜像       | tugraph-runtime-centos8-4.1.0.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-runtime-centos8-4.1.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8)                   |
+| Ubuntu18.04 预安装镜像   | tugraph-runtime-ubuntu18.04-4.1.0.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-runtime-ubuntu18.04-4.1.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04)           |
+| CentOS7 精简安装包       | tugraph-mini-4.1.0-1.el7.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-4.1.0-1.el7.x86_64.rpm)                                                                                 |
+| CentOS8 精简安装包       | tugraph-mini-4.1.0-1.el8.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-4.1.0-1.el8.x86_64.rpm)                                                                                 |
+| Ubuntu18.04 精简安装包   | tugraph-mini-4.1.0-1.x86_64.deb            | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-4.1.0-1.x86_64.deb)                                                                                     |
+| CentOS7 精简预安装镜像     | tugraph-mini-runtime-centos7-4.1.0.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-runtime-centos7-4.1.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7)         |
+| CentOS8 精简预安装镜像     | tugraph-mini-runtime-centos8-4.1.0.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-runtime-centos8-4.1.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8)         |
+| Ubuntu18.04 精简预安装镜像 | tugraph-mini-runtime-ubuntu18.04-4.1.0.tar | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.1.0/tugraph-mini-runtime-ubuntu18.04-4.1.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 编译镜像        | tugraph-compile-centos7-1.2.9.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.2.9.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)          |
+| CentOS8 编译镜像        | tugraph-compile-centos8-1.2.9.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.2.9.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)          |
+| Ubuntu18.04 编译镜像    | tugraph-compile-ubuntu18.04-1.2.9.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.2.9.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04)  |
+
+
+版本更新日志见：[链接](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md )。
+
+如果您不清楚使用安装包和镜像，请参考 [环境和版本选择](./7.best-practices/4.selection.md)。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..4cbe4ce767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,13 @@
+# 什么是图
+
+> 本文面向初学者，介绍图（Graph）的基本概念。
+
+我们今天介绍的图，是图论中使用点和边表示的图（Graph），而非图像的图（Image）。
+
+![alt what is graph](../../../images/what-is-graph.png)
+
+图的基本元素是点和边，其中点表示事物或实体，边表示点之间的关联关系。
+
+如上图左侧所示，点表示的有公司、员工、项目。边表示的是他们之间的关系，包括：公司和员工之间的雇佣关系，员工和员工之间的好友关系，项目和员工之间的参与关系。除此之外，点和边上可以附加属性，比如员工的工号，雇佣的时间，这样的图是属性图。也就是说，我们可以用图的方式来抽象地表示实体及其关联关系，图有非常丰富的表达能力。
+
+除了上述的员工图谱，图还可以用于金融、工业、医疗等各个领域。在实际应用中，图的规模越来越大，比如金融交易图，点边规模可能到达百亿，与其同时，基于图的查询通常会复杂，最典型的是K跳查询，每增加一跳访问的数据都呈指数增长。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..eeb4dfd11f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# 什么是图数据库
+
+> 本文主要介绍什么是图数据库，图数据库相比于关系型数据库的优势，以及两者特点的对比。
+
+## 1. 图数据库介绍
+
+图数据库是基于图模型的数据库。与关系型数据库相比，图数据库真正注重“关系”。图数据库的主要功能是管理图数据，因此需要支持高效的点、边查询和更新；为方便用户使用，通常还需要增加对事务（transaction）的支持，以确保并发操作下的正常运行。
+
+## 2. 图数据库相比较于关系型数据库的优势
+
+图数据库的功能是传统关系型数据库的扩展。与关系型数据库仅支持的“表结构”相比，图数据库所支持的“图结构”更为灵活。图数据库在基于图的增加、删除、查询和修改方面采用不同于其他数据库的设计。在图数据操作抽象上，采用基于点的视角，例如点通过其所有“出边”（从一个点出发，连接到其他点的边）访问其邻接点。这是图数据库系统设计的核心。
+
+图数据库的独特性体现在以下三个方面:
+
+### 2.1. 性能
+
+在关联关系处理上，使用关系型数据库不可避免地要使用表的JOIN操作，这会对性能产生较大影响；而图数据库则直接跳转访问类指针，操作关联数据的效率更高，比关系型数据库提高2到4个数量级的性能。
+
+### 2.2. 兼容性
+
+现实中，项目进程通常不断演变，数据的内容甚至数据格式也在不断变化。在关系型数据库中，这意味着表结构的变化或建立多个新表，对源数据的修改非常大。而在图数据库中，仅需添加新的点、边和属性，并将其设置为对应的类型即可。从本质上说，一个表代表一种类型的数据，一个点代表一个特定的数据。这意味着关系型数据库更关注数据类型，而图数据库更关注数据个体及其关联关系。
+
+### 2.3. 直观性
+
+使用图的方式表达现实世界的关系更直接和自然，在万物互联的时代尤为突出。如果使用关系型数据，先建立实体表，再建立关系表，最后映射数据，需要高度的抽象思维。在图数据上进行分析查询时，可以直观地通过点边连接的拓扑结构找到所需数据，无需任何专业知识。
+
+## 3. 图数据库与关系型数据库对比
+
+| 分类         | 模型   | 优势                                   | 劣势                                     | 举例           |
+| ------------ | ------ | -------------------------------------- | ---------------------------------------- | -------------- |
+| 关系型数据库 | 表结构 | 数据高度结构化，一致性强，软件成熟度高 | 面向多跳的关联关系查询低效或不支持       | MySQL、Oracle  |
+| 图数据库     | 图结构 | 针对关联关系的建模建模和操作效率非常高 | 高度结构化的数据处理能力不及关系型数据库 | Neo4j、TuGraph |
+
+总之，面对海量数据的存储和处理问题，传统的关系数据库已经无法满足大部分的日常数据存储需求。图数据库技术可以将关系信息存储为实体，灵活拓展数据模型。由于提供了对关联数据最直接的表达方式和图模型对异构数据的天然包容性，图数据库技术必将成为未来最热点的技术之一，为企业提供存储和分析大规模图数据的有力支持。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..d241082fde
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,134 @@
+# 什么是TuGraph
+
+> 本文主要介绍TuGraph社区版的主要功能和特性，以及TuGraph企业版和社区版的差异。
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群，解决了图数据分析面临的大数据量、高吞吐率和低延迟等重大挑战，是蚂蚁集团金融风控能力的重要基础设施，显著提升了欺诈洗钱等金融风险的实时识别能力和审理分析效率，并面向金融、工业、政务服务等行业客户。
+
+## 2. TuGraph社区版
+
+2022年9月，TuGraph单机版开源，提供了完备的图数据库基础功能和成熟的产品设计，支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台。
+
+TuGraph社区版于2022年9月开源，提供了完整的图数据库基础功能和成熟的产品设计（如ACID兼容的事务、编程API和配套工具等），适用于单实例部署。社区版支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台，是学习TuGraph和实现小型项目的理想选择。
+
+## 3. TuGraph特性
+
+TuGraph是支持大数据量、低延迟查找和快速图分析功能的高效图数据库。TuGraph也是基于磁盘的数据库，支持存储多达数十TB的数据。TuGraph提供多种API，使用户能够轻松构建应用程序，并使其易于扩展和优化。
+
+它具有如下功能特征：
+
+- 属性图模型
+- 实时增删查改
+- 多重图（点间允许多重边）
+- 多图（大图与多个子图）
+- 完善的ACID事务处理，隔离级别为可串行化（serializable）
+- 点边索引、全文索引
+- 混合事务和分析处理（HTAP），支持图查询、图分析、图学习
+- 主流图查询语言（OpenCypher、ISO GQL等）
+- 支持OLAP API，内置30多种图分析算法
+- 基于C++/Python的存储过程，含事务内并行Traversal API
+- 提供图可视化工具
+
+在性能和可扩展性方面的支持：
+
+- 千万点/秒的高吞吐率
+- TB级大容量
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线的备份恢复
+
+## 4. 数据模型
+
+### 4.1. 图模型
+
+TuGraph是一个具备多图能力的强类型、有向属性图数据库。
+
+- 图项目：每个数据库服务可以承载多个图项目（多图），每个图项目可以有自己的访问控制配置，数据库管理员可以创建或删除指定图项目。
+- 点：指实体，一般用于表达现实中的实体对象，如一部电影、一个演员。
+    - 主键：用户自定义的点数据主键，默认唯一索引，在对应的点类型中唯一。
+    - VID：点在存储层自动分配图项目中的唯一ID，用户不可修改。
+    - 上限：每个图项目存储最多2^(40)个点数据。
+- 边：用于表达点与点之间的关系，如演员出演电影。
+    - 有向边：边为有向边。若要模拟无向边，用户可以创建两个方向相反的边。
+    - 多条边：两个点数据之间可以有多条边数据。当前TuGraph支持重复边，如要确保边边唯一，需要通过业务策略实现。
+    - 上限：两个点数据之间存储最多2^(32)条边数据。
+- 属性图：点和边可以具有与其关联的属性，每个属性可以有不同的类型。
+- 强类型：每个点和边有且仅有一个标签，创建标签后，修改属性数量及类型有代价。
+    - 指定边的起/终点类型：可限制边的起点和终点点类型，支持同类型边的起点和终点的点类型不同，如个人转账给公司、公司转账给公司；当指定边的起/终点类型后，可增加多组起/终点类型，不可删除已限制的起/终点类型。
+    - 无限制模式：支持不指定边的起点和终点的点类型，任意两个点类型间均可创建该类型的边数据。注：当指定边的起/终点类型后无法再采用无限制模式。
+
+### 4.2. 数据类型
+
+TuGraph支持多种可用于属性的数据类型。具体支持的数据类型如下：
+
+| **数据类型** | **最小值**          | **最大值**          | **描述**                            |
+| ------------ | ------------------- | ------------------- | ----------------------------------- |
+| BOOL         | false               | true                | 布尔值                              |
+| INT8         | -128                | 127                 | 8位整型                          |
+| INT16        | -32768              | 32767               | 16位整型                         |
+| INT32        | - 2^31              | 2^31 - 1            | 32位整型                         |
+| INT64        | - 2^63              | 2^63 - 1            | 64位整型                         |
+| DATE         | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" 格式的日期             |
+| DATETIME     | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD HH:mm:ss[.ffffff]" 格式的日期时间 |
+| FLOAT        |                     |                     | 32位浮点数                       |
+| DOUBLE       |                     |                     | 64位浮点数                       |
+| STRING       |                     |                     | 不定长度的字符串                    |
+| BLOB         |                     |                     | 二进制数据（在输入输出时使用Base64编码） |
+
+### 4.3. 索引
+
+TuGraph支持对点或边的属性创建索引，以提升查询效率。
+- 索引可以是唯一或非唯一索引。
+- 如果为点标签创建了唯一索引，在修改该标签的点时，会先执行数据完整性检查，以确保该索引的唯一性。
+- 每个索引都基于一个点或边的一个属性创建，可以对同一点或边的多个属性创建索引。
+- BLOB类型的属性不能建立索引。
+
+## 5. 图项目、点、边、属性命名规则和建议
+
+### 5.1 命名规则
+图项目、点、边和属性是识别符。该节描述了在TuGraph中识别符的允许的语法。
+下面的表描述了每类识别符的最大长度和允许的字符。
+
+|**识别符** |**长度** |**允许的字符**|
+|---------  |---------  |---------  |
+|用户、角色、图项目	|1-64字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+|点类型、边类型、属性	|1~256字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+
+### 5.2 使用限制
+
+|**描述**|	**最大个数**|
+|-------- |--------- |
+|用户数、角色数	|65536|
+|图项目的个数	|4096|
+|每个图项目的点和边类型数量之和	|4096|
+|每个点或边类型的属性数量	|1024|
+
+注：
+1、特殊字符和关键字说明：使用特殊字符或非保留关键字时，需要使用反单引号/backquote（``）进行引用；
+
+示例： ```match (`match`:match) return `match`.id limit 1```
+
+2、大小写敏感性：TuGraph大小写敏感；
+
+3、图项目、点/边、属性名称之间可以重复使用，同一点或边下的属性名称不可以重复；
+
+4、属性名字保留关键字：SRC_ID / DST_ID / SKIP
+
+
+### 5.3 命名建议
+|**识别符**|**描述**|**建议**|
+|-------|-------|--------|
+|图项目	|字母或中文开头	|如graph123、project123等|
+|点/边类型	|字母或中文开头，使用下划线区分单词	|如person、act_in等|
+|属性	|字母或中文	|如name、age等|
+
+## 6. TuGraph企业版
+
+企业版对商业化功能支持更加完善，包括分布式集群架构，覆盖探索、研发、服务、运维管理全生命周期的一站式图平台，在线、近线、离线的图计算引擎，支持流式、大数据类数据源，多地多中心的部署形态，以及专家支持服务等。企业版是商业化解决方案的理想选择。
+
+如需商业支持，请联系我们：
+
+- 电话：400-903-0809
+- 邮件：tugraph@service.alipay.com
+- 官网：https://tugraph.antgroup.com
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..612c0430ad
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# 性能优先
+
+> 此文档主要介绍 TuGraph 性能优先的设计理念。
+
+## 1.简介
+
+TuGraph目前是世界上最快的图数据库，在图数据库标准评测LDBC SNB Interactive位居榜首（2023.3）。TuGraph的设计基于性能优先，致力于打造高性能的单机图数据库。该文档是TuGraph基于性能优先在存储层的核心设计。
+
+## 2.图操作的特性
+
+在属性图上的操作涉及读、写及其属性，对一些特殊的属性比如时间戳也访问模式也会影响到整体性能。这里通过对一些图操作特性的规律总结，来指导最终的性能。
+
+我们观察到很多图应用有类似的数据访问模式。例如，在信贷风险控制中，我们使用递归路径过滤搜索多对一模式，以找到可疑的信用欺诈用户和行为。针对网络赌博，可以通过识别短时间内的多笔资金转移，来发现涉赌的资金账号。股权穿透场景对实体间的股权关系进行递归计算。这些场景具有多跳实体和关系访问、时间窗口约束和读写事务等常见模式。
+更进一步，从介绍中的讨论和图负载的分析中，归纳出以下特征:
+
+**规律一** KHop是图中最典型的操作，它基于点和边的图拓扑的数据访问模式，和关系型数据库有着本质的区别。KHop 的典型性除了表现在数据访问模式不同，它同时也是图数据库最需要关注的性能点。
+
+**规律二** 图负载的数据访问在拓扑上有一定的局部性，同一个点的边通常会被同时访问。当这些边的标签相同时，有更大的概率会被同时访问。
+
+**规律三** 图负载在访问点边时，通常会访问其对应的属性，来作为遍历过滤的条件。
+
+**规律四** 在基于时序的图负载，对点边的过滤通常是在某个时间范围，比如最近的一周。
+
+**规律五** 写操作可能伴随着大量的读操作，需要在单个事务周期里处理。
+
+通过对实际线上图应用的分析，图负载的读写比率大约为 20:1，虽然场景局限在金融场景，集群数也有限，但涉及的数据规模和用户量非常庞大，具有一定代表性。20:1 的图负载读写比率，说明读工作负载对整体性能的影响更大， 而写工作负载的性能也不能忽视。
+
+## 3.存储数据结构
+
+TuGraph底层采用B+树来支持实时的增删查改事务。
+
+在排序树的数据结构中，B+树和LSM树为主要代表。B+树在树节点中使用拆分和合并式来更新排序数据，而 LSM 树在日志中追加更新，以进行延迟数据合并。B+ 早期用在文件系统的实现中，通过将数据保存 在自适应长度的叶子节点中，解决硬盘顺序操作和随机操作性能存在数据量级差别的问题，有较均衡的读写性能。LSM 树的主要优势使用 WAL(Write Ahead Log) 进行更新，将更新操作变成顺序操作，在键值较小时性能优势尤为突出。WAL 意味着将数据的更新合并推迟，批量更新能提升综合效率，也使得系统的调度变得复杂。如果更新合并完成前，恰好对其中的数据继续读取，LSM 树就需要读取几个层级局部合并的日志，会导致读取放大和空间放大，从而影响读效率。
+
+总结来说，B+ 树有较好的顺序读写性能，而 LSM 树在数据随机写方面占优。此外 LSM 树采用后台合并的方式，使得性能的波动难以预期，性能波动和上层存储和计算的关联性较弱，增加了整体设计的成本。综上考虑，TuGraph 选用 B+ 树作为读性能优先的实现。
+
+## 4.数据编码
+
+对于属性图模型而言，除了图拓扑编码外，属性数据也会很大程度影响功能和性能，我们先讨论属性数据如何与拓扑数据共存的编码格式。从目前的调研来看，属性编码有两种方式，我们称之为基于指针索引将属性数据单独存储的离散编码，和将属性数据和拓扑数据打包在一起的紧凑编码。离散编码根据程度的不同，可以每个属性都单独存储，或者每条边的属性打包后各自存储，下面的讨论对两种情况都适用。
+
+点查询。属性编码主要针对边，不涉及点查询。
+
+单边查询。离散编码通过指针定位边，紧凑编码则需要二分查找定位边的位置，离散编码有略微的优势。
+
+边遍历。离散编码在边遍历过程需要不断地进行指针跳转进行随机数据访问，而紧凑编码提前把数据排列在一起，顺序访问的特性使得效率大大提升。 由规律三知对边的遍历操作很普遍，紧凑编码在边遍历的优势明显。
+
+单边更新。离散编码对边的更新仅需找到对应的指针位置，插入数据后修改前后指针指向。紧凑编码则需要对紧凑排列的数据进行重编码，对整个边值进行重新写入，开销显著大于离散编码的情形。
+
+批量边更新。批量更新可以在内存中预先构建点的所有边属性，一次性编码写入，离散编码和紧凑编码相当。但紧凑编码不需要存储指针变量，更少的存储空间效率也会更高。
+
+以上离散编码和紧凑编码在某一类的查询的性能问题，可以通过优化的来缓解。整体上说，由于图负载读写 20:1 的特性，读性能在整体性能中占比更高。以及规律三所揭示的对属性访问的特征，TuGraph 更倾向于采用紧凑编码来保证读性能。其主要弱势为单边更新时重编码的开销，可以用自适应映射的技术来解决，
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..0e4b70768c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,34 @@
+# 多层级接口
+
+
+> 此文档主要介绍 TuGraph 的多层级接口的设计理念。
+
+## 1.简介
+
+多层级接口是 TuGraph 针对多丰富的使用场景，在易用性和高性中作出的平衡。比如描述式图查询语言 Cypher 能够抹去图数据库实现的细节，基于图模型的抽象来进行表达。Cypher 过于高层的表述，无法高效转化成底层的执行，因此提供了 Procedure API 的过程式语言，来发挥图数据库的最佳性能。
+
+接口可以大致分为客户端接口和服务端接口，大部分操作都在服务端完成，客户端只做数据的封装和解析。客户端和服务端通过网络连接，TuGraph 支持更加灵活的短连接 REST 协议，以及更加高效的长链接 RPC 协议，可根据不同的业务场景来选择。
+
+服务端接口均处在计算层，和图数据存储间用一层 Core API 在逻辑上隔开。
+
+![多层级接口架构](../../../../images/multi-level-Interfaces.png)
+
+### 1.1.客户端接口
+
+客户端接口指在客户端执行的接口，通常用于集成到软件应用中。TuGraph 的客户端的接口比较简单，包括登录登出、数据导入导出、存储过程加载调用、Cypher操作等。其中 Cypher 中集成了大部分的功能，包括数据操作、图模型操作、运维管理、账户管理等。
+
+由于 Cypher 的参数和返回值都是字符串，JAVA OGM 是对 Cypher 的结构化封装，即查询结果能够被封装为一个有类型的对象，方便使用。
+
+### 1.2.服务端接口
+
+服务端接口包括描述式图查询语言 Cypher、过程式图查询语言 Procedure API、图分析编程框架 OLAP API 和图神经网络编程框架 GNN PI，为图事务引擎、图分析引擎、图神经网络引擎提供服务，下面先展开介绍各个接口的特点。
+
+> __描述式图查询语言__ 是对查询逻辑的抽象描述，而与执行逻辑无关，对图数据库应用者比较友好，类比关系型数据库的 SQL 语言。TuGraph 的 Cypher 语言主要依照 Neo4j 开源的 OpenCypher 查询标准，同时对运维管理等辅助功能进行了扩展，在功能上囊括了 TuGraph 的大部分操作。描述式图查询语言会成为图数据库的主要数据操作方式，但由于描述到执行之间需要生成执行计划（Execution Plan），生成最优执行计划在学术界和工业界均有很长的路要走。
+
+> __过程式图查询语言__ 是为了解决描述式图查询语言与最优性能间的鸿沟。TuGraph的 Procedure API 是在 Core API 上做了一层简单的封装，C++ Procedure API的灵活性和高效性能够充分发挥存储的极致性能，也是 Cypher 优化的上限性能。Python Procedure API 是 C++ Procedure API 上的一层跨语言封装，翻译过程中值的拷贝会带来一定的性能损失，优势则主要是 python 语言本身的易用性。raversal API 是并行执行的 Procedure 接口，描述上更接近于集合的操作，比如扩展点集合所有出度邻居，获得一个新的点集。
+
+> __图分析编程框架__ 属于 ‘图计算系统’ 的范畴，会将图数据从支持增删改查的存储中导出快照，以更紧凑的数据存储格式来支持只读的复杂图分析，这里叫做OLAP API。OLAP API 封装了高并发执行的数据结构，包括 Vector、Bitmap等，以及基于 CSR 格式的图快照数据结构，然后提供一套并发的快速点边操作框架。在图分析任务完成后，数据可以通过接口写回图数据库。
+
+> __图神经网络编程框架__ 主要提供了图神经网络应用编程所需要的接口，能够对接PyTorch 等机器学习框架。TuGraph 的图神经网络编程框架主要集成了 DGL，在 Python 的语言环境中完成从图存储到图神经网络应用的完整流程。
+
+除了 Cypher 是解释执行外，其余服务端接口都是编译执行，即需要将对应代码传到服务端后，进行编译（可能会有时间开销），再在服务端执行。所以通常需要先加载，然后再已加载的应用列表中找到程序，传输入参数后执行
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/3.htap.md
new file mode 100644
index 0000000000..16eff8e94f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> 此文档主要介绍 TuGraph 的HTAP的设计理念。
+
+## 1.简介
+
+![htap架构](../../../../images/htap.png)
+
+HTAP 的实现在架构上有多种不同的方式：一是用两个不同的副本来分别处理 OLTP 和 OLAP 的任务，核心是数据的一致性同步和额外的资源开销；二是在任何时候都使用同一份数据存储，该实现的数据结构存在内存膨胀，在工业化落地还需要进一步工作。在 TuGraph 的设计中，简单的 OLAP 操作和 OLTP 操作共用一份数据，而复杂的 OLAP 操作则单独导出快照处理。
+
+## 2.设计
+
+在 TuGraph 中，OLTP 为图事务引擎，在图 4.4对应事务操作；OLAP 为图分析引擎，对应简单图分析操作（比如 SPSP）和复杂图分析操作（比如 PageRank），前者可以直接在图存储上执行，而后者需要额外导出快照执行。
+
+- 事务操作，即图事务引擎测的操作，为局部图的增删查改操作，典型的应用为 K 跳访问 K-Hop。
+- 简单分析操作，是图分析引擎中较为简单的部分，通常也是局部的图分析操作，比如两点间最短路算法 SPSP、Jaccard 算法。
+- 复杂分析操作，是图分析引擎中较为复杂的部分，通常涉及全图的多轮数据迭代操作，比如网页排序算法 PageRank、社区发现算法 Louvain。
+
+如图 4.4所示，我们在架构图中增加了外部存储，使得图分析的数据源不局限在图数据库中，可以直接从文本文件读取。
+
+- 图存储，即图数据库中的存储，有精心设计的数据结构，能够完成实时增删查改。
+- 外部存储，可以是 RDBMS 或文本文件，以边表的简单方式存储，仅供一次性批量读取，和批量结果写入。在计算层，和整体架构图中的接口对应。
+- Cypher，描述式图查询语言，可以并发执行。
+- Procedure API，过程式图查询语言，其灵活性能够同时支持事务操作和图分析操作，但效率上不足以完成复杂图分析操作，可以并发执行。
+- OLAP API，针对多轮迭代的复杂图分析。应用需要先将存储中的图数据导出成内存中的一个快照，该快照仅用来快速访问，而不需要考虑 ACID 的写支持，因此可以排布地更加紧凑，CSR 排布的读效率要远高于图存储的数据排布。OLAP API 只能串行执行，每个操作都用满 CPU 资源。
+
+OLAP API 的快照可以从外部存储创建，即将边表数据构成件 CSR 的格式；或者从图存储中创建。需要注意的是，OLAP API 要求点的 ID 是连续的自然数，可能需要额外的 ID 映射，该步骤在创建快照时可以在指定一个属性进行映射，或直接取属性值作为 ID。
+
+与计算接口和存储相对应，有四种运行模式。
+
+- 事务模式，每个操作对应一条 Cypher 语句，默认是一个事务。
+- Plugin 模式，通过插件的方式，在计算逻辑加载到服务端后调用，也叫存储过程。
+- Embed 模式，和 Plugin 模式的使用接口一致，区别是图数据库服务不需要起来，就可以直接用接口调用数据库中的数据，通常用于调试 Procedure API 和OLAP API 的代码，调试信息和操作步骤比 Plugin 模式更加友好。
+- Standalone 模式，最大程度剥离与图数据库的关系，仅想用图分析引擎做数据分析时，该模式会比较直接。Standalone 模式会直接使用外部存储的数据。
+
+图神经网络引擎的使用方式和 ‘复杂图分析操作’ 类似，会同时调用部分 OLAP API 和 GNN API，不在这里展开。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/index.rst
new file mode 100644
index 0000000000..853243ed8c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/4.characteristics/index.rst
@@ -0,0 +1,10 @@
+产品特点
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
+    
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/5.architecture.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/5.architecture.md
new file mode 100644
index 0000000000..cf901d31cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/5.architecture.md
@@ -0,0 +1,15 @@
+# TuGraph产品架构
+
+> 此文档主要介绍 TuGraph 的产品架构。
+
+## 1.简介
+
+![产品架构](../../../images/architecture.png)
+
+上图从功能模块的角度，以 TuGraph 为例，给出了企业级图数据库的整体架构，自下而上包括：
+
+- 软硬件环境。涉及图数据库的开发和使用环境。TuGraph 主要基于底层的 C++语言开发，能够兼容市面上大部分操作系统和 CPU。
+- 存储层，包括 KV 存储层和图存储层。存储层需要支持计算层所需的各个功能。
+- 计算层。计算层应包括图事务引擎、图分析引擎和图神经网络引擎，也包含了服务端提供的多种编程接口，包括描述式查询语言 Cypher，存储过程等。
+- 客户端。客户端 SDK 应支持 Java、Python、C++ 等多种语言，也支持命令行的交互方式。Browser 和 Explorer 通过网页端交互的方式，降低了图数据库的使用门槛。
+- 在生态工具方面，覆盖了企业级图数据库的开发、运维、管理等链路，提升可用性。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/6.functionality.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/6.functionality.md
new file mode 100644
index 0000000000..934032187e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/6.functionality.md
@@ -0,0 +1,112 @@
+# 功能概览
+
+> 此文档主要介绍 TuGraph 的主要功能和特性。
+
+## 1.安装部署
+
+## 1.1.部署方式
+
+TuGraph目前提供云部署、Docker部署以及安装包部署三种部署方式，用户可根据实际情况选择适合的部署方式。
+
+## 1.2.软硬件环境
+
+TuGraph核心是由C++开发，默认使用的编译器为GCC8.4，使用c++14标准。部分功能使用了其他编译器，比如全文索引的实现基于ApacheLucene，采用JNI接口需要Java编译器。此外，存储过程中额外提供了Python Procedure API，该功能需要Python环境。TuGraph不需要特殊的硬件比如GPU，对RDMA、HBM等高延迟低带宽的通用硬件升级可以天然适配。
+
+TuGraph测试过基于X86和ARM的CPU，包括Intel、AMD、Kunpeng、Hygon、飞腾等，也同时在多个操作系统上运行，包括Ubuntu、CentOS、SUSE、银河麒麟、中标麒麟、UOS的主流版本，对操作系统和CPU没有特殊的要求。
+
+软硬件环境也包括依赖库的环境，由于TuGraph的存储层中默认的KV存储是LMDB，需要文件系统能够支持POSIX接口。在不同的环境下编译和参数配置会略有不同，比如在图存储的点边数据打包中，应和操作系统的页表大小匹配，默认为4KB，建议将系统的页表大小也设置为4KB。
+
+## 2.存储层
+
+在图数据模型上，TUGraph支持属性图模型，按照层次可以分为子图、标签（包括点标签和边标签）、属性。从存储层看，TuGraph使用使用直观的多层的树状模型，没有跨子图的标签，也没有跨标签的属性，仅保留图模型的核心逻辑。
+
+在子图的存储上，TuGraph对多图做了数据的物理隔离，每个图对应一个LMDB的实例。多图的元数据描述信息，保存在meta的特殊的公共LMDB实例中。点边标签及其属性的存储，通过将图数据自适应地映射到KV键值对，最大程度发挥读性能。同时在KV层实现了多线程写，解决了LMDB写性能较低的劣势。主键索引和二级索引，对应LMDB中B+的表，支持基于比较的索引值增删查改。
+
+存储层还保留了一些其他非核心功能的数据，包括权限数据、预编译的插件数据、监控数据等。
+
+## 3.计算层
+
+计算层在功能上分成三个部分，包括TP类的图事务引擎，AP类的图分析引擎和图神经网络引擎。
+
+- __图事务引擎__，主要用来处理并发的图操作，包括单点查询、邻居查询、路径遍历。图事务引擎侧重并发操作的ACID事务，确保操作逻辑不会互相干扰，主要性能指标为 QPS，即每秒完成的查询数量。
+
+- __图分析引擎__，操作类型通常为全图迭代。部分简单的分析任务（比如SPSP）可以由图事务引擎完成，复杂的分析任务均由图分析引擎完成，单个任务通常需要数秒至数小时。因此单个图分析任务要并发利用所有的硬件资源，性能指标为任务完成的总时长。
+
+- __图神经网络引擎__，通常也为全图迭代。图神经网络引擎除了基于图拓扑的操作，也需要集成一个机器学习的框架来处理向量操作，比如 PyTorch、MXNet、TenserFlow。
+
+三个引擎的操作逻辑不尽相同，独立配置资源池。事图事务引擎基于RPC操作设置了一个线程池，每接受客户端的一个操作，从线程中取一个线程来处理，并发执行的数量等于RPC线程池的容量，通常配置为服务器的核数。图分析引擎有一个分析线程池，每个图分析任务会并发执行，即用所有的线程来执行一个任务，来加速操作的性能。TuGraph图分析操作串行执行的特性会一定程度限制用户的使用体验，并发的图分析的需求可以通过高可用部署的方式，增加机器资源来处理，或者接入外部的任务调度器，将数据传到实时调度的容器来计算。图神经网络操作在图上的操作会复用图事务引擎或图分析引擎的资源，向量的操作会起单独的资源，在机器学习框架中可以使用GPU等单独的加速硬件。
+
+## 4.核心功能
+
+### 4.1.查询语言
+
+TuGraph 提供 Cypher 图查询语言，遵循OpenCypher标准。
+- __支持Procedure嵌入__
+
+- __可插拔优化框架__ 各类优化功能
+
+- __可扩展安全性检查框架__ 对于cypher进行
+
+### 4.2.存储过程
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个 REST 请求并在客户端完成整个
+处理流程的方式，TuGraph 提供的存储过程（Procedure）是更简洁和高效的选择。
+
+从 3.5 版本开始，TuGraph 重新设计了新的存储过程编程范式，支持定义标准的签名和结果，支持POG编程。
+
+TuGraph 支持 POG (Procedres on Graph Query Languages) 编程和 POG 库，其中“Graph Query Languages”包含 Cypher 以及
+制定中的 ISO GQL 等图查询语言。POG 库提供在查询语言中对用户定义的存储过程的访问，打破了查询语言和存储过程之间的界限，扩展了查询
+语言的使用范围。
+
+> 这个文档描述了 [新的 Procedure 编程范式以及 POG](../5.developer-manual/6.interface/3.procedure/1.procedure.md)。
+
+### 4.3.数据导入导出
+
+尽管TuGraph本身支持数据的插入，但批量导入能够大幅提升的效率。导入的功能可以分为空库导入（离线导入）和增量导入，前者指子图是空的时候进行导入，额外的假设能够大幅提升导入的性能，在 TuGraph 中，空库导入和增量导入的吞吐率差了10 倍。在数据导出中，需要考虑导出数据的一致性，即是基于一个快照数据导出的。
+
+TuGraph 可以通过 命令行工具`lgraph_export` 来对已经存放在TuGraph的图数据进行数据导出，导出格式支持CSV和JSON。
+
+### 4.4.备份恢复
+
+TUGraph的备份在功能上可分为主动/定时、离线/在线、全量/增量备份，用尽量小的存储和计算代价来完成备份。恢复功能可以恢复到最新的状态，或者历史标注的时间点，需要保证数据库是一致的状态。
+
+### 4.5 数据预热
+
+TuGraph 是基于磁盘的图数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+### 4.6 高可用
+
+高可用是指通过通过集群配置，做到实时多副本数据热备，在部分副本不用时，集群仍然能正常提供服务，TuGraph采用 RAFT 协议的多机热备机制，能够将 RPO 降低到接近 0 的程度。TuGraph 选择在计算层进行数据同步，同步的对象是写操作，通过 RPC 接口快速同步。TuGraph 的高可用集群采用主从模式，只有主节点处理写请求，主从节点均能处理读请求。主节点的写请求处理需要同步到多于二分之一的总节点上，多数节点写成功，该写请求才算完成。
+
+## 5.客户端工具
+
+客户端主要分为各种编程语言的SDK，OGM以及命令行工具。
+
+客户端 SDK 主要用于二次开发，可以通过 RPC 或 REST 协议链接服务端。RPC 基于长链接有较好的性能，数据需要通过 protobuf 统一序列化。TuGraph 使用brpc，支持 Java、Python、C++ 的 rpc 客户端。REST 的协议比较宽泛，能够简单适配更加多样的环境，不同的编程语言能够简单对接。TuGraph 给出了 Python 的REST 客户端实例，命令行的交互也是用 REST 实现。
+
+OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。
+
+命令行工具`lgraph_cypher`是查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+
+## 6.生态工具
+
+生态工具是企业级数据库一个非常重要的组成部分，丰富的生态工具能够大大提升图数据库的可用性，稳定性。
+
+### 6.1.TuGraph DataX
+
+![导入导出](../../../images/tugraph-datax.png)
+
+TuGraph 核心支持 CSV 和 JSON 合适的导入导出，提供空库导入和增量导入的模式。实际中会存在 MySQL、Kafka、Hive 等多数据源导入的需求，TuGraph 通过 DataX 做多数据源的对接。由于关系模型和图模型存在的差异，数据清洗的流程可以使用 SparkSQL 快速处理，TuGraph 本身仅关注 CSV 和 JSON 的简单场景导入可靠性和性能。
+
+### 6.2.可视化交互
+
+TuGraph Browser 是面向图数据库直接使用者的可视化交互界面，功能上覆盖了 TuGraph 的绝大部分能力，包括数据导入、图模型建立、数据增删查改、监控运维等操作链路。
+
+TuGraph Explorer 则是面向图业务方，更侧重业务逻辑。Explorer 是基于Graph Insight的零代码编程框架生成的可视化交互界面，可以比较方便地添加业务更加友好的交互元素，把图作为一个底层的理解形象的展现出来。
+
+### 6.3.运维监控
+
+TuGraph 使用 Prometheus 加 Grafana 的监控框架，采用松耦合的方式。Prometheus 从 TuGraph 的监控接口获取监控信息，存储在本地时序数据库中，然后通过 Grafana 在网页端交互展示。
+
+TuGraph 提供的监控的状态包括图数据库的状态和服务器的状态，前者包括读写负载、点边数量等数据库端的状态，后者包括内存、CPU、硬盘等服务器的实时状态。如果某些监控状态超过了预期的阈值，就需要主动告警，通常需要对接其他运维管控系统，比如群消息、邮件告警等。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/7.scenarios.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/7.scenarios.md
new file mode 100644
index 0000000000..4cc5c0c10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/7.scenarios.md
@@ -0,0 +1,61 @@
+# 应用场景
+
+> 此文档主要介绍图数据库适用的应用场景。
+
+## 1. 金融领域
+
+金融领域的实体主要涉及人、公司、账户、产品等，它们之间的关系包括交易关系、登录关系、股权关系、雇佣关系等。这些实体构成了一张金融图数据网络。应用图数据库，我们可以从金融图数据网络里发掘出大量有用信息，帮助我们做出更准确的金融决策。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|贷款审核|通过分析申请人的关联关系、交易情况等辅助判断申请人的偿还能力和偿还意愿，可应用于零售贷款审核、小微贷款审核、供应链金融等。此方法可与传统的基于申请人自身信息的审核机制互补，在个体信息录覆盖较低的小微贷款审核中尤其有用。|
+|贷后管理|通过分析借款人交易情况，辅助分析借款人是否有逾期风险。相比于传统只在贷款资金流向特定用户的情况下发出警报的方式不同，该方法可以给每个账户赋予一个风险值，并在贷款流向高风险账户时给出预警。|
+|失联修复|通过分析失联贷款人的社交和购物数据，找出其它联系方式。该方法可以大幅改进失联修复率。|
+|担保环检测|可在担保关系图中找出环状、链式、家族式、交叉等特殊担保结构，揭露潜在风险。相比于关系型数据库的JOIN方法，基于图算法的方案更高效，可以检测出任意长的担保环，且可以实现更复杂限定条件的检测。|
+|信用卡团伙欺诈检测|构建信用卡申请信息中的地址、联系方式等关系网络，在申请关系网络中运行社区发现算法，可以检测出疑似欺诈的团伙，从而拒绝涉嫌欺诈的申请件，减少经济损失。|
+|反洗钱|通过交易网络和介质网络，找出疑似洗钱的行为和链路。洗钱是一个复杂的多方参与的过程，通过在交易和社交网络中进行图分析，我们可以更精准的检测出洗钱行为。|
+|车险反欺诈|针对有修理厂参与的骗保行为，通过分析被保人、案件地点和修理厂之间的关系，可以更精准的识别出骗保行为，减少经济损失。|
+
+## 2. 工业领域
+
+在生产和制造过程中会产生大量异构数据，如何有效的组织和管理这些数据是工业大数据中最重要的问题之一。这些数据包括设计文档、设备数据、仿真方案和结果、实验结果、经验文档等，关系错综复杂。传统的数据管理系统只能累积数据，而查找相关材料则往往力不从心。使用图模型，将这些不同类型的数据组织成一张网络，就可以方便地浏览和查找数据。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|供应链管理|供应链数据主要关心产品—部件—零件的对应关系、零件与供应商的对应关系、零件中的敏感成分等。相比于传统的物料管理（BOM）系统，使用图数据库的方案可以更方便地维护多个部件层次、多个供应商级别的复杂网络，从而为穿透式供应链提供基础支持。|
+|文档管理|使用图数据库可以将不同类型的文档按不同关系有机地组织在一起。例如将部件设计文档、部件—零件关系、部件测试文档、相关经验文档等组织起来，在需要查找时就可以方便获取该部件的所有相关信息。|
+|研发过程管理|产品研发和验证过程中需要进行大量仿真、试验和测试，每一个测试流程都会涉及大量不同的步骤。步骤之间的连接关系、每个步骤中使用的数据版本、算法版本等就构成了一张复杂的关系网络。使用图数据库可以更好管理这个关系网络，从而为研发过程中的数据复用、流程改进提供良好基础。|
+|设备信息管理|制造业需要管理大量设备，设备之间又互相关联（供电关系、供料关系、空间关系），从而形成了一张复杂的网络。传统的数据库很难体现这种复杂关系。而使用图数据库则可以便捷表示这些关系，从而更好的管理设备信息。|
+
+## 3. 智慧城市
+
+随着科技的发展，城市的智能化管理已成为一个大趋势。智能化管理需要建立在良好的信息管理平台之上，因此需要强大的系统软件做支撑。在智能化城市管理系统中，智能化决策系统需要基于大量不同信息做出决策，这些信息包括各种拓扑信息（道路、管线），供求信息（电力输送、饮用水供应、污水排放），环境信息（温度、湿度、雨量）等。要将这些复杂的异构数据有机管理起来，并基于它们做出决策，就需要一个成熟的系统。传统的数据管理系统基于关系数据模型，并不适合管理这种复杂异构数据。而使用图模型就可以很好的解决这一问题。如果我们将这些不同的数据利用图数据库进行管理，就可以实现很多复杂的智能管理场景。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|智能交通|基于道路拓扑、道路容量及当前流量，可以进行智能信号灯调度，从而提高通行效率。|
+|智能排水|基于排水系统信息及当前雨量，可以对排水系统进行调度，从而减少内涝的产生。|
+|管线管理|将管线的生产、安装、拓扑信息，以及历史状态信息有机组织起来，可以帮助我们对管线进行全周期管理，包括故障排查、寿命评估等。|
+|人群疏散|大量人群需要疏散时，需要考虑公交、地铁、出租车、共享单车等多种交通方式，同时还需要考虑道路承载量。使用图数据库将这些信息有机整合在一起，可以帮助我们更好的做出决策，以便为大型公共活动提供更好的支持。|
+
+## 4. 社会治理
+
+社会治理包括公共安全、法律事务、舆论、网络安全等多方面。社会治理是一个综合性的、多系统联动问题。它需要综合大量数据、全局考量才能做出更好的决策。在这种多维度复杂数据问题上，图数据模型可以提供更好的适应性，从而为智能化的社会治理决策平台提供坚实的基础。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|犯罪团伙发现|合谋团伙必然会通过某些方式产生联系，这种联系包括面谈（出现在同一地点）、电话联系、或者互联网联系，他们还可能有经济往来。如果我们将这些数据统一存放在一张图中，我们就可以通过图分析算法查找出联系紧密的群体，从而发现和识别整个犯罪团伙。|
+|涉众案件调查|涉众案件，特别是涉众经济案件往往涉及大量的人员和要素（货币、地点、事件等）。如何有效的组织这些资料，从而为办案提供证据支持是涉众案件调查的一个难点。使用图数据库来存储和分析这些资料，可以让我们快速定位资料、分析人员构成、为案件调查提供更好的技术支持。|
+|违法网站甄别|违法网站、钓鱼网站、黄色网站等往往通过使用不同的域名和IP来避免被封杀。基于黑名单的过滤方法只能封禁已知的违法网站，无法对新出现的域名和IP进行有效甄别。基于IP—域名网络的映射关系，我们可以建立一张图，然后通过图计算建立起域名和IP的“可信度”模型，利用该模型来判断网站是否属于违法网站。|
+|法院卷宗管理|卷宗往往错综复杂，不同的案件之间可能通过当事人产生联系，也可能通过案发地、案件性质、审判人员等产生联系。这些联系构成了一张复杂的网络。使用图数据库我们可以更方便的管理这些复杂关系，提高办案和查询效率。|
+
+## 5. 互联网
+
+人—人关系的社交网络、人—商品的购买关系都能构成图。通过分析这些网络数据，我们可以为用户提供更优质的服务，包括相关推荐、用户信息归集、重要用户识别、垃圾用户识别等。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|ID映射|图数据库可以将用户相关的所有信息，包括用户之间的关系统一存储在一个数据库中，同时还能通过这些关系来找出疑似单人多号和多人一号的情况，从而为后期的风控、推荐等业务提供决策支持。|
+|好友推荐|基于分析社交网络，我们可以提供“好友的好友”，“共同好友”等好友推荐。|
+|商品推荐|基于用户—商品关系图，我们可以找出兴趣爱好类似的用户，向他们推荐类似用户选择的其他商品。|
+|垃圾用户识别|传统的垃圾用户识别主要基于用户账号本身的信息，如注册信息、发帖信息等，但是这些信息都比较容易伪造。而基于网络的信息则不存在这个问题：它们很难被伪造。因此基于网络信息的垃圾用户识别可以更加精准和高效。|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/8.glossary.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/8.glossary.md
new file mode 100644
index 0000000000..5171d5ece8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/8.glossary.md
@@ -0,0 +1,38 @@
+# 名词解释
+
+## 1.图技术
+
+> __图计算__：广义图计算，技术上包括图查询、图分析、图学习；狭义图计算，包括图计算任务和图分析。
+
+> __图查询__：指图数据库的查询能力，通常通过Cypher/ISO GQL等查询语言实现。
+
+> __图分析__：侧重于对全图数据的算法分析、模式分析等。
+
+> __图学习__：与图神经网络、图机器学习含义相同。
+
+> __图智能__：等于广义图计算，包括图数据库、图分析、图学习，通常用于概念推广，不用于产品。
+
+## 2.图产品
+
+> __图计算系统__：一般包括图数据库、图分析系统、图学习系统，有时也特指图分析系统。
+
+> __图数据库__：侧重于对图数据的增删改查、事务性操作等，如TuGraph DB、Neo4j、JanusGraph等。
+
+> __图分析系统__：解决图分析问题，可以细分为流水图分析、离线图分析，如TuGraph Analytics、GraphX等。
+
+> __图学习系统__：解决图学习问题，比如TuGraph Learn、DGL等。
+
+## 3.具体概念
+
+
+> __Vertex__：点，也叫顶点，也指 Vertex Value。尽量避免Node（结点、节点）的叫法，一般用Node表示服务器个数，容易叫混。结点指结合、交结、交叉的意思；节点可以指一个时间线上的里程碑（关键节点）或计算机系统里的一个处理实体（如计算机网络里的一台服务器）。
+
+> __Edge__：边，也指 Edge Value。
+
+> __Vertex Label__：点类型，也叫 Vertex Type。
+
+> __Edge Label__：边类型，也叫 Edge Type。
+
+> __Degree__：度，入度/出度，表示一个点的入边、出边的条数。注意，在非图论的场景中，往往把“跳”也称作“度”。
+
+> __Hop__：跳，表示一个点到另一个点之间的路径经过的点数（不含起点、含终点）。算法性能测试里K-Hop即为此义。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/index.rst
new file mode 100644
index 0000000000..3346808f92
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/2.introduction/index.rst
@@ -0,0 +1,16 @@
+TuGraph入门
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.characteristics/index.rst
+   5.architecture
+   6.functionality
+   7.scenarios
+   8.glossary
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..e74f15c0ca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/1.preparation.md
@@ -0,0 +1,84 @@
+# 快速上手
+
+> 此文档主要用于新用户快速上手，其中包含了 TuGraph 的简介、特征、安装和使用。
+
+## 1.简介
+
+TuGraph 是蚂蚁集团自主研发的大规模图计算系统，提供图数据库引擎和图分析引擎。其主要特点是大数据量存储和计算，高吞吐率，以及灵活的 API，同时支持高效的在线事务处理（OLTP）和在线分析处理（OLAP）。 LightGraph、GeaGraph 是 TuGraph 的曾用名。
+
+主要功能特征包括：
+
+- 标签属性图模型
+- 支持多图
+- 完善的 ACID 事务处理
+- 内置 34 图分析算法
+- 基于 web 客户端的图可视化工具
+- 支持 RESTful API 和 RPC
+- OpenCypher 图查询语言
+- 基于 C++/Python/Java 的存储过程
+- 适用于高效图算法开发的 Traversal API
+
+性能及可扩展性特征包括：
+
+- TB 级大容量
+- 千万点/秒的高吞吐率
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线备份
+
+
+### 1.1.支持的平台
+
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的的平台。
+
+### 1.2.硬件要求
+
+_目前我们建议用户使用 NVMe SSD 配合较大的内存配置以获取最佳性能。_
+
+| 硬件   | 最低配置      | 建议配置                     |
+|------|-----------|--------------------------|
+| CPU  | X86_64    | Xeon E5 2670 v4          |
+| 内存   | 4GB       | 256GB                    |
+| 硬盘   | 100GB     | 1TB NVMe SSD             |
+| 操作系统 | Linux 2.6 | Ubuntu 18.04, CentOS 7.3 |
+
+## 2.安装
+
+TuGraph 可以通过 Docker Image 快速安装，或者通过 rpm/deb 包本地安装。另外TuGraph在阿里云计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。
+
+> 安装包/镜像下载：[下载地址](../1.guide.md#TuGraph最新版本 )。
+
+> 计算巢部署：可以在阿里云计算巢自行搜索，也可以通过[部署链接]( ../5.developer-manual/1.installation/5.cloud-deployment.md )快速访问。
+
+### 2.1.通过docker快速体验
+
+1. 本地安装 docker 环境
+
+   参考 docker 官方文档：https://docs.docker.com/get-started/
+
+2. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. 启动docker
+   ```shell
+   docker run -d -p 7070:7070 -p 9090:9090 -p 7687:7687 --name tugraph_demo tugraph/tugraph-runtime-centos7 lgraph_server
+   # 7070是默认的http端口，web访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   # 7687是bolt端口，neo4j client访问使用。
+   ```
+
+4. web 访问
+
+   `http://x.x.x.x:7070`
+
+   > 默认用户名为 `admin`，密码为 `73@TuGraph`
+
+5. 手动启动方式
+   ```shell
+   docker run -dt -p 7070:7070 -p 9090:9090 -p 7687:7687 --name tugraph_demo tugraph/tugraph-runtime-centos7
+   docker exec -it tugraph_demo bash
+   # 进入docker环境后执行如下命令启动服务
+   lgraph_server -d start
+   ```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..b8dd8d03ec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# 影视场景Demo
+
+> 此文档主要介绍 影视场景Demo 的使用方法。
+
+## 1.建模和数据导入
+
+完成登录后，点击`新建图项目`，选择movie数据，填写图项目配置，系统会自动完成Movie场景图项目创建。或者直接使用产品自带的movie图项目（带有官方图标）。
+
+Movie 场景图：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| 标签          | 类型  | 说明                                  |
+|-------------|-----|-------------------------------------|
+| movie       | 实体  | 表示某一部具体的影片，比如"阿甘正传"。                |
+| person      | 实体  | 表示个人，对影片来说可能是演员、导演，或编剧。             |
+| genre       | 实体  | 表示影片的类型，比如剧情片、恐怖片。                  |
+| keyword     | 实体  | 表示与影片相关的一些关键字，比如"拯救世界"、"虚拟现实"、"地铁"。 |
+| user        | 实体  | 表示观影的用户。                            |
+| produce     | 关系  | 表示影片的出品人关系。                         |
+| acted_in    | 关系  | 表示演员出演了哪些影片。                        |
+| direct      | 关系  | 表示影片的导演是谁。                          |
+| write       | 关系  | 表示影片的编剧关系。                          |
+| has_genre   | 关系  | 表示影片的类型分类。                          |
+| has_keyword | 关系  | 表示影片的一些关键字，即更细分类的标签。                |
+| rate        | 关系  | 表示用户对影片的打分。                         |
+
+## 2.查询示例
+
+### 2.1.示例一
+
+查询影片 'Forrest Gump' 的所有演员，返回影片和演员构成的子图。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.示例二
+
+查询影片 'Forrest Gump' 的所有演员，列出演员在影片中扮演的角色。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.示例三
+
+查询 Michael 所有评分低于 3 分的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.示例四
+
+查询和 Michael 有相同讨厌的影片的用户，讨厌标准为评分小于三分。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.示例五
+
+给 Michael 推荐影片，方法为先找出和 Michael 讨厌同样影片的用户，再筛选出这部分用户喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.示例六
+
+查询 Michael 的好友们喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.示例七
+
+通过查询给'Forrest Gump'打高分的人也喜欢哪些影片，给喜欢'Forrest Gump'的用户推荐类似的影片。
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..c39e48f40d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,62 @@
+# 场景：流浪地球
+
+> 此文档主要介绍 流浪地球 demo的使用方法。
+
+## 1.Demo场景设计
+
+Demo背景基于流浪地球1、流浪地球2的故事背景进行设计
+
+- 基于剧情，设计了图结构，包含组织、角色、天体与设施3类点，事件、关系两类边
+- 根据剧情准备了对应Schema的数据
+- 准备了一些query，提出一些关于剧情的问题
+
+## 2.目录结构
+
+- rawdata: 原始剧情数据和schema定义文件
+- case.cypher: 查询相关的Cypher语句
+- control.sh: 控制TuGraph Server启动停止的脚本
+- lgraph_standalone.json: TuGraph Server启动的配置文件
+
+## 3.使用说明
+
+前置条件：TuGraph已安装
+
+## 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择流浪地球数据，填写图项目配置，系统会自动完成流浪地球场景图项目创建。
+    - 或者直接使用产品自带的流浪地球图项目（带有官方图标）。
+
+## 5.Cypher查询
+
+参考cypher文档，在TuGraph的Web页面前端输入Cypher进行查询
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.查询展示
+查询木星危机的所有事件经过
+
+```
+MATCH (n)-[e:事件关系]-(m) where e.title='木星危机' RETURN n,e
+```
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+查询所以危机的相关事件经过
+
+```cypher
+MATCH (n)-[e1]-(m)-[e2]-(p)
+where e1.title REGEXP ".*危机" and e2.title REGEXP ".*危机" and e1.title <> e2.title
+RETURN n,e1,e2,p
+```
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..13d98b4db8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# 场景：三体
+
+> 此文档主要介绍 三体 demo的使用方法。
+
+## 1.Demo场景设计
+Demo背景基于三体1、三体2、三体3的故事背景进行设计。
+
+根据三体故事的设定，我们设计了4类点和6类边，点包括“人物”、“组织”、“计划”、“时间线”，边包括“人物-人物关系”、“人物-计划关系”、“人物-组织关系”、“组织-计划关系”、“组织-组织关系”。
+根据剧情准备了对应Schema的数据，准备了一些query，提出一些关于剧情的问题。
+
+## 2.目录结构
+rawdata: 原始剧情数据和schema定义文件。
+case.cypher: 查询相关的Cypher语句。
+control.sh: 控制TuGraph Server启动停止的脚本。
+lgraph_standalone.json: TuGraph Server启动的配置文件。
+
+## 3.使用说明
+
+前置条件：TuGraph已安装。
+
+### 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三体数据，填写图项目配置，系统会自动完成三体场景图项目创建。
+    - 或者直接使用产品自带的三体图项目（带有官方图标）。
+
+### 5.Cypher查询
+
+参考TuGraph文档，在TuGraph的Web页面前端输入Cypher进行查询。
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![data](../../../../images/three-body-data.png)
+
+### 7.查询展示
+
+#### 7.1.人物关系查询
+三体一剧情中，一开始全世界各地发生了大量科学家自杀事件，引起了警方重视，查案过程根据人物关系线索一步步排查，就如上面的图所示，随着线索越来越多，背后的真相逐步浮出水面。史强和汪淼发现大多数人都和叶文洁有着直接或者间接的联系，并派汪淼卧底，最终发现叶文洁的最终统帅身份。在图中也可以看出，叶文洁顶点周围有很多边关系（一度或二度邻居很多）。
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.邻域顶点分析
+三体中的各种计划比较多，有的时候可能会被绕晕，这时候我们可以通过图的邻居顶点查询来查看该计划的相关人物和组织等。如"面壁计划"中,我们可以看到有四位人物与之相关，这四位也是被世人所寄予厚望的“面壁者”。
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.查询a节点和b节点的共同邻居
+我们往往希望知道两个人物之间的共同关联的人物都有谁，这样就能很快的掌握这两个人物之间的关系，在大数据量的情况下，使用cypher进行图关系分析就很方便！
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.设置/更改属性
+随着剧情推进，我们逐步了解了"叶文洁"身上的多个标签，那么我们也可以将这些标签更新至“叶文洁”节点上：
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.增加/删除节点
+后续我们了解到了罗辑、程心等等人物和PIA、星环集团等组织，希望把这些作为节点添加至图中：
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..3252a13eb5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# 场景：三国
+
+> 此文档主要介绍 三国 demo的使用方法。
+
+## 1. 简介
+由于史料的缺失，一些即使为人们熟知的历史事件也往往存在着很多未解之谜。以三国历史为例，诸葛亮为什么出山帮助当时势力弱小的刘备，同为天下英雄的曹操和刘备为什么成就差距巨大等等。以往学者往往采用二维关系分析历史，这样得出的结论往往比较片面。使用TuGraph将三国的历史人物和事件导入图模型中，使用图计算方式进行分析，能够帮助我们从有限的信息中获得更有价值的知识，是一种非常有意义的跨学科尝试。
+## 2. 数据建模
+我们设计了5类顶点和5类边，点包括“主公”，“州”，“文臣”，“武将”，“战役”，边包括“父亲”，“兄长”，“隶属”，“籍贯”，“参战”。其具体建模信息如下所示：
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. 数据导入
+- 手动导入
+    - 向TuGraph导入数据，既可以使用TuGraph的`lgraph_import`工具离线导入。lgraph_import导入命令如下所示
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- 自动创建
+    - 点击`新建图项目`，选择三国数据，填写图项目配置，系统会自动完成三国场景图项目创建。
+    - 或者直接使用产品自带的三国图项目（带有官方图标）。
+## 4. Cypher分析
+### 4.1. 诸葛亮为什么选择刘备
+通过如下cypher命令可以查看诸葛亮和曹操、刘备之间的关系
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+从图中可以很直观的看出，曹操和诸葛亮之间的最短路径之一包含徐州之战，曹操曾经因父亲被杀对徐州进行过屠城，而诸葛亮是徐州琅琊郡人，任何人都断然不会选择一个屠杀过自己家乡的军阀作为主公。而相反，刘备曾经在徐州之战中阻止过曹操的暴行，这应当是诸葛亮对刘备好感的原因之一。
+
+### 4.2. 曹操为什么成就比刘备高
+通过如下cypher命令可以查看家族对曹操创业的助力
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+平定天下最重要的就是军事人才，曹操其父本姓夏侯，过继于曹氏，曹氏和夏侯氏在谯县都属于地方大族，在曹操创业初期提供了夏侯惇，夏侯渊，曹仁，曹洪在内大量的军事人才。而刘备其父早丧，没有家族助力，年过50才凑齐了自己的五虎上将，而这时已经过了天下大乱争夺地盘的最佳时机，曹操已经天下九州居其六了。
+
+### 4.3. 三国中最强大的魏国为何最先灭亡
+通过如下cypher命令可以查看曹操集团的重要文官组成
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+曹魏事实上于249年灭亡于高平陵之变，立国29年，少于蜀汉（43年）和东吴（51年）。三国中实力最强大的魏国最先灭亡的原因就在于曹魏的文官制度（九品中正制）使得权力很容易集中在世家大族手中。从图中可以看出，曹操曹丕父子两代的重要文臣几乎都是世家大族，颍川荀氏，颍川钟氏，颍川陈氏，武威贾氏等，甚至还出现了地区化趋势，集中于颍川，最终政权也为和颍川荀氏关系密切的河内司马氏所篡夺。
+
+### 4.4. 三国各自的实力究竟如何
+通过如下cypher命令可以查看三国各集团的人口实力
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+得到的查询结果如下表所示
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+古代社会衡量一个国家实力的重要指标是人口数量，由于人口数据缺失，我们使用三国所有主公和文臣武将的籍贯数据估计每个州的人口数量。发现三国主要人物中，按籍贯有60个属于魏国，有23个属于吴国，仅有2个属于蜀国，证明魏国确实是三国中最强大的国家。
+
+### 4.5. 曹操的军事能力如何评价
+通过如下cypher命令可以查看曹操参与的主要战役
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+从图中可以看出，曹操在三国主要的15场战役中参加了8场，出场率比较高。但是曹操只获胜了徐州之战、兖州之战、官渡之战和襄樊之战，汉中之战、宛城之战、群雄讨董和赤壁之战都失败了，综合胜率50%，证明曹操并不算一个非常优秀的军事家。
+
+## 5. 备注
+更多的分析有待大家积极补充和尝试！
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..976b97e0ac
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Round The World Demo
+
+> 此文档主要介绍了基于tugraph-db开发的环球旅行（Round The World）demo
+
+## 简介
+
+基于"80天环游世界"的虚拟背景，基于部分公开历史航班数据，帮助用户设计多个城市的最优航班规划。
+- demo设计了自定义网站服务
+- 数据来源为国外某开源网站，不包含大陆城市航班数据
+- 数据中航班价格为模拟数据，不代表真实价格
+
+## 示例
+
+### 登录页面
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### 查询页面
+
+在登录页面点击后进入查询页面
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### 查询示例
+
+在左下角的城市列表中选择不超过8个城市，点击查询可返回推荐的航班规划，在满足前后航班间隔在2-6小时的要求下，返回费用最低和飞行时间最短的10条路径规划。
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+详细使用说明见[manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "")文档。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..4a29f62826
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo示例
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..e630bd12bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+快速上手
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..c8e16b0849
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,659 @@
+# 可视化操作手册
+
+> 此文档主要介绍 TuGraph Browser 的使用和操作方法。
+
+## 1.简介
+
+TuGraph Browser（以下简称Browser）是一款功能强大的产品可视化开发工具，它以直观的可视化方式呈现图数据，使用户可以轻松地管理、维护和查看数据库运行状态。此工具不仅支持图数据的管理和可视化，还支持对系统账户的管理，为用户提供了全面的操作和管理体验，让用户能够更加高效地管理和利用图数据库。
+
+## 2.操作指南
+
+### 2.1.访问
+
+当用户完成图数据库的安装后，可以通过浏览器访问Browser。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 8888。
+
+- 例如：127.0.0.1:8888
+- 推荐使用Chrome
+
+### 2.2.登录
+
+![login](../../../images/browser/login.png)
+
+- 浏览器成功访问Browser后，首先进入的是登录页面（如上图所示），用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 用户首次登录后，会跳转至修改密码页面，密码修改成功后，使用新密码重新登录方可使用。
+
+### 2.3.快速上手
+
+对于首次使用TuGraph的用户，可以通过产品内置的demo数据快速构建一个图项目，快速上手图数据项目。
+
+#### 2.3.1.创建图项目
+
+在`图项目`首页的选项卡中，点击`新建图项目`创建新的图项目。
+
+![快速上手-新建图项目](../../../images/browser/quickstart-creategraph.png)
+
+选择一个产品内置的demo数据，点击`下一步`按钮。
+
+![快速上手-选择一个demo](../../../images/browser/quickstart-selectdemo.png)
+
+在`填写配置`界面输入图项目信息，demo数据量都相对较小，`最大存储空间`设置为1G即可。输入完图项目信息后，点击`创建`按钮后，系统会自动创建demo数据的图模型、导入图数据。
+
+![快速上手-填写配置](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.开始图项目
+
+demo数据的图项目创建完成后，可以在`图项目`的选项卡中找到相应的图项目，可以点击`图查询`查询图数据。
+
+![快速上手-图项目选项卡](../../../images/browser/quickstart-graphtab.png)
+
+执行默认的查询语句，浏览demo里的图数据。
+
+![快速上手-验证结果](../../../images/browser/quickstart-result.png)
+
+更多快速上手文档请浏览[快速上手文档](../3.quick-start/1.preparation.md)
+
+### 2.4.图项目
+
+`图项目`提供可视化的图项目管理和图数据研发功能，它为用户提供了一系列便捷的图数据可视化操作，包括图项目的创建、修改、删除等管理操作，以及图数据的查询、点边统计等操作。此外，它也支持图模型的管理，使用户可以更加方便地进行图数据的管理和维护。
+
+#### 2.4.1.图项目管理
+
+在`图项目`界面，可以看到当前图数据库中的图项目。
+
+![图项目-首页](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.新建图项目
+
+在`图项目`界面，点击`新建图项目`按钮创建一个新的图项目。
+
+![图项目-新建图项目按钮](../../../images/browser/graphmanagement-creategraph.png)
+
+新建图项目需要通过`选择模板`和`填写配置`两个页面完成图项目的创建。
+
+- __选择模板__：产品提供空模板和demo模板两类模板。
+    - 空模板：全新的图项目，用户需要自己创建图模型和导入图数据，一般用于正式项目开发。
+    - demo模板：产品内置的demo数据，图项目创建成功后，系统会自动创建demo图模型并导入demo图数据，一般用于试用和学习。
+
+![图项目-选择模板](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __填写配置__：用户需要填写图项目基本信息，并点击`创建`按钮创建图项目。
+    - 图名称：新建图项目的名称，同时作为该图项目的唯一主键。支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+    - 图描述：新建图项目的描述，可用于详细说明该项目的背景和目标。
+    - 高级配置-最大存储空间：设置图项目最大可占用的存储空间，实际并不会提前占用物理存储空间，实际数据量达到最大存储空间阈值后不可再写入数据。
+
+![图项目-填写配置](../../../images/browser/graphmanagement-configure.png)
+
+创建成功后，可在`图项目`页面的图项目选项卡中查看。
+
+##### 2.4.1.2.编辑图项目
+
+在`图项目`界面，点击图项目选项卡中的`编辑`按钮（笔形图标），编辑对应图项目的基础信息。
+
+![图项目-编辑图项目按钮](../../../images/browser/graphmanagement-editgraph-button.png)
+
+编辑图项目功能可以修改`图名称`和`图描述`。
+
+![图项目-编辑图项目](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.删除图项目
+
+在`图项目`界面，点击图项目选项卡中的`删除`按钮（垃圾桶图标），删除对应的图项目。
+
+![图项目-删除图项目按钮](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_需要注意：图项目删除后无法恢复_。
+
+##### 2.4.1.4.点边统计
+
+在`图项目`界面，点击图项目选项卡中的`点边统计`按钮（折线图标或刷新图标），统计对应图项目的点边数量。
+
+![图项目-点边统计按钮](../../../images/browser/graphmanagement-statistics-button.png)
+
+统计结果将展示展示图项目选项卡上，未进行过点边统计的图项目会显示`暂无点边数据`，已经统计过点边数据的图项目再次统计需要点击`刷新`按钮。
+
+![图项目-点边统计](../../../images/browser/graphmanagement-statistics.png)
+
+![图项目-刷新点边统计按钮](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.图构建
+
+Browser的`图构建`功能主要用于图项目的模型定义和数据导入。在`图项目`页面中，点击图项目选项卡中的`图构建`按钮。
+
+![图构建-按钮](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.模型定义
+
+Browser提供可视化的方式创建和维护图模型。
+
+- 也可用通过`cypher`工具和`lgraph_import`工具创建和维护图模型，详见[Cypher API](../5.developer-manual/6.interface/1.query/1.cypher.md)和[数据导入](../5.developer-manual/3.server-tools/1.data-import.md)文档。
+
+###### a.浏览图模型
+
+在`模型定义`界面可以查看详细的图模型设置，支持列表和画布方式查看图模型，支持列表展示点类型的属性和索引、边类型的属性和起点/终点类型。
+
+![图构建-浏览图模型](../../../images/browser/graphbuild.png)
+
+- 支持列表查看点类型和边类型。
+    - 支持点类型和边类型的个数展示，在点类型或边类型页签中展示对应的点或边数量。
+    - 支持点类型和边类型的名称关键字搜索，在`搜索框`输入关键字可展示对应的点或边。
+
+        ![图构建-浏览图模型-搜索](../../../images/browser/graphbuild-list-search.png)
+    - 支持点类型和边类型的名称复制，点击`复制`按钮可以复制点或边的名称至粘贴板。
+
+        ![图构建-浏览图模型-复制](../../../images/browser/graphbuild-list-copy.png)
+    - 支持点类型和边类型的删除，点击`删除`按钮可以删除对应的点或边。
+
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-list-delete.png)
+- 支持画布方式查看点类型和边类型。
+- 在列表或画布中点击相应的点类型或边类型，可以展示模型详情。
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-select.png)
+
+###### b.添加点
+
+在`模型定义`界面点击`添加点`按钮，在右侧滑动窗口中添加点类型。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex-button.png)
+
+用户需要输入点类型名称、属性和索引，点击`完成`按钮完成点类型的创建。
+- 点类型名称：点的名称，也是该点的唯一标识。
+- 属性：点的属性，需要一个属性作为主键。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建点时可以任意删除属性。
+- 索引：点的索引属性，需要先创建属性再设置该属性为索引，索引创建成功后无法修改。
+    - 属性：需要配置索引的属性。
+    - 唯一：设置该属性字段为唯一值。
+    - 主键：对应属性是否为主键，选择`是`后`唯一`选项必须为`是`。
+    - 删除：在创建点时可以任意删除索引。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex.png)
+
+- 编辑点：可以增加点的属性和修改已有属性的数据类型，新增或删除索引。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+_注：主键字段的属性创建后无修改_
+
+![图构建-编辑点](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.添加边
+
+在`模型定义`界面点击`添加边`按钮，在右侧滑动窗口中添加边类型。
+
+![图构建-添加边按钮](../../../images/browser/graphbuild-addedge-button.png)
+
+用户需要输入边类型名称、属性、选择起点类型和终点类型，点击`完成`按钮完成边类型的创建。
+- 边类型名称：边的名称，也是该边的唯一标识。
+- 属性：边的属性，边上可以没有属性。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建边时可以任意删除属性。
+- 选择起点类型和终点类型：设置边的起点点类型和终点点类型，支持多个起点类型和终点类型。
+    - 起点：选择起点的点类型。
+    - 终点：选择终点的点类型。
+    - 需要提前创建至少一个点类型才能设置边的起点类型和终点。
+    - 如果不选择则表示起点和终点可以为任意点类型，同时画布上不展示对应的边，需要在左侧列表查看边类型。
+
+![图构建-添加边](../../../images/browser/graphbuild-addedge.png)
+
+- 编辑边：可以增加边的属性和修改已有属性的数据类型。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+
+![图构建-编辑边](../../../images/browser/graphbuild-editedge.png)
+
+###### d.导入模型
+
+在`模型定义`界面点击`导入模型`按钮，可以上传模型文件快速创建模型。
+
+![图构建-导入模型按钮](../../../images/browser/graphbuild-importmodel-button.png)
+
+在`导入模型`界面点击`上传文件`按钮，上传模型文件成功后，点击确定可以导入图模型。
+
+- 覆盖当前画布中的模型：选中该选项，导入时会先清空已有图模型再导入模型文件中的图模型；不选择，会导入模型文件中新增的点类型和边类型，但不会修改已有的点类型和边类型。
+
+![图构建-导入模型](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.导出模型
+
+在`模型定义`界面点击`导出模型`按钮，可以将当前图项目中的图模型导出成json文件。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel-button.png)
+
+模型文件为json格式，不建议手动修改。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.数据导入
+
+完成`模型定义`之后，点击`下一步`按钮进入数据导入页面。
+
+###### a.数据准备
+
+在数据导入前需要提前准备数据，当前Browser支持CSV文件的上传，需要保证数据文件后缀为csv。
+- 不强制要求包含表头。
+- 支持文本限定符，文本限定符为双引号。
+
+![数据导入-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.上传文件
+
+在`数据导入`页面上传需要导入的数据文件，将数据导入到图项目中。
+
+![数据导入-上传文件](../../../images/browser/graphbuild-import.png)
+
+- 分隔符：数据文件的列分隔符。
+- 文件上传：支持上传多个文件。
+    - 支持弹窗中选择多个上传文件。
+    - 支持将文件拖拽至页面中上传。
+    - 支持同时上传点文件和边文件。
+
+###### c.数据映射
+
+文件上传成功后，需要在`数据导入`页面设置`数据对应表`，将数据文件中的数据列和目标点/边、对应属性建立映射关系。
+
+- 数据对应表：展示已经上传的数据问题。
+    - 文件名称：上传的数据文件名称。
+    - 文件大小：上传的数据文件大小。
+    - 读取结果：数据文件上传结果，success为读取成功。
+    - 删除：在页面中删除，不会删除本地文件。
+- 数据文件映射：每个已上传的数据文件都需要配置映射关系。
+    - 标签：选择该文件对应的点或边类型，只能选择一类点或一类边。
+    - 从第N行，开始：从第N行开始读取数据，系统默认从第0行开始读取数据，如需跳过表头可输入1。
+    - 属性映射：下拉选择数据列对应的属性字段。
+    - 数据预览：系统会预读数据文件的前5行。
+
+![数据导入-数据映射](../../../images/browser/graphbuild-import-datamapping.png)
+
+文件上传成功后，可以点击`继续导入`按钮继续导入其他数据，或者点击`前往图查询`按钮在`图查询`页面查询已导入的数据。
+
+![数据导入-导入成功](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.图查询
+
+在`图项目`界面点击图项目选项卡中的`图查询`按钮，可以查询和访问图项目中的图数据，产品提供`语句查询`、`路径查询`、`点查询`等多种模式查询图数据，支持切换图项目和查询结果展示。
+
+![图查询-按钮](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.切换图项目
+
+`图查询`功能只能访问一个图项目数据，用户可以在`切换图项目`下拉框中选择并切换至其他图数据。
+
+![图查询-切换图项目](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.语句查询
+
+Browser提供可视化方式开发和调试图查询语句，用户可以输入图查询语句、执行并返回结果，支持收藏语句和查看图模型。
+
+![图查询-语句查询](../../../images/browser/query-view.png)
+
+###### a.语句查询窗口
+
+用户在`语句查询窗口`输入图查询语句，点击`执行`按钮可以运行对应语句，并在`执行结果页签`展示结果。
+
+- 切换查询语言：提供不同图查询语言模式的切换。_当前只支持Cypher语法_
+
+![图查询-切换语言](../../../images/browser/query-selectgql.png)
+
+- 语句查询窗口：提供当前查询语言的语法提示。
+
+![图查询-语法提示](../../../images/browser/query-gqltips.png)
+
+- 执行：点击`执行`按钮，发送输入的查询语句至后台运行。
+
+![图查询-执行按钮](../../../images/browser/query-execute-button.png)
+
+- 收藏：点击`收藏`按钮，将当前语句查询窗口的内容保存成模板，以便下次使用。
+
+![图查询-收藏按钮](../../../images/browser/query-bookmark-button.png)
+
+- 下载：点击`下载`按钮，将当前语句查询窗口的内容保存成文本文件并下载至本地，以便下次使用。
+
+![图查询-下载按钮](../../../images/browser/query-download-button.png)
+
+详细Cypher使用指南请参考文档：[Cypher API](../5.developer-manual/6.interface/1.query/1.cypher.md)
+
+###### b.收藏列表
+
+以列表方式展示已经收藏的查询语句，点击列表中的收藏模板可以使用其中的语句。支持关键字搜索、名称修改以及删除。
+
+![图查询-语句收藏](../../../images/browser/query-bookmark.png)
+
+###### c.查看图模型
+
+Browser提供当前图项目中的图模型查询，方便用户查询有些点类型和边类型，支持列表展示和画布图谱展示方式，支持隐藏查看图模型窗口。
+
+![图查询-图模型列表](../../../images/browser/query-schema-list.png)
+![图查询-图模型图谱](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.路径查询
+
+Browser提供`路径查询`模板，用户可以通过选择路径的方式，查找图项目中的图数据是否存在相应的路径。
+
+![路径查询](../../../images/browser/pathquery-result.png)
+
+- 路径：在路径选择下拉框内选择需要查找的路径。
+    - 选择路径：根据图模型的定义，系统会自动匹配出对应的一度关系路径；再次点击路径下拉框会，系统会根据路径终点的点类型自动匹配下一度关系路径。
+![路径查询-选择路径](../../../images/browser/pathquery-select.png)
+    - 执行：点击`执行`按钮返回图项目中匹配的路径。
+    - 高级配置：设置扫描的路径数目，默认为100条路径。
+![路径查询-高级配置](../../../images/browser/pathquery-configuration.png)
+
+_注：需要图模型中的边设置起点和终点，如果图项目中的边均未设置起点和终点，下拉选项无结果_
+
+##### 2.4.3.4.点查询
+
+Browser提供`点查询`模板，用户可以通过选择点属性进行查询，查找图项目中的点数据。
+
+![点查询](../../../images/browser/vertexquery.png)
+
+- 选择点：选择需要查询的点类型。
+    - 属性：系统会自动匹配点类型的schema，设置相应的查询条件，点击执行按钮返回结果。
+- 返回节点数目：设置返回点数据的上限。
+
+![点查询-条件](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.执行结果页签
+
+Browser提供JSON视图、JSON文本、点边列表、点边视图等多种方式展示图查询结果，支持结果下载、插入数据、全屏展示。
+
+###### a.JSON视图
+
+Browser提供以JSON视图方式展示查询结果。
+
+![JSON视图](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON文本
+
+![JSON文本](../../../images/browser/query-result-jsontxt.png)
+
+###### c.点边列表
+
+Browser提供以点和边列表方式展示查询结果。
+
+![点边列表](../../../images/browser/query-result-list.png)
+
+###### d.点边视图
+
+Browser提供以画布方式展示查询结果。
+
+![点边视图](../../../images/browser/query-result-graph.png)
+
+###### e.插入数据
+
+Browser提供可视化方式在对应图项目中插入点或边数据。点击`插入数据`按钮，在`插入数据`页签选择点类型或边类型，输入属性值，点击确定完成数据插入。
+
+![插入数据-按钮](../../../images/browser/query-result-insert-button.png)
+
+![插入数据](../../../images/browser/query-result-insert.png)
+
+###### f.下载执行结果
+
+Browser提供图查询结果导出成文本文件功能。点击`下载执行结果`按钮，系统会自动将结果保存成文本文件并下载至本地。
+
+![下载执行结果-按钮](../../../images/browser/query-result-download.png)
+![下载执行结果-按钮](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.全屏展示
+
+Browser提供全屏方式展示图查询结果，点击`全屏显示`按钮全屏展示结果，点击`退出全屏`按钮退出全屏展示。
+
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-button.png)
+![全屏展示](../../../images/browser/query-result-fullscreen.png)
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.图分析
+
+在`图项目`界面点击图项目选项卡中的`图分析`按钮，可以在画布中展示和分析图数据，产品提供`语句查询`和`配置查询`将图项目中的数据查询并加载至画布，支持画布数据的筛选、布局样式调整以及画布操作。
+
+![图分析-按钮](../../../images/browser/graphanalysis-button.png)
+
+如下图所示，图分析功能主要包括：1、操作栏：图分析主要操作功能，包括视图切换、查询过滤、布局样式以及画布操作；2、左边栏：查询、筛选、外观功能操作区域；3、画布区域：展示图数据的区域，展示点和边数据，支持点扩展查询、收起节点、固定节点、删除节点，提供画布图数据统计等功能；4：右边栏：选中一个点数据或边数据后，会展示对应的属性信息；5、切换图项目：切换不同的图项目进行分析。
+
+![图分析-操作区域](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.语句查询
+
+在`语句查询`功能中，用户可以输入查询语句来查询图数据，并加载数据至画布区域进行展示。
+- 语法说明：TuGraph的查询语言及语法说明文档。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-语句查询](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.模板查询
+
+在`模板查询`功能中，用户可以选择节点类型和输入属性条件来查询图数据，并加载数据至画布区域进行展示。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-模板查询](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.画布分析
+
+在`画布分析`功能中，用户可以对画布中的节点或边数据进行操作和分析，主要包括：选中节点进行扩展查询、收起/展开节点、固定节点，清空画布，套索，点/边检索，画布图例等。画布上的最基础操作是拖拽点数据，鼠标左键选住一个节点并移动鼠标，可以完成点数据位置的移动。
+
+###### a.扩展查询
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，鼠标移至`扩展查询`处弹出二级悬窗，点击对应的扩展度数进行查询。
+- 一度查询：双向扩展一度关系。
+- 二度查询：双向扩展二度关系。
+- 三度查询：双向扩展三度关系。
+- 自定义查询：根据选择的条件进行扩展。
+    -边的方向：设置扩展关系的方向，双向：包含出边和入边，出边：选中起点向外指向的边，入边：指向选中起点的边。
+    -扩散度数：扩展的度数。
+    -自定义返回节点数量：配置返回至前端的节点数量，默认为100，防止遇到超级节点导致前端异常的情况。
+    -添加筛选组：设置扩展的关系类型和关系的属性条件，可以设置多组关系类型。
+
+![图分析-画布分析-扩展查询-按钮](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![图分析-画布分析-扩展查询-查询后](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![图分析-画布分析-扩展查询-自定义查询](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.收起/展开节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`收起节点`会隐藏所选节点的一度关系节点；再次右键已`收起节点`的点数据可以进行`展开节点`操作，展示已隐藏的一度关系节点。
+
+![图分析-画布分析-收起节点](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![图分析-画布分析-展开节点](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.固定节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`固定节点`会将所选节点固定在原处，固定后的节点不可移动（包括重新布局）；再次右键已`固定节点`的点数据可以进行`解除固定`操作，恢复所选节点的正常操作。
+
+![图分析-画布分析-固定节点](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![图分析-画布分析-解除固定](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.删除节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`删除节点`会将所选节点移出画布。
+
+![图分析-画布分析-删除节点](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.清空画布
+
+在`操作栏`区域点击`清空画布`按钮，会清除所有画布中的数据。
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.点/边检索
+
+在`点/边检索`窗口选择点或边，并输入关键字，会模糊检索画布中的属性数据，检索后可定位至数据位置。
+
+![图分析-画布分析-检索](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.画布图例
+
+在`画布`区域的图例位置，会展示画布中的点类型，点击点类型可以选中对应的点数据，点击更多按钮可以展示统计情况，支持列表或图表方式展示点或边的数量。
+
+![图分析-画布分析-列表](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![图分析-画布分析-图表](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.属性筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`属性筛选`进行筛选过滤。用户可以选择要筛选的点或边类型，以及对应的属性值进行设置，检索到筛选组条件的数据后会在画布上高亮选中对应的点或边数据。
+- 请选择点/边类型：选择需要检索的点类型或边类型。
+- 属性条件：设置需要检索的属性条件，可以设置多组，取并集筛选结果。
+- 添加筛选组：可以多组筛选条件，取并集筛选结果。
+- 重置：可以清空筛选条件。
+
+![图分析-筛选-属性筛选](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.统计筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`统计筛选`进行画布数据统计。用户可以选择要统计的点或边类型，以及对应的属性值进行设置，系统会自动根据用户选择的点/边类型和属性进行分组统计，支持按照图表和列表两种方式展示结果，同时点击图表或列表区域的数值可以高亮选中画布中的数据。
+
+![图分析-筛选-统计筛选](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![图分析-统计筛选-图表切换](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.布局样式
+
+在`操作栏`区域点击`布局`按钮，选择对应的布局方式会将画布中的数据进行重新排布，支持力导向布局、同心圆布局、圆形布局、辐射布局、Dagre布局以及网格布局，每种布局方式均有不同布局参数，调整参数后画布中的数据会进行重新排布。
+
+![图分析-布局样式-按钮](../../../images/browser/graphanalysis-style-layout-button.png)
+![图分析-布局样式-布局参数](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+详细布局参数可参考[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide)。
+
+##### 2.4.4.6.外观样式
+
+在`操作栏`区域点击`外观`按钮，在`左边栏`点击`点样式`或`边样式`进行外观样式配置。
+- 点样式
+    - 应用点类型：设置对应点类型的展示样式，支持同时配置多个点类型外观。
+    - 大小：对应点类型的展示大小。
+    - 颜色：对应点类型的展示颜色。
+    - 图标：对应点类型的图标样式。
+    - 显示文本：对应点类型显示的文本内容，默认为id。
+    - 高级配置：根据设置的条件标记对应的点数据。
+- 边样式
+    - 应用边类型：设置对应边类型的展示样式，支持同时配置多个边类型外观。
+    - 颜色：对应点类型的展示颜色。
+    - 边宽：对应边类型的展示宽度。
+    - 显示文本：对应边类型显示的文本内容，默认不显示。
+    - 高级配置：根据设置的条件按颜色展示对应的边数据。
+
+![图分析-外观](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.控制台
+
+`控制台`提供可视化的的账户管理和数据库信息查看功能，它为用户提供了全面的账户和角色管理功能，包括账户的增删改查以及禁用，角色的增删改查以及禁用。此外，它也为用户提供了便捷的数据库信息查看功能，让用户可以轻松地查看图数据库的基础信息和配置信息。其中，基础信息主要包括版本号、运行时间、CPP编译版本号等，而数据库配置信息则包括端口号、系统功能参数配置等。
+
+#### 2.5.1.账户管理
+
+##### 2.5.1.1.账户管理
+
+###### a.添加账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户需要输入账户名称、账户描述、账户密码以及相关角色。
+
+![账户管理-添加账户按钮](../../../images/browser/account-add-button.png)
+
+- 账户名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 相关角色：新建账户时必须要选择一个角色，在账户添加成功后，系统会自动生成一个与账户名称一样的角色。
+
+![账户管理-添加账户](../../../images/browser/account-add.png)
+
+###### b.编辑账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户可以编辑账户描述、账户密码以及相关角色。
+
+![账户管理-编辑账户](../../../images/browser/account-edit.png)
+
+###### c.禁用账户
+
+在`账户管理`界面点击`禁用`按钮禁止对应的账户登录和访问，点击`启用`按钮开启对应的账户登录和访问权限。
+
+![账户管理-禁用](../../../images/browser/account-disable.png)
+![账户管理-启用](../../../images/browser/account-enable.png)
+
+###### d.删除账户
+
+在`账户管理`界面点击`删除`按钮删除对应的账户。
+
+![账户管理-删除](../../../images/browser/account-delete.png)
+
+##### 2.5.1.2.角色管理
+
+###### a.添加角色
+
+在`角色管理`界面点击`添加`按钮创建新的角色，用户需要输入角色名称、角色描述以及图权限。
+
+![角色管理-添加角色按钮](../../../images/browser/role-add-button.png)
+
+- 角色名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 图权限：browser支持全部、读、写和无共四类图权限配置。
+    - 全部：对应图的读和写权限，包含编辑图模型权限（schema）。
+    - 读写：对应图的写权限，不包含编辑图模型权限（schema）。
+    - 只读：对应图的读权限。
+    - 无：无法访问和操作对应图。
+- 角色冲突：当两个角色对同一个图有不同图权限，同时对一个账户授权了这两个角色，该账户对该图的图权限为两个角色的并集。
+
+![角色管理-添加角色](../../../images/browser/role-add.png)
+
+###### b.编辑角色
+
+在`角色管理`界面点击`编辑`按钮编辑已有角色，用户可以编辑角色描述以及图权限。
+
+![角色管理-编辑角色](../../../images/browser/role-edit.png)
+
+###### c.禁用角色
+
+在`角色管理`界面点击`禁用`按钮禁止对应的角色，点击`启用`按钮开启对应的角色。禁用角色后，对应角色图访问权限失效。
+
+- 禁用角色：禁用之后，对应角色图访问权限失效。
+    - 当一个用户拥有两个角色对同一个图有操作权限时，当禁用其中一个角色时，另一个角色权限同样有效。
+
+![角色管理-禁用](../../../images/browser/role-disable.png)
+![角色管理-启用](../../../images/browser/role-enable.png)
+
+###### d.删除角色
+
+在`角色管理`界面点击`删除`按钮删除对应的角色。
+
+![角色管理-删除](../../../images/browser/role-delete.png)
+
+#### 2.5.2.数据库信息
+
+##### 2.5.2.1.基础信息
+
+`基础信息`获取当前系统运行的状态，并展示关键信息。
+
+![数据库信息-基础信息](../../../images/browser/db_basic.png)
+
+|参数    |含义    |
+|-------|--------|
+|TuGraph版本号|当前TuGraph的版本号，x.x.x|
+|运行时间|TuGraph服务启动到现在的时间|
+|服务器代码版本|tugraph-db仓库的当前commit|
+|前端代码版本|tugraph-web仓库的当前commit|
+|CPP编译器版本号|编译TuGraph时的CPP版本号|
+|Python版本号|编译TuGraph时的Python版本号|
+|CPP编译器ID|编译TuGraph时的CPP类型|
+
+也可以通过命令获取当前系统运行状态。
+
+```
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.数据库配置信息
+
+`数据库配置信息`获取当前系统运行的配置参数，并展示关键信息。调整配置参数或了解详细配置参数请参考[数据库运行-服务配置](../5.developer-manual/2.running/2.tugraph-running.md)。
+
+![数据库信息-数据库配置信息](../../../images/browser/db_configuration.png)
+
+| 参数                          | 含义                                  |
+|-----------------------------|-------------------------------------|
+| bind_host                   | 系统启动时设置的host，一般为0.0.0.0             |
+| disable_auth                | 是否关闭token认证的定期更新，如为true则token可以永久使用 |
+| durable                     | 是否开启存储底层持久化，如为false，数据异步更新到磁盘       |
+| enable_audit_log            | 是否开启审计日志                            |
+| enable_backup_log           | 是否开启实时增量备份                          |
+| enable_fulltext_index       | 是否开启全文索引                            |
+| enable_ip_check             | 是否开启IP白名单                           |
+| enable_rpc                  | 是否开启RPC端口                           |
+| enable_ssl                  | 是否开启ssl加密传输                         |
+| optimistic_txn              | 是否开启乐观多线程写入事务                       |
+| port                        | 当前系统的REST访问端口                       |
+| rpc_port                    | RPC 及 HA 服务所用端口                     |
+| subprocess_max_idle_seconds | 自进程最大空闲时间，线程池参数                     |
+| thread_limit                | 服务端同时使用的最大线程数                       |
+| verbose                     | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。  |
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..2a422f569e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,167 @@
+# 可视化操作手册（旧版）
+
+> 此文档主要介绍 TuGraph Browser 的使用
+
+## 定义
+
+TuGraph Browser 是 TuGraph 提供的可视化开发工具。
+
+## 作用
+
+TuGraph Browser 的主要功能是为使用图数据库的开发人员，提供可视化的图数据开发，图数据管理和维护等功能。
+
+## 操作详情
+
+### 1.连接数据库
+
+当用户完成图数据库的安装后，可以通过浏览器进行访问，TuGraph Browser 工具。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7090。
+
+### 2.登录数据库
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- 页面打开成功会，首先进图的是登录页面，用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 3.工作台
+
+#### 3.1 快速上手
+
+- 首次登录，系统会默认创建 default 空图
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- 用户点击帮助选项，并选择快速上手
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- 然后点击“一键创建模型”——>"一键创建数据"，就可以完成内置的 Movie 数据图谱的构建
+
+#### 3.2 创建子图和示例
+
+##### 3.2.1 创建子图
+
+- 点击新建子图
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- 填写表单信息
+  ![alt 填写表单](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+  - 子图名称
+  - 子图描述
+  - 配置信息
+  - 点击确认，提示创建成功
+- 切换子图
+  ![alt 切换子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- 点击新建示例
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- 选择示例并点击创建
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 查询
+
+![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 页面组成
+
+- cypher 输入框
+- 结果集展示区域
+
+##### 3.3.2 结果集展示区域功能详情
+
+- 结果集标签展示及功能
+  ![alt 结果集标签](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+  - 这里展示了结果集的所有类型统计
+  - 点击不同的“label（标签）”，可以进行以下修改操作
+    - 修改展示颜色
+    - 修改节点大小或边的粗细
+    - 修改默认展示属性或系统属性
+    - 布局修改
+      - 力导布局
+      - 网格布局
+      - 树形布局
+      - 环境布局
+    - 边聚合
+      - 相同类型，方向的边可以进行合并
+    - 创建节点
+      - 点击创建节点按钮
+      - 选择节点类型
+      - 添写节点内容
+    - 创建关系
+      - 在画布中选择起点和终点
+      - 选择可以匹配的类型
+      - 填写节点信息
+    - 停止布局
+      - 当数据量过大，导致浏览器页面卡顿时候，可以点击这个停止布局的按钮，能够提高体验的流畅度
+    - 鼠标悬停
+      - 开启此功能，可以高亮显示鼠标悬停节点的一度邻居节点
+    - 结果集导出
+      - 可以将结果集导出为 png，json，csv 三种不同的文件形式
+    - 刷新
+      - 点击刷新按钮，会重新执行当前页面的初始 cypher 语句，并刷新结果集
+    - 最大化
+      - 点击最大化，结果集展示区域将全屏展示
+    - 结果集展示形式切换
+      - 支持图谱、表格、文本三种形式
+
+##### 3.3.3 建模
+
+- 点边模型
+  ![alt 建模](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- 点边模型支持实时的、增、删、改、查
+
+- 点边模型支持导入和导出
+
+##### 3.3.4 数据导入
+
+- 本地数据导入
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+  - 选择文件编码格式
+  - 选择本地 CSV 文件
+  - 选择对应的节点或边的模型
+  - 进行数据映射
+  - 完成数据导入
+
+##### 3.3.5 插件
+
+- 存储过程的使用
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+  - 用户可以上传本地编写的 Plugin 程序，并在可视化页面进行执行，并查看执行结果
+  - 用户可以在可视化对插件进行、卸载、执行、下载等操作
+
+##### 3.3.6 帮助
+
+- 其中记录了 TuGraph-browser 的使用方式
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 控制台
+
+##### 3.4.1 数据库基础信息
+
+- 展示数据库相关的基础配置信息
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 权限管理
+
+- 用来创建用户和角色的功能模块，用户可以在这里进行权限的管理操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 实时状态
+
+- 这里展示了数据库实时状态，包括：CPU 使用率、内存用率、磁盘使用率、数据请求次数、磁盘 IO
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 任务管理
+
+- 在这里用户可以看到在正在执行中的任务，可以在此进行停止任务的操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 审计日志
+
+- 这里记录的数据库相关的审计日志，用来排查使用遇到的问题
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..811fbf0563
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+可视化操作指南
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/1.environment.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/1.environment.md
new file mode 100644
index 0000000000..e2524b4134
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/1.environment.md
@@ -0,0 +1,40 @@
+# 环境准备
+
+> 此文档主要介绍 TuGraph 部署时所需的软硬件环境。
+
+## 1.硬件环境
+
+### 1.1. CPU
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的硬件平台，测试认证过的硬件平台包括 Intel、AMD、Kunpeng、Hygon、飞腾等。
+
+### 1.2. 内存
+
+我们建议内存容量不小于实际的数据大小。如果最求极致的性能，把所有的数据缓存到内存里是最理想的。在数据访问的局部性上，图数据库的局部性要比关系型数据库差，因此如果数据在内存中放不下，通常会频繁地换入换出。
+
+### 1.3. 外存
+我们强烈建议用户使用 NVMe SSD 作为外存，数据库有大量的写操作需要同步的外存，通常为随机写，外存的读写性能很容易成为整体数据库运行的性能瓶颈。因此，高IOPS、低延迟的 NVMe SSD 是最优的选择。
+
+如果现实条件只能使用 SATA接口的SSD，或者云上的网盘，性能虽然会受到影响，但 TuGraph 依然能正确的运行。
+
+外存大小建议为实际数据大小的4倍，比如数据为1TB，则准备4TB的硬盘会比较稳妥。
+
+## 2.软件环境
+
+### 2.1. 操作系统
+
+TuGraph 能够兼容主流操作系统，包括Ubuntu、CentOS、SUSE、银河麒麟、 中标麒麟、UOS等，均通过测试认证。
+
+其中最稳定使用的系统版本是 Ubuntu 18.04、CentOS 7、CentOS 8。
+
+### 2.2. 系统库
+
+编译环境和运行环境对系统库的要求不一样，具体请参考[环境分类](2.environment-mode.md)。
+
+## 3.典型配置推荐
+
+| 硬件      | 最低配置   | 建议配置                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| 内存      | 4GB       | 512GB                    |
+| 外存      | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md
new file mode 100644
index 0000000000..3dbbe91ee5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/2.environment-mode.md
@@ -0,0 +1,22 @@
+# 环境分类
+
+> 此文档主要介绍 TuGraph 涉及的三种环境。
+
+## 1.分类
+
+根据环境所承载功能的不同，区分为编译环境，运行环境，以及精简运行环境。
+* 编译环境，具备TuGraph编译的所有依赖库，包含运行环境的所有依赖，并且能够编译TuGraph源码，但不包含预编译好的TuGraph可执行文件和库文件，供开发者编译源码使用。
+* 运行环境，具备GCC/Java/Python环境，能够运行TuGraph的所有功能，并且能承载全文索引，java client，c++源码上传为plugin，以及python plugin的完整功能，内置TuGraph预编译好的可执行文件和库文件，供客户直接安装使用，无需编译源码。
+* 精简运行环境，约等于裸系统加预编译TuGraph，仅能运行TuGraph的基本功能，无C++ plugin编译运行，仅so上传，无全文索引，无python plugin，供快速搭建试用。
+
+TuGraph编译后，会把所有的依赖库以.a的形式打包在一起，因此原则上运行不需要的其他的依赖库。但TuGraph支持存储过程，即在服务端编译C++代码，因此在环境中依然需要涉及的编译器。
+
+## 2.依赖系统库
+
+针对三种环境，除去TuGraph的运行包，所需要的系统库如下：
+* 编译环境，包括gcc、python、java等编译器，也包含antlr4、pybind11等，具体参见tugraph-db源码目录 ci/images/tugraph-compile-*-Dockerfile。
+* 运行环境，主要由存储过程引入，包括gcc、boost、cmake等，具体参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile。
+* 精简运行环境，无，可以参见tugraph-db源码目录 ci/images/ tugraph-mini-runtime-*-Dockerfile。
+
+
+
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md
new file mode 100644
index 0000000000..f46964b1ed
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/3.docker-deployment.md
@@ -0,0 +1,101 @@
+# Docker部署
+
+>本文档介绍TuGraph Compile及TuGraph Runtime的Docker镜像的创建、下载。
+
+## 1.简介
+
+- TuGraph Compile Image：提供编译环境，可以用于TuGraph的编译，测试；
+- TuGraph Runtime Image：提供二进制可运行环境，附带TuGraph库和可执行文件；
+- TuGraph Mini Runtime Image: 提供二进制可运行环境，不包含TuGraph中Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+## 2.现有Docker Image
+
+### 2.1.镜像下载方式
+
+镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用。
+
+最新版本的Docker地址参见 [链接](../../1.guide.md#TuGraph最新版本)。
+
+### 2.2.命名规范
+
+#### 2.2.1.TuGraph Compile Image
+
+提供编译环境，可以用于TuGraph的编译。
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+例如： `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+提供二进制可运行环境，附带TuGraph库和可执行文件。
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如：`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+提供二进制可运行环境，不包含TuGraph种Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如： `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.常见Docker操作
+
+Docker由Dockerfile生成，注意创建镜像需要下载依赖，因此网络问题可能会导致创建较慢或者创建失败。注意不要覆盖镜像，除非tag为 `latest`。
+
+创建Compile镜像
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+创建Runtime / Mini Runtine镜像
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+修改镜像名称
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+上传镜像
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+获取镜像
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+导出镜像
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+导入镜像
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+其他Docker操作请参考[docker官方文档](https://docs.docker.com/engine/reference/commandline/cli )
+
+
+### 2.4. M1芯片支持
+
+在 M1 芯片的机器上运行 amd64 容器可能造成未知错误。TuGraph提供 arm64 的镜像供 M1 机器使用。
+包含compile和runtime两种镜像。
+
+在`tugraph-runtime-centos7:3.6.0`与`tugraph-compile-centos7:1.2.7`及之后，`tugraph-runtime-centos7`与`tugraph-compile-centos7`提供linux/amd64和linux/arm64/v8两种架构的镜像，可以在 M1 机器上通过docker pull获取arm64架构镜像。
+
+## 3. 使用和开发TuGraph-DB Docker镜像时的最佳实践
+
+在您刚开始为TuGraph做出贡献时，请仔细阅读以下要点，并遵循它们。
+
+- 为了避免过多的Docker Layer，请尽量像现有的Dockerfile一样单行的写ENV和RUN将您的依赖项添加到Docker中。
+- 对于您需要构建依赖项的软件包/资源，请使用原始的软件包/资源，而不是在没有VCS跟踪的情况下修改这些资源。之后联系TuGraph团队将其上传到OSS以加速构建过程，如同您在Dockerfiles中看到的URL一样。
+- 为了使开发更加高效，最好从Base TuGraph编译镜像添加依赖项开始，完成开发确认依赖没问题后在Dockerfile中重新复制该过程。
+- CI使用了Docker镜像。如果您的CI失败，请检查依赖项问题。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md
new file mode 100644
index 0000000000..ef49670ad5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# 本地包部署
+
+> 此文档主要介绍 TuGraph 的本地包部署。
+
+## 1. 环境准备
+
+TuGraph本地包部署需要对应的环境，快速验证可以使用精简安装包，几乎不需要任何第三方库。
+
+如果您需要使用完整的TuGraph功能，请参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile，该脚本包含完整的环境构建流程。
+
+## 2. 安装包下载
+
+最新版本的安装包地址参见 [链接](../../1.guide.md/#TuGraph最新版本)。
+
+也可以访问Github进行下载：[TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. CentOS 下的安装方法
+
+用于在 CentOS 上安装的 TuGraph 的.rpm 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.rpm 安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+用户也可以通过指定`--prefix`选项指定安装目录。
+
+## 4. Ubuntu 下的安装方法
+
+用于在 Ubuntu 上安装的 TuGraph 的.deb 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.deb`安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+该命令默认将 TuGraph 安装于`/usr/local`目录下。用户也可以通过指定 `--instdir=<directory>` 选项更改安装目录。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md
new file mode 100644
index 0000000000..9d4184acdf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/5.cloud-deployment.md
@@ -0,0 +1,125 @@
+# 云部署
+
+> 此文档主要介绍 TuGraph 的云部署，也可参见[阿里云计算巢部署文档]( https://aliyun-computenest.github.io/quickstart-tugraph/ )。
+
+## 1.简介
+
+TuGraph（tugraph.antgroup.com）是蚂蚁集团研发的高性能图数据库（Graph Database）。TuGraph在计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。本文向您介绍如何开通计算巢上的TuGraph社区版服务，以及部署流程和使用说明。
+
+## 2.实例说明
+
+TuGraph部署的为社区开源版本，源码参考Github Repo，目前可以选择的实例规格如下：
+
+| 规格族         | vCPU与内存                 | 系统盘              | 公网带宽      |
+|----------------|-------------------------|-------------------|-----------|
+| ecs.r7a.xlarge | AMD 内存型 r7a，4vCPU 32GiB | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+| ecs.r6.xlarge  | 内存型r6，4vCPU 32GiB       | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+
+预估费用在创建实例时可实时看到（目前为免费）。 如需更多规格、其他服务（如集群高可用性要求、企业级支持服务等），请联系我们 tugraph@service.alipay.com。
+
+## 3.部署流程
+
+### 3.1.准备工作
+
+在正式开始使用前，您需要一个阿里云账号，对ECS、VPC等资源进行访问和创建操作。
+
+- 若您使用个人账号，可以直接创建服务实例
+- 若您使用RAM用户创建服务实例，且是第一次使用阿里云计算巢
+    - 需要在创建服务实例前，对使用的RAM用户的账号添加相应资源的权限。添加RAM权限的详细操作，请参见为 __RAM用户授权__。所需权限如下表所示。
+    - 且需要授权创建关联角色，参考下图，选中 __同意授权并创建关联角色__
+
+| 权限策略名称                    | 备注                                    |
+|---------------------------------|---------------------------------------|
+| AliyunECSFullAccess             | 管理云服务器服务（ECS）的权限             |
+| AliyunVPCFullAccess             | 管理专有网络（VPC）的权限                 |
+| AliyunROSFullAccess             | 管理资源编排服务（ROS）的权限             |
+| AliyunComputeNestUserFullAccess | 管理计算巢服务（ComputeNest）的用户侧权限 |
+| AliyunCloudMonitorFullAccess    | 管理云监控（CloudMonitor）的权限          |
+
+![同意授权并创建关联角色](../../../../images/cloud-deployment-1.png)
+
+### 3.2.部署入口
+
+您可以在阿里云计算巢自行搜索，也可以通过下述部署链接快速到达。
+
+[部署链接](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.申请试用
+
+在正式试用前，需要申请试用，按照提示填写信息，在审核通过后就可以创建TuGraph服务。
+
+![申请试用](../../../../images/cloud-deployment-2.png)
+
+### 3.4.创建TuGraph服务
+
+#### 3.4.1.参数列表
+
+您在创建服务实例的过程中，需要配置服务实例信息的参数列表，具体如下。
+
+| 参数组               | 参数项   | 示例          | 说明                                                           |
+|--------------------|----------|---------------|--------------------------------------------------------------|
+| 服务实例名称         | N/A      | test          | 实例的名称                                                     |
+| 地域                 | N/A      | 华东1（杭州）   | 选中服务实例的地域，建议就近选中，以获取更好的网络延时。          |
+| 付费类型配置         | 付费类型 | 按量付费      | 免费使用请选用按量付费                                         |
+| 可用区配置           | 部署区域 | 可用区I       | 地域下的不同可用区域，确保实例非空                              |
+| 选择已有基础资源配置 | VPC ID   | vpc-xxx       | 按实际情况，选择专有网络的ID。                                   |
+| 选择已有基础资源配置 | 交换机ID | vsw-xxx       | 按实际情况，选择交换机ID。若找不到交换机, 可尝试切换地域和可用区 |
+| ECS实例配置          | 实例类型 | ecs.r6.xlarge | 当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格                      |
+|ECS实例配置|	实例密码|	**|	设置实例密码。长度8~30个字符，必须包含三项（大写字母、小写字母、数字、 ()`~!@#$%^&*_-+={}[]:;'<>,.?/ 中的特殊符号）。|
+
+#### 3.4.2.具体步骤
+
+创建服务按如下步骤进行，参考下图：
+
+- 创建实例名称，如下图中“test”
+- 选择地域，如下图中“华东1（杭州）”
+
+![创建实例](../../../../images/cloud-deployment-3.png)
+
+- 选择实例类型，当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格。如果列表中无机型可选，请尝试选择其他的部署区域
+- 选中机型
+- 配置实例的密码
+- 选择部署区域，如下图中“可用区I”
+
+![选择区域](../../../../images/cloud-deployment-4.png)
+
+- 点击下一步，进入订单确认页面
+- 勾选“权限确认”和“服务条款”中的复选框
+- 点击左下角绿色背景的开始免费试用，即可创建服务实例
+
+![确认](../../../../images/cloud-deployment-5.png)
+
+### 3.5.启动TuGraph服务
+
+- 查看服务实例：服务实例创建成功后，部署时间大约需要2分钟。部署完成后，页面上可以看到对应的服务实例，如下图
+
+![查看实例](../../../../images/cloud-deployment-6.png)
+
+- 点击该服务实例访问TuGraph。进入到对应的服务实例后，可以在页面上获取到web、rpc、ssh共3种使用方式，并且页面上展示了admin用户的密码
+
+![访问方式](../../../../images/cloud-deployment-7.png)
+
+- 点击web的链接，即可跳转访问已经部署好的TuGraph Web。建议新手先通过TuGraph Web，快速使用demo上手。
+    - 首先在TuGraph Web的登录页面上，输入默认用户名admin和页面上展示的admin用户的密码进行登录，参考下图
+    - 登录完成后，选择任意一个带有官方图标的图项目，其中内置了demo数据，开启图数据的探索和发现！
+
+![登录](../../../../images/cloud-deployment-8.png)
+![创建demo](../../../../images/cloud-deployment-9.png)
+
+## 4.常见FAQ
+
+### 问题一：部署区域无可用资源
+
+有时，所选部署区域（如可用区G）没有所选套餐的可用资源，会报错如下图所示
+
+![部署区域错误](../../../../images/cloud-deployment-10.png)
+
+__解决办法__：尝试选择其他区域，如可用区I等
+
+### 问题二: 启动后web访问不通
+
+web的启动需要一点点时间，请稍后刷新页面即可。
+
+### 问题三: 登录时的用户名密码不正确
+
+请注意检查，登录时使用的密码应为详情页面展示的密码。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/index.rst
new file mode 100644
index 0000000000..16187666e3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/1.installation/index.rst
@@ -0,0 +1,8 @@
+安装
+====
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/1.compile.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/1.compile.md
new file mode 100644
index 0000000000..e6970d8883
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/1.compile.md
@@ -0,0 +1,28 @@
+# 从源码编译
+
+> 本文档主要描述 TuGraph 从源码进行编译。
+
+## 1.前置条件
+
+推荐在linux系统下搭建TuGraph。同时docker环境是个不错的选择,如果你想设置一个新的环境，请参考[Dockerfile](../1.installation/3.docker-deployment.md)。
+
+## 2.编译介绍
+
+以下是编译TuGraph的步骤：
+
+1. 如果需要web接口运行`deps/build_deps.sh`，不需要web接口则运行`SKIP_WEB=1 deps/build_deps.sh`
+2. 根据容器系统信息执行`cmake .. -DOURSYSTEM=centos`或者`cmake .. -DOURSYSTEM=ubuntu`，如果需要shell运行lgraph_cypher，加上`-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`，如果在arm机器编译（如M1芯片的Mac中，需要加上` -DENABLE_BUILD_ON_AARCH64=ON`）
+3. `make`
+4. `make package` 或者 `cpack --config CPackConfig.cmake`
+
+示例：`tugraph/tugraph-compile-centos7`Docker环境
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md
new file mode 100644
index 0000000000..f06a045f3e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/2.tugraph-running.md
@@ -0,0 +1,196 @@
+# 数据库运行
+
+> 本文档主要描述 TuGraph 服务的运行模式、启动、停止和重启的操作,以及 TuGraph 的服务配置参数、配置文件格式和命令行配置参数。
+
+## 1.前置条件
+
+TuGraph 运行的前置条件为 TuGraph 正确安装，参考[安装流程](../1.installation/1.environment.md)。
+
+TuGraph 运行需要保证库文件 liblgraph.so 的文件位置在环境变量 LD_LIBRARY_PATH。
+
+运行 TuGraph 进程的用户不需要超级权限，但需要对配置文件（一般为lgraph.json）及文件中涉及的文件有读权限，并且对数据文件夹、日志文件夹等有写权限。
+
+## 2.运行模式
+
+TuGraph 可以作为前台普通进程启动，也可以作为后台守护进程启动。
+当作为普通进程运行时，TuGraph 可以直接将日志打印到终端，这在调试服务器配置时非常方便。但是，由于前台进程在终端退出后被终止，因此用户须确保在 TuGraph 服务器处于运行状态时，终端保持打开状态。另一方面，在守护进程模式下，即使启动它的终端退出，TuGraph 服务器也可以继续运行。因此，在长时间运行的服务器下推荐以守护进程模式启动 TuGraph 服务器。
+
+### 2.1.运行普通进程
+
+`lgraph_server -d run`命令可以将 TuGraph 作为普通进程运行。普通进程依赖命令行终端，因此终端结束时，TuGraph 进程也会自动终止。普通进程模式配合`--log_dir ""`可以将进程日志直接输出到终端，因此更方便调试。
+
+启动命令：
+
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+普通模式的运行输出示例：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+普通进程模式下，用户可以通过按 `CTRL+C` 来提前终止 TuGraph 进程。
+
+### 2.2.运行进程守护模式
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+守护模式的运行输出示例：
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+## 3.服务操作
+
+### 3.1.启动服务
+
+TuGraph 需要通过 `lgraph_server -d start` 命令行启动，启动命令示例如下：
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+### 3.2.停止服务
+
+用户可以使用`kill`命令以及`lgraph_server -d stop`命令停止 TuGraph 守护进程。由于可能在同一台计算机上运行多个 TuGraph 服务器进程，因此我们使用`.pid`文件区分不同的服务器进程，该文件写入启动该进程的工作目录。因此，需要在相同工作目录中运行`lgraph_server-d stop`命令，以停止正确的服务器进程。
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.重启服务
+
+用户也可以通过`lgraph_server -d restart`来重启 TuGraph 服务：
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.服务配置
+
+TuGraph 服务器在启动时从配置文件和命令行选项加载配置，如果在配置文件和命令行中同一选项指定了不同的值，将优先使用命令行中指定的值。
+
+### 4.1.配置参数
+
+具体参数及其类型描述如下：
+
+| **参数名**                       | **<nobr>参数类型</nobr>** | **参数说明**                                                                                                                             |
+|-------------------------------|-----------------------|--------------------------------------------------------------------------------------------------------------------------------------|
+| directory                     | 字符串                   | 数据文件所在目录。如果目录不存在 ，则自动创建。默认目录为 /var/lib/lgraph/data。                                                                                  |
+| durable                       | 布尔值                   | 是否开启实时持久化。关闭持久化可以减少写入时的磁盘 IO 开销，但是在机器断电等极端情况下可能丢失数据。默认值为 `true`。                                                                     |
+| host                          | 字符串                   | REST 服务器监听时使用的地址，一般为服务器的 IP 地址。默认地址为 0.0.0.0。                                                                                        |
+| port                          | 整型                    | REST 服务器监听时使用的端口。默认端口为 7070。                                                                                                         |
+| enable_rpc                    | 布尔值                   | 是否使用 RPC 服务。默认值为 0。                                                                                                                  |
+| rpc_port                      | 整型                    | RPC 及 HA 服务所用端口。默认端口为 9090。                                                                                                          |
+| enable_ha                     | 布尔值                   | 是否启动高可用模式。默认值为 false。                                                                                                                |
+| ha_log_dir                    | 字符串                   | HA 日志所在目录，需要启动 HA 模式。默认值为空。                                                                                                          |
+| verbose                       | 整型                    | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。默认值为 1。                                                                                            |
+| log_dir                       | 字符串                   | 日志文件所在的目录。默认目录为 /var/log/lgraph/。                                                                                                    |
+| ssl_auth                      | 布尔值                   | 是否使用 SSL 安全认证。当开启时，REST 服务器只开启 HTTPS 服务。默认值为 false。                                                                                  |
+| web                           | 字符串                   | web 文件（包含可视化部分）所在目录。默认目录为 /usr/local/share/lgraph/resource。                                                                          |
+| server_cert                   | 字符串                   | 在 SSL 认证开启时，服务器所使用的 certificate 文件路径。默认路径为 /usr/local/etc/lgraph/server-cert.pem。                                                    |
+| server_key                    | 字符串                   | 在 SSL 认证开启时，服务器所使用的公钥文件。默认目录为 /usr/local/etc/lgraph/server-key.pem。                                                                  |
+| enable_audit_log              | 布尔值                   | 是否启用审计日志，默认值为 false。                                                                                                                 |
+| audit_log_expire              | 整型                    | 启用审计日志时，日志的有效时间（小时），超时自动清理，值为 0 时表示不清理。默认值为 0。                                                                                       |
+| audit_log_dir                 | 字符串                   | 启用审计日志时，日志文件的存放目录。默认目录为 $directory/_audit_log_。                                                                                      |
+| load_plugins                  | 布尔值                   | 启动服务时导入所有存储过程。默认值为 1。                                                                                                                |
+| optimistic_txn                | 布尔值                   | 为 Cypher 开启乐观多线程写入事务。默认为 0。                                                                                                          |
+| disable_auth                  | 布尔值                   | 关闭 REST 验证。默认为 0。                                                                                                                    |
+| ha_snapshot_interval_s             | 整型                    | 快照间隔（以秒为单位）。 默认值为 86400。                                                                                                             |
+| ha_heartbeat_interval_ms         | 整型                    | 心跳间隔（以毫秒为单位）。 默认值为 1000。                                                                                                             |
+| ha_node_offline_ms | 整型                    | 心跳超时且节点下线间隔（以毫秒为单位）。默认为 60000。                                                                                                       |
+| ha_node_remove_ms         | 整型                    | 节点被视为完全死亡并从列表中删除的间隔（以毫秒为单位）。默认值为 120000。                                                                                             |
+| enable_ip_check               | 布尔值                   | 允许 IP 白名单，默认值为 0。                                                                                                                    |
+| idle_seconds                  | 整型                    | 子进程可以处于空闲状态的最大秒数。 默认值为 600。                                                                                                          |
+| enable_backup_log             | 布尔值                   | 是否启用备份日志记录。 默认值为 0。                                                                                                                  |
+| backup_log_dir                | 字符串                   | 存储备份文件的目录。 默认值为空。                                                                                                                    |
+| snapshot_dir                  | 字符串                   | 存储快照文件的目录。 默认值为空。                                                                                                                    |
+| thread_limit                  | 整型                    | 同时使用的最大线程数。 默认值为 0，即不做限制，以 license 为准。                                                                                               |
+| unlimited_token               | 布尔值                   | 是否将链接token设置为无期限。 默认值为 0，有效期为24小时。                                                                                                   |
+| reset_admin_password                   | 布尔值                   | 是否重置管理者密码。 默认值为 0。 为1时，密码重置为`73@TuGraph`。                                                                                          |
+| enable_fulltext_index         | 布尔值                   | 是否启用全文索引功能，默认值为 0。                                                                                                                   |
+| fulltext_analyzer             | 字符串                   | 全文索引分词器类型。可设为`StandardAnalyzer`或者`SmartChineseAnalyzer`。默认是`StandardAnalyzer`                                                        |
+| fulltext_commit_interval      | 整形                    | 全文索引数据提交周期,针对写操作，单位秒。默认是 0，立即提交。                                                                                                     |
+| fulltext_refresh_interval     | 整形                    | 全文索引数据刷新周期，针对读操作，单位秒。默认是 0，立即可以读到最新写入的数据。                                                                                            |
+| conf                          | 字符串                   | 根据 host1:port1,host2:port2,host3:port3 初始化HA集群，默认值为空。                                                                                |
+| ha_node_join_group_s             | 整形                    | 节点尝试加入高可用集群的等待时长，单位秒，默认是 10。                                                                                                         |
+| ha_bootstrap_role                | 整形                    | 是否使用bootstrap方式启动，以及使用该方式启动的服务器角色，0代表不使用bootstrap方式启动，1代表使用bootstrap方式启动且本节点为leader，2代表使用bootstrap方式启动且本节点为follower，只有这3种选项。 默认值为 0。 |
+| help                          | 布尔值                   | 打印此帮助消息。 默认值为 0。                                                                                                                     |
+
+### 4.2.服务器配置文件
+
+TuGraph 的配置文件以 JSON 格式存储。建议将大多数配置存储在配置文件中，并且仅在需要时使用命令行选项临时修改某些配置参数。
+一个典型的配置文件如下：
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md
new file mode 100644
index 0000000000..0380d3d39a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/3.high-availability-mode.md
@@ -0,0 +1,134 @@
+# 部署高可用模式
+
+> 此文档主要介绍了高可用模式的原理、准备工作、以及服务器的操作说明
+
+## 1.原理
+
+TuGraph 通过多机热备份来提供高可用模式（HA 模式）。在高可用模式下，对数据库的写操作会被同步到所有服务器上，这样即使有部分服务器宕机也不会影响服务的可用性。
+
+在高可用模式下，多个 TuGraph 服务器组成一个备份组。每个备份组由三个或更多 TuGraph 服务器组成，其中某台服务器会作为`leader`，而其他复制组服务器则作为`follower`。写入请求由`leader`
+提供服务，该`leader`将每个请求复制同步到`follower`，并在请求同步到服务器后才能响应客户端。这样，如果任何服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选择出新的`leader`。
+
+高可用模式仅企业版可用，开源社区版不含此功能。
+
+## 2.准备工作
+
+要启用高可用模式，用户需要：
+
+- 三台及以上的 TuGraph 服务器实例。
+
+- 在启动 lgraph_server 时打开高可用模式，可以使用配置文件或者命令行将`enable_ha`选项设置为`true`。
+
+- 设置正确的`rpc_port`，可通过配置文件或者命令行设置。
+
+## 3.启动初始备份组
+
+### 3.1.初始数据一致
+
+当启动时所有服务器中的数据相同或没有数据时，用户可以通过
+指定`--conf host1:port1,host2:port2`启动服务器。
+这种方式可以将准备好的所有TuGraph实例一次性加入初始备份组，
+由备份组中的所有服务器根据raft协议选举出`leader`，并将其他
+服务器以`follower`的角色加入备份组。
+
+启动初始备份组的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+### 3.2.初始数据不一致
+
+如果第一台服务器中已有数据（以`lgraph_import`工具导入或从非高可用模式的服务器传输得到），
+并且之前并未在高可用模式下使用，则用户应使用boostrap方式启动。
+以`ha_bootstrap_role`参数为1在bootstrap模式下启动有数据的服务器，并通过`conf`参数指定本机为`leader`。
+在bootstrap模式下，服务器在将新加入的服务器添加到备份组之前会将自己的
+数据复制到新服务器中，以使每个服务器中的数据保持一致。
+
+启动有数据服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 1
+```
+
+其他无数据的服务器需要指定`ha_bootstrap_role`参数为2，并通过`conf`参数指定`leader`即可，命令示例如下所示
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090 --ha_bootstrap_role 2
+```
+
+## 4.横向扩展其他服务器
+
+启动初始备份组后，如果想对备份组进行横向扩展，要将新服务器添加到备份组，
+应使用`--conf HOST：PORT`选项，其中`HOST`可以是该备份组中已有的任何服务器的 IP 地址，
+而`PORT`是其 RPC 端口。例如：
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090
+```
+
+此命令将启动一台高可用模式的 TuGraph 服务器，并尝试将其添加到包含服务器`172.22.224.15:9090`的备份组中。
+请注意，加入备份组需要服务器将其数据与备份组的`leader`服务器同步，此过程可能需要相当长的时间，具体取决于数据的大小。
+
+## 5.停止服务器
+
+当服务器通过`CTRL-C`下线时，它将通知当前的`leader`服务器，告知其从备份组中删除该下线的服务器。如果`leader`服务器下线，
+它将在下线前将`leader`身份权限传给另一台服务器。
+
+如果服务器被终止或者与备份组中的其他服务器失去连接，则该服务器将被视为失败节点，`leader`服务器将在特定时限后将其从备份组中删除。
+
+如果任何服务器离开备份组并希望重新加入，则必须从`--conf HOST:PORT`选项开始，其中`HOST`是当前备份组中的某台服务器的 IP 地址。
+
+## 6.重启服务器
+
+不建议重新启动整个备份组，因为它会中断服务。如果需要，可以关闭所有服务器。但在重新启动时，
+必须保证关闭时的备份组中至少有N/2+1的服务器能正常启动，否则启动失败。 并且，
+无论初始启动复制组时是否指定`enable_bootstrap`为true，重启服务器时都只需通过
+指定`--conf host1:port1,host2:port2`参数一次性重启所有服务器即可，命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 7.docker部署高可用集群
+在真实业务场景中，很可能遇到在多种操作系统或架构上部署高可用集群的需求。
+差异化的环境可能导致编译TuGraph时缺少某些依赖。因此，
+在docker中编译软件并部署高可用集群是非常有应用价值的。以centos7版本的docker为例，
+部署高可用集群的步骤如下所示。
+
+### 7.1.安装镜像
+使用如下命令下载TuGraph的编译docker镜像环境
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+然后拉取TuGraph源码并编译安装
+
+### 7.2.创建容器
+使用如下命令创建容器，使用`--net=host`使得容器运行在host模式，此模式下
+docker和宿主机和共享网络namespace，即共用同一个IP。
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 7.3.启动服务
+在每台服务器上使用如下命令启动服务，因为docker和宿主机共享IP，所以可以直接指定在宿主机IP上启动服务
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.查看服务器状态
+
+备份组的当前状态可以在 TuGraph 可视化工具、REST API 以及 Cypher 查询中获取。
+
+在 TuGraph 可视化工具中，可以在 DBInfo 部分中找到备份组中的服务器及其角色列表。
+
+使用 REST API 时，可以使用`GET /info/peers` 请求获取信息。
+
+在 Cypher 中，使用`CALL dbms.listServers()`语句来查询当前备份组的状态信息。
+
+## 9.高可用模式下数据同步问题
+
+在高可用模式下，同一备份组中的不同服务器可能并不总是处于相同的状态。出于性能原因，如果请求已同步到超过一半的服务器，则`leader`服务器将认为该请求属于`committed`状态。尽管其余服务器最终将收到新请求，但服务器的状态不一致将持续一段时间。客户端也可能向刚刚重新启动的服务器发送请求，从而具有较旧的状态。
+
+为了确保客户端看到一致连续的数据，特别是为了摆脱`反向时间旅行`问题（其中客户端读取比以前看到的状态更旧的状态），每个 TuGraph 服务器都会保持一个单调增加的数据版本号。备份组中数据版本号到数据库状态的映射全局一致，这意味着如果两台服务器具有相同的数据版本号，则它们必须具有相同的数据。响应请求时，服务器在响应中包含了其数据版本号。因此，客户端可以知道它看到了哪个版本。客户端收到旧版本的数据之后可以重新向Leader发送请求，从而获取到最新的数据。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/index.rst
new file mode 100644
index 0000000000..a653bf13ab
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/2.running/index.rst
@@ -0,0 +1,8 @@
+运行
+====
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md
new file mode 100644
index 0000000000..6eaa6145ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/1.data-import.md
@@ -0,0 +1,376 @@
+# 数据导入
+
+> 此文档主要介绍 TuGraph 的数据导入功能。其中包括 CSV 格式的分隔符，jsonline 的格式示例，以及导入在线和离线的两种模式。
+
+## 1.简介
+
+在图数据库服务安装成功后，您可以使用`lgraph_import`批量导入工具将现有数据导入 TuGraph。`lgraph_import`支持从 CSV 文件和 JSON 数据源导入数据。
+
+> CSV 格式
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline 格式
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph 支持两种导入模式：
+
+- _离线模式_：读取数据并将其导入指定服务器的数据文件，应仅在服务器离线时完成。
+- _在线模式_：读取数据并将其发送到工作中的服务器，然后将数据导入其数据库。
+
+## 2.CSV文件格式分隔符
+
+    CSV格式的分隔符可以是单字符或多字符组成的字符串，其中不能包含`\r`或`\n`。注意不同的shell会对输入字符串做不同的处理，因此针对不同的shell输入参数可能需要不同的转义处理。
+
+此外，`lgraph_import`还支持以下转义字符，以便输入特殊符号：
+
+| 转义符 | 说明                                                             |
+| ------ | ---------------------------------------------------------------- |
+| \\     | 反斜杠`\\`                                                       |
+| \\a    | 响铃，即 ASCII 码 0x07                                           |
+| \\f    | form-feed，即 ASCII 码 0x0c                                      |
+| \\t    | 水平制表符，即 ASCII 码 0x09                                     |
+| \\v    | 垂直制表符，即 ASCII 码 0x0b                                     |
+| \\xnn  | 两位十六进制数，表示一个字节，如\\x9A                            |
+| \\nnn  | 三位八进制数，表示一个字节，如\\001, \\443，数值范围不能超过 255 |
+
+例：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.配置文件
+
+`lgraph_import`工具通过指定的配置文件进行环境配置。配置文件描述输入文件的路径、它们所代表的点/边以及点/边的格式。
+
+### 3.1.配置文件格式
+
+配置文件包含两部分：schema 和 files。`schema`部分定义 label，`files`部分描述要导入的数据文件。
+
+#### 3.1.1.关键字
+
+- schema (数组形式）
+  - label（必选，字符串形式）
+  - type（必选，值只能是 VERTEX 或者 EDGE）
+  - properties（数组形式，对于点必选，对于边如果没有属性可以不配置）
+    - name（必选，字符串形式）
+    - type （必选，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（可选，代表该字段可以配置，也可以不配置）
+    - index（可选，该字段是否需要建索引）
+    - unique（可选，该字段是否建索引，并且是 unique 类型的，即全局唯一）
+    - pair_unique（可选，该字段是否建索引，并且是 pari_unique 类型的，即两点间唯一，仅用于边索引）unique与pair_unique只能设置一个，同时设置并运行将会因为输入异常而终止
+  - primary (仅点配置，必选，主键字段，需指定一个 property，用来唯一确定一个点)
+  - temproal (仅边配置，可选，指定时间戳属性用于存储层排序)
+  - temporal_field_order (仅边配置，可选，默认为"ASC"，表示升序，也可配置为"DESC"，表示降序)
+  - constraints (仅边配置，可选，数组形式，起点和终点的 label，不配置或者为空代表不限制)
+  - detach_property (点边都可配置，可选，默认是`false`。`true` 代表属性数据单独存放，在内存不够，属性数据比较多的场景下可以减少io读放大)
+- files （数组形式）
+  - path（必选，字符串，可以是文件路径或者目录的路径，如果是目录会导入此目录下的所有文件，需要保证有相同的 schema）
+  - header（可选，数字，头信息占文件起始的几行，没有就是 0）
+  - format（必须选，只能是 JSON 或者 CSV）
+  - label（必选，字符串）
+  - columns（数组形式）
+    - SRC_ID (特殊字符串，仅边有，代表这列是起始点数据)
+    - DST_ID (特殊字符串，仅边有，代表这列是目的点数据)
+    - SKIP   (特殊字符串，代表跳过这列数据)
+    - [property]
+  - SRC_ID (仅边配置，值是起始点标签)
+  - DST_ID (仅边配置，值是目的点标签)
+
+#### 3.1.2.索引长度
+因为TuGraph对key的长度有限制，因此针对属性很长的列创建索引时，会进行截断处理，如果是唯一索引，需要注意截断后保留的内容依然是唯一的。另外在通过迭代器遍历索引时，拿到的key是经过截断的，可能和预期不一致。针对不同类型的索引，截断长度是不同的。
+##### 3.1.2.1.unique索引
+unique索引是全局唯一的，该索引key的最大长度是480bytes。primary作为特殊的unique索引，因此最大key的长度也是480bytes
+##### 3.1.2.2.pair_unique索引
+pair_unique索引是指两点间唯一的索引，这种类型的索引只能创建于边的schema中，这种索引在用户指定的key后面加上了源点和目标点的vid，每个vid是5bytes长度。因此最大key的长度是470bytes。
+##### 3.1.2.3.非唯一索引
+非唯一索引是指既没有设置unique为1，也没有设置pair_unique为1的索引，在TuGraph的实现中，此类索引一个key可能映射到多个值，为了加速查找和写入，在用户指定的key后面加上了一组vid或euid中的最大值。其中对于创建于点中的非唯一索引，key后面跟着vid，每个vid是5bytes长度，因此最大长度是475bytes。对于创建于边中的非唯一索引，key后面跟着euid，每个euid是24bytes长度，因此最大长度是456bytes。
+
+### 3.2.配置文件示例
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+对于上述配置文件，定义了三个 label：两个点类型`actor`和`movie`，一个边类型`role`。每个 label 都描述了：label 的名字、类型（点还是边）、属性字段有哪些以及每个字段的类型。对于点，另外定义了 primary 字段是哪个；对于边，另外定义了 constraints 字段，用来限制边的起点和终点只能是哪些组合。
+
+还描述了三个数据文件，两个点的数据文件`actors.csv`和`movies.csv`，一个边的数据文件`roles.csv`。每个部分都描述了：文件的路径（path）、数据类型（format）、信息头占开头几行（header）、是哪个 label 的数据（label）、文件中每行数据中的每个列对应的字段是哪个。
+
+对于上述配置文件，import 工具在执行的过程中会先在 TuGraph 中创建`actor`、`movie`、`role`这三个 label，然后再执行三个文件的数据导入。
+
+## 4.离线全量导入
+
+离线模式只能在离线状态的服务器使用。离线导入会创建一张新图，因此更适合新安装的 TuGraph 服务器上的第一次数据导入。
+要在离线模式下使用`lgraph_import`工具，可以指定`lgraph_import --online false`选项。要了解可用的命令行选项，请使用`lgraph_import --online false --help`：
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+命令行参数：
+
+- **-c, --config_file** `config_file`: 导入配置文件名，其格式要求见下述。
+- **--log** `log_dir`: 日志目录。默认为空字符串，此时将日志信息输出到控制台。
+- **--verbose** `0/1/2`: 日志等级，等级越高输出信息越详细。默认为 1。
+- **-i, --continue_on_error** `true/false`: 在碰到错误时跳过错误并继续，默认为 false，碰到错误立即退出。
+- **-d, --dir** `{diretory}`: 数据库目录，导入工具会将数据写到这个目录。默认为`./db`。
+- **--delimiter** `{delimiter}`: 数据文件分隔符。只在数据源是 CSV 格式时使用，默认为`","`。
+- **-u, --username** `{user}`: 数据库用户名。需要是管理员用户才能执行离线导入。
+- **-p, --password** `{password}`: 指定的数据库用户的密码
+- **--overwrite** `true/false`: 是否覆盖数据。设为 true 时，如果数据目录已经存在，则覆盖数据。默认为`false`。
+- **-g, --graph** `{graph_name}`: 指定需要导入的图种类。
+- **-h, --help**: 输出帮助信息。
+
+### 4.1.离线导入示例
+
+在这个例子中，我们使用上面描述的电影-演员数据来演示导入工具的使用方法。待导入数据分为三个文件：`movies.csv`，`actors.csv`，`roles.csv`。
+
+`movies.csv`包含的是电影的信息，其中每部电影有一个 id（作为检索的 primary key），此外每部电影还拥有 title、year 和 rating 等属性。（数据来自[IMDb](http://www.imdb.com)）。
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+对应的 jsonline 格式如下:
+也可以所有字段都是字符串形式，导入的时候会转换成对应的类型
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`包含的是演员的信息。每个演员也拥有一个 id，以及 name 等属性。
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> 对应的 jsonline 格式如下:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`则包含了演员在哪个电影中扮演了哪个角色的信息。其中每一行记录的是指定演员在指定电影里饰演的角色，对应数据库中的一条边。`SRC_ID` 和 `DST_ID` 分别是边的源点和目标点，他们分别是`actors.csv`和`movies.csv`中定义的`primary`属性。
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+对应的 jsonline 格式如下:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+`配置文件import.conf`，注意每个文件中有两个标题行，因此我们需要指定`HEADER=2`选项。
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+使用导入配置文件，我们现在可以使用以下命令导入数据：
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # 从import.conf读取配置信息
+        --dir /data/lgraph_db      # 将数据存放在/data/lgraph_db
+        --graph mygraph            # 导入名为 mygraph 的图
+```
+
+**注意**：
+
+- 如果名为`mygraph`的图已存在，导入工具将打印错误消息并退出。要强制覆盖图形，可以使用`--overwrite true` 选项。
+- 配置文件和数据文件必须使用 UTF-8 编码（或普通 ASCII 编码，即 UTF-8 的子集）存储。如果任何文件使用 UTF-8 以外的编码（例如，带有 BOM 或 GBK 的 UTF-8）编码，则导入将失败，并输出分析器错误。
+
+## 5.在线增量导入
+
+在线导入模式可用于将一批文件导入已在运行中的 TuGraph 实例中。这对于处理通常以固定的时间间隔进行的增量批处理更新非常便利。`lgraph_import --online true`选项使导入工具能够在线模式工作。与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据发送到正在运行的 TuGraph 实例中，该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+
+如果用户和密码有效，并且指定的图存在，导入工具将将数据发送到服务器，服务器随后解析数据并将其写入指定的图。数据将以大约 16MB 大小的包发送，在最近的换行符处中断。每个包都是以原子方式导入的，这意味着如果成功导入包，则成功导入所有数据，否则，任何数据都不会进入数据库。如果指定了`--continue_on_error true`，则忽略数据完整性错误，并忽略违规行。否则，导入将在第一个错误包处停止，并打印出已导入的包数。在这种情况下，用户可以修改数据以消除错误，然后使用`--skip_packages N`重做导入以跳过已导入的包。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md
new file mode 100644
index 0000000000..5544169de0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# 数据导出
+
+> 此文档主要介绍 TuGraph 的数据导出功能。
+
+## 1.简介
+
+TuGraph 可以通过 `lgraph_export` 工具来对已经存放在TuGraph的图数据进行数据导出。 `lgraph_export` 工具可以将指定 TuGraph 数据库的数据以 `csv` 或者 `json` 文件形式导出到指定目录，同时导出这些数据进行再导入时需要的配置文件 `import.config` ，详细描述可参见[配置文件](1.data-import.md)。
+
+## 2.导出命令
+
+该工具的命令示例如下：
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+其中：
+
+- `-d {database_dir}` 指定需要进行数据导出的数据库所在目录，默认值为 `./testdb`。
+- `-e {export_destination_dir}` 指定导出文件存放的目录，默认值为 `./exportdir`。
+- `-g {graph_to_use}` 指定图数据库的种类，默认为 `default` 。
+- `-u {username}` 指定进行该导出操作的用户的用户名。
+- `-p {password}` 指定进行该导出操作的用户的用户密码。
+- `-s {field_separator}` 指定导出文件的分隔符，默认为逗号。
+- `-f {output_format}` 指定导出数据的格式，`json`或者`csv`，默认为`csv`。
+- `-h` 除上述指定参数外，也可以使用该参数查看该工具的使用帮助。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..ce113ad0a4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/3.backup-and-restore.md
@@ -0,0 +1,35 @@
+# 备份恢复
+
+> 此文档主要介绍 TuGraph 的数据备份和恢复功能。
+
+## 1.数据备份
+
+TuGraph 可以通过 `lgraph_backup` 工具来进行数据备份。
+`lgraph_backup` 工具可以将一个 TuGraph 数据库中的数据备份到另一个目录下，它的用法如下：
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+其中：
+
+- `-s {source_dir}` 指定需要备份的数据库（源数据库）所在目录。
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
+  如果目标数据库不为空，`lgraph_backup` 会提示是否覆盖该数据库。
+- `-c {true/false}` 指明是否在备份过程中进行 compaction。
+  compaction 能使产生的备份文件更紧凑，但备份时间也会变长。该选项默认为 `true`。
+
+## 2.数据恢复
+
+使用`lgraph_backup` 工具得到的目标数据库`{destination_dir}`备份了源数据库
+`{source_dir}`的所有子图，但不包含HA集群的raft信息，从而保证服务和集群能
+以备份数据库成功重启并与源数据库的数据一致。使用如下命令可以用备份数据库重启服务，
+在服务启动时会恢复所有子图的存储过程，保证备份服务和原服务完全一致。
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+其中：
+
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md
new file mode 100644
index 0000000000..c0c5afb7eb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# 数据预热
+
+> 此文档主要介绍 TuGraph 的数据预热功能。
+
+## 1.简介
+
+TuGraph 是基于磁盘的数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+## 1.数据预热命令
+
+数据预热可以通过工具 `lgraph_warmup` 来进行。它的使用示例如下：
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+其中：
+
+- `-d {db_dir}` 选项指定了 TuGraph 服务器的数据目录
+
+- `-g {graph_list}` 选项指定需要进行数据预热的图名称，用逗号分隔
+
+根据数据大小和所使用的磁盘类型不同，预热过程运行时间也不同。机械磁盘上预热一个大数据库可能耗时较长，请耐心等待。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/index.rst
new file mode 100644
index 0000000000..3b01353109
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/3.server-tools/index.rst
@@ -0,0 +1,8 @@
+服务端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md
new file mode 100644
index 0000000000..4644db356e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/1.python-client.md
@@ -0,0 +1,237 @@
+# Python客户端
+
+> 此文档主要是TuGraph Python SDK的使用说明。
+
+## 1. 概述
+Python的TuGraph Client有两种，一种是RESTful的Client，使用HTTP方法向server发送请求，另一种是RPC的Client，使用RPC方法调用server远程服务，两者各有优劣。
+RESTful client的使用方式简单，在项目的src/client/python/TuGraphClient目录下可以找到Client的源码文件，直接安装到用户环境中即可使用，但是支持的功能较少，
+性能也不高。RPC Client既支持单机的server，也支持高可用集群和负载均衡，接口较多，功能强大。但是使用方式较为复杂，需要用户自己编译TuGraph项目得到liblgraph_client_python.so，
+或者使用runtime镜像时直接在/usr/local/lib64目录下找到该依赖库，将其引入python项目即可正常使用。接下来将详细介绍这两种Client的使用方式。
+
+## 2. RESTful Client
+
+### 2.1.安装Client
+
+TuGraph的Python RESTful client使用setuptools工具进行打包和分发，用户可以将client直接安装到本地环境中，在使用时即可直接引入。
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+注：使用setuptools工具安装python client时会安装httpx等依赖，需要在通外网的环境下执行。
+
+### 2.2.调用Cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = await aclient.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.调用存储过程
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+res = await aclient.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python的TuGraph Rpc Client是使用pybind11包装的CPP Client SDK，下表列出了Python和CPP Client SDK的对应关系。
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+Python RPC Client的使用方式较为复杂，用户可以在本地环境中编译TuGraph得到liblgraph_client_python.so，也可以使用官方提供的runtime镜像，
+在镜像中的/usr/local/lib64目录下可以直接找到该依赖库，引入用户项目即可使用。
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.实例化client对象
+
+#### 3.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 3.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 3.2.调用cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.3.向leader发送cypher请求
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.4.调用GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.5.向leader发送GQL请求
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.6.调用存储过程
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.7.向leader调用存储过程
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 3.8.加载存储过程
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 3.9.列举存储过程
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.10.删除存储过程
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 3.11.从字节流中导入schema
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.12.从字节流中导入点边数据
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 3.13.从文件中导入schema
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.14.从文件中导入点边数据
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..ce29ac4bf4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/2.cpp-client.md
@@ -0,0 +1,340 @@
+# C++客户端
+
+> 此文档主要是TuGraph C++ SDK的使用说明。
+
+## 1.概述
+C++ Client 能够使用 RPC 连接lgraph_server，进行数据导入、执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直接连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化。
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.3.向leader发送cypher请求
+```C++
+    std::string str;
+    bool ret = client.CallCypherToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```C++
+    std::string str;
+    bool ret = client.CallGql(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGql(std::string& result, const std::string& gql,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling gql.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.5.向leader发送GQL请求
+```C++
+    std::string str;
+    bool ret = client.CallGqlToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGqlToLeader(std::string& result, const std::string& gql,
+                 const std::string& graph = "default", bool json_format = true,
+                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true);
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+
+### 2.8.加载存储过程
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送请求。
+
+### 2.10.删除存储过程
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md
new file mode 100644
index 0000000000..15e979eb3c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/3.java-client.md
@@ -0,0 +1,279 @@
+# Java客户端
+
+> 此文档主要是TuGraph Java SDK的使用说明。
+
+## 1.编译java client代码
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖
+```java
+import com.alipay.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.3.向leader发送cypher请求
+```java
+    String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```java
+    String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling GQL
+    @return: the result of GQL query execution
+    public String callGql(String gql, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.5.向leader发送GQL请求
+```java
+    String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```java
+    String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedureToLeader : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @return: the result of procedure execution
+    public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 2.8.加载存储过程
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.10.删除存储过程
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException 
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout) 
+            throws UnsupportedEncodingException, IOException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..a9c06de71b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,174 @@
+# TuGraph-OGM
+
+## 1.简介
+
+> TuGraph-OGM 项目在其他仓库开源。
+
+TuGraph-OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。同时 TuGraph-OGM 兼容 Neo4j-OGM，Neo4j 生态用户可以无缝迁移到 TuGraph 数据库上。
+
+### 1.1.TuGraph-OGM 功能
+
+TuGraph-OGM 提供以下函数操作 TuGraph：
+
+| 功能                            | 用法                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| 插入单个节点\边                 | void session.save(T object)                                                      |
+| 批量插入节点\边                 | void session.save(T object)                                                      |
+| 删除节点与对应边                | void session.delete(T object)                                                    |
+| 删除指定 label 的全部节点       | void session.deleteAll(Class\<T> type)                                           |
+| 清空数据库                      | void purgeDatabase()                                                             |
+| 更新节点                        | void session.save(T newObject)                                                   |
+| 根据 id 查询单个节点            | T load(Class<T> type, ID id)                                                     |
+| 根据 ids 查询多个节点           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| 根据 label 查询全部节点         | Collection\<T> loadAll(Class\<T> type)                                           |
+| 条件查询                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher 查询（指定返回结果类型） | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher 查询                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.编译 TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.使用 TuGraph-OGM
+
+详细示例请参考 demo 文件夹下的 TuGraphOGMDemo ###在`pom.xml`中引入依赖
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // 构建Movie节点
+    @Id
+    private Long id;      // Movie节点的id
+    private String title; // title属性
+    private int released; // released属性
+
+    // 构建边ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // 构建Actor节点
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// 配置
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//启动driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// 开启session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.通过OGM进行增删改查
+
+```java
+// 增
+Movie jokes = new Movie("Jokes", 1990);  // 新建Movie节点jokes
+session.save(jokes);                     // 将jokes存储在TuGraph中
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // 将speed节点与alice节点通过ACTS_IN进行连接
+session.save(speed);                    // 存储两个节点与一条边
+
+// 删
+session.delete(alice);                  // 删除alice节点以及相连的边
+Movie m = session.load(Movie.class, jokes.getId());   // 根据jokes节点的id获取jokes节点
+session.delete(m);                                    // 删除jokes节点
+
+// 改
+speed.setReleased(2018);
+session.save(speed);                   // 更新speed节点属性
+
+// 查
+Collection<Movie> movies = session.loadAll(Movie.class);  // 获取所有Movie节点
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // 查询所有小于1995年发布的电影
+
+// 调用Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // 查询Speed为2018的Movie
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // 创建节点Label Director
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // 创建边Label DIRECT
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // 获取create结果
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // 查看创建节点数目
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //查看创建边数目
+
+// 清空数据库
+session.deleteAll(Movie.class);        // 删除所有Movie节点
+session.purgeDatabase();               // 删除全部数据
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
new file mode 100644
index 0000000000..8c68a5fd64
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/5.tugraph-cli.md
@@ -0,0 +1,134 @@
+# 命令行工具
+
+> 此文档主要介绍 lgraph_cypher 文档的使用
+
+TuGraph 发布版本附带名为`lgraph_cypher`的查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+## 1.单命令模式
+
+在单命令模式下，`lgraph_cypher`可用于提交单个 Cypher 查询并将结果直接打印到终端，打印结果也可以容易地重定向写入指定文件。当用户需要从服务器获取大量结果并将其保存在文件中时，这非常便利。
+在此模式下，`lgraph_cypher`工具具有以下选项：
+
+### 1.1.命令行参数:
+
+| 参数     | 类型   | 说明                                                                     |
+| -------- | ------ | ------------------------------------------------------------------------ | ------ | ----------------------------------------------------------------------------------------------------------------------------------------- |
+| --help   | \\     | 列出所有参数及说明。                                                     |
+| -example | \\     | 列出命令实例。                                                           |
+| -c       | string | 数据库的配置文件，用于获取 ip 与 port 信息。                             |
+| -h       | string | 数据库服务器 ip 地址，如有配置文件则可舍去此参数。默认值为`127.0.0.1` 。 |
+| -p       | string | 数据库服务器端口，如有配置文件则可舍去此参数。默认值为`7071` 。          |
+| -u       | string | 数据库登录用户名。                                                       |
+| -P       | string | 数据库登录密码。                                                         |
+| -f       | string | 包含单条 Cypher 查询单文本文件的路径。                                   |
+| -s       | string | 单行 cypher 查询命令。以`"`开头结尾。                                    |
+| -t       | int    | 进行 cypher 查询时服务器的超时阈值。默认值为`150`秒。 -format            | string | 查询结果显示模式。支持`plain`与`table`两种格式。`plain`格式会将查询结果单列打印。`table`格式会将查询结果以表格方式显示。默认值为`table`。 |
+
+### 1.2.命令示例:
+
+**cypher 命令文件查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+```
+
+**cypher 命令单句查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+```
+
+## 2.交互模式
+
+`lgraph_cypher`也可以在交互模式下运行。在交互式模式下，客户端与服务器保持连接，并在读取-评估-打印-循环中与用户进行交互。
+
+### 2.1.进入 lgraph_cypher 交互模式:
+
+如不加`-f`或`-s`命令行选项，运行`lgraph_cypher`时将会进入交互模式。使用方式如下：
+
+```
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+```
+
+如成功进入则会显示相应登录成功信息：
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2023 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+现在我们也提供一个交互式 shell ，用于用户输入 Cypher 查询语句或使用`:help`命令来检查可用命令。
+
+### 2.2.command种类与说明:
+
+除 Cypher 查询外，`lgraph_cypher` 的 shell 还接受以下命令：
+
+| 命令                     | 对应参数                           | 说明                                                                                                |
+| ------------------------ | ---------------------------------- | --------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                 | 显示服务器信息与所有 command 对应说明。                                                             |
+| :db_info                 | \\                                 | 当前服务器状态查询。对应 REST API 的/db/info。                                                      |
+| :clear                   | \\                                 | 清空屏幕。                                                                                          |
+| :use                     | {图的名称}                         | 使用该名称指定的图，默认值为`default` 。                                                            |
+| :source                  | `-t {查询timeout值} -f {查询文件}` | 可交互模式下的 cypher 命令文件查询。超时阈值默认值为`150`秒。查询文件格式参考无交互式查询参数。     |
+| :exit                    | \\                                 | 退出交互模式并返回原命令行。                                                                        |
+| :format                  | `plain` or `table`                 | 更改 cypher 查询结果的显示模式。支持`plain`与`table`模式。                                          |
+| :save all/command/result | `-f {文件路径}` `{cypher语句}`     | 存储 cypher 命令（command）或查询结果（result）或以上二者（all）。默认存储位置为`/saved_cypher.txt` |
+
+**注意:**
+
+- 每条命令都应该以冒号开始 `:`.
+
+**:save 命令例子:**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+```
+
+### 2.3.cypher 查询命令:
+
+在交互模式下，用户也可直接输入单句 cypher 命令进行查询，以"`;`"结束。输入命令不区分大小写。例子如下：
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher`输入命令时支持多行输入，用户可使用`ENTER`键将长查询语句分多行输入。多行输入情况下命令行开头会从`>`变为`=>`，然后用户可以继续输入查询的其余部分。
+
+例子如下：
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### 2.4.辅助功能:
+
+**历史查询：** 在交互模式下按上下方向键可查询输入历史。
+
+**自动补全：** lgraph_cypher 会根据输入历史进行自动补全。在补全提示出现的情况下，按下右方向键就会自动补全命令。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/6.bolt-client.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/6.bolt-client.md
new file mode 100644
index 0000000000..a8a7bc4424
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/6.bolt-client.md
@@ -0,0 +1,15 @@
+# Bolt客户端
+
+TuGraph目前兼容了Neo4j的bolt协议，可以直接使用Neo4j的客户端访问TuGraph。
+
+## 开启bolt端口
+
+如果使用的是TuGraph的docker容器，配置文件在 `/usr/local/etc/lgraph.json`
+
+在TuGraph的配置文件中添加 `bolt_port=7687`（端口号自己看情况修改），开启bolt端口，Neo4j的客户端需要与这个端口连接。
+
+## Neo4j客户端使用限制
+
+目前还没有兼容Neo4j bolt协议的全部功能，Neo4j客户端的的流式读取、显示事务功能目前还不支持，使用客户端的时候注意避免使用这两个功能。
+
+在代码目录中的demo/Bolt下面有golang、java、js、python、rust 这几个语言的的例子，可供参考。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/7.bolt-console-client.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/7.bolt-console-client.md
new file mode 100644
index 0000000000..af71d05264
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/7.bolt-console-client.md
@@ -0,0 +1,86 @@
+# TuGraph console client
+
+`lgraph_cli` 是基于bolt协议的 console client，c++编写，使用时需要连接tugraph的bolt端口。
+
+`lgraph_cypher` 是基于http协议的 console client，python编写，使用时需要连接tugraph的http端口。
+
+`lgraph_cypher` 使用的时候需要安装需要的python库，如果服务器网络不通，则需要手动安装缺失的python库。
+
+`lgraph_cli` 是一个二进制的可执行文件，不依赖其他动态库，拷贝到一台linux机器上就可执行。
+
+## `lgraph_cli`使用
+
+语句以分号结束，输入`exit`, `quit`或者Ctrl-C退出客户端。
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+语句可以中间换行，多行输入。
+
+```powershell
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+非交互式
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+从文件读取多条命令
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/index.rst
new file mode 100644
index 0000000000..8d59c09305
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/4.client-tools/index.rst
@@ -0,0 +1,8 @@
+客户端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
new file mode 100644
index 0000000000..b79cc13cc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/1.monitoring.md
@@ -0,0 +1,1020 @@
+# 运维监控
+
+> 此文档主要介绍 TuGraph 的可视化运维监控
+
+## 1.设计思路
+
+可视化监控并不是TuGraph自身不可或缺的一部分，因此在设计时将可视化监控作为TuGraph周边生态中的一个应用，来减少和TuGraph数据库的耦合度，以及对于TuGraph自身的影响。TuGraph可视化监控采用目前最火热的开源解决方案，TuGraph Monitor + Prometheus + Grafana来实现。其中TuGraph Monitor作为TuGraph服务的客户端，通过TCP链接向TuGraph服务发起Procedure请求，TuGraph服务在接收到请求后收集自身所在机器的cpu，memory，disk，io，以及请求数量等指标的统计结果进行响应。TuGraph Monitor在接收到TuGraph响应的指标数据后，将数据包装成prometheus需要的格式，保存在内存中，等待Prometheus服务通过http请求获取。Prometheus服务会定期通过http请求从TuGraph Monitor获取封装好的请求数据，按照获取的时间保存在自己的时序数据库中。Grafana可以根据用户的配置，从Prometheus处获取某个时间段内的统计数据，并在web界面上绘制浅显易懂的图形来展示最终结果。整个请求链路中，都采用了主动获取，即PULL的模型，好处之一是它能最大限度的避免数据生产者和数据消费者之间的耦合度，使得开发更简单，好处之二是数据生产者不需要考虑数据消费者的数据处理能力，即使某个消费者的数据处理能力较弱，也不会因为生产者生产数据过快而压垮消费者。主动拉取模型的不足之处在于数据的实时性不够，但在这个场景中，数据并没有很高的实时性要求。
+
+### 1.1.TuGraph
+
+TuGraph数据库提供了收集服务所在机器中磁盘，内存，网络IO，以及查询请求等多种数据信息的能力，并通过标准Procedure方式提供查询。收集数据这一动作仅在有用户通过接口查询时才会发生，避免了在用户不需要TuGraph监控服务所在机器的指标时对用户业务查询请求带来的影响。
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor是TuGraph周边生态中的一个工具，它作为TuGraph众多用户中的一个，通过C++ RPC Client与TuGraph进行通信，通过Procedure查询接口来查询TuGraph服务所在机器的性能指标，并将TuGraph返回的结果包装成Prometheus需要的数据模型，等待Prometheus获取。用户可以通过设置查询时间间隔来保证获取监控指标对于业务查询的影响最小化。
+
+### 1.3.Prometheus
+
+Prometheus是一个开源的监控平台，并配备有专属的时序数据库，它会定期通过http请求从TuGraph Monitor服务获取统计指标，并保存在自己的时序数据库中。详细信息请参考官网: [https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana是一个开源的可视化和分析软件，它可以从包含Prometheus在内的多个数据源中获取数据，并且可以将时序数据库中的数据转换为精美图形和可视化效果的工具。具体信息请参考官网: [https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.部署方案
+
+### 2.1.第一步
+
+启动TuGraph服务，详细方法请参考文档: [https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.第二步
+
+启动TuGraph Monitor工具，启动命令如下：
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+参数含义如下
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.第三步
+
++ 下载符合您机器架构以及系统版本的Prometheus tar包，下载地址: [https://prometheus.io/download/](https://prometheus.io/download/)
+
++ 解压tar包，命令如下
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ 修改配置文件prometheus.yml，新增如下配置，使其可以抓取TuGraph Monitor包装好的性能数据
+
+```yaml
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ 启动prometheus，具体的启动参数可以通过如下命令获取
+
+```shell
+./prometheus -h
+```
+
++ 验证prometheus服务是否正常，可以通过web端登陆prometheus服务，查询监控指标resources_report是否已经获取到，能成功查询到数据则正确
+
+### 2.4.第四步
+
++ 下载符合您机器架构以及系统版本的Grafana安装包，下载地址: [https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ 安装Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 启动Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 配置Grafana，首先在数据源设置中配置Prometheus的IP地址，配置完成后可以通过测试连接功能，验证是否成功连接数据源。然后，导入如下模版，并在页面中根据实际情况，修改正确的接口IP和端口。最后可以根据实际情况设置刷新时间和监控时间范围
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana"
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {label_name} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "内存",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  QPS超过1000",
+        "name": "请求统计 alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "请求统计",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "磁盘",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\nCPU使用率超过90%",
+        "name": "CPU使用率 alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU使用率",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  磁盘IO超过10MB/S",
+        "name": "磁盘IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph监控页面",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+验证效果，刷新浏览器页面。如果正确显示饼图和折线图，则配置完成。
+
+## 3.未来计划
+
+目前可视化监控只支持单机监控，能监控服务所在机器的cpu，磁盘，网络io，请求qps等性能指标，未来将会实现监控ha集群的功能，也会将更多有意义的指标纳入监控范围
+
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
new file mode 100644
index 0000000000..6091df21fc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md
@@ -0,0 +1,434 @@
+# TuGraph-DataX
+
+> 此文档主要介绍 TuGraph DataX 的安装编译和使用示例
+
+## 1.简介
+
+TuGraph 在阿里开源的 DataX 基础上添加了 TuGraph 的写插件以及 TuGraph jsonline 数据格式的支持，其他数据源可以通过 DataX 往 TuGraph 里面写数据。
+DataX 介绍参考 [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+支持的功能包括：
+
+- 从 MySQL、SQL Server、Oracle、PostgreSQL、HDFS、Hive、HBase、OTS、ODPS、Kafka 等各种异构数据源导入 TuGraph
+- 将 TuGraph 导入相应的目标源 （待开发）
+
+![导入导出](../../../../images/tugraph-datax.png)
+
+## 2.编译安装
+
+```bash
+git clone git@code.alipay.com:fma/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+编译出来的 DataX 文件在 target 目录下
+
+## 3.文本数据通过DataX导入TuGraph
+
+我们以 TuGraph 手册中导入工具 lgraph_import 章节举的数据为例子，有三个 csv 数据文件，如下：
+`actors.csv`
+
+```
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+```
+
+`movies.csv`
+
+```
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+`roles.csv`
+
+```
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+```
+
+然后建三个 DataX 的 job 配置文件：
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后依次执行如下三个命令：
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## 4.MySQL数据通过DataX导入TuGraph
+
+我们在 `test` database 下建立如下电影 `movies` 表
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+往表中插入几条数据
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+建立一个 DataX 的 job 配置文件
+
+`job_mysql_to_tugraph.json`
+
+**配置字段方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**写简单 sql 方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后执行如下命令：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
new file mode 100644
index 0000000000..5e31c46502
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/3.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph-Explorer
+
+> TuGraph Explorer 已经合并到 [TuGraph Browser](../../4.user-guide/1.tugraph-browser.md)
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md
new file mode 100644
index 0000000000..47ae02c925
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/4.log.md
@@ -0,0 +1,41 @@
+# 日志信息
+
+> 此文档主要介绍 TuGraph 的日志功能。
+
+## 1.简介
+
+TuGraph 保留两种类型的日志：服务器日志和审计日志。服务器日志记录人为可读的服务器状态信息，而审核日志维护服务器上执行的每个操作加密后的信息。
+
+## 2.服务器日志
+
+### 2.1.服务器日志配置项
+
+服务器日志的输出位置可以通过`log_dir`配置指定。服务器日志详细程度可通过`verbose`配置项指定。
+
+`log_dir`配置项默认为空。若`log_dir`为空，则所有日志会输出到控制台；若手动指定`log_dir`，则日志文件会生成在对应的路径下面，单个日志文件最大大小为256MB。
+
+`verbose`配置项控制日志的详细程度，从粗到细分为`0, 1, 2`三个等级，默认等级为`1`。等级为`2`时，日志记录最详细，服务器将打印`DEBUG`及以上等级的全部日志信息；等级为`1`时，服务器将仅打印`INFO`等级及以上的主要事件的日志；等级为`0`时，服务器将仅打印`ERROR`等级及以上的错误日志。
+
+### 2.3.服务器日志输出宏使用示例
+
+如果开发者在开发过程中希望在代码中添加日志，可以参考如下示例
+
+```
+#include "tools/lgraph_log.h" //添加日志依赖
+
+
+void LogExample() {
+    // 数据库启动阶段已经对日志模块进行了初始化，开发者只需直接调用宏即可
+    // 日志等级分为DEBUG, INFO, WARNING, ERROR, FATAL五个等级
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+更多用法可以参考test/test_lgraph_log.cpp中的日志宏的使用方法
+
+## 3.审计日志
+
+审核日志记录每个请求和响应，以及发送请求的用户以及收到请求的时间。审核日志只能是打开或关闭状态。可以使用 TuGraph 可视化工具和 REST API 查询结果。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md
new file mode 100644
index 0000000000..1a62bd27a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/5.restful.md
@@ -0,0 +1,198 @@
+# TuGraph-Restful-Server
+
+> TuGraph Restful Server 强依赖 TuGraph，Restful Server 与 Tugraph 共存
+
+## 1.TuGraph-Restful-Server 简介
+TuGraph Restful Server 使用brpc框架支持的http协议，提供restful接口查询功能，在实现中，restful server 与rpc server 使用同一个端口。目前restful接口提供文件上传，数据导入，导入进度查询，cypher查询，文件删除等功能
+
+## 2.启动 TuGraph-Restful-Server
+需要在启动Tugraph时设置enable_rpc参数为true的方式，正常启动TuGraph
+
+## 3.连接 TuGraph-Restful-Server
+TuGraph正常启动后，Restful Server 将监听在rpc_port上， 通过访问 http://${ip}:${rpc_port}/LGraphHttpService/Query/ url可以链接到TuGraph
+
+## 4.数据格式
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+## 5.返回值
+
+通用返回格式
+
+|  body参数  | 参数说明  |  参数类型  |  是否必填  |
+|:--------:|:-----:|:------:| :-----: |
+| errorCode |  状态码  |  字符串  |  是  |
+| errorMessage | 错误信息  |  字符串  |  是  |
+| data | 返回的数据 |  字符串  |  是  |
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 401 Unauthorized: 未通过鉴权认证，例如用户名密码错误，token超过有效期等
+- 500 Internal Server Error: 服务器端错误
+  当操作成功时，返回的 data 中包含操作的返回值。
+  当发生输入错误或者服务器错误时，返回的 errorMessage 中包含错误提示。
+
+## 6.URI格式
+
+| URI               | 说明                 |
+|-------------------|--------------------|
+| /cypher           | 执行cypher查询请求       |
+| /refresh          | 刷新token请求          |
+| /login            | 用户登陆请求             |
+| /logout           | 用户登出请求             |
+| /upload_files     | 上传文件请求             |
+| /clear_cache      | 清理用户上传文件请求         |
+| /check_file       | 文件认证请求             |
+| /import_data      | 数据导入请求             |
+| /import_progress  | 导入进度查询请求           |
+| /import_schema    | 批量创建schema请求       |
+
+## 7.接口
+### 7.1 用户登陆
+用于用户第一次与服务端通信时的鉴权操作，请求报文在 http body 中携带用户名和密码，响应报文在 http body 中会返回一个带有有效期的token，后续请求中需要在http header中携带该token作为凭证
+#### 7.1.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/login
+#### 7.1.2 REQUEST
+|  body参数  |  参数说明  |  参数类型  |  是否必填  |
+|:--------:|:------:|:------:| :-----: |
+ | userName |  用户名  |  字符串  |  是  |
+ | password |   密码   |  字符串  |  是  |
+#### 7.1.3 RESPONSE
+|    body参数     | 参数说明  |  参数类型  |  是否必填  |
+|:-------------:|:-----:|:------:| :-----: |
+| authorization | token |  字符串  |  是  |
+
+### 7.2 刷新token
+token到期后将无法使用此token与服务端正常通信，需要获取新的token作为后续请求的凭证，请求报文在http header中携带旧的token，响应报文在http body中返回新的token
+#### 7.2.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/refresh
+#### 7.2.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+#### 7.2.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| authorization | 新的token |  字符串  |  是  |
+
+### 7.3 用户登出
+用户不再需要与服务端进行通信时，需要请求登出接口，释放自己的token。请求报文在http header中携带旧的token，如果拿到返回errorCode为200的响应报文即为正常登出
+#### 7.3.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/logout
+#### 7.3.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+### 7.4 执行cypher查询请求
+用户通过此类请求发cypher给server端执行并获取执行结果，请求报文在http body 中将执行的cypher语句和目标子图发送给server，server执行完成后在响应报文的http body中返回执行结果
+#### 7.4.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/cypher
+
+#### 7.4.2 REQUEST
+| body参数 |    参数说明    |  参数类型  |  是否必填  |
+|:------:|:----------:|:------:| :-----: |
+| graph  |   查询目标子图   |  字符串  |  是  |
+| script | cypher查询语句 |  字符串  |  是  |
+
+#### 7.4.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| result | 返回结果 |  字符串  |  是  |
+
+### 7.5 上传文件请求
+用户通过此类请求向server发送文件，可以对文件进行分片，分片大小不大于1MB，支持多线程乱序发送，请求报文在http header 中包含文件名，第一字节内容在文件中的偏移和分片大小，在body中包含文件内容，server收到请求后将验证分片大小是否与分片内容一致，一致时将文件分段写入文件。不一致时将返回errorCode为400的响应
+#### 7.5.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/upload_files
+
+#### 7.5.2 REQUEST
+| header参数  |    参数说明    |  参数类型  |  是否必填  |
+|:---------:|:----------:|:------:| :-----: |
+| File-Name |   文件名   |  字符串  |  是  |
+| Begin-Pos | 开始位置在文件内的偏移 |  字符串  |  是  |
+|   Size    | 文件分片大小 |  字符串  |  是  |
+|  body参数   |  参数说明   |  参数类型  |  是否必填  |
+|     -     | 文件内容 |  字符串  |  是  |
+
+### 7.6 文件认证请求
+用户通过此类请求验证发送到server端的文件是否与期望一致，server端使用两种验证方式，md5值和文件长度，目前已支持文件长度验证。
+#### 7.6.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/check_file
+#### 7.6.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| fileName |           文件名           |  字符串  |  是  |
+| checkSum |        文件对应md5值         |  字符串  |  否  |
+| fileSize |       文件长度(以字节计算)       |  字符串  |  否  |
+| flag | 标记位，为1时校验md5值，为2时校验文件长度 |  字符串  |  是  |
+
+#### 7.6.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| pass | 检查成功为true，否则为false |  bool  |  是  |
+
+### 7.7 批量创建schema请求
+用户通过此类请求批量创建schema，请求报文在http body 中将创建schema的目标子图和schema信息发送给server，如果拿到返回errorCode为200的响应报文即为正常创建
+#### 7.7.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_schema
+#### 7.7.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| graph |   创建目标子图   |  字符串  |  是  |
+| schema | schema描述信息 |  字符串  |  是  |
+
+### 7.8 数据导入请求
+用户通过此类请求导入已经上传的数据文件。导入不论成功或失败，都将删除已上传文件。数据导入请求在server中实现为一个异步任务，响应返回并不意味着导入已完成，返回的是任务id，后续可以通过此任务id查询导入进度
+#### 7.8.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_data
+#### 7.8.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  | 是否必填 |
+|:--------:|:-----------------------:|:------:|:----:|
+| graph |         导入目标子图          |  字符串  |  是   |
+| schema |       导入schema描述        | json字符串  |  是   |
+| delimiter |           分隔符           |  字符串  |  是   |
+| continueOnError |     单行数据出错是否跳过错误并继续     |  boolean  |  否   |
+| skipPackages |         跳过的包个数          |  字符串  |  否   |
+| taskId |  任务id   |  字符串  |  否   |
+| other | 其他参数 |  json字符串  |  否   |
+
+#### 7.8.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| taskId | 任务编号 |  字符串  |  是  |
+
+### 7.9 清理用户上传文件请求
+用户通过此类请求清理已经上传的文件，如果拿到返回errorCode为200的响应报文即为正常清理
+#### 7.9.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/clear_cache
+#### 7.9.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| fileName |    文件名称    |  字符串  |  否  |
+| userName |    用户名称    |  字符串  |  否  |
+| flag | 标记位， flag = 0时删除fileName指定文件, flag = 1时删除userName指定用户已经上传的所有文件， flag = 2时删除所有用户上传的文件 |  字符串  |  是  |
+
+### 7.10. 导入进度查询请求
+用户通过此类请求获得导入任务的状态
+#### 7.10.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_progress
+#### 7.10.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| taskId |           任务编号           |  字符串  |  是  |
+
+#### 7.10.3 RESPONSE
+| body参数 |                  参数说明                   |  参数类型  |  是否必填  |
+|:------:|:---------------------------------------:|:------:| :-----: |
+| state  | 状态标记，为0表示准备导入，为1表示导入中，为2表示导入成功，为3表示导入失败 |  字符串  |  是  |
+|  progress  |             导入进度，state为1时包含             |  字符串  |  否  |
+|  reason  |             失败原因，state为3时包含             |  字符串  |  否  |
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst
new file mode 100644
index 0000000000..bf92f16478
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/5.ecosystem-tools/index.rst
@@ -0,0 +1,8 @@
+生态工具
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/1.cypher.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/1.cypher.md
new file mode 100644
index 0000000000..0f25686fa8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/1.cypher.md
@@ -0,0 +1,2349 @@
+# Cypher API
+
+> 此文档主要介绍了TuGraph-Cypher的详细使用说明
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators支持进度一览：
+
+| 类别                                 | 支持                                                                                                        | 待支持                             |
+| ------------------------------------ | ----------------------------------------------------------------------------------------------------------- | ---------------------------------- |
+| General operators                    | `DISTINCT`, `.` for property access                                                                     | `[]` for dynamic property access |
+| Mathematical operators               | `+`, `-`, `*`, `/`, `%`, `^`                                                                    |                                    |
+| Comparison operators                 | `=`, `<>`, `<`, `>`, `<=`, `>=`, `IS NULL`, `IS NOT NULL`                                   |                                    |
+| String-specific comparison operators | `STARTS WITH`, `ENDS WITH`, `CONTAINS`, `REGEXP`                                                    |                                    |
+| Boolean operators                    | `AND`, `OR`, `XOR`, `NOT`                                                                           |                                    |
+| String operators                     | `+` for concatenation                                                                                     |                                    |
+| List operators                       | `+` for concatenation, `IN` to check existence of an element in a list, `[]` for accessing element(s) |                                    |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+```
+MATCH (p:person) RETURN DISTINCT p.born
+```
+
+- ❏ Accessing properties of a nested literal map using the `.` operator
+
+```
+WITH {person: {name: 'Anne', age: 25}} AS p
+RETURN p.person.name
+```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+
+```
+CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+       (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+       (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+```
+
+```
+MATCH (restaurant:Restaurant), (category:Category)
+WHERE restaurant["rating_" + category.name] > 6
+RETURN DISTINCT restaurant.name
+```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator  `^`
+
+```
+WITH 2 AS number, 3 AS exponent
+RETURN number ^ exponent AS result
+```
+
+- ✓ Using the unary minus operator `-`
+
+```
+WITH -3 AS a, 4 AS b
+RETURN b - a AS result
+```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+
+```
+WITH 4 AS one, 3 AS two
+RETURN one > two AS result
+```
+ 
+### 1.5.String-specific comparison operators
+
+- ✓ Using STARTS WITH to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate STARTS WITH 'Jo'
+RETURN candidate
+```
+
+- ✓ Using REGEXP to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate REGEXP 'Jo.*n'
+RETURN candidate
+```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+```
+WITH [2, 4, 7, 9, 12] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number = 4 OR (number > 6 AND number < 10)
+RETURN number
+```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+
+```
+RETURN [1,2,3,4,5]+[6,7] AS myList
+```
+
+- ✓ Using IN to check if a number is in a list
+
+```
+WITH [2, 3, 4, 5] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number IN [2, 3, 8]
+RETURN number
+```
+
+- ✓ Accessing elements in a list using the [] operator
+
+```
+WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+RETURN names[1..3] AS result
+```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses支持进度一览：
+
+| 类别                    | 语法                                  | 备注   |
+| ----------------------- | ------------------------------------- | ------ |
+| Reading clauses         | MATCH                                 | 支持   |
+|                         | OPTIONAL MATCH                        | 支持   |
+|                         | MANDATORY MATCH                       | 待支持 |
+| Projecting clauses      | RETURN … [AS]                        | 支持   |
+|                         | WITH … [AS]                          | 支持   |
+|                         | UNWIND … [AS]                        | 支持   |
+| Reading sub-clauses     | WHERE                                 | 支持   |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | 支持   |
+|                         | SKIP                                  | 支持   |
+|                         | LIMIT                                 | 支持   |
+| Writing clauses         | CREATE                                | 支持   |
+|                         | DELETE                                | 支持   |
+|                         | DETACH DELETE                         | 支持   |
+|                         | SET                                   | 支持   |
+|                         | REMOVE                                | 支持   |
+| Reading/Writing clauses | MERGE                                 | 支持   |
+|                         | CALL […YIELD]                        | 支持   |
+| Set operations          | UNION                                 | 待支持 |
+|                         | UNION ALL                             | 支持   |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+
+  ```
+  MATCH (n)
+  RETURN n
+  ```
+
+  - ✓ Get all nodes with a label
+
+  ```
+  MATCH (movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Related nodes
+
+  ```
+  MATCH (person {name: 'Laurence Fishburne'})-[]-(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Match with labels
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]-(movie:movie)
+  RETURN movie.title
+  ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]->(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Directed relationships and variable
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[r]->(movie)
+  RETURN type(r)
+  ```
+
+  - ✓ Match on relationship type
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})<-[:acted_in]-(actor)
+  RETURN actor.name
+  ```
+
+  - ✓ Match on multiple relationship types
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[:acted_in|:directed]-(person)
+  RETURN person.name
+  ```
+
+  - ✓ Match on relationship type and use a variable
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[r:acted_in]-(actor)
+  RETURN r.role
+  ```
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+
+  ```
+  MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+  RETURN type(r)
+  ```
+
+  - ✓ Multiple relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in]->(movie)<-[:directed]-(director)
+  RETURN movie.title, director.name
+  ```
+
+  - ✓ Variable-length relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in*1..3]-(movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Relationship variable in variable-length relationships
+
+  ```
+  MATCH p = (laurence {name: 'Laurence Fishburne'})-[:acted_in*2]-(co_actor)
+  RETURN p
+  ```
+
+  - ❏ Match with properties on a variable-length path
+
+  ```
+  MATCH p = (charlie:person)-[* {blocked:false}]-(martin:person)
+  WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+  RETURN p
+  ```
+
+  - ✓ Zero-length paths
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})-[*0..1]-(x)
+  RETURN x
+  ```
+
+  - ✓ Named paths
+
+  ```
+  MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+  ```
+
+  - ✓ Matching on a bound relationship
+
+  ```
+  MATCH (a)-[r]->(b)
+  WHERE euid(r)="0_3937_0_0_0"
+  RETURN a,b
+  ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+  CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+  ```
+
+  - ✓ All shortest paths
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+  CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN
+  nodeIds,relationshipIds,cost
+  ```
+- Get node or relationship by id
+
+  - ✓ Node by id
+
+  ```
+  MATCH (n)
+  WHERE id(n)= 0
+  RETURN n
+  ```
+
+  - ✓ Relationship by id
+
+  ```
+  MATCH ()-[r]->()
+  WHERE euid(r) = "0_3937_0_0_0"
+  RETURN r
+  ```
+
+  - ✓ Multiple nodes by id
+
+  ```
+  MATCH (n)
+  WHERE id(n) IN [0, 3, 5]
+  RETURN n
+  ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n
+```
+
+- ✓ Return relationships
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'})-[r:acted_in]->(c)
+RETURN r
+```
+
+- ✓ Return property
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n.born
+```
+
+- ❏ Return all elements
+
+```
+MATCH p = (a {name: 'A'})-[r]->(b)
+RETURN *
+```
+
+- ❏ Variable with uncommon characters
+
+```
+MATCH (`This isn\'t a common variable`)
+WHERE `This isn\'t a common variable`.name = 'A'
+RETURN `This isn\'t a common variable`.happy
+```
+
+- ✓ Aliasing a field
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born AS SomethingTotallyDifferent
+```
+
+- ✓ Optional properties
+
+```
+MATCH (n)
+RETURN n.age
+```
+
+- ❏ Other expressions
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born > 1900, "I'm a literal", (a)-[]->()
+```
+
+`(a)-[]->()`  not supported.
+
+- ✓ Unique results
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})-[]->(b)
+RETURN DISTINCT b
+```
+
+### 2.4.WHERE
+
+- Basic usage
+  - ✓ Boolean operations
+
+  ```
+  MATCH (n)
+  WHERE n.name = 'Laurence Fishburne' XOR (n.born > 1965 AND n.name = 'Carrie-Anne Moss')
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node label
+
+  ```
+  MATCH (n)
+  WHERE n:person
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node property
+
+  ```
+  MATCH (n)
+  WHERE n.born > 2000
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on relationship property
+
+  ```
+  MATCH (n)-[k:acted_in]->(f)
+  WHERE k.role = "Trinity"
+  RETURN f.title
+  ```
+
+  - ❏ Filter on dynamically-computed property
+
+  ```
+  WITH 'AGE' AS propname
+  MATCH (n)
+  WHERE n[toLower(propname)]< 30
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Property existence checking
+
+  ```
+  MATCH (n)
+  WHERE exists(n.born)
+  RETURN n.name, n.born
+  ```
+
+- String matching
+  - ✓ Match the beginning of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name STARTS WITH 'Pet'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match the ending of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name ENDS WITH 'ter'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match anywhere within a string
+
+  ```
+  MATCH (n)
+  WHERE n.name CONTAINS 'ete'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ String matching negation
+
+  ```
+  MATCH (n)
+  WHERE NOT n.name ENDS WITH 's'
+  RETURN n.name, n.born
+  ```
+
+- Using path patterns in `WHERE`
+  - ❏ Filter on patterns
+
+  ```
+  MATCH (tobias {name: 'Tobias'}), (others)
+  WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+  RETURN others.name, others.age
+  ```
+
+  - ❏ Filter on patterns using NOT
+
+  ```
+  MATCH (persons), (peter {name: 'Peter'})
+  WHERE NOT (persons)-[]->(peter)
+  RETURN persons.name, persons.age
+  ```
+
+  - ❏ Filter on patterns with properties
+
+  ```
+  MATCH (n)
+  WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Filter on relationship type
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name='Laurence Fishburne' AND type(r) STARTS WITH 'ac'
+  RETURN type(r), r.role
+  ```
+
+- Lists
+  - ✓ IN operator
+
+  ```
+  MATCH (a)
+  WHERE a.name IN ['Laurence Fishburne', 'Tobias']
+  RETURN a.name, a.born
+  ```
+
+- Missing properties and values
+  - ✓ Default to false if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white'
+  RETURN n.name, n.age, n.belt
+  ```
+
+  - ✓ Default to true if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+  ORDER BY n.name
+  ```
+
+  - ✓ Filter on null
+
+  ```
+  MATCH (person)
+  WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+  person.belt
+  ```
+
+- Using ranges
+  - ✓ Simple range
+
+  ```
+  MATCH (a)
+  WHERE a.name >= 'Peter'
+  RETURN a.name, a.born
+  ```
+
+  - ✓ Composite range
+
+  ```
+  MATCH (a)
+  WHERE a.name > 'Andres' AND a.name < 'Tobias'
+  RETURN a.name, a.born
+  ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 3
+```
+
+- ✓ Return middle two records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 1
+LIMIT 2
+```
+
+- ❏ Using an expression with SKIP to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP toInteger(3*rand())+ 1
+```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT 3
+```
+
+- ❏ Using an expression with LIMIT to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT toInteger(3 * rand())+ 1
+```
+
+### 2.7.CREATE
+
+- Create nodes
+
+> **Note**
+> TuGraph不支持创建空的nodes，不支持多labels。
+
+  - ☒ Create single node
+
+  ```
+  CREATE (n)
+  ```
+
+  - ☒ Create multiple nodes
+
+  ```
+  CREATE (n), (m)
+  ```
+
+  - ☒ Create a node with a label
+
+  ```
+  CREATE (n:person)
+  ```
+
+  - ☒ Create a node with multiple labels
+
+  ```
+  CREATE (n:Person:Swedish)
+  ```
+
+  - ✓ Create node and add labels and properties
+
+  ```
+  CREATE (n:person {id:2001, name: 'Andres'})
+  ```
+
+  - ✓ Return created node
+
+  ```
+  CREATE (n:person {id:2002, name: 'Andres'})
+  RETURN n
+  ```
+
+- Create relationships
+  - ✓ Create a relationship between two nodes
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:write]->(m)
+  ```
+
+  - ✓ Create a relationship and set properties
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:acted_in{role: 'Trinity'}]->(m)
+  ```
+
+  - ❏ Create a full path
+
+  ```
+  CREATE p = (andres:person {id: 2005, name:'Andres'})-[:acted_in {role: 'Trinity'}]->
+  (m:movie {id: 2006})<-[:acted_in {role: 'Trinity'}]-(michael {id: 2006, name:'Michael'})
+  RETURN p
+  ```
+
+- Use parameters with CREATE
+  - ❏ Create node with a parameter for the properties
+
+  ```
+  CREATE (n:Person $props)
+  RETURN n
+  ```
+
+  - ☒ Create multiple nodes with a parameter for their properties
+
+  ```
+  UNWIND $props AS map
+  CREATE (n)
+  SET n = map
+  ```
+  cannot create vertex without label.
+
+### 2.8.CALL[…YIELD]
+
+- ✓ Call a procedure using CALL
+
+```
+CALL db.vertexLabels
+```
+
+- ✓ View the signature for a procedure
+
+```
+CALL dbms.procedures() YIELD name, signature
+RETURN signature
+```
+
+- ❏ Call a procedure using a quoted namespace and name
+
+```
+CALL `db`.`vertexLabels`
+```
+
+- ✓ Call a procedure with literal arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+```
+
+- ❏ Call a procedure with parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+```
+
+- ❏ Call a procedure with mixed literal and parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+```
+
+- ✓ Call a procedure with literal and default arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+```
+
+- ✓ Call a procedure within a complex query using CALL…YIELD
+
+```
+CALL db.vertexLabels() YIELD label
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure and filter its results
+
+```
+CALL db.vertexLabels() YIELD label
+WHERE label CONTAINS 'User'
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure within a complex query and rename its outputs
+
+```
+CALL db.propertyKeys() YIELD propertyKey AS prop
+MATCH (n)
+WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+
+```
+MATCH (n:person)
+RETURN n.name AS name
+UNION ALL MATCH (n:movie)
+RETURN n.title AS name
+```
+
+- ❏ Combine two queries and remove duplicates
+
+```
+MATCH (n:Actor)
+RETURN n.name AS name
+UNION
+MATCH (n:Movie)
+RETURN n.title AS name
+```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| 种类                   | 功能               | 备注                      |
+| ---------------------- | ------------------ | ------------------------- |
+| Predicate functions    | exists()           |                           |
+|                        | all()              | 不支持                    |
+|                        | any()              | 不支持                    |
+|                        | single()           | 不支持                    |
+|                        | none()             | 不支持                    |
+| Scalar functions       | id()               |                           |
+|                        | euid()             |                           |
+|                        | properties()       |                           |
+|                        | head()             |                           |
+|                        | last()             |                           |
+|                        | toBoolean()        |                           |
+|                        | toFloat()          |                           |
+|                        | toInteger()        |                           |
+|                        | toString()         |                           |
+|                        | type()             |                           |
+|                        | startnode()        |                           |
+|                        | endnode()          |                           |
+|                        | size()             |                           |
+|                        | length()           |                           |
+|                        | label()            | OpenCypher扩展方法      |
+| Aggregating functions  | avg()              |                           |
+|                        | collect()          |                           |
+|                        | count()            |                           |
+|                        | max()              |                           |
+|                        | min()              |                           |
+|                        | percentileCont()   |                           |
+|                        | percentileDisc()   |                           |
+|                        | stDev()            |                           |
+|                        | stDevP()           |                           |
+|                        | variance()         |                           |
+|                        | varianceP()        |                           |
+|                        | sum()              |                           |
+| List functions         | keys()             |                           |
+|                        | labels()           | 返回结果有且只有一个label |
+|                        | nodes()            |                           |
+|                        | range()            |                           |
+|                        | subscript()        | 不支持                    |
+| Mathematical functions | abs()              |                           |
+|                        | ceil()             |                           |
+|                        | floor()            |                           |
+|                        | rand()             |                           |
+|                        | round()            |                           |
+|                        | sign()             |                           |
+| String functions       | /                  |                           |
+
+### 3.2.Predicate functions
+
+- exists()
+  judge it whether a vertex or edge has the field  .
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+WHERE exists(n.born)
+RETURN n.name, n.born
+```
+
+**Example output:**
+
+| exists(name) |
+| ------------ |
+| true         |
+
+### 3.3.Scalar functions
+
+- id()
+  get the id of vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN id(a)
+```
+
+**Example output:**
+
+| vid |
+| --- |
+| 1   |
+| 2   |
+| ... |
+
+- properties()
+  get  a map containing all the properties of a node or relationship.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person {name: 'Laurence Fishburne'})
+RETURN n
+```
+
+- head()
+  get the first element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, head(coll)
+```
+
+**Example output:**
+
+| coll                  | head(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "one"         |
+
+- last()
+  get the last element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, last(coll)
+```
+
+**Example output:**
+
+| coll                  | last(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "three"       |
+
+- toFloat()
+  Converts an integer or string value to a floating point number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toFloat('11.5')
+```
+
+**Example output:**
+
+| float |
+| ----- |
+| 11.5  |
+
+- toInteger()
+  Converts a floating point or string value to an integer value.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toInteger('2.3') AS integer
+```
+
+**Example output:**
+
+| integer |
+| ------- |
+| 2       |
+
+- toString()
+  Converts an integer, float, boolean value to a string.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toString(2.3)
+```
+
+- type()
+  get the string representation of the relationship type.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)-[r]->()
+WHERE n.name = 'Laurence Fishburne'
+RETURN type(r)
+```
+
+**Example output:**
+
+| type     |
+| -------- |
+| acted_in |
+| acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+  Returns the average of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN avg(n.born)
+```
+
+**Example output:**
+
+| avg(n.born)        |
+| ------------------ |
+| 1869.2661654135338 |
+
+- collect()
+  Returns a list containing the values returned by an expression.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN collect(n.born)
+```
+
+**Example output:**
+
+| collect(n.born) |
+| --------------- |
+| [1967,...]      |
+
+- count()
+  Returns the number of values or records.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n {name: 'Laurence Fishburne'})-[]->(x)
+RETURN labels(n), n.born, count(*)
+```
+
+**Example output:**
+
+| labels(n)  | n.born | count(*) |
+| ---------- | ------ | -------- |
+| ["person"] | 1961   | 3        |
+
+- max()
+  Returns the maximum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN max(n.born)
+```
+
+**Example output:**
+
+| max(n.born) |
+| ----------- |
+| 2003        |
+
+- min()
+  Returns the minimum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN min(n.born)
+```
+
+**Example output:**
+
+| min(n.born) |
+| ----------- |
+| 1000        |
+
+- percentileCont()
+  Returns the percentile of a value over a group using linear interpolation.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileCont(n.born, 0.4)
+```
+
+**Example output:**
+
+| percentileCont(n.born, 0.4) |
+| --------------------------- |
+| 1953                        |
+
+- percentileDisc()
+  Returns the nearest value to the given percentile over a group using a rounding method.
+  **Scope:** whole instance.
+  **Output:** the percentile of the given value over a group.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileDisc(n.born, 0.5)
+```
+
+**Example output:**
+
+| percentileDisc(n.age, 0.5) |
+| -------------------------- |
+| 1959                       |
+
+- stDev()
+  Returns the standard deviation for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDev(n.born)
+```
+
+**Example output:**
+
+| stDev(n.born)      |
+| ------------------ |
+| 279.53117993401725 |
+
+- stDevP()
+  Returns the standard deviation for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDevP(n.born)
+```
+
+**Example output:**
+
+| stDevP(n.born)     |
+| ------------------ |
+| 279.3209270423399  |
+
+- variance()
+  Returns the variance for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN variance(n.born)
+```
+
+**Example output:**
+
+| variance(n.age)   |
+| ----------------- |
+| 78137.68055530392 |
+
+- varianceP()
+  Returns the variance for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN varianceP(n.born)
+```
+
+**Example output:**
+
+| varianceP(n.age)  |
+| ----------------- |
+| 78020.18028379219 |
+
+- sum()
+  Returns the sum of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN sum(n.born)
+```
+
+**Example output:**
+
+| sum(n.born) |
+| ----------- |
+| 1243062     |
+
+### 3.5.List Funtions:
+
+- keys()
+  get the field names of some vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN keys(a) LIMIT 1
+```
+
+**Example output:**
+
+| keys(a)               |
+| --------------------- |
+| ["name","age","eyes"] |
+
+- labels()/label()
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN labels(a) LIMIT 1
+```
+
+**Example output:**
+
+| labels                 |
+| ---------------------- |
+| ["Person"]             |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice"})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+
+### 3.6.Mathematical functions
+
+- abs()
+  get the absolute value of some data.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a:person {name: 'Laurence Fishburne'}),
+(e:person {name: 'Carrie-Anne Moss'})
+RETURN a.born, e.born, abs(a.born-e.born)
+```
+
+**Example output:**
+
+| a.born | e.born | abs(a.born - e.born) |
+| ------ | ------ | -------------------- |
+| 38     | 41     | 1                    |
+
+- ceil()
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN ceil(0.1)
+```
+
+**Example output:**
+
+| ceil(0.1) |
+| --------- |
+| 1.0       |
+
+- floor()
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN floor(0.9)
+```
+
+**Example output:**
+
+| floor(0.9) |
+| ---------- |
+| 0.0        |
+
+- round()
+  Returns the value of a number rounded to the nearest integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN round(3.141592)
+```
+
+**Example output:**
+
+| round |
+| ----- |
+| 3     |
+
+- rand()
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN rand()
+```
+
+**Example output:**
+
+| rand()             |
+| ------------------ |
+| 0.9797131960534085 |
+
+- sign()
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN sign(-17), sign(0.1)
+```
+
+**Example output:**
+
+| sign(-17) | sign(0.1) |
+| --------- | --------- |
+| -1        | 1         |
+
+TuGraph 查询语言与 OpenCypher 的不同点如下：
+
+- Label 数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 4.附录1. 语法扩充及不同
+
+TuGraph查询语言与OpenCypher的不同点如下：
+
+- Label数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.附录2. 内置procedures列表
+### 5.1.procedures样例
+
+* dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                        | name         |
+  | ---------------------------------------------------- | -------------------- |
+  | db.vertexLabels() :: (label::STRING)               | db.vertexLabels        |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels |
+  | db.indexes() :: (index::LIST)            | db.indexes       |
+  | ...                          | ...          |
+
+* db.subgraph()
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | vids       | list           | list of vertex id                                                     |
+
+  **Output:**
+
+  Get a json containing all the properties of nodes and relationships.
+
+  **Example input:**
+
+  ```
+  CALL db.subgraph([3937,4126,4066,4010])
+  ```
+
+  **Example output**
+
+  | subgraph |
+  | -------- |
+  | {"nodes":[{"identity":3937,"label":"movie","properties":{"duration":136,"id":1,"poster_image":"http://image.tmdb.org/t/p/w185/gynBNzwyaHKtXqlEKKLioNkjKgN.jpg","rated":"R","summary":"Thomas A. Anderson is a man living two lives. By day he is an average computer programmer and by night a malevolent hacker known as Neo who finds himself targeted by the police when he is contacted by Morpheus a legendary computer hacker who reveals the shocking truth about our reality.","tagline":"Welcome to the Real World.","title":"The Matrix"}},{"identity":4010,"label":"user","properties":{"id":44,"login":"Howard"}},{"identity":4066,"label":"user","properties":{"id":202,"login":"Enoch"}},{"identity":4126,"label":"user","properties":{"id":464,"login":"Wilburn"}}],"relationships":[{"dst":4126,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4010,"temporal_id":0},{"dst":4010,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4066,"temporal_id":0},{"dst":4066,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4126,"temporal_id":0}]} |
+
+* db.vertexLabels()
+
+  Lists all available vertex labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+  **Example output:**
+
+    | label   |
+    | ------- |
+    | genre   |
+    | keyword |
+    | movie   |
+    | ...     |
+
+* db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edge labels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | relationshipType |
+  | ---------------- |
+  | acted_in     |
+  | directed     |
+  | ...          |
+
+* db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of  vertex label    |
+  | primary_field | string  | primary field of vertex label |
+  | field_spec | list       | specification of a field |
+
+   in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+    **Output:** If successful, it returns a success message.
+
+    **Example input:**
+
+    ```
+    CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+    ```
+
+    **Example output:**
+
+    ```
+    Added label [Person]
+    ```
+
+* db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description           |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field         |
+  | type       | string     | type of the field         |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name     | type   | optional |
+  | ------------ | ------ | -------- |
+  | id       | INT32  | false    |
+  | born     | INT32  | true     |
+  | name     | STRING | true     |
+  | poster_image | STRING | true     |
+
+* db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | extra      | string     | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.
+    for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+* db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:**
+
+  | field_name | field_type | description              |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description           |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string      | either 'vertex' or 'edge'     |
+  | label_name  | string      | name of the label         |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description           |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string     | either 'vertex' or 'edge' |
+  | label_name       | string     | name of the label     |
+  | field_value_spec | list       | specification of a field  |
+
+    in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, optional]`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+    ```
+    CALL db.alterLabelModFields(
+    'vertex',
+    'new_label',
+    ['birth_date', DATETIME, true],
+    ['gender', BOOL, true])
+    ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of the label    |
+  | edge_constraints | string | edge constraints |
+  | field_spec | list       | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for  optional fields.
+
+  `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+* db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+
+   **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+   **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+* db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+  | pair_unique | boolean    | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+* dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description      |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string     | the current password |
+  | new_password     | string     | new password     |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+   **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string     | the user's name |
+  | new_password | string     | new password    |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.createUser(user_name, password)
+
+  create  new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | -------------------------------- |
+  | user_name | string     | the new user name        |
+  | password  | string     | the password of new user     |
+  
+   **Output:**
+  
+    If successful, it returns a success message.
+  
+   **Example input:**
+  
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+  
+   **Example output:**
+  
+  ```
+  true
+  ```
+  
+* dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string     | the user name to be deleted |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+   a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string     | the user name           |
+  | is.admin  | boolean    | the permission of this user |
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       |  ...    |
+
+* dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+    a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description       |
+  | --------- | -------------- | --------------------- |
+  | user.user | string     | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+* dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+   a list of  ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host     |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...      |
+
+* dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+   the number of ip which been deleted.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+    the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description              |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string     | the name of new subgraph     |
+  | description | string     | description of new subgraph      |
+  | max_size_GB | integer    | Upper limit of subgraph capacity |
+
+   **Output:**
+
+    if successful , it will return true.
+
+   **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+   **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+  | config     | map        | the configuration to be modified     |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.listGraphs()
+
+  get all subgraphs in this graph database.
+
+  **Output:**
+
+    a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+
+* dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+    | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+* dbms.config.list()
+
+  get config of this graph database.
+
+  **Output:**
+
+    a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  |-----------| ---------|
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       |  ...    |
+
+* dbms.config.update(updates)
+
+  get some config of this graph database.
+
+  **Output:**
+
+    If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+    enable_ip_check:false,
+    durable:true,
+    optimistic_txn:true,
+    enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+* dbms.takeSnapshot()
+
+  take the  snapshot  on this current graph database.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+* dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path               |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+* algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                          |
+  | --------- | -------------- | ------------------------------------------------------------ |
+  | startNode | Node       | the source node of paths                     |
+  | endNode   | Node       | the destination node paths                   |
+  | config    | MAP        | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+    If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2     | 1     |
+
+* algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+* algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                        |
+  | --------- | -------------- | ---------------------------------------------------------- |
+  | id    | ANY        | the id of vertexes or edges , the id must be variable      |
+  | config    | MAP        | the configuration of  this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or  it is an edge id.
+
+  **Output:**
+
+    If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.内置procedures完整列表
+
+| Name                                  | Description                        | Signature                                                                                                                                                                        |
+|---------------------------------------|------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.subgraph                           | 列出点的子图                             | db.subgraph(vids::LIST) :: (subgraph::STRING)                                                                                                                                    |
+| db.vertexLabels                       | 列出所有Vertex Label                   | db.vertexLabels() :: (label::STRING)                                                                                                                                             |
+| db.edgeLabels                         | 列出所有Edge Label                     | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                          |
+| db.indexes                            | 列出所有索引                             | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                             |
+| db.listLabelIndexes                   | 列出所有与某个Label相关的索引               | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                   |
+| db.warmup                             | 预热数据                               | db.warmup() :: (time_used::STRING)                                                                                                                                               |
+| db.createVertexLabel                  | 创建Vertex Label                     | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                           |
+| db.createLabel                        | 创建Vertex/Edge Label                | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                      |
+| db.getLabelSchema                     | 列出label schema                     | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                        |
+| db.getVertexSchema                    | 列出点的 schema                        | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                               |
+| db.getEdgeSchema                      | 列出边的 schema                        | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                 |
+| db.deleteLabel                        | 删除Vertex/Edge Label                | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                |
+| db.alterLabelDelFields                | 修改label删除属性                        | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                     |
+| db.alterLabelAddFields                | 修改label添加field                     | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                          |
+| db.alterLabelModFields                | 修改label field                      | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                |
+| db.createEdgeLabel                    | 创建Edge Label                       | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                              |
+| db.addIndex                           | 创建索引                               | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                   |
+| db.addEdgeIndex                       | 创建索引                               | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                          |
+| db.deleteIndex                        | 删除索引                               | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                |
+| db.backup                             | 备份数据                               | db.backup(destination::STRING) :: ()                                                                                                                                             |
+| dbms.procedures                       | 列出所有procedures                     | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                            |
+| dbms.security.changePassword          | 更改当前用户的密码                          | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                          |
+| dbms.security.changeUserPassword      | 更改指定用户的密码                          | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                             |
+| dbms.security.createUser              | 创建用户                               | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                         |
+| dbms.security.deleteUser              | 删除用户                               | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                          |
+| dbms.security.listUsers               | 列出所有用户                             | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                  |
+| dbms.security.showCurrentUser         | 列出当前用户信息                           | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                        |
+| dbms.security.getUserPermissions      | 列出指定用户的权限                          | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                          |
+| dbms.graph.createGraph                | 创建子图                               | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                |
+| dbms.graph.modGraph                   | 修改子图属性                             | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                  |
+| dbms.graph.deleteGraph                | 删除子图                               | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                           |
+| dbms.graph.listGraphs                 | 列出所有子图                             | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                               |
+| dbms.graph.getGraphInfo               | 列出指定子图的信息                          | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                             |
+| dbms.security.addAllowedHosts         | 添加ip到信任列表                          | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                 |
+| dbms.security.deleteAllowedHosts      | 从信任列表删除ip                          | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                      |
+| dbms.security.listAllowedHosts        | 列出信任列表中的主机ip                       | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                               |
+| dbms.config.update                    | 更新TuGraph配置                        | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                            |
+| dbms.config.list                      | 列出TuGraph配置                        | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                  |
+| algo.shortestPath                     | 查询两个点间的最短路径                        | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                            |
+| algo.allShortestPaths                 | 查询两个点间的所有最短路径                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                             |
+| algo.native.extract                   | 查询指定VertexId/EdgeUid（列表）指定field的值（列表） | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                         |
+| db.flushDB                            | 刷新db                               | db.flushDB() :: (::VOID)                                                                                                                                                         |
+| dbms.security.listRoles               | 列出所有角色                             | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                  |
+| dbms.security.createRole              | 创建角色                               | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                             |
+| dbms.security.deleteRole              | 删除角色                               | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                          |
+| dbms.security.getRoleInfo             | 获取角色详细信息                           | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                      |
+| dbms.security.disableRole             | 禁用/启用角色                            | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                             |
+| dbms.security.modRoleDesc             | 修改角色描述信息                           | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.rebuildRoleAccessLevel  | 删除角色权限并重建                          | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                 |
+| dbms.security.modRoleAccessLevel      | 修改角色对指定图的访问权限                      | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                     |
+| dbms.security.modRoleFieldAccessLevel | 修改角色对指定属性的访问权限                     | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                          |
+| dbms.security.getUserInfo             | 获取用户详细信息                           | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                      |
+| dbms.security.disableUser             | 禁用/启用用户                            | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                             |
+| dbms.security.setCurrentDesc          | 设置当前用户描述信息                         | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                    |
+| dbms.security.setUserDesc             | 设置用户描述信息                           | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                          |
+| dbms.security.getUserMemoryUsage      | 获取用户内存用量                           | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                        |
+| dbms.security.setUserMemoryLimit      | 设置用户内存限制                           | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                  |
+| dbms.security.deleteUserRoles         | 删除用户与角色的联系                         | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                              |
+| dbms.security.rebuildUserRoles        | 清空用户角色的关系并重建                       | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                             |
+| dbms.security.addUserRoles            | 新增用户与角色的联系                         | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                 |
+| db.plugin.loadPlugin                  | 装载plugin                           | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN,version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | 删除plugin                           | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                      |
+| db.plugin.listPlugin                  | 列出已装载的plugin                       | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                   |
+| db.plugin.getPluginInfo               | 获取plugin的详细信息                      | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                   |
+| db.plugin.callPlugin                  | 执行plugin                           | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                             |
+| db.importor.dataImportor              | 导入点或边数据                            | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                      |
+| db.importor.schemaImportor            | 导入点或边schema                        | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                      |
+| db.addFullTextIndex                   | 添加全文索引                             | db.addFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                      |
+| db.deleteFullTextIndex                | 删除全文索引                             | db.deleteFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                   |
+| db.rebuildFullTextIndex               | 重建全文索引                             | db.rebuildFullTextIndex(vertex_labels::STRING, edge_labels::STRING) :: (::VOID)                                                                                                  |
+| db.fullTextIndexes                    | 查看全文索引                             | db.fullTextIndexes() :: (is_vertex::BOOLEAN, label::STRING, field::STRING)                                                                                                       |
+| dbms.meta.count                       | 查看点边总数                             | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                          |
+| dbms.meta.countDetail                 | 查看点边总数详情                           | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                |
+| dbms.meta.refreshCount                | 重新统计点边数量，统计期间停写。                   | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                          |
+| dbms.task.listTasks                   | 查询正在执行的任务                          | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                             |
+| dbms.task.terminateTask               | 中止任务                               | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                               |
+| dbms.ha.clusterInfo                   | HA模式下查看集群状态                        | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                |
+| db.dropDB                             | 清空数据库                              | db.dropDB() :: (::VOID)                                                                                                                                                          |
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md
new file mode 100644
index 0000000000..6e4cc06827
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/1.intro.md
@@ -0,0 +1,18 @@
+# ISO GQL 简介
+
+Graph Query Language(GQL, 图查询语言)是一种国际标准语言，用于属性图查询，该语言建立在SQL的基础上，并整合了现有的[openCypher、PGQL、GSQL和G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/)语言的成熟思想。目前该标准仍然处于草稿阶段。
+
+TuGraph基于[ISO GQL (ISO/IEC 39075) Antlr4 语法文件](https://github.com/TuGraph-family/gql-grammar)实现了GQL，并做了一些扩展与改造。目前并未完全支持所有的GQL语法，我们会在未来逐步完善。
+
+## 子句列表
+
+| 类别                | 子句           |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md
new file mode 100644
index 0000000000..3798f5661d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/1.match.md
@@ -0,0 +1,100 @@
+# MATCH
+
+`MATCH`子句式是GQL最基础的子句，几乎所有查询都是通过 `MATCH`展开。
+
+`MATCH`子句用于指定在图中搜索的匹配模式，用来匹配满足一定条件的点或者路径。
+
+## 基本用法
+
+### 点查询
+
+#### 查询所有点
+
+```
+MATCH (n)
+RETURN n
+```
+
+#### 查询特定标签的点
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+#### 通过属性匹配点
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### 通过过滤条件匹配点
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+### 边查询
+
+#### 出边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+#### 入边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+#### 带过滤条件的边匹配
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+返回结果
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+### 路径匹配
+
+#### 不定跳查询
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md
new file mode 100644
index 0000000000..246e87fda9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/2.optional_match.md
@@ -0,0 +1,30 @@
+# OPTIONAL MATCH
+
+`OPTIONAL MATCH`匹配图模式，如果未命中，则返回`null`。
+
+## 基本用法
+
+### 查询命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+### 查询未命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+返回结果
+
+```JSON
+[{"n.birthyear":null}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md
new file mode 100644
index 0000000000..3775b5e2fb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/3.return.md
@@ -0,0 +1,110 @@
+# RETURN
+
+`RETURN`子句指定返回结果，包括返回点、边、路径、属性等。
+
+## 基本用法
+
+### 返回点
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+### 返回边
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+### 返回属性
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+### 不常见字符串作为变量名
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+### 列别名
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+### 可选属性
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+### 其它表达式
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+### 结果唯一性
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+返回结果
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md
new file mode 100644
index 0000000000..87612e184f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/4.next.md
@@ -0,0 +1,20 @@
+# NEXT
+
+`NEXT`子句用于连接多个子句。
+
+## 基本用法
+
+### 连接MATCH
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md
new file mode 100644
index 0000000000..44817da5dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/5.where.md
@@ -0,0 +1,49 @@
+# WHERE
+
+`WHERE`子句用于过滤记录。
+
+## 基本用法
+
+### 过滤点
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+### 过滤边
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+返回结果
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+### 布尔表达式
+
+`AND`, `OR`, `XOR`和 `NOT`布尔表达式可以用在 `WHERE`中用来过滤数据。
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md
new file mode 100644
index 0000000000..56d0566a67
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/6.orderby.md
@@ -0,0 +1,19 @@
+# ORDER BY
+
+`ORDER BY`是`RETURN`的子句，对输出的结果进行排序。
+
+## 基本用法
+
+### 对结果排序
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+返回结果
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md
new file mode 100644
index 0000000000..398429d355
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/7.skip.md
@@ -0,0 +1,30 @@
+# SKIP
+
+`SKIP`指定结果偏移行数。
+
+## 基本用法
+
+### 未使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md
new file mode 100644
index 0000000000..f47733baaa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/8.limit.md
@@ -0,0 +1,17 @@
+# LIMIT
+
+`LIMIT`限制结果行数。
+
+## 基本用法
+
+### 使用LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst
new file mode 100644
index 0000000000..770aa58ee2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/2.clauses/index.rst
@@ -0,0 +1,8 @@
+GQL子句
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/index.rst
new file mode 100644
index 0000000000..e39c0a8e24
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/2.gql/index.rst
@@ -0,0 +1,9 @@
+GQL
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.intro.md
+   2.clauses/index.rst
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/index.rst
new file mode 100644
index 0000000000..027d7cc49a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/1.query/index.rst
@@ -0,0 +1,9 @@
+查询语言
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.cypher.md
+   2.gql/index.rst
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..418a3cad66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/1.tutorial.md
@@ -0,0 +1,207 @@
+# OLAP API
+
+> 本文档是为TuGraph的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对TuGraph的图计算运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于Tugraph的一个简单的[BFS(宽度优先搜索)](https://en.wikipedia.org/wiki/Breadth-first_search "wikipedia")程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图分析引擎介绍
+
+TuGraph的图分析引擎，面向的场景主要是全图/全量数据分析类的任务。借助TuGraph的 C++ / Python 图分析引擎 API ，用户可以对不同数据来源的图数据快速导出一个待处理的复杂子图，然后在该子图上运行诸如PageRank、LPA、WCC等迭代式图算法，最后根据运行结果做出相应的对策。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph图计算系统社区版内置6个算法，商业版内置了25种算法，用户几乎不需要自己实现具体的图计算过程。其详细介绍可参考algorithms.md。
+
+根据数据来源及实现不同，可分为Procedure、Embed和Standalone三种运行方式，均继承于OlapBase API，OlapBase API接口文档可参考olapbase-api.md。
+
+其中Procedure和Embed的数据来源是图数据库中预加载的db数据，可以分别编译生成tugraph-web加载使用的.so文件和后台终端使用的embed文件，输入的图数据均通过db的加载形式，其接口文档可参考olapondb-api.md。
+Standalone用于编译生成standalone文件，区别于前者，该文件的输入图数据通过txt、二进制、ODPS文件的形式加载，其接口文档可参考olapondisk-api.md。
+
+## 2. Procedure 编译与运行
+
+该种方式主要用于tugraph-web界面进行可视化加载及运行。使用方法如下：
+
+### C++:
+在tugraph-db/procedures 目录下执行`bash make_so_cpp.sh bfs`即可在tugraph-db/procedures目录下得到bfs.so文件，将该文件以插件形式上传至tugraph-web，输入参数后即可执行。
+
+### Python:
+在tugraph-web的前端将python文件以插件形式上传，输入参数后即可执行。
+
+示例：
+在tugraph-db/procedures 编译.so算法文件
+`bash make_so_cpp.sh bfs`
+
+将bfs.so（或tugraph-db/procedures/algo_cython/bfs.py）文件以插件形式加载至tugraph-web后，输入如下json参数：
+
+```json
+{
+    "root_id":"0",
+    "label":"node",
+    "field":"id"
+}
+```
+即可得到返回结果如下。
+
+```json
+{
+  "core_cost": 0.013641119003295898,
+  "found_vertices": 3829,
+  "num_edges": 88234,
+  "num_vertices": 4039,
+  "output_cost": 8.821487426757813e-06,
+  "prepare_cost": 0.03479194641113281,
+  "total_cost": 0.04844188690185547
+}
+```
+
+输出内容解释如下：
+- core_cost: 表示算法运行所需要的时间。
+- found_vertices: 表示查找到点的个数。
+- num_edges: 表示该图数据的边数量。
+- num_vertices: 表示该图数据点的数量。
+- output_cost: 表示算法结果写回db所需要的时间。
+- prepare_cost: 表示预处理阶段所需要的时间。预处理阶段的工作：加载参数、图数据加载、索引初始化等。
+- total_cost: 表示执行该算法整体运行时间。
+
+make_so.sh文件介绍：该文件用于将TuGraph-OLAP所涉及到的图算法文件编译成一个可供tugraph-web使用的.so文件。
+
+## 3. Embed 编译与运行
+
+该种方式主要用于TuGraph在后台程序中对预加载的db图数据进行算法分析。其使用方法如下：
+在tugraph-db/procedures 目录下对embed_main.cpp文件完善，补充数据名称、输入参数、数据路径等信息，示例如下：
+
+### C++:
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path表示预加载图数据存放的路径
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // 指定图数据的名称
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // 以json形式输入算法参数
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+保存后在tugraph-db/procedures 目录下执行`bash make_embed.sh bfs`即可在tugraph-db/procedures/algo_cpp 目录下得到bfs_procedure文件。
+
+在tugraph-db/procedures 文件夹下执行`./algo_cpp/bfs_procedure` 即可得到返回结果：
+
+```json
+{
+  "core_cost":0.025603055953979492,
+  "found_vertices":3829,
+  "num_edges":88234,
+  "num_vertices":4039,
+  "output_cost":9.059906005859375e-06,
+  "prepare_cost":0.056738853454589844,
+  "total_cost":0.0823509693145752
+}
+```
+
+参数解释同上。
+
+### Python：
+在tugraph-db/procedures文件夹下执行
+`bash make_so_cython.sh bfs`
+或在tugraph-db/procedures/algo_cython文件夹下执行
+`python3 setup.py build_ext -i`
+得到bfs.so后，在Python中import bfs可使用，如tugraph-db/procedures/run_embed.py所示
+
+```python
+# tugraph-db/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+```
+通过如下命令执行
+
+```bash
+python3 run_embed.py
+```
+
+输出结果与C++相同。
+
+## 4. Standalone 编译与运行
+
+该文件主要用于在终端处直接加载图数据，并运行打印输出结果。使用方法如下：
+在tugraph-db/build目录下执行`make bfs_standalone` (需要在g++默认include路径中包含boost/sort/sort.hpp)即可得到bfs_standalone文件,该文件生成于tugraph-db/build/output/algo文件夹下。
+运行方式：在tugraph-db/build目录下执行`./output/algo/bfs_standalone -–type [type] –-input_dir [input_dir] --id_mapping [id_mapping] -–vertices [vertices] --root [root] –-output_dir [output_dir]`即可运行。
+
+- `[type]`：表示输入图文件的类型来源，包含text文本文件、BINARY_FILE二进制文件和ODPS源。
+- `[input_dir]`：表示输入图文件的文件夹路径，文件夹下可包含一个或多个输入文件。TuGraph在读取输入文件时会读取[input_dir]下的所有文件，要求[input_dir]下只能包含输入文件，不能包含其它文件。参数不可省略。
+- `[id_mapping]`：当读入边表时，是否对输入数据做id映射，使达到符合算法运行的形式。1为需要做id映射，0为不需要做。该过程会消耗一定时间。参数可省略，默认值为0。
+- `[vertices]`：表示图的点个数，为0时表示用户希望系统自动识别点数量；为非零值时表示用户希望自定义点个数，要求用户自定义点个数需大于最大的点ID。参数可省略，默认值为0。
+- `[root]`：表示进行bfs的起始点id。参数不可省略。
+- `[output_dir]`：表示输出数据保存的文件夹路径，将输出内容保存至该文件中，参数不可省略。
+
+示例：
+
+### C++:
+在tugraph-db/build编译standalone算法程序
+
+```bash
+make bfs_standalone
+```
+
+在tugraph-db/build/output目录下运行text源文件
+
+```bash
+./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+得到运行结果：
+
+```text
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+结果参数解释同上。
+
+对于新的算法，运行时不了解该算法的所需参数时，可通过`./output/algo/bfs_standalone -h`进行查阅对应参数。
+
+### Python:
+Python语言的bfs拓展编译过程与embed模式无区别，在运行时通过`Standalone`接口调用，示例如下：
+```python
+# tugraph-db/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(input_dir=
+                             "../test/integration/data/algo/fb_unweighted",
+                             root=0)
+```
+
+通过如下命令执行
+
+```bash
+python3 run_standalone.py
+```
+
+至此，通过TuGraph对上图进行bfs运算的过程已经完成。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..6991d63290
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/2.olap-base-api.md
@@ -0,0 +1,179 @@
+# OlapBase API
+
+> 此文档主要详细介绍了OlapBase API的使用说明
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统需要的简单配置，同时结合代码对TuGraph中几个共同的重要文件和接口进行解释。
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+
+## 3. 原子操作
+
+TuGraph使用了多线程技术进行批处理操作，在这种情况下可能会出现访存冲突现象。为了保证并行计算时修改操作的正确性，TuGraph实现了原子操作。代码部分见lgraph文件夹下的lgraph_atomic.cpp文件。
+TuGraph还自定义了4个常用的原子操作。当我们需要在多线程模式下修改点的数据时，我们都应该使用原子操作来确保并行环境下修改操作的正确性。除了这4个原子操作外，用户也可以使用“cas”来构建自己的原子操作函数。
+
+- `bool cas(T * ptr, T oldv, T newv)`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `bool write_min(T *a, T b)`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `bool write_max(T *a, T b)`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `void write_add(T *a, T b)`：将b的值加到a指向的值上。
+- `void write_sub(T *a, T b)`：将a指向的值减去b的值。
+
+## 4. 点集合类ParallelBitset
+
+在使用TuGraph进行批处理操作时，需要使用点集合来表示需要处理的点。ParallelBitset实现了点集合类，以bit为单位表示点，因此能够节省大量内存。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 4.1 ParallelBitset类成员
+
+- `size_t Size()`：表示Bitmap中的点个数。
+- `ParallelBitset(size_t size)`：初始化size和data，data长度为(size >> 6)+1
+- `void Clear()`：清空集合
+- `void Fill()`：将所有点加入集合
+- `bool Has(size_t i)`：检查点i是否在集合中
+- `bool Add(size_t i)`：将点i加入集合中
+- `void Swap(ParallelBitset &other)`：和另一组ParallelBitset集合交换元素
+
+## 5. 点数组类ParallelVector
+
+在使用TuGraph进行批处理操作时，需要使用点数组来表示对点的处理结果。ParallelVector实现了点数组类。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 5.1 ParallelVector类成员
+
+- `ParallelVector(size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `T &operator[](size_t i)`：下标为i的数据
+- `T *begin()`：ParallelVector的起始指针
+- `T *end()`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `T &Back()`：ParallelVector最后一个数据
+- `T *Data()`：表示数组本身数据
+- `void Destroy()`：清空ParallelVector数组内数据并删除数组
+- `size_t Size()`：表示ParallelVector中的数据个数
+- `size_t Capacity()`：表示ParallelVector的容量大小
+- `void Resize(size_t size)`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `void Clear()`：清空ParallelVector内数据
+- `void ReAlloc(size_t capacity)`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `void Fill(T elem)`：为ParallelVector的全部数据赋值为elem
+- `void Append(const T &elem, bool atomic = true)`：向ParallelVector结尾添加一个数据
+- `void Swap(ParallelVector<T> &other)`：和其他的ParallelVector交换数据
+- `ParallelVector<T> Copy()`：复制当前的ParallelVector数据存至Copy数组中
+
+## 6. 自定义数据结构
+
+### 6.1 基本数据类型
+
+我们自定义了点和边的数据结构表示，用于在覆盖所有点的同时节省内存空间：
+
+- `Empty`：内容为空的特殊数据类型。
+
+### 6.2 组合数据结构
+
+为了便于计算，我们根据计算场景不同，定义了几种点和边数据的数据结构，分别是：
+
+- `EdgeUnit<EdgeData>`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+  - `size_t src`：边的起始点
+  - `size_t dst`：边的终点
+  - `EdgeData edge_data`：边的权值
+- `AdjUnit<EdgeData>`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+  - `size_t neighbour`：边的邻居点
+  - `EdgeData edge_data`：边的权值
+- `AdjList<EdgeData>`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+  - `AdjUnit<T> * begin`：列表的起始指针
+  - `AdjUnit<T> * end`：列表的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对邻接表进行循环访问。
+
+## 7. 图类OlapBase
+
+图类OlapBase是TuGraph用于加载图以及进行图计算操作的主类，常用OlapBase<EdgeData>表示权值类型为EdgeData的图，代码部分见lgraph文件夹下的olap_base.hpp。本章将介绍Graph类中常用的类型和API接口。上文介绍Procedure、Embed及Standalone功能所使用的类均为该类的子类。
+
+### 7.1 基本信息
+
+- `size_t NumVertices()`：获取点数
+- `size_t NumEdges()`：获取边数
+- `size_t OutDegree(size_t vid)`：点vid的出度
+- `size_t InDegree(size_t vid)`：点vid的入度
+
+### 7.2 点集和边集及其相关操作
+
+- `ParallelVector<VertexData> AllocVertexArray<VertexData>()`：分配一个类型为VertexData的数组，大小为点个数
+- `void fill_vertex_array<V>(V * array, V value)`：将数组array中的所有元素赋值为value
+- `ParallelBitset AllocVertexSubset()`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `AdjList<EdgeData> OutEdges(size_t vid)`：获取点v的所有出边集合
+- `AdjList<EdgeData> InEdges(size_t vid)`：获取点v的所有入边集合
+- `void Transpose()`：对有向图进行图反转
+- `LoadFromArray(char * edge_array, VertexId input_vertices, EdgeId input_edges,  EdgeDirectionPolicy edge_direction_policy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+  - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+  - `input_vertices`：指定数组读入图的点个数。
+  - `input_edges`：指定数组读入图的边的条数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+### 7.3 锁机制
+
+TuGraph实现了一对锁机制，来控制程序对于点数据的访存权限。分别是：
+
+- `void AcquireVertexLock(size_t vid)`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(size_t vid)`：对点vid解锁，所有线程均可访存该锁对应的点数据
+- `VertexLockGuard GuardVertexLock(size_t vid)`：在对vid操作时，对点vid加锁，退出作用域时时自动释放锁
+
+### 7.4 批处理操作
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程。分别是：
+
+```c++
+/*
+    函数名称:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+    第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考include/lgraph/olap_base.h中具体代码
+
+    使用示例:统计数组parent数组中有出边的点个数
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+其中graph为图类OlapBase的实例化对象
+
+```C++
+/*
+    函数名称:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+    第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考/include/lgraph/olap_base.h中具体代码
+    
+    使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..1e94fb946e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,296 @@
+# OlapOnDB API
+
+> 此文档主要详细介绍了OlapOnDB API的使用说明
+
+
+## 1. 简介
+
+一般用户需要自己实现的只是将需要分析的子图抽取出来的过程。用户也可以通过使用TuGraph中丰富的辅助接口实现自己的图分析算法。
+
+该文档主要介绍Procedure及Embed的接口设计，并介绍部分常用接口，具体的接口信息参见include/lgraph/olap_on_db.h文件。
+
+## 2. 模型
+
+Procedure及Embed使用到的辅助函数主要包含在OlapOnDB类，还有一些使用频率较高的函数都会逐一介绍
+
+在TuGraph中OLAP相关的有以下常用的数据结构：
+
+1. DB图分析类 `OlapOnDB<EdgeData>`
+2. 点数组`ParallelVector<VertexData>`
+3. 点集合`ParallelBitset`
+4. 边数据结构`AdjUnit/AdjUnit<Empty>`
+5. 边集合数据结构`AdjList<EdgeData>`
+
+### 2.1 基于快照的存储结构
+
+TuGraph中的OlapOnDB类能够提供数据“快照”，即建立一个对指定数据集的完全可用拷贝，该拷贝包括相应数据在某个时间点（拷贝开始的时间点）的镜像。由于OLAP的操作仅涉及读操作而不涉及写操作，OlapOnDB会以一种更紧凑的方式对数据进行排布，在节省空间的同时，提高数据访问的局部性。
+
+### 2.2 BSP计算模型
+
+TuGraph在计算的过程中使用了BSP（Bulk Synchronous Parallel）模型，使得该过程能够并行执行，极大的提高了程序运行效率。
+
+BSP计算模型的核心思路为超步（Super Step）的提出和使用。在OlapOnDB创建后，在该数据上的计算分为多个超步，比如PageRank，分为多轮迭代，每轮迭代就是一个超步。不同超步之间用存在显式同步，从而保证所有线程在完成同一超步后同时进入下一个超步。在一个超步内部，所有的线程异步执行，利用并行提升计算效率。
+
+利用BSP计算模型能够有效避免死锁，通过障碍同步的方式能够以硬件方式实现粗粒度的全局同步，使得图计算能够并行化执行，而程序员无需在同步互斥上大费周章。
+
+## 3. 算法举例
+
+在这里对PageRank算法分块做解释，大体上分为主函数`Process`和PageRank算法流程`PageRank`函数
+
+### 3.1 主函数
+
+主函数输入有三个参数，`TuGraph`数据库参数`db`，从网页端获取的请求`request`，给网页端的返回值`response`，整体流程可以分为一下几步：
+
+1. 相关参数的获取
+2. 快照类的创建
+3. PageRank算法主流程
+4. 网页端返回值的获取和发送
+
+```C++
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+    
+    // 从网页端请求中获取迭代次数（num_iterations），
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // 读事务的创建以及快照类的创建
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+	
+    // 创建pr数组用于存储每个节点的pr值
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank算法主流程，获取每个节点的pagerank值
+    PageRankCore(olapondb, num_iterations, pr);
+    
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        函数用途：从所有节点中获取pagerank值最大的节点编号
+    
+        函数流程描述：该函数对点集合all_vertices中所有为1的位对应的节点vi（又称为活跃点）执行Func A，再将Func A的返回值作为Func B的第二个输入参数，得到局部最大值（因为第一个输入参数为0，因此实际上返回值就是每个节点的pagerank值），最后再将所有线程的返回值汇总，再次 执行Func B得到全局返回值，并存入max_pr_vi变量中
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+        
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+        
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+    
+    // 网页端返回值的获取和发送
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2 PageRank算法流程
+
+`pagerank`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关数据结构的初始化
+1. 每个节点pagerank值的初始化
+1. 每个节点pagerank值的计算，活跃点为所有点（意味着所有点都需要计算pagerank值）
+1. 得到每个节点经过`num_iterations`次迭代后的pagerank值
+
+```C++
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+    
+    // 相关数据结构的初始化
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // 每个节点pagerank值的初始化，和该节点的出度成反比
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // 总迭代过程
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            函数用途：计算所有节点的pagerank值
+
+            函数流程描述：该函数用于计算所有节点的pagerank值，对all_vertices中所有为1的位对应的节点vi执行Func C，得到本轮迭代中vi的pagerank值，并返回vi节点的pagerank变化值，最终经过函数内部处理汇总所有活跃节点的总变化值并返回，该值被存储在delta变量中
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // 从邻居中获取当前节点的pagerank值
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank值计算核心公式
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+    
+                    // 相关中间变量统计
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // 将本轮迭代得到的pagerank值输出作为下一轮迭代的输入
+        curr.Swap(next);
+    }
+}
+```
+
+## 4. 其他常用函数功能描述
+
+### 4.1 事务的创建
+
+```C++
+//读事务的创建
+auto txn = db.CreateReadTxn();
+
+//写事务的创建
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2 并行化创建有向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3 并行化创建无向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED
+)
+```
+
+### 4.4 获取出度
+
+```C++
+size_t OutDegree(size_t vid)
+```
+
+### 4.5 获取入度
+
+```C++
+size_t InDegree(size_t vid)
+```
+
+### 4.6 获取出边集合
+
+```C++
+/*
+    函数名称：AdjList<EdgeData> OutEdges(size_t vid)
+    数据结构:
+        AdjList 可以理解为类型为AdjUnit结构体的数组
+        AdjUnit 有两个成员变量： 1. size_t neighbour 2. edge_data，其中neighbour表示该出边指向的目标节点编号，如果为有权图，则edge_data数据类型和输入文件中边的权重值相同，否则数据类型为Empty
+
+    使用示例：输出节点vid的所有出度邻居
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7 获取入边集合
+
+```C++
+AdjList<EdgeData> InEdges(size_t vid)
+
+// 使用示例：输出节点vid的所有入度邻居
+for (auto & edge : olapondb.InEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8 获取TuGraph中节点对应OlapOnDB的节点编号
+
+```C++
+size_t OriginalVid(size_t vid)
+
+// 备注： TuGraph中输入的节点编号可以是非数字，比如人名等，在生成OlapOnDB子图的时候，会将人名等转化为数字进行后续处理，因此该方法可能不适用于某些特定场景
+```
+
+### 4.9 获取OlapOnDB中节点对应TuGraph的节点编号
+
+```C++
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10 活跃点的描述
+
+活跃点指的是在批处理函数中需要处理的点，在本例子中只是输出了活跃点的编号，并且汇总活跃点的数量：
+
+```C++
+ParallelBitset temp = 000111;	//当前活跃点为3，4，5号点
+
+size_t delta = ForEachActiveVertex<double>(
+    //void c
+    [&](size_t vi) {
+        printf("active_vertexId = %lu\n",vi);
+        return 1;
+    },
+    all_vertices
+);
+```
+
+函数的运行结果显而易见，因为多线程的关系，一下输出顺序可能有所变化：
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+局部返回值均为1，该函数会在保证线程安全的情况下将所有的局部返回值累加得到最终的返回值，并存储在`delta`变量中，该值最终为3
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..1ece4cc8e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,202 @@
+# OlapOnDisk API
+
+> 此文档主要详细介绍了OlapOnDisk API的使用说明
+
+    
+## 1. 简介
+
+TuGraph的Standalone模式可用于加载图数据文件，其中图数据文件来源可包含text文本文件、BINARY_FILE二进制文件和ODPS源。在该模式下，TuGraph可实现多数据来源快速加载成图，然后在该图上运行如BFS、WCC、SSSP等迭代式算法，并输出最终结果至终端。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph内置了大量的常见图分析算法和丰富的辅助接口，因此用户几乎不需要自己实现具体的图计算过程，只需要在实现自己的存储过程的时候将相应算法库的头文件(.h)包含到自己的程序中，并在编译阶段链接自己的动态库文件即可。
+
+该文档主要介绍了Standalone的常用接口，使用到的辅助函数主要包含在OlapOnDB类。同时为帮助用户理解方便，对BFS算法进行举例说明。
+
+## 2. 算法举例
+
+在这里对BFS算法分块做解释，大体上分为主函数`main`、BFS算法流程`BFSCore`函数和配置类MyConfig。
+
+### 2.1 头文件
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //使用 TuGraph 时需要包含的头文件
+#include "./algo.h"   //包含各种算法逻辑函数的头文件
+```
+
+在使用 TuGraph 实现图数据文件计算应用时，一般首先建立StandaloneGraph类对象graph，将图文件数据加载进graph中，之后通过调用图逻辑函数实现图计算过程，最后对图计算的结果进行打印输出。
+
+### 2.2 配置类MyConfig
+
+MyConfig配置类函数用于提供算法逻辑计算时所需的配置信息，继承于ConfigBase<EdgeData>,其中EdgeDate可根据加载图类型不同选择Empty（无权图）、int（带权图权重为整数）或者double（带权图权重为double）类型。
+
+MyConfig配置类一般根据算法不同，需要额外配置信息如下：
+
+1.算法所需参数
+2.算法名称
+3.配置类内Print函数
+其余公用成员继承与ConfigBase，可参考src/olap/olap_config.h查阅。
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // 算法所需参数初始化
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // 配置文件接受命令行参数，该用例会顺次读取命令行调用算法时的参数，优先使用用户指定数值，若用户并未指定则选择默认参数。
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+### 2.3 主函数
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // 统计内存消耗类MemUsage实例化
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // 配置类MyConfig实例化
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk类实例化
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // 统计图加载消耗时间
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // 创建数组用于统计某节点是否遍历过
+    auto parent = graph.AllocVertexArray<size_t>();
+    // 宽度优先搜索算法，返回图内root_vid根结点连接的节点个数
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // 打印相关信息至终端
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+### 2.4 bfs算法流程
+
+`bfs`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关定义、数据结构的初始化
+2. 使用批处理函数对每个节点进行循环计算，每一轮找到与当前节点相邻的全部节点，并在该轮次终止时进行交换。
+3. 直到找到全部节点，返回节点个数discovered_vertices。
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //分配数组，active_in用于存放上一循环阶段已找到的节点
+  active_in.Add(root);            //把跟节点加入数组中
+  auto active_out = graph.AllocVertexSubset();  //分配数组active_out用于存放当前循环阶段找到的节点
+  parent.Fill((size_t)-1);               //将parent数组中的节点赋值为-1，-1表示未被找到
+  parent[root] = root;
+  size_t num_activations = 1;       //表示当前循环阶段找到的节点个数
+  size_t discovered_vertices = 0;    //表示当前循环阶段找到节点的总个数
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations表示当前循环阶段找到的节点个数
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices表示当前循环阶段找到节点的总个数
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //每一次循环从根节点出发，查找邻近的相邻节点，对其parent值改变，并num_activations+1操作
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //存放当前循环阶段找到的节点
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // 返回全部节点数
+  return discovered_vertices;
+}
+```
+
+## 3. 其他常用函数功能描述
+
+### 3.1 图加载
+
+TuGraph-Standalone对于图数据文件的加载来源主要分为三大类：文本文件、二进制文件和ODPS。二进制文件为将边数据的二进制表示按顺序排列的文件，能够节省大量存储空间。其加载函数分为三种，分别是：
+
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：图数据文件的加载方式，包含两个参数，其含义分别表示：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。其中DUAL_DIRECTION为默认的图加载方式。
+  DUAL_DIRECTION : 输入文件为非对称图，加载图为非对称图。
+  MAKE_SYMMETRIC : 输入文件为非对称图，加载图为对称图。
+  INPUT_SYMMETRIC : 输入文件为对称图，加载图为对称图。
+  对应的详细介绍见lgraph文件夹下的olap_config.h文件的`enum EdgeDirectionPolicy`。
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：将文件中的点-数据对按照点id的顺序加载到数组中。各参数表示意义分别为：
+  - `array`：待读入数据的数组
+  - `path`：读取文件的路径，文件中每行表示一对点-数据对
+  - `parse_line`：用户自定义函数，告诉系统如何将一行文本数据解析为一个点-数据对。
+
+
+### 3.2 图写入
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：把array中数据写回文件中，各参数表示意义分别是：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `array`：待写入数据的数组
+  - `array_size`：待写入数据的数字长度
+  - `name`：算法名称
+  - `filter_output`：写入数据规则函数，待写入数据需要满足该函数的要求。
+
+### 3.3 图解析函数
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：对图数据文件进行解析，加载图为无权图。
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：对图数据文件进行解析，加载图为有权图，权重数据类型可以通过修改<EdgeData>指定。
+
+该函数可通过MyConfig类定义时的构造函数parse_line进行指定。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md
new file mode 100644
index 0000000000..0ca16518f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/5.python-api.md
@@ -0,0 +1,428 @@
+# Python Olap API
+
+> 本文档主要介绍 OlapBase OlapOnDB 和 OlapOnDisk 在Python中的API用法
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统Python接口需要的简单配置，同时结合代码对TuGraph Python API进行解释。关于ParallelBitset、OlapBase各类的作用，详见olap-base-api.md，olap-on-db-api.md和olap-on-disk-api.md
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+- Cython，版本要求3.0.0以上，已测试可运行版本为3.0.0a11
+
+## 3. Cython
+Cython是一种高效的编程语言，是Python的超集。Cython能将py文件翻译为C/C++代码后编译为Python拓展类，在Python中通过import调用。在TuGraph中，所有的Python plugin都由Cython编译为Python拓展类后使用。
+
+Cython的Pure Python模式在保证Python语法的同时具有C/C++的性能，TuGraph Python接口均使用Cython实现。
+
+[Cython 文档](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+见procedures/algo_cython/olap_base.pxd文件，用法与功能基本与C++接口相同，olap_base.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### 原子操作
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `write_min[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_max[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_add[T](a: cython.pointer(T), b: T)-> cython.bint`：将b的值加到a指向的值上。
+- `write_sub[T](a: cython.pointer(T), b: T)-> cython.bint`：将a指向的值减去b的值。
+
+### 点集合类ParallelBitset
+- `Size()-> size_t`：表示Bitmap中的点个数。
+- `ParallelBitset(size: size_t)`：初始化size和data，data长度为(size >> 6)+1
+- `Clear()-> cython.void`：清空集合
+- `Fill()-> cython.void`：将所有点加入集合
+- `Has(size_t i)-> cython.bint`：检查点i是否在集合中
+- `Add(size_t i)-> cython.bint`：将点i加入集合中
+- `Swap(ParallelBitset &other)-> cython.void`：和另一组ParallelBitset集合交换元素
+
+### 点数组类ParallelVector
+- `ParallelVector[T](size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `operator[](i: size_t)-> T`：下标为i的数据
+- `begin()-> cython.pointer(T)`：ParallelVector的起始指针
+- `end()-> cython.pointer(T)`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `Back()-> T`：ParallelVector最后一个数据
+- `Data()-> cython.pointer(T)`：表示数组本身数据
+- `Destroy()-> cython.void`：清空ParallelVector数组内数据并删除数组
+- `Size()-> size_t`：表示ParallelVector中的数据个数
+- `Resize(size: size_t)-> cython.void`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `Clear()-> cython.void`：清空ParallelVector内数据
+- `ReAlloc(capacity: size_t)-> cython.void`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `Fill(elem: T)-> cython.void`：为ParallelVector的全部数据赋值为elem
+- `Append(elem: T, atomic: cython.bint = true)-> cython.void`：向ParallelVector结尾添加一个数据
+- `Swap(other: ParallelVector[T])-> cython.void`：和其他的ParallelVector交换数据
+- `Copy()-> ParallelVector[T]`：复制当前的ParallelVector数据存至Copy数组中
+
+### 自定义数据结构
+- `Empty`：内容为空的特殊数据类型。
+- `EdgeUnit[EdgeData]`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+    - `src: size_t`：边的起始点
+    - `dst: size_t`：边的终点
+    - `edge_data: EdgeData`：边的权值
+- `AdjUnit[EdgeData]`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+    - `neighbour: size_t`：边的邻居点
+    - `edge_data: EdgeData`：边的权值
+- `AdjList[EdgeData]`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+    - `begin()-> cython.pointer(AdjUnit[T])`：列表的起始指针
+    - `end()-> cython.pointer(AdjUnit[T])`：列表的结束指针。
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: 下标为i的数据
+
+### 图类OlapBase
+- `NumVertices()-> size_t`：获取点数
+- `NumEdges()-> size_t`：获取边数
+- `OutDegree(size_t vid)-> size_t`：点vid的出度
+- `InDegree(size_t vid)-> size_t`：点vid的入度
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`：分配一个类型为VertexData的数组，大小为点个数
+- `AllocVertexSubset()-> ParallelBitset`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有出边集合
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有入边集合
+- `Transpose()-> cython.void`：对有向图进行图反转
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+    - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+    - `input_vertices`：指定数组读入图的点个数。
+    - `input_edges`：指定数组读入图的边的条数。
+    - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`：对点vid解锁，所有线程均可访存该锁对应的点数据
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程，在Python中与C++使用方法稍有不同。
+
+```python
+# 函数名称:ProcessVertexInRange[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           lower: size_t, upper: size_t,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#     函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+#     第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#     具体实现请参考include/lgraph/olap_base.h中具体代码
+#
+#     使用示例:统计数组parent数组中有出边的点个数
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython. pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython. pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+其中g为图类OlapBase的实例化对象
+
+```python
+# 函数名称:ProcessVertexActive[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           active: ParallelBitset,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#   函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+#   第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#   具体实现请参考/include/lgraph/olap_base.h中具体代码
+#
+# 使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self.graph.OutDegree(vi)
+        dst: size_t
+        edges = self.graph.OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbour
+            printf("node %lu has neighbour %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+如上面两个例子所展示，在Python中ProcessVertexActive与ProcessVertexInRange比在C++中额外需要一个算法类指针参数，Work函数一般也作为该算法类的成员函数，满足Work函数访问成员变量的需求（如图graph，点数组parent），在调用批处理函数时将Work函数和算法类的self指针传入批处理函数。
+
+其中Work函数会在多线程中调用，因此加上修饰器`@cython.nogil`释放Python全局解释锁，在多线程执行的代码中（例如批处理函数中的Work函数，`cython.parallel.prange`中），不能包含Python对象，最好通过`dst: type`或者`dst = cython.declare(type)`的方式声明变量为C/C++类型。
+
+### 图类OlapOnDB:
+并行化创建有向图：
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+并行化创建无向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING创建有向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### 图类OlapOnDisk
+
+#### ConfigBase：
+- `ConfigBase()`: 构造函数
+- `std::string input_dir`: 图边表数据路径
+- `std::string output_dir`: 输出结果路径
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: 读入图数据
+
+
+## 5. lgraph_db API
+见procedures/algo_cython/lgraph_db.pxd与lgraph_db_python.py文件。
+
+lgraph_db.pxd中接口用法与功能基本与C++接口相同，lgraph_db.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: 获取点的vid
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: 设置用户
+- `SetUser(user: std::string)-> cython.void`: 设置用户
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: 创建GraphDB
+
+### GraphDB：
+- `CreateReadTxn()-> Transaction`: 创建只读事务
+- `CreateWriteTxn()-> Transaction`: 创建写事务
+- `ForkTxn(txn: Transaction)-> Transaction`: 复制事务，只能复制读事务
+
+### Transaction：
+```
+GetVertexIndexIterator(
+                label: std::string,
+                field: std::string,
+                key_start: std::string,
+                key_end: std::string)-> VertexIndexIterator
+```
+获取索引迭代器。迭代器的field值为 [key_start, key_end]。所以在key_start=key_end=v时，返回指向field值为v的点的迭代器
+
+lgraph_db_python.py是lgraph_db.pxd中C++类 Galaxy与GraphDB的包装，将C++类包装为Python类，将lgraph_db_python.py编译为Python拓展后，可以直接在Python文件或Python命令行中`import lgraph_db_python`访问lgraph_db_python.PyGraphDB与PyGraphDB.PyGalaxy。
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(self, user: str password: str)-> void`: 设置用户
+- `SetUser(self, user: std::string)-> void`: 设置用户
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: 创建PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)-> cython.Py_ssize_t`: C++ 类GraphDB的地址
+
+## 6. 算法插件示例
+下面为Python实现的BFS算法的代码示例：
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# 注释作用如下：
+# language_level=3: 使用Python3
+# cpp_locals=True: 需要c++17，使用std::optional管理Python代码中的C++对象，可以避免C++对象的拷贝构造
+# boundscheck=False: 关闭索引的边界检查
+# wraparound=False: 关闭负数下标的处理（类似Python List）
+# initializedcheck=False: 关闭检查内存是否初始化，关闭检查后运行性能更快
+# language = c++: 将此py文件翻译为C++而不是C文件，TuGraph使用大量模板函数，所以都应该使用C++
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# 从procedures/algo_cython/ 中cimportolap_base.pxd与lgraph_db.pxd, 类似C++中#include "xxx.h"
+
+from cython.cimports.libc.stdio import printf
+# 类似C++中#include <stdio.h>
+# 其他常见的还有cython.cimports.libcpp.unordered_map等
+
+import time
+import lgraph_db_python
+
+
+@cython.cclass
+# cython.cclass 表示BFSCore为C类型的Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty])表示OlapBase[Empty]的指针，类似C++中OlapBase[Empty]*
+    # cython提供了常见类型的指针，如cython.p_int, cython.p_char等，表示int*, char*, ...
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t 声明root为C++ size_t类型变量，等效于root = cython.declare(size_t)
+    # 不声明类型的变量为Python object类型
+    # 声明变量类型会大幅提高性能，同时在多线程部分，只有C/C++类型的变量可以访问
+
+    @cython.cfunc
+    # cython.cfunc 表示Work为C类型的函数，参数与返回值应声明
+    # cfunc性能好，能接受C/C++对象为参数、返回值，但是不能在其他python文件中调用
+    # 类似的有cython.ccall，如Standalone函数，可以在其他python文件中调用
+    @cython.nogil
+    # cython.nogil 表示释放Python全局解释锁，在nogil修饰的部分，不能访问Python对象
+    # 在多线程部分，都应有nogil修饰器
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) 表示禁用异常传播，将忽略函数内部引发的Python异常
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbour
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 表示dst没有被bfs访问过
+                if self.active_out.Add(dst):
+                    # 将dst设置为为活跃节点；ParallelBitmap.Add为原子操作，防止重复计算
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython.size_t:
+        self.graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self.parent.Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self.active_in.Add(self.root)
+        while num_activations > 0:
+            self.active_out.Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self.active_out.Swap(self.active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time.time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # 并行创建OlapOnDB
+    # Cython不支持如 *db 的解引用操作，通过db[0]来解引用
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # 通过 GetVertexIndexIterator 根据root节点label名和filed名与filed值（root_id）
+    # 获取root节点的迭代器，通过迭代器获取vid，在无ID_MAPPING时，该vid与OlapOnDB中的id相同
+    cost = time.time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time.time()
+    count = a.run(cython.address(olapondb), root_vid)
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb.NumVertices()
+    response["num_edges"] = olapondb.NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone为Standalone模式下插件入口，用cython.ccall修饰
+    # 可以任意设置参数，相应修改procedures/algo_cython/run_standalone.py即可
+    cost = time.time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config为C++类，config.input_dir为std::string，Python str需要encode才能传给std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # 读入图
+    cost = time.time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time.time()
+    a = BFSCore()
+    count = a.run(cython.address(graph), root)
+    # cython.address(graph)，取址，类似C++中&graph
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices".format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process为embed模式和procedure模式下插件入口，用cython.ccall修饰
+    # Process函数必须名为Process，参数为lgraph_db_python.PyGraphDB与bytes
+    # 返回值必须为(bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # 获取PyGraphDB中GraphDB对象的地址，转换为指针后传递
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..7bf7f3ebf1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/6.algorithms.md
@@ -0,0 +1,189 @@
+# 内置算法
+
+> 此文档主要详细介绍了TuGraph内置的算法程序，社区版6种算法可参考基础算法报
+
+## 简介
+
+TuGraph目前包含以下6个基础算法28种扩展算法，共34个图算法：
+
+### 基础算法包：
+| 中文算法名 | 英文算法名 | 程序名
+|  :----:  | :----: | :----: |
+| 广度优先搜索 | Breadth-First Search  | bfs 
+| 网页排序 | Pagerank | pagerank 
+| 单源最短路径 | Single-Source Shortest Path | sssp 
+| 弱连通分量 | Weakly Connected Components | wcc 
+| 平均集聚系数 | Local Clustering Coefficient  | lcc
+| 标签传播 | Label Propagation Algorithm | lpa 
+
+### 扩展算法包：
+| 中文算法名 | 英文算法名 | 程序名
+| :----: | :----: | :----: |
+| 全对最短路径 | All-Pair Shortest Path  | apsp 
+| 介数中心度 | Betweenness Centrality | bc 
+| 置信度传播 | Belief Propagation | bp
+| 距离中心度 | Closeness Centrality | clce
+| 共同邻居 | Common Neighborhood | cn 
+| 度数关联度 | Degree Correlation  | dc
+| 直径估计 | Dimension Estimation | de 
+| EgoNet算法 | EgoNet | en
+| 超链接主题搜索 | Hyperlink-Induced Topic Search | hits
+| 杰卡德系数 | Jaccard Index | ji
+| K核算法 | K-core | kcore
+| 鲁汶社区发现 | Louvain | louvain 
+| 多源最短路径 | Multiple-source Shortest Paths | mssp
+| 个性化网页排序 | Personalized PageRank | ppr
+| 强连通分量 | Strongly Connected Components | scc 
+| 监听标签传播 | Speaker-listener Label Propagation Algorithm | slpa
+| 两点间最短路径 | Single-Pair Shortest Path | spsp
+| 三角计数 | Triangle Counting | triangle 
+| 信任指数排名 | Trustrank | trustrank 
+| 带权重的标签传播 | Weighted Label Propagation Algorithm | wlpa 
+| 带权重的网页排序 | Weighted Pagerank Algorithm | wpagerank 
+| 最大独立集算法 | Maximal independent set | mis 
+| sybil检测算法 | Sybil Rank | sybilrank 
+| 子图匹配算法 | Subgraph Isomorphism | subgraph_isomorphism
+| 模式匹配算法 | Motif | motif
+| k阶团计数算法 | Kcliques | kcliques
+| k阶桁架计数算法 | Ktruss | ktruss 
+| 莱顿算法 | Leiden | leiden
+
+## 基础算法包
+
+### 广度优先搜索
+
+广度优先搜索实现了Breadth-first Search算法，从根点开始，沿着图的宽度遍历所有可访问点。返回结果为遍历点个数。算法内容请参考 [https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 网页排序
+
+网页排序程序实现了常用的Pagerank算法。该算法根据图中边和边权值计算所有点的重要性排名，PageRank值越高，表示该点在图中的重要性越高。计算时以点数量的倒数为各点初始Rank值，然后将点的Rank值按照出边平均传递到相邻点，重复该传递过程直到满足给定的收敛阈值或达到给定迭代轮数。每轮传递结束后，所有点的Rank值会有一定的的比例随机传递到任意点上。算法内容请参考 [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 单源最短路径
+
+单源最短路径实现了Single Source Shortest Path算法，根据给定的源点，计算从该源点出发到其他任意点的最短路径长度。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 弱连通分量
+
+弱连通分量程序实现了Weakly Connected Components算法，该算法会计算图中所有的弱连通分量。弱连通分量是图的一个子图，子图中任意两点之间均存在可达路径。算法内容请参考[https://en.wikipedia.org/wiki/Connected_component_(graph_theory)](https://en.wikipedia.org/wiki/Connected_component_(graph_theory) "scc wiki")。
+
+### 平均集聚系数
+
+平均集聚系数程序实现了Local Clustering Coefficient算法，计算图中点之间聚集程度的系数。返回结果包括整体集聚系数和点集聚系数。整体集聚系数反映了图中整体的集聚程度的评估，点集聚系数包括任意点的集聚系数，反映了该点附近的集聚程度。集聚系数越高，表示集聚程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 标签传播
+
+标签传播算法程序实现了Label Propagation Algorithm算法。该算法是基于标签传播的社区发现算法，计算对象为无权图。在标签传递时，每个点对收到的所有标签进行次数累加，在累加和最高的标签中随机选择一个。迭代收敛或执行到给定轮数后算法终止。最终输出结果为每个点的标签，标签值相同的点视为在同一社区。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+
+## 扩展算法包
+
+### 全对最短路径
+
+全对最短路径程序实现了All-Pair Shortest Path算法，计算图中任意两点间的最短路径。返回结果为任意存在路径的点对之间的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 介数中心度
+
+介数中心度程序实现了Betweenness Centrality算法，估算图中所有点的介数中心度值。介数中心度值反映了图中任一最短路径经过该点的可能性，值越高表示有越多的最短路径经过了该点。计算时需给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 置信度传播
+
+置信度传播程序实现了Belief Propagation算法。该算法给定已观测点的边缘分布，利用点之间相互传递消息的机制来估算未观测点的边缘分布。算法内容请参考[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 距离中心度
+
+距离中心度程序实现了Closeness Centrality算法，估算任意点到图中其他点的最短路径的平均长度。距离中心度越小，表示该点到其他点的平均最短距离最小，意味着该点从几何角度看更位于图的中心位置。计算时需要给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki")。
+
+### 共同邻居
+
+共同邻居程序实现了Common Neighborhood算法，计算任意给定相邻点对之间的共同邻居数量。计算时给定待查询的若干个点对，返回结果为待查询的任意点对的共同邻居数量。
+
+### 度数关联度
+
+度数关联度程序实现了Degree Correlation算法，通过计算任意相邻点对之间的Pearson关联系数来计算图的度数关联度，可用来表征图中高度数点之间关联程度。度数关联度越高，表示图中高度数点之间的关联程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 直径估计
+
+直径估计程序实现了Dimension Estimation算法。该算法会计算图中最长的最短路径长度，用来表征图的直径大小。算法内容请参考[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### EgoNet算法
+
+EgoNet算法需要给定根点和K值，以根点为源点进行宽度优先搜索，找出所有K度以内的邻居组成的子图。找到的子图称为根点的EgoNet。
+
+### 超链接主题搜索
+
+超链接主题搜索算法实现了Hyperlink-Induced Topic Search算法，该算法假定每个点具有权威性Authority和枢纽性Hub两个属性，一个好的枢纽点应该指向许多高权威性的点，而一个良好的权威点应该被许多高枢纽型的点指向。算法将返回每个点的权威性值和枢纽性值。算法内容请参考[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 杰卡德系数
+
+杰卡德系数程序实现了Jaccard Index算法。该算法计算了给定点对之间的Jaccard系数，可用来表示这两个点的相似度。Jaccard系数越高，表示点对之间的相似程度越高。计算时给定带查询的若干点对，返回结果为这些点对的Jaccard系数。算法内容请参考[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### k核算法
+
+k核算法实现了k-core算法。该算法计算所有点的核数，或找出图中所有的K核子图。K核子图是一种特殊子图，子图中任意点度数都不小于给定K值。算法内容请参考 [https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)](https://en.wikipedia.org/wiki/Degeneracy_(graph_theory) "kcore wiki")。
+
+### 鲁汶社区发现
+
+鲁汶社区发现程序实现了Fast-unfolding算法。该算法是基于模块度的社区发现算法，通过不断合并点社区来最大化图的模块度，能够发现层次性的社区结构。算法内容请参考 [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 多源最短路径
+
+多源最短路径程序实现了Multiple-source Shortest Paths算法，根据给定的多个源点，从这些源点出发，计算到达任意点的最短路径值。其中，多个源点到某一点的最短路径值为分别从每个源点出发到达该点的最短路径的最小值。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 个性化网页排序
+
+个性化网页排序程序实现了Personalized PageRank算法。该算法根据给定的源点，基于该源点个性化计算所有点对于源点的重要性排名。Rank值越高，表示该点对于源点越重要。与PageRank不同的是，初始化时源点Rank值为1，其余点Rank值为0；并且每轮传递结束后，Rank值会有一定的比例随即传递回源点。算法内容请参考 [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 强连通分量
+
+强连通分量程序实现了Strongly Connected Components算法。该算法计算了图中所有的强连通分量，强连通分量是图的一个子图，子图中可从任意点出发到达其他任意点。算法内容请参考[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 监听标签传播
+
+监听标签传播算法程序实现了Speaker-listener Label Propagation Algorithm算法。该算法是基于标签传播和历史标签记录的社区发现算法，是对标签传播算法的扩展。与标签传播算法不同的是，本算法会对所有点记录其历史标签，在迭代中对标签进行累加时，会将历史标签也计算在内。最终输出结果为每个点的所有历史标签记录。算法内容请参考论文：“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 两点间最短路径
+
+两点间最短路径程序实现了Bidirectional Breadth-First Search算法，在有向无权图上从起点沿着出边做正向宽度优先搜搜，从终点沿着入边做反向宽度优先搜索，通过起点和终点共同遍历到的点来确定从起点到终点的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 三角计数
+
+三角计数实现了Triangle-counting算法，计算无向图中的三角形个数，可用来表征图中点的关联程度。三角形数越多，表示图中点的关联程度越高。算法内容请参考论文：“Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study” 。
+
+### 信任指数排名
+
+信任指数排名算法实现了Trustrank算法，可以根据给定的白名单，计算任意点的信任指数。信任指数越高，表示该点为非法点的可能性越小。算法内容请参考 [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 带权重的标签传播
+
+带权重的标签传播算法程序实现了Weighted Label Propagation Algorithm算法。=与标签传播算法不同的是，标签的传递跟边的权重相关，在标签传递时，每个点会根据标签的入边进行权重累加，在累加和最高的标签中随机选择一个。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 带权重的网页排序
+
+带权重的网页排序算法程序实现了Weighted Pagerank算法。与PageRank算法不同的是，Rank值的传递跟边的权重有关，点的Rank值将按照边权重加权传递到相邻点。算法内容请参考[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 最大独立集算法
+
+最大独立集算法实现了Maximal independent set算法。最大独立集是指在这个独立集之外没有可以加入它的点。一个图可能有许多大小差异很大的 MIS，算法找出其中一个。算法内容请参考 [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### Sybil检测算法
+
+Sybil检测算法实现了Sybil Rank算法。SybilRank算法从非Sybil节点开始进行提前终止的随机游走。算法内容请参考论文：“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 子图匹配算法
+
+子图匹配算法实现了subgraph_isomorphism算法。subgraph_isomorphism算法对全图所有节点匹配子图，最后输出每个节点被匹配的次数。算法内容参考 [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 模式匹配算法
+
+模式匹配算法实现了motif算法。motif算法对指定的节点匹配k阶子图，最后输出每个指定节点每种k阶子图个数，每个k阶子图用一个64位整数表示，整数的第$i \times k + j$位为1表示子图中有边i->j。算法内容参考 [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### k阶团计数算法
+
+k阶团计数算法实现了k-cliques算法。k-cliques算法对计算图中所有的k阶完全子图的个数，最后输出每个节点所在的k阶完全子图个数。算法内容参考 [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### k阶桁架计数算法
+
+k阶桁架计数算法实现了k-truss算法。k-truss指每条边都至少是k-2个三角形的边的子图。k-truss算法找出图的k-truss子图，最后输出每个节点在子图中的邻居节点列表。算法内容参考 [https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+### 莱顿算法
+
+莱顿算法实现了了leiden算法。leiden算法是基于模块度的社区发现算法，与louvain算法优势在于leiden算法检测出社区中的断链，保证每个社区具有良好的连通性。算法内容参考 [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst
new file mode 100644
index 0000000000..bc80c68c65
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/2.olap/index.rst
@@ -0,0 +1,8 @@
+分析接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
new file mode 100644
index 0000000000..47d0207278
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/1.procedure.md
@@ -0,0 +1,344 @@
+# Procedure API
+
+> 此文档主要讲解 TuGraph 的存储过程使用说明
+
+## 1.简介
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个请求并在客户端完成整个处理流程的方式，TuGraph 提供的存储过程是更简洁和高效的选择。
+
+与传统数据库类似，TuGraph 的存储过程运行在服务器端，用户通过将处理逻辑（即多个操作）封装到一个过程单次调用，并且可以在实现时通过并行处理的方式（例如使用相关的 C++ OLAP 接口以及基于其实现的内置算法）进一步提升性能。
+
+存储过程中有一类特殊的API来进行数据的并行操作，我们叫 Traversal API，见[文档](2.traversal.md)。
+
+## 2.存储过程的版本支持
+
+目前TuGraph支持两个版本的存储过程，适用于不同的场景，v3.5版本只支持v1，可通过REST或RPC接口直接调用；从v3.5版本开始支持v2，能够在图查询语言（比如Cypher）中嵌入调用，我们称之为POG（Procedure On Graph query language，APOC）。
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+| 适用场景                 | 极致性能，或者复杂的多事务管理情形       | 一般情况，与Cypher高度联动 |
+| 事务                    | 函数内部创建，可自由控制多事务          | 外部传入函数，单一事务     |
+| 签名（参数定义）          | 无                                 | 有                    |
+| 输入输出参数类型          | 不需要指定                           | 需要指定参数类型        |
+| Cypher Standalone Call | 支持                                | 支持                  |
+| Cypher Embeded Call    | 不支持                              | 支持                  |
+| 语言                    | C++/Python/Rust                    | C++                  |
+| 调用模式                 | 直接传字符串，一般为JSON               | 通过Cypher语句中的变量  |
+
+在TuGraph中，存储过程v1和v2单独管理，支持增删查，但仍不建议重名。
+
+## 3.存储过程语言支持
+
+在 TuGraph 中，用户可以动态的加载，更新和删除存储过程。TuGraph 支持 C++ 语言、 Python 语言和 Rust 语言编写存储过程。在性能上 C++ 语言支持的最完整，性能最优。
+
+注意存储过程是在服务端编译执行的逻辑，和客户端的语言支持无关。
+
+## 4.Procedure v1接口
+
+## 4.1.编写存储过程
+
+### 4.1.1.编写C++存储过程
+
+用户可以通过使用 Procedure API 或者 Traversal API 来编写 C 存储过程。一个简单的 C 存储过程举例如下：
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## 统计所有年龄为10的学生数量
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+从代码中我们可以看到，存储过程的入口函数是`Process`函数，它的参数有三个，分别为：
+
+- `db`: 数据库实例
+- `request`: 输入请求数据，可以是二进制字节数组，或者 JSON 串等其它任意格式。
+- `response`: 输出数据，可以是字符串，也可以直接返回二进制数据。
+
+`Process`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误，此时用户可以通过`response`来返回错误信息以方便调试。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`age_10`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 age_10.so，然后用户就可以将它加载到服务器中了。
+
+### 4.1.2.编写Python存储过程
+
+与 C++类似，Python 存储过程也可以调用 core API，一个简单的例子如下：
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+Python 存储过程返回的是一个 tuple，其中第一个元素是一个布尔值，表示该存储过程是否成功执行；第二个元素是一个`str`，里面是需要返回的结果。
+
+Python 存储过程不需要编译，可以直接加载。
+
+## 4.2.如何使用存储过程
+### 4.2.1.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`age_10.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`age_10.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+### 4.2.2.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+### 4.2.6.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
+
+## 5.Procedure v2接口
+
+下面的说明以 REST API 为例，介绍存储过程v2的调用。
+
+### 5.1.编写存储过程
+
+
+用户可以通过使用 lgraph API 来编写 C++ 存储过程。一个简单的 C++ 存储过程举例如下：
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   std::string &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response = std::string("error parsing json: ") + e.what();
+        return false;
+    }
+
+    Result result({{"node", LGraphType::NODE},
+                   {"salt", LGraphType::FLOAT},
+                   });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = result.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    response = result.Dump();
+    return true;
+}
+```
+
+从代码中我们可以看到：
+- 存储过程定义了一个获取签名的方法`GetSignature`。该方法返回了存储过程的签名，其中包含输入参数名称及其类型，返回参数及其类型。这使得Cypher查询语句在调用存储过程能够利用签名信息校验输入数据以及返回数据是否合理。
+- 入口函数是`ProcessInTxn`函数，它的参数有三个，分别为：
+
+- `txn`: 存储过程所处的事务，通常来说即调用该存储过程的Cypher语句所处事务。
+- `request`: 输入数据，其内容为`GetSignature`中定义的输入参数类型及其Cypher查询语句中传入的值经过json序列化后的字符串。e.g. `{num_iteration: 10}`
+- `response`: 输出数据，为保证在Cypher语言中能够兼容，用户可以通过往`lgraph_api::Result` 写入存储过程处理后的数据，最后用`lgraph_api::Result::Dump`来序列化成json格式的数据。
+
+`ProcessInTxn`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`custom_pagerank`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 custom_pagerank.so，然后用户就可以将它加载到服务器中了。
+
+
+### 5.2.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`custom_pagerank.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`custom_pagerank.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+#### 5.2.1.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+#### 5.2.5.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
new file mode 100644
index 0000000000..9613828c50
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/2.traversal.md
@@ -0,0 +1,128 @@
+# Traversal API
+
+> 此文档主要讲解 TuGraph 的存储过程中的Traversal API
+
+## 1. 简介
+
+TuGraph 强大的在线分析处理（OLAP）能力是其区别于其它图数据库的一个重要特性。
+借助 C++ OLAP API（olap_on_db.h），用户可以快速地导出一个需要进行复杂分析的子图，然后在其上运行诸如 PageRank、连通分量、社区发现等迭代式图计算过程，最后根据结果做出相应决策。
+导出和计算的过程都可以通过并行处理的方式进行加速，从而实现几乎实时的分析处理，避免了传统解决方案需要将数据导出、转换、再导入（ETL）到专门的分析系统进行离线处理的冗长步骤。
+
+TuGraph 内置了大量常用的图分析算法和丰富的辅助接口，因此用户几乎不需要自己来实现具体的图计算过程，只需在实现自己的存储过程时将相应算法库的头文件（.h 文件）包含到自己程序中，并在编译时链接相应的动态库文件（.so）即可。
+一般情况下，用户需要自己实现的只有将需要分析的子图抽取出来的过程。
+
+目前 Traversal API 仅支持 C++。
+
+## 2. 接口说明
+
+### 2.1. Snapshot
+
+C++ OLAP API 中的 Snapshot 模版类用于表示抽取出来的静态子图，其中 EdgeData 用来表示该子图上每条边所用权值的数据类型（如果边不需要权值，使用 Empty 作为 EdgeData 即可）。
+
+抽取的子图通过 Snapshot 类的构造函数来描述：
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+其中，db 为数据库句柄，txn 为事务句柄，flags 为生成时使用的选项，可选值包括以下的组合：SNAPSHOT_PARALLEL 表示导出时使用多个线程进行并行；SNAPSHOT_UNDIRECTED 表示需要将导出的图变为无向图。
+vertex_filter 是面向点的用户自定义过滤函数，返回值为 true 表示该点需要被包含到待抽取的子图中，反之则表示需要被排除。
+out_edge_filter 是面向边的用户自定义过滤函数，返回值为 true 表示该边需要被包含到待抽取的子图中，反之则表示需要被排除。
+当过滤函数为缺省值时，则表示需要将所有点/边都包含进来。
+
+Snapshot 类提供的其它方法请参考详细的 C++ API 文档（olap_on_db.h）。
+
+### 2.2. Traversal
+
+图数据库中十分常见的一大类分析是基于一个或多个点出发，逐层地拓展并访问邻居。
+尽管这类分析也可以使用 Cypher 完成，但是当访问的层数较深时，其性能会受到串行解释执行的限制。
+使用 C++ Core API 编写存储过程尽管避免了解释执行，但依然受限于单个线程的处理能力。
+为了让用户能够方便地通过并行处理的方式加速这一类应用场景，我们基于 C++ OLAP API 封装了一个 Traversal 框架，用户可以直接使用其中的 FrontierTraversal 和 PathTraversal 类来完成这种逐层遍历的分析任务，具体的使用方法可以参考相应的 C++ API 文档（lgraph_traversal.h）。
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+该方法可用于找到所有满足条件（filter 返回 true）的点，当 parallel 为 true 时则会并行该查找过程。
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+该方法可用于从指定点集（frontier）中（通过 extract 方法）抽取（类型为 VertexData 的）属性，当 parallel 为 true 时会并行该抽取过程。
+
+FrontierTraversal 适用于只关注遍历扩展到的点集的情况；当用户在遍历过程或是结果中需要访问路径上的信息（路径上的点/边）时，则需要使用 PathTraversal。
+两类 Traversal 的构造函数均有四个参数，分别为数据库句柄 db、事务句柄 txn、选项 flags 和 初始化数组容量 capacity。
+选项的可选值包括以下的组合：TRAVERSAL_PARALLEL 表示遍历时使用多个线程并行；TRAVERSAL_ALLOW_REVISITS 表示遍历时允许重复地访问点（PathTraversal 隐含了该选项）。capacity 表示初始化时路径集合的容量。
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+两类 Traversal 设置遍历的起始点/点集有上述三种方式，前两种通过点 ID 直接指定，最后一种方式则类似于 FindVertices。
+
+两类 Traversal 的遍历都是从当前层的点集合出发，根据使用的扩展函数访问每条出边/入边/出边和入边，通过用户自定义的过滤函数决定扩展是否成功，若成功则将邻居点/追加了该条边的路径加入下一层的点/路径集合。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+上述为 FrontierTraversal 的三种遍历方式，即从当前的点集合出发，对集合中的每个点，依次访问每条出边/入边/出边和入边，若满足用户自定义的过滤条件（其中，edge_filter 为面向边的过滤函数，neighbour_filter 则为面向邻居点的过滤函数），则将邻居点加入新的点集合。
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+当前点集合的扩展结束后，新的点集合可以通过上述方法取得。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+PathTraversal 的三种遍历方式与 FrontierTraversal 类似，只是用户自定义的过滤函数中增加了两个参数，其中：Path 包含了到新扩展的这条边之前的路径，IteratorHelper 可用于将路径中的点/边转为数据库中对应的迭代器，相关文档可参考对应的 C++ API 文档。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
new file mode 100644
index 0000000000..abc5ce2ccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/1.base64_encode.rst
@@ -0,0 +1,5 @@
+base64_encode
+===================================
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
new file mode 100644
index 0000000000..b321c843d6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/10.lgraph_result.rst
@@ -0,0 +1,5 @@
+lgraph_result
+===================================
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
new file mode 100644
index 0000000000..0f53077dbc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/11.lgraph_rpc_client.rst
@@ -0,0 +1,5 @@
+lgraph_rpc_client
+===================================
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
new file mode 100644
index 0000000000..d7a9d7b97c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/12.lgraph_traversal.rst
@@ -0,0 +1,5 @@
+lgraph_traversal
+===================================
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
new file mode 100644
index 0000000000..4b0be46a21
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/13.lgraph_txn.rst
@@ -0,0 +1,5 @@
+lgraph_txn
+===================================
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
new file mode 100644
index 0000000000..4047340ef0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/14.lgraph_types.rst
@@ -0,0 +1,5 @@
+lgraph_types
+===================================
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
new file mode 100644
index 0000000000..12814e7618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/15.lgraph_utils.rst
@@ -0,0 +1,5 @@
+lgraph_utils
+===================================
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
new file mode 100644
index 0000000000..572f9ae7c0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/16.lgraph_vertex_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
new file mode 100644
index 0000000000..5bfa8a1dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/17.lgraph_vertex_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_vertex_iterator
+===================================
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
new file mode 100644
index 0000000000..8680a93ee9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/18.olap_base.rst
@@ -0,0 +1,5 @@
+olap_base
+===================================
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
new file mode 100644
index 0000000000..9ce3afba80
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/19.olap_on_db.rst
@@ -0,0 +1,5 @@
+olap_on_db
+===================================
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
new file mode 100644
index 0000000000..5bed2e061c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/2.lgraph.rst
@@ -0,0 +1,5 @@
+lgraph
+===================================
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
new file mode 100644
index 0000000000..82bf0941c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/20.olap_profile.rst
@@ -0,0 +1,5 @@
+olap_profile
+===================================
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
new file mode 100644
index 0000000000..8723e9f1d0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/3.lgraph_atomic.rst
@@ -0,0 +1,5 @@
+lgraph_atomic
+===================================
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
new file mode 100644
index 0000000000..ec8af7bb8f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/4.lgraph_date_time.rst
@@ -0,0 +1,5 @@
+lgraph_date_time
+===================================
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
new file mode 100644
index 0000000000..07d6076327
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/5.lgraph_db.rst
@@ -0,0 +1,5 @@
+lgraph_db
+===================================
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
new file mode 100644
index 0000000000..07f4be3f67
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/6.lgraph_edge_index_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_index_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
new file mode 100644
index 0000000000..5be9e6547e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/7.lgraph_edge_iterator.rst
@@ -0,0 +1,5 @@
+lgraph_edge_iterator
+===================================
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
new file mode 100644
index 0000000000..70a0bd4cbf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/8.lgraph_exceptions.rst
@@ -0,0 +1,5 @@
+lgraph_exceptions
+===================================
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
new file mode 100644
index 0000000000..a4f9af0582
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/9.lgraph_galaxy.rst
@@ -0,0 +1,5 @@
+lgraph_galaxy
+===================================
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
new file mode 100644
index 0000000000..445ef76484
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/3.C++-procedure/index.rst
@@ -0,0 +1,8 @@
+C++存储过程接口
+===================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..4075d5bad5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst
@@ -0,0 +1,25 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python存储过程接口
+====================================
+Version: 4.1.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+介绍
+------------------
+与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。
+
+这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。
+
+接口
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..6f3114566f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/5.Rust-procedure.md
@@ -0,0 +1,19 @@
+# Rust 存储过程
+
+## 1. 介绍
+Rust 存储过程目前仅支持v1版本，TuGraph能够支持一切编译成动态库的语言作为插件。Rust语言作为系统编程语言的新起之秀，在安全性上、可靠性以及人体工程学上相较于C++具有较大优势。
+
+我们提供了TuGraph的[Rust binding]库来支持在Rust中调用lgrahp api，同时提供[tugraph-plugin-util] 工具库来帮助大家更加简洁地编写Rust插件代码。
+
+[Rust binding]: https://crates.io/crates/tugraph
+[tugraph-plugin-util]: https://crates.io/crates/tugraph-plugin-util
+
+## 2. 如何使用
+
+Rust存储过程的使用分三步：
+* 编译，从rust源码编译出so库。我们准备了一份一站式的插件编写教程，从IDE的插件安装，环境配置，到编译，详细参考`rust-tugraph-plugin-tutorial`。
+* 加载，将so库加载到服务端，可以通过REST或RPC接口，这一步和C++库的使用方式类似，可以参考[文档](1.procedure.md#4.Procedure v1接口)。
+* 运行，和c++ procdure使用方式相同，不在赘述。
+
+## 3.API文档
+Rust社区习惯，所有的代码和文档都可以从[`crates.io`](https://crates.io/crates/tugraph )以及[`docs.rs`](https://docs.rs/tugraph/latest/tugraph )找到。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile
new file mode 100644
index 0000000000..e5e5a28405
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.1.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = Chinese
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst
new file mode 100644
index 0000000000..1fbd71dffb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst
@@ -0,0 +1,12 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure/index.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
new file mode 100644
index 0000000000..81b77be986
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/3.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api-legacy.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api-legacy.md
new file mode 100644
index 0000000000..5568de0cc3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/1.restful-api-legacy.md
@@ -0,0 +1,2918 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+**注意：除"登陆"、"查询"和"存储过程"外，其余接口自 **2023年4月30日** 起将不再提供支持，统一使用Cypher接口提供服务。**
+
+## 2.请求与数据格式
+
+### 2.1请求
+
+TuGraph 支持 HTTP GET/POST/PUT/DELETE 请求。其中：
+
+- GET 请求用于只读请求，如读取点属性，边属性等操作；
+- POST 请求用于创建实体，提交 Cypher，以及加载和调用存储过程；
+- PUT 请求用于修改已有实体，如修改点属性，边属性等；
+- DELETE 请求用于删除已有实体，如删除点，边等。
+
+在高可用模式下，用户可以在请求的报头(request header)中设置 `server_version` 来保证请求的服务器有足够新的数据。
+当前的 `server_version` 可以从服务器返回的报头中获取。
+
+### 2.2.数据格式
+
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.3.返回值
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 307 Temporary Redirect: 操作被重定向，一般用于高可用模式下，把操作重定向到 master 上
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 500 Internal Server Error: 服务器端错误
+
+当操作成功时，返回的 JSON 中包含操作的返回值。当操作重定向时，返回的 HTTP 报头中的 `location` 域包含重定向目的地址。
+当发生输入错误或者服务器错误时，返回的 JSON 中包含 `error_message` 域，其内容是错误提示。
+
+在高可用模式下，服务器还会在报头中设置 `server_version`，以告知客户端当前服务器的数据版本号。当客户端在不同的服务器之间切换时，该数据版本号可以保证客户端不会读到错误的历史数据。
+
+### 2.4.URI格式
+
+TuGraph REST API 提供以下功能：Service Root, login, info, label, index, node, relationship, cypher, cpp_plugin, 以及 python_plugin。
+各功能使用的 URI 格式如下：
+
+| URI     | 说明                 |
+| ------- | -------------------- |
+| /web    | web 可视化界面       |
+| /cypher | cypher 请求          |
+| /acl    | 权限控制             |
+| /user   | 用户管理             |
+| /login  | 用户登录             |
+| /info   | 数据库状态及提示信息 |
+| /task   | 任务管理             |
+| /db     | 子图操作             |
+
+其中子图操作又分为：
+
+| URI                              | 说明                 |
+| -------------------------------- | -------------------- |
+| /db                              | 子图的创建，删除     |
+| /db/_{graph_name}_/node          | 点操作             |
+| /db/_{graph_name}_/relationship  | 边操作               |
+| /db/_{graph_name}_/label         | Label 相关操作       |
+| /db/_{graph_name}_/index         | 索引相关操作         |
+| /db/_{graph_name}_/cypher        | 子图相关 cypher 操作 |
+| /db/_{graph_name}_/cpp_plugin    | C++存储过程          |
+| /db/_{graph_name}_/python_plugin | Python 存储过程      |
+| /db/_{graph_name}_/import        | 在线导入             |
+| /db/_{graph_name}_/misc          | 其它操作             |
+
+## 3.登录
+
+TuGraph 提供基于 JWT 的用户认证方式，可以使用 HTTP 或 HTTPS 协议进行传输。系统默认使用 HTTP 协议，如果需要使用 HTTPS，需要在 lgraph.json 配置文件中将 ssl_auth 设为 1。
+
+### 3.1.登录
+
+用户通过用户名和密码发送登录请求。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，并且用于以后的每次发送请求。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**: `/login`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+  | default_password | 是否为默认密码 | 布尔值 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.身份刷新
+Token失效后，前端发起刷新token接口，后端验证token合法性。初次登录后，1小时内有效，需刷新使用。即使刷新，24小时后也会强制退出，需要重新登陆。
+验证通过，生成新的token；验证失败返回状态码401。
+
+- **URI**: `/refresh`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.修改Token有效期
+修改Token有效期，需要传输jwt，refresh_time和expire_time三个参数，其中jwt用于校验用户身份，refresh_time和expire_time等于0时，有效期为无期限，超过refresh_time时，需要调用refresh接口获取新的Token;超过expire_time时，需要重新登录。
+
+- **URI**: `/update_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+  | refresh_time | 有效时间（默认设置为0） | Int64 |
+  | expire_time | 有效时间（默认设置为0） | Int64 |
+
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0,
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.查询Token有效期
+查询Token有效期，需要传输jwt，用于校验用户身份，返回，refresh_time和expire_time，其中refresh_time表示刷新时间，超过时需要调用refresh接口获取新的Token;expire_time表示过期时间，超过时需要重新登录。
+- **URI**: `/get_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+
+- **RESPONSE**:  如果成功，返回"refresh_time"和"expire_time"。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+
+### 3.5.登出
+用户登出，同时删除token。
+
+- **URI**: `/logout`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/logout
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 4.查询
+
+URI 格式为
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.调用Cypher
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 列表 |
+  | elapsed | 运行时间（秒） | 浮点数 |
+  | header | 返回结果的表头 | 列表 |
+  | size | 结果数 | 整型 |
+
+其中 header 是一个列表，每一元素格式如下：
+
+| 域名 | 说明                                        | 类型   |
+| ---- | ------------------------------------------- | ------ |
+| name | 列名                                        | 字符串 |
+| type | 列数据类型，0 为标量，1 为点 id，2 为向量 |        |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.调用带参数的 Cypher
+
+Cypher 支持使用参数进行查询。当调用带参数的 Cypher 查询时，TuGraph 会缓存该查询的
+执行计划（execution plan），以加速后续同类查询的速度。
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+  | parameters | 参数 | 列表 |
+
+- **RESPONSE**:
+
+与 [调用 Cypher](#%E8%B0%83%E7%94%A8Cypher) 相同。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+
+## 5.存储过程
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.加载存储过程
+
+TuGraph 服务启动时，如果 load_plugins 为真，则会自动加载 plugin 目录下的所有 plugin。否则需要手动加载。此外，如果服务器运行过程中，管理员更新了 plugin 文件，也需要手动重新加载。重新加载 plugin 的调用格式为：
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 插件名称 | 字符串 |
+  | description | 插件说明 | 字符串 |
+  | code_base64 | 插件代码 | 字符串，使用 base64 编码 |
+  | read_only | 是否为只读存储过程 | 布尔值 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 5.2.列出所有存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程列表，其中每个元素是一个 plugin 的描述，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.获取存储过程的详细信息
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程信息，包括代码，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+  | code_base64 | 存储过程的代码 | 字符串，使用 base64 编码 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.调用存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: POST
+- **REQUEST**: 字符串输入
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | data | 输入数据 | 字符串 |
+  | timeout | 超时长度（秒，可选，缺省值为 0） | 浮点 |
+  | in_process | 是否在本进程调用（可选，缺省值为 false） | 布尔值 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.删除存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 6.Deprecated
+
+以下接口将在4/30/2023之后被删除。
+
+### 6.1.用户管理
+
+系统默认创建一个管理员，管理员用户名为 _admin_，密码为 _73@TuGraph_。为了安全起见，请用户在第一次启动服务器后更改密码。
+
+
+#### 6.1.1.添加用户
+
+添加一个新的用户，并为其设置初始密码。只有管理员有权限进行此操作。其中用户名只能由字母，数字以及下划线构成，密码则可以包含任意字符。用户名和密码长度不能超过 64 字节。添加用户时还可以为用户增加一个描述，用户描述可以包含任意字符，最长不超过 512 字节。
+
+新用户默认拥有同名的角色，不具备任何图的权限。
+
+- **URI**: `/user`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "description": "This is a user"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.列出所有用户
+
+列出数据库的所有用户。只有管理员拥有该操作权限。
+
+- **URI**: `/user/`
+- **METHOD**: GET
+- **RESPONSE**: 所有用户及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin admin user",
+        "roles": ["admin"]
+    },
+    "guest1": {
+        "disabled": true,
+        "description": "",
+        "roles": ["guest1", "some_other_role"]
+    }
+}
+```
+
+#### 6.1.3.获取用户信息
+
+列出给定用户的信息。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "A guest user"
+    "roles": ["guest1", "some_other_role"]
+}
+```
+
+#### 6.1.4.列出用户权限
+
+列出给定用户有权限访问的所有图及相应权限。
+
+- **URI**: `/user/{user_name}/graph`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1/graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "graph1" : "FULL",
+    "graph2" : "READ"
+}
+```
+
+#### 6.1.5.更改用户密码
+
+用户可以更改自己的密码，更改密码时需要同时提供原密码。管理员可以更改所有用户的密码。管理员更改其它用户密码时，可以不提供当前密码。
+
+- **URI**: `/user/{user_name}/password`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | current_password | 当前密码 | 字符串 |
+  | new_password | 新密码 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/password
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.6.修改用户描述
+
+用户可以修改自己的描述。管理员可以修改任意用户的描述。
+
+- **URI**: `/user/{user_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "New description for this user."
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.7.删除用户
+
+删除用户及其所有相关权限，只有管理员拥有该操作权限。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.8.禁用用户
+
+用户可以被禁用。被禁用的用户将不能登陆，但是其资料仍然保存。被禁用的用户可以被重新启用。
+
+- **URI**: `/user/{user_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.9.启用用户
+
+启用一个被禁用的用户。
+
+- **URI**: `/user/{user_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.10.设置用户角色
+
+为指定用户设置角色。只有管理员可以执行此操作。
+
+用户角色列表必须是“全量列表”，即该列表需要包含该用户需要的所有角色。唯一的例外是用户的同名角色，即使列表中不含该角色，它也会被加到用户角色中。
+
+- **URI**: `/user/{user_name}/role`
+- **METHOD**: POST
+- **REQUEST**: 角色列表
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+        ["role1", "role2"]
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+此时用户`guest1`拥有角色`guest1`, `role1`和`role2`。
+
+### 6.2.角色管理
+
+TuGraph 使用基于角色的权限管理。
+
+同一用户可以拥有多个角色。新用户默认拥有与其同名的角色。删除用户时，同名角色也会被删除。如果新建用户时同名角色已经存在，则创建失败。
+
+同一角色可以对多个图有不同的权限。用户对某张图的权限由其所有角色对该图的最高权限决定。
+
+TuGraph 使用四级权限，不用的用户对不同的子图可以有不同的权限，四种权限及其说明如下：
+
+| 权限  | 说明                                                                             |
+| ----- | -------------------------------------------------------------------------------- |
+| NONE  | 无权限                                                                           |
+| READ  | 只读                                                                             |
+| WRITE | 可读写子图中的点和边                                                           |
+| FULL  | 完全权限，包括更改元数据（label, index），管理存储过程，以及删除子图中的所有数据 |
+
+管理员对所有子图都有完全权限，新建的用户对所有子图都没有权限。将用户加入管理员角色中可以将用户提升为管理员。
+
+#### 6.2.1.添加角色
+
+添加一个新的角色，并设置其描述。只有管理员有权限进行此操作。
+
+角色名只能由字母，数字以及下划线构成，密码则可以包含任意字符。角色名长度不能超过 64 字节。
+
+角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | role | 角色名 | 字符串 |
+  | description | 角色描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "role": "new_role",
+        "description": "This is a new role.",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.2.修改角色描述
+
+修改角色的描述。只有管理员有权限进行此操作。角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role/{role_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 新描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "modified description"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.列出所有角色
+
+列出数据库的所有角色。只有管理员拥有该操作权限。
+
+- **URI**: `/role/`
+- **METHOD**: GET
+- **RESPONSE**: 所有角色及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin administrator group.",
+        "permissions": {"default":"FULL", "graph1":"FULL"}
+    },
+    "role1": {
+        "disabled": true,
+        "description": "Another role",
+        "permissions": {"default":"READ"}
+    }
+}
+```
+
+#### 6.2.4.获取角色信息
+
+列出给定角色的信息。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: GET
+- **RESPONSE**: 角色信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "Another role",
+    "permissions": {"default":"READ"}
+}
+```
+
+#### 6.2.5.删除角色
+
+删除指定角色，只有管理员拥有该操作权限。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.6.禁用角色
+
+角色可以被禁用。角色被禁用后，具有该角色的用户将不再从该角色中获得任何权限。只有管理员可以执行此操作。
+
+- **URI**: `/role/{role_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.7.启用角色
+
+启用一个被禁用的角色。
+
+- **URI**: `/role/{role_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.8.设置角色权限
+
+为指定角色设置权限。只有管理员可以执行此操作。
+
+角色权限列表必须是“全量列表”，即该列表需要包含该角色能操作的所有图及其权限。
+
+- **URI**: `/role/{role_name}/permissions`
+- **METHOD**: POST
+- **REQUEST**: 图名称及相应权限的字典。
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/permissions
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "graph1" : "FULL",
+        "graph2" : "READ"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.服务器状态
+
+#### 6.3.1.修改服务器配置
+
+修改服务器配置，配置修改后立即生效，并将影响所有服务器。这些配置的优先级高于配置文件以及命令行参数。
+
+- **URI**: `/config`
+- **METHOD**: PUT
+- **REQUEST**:
+
+请求为一个字典，使用 `{"opt1":v1}` 可以将名为`opt1`的配置修改为`v1`。
+
+| 配置名               | 说明                   | 值类型 |
+| -------------------- | ---------------------- | ------ |
+| OPT_DB_ASYNC         | 是否启用异步模式       | 布尔值 |
+| OPT_TXN_OPTIMISTIC   | 是否默认使用乐观事务锁 | 布尔值 |
+| OPT_AUDIT_LOG_ENABLE | 是否启用审计日志       | 布尔值 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "OPT_DB_ASYNC": true,
+        "OPT_AUDIT_LOG_ENABLE": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.当前服务器状态
+
+- **URI**: `/info`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | lgraph_version | 服务器版本号 | 字符串 |
+  | git_branch | 服务器代码分支 | 字符串 |
+  | git_commit | 服务器代码版本 | 字符串 |
+  | web_commit | 前端码版本 | 字符串 |
+  | cpp_id | CPP 编译器 ID | 字符串 |
+  | cpp_version | CPP 编译器版本 | 字符串 |
+  | python_version | PYTHON 版本 | 字符串 |
+  | node | 点 uri | 字符串 |
+  | relationship | 边 uri | 字符串 |
+  | cpu | cpu 信息 | 字典，格式参见[服务器 CPU 状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8CPU%E7%8A%B6%E6%80%81) |
+  | disk | 硬盘 IO 信息 | 字典，格式参见[服务器硬盘状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%A1%AC%E7%9B%98%E7%8A%B6%E6%80%81) |
+  | memory | 内存信息 | 字典，格式参见[服务器内存状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%86%85%E5%AD%98%E7%8A%B6%E6%80%81) |
+  | db_space | 图数据库占用空间 | 字典，格式参见[图数据库占用空间](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8D%A0%E7%94%A8%E7%A9%BA%E9%97%B4) |
+  | db_config | 图数据库配置信息 | 字典，格式参见[图数据库配置信息](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E9%85%8D%E7%BD%AE%E4%BF%A1%E6%81%AF) |
+  | up_time | 数据库在线时长（秒） | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.服务器 CPU 状态
+
+- **URI**: `/info/cpu`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序 CPU 使用率 | 整型 |
+  | server | 服务器 CPU 使用率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.服务器硬盘状态
+
+- **URI**: `/info/disk`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | read | 服务器硬盘读速率 | 整型 |
+  | write | 服务器硬盘写速率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.服务器内存状态
+
+- **URI**: `/info/memory`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序内存使用量 | 整型 |
+  | server_avail | 服务器可用内存 | 整型 |
+  | server_total | 服务器总内存 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.图数据库占用空间
+
+- **URI**: `/info/db_space`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | space | 图数据库占用空间 | 整型 |
+  | disk_avail | 图数据库可用空间 | 整型 |
+  | disk_total | 服务器硬盘总空间 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "disk_avail"::360074579968,
+      "disk_total"::984373800960,
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.图数据库配置信息
+
+- **URI**: `/info/db_config`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | db_async | 图数据库工作模式（同步或异步） | 布尔值 |
+  | disable_auth | 是否禁用身份验证 | 布尔值 |
+  | enable_ha | 是否启用高可用模式 | 布尔值 |
+  | enable_rpc | 是否启用 RPC 服务器 | 布尔值 |
+  | bind_host | REST 服务器的主机 | 字符串 |
+  | enable_audit_log | 是否启用日志审计 | 布尔值 |
+  | port | REST 服务器的端口 | 整型 |
+  | rpc_port | RPC 服务器的端口 | 整型 |
+  | optimistic_txn | 是否默认使用乐观事务锁 | 布尔值 |
+  | thread_limit | 图数据库应用程序的可用线程数 | 整型 |
+  | enable_ssl | 是否使用 SSL 进行身份验证 | 布尔值 |
+  | verbose | 输出的详细程度 | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "db_async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "bind_host":"127.0.0.1",
+      "enable_audit_log":false,
+      "port":7070,
+      "optimistic_txn":false,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "enable_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.8.高可用服务器列表
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/peers`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回一个服务器信息列表，其中每个服务器信息格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+  | state | 服务器状态 | 字符串 |
+
+其中服务器状态可为 `MASTER`,`SLAVE`,`OFFLINE`。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.9.当前 Leader 信息
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/leader`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前 leader 服务器信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.10.服务器统计信息
+
+- **URI**: `/info/statistics`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前服务器统计信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | requests/second | 每秒处理的请求数量 | 浮点型 |
+  | writes/second | 每秒处理的写请求数量 | 浮点型 |
+  | running_tasks | 正在执行的请求数量 | 整型 |
+  | failure_rate | 请求失败率 | 浮点型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 2.3,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.11.审计日志信息
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | begin_time | 查询日志的起始时间(必填，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | end_time | 查询日志的结束时间(默认为当前时间，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | user | 查询日志的操作者(管理员可查询所有用户的日志，普通用户只能查询本人日志) | 字符串 |
+  | num_log | 查询日志的数量(默认为 100) | 整型 |
+  | descending_order | 查询结果是否降序输出(默认为 true) | 布尔值 |
+
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回审计日志列表，其中每个元素是一条操作日志，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | index | 该操作的索引值 | 整型 |
+  | begin_time | 该操作的开始时间 | 字符串 |
+  | end_time | 该操作的结束时间 | 字符串 |
+  | user | 该操作的发起者 | 字符串 |
+  | graph | 该操作的图 | 字符串 |
+  | type | 该操作的类型 | 字符串 |
+  | read_write | 该操作为读操作或者写操作 | 字符串 |
+  | success | 该操作是否成功 | 布尔值 |
+  | content | 该操作的简要内容 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.任务管理
+
+TuGraph 提供长任务的跟踪和中止功能。用户可以通过 REST API 来查询当前正在运行的在 Cypher 和存储过程查询，并选择中止正在执行的查询。
+
+任务管理对应的 URI 格式为
+
+```
+    http://{host}:{port}/task/{thread_id}/{task_id}
+```
+
+#### 6.4.1.查询正在执行的任务
+
+- **URI**: `/task`
+- **METHOD**: GET
+- **RESPONSE**:
+
+返回的 JSON 为一个数组，其中每一个元素格式如下：
+
+| 域名         | 说明                         | 类型   |
+| ------------ | ---------------------------- | ------ |
+| description  | 任务描述                     | 字符串 |
+| time_elapsed | 任务已经执行的时间，单位为秒 | 浮点   |
+| task_id      | 任务 ID                      | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.中止任务
+
+- **URI**: `/task/{task_id}`
+  其中 `{task_id}` 是 `GET /task` 返回结果中的 `task_id`。
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.5.子图管理
+
+TuGraph 支持多子图，子图之间完全独立，不同的子图可以对不同用户开放不同权限。管理员可以添加和删除子图。
+
+#### 6.5.1.创建新子图
+
+- **URI**: `/db`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 子图名 | 字符串 |
+  | config | 配置 | 字典，格式为 { {列名 1}:{列值 1},... } |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1",
+        "config" : {
+            "max_size_GB":2048,
+            "description": "description of graph1"
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.删除子图
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.列出所有子图
+
+- **URI**: `/db`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_GB":1024,
+            "description":"description of graph1"
+        }
+    }
+```
+
+#### 6.5.4.获取子图信息
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "max_size_GB":1024,
+        "description":"description of graph1"
+    }
+```
+
+### 6.6.元数据管理
+
+TuGraph 是一个具备多图能力的强模式属性图数据库。在每一张子图中，每种点和边都需要有预定义的数据格式。数据格式由 Label 决定，每种 Label 都有自己的数据格式。用户可以使用 REST API 添加，删除和查询 Label 及其对应的数据格式。
+
+Label 操作对应的 URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+其中{type}可以是 node 或者 relationship。
+
+#### 6.6.1.创建Label
+
+创建 Label 的过程同时也是定义其数据类型的过程。只有创建了 Label 才能在图中插入相应类型的点或者边。
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | Label 名 | 字符串 |
+  | fields | 数据列定义 | 列表 |
+  | is_vertex | 是否是点 Label | 布尔值 |
+  | primary | 点的主键属性 | 字符串 |
+  | edge_constraints | 边的约束 | 列表 |
+
+`primary` 在 `is_vertex` 为 `true` 的时候设置，这个字段只有点才有, 创建点的时候必须设置。
+
+`edge_constraints` 在 `is_vertex` 为 `false` 的时候设置，这个字段只有边有。这个字段限制了该边的起点和终点只能是哪些点的组合，比如：`[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`，限制了该边只能是从 `vertex_label1` 到 `vertex_label2` 和 从 `vertex_label3` 到 `vertex_label4`。如果不想有任何限制，不设置该字段即可。
+
+其中`fields`为一个数组，其中每个元素定义数据的一列，内容如下：
+
+| 域名     | 说明                                     | 类型                                                                                                |
+| -------- | ---------------------------------------- | --------------------------------------------------------------------------------------------------- |
+| name     | 列名                                     | 字符串                                                                                              |
+| type     | 列数据类型                               | 字符串，有以下类型： int8, int16, int32, int64, float, double, string, date, datetime, binary, bool |
+| optional | 数据是否可以为空（可选，缺省值为 false） | 布尔值                                                                                              |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.列出所有 Label
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | edge | 边 Label 列表 | 列表 |
+  | vertex | 点 Label 列表 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.获取 Label 的数据格式定义
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+- **METHOD**: GET
+- **RESPONSE**: 数据列定义表，类型是一个词典，key 为列名，value 为列定义，列定义见如下：
+-
+
+| 域名     | 说明             | 类型   |
+| -------- | ---------------- | ------ |
+| optional | 该列值是否可为空 | 布尔值 |
+| type     | 列值类型         | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema 导入
+
+- **URI**: `/db/{graph_name}/schema/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+- **RESPONSE**:
+
+Schema 导入会根据 description 比较新的 Schema 和数据库中原有的 Schema 是否兼容，检查的粒度为 Label。如果不一致则出错，如果一致则添加原先 Schema 中不存在的 Label，返回 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串:
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.点操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+Nodes 提供节点（Vertex）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。
+
+#### 6.7.1.列出点数量和label数量
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | num_label | 点 label 数量 | 整数 |
+  | num_vertex | 点数量 | 整数 |
+
+_注意 num_vertex 返回的并不是准确的点数量，只是一个估计值。_
+
+#### 6.7.2.创建一个点
+
+向数据库中插入一个点。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 点属性 | 字典，其中 key 是列名，value 是相应值。value 必须是与列类型相应的类型，如列为 int32，则 value 只能是整数。 |
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新点 vid。该 ID 可用于后续的点操作中。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.批量创建点
+
+TuGraph 允许一次性插入多个点，以减少网络开销。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | fields | 点属性 | 列表 |
+  | values | 点数据 | 列表 |
+
+其中 fields 是一个字符串列表，列出一系列列名；values 是一个列表，其中每个元素是一个列表，列表中每个元素是列数据。
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新增加的点的 vid 列表，该列表中每一个 vid 按顺序对应请求中的每一个点。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.获取点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 属性 | 字典，格式为 { {列名 1}:{列值 1},...} |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.删除点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 被删掉的点的入边数量 | 整数值 |
+  | out | 被删掉的点的出边数量 | 整数值 |
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.获取点所有属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+- **METHOD**: GET
+- **RESPONSE**: Node 所有属性（字典）
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.获取点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: Node 某一属性
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.更新点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 点属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "********"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.8.边操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+与 Nodes 功能类似，Relationships 提供边（edge）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。每一条边都可以由一个唯一 ID（euid）来标识。这个 ID 可以从在插入边时获得，或者在 [列出所有边](#%E5%88%97%E5%87%BA%E6%89%80%E6%9C%89%E8%BE%B9) 操作中得到。
+
+#### 6.8.1.创建一条边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | destination | 目的点 ID | 整数值 |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid（字符串）。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.批量创建边
+
+- **URI**: `/db/{graph_name}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | fields | 数据列名 | 列表 |
+  | edge | 边数据 | 列表 |
+
+其中 edge 是一个数据列表，其中每个元素都是一条边，其定义如下：
+
+| 域名        | 说明     | 类型                                                   |
+| ----------- | -------- | ------------------------------------------------------ |
+| source      | 起点 id  | 整数                                                   |
+| destination | 终点 id  | 整数                                                   |
+| values      | 数据列表 | 列表，每列对应 fields 中的一个列，类型是该列对应的类型 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid 列表。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.列出所有出边（outgoing relationships）
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+- **METHOD**: GET
+- **RESPONSE**: 点 src 的所有出边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.列出所有入边（incoming relationships）
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+- **METHOD**: GET
+- **RESPONSE**: 点 dst 的所有入边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.列出所有边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 入边 | 列表 |
+  | out | 出边 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationships/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.获取边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | property | 边属性 | 字典 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.删除边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.获取边的所有属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+- **METHOD**: GET
+- **RESPONSE**: 边属性字典
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.获取边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功,返回代码 200,同时返回边的属性。如果失败,返回代码 400,同时返回 "Illegal field."。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.更新边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.9.索引
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+提供索引操作，接受 GET/POST 请求。
+
+#### 6.9.1.创建索引
+
+该操作会启动一个创建索引的后台任务，用户可以通过列出该 Label 相关的所有索引来检查新建索引的状态。
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: POST
+- **REQUEST**:
+
+| 域名    | 说明     | 类型                                  |
+|-------|--------|-------------------------------------|
+| label | Label 名 | 字符串                                 |
+| field | 域名     | 字符串                                 |
+| type  | 索引类型   | int类型，0表示非唯一索引，1表示全局唯一索引，2表示两点间唯一索引 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.列出所有索引
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.列出所有与某个 Label 相关的索引
+
+- **URI**: `/db/{graph_name}/index/{label}`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.删除索引
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.根据索引获取点
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+- **METHOD**: GET
+- **RESPONSE**: 点 vid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+### 6.10.在线增量导入
+
+#### 6.10.1.指定文件内容导入
+
+- **URI**: `/db/{graph_name}/import/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+  | data | 要导入的文件内容（建议最大在 16MB 左右，最长不超过 17MB） | 字符串 / 数组 / 对象 |
+  | continue_on_error | 出错后是否继续导入（可选，默认为`false`
+  ） | 布尔值 |
+  | delimiter | 分隔符（可选，默认为`“,”`
+  ） | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+分隔符可以是单字符，也可以是字符串，但不能包含`\r`或者`\n`。
+
+data 可以是如下形式之一：
+
+- 字符串如 `"1,2\n3,4\n"`
+- ASCII 码组成的数组如 `[49,44,50,10,51,44,52,10]`
+- 形如上述数组的字典如 `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+- **RESPONSE**:
+
+系统**不会**自动执行新建 label、添加索引等操作。在此操作之前需要保证涉及的 label 已经存在并具有适当的索引。
+
+如果成功导入完毕，返回代码 200，并在 `log` 字段返回一些日志信息（可能为空）；否则，保证所有的数据均未被导入，并在 `error_message` 字段返回错误信息。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true,
+      "delimiter": ","
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+由于请求中指定了在出错时继续，该返回信息说明 SRC_ID 为 1 的边没有被导入，而其他信息导入成功。
+
+### 6.11.其他
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.提取子图
+
+给出点 id 集合，返回包含该集合的最小子图。
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | vertex_ids | 点 id 集合 | 列表 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | nodes | 点数据 | 列表，每元素包含 vid, label, 以及属性 |
+  | relationships | 边数据 | 列表，每元素包含 src, dst, euid, label, 以及属性 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example response.**
+
+```
+• 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
new file mode 100644
index 0000000000..21ad033477
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/2.rpc-api.md
@@ -0,0 +1,273 @@
+# RPC API
+
+> 此文档主要介绍 TuGraph 的 RPC API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供丰富的 RPC API，以供开发者通过 RPC 请求远程调用 TuGraph 提供的服务。
+
+RPC（远程过程调用）是一种通过网络从远程计算机程序上请求服务，而不需要了解底层网络技术的协议。
+相比REST，RPC 面向方法，主要用于函数方法的调用，可以适合更复杂通信需求的场景，且性能更高。
+brpc是用c++语言编写的工业级RPC框架，基于brpc，TuGraph 提供了丰富的RPC API，本文档描述
+TuGraph 的 RPC API 使用方式。
+
+## 2.请求
+
+### 2.1.建立连接
+
+开发者向TuGraph服务发送RPC请求，首先要建立连接。以C++语言为例，开发者创建指定url的通道（channel），
+由通道创建指定的服务存根（LGraphRPCService_Stub），后续即可通过存根像调用本地方法一样向远程
+服务器发送请求。
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.请求类型
+
+TuGraph支持10种RPC请求，其中每种请求的功能如下表所示：
+
+| 请求              | 功能         |
+|-----------------|------------|
+| GraphApiRequest | 点边索引操作请求   |
+| CypherRequest   | cypher请求   |
+| PluginRequest   | 存储过程请求     |
+| HARequest       | 高可用模式请求    |
+| ImportRequest   | 数据导入请求     |
+| GraphRequest    | 子图操作请求     |
+| AclRequest      | 权限管理请求     |
+| ConfigRequest   | 配置管理请求     |
+| RestoreRequest  | 备份请求       |
+| SchemaRequest   | schema管理请求 |
+
+用户发送请求时，需要传入以下参数：
+- client_version: 可选参数，HA模式下可通过对比`client_version`和`server_version`防止响应过时的请求
+- token: 必要参数，客户端登陆之后获得token，每次请求传入token以校验用户身份
+- is_write_op: 可选参数，标志请求是否是写请求
+- user: 可选参数，HA模式下主从之间同步请求时设置user，不需验证token
+
+服务处理完RPC请求之后发回响应，响应消息中除了包含每个请求的单独响应信息之外，还包含以下参数：
+- error_code: 必要参数，标志请求处理状态
+- redirect: 可选参数，HA模式下向follower发送写请求时处理失败，设置redirect为请求转发地址，即leader地址
+- error: 可选参数，请求错误信息
+- server_version: 可选参数，HA模式的请求响应中设置`server_version`以避免client读取数据时发生反向时间旅行问题
+
+:warning:  **除CypherRequest、PluginRequest、HARequest和AclRequest外，其余RPC接口将逐步废弃，其功能统一至CypherRequest接口。**
+
+## 3.登录
+
+登录请求信息包含以下参数：
+- user: 必要参数，用户名
+- pass: 必要参数，密码
+以C++为例，用户使用构建好的服务存根发送登录请求：
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+登录响应信息包含以下参数：
+- token: 必要参数，登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。
+如果登录失败会收到“Authentication failed”错误。
+
+## 4.查询
+用户可以通过Cypher查询和TuGraph进行绝大多数的交互，Cypher请求信息包含以下参数：
+- query: 必要参数，Cypher查询语句
+- param_names: 可选参数，参数名
+- param_values: 可选参数，参数值
+- result_in_json_format: 必要参数，查询结果是否以JSON格式返回
+- graph: 可选参数，Cypher语句执行的子图名称
+- timeout: 可选参数，Cypher语句执行的超时时间
+
+以C++为例，用户发送Cypher请求的方式如下所示：
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+Cypher请求响应为以下两个参数之一：
+- json_result: JSON格式的cypher查询结果
+- binary_result: CypherResult格式的cypher查询结果
+
+## 5.存储过程
+为满足用户较为复杂的查询/更新逻辑，TuGraph支持 C 语言和 Python 语言编写的存储过程。
+用户可以使用RPC请求对存储过程进行增删改查操作。
+
+### 5.1.加载存储过程
+加载存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- read_only: 必要参数，是否只读
+- code: 必要参数，存储过程文件读入生成的ByteString
+- desc: 可选参数，存储过程描述
+- code_type: 可选参数，存储过程代码类型，PY、SO、CPP、ZIP四者之一
+
+以C++为例，用户加载存储过程的方式如下所示：
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+加载存储过程的响应不包含参数，如果加载失败则抛出BadInput异常
+
+### 5.2.调用存储过程
+
+调用存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- param: 必要参数，存储过程参数
+- result_in_json_format: 可选参数，调用结果是否以JSON格式返回
+- in_process: 可选参数，未来支持
+- timeout: 可选参数，调用存储过程的超时时间
+
+以C++为例，用户调用存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+调用存储过程的响应为以下两个参数之一：
+- reply: ByteString格式的存储过程调用结果
+- json_result: JSON格式的存储过程调用结果
+
+### 5.3.删除存储过程
+
+删除存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+
+以C++为例，用户删除存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+删除存储过程的响应不包含参数，如果删除失败则抛出BadInput异常
+
+### 5.4.列举存储过程
+
+列举存储过程请求不需要参数，以C++为例，用户列举存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+列举存储过程的响应的参数如下所示：
+- reply: JSON格式的procedure列表
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/3.restful-api.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/3.restful-api.md
new file mode 100644
index 0000000000..beb44d41aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/3.restful-api.md
@@ -0,0 +1,340 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+## 2.请求与响应格式
+TuGraph HTTP Server 接收json格式的请求，经过鉴权后开始提取请求中的字段，根据定义好的接口逻辑处理请求，并返回json格式的响应。
+
+### 2.1.标准响应格式
+每一个响应都以标准响应格式返回，格式如下：
+
+| body参数  | 参数说明         | 参数类型        | 是否必填       |
+| ------- |--------------|-------------|------------|
+| errorCode   | 业务级错误码       | int类型       | 是          |
+| success   | 请求是否成功       | int类型       | 是          |
+| errorMessage   | 业务级错误信息      | 字符串类型       | 是          |
+| data   | 请求成功时返回的响应信息 | json字符串     | 是          |
+
+### 2.2请求类型
+
+#### 2.2.1. 用户登陆
+用户在登陆请求中携带用户名和密码发送到服务端。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，在后续的请求中将令牌加入请求头的Authorization域中。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| userName   | 用户名  | 字符串类型   | 是          |
+| password   | 用户密码 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+| default_password  | 默认密码 | 布尔类型 | 是          |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. 用户登出
+用户登出，同时删除已经认证的token，用户后续发送请求时，需要重新登陆，并获取新的token。
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data为空
+
+#### 2.2.3. 身份刷新
+已下发的token失效后，需要调用本接口重新认证。后端验证token合法性。token在初次登录后，1小时内有效，过期需要刷新
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+
+#### 2.2.4. 调用cypher
+用户对TuGraph的增删改查请求需要调用cypher接口，并通过标准的cypher查询语言发起
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明     | 参数类型  | 是否必填       |
+| ------- |----------|-------|------------|
+| graph   | 查询的子图名称  | 字符串类型   | 是          |
+| script   | cypher语句 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含查询结果
+
+| body参数  | 参数说明 | 参数类型    | 是否必填       |
+| ------- |------|---------|------------|
+| result   | 查询结果 | json字符串 | 是          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. 上传文件
+接口用于将本地文件上传至TuGraph所在机器。可以上传文本文件，二进制文件，可以上传大文件，也可以上传小文件，对于大文件，客户端在上传时应该对文件做切分，每个文件分片不大于1MB，参数Begin-Pos和Size对应本次分片在完整文件中的偏移量与分片大小。参数需要放在http请求的报文头，请求内容对应文件分片内容。本接口请求头不止有token参数
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header参数  | 参数说明        | 参数类型             | 是否必填       |
+| ------- |-------------|------------------|------------|
+| File-Name   | 文件名称        | 字符串类型            | 是          |
+| Begin-Pos   | 开始位置在文件内的偏移 | 可以转成size_t类型的字符串 | 是          |
+| Size   | 本次请求文件分片大小    | 可以转成size_t类型的字符串 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+#### 2.2.6. 检查文件
+本接口用于检查已上传文件正确性，如果成功通过检查，再次上传同一文件时，直接返回成功
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明           | 参数类型          | 是否必填        |
+| ------- |----------------|---------------|-------------|
+| fileName   | 文件名称           | 字符串类型         | 是           |
+| checkSum   | 文件对应md5值       | 可以转成int类型的字符串 | flag为"1"时必填 |
+| fileSize   | 文件长度(以字节计算)    | 可以转成int类型的字符串  | flag为"2"时必填 |
+| flag   | 标记位，flag为1时校验md5。flag为2时校验文件长度 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| pass   | 检查成功为true，否则为false | bool类型 | 是          |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. 清理缓存文件
+admin用户可以删除所有用户上传的文件，其他用户可以删除自己的上传的文件，可以删除指定名称的文件，指定用户上传的文件，也可以删除所有文件
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明        | 参数类型          | 是否必填        |
+| ------- |-------------|---------------|-------------|
+| fileName   | 文件名称        | 字符串类型         | flag为"0"时必填 |
+| userName   | 用户名称        | 字符串类型 | flag为"1"时必填 |
+| flag   | 标记位，flag为0时删除fileName指定文件, flag为1时删除userName指定用户已经上传的所有文件，flag为2时删除所有用户上传的文件 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. 导入schema
+本接口可以根据用户指定的schema信息创建schema模型，schema的详细格式信息请参考data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明       | 参数类型          | 是否必填        |
+| ------- |------------|---------------|-------------|
+| graph   | 子图名称       | 字符串         | 是           |
+| description   | schema描述信息 | json字符串 | 是 |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. 导入数据
+本接口允许用户指定已经通过上传，校验的文件作为数据文件，按照schema参数描述的配置信息，导入到graph参数指定的子图中。导入过程是异步的，server在接收到导入请求后，返回一个任务id
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明  | 参数类型    | 是否必填 |
+| ------- |-------|---------|----|
+| graph   | 子图名称  | 字符串类型   | 是  |
+| schema   | 导入schema描述 | json字符串 | 是  |
+| delimiter   | 分隔符   | 字符串类型   | 是  |
+| continueOnError   | 单行数据出错是否跳过错误并继续 | boolean类型 | 否  |
+| skipPackages   | 跳过的包个数 | 可以转成int类型的字符串 | 否  |
+| taskId   | 任务id，用于重启出错的任务 | 字符串类型 | 否 |
+| flag   | 标记位，flag为1时导入成功将删除数据文件 | 可以转成int类型的字符串 | 否 |
+| other   | 其他参数 | 可以转成int类型的字符串 | 否  |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| taskId   | 任务编号 | 字符串类型 | 是          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. 导入进度查询
+本接口用于查询导入任务的执行进度
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明                 | 参数类型    | 是否必填 |
+| ------- |----------------------|---------|----|
+| taskId   | import_data接口返回的任务id | 字符串类型 | 是 |
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明    | 参数类型             | 是否必填    |
+| ------- |---------|------------------|---------|
+| success   | 	是否成功导入 | boolean类型        | 是       |
+| reason   | 	导入失败原因 | 字符串类型            | success为false时必填 |
+| progress   | 	当前导入进度 | 可以转成double类型的字符串 | 是       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst
new file mode 100644
index 0000000000..f509ac8dd3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/4.protocol/index.rst
@@ -0,0 +1,8 @@
+网络协议
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
new file mode 100644
index 0000000000..8f3fe0316f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/1.tutorial.md
@@ -0,0 +1,83 @@
+# Learn Tutorial
+
+> 本文档是为 TuGraph 的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对 TuGraph 的图学习运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于 Tugraph 的一个简单的程序实例，我们将重点介绍其使用方式。
+
+## 1.TuGraph 图学习模块简介
+图学习是一种机器学习方法，其核心思想是利用图结构中的拓扑信息，通过顶点之间的联系及规律来进行数据分析和建模。不同于传统机器学习方法，图学习利用的数据形式为图结构，其中顶点表示数据中的实体，而边则表示实体之间的关系。通过对这些顶点和边进行特征提取和模式挖掘，可以揭示出数据中深层次的关联和规律，从而用于各种实际应用中。
+
+这个模块是一个基于图数据库的图学习模块，主要提供了四种采样算子：Neighbor Sampling、Edge Sampling、Random Walk Sampling 和 Negative Sampling。这些算子可以用于对图中的顶点和边进行采样，从而生成训练数据。采样过程是在并行计算环境下完成的，具有高效性和可扩展性。
+
+在采样后，我们可以使用得到的训练数据来训练一个模型。该模型可以用于各种图学习任务，比如预测、分类等。通过训练，模型可以学习到图中的顶点和边之间的关系，从而能够对新的顶点和边进行预测和分类。在实际应用中，这个模块可以被用来处理各种大规模的图数据，比如社交网络、推荐系统、生物信息学等。
+
+## 2. 运行流程
+TuGraph 图学习模块将TuGraph中的图数据采样，采样后的顶点和边作为图学习的特征，进行学习训练。运行流程如下图所示：
+![Alt text](../../../../../images/learn_flow_chart_zh.png)
+
+## 3.TuGraph编译及数据准备
+TuGraph编译请参考：[编译](../../../5.developer-manual/2.running/1.compile.md)
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+## 4. 数据导入
+数据导入请参考[数据导入](../../../5.developer-manual/3.server-tools/1.data-import.md)
+
+导入过程以cora数据集为例：
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+## 5. feature特征转换
+由于图学习中的feature特征一般表示为较长的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+## 6. 采样算子及编译
+TuGraph在cython层实现了一种获取全图数据的算子及4种采样算子，具体如下：
+### 6.1.采样算子介绍
+| 采样算子 | 采样方式 |
+| --- | --- |
+| GetDB | 从数据库中获取图数据并转换成所需数据结构 |
+| Neighbor Sampling | 根据给定的顶点采样其邻居顶点，得到采样子图 |
+| Edge Sampling | 根据采样率采样图中的边，得到采样子图 |
+| Random Walk Sampling | 根据给定的顶点，进行随机游走，得到采样子图 |
+| Negative Sampling | 生成不存在边的子图。 |
+
+### 6.2.编译
+如果TuGraph已编译，可跳过此步骤。
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+得到算子so后，在Python中import 即可使用。
+
+## 7. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+## 8. 模型加载
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+在使用保存的模型之前，首先需要对其进行加载。代码中，使用如上的代码对已训练模型进行加载。
+
+加载之后，我们可以使用模型对新的顶点和边进行预测和分类。在预测时，我们可以输入一个或多个顶点，模型将输出相应的预测结果。在分类时，我们可以将整个图作为输入，模型将对图中的顶点和边进行分类，以实现任务的目标。
+使用已训练的模型可以避免重新训练模型的时间和资源消耗。此外，由于模型已经学习到了图数据中顶点和边之间的关系，它可以很好地适应新的数据，从而提高预测和分类的准确度。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
new file mode 100644
index 0000000000..2a1c0ac8d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/2.sampling_api.md
@@ -0,0 +1,97 @@
+# Sampling API
+
+> 此文档主要详细介绍了Sampling API的使用说明
+
+## 1. 概述
+
+本手册介绍使用TuGraph的Sampling API接口。
+
+## 2. 图数据预处理
+在采样操作之前，根据图数据路径加载图数据，并映射成olapondb图分析类，代码如下：
+
+```python
+galaxy = PyGalaxy(args.db_path) # 根据路径创建一个galaxy实例
+galaxy.SetCurrentUser(args.username, args.password) # 设置当前用户
+db = galaxy.OpenGraph('default', False) # 打开图数据库指定db
+txn = db.CreateReadTxn() # 创建一个事务实例
+olapondb = PyOlapOnDB('Empty', db, txn) # 根据图加载方式、图数据库实例、事务实例实例化OlapOnDB
+del txn
+del db
+del galaxy
+```
+## 3. 图采样算子介绍
+图采样算子在cython层实现，用于对输入的图进行采样处理，生成的NodeInfo用于保存feature属性、label属性等点信息，EdgeInfo用于保存边信息，这些元数据信息可以被用于特征抽取、网络嵌入等任务中。目前TuGraph图学习模块支持GetDB、NeighborSampling、EdgeSampling、RandomWalkSampling、NegativeSampling五种采样算子。
+### 3.1.RandomWalk算子：
+在给定的采样点周围进行指定次数的随机游走，得到采样子图。
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+step: size_t类型，采样步数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.2.NeighborSample算子：
+在给定采样点的一度邻居中采样一定数量的点，得到采样子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+nei_num: size_t类型，邻居采样点数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.3.Nagetive算子：
+采用负采样算法，生成不存在边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+num_samples: size_t类型，生成不存在边的数量。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值： 无。
+
+### 3.4.EdgeSampling算子：
+根据边采样率，生成采样边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list,EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_rate: double类型，采样率。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.5.GetDB算子：
+从数据库中获取图数据并转换成所需数据结构。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+## 4. 用户自定义采样算法
+用户也可以通过TuGraph Olap接口实现自定义采样算法，接口文档参见[此处](../2.olap/5.python-api.md)，该文档主要介绍图采样算法使用的相关函数的接口设计。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md
new file mode 100644
index 0000000000..c8dd5e8e1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/3.training.md
@@ -0,0 +1,101 @@
+# Training
+
+> 本文档详细介绍了如何使用TuGraph进行图神经网络（GNN）的训练。
+
+## 1. 训练
+使用TuGraph 图学习模块进行训练时，可以分为全图训练和mini-batch训练。
+全图训练即把全图从TuGraph db加载到内存中，再进行GNN的训练。而mini-batch训练则使用上面提到的TuGraph 图学习模块的采样算子，将全图数据进行采样后，再送入训练框架中进行训练。
+## 2. Mini-Batch训练
+Mini-Batch训练需要使用TuGraph 图学习模块的采样算子，目前支持Neighbor Sampling、Edge Sampling、Random Walk Sampling和Negative Sampling。
+TuGraph 图学习模块的采样算子进行采样后的结果以List的形式返回。
+下面以Neighbor Sampling为例，介绍如何将采样后的结果，进行格式转换，送入到训练框架中进行训练。
+用户需要提供一个Sample类：
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. 加载图数据
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+
+        # 2. 采样方法，结果存储在NodeInfo和EdgeInfo中
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+
+        # 3. 对结果进行格式转换，使之符合训练格式
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+如代码所示，首先将图数据加载到内存中。然后使用采样算子对图数据进行采样，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+最后对结果进行格式转换，使之符合训练格式。这里我们使用的是DGL训练框架，因此使用结果数据构造了DGL Graph，最终将DGL Graph返回。
+我们提供TuGraphSample类之后，就可以使用它进行Mini-Batch训练了。
+令DGL的数据加载部分使用TuGraphSample的实例sampler：
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+使用DGL进行模型训练：
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+
+## 3. 全图训练
+GNN（图神经网络）的全图训练是一种涉及一次处理整个训练数据集的训练。它是 GNN 最简单、最直接的训练方法之一，整个图被视为单个实例。 在全图训练中，整个数据集被加载到内存中，模型在整个图上进行训练。这种类型的训练对于中小型图特别有用，并且主要用于不随时间变化的静态图。
+在算子调用时，使用以下方式：
+```python
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+获取全图数据，然后将全图送入训练框架中进行训练。
+完整代码：请参考learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..b5c8888189
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/4.heterogeneous_graph.md
@@ -0,0 +1,102 @@
+# Heterogeneous Graph
+
+> 本文档介绍如何使用异质图进行训练。
+
+## 1. 异质图简介
+异质图（Heterogeneous Graph）是指由不同类型的节点和边构成的图结构。在异质图中，节点和边可以具有多样化的属性和关系，代表了不同实体以及它们之间的复杂关联。
+
+在异质图中，节点类型可以代表不同的实体，如用户、商品、话题等，而边类型表示不同实体之间的关系，如用户之间的关注关系、用户与商品之间的购买关系等。节点和边可以具有不同的属性。
+
+异质图提供了一种强大的图模型，能够更好地表达和分析具有多种类型实体和复杂关系的现实世界系统。在不同领域的数据分析和应用中，异质图具有广泛的应用前景和研究价值。
+
+## 2. 异质图创建
+在TuGraph中，一个异构图由一系列边关系构成。每个关系由一个字符串三元组定义 (源节点类型, 边类型, 目标节点类型) 。异质图的创建方式与同质图类似，只是在创建图时需要指定字符串三元组定义。如下所示。
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+其中，第四个参数为异质图的边关系定义，可以通过该参数，指定筛选的异质图点边类型。如果不指定该参数，则默认将全部点边类型的数据进行构图训练。
+
+## 3. 异质图查询接口
+为了方便用户使用，当用户给定第四个参数时，TuGraph提供了查询异质图点边类型的接口。示例如下所示：
+
+### 3.1 点类型查询接口
+```python
+olapondb.ntypes()
+```
+返回值为点类型列表，如['node1', 'node2', 'node3']。
+
+### 3.2 边类型查询接口
+```python
+olapondb.etypes()
+```
+返回值为边类型列表，如['edge1', 'edge2', 'edge3']。
+
+### 3.3 点类型和边类型查询接口
+```python
+olapondb.metagraph()
+```
+返回值为字符串三元组定义 (源节点类型, 边类型, 目标节点类型)，如
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')]。
+
+## 4. 异质图输出格式
+和同质图相同的是，异质图的采样数据结果也存储在NodeInfo和EdgeInfo中。
+可通过如下方式获取输出数据。
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+其中getdb为获取全图数据的函数，db为图数据库实例，olapondb为图分析类。feature_len为节点特征长度，NodeInfo和EdgeInfo为输出的节点和边信息。
+
+其存储信息结果如下：
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 边类型 | EdgeInfo[2] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+| 顶点类型 | NodeInfo[3] |
+
+## 5. 异质图训练
+异构图训练的目标是学习图中节点和边的表示，以便于进行后续的任务，如节点分类、链接预测、图聚类等。为了实现这一目标，研究者们提出了多种基于图神经网络（Graph Neural Networks，GNNs）的模型。这些模型通过聚合邻居节点的信息来更新节点的表示，进而捕捉图结构中的复杂关系。
+
+由于异构图中包含多种类型的节点和边，因此在设计GNN模型时需要考虑如何处理这些不同类型的信息。一种常见的方法是设计不同的聚合函数来分别处理不同类型的邻居节点。此外，还需要考虑如何将这些不同类型的信息整合到一起，以便于模型能够有效地学习到节点和边的表示。
+
+TuGraph 提供了使用裁剪版ogbn-mag数据集进行异质图训练的方法，可供使用者参考。
+
+TuGraph提供的官方docker中暂未提供异质图训练的环境，因此需要用户自行安装相关依赖包。
+在训练之前需要下载ogb和pandas包，具体安装方式如下：
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+训练代码如下所示：
+
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+全部训练代码可参考tugraph/learn/examples/train_full_mag.py文件。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst
new file mode 100644
index 0000000000..e79e36ea91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/5.learn/index.rst
@@ -0,0 +1,8 @@
+图学习
+======
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/index.rst
new file mode 100644
index 0000000000..2dbfe16fbd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/6.interface/index.rst
@@ -0,0 +1,12 @@
+编程接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.query/index.rst
+   2.olap/index.rst
+   3.procedure/index.rst
+   4.protocol/index.rst
+   5.learn/index.rst
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md
new file mode 100644
index 0000000000..ff3fcd8048
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/7.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# 单元测试
+
+> 该文档是TuGraph的单元测试文档
+
+## 1.简介
+
+TuGraph单元测试采用gtest框架，可以选择一次跑全部test或者制定某些test。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md
new file mode 100644
index 0000000000..5d49f35255
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/7.quality/2.integration-testing.md
@@ -0,0 +1,399 @@
+# 集成测试
+
+> 此文档主要介绍 TuGraph 的集成测试框架如何使用
+
+## 1.TuGraph集成测试的意义
+
+在单元测试与功能测试中，有部分用例直接开启galaxy或statemachine来进行测试，这并不是一个完整的流程。在完整的cs架构中，用户请求是通过客户端发往服务端，网络通信是必不可少的，为了避免单元测试不完整带来的bug，针对这种情况，使用集成测试框架进行全链路的完整测试。
+
+## 2.TuGraph集成测试框架
+
+TuGraph采用pytest框架作为自己的集成测试框架，pytest框架作为目前使用最广泛的cs端集成测试框架，以其灵活简单，容易上手，并且支持参数化的使用方式而著称，TuGraph基于pytest提供的功能，抽象出了不同的工具，通过参数来控制各个工具的处理逻辑，以方便大家进行高效的测试代码开发。
+
+更多pytest信息请参考官网: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.组件描述
+
+| 组件名称            | 组件功能                       | 实现方式                                  |
+|-----------------|----------------------------|---------------------------------------|
+| server          | TuGraph单机服务                | 开启子进程并在子进程中启动服务                       |
+| client          | TuGraph Rpc Client         | 当前进程中开启TuGraph Python Rpc Client发送请求  |
+| importor        | TuGraph Importor           | 开启子进程并在子进程中处理导入请求                     |
+| exportor        | TuGraph Exportor           | 开启子进程并在子进程中处理导出请求                     |
+| backup_binlog   | TuGraph Backup Binlog      | 开启子进程并在子进程中处理备份binlog的请求              |
+| backup_copy_dir | TuGraph Backup             | 开启子进程并在子进程中处理备份完整db的请求                |
+| build_so        | 编译c++动态连接库的组件              | 开启子进程并在子进程中处理gcc编译逻辑                  |
+| copy_snapshot   | TuGraph Copy Snapshot      | 当前进程中处理备份snapshot的请求                  |
+| copydir         | 文件夹拷贝                      | 当前进程中处理文件夹拷贝请求                        |
+| exec            | 执行c++/java可执行文件            | 开启子进程并在子进程中启动C++可执行文件                 |
+| algo            | 执行算法                       | 开启子进程并在子进程中执行算法                       |
+| bash            | 执行bash命令                   | 开启子进程并在子进程中执行bash命令                   |
+| rest            | TuGraph Python Rest Client | 当前进程中开启TuGraph Python Rest Client发送请求 |
+
+### 2.2.组件用法
+
+#### 2.2.1.server
+
+##### 2.2.1.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动server，函数执行完成后会停止server，并清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.启动参数
+采用python字典传入
++ host是TuGraph Server的ip和端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导入不同的数据，函数开始执行前会导入数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导出不同的数据，函数开始执行前会导出数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的binlog，函数开始执行前会拷贝binlog到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的db，函数开始执行前会拷贝db到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.启动参数
+采用python字典传入
++ cmd是启动命令，采用python列表传入，可以一次编译多个so
++ so_name是执行完成后需要清理的so，可以是多个，通过python列表传入
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制编译不同的so，函数开始执行前会生成so到指定的目录，函数执行完成后会清理so_name列表指定的动态库
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的snapshot，函数开始执行前会拷贝src中的snapshot到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的目录，函数开始执行前会拷贝src到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的命令
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ result是算法预期的执行结果，执行完成会通过实际结果与预期结果进行比较，不同则测试失败
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的算法逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的算法，函数主体等待算法执行完成后对比结果
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的bash命令，函数开始执行前会开启子进程执行通过cmd参数传入的bash命令，函数主体等待算法执行完成
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.启动参数
+采用python字典传入
++ port是TuGraph Server的端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来链接不同的TuGraph Rest Server，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.测试样例
+
+#### 2.3.1.rest
+
+样例代码中在test_get_info函数执行之前先启动server，server启动后启动了rest client，进入test_get_info函数后获取server的一些信息，并通过assert判断是否有获取到cpu的信息。
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+样例代码中在test_flushdb函数执行之前先执行了数据离线导入逻辑，并启动server后，通过client创建链接，进入test_flushdb函数后，通过查询点的个数判断导入是否成功，导入成功后执行flushDB操作，再次通过assert判断是否能正常清空db
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+     assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+样例代码中在test_export_default函数执行之前先执行了数据离线导入逻辑，导入成功后将当前db的数据导出，然后再次通过离线导入逻辑将exportor导出的数据导入到新的目录中，以新导入的数据启动db，并且创建链接。在test_export_default函数主体中判断导出后再次导入的数据是否与原始数据一致
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.其他测试
+更多用例请参考集成测试代码 [https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration)
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/7.quality/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/7.quality/index.rst
new file mode 100644
index 0000000000..32345a1d33
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/7.quality/index.rst
@@ -0,0 +1,8 @@
+测试与质量保障
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/1.privilege.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/1.privilege.md
new file mode 100644
index 0000000000..30b26dd16f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/1.privilege.md
@@ -0,0 +1,132 @@
+# 用户权限
+
+## 1.介绍
+
+> TuGraph 的权限是基于角色的访问控制进行管理，定义访问控制的权限分配给角色，角色再分配给用户。
+
+## 2.权限层级
+
+- Global 层：即全局权限，对管理、图操作均有权限；
+- Graph 层：即图级别，对每个图的权限；
+- （仅商业化版本支持）Property 层：即属性级别，对某个属性的权限控制
+
+## 3.权限关键字
+
+目前权限的控制较为简洁
+
+- Global 层目前为 admin 权限，并且预置了 admin 用户；
+
+* Graph 层的操作权限分为四种：none，read，write，full
+  - none：无权限，对于图没有任何操作权限
+  - read：只读权限，对于图只具备读取权限
+  - write：读写权限，对于图不仅具备读取权限，还具备了写入的权限
+  - full：所有权限，对于图不仅具备读写权限，同时也具备删除图、修改图、修改 Schema 等权限
+* （仅商业化版本支持）Property 层的权限分别为：none，read，write
+  - none：无权限，对于该属性没有任何操作权限
+  - read：只读权限，对于该属性只具备读取权限
+  - write：读写权限，对于该属性不仅具备读取权限，还具备了写入的权限
+
+## 4.常用权限操作
+
+### 4.1.用户操作
+
+- 创建用户
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- 删除用户
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- 修改当前用户密码
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- 修改指定用户密码
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- 禁用/启用用户
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- 列出所有用户
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- 列出当前用户信息
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- 获取用户详情
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.角色操作
+
+- 创建角色
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- 删除角色
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- 列出所有角色
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- 禁用/启用角色
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.赋予用户角色
+
+- 新增用户与角色的联系
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- 删除用户与角色的联系
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- 清空用户角色的关系并重建
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.角色赋权
+
+- 修改角色对指定图的访问权限
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/2.token.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/2.token.md
new file mode 100644
index 0000000000..57b36bc07d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/2.token.md
@@ -0,0 +1,50 @@
+# Token使用说明
+
+## 1.Token介绍
+JWT（JSON Web Token）是一种用于认证和授权的开放标准。它基于JSON（JavaScript Object Notation）格式，并被设计用于在网络应用之间安全地传输声明（claims）信息。
+
+JWT由三部分组成：头部（Header）、负载（Payload）和签名（Signature）。头部包含了JWT的类型以及所使用的签名算法，负载包含了需要传输的信息，而签名用于验证JWT的完整性和真实性。
+
+在TuGraph中，JWT用于实现无状态的认证和授权机制。当用户登录成功后，服务端会生成一个JWT并将其返回给客户端。客户端在后续的请求中将这个JWT作为身份凭证传递给服务端。服务端收到JWT后，通过验证签名和解析负载中的信息，判断用户的身份和权限，并决定是否允许该请求的执行。
+
+## 2. Token有效期
+
+### 2.1. 浏览器Token交互逻辑
+1. 用户打开浏览器，输入账号密码，并点击登录。
+2. 前端调用登录接口，向后端输入账号和密码。
+3. 后端接收到账号密码后，进行校验，校验成功后，返回Token。
+4. 前端将Token存储在浏览器缓存中，后续请求都要携带此Token。
+5. 如果前端，主动点击登出和关闭页面，前端应主动调用登出接口，向后端传递Token。
+6. 后端接收后，将Token失效，返回状态码200，以及“等出成功”。前端接收到信息后，清空浏览器内存中的Token，并将页面退至登录页。
+7. Token失效（初始设置为24小时），需要用户重新登录。
+
+### 2.3. Token有效期刷新机制
+
+Token有效期存在刷新机制，默认关闭。如果打开后，Token的安全性会更高，实现上则存在两个时间戳。
+
+第一个时间戳`refresh_time`用于判定Token是否过期（默认24小时）：过期后可以调用刷新接口获取新的Token，可以设置为更短的时间，比如1小时。
+
+第二个时间戳`expire_time`为强制过期时间戳（默认24小时）：过期后必须重新登陆。
+
+### 2.4. Token有效期修改
+为了方便开发者自行开发，TuGraph提供了两种方式修改有效期，均需要admin权限。
+
+* 通过接口调用设置。涉及有效期修改的接口`update_token_time`和有效期查询接口`get_token_time`。
+具体可查询[REST接口文档](../../5.developer-manual/6.interface/4.protocol/1.restful-api-legacy.md)。
+
+* 通过启动参数设置。server端启动时，添加参数`-unlimited_token 1` 参数可以设置为无期限。可参考[服务运行文档](../../5.developer-manual/2.running/2.tugraph-running.md)。
+
+## 3. 客户端发送Token相关请求介绍
+
+客户端会两种协议处理相关请求，一种是REST，一种是RPC。
+
+### 3.1. REST
+如果客户端使用REST协议（包括Browser浏览器），由于是短链接，在每一次请求中都需要携带Token，过期后需要获取新的Token。
+
+对于自行开发的客户端，若采用REST协议则需要考虑Token的逻辑。
+
+### 3.2. RPC
+如果客户端使用RPC协议（包括官方的C++/Java/Python），使用长连接保持，登陆后不涉及Token操作。
+
+## 4. Token上限
+Token上限是指一个用户最多可以同时拥有的Token数量。为防止无限登陆，Token上限默认为10000。由于Token生成逻辑和时间强相关，每登录一次会生成一个Token进行存储，Token有效期默认为24小时，因此建议登录后不使用的Token及时登出。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/3.reset_admin_password.md
new file mode 100644
index 0000000000..245d6075bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/3.reset_admin_password.md
@@ -0,0 +1,19 @@
+# 忘记'admin'密码
+> TuGraph 提供了重置密码的功能，当用户忘记管理者账号`admin`密码时，可以通过重置密码的方式来修改密码。
+
+## 1.重置密码
+首先，需要停止TuGraph服务端。再次启动TuGraph服务端时，需要添加如下参数：
+
+```bash
+--reset_admin_password 1
+```
+
+如下所示：
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+这一操作可以使得TuGraph服务端在启动时，重置管理者`admin`的密码为默认密码：`73@TuGraph`。
+密码重置成功会给出相关信息“Reset admin password successfully”并关闭当前服务端进程。
+
+用户需要以正常模式重新启动服务端，然后使用默认账号密码进行登录，登录后重新设置密码即可正常使用。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/index.rst
new file mode 100644
index 0000000000..e23467ac4c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/8.other/index.rst
@@ -0,0 +1,8 @@
+权限管理
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/index.rst
new file mode 100644
index 0000000000..0a60fbc698
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/5.developer-manual/index.rst
@@ -0,0 +1,16 @@
+开发者文档
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.installation/index.rst
+   2.running/index.rst
+   3.server-tools/index.rst
+   4.client-tools/index.rst
+   5.ecosystem-tools/index.rst
+   6.interface/index.rst
+   7.quality/index.rst
+   8.other/index.rst
+
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..de5b25b6f6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/1.contributing.md
@@ -0,0 +1,91 @@
+# 如何贡献
+
+## 1. 前言
+感谢您为TuGraph做出贡献，我们由衷地希望有更多社区的同学加入进来，一起建设一个更好的图数据库项目。
+
+对于优秀社区贡献者，我们将颁发TuGraph优秀社区贡献者证书。
+
+## 2. 贡献什么
+我们随时都欢迎任何贡献，无论是简单的错别字修正，BUG 修复还是增加新功能。请踊跃提出问题或发起 PR。我们同样重视文档以及与其它开源项目的整合，欢迎在这方面做出贡献。
+对于任何修改，尤其是较为复杂的修改，建议新建一个issue ，按照BUG或者PR的模板填写。
+
+## 3. 准备工作
+
+### 3.1. 了解TuGraph
+
+建议您从[文档地图](../1.guide.md)开始，了解TuGraph的特性和接口。
+
+### 3.2. 准备环境
+
+对于文档贡献，可以直接通过[文档](https://tugraph-db.readthedocs.io/zh_CN/latest)，点击右上角的"在GitHub上编译"直接修改并提PR。
+
+对于代码贡献，通常需要在搭建编译执行的环境，可以采用[Docker部署](../5.developer-manual/1.installation/3.docker-deployment.md)或[本地部署](../5.developer-manual/1.installation/4.local-package-deployment.md)。
+
+### 3.3. 许可协议
+
+在贡献代码之前，请您稍微花一些时间了解为TuGraph贡献代码的流程，并阅读 [个人贡献者许可协议](3.individual-cla.md) 或 [公司贡献者许可协议](4.corporate-cla.md)，参与贡献则视为同意上述协议。
+
+## 4. 贡献代码流程
+### 4.1. 提交issue
+不论您是修复 TuGraph 的 bug 还是新增 TuGraph 的功能，在您提交代码之前，请在 TuGraph 的 GitHub 上提交一个 issue，描述您要修复的问题或者要增加的功能。这么做有几个好处:
+
+- 不会与其它开发者或是他们对这个项目的计划发生冲突，产生重复工作。
+- TuGraph 的维护人员会对您提的 bug 或者新增功能进行相关讨论，确定该修改是不是必要，有没有提升的空间或更好的办法。
+- 在达成一致后再开发，并提交代码，减少双方沟通成本，也减少 pull request 被拒绝的情况。
+### 4.2. 获取源码
+要修改或新增功能，在提交 issue 后，fork一份 TuGraph  Master代码到您的代码仓库。
+### 4.3. 拉分支
+TuGraph 所有修改都在分支上进行，修改完成后提交 pull request，在 Code Review 后由项目维护人员 Merge 到 Master。 因此，在获取源码步骤介绍后，您需要:
+
+1. 下载代码到本地，这一步您可以选择git/https方式，近年github的权限要求更加严格，比如git方式需要更复杂的ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent))，https方式不能直接使用用户名密码验证，请按照指引授权。 git clone https://github.com/您的账号名/tugraph-db
+2. 拉分支准备修改代码:
+git branch add_xxx_feature 
+3. 执行完上述命令后，您的代码仓库就切换到相应分支了。执行如下命令可以看到您当前分支: git branch -a 
+4. 如果您想切换回 Master，执行下面命令: git checkout -b master
+5. 如果您想切换回分支，执行下面命令: git checkout -b "branchName"
+
+### 4.4. 编译运行
+
+代码的编译运行流程可以参考[ci脚本](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. 配置 Github 信息
+在您的机器执行 git config  --list ，查看 git 的全局用户名和邮箱。检查显示的 user.name 和 user.email 是不是与自己 github 的用户名和邮箱相匹配。
+
+如果公司内部有自己的 gitlab 或者使用了其他商业化的 gitlab，则可能会出现不匹配的情况。这时候，您需要为 TuGraph DB 项目单独设置用户名和邮箱。设置用户名和邮箱的方式请参考 github 官方文档。
+
+### 4.6. 修改代码提交到本地
+
+拉完分支后，就可以修改代码了。
+
+**修改代码注意事项 **
+
+代码⻛格保持一致：TuGraph 通过 cpplint 来保持代码格式一致，IDE可以通过.clang来配置风格。在提交代码前，务必本地检查代码风格，否则ACI将报错。
+
+补充单元测试代码：新有修改应该通过已有的单元测试,应该提供新的单元测试来证明以前的代码存在 bug，而新的代码已经解决了这些 bug ,您可以用如下命令运行所有测试: ./unit_test
+也可以通过IDE来辅助运行。
+
+**其它注意事项 **
+
+请保持您编辑的代码的原有⻛格，尤其是空格、换行等。 对于无用的注释，请直接删除。 对逻辑和功能不容易被理解的地方添加注释。 及时更新文档。 修改完代码后，请按照如下格式执行命令提交所有的修改到本地:
+git commit -am '(feat) 添加xx功能' git commit -am '(fix) 修复xx问题'`
+
+### 4.7. 提交代码到远程仓库
+在代码提交到本地后，接下来就可以与远程仓库同步代码了，执行如下命令提交本地修改到 github 上: git push origin "branchname"
+
+如果前面您是通过 fork 来做的，那么这里的 origin 是 push 到您的代码仓库，而不是 TuGraph 的代码仓库。
+
+提交合并代码到 Master 的请求 在的代码提交到 GitHub 后，您就可以发送请求来把您改好的代码合入 TuGraph Master 代码了。此时您需要进入您在 GitHub 上的对应仓库，按右上⻆的 pull request 按钮。选择目标分支，一般就是 master，系统会通知 TuGraph 的人员， TuGraph 人员会 Review 您的代码，符合要求后就会合入主干，成为 TuGraph 的一部分。 
+
+请注意会自动检查CI，以及所有Commits中的贡献者是否签署了cla，通过后会有绿色的标识。
+
+### 4.8. 代码 Review
+
+在您提交代码后，您的代码会被指派给维护人员 Review，请耐心等待。如果两个工作日后，仍然没有人对您的提交给予任何回复，可以在 PR 下面留言，并 @ 对应的人员。
+
+对于代码 Review 的意⻅会直接备注到到对应 PR 或者 Issue。如果觉得建议是合理的，也请您把这些建议更新到您的代码中。
+
+### 4.9. 合并代码到Master
+
+在代码 Review 通过后，就由 TuGraph 维护人员操作合入 Master，在此过程中维护人员可能会指定新的Reviewer，提出新的意见需要修改。一般这一步不用参与，代码合并之后，您会收到合并成功的提示。
+
+
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..109a1d8f04
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/2.community-roles.md
@@ -0,0 +1,57 @@
+# 社区角色
+
+## 1. 前言
+本文档描述 TuGraph 社区中成员身份的⻆色，对每种⻆色的要求及权限。 
+
+## 2. ⻆色摘要
+
+这是 TuGraph 社区的⻆色划分，描述了每种⻆色的职责，成为某种⻆色并保持该⻆色的要求，以及相应⻆色的权限。
+
+TuGraph 社区参照 Apache 规范划分为以下三种⻆色：
+
+- Contributor 
+- Maintainer 
+- PMC 
+
+以下描述了每种⻆色的要求、职责和权限。 		 						 					
+## 3. Contributor
+### 3.1. 要求
+在 TuGraph 的任何一个正式项目中成功提交一个 PR 并合并。 
+### 3.2. 职责
+
+- 积极响应指派给您的 Issue 或 PR
+- 一起帮忙回复 Issue 或 PR，把 Issue 分配给对应模块的负责人
+### 3.3. 权限
+
+- 加入 TuGraph GitHub 组织，成为 TuGraph 开源社区的一员。 
+## 4. Maintainer
+### 4.1. 要求
+新的 Committer 由已有的 PMC 推荐，并通过 2/3 以上投票通过，Committer 至少满足以下一个条件：
+
+- 成为社区成员时间超过三个月 
+- 超过 10 个 PMC approve 的 PR 
+- 完成重大功能 
+- 修复严重 Bug 
+- 长期关注项目发展并参与社区讨论
+### 4.2. 职责
+
+- 社区咨询支持
+- 积极响应指派给您的 Issue 或 PR
+- 对于社区重大决定的投票权
+- Review 社区的 PR 
+### 4.3. 权限
+
+- Pull Request review 权限 
+## 5. PMC
+### 5.1. 要求
+
+- 暂不开放，如有强烈愿望请联系PMC
+### 5.2. 职责
+
+- 积极参与社区讨论，对社区重大决策给予指导 
+- 负责保证开源项目的社区活动都能运转良好 
+### 5.3. 权限
+
+- Pull Request review 权限 
+- Pull Request approve 权限 
+- 社区角色成员管理
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..514825b414
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# 个人贡献者许可协议
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..d1f5e1f62d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# 公司贡献者许可协议
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..4606b33755
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/5.roadmap.md
@@ -0,0 +1,70 @@
+# 技术规划
+
+## 1. 简介
+该文档是 TuGraph 未来开发的规划，包括正在开发中、不在开发计划里、已经开发完成但不在开源版本里的功能等。
+
+TuGraph定位开源高性能图数据库，图数据采用集中存储的方式，短期 **不会** 考虑基于分片（Sharding）的数据切分，
+而将支持主备复制的模式来解决高并发读的场景，采用云上存储解决存储容量的问题。
+
+## 2. 已完成功能
+
+TuGraph于2022年9月1日开源，TuGraph在社区的反馈声中，进行日常BUG修复，自身能力得到了完善。
+
+| 版本号 | 功能 | 时间 |
+| --- | --- | --- |
+| 3.3.0 | 开源初版 | 2022.9.1 |
+| 3.3.1 | 图分析引擎重构，多模式支持 | 2022.10.14 |
+| 3.3.2 | OGM支持，UT覆盖率提升 | 2022.11.21 |
+| 3.3.3 | 链接认证机制迭代，加入英文文档 | 2022.12.23 |
+| 3.3.4 | 支持上云，梳理LDBC SNB Audit流程 | 2023.1.28 |
+| 3.4.0 | 支持OLAP Python API, 离线导入升级 | 2023.3.11 |
+| 3.5.0 | 支持POG，前端升级，文档梳理 | 2023.6.5 |
+| 3.5.1 | 图学习引擎，Procedure Rust API，存储属性分离 | 2023.7.14 |
+
+除此之外，TuGraph搭建了较为完善的质量体系，涵盖自动化的单元测试、集成测试、性能测试等。
+
+更详细的描述可以在源码目录在的 "[root]/release/CHANGELOG.md" 文件查看。
+
+## 3. 2023年下半年核心版本迭代
+
+上半年高可用功能在计划上延后，图学习的能力提前迭代了一版，下半年将会完成高可用，以及率先支持ISO GQL的预印版本。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| 3.6.0 | 高可用支持 | 2023.8 |
+| 4.0.0 | ISO GQL 语言支持 | 2023.10 |
+
+## 4. 2023年功能更新
+
+在2023年度，除了上述核心功能，还包括如下组件的研发。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| 3.5.x | 日志系统优化 | 2023.7 |
+| 3.5.x | 冷备支持 | 2023.9 |
+| 3.5.x | 支持边upsert导入 | 2023.9 |
+| x.x.x | 支持trigger触发器 | 2023.12 |
+| x.x.x | 探索新存储引擎 | 2023.x |
+| x.x.x | 支持schema快速增删 | 2023.x |
+| x.x.x | TuGraph Brower版本迭代 | 2023.x |
+| x.x.x | 存储过程 Python API 迭代 | 2023.x |
+
+## 5. 期望社区共创的功能
+
+目前团队研发精力并不能实现我们对TuGraph的全部期望，在功能的梳理中，我们发现有一系列值得挖掘的想法，
+团队也有一些初步的探索，期望下面功能能够在社区中共同研发。
+
+| 版本号 | 功能 | 计划时间 |
+| --- | --- | --- |
+| x.x.x | 文档完善 | 2023.x |
+| x.x.x | APOC工具丰富 | 2023.x |
+| x.x.x | 属性默认值支持 | 2023.x |
+| x.x.x | 多属性联合索引 | 2023.x |
+| x.x.x | 在线全量Import支持 | 2023.x |
+| x.x.x | 图权限完善 | 2023.x |
+| x.x.x | NLP支持 | 2023.x |
+| x.x.x | Java Procedure API | 2023.x |
+| x.x.x | 数据库间快速迁移 | 2023.x |
+| x.x.x | 时空数据 | 2023.x |
+
+一些更加简单的功能，我们会在github的issue中打上 good first issue 的标签，欢迎对图数据库感兴趣的技术爱好者共同研讨。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/index.rst
new file mode 100644
index 0000000000..f2319d2358
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/6.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+贡献者文档
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..b6d52c3592
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# 从关系型数据库导入TuGraph
+
+> 使用 [DataX](../5.developer-manual/5.ecosystem-tools/2.tugraph-datax.md)，待完善
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..e4551f6f99
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/2.learn_practices.md
@@ -0,0 +1,223 @@
+# 使用 TuGraph 图学习模块进行点分类
+
+## 1.简介
+GNN 是许多图上机器学习任务的强大工具。在本介绍性教程中，您将学习使用 GNN 进行点分类的基本工作流程，即预测图中点的类别。
+
+此文档将展示如何构建一个 GNN 用于在 Cora 数据集上仅使用少量标签进行半监督点分类，这是一个以论文为点、引文为边的引文网络。任务是预测给定论文的类别。
+
+通过完成本教程，您可以
+
+使用 TuGraph 加载 cora 数据集。
+
+使用 TuGraph 提供的采样算子采样，并构建 GNN 模型。
+
+在 CPU 或 GPU 上训练用于点分类的 GNN 模型。
+
+此文档需要对图神经网络、DGL等使用有一定经验。
+
+## 2. 前置条件
+
+TuGraph图学习模块需要TuGraph-db 3.5.1及以上版本。
+
+TuGraph部署推荐采用Docker镜像tugraph-compile 1.2.4及以上版本:
+
+tugraph / tugraph-compile-ubuntu18.04:latest
+
+tugraph / tugraph-compile-centos7:latest
+
+tugraph / tugraph-compile-centos8:latest
+
+以上镜像均可在DockerHub上获取。
+具体操作请参考[快速上手](../3.quick-start/1.preparation.md)。
+
+## 3. Cora 数据集导入TuGraph数据库
+### 3.1. Cora 数据集介绍
+Cora 数据集由 2708 篇论文组成，分为 7 个类别。每篇论文由一个 1433 维的词袋表示，表示论文中的单词是否出现。这些词袋特征已经预处理，以从 0 到 1 的范围归一化。边表示论文之间的引用关系。
+
+TuGraph中已经提供了Cora数据集的导入工具，用户可以直接使用。
+
+### 3.2. 数据导入
+Cora数据集在test/integration/data/algo目录下，包含点集cora_vertices和边集cora_edge。
+
+首先需要将Cora数据集导入到TuGraph数据库中，详细操作可参考[数据导入](../5.developer-manual/3.server-tools/1.data-import.md)。
+
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+然后进行数据导入：
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式,可参考test/integration/data/algo/cora.conf。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+
+## 4. feature特征转换
+由于Cora数据集中的feature特征为长度为1433的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+
+## 5. 编译采样算子
+采样算子用于从数据库中获取图数据并转换成所需数据结构，具体执行过程如下(如果TuGraph已编译，可跳过此步骤)：
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *  # 导入tugraph-db的python接口模块
+import importlib  # 导入importlib模块
+getdb = importlib.import_module("getdb")  #获取getdb算子
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo) #调用getdb算子
+```
+
+如代码所示，得到算子so文件后，import 导入使用。
+
+## 6. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+训练详细过程如下：
+### 6.1.数据加载
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+如代码所示，根据图数据路径、用户名、密码和子图名称将数据加载到内存中。TuGraph可以载入多个子图用于图训练，在此处我们只载入一个子图。
+
+### 6.2.构建采样器
+训练过程中，首先使用GetDB算子从数据库中获取图数据并转换成所需数据结构，具体代码如下：
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+如代码所示，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+然后构建采样器
+```python
+    batch_size = 5
+    count = 2708
+    sampler = TugraphSample(args)
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(count),
+        sampler,
+        batch_size=batch_size,
+        num_workers=0,
+        )
+```
+
+### 6.3.对结果进行格式转换
+```python
+    src = EdgeInfo[0].astype('int64')
+    dst = EdgeInfo[1].astype('int64')
+    nodes_idx = NodeInfo[0].astype('int64')
+    remap(src, dst, nodes_idx)
+    features = NodeInfo[1].astype('float32')
+    labels = NodeInfo[2].astype('int64')
+    g = dgl.graph((src, dst))
+    g.ndata['feat'] = torch.tensor(features)
+    g.ndata['label'] = torch.tensor(labels)
+    return g
+```
+对结果进行格式转换，使之符合训练格式
+
+### 6.4.构建GCN模型
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+
+def build_model():
+    in_size = feature_len  #feature_len为feature的长度，在此处为1433
+    out_size = classes  #classes为类别数，在此处为7
+    model = GCN(in_size, 16, out_size)  #16为隐藏层大小
+    return model
+```
+本教程将构建一个两层图卷积网络（GCN）。每层通过聚合邻居信息来计算新的点表示。
+
+### 6.5.训练GCN模型
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #如果需要保存模型，则给出模型保存路径
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+如代码所示，根据定义好的采样器、优化器和模型进行迭代训练50次，训练后的模型保存至model_save_path路径中。
+
+输出结果如下：
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+同时，图学习模块可采用GPU进行加速，用户如果需要再GPU上运行，需要用户自行安装相应的GPU驱动和环境。具体可参考learn/README.md。
+
+完整代码可参考learn/examples/train_full_cora.py
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..189f3015fe
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# 数据迁移
+
+## 1. 简介
+   数据迁移是指将数据从一个系统、存储介质或应用程序迁移到另一个系统、存储介质或应用程序的过程。当TuGraph要升级或者系统硬件环境发生变化时，
+需要对原TuGraph服务中的数据进行迁移。以系统硬件环境和软件版本为依据进行划分，本文将数据迁移分为三种方案：
+1. 兼容迁移：当迁移前后系统环境一致且TuGraph软件兼容时，可以直接使用备份恢复的方式迁移数据；
+2. 升级迁移：当迁移前后系统环境不一致或TuGraph软件不兼容时，需要使用先导出数据再重新导入的方式迁移数据；
+3. 在线迁移：当对高可用集群进行数据迁移且集群网络环境良好时，可以使用增删节点的的方式将原集群平滑切换到新集群。
+接下来本文将详细介绍这三种方案。
+
+## 2. 兼容迁移
+兼容迁移指的是在系统环境不变，且TuGraph软件版本兼容时，原服务的数据和存储过程可以在新服务中使用，所以可以直接迁移。
+用户可以先使用`lgraph_backup`工具备份数据，然后将数据传输到新机器中并重启服务。具体迁移步骤如下：
+
+### 2.1. 备份数据
+使用`lgraph_backup`工具备份数据
+```bash
+  lgraph_backup -s db -d db.bck
+```
+本步骤也可以直接使用`cp`命令，不过`cp`命令会拷贝一些多余的元数据，HA模式下也会拷贝raft的元数据导致迁移之后集群重启失败，
+因此建议数据迁移时使用`lgraph_backup`工具替代`cp`命令。
+
+### 2.2. 启动新服务
+使用如下命令启动新服务，存储过程会自动加载到新服务中
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. 停止原服务
+使用如下命令停止原服务
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. 升级迁移
+当用户要把原始服务迁移到一个差异化环境中（比如从centos7迁移到ubuntu18.04），或者TuGraph版本变化较大前后不兼容时（如3.4.0和3.6.0），
+用户可以先使用`lgraph_export`工具将数据导出成文件，传输到新机器中，再使用`lgraph_import`工具重新导入并重启集群。
+这样可以保证在新环境上能够使用，但是效率较低，存储过程也需要重新加载。具体的迁移步骤如下：
+
+### 3.1. 导出数据
+使用`lgraph_export`工具导出数据，并将数据传输到新机器上
+```bash
+  lgraph_export -d db -e db.export
+```
+
+### 3.2. 导入数据
+使用`lgraph_import`工具导入数据，并手动加载存储过程（详见[client操作步骤](../5.developer-manual/4.client-tools/2.cpp-client.md)）
+```bash
+  lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. 启动新服务
+使用如下命令启动新服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. 停止原服务
+使用如下命令停止原服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. 在线迁移
+当对TuGraph高可用版本部署的服务器集群进行数据迁移时，如果网络带宽充足，可以直接使用增删节点的方式对服务进行在线迁移。具体迁移步骤如下所示：
+
+### 4.1. 拷贝数据
+使用如下命令拷贝leader节点上的数据，并且传输到新集群的机器节点上。由于leader节点上有最完整的raft日志，拷贝leader的数据可以最大程度地减少
+日志追赶的时间。
+```bash
+  cp -r db db.cp
+```
+### 4.2. 启动新节点
+使用如下命令将新节点加入集群，加入集群后，增量数据自动同步到新节点
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. 停止原节点
+停止原节点服务，后续应用请求直接发给新集群
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/4.selection.md
new file mode 100644
index 0000000000..499d90a5c7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# 环境和版本选择
+
+> 该文档介绍如何选择系统环境，以及部署方式
+
+## 1. 简介
+
+TuGraph为不同需求的用户提供了差异化的系统环境和部署方式，来满足新手、系统开发者、生产运维人员、研究人员等不同用户的需求。
+
+## 2. 环境能力选择
+
+用户可以根据实际使用场景，来选择不同的环境。编译环境的能力最完备，所需的第三方软件也越多。与其相对应的，精简运行环境几乎不需要安装任何依赖库，能运行TuGraph除存储过程外的基础功能。
+
+| 环境     | 用途             | 备注        |
+|--------|----------------|-----------|
+| 编译环境   | 从源码编译TuGraph   | 适用于开发人员   |
+| 运行环境   | 运行TuGraph安装包   | 适用于大部分用户  |
+| 精简运行环境 | 运行精简TuGraph安装包 | 对系运行统依赖较小 |
+
+不同环境的具体介绍参见 [链接](../5.developer-manual/1.installation/2.environment-mode.md)。
+
+## 3. 部署方式选择
+
+TuGraph部署仅需一台服务器（高可用模式需要多台），可根据实际资源情况和使用场景，选择适合的部署方式。
+
+| 部署方式     | 描述                   | 备注                                                                                      |
+|----------|----------------------|-----------------------------------------------------------------------------------------|
+| 云部署      | 阿里云计算巢一键部署，免费试用      | 新手适用，流程参考 [链接](../5.developer-manual/1.installation/5.cloud-deployment.md)              |
+| Docker部署 | 通过预先准备的Docker镜像跨平台部署 | 对硬件有要求的用户，比如性能测试，流程参考 [链接](../5.developer-manual/1.installation/3.docker-deployment.md) |
+| 本地部署     | 在现有系统紧耦合部署           | 指定生产环境适用，流程参考 [链接](../5.developer-manual/1.installation/4.local-package-deployment.md)  |
+
+## 4. 后续步骤
+
+部署完成后，后续可以进行[启动服务](../5.developer-manual/2.running/2.tugraph-running.md)、[数据导入](../5.developer-manual/3.server-tools/1.data-import.md)等操作，也可以通过[样例数据](../3.quick-start/2.demo/1.movie.md)来体验整个流程。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/index.rst
new file mode 100644
index 0000000000..dc5546f1d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/7.best-practices/index.rst
@@ -0,0 +1,9 @@
+最佳实践
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/8.faq.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/8.faq.md
new file mode 100644
index 0000000000..4a94af5b3c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/8.faq.md
@@ -0,0 +1,57 @@
+# FAQ
+
+在 TuGraph 使用过程中，如果遇到问题可优先查看[用户文档](https://github.com/TuGraph-family/tugraph-db/tree/master/doc/zh-CN) 。其次，请查看如下 FAQ 列表是否能够匹配您的问题。
+
+1. **[内核引擎 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussion-4575385)**
+
+   1.1 [TuGraph 的边是否支持索引？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165379)
+
+   1.2 [TuGraph 单机的 QPS 是多少？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussion-4575381)**
+
+   2.1 [可视化文件 build 后如何更新到 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165364)
+
+   2.2 [如何通过 npm run dev，连接已有的 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165366)
+
+   2.3 [3.3.0 版本 TuGraph Browser 删除 node label 失败？](https://github.com/TuGraph-family/tugraph-db/discussions/82#discussion-4465791)
+3. **[客户端 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussion-4575378)**
+
+   3.1 [Client 目前有哪些编程语言，是否支持 Node.js？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165351)
+
+   3.2 [Python Client 是否支持 pip install？Client 在哪里进行引用？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165353)
+
+4. **[数据导入 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussion-4575373)**
+
+   4.1 [TuGraph 可以对接哪些常用数据库？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165335)
+
+   4.2 [如何进行数据导入？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[存储过程 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussion-4575369)**
+
+   5.1 [如何加载存储过程或算法包？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165313)
+
+   5.2 [如何调用或执行存储过程？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165317)
+
+   5.3 [开源内置的算法包在哪里？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[安装部署 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussion-4575364)**
+
+   6.1 [如何使用 docker 镜像安装？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165287)
+
+   6.2 [rpm 包和 deb 包安装后，启动 lgraph_server 服务，提示缺少'liblgraph.so'报错？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165289)
+
+   6.3 [如何在 Mac 的 M1 芯片上编译 TuGraph？](https://github.com/TuGraph-family/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussion-4575018)**
+
+   7.1 [是否支持不定长边的条件查询？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165252)
+
+   7.2 [如何查询最短路径，shortestPath 函数如何使用？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165256)
+
+   7.3 [查询语句 Where 后使用 and 进行拼接查询速度较慢，语句应如何优化改进？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165260)
+
+   7.4 [如何查询任意跳的边？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165262)
+
+   7.5 [Cypher 是否 date()函数？](https://github.com/TuGraph-family/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+
+   8.1 [报错“User has reached the maximum number of tokens”后该如何处理？](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+如果问题仍然无法得到解决，我们推荐您在[Discussions](https://github.com/TuGraph-family/tugraph-db/discussions)跟帖或发起新贴来描述您的问题。同时 TuGraph QA 大汇总也会根据大家在讨论区发起的帖子，进行定期的更新。
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/9.contacts.md b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/9.contacts.md
new file mode 100644
index 0000000000..8537a0f979
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/9.contacts.md
@@ -0,0 +1,28 @@
+# 联系方式
+
+您有任何对产品的意见和建议，欢迎通过以下联系方式加入讨论，或提出建议。
+
+官网: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue (错误反馈、功能讨论)
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions (技术讨论)
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack (在线开发沟通):
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+钉钉群 (技术交流)
+
+![alert](../../images/dingtalk.png)
+
+微信群 (技术交流)
+
+![alert](../../images/wechat_tech.png)
+
+微信公众号 (信息发布)
+
+![alert](../../images/wechat.png)
+
+邮箱（商务沟通等其他问题）: tugraph@service.alipay.com
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/conf.py b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/conf.py
new file mode 100644
index 0000000000..8bcf4b9ebe
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/conf.py
@@ -0,0 +1,49 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('5.developer-manual/6.interface/3.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="5.developer-manual/6.interface/3.procedure/")
+    breathe_projects = {"cpp_procedure": "5.developer-manual/6.interface/3.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("5.developer-manual/6.interface/3.procedure/3.C++-procedure") and \
+            os.path.exists("5.developer-manual/6.interface/3.procedure/4.Python-procedure.rst") and \
+            os.path.exists("5.developer-manual/6.interface/3.procedure/index.rst") and \
+            os.path.exists("5.developer-manual/6.interface/3.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure 4.Python-procedure.rst index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="5.developer-manual/6.interface/3.procedure/")
diff --git a/docs/docusaurus/versions/version-4.1.0/zh-CN/source/index.rst b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/index.rst
new file mode 100644
index 0000000000..1e1f1abfa5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.1.0/zh-CN/source/index.rst
@@ -0,0 +1,17 @@
+TuGraph高性能图数据库
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.developer-manual/index.rst
+   6.contributor-manual/index.rst
+   7.best-practices/index.rst
+   8.faq.md
+   9.contacts.md
diff --git a/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile
new file mode 100644
index 0000000000..9cb9322238
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.2.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-CPP-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-CPP-Procedure-API/run.sh
new file mode 100644
index 0000000000..e2455bfbc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-CPP-Procedure-API/run.sh
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+# 0. install: yum install doxygen, graphviz
+# 1. run this script
+doxygen Doxyfile
diff --git a/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/Makefile b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/Makefile
new file mode 100644
index 0000000000..e58ac30a31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+SPHINXPROJ    = TuGraph
+SOURCEDIR     = .
+BUILDDIR      = _build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/conf.py b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/conf.py
new file mode 100644
index 0000000000..8af367a431
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/conf.py
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+#
+# Configuration file for the Sphinx documentation builder.
+#
+# This file does only contain a selection of the most common options. For a
+# full list see the documentation:
+# http://www.sphinx-doc.org/en/master/config
+
+# -- Path setup --------------------------------------------------------------
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#
+import os
+import sys
+sys.path.insert(0, os.path.abspath('../../../build/output/'))
+
+
+# -- Project information -----------------------------------------------------
+
+project = u'TuGraph'
+copyright = u'2018-2022, Ant Group'
+author = u'Ant Group'
+
+# The short X.Y version
+version = u''
+# The full version, including alpha/beta/rc tags
+release = u''
+
+
+# -- General configuration ---------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#
+# needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.autodoc',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+#
+# source_suffix = ['.rst', '.md']
+source_suffix = '.rst'
+
+# The master toctree document.
+master_doc = 'index'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+# This pattern also affects html_static_path and html_extra_path .
+exclude_patterns = [u'_build', 'Thumbs.db', '.DS_Store']
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+
+# -- Options for HTML output -------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+#
+html_theme = 'nature'
+#html_theme = 'haiku'
+#html_theme = 'pyramid'
+#html_theme = 'sphinxdoc'
+#html_theme = 'bizstyle'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#
+# html_theme_options = {}
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Custom sidebar templates, must be a dictionary that maps document names
+# to template names.
+#
+# The default sidebars (for documents that don't match any pattern) are
+# defined by theme itself.  Builtin themes are using these templates by
+# default: ``['localtoc.html', 'relations.html', 'sourcelink.html',
+# 'searchbox.html']``.
+#
+# html_sidebars = {}
+
+
+# -- Options for HTMLHelp output ---------------------------------------------
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'TuGraphdoc'
+
+
+# -- Options for LaTeX output ------------------------------------------------
+
+latex_elements = {
+    # The paper size ('letterpaper' or 'a4paper').
+    #
+    # 'papersize': 'letterpaper',
+
+    # The font size ('10pt', '11pt' or '12pt').
+    #
+    # 'pointsize': '10pt',
+
+    # Additional stuff for the LaTeX preamble.
+    #
+    # 'preamble': '',
+
+    # Latex figure (float) alignment
+    #
+    # 'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'TuGraph.tex', u'TuGraph Documentation',
+     u'Ant Group', 'manual'),
+]
+
+
+# -- Options for manual page output ------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'tugraph', u'TuGraph Documentation',
+     [author], 1)
+]
+
+
+# -- Options for Texinfo output ----------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'TuGraph', u'TuGraph Documentation',
+     author, 'TuGraph', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+
+# -- Extension configuration -------------------------------------------------
diff --git a/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/index.rst b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/index.rst
new file mode 100644
index 0000000000..ad21318e57
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/index.rst
@@ -0,0 +1,37 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+TuGraph Procedure API - Python
+====================================
+Version: 4.2.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Noe4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
+
+
+Indices and tables
+-------------------
+
+* :ref:`genindex`
+* :ref:`modindex`
+* :ref:`search`
diff --git a/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/make.bat b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/make.bat
new file mode 100644
index 0000000000..b1d0c9a1dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=.
+set BUILDDIR=_build
+set SPHINXPROJ=TuGraph
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.http://sphinx-doc.org/
+	exit /b 1
+)
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/run.sh
new file mode 100755
index 0000000000..d10e0a2b1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/autogen/TuGraph-Python-Procedure-API/run.sh
@@ -0,0 +1,7 @@
+# 0. install sphinx-build: yum install python3-sphinx
+# 1. default lgrpah module path: ../../../build/output/lgraph_python.so
+# 2. make lgraph_python
+# 3. run this script
+rm output -rf
+mkdir -p _static _templates
+sphinx-build -W -b html . output
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/.readthedocs.yaml b/docs/docusaurus/versions/version-4.2.0/en-US/.readthedocs.yaml
new file mode 100644
index 0000000000..92cd0965f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/en-US/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/Makefile b/docs/docusaurus/versions/version-4.2.0/en-US/Makefile
new file mode 100644
index 0000000000..a4de0bff18
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?= -W
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/make.bat b/docs/docusaurus/versions/version-4.2.0/en-US/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/1.guide.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/1.guide.md
new file mode 100644
index 0000000000..b542855d5a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/1.guide.md
@@ -0,0 +1,76 @@
+# Guide
+
+> Here is the document map that helps users learn and use the TuGraph community version quickly.
+
+## Quick Start
+
+> Understand [What is a Graph](./2.introduction/1.what-is-graph.md),[The application scenarios of graph](./2.introduction/8.scenarios.md),[What is TuGraph](./2.introduction/3.what-is-tugraph.md).
+
+> Quickly Install and deploy TuGraph:[Cloud Deployment](5.installation&running/5.cloud-deployment.md),[Docker Deployment](5.installation&running/3.docker-deployment.md)Rapid deployment TuGraph.
+
+> Quickly get started with DEMO:[Movie](./3.quick-start/2.demo/1.movie.md),[The Wandering Earth](./3.quick-start/2.demo/2.wandering-earth.md),[Three Body](./3.quick-start/2.demo/3.the-three-body.md),[Three Kingdoms](./3.quick-start/2.demo/4.three-kingdoms.md).
+
+> User Guide:[TuGraph Browser](./4.user-guide/1.tugraph-browser.md),[TuGraph Browser Legacy](./4.user-guide/2.tugraph-browser-legacy.md).
+
+## Development Guide
+
+> Client Tools:[Cpp Client](7.client-tools/2.cpp-client.md),[Java Client](7.client-tools/3.java-client.md),[Python Client](7.client-tools/1.python-client.md).
+
+> TuGraph Query Language:[Cypher API](8.query/1.cypher.md).
+
+> Procedure And Algorithm:[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md).
+
+> C++/Python Procedure Interfaces:[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## Community Contribution
+
+> Before starting to contribute, you can learn [how to contribute](12.contributor-manual/1.contributing.md)
+
+> If you want to understand the division of community roles, please visit [community roles](12.contributor-manual/2.community-roles.md)
+
+## Main warehouse
+
+> TuGraph-DB repository: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> Visual interface: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java client: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> Simple test method based on twitter data: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> Test method based on standard LDBC-SNB: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics repository: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## Video Center
+
+> [Get started quickly with TuGraph](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph technology sharing collection](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [Understand graph calculation in 3 minutes](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph-Latest-Version
+
+| Description | File | Link |
+|---------------------|--------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 runtime package | tugraph-4.2.0-1.el7.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-4.2.0-1.el7.x86_64.rpm) |
+| CentOS8 runtime package | tugraph-4.2.0-1.el8.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-4.2.0-1.el8.x86_64.rpm) |
+| Ubuntu18.04 runtime package | tugraph-4.2.0-1.x86_64.deb | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-4.2.0-1.x86_64.deb) |
+| CentOS7 runtime image | tugraph-runtime-centos7-4.2.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-runtime-centos7-4.2.0.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7) |
+| CentOS8 runtime image | tugraph-runtime-centos8-4.2.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-runtime-centos8-4.2.0.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8) |
+| Ubuntu18.04 runtime image | tugraph-runtime-ubuntu18.04-4.2.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-runtime-ubuntu18.04-4.2.0.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04) |
+| CentOS7 mini runtime package | tugraph-mini-4.2.0-1.el7.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-4.2.0-1.el7.x86_64.rpm) |
+| CentOS8 mini runtime package | tugraph-mini-4.2.0-1.el8.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-4.2.0-1.el8.x86_64.rpm) |
+| Ubuntu18.04 mini runtime package | tugraph-mini-4.2.0-1.x86_64.deb | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-4.2.0-1.x86_64.deb) |
+| CentOS7 mini runtime image | tugraph-mini-runtime-centos7-4.2.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-runtime-centos7-4.2.0.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7) |
+| CentOS8 mini runtime image | tugraph-mini-runtime-centos8-4.2.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-runtime-centos8-4.2.0.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8) |
+| Ubuntu18.04 mini runtime image | tugraph-mini-runtime-ubuntu18.04-4.2.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-runtime-ubuntu18.04-4.2.0.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 compilation image | tugraph-compile-centos7-1.2.9.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.2.9.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos7) |
+| CentOS8 compilation image | tugraph-compile-centos8-1.2.9.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.2.9.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos8) |
+| Ubuntu18.04 compilation image | tugraph-compile-ubuntu18.04-1.2.9.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.2.9.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04) |
+
+
+For the version update log, see: [Link](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md).
+
+If you don't know how to use installation packages and images, please refer to [Environment and Version Selection](13.best-practices/4.selection.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..59c569b9f7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/1.privilege.md
@@ -0,0 +1,135 @@
+# Privilege
+
+## 1.Introduce
+
+> The permissions of TuGraph are managed based on role-based access control. The permissions that define access control are assigned to roles, and the roles are then assigned to users.
+
+## 2.Level of permissions
+
+- Global layer: indicates global permissions, which have permissions for management and graph operations.
+- Graph layer: control permissions on each graph;
+- Property level (Commercial version only) : control permissions on a property
+
+## 3.Permission keyword
+
+At present, the control of permissions is relatively simple
+
+- The Global layer currently has admin permission, and the admin user is preset.
+
+* The Graph layer has four operation permissions: none, read, write, and full
+
+- none: No permission, no operation permission for the graph
+- read: Read-only permission, only has read permission for the graph
+- write: Read and write permission, not only has read permission for the graph, but also has write permission
+- full: All permissions, not only have read and write permissions for graphs, but also have permissions to delete graphs, modify graphs, and modify schemas
+
+* The Property layer (Commercial version only)  has the following permissions: none, read, and write
+
+- none: No permission, no operation permission for the property
+- read: Read-only permission, only has read permission for the property
+- write: Read and write permission, not only has read permission for the property, but also has write permission
+
+## 4.Common permission operations
+
+### 4.1.User action
+
+- Creating a user
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- Deleting a user
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- Change the password of the current user
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- Changes the password of a specified user
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- Disable or enable a user
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- List all users
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- Lists the current user information
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- Obtain user details
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.Role actions
+
+- Create a role
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- Delete a role
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- List all characters
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- Disable or enable the role
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.Assign roles to users
+
+- Adds the association between the user and the role
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- Deletes the association between the user and the role
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- Clears the relationship between user roles and rebuilds them
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.Role empowerment
+
+- Modifies the access permission of a role to a specified graph
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/2.token.md
new file mode 100644
index 0000000000..dd4ac2e2e5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/2.token.md
@@ -0,0 +1,42 @@
+# Token Usage Guide
+## 1. Introduction to Token
+JWT (JSON Web Token) is an open standard used for authentication and authorization. It is based on the JSON (JavaScript Object Notation) format and is designed for securely transmitting claim information between network applications.
+
+JWT consists of three parts: the header, payload, and signature. The header contains the type of JWT and the signature algorithm used, the payload contains the information to be transmitted, and the signature is used to verify the integrity and authenticity of the JWT.
+
+In TuGraph, JWT is used to implement a stateless authentication and authorization mechanism. After a user logs in successfully, the server generates a JWT and returns it to the client. The client passes this JWT as an identity credential in subsequent requests to the server. Upon receiving the JWT, the server verifies the signature and parses the information in the payload to determine the user's identity and permissions, and decides whether to allow the execution of the request.
+
+## 2. Token Expiration
+### 2.1. Browser Token Interaction Logic
+1. The user opens the browser, enters the username and password, and clicks login.
+2. The frontend calls the login interface and inputs the account and password to the backend.
+3. After receiving the account and password, the backend verifies them and returns a Token.
+4. The frontend stores the Token in the browser cache, and all subsequent requests must carry this Token.
+5. If the frontend actively clicks logout or closes the page, it should actively call the logout interface and pass the Token to the backend.
+6. After receiving the Token, the backend invalidates it, returns a status code 200, and "logout successful". After receiving the message, the frontend clears the Token in the browser memory, and returns to the login page.
+7. The Token expires (initially set to 24 hours), and the user needs to log in again.
+### 2.3. Token Expiration Refresh Mechanism
+Token expiration has a refresh mechanism that is turned off by default. If turned on, the security of the Token will be higher, and there will be two timestamps.
+
+The first timestamp `refresh_time` is used to determine whether the Token has expired (default 24 hours): after expiration, the refresh interface can be called to obtain a new Token, which can be set to a shorter time, such as 1 hour.
+
+The second timestamp `expire_time` is the forced expiration timestamp (default 24 hours): after expiration, the user must log in again.
+
+### 2.4. Token Expiration Modification
+To facilitate developers to develop on their own, TuGraph provides two ways to modify the expiration time, both of which require admin privileges.
+
+* Set through the interface call. The interfaces involved in modifying the expiration time are `update_token_time` and `get_token_time` for querying the expiration time. For details, please refer to the [REST interface document](../7.client-tools/9.restful-api-legacy.md).
+* Set through startup parameters. When the server-side is started, adding the parameter `-unlimited_token 1` can set the Token to be unlimited. Please refer to the [service running document](../5.installation&running/7.tugraph-running.md) for details.
+## 3. Introduction to Token-Related Requests Sent by Clients
+The client handles two types of protocol-related requests: REST and RPC.
+
+### 3.1. REST
+If the client uses the REST protocol (including the browser), because it is a short connection, Token needs to be carried in every request, and a new Token needs to be obtained after it expires.
+
+For self-developed clients, if the REST protocol is used, Token logic needs to be considered.
+
+### 3.2. RPC
+If the client uses the RPC protocol (including the official C++/Java/Python), it uses a long connection to maintain, and no Token operation is involved after login.
+
+## 4. Token upper limit
+The upper limit of Token refers to the maximum number of Tokens that a user can own at the same time. To prevent unlimited logins, the upper limit of Token is 10000 by default. Since the token generation logic is strongly related to time, a token will be generated for storage every time you log in. The validity period of the token is 24 hours by default. Therefore, it is recommended to log out the unused token in time after login.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..706d377c16
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,20 @@
+# Forgot Admin Password
+> TuGraph provides a password reset feature. If you forget the password for the admin account, you can reset it by following these steps.
+
+## 1. Reset Password
+First, stop the TuGraph server.
+
+When starting the TuGraph server again, add the following parameter:
+```bash
+--reset_admin_password 1
+```
+
+Here is an example:
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+This operation will reset the password for the admin account to the default password: 73@TuGraph when starting the TuGraph server.
+If the password reset is successful, you will receive the message "Reset admin password successfully" and the current server process will be closed.
+
+You need to restart the server in normal mode and then use the default account and password to log in. After logging in, you can reset the password to continue using TuGraph.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..6695299a7d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/4.monitoring.md
@@ -0,0 +1,1019 @@
+# Monitoring
+
+> This document mainly introduces the visualization operation and maintenance monitoring of TuGraph.
+
+## 1.Design Concept
+
+Visualization monitoring is not an indispensable part of TuGraph itself. Therefore, in the design, visualization monitoring is regarded as an application in the peripheral ecology of TuGraph to reduce the coupling with TuGraph database and its own impact. TuGraph visualization monitoring adopts the hottest open source solution - TuGraph Monitor + Prometheus + Grafana. Wherein, TuGraph Monitor is the client of TuGraph service, which initiates Procedure requests to TuGraph service through TCP connection. After receiving the request, TuGraph service collects statistics of CPU, memory, disk, IO, and number of requests on its own machine and responds. TuGraph Monitor packages the index data received from TuGraph into the format required by Prometheus and saves it in memory, waiting for Prometheus to obtain it through HTTP request. Prometheus regularly obtains packaged request data from TuGraph Monitor through HTTP requests and saves it in its own time-series database according to the time obtained. Grafana can obtain the statistical data within a certain time period from Prometheus according to user configuration and draw easy-to-understand graphics on the web interface to display the final result. In the entire request chain, the active acquisition, i.e. pull model, is used, which has the advantages of minimizing the coupling between data producers and data consumers, making development simpler, and not requiring data producers to consider the data processing capability of data consumers. Even if the data processing ability of a consumer is weak, it will not be crushed by the data producer producing data too fast. One of the shortcomings of the active pulling model is that the real-time performance of the data is insufficient. However, in this scenario, data does not have high real-time requirements.
+
+### 1.1.TuGraph
+
+TuGraph database provides the ability to collect multiple data information, such as disk, memory, network IO, and query requests, in the service machine, and provides queries through standard Procedure methods. This action of collecting data only occurs when a user queries through the interface, avoiding the impact of TuGraph monitoring service on user business query requests when users do not need the indicators on TuGraph monitoring service machine.
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor is a tool in the peripheral ecology of TuGraph. It communicates with TuGraph through C++ RPC Client as one of the many users of TuGraph and queries the performance indicators of the machine where TuGraph service is located through the Procedure query interface. It packages the results returned by TuGraph into the data model required by Prometheus and waits for Prometheus to obtain them. Users can set the query time interval to minimize the impact of obtaining monitoring indicators on business queries.
+
+### 1.3.Prometheus
+
+Prometheus is an open-source monitoring platform with a dedicated time-series database. It regularly obtains statistical indicators from the TuGraph Monitor service through HTTP requests and saves them in its own time-series database. For details, please refer to the official website:[https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana is an open-source visualization and analysis software. It can obtain data from multiple data sources, including Prometheus, and can convert data in the time-series database into tools for beautiful graphics and visual effects. For specific information, please refer to the official website:[https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.Deployment Solution
+
+### 2.1.Step 1
+
+Start the TuGraph service. For details, please refer to the documentation:[https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.Step 2
+
+Start the TuGraph Monitor tool. The startup command is as follows:
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+The meanings of the parameters are as follows:
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.Step Three
+
++ Download the Prometheus tarball that matches your machine architecture and system version. Download link:[https://prometheus.io/download/](https://prometheus.io/download/)
+
++ Unzip the tarball with the following command:
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ Modify the configuration file prometheus.yml and add the following configuration to enable Prometheus to scrape performance data packaged by TuGraph Monitor.
+
+```
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ Start Prometheus. You can obtain specific startup parameters with the following command:
+
+```shell
+./prometheus -h
+```
+
++ Verify if the Prometheus service is running properly by logging into the Prometheus service through the web portal, and querying whether the monitoring index resources_report has been obtained. If the data can be successfully queried, the operation is successful.
+
+### 2.4.Step Four
+
++ Download the Grafana installation package that matches your machine architecture and system version. Download link:[https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ Install Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Start Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Configure Grafana. First, configure the IP address of Prometheus in the data source settings. After the configuration is completed, verify if the data source is connected successfully by testing the connection function. Then, import the following template and modify the correct interface IP and port in the page according to the actual situation. Finally, set the refresh time and monitoring time range according to the actual situation.
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana",
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{label_name}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "memory",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \n  QPS exceeds 1000",
+        "name": "Request statistics alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "Request statistics",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "disk",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \nCPU usage rate exceeds 90%",
+        "name": "CPU usage rate alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU usage rate",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] Disk IO exceeds 10MB/S",
+        "name": "Disk IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph Monitoring Web",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+Verify the effect by refreshing the browser page. If the pie chart and line chart are displayed correctly, the configuration is completed.
+
+## 3.Future Plans
+
+Currently, visual monitoring only supports single-machine monitoring and can monitor performance indicators such as CPU, disk, network IO, and request QPS of the machine on which the service is located. In the future, monitoring for HA clusters will be implemented, and more meaningful indicators will be included in the monitoring scope.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/5.log.md
new file mode 100644
index 0000000000..ae799bacda
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# Log
+
+> This document mainly introduces the logging function of TuGraph.
+
+## 1.Introduction
+
+TuGraph keeps two types of logs: server logs and audit logs. Server logs record human-readable server status information, while audit logs maintain encrypted information for every operation performed on the server.
+
+## 2.Server log
+
+### 2.1.Server Log Configuration Items
+The output directory of server logs can be specified through the `log_dir` configuration item. The level of log can be specified through the `verbose` configuration item.
+
+The `log_dir` configuration item is empty by default. If `log_dir` configuration item is empty, then all logs will be write to the console(nothing will be written to the console if the `log_dir` configuration item is empty under daemon mode); if `log_dir` configuration item is configured specifically, log files will bew generated under that path. The maximum size of a single log file is 256MB.
+
+The `verbose` configuration item controls the level of log, and is divided into three levels of `0, 1, 2`. Ther verbosity of log record grows as the number grows. The default level is `1`. When the level is set to `2`, the server will print logs in `DEBUG` level and above. When the level is set to `1`, the server will print logs in `INFO` level and above. When the level is set to `0`, the server will print log in `ERROR` level and above.
+
+### 2.2.Example of Server Log Output Macro Usage
+
+If the developer wants to add logs to the code during development, they can refer to the following example:
+
+```
+#include "tools/lgraph_log.h" // add log dependency.
+
+void LogExample() {
+    // The log module has been initialized during the database startup, and developers can directly call the macro.
+    // The log level is divided into five levels: DEBUG, INFO, WARNING, ERROR, and FATAL.
+
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+
+You can also refer to the log macro usage in test/test_lgraph_log.cpp.
+
+### 2.3.Procedure log
+
+Developers can use the log function to output debug information that they need to the log for looking up and assisting development during the development of procedures. Debug information will be output to the same log file as the server log (if `log_dir` configuration item is not specified, it will also be output to the console)
+
+#### 2.3.1.Cpp procedure
+Please use the log macro provided in 2.2 to output debug information, and avoid using output methods such as cout or printf. For specific usage, please refer to the following sample code (see `procedures/demo/log_demo.cpp` for details)
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+After inserting the above sample code into the database as a procedure and running it, you can see the corresponding log entries in the log file.
+
+#### 2.3.1.python procedure
+Please use Python's built-in print to output debug information. The debug information will be merged into a WARN-level log entry and output to the log file after the procedure is executed.
+
+## 3.Audit log
+
+Audit logs record each request and response, as well as the user who sent the request and when the request received. Audit logging can only be turned on or off. The results can be queried using the TuGraph visualization tool and the REST API.
+
+To enable the Audit Log, you need to set the `enable_audit_log` parameter to `true` in the configuration file. For the configuration file and parameter descriptions, see:[Tugraph Running/Service configuration](../../5.installation&running/7.tugraph-running.md/#4service-configuration)
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/index.rst
new file mode 100644
index 0000000000..4dc0c67422
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Privilege And Operations
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..2cdb8d3f31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# Unit Testing
+
+> This document is the unit testing documentation for TuGraph.
+
+## 1.Introduction
+
+TuGraph unit testing uses the gtest framework, which can choose to run all tests at once or specify certain tests.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..b98cf7f62a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/11.quality/2.integration-testing.md
@@ -0,0 +1,400 @@
+# Integration Testing
+
+> This document mainly introduces how to use the TuGraph integration testing framework.
+
+## 1.The Significance of TuGraph Integration Testing
+
+In unit tests and function tests, some test cases directly use Galaxy or Statemachine to perform tests, which is not a complete process. In the complete CS architecture, user requests are sent to the server through the client, and network communication is essential. To avoid bugs caused by incomplete unit testing, TuGraph uses an integration testing framework to perform end-to-end testing.
+
+## 2.TuGraph Integration Testing Framework
+
+TuGraph uses the Pytest framework as its integration testing framework. Pytest is currently the most widely used CS-side integration testing framework. It is known for its flexibility, ease of use, and the ability to support parameterization. Based on the functionality provided by Pytest, TuGraph abstracts different tools and controls the processing logic of each tool through parameters to facilitate efficient testing code development.
+
+For more information on Pytest, please refer to the official website: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.Component Description
+
+| Component Name    |Component Function      | Implementation Method                              |
+| --------------- | -------------------------- | ------------------------------------------------ |
+| server          | TuGraph standalone service | Start a child process and launch the service       |
+| client          | TuGraph Rpc Client         | Open TuGraph Python Rpc Client in the current process and send requests  |
+| importor        | TuGraph Importor           | Start a child process to process import requests               |
+| exportor        | TuGraph Exportor           | Start a child process to process export requests               |
+| backup_binlog   | TuGraph Backup Binlog      | Start a child process to process binlog backup requests       |
+| backup_copy_dir | TuGraph Backup             | Start a child process to process full db backup requests       |
+| build_so        | Component for compiling C++ dynamic libraries    | Start a child process to handle GCC compilation logic            |
+| copy_snapshot   | TuGraph Copy Snapshot      | Handle backup snapshot requests in the current process                 |
+| copydir         | Folder copy                 | Handle folder copy requests in the current process                     |
+| exec            | Execute C++/Java executable files     | Start a child process to launch the C++ executable file  |
+| algo            | Execute algorithm                   | Start a child process to run the algorithm     |
+| bash            | Execute bash commands               | Start a child process to execute bash commands      |
+| rest            | TuGraph Python Rest Client | Open TuGraph Python Rest Client in the current process and send requests|
+
+### 2.2.Component Usage
+
+#### 2.2.1.server
+
+##### 2.2.1.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The server will be started before the function starts executing, and the server will be stopped and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ host is the IP and port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to the user in the TuGraph Server
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The client will be started before the function starts executing, and the client will be stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.Startup Command
+
+Import the tool through the fixtures component and control the import of different data through startup parameters. The data will be imported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.Startup Command
+
+Import the tool through the fixtures component and control the export of different data through startup parameters. The data will be exported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.Startup Parameters
+采用python字典传入
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different binlogs through startup parameters. The binlogs will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different databases through startup parameters. The database will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command, passed in as a Python list, and multiple so can be compiled at once
++ so_name is the dynamic library that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.Startup Command
+
+Import the tool through the fixtures component and control the compilation of different dynamic libraries through startup parameters. The dynamic libraries will be generated to the specified directory before the function starts executing, and the dynamic libraries specified in the so_name list will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original database
++ dst is the snapshot copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.Startup Command
+Import the tool through the fixtures component and control the copying of different snapshots through startup parameters. The snapshot in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original directory
++ dst is the directory copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.Startup Command
+Import the tool through the fixtures component and control the copying of different directories through startup parameters. The directory in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.Startup Command
+Import the tool through the fixtures component and control the execution of different logic through startup parameters. A child process will be started to execute the command passed in through the cmd parameter before the function starts executing.
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ result is the expected execution result of the algorithm. After execution is completed, the actual result will be compared with the expected result. If they are different, the test will fail.
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.Startup Command
+Import the tool through the fixtures component and control the execution of different algorithm logic through startup parameters. A child process will be started to execute the algorithm passed in through the cmd parameter before the function starts executing. The function body will wait for the algorithm to complete and compare the result with the expected result.
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.Startup Command
+
+Import the tool through the fixtures component and control the execution of different bash commands through startup parameters. A child process will be started to execute the bash command passed in through the cmd parameter before the function starts executing. The function body will wait for the command to complete.
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ port is the port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to user in TuGraph Server
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.Startup Command
+
+Import the tool through the fixtures component and link to different TuGraph Rest Servers through startup parameters. The client will be started before the function starts executing and stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.Test Cases
+
+#### 2.3.1.rest
+
+In the sample code, before the test_get_info function is executed, the server is started, and a rest client is started after the server is started. After entering the test_get_info function, some information about the server is obtained, and assert is used to determine whether cpu information is obtained.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+In the sample code, before the test_flushdb function is executed, the offline data import logic is executed and the server is started. After creating a connection through the client, the function enters the test_flushdb function. The number of points is queried to determine whether the import is successful. After the import is successful, the flushDB operation is executed. assert is used again to determine whether the db can be emptied normally.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+In the sample code, before the test_export_default function is executed, the offline data import logic is executed. After the import is successful, the data of the current db is exported. Then, the offline import logic is used again to import the exported data into a new directory. The newly imported data is used to start the db and create a connection. In the body of the test_export_default function, it is determined whether the data after export and import is consistent with the original data.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.Other Tests
+For more test cases, please refer to the integration test code [https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/11.quality/index.rst
new file mode 100644
index 0000000000..f3b6e0e061
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Quality
+==============================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..bf465539f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,93 @@
+# TuGraph Contribution Guide
+
+## 1. Preface
+
+Thank you for your contribution to TuGraph. We sincerely hope that more students from the community will join in and build a better graph database project together.
+
+For outstanding community contributors, we will award the TuGraph Outstanding Community Contributor Certificate.
+
+## 2. What to contribute
+
+We welcome any contribution at any time, whether it's a simple typo fix, bug fix, or new feature addition. Feel free to ask questions or initiate PRs. We also value documentation and integration with other open source projects, and welcome contributions in this regard. For any modification, especially the more complex modification, it is recommended to create an issue and fill it out according to the BUG or PR template.
+
+## 3. Preparation
+
+## 3.1. Knowing TuGraph
+
+You can get start with TuGraph follow instrcutions in [Guide Doc](../1.guide.md).
+
+## 3.2. Environment
+
+For document contributions, you can directly modify and submit a pull request by clicking on "Edit on GitHub" in the upper right corner of the [documentation](https://tugraph-db.readthedocs.io/en/latest).
+
+For code contributions, it is usually necessary to set up the environment for compilation and execution. You can deploy using [Docker](../5.installation&running/3.docker-deployment.md) or [local package deployment](../5.installation&running/4.local-package-deployment.md).
+
+## 3.3. License Agreement
+
+Before contributing code, please take some time to understand the process of contributing code to TuGraph, and read the [Contributor License Agreement](3.individual-cla.md) or [Corporate Contributor License Agreement](4.corporate-cla.md). Participating in the contribution is deemed to agree to the above agreement.
+
+## 4. Contribute code process
+
+### 4.1. Submit the issue
+
+Whether you are fixing a bug in TuGraph or adding a new feature to TuGraph, before you submit the code, submit an issue on TuGraph's GitHub, describing the problem you want to fix or the function you want to add. There are several advantages to doing this:
+
+- There will be no duplication of work in conflict with other developers or their plans for the project.
+- TuGraph maintainers will discuss the bugs or new features you mentioned to determine whether the modification is necessary, whether there is room for improvement or a better way.
+- After reaching an agreement, develop and submit the code, reducing the cost of communication between the two parties and reducing the rejection of pull requests.
+
+### 4.2. Pull the branch
+
+All modifications of TuGraph are made on branches. After modification, the pull request is submitted and merged into the Master by the project maintenance personnel after Code Review. Therefore, after the source code steps are described, you need:
+
+1. Download the code to a local directory. In this step, you can choose git or https. In recent years, github has stricter permission requirements. The git approach, for example, requires the more complex ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)). https authentication cannot be performed using the user name and password. git clone https://github.com/ Your account name /tugraph-db
+2. Pull branch ready to modify code:
+   git branch add_xxx_feature
+3. After executing the above command, your code repository switches to the appropriate branch. Run the following command to view your current branch: git branch -a
+4. If you want to switch back to Master, run the git checkout -b master command
+5. If you want to switch back to branching, run the following command: git checkout -b "branchName"
+
+### 4.3. Configuring Github Information
+
+Run git config --list on your machine to view git's global username and mailbox. Check whether the displayed user.name and user.email match your github user name and email address.
+
+If a company has its own gitlab in-house or uses other commercial GitLabs, a mismatch may occur. At this point, you need to set up a separate user name and mailbox for the tugraph-db project. For details about how to set the user name and email address, see github's official documentation.
+
+### 4.4. Compile and Run
+
+The process of compile and run can reference [ci script](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. Change the code and submit it locally
+
+Once you've pulled the branch, you're ready to change the code.
+
+**Code modification Notes**
+
+Code style consistency: TuGraph uses cpplint to keep code in the same format, and IDE can use.clang to configure the style. Be sure to check the code style locally before submitting it, or ACI will report an error.
+
+Add unit test code: New changes should pass through existing unit tests. New unit tests should be provided to prove that there are bugs in the previous code and that the new code has resolved these bugs. You can run all tests with the following command:./unit_test
+It can also be run with the help of an IDE.
+
+**Other precautions**
+
+Please keep the code you are editing in the original style, especially the space feed, etc. For unnecessary comments, delete them directly. Add comments where logic and functionality are not easily understood. Keep documentation up to date. After modifying the code, run the following command to submit all the changes to the local computer:
+git commit -am '(feat) Add the xx function 'git commit -am '(fix) fix xx problem' '
+
+Submit the code to the remote repository
+After the code is committed locally, you can then synchronize the code with the remote repository. Run the following command to submit local changes to github: git push origin "branchname"
+
+If you were forking earlier, the origin here is pushed to your code repository, not TuGraph's.
+
+After the code has been submitted to GitHub, you can send a request to merge your changes into the TuGraph Master. At this point, you need to go to your corresponding repository on GitHub and press the pull request button in the upper right corner. Select the target branch, which is usually the master, and the system will notify the TuGraph staff, who will Review your code, and when it meets the requirements, it will join the main branch and become part of TuGraph.
+
+Please note that the CI will be automatically checked, as well as all Commits signing the cla, with green signs on the commits.
+
+### 4.6. Code Review
+
+After you submit your code, your code will be assigned to a maintainer for Review. Please wait patiently. If no one has responded to your submission after two working days, you can leave a message under PR and @ the corresponding person.
+
+Comments on code Review will be directly noted to the corresponding PR or Issue. If you find the suggestions reasonable, please update them to your code.
+
+### 4.7. Merge code into Master
+
+After the code Review is approved, the TuGraph maintainer will put it into the Master. During this process, the maintainer may specify a new Reviewer and put forward new comments that need to be revised. Normally this step is omitted, and after the code is merged, you will receive an indication that the merge was successful.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..27cff88ae8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,72 @@
+# TuGraph community roles
+
+## 1. Preface
+
+This document describes the roles of membership in the TuGraph community, the requirements and permissions for each role.
+
+## 2. Role summary
+
+This is the division of roles in the TuGraph community, describing the responsibilities of each role, the requirements to become and remain a role, and the permissions of the corresponding role.
+
+Our community is divided into three roles based on the Apache specification:
+
+- Contributor
+- Maintainer
+- PMC
+
+The requirements, responsibilities, and authorities for each role are described below.
+
+## 3. Contributor
+
+### 3.1. requirements
+
+Successfully submit a PR and merge in any of TuGraph's official projects.
+
+### 3.2. responsibility
+
+- Actively respond to issues or PR assigned to you
+- Help reply the issue/pr together and assign the issue to the person in charge of the corresponding module
+
+### 3.3. permissions
+
+- Join the TuGraph GitHub organization and become a member of the TuGraph open source community.
+
+## 4 Maintainer
+
+### 4.1. requirements
+
+The new Committer is recommended by the existing PMC and approved by 2/3 of the votes. The Commiter meets at least one of the following conditions:
+
+- Been a community member for more than three months
+- More than 10 PR for PMC approve
+- Complete major functions
+- Fixed serious bugs
+- Follow project development and participate in community discussion
+
+### 4.2. responsibility
+
+- Community counseling support
+- Actively respond to issues or PR assigned to you
+- The right to vote on major community decisions
+- Review community PR
+
+### 4.4. permissions
+
+- Pull Request review permission
+
+## 5. PMC
+
+### 5.1. requirements
+
+- Not open at the moment, if you have a strong desire please contact PMC
+
+### 5.2. responsibility
+
+- Actively participate in community discussions and give guidance to major community decisions
+- Responsible for ensuring that the community activities of open source projects are running smoothly
+
+### 5.3. permissions
+
+- Pull Request review permission
+- Pull Request approve permission
+- Community role member management
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..4798fc9db4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# Individual Contributor License Agreement
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..5ff3ff31e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# Corporate Contributor License Agreement
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..40b9d098f0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,73 @@
+# TuGraph Roadmap
+
+## 1. Introduction
+
+This document outlines the future development plans for TuGraph, including features currently under development, those
+not in the development pipeline, and completed functionalities not included in the open-source version.
+
+TuGraph aims to be an open-source, high-performance graph database. It adopts a centralized storage approach for graph
+data and, in the short term, does not consider data sharding. Instead, it employs a master-slave replication mode to
+address high-concurrency read scenarios, while utilizing cloud-based storage solutions to address storage capacity
+challenges.
+
+## 2. Completed Functionalities
+
+TuGraph was open-sourced on September 1, 2022, and has received regular bug fixes and enhancements based on community
+feedback.
+
+| Version | Functionality                                                                                 | Date       |
+|---------|-----------------------------------------------------------------------------------------------|------------|
+| 3.3.0   | Initial open-source release                                                                   | 2022.9.1   |
+| 3.3.1   | Refactored graph analysis engine with multi-mode support                                      | 2022.10.14 |
+| 3.3.2   | Added OGM support and improved unit test coverage                                             | 2022.11.21 |
+| 3.3.3   | Iterative improvements to link authentication mechanism and addition of English documentation | 2022.12.23 |
+| 3.3.4   | Cloud deployment support and streamlined LDBC SNB Audit process                               | 2023.1.28  |
+| 3.4.0   | Added support for OLAP Python API and upgraded offline data import                            | 2023.3.11  |
+| 3.5.0   | Introduced POG (Procedures On Graph query language), frontend upgrades                        | 2023.6.5   |
+| 3.5.1   | Added learning engine, Procedure Rust API, and storage-property separation                    | 2023.7.14  |
+| 3.6.0   | High availability support, log system upgrade                                                 | 2023.8.11  |
+| 4.0.0   | ISO GQL support, 11 new open-source graph algorithms, m1 Docker support                       | 2023.9.6   |
+| 4.0.1   | Support for temporal edge sorting, 5 new open-source graph algorithms                         | 2023.9.28  |
+| 4.1.0   | Bolt protocol support, fast online full import, support for geospatial data types             | 2023.12.25 |
+
+In addition, TuGraph has established a comprehensive quality system, including automated unit testing, integration
+testing, and performance testing.
+
+For more detailed information, refer to the "[root]/release/CHANGELOG.md" file in the source code directory.
+
+## 3. Functional Updates in 2024
+
+In addition to the aforementioned core functionalities, the following components are planned for development in 2024.
+
+| Version | 	Functionality                                                | 	Planned Date |
+|---------|---------------------------------------------------------------|---------------|
+| 4.2.x   | 	HA support for Witness role and management tools             | 	2024.3       |
+| 4.2.x   | 	Bolt support for stream processing and parameterized queries | 	2024.3       |
+| x.x.x   | 	GeaX support for Cypher                                      | 	2024.6       |
+| x.x.x   | 	Support for composite indexes                                | 	2024.6       |
+| x.x.x   | 	Optimization of data import functionality                    | 	2024.6       |
+| x.x.x   | 	[Community Feature] Support for geospatial data types        | 	2024.6       |
+| x.x.x   | 	Enhanced Cypher capabilities                                 | 	2024.9       |
+| x.x.x   | 	Support for rapid schema changes                             | 	2024.9       |
+| x.x.x   | 	Vectorization support                                        | 	2024.12      |
+| x.x.x   | 	RPQ support                                                  | 	2024.12      |
+| x.x.x   | 	[Optional] Query engine upgrade                              | 	2024.12      |
+| x.x.x   | 	[Community Feature] Support for GraphAr                      | 	2024.12      |
+
+## 4. Community Collaboration Features
+
+Currently, the development team's resources are limited, and we cannot implement all the desired features for TuGraph.
+However, during the feature planning process, we have identified a range of ideas worth exploring. The team has
+conducted some initial exploration, and we welcome community collaboration in developing the following features:
+
+| Version	 | Functionality	                                                | Planned Date |
+|----------|---------------------------------------------------------------|--------------|
+| x.x.x    | Rich graph algorithm library	                                 | 2024.x       |
+| x.x.x    | Support for default attribute values	                         | 2024.x       |
+| x.x.x    | Best practice of embedded TuGraph-DB usage                    | 2024.x       |
+| x.x.x    | Support for transaction in Bolt clients	                      | 2024.x       |
+| x.x.x    | Support for composite data types like List, Map, and Decimal	 | 2024.x       |
+| x.x.x    | Support of multiple storage engine	                           | 2024.x       |
+
+For simpler features, we will label them as "good first issue" on GitHub issues, and we welcome discussions from
+technology enthusiasts interested in graph databases.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..07fee7bd7a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Contributor Manual
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..baef5017a6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# Importing Data from Relational Databases to TuGraph
+
+> Using [DataX](../6.utility-tools/7.tugraph-datax.md)，to be completed.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..c7b094b1b7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,217 @@
+# Using TuGraph Graph Learning Module for Node Classification
+
+## 1. Introduction
+GNN is a powerful tool for many machine learning tasks on graphs. In this introductory tutorial, you will learn the basic workflow of using GNN for node classification, i.e., predicting the category of nodes in a graph.
+
+This document will show how to build a GNN for semi-supervised node classification on the Cora dataset with only a few labels, which is a citation network with papers as nodes and citations as edges. The task is to predict the category of a given paper.
+By completing this tutorial, you will be able to:
+
+Load the Cora dataset.
+
+Sample and build a GNN model using the sampling operator provided by TuGraph.
+Train the GNN model for node classification on CPU or GPU.
+
+This document requires some experience in using graph neural networks and DGL.
+
+## 2. Prerequisites
+The TuGraph graph learning module requires TuGraph-db version 3.5.1 or above.
+
+It is recommended to use Docker image tugraph-compile 1.2.4 or above for TuGraph deployment:
+
+tugraph/tugraph-compile-ubuntu18.04:latest
+
+tugraph/tugraph-compile-centos7:latest
+
+tugraph/tugraph-compile-centos8:latest
+
+The above images can be obtained on DockerHub.
+Please refer to [Quick Start](../3.quick-start/1.preparation.md) for specific operations.
+
+## 3. Import Cora Dataset to TuGraph Database
+### 3.1. Introduction to Cora Dataset
+The Cora dataset consists of 2708 papers, classified into 7 categories. Each paper is represented by a 1433-dimensional bag-of-words feature, indicating whether a certain word appears in the paper. These bag-of-words features have been preprocessed to be normalized to a range from 0 to 1. The edges represent citation relationships between papers.
+
+TuGraph has provided the Cora dataset import tool, which users can use directly.
+
+### 3.2. Data Import
+The Cora dataset is located in the test/integration/data/algo directory and contains the cora_vertices point set and the cora_edge edge set.
+
+First, the Cora dataset needs to be imported into the TuGraph database. Please refer to [Data Import](../6.utility-tools/1.data-import.md).
+
+In the build/output section below the line:
+``` bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+The number of commands related to the relevant document is to be built/output.
+
+Execute the following command in the build/output directory:
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Here, cora.conf is the graph schema file representing the format of graph data, which can be found in test/integration/data/algo/cora.conf. coradb is the name of the graph data file after import, which represents the storage location of graph data.
+
+## 4. Feature Conversion
+Since the features in the Cora dataset are float arrays of length 1433, which are not supported by TuGraph for loading, they can be imported as strings and converted to char* for easier access later. The implementation can be referred to the feature_float.cpp file.
+The specific execution process is as follows:
+
+Compile the import plugin in the build directory.(Can be skipped if TuGraph has been compiled):
+`make feature_float_embed`
+
+Execute the following command in the build/output directory to perform the conversion:
+`./algo/feature_float_embed ./coradb`
+
+## 5. Compile Sampling Operator
+The sampling operator is used to obtain graph data from the database and convert it into the required data structure. The specific execution process is as follows:
+Can be skipped if TuGraph has been compiled.
+Execute the following command in the tugraph-db/build directory:
+`make -j2`
+
+or execute the following command in the tugraph-db/learn/procedures directory:
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *
+import importlib
+getdb = importlib.import_module("getdb")
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+As shown in the code, after obtaining the algorithm .so file, import and use it.
+
+## 6. Model training and saving
+TuGraph calls the operators of the cython layer in the python layer to realize the training of the graph learning model.
+The usage of the TuGraph graph learning module is introduced as follows:
+Execute under the build/output folder
+`python3 train_full_cora.py --model_save_path ./cora_model`
+You can start training.
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+The detailed training process is as follows:
+### 6.1. Data Loading
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+As shown in the code, load the data into memory based on the path of the graph data, username, password, and subgraph name. TuGraph can load multiple subgraphs for graph training, but we only load one subgraph here.
+
+### 6.2. Build Sampler
+During the training process, the GetDB operator is first used to obtain the graph data from the database and convert it into the required data structure. The specific code is as follows:
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+As shown in the code, the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and their stored information is as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Then a sampler is constructed:
+```python
+batch_size = 5
+count = 2708
+sampler = TugraphSample(args)
+dataloader = dgl.dataloading.DataLoader(fake_g,
+    torch.arange(count),
+    sampler,
+    batch_size=batch_size,
+    num_workers=0,
+    )
+```
+
+### 6.3. Convert the results to the required format
+```python
+src = EdgeInfo[0].astype('int64')
+dst = EdgeInfo[1].astype('int64')
+nodes_idx = NodeInfo[0].astype('int64')
+remap(src, dst, nodes_idx)
+features = NodeInfo[1].astype('float32')
+labels = NodeInfo[2].astype('int64')
+g = dgl.graph((src, dst))
+g.ndata['feat'] = torch.tensor(features)
+g.ndata['label'] = torch.tensor(labels)
+return g
+```
+The results are converted to the required format to fit the training format.
+
+### 6.4. Build the GCN model
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+def build_model():
+    in_size = feature_len  # feature_len is the length of features, which is 1433 here
+    out_size = classes  # classes is the number of classes, which is 7 here
+    model = GCN(in_size, 16, out_size)  # 16 is the size of the hidden layer
+    return model
+```
+In this tutorial, a two-layer Graph Convolutional Network (GCN) will be built. Each layer aggregates neighbor information to compute new node representations.
+
+### 6.5. Train the GCN model
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #If you need to save the model, give the model save path
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+As shown in the code, iterative training is performed 50 times according to the defined sampler, optimizer and model, and the trained model is saved to the path model_save_path.
+
+The output is as follows:
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+The graph learning module can be accelerated by using a GPU. If users want to run it on the GPU, they need to install the corresponding GPU driver and environment. For details, please refer to learn/README.md.
+
+The complete code can be found in learn/examples/train_full_cora.py.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..f769293858
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# Data Migration
+
+## 1 Introduction
+Data migration refers to the process of moving data from one system, storage medium, or application to another system, storage medium, or application. When TuGraph needs to be upgraded or the system hardware environment changes,
+The data in the original TuGraph service needs to be migrated. Based on the system hardware environment and software version, this paper divides data migration into three schemes:
+1. Compatible migration: When the system environment before and after the migration is consistent and the TuGraph software is compatible, you can directly use the backup and recovery method to migrate data;
+2. Upgrade and migration: When the system environment before and after the migration is inconsistent or the TuGraph software is not compatible, it is necessary to migrate the data by first exporting the data and then re-importing;
+3. Online migration: When data migration is performed on a high-availability cluster and the network environment of the cluster is good, the original cluster can be smoothly switched to the new cluster by adding or deleting nodes.
+The following article will introduce these three schemes in detail.
+
+## 2. Compatible Migration
+Compatible migration means that when the system environment remains unchanged and the TuGraph software version is compatible, the data and stored procedures of the original service can be used in the new service, so it can be directly migrated.
+Users can first use the `lgraph_backup` tool to back up the data, then transfer the data to a new machine and restart the service. The specific migration steps are as follows:
+
+### 2.1. Backup data
+Backup data using `lgraph_backup` tool
+```bash
+   lgraph_backup -s db -d db.bck
+```
+You can also directly use the `cp` command in this step, but the `cp` command will copy some redundant metadata, and the raft metadata will also be copied in the HA mode, causing the cluster to fail to restart after migration.
+Therefore, it is recommended to use the `lgraph_backup` tool instead of the `cp` command during data migration.
+
+### 2.2. Start a new service
+Use the following command to start the new service, and the stored procedure will be automatically loaded into the new service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. Stop the original service
+Use the following command to stop the original service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. Upgrade migration
+When the user wants to migrate the original service to a differentiated environment (such as migrating from centos7 to ubuntu18.04), or when the version of TuGraph changes greatly and is incompatible (such as 3.4.0 and 3.6.0),
+Users can first use the `lgraph_export` tool to export the data into a file, transfer it to a new machine, and then use the `lgraph_import` tool to re-import and restart the cluster.
+This can ensure that it can be used in the new environment, but the efficiency is low, and the stored procedure needs to be reloaded. The specific migration steps are as follows:
+
+### 3.1. Export data
+Use the `lgraph_export` tool to export the data and transfer the data to the new machine
+```bash
+   lgraph_export -d db -e db.export
+```
+
+### 3.2. Import data
+Use the `lgraph_import` tool to import data and manually load the stored procedure (see [client operation steps](../7.client-tools/2.cpp-client.md) for details)
+```bash
+   lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. Start a new service
+Start the new service with the following command
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. Stop the original service
+Use the following command to stop the original service
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. Online Migration
+When performing data migration on the server cluster deployed by the high-availability version of TuGraph, if the network bandwidth is sufficient, you can directly migrate the service online by adding or deleting nodes. The specific migration steps are as follows:
+
+### 4.1. Copy data
+Use the following commands to copy the data on the leader node and transfer it to the machine nodes of the new cluster. Since the leader node has the most complete raft log, copying the leader's data can minimize
+The time for the log to catch up.
+```bash
+   cp -r db db.cp
+```
+### 4.2. Starting a new node
+Use the following command to join the new node to the cluster. After joining the cluster, the incremental data will be automatically synchronized to the new node
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. Stop the original node
+Stop the original node service, and send subsequent application requests directly to the new cluster
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..62f7a61957
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# Environment and version selection
+
+> This document introduces how to select the system environment and deployment method
+
+## 1 Introduction
+
+TuGraph provides differentiated system environments and deployment methods for users with different needs to meet the needs of different users such as novices, system developers, production operation and maintenance personnel, and researchers.
+
+## 2. Environmental capability selection
+
+Users can choose different environments based on actual usage scenarios. The compilation environment has the most complete capabilities and requires more third-party software. Correspondingly, the streamlined operating environment requires almost no installation of any dependent libraries and can run TuGraph's basic functions except stored procedures.
+
+| Environment                      | Purpose                                     | Remarks                                 |
+|----------------------------------|---------------------------------------------|-----------------------------------------|
+| Compilation environment          | Compile TuGraph from source                 | For developers                          |
+| Running environment              | Run TuGraph installation package            | Applicable to most users                |
+| Simplified operating environment | Run simplified TuGraph installation package | Less dependence on the operating system |
+
+For a detailed introduction to different environments, see [link](../5.installation&running/2.environment-mode.md).
+
+## 3. Deployment method selection
+
+TuGraph deployment only requires one server (high availability mode requires multiple servers), and you can choose a suitable deployment method based on actual resource conditions and usage scenarios.
+
+| Deployment method | Description | Remarks |
+|----------|-----------------------|--------------- -------------------------------------------------- --------------------------|
+| Cloud deployment | Alibaba Cloud Computing Nest one-click deployment, free trial | Suitable for novices, process reference [Link](../5.installation&running/5.cloud-deployment.md) |
+| Docker deployment | Cross-platform deployment through pre-prepared Docker images | Users with hardware requirements, such as performance testing, please refer to [link](../5.developer-manual/1.installation/3.docker-deployment. md) |
+| Local deployment | Tightly coupled deployment in existing systems | Applicable to specified production environment, refer to the process [Link](../5.installation&running/4.local-package-deployment.md) |
+
+## 4. Next steps
+
+After the deployment is completed, you can proceed to [Start Service](../5.installation&running/7.tugraph-running.md) and [Data Import](../5.developer-manual/3. server-tools/1.data-import.md) and other operations, you can also experience the entire process through [Sample Data](../3.quick-start/2.demo/1.movie.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..4292d5488f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Best Practices
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/14.faq.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/14.faq.md
new file mode 100644
index 0000000000..5288de0798
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/14.faq.md
@@ -0,0 +1,35 @@
+# FAQ
+
+During the use of TuGraph, if you encounter problems, you can first check [User Documentation](https://github.com/TuGraph-db/tugraph-db/tree/master/doc/zh-CN). Second, check to see if the FAQ list below matches your question.
+
+1. **[Kernel Engine QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussion-4575385)**
+   1.1 [Does the edge of TuGraph support index? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165379)
+   1.2 [What is the QPS of a single TuGraph machine? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussion-4575381)**
+   2.1 [How to update the tugraph service after the visualization file is built? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165364)
+   2.2 [How to connect the existing tugraph service through npm run dev? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165366)
+   2.3 [TuGraph Browser version 3.3.0 failed to delete node label? ](https://github.com/TuGraph-db/tugraph-db/discussions/82#discussion-4465791)
+3. **[Client QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussion-4575378)**
+   3.1 [What programming languages ​​does the client currently have, and does it support node js? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165351)
+   3.2 [Does the python client support pip install? Where is the client referenced? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165353)
+4. **[Data Import QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussion-4575373)**
+   4.1 [Which common databases can TuGraph connect to? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165335)
+   4.2 [How to import data? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[Stored Procedure QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussion-4575369)**
+   5.1 [How to load stored procedure or algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165313)
+   5.2 [How to call or execute the stored procedure? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165317)
+   5.3 [Where is the open source built-in algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[Installation and deployment QA summary](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussion-4575364)**
+   6.1 [How to install using docker image? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165287)
+   6.2 [After the rpm package and deb package are installed, start the lgraph_server service. Prompt missing 'liblgraph.so' error? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165289)
+   6.3 [How to compile TuGraph on Mac's M1 chip? ](https://github.com/TuGraph-db/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussion-4575018)**
+   7.1 [Does it support conditional query of indefinite length? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165252)
+   7.2 [How to query the shortest path, how to use the shortestPath function? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165256)
+   7.3 [Using and after the query statement Where to splice the query speed is slow, how should the statement be optimized and improved? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165260)
+   7.4 [How to query the edge of any jump? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165262)
+   7.5 [Is there a date() function in Cypher? ](https://github.com/TuGraph-db/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA Summay](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+   8.1 [What should I do after the error "User has reached the maximum number of tokens" is reported? ](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+If the problem is still not resolved, we recommend you follow up or create a new thread describing your problem. At the same time, the TuGraph QA summary will be updated regularly based on the posts initiated by everyone in the discussion area.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/15.contacts.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/15.contacts.md
new file mode 100644
index 0000000000..fb28a5f1aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/15.contacts.md
@@ -0,0 +1,17 @@
+# Contacts
+
+If you have any feedback or suggestions for the product, You are welcome to join the discussion or make suggestions through the following contact methods.
+
+Official website: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue:
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions:
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack:
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+Contact us via dingtalk, wechat, email and telephone:
+![contacts](../../images/contact-en.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..549043a94c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,15 @@
+# What is Graph
+
+The graph that we're going to introduce today, it's neither a picture, nor a diagram，it's a class of mathematics called graph theory. We can see on the screen that there are two graphs on the left and right, which represent things and their relationship. We abstract it out in a form, and we call such a form a graph.
+
+![alt what is graph](../../../images/what-is-graph-en.png)
+
+The basic elements of a graph are a vertex, and an edge, a vertex is a representation of the thing, of the entity, and an edge is a representation of the relationship between them.
+
+We see the graph on the left, the dots have companies, they have employees, and they have projects. What are their sides? The relationship between the company and the employees is an employment relationship, and there can be a friend relationship between the employees, and there can be a participation relationship between the project and the employees. That is, we can use graphs to abstract things and their relationships.
+
+The diagram on the right is a schematic diagram of a financial transaction. Each of us has a bank account, and when our bank account makes a consumption or makes a transfer, this account is the point on the graph, and this edge can indicate that there is such a transfer relationship between us.
+
+We can also see from this example that edges can attach information and points can attach information. The point can attach which bank this account is in and what the account is. The value of the transaction can be attached to the edge, and many times, if your transaction is large, it indicates that special attention is needed. This edge might not necessarily be the amount of a particular transfer, it might be the amount accumulated over a period of time and so on. Graphs can actually be very expressive.
+
+On the other hand, for a graph like finance, it can be very large. There could be more than a billion points, a hundred billion or even a trillion edges. As you can imagine, it's actually quite challenging to actually work with these graphs.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..935aa4ffa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# What is a graph database
+
+> This document mainly introduce what is a graph database, the advantages of graph database compared with relational database, and the comparison between graph database and relational database
+
+## 1. Introduction
+
+Graph database is a database based on graph model. The main function of graph database is to manage graph data, so it needs to support efficient vertex/edge query and update; To facilitate user use, it is usually necessary to add transaction support to ensure the normal operation of concurrent operations.
+
+## 2. Advantages of graph databases over relational databases
+
+The function of graph database is an extension of traditional relational database. Compared with relational database, the graph structure supported by graph data is more flexible. Graph database is different from other databases in terms of data addition, deletion, query and modification based on graph. On the operation abstraction of graph data, a vertex-based perspective is adopted, for example, a vertex accesses its neighboring vertices through all its outgoing edges. This kind of operation is also the core of the design of graph database system.
+
+The uniqueness of graph database can be reflected in the following three aspects:
+
+### 2.1 Performance
+
+Handling the relationship between data, it is inevitable to use table JOIN operation in relational database, which has a great impact on performance. Graph database is a direct access, similar to pointer access, which is more efficient operation of associated data, compared with relational database performance improvement of 2 to 4 orders of magnitude.
+
+### 2.2 Compatibility
+
+In reality, the process of a project is often evolutionary. The content and even the format of the data are constantly changing. In a relational database, this means that a change in the table structure, or the creation of multiple new tables, significantly changes the source data. In the graph database, you simply add new vertices, edges, and attributes, and set them to the corresponding types. In essence, a table represents a type of data, and a vertex represents a specific data, meaning that relational databases pay more attention to the type of data, while graph databases pay more attention to the individuals of data and identify their association relationships.
+
+### 2.3 Intuitive
+
+Using graphs (or nets) to express real-world relationships is more straightforward and natural, especially in the Internet of Things era. If relational data used, a high degree of abstract thinking required to build a table of characters first, then a table of relations, and finally a map of data. When analyzing and querying the graph data, you can also intuitively find the desired data interactively through the point-edge connection topology, without any professional knowledge.
+
+## 3. Comparison between graph database and relational database
+
+| classification      | model           | advantage                                                            | disadvantage                                                                 | example        |
+| ------------------- | --------------- | -------------------------------------------------------------------- | ---------------------------------------------------------------------------- | -------------- |
+| Relational database | Table structure | Data is highly structured, consistent, and software maturity is high | The multi-hop association query is inefficient or not supported              | MySQL、Oracle  |
+| Graph database      | graph structure | Modeling and manipulating associations is very efficient             | Highly structured data processing is not as powerful as relational databases | Neo4j、TuGraph |
+
+In a word, in the face of massive data storage and processing problems, the traditional relational database has been unable to meet most of the daily data storage needs. Graph database technology can store relational information as entities and expand data model flexibly. Because it provides the most direct expression of related data, and the graph model is naturally tolerant to heterogeneous data. In the future, graph database technology will become one of the most popular technologies, which will provide powerful support for enterprises to store and analyze large-scale graph data.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..da6cbf6318
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,46 @@
+# What is TuGraph
+
+> This document mainly introduces the main features and characteristics of TuGraph Community Edition, as well as the differences between TuGraph Enterprise Edition and Community Edition.
+
+
+## 1.Introduction
+
+Graph database is a non-relational database that stores data by vertices and edges. It can be used to store complex data network models, such as social networks and transaction networks. TuGraph is a graph database developed by Ant Group. This manual introduces the functions and usage of TuGraph.
+
+## 2.TuGraph Community Edition
+
+The Community Edition is a fully functional version of TuGraph, suitable for single-instance deployment. It provides complete basic fuctions of graph database, such as ACID-compatible transactions, programming APIs, and associated tools. It is ideal for learning TuGraph and implementing small projects.
+
+## 3.TuGraph features
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property graph model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+## 4.TuGraph Enterprise Edition
+
+The Enterprise Edition has more comprehensive support for commercial features, including distributed cluster architecture, a one-stop graph platform covering exploration, research and development, service and operation and maintenance throughout the lifecycle, online, near-line, and offline graph computing engines, support for streaming and big data data sources, multi-site and multi-center deployment, making it an ideal choice for commercial solutions.
+
+```text
+    If you need to implement production-level high-availability cluster architecture, operation and maintenance and other enterprise-level services, please contact us to obtain commercial support:
+    Email:tugraph@service.alipay.com
+    Tel:0571-85022088,extension number 83789993#
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..422d96b675
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/4.schema.md
@@ -0,0 +1,95 @@
+# TuGraph schema  Instructions
+## 1.The data model
+
+### 1.1.Graph model
+TuGraph is a strong schema, directed property graph database with multi-graph capability.
+
+- Graph Project: Each database service can host multiple graph projects (multi-graphs), and each graph project can have its own access control configuration. The database administrator can create or delete specified graph projects.
+- Vertex: Refers to entity, generally used to express real-world entities, such as a movie or an actor.
+    - Primary Key: User-defined vertex data primary key, unique in the corresponding graph project and vertex type.
+    - VID: Refers to the auto-generated unique ID of the vertex, which cannot be modified by the user.
+    - Upper Limit: Each graph project can store up to 2^(40) vertex data.
+- Edge: Used to express the relationship between vertexs, such as an actor appears in a movie.
+    - Directed Edge: The edge is a directed edge. If you want to simulate an undirected edge, the user can create two edges with opposite directions.
+    - Duplicate Edge: TuGraph currently supports duplicate edges. If you want to ensure the uniqueness of the edge, you need to implement it through business policies.
+    - Upper Limit: Up to 2^(32) edge data can be stored between two vertex data.
+- Property Graph: vertexs and edges can have properties associated with them, and each property can have a different type.
+- Strong-typed: Each vertex and edge has only one label, and after creating a label, there is a cost to modify the number and type of attributes.
+    - Specify the starting/ending vertex type of the edge: You can limit the starting and ending vertex types of the edge, and support different vertex types of the starting and ending vertexs of the same type of edge, such as individuals transferring money to companies, companies transferring money to companies. After specifying the starting/ending vertex type of the edge, you can add multiple sets of starting/ending vertex types, but you cannot delete the restricted starting/ending vertex types.
+    - Unrestricted Mode: Supports creating edge data of this type between any two vertex types without specifying the starting and ending vertex types of the edge. Note: After specifying the starting/ending vertex type of the edge, the unrestricted mode cannot be used again.
+
+### 1.2.The data type
+
+TuGraph Supports a variety of data types that can be used as attributes, the specific supported data types are as follows:
+
+<caption>Table 1. TuGraph supported data types</caption>
+
+| **Type** | **Min**             | **Max**             | **Description**                                  |
+|----------|---------------------|---------------------|--------------------------------------------------|
+| BOOL     | false               | true                | Boolean                                          |
+| INT8     | -128                | 127                 | 8-bit int                                        |
+| INT16    | -32768              | 32767               | 16-bit int                                       |
+| INT32    | - 2^31              | 2^31 - 1            | 32-bit int                                       |
+| INT64    | - 2^63              | 2^63 - 1            | 64-bit int                                       |
+| DATE     | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" Date of format                      |
+| DATETIME | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD hh:mm:ss[.ffffff]"Format of the date and time |
+| FLOAT    |                     |                     | 32-bit float                                     |
+| DOUBLE   |                     |                     | 64-bit float                                     |
+| STRING   |                     |                     | A string of variable length                      |
+| BLOB     |                     |                     | Binary data                                      |
+
+_BLOB data is BASE64 encoded in input and output_
+
+### 1.3.Index
+
+TuGraph supports indexing vertex fields.
+
+Indexes can be unique or non-unique. If a unique index is created for a vertex label, TuGraph will perform a data integrity check to ensure the uniqueness of the index before modifying the vertex of the label.
+
+Each index built on a single field of a label, and multiple fields can be indexed using the same label.
+
+BLOB fields cannot be indexed.
+
+TuGraph supports creating indexes on properties of vertexs or edges to improve query efficiency.
+- The index can be a unique or non-unique index.
+- If a unique index is created for a vertex label, when modifying the vertex of the label, data integrity check will be performed first to ensure the uniqueness of the index.
+- Each index is created based on a property of a vertex or edge, and indexes can be created on multiple properties of the same vertex or edge.
+- An index cannot be created on a BLOB-type property.
+
+## 2. Graph Project, Vertex, Edge, and Attribute Naming Conventions and suggestions
+
+### 2.1 Naming Rules
+Graph projects, vertices, edges, and attributes are identifiers. This section describes the allowed syntax for identifiers in TuGraph.
+The table below describes the maximum length and allowed characters for each type of identifier.
+
+|**Identifier** |**Length** |**Allowed Characters**|
+|---------  |---------  |---------  |
+|User, role, graph project	|1-64 characters	|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+|Vertex type, edge type, attribute	|1-256 characters		|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+
+### 2.2 Usage Restrictions
+
+|**Description**|	**Maximum number**|
+|-------- |--------- |
+|Number of users, number of roles	|65536|
+|Number of graphs	|4096|
+|Number of vertex and edge types per graph	|4096|
+|Number of attributes per type	|1024|
+
+Note:
+1.Special characters and keywords: When using special characters or keywords, they need to be enclosed in backquotes (``) for reference;
+
+Example: ```match (`match`:match) return `match`.id limit 1```
+
+2.Case sensitivity: TuGraph is case-sensitive;
+
+3.Graph project, vertex/edge, and attribute names can be reused, but attribute names under the same vertex or edge cannot be duplicated;
+
+4.Reserved keywords for attribute names: SRC_ID / DST_ID / SKIP.
+
+### 2.3 Naming Suggestions
+|**Identifier**|**Description**|**Suggestions**|
+|-------|-------|--------|
+|Graph project	|Start with a letter or Chinese character	|Examples: graph123, project123, etc.|
+|Vertex/edge type	|Start with a letter or Chinese character and use underscores to separate words		|Examples: person, act_in, etc.|
+|Attribute	|Letters or Chinese characters	|Examples: name, age, etc.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..de894fa1b0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# Performance Oriented
+
+> This document mainly introduces TuGraph's performance-oriented design philosophy as an open-source graph database.
+
+## 1.Introduction
+
+TuGraph is currently the fastest graph database in the world, ranking first in the LDBC SNB Interactive graph database standard evaluation (March 2023). The design of TuGraph is based on performance optimization, and is committed to building a high-performance single-machine graph database. This document describes the core design of TuGraph's storage layer based on performance optimization.
+
+## 2.Characteristics of Graph Operations
+
+Operations on property graphs involve reading, writing, and their attributes, and the access patterns of some special attributes such as timestamps can also affect overall performance. Here, by summarizing the regularities of some graph operation characteristics, we can guide the final performance.
+
+We observe that many graph applications have similar data access patterns. For example, in credit risk control, we use recursive path filtering to search for many-to-one patterns to find suspicious credit fraud users and behaviors. For online gambling, we can identify gambling-related fund accounts by recognizing multiple fund transfers in a short period of time. The equity penetration scenario recursively calculates the equity relationship between entities. These scenarios have common patterns such as multi-hop entity and relationship access, time window constraints, and read/write transactions.
+Furthermore, from the discussion in the introduction and the analysis of graph workloads, the following characteristics can be summarized:
+
+**Characteristic 1** KHop is the most typical operation in a graph, based on the data access pattern of the graph topology of points and edges, and has essential differences from relational databases. The typicality of KHop is not only reflected in the different data access patterns, but it is also the performance point that graph databases need to pay attention to the most.
+
+**Characteristic 2** Data access of graph workloads has a certain degree of locality on the topology, and the edges of the same point are usually accessed simultaneously. When the labels of these edges are the same, there is a greater probability of simultaneous access.
+
+**Characteristic 3** When accessing points and edges in graph workloads, their corresponding attributes are usually accessed as a traversal filter condition.
+
+**Characteristic 4** In time-based graph workloads, filtering of points and edges is usually within a certain time range, such as the past week.
+
+**Characteristic 5** Write operations may be accompanied by a large number of read operations, which need to be processed in a single transaction cycle.
+
+Through the analysis of actual online graph applications, the read/write ratio of graph workloads is about 20:1, although the scenarios are limited to the financial field and the number of clusters is also limited, the scale of the data involved and the number of users are very large, which is representative to some extent. The 20:1 read/write ratio of graph workloads indicates that the impact of read workload on overall performance is greater, and the performance of write workload cannot be ignored either.
+
+## 3.Storage Data Structures
+
+TuGraph uses B+ trees as the underlying data structure to support real-time transactional operations for insertion, deletion, querying, and updating.
+
+In sorting tree data structures, B+ trees and LSM trees are the main representatives. B+ trees use a split and merge method to update sorted data in tree nodes, while LSM trees append updates to logs for delayed data merging. B+ trees were originally used in file system implementations, solving the problem of differences in performance between sequential and random operations on hard disks by storing data in adaptive-length leaf nodes, and have a relatively balanced read/write performance. The main advantage of LSM trees is to use WAL (Write Ahead Log) to perform updates, which turns update operations into sequential operations, especially in the case of small key-value pairs. WAL means that the update of data is deferred until it is merged in batches, which can improve the comprehensive efficiency of batch updates, but also makes the system scheduling more complicated. If the update merge is not completed, and the data is read again, LSM trees need to read several levels of locally merged logs, which will cause read amplification and space amplification, thereby affecting read efficiency.
+
+To sum up, B+ trees have better sequential read/write performance, while LSM trees have advantages in random write data. In addition, the way of LSM trees using background merging makes the performance fluctuation difficult to predict, and the correlation between performance fluctuation and upper-level storage and computation is weak, which increases the overall design cost. Considering the above factors, TuGraph chooses B+ trees as the implementation for read performance optimization.
+
+## 4.Data Encoding
+
+For property graph models, in addition to graph topology encoding, property data also greatly affects functionality and performance. We first discuss how property data can be encoded together with topology data. From current research, there are two ways of encoding properties: discrete encoding, which stores property data separately based on pointer indexes, and compact encoding, which packs property data and topology data together. Discrete encoding can store each property separately or pack each edge's properties separately, and the following discussion applies to both situations.
+
+Vertex Query: Property encoding mainly focuses on edges and does not involve vertex queries.
+
+Single-Edge Query: Discrete encoding locates edges through pointers, while compact encoding requires binary search to locate the edge position. Discrete encoding has a slight advantage.
+
+Edge Traversal: Discrete encoding requires constant random access through pointer jumps during edge traversal, while compact encoding arranges data together in advance, greatly improving efficiency due to its sequential access feature. Since edge traversal operations are common according to Rule 3, compact encoding has obvious advantages in edge traversal.
+
+Single-Edge Update: Discrete encoding only requires finding the corresponding pointer position and modifying the pointer's location before and after inserting data. Compact encoding needs to re-encode the compactly arranged data and rewrite the entire edge value, resulting in significant overhead compared to discrete encoding.
+
+Batch Edge Update: Batch updates can pre-build all edge properties for a vertex in memory and write them in one encoding, making both discrete encoding and compact encoding equivalent. However, compact encoding does not require storing pointer variables, so it has higher storage space efficiency.
+
+The performance issues of discrete encoding and compact encoding for a certain type of query discussed above can be alleviated through optimization. Overall, due to the 20:1 read-write load of graphs and the characteristics of property access revealed by Rule 3, TuGraph tends to use compact encoding to ensure read performance. Its main weakness is the overhead of re-encoding during single-edge updates, which can be solved using adaptive mapping technology.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3407932273
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,33 @@
+# Multi Level Interfaces
+
+> This document mainly introduces the design concept of TuGraph's multi-level interfaces.
+
+## 1.Introduction
+
+The multi-level interface is a balance between usability and high performance that TuGraph has designed to meet a variety of use cases. For example, Cypher, a declarative graph query language, can abstract away the implementation details of a graph database and express queries based on the graph model. However, Cypher's high-level descriptions cannot be efficiently translated into low-level execution, so TuGraph provides a procedural language, Procedure API, to achieve optimal database performance.
+
+Interfaces can be roughly divided into client interfaces and server interfaces. Most operations are performed on the server, and the client only does data encapsulation and parsing. The client and server are connected through a network, and TuGraph supports both flexible short-connection REST protocol and more efficient long-connection RPC protocol, which can be selected according to different business scenarios.
+
+The server interfaces are all at the calculation layer and are logically separated from the graph data storage by a Core API layer.
+
+![Multi Level Interfaces](../../../../images/multi-level-Interfaces-en.png)
+
+### 2.Client Interface
+
+The client interface refers to the interface executed on the client and is typically used for integration into software applications. TuGraph's client interface is relatively simple, including login/logout, data import/export, stored procedure loading and calling, and Cypher operations. Cypher integrates most of the functions, including data operations, graph model operations, operations and account management.
+
+Since the parameters and return values of Cypher are strings, JAVA OGM is a structured wrapper for Cypher, meaning that query results can be encapsulated into a typed object for ease of use.
+
+### 3.Server Interface
+
+The server interface includes Cypher, Procedure API, OLAP API, and GNN PI, which provide services for graph transaction engines, graph analysis engines, and graph neural network engines. The characteristics of each interface are explained in detail below.
+
+> __Cypher__ is an abstract description of query logic that is independent of execution logic and is more user-friendly for graph database applications, similar to the SQL language of relational databases. TuGraph's Cypher language mainly follows the OpenCypher query standard open-sourced by Neo4j and extends auxiliary functions such as operations and maintenance management. Descriptive graph query language will become the main data operation method for graph databases, but generating the optimal execution plan between description and execution still requires a long way to go in both academia and industry.
+
+> __Procedure API__ is designed to bridge the gap between descriptive graph query language and optimal performance. TuGraph's Procedure API provides a simple wrapper on top of the Core API, which maximizes the storage's performance efficiency and is the upper limit of Cypher optimization performance. Python Procedure API is a cross-language wrapper on top of C++ Procedure API, but the copying of values during translation may result in some performance loss, and its advantage lies mainly in the ease of use of the Python language. The traversal API is a parallel-executing Procedure interface that is more similar to set operations in terms of description, such as expanding all outgoing neighbors of a point set to obtain a new point set.
+
+> __OLAP API__ belongs to the category of "graph computing systems" and exports snapshots of graph data from storage that supports insert, update, delete, and query operations to support read-only complex graph analysis in a more compact data storage format. OLAP API encapsulates data structures that support high-concurrency execution, including Vector, Bitmap, and CSR-based graph snapshot data structures, and provides a set of concurrent fast point-edge operation frameworks. After the graph analysis task is completed, the data can be written back to the graph database through the interface.
+
+> __GNN API__ mainly provides the interfaces needed for graph neural network applications and can be integrated with machine learning frameworks such as PyTorch. TuGraph's GNN PI mainly integrates DGL and completes the entire process from graph storage to graph neural network application in the Python language environment.
+
+Except for Cypher's interpretive execution, all other server interfaces are compiled and executed, meaning that the corresponding code needs to be sent to the server and compiled (which may take some time) before execution on the server. Therefore, it is usually necessary to load the program first, then find it in the list of loaded applications, and execute it after passing in the input parameters.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..080cc02e48
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> This document mainly introduces the design philosophy of TuGraph's HTAP.
+
+## 1.Introduction
+
+![htap](../../../../images/htap-en.png)
+
+There are different ways to implement HTAP in architecture: one is to use two different copies to handle OLTP and OLAP tasks separately, with the core being data consistency synchronization and additional resource overhead; the other is to use the same data storage at all times, but this implementation has memory bloat in its data structure and needs further work for industrialization. In TuGraph's design, simple OLAP and OLTP operations share the same data, while complex OLAP operations are exported and handled separately as snapshots.
+
+## 2.Design
+
+In TuGraph, OLTP is the graph transaction engine, corresponding to transaction operations in Figure; OLAP is the graph analysis engine, corresponding to simple graph analysis operations (such as SPSP) and complex graph analysis operations (such as PageRank), the former of which can be executed directly on the graph storage, while the latter requires exporting a snapshot for execution.
+
+- Transaction operations, measured by the graph transaction engine, are local graph add, delete, query and modify operations, typically used for K-hop access.
+- Simple analysis operations are the simpler part of the graph analysis engine, usually local graph analysis operations, such as the shortest path algorithm SPSP and Jaccard algorithm.
+- Complex analysis operations are the more complex part of the graph analysis engine, usually involving multi-round data iteration operations across the entire graph, such as the PageRank algorithm for webpage ranking and the Louvain algorithm for community discovery.
+
+As shown in Figure , external storage is added to the architecture diagram, making the data source for graph analysis not limited to the graph database and can be directly read from text files.
+
+- Graph storage, which is the storage in the graph database, has carefully designed data structures that can perform real-time add, delete, query and modify operations.
+- External storage, which can be an RDBMS or text file, is stored in a simple way as an edge table, only for one-time batch reading and batch result writing. In the calculation layer, it corresponds to the interface in the overall architecture diagram.
+- Cypher, the declarative graph query language, can be executed concurrently.
+- Procedure API, the procedural graph query language, is flexible and can support both transaction operations and graph analysis operations, but its efficiency is not sufficient to complete complex graph analysis operations, and it can be executed concurrently.
+- OLAP API, for multi-round iteration of complex graph analysis. Applications need to first export the graph data in storage into a snapshot in memory, which is only used for fast access and does not need to consider the write support of ACID, so it can be arranged more compactly, and the read efficiency of CSR arrangement is much higher than that of graph storage data arrangement. OLAP API can only be executed serially, and each operation uses full CPU resources.
+
+OLAP API snapshots can be created from external storage, where the edge table data is formatted as CSR, or from the graph storage. It should be noted that OLAP API requires that the IDs of the vertices be consecutive natural numbers, which may require additional ID mapping. This step can be mapped to a specified attribute when creating a snapshot or directly using the attribute value as the ID.
+
+Corresponding to the calculation interface and storage, there are four operating modes.
+
+- Transaction mode, each operation corresponds to a Cypher statement, which is a transaction by default.
+- Plugin mode, call through plugins, after the calculation logic is loaded on the server, also known as stored procedures.
+- Embed mode, which has the same interface as Plugin mode but the graph database service does not need to be started and can directly call the data in the database through the interface. This mode is usually used for debugging Procedure API and OLAP API code, and the debugging information and operation steps are more friendly than Plugin mode.
+- Standalone mode, which maximally separates from the graph database, is more direct when only using the graph analysis engine for data analysis. Standalone mode will directly use the data of the external storage.
+
+The use of the graph neural network engine is similar to the 'complex graph analysis operation', which calls part of the OLAP API and GNN API at the same time, which is not elaborated here.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..b42c13eac8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Characteristics
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..198facd84b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# Architecture
+
+> This document mainly introduces the product architecture of TuGraph.
+
+## 1.Introduction
+
+![Architecture](../../../images/architecture-en.png)
+
+The following diagram shows the overall architecture of an enterprise-level graph database from the perspective of functional modules, using TuGraph as an example, from bottom to top:
+
+- Software and hardware environment. This involves the development and use environment of the graph database. TuGraph is mainly developed based on the underlying C++ language, and is compatible with most operating systems and CPUs on the market.
+- Storage layer, including the KV storage layer and the graph storage layer. The storage layer needs to support various functions required by the calculation layer.
+- Calculation layer. The calculation layer should include the graph transaction engine, graph analysis engine, and graph neural network engine. It also includes a variety of programming interfaces provided by the server, including descriptive query language Cypher, stored procedures, and so on.
+- Client. The client SDK should support multiple languages such as Java, Python, and C++, and also support command-line interaction. The Browser and Explorer reduce the threshold for using the graph database through web-based interaction.
+- In terms of ecological tools, it covers the development, operation, and management links of enterprise-level graph databases, improving usability.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..c8bc65a993
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/7.functionality.md
@@ -0,0 +1,99 @@
+# Functionality
+
+> This document mainly introduces the main functions and features of TuGraph.
+
+## 1.Installation
+
+## 1.1.Installation
+
+Deployment methods TuGraph currently provides three deployment methods: cloud deployment, Docker deployment, and local package deployment. Users can choose the appropriate deployment method according to their actual situation.
+
+## 1.2.Software and Hardware Environment
+
+TuGraph core is developed in C++, and the default compiler used is GCC8.4, using c++14 standard. Some functions use other compilers, such as ApacheLucene-based full-text indexing, which uses JNI interface and requires a Java compiler. In addition, the Python Procedure API is provided in the stored procedure, which requires a Python environment. TuGraph does not require special hardware such as GPUs, and can naturally adapt to general hardware upgrades such as RDMA and HBM with high latency and low bandwidth.
+
+TuGraph has been tested on CPUs based on X86 and ARM, including Intel, AMD, Kunpeng, Hygon, Feiteng, etc., and also runs on multiple operating systems, including mainstream versions of Ubuntu, CentOS, SUSE, Galaxy Kylin, Zhongbiao Kylin, and UOS, without special requirements for operating systems and CPUs.
+
+The software and hardware environment also includes the environment of dependent libraries. Since the default KV storage in TuGraph's storage layer is LMDB, the file system needs to support POSIX interfaces. The compilation and parameter configuration in different environments will be slightly different. For example, in the packaging of point-edge data in graph storage, it should match the page table size of the operating system, which is 4KB by default, and it is recommended to set the system's page table size to 4KB.
+
+## 2.Storage layer
+
+In the graph data model, TUGraph supports the attribute graph model, which can be divided into subgraphs, tags (including vertex tags and edge tags), and attributes according to the hierarchy.
+
+From the perspective of the storage layer, TuGraph uses an intuitive multi-layered tree model, without tags across subgraphs or attributes across tags, and only retains the core logic of the graph model. In terms of subgraph storage, TuGraph has performed data physical isolation for multiple graphs, and each graph corresponds to an instance of LMDB. The metadata description information of multiple graphs is saved in a special public LMDB instance called meta. The storage of vertex and edge tags and their attributes maps graph data adaptively to KV key-value pairs, maximizing read performance. At the same time, multi-threaded writing is implemented at the KV layer, solving the disadvantage of low write performance of LMDB. Primary key indexes and secondary indexes correspond to B+ tables in LMDB, supporting index value addition, deletion, query, and modification based on comparison.
+
+The storage layer also retains some other non-core functional data, including permission data, pre-compiled plugin data, and monitoring data.
+
+## 3.Calculation layer
+
+The calculation layer is divided into three parts in terms of function, including the TP-class graph transaction engine, the AP-class graph analysis engine, and the graph neural network engine.
+
+__The graph transaction engine__ is mainly used to process concurrent graph operations, including single-point queries, neighbor queries, and path traversal. The graph transaction engine focuses on ACID transactions of concurrent operations, ensuring that the operation logic will not interfere with each other. The main performance indicator is QPS, which is the number of completed queries per second.
+
+__The graph analysis engine__ usually operates as a full-graph iteration. Some simple analysis tasks (such as SPSP) can be completed by the graph transaction engine, and complex analysis tasks are completed by the graph analysis engine, which usually takes several seconds to several hours for a single task. Therefore, a single graph analysis task should use all hardware resources in parallel, and the performance indicator is the total time for completing the task.
+
+__The graph neural network engine__ usually operates as a full-graph iteration. In addition to graph topology-based operations, the graph neural network engine also needs to integrate a machine learning framework to handle vector operations, such as PyTorch, MXNet, and TenserFlow.
+
+The logic of the three engines is different and independently configured for resource pools. The graph transaction engine sets up a thread pool based on RPC operations. For each operation received from the client, a thread is taken from the pool to process it, and the number of concurrent executions is equal to the capacity of the RPC thread pool, which is usually configured as the number of server cores. The graph analysis engine has an analysis thread pool, and each graph analysis task is executed concurrently, that is, all threads are used to execute a task to speed up the performance of the operation. The serial execution feature of TuGraph graph analysis operations will restrict the user experience to a certain extent. The demand for concurrent graph analysis can be processed by deploying high-availability, increasing machine resources, or connecting to an external task scheduler to transfer data to a container for real-time scheduling and calculation. Graph neural network operations will reuse the resources of the graph transaction
+
+## 4.Core Features
+
+### 4.1.Query Language
+
+TuGraph provides Cypher graph query language that follows the OpenCypher standard.
+- Supports Procedure embedding.
+- Supports pluggable optimization frameworks with various optimization features.
+- Supports extensible security check framework for Cypher.
+
+### 4.2.Stored Procedures
+
+When users need to express complex query/update logic that Cypher cannot describe, or when high performance is required, TuGraph's stored procedures (Procedure) is a more concise and efficient choice than calling multiple REST requests and completing the entire processing flow on the client-side.
+
+### 4.3.Data Import/Export
+
+Although TuGraph supports data insertion, batch import can greatly improve efficiency. The import function can be divided into importing into an empty database (offline import) and incremental import. The former refers to importing when the subgraph is empty, and the additional assumption can greatly improve the import performance. In TuGraph, the throughput rate of empty database import and incremental import differs by 10 times. Data consistency needs to be considered in data export, which is based on exporting data based on a snapshot.
+
+TuGraph can perform data export on graph data already stored in TuGraph using the command-line tool `lgraph_export`. The export format supports CSV and JSON.
+
+### 4.4.Backup and Restore
+
+ TuGraph's backup function can be divided into active/scheduled, offline/online, and full/incremental backup. The goal is to complete the backup with the smallest storage and computing costs possible. The Restore function can restore to the latest state or a historical marked time point, ensuring that the database is in a consistent state.
+
+### 4.5 Data Warmup
+
+TuGraph is a disk-based graph database, and data is loaded into memory only when it is accessed. Therefore, system performance may deteriorate due to frequent IO operations in the first period after the server is opened. We can improve this problem by preheating the data in advance.
+
+### 4.6 High Availability Mode
+
+High availability means that by configuring a cluster, real-time multi-replica data hot backup can be achieved, and the cluster can still provide services when some replicas are not in use. TuGraph uses the multi-machine hot backup mechanism of the RAFT protocol, which can reduce RPO to near 0. Data synchronization is performed at the computation layer through RPC interfaces for write operations. The high availability cluster of TuGraph adopts a master-slave mode, where only the master node processes write requests, and both master and slave nodes can process read requests. The write request processing of the master node needs to be synchronized to more than half of the total nodes. The write request is considered complete when the majority of the nodes have written successfully.
+
+## 5.Client Tools
+
+Client Tools Client tools mainly include SDKs for various programming languages, OGM, and command-line tools.
+
+The client SDK is mainly used for secondary development and can be linked to the server through RPC or REST protocols. RPC has better performance based on long links, and data needs to be uniformly serialized through protobuf. TuGraph uses brpc, which supports rpc clients in Java, Python, and C++. REST's protocol is more flexible and can be easily adapted to more diverse environments, and different programming languages can easily connect. TuGraph provides a Python REST client instance, and command-line interaction is also implemented using REST.
+
+OGM (Object Graph Mapping) is a graph object mapping tool for TuGraph, which supports mapping JAVA objects (POJO) to TuGraph. Classes in JAVA are mapped to nodes in the graph, collections in classes are mapped to edges, and properties of classes are mapped to properties of graph objects. It also provides corresponding function to operate the graph database. Therefore, JAVA developers can easily use TuGraph database in a familiar ecosystem.
+
+The command-line tool `lgraph_cypher` is a query client that can be used to submit OpenCypher requests to the TuGraph server. `lgraph_cypher` client has two execution modes: single-command mode and interactive mode.
+
+
+## 6.Ecological Tools
+
+Ecological tools are a crucial component of enterprise-level databases, and a rich array of ecological tools can greatly enhance the usability and stability of graph databases.
+
+### 6.1.TuGraph DataX
+
+![Import&Export](../../../images/tugraph-datax.png)
+
+TuGraph's core supports importing and exporting CSV and JSON data, offering both full database and incremental importing modes. In practice, there may be a need to import from multiple data sources such as MySQL, Kafka, and Hive, and TuGraph connects to these sources using DataX. Due to the differences between relational and graph models, data cleaning processes can be quickly processed using SparkSQL. TuGraph focuses only on the reliability and performance of simple CSV and JSON scenario imports.
+
+### 6.2.Visual Interaction
+
+TuGraph Browser is a visual interface for direct users of graph databases, covering most of TuGraph's capabilities, including data import, graph model building, data addition/deletion/query/modify, and monitoring and maintenance operations.
+
+### 6.3.Monitoring
+
+TuGraph uses the Prometheus + Grafana monitoring framework in a loosely coupled manner. Prometheus obtains monitoring information from TuGraph's monitoring interface, stores it in a local time-series database, and then displays it interactively on the web using Grafana.
+
+The monitoring states provided by TuGraph include the state of the graph database and the state of the server. The former includes the database-side status such as read/write load and number of vertices/edges, while the latter includes the real-time status of the server's memory, CPU, and hard disk. If some monitoring state exceeds the expected threshold, proactive alerts are necessary, usually requiring integration with other operations and control systems such as group messaging and email alerts.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..9d5a7ac434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# Scenarios
+
+> This document mainly introduces the application scenarios of graph databases.
+
+## 1.Financial Industry
+
+The entities in the financial industry mainly involve people, companies, accounts, products, etc., and their relationships include transaction relationships, logging relationships, equity relationships, employment relationships, etc. These entities form a financial graph data network. By applying graph databases, we can discover a lot of useful information from the financial graph data network, which helps us make more accurate financial decisions.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Loan review|By analyzing the applicant's relationship and transaction history, etc., it is auxiliary to judge the applicant's repayment ability and willingness. It can be applied to retail loan review, small and micro loan review, supply chain finance, etc. This method can complement the traditional audit mechanism based on the applicant's own information, which is particularly useful for small and micro loan audits with low individual information coverage.|
+|Post-loan|By analyzing the borrower's transaction history, it assists in analyzing whether the borrower has default risk. Compared with the traditional method of issuing alerts only when loan funds flow to specific users, this method can assign a risk value to each account and issue warnings when the loan flows to high-risk accounts.|
+|Missing recovery|By analyzing the social and shopping data of missing borrowers, other contact methods can be found. This method can significantly improve the recovery rate of missing borrowers.|
+|Guarantor loop detection|Special guarantee structures such as cyclic, chain, family-style, and cross can be found in the guarantee relationship graph to expose potential risks. Compared with the JOIN method of a relational database, the solution based on graph algorithms is more efficient, can detect any length of guarantee loop, and can achieve more complex limited condition detection.|
+|Credit card fraud detection|A relationship network of addresses, contact information, etc. in credit card application information is constructed, and a community discovery algorithm is run in the application relationship network to detect suspected fraudulent gangs, thereby rejecting suspected fraudulent applications and reducing economic losses.|
+|Anti-money laundering|Suspected money laundering behaviors and links can be found through the transaction network and medium network. Money laundering is a complex process involving multiple parties. By conducting graph analysis in transaction and social networks, we can more accurately detect money laundering behaviors.|
+|Car insurance anti-fraud|For insurance fraud involving repair shops, by analyzing the relationship between the insured person, the case location, and the repair shop, fraudulent claims can be more accurately identified, reducing economic losses.|
+
+## 2.Industrial Industry
+
+A large amount of heterogeneous data will be generated in the production and manufacturing process, and how to effectively organize and manage these data is one of the most important issues in industrial big data. These data include design documents, equipment data, simulation plans and results, experimental results, experience documents, etc. The relationships between these data are complex, and traditional data management systems can only accumulate data, and they are often unable to search for related materials. Using graph models, these different types of data are organized into a network, which makes it easy to browse and search for data.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Supply chain management|Supply chain data mainly concerns the correspondence between products, components, and parts, the correspondence between parts and suppliers, and sensitive components in parts. Compared with the traditional BOM system, the solution using graph databases can more conveniently maintain complex networks of multiple component levels and multiple supplier levels, thereby providing basic support for a through supply chain.|
+|Document management|Using graph databases can organize different types of documents together organically according to different relationships. For example, design documents for components, component-part relationships, component test documents, relevant experience documents, etc. can be organized together so that all relevant information for the component can be obtained easily when needed.|
+|R&D process management|A large amount of simulation, experimentation, and testing needs to be performed in the product development and verification process. Each test process involves many different steps, the connection between the steps, the data versions used in each step, and the algorithm versions all make up a complicated relationship network. Using graph databases can better manage this relationship network, providing a good foundation for data reuse and process improvement in the R&D process.|
+|Equipment information management|Manufacturing requires the management of a large number of devices, which are interrelated (power supply, feeding, spatial relationship) to form a complex network. Traditional databases are difficult to reflect this complex relationship. Using graph databases can easily represent these relationships, thereby better managing equipment information.|
+
+## 3.Smart City
+
+With the development of technology, intelligent management of cities has become a major trend. Intelligent management requires a strong system software to support it, built on a good information management platform. In an intelligent city management system, an intelligent decision-making system needs to make decisions based on a large amount of different information, including various topology information (such as roads, pipelines, etc.), supply and demand information (such as electricity transmission, drinking water supply, sewage discharge, etc.), environmental information (such as temperature, humidity, rainfall, etc.), and so on. To manage these complex and heterogeneous data organically and make decisions based on them, a mature system is needed. Traditional data management systems based on relational data models are not suitable for managing such complex and heterogeneous data. Using a graph model can solve this problem well. If we manage these different data using a graph database, we can achieve many complex intelligent management scenarios.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Smart Traffic|Based on road topology, road capacity, and current traffic flow, intelligent traffic signal scheduling can be performed to improve traffic efficiency.|
+|Smart Drainage|Based on drainage system information and current rainfall, the drainage system can be scheduled to reduce the occurrence of waterlogging.|
+|Pipeline Management|Organizing the production, installation, topology information, and historical status information of pipelines can help us manage the pipelines throughout their lifecycle, including fault diagnosis, life assessment, etc.|
+|Crowd Evacuation|When a large number of people need to be evacuated, multiple transportation modes such as buses, subways, taxis, shared bicycles, etc., need to be considered, as well as the road carrying capacity. Using a graph database to organically integrate this information can help us make better decisions and provide better support for large public events.|
+
+## 4.Social Governance
+
+Social governance involves public safety, legal affairs, public opinion, network security, and more. Social governance is a comprehensive, multi-system linkage problem. It requires the synthesis of a large amount of data and global considerations to make better decisions. In this multidimensional and complex data problem, the graph data model can provide better adaptability and provide a solid foundation for intelligent social governance decision-making platforms.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Criminal Gang|Conspiratorial gangs will inevitably make contact through some means, including face-to-face meetings (appearing in the same place), phone calls, or internet contacts, and they may also have economic exchanges. If we store all of this data in a unified graph, we can use graph analysis algorithms to identify closely connected groups and then discover and identify the entire criminal gang.|
+|Stakeholder Case Investigation|Stakeholder cases, especially stakeholder economic cases, often involve a large number of personnel and elements (money, location, events, etc.). How to effectively organize this information to provide evidence for handling cases is a difficulty in stakeholder case investigation. Using graph databases to store and analyze this information can help us quickly locate the data, analyze the personnel structure, and provide better technical support for case investigation.|
+|Illegal Website Identification|Illegal websites, phishing websites, yellow websites, and so on, often use different domain names and IPs to avoid being blocked. The filter method based on a blacklist can only block known illegal websites and cannot effectively identify new domain names and IPs. Based on the IP-domain name network mapping relationship, we can create a graph and then use graph calculations to establish a "trustworthiness" model for domain names and IPs to determine whether a website belongs to an illegal website.|
+|Court File Management|Case files are often complex, and different cases may be linked through parties, locations, case nature, judges, and so on. These links constitute a complex network. Using a graph database, we can more conveniently manage these complex relationships and improve case handling and query efficiency.|
+
+## 5.Internet
+
+Social networks and person-product purchase relationships can all form a network. By analyzing this network data, we can provide users with better services, including relevant recommendations, user information collection, important user identification, and spam user identification, and so on.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|ID-Mapping|Graph databases can store all user-related information, including the relationships between users, in one database, and can also use these relationships to identify situations where one person has multiple accounts or multiple people share an account, thus providing decision support for future risk control, recommendations, and other businesses.|
+|Friend Recommendation|Based on the analysis of social networks, we can provide friend recommendations such as "friends of friends" and "common friends".|
+|Product Recommendation|Based on the user-product relationship graph, we can find users with similar interests and recommend other products that similar users have chosen.|
+|Spam User Identification|Traditional spam user identification is mainly based on user account information, such as registration information and posting information, but these types of information are relatively easy to forge. On the other hand, network-based information doesn't have this problem: it's difficult to forge. Therefore, spam user identification based on network information can be more accurate and efficient.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..6f2aa1629a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/9.glossary.md
@@ -0,0 +1,27 @@
+# Glossary
+
+## 1.Graph Technology
+
+> __Graph Computing__:Generalized graph computing, including graph databases, graph analysis, and graph learning; Narrowly defined graph computing only includes graph analysis. The generalized definition is used by default.
+
+> __Graph Database__:Focuses on operations such as adding, deleting, modifying, querying, and transaction processing for graph data, such as TuGraph DB.
+
+> __Graph Analysis__:Focuses on algorithmic analysis and pattern analysis of entire graph data, such as TuGraph Analytics.
+
+> __Graph Learning__:Refers to the same meaning as graph neural networks and graph machine learning, such as TuGraph Learn.
+
+> __Graph Intelligence__:Same as generalized graph computing, including graph databases, graph analysis, and graph learning. It is usually used for conceptual promotion and not for products.
+
+## 2.Specific Concepts
+
+> __Vertex__:Also known as node or point. Avoid using the term "node" as it is often used to refer to the number of servers and can be easily confused. "Node" refers to the meaning of combination, intersection, and crossing; "node" can refer to a milestone on a timeline (key node) or a processing entity in a computer system (such as a server in a computer network).
+
+> __Edge__:Refers to the connection between two vertices.
+
+> __Degree__:Refers to the number of incoming or outgoing edges on a vertex. Note that in non-graph theory scenarios, "hops" are often referred to as "degrees".
+
+> __Hop__:Refers to the number of vertices between two vertices on a path (excluding the starting point and including the endpoint). "K-Hop" in the algorithm performance test refers to this meaning.
+
+> __Vertex Label__:Refers to the type of a vertex, also known as a point label.
+
+> __Edge Label__:Refers to the type of an edge, also known as an edge label.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/index.rst
new file mode 100644
index 0000000000..076b7d0434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph DB Introduction
+=================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..390a685659
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/1.preparation.md
@@ -0,0 +1,90 @@
+# Quick Start
+
+> This document is intended for new users to get started quickly and contains an introduction, features, installation, and use of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property Graph Model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+### 1.1.Supported Platforms
+
+TuGraph supports both X86_64 and ARM64 architectures in physical, virtual, and containerized environments.
+
+### 1.2.Hardware requirements
+
+_You are advised to use NVMe SSDS with large memory configurations for optimal performance。_
+
+| Hardware | Minimum Configuration | Recommended configuration |
+|----------|-----------------------|---------------------------|
+| CPU      | X86_64                | Xeon E5 2670 v4           |
+| Memory   | 4GB                   | 256GB                     |
+| Disk     | 100GB                 | 1TB NVMe SSD              |
+| System   | Linux 2.6             | Ubuntu 18.04, CentOS 7.3  |
+
+## 2.Installation
+
+TuGraph can be installed quickly via Docker Image or locally via RPM /deb packages.In addition, TuGraph offers community edition services on Alibaba Cloud Computing Nest, which means you don't need to purchase your own cloud host to quickly deploy TuGraph services and achieve operational monitoring, thus building your own graph application.
+
+> Installation package/image download: refer to the TuGraph-Latest-Version section in [Download address](../1.guide.md).
+
+> Computing Nest Deployment: You can search for it on Alibaba Cloud Computing Nest, or you can quickly access it through [deployment link] (../5.developer-manual/1.installation/5.cloud-deployment.md).
+
+### 2.1.Fast experience through Docker
+
+1. The Docker environment installed locally
+
+   The docker official documentation：https://docs.docker.com/get-started/
+
+2. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. Start docker
+
+   ```shell
+    docker run -it -d -p 7001:7001 -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 8888:8888 -p 8889:8889 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000 is default http port，for tugraph-db-browser accessing.
+   # 7070 is default http port，for legacy tugraph-web accessing.
+   # 7687 is bolt port, for neo4j client accessing.
+   # 9090 is default RPC port，for RPC client accessing.
+   
+   # The default data directory is /var/lib/lgraph/data and the default log directory is /var/log/lgraph_log,
+   # which is configured in the tugraph configuration file at /usr/local/etc/lgraph.json inside the docker.
+   # This command mounts the data directory and log directory to /root/tugraph/ on the host for persistence,
+   # which you can modify according to your actual situation.
+   ```
+
+4. Open by browser
+
+Accessing tugraph-db-browser: `http://x.x.x.x:8000`. Default account is `admin` and default password is `73@TuGraph`.
+The page will be redirected to the password modification page for the first login. Please modify the password according to the page prompt.
+
+**Note**: 
+Access `http://x.x.x.x:7070` if you want to access legacy tugraph-web, with default account `admin` and default password `73@TuGraph`.
+But please note that legacy web is no longer maintained, it is recommended to use tugraph-db-browser.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..2ec92747d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# DEMO:Movie
+
+> This document mainly introduces the usage of the movie demo.
+
+## 1.Modeling and Data Import
+
+After logging in, click "Help", click "Quick Start", click "One-Click Model Creation", click "One-Click Data Creation", and complete the creation of the Movie Scene Graph.
+
+Movie：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| Label       | Type   | Description                                                                                           |
+|-------------|--------|-------------------------------------------------------------------------------------------------------|
+| movie       | Vertex | Represents a specific movie, such as "Forrest Gump".                                                  |
+| person      | Vertex | Represents a person, who may be an actor, director, or screenwriter for a movie.                      |
+| genre       | Vertex | Represents the genre of a movie, such as drama, horror.                                               |
+| keyword     | Vertex | Represents some keywords related to the movie, such as "save the world", "virtual reality", "subway". |
+| user        | Vertex | Represents a user who watches movies.                                                                 |
+| produce     | Edge   | Represents the relationship between the producer of a movie.                                          |
+| acted_in    | Edge   | Represents the relationship between actors and the movies they have appeared in.                      |
+| direct      | Edge   | Represents the relationship between a movie and its director.                                         |
+| write       | Edge   | Represents the screenwriting relationship of a movie.                                                 |
+| has_genre   | Edge   | Represents the genre classification of a movie.                                                       |
+| has_keyword | Edge   | Represents some keywords of a movie, which are more specific labels for classification.               |
+| rate        | Edge   | Represents the rating given by a user to a movie.                                                     |
+
+## 2.Query Examples
+
+### 2.1.Example One
+
+Query all actors of the movie 'Forrest Gump' and return the subgraph composed of the movie and the actors.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.Example Two
+
+Query all actors of the movie 'Forrest Gump' and list the roles they played in the movie.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.Example Three
+
+Query all movies rated below 3 by Michael.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.Example Four
+
+Query users who have the same dislike of movies as Michael, where the standard for dislike is a rating of less than three.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.Example Five
+
+Recommend movies to Michael by first finding users who dislike the same movies as Michael, and then filtering out the movies that these users like.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.Example Six
+
+Query the movies that Michael's friends like.
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.Example Seven
+
+By querying the movies that people who gave 'Forrest Gump' a high rating also like, recommend similar movies to users who like 'Forrest Gump'.
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..e07192fa2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,48 @@
+# DEMO:Wandering Earth
+
+> This document mainly introduces the usage of the Wandering Earth demo.
+
+## 1.Demo Scene Design
+
+The demo is based on the story background of The Wandering Earth 1 and The Wandering Earth 2.
+
+- Based on the plot, a graph structure is designed, including three types of points: organization, character, celestial body, and facility, and two types of edges: event and relationship.
+- Prepared data corresponding to the schema based on the plot.
+- Prepared some queries to ask questions about the plot.
+
+## 2.Directory structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to queries.
+- control.sh: Script to control the start and stop of TuGraph Server.
+lgraph_standalone.json: Configuration file for starting TuGraph Server.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 4.Data Import
+
+- Modify DATA_PATH in import.json according to the data storage directory.
+- Refer to the load function in control.sh to load data.
+- Refer to the start function in control.sh to start TuGraph Server.
+- After starting TuGraph Server, access ${HOST_IP}:8888 to open the web page and confirm whether the data is successfully imported.
+
+## 5.Cypher Query
+
+Refer to the Cypher document and enter Cypher in the TuGraph web page frontend for queries.
+
+## 6.Usage Display
+
+### 6.1.Data Import Display
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.Query Display
+Query all event processes related to the crisis on Jupiter.
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+Query all event processes related to all crises.
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..64ea337fa8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# The Three Body
+
+> This document mainly introduces the usage of Three-Body demo.
+
+## 1.Demo Scenario Design
+The demo scenario is designed based on the story background of Three-Body 1, 2, and 3.
+
+According to the setting of the Three-Body story, we have designed 4 types of nodes and 6 types of edges. The nodes include "character", "organization", "plan", and "timeline", while the edges include "character-character relationship", "character-plan relationship", "character-organization relationship", "organization-plan relationship", and "organization-organization relationship". According to the plot, corresponding schema data and some queries have been prepared to propose some questions about the plot.
+
+## 2.Directory Structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to the query.
+- control.sh: Script to start and stop TuGraph Server.
+- lgraph_standalone.json: Configuration file for TuGraph Server startup.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+### 4.Data Import
+
+- Manual import
+    - Modify DATA_PATH in import.json according to the data storage directory.
+    - Refer to the load function in control.sh to load the data.
+    - Refer to the start function in control.sh to start the TuGraph service.
+    - After starting the TuGraph service, access ${HOST_IP}:8888 to open the web page and confirm whether the data is imported successfully.
+- Automatic creation
+    - Click `New Graph Project`, select Three-Body data, fill in the graph project configuration, and the system will automatically create the Three-Body scenario graph project.
+    - Alternatively, use the pre-installed Three-Body graph project provided by the product.
+
+### 5.Cypher Query
+
+Refer to the TuGraph documentation and enter Cypher in the TuGraph web page frontend to execute a query.
+
+## 6.Usage Demo
+
+### 6.1.Data Import Demo
+
+![data](../../../../images/three-body-data.png)
+
+### 7.Query Demo
+
+#### 7.1.Character Relationship Query
+In the plot of Three-Body 1, a large number of scientists committed suicide all over the world at the beginning, which aroused the attention of the police. During the investigation process, the truth behind it gradually surfaced step by step according to the clues of the character relationships, as shown in the above graph. Shi Qiang and Wang Miao discovered that most people had direct or indirect connections with Ye Wenjie, and sent Wang Miao undercover to finally discover Ye Wenjie's ultimate commander identity. As can be seen in the graph, there are many edge relationships (many one-degree or two-degree neighbors) around Ye Wenjie's vertex.
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.Neighbor Vertex Analysis
+There are many plans in Three-Body, and sometimes we may be confused. At this time, we can use the graph's neighbor vertex query to view the relevant characters and organizations of the plan. For example, in the "Wallfacer Project", we can see that there are four characters related to it, and these four are also the "Wallfacers" who are highly expected by the world.
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.Query Common Neighbors of Node A and B
+We often want to know who are the common related characters between two characters, so that we can quickly grasp the relationship between these two characters. In the case of large amounts of data, it is very convenient to use Cypher for graph relationship analysis!
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.Set/Change Properties
+As the plot progresses, we gradually learn about the various labels on "Ye Wenjie", so we can also update these labels to the "Ye Wenjie" node:
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.Add/Delete Nodes
+Later, we learned about characters such as Luo Ji and Cheng Xin, and organizations such as PIA and the Star Ring Group, and wanted to add them as nodes to the graph:
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..0bb359cbe0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# Three Kingdoms
+
+> This document mainly introduces the usage of the Three Kingdoms demo.
+
+## 1. Introduction
+Due to the lack of historical records, there are often many mysteries surrounding even well-known historical events. Taking the history of the Three Kingdoms as an example, why did Zhuge Liang come out of seclusion to help Liu Bei, and why there was a huge gap in achievements between Cao Cao and Liu Bei, both heroes of the time, are some of the unsolved mysteries. Historians in the past often used two-dimensional relationship analysis of history, and the conclusions drawn were often one-sided. Using TuGraph to import historical figures and events of the Three Kingdoms into a graph model, and analyzing them using graph calculation methods can help us obtain more valuable knowledge from limited information, which is a very meaningful interdisciplinary attempt.
+## 2. Data Modeling
+We designed 5 types of vertices and 5 types of edges. The vertices include "Lord", "Province", "Civilian", "Military Officer", and "Battle"; the edges include "Father", "Brother", "Belongs To", "Native Place", and "Participate In". The specific modeling information is shown below:
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. Data Import
+- Manual import
+    - To import data into TuGraph, you can use the lgraph_import tool to import it offline. The import command of lgraph_import is as follows:
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- Automatic creation
+    - Click `New Graph Project`, select the Three Kingdoms data, fill in the graph project configuration, and the system will automatically create the Three Kingdoms scene graph project.
+    - Or use the built-in Three Kingdoms graph project provided by the product directly.
+## 4. Cypher Query
+### 4.1. Why did Zhuge Liang Choose Liu Bei?
+The following Cypher command can be used to view the relationship between Zhuge Liang, Cao Cao, and Liu Bei:
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+From the graph, we can intuitively see that one of the shortest paths between Cao Cao and Zhuge Liang includes the battle of Xuzhou. Cao Cao once committed a massacre in Xuzhou because his father was killed, and nobody would choose a warlord who had previously massacred their hometown as their lord. In contrast, Liu Bei once prevented Cao Cao's violence during the battle of Xuzhou, which should be one of the reasons why Zhuge Liang had a good impression of Liu Bei.
+
+### 4.2. Why Did Cao Cao Achieve More Than Liu Bei?
+The following Cypher command can be used to view the family's support for Cao Cao's career:
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+The most important thing for pacifying the world is military talent. Cao Cao's father originally had the surname Xiahou, but was adopted into the Cao family. The Cao and Xiahou families were both local big clans in Qiao County, providing Cao Cao with a large number of military talents such as Xiahou Dun, Xiahou Yuan, Cao Ren, and Cao Hong in the early days of his career. In contrast, Liu Bei's father died early and he didn't have any family support. He only gathered his Five Tiger Generals when he was over 50 years old, by which time the best time to fight for land in the chaotic world had passed. Cao Cao had already controlled six of the nine provinces in the world.
+
+### 4.3. Why Did the Most Powerful Wei Kingdom in the Three Kingdoms Perish First?
+The following Cypher command can be used to view the important civilian officials of the Cao Cao group:
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+In fact, Cao Wei was overthrown in the Gao Ping Ling incident in 249 AD, after only 29 years of existence, which was shorter than Shu Han (43 years) and Dong Wu (51 years). The reason why the most powerful Wei Kingdom in the Three Kingdoms perished first was that the civilian official system of Cao Wei (the nine-rank system) made it easy for power to be concentrated in the hands of aristocratic families. From the graph, we can see that almost all the important civilian officials of Cao Cao and Cao Pi's generations were from aristocratic families, such as Xun Clan of Yingchuan, Zhong Clan of Yingchuan, Chen Clan of Yingchuan, Jia Clan of Wuxi, etc. There was even a trend of regionalization, centered on Yingchuan. Ultimately, the regime was usurped by the Sima family of Henei, which had close ties with the Xun Clan of Yingchuan.
+
+### 4.4. What Were the Strengths of Each of the Three Kingdoms?
+The following Cypher command can be used to view the population strength of each group in the Three Kingdoms:
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+The query result is shown in the following table:
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+In ancient society, an important indicator of a country's strength was its population. Since population data is missing, we estimate the population of each province using the birthplace data of all lords, civilians, and military officers in the Three Kingdoms. It is found that among the main characters of the Three Kingdoms, 60 belong to Wei, 23 belong to Wu, and only 2 belong to Shu, which proves that Wei was indeed the most powerful country in the Three Kingdoms.
+
+### 4.5. How Should Cao Cao's Military Ability Be Evaluated?
+The following Cypher command can be used to view the main battles that Cao Cao participated in:
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+From the graph, we can see that Cao Cao participated in 8 out of the 15 major battles in the Three Kingdoms, with a high participation rate. However, Cao Cao only won the battles of Xuzhou, Yanzhou, Guandu, and Xiangyang, while losing the battles of Hanzhong, Wancheng, the Campaign against Dong Zhuo and the Battle of Red Cliffs. His overall win rate was 50%, which proves that Cao Cao was not a very outstanding military strategist.
+
+## 5. Remarks
+More analysis is needed and encouraged to be added by everyone!
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..b2e7d4b257
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Demo:Round The World
+
+> This document mainly introduces the usage of the round-the-world demo.
+
+## Brief
+
+Based on the virtual background of "Around the World in 80 Days" and partial public historical flight data, it helps users design optimal flight plans for multiple cities.
+- Demo designed custom website service
+- The data source is a foreign open source website and does not include mainland city flight data
+- The flight prices in the data are simulated data and do not represent real prices.
+
+## Example
+
+### Login Page
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### Query Page
+
+Click on the login page to enter the query page.
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### Query Example
+
+Select no more than 8 cities from the city list in the lower left corner, click Query to return the recommended flight plan, and return the 10 path plans with the lowest cost and shortest flight time, provided that the interval between previous and later flights is 2-6 hours.
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+For detailed instructions, see the [manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "") document.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..106f943e05
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo example
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..b2ed78a618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+TuGraph DB Quick Start
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..6900158788
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,685 @@
+# TuGraph Browser
+
+> This document focuses on the use of TuGraph Browser.
+
+## 1.Introduction
+
+TuGraph Browser (hereinafter referred to as Browser) is a powerful product visualization development tool that presents graph data in an intuitive visual way, allowing users to easily manage, maintain, and view the database running status. This tool not only supports graph data management and visualization but also supports system account management, providing users with a comprehensive operation and management experience, enabling users to manage and utilize graph databases more efficiently.
+
+## 2.User Guide
+
+### 2.1.Accessing
+
+After the user completes the installation of the graph database, they can access the Browser through a browser. Users only need to enter the IP:Port of the server where TuGraph is located in the browser address bar. The default port used is 8000.
+
+- For example:127.0.0.1:8000
+- Recommend using Chrome
+
+#### 2.1.1. Startup configuration
+
+Before starting Browser, you need to start TuGraph-Server in advance and configure the connection between Browser and TuGraph-Server. The configuration file is the env.json file in the Browser directory. The specific configuration is as follows
+```shell
+# vim /usr/local/share/lgraph/tugraph-db-browser/env.json
+{
+   "tugraph_db_host": "http://127.0.0.1:9090"
+}
+```
+Tugraph_db_host needs to be modified to the address of the actual TuGraph-Server RPC service
+
+#### 2.1.2.Startup method
+There are two ways to start Browser. One is to directly switch to the directory where Browser is located in the docker image and execute the startup command.
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run dev
+```
+The other is to use the rpm/deb installation package in the local environment. In this case, it needs to be built first and then started. Therefore, the Node environment needs to be installed locally in advance. For details, see the source code directory.
+ci/images/tugraph-runtime-*-Dockerfile. When installing TuGraph locally,
+Browser will be installed to the specified local directory, switch to the directory, and execute the following command to build and start
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run bootstrap
+pnpm run dev
+```
+
+### 2.2.Logging in
+
+![login](../../../images/browser/login.png)
+
+- After successfully accessing the Browser, the login page appears first (as shown above), where users need to fill in their account and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- After the user's first login, they will be redirected to the password modification page. Once the password is successfully modified, they can only use the new password to log in.
+
+### 2.3.Quick Start
+
+For first-time users of TuGraph, you can quickly build a graph project with the built-in demo data and get started with graph data projects quickly.
+
+#### 2.3.1.Creating a Graph Project
+
+In the `Graph Project` homepage tab, click `Create New Graph Project` to create a new graph project.
+
+![quickstart-creategraph](../../../images/browser/quickstart-creategraph.png)
+
+Select a built-in demo data, and click the `Next` button.
+
+![quickstart-selectdemo](../../../images/browser/quickstart-selectdemo.png)
+
+In the Fill in Configurations interface, enter the graph project information. Since the demo data is relatively small in size, set the Maximum Storage Space to 1 GB. After entering the graph project information, click the Create button, and the system will automatically create the graph model of the demo data and import the graph data.
+
+![quickstart-configure](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.Starting a Graph Project
+
+After creating a graph project with demo data, you can find the corresponding graph project in the `Graph Project` tab, and then click `Graph Query` to query graph data.
+
+![quickstart-graphtab](../../../images/browser/quickstart-graphtab.png)
+
+Execute the default query statement to browse the graph data in the demo.
+
+![quickstart-result](../../../images/browser/quickstart-result.png)
+
+For more quick start documents, please visit the[Quick Start Documents](../3.quick-start/1.preparation.md)
+
+### 2.4.Graph Project
+
+`Graph Project` provides visualized graph project management and graph data development functions, providing users with a series of convenient graph data visualization operations, including graph project creation, modification, deletion, and other management operations, as well as graph data queries, vertex-edge statistics, and other operations. In addition, it also supports graph model management, making it more convenient for users to manage and maintain graph data.
+
+#### 2.4.1.Graph Project Management
+
+On the `Graph Project` page, you can see the graph projects in the current graph database.
+
+![graphmanagement-homepage](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.Creating a Graph Project
+
+On the `Graph Project` page, click the `Create New Graph Project` button to create a new graph project.
+
+![graphmanagement-creategraph](../../../images/browser/graphmanagement-creategraph.png)
+
+Creating a new graph project requires completing the creation of the graph project through two pages: `Select Template` and `Fill in Configurations`.
+
+- __Select Template__: The product provides two types of templates: empty templates and demo templates.
+    - Empty templates: A brand new graph project where users need to create their own graph model and import graph data, generally used for formal project development.
+    - Demo templates: Built-in demo data in the product. After the graph project is created successfully, the system will automatically create a demo graph model and import demo graph data, usually used for trial and learning.
+
+![graphmanagement-selecttemplate](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __Fill in Configurations__: Users need to fill in basic information about the graph project and click the `Create` button to create the graph project.
+    - Graph Name: The name of the new graph project, which is also the unique primary key of the graph project. Supports Chinese characters, letters, numbers, and underscores, but does not support spaces or other special characters.
+    - Graph Description: The description of the new graph project can be used to describe the background and objectives of the project in detail.
+    - Advanced Configuration - Maximum Storage Space: Set the maximum storage space that the graph project can occupy. It does not actually occupy physical storage space in advance. After the actual data volume reaches the maximum storage space threshold, no more data can be written.
+
+![graphmanagement-configure](../../../images/browser/graphmanagement-configure.png)
+
+After creation, the graph project can be viewed in the graph project tab on the `Graph Project` page.
+
+##### 2.4.1.2.Editing a Graph Project
+
+On the `Graph Project` page, click the `Edit button` (pencil icon) in the graph project tab to edit the basic information of the corresponding graph project.
+
+![graphmanagement-editgraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+graphmanagement-editgraph-button
+
+![graphmanagement-editgraph](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.Deleting a Graph Project
+
+On the `Graph Project` page, click the `Delete` button (trash can icon) in the graph project tab to delete the corresponding graph project.
+
+![graphmanagement-deletegraph-button](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_Note: Graph projects cannot be restored after deletion._
+
+##### 2.4.1.4.Vertex-Edge Statistics
+
+On the `Graph Project` page, click the `Vertex-Edge Statistics` button (line graph icon or refresh icon) in the graph project tab to count the number of vertexs and edges in the corresponding graph project.
+
+![graphmanagement-statistics-button](../../../images/browser/graphmanagement-statistics-button.png)
+
+The statistical results will be displayed on the graph project tab. Graph projects that have not been vertex-edge statistics will display `No vertex-edge data`, and graph projects that have already been vertex-edge statistics need to click the `Refresh` button to count again.
+
+![graphmanagement-statistics](../../../images/browser/graphmanagement-statistics.png)
+
+![graphmanagement-statistics-refresh-button](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.Graph Building
+
+The `Graph Building` function in Browser is mainly used for graph project model definition and data import. On the `Graph Project` page, click the `Graph Building` button in the graph project tab.
+
+![graphbuild-button](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.Model Definition
+
+Browser provides a visualization way to create and maintain graph models.
+
+- Graph models can also be created and maintained through the `Cypher` tool and the `lgraph_import` tool. For details, please refer to the [Cypher API Document](../8.query/1.cypher.md) and [Data Import Document](../6.utility-tools/1.data-import.md).
+
+###### a.Browse Graph Models
+
+On the `Model Definition` page, you can view detailed graph model settings, support list and canvas view of the graph model, support list display of vertex type properties and indexes, edge type properties and start/end vertex types.
+
+![graphbuild](../../../images/browser/graphbuild.png)
+
+- Supports list view of vertex types and edge types.
+    - Supports the display of the number of vertexs or edges in the corresponding vertex type or edge type in the vertex type or edge type tab.
+    - Supports keyword search for vertex type or edge type names. Enter the keyword in the `search box` to display the corresponding vertexs or edges.
+
+        ![graphbuild-list-search](../../../images/browser/graphbuild-list-search.png)
+    - Supports copying vertex type or edge type names. Click the `Copy` button to copy the name of the vertex or edge to the clipboard.
+
+        ![graphbuild-list-copy](../../../images/browser/graphbuild-list-copy.png)
+    - Supports deleting vertex types or edge types. Click the `Delete` button to delete the corresponding vertex or edge.
+
+        ![graphbuild-list-delete](../../../images/browser/graphbuild-list-delete.png)
+- Supports canvas view of vertex types and edge types.
+- Clicking the corresponding vertex type or edge type in the list or canvas can display the model details.
+        ![graphbuild-select](../../../images/browser/graphbuild-select.png)
+
+###### b.Add Vertex
+
+Click the `Add Vertex` button on the `Model Definition` page to add a vertex type in the right sliding window.
+
+![graphbuild-addvertex-button](../../../images/browser/graphbuild-addvertex-button.png)
+
+The user needs to enter the Vertex type name, properties, and indexes, and click the `Complete` button to complete the creation of the Vertex type.
+- Vertex Type Name: The name of the Vertex, which is also the unique identifier of the Vertex.
+- Properties: The attributes of the Vertex, and one attribute needs to be used as the primary key.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating Vertexs.
+- Indexes: The indexing attributes of the Vertex, you need to create attributes first and then set the attribute as an index.
+    - Attribute: The attribute that needs to be indexed.
+    - Unique:Set the attribute field as a unique value.
+    - Primary Key: Whether the corresponding attribute is a primary key. The Unique option must be `Yes` after selecting `Yes`.
+    - Delete: Indexes can be deleted arbitrarily during Vertex creation.
+
+![graphbuild-addvertex](../../../images/browser/graphbuild-addvertex.png)
+
+- Edit Vertex: You can add Vertex properties, modify the data type of existing properties, and add or delete indexes. You need to click the `Save` button for each newly added or modified attribute to take effect.
+_Note: Once the primary key field attribute is created, it cannot be modified._
+
+![graphbuild-editvertex](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.Add Edges
+
+Click the `Add Edge` button on the `Model Definition` page to add an edge type in the right sliding window.
+
+![graphbuild-addedge-button](../../../images/browser/graphbuild-addedge-button.png)
+
+The user needs to enter the edge type name, properties, select the start vertex type and end vertex type, and click the `Complete` button to complete the creation of the edge type.
+- Edge Type Name: The name of the edge, which is also the unique identifier of the edge.
+- Properties: The attributes of the edge, which may not exist on the edge.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating edges.
+- Selecting start vertex type and end vertex type: Set the start vertex type and end vertex type of the edge, and support multiple start vertex types and end vertex types.
+    - Start vertex: Select the vertex type of the start vertex.
+    - End vertex: Select the vertex type of the end vertex.
+    - At least one vertex type needs to be created in advance to set the start vertex type and end vertex of the edge.
+    - If not selected, it means that the start vertex and end vertex can be any vertex type, and the corresponding edge is not displayed on the canvas, and you need to view the edge type in the left list.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+- Edit Edge: You can add edge properties and modify the data type of existing properties. You need to click the `Save` button for each newly added or modified attribute to take effect.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+###### d.Import Model
+
+Click the `Import Model` button on the `Model Definition` page to upload a model file and quickly create a model.
+
+![graphbuild-importmodel-button](../../../images/browser/graphbuild-importmodel-button.png)
+
+Click the `Upload File` button on the `Import Model` page to upload the model file. After the upload is successful, click `OK` to import the graph model.
+
+- Overwrite the current canvas model: If this option is selected, the existing graph model will be cleared before importing the graph model in the model file; if not selected, the vertex types and edge types in the model file will be imported, but the existing vertex types and edge types will not be modified.
+
+![graphbuild-importmodel](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.Export Model
+
+Click the `Export Model` button on the `Model Definition` page to export the graph model in the current graph project to a JSON file.
+
+![graphbuild-exportmodel-button](../../../images/browser/graphbuild-exportmodel-button.png)
+
+The model file is in JSON format and is not recommended to be manually modified.
+
+![graphbuild-exportmodel](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.Data Import
+
+After completing the `Model Definition`, click the `Next` button to enter the data import page.
+
+###### a.Data Preparation
+
+Data needs to be prepared in advance before importing data. The current browser supports the uploading of CSV files, and the data file suffix needs to be ensured to be CSV.
+- The header is not mandatory.
+- Text qualifiers are supported, and the text qualifier is double quotes. Data Import - CSV
+
+![graphbuild-import-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.Upload Files
+
+Upload the required data files on the `Data Import` page and import the data into the graph project.
+
+![graphbuild-import](../../../images/browser/graphbuild-import.png)
+
+- Separator: The column separator of the data file.
+- File upload: Supports uploading multiple files.
+    - Supports selecting multiple upload files in the pop-up window.
+    - Supports dragging and dropping files to upload on the page.
+    - Supports uploading vertex files and edge files at the same time.
+
+###### c.Data Mapping
+
+After the file is successfully uploaded, you need to set the `Data Corresponding Table` on the `Data Import` page to establish a mapping relationship between the data columns in the data file and the target vertexs/edges and corresponding attributes.
+
+- Data Corresponding Table: Displays uploaded data problems.
+    - File Name: The name of the uploaded data file.
+    - File Size: The size of the uploaded data file.
+    - Read Result: The result of uploading the data file, success means uploaded successfully.
+    - Delete: Delete on the page, the local file will not be deleted.
+- Data File Mapping: Each uploaded data file needs to configure a mapping relationship.
+    - Label: Select the corresponding vertex or edge type for the file, and you can only select one type of vertex or one type of edge.
+    - Starting from the Nth row: Start reading data from the Nth row. The system defaults to start reading data from the 0th row. To skip the header, you can enter 1.
+    - Attribute Mapping: Select the attribute field corresponding to the data column from the drop-down list.
+    - Data Preview: The system will pre-read the first 5 rows of the data file.
+
+![graphbuild-import-datamapping](../../../images/browser/graphbuild-import-datamapping.png)
+
+After the file is successfully uploaded, you can click the `Continue Import` button to continue importing other data or click the `Go to Graph Query` button to query the imported data on the `Graph Query` page.
+
+![graphbuild-import-success](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.Graph Query
+
+Click the `Graph Query` button in the `graph project tab` on the `Graph Project` page to query and access graph data in the graph project. The product provides multiple modes for querying graph data, such as Statement Query, Path Query, and Vertex Query, and supports switching between graph projects and query result display.
+
+![query-button](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.Switch Graph Project
+
+The `Graph Query` function can only access one graph project data. Users can select and switch to other graph data in the `Switch Graph Project drop-down list`.
+
+![query-selectgraph](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.Statement Query
+
+The Browser provides a visual way to develop and debug graph query statements. Users can enter graph query statements, execute and return results, and support collecting statements and viewing graph models.
+
+![query-view](../../../images/browser/query-view.png)
+
+###### a.Statement Query Window
+
+Users enter graph query statements in the `Statement Query Window`, click the `Execute` button to run the corresponding statement, and display the result in the `Execution Result tab`.
+
+- Switch Query Language: Provides switching between different graph query language modes.
+    - _Currently only supports Cypher syntax._
+
+![query-selectgql](../../../images/browser/query-selectgql.png)
+
+- Statement Query Window: Provides syntax prompts for the current query language.
+
+![query-gqltips](../../../images/browser/query-gqltips.png)
+
+- Execute: Click the `Execute` button to send the entered query statement to the background for execution.
+
+![query-execute-button](../../../images/browser/query-execute-button.png)
+
+- Bookmark: Click the `Bookmark` button to save the content of the current statement query window as a template for future use.
+
+![query-bookmark-button](../../../images/browser/query-bookmark-button.png)
+
+- Download: Click the `Download` button to save the content of the current statement query window as a text file and download it to the local computer for future use.
+
+![query-download-button](../../../images/browser/query-download-button.png)
+
+For detailed Cypher usage guidelines, please refer to the document: [Cypher API](../8.query/1.cypher.md)
+
+###### b.Bookmark List
+
+Displays the collected query statements in a list, and clicking on a bookmark in the list allows using the statement. Supports keyword search, name modification, and deletion.
+
+![query-bookmark](../../../images/browser/query-bookmark.png)
+
+###### c.View Graph Model
+
+The Browser provides a graph model query for the current graph project, which allows users to query vertex types and edge types conveniently. It supports both list display and canvas graph display, and can be hidden.
+
+![query-schema-list](../../../images/browser/query-schema-list.png)
+![query-schema-graph](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.Path Query
+
+The Browser provides `Path Query templates`. Users can search whether corresponding paths exist in the graph data of the graph project by selecting paths.
+
+![pathquery-result](../../../images/browser/pathquery-result.png)
+
+- Path: Select the path to search in the path selection drop-down list.
+    - Select a Path: Based on the definition of the graph model, the system will automatically match the corresponding first-degree relationship path. Clicking the path drop-down box again will automatically match the next-degree relationship path based on the endvertex vertex type of the path.
+![pathquery-select](../../../images/browser/pathquery-select.png)
+    - Execute: Click the `Execute` button to return the matched paths in the graph project.
+    - Advanced Configuration: Set the number of paths to scan. The default is 100 paths.
+![pathquery-configuration](../../../images/browser/pathquery-configuration.png)
+
+_Note: The edges in the graph model need to set the starting vertex and endvertex. If no edge in the graph project has set the starting vertex and endvertex, the drop-down list will have no results._
+
+##### 2.4.3.4.Vertex Query
+
+The Browser provides `Vertex Query templates`. Users can query vertex data in the graph project by selecting vertex attributes.
+
+![vertexquery](../../../images/browser/vertexquery.png)
+
+- Select Vertex: Select the vertex type to be queried.
+    - Attribute: The system will automatically match the schema of the vertex type, set the corresponding query conditions, and click the execute button to return the results.
+- Return vertex Limit: Set the upper limit of the returned vertex data.
+
+![vertexquery-criteria](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.Execution Result Tab
+
+The Browser provides multiple ways to display graph query results, such as JSON view, JSON text, vertex-edge list, and vertex-edge view. It supports result download, data insertion, and full-screen display.
+
+###### a.JSON View
+
+The Browser provides JSON view to display query results.
+
+![query-result-jsonview](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON Text
+
+![query-result-jsontxt](../../../images/browser/query-result-jsontxt.png)
+
+###### c.Vertex-Edge List
+
+The Browser provides vertex and edge list to display query results.
+
+![query-result-list](../../../images/browser/query-result-list.png)
+
+###### d.Vertex-Edge View
+
+The Browser provides canvas view to display query results.
+
+![query-result-graph](../../../images/browser/query-result-graph.png)
+
+###### e.Data Insertion
+
+The Browser provides a visual way to insert vertex or edge data in the corresponding graph project. Click the `Insert Data` button, select the Vertex Type or Edge Type on the Insert Data tab, enter the attribute values, and click `OK` to complete the data insertion.
+
+![query-result-insert-button](../../../images/browser/query-result-insert-button.png)
+
+![query-result-insert](../../../images/browser/query-result-insert.png)
+
+###### f.Download Execution Result
+
+The Browser provides a function to export graph query results as text files. Click the `Download Execution Result` button, and the system will automatically save the result as a text file and download it to the local computer.
+
+![query-result-download](../../../images/browser/query-result-download.png)
+![query-result-downloadtxt](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.Full-Screen Display
+
+The Browser provides full-screen display for graph query results. Click the `Full-Screen` Display button to display the results in full screen, and click the `Exit Full Screen` button to exit full-screen display.
+
+![query-result-fullscreen-button](../../../images/browser/query-result-fullscreen-button.png)
+![query-result-fullscreen](../../../images/browser/query-result-fullscreen.png)
+![query-result-fullscreen-close](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.Graph Analysis
+
+Click the `Graph Analysis` button in the `Graph Project` tab in the `Graph Project` interface to display and analyze graph data on the canvas. The product provides `Query by Statement` and `Query by Configuration` to query and load data from the graph project to the canvas. It supports filtering, layout adjustment, and canvas operations on the canvas data.
+
+![graphanalysis-button](../../../images/browser/graphanalysis-button.png)
+
+As shown in the figure below, the graph analysis function mainly includes: 1. Operation bar: the main operation functions of graph analysis, including view switching, query filtering, layout style, and canvas operations; 2. Left sidebar: query, filter, and appearance operation area; 3. Canvas area: the area for displaying graph data, displaying vertex and edge data, supporting vertex expansion query, collapsing vertexs, fixing vertexs, deleting vertexs, and providing canvas graph data statistics; 4. Right sidebar: when a vertex or edge data is selected, the corresponding attribute information will be displayed; 5. Switch graph project: switch to different graph projects for analysis.
+
+![graphanalysis-operation-area](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.Query by Statement
+
+In the `Query by Statement` function, users can enter query statements to query graph data and load the data to the canvas area for display.
+- Syntax Description: TuGraph's query language and syntax documentation.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-query](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.Query by Configuration
+
+In the `Query by Configuration` function, users can select vertex types and enter attribute conditions to query graph data and load the data to the canvas area for display.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-configurequery](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.Canvas Analysis
+
+In the `Canvas Analysis` function, users can perform operations and analysis on the vertex or edge data on the canvas, including: expanding queries by selecting vertexs, collapsing/expanding vertexs, fixing vertexs, clearing the canvas, lassoing, vertex/edge retrieval, and canvas legend. The most basic operation on the canvas is dragging vertex data. By selecting a vertex with the left mouse button and moving the mouse, the position of the vertex data can be changed.
+
+###### a.Expand Query
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, move the mouse to `Expand Query`, and a secondary window will pop up. Click on the corresponding expansion degree to perform the query.
+- First-degree Query: Bidirectional expansion of first-degree relationships.
+- Second-degree Query: Bidirectional expansion of second-degree relationships.
+- Third-degree Query: Bidirectional expansion of third-degree relationships.
+- Custom Query: Expand based on selected conditions.
+    - Edge Direction: Set the direction of the expansion relationship, Bidirectional: includes outgoing edges and incoming edges, Outgoing: edges pointing outward from the selected starting vertex, Incoming: edges pointing to the selected starting vertex.
+    - Degree of Diffusion: The degree of expansion.
+    - Custom Return vertex Count: Configure the number of vertexs returned to the front end, default is 100, to prevent exceptions on the front end caused by super vertexs.
+    - Add Filter Group: Set the relationship type and attribute conditions of the expansion, multiple relationship types can be set.
+
+![graphanalysis-canvas-expand-before](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![graphanalysis-canvas-expand-after](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![graphanalysis-canvas-expand-custom](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.Collapse/Expand Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Collapse Vertexs` to hide the first-degree relationship Vertexs of the selected Vertexs; right-click on the collapsed Vertex data again to perform Expand Vertexs operation to show the hidden first-degree relationship Vertexs.
+
+![graphanalysis-canvas-collapse](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![graphanalysis-canvas-expand](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.Fix Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Fix vertexs` to fix the selected vertexs in place. The fixed vertexs cannot be moved (including layout adjustment); right-click on the fixed vertex data again to perform `Unfix vertexs` operation to restore the normal operation of the selected.
+
+![graphanalysis-canvas-fixed](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![graphanalysis-canvas-unfix](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.Delete Vertex
+
+Right-click on a vertex in the `Canvas` area to open the operation window. Click on `Delete Vertex` to remove the selected vertex from the canvas.
+
+![graphanalysis-canvas-delete](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.Clear Canvas
+
+Click on the `Clear Canvas` button in the `Toolbar` area to clear all data on the canvas.
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.Vertex/Edge Retrieval
+
+Select a vertex or edge in the `Vertex/Edge Retrieval` window and enter a keyword to perform a fuzzy search for attribute data on the canvas. After the search, you can locate the data position.
+
+![graphanalysis-canvas-retrieval](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.Canvas Legend
+
+In the legend area of the `Canvas` area, the vertex types in the canvas will be displayed. Click on a vertex type to select the corresponding vertex data. Click on the "More" button to display the statistics, which can be displayed in a list or chart format to show the number of vertexs or edges.
+
+![graphanalysis-canvas-legend-list](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![graphanalysis-canvas-legend-chart](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.Attribute Filter
+
+Click on the `Filter` button in the `Toolbar` area, and click on `Attribute Filter` in the `Sidebar` to perform filter and filtering. Users can select the vertex or edge types to be filtered, and set the corresponding attribute values. After retrieving the filtered group conditions, the corresponding vertex or edge data will be highlighted on the canvas.
+- Please select the vertex/edge type: Select the vertex type or edge type to be searched.
+- Attribute condition: Set the attribute conditions to be searched. Multiple groups can be set to take the union of the filtering results.
+- Add filter group: Multiple filter conditions can be set to take the union of the filtering results.
+- Reset: Clear the filter conditions.
+
+![graphanalysis-queryfilter-attributefilter](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.Statistical Filter
+
+Click on the Filter button in the Toolbar area, and click on Statistical Filter in the Sidebar to perform statistical filtering of canvas data. Users can select the vertex or edge types to be counted, and set the corresponding attribute values. The system will automatically group and count based on the selected vertex/edge types and attributes. The results can be displayed in chart and list formats. Clicking on the values in the chart or list area will highlight the corresponding data on the canvas.
+
+![graphanalysis-queryfilter-statisticalfilter](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![graphanalysis-queryfilter-statisticalfilter-chartswitch](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.Layout Style
+
+Click on the `Layout` button in the `Toolbar` area, and select the corresponding layout method to rearrange the data on the canvas. It supports force-directed layout, concentric circle layout, circular layout, radial layout, Dagre layout, and grid layout. Each layout method has different layout parameters. After adjusting the parameters, the data on the canvas will be rearranged.
+
+![graphanalysis-style-layout-button](../../../images/browser/graphanalysis-style-layout-button.png)
+![graphanalysis-style-layout-parameters](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+For detailed layout parameters, please refer to[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide).
+
+##### 2.4.4.6.Appearance Style
+
+Click on the `Appearance` button in the `Toolbar` area, and click on `Vertex Style` or `Edge Style` in the `Sidebar` to configure the appearance style.
+- Vertex Style
+    - Apply to vertex type: Set the display style for the corresponding vertex type. Multiple vertex types can be configured simultaneously.
+    - Size: The display size for the corresponding vertex type.
+    - Color: The display color for the corresponding vertex type.
+    - Icon: The icon style for the corresponding vertex type.
+    - Display Text: The text content displayed for the corresponding vertex type, defaulting to id.
+    - Advanced Configuration: Mark the corresponding vertex data based on the set conditions.
+- Edge Style
+    - Apply to Edge Type: Set the display style for the corresponding edge type, supports configuring the appearance of multiple edge types simultaneously.
+    - Color: The display color for the corresponding edge type.
+    - Width: The display width for the corresponding edge type.
+    - Display Text: The text content displayed for the corresponding edge type, not displayed by default.
+    - Advanced Configuration: Display the corresponding edge data based on the set conditions.
+
+![graphanalysis-style-appearance](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.Console
+
+The `Console` provides a visualized account management and database information viewing function. It provides users with comprehensive account and role management functions, including adding, deleting, modifying, and disabling accounts and roles. In addition, it also provides users with convenient database information viewing function, allowing users to easily view the basic information and configuration information of the graph database. Basic information mainly includes version number, running time, CPP compilation version number, etc., while database configuration information includes port number, system function parameter configuration, etc.
+
+#### 2.5.1.Account Management
+
+##### 2.5.1.1.Account Management
+
+##### a.Add Account
+
+Click the `Add` button in the `Account Management` interface to create a new account. Users need to enter the account name, account description, account password, and related roles.
+
+- Account Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Related Roles: When creating a new account, you must select a role. After the account is added successfully, the system will automatically generate a role with the same name as the account name.
+
+![account-add-button](../../../images/browser/account-add-button.png)
+![account-add](../../../images/browser/account-add.png)
+
+##### b.Edit Account
+
+Click the `Edit` button in the `Account Management` interface to edit the account description, account password, and related roles.
+
+![account-edit](../../../images/browser/account-edit.png)
+
+##### c.Disable Account
+
+Click the `Disable` button in the `Account Management` interface to prevent the corresponding account from logging in and accessing. Click the `Enable` button to enable the corresponding account login and access permissions.
+
+![account-disable](../../../images/browser/account-disable.png)
+![account-enable](../../../images/browser/account-enable.png)
+
+##### d.Delete Account
+
+Click the `Delete` button in the `Account Management` interface to delete the corresponding account.
+
+![account-delete](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.Role Management
+
+##### a.Add Role
+
+Click the `Add` button in the `Role Management` interface to create a new role. Users need to enter the role name, role description, and graph permissions.
+
+![role-add-button](../../../images/browser/role-add-button.png)
+
+- Role Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Graph Permissions: The browser supports four types of graph permission configurations: All, Read/Write, Read-Only, and None.
+    - All: corresponds to the read and write permissions of the graph, including editing the graph model permissions (schema).
+    - Read/Write: corresponds to the write permission of the graph, but does not include the permission to edit the graph model (schema).
+    - Read-Only: corresponds to the read permission of the graph.
+    - None: cannot access or operate the corresponding graph.
+- Role Conflict: When two roles have different graph permissions for the same graph, and both roles are authorized to the same account, the graph permission of the account for the graph is the union of the graph permissions of the two roles.
+
+![role-add](../../../images/browser/role-add.png)
+
+##### b.Edit Role
+
+Click the `Edit` button in the `Role Management` interface to edit an existing role. Users can edit the role description and graph permissions.
+
+![role-edit](../../../images/browser/role-edit.png)
+
+##### c.Disable Role
+
+Click the `Disable` button in the `Role Management` interface to disable the corresponding role. Click the `Enable` button to enable the corresponding role. After the role is disabled, the corresponding graph permissions of the role become invalid.
+
+- Disabled Role: After the role is disabled, the corresponding graph permissions become invalid.
+    - When a user has two roles with operating permissions on the same graph, if one of the roles is disabled, the permission of the other role is still valid.
+
+![role-disable](../../../images/browser/role-disable.png)
+![role-enable](../../../images/browser/role-enable.png)
+
+##### d.Delete Role
+
+Click the `Delete` button in the `Role Management` interface to delete the corresponding role.
+
+![role-delete](../../../images/browser/role-delete.png)
+
+#### 2.5.2.Database Information
+
+##### 2.5.2.1.Basic Information
+
+`Basic Information` obtains the current running status of the system and displays key information.
+
+![db_basic](../../../images/browser/db_basic.png)
+
+|Parameter    |Meaning    |
+|-------|--------|
+|TuGraph Version Number|The current version number of TuGraph, x.x.x|
+|Running Time|The time from when TuGraph service starts to now|
+|Server Code Version|The current commit of the tugraph-db repository|
+|Front-end Code Version|The current commit of the tugraph-web repository|
+|CPP Compiler Version|The CPP version number when compiling TuGraph|
+|Python Version Number|The Python version number when compiling TuGraph|
+|CPP Compiler ID|The CPP type when compiling TuGraph|
+
+The current running status of the system can also be obtained through commands.
+
+```cypher
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.Database Configuration Information
+
+`Database Configuration Information` obtains the current configuration parameters of the system and displays key information. To adjust the configuration parameters or understand the detailed configuration parameters, please refer to [Database Running-Service Configuration](../5.installation&running/7.tugraph-running.md).
+
+![db_configuration](../../../images/browser/db_configuration.png)
+
+| Parameter                   | Meaning                                                                                                                                         |
+|-----------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------|
+| bind_host                   | The host set when the system starts, usually 0.0.0.0                                                                                            |
+| disable_auth                | Whether to disable the regular update of token authentication. If set to true, the token can be used permanently                                |
+| durable                     | Whether to enable persistent storage of the underlying layer. If set to false, the data is updated asynchronously to the disk                   |
+| enable_audit_log            | Whether to enable audit log                                                                                                                     |
+| enable_backup_log           | Whether to enable real-time incremental backup                                                                                                  |
+| enable_fulltext_index       | Whether to enable full-text indexing                                                                                                            |
+| enable_ip_check             | Whether to enable IP whitelist                                                                                                                  |
+| enable_rpc                  | Whether to enable the RPC port                                                                                                                  |
+| enable_ssl                  | Whether to enable SSL encrypted transmission                                                                                                    |
+| optimistic_txn              | Whether to enable optimistic multi-threaded write transactions                                                                                  |
+| port                        | The REST access port of the current system                                                                                                      |
+| rpc_port                    | The port used by the RPC and HA services                                                                                                        |
+| subprocess_max_idle_seconds | The maximum idle time of the subprocess, a thread pool parameter                                                                                |
+| thread_limit                | The maximum number of threads used by the server at the same time                                                                               |
+| verbose                     | The level of detail of the log output information. It can be set to 0, 1, or 2, with larger values indicating more detailed output information. |
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..c0a3a1674b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# TuGraph Browser(old version)
+
+> This document focuses on the use of TuGraph Browser
+
+## Definition
+
+TuGraph Browser is a visual development tool provided by TuGraph.
+
+## Functionality
+
+TuGraph Browser provides graph database developers with functions such as visual graph data development, graph data management and maintenance.
+
+## How to use it
+
+### 1. Connect to the database
+
+When the user completes the installation of the graph database, you can access it through the Browser, TuGraph Browser tool. The user only needs to type in the browser address bar: IP of the server where TuGraph is located :Port. The default port is 7090.
+
+### 2. Login
+
+![alt Login](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- When the page is opened successfully, the first thing you see is the login page, and the user needs to fill in the account number and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change the initialized password in time after logging in
+
+### 3. Workbench
+
+#### 3.1 Quick Start
+
+- When you log in for the first time, the system will create an empty graph by default
+
+  ![alt quick start](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- The user clicks on the help option and selects Get Started quickly
+
+  ![alt help](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- Then click "One-click Create Model" -- >" One-click Create Data "to complete the construction of the built-in Movie data graph
+
+#### 3.2 Create subgraphs and examples
+
+##### 3.2.1 Create a subgraph
+
+- Click on New subgraph
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- Fill in the form information
+  ![alt Fill out the form](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+- Subgraph name
+- Subgraph description
+- Configuration information
+- Click OK to prompt that creation succeeded
+- Toggle the subgraph
+  ![alt Toggle subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- Click New Example
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- Select the example and click Create
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 query
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 User Interface Layout
+
+- Cypher input box
+- Result set display area
+
+##### 3.3.2 Result set display area function details
+
+- Result set tag display and functions
+  ![alt Result set tag](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+- All types of statistics for the result set are shown here
+- Click on the different "label" to make the following changes
+  -Change the display color
+- Modify the node size or edge thickness
+- Modify default display properties or system properties
+- Layout modification
+- Force guide layout
+- Grid layout
+- Tree layout
+- Environment layout
+- edge polymerization
+- Edges of the same type and direction can be merged
+- Create nodes
+- Click the Create Node button
+- Select the node type
+- Add node content
+- Create relationships
+- Select start and end points in the canvas
+- Select the type that can be matched
+- Enter node information
+- Stop layout
+- When too much data is causing the browser page to stall, you can click this stop layout button to improve the smoothness of the experience
+- Mouse hover
+- Enable this feature to highlight the one-degree neighbors of the mouse-over node
+- Result set export
+- Result sets can be exported as png, json, csv three different file forms
+- the refresh
+- Clicking the refresh button will re-execute the initial cypher statement for the current page and refresh the result set
+  Maximize -
+  -Click Maximize button, the result set display area will be displayed in full screen
+- Result set display mode switching
+  - Support graph, table and text modes
+
+##### 3.3.3 Schema
+
+- model
+  ![Modeling Alt](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- schema supports real-time addition, deletion, modification and query
+
+- schema supports import and export
+
+##### 3.3.4 Data import
+
+- Local data import
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+- Select the file encoding format
+- Select a local CSV file
+- Select the model for the corresponding node or edge
+- Do the data mapping
+- Complete the data import
+- The maximum supported size for a single file is 2GB.
+
+##### 3.3.5 plug-in (Stored Procedure)
+
+- Use of plug-ins
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+- Users can upload the plug-in program written locally, execute it in the visual page, and view the execution result
+- Users can perform, uninstall, execute, and download plug-ins in the visualization page
+
+##### 3.3.6 Help
+
+- where it records how TuGraph-browser is used
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 Console
+
+##### 3.4.1 Basic database information
+
+- Displays basic database configuration information
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 Permission management
+
+- A function module used to create users and roles. Users can manage permissions here
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 Live status
+
+- This shows the database real-time status, including: CPU usage, memory usage, disk usage, number of data requests, disk IO
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 Task Management
+
+- Here the user can see the task in execution and stop the task
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 Audit logs
+
+- Database related audit logs recorded here, used to troubleshoot problems encountered in use
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6c4d063e26
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB User Guide
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..f2cdffe578
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/1.environment.md
@@ -0,0 +1,41 @@
+# Environment
+
+> This document provides an overview of the required hardware and software environment for deploying TuGraph.
+
+## 1.Hardware Environment
+
+### 1.1. CPU
+TuGraph supports X86_64 and ARM64 architectures for both physical, virtual, and containerized environments. Tested and certified hardware platforms include Intel, AMD, Kunpeng, Hygon, Feiteng, and others.
+
+### 1.2. Memory
+We recommend having a memory capacity that is equal to or greater than the actual data size. For optimal performance, caching all data in memory is ideal. In terms of data locality, graph databases have poorer locality compared to relational databases. Therefore, if the data cannot fit in memory, frequent swapping may occur.
+
+### 1.3. Storage
+We strongly recommend using NVMe SSD as external storage. The database performs numerous synchronous write operations, often in a random manner, making the read/write performance of the external storage critical to the overall database performance. Hence, high IOPS and low-latency NVMe SSDs are the optimal choice.
+
+If circumstances permit only the use of SATA interface SSDs or cloud-based network disks, although performance may be affected, TuGraph can still run correctly.
+
+It is recommended to have external storage size at least four times the actual data size. For example, if the data size is 1TB, preparing a 4TB hard drive would be more reliable.
+
+
+
+## 2. Software environment
+
+### 2.1. Operating System
+
+TuGraph is compatible with popular operating systems, including Ubuntu, CentOS, SUSE, Galaxy Kylin, China Standard Software, UOS, and others, all of which have been tested and certified.
+
+Among them, the most stable system versions are Ubuntu 18.04, CentOS 7, and CentOS 8.
+
+### 2.2. System Libraries
+
+The requirements for system libraries differ between the compilation environment and the runtime environment. For specific details, please refer to the[environment mode](2.environment-mode.md)。
+
+## 3.Recommended Configuration
+
+| Hardware | Minimum Configuration	   | Recommended Configuration                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| Memory   | 4GB       | 512GB                    |
+| Storage  | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..98f9820ba2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,24 @@
+# Environment Mode
+
+> This document primarily introduces the three types of environments involved in TuGraph.
+
+## 1.Classification
+
+Based on the different functionalities supported by the environments, they can be categorized into the following:
+
+* The compilation environment has all dependent libraries for TuGraph compilation, including all dependencies of the running environment, and can compile TuGraph source code, but does not include precompiled TuGraph executable files and library files for developers to compile source code.
+
+* Running environment, with GCC/Java/Python environment, can run all functions of TuGraph, and can host full-text indexing, java client, c++ source code uploaded as plugin, and complete functions of python plugin, built-in TuGraph precompiled executable file and library files for customers to install and use directly without compiling source code.
+
+* Simplified operating environment, which is approximately equivalent to a bare system plus precompiled TuGraph. It can only run the basic functions of TuGraph. There is no C++ plugin to compile and run, only so upload, no full-text index, and no python plugin. It is for quick setup and trial use.
+After compiling TuGraph, all the required dependencies are packaged together in the form of .a files, eliminating the need for unnecessary additional dependencies during runtime. However, since TuGraph supports stored procedures, which involve compiling C++ code on the server, the required compilers still need to be present in the environment.
+
+## 2.System Library
+
+For the three types of environments, the required system libraries, excluding the TuGraph runtime package, are as follows:
+
+* Compilation Environment: It includes GCC, Python, Java compilers, as well as libraries such as ANTLR4 and Pybind11. Please refer to the tugraph-compile-*-Dockerfile for more details.
+
+* Runtime Environment: The main dependencies introduced by stored procedures include GCC, Boost, CMake, and others. Please refer to the tugraph-runtime-*-Dockerfile for more details.
+
+* Mini-Runtime Environment: There are no additional system library dependencies. Please refer to the tugraph-mini-runtime-*-Dockerfile for more details.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..bb966b75b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,103 @@
+# Docker Deployment
+
+>This document introduces the creation and download of Docker images for TuGraph Compile and TuGraph Runtime.
+
+## 1.Introduction
+
+- TuGraph Compile Image: Provides a compilation environment and can be used for TuGraph compilation and testing.
+- TuGraph Runtime Image: Provides a binary executable environment with TuGraph library and executable files.
+- TuGraph Mini Runtime Image: Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+## 2.Existing Docker Images
+
+### 2.1.Image Download
+
+The images are hosted on [DockerHub]( https://hub.docker.com/u/tugraph ) and can be downloaded and used directly.
+
+For the latest version of Docker address, see the TuGraph-Latest-Version section in [Guide](../../1.guide.md).
+
+### 2.2.Naming Convention
+
+#### 2.2.1.TuGraph Compile Image
+
+Provides a compilation environment and can be used for TuGraph compilation.
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+For example: `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+Provides a binary executable environment with TuGraph library and executable files.
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example:`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example: `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.Common Docker Operations
+
+Docker is generated from Dockerfile. Note that creating images requires downloading dependencies, so network issues may cause slow creation or creation failure. Do not overwrite images unless the tag is `latest`.
+
+build Compile image
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+build Runtime / Mini Runtime image
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+Modify image name
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+push image
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+pull image
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+save image
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+load image
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+Refer to the [docker official documentation](https://docs.docker.com/engine/reference/commandline/cli ) for other Docker operations.
+
+### 2.4. M1 Supports
+
+Running amd64 containers on M1-chip machines may cause unknown errors. TuGraph provides arm64 images for M1 machines. Contains compile and runtime images.
+
+In `tugraph-runtime-centos7:3.6.0` and `tugraph-compile-centos7:1.2.7` and later, `tugraph-runtime-centos7` and `tugraph-compile-centos7` provide images of two architectures: linux/amd64 and linux/arm64/v8. You can obtain the arm64 architecture image through docker pull on the M1 machine.
+
+## 3. Best Practice in Using and Developing Docker Images for TuGraph-DB
+
+Please carefully read the points below and follow them if you are new to contribute to TuGraph.
+
+- To get rid of too much docker layer, please add your dependency to the Docker with the style writing ENV and RUN in a
+  single line.
+- For the packages/resources you need to build the dependency, use the original ones instead of tweaking them without
+  tracking by VCS. And then contact TuGraph team to upload it to OSS to accelerate the building process, as the urls you
+  see in the Dockerfiles.
+- To make the development more efficient, you would better start from adding dependencies to base TuGraph Compile Images
+  and then reproduce the process in the Dockerfile after confirming the enviroment works.
+- CI uses the docker images. Please check the dependency problems if your CI fails.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..cb40030596
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# Local Package Deployment
+
+> This document describes TuGraph Local Package Deployment.
+
+## 1. Environment preparation
+
+TuGraph local package deployment requires a corresponding environment, and quick verification can use streamlined installation packages, which require almost no third-party libraries.
+
+If you need to use the complete TuGraph function, please refer to the tugraph-db source code directory ci/images/tugraph-runtime-*-Dockerfile. This script contains the complete environment construction process.
+
+## 2. Download the installation package
+
+For the latest version of the installation package address, see "TuGraph-Latest-Version" of [Guide](../../1.guide.md) 
+
+You can also visit Github to download: [TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. Installation method under CentOS
+
+The .rpm installation package for TuGraph installed on CentOS, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.rpm installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+Users can also specify the installation directory by specifying the `--prefix` option.
+
+## 4. Installation method under Ubuntu
+
+A .deb installation package for TuGraph installed on Ubuntu, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.deb` installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+This command installs TuGraph in the `/usr/local` directory by default. Users can also change the installation directory by specifying the `--instdir=<directory>` option.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..77bfda5171
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,128 @@
+# Cloud Deployment
+
+> This document mainly introduces the cloud deployment of TuGraph, and you can also refer to the[Alibaba Cloud ComputeNest deployment document.](https://aliyun-computenest.github.io/quickstart-tugraph/)。
+
+## 1.Introduction
+
+TuGraph (tugraph.antgroup.com) is a high-performance graph database of Alibaba Group. TuGraph provides community version services on ComputeNest, so you can quickly deploy TuGraph services on ComputeNest and achieve operation and maintenance monitoring, thereby building your own graph application. This document introduces how to open TuGraph community version services on ComputeNest, as well as deployment process and usage instructions.
+
+## 2.Instance Description
+
+TuGraph is deployed as a community open source version, and the source code can be found in the Github Repo. Currently, the available instance specifications are as follows:
+
+| Instance Family | vCPU and Memory             | System Disk                | Public Bandwidth         |
+|-----------------|-----------------------------|----------------------------|--------------------------|
+| ecs.r7a.xlarge  | AMD Memory r7a, 4vCPU 32GiB | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+| ecs.r6.xlarge   | Memory r6, 4vCPU 32GiB      | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+
+Estimated costs can be seen in real time when creating instances (currently free). If you need more specifications or other services (such as cluster high availability requirements, enterprise-level support services, etc.), please contact us at tugraph@service.alipay.com.
+
+## 3.Deployment Process
+
+### 3.1.Preparation
+
+Before starting to use, you need an Alibaba Cloud account to access and create resources such as ECS and VPC.
+
+- If you use a personal account, you can directly create a service instance.
+- If you create a service instance using a RAM user and use Alibaba Cloud ComputeNest for the first time:
+    - Before creating a service instance, you need to add permissions for the corresponding resources to the account of the RAM user. For detailed operations on adding RAM permissions, please see Grant RAM user permissions. The required permissions are shown in the following table.
+    - Authorization to create associated roles is also required. Refer to the following figure and select Agree to authorize and create associated roles.
+
+| Permission Policy Name          | Remark                                                                       |
+|---------------------------------|------------------------------------------------------------------------------|
+| AliyunECSFullAccess             | Permissions for managing cloud server services (ECS)                         |
+| AliyunVPCFullAccess             | Permissions for managing Virtual Private Cloud (VPC)                         |
+| AliyunROSFullAccess             | Permissions for managing Resource Orchestration Service (ROS)                |
+| AliyunComputeNestUserFullAccess | Permissions for managing ComputeNest services (ComputeNest) on the user side |
+| AliyunCloudMonitorFullAccess    | Permissions for managing Alibaba Cloud Monitor (CloudMonitor)                |
+
+![Cloud Deployment](../../../images/cloud-deployment-1.png)
+
+### 3.2.Deployment Entrance
+
+You can search in Alibaba Cloud ComputeNest, or quickly access it through the following deployment link.
+
+[Deployment Link](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.Apply for Trial Use
+
+Before formal trial use, you need to apply for trial use, fill in the information as prompted, and create the TuGraph service after passing the review.
+
+![Apply for Trial Use](../../../images/cloud-deployment-2.png)
+
+### 3.4.Create TuGraph Service
+
+#### 3.4.1.Parameter List
+
+During the process of creating a service instance, you need to configure the parameter list of the service instance information. The specific parameters are as follows.
+
+| Parameter Group                              | Parameter Item  | Example                 | Description                                                                                                                            |
+|----------------------------------------------|-----------------|-------------------------|----------------------------------------------------------------------------------------------------------------------------------------|
+| Service Instance Name                        | N/A             | test                    | The name of the instance.                                                                                                              |
+| Region                                       | N/A             | China East 1 (Hangzhou) | Select the region of the service instance. It is recommended to select nearby regions to obtain better network latency.                |
+| Payment Type Configuration                   | Payment Type    | Pay-As-You-Go           | For free use, please select Pay-As-You-Go.                                                                                             |
+| Availability Zone Configuration              | Deployment Area | Availability ZoneI      | Different available zones under the region, ensure that the instance is not empty.                                                     |
+| Select Existing Basic Resource Configuration | VPC ID          | vpc-xxx                 | Select the ID of the Virtual Private Cloud according to the actual situation.                                                          |
+| Select Existing Basic Resource Configuration | Switch ID       | vsw-xxx                 | Select the Switch ID according to the actual situation. If the Switch ID cannot be found, try switching the region and available zone. |
+| ECS Instance Configuration                   | Instance Type   | ecs.r6.xlarge           | Currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications.                                                                    |
+|ECS Instance Configuration|	Instance Password|	**|	Set the instance password. Length of 8-30 characters, must include three items (uppercase letters, lowercase letters, numbers, special characters in ()`~!@#$%^&*_-+={}[]:;'<>,.?/).
+|
+
+#### 3.4.2.Specific Steps
+
+The creation of the service is carried out according to the following steps, refer to the figure below:
+
+- Create an instance name, such as "test" in the figure below
+- Select the region, such as "China East 1 (Hangzhou)" in the figure below
+
+![Create Instance](../../../images/cloud-deployment-3.png)
+
+- Select the instance type, currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications. If there is no model available in the list, try selecting other deployment areas.
+- Select the model
+- Configure the password for the instance
+- Select the deployment area, such as "Availability Zone I" in the figure below
+
+![Select Region](../../../images/cloud-deployment-4.png)
+
+- Click next to enter the order confirmation page
+- Check the checkboxes for "Permission Confirmation" and "Service Terms"
+- Click the green "Start Free Trial" button in the lower left corner to create a service instance
+
+![Confirmation](../../../images/cloud-deployment-5.png)
+
+### 3.5.Start TuGraph Service
+
+- View the service instance: After the service instance is created successfully, it takes about 2 minutes for deployment. After the deployment is complete, you can see the corresponding service instance on the page, as shown in the figure below.
+
+![View Instance](../../../images/cloud-deployment-6.png)
+
+- Click the service instance to access TuGraph. After entering the corresponding service instance, you can get 3 ways to
+  use it on the page: web, rpc, ssh. You can also see the password of user admin on the page.
+
+![Access Method](../../../images/cloud-deployment-7.png)
+
+- Click the link of web to jump to the deployed TuGraph Web. It is recommended that novice users first use the demo to quickly get started with TuGraph.
+    - First, on the TuGraph Web login page, enter the default username (admin) and the password on the page to log in, as shown in the figure below.
+    - After the login is completed, click "New Instance" -> "Create Instance" in sequence, wait for the creation to be completed, and the steps in 3 will change to green in turn, and it will automatically switch to the subgraph MovieDemo1, as shown in the figure below.
+
+![Login](../../../images/cloud-deployment-8.png)
+![Create Demo](../../../images/cloud-deployment-9.png)
+
+## 4.Common FAQs
+
+### No available resources in the selected deployment area
+
+Sometimes, the selected deployment area (such as Availability Zone G) does not have available resources for the selected package, and an error will be reported as shown in the figure below.
+
+![Deployment Error](../../../images/cloud-deployment-10.png)
+
+__Solution__:Try selecting other regions, such as Availability Zone I
+
+### Unaccessible to the web port
+
+It takes some time for the server to get ready. Just wait for a few seconds.
+
+
+### Username or password is not correct
+
+Please make sure that you are using the password on the page instead of the default one.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..2f28bee61e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/6.compile.md
@@ -0,0 +1,31 @@
+# Compile
+
+> This document mainly describes how to compile TuGraph from source code.
+
+## 1.Prerequisites
+
+It is recommended to build TuGraph on a Linux system. Meanwhile, Docker is a good choice. If you want to set up a new environment, please refer to [Dockerfile](3.docker-deployment.md)。
+
+## 2.compile
+
+Here are steps to compile TuGraph:
+
+1. run `deps/build_deps.sh` to build tugraph-web if you need. Skip this step otherwise.
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If support shell lgraph_cypher, use `-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+4. If compiling on an arm machine (such as a Mac with M1 chip), add `-DENABLE_BUILD_ON_AARCH64=ON`
+5`make`
+6`make package` or `cpack --config CPackConfig.cmake`
+
+Example:
+`tugraph/tugraph-compile-centos7`Docker environment
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..77709ba0cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,201 @@
+# Tugraph Running
+
+> This document describes the operation mode of the TuGraph service, starting, stopping, and restarting operations.And TuGraph's service configuration parameters, configuration file format, and command-line configuration parameters.
+
+## 1. Prerequisites
+TuGraph has the following prerequisites for its execution: a correct [installation of TuGraph](1.environment.md).
+
+TuGraph execution requires ensuring that the library file "liblgraph.so" is located in the environment variable LD_LIBRARY_PATH.
+
+The user running the TuGraph process does not need superuser privileges. However, they need read permissions for the configuration file (usually lgraph.json) and any files referenced within it. Additionally, they should have write permissions for data folders, log files, etc.
+
+## 2.The operation mode
+
+TuGraph can be started as a normal process in the foreground or as a daemon in the background.
+
+When running as a normal process, TuGraph can print logs directly to the terminal, which is handy when debugging server configurations. However, because the foreground process is terminated after the terminal exits, the user must ensure that the terminal remains open while the TuGraph server is running. In daemon mode, on the other hand, the TuGraph server can continue to run even if the terminal that started it exits. If TuGraph needs to run for a long time, it is recommended to start the TuGraph server in daemon mode.
+
+### 2.1.Running a normal process
+
+The `lgraph_server -d run` command runs TuGraph as a normal process. Normal processes depend on the command line terminal, so when the terminal ends, the TuGraph process is automatically terminated. Normal process mode with `--log_dir ""` can output the process log directly to the terminal, so it is easier to debug.Note: When not using the `-d run` command, the default behavior is to run as a normal process.
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d run -c lgraph_standalone.json --log_dir ""
+```
+or:
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+Example of running output in normal mode：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+In normal process mode, the user can prematurely terminate the TuGraph process by pressing 'CTRL+C'.
+
+### 2.2.Run process daemon mode
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+Example output from running in daemon mode:
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+## 3.Service operation
+
+### 3.1.Start the service
+
+TuGraph needs to be started using the 'lgraph_server -d start' command line. The following is an example of the command to start TuGraph:
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+### 3.2.Stop the service
+
+You can stop the TuGraph daemon using the 'kill' command and the 'lgraph_server -d stop' command. Since it is possible to run multiple TuGraph server processes on the same computer, we distinguish between the different server processes using the '.pid 'file, which is written to the working directory where the process was started. Therefore, you need to run the command 'lgraph_server-d stop' in the same working directory to stop the correct server process.
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.Restart the service
+
+Users can also restart the TuGraph service by 'lgraph_server -d restart' :
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.Service configuration
+
+The TuGraph server loads configurations from the configuration file and command line options at startup, and if different values are specified for the same option in the configuration file and command line, the value specified in the command line will be used preferentially.
+
+### 4.1.Configuration parameters
+
+The parameters and their types are described as follows:
+
+| **Parameter names**       | **<nobr>Type</nobr>** | **Instructions**                                                                                                                                                                                                                                                                                    |
+|---------------------------|-----------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                 | string                | Directory where data files are stored. If the directory does not exist, it is automatically created. The default directory is /var/lib/lgraph/data.                                                                                                                                                 |
+| durable                   | boolean               | Whether to enable real-time persistence. Turning off persistence can reduce the disk IO overhead when writing, but data may be lost in extreme cases such as machine power failure. The default value is `true`.                                                                                    |
+| host                      | string                | The IP address on which the REST server listens. The default address is 0.0.0.0. Note: In HA mode, the host needs to be set to the IP address of the corresponding server and cannot be set to 0.0.0.0.                                                                                             |
+| port                      | int                   | The Port on which the REST server listens. The default port is 7070.                                                                                                                                                                                                                                |
+| enable_rpc                | boolean               | Whether to use RPC services. The default value is false.                                                                                                                                                                                                                                            |
+| rpc_port                  | int                   | Port used by RPC and HA services. The default port number is 9090.                                                                                                                                                                                                                                  |
+| enable_ha                 | boolean               | Whether to enable the HA mode. The default value is false.                                                                                                                                                                                                                                          |
+| ha_log_dir                | string                | HA log directory. The HA mode needs to be enabled. The default value is null.                                                                                                                                                                                                                       |
+| verbose                   | int                   | Detail level of log output information. The value can be 0,1,2. The larger the value, the more detailed the output information. The default value is 1.                                                                                                                                             |
+| log_dir                   | string                | Directory where log files are stored. The default directory is /var/log/lgraph/.                                                                                                                                                                                                                    |
+| ssl_auth                  | boolean               | Whether to use SSL authentication. When HTTPS is enabled, only the HTTPS service is enabled on the REST server. The default value is false.                                                                                                                                                         |
+| web                       | string                | The directory where the web files (including the visual part) are located. The default directory is/usr/local/share/lgraph/resource.                                                                                                                                                                |
+| server_cert               | string                | certificate file path used by the server when SSL authentication is enabled. The default path is/usr/local/etc/lgraph/server - cert.pem.                                                                                                                                                            |
+| server_key                | string                | The public key file used by the server when SSL authentication is enabled. The default directory is/usr/local/etc/lgraph/server - key.pem。                                                                                                                                                          |
+| enable_audit_log          | boolean               | Whether to enable audit logs. The default value is false.                                                                                                                                                                                                                                           |
+| audit_log_expire          | int                   | When audit logs are enabled, the validity period (hours) of audit logs is automatically cleared upon timeout. If the value is 0, the logs are not cleared. The default value is 0.                                                                                                                  |
+| audit_log_dir             | string                | Specifies the directory for storing log files when audit logs are enabled. The default directory is $directory/_audit_log_.                                                                                                                                                                         |
+| load_plugins              | boolean               | Import all stored procedures when starting the service. The default value is true.                                                                                                                                                                                                                  |
+| optimistic_txn            | boolean               | Enable optimistic multithreaded write transactions for Cypher. The default is false.                                                                                                                                                                                                                |
+| disable_auth              | boolean               | Disable REST authentication. The default is false.                                                                                                                                                                                                                                                  |
+| ha_snapshot_interval_s    | int                   | Snapshot interval (in seconds). The default value is 604800. -1 means not to automatically generate snapshots.                                                                                                                                                                                      |
+| ha_heartbeat_interval_ms  | int                   | Heartbeat interval in milliseconds. The default value is 1000.                                                                                                                                                                                                                                      |
+| ha_node_offline_ms        | int                   | The heartbeat times out and the interval (in milliseconds) between nodes going offline. The default value is 60000.                                                                                                                                                                                 |
+| ha_node_remove_ms         | int                   | The interval (in milliseconds) at which a node is considered completely dead and removed from the list. The default value is 120000.                                                                                                                                                                |
+| enable_ip_check           | boolean               | Allow IP address whitelists. The default value is false。                                                                                                                                                                                                                                            |
+| idle_seconds              | int                   | The maximum number of seconds a child process can be idle. The default value is 600.                                                                                                                                                                                                                |
+| enable_backup_log         | boolean               | Whether to enable backup logging. The default value is false.                                                                                                                                                                                                                                       |
+| backup_log_dir            | string                | The directory where backup files are stored. The default value is null.                                                                                                                                                                                                                             |
+| snapshot_dir              | string                | Directory where snapshot files are stored. The default value is null.                                                                                                                                                                                                                               |
+| thread_limit              | int                   | The maximum number of threads that can be used simultaneously. The default value is 0, which means that no restriction is imposed. The license file prevails.                                                                                                                                       |
+| unlimited_token           | boolean               | Whether to set the link token to be infinite. The default value is false and the validity period is 24 hours.                                                                                                                                                                                       |
+| reset_admin_password      | boolean               | Whether to reset the password. The default value is false. When the value is true, the password will be reset to "73@TuGraph"。                                                                                                                                                                      |
+| enable_fulltext_index     | boolean               | Whether to enable the full-text index function, the default value is false.                                                                                                                                                                                                                         |
+| fulltext_analyzer         | string                | Full-text index tokenizer type. Can be set to `StandardAnalyzer` or `SmartChineseAnalyzer`. Default is `StandardAnalyzer`                                                                                                                                                                           |
+| fulltext_commit_interval  | int                   | Full-text index data submission period, for write operations, in seconds. The default is 0, which commits immediately.                                                                                                                                                                              |
+| fulltext_refresh_interval | int                   | Full-text index data refresh cycle, for read operations, in seconds. The default is 0, and the latest written data can be read immediately.                                                                                                                                                         |
+| ha_conf                   | string                | Initialize the HA cluster according to host1:port1,host2:port2,host3:port3, the default value is empty.                                                                                                                                                                                             |
+| ha_node_join_group_s      | int                   | The waiting time for a node to try to join the high availability cluster, in seconds, the default is 10.                                                                                                                                                                                            |
+| ha_bootstrap_role         | int                   | Whether to use bootstrap to start, and the server role to start using this method, 0 means not to use bootstrap to start, 1 means to use bootstrap to start and this node is a leader, 2 means to use bootstrap to start and this node is a follower, only these 3 options. The default value is 0. |
+| help                      | boolean               | Print the help message. The default value is false.                                                                                                                                                                                                                                                 |
+
+### 4.2.Server configuration file
+
+TuGraph's configuration file is stored in JSON format. It is recommended that most configuration be stored in configuration files and that some configuration parameters be modified only temporarily using command-line options when needed.
+
+A typical configuration file looks like this:
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..4f363b5a53
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,168 @@
+# High Availability mode
+
+> This document describes the principles, preparations, and server operations of the high availability mode
+
+## 1.Theory
+
+TuGraph provides high availability (HA) mode through multi-machine hot backup. In high availability mode, write operations to the database will be synchronized to all servers (non-witness), so that even if some servers are down, the availability of the service will not be affected.
+
+When the high-availability mode is started, multiple TuGraph servers form a backup group, which is a high-availability cluster. Each backup group consists of three or more TuGraph servers, one of which serves as the `leader` and the other replication group servers as `followers`. Write requests are served by a `leader`, which replicates and synchronizes each request to a `follower` and can only respond to the client after the request has been synchronized to the server. This way, if any server fails, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically select a new `leader`.
+
+TuGraph's high-availability mode provides two types of nodes: `replica` nodes and `witness` nodes. Among them, the `replica` node is an ordinary node, has logs and data, and can provide services to the outside world. The `witness` node is a node that only receives heartbeats and logs but does not save data. According to deployment requirements, `leader` nodes and `follower` nodes can be flexibly deployed as `replica` nodes or `witness` nodes. Based on this, there are two deployment methods for TuGraph high-availability mode: one is the ordinary deployment mode, and the other is the simple deployment mode with witness.
+
+For normal deployment mode, `leader` and all `followers` are nodes of type `replica`. Write requests are served by a `leader`, which copies each request to a `follower` and cannot respond to the client until the request has been synchronized to more than half of the servers. This way, if less than half of the servers fail, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically elect a new `leader` to ensure data consistency and service availability.
+
+However, when the user server resources are insufficient or a network partition occurs, a normal HA cluster cannot be established. At this time, since the `witness` node has no data and takes up little resources, the `witness` node and the `replica` node can be deployed on one machine. For example, when there are only 2 machines, you can deploy the `replica` node on one machine, and the `replica` node and `witness` node on another machine, which not only saves resources, but also does not require log application To the state machine, there is no need to generate and install snapshots, so the response to requests is very fast, and it can help quickly elect a new leader when the cluster crashes or the network is partitioned. This is the simple deployment mode of the TuGraph HA cluster. Although `witness` nodes have many benefits, since there is no data, the cluster actually adds a node that cannot become `leader`, so the availability will be slightly reduced. To improve the availability of the cluster, you can allow the `witness` node to be the leader temporarily by specifying the `ha_enable_witness_to_leader` parameter as `true`. After the `witness` node synchronizes the new log to other nodes, it will actively switch the leader role to the node with the latest log.
+
+This feature is supported in version 3.6 and above.
+
+## 2.Preparation
+
+To enable high availability mode, users need to:
+
+- Three or more instances of TuGraph servers.
+- To enable high availability mode when starting lgraph_server, the 'enable_ha' option can be set to 'true' using a configuration file or the command line.
+- Set the correct rpc_port through the configuration file or command line
+
+## 3.Start the initial backup group
+
+After installing TuGraph, you can use the `lgraph_server` command to start a high-availability cluster on different machines. This section mainly explains how to start a high-availability cluster. For cluster status management after startup, see [lgraph_peer tool](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.The initial data is consistent
+
+When the data in all servers is the same or there is no data at startup, the user can
+specify `--ha_conf host1:port1,host2:port2` to start the server.
+In this way, all prepared TuGraph instances can be added to the initial backup group at one time,
+All servers in the backup group elect `leader` according to the RAFT protocol, and other
+servers join the backup group with the role of `follower`.
+
+An example command to start an initial backup group is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+After the first server is started, it will elect itself as the 'leader' and organize a backup group with only itself.
+
+### 3.2.Inconsistent initial data
+If there is already data in the first server (imported by the `lgraph_import` tool or transferred from a server in non-high availability mode),
+And it has not been used in high-availability mode before, the user should use the boostrap method to start. Start the server with data in bootstrap
+mode with the `ha_bootstrap_role` parameter as 1, and specify the machine as the `leader` through the `ha_conf`
+parameter. In bootstrap mode, the server will copy its own data to the new server before adding the newly
+joined server to the backup group, so that the data in each server is consistent.
+
+An example command to start a data server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+Other servers without data need to specify the `ha_bootstrap_role` parameter as 2, and specify the `leader` through the `ha_conf` parameter. The command example is as follows
+
+```bash
+**$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**You need to pay attention to two points when using bootstrap to start an HA cluster:**
+1. You need to wait for the `leader` node to generate a snapshot and start successfully before joining the `follower` node, otherwise the `follower` node may fail to join. When starting the `follower` node, you can configure the `ha_node_join_group_s` parameter to be slightly larger to allow multiple waits and timeout retries when joining the HA cluster.
+2. The HA cluster can only use the bootstrap mode when it is started for the first time. It can only be started in the normal mode (see Section 3.1) when it is started later. In particular, multiple nodes of the same cluster cannot be started in the bootstrap mode, otherwise it may cause Data inconsistency
+
+## 4.Start witness node
+
+### 4.1. Witness nodes are not allowed to become leader
+
+The startup method of `witness` node is the same as that of ordinary nodes. You only need to set the `ha_is_witness` parameter to `true`. Note that the number of witness nodes should be less than half of the total number of cluster nodes.
+
+An example command to start the witness node server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+Note: By default, the `witness` node is not allowed to become the `leader` node, which can improve the performance of the cluster, but will reduce the availability of the cluster when the `leader` node crashes.
+
+### 4.1. Allow witness nodes to become leaders
+
+You can specify the `ha_enable_witness_to_leader` parameter as `true`, so that the `witness` node can temporarily become the `leader` node, and then actively switch to the master after the new log synchronization is completed.
+
+An example of the command to start the `witness` node server that is allowed to become the `leader` node is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+Note: Although allowing `witness` nodes to become `leader` nodes can improve the availability of the cluster, it may affect data consistency in extreme cases. Therefore, it should generally be ensured that the number of `witness` nodes + 1 is less than half of the total number of cluster nodes.
+
+## 5.Scale out other servers
+
+After starting the initial backup group, if you want to scale out the backup group, add new servers to the backup group,
+The `--ha_conf HOST:PORT` option should be used, where `HOST` can be the IP address of any server already in this backup group,
+And `PORT` is its RPC port. E.g:
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+This command will start a TuGraph server in high availability mode and try to add it to the backup group containing the server `172.22.224.15:9090`.
+Note that joining a backup group requires a server to synchronize its data with the backup group's `leader` server, and this process may take a considerable amount of time, depending on the size of the data.
+
+## 6.Stopping the Server
+
+When a server goes offline via 'CTRL-C', it will notify the current 'leader' server to remove the server from the backup group. If the leader server goes offline, it will pass the leader identity permission to another server before going offline.
+
+If a server is terminated or disconnected from other servers in the backup group, the server is considered a failed node and the leader server will remove it from the backup group after a specified time limit.
+
+If any server leaves the backup group and wishes to rejoin, it must start with the '--ha_conf {HOST:PORT}' option, where 'HOST' is the IP address of a server in the current backup group.
+
+## 7.Restarting the Server
+
+Restarting the entire backup group is not recommended as it disrupts service. All servers can be shut down if desired. But on reboot,
+It must be ensured that at least N/2+1 servers in the backup group at shutdown can start normally, otherwise the startup will fail. and,
+Regardless of whether `enable_bootstrap` is specified as true when initially starting the replication group, restarting the server only needs to pass
+Specify the `--ha_conf host1:port1,host2:port2` parameter to restart all servers at once. The command example is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker deploys a highly available cluster
+In real business scenarios, it is likely to encounter the need to deploy high-availability clusters on multiple operating systems or architectures.
+Differentiated environments may cause some dependencies to be missing when compiling TuGraph. therefore,
+Compiling software in docker and deploying high-availability clusters is very valuable. Take the centos7 version of docker as an example,
+The steps to deploy a highly available cluster are as follows.
+
+### 8.1.Install mirror
+Use the following command to download TuGraph's compiled docker image environment
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+Then pull the TuGraph source code and compile and install
+
+### 8.2.Create container
+Use the following command to create a container, use `--net=host` to make the container run in host mode, in this mode
+Docker and the host machine share the network namespace, that is, they share the same IP.
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.Start service
+Use the following command to start the service on each server, because docker and the host share IP, so you can directly specify to start the service on the host IP
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.Server Status
+
+The current status of the backup group can be obtained from the TuGraph visualization tool, REST API, and Cypher query.
+
+In the TuGraph visualization tool, you can find the list of servers and their roles in the backup group in the DBInfo section.
+
+With the REST API, you can use `GET /info/peers` to request information.
+
+In Cypher, the `CALL dbms.listServers()` statement is used to query the status information of the current backup group.
+
+## 10.Data synchronization in high availability mode
+
+In high availability mode, different servers in the same backup group may not always be in the same state. For performance reasons, if a request has been synchronized to more than half of the servers, the leader server will consider the request to be in the committed state. Although the rest of the servers will eventually receive the new request, the inconsistent state of the servers will persist for some time. A client may also send a request to a server that has just restarted, thus having an older state and waiting to join a backup group.
+
+To ensure that the client sees consistently continuous data, and in particular to get rid of the 'reverse time travel' problem, where the client reads a state older than it has seen before, each TuGraph server keeps a monotonically increasing data version number. The mapping of the data version number to the database state in the backup group is globally consistent, meaning that if two servers have the same data version number, they must have the same data. When responding to a request, the server includes its data version number in the response. Thus, the client can tell which version it has seen. The client can choose to send this data version number along with the request. Upon receiving a request with a data version number, the server compares the data version number to its current version and rejects the request if its own version is lower than the requested version. This mechanism ensures that the client never reads a state that is older than before.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..bf30d63598
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+Installation And Running
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..80655596ea
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,474 @@
+# Data Importing
+
+> This document describes the data import function of TuGraph. These include delimiters in CSV format, sample formats for jsonline, and two modes for importing online and offline.
+
+## 1. Introduction
+
+After the installation is successful, you can use the `lgraph_import` batch import tool to import existing data into TuGraph. `lgraph_import` supports importing data from CSV files and JSON data sources.
+
+> `sonline format, a row of a json array string`
+
+> CSV format
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline format
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph supports two data importing modes：
+
+- _offline_：Read the data and import it into a data file for the specified server, it should only be done when the server is offline.
+- _online_：Read the data and send it to the running server, which then imports the data into its database.
+
+## 2.CSV file format delimiter
+
+    CSV delimiters can be single-character or multi-character strings, which cannot contain 'r' or 'n'. Note that different shells handle input strings differently, so different escape handling may be required for different shell input parameters.
+
+In addition, 'lgraph_import' also supports the following escape characters for entering special symbols:
+
+| Escape character | Instructions                                                                                              |
+| ---------------- | --------------------------------------------------------------------------------------------------------- |
+| \\               | The backslash`\\`                                                                                         |
+| \\a              | ASCII code 0x07                                                                                           |
+| \\f              | form-feed，ASCII code 0x0c                                                                                |
+| \\t              | Horizontal tab characters， ASCII code 0x09                                                               |
+| \\v              | Vertical tab characters， ASCII code 0x0b                                                                 |
+| \\xnn            | Two hexadecimal digits representing one byte，example \\x9A                                               |
+| \\nnn            | A three-digit octal number representing a single byte，example \\001, \\443，data range cannot exceed 255 |
+
+Demo：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.The configuration file
+
+    `lgraph_import`tool configures the environment using the specified configuration file. The configuration file describes the paths to the input files, the vertices/edges they represent, and the vertex/edge format.
+
+### 3.1.Configuration File Format
+
+The configuration file consists of two parts: schema and files. The 'schema' part defines label, and the 'files' part describes the data files to be imported.
+
+#### 3.1.1.The keyword
+
+- schema (Array）
+  - label（required，string）
+  - type（required， VERTEX or EDGE）
+  - properties（Array，required for vertex，If there is no property for the edge, you can leave it unconfigured）
+    - name（required, string）
+    - type （required,，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（optional，Indicates that the field can be configured or not configured）
+    - index（optional，Whether the field needs to be indexed）
+    - unique（optional, whether the field indexed and is of type unique）
+    - pair_unique（optional, whether the field indexed and is of type pair_unique）only one unique and pair_unique can be set. Setting up and running at the same time will terminate due to an input exception
+  - primary (vertex-only configuration, specify a property that uniquely identifies a point in the primary key field)
+  - temproal (edge-only configuration, optional, specifies the timestamp field for storage tier sorting)
+  - temporal_field_order (edge-only configuration, optional, the default value is ASC, indicating the ascending order, or DESC, indicating the descending order)
+  - constraints (edge-only configuration, optional, array form, start and end labels, unconfigured or empty means unrestricted)
+  - detach_property (optional, both Edge and Vertex can config，default is `false`. `true` means the property data is stored in detached model, which can reduce io read amplification in cases with less memory and much property data.)
+- files （Array）
+  - path（required，string，The value can be a file path or a directory path. If it is a directory, all files in the directory will be imported. Ensure that they have the same schema）
+  - header（Optional, numeric, header in the first few lines of the file, or 0）
+  - format（required，JSON or CSV）
+  - label（required，string）
+  - columns（Array）
+    - SRC_ID (Special string，only on the edges,That means this column is the source data)
+    - DST_ID (A special string, only on the edges, indicates that this column is the destination data)
+    - SKIP   (A special string to skip this column of data)
+    - [property]
+  - SRC_ID (Edge-only configuration. The value is the start label)
+  - DST_ID (Edge-only configuration. The value is the destination point label)
+
+#### 3.1.2.length of index
+TuGraph has a limit on the length of the key, when we creating an index for a column with a long attribute, it will be truncated. If it is a unique index, it should be noted that the content retained after truncation is still unique. In addition, when iterating through the index, the obtained key is truncated and may not be as expected. The truncation length is different for different types of indexes.
+##### 3.1.2.1.unique索引
+The unique index is globally unique, and the maximum length of the key is 480 bytes. primary is a special unique index, so the maximum key length is also 480 bytes
+##### 3.1.2.2.pair_unique索引
+The pair_unique index is a unique index between two points. This type of index can only be created in the schema of the edge. This index follows the user-specified key with the vid of the source and destination vertex, each of vid is 5 bytes long. Therefore, the maximum length of key is 470 bytes.
+##### 3.1.2.3.非唯一索引
+A non-unique index is one in which neither unique nor pair_unique is set to 1. In the TuGraph implementation, a key of this type index may map to multiple values. In order to speed up lookup and writing, a user-specified key is followed by the maximum value in a set of vids or euids. When a non-unique index created in a vertex schema, key is followed by vid, each vid is 5 bytes long, so the maximum length is 475 bytes. When a non-unique index created in a edge schema, key is followed by euid, each euid is 24 bytes long, so the maximum length is 456 bytes.
+
+### 3.2.Example Configuration File
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+For the above Example Configuration File, three labels defined: two point types' actor 'and' movie ', and one edge type 'role'. Each label describes: the name of the label, the type (dot or edge), which attribute fields are available, and the type of each field. For points, the primary field also defined; For edges, the constraints field also defined, which limits the starting and ending points of the edges.
+
+It also describes three data files, two dot data files' actors.csv 'and' movies.csv ', and one edge data file 'roles.csv'. Each section describes the path of the file, the format of the data, the first few lines of the header, the label of the data, and the corresponding field of each column in each row of data in the file.
+
+For the above configuration files, the import tool will first create labels' actor ', 'movie', and 'role' in TuGraph, and then perform data import of the three files.
+
+## 4.Offline full import
+
+The offline mode can be used only on offline servers. An offline import creates a new graph, so it's more suitable for your first data import on a newly installed TuGraph server.
+
+To use the 'lgraph_import' tool in offline mode, you can specify the 'lgraph_import --online false' option. To see the command-line options available, use 'lgraph_import --online false --help' :
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+Command line arguments:
+
+- **-c, --config_file** `config_file`: Import the configuration file name in the following format:
+- **--log** `log_dir`: Log directory. The default is an empty string, in which case the log information output to the console.
+- **--verbose** `0/1/2`: Log level. The higher the log level, the more detailed the output information is. The default value is 1.
+- **-i, --continue_on_error** `true/false`: If an error occurs, skip the error and continue. The default is false. If an error occurs, exit.
+- **-d, --dir** `{diretory}`:The database directory to which the import tool will write data. Default is'./db '.
+- **--delimiter** `{delimiter}`: Data file separator. This is used only when the data source is in CSV format. The default is', '。
+- **-u, --username** `{user}`: Username of the database. You need to be an administrator to perform offline import.
+- **-p, --password** `{password}`: Specifies the password of the database user
+- **--overwrite** `true/false`: Whether to overwrite data. When set to true, the data directory overwritten if it already exists. Default to 'false'.
+- **-g, --graph** `{graph_name}`: Specify the kind of graph to import.
+- **-h, --help**: The help information displayed.
+
+### 4.1.Offline Import Example
+
+    In this example, we use the movie-actor data described above to demonstrate the use of the import tool. The data to be imported is divided into three files: 'movies.csv', 'actors.csv', and 'roles.csv'.
+
+'movies.csv' contains information about movies, where each movie has an id (as a primary key for retrieval), and each movie also has attributes such as title, year, and rating. (Data from [IMDb](http://www.imdb.com)).
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+> The jsonline format is as follows:
+> All fields can be strings, which will be converted to the corresponding type when imported
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`It contains information about the actors. Each actor also has an id, as well as properties such as name.
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`It contains information about which role an actor played in which movie. Each row records a character played by a given actor in a given movie, corresponding to an edge in the database.`SRC_ID` and `DST_ID` are the source and target vertices of the edge, which are the 'primary' properties defined in 'actors.csv' and 'movies.csv', respectively.
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+'configuration file import.conf', notice that there are two HEADER lines in each file, so we need to specify the 'HEADER=2' option.
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+Using the import configuration file, we can now import data using the following command:
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # Read configuration information from import.conf
+        --dir /data/lgraph_db      # Store the data in /data/lgraph_db
+        --graph mygraph            # Import the graph named mygraph
+```
+
+**Notice**：
+
+- If a graph named 'mygraph' already exists, the import tool will print an error message and exit. To force a graph to be overwritten, use the '--overwrite true' option.
+- Configuration and data files must be stored in UTF-8 encoding (or normal ASCII encoding, which is a subset of UTF-8). If any file uses an encoding other than UTF-8 (for example, UTF-8 with BOM or GBK), the import will fail and output a profiler error.
+
+## 5.Online incremental Import
+
+The online import mode can be used to import a batch of files into an already running instance of TuGraph. This is handy for processing incremental batch updates that typically occur at fixed intervals. The 'lgraph_import --online true' option enables the import tool to work in online mode. Like offline mode, online mode has its own set of command-line options, which can be printed using the '-h, --help' options:
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+The configuration related to the file specified in the configuration file, and its format is exactly the same as' offline mode '. However, instead of importing the data into a local database, we are now sending the data to a running TuGraph instance, which is typically running on a different computer than the client machine on which the import tool is running. Therefore, we need to specify the URL, DB user, and password for the HTTP address of the remote machine.
+
+If the user and password are valid, and the specified graph exists, the import tool sends the data to the server, which then parses the data and writes it to the specified graph. The data will be sent in a packet of about 16 MB, interrupted at the nearest newline. Each package imported atomically, which means that if the package is successfully imported, all data is successfully imported; otherwise, none of the data enters the database. If '--continue_on_error true' is specified, data integrity errors are ignored and offending lines are ignored. Otherwise, the import stops at the first error package and prints out the number of packages that have been imported. In this case, the user can modify the data to eliminate errors, and then use '--skip_packages N' to redo the import to skip the imported packages.
+
+## 6. Online full import
+
+Online full import can be used to import a batch of files into a running TuGraph instance. TuGraph supports importing two different types of data into the instance online:
+1. Original data files of the same type as the offline import (csv, etc.)
+2. The underlying storage file of TuGraph is the data.mdb file. This file can be generated by offline import, or it can be a file of other TuGraph db.
+The applicable scenarios of these two methods are different. The first method is to directly import data into TuGraph. The advantage is that it is automatically imported at one time and the operation steps are simple. However, an offline import thread will be started on the server side, which is only suitable for small-scale data import in a stand-alone situation. The second is to import the prepared underlying storage files into TuGraph. Although the mdb file needs to be prepared in advance, it does not have high requirements on system resources. It also supports remote download and file import, which is very convenient and suitable for high availability. Online import of schema or large-scale data.
+
+### 6.1 Import from original data
+The execution method of importing from the original data is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and The data files of the temporary db are migrated to the new subgraph, and finally the metadata of the instance is refreshed. Compared with online incremental import, online full import has higher performance. The `lgraph_import --online true --online_type 1` option enables the import tool to fully import online. Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+Online full import can be used to import a batch of files into an already running TuGraph instance. The execution method is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and stores the data in the temporary db. The files are migrated to the new subgraph, and finally the instance's metadata is refreshed. Compared with online incremental import, online full import has higher performance and is suitable for processing large-scale data. The `lgraph_import --online true --full true` option enables the import tool to fully import online.
+Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+The relevant configuration of the file is specified in the configuration file, and its format is exactly the same as in `offline mode`. However, instead of importing the data into a local database, we now import the data into a running TuGraph instance, which is typically running on a different machine than the client machine running the import tool. Therefore, we need to specify the URL, DB user and password of the remote computer's HTTP address. Moreover, the configuration file (config_file parameter) is required to be the uri path on the TuGraph instance machine, and its file configuration is also required to be the absolute path of the resource on the TuGraph instance machine.
+
+If the user and password are valid, the import tool will perform an online full import on the server side. If the graph you want to import already exists, you can use the `--overwrite true` option to force overwriting of the subgraph.
+
+### 6.2 Import from database file
+Although the full online import of original data is simple to operate and has high performance, it requires high server resources and takes a long time. A more general way is to first use offline import to import the subgraph in an empty db, obtain the data.mdb file, and then import the file into the TuGraph service online. How to use it is as follows:
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+In addition to the url, user and password parameters used in ordinary online import, the online full import method imported from a database file uses the graph parameter to specify the name of the imported subgraph, the path parameter to specify the file path, and remote to specify whether the file exists remotely or locally. If it is a local file, you need to ensure that all nodes in the HA cluster have the file in the path. If it is a remote file, it will be downloaded first and then imported. It should be noted that since there is only one copy of data.mdb, it is necessary to ensure that the environment of each node of HA and the machine where data.mdb is generated offline are completely consistent to ensure that no environmental problems will occur.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..b1ad57de6f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# Data Export
+
+> This document mainly introduces the data export function of TuGraph.
+
+## 1.Introduction
+
+TuGraph can use the tool `lgraph_export` to export data from the database that has been imported successfully. The 'lgraph_export' tool can export the data of the specified TuGraph database to the specified directory in the form of 'csv' or 'json' file, and export the configuration file 'import.config'. That required for re-importing the data.
+
+## 2.Data Export
+
+The following is an example of a command for the tool:
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+Details:
+
+- `-d {database_dir}` specifies the directory of the database from which the data will be exported. The default value is./testdb '.
+- `-e {export_destination_dir}` specifies the directory where the export file is stored. The default value is./exportdir.
+- `-g {graph_to_use}` specifies the type of graph database. default is' default '.
+- `-u {username}` Specifies the name of the user who performs the export operation.
+- `-p {password}` Specifies the password of the user who performs the export operation.
+- `-s {field_separator}` specifies the separator for the exported file. The default is comma.
+- `-f {output_format}` specifies the format of the exported data. It can be 'json' or 'csv'.
+- `-h` In addition to the specified parameters, you can also use this parameter to view the help of the tool.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..fa1839724b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,32 @@
+# Backup and Restore
+
+> This document mainly introduces the data backup and restore function of TuGraph.
+
+## 1.Data Backup
+
+TuGraph can use the 'lgraph_backup' tool to backup data.
+The 'lgraph_backup' tool can backup data from a TuGraph database to another directory. It can be used as follows:
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+Details:
+
+- `-s {source_dir}` specifies the directory where the database (source database) to be backed up resides.
+- `-d {destination_dir}` specifies the directory where the backup file (destination database) is stored.
+  If the target database is not empty, 'lgraph_backup' prompts you whether to overwrite the database.
+- `-c {true/false}` indicates whether a compaction occurs during backup.
+  Every compaction creates a tighter backup, but every compaction takes longer to create. This option defaults to 'true'.
+
+## 2.Data Restore
+
+The target database `{destination_dir}` obtained using the `lgraph_backup` tool backs up all subgraphs of the source database `{source_dir}`, but does not include the raft information of the HA cluster, thereby ensuring that the service and cluster can be successfully restarted with the backup database and the data is consistent with the source database. The following command can be used to restart the service with the backup database. When the service starts, the storage process of all subgraphs will be restored to ensure that the backup service is completely consistent with the original service.
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+Details
+
+- `-d {destination_dir}` Specify the directory where the backup file (target database) is located.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..6782a43d0e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# Data Warmup
+
+> This document mainly introduces the data Warmup function of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a disk-based database where data loaded into memory only when accessed. Therefore, for a period of time after the server just turned on, the system performance may be degraded due to frequent IO operations. At this point, we can improve this problem by data warm-up.
+
+## 2.lgraph_warmup
+
+Data warmup can be done using the tool lgraph_warmup. An example of its use is as follows:
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+Details:
+
+The - '-d {db_dir}' option specifies the data directory for the TuGraph server
+
+The - '-g {graph_list}' option specifies the names of graphs to be warmed-up, separated by commas
+
+The warm-up process takes different times depending on the data size and the type of disk being used. Preheating a large database on a mechanical disk may take a long time. Please wait patiently.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..d830586b92
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# Cluster management
+
+> This document mainly introduces the management tools of TuGraph HA cluster, including the functions of deleting nodes, leader transfer and generating snapshots.
+
+## 1 Introduction
+
+After the HA cluster is started, you can use the `lgraph_peer` tool for cluster management, which can perform functions such as deleting nodes, transferring leaders, and generating snapshots.
+
+## 2. Delete node
+
+For nodes in the TuGraph HA cluster that are offline for a long time or have network partitions, you can use the `remove_peer` command of `lgraph_peer` to delete the node. An example command is as follows:
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command remove_peer` specifies that the operation to be performed is remove_peer, that is, delete the node.
+- `--peer {peer_id}` specifies the rpc network address of the node to be deleted, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 3. leader transfer
+
+When you need to shut down or restart the master node, in order to reduce the unserviceable time of the cluster, you can use the `transfer_leader` command of `lgraph_peer` to transfer the master node. An example command is as follows:
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command transfer_leader` specifies that the operation to be performed is transfer_leader, that is, transferring the master node.
+- `--peer {peer_id}` specifies the rpc network address to become the master node, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 4. Generate snapshot
+
+For reasons such as setting ha_snapshot_interval_s to -1 when the node starts so that snapshots are not taken by default or other reasons,
+when you need to tell a node generate a snapshot, you can use the `snapshot` command of `lgraph_peer`. An example command is as follows:
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+in:
+
+- `--command snapshot` specifies that the operation to be performed is snapshot, that is, generating a snapshot.
+- `--peer {peer_id}` specifies the rpc network address of the node to generate a snapshot, such as `127.0.0.1:9092`.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..dd74d08869
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,145 @@
+# Tugraph CLI
+
+> This document mainly introduces the CLI tool lgraph_cypher of TuGraph.
+
+## 1.Instructions
+
+The TuGraph release comes with a query client named 'lgraph_cypher' that can be used to submit OpenCypher requests to the TuGraph server. The 'lgraph_cypher' client has two execution modes: single command mode and interactive mode.
+
+## Single command mode
+
+In single-command mode, 'lgraph_cypher' can be used to submit a single Cypher query and print the result directly to the terminal. The printed result can also be easily redirected to a specified file. This is handy when users need to get a lot of results from the server and save them in files.
+
+In this mode, the 'lgraph_cypher' tool has the following options:
+
+### Command line Parameters:
+
+| Parameter | Type   | Instructions                                                                                                                                                                                                                           |
+| --------- | ------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| --help    | \\     | List all parameters and descriptions.                                                                                                                                                                                                  |
+| -example  | \\     | List the command instances.                                                                                                                                                                                                            |
+| -c        | string | A database configuration file used to obtain ip and port information.                                                                                                                                                                  |
+| -h        | string | Database server IP address. Omit this parameter if you have a configuration file. The default value is' 127.0.0.1 '                                                                                               |
+| -p        | string | Database server port. Omit this parameter if you have a configuration file. The default value is 7071                                                                                                                                  |
+| -u        | string | User name for logging in to the database.                                                                                                                                                                                              |
+| -P        | string | Password for logging in to the database.                                                                                                                                                                                               |
+| -f        | string | Contains the path to a single Cypher query single text file.                                                                                                                                                                           |
+| -s        | string | Single-line cypher query command. Start and end with `"`.                                                                                                                                                                              |
+| -t        | int    | Specifies the server timeout threshold for cypher queries. The default value is 150 seconds.                                                                                                                                           |
+| -format   | string | Query result display mode. Supports two formats: 'plain' and 'table'. The 'plain' format prints the query results in a single column. The 'table' format displays the query results in a tabular format. The default value is' table ' |
+
+### Examples:
+
+**cypher command file query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+
+```
+
+**cypher command single-sentence query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+
+```
+
+## Interactive mode
+
+'lgraph_cypher' can also be run in interactive mode. In interactive mode, the client stays connected to the server and interacts with the user in read-evaluate-print-loop.
+
+### Enter lgraph_cypher interaction mode:
+
+If no '-f' or '-s' command line option added, 'lgraph_cypher' will enter interactive mode when running. how to use it:
+
+```
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+
+```
+
+If the login is successful, the corresponding login success message will be displayed:
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2018 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+Now we also provide an interactive shell for users to enter Cypher queries or use the ':help' command to check for available commands.
+
+### Command Description
+
+In addition to the Cypher query, the shell of 'lgraph_cypher' accepts the following commands:
+
+| Command                  | Parameters                                         | instructions                                                                                                                                              |
+| ------------------------ | -------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                                 | Displays the server information and the corresponding description of all commands.                                                                        |
+| :db_info                 | \\                                                 | Query the current server status. /db/info for the corresponding REST API.                                                                                 |
+| :clear                   | \\                                                 | Clear the screen.                                                                                                                                         |
+| :use                     | {Graph Name}                                       | The graph specified with this name defaults to `default`                                                                                                  |
+| :source                  | `-t {Query the timeout value} -f {The query file}` | cypher command file query in interactive mode. The default timeout threshold is 150 seconds. Query file format reference No interactive query parameters. |
+| :exit                    | \\                                                 | Exit interactive mode and return to the original command line.                                                                                            |
+| :format                  | `plain` or `table`                                 | Change the display mode of cypher query results. Support 'plain' and 'table' modes.                                                                       |
+| :save all/command/result | `-f {The file path}` `{Cypher}`                    | The cypher command (command), query result (result) or both (all) are stored. The default location is' /saved_cypher.txt '                                |
+
+**Note:**
+
+- Each command should start with a colon `:`.
+
+**:save command example :**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+
+```
+
+### cypher query command:
+
+In interactive mode, users can also directly input a single sentence cypher command for query, with "'; ` "end. Enter commands that are case insensitive. Here's an example:
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher` supports multi-line input when typing commands. Users can use the `ENTER` key to type long query statements into multiple lines. In the case of multi-line input, the beginning of the command line will change from `>` to `=>`, and the user can continue to type the rest of the query.
+
+Example:
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### Auxiliary Features:
+
+**Input History:** Press the up and down arrow keys in interactive mode to display the input history.
+
+**Auto Completion:** lgraph_cypher will automatically complete based on the input history. In the event of a completion prompt, pressing the right arrow key will automatically complete the command.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..bee9d4c8df
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,440 @@
+# TuGraph DataX
+
+> This document mainly introduces the installation, compilation and usage examples of TuGraph DataX
+
+## 1.Introduction
+
+On the basis of Ali's open source DataX, TuGraph implements the support of writing plug-ins and jsonline data format, and other data sources can write data into TuGraph through DataX.
+TuGraph DataX introduces [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX), Supported features include:
+
+- Import TuGraph from various heterogeneous data sources such as MySQL, SQL Server,Oracle, PostgreSQL, HDFS, Hive, HBase, OTS, ODPS, Kafka and so on. 
+  
+- Import TuGraph to the corresponding target source (to be developed).
+
+Reference for DataX Original Project Introduction [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.Compile and Install
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+The compiled DataX file is in the target directory
+
+## 3.Text data imported into TuGraph with DataX
+
+Using the data from the lgraph_import section of the TuGraph manual as an example, we have three csv data files, as follows:
+`actors.csv`
+
+```
+
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+
+```
+
+`movies.csv`
+
+```
+
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+
+```
+
+`roles.csv`
+
+```
+
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+
+```
+
+Then create three DataX job profiles:
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`/lgraph_server -c lgraph_standalone.json -d 'run'` 'Start TuGraph and run the following commands in sequence:
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## MySQL's data imported into TuGraph with DataX
+
+We create the following table of movies under 'test' database
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+Insert some data into the table
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+Create a DataX job configuration file
+
+`job_mysql_to_tugraph.json`
+
+**Configuring Field**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**Write simple sql**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` Start TuGraph and run the following command：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..a01cf32e66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph Explorer
+
+> TuGraph Explorer has merged to [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..8519247cc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Utility Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..8ebe10da56
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/1.python-client.md
@@ -0,0 +1,222 @@
+# TuGraph Python SDK
+
+> This document is the usage instruction of TuGraph Python SDK
+
+## 1.Overview
+There are two kinds of Python's TuGraph Client. One is the RESTful Client, which uses the HTTP method to send requests to the server. The other is the RPC Client, which uses the RPC method to call the server remote service. Both have their own advantages and disadvantages. The RESTful client is simple to use. You can find the source code file of the Client in the src/client/python/TuGraphClient directory of the project. You can install it directly into the user environment and use it. However, it supports fewer functions and its performance is not high. RPC Client supports both stand-alone servers and high-availability clusters and load balancing. It has many interfaces and powerful functions. However, the usage is more complicated. Users need to compile the TuGraph project themselves to obtain liblgraph_client_python.so, or directly find the dependent library in the /usr/local/lib64 directory when using the runtime image, and introduce it into the python project for normal use. Next, the usage of these two Clients will be introduced in detail.
+
+## 2.RESTful Client
+
+### 2.1. Install Client
+
+TuGraph's Python RESTful client uses the setuptools tool for packaging and distribution. Users can install the client directly into the local environment and introduce it directly when using it.
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+Note: When using the setuptools tool to install the python client, dependencies such as httpx will be installed and need to be executed in an environment with external network access.
+
+### 2.2.Call cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.Call stored procedure
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python's TuGraph Rpc Client is a CPP Client SDK packaged using pybind11. The following table lists the correspondence between Python and CPP Client SDK.
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+The use of Python RPC Client is more complicated. Users can compile TuGraph in the local environment to get liblgraph_client_python.so, or they can use the official runtime image. The dependent library can be found directly in the /usr/local/lib64 directory in the image. It can be used after introducing the user project.
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.Instantiate the client object
+
+#### 3.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+
+#### 3.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 3.2.Call cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.3.Send cypher request to leader
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.4.Call GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.5.Send GQL request to leader
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.6.Calling stored procedures
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.7.Call the stored procedure to the leader
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 3.8.Load stored procedure
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 3.9.List stored procedures
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.10.Delete stored procedures
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 3.11.Import schema from byte stream
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.12.Import edge data from byte stream
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 3.13.Import schema from file
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.14.Import point and edge data from file
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..260a8c6c29
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,339 @@
+# TuGraph C++ SDK
+
+> This document is the usage instruction of TuGraph C++ SDK
+
+## 1.Instructions
+
+C++ Client can use RPC to connect to lgraph_server to import data, execute stored procedures, call Cypher and other operations.
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+#### 2.1.1. Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2. Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3. Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.3. Send cypher request to leader
+```C++
+     std::string str;
+     bool ret = client.CallCypherToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0);
+     @param [out] result The result.
+     @param [in] cypher inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```C++
+     std::string str;
+     bool ret = client.CallGql(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGql(std::string& result, const std::string& gql,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0, const std::string& url = "");
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @param [in] url (Optional) Node address of calling gql.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.5. Send GQL request to leader
+```C++
+     std::string str;
+     bool ret = client.CallGqlToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGqlToLeader(std::string& result, const std::string& gql,
+                  const std::string& graph = "default", bool json_format = true,
+                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```C++
+     std::string str;
+     bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedure(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true,
+                        const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] url (Optional) Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```C++
+     std::string str;
+     bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true);
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+
+### 2.8. Load stored procedure
+```C++
+     std::string str;
+     bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+     bool LoadProcedure(std::string& result, const std::string& source_file,
+                        const std::string& procedure_type, const std::string& procedure_name,
+                        const std::string& code_type, const std::string& procedure_description,
+                        bool read_only, const std::string& version = "v1",
+                        const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] source_file the source_file contain procedure code.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] code_type code type, currently supported PY, SO, CPP, ZIP.
+     @param [in] procedure_description procedure description.
+     @param [in] read_only procedure is read only or not.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```C++
+     std::string str;
+     bool ret = client.ListProcedures(str);
+```
+```
+     bool ListProcedures(std::string& result, const std::string& procedure_type,
+                         const std::string& version = "any",
+                         const std::string& graph = "default", const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type (Optional) the procedure type, "" for all procedures,
+                                  CPP and PY for special type.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] url Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, the request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```C++
+     std::string str;
+     bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+     bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                          const std::string& procedure_name, const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```C++
+     std::string str;
+     bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+     bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                  const std::string& graph = "default", bool json_format = true,
+                                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema the schema to be imported.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```C++
+     std::string str;
+     ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+     bool ImportDataFromContent(std::string& result, const std::string& desc,
+                                const std::string& data, const std::string& delimiter,
+                                bool continue_on_error = false, int thread_nums = 8,
+                                const std::string& graph = "default", bool json_format = true,
+                                double timeout = 0);
+     @param [out] result The result.
+     @param [in] desc data format description.
+     @param [in] data the data to be imported.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+     bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema_file the schema_file contain schema.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+     bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                             const std::string& delimiter, bool continue_on_error = false,
+                             int thread_nums = 8, int skip_packages = 0,
+                             const std::string& graph = "default", bool json_format = true,
+                             double timeout = 0);
+     @param [out] result The result.
+     @param [in] conf_file data file contains format description and data.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] skip_packages (Optional) skip packages number.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..54bf90e2e9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/3.java-client.md
@@ -0,0 +1,277 @@
+# TuGraph Java SDK
+
+## 1.Compile java client code
+
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.3. Send cypher request to leader
+```java
+     String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param cypher: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```java
+     String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @param url: (Optional) Node address of calling GQL
+     @return: the result of GQL query execution
+     public String callGql(String gql, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.5. Send GQL request to leader
+```java
+     String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```java
+     String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @param url: (Optional) Node address of calling procedure
+     @return: the result of procedure execution
+     public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph, String url)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```java
+     String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedureToLeader : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @return: the result of procedure execution
+     public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 2.8. Load stored procedure
+```java
+     boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param sourceFile: the source_file contains procedure code
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param codeType: code type, currently supported PY, SO, CPP, ZIP
+     @param procedureDescription: procedure description
+     @param readOnly: procedure is read only or not
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                               String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```java
+     String result = client.listProcedures("CPP", "any", "default");
+     log.info("listProcedures : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @param url: (Optional) Node address of listing procedure
+     @return: the list of procedures
+     public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```java
+     String result = client.deleteProcedure("CPP", "sortstr", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```java
+     boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+     log.info("importSchemaFromContent : " + ret);
+```
+```
+     @param schema: the schema to be imported
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```java
+     boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+     log.info("importDataFromContent : " + ret);
+```
+```
+     @param desc: data format description
+     @param data: the data to be imported
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+             int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```java
+     boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+     log.info("importSchemaFromFile : " + ret);
+```
+```
+     @param schemaFile: the schema_file contains schema
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromFile(String schemaFile, String graph, double timeout)
+             throws UnsupportedEncodingException, IOException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```java
+     boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+     log.info("importDataFromFile : " + ret);
+```
+```
+     @param confFile: data file contains format description and data
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param skipPackages: skip packages number
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+             int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..1a778b73ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,176 @@
+# TuGraph-OGM
+
+@TODO
+
+## 1.Introduction
+
+> TuGraph-OGM project is open source on other repositories.
+
+TuGraph-OGM (Object Graph Mapping) is a graph object mapping tool designed for TuGraph. It supports the mapping of Java objects (POJO) into TuGraph. The classes in Java are mapped to nodes in the graph, the collections in the classes are mapped to edges, and the properties of the classes are mapped to the attributes of the graph objects. It also provides corresponding functions to manipulate the graph database. Therefore, Java developers can easily use TuGraph database in the familiar ecosystem. TuGraph-OGM is also compatible with Neo4j-OGM. Neo4j ecosystem users can migrate seamlessly to TuGraph database.
+
+### 1.1.Functions of TuGraph-OGM
+
+TuGraph-OGM provides the following functions for operating TuGraph:
+
+| Function                            | Usage                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| Insert single vertex/edge                 | void session.save(T object)                                                      |
+| Batch insert vertexs/edges                 | void session.save(T object)                                                      |
+| Delete vertex and its corresponding edges                | void session.delete(T object)                                                    |
+| Delete all vertexs with specific label       | void session.deleteAll(Class\<T> type)                                           |
+| Clear the database                      | void purgeDatabase()                                                             |
+| Update vertex                        | void session.save(T newObject)                                                   |
+| Query single node by id            | T load(Class<T> type, ID id)                                                     |
+| Query multiple nodes by ids           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| Query all nodes with specific label         | Collection\<T> loadAll(Class\<T> type)                                           |
+| Query with conditions                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher query (specify the return type) | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher query                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.Compile TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.Use TuGraph-OGM
+
+Please refer to the detailed examples in TuGraphOGMDemo under the demo folder.How to import dependencies in `pom.xml`.
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // create Movie vertex
+    @Id
+    private Long id;      // Movie id
+    private String title; // title attribute
+    private int released; // released attribute
+
+    // create Edge ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // create Actor vertex
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// configuration
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//Start driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// Open session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.Perform CRUD operations through OGM
+
+```java
+// new
+Movie jokes = new Movie("Jokes", 1990);  // Create Movie-vertex "jokes"
+session.save(jokes);                     // Store "jokes" in TuGraph
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // Connect the "speed" vertex with the "alice" vertex through the ACTS_IN relationship
+session.save(speed);                    // Store two vertexs and one edge
+
+// delete
+session.delete(alice);                  // Delete the "alice" vertex and its connected edge
+Movie m = session.load(Movie.class, jokes.getId());   // Get the "jokes" vertex based on its id
+session.delete(m);                                    // Delete the "jokes" node
+
+// update
+speed.setReleased(2018);
+session.save(speed);                   // Update the "speed" attribute
+
+// get
+Collection<Movie> movies = session.loadAll(Movie.class);  // Get all Movie vertexs
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // Query all movies released before 1995
+
+// Call Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // Query the Movie with "Speed" of 2018
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // Create vertex label "Director"
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // Create edge label "DIRECT"
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // Get the create result
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // View the number of vertexs created
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //View the number of edges created
+
+// Clear the database
+session.deleteAll(Movie.class);        // Delete all Movie vertexs
+session.purgeDatabase();               // Delete all data
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..e45c65a194
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,17 @@
+# Bolt client
+
+TuGraph implements Neo4j's bolt protocol, you can use Neo4j's client to access TuGraph.
+
+## Enable bolt port
+
+If you are using the TuGraph runtime docker image, the config file is `/usr/local/etc/lgraph.json`.
+
+Add `bolt_port=7687` (modify the port) to TuGraph's config file to enable the bolt port, Neo4j clients should connect to the bolt port.
+
+## Limitations on use
+
+TuGraph does not implement all the features of neo4j bolt protocol.
+
+Explicit transactions are currently not supported and need to avoid using these features.
+
+There are some examples for reference under `demos/Bolt` in the code repository.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..3ba53fb6f5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,107 @@
+# TuGraph console client
+
+`lgraph_cli` is a console client based on the bolt protocol, written in c++, which requires a connection to tugraph's bolt port.
+
+`lgraph_cypher` is a console client based on http, written in python, which requires a connection to tugraph's http port.
+
+`lgraph_cypher` needs some python libraries to be installed.
+
+`lgraph_cli` is a binary executable file that has no dependencies on other dynamic libraries and can be executed by copying it to a linux server.
+
+## `lgraph_cli`
+
+The statement ends with a semicolon, type `exit`, `quit` or Ctrl-C to exit the client.
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+The statement can be inputed on more than one line.
+
+```
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+non-interactive
+
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+read statements from file
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## online export
+
+lgraph_cli supports streaming read, so just redirect the output to a file. The output format supports csv and json
+
+### csv
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..b5679e97fd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,341 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+## 2.Request And Response Format
+Tugraph HTTP Server receives requests in json format，After authentication, fields in the request are extracted, the request is processed according to the defined interface logic, and the response in json format is returned.
+
+### 2.1.Standard Response Format
+Each response is returned in the standard response format, as follows：
+
+| body parameter  | parameter description  | parameter type | necessary |
+|--------------|------------------------|----------|-----------|
+| errorCode    | error code             | int      | yes       |
+| success      | Whether the request was successful | int      | yes       |
+| errorMessage | error message          | string   | yes         |
+| data         | the response information returned when the request is successful | json string | yes         |
+
+### 2.2. Request Type
+
+#### 2.2.1. User Login
+The user sends the login request to the server with the user name and password. After successful login, the client receives a signed token (the Json Web Token) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token stored by the client and added to the Authorization domain of the request header in subsequent requests. If the login fails, you will receive the Authentication failed error.
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary       |
+| ------- |-----------------------|-------|------------|
+| userName   | name of the user      | string   | yes          |
+| password   | password of the user  | string | yes          |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00 and the token will be included in data
+
+| body parameter  | parameter description  | parameter type   | necessary |
+| ------- |-------|--------|------|
+| authorization   | token | string | yes  |
+| default_password  | whether the password is the default password | bool | yes  |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. User Logout
+When a user logs out, the authenticated token is deleted. and the user needs to log in again to obtain a new token when sending subsequent requests.
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and data is empty
+
+#### 2.2.3. Refresh Token
+If the delivered token becomes invalid, you need to invoke this interface for re-authentication. The token is valid within one hour after the first login and needs to be refreshed
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the token will be included in data
+
+| body parameter  | parameter description | parameter type | necessary       |
+| ------- |------|----------------|------------|
+| authorization   | token  | string         | yes          |
+
+#### 2.2.4. Call Cypher
+User manipulation of data and models in tugraph requires calling the cypher interface and is initiated through the standard cypher query language
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------------------|---------|-----------|
+| graph   | the name of the subgraph to be queried | string  | yes       |
+| script   | query statement  | string  | yes         |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the query results will be included in data
+
+| body parameter  | parameter description | parameter type | necessary    |
+| ------- |------|----------------|------------|
+| result   | query results | json string    | yes          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. Upload File
+This interface is used to upload local files to the TuGraph machine. You can upload text/binary files, large files, and small files. For large files, the client must split the files, and each file fragment must not be larger than 1MB. Parameters Begin-Pos and Size correspond to the offset and fragment size of this fragment in the complete file. The parameter must be placed in the header of the http request, and the request body contains only the file fragment content. The request header of this interface contains more than token parameters
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header parameter | parameter description                | parameter type | necessary |
+|------------------|--------------------------------------|---------|-------|
+| File-Name        | the name of the file                 | string  | yes   |
+| Begin-Pos        | Offset of the start position of the current file fragment within the file | string  | yes   |
+| Size             | the current file fragment size       | string | yes   |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+#### 2.2.6. Check File
+this interface is used to check the correctness of uploaded files. If the check succeeds, the system returns a success message when the same file is uploaded again
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description       | parameter type | necessary |
+| ------- |-----------------------------|----------------|-----------|
+| fileName   | the name of the file        | string         | yes       |
+| checkSum   | the checksum of the file    | string  | yes when flag set to "1" |
+| fileSize   | the size of the file        | string  | yes when flag set to "2" |
+| flag   | If flag is "1", check md5. If flag is "2"，check file size | string  | yes       |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------|------|------|
+| pass   | true on success, false otherwise | bool | yes  |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. Delete Cached File
+The admin user can delete all the files uploaded by anyone. Other users can delete their own files. You can delete a file with a specified name, a file uploaded by a specified user, or all files
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary |
+| ------- |-----------------------|--------|--------|
+| fileName   | the name of the file  | string | yes when flag set to "0" |
+| userName   | the name of the user  | string | yes when flag set to "1" |
+| flag   | When flag is set to 0, the file specified by fileName is deleted; when flag is set to 1, all files uploaded by userName are deleted; when flag is set to 2, all files are deleted | string | yes    |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. Import Schema
+This interface can create a schema model based on the schema information specified by description parameter. For details about the schema format, refer to data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |-----------------------|----------------|-----------|
+| graph   | name of the subgraph  | string         | yes       |
+| description   | schema infomation     | json string    | yes         |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. Import Data
+This interface allows users to specify uploaded and verified files as data files and import them to the subgraph specified by the graph parameter. The import process is asynchronous, and the server returns a task id after receiving the import request
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description     | parameter type | necessary |
+| ------- |---------------------------|--------|-----|
+| graph   | name of the subgraph      | string | yes |
+| schema   | schema infomation         | json string | yes |
+| delimiter   | column delimiter          | string | yes |
+| continueOnError   | Whether to skip the error and continue when an error occurs | boolean | no  |
+| skipPackages   | number of packets skipped | string | no  |
+| taskId   | used to restart the failed task | string | no  |
+| flag   | If flag is set to 1, the data file is deleted after the import is successful | string | no  |
+| other   | other parameter           | string | no  |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                 | parameter type   | necessary       |
+| ------- |---------------------------------------|--------|------------|
+| taskId   | task id is used to find a import task | string | yes          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. Import Progress Query
+This interface is used to query the execution progress of a import task
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description                     | parameter type    | necessary |
+| ------- |-------------------------------------------|---------|----|
+| taskId   | task id returned by import_data interface | string | 是 |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                | parameter type | necessary |
+| ------- |--------------------------------------|----------------|-----------|
+| success   | 	whether import is successful        | boolean        | yes       |
+| reason   | 	reason of the import failure        | string         | yes if success is false      |
+| progress   | 	import progress at the current time | string         | yes       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..911de26909
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,269 @@
+# RPC API
+
+> This document mainly introduces the details of calling TuGraph's RPC API.
+
+## 1.Introduction
+
+TuGraph provides rich RPC APIs for developers to remotely call the services provided by TuGraph through RPC requests.
+
+RPC (Remote Procedure Call) is a protocol for requesting services from remote computer programs through a network without the need to understand the underlying network technology.
+Compared with REST, RPC is method-oriented and mainly used for calling function methods. It is suitable for more complex communication scenarios and has higher performance.
+brpc is an industrial-grade RPC framework written in C++. Based on brpc, TuGraph provides rich RPC APIs. This document describes how to use TuGraph's RPC API.
+
+## 2.Request
+
+### 2.1.Establishing a Connection
+
+When developers send RPC requests to TuGraph services, they must first establish a connection. Taking C++ as an example, developers create a channel with the specified URL and create a specified service stub (LGraphRPCService_Stub) from the channel. Subsequently, they can send requests to the remote server through the stub like calling local methods.
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.Request Types
+
+TuGraph supports 10 types of RPC requests, and each request's functionality is shown in the following table:
+
+| Request              | Functionality         |
+|-----------------|------------|
+| GraphApiRequest | Vertex-Edge Index   |
+| CypherRequest   | cypher   |
+| PluginRequest   | Stored Procedures     |
+| HARequest       | High Availability    |
+| ImportRequest   | Data Import     |
+| GraphRequest    | Subgraph Operations     |
+| AclRequest      | Access Control     |
+| ConfigRequest   | Configuration     |
+| RestoreRequest  | Backup       |
+| SchemaRequest   | Schema Management |
+
+When a user sends a request, the following parameters need to be passed in:
+- client_version: an optional parameter, in HA mode, it can prevent outdated responses by comparing `client_version` and `server_version`
+- token: a necessary parameter, the client obtains the token after logging in, and the token is passed in with each request to verify the user's identity
+- is_write_op: an optional parameter, indicating whether the request is a write request
+- user: an optional parameter, set user when synchronizing requests between master and slave in HA mode, and no token verification is required After the service processes the RPC request, it sends back a response.
+
+In addition to containing separate response information for each request, the response message also includes the following parameters:
+- error_code: a necessary parameter, indicating the processing status of the request
+- redirect: an optional parameter, when processing fails to send a write request to a follower in HA mode, set redirect as the request forwarding address, that is, the leader address
+- error: an optional parameter, indicating the error information of the request
+- server_version: an optional parameter, set `server_version` in the HA mode request response to avoid reverse time travel when client reads data
+
+:warning:  **Except for CypherRequest, PluginRequest, HARequest and AclRequest, all other RPC interfaces will be gradually deprecated, and their functions will be unified into the CypherRequest interface.**
+
+## 3.Login
+
+The login request message contains the following parameters:
+- user: a necessary parameter, the username
+- pass: a necessary parameter, the password
+
+Taking C++ as an example, the user sends a login request using the constructed service stub:
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+The login response message contains the following parameters:
+- token: a necessary parameter. After successful login, a signed token, namely Json Web Token, will be received. The client stores the token and uses it for each subsequent request. If the login fails, an "Authentication failed" error will be received.
+
+## 4.Query
+Users can interact with TuGraph through Cypher queries. The Cypher request message contains the following parameters:
+- query: a necessary parameter, the Cypher query statement
+- param_names: an optional parameter, the parameter name
+- param_values: an optional parameter, the parameter value
+- result_in_json_format: a necessary parameter, whether to return the query results in JSON format
+- graph: an optional parameter, the subgraph name for executing the Cypher statement
+- timeout: an optional parameter, the timeout for executing the Cypher statement
+
+Taking C++ as an example, the user sends a Cypher request as follows:
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+The Cypher request response contains one of the following two parameters:
+- json_result: the Cypher query result in JSON format
+- binary_result: the Cypher query result in the CypherResult format
+
+## 5.Stored Procedures
+To meet users' more complex query/update logic, TuGraph supports stored procedures written in C and Python. Users can use RPC requests to perform CRUD operations on stored procedures.
+
+### 5.1.Load Stored Procedures
+The request for loading stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- read_only: a necessary parameter, whether it is read-only
+- code: a necessary parameter, the ByteString generated by reading the stored procedure file
+- desc: an optional parameter, the stored procedure description
+- code_type: an optional parameter, the stored procedure code type, which can be PY, SO, CPP, or ZIP
+
+Taking C++ as an example, the user loads the stored procedure as follows:
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for loading the stored procedure does not contain parameters, and if the loading fails, a BadInput exception will be thrown.
+
+### 5.2.Invoke Stored Procedures
+
+The request for invoking stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- param: a necessary parameter, the stored procedure parameters
+- result_in_json_format: an optional parameter, whether to return the invocation result in JSON format
+- in_process: an optional parameter, to be supported in the future
+- timeout: an optional parameter, the timeout for invoking the stored procedure
+
+Taking C++ as an example, the user invokes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+The response for invoking the stored procedure contains one of the following two parameters:
+- reply: the stored procedure invocation result in the ByteString format
+- json_result: the stored procedure invocation result in JSON format
+
+### 5.3.Delete Stored Procedures
+
+The request for deleting stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+
+Taking C++ as an example, the user deletes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for deleting the stored procedure does not contain parameters, and if the deletion fails, a BadInput exception will be thrown.
+
+### 5.4.List Stored Procedures
+
+The request for listing stored procedures does not require parameters. Taking C++ as an example, the user lists the stored procedures as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+The response for listing the stored procedures contains the following parameter:
+- reply: the procedure list in JSON format
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..3ecfbae4cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2738 @@
+# TuGraph RESTful API Legacy
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+:warning: **All the other RESTful APIs excluding the three below will be deprived after 4/30/2023.**
+- **Login**
+- **Query**
+- **Store Procedures**
+
+## 2.Protocols And Data Format
+
+### 2.1.Protocols
+
+Both HTTP and HTTPS protocols are supported by TuGraph. The system uses HTTP protocol by default. To use HTTPS, the `ssl_auth` option should be set to `true` in the DB configuration.
+
+### 2.2.Request
+
+TuGraph supports HTTP GET/POST/PUT/DELETE requests, in which:
+
+- `GET` requests are used for read-only requests, such as getting vertex properties, edge properties, etc.
+
+- `POST` requests are used to create entities, submit Cypher, and to manage and call stored procedures;
+
+- `PUT` requests are used to modify existing entities, for example, to modify vertex properties, edge properties, etc.
+
+- `DELETE` requests are used to delete existing entities, such as vertices, edges, etc.
+
+In high-availability mode, users can set `ServerVersion` in the request header to make sure the request is never served with an outdated version.
+The current `ServerVersion` can be obtained from the header returned by the server.
+
+### 2.3.Response
+
+TuGraph returns the following HTTP status codes:
+
+- **200 OK**: operation is successful.
+- **307 Temporary Redirect**: the operation is redirected, typically in high-availability mode, to the master.
+- **400 Bad Request**: incorrect input, such as URI error, or invalid parameters.
+- **500 Internal Server Error**: server error.
+
+When the operation is successful, the JSON response contains the return value of the operation. When the operation is redirected, the `location` field in the returned HTTP header contains the redirect destination address.
+When an input error or server error occurs, the JSON response contains a `error_message` field that describes the error.
+
+In high-availability mode, the server will set `server_version` field in the header to inform the client of the data version of the current server. When clients switch between several different servers, this version number guarantees that the client will not read from an outdated server.
+
+### 2.4.Data Format
+
+The server and clients exchange data in JSON format. When sending a request, the header of the HTTP request should be set with `Accept:application/json, Content-Type:app/json`.
+For example, to create a new vertex, the request header should look like the following:
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.5.URI Format
+
+TuGraph REST API provides access to: web visualization, login, db info, label, index, node, relationship, cypher, task, cpp_plugin, and python_plugin.
+The URI format used for each function is as follows:
+
+| URI     | Description                     |
+| ------- | ------------------------------- |
+| /web    | web visualization               |
+| /cypher | cypher request                  |
+| /acl    | access control                  |
+| /user   | user management                 |
+| /login  | user login                      |
+| /info   | database status and information |
+| /task   | task management                 |
+| /db     | subgraph management             |
+
+For each subgraph, the following interfaces are provided:
+
+| URI                              | Description                         |
+| -------------------------------- | ----------------------------------- |
+| /db                              | create, modify, and delete subgraph |
+| /db/_{graph_name}_/node          | vertex operations                   |
+| /db/_{graph_name}_/relationship  | edge operations                     |
+| /db/_{graph_name}_/label         | label-related operations            |
+| /db/_{graph_name}_/index         | index-related operations            |
+| /db/_{graph_name}_/cypher        | subgraph-specific cypher operation  |
+| /db/_{graph_name}_/cpp_plugin    | C++ plugin(stored procedure)        |
+| /db/_{graph_name}_/python_plugin | Python plugin(stored procedure)     |
+| /db/_{graph_name}_/import        | online import                       |
+| /db/_{graph_name}_/misc          | other operations                    |
+
+## 3.Login
+
+The system creates an administrator by default, whose username is _admin_ and password is _73@TuGraph_. For security reasons, please remember to change your password after first starting the server.
+
+### 3.1.User Login
+
+TuGraph provides JWT-based user authentication. To log in to the server, the REST client should send a login request containing a username and password. Upon success, the client will receive a signed token in the form of a Json Web Token (JWT) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token should be stored by the client and used for each subsequent request.
+
+- **URI**: `/login`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| user     | username    | String |
+| password | password    | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+| default_password | whether it is the default password | Bool |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.Token Refresh
+
+After the token expires, the front-end initiates a refresh token interface, and the back-end verifies the validity of the token.
+If the verification passes, a new token is generated; if the verification fails, status code 401 is returned.
+
+- **URI**: `/refresh`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.Modify Token Validity Period
+
+To modify the validity period of Token, three parameters need to be transmitted: jwt, refresh_time and expire_time, among which jwt is used to verify the user’s identity. When refresh_time and expire_time are equal to 0, the validity period is indefinite. When refresh_time exceeds, you need to call the refresh interface to obtain a new Token; When expire_time expires, you need to log in again. (This interface call needs to confirm the security by itself, do not call unless necessary)
+
+- **URI**: `/update_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+| refresh_time | Valid time (deafult set to 0) | Int64 |
+| expire_time | Expire time (deafult set to 0) | Int64 |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.Query Token validity period
+To query the validity period of the Token, you need to transmit jwt to verify the user's identity, and return, refresh_time and expire_time, where refresh_time indicates the refresh time, and you need to call the refresh interface to obtain a new Token when it exceeds; expire_time indicates the expiration time, and you need to log in again when it exceeds.
+
+- **URI**: `/get_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return "refresh_time" and "expire_time".
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+### 3.5.Logout
+
+The user logs out and deletes the token at the same time.
+
+- **URI**: `/logout`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+## 4.Query
+
+URI format is:
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.Call Cypher
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description   | Type   |
+| ------ | ------------- | ------ |
+| graph  | subgraph name | String |
+| cypher | Cypher query  | String |
+
+- **RESPONSE**:
+
+| Field   | Description             | Type    |
+| ------- | ----------------------- | ------- |
+| result  | running results         | List    |
+| elapsed | running time in seconds | Float   |
+| header  | header of the results   | List    |
+| size    | number of results       | Integer |
+
+in which `header` is a list with each element in the form of:
+
+| Field | Description                                                | Type   |
+| ----- | ---------------------------------------------------------- | ------ |
+| name  | the name of column                                         | String |
+| type  | column data type, 0 is scalar, 1 is vertex id, 2 is vector |        |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.Call Cypher with Parameters
+
+Cypher supports querying with parameters. When a Cypher query with parameters is called, TuGraph caches the execution plan for that query to speed up the following queries of the same kind.
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type   |
+| ---------- | ------------- | ------ |
+| graph      | subgraph name | String |
+| cypher     | Cypher query  | String |
+| parameters | parameters    | List   |
+
+- **RESPONSE**:
+
+Same as [Call Cypher](#Call-Cypher).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+## 5.Stored Procedures
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.Create Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                                                                       | Type   |
+| ----------- | --------------------------------------------------------------------------------- | ------ |
+| name        | name of the plugin                                                                | String |
+| description | description of the plugin                                                         | String |
+| code_base64 | code of plugin encoded in base64                                                  | String |
+| read_only   | whether it is a read-only stored procedure                                        | Bool   |
+| code_type   | type of plugin code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String |
+
+_Note: read-only plugins are more efficient than write plugins. Always specify `read-only=true` for read-only transactions._
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.so}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 5.2.List Stored Procedures
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list in which each element is a plugin description, in the format of:
+
+| Field       | Description                               | Type   |
+| ----------- | ----------------------------------------- | ------ |
+| name        | name of the stored procedure              | String |
+| description | description of the stored procedure       | String |
+| read_only   | whether the stored procedure is read-only | Bool   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.Retrieve Stored Procedure Detail
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Procedure detail, including code, in the format of:
+
+| Field       | Description                                                                         | Type                   |
+| ----------- | ----------------------------------------------------------------------------------- | ---------------------- |
+| name        | Procedure name                                                                      | String                 |
+| description | Procedure descrition                                                                | String                 |
+| read_only   | Read only or not                                                                    | Bool                   |
+| code_base64 | 存储过程的代码                                                                      | String, Base64 encoded |
+| code_type   | Type of procedue code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String                 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.Call Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: POST
+
+- **REQUEST**: String input.
+
+| Field   | Description                                               | Type   |
+| ------- | --------------------------------------------------------- | ------ |
+| data    | input data                                                | String |
+| timeout | timeout in seconds, defaults to 0, which means no timeout | Float  |
+
+- **RESPONSE**:
+
+| Field  | Description     | Type   |
+| ------ | --------------- | ------ |
+| result | running results | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.Delete Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+## 6.Deprecated
+
+The APIs below will be removed after 4/30/2023.
+
+### 6.1.User Management
+
+#### 6.1.1.Add User
+
+Add a new user and set the initial password for the user. Only administrators have permission to add new users. The username can only have letters, numbers, and underscores, and should not begin with a number. The password can contain any character. The username and password have a maximum length of 64 bytes.
+
+- **URI**: `/user`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                                 | Type   |
+| -------- | ------------------------------------------- | ------ |
+| user     | username                                    | String |
+| password | password                                    | String |
+| is_admin | whether the user is an administrator or not | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "is_admin": false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.Change Password
+
+Users can change their own passwords, in which case the original password needs to be verified.
+
+Administrators can change the passwords of any user and promote non-admin users to administrators, or demote administrator users to regular users. When modifying another user's password, the original password of the user is not needed.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field            | Description                                                                     | Type   |
+| ---------------- | ------------------------------------------------------------------------------- | ------ |
+| current_password | user's current password, if modifying its own password                          | String |
+| new_password     | user's new password                                                             | String |
+| is_admin         | should this user be administrator or not, used when promoting or demoting users | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user/user1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+        "is_admin": true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.3.List All Users
+
+List all users of the database. Only administrators are allowed to perform this operation.
+
+- **URI**: `/user/`
+
+- **METHOD**: GET
+
+- **RESPONSE**: a dictionary of {`user_name`:`is_admin`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+    • 200: OK
+    Output:
+    {
+        "admin": true,
+        "guest1": false
+    }
+
+#### 6.1.4.Delete User
+
+Delete a user from the DB. Only administrators have permission to do so.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.2.Access Control
+
+TuGraph has four access levels. Different users can have different permissions for each subgraph. The four access levels are as follows:
+
+| Access Level | Description                                                                                                               |
+| ------------ | ------------------------------------------------------------------------------------------------------------------------- |
+| NONE         | no access                                                                                                                 |
+| READ         | read-only                                                                                                                 |
+| WRITE        | can read and write vertexes and edges of the subgraph                                                                     |
+| FULL         | full access, including changing metadata (label, index), managing stored procedures and deleting all data in the subgraph |
+
+Administrators have full access on all subgraphs, and a newly created non-admin user does not have access for any subgraph. Users who have full access on a subgraph can set the access level for other users on that subgraph.
+
+#### 6.2.1.Query User's Access Level
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+When both `user` and `graph` are specified, the user's access level for the subgraph is returned, such as `READ`.
+
+When only `user` is specified, all subgraphs that the user can access (access level not `NONE`) are returned, as well as the user's access level on the subgraph.
+
+When only `graph` is specified, all users who have access level on this graph (excluding administrators, who have implicit `FULL` access) and their access levels are returned. This operation requires administrator permission.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/acl/?user=user1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "graph1": "READ",
+      "graph2": "WRITE",
+      "graph3": "FULL"
+    }
+```
+
+#### 6.2.2.Change User's Access Level
+
+- **URI**: `/acl`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field | Description     | Type   |
+| ----- | --------------- | ------ |
+| user  | username        | String |
+| graph | subgraph's name | String |
+| acl   | access level    | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/acl
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "user1",
+        "graph": "graph1",
+        "acl": "FULL"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.Remove User's Access Right
+
+This is equivalent to setting access level to `NONE`.
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/acl/?user=user1&graph=graph1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.Server Status
+
+#### 6.3.1.Modify Server Configuration
+
+Modifying the server configuration will take effect immediately after the configuration modification and will affect all servers. These configurations take precedence over configuration files and command line arguments.
+
+- **URI**: `/config`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+  | Field            | Description                                           | Type |
+  | ---------------- | ----------------------------------------------------- | ---- |
+  | db_async         | Whether to enable asynchronous mode                   | Bool |
+  | optimistic_txn   | Whether to use optimistic transaction lock by default | Bool |
+  | enable_audit_log | Whether to enable audit logging                       | Bool |
+
+- **RESPONSE**: If successful, return status code 200.
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "db_async": true,
+        "enable_audit_log": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.Current Server Status
+
+- **URI**: `/info`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field          | Description                    | Type                                                                                    |
+| -------------- | ------------------------------ | --------------------------------------------------------------------------------------- |
+| lgraph_version | TuGraph version                | String                                                                                  |
+| git_branch     | server's git branch            | String                                                                                  |
+| git_commit     | server's git commit version    | String                                                                                  |
+| web_commit     | web client commit version      | String                                                                                  |
+| cpp_id         | cpp compiler id                | String                                                                                  |
+| cpp_version    | cpp compiler version           | String                                                                                  |
+| python_version | python lib version             | String                                                                                  |
+| cpu            | cpu information                | Dictionary, format refers [CPU Status](#CPU-Status)                                     |
+| disk           | disk IO information            | Dictionary, format refers [Disk Status](#Disk-Status)                                   |
+| memory         | memory information             | Dictionary, format refers [Memory Status](#Memory-Status)                               |
+| db_space       | graph database storage         | Dictionary, format refers [Graph Database Storage](#Graph-Database-Storage)             |
+| db_config      | graph database configuration   | Dictionary, format refers [Graph Database Configuration](#Graph-Database-Configuration) |
+| up_time        | database's online running time | Integer                                                                                 |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.CPU Status
+
+- **URI**: `/info/cpu`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description        | Type    |
+| ------ | ------------------ | ------- |
+| self   | TuGraph CPU usage  | Integer |
+| server | server's CPU usage | Integer |
+| unit   | metric unit        | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.Disk Status
+
+- **URI**: `/info/disk`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description              | Type    |
+| ----- | ------------------------ | ------- |
+| read  | server's disk read rate  | Integer |
+| write | server's disk wrtie rate | Integer |
+| unit  | metric unit              | String  |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.Memory Status
+
+- **URI**: `/info/memory`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description               | Type    |
+| ------------ | ------------------------- | ------- |
+| self         | TuGraph memory usage      | Integer |
+| server_avail | server's available memory | Integer |
+| server_total | server's total memory     | Integer |
+| unit         | metric unit               | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.Database Size
+
+- **URI**: `/info/db_space`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                | Type    |
+| ----- | -------------------------- | ------- |
+| space | total size of the database | Integer |
+| unit  | metric unit                | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.DB Configuration
+
+- **URI**: `/info/db_config`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description                                       | Type    |
+| ------------ | ------------------------------------------------- | ------- |
+| async        | asynchronous mode                                 | Bool    |
+| disable_auth | whether to disable authentication                 | Bool    |
+| enable_ha    | whether to enable high-availability mode          | Bool    |
+| enable_rpc   | whether to enable RPC server                      | Bool    |
+| host         | bound host address                                | String  |
+| port         | port of REST server                               | Integer |
+| rpc_port     | port of RPC server                                | Integer |
+| thread_limit | limit of available threads for the graph database | Integer |
+| use_ssl      | whether to use SSL for authentication             | Bool    |
+| verbose      | verbose level of the output                       | Integer |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "host":"127.0.0.1",
+      "port":7070,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "use_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.7.High Availability Server List
+
+Get a list of replication servers. Valid only in high-availability mode.
+
+- **URI**: `/info/peers`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of server information, each of server information is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+| state        | server state          | String |
+
+The server state can be `MASTER`, `SLAVE`, or `OFFLINE`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.8.Current Leader Information
+
+Get information of current leader. Valid only in HA mode.
+
+- **URI**: `/info/leader`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current leader server information, which is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.9.Server Statistics
+
+- **URI**: `/info/statistics`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current server statistics, which is formatted as:
+
+| Field           | Description                                   | Type    |
+| --------------- | --------------------------------------------- | ------- |
+| requests/second | number of requests processed per second       | Float   |
+| writes/second   | number of write requests processed per second | Float   |
+| running_tasks   | number of requests in progress                | Integer |
+| failure_rate    | request failure rate                          | Float   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 0.023,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.10.Get Audit Logs
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+
+| Field            | Description                                                                                                             | Type      |
+| ---------------- | ----------------------------------------------------------------------------------------------------------------------- | --------- |
+| begin_time       | start time of the queried log (required, format YYYY-mm-dd HH:MM:SS)                                                    | Timestamp |
+| end_time         | end time of the queried log (default is current time, format YYYY-mm-dd HH:MM:SS)                                       | Timestamp |
+| user             | the operator of the queried log (administrator can query all users' logs, ordinary users can only query their own logs) | String    |
+| num_log          | maximum number of logs to return (default 100)                                                                          | Integer   |
+| descending_order | whether to sort the result in descending order(default is true)                                                         | Bool      |
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of audit logs, each of which is an action log in the format of:
+
+| Field      | Description                                        | Type    |
+| ---------- | -------------------------------------------------- | ------- |
+| index      | the index of the operation                         | Integer |
+| begin_time | the start time of the operation                    | String  |
+| end_time   | the end time of the operation                      | String  |
+| user       | the user of the operation                          | String  |
+| graph      | the graph of the operation                         | String  |
+| type       | the type of the operation                          | String  |
+| read_write | the operation is read operation or write operation | String  |
+| success    | whether the operation is successful                | Bool    |
+| content    | the content of the operation                       | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.Task Management
+
+TuGraph tracks long-running tasks such as complex Cypher queries and plugins. Administrators can query currently running tasks through the REST API and choose to abort the queries if necessary.
+
+The URI format for task management is :
+
+```
+    http://{host}:{port}/task/{task_id}
+```
+
+#### 6.4.1.List Running Tasks
+
+- **URI**: `/task`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+The returned JSON is an array, each of which is formatted as follows:
+
+| Field        | Description                                      | Type   |
+| ------------ | ------------------------------------------------ | ------ |
+| description  | the description of the task                      | String |
+| time_elapsed | time the task has been executing for, in seconds | Float  |
+| task_id      | the ID of the task                               | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.Abort Task
+
+- **URI**: `/task/{task_id}`
+
+Where `task_id` is the `task_id` returned by `GET /task` .
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.5.Subgraph Management
+
+TuGraph supports multiple subgraphs and all subgraphs are completely independent from others. Different subgraphs can have different permissions to different users. Administrators can add, modify and delete subgraphs.
+
+#### 6.5.1.Create New Subgraph
+
+- **URI**: `/db`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description                   | Type                                                                |
+| ------ | ----------------------------- | ------------------------------------------------------------------- |
+| name   | the name of subgraph          | String                                                              |
+| config | the configuration of subgraph | Dictionary, in the format of {{column name 1}:{column value 1},...} |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1"
+        "config" : {
+            "max_size_GB":2048,
+            "async":True
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.Delete Subgraph
+
+- **URI**: `/db/{graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.List All Subgraphs
+
+- **URI**: `/db`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of all subgraphs.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_gb":1024,
+            "async":false
+        }
+    }
+```
+
+### 6.6.Label
+
+TuGraph is a strong-schema database. In each subgraph, each vertex and edge need to have a predefined data format. The data format is determined by Label. Users can use the REST API to add, delete, and query labels and their corresponding data format.
+
+The URI format of the Label operation is
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+Where the {type} can be `node` or `relationship`.
+
+#### 6.6.1.Create Label
+
+A label is created with a fixed data format. A label must be defined before any node or relationship can be created with that label.
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field            | Description                  | Type   |
+| ---------------- | ---------------------------- | ------ |
+| name             | the name of label            | String |
+| fields           | data column definition       | List   |
+| is_vertex        | whether it is a vertex Label | Bool   |
+| primary          | vertex primary property      | String |
+| edge_constraints | edge constraints             | List   |
+
+`primary` should be set when `is_vertex` is `true`. This field is only available for Vertex, and must be set when creating Vertex.
+
+`edge_constraints` could be set when `is_vertex` is `false`, This field is only available for Edge. This field limits the combination of starting and ending vertex of the edge, for example: `[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, just leave this field unset.
+
+In which `fields` is an array, in which each element defines a column of data, as follows:
+
+| Field    | Description                                                | Type                                                                                                         |
+| -------- | ---------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------ |
+| name     | the name of the column                                     | String                                                                                                       |
+| type     | the data type of the column                                | String, with following types: int8, int16, int32, int64, float, double, string, date, datetime, binary, blob |
+| optional | whether the data can be empty (optional, default is false) | Bool                                                                                                         |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.List All Labels
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description               | Type |
+| ------ | ------------------------- | ---- |
+| edge   | the list of edge labels   | List |
+| vertex | the list of vertex labels | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.Get Label Data Format
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Data column definition table as a dictionary, in which each key is the column name, and corresponding value is the column definition defined as follows:
+- | Field    | Description                           | Type   |
+  | -------- | ------------------------------------- | ------ |
+  | optional | whether the column value can be empty | Bool   |
+  | type     | the type of the column value          | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema Import
+
+- **URI**: `/db/{graph_name}/schema/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description              | Type   |
+| ----------- | ------------------------ | ------ |
+| description | Graph labels description | String |
+
+The detail description can refer to `TuGraph Manual`.
+
+- **RESPONSE**:
+
+Schema import will check the new schema and original schema in database if compatible or not. If yes, this request will add the label only in new schema. If no, will return an error code.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.Vertex Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+in which `vid` is a unique integer identifying the vertex, which can be obtained when creating new vertexes or by looking up index.
+
+#### 6.7.1.List Vertex and Label Number
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field      | Description                | Type    |
+| ---------- | -------------------------- | ------- |
+| num_label  | the number of vertex label | Integer |
+| num_vertex | the number of vertex       | Integer |
+
+_Note: `num_vertex` returns an estimate of the number of vertexes, not the exact number. To get the exact number, please use Cypher queries._
+
+#### 6.7.2.Create New Vertex
+
+Insert a vertex into the database.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                  | Type       |
+| -------- | ---------------------------- | ---------- |
+| label    | the name of label            | String     |
+| property | the properties of the vertex | Dictionary |
+
+in which `property` is a dictionary of {`column_name`:`column_value`}.
+
+- **RESPONSE**: if successful, return status code 200 and the new vertex's vid, which can be used in later vertex operations.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.Batch Create Vertexes
+
+TuGraph allows multiple vertices to be inserted as one batch to reduce network overhead.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description               | Type   |
+| ------ | ------------------------- | ------ |
+| label  | the name of Label         | String |
+| fields | the column names          | List   |
+| values | the values of each vertex | List   |
+
+in which `fields` is a list of strings specifying column names, and `values` is a list in which each element is a list of `column_values` corresponding to the column names as specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200, and return the vid list of newly added vertices in the JSON content, where each vid corresponds to each vertex in the request.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.Get Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description       | Type                                                             |
+| -------- | ----------------- | ---------------------------------------------------------------- |
+| label    | the name of Label | String                                                           |
+| property | property          | Dictionary, in the format of {column_name_1:column_value_1, ...} |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.Delete Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200, and also the following content in JSON:
+
+| Field | Description                                    | Type    |
+| ----- | ---------------------------------------------- | ------- |
+| in    | number of incoming edges of the deleted vertex | Integer |
+| out   | number of outgoing edges of the deleted vertex | Integer |
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.Get Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Vertex properties as a dictionary of {`column_name`:`column_value`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.Get Vertex Field
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Value corresponding to the specified `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.Update Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description          | Type       |
+| -------- | -------------------- | ---------- |
+| property | properties to update | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "13737299333"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.8.Edge Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+in which `euid` is a string uniquely identifying the edge, which can be obtained when creating edges or by iterating through the edges of a vertex.
+
+#### 6.8.1.Create Edge
+
+- **URI**: `/db/{graph_name}/node/{src_vid}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                     | Type       |
+| ----------- | ------------------------------- | ---------- |
+| label       | the label of edge               | String     |
+| destination | the `vid` of destination vertex | Integer    |
+| property    | the property of edge            | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200 and the `euid` of new created edge (type is String).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.Batch Create Edges
+
+- **URI**: `/db/{graph_name}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description          | Type   |
+| ------ | -------------------- | ------ |
+| label  | the label of edge    | String |
+| fields | the data column name | List   |
+| edge   | the data of edge     | List   |
+
+where the edge is a list of data, each of which specifies and edge, defined as follows:
+
+| Field       | Description           | Type    |
+| ----------- | --------------------- | ------- |
+| source      | source vertex id      | Integer |
+| destination | destination vertex id | Integer |
+| values      | the data list         | List    |
+
+in which `values` is a list of column values, each of which correspond to the a column name specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200 and the list of `euid`s of the newly created edges.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.List Out-going Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of source vertex's out-going edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.List Incoming Edges
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of destination vertex's incoming edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.List All Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                     | Type |
+| ----- | ------------------------------- | ---- |
+| in    | list of incoming edges' `euid`s | List |
+| out   | list of outgoing edges' `euid`s | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.Get Edge Information
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description                | Type       |
+| -------- | -------------------------- | ---------- |
+| label    | the label of the edge      | String     |
+| property | the properties of the edge | Dictionary |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.Delete Edge
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.Get Edge Properties
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The dictionary of edge's properties.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.Get Edge Field
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the value corresponding to given `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.Update Edge Property
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description              | Type       |
+| -------- | ------------------------ | ---------- |
+| property | properties to be updated | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.9.Index
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+#### 6.9.1.Create Index
+
+Create an index on a (label, field) pair. Blocks until the index is successfully built.
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field     | Description                                                                                 | Type   |
+| --------- |---------------------------------------------------------------------------------------------|--------|
+| label     | the name of label                                                                           | String |
+| field     | field to be indexed                                                                         | String |
+| type | the type of index, 0 means nonunique index, 1 means unique index, 2 means pair_unique index | int      |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.List All Indexes
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.List Indexes Related with Specified Label
+
+- **URI**: `/db/{graph_name}/index/{label}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.Delete Index
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.Get Vertex by Index
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of `vid`s.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+
+
+
+### 6.10.Data Import
+
+- **URI**: `/db/{graph_name}/import/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field             | Description                                                                                        | Type                       |
+|-------------------|----------------------------------------------------------------------------------------------------|----------------------------|
+| description       | description of the file content                                                                    | String                     |
+| data              | contents of the file to be imported (recommended to have a size of 16MB, has a hard limit of 17MB) | Strings / Arrays / Objects |
+| continue_on_error | whether to continue import when an error occurred (optional, default is `false`)                   | Bool                       |
+| delimiter         | delimiter used in the data file (optional, default is `“,”`)                                       | String                     |
+
+The details of the `description` field can be found in [TuGraph Import Tool](../6.utility-tools/1.data-import.md).
+
+`delimiter` can be a single character or multi-character string, but must not contain `\r` or `\n`.
+
+`data` can be one of the following:
+
+- String, such as `"1,2\n3,4\n"`
+- Array of ASCII codes, such as `[49,44,50,10,51,44,52,10]`
+- Dictionary shaped like the above array, such as `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+* **RESPONSE**:
+
+The system **will not** automatically perform actions such as creating a new label, adding an index, and so on. Before you do this, please make sure that the label involved already exists and has an appropriate index.
+
+If the import is successful, return code 200 and return log information (possibly empty) in the `log` field. Otherwise, returns status code 400. None of the data is imported on failure, and error message is set in `error_message`.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+Because the request specifies `continue_on_error: true`, the returned `log` indicates that the first edge cannot be inserted because there is no vertex with uid==1, while the second edge was imported successfully.
+
+### 6.11.Miscellany
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.Extract Subgraph
+
+Give a set of `vid`s and return the minimum subgraph which contains the vertex set and the edges between them.
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type |
+| ---------- | ------------- | ---- |
+| vertex_ids | vertex id set | List |
+
+- **RESPONSE**:
+
+| Field         | description        | Type                                                               |
+| ------------- | ------------------ | ------------------------------------------------------------------ |
+| nodes         | vertex information | List, each element contains vid, label, and properties.            |
+| relationships | edge information   | List, each element contains src, dst, euid, label, and properties. |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..8a5a18add0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Client Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..a3203b50f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/8.query/1.cypher.md
@@ -0,0 +1,2569 @@
+# Cypher API
+
+> This document mainly introduces the detailed usage instructions of TuGraph-Cypher.
+
+## Table of contents
+- [1.Operators](#1operators)
+  - [1.1.Summary](#11summary)
+  - [1.2.General Operators](#12general-operators)
+  - [1.3.Mathematical Operators](#13mathematical-operators)
+  - [1.4.Comparison Operators](#14comparison-operators)
+  - [1.5.String Specific Comparison Operators](#15string-specific-comparison-operators)
+  - [1.6.Boolean Operators](#16boolean-operators)
+  - [1.7.String Operators](#17string-operators)
+  - [1.8.List Operators](#18list-operators)
+- [2.Clauses](#2clauses)
+  - [2.1.Summary](#21summary)
+  - [2.2.Match](#22match)
+  - [2.3.Return](#23return)
+  - [2.4.Where](#24where)
+  - [2.5.Skip](#25skip)
+  - [2.6.Limit](#26limit)
+  - [2.7.Create](#27create)
+  - [2.8.Callyield](#28callyield)
+  - [2.9.Union](#29union)
+- [3.Functions](#3functions)
+  - [3.1.Whole List of Functions](#31whole-list-of-functions)
+  - [3.2.Predicate Functions](#32predicate-functions)
+  - [3.3.Scalar Functions](#33scalar-functions)
+  - [3.4.Aggregating Functions](#34aggregating-functions)
+  - [3.5.List Funtions](#35list-funtions)
+  - [3.6.Mathematical Functions](#36mathematical-functions)
+- [4.Extensions to Opencypher](#4extensions-to-opencypher)
+- [5.Procedures](#5procedures)
+  - [5.1.Procedures Demos](#51procedures-demos)
+  - [5.2.Whole List of Procedures](#52whole-list-of-procedures)
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators support progress overview：
+
+| category                             | supported                                                                                                                                                       | unsupported                                 |
+| ------------------------------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------- |
+| General operators                    | <code>DISTINCT</code>, <code>.</code> for property access                                                                                                       | <code>[]</code> for dynamic property access |
+| Mathematical operators               | <code>+</code>, <code>-</code>, <code>\*</code>, <code>/</code>, <code>%</code>, <code>^</code>                                                                 |                                             |
+| Comparison operators                 | <code>=</code>, <code>&lt;&gt;</code>, <code>&lt;</code>, <code>&gt;</code>, <code>⇐</code>, <code>&gt;=</code>, <code>IS NULL</code>, <code>IS NOT NULL</code> |                                             |
+| String-specific comparison operators | <code>STARTS WITH</code>, <code>ENDS WITH</code>, <code>CONTAINS</code>, <code>REGEXP</code>                                                                    |                                             |
+| Boolean operators                    | <code>AND</code>, <code>OR</code>, <code>XOR</code>, <code>NOT</code>                                                                                           |                                             |
+| String operators                     | <code>+</code> for concatenation                                                                                                                                |                                             |
+| List operators                       | <code>+</code> for concatenation, <code>IN</code> to check existence of an element in a list, <code>[]</code> for accessing element(s)                          |                                             |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+  ```
+  CREATE (a:Person {name: 'Anne', eyeColor: 'blue'}),
+         (b:Person {name: 'Bill', eyeColor: 'brown'}),
+         (c:Person {name: 'Carol', eyeColor: 'blue'})
+  ```
+
+  ```
+  MATCH (p:Person ) RETURN DISTINCT p.eyeColor
+  ```
+
+- ✓ Accessing properties of a nested literal map using the `.` operator
+
+  ```
+  WITH {person: {name: 'Anne', age: 25}} AS p
+  RETURN p.person.name
+  ```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+  ```
+  CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+         (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+         (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+  ```
+  ```
+  MATCH (restaurant:Restaurant), (category:Category)
+  WHERE restaurant["rating_" + category.name] > 6
+  RETURN DISTINCT restaurant.name
+  ```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator `^`
+
+  ```
+  WITH 2 AS number, 3 AS exponent
+  RETURN number ^ exponent AS result
+  ```
+
+- ✓ Using the unary minus operator `-`
+  ```
+  WITH -3 AS a, 4 AS b
+  RETURN b - a AS result
+  ```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+  ```
+  WITH 4 AS one, 3 AS two
+  RETURN one > two AS result
+  ```
+
+### 1.5.String-specific comparison operators
+
+<span id="jump"></span>
+
+- ✓ Using STARTS WITH to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate STARTS WITH 'Jo'
+  RETURN candidate
+  ```
+
+- ✓ Using REGEXP to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate REGEXP 'Jo.*n'
+  RETURN candidate
+  ```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+  ```
+  WITH [2, 4, 7, 9, 12] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number = 4 OR (number > 6 AND number < 10)
+  RETURN number
+  ```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+  More details on string-specific comparison operators can be found [here](#jump)
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+  ```
+  RETURN [1,2,3,4,5]+[6,7] AS myList
+  ```
+- ✓ Using IN to check if a number is in a list
+
+  ```
+  WITH [2, 3, 4, 5] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number IN [2, 3, 8]
+  RETURN number
+  ```
+
+- ✓ Accessing elements in a list using the [] operator
+  ```
+  WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+  RETURN names[1..3] AS result
+  ```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses support progress list：
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>grammar</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="3"><p>Reading clauses</p></td>
+			<td><p>MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>OPTIONAL MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>MANDATORY MATCH</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="3"><p>Projecting clauses</p></td>
+			<td><p>RETURN … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>WITH … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>UNWIND … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="4"><p>Reading sub-clauses</p></td>
+			<td><p>WHERE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>ORDER BY [ASC[ENDING] / DESC[ENDING]]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>SKIP</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>LIMIT</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>Writing clauses</p></td>
+			<td><p>CREATE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>DETACH DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>SET</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>REMOVE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Reading/Writing clauses</p></td>
+			<td><p>MERGE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>CALL […YIELD]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Set operations</p></td>
+			<td><p>UNION</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>UNION ALL</p></td>
+			<td><p>supported</p></td>
+		</tr>
+	</tbody>
+</table>
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+    ```
+    MATCH (n)
+    RETURN n
+    ```
+  - ✓ Get all nodes with a label
+    ```
+    MATCH (movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Related nodes
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+  - ✓ Match with labels
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[]->(movie)
+    RETURN movie.title
+    ```
+  - ✓ Directed relationships and variable
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[r]->(movie)
+    RETURN type(r)
+    ```
+  - ✓ Match on relationship type
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})<-[:ACTED_IN]-(actor)
+    RETURN actor.name
+    ```
+  - ✓ Match on multiple relationship types
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[:ACTED_IN|:DIRECTED]-(person)
+    RETURN person.name
+    ```
+  - ✓ Match on relationship type and use a variable
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[r:ACTED_IN]-(actor)
+    RETURN r.role
+    ```
+
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+    ```
+    MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+    RETURN type(r)
+    ```
+  - ✓ Multiple relationships
+    ```
+    MATCH (charlie {name: 'Charlie Sheen'})-[:ACTED_IN]->(movie)<-[:DIRECTED]-(director)
+    RETURN movie.title, director.name
+    ```
+  - ✓ Variable-length relationships
+    ```
+    MATCH (martin {name: 'Charlie Sheen'})-[:ACTED_IN*1..3]-(movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Relationship variable in variable-length relationships
+    ```
+    MATCH p = (actor {name: 'Charlie Sheen'})-[:ACTED_IN*2]-(co_actor)
+    RETURN relationships(p)
+    ```
+  - ❏ Match with properties on a variable-length path
+    ```
+    MATCH p = (charlie:Person)-[* {blocked:false}]-(martin:Person)
+    WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+    RETURN p
+    ```
+  - ✓ Zero-length paths
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})-[*0..1]-(x)
+    RETURN x
+    ```
+  - ✓ Named paths
+
+    ```
+    MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+    ```
+
+  - ✓ Matching on a bound relationship
+
+    ```
+    MATCH (a)-[r]-(b)
+    WHERE id(r)= 0
+    RETURN a,b
+    ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (oliver:Person {name: 'Oliver Stone'}),
+    p = shortestPath((martin)-[*..15]-(oliver))
+    RETURN p
+    ```
+  - ✓ All shortest paths
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (michael:Person {name: 'Michael
+    Douglas'}), p = allShortestPaths((martin)-[*]-(michael))
+    RETURN p
+    ```
+
+- Get node or relationship by id
+
+  - ✓ Node by id
+    ```
+    MATCH (n)
+    WHERE id(n)= 0
+    RETURN n
+    ```
+  - ☒ Relationship by id
+    ```
+    MATCH ()-[r]->()
+    WHERE id(r) = 0
+    RETURN r
+    ```
+  - ✓ Multiple nodes by id
+    ```
+    MATCH (n)
+    WHERE id(n) IN [0, 3, 5]
+    RETURN n
+    ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+  ```
+  MATCH (n {name: 'B'}) RETURN n
+  ```
+
+  > **Note**
+  >
+  > Return `id` of n.
+
+- ✓ Return relationships
+
+  ```
+  MATCH (n {name: 'A'})-[r:KNOWS]->(c)
+  RETURN r
+  ```
+
+  > **Note**
+  >
+  > Return `EdgeUid` of r.
+
+- ✓ Return property
+  ```
+  MATCH (n {name: 'A'}) RETURN n.name
+  ```
+- ❏ Return all elements
+  ```
+  MATCH p = (a {name: 'A'})-[r]->(b)
+  RETURN *
+  ```
+- ❏ Variable with uncommon characters
+  ```
+  MATCH (`This isn\'t a common variable`)
+  WHERE `This isn\'t a common variable`.name = 'A'
+  RETURN `This isn\'t a common variable`.happy
+  ```
+- ✓ Aliasing a field
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age AS SomethingTotallyDifferent
+  ```
+- ✓ Optional properties
+  ```
+  MATCH (n)
+  RETURN n.age
+  ```
+- ❏ Other expressions
+
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age > 30, "I'm a literal", (a)-[]->()
+  ```
+
+  `(a)-[]->()` not supported.
+
+- ✓ Unique results
+  ```
+  MATCH (a {name: 'A'})-[]->(b)
+  RETURN DISTINCT b
+  ```
+
+### 2.4.WHERE
+
+- Basic usage
+
+  - ✓ Boolean operations
+    ```
+    MATCH (n)
+    WHERE n.name = 'Peter' XOR (n.age < 30 AND n.name = 'Tobias') OR NOT (n.name =
+    'Tobias' OR n.name = 'Peter')
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node label
+    ```
+    MATCH (n)
+    WHERE n:Swedish
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node property
+    ```
+    MATCH (n)
+    WHERE n.age < 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on relationship property
+    ```
+    MATCH (n)-[k:KNOWS]->(f)
+    WHERE k.since < 2000
+    RETURN f.name, f.age, f.email
+    ```
+  - ❏ Filter on dynamically-computed property
+    ```
+    WITH 'AGE' AS propname
+    MATCH (n)
+    WHERE n[toLower(propname)]< 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Property existence checking
+    ```
+    MATCH (n)
+    WHERE exists(n.belt)
+    RETURN n.name, n.belt
+    ```
+
+- String matching
+
+  - ✓ Match the beginning of a string
+    ```
+    MATCH (n)
+    WHERE n.name STARTS WITH 'Pet'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match the ending of a string
+    ```
+    MATCH (n)
+    WHERE n.name ENDS WITH 'ter'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match anywhere within a string
+    ```
+    MATCH (n)
+    WHERE n.name CONTAINS 'ete'
+    RETURN n.name, n.age
+    ```
+  - ✓ String matching negation
+    ```
+    MATCH (n)
+    WHERE NOT n.name ENDS WITH 's'
+    RETURN n.name, n.age
+    ```
+
+- Using path patterns in `WHERE`
+
+  - ✓ Filter on patterns
+    ```
+    MATCH (tobias {name: 'Tobias'}), (others)
+    WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+    RETURN others.name, others.age
+    ```
+  - ✓ Filter on patterns using NOT
+    ```
+    MATCH (persons), (peter {name: 'Peter'})
+    WHERE NOT (persons)-[]->(peter)
+    RETURN persons.name, persons.age
+    ```
+  - ✓ Filter on patterns with properties
+
+    ```
+    MATCH (n)
+    WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+    RETURN n.name, n.age
+    ```
+
+  - ✓ Filter on relationship type
+    ```
+    MATCH (n)-[r]->()
+    WHERE n.name='Andres' AND type(r) STARTS WITH 'K'
+    RETURN type(r), r.since
+    ```
+
+- Lists
+
+  - ✓ IN operator
+    ```
+    MATCH (a)
+    WHERE a.name IN ['Peter', 'Tobias']
+    RETURN a.name, a.age
+    ```
+
+- Missing properties and values
+
+  - ✓ Default to false if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white'
+    RETURN n.name, n.age, n.belt
+    ```
+  - ✓ Default to true if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+    ORDER BY n.name
+    ```
+  - ✓ Filter on null
+    ```
+    MATCH (person)
+    WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+    person.belt
+    ```
+
+- Using ranges
+
+  - ✓ Simple range
+    ```
+    MATCH (a)
+    WHERE a.name >= 'Peter'
+    RETURN a.name, a.age
+    ```
+  - ✓ Composite range
+    ```
+    MATCH (a)
+    WHERE a.name > 'Andres' AND a.name < 'Tobias'
+    RETURN a.name, a.age
+    ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 3
+  ```
+- ✓ Return middle two records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 1
+  LIMIT 2
+  ```
+- ✓ Using an expression with SKIP to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP toInteger(3*rand())+ 1
+  ```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT 3
+  ```
+- ✓ Using an expression with LIMIT to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT toInteger(3 * rand())+ 1
+  ```
+
+### 2.7.CREATE
+
+- Create nodes
+
+  > **Note**
+  >
+  > TuGraph does not support creating empty nodes and does not support multiple labels.
+
+  - ☒ Create single node
+    ```
+    CREATE (n)
+    ```
+  - ☒ Create multiple nodes
+    ```
+    CREATE (n), (m)
+    ```
+  - ✓ Create a node with a label
+    ```
+    CREATE (n:Person)
+    ```
+  - ☒ Create a node with multiple labels
+    ```
+    CREATE (n:Person:Swedish)
+    ```
+  - ✓ Create node and add labels and properties
+    ```
+    CREATE (n:Person {name: 'Andres', title: 'Developer'})
+    ```
+  - ✓ Return created node
+    ```
+    CREATE (a {name: 'Andres'})
+    RETURN a
+    ```
+
+- Create relationships
+
+  - ✓ Create a relationship between two nodes
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE]->(b)
+    ```
+  - ✓ Create a relationship and set properties
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE {name: a.name + '<->' + b.name}]->(b)
+    ```
+  - ✓ Create a full path
+    ```
+    CREATE p = (andres {name:'Andres'})-[:WORKS_AT]->(neo)<-[:WORKS_AT]-(michael {name:'Michael'})
+    RETURN p
+    ```
+
+- Use parameters with CREATE
+
+  - ❏ Create node with a parameter for the properties
+    ```
+    CREATE (n:Person $props)
+    RETURN n
+    ```
+  - ☒ Create multiple nodes with a parameter for their properties
+    ```
+    UNWIND $props AS map
+    CREATE (n)
+    SET n = map
+    ```
+    cannot create vertex without label.
+
+### 2.8.CALL\[…YIELD\]
+
+- ✓ Call a procedure using CALL
+  ```
+  CALL db.vertexLabels
+  ```
+- ✓ View the signature for a procedure
+  ```
+  CALL dbms.procedures() YIELD name, signature
+  WHERE name='dbms.listConfig'
+  RETURN signature
+  ```
+- ❏ Call a procedure using a quoted namespace and name
+  ```
+  CALL `db`.`vertexLabels`
+  ```
+- ✓ Call a procedure with literal arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+  ```
+- ❏ Call a procedure with parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+  ```
+- ❏ Call a procedure with mixed literal and parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+  ```
+- ✓ Call a procedure with literal and default arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+  ```
+- ✓ Call a procedure within a complex query using CALL…YIELD
+  ```
+  CALL db.vertexLabels() YIELD label
+  RETURN count(label) AS numLabels
+  ```
+- ✓ Call a procedure and filter its results
+  ```
+  CALL db.vertexLabels() YIELD label
+  WHERE label CONTAINS 'User'
+  RETURN count(label) AS numLabels
+  ```
+- ❏ Call a procedure within a complex query and rename its outputs
+  ```
+  CALL db.propertyKeys() YIELD propertyKey AS prop
+  MATCH (n)
+  WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+  ```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION ALL MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+- ❏ Combine two queries and remove duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION
+  MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>function</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="5"><p>Predicate functions</p></td>
+			<td><p>exists()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>all()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>any()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>single()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>none()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="16"><p>Scalar functions</p></td>
+			<td><p>id()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>properties()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>head()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>last()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toBoolean()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>toFloat()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toInteger()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toString()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>type()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>startnode()</p></td>
+            <td><p></p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>size()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>length()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+            <td><p>substring()</p></td>
+            <td><p></p></td>
+        </tr>
+        <tr class="odd">
+            <td><p>concat()</p></td>
+            <td><p></p></td>
+        </tr>
+        <tr class="even">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>label()</p></td>
+            <td><p>OpenCypher extension method</p></td>
+		</tr>
+        <tr class="even">
+			<td rowspan="12"><p>Aggregating functions</p></td>
+			<td><p>avg()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>collect()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>count()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>max()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>min()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>percentileCont()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>percentileDisc()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>stDev()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>stDevP()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+                <td><p>variance()</p></td>
+                <td></td>
+            </tr>
+        <tr class="odd">
+                <td><p>varianceP()</p></td>
+                <td></td>
+            </tr>
+        <tr class="even">
+                <td><p>sum()</p></td>
+                <td></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>List functions</p></td>
+			<td><p>keys()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>labels()</p></td>
+			<td><p></p></td>
+		</tr>
+	<tr class="odd">
+			<td><p>nodes()</p></td>
+			<td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>range()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>subscript()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="6"><p>Mathematical functions</p></td>
+			<td><p>abs()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>ceil()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>floor()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>rand()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>round()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>sign()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>String functions</p></td>
+			<td><p>/</p></td>
+			<td></td>
+		</tr>
+	</tbody>
+</table>
+
+### 3.2.Predicate functions
+
+- exists()
+
+  judge it whether a vertex or edge has the field .
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE exists(n.belt)
+  RETURN n.name, n.belt
+  ```
+
+  **Example output:**
+
+  | exists(name) |
+  | ------------ |
+  | true         |
+
+### 3.3.Scalar functions
+
+- id()
+
+  get the id of vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  RETURN id(a)
+  ```
+
+  **Example output:**
+
+  | vid |
+  | --- |
+  | 1   |
+  | 2   |
+  | ... |
+
+- properties()
+
+  get a map containing all the properties of a node or relationship.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  CREATE (p:Person {name: 'Stefan', city: 'Berlin'})
+  RETURN properties(p)
+  ```
+
+  **Example output:**
+
+  | properties                |
+  | ------------------------- |
+  | {name:Stefan,city:Berlin} |
+
+- head()
+
+  get the first element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, head(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | head(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "one"         |
+
+- last()
+
+  get the last element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, last(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | last(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "three"       |
+
+- toFloat()
+
+  Converts an integer or string value to a floating point number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toFloat('11.5'), toFloat('not a number')
+  ```
+
+  **Example output:**
+  | float |
+  | ----- |
+  | 11.5 |
+  |null|
+
+- toInteger()
+
+  Converts a floating point or string value to an integer value.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toInteger('2.3') AS integer
+  ```
+
+  **Example output:**
+
+  | integer |
+  | ------- |
+  | 2       |
+
+- toString()
+
+  Converts an integer, float, boolean value to a string.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toString(2.3)
+  ```
+
+- type()
+
+  get the string representation of the relationship type.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name = 'Alice'
+  RETURN type(r)
+  ```
+
+  **Example output:**
+
+  | type     |
+  | -------- |
+  | acted_in |
+  | acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+
+  Returns the average of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN avg(n.age)
+  ```
+
+  **Example output:**
+
+  | avg(n.born)        |
+  | ------------------ |
+  | 1869.2661654135338 |
+
+- collect()
+
+  Returns a list containing the values returned by an expression.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN collect(n.age)
+  ```
+
+  **Example output:**
+
+  | collect(n.born) |
+  | --------------- |
+  | [1967,...]      |
+
+- count()
+
+  Returns the number of values or records.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n {name: 'A'})-[]->(x)
+  RETURN labels(n), n.age, count(*)
+  ```
+
+  **Example output:**
+
+  | labels(n)  | n.age | count(\*) |
+  | ---------- | ----- | --------- |
+  | ["Person"] | 13    | 3         |
+
+- max()
+
+  Returns the maximum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN max(n.age)
+  ```
+
+  **Example output:**
+
+  | max(n.age) |
+  | ---------- |
+  | 44         |
+
+- min()
+
+  Returns the minimum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN min(n.age)
+  ```
+
+  **Example output:**
+
+  | min(n.age) |
+  | ---------- |
+  | 13         |
+
+- percentileCont()
+
+  Returns the percentile of a value over a group using linear interpolation.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileCont(n.age, 0.4)
+  ```
+
+  **Example output:**
+
+  | percentileCont(n.age, 0.4) |
+  | -------------------------- |
+  | 29                         |
+
+* percentileDisc()
+
+  Returns the nearest value to the given percentile over a group using a rounding method.
+
+  **Scope:** whole instance.
+
+  **Output:** the percentile of the given value over a group.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileDisc(n.age, 0.5)
+  ```
+
+  **Example output:**
+
+  | percentileDisc(n.age, 0.5) |
+  | -------------------------- |
+  | 33                         |
+
+* stDev()
+
+  Returns the standard deviation for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDev(n.age)
+  ```
+
+  **Example output:**
+
+  | stDev(n.age)       |
+  | ------------------ |
+  | 15.716233645501712 |
+
+* stDevP()
+
+  Returns the standard deviation for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDevP(n.age)
+  ```
+
+  **Example output:**
+
+  | stDevP(n.age)      |
+  | ------------------ |
+  | 12.832251036613439 |
+
+* variance()
+
+  Returns the variance for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN variance(n.age)
+  ```
+
+  **Example output:**
+
+  | variance(n.age) |
+  | --------------- |
+  | 247             |
+
+* varianceP()
+
+  Returns the variance for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN varianceP(n.age)
+  ```
+
+  **Example output:**
+
+  | varianceP(n.age) |
+  | ---------------- |
+  | 164.66666666667  |
+
+* sum()
+
+  Returns the sum of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN sum(n.age)
+  ```
+
+  **Example output:**
+
+  | sum(n.age) |
+  | ---------- |
+  | 90         |
+
+### 3.5.List Funtions:
+
+- keys()
+
+  get the field names of some vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN keys(a)
+  ```
+
+  **Example output:**
+
+  | keys(a)               |
+  | --------------------- |
+  | ["name","age","eyes"] |
+
+- labels()/label()
+
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN labels(a)
+  ```
+
+  **Example output:**
+
+  | labels                 |
+  | ---------------------- |
+  | ["Person","Developer"] |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice'})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+### 3.6.Mathematical functions
+
+- abs()
+
+  get the absolute value of some data.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a), (e)
+  WHERE a.name = 'Alice' AND e.name = 'Eskil'
+  RETURN a.age, e.age, abs(a.age - e.age)
+  ```
+
+  **Example output:**
+
+  | a.age | e.age | abs(a.age - e.age) |
+  | ----- | ----- | ------------------ |
+  | 38    | 41    | 1                  |
+
+- ceil()
+
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+  **Example input:**
+
+  ```
+  RETURN ceil(0.1)
+  ```
+
+  **Example output:**
+
+  | ceil(0.1) |
+  | --------- |
+  | 1.0       |
+
+- floor()
+
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN floor(0.9)
+  ```
+
+  **Example output:**
+
+  | floor(0.9) |
+  | ---------- |
+  | 0.0        |
+
+- round()
+
+  Returns the value of a number rounded to the nearest integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN round(3.141592)
+  ```
+
+  **Example output:**
+
+  | round |
+  | ----- |
+  | 3     |
+
+- rand()
+
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN rand()
+  ```
+
+  **Example output:**
+
+  | rand()             |
+  | ------------------ |
+  | 0.9797131960534085 |
+
+- sign()
+
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN sign(-17), sign(0.1)
+  ```
+
+  **Example output:**
+
+  | sign(-17) | sign(0.1) |
+  | --------- | --------- |
+  | -1        | 1         |
+
+## 4.Extensions To OpenCypher
+
+- Number of Labels
+
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+
+  - OpenCypher: One node/relationship may have 0 to many labels.
+
+- Schema.
+
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.Procedures
+
+### 5.1.procedures' demos
+
+- dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                               | name            |
+  | --------------------------------------- | --------------- |
+  | db.vertexLabels() :: (label::STRING)    | db.vertexLabels |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels   |
+  | db.indexes() :: (index::LIST)           | db.indexes      |
+  | ...                                     | ...             |
+
+- db.vertexLabels()
+
+  Lists all available labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+
+  **Example output:**
+
+  | label   |
+  | ------- |
+  | genre   |
+  | keyword |
+  | movie   |
+  | ...     |
+
+- db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edgeLabels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | edgeLabel |
+  | --------- |
+  | acted_in  |
+  | directed  |
+  | ...       |
+
+- db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter     | parameter type | description                   |
+  | ------------- | -------------- | ----------------------------- |
+  | label_name    | string         | name of vertex label          |
+  | primary_field | string         | primary field of vertex label |
+  | field_spec    | list           | specification of a field      |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+  **Output:** If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added label [Person]
+  ```
+
+- db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description                   |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field             |
+  | type       | string     | type of the field             |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name         | type   | optional |
+  | ------------ | ------ | -------- |
+  | id           | INT32  | false    |
+  | born         | INT32  | true     |
+  | name         | STRING | true     |
+  | poster_image | STRING | true     |
+
+- db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | label_type | string         | either 'vertex' or 'edge'                                             |
+  | label_name | string         | name of the label                                                     |
+  | extra      | string         | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list           | specification of a field                                              |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.
+  for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+- db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:**
+
+  | field_name | field_type | description                      |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description                   |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string          | either 'vertex' or 'edge'     |
+  | label_name  | string          | name of the label             |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description               |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string         | either 'vertex' or 'edge' |
+  | label_name       | string         | name of the label         |
+  | field_value_spec | list           | specification of a field  |
+
+  in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, 'optional']`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+  | field_spec | list           | specification of a field  |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelModFields(
+  'vertex',
+  'new_label',
+  ['birth_date', 'DATETIME', '1900-01-01 00:00:00'],
+  ['gender', 'BOOL', false])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description              |
+  | ---------------- | -------------- | ------------------------ |
+  | label_name       | string         | name of the label        |
+  | edge_constraints | string         | edge constraints         |
+  | field_spec       | list           | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for optional fields.
+
+- `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32,true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+- db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+- db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+- | pair_unique  | boolean        | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+- dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description          |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string         | the current password |
+  | new_password     | string         | new password         |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string         | the user's name |
+  | new_password | string         | new password    |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.createUser(user_name, password)
+
+  create new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | ------------------------ |
+  | user_name | string         | the new user name        |
+  | password  | string         | the password of new user |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string         | the user name to be deleted |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string         | the user name               |
+  | is.admin  | boolean        | the permission of this user |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       | ...      |
+
+- dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description           |
+  | --------- | -------------- | --------------------- |
+  | user.user | string         | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+- dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+  a list of ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host         |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...          |
+
+- dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been deleted.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description                      |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string         | the name of new subgraph         |
+  | description | string         | description of new subgraph      |
+  | max_size_GB | integer        | Upper limit of subgraph capacity |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+  | config     | map            | the configuration to be modified     |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.listGraphs()
+
+  get all subgraph in this graph database .
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.config.list()
+
+  get some config of this graph database .
+
+  **Output:**
+
+  a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  | --------- | ------- |
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       | ...     |
+
+- dbms.config.update(updates)
+
+  get some config of this graph database .
+
+  **Output:**
+
+  If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+      enable_ip_check:false,
+      durable:true,
+      optimistic_txn:true,
+      enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+- dbms.takeSnapshot()
+
+  take the snapshot on this current graph database.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+- dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path                       |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+- algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                                                             |
+  | --------- | -------------- | --------------------------------------------------------------------------------------- |
+  | startNode | Node           | the source node of paths                                                                |
+  | endNode   | Node           | the destination node paths                                                              |
+  | config    | MAP            | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+  If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2         | 1         |
+
+- algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+- algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                               |
+  | --------- | -------------- | --------------------------------------------------------- |
+  | id        | ANY            | the id of vertexes or edges , the id must be variable     |
+  | config    | MAP            | the configuration of this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or it is an edge id.
+
+  **Output:**
+
+  If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.Whole List Of Procedures
+
+| Name                                  | Description                                                          | Signature                                                                                                                                                                                |
+|---------------------------------------|----------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.vertexLabels                       | list all vertex labels                                               | db.vertexLabels() :: (label::STRING)                                                                                                                                                     |
+| db.edgeLabels                         | list all edge labels                                                 | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                  |
+| db.indexes                            | list all indexes                                                     | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                     |
+| db.listLabelIndexes                   | list indexes by label                                                | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                           |
+| db.warmup                             | warm up the DB                                                       | db.warmup() :: (time_used::STRING)                                                                                                                                                       |
+| db.createVertexLabel                  | create a vertex label                                                | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                   |
+| db.createLabel                        | create a vertex/edge label                                           | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                              |
+| db.getLabelSchema                     | get the schema of label                                              | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                                |
+| db.getVertexSchema                    | get the schema of vertex label                                       | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                       |
+| db.getEdgeSchema                      | get the schema of edge label                                         | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                         |
+| db.deleteLabel                        | delete vertex/edge label                                             | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                        |
+| db.alterLabelDelFields                | delete some fields of a label on a subgraph                          | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                             |
+| db.alterLabelAddFields                | add some fields of a label on a subgraph                             | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                  |
+| db.alterLabelModFields                | modify some fields of a label on a subgraph                          | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                        |
+| db.createEdgeLabel                    | create a edge label                                                  | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                      |
+| db.addIndex                           | add an index                                                         | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                           |
+| db.addEdgeIndex                       | add an index                                                         | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                  |
+| db.deleteIndex                        | delete an index                                                      | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                        |
+| db.backup                             | backup the db                                                        | db.backup(destination::STRING) :: ()                                                                                                                                                     |
+| dbms.procedures                       | list all procedures                                                  | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                    |
+| dbms.security.changePassword          | change current user password                                         | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                  |
+| dbms.security.changeUserPassword      | change user password                                                 | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                     |
+| dbms.security.createUser              | create an account                                                    | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.deleteUser              | delete an account                                                    | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.listUsers               | list all accounts                                                    | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                          |
+| dbms.security.showCurrentUser         | get current user name                                                | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                                |
+| dbms.security.getUserPermissions      | get the permissions of a specified user                              | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                  |
+| dbms.graph.createGraph                | create a subgraph                                                    | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                        |
+| dbms.graph.modGraph                   | modify the config of a subgraph                                      | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                          |
+| dbms.graph.deleteGraph                | delete a subgraph                                                    | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                   |
+| dbms.graph.listGraphs                 | list all subgraphs                                                   | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                       |
+| dbms.graph.getGraphInfo               | get the information of a specified graph                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                     |
+| dbms.security.addAllowedHosts         | add to the trust list                                                | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                         |
+| dbms.security.deleteAllowedHosts      | remove from the trust list                                           | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                              |
+| dbms.security.listAllowedHosts        | list the trust list                                                  | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                       |
+| dbms.config.update                    | update the configuration                                             | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                    |
+| dbms.config.list                      | list the configuration                                               | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                          |
+| algo.shortestPath                     | get a shortest path between two vertexes                             | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                    |
+| algo.allShortestPaths                 | get all the shortest paths between two vertexes                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                     |
+| algo.native.extract                   | get the field values of a list of vertexes or edges specified id     | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                 |
+| db.flushDB                            | flush the db                                                         | db.flushDB() :: (::VOID)                                                                                                                                                                 |
+| dbms.security.listRoles               | list all roles                                                       | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                          |
+| dbms.security.createRole              | create a role                                                        | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                     |
+| dbms.security.deleteRole              | delete a role                                                        | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.getRoleInfo             | get the role information                                             | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                              |
+| dbms.security.disableRole             | enable/disable the role                                              | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.modRoleDesc             | modify the description of a role                                     | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.rebuildRoleAccessLevel  | rebuild the user subgraph access rights                              | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                         |
+| dbms.security.modRoleAccessLevel      | modify the user subgraph access rights                               | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                             |
+| dbms.security.modRoleFieldAccessLevel | modify the user property access rights                               | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                  |
+| dbms.security.getUserInfo             | get the user information                                             | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                              |
+| dbms.security.getUserMemoryUsage      | get the memory usage for a user                                      | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                                |
+| dbms.security.disableUser             | enable/disable the user                                              | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.setCurrentDesc          | set the current user description                                     | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                            |
+| dbms.security.setUserDesc             | set user description                                                 | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.setUserMemoryLimit      | set user memory limit                                                | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                          |
+| dbms.security.deleteUserRoles         | delete roles from the user                                           | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                      |
+| dbms.security.rebuildUserRoles        | rebuild the relationship between the user and the role               | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.addUserRoles            | add the user roles                                                   | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                         |
+| db.plugin.loadPlugin                  | load a plugin                                                        | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN, version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | unload a plugin                                                      | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                              |
+| db.plugin.listPlugin                  | list all plugins                                                     | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                           |
+| db.plugin.getPluginInfo               | get the information of a specified plugin                            | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                           |
+| db.plugin.callPlugin                  | execute the plugins                                                  | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                     |
+| db.importor.dataImportor              | import vertex/edge data                                              | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                              |
+| db.importor.schemaImportor            | import vertex/edge schema                                            | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                              |
+| dbms.meta.count                       | get the total number of vertex and edge                              | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                  |
+| dbms.meta.countDetail                 | get the number of vertex and edge for each label                     | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                        |
+| dbms.meta.refreshCount                | recount the number of vertex and edge, stop writing during the count | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                  |
+| dbms.task.listTasks                   | list running tasks                                                   | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                     |
+| dbms.task.terminateTask               | terminate task                                                       | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                       |
+| dbms.ha.clusterInfo                   | get cluster info in HA mode                                          | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                        |
+| db.dropDB                             | empty the db                                                         | db.dropDB() :: (::VOID)                                                                                                                                                                  |
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/8.query/2.gql.md
new file mode 100644
index 0000000000..ea00f3ceb1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/8.query/2.gql.md
@@ -0,0 +1,392 @@
+# ISO GQL
+
+
+## 1.Introduction to ISO GQL
+
+Graph Query Language (GQL) is an upcoming International Standard language for property graph querying. It builds on the foundations of SQL and integrates proven ideas from the existing [openCypher, PGQL, GSQL, and G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/) languages. The standard is currently in the draft stage.
+
+TuGraph has implemented GQL based on the [ISO GQL (ISO/IEC 39075) Antlr4 grammar file](https://github.com/TuGraph-family/gql-grammar). It includes some extensions and modifications. Not all GQL syntax is fully supported at the moment, but we will continue to improve and enhance it in the future.
+
+## 2.List of Clauses
+
+| Category            | Clauses        |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+
+### 2.1.MATCH
+
+The `MATCH` clause is the most basic clause in GQL, and almost all queries are expanded through `MATCH`.
+
+The `MATCH` clause is used to specify the matching pattern to search in the graph, to match vertices or paths that meet certain conditions.
+
+
+#### Vertex basics
+
+##### Get all vertices
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### Get all vertices with a label
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### Vertex matching with property
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### Vertex matching with filter
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Edge basics
+
+##### Edge pointing right
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### Edge pointing left
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### Edge matching with filter
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+return
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### Path matching
+
+##### Variable length
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+return
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+The `OPTIONAL MATCH` clause matches a graph pattern and returns `null` if there is no match.
+
+
+#### Match found
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### Match Not Found
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+return
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+The `RETURN` clause specifies the results to be returned, including vertices, edges, paths, properties, etc.
+
+#### Return vertices
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+return
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### Return edges
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+return
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### Return property
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Uncommon string used as variable name
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### Alias
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+return
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### Optional property
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### Other expressions
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+return
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### Distinct
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+return
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+The `NEXT` clause is used to connect multiple clauses.
+
+#### Connecting MATCH clauses
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE` clause is used to filter records.
+
+#### Filter vertex
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+returns
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### Filter edge
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+returns
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### Boolean expressions
+
+`AND`, `OR`, `XOR`, and `NOT` Boolean expressions can be used in the `WHERE` clause to filter data.
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+returns
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+### 2.6.ORDER BY
+
+`ORDER BY` is a clause of `RETURN` that sorts the output result.
+
+#### Sorting the Result
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+return
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP` specifies the offset of the result rows.
+
+#### Without SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### Using SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+The `LIMIT` clause is used to limit the number of rows in the result.
+
+#### Using LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/8.query/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/8.query/index.rst
new file mode 100644
index 0000000000..5e736c4232
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/8.query/index.rst
@@ -0,0 +1,9 @@
+Query
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..83ba668355
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,342 @@
+# TuGraph Stored Procedure Guide
+
+> This document mainly explains the instructions for using the TuGraph stored procedure.
+
+## 1. Introduction
+
+When the query/update logic that users need to express is more complex (such as cannot be described by Cypher or has high performance requirements), compared to calling multiple requests and completing the entire processing flow on the client, the stored procedure provided by TuGraph is a more concise and efficient choice.
+
+Similar to traditional databases, the TuGraph stored procedure runs on the server side. Users can encapsulate the processing logic (i.e., multiple operations) into a procedure call, and further improve performance by parallel processing (such as using relevant C++ OLAP interfaces and built-in algorithms) during implementation.
+
+There is a special type of API in the stored procedure for parallel data operations, which we call the Traversal API. Please refer to the [documentation](2.traversal.md) for more information.
+
+## 2. Stored Procedure Version
+
+Currently, TuGraph supports two versions of stored procedures, which are suitable for different scenarios. Version 3.5 only supports v1, which can be directly called through the REST or RPC interface. Starting from version 3.5, v2 is supported, which allows embedding calls in graph query languages ​​(such as Cypher). We call it POG (Procedure On Graph query language, APOC).
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+|Applicable Scenarios	|Extreme performance or complex multi-transaction management scenarios	|General scenarios, highly integrated with Cypher|
+|Transaction	|Created internally in the function, multiple transactions |can be freely controlled	Passed into the external function, single transaction|
+|Signature (parameter definition)	|Not required	|Required|
+|Input and output parameter types	|Not required to specify	|Need to specify parameter types|
+|Cypher Standalone Call	|Supported	|Supported
+|Cypher Embeded Call	|Not supported	|Supported|
+|Language	|C++/Python/Rust	|C++|
+|Calling mode	|Directly pass the string, usually in JSON format	|Through variables in Cypher statements|
+
+
+In TuGraph, stored procedures v1 and v2 are managed separately, and support for create, delete, and query operations is provided. However, it is still not recommended to have the same name for multiple stored procedures.
+
+## 3. Supported Languages
+
+In TuGraph, users can dynamically load, update, and delete stored procedures. TuGraph supports the use of C++, Python, and Rust languages to write stored procedures. Among them, C++ language has the most complete support and the best performance.
+
+Note that the stored procedure is the logic compiled and executed on the server side, which is independent of the language support on the client side.
+
+## 4. Procedure v1 Interface
+
+## 4.1.Write stored procedures
+### 4.1.1.Write C++ stored procedure
+
+Users can write C stored procedures by using core API or Traversal API. An example of a simple C stored procedure is as follows:
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## Count all students whose age is 10
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+From the code, we can see the entry of a TuGraph C++ stored procedure is the `Process` function, with three parameters:
+
+- `db`: the TuGraph database instance
+- `request`: the input data, which can be a binary byte array, or any other format such as JSON string.
+- `response`: the output data, which can be a string or directly return binary data.
+
+The return value of the `Process` function is a boolean value. When it returns `true`, it means that the request is successfully completed, otherwise it means that the stored procedure found an error during execution, and the user can return an error message through `response` to facilitate debugging.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which is `age_10` in the above example. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, age_10.so will be generated, which can then be loaded into the server by the user.
+
+### 4.1.2 Writing Python stored procedures
+
+The following snippet does the same thing as the above C++ stored procedure, but via TuGraph Python API:
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+The Python stored procedure returns a tuple, the first element of which is a Boolean value indicating whether the stored procedure was successfully executed; the second element is a `str`, which contains the result to be returned.
+
+Python stored procedures do not need to be compiled and can be loaded directly.
+
+## 4.2.How to use stored procedures
+
+### 4.2.1.Install Stored Procedures
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `age_10.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+                  headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `age_10.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+### 4.2.2.List Stored Procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.Retrieve Stored Procedures Detail
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.Uninstall Stored Procedures
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+### 4.2.6.Upgrade Stored Procedures
+
+You can upgrade a stored procedure with the following two steps:
+
+1. Uninstall the existing one.
+2. Install the new on.
+
+TuGraph carefully manages the concurrency of stored procedure operations. Upgrading stored procedures will not affect concurrent runs of existing ones.
+
+## 5. Procedure v2 Interface
+
+### 5.1.Writing stored procedures
+
+Users can write C++ stored procedures by using lgraph API. A simple C++ stored procedure example is as follows:
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+From the code we can see:
+- The stored procedure defines a method `GetSignature` to get the signature. This method returns the signature of the stored procedure, which includes input parameter names and their types, and return parameters and their types. This enables the Cypher query statement to use the signature information to verify whether the input data and the returned data are reasonable when calling the stored procedure.
+- The entry function is the `ProcessInTxn` function, which has three parameters, which are:
+
+- `txn`: The transaction of the stored procedure, generally speaking, the transaction of the Cypher statement that calls the stored procedure.
+- `request`: input data, its content is the string of the input parameter type defined in `GetSignature` and the value passed in the Cypher query statement after json serialization. e.g. `{num_iteration: 10}`
+- `response`: output data, in order to ensure compatibility in the Cypher language, users can write the data processed by the stored procedure to `lgraph_api::Result`, and finally use `lgraph_api::Result::Dump` to serialize it into data in json format.
+
+The return value of the `ProcessInTxn` function is a boolean value. When it returns `true`, it means that the request was successfully completed, otherwise it means that the stored procedure found an error during execution.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which in the above example is `custom_pagerank`. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, custom_pagerank.so will be generated, which can then be loaded into the server by the user.
+
+### 5.2.Load stored procedure
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `custom_pagerank.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `custom_pagerank.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+#### 5.2.1.List loaded stored procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.Get stored procedure details
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.Delete stored procedure
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+#### 5.2.5.Update stored procedure
+
+Updating a stored procedure requires the following two steps:
+
+1. Delete the existing stored procedure
+2. Install the new stored procedure
+
+TuGraph carefully manages the concurrency of stored procedure operations, and updating stored procedures will not affect the operation of existing stored procedures.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..e4abd3a263
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,125 @@
+# Traversal API
+
+> This document mainly explains the Traversal API in the stored procedure of TuGraph.
+
+1. Introduction
+The powerful online analytical processing (OLAP) capability of TuGraph is an important feature that sets it apart from other graph databases. With the help of the C++ OLAP API (olap_on_db.h), users can quickly export a subgraph that needs to be analyzed, and then run iterative graph computing processes such as PageRank, connected components, and community detection on it, and then make corresponding decisions based on the results. The export and computation processes can be accelerated through parallel processing, achieving almost real-time analysis and processing, and avoiding the lengthy steps of traditional solutions that require exporting, transforming, and reimporting (ETL) data into dedicated analytical systems for offline processing.
+
+TuGraph has built-in many commonly used graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement specific graph computing processes themselves. They just need to include the header files (.h files) of the corresponding algorithm library in their own programs when implementing their own storage procedures, and link the corresponding dynamic library files (.so) during compilation. In general, the only process that users need to implement themselves is the extraction of the subgraph to be analyzed.
+
+Currently, the Traversal API only supports C++.
+
+## 2. Interface
+
+### 2.1. Snapshot
+
+The Snapshot template class in C++ OLAP API is used to represent extracted static subgraphs. The EdgeData is used to represent the data type of the weight used for each edge in the subgraph. If the edges do not require weights, Empty is used as the EdgeData.
+
+The extracted subgraph can be described using the constructor of the Snapshot class.
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+In the above text, "db" represents the database handle, "txn" represents the transaction handle, and "flags" represents the options used during generation, with the optional values including the following combinations: SNAPSHOT_PARALLEL indicates that multiple threads are used for parallel extraction during export; SNAPSHOT_UNDIRECTED indicates that the exported graph needs to be transformed into an undirected graph.
+
+"vertex_filter" is a user-defined filtering function for vertices, where a return value of true indicates that the vertex needs to be included in the extracted subgraph, and vice versa.
+
+"out_edge_filter" is a user-defined filtering function for edges, where a return value of true indicates that the edge needs to be included in the extracted subgraph, and vice versa.
+
+When the filtering functions are set to default values, it means that all vertices/edges should be included.
+
+For other methods provided by the Snapshot class, please refer to the detailed C++ API documentation (olap_on_db.h).
+
+### 2.2. Traversal
+
+A common type of analysis in graph databases is to start from one or more vertices and iteratively expand and access their neighbors. Although this type of analysis can be done using Cypher, its performance is limited by the serial interpretation and execution when the depth of traversal is large. Writing stored procedures using the C++ Core API eliminates the overhead of interpretation but is still limited by the processing power of a single thread.
+
+In order to enable users to accelerate these types of analysis tasks through parallel processing, we have wrapped a Traversal framework based on the C++ OLAP API. Users can directly use the FrontierTraversal and PathTraversal classes in this framework to perform iterative traversal analysis tasks. For specific usage instructions, please refer to the corresponding C++ API documentation (lgraph_traversal.h).
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+This method can be used to find all vertices that satisfy a certain condition (when the filter returns true). When the "parallel" parameter is set to true, the search process will be executed in parallel.
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+This method can be used to extract (VertexData type) properties from a specified set of vertices (frontier) using the extract method. When the "parallel" parameter is set to true, the extraction process will be executed in parallel.
+
+FrontierTraversal is suitable for cases where only the traversed set of vertices is of interest. When a user needs to access information along the path (vertices/edges along the path) in the traversal process or result, PathTraversal needs to be used. Both types of traversal have four parameters in their constructor, namely the database handle db, transaction handle txn, options flags and capacity. The available options include the following combinations: TRAVERSAL_PARALLEL indicates that multiple threads are used for parallel traversal; TRAVERSAL_ALLOW_REVISITS indicates that vertices can be visited repeatedly during traversal (PathTraversal implicitly includes this option).
+capacity indicates the capacity of the path collection during initialization.
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+Both types of traversal have three ways to set the starting vertex/vertex set for traversal. The first two methods directly specify the vertex ID, while the last method is similar to FindVertices.
+
+Both types of traversal start from the set of vertices in the current layer. They use the extension function to access each outgoing edge/incoming edge/outgoing and incoming edges, and use a user-defined filter function to determine if the extension is successful. If successful, the neighboring vertex/appended path with the edge is added to the set of vertices/paths in the next layer.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+The above describes the three traversal methods of FrontierTraversal. It starts from the current set of vertices and, for each vertex in the set, iterates through each outgoing edge/incoming edge/outgoing and incoming edges. If the edge or neighbor vertex satisfies the user-defined filter conditions (where edge_filter is the filter function for edges and neighbour_filter is the filter function for neighbor vertices), the neighbor vertex is added to the new set of vertices.
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+After the expansion of the current set of vertices is finished, the new set of vertices can be obtained using the above method.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+The three traversal methods of PathTraversal are similar to FrontierTraversal, except that the user-defined filter function adds two additional parameters: Path, which contains the path before the new edge is expanded, and IteratorHelper, which can be used to convert the vertices/edges in the path to corresponding iterators in the database. The relevant documentation can be found in the corresponding C++ API documentation.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.md
new file mode 100644
index 0000000000..9c4a7e07fc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.md
@@ -0,0 +1,11447 @@
+
+
+             
+  <section id="c-stored-procedures">
+
+<div class="toctree-wrapper compound">
+</div>
+<section id="base64-encode">
+<h2>base64_encode<a class="headerlink" href="#base64-encode" title="Permalink to this headline"></a></h2>
+<p>Base64 encode and decode. Simple implementation, to be used with BLOB fields. If performance is important, look for an optimized implementation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_api">
+<span id="_CPPv310lgraph_api"></span><span id="_CPPv210lgraph_api"></span><span id="lgraph_api"></span><span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><a class="headerlink" href="#_CPPv410lgraph_api" title="Permalink to this definition"></a><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base64E">
+<span id="_CPPv3N10lgraph_api6base64E"></span><span id="_CPPv2N10lgraph_api6base64E"></span><span id="lgraph_api::base64"></span><span class="target" id="namespacelgraph__api_1_1base64"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6base64E" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="lgraph_api::base64::Encode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1a18e9a89247359b1a4abc31183a17f8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to encode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The encoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="lgraph_api::base64::Encode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1c276e294945b5f438b8ea942692e730"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__cCP.s.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac29334d4c57dcc18603ff6ad813e6cb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ret</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string. </p></li>
+<li><p><strong>ret</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__ssCR.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a970296461b9202f8fb91e56590fb160b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">out</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string to decode. </p></li>
+<li><p><strong>out</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="lgraph_api::base64::Decode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac2d795c4f1fcd79f41e3bb8591c03c81"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="lgraph_api::base64::Decode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ab07cfe3bb273d86861a477a435a7686a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph">
+<h2>lgraph<a class="headerlink" href="#lgraph" title="Permalink to this headline"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.LGAPI">
+<span class="target" id="lgraph_8h_1ad89ce29b199ac3372f644ffc910a466a"></span><span class="sig-name descname"><span class="n"><span class="pre">LGAPI</span></span></span><a class="headerlink" href="#c.LGAPI" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12GetSignatureE">
+<span id="_CPPv3N10lgraph_api12GetSignatureE"></span><span id="_CPPv2N10lgraph_api12GetSignatureE"></span><span id="lgraph_api::GetSignature"></span><span class="target" id="namespacelgraph__api_1a0e7238ee4b0e28208b594b2bc334b031"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSignature</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7SigSpecE" title="lgraph_api::SigSpec"><span class="n"><span class="pre">SigSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sig_spec</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12GetSignatureE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7ProcessE">
+<span id="_CPPv3N10lgraph_api7ProcessE"></span><span id="_CPPv2N10lgraph_api7ProcessE"></span><span id="lgraph_api::Process"></span><span class="target" id="namespacelgraph__api_1abc0e7fd5062a22bca6290439450eb245"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Process</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7ProcessE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12ProcessInTxnE">
+<span id="_CPPv3N10lgraph_api12ProcessInTxnE"></span><span id="_CPPv2N10lgraph_api12ProcessInTxnE"></span><span id="lgraph_api::ProcessInTxn"></span><span class="target" id="namespacelgraph__api_1afb8681ba4f3cc04bdc96b9b8ccc17775"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessInTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6ResultE" title="lgraph_api::Result"><span class="n"><span class="pre">Result</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12ProcessInTxnE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-atomic">
+<h2>lgraph_atomic<a class="headerlink" href="#lgraph-atomic" title="Permalink to this headline"></a></h2>
+<p>Implementation of atomic operations, used in lgraph_traversal. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api3casEbP1T1T1T">
+<span id="_CPPv3I0EN10lgraph_api3casEP1T1T1T"></span><span id="_CPPv2I0EN10lgraph_api3casEP1T1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab1806f690b319d23b933206cd295f745"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cas</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">ptr</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">oldv</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">newv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_minEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_minEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_minEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1acd8330b393c3cb2b46c461119f4aa484"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_min</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_maxEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_maxEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_maxEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a451eee503d74e69ad9fc6db943ee446f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_max</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_addEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_addEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_addEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab5f65d4fa238b2bc6675bba789e5d635"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_add__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a17b724a3f516c98594033b9cbf7e2dd6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_add__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1ae1334e7bca1be121f4a9099ee1499872"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="lgraph_api::write_add__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1ab7aec34df35e5fe40f87f17cd8384759"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="lgraph_api::write_add__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a4688a3165d87b264a0f0e0d747add460"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_subEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_subEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_subEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a34d077b3ffee356fb73bdc35a7cb8819"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_sub__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a3e0a202ef30dd1729c3671b217c7a0b3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_sub__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1aa321f049db89fbc2c821e62ede09b00e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="lgraph_api::write_sub__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1adc6709b36af7ba0701e624044f2cf9d0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="lgraph_api::write_sub__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a15cf35d73dc33e1a0fad97647beaca63"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-date-time">
+<h2>lgraph_date_time<a class="headerlink" href="#lgraph-date-time" title="Permalink to this headline"></a></h2>
+<p>Implemnets the DateTime, Date and TimeZone classes. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="lgraph_api::MinDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a7d4a5022a392e2f121804ec89c1f4819"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="lgraph_api::MaxDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a57143a0e3c25aaa249ec45411aeed284"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Maximum days since epoch for date. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MinMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ace6f22166909871827c64134bc108c4f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MaxMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ae9241a416800bd43775b274c3d68b24a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Maximum microseconds since epoch for date time. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api4DateE"></span><span id="lgraph_api::Date"></span><span class="target" id="classlgraph__api_1_1Date"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4DateE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> class. Range of dates is from 0/1/1 to 12/31/9999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateEv">
+<span id="_CPPv3N10lgraph_api4Date4DateEv"></span><span id="_CPPv2N10lgraph_api4Date4DateEv"></span><span id="lgraph_api::Date::Date"></span><span class="target" id="classlgraph__api_1_1Date_1aff49fc2cda4491ff4457ca481bb8edf9"></span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with the date set to 1970/1/1. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::Date::Date__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1Date_1a1d304cb3d2f5bedd0a4585c4a1e6af70"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified time. The time point must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>tp</strong> – Time point to set the date to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay">
+<span id="_CPPv3N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="_CPPv2N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="lgraph_api::Date::Date__YearMonthDayCR"></span><span class="target" id="classlgraph__api_1_1Date_1ac753f0ab0017908da2e04a5601fbbb02"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymd</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified date. The date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>ymd</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateE7int32_t">
+<span id="_CPPv3N10lgraph_api4Date4DateE7int32_t"></span><span id="_CPPv2N10lgraph_api4Date4DateE7int32_t"></span><span id="lgraph_api::Date::Date__int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1afb34a93316bafa170db694675f3ba391"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateE7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to an offset from epoch, i.e. the date is set to the specified number of days from epoch. The result date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days_since_epoch</strong> – Number of days since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="lgraph_api::Date::Date__ssCR"></span><span class="target" id="classlgraph__api_1_1Date_1aa34be0efffbb041680f06e2e51226b64"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from a YYYY-MM-DD string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if the string is not in the correct format.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>str</strong> – The string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv">
+<span id="_CPPv3NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="_CPPv2NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="lgraph_api::Date::GetYearMonthDayC"></span><span class="target" id="classlgraph__api_1_1Date_1ab2d9b29e32b6adb74401c6d85fd5ffb0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYearMonthDay</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The year month day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateplEi">
+<span id="_CPPv3NK10lgraph_api4DateplEi"></span><span id="_CPPv2NK10lgraph_api4DateplEi"></span><span id="lgraph_api::Date::add-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1ad3fe85f66511da6deb3ca8d54edf51bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateplEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a number of days to the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatepLEi">
+<span id="_CPPv3N10lgraph_api4DatepLEi"></span><span id="_CPPv2N10lgraph_api4DatepLEi"></span><span id="lgraph_api::Date::add-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1a3b36b3e6261a05420139a4eba5eea5dd"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatepLEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a number of days to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Reference to the current date. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DatemiEi">
+<span id="_CPPv3NK10lgraph_api4DatemiEi"></span><span id="_CPPv2NK10lgraph_api4DatemiEi"></span><span id="lgraph_api::Date::sub-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1a54622b3edddecff4df3c9f572a7cdcc5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DatemiEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of days from the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatemIEi">
+<span id="_CPPv3N10lgraph_api4DatemIEi"></span><span id="_CPPv2N10lgraph_api4DatemIEi"></span><span id="lgraph_api::Date::sub-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1aaa15a5d3c4427b09ebb8e2bba5de64b5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatemIEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of days from the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Reference to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateltERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateltERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateltERK4Date"></span><span id="lgraph_api::Date::lt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abf811a8c8e2765b24426cc2ff6fe13f9"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateltERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateleERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateleERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateleERK4Date"></span><span id="lgraph_api::Date::lte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1a3c9beee445a203e18d4a9145132f7b2f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateleERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategtERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategtERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategtERK4Date"></span><span id="lgraph_api::Date::gt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1af35d39c86aa4c554db7e553b09708907"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategtERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategeERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategeERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategeERK4Date"></span><span id="lgraph_api::Date::gte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abd180b0c29b2c846b8d58e2b4c9e822a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategeERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateeqERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateeqERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateeqERK4Date"></span><span id="lgraph_api::Date::eq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1ac8e2b0b0dfb86a868f9d602643a58dae"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateeqERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateneERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateneERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateneERK4Date"></span><span id="lgraph_api::Date::neq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1aec998ec2d30eb9705f995cf55907dae4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateneERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="lgraph_api::Date::DaysSinceEpochC"></span><span class="target" id="classlgraph__api_1_1Date_1aba5994b68821ee6127c84c8134823f8a"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DaysSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api4Date10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api4Date10GetStorageEv"></span><span id="lgraph_api::Date::GetStorageC"></span><span class="target" id="classlgraph__api_1_1Date_1ad8100ffff03d1b59ec5eae1e166b7979"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date10GetStorageEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv7int32_tEv">
+<span id="_CPPv3NK10lgraph_api4Datecv7int32_tEv"></span><span id="_CPPv2NK10lgraph_api4Datecv7int32_tEv"></span><span id="lgraph_api::Date::castto-int32_t-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1acdefe8b0c57d12e7de99a1f168a4f60e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv7int32_tEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date9TimePointEv">
+<span id="_CPPv3NK10lgraph_api4Date9TimePointEv"></span><span id="_CPPv2NK10lgraph_api4Date9TimePointEv"></span><span id="lgraph_api::Date::TimePointC"></span><span class="target" id="classlgraph__api_1_1Date_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date9TimePointEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the timepoint corresponding to this date at 00:00 am. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date8ToStringEv">
+<span id="_CPPv3NK10lgraph_api4Date8ToStringEv"></span><span id="_CPPv2NK10lgraph_api4Date8ToStringEv"></span><span id="lgraph_api::Date::ToStringC"></span><span class="target" id="classlgraph__api_1_1Date_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the string representation of the date in the format of YYYY-MM-DD. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv8DateTimeEv">
+<span id="_CPPv3NK10lgraph_api4Datecv8DateTimeEv"></span><span id="_CPPv2NK10lgraph_api4Datecv8DateTimeEv"></span><span id="lgraph_api::Date::castto-DateTime-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1af6857cebc4d28eb784e6bdbac1fe0ba9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv8DateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object corresponding to 00:00 am on this date. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="lgraph_api::Date::Parse__ssCR.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1aad607a219665901350781e377d7b82ee"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="lgraph_api::Date::Parse__cCP.cCP.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1a7c3a61e8da1dbf48e1b7f2b65550d815"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The result.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 10), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date3NowEv">
+<span id="_CPPv3N10lgraph_api4Date3NowEv"></span><span id="_CPPv2N10lgraph_api4Date3NowEv"></span><span id="lgraph_api::Date::Now"></span><span class="target" id="classlgraph__api_1_1Date_1a3e7d4298fa0246f18cb55d621635b2bc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date3NowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date8LocalNowEv">
+<span id="_CPPv3N10lgraph_api4Date8LocalNowEv"></span><span id="_CPPv2N10lgraph_api4Date8LocalNowEv"></span><span id="lgraph_api::Date::LocalNow"></span><span class="target" id="classlgraph__api_1_1Date_1aac31515c859f4e327724992a762ca42f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date8LocalNowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date17days_since_epoch_E">
+<span id="_CPPv3N10lgraph_api4Date17days_since_epoch_E"></span><span id="_CPPv2N10lgraph_api4Date17days_since_epoch_E"></span><span id="lgraph_api::Date::days_since_epoch___int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1ac7f1cae7e807741a698b319ead8869cc"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">days_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date17days_since_epoch_E" title="Permalink to this definition"></a><br></dt>
+<dd><p>The days since epoch. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDayE"></span><span id="lgraph_api::Date::YearMonthDay"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YearMonthDay</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Structure representing a date in the format of year, month and day. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay4yearE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="lgraph_api::Date::YearMonthDay::year__i"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay4yearE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The year, 0-9999. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay5monthE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="lgraph_api::Date::YearMonthDay::month__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay5monthE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Month, 1-12. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay3dayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="lgraph_api::Date::YearMonthDay::day__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay3dayE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Day, 1-31. </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api8DateTimeE"></span><span id="lgraph_api::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimeE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> class that holds <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the range of 0000-01-01 00:00:00.000000 to 9999-12-31 23:59:59.999999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeEv">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeEv"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeEv"></span><span id="lgraph_api::DateTime::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime_1a3e93cd7baeb8b4448482a450df21ab20"></span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the epoch time, i.e., 1970-1-1 00:00:00. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::DateTime::DateTime__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1acf8d529b725b6346cad668a4b7d6f5cf"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified timepoint. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>tp</strong> – Timepoint to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="lgraph_api::DateTime::DateTime__YMDHMSFCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a58680ad139b71f8686734b52e6a4d545"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymdhmsf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in <a class="reference internal" href="#structlgraph__api_1_1DateTime_1_1YMDHMSF"><span class="std std-ref">YMDHMSF</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>ymdhmsf</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and time to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="lgraph_api::DateTime::DateTime__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae5e26b24f48dd42cffd98d526bd74aab"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">microseconds_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to specified number of microseconds since epoch. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>microseconds_since_epoch</strong> – Number of microseconds since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="lgraph_api::DateTime::DateTime__ssCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae891fafda07463e06dbee5b88203da54"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in the form of YYYY-MM-DD HH:MM:SS[.FFFFFF]. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if str has invalid format.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>str</strong> – String representation of the date and time in the form of YYYY-MM-DD HH:MM:SS. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="lgraph_api::DateTime::GetYMDHMSFC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5027ca2fdaa6be6b27f7d4acb2bfabf7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYMDHMSF</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the form of year, month, day, hour, minute, second, fraction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The ymdhmsf. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeplE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimeplE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimeplE7int64_t"></span><span id="lgraph_api::DateTime::add-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5da5a7459ddc40a149081b898ea98951"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeplE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a number of microseconds to the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of micorseconds to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimepLE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimepLE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimepLE7int64_t"></span><span id="lgraph_api::DateTime::add-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5bdd35f5b63bc64bb6af19e96fa9e803"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimepLE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a number of microseconds to the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimemiE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimemiE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimemiE7int64_t"></span><span id="lgraph_api::DateTime::sub-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1afcd73eec42253057720a4a0d140e5eee"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimemiE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimemIE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimemIE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimemIE7int64_t"></span><span id="lgraph_api::DateTime::sub-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5a80be41155d8105875e8a3eb51c2c7b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimemIE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeltERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="lgraph_api::DateTime::lt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a16dffc2ee84f6e10fd3271e9b0cb5306"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeltERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeleERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="lgraph_api::DateTime::lte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a40adc1eacbf9ed88ac1cc35dc3d51f30"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeleERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegtERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="lgraph_api::DateTime::gt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae96fabdd15f3dfd300e7d399b12305bc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegtERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegeERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="lgraph_api::DateTime::gte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1adc2ea02a36b0f48b50f6e863facd20e6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegeERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="lgraph_api::DateTime::eq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a30d73527665a6b136070874aeb9b4c2e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeneERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="lgraph_api::DateTime::neq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac9b0839d6be50242b118d69b0ead3e24"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeneERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="lgraph_api::DateTime::MicroSecondsSinceEpochC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7576b1eff7b32d33fef2cfc541c0d7ae"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MicroSecondsSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetStorageEv"></span><span id="lgraph_api::DateTime::GetStorageC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a92a5a81985fd01aa29a8923985ee350a"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetStorageEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv7int64_tEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="lgraph_api::DateTime::castto-int64_t-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a9223b52f5d6412f67b24aaa89c360d7c"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv7int64_tEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime9TimePointEv">
+<span id="_CPPv3NK10lgraph_api8DateTime9TimePointEv"></span><span id="_CPPv2NK10lgraph_api8DateTime9TimePointEv"></span><span id="lgraph_api::DateTime::TimePointC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime9TimePointEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the timepoint correponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime8ToStringEv">
+<span id="_CPPv3NK10lgraph_api8DateTime8ToStringEv"></span><span id="_CPPv2NK10lgraph_api8DateTime8ToStringEv"></span><span id="lgraph_api::DateTime::ToStringC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of the date and time in the form of YYYY-MM-DD HH:MM:SS.[ffffff]. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv4DateEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv4DateEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv4DateEv"></span><span id="lgraph_api::DateTime::castto-Date-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a8049aeab68ea779547e65cd4b2058bd1"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv4DateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv">
+<span id="_CPPv3N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="_CPPv2N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="lgraph_api::DateTime::ConvertToUTC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a56e9bf4e6d3c6e9610e1f572f112d13c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToUTC</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the UTC time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a local time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Object converted to an UTC.</p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv">
+<span id="_CPPv3N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="_CPPv2N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="lgraph_api::DateTime::ConvertToLocal"></span><span class="target" id="classlgraph__api_1_1DateTime_1ad05a5ca52a97c6a3c4e4c62bbcdd0ff9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToLocal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the local time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Object converted to a local.</p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="lgraph_api::DateTime::Parse__ssCR.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a53252357cbc4cfe0040f4b0c31a6ca93"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="lgraph_api::DateTime::Parse__cCP.cCP.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7f3b51df42213d000e5cf8499fc9583f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[inout]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 19 or 26), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime3NowEv">
+<span id="_CPPv3N10lgraph_api8DateTime3NowEv"></span><span id="_CPPv2N10lgraph_api8DateTime3NowEv"></span><span id="lgraph_api::DateTime::Now"></span><span class="target" id="classlgraph__api_1_1DateTime_1afdf6bfab9c1625bea9fe0d88052eb9be"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime3NowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8LocalNowEv">
+<span id="_CPPv3N10lgraph_api8DateTime8LocalNowEv"></span><span id="_CPPv2N10lgraph_api8DateTime8LocalNowEv"></span><span id="lgraph_api::DateTime::LocalNow"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac419c09087e3dfbeb9b13a52cf5ca63b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8LocalNowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E">
+<span id="_CPPv3N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="_CPPv2N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="lgraph_api::DateTime::microseconds_since_epoch___int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a35d4677c58d7dc9be8f6566632ef33ea"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">microseconds_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSFE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSFE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSFE"></span><span id="lgraph_api::DateTime::YMDHMSF"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YMDHMSF</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Representation of a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in year, month, day, hour, minute, second, fraction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="lgraph_api::DateTime::YMDHMSF::year__i"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The year, 0-9999. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="lgraph_api::DateTime::YMDHMSF::month__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The month, 1-12. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="lgraph_api::DateTime::YMDHMSF::day__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The day, 1-31. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="lgraph_api::DateTime::YMDHMSF::hour__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a7f39b6fc12f0b04a38625ff3040dd30c"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">hour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The hour, 0-23. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="lgraph_api::DateTime::YMDHMSF::minute__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a408e3d60d59afc5b5a6f35ac9f5c8fbb"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">minute</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The minute, 0-59. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="lgraph_api::DateTime::YMDHMSF::second__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1af7633c5cbb76481bafd5e3e1ec07ca37"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">second</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The second, 0-59. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="lgraph_api::DateTime::YMDHMSF::fraction__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a4a3d5aea78d5e1e01c7be45e6990456f"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fraction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The fraction 000000-999999. </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZoneE">
+<span id="_CPPv3N10lgraph_api8TimeZoneE"></span><span id="_CPPv2N10lgraph_api8TimeZoneE"></span><span id="lgraph_api::TimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZoneE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>A class that represents a time zone. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone8TimeZoneEi">
+<span id="_CPPv3N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="_CPPv2N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="lgraph_api::TimeZone::TimeZone__i"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a4cbdd9521cf61ed9457984aeff9c4e13"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">time_diff_hours</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone8TimeZoneEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Create a timezone which has time difference with UTC in hours time_diff_hours. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidParameter</span></span></span> – Thrown if time_diff_hours is invalid.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>time_diff_hours</strong> – (Optional) Difference between local timezone and UTC. Must be &gt; =-10 &amp;&amp; &lt;=14. Otherwise the function will throw. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::FromUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae70105315a4e43ef16dcc94d07a69769"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FromUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from UTC time to this time zone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC time.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::ToUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1aa0d29ab9305bb5efa5bd1cdc48647086"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from this timezone to UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="lgraph_api::TimeZone::UTCDiffSecondsC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a9aaed281da56442099de67e51fe47638"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffSeconds</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns diff from UTC in seconds, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of seconds local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="lgraph_api::TimeZone::UTCDiffHoursC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a56914c89b37c60dcfc9db708d3a89446"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffHours</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns diff from UTC in hours, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of hours local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::LocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A const reference to local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::UpdateLocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae9cf01b0a4d1e6cfc21306569d8260f0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpdateLocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Update local timezone, used only when daylight saving time changes. Daylight saving time may change after LocalTZ was initialized, in which case we need to update it. This function will update all references returned by <a class="reference internal" href="#classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"><span class="std std-ref">LocalTimeZone()</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E">
+<span id="_CPPv3N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="_CPPv2N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="lgraph_api::TimeZone::time_diff_microseconds___int64_t"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a32810c21702584e4d3090242818cbb06"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">time_diff_microseconds_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="lgraph_api::TimeZone::GetLocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a27c488e750c5dc4247d99d4db241b0bf"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone7LocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone7LocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone7LocalTZEv"></span><span id="lgraph_api::TimeZone::LocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a8aa7218fc3680021035c689a23159760"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone7LocalTZEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-db">
+<h2>lgraph_db<a class="headerlink" href="#lgraph-db" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46lgraph">
+<span id="_CPPv36lgraph"></span><span id="_CPPv26lgraph"></span><span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><a class="headerlink" href="#_CPPv46lgraph" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskEv"></span><span id="lgraph_api::ShouldKillThisTask"></span><span class="target" id="namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Determine if we should kill current task. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if a KillTask command was issued for this task, either due to user request or timeout. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16GetThreadContextEv">
+<span id="_CPPv3N10lgraph_api16GetThreadContextEv"></span><span id="_CPPv2N10lgraph_api16GetThreadContextEv"></span><span id="lgraph_api::GetThreadContext"></span><span class="target" id="namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"></span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetThreadContext</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api16GetThreadContextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets thread context pointer, which can then be used in ShouldKillThisTask(ctx). Calling <a class="reference internal" href="#namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"><span class="std std-ref">ShouldKillThisTask()</span></a> is equivalent to ShouldKillThisTask(GetThreadContext()). In order to save the cost of <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>, you can store the context and use it in ShouldKillThisTask(ctx). </p>
+<p>Example: ```c++ ThreadContextPtr ctx = <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>; while (HasMoreWorkToDo()) { if (ShouldKillThisTask(ctx)) { break; } DoWork(); } ```</p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The thread context. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="lgraph_api::ShouldKillThisTask__ThreadContextPtr"></span><span class="target" id="namespacelgraph__api_1a842a962cb406dd251be8aeb492510b6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ctx</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr" title="Permalink to this definition"></a><br></dt>
+<dd><p>Determine if we should kill the task currently running in the thread identified by ctx. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>ctx</strong> – The context, as obtained with GetThreadContext.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if a KillTask command was issued for this task. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1a340bf8a3bf351920b9c20fe861372bcf"></span><span class="sig-name descname"><span class="pre">const</span> <span class="pre">typedef</span> <span class="pre">void</span> <span class="pre">*</span> <span class="pre">ThreadContextPtr</span></span></dt>
+<dd><p>Defines an alias representing the thread context pointer. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBE">
+<span id="_CPPv3N10lgraph_api7GraphDBE"></span><span id="_CPPv2N10lgraph_api7GraphDBE"></span><span id="lgraph_api::GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_db.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> represents a graph instance. In TuGraph, each graph instance has its own schema and access control settings. Accessing a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> without appropriate access rights yields WriteNotAllowed. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> becomes invalid if <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a> is called, in which case all transactions and iterators associated with that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> become invalid. Further operation on that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> yields InvalidGraphDB. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="lgraph_api::GraphDB::GraphDB__lgraph::AccessControlledDBP.b.b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8ed8306aab2d4ea17475888d25737f69"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db_with_access_control</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">owns_db</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb" title="Permalink to this definition"></a><br></dt>
+<dd><p>For internal use only. Users should use <a class="reference internal" href="#classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"><span class="std std-ref">Galaxy::OpenGraph()</span></a> to get <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5884af0fb5900e58a13e6cf2c64e9061"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a43a244ebb2089430b84e50667e89d015"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBD0Ev">
+<span id="_CPPv3N10lgraph_api7GraphDBD0Ev"></span><span id="_CPPv2N10lgraph_api7GraphDBD0Ev"></span><span id="lgraph_api::GraphDB::~GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad0d3a9bb78624594d45104c0ec3566d2"></span><span class="sig-name descname"><span class="n"><span class="pre">~GraphDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5CloseEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5CloseEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5CloseEv"></span><span id="lgraph_api::GraphDB::Close"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Close the graph. This will close the graph and release all transactions, iterators associated with the graph. After calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a>, the graph becomes invalid, and cannot be used anymore. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="lgraph_api::GraphDB::CreateReadTxn"></span><span class="target" id="classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateReadTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Creates a read transaction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The new read transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb">
+<span id="_CPPv3N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="_CPPv2N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="lgraph_api::GraphDB::CreateWriteTxn__b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateWriteTxn</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">optimistic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Creates a write transaction. Write operations can only be performed in write transactions, otherwise exceptions will be thrown. A write transaction can be optimistic. Optimistic transactions can run in parallel and any conflict will be detected during commit. If a transaction conflicts with an ealier one, a TxnConflict will be thrown during commit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>optimistic</strong> – (Optional) True to create an optimistic transaction.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The new write transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction">
+<span id="_CPPv3N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="_CPPv2N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="lgraph_api::GraphDB::ForkTxn__TransactionR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForkTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd><p>Forks a read transaction. The resulting read transaction will share the same view as the forked one, meaning that when reads are performed on the same vertex/edge, the results will always be identical, whether they are performed in the original transaction or the forked one. Only read transactions can be forked. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"><span class="std std-ref">ForkTxn()</span></a> on a write txn causes an InvalidFork to be thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidFork</span></span></span> – Thrown when txn is a write transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>txn</strong> – <strong>[in]</strong> The read transaction to be forked.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A new read <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> that shares the same view with txn. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5FlushEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5FlushEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5FlushEv"></span><span id="lgraph_api::GraphDB::Flush"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Flush</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5FlushEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Flushes buffered data to disk. If there have been some async transactions, there could be data that are written to this graph, but not persisted to disk yet. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"><span class="std std-ref">Flush()</span></a> will persist the data and prevent data loss in case of system crash. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB11DropAllDataEv">
+<span id="_CPPv3N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="_CPPv2N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="lgraph_api::GraphDB::DropAllData"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a784e2f7141aaed6b547faaaf52e87880"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB11DropAllDataEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Drop all the data in the graph, including labels, indexes and vertexes/edges.. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="lgraph_api::GraphDB::DropAllVertex"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad51e4783ef7de143949c05311a0f2b54"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Drop all vertex and edges but keep the labels and indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="lgraph_api::GraphDB::EstimateNumVertices"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8434ac9ad087a3f57b96f6c8bed664d6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EstimateNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Estimate number of vertices. We don’t maintain the exact number of vertices, but only the next vid. This function actually returns the next vid to be used. So if you have deleted a lot of vertices, the result can be quite different from actual number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Estimated number of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="lgraph_api::GraphDB::AddVertexLabel__ssCR.std::vector:FieldSpec:CR.VertexOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0c0f79500ca028b8342cc6af9b363c83"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="lgraph_api::VertexOptions"><span class="n"><span class="pre">VertexOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the schema is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>primary_field</strong> – The primary field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteVertexLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6d74b689bd295b71c8857f26b77cb4a2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes a vertex label and all the vertices with this label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a15a25572790ab89a16815409cbc5a869"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes fields in a vertex label. This function also updates the vertex data and indices accordingly to make sure the database remains in consistent state. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or some fields cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – Labels of the fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1abdca8d18155cbb711386a18d8f206c66"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fields to a vertex label. The new fields in existing vertices will be filled with default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field already exists.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The add fields. </p></li>
+<li><p><strong>default_values</strong> – The default values of the newly added fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3becea45eab0d50d4c09232b211944d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify fields in a vertex label, either chage the data type or optional, or both. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The new specification of the modified fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="lgraph_api::GraphDB::AddEdgeLabel__ssCR.std::vector:FieldSpec:CR.EdgeOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3c5434fc9c650a6f09465c32db1b16d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a edge label, specifying its schema. It is allowed to specify edge constrains, too. An edge can be bound to several (source_label, destination_label) pairs, which makes sure this type of edges will only be added between these types of vertices. By default, the constain is empty, meaning that the edge is not restricted. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if invalid schema (invalid specification, re- definition of the same field, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>temporal_field</strong> – The temporal field for tid. </p></li>
+<li><p><strong>edge_constraints</strong> – (Optional) The edge constraints. An empty constrain means no restriction.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteEdgeLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0bf6aee53c6c7412806a6a1dcdcd6377"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes an edge label and all the edges of this type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="lgraph_api::GraphDB::AlterLabelModEdgeConstraints__ssCR.std::vector:std::pair:ss.ss::CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7ab2ca321e3bd68c1a9f33aeaa3bd747"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterLabelModEdgeConstraints</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify edge constraint. Existing edges that violate the new constrain will be removed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any vertex label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>constraints</strong> – The new edge constraint.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a08241fee881005b37982621a31fb5e00"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes fields in an edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – The fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of edges modified.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab43144d999e3f539a42c5aa6a4ec21c0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fields to an edge label. The new fields in existing edges will be set to default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field already exists, or the default value is of incompatible type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The fields to add. </p></li>
+<li><p><strong>default_values</strong> – The default values. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aae83cf6042c04347d6cc6147289bced0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify fields in an edge label. Data type and OPTIONAL can be modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The modifier fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddVertexIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4e0da14c082f2be3f4d29ef888daad64"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field</strong> – The field name. </p></li>
+<li><p><strong>is_unique</strong> – True if is unique index, false if not.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddEdgeIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aa33f376759b00da1070c16167f8650bf"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>is_unique</strong> – True if the field content is unique for each vertex.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check if this vertex_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check if this edge_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5dd0b2831686ab10c9cf641b1f5a04c8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the index to ‘vertex_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0b04c7d95efa608199ffd43074698a26"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the index to ‘edge_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="lgraph_api::GraphDB::GetDescriptionC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a10eafac774946c9fda6acd8368e6b254"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDescription</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get graph description. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The description. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="lgraph_api::GraphDB::GetMaxSizeC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3cd10a9d8a077a9b838fecc8d894550c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetMaxSize</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get maximum graph size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The maximum size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a1f9045086aaa5274c657b8020ed8d314"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fulltext index to ‘vertex_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad67d845d1e7c6d3a230ebca0eac15138"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fulltext index to ‘edge_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2d13791623a99511d3d743e811097b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘vertex_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab7e3ee69c450474f77d621b7310b1621"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘edge_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="lgraph_api::GraphDB::RebuildFullTextIndex__std::set:ss:CR.std::set:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6902d07efdba3ff5c2be81311534e752"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RebuildFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_labels</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_labels</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Rebuild the fulltext index of <code class="docutils literal notranslate"><span class="pre">vertex_labels</span></code> and <code class="docutils literal notranslate"><span class="pre">edge_labels</span></code>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_labels</strong> – The vertex labels whose fulltext index need to rebuild. </p></li>
+<li><p><strong>edge_labels</strong> – The edge labels whose fulltext index need to rebuild. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="lgraph_api::GraphDB::ListFullTextIndexes"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ae2b1b58ffc70106433bee030842e3e27"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListFullTextIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List fulltext indexes of vertex and edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Format of returned data : (is_vertex, label_name, property_name) </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryVertexByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a696a8bc40c23002921ccd4983b1e2550"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryVertexByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query vertex by fulltext index. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The vertex label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Vertex vids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryEdgeByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4f09813ea8812322180569bd2b48fe05"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryEdgeByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query edge by fulltext index. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The edge label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Edge uids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12RefreshCountEv">
+<span id="_CPPv3N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="_CPPv2N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="lgraph_api::GraphDB::RefreshCount"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ade8d799b8354403e99298d493a3509f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshCount</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12RefreshCountEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Recount the total number of vertex and edge, stop writing during the count. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3ea21ec359220a8c4e0ea72adb0c1ba0"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copying is disabled. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3bc8ff8539363d5511d9a6936bae7899"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB3db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB3db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB3db_E"></span><span id="lgraph_api::GraphDB::db___lgraph::AccessControlledDBP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a35f581fb0d14734506768c1a61296979"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17should_delete_db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="lgraph_api::GraphDB::should_delete_db___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac2e6f7ca5ee0fc92e2579a7de9303eac"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">should_delete_db_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17should_delete_db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB10read_only_E">
+<span id="_CPPv3N10lgraph_api7GraphDB10read_only_E"></span><span id="_CPPv2N10lgraph_api7GraphDB10read_only_E"></span><span id="lgraph_api::GraphDB::read_only___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac22ad4698a78f7e4ab74ec4450647125"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">read_only_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB10read_only_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-index-iterator">
+<h2>lgraph_edge_index_iterator<a class="headerlink" href="#lgraph-edge-index-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorE"></span><span id="lgraph_api::EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> can be used to access a set of edges that has the same indexed value. If the index is unique (that is, each Edge has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> will only have one edge unique id, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> is valid iff it points to a valid (index_value, euid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ae51a6e1b90b7343b4012be9cc7ae3daa"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a584635e9e5d92688527dbae26f926f80"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="lgraph_api::EdgeIndexIterator::~EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aa1bb455fd404e4102a0e6b637283db00"></span><span class="sig-name descname"><span class="n"><span class="pre">~EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="lgraph_api::EdgeIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="lgraph_api::EdgeIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="lgraph_api::EdgeIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next edge unique id in the list, which consists of all the valid edge unique ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::EdgeIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the current index value. The euids are sorted in ( EdgeIndexValue, euid) order. When <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one euid to next, possibly moving from one EdgeIndexValue to another. This function tells the EdgeIndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="lgraph_api::EdgeIndexIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the Edge Unique Id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="lgraph_api::EdgeIndexIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="lgraph_api::EdgeIndexIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__lgraph::EdgeIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a2266e13c0886456df166e683e4a04cc5"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1acd1c7e3f9d88fcc2a2fa0dbdbb5b2bf8"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1abda22c9f1d7924e06efe4e12a1986292"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="lgraph_api::EdgeIndexIterator::it___std::unique_ptr:lgraph::EdgeIndexIterator:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a8c447e8d8d6d5ae41372b160dec982b1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="lgraph_api::EdgeIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-iterator">
+<h2>lgraph_edge_iterator<a class="headerlink" href="#lgraph-edge-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph5graphE">
+<span id="_CPPv3N6lgraph5graphE"></span><span id="_CPPv2N6lgraph5graphE"></span><span id="lgraph::graph"></span><span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph5graphE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aa64cc73da05613af93f74fbba0e40685"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a92a989ca7aa12f6bf9312acca6a24b9d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aae356ade132bced19db97d69e2693926"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1ad917857534c392eb3de3718007839e87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1acae8199afd0a5a7026d057a2ede19e29"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a623f694634f9b740f6e8432ad5e8fed7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a145cb4680fe351655b20bcefbf1d10c6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a46e696695da45853cbeb5905719210fa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> can be used to iterate through the in-coming edges of a vertex. Edges are sorted in (lid, tid, src, eid) order, and each (dst, lid, tid, src, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> is valid iff it points to a valid in-coming edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a73ca326056d2877cea6b09a683b8c0ba"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a20741057cf223945a84f2ebe4cb73b2f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="lgraph_api::InEdgeIterator::~InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a299e60d91351d2ceb0da9445d3d53ab9"></span><span class="sig-name descname"><span class="n"><span class="pre">~InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="lgraph_api::InEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4NextEv"></span><span id="lgraph_api::InEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next incoming edge to current destination vertex. If there is no more edge, the iterator becomes invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::InEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Go to the edge specified by euid. If the specified edge cannot be found and nearest==true, then try to get the next in-coming edge to the vertex euid.dst, sorted by (label, tid, src, eid). If there is no such edge, iterator is invalidated and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="lgraph_api::InEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the Edge Unique Id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="lgraph_api::InEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="lgraph_api::InEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets destination vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::InEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::InEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets temporal id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The temporal id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="lgraph_api::InEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::InEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::InEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>All field names and values stored as a {(field_name, field_value),…} map. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="lgraph_api::InEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next incoming edge sorted by (lid, tid, src, eid) if there is any. If no in-coming edge is left for this vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="lgraph_api::InEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__lgraph::graph::InEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a92769487b9004274f36dccbc5b26dc1d"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aaf872d62e0bcd4680527d2c086433151"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5110071efc6781255ae9ce68e3634205"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator3it_E"></span><span id="lgraph_api::InEdgeIterator::it___std::unique_ptr:lgraph::graph::InEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a17c31f91df04ddbd378b1d23c6c18568"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4txn_E"></span><span id="lgraph_api::InEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> can be used to iterate through the out-going edges of a vertex. Edges are sorted in (lid, dst, eid) order, and each (src, lid, tid, dst, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> is valid iff it points to a valid out-going edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1abab68117b55783f6c38a899396f169a3"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a088017d735536fa934b5fb2cba592e43"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="lgraph_api::OutEdgeIterator::~OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa0e08e47018ad64858af8310913383b1"></span><span class="sig-name descname"><span class="n"><span class="pre">~OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="lgraph_api::OutEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::OutEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Go to the edge specified by euid. That is, an edge from Vertex euid.src to euid.dst, with LabelId==euid.label, Tid==euid.tid, and EdgeId==euid.eid. If neareast==true and the exact edge was not found, the iterator tries to get the next edge that sorts after the specified edge. The edges are sorted in (label, tid, dst, eid) order. The iterator becomes invalid if there is no outgoing edge from euid.src that sorts after euid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique ID. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if there is no such edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="lgraph_api::OutEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="lgraph_api::OutEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next edge. Invalidates iterator if there is no more out edges from current source vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails (no more out edge from current source). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="lgraph_api::OutEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the Edge Unique Id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="lgraph_api::OutEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets primary id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The primary id of the edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="lgraph_api::OutEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::OutEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – The name of the field to get.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field id. FieldId can be obtained with txn.GetEdgeFieldId() </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>fid</strong> – fid The field id.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::OutEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>All fields in a dictionary of {(field_name, field_value),…}. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value in string representation. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="lgraph_api::OutEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next out-going edge sorted by (label, tid, dst, eid) if there is any. If there is no more out-going edges for this source vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="lgraph_api::OutEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A std::string that represents this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__lgraph::graph::OutEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aec68967791b2a1c92ff94c646853c14a"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ab98d1e207b5ecce1a7dcea1478577558"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a65896ed24e13cd2af266a344a655419c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator3it_E"></span><span id="lgraph_api::OutEdgeIterator::it___std::unique_ptr:lgraph::graph::OutEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa9051f34e34c3c714096054e271c72a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="lgraph_api::OutEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-exceptions">
+<h2>lgraph_exceptions<a class="headerlink" href="#lgraph-exceptions" title="Permalink to this headline"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.ERROR_CODES">
+<span class="target" id="lgraph__exceptions_8h_1a202796cec2c73e6a15b8ae40423102d2"></span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#c.ERROR_CODES" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.X">
+<span class="target" id="lgraph__exceptions_8h_1a1f09736ce2d0b353925675b9c17f9b58"></span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="n"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.X" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THROW_CODE">
+<span class="target" id="lgraph__exceptions_8h_1a0a6acbf1c6c9172f6be1c808cfa03f10"></span><span class="sig-name descname"><span class="n"><span class="pre">THROW_CODE</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="p"><span class="pre">...</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.THROW_CODE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCodeE">
+<span id="_CPPv3N10lgraph_api9ErrorCodeE"></span><span id="_CPPv2N10lgraph_api9ErrorCodeE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05f"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCode</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode1XE">
+<span id="_CPPv3N10lgraph_api9ErrorCode1XE"></span><span id="_CPPv2N10lgraph_api9ErrorCode1XE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa13397c15c68eb3e5e33a0196e8988a24"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode1XE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE">
+<span id="_CPPv3N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span id="_CPPv2N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa0afdd4a4fb13896180b64bd313a17dc2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode">
+<span id="_CPPv3N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="_CPPv2N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="lgraph_api::ErrorCodeToString__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a13525881a01e59b5a69b74c47d95dcd3"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeToString</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode">
+<span id="_CPPv3N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="_CPPv2N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="lgraph_api::ErrorCodeDesc__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a82ab07d2676a279295157e65beeedcbc"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeDesc</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphExceptionE">
+<span id="_CPPv3N10lgraph_api15LgraphExceptionE"></span><span id="_CPPv2N10lgraph_api15LgraphExceptionE"></span><span id="lgraph_api::LgraphException"></span><span class="target" id="classlgraph__api_1_1LgraphException"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><span class="n"><span class="pre">exception</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphExceptionE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_exceptions.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aa1104fdb0328ecad056440c0498affa5"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.ssCR"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af986a8520040b3af5568e7f4f2b3d813"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.cCP"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af81b58e697be8127dd1310a7297a886b"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts">
+<span id="_CPPv3IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span id="_CPPv2IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="p"><span class="pre">...</span></span><span class="sig-name descname"><span class="n"><span class="pre">Ts</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1LgraphException_1a8cc576c0c99e4c712a0fc91ca67868fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">format</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="lgraph_api::LgraphException::LgraphException::Ts"><span class="n"><span class="pre">Ts</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">...</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4codeEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4codeEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4codeEv"></span><span id="lgraph_api::LgraphException::codeC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a833a074d2f56630e12d5c66e6ebb5862"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4codeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException3msgEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException3msgEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException3msgEv"></span><span id="lgraph_api::LgraphException::msgC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1e6c05d855e126b4ecfaa8241f8cca33"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">msg</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException3msgEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4whatEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4whatEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4whatEv"></span><span id="lgraph_api::LgraphException::whatC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aac1c33909e01e1dfc85617cf2477d3eb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">what</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><span class="w"> </span><span class="k"><span class="pre">override</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4whatEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5code_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5code_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5code_E"></span><span id="lgraph_api::LgraphException::code___ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1ac8cce82dda9537fdb72dac589a6ac5f2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5code_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException4msg_E">
+<span id="_CPPv3N10lgraph_api15LgraphException4msg_E"></span><span id="_CPPv2N10lgraph_api15LgraphException4msg_E"></span><span id="lgraph_api::LgraphException::msg___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1da24fcb3b81cddc8a32815f13997437"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">msg_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException4msg_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5what_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5what_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5what_E"></span><span id="lgraph_api::LgraphException::what___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a415baaef606c6f5e5e1104719a84dc72"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">what_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5what_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-galaxy">
+<h2>lgraph_galaxy<a class="headerlink" href="#lgraph-galaxy" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyE">
+<span id="_CPPv3N10lgraph_api6GalaxyE"></span><span id="_CPPv2N10lgraph_api6GalaxyE"></span><span id="lgraph_api::Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_galaxy.h&gt;</em></div>
+<p>A galaxy is the storage engine for one TuGraph instance. It manages a set of User/Role/GraphDBs. </p>
+<p>A galaxy can be opened in async mode, in which case <em>ALL</em> write transactions will be treated as async, whether they declare async or not. This can come in handy if we are performing a lot of writing, but can cause data loss for online processing. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aff4d727c87112ab1ae56882ed7c90ae8"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The TuGraph dir. </p></li>
+<li><p><strong>durable</strong> – (Optional) True to open in durable mode. If set to false, ALL write transactions are async, whether they declare async or not. </p></li>
+<li><p><strong>create_if_not_exist</strong> – (Optional) If true, the TuGraph DB will be created if dir does not exist; otherwise, an exception is thrown. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.ssCR.ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac04eaf83ff6ed47d4e77bbcb06b432f5"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. Open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> and try to login with specified user and password. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is not correct.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The dir. </p></li>
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>durable</strong> – True to open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> in durable mode. </p></li>
+<li><p><strong>create_if_not_exist</strong> – True to create if DB does not exist. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a57bcd86daa9d4cdbfb367a0e43d8b039"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aead55554e77f85378cd82ece56cfde96"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyD0Ev">
+<span id="_CPPv3N10lgraph_api6GalaxyD0Ev"></span><span id="_CPPv2N10lgraph_api6GalaxyD0Ev"></span><span id="lgraph_api::Galaxy::~Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a00577f1737a890a15dbd7b409a2f1cd8"></span><span class="sig-name descname"><span class="n"><span class="pre">~Galaxy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetCurrentUser__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac428a8a912bf43cf72c9a908ef6c7c15"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetCurrentUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Validate and set current user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a568523d4c1b5a1cde2fafa5fd2d702f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set current user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if token is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The current user. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="lgraph_api::Galaxy::CreateGraph__ssCR.ssCR.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a480909a8d20e7b8a904030fc5be34da0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">description</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">max_size</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="m"><span class="pre">1</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">40</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Validate token and set current user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to create graph. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Other input errors such as invalid graph name, size, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph to create. description (Optional) Description of the graph. max_size (Optional) Maximum size of the graph.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if graph already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteGraph__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1f0d94b15f7b718f6aa4f1dc01656f0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Delete a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to delete graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the graph does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="lgraph_api::Galaxy::ModGraph__ssCR.b.ssCR.b.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4d8cdf497e81b2b9d1fc95f980319a0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ModGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_size</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">new_max_size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify graph info. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to modify graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph_name</strong> – Name of the graph. </p></li>
+<li><p><strong>mod_desc</strong> – True to modifier description. </p></li>
+<li><p><strong>desc</strong> – The new description. </p></li>
+<li><p><strong>mod_size</strong> – True to modifier size. </p></li>
+<li><p><strong>new_max_size</strong> – New maximum size.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="lgraph_api::Galaxy::ListGraphsC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a4c64be90601e4a55971798b4272ebf"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListGraphs</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List graphs. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to list graphs.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A dictionary of {graph_name: (description, max_size)} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateUser__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a97e43d10d6b95de4d68ca3c7919bcacb"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Creates a user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if other input errors, such as illegal user name, password, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>desc</strong> – (Optional) The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab111a438ea5f846881da6c03d3e34115"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetPassword__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a29f197aed82ca28992c87b797b5e4186"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetPassword</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">old_password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">new_password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the password of the specified user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission, or curr_user==user, but old_password is incorrect. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if new_password is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user to modify. </p></li>
+<li><p><strong>old_password</strong> – The old password, required if curr_user==user. </p></li>
+<li><p><strong>new_password</strong> – The new password.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUserDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aca1ba2352c5365a0e82f522d79b51219"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets user description. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>desc</strong> – The new description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Galaxy::SetUserRoles__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a0c5796bfe855125cf1b3675c4a3b87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserRoles</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">roles</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the roles of the specified user. If you need to add or delete a role, you will need to use GetUserInfo to get the roles first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any role does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>roles</strong> – A list of roles.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="lgraph_api::Galaxy::SetUserGraphAccess__ssCR.ssCR.AccessLevelCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3f0fcfae10bf1776e39ecc3205fc6c85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserGraphAccess</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets user access rights on a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>access</strong> – The access level.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a0edfd7185553ceb6c81f303acdbf163c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Disable a user. A disabled user is not able to login or perform any operation. A user cannot disable itself. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user to disable.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1af07907500b4d6142b9416e74df4557a4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Enables the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListUsersEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="lgraph_api::Galaxy::ListUsersC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a55e8c41afb9c217b63872b76b1486691"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListUsers</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListUsersEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List all users. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A dictionary of {user_name:user_info} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetUserInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab5010716ab86c5f6650672ce885c4bd9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUserInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets user information. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The user information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateRole__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a550aaacf7d2580baf77c3eb7706cafd7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Create a role. A role has different access levels to different graphs. Every user must be assigned some role to get access to graphs. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1add07dbe39e13e5c47e82c4b621963d7f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the role described by role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6007103b069eebe456d17e6035c763ce"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Disable a role. A disabled role still has the data, but is not effective. i.e., users will not have access rights to graphs that are obtained by having this role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a88b1cf70763b8f517a8a67fd70f45ba6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Enables the role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetRoleDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a09988e113e9709e0ae2d8a9ae55bfd97"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the description of the specified role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRights__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7da90a98fb519cf1557c82f9780bf2aa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRights</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set access of the role to graphs. If you need to add or remove access to part of the graphs, you need to get full graph_access map by using GetRoleInfo first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRightsIncremental__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3ad7fb60a0413742007dceff71f34f9b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRightsIncremental</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Incrementally modify the access right of the specified role. For example, for a role that has access right {graph1:READ, graph2:WRITE}, calling this function with graph_access={graph2:READ, graph3:FULL} will set the access right of this role to {graph1:READ, graph2:READ, graph3:FULL}. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetRoleInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3d2426344ffa4ccd2c3d99af236bbc83"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetRoleInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets role information. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The role information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListRolesEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="lgraph_api::Galaxy::ListRolesC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ae420054434acdb37d8d242926c2eece7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListRoles</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListRolesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List all the roles. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A dictionary of {role_name:<a class="reference internal" href="#structlgraph__api_1_1RoleInfo"><span class="std std-ref">RoleInfo</span></a>} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetAccessLevel__ssCR.ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a9b5d700cf67ddcd6dc08a73271034c66"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAccessLevel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the access level that the specified user have to the graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name or graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The access level. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb">
+<span id="_CPPv3NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="_CPPv2NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="lgraph_api::Galaxy::OpenGraph__ssCR.bC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OpenGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Opens a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>read_only</strong> – (Optional) True to open in read-only mode. A read-only <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> cannot be written to.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5CloseEv">
+<span id="_CPPv3N10lgraph_api6Galaxy5CloseEv"></span><span id="_CPPv2N10lgraph_api6Galaxy5CloseEv"></span><span id="lgraph_api::Galaxy::Close"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a>, turning it into an invalid state. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="lgraph_api::Galaxy::Galaxy__lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a18b1851884f7ba7148f9488f0669212a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aa5da67d606e1c4a26b0733a2f0082f1a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4ea0661db673b9f0f9e2d4fd01cfa2a3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5user_E">
+<span id="_CPPv3N10lgraph_api6Galaxy5user_E"></span><span id="_CPPv2N10lgraph_api6Galaxy5user_E"></span><span id="lgraph_api::Galaxy::user___ss"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a17442452651ea1479fa7d0e652f90810"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5user_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy3db_E">
+<span id="_CPPv3N10lgraph_api6Galaxy3db_E"></span><span id="_CPPv2N10lgraph_api6Galaxy3db_E"></span><span id="lgraph_api::Galaxy::db___lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1d7badecbe92fb1d1d48f412eb80beef"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-result">
+<h2>lgraph_result<a class="headerlink" href="#lgraph-result" title="Permalink to this headline"></a></h2>
+<p>Result interface for plugins and built-in procedures. The result of a plugin should be provided in this format in order for the Cypher engine and the graph visualizer to understand. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46cypher">
+<span id="_CPPv36cypher"></span><span id="_CPPv26cypher"></span><span id="cypher"></span><span class="target" id="namespacecypher"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher</span></span></span><a class="headerlink" href="#_CPPv46cypher" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordE">
+<span id="_CPPv3N10lgraph_api6RecordE"></span><span id="_CPPv2N10lgraph_api6RecordE"></span><span id="lgraph_api::Record"></span><span class="target" id="classlgraph__api_1_1Record"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p>You only initialize the class by <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> instance. <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a> provide some insert method to insert data to the record. eg. Insert, InsertVertexByID, InsertEdgeByID. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERK6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERK6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERK6Record"></span><span id="lgraph_api::Record::Record__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1ac650ba988b5c162c621cabf07c18d497"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERR6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERR6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERR6Record"></span><span id="lgraph_api::Record::Record__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1adb1c42c8dbe94932471cc2fa3b1de7a6"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERK6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERK6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERK6Record"></span><span id="lgraph_api::Record::assign-operator__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1a820a033a9bfbbf0a1a0cff6ae779c715"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERK6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERR6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERR6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERR6Record"></span><span id="lgraph_api::Record::assign-operator__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1ab8d2b9aec7327774226f29c455791dad"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERR6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Record::Insert__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Record_1a38f91b3aee5d1880237939f77fd5c2fb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>fv</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.int64_tC.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a171dbf3555be4830b723f1963518c8d2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertVertexByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId </p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.EdgeUidR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a0947956a5583ac30f6437ccba45e6dbc"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertEdgeByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>euid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t">
+<span id="_CPPv3N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="_CPPv2N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="lgraph_api::Record::InsertVertexByID__ssCR.int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a0445d0d62a48711ddef6e9988bd0fa09"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertVertexByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid">
+<span id="_CPPv3N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="_CPPv2N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="lgraph_api::Record::InsertEdgeByID__ssCR.EdgeUidCR"></span><span class="target" id="classlgraph__api_1_1Record_1abede73c241382ea0e55f76b90e3a7f42"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertEdgeByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">uid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>uid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1af585894e04343f4c80843dcdebdbef9d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>vit</strong> – <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1a1f507fb00296a8e04f98a391ec597ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ieit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>ieit</strong> – <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1aa5d88aae93b2cf484beb632d88420adf"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">oeit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>oeit</strong> – <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a59b5dffacde269b5df6612c00771b9a1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">list</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>list</strong> – LIST OF <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::map:ss.FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a7d99978348600b14abe0049be705b625"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">map</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>map</strong> – MAP OF &lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.traversal::PathCR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a527ac8a8e078306bcda8963a22813afb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversalE" title="lgraph_api::traversal"><span class="n"><span class="pre">traversal</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">path</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert value into result table. You can insert a value by the function, and value must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>path</strong> – Path of traverse api. </p></li>
+<li><p><strong>txn</strong> – Trasaction </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Record4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Record4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Record4SizeEv"></span><span id="lgraph_api::Record::SizeC"></span><span class="target" id="classlgraph__api_1_1Record_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Record4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the size of record. If record is empty, return 0, max size is not beyond the length of your defined param list. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Size of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="lgraph_api::Record::HasKey__ssCR"></span><span class="target" id="classlgraph__api_1_1Record_1a2a2d1b3e4e37484e8bce95728db6b770"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HasKey</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check a key is exist or not. The key is the one of titile your defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>key</strong> – The key.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if exsit, otherwise fasle. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Record::Record__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Record_1af5b8557af6ac3c8c4af28c7fc79a6b42"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6recordE">
+<span id="_CPPv3N10lgraph_api6Record6recordE"></span><span id="_CPPv2N10lgraph_api6Record6recordE"></span><span id="lgraph_api::Record::record__std::unordered_map:ss.std::shared_ptr:ResultElement::"></span><span class="target" id="classlgraph__api_1_1Record_1a2248d027c6bbadbd043ee858e5656d7a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6recordE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6headerE">
+<span id="_CPPv3N10lgraph_api6Record6headerE"></span><span id="_CPPv2N10lgraph_api6Record6headerE"></span><span id="lgraph_api::Record::header__std::unordered_map:ss.LGraphType:"></span><span class="target" id="classlgraph__api_1_1Record_1a38c0d41af0c74862a17017322f4171d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6headerE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record7length_E">
+<span id="_CPPv3N10lgraph_api6Record7length_E"></span><span id="_CPPv2N10lgraph_api6Record7length_E"></span><span id="lgraph_api::Record::length___int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a5f8ae7abecbad53a2b4130540267cddf"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">length_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record7length_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Result</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6ResultE">
+<span id="_CPPv3N10lgraph_api6ResultE"></span><span id="_CPPv2N10lgraph_api6ResultE"></span><span id="lgraph_api::Result"></span><span class="target" id="classlgraph__api_1_1Result"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6ResultE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> table, result instance provide [MutableRecord], [ResetHeader], [Dump] and [Load] method. Table also provide some method to view content of table. For example, [Header] and [Recordview]. </p>
+<p>It’s worth noting that you are best to define your header before using result table. eg. auto result = <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a>({title, LGraphType}…) If you do not define header and initialize by <a class="reference internal" href="#classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"><span class="std std-ref">Result()</span></a>, you will get a empty table without header, you just use the table after using [ResetHeader] method to set your header. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultEv">
+<span id="_CPPv3N10lgraph_api6Result6ResultEv"></span><span id="_CPPv2N10lgraph_api6Result6ResultEv"></span><span id="lgraph_api::Result::Result"></span><span class="target" id="classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aec54d6cf6ac1ac561febf2d4db046bd6"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1adbe90e1fe046f2cd689d8dadd67177c9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="lgraph_api::Result::GetType__ss"></span><span class="target" id="classlgraph__api_1_1Result_1a1015a1bde96a85591fc70273ad140b35"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">title</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get type of title. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>title</strong> – One of titles in table.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>LGraphType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aa5f20d3711f82acbdd1fbf2ea28d5ece"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1a45a2260d7f28e56b5c3e5a7b94789766"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result13MutableRecordEv">
+<span id="_CPPv3N10lgraph_api6Result13MutableRecordEv"></span><span id="_CPPv2N10lgraph_api6Result13MutableRecordEv"></span><span id="lgraph_api::Result::MutableRecord"></span><span class="target" id="classlgraph__api_1_1Result_1ad4bea412e4aef69da8464dd0a83b2a64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">MutableRecord</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result13MutableRecordEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Create a new record in the table and return the record. The record is the reference of record in the table, if you want to modify the record, you must assign return value to a reference variable. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The reference of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7ReserveE6size_t">
+<span id="_CPPv3N10lgraph_api6Result7ReserveE6size_t"></span><span id="_CPPv2N10lgraph_api6Result7ReserveE6size_t"></span><span id="lgraph_api::Result::Reserve__s"></span><span class="target" id="classlgraph__api_1_1Result_1a204d25ea43252cdf35dc6e859f765410"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reserve</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7ReserveE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>This function attempts to reserve enough memory for the result vector to hold the specified number of elements. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api6Result6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api6Result6ResizeE6size_t"></span><span id="lgraph_api::Result::Resize__s"></span><span class="target" id="classlgraph__api_1_1Result_1a9b2c775a0d09660185780ee0a7ea6be1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResizeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>This function will resize the vector to the specified number of elements. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result2AtE6size_t">
+<span id="_CPPv3N10lgraph_api6Result2AtE6size_t"></span><span id="_CPPv2N10lgraph_api6Result2AtE6size_t"></span><span id="lgraph_api::Result::At__s"></span><span class="target" id="classlgraph__api_1_1Result_1a030c64fc1715cdb057995bf9ff5870f6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">At</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result2AtE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Provides access to the data contained in the vector. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6HeaderEv">
+<span id="_CPPv3N10lgraph_api6Result6HeaderEv"></span><span id="_CPPv2N10lgraph_api6Result6HeaderEv"></span><span id="lgraph_api::Result::Header"></span><span class="target" id="classlgraph__api_1_1Result_1accfa1228e11954438cbaa8ad4d6be5e9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Header</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6HeaderEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>return header of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>header. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Result4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Result4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Result4SizeEv"></span><span id="lgraph_api::Result::SizeC"></span><span class="target" id="classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Result4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>return size of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>table size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4DumpEb">
+<span id="_CPPv3N10lgraph_api6Result4DumpEb"></span><span id="_CPPv2N10lgraph_api6Result4DumpEb"></span><span id="lgraph_api::Result::Dump__b"></span><span class="target" id="classlgraph__api_1_1Result_1ac839e6ed0453fe8ed7fac29e9a6803d1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Dump</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_standard</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4DumpEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Serialize the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>is_standard</strong> – (Optional) If true, the result will serialize to a standard result, the standard result can be Visualized in web. If false, result will serialize a json object &amp;#8212; SDK result.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Serialize result. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="lgraph_api::Result::Load__ssCR"></span><span class="target" id="classlgraph__api_1_1Result_1a405e30d792103a7989739a05f992c94a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Load</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">json</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deserialize data to result table. This will be clear original data and header, please use this function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>json</strong> – Json string to be deserialized. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result12ClearRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result12ClearRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result12ClearRecordsEv"></span><span id="lgraph_api::Result::ClearRecords"></span><span class="target" id="classlgraph__api_1_1Result_1af629a0e98c5fbb4adf85475b0073f48a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClearRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result12ClearRecordsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Clear all the records, <a class="reference internal" href="#classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"><span class="std std-ref">Size()</span></a> will be 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10BoltHeaderEv">
+<span id="_CPPv3N10lgraph_api6Result10BoltHeaderEv"></span><span id="_CPPv2N10lgraph_api6Result10BoltHeaderEv"></span><span id="lgraph_api::Result::BoltHeader"></span><span class="target" id="classlgraph__api_1_1Result_1a18c695165355bb5431690e26af2a2d28"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltHeader</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10BoltHeaderEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11BoltRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result11BoltRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result11BoltRecordsEv"></span><span id="lgraph_api::Result::BoltRecords"></span><span class="target" id="classlgraph__api_1_1Result_1a55a40428869f85c65c6dfa3389fe75dc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11BoltRecordsEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10RecordViewE7int64_t">
+<span id="_CPPv3N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="_CPPv2N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="lgraph_api::Result::RecordView__int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1abc994177cadf7bb0d070dd81ad8ea8b9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">RecordView</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">row_num</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10RecordViewE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get record of the table, if row number is more bigger than max length of table, throw a exception. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>row_num</strong> – row number of the table.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>One <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6resultE">
+<span id="_CPPv3N10lgraph_api6Result6resultE"></span><span id="_CPPv2N10lgraph_api6Result6resultE"></span><span id="lgraph_api::Result::result__std::vector:Record:"></span><span class="target" id="classlgraph__api_1_1Result_1a81372de9efc3519cb68a6e51335acfd4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6resultE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6headerE">
+<span id="_CPPv3N10lgraph_api6Result6headerE"></span><span id="_CPPv2N10lgraph_api6Result6headerE"></span><span id="lgraph_api::Result::header__std::vector:std::pair:ss.LGraphType::"></span><span class="target" id="classlgraph__api_1_1Result_1ac1d5325a16b7b45115c0e32c73078d4d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6headerE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10row_count_E">
+<span id="_CPPv3N10lgraph_api6Result10row_count_E"></span><span id="_CPPv2N10lgraph_api6Result10row_count_E"></span><span id="lgraph_api::Result::row_count___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0a15002d39b5391c9c693671d605e56c"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">row_count_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10row_count_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">lgraph::StateMachine</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">cypher::PluginAdapter</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-rpc-client">
+<h2>lgraph_rpc_client<a class="headerlink" href="#lgraph-rpc-client" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410fma_common">
+<span id="_CPPv310fma_common"></span><span id="_CPPv210fma_common"></span><span id="fma_common"></span><span class="target" id="namespacefma__common"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fma_common</span></span></span><a class="headerlink" href="#_CPPv410fma_common" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_rpc">
+<span id="_CPPv310lgraph_rpc"></span><span id="_CPPv210lgraph_rpc"></span><span id="lgraph_rpc"></span><span class="target" id="namespacelgraph__rpc"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_rpc</span></span></span><a class="headerlink" href="#_CPPv410lgraph_rpc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryTypeE">
+<span id="_CPPv3N6lgraph14GraphQueryTypeE"></span><span id="_CPPv2N6lgraph14GraphQueryTypeE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType6CYPHERE">
+<span id="_CPPv3N6lgraph14GraphQueryType6CYPHERE"></span><span id="_CPPv2N6lgraph14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType6CYPHERE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType3GQLE">
+<span id="_CPPv3N6lgraph14GraphQueryType3GQLE"></span><span id="_CPPv2N6lgraph14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType3GQLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientTypeE">
+<span id="_CPPv3N6lgraph10ClientTypeE"></span><span id="_CPPv2N6lgraph10ClientTypeE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClientType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a60813255cdc667f2d2f2ddb427d32d44"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98ab892a078fa6077db32721c67735c56fd"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INDIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a43005cd0efa3b1e1373be596db0ee869"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SINGLE_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientE">
+<span id="_CPPv3N6lgraph9RpcClientE"></span><span id="_CPPv2N6lgraph9RpcClientE"></span><span id="lgraph::RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_rpc_client.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a8995083e1c9332090bdbbced0704b1b9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__std::vector:ss:R.ss.ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a59ff51f4744de0edfe8571844287a51a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">urls</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">user</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>urls</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClientD0Ev"></span><span id="lgraph::RpcClient::~RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient_1a0f8219dbf08d58f7cfc0a853538176a4"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallCypher__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a456fdf97ad54654b985ebd5add140db3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a cypher query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallCypherToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1af9ef8ca1182193ef2c18062ecf23eeb7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypherToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a cypher query to leader. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallGql__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a7cfb10baca3d2f668a10ca43e399afc5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a gql query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallGqlToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a189850ee468b61a65982b7e505c8265b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGqlToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a gql query to leader. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="lgraph::RpcClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a93f4c769de4f1979e4ab824afdaa8ead"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::CallProcedureToLeader__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1a3e5b11b2f703f41d40a2afd9c7581376"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedureToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure to leader. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.ssCR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a0081b8bb075d1be82d8c92281d907cdc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load a built-in procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_file</strong> – <strong>[in]</strong> the source_file contain procedure code. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load a built-in procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::ListProcedures__ssR.ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa090037a4c3944d76e3cbf8c07f569b0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>List user-defined procedures. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient6LogoutEv"></span><span id="lgraph::RpcClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient6LogoutEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Client log out. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::IsReadQuery__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a891d9b465df285ae69983ea3aabebde0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Determine whether it is a read-only query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClient__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af77b4e340b5e79a7875f8f065fd221e5"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEb">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEb"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEb"></span><span id="lgraph::RpcClient::GetClient__b"></span><span class="target" id="classlgraph_1_1RpcClient_1ac3415aee2cca8ddb4c12473be63f42a2"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">isReadQuery</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>isReadQuery</strong> – <strong>[in]</strong> read query or not. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClientByNode__ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af935a15699e0f1004779a265afd67c0a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClientByNode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the client according to the node url. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>url</strong> – <strong>[in]</strong> Node address of client connection. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Rpc client connecting to url. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="lgraph::RpcClient::RefreshUserDefinedProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1af85d15b19d971fbe1babd8d06f5ae2c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshUserDefinedProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh User-defined Procedure. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="lgraph::RpcClient::RefreshBuiltInProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1a5d1a4ee81316d67c4d000e598ef41fec"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshBuiltInProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh Built-in Procedure. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="lgraph::RpcClient::RefreshClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1ab683309ba410ef5c7c65ed6a08b085d9"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh the client connection pool according to the cluster status. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="lgraph::RpcClient::LoadBalanceClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1a9b83e575619171ca739b140ffe024207"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadBalanceClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load balance the client pool. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshConnectionEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="lgraph::RpcClient::RefreshConnection"></span><span class="target" id="classlgraph_1_1RpcClient_1a8957fe9842f100f0e80778649ab7ba14"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshConnection</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshConnectionEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh client pool, procedure info. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F">
+<span id="_CPPv3I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span id="_CPPv2I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">F</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph_1_1RpcClient_1a83227aa710bb0fb4cd66dc7e4b00af5a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DoubleCheckQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="lgraph::RpcClient::DoubleCheckQuery::F"><span class="n"><span class="pre">F</span></span></a><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">f</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="Permalink to this definition"></a><br></dt>
+<dd><p>If an exception is thrown in the query, refresh the connection and re-execute. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_typeE">
+<span id="_CPPv3N6lgraph9RpcClient11client_typeE"></span><span id="_CPPv2N6lgraph9RpcClient11client_typeE"></span><span id="lgraph::RpcClient::client_type__ClientType"></span><span class="target" id="classlgraph_1_1RpcClient_1a376acacd121bd1f972b5fb097e220fd9"></span><a class="reference internal" href="#_CPPv4N6lgraph10ClientTypeE" title="lgraph::ClientType"><span class="n"><span class="pre">ClientType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_type</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient4userE"></span><span id="lgraph::RpcClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4userE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient8passwordE"></span><span id="lgraph::RpcClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient8passwordE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11base_clientE">
+<span id="_CPPv3N6lgraph9RpcClient11base_clientE"></span><span id="_CPPv2N6lgraph9RpcClient11base_clientE"></span><span id="lgraph::RpcClient::base_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a58adfed74cd9daeb6b32a267039e925b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11base_clientE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4urlsE">
+<span id="_CPPv3N6lgraph9RpcClient4urlsE"></span><span id="_CPPv2N6lgraph9RpcClient4urlsE"></span><span id="lgraph::RpcClient::urls__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a306ada97a24c8198c1a0c9c3c5b0bb25"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">urls</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4urlsE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13leader_clientE">
+<span id="_CPPv3N6lgraph9RpcClient13leader_clientE"></span><span id="_CPPv2N6lgraph9RpcClient13leader_clientE"></span><span id="lgraph::RpcClient::leader_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a13cc47368956dc5404b8c30b89c359f9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">leader_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13leader_clientE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_poolE">
+<span id="_CPPv3N6lgraph9RpcClient11client_poolE"></span><span id="_CPPv2N6lgraph9RpcClient11client_poolE"></span><span id="lgraph::RpcClient::client_pool__std::deque:std::shared_ptr:lgraph::RpcClient::RpcSingleClient::"></span><span class="target" id="classlgraph_1_1RpcClient_1a844140b131b865884e1233813d5ed217"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">deque</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_pool</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_poolE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient19built_in_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient19built_in_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient19built_in_proceduresE"></span><span id="lgraph::RpcClient::built_in_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1a18060c9aed7ccf4e945b9f88d03142d2"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">built_in_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient19built_in_proceduresE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23user_defined_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="lgraph::RpcClient::user_defined_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1aea4d05a8b62f0732342d07a9495616cf"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_defined_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23user_defined_proceduresE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21cypher_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient21cypher_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient21cypher_write_constantE"></span><span id="lgraph::RpcClient::cypher_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a632dd8c3163187f7e6faa9271b7b4cfc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21cypher_write_constantE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18gql_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient18gql_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient18gql_write_constantE"></span><span id="lgraph::RpcClient::gql_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a9ec0e77daff8924f52eb7f2e177cc1fc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">gql_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18gql_write_constantE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientE"></span><span id="lgraph::RpcClient::RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::RpcSingleClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae26aab72012bcb1ee86fb02e92a9613d"></span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>RpcSingleClient Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="lgraph::RpcClient::RpcSingleClient::~RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a1a143a1804f6bf71869b0ee5a6dc1462"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::RpcSingleClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::RpcSingleClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2b0a265853b25e1e9b36de7acc58c470"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json， Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::ListProcedures__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a44431b16908099e6e5134afbe127ab63"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>List user-defined procedures. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallCypher__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aff1bfcba1cd1754363bb2adf51db086a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a cypher query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallGql__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2fb61a89fc5e431b2433d52059467be0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a gql query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="lgraph::RpcClient::RpcSingleClient::GetUrl"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad4d20fca6bae3f93f4d1e714aacb03cd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUrl</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the url of single client. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>the url of single client. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="lgraph::RpcClient::RpcSingleClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Client log out. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleRequest__LGraphRequestP"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a61415af9341546df1ad67eed0ea2dbaa"></span><span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleRequest</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">LGraphRequest</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">req</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleGraphQueryRequest__lgraph::GraphQueryType.LGraphResponseP.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a63cc8e69616efdad5460f648780a6bb2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleGraphQueryRequest</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">res</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="lgraph::RpcClient::RpcSingleClient::GraphQueryResponseExtractor__GraphQueryResponseCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a4eb9039c5c4d7e1bd1c065e71aaa75d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryResponseExtractor</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">GraphQueryResponse</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="lgraph::RpcClient::RpcSingleClient::url__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae43c7d8d482ec3550b30cbc7dc23b9f0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">url</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="lgraph::RpcClient::RpcSingleClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="lgraph::RpcClient::RpcSingleClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="lgraph::RpcClient::RpcSingleClient::token__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a9f7d94df8d0a73f04a003fe5032ba32d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">token</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="lgraph::RpcClient::RpcSingleClient::server_version__int64_t"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a3de46036a491e337d41dba033c215120"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">server_version</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="lgraph::RpcClient::RpcSingleClient::channel__std::shared_ptr:lgraph_rpc::m_channel:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ac34b00e3851c29e651d8ca31fe21a9be"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">channel</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="lgraph::RpcClient::RpcSingleClient::cntl__std::shared_ptr:lgraph_rpc::m_controller:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a7d9cee7bb74b09c0ff1b71d2a1b4ef8d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_controller</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cntl</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="lgraph::RpcClient::RpcSingleClient::options__std::shared_ptr:lgraph_rpc::m_channel_options:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a18a1c01a5579128138eeddb758b305d6"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel_options</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">options</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-traversal">
+<h2>lgraph_traversal<a class="headerlink" href="#lgraph-traversal" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalE">
+<span id="_CPPv3N10lgraph_api9traversalE"></span><span id="_CPPv2N10lgraph_api9traversalE"></span><span id="lgraph_api::traversal"></span><span class="target" id="namespacelgraph__api_1_1traversal"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">traversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb">
+<span id="_CPPv3N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span id="_CPPv2N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a726096df46599bdfb914a6ca3420ec96"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FindVertices</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">filter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Retrieve all vertices passing the specified filter. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>filter</strong> – <strong>[inout]</strong> The user-defined filter function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The corresponding list of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb">
+<span id="_CPPv3I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span id="_CPPv2I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1aceb3385f1d10f71f5d9aa46fcdd92915"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">frontier</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Extract data from specified vertices. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Template Parameters</dt>
+<dd class="field-even"><p><strong>VertexData</strong> – Type of the vertex data. </p>
+</dd>
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The database. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>frontier</strong> – <strong>[inout]</strong> The vertices to extract data from. </p></li>
+<li><p><strong>extract</strong> – <strong>[inout]</strong> The user-defined extract function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The corresponding extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT">
+<span id="_CPPv3I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span id="_CPPv2I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a860101673fe319842615891bdce356d5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DefaultFilter</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="lgraph_api::traversal::DefaultFilter::IT"><span class="n"><span class="pre">IT</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="Permalink to this definition"></a><br></dt>
+<dd><p>The default filter you may use. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>it</strong> – <strong>[inout]</strong> An iterator class.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Always true. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a0be095f6cae74a9b2b83368bcaa8bb9d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Function closure filtering by label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>label</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a916a3c242ae9447471b4116416ac3200"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Function closure filtering by label id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>label_id</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::eq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a787283b8c440e78fe08f3233ec9927d1"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::neq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a5a867323375932ba84f360b8f7ba104d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::eq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1aca364480fdfefebade068076c782085e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::neq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a2360c3785fed893a88cc4ab67d8a56de"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE">
+<span id="_CPPv3N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="_CPPv2N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="lgraph_api::traversal::MAX_RESULT_SIZE__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a19036385f876c801d15c194fc62e7531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE">
+<span id="_CPPv3N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="_CPPv2N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="lgraph_api::traversal::TRAVERSAL_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a86e405bbe2ac6d2a74230ae2305fd8e0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE">
+<span id="_CPPv3N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="_CPPv2N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="lgraph_api::traversal::TRAVERSAL_ALLOW_REVISITS__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a92a5114a7f6be9af4e24557fa238f8b7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_ALLOW_REVISITS</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4EdgeE">
+<span id="_CPPv3N10lgraph_api9traversal4EdgeE"></span><span id="_CPPv2N10lgraph_api9traversal4EdgeE"></span><span id="lgraph_api::traversal::Edge"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent an edge. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="lgraph_api::traversal::Edge::Edge__s.uint16_t.uint64_t.s.s.b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5fa8e10b10d8db22077e6a8f51c56a4f"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">start</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">tid</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">end</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">eid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">forward</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>start</strong> – The start. </p></li>
+<li><p><strong>lid</strong> – The lid. </p></li>
+<li><p><strong>tid</strong> – The tid. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>eid</strong> – The eid. </p></li>
+<li><p><strong>forward</strong> – True to forward. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="lgraph_api::traversal::Edge::Edge__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1accd38aace77501c9cf5cae967e894970"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="lgraph_api::traversal::Edge::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="lgraph_api::traversal::Edge::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the start vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The start vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="lgraph_api::traversal::Edge::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the end vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The end vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="lgraph_api::traversal::Edge::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a15b074c85865e730723336acec71f79e"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the label ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The label ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="lgraph_api::traversal::Edge::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a02537fe49ffb801dd20bdaae51b29325"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Temporal ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The temporal ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="lgraph_api::traversal::Edge::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a2592e180e605668b296b9251bc4d275a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the edge ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The edge ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="lgraph_api::traversal::Edge::IsForwardC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a41a01f6b828238200fef82f544fd172e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsForward</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the direction of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>true : forward; false: backward. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="lgraph_api::traversal::Edge::GetSrcVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5490526b0251ebb9ad277c9b314eedbb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrcVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the source vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The source vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="lgraph_api::traversal::Edge::GetDstVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ab717cca464319d1b380648aedbaaca1d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDstVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the destination vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The destination vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge6start_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge6start_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge6start_E"></span><span id="lgraph_api::traversal::Edge::start___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ad914f6be659b44fe8e11acc02cf6eeb6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">start_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge6start_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4end_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4end_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4end_E"></span><span id="lgraph_api::traversal::Edge::end___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1afdac24f7adfe72f79983c12b08e566e5"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4end_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4eid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4eid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4eid_E"></span><span id="lgraph_api::traversal::Edge::eid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a74dfb17650dad72d071112c995343f25"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4eid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4lid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4lid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4lid_E"></span><span id="lgraph_api::traversal::Edge::lid___uint16_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4b77269210d4ee2d997719c8dee806ea"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4lid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4tid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4tid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4tid_E"></span><span id="lgraph_api::traversal::Edge::tid___int64_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a6ec1f5936b6351a1911a966a8a08fd42"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4tid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge8forward_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge8forward_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge8forward_E"></span><span id="lgraph_api::traversal::Edge::forward___b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1aae1b80cda1e8b80f4a52f8a6d1f22df8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">forward_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge8forward_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversalE"></span><span id="lgraph_api::traversal::FrontierTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversalE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> provides the most common way to traverse graphs. You can start from a single vertex or a set of vertices (known as the initial frontier), and expand them frontier by frontier, each time visiting neighboring vertices of the current frontier and make those matching specified conditions the new frontier. One powerful feature of <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> is that the traversal can be performed in parallel, accelerating those <em>deep</em> queries significantly. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::FrontierTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a545b378096e3004e11024a15fd17bd27"></span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> object. Note that the transaction must be read- only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Be careful when TRAVERSAL_ALLOW_REVISITS is used, as each vertex may be visited more than once, making the result set huge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::FrontierTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a9c2251578e77394a41833329c9200e72"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ae8aee8d3fccc6f15e21f0e5a4652c33e"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a79b977639f217d9411ac48a32c6e83f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad655c689b55d2072e9212b55ea015bb0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="lgraph_api::traversal::FrontierTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="lgraph_api::traversal::FrontierTraversal::ResetVisited"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aaf986f1e13f0da831c3d8277cdb860f0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetVisited</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset only the visited flags. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="lgraph_api::traversal::FrontierTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="lgraph_api::traversal::FrontierTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="lgraph_api::traversal::FrontierTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::FrontierTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::curr_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a272d864e6eface58376c0d0c08c89401"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::next_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad05308b798bf29c2e2e6fcf6331150c6"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="lgraph_api::traversal::FrontierTraversal::visited___ParallelBitset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ac784cfc9970b0a1fb2e5a1678ed59284"></span><span class="n"><span class="pre">ParallelBitset</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">visited_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelperE">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelperE"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelperE"></span><span id="lgraph_api::traversal::IteratorHelper"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1IteratorHelper"><span class="std std-ref">IteratorHelper</span></a> provides some useful methods, such as casting Vertex/Edge objects to their iterator forms. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="lgraph_api::traversal::IteratorHelper::IteratorHelper__TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a7d72fd8bc5a5a60f16a5eea5b1ae781e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a9db8a753c5773fd00186665e172e8df2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd><p>Casting a <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> to a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vertex</strong> – A <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> object.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> corresponding to vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1ab5ec73c9874f5c269c066857075d67c6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd><p>Casting an <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Edge"><span class="std std-ref">Edge</span></a> to an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>edge</strong> – An edge object.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> corresponding to edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="lgraph_api::traversal::IteratorHelper::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathE">
+<span id="_CPPv3N10lgraph_api9traversal4PathE"></span><span id="_CPPv2N10lgraph_api9traversal4PathE"></span><span id="lgraph_api::traversal::Path"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="lgraph_api::traversal::Path::Path__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abd76ad8cca7c9f5611d89b6c94e88d53"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">start</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>start</strong> – The start. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="lgraph_api::traversal::Path::Path__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a6f0b65d8220590bc0de51a6f9178db0c"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="lgraph_api::traversal::Path::Path__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae8d80e874d2f88e507218f6db1ed2cdc"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERK4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a3640a670cabc7ff15a8bf5e31f83b3e9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERK4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Assignment operator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERR4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae3dcf33db8617fe1de00cedc6541ae98"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERR4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move assignment operator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path6LengthEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path6LengthEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path6LengthEv"></span><span id="lgraph_api::traversal::Path::LengthC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1aa63d0332a20e86302501c8bd1db921c2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Length</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path6LengthEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the length of this path. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The path length. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="lgraph_api::traversal::Path::Append__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab88413d902928384d83cbad1df6de769"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append an edge to the path. Note that the edge’s start vertex should match the current path’s end vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>edge</strong> – edge to append. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="lgraph_api::traversal::Path::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the start vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="lgraph_api::traversal::Path::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the end vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="lgraph_api::traversal::Path::GetLastEdgeC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abf723fca4ce807ccf77dc91e685b5545"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLastEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the last edge of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthEdge__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a7f37b5b5e876c5ec8836bba603e526e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Nth edge of this path. The available range of N is [0, Length). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthVertex__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab6aa8a9295375d526831278b2690558e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Nth vertex of this path. The available range of N is [0, Length]. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5dirs_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5dirs_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5dirs_E"></span><span id="lgraph_api::traversal::Path::dirs___std::vector:b:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a0ad3ec1585be61bf4e9ab8ae94bb4406"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dirs_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5dirs_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5lids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5lids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5lids_E"></span><span id="lgraph_api::traversal::Path::lids___std::vector:uint16_t:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a58d741b575ad6c800db503b3d2db61d3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint16_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5lids_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4ids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path4ids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path4ids_E"></span><span id="lgraph_api::traversal::Path::ids___std::vector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a2a21c3f2f91696ebc1c7d5109b5cc921"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4ids_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversalE"></span><span id="lgraph_api::traversal::PathTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversalE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> behaves similar to <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a>, except that 1) Each vertex could be revisited multiple times. 2) Each traversed path would be stored, and the filter function has access to the path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::PathTraversal::PathTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af738f641e5877af62941a670ceedd359"></span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> object. Note that the transaction must be read-only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Since TRAVERSAL_ALLOW_REVISITS is implied in <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> and storing the Paths also takes a lot of space, the memory consumption could be very large if the filters are not very selective. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::PathTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4664408bde6c8bc833b2d308a7a9c770"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a346ba8aed662685cd78506c8baec815c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a0a54b5500485e208383933b8f2817675"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1abb7d1f2986dde079c71c568410386249"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="lgraph_api::traversal::PathTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="lgraph_api::traversal::PathTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="lgraph_api::traversal::PathTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="lgraph_api::traversal::PathTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::PathTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::curr_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ac73154ee309f0dad63fb1a1790e23025"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::next_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af032087096fefc9f61b4351bc5e9a71d"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6VertexE">
+<span id="_CPPv3N10lgraph_api9traversal6VertexE"></span><span id="_CPPv2N10lgraph_api9traversal6VertexE"></span><span id="lgraph_api::traversal::Vertex"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a vertex. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="lgraph_api::traversal::Vertex::Vertex__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a3f6911c4ec59435701457f131e89af4a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="lgraph_api::traversal::Vertex::Vertex__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a13f7b30a546a536a3dfafd128adb609f"></span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="lgraph_api::traversal::Vertex::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="lgraph_api::traversal::Vertex::GetIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a63765fbd0690661e2af3bc97083475fc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The Id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex4vid_E">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex4vid_E"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex4vid_E"></span><span id="lgraph_api::traversal::Vertex::vid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a224220636b53e35b1b5bf8c0e88717d0"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex4vid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-txn">
+<h2>lgraph_txn<a class="headerlink" href="#lgraph-txn" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api11TransactionE"></span><span id="lgraph_api::Transaction"></span><span class="target" id="classlgraph__api_1_1Transaction"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_txn.h&gt;</em></div>
+<p>TuGraph operations happen in transactions. A transaction is sequence of operations that is carried out atomically on the <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. TuGraph transactions provides full ACID guarantees. </p>
+<p>Transactions are created using <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"><span class="std std-ref">GraphDB::CreateReadTxn()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"><span class="std std-ref">GraphDB::CreateWriteTxn()</span></a>. A read transaction can only perform read operations, otherwise an exception is thrown. A write transaction can perform reads as well as writes. There are performance differences between read and write operations. So if you only need read in a transaction, you should create a read transaction.</p>
+<p>Each transaction must be used in one thread only, and they should not be passed from one thread to another unless it is a forked transaction.</p>
+<p>Read transactions can be forked. The new copy of the transaction will have the same view as the forked one, and it can be used in a separate thread. By forking from one read transaction and using the forked copies in different threads, we can parallelize the execution of specific operations. For example, you can implement a parallel BFS with this capability. Also, you can dump a snapshot of the whole graph using </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09c0d46171b7562e16c3a697f77fca90"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERR11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERR11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERR11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3d6029838ae611c2c7bbc3c59afe059"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERR11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a44fabd0e73ed35b6d683051496a3f30f"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERK11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERK11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERK11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1abde1d510a232da04117f21bd23de8143"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERK11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6CommitEv">
+<span id="_CPPv3N10lgraph_api11Transaction6CommitEv"></span><span id="_CPPv2N10lgraph_api11Transaction6CommitEv"></span><span id="lgraph_api::Transaction::Commit"></span><span class="target" id="classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Commit</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6CommitEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Commits this transaction. Note that optimistic write transactions may fail to commit (an TxnConflict would be thrown). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5AbortEv">
+<span id="_CPPv3N10lgraph_api11Transaction5AbortEv"></span><span id="_CPPv2N10lgraph_api11Transaction5AbortEv"></span><span id="lgraph_api::Transaction::Abort"></span><span class="target" id="classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Abort</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5AbortEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Aborts this transaction. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction7IsValidEv">
+<span id="_CPPv3NK10lgraph_api11Transaction7IsValidEv"></span><span id="_CPPv2NK10lgraph_api11Transaction7IsValidEv"></span><span id="lgraph_api::Transaction::IsValidC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this transaction is valid. <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> becomes invalid after calling <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"><span class="std std-ref">Abort()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"><span class="std std-ref">Commit()</span></a>. Operations on invalid transaction yields exceptions. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv">
+<span id="_CPPv3NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="_CPPv2NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="lgraph_api::Transaction::IsReadOnlyC"></span><span class="target" id="classlgraph__api_1_1Transaction_1afde2da3cd793a0a0403ea2ea0c9b9ea7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadOnly</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this txn is read only. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if read only, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6GetTxnEv">
+<span id="_CPPv3N10lgraph_api11Transaction6GetTxnEv"></span><span id="_CPPv2N10lgraph_api11Transaction6GetTxnEv"></span><span id="lgraph_api::Transaction::GetTxn"></span><span class="target" id="classlgraph__api_1_1Transaction_1a94bc9b71b14ae6ad7c788d20ec39b769"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6GetTxnEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="lgraph_api::Transaction::GetVertexIterator"></span><span class="target" id="classlgraph__api_1_1Transaction_1a16d76f5c12d744846d85b007cf4e094c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get a vertex iterator pointing to the first vertex. If there is no vertex, the iterator is invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="lgraph_api::Transaction::GetVertexIterator__int64_t.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1af8c95376a78769b0717fd40fdcd274eb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets a vertex iterator pointing to the Vertex with vid. If the vertex does not exist, the iterator is invalid. If nearest==true, the iterator points to the first vertex sorted by vid, with id&gt;=vid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vid</strong> – The vid. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to point to the nearest vertex sorted by vid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9bcd70f9274974a3028ef762228e176e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an out edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1add821551447553956775fac4656f3d94"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an in edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab3bfd10ebeec5f7d0455d1fbc0762e73"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="lgraph_api::Transaction::GetNumVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4b870210a66a2f239535915497e26278"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of vertex labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The number of vertex labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="lgraph_api::Transaction::GetNumEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1aec256df0cdfca791031bad9c43c63061"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of edge labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The number of edge labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="lgraph_api::Transaction::ListVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a5b2320193bfb8ffbfaa157a110d550ad"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Lists all vertex labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="lgraph_api::Transaction::ListEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae77fe52ec78bc3e8d8d92fe8d7a3accb"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List all edge labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1a3769873514b6a5dd62b04414ff627c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label name.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab030e136e6b28679acbb59a08a977090"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1afd8f546dcb187e1be6f86d268c62996b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4afb55d1ce9b5906c6721f5c4b3b3d82"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac461aea7ee379f8669f45f9782cea1f4"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a55194445591f9fa6730dd8deb99e2414"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2d9a2f736cfb96a2f61e4de3072eb811"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetEdgeFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c13f1f3f527b37d3a221d4adb06cc5c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae62bafbd58f35cfcc01255fe4113094f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2c972657b35f86a21527bc2ad1be741e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae57f64149da2f4d2f972f49a53943591"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee14b2bcd0e170d5b87924a6a9a3e16f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3452ae2c9cae9850a7e53c2ddcc6240"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add0eea119e67210b57d9b8b6119e88d4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad342ee46d6f7f955529018100a701185"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9663b407c7f5ce18af938c7b670dd3fd"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1af3a3806320f56cb01f5edc7ff364ad80"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a66d9f07dc220285b2fbec99fb088ad4a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A vector of vertex index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="lgraph_api::Transaction::ListEdgeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee4d71f4e5ce213bbe886162db6edba0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A vector of edge index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aea99efb5e098fca6157f419ec7e4396c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e87da96ea73d8c709ef75a92b2bf5c4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add8eaa25484aefe92c14c0340bb35841"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a49deaf34c918d940432204e5a5a16cff"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09382e2279bb78f1a79443741112a57e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0a484619a92fe73247f86d9db09d2ead"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of vertices. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of edges. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee85d698359c92dc3c9bc9f9e65ecf0f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2eddb62a56cf0030545bce6bef00104f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9af16d5a13268c711610cc3c615592c0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9cc46853b60d578578649f8bef35d84d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9a16d2c7f0770fbfd38e53a4a95a165f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a99a3bbbf134a20c992b10ac015ea4131"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv">
+<span id="_CPPv3N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="_CPPv2N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="lgraph_api::Transaction::GetNumVertices"></span><span class="target" id="classlgraph__api_1_1Transaction_1a84acf46e241f12fe3480c203cbd59d3c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The nubmer of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexPrimaryField__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0b662063aee62d2793c634a132375ae9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexPrimaryField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex primary field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The primary field. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5CountEv">
+<span id="_CPPv3N10lgraph_api11Transaction5CountEv"></span><span id="_CPPv2N10lgraph_api11Transaction5CountEv"></span><span id="lgraph_api::Transaction::Count"></span><span class="target" id="classlgraph__api_1_1Transaction_1a420ff169b39c4ce47b02a25a1eda00ae"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Count</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5CountEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the total number of vertex and edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>std::pair object, first element is vertex number, second is edge number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11CountDetailEv">
+<span id="_CPPv3N10lgraph_api11Transaction11CountDetailEv"></span><span id="_CPPv2N10lgraph_api11Transaction11CountDetailEv"></span><span id="lgraph_api::Transaction::CountDetail"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e88abab9d0a158b1dd1f72d97dcbda1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CountDetail</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11CountDetailEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the total number of vertex or edge for each label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>std::tuple object list, first element indicates whether it is VERTEX or EDGE, second is label name, third is number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="lgraph_api::Transaction::Transaction__lgraph::TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1b5dc38854e41e00ee874297e73343af"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction4txn_E">
+<span id="_CPPv3N10lgraph_api11Transaction4txn_E"></span><span id="_CPPv2N10lgraph_api11Transaction4txn_E"></span><span id="lgraph_api::Transaction::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">GraphDB</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-types">
+<h2>lgraph_types<a class="headerlink" href="#lgraph-types" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15EdgeConstraintsE">
+<span id="_CPPv3N10lgraph_api15EdgeConstraintsE"></span><span id="_CPPv2N10lgraph_api15EdgeConstraintsE"></span><span id="lgraph_api::EdgeConstraints"></span><span class="target" id="namespacelgraph__api_1a7d597d281cbcd87325f58fcce96e5d34"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeConstraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Edge constraints type define. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevelE">
+<span id="_CPPv3N10lgraph_api11AccessLevelE"></span><span id="_CPPv2N10lgraph_api11AccessLevelE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevelE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access level a user or role has on a graph. NONE: no permission. READ: read-only, no write access. WRITE: can read and write vertex and edge, but cannot change meta data such as schema or access. FULL: full access, can modify schema, grant access to other users, or even delete this graph. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4NONEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4READE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4READE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62a3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4READE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ad4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel5WRITEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4FULLE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4FULLE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4FULLE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62aba7de5bc6888294e5884b024a4c894f1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FULL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4FULLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevelE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevelE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevelE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afe"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldAccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afeab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4NONEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4READE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4READE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afea3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4READE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afead4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryTypeE">
+<span id="_CPPv3N10lgraph_api14GraphQueryTypeE"></span><span id="_CPPv2N10lgraph_api14GraphQueryTypeE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType6CYPHERE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType6CYPHERE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType6CYPHERE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType3GQLE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType3GQLE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType3GQLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldTypeE">
+<span id="_CPPv3N10lgraph_api9FieldTypeE"></span><span id="_CPPv2N10lgraph_api9FieldTypeE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1da"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Field and value types. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType3NULE">
+<span id="_CPPv3N10lgraph_api9FieldType3NULE"></span><span id="_CPPv2N10lgraph_api9FieldType3NULE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa4c175fbb65c723226d182dbfd556136a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType3NULE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BOOLE">
+<span id="_CPPv3N10lgraph_api9FieldType4BOOLE"></span><span id="_CPPv2N10lgraph_api9FieldType4BOOLE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daae663dbb8f8244e122acb5bd6b2c216e1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BOOLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4INT8E">
+<span id="_CPPv3N10lgraph_api9FieldType4INT8E"></span><span id="_CPPv2N10lgraph_api9FieldType4INT8E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daada138aad097eaac8697fe3661c91af95"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4INT8E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT16E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT16E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT16E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac4a99142c241d04e1607af8a319c201b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT16E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT32E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT32E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT32E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac1081c62db14e24ef35a1c3c36cba2e7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT32E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT64E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT64E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT64E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa423a1db7cbc915478f654b15f87f3aac"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT64E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5FLOATE">
+<span id="_CPPv3N10lgraph_api9FieldType5FLOATE"></span><span id="_CPPv2N10lgraph_api9FieldType5FLOATE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa9cf4a0866224b0bb4a7a895da27c9c4c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5FLOATE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api9FieldType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api9FieldType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa33465d1d419b1074fb259ef444609e92"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6DOUBLEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4DATEE">
+<span id="_CPPv3N10lgraph_api9FieldType4DATEE"></span><span id="_CPPv2N10lgraph_api9FieldType4DATEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa0ace72efd9e987dfd807365d0ca50141"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4DATEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType8DATETIMEE">
+<span id="_CPPv3N10lgraph_api9FieldType8DATETIMEE"></span><span id="_CPPv2N10lgraph_api9FieldType8DATETIMEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa86797ee5836338ee241ceee5cfc669e2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATETIME</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType8DATETIMEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6STRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType6STRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType6STRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaee847e634a4297b274316de8a8ca9921"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6STRINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BLOBE">
+<span id="_CPPv3N10lgraph_api9FieldType4BLOBE"></span><span id="_CPPv2N10lgraph_api9FieldType4BLOBE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa3a625432a45f9c83112036bc7a2d2d70"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BLOB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BLOBE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5POINTE">
+<span id="_CPPv3N10lgraph_api9FieldType5POINTE"></span><span id="_CPPv2N10lgraph_api9FieldType5POINTE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa15108ccafa3232b9067f889b6156f565"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5POINTE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaaebdbcb765394d25d6a604589a890f82"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType10LINESTRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType10LINESTRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType10LINESTRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa21af7314ca158a415f7e073333d14447"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType10LINESTRINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaa90611ea278d30580b21af6d65208307"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7POLYGONE">
+<span id="_CPPv3N10lgraph_api9FieldType7POLYGONE"></span><span id="_CPPv2N10lgraph_api9FieldType7POLYGONE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daad5355465780b9a6259ebbc74d47477db"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7POLYGONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaecdc92bf56d960b73b02ee40125758bc"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7SPATIALE">
+<span id="_CPPv3N10lgraph_api9FieldType7SPATIALE"></span><span id="_CPPv2N10lgraph_api9FieldType7SPATIALE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa608c1acc2033e0e07248c48ea01746ce"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SPATIAL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7SPATIALE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphTypeE">
+<span id="_CPPv3N10lgraph_api10LGraphTypeE"></span><span id="_CPPv2N10lgraph_api10LGraphTypeE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00d"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphType</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">uint16_t</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>a type of value used in result entry and parameter in procedure or plugin signature </p>
+<dl class="field-list simple">
+<dt class="field-odd">Param INTEGER</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param FLOAT</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param DOUBLE</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param BOOLEAN</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param STRING</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param MAP</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param NODE</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>, VertexId </p>
+</dd>
+<dt class="field-even">Param RELATIONSHIP</dt>
+<dd class="field-even"><p><a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> || <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>, <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p>
+</dd>
+<dt class="field-odd">Param PATH</dt>
+<dd class="field-odd"><p>lgraph_api::Path </p>
+</dd>
+<dt class="field-even">Param LIST</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param ANY</dt>
+<dd class="field-odd"><p>like Object in Java, its procedure author’s responsibility to check the underlying concrete type whether valid in runtime. </p>
+</dd>
+</dl>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3NULE">
+<span id="_CPPv3N10lgraph_api10LGraphType3NULE"></span><span id="_CPPv2N10lgraph_api10LGraphType3NULE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3NULE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7INTEGERE">
+<span id="_CPPv3N10lgraph_api10LGraphType7INTEGERE"></span><span id="_CPPv2N10lgraph_api10LGraphType7INTEGERE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5d5cd46919fa987731fb2edefe0f2a0c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INTEGER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7INTEGERE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType5FLOATE">
+<span id="_CPPv3N10lgraph_api10LGraphType5FLOATE"></span><span id="_CPPv2N10lgraph_api10LGraphType5FLOATE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dae738c26bf4ce1037fa81b039a915cbf6"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType5FLOATE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api10LGraphType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api10LGraphType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dafd3e4ece78a7d422280d5ed379482229"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6DOUBLEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7BOOLEANE">
+<span id="_CPPv3N10lgraph_api10LGraphType7BOOLEANE"></span><span id="_CPPv2N10lgraph_api10LGraphType7BOOLEANE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac48d5da12d702e73d6966069f2687376"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOLEAN</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7BOOLEANE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6STRINGE">
+<span id="_CPPv3N10lgraph_api10LGraphType6STRINGE"></span><span id="_CPPv2N10lgraph_api10LGraphType6STRINGE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da63b588d5559f64f89a416e656880b949"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6STRINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4NODEE">
+<span id="_CPPv3N10lgraph_api10LGraphType4NODEE"></span><span id="_CPPv2N10lgraph_api10LGraphType4NODEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da0cc25b606fe928a0c9a58f7f209c4495"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NODE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4NODEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE">
+<span id="_CPPv3N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span id="_CPPv2N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac5a4cec9a456484389b2573c8ae0a8bf"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RELATIONSHIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4PATHE">
+<span id="_CPPv3N10lgraph_api10LGraphType4PATHE"></span><span id="_CPPv2N10lgraph_api10LGraphType4PATHE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5ffb5f0d0de78321df46fc7c93ca64a3"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PATH</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4PATHE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4LISTE">
+<span id="_CPPv3N10lgraph_api10LGraphType4LISTE"></span><span id="_CPPv2N10lgraph_api10LGraphType4LISTE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da298cb25408234de02baf2085803a464a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LIST</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4LISTE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3MAPE">
+<span id="_CPPv3N10lgraph_api10LGraphType3MAPE"></span><span id="_CPPv2N10lgraph_api10LGraphType3MAPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5af1a3a285c2bdee4192223e31e1f833"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3MAPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3ANYE">
+<span id="_CPPv3N10lgraph_api10LGraphType3ANYE"></span><span id="_CPPv2N10lgraph_api10LGraphType3ANYE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da8e1bde3c3d303163521522cf1d62f21f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ANY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3ANYE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeTypeE">
+<span id="_CPPv3N10lgraph_api14PluginCodeTypeE"></span><span id="_CPPv2N10lgraph_api14PluginCodeTypeE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Type of code given when loading a new plugin. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2PYE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2PYE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2PYE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3ae0a77e22f8238541046ba5f9a5941e9e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2PYE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2SOE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2SOE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2SOE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3af9f590fe6d84e72c832e714b75b1604b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SO</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2SOE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3CPPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3CPPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3CPPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aca1ef9dc7006f2011c38e2bcc8f64d16"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CPP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3CPPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3ZIPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3ZIPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3ZIPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aed0690cdc850739d6e2b7b888311e32c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ZIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3ZIPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexTypeE">
+<span id="_CPPv3N10lgraph_api9IndexTypeE"></span><span id="_CPPv2N10lgraph_api9IndexTypeE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>index type </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType14NonuniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType14NonuniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a5e3e0d5af84f4b5e85c9dca495b47018"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NonuniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is not unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a7f0f75f7fcd7d67aa985f11f3ebf2712"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GlobalUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is a global unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType15PairUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType15PairUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a89627e6fbb7ed5b8b3913ecbd253b52f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PairUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is a pair unique index, for edge index only key of pair unique index is one of the follow case : if src_vid &lt; dst_vid ,key is (index field value + src_vid + dst_vid) if src_vid &gt; dst_vid ,key is (index field value + dst_vid + src_vid) </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK11AccessLevel"></span><span id="lgraph_api::to_string__AccessLevelCR"></span><span class="target" id="namespacelgraph__api_1aaa50da267713908744fd8e2c5a6a4373"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK11AccessLevel" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="lgraph_api::to_string__FieldAccessLevelCR"></span><span class="target" id="namespacelgraph__api_1af06d7db8c2df7831e02af25d45ad43ef"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="lgraph_api::FieldAccessLevel"><span class="n"><span class="pre">FieldAccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK14GraphQueryType">
+<span id="_CPPv3N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="_CPPv2N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="lgraph_api::to_string__GraphQueryTypeCR"></span><span class="target" id="namespacelgraph__api_1acd1e36eab9c9fc42d4192f3d55e4504a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="lgraph_api::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK14GraphQueryType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE9FieldType">
+<span id="_CPPv3N10lgraph_api9to_stringE9FieldType"></span><span id="_CPPv2N10lgraph_api9to_stringE9FieldType"></span><span id="lgraph_api::to_string__FieldType"></span><span class="target" id="namespacelgraph__api_1a584042d80e34528010e1ad8e3e499b1d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the name of the given FieldType. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – when an unrecognizable FieldType is given.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>v</strong> – A FieldType.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Name of the given FieldType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType">
+<span id="_CPPv3N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="_CPPv2N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsField__LGraphType"></span><span class="target" id="namespacelgraph__api_1a4f4fd20c65be1aaa3f4d6e70e7d7218a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsField</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType">
+<span id="_CPPv3N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="_CPPv2N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsGraphElement__LGraphType"></span><span class="target" id="namespacelgraph__api_1a9fb9c1e160b13a90e177a8e8ec0e00fa"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsGraphElement</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType">
+<span id="_CPPv3N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="_CPPv2N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsCollection__LGraphType"></span><span class="target" id="namespacelgraph__api_1a82cc6a5df4119f903835efab9edbf4fe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsCollection</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType">
+<span id="_CPPv3N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="_CPPv2N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsAny__LGraphType"></span><span class="target" id="namespacelgraph__api_1aca1c7356409eb19c5deab724bc4fff2d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsAny</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE10LGraphType">
+<span id="_CPPv3N10lgraph_api9to_stringE10LGraphType"></span><span id="_CPPv2N10lgraph_api9to_stringE10LGraphType"></span><span id="lgraph_api::to_string__LGraphType"></span><span class="target" id="namespacelgraph__api_1a5113ccea82007fb6b30d591032637775"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType">
+<span id="_CPPv3N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="_CPPv2N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="lgraph_api::PluginCodeTypeStr__PluginCodeType"></span><span class="target" id="namespacelgraph__api_1ad94969b6b33bfee0e009c16ba50623a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeTypeStr</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="lgraph_api::PluginCodeType"><span class="n"><span class="pre">PluginCodeType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code_type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the name of plugin code types. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptionsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptionsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptionsE"></span><span id="lgraph_api::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Edge label options, contain fields only edge have. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-types">Public Types</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TemporalFieldOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439ac6e421eaad140c1bc1a39980502df80c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ASC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439a65a6d757dbb571ccc3af9706e9a5f607"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DESC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="lgraph_api::EdgeOptions::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5708a1309a1260a1c5a7208f9d7f25c2"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="lgraph_api::EdgeOptions::EdgeOptions__EdgeConstraintsCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5a91f7f6cbcd9600e96add55f510a9d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="lgraph_api::EdgeOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions5clearEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions5clearEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions5clearEv"></span><span id="lgraph_api::EdgeOptions::clear"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions5clearEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="lgraph_api::EdgeOptions::edge_constraints__EdgeConstraints"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ab879b0258a59289c195a102d07ae88bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_constraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="lgraph_api::EdgeOptions::temporal_field__ss"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aed02035800f19fa3eb75108a4ed4489a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="lgraph_api::EdgeOptions::temporal_field_order__lgraph_api::EdgeOptions::TemporalFieldOrder"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a7e866158b92a86c3db1a2db0ad830104"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field_order</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="lgraph_api::EdgeOptions::TemporalFieldOrder::ASC"><span class="n"><span class="pre">ASC</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder">
+<span id="_CPPv3N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="_CPPv2N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="lgraph_api::EdgeOptions::to_string__TemporalFieldOrderCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a02b8f61202a7e3f790caaaece23d1cfc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUidE">
+<span id="_CPPv3N10lgraph_api7EdgeUidE"></span><span id="_CPPv2N10lgraph_api7EdgeUidE"></span><span id="lgraph_api::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUidE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="lgraph_api::EdgeUid::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ac4a49320d7fa2c7fba9bdad45e49e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="lgraph_api::EdgeUid::EdgeUid__int64_t.int64_t.uint16_t.int64_t.int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a3ecba2c59d236b1b4f042d4274f51264"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">l</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">e</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7ReverseEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7ReverseEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7ReverseEv"></span><span id="lgraph_api::EdgeUid::Reverse"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae1b551cc51c9d556342b27b466a7c7cb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reverse</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7ReverseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reverses side of this edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::eq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae10ec79b489d4c829b1b28a4c14b7f7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::lt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1afde4cbd02b63c9acd53e61d5e49787e6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::gt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a92818596b49b9fd47fa4b4ce4c203094"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid8ToStringEv">
+<span id="_CPPv3NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="_CPPv2NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="lgraph_api::EdgeUid::ToStringC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of this object. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3srcE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3srcE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3srcE"></span><span id="lgraph_api::EdgeUid::src__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7d1e8afde8407667e51f6de0ba9d6453"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3srcE" title="Permalink to this definition"></a><br></dt>
+<dd><p>source vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3dstE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3dstE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3dstE"></span><span id="lgraph_api::EdgeUid::dst__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1adbdebae8daea6c03c200361fa8840a80"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3dstE" title="Permalink to this definition"></a><br></dt>
+<dd><p>destination vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3lidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3lidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3lidE"></span><span id="lgraph_api::EdgeUid::lid__uint16_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a16870a9bf8dc2c31ee3c874d7adbd02a"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3lidE" title="Permalink to this definition"></a><br></dt>
+<dd><p>label id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3tidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3tidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3tidE"></span><span id="lgraph_api::EdgeUid::tid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a523c7bbc2f001feab204b52b533f7c87"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3tidE" title="Permalink to this definition"></a><br></dt>
+<dd><p>timestamp </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3eidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3eidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3eidE"></span><span id="lgraph_api::EdgeUid::eid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ea4961b92589517fd8cfafc0f945033"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3eidE" title="Permalink to this definition"></a><br></dt>
+<dd><p>additional edge id to distinguish edges with the same tid </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="lgraph_api::EdgeUid::AnyEdge"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ab5a73d71df790d8768376a4d13608773"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AnyEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of in-coming edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of out-going edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataE">
+<span id="_CPPv3N10lgraph_api9FieldDataE"></span><span id="_CPPv2N10lgraph_api9FieldDataE"></span><span id="lgraph_api::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A class that represents variant type. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEv">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEv"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEv"></span><span id="lgraph_api::FieldData::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a33d34623467e64a3352cd10e53c85ca5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEb">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEb"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEb"></span><span id="lgraph_api::FieldData::FieldData__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a06ad1d80ad369afa643075cbe87f02ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="lgraph_api::FieldData::FieldData__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a265c89b1a86a0bbad89cf42661828f8c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="lgraph_api::FieldData::FieldData__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7e0e988dd1d89abbdacbf4d99fd7b2bf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="lgraph_api::FieldData::FieldData__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1aea814e9fb09dda664977d12f5b350d57"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="lgraph_api::FieldData::FieldData__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a38a8108c47e489a360ebece5e593ca7f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEf">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEf"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEf"></span><span id="lgraph_api::FieldData::FieldData__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab8122e35f0b0a42212299fb31ba8cf8d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEf" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEd">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEd"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEd"></span><span id="lgraph_api::FieldData::FieldData__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad56e5648c7943ef08a593aaf5c231985"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEd" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="lgraph_api::FieldData::FieldData__DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a484a31f1c0cba4531908a803a1782258"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="lgraph_api::FieldData::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="lgraph_api::FieldData::FieldData__DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a870fede3129fb7b07d10096b7adf796f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="lgraph_api::FieldData::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50384efa457e9883b378314910e01ccc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d1752cfc22854c2c44381b0a443fb56"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="lgraph_api::FieldData::FieldData__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a28485df6381f6dc1ba4b30a8087e39fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="lgraph_api::FieldData::FieldData__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a72fde0d7ac627644c3dff536d09a45f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aff76c6792c66514d775ba8be88b789ab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a388fd3199bf652332ce922fe0a25f145"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad19f579289333ecf8515aae8f3bb903a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aafaa13b9ee556736c8992f555e99eda6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a393d9735468c278ddf48b9cf8ef95891"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a59b4b116bc89bf0718ba25b9749c2cce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac81b0f4a81a11954f3afcaa9872b396b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5da2cfc866cfdbe5db69ba9ef1dab2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataD0Ev">
+<span id="_CPPv3N10lgraph_api9FieldDataD0Ev"></span><span id="_CPPv2N10lgraph_api9FieldDataD0Ev"></span><span id="lgraph_api::FieldData::~FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6e58de1884451d88a24994e2875b1d6a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a74cb11c1f4f0a79d6f7a278fc84074ba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5a88873a071ad0c03bcf2c2a498e90bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac721aa38df96b34b841cd4bbc608abdf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b27ecbef11936a80c911800629edd46"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERR9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7integerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7integerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7integerEv"></span><span id="lgraph_api::FieldData::integerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1e5b6bc8e5ac95ae151fdaf8894201e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">integer</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7integerEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as int64. Valid only when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is of INT8, INT16, INT32, or INT64 types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of int types.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>An int64_t. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData4realEv">
+<span id="_CPPv3NK10lgraph_api9FieldData4realEv"></span><span id="_CPPv2NK10lgraph_api9FieldData4realEv"></span><span id="lgraph_api::FieldData::realC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a3f678878dde3a729f94dfefbdc4ef2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">real</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData4realEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as a double. The <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> must be of FLOAT or DOUBLE types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown if the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of FLOAT or DOUBLE types.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A double. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6stringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6stringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6stringEv"></span><span id="lgraph_api::FieldData::stringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7314f49a51859d46439cfeddb9ea06ec"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6stringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as std::string. Valid only for STRING, BLOB and SPATIAL. BLOB data is returned as-is, since std::string can also hold byte array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when a bad cast error condition occurs.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A reference to a const std::string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBoolEv"></span><span id="lgraph_api::FieldData::AsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac488187ef67bf8905cbe686daab95183"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBoolEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="lgraph_api::FieldData::AsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0094a31af359f4684c261a56f780cfb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsInt8Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="lgraph_api::FieldData::AsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aaca113d03918222c50977a094b75c2d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt16Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="lgraph_api::FieldData::AsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0cc24eb0e06a5f5b5476f5739b6ae51e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt32Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="lgraph_api::FieldData::AsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a16e138db4d9a0defc0ab8f03a7864d65"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt64Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsFloatEv"></span><span id="lgraph_api::FieldData::AsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8f86682f960b846e1c3a59eb7fc6ae95"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsFloatEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="lgraph_api::FieldData::AsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2894e904ceb04109370957ba7c48e189"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsDoubleEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1accfbae3969f742ce3621560fee34dbda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Date</span> <span class="pre">AsDate</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1abd4d1fc803c662e145761278c129d3c9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::DateTime</span> <span class="pre">AsDateTime</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsStringEv"></span><span id="lgraph_api::FieldData::AsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5e3562cda960da001597e7dd5679b140"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsStringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBlobEv"></span><span id="lgraph_api::FieldData::AsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9a5a106b2ee0d6fa3c78592852682f0b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBlobEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="lgraph_api::FieldData::AsBase64BlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1afc4b6bc9a7a4d42a981579e04b86b3a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBase64Blob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a8128129ec0fa7689772f0c437fe93a1f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::SRID</span> <span class="pre">GetSRID</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a26726ddebb182026865e77b4e68f8f53"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a31ea41c18cb7507bfefbb18971a3dd0e"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ad5f639edaa8b36e90cff7192554b8723"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1aaef5ea8cbde81ad51459f035a99bdd7f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a7fce7150c8ad873933a8028b16a72a69"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a0015550261b9e976e07e61a3d5790fda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1afb01ecb2663024f0adedfcfe05928d45"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ade0f7fe05edb1eb43c1f4057275967f9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6ToBoltEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6ToBoltEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6ToBoltEv"></span><span id="lgraph_api::FieldData::ToBoltC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3b294f10df124b9d290c7d8fb37e1243"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToBolt</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6ToBoltEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::ToString__ssCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5290ed610cdd3fb38c0d09be107dce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">null_value</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"NUL"</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of this <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="lgraph_api::FieldData::eq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1360e03268a1c10e4a40573e61f2f5ae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataneERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="lgraph_api::FieldData::neq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade1a5ee8968dbf6e7656e5adf96be546"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataneERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="lgraph_api::FieldData::gt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a936f13e9913fde88ff4beb6ba8cabbba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatageERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="lgraph_api::FieldData::gte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9dbdaf01c34ed106fe44fb5f4df2a43b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatageERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataltERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="lgraph_api::FieldData::lt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b808b6437787ab0de4133d7f1cd077"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataltERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataleERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="lgraph_api::FieldData::lte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a34d5df1f1114d3fe8c15bce452736680"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataleERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7GetTypeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7GetTypeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7GetTypeEv"></span><span id="lgraph_api::FieldData::GetTypeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aacf5cac64e0e4e0fba5962f6f1ecf925"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7GetTypeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7is_nullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7is_nullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7is_nullEv"></span><span id="lgraph_api::FieldData::is_nullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a54e61d2bb6c2a58d7b98180555af09e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_null</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7is_nullEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6is_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6is_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6is_bufEv"></span><span id="lgraph_api::FieldData::is_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a49ddf20e31700f6609ffa379f0d25a8f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6is_bufEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="lgraph_api::FieldData::is_empty_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade6523aa6dc019354f36c47aeb4dfd21"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_empty_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsNullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsNullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsNullEv"></span><span id="lgraph_api::FieldData::IsNullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac4d637a0dec45d546495c1660c9f6047"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsNull</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsNullEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is null. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBoolEv"></span><span id="lgraph_api::FieldData::IsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec3bdef27fa2d4de29db82d2334ad2d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBoolEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is bool. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBlobEv"></span><span id="lgraph_api::FieldData::IsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50d95767570c5cc1599c634b7b33e916"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBlobEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is BLOB. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsStringEv"></span><span id="lgraph_api::FieldData::IsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7c412f98489e7d252ef40ed053a3908c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is string. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="lgraph_api::FieldData::IsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a325f297dbf3554c5dbb109b2dada4a43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsInt8Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT8. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="lgraph_api::FieldData::IsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefe2db06fec008bc80e0d15ab52949c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt16Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT16. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="lgraph_api::FieldData::IsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a480ddcb154c9e18b948ff3850a42c22d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt32Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT32. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="lgraph_api::FieldData::IsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b0be739d239c9d646696e1bfe3b2bae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt64Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT64. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsIntegerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="lgraph_api::FieldData::IsIntegerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8543c359835d7977b96446aaef126344"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsIntegerEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Is this a INT8, INT16, INT32 or INT64? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsFloatEv"></span><span id="lgraph_api::FieldData::IsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec0a6f81c7581924db00ea960358d91b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsFloatEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is float. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="lgraph_api::FieldData::IsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a300a2e608e8144e2fbe4588729dd34e3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsDoubleEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is double. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsRealEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsRealEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsRealEv"></span><span id="lgraph_api::FieldData::IsRealC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab6d49b63cf486d609f6286f8b26887f9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsRealEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Is this a FLOAT or DOUBLE? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsDateEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsDateEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsDateEv"></span><span id="lgraph_api::FieldData::IsDateC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8aa76d397e0e2b1d0cb09487316210cc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsDateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is date. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="lgraph_api::FieldData::IsDateTimeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1b1b2b6676359ff4d4ec77eb7e7ee62e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is date time. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsPointEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsPointEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsPointEv"></span><span id="lgraph_api::FieldData::IsPointC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab50e9ff6a50f06668ea577fe1d963a8b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsPointEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is Point. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12IsLineStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="lgraph_api::FieldData::IsLineStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a795fc6d4d17d385f07d87f82bb247c45"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsLineString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12IsLineStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is LineString. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsPolygonEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="lgraph_api::FieldData::IsPolygonC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a57c2b6137c6ae390b86d5f341b900992"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPolygon</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsPolygonEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is Polygon. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsSpatialEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="lgraph_api::FieldData::IsSpatialC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad51d37e3d848990cec85e7de187309fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsSpatial</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsSpatialEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is spatial. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4typeE">
+<span id="_CPPv3N10lgraph_api9FieldData4typeE"></span><span id="_CPPv2N10lgraph_api9FieldData4typeE"></span><span id="lgraph_api::FieldData::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7booleanE">
+<span id="_CPPv3N10lgraph_api9FieldData7booleanE"></span><span id="_CPPv2N10lgraph_api9FieldData7booleanE"></span><span id="lgraph_api::FieldData::boolean__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a857e4e5a2613b7cf584dbf12dae00525"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">boolean</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7booleanE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4int8E">
+<span id="_CPPv3N10lgraph_api9FieldData4int8E"></span><span id="_CPPv2N10lgraph_api9FieldData4int8E"></span><span id="lgraph_api::FieldData::int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae0a430ab8199def132f3f07af5c84066"></span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4int8E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int16E">
+<span id="_CPPv3N10lgraph_api9FieldData5int16E"></span><span id="_CPPv2N10lgraph_api9FieldData5int16E"></span><span id="lgraph_api::FieldData::int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7cd86ccaa2b7be3ef15423f3f58e929e"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int16E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int32E">
+<span id="_CPPv3N10lgraph_api9FieldData5int32E"></span><span id="_CPPv2N10lgraph_api9FieldData5int32E"></span><span id="lgraph_api::FieldData::int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f658422e832e5e2d56e2245cb84be84"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int32E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int64E">
+<span id="_CPPv3N10lgraph_api9FieldData5int64E"></span><span id="_CPPv2N10lgraph_api9FieldData5int64E"></span><span id="lgraph_api::FieldData::int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a45d113f8d303eebb3734306531862812"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int64E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2spE">
+<span id="_CPPv3N10lgraph_api9FieldData2spE"></span><span id="_CPPv2N10lgraph_api9FieldData2spE"></span><span id="lgraph_api::FieldData::sp__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8d3eff5289da252b05248e40c1cd8188"></span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">sp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2spE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2dpE">
+<span id="_CPPv3N10lgraph_api9FieldData2dpE"></span><span id="_CPPv2N10lgraph_api9FieldData2dpE"></span><span id="lgraph_api::FieldData::dp__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae571d69d755e366904e8663a4c643901"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2dpE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData3bufE">
+<span id="_CPPv3N10lgraph_api9FieldData3bufE"></span><span id="_CPPv2N10lgraph_api9FieldData3bufE"></span><span id="lgraph_api::FieldData::buf__ssP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00201fbea83f2e7a263f58098aa98cd7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">buf</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData3bufE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4dataE">
+<span id="_CPPv3N10lgraph_api9FieldData4dataE"></span><span id="_CPPv2N10lgraph_api9FieldData4dataE"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b1a03093018acfa0d961cae96146f6"></span><span class="k"><span class="pre">union</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">[anonymous]</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BoolEb">
+<span id="_CPPv3N10lgraph_api9FieldData4BoolEb"></span><span id="_CPPv2N10lgraph_api9FieldData4BoolEb"></span><span id="lgraph_api::FieldData::Bool__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbaec39a10e97bfc380b60052450b22b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Bool</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BoolEb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4Int8E6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="lgraph_api::FieldData::Int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbc62444e525fdbd056581b349b2a7ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int8</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4Int8E6int8_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int16E7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="lgraph_api::FieldData::Int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f690c1758c4620ba79e4b03bf703531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int16</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int16E7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int32E7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="lgraph_api::FieldData::Int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a99c13db42b1525365635d10480b7d4ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int32</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int32E7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int64E7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="lgraph_api::FieldData::Int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7301552563e8fae5960de9efe235959b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int64</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int64E7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5FloatEf">
+<span id="_CPPv3N10lgraph_api9FieldData5FloatEf"></span><span id="_CPPv2N10lgraph_api9FieldData5FloatEf"></span><span id="lgraph_api::FieldData::Float__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a326651bedfdc7a8f5743e42b7264003b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Float</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5FloatEf" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6DoubleEd">
+<span id="_CPPv3N10lgraph_api9FieldData6DoubleEd"></span><span id="_CPPv2N10lgraph_api9FieldData6DoubleEd"></span><span id="lgraph_api::FieldData::Double__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5304168443248acb485e7e600e150feb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Double</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6DoubleEd" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="lgraph_api::FieldData::Date__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a88a43a9fe1328b1c06a36f469c286b29"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="lgraph_api::FieldData::Date__lgraph_api::DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a217032b1e975d7f3e8c81d0b10ef2eaa"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="lgraph_api::FieldData::DateTime__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a07cfe75d33077c683aa297554049e1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="lgraph_api::FieldData::DateTime__lgraph_api::DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00245f8fabb288c073b2b8b6310c95ae"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a46cdb6bb8f5ed9047595d8a0559960f9"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0abb491f06b5016de61c1a37dc22cca1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc"></span><span id="lgraph_api::FieldData::String__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefd38e03044cc9574ec9f82f8d8646db"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="lgraph_api::FieldData::String__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0500c9ca63c2c826c5f957706676717a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa6b8639fdb113bf8fe4a6556a161386e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1aa9bc69d37ba46872d769a6678058f5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="lgraph_api::FieldData::Point__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aed6deea650cc82d203060e3db07d2d3b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aadeac21d00b14c4fe99ca7356b38c4c5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1134a797ff8e36b78b12ffa26d3fe7ea"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::LineString__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1af7a37b2d5b7065e5f077d5ed9c203c6a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a89db7b33c84d04f622917e6096f32677"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac595c7685df74f6f1e439c1f14b4fb5c"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="lgraph_api::FieldData::Polygon__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac2f0d143ec079d8c6e6d340d383f0ee1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0051c95b3f512cf741e877d7d84e4298"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac60a663a7f4b31bc4a2ff727d6632f00"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="lgraph_api::FieldData::Spatial__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a32852c0236f9dab9f44a4ad88026f3d1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6277538e024b6bce57fed9ff337fd973"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa40480bb254330540b587feb99e8cded"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="lgraph_api::FieldData::Blob__std::vector:uint8_t:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a07c0ced9778df1c5fed3a4663cc45abd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint8_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructs a Blob from vector of uint8_t, treated as byte array. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="lgraph_api::FieldData::BlobFromBase64__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa1ff897ed22d2524b5caaedb4aadb3dd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BlobFromBase64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">base64_encoded</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructs a BLOB from Base64 encoded string. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="lgraph_api::FieldData::IsBufType__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1abbb98d7d3792559fa61cca3554aeaba7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBufType</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if ‘t’ is BLOB or STRING. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="lgraph_api::FieldData::IsInteger__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae00a13411b0557d842ffb8ea5f89e413"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if ‘t’ is INT8, 16, 32, or 64. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="lgraph_api::FieldData::IsReal__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a884ee60f7e50a01ab3a12179298fb9cb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if ‘t’ is FLLOAT or DOUBLE. </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpecE">
+<span id="_CPPv3N10lgraph_api9FieldSpecE"></span><span id="_CPPv2N10lgraph_api9FieldSpecE"></span><span id="lgraph_api::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Specification for a field. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="lgraph_api::FieldSpec::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1abfe187a3e79a4445a5270bba3bfaf72c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssCR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a8428f3af5f513d918d94feb5c78fa7e0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>n</strong> – Field name </p></li>
+<li><p><strong>t</strong> – Field type </p></li>
+<li><p><strong>nu</strong> – True if field is optional </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssRR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ada0df81c60e30bca34ba912a11fcdd9f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec">
+<span id="_CPPv3NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="_CPPv2NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="lgraph_api::FieldSpec::eq-operator__FieldSpecCRC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ac1104e4f8ee3666f766a09745b03836d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpec8ToStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="lgraph_api::FieldSpec::ToStringC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpec8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the string representation of the <a class="reference internal" href="#structlgraph__api_1_1FieldSpec"><span class="std std-ref">FieldSpec</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4nameE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4nameE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4nameE"></span><span id="lgraph_api::FieldSpec::name__ss"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4nameE" title="Permalink to this definition"></a><br></dt>
+<dd><p>name of the field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4typeE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4typeE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4typeE"></span><span id="lgraph_api::FieldSpec::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4typeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>type of that field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec8optionalE">
+<span id="_CPPv3N10lgraph_api9FieldSpec8optionalE"></span><span id="_CPPv2N10lgraph_api9FieldSpec8optionalE"></span><span id="lgraph_api::FieldSpec::optional__b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a1b3b38329495fc55fd443dfa2246337b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">optional</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec8optionalE" title="Permalink to this definition"></a><br></dt>
+<dd><p>is this field optional? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpecE">
+<span id="_CPPv3N10lgraph_api9IndexSpecE"></span><span id="_CPPv2N10lgraph_api9IndexSpecE"></span><span id="lgraph_api::IndexSpec"></span><span class="target" id="structlgraph__api_1_1IndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>An index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5labelE"></span><span id="lgraph_api::IndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5labelE" title="Permalink to this definition"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5fieldE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5fieldE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5fieldE"></span><span id="lgraph_api::IndexSpec::field__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a97bab0e4c0ea8b12272a606c825360e7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5fieldE" title="Permalink to this definition"></a><br></dt>
+<dd><p>field name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api9IndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api9IndexSpec4typeE"></span><span id="lgraph_api::IndexSpec::type__IndexType"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1ac8263343d7a58ec888a110427f522b64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec4typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsE">
+<span id="_CPPv3N10lgraph_api12LabelOptionsE"></span><span id="_CPPv2N10lgraph_api12LabelOptionsE"></span><span id="lgraph_api::LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelOptions</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Label options, base class, define some common fields and methods. </p>
+<p>Subclassed by <a class="reference internal" href="#structlgraph__api_1_1EdgeOptions"><span class="std std-ref">EdgeOptions</span></a>, <a class="reference internal" href="#structlgraph__api_1_1VertexOptions"><span class="std std-ref">VertexOptions</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api12LabelOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="lgraph_api::LabelOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a630c29d66f94446c4292172285d61492"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api12LabelOptions9to_stringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions5clearEv">
+<span id="_CPPv3N10lgraph_api12LabelOptions5clearEv"></span><span id="_CPPv2N10lgraph_api12LabelOptions5clearEv"></span><span id="lgraph_api::LabelOptions::clear"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a5eeb94d22b8366d1b68d0614384802fe"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions5clearEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsD0Ev">
+<span id="_CPPv3N10lgraph_api12LabelOptionsD0Ev"></span><span id="_CPPv2N10lgraph_api12LabelOptionsD0Ev"></span><span id="lgraph_api::LabelOptions::~LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a0c56bbf380b6ce74a532637b65f7e7a4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~LabelOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions15detach_propertyE">
+<span id="_CPPv3N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="_CPPv2N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="lgraph_api::LabelOptions::detach_property__b"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a6057cc32d98316ec805c453db60c48ef"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">detach_property</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions15detach_propertyE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ParameterE">
+<span id="_CPPv3N10lgraph_api9ParameterE"></span><span id="_CPPv2N10lgraph_api9ParameterE"></span><span id="lgraph_api::Parameter"></span><span class="target" id="structlgraph__api_1_1Parameter"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parameter</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ParameterE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>The parameter of procedure/plugin. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4nameE">
+<span id="_CPPv3N10lgraph_api9Parameter4nameE"></span><span id="_CPPv2N10lgraph_api9Parameter4nameE"></span><span id="lgraph_api::Parameter::name__ss"></span><span class="target" id="structlgraph__api_1_1Parameter_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4nameE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter5indexE">
+<span id="_CPPv3N10lgraph_api9Parameter5indexE"></span><span id="_CPPv2N10lgraph_api9Parameter5indexE"></span><span id="lgraph_api::Parameter::index__i"></span><span class="target" id="structlgraph__api_1_1Parameter_1a750b5d744c39a06bfb13e6eb010e35d0"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">index</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter5indexE" title="Permalink to this definition"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>name of the parameter </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4typeE">
+<span id="_CPPv3N10lgraph_api9Parameter4typeE"></span><span id="_CPPv2N10lgraph_api9Parameter4typeE"></span><span id="lgraph_api::Parameter::type__LGraphType"></span><span class="target" id="structlgraph__api_1_1Parameter_1ac8ec89e84ffc9d1ffe1b030f61a76e44"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4typeE" title="Permalink to this definition"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>index of the parameter list in which the parameter stay </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfoE">
+<span id="_CPPv3N10lgraph_api8RoleInfoE"></span><span id="_CPPv2N10lgraph_api8RoleInfoE"></span><span id="lgraph_api::RoleInfo"></span><span class="target" id="structlgraph__api_1_1RoleInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RoleInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfoE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the role. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo4descE">
+<span id="_CPPv3N10lgraph_api8RoleInfo4descE"></span><span id="_CPPv2N10lgraph_api8RoleInfo4descE"></span><span id="lgraph_api::RoleInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo4descE" title="Permalink to this definition"></a><br></dt>
+<dd><p>description </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo12graph_accessE">
+<span id="_CPPv3N10lgraph_api8RoleInfo12graph_accessE"></span><span id="_CPPv2N10lgraph_api8RoleInfo12graph_accessE"></span><span id="lgraph_api::RoleInfo::graph_access__std::map:ss.AccessLevel:"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1ac689f8bad73d3d9b3c2a1c11f1296905"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph_access</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo12graph_accessE" title="Permalink to this definition"></a><br></dt>
+<dd><p>access levels on different graphs </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8RoleInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8RoleInfo8disabledE"></span><span id="lgraph_api::RoleInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo8disabledE" title="Permalink to this definition"></a><br></dt>
+<dd><p>is this role disabled? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpecE">
+<span id="_CPPv3N10lgraph_api7SigSpecE"></span><span id="_CPPv2N10lgraph_api7SigSpecE"></span><span id="lgraph_api::SigSpec"></span><span class="target" id="structlgraph__api_1_1SigSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SigSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec10input_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec10input_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec10input_listE"></span><span id="lgraph_api::SigSpec::input_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a4f4b1c5201f32fae15b91c8a51021f63"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">input_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec10input_listE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec11result_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec11result_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec11result_listE"></span><span id="lgraph_api::SigSpec::result_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a23e292d0e3f983f3ceba15f9f6249209"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec11result_listE" title="Permalink to this definition"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>input parameter list </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfoE">
+<span id="_CPPv3N10lgraph_api8UserInfoE"></span><span id="_CPPv2N10lgraph_api8UserInfoE"></span><span id="lgraph_api::UserInfo"></span><span class="target" id="structlgraph__api_1_1UserInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UserInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfoE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the user. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo4descE">
+<span id="_CPPv3N10lgraph_api8UserInfo4descE"></span><span id="_CPPv2N10lgraph_api8UserInfo4descE"></span><span id="lgraph_api::UserInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo4descE" title="Permalink to this definition"></a><br></dt>
+<dd><p>description of the user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo5rolesE">
+<span id="_CPPv3N10lgraph_api8UserInfo5rolesE"></span><span id="_CPPv2N10lgraph_api8UserInfo5rolesE"></span><span id="lgraph_api::UserInfo::roles__std::set:ss:"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1f4c5a9d9b2a7c1022128d3201f03648"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">roles</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo5rolesE" title="Permalink to this definition"></a><br></dt>
+<dd><p>roles of this user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8UserInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8UserInfo8disabledE"></span><span id="lgraph_api::UserInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo8disabledE" title="Permalink to this definition"></a><br></dt>
+<dd><p>is this user disabled? </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo12memory_limitE">
+<span id="_CPPv3N10lgraph_api8UserInfo12memory_limitE"></span><span id="_CPPv2N10lgraph_api8UserInfo12memory_limitE"></span><span id="lgraph_api::UserInfo::memory_limit__s"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1943ac86ca89eaf251c01c16772dfc00"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">memory_limit</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo12memory_limitE" title="Permalink to this definition"></a><br></dt>
+<dd><p>memory limit for this user </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptionsE">
+<span id="_CPPv3N10lgraph_api13VertexOptionsE"></span><span id="_CPPv2N10lgraph_api13VertexOptionsE"></span><span id="lgraph_api::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Vertex label options, contain fields only vertex have. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="lgraph_api::VertexOptions::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1afd0ea869dba2b64723f3643ef5f6d2df"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="lgraph_api::VertexOptions::VertexOptions__ssCR"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac769e8bf000b16416a763894714829c7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">primary_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api13VertexOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="lgraph_api::VertexOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api13VertexOptions9to_stringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions5clearEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions5clearEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions5clearEv"></span><span id="lgraph_api::VertexOptions::clear"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions5clearEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13primary_fieldE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="lgraph_api::VertexOptions::primary_field__ss"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1a72852ec13f99950d76332fad99c71dd0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">primary_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13primary_fieldE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-utils">
+<h2>lgraph_utils<a class="headerlink" href="#lgraph-utils" title="Permalink to this headline"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv44json">
+<span id="_CPPv34json"></span><span id="_CPPv24json"></span><span class="target" id="lgraph__utils_8h_1ab701e3ac61a85b337ec5c1abaad6742d"></span><span class="k"><span class="pre">using</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">json</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><a class="headerlink" href="#_CPPv44json" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8get_timeEv">
+<span id="_CPPv3N10lgraph_api8get_timeEv"></span><span id="_CPPv2N10lgraph_api8get_timeEv"></span><span id="lgraph_api::get_time"></span><span class="target" id="namespacelgraph__api_1ab3691fc022301a72d8cb766dc0c17fdf"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">get_time</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8get_timeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Digit value of current time. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE">
+<span id="_CPPv3N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="_CPPv2N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="lgraph_api::split_string__ss.std::vector:ss:R.ss"></span><span class="target" id="namespacelgraph__api_1ae25400b1a7ff2282865cd3cc2353a536"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">split_string</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">origin_string</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sub_strings</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">string_delimiter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Split the original string by format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>origin_string</strong> – original string to be split. </p></li>
+<li><p><strong>sub_strings</strong> – split substring. </p></li>
+<li><p><strong>string_delimiter</strong> – Split format. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE">
+<span id="_CPPv3N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="_CPPv2N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="lgraph_api::rc4__ssR.ss.ss"></span><span class="target" id="namespacelgraph__api_1a985e409c942e1068d32b795a27024122"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">rc4</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">key</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mode</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encrypt the input string in ac4 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>input</strong> – input string. </p></li>
+<li><p><strong>key</strong> – encryption key. </p></li>
+<li><p><strong>mode</strong> – encryption mode </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13encode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="lgraph_api::encode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a2e5f53c59cee61047cb4e283fb6c1950"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">encode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13encode_base64EKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encode the input string in encode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13decode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="lgraph_api::decode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a047800adaceb796bbb0eb71c016e4fa3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">decode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13decode_base64EKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Decode the input string in decode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Decrypted string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12alloc_bufferE6size_t">
+<span id="_CPPv3N10lgraph_api12alloc_bufferE6size_t"></span><span id="_CPPv2N10lgraph_api12alloc_bufferE6size_t"></span><span id="lgraph_api::alloc_buffer__s"></span><span class="target" id="namespacelgraph__api_1a3274ccf2c4d0f0990a6edbdee20109c4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">alloc_buffer</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12alloc_bufferE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Allocate memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>bytes</strong> – Size in byte of request memory. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Pointer of allocated memory. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t">
+<span id="_CPPv3N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="_CPPv2N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="lgraph_api::dealloc_buffer__voidP.s"></span><span class="target" id="namespacelgraph__api_1ad6721e43c2327ad8e4c6e19c0996a770"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dealloc_buffer</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buffer</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Free memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>buffer</strong> – Size in bytes of request memory </p></li>
+<li><p><strong>bytes</strong> – Pointer of memory to free. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ae22fdc516fa3fd1ee7f8ad22d877bc64"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a54668379bc6d79cb28f24c532d6ceb28"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse vector parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="lgraph_api::GetVidFromNodeString__ssCR"></span><span class="target" id="namespacelgraph__api_1aa24b1e990b795a8d59c369760c930c7f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVidFromNodeString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">node_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse vid from the node passed in by cypher. For V2 procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>node_string</strong> – <strong>[in]</strong> node </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>vid </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-index-iterator">
+<h2>lgraph_vertex_index_iterator<a class="headerlink" href="#lgraph-vertex-index-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorE"></span><span id="lgraph_api::VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> can be used to access a set of vertices that has the same indexed value. If the index is unique (that is, each vertex has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> will only have one VertexId, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> is valid iff it points to a valid (index_value, vid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a73eb49fc5a21c2eab2d862fb07231061"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1adf8da63a296279030584c1d539dfc7e0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="lgraph_api::VertexIndexIterator::~VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a4a5611b7ffb02851074518d929862608"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="lgraph_api::VertexIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="lgraph_api::VertexIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="lgraph_api::VertexIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next vertex id in the list, which consists of all the valid vertex ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::VertexIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the current index value. The vids are sorted in (IndexValue, Vid) order. When <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one vid to next, possibly moving from one IndexValue to another. This function tells the IndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="lgraph_api::VertexIndexIterator::GetVidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a89f7ed3f184862498c0df7d87b97a1b4"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the current vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The current vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__lgraph::VertexIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a8adfcdcf8d9abeee72c3da1b9f21edaa"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae8421018f7913edfc4d82d2c0f209085"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1abe6ca171051639d874dbfb573a9d4cb3"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator3it_E"></span><span id="lgraph_api::VertexIndexIterator::it___std::unique_ptr:lgraph::VertexIndexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae02cf2beed475be9b6af2ddacf99f077"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="lgraph_api::VertexIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-iterator">
+<h2>lgraph_vertex_iterator<a class="headerlink" href="#lgraph-vertex-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> can be used to iterate through vertices in the DB. Vertices are sorted according to vertex id in the DB. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> is valid iff it points to a valid vertex. Calling method functions on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> for non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> with the id of a non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"><span class="std std-ref">Delete()</span></a> on the last vertex. </p></li>
+</ol>
+<p></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7888300a9ddafc0d6814c54b7d2f1f11"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac4f5daf4ebb180eb1a0c9d1ba024bf38"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14VertexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14VertexIteratorD0Ev"></span><span id="lgraph_api::VertexIterator::~VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ab031829b35061e00c09bf2f5c951063f"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator5CloseEv"></span><span id="lgraph_api::VertexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator4NextEv"></span><span id="lgraph_api::VertexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, otherwise return false (no more vertex) and invalidate the iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb">
+<span id="_CPPv3N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="_CPPv2N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="lgraph_api::VertexIterator::Goto__int64_t.b"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Goto the vertex with id src. If there is no vertex with exactly the same vid, and nearest==true, go to the next vertex with id&gt;=vid, otherwise return false and invalidate the iterator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vid</strong> – Vertex id of the vertex to go. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to go to the closest vertex with id&gt;=vid.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false (no such vertex). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator5GetIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="lgraph_api::VertexIterator::GetIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a9fedaf26513596c151c16f829b47038e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator5GetIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a594a8927f27893b46f4f8ce547b5e558"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the first out-going edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1abb6aadfa764244d29f6458a40f5c4f17"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge, and nearest==false an invalid iterator is returned. If the specified out-edge does not exist, and nearest==true, get the first out-edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetInEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the first in-coming edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetInEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a1013d34130e78bd8715e7b7a0759b578"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge and nearest==false, an invalid iterator is returned. If the specified edge does not exist and nearest==true,. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="lgraph_api::VertexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="lgraph_api::VertexIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the label of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="lgraph_api::VertexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="lgraph_api::VertexIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="lgraph_api::VertexIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="lgraph_api::VertexIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>all fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListSrcVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a910d02e24a65995a2784e2028d6244ac"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListSrcVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>List source vids. Each source vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>List of source vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListDstVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1add92b73ced9e72b3b87fa80f486c27a9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListDstVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>List destination vids. Each vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit of number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>List of desitnation vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumInEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1acba67b0fdb21bf78555353cf53fb4f6f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of incoming edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of in-coming edges to count. When the limit is reached, n_limit is returned. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of incoming edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumOutEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a273dc0f4b8ddf828a89ae68748ed0c74"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of out-going edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of out-going edges to count. When the limit is reached, n_limit is returned and limit_exceeded is set to true. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of out-going edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t">
+<span id="_CPPv3N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="_CPPv2N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="lgraph_api::VertexIterator::Delete__sP.sP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_in_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_out_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes this vertex, also deletes all incoming and outgoing edges of this vertex. The iterator will point to the next vertex by vid if there is any. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_in_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of in edges the vertex had. </p></li>
+<li><p><strong>n_out_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of out edges the vertex had. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="lgraph_api::VertexIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the string representation of this vertex. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIterator::VertexIterator__lgraph::graph::VertexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a77858ba7e00cd9e8676e4b168d95f931"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a4b166320bbbeadd713f612c540094bf9"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a25e24a42419e107fee77196a8a9fc488"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator3it_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator3it_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator3it_E"></span><span id="lgraph_api::VertexIterator::it___std::unique_ptr:lgraph::graph::VertexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a26ee2d6416d9ad738ce344fb2b1a2972"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator4txn_E"></span><span id="lgraph_api::VertexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-base">
+<h2>olap_base<a class="headerlink" href="#olap-base" title="Permalink to this headline"></a></h2>
+<p>This is an implementation of the TuGraph graph analytics engine. The graph analytics engine is a general-purpose processing engine useful for implementing various graph analytics algorithms such as PageRank, ShortestPath, etc.. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_WORKING">
+<span class="target" id="olap__base_8h_1af8106a969b5fe14011400dcc5de93889"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_WORKING</span></span></span><a class="headerlink" href="#c.THREAD_WORKING" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_STEALING">
+<span class="target" id="olap__base_8h_1a3537fbf36165f2b4f963e4dd7462ec22"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_STEALING</span></span></span><a class="headerlink" href="#c.THREAD_STEALING" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.VERTEX_BATCH_SIZE">
+<span class="target" id="olap__base_8h_1a7655fa441302a14fb0f2f7f74ebe9e64"></span><span class="sig-name descname"><span class="n"><span class="pre">VERTEX_BATCH_SIZE</span></span></span><a class="headerlink" href="#c.VERTEX_BATCH_SIZE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.WORD_OFFSET">
+<span class="target" id="olap__base_8h_1aaa604dee271e714e574fa9a36fd57682"></span><span class="sig-name descname"><span class="n"><span class="pre">WORD_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.WORD_OFFSET" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.BIT_OFFSET">
+<span class="target" id="olap__base_8h_1a5a49e33dd4567ba395e94a35716669b6"></span><span class="sig-name descname"><span class="n"><span class="pre">BIT_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.BIT_OFFSET" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="olap__base_8h_1a539fe76ede7635af5ee150bd33d03317"></span><span class="sig-name descname"><span class="pre">union</span> <span class="pre">@5</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49neighbour">
+<span id="_CPPv39neighbour"></span><span id="_CPPv29neighbour"></span><span id="neighbour__s"></span><span class="target" id="olap__base_8h_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv49neighbour" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49edge_data">
+<span id="_CPPv39edge_data"></span><span id="_CPPv29edge_data"></span><span id="edge_data__EdgeData"></span><span class="target" id="olap__base_8h_1a24f41c52f29d0ba9636668d50ed99a63"></span><span class="n"><span class="pre">EdgeData</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv49edge_data" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43src">
+<span id="_CPPv33src"></span><span id="_CPPv23src"></span><span id="src__s"></span><span class="target" id="olap__base_8h_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv43src" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43dst">
+<span id="_CPPv33dst"></span><span id="_CPPv23dst"></span><span id="dst__s"></span><span class="target" id="olap__base_8h_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv43dst" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olapE">
+<span id="_CPPv3N10lgraph_api4olapE"></span><span id="_CPPv2N10lgraph_api4olapE"></span><span id="lgraph_api::olap"></span><span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olapE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aae"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Define the edge direction policy of graph The policy determines the graph symmetric and undirected feature. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaea17946ea357e5e0a46f7354049d684ba1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DUAL_DIRECTION</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The graph is asymmetric. The edges from input files are outgoing edges. The reversed edges form incoming edges. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeafdc4fc0261af8c2b6f66ab00eed5fe55"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAKE_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The graph is symmetric but the input files are asymmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeaa1b7f74c74bb030bf8360c598fdfc08f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INPUT_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Both the graph and the input files are symmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a944bcbf0349029631b4fbda1660df186"></span><span class="sig-name descname"><span class="pre">template&lt;typename</span> <span class="pre">EdgeData&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a6eded0577caa238e1cf59a742cbc7eeb"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum">
+<span id="_CPPv3I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span id="_CPPv2I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aaa30a5461bdf30947283236f847714e7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reduce_plus</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="Permalink to this definition"></a><br></dt>
+<dd><p>The default reduce function which uses the plus operator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a5bcc917c95bec960faafcf5506201325"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1ac8203a028b53e5841a52737f4a4f3bcd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1abf9e945446fe724862c9960198e7174f"></span><span class="sig-name descname"><span class="pre">struct</span> <span class="pre">lgraph_api::olap::EdgeStringUnit</span> <span class="pre">__attribute__</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="lgraph_api::olap::MAX_NUM_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a8b2861b30aec5ae10d4519bf3a8ce0f2"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_NUM_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The maximum number of edges. Change this value if needed. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjListE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjListE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjListE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1AdjList"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="lgraph_api::olap::AdjList::AdjList"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a8b7b96acd6306a4b7c5b74df226e6f7e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList5beginEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList5beginEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList5beginEv"></span><span id="lgraph_api::olap::AdjList::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a1b44a588619cf9b27a4cf547d290bcf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList5beginEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList3endEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList3endEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList3endEv"></span><span id="lgraph_api::olap::AdjList::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1af77a3b6fb415f06e5b56bfc9be448a70"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList3endEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjListixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap7AdjListixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap7AdjListixE6size_t"></span><span id="lgraph_api::olap::AdjList::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a62df7b80147908931b2be1c979639f43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjListixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="lgraph_api::olap::AdjList::AdjList__AdjUnit:EdgeData:P.AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a50f0d642dca2d5631b139d235bd790f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">begin</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList6begin_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList6begin_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList6begin_E"></span><span id="lgraph_api::olap::AdjList::begin___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1aaf99bb4a670e8aa9cae1d700f1e57c5c"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList6begin_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList4end_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList4end_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList4end_E"></span><span id="lgraph_api::olap::AdjList::end___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a90c044b28a9a95203b0a0c289772e178"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList4end_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">OlapBase&lt;</span> <span class="pre">EdgeData</span> <span class="pre">&gt;</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjUnit&lt;EdgeData&gt; represents an adjacent edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="lgraph_api::olap::AdjUnit::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1aacfa29d2dd368a125e50f21c115ec46f"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@4</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeStringUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeStringUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type, The vertex is of string type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="lgraph_api::olap::EdgeStringUnit::src__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1aac2e7b82f607b746d5b33c401a555ad4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="lgraph_api::olap::EdgeStringUnit::dst__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1a030e02dd512080f9859d50b7c2f10db0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeStringUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="lgraph_api::olap::EdgeStringUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8EdgeUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap8EdgeUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap8EdgeUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="lgraph_api::olap::EdgeUnit::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3srcE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="lgraph_api::olap::EdgeUnit::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3dstE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a4a58050a4c0f1da86ec007813a4ec308"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::EdgeUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@6</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap5EmptyE">
+<span id="_CPPv3N10lgraph_api4olap5EmptyE"></span><span id="_CPPv2N10lgraph_api4olap5EmptyE"></span><span id="lgraph_api::olap::Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1Empty"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Empty</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> is used for representing unweighted graphs. </p>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBaseE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBaseE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBaseE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjList&lt;EdgeData&gt; allows range-based for-loop over AdjUnit&lt;EdgeData&gt;. </p>
+<p>Graph.</p>
+<p>
+EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>EdgeData</strong> – Type of the edge data.</p></li>
+<li><p><strong>EdgeData</strong> – Graph instances represent static (sub)graphs loaded from txt file. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses.</p></li>
+<li><p><strong>EdgeData</strong> – Type of the edge data. </p></li>
+</ul>
+</dd>
+</dl>
+<p>Subclassed by <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB&lt; EdgeData &gt;</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="lgraph_api::olap::OlapBase::OlapBase"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8b1cb218d9ddbe502eda5a2f0d674d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor of Graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapBase::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af1aedb46d1972859e79efafbe6c33ec2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a6c48401f52e77a7286b04c528b98dc5e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the out-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The out-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::InDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aaa9b9b0056536f6d533c1dfed9fc0ef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the in-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The in-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ada8118bd934579318a4ed38d0233b70d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the outgoing edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The outgoing edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::InEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a19e62567748b5c1a224457b9756d4002"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the incoming edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The incoming edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="lgraph_api::olap::OlapBase::Transpose"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a109318636af36bc89e9853f19e4369e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transpose</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Transpose the graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="lgraph_api::olap::OlapBase::NumVertices"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a07d9840894a10d114719bcf339a5a20d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get number of vertices of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of vertices of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="lgraph_api::olap::OlapBase::NumEdges"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af16ce4014b334a365ccac510c4e4045d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumEdges</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get number of edges of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of edges of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a010ffba60888eacee4ed8153d69e22d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="lgraph_api::olap::OlapBase::AllocVertexArray::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexArray</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Allocate a vertex array with type VertexData. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>VertexData</strong> – Type of the vertex data.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> with type VertexData. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="lgraph_api::olap::OlapBase::AllocVertexSubset"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a950a6ba41cf3e3885d043c15616f583d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexSubset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Allocate a vertex subset represented with <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> sized |V| of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::AcquireVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac15d778dde37cd4ec7f0471d170fe35a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AcquireVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Lock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::ReleaseVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a3d005cde32497e212181e88217938f25"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReleaseVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Unlock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::GuardVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea1c361387ef31606753020550642cf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="lgraph_api::olap::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GuardVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock/unlock.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> corresponding to the specified vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="lgraph_api::olap::OlapBase::IfSparse__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8096171f84ad9c7c78c9ea965c475a8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IfSparse</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd><p>Judging whether it is sparse mode or dense mode according to the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>active_vertices</strong> – The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> of active_vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="lgraph_api::olap::OlapBase::set_num_vertices__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab0c9ca5cca45f72dcbb4ebe427e64b4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">set_num_vertices</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Assign vertices to the first loaded graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vertices</strong> – The vertex id (in the Graph) to lock/unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="lgraph_api::olap::OlapBase::LoadFromArray__cP.s.s.EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a16c3082aa7057bdc8e80f6491e6d8e88"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadFromArray</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">edge_array</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_vertices</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_edges</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">edge_direction_policy</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load graph data from edge_array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>edge_array</strong> – <strong>[in]</strong> The data in this array is read into the graph. </p></li>
+<li><p><strong>input_vertices</strong> – The number of vertices in the input graph data. </p></li>
+<li><p><strong>input_edges</strong> – The number of edges in the input graph data. </p></li>
+<li><p><strong>edge_direction_policy</strong> – Graph data loading method. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a23cdd3850d0641f99a761cd30318ddae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a parallel-for loop in the range [lower, upper). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Template Parameters</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing the work. </p></li>
+<li><p><strong>lower</strong> – The lower bound of the range (inclusive). </p></li>
+<li><p><strong>upper</strong> – The upper bound of the range (exclusive). </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adbf76a87d17dfdeb4554fc058772f351"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a2115dc228e9cde0ea88fad83d9527ebe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Process a set of active vertices in parallel. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Template Parameters</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing each vertex’s work. </p></li>
+<li><p><strong>active_vertices</strong> – <strong>[inout]</strong> The active vertex set. </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac8cdec9111784ddeb528c899d99ea5bd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-functions">Protected Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="lgraph_api::olap::OlapBase::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ad0df12e23dc13705b7160effdecdca73"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-attributes">Protected Attributes</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="lgraph_api::olap::OlapBase::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="lgraph_api::olap::OlapBase::num_edges___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac4dfd32613a83596fa43818fd979a6e2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_data_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a703092681fc7abbc984632b1644216cd"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::adj_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aec12c1eea29776d600cedb7c8de70b71"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">adj_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea4bca314eba173531bc9f04e35888e7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="lgraph_api::olap::OlapBase::edge_direction_policy___EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a59e5aefcf4de1752fda0c644c4bf920a"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_direction_policy_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="lgraph_api::olap::OlapBase::edge_list___EdgeUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aa463cdb96cdb7fa5bc259c8facc9aed9"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit"><span class="n"><span class="pre">EdgeUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">edge_list_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="lgraph_api::olap::OlapBase::out_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adb8e1bf54dfd199e838ec45066f8f758"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="lgraph_api::olap::OlapBase::in_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a55bb224127fd22ab38d9ea251d83895a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="lgraph_api::olap::OlapBase::out_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af6c2b6632374310efa986cf7aa54fd55"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_index_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="lgraph_api::olap::OlapBase::in_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a8f5032936723f9e23aec62f377b2a3ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_index_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="lgraph_api::olap::OlapBase::out_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a890254f0669f50d5d51c0b7f3c6b94ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="lgraph_api::olap::OlapBase::in_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a35d8cc39082a3468d82e0bf4412aee62"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="lgraph_api::olap::OlapBase::lock_array___ParallelVector:b:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aee90f899c9abd99447bfa22781c5634d"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lock_array_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetE"></span><span id="lgraph_api::olap::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> implements the concurrent bitset data structure, which is usually used to represent active vertex sets. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af71b86fef4aceb1ea4e0c39a4ee73369"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>size</strong> – The size of the bitset (i.e. the number of bits). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7242b92edfd78d370c06883f93674ebe"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::assign-operator__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ab16e3e695d258f2ce3d1ad5eef412a12"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ae83afc3b8694c5e279c03836a293ca1c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a1f67570cf9608fb5b62de10c44519e6e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="lgraph_api::olap::ParallelBitset::~ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7779a66d09a414c3ef215609e2dc9da8"></span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="lgraph_api::olap::ParallelBitset::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Clear the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="lgraph_api::olap::ParallelBitset::Fill"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af5105c0eef86140ad8203af2bf159d57"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Fill the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Has__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ade408d5cd908ff319ee49500dbb898da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Has</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Test a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to test.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Whether the bit is set or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Add__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a9d6d2b50895f5add363b7a1a30b0b804"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to set.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Whether the operation is a true addition or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::Swap__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad079bdc6ea46251fa256de71ac77c8db"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd><p>Swap the current bitset with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other bitset to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="lgraph_api::olap::ParallelBitset::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5503ab878f0444a70c87fcce727a4b3c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="lgraph_api::olap::ParallelBitset::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="lgraph_api::olap::ParallelBitset::data___uint64_tP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad26e57b8e7bb88f06c363fab8e7009a2"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5data_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="lgraph_api::olap::ParallelBitset::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14ParallelVectorE">
+<span id="_CPPv3I0EN10lgraph_api4olap14ParallelVectorE"></span><span id="_CPPv2I0EN10lgraph_api4olap14ParallelVectorE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>ParallelVector&lt;T&gt; aims to mimic std::vector&lt;T&gt;. Note that the deletions other than clearing are not supported. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aef646925bb31e3dcc02a67e584e6d2d4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>capacity</strong> – The capacity of the vector. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab1334ee433460a07146e277f7e4c30d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>capacity</strong> – The capacity of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__TP.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a140f4d7cdcdfec667cf096f6d855b155"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt; </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>data</strong> – The initial data of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. And the initial capacity equals initial size. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a3aae6881aa98ab806d5eabd668491187"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1af4d6dc6eecb55e2ddf126fef29b17c79"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::assign-operator__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a70489ba54b4027e4e589c93a6a474666"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ae3fed3af74f330a9856fe2cd42482f44"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Default constructor of ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="lgraph_api::olap::ParallelVector::Destroy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ac919a991060ede6983343719401686de"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Destroy ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="lgraph_api::olap::ParallelVector::~ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2a254fcaade5cc8050f3c5eca1893619"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="lgraph_api::olap::ParallelVector::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5d56cb4cffc7089978d354304eb5a7a6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5beginEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="lgraph_api::olap::ParallelVector::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a23e2fdb99370f37cb764cac10378c721"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5beginEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector3endEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector3endEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector3endEv"></span><span id="lgraph_api::olap::ParallelVector::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5994ad65dce0457b21adb6a10c8642dc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector3endEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4BackEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="lgraph_api::olap::ParallelVector::Back"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9fadc3b5d96a350533f1221345259aab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Back</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4BackEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="lgraph_api::olap::ParallelVector::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab2c9a1b384ad445ddc5da54c669e3136"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4DataEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="lgraph_api::olap::ParallelVector::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="lgraph_api::olap::ParallelVector::Capacity"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2ee0a564b6468179fd94541c4bbf85d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Capacity</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="lgraph_api::olap::ParallelVector::Destroyed"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a907f5acbcd44ca4faa2f02fde7bd2df1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroyed</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="lgraph_api::olap::ParallelVector::Resize__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ad9cf0e91780366986c2f047bd796cdd5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>size</strong> – Value of new size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="lgraph_api::olap::ParallelVector::Resize__s.TCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a4a62b4cde89680b486c2560241cd594a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T" title="Permalink to this definition"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size and initialize the new element with elem. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>size</strong> – Value of new size. </p></li>
+<li><p><strong>elem</strong> – Initial value of new-added element. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="lgraph_api::olap::ParallelVector::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Clear all data and change size to 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ReAlloc__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a1a61eab0948012f137795032a19d4664"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReAlloc</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Destroy elder data and allocate with new capacity. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>capacity</strong> – New capacity value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="lgraph_api::olap::ParallelVector::Fill__T"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a016e89b3314c7d5d0b82b762bad05a28"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T" title="Permalink to this definition"></a><br></dt>
+<dd><p>Assign the vector’s elements with a common value. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>elem</strong> – The common value. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>     <span class="n">This</span> <span class="n">action</span> <span class="ow">is</span> <span class="n">performed</span> <span class="ow">in</span> <span class="n">parallel</span><span class="p">,</span> <span class="n">so</span> <span class="n">you</span> <span class="n">should</span> <span class="ow">not</span> <span class="n">call</span>
+     <span class="n">it</span> <span class="n">inside</span> <span class="n">another</span> <span class="n">parallel</span> <span class="n">region</span> <span class="p">(</span><span class="n">via</span> <span class="n">Worker</span><span class="p">::</span><span class="n">Delegate</span><span class="p">)</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TCR.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a43b8a4f1da7a245932babf7b42aa69db"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append an element to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>elem</strong> – The element. </p></li>
+<li><p><strong>atomic</strong> – (Optional) Whether atomic instructions should be used or not. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TP.s.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a26d7da32681aab4177e5404de5216525"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">count</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append an array of elements to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>buf</strong> – <strong>[inout]</strong> The array pointer. </p></li>
+<li><p><strong>count</strong> – The array length. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="lgraph_api::olap::ParallelVector::Append__ParallelVector:T:R.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9c6d119f42bbb02b422f2abdf5a39a26"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append another vector of elements to this. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>other</strong> – <strong>[inout]</strong> The other vector. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::Swap__ParallelVector:T:R"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1acd7f1912f9dbf8e003bd6e72e4e9efd2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Swap the current vector with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other vector to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="lgraph_api::olap::ParallelVector::Copy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a6ea526f22af350302e37123f3c37e4ff"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Copy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy the current vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A new vector with the same copied content. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="lgraph_api::olap::ParallelVector::destroyed___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a62dfd137075e11ff18b5516f41bd50c2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">destroyed_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="lgraph_api::olap::ParallelVector::capacity___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa3099a4c2b0b3ab5ba4188b4a8f59b26"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">capacity_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5data_E"></span><span id="lgraph_api::olap::ParallelVector::data___TP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa5a936fbbc363fa1913fdaadc70d872a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5data_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5size_E"></span><span id="lgraph_api::olap::ParallelVector::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadStateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadStateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadStateE"></span><span id="lgraph_api::olap::ThreadState"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ThreadState</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadStateE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState4currE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState4currE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState4currE"></span><span id="lgraph_api::olap::ThreadState::curr__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a8eea8ae4d204a609211b5cdf1e0aa19a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState4currE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState3endE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState3endE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState3endE"></span><span id="lgraph_api::olap::ThreadState::end__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1aca05b1afbbe1c83cf087b49df03c441a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState3endE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState5stateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState5stateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState5stateE"></span><span id="lgraph_api::olap::ThreadState::state__i"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a89f234133d3efe315836311cbf21c64b"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">state</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState5stateE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardE">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardE"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardE"></span><span id="lgraph_api::olap::VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> automatically acquires the lock on construction and releases the lock on destruction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__bVP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aca9940bbc3948c4b105cf4edf770aeac"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">volatile</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">lock</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1a89a098e56f889f8015db67136b3c8ee3"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aeb1d045c401b22855341e0084681ec13"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="lgraph_api::olap::VertexLockGuard::~VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aa7fb9013a4d1c11f4bf8c73c079d8e55"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="lgraph_api::olap::VertexLockGuard::lock___bP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1ac56529c72897ed7db313a69efe299cb3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">lock_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerE">
+<span id="_CPPv3N10lgraph_api4olap6WorkerE"></span><span id="_CPPv2N10lgraph_api4olap6WorkerE"></span><span id="lgraph_api::olap::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>All the parallel tasks should be delegated through <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> to prevent a huge number of threads being populated via OpenMP. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6WorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker6WorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker6WorkerEv"></span><span id="lgraph_api::olap::Worker::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1ac243ac161c3b8a4e9b7d8ab6cccceed7"></span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6WorkerEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerD0Ev">
+<span id="_CPPv3N10lgraph_api4olap6WorkerD0Ev"></span><span id="_CPPv2N10lgraph_api4olap6WorkerD0Ev"></span><span id="lgraph_api::olap::Worker::~Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a6c90b9d499e906079194f681b6cb90ca"></span><span class="sig-name descname"><span class="n"><span class="pre">~Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE">
+<span id="_CPPv3N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span id="_CPPv2N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a78582857fb711225979abb2702d89bad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delegate</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Send some work to the <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>work</strong> – The function describing the work. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>             <span class="n">Exceptions</span> <span class="n">can</span> <span class="n">be</span> <span class="n">thrown</span> <span class="ow">in</span> <span class="n">the</span> <span class="n">work</span> <span class="n">function</span> <span class="k">if</span> <span class="n">necessary</span><span class="o">.</span>
+             <span class="n">Note</span> <span class="n">that</span> <span class="n">Delegate</span> <span class="n">cannot</span> <span class="n">be</span> <span class="n">nested</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute">
+<span id="_CPPv3I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span id="_CPPv2I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Compute</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a7515974ca033a44c70f5b965ba736c7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DelegateCompute</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">compute</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="lgraph_api::olap::Worker::SharedWorker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a21214620b0c58b939404d191d78e1415"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">SharedWorker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the global (shared) worker. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A shared pointer to the global <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9stopping_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9stopping_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9stopping_E"></span><span id="lgraph_api::olap::Worker::stopping___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a72446f290a943941576f6803ea96a0da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">stopping_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9stopping_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9has_work_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9has_work_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9has_work_E"></span><span id="lgraph_api::olap::Worker::has_work___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a3b09e0253be21a64efc11b5ad9887b10"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">has_work_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9has_work_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6mutex_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker6mutex_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker6mutex_E"></span><span id="lgraph_api::olap::Worker::mutex___std::mutex"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a281b5ec791338d4378e22ef44a51b4a1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">mutex</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">mutex_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6mutex_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker3cv_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker3cv_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker3cv_E"></span><span id="lgraph_api::olap::Worker::cv___std::condition_variable"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a5eb1f373ea25b73577b6e0205ad7b399"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">condition_variable</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cv_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker3cv_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker5task_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker5task_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker5task_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a173918333017695d1cb7984078721f78"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">packaged_task</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">task_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker5task_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker7worker_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker7worker_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker7worker_E"></span><span id="lgraph_api::olap::Worker::worker___std::thread"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a2d17662c59ba51130a35fdaa8567db74"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">thread</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">worker_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker7worker_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-on-db">
+<h2>olap_on_db<a class="headerlink" href="#olap-on-db" title="Permalink to this headline"></a></h2>
+<p>TuGraph OLAP interface. To implement a plugin that perform graph analytics on TuGraph, user can load a Snapshot from the database, and then use the Gather-Apply-Scatter style interface to do the computation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="lgraph_api::olap::SNAPSHOT_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a24ed9da8cd6c1132a468b64f9ed37f7a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The available options for (graph construction) flags. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="lgraph_api::olap::SNAPSHOT_UNDIRECTED__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1ac92e5bd74f22a5d50d401c61577c2502"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_UNDIRECTED</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="lgraph_api::olap::SNAPSHOT_IDMAPPING__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1af550d7266e9792ecd7c8d4cec91b8ceb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IDMAPPING</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">2</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a7942e3aa179aef017291e80f6cab14ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">3</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The following options are not implemented yet. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a5553d31915ca2c1c043688e19a45ac10"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">4</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a1a3bf7fdc6b1674e1dc931f68c1b783e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">5</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a44ce105282f3a854a595cc978fa04693"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">6</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE">
+<span id="_CPPv3I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span id="_CPPv2I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a6f30998cf8b6f4da8c4d3cbb308b08ca"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="lgraph_api::olap::edge_convert_default::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_default</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">1;return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Default Parser for weighted edges for graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE">
+<span id="_CPPv3I0EN10lgraph_api4olap19edge_convert_weightE"></span><span id="_CPPv2I0EN10lgraph_api4olap19edge_convert_weightE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aa93176409e55c8dbf3df1979c99bb07d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="lgraph_api::olap::edge_convert_weight::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_weight</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">eit.GetField("weight").real();return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Example parser for extract from edge property “weight”. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDBE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDBE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDBE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olapE" title="lgraph_api::olap"><span class="n"><span class="pre">olap</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase"><span class="n"><span class="pre">OlapBase</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_on_db.h&gt;</em></div>
+<p>Snapshot is a derived class of Graph. Snapshot instances represent static (sub)graphs exported from LightningGraph. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses. </p>
+<p>EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a49ed16af93c6bfbaff9856aefb2d8f04"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1/V2 Procedures. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a31bb964e9baa8452632dfe0d97f253fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1 Procedures. </p>
+<p>
+Note: read-write transactions are not recommended here for safety, e.g. some vertices might be removed causing inconsistencies of the analysis, and vertex data extraction may not work for deleted vertices). The constructed graph should contain all vertices whose vertex_filter calls return true and all edges <em>sourced from</em> these vertices whose out_edge_filter calls return true. If SNAPSHOT_UNDIRECTED is specified, the graph will be made symmetric (i.e. reversed edges are also added to the graph). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges.</p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__GraphDBR.TransactionR.std::vector:std::vector:ss::.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a38771d37dea34f28513dd5305385dfa4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_list</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a428105b32ebebb9bd1ad5df715e8b3d5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Generate a graph without LightningGraph. For V2 Procedures. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a384cbed54b1bcd0610dfc176b0b58563"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a80b05d175e882c00a314f5ba518a55d4"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a79cc725b6c20ffac60c4c980e472d7e1"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::assign-operator__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaa45fb6b0cfa2ce83892f4667684d92a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="lgraph_api::olap::OlapOnDB::~OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c2abb48c34772b4ffd882210300572b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a14ebd243f449d5ef5dc6ffc56d0855c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Extract a vertex array from the graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>extract</strong> – The function describing the extraction logic.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> containing each vertex’s extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab5f0b3fee89201df1f5fa5bd06cceb4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToFile</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToFile::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output_file</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Write vertex data to a file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – The parallel vector storing the vertex data. </p></li>
+<li><p><strong>output_file</strong> – The path to the output file. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c18bf21eacc3c981bb129d99ae63f86"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToGraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToGraphDB::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Write vertex data to the graph database. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – <strong>[inout]</strong> The parallel vector storing the vertex data. </p></li>
+<li><p><strong>vertex_field</strong> – <strong>[in]</strong> The name of the vertex field. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OriginalVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a514e2403802681b3a6ab6e3e1521f3ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OriginalVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the original vertex id (in LightningGraph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The original id of the specified vertex in the graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::MappedVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a6ed1fe8e61e5879a68744a79c522ee0a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MappedVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">original_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the mapped vertex id (in the graph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>original_vid</strong> – The original vertex id (in LightningGraph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The mapped id of the specified vertex (in LightningGraph). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="lgraph_api::olap::OlapOnDB::GetTransaction"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a05e20809b4047a9dc2d54f28b3f62528"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetTransaction</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::Init__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a4457f7e41bdf9a2d7fe100d1bdc32ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Init</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">num_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapOnDB::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab7d7ef02dcbc497f1bc8e738188613c8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>This decision formula is used to determine whether to stop the algorithm running in <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="lgraph_api::olap::OlapOnDB::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a9af72b216eb95e320f0f261d9497c5c1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithVid"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a85b384fc73a534221f880e966c2ca608"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithDegree"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ac2d9a6a8d98a79402d9505ac3270373f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithDegree</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB3db_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="lgraph_api::olap::OlapOnDB::db___GraphDBP"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaaee9f9643b55632219320d15882f548"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="lgraph_api::olap::OlapOnDB::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="lgraph_api::olap::OlapOnDB::original_vids___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a82054e1776bcb3b09cb66389c1eeb781"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">original_vids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="lgraph_api::olap::OlapOnDB::vid_map___cuckoohash_map:s.s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a2871a76b39823e6482e093f9b0cacb78"></span><span class="n"><span class="pre">cuckoohash_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_map_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="lgraph_api::olap::OlapOnDB::flags___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a5bb1ec258a7281a0702e64c19bcda816"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vertex_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa4b2136dfe22d40f01778f7b04aa9993"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edge_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-profile">
+<h2>olap_profile<a class="headerlink" href="#olap-profile" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsageE"></span><span id="lgraph_api::olap::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsageE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_profile.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="lgraph_api::olap::MemUsage::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac231833949c8ed135c0e8e59af8d7e6c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="lgraph_api::olap::MemUsage::getMaxMemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a4f02170838631103c72261595c35916b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">getMaxMemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5resetEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5resetEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5resetEv"></span><span id="lgraph_api::olap::MemUsage::reset"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ad20897c5c8bd47f5d4005989bead0e55"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5resetEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="lgraph_api::olap::MemUsage::startMemRecord__unsigned-i"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac3db2b796bdfa6e43a1302c5a1072ba3"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">startMemRecord</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">interval</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1000</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5printEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5printEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5printEv"></span><span id="lgraph_api::olap::MemUsage::print"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a388f572c62279f839ee138a9afbdeeb5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">print</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5printEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="lgraph_api::olap::MemUsage::parseMemLine__cP"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a07befe13a6e76ab6c84719817c5fadbf"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parseMemLine</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">line</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="lgraph_api::olap::MemUsage::maxMemUsage__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a274bce27e5ba57cce5606ba61eb28489"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">maxMemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..8fde487168
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++ Stored Procedures
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.md
new file mode 100644
index 0000000000..7bb3ddb6c5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.md
@@ -0,0 +1,1547 @@
+
+
+             
+  <section id="python-stored-procedure-api">
+
+<p>Version: 4.2.0</p>
+<p>Copyright (C) 2018-2022 Ant Group.</p>
+<div class="toctree-wrapper compound">
+</div>
+<section id="introduction">
+<h2>Introduction<a class="headerlink" href="#introduction" title="Permalink to this headline"></a></h2>
+<p>Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.</p>
+<p>This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.</p>
+</section>
+<section id="module-liblgraph_python_api">
+<span id="api"></span><h2>API<a class="headerlink" href="#module-liblgraph_python_api" title="Permalink to this headline"></a></h2>
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">AccessLevel</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel" title="Permalink to this definition"></a></dt>
+<dd><p>Access that a user has on a graph.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NONE</p>
+<p>READ</p>
+<p>WRITE</p>
+<p>FULL</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">EdgeUid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid" title="Permalink to this definition"></a></dt>
+<dd><p>Edge identifier.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.dst">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">dst</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.dst" title="Permalink to this definition"></a></dt>
+<dd><p>Destination vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.eid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">eid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.eid" title="Permalink to this definition"></a></dt>
+<dd><p>ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.lid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">lid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.lid" title="Permalink to this definition"></a></dt>
+<dd><p>Label ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.src">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">src</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.src" title="Permalink to this definition"></a></dt>
+<dd><p>Source vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.tid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">tid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.tid" title="Permalink to this definition"></a></dt>
+<dd><p>Temporal ID of the edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldData</span></span><a class="headerlink" href="#liblgraph_python_api.FieldData" title="Permalink to this definition"></a></dt>
+<dd><p>FieldData is the data type of field value.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBlob">
+<span class="sig-name descname"><span class="pre">AsBlob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bytes</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBlob" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBool">
+<span class="sig-name descname"><span class="pre">AsBool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBool" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as bool, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDate">
+<span class="sig-name descname"><span class="pre">AsDate</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDate" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as date, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDateTime">
+<span class="sig-name descname"><span class="pre">AsDateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDateTime" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as datetime, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDouble">
+<span class="sig-name descname"><span class="pre">AsDouble</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDouble" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsFloat">
+<span class="sig-name descname"><span class="pre">AsFloat</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsFloat" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as float, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt16">
+<span class="sig-name descname"><span class="pre">AsInt16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt16" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int16, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt32">
+<span class="sig-name descname"><span class="pre">AsInt32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt32" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int32, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt64">
+<span class="sig-name descname"><span class="pre">AsInt64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt64" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int64, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt8">
+<span class="sig-name descname"><span class="pre">AsInt8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt8" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int8, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsString">
+<span class="sig-name descname"><span class="pre">AsString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsString" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as string, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Blob">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Blob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bytes</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Blob" title="Permalink to this definition"></a></dt>
+<dd><p>Make a BLOB value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Bool">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Bool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Bool" title="Permalink to this definition"></a></dt>
+<dd><p>Make a BOOL value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Date">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Date</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.Date" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>Date(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+<ol class="arabic simple" start="2">
+<li><p>Date(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.DateTime">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">DateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.DateTime" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>DateTime(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+<ol class="arabic simple" start="2">
+<li><p>DateTime(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Double">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Double</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Double" title="Permalink to this definition"></a></dt>
+<dd><p>Make a DOUBLE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Float">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Float</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Float" title="Permalink to this definition"></a></dt>
+<dd><p>Make a FLOAT value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int16">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int16" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT16 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int32">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int32" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT32 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int64">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int64" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT64 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int8">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int8" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT8 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.String">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">String</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.String" title="Permalink to this definition"></a></dt>
+<dd><p>Make a STRING value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.ToPython">
+<span class="sig-name descname"><span class="pre">ToPython</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.ToPython" title="Permalink to this definition"></a></dt>
+<dd><p>Convert to corresponding Python type.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.get">
+<span class="sig-name descname"><span class="pre">get</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.get" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.isNull">
+<span class="sig-name descname"><span class="pre">isNull</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.isNull" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.set">
+<span class="sig-name descname"><span class="pre">set</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.set" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldSpec</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec" title="Permalink to this definition"></a></dt>
+<dd><p>Field specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.name" title="Permalink to this definition"></a></dt>
+<dd><p>Name of this field.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.nullable">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">nullable</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.nullable" title="Permalink to this definition"></a></dt>
+<dd><p>Whether this field can be null.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.type">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">type</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.type" title="Permalink to this definition"></a></dt>
+<dd><p>Type of this field, INT8, INT16, …, FLOAT, DOUBLE, STRING.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldType</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType" title="Permalink to this definition"></a></dt>
+<dd><p>Data type of FieldData.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NUL</p>
+<p>BOOL</p>
+<p>INT8</p>
+<p>INT16</p>
+<p>INT32</p>
+<p>INT64</p>
+<p>FLOAT</p>
+<p>DOUBLE</p>
+<p>DATE</p>
+<p>DATETIME</p>
+<p>STRING</p>
+<p>BLOB</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Galaxy</span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy" title="Permalink to this definition"></a></dt>
+<dd><p>A galaxy is a TuGraph instance that holds multiple GraphDBs.
+A galaxy is stored in a directory and manages users and GraphDBs. Each (user, GraphDB) pair can have different access levels. You can use db=Galaxy.OpenGraph(graph) to open a graph. Since garbage collection in Python is automatic, you need to close the galaxy with Galaxy.Close() when you are done with it.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.Close" title="Permalink to this definition"></a></dt>
+<dd><p>Closes this galaxy</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateGraph">
+<span class="sig-name descname"><span class="pre">CreateGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">4398046511104</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Creates a graph.
+name: the name of the graph
+description: description of the graph
+max_size: maximum size of the graph, default 1TB</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateRole">
+<span class="sig-name descname"><span class="pre">CreateRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateRole" title="Permalink to this definition"></a></dt>
+<dd><p>Create a role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateUser">
+<span class="sig-name descname"><span class="pre">CreateUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateUser" title="Permalink to this definition"></a></dt>
+<dd><p>Creates a new user account.
+name: name of the user
+password: password for the user
+desc: description of this user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteGraph">
+<span class="sig-name descname"><span class="pre">DeleteGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes a graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteRole">
+<span class="sig-name descname"><span class="pre">DeleteRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteRole" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteUser">
+<span class="sig-name descname"><span class="pre">DeleteUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteUser" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes a user account</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DisableUser">
+<span class="sig-name descname"><span class="pre">DisableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DisableUser" title="Permalink to this definition"></a></dt>
+<dd><p>Disables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.EnableUser">
+<span class="sig-name descname"><span class="pre">EnableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.EnableUser" title="Permalink to this definition"></a></dt>
+<dd><p>Enables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.GetUserInfo">
+<span class="sig-name descname"><span class="pre">GetUserInfo</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::UserInfo</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.GetUserInfo" title="Permalink to this definition"></a></dt>
+<dd><p>Get information of the specified user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListGraphs">
+<span class="sig-name descname"><span class="pre">ListGraphs</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListGraphs" title="Permalink to this definition"></a></dt>
+<dd><p>Lists graphs and returns a dictionary of {name:(desc, max_size)}</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListUsers">
+<span class="sig-name descname"><span class="pre">ListUsers</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict[str,</span> <span class="pre">lgraph_api::UserInfo]</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListUsers" title="Permalink to this definition"></a></dt>
+<dd><p>Lists all users and whether they are admin</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ModGraph">
+<span class="sig-name descname"><span class="pre">ModGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ModGraph" title="Permalink to this definition"></a></dt>
+<dd><p>mod_size: whether to modify max graph size
+new_max_size: new maximum size of the graph, in bytes</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.OpenGraph">
+<span class="sig-name descname"><span class="pre">OpenGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">read_only</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::GraphDB</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.OpenGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Opens a graph and returns a GraphDB instance.
+graph: name of the graph
+read_only: whether to open the graph in read-only mode</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetCurrentUser">
+<span class="sig-name descname"><span class="pre">SetCurrentUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetCurrentUser" title="Permalink to this definition"></a></dt>
+<dd><p>Validate user password and set current user.
+user: user name
+password: password of the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRights">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRights</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRights" title="Permalink to this definition"></a></dt>
+<dd><p>Set access rights for the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRightsIncremental</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental" title="Permalink to this definition"></a></dt>
+<dd><p>Set access rights for the specified role, only affects the specified graphs</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleDesc">
+<span class="sig-name descname"><span class="pre">SetRoleDesc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleDesc" title="Permalink to this definition"></a></dt>
+<dd><p>Set description of the specified role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUser">
+<span class="sig-name descname"><span class="pre">SetUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUser" title="Permalink to this definition"></a></dt>
+<dd><p>Validate the given user and set current user given in the user.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserGraphAccess">
+<span class="sig-name descname"><span class="pre">SetUserGraphAccess</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">access</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserGraphAccess" title="Permalink to this definition"></a></dt>
+<dd><p>Set the access level of the specified user on the graph.
+user: name of the user
+graph: name of the graph
+access: access level of the user on that graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserPass">
+<span class="sig-name descname"><span class="pre">SetUserPass</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self:</span> <span class="pre">liblgraph_python_api.Galaxy</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">name:</span> <span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">old_password:</span> <span class="pre">str</span> <span class="pre">=</span> <span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_password:</span> <span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserPass" title="Permalink to this definition"></a></dt>
+<dd><p>Modifies user password.
+name: name of the user
+old_password: current password, not needed when modifying another user
+new_password: new password for the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserRoles">
+<span class="sig-name descname"><span class="pre">SetUserRoles</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">roles</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserRoles" title="Permalink to this definition"></a></dt>
+<dd><p>Set the roles for the specified user.
+name: name of the user
+roles: list of roles for this user</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">GraphDB</span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB" title="Permalink to this definition"></a></dt>
+<dd><p>The graph database class.
+A GraphDB stores the data about the graph, including labels, vertices, edges and indexes.Since Garbage Collection in Python is automatic, you need to close the DB with GraphDB.Close() at the end of its lifetime.Make sure you have either committed or aborted every transaction that is using the DB before you close the DB.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddEdgeLabel">
+<span class="sig-name descname"><span class="pre">AddEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">temporal_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">[]</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddEdgeLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Adds an edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexIndex">
+<span class="sig-name descname"><span class="pre">AddVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">is_unique</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexIndex" title="Permalink to this definition"></a></dt>
+<dd><p>Adds an index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexLabel">
+<span class="sig-name descname"><span class="pre">AddVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">primary_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Add a vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields" title="Permalink to this definition"></a></dt>
+<dd><p>Add fields to an edge label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields" title="Permalink to this definition"></a></dt>
+<dd><p>Delete fields from an edge label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModFields" title="Permalink to this definition"></a></dt>
+<dd><p>Modify fields in an edge label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModifyConstraints</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints" title="Permalink to this definition"></a></dt>
+<dd><p>Modify edge constraints</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelAddFields" title="Permalink to this definition"></a></dt>
+<dd><p>Add fields to a vertex label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelDelFields" title="Permalink to this definition"></a></dt>
+<dd><p>Delete fields from a vertex label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelModFields" title="Permalink to this definition"></a></dt>
+<dd><p>Modify fields in a vertex label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Close" title="Permalink to this definition"></a></dt>
+<dd><p>Closes the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateReadTxn">
+<span class="sig-name descname"><span class="pre">CreateReadTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateReadTxn" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateWriteTxn">
+<span class="sig-name descname"><span class="pre">CreateWriteTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">optimistic</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateWriteTxn" title="Permalink to this definition"></a></dt>
+<dd><p>Create a write transaction.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteEdgeLabel">
+<span class="sig-name descname"><span class="pre">DeleteEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteEdgeLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes an edge label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexIndex">
+<span class="sig-name descname"><span class="pre">DeleteVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexIndex" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes the specified index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexLabel">
+<span class="sig-name descname"><span class="pre">DeleteVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes a vertex label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllData">
+<span class="sig-name descname"><span class="pre">DropAllData</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllData" title="Permalink to this definition"></a></dt>
+<dd><p>Drop all the data in this DB.
+All vertices, edges, labels and indexes will be dropped.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllVertex">
+<span class="sig-name descname"><span class="pre">DropAllVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllVertex" title="Permalink to this definition"></a></dt>
+<dd><p>Drops all the vertices and edges in this DB.
+Labels and indexes (though index contents will be cleared due to deletion of vertices) will be preserved.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.EstimateNumVertices">
+<span class="sig-name descname"><span class="pre">EstimateNumVertices</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.EstimateNumVertices" title="Permalink to this definition"></a></dt>
+<dd><p>Gets an estimation of the number of vertices.
+This can be inaccurate if there were vertex removals.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Flush">
+<span class="sig-name descname"><span class="pre">Flush</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Flush" title="Permalink to this definition"></a></dt>
+<dd><p>Flushes written data into disk.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetDescription">
+<span class="sig-name descname"><span class="pre">GetDescription</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetDescription" title="Permalink to this definition"></a></dt>
+<dd><p>Gets description of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetMaxSize">
+<span class="sig-name descname"><span class="pre">GetMaxSize</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetMaxSize" title="Permalink to this definition"></a></dt>
+<dd><p>Gets maximum size of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.IsVertexIndexed" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">InEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>InEdgeIterator can be used to iterate through all the incoming edges of the destination vertex.
+Incoming edges are sorted in (dst, label, src, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Delete" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetAllFields" title="Permalink to this definition"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetDst" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetEdgeId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetField" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetSrc" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetUid" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Goto" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the in edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next in edge to current destination vertex.
+If there is no more in edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetField" title="Permalink to this definition"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.ToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">IndexSpec</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec" title="Permalink to this definition"></a></dt>
+<dd><p>Index specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.field">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">field</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.field" title="Permalink to this definition"></a></dt>
+<dd><p>Name of the field</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.label">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">label</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.label" title="Permalink to this definition"></a></dt>
+<dd><p>Name of the label.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.unique">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">unique</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.unique" title="Permalink to this definition"></a></dt>
+<dd><p>Whether the indexed values are unique.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">LGraphType</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType" title="Permalink to this definition"></a></dt>
+<dd><p>Members:</p>
+<p>NUL : NUL</p>
+<p>INTEGER : INTEGER</p>
+<p>FLOAT : FLOAT</p>
+<p>DOUBLE : DOUBLE</p>
+<p>BOOLEAN : BOOLEAN</p>
+<p>STRING : STRING</p>
+<p>NODE : NODE</p>
+<p>RELATIONSHIP : RELATIONSHIP</p>
+<p>PATH : PATH</p>
+<p>LIST : LIST</p>
+<p>MAP : MAP</p>
+<p>ANY : ANY</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">OutEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>OutEdgeIterator can be used to iterate through all the out-going edges of the source vertex.
+Out-going edges are sorted in (src, lid, dst, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Delete" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetAllFields" title="Permalink to this definition"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetDst" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetEdgeId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetField" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetSrc" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetUid" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Goto" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the out edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next out edge from current source vertex.
+If there is no more out edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetField" title="Permalink to this definition"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_values are FieldData containing the field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the field values as specified in value_dict.
+value_dict specifies the field_name:value dictionary.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.ToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">PluginErrorCode</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode" title="Permalink to this definition"></a></dt>
+<dd><p>ErrorCode of plugin.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>SUCCESS</p>
+<p>INPUT_ERR</p>
+<p>INTERNAL_ERR</p>
+<p>SUCCESS_WITH_SIGNATURE</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Transaction</span></span><a class="headerlink" href="#liblgraph_python_api.Transaction" title="Permalink to this definition"></a></dt>
+<dd><p>In embedded mode, all the operations are performed in transactions and thus enjoys the power of
+transactions such as atomicity and isolation. You can commit or abort a transaction at any time
+without worrying about the side effects it has already made.
+Transactions can be either committed or aborted, after which it is destructed and becomes invalid.
+Make sure you have destructed every transaction before you closes the corresponding GraphDB.
+Transactions also track the created iterators and releases all the iterators during destruction.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Abort">
+<span class="sig-name descname"><span class="pre">Abort</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Abort" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddEdge">
+<span class="sig-name descname"><span class="pre">AddEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddEdge" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values in string format.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label id, field ids, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+Returns the id of the newly added edge.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddVertex">
+<span class="sig-name descname"><span class="pre">AddVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddVertex" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values in string format.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label ids, field ids, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_ids are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, value_dict: dict) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name and set the value as specified in value_dict.
+Returns the id of the newly added vertex.
+Fields that are not specified in the dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Commit">
+<span class="sig-name descname"><span class="pre">Commit</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Commit" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.DumpGraph">
+<span class="sig-name descname"><span class="pre">DumpGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.DumpGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Prints the string representation of the WHOLE graph to stdout.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeFieldId">
+<span class="sig-name descname"><span class="pre">GetEdgeFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeFieldId" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_name: str) -&gt; int</p></li>
+</ol>
+<p>Gets the edge field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_names: List[str]) -&gt; List[int]</p></li>
+</ol>
+<p>Gets the edge field ids associated with this (label_id, field_names).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeLabelId">
+<span class="sig-name descname"><span class="pre">GetEdgeLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the edge label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeSchema">
+<span class="sig-name descname"><span class="pre">GetEdgeSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeSchema" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the schema specification of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetInEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator pointing to the in-edge of vertex dst with EdgeUid==euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumEdgeLabels">
+<span class="sig-name descname"><span class="pre">GetNumEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumEdgeLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumVertexLabels">
+<span class="sig-name descname"><span class="pre">GetNumVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumVertexLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetOutEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator pointing to the edge identified by euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexByUniqueIndex">
+<span class="sig-name descname"><span class="pre">GetVertexByUniqueIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexByUniqueIndex" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value_string: str) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value_string specifies the string representation of the indexed field value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value: object) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value specifies the indexed field value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, field_value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+field_value is a FieldData specifying the indexed field value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldId">
+<span class="sig-name descname"><span class="pre">GetVertexFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the vertex field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldIds">
+<span class="sig-name descname"><span class="pre">GetVertexFieldIds</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_names</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldIds" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the vertex field ids associated with this (label_id, [field_names]).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIndexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIndexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIndexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>Gets an VertexIndexIterator pointing to the indexed item which has index value [key_start, key_end].
+key_start=key_end=v returns an iterator pointing to all vertexes that has field value v.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+value is a FieldData containing the indexed value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start_string: str, key_end_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start_string is the string representation of the minimum indexed value.
+key_end_string is the string representation of the maximum indexed value.</p>
+<ol class="arabic simple" start="4">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="5">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value_string is the string representation of the indexed value.</p>
+<ol class="arabic simple" start="6">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value is a FieldData containing the indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the first vertex in the graph.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the vertex specified by vid.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int, nearest: bool) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets VertexIterator with vertex id.
+If nearest==true, go to the first vertex with id &gt;= vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexLabelId">
+<span class="sig-name descname"><span class="pre">GetVertexLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the vertex label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexSchema">
+<span class="sig-name descname"><span class="pre">GetVertexSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexSchema" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the schema specification of the vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsReadOnly">
+<span class="sig-name descname"><span class="pre">IsReadOnly</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsReadOnly" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsValid" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsVertexIndexed" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListEdgeLabels">
+<span class="sig-name descname"><span class="pre">ListEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListEdgeLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexIndexes">
+<span class="sig-name descname"><span class="pre">ListVertexIndexes</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.IndexSpec" title="liblgraph_python_api.IndexSpec"><span class="pre">liblgraph_python_api.IndexSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexIndexes" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the list of all the vertex indexes in the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexLabels">
+<span class="sig-name descname"><span class="pre">ListVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.UpsertEdge">
+<span class="sig-name descname"><span class="pre">UpsertEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.UpsertEdge" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values in string format.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label id, field ids, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.VertexToString">
+<span class="sig-name descname"><span class="pre">VertexToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.VertexToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of the vertex specified by vid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIndexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>VertexIndexIterator can be used to retrieve the id of indexed vertices.
+Vertex ids are sorted in ascending order of (index_value, vertex_id).</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetIndexValue">
+<span class="sig-name descname"><span class="pre">GetIndexValue</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetIndexValue" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the indexed value.
+Since vertex ids are sorted in (index_value, vertex_id) order, calling Next() may change the current indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetVid">
+<span class="sig-name descname"><span class="pre">GetVid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetVid" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the id of the vertex currently pointed to.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether this iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next indexed vid.
+If there is no more vertex within the specified key range, the iterator becomes invalid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>VertexIterator can be used to retrieve info of a vertex, or to scan through multiple vertices.
+Vertexes are sorted in ascending order of the their ids.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Delete" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes current vertex.
+The iterator will point to the next vertex if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetAllFields" title="Permalink to this definition"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetField" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetId">
+<span class="sig-name descname"><span class="pre">GetId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the integer id of this vertex.
+GraphDB assigns an integer id for each vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetInEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the first in-coming edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the in-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the label name of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the label id of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumInEdges">
+<span class="sig-name descname"><span class="pre">GetNumInEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumInEdges" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the number of in-coming edges of this vertex.
+n_limit specifies the maximum number of edges to scan.
+Returns a tuple containing the number of in-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumOutEdges">
+<span class="sig-name descname"><span class="pre">GetNumOutEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumOutEdges" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the number of out edges of this vertex.
+n_limit specifies the maximum number of vids to scan.Returns a tuple containing the number of out-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetOutEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the first out-going edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the out-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Goto" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the vertex specified by vid.
+If nearest==true, go to the nearest vertex with id&gt;=vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListDstVids">
+<span class="sig-name descname"><span class="pre">ListDstVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListDstVids" title="Permalink to this definition"></a></dt>
+<dd><p>Lists all destination vids of the out edges.
+n_limit specifies the maximum number of vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListSrcVids">
+<span class="sig-name descname"><span class="pre">ListSrcVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListSrcVids" title="Permalink to this definition"></a></dt>
+<dd><p>Lists all source vids of the in edges.
+n_limit specifies the maximum number of src vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next vertex with id&gt;{current_vid}.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetField" title="Permalink to this definition"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of current vertex, including properties and edges.</p>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..e2a106d7c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,29 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python stored procedure API
+====================================
+Version: 4.2.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..d50c8ecdcf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,17 @@
+# Rust Stored Procedures
+
+## 1. Introduction
+Rust stored procedures currently only support v1 version. TuGraph supports plugins in any language that can be compiled into a dynamic library. Rust, as a rising star in system programming languages, has significant advantages in terms of safety, reliability, and ergonomics compared to C++.
+
+We provide the Rust binding library for TuGraph to support calling lgrahp API in Rust. We also provide the [tugraph-plugin-util](https://crates.io/crates/tugraph-plugin-util ) utility library to help simplify the process of writing Rust plugins.
+
+## 2. How to Use
+
+Using Rust stored procedures involves three steps:
+* Compilation: Compile the Rust source code into a dynamic library (so file). We have prepared a comprehensive plugin development tutorial that covers everything from IDE plugin installation and environment setup to compilation. Please refer to the `rust-tugraph-plugin-tutorial` for detailed instructions.
+* Loading: Load the dynamic library (so file) into the server. This can be done through the REST or RPC interface, similar to the usage of C++ libraries. Please refer to the documentation for more details on the [Procedure v1 API](1.procedure.md).
+* Execution: Once the library is loaded, use it as you would with a C++ stored procedure. The process is the same and does not need further explanation.
+
+## 3. API Documentation
+
+In the Rust community, all code and documentation can be found on [`crates.io`](https://crates.io/crates/tugraph ) and [`docs.rs`](https://docs.rs/tugraph/latest/tugraph ).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..327e9f7c91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.2.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..22403ca19e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..83cc10c52e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..5e4000b6ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,214 @@
+# Bootstrap program
+
+>This document is a bootstrap program designed for TuGraph users. Before reading the detailed documents, users should read this document first to have a general understanding of TuGraph's graph computing operation process, and it will be more convenient to read the detailed documents later. The bootstrap program is a simple instance of a bfs (breadth-first search) program based on Tugraph, and we will focus on how it is used.
+
+## 1.Introduction to TuGraph-Graph Analysis Engine
+
+TuGraph's graph analysis engine is mainly used for full graph/full data analysis tasks. With the help of TuGraph's C++ / Python graph analysis engine API, users can quickly derive a complex subgraph from different data sources, and then run iterative graph algorithms such as PageRank, LPA, WCC on the subgraph, and finally make corresponding countermeasures according to the running results.
+
+In TuGraph, the process of both exporting and computing can be accelerated by in-memory parallel processing, resulting in near-real-time processing and analysis. Compared to traditional methods, this approach can avoid the overhead of data export and disk drop, and can achieve ideal performance by using a compact graph data structure.
+
+TuGraph has 6 built-in algorithms in the community version and 25 built-in algorithms in the commercial version. Users hardly need to implement the specific graph calculation process themselves. For details, please refer to algorithms.md.
+
+According to different data sources and implementations, it can be divided into Procedure, Embed and Standalone, which all inherit from OlapBase API. OlapBase API interface documentation can be found in OlAPBase-APi.md.
+
+The data source of Procedure and Embed is the db data preloaded in the graph database, which can be compiled to generate the.so file used by TuGraph-Web loading and the embed file used by the background terminal respectively. The input graph data are loaded in the form of db. The interface document can refer to olapondb-api.md.
+
+Standalone is used to compile and generate a standalone file. Different from the former, the input graph data of the file is loaded in the form of txt, binary, and ODPS files, and the interface document can refer to olapondisk-api.md.
+
+## 2.Procedure compile and run
+
+This mode is mainly used for visual loading and running on the TuGraph-web interface. The usage method is as follows:
+
+### 2.1.C++
+Run bash make_so.sh bfs in the TuGraph/procedures directory to the BFs.so file in the TuGraph/procedures directory, upload the file as a plug-in to Tugraph-web, input parameters and then execute.
+
+### 2.2.Python
+Upload the python file as a plugin to TuGraph-web, and execute it after inputting parameters.
+
+Example:
+Compile the.so algorithm file at TuGraph/procedures
+`bash make_so.sh bfs`
+
+After loading the bfs.so (or TuGraph/procedures/algo_cython/bfs.py) file as a plug-in to TuGraph-web, enter the following json parameters:
+
+```json
+{
+  "root_id": "0",
+  "label": "node",
+  "field": "id"
+}
+```
+
+The following result
+
+result:"{"core_cost":0.013641119003295898,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":8.821487426757813e-06,
+"prepare_cost":0.03479194641113281,
+"total_cost":0.04844188690185547}"
+
+The output ：
+
+- num_edges: the number of edges in the graph
+- num_vertices: the number of nodes in the graph
+- prepare_cost: Represents the time required for the preprocessing phase. The preprocessing phase works: loading parameters, graph data loading, index initialization.
+- core_cost: Represents the time required for the algorithm to run.
+- found_vertices: Number of vertices found.
+- output_cost: the time it takes for the algorithm result to be written back to db.。
+- total_cost: The overall running time of the algorithm is executed.
+
+make_so.sh This file is used to compile the graph algorithm files involved in TuGraph-OLAP into a.so file available for TuGraph-web.
+
+## 3.Embed compile and run
+
+This way is mainly used for TuGraph in the background program on the preloaded db graph data algorithm analysis. Its use method is as follows:
+
+To complete the embed_main.cpp file in TuGraph/procedures directory, add the data name, input parameters, data path and other information, as shown in the following example:
+
+### 3.1.C++
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path Specifies the path for saving the preloaded graph data
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // Specifies the name of the graph
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // Enter the algorithm parameters in json format
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+
+Run bash make_so.sh bfs in TuGraph/procedures to bfs_procedure in TuGraph/procedures/algo_cpp.
+`bash make_embed.sh bfs`
+
+Do this in the TuGraph/procedures folder
+`./algo_cpp/bfs_procedure`
+The result is returned.
+
+Input: {"root_id":"0", "label":"node","field":"id"}
+found_vertices = 3829
+{"core_cost":0.025603055953979492,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":9.059906005859375e-06,
+"prepare_cost":0.056738853454589844,
+"total_cost":0.0823509693145752}
+
+`Input` indicates the input parameters.The other parameters are described as above.
+
+### 3.2.Python
+
+To compile bfs.so, run `bash make_so_cython.sh bfs` in TuGraph/procedures or `python3 setup.py build_ext -i` in TuGraph/procedures/algo_cython.
+
+After obtaining bfs.so, it can be imported and used in Python, as shown in TuGraph/procedures/run_embed.py:
+
+```python
+# TuGraph/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+
+# shell
+python3 run_embed.py
+```
+The output is the same as C++
+
+
+## 4.Standalone compile and run
+
+This file is mainly used to load the graph data directly at the terminal and run the printout results. Here's how to use it:
+
+In TuGraph/build directory `make bfs_standalone` (need to include boost/sort/sort.hpp in the g++ default include path) can get bfs_standalone file, the file is generated with TuGraph/build/output/algo folder.
+
+Run: Go to the TuGraph/build directory and do`./output/algo/bfs_standalone -- type [type] -- input_dir [input_dir] --id_mapping [id_mapping] -- vertices [vertices] --root (root) - output_dir [output_dir]`
+
+Ready to run.
+
+- `[type]` : indicates the type source of the input graph file, including text file, BINARY_FILE binary file, and ODPS source.
+
+- `[input_dir]` : indicates the path of the input graph file folder, which may contain one or more input files. TuGraph will read all the files under [input_dir] when reading the input file. It is required that [input_dir] can only contain the input file and cannot contain other files. Parameters cannot be omitted.
+
+- `[id_mapping]`：When reading the side table, whether to do id mapping for the input data to make it conform to the form of algorithm operation. 1 is required for id mapping, 0 is not required. This process will take some time. The parameter can be omitted, and the default value is 0.
+
+- `[vertices]` : represents the number of vertices in the graph. 0 indicates the number of vertices that the user wants the system to automatically recognize. When is non-zero, it indicates the number of vertices that the user wants to customize. The number of user-defined vertices must be greater than the maximum vertex ID. This parameter can be omitted. The default value is 0.
+
+- `[root]` : indicates the starting vertex id for bfs. The argument cannot be omitted.
+
+- `[output_dir]` : indicates the path of the folder where the output data is saved. The output content is saved to this file, and the parameter cannot be omitted.
+
+Example
+
+### 4.1.C++
+
+Compile the standalone algorithm program at TuGraph/build
+
+```shell
+make bfs_standalone
+```
+
+Run the text source file in TuGraph/build/output
+
+```
+    ./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+Result：
+
+```
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+Result Parameter description is the same as above.
+
+If you do not know the required parameters of a new algorithm, run the`./output/algo/bfs_standalone -h` to view the parameters.
+
+### 4.2.Python
+The bfs extension compilation process of the Python language is the same as that of the embed mode. It is called through the `Standalone` interface at runtime. The example is as follows:
+
+```python
+# TuGraph/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(
+        input_dir="../test/integration/data/algo/fb_unweighted",
+        root=0)
+
+# shell
+python3 run_standalone.py
+```
+
+At this point, the process of bfs operation on the figure above by TuGraph is complete.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..af510f95c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,196 @@
+# OlapBase API
+
+> This document will introduce how to use the OlapBase API
+
+## 1.The overview
+
+This manual will introduce the configuration of the TuGraph graph computing system. Combined with the code, several important files and interfaces in TuGraph are introduced.
+
+## 2.Configuration requirements
+
+To develop and compile applications using the TuGraph graph computing system, the configuration required:
+
+- linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+
+- Compiler that supports C++ 14, requires GCC version 5.4.1 or later.
+
+## 3.Atomic operations
+
+TuGraph uses multi-threading technology for batch operations, in which case memory access conflicts may occur. In order to ensure the correctness of modification operations in parallel computing, TuGraph implements atomic operations. The code section can be found in the lgraph_atomic.cpp file under the lgraph folder.
+
+TuGraph also customizes 4 commonly used atomic operations. When we need to modify the data of vertices in multithreaded mode, we should use atomic operations to ensure the correctness of the modification operation in parallel environment. In addition to these four atomic operations, users can also use "cas" to build their own atomic operation functions.
+
+- `bool cas(T \* ptr, T oldv, T newv)` : If the value pointed to by ptr is equal to oldv, the value pointed to by ptr is assigned to newv and returns true. Otherwise, false is returned
+- `bool write_min(T \*a, T b)` : If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `bool write_max(T \*a, T b)` : If b is larger than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `void write_add(T \*a, T b)` : adds the value of b to the value pointed to by a.
+- `void write_sub(T \*a, T b)` : subtract the value of b from the value pointed to by a.
+
+## 4.Vertex Class ParallelBitset
+
+When using TuGraph for batch operations, you need to use a vertex set to represent the vertices you want to process. ParallelBitset implements a vertex collection class that represents vertices in bits and thus saves a significant amount of memory. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 4.1ParallelBitset Class
+
+- `size_t Size()`：Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size_t size)`：Initialize size and data, the length of data is (size >> 6)+1.
+- `void Clear()`：clears the collection.
+- `void Fill()`：add all vertices to the set.
+- `bool Has(size_t i)`：check if vertex i is in the set.
+- `bool Add(size_t i)`：add vertex i to the set.
+- `void Swap(ParallelBitset &other)`：exchange elements with another set of ParallelBitset.
+
+## 5.Vertex Array Class ParallelVector
+
+When using TuGraph for batch operations, you need to use an array of vertices to represent the result of processing vertices. ParallelVector implements the vertex array class. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 5.1.ParallelVector Class
+
+- `ParallelVector(size_t capacity)` Builds ParallelVector. capacity is the initial size of the vertex array
+- `T& operator[](size_t i)` : data with subscript i
+- `T \*begin()` : ParallelVector the starting pointer
+- `T \*end()` : ParallelVector the end pointer to Parallelvector. begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to access an array sequentially
+- `T&Back ()` : ParallelVector the last data
+- `T \*Data()` : represents the data in the array itself
+- `void Destroy()' : empty the ParallelVector array and delete the array
+- `size_t Size()` : indicates the number of data in ParallelVector
+- `size_t Capacity()` : indicates the capacity of ParallelVector
+- `void Resize(size_t size)` : Change ParallelVector to size, which must be greater than or equal to the size before the change
+- `void Clear()` : empty the data in ParallelVector
+- `void ReAlloc(size_t capacity)` : ParallelVector is allocated with new capacity. If data exists in the array, it is migrated to the new memory
+- `void Fill(T elem)` : Assign elem to all data on ParallelVector
+- `void Append(const T&elem, bool atomic = true)` : Add a piece of data at the end of ParallelVector
+- `void Swap(ParallelVector<t> &other)` : to exchange data with other parallelvectors</t>
+- `ParallelVector<t> Copy()` : copies the current ParallelVector data into the Copy array</t>
+
+## 6.Customize data structures
+
+### 6.1.Basic data types
+
+We customize the data structure representation of points and edges to save memory space while covering all vertices:
+
+- 'Empty' : indicates a special data type with empty content.
+
+### 6.2.Combining data structures
+
+In order to facilitate calculation, we define several data structures of point and edge data according to different calculation scenarios, which are as follows:
+
+- `EdgeUnit<edgedata>` : represents an edge of weight type EdgeData, used to parse the input file, and contains three member variables:</edgedata>
+- `size_t src` : the starting vertex of an edge
+- `size_t dst` : the end of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjUnit<edgedata>` : represents an edge of weight type EdgeData, used during batch computation, and contains two member variables:</edgedata>
+- `size_t neighbour` : indicates the neighbor vertex of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjList<edgedata>` : Adjacency list of vertices with weights of type EdgeData, often used to represent the set of incoming and outgoing edges of vertices and containing two member variables:</edgedata>
+- `AdjUnit<t> \* begin` : indicates the start pointer of the list</t>
+- `AdjUnit<t> \* end` : The end pointer of the list.</t> begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to loop through the adjacency list.
+
+## 7.Graph class OlapBase
+
+Graph class OlapBase is the main class for TuGraph to load graphs and calculate graphs. OlapBase is commonly used to represent graphs with weights of type EdgeData. See olap_base.hpp under lgraph folder for the code. This chapter covers the types and API interfaces commonly used in Graph classes. The classes used by the Procedure, Embed, and Standalone functions described above are all subclasses of this class.
+
+### 7.1.Basic Information
+
+- `size_t NumVertices()` : obtains the number of vertices
+
+- `size_t NumEdges()` : Gets the number of edges
+
+- `size_t OutDegree(size_t vid)` : indicates the outdegree of the vid of the vertex
+
+- `size_t InDegree(size_t vid)` : indicates the input degree of vertex vid
+
+### 7.2.node sets and edge sets and their related operations
+
+- `ParallelVector AllocVertexArray()` : Allocates an array of type VertexData with size as the number of vertices
+
+- `void fill_vertex_array(V \* array, V value)` : assigns values to all elements in the array
+
+- `ParallelBitset AllocVertexSubset()` : Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+
+- `AdjList OutEdges(size_t vid)'`: gets the set of all outgoing edges of vertex v
+
+- `AdjList InEdges(size_t vid)` : Obtains the set of all incoming edges of vertex v
+
+- `void Transpose()` : transpose of a directed graph
+
+- `LoadFromArray(char \* edge_array, VertexId input_vertices, EdgeId input_edges, EdgeDirectionPolicy (edge_direction_policy) `: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+`edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+`input_vertices`: specifies the number of vertices read into the graph by the array.
+
+`input_edges` : specifies the number of edges that the array reads into the image.
+
+`edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+### 7.3.Locking mechanism
+
+TuGraph implements a pair of locks to control the program's access to vertex data. Respectively is:
+
+- `void AcquireVertexLock(size_t vid)` : locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(size_t vid)` : unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+- `VertexLockGuard GuardVertexLock(size_t vid)` : When the vid operation is performed, the vertex vid is locked, and the lock is automatically released upon exiting the scope
+
+### 7.4.Batch Processing Operations
+
+TuGraph provides two batch operations to do a point-centered batch process in parallel. Respectively is:
+
+```c++
+/*
+    Function Name:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    The work function executes the work function on nodes whose numbers are between lower and upper in the Graph. The fourth parameter indicates the accumulated base, which defaults to 0.The fifth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+For details, please refer to include/lgraph/olap_base.h
+
+    Example: Count the number of vertices in the parent array that have outgoing edges
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+graph is the instantiated object of graph class OlapBase
+
+```C++
+/*
+    Function Name:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    Function: Execute the work function for the node that corresponds to 1 in active_vertices. The third parameter represents the cumulative cardinality, which is 0 by default.
+
+    The fourth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+
+    For specific implementation, please refer to the specific code in /include/lgraph/olap_base
+
+
+
+    Example: Output all the out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..6015d7e1ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,303 @@
+# OlapOnDB API
+
+> This document provides detailed instructions for using the OlapOnDB API
+
+## 1.Introduction
+
+Generally speaking, users need to implement the process of subgraph extraction by themselves. Then use the rich interface in TuGraph to implement your own graph analysis algorithm.
+
+This document mainly introduces the Procedure and Embed interface design, and introduces some common interface, specific interface information see include/lgraph/olap_on_db.h file.
+
+## 2.Schema
+
+Procedure and Embed auxiliary functions are mainly included in the OlapOnDB class, and some more frequently used functions will be introduced one by one
+
+OLAP is associated with the following common data structures in TuGraph:
+
+1. DB graph analysis class `OlapOnDB`
+
+2. Vertex array `ParallelVector`
+
+3. Vertex set `ParallelBitset`
+
+4. Side data structure `AdjUnit/AdjUnit`
+
+5. Edge collection data structure `AdjList`
+
+### 2.1.Snapshot Based Storage Structure
+
+The OlapOnDB class in TuGraph provides a data "snapshot," that is, a fully usable copy of a given data set that includes a mirror image of the corresponding data at a certain point in time (the point at which the copy was started). Because OLAP operations involve only reads and not writes, OlapOnDB arranges data in a more compact manner, saving space while improving data access locality.
+
+### 2.2.BSP Calculation Model
+
+TuGraph uses the BSP (Bulk Synchronous Parallel) model in the process of calculation, which makes the process can be executed in parallel, and greatly improves the efficiency of the program.
+
+The core idea of BSP calculation model is to propose and use Super Step. After OlapOnDB is created, the computation on this data is divided into multiple supersteps, such as PageRank, which is divided into multiple iterations, and each iteration is a Super Step. There is explicit synchronization between different Super Steps to ensure that all threads proceed to the next Super Step at the same time after completing the same superstep. Within a Super Step, all threads execute asynchronously, using parallelism to improve computational efficiency.
+
+BSP calculation model can effectively avoid deadlock, and achieve coarse-grained global synchronization in hardware mode by means of obstacle synchronization, so that graph computation can be executed in parallel, and programmers do not need to spend much time on synchronization mutual exclusion.
+
+## 3.Algorithm example
+
+Here is an explanation of the PageRank algorithm, which is mainly divided into the main function Process and the PageRank algorithm process function.
+
+### 3.1.Main function
+
+The main function has three input parameters, 'TuGraph' database parameter 'db', the request 'request' obtained from the web side, and the return value 'response' given to the web side. The overall process can be divided into the following steps:
+
+1. Obtain related parameters
+
+2. Create a snapshot class
+
+3. Main process of PageRank algorithm
+
+4. Obtain and send the return value of the web page
+
+```c
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+
+    // Obtain the number of iterations from web side requests (num_iterations)，
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // Read transaction creation and snapshot class creation
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+
+    // Create a pr array to store the pr value for each node
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank algorithm main process, obtain the pagerank value of each node
+    PageRankCore(olapondb, num_iterations, pr);
+
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        Function Purpose: Gets the number of the node with the largest pagerank among all nodes
+
+        Function flow description: This function executes Func A for node vi (also known as the active vertices) corresponding to all bits of 1 in the vertex set all_vertices. The return value of Func A is then used as the second input parameter of Func B to obtain the local maximum value (because the first input parameter is 0. So the return value is actually the pagerank value of each node). Finally, the return value of all threads is summarized, and Func B is executed again to get the global return value, and stored in the max_pr_vi variable
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+
+    // Retrieve and send the return value from the web page
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2.PageRank Algorithm process
+
+`pagerank` main process has two input parameters, snapshot class (subgraph) and iteration times, the overall process can be divided into the following steps:
+
+1. Initialization of related data structures
+2. Initialize the pagerank value of each node
+3. Calculation of pagerank value of each node, active vertices for all vertices (means that all vertices need to calculate pagerank value)
+4. Obtain the pagerank value after 'num_iterations' of each node
+
+```c
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+
+    // Initialization of related data structures
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // The initialization of the pagerank value of each node is inversely proportional to the degree of the node
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // Total iteration process
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            Function Purpose: Calculates the pagerank of all nodes
+
+            Function flow description: This function is used to calculate the pagerank value of all nodes. Execute Func C on node vi corresponding to all the bits of 1 in all_vertices to obtain the pagerank value of vi in the current iteration and return the pagerank change value of vi node. The total change value of all active nodes is finally summarized and returned through the internal processing of the function, which is stored in the delta variable
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // Gets the pagerank value of the current node from its neighbor
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank value calculation core formula
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+
+                    // Statistics of relevant intermediate variables
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // The pagerank value obtained in this iteration is output as the input of the next iteration
+        curr.Swap(next);
+    }
+}
+```
+
+### 4.1.Transaction creation
+
+```c
+// Create a read transaction
+auto txn = db.CreateReadTxn();
+
+// Write transaction creation
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2.Parallelization to create a directed graph
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3.Create undirected graphs in parallel
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED;
+)
+```
+
+### 4.4.Obtain the output degree
+
+```c
+size_t OutDegree(size_t vid)
+```
+
+### 4.5.Obtain the input degree
+
+```c
+size_t InDegree(size_t vid)
+```
+
+### 4.6.Gets the outgoing edge set
+
+```c
+/*
+    Function name: AdjList OutEdges(size_t vid)
+
+    Data structure:
+
+    An AdjList can be understood as an array of structures of type AdjUnit
+
+    AdjUnit has two member variables: 1. size_t neighbour 2. edge_data: neighbour indicates the number of the target node pointed by the outgoing edge. If the value is a licensed graph, the data type of edge_data is the same as the weight value of the edge in the input file
+
+    Example Output all outgoing neighbors of node vid
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7.Gets the incoming edge set
+
+```c
+AdjList<edgedata> InEdges(size_t vid)</edgedata>
+
+// Example: Outputs all inbound neighbors of node vid
+for (auto & edge : olapondb.InEdges(vid)) {
+size_t dst = edge.neighbour;
+printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8.Get the node ID of OlapOnDB corresponding to the node in TuGraph
+
+```c
+size_t OriginalVid(size_t vid)
+
+// Note: The node numbers entered in TuGraph can be non-numbers, such as names. When OlapOnDB subgraphs are generated, names and other names will be converted to numbers for subsequent processing. Therefore, this method may not be applicable to some specific scenarios
+```
+
+### 4.9.Gets the node number of TuGraph corresponding to a node in OlapOnDB
+
+```c
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10.Description of active vertices
+
+Active vertices refer to the vertices that need to be processed in the batch function. In this example, we simply output the number of active vertices and summarize the number of active vertices:
+
+```c
+ParallelBitset temp = 000111; // The current active vertices are vertices 3, 4 and 5
+
+size_t delta = ForEachActiveVertex<double>(</double>
+//void c
+[&](size_t vi) {
+printf("active_vertexId = %lu\n",vi);
+return 1;
+},
+all_vertices
+);
+```
+
+The result of this function is obvious. Because of multiple threads, the output order may vary:
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+The local return value is 1. This function will add all the local return values in a thread-safe manner to the final return value, which is stored in the delta variable, and the final value is 3
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..bb3c784f13
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,213 @@
+# OlapOnDisk API
+
+> This document mainly introduces the usage instructions of OlapOnDisk API in detail
+
+## Table of contents
+
+- [1. Introduction](#1introduction)
+- [2. Algorithm Example](#2algorithm-example)
+     - [2.1 header files](#21head-file)
+     - [2.2 Configuration class MyConfig](#22configuration-class-myconfig)
+     - [2.3 Main function](#23main-function)
+     - [2.4 bfs algorithm flow](#24bfs-algorithm-process)
+- [3. Function description of other commonly used functions](#3description-of-other-commonly-used-functions)
+     - [3.1 Image Loading](#31graph-load)
+     - [3.2 Image writing](#32graph-write)
+     - [3.3 Graph Analysis Function](#33graph-parse-function)
+    
+### 1.Introduction
+
+The Standalone mode of TuGraph can be used to load graph data files, where the sources of graph data files can include text files, BINARY_FILE binary files, and ODPS sources. In this mode, TuGraph can quickly load multiple data sources into a graph, and then run iterative algorithms such as BFS, WCC, SSSP, etc. on the graph, and output the final result to the terminal.
+
+In TuGraph, the export and calculation process can be accelerated through parallel processing in memory, so as to achieve near real-time processing and analysis. Compared with traditional methods, it avoids the overhead of data export and storage, and can use compact Graph data structures achieve desirable performance for computation.
+
+TuGraph has built-in a large number of common graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement the specific graph calculation process by themselves. They only need to include the header file (.h) of the corresponding algorithm library when implementing their own stored procedures. To your own program, and link your own dynamic library files in the compilation phase.
+
+This document mainly introduces the common interfaces of Standalone, and the auxiliary functions used are mainly contained in the OlapOnDB class. At the same time, in order to help users understand and facilitate, the BFS algorithm is illustrated with examples.
+
+### 2.Algorithm example
+
+Here, the BFS algorithm is explained in blocks, which are roughly divided into the main function `main`, the BFS algorithm process `BFSCore` function and the configuration class MyConfig.
+
+#### 2.1.Head file
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //Header files to include when using TuGraph
+#include "./algo.h"   //A header file containing various algorithmic logic functions
+```
+
+When using TuGraph to realize the calculation application of graph data files, generally, the StandaloneGraph class object graph is first created, the graph file data is loaded into the graph, and then the graph calculation process is realized by calling the graph logic function, and finally the result of the graph calculation is printed out.
+
+#### 2.2.Configuration class MyConfig
+
+The MyConfig configuration class function is used to provide the configuration information required for the algorithm logic calculation, inherited from ConfigBase<EdgeData>, where EdgeDate can choose Empty (unweighted graph), int (the weight of the weighted graph is an integer) or double (the weight of the weighted graph is double) type.
+
+The MyConfig configuration class generally depends on the algorithm, and additional configuration information is required as follows:
+
+1. Parameters required by the algorithm
+2. Algorithm name
+3. Configure the Print function in the class
+Other common members inherit from ConfigBase, please refer to src/olap/olap_config.h for reference.
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // The parameters required by the algorithm are initialized
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // The configuration file accepts command line parameters. This use case will sequentially read the parameters when calling the algorithm from the command line. The value specified by the user is preferred. If the user does not specify it, the default parameter is selected.
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+#### 2.3.main function
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // Statistical memory consumption class MemUsage instantiation
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // Configuration class MyConfig instantiation
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk class instantiation
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // Statistical graph loading time consumption
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // Create an array to count whether a node has been traversed
+    auto parent = graph.AllocVertexArray<size_t>();
+    // Breadth-first search algorithm, returns the number of nodes connected to the root_vid root node in the graph
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // Print relevant information to the terminal
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+#### 2.4.bfs algorithm process
+
+The main process of `bfs` has two input parameters, the snapshot class (subgraph) and the number of iterations. The overall process can be divided into the following steps:
+
+1. Relevant definitions and initialization of data structures
+2. Use the batch function to perform cyclic calculations on each node, find all nodes adjacent to the current node in each round, and exchange them when the round ends.
+3. Until all nodes are found, return the number of nodes discovered_vertices.
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //Allocate an array, active_in is used to store the nodes found in the previous cycle stage
+  active_in.Add(root);            //Add the root node to the array
+  auto active_out = graph.AllocVertexSubset();  //Allocate the array active_out to store the nodes found in the current cycle stage
+  parent.Fill((size_t)-1);               //Assign a value of -1 to the node in the parent array, -1 means not found
+  parent[root] = root;
+  size_t num_activations = 1;       //Indicates the number of nodes found in the current loop phase
+  size_t discovered_vertices = 0;    //Indicates the total number of nodes found in the current cycle phase
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations indicates the number of nodes found in the current loop phase
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices indicates the total number of nodes found in the current cycle phase
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //Each cycle starts from the root node, finds adjacent adjacent nodes, changes its parent value, and operates num_activations+1
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //Store the nodes found in the current loop phase
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // return all nodes
+  return discovered_vertices;
+}
+```
+
+### 3.Description of other commonly used functions
+
+#### 3.1.Graph load
+
+TuGraph-StandaloneThe loading sources of graph data files are mainly divided into three categories: text files, binary files, and ODPS. The binary file is a file in which the binary representation of the edge data is arranged in order, which can save a lot of storage space. Its loading function is divided into three types, namely:
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：The loading method of the graph data file contains two parameters, and their meanings represent respectively
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `edge_direction_policy`：Specifies whether the graph is directed or undirected, including three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. Among them, DUAL_DIRECTION is the default graph loading method.
+  DUAL_DIRECTION : The input file is an asymmetric graph and the loaded graph is an asymmetric graph.
+  MAKE_SYMMETRIC : The input file is an asymmetric graph and the loaded graph is a symmetric graph.
+  INPUT_SYMMETRIC : The input file is a symmetric graph and the loaded graph is a symmetric graph.
+  For details, see `enum EdgeDirectionPolicy` in the olap_config.h file under the lgraph folder.
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：Load the vertices in the file into an array in the order of their ids. The meanings of each parameter are:
+  - `array`：array of data to be read
+  - `path`：The path to read the file, each line in the file represents a pair of vertex
+  - `parse_line`：A user-defined function that tells the system how to parse a line of text data into a vertex pair.
+
+
+#### 3.2.Graph write
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：Write the data in the array back to the file, and the meanings of each parameter are:
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `array`：array of data to be written
+  - `array_size`：The length of the number of data to be written
+  - `name`：algorithm name
+  - `filter_output`：Write data rule function, the data to be written needs to meet the requirements of this function.
+
+#### 3.3.graph parse function
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：Parse the graph data file, and load the graph as an unweighted graph.
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：Parse the graph data file, load the graph as a weighted graph, and specify the weight data type by modifying <EdgeData>.
+
+This function can be specified through the constructor parse_line when the MyConfig class is defined.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..c51987fac4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,447 @@
+# Python Olap API
+
+> This document mainly introduces the API usage of OlapBase OlapOnDB and OlapOnDisk in Python
+
+## Table of contents
+- [1.Overview](#1-overview)
+- [2.Configuration Requirements](#2-configuration-requirements)
+- [3.Cython](#3-cython)
+- [4.Olap API](#4-olap-api)
+    - [4.1. Atomic operations](#atomic-operations)
+    - [4.2. Vertex collection class ParallelBitset](#vertex-collection-class-parallelbitset)
+    - [4.3. Vertex array class ParallelVector](#vertex-array-class-parallelvector)
+    - [4.4. Custom data structure](#custom-data-structure)
+    - [4.5.Graph class OlapBase](#graph-class-olapbase)
+    - [4.6. Graph Class OlapOnDB](#graph-class-olapondb)
+    - [4.7.Graph class OlapOnDisk](#graph-class-olapondisk)
+- [5.lgraph DB API](#5-lgraph_db-api)
+- [6.Algorithm plugin example](#6-algorithm-plug-in-example)
+
+## 1 Overview
+
+This manual will introduce the simple configuration required to use the Python interface of the TuGraph graph computing system, and explain the TuGraph Python API in conjunction with the code. For details about the functions of class ParallelBitset, OlapBase, etc., see olap-base-api.md, olap-on-db-api.md and olap-on-disk-api.md.
+
+## 2. Configuration requirements
+
+If you want to use TuGraph to write and compile your own applications, the required configuration requirements are:
+
+- Linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+- A compiler that supports C++17 requires GCC version 5.4.1 or later.
+- Cython, version 3.0a1 or above is required, and the tested version is 3.0.0a11
+
+## 3. Cython
+Cython is an efficient programming language that is a superset of Python. Cython can translate .py files into C/C++ codes and compile them into Python extension modules, which can be called through import in Python. In TuGraph, all Python procedures are compiled into Python extension modules by Cython and then used.
+
+The main advantage of using Cython is that it combines the simplicity and ease of use of Python with the performance of C/C++. The TuGraph Python interface is implemented using Cython.
+
+[Cython Documentation](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+The Olap API is used for graph computing and is implemented in C++. The usage and functions are basically the same as the C++ interface. To use the API in a Python file, the interfaces declared in procedures/algo_cython/olap_base.pxd must be imported using `cython.cimports.olap_base import *`. The Python file can only be run after being compiled by Cython.
+
+### Atomic operations
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`: If the value pointed to by ptr is equal to oldv, assign the value pointed to by ptr to newv and return True, otherwise return False.
+- `write_min[T](a: cython.pointer(T), b: T)->cython.bint`: If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_max[T](a: cython.pointer(T), b: T)->cython.bint`: If b is greater than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_add[T](a: cython.pointer(T), b: T)->cython.bint`: Add the value of b to the value pointed to by a.
+- `write_sub[T](a: cython.pointer(T), b: T)->cython.bint`: Subtract the value pointed to by a from the value of b.
+
+### Vertex collection class ParallelBitset
+- `Size() -> size_t`: Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size: size_t)`: Initializes size and data, where the length of data is (size >> 6) + 1.
+- `Clear() -> cython.void`: Empties the collection.
+- `Fill() -> cython.void`: Adds all vertices to the set.
+- `Has(i: size_t) -> cython.bint`: Checks if vertex i is in the set.
+- `Add(i: size_t) -> cython.bint`: Adds vertex i to the set.
+- `Swap(other: ParallelBitset) -> cython.void`: Exchanges elements with another ParallelBitset set.
+
+### Vertex array class ParallelVector
+- `ParallelVector[T](size_t capacity)`: Constructs a ParallelVector, where capacity is the initial capacity of the vertex array.
+- `operator[](i: size_t) -> T`: Returns the data at index i.
+- `begin() -> cython.pointer(T)`: Returns the start pointer of ParallelVector.
+- `end() -> cython.pointer(T)`: Returns the end pointer of ParallelVector. The usage of begin() and end() is similar to the begin and end pointers of the vector container, and these two pointers can be used to sequentially access the array.
+- `Back() -> T`: Returns the last data of ParallelVector.
+- `Data() -> cython.pointer(T)`: Indicates the data of the array itself.
+- `Destroy() -> cython.void`: Clears the data in the ParallelVector array and deletes the array.
+- `Size() -> size_t`: Indicates the number of data in ParallelVector.
+- `Resize(size: size_t) -> cython.void`: Changes ParallelVector to size, which should be greater than or equal to the size before the change and less than capacity.
+- `Clear() -> cython.void`: Clears the data in ParallelVector.
+- `ReAlloc(capacity: size_t) -> cython.void`: Allocates a new capacity size to ParallelVector. If the array has data, it migrates the data to the new memory.
+- `Fill(elem: T) -> cython.void`: Assigns elem to all data of ParallelVector.
+- `Append(elem: T, atomic: cython.bint = true) -> cython.void`: Adds a data to the end of ParallelVector.
+- `Swap(other: ParallelVector[T]) -> cython.void`: Exchanges data with another ParallelVector.
+- `Copy() -> ParallelVector[T]`: Copies the current ParallelVector data and stores it in the copy array.
+
+
+### Custom Data Structure
+- `Empty`: A special data type whose content is empty.
+- `EdgeUnit[EdgeData]`: Indicates the edge whose weight type is EdgeData, used to parse the input file, including three member variables:
+    - `src: size_t`: starting vertex of the edge
+    - `dst: size_t`: end of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjUnit[EdgeData]`: indicates the edge whose weight type is EdgeData, which is used in the batch calculation process and contains two member variables:
+    - `neighbor: size_t`: neighbor vertex of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjList[EdgeData]`: The adjacency list of vertices whose weight type is EdgeData, often used to represent the set of incoming and outgoing edges of vertices, including three member functions:
+    - `begin()->cython.pointer(AdjUnit[T])`: the starting pointer of the list
+    - `end()->cython.pointer(AdjUnit[T])`: the end pointer of the list
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: the data whose subscript is i
+
+### Graph class OlapBase
+- `NumVertices()->size_t`: get the number of vertices
+- `NumEdges()-> size_t`: get the number of edges
+- `OutDegree(vid: size_t)-> size_t`: out-degree of vertex vid
+- `InDegree(vid: size_t)->size_t`: in-degree of the vertex vid
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`: Allocates an array of type VertexData with size as the number of vertices
+- `AllocVertexSubset()-> ParallelBitset`: Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all outgoing edges of vertex v
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all incoming edges of vertex v
+- `Transpose()->cython.void`: transpose of a directed graph
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+    - `edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+    - `input_vertices`: specifies the number of vertices read into the graph by the array.
+
+    - `input_edges` : specifies the number of edges that the array reads into the image.
+
+    - `edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`: locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`: unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+
+TuGraph provides two batch operations to perform point-centric batch processing in parallel, which is slightly different from C++ in Python.
+
+```python
+# Function name: ProcessVertexInRange[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# lower: size_t, upper: size_t,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Executes the work function on nodes whose node numbers are between lower and upper in the Graph. The fourth parameter indicates the base of accumulation, which is 0 by default.
+# The fifth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in include/lgraph/olap_base.h
+#
+# Example usage: Count the number of vertices with edges in the parent array.
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython.pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+g is the instantiated object of graph class OlapBase
+
+```python
+# Function name: ProcessVertexActive[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# active: ParallelBitset,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Execute the work function on the nodes corresponding to 1 in the active_vertices bitset. The third parameter indicates the base of accumulation, which is 0 by default;
+# The fourth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in /include/lgraph/olap_base.h
+#
+# Usage example: Output all out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes.
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self. graph. OutDegree(vi)
+        dst: size_t
+        edges = self. graph. OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbor
+            printf("node %lu has neighbor %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+As shown in the above two examples, ProcessVertexActive and ProcessVertexInRange in Python require an additional algorithm class pointer parameter compared to their C++ counterparts. The Work function is generally used as a member function of the algorithm class to access member variables, such as in the graph and ParallelVector parent examples shown above. When calling the batch function, the Work function and the self pointer of the algorithm class are passed to the batch function.
+
+The Work function will be called in multiple threads, so the @cython.nogil decorator is added to release the Python global interpretation lock. In code executed by multiple threads, such as the Work function in the batch function, variables are better declared as C/C++ types using `dst: type` or `dst = cython.declare(type)`. This is because Python objects cannot be used in multi-threaded code.
+
+### Graph class OlapOnDB:
+Parallelize to create a directed graph:
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+Parallelize to create an undirected graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING creates a directed graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### Graph class OlapOnDisk
+
+#### ConfigBase:
+- `ConfigBase()`: Constructor
+- `std::string input_dir`: graph edge table data path
+- `std::string output_dir`: output path
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: read in graph data
+
+## 5. lgraph_db API
+Please refer to the files procedures/algo_cython/lgraph_db.pxd and lgraph_db_python.py for the lgraph_db API.
+
+The usage and functions of the interface in lgraph_db.pxd are basically the same as the C++ interface. The interface declared in lgraph_db.pxd is implemented in C++. In the py file, it must be imported by `cython.cimports.olap_db import *` and compiled by the Cython file to run.
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: Get the vid of the vertex
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: constructor, dir_path is the db path
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: set user
+- `SetUser(user: std::string)-> cython.void`: set user
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: create GraphDB
+
+### GraphDB:
+- `CreateReadTxn()-> Transaction`: create a read-only transaction
+- `CreateWriteTxn()-> Transaction`: create a write transaction
+- `ForkTxn(txn: Transaction)-> Transaction`: Copy transactions, only read transactions can be copied
+
+### Transaction:
+```
+GetVertexIndexIterator(
+                 label: std::string,
+                 field: std::string,
+                 key_start: std::string,
+                 key_end: std::string) -> VertexIndexIterator
+```
+Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v
+
+
+
+lgraph_db_python.py packages the C++ classes Galaxy and GraphDB from lgraph_db.pxd as Python classes. After compiling lgraph_db_python.py into a Python extension, you can directly access it in a Python file or from the Python command line by importing it with `import lgraph_db_python`.
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: constructor, dir_path is the db path
+- `SetCurrentUser(self, user: str password: str)-> void`: set user
+- `SetUser(self, user: std::string)-> void`: set user
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: create PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)->cython.Py_ssize_t`: address of C++ class GraphDB
+
+## 6. Algorithm plug-in example
+The following is a code example of the BFS algorithm implemented in Python:
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# Comments work as follows:
+# language_level=3: use Python3
+# cpp_locals=True: C++17 is required, and std::optional is used to manage C++ objects in Python code, which can avoid copy construction of C++ objects
+# boundscheck=False: Turn off bounds checking for indexes
+# wraparound=False: Turn off the processing of negative subscripts (similar to Python List)
+# initializedcheck=False: Turn off checking whether the memory is initialized, and the running performance will be faster after turning off the check
+# language = c++: translate this .py file to C++ instead of C file. TuGraph uses a lot of template functions, so C++ should be used
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# From procedures/algo_cython/ cimportolap_base.pxd and lgraph_db.pxd, similar to #include "xxx.h" in C++
+
+from cython.cimports.libc.stdio import printf
+# Similar to #include <stdio.h> in C++
+# Other common ones include cython.cimports.libcpp.unordered_map, etc.
+
+import time
+import lgraph_db_python
+
+@cython.cclass
+# cython.cclass indicates that BFSCore is a C-type Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty]) indicates the pointer of OlapBase[Empty], similar to OlapBase[Empty]* in C++
+    # Cython provides common types of pointers, such as cython.p_int, cython.p_char, etc.
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t declares root as a C++ size_t type variable, equivalent to root = cython.declare(size_t)
+    # Variables that do not declare a type are Python object types
+    # Declaring variable types will greatly improve performance, and in the multi-threaded part, only C/C++ type variables can be accessed
+
+    @cython.cfunc
+    # cython.cfunc indicates that Work is a C-type function, and the parameters and return values should be declared
+    # cfunc has good performance and can accept C/C++ objects as parameters and return values, but it cannot be called in other python files
+    # Similar to cython.ccall, such as Standalone function, which can be called in other python files
+    @cython.nogil
+    # cython.nogil means to release the Python global interpretation lock. In the part modified by nogil, Python objects cannot be accessed
+    # In the multi-threaded part, there should be nogil decorator
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) means that exception propagation is disabled, and Python exceptions raised inside the function will be ignored
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbor
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 means that dst has not been visited by bfs
+                if self.active_out.Add(dst):
+                    # Set dst as an active node; ParallelBitmap.Add is an atomic operation to prevent double calculation
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython. size_t:
+        self. graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self. parent. Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self. active_in. Add(self. root)
+        while num_activations > 0:
+            self. active_out. Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self. active_out. Swap(self. active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time. time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # Create OlapOnDB in parallel
+    # Cython does not support dereference operations such as *db, use db[0] to dereference
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # Get the iterator of the root node through GetVertexIndexIterator based on the root node label name, field name and field value (root_id),
+    # and get the vid through the iterator. When there is no ID_MAPPING, the vid is the same as the id in OlapOnDB
+    cost = time. time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time. time()
+    count = a. run(cython. address(olapondb), root_vid)
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb. NumVertices()
+    response["num_edges"] = olapondb. NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone is the plug-in entry in Standalone mode, modified with cython.ccall
+    # You can set parameters arbitrarily, and modify procedures/algo_cython/run_standalone.py accordingly
+    cost = time. time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config is a C++ class, config.input_dir is std::string, Python str needs to be encoded to be passed to std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # read in graph
+    cost = time. time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time. time()
+    a = BFSCore()
+    count = a. run(cython. address(graph), root)
+    # cython.address(graph), address, similar to &graph in C++
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices". format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process is the plug-in entry in embed mode and procedure mode, modified with cython.ccall
+    # The Process function must be named Process, and the parameters are lgraph_db_python.PyGraphDB and bytes
+    # The return value must be (bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # Get the address of the GraphDB object in the PyGraphDB, convert it to a pointer and pass it
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..e496945495
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,191 @@
+# TuGraph Built-in Algorithm Description
+
+> This document mainly introduces the TuGraph built-in algorithm program in detail, the community version of 6 algorithms can refer to the basic algorithm newspaper
+
+## 1.Introduction
+
+TuGraph currently contains the following 6 basic algorithms and 28 extended algorithms, a total of 34 graph algorithms:
+
+### 1.1.Basic algorithms:
+
+|    Algorithm name            | The program name |
+| :--------------------------: | :--------------: |
+|     Breadth-First Search     |       bfs        |
+|           Pagerank           |     pagerank     |
+| Single-Source Shortest Path  |       sssp       |
+| Weakly Connected Components  |       wcc        |
+| Local Clustering Coefficient |       lcc        |
+| Label Propagation Algorithm  |       lpa        |
+
+### 1.2.Extended algorithms:
+
+|            Algorithm name                    |   The program name   |
+| :------------------------------------------: | :------------------: |
+|            All-Pair Shortest Path            |         apsp         |
+|            Betweenness Centrality            |          bc          |
+|              Belief Propagation              |          bp          |
+|             Closeness Centrality             |          clce        |
+|             Common Neighborhood              |          cn          |
+|              Degree Correlation              |          dc          |
+|             Dimension Estimation             |          de          |
+|                    EgoNet                    |          en          |
+|        Hyperlink-Induced Topic Search        |         hits         |
+|                Jaccard Index                 |          ji          |
+|                    K-core                    |        kcore         |
+|                   Louvain                    |       louvain        |
+|        Multiple-source Shortest Paths        |         mssp         |
+|            Personalized PageRank             |         ppr          |
+|        Strongly Connected Components         |         scc          |
+| Speaker-listener Label Propagation Algorithm |         slpa         |
+|          Single-Pair Shortest Path           |         spsp         |
+|              Triangle Counting               |       triangle       |
+|                  Trustrank                   |      trustrank       |
+|     Weighted Label Propagation Algorithm     |         wlpa         |
+|         Weighted Pagerank Algorithm          |      wpagerank       |
+|           Maximal independent set            |         mis          |
+|                  Sybil Rank                  |      sybilrank       |
+|             Subgraph Isomorphism             | subgraph_isomorphism |
+|                    Motif                     |        motif         |
+|                   Kcliques                   |       kcliques       |
+|                    Ktruss                    |        ktruss        |
+|                    Leiden                    |        leiden        |
+
+## 2.Basic algorithms
+
+### 2.1.Breadth-First Search
+
+Breadth first Search implements the Breadth-first Search algorithm, which starts from the root vertex and traverses all accessible vertices along the width of the graph. Returns the number of vertices traversed. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 2.2.Pagerank
+
+Web page sorting program to achieve the commonly used Pagerank algorithm. The algorithm calculates the importance ranking of all vertices according to the edge and edge weight in the graph. The higher the PageRank value, the higher the importance of the vertex in the graph. The reciprocal of the number of vertices is used as the initial Rank value of each vertex, and then the Rank value of the vertices is transferred to the adjacent vertices on average according to the outgoing edges, and the transfer process is repeated until the given convergence threshold is met or the given number of iterations is reached. At the end of each pass round, a certain proportion of the Rank values of all vertices will be randomly transferred to any vertex. Please refer to the algorithm content [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 2.3.Single-Source Shortest Path
+
+The Single Source Shortest Path algorithm realizes the Single Source Shortest Path algorithm. It calculates the shortest path length from a given source vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 2.4.Weakly Connected Components
+
+The program of Weakly Connected Components has implemented the algorithm. It can calculate all the weakly connected components in the graph. A weakly connected component is a subgraph of a graph in which reachable paths exist between any two points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Connected*component*(graph_theory)](<https://en.wikipedia.org/wiki/Connected_component_(graph_theory)> "scc wiki")。
+
+### 2.5.Local Clustering Coefficient
+
+The average Clustering Coefficient program implements the Local Clustering Coefficient algorithm to calculate the coefficient of the degree of clustering between vertices in the graph. The returned results include the overall clustering coefficient and the vertex clustering coefficient. The overall agglomeration coefficient reflects the evaluation of the overall agglomeration degree in the graph, and the vertex agglomeration coefficient includes the agglomeration coefficient of any vertex, which reflects the agglomeration degree near the vertex. The higher the agglomeration coefficient, the higher the agglomeration degree. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 2.6.Label Propagation Algorithm
+
+The program implements Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and computes unauthorised graphs. In label passing, each vertex adds up all the labels received, and randomly selects one of the labels with the highest sum. The iteration converges or the algorithm terminates after a given number of rounds. The final output is a label for each vertex, and vertices with the same label value are considered to be in the same community. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+## 3.Extended algorithms
+
+### 3.1.All-Pair Shortest Path
+
+The All-Pair Shortest Path program realizes the all-pair Shortest Path algorithm and calculates the shortest path between any two points in the graph. Returns the shortest path length between any pair of vertices where the path exists. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 3.2.Betweenness Centrality
+
+Betweenness Centrality algorithm is implemented in Betweenness centrality program to estimate the betweenness centrality value of all vertices in a graph. The value of intermediate centrality reflects the possibility that any shortest path in the graph passes through the vertex, and the higher the value, the more shortest paths pass through the vertex. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 3.3.Belief Propagation
+
+The Belief Propagation algorithm is implemented in the confidence propagation program. Given the edge distribution of the observed vertices, the algorithm estimates the edge distribution of the unobserved vertices by using the mechanism of passing messages among vertices. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 3.4.Closeness Centrality
+
+The Distance Centrality program implements the Closeness Centrality algorithm, which estimates the average shortest path length from any node to other nodes in the graph. A smaller distance centrality value indicates that the node has a smaller average shortest distance to other nodes, meaning it is more centrally located in the graph from a geometric perspective. The calculation requires specifying the number of sampling points, and the algorithm computes the centrality values for each of these sampling points. For the algorithm content, please refer to [https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki").
+
+### 3.5.Common Neighborhood
+
+The Common Neighborhood program implements the common Neighborhood algorithm to count the number of common neighbors between any given pair of neighboring vertices. Given several pairs of vertices to be queried, the result is the number of common neighbors of any pair of vertices to be queried.
+
+### 3.6.Degree Correlation
+
+The Degree Correlation algorithm is implemented in the degree correlation program. It calculates the degree correlation degree of a graph by calculating the Pearson correlation coefficient between any adjacent vertex pairs, which can be used to characterize the correlation degree between high-degree vertices in the graph. A higher degree of correlation indicates a higher degree of correlation between vertices of higher degree in the graph. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 3.7.Dimension Estimation
+
+The diameter Estimation program implements the Dimension Estimation algorithm. The algorithm calculates the length of the longest shortest path in the graph, which is used to characterize the diameter of the graph. Please refer to the algorithm content[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### 3.8.EgoNet
+
+The EgoNet algorithm requires a given root vertex and K value, and takes the root vertex as the source vertex to conduct a width-first search to find the subgraph composed of all neighbors within K degrees. The found subgraph is called the EgoNet of the root vertex.
+
+### 3.9.Hyperlink-Induced Topic Search
+
+The Hyperlink Topic Search algorithm implements the Hyperlink-induced topic search algorithm, which assumes that each vertex has two attributes: Authority and Hub. A good hub vertex should point to many vertices with high authority. And a good authority vertex should be pointed to by many vertices of high pivot type. The algorithm returns the authority value and the hub value for each vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 3.10.Jaccard Index
+
+The Jaccard coefficient program implements the Jaccard Index algorithm. The algorithm calculates the Jaccard coefficient between a given pair of vertices, which can be used to represent the similarity of the two vertices. A higher Jaccard coefficient indicates a higher degree of similarity between pairs of vertices. Given several pairs of vertices with the query, the Jaccard coefficients of these pairs are returned. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### 3.11.K-core
+
+k accounting method implements k-core algorithm. The algorithm computes the number of kernels of all vertices, or finds all K-nucleon graphs in the graph. K-nucleon graph is a special subgraph in which the degree of any vertex is not less than a given K value. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Degeneracy\_(graph_theory)](<https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)> "kcore wiki")。
+
+### 3.12.Louvain
+
+The Louvain community discovery program implements the Fast-unfolding algorithm. The algorithm is a community discovery algorithm based on modularity. It maximizes the modularity of the graph by constantly merging vertex communities, and can discover the hierarchical community structure. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 3.13.Multiple-source Shortest Paths
+
+The multisource Shortest Paths program implements the multiple-source Shortest Paths algorithm to calculate the shortest path value to any vertex from the given Multiple source vertices. Where, the shortest path value of multiple source vertices to a vertex is the minimum value of the shortest path from each source vertex to the vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 3.14.Personalized PageRank
+
+Personalized web ranking program has Personalized PageRank algorithm. According to the given source vertex, the algorithm calculates the importance ranking of all vertices to the source vertex based on the source vertex. The higher the Rank value, the more important the vertex is to the source vertex. Unlike PageRank, the source vertex Rank value is 1, the rest of the vertex Rank value is 0; And a certain proportion of Rank value will be immediately transferred back to the source vertex after each round of transmission. Please refer to the algorithm content [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 3.15.Strongly Connected Components
+
+Strongly Connected component program realizes the Strongly Connected Components algorithm. The algorithm computes all strongly connected components of the graph, which is a subgraph of the graph that can start from any vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 3.16.Speaker-listener Label Propagation Algorithm
+
+The program realizes the Speaker-listener Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and historical tag record, which is an extension of tag propagation algorithm. Different from the label propagation algorithm, this algorithm records the historical labels of all vertices. When the labels are accumulated in the iteration, the historical labels are also counted. The final output is all the historical label records for each vertex. Please refer to the paper for the algorithm content:“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 3.17.Single-Pair Shortest Path
+
+The program of the shortest path between two points implements the Bidirectional point-first Search algorithm. It searches forward width First along the outgoing edge from the starting point and reverse width first along the incoming edge from the end point on the directed undirected graph. The shortest path length from the starting point to the ending point is determined by traversing the vertices of the starting point and the ending point together. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 3.18.Triangle Counting
+
+The Triangle-counting algorithm is implemented to calculate the number of triangles in an undirected graph, which can be used to characterize the correlation degree of the vertices in the graph. The higher the number of triangles, the higher the degree of correlation of the vertices in the graph. For the algorithm content, please refer to the paper, "Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study".
+
+### 3.19.Trustrank
+
+The Trust Index Sorting Algorithm implements the Trustrank algorithm, which can calculate the Trust Index of any vertex based on a given whitelist. The higher the trust score, the less likely the vertex is to be illegal. Please refer to the algorithm content for details. [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 3.20.Weighted Label Propagation Algorithm
+
+Weighted Label Propagation Algorithm is implemented in the program. = Different from the label propagation algorithm, the label transmission is related to the weight of the edge. During label transmission, the weight of each vertex will be accumulated according to the incoming edge of the label, and the label with the highest sum will be randomly selected. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 3.21.Weighted Pagerank Algorithm
+
+Weighted Pagerank is implemented in the weighted Pagerank algorithm. Different from PageRank algorithm, the transfer of Rank value is related to the weight of the edge. The Rank value of the vertex will be transferred to the adjacent vertices according to the weight of the edge. Please refer to the algorithm content[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 3.22.Maximal independent set
+
+Maximal independent set algorithm implements Maximal Independent Set algorithm. A maximum independent set means that there are no vertices outside the independent set that can join it. A graph may have many MIS that vary greatly in size, and the algorithm finds one of them. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### 3.23.Sybil Rank
+
+Sybil detection algorithm implements Sybil Rank algorithm. The SybilRank algorithm starts from non-Sybil nodes and performs a random walk with premature termination. Please refer to the paper for the algorithm content:“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 3.24.Subgraph Isomorphism
+
+The subgraph matching algorithm implements the subgraph_isomorphism algorithm. The subgraph_isomorphism algorithm matches all nodes in the whole graph and outputs the number of times each node is matched. Algorithm Content Reference [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 3.25.Motif
+
+Pattern matching algorithm implements motif algorithm. motif algorithm matches k-order subgraphs for the specified nodes, and finally outputs the number of each kind of K-order subgraphs for each specified node. Each K-order subgraph is represented by a 64-bit integer, and the $i \times k + j$bit is 1, indicating that there is an edge i->j in the subgraph. Algorithm Content Reference [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### 3.26.Kcliques
+
+The K-order clique counting algorithm implements the k-cliques algorithm. The k-cliques algorithm calculates the number of all K-order complete subgraphs in the graph, and finally outputs the number of k-order complete subgraphs of each node. Algorithm Content Reference [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### 3.27.Ktruss
+
+The k-order truss counting algorithm implements the k-truss algorithm. A k-truss is a subgraph in which each edge is the edge of at least k-2 triangles. The k-truss algorithm finds out the k-truss subgraph of the graph, and finally outputs the neighbor node list of each node in the subgraph. Algorithm Content Reference[https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+
+### 3.28.Leiden
+
+Leiden algorithm implements Leiden's algorithm. leiden algorithm is a community discovery algorithm based on modularity. Compared with louvain algorithm, leiden algorithm has the advantage that Leiden algorithm detects the broken links in the community to ensure that each community has good connectivity. Algorithm Content Reference [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..dc955b3b91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..689128d8a0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,100 @@
+# Learning Tutorial
+
+> This document is designed as a guide for TuGraph users. Before reading the detailed documentation, users should first read this document to have a general understanding of the graph learning process of TuGraph, which will make it easier to read the detailed documentation later. The guide program is based on a simple program instance of TuGraph, and we will focus on its usage.
+
+## 1. Introduction to TuGraph Graph Learning Module
+Graph learning is a machine learning method that utilizes the topological information of a graph structure to analyze and model data. Unlike traditional machine learning methods, graph learning uses graph structures where vertices represent entities in data and edges represent relationships between entities. By extracting features and patterns from these vertices and edges, deep associations and patterns can be revealed in data that can be used in various practical applications.
+
+The TuGraph Graph Learning Module is a graph learning module based on a graph database that provides four sampling operators: Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. These operators can be used to sample vertices and edges in a graph to generate training data. The sampling process is performed in a parallel computing environment, providing high efficiency and scalability.
+
+After sampling, the obtained training data can be used to train a model that can be used for various graph learning tasks such as prediction and classification. Through training, the model can learn the relationships between vertices and edges in the graph, allowing for prediction and classification of new vertices and edges. In practical applications, this module can be used to handle large-scale graph data such as social networks, recommendation systems, and bioinformatics.
+
+## 2. Run Process
+The TuGraph graph learning module samples graph data in TuGraph, and the sampled vertices and edges are used as graph learning features for learning and training. The operation process is shown in the figure below:
+
+![Alt text](../../../../images/learn_flow_chart_en.png)
+
+## 3. TuGraph compilation and data preparation
+For TuGraph compilation, please refer to: [Compile](../../5.installation&running/6.compile.md)
+Execute in the build/output directory:
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+This command copies the relevant files of the dataset to the build/output directory.
+
+## 4. Data Import
+Please refer to [Data Import](../../6.utility-tools/1.data-import.md) for data import.
+
+Taking the cora dataset as an example for the import process:
+
+Execute in the build/output directory:
+
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Where cora.conf is the graph schema file representing the format of the graph data. coradb is the imported graph data file name representing the storage location of the graph data.
+
+## 5. Feature Conversion
+Since the features in graph learning are generally represented as long float arrays, TuGraph does not support loading float array types, so they can be imported as string types and converted to char* for subsequent storage and access, and the implementation details can refer to the feature_float.cpp file.
+
+The specific execution process is as follows:
+
+Compile the imported plugin in the build directory.（Skip if TuGraph has been compiled）:
+
+`make feature_float_embed`
+
+Execute in the build/output directory:
+
+`./algo/feature_float_embed ./coradb`
+
+Then the conversion can be performed.
+
+## 6. Sampling Operators and Compilation
+TuGraph implements an operator for obtaining the full graph data and four sampling operators at the cython layer, as follows:
+
+### 6.1.Sampling Operator Introduction
+|Sampling Operator | Sampling Method |
+| --- | --- |
+|GetDB | Get the graph data from the database and convert it into the required data structure |
+|Neighbor Sampling | Sample the neighboring nodes of the given node to obtain the sampling subgraph |
+|Edge Sampling | Sample the edges in the graph according to the sampling rate to obtain the sampling subgraph |
+|Random Walk Sampling | Conduct a random walk based on the given node to obtain the sampling subgraph |
+|Negative Sampling | Generate a subgraph of non-existent edges|
+
+### 6.2.Compilation
+Skip if TuGraph has been compiled.
+Execute in the tugraph-db/build folder:
+
+`make -j2`
+
+Or execute in the tugraph-db/learn/procedures folder:
+
+`python3 setup.py build_ext -i`
+
+Once the algorithm so is obtained, it can be used by importing it in Python.
+
+## 7. Model Training and Storage
+TuGraph calls the cython layer operator at the Python layer to implement graph learning and training.
+
+The usage of the TuGraph graph learning module is as follows:
+
+Execute in the build/output folder:
+
+`python3 train_full_cora.py --model_save_path ./cora_model`
+
+Then training can be performed.
+
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+## 8. Model Loading
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+Before using a saved model, it is necessary to load it first. In the code above, the trained model is loaded using the provided code.
+
+After loading the model, we can use it to make predictions and classifications for new vertices and edges. For prediction, we can input one or multiple vertices and the model will output corresponding prediction results. For classification, we can input the whole graph, and the model will classify the vertices and edges in the graph to achieve the task goal.
+
+Using a trained model can save time and resources compared to retraining the model. Additionally, since the model has already learned the relationships between vertices and edges in the graph, it can adapt well to new data and improve the accuracy of predictions and classifications.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..c649fa50e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,102 @@
+# Sampling API
+
+>This document provides a detailed guide on using the Sampling API of TuGraph.
+
+## 1. Overview
+This manual introduces the Sampling API using TuGraph.
+
+## 2. Graph Data Instantiation
+Before the sampling operation, load the graph data according to the graph data path, and map it into the olapondb graph analysis class, the code is as follows:
+
+```python
+galaxy = PyGalaxy(args.db_path) # Create a galaxy instance based on the path
+galaxy.SetCurrentUser(args.username, args.password) # Set the current user
+db = galaxy.OpenGraph('default', False) # Open the graph database specified by db
+txn = db.CreateReadTxn() # Create a transaction instance
+olapondb = PyOlapOnDB('Empty', db, txn) # Instantiate OlapOnDB based on the graph loading method, graph database instance, and transaction instance
+del txn
+del db
+del galaxy
+```
+## 3. Introduction to Sampling Operators
+The graph sampling operator is implemented in the cython layer and is used to sample the input graph. The generated NodeInfo is used to save point information such as feature attributes and label attributes, and EdgeInfo is used to save edge information. These metadata information can be used for features Extraction, network embedding and other tasks. Currently, the TuGraph graph learning module supports five sampling operators: GetDB, NeighborSampling, EdgeSampling, RandomWalkSampling, and NegativeSampling.
+
+### 3.1.RandomWalk Operator
+Random walks are performed a specified number of times around the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.2.NeighborSampling Operator
+A certain number of nodes are sampled from the first-degree neighbors of the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.3.NegativeSampling Operator
+The negative sampling algorithm is used to generate a subgraph of non-existent edges.
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+num_samples: The number of false edges to be generated.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.4.EdgeSampling Operator
+The edge sampling algorithm is used to generate a subgraph of sampled edges.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_rate: The sampling rate of the edges to be selected.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.5.GetDB Operator
+Get the graph data from the database and convert it into the required data structure.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+## 4. User-Defined Sampling Algorithm
+Users can also implement a custom sampling algorithm through the TuGraph Olap interface. For the interface document, see [here](../2.olap/5.python-api.md). This document mainly introduces the interface of related functions used by the graph sampling algorithm design.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..510f3d4fcd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,96 @@
+# Training
+> This document details how to use TuGraph for training Graph Neural Networks (GNNs).
+
+## 1. Training
+When using TuGraph's graph learning module for training, it can be divided into two categories: full graph training and mini-batch training.
+
+Full graph training involves loading the entire graph from the TuGraph db into memory and training the GNN. Mini-batch training uses the sampling operator of the TuGraph graph learning module to sample the entire graph data and then input it into the training framework for training.
+
+## 2. Mini-Batch Training
+Mini-batch training requires the use of TuGraph's graph learning module's sampling operators, which currently support Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. The sampling result of the TuGraph graph learning module's sampling operator is returned in the form of a List.
+
+The following takes Neighbor Sampling as an example to introduce how to convert the sampled results into the training framework for format conversion.
+The user needs to provide a Sample class:
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. Load graph data
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+        # 2. Sampling method, the result is stored in NodeInfo and EdgeInfo
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+        # 3. Format conversion of the result to fit the training format
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+As shown in the code, the graph data is first loaded into memory. Then use the sampling operator to sample the graph data, and the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and the stored information results are as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Finally, we format the result to fit the training format. Here we use the DGL training framework, so we construct a DGL Graph using the result data, and then return the DGL Graph.
+
+Once we provide the TuGraphSample class, we can use it for Mini-Batch training. Let the data loading part of DGL use the sampler instance of TuGraphSample as follows:
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+Use DGL for model training:
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+## 3. Full-Batch training
+Full-Batch training of GNNs (Graph Neural Networks) is a type of training that involves processing the entire training dataset at once. It is one of the simplest and most straightforward training methods for GNNs, where the entire graph is treated as a single instance. In full-batch training, the entire dataset is loaded into memory and the model is trained on the entire graph. This type of training is especially useful for small to medium-sized graphs, and is mainly used for static graphs that do not change over time.
+```python
+getdb. Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+The full graph are then fed into the training framework for training.
+Full code: learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..556c3c1fd0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,101 @@
+# Heterogeneous Graph
+
+> This document describes how to use heterogeneous graphs for training.
+
+## 1. Introduction to Heterogeneous Graph
+A heterogeneous graph is a graph structure composed of nodes and edges of different types. In a heterogeneous graph, nodes and edges can have diverse attributes and relationships, representing different entities and their complex associations.
+
+In a heterogeneous graph, node types can represent different entities such as users, products, topics, etc., while edge types represent the relationships between different entities, such as the follow relationship between users, or the purchase relationship between users and products. Nodes and edges can have different attributes.
+
+Heterogeneous graphs provide a powerful graph model that can better express and analyze real-world systems with multiple entity types and complex relationships. They have broad application prospects and research value in various fields of data analysis and applications.
+
+## 2. Creating a Heterogeneous Graph
+In TuGraph, a heterogeneous graph is composed of a series of edge relationships. Each relationship is defined by a triplet of strings: (source node type, edge type, target node type). The creation of a heterogeneous graph is similar to that of a homogeneous graph, but the triplet definition needs to be specified when creating the graph. The following example demonstrates:
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+In the code snippet above, the fourth parameter is the edge relationship definition of the heterogeneous graph. By specifying this parameter, you can select specific node and edge types for graph construction and training. If this parameter is not specified, all node and edge types will be used for graph construction by default.
+
+## 3. Heterogeneous graph query interface
+To facilitate user usage, TuGraph provides interfaces for querying node and edge types when the fourth parameter is given. The following examples demonstrate these interfaces:
+
+### 3.1 Querying Node Types
+```python
+olapondb.ntypes()
+```
+The return value is a list of node types, such as ['node1', 'node2', 'node3'].
+
+### 3.2 Querying Edge Types
+```python
+olapondb.etypes()
+``` 
+The return value is a list of edge types, such as ['edge1', 'edge2', 'edge3'].
+
+### 3.3 Querying Node and Edge Types
+```python
+olapondb.metagraph()
+```
+The return value is a list of string triplets (source node type, edge type, target node type), such as
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')].
+
+## 4 Heterogeneous graph output format
+The same as the homogeneous graph, the sampling data results of the heterogeneous graph are also stored in NodeInfo and EdgeInfo.
+Output data can be obtained in the following ways.
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+
+The result of its stored information is as follows:
+| Graph Data | Storage Location |
+| --- | --- |
+| Edge Source | EdgeInfo[0] |
+| Edge Destination | EdgeInfo[1] |
+| Edge Type | EdgeInfo[2] |
+| Vertex ID | NodeInfo[0] |
+| Vertex Feature | NodeInfo[1] |
+| Vertex Label | NodeInfo[2] |
+| Vertex Type | NodeInfo[3] |
+
+## 5. Training Heterogeneous Graphs
+The goal of training a heterogeneous graph is to learn the representation of nodes and edges in the graph for subsequent tasks such as node classification, link prediction, and graph clustering. To achieve this goal, researchers have proposed a variety of models based on graph neural networks (GNNs). These models update the representation of nodes by aggregating the information of neighboring nodes, thereby capturing the complex relationships in the graph structure.
+
+Since heterogeneous graphs contain nodes and edges of multiple types, it is necessary to consider how to process these different types of information when designing GNN models. One common approach is to design different aggregation functions to process different types of neighboring nodes. In addition, it is also necessary to consider how to integrate these different types of information together so that the model can effectively learn the representation of nodes and edges.
+
+TuGraph provides a method for training heterogeneous graphs using the ogbn-mag dataset, which can be used for reference.
+
+The official docker provided by TuGraph does not yet provide an environment for heterogeneous graph training, so users need to install relevant dependency packages by themselves.
+Before training, you need to download the ogb and pandas packages. The specific installation method is as follows:
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+The training code looks like this:
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    # print('load time', load_time - s, 'train_time', train_time - load_time)
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+The complete training code can be found in tugraph/learn/examples/train_full_mag.py.
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..fbc920ad54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+TuGraph Learn
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..f4d9296bec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+Stored Procedures And OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/conf.py b/docs/docusaurus/versions/version-4.2.0/en-US/source/conf.py
new file mode 100644
index 0000000000..7712aee00e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.2.0/en-US/source/index.rst b/docs/docusaurus/versions/version-4.2.0/en-US/source/index.rst
new file mode 100644
index 0000000000..24b08fe10f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/en-US/source/index.rst
@@ -0,0 +1,23 @@
+TuGraph DB
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions/version-4.2.0/images/architecture-en.png b/docs/docusaurus/versions/version-4.2.0/images/architecture-en.png
new file mode 100644
index 0000000000..edf2bc873a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/architecture-en.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/architecture.png b/docs/docusaurus/versions/version-4.2.0/images/architecture.png
new file mode 100644
index 0000000000..e8eeea87e0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/architecture.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/account-add-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/account-add-button.png
new file mode 100644
index 0000000000..5b9c7e9378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/account-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/account-add.png b/docs/docusaurus/versions/version-4.2.0/images/browser/account-add.png
new file mode 100644
index 0000000000..b0b5068027
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/account-add.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/account-delete.png b/docs/docusaurus/versions/version-4.2.0/images/browser/account-delete.png
new file mode 100644
index 0000000000..bfe49fb093
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/account-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/account-disable.png b/docs/docusaurus/versions/version-4.2.0/images/browser/account-disable.png
new file mode 100644
index 0000000000..f8ff994f21
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/account-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/account-edit.png b/docs/docusaurus/versions/version-4.2.0/images/browser/account-edit.png
new file mode 100644
index 0000000000..939c374f25
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/account-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/account-enable.png b/docs/docusaurus/versions/version-4.2.0/images/browser/account-enable.png
new file mode 100644
index 0000000000..ddc8cef578
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/account-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/account.png b/docs/docusaurus/versions/version-4.2.0/images/browser/account.png
new file mode 100644
index 0000000000..0aa0cd195c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/account.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/db_basic.png b/docs/docusaurus/versions/version-4.2.0/images/browser/db_basic.png
new file mode 100644
index 0000000000..b78298825b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/db_basic.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/db_configuration.png b/docs/docusaurus/versions/version-4.2.0/images/browser/db_configuration.png
new file mode 100644
index 0000000000..2de3da502c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/db_configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-button.png
new file mode 100644
index 0000000000..dd8966d0d3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-clear.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-clear.png
new file mode 100644
index 0000000000..ee5d3c92a9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-clear.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-collapse.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-collapse.png
new file mode 100644
index 0000000000..e053061834
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-collapse.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-delete.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-delete.png
new file mode 100644
index 0000000000..5aefa20c43
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand-after.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand-after.png
new file mode 100644
index 0000000000..371efb6e6b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand-after.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand-before.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand-before.png
new file mode 100644
index 0000000000..80e74174af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand-before.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand-custom.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand-custom.png
new file mode 100644
index 0000000000..bed0a73705
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand-custom.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand.png
new file mode 100644
index 0000000000..75b0caf2b9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-expand.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-fixed.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-fixed.png
new file mode 100644
index 0000000000..aac4a18573
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-fixed.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-lasso.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-lasso.png
new file mode 100644
index 0000000000..53f743925b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-lasso.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-legend-chart.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-legend-chart.png
new file mode 100644
index 0000000000..0ddb63b926
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-legend-chart.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-legend-list.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-legend-list.png
new file mode 100644
index 0000000000..07d0bf0a4c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-legend-list.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-retrieval.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-retrieval.png
new file mode 100644
index 0000000000..57eafece0e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-retrieval.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-unfix.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-unfix.png
new file mode 100644
index 0000000000..80fa2c8b72
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-canvas-unfix.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-operation-area.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-operation-area.png
new file mode 100644
index 0000000000..b251837e26
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-operation-area.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-attributefilter.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-attributefilter.png
new file mode 100644
index 0000000000..8883301d09
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-attributefilter.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-configurequery.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-configurequery.png
new file mode 100644
index 0000000000..d294a8616b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-configurequery.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-query.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-query.png
new file mode 100644
index 0000000000..b745e4d5c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-query.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png
new file mode 100644
index 0000000000..afbaf3bfd5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-statisticalfilter.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-statisticalfilter.png
new file mode 100644
index 0000000000..7c2e3b635e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-queryfilter-statisticalfilter.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-appearance-Button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-appearance-Button.png
new file mode 100644
index 0000000000..dab00330b7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-appearance-Button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-appearance.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-appearance.png
new file mode 100644
index 0000000000..330ad3128e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-appearance.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-layout-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-layout-button.png
new file mode 100644
index 0000000000..49516d6427
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-layout-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-layout-parameters.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-layout-parameters.png
new file mode 100644
index 0000000000..d02772bfd9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphanalysis-style-layout-parameters.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addedge-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addedge-button.png
new file mode 100644
index 0000000000..b38900728e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addedge-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addedge.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addedge.png
new file mode 100644
index 0000000000..39eca4a772
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addedge.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addvertex-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addvertex-button.png
new file mode 100644
index 0000000000..e616ce0f89
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addvertex-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addvertex.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addvertex.png
new file mode 100644
index 0000000000..df56d537bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-addvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-button.png
new file mode 100644
index 0000000000..abf1fab48f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-editedge.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-editedge.png
new file mode 100644
index 0000000000..eb7206b771
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-editedge.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-editvertex.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-editvertex.png
new file mode 100644
index 0000000000..eb252761bf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-editvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-exportmodel-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-exportmodel-button.png
new file mode 100644
index 0000000000..acbaa80189
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-exportmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-exportmodel.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-exportmodel.png
new file mode 100644
index 0000000000..4991dc7378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-exportmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import-csv.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import-csv.png
new file mode 100644
index 0000000000..2301c01cfc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import-csv.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import-datamapping.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import-datamapping.png
new file mode 100644
index 0000000000..5d55861a95
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import-datamapping.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import-success.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import-success.png
new file mode 100644
index 0000000000..20a48beb0f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import-success.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import.png
new file mode 100644
index 0000000000..0154bac688
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-import.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-importmodel-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-importmodel-button.png
new file mode 100644
index 0000000000..bb7822aaef
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-importmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-importmodel.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-importmodel.png
new file mode 100644
index 0000000000..252b082100
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-importmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-list-copy.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-list-copy.png
new file mode 100644
index 0000000000..ea210495fc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-list-copy.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-list-delete.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-list-delete.png
new file mode 100644
index 0000000000..aeba09b532
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-list-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-list-search.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-list-search.png
new file mode 100644
index 0000000000..9313c8eb7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-list-search.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-select.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-select.png
new file mode 100644
index 0000000000..18bfb3be74
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild-select.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild.png
new file mode 100644
index 0000000000..cd1f0bda1c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphbuild.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-configure.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-configure.png
new file mode 100644
index 0000000000..91fa18814f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-creategraph.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-deletegraph-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-deletegraph-button.png
new file mode 100644
index 0000000000..34a4efd42a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-deletegraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-editgraph-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-editgraph-button.png
new file mode 100644
index 0000000000..773798b78b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-editgraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-editgraph.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-editgraph.png
new file mode 100644
index 0000000000..f6cc706f41
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-editgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-homepage.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-homepage.png
new file mode 100644
index 0000000000..c3af5618ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-homepage.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-selecttemplate.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-selecttemplate.png
new file mode 100644
index 0000000000..8a19d8da39
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-selecttemplate.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-statistics-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-statistics-button.png
new file mode 100644
index 0000000000..cdb25ed397
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-statistics-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-statistics-refresh-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-statistics-refresh-button.png
new file mode 100644
index 0000000000..e2ec35cbe1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-statistics-refresh-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-statistics.png b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-statistics.png
new file mode 100644
index 0000000000..49db6e652f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/graphmanagement-statistics.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/login.png b/docs/docusaurus/versions/version-4.2.0/images/browser/login.png
new file mode 100644
index 0000000000..3f4109b059
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/login.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/pathquery-configuration.png b/docs/docusaurus/versions/version-4.2.0/images/browser/pathquery-configuration.png
new file mode 100644
index 0000000000..579a7d99ee
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/pathquery-configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/pathquery-result.png b/docs/docusaurus/versions/version-4.2.0/images/browser/pathquery-result.png
new file mode 100644
index 0000000000..0cd90cad46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/pathquery-result.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/pathquery-select.png b/docs/docusaurus/versions/version-4.2.0/images/browser/pathquery-select.png
new file mode 100644
index 0000000000..3c5d0f7751
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/pathquery-select.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-bookmark-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-bookmark-button.png
new file mode 100644
index 0000000000..9a6f73bf7c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-bookmark-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-bookmark.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-bookmark.png
new file mode 100644
index 0000000000..a93315ab17
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-bookmark.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-button.png
new file mode 100644
index 0000000000..cd00d7f3fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-download-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-download-button.png
new file mode 100644
index 0000000000..ec59f7a0ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-download-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-execute-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-execute-button.png
new file mode 100644
index 0000000000..6c38e68c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-execute-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-gqltips.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-gqltips.png
new file mode 100644
index 0000000000..bdabee92e7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-gqltips.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-download.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-download.png
new file mode 100644
index 0000000000..48890083fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-download.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-downloadtxt.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-downloadtxt.png
new file mode 100644
index 0000000000..3554ef592c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-downloadtxt.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-fullscreen-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-fullscreen-button.png
new file mode 100644
index 0000000000..13925db74f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-fullscreen-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-fullscreen-close.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-fullscreen-close.png
new file mode 100644
index 0000000000..2a63926742
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-fullscreen-close.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-fullscreen.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-fullscreen.png
new file mode 100644
index 0000000000..2dcf0ca0b4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-fullscreen.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-graph.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-graph.png
new file mode 100644
index 0000000000..9b3edecb5f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-insert-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-insert-button.png
new file mode 100644
index 0000000000..8879b2c4bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-insert-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-insert.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-insert.png
new file mode 100644
index 0000000000..2cd23b6e84
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-insert.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-jsontxt.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-jsontxt.png
new file mode 100644
index 0000000000..5f265cfff1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-jsontxt.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-jsonview.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-jsonview.png
new file mode 100644
index 0000000000..8a774f91c9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-jsonview.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-list.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-list.png
new file mode 100644
index 0000000000..4692c49eca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-result-list.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-schema-graph.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-schema-graph.png
new file mode 100644
index 0000000000..ccc9e3126b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-schema-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-schema-list.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-schema-list.png
new file mode 100644
index 0000000000..3649b41272
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-schema-list.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-selectgql.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-selectgql.png
new file mode 100644
index 0000000000..1ea624b81f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-selectgql.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-selectgraph.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-selectgraph.png
new file mode 100644
index 0000000000..6dc14e486d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-selectgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/query-view.png b/docs/docusaurus/versions/version-4.2.0/images/browser/query-view.png
new file mode 100644
index 0000000000..8d1884ad82
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/query-view.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-configure.png b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-configure.png
new file mode 100644
index 0000000000..166e54cb75
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-creategraph.png b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-graphtab.png b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-graphtab.png
new file mode 100644
index 0000000000..0f7980bc46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-graphtab.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-result.png b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-result.png
new file mode 100644
index 0000000000..2a2a59ce02
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-result.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-selectdemo.png b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-selectdemo.png
new file mode 100644
index 0000000000..7dda3f06b0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/quickstart-selectdemo.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/role-add-button.png b/docs/docusaurus/versions/version-4.2.0/images/browser/role-add-button.png
new file mode 100644
index 0000000000..a4590ac431
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/role-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/role-add.png b/docs/docusaurus/versions/version-4.2.0/images/browser/role-add.png
new file mode 100644
index 0000000000..8f56b24bd7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/role-add.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/role-delete.png b/docs/docusaurus/versions/version-4.2.0/images/browser/role-delete.png
new file mode 100644
index 0000000000..3c09e7caa8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/role-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/role-disable.png b/docs/docusaurus/versions/version-4.2.0/images/browser/role-disable.png
new file mode 100644
index 0000000000..eb2e355d58
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/role-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/role-edit.png b/docs/docusaurus/versions/version-4.2.0/images/browser/role-edit.png
new file mode 100644
index 0000000000..7b5db6e48c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/role-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/role-enable.png b/docs/docusaurus/versions/version-4.2.0/images/browser/role-enable.png
new file mode 100644
index 0000000000..40b7909289
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/role-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/vertexquery-criteria.png b/docs/docusaurus/versions/version-4.2.0/images/browser/vertexquery-criteria.png
new file mode 100644
index 0000000000..b5f95c3d83
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/vertexquery-criteria.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/browser/vertexquery.png b/docs/docusaurus/versions/version-4.2.0/images/browser/vertexquery.png
new file mode 100644
index 0000000000..97aa28122b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/browser/vertexquery.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-1.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-1.png
new file mode 100644
index 0000000000..c7202ff3de
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-1.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-10.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-10.png
new file mode 100644
index 0000000000..d6ed55c8bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-10.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-2.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-2.png
new file mode 100644
index 0000000000..6fc79fde54
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-2.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-3.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-3.png
new file mode 100644
index 0000000000..0e59f028c7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-3.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-4.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-4.png
new file mode 100644
index 0000000000..b606ec8bb8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-4.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-5.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-5.png
new file mode 100644
index 0000000000..18d5845ec1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-5.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-6.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-6.png
new file mode 100644
index 0000000000..d939108e3b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-6.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-7.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-7.png
new file mode 100644
index 0000000000..5c5d1800af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-7.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-8.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-8.png
new file mode 100644
index 0000000000..5beb0628b3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-8.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-9.png b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-9.png
new file mode 100644
index 0000000000..d04282d95a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/cloud-deployment-9.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/contact-en.png b/docs/docusaurus/versions/version-4.2.0/images/contact-en.png
new file mode 100644
index 0000000000..47ac8b8297
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/contact-en.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/contact-zh.png b/docs/docusaurus/versions/version-4.2.0/images/contact-zh.png
new file mode 100644
index 0000000000..75c49540b5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/contact-zh.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/htap-en.png b/docs/docusaurus/versions/version-4.2.0/images/htap-en.png
new file mode 100644
index 0000000000..85479ac1e1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/htap-en.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/htap.png b/docs/docusaurus/versions/version-4.2.0/images/htap.png
new file mode 100644
index 0000000000..c7764a3fa7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/htap.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/learn_flow_chart_en.png b/docs/docusaurus/versions/version-4.2.0/images/learn_flow_chart_en.png
new file mode 100644
index 0000000000..c9e55a52a5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/learn_flow_chart_en.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/learn_flow_chart_zh.png b/docs/docusaurus/versions/version-4.2.0/images/learn_flow_chart_zh.png
new file mode 100644
index 0000000000..9977dcfb6c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/learn_flow_chart_zh.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/multi-level-Interfaces-en.png b/docs/docusaurus/versions/version-4.2.0/images/multi-level-Interfaces-en.png
new file mode 100644
index 0000000000..b7de07422c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/multi-level-Interfaces-en.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/multi-level-Interfaces.png b/docs/docusaurus/versions/version-4.2.0/images/multi-level-Interfaces.png
new file mode 100644
index 0000000000..2c9694a476
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/multi-level-Interfaces.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/partners/fu.png b/docs/docusaurus/versions/version-4.2.0/images/partners/fu.png
new file mode 100644
index 0000000000..a238d3a5ce
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/partners/fu.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/partners/hust.png b/docs/docusaurus/versions/version-4.2.0/images/partners/hust.png
new file mode 100644
index 0000000000..e1219f932b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/partners/hust.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/partners/oceanbase.png b/docs/docusaurus/versions/version-4.2.0/images/partners/oceanbase.png
new file mode 100755
index 0000000000..978297d9bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/partners/oceanbase.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/partners/secretflow.png b/docs/docusaurus/versions/version-4.2.0/images/partners/secretflow.png
new file mode 100644
index 0000000000..d386ce72fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/partners/secretflow.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/partners/whaleops.png b/docs/docusaurus/versions/version-4.2.0/images/partners/whaleops.png
new file mode 100644
index 0000000000..7ace477cf4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/partners/whaleops.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/partners/zju.png b/docs/docusaurus/versions/version-4.2.0/images/partners/zju.png
new file mode 100644
index 0000000000..704f0bb867
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/partners/zju.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/round-the-world/flight_page.jpg b/docs/docusaurus/versions/version-4.2.0/images/round-the-world/flight_page.jpg
new file mode 100644
index 0000000000..bd296766c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/round-the-world/flight_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/round-the-world/main_page.jpg b/docs/docusaurus/versions/version-4.2.0/images/round-the-world/main_page.jpg
new file mode 100644
index 0000000000..2edc617c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/round-the-world/main_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/round-the-world/search_example.jpg b/docs/docusaurus/versions/version-4.2.0/images/round-the-world/search_example.jpg
new file mode 100644
index 0000000000..154d387721
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/round-the-world/search_example.jpg differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-body-cypher1.png b/docs/docusaurus/versions/version-4.2.0/images/three-body-cypher1.png
new file mode 100644
index 0000000000..3f85fd8412
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-body-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-body-cypher2.png b/docs/docusaurus/versions/version-4.2.0/images/three-body-cypher2.png
new file mode 100644
index 0000000000..41f0f914cc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-body-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-body-cypher3.png b/docs/docusaurus/versions/version-4.2.0/images/three-body-cypher3.png
new file mode 100644
index 0000000000..4776f26d77
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-body-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-body-data.png b/docs/docusaurus/versions/version-4.2.0/images/three-body-data.png
new file mode 100644
index 0000000000..1913b39cbc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-body-data.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher1.png b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher1.png
new file mode 100644
index 0000000000..4b5745b96d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher2.png b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher2.png
new file mode 100644
index 0000000000..fef4592cf3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher3.png b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher3.png
new file mode 100644
index 0000000000..c0790d5d7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher4.png b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher4.png
new file mode 100644
index 0000000000..49a6498d4a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher4.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher5.png b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher5.png
new file mode 100644
index 0000000000..5d3cc55cdf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-cypher5.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-schema.png b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-schema.png
new file mode 100644
index 0000000000..24aebca93a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/three-kingdoms-schema.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/tugraph-datax.png b/docs/docusaurus/versions/version-4.2.0/images/tugraph-datax.png
new file mode 100644
index 0000000000..c2968c0c38
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/tugraph-datax.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/wandering-earth-1.png b/docs/docusaurus/versions/version-4.2.0/images/wandering-earth-1.png
new file mode 100644
index 0000000000..955c565303
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/wandering-earth-1.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/wandering-earth-2.png b/docs/docusaurus/versions/version-4.2.0/images/wandering-earth-2.png
new file mode 100644
index 0000000000..9cb17764ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/wandering-earth-2.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/wandering-earth-3.png b/docs/docusaurus/versions/version-4.2.0/images/wandering-earth-3.png
new file mode 100644
index 0000000000..c6dabbec97
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/wandering-earth-3.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/what-is-graph-en.png b/docs/docusaurus/versions/version-4.2.0/images/what-is-graph-en.png
new file mode 100644
index 0000000000..53d5ba05ca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/what-is-graph-en.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/images/what-is-graph.png b/docs/docusaurus/versions/version-4.2.0/images/what-is-graph.png
new file mode 100644
index 0000000000..6f3aa196fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.2.0/images/what-is-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.2.0/requirements.txt b/docs/docusaurus/versions/version-4.2.0/requirements.txt
new file mode 100644
index 0000000000..0201af0943
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/requirements.txt
@@ -0,0 +1,5 @@
+sphinx
+myst-parser
+sphinx-panels
+sphinx-rtd-theme
+breathe
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/.readthedocs.yaml b/docs/docusaurus/versions/version-4.2.0/zh-CN/.readthedocs.yaml
new file mode 100644
index 0000000000..5b91d3cd6c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/zh-CN/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/Makefile b/docs/docusaurus/versions/version-4.2.0/zh-CN/Makefile
new file mode 100644
index 0000000000..d0c3cbf102
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?=
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/make.bat b/docs/docusaurus/versions/version-4.2.0/zh-CN/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/1.guide.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/1.guide.md
new file mode 100644
index 0000000000..56c69654f3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/1.guide.md
@@ -0,0 +1,76 @@
+# 文档地图
+
+> 这里是文档地图，帮助用户快速学习和使用TuGraph社区版。
+
+## 快速上手
+
+> 可以先了解[什么是图](./2.introduction/1.what-is-graph.md)、图[可以做什么](./2.introduction/8.scenarios.md)、以及[什么是TuGraph](./2.introduction/3.what-is-tugraph.md)。
+
+> 基于[阿里云计算巢](5.installation&running/5.cloud-deployment.md)或[Docker方式](5.installation&running/3.docker-deployment.md)快速部署TuGraph。
+
+> 通过产品内置的场景上手体验：[电影](./3.quick-start/2.demo/1.movie.md)、[流浪地球](./3.quick-start/2.demo/2.wandering-earth.md)、[三体](./3.quick-start/2.demo/3.the-three-body.md)、[三国](./3.quick-start/2.demo/4.three-kingdoms.md)。
+
+> 可视化操作手册看这里：[可视化操作手册](./4.user-guide/1.tugraph-browser.md)、[可视化操作手册（旧版）](./4.user-guide/2.tugraph-browser-legacy.md)。
+
+## 开发指南
+
+> 通过客户端访问TuGraph：[C++](7.client-tools/2.cpp-client.md)、[Java](7.client-tools/3.java-client.md)、[Python](7.client-tools/1.python-client.md)。
+
+> 查询语言、语句创建图模型看这里：[Cypher API](8.query/1.cypher.md).
+
+> 存储过程和算法介绍看这里：[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md)。
+
+> C++/Python开发存储过程接口看这里：[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## 参与社区贡献
+
+> 在开始贡献前，可以先了解[如何贡献](12.contributor-manual/1.contributing.md)
+
+> 如果想了解社区角色的划分，请访问[社区角色](12.contributor-manual/2.community-roles.md)
+
+## 主要仓库
+
+> TuGraph-DB 仓库: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> 可视化界面: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java客户端: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> 基于twitter数据的简单测试方法: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> 基于标准LDBC-SNB的测试方法: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics 仓库: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## 视频中心
+
+> [TuGraph快速上手](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph技术分享集合](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [3分钟读懂图计算](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph最新版本
+
+| 描述                  | 文件                                         | 链接                                                                                                                                                                                              |
+|---------------------|--------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 安装包         | tugraph-4.2.0-1.el7.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-4.2.0-1.el7.x86_64.rpm) |
+| CentOS8 安装包         | tugraph-4.2.0-1.el8.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-4.2.0-1.el8.x86_64.rpm) |
+| Ubuntu18.04 安装包     | tugraph-4.2.0-1.x86_64.deb                 | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-4.2.0-1.x86_64.deb)  |
+| CentOS7 预安装镜像       | tugraph-runtime-centos7-4.2.0.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-runtime-centos7-4.2.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                   |
+| CentOS8 预安装镜像       | tugraph-runtime-centos8-4.2.0.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-runtime-centos8-4.2.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8)                   |
+| Ubuntu18.04 预安装镜像   | tugraph-runtime-ubuntu18.04-4.2.0.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-runtime-ubuntu18.04-4.2.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04)           |
+| CentOS7 精简安装包       | tugraph-mini-4.2.0-1.el7.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-4.2.0-1.el7.x86_64.rpm)                                                                                 |
+| CentOS8 精简安装包       | tugraph-mini-4.2.0-1.el8.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-4.2.0-1.el8.x86_64.rpm)                                                                                 |
+| Ubuntu18.04 精简安装包   | tugraph-mini-4.2.0-1.x86_64.deb            | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-4.2.0-1.x86_64.deb)                                                                                     |
+| CentOS7 精简预安装镜像     | tugraph-mini-runtime-centos7-4.2.0.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-runtime-centos7-4.2.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7)         |
+| CentOS8 精简预安装镜像     | tugraph-mini-runtime-centos8-4.2.0.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-runtime-centos8-4.2.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8)         |
+| Ubuntu18.04 精简预安装镜像 | tugraph-mini-runtime-ubuntu18.04-4.2.0.tar | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.2.0/tugraph-mini-runtime-ubuntu18.04-4.2.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 编译镜像        | tugraph-compile-centos7-1.2.9.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.2.9.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)          |
+| CentOS8 编译镜像        | tugraph-compile-centos8-1.2.9.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.2.9.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)          |
+| Ubuntu18.04 编译镜像    | tugraph-compile-ubuntu18.04-1.2.9.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.2.9.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04)  |
+
+
+版本更新日志见：[链接](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md )。
+
+如果您不清楚使用安装包和镜像，请参考 [环境和版本选择](13.best-practices/4.selection.md)。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..30b26dd16f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/1.privilege.md
@@ -0,0 +1,132 @@
+# 用户权限
+
+## 1.介绍
+
+> TuGraph 的权限是基于角色的访问控制进行管理，定义访问控制的权限分配给角色，角色再分配给用户。
+
+## 2.权限层级
+
+- Global 层：即全局权限，对管理、图操作均有权限；
+- Graph 层：即图级别，对每个图的权限；
+- （仅商业化版本支持）Property 层：即属性级别，对某个属性的权限控制
+
+## 3.权限关键字
+
+目前权限的控制较为简洁
+
+- Global 层目前为 admin 权限，并且预置了 admin 用户；
+
+* Graph 层的操作权限分为四种：none，read，write，full
+  - none：无权限，对于图没有任何操作权限
+  - read：只读权限，对于图只具备读取权限
+  - write：读写权限，对于图不仅具备读取权限，还具备了写入的权限
+  - full：所有权限，对于图不仅具备读写权限，同时也具备删除图、修改图、修改 Schema 等权限
+* （仅商业化版本支持）Property 层的权限分别为：none，read，write
+  - none：无权限，对于该属性没有任何操作权限
+  - read：只读权限，对于该属性只具备读取权限
+  - write：读写权限，对于该属性不仅具备读取权限，还具备了写入的权限
+
+## 4.常用权限操作
+
+### 4.1.用户操作
+
+- 创建用户
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- 删除用户
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- 修改当前用户密码
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- 修改指定用户密码
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- 禁用/启用用户
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- 列出所有用户
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- 列出当前用户信息
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- 获取用户详情
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.角色操作
+
+- 创建角色
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- 删除角色
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- 列出所有角色
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- 禁用/启用角色
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.赋予用户角色
+
+- 新增用户与角色的联系
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- 删除用户与角色的联系
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- 清空用户角色的关系并重建
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.角色赋权
+
+- 修改角色对指定图的访问权限
+
+```cypher
+CALL dbms.security.modSpecifiedAccessLevel(role::STRING,access_level::MAP)
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/2.token.md
new file mode 100644
index 0000000000..02e265cf23
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/2.token.md
@@ -0,0 +1,50 @@
+# Token使用说明
+
+## 1.Token介绍
+JWT（JSON Web Token）是一种用于认证和授权的开放标准。它基于JSON（JavaScript Object Notation）格式，并被设计用于在网络应用之间安全地传输声明（claims）信息。
+
+JWT由三部分组成：头部（Header）、负载（Payload）和签名（Signature）。头部包含了JWT的类型以及所使用的签名算法，负载包含了需要传输的信息，而签名用于验证JWT的完整性和真实性。
+
+在TuGraph中，JWT用于实现无状态的认证和授权机制。当用户登录成功后，服务端会生成一个JWT并将其返回给客户端。客户端在后续的请求中将这个JWT作为身份凭证传递给服务端。服务端收到JWT后，通过验证签名和解析负载中的信息，判断用户的身份和权限，并决定是否允许该请求的执行。
+
+## 2. Token有效期
+
+### 2.1. 浏览器Token交互逻辑
+1. 用户打开浏览器，输入账号密码，并点击登录。
+2. 前端调用登录接口，向后端输入账号和密码。
+3. 后端接收到账号密码后，进行校验，校验成功后，返回Token。
+4. 前端将Token存储在浏览器缓存中，后续请求都要携带此Token。
+5. 如果前端，主动点击登出和关闭页面，前端应主动调用登出接口，向后端传递Token。
+6. 后端接收后，将Token失效，返回状态码200，以及“等出成功”。前端接收到信息后，清空浏览器内存中的Token，并将页面退至登录页。
+7. Token失效（初始设置为24小时），需要用户重新登录。
+
+### 2.3. Token有效期刷新机制
+
+Token有效期存在刷新机制，默认关闭。如果打开后，Token的安全性会更高，实现上则存在两个时间戳。
+
+第一个时间戳`refresh_time`用于判定Token是否过期（默认24小时）：过期后可以调用刷新接口获取新的Token，可以设置为更短的时间，比如1小时。
+
+第二个时间戳`expire_time`为强制过期时间戳（默认24小时）：过期后必须重新登陆。
+
+### 2.4. Token有效期修改
+为了方便开发者自行开发，TuGraph提供了两种方式修改有效期，均需要admin权限。
+
+* 通过接口调用设置。涉及有效期修改的接口`update_token_time`和有效期查询接口`get_token_time`。
+具体可查询[REST接口文档](../7.client-tools/9.restful-api-legacy.md)。
+
+* 通过启动参数设置。server端启动时，添加参数`-unlimited_token 1` 参数可以设置为无期限。可参考[服务运行文档](../5.installation&running/7.tugraph-running.md)。
+
+## 3. 客户端发送Token相关请求介绍
+
+客户端会两种协议处理相关请求，一种是REST，一种是RPC。
+
+### 3.1. REST
+如果客户端使用REST协议（包括Browser浏览器），由于是短链接，在每一次请求中都需要携带Token，过期后需要获取新的Token。
+
+对于自行开发的客户端，若采用REST协议则需要考虑Token的逻辑。
+
+### 3.2. RPC
+如果客户端使用RPC协议（包括官方的C++/Java/Python），使用长连接保持，登陆后不涉及Token操作。
+
+## 4. Token上限
+Token上限是指一个用户最多可以同时拥有的Token数量。为防止无限登陆，Token上限默认为10000。由于Token生成逻辑和时间强相关，每登录一次会生成一个Token进行存储，Token有效期默认为24小时，因此建议登录后不使用的Token及时登出。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..245d6075bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,19 @@
+# 忘记'admin'密码
+> TuGraph 提供了重置密码的功能，当用户忘记管理者账号`admin`密码时，可以通过重置密码的方式来修改密码。
+
+## 1.重置密码
+首先，需要停止TuGraph服务端。再次启动TuGraph服务端时，需要添加如下参数：
+
+```bash
+--reset_admin_password 1
+```
+
+如下所示：
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+这一操作可以使得TuGraph服务端在启动时，重置管理者`admin`的密码为默认密码：`73@TuGraph`。
+密码重置成功会给出相关信息“Reset admin password successfully”并关闭当前服务端进程。
+
+用户需要以正常模式重新启动服务端，然后使用默认账号密码进行登录，登录后重新设置密码即可正常使用。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..b79cc13cc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/4.monitoring.md
@@ -0,0 +1,1020 @@
+# 运维监控
+
+> 此文档主要介绍 TuGraph 的可视化运维监控
+
+## 1.设计思路
+
+可视化监控并不是TuGraph自身不可或缺的一部分，因此在设计时将可视化监控作为TuGraph周边生态中的一个应用，来减少和TuGraph数据库的耦合度，以及对于TuGraph自身的影响。TuGraph可视化监控采用目前最火热的开源解决方案，TuGraph Monitor + Prometheus + Grafana来实现。其中TuGraph Monitor作为TuGraph服务的客户端，通过TCP链接向TuGraph服务发起Procedure请求，TuGraph服务在接收到请求后收集自身所在机器的cpu，memory，disk，io，以及请求数量等指标的统计结果进行响应。TuGraph Monitor在接收到TuGraph响应的指标数据后，将数据包装成prometheus需要的格式，保存在内存中，等待Prometheus服务通过http请求获取。Prometheus服务会定期通过http请求从TuGraph Monitor获取封装好的请求数据，按照获取的时间保存在自己的时序数据库中。Grafana可以根据用户的配置，从Prometheus处获取某个时间段内的统计数据，并在web界面上绘制浅显易懂的图形来展示最终结果。整个请求链路中，都采用了主动获取，即PULL的模型，好处之一是它能最大限度的避免数据生产者和数据消费者之间的耦合度，使得开发更简单，好处之二是数据生产者不需要考虑数据消费者的数据处理能力，即使某个消费者的数据处理能力较弱，也不会因为生产者生产数据过快而压垮消费者。主动拉取模型的不足之处在于数据的实时性不够，但在这个场景中，数据并没有很高的实时性要求。
+
+### 1.1.TuGraph
+
+TuGraph数据库提供了收集服务所在机器中磁盘，内存，网络IO，以及查询请求等多种数据信息的能力，并通过标准Procedure方式提供查询。收集数据这一动作仅在有用户通过接口查询时才会发生，避免了在用户不需要TuGraph监控服务所在机器的指标时对用户业务查询请求带来的影响。
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor是TuGraph周边生态中的一个工具，它作为TuGraph众多用户中的一个，通过C++ RPC Client与TuGraph进行通信，通过Procedure查询接口来查询TuGraph服务所在机器的性能指标，并将TuGraph返回的结果包装成Prometheus需要的数据模型，等待Prometheus获取。用户可以通过设置查询时间间隔来保证获取监控指标对于业务查询的影响最小化。
+
+### 1.3.Prometheus
+
+Prometheus是一个开源的监控平台，并配备有专属的时序数据库，它会定期通过http请求从TuGraph Monitor服务获取统计指标，并保存在自己的时序数据库中。详细信息请参考官网: [https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana是一个开源的可视化和分析软件，它可以从包含Prometheus在内的多个数据源中获取数据，并且可以将时序数据库中的数据转换为精美图形和可视化效果的工具。具体信息请参考官网: [https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.部署方案
+
+### 2.1.第一步
+
+启动TuGraph服务，详细方法请参考文档: [https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.第二步
+
+启动TuGraph Monitor工具，启动命令如下：
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+参数含义如下
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.第三步
+
++ 下载符合您机器架构以及系统版本的Prometheus tar包，下载地址: [https://prometheus.io/download/](https://prometheus.io/download/)
+
++ 解压tar包，命令如下
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ 修改配置文件prometheus.yml，新增如下配置，使其可以抓取TuGraph Monitor包装好的性能数据
+
+```yaml
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ 启动prometheus，具体的启动参数可以通过如下命令获取
+
+```shell
+./prometheus -h
+```
+
++ 验证prometheus服务是否正常，可以通过web端登陆prometheus服务，查询监控指标resources_report是否已经获取到，能成功查询到数据则正确
+
+### 2.4.第四步
+
++ 下载符合您机器架构以及系统版本的Grafana安装包，下载地址: [https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ 安装Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 启动Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 配置Grafana，首先在数据源设置中配置Prometheus的IP地址，配置完成后可以通过测试连接功能，验证是否成功连接数据源。然后，导入如下模版，并在页面中根据实际情况，修改正确的接口IP和端口。最后可以根据实际情况设置刷新时间和监控时间范围
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana"
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {label_name} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "内存",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  QPS超过1000",
+        "name": "请求统计 alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "请求统计",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "磁盘",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\nCPU使用率超过90%",
+        "name": "CPU使用率 alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU使用率",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  磁盘IO超过10MB/S",
+        "name": "磁盘IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph监控页面",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+验证效果，刷新浏览器页面。如果正确显示饼图和折线图，则配置完成。
+
+## 3.未来计划
+
+目前可视化监控只支持单机监控，能监控服务所在机器的cpu，磁盘，网络io，请求qps等性能指标，未来将会实现监控ha集群的功能，也会将更多有意义的指标纳入监控范围
+
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/5.log.md
new file mode 100644
index 0000000000..71c35801cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# 日志信息
+
+> 此文档主要介绍 TuGraph 的日志功能。
+
+## 1.简介
+
+TuGraph 保留两种类型的日志：服务器日志和审计日志。服务器日志记录人为可读的服务器状态信息，而审核日志维护服务器上执行的每个操作加密后的信息。
+
+## 2.服务器日志
+
+### 2.1.服务器日志配置项
+
+服务器日志的输出位置可以通过`log_dir`配置指定。服务器日志详细程度可通过`verbose`配置项指定。
+
+`log_dir`配置项默认为空。若`log_dir`配置项为空，则所有日志会输出到控制台(daemon模式下若log_dir配置项为空则不会向console输出任何日志)；若手动指定`log_dir`配置项，则日志文件会生成在对应的路径下面。单个日志文件最大大小为256MB。
+
+`verbose`配置项控制日志的详细程度，从粗到细分为`0, 1, 2`三个等级，默认等级为`1`。等级为`2`时，日志记录最详细，服务器将打印`DEBUG`及以上等级的全部日志信息；等级为`1`时，服务器将仅打印`INFO`等级及以上的主要事件的日志；等级为`0`时，服务器将仅打印`ERROR`等级及以上的错误日志。
+
+### 2.2.服务器日志输出宏使用示例
+
+如果开发者在开发过程中希望在代码中添加日志，可以参考如下示例
+
+```
+#include "tools/lgraph_log.h" //添加日志依赖
+
+
+void LogExample() {
+    // 数据库启动阶段已经对日志模块进行了初始化，开发者只需直接调用宏即可
+    // 日志等级分为DEBUG, INFO, WARNING, ERROR, FATAL五个等级
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+更多用法可以参考test/test_lgraph_log.cpp中的日志宏的使用方法
+
+### 2.3.存储过程日志
+
+用户在存储过程的编写过程中可以使用日志功能将所需的调试信息输出到日志中进行查看，辅助开发。调试信息会输出到与服务器日志相同的日志文件中(如未指定`log_dir`则同样输出至console)
+
+#### 2.3.1.cpp存储过程
+请使用2.2中提供的log宏输出调试信息，避免使用cout或者printf等输出方式。具体使用方式可参考如下示例代码（详见`procedures/demo/log_demo.cpp`）
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+将以上示例代码作为存储过程插入数据库并运行后，可以在日志文件中看到相应的日志条目。
+
+#### 2.3.1.python存储过程
+请使用python自带的print输出调试信息，调试信息会在存储过程运行结束后合并为一条WARN等级的日志条目输出至日志文件中。
+
+## 3.审计日志
+
+审核日志记录每个请求和响应，以及发送请求的用户以及收到请求的时间。审核日志只能是打开或关闭状态。可以使用 TuGraph 可视化工具和 REST API 查询结果。
+
+开启审计日志需要在配置文件中将`enable_audit_log`参数设置为`true`。配置文件和配置参数说明详见：[数据库运行/服务配置](../../5.installation&running/7.tugraph-running.md/#4服务配置)。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/index.rst
new file mode 100644
index 0000000000..f8e9db5345
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+运维与权限管理
+================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..ff3fcd8048
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# 单元测试
+
+> 该文档是TuGraph的单元测试文档
+
+## 1.简介
+
+TuGraph单元测试采用gtest框架，可以选择一次跑全部test或者制定某些test。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..5d49f35255
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/11.quality/2.integration-testing.md
@@ -0,0 +1,399 @@
+# 集成测试
+
+> 此文档主要介绍 TuGraph 的集成测试框架如何使用
+
+## 1.TuGraph集成测试的意义
+
+在单元测试与功能测试中，有部分用例直接开启galaxy或statemachine来进行测试，这并不是一个完整的流程。在完整的cs架构中，用户请求是通过客户端发往服务端，网络通信是必不可少的，为了避免单元测试不完整带来的bug，针对这种情况，使用集成测试框架进行全链路的完整测试。
+
+## 2.TuGraph集成测试框架
+
+TuGraph采用pytest框架作为自己的集成测试框架，pytest框架作为目前使用最广泛的cs端集成测试框架，以其灵活简单，容易上手，并且支持参数化的使用方式而著称，TuGraph基于pytest提供的功能，抽象出了不同的工具，通过参数来控制各个工具的处理逻辑，以方便大家进行高效的测试代码开发。
+
+更多pytest信息请参考官网: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.组件描述
+
+| 组件名称            | 组件功能                       | 实现方式                                  |
+|-----------------|----------------------------|---------------------------------------|
+| server          | TuGraph单机服务                | 开启子进程并在子进程中启动服务                       |
+| client          | TuGraph Rpc Client         | 当前进程中开启TuGraph Python Rpc Client发送请求  |
+| importor        | TuGraph Importor           | 开启子进程并在子进程中处理导入请求                     |
+| exportor        | TuGraph Exportor           | 开启子进程并在子进程中处理导出请求                     |
+| backup_binlog   | TuGraph Backup Binlog      | 开启子进程并在子进程中处理备份binlog的请求              |
+| backup_copy_dir | TuGraph Backup             | 开启子进程并在子进程中处理备份完整db的请求                |
+| build_so        | 编译c++动态连接库的组件              | 开启子进程并在子进程中处理gcc编译逻辑                  |
+| copy_snapshot   | TuGraph Copy Snapshot      | 当前进程中处理备份snapshot的请求                  |
+| copydir         | 文件夹拷贝                      | 当前进程中处理文件夹拷贝请求                        |
+| exec            | 执行c++/java可执行文件            | 开启子进程并在子进程中启动C++可执行文件                 |
+| algo            | 执行算法                       | 开启子进程并在子进程中执行算法                       |
+| bash            | 执行bash命令                   | 开启子进程并在子进程中执行bash命令                   |
+| rest            | TuGraph Python Rest Client | 当前进程中开启TuGraph Python Rest Client发送请求 |
+
+### 2.2.组件用法
+
+#### 2.2.1.server
+
+##### 2.2.1.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动server，函数执行完成后会停止server，并清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.启动参数
+采用python字典传入
++ host是TuGraph Server的ip和端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导入不同的数据，函数开始执行前会导入数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导出不同的数据，函数开始执行前会导出数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的binlog，函数开始执行前会拷贝binlog到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的db，函数开始执行前会拷贝db到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.启动参数
+采用python字典传入
++ cmd是启动命令，采用python列表传入，可以一次编译多个so
++ so_name是执行完成后需要清理的so，可以是多个，通过python列表传入
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制编译不同的so，函数开始执行前会生成so到指定的目录，函数执行完成后会清理so_name列表指定的动态库
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的snapshot，函数开始执行前会拷贝src中的snapshot到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的目录，函数开始执行前会拷贝src到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的命令
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ result是算法预期的执行结果，执行完成会通过实际结果与预期结果进行比较，不同则测试失败
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的算法逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的算法，函数主体等待算法执行完成后对比结果
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的bash命令，函数开始执行前会开启子进程执行通过cmd参数传入的bash命令，函数主体等待算法执行完成
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.启动参数
+采用python字典传入
++ port是TuGraph Server的端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来链接不同的TuGraph Rest Server，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.测试样例
+
+#### 2.3.1.rest
+
+样例代码中在test_get_info函数执行之前先启动server，server启动后启动了rest client，进入test_get_info函数后获取server的一些信息，并通过assert判断是否有获取到cpu的信息。
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+样例代码中在test_flushdb函数执行之前先执行了数据离线导入逻辑，并启动server后，通过client创建链接，进入test_flushdb函数后，通过查询点的个数判断导入是否成功，导入成功后执行flushDB操作，再次通过assert判断是否能正常清空db
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+     assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+样例代码中在test_export_default函数执行之前先执行了数据离线导入逻辑，导入成功后将当前db的数据导出，然后再次通过离线导入逻辑将exportor导出的数据导入到新的目录中，以新导入的数据启动db，并且创建链接。在test_export_default函数主体中判断导出后再次导入的数据是否与原始数据一致
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.其他测试
+更多用例请参考集成测试代码 [https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration)
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/11.quality/index.rst
new file mode 100644
index 0000000000..9b190aa284
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+测试与质量保障
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..18c9c1daec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,91 @@
+# 如何贡献
+
+## 1. 前言
+感谢您为TuGraph做出贡献，我们由衷地希望有更多社区的同学加入进来，一起建设一个更好的图数据库项目。
+
+对于优秀社区贡献者，我们将颁发TuGraph优秀社区贡献者证书。
+
+## 2. 贡献什么
+我们随时都欢迎任何贡献，无论是简单的错别字修正，BUG 修复还是增加新功能。请踊跃提出问题或发起 PR。我们同样重视文档以及与其它开源项目的整合，欢迎在这方面做出贡献。
+对于任何修改，尤其是较为复杂的修改，建议新建一个issue ，按照BUG或者PR的模板填写。
+
+## 3. 准备工作
+
+### 3.1. 了解TuGraph
+
+建议您从[文档地图](../1.guide.md)开始，了解TuGraph的特性和接口。
+
+### 3.2. 准备环境
+
+对于文档贡献，可以直接通过[文档](https://tugraph-db.readthedocs.io/zh_CN/latest)，点击右上角的"在GitHub上编译"直接修改并提PR。
+
+对于代码贡献，通常需要在搭建编译执行的环境，可以采用[Docker部署](../5.installation&running/3.docker-deployment.md)或[本地部署](../5.installation&running/4.local-package-deployment.md)。
+
+### 3.3. 许可协议
+
+在贡献代码之前，请您稍微花一些时间了解为TuGraph贡献代码的流程，并阅读 [个人贡献者许可协议](3.individual-cla.md) 或 [公司贡献者许可协议](4.corporate-cla.md)，参与贡献则视为同意上述协议。
+
+## 4. 贡献代码流程
+### 4.1. 提交issue
+不论您是修复 TuGraph 的 bug 还是新增 TuGraph 的功能，在您提交代码之前，请在 TuGraph 的 GitHub 上提交一个 issue，描述您要修复的问题或者要增加的功能。这么做有几个好处:
+
+- 不会与其它开发者或是他们对这个项目的计划发生冲突，产生重复工作。
+- TuGraph 的维护人员会对您提的 bug 或者新增功能进行相关讨论，确定该修改是不是必要，有没有提升的空间或更好的办法。
+- 在达成一致后再开发，并提交代码，减少双方沟通成本，也减少 pull request 被拒绝的情况。
+### 4.2. 获取源码
+要修改或新增功能，在提交 issue 后，fork一份 TuGraph  Master代码到您的代码仓库。
+### 4.3. 拉分支
+TuGraph 所有修改都在分支上进行，修改完成后提交 pull request，在 Code Review 后由项目维护人员 Merge 到 Master。 因此，在获取源码步骤介绍后，您需要:
+
+1. 下载代码到本地，这一步您可以选择git/https方式，近年github的权限要求更加严格，比如git方式需要更复杂的ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent))，https方式不能直接使用用户名密码验证，请按照指引授权。 git clone https://github.com/您的账号名/tugraph-db
+2. 拉分支准备修改代码:
+git branch add_xxx_feature 
+3. 执行完上述命令后，您的代码仓库就切换到相应分支了。执行如下命令可以看到您当前分支: git branch -a 
+4. 如果您想切换回 Master，执行下面命令: git checkout -b master
+5. 如果您想切换回分支，执行下面命令: git checkout -b "branchName"
+
+### 4.4. 编译运行
+
+代码的编译运行流程可以参考[ci脚本](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. 配置 Github 信息
+在您的机器执行 git config  --list ，查看 git 的全局用户名和邮箱。检查显示的 user.name 和 user.email 是不是与自己 github 的用户名和邮箱相匹配。
+
+如果公司内部有自己的 gitlab 或者使用了其他商业化的 gitlab，则可能会出现不匹配的情况。这时候，您需要为 TuGraph DB 项目单独设置用户名和邮箱。设置用户名和邮箱的方式请参考 github 官方文档。
+
+### 4.6. 修改代码提交到本地
+
+拉完分支后，就可以修改代码了。
+
+**修改代码注意事项 **
+
+代码⻛格保持一致：TuGraph 通过 cpplint 来保持代码格式一致，IDE可以通过.clang来配置风格。在提交代码前，务必本地检查代码风格，否则ACI将报错。
+
+补充单元测试代码：新有修改应该通过已有的单元测试,应该提供新的单元测试来证明以前的代码存在 bug，而新的代码已经解决了这些 bug ,您可以用如下命令运行所有测试: ./unit_test
+也可以通过IDE来辅助运行。
+
+**其它注意事项 **
+
+请保持您编辑的代码的原有⻛格，尤其是空格、换行等。 对于无用的注释，请直接删除。 对逻辑和功能不容易被理解的地方添加注释。 及时更新文档。 修改完代码后，请按照如下格式执行命令提交所有的修改到本地:
+git commit -am '(feat) 添加xx功能' git commit -am '(fix) 修复xx问题'`
+
+### 4.7. 提交代码到远程仓库
+在代码提交到本地后，接下来就可以与远程仓库同步代码了，执行如下命令提交本地修改到 github 上: git push origin "branchname"
+
+如果前面您是通过 fork 来做的，那么这里的 origin 是 push 到您的代码仓库，而不是 TuGraph 的代码仓库。
+
+提交合并代码到 Master 的请求 在的代码提交到 GitHub 后，您就可以发送请求来把您改好的代码合入 TuGraph Master 代码了。此时您需要进入您在 GitHub 上的对应仓库，按右上⻆的 pull request 按钮。选择目标分支，一般就是 master，系统会通知 TuGraph 的人员， TuGraph 人员会 Review 您的代码，符合要求后就会合入主干，成为 TuGraph 的一部分。 
+
+请注意会自动检查CI，以及所有Commits中的贡献者是否签署了cla，通过后会有绿色的标识。
+
+### 4.8. 代码 Review
+
+在您提交代码后，您的代码会被指派给维护人员 Review，请耐心等待。如果两个工作日后，仍然没有人对您的提交给予任何回复，可以在 PR 下面留言，并 @ 对应的人员。
+
+对于代码 Review 的意⻅会直接备注到到对应 PR 或者 Issue。如果觉得建议是合理的，也请您把这些建议更新到您的代码中。
+
+### 4.9. 合并代码到Master
+
+在代码 Review 通过后，就由 TuGraph 维护人员操作合入 Master，在此过程中维护人员可能会指定新的Reviewer，提出新的意见需要修改。一般这一步不用参与，代码合并之后，您会收到合并成功的提示。
+
+
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..109a1d8f04
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,57 @@
+# 社区角色
+
+## 1. 前言
+本文档描述 TuGraph 社区中成员身份的⻆色，对每种⻆色的要求及权限。 
+
+## 2. ⻆色摘要
+
+这是 TuGraph 社区的⻆色划分，描述了每种⻆色的职责，成为某种⻆色并保持该⻆色的要求，以及相应⻆色的权限。
+
+TuGraph 社区参照 Apache 规范划分为以下三种⻆色：
+
+- Contributor 
+- Maintainer 
+- PMC 
+
+以下描述了每种⻆色的要求、职责和权限。 		 						 					
+## 3. Contributor
+### 3.1. 要求
+在 TuGraph 的任何一个正式项目中成功提交一个 PR 并合并。 
+### 3.2. 职责
+
+- 积极响应指派给您的 Issue 或 PR
+- 一起帮忙回复 Issue 或 PR，把 Issue 分配给对应模块的负责人
+### 3.3. 权限
+
+- 加入 TuGraph GitHub 组织，成为 TuGraph 开源社区的一员。 
+## 4. Maintainer
+### 4.1. 要求
+新的 Committer 由已有的 PMC 推荐，并通过 2/3 以上投票通过，Committer 至少满足以下一个条件：
+
+- 成为社区成员时间超过三个月 
+- 超过 10 个 PMC approve 的 PR 
+- 完成重大功能 
+- 修复严重 Bug 
+- 长期关注项目发展并参与社区讨论
+### 4.2. 职责
+
+- 社区咨询支持
+- 积极响应指派给您的 Issue 或 PR
+- 对于社区重大决定的投票权
+- Review 社区的 PR 
+### 4.3. 权限
+
+- Pull Request review 权限 
+## 5. PMC
+### 5.1. 要求
+
+- 暂不开放，如有强烈愿望请联系PMC
+### 5.2. 职责
+
+- 积极参与社区讨论，对社区重大决策给予指导 
+- 负责保证开源项目的社区活动都能运转良好 
+### 5.3. 权限
+
+- Pull Request review 权限 
+- Pull Request approve 权限 
+- 社区角色成员管理
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..514825b414
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# 个人贡献者许可协议
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..d1f5e1f62d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# 公司贡献者许可协议
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..6668c91d5e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,66 @@
+# 技术规划
+
+## 1. 简介
+
+该文档是 TuGraph-DB 未来开发的规划，包括正在开发中、不在开发计划里、已经开发完成但不在开源版本里的功能等。
+
+TuGraph-DB定位开源高性能图数据库，图数据采用集中存储的方式，短期 **不会** 考虑基于分片（Sharding）的数据切分，
+而将支持主备复制的模式来解决高并发读的场景，采用云上存储解决存储容量的问题。
+
+## 2. 已完成功能
+
+TuGraph-DB于2022年9月1日开源，TuGraph-DB在社区的反馈声中，进行日常BUG修复，自身能力得到了完善。
+
+| 版本号   | 功能                               | 时间         |
+|-------|----------------------------------|------------|
+| 3.3.0 | 开源初版                             | 2022.9.1   |
+| 3.3.1 | 图分析引擎重构，多模式支持                    | 2022.10.14 |
+| 3.3.2 | OGM支持，UT覆盖率提升                    | 2022.11.21 |
+| 3.3.3 | 链接认证机制迭代，加入英文文档                  | 2022.12.23 |
+| 3.3.4 | 支持上云，梳理LDBC SNB Audit流程          | 2023.1.28  |
+| 3.4.0 | 支持OLAP Python API, 离线导入升级        | 2023.3.11  |
+| 3.5.0 | 支持POG，前端升级，文档梳理                  | 2023.6.5   |
+| 3.5.1 | 图学习引擎，Procedure Rust API，存储属性分离  | 2023.7.14  |
+| 3.6.0 | 高可用开源，日志系统升级                     | 2023.8.11  |
+| 4.0.0 | ISO GQL支持，新增11个开源图算法，支持m1 Docker | 2023.9.6   |
+| 4.0.1 | 支持时序边排序，新增5个开源图算法                | 2023.9.28  |
+| 4.1.0 | 支持Bolt协议，支持快速在线全量导入，支持地理空间数据类型   | 2023.12.25 |
+
+除此之外，TuGraph-DB搭建了较为完善的质量体系，涵盖自动化的单元测试、集成测试、性能测试等。
+
+更详细的描述可以在源码目录在的 "[root]/release/CHANGELOG.md" 文件查看。
+
+## 3. 2024年功能更新
+
+在2024年度，我们计划的功能更新包括：
+
+| 版本号   | 功能                 | 计划时间    |
+|-------|--------------------|---------|
+| 4.2.x | HA支持Witness角色和管理工具 | 2024.3  |
+| 4.2.x | Bolt支持流处理和参数化查询    | 2024.3  |
+| x.x.x | GeaX支持Cypher       | 2024.6  |
+| x.x.x | 支持组合索引             | 2024.6  |
+| x.x.x | 数据导入功能优化           | 2024.6  |
+| x.x.x | 【社区功能】支持地理数据类型使用   | 2024.6  |
+| x.x.x | Cypher能力提升         | 2024.9  |
+| x.x.x | 支持Schema快速变更       | 2024.9  |
+| x.x.x | 向量化支持              | 2024.12 |
+| x.x.x | RPQ支持              | 2024.12 |
+| x.x.x | 【可选】查询引擎升级         | 2024.12 |
+| x.x.x | 【社区功能】支持GraphAr    | 2024.12 |
+
+## 4. 期望社区共创的功能
+
+目前团队研发精力并不能实现我们对TuGraph-DB的全部期望，在功能的梳理中，我们发现有一系列值得挖掘的想法，
+团队也有一些初步的探索，期望下面功能能够在社区中共同研发。
+
+| 版本号   | 功能                      | 计划时间   |
+|-------|-------------------------|--------|
+| x.x.x | 图算法库丰富                  | 2024.x |
+| x.x.x | 属性默认值支持                 | 2024.x |
+| x.x.x | Embedded TuGraph-DB最佳实践 | 2024.x |
+| x.x.x | Bolt显式事务支持              | 2024.x |
+| x.x.x | List、Map和Decimal等数据类型扩展 | 2024.x |
+| x.x.x | 探索多存储引擎                 | 2024.x |
+
+一些更加简单的功能，我们会在github的issue中打上 good first issue 的标签，欢迎对图数据库感兴趣的技术爱好者共同研讨。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..f2319d2358
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+贡献者文档
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..addc159170
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# 从关系型数据库导入TuGraph
+
+> 使用 [DataX](../6.utility-tools/7.tugraph-datax.md)，待完善
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..01171c1f11
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,223 @@
+# 使用 TuGraph 图学习模块进行点分类
+
+## 1.简介
+GNN 是许多图上机器学习任务的强大工具。在本介绍性教程中，您将学习使用 GNN 进行点分类的基本工作流程，即预测图中点的类别。
+
+此文档将展示如何构建一个 GNN 用于在 Cora 数据集上仅使用少量标签进行半监督点分类，这是一个以论文为点、引文为边的引文网络。任务是预测给定论文的类别。
+
+通过完成本教程，您可以
+
+使用 TuGraph 加载 cora 数据集。
+
+使用 TuGraph 提供的采样算子采样，并构建 GNN 模型。
+
+在 CPU 或 GPU 上训练用于点分类的 GNN 模型。
+
+此文档需要对图神经网络、DGL等使用有一定经验。
+
+## 2. 前置条件
+
+TuGraph图学习模块需要TuGraph-db 3.5.1及以上版本。
+
+TuGraph部署推荐采用Docker镜像tugraph-compile 1.2.4及以上版本:
+
+tugraph / tugraph-compile-ubuntu18.04:latest
+
+tugraph / tugraph-compile-centos7:latest
+
+tugraph / tugraph-compile-centos8:latest
+
+以上镜像均可在DockerHub上获取。
+具体操作请参考[快速上手](../3.quick-start/1.preparation.md)。
+
+## 3. Cora 数据集导入TuGraph数据库
+### 3.1. Cora 数据集介绍
+Cora 数据集由 2708 篇论文组成，分为 7 个类别。每篇论文由一个 1433 维的词袋表示，表示论文中的单词是否出现。这些词袋特征已经预处理，以从 0 到 1 的范围归一化。边表示论文之间的引用关系。
+
+TuGraph中已经提供了Cora数据集的导入工具，用户可以直接使用。
+
+### 3.2. 数据导入
+Cora数据集在test/integration/data/algo目录下，包含点集cora_vertices和边集cora_edge。
+
+首先需要将Cora数据集导入到TuGraph数据库中，详细操作可参考[数据导入](../6.utility-tools/1.data-import.md)。
+
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+然后进行数据导入：
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式,可参考test/integration/data/algo/cora.conf。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+
+## 4. feature特征转换
+由于Cora数据集中的feature特征为长度为1433的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+
+## 5. 编译采样算子
+采样算子用于从数据库中获取图数据并转换成所需数据结构，具体执行过程如下(如果TuGraph已编译，可跳过此步骤)：
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *  # 导入tugraph-db的python接口模块
+import importlib  # 导入importlib模块
+getdb = importlib.import_module("getdb")  #获取getdb算子
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo) #调用getdb算子
+```
+
+如代码所示，得到算子so文件后，import 导入使用。
+
+## 6. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+训练详细过程如下：
+### 6.1.数据加载
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+如代码所示，根据图数据路径、用户名、密码和子图名称将数据加载到内存中。TuGraph可以载入多个子图用于图训练，在此处我们只载入一个子图。
+
+### 6.2.构建采样器
+训练过程中，首先使用GetDB算子从数据库中获取图数据并转换成所需数据结构，具体代码如下：
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+如代码所示，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+然后构建采样器
+```python
+    batch_size = 5
+    count = 2708
+    sampler = TugraphSample(args)
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(count),
+        sampler,
+        batch_size=batch_size,
+        num_workers=0,
+        )
+```
+
+### 6.3.对结果进行格式转换
+```python
+    src = EdgeInfo[0].astype('int64')
+    dst = EdgeInfo[1].astype('int64')
+    nodes_idx = NodeInfo[0].astype('int64')
+    remap(src, dst, nodes_idx)
+    features = NodeInfo[1].astype('float32')
+    labels = NodeInfo[2].astype('int64')
+    g = dgl.graph((src, dst))
+    g.ndata['feat'] = torch.tensor(features)
+    g.ndata['label'] = torch.tensor(labels)
+    return g
+```
+对结果进行格式转换，使之符合训练格式
+
+### 6.4.构建GCN模型
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+
+def build_model():
+    in_size = feature_len  #feature_len为feature的长度，在此处为1433
+    out_size = classes  #classes为类别数，在此处为7
+    model = GCN(in_size, 16, out_size)  #16为隐藏层大小
+    return model
+```
+本教程将构建一个两层图卷积网络（GCN）。每层通过聚合邻居信息来计算新的点表示。
+
+### 6.5.训练GCN模型
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #如果需要保存模型，则给出模型保存路径
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+如代码所示，根据定义好的采样器、优化器和模型进行迭代训练50次，训练后的模型保存至model_save_path路径中。
+
+输出结果如下：
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+同时，图学习模块可采用GPU进行加速，用户如果需要再GPU上运行，需要用户自行安装相应的GPU驱动和环境。具体可参考learn/README.md。
+
+完整代码可参考learn/examples/train_full_cora.py
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..df74c5c673
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# 数据迁移
+
+## 1. 简介
+   数据迁移是指将数据从一个系统、存储介质或应用程序迁移到另一个系统、存储介质或应用程序的过程。当TuGraph要升级或者系统硬件环境发生变化时，
+需要对原TuGraph服务中的数据进行迁移。以系统硬件环境和软件版本为依据进行划分，本文将数据迁移分为三种方案：
+1. 兼容迁移：当迁移前后系统环境一致且TuGraph软件兼容时，可以直接使用备份恢复的方式迁移数据；
+2. 升级迁移：当迁移前后系统环境不一致或TuGraph软件不兼容时，需要使用先导出数据再重新导入的方式迁移数据；
+3. 在线迁移：当对高可用集群进行数据迁移且集群网络环境良好时，可以使用增删节点的的方式将原集群平滑切换到新集群。
+接下来本文将详细介绍这三种方案。
+
+## 2. 兼容迁移
+兼容迁移指的是在系统环境不变，且TuGraph软件版本兼容时，原服务的数据和存储过程可以在新服务中使用，所以可以直接迁移。
+用户可以先使用`lgraph_backup`工具备份数据，然后将数据传输到新机器中并重启服务。具体迁移步骤如下：
+
+### 2.1. 备份数据
+使用`lgraph_backup`工具备份数据
+```bash
+  lgraph_backup -s db -d db.bck
+```
+本步骤也可以直接使用`cp`命令，不过`cp`命令会拷贝一些多余的元数据，HA模式下也会拷贝raft的元数据导致迁移之后集群重启失败，
+因此建议数据迁移时使用`lgraph_backup`工具替代`cp`命令。
+
+### 2.2. 启动新服务
+使用如下命令启动新服务，存储过程会自动加载到新服务中
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. 停止原服务
+使用如下命令停止原服务
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. 升级迁移
+当用户要把原始服务迁移到一个差异化环境中（比如从centos7迁移到ubuntu18.04），或者TuGraph版本变化较大前后不兼容时（如3.4.0和3.6.0），
+用户可以先使用`lgraph_export`工具将数据导出成文件，传输到新机器中，再使用`lgraph_import`工具重新导入并重启集群。
+这样可以保证在新环境上能够使用，但是效率较低，存储过程也需要重新加载。具体的迁移步骤如下：
+
+### 3.1. 导出数据
+使用`lgraph_export`工具导出数据，并将数据传输到新机器上
+```bash
+  lgraph_export -d db -e db.export
+```
+
+### 3.2. 导入数据
+使用`lgraph_import`工具导入数据，并手动加载存储过程（详见[client操作步骤](../7.client-tools/2.cpp-client.md)）
+```bash
+  lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. 启动新服务
+使用如下命令启动新服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. 停止原服务
+使用如下命令停止原服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. 在线迁移
+当对TuGraph高可用版本部署的服务器集群进行数据迁移时，如果网络带宽充足，可以直接使用增删节点的方式对服务进行在线迁移。具体迁移步骤如下所示：
+
+### 4.1. 拷贝数据
+使用如下命令拷贝leader节点上的数据，并且传输到新集群的机器节点上。由于leader节点上有最完整的raft日志，拷贝leader的数据可以最大程度地减少
+日志追赶的时间。
+```bash
+  cp -r db db.cp
+```
+### 4.2. 启动新节点
+使用如下命令将新节点加入集群，加入集群后，增量数据自动同步到新节点
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. 停止原节点
+停止原节点服务，后续应用请求直接发给新集群
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..dd635f6f27
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# 环境和版本选择
+
+> 该文档介绍如何选择系统环境，以及部署方式
+
+## 1. 简介
+
+TuGraph为不同需求的用户提供了差异化的系统环境和部署方式，来满足新手、系统开发者、生产运维人员、研究人员等不同用户的需求。
+
+## 2. 环境能力选择
+
+用户可以根据实际使用场景，来选择不同的环境。编译环境的能力最完备，所需的第三方软件也越多。与其相对应的，精简运行环境几乎不需要安装任何依赖库，能运行TuGraph除存储过程外的基础功能。
+
+| 环境     | 用途             | 备注        |
+|--------|----------------|-----------|
+| 编译环境   | 从源码编译TuGraph   | 适用于开发人员   |
+| 运行环境   | 运行TuGraph安装包   | 适用于大部分用户  |
+| 精简运行环境 | 运行精简TuGraph安装包 | 对系运行统依赖较小 |
+
+不同环境的具体介绍参见 [链接](../5.installation&running/2.environment-mode.md)。
+
+## 3. 部署方式选择
+
+TuGraph部署仅需一台服务器（高可用模式需要多台），可根据实际资源情况和使用场景，选择适合的部署方式。
+
+| 部署方式     | 描述                   | 备注                                                                                      |
+|----------|----------------------|-----------------------------------------------------------------------------------------|
+| 云部署      | 阿里云计算巢一键部署，免费试用      | 新手适用，流程参考 [链接](../5.installation&running/5.cloud-deployment.md)              |
+| Docker部署 | 通过预先准备的Docker镜像跨平台部署 | 对硬件有要求的用户，比如性能测试，流程参考 [链接](../5.installation&running/3.docker-deployment.md) |
+| 本地部署     | 在现有系统紧耦合部署           | 指定生产环境适用，流程参考 [链接](../5.installation&running/4.local-package-deployment.md)  |
+
+## 4. 后续步骤
+
+部署完成后，后续可以进行[启动服务](../5.installation&running/7.tugraph-running.md)、[数据导入](../6.utility-tools/1.data-import.md)等操作，也可以通过[样例数据](../3.quick-start/2.demo/1.movie.md)来体验整个流程。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..dc5546f1d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+最佳实践
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/14.faq.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/14.faq.md
new file mode 100644
index 0000000000..4a94af5b3c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/14.faq.md
@@ -0,0 +1,57 @@
+# FAQ
+
+在 TuGraph 使用过程中，如果遇到问题可优先查看[用户文档](https://github.com/TuGraph-family/tugraph-db/tree/master/doc/zh-CN) 。其次，请查看如下 FAQ 列表是否能够匹配您的问题。
+
+1. **[内核引擎 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussion-4575385)**
+
+   1.1 [TuGraph 的边是否支持索引？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165379)
+
+   1.2 [TuGraph 单机的 QPS 是多少？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussion-4575381)**
+
+   2.1 [可视化文件 build 后如何更新到 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165364)
+
+   2.2 [如何通过 npm run dev，连接已有的 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165366)
+
+   2.3 [3.3.0 版本 TuGraph Browser 删除 node label 失败？](https://github.com/TuGraph-family/tugraph-db/discussions/82#discussion-4465791)
+3. **[客户端 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussion-4575378)**
+
+   3.1 [Client 目前有哪些编程语言，是否支持 Node.js？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165351)
+
+   3.2 [Python Client 是否支持 pip install？Client 在哪里进行引用？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165353)
+
+4. **[数据导入 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussion-4575373)**
+
+   4.1 [TuGraph 可以对接哪些常用数据库？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165335)
+
+   4.2 [如何进行数据导入？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[存储过程 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussion-4575369)**
+
+   5.1 [如何加载存储过程或算法包？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165313)
+
+   5.2 [如何调用或执行存储过程？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165317)
+
+   5.3 [开源内置的算法包在哪里？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[安装部署 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussion-4575364)**
+
+   6.1 [如何使用 docker 镜像安装？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165287)
+
+   6.2 [rpm 包和 deb 包安装后，启动 lgraph_server 服务，提示缺少'liblgraph.so'报错？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165289)
+
+   6.3 [如何在 Mac 的 M1 芯片上编译 TuGraph？](https://github.com/TuGraph-family/tugraph-db/discussions/47#discussion-4393165)
+7. **[Cypher QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussion-4575018)**
+
+   7.1 [是否支持不定长边的条件查询？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165252)
+
+   7.2 [如何查询最短路径，shortestPath 函数如何使用？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165256)
+
+   7.3 [查询语句 Where 后使用 and 进行拼接查询速度较慢，语句应如何优化改进？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165260)
+
+   7.4 [如何查询任意跳的边？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165262)
+
+   7.5 [Cypher 是否 date()函数？](https://github.com/TuGraph-family/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+
+   8.1 [报错“User has reached the maximum number of tokens”后该如何处理？](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+如果问题仍然无法得到解决，我们推荐您在[Discussions](https://github.com/TuGraph-family/tugraph-db/discussions)跟帖或发起新贴来描述您的问题。同时 TuGraph QA 大汇总也会根据大家在讨论区发起的帖子，进行定期的更新。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/15.contacts.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/15.contacts.md
new file mode 100644
index 0000000000..e003ef4098
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/15.contacts.md
@@ -0,0 +1,17 @@
+# 联系方式
+
+您有任何对产品的意见和建议，欢迎通过以下联系方式加入讨论，或提出建议。
+
+官网: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue (错误反馈、功能讨论)
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions (技术讨论)
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack (在线开发沟通):
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+通过钉钉群、微信群、微信公众号、邮箱和电话联系我们:
+![contacts](../../images/contact-zh.png)
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..4cbe4ce767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,13 @@
+# 什么是图
+
+> 本文面向初学者，介绍图（Graph）的基本概念。
+
+我们今天介绍的图，是图论中使用点和边表示的图（Graph），而非图像的图（Image）。
+
+![alt what is graph](../../../images/what-is-graph.png)
+
+图的基本元素是点和边，其中点表示事物或实体，边表示点之间的关联关系。
+
+如上图左侧所示，点表示的有公司、员工、项目。边表示的是他们之间的关系，包括：公司和员工之间的雇佣关系，员工和员工之间的好友关系，项目和员工之间的参与关系。除此之外，点和边上可以附加属性，比如员工的工号，雇佣的时间，这样的图是属性图。也就是说，我们可以用图的方式来抽象地表示实体及其关联关系，图有非常丰富的表达能力。
+
+除了上述的员工图谱，图还可以用于金融、工业、医疗等各个领域。在实际应用中，图的规模越来越大，比如金融交易图，点边规模可能到达百亿，与其同时，基于图的查询通常会复杂，最典型的是K跳查询，每增加一跳访问的数据都呈指数增长。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..eeb4dfd11f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# 什么是图数据库
+
+> 本文主要介绍什么是图数据库，图数据库相比于关系型数据库的优势，以及两者特点的对比。
+
+## 1. 图数据库介绍
+
+图数据库是基于图模型的数据库。与关系型数据库相比，图数据库真正注重“关系”。图数据库的主要功能是管理图数据，因此需要支持高效的点、边查询和更新；为方便用户使用，通常还需要增加对事务（transaction）的支持，以确保并发操作下的正常运行。
+
+## 2. 图数据库相比较于关系型数据库的优势
+
+图数据库的功能是传统关系型数据库的扩展。与关系型数据库仅支持的“表结构”相比，图数据库所支持的“图结构”更为灵活。图数据库在基于图的增加、删除、查询和修改方面采用不同于其他数据库的设计。在图数据操作抽象上，采用基于点的视角，例如点通过其所有“出边”（从一个点出发，连接到其他点的边）访问其邻接点。这是图数据库系统设计的核心。
+
+图数据库的独特性体现在以下三个方面:
+
+### 2.1. 性能
+
+在关联关系处理上，使用关系型数据库不可避免地要使用表的JOIN操作，这会对性能产生较大影响；而图数据库则直接跳转访问类指针，操作关联数据的效率更高，比关系型数据库提高2到4个数量级的性能。
+
+### 2.2. 兼容性
+
+现实中，项目进程通常不断演变，数据的内容甚至数据格式也在不断变化。在关系型数据库中，这意味着表结构的变化或建立多个新表，对源数据的修改非常大。而在图数据库中，仅需添加新的点、边和属性，并将其设置为对应的类型即可。从本质上说，一个表代表一种类型的数据，一个点代表一个特定的数据。这意味着关系型数据库更关注数据类型，而图数据库更关注数据个体及其关联关系。
+
+### 2.3. 直观性
+
+使用图的方式表达现实世界的关系更直接和自然，在万物互联的时代尤为突出。如果使用关系型数据，先建立实体表，再建立关系表，最后映射数据，需要高度的抽象思维。在图数据上进行分析查询时，可以直观地通过点边连接的拓扑结构找到所需数据，无需任何专业知识。
+
+## 3. 图数据库与关系型数据库对比
+
+| 分类         | 模型   | 优势                                   | 劣势                                     | 举例           |
+| ------------ | ------ | -------------------------------------- | ---------------------------------------- | -------------- |
+| 关系型数据库 | 表结构 | 数据高度结构化，一致性强，软件成熟度高 | 面向多跳的关联关系查询低效或不支持       | MySQL、Oracle  |
+| 图数据库     | 图结构 | 针对关联关系的建模建模和操作效率非常高 | 高度结构化的数据处理能力不及关系型数据库 | Neo4j、TuGraph |
+
+总之，面对海量数据的存储和处理问题，传统的关系数据库已经无法满足大部分的日常数据存储需求。图数据库技术可以将关系信息存储为实体，灵活拓展数据模型。由于提供了对关联数据最直接的表达方式和图模型对异构数据的天然包容性，图数据库技术必将成为未来最热点的技术之一，为企业提供存储和分析大规模图数据的有力支持。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..967549eb4d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,49 @@
+# 什么是TuGraph
+
+> 本文主要介绍TuGraph社区版的主要功能和特性，以及TuGraph企业版和社区版的差异。
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群，解决了图数据分析面临的大数据量、高吞吐率和低延迟等重大挑战，是蚂蚁集团金融风控能力的重要基础设施，显著提升了欺诈洗钱等金融风险的实时识别能力和审理分析效率，并面向金融、工业、政务服务等行业客户。
+
+## 2. TuGraph社区版
+
+2022年9月，TuGraph单机版开源，提供了完备的图数据库基础功能和成熟的产品设计，支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台。
+
+TuGraph社区版于2022年9月开源，提供了完整的图数据库基础功能和成熟的产品设计（如ACID兼容的事务、编程API和配套工具等），适用于单实例部署。社区版支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台，是学习TuGraph和实现小型项目的理想选择。
+
+## 3. TuGraph特性
+
+TuGraph是支持大数据量、低延迟查找和快速图分析功能的高效图数据库。TuGraph也是基于磁盘的数据库，支持存储多达数十TB的数据。TuGraph提供多种API，使用户能够轻松构建应用程序，并使其易于扩展和优化。
+
+它具有如下功能特征：
+
+- 属性图模型
+- 实时增删查改
+- 多重图（点间允许多重边）
+- 多图（大图与多个子图）
+- 完善的ACID事务处理，隔离级别为可串行化（serializable）
+- 点边索引、全文索引
+- 混合事务和分析处理（HTAP），支持图查询、图分析、图学习
+- 主流图查询语言（OpenCypher、ISO GQL等）
+- 支持OLAP API，内置30多种图分析算法
+- 基于C++/Python的存储过程，含事务内并行Traversal API
+- 提供图可视化工具
+
+在性能和可扩展性方面的支持：
+
+- 千万点/秒的高吞吐率
+- TB级大容量
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线的备份恢复
+
+## 4. TuGraph企业版
+
+企业版对商业化功能支持更加完善，包括分布式集群架构，覆盖探索、研发、服务、运维管理全生命周期的一站式图平台，在线、近线、离线的图计算引擎，支持流式、大数据类数据源，多地多中心的部署形态，以及专家支持服务等。企业版是商业化解决方案的理想选择。
+
+如需商业支持，请联系我们：
+
+- 电话：400-903-0809
+- 邮件：tugraph@service.alipay.com
+- 官网：https://tugraph.antgroup.com
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..dd63e22d44
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/4.schema.md
@@ -0,0 +1,85 @@
+# TuGraph图模型说明
+## 1. 数据模型
+
+### 1.1. 图模型
+
+TuGraph是一个具备多图能力的强类型、有向属性图数据库。
+
+- 图项目：每个数据库服务可以承载多个图项目（多图），每个图项目可以有自己的访问控制配置，数据库管理员可以创建或删除指定图项目。
+- 点：指实体，一般用于表达现实中的实体对象，如一部电影、一个演员。
+    - 主键：用户自定义的点数据主键，默认唯一索引，在对应的点类型中唯一。
+    - VID：点在存储层自动分配图项目中的唯一ID，用户不可修改。
+    - 上限：每个图项目存储最多2^(40)个点数据。
+- 边：用于表达点与点之间的关系，如演员出演电影。
+    - 有向边：边为有向边。若要模拟无向边，用户可以创建两个方向相反的边。
+    - 多条边：两个点数据之间可以有多条边数据。当前TuGraph支持重复边，如要确保边边唯一，需要通过业务策略实现。
+    - 上限：两个点数据之间存储最多2^(32)条边数据。
+- 属性图：点和边可以具有与其关联的属性，每个属性可以有不同的类型。
+- 强类型：每个点和边有且仅有一个标签，创建标签后，修改属性数量及类型有代价。
+    - 指定边的起/终点类型：可限制边的起点和终点点类型，支持同类型边的起点和终点的点类型不同，如个人转账给公司、公司转账给公司；当指定边的起/终点类型后，可增加多组起/终点类型，不可删除已限制的起/终点类型。
+    - 无限制模式：支持不指定边的起点和终点的点类型，任意两个点类型间均可创建该类型的边数据。注：当指定边的起/终点类型后无法再采用无限制模式。
+
+### 1.2. 数据类型
+
+TuGraph支持多种可用于属性的数据类型。具体支持的数据类型如下：
+
+| **数据类型** | **最小值**          | **最大值**          | **描述**                            |
+| ------------ | ------------------- | ------------------- | ----------------------------------- |
+| BOOL         | false               | true                | 布尔值                              |
+| INT8         | -128                | 127                 | 8位整型                          |
+| INT16        | -32768              | 32767               | 16位整型                         |
+| INT32        | - 2^31              | 2^31 - 1            | 32位整型                         |
+| INT64        | - 2^63              | 2^63 - 1            | 64位整型                         |
+| DATE         | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" 格式的日期             |
+| DATETIME     | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD HH:mm:ss[.ffffff]" 格式的日期时间 |
+| FLOAT        |                     |                     | 32位浮点数                       |
+| DOUBLE       |                     |                     | 64位浮点数                       |
+| STRING       |                     |                     | 不定长度的字符串                    |
+| BLOB         |                     |                     | 二进制数据（在输入输出时使用Base64编码） |
+
+### 1.3. 索引
+
+TuGraph支持对点或边的属性创建索引，以提升查询效率。
+- 索引可以是唯一或非唯一索引。
+- 如果为点标签创建了唯一索引，在修改该标签的点时，会先执行数据完整性检查，以确保该索引的唯一性。
+- 每个索引都基于一个点或边的一个属性创建，可以对同一点或边的多个属性创建索引。
+- BLOB类型的属性不能建立索引。
+
+## 2. 图项目、点、边、属性命名规则和建议
+
+### 2.1 命名规则
+图项目、点、边和属性是识别符。该节描述了在TuGraph中识别符的允许的语法。
+下面的表描述了每类识别符的最大长度和允许的字符。
+
+|**识别符** |**长度** |**允许的字符**|
+|---------  |---------  |---------  |
+|用户、角色、图项目	|1-64字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+|点类型、边类型、属性	|1~256字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+
+### 2.2 使用限制
+
+|**描述**|	**最大个数**|
+|-------- |--------- |
+|用户数、角色数	|65536|
+|图项目的个数	|4096|
+|每个图项目的点和边类型数量之和	|4096|
+|每个点或边类型的属性数量	|1024|
+
+注：
+1、特殊字符和关键字说明：使用特殊字符或非保留关键字时，需要使用反单引号/backquote（``）进行引用；
+
+示例： ```match (`match`:match) return `match`.id limit 1```
+
+2、大小写敏感性：TuGraph大小写敏感；
+
+3、图项目、点/边、属性名称之间可以重复使用，同一点或边下的属性名称不可以重复；
+
+4、属性名字保留关键字：SRC_ID / DST_ID / SKIP
+
+
+### 2.3 命名建议
+|**识别符**|**描述**|**建议**|
+|-------|-------|--------|
+|图项目	|字母或中文开头	|如graph123、project123等|
+|点/边类型	|字母或中文开头，使用下划线区分单词	|如person、act_in等|
+|属性	|字母或中文	|如name、age等|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..ddb01d4a54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# 性能优先
+
+> 此文档主要介绍 TuGraph 性能优先的设计理念。
+
+## 1.简介
+
+TuGraph目前是世界上最快的图数据库，在图数据库标准评测LDBC SNB Interactive位居榜首（2023.3）。TuGraph的设计基于性能优先，致力于打造高性能的单机图数据库。该文档是TuGraph基于性能优先在存储层的核心设计。
+
+## 2.图操作的特性
+
+在属性图上的操作涉及读、写及其属性，对一些特殊的属性比如时间戳也访问模式也会影响到整体性能。这里通过对一些图操作特性的规律总结，来指导最终的性能。
+
+我们观察到很多图应用有类似的数据访问模式。例如，在信贷风险控制中，我们使用递归路径过滤搜索多对一模式，以找到可疑的信用欺诈用户和行为。针对网络赌博，可以通过识别短时间内的多笔资金转移，来发现涉赌的资金账号。股权穿透场景对实体间的股权关系进行递归计算。这些场景具有多跳实体和关系访问、时间窗口约束和读写事务等常见模式。
+更进一步，从介绍中的讨论和图负载的分析中，归纳出以下特征:
+
+**规律一** KHop是图中最典型的操作，它基于点和边的图拓扑的数据访问模式，和关系型数据库有着本质的区别。KHop 的典型性除了表现在数据访问模式不同，它同时也是图数据库最需要关注的性能点。
+
+**规律二** 图负载的数据访问在拓扑上有一定的局部性，同一个点的边通常会被同时访问。当这些边的标签相同时，有更大的概率会被同时访问。
+
+**规律三** 图负载在访问点边时，通常会访问其对应的属性，来作为遍历过滤的条件。
+
+**规律四** 在基于时序的图负载，对点边的过滤通常是在某个时间范围，比如最近的一周。
+
+**规律五** 写操作可能伴随着大量的读操作，需要在单个事务周期里处理。
+
+通过对实际线上图应用的分析，图负载的读写比率大约为 20:1，虽然场景局限在金融场景，集群数也有限，但涉及的数据规模和用户量非常庞大，具有一定代表性。20:1 的图负载读写比率，说明读工作负载对整体性能的影响更大， 而写工作负载的性能也不能忽视。
+
+## 3.存储数据结构
+
+TuGraph底层采用B+树来支持实时的增删查改事务。
+
+在排序树的数据结构中，B+树和LSM树为主要代表。B+树在树节点中使用拆分和合并式来更新排序数据，而 LSM 树在日志中追加更新，以进行延迟数据合并。B+ 早期用在文件系统的实现中，通过将数据保存 在自适应长度的叶子节点中，解决硬盘顺序操作和随机操作性能存在数据量级差别的问题，有较均衡的读写性能。LSM 树的主要优势使用 WAL(Write Ahead Log) 进行更新，将更新操作变成顺序操作，在键值较小时性能优势尤为突出。WAL 意味着将数据的更新合并推迟，批量更新能提升综合效率，也使得系统的调度变得复杂。如果更新合并完成前，恰好对其中的数据继续读取，LSM 树就需要读取几个层级局部合并的日志，会导致读取放大和空间放大，从而影响读效率。
+
+总结来说，B+ 树有较好的顺序读写性能，而 LSM 树在数据随机写方面占优。此外 LSM 树采用后台合并的方式，使得性能的波动难以预期，性能波动和上层存储和计算的关联性较弱，增加了整体设计的成本。综上考虑，TuGraph 选用 B+ 树作为读性能优先的实现。
+
+## 4.数据编码
+
+对于属性图模型而言，除了图拓扑编码外，属性数据也会很大程度影响功能和性能，我们先讨论属性数据如何与拓扑数据共存的编码格式。从目前的调研来看，属性编码有两种方式，我们称之为基于指针索引将属性数据单独存储的离散编码，和将属性数据和拓扑数据打包在一起的紧凑编码。离散编码根据程度的不同，可以每个属性都单独存储，或者每条边的属性打包后各自存储，下面的讨论对两种情况都适用。
+
+点查询。属性编码主要针对边，不涉及点查询。
+
+单边查询。离散编码通过指针定位边，紧凑编码则需要二分查找定位边的位置，离散编码有略微的优势。
+
+边遍历。离散编码在边遍历过程需要不断地进行指针跳转进行随机数据访问，而紧凑编码提前把数据排列在一起，顺序访问的特性使得效率大大提升。 由规律三知对边的遍历操作很普遍，紧凑编码在边遍历的优势明显。
+
+单边更新。离散编码对边的更新仅需找到对应的指针位置，插入数据后修改前后指针指向。紧凑编码则需要对紧凑排列的数据进行重编码，对整个边值进行重新写入，开销显著大于离散编码的情形。
+
+批量边更新。批量更新可以在内存中预先构建点的所有边属性，一次性编码写入，离散编码和紧凑编码相当。但紧凑编码不需要存储指针变量，更少的存储空间效率也会更高。
+
+以上离散编码和紧凑编码在某一类的查询的性能问题，可以通过优化的来缓解。整体上说，由于图负载读写 20:1 的特性，读性能在整体性能中占比更高。以及规律三所揭示的对属性访问的特征，TuGraph 更倾向于采用紧凑编码来保证读性能。其主要弱势为单边更新时重编码的开销，可以用自适应映射的技术来解决。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3f89389b2b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,34 @@
+# 多层级接口
+
+
+> 此文档主要介绍 TuGraph 的多层级接口的设计理念。
+
+## 1.简介
+
+多层级接口是 TuGraph 针对多丰富的使用场景，在易用性和高性中作出的平衡。比如描述式图查询语言 Cypher 能够抹去图数据库实现的细节，基于图模型的抽象来进行表达。Cypher 过于高层的表述，无法高效转化成底层的执行，因此提供了 Procedure API 的过程式语言，来发挥图数据库的最佳性能。
+
+接口可以大致分为客户端接口和服务端接口，大部分操作都在服务端完成，客户端只做数据的封装和解析。客户端和服务端通过网络连接，TuGraph 支持更加灵活的短连接 REST 协议，以及更加高效的长链接 RPC 协议，可根据不同的业务场景来选择。
+
+服务端接口均处在计算层，和图数据存储间用一层 Core API 在逻辑上隔开。
+
+![多层级接口架构](../../../../images/multi-level-Interfaces.png)
+
+## 2.客户端接口
+
+客户端接口指在客户端执行的接口，通常用于集成到软件应用中。TuGraph 的客户端的接口比较简单，包括登录登出、数据导入导出、存储过程加载调用、Cypher操作等。其中 Cypher 中集成了大部分的功能，包括数据操作、图模型操作、运维管理、账户管理等。
+
+由于 Cypher 的参数和返回值都是字符串，JAVA OGM 是对 Cypher 的结构化封装，即查询结果能够被封装为一个有类型的对象，方便使用。
+
+## 3.服务端接口
+
+服务端接口包括描述式图查询语言 Cypher、过程式图查询语言 Procedure API、图分析编程框架 OLAP API 和图神经网络编程框架 GNN PI，为图事务引擎、图分析引擎、图神经网络引擎提供服务，下面先展开介绍各个接口的特点。
+
+> __描述式图查询语言__ 是对查询逻辑的抽象描述，而与执行逻辑无关，对图数据库应用者比较友好，类比关系型数据库的 SQL 语言。TuGraph 的 Cypher 语言主要依照 Neo4j 开源的 OpenCypher 查询标准，同时对运维管理等辅助功能进行了扩展，在功能上囊括了 TuGraph 的大部分操作。描述式图查询语言会成为图数据库的主要数据操作方式，但由于描述到执行之间需要生成执行计划（Execution Plan），生成最优执行计划在学术界和工业界均有很长的路要走。
+
+> __过程式图查询语言__ 是为了解决描述式图查询语言与最优性能间的鸿沟。TuGraph的 Procedure API 是在 Core API 上做了一层简单的封装，C++ Procedure API的灵活性和高效性能够充分发挥存储的极致性能，也是 Cypher 优化的上限性能。Python Procedure API 是 C++ Procedure API 上的一层跨语言封装，翻译过程中值的拷贝会带来一定的性能损失，优势则主要是 python 语言本身的易用性。raversal API 是并行执行的 Procedure 接口，描述上更接近于集合的操作，比如扩展点集合所有出度邻居，获得一个新的点集。
+
+> __图分析编程框架__ 属于 ‘图计算系统’ 的范畴，会将图数据从支持增删改查的存储中导出快照，以更紧凑的数据存储格式来支持只读的复杂图分析，这里叫做OLAP API。OLAP API 封装了高并发执行的数据结构，包括 Vector、Bitmap等，以及基于 CSR 格式的图快照数据结构，然后提供一套并发的快速点边操作框架。在图分析任务完成后，数据可以通过接口写回图数据库。
+
+> __图神经网络编程框架__ 主要提供了图神经网络应用编程所需要的接口，能够对接PyTorch 等机器学习框架。TuGraph 的图神经网络编程框架主要集成了 DGL，在 Python 的语言环境中完成从图存储到图神经网络应用的完整流程。
+
+除了 Cypher 是解释执行外，其余服务端接口都是编译执行，即需要将对应代码传到服务端后，进行编译（可能会有时间开销），再在服务端执行。所以通常需要先加载，然后再已加载的应用列表中找到程序，传输入参数后执行。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..e895545616
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> 此文档主要介绍 TuGraph 的HTAP的设计理念。
+
+## 1.简介
+
+![htap架构](../../../../images/htap.png)
+
+HTAP 的实现在架构上有多种不同的方式：一是用两个不同的副本来分别处理 OLTP 和 OLAP 的任务，核心是数据的一致性同步和额外的资源开销；二是在任何时候都使用同一份数据存储，该实现的数据结构存在内存膨胀，在工业化落地还需要进一步工作。在 TuGraph 的设计中，简单的 OLAP 操作和 OLTP 操作共用一份数据，而复杂的 OLAP 操作则单独导出快照处理。
+
+## 2.设计
+
+在 TuGraph 中，OLTP 为图事务引擎，在图 4.4对应事务操作；OLAP 为图分析引擎，对应简单图分析操作（比如 SPSP）和复杂图分析操作（比如 PageRank），前者可以直接在图存储上执行，而后者需要额外导出快照执行。
+
+- 事务操作，即图事务引擎测的操作，为局部图的增删查改操作，典型的应用为 K 跳访问 K-Hop。
+- 简单分析操作，是图分析引擎中较为简单的部分，通常也是局部的图分析操作，比如两点间最短路算法 SPSP、Jaccard 算法。
+- 复杂分析操作，是图分析引擎中较为复杂的部分，通常涉及全图的多轮数据迭代操作，比如网页排序算法 PageRank、社区发现算法 Louvain。
+
+如架构图所示，我们在图中增加了外部存储，使得图分析的数据源不局限在图数据库中，可以直接从文本文件读取。
+
+- 图存储，即图数据库中的存储，有精心设计的数据结构，能够完成实时增删查改。
+- 外部存储，可以是 RDBMS 或文本文件，以边表的简单方式存储，仅供一次性批量读取，和批量结果写入。在计算层，和整体架构图中的接口对应。
+- Cypher，描述式图查询语言，可以并发执行。
+- Procedure API，过程式图查询语言，其灵活性能够同时支持事务操作和图分析操作，但效率上不足以完成复杂图分析操作，可以并发执行。
+- OLAP API，针对多轮迭代的复杂图分析。应用需要先将存储中的图数据导出成内存中的一个快照，该快照仅用来快速访问，而不需要考虑 ACID 的写支持，因此可以排布地更加紧凑，CSR 排布的读效率要远高于图存储的数据排布。OLAP API 只能串行执行，每个操作都用满 CPU 资源。
+
+OLAP API 的快照可以从外部存储创建，即将边表数据构成件 CSR 的格式；或者从图存储中创建。需要注意的是，OLAP API 要求点的 ID 是连续的自然数，可能需要额外的 ID 映射，该步骤在创建快照时可以在指定一个属性进行映射，或直接取属性值作为 ID。
+
+与计算接口和存储相对应，有四种运行模式。
+
+- 事务模式，每个操作对应一条 Cypher 语句，默认是一个事务。
+- Plugin 模式，通过插件的方式，在计算逻辑加载到服务端后调用，也叫存储过程。
+- Embed 模式，和 Plugin 模式的使用接口一致，区别是图数据库服务不需要起来，就可以直接用接口调用数据库中的数据，通常用于调试 Procedure API 和OLAP API 的代码，调试信息和操作步骤比 Plugin 模式更加友好。
+- Standalone 模式，最大程度剥离与图数据库的关系，仅想用图分析引擎做数据分析时，该模式会比较直接。Standalone 模式会直接使用外部存储的数据。
+
+图神经网络引擎的使用方式和 ‘复杂图分析操作’ 类似，会同时调用部分 OLAP API 和 GNN API，不在这里展开。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..c055f3df01
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,10 @@
+产品特点
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
+    
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..cf901d31cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# TuGraph产品架构
+
+> 此文档主要介绍 TuGraph 的产品架构。
+
+## 1.简介
+
+![产品架构](../../../images/architecture.png)
+
+上图从功能模块的角度，以 TuGraph 为例，给出了企业级图数据库的整体架构，自下而上包括：
+
+- 软硬件环境。涉及图数据库的开发和使用环境。TuGraph 主要基于底层的 C++语言开发，能够兼容市面上大部分操作系统和 CPU。
+- 存储层，包括 KV 存储层和图存储层。存储层需要支持计算层所需的各个功能。
+- 计算层。计算层应包括图事务引擎、图分析引擎和图神经网络引擎，也包含了服务端提供的多种编程接口，包括描述式查询语言 Cypher，存储过程等。
+- 客户端。客户端 SDK 应支持 Java、Python、C++ 等多种语言，也支持命令行的交互方式。Browser 和 Explorer 通过网页端交互的方式，降低了图数据库的使用门槛。
+- 在生态工具方面，覆盖了企业级图数据库的开发、运维、管理等链路，提升可用性。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..d146ff5239
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/7.functionality.md
@@ -0,0 +1,110 @@
+# 功能概览
+
+> 此文档主要介绍 TuGraph 的主要功能和特性。
+
+## 1.安装部署
+
+## 1.1.部署方式
+
+TuGraph目前提供云部署、Docker部署以及安装包部署三种部署方式，用户可根据实际情况选择适合的部署方式。
+
+## 1.2.软硬件环境
+
+TuGraph核心是由C++开发，默认使用的编译器为GCC8.4，使用c++14标准。部分功能使用了其他编译器，比如全文索引的实现基于ApacheLucene，采用JNI接口需要Java编译器。此外，存储过程中额外提供了Python Procedure API，该功能需要Python环境。TuGraph不需要特殊的硬件比如GPU，对RDMA、HBM等高延迟低带宽的通用硬件升级可以天然适配。
+
+TuGraph测试过基于X86和ARM的CPU，包括Intel、AMD、Kunpeng、Hygon、飞腾等，也同时在多个操作系统上运行，包括Ubuntu、CentOS、SUSE、银河麒麟、中标麒麟、UOS的主流版本，对操作系统和CPU没有特殊的要求。
+
+软硬件环境也包括依赖库的环境，由于TuGraph的存储层中默认的KV存储是LMDB，需要文件系统能够支持POSIX接口。在不同的环境下编译和参数配置会略有不同，比如在图存储的点边数据打包中，应和操作系统的页表大小匹配，默认为4KB，建议将系统的页表大小也设置为4KB。
+
+## 2.存储层
+
+在图数据模型上，TuGraph支持属性图模型，按照层次可以分为子图、标签（包括点标签和边标签）、属性。从存储层看，TuGraph使用使用直观的多层的树状模型，没有跨子图的标签，也没有跨标签的属性，仅保留图模型的核心逻辑。
+
+在子图的存储上，TuGraph对多图做了数据的物理隔离，每个图对应一个LMDB的实例。多图的元数据描述信息，保存在meta的特殊的公共LMDB实例中。点边标签及其属性的存储，通过将图数据自适应地映射到KV键值对，最大程度发挥读性能。同时在KV层实现了多线程写，解决了LMDB写性能较低的劣势。主键索引和二级索引，对应LMDB中B+的表，支持基于比较的索引值增删查改。
+
+存储层还保留了一些其他非核心功能的数据，包括权限数据、预编译的插件数据、监控数据等。
+
+## 3.计算层
+
+计算层在功能上分成三个部分，包括TP类的图事务引擎，AP类的图分析引擎和图神经网络引擎。
+
+- __图事务引擎__，主要用来处理并发的图操作，包括单点查询、邻居查询、路径遍历。图事务引擎侧重并发操作的ACID事务，确保操作逻辑不会互相干扰，主要性能指标为 QPS，即每秒完成的查询数量。
+
+- __图分析引擎__，操作类型通常为全图迭代。部分简单的分析任务（比如SPSP）可以由图事务引擎完成，复杂的分析任务均由图分析引擎完成，单个任务通常需要数秒至数小时。因此单个图分析任务要并发利用所有的硬件资源，性能指标为任务完成的总时长。
+
+- __图神经网络引擎__，通常也为全图迭代。图神经网络引擎除了基于图拓扑的操作，也需要集成一个机器学习的框架来处理向量操作，比如 PyTorch、MXNet、TenserFlow。
+
+三个引擎的操作逻辑不尽相同，独立配置资源池。事图事务引擎基于RPC操作设置了一个线程池，每接受客户端的一个操作，从线程中取一个线程来处理，并发执行的数量等于RPC线程池的容量，通常配置为服务器的核数。图分析引擎有一个分析线程池，每个图分析任务会并发执行，即用所有的线程来执行一个任务，来加速操作的性能。TuGraph图分析操作串行执行的特性会一定程度限制用户的使用体验，并发的图分析的需求可以通过高可用部署的方式，增加机器资源来处理，或者接入外部的任务调度器，将数据传到实时调度的容器来计算。图神经网络操作在图上的操作会复用图事务引擎或图分析引擎的资源，向量的操作会起单独的资源，在机器学习框架中可以使用GPU等单独的加速硬件。
+
+## 4.核心功能
+
+### 4.1.查询语言
+
+TuGraph 提供 Cypher 图查询语言，遵循OpenCypher标准。
+- __支持Procedure嵌入__
+
+- __可插拔优化框架__ 各类优化功能
+
+- __可扩展安全性检查框架__ 对于cypher进行
+
+### 4.2.存储过程
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个 REST 请求并在客户端完成整个
+处理流程的方式，TuGraph 提供的存储过程（Procedure）是更简洁和高效的选择。
+
+从 3.5 版本开始，TuGraph 重新设计了新的存储过程编程范式，支持定义标准的签名和结果，支持POG编程。
+
+TuGraph 支持 POG (Procedres on Graph Query Languages) 编程和 POG 库，其中“Graph Query Languages”包含 Cypher 以及
+制定中的 ISO GQL 等图查询语言。POG 库提供在查询语言中对用户定义的存储过程的访问，打破了查询语言和存储过程之间的界限，扩展了查询
+语言的使用范围。
+
+> 这个文档描述了 [新的 Procedure 编程范式以及 POG](../9.olap&procedure/1.procedure/1.procedure.md)。
+
+### 4.3.数据导入导出
+
+尽管TuGraph本身支持数据的插入，但批量导入能够大幅提升的效率。导入的功能可以分为空库导入（离线导入）和增量导入，前者指子图是空的时候进行导入，额外的假设能够大幅提升导入的性能，在 TuGraph 中，空库导入和增量导入的吞吐率差了10 倍。在数据导出中，需要考虑导出数据的一致性，即是基于一个快照数据导出的。
+
+TuGraph 可以通过 命令行工具`lgraph_export` 来对已经存放在TuGraph的图数据进行数据导出，导出格式支持CSV和JSON。
+
+### 4.4.备份恢复
+
+TUGraph的备份在功能上可分为主动/定时、离线/在线、全量/增量备份，用尽量小的存储和计算代价来完成备份。恢复功能可以恢复到最新的状态，或者历史标注的时间点，需要保证数据库是一致的状态。
+
+### 4.5 数据预热
+
+TuGraph 是基于磁盘的图数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+### 4.6 高可用
+
+高可用是指通过通过集群配置，做到实时多副本数据热备，在部分副本不用时，集群仍然能正常提供服务，TuGraph采用 RAFT 协议的多机热备机制，能够将 RPO 降低到接近 0 的程度。TuGraph 选择在计算层进行数据同步，同步的对象是写操作，通过 RPC 接口快速同步。TuGraph 的高可用集群采用主从模式，只有主节点处理写请求，主从节点均能处理读请求。主节点的写请求处理需要同步到多于二分之一的总节点上，多数节点写成功，该写请求才算完成。
+
+## 5.客户端工具
+
+客户端主要分为各种编程语言的SDK，OGM以及命令行工具。
+
+客户端 SDK 主要用于二次开发，可以通过 RPC 或 REST 协议链接服务端。RPC 基于长链接有较好的性能，数据需要通过 protobuf 统一序列化。TuGraph 使用brpc，支持 Java、Python、C++ 的 rpc 客户端。REST 的协议比较宽泛，能够简单适配更加多样的环境，不同的编程语言能够简单对接。TuGraph 给出了 Python 的REST 客户端实例，命令行的交互也是用 REST 实现。
+
+OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。
+
+命令行工具`lgraph_cypher`是查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+
+## 6.生态工具
+
+生态工具是企业级数据库一个非常重要的组成部分，丰富的生态工具能够大大提升图数据库的可用性，稳定性。
+
+### 6.1.TuGraph DataX
+
+![导入导出](../../../images/tugraph-datax.png)
+
+TuGraph 核心支持 CSV 和 JSON 合适的导入导出，提供空库导入和增量导入的模式。实际中会存在 MySQL、Kafka、Hive 等多数据源导入的需求，TuGraph 通过 DataX 做多数据源的对接。由于关系模型和图模型存在的差异，数据清洗的流程可以使用 SparkSQL 快速处理，TuGraph 本身仅关注 CSV 和 JSON 的简单场景导入可靠性和性能。
+
+### 6.2.可视化交互
+
+TuGraph Browser 是面向图数据库直接使用者的可视化交互界面，功能上覆盖了 TuGraph 的绝大部分能力，包括数据导入、图模型建立、数据增删查改、监控运维等操作链路。
+
+### 6.3.运维监控
+
+TuGraph 使用 Prometheus 加 Grafana 的监控框架，采用松耦合的方式。Prometheus 从 TuGraph 的监控接口获取监控信息，存储在本地时序数据库中，然后通过 Grafana 在网页端交互展示。
+
+TuGraph 提供的监控的状态包括图数据库的状态和服务器的状态，前者包括读写负载、点边数量等数据库端的状态，后者包括内存、CPU、硬盘等服务器的实时状态。如果某些监控状态超过了预期的阈值，就需要主动告警，通常需要对接其他运维管控系统，比如群消息、邮件告警等。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..4cc5c0c10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# 应用场景
+
+> 此文档主要介绍图数据库适用的应用场景。
+
+## 1. 金融领域
+
+金融领域的实体主要涉及人、公司、账户、产品等，它们之间的关系包括交易关系、登录关系、股权关系、雇佣关系等。这些实体构成了一张金融图数据网络。应用图数据库，我们可以从金融图数据网络里发掘出大量有用信息，帮助我们做出更准确的金融决策。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|贷款审核|通过分析申请人的关联关系、交易情况等辅助判断申请人的偿还能力和偿还意愿，可应用于零售贷款审核、小微贷款审核、供应链金融等。此方法可与传统的基于申请人自身信息的审核机制互补，在个体信息录覆盖较低的小微贷款审核中尤其有用。|
+|贷后管理|通过分析借款人交易情况，辅助分析借款人是否有逾期风险。相比于传统只在贷款资金流向特定用户的情况下发出警报的方式不同，该方法可以给每个账户赋予一个风险值，并在贷款流向高风险账户时给出预警。|
+|失联修复|通过分析失联贷款人的社交和购物数据，找出其它联系方式。该方法可以大幅改进失联修复率。|
+|担保环检测|可在担保关系图中找出环状、链式、家族式、交叉等特殊担保结构，揭露潜在风险。相比于关系型数据库的JOIN方法，基于图算法的方案更高效，可以检测出任意长的担保环，且可以实现更复杂限定条件的检测。|
+|信用卡团伙欺诈检测|构建信用卡申请信息中的地址、联系方式等关系网络，在申请关系网络中运行社区发现算法，可以检测出疑似欺诈的团伙，从而拒绝涉嫌欺诈的申请件，减少经济损失。|
+|反洗钱|通过交易网络和介质网络，找出疑似洗钱的行为和链路。洗钱是一个复杂的多方参与的过程，通过在交易和社交网络中进行图分析，我们可以更精准的检测出洗钱行为。|
+|车险反欺诈|针对有修理厂参与的骗保行为，通过分析被保人、案件地点和修理厂之间的关系，可以更精准的识别出骗保行为，减少经济损失。|
+
+## 2. 工业领域
+
+在生产和制造过程中会产生大量异构数据，如何有效的组织和管理这些数据是工业大数据中最重要的问题之一。这些数据包括设计文档、设备数据、仿真方案和结果、实验结果、经验文档等，关系错综复杂。传统的数据管理系统只能累积数据，而查找相关材料则往往力不从心。使用图模型，将这些不同类型的数据组织成一张网络，就可以方便地浏览和查找数据。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|供应链管理|供应链数据主要关心产品—部件—零件的对应关系、零件与供应商的对应关系、零件中的敏感成分等。相比于传统的物料管理（BOM）系统，使用图数据库的方案可以更方便地维护多个部件层次、多个供应商级别的复杂网络，从而为穿透式供应链提供基础支持。|
+|文档管理|使用图数据库可以将不同类型的文档按不同关系有机地组织在一起。例如将部件设计文档、部件—零件关系、部件测试文档、相关经验文档等组织起来，在需要查找时就可以方便获取该部件的所有相关信息。|
+|研发过程管理|产品研发和验证过程中需要进行大量仿真、试验和测试，每一个测试流程都会涉及大量不同的步骤。步骤之间的连接关系、每个步骤中使用的数据版本、算法版本等就构成了一张复杂的关系网络。使用图数据库可以更好管理这个关系网络，从而为研发过程中的数据复用、流程改进提供良好基础。|
+|设备信息管理|制造业需要管理大量设备，设备之间又互相关联（供电关系、供料关系、空间关系），从而形成了一张复杂的网络。传统的数据库很难体现这种复杂关系。而使用图数据库则可以便捷表示这些关系，从而更好的管理设备信息。|
+
+## 3. 智慧城市
+
+随着科技的发展，城市的智能化管理已成为一个大趋势。智能化管理需要建立在良好的信息管理平台之上，因此需要强大的系统软件做支撑。在智能化城市管理系统中，智能化决策系统需要基于大量不同信息做出决策，这些信息包括各种拓扑信息（道路、管线），供求信息（电力输送、饮用水供应、污水排放），环境信息（温度、湿度、雨量）等。要将这些复杂的异构数据有机管理起来，并基于它们做出决策，就需要一个成熟的系统。传统的数据管理系统基于关系数据模型，并不适合管理这种复杂异构数据。而使用图模型就可以很好的解决这一问题。如果我们将这些不同的数据利用图数据库进行管理，就可以实现很多复杂的智能管理场景。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|智能交通|基于道路拓扑、道路容量及当前流量，可以进行智能信号灯调度，从而提高通行效率。|
+|智能排水|基于排水系统信息及当前雨量，可以对排水系统进行调度，从而减少内涝的产生。|
+|管线管理|将管线的生产、安装、拓扑信息，以及历史状态信息有机组织起来，可以帮助我们对管线进行全周期管理，包括故障排查、寿命评估等。|
+|人群疏散|大量人群需要疏散时，需要考虑公交、地铁、出租车、共享单车等多种交通方式，同时还需要考虑道路承载量。使用图数据库将这些信息有机整合在一起，可以帮助我们更好的做出决策，以便为大型公共活动提供更好的支持。|
+
+## 4. 社会治理
+
+社会治理包括公共安全、法律事务、舆论、网络安全等多方面。社会治理是一个综合性的、多系统联动问题。它需要综合大量数据、全局考量才能做出更好的决策。在这种多维度复杂数据问题上，图数据模型可以提供更好的适应性，从而为智能化的社会治理决策平台提供坚实的基础。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|犯罪团伙发现|合谋团伙必然会通过某些方式产生联系，这种联系包括面谈（出现在同一地点）、电话联系、或者互联网联系，他们还可能有经济往来。如果我们将这些数据统一存放在一张图中，我们就可以通过图分析算法查找出联系紧密的群体，从而发现和识别整个犯罪团伙。|
+|涉众案件调查|涉众案件，特别是涉众经济案件往往涉及大量的人员和要素（货币、地点、事件等）。如何有效的组织这些资料，从而为办案提供证据支持是涉众案件调查的一个难点。使用图数据库来存储和分析这些资料，可以让我们快速定位资料、分析人员构成、为案件调查提供更好的技术支持。|
+|违法网站甄别|违法网站、钓鱼网站、黄色网站等往往通过使用不同的域名和IP来避免被封杀。基于黑名单的过滤方法只能封禁已知的违法网站，无法对新出现的域名和IP进行有效甄别。基于IP—域名网络的映射关系，我们可以建立一张图，然后通过图计算建立起域名和IP的“可信度”模型，利用该模型来判断网站是否属于违法网站。|
+|法院卷宗管理|卷宗往往错综复杂，不同的案件之间可能通过当事人产生联系，也可能通过案发地、案件性质、审判人员等产生联系。这些联系构成了一张复杂的网络。使用图数据库我们可以更方便的管理这些复杂关系，提高办案和查询效率。|
+
+## 5. 互联网
+
+人—人关系的社交网络、人—商品的购买关系都能构成图。通过分析这些网络数据，我们可以为用户提供更优质的服务，包括相关推荐、用户信息归集、重要用户识别、垃圾用户识别等。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|ID映射|图数据库可以将用户相关的所有信息，包括用户之间的关系统一存储在一个数据库中，同时还能通过这些关系来找出疑似单人多号和多人一号的情况，从而为后期的风控、推荐等业务提供决策支持。|
+|好友推荐|基于分析社交网络，我们可以提供“好友的好友”，“共同好友”等好友推荐。|
+|商品推荐|基于用户—商品关系图，我们可以找出兴趣爱好类似的用户，向他们推荐类似用户选择的其他商品。|
+|垃圾用户识别|传统的垃圾用户识别主要基于用户账号本身的信息，如注册信息、发帖信息等，但是这些信息都比较容易伪造。而基于网络的信息则不存在这个问题：它们很难被伪造。因此基于网络信息的垃圾用户识别可以更加精准和高效。|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..5171d5ece8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/9.glossary.md
@@ -0,0 +1,38 @@
+# 名词解释
+
+## 1.图技术
+
+> __图计算__：广义图计算，技术上包括图查询、图分析、图学习；狭义图计算，包括图计算任务和图分析。
+
+> __图查询__：指图数据库的查询能力，通常通过Cypher/ISO GQL等查询语言实现。
+
+> __图分析__：侧重于对全图数据的算法分析、模式分析等。
+
+> __图学习__：与图神经网络、图机器学习含义相同。
+
+> __图智能__：等于广义图计算，包括图数据库、图分析、图学习，通常用于概念推广，不用于产品。
+
+## 2.图产品
+
+> __图计算系统__：一般包括图数据库、图分析系统、图学习系统，有时也特指图分析系统。
+
+> __图数据库__：侧重于对图数据的增删改查、事务性操作等，如TuGraph DB、Neo4j、JanusGraph等。
+
+> __图分析系统__：解决图分析问题，可以细分为流水图分析、离线图分析，如TuGraph Analytics、GraphX等。
+
+> __图学习系统__：解决图学习问题，比如TuGraph Learn、DGL等。
+
+## 3.具体概念
+
+
+> __Vertex__：点，也叫顶点，也指 Vertex Value。尽量避免Node（结点、节点）的叫法，一般用Node表示服务器个数，容易叫混。结点指结合、交结、交叉的意思；节点可以指一个时间线上的里程碑（关键节点）或计算机系统里的一个处理实体（如计算机网络里的一台服务器）。
+
+> __Edge__：边，也指 Edge Value。
+
+> __Vertex Label__：点类型，也叫 Vertex Type。
+
+> __Edge Label__：边类型，也叫 Edge Type。
+
+> __Degree__：度，入度/出度，表示一个点的入边、出边的条数。注意，在非图论的场景中，往往把“跳”也称作“度”。
+
+> __Hop__：跳，表示一个点到另一个点之间的路径经过的点数（不含起点、含终点）。算法性能测试里K-Hop即为此义。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/index.rst
new file mode 100644
index 0000000000..efe03a5128
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph入门
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..0e252fdd08
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/1.preparation.md
@@ -0,0 +1,88 @@
+# 快速上手
+
+> 此文档主要用于新用户快速上手，其中包含了 TuGraph 的简介、特征、安装和使用。
+
+## 1.简介
+
+TuGraph 是蚂蚁集团自主研发的大规模图计算系统，提供图数据库引擎和图分析引擎。其主要特点是大数据量存储和计算，高吞吐率，以及灵活的 API，同时支持高效的在线事务处理（OLTP）和在线分析处理（OLAP）。 LightGraph、GeaGraph 是 TuGraph 的曾用名。
+
+主要功能特征包括：
+
+- 标签属性图模型
+- 支持多图
+- 完善的 ACID 事务处理
+- 内置 34 图分析算法
+- 基于 web 客户端的图可视化工具
+- 支持 RESTful API 和 RPC
+- OpenCypher 图查询语言
+- 基于 C++/Python/Java 的存储过程
+- 适用于高效图算法开发的 Traversal API
+
+性能及可扩展性特征包括：
+
+- TB 级大容量
+- 千万点/秒的高吞吐率
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线备份
+
+
+### 1.1.支持的平台
+
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的的平台。
+
+### 1.2.硬件要求
+
+_目前我们建议用户使用 NVMe SSD 配合较大的内存配置以获取最佳性能。_
+
+| 硬件   | 最低配置      | 建议配置                     |
+|------|-----------|--------------------------|
+| CPU  | X86_64    | Xeon E5 2670 v4          |
+| 内存   | 4GB       | 256GB                    |
+| 硬盘   | 100GB     | 1TB NVMe SSD             |
+| 操作系统 | Linux 2.6 | Ubuntu 18.04, CentOS 7.3 |
+
+## 2.安装
+
+TuGraph 可以通过 Docker Image 快速安装，或者通过 rpm/deb 包本地安装。另外TuGraph在阿里云计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。
+
+> 安装包/镜像下载：参考[下载地址](../1.guide.md)中的“TuGraph最新版本”章节。
+
+> 计算巢部署：可以在阿里云计算巢自行搜索，也可以通过[部署链接]( ../5.installation&running/5.cloud-deployment.md )快速访问。
+
+### 2.1.通过docker快速体验
+
+1. 本地安装 docker 环境
+
+   参考 docker 官方文档：https://docs.docker.com/get-started/
+
+2. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. 启动docker
+   ```shell
+    docker run -it -d -p 7001:7001 -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 8888:8888 -p 8889:8889 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000是默认的http端口，访问tugraph-db-browser使用。
+   # 7070是默认的http端口，访问legacy tugraph-web访问使用。
+   # 7687是bolt端口，bolt client访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   
+   # 根据/usr/local/etc/lgraph.json的tugraph启动的默认配置，
+   # /var/lib/lgraph/data是容器内的默认数据目录，/var/log/lgraph_log是容器内的默认日志目录
+   # 命令将数据目录和日志目录挂载到了宿主机的/root/tugraph/上进行持久化，您可以根据实际情况修改。
+   ```
+
+4. 前端访问
+
+访问tugraph-db-browser: `http://x.x.x.x:8000`，默认用户名为 `admin`，密码为 `73@TuGraph`。
+首次登录会默认跳转修改密码页面，请尽快修改默认密码避免安全风险。
+
+**注意**：
+如果需要使用legacy tugraph-web，访问`http://x.x.x.x:7070`，默认用户名为 `admin`，密码为 `73@TuGraph`。 
+但请注意，legacy web是不再维护的版本，建议使用tugraph-db-browser。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..b8dd8d03ec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# 影视场景Demo
+
+> 此文档主要介绍 影视场景Demo 的使用方法。
+
+## 1.建模和数据导入
+
+完成登录后，点击`新建图项目`，选择movie数据，填写图项目配置，系统会自动完成Movie场景图项目创建。或者直接使用产品自带的movie图项目（带有官方图标）。
+
+Movie 场景图：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| 标签          | 类型  | 说明                                  |
+|-------------|-----|-------------------------------------|
+| movie       | 实体  | 表示某一部具体的影片，比如"阿甘正传"。                |
+| person      | 实体  | 表示个人，对影片来说可能是演员、导演，或编剧。             |
+| genre       | 实体  | 表示影片的类型，比如剧情片、恐怖片。                  |
+| keyword     | 实体  | 表示与影片相关的一些关键字，比如"拯救世界"、"虚拟现实"、"地铁"。 |
+| user        | 实体  | 表示观影的用户。                            |
+| produce     | 关系  | 表示影片的出品人关系。                         |
+| acted_in    | 关系  | 表示演员出演了哪些影片。                        |
+| direct      | 关系  | 表示影片的导演是谁。                          |
+| write       | 关系  | 表示影片的编剧关系。                          |
+| has_genre   | 关系  | 表示影片的类型分类。                          |
+| has_keyword | 关系  | 表示影片的一些关键字，即更细分类的标签。                |
+| rate        | 关系  | 表示用户对影片的打分。                         |
+
+## 2.查询示例
+
+### 2.1.示例一
+
+查询影片 'Forrest Gump' 的所有演员，返回影片和演员构成的子图。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.示例二
+
+查询影片 'Forrest Gump' 的所有演员，列出演员在影片中扮演的角色。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.示例三
+
+查询 Michael 所有评分低于 3 分的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.示例四
+
+查询和 Michael 有相同讨厌的影片的用户，讨厌标准为评分小于三分。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.示例五
+
+给 Michael 推荐影片，方法为先找出和 Michael 讨厌同样影片的用户，再筛选出这部分用户喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.示例六
+
+查询 Michael 的好友们喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.示例七
+
+通过查询给'Forrest Gump'打高分的人也喜欢哪些影片，给喜欢'Forrest Gump'的用户推荐类似的影片。
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..c39e48f40d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,62 @@
+# 场景：流浪地球
+
+> 此文档主要介绍 流浪地球 demo的使用方法。
+
+## 1.Demo场景设计
+
+Demo背景基于流浪地球1、流浪地球2的故事背景进行设计
+
+- 基于剧情，设计了图结构，包含组织、角色、天体与设施3类点，事件、关系两类边
+- 根据剧情准备了对应Schema的数据
+- 准备了一些query，提出一些关于剧情的问题
+
+## 2.目录结构
+
+- rawdata: 原始剧情数据和schema定义文件
+- case.cypher: 查询相关的Cypher语句
+- control.sh: 控制TuGraph Server启动停止的脚本
+- lgraph_standalone.json: TuGraph Server启动的配置文件
+
+## 3.使用说明
+
+前置条件：TuGraph已安装
+
+## 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择流浪地球数据，填写图项目配置，系统会自动完成流浪地球场景图项目创建。
+    - 或者直接使用产品自带的流浪地球图项目（带有官方图标）。
+
+## 5.Cypher查询
+
+参考cypher文档，在TuGraph的Web页面前端输入Cypher进行查询
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.查询展示
+查询木星危机的所有事件经过
+
+```
+MATCH (n)-[e:事件关系]-(m) where e.title='木星危机' RETURN n,e
+```
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+查询所以危机的相关事件经过
+
+```cypher
+MATCH (n)-[e1]-(m)-[e2]-(p)
+where e1.title REGEXP ".*危机" and e2.title REGEXP ".*危机" and e1.title <> e2.title
+RETURN n,e1,e2,p
+```
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..13d98b4db8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# 场景：三体
+
+> 此文档主要介绍 三体 demo的使用方法。
+
+## 1.Demo场景设计
+Demo背景基于三体1、三体2、三体3的故事背景进行设计。
+
+根据三体故事的设定，我们设计了4类点和6类边，点包括“人物”、“组织”、“计划”、“时间线”，边包括“人物-人物关系”、“人物-计划关系”、“人物-组织关系”、“组织-计划关系”、“组织-组织关系”。
+根据剧情准备了对应Schema的数据，准备了一些query，提出一些关于剧情的问题。
+
+## 2.目录结构
+rawdata: 原始剧情数据和schema定义文件。
+case.cypher: 查询相关的Cypher语句。
+control.sh: 控制TuGraph Server启动停止的脚本。
+lgraph_standalone.json: TuGraph Server启动的配置文件。
+
+## 3.使用说明
+
+前置条件：TuGraph已安装。
+
+### 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8888，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三体数据，填写图项目配置，系统会自动完成三体场景图项目创建。
+    - 或者直接使用产品自带的三体图项目（带有官方图标）。
+
+### 5.Cypher查询
+
+参考TuGraph文档，在TuGraph的Web页面前端输入Cypher进行查询。
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![data](../../../../images/three-body-data.png)
+
+### 7.查询展示
+
+#### 7.1.人物关系查询
+三体一剧情中，一开始全世界各地发生了大量科学家自杀事件，引起了警方重视，查案过程根据人物关系线索一步步排查，就如上面的图所示，随着线索越来越多，背后的真相逐步浮出水面。史强和汪淼发现大多数人都和叶文洁有着直接或者间接的联系，并派汪淼卧底，最终发现叶文洁的最终统帅身份。在图中也可以看出，叶文洁顶点周围有很多边关系（一度或二度邻居很多）。
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.邻域顶点分析
+三体中的各种计划比较多，有的时候可能会被绕晕，这时候我们可以通过图的邻居顶点查询来查看该计划的相关人物和组织等。如"面壁计划"中,我们可以看到有四位人物与之相关，这四位也是被世人所寄予厚望的“面壁者”。
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.查询a节点和b节点的共同邻居
+我们往往希望知道两个人物之间的共同关联的人物都有谁，这样就能很快的掌握这两个人物之间的关系，在大数据量的情况下，使用cypher进行图关系分析就很方便！
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.设置/更改属性
+随着剧情推进，我们逐步了解了"叶文洁"身上的多个标签，那么我们也可以将这些标签更新至“叶文洁”节点上：
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.增加/删除节点
+后续我们了解到了罗辑、程心等等人物和PIA、星环集团等组织，希望把这些作为节点添加至图中：
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..3252a13eb5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# 场景：三国
+
+> 此文档主要介绍 三国 demo的使用方法。
+
+## 1. 简介
+由于史料的缺失，一些即使为人们熟知的历史事件也往往存在着很多未解之谜。以三国历史为例，诸葛亮为什么出山帮助当时势力弱小的刘备，同为天下英雄的曹操和刘备为什么成就差距巨大等等。以往学者往往采用二维关系分析历史，这样得出的结论往往比较片面。使用TuGraph将三国的历史人物和事件导入图模型中，使用图计算方式进行分析，能够帮助我们从有限的信息中获得更有价值的知识，是一种非常有意义的跨学科尝试。
+## 2. 数据建模
+我们设计了5类顶点和5类边，点包括“主公”，“州”，“文臣”，“武将”，“战役”，边包括“父亲”，“兄长”，“隶属”，“籍贯”，“参战”。其具体建模信息如下所示：
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. 数据导入
+- 手动导入
+    - 向TuGraph导入数据，既可以使用TuGraph的`lgraph_import`工具离线导入。lgraph_import导入命令如下所示
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- 自动创建
+    - 点击`新建图项目`，选择三国数据，填写图项目配置，系统会自动完成三国场景图项目创建。
+    - 或者直接使用产品自带的三国图项目（带有官方图标）。
+## 4. Cypher分析
+### 4.1. 诸葛亮为什么选择刘备
+通过如下cypher命令可以查看诸葛亮和曹操、刘备之间的关系
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+从图中可以很直观的看出，曹操和诸葛亮之间的最短路径之一包含徐州之战，曹操曾经因父亲被杀对徐州进行过屠城，而诸葛亮是徐州琅琊郡人，任何人都断然不会选择一个屠杀过自己家乡的军阀作为主公。而相反，刘备曾经在徐州之战中阻止过曹操的暴行，这应当是诸葛亮对刘备好感的原因之一。
+
+### 4.2. 曹操为什么成就比刘备高
+通过如下cypher命令可以查看家族对曹操创业的助力
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+平定天下最重要的就是军事人才，曹操其父本姓夏侯，过继于曹氏，曹氏和夏侯氏在谯县都属于地方大族，在曹操创业初期提供了夏侯惇，夏侯渊，曹仁，曹洪在内大量的军事人才。而刘备其父早丧，没有家族助力，年过50才凑齐了自己的五虎上将，而这时已经过了天下大乱争夺地盘的最佳时机，曹操已经天下九州居其六了。
+
+### 4.3. 三国中最强大的魏国为何最先灭亡
+通过如下cypher命令可以查看曹操集团的重要文官组成
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+曹魏事实上于249年灭亡于高平陵之变，立国29年，少于蜀汉（43年）和东吴（51年）。三国中实力最强大的魏国最先灭亡的原因就在于曹魏的文官制度（九品中正制）使得权力很容易集中在世家大族手中。从图中可以看出，曹操曹丕父子两代的重要文臣几乎都是世家大族，颍川荀氏，颍川钟氏，颍川陈氏，武威贾氏等，甚至还出现了地区化趋势，集中于颍川，最终政权也为和颍川荀氏关系密切的河内司马氏所篡夺。
+
+### 4.4. 三国各自的实力究竟如何
+通过如下cypher命令可以查看三国各集团的人口实力
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+得到的查询结果如下表所示
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+古代社会衡量一个国家实力的重要指标是人口数量，由于人口数据缺失，我们使用三国所有主公和文臣武将的籍贯数据估计每个州的人口数量。发现三国主要人物中，按籍贯有60个属于魏国，有23个属于吴国，仅有2个属于蜀国，证明魏国确实是三国中最强大的国家。
+
+### 4.5. 曹操的军事能力如何评价
+通过如下cypher命令可以查看曹操参与的主要战役
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+从图中可以看出，曹操在三国主要的15场战役中参加了8场，出场率比较高。但是曹操只获胜了徐州之战、兖州之战、官渡之战和襄樊之战，汉中之战、宛城之战、群雄讨董和赤壁之战都失败了，综合胜率50%，证明曹操并不算一个非常优秀的军事家。
+
+## 5. 备注
+更多的分析有待大家积极补充和尝试！
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..976b97e0ac
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Round The World Demo
+
+> 此文档主要介绍了基于tugraph-db开发的环球旅行（Round The World）demo
+
+## 简介
+
+基于"80天环游世界"的虚拟背景，基于部分公开历史航班数据，帮助用户设计多个城市的最优航班规划。
+- demo设计了自定义网站服务
+- 数据来源为国外某开源网站，不包含大陆城市航班数据
+- 数据中航班价格为模拟数据，不代表真实价格
+
+## 示例
+
+### 登录页面
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### 查询页面
+
+在登录页面点击后进入查询页面
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### 查询示例
+
+在左下角的城市列表中选择不超过8个城市，点击查询可返回推荐的航班规划，在满足前后航班间隔在2-6小时的要求下，返回费用最低和飞行时间最短的10条路径规划。
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+详细使用说明见[manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "")文档。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..4a29f62826
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo示例
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..e630bd12bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+快速上手
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..2cfd4197a9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,685 @@
+# 可视化操作手册
+
+> 此文档主要介绍 TuGraph Browser 的使用和操作方法。
+
+## 1.简介
+
+TuGraph Browser（以下简称Browser）是一款功能强大的产品可视化开发工具，它以直观的可视化方式呈现图数据，使用户可以轻松地管理、维护和查看数据库运行状态。此工具不仅支持图数据的管理和可视化，还支持对系统账户的管理，为用户提供了全面的操作和管理体验，让用户能够更加高效地管理和利用图数据库。
+
+## 2.操作指南
+
+### 2.1.访问
+
+当用户完成图数据库的安装后，可以通过浏览器访问Browser。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 8000。
+
+- 例如：127.0.0.1:8000
+- 推荐使用Chrome
+
+#### 2.1.1.启动配置
+
+在启动Browser之前，需要提前启动TuGraph-Server并配置好Browser与TuGraph-Server连接，配置文件在Browser目录下的env.json文件，具体配置如下所示
+```shell
+# vim /usr/local/share/lgraph/tugraph-db-browser/env.json
+{
+  "tugraph_db_host": "http://127.0.0.1:9090"
+}
+```
+需要把tugraph_db_host修改为实际TuGraph-Server RPC服务的地址
+
+#### 2.1.2.启动方式
+Browser的启动方式分为两种，一种是在docker image中，直接切到Browser所在目录，执行启动命令即可
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run dev
+```
+另一种是在本地环境中使用rpm/deb安装包，此时需要先构建后启动，因此需要在本地提前安装Node环境，具体详见源码目录下的
+ci/images/tugraph-runtime-*-Dockerfile。在本地安装TuGraph时，
+Browser会安装到本地的指定目录，切到该目录，执行如下命令即可构建并启动
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run bootstrap
+pnpm run dev
+```
+
+### 2.2.登录
+
+![login](../../../images/browser/login.png)
+
+- 浏览器成功访问Browser后，首先进入的是登录页面（如上图所示），用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 用户首次登录后，会跳转至修改密码页面，密码修改成功后，使用新密码重新登录方可使用。
+
+### 2.3.快速上手
+
+对于首次使用TuGraph的用户，可以通过产品内置的demo数据快速构建一个图项目，快速上手图数据项目。
+
+#### 2.3.1.创建图项目
+
+在`图项目`首页的选项卡中，点击`新建图项目`创建新的图项目。
+
+![快速上手-新建图项目](../../../images/browser/quickstart-creategraph.png)
+
+选择一个产品内置的demo数据，点击`下一步`按钮。
+
+![快速上手-选择一个demo](../../../images/browser/quickstart-selectdemo.png)
+
+在`填写配置`界面输入图项目信息，demo数据量都相对较小，`最大存储空间`设置为1G即可。输入完图项目信息后，点击`创建`按钮后，系统会自动创建demo数据的图模型、导入图数据。
+
+![快速上手-填写配置](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.开始图项目
+
+demo数据的图项目创建完成后，可以在`图项目`的选项卡中找到相应的图项目，可以点击`图查询`查询图数据。
+
+![快速上手-图项目选项卡](../../../images/browser/quickstart-graphtab.png)
+
+执行默认的查询语句，浏览demo里的图数据。
+
+![快速上手-验证结果](../../../images/browser/quickstart-result.png)
+
+更多快速上手文档请浏览[快速上手文档](../3.quick-start/1.preparation.md)
+
+### 2.4.图项目
+
+`图项目`提供可视化的图项目管理和图数据研发功能，它为用户提供了一系列便捷的图数据可视化操作，包括图项目的创建、修改、删除等管理操作，以及图数据的查询、点边统计等操作。此外，它也支持图模型的管理，使用户可以更加方便地进行图数据的管理和维护。
+
+#### 2.4.1.图项目管理
+
+在`图项目`界面，可以看到当前图数据库中的图项目。
+
+![图项目-首页](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.新建图项目
+
+在`图项目`界面，点击`新建图项目`按钮创建一个新的图项目。
+
+![图项目-新建图项目按钮](../../../images/browser/graphmanagement-creategraph.png)
+
+新建图项目需要通过`选择模板`和`填写配置`两个页面完成图项目的创建。
+
+- __选择模板__：产品提供空模板和demo模板两类模板。
+    - 空模板：全新的图项目，用户需要自己创建图模型和导入图数据，一般用于正式项目开发。
+    - demo模板：产品内置的demo数据，图项目创建成功后，系统会自动创建demo图模型并导入demo图数据，一般用于试用和学习。
+
+![图项目-选择模板](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __填写配置__：用户需要填写图项目基本信息，并点击`创建`按钮创建图项目。
+    - 图名称：新建图项目的名称，同时作为该图项目的唯一主键。支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+    - 图描述：新建图项目的描述，可用于详细说明该项目的背景和目标。
+    - 高级配置-最大存储空间：设置图项目最大可占用的存储空间，实际并不会提前占用物理存储空间，实际数据量达到最大存储空间阈值后不可再写入数据。
+
+![图项目-填写配置](../../../images/browser/graphmanagement-configure.png)
+
+创建成功后，可在`图项目`页面的图项目选项卡中查看。
+
+##### 2.4.1.2.编辑图项目
+
+在`图项目`界面，点击图项目选项卡中的`编辑`按钮（笔形图标），编辑对应图项目的基础信息。
+
+![图项目-编辑图项目按钮](../../../images/browser/graphmanagement-editgraph-button.png)
+
+编辑图项目功能可以修改`图名称`和`图描述`。
+
+![图项目-编辑图项目](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.删除图项目
+
+在`图项目`界面，点击图项目选项卡中的`删除`按钮（垃圾桶图标），删除对应的图项目。
+
+![图项目-删除图项目按钮](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_需要注意：图项目删除后无法恢复_。
+
+##### 2.4.1.4.点边统计
+
+在`图项目`界面，点击图项目选项卡中的`点边统计`按钮（折线图标或刷新图标），统计对应图项目的点边数量。
+
+![图项目-点边统计按钮](../../../images/browser/graphmanagement-statistics-button.png)
+
+统计结果将展示展示图项目选项卡上，未进行过点边统计的图项目会显示`暂无点边数据`，已经统计过点边数据的图项目再次统计需要点击`刷新`按钮。
+
+![图项目-点边统计](../../../images/browser/graphmanagement-statistics.png)
+
+![图项目-刷新点边统计按钮](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.图构建
+
+Browser的`图构建`功能主要用于图项目的模型定义和数据导入。在`图项目`页面中，点击图项目选项卡中的`图构建`按钮。
+
+![图构建-按钮](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.模型定义
+
+Browser提供可视化的方式创建和维护图模型。
+
+- 也可用通过`cypher`工具和`lgraph_import`工具创建和维护图模型，详见[Cypher API](../8.query/1.cypher.md)和[数据导入](../6.utility-tools/1.data-import.md)文档。
+
+###### a.浏览图模型
+
+在`模型定义`界面可以查看详细的图模型设置，支持列表和画布方式查看图模型，支持列表展示点类型的属性和索引、边类型的属性和起点/终点类型。
+
+![图构建-浏览图模型](../../../images/browser/graphbuild.png)
+
+- 支持列表查看点类型和边类型。
+    - 支持点类型和边类型的个数展示，在点类型或边类型页签中展示对应的点或边数量。
+    - 支持点类型和边类型的名称关键字搜索，在`搜索框`输入关键字可展示对应的点或边。
+
+        ![图构建-浏览图模型-搜索](../../../images/browser/graphbuild-list-search.png)
+    - 支持点类型和边类型的名称复制，点击`复制`按钮可以复制点或边的名称至粘贴板。
+
+        ![图构建-浏览图模型-复制](../../../images/browser/graphbuild-list-copy.png)
+    - 支持点类型和边类型的删除，点击`删除`按钮可以删除对应的点或边。
+
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-list-delete.png)
+- 支持画布方式查看点类型和边类型。
+- 在列表或画布中点击相应的点类型或边类型，可以展示模型详情。
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-select.png)
+
+###### b.添加点
+
+在`模型定义`界面点击`添加点`按钮，在右侧滑动窗口中添加点类型。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex-button.png)
+
+用户需要输入点类型名称、属性和索引，点击`完成`按钮完成点类型的创建。
+- 点类型名称：点的名称，也是该点的唯一标识。
+- 属性：点的属性，需要一个属性作为主键。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建点时可以任意删除属性。
+- 索引：点的索引属性，需要先创建属性再设置该属性为索引，索引创建成功后无法修改。
+    - 属性：需要配置索引的属性。
+    - 唯一：设置该属性字段为唯一值。
+    - 主键：对应属性是否为主键，选择`是`后`唯一`选项必须为`是`。
+    - 删除：在创建点时可以任意删除索引。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex.png)
+
+- 编辑点：可以增加点的属性和修改已有属性的数据类型，新增或删除索引。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+_注：主键字段的属性创建后无修改_
+
+![图构建-编辑点](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.添加边
+
+在`模型定义`界面点击`添加边`按钮，在右侧滑动窗口中添加边类型。
+
+![图构建-添加边按钮](../../../images/browser/graphbuild-addedge-button.png)
+
+用户需要输入边类型名称、属性、选择起点类型和终点类型，点击`完成`按钮完成边类型的创建。
+- 边类型名称：边的名称，也是该边的唯一标识。
+- 属性：边的属性，边上可以没有属性。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建边时可以任意删除属性。
+- 选择起点类型和终点类型：设置边的起点点类型和终点点类型，支持多个起点类型和终点类型。
+    - 起点：选择起点的点类型。
+    - 终点：选择终点的点类型。
+    - 需要提前创建至少一个点类型才能设置边的起点类型和终点。
+    - 如果不选择则表示起点和终点可以为任意点类型，同时画布上不展示对应的边，需要在左侧列表查看边类型。
+
+![图构建-添加边](../../../images/browser/graphbuild-addedge.png)
+
+- 编辑边：可以增加边的属性和修改已有属性的数据类型。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+
+![图构建-编辑边](../../../images/browser/graphbuild-editedge.png)
+
+###### d.导入模型
+
+在`模型定义`界面点击`导入模型`按钮，可以上传模型文件快速创建模型。
+
+![图构建-导入模型按钮](../../../images/browser/graphbuild-importmodel-button.png)
+
+在`导入模型`界面点击`上传文件`按钮，上传模型文件成功后，点击确定可以导入图模型。
+
+- 覆盖当前画布中的模型：选中该选项，导入时会先清空已有图模型再导入模型文件中的图模型；不选择，会导入模型文件中新增的点类型和边类型，但不会修改已有的点类型和边类型。
+
+![图构建-导入模型](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.导出模型
+
+在`模型定义`界面点击`导出模型`按钮，可以将当前图项目中的图模型导出成json文件。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel-button.png)
+
+模型文件为json格式，不建议手动修改。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.数据导入
+
+完成`模型定义`之后，点击`下一步`按钮进入数据导入页面。
+
+###### a.数据准备
+
+在数据导入前需要提前准备数据，当前Browser支持CSV文件的上传，需要保证数据文件后缀为csv。
+- 不强制要求包含表头。
+- 支持文本限定符，文本限定符为双引号。
+
+![数据导入-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.上传文件
+
+在`数据导入`页面上传需要导入的数据文件，将数据导入到图项目中。
+
+![数据导入-上传文件](../../../images/browser/graphbuild-import.png)
+
+- 分隔符：数据文件的列分隔符。
+- 文件上传：支持上传多个文件。
+    - 支持弹窗中选择多个上传文件。
+    - 支持将文件拖拽至页面中上传。
+    - 支持同时上传点文件和边文件。
+
+###### c.数据映射
+
+文件上传成功后，需要在`数据导入`页面设置`数据对应表`，将数据文件中的数据列和目标点/边、对应属性建立映射关系。
+
+- 数据对应表：展示已经上传的数据问题。
+    - 文件名称：上传的数据文件名称。
+    - 文件大小：上传的数据文件大小。
+    - 读取结果：数据文件上传结果，success为读取成功。
+    - 删除：在页面中删除，不会删除本地文件。
+- 数据文件映射：每个已上传的数据文件都需要配置映射关系。
+    - 标签：选择该文件对应的点或边类型，只能选择一类点或一类边。
+    - 从第N行，开始：从第N行开始读取数据，系统默认从第0行开始读取数据，如需跳过表头可输入1。
+    - 属性映射：下拉选择数据列对应的属性字段。
+    - 数据预览：系统会预读数据文件的前5行。
+
+![数据导入-数据映射](../../../images/browser/graphbuild-import-datamapping.png)
+
+文件上传成功后，可以点击`继续导入`按钮继续导入其他数据，或者点击`前往图查询`按钮在`图查询`页面查询已导入的数据。
+
+![数据导入-导入成功](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.图查询
+
+在`图项目`界面点击图项目选项卡中的`图查询`按钮，可以查询和访问图项目中的图数据，产品提供`语句查询`、`路径查询`、`点查询`等多种模式查询图数据，支持切换图项目和查询结果展示。
+
+![图查询-按钮](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.切换图项目
+
+`图查询`功能只能访问一个图项目数据，用户可以在`切换图项目`下拉框中选择并切换至其他图数据。
+
+![图查询-切换图项目](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.语句查询
+
+Browser提供可视化方式开发和调试图查询语句，用户可以输入图查询语句、执行并返回结果，支持收藏语句和查看图模型。
+
+![图查询-语句查询](../../../images/browser/query-view.png)
+
+###### a.语句查询窗口
+
+用户在`语句查询窗口`输入图查询语句，点击`执行`按钮可以运行对应语句，并在`执行结果页签`展示结果。
+
+- 切换查询语言：提供不同图查询语言模式的切换。_当前只支持Cypher语法_
+
+![图查询-切换语言](../../../images/browser/query-selectgql.png)
+
+- 语句查询窗口：提供当前查询语言的语法提示。
+
+![图查询-语法提示](../../../images/browser/query-gqltips.png)
+
+- 执行：点击`执行`按钮，发送输入的查询语句至后台运行。
+
+![图查询-执行按钮](../../../images/browser/query-execute-button.png)
+
+- 收藏：点击`收藏`按钮，将当前语句查询窗口的内容保存成模板，以便下次使用。
+
+![图查询-收藏按钮](../../../images/browser/query-bookmark-button.png)
+
+- 下载：点击`下载`按钮，将当前语句查询窗口的内容保存成文本文件并下载至本地，以便下次使用。
+
+![图查询-下载按钮](../../../images/browser/query-download-button.png)
+
+详细Cypher使用指南请参考文档：[Cypher API](../8.query/1.cypher.md)
+
+###### b.收藏列表
+
+以列表方式展示已经收藏的查询语句，点击列表中的收藏模板可以使用其中的语句。支持关键字搜索、名称修改以及删除。
+
+![图查询-语句收藏](../../../images/browser/query-bookmark.png)
+
+###### c.查看图模型
+
+Browser提供当前图项目中的图模型查询，方便用户查询有些点类型和边类型，支持列表展示和画布图谱展示方式，支持隐藏查看图模型窗口。
+
+![图查询-图模型列表](../../../images/browser/query-schema-list.png)
+![图查询-图模型图谱](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.路径查询
+
+Browser提供`路径查询`模板，用户可以通过选择路径的方式，查找图项目中的图数据是否存在相应的路径。
+
+![路径查询](../../../images/browser/pathquery-result.png)
+
+- 路径：在路径选择下拉框内选择需要查找的路径。
+    - 选择路径：根据图模型的定义，系统会自动匹配出对应的一度关系路径；再次点击路径下拉框会，系统会根据路径终点的点类型自动匹配下一度关系路径。
+![路径查询-选择路径](../../../images/browser/pathquery-select.png)
+    - 执行：点击`执行`按钮返回图项目中匹配的路径。
+    - 高级配置：设置扫描的路径数目，默认为100条路径。
+![路径查询-高级配置](../../../images/browser/pathquery-configuration.png)
+
+_注：需要图模型中的边设置起点和终点，如果图项目中的边均未设置起点和终点，下拉选项无结果_
+
+##### 2.4.3.4.点查询
+
+Browser提供`点查询`模板，用户可以通过选择点属性进行查询，查找图项目中的点数据。
+
+![点查询](../../../images/browser/vertexquery.png)
+
+- 选择点：选择需要查询的点类型。
+    - 属性：系统会自动匹配点类型的schema，设置相应的查询条件，点击执行按钮返回结果。
+- 返回节点数目：设置返回点数据的上限。
+
+![点查询-条件](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.执行结果页签
+
+Browser提供JSON视图、JSON文本、点边列表、点边视图等多种方式展示图查询结果，支持结果下载、插入数据、全屏展示。
+
+###### a.JSON视图
+
+Browser提供以JSON视图方式展示查询结果。
+
+![JSON视图](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON文本
+
+![JSON文本](../../../images/browser/query-result-jsontxt.png)
+
+###### c.点边列表
+
+Browser提供以点和边列表方式展示查询结果。
+
+![点边列表](../../../images/browser/query-result-list.png)
+
+###### d.点边视图
+
+Browser提供以画布方式展示查询结果。
+
+![点边视图](../../../images/browser/query-result-graph.png)
+
+###### e.插入数据
+
+Browser提供可视化方式在对应图项目中插入点或边数据。点击`插入数据`按钮，在`插入数据`页签选择点类型或边类型，输入属性值，点击确定完成数据插入。
+
+![插入数据-按钮](../../../images/browser/query-result-insert-button.png)
+
+![插入数据](../../../images/browser/query-result-insert.png)
+
+###### f.下载执行结果
+
+Browser提供图查询结果导出成文本文件功能。点击`下载执行结果`按钮，系统会自动将结果保存成文本文件并下载至本地。
+
+![下载执行结果-按钮](../../../images/browser/query-result-download.png)
+![下载执行结果-按钮](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.全屏展示
+
+Browser提供全屏方式展示图查询结果，点击`全屏显示`按钮全屏展示结果，点击`退出全屏`按钮退出全屏展示。
+
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-button.png)
+![全屏展示](../../../images/browser/query-result-fullscreen.png)
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.图分析
+
+在`图项目`界面点击图项目选项卡中的`图分析`按钮，可以在画布中展示和分析图数据，产品提供`语句查询`和`配置查询`将图项目中的数据查询并加载至画布，支持画布数据的筛选、布局样式调整以及画布操作。
+
+![图分析-按钮](../../../images/browser/graphanalysis-button.png)
+
+如下图所示，图分析功能主要包括：1、操作栏：图分析主要操作功能，包括视图切换、查询过滤、布局样式以及画布操作；2、左边栏：查询、筛选、外观功能操作区域；3、画布区域：展示图数据的区域，展示点和边数据，支持点扩展查询、收起节点、固定节点、删除节点，提供画布图数据统计等功能；4：右边栏：选中一个点数据或边数据后，会展示对应的属性信息；5、切换图项目：切换不同的图项目进行分析。
+
+![图分析-操作区域](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.语句查询
+
+在`语句查询`功能中，用户可以输入查询语句来查询图数据，并加载数据至画布区域进行展示。
+- 语法说明：TuGraph的查询语言及语法说明文档。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-语句查询](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.模板查询
+
+在`模板查询`功能中，用户可以选择节点类型和输入属性条件来查询图数据，并加载数据至画布区域进行展示。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-模板查询](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.画布分析
+
+在`画布分析`功能中，用户可以对画布中的节点或边数据进行操作和分析，主要包括：选中节点进行扩展查询、收起/展开节点、固定节点，清空画布，套索，点/边检索，画布图例等。画布上的最基础操作是拖拽点数据，鼠标左键选住一个节点并移动鼠标，可以完成点数据位置的移动。
+
+###### a.扩展查询
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，鼠标移至`扩展查询`处弹出二级悬窗，点击对应的扩展度数进行查询。
+- 一度查询：双向扩展一度关系。
+- 二度查询：双向扩展二度关系。
+- 三度查询：双向扩展三度关系。
+- 自定义查询：根据选择的条件进行扩展。
+    -边的方向：设置扩展关系的方向，双向：包含出边和入边，出边：选中起点向外指向的边，入边：指向选中起点的边。
+    -扩散度数：扩展的度数。
+    -自定义返回节点数量：配置返回至前端的节点数量，默认为100，防止遇到超级节点导致前端异常的情况。
+    -添加筛选组：设置扩展的关系类型和关系的属性条件，可以设置多组关系类型。
+
+![图分析-画布分析-扩展查询-按钮](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![图分析-画布分析-扩展查询-查询后](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![图分析-画布分析-扩展查询-自定义查询](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.收起/展开节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`收起节点`会隐藏所选节点的一度关系节点；再次右键已`收起节点`的点数据可以进行`展开节点`操作，展示已隐藏的一度关系节点。
+
+![图分析-画布分析-收起节点](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![图分析-画布分析-展开节点](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.固定节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`固定节点`会将所选节点固定在原处，固定后的节点不可移动（包括重新布局）；再次右键已`固定节点`的点数据可以进行`解除固定`操作，恢复所选节点的正常操作。
+
+![图分析-画布分析-固定节点](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![图分析-画布分析-解除固定](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.删除节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`删除节点`会将所选节点移出画布。
+
+![图分析-画布分析-删除节点](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.清空画布
+
+在`操作栏`区域点击`清空画布`按钮，会清除所有画布中的数据。
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.点/边检索
+
+在`点/边检索`窗口选择点或边，并输入关键字，会模糊检索画布中的属性数据，检索后可定位至数据位置。
+
+![图分析-画布分析-检索](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.画布图例
+
+在`画布`区域的图例位置，会展示画布中的点类型，点击点类型可以选中对应的点数据，点击更多按钮可以展示统计情况，支持列表或图表方式展示点或边的数量。
+
+![图分析-画布分析-列表](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![图分析-画布分析-图表](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.属性筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`属性筛选`进行筛选过滤。用户可以选择要筛选的点或边类型，以及对应的属性值进行设置，检索到筛选组条件的数据后会在画布上高亮选中对应的点或边数据。
+- 请选择点/边类型：选择需要检索的点类型或边类型。
+- 属性条件：设置需要检索的属性条件，可以设置多组，取并集筛选结果。
+- 添加筛选组：可以多组筛选条件，取并集筛选结果。
+- 重置：可以清空筛选条件。
+
+![图分析-筛选-属性筛选](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.统计筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`统计筛选`进行画布数据统计。用户可以选择要统计的点或边类型，以及对应的属性值进行设置，系统会自动根据用户选择的点/边类型和属性进行分组统计，支持按照图表和列表两种方式展示结果，同时点击图表或列表区域的数值可以高亮选中画布中的数据。
+
+![图分析-筛选-统计筛选](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![图分析-统计筛选-图表切换](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.布局样式
+
+在`操作栏`区域点击`布局`按钮，选择对应的布局方式会将画布中的数据进行重新排布，支持力导向布局、同心圆布局、圆形布局、辐射布局、Dagre布局以及网格布局，每种布局方式均有不同布局参数，调整参数后画布中的数据会进行重新排布。
+
+![图分析-布局样式-按钮](../../../images/browser/graphanalysis-style-layout-button.png)
+![图分析-布局样式-布局参数](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+详细布局参数可参考[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide)。
+
+##### 2.4.4.6.外观样式
+
+在`操作栏`区域点击`外观`按钮，在`左边栏`点击`点样式`或`边样式`进行外观样式配置。
+- 点样式
+    - 应用点类型：设置对应点类型的展示样式，支持同时配置多个点类型外观。
+    - 大小：对应点类型的展示大小。
+    - 颜色：对应点类型的展示颜色。
+    - 图标：对应点类型的图标样式。
+    - 显示文本：对应点类型显示的文本内容，默认为id。
+    - 高级配置：根据设置的条件标记对应的点数据。
+- 边样式
+    - 应用边类型：设置对应边类型的展示样式，支持同时配置多个边类型外观。
+    - 颜色：对应点类型的展示颜色。
+    - 边宽：对应边类型的展示宽度。
+    - 显示文本：对应边类型显示的文本内容，默认不显示。
+    - 高级配置：根据设置的条件按颜色展示对应的边数据。
+
+![图分析-外观](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.控制台
+
+`控制台`提供可视化的的账户管理和数据库信息查看功能，它为用户提供了全面的账户和角色管理功能，包括账户的增删改查以及禁用，角色的增删改查以及禁用。此外，它也为用户提供了便捷的数据库信息查看功能，让用户可以轻松地查看图数据库的基础信息和配置信息。其中，基础信息主要包括版本号、运行时间、CPP编译版本号等，而数据库配置信息则包括端口号、系统功能参数配置等。
+
+#### 2.5.1.账户管理
+
+##### 2.5.1.1.账户管理
+
+###### a.添加账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户需要输入账户名称、账户描述、账户密码以及相关角色。
+
+![账户管理-添加账户按钮](../../../images/browser/account-add-button.png)
+
+- 账户名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 相关角色：新建账户时必须要选择一个角色，在账户添加成功后，系统会自动生成一个与账户名称一样的角色。
+
+![账户管理-添加账户](../../../images/browser/account-add.png)
+
+###### b.编辑账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户可以编辑账户描述、账户密码以及相关角色。
+
+![账户管理-编辑账户](../../../images/browser/account-edit.png)
+
+###### c.禁用账户
+
+在`账户管理`界面点击`禁用`按钮禁止对应的账户登录和访问，点击`启用`按钮开启对应的账户登录和访问权限。
+
+![账户管理-禁用](../../../images/browser/account-disable.png)
+![账户管理-启用](../../../images/browser/account-enable.png)
+
+###### d.删除账户
+
+在`账户管理`界面点击`删除`按钮删除对应的账户。
+
+![账户管理-删除](../../../images/browser/account-delete.png)
+
+##### 2.5.1.2.角色管理
+
+###### a.添加角色
+
+在`角色管理`界面点击`添加`按钮创建新的角色，用户需要输入角色名称、角色描述以及图权限。
+
+![角色管理-添加角色按钮](../../../images/browser/role-add-button.png)
+
+- 角色名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 图权限：browser支持全部、读、写和无共四类图权限配置。
+    - 全部：对应图的读和写权限，包含编辑图模型权限（schema）。
+    - 读写：对应图的写权限，不包含编辑图模型权限（schema）。
+    - 只读：对应图的读权限。
+    - 无：无法访问和操作对应图。
+- 角色冲突：当两个角色对同一个图有不同图权限，同时对一个账户授权了这两个角色，该账户对该图的图权限为两个角色的并集。
+
+![角色管理-添加角色](../../../images/browser/role-add.png)
+
+###### b.编辑角色
+
+在`角色管理`界面点击`编辑`按钮编辑已有角色，用户可以编辑角色描述以及图权限。
+
+![角色管理-编辑角色](../../../images/browser/role-edit.png)
+
+###### c.禁用角色
+
+在`角色管理`界面点击`禁用`按钮禁止对应的角色，点击`启用`按钮开启对应的角色。禁用角色后，对应角色图访问权限失效。
+
+- 禁用角色：禁用之后，对应角色图访问权限失效。
+    - 当一个用户拥有两个角色对同一个图有操作权限时，当禁用其中一个角色时，另一个角色权限同样有效。
+
+![角色管理-禁用](../../../images/browser/role-disable.png)
+![角色管理-启用](../../../images/browser/role-enable.png)
+
+###### d.删除角色
+
+在`角色管理`界面点击`删除`按钮删除对应的角色。
+
+![角色管理-删除](../../../images/browser/role-delete.png)
+
+#### 2.5.2.数据库信息
+
+##### 2.5.2.1.基础信息
+
+`基础信息`获取当前系统运行的状态，并展示关键信息。
+
+![数据库信息-基础信息](../../../images/browser/db_basic.png)
+
+|参数    |含义    |
+|-------|--------|
+|TuGraph版本号|当前TuGraph的版本号，x.x.x|
+|运行时间|TuGraph服务启动到现在的时间|
+|服务器代码版本|tugraph-db仓库的当前commit|
+|前端代码版本|tugraph-web仓库的当前commit|
+|CPP编译器版本号|编译TuGraph时的CPP版本号|
+|Python版本号|编译TuGraph时的Python版本号|
+|CPP编译器ID|编译TuGraph时的CPP类型|
+
+也可以通过命令获取当前系统运行状态。
+
+```
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.数据库配置信息
+
+`数据库配置信息`获取当前系统运行的配置参数，并展示关键信息。调整配置参数或了解详细配置参数请参考[数据库运行-服务配置](../5.installation&running/7.tugraph-running.md)。
+
+![数据库信息-数据库配置信息](../../../images/browser/db_configuration.png)
+
+| 参数                          | 含义                                  |
+|-----------------------------|-------------------------------------|
+| bind_host                   | 系统启动时设置的host，一般为0.0.0.0             |
+| disable_auth                | 是否关闭token认证的定期更新，如为true则token可以永久使用 |
+| durable                     | 是否开启存储底层持久化，如为false，数据异步更新到磁盘       |
+| enable_audit_log            | 是否开启审计日志                            |
+| enable_backup_log           | 是否开启实时增量备份                          |
+| enable_fulltext_index       | 是否开启全文索引                            |
+| enable_ip_check             | 是否开启IP白名单                           |
+| enable_rpc                  | 是否开启RPC端口                           |
+| enable_ssl                  | 是否开启ssl加密传输                         |
+| optimistic_txn              | 是否开启乐观多线程写入事务                       |
+| port                        | 当前系统的REST访问端口                       |
+| rpc_port                    | RPC 及 HA 服务所用端口                     |
+| subprocess_max_idle_seconds | 自进程最大空闲时间，线程池参数                     |
+| thread_limit                | 服务端同时使用的最大线程数                       |
+| verbose                     | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。  |
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..0815c0865d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# 可视化操作手册（旧版）
+
+> 此文档主要介绍 TuGraph Browser 的使用
+
+## 定义
+
+TuGraph Browser 是 TuGraph 提供的可视化开发工具。
+
+## 作用
+
+TuGraph Browser 的主要功能是为使用图数据库的开发人员，提供可视化的图数据开发，图数据管理和维护等功能。
+
+## 操作详情
+
+### 1.连接数据库
+
+当用户完成图数据库的安装后，可以通过浏览器进行访问，TuGraph Browser 工具。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7090。
+
+### 2.登录数据库
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- 页面打开成功会，首先进图的是登录页面，用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 3.工作台
+
+#### 3.1 快速上手
+
+- 首次登录，系统会默认创建 default 空图
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- 用户点击帮助选项，并选择快速上手
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- 然后点击“一键创建模型”——>"一键创建数据"，就可以完成内置的 Movie 数据图谱的构建
+
+#### 3.2 创建子图和示例
+
+##### 3.2.1 创建子图
+
+- 点击新建子图
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- 填写表单信息
+  ![alt 填写表单](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+  - 子图名称
+  - 子图描述
+  - 配置信息
+  - 点击确认，提示创建成功
+- 切换子图
+  ![alt 切换子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- 点击新建示例
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- 选择示例并点击创建
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 查询
+
+![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 页面组成
+
+- cypher 输入框
+- 结果集展示区域
+
+##### 3.3.2 结果集展示区域功能详情
+
+- 结果集标签展示及功能
+  ![alt 结果集标签](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+  - 这里展示了结果集的所有类型统计
+  - 点击不同的“label（标签）”，可以进行以下修改操作
+    - 修改展示颜色
+    - 修改节点大小或边的粗细
+    - 修改默认展示属性或系统属性
+    - 布局修改
+      - 力导布局
+      - 网格布局
+      - 树形布局
+      - 环境布局
+    - 边聚合
+      - 相同类型，方向的边可以进行合并
+    - 创建节点
+      - 点击创建节点按钮
+      - 选择节点类型
+      - 添写节点内容
+    - 创建关系
+      - 在画布中选择起点和终点
+      - 选择可以匹配的类型
+      - 填写节点信息
+    - 停止布局
+      - 当数据量过大，导致浏览器页面卡顿时候，可以点击这个停止布局的按钮，能够提高体验的流畅度
+    - 鼠标悬停
+      - 开启此功能，可以高亮显示鼠标悬停节点的一度邻居节点
+    - 结果集导出
+      - 可以将结果集导出为 png，json，csv 三种不同的文件形式
+    - 刷新
+      - 点击刷新按钮，会重新执行当前页面的初始 cypher 语句，并刷新结果集
+    - 最大化
+      - 点击最大化，结果集展示区域将全屏展示
+    - 结果集展示形式切换
+      - 支持图谱、表格、文本三种形式
+
+##### 3.3.3 建模
+
+- 点边模型
+  ![alt 建模](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- 点边模型支持实时的、增、删、改、查
+
+- 点边模型支持导入和导出
+
+##### 3.3.4 数据导入
+
+- 本地数据导入
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+  - 选择文件编码格式
+  - 选择本地 CSV 文件
+  - 选择对应的节点或边的模型
+  - 进行数据映射
+  - 完成数据导入
+  - 单个文件最大支持2GB
+
+##### 3.3.5 插件
+
+- 存储过程的使用
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+  - 用户可以上传本地编写的 Plugin 程序，并在可视化页面进行执行，并查看执行结果
+  - 用户可以在可视化对插件进行、卸载、执行、下载等操作
+
+##### 3.3.6 帮助
+
+- 其中记录了 TuGraph-browser 的使用方式
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 控制台
+
+##### 3.4.1 数据库基础信息
+
+- 展示数据库相关的基础配置信息
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 权限管理
+
+- 用来创建用户和角色的功能模块，用户可以在这里进行权限的管理操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 实时状态
+
+- 这里展示了数据库实时状态，包括：CPU 使用率、内存用率、磁盘使用率、数据请求次数、磁盘 IO
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 任务管理
+
+- 在这里用户可以看到在正在执行中的任务，可以在此进行停止任务的操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 审计日志
+
+- 这里记录的数据库相关的审计日志，用来排查使用遇到的问题
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..811fbf0563
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+可视化操作指南
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..e2524b4134
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/1.environment.md
@@ -0,0 +1,40 @@
+# 环境准备
+
+> 此文档主要介绍 TuGraph 部署时所需的软硬件环境。
+
+## 1.硬件环境
+
+### 1.1. CPU
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的硬件平台，测试认证过的硬件平台包括 Intel、AMD、Kunpeng、Hygon、飞腾等。
+
+### 1.2. 内存
+
+我们建议内存容量不小于实际的数据大小。如果最求极致的性能，把所有的数据缓存到内存里是最理想的。在数据访问的局部性上，图数据库的局部性要比关系型数据库差，因此如果数据在内存中放不下，通常会频繁地换入换出。
+
+### 1.3. 外存
+我们强烈建议用户使用 NVMe SSD 作为外存，数据库有大量的写操作需要同步的外存，通常为随机写，外存的读写性能很容易成为整体数据库运行的性能瓶颈。因此，高IOPS、低延迟的 NVMe SSD 是最优的选择。
+
+如果现实条件只能使用 SATA接口的SSD，或者云上的网盘，性能虽然会受到影响，但 TuGraph 依然能正确的运行。
+
+外存大小建议为实际数据大小的4倍，比如数据为1TB，则准备4TB的硬盘会比较稳妥。
+
+## 2.软件环境
+
+### 2.1. 操作系统
+
+TuGraph 能够兼容主流操作系统，包括Ubuntu、CentOS、SUSE、银河麒麟、 中标麒麟、UOS等，均通过测试认证。
+
+其中最稳定使用的系统版本是 Ubuntu 18.04、CentOS 7、CentOS 8。
+
+### 2.2. 系统库
+
+编译环境和运行环境对系统库的要求不一样，具体请参考[环境分类](2.environment-mode.md)。
+
+## 3.典型配置推荐
+
+| 硬件      | 最低配置   | 建议配置                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| 内存      | 4GB       | 512GB                    |
+| 外存      | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..3dbbe91ee5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,22 @@
+# 环境分类
+
+> 此文档主要介绍 TuGraph 涉及的三种环境。
+
+## 1.分类
+
+根据环境所承载功能的不同，区分为编译环境，运行环境，以及精简运行环境。
+* 编译环境，具备TuGraph编译的所有依赖库，包含运行环境的所有依赖，并且能够编译TuGraph源码，但不包含预编译好的TuGraph可执行文件和库文件，供开发者编译源码使用。
+* 运行环境，具备GCC/Java/Python环境，能够运行TuGraph的所有功能，并且能承载全文索引，java client，c++源码上传为plugin，以及python plugin的完整功能，内置TuGraph预编译好的可执行文件和库文件，供客户直接安装使用，无需编译源码。
+* 精简运行环境，约等于裸系统加预编译TuGraph，仅能运行TuGraph的基本功能，无C++ plugin编译运行，仅so上传，无全文索引，无python plugin，供快速搭建试用。
+
+TuGraph编译后，会把所有的依赖库以.a的形式打包在一起，因此原则上运行不需要的其他的依赖库。但TuGraph支持存储过程，即在服务端编译C++代码，因此在环境中依然需要涉及的编译器。
+
+## 2.依赖系统库
+
+针对三种环境，除去TuGraph的运行包，所需要的系统库如下：
+* 编译环境，包括gcc、python、java等编译器，也包含antlr4、pybind11等，具体参见tugraph-db源码目录 ci/images/tugraph-compile-*-Dockerfile。
+* 运行环境，主要由存储过程引入，包括gcc、boost、cmake等，具体参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile。
+* 精简运行环境，无，可以参见tugraph-db源码目录 ci/images/ tugraph-mini-runtime-*-Dockerfile。
+
+
+
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..7400804d9b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,101 @@
+# Docker部署
+
+>本文档介绍TuGraph Compile及TuGraph Runtime的Docker镜像的创建、下载。
+
+## 1.简介
+
+- TuGraph Compile Image：提供编译环境，可以用于TuGraph的编译，测试；
+- TuGraph Runtime Image：提供二进制可运行环境，附带TuGraph库和可执行文件；
+- TuGraph Mini Runtime Image: 提供二进制可运行环境，不包含TuGraph中Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+## 2.现有Docker Image
+
+### 2.1.镜像下载方式
+
+镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用。
+
+最新版本的Docker地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+### 2.2.命名规范
+
+#### 2.2.1.TuGraph Compile Image
+
+提供编译环境，可以用于TuGraph的编译。
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+例如： `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+提供二进制可运行环境，附带TuGraph库和可执行文件。
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如：`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+提供二进制可运行环境，不包含TuGraph种Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如： `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.常见Docker操作
+
+Docker由Dockerfile生成，注意创建镜像需要下载依赖，因此网络问题可能会导致创建较慢或者创建失败。注意不要覆盖镜像，除非tag为 `latest`。
+
+创建Compile镜像
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+创建Runtime / Mini Runtine镜像
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+修改镜像名称
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+上传镜像
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+获取镜像
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+导出镜像
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+导入镜像
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+其他Docker操作请参考[docker官方文档](https://docs.docker.com/engine/reference/commandline/cli )
+
+
+### 2.4. M1芯片支持
+
+在 M1 芯片的机器上运行 amd64 容器可能造成未知错误。TuGraph提供 arm64 的镜像供 M1 机器使用。
+包含compile和runtime两种镜像。
+
+在`tugraph-runtime-centos7:3.6.0`与`tugraph-compile-centos7:1.2.7`及之后，`tugraph-runtime-centos7`与`tugraph-compile-centos7`提供linux/amd64和linux/arm64/v8两种架构的镜像，可以在 M1 机器上通过docker pull获取arm64架构镜像。
+
+## 3. 使用和开发TuGraph-DB Docker镜像时的最佳实践
+
+在您刚开始为TuGraph做出贡献时，请仔细阅读以下要点，并遵循它们。
+
+- 为了避免过多的Docker Layer，请尽量像现有的Dockerfile一样单行的写ENV和RUN将您的依赖项添加到Docker中。
+- 对于您需要构建依赖项的软件包/资源，请使用原始的软件包/资源，而不是在没有VCS跟踪的情况下修改这些资源。之后联系TuGraph团队将其上传到OSS以加速构建过程，如同您在Dockerfiles中看到的URL一样。
+- 为了使开发更加高效，最好从Base TuGraph编译镜像添加依赖项开始，完成开发确认依赖没问题后在Dockerfile中重新复制该过程。
+- CI使用了Docker镜像。如果您的CI失败，请检查依赖项问题。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..04125f35c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# 本地包部署
+
+> 此文档主要介绍 TuGraph 的本地包部署。
+
+## 1. 环境准备
+
+TuGraph本地包部署需要对应的环境，快速验证可以使用精简安装包，几乎不需要任何第三方库。
+
+如果您需要使用完整的TuGraph功能，请参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile，该脚本包含完整的环境构建流程。
+
+## 2. 安装包下载
+
+最新版本的安装包地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+也可以访问Github进行下载：[TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. CentOS 下的安装方法
+
+用于在 CentOS 上安装的 TuGraph 的.rpm 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.rpm 安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+用户也可以通过指定`--prefix`选项指定安装目录。
+
+## 4. Ubuntu 下的安装方法
+
+用于在 Ubuntu 上安装的 TuGraph 的.deb 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.deb`安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+该命令默认将 TuGraph 安装于`/usr/local`目录下。用户也可以通过指定 `--instdir=<directory>` 选项更改安装目录。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..7ac7e1cfc0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,125 @@
+# 云部署
+
+> 此文档主要介绍 TuGraph 的云部署，也可参见[阿里云计算巢部署文档]( https://aliyun-computenest.github.io/quickstart-tugraph/ )。
+
+## 1.简介
+
+TuGraph（tugraph.antgroup.com）是蚂蚁集团研发的高性能图数据库（Graph Database）。TuGraph在计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。本文向您介绍如何开通计算巢上的TuGraph社区版服务，以及部署流程和使用说明。
+
+## 2.实例说明
+
+TuGraph部署的为社区开源版本，源码参考Github Repo，目前可以选择的实例规格如下：
+
+| 规格族         | vCPU与内存                 | 系统盘              | 公网带宽      |
+|----------------|-------------------------|-------------------|-----------|
+| ecs.r7a.xlarge | AMD 内存型 r7a，4vCPU 32GiB | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+| ecs.r6.xlarge  | 内存型r6，4vCPU 32GiB       | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+
+预估费用在创建实例时可实时看到（目前为免费）。 如需更多规格、其他服务（如集群高可用性要求、企业级支持服务等），请联系我们 tugraph@service.alipay.com。
+
+## 3.部署流程
+
+### 3.1.准备工作
+
+在正式开始使用前，您需要一个阿里云账号，对ECS、VPC等资源进行访问和创建操作。
+
+- 若您使用个人账号，可以直接创建服务实例
+- 若您使用RAM用户创建服务实例，且是第一次使用阿里云计算巢
+    - 需要在创建服务实例前，对使用的RAM用户的账号添加相应资源的权限。添加RAM权限的详细操作，请参见为 __RAM用户授权__。所需权限如下表所示。
+    - 且需要授权创建关联角色，参考下图，选中 __同意授权并创建关联角色__
+
+| 权限策略名称                    | 备注                                    |
+|---------------------------------|---------------------------------------|
+| AliyunECSFullAccess             | 管理云服务器服务（ECS）的权限             |
+| AliyunVPCFullAccess             | 管理专有网络（VPC）的权限                 |
+| AliyunROSFullAccess             | 管理资源编排服务（ROS）的权限             |
+| AliyunComputeNestUserFullAccess | 管理计算巢服务（ComputeNest）的用户侧权限 |
+| AliyunCloudMonitorFullAccess    | 管理云监控（CloudMonitor）的权限          |
+
+![同意授权并创建关联角色](../../../images/cloud-deployment-1.png)
+
+### 3.2.部署入口
+
+您可以在阿里云计算巢自行搜索，也可以通过下述部署链接快速到达。
+
+[部署链接](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.申请试用
+
+在正式试用前，需要申请试用，按照提示填写信息，在审核通过后就可以创建TuGraph服务。
+
+![申请试用](../../../images/cloud-deployment-2.png)
+
+### 3.4.创建TuGraph服务
+
+#### 3.4.1.参数列表
+
+您在创建服务实例的过程中，需要配置服务实例信息的参数列表，具体如下。
+
+| 参数组               | 参数项   | 示例          | 说明                                                           |
+|--------------------|----------|---------------|--------------------------------------------------------------|
+| 服务实例名称         | N/A      | test          | 实例的名称                                                     |
+| 地域                 | N/A      | 华东1（杭州）   | 选中服务实例的地域，建议就近选中，以获取更好的网络延时。          |
+| 付费类型配置         | 付费类型 | 按量付费      | 免费使用请选用按量付费                                         |
+| 可用区配置           | 部署区域 | 可用区I       | 地域下的不同可用区域，确保实例非空                              |
+| 选择已有基础资源配置 | VPC ID   | vpc-xxx       | 按实际情况，选择专有网络的ID。                                   |
+| 选择已有基础资源配置 | 交换机ID | vsw-xxx       | 按实际情况，选择交换机ID。若找不到交换机, 可尝试切换地域和可用区 |
+| ECS实例配置          | 实例类型 | ecs.r6.xlarge | 当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格                      |
+|ECS实例配置|	实例密码|	**|	设置实例密码。长度8~30个字符，必须包含三项（大写字母、小写字母、数字、 ()`~!@#$%^&*_-+={}[]:;'<>,.?/ 中的特殊符号）。|
+
+#### 3.4.2.具体步骤
+
+创建服务按如下步骤进行，参考下图：
+
+- 创建实例名称，如下图中“test”
+- 选择地域，如下图中“华东1（杭州）”
+
+![创建实例](../../../images/cloud-deployment-3.png)
+
+- 选择实例类型，当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格。如果列表中无机型可选，请尝试选择其他的部署区域
+- 选中机型
+- 配置实例的密码
+- 选择部署区域，如下图中“可用区I”
+
+![选择区域](../../../images/cloud-deployment-4.png)
+
+- 点击下一步，进入订单确认页面
+- 勾选“权限确认”和“服务条款”中的复选框
+- 点击左下角绿色背景的开始免费试用，即可创建服务实例
+
+![确认](../../../images/cloud-deployment-5.png)
+
+### 3.5.启动TuGraph服务
+
+- 查看服务实例：服务实例创建成功后，部署时间大约需要2分钟。部署完成后，页面上可以看到对应的服务实例，如下图
+
+![查看实例](../../../images/cloud-deployment-6.png)
+
+- 点击该服务实例访问TuGraph。进入到对应的服务实例后，可以在页面上获取到web、rpc、ssh共3种使用方式，并且页面上展示了admin用户的密码
+
+![访问方式](../../../images/cloud-deployment-7.png)
+
+- 点击web的链接，即可跳转访问已经部署好的TuGraph Web。建议新手先通过TuGraph Web，快速使用demo上手。
+    - 首先在TuGraph Web的登录页面上，输入默认用户名admin和页面上展示的admin用户的密码进行登录，参考下图
+    - 登录完成后，选择任意一个带有官方图标的图项目，其中内置了demo数据，开启图数据的探索和发现！
+
+![登录](../../../images/cloud-deployment-8.png)
+![创建demo](../../../images/cloud-deployment-9.png)
+
+## 4.常见FAQ
+
+### 问题一：部署区域无可用资源
+
+有时，所选部署区域（如可用区G）没有所选套餐的可用资源，会报错如下图所示
+
+![部署区域错误](../../../images/cloud-deployment-10.png)
+
+__解决办法__：尝试选择其他区域，如可用区I等
+
+### 问题二: 启动后web访问不通
+
+web的启动需要一点点时间，请稍后刷新页面即可。
+
+### 问题三: 登录时的用户名密码不正确
+
+请注意检查，登录时使用的密码应为详情页面展示的密码。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..7a460830fa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/6.compile.md
@@ -0,0 +1,28 @@
+# 从源码编译
+
+> 本文档主要描述 TuGraph 从源码进行编译。
+
+## 1.前置条件
+
+推荐在linux系统下搭建TuGraph。同时docker环境是个不错的选择,如果你想设置一个新的环境，请参考[Dockerfile](3.docker-deployment.md)。
+
+## 2.编译介绍
+
+以下是编译TuGraph的步骤：
+
+1. 如果需要web接口运行`deps/build_deps.sh`，不需要web接口则跳过此步骤
+2. 根据容器系统信息执行`cmake .. -DOURSYSTEM=centos`或者`cmake .. -DOURSYSTEM=ubuntu`，如果需要shell运行lgraph_cypher，加上`-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`，如果在arm机器编译（如M1芯片的Mac中，需要加上` -DENABLE_BUILD_ON_AARCH64=ON`）
+3. `make`
+4. `make package` 或者 `cpack --config CPackConfig.cmake`
+
+示例：`tugraph/tugraph-compile-centos7`Docker环境
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..648ce6b2a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,200 @@
+# 数据库运行
+
+> 本文档主要描述 TuGraph 服务的运行模式、启动、停止和重启的操作,以及 TuGraph 的服务配置参数、配置文件格式和命令行配置参数。
+
+## 1.前置条件
+
+TuGraph 运行的前置条件为 TuGraph 正确安装，参考[安装流程](1.environment.md)。
+
+TuGraph 运行需要保证库文件 liblgraph.so 的文件位置在环境变量 LD_LIBRARY_PATH。
+
+运行 TuGraph 进程的用户不需要超级权限，但需要对配置文件（一般为lgraph.json）及文件中涉及的文件有读权限，并且对数据文件夹、日志文件夹等有写权限。
+
+## 2.运行模式
+
+TuGraph 可以作为前台普通进程启动，也可以作为后台守护进程启动。
+当作为普通进程运行时，TuGraph 可以直接将日志打印到终端，这在调试服务器配置时非常方便。但是，由于前台进程在终端退出后被终止，因此用户须确保在 TuGraph 服务器处于运行状态时，终端保持打开状态。另一方面，在守护进程模式下，即使启动它的终端退出，TuGraph 服务器也可以继续运行。因此，在长时间运行的服务器下推荐以守护进程模式启动 TuGraph 服务器。
+
+### 2.1.运行普通进程
+
+`lgraph_server -d run`命令可以将 TuGraph 作为普通进程运行。普通进程依赖命令行终端，因此终端结束时，TuGraph 进程也会自动终止。普通进程模式配合`--log_dir ""`可以将进程日志直接输出到终端，因此更方便调试。注：当不使用`-d run`命令时，将默认运行普通进程。
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d run -c lgraph_standalone.json --log_dir ""
+```
+或者：
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+普通模式的运行输出示例：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+普通进程模式下，用户可以通过按 `CTRL+C` 来提前终止 TuGraph 进程。
+
+### 2.2.运行进程守护模式
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+守护模式的运行输出示例：
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+## 3.服务操作
+
+### 3.1.启动服务
+
+TuGraph 需要通过 `lgraph_server -d start` 命令行启动，启动命令示例如下：
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+### 3.2.停止服务
+
+用户可以使用`kill`命令以及`lgraph_server -d stop`命令停止 TuGraph 守护进程。由于可能在同一台计算机上运行多个 TuGraph 服务器进程，因此我们使用`.pid`文件区分不同的服务器进程，该文件写入启动该进程的工作目录。因此，需要在相同工作目录中运行`lgraph_server-d stop`命令，以停止正确的服务器进程。
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.重启服务
+
+用户也可以通过`lgraph_server -d restart`来重启 TuGraph 服务：
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.服务配置
+
+TuGraph 服务器在启动时从配置文件和命令行选项加载配置，如果在配置文件和命令行中同一选项指定了不同的值，将优先使用命令行中指定的值。
+
+### 4.1.配置参数
+
+具体参数及其类型描述如下：
+
+| **参数名**                   | **<nobr>参数类型</nobr>** | **参数说明**                                                                                                                             |
+|---------------------------|-----------------------|--------------------------------------------------------------------------------------------------------------------------------------|
+| directory                 | 字符串                   | 数据文件所在目录。如果目录不存在 ，则自动创建。默认目录为 /var/lib/lgraph/data。                                                                                  |
+| durable                   | 布尔值                   | 是否开启实时持久化。关闭持久化可以减少写入时的磁盘 IO 开销，但是在机器断电等极端情况下可能丢失数据。默认值为 `true`。                                                                     |
+| host                      | 字符串                   | REST 服务器监听时使用的地址，一般为服务器的 IP 地址。默认地址为 0.0.0.0。注：在HA模式下，host需要设置为对应服务器的IP地址，不能设置为0.0.0.0。                                              |
+| port                      | 整型                    | REST 服务器监听时使用的端口。默认端口为 7070。                                                                                                         |
+| enable_rpc                | 布尔值                   | 是否使用 RPC 服务。默认值为 false。                                                                                                              |
+| rpc_port                  | 整型                    | RPC 及 HA 服务所用端口。默认端口为 9090。                                                                                                          |
+| enable_ha                 | 布尔值                   | 是否启动高可用模式。默认值为 false。                                                                                                                |
+| ha_log_dir                | 字符串                   | HA 日志所在目录，需要启动 HA 模式。默认值为空。                                                                                                          |
+| verbose                   | 整型                    | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。默认值为 1。                                                                                            |
+| log_dir                   | 字符串                   | 日志文件所在的目录。默认目录为 /var/log/lgraph/。                                                                                                    |
+| ssl_auth                  | 布尔值                   | 是否使用 SSL 安全认证。当开启时，REST 服务器只开启 HTTPS 服务。默认值为 false。                                                                                  |
+| web                       | 字符串                   | web 文件（包含可视化部分）所在目录。默认目录为 /usr/local/share/lgraph/resource。                                                                          |
+| server_cert               | 字符串                   | 在 SSL 认证开启时，服务器所使用的 certificate 文件路径。默认路径为 /usr/local/etc/lgraph/server-cert.pem。                                                    |
+| server_key                | 字符串                   | 在 SSL 认证开启时，服务器所使用的公钥文件。默认目录为 /usr/local/etc/lgraph/server-key.pem。                                                                  |
+| enable_audit_log          | 布尔值                   | 是否启用审计日志，默认值为 false。                                                                                                                 |
+| audit_log_expire          | 整型                    | 启用审计日志时，日志的有效时间（小时），超时自动清理，值为 0 时表示不清理。默认值为 0。                                                                                       |
+| audit_log_dir             | 字符串                   | 启用审计日志时，日志文件的存放目录。默认目录为 $directory/_audit_log_。                                                                                      |
+| load_plugins              | 布尔值                   | 启动服务时导入所有存储过程。默认值为 true。                                                                                                             |
+| optimistic_txn            | 布尔值                   | 为 Cypher 开启乐观多线程写入事务。默认为 false。                                                                                                      |
+| disable_auth              | 布尔值                   | 关闭 REST 验证。默认为 false。                                                                                                                |
+| ha_snapshot_interval_s    | 整型                    | 快照间隔（以秒为单位），默认值为 604800。-1表示不自动生成快照。                                                                                                 |
+| ha_heartbeat_interval_ms  | 整型                    | 心跳间隔（以毫秒为单位）。 默认值为 1000。                                                                                                             |
+| ha_node_offline_ms        | 整型                    | 心跳超时且节点下线间隔（以毫秒为单位）。默认为 60000。                                                                                                       |
+| ha_node_remove_ms         | 整型                    | 节点被视为完全死亡并从列表中删除的间隔（以毫秒为单位）。默认值为 120000。                                                                                             |
+| enable_ip_check           | 布尔值                   | 允许 IP 白名单，默认值为 false。                                                                                                                |
+| idle_seconds              | 整型                    | 子进程可以处于空闲状态的最大秒数。 默认值为 600。                                                                                                          |
+| enable_backup_log         | 布尔值                   | 是否启用备份日志记录。 默认值为 false。                                                                                                              |
+| backup_log_dir            | 字符串                   | 存储备份文件的目录。 默认值为空。                                                                                                                    |
+| snapshot_dir              | 字符串                   | 存储快照文件的目录。 默认值为空。                                                                                                                    |
+| thread_limit              | 整型                    | 同时使用的最大线程数。 默认值为 0，即不做限制，以 license 为准。                                                                                               |
+| unlimited_token           | 布尔值                   | 是否将链接token设置为无期限。 默认值为 false，有效期为24小时。                                                                                               |
+| reset_admin_password      | 布尔值                   | 是否重置管理者密码。 默认值为 false。 为 true 时，密码重置为`73@TuGraph`。                                                                                   |
+| enable_fulltext_index     | 布尔值                   | 是否启用全文索引功能，默认值为 false。                                                                                                               |
+| fulltext_analyzer         | 字符串                   | 全文索引分词器类型。可设为`StandardAnalyzer`或者`SmartChineseAnalyzer`。默认是`StandardAnalyzer`                                                        |
+| fulltext_commit_interval  | 整形                    | 全文索引数据提交周期,针对写操作，单位秒。默认是 0，立即提交。                                                                                                     |
+| fulltext_refresh_interval | 整形                    | 全文索引数据刷新周期，针对读操作，单位秒。默认是 0，立即可以读到最新写入的数据。                                                                                            |
+| ha_conf                   | 字符串                   | 根据 host1:port1,host2:port2,host3:port3 初始化HA集群，默认值为空。                                                                                |
+| ha_node_join_group_s      | 整形                    | 节点尝试加入高可用集群的等待时长，单位秒，默认是 10。                                                                                                         |
+| ha_bootstrap_role         | 整形                    | 是否使用bootstrap方式启动，以及使用该方式启动的服务器角色，0代表不使用bootstrap方式启动，1代表使用bootstrap方式启动且本节点为leader，2代表使用bootstrap方式启动且本节点为follower，只有这3种选项。 默认值为 0。 |
+| help                      | 布尔值                   | 打印此帮助消息。 默认值为 false。                                                                                                                 |
+
+### 4.2.服务器配置文件
+
+TuGraph 的配置文件以 JSON 格式存储。建议将大多数配置存储在配置文件中，并且仅在需要时使用命令行选项临时修改某些配置参数。
+一个典型的配置文件如下：
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7090,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..1d38b39017
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,179 @@
+# 部署高可用模式
+
+> 此文档主要介绍了高可用模式的原理、准备工作、以及服务器的操作说明
+
+## 1.原理
+
+TuGraph 通过多机热备份来提供高可用（HA）模式。在高可用模式下，对数据库的写操作会被同步到所有服务器（非witness）上，这样即使有部分服务器宕机也不会影响服务的可用性。
+
+高可用模式启动时，多个 TuGraph 服务器组成一个备份组，即高可用集群。每个备份组由三个或更多 TuGraph 服务器组成，其中某台服务器会作为`leader`，而其他复制组服务器则作为`follower`。写入请求由`leader`
+提供服务，该`leader`将每个请求复制同步到`follower`，并在请求同步到服务器后才能响应客户端。这样，如果任何服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选择出新的`leader`。
+
+TuGraph的高可用模式提供两种类型的节点：`replica`节点和`witness`节点。其中，`replica`节点是普通节点，有日志有数据，可对外提供服务。
+而`witness`节点是一种只接收心跳和日志但不保存数据的节点。根据部署需求，`leader`节点和`follower`节点可以灵活的部署为`replica`节点或`witness`节点。
+基于此，TuGraph高可用模式的部署方式有两种：一是普通部署模式，二是带witness的简约部署模式。
+
+对于普通部署模式，`leader`和所有`follower`均为`replica`类型的节点。写入请求由`leader`提供服务，该`leader`将每个请求复制同步到`follower`，
+并在请求同步到超过半数的服务器后才能响应客户端。这样，如果少于半数的服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选举出新的`leader`，通过这种方式保证数据的一致性和服务的可用性。
+
+然而，在用户服务器资源不够或者发生网络分区时，不能建立正常的HA集群。此时，由于`witness`节点没有数据，对资源占用小，可以将`witness`节点和`replica`节点部署在一台机器上。
+例如，当只有2台机器的情况下，可以在一台机器上部署`replica`节点，在另一台机器上部署`replica`节点和`witness`节点，不仅节省资源，而且不需要把日志应用到状态机上，
+也不需要生成和安装快照，因此响应请求的速度很快，可以在集群崩溃或网络分区时协助快速选举出新的`leader`，这就是TuGraph HA集群的简约部署模式。
+尽管`witness`节点有诸多好处，但是由于没有数据，集群实际上增加了一个不能成为`leader`的节点，因此可用性会略有降低。为提高集群的可用性，
+可通过指定`ha_enable_witness_to_leader`参数为`true`，允许`witness`节点临时当主。`witness`节点在把新日志同步到其他节点之后，
+会将leader角色主动切换到有最新日志的节点。
+
+v3.6及以上版本支持此功能。
+
+## 2.准备工作
+
+要启用高可用模式，用户需要：
+
+- 三台及以上的 TuGraph 服务器实例。
+
+- 在启动 lgraph_server 时打开高可用模式，可以使用配置文件或者命令行将`enable_ha`选项设置为`true`。
+
+- 设置正确的`rpc_port`，可通过配置文件或者命令行设置。
+
+## 3.启动初始备份组
+
+安装好TuGraph之后，可以使用`lgraph_server`命令在不同的机器上启动高可用集群。本节主要讲解高可用集群的启动方式，启动之后的集群状态管理参见[lgraph_peer工具](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.初始数据一致
+
+当启动时所有服务器中的数据相同或没有数据时，用户可以通过指定`--ha_conf host1:port1,host2:port2`启动服务器。
+这种方式可以将准备好的所有TuGraph实例一次性加入初始备份组，由备份组中的所有服务器根据raft协议选举出`leader`，并将其他服务器以`follower`的角色加入备份组。
+
+启动初始备份组的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+### 3.2.初始数据不一致
+
+如果第一台服务器中已有数据（以`lgraph_import`工具导入或从非高可用模式的服务器传输得到），
+并且之前并未在高可用模式下使用，则用户应使用boostrap方式启动。
+以`ha_bootstrap_role`参数为1在bootstrap模式下启动有数据的服务器，并通过`ha_conf`参数指定本机为`leader`。
+在bootstrap模式下，服务器在将新加入的服务器添加到备份组之前会将自己的
+数据复制到新服务器中，以使每个服务器中的数据保持一致。
+
+启动有数据服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+其他无数据的服务器需要指定`ha_bootstrap_role`参数为2，并通过`ha_conf`参数指定`leader`即可，命令示例如下所示
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**使用bootstrap启动HA集群时需要注意两点：**
+1. 需要等待`leader`节点生成snapshot并且成功启动之后再加入`follower`节点，否则`follower`节点可能加入失败。在启动`follower`节点时可以将`ha_node_join_group_s`参数配置的稍大，以在加入HA集群时多次等待和超时重试。
+2. HA集群只有在第一次启动时可以使用bootstrap模式，后续再启动时只能使用普通模式(见3.1节)启动，尤其不能让同一个集群的多个节点以bootstrap模式启动，否则可能产生数据不一致的情况
+
+## 4.启动witness节点
+
+### 4.1.不允许witness节点成为leader
+
+`witness`节点的启动方式和普通节点的启动方式一致，只需要设置`ha_is_witness`参数为`true`即可。需注意，witness节点的数量应少于集群节点总数量的一半。
+
+启动`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+注：默认不允许`witness`节点成为`leader`节点，这可以提高集群的性能，但是在`leader`节点崩溃时会降低集群的可用性。
+
+### 4.2.允许witness节点成为leader
+
+可以通过指定`ha_enable_witness_to_leader`参数为`true`，使得`witness`节点可以临时成为`leader`节点，在将新日志同步完成之后再主动切主
+
+启动允许成为`leader`节点的`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+注：尽管允许`witness`节点成为`leader`节点可以提高集群的可用性，但是在极端情况下可能会影响数据的一致性。因此一般应保证`witness`节点数量+1少于集群节点总数量的一半。
+
+## 5.横向扩展其他服务器
+
+启动初始备份组后，如果想对备份组进行横向扩展，要将新服务器添加到备份组，
+应使用`--ha_conf HOST：PORT`选项，其中`HOST`可以是该备份组中已有的任何服务器的 IP 地址，
+而`PORT`是其 RPC 端口。例如：
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+此命令将启动一台高可用模式的 TuGraph 服务器，并尝试将其添加到包含服务器`172.22.224.15:9090`的备份组中。
+请注意，加入备份组需要服务器将其数据与备份组的`leader`服务器同步，此过程可能需要相当长的时间，具体取决于数据的大小。
+
+## 6.停止服务器
+
+当服务器通过`CTRL-C`下线时，它将通知当前的`leader`服务器，告知其从备份组中删除该下线的服务器。如果`leader`服务器下线，
+它将在下线前将`leader`身份权限传给另一台服务器。
+
+如果服务器被终止或者与备份组中的其他服务器失去连接，则该服务器将被视为失败节点，`leader`服务器将在特定时限后将其从备份组中删除。
+
+如果任何服务器离开备份组并希望重新加入，则必须从`--ha_conf HOST:PORT`选项开始，其中`HOST`是当前备份组中的某台服务器的 IP 地址。
+
+## 7.重启服务器
+
+不建议重新启动整个备份组，因为它会中断服务。如果需要，可以关闭所有服务器。但在重新启动时，
+必须保证关闭时的备份组中至少有N/2+1的服务器能正常启动，否则启动失败。 并且，
+无论初始启动复制组时是否指定`enable_bootstrap`为true，重启服务器时都只需通过
+指定`--ha_conf host1:port1,host2:port2`参数一次性重启所有服务器即可，命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker部署高可用集群
+
+在真实业务场景中，很可能遇到在多种操作系统或架构上部署高可用集群的需求。
+差异化的环境可能导致编译TuGraph时缺少某些依赖。因此，
+在docker中编译软件并部署高可用集群是非常有应用价值的。以centos7版本的docker为例，
+部署高可用集群的步骤如下所示。
+
+### 8.1.安装镜像
+使用如下命令下载TuGraph的编译docker镜像环境
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+然后拉取TuGraph源码并编译安装
+
+### 8.2.创建容器
+使用如下命令创建容器，使用`--net=host`使得容器运行在host模式，此模式下
+docker和宿主机和共享网络namespace，即共用同一个IP。
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.启动服务
+在每台服务器上使用如下命令启动服务，因为docker和宿主机共享IP，所以可以直接指定在宿主机IP上启动服务
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.查看服务器状态
+
+备份组的当前状态可以在 TuGraph 可视化工具、REST API 以及 Cypher 查询中获取。
+
+在 TuGraph 可视化工具中，可以在 DBInfo 部分中找到备份组中的服务器及其角色列表。
+
+使用 REST API 时，可以使用`GET /info/peers` 请求获取信息。
+
+在 Cypher 中，使用`CALL dbms.listServers()`语句来查询当前备份组的状态信息。
+
+## 10.高可用模式下数据同步问题
+
+在高可用模式下，同一备份组中的不同服务器可能并不总是处于相同的状态。出于性能原因，如果请求已同步到超过一半的服务器，则`leader`服务器将认为该请求属于`committed`状态。尽管其余服务器最终将收到新请求，但服务器的状态不一致将持续一段时间。客户端也可能向刚刚重新启动的服务器发送请求，从而具有较旧的状态。
+
+为了确保客户端看到一致连续的数据，特别是为了摆脱`反向时间旅行`问题（其中客户端读取比以前看到的状态更旧的状态），每个 TuGraph 服务器都会保持一个单调增加的数据版本号。备份组中数据版本号到数据库状态的映射全局一致，这意味着如果两台服务器具有相同的数据版本号，则它们必须具有相同的数据。响应请求时，服务器在响应中包含了其数据版本号。因此，客户端可以知道它看到了哪个版本。客户端收到旧版本的数据之后可以重新向Leader发送请求，从而获取到最新的数据。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..f2bf6bb3a5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+安装和运行
+============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..25b873ab03
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,482 @@
+# 数据导入
+
+> 此文档主要介绍 TuGraph 的数据导入功能。其中包括 CSV 格式的分隔符，jsonline 的格式示例，以及导入在线和离线的两种模式。
+
+## 1.简介
+
+在图数据库服务安装成功后，您可以使用`lgraph_import`批量导入工具将现有数据导入 TuGraph。`lgraph_import`支持从 CSV 文件和 JSON 数据源导入数据。
+
+> CSV 格式
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline 格式
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph 支持两种导入模式：
+
+- _离线模式_：读取数据并将其导入指定服务器的数据文件，应仅在服务器离线时完成。
+- _在线模式_：读取数据并将其发送到工作中的服务器，然后将数据导入其数据库。
+
+## 2.CSV文件格式分隔符
+
+    CSV格式的分隔符可以是单字符或多字符组成的字符串，其中不能包含`\r`或`\n`。注意不同的shell会对输入字符串做不同的处理，因此针对不同的shell输入参数可能需要不同的转义处理。
+
+此外，`lgraph_import`还支持以下转义字符，以便输入特殊符号：
+
+| 转义符 | 说明                                                             |
+| ------ | ---------------------------------------------------------------- |
+| \\     | 反斜杠`\\`                                                       |
+| \\a    | 响铃，即 ASCII 码 0x07                                           |
+| \\f    | form-feed，即 ASCII 码 0x0c                                      |
+| \\t    | 水平制表符，即 ASCII 码 0x09                                     |
+| \\v    | 垂直制表符，即 ASCII 码 0x0b                                     |
+| \\xnn  | 两位十六进制数，表示一个字节，如\\x9A                            |
+| \\nnn  | 三位八进制数，表示一个字节，如\\001, \\443，数值范围不能超过 255 |
+
+例：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.配置文件
+
+`lgraph_import`工具通过指定的配置文件进行环境配置。配置文件描述输入文件的路径、它们所代表的点/边以及点/边的格式。
+
+### 3.1.配置文件格式
+
+配置文件包含两部分：schema 和 files。`schema`部分定义 label，`files`部分描述要导入的数据文件。
+
+#### 3.1.1.关键字
+
+- schema (数组形式）
+  - label（必选，字符串形式）
+  - type（必选，值只能是 VERTEX 或者 EDGE）
+  - properties（数组形式，对于点必选，对于边如果没有属性可以不配置）
+    - name（必选，字符串形式）
+    - type （必选，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（可选，代表该字段可以配置，也可以不配置）
+    - index（可选，该字段是否需要建索引）
+    - unique（可选，该字段是否建索引，并且是 unique 类型的，即全局唯一）
+    - pair_unique（可选，该字段是否建索引，并且是 pari_unique 类型的，即两点间唯一，仅用于边索引）unique与pair_unique只能设置一个，同时设置并运行将会因为输入异常而终止
+  - primary (仅点配置，必选，主键字段，需指定一个 property，用来唯一确定一个点)
+  - temproal (仅边配置，可选，指定时间戳属性用于存储层排序)
+  - temporal_field_order (仅边配置，可选，默认为"ASC"，表示升序，也可配置为"DESC"，表示降序)
+  - constraints (仅边配置，可选，数组形式，起点和终点的 label，不配置或者为空代表不限制)
+  - detach_property (点边都可配置，可选，默认是`false`。`true` 代表属性数据单独存放，在内存不够，属性数据比较多的场景下可以减少io读放大)
+- files （数组形式）
+  - path（必选，字符串，可以是文件路径或者目录的路径，如果是目录会导入此目录下的所有文件，需要保证有相同的 schema）
+  - header（可选，数字，头信息占文件起始的几行，没有就是 0）
+  - format（必须选，只能是 JSON 或者 CSV）
+  - label（必选，字符串）
+  - columns（数组形式）
+    - SRC_ID (特殊字符串，仅边有，代表这列是起始点数据)
+    - DST_ID (特殊字符串，仅边有，代表这列是目的点数据)
+    - SKIP   (特殊字符串，代表跳过这列数据)
+    - [property]
+  - SRC_ID (仅边配置，值是起始点标签)
+  - DST_ID (仅边配置，值是目的点标签)
+
+#### 3.1.2.索引长度
+因为TuGraph对key的长度有限制，因此针对属性很长的列创建索引时，会进行截断处理，如果是唯一索引，需要注意截断后保留的内容依然是唯一的。另外在通过迭代器遍历索引时，拿到的key是经过截断的，可能和预期不一致。针对不同类型的索引，截断长度是不同的。
+##### 3.1.2.1.unique索引
+unique索引是全局唯一的，该索引key的最大长度是480bytes。primary作为特殊的unique索引，因此最大key的长度也是480bytes
+##### 3.1.2.2.pair_unique索引
+pair_unique索引是指两点间唯一的索引，这种类型的索引只能创建于边的schema中，这种索引在用户指定的key后面加上了源点和目标点的vid，每个vid是5bytes长度。因此最大key的长度是470bytes。
+##### 3.1.2.3.非唯一索引
+非唯一索引是指既没有设置unique为1，也没有设置pair_unique为1的索引，在TuGraph的实现中，此类索引一个key可能映射到多个值，为了加速查找和写入，在用户指定的key后面加上了一组vid或euid中的最大值。其中对于创建于点中的非唯一索引，key后面跟着vid，每个vid是5bytes长度，因此最大长度是475bytes。对于创建于边中的非唯一索引，key后面跟着euid，每个euid是24bytes长度，因此最大长度是456bytes。
+
+### 3.2.配置文件示例
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+对于上述配置文件，定义了三个 label：两个点类型`actor`和`movie`，一个边类型`role`。每个 label 都描述了：label 的名字、类型（点还是边）、属性字段有哪些以及每个字段的类型。对于点，另外定义了 primary 字段是哪个；对于边，另外定义了 constraints 字段，用来限制边的起点和终点只能是哪些组合。
+
+还描述了三个数据文件，两个点的数据文件`actors.csv`和`movies.csv`，一个边的数据文件`roles.csv`。每个部分都描述了：文件的路径（path）、数据类型（format）、信息头占开头几行（header）、是哪个 label 的数据（label）、文件中每行数据中的每个列对应的字段是哪个。
+
+对于上述配置文件，import 工具在执行的过程中会先在 TuGraph 中创建`actor`、`movie`、`role`这三个 label，然后再执行三个文件的数据导入。
+
+## 4.离线全量导入
+
+离线模式只能在离线状态的服务器使用。离线导入会创建一张新图，因此更适合新安装的 TuGraph 服务器上的第一次数据导入。
+要在离线模式下使用`lgraph_import`工具，可以指定`lgraph_import --online false`选项。要了解可用的命令行选项，请使用`lgraph_import --online false --help`：
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+命令行参数：
+
+- **-c, --config_file** `config_file`: 导入配置文件名，其格式要求见下述。
+- **--log** `log_dir`: 日志目录。默认为空字符串，此时将日志信息输出到控制台。
+- **--verbose** `0/1/2`: 日志等级，等级越高输出信息越详细。默认为 1。
+- **-i, --continue_on_error** `true/false`: 在碰到错误时跳过错误并继续，默认为 false，碰到错误立即退出。
+- **-d, --dir** `{diretory}`: 数据库目录，导入工具会将数据写到这个目录。默认为`./db`。
+- **--delimiter** `{delimiter}`: 数据文件分隔符。只在数据源是 CSV 格式时使用，默认为`","`。
+- **-u, --username** `{user}`: 数据库用户名。需要是管理员用户才能执行离线导入。
+- **-p, --password** `{password}`: 指定的数据库用户的密码
+- **--overwrite** `true/false`: 是否覆盖数据。设为 true 时，如果数据目录已经存在，则覆盖数据。默认为`false`。
+- **-g, --graph** `{graph_name}`: 指定需要导入的图种类。
+- **-h, --help**: 输出帮助信息。
+
+### 4.1.离线导入示例
+
+在这个例子中，我们使用上面描述的电影-演员数据来演示导入工具的使用方法。待导入数据分为三个文件：`movies.csv`，`actors.csv`，`roles.csv`。
+
+`movies.csv`包含的是电影的信息，其中每部电影有一个 id（作为检索的 primary key），此外每部电影还拥有 title、year 和 rating 等属性。（数据来自[IMDb](http://www.imdb.com)）。
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+对应的 jsonline 格式如下:
+也可以所有字段都是字符串形式，导入的时候会转换成对应的类型
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`包含的是演员的信息。每个演员也拥有一个 id，以及 name 等属性。
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> 对应的 jsonline 格式如下:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`则包含了演员在哪个电影中扮演了哪个角色的信息。其中每一行记录的是指定演员在指定电影里饰演的角色，对应数据库中的一条边。`SRC_ID` 和 `DST_ID` 分别是边的源点和目标点，他们分别是`actors.csv`和`movies.csv`中定义的`primary`属性。
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+对应的 jsonline 格式如下:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+`配置文件import.conf`，注意每个文件中有两个标题行，因此我们需要指定`HEADER=2`选项。
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+使用导入配置文件，我们现在可以使用以下命令导入数据：
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # 从import.conf读取配置信息
+        --dir /data/lgraph_db      # 将数据存放在/data/lgraph_db
+        --graph mygraph            # 导入名为 mygraph 的图
+```
+
+**注意**：
+
+- 如果名为`mygraph`的图已存在，导入工具将打印错误消息并退出。要强制覆盖图形，可以使用`--overwrite true` 选项。
+- 配置文件和数据文件必须使用 UTF-8 编码（或普通 ASCII 编码，即 UTF-8 的子集）存储。如果任何文件使用 UTF-8 以外的编码（例如，带有 BOM 或 GBK 的 UTF-8）编码，则导入将失败，并输出分析器错误。
+
+## 5.在线增量导入
+
+在线导入模式可用于将一批文件导入已在运行中的 TuGraph 实例中。这对于处理通常以固定的时间间隔进行的增量批处理更新非常便利。`lgraph_import --online true`选项使导入工具能够在线模式工作。与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据发送到正在运行的 TuGraph 实例中，该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+
+如果用户和密码有效，并且指定的图存在，导入工具将将数据发送到服务器，服务器随后解析数据并将其写入指定的图。数据将以大约 16MB 大小的包发送，在最近的换行符处中断。每个包都是以原子方式导入的，这意味着如果成功导入包，则成功导入所有数据，否则，任何数据都不会进入数据库。如果指定了`--continue_on_error true`，则忽略数据完整性错误，并忽略违规行。否则，导入将在第一个错误包处停止，并打印出已导入的包数。在这种情况下，用户可以修改数据以消除错误，然后使用`--skip_packages N`重做导入以跳过已导入的包。
+
+## 6.在线全量导入
+
+在线全量导入可用于将一批文件导入运行中的TuGraph实例，TuGraph支持将两种不同类型的数据在线导入到实例中：
+1. 和离线导入类型相同的原数据文件（csv等）
+2. TuGraph的底层存储文件，即data.mdb文件，该文件可以由离线导入生成，也可以是其他TuGraph db的文件。
+这两种方式的适用场景不同，第一种是直接将数据导入到TuGraph中，优点是一次性自动导入，操作步骤简单。但是会在server端启动一个离线导入线程，
+只适合单机情况下的小规模数据导入。第二种是将已经准备好的底层存储文件导入到TuGraph中，虽然需要提前准备好mdb文件，但是对系统资源却没有很高的要求，
+而且支持远程下载文件导入，非常方便，适用于高可用模式或者大规模数据的在线导入。
+
+### 6.1 从原数据导入
+从原数据导入的执行方式是向运行中的TuGraph实例发送导入请求，
+实例接到请求后先使用离线导入（V3）的方式将数据导入一个临时的db中，然后在实例中新建子图并将临时db的数据文件迁移到新子图中，最后刷新实例的元数据。
+相比在线增量导入，在线全量导入的性能更高。
+`lgraph_import --online true --online_type 1`选项使导入工具能够在线全量导入。
+与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --full              Whether to full import online. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据导入正在运行的 TuGraph 实例中，
+该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+并且，配置文件（config_file参数）要求是 TuGraph 实例机器上的uri路径，其file配置也要求是 TuGraph 实例机器上资源的绝对路径。
+
+如果用户和密码有效，导入工具将在服务器端执行在线全量导入。如果想导入的图已存在，可以使用`--overwrite true` 选项强制覆盖子图。
+
+### 6.2 从数据库文件导入
+从原数据在线全量导入尽管操作简单、性能较高，但是对服务器资源要求较高，且耗时较长。
+一种更加通用的方式是先使用离线导入在一个空db中导入子图，得到data.mdb文件，然后把该文件在线导入到
+TuGraph服务中。其使用方式如下所示：
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+除普通在线导入用到的url, user和password参数之外，从数据库文件导入的在线全量导入方式
+使用graph参数指定导入的子图名称，path参数指定文件路径，remote指定文件存在在远程或者本地。
+如果是本地文件，则需要保证HA集群中所有的节点在path路径下都有该文件。如果是远程文件，则会先下载再导入。
+需要注意的是，由于data.mdb只有一份，需要保证HA的各个节点和离线导入生成data.mdb的机器的环境完全一致，
+以保证不会出现环境问题。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..5544169de0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# 数据导出
+
+> 此文档主要介绍 TuGraph 的数据导出功能。
+
+## 1.简介
+
+TuGraph 可以通过 `lgraph_export` 工具来对已经存放在TuGraph的图数据进行数据导出。 `lgraph_export` 工具可以将指定 TuGraph 数据库的数据以 `csv` 或者 `json` 文件形式导出到指定目录，同时导出这些数据进行再导入时需要的配置文件 `import.config` ，详细描述可参见[配置文件](1.data-import.md)。
+
+## 2.导出命令
+
+该工具的命令示例如下：
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+其中：
+
+- `-d {database_dir}` 指定需要进行数据导出的数据库所在目录，默认值为 `./testdb`。
+- `-e {export_destination_dir}` 指定导出文件存放的目录，默认值为 `./exportdir`。
+- `-g {graph_to_use}` 指定图数据库的种类，默认为 `default` 。
+- `-u {username}` 指定进行该导出操作的用户的用户名。
+- `-p {password}` 指定进行该导出操作的用户的用户密码。
+- `-s {field_separator}` 指定导出文件的分隔符，默认为逗号。
+- `-f {output_format}` 指定导出数据的格式，`json`或者`csv`，默认为`csv`。
+- `-h` 除上述指定参数外，也可以使用该参数查看该工具的使用帮助。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..ce113ad0a4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,35 @@
+# 备份恢复
+
+> 此文档主要介绍 TuGraph 的数据备份和恢复功能。
+
+## 1.数据备份
+
+TuGraph 可以通过 `lgraph_backup` 工具来进行数据备份。
+`lgraph_backup` 工具可以将一个 TuGraph 数据库中的数据备份到另一个目录下，它的用法如下：
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+其中：
+
+- `-s {source_dir}` 指定需要备份的数据库（源数据库）所在目录。
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
+  如果目标数据库不为空，`lgraph_backup` 会提示是否覆盖该数据库。
+- `-c {true/false}` 指明是否在备份过程中进行 compaction。
+  compaction 能使产生的备份文件更紧凑，但备份时间也会变长。该选项默认为 `true`。
+
+## 2.数据恢复
+
+使用`lgraph_backup` 工具得到的目标数据库`{destination_dir}`备份了源数据库
+`{source_dir}`的所有子图，但不包含HA集群的raft信息，从而保证服务和集群能
+以备份数据库成功重启并与源数据库的数据一致。使用如下命令可以用备份数据库重启服务，
+在服务启动时会恢复所有子图的存储过程，保证备份服务和原服务完全一致。
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+其中：
+
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..c0c5afb7eb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# 数据预热
+
+> 此文档主要介绍 TuGraph 的数据预热功能。
+
+## 1.简介
+
+TuGraph 是基于磁盘的数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+## 1.数据预热命令
+
+数据预热可以通过工具 `lgraph_warmup` 来进行。它的使用示例如下：
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+其中：
+
+- `-d {db_dir}` 选项指定了 TuGraph 服务器的数据目录
+
+- `-g {graph_list}` 选项指定需要进行数据预热的图名称，用逗号分隔
+
+根据数据大小和所使用的磁盘类型不同，预热过程运行时间也不同。机械磁盘上预热一个大数据库可能耗时较长，请耐心等待。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..0a113bfa78
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# 集群管理
+
+> 此文档主要介绍 TuGraph HA 集群的管理工具，主要包括删除节点、leader转移和生成snapshot功能
+
+## 1. 简介
+
+HA集群启动之后，可以使用`lgraph_peer`工具进行集群管理，可以执行删除节点，转移leader和生成snapshot等功能。
+
+## 2. 删除节点
+
+对于TuGraph HA集群中长期离线或者产生网络分区的节点，可以使用`lgraph_peer`的`remove_peer`命令删除节点。命令示例如下所示：
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command remove_peer` 指定要执行的操作为remove_peer，即删除节点。
+- `--peer {peer_id}` 指定要删除节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 3. leader 转移
+
+当需要对主节点执行停机或重启操作时，为减少集群的不可服务时间，可以使用`lgraph_peer`的`transfer_leader`命令转移主节点。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command transfer_leader` 指定要执行的操作为transfer_leader，即转移主节点。
+- `--peer {peer_id}` 指定要成为主节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 4. 生成snapshot
+
+出于节点启动时设置ha_snapshot_interval_s为-1以默认不打snapshot或其他原因，
+当需要让某个节点手动生成snapshot时，可以使用`lgraph_peer`的`snapshot`命令。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+其中：
+
+- `--command snapshot` 指定要执行的操作为snapshot，即生成快照。
+- `--peer {peer_id}` 指定要生成快照的节点的rpc网络地址，如 `127.0.0.1:9092`。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..8c68a5fd64
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,134 @@
+# 命令行工具
+
+> 此文档主要介绍 lgraph_cypher 文档的使用
+
+TuGraph 发布版本附带名为`lgraph_cypher`的查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+## 1.单命令模式
+
+在单命令模式下，`lgraph_cypher`可用于提交单个 Cypher 查询并将结果直接打印到终端，打印结果也可以容易地重定向写入指定文件。当用户需要从服务器获取大量结果并将其保存在文件中时，这非常便利。
+在此模式下，`lgraph_cypher`工具具有以下选项：
+
+### 1.1.命令行参数:
+
+| 参数     | 类型   | 说明                                                                     |
+| -------- | ------ | ------------------------------------------------------------------------ | ------ | ----------------------------------------------------------------------------------------------------------------------------------------- |
+| --help   | \\     | 列出所有参数及说明。                                                     |
+| -example | \\     | 列出命令实例。                                                           |
+| -c       | string | 数据库的配置文件，用于获取 ip 与 port 信息。                             |
+| -h       | string | 数据库服务器 ip 地址，如有配置文件则可舍去此参数。默认值为`127.0.0.1` 。 |
+| -p       | string | 数据库服务器端口，如有配置文件则可舍去此参数。默认值为`7071` 。          |
+| -u       | string | 数据库登录用户名。                                                       |
+| -P       | string | 数据库登录密码。                                                         |
+| -f       | string | 包含单条 Cypher 查询单文本文件的路径。                                   |
+| -s       | string | 单行 cypher 查询命令。以`"`开头结尾。                                    |
+| -t       | int    | 进行 cypher 查询时服务器的超时阈值。默认值为`150`秒。 -format            | string | 查询结果显示模式。支持`plain`与`table`两种格式。`plain`格式会将查询结果单列打印。`table`格式会将查询结果以表格方式显示。默认值为`table`。 |
+
+### 1.2.命令示例:
+
+**cypher 命令文件查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+```
+
+**cypher 命令单句查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+```
+
+## 2.交互模式
+
+`lgraph_cypher`也可以在交互模式下运行。在交互式模式下，客户端与服务器保持连接，并在读取-评估-打印-循环中与用户进行交互。
+
+### 2.1.进入 lgraph_cypher 交互模式:
+
+如不加`-f`或`-s`命令行选项，运行`lgraph_cypher`时将会进入交互模式。使用方式如下：
+
+```
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+```
+
+如成功进入则会显示相应登录成功信息：
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2023 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+现在我们也提供一个交互式 shell ，用于用户输入 Cypher 查询语句或使用`:help`命令来检查可用命令。
+
+### 2.2.command种类与说明:
+
+除 Cypher 查询外，`lgraph_cypher` 的 shell 还接受以下命令：
+
+| 命令                     | 对应参数                           | 说明                                                                                                |
+| ------------------------ | ---------------------------------- | --------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                 | 显示服务器信息与所有 command 对应说明。                                                             |
+| :db_info                 | \\                                 | 当前服务器状态查询。对应 REST API 的/db/info。                                                      |
+| :clear                   | \\                                 | 清空屏幕。                                                                                          |
+| :use                     | {图的名称}                         | 使用该名称指定的图，默认值为`default` 。                                                            |
+| :source                  | `-t {查询timeout值} -f {查询文件}` | 可交互模式下的 cypher 命令文件查询。超时阈值默认值为`150`秒。查询文件格式参考无交互式查询参数。     |
+| :exit                    | \\                                 | 退出交互模式并返回原命令行。                                                                        |
+| :format                  | `plain` or `table`                 | 更改 cypher 查询结果的显示模式。支持`plain`与`table`模式。                                          |
+| :save all/command/result | `-f {文件路径}` `{cypher语句}`     | 存储 cypher 命令（command）或查询结果（result）或以上二者（all）。默认存储位置为`/saved_cypher.txt` |
+
+**注意:**
+
+- 每条命令都应该以冒号开始 `:`.
+
+**:save 命令例子:**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+```
+
+### 2.3.cypher 查询命令:
+
+在交互模式下，用户也可直接输入单句 cypher 命令进行查询，以"`;`"结束。输入命令不区分大小写。例子如下：
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher`输入命令时支持多行输入，用户可使用`ENTER`键将长查询语句分多行输入。多行输入情况下命令行开头会从`>`变为`=>`，然后用户可以继续输入查询的其余部分。
+
+例子如下：
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### 2.4.辅助功能:
+
+**历史查询：** 在交互模式下按上下方向键可查询输入历史。
+
+**自动补全：** lgraph_cypher 会根据输入历史进行自动补全。在补全提示出现的情况下，按下右方向键就会自动补全命令。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..643597f2bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,435 @@
+# TuGraph-DataX
+
+> 此文档主要介绍 TuGraph DataX 的安装编译和使用示例
+
+## 1.简介
+
+TuGraph 在阿里开源的 DataX 基础上添加了 TuGraph 的写插件以及 TuGraph jsonline 数据格式的支持，其他数据源可以通过 DataX 往 TuGraph 里面写数据。
+TuGraph DataX 介绍 [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX)，支持的功能包括：
+
+- 从 MySQL、SQL Server、Oracle、PostgreSQL、HDFS、Hive、HBase、OTS、ODPS、Kafka 等各种异构数据源导入 TuGraph
+- 将 TuGraph 导入相应的目标源 （待开发）
+
+![导入导出](../../../images/tugraph-datax.png)
+
+DataX 原始项目介绍参考 [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.编译安装
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+编译出来的 DataX 文件在 target 目录下
+
+## 3.文本数据通过DataX导入TuGraph
+
+我们以 TuGraph 手册中导入工具 lgraph_import 章节举的数据为例子，有三个 csv 数据文件，如下：
+`actors.csv`
+
+```
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+```
+
+`movies.csv`
+
+```
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+`roles.csv`
+
+```
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+```
+
+然后建三个 DataX 的 job 配置文件：
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后依次执行如下三个命令：
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## 4.MySQL数据通过DataX导入TuGraph
+
+我们在 `test` database 下建立如下电影 `movies` 表
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+往表中插入几条数据
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+建立一个 DataX 的 job 配置文件
+
+`job_mysql_to_tugraph.json`
+
+**配置字段方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**写简单 sql 方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后执行如下命令：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..ea866abf5d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph-Explorer
+
+> TuGraph Explorer 已经合并到 [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/9.restful.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/9.restful.md
new file mode 100644
index 0000000000..1a62bd27a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/9.restful.md
@@ -0,0 +1,198 @@
+# TuGraph-Restful-Server
+
+> TuGraph Restful Server 强依赖 TuGraph，Restful Server 与 Tugraph 共存
+
+## 1.TuGraph-Restful-Server 简介
+TuGraph Restful Server 使用brpc框架支持的http协议，提供restful接口查询功能，在实现中，restful server 与rpc server 使用同一个端口。目前restful接口提供文件上传，数据导入，导入进度查询，cypher查询，文件删除等功能
+
+## 2.启动 TuGraph-Restful-Server
+需要在启动Tugraph时设置enable_rpc参数为true的方式，正常启动TuGraph
+
+## 3.连接 TuGraph-Restful-Server
+TuGraph正常启动后，Restful Server 将监听在rpc_port上， 通过访问 http://${ip}:${rpc_port}/LGraphHttpService/Query/ url可以链接到TuGraph
+
+## 4.数据格式
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+## 5.返回值
+
+通用返回格式
+
+|  body参数  | 参数说明  |  参数类型  |  是否必填  |
+|:--------:|:-----:|:------:| :-----: |
+| errorCode |  状态码  |  字符串  |  是  |
+| errorMessage | 错误信息  |  字符串  |  是  |
+| data | 返回的数据 |  字符串  |  是  |
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 401 Unauthorized: 未通过鉴权认证，例如用户名密码错误，token超过有效期等
+- 500 Internal Server Error: 服务器端错误
+  当操作成功时，返回的 data 中包含操作的返回值。
+  当发生输入错误或者服务器错误时，返回的 errorMessage 中包含错误提示。
+
+## 6.URI格式
+
+| URI               | 说明                 |
+|-------------------|--------------------|
+| /cypher           | 执行cypher查询请求       |
+| /refresh          | 刷新token请求          |
+| /login            | 用户登陆请求             |
+| /logout           | 用户登出请求             |
+| /upload_files     | 上传文件请求             |
+| /clear_cache      | 清理用户上传文件请求         |
+| /check_file       | 文件认证请求             |
+| /import_data      | 数据导入请求             |
+| /import_progress  | 导入进度查询请求           |
+| /import_schema    | 批量创建schema请求       |
+
+## 7.接口
+### 7.1 用户登陆
+用于用户第一次与服务端通信时的鉴权操作，请求报文在 http body 中携带用户名和密码，响应报文在 http body 中会返回一个带有有效期的token，后续请求中需要在http header中携带该token作为凭证
+#### 7.1.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/login
+#### 7.1.2 REQUEST
+|  body参数  |  参数说明  |  参数类型  |  是否必填  |
+|:--------:|:------:|:------:| :-----: |
+ | userName |  用户名  |  字符串  |  是  |
+ | password |   密码   |  字符串  |  是  |
+#### 7.1.3 RESPONSE
+|    body参数     | 参数说明  |  参数类型  |  是否必填  |
+|:-------------:|:-----:|:------:| :-----: |
+| authorization | token |  字符串  |  是  |
+
+### 7.2 刷新token
+token到期后将无法使用此token与服务端正常通信，需要获取新的token作为后续请求的凭证，请求报文在http header中携带旧的token，响应报文在http body中返回新的token
+#### 7.2.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/refresh
+#### 7.2.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+#### 7.2.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| authorization | 新的token |  字符串  |  是  |
+
+### 7.3 用户登出
+用户不再需要与服务端进行通信时，需要请求登出接口，释放自己的token。请求报文在http header中携带旧的token，如果拿到返回errorCode为200的响应报文即为正常登出
+#### 7.3.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/logout
+#### 7.3.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+### 7.4 执行cypher查询请求
+用户通过此类请求发cypher给server端执行并获取执行结果，请求报文在http body 中将执行的cypher语句和目标子图发送给server，server执行完成后在响应报文的http body中返回执行结果
+#### 7.4.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/cypher
+
+#### 7.4.2 REQUEST
+| body参数 |    参数说明    |  参数类型  |  是否必填  |
+|:------:|:----------:|:------:| :-----: |
+| graph  |   查询目标子图   |  字符串  |  是  |
+| script | cypher查询语句 |  字符串  |  是  |
+
+#### 7.4.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| result | 返回结果 |  字符串  |  是  |
+
+### 7.5 上传文件请求
+用户通过此类请求向server发送文件，可以对文件进行分片，分片大小不大于1MB，支持多线程乱序发送，请求报文在http header 中包含文件名，第一字节内容在文件中的偏移和分片大小，在body中包含文件内容，server收到请求后将验证分片大小是否与分片内容一致，一致时将文件分段写入文件。不一致时将返回errorCode为400的响应
+#### 7.5.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/upload_files
+
+#### 7.5.2 REQUEST
+| header参数  |    参数说明    |  参数类型  |  是否必填  |
+|:---------:|:----------:|:------:| :-----: |
+| File-Name |   文件名   |  字符串  |  是  |
+| Begin-Pos | 开始位置在文件内的偏移 |  字符串  |  是  |
+|   Size    | 文件分片大小 |  字符串  |  是  |
+|  body参数   |  参数说明   |  参数类型  |  是否必填  |
+|     -     | 文件内容 |  字符串  |  是  |
+
+### 7.6 文件认证请求
+用户通过此类请求验证发送到server端的文件是否与期望一致，server端使用两种验证方式，md5值和文件长度，目前已支持文件长度验证。
+#### 7.6.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/check_file
+#### 7.6.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| fileName |           文件名           |  字符串  |  是  |
+| checkSum |        文件对应md5值         |  字符串  |  否  |
+| fileSize |       文件长度(以字节计算)       |  字符串  |  否  |
+| flag | 标记位，为1时校验md5值，为2时校验文件长度 |  字符串  |  是  |
+
+#### 7.6.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| pass | 检查成功为true，否则为false |  bool  |  是  |
+
+### 7.7 批量创建schema请求
+用户通过此类请求批量创建schema，请求报文在http body 中将创建schema的目标子图和schema信息发送给server，如果拿到返回errorCode为200的响应报文即为正常创建
+#### 7.7.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_schema
+#### 7.7.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| graph |   创建目标子图   |  字符串  |  是  |
+| schema | schema描述信息 |  字符串  |  是  |
+
+### 7.8 数据导入请求
+用户通过此类请求导入已经上传的数据文件。导入不论成功或失败，都将删除已上传文件。数据导入请求在server中实现为一个异步任务，响应返回并不意味着导入已完成，返回的是任务id，后续可以通过此任务id查询导入进度
+#### 7.8.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_data
+#### 7.8.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  | 是否必填 |
+|:--------:|:-----------------------:|:------:|:----:|
+| graph |         导入目标子图          |  字符串  |  是   |
+| schema |       导入schema描述        | json字符串  |  是   |
+| delimiter |           分隔符           |  字符串  |  是   |
+| continueOnError |     单行数据出错是否跳过错误并继续     |  boolean  |  否   |
+| skipPackages |         跳过的包个数          |  字符串  |  否   |
+| taskId |  任务id   |  字符串  |  否   |
+| other | 其他参数 |  json字符串  |  否   |
+
+#### 7.8.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| taskId | 任务编号 |  字符串  |  是  |
+
+### 7.9 清理用户上传文件请求
+用户通过此类请求清理已经上传的文件，如果拿到返回errorCode为200的响应报文即为正常清理
+#### 7.9.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/clear_cache
+#### 7.9.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| fileName |    文件名称    |  字符串  |  否  |
+| userName |    用户名称    |  字符串  |  否  |
+| flag | 标记位， flag = 0时删除fileName指定文件, flag = 1时删除userName指定用户已经上传的所有文件， flag = 2时删除所有用户上传的文件 |  字符串  |  是  |
+
+### 7.10. 导入进度查询请求
+用户通过此类请求获得导入任务的状态
+#### 7.10.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_progress
+#### 7.10.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| taskId |           任务编号           |  字符串  |  是  |
+
+#### 7.10.3 RESPONSE
+| body参数 |                  参数说明                   |  参数类型  |  是否必填  |
+|:------:|:---------------------------------------:|:------:| :-----: |
+| state  | 状态标记，为0表示准备导入，为1表示导入中，为2表示导入成功，为3表示导入失败 |  字符串  |  是  |
+|  progress  |             导入进度，state为1时包含             |  字符串  |  否  |
+|  reason  |             失败原因，state为3时包含             |  字符串  |  否  |
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..00a7df7efb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+实用工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..4644db356e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/1.python-client.md
@@ -0,0 +1,237 @@
+# Python客户端
+
+> 此文档主要是TuGraph Python SDK的使用说明。
+
+## 1. 概述
+Python的TuGraph Client有两种，一种是RESTful的Client，使用HTTP方法向server发送请求，另一种是RPC的Client，使用RPC方法调用server远程服务，两者各有优劣。
+RESTful client的使用方式简单，在项目的src/client/python/TuGraphClient目录下可以找到Client的源码文件，直接安装到用户环境中即可使用，但是支持的功能较少，
+性能也不高。RPC Client既支持单机的server，也支持高可用集群和负载均衡，接口较多，功能强大。但是使用方式较为复杂，需要用户自己编译TuGraph项目得到liblgraph_client_python.so，
+或者使用runtime镜像时直接在/usr/local/lib64目录下找到该依赖库，将其引入python项目即可正常使用。接下来将详细介绍这两种Client的使用方式。
+
+## 2. RESTful Client
+
+### 2.1.安装Client
+
+TuGraph的Python RESTful client使用setuptools工具进行打包和分发，用户可以将client直接安装到本地环境中，在使用时即可直接引入。
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+注：使用setuptools工具安装python client时会安装httpx等依赖，需要在通外网的环境下执行。
+
+### 2.2.调用Cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = await aclient.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.调用存储过程
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+res = await aclient.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python的TuGraph Rpc Client是使用pybind11包装的CPP Client SDK，下表列出了Python和CPP Client SDK的对应关系。
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+Python RPC Client的使用方式较为复杂，用户可以在本地环境中编译TuGraph得到liblgraph_client_python.so，也可以使用官方提供的runtime镜像，
+在镜像中的/usr/local/lib64目录下可以直接找到该依赖库，引入用户项目即可使用。
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.实例化client对象
+
+#### 3.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 3.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 3.2.调用cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.3.向leader发送cypher请求
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.4.调用GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.5.向leader发送GQL请求
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.6.调用存储过程
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.7.向leader调用存储过程
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 3.8.加载存储过程
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 3.9.列举存储过程
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.10.删除存储过程
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 3.11.从字节流中导入schema
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.12.从字节流中导入点边数据
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 3.13.从文件中导入schema
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.14.从文件中导入点边数据
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..ce29ac4bf4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,340 @@
+# C++客户端
+
+> 此文档主要是TuGraph C++ SDK的使用说明。
+
+## 1.概述
+C++ Client 能够使用 RPC 连接lgraph_server，进行数据导入、执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直接连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化。
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.3.向leader发送cypher请求
+```C++
+    std::string str;
+    bool ret = client.CallCypherToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```C++
+    std::string str;
+    bool ret = client.CallGql(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGql(std::string& result, const std::string& gql,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling gql.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.5.向leader发送GQL请求
+```C++
+    std::string str;
+    bool ret = client.CallGqlToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGqlToLeader(std::string& result, const std::string& gql,
+                 const std::string& graph = "default", bool json_format = true,
+                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true);
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+
+### 2.8.加载存储过程
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送请求。
+
+### 2.10.删除存储过程
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..df0446d7e3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/3.java-client.md
@@ -0,0 +1,279 @@
+# Java客户端
+
+> 此文档主要是TuGraph Java SDK的使用说明。
+
+## 1.编译java client代码
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.3.向leader发送cypher请求
+```java
+    String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```java
+    String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling GQL
+    @return: the result of GQL query execution
+    public String callGql(String gql, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.5.向leader发送GQL请求
+```java
+    String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```java
+    String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedureToLeader : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @return: the result of procedure execution
+    public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 2.8.加载存储过程
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.10.删除存储过程
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException 
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout) 
+            throws UnsupportedEncodingException, IOException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..a9c06de71b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,174 @@
+# TuGraph-OGM
+
+## 1.简介
+
+> TuGraph-OGM 项目在其他仓库开源。
+
+TuGraph-OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。同时 TuGraph-OGM 兼容 Neo4j-OGM，Neo4j 生态用户可以无缝迁移到 TuGraph 数据库上。
+
+### 1.1.TuGraph-OGM 功能
+
+TuGraph-OGM 提供以下函数操作 TuGraph：
+
+| 功能                            | 用法                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| 插入单个节点\边                 | void session.save(T object)                                                      |
+| 批量插入节点\边                 | void session.save(T object)                                                      |
+| 删除节点与对应边                | void session.delete(T object)                                                    |
+| 删除指定 label 的全部节点       | void session.deleteAll(Class\<T> type)                                           |
+| 清空数据库                      | void purgeDatabase()                                                             |
+| 更新节点                        | void session.save(T newObject)                                                   |
+| 根据 id 查询单个节点            | T load(Class<T> type, ID id)                                                     |
+| 根据 ids 查询多个节点           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| 根据 label 查询全部节点         | Collection\<T> loadAll(Class\<T> type)                                           |
+| 条件查询                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher 查询（指定返回结果类型） | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher 查询                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.编译 TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.使用 TuGraph-OGM
+
+详细示例请参考 demo 文件夹下的 TuGraphOGMDemo ###在`pom.xml`中引入依赖
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // 构建Movie节点
+    @Id
+    private Long id;      // Movie节点的id
+    private String title; // title属性
+    private int released; // released属性
+
+    // 构建边ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // 构建Actor节点
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// 配置
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//启动driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// 开启session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.通过OGM进行增删改查
+
+```java
+// 增
+Movie jokes = new Movie("Jokes", 1990);  // 新建Movie节点jokes
+session.save(jokes);                     // 将jokes存储在TuGraph中
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // 将speed节点与alice节点通过ACTS_IN进行连接
+session.save(speed);                    // 存储两个节点与一条边
+
+// 删
+session.delete(alice);                  // 删除alice节点以及相连的边
+Movie m = session.load(Movie.class, jokes.getId());   // 根据jokes节点的id获取jokes节点
+session.delete(m);                                    // 删除jokes节点
+
+// 改
+speed.setReleased(2018);
+session.save(speed);                   // 更新speed节点属性
+
+// 查
+Collection<Movie> movies = session.loadAll(Movie.class);  // 获取所有Movie节点
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // 查询所有小于1995年发布的电影
+
+// 调用Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // 查询Speed为2018的Movie
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // 创建节点Label Director
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // 创建边Label DIRECT
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // 获取create结果
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // 查看创建节点数目
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //查看创建边数目
+
+// 清空数据库
+session.deleteAll(Movie.class);        // 删除所有Movie节点
+session.purgeDatabase();               // 删除全部数据
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..b1f34412ce
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,15 @@
+# Bolt客户端
+
+TuGraph目前兼容了Neo4j的bolt协议，可以直接使用Neo4j的客户端访问TuGraph。
+
+## 开启bolt端口
+
+如果使用的是TuGraph的docker容器，配置文件在 `/usr/local/etc/lgraph.json`
+
+在TuGraph的配置文件中添加 `bolt_port=7687`（端口号自己看情况修改），开启bolt端口，Neo4j的客户端需要与这个端口连接。
+
+## Neo4j客户端使用限制
+
+目前还没有兼容Neo4j bolt协议的全部功能，Neo4j客户端的显示事务功能目前还不支持，使用客户端的时候注意避免使用这两个功能。
+
+在代码目录中的demo/Bolt下面有golang、java、js、python、rust 这几个语言的的例子，可供参考。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..f9ef4f4aed
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,106 @@
+# TuGraph console client
+
+`lgraph_cli` 是基于bolt协议的 console client，c++编写，使用时需要连接tugraph的bolt端口。
+
+`lgraph_cypher` 是基于http协议的 console client，python编写，使用时需要连接tugraph的http端口。
+
+`lgraph_cypher` 使用的时候需要安装需要的python库，如果服务器网络不通，则需要手动安装缺失的python库。
+
+`lgraph_cli` 是一个二进制的可执行文件，不依赖其他动态库，拷贝到一台linux机器上就可执行。
+
+## `lgraph_cli`使用
+
+语句以分号结束，输入`exit`, `quit`或者Ctrl-C退出客户端。
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+语句可以中间换行，多行输入。
+
+```powershell
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+非交互式
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+从文件读取多条命令
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## 在线数据导出
+
+lgraph_cli 支持流式读取，导出数据只需要把lgraph_cli的输出重定向到文件中即可，导出格式支持csv和json。
+
+### csv格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..beb44d41aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,340 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+## 2.请求与响应格式
+TuGraph HTTP Server 接收json格式的请求，经过鉴权后开始提取请求中的字段，根据定义好的接口逻辑处理请求，并返回json格式的响应。
+
+### 2.1.标准响应格式
+每一个响应都以标准响应格式返回，格式如下：
+
+| body参数  | 参数说明         | 参数类型        | 是否必填       |
+| ------- |--------------|-------------|------------|
+| errorCode   | 业务级错误码       | int类型       | 是          |
+| success   | 请求是否成功       | int类型       | 是          |
+| errorMessage   | 业务级错误信息      | 字符串类型       | 是          |
+| data   | 请求成功时返回的响应信息 | json字符串     | 是          |
+
+### 2.2请求类型
+
+#### 2.2.1. 用户登陆
+用户在登陆请求中携带用户名和密码发送到服务端。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，在后续的请求中将令牌加入请求头的Authorization域中。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| userName   | 用户名  | 字符串类型   | 是          |
+| password   | 用户密码 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+| default_password  | 默认密码 | 布尔类型 | 是          |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. 用户登出
+用户登出，同时删除已经认证的token，用户后续发送请求时，需要重新登陆，并获取新的token。
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data为空
+
+#### 2.2.3. 身份刷新
+已下发的token失效后，需要调用本接口重新认证。后端验证token合法性。token在初次登录后，1小时内有效，过期需要刷新
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+
+#### 2.2.4. 调用cypher
+用户对TuGraph的增删改查请求需要调用cypher接口，并通过标准的cypher查询语言发起
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明     | 参数类型  | 是否必填       |
+| ------- |----------|-------|------------|
+| graph   | 查询的子图名称  | 字符串类型   | 是          |
+| script   | cypher语句 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含查询结果
+
+| body参数  | 参数说明 | 参数类型    | 是否必填       |
+| ------- |------|---------|------------|
+| result   | 查询结果 | json字符串 | 是          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. 上传文件
+接口用于将本地文件上传至TuGraph所在机器。可以上传文本文件，二进制文件，可以上传大文件，也可以上传小文件，对于大文件，客户端在上传时应该对文件做切分，每个文件分片不大于1MB，参数Begin-Pos和Size对应本次分片在完整文件中的偏移量与分片大小。参数需要放在http请求的报文头，请求内容对应文件分片内容。本接口请求头不止有token参数
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header参数  | 参数说明        | 参数类型             | 是否必填       |
+| ------- |-------------|------------------|------------|
+| File-Name   | 文件名称        | 字符串类型            | 是          |
+| Begin-Pos   | 开始位置在文件内的偏移 | 可以转成size_t类型的字符串 | 是          |
+| Size   | 本次请求文件分片大小    | 可以转成size_t类型的字符串 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+#### 2.2.6. 检查文件
+本接口用于检查已上传文件正确性，如果成功通过检查，再次上传同一文件时，直接返回成功
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明           | 参数类型          | 是否必填        |
+| ------- |----------------|---------------|-------------|
+| fileName   | 文件名称           | 字符串类型         | 是           |
+| checkSum   | 文件对应md5值       | 可以转成int类型的字符串 | flag为"1"时必填 |
+| fileSize   | 文件长度(以字节计算)    | 可以转成int类型的字符串  | flag为"2"时必填 |
+| flag   | 标记位，flag为1时校验md5。flag为2时校验文件长度 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| pass   | 检查成功为true，否则为false | bool类型 | 是          |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. 清理缓存文件
+admin用户可以删除所有用户上传的文件，其他用户可以删除自己的上传的文件，可以删除指定名称的文件，指定用户上传的文件，也可以删除所有文件
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明        | 参数类型          | 是否必填        |
+| ------- |-------------|---------------|-------------|
+| fileName   | 文件名称        | 字符串类型         | flag为"0"时必填 |
+| userName   | 用户名称        | 字符串类型 | flag为"1"时必填 |
+| flag   | 标记位，flag为0时删除fileName指定文件, flag为1时删除userName指定用户已经上传的所有文件，flag为2时删除所有用户上传的文件 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. 导入schema
+本接口可以根据用户指定的schema信息创建schema模型，schema的详细格式信息请参考data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明       | 参数类型          | 是否必填        |
+| ------- |------------|---------------|-------------|
+| graph   | 子图名称       | 字符串         | 是           |
+| description   | schema描述信息 | json字符串 | 是 |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. 导入数据
+本接口允许用户指定已经通过上传，校验的文件作为数据文件，按照schema参数描述的配置信息，导入到graph参数指定的子图中。导入过程是异步的，server在接收到导入请求后，返回一个任务id
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明  | 参数类型    | 是否必填 |
+| ------- |-------|---------|----|
+| graph   | 子图名称  | 字符串类型   | 是  |
+| schema   | 导入schema描述 | json字符串 | 是  |
+| delimiter   | 分隔符   | 字符串类型   | 是  |
+| continueOnError   | 单行数据出错是否跳过错误并继续 | boolean类型 | 否  |
+| skipPackages   | 跳过的包个数 | 可以转成int类型的字符串 | 否  |
+| taskId   | 任务id，用于重启出错的任务 | 字符串类型 | 否 |
+| flag   | 标记位，flag为1时导入成功将删除数据文件 | 可以转成int类型的字符串 | 否 |
+| other   | 其他参数 | 可以转成int类型的字符串 | 否  |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| taskId   | 任务编号 | 字符串类型 | 是          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. 导入进度查询
+本接口用于查询导入任务的执行进度
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明                 | 参数类型    | 是否必填 |
+| ------- |----------------------|---------|----|
+| taskId   | import_data接口返回的任务id | 字符串类型 | 是 |
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明    | 参数类型             | 是否必填    |
+| ------- |---------|------------------|---------|
+| success   | 	是否成功导入 | boolean类型        | 是       |
+| reason   | 	导入失败原因 | 字符串类型            | success为false时必填 |
+| progress   | 	当前导入进度 | 可以转成double类型的字符串 | 是       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..21ad033477
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,273 @@
+# RPC API
+
+> 此文档主要介绍 TuGraph 的 RPC API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供丰富的 RPC API，以供开发者通过 RPC 请求远程调用 TuGraph 提供的服务。
+
+RPC（远程过程调用）是一种通过网络从远程计算机程序上请求服务，而不需要了解底层网络技术的协议。
+相比REST，RPC 面向方法，主要用于函数方法的调用，可以适合更复杂通信需求的场景，且性能更高。
+brpc是用c++语言编写的工业级RPC框架，基于brpc，TuGraph 提供了丰富的RPC API，本文档描述
+TuGraph 的 RPC API 使用方式。
+
+## 2.请求
+
+### 2.1.建立连接
+
+开发者向TuGraph服务发送RPC请求，首先要建立连接。以C++语言为例，开发者创建指定url的通道（channel），
+由通道创建指定的服务存根（LGraphRPCService_Stub），后续即可通过存根像调用本地方法一样向远程
+服务器发送请求。
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.请求类型
+
+TuGraph支持10种RPC请求，其中每种请求的功能如下表所示：
+
+| 请求              | 功能         |
+|-----------------|------------|
+| GraphApiRequest | 点边索引操作请求   |
+| CypherRequest   | cypher请求   |
+| PluginRequest   | 存储过程请求     |
+| HARequest       | 高可用模式请求    |
+| ImportRequest   | 数据导入请求     |
+| GraphRequest    | 子图操作请求     |
+| AclRequest      | 权限管理请求     |
+| ConfigRequest   | 配置管理请求     |
+| RestoreRequest  | 备份请求       |
+| SchemaRequest   | schema管理请求 |
+
+用户发送请求时，需要传入以下参数：
+- client_version: 可选参数，HA模式下可通过对比`client_version`和`server_version`防止响应过时的请求
+- token: 必要参数，客户端登陆之后获得token，每次请求传入token以校验用户身份
+- is_write_op: 可选参数，标志请求是否是写请求
+- user: 可选参数，HA模式下主从之间同步请求时设置user，不需验证token
+
+服务处理完RPC请求之后发回响应，响应消息中除了包含每个请求的单独响应信息之外，还包含以下参数：
+- error_code: 必要参数，标志请求处理状态
+- redirect: 可选参数，HA模式下向follower发送写请求时处理失败，设置redirect为请求转发地址，即leader地址
+- error: 可选参数，请求错误信息
+- server_version: 可选参数，HA模式的请求响应中设置`server_version`以避免client读取数据时发生反向时间旅行问题
+
+:warning:  **除CypherRequest、PluginRequest、HARequest和AclRequest外，其余RPC接口将逐步废弃，其功能统一至CypherRequest接口。**
+
+## 3.登录
+
+登录请求信息包含以下参数：
+- user: 必要参数，用户名
+- pass: 必要参数，密码
+以C++为例，用户使用构建好的服务存根发送登录请求：
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+登录响应信息包含以下参数：
+- token: 必要参数，登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。
+如果登录失败会收到“Authentication failed”错误。
+
+## 4.查询
+用户可以通过Cypher查询和TuGraph进行绝大多数的交互，Cypher请求信息包含以下参数：
+- query: 必要参数，Cypher查询语句
+- param_names: 可选参数，参数名
+- param_values: 可选参数，参数值
+- result_in_json_format: 必要参数，查询结果是否以JSON格式返回
+- graph: 可选参数，Cypher语句执行的子图名称
+- timeout: 可选参数，Cypher语句执行的超时时间
+
+以C++为例，用户发送Cypher请求的方式如下所示：
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+Cypher请求响应为以下两个参数之一：
+- json_result: JSON格式的cypher查询结果
+- binary_result: CypherResult格式的cypher查询结果
+
+## 5.存储过程
+为满足用户较为复杂的查询/更新逻辑，TuGraph支持 C 语言和 Python 语言编写的存储过程。
+用户可以使用RPC请求对存储过程进行增删改查操作。
+
+### 5.1.加载存储过程
+加载存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- read_only: 必要参数，是否只读
+- code: 必要参数，存储过程文件读入生成的ByteString
+- desc: 可选参数，存储过程描述
+- code_type: 可选参数，存储过程代码类型，PY、SO、CPP、ZIP四者之一
+
+以C++为例，用户加载存储过程的方式如下所示：
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+加载存储过程的响应不包含参数，如果加载失败则抛出BadInput异常
+
+### 5.2.调用存储过程
+
+调用存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- param: 必要参数，存储过程参数
+- result_in_json_format: 可选参数，调用结果是否以JSON格式返回
+- in_process: 可选参数，未来支持
+- timeout: 可选参数，调用存储过程的超时时间
+
+以C++为例，用户调用存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+调用存储过程的响应为以下两个参数之一：
+- reply: ByteString格式的存储过程调用结果
+- json_result: JSON格式的存储过程调用结果
+
+### 5.3.删除存储过程
+
+删除存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+
+以C++为例，用户删除存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+删除存储过程的响应不包含参数，如果删除失败则抛出BadInput异常
+
+### 5.4.列举存储过程
+
+列举存储过程请求不需要参数，以C++为例，用户列举存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+列举存储过程的响应的参数如下所示：
+- reply: JSON格式的procedure列表
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..1928d70f07
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2918 @@
+# RESTful API Legacy
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+**注意：除"登陆"、"查询"和"存储过程"外，其余接口自 **2023年4月30日** 起将不再提供支持，统一使用Cypher接口提供服务。**
+
+## 2.请求与数据格式
+
+### 2.1请求
+
+TuGraph 支持 HTTP GET/POST/PUT/DELETE 请求。其中：
+
+- GET 请求用于只读请求，如读取点属性，边属性等操作；
+- POST 请求用于创建实体，提交 Cypher，以及加载和调用存储过程；
+- PUT 请求用于修改已有实体，如修改点属性，边属性等；
+- DELETE 请求用于删除已有实体，如删除点，边等。
+
+在高可用模式下，用户可以在请求的报头(request header)中设置 `server_version` 来保证请求的服务器有足够新的数据。
+当前的 `server_version` 可以从服务器返回的报头中获取。
+
+### 2.2.数据格式
+
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.3.返回值
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 307 Temporary Redirect: 操作被重定向，一般用于高可用模式下，把操作重定向到 master 上
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 500 Internal Server Error: 服务器端错误
+
+当操作成功时，返回的 JSON 中包含操作的返回值。当操作重定向时，返回的 HTTP 报头中的 `location` 域包含重定向目的地址。
+当发生输入错误或者服务器错误时，返回的 JSON 中包含 `error_message` 域，其内容是错误提示。
+
+在高可用模式下，服务器还会在报头中设置 `server_version`，以告知客户端当前服务器的数据版本号。当客户端在不同的服务器之间切换时，该数据版本号可以保证客户端不会读到错误的历史数据。
+
+### 2.4.URI格式
+
+TuGraph REST API 提供以下功能：Service Root, login, info, label, index, node, relationship, cypher, cpp_plugin, 以及 python_plugin。
+各功能使用的 URI 格式如下：
+
+| URI     | 说明                 |
+| ------- | -------------------- |
+| /web    | web 可视化界面       |
+| /cypher | cypher 请求          |
+| /acl    | 权限控制             |
+| /user   | 用户管理             |
+| /login  | 用户登录             |
+| /info   | 数据库状态及提示信息 |
+| /task   | 任务管理             |
+| /db     | 子图操作             |
+
+其中子图操作又分为：
+
+| URI                              | 说明                 |
+| -------------------------------- | -------------------- |
+| /db                              | 子图的创建，删除     |
+| /db/_{graph_name}_/node          | 点操作             |
+| /db/_{graph_name}_/relationship  | 边操作               |
+| /db/_{graph_name}_/label         | Label 相关操作       |
+| /db/_{graph_name}_/index         | 索引相关操作         |
+| /db/_{graph_name}_/cypher        | 子图相关 cypher 操作 |
+| /db/_{graph_name}_/cpp_plugin    | C++存储过程          |
+| /db/_{graph_name}_/python_plugin | Python 存储过程      |
+| /db/_{graph_name}_/import        | 在线导入             |
+| /db/_{graph_name}_/misc          | 其它操作             |
+
+## 3.登录
+
+TuGraph 提供基于 JWT 的用户认证方式，可以使用 HTTP 或 HTTPS 协议进行传输。系统默认使用 HTTP 协议，如果需要使用 HTTPS，需要在 lgraph.json 配置文件中将 ssl_auth 设为 1。
+
+### 3.1.登录
+
+用户通过用户名和密码发送登录请求。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，并且用于以后的每次发送请求。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**: `/login`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+  | default_password | 是否为默认密码 | 布尔值 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.身份刷新
+Token失效后，前端发起刷新token接口，后端验证token合法性。初次登录后，1小时内有效，需刷新使用。即使刷新，24小时后也会强制退出，需要重新登陆。
+验证通过，生成新的token；验证失败返回状态码401。
+
+- **URI**: `/refresh`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.修改Token有效期
+修改Token有效期，需要传输jwt，refresh_time和expire_time三个参数，其中jwt用于校验用户身份，refresh_time和expire_time等于0时，有效期为无期限，超过refresh_time时，需要调用refresh接口获取新的Token;超过expire_time时，需要重新登录。
+
+- **URI**: `/update_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+  | refresh_time | 有效时间（默认设置为0） | Int64 |
+  | expire_time | 有效时间（默认设置为0） | Int64 |
+
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0,
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.查询Token有效期
+查询Token有效期，需要传输jwt，用于校验用户身份，返回，refresh_time和expire_time，其中refresh_time表示刷新时间，超过时需要调用refresh接口获取新的Token;expire_time表示过期时间，超过时需要重新登录。
+- **URI**: `/get_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+
+- **RESPONSE**:  如果成功，返回"refresh_time"和"expire_time"。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+
+### 3.5.登出
+用户登出，同时删除token。
+
+- **URI**: `/logout`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/logout
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 4.查询
+
+URI 格式为
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.调用Cypher
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 列表 |
+  | elapsed | 运行时间（秒） | 浮点数 |
+  | header | 返回结果的表头 | 列表 |
+  | size | 结果数 | 整型 |
+
+其中 header 是一个列表，每一元素格式如下：
+
+| 域名 | 说明                                        | 类型   |
+| ---- | ------------------------------------------- | ------ |
+| name | 列名                                        | 字符串 |
+| type | 列数据类型，0 为标量，1 为点 id，2 为向量 |        |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.调用带参数的 Cypher
+
+Cypher 支持使用参数进行查询。当调用带参数的 Cypher 查询时，TuGraph 会缓存该查询的
+执行计划（execution plan），以加速后续同类查询的速度。
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+  | parameters | 参数 | 列表 |
+
+- **RESPONSE**:
+
+与 [调用 Cypher](#%E8%B0%83%E7%94%A8Cypher) 相同。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+
+## 5.存储过程
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.加载存储过程
+
+TuGraph 服务启动时，如果 load_plugins 为真，则会自动加载 plugin 目录下的所有 plugin。否则需要手动加载。此外，如果服务器运行过程中，管理员更新了 plugin 文件，也需要手动重新加载。重新加载 plugin 的调用格式为：
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 插件名称 | 字符串 |
+  | description | 插件说明 | 字符串 |
+  | code_base64 | 插件代码 | 字符串，使用 base64 编码 |
+  | read_only | 是否为只读存储过程 | 布尔值 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 5.2.列出所有存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程列表，其中每个元素是一个 plugin 的描述，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.获取存储过程的详细信息
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程信息，包括代码，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+  | code_base64 | 存储过程的代码 | 字符串，使用 base64 编码 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.调用存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: POST
+- **REQUEST**: 字符串输入
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | data | 输入数据 | 字符串 |
+  | timeout | 超时长度（秒，可选，缺省值为 0） | 浮点 |
+  | in_process | 是否在本进程调用（可选，缺省值为 false） | 布尔值 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.删除存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 6.Deprecated
+
+以下接口将在4/30/2023之后被删除。
+
+### 6.1.用户管理
+
+系统默认创建一个管理员，管理员用户名为 _admin_，密码为 _73@TuGraph_。为了安全起见，请用户在第一次启动服务器后更改密码。
+
+
+#### 6.1.1.添加用户
+
+添加一个新的用户，并为其设置初始密码。只有管理员有权限进行此操作。其中用户名只能由字母，数字以及下划线构成，密码则可以包含任意字符。用户名和密码长度不能超过 64 字节。添加用户时还可以为用户增加一个描述，用户描述可以包含任意字符，最长不超过 512 字节。
+
+新用户默认拥有同名的角色，不具备任何图的权限。
+
+- **URI**: `/user`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "description": "This is a user"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.列出所有用户
+
+列出数据库的所有用户。只有管理员拥有该操作权限。
+
+- **URI**: `/user/`
+- **METHOD**: GET
+- **RESPONSE**: 所有用户及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin admin user",
+        "roles": ["admin"]
+    },
+    "guest1": {
+        "disabled": true,
+        "description": "",
+        "roles": ["guest1", "some_other_role"]
+    }
+}
+```
+
+#### 6.1.3.获取用户信息
+
+列出给定用户的信息。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "A guest user"
+    "roles": ["guest1", "some_other_role"]
+}
+```
+
+#### 6.1.4.列出用户权限
+
+列出给定用户有权限访问的所有图及相应权限。
+
+- **URI**: `/user/{user_name}/graph`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1/graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "graph1" : "FULL",
+    "graph2" : "READ"
+}
+```
+
+#### 6.1.5.更改用户密码
+
+用户可以更改自己的密码，更改密码时需要同时提供原密码。管理员可以更改所有用户的密码。管理员更改其它用户密码时，可以不提供当前密码。
+
+- **URI**: `/user/{user_name}/password`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | current_password | 当前密码 | 字符串 |
+  | new_password | 新密码 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/password
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.6.修改用户描述
+
+用户可以修改自己的描述。管理员可以修改任意用户的描述。
+
+- **URI**: `/user/{user_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "New description for this user."
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.7.删除用户
+
+删除用户及其所有相关权限，只有管理员拥有该操作权限。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.8.禁用用户
+
+用户可以被禁用。被禁用的用户将不能登陆，但是其资料仍然保存。被禁用的用户可以被重新启用。
+
+- **URI**: `/user/{user_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.9.启用用户
+
+启用一个被禁用的用户。
+
+- **URI**: `/user/{user_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.10.设置用户角色
+
+为指定用户设置角色。只有管理员可以执行此操作。
+
+用户角色列表必须是“全量列表”，即该列表需要包含该用户需要的所有角色。唯一的例外是用户的同名角色，即使列表中不含该角色，它也会被加到用户角色中。
+
+- **URI**: `/user/{user_name}/role`
+- **METHOD**: POST
+- **REQUEST**: 角色列表
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+        ["role1", "role2"]
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+此时用户`guest1`拥有角色`guest1`, `role1`和`role2`。
+
+### 6.2.角色管理
+
+TuGraph 使用基于角色的权限管理。
+
+同一用户可以拥有多个角色。新用户默认拥有与其同名的角色。删除用户时，同名角色也会被删除。如果新建用户时同名角色已经存在，则创建失败。
+
+同一角色可以对多个图有不同的权限。用户对某张图的权限由其所有角色对该图的最高权限决定。
+
+TuGraph 使用四级权限，不用的用户对不同的子图可以有不同的权限，四种权限及其说明如下：
+
+| 权限  | 说明                                                                             |
+| ----- | -------------------------------------------------------------------------------- |
+| NONE  | 无权限                                                                           |
+| READ  | 只读                                                                             |
+| WRITE | 可读写子图中的点和边                                                           |
+| FULL  | 完全权限，包括更改元数据（label, index），管理存储过程，以及删除子图中的所有数据 |
+
+管理员对所有子图都有完全权限，新建的用户对所有子图都没有权限。将用户加入管理员角色中可以将用户提升为管理员。
+
+#### 6.2.1.添加角色
+
+添加一个新的角色，并设置其描述。只有管理员有权限进行此操作。
+
+角色名只能由字母，数字以及下划线构成，密码则可以包含任意字符。角色名长度不能超过 64 字节。
+
+角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | role | 角色名 | 字符串 |
+  | description | 角色描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "role": "new_role",
+        "description": "This is a new role.",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.2.修改角色描述
+
+修改角色的描述。只有管理员有权限进行此操作。角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role/{role_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 新描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "modified description"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.列出所有角色
+
+列出数据库的所有角色。只有管理员拥有该操作权限。
+
+- **URI**: `/role/`
+- **METHOD**: GET
+- **RESPONSE**: 所有角色及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin administrator group.",
+        "permissions": {"default":"FULL", "graph1":"FULL"}
+    },
+    "role1": {
+        "disabled": true,
+        "description": "Another role",
+        "permissions": {"default":"READ"}
+    }
+}
+```
+
+#### 6.2.4.获取角色信息
+
+列出给定角色的信息。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: GET
+- **RESPONSE**: 角色信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "Another role",
+    "permissions": {"default":"READ"}
+}
+```
+
+#### 6.2.5.删除角色
+
+删除指定角色，只有管理员拥有该操作权限。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.6.禁用角色
+
+角色可以被禁用。角色被禁用后，具有该角色的用户将不再从该角色中获得任何权限。只有管理员可以执行此操作。
+
+- **URI**: `/role/{role_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.7.启用角色
+
+启用一个被禁用的角色。
+
+- **URI**: `/role/{role_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.8.设置角色权限
+
+为指定角色设置权限。只有管理员可以执行此操作。
+
+角色权限列表必须是“全量列表”，即该列表需要包含该角色能操作的所有图及其权限。
+
+- **URI**: `/role/{role_name}/permissions`
+- **METHOD**: POST
+- **REQUEST**: 图名称及相应权限的字典。
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/permissions
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "graph1" : "FULL",
+        "graph2" : "READ"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.服务器状态
+
+#### 6.3.1.修改服务器配置
+
+修改服务器配置，配置修改后立即生效，并将影响所有服务器。这些配置的优先级高于配置文件以及命令行参数。
+
+- **URI**: `/config`
+- **METHOD**: PUT
+- **REQUEST**:
+
+请求为一个字典，使用 `{"opt1":v1}` 可以将名为`opt1`的配置修改为`v1`。
+
+| 配置名               | 说明                   | 值类型 |
+| -------------------- | ---------------------- | ------ |
+| OPT_DB_ASYNC         | 是否启用异步模式       | 布尔值 |
+| OPT_TXN_OPTIMISTIC   | 是否默认使用乐观事务锁 | 布尔值 |
+| OPT_AUDIT_LOG_ENABLE | 是否启用审计日志       | 布尔值 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "OPT_DB_ASYNC": true,
+        "OPT_AUDIT_LOG_ENABLE": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.当前服务器状态
+
+- **URI**: `/info`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | lgraph_version | 服务器版本号 | 字符串 |
+  | git_branch | 服务器代码分支 | 字符串 |
+  | git_commit | 服务器代码版本 | 字符串 |
+  | web_commit | 前端码版本 | 字符串 |
+  | cpp_id | CPP 编译器 ID | 字符串 |
+  | cpp_version | CPP 编译器版本 | 字符串 |
+  | python_version | PYTHON 版本 | 字符串 |
+  | node | 点 uri | 字符串 |
+  | relationship | 边 uri | 字符串 |
+  | cpu | cpu 信息 | 字典，格式参见[服务器 CPU 状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8CPU%E7%8A%B6%E6%80%81) |
+  | disk | 硬盘 IO 信息 | 字典，格式参见[服务器硬盘状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%A1%AC%E7%9B%98%E7%8A%B6%E6%80%81) |
+  | memory | 内存信息 | 字典，格式参见[服务器内存状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%86%85%E5%AD%98%E7%8A%B6%E6%80%81) |
+  | db_space | 图数据库占用空间 | 字典，格式参见[图数据库占用空间](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8D%A0%E7%94%A8%E7%A9%BA%E9%97%B4) |
+  | db_config | 图数据库配置信息 | 字典，格式参见[图数据库配置信息](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E9%85%8D%E7%BD%AE%E4%BF%A1%E6%81%AF) |
+  | up_time | 数据库在线时长（秒） | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.服务器 CPU 状态
+
+- **URI**: `/info/cpu`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序 CPU 使用率 | 整型 |
+  | server | 服务器 CPU 使用率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.服务器硬盘状态
+
+- **URI**: `/info/disk`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | read | 服务器硬盘读速率 | 整型 |
+  | write | 服务器硬盘写速率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.服务器内存状态
+
+- **URI**: `/info/memory`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序内存使用量 | 整型 |
+  | server_avail | 服务器可用内存 | 整型 |
+  | server_total | 服务器总内存 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.图数据库占用空间
+
+- **URI**: `/info/db_space`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | space | 图数据库占用空间 | 整型 |
+  | disk_avail | 图数据库可用空间 | 整型 |
+  | disk_total | 服务器硬盘总空间 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "disk_avail"::360074579968,
+      "disk_total"::984373800960,
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.图数据库配置信息
+
+- **URI**: `/info/db_config`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | db_async | 图数据库工作模式（同步或异步） | 布尔值 |
+  | disable_auth | 是否禁用身份验证 | 布尔值 |
+  | enable_ha | 是否启用高可用模式 | 布尔值 |
+  | enable_rpc | 是否启用 RPC 服务器 | 布尔值 |
+  | bind_host | REST 服务器的主机 | 字符串 |
+  | enable_audit_log | 是否启用日志审计 | 布尔值 |
+  | port | REST 服务器的端口 | 整型 |
+  | rpc_port | RPC 服务器的端口 | 整型 |
+  | optimistic_txn | 是否默认使用乐观事务锁 | 布尔值 |
+  | thread_limit | 图数据库应用程序的可用线程数 | 整型 |
+  | enable_ssl | 是否使用 SSL 进行身份验证 | 布尔值 |
+  | verbose | 输出的详细程度 | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "db_async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "bind_host":"127.0.0.1",
+      "enable_audit_log":false,
+      "port":7070,
+      "optimistic_txn":false,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "enable_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.8.高可用服务器列表
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/peers`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回一个服务器信息列表，其中每个服务器信息格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+  | state | 服务器状态 | 字符串 |
+
+其中服务器状态可为 `MASTER`,`SLAVE`,`OFFLINE`。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.9.当前 Leader 信息
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/leader`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前 leader 服务器信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.10.服务器统计信息
+
+- **URI**: `/info/statistics`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前服务器统计信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | requests/second | 每秒处理的请求数量 | 浮点型 |
+  | writes/second | 每秒处理的写请求数量 | 浮点型 |
+  | running_tasks | 正在执行的请求数量 | 整型 |
+  | failure_rate | 请求失败率 | 浮点型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 2.3,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.11.审计日志信息
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | begin_time | 查询日志的起始时间(必填，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | end_time | 查询日志的结束时间(默认为当前时间，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | user | 查询日志的操作者(管理员可查询所有用户的日志，普通用户只能查询本人日志) | 字符串 |
+  | num_log | 查询日志的数量(默认为 100) | 整型 |
+  | descending_order | 查询结果是否降序输出(默认为 true) | 布尔值 |
+
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回审计日志列表，其中每个元素是一条操作日志，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | index | 该操作的索引值 | 整型 |
+  | begin_time | 该操作的开始时间 | 字符串 |
+  | end_time | 该操作的结束时间 | 字符串 |
+  | user | 该操作的发起者 | 字符串 |
+  | graph | 该操作的图 | 字符串 |
+  | type | 该操作的类型 | 字符串 |
+  | read_write | 该操作为读操作或者写操作 | 字符串 |
+  | success | 该操作是否成功 | 布尔值 |
+  | content | 该操作的简要内容 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.任务管理
+
+TuGraph 提供长任务的跟踪和中止功能。用户可以通过 REST API 来查询当前正在运行的在 Cypher 和存储过程查询，并选择中止正在执行的查询。
+
+任务管理对应的 URI 格式为
+
+```
+    http://{host}:{port}/task/{thread_id}/{task_id}
+```
+
+#### 6.4.1.查询正在执行的任务
+
+- **URI**: `/task`
+- **METHOD**: GET
+- **RESPONSE**:
+
+返回的 JSON 为一个数组，其中每一个元素格式如下：
+
+| 域名         | 说明                         | 类型   |
+| ------------ | ---------------------------- | ------ |
+| description  | 任务描述                     | 字符串 |
+| time_elapsed | 任务已经执行的时间，单位为秒 | 浮点   |
+| task_id      | 任务 ID                      | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.中止任务
+
+- **URI**: `/task/{task_id}`
+  其中 `{task_id}` 是 `GET /task` 返回结果中的 `task_id`。
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.5.子图管理
+
+TuGraph 支持多子图，子图之间完全独立，不同的子图可以对不同用户开放不同权限。管理员可以添加和删除子图。
+
+#### 6.5.1.创建新子图
+
+- **URI**: `/db`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 子图名 | 字符串 |
+  | config | 配置 | 字典，格式为 { {列名 1}:{列值 1},... } |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1",
+        "config" : {
+            "max_size_GB":2048,
+            "description": "description of graph1"
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.删除子图
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.列出所有子图
+
+- **URI**: `/db`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_GB":1024,
+            "description":"description of graph1"
+        }
+    }
+```
+
+#### 6.5.4.获取子图信息
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "max_size_GB":1024,
+        "description":"description of graph1"
+    }
+```
+
+### 6.6.元数据管理
+
+TuGraph 是一个具备多图能力的强模式属性图数据库。在每一张子图中，每种点和边都需要有预定义的数据格式。数据格式由 Label 决定，每种 Label 都有自己的数据格式。用户可以使用 REST API 添加，删除和查询 Label 及其对应的数据格式。
+
+Label 操作对应的 URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+其中{type}可以是 node 或者 relationship。
+
+#### 6.6.1.创建Label
+
+创建 Label 的过程同时也是定义其数据类型的过程。只有创建了 Label 才能在图中插入相应类型的点或者边。
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | Label 名 | 字符串 |
+  | fields | 数据列定义 | 列表 |
+  | is_vertex | 是否是点 Label | 布尔值 |
+  | primary | 点的主键属性 | 字符串 |
+  | edge_constraints | 边的约束 | 列表 |
+
+`primary` 在 `is_vertex` 为 `true` 的时候设置，这个字段只有点才有, 创建点的时候必须设置。
+
+`edge_constraints` 在 `is_vertex` 为 `false` 的时候设置，这个字段只有边有。这个字段限制了该边的起点和终点只能是哪些点的组合，比如：`[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`，限制了该边只能是从 `vertex_label1` 到 `vertex_label2` 和 从 `vertex_label3` 到 `vertex_label4`。如果不想有任何限制，不设置该字段即可。
+
+其中`fields`为一个数组，其中每个元素定义数据的一列，内容如下：
+
+| 域名     | 说明                                     | 类型                                                                                                |
+| -------- | ---------------------------------------- | --------------------------------------------------------------------------------------------------- |
+| name     | 列名                                     | 字符串                                                                                              |
+| type     | 列数据类型                               | 字符串，有以下类型： int8, int16, int32, int64, float, double, string, date, datetime, binary, bool |
+| optional | 数据是否可以为空（可选，缺省值为 false） | 布尔值                                                                                              |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.列出所有 Label
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | edge | 边 Label 列表 | 列表 |
+  | vertex | 点 Label 列表 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.获取 Label 的数据格式定义
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+- **METHOD**: GET
+- **RESPONSE**: 数据列定义表，类型是一个词典，key 为列名，value 为列定义，列定义见如下：
+-
+
+| 域名     | 说明             | 类型   |
+| -------- | ---------------- | ------ |
+| optional | 该列值是否可为空 | 布尔值 |
+| type     | 列值类型         | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema 导入
+
+- **URI**: `/db/{graph_name}/schema/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+- **RESPONSE**:
+
+Schema 导入会根据 description 比较新的 Schema 和数据库中原有的 Schema 是否兼容，检查的粒度为 Label。如果不一致则出错，如果一致则添加原先 Schema 中不存在的 Label，返回 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串:
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.点操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+Nodes 提供节点（Vertex）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。
+
+#### 6.7.1.列出点数量和label数量
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | num_label | 点 label 数量 | 整数 |
+  | num_vertex | 点数量 | 整数 |
+
+_注意 num_vertex 返回的并不是准确的点数量，只是一个估计值。_
+
+#### 6.7.2.创建一个点
+
+向数据库中插入一个点。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 点属性 | 字典，其中 key 是列名，value 是相应值。value 必须是与列类型相应的类型，如列为 int32，则 value 只能是整数。 |
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新点 vid。该 ID 可用于后续的点操作中。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.批量创建点
+
+TuGraph 允许一次性插入多个点，以减少网络开销。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | fields | 点属性 | 列表 |
+  | values | 点数据 | 列表 |
+
+其中 fields 是一个字符串列表，列出一系列列名；values 是一个列表，其中每个元素是一个列表，列表中每个元素是列数据。
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新增加的点的 vid 列表，该列表中每一个 vid 按顺序对应请求中的每一个点。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.获取点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 属性 | 字典，格式为 { {列名 1}:{列值 1},...} |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.删除点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 被删掉的点的入边数量 | 整数值 |
+  | out | 被删掉的点的出边数量 | 整数值 |
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.获取点所有属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+- **METHOD**: GET
+- **RESPONSE**: Node 所有属性（字典）
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.获取点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: Node 某一属性
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.更新点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 点属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "********"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.8.边操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+与 Nodes 功能类似，Relationships 提供边（edge）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。每一条边都可以由一个唯一 ID（euid）来标识。这个 ID 可以从在插入边时获得，或者在 [列出所有边](#%E5%88%97%E5%87%BA%E6%89%80%E6%9C%89%E8%BE%B9) 操作中得到。
+
+#### 6.8.1.创建一条边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | destination | 目的点 ID | 整数值 |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid（字符串）。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.批量创建边
+
+- **URI**: `/db/{graph_name}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | fields | 数据列名 | 列表 |
+  | edge | 边数据 | 列表 |
+
+其中 edge 是一个数据列表，其中每个元素都是一条边，其定义如下：
+
+| 域名        | 说明     | 类型                                                   |
+| ----------- | -------- | ------------------------------------------------------ |
+| source      | 起点 id  | 整数                                                   |
+| destination | 终点 id  | 整数                                                   |
+| values      | 数据列表 | 列表，每列对应 fields 中的一个列，类型是该列对应的类型 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid 列表。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.列出所有出边（outgoing relationships）
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+- **METHOD**: GET
+- **RESPONSE**: 点 src 的所有出边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.列出所有入边（incoming relationships）
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+- **METHOD**: GET
+- **RESPONSE**: 点 dst 的所有入边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.列出所有边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 入边 | 列表 |
+  | out | 出边 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationships/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.获取边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | property | 边属性 | 字典 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.删除边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.获取边的所有属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+- **METHOD**: GET
+- **RESPONSE**: 边属性字典
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.获取边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功,返回代码 200,同时返回边的属性。如果失败,返回代码 400,同时返回 "Illegal field."。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.更新边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.9.索引
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+提供索引操作，接受 GET/POST 请求。
+
+#### 6.9.1.创建索引
+
+该操作会启动一个创建索引的后台任务，用户可以通过列出该 Label 相关的所有索引来检查新建索引的状态。
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: POST
+- **REQUEST**:
+
+| 域名    | 说明     | 类型                                  |
+|-------|--------|-------------------------------------|
+| label | Label 名 | 字符串                                 |
+| field | 域名     | 字符串                                 |
+| type  | 索引类型   | int类型，0表示非唯一索引，1表示全局唯一索引，2表示两点间唯一索引 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.列出所有索引
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.列出所有与某个 Label 相关的索引
+
+- **URI**: `/db/{graph_name}/index/{label}`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.删除索引
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.根据索引获取点
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+- **METHOD**: GET
+- **RESPONSE**: 点 vid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+### 6.10.在线增量导入
+
+#### 6.10.1.指定文件内容导入
+
+- **URI**: `/db/{graph_name}/import/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+  | data | 要导入的文件内容（建议最大在 16MB 左右，最长不超过 17MB） | 字符串 / 数组 / 对象 |
+  | continue_on_error | 出错后是否继续导入（可选，默认为`false`
+  ） | 布尔值 |
+  | delimiter | 分隔符（可选，默认为`“,”`
+  ） | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+分隔符可以是单字符，也可以是字符串，但不能包含`\r`或者`\n`。
+
+data 可以是如下形式之一：
+
+- 字符串如 `"1,2\n3,4\n"`
+- ASCII 码组成的数组如 `[49,44,50,10,51,44,52,10]`
+- 形如上述数组的字典如 `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+- **RESPONSE**:
+
+系统**不会**自动执行新建 label、添加索引等操作。在此操作之前需要保证涉及的 label 已经存在并具有适当的索引。
+
+如果成功导入完毕，返回代码 200，并在 `log` 字段返回一些日志信息（可能为空）；否则，保证所有的数据均未被导入，并在 `error_message` 字段返回错误信息。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true,
+      "delimiter": ","
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+由于请求中指定了在出错时继续，该返回信息说明 SRC_ID 为 1 的边没有被导入，而其他信息导入成功。
+
+### 6.11.其他
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.提取子图
+
+给出点 id 集合，返回包含该集合的最小子图。
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | vertex_ids | 点 id 集合 | 列表 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | nodes | 点数据 | 列表，每元素包含 vid, label, 以及属性 |
+  | relationships | 边数据 | 列表，每元素包含 src, dst, euid, label, 以及属性 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example response.**
+
+```
+• 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..f35f8d98d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+客户端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..dc6a25ef0c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/8.query/1.cypher.md
@@ -0,0 +1,2351 @@
+# Cypher API
+
+> 此文档主要介绍了TuGraph-Cypher的详细使用说明
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators支持进度一览：
+
+| 类别                                 | 支持                                                                                                        | 待支持                             |
+| ------------------------------------ | ----------------------------------------------------------------------------------------------------------- | ---------------------------------- |
+| General operators                    | `DISTINCT`, `.` for property access                                                                     | `[]` for dynamic property access |
+| Mathematical operators               | `+`, `-`, `*`, `/`, `%`, `^`                                                                    |                                    |
+| Comparison operators                 | `=`, `<>`, `<`, `>`, `<=`, `>=`, `IS NULL`, `IS NOT NULL`                                   |                                    |
+| String-specific comparison operators | `STARTS WITH`, `ENDS WITH`, `CONTAINS`, `REGEXP`                                                    |                                    |
+| Boolean operators                    | `AND`, `OR`, `XOR`, `NOT`                                                                           |                                    |
+| String operators                     | `+` for concatenation                                                                                     |                                    |
+| List operators                       | `+` for concatenation, `IN` to check existence of an element in a list, `[]` for accessing element(s) |                                    |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+```
+MATCH (p:person) RETURN DISTINCT p.born
+```
+
+- ❏ Accessing properties of a nested literal map using the `.` operator
+
+```
+WITH {person: {name: 'Anne', age: 25}} AS p
+RETURN p.person.name
+```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+
+```
+CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+       (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+       (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+```
+
+```
+MATCH (restaurant:Restaurant), (category:Category)
+WHERE restaurant["rating_" + category.name] > 6
+RETURN DISTINCT restaurant.name
+```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator  `^`
+
+```
+WITH 2 AS number, 3 AS exponent
+RETURN number ^ exponent AS result
+```
+
+- ✓ Using the unary minus operator `-`
+
+```
+WITH -3 AS a, 4 AS b
+RETURN b - a AS result
+```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+
+```
+WITH 4 AS one, 3 AS two
+RETURN one > two AS result
+```
+ 
+### 1.5.String-specific comparison operators
+
+- ✓ Using STARTS WITH to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate STARTS WITH 'Jo'
+RETURN candidate
+```
+
+- ✓ Using REGEXP to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate REGEXP 'Jo.*n'
+RETURN candidate
+```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+```
+WITH [2, 4, 7, 9, 12] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number = 4 OR (number > 6 AND number < 10)
+RETURN number
+```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+
+```
+RETURN [1,2,3,4,5]+[6,7] AS myList
+```
+
+- ✓ Using IN to check if a number is in a list
+
+```
+WITH [2, 3, 4, 5] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number IN [2, 3, 8]
+RETURN number
+```
+
+- ✓ Accessing elements in a list using the [] operator
+
+```
+WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+RETURN names[1..3] AS result
+```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses支持进度一览：
+
+| 类别                    | 语法                                  | 备注   |
+| ----------------------- | ------------------------------------- | ------ |
+| Reading clauses         | MATCH                                 | 支持   |
+|                         | OPTIONAL MATCH                        | 支持   |
+|                         | MANDATORY MATCH                       | 待支持 |
+| Projecting clauses      | RETURN … [AS]                        | 支持   |
+|                         | WITH … [AS]                          | 支持   |
+|                         | UNWIND … [AS]                        | 支持   |
+| Reading sub-clauses     | WHERE                                 | 支持   |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | 支持   |
+|                         | SKIP                                  | 支持   |
+|                         | LIMIT                                 | 支持   |
+| Writing clauses         | CREATE                                | 支持   |
+|                         | DELETE                                | 支持   |
+|                         | DETACH DELETE                         | 支持   |
+|                         | SET                                   | 支持   |
+|                         | REMOVE                                | 支持   |
+| Reading/Writing clauses | MERGE                                 | 支持   |
+|                         | CALL […YIELD]                        | 支持   |
+| Set operations          | UNION                                 | 待支持 |
+|                         | UNION ALL                             | 支持   |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+
+  ```
+  MATCH (n)
+  RETURN n
+  ```
+
+  - ✓ Get all nodes with a label
+
+  ```
+  MATCH (movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Related nodes
+
+  ```
+  MATCH (person {name: 'Laurence Fishburne'})-[]-(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Match with labels
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]-(movie:movie)
+  RETURN movie.title
+  ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]->(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Directed relationships and variable
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[r]->(movie)
+  RETURN type(r)
+  ```
+
+  - ✓ Match on relationship type
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})<-[:acted_in]-(actor)
+  RETURN actor.name
+  ```
+
+  - ✓ Match on multiple relationship types
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[:acted_in|:directed]-(person)
+  RETURN person.name
+  ```
+
+  - ✓ Match on relationship type and use a variable
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[r:acted_in]-(actor)
+  RETURN r.role
+  ```
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+
+  ```
+  MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+  RETURN type(r)
+  ```
+
+  - ✓ Multiple relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in]->(movie)<-[:directed]-(director)
+  RETURN movie.title, director.name
+  ```
+
+  - ✓ Variable-length relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in*1..3]-(movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Relationship variable in variable-length relationships
+
+  ```
+  MATCH p = (laurence {name: 'Laurence Fishburne'})-[:acted_in*2]-(co_actor)
+  RETURN p
+  ```
+
+  - ❏ Match with properties on a variable-length path
+
+  ```
+  MATCH p = (charlie:person)-[* {blocked:false}]-(martin:person)
+  WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+  RETURN p
+  ```
+
+  - ✓ Zero-length paths
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})-[*0..1]-(x)
+  RETURN x
+  ```
+
+  - ✓ Named paths
+
+  ```
+  MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+  ```
+
+  - ✓ Matching on a bound relationship
+
+  ```
+  MATCH (a)-[r]->(b)
+  WHERE euid(r)="0_3937_0_0_0"
+  RETURN a,b
+  ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+  CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+  ```
+
+  - ✓ All shortest paths
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+  CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN
+  nodeIds,relationshipIds,cost
+  ```
+- Get node or relationship by id
+
+  - ✓ Node by id
+
+  ```
+  MATCH (n)
+  WHERE id(n)= 0
+  RETURN n
+  ```
+
+  - ✓ Relationship by id
+
+  ```
+  MATCH ()-[r]->()
+  WHERE euid(r) = "0_3937_0_0_0"
+  RETURN r
+  ```
+
+  - ✓ Multiple nodes by id
+
+  ```
+  MATCH (n)
+  WHERE id(n) IN [0, 3, 5]
+  RETURN n
+  ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n
+```
+
+- ✓ Return relationships
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'})-[r:acted_in]->(c)
+RETURN r
+```
+
+- ✓ Return property
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n.born
+```
+
+- ❏ Return all elements
+
+```
+MATCH p = (a {name: 'A'})-[r]->(b)
+RETURN *
+```
+
+- ❏ Variable with uncommon characters
+
+```
+MATCH (`This isn\'t a common variable`)
+WHERE `This isn\'t a common variable`.name = 'A'
+RETURN `This isn\'t a common variable`.happy
+```
+
+- ✓ Aliasing a field
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born AS SomethingTotallyDifferent
+```
+
+- ✓ Optional properties
+
+```
+MATCH (n)
+RETURN n.age
+```
+
+- ❏ Other expressions
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born > 1900, "I'm a literal", (a)-[]->()
+```
+
+`(a)-[]->()`  not supported.
+
+- ✓ Unique results
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})-[]->(b)
+RETURN DISTINCT b
+```
+
+### 2.4.WHERE
+
+- Basic usage
+  - ✓ Boolean operations
+
+  ```
+  MATCH (n)
+  WHERE n.name = 'Laurence Fishburne' XOR (n.born > 1965 AND n.name = 'Carrie-Anne Moss')
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node label
+
+  ```
+  MATCH (n)
+  WHERE n:person
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node property
+
+  ```
+  MATCH (n)
+  WHERE n.born > 2000
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on relationship property
+
+  ```
+  MATCH (n)-[k:acted_in]->(f)
+  WHERE k.role = "Trinity"
+  RETURN f.title
+  ```
+
+  - ❏ Filter on dynamically-computed property
+
+  ```
+  WITH 'AGE' AS propname
+  MATCH (n)
+  WHERE n[toLower(propname)]< 30
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Property existence checking
+
+  ```
+  MATCH (n)
+  WHERE exists(n.born)
+  RETURN n.name, n.born
+  ```
+
+- String matching
+  - ✓ Match the beginning of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name STARTS WITH 'Pet'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match the ending of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name ENDS WITH 'ter'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match anywhere within a string
+
+  ```
+  MATCH (n)
+  WHERE n.name CONTAINS 'ete'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ String matching negation
+
+  ```
+  MATCH (n)
+  WHERE NOT n.name ENDS WITH 's'
+  RETURN n.name, n.born
+  ```
+
+- Using path patterns in `WHERE`
+  - ❏ Filter on patterns
+
+  ```
+  MATCH (tobias {name: 'Tobias'}), (others)
+  WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+  RETURN others.name, others.age
+  ```
+
+  - ❏ Filter on patterns using NOT
+
+  ```
+  MATCH (persons), (peter {name: 'Peter'})
+  WHERE NOT (persons)-[]->(peter)
+  RETURN persons.name, persons.age
+  ```
+
+  - ❏ Filter on patterns with properties
+
+  ```
+  MATCH (n)
+  WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Filter on relationship type
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name='Laurence Fishburne' AND type(r) STARTS WITH 'ac'
+  RETURN type(r), r.role
+  ```
+
+- Lists
+  - ✓ IN operator
+
+  ```
+  MATCH (a)
+  WHERE a.name IN ['Laurence Fishburne', 'Tobias']
+  RETURN a.name, a.born
+  ```
+
+- Missing properties and values
+  - ✓ Default to false if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white'
+  RETURN n.name, n.age, n.belt
+  ```
+
+  - ✓ Default to true if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+  ORDER BY n.name
+  ```
+
+  - ✓ Filter on null
+
+  ```
+  MATCH (person)
+  WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+  person.belt
+  ```
+
+- Using ranges
+  - ✓ Simple range
+
+  ```
+  MATCH (a)
+  WHERE a.name >= 'Peter'
+  RETURN a.name, a.born
+  ```
+
+  - ✓ Composite range
+
+  ```
+  MATCH (a)
+  WHERE a.name > 'Andres' AND a.name < 'Tobias'
+  RETURN a.name, a.born
+  ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 3
+```
+
+- ✓ Return middle two records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 1
+LIMIT 2
+```
+
+- ❏ Using an expression with SKIP to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP toInteger(3*rand())+ 1
+```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT 3
+```
+
+- ❏ Using an expression with LIMIT to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT toInteger(3 * rand())+ 1
+```
+
+### 2.7.CREATE
+
+- Create nodes
+
+> **Note**
+> TuGraph不支持创建空的nodes，不支持多labels。
+
+  - ☒ Create single node
+
+  ```
+  CREATE (n)
+  ```
+
+  - ☒ Create multiple nodes
+
+  ```
+  CREATE (n), (m)
+  ```
+
+  - ☒ Create a node with a label
+
+  ```
+  CREATE (n:person)
+  ```
+
+  - ☒ Create a node with multiple labels
+
+  ```
+  CREATE (n:Person:Swedish)
+  ```
+
+  - ✓ Create node and add labels and properties
+
+  ```
+  CREATE (n:person {id:2001, name: 'Andres'})
+  ```
+
+  - ✓ Return created node
+
+  ```
+  CREATE (n:person {id:2002, name: 'Andres'})
+  RETURN n
+  ```
+
+- Create relationships
+  - ✓ Create a relationship between two nodes
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:write]->(m)
+  ```
+
+  - ✓ Create a relationship and set properties
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:acted_in{role: 'Trinity'}]->(m)
+  ```
+
+  - ❏ Create a full path
+
+  ```
+  CREATE p = (andres:person {id: 2005, name:'Andres'})-[:acted_in {role: 'Trinity'}]->
+  (m:movie {id: 2006})<-[:acted_in {role: 'Trinity'}]-(michael {id: 2006, name:'Michael'})
+  RETURN p
+  ```
+
+- Use parameters with CREATE
+  - ❏ Create node with a parameter for the properties
+
+  ```
+  CREATE (n:Person $props)
+  RETURN n
+  ```
+
+  - ☒ Create multiple nodes with a parameter for their properties
+
+  ```
+  UNWIND $props AS map
+  CREATE (n)
+  SET n = map
+  ```
+  cannot create vertex without label.
+
+### 2.8.CALL[…YIELD]
+
+- ✓ Call a procedure using CALL
+
+```
+CALL db.vertexLabels
+```
+
+- ✓ View the signature for a procedure
+
+```
+CALL dbms.procedures() YIELD name, signature
+RETURN signature
+```
+
+- ❏ Call a procedure using a quoted namespace and name
+
+```
+CALL `db`.`vertexLabels`
+```
+
+- ✓ Call a procedure with literal arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+```
+
+- ❏ Call a procedure with parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+```
+
+- ❏ Call a procedure with mixed literal and parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+```
+
+- ✓ Call a procedure with literal and default arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+```
+
+- ✓ Call a procedure within a complex query using CALL…YIELD
+
+```
+CALL db.vertexLabels() YIELD label
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure and filter its results
+
+```
+CALL db.vertexLabels() YIELD label
+WHERE label CONTAINS 'User'
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure within a complex query and rename its outputs
+
+```
+CALL db.propertyKeys() YIELD propertyKey AS prop
+MATCH (n)
+WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+
+```
+MATCH (n:person)
+RETURN n.name AS name
+UNION ALL MATCH (n:movie)
+RETURN n.title AS name
+```
+
+- ❏ Combine two queries and remove duplicates
+
+```
+MATCH (n:Actor)
+RETURN n.name AS name
+UNION
+MATCH (n:Movie)
+RETURN n.title AS name
+```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| 种类                   | 功能               | 备注                      |
+| ---------------------- |------------------| ------------------------- |
+| Predicate functions    | exists()         |                           |
+|                        | all()            | 不支持                    |
+|                        | any()            | 不支持                    |
+|                        | single()         | 不支持                    |
+|                        | none()           | 不支持                    |
+| Scalar functions       | id()             |                           |
+|                        | euid()           |                           |
+|                        | properties()     |                           |
+|                        | head()           |                           |
+|                        | last()           |                           |
+|                        | toBoolean()      |                           |
+|                        | toFloat()        |                           |
+|                        | toInteger()      |                           |
+|                        | toString()       |                           |
+|                        | type()           |                           |
+|                        | startnode()      |                           |
+|                        | endnode()        |                           |
+|                        | size()           |                           |
+|                        | length()         |                           |
+|                        | substring()      |                           |
+|                        | concat()         |                           |
+|                        | label()          | OpenCypher扩展方法      |
+| Aggregating functions  | avg()            |                           |
+|                        | collect()        |                           |
+|                        | count()          |                           |
+|                        | max()            |                           |
+|                        | min()            |                           |
+|                        | percentileCont() |                           |
+|                        | percentileDisc() |                           |
+|                        | stDev()          |                           |
+|                        | stDevP()         |                           |
+|                        | variance()       |                           |
+|                        | varianceP()      |                           |
+|                        | sum()            |                           |
+| List functions         | keys()           |                           |
+|                        | labels()         | 返回结果有且只有一个label |
+|                        | nodes()          |                           |
+|                        | range()          |                           |
+|                        | subscript()      | 不支持                    |
+| Mathematical functions | abs()            |                           |
+|                        | ceil()           |                           |
+|                        | floor()          |                           |
+|                        | rand()           |                           |
+|                        | round()          |                           |
+|                        | sign()           |                           |
+| String functions       | /                |                           |
+
+### 3.2.Predicate functions
+
+- exists()
+  judge it whether a vertex or edge has the field  .
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+WHERE exists(n.born)
+RETURN n.name, n.born
+```
+
+**Example output:**
+
+| exists(name) |
+| ------------ |
+| true         |
+
+### 3.3.Scalar functions
+
+- id()
+  get the id of vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN id(a)
+```
+
+**Example output:**
+
+| vid |
+| --- |
+| 1   |
+| 2   |
+| ... |
+
+- properties()
+  get  a map containing all the properties of a node or relationship.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person {name: 'Laurence Fishburne'})
+RETURN n
+```
+
+- head()
+  get the first element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, head(coll)
+```
+
+**Example output:**
+
+| coll                  | head(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "one"         |
+
+- last()
+  get the last element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, last(coll)
+```
+
+**Example output:**
+
+| coll                  | last(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "three"       |
+
+- toFloat()
+  Converts an integer or string value to a floating point number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toFloat('11.5')
+```
+
+**Example output:**
+
+| float |
+| ----- |
+| 11.5  |
+
+- toInteger()
+  Converts a floating point or string value to an integer value.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toInteger('2.3') AS integer
+```
+
+**Example output:**
+
+| integer |
+| ------- |
+| 2       |
+
+- toString()
+  Converts an integer, float, boolean value to a string.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toString(2.3)
+```
+
+- type()
+  get the string representation of the relationship type.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)-[r]->()
+WHERE n.name = 'Laurence Fishburne'
+RETURN type(r)
+```
+
+**Example output:**
+
+| type     |
+| -------- |
+| acted_in |
+| acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+  Returns the average of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN avg(n.born)
+```
+
+**Example output:**
+
+| avg(n.born)        |
+| ------------------ |
+| 1869.2661654135338 |
+
+- collect()
+  Returns a list containing the values returned by an expression.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN collect(n.born)
+```
+
+**Example output:**
+
+| collect(n.born) |
+| --------------- |
+| [1967,...]      |
+
+- count()
+  Returns the number of values or records.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n {name: 'Laurence Fishburne'})-[]->(x)
+RETURN labels(n), n.born, count(*)
+```
+
+**Example output:**
+
+| labels(n)  | n.born | count(*) |
+| ---------- | ------ | -------- |
+| ["person"] | 1961   | 3        |
+
+- max()
+  Returns the maximum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN max(n.born)
+```
+
+**Example output:**
+
+| max(n.born) |
+| ----------- |
+| 2003        |
+
+- min()
+  Returns the minimum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN min(n.born)
+```
+
+**Example output:**
+
+| min(n.born) |
+| ----------- |
+| 1000        |
+
+- percentileCont()
+  Returns the percentile of a value over a group using linear interpolation.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileCont(n.born, 0.4)
+```
+
+**Example output:**
+
+| percentileCont(n.born, 0.4) |
+| --------------------------- |
+| 1953                        |
+
+- percentileDisc()
+  Returns the nearest value to the given percentile over a group using a rounding method.
+  **Scope:** whole instance.
+  **Output:** the percentile of the given value over a group.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileDisc(n.born, 0.5)
+```
+
+**Example output:**
+
+| percentileDisc(n.age, 0.5) |
+| -------------------------- |
+| 1959                       |
+
+- stDev()
+  Returns the standard deviation for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDev(n.born)
+```
+
+**Example output:**
+
+| stDev(n.born)      |
+| ------------------ |
+| 279.53117993401725 |
+
+- stDevP()
+  Returns the standard deviation for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDevP(n.born)
+```
+
+**Example output:**
+
+| stDevP(n.born)     |
+| ------------------ |
+| 279.3209270423399  |
+
+- variance()
+  Returns the variance for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN variance(n.born)
+```
+
+**Example output:**
+
+| variance(n.age)   |
+| ----------------- |
+| 78137.68055530392 |
+
+- varianceP()
+  Returns the variance for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN varianceP(n.born)
+```
+
+**Example output:**
+
+| varianceP(n.age)  |
+| ----------------- |
+| 78020.18028379219 |
+
+- sum()
+  Returns the sum of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN sum(n.born)
+```
+
+**Example output:**
+
+| sum(n.born) |
+| ----------- |
+| 1243062     |
+
+### 3.5.List Funtions:
+
+- keys()
+  get the field names of some vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN keys(a) LIMIT 1
+```
+
+**Example output:**
+
+| keys(a)               |
+| --------------------- |
+| ["name","age","eyes"] |
+
+- labels()/label()
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN labels(a) LIMIT 1
+```
+
+**Example output:**
+
+| labels                 |
+| ---------------------- |
+| ["Person"]             |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice"})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+
+### 3.6.Mathematical functions
+
+- abs()
+  get the absolute value of some data.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a:person {name: 'Laurence Fishburne'}),
+(e:person {name: 'Carrie-Anne Moss'})
+RETURN a.born, e.born, abs(a.born-e.born)
+```
+
+**Example output:**
+
+| a.born | e.born | abs(a.born - e.born) |
+| ------ | ------ | -------------------- |
+| 38     | 41     | 1                    |
+
+- ceil()
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN ceil(0.1)
+```
+
+**Example output:**
+
+| ceil(0.1) |
+| --------- |
+| 1.0       |
+
+- floor()
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN floor(0.9)
+```
+
+**Example output:**
+
+| floor(0.9) |
+| ---------- |
+| 0.0        |
+
+- round()
+  Returns the value of a number rounded to the nearest integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN round(3.141592)
+```
+
+**Example output:**
+
+| round |
+| ----- |
+| 3     |
+
+- rand()
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN rand()
+```
+
+**Example output:**
+
+| rand()             |
+| ------------------ |
+| 0.9797131960534085 |
+
+- sign()
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN sign(-17), sign(0.1)
+```
+
+**Example output:**
+
+| sign(-17) | sign(0.1) |
+| --------- | --------- |
+| -1        | 1         |
+
+TuGraph 查询语言与 OpenCypher 的不同点如下：
+
+- Label 数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 4.附录1. 语法扩充及不同
+
+TuGraph查询语言与OpenCypher的不同点如下：
+
+- Label数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.附录2. 内置procedures列表
+### 5.1.procedures样例
+
+* dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                        | name         |
+  | ---------------------------------------------------- | -------------------- |
+  | db.vertexLabels() :: (label::STRING)               | db.vertexLabels        |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels |
+  | db.indexes() :: (index::LIST)            | db.indexes       |
+  | ...                          | ...          |
+
+* db.subgraph()
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | vids       | list           | list of vertex id                                                     |
+
+  **Output:**
+
+  Get a json containing all the properties of nodes and relationships.
+
+  **Example input:**
+
+  ```
+  CALL db.subgraph([3937,4126,4066,4010])
+  ```
+
+  **Example output**
+
+  | subgraph |
+  | -------- |
+  | {"nodes":[{"identity":3937,"label":"movie","properties":{"duration":136,"id":1,"poster_image":"http://image.tmdb.org/t/p/w185/gynBNzwyaHKtXqlEKKLioNkjKgN.jpg","rated":"R","summary":"Thomas A. Anderson is a man living two lives. By day he is an average computer programmer and by night a malevolent hacker known as Neo who finds himself targeted by the police when he is contacted by Morpheus a legendary computer hacker who reveals the shocking truth about our reality.","tagline":"Welcome to the Real World.","title":"The Matrix"}},{"identity":4010,"label":"user","properties":{"id":44,"login":"Howard"}},{"identity":4066,"label":"user","properties":{"id":202,"login":"Enoch"}},{"identity":4126,"label":"user","properties":{"id":464,"login":"Wilburn"}}],"relationships":[{"dst":4126,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4010,"temporal_id":0},{"dst":4010,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4066,"temporal_id":0},{"dst":4066,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4126,"temporal_id":0}]} |
+
+* db.vertexLabels()
+
+  Lists all available vertex labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+  **Example output:**
+
+    | label   |
+    | ------- |
+    | genre   |
+    | keyword |
+    | movie   |
+    | ...     |
+
+* db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edge labels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | relationshipType |
+  | ---------------- |
+  | acted_in     |
+  | directed     |
+  | ...          |
+
+* db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of  vertex label    |
+  | primary_field | string  | primary field of vertex label |
+  | field_spec | list       | specification of a field |
+
+   in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+    **Output:** If successful, it returns a success message.
+
+    **Example input:**
+
+    ```
+    CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+    ```
+
+    **Example output:**
+
+    ```
+    Added label [Person]
+    ```
+
+* db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description           |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field         |
+  | type       | string     | type of the field         |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name     | type   | optional |
+  | ------------ | ------ | -------- |
+  | id       | INT32  | false    |
+  | born     | INT32  | true     |
+  | name     | STRING | true     |
+  | poster_image | STRING | true     |
+
+* db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | extra      | string     | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.
+    for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+* db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:**
+
+  | field_name | field_type | description              |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description           |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string      | either 'vertex' or 'edge'     |
+  | label_name  | string      | name of the label         |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description           |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string     | either 'vertex' or 'edge' |
+  | label_name       | string     | name of the label     |
+  | field_value_spec | list       | specification of a field  |
+
+    in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, optional]`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+    ```
+    CALL db.alterLabelModFields(
+    'vertex',
+    'new_label',
+    ['birth_date', DATETIME, true],
+    ['gender', BOOL, true])
+    ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of the label    |
+  | edge_constraints | string | edge constraints |
+  | field_spec | list       | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for  optional fields.
+
+  `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+* db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+
+   **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+   **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+* db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+  | pair_unique | boolean    | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+* dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description      |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string     | the current password |
+  | new_password     | string     | new password     |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+   **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string     | the user's name |
+  | new_password | string     | new password    |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.createUser(user_name, password)
+
+  create  new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | -------------------------------- |
+  | user_name | string     | the new user name        |
+  | password  | string     | the password of new user     |
+  
+   **Output:**
+  
+    If successful, it returns a success message.
+  
+   **Example input:**
+  
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+  
+   **Example output:**
+  
+  ```
+  true
+  ```
+  
+* dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string     | the user name to be deleted |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+   a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string     | the user name           |
+  | is.admin  | boolean    | the permission of this user |
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       |  ...    |
+
+* dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+    a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description       |
+  | --------- | -------------- | --------------------- |
+  | user.user | string     | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+* dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+   a list of  ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host     |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...      |
+
+* dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+   the number of ip which been deleted.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+    the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description              |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string     | the name of new subgraph     |
+  | description | string     | description of new subgraph      |
+  | max_size_GB | integer    | Upper limit of subgraph capacity |
+
+   **Output:**
+
+    if successful , it will return true.
+
+   **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+   **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+  | config     | map        | the configuration to be modified     |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.listGraphs()
+
+  get all subgraphs in this graph database.
+
+  **Output:**
+
+    a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+
+* dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+    | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+* dbms.config.list()
+
+  get config of this graph database.
+
+  **Output:**
+
+    a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  |-----------| ---------|
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       |  ...    |
+
+* dbms.config.update(updates)
+
+  get some config of this graph database.
+
+  **Output:**
+
+    If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+    enable_ip_check:false,
+    durable:true,
+    optimistic_txn:true,
+    enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+* dbms.takeSnapshot()
+
+  take the  snapshot  on this current graph database.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+* dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path               |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+* algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                          |
+  | --------- | -------------- | ------------------------------------------------------------ |
+  | startNode | Node       | the source node of paths                     |
+  | endNode   | Node       | the destination node paths                   |
+  | config    | MAP        | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+    If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2     | 1     |
+
+* algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+* algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                        |
+  | --------- | -------------- | ---------------------------------------------------------- |
+  | id    | ANY        | the id of vertexes or edges , the id must be variable      |
+  | config    | MAP        | the configuration of  this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or  it is an edge id.
+
+  **Output:**
+
+    If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.内置procedures完整列表
+
+| Name                                  | Description                        | Signature                                                                                                                                                                               |
+|---------------------------------------|------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.subgraph                           | 列出点的子图                             | db.subgraph(vids::LIST) :: (subgraph::STRING)                                                                                                                                           |
+| db.vertexLabels                       | 列出所有Vertex Label                   | db.vertexLabels() :: (label::STRING)                                                                                                                                                    |
+| db.edgeLabels                         | 列出所有Edge Label                     | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                 |
+| db.indexes                            | 列出所有索引                             | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                    |
+| db.listLabelIndexes                   | 列出所有与某个Label相关的索引               | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                          |
+| db.warmup                             | 预热数据                               | db.warmup() :: (time_used::STRING)                                                                                                                                                      |
+| db.createVertexLabel                  | 创建Vertex Label                     | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                  |
+| db.createLabel                        | 创建Vertex/Edge Label                | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                             |
+| db.getLabelSchema                     | 列出label schema                     | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                               |
+| db.getVertexSchema                    | 列出点的 schema                        | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                      |
+| db.getEdgeSchema                      | 列出边的 schema                        | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                        |
+| db.deleteLabel                        | 删除Vertex/Edge Label                | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                       |
+| db.alterLabelDelFields                | 修改label删除属性                        | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                            |
+| db.alterLabelAddFields                | 修改label添加field                     | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                 |
+| db.alterLabelModFields                | 修改label field                      | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                       |
+| db.createEdgeLabel                    | 创建Edge Label                       | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                     |
+| db.addIndex                           | 创建索引                               | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                          |
+| db.addEdgeIndex                       | 创建索引                               | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                 |
+| db.deleteIndex                        | 删除索引                               | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                       |
+| db.backup                             | 备份数据                               | db.backup(destination::STRING) :: ()                                                                                                                                                    |
+| dbms.procedures                       | 列出所有procedures                     | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                   |
+| dbms.security.changePassword          | 更改当前用户的密码                          | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                 |
+| dbms.security.changeUserPassword      | 更改指定用户的密码                          | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.createUser              | 创建用户                               | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                |
+| dbms.security.deleteUser              | 删除用户                               | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.listUsers               | 列出所有用户                             | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                         |
+| dbms.security.showCurrentUser         | 列出当前用户信息                           | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                               |
+| dbms.security.getUserPermissions      | 列出指定用户的权限                          | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                 |
+| dbms.graph.createGraph                | 创建子图                               | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                       |
+| dbms.graph.modGraph                   | 修改子图属性                             | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                         |
+| dbms.graph.deleteGraph                | 删除子图                               | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.graph.listGraphs                 | 列出所有子图                             | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                      |
+| dbms.graph.getGraphInfo               | 列出指定子图的信息                          | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                    |
+| dbms.security.addAllowedHosts         | 添加ip到信任列表                          | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                        |
+| dbms.security.deleteAllowedHosts      | 从信任列表删除ip                          | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                             |
+| dbms.security.listAllowedHosts        | 列出信任列表中的主机ip                       | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                      |
+| dbms.config.update                    | 更新TuGraph配置                        | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                   |
+| dbms.config.list                      | 列出TuGraph配置                        | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                         |
+| algo.shortestPath                     | 查询两个点间的最短路径                        | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                   |
+| algo.allShortestPaths                 | 查询两个点间的所有最短路径                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                    |
+| algo.native.extract                   | 查询指定VertexId/EdgeUid（列表）指定field的值（列表） | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                |
+| db.flushDB                            | 刷新db                               | db.flushDB() :: (::VOID)                                                                                                                                                                |
+| dbms.security.listRoles               | 列出所有角色                             | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                         |
+| dbms.security.createRole              | 创建角色                               | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                    |
+| dbms.security.deleteRole              | 删除角色                               | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.getRoleInfo             | 获取角色详细信息                           | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                             |
+| dbms.security.disableRole             | 禁用/启用角色                            | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.modRoleDesc             | 修改角色描述信息                           | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.rebuildRoleAccessLevel  | 删除角色权限并重建                          | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                        |
+| dbms.security.modRoleAccessLevel      | 修改角色对指定图的访问权限                      | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                            |
+| dbms.security.modRoleFieldAccessLevel | 修改角色对指定属性的访问权限                     | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                 |
+| dbms.security.getUserInfo             | 获取用户详细信息                           | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                             |
+| dbms.security.disableUser             | 禁用/启用用户                            | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.setCurrentDesc          | 设置当前用户描述信息                         | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                           |
+| dbms.security.setUserDesc             | 设置用户描述信息                           | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.getUserMemoryUsage      | 获取用户内存用量                           | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                               |
+| dbms.security.setUserMemoryLimit      | 设置用户内存限制                           | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                         |
+| dbms.security.deleteUserRoles         | 删除用户与角色的联系                         | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.rebuildUserRoles        | 清空用户角色的关系并重建                       | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                    |
+| dbms.security.addUserRoles            | 新增用户与角色的联系                         | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                        |
+| db.plugin.loadPlugin                  | 装载plugin                           | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN,version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | 删除plugin                           | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                             |
+| db.plugin.listPlugin                  | 列出已装载的plugin                       | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | 获取plugin的详细信息                      | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                          |
+| db.plugin.callPlugin                  | 执行plugin                           | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                    |
+| db.importor.dataImportor              | 导入点或边数据                            | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                             |
+| db.importor.schemaImportor            | 导入点或边schema                        | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                             |
+| db.addFullTextIndex                   | 添加全文索引                             | db.addFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                             |
+| db.deleteFullTextIndex                | 删除全文索引                             | db.deleteFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                          |
+| db.rebuildFullTextIndex               | 重建全文索引                             | db.rebuildFullTextIndex(vertex_labels::STRING, edge_labels::STRING) :: (::VOID)                                                                                                         |
+| db.fullTextIndexes                    | 查看全文索引                             | db.fullTextIndexes() :: (is_vertex::BOOLEAN, label::STRING, field::STRING)                                                                                                              |
+| dbms.meta.count                       | 查看点边总数                             | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                 |
+| dbms.meta.countDetail                 | 查看点边总数详情                           | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                       |
+| dbms.meta.refreshCount                | 重新统计点边数量，统计期间停写。                   | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                 |
+| dbms.task.listTasks                   | 查询正在执行的任务                          | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                    |
+| dbms.task.terminateTask               | 中止任务                               | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                      |
+| dbms.ha.clusterInfo                   | HA模式下查看集群状态                        | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                       |
+| db.dropDB                             | 清空数据库                              | db.dropDB() :: (::VOID)                                                                                                                                                                 |
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/8.query/2.gql.md
new file mode 100644
index 0000000000..a5234f46aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/8.query/2.gql.md
@@ -0,0 +1,388 @@
+# ISO GQL
+
+
+## 1.GQL简介
+Graph Query Language(GQL, 图查询语言)是一种国际标准语言，用于属性图查询，该语言建立在SQL的基础上，并整合了现有的[openCypher、PGQL、GSQL和G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/)语言的成熟思想。目前该标准仍然处于草稿阶段。
+
+TuGraph基于[ISO GQL (ISO/IEC 39075) Antlr4 语法文件](https://github.com/TuGraph-family/gql-grammar)实现了GQL，并做了一些扩展与改造。目前并未完全支持所有的GQL语法，我们会在未来逐步完善。
+
+## 2.Clauses
+
+| 类别                | 子句           |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+### 2.1.MATCH
+
+`MATCH`子句式是GQL最基础的子句，几乎所有查询都是通过 `MATCH`展开。
+
+`MATCH`子句用于指定在图中搜索的匹配模式，用来匹配满足一定条件的点或者路径。
+
+#### 点查询
+
+##### 查询所有点
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### 查询特定标签的点
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### 通过属性匹配点
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### 通过过滤条件匹配点
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 边查询
+
+##### 出边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### 入边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### 带过滤条件的边匹配
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+返回结果
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### 路径匹配
+
+##### 不定跳查询
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+`OPTIONAL MATCH`匹配图模式，如果未命中，则返回`null`。
+
+#### 查询命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### 查询未命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+返回结果
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+`RETURN`子句指定返回结果，包括返回点、边、路径、属性等。
+
+#### 返回点
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### 返回边
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### 返回属性
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 不常见字符串作为变量名
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### 列别名
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### 可选属性
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### 其它表达式
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### 结果唯一性
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+返回结果
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+`NEXT`子句用于连接多个子句。
+
+#### 连接MATCH
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE`子句用于过滤记录。
+
+#### 过滤点
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### 过滤边
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+返回结果
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### 布尔表达式
+
+`AND`, `OR`, `XOR`和 `NOT`布尔表达式可以用在 `WHERE`中用来过滤数据。
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+
+### 2.6.ORDER BY
+
+`ORDER BY`是`RETURN`的子句，对输出的结果进行排序。
+
+#### 对结果排序
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+返回结果
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP`指定结果偏移行数。
+
+#### 未使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### 使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+`LIMIT`限制结果行数。
+
+#### 使用LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/8.query/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/8.query/index.rst
new file mode 100644
index 0000000000..0571c71701
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/8.query/index.rst
@@ -0,0 +1,9 @@
+查询语言
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..1748f19794
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,349 @@
+# Procedure API
+
+> 此文档主要讲解 TuGraph 的存储过程使用说明
+
+## 1.简介
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个请求并在客户端完成整个处理流程的方式，TuGraph 提供的存储过程是更简洁和高效的选择。
+
+与传统数据库类似，TuGraph 的存储过程运行在服务器端，用户通过将处理逻辑（即多个操作）封装到一个过程单次调用，并且可以在实现时通过并行处理的方式（例如使用相关的 C++ OLAP 接口以及基于其实现的内置算法）进一步提升性能。
+
+存储过程中有一类特殊的API来进行数据的并行操作，我们叫 Traversal API，见[文档](2.traversal.md)。
+
+## 2.存储过程的版本支持
+
+目前TuGraph支持两个版本的存储过程，适用于不同的场景，v3.5版本只支持v1，可通过REST或RPC接口直接调用；从v3.5版本开始支持v2，能够在图查询语言（比如Cypher）中嵌入调用，我们称之为POG（Procedure On Graph query language，APOC）。
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+| 适用场景                 | 极致性能，或者复杂的多事务管理情形       | 一般情况，与Cypher高度联动 |
+| 事务                    | 函数内部创建，可自由控制多事务          | 外部传入函数，单一事务     |
+| 签名（参数定义）          | 无                                 | 有                    |
+| 输入输出参数类型          | 不需要指定                           | 需要指定参数类型        |
+| Cypher Standalone Call | 支持                                | 支持                  |
+| Cypher Embeded Call    | 不支持                              | 支持                  |
+| 语言                    | C++/Python/Rust                    | C++                  |
+| 调用模式                 | 直接传字符串，一般为JSON               | 通过Cypher语句中的变量  |
+
+在TuGraph中，存储过程v1和v2单独管理，支持增删查，但仍不建议重名。
+
+## 3.存储过程语言支持
+
+在 TuGraph 中，用户可以动态的加载，更新和删除存储过程。TuGraph 支持 C++ 语言、 Python 语言和 Rust 语言编写存储过程。在性能上 C++ 语言支持的最完整，性能最优。
+
+注意存储过程是在服务端编译执行的逻辑，和客户端的语言支持无关。
+
+## 4.Procedure v1接口
+
+## 4.1.编写存储过程
+
+### 4.1.1.编写C++存储过程
+
+用户可以通过使用 Procedure API 或者 Traversal API 来编写 C 存储过程。一个简单的 C 存储过程举例如下：
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## 统计所有年龄为10的学生数量
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+从代码中我们可以看到，存储过程的入口函数是`Process`函数，它的参数有三个，分别为：
+
+- `db`: 数据库实例
+- `request`: 输入请求数据，可以是二进制字节数组，或者 JSON 串等其它任意格式。
+- `response`: 输出数据，可以是字符串，也可以直接返回二进制数据。
+
+`Process`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误，此时用户可以通过`response`来返回错误信息以方便调试。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`age_10`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 age_10.so，然后用户就可以将它加载到服务器中了。
+
+### 4.1.2.编写Python存储过程
+
+与 C++类似，Python 存储过程也可以调用 core API，一个简单的例子如下：
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+Python 存储过程返回的是一个 tuple，其中第一个元素是一个布尔值，表示该存储过程是否成功执行；第二个元素是一个`str`，里面是需要返回的结果。
+
+Python 存储过程不需要编译，可以直接加载。
+
+## 4.2.如何使用存储过程
+### 4.2.1.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`age_10.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`age_10.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+### 4.2.2.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+### 4.2.6.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
+
+## 5.Procedure v2接口
+
+下面的说明以 REST API 为例，介绍存储过程v2的调用。
+
+### 5.1.编写存储过程
+
+
+用户可以通过使用 lgraph API 来编写 C++ 存储过程。一个简单的 C++ 存储过程举例如下：
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+从代码中我们可以看到：
+- 存储过程定义了一个获取签名的方法`GetSignature`。该方法返回了存储过程的签名，其中包含输入参数名称及其类型，返回参数及其类型。这使得Cypher查询语句在调用存储过程能够利用签名信息校验输入数据以及返回数据是否合理。
+- 入口函数是`ProcessInTxn`函数，它的参数有三个，分别为：
+
+- `txn`: 存储过程所处的事务，通常来说即调用该存储过程的Cypher语句所处事务。
+- `request`: 输入数据，其内容为`GetSignature`中定义的输入参数类型及其Cypher查询语句中传入的值经过json序列化后的字符串。e.g. `{num_iteration: 10}`
+- `response`: 输出数据，为保证在Cypher语言中能够兼容，用户可以通过往`lgraph_api::Result` 写入存储过程处理后的数据，最后用`lgraph_api::Result::Dump`来序列化成json格式的数据。
+
+`ProcessInTxn`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`custom_pagerank`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 custom_pagerank.so，然后用户就可以将它加载到服务器中了。
+
+
+### 5.2.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`custom_pagerank.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`custom_pagerank.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+#### 5.2.1.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+#### 5.2.5.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..9613828c50
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,128 @@
+# Traversal API
+
+> 此文档主要讲解 TuGraph 的存储过程中的Traversal API
+
+## 1. 简介
+
+TuGraph 强大的在线分析处理（OLAP）能力是其区别于其它图数据库的一个重要特性。
+借助 C++ OLAP API（olap_on_db.h），用户可以快速地导出一个需要进行复杂分析的子图，然后在其上运行诸如 PageRank、连通分量、社区发现等迭代式图计算过程，最后根据结果做出相应决策。
+导出和计算的过程都可以通过并行处理的方式进行加速，从而实现几乎实时的分析处理，避免了传统解决方案需要将数据导出、转换、再导入（ETL）到专门的分析系统进行离线处理的冗长步骤。
+
+TuGraph 内置了大量常用的图分析算法和丰富的辅助接口，因此用户几乎不需要自己来实现具体的图计算过程，只需在实现自己的存储过程时将相应算法库的头文件（.h 文件）包含到自己程序中，并在编译时链接相应的动态库文件（.so）即可。
+一般情况下，用户需要自己实现的只有将需要分析的子图抽取出来的过程。
+
+目前 Traversal API 仅支持 C++。
+
+## 2. 接口说明
+
+### 2.1. Snapshot
+
+C++ OLAP API 中的 Snapshot 模版类用于表示抽取出来的静态子图，其中 EdgeData 用来表示该子图上每条边所用权值的数据类型（如果边不需要权值，使用 Empty 作为 EdgeData 即可）。
+
+抽取的子图通过 Snapshot 类的构造函数来描述：
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+其中，db 为数据库句柄，txn 为事务句柄，flags 为生成时使用的选项，可选值包括以下的组合：SNAPSHOT_PARALLEL 表示导出时使用多个线程进行并行；SNAPSHOT_UNDIRECTED 表示需要将导出的图变为无向图。
+vertex_filter 是面向点的用户自定义过滤函数，返回值为 true 表示该点需要被包含到待抽取的子图中，反之则表示需要被排除。
+out_edge_filter 是面向边的用户自定义过滤函数，返回值为 true 表示该边需要被包含到待抽取的子图中，反之则表示需要被排除。
+当过滤函数为缺省值时，则表示需要将所有点/边都包含进来。
+
+Snapshot 类提供的其它方法请参考详细的 C++ API 文档（olap_on_db.h）。
+
+### 2.2. Traversal
+
+图数据库中十分常见的一大类分析是基于一个或多个点出发，逐层地拓展并访问邻居。
+尽管这类分析也可以使用 Cypher 完成，但是当访问的层数较深时，其性能会受到串行解释执行的限制。
+使用 C++ Core API 编写存储过程尽管避免了解释执行，但依然受限于单个线程的处理能力。
+为了让用户能够方便地通过并行处理的方式加速这一类应用场景，我们基于 C++ OLAP API 封装了一个 Traversal 框架，用户可以直接使用其中的 FrontierTraversal 和 PathTraversal 类来完成这种逐层遍历的分析任务，具体的使用方法可以参考相应的 C++ API 文档（lgraph_traversal.h）。
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+该方法可用于找到所有满足条件（filter 返回 true）的点，当 parallel 为 true 时则会并行该查找过程。
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+该方法可用于从指定点集（frontier）中（通过 extract 方法）抽取（类型为 VertexData 的）属性，当 parallel 为 true 时会并行该抽取过程。
+
+FrontierTraversal 适用于只关注遍历扩展到的点集的情况；当用户在遍历过程或是结果中需要访问路径上的信息（路径上的点/边）时，则需要使用 PathTraversal。
+两类 Traversal 的构造函数均有四个参数，分别为数据库句柄 db、事务句柄 txn、选项 flags 和 初始化数组容量 capacity。
+选项的可选值包括以下的组合：TRAVERSAL_PARALLEL 表示遍历时使用多个线程并行；TRAVERSAL_ALLOW_REVISITS 表示遍历时允许重复地访问点（PathTraversal 隐含了该选项）。capacity 表示初始化时路径集合的容量。
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+两类 Traversal 设置遍历的起始点/点集有上述三种方式，前两种通过点 ID 直接指定，最后一种方式则类似于 FindVertices。
+
+两类 Traversal 的遍历都是从当前层的点集合出发，根据使用的扩展函数访问每条出边/入边/出边和入边，通过用户自定义的过滤函数决定扩展是否成功，若成功则将邻居点/追加了该条边的路径加入下一层的点/路径集合。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+上述为 FrontierTraversal 的三种遍历方式，即从当前的点集合出发，对集合中的每个点，依次访问每条出边/入边/出边和入边，若满足用户自定义的过滤条件（其中，edge_filter 为面向边的过滤函数，neighbour_filter 则为面向邻居点的过滤函数），则将邻居点加入新的点集合。
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+当前点集合的扩展结束后，新的点集合可以通过上述方法取得。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+PathTraversal 的三种遍历方式与 FrontierTraversal 类似，只是用户自定义的过滤函数中增加了两个参数，其中：Path 包含了到新扩展的这条边之前的路径，IteratorHelper 可用于将路径中的点/边转为数据库中对应的迭代器，相关文档可参考对应的 C++ API 文档。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.md
new file mode 100644
index 0000000000..94122c1bf2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.md
@@ -0,0 +1,11447 @@
+
+
+             
+  <section id="c">
+
+<div class="toctree-wrapper compound">
+</div>
+<section id="base64-encode">
+<h2>base64_encode<a class="headerlink" href="#base64-encode" title="永久链接至标题"></a></h2>
+<p>Base64 encode and decode. Simple implementation, to be used with BLOB fields. If performance is important, look for an optimized implementation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_api">
+<span id="_CPPv310lgraph_api"></span><span id="_CPPv210lgraph_api"></span><span id="lgraph_api"></span><span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><a class="headerlink" href="#_CPPv410lgraph_api" title="永久链接至目标"></a><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base64E">
+<span id="_CPPv3N10lgraph_api6base64E"></span><span id="_CPPv2N10lgraph_api6base64E"></span><span id="lgraph_api::base64"></span><span class="target" id="namespacelgraph__api_1_1base64"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6base64E" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="lgraph_api::base64::Encode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1a18e9a89247359b1a4abc31183a17f8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to encode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The encoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="lgraph_api::base64::Encode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1c276e294945b5f438b8ea942692e730"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__cCP.s.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac29334d4c57dcc18603ff6ad813e6cb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ret</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string. </p></li>
+<li><p><strong>ret</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__ssCR.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a970296461b9202f8fb91e56590fb160b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">out</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string to decode. </p></li>
+<li><p><strong>out</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="lgraph_api::base64::Decode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac2d795c4f1fcd79f41e3bb8591c03c81"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="lgraph_api::base64::Decode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ab07cfe3bb273d86861a477a435a7686a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph">
+<h2>lgraph<a class="headerlink" href="#lgraph" title="永久链接至标题"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.LGAPI">
+<span class="target" id="lgraph_8h_1ad89ce29b199ac3372f644ffc910a466a"></span><span class="sig-name descname"><span class="n"><span class="pre">LGAPI</span></span></span><a class="headerlink" href="#c.LGAPI" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12GetSignatureE">
+<span id="_CPPv3N10lgraph_api12GetSignatureE"></span><span id="_CPPv2N10lgraph_api12GetSignatureE"></span><span id="lgraph_api::GetSignature"></span><span class="target" id="namespacelgraph__api_1a0e7238ee4b0e28208b594b2bc334b031"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSignature</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7SigSpecE" title="lgraph_api::SigSpec"><span class="n"><span class="pre">SigSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sig_spec</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12GetSignatureE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7ProcessE">
+<span id="_CPPv3N10lgraph_api7ProcessE"></span><span id="_CPPv2N10lgraph_api7ProcessE"></span><span id="lgraph_api::Process"></span><span class="target" id="namespacelgraph__api_1abc0e7fd5062a22bca6290439450eb245"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Process</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7ProcessE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12ProcessInTxnE">
+<span id="_CPPv3N10lgraph_api12ProcessInTxnE"></span><span id="_CPPv2N10lgraph_api12ProcessInTxnE"></span><span id="lgraph_api::ProcessInTxn"></span><span class="target" id="namespacelgraph__api_1afb8681ba4f3cc04bdc96b9b8ccc17775"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessInTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6ResultE" title="lgraph_api::Result"><span class="n"><span class="pre">Result</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12ProcessInTxnE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-atomic">
+<h2>lgraph_atomic<a class="headerlink" href="#lgraph-atomic" title="永久链接至标题"></a></h2>
+<p>Implementation of atomic operations, used in lgraph_traversal. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api3casEbP1T1T1T">
+<span id="_CPPv3I0EN10lgraph_api3casEP1T1T1T"></span><span id="_CPPv2I0EN10lgraph_api3casEP1T1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab1806f690b319d23b933206cd295f745"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cas</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">ptr</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">oldv</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">newv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_minEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_minEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_minEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1acd8330b393c3cb2b46c461119f4aa484"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_min</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_maxEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_maxEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_maxEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a451eee503d74e69ad9fc6db943ee446f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_max</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_addEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_addEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_addEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab5f65d4fa238b2bc6675bba789e5d635"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_add__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a17b724a3f516c98594033b9cbf7e2dd6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_add__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1ae1334e7bca1be121f4a9099ee1499872"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="lgraph_api::write_add__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1ab7aec34df35e5fe40f87f17cd8384759"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="lgraph_api::write_add__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a4688a3165d87b264a0f0e0d747add460"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_subEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_subEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_subEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a34d077b3ffee356fb73bdc35a7cb8819"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_sub__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a3e0a202ef30dd1729c3671b217c7a0b3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_sub__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1aa321f049db89fbc2c821e62ede09b00e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="lgraph_api::write_sub__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1adc6709b36af7ba0701e624044f2cf9d0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="lgraph_api::write_sub__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a15cf35d73dc33e1a0fad97647beaca63"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-date-time">
+<h2>lgraph_date_time<a class="headerlink" href="#lgraph-date-time" title="永久链接至标题"></a></h2>
+<p>Implemnets the DateTime, Date and TimeZone classes. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="lgraph_api::MinDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a7d4a5022a392e2f121804ec89c1f4819"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="lgraph_api::MaxDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a57143a0e3c25aaa249ec45411aeed284"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Maximum days since epoch for date </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MinMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ace6f22166909871827c64134bc108c4f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MaxMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ae9241a416800bd43775b274c3d68b24a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Maximum microseconds since epoch for date time </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api4DateE"></span><span id="lgraph_api::Date"></span><span class="target" id="classlgraph__api_1_1Date"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4DateE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> class. Range of dates is from 0/1/1 to 12/31/9999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateEv">
+<span id="_CPPv3N10lgraph_api4Date4DateEv"></span><span id="_CPPv2N10lgraph_api4Date4DateEv"></span><span id="lgraph_api::Date::Date"></span><span class="target" id="classlgraph__api_1_1Date_1aff49fc2cda4491ff4457ca481bb8edf9"></span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with the date set to 1970/1/1. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::Date::Date__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1Date_1a1d304cb3d2f5bedd0a4585c4a1e6af70"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified time. The time point must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>tp</strong> – Time point to set the date to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay">
+<span id="_CPPv3N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="_CPPv2N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="lgraph_api::Date::Date__YearMonthDayCR"></span><span class="target" id="classlgraph__api_1_1Date_1ac753f0ab0017908da2e04a5601fbbb02"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymd</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified date. The date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>ymd</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateE7int32_t">
+<span id="_CPPv3N10lgraph_api4Date4DateE7int32_t"></span><span id="_CPPv2N10lgraph_api4Date4DateE7int32_t"></span><span id="lgraph_api::Date::Date__int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1afb34a93316bafa170db694675f3ba391"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateE7int32_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to an offset from epoch, i.e. the date is set to the specified number of days from epoch. The result date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days_since_epoch</strong> – Number of days since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="lgraph_api::Date::Date__ssCR"></span><span class="target" id="classlgraph__api_1_1Date_1aa34be0efffbb041680f06e2e51226b64"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from a YYYY-MM-DD string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if the string is not in the correct format.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>str</strong> – The string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv">
+<span id="_CPPv3NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="_CPPv2NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="lgraph_api::Date::GetYearMonthDayC"></span><span class="target" id="classlgraph__api_1_1Date_1ab2d9b29e32b6adb74401c6d85fd5ffb0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYearMonthDay</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The year month day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateplEi">
+<span id="_CPPv3NK10lgraph_api4DateplEi"></span><span id="_CPPv2NK10lgraph_api4DateplEi"></span><span id="lgraph_api::Date::add-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1ad3fe85f66511da6deb3ca8d54edf51bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateplEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a number of days to the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatepLEi">
+<span id="_CPPv3N10lgraph_api4DatepLEi"></span><span id="_CPPv2N10lgraph_api4DatepLEi"></span><span id="lgraph_api::Date::add-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1a3b36b3e6261a05420139a4eba5eea5dd"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatepLEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a number of days to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Reference to the current date. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DatemiEi">
+<span id="_CPPv3NK10lgraph_api4DatemiEi"></span><span id="_CPPv2NK10lgraph_api4DatemiEi"></span><span id="lgraph_api::Date::sub-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1a54622b3edddecff4df3c9f572a7cdcc5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DatemiEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of days from the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatemIEi">
+<span id="_CPPv3N10lgraph_api4DatemIEi"></span><span id="_CPPv2N10lgraph_api4DatemIEi"></span><span id="lgraph_api::Date::sub-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1aaa15a5d3c4427b09ebb8e2bba5de64b5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatemIEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of days from the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Reference to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateltERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateltERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateltERK4Date"></span><span id="lgraph_api::Date::lt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abf811a8c8e2765b24426cc2ff6fe13f9"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateltERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateleERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateleERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateleERK4Date"></span><span id="lgraph_api::Date::lte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1a3c9beee445a203e18d4a9145132f7b2f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateleERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategtERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategtERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategtERK4Date"></span><span id="lgraph_api::Date::gt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1af35d39c86aa4c554db7e553b09708907"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategtERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategeERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategeERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategeERK4Date"></span><span id="lgraph_api::Date::gte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abd180b0c29b2c846b8d58e2b4c9e822a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategeERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateeqERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateeqERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateeqERK4Date"></span><span id="lgraph_api::Date::eq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1ac8e2b0b0dfb86a868f9d602643a58dae"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateeqERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateneERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateneERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateneERK4Date"></span><span id="lgraph_api::Date::neq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1aec998ec2d30eb9705f995cf55907dae4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateneERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="lgraph_api::Date::DaysSinceEpochC"></span><span class="target" id="classlgraph__api_1_1Date_1aba5994b68821ee6127c84c8134823f8a"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DaysSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api4Date10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api4Date10GetStorageEv"></span><span id="lgraph_api::Date::GetStorageC"></span><span class="target" id="classlgraph__api_1_1Date_1ad8100ffff03d1b59ec5eae1e166b7979"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date10GetStorageEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv7int32_tEv">
+<span id="_CPPv3NK10lgraph_api4Datecv7int32_tEv"></span><span id="_CPPv2NK10lgraph_api4Datecv7int32_tEv"></span><span id="lgraph_api::Date::castto-int32_t-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1acdefe8b0c57d12e7de99a1f168a4f60e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv7int32_tEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date9TimePointEv">
+<span id="_CPPv3NK10lgraph_api4Date9TimePointEv"></span><span id="_CPPv2NK10lgraph_api4Date9TimePointEv"></span><span id="lgraph_api::Date::TimePointC"></span><span class="target" id="classlgraph__api_1_1Date_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date9TimePointEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the timepoint corresponding to this date at 00:00 am. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date8ToStringEv">
+<span id="_CPPv3NK10lgraph_api4Date8ToStringEv"></span><span id="_CPPv2NK10lgraph_api4Date8ToStringEv"></span><span id="lgraph_api::Date::ToStringC"></span><span class="target" id="classlgraph__api_1_1Date_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the string representation of the date in the format of YYYY-MM-DD. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv8DateTimeEv">
+<span id="_CPPv3NK10lgraph_api4Datecv8DateTimeEv"></span><span id="_CPPv2NK10lgraph_api4Datecv8DateTimeEv"></span><span id="lgraph_api::Date::castto-DateTime-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1af6857cebc4d28eb784e6bdbac1fe0ba9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv8DateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object corresponding to 00:00 am on this date. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="lgraph_api::Date::Parse__ssCR.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1aad607a219665901350781e377d7b82ee"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="lgraph_api::Date::Parse__cCP.cCP.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1a7c3a61e8da1dbf48e1b7f2b65550d815"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The result.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 10), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date3NowEv">
+<span id="_CPPv3N10lgraph_api4Date3NowEv"></span><span id="_CPPv2N10lgraph_api4Date3NowEv"></span><span id="lgraph_api::Date::Now"></span><span class="target" id="classlgraph__api_1_1Date_1a3e7d4298fa0246f18cb55d621635b2bc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date3NowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date8LocalNowEv">
+<span id="_CPPv3N10lgraph_api4Date8LocalNowEv"></span><span id="_CPPv2N10lgraph_api4Date8LocalNowEv"></span><span id="lgraph_api::Date::LocalNow"></span><span class="target" id="classlgraph__api_1_1Date_1aac31515c859f4e327724992a762ca42f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date8LocalNowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date17days_since_epoch_E">
+<span id="_CPPv3N10lgraph_api4Date17days_since_epoch_E"></span><span id="_CPPv2N10lgraph_api4Date17days_since_epoch_E"></span><span id="lgraph_api::Date::days_since_epoch___int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1ac7f1cae7e807741a698b319ead8869cc"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">days_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date17days_since_epoch_E" title="永久链接至目标"></a><br></dt>
+<dd><p>The days since epoch </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDayE"></span><span id="lgraph_api::Date::YearMonthDay"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YearMonthDay</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Structure representing a date in the format of year, month and day. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay4yearE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="lgraph_api::Date::YearMonthDay::year__i"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay4yearE" title="永久链接至目标"></a><br></dt>
+<dd><p>The year, 0-9999 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay5monthE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="lgraph_api::Date::YearMonthDay::month__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay5monthE" title="永久链接至目标"></a><br></dt>
+<dd><p>Month, 1-12 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay3dayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="lgraph_api::Date::YearMonthDay::day__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay3dayE" title="永久链接至目标"></a><br></dt>
+<dd><p>Day, 1-31 </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api8DateTimeE"></span><span id="lgraph_api::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimeE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> class that holds <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the range of 0000-01-01 00:00:00.000000 to 9999-12-31 23:59:59.999999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeEv">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeEv"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeEv"></span><span id="lgraph_api::DateTime::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime_1a3e93cd7baeb8b4448482a450df21ab20"></span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the epoch time, i.e., 1970-1-1 00:00:00. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::DateTime::DateTime__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1acf8d529b725b6346cad668a4b7d6f5cf"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified timepoint. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>tp</strong> – Timepoint to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="lgraph_api::DateTime::DateTime__YMDHMSFCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a58680ad139b71f8686734b52e6a4d545"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymdhmsf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in <a class="reference internal" href="#structlgraph__api_1_1DateTime_1_1YMDHMSF"><span class="std std-ref">YMDHMSF</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>ymdhmsf</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and time to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="lgraph_api::DateTime::DateTime__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae5e26b24f48dd42cffd98d526bd74aab"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">microseconds_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to specified number of microseconds since epoch. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>microseconds_since_epoch</strong> – Number of microseconds since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="lgraph_api::DateTime::DateTime__ssCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae891fafda07463e06dbee5b88203da54"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in the form of YYYY-MM-DD HH:MM:SS[.FFFFFF]. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if str has invalid format.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>str</strong> – String representation of the date and time in the form of YYYY-MM-DD HH:MM:SS. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="lgraph_api::DateTime::GetYMDHMSFC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5027ca2fdaa6be6b27f7d4acb2bfabf7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYMDHMSF</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the form of year, month, day, hour, minute, second, fraction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The ymdhmsf. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeplE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimeplE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimeplE7int64_t"></span><span id="lgraph_api::DateTime::add-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5da5a7459ddc40a149081b898ea98951"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeplE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a number of microseconds to the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of micorseconds to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimepLE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimepLE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimepLE7int64_t"></span><span id="lgraph_api::DateTime::add-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5bdd35f5b63bc64bb6af19e96fa9e803"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimepLE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a number of microseconds to the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimemiE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimemiE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimemiE7int64_t"></span><span id="lgraph_api::DateTime::sub-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1afcd73eec42253057720a4a0d140e5eee"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimemiE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimemIE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimemIE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimemIE7int64_t"></span><span id="lgraph_api::DateTime::sub-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5a80be41155d8105875e8a3eb51c2c7b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimemIE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeltERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="lgraph_api::DateTime::lt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a16dffc2ee84f6e10fd3271e9b0cb5306"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeltERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeleERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="lgraph_api::DateTime::lte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a40adc1eacbf9ed88ac1cc35dc3d51f30"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeleERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegtERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="lgraph_api::DateTime::gt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae96fabdd15f3dfd300e7d399b12305bc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegtERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegeERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="lgraph_api::DateTime::gte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1adc2ea02a36b0f48b50f6e863facd20e6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegeERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="lgraph_api::DateTime::eq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a30d73527665a6b136070874aeb9b4c2e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeneERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="lgraph_api::DateTime::neq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac9b0839d6be50242b118d69b0ead3e24"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeneERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="lgraph_api::DateTime::MicroSecondsSinceEpochC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7576b1eff7b32d33fef2cfc541c0d7ae"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MicroSecondsSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetStorageEv"></span><span id="lgraph_api::DateTime::GetStorageC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a92a5a81985fd01aa29a8923985ee350a"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetStorageEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv7int64_tEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="lgraph_api::DateTime::castto-int64_t-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a9223b52f5d6412f67b24aaa89c360d7c"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv7int64_tEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime9TimePointEv">
+<span id="_CPPv3NK10lgraph_api8DateTime9TimePointEv"></span><span id="_CPPv2NK10lgraph_api8DateTime9TimePointEv"></span><span id="lgraph_api::DateTime::TimePointC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime9TimePointEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the timepoint correponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime8ToStringEv">
+<span id="_CPPv3NK10lgraph_api8DateTime8ToStringEv"></span><span id="_CPPv2NK10lgraph_api8DateTime8ToStringEv"></span><span id="lgraph_api::DateTime::ToStringC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of the date and time in the form of YYYY-MM-DD HH:MM:SS.[ffffff] </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv4DateEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv4DateEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv4DateEv"></span><span id="lgraph_api::DateTime::castto-Date-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a8049aeab68ea779547e65cd4b2058bd1"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv4DateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv">
+<span id="_CPPv3N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="_CPPv2N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="lgraph_api::DateTime::ConvertToUTC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a56e9bf4e6d3c6e9610e1f572f112d13c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToUTC</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the UTC time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a local time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Object converted to an UTC.</p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv">
+<span id="_CPPv3N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="_CPPv2N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="lgraph_api::DateTime::ConvertToLocal"></span><span class="target" id="classlgraph__api_1_1DateTime_1ad05a5ca52a97c6a3c4e4c62bbcdd0ff9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToLocal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the local time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Object converted to a local.</p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="lgraph_api::DateTime::Parse__ssCR.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a53252357cbc4cfe0040f4b0c31a6ca93"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="lgraph_api::DateTime::Parse__cCP.cCP.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7f3b51df42213d000e5cf8499fc9583f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[inout]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 19 or 26), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime3NowEv">
+<span id="_CPPv3N10lgraph_api8DateTime3NowEv"></span><span id="_CPPv2N10lgraph_api8DateTime3NowEv"></span><span id="lgraph_api::DateTime::Now"></span><span class="target" id="classlgraph__api_1_1DateTime_1afdf6bfab9c1625bea9fe0d88052eb9be"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime3NowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8LocalNowEv">
+<span id="_CPPv3N10lgraph_api8DateTime8LocalNowEv"></span><span id="_CPPv2N10lgraph_api8DateTime8LocalNowEv"></span><span id="lgraph_api::DateTime::LocalNow"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac419c09087e3dfbeb9b13a52cf5ca63b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8LocalNowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E">
+<span id="_CPPv3N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="_CPPv2N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="lgraph_api::DateTime::microseconds_since_epoch___int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a35d4677c58d7dc9be8f6566632ef33ea"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">microseconds_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSFE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSFE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSFE"></span><span id="lgraph_api::DateTime::YMDHMSF"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YMDHMSF</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Representation of a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in year, month, day, hour, minute, second, fraction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="lgraph_api::DateTime::YMDHMSF::year__i"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE" title="永久链接至目标"></a><br></dt>
+<dd><p>The year, 0-9999 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="lgraph_api::DateTime::YMDHMSF::month__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE" title="永久链接至目标"></a><br></dt>
+<dd><p>The month, 1-12 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="lgraph_api::DateTime::YMDHMSF::day__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE" title="永久链接至目标"></a><br></dt>
+<dd><p>The day, 1-31 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="lgraph_api::DateTime::YMDHMSF::hour__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a7f39b6fc12f0b04a38625ff3040dd30c"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">hour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE" title="永久链接至目标"></a><br></dt>
+<dd><p>The hour, 0-23 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="lgraph_api::DateTime::YMDHMSF::minute__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a408e3d60d59afc5b5a6f35ac9f5c8fbb"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">minute</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE" title="永久链接至目标"></a><br></dt>
+<dd><p>The minute, 0-59 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="lgraph_api::DateTime::YMDHMSF::second__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1af7633c5cbb76481bafd5e3e1ec07ca37"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">second</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE" title="永久链接至目标"></a><br></dt>
+<dd><p>The second, 0-59 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="lgraph_api::DateTime::YMDHMSF::fraction__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a4a3d5aea78d5e1e01c7be45e6990456f"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fraction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE" title="永久链接至目标"></a><br></dt>
+<dd><p>The fraction 000000-999999 </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZoneE">
+<span id="_CPPv3N10lgraph_api8TimeZoneE"></span><span id="_CPPv2N10lgraph_api8TimeZoneE"></span><span id="lgraph_api::TimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZoneE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>A class that represents a time zone. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone8TimeZoneEi">
+<span id="_CPPv3N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="_CPPv2N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="lgraph_api::TimeZone::TimeZone__i"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a4cbdd9521cf61ed9457984aeff9c4e13"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">time_diff_hours</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone8TimeZoneEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Create a timezone which has time difference with UTC in hours time_diff_hours. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidParameter</span></span></span> – Thrown if time_diff_hours is invalid.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>time_diff_hours</strong> – (Optional) Difference between local timezone and UTC. Must be &gt; =-10 &amp;&amp; &lt;=14. Otherwise the function will throw. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::FromUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae70105315a4e43ef16dcc94d07a69769"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FromUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from UTC time to this time zone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC time.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::ToUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1aa0d29ab9305bb5efa5bd1cdc48647086"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from this timezone to UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="lgraph_api::TimeZone::UTCDiffSecondsC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a9aaed281da56442099de67e51fe47638"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffSeconds</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns diff from UTC in seconds, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a></p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of seconds local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="lgraph_api::TimeZone::UTCDiffHoursC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a56914c89b37c60dcfc9db708d3a89446"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffHours</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns diff from UTC in hours, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a></p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of hours local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::LocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A const reference to local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::UpdateLocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae9cf01b0a4d1e6cfc21306569d8260f0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpdateLocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Update local timezone, used only when daylight saving time changes. Daylight saving time may change after LocalTZ was initialized, in which case we need to update it. This function will update all references returned by <a class="reference internal" href="#classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"><span class="std std-ref">LocalTimeZone()</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E">
+<span id="_CPPv3N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="_CPPv2N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="lgraph_api::TimeZone::time_diff_microseconds___int64_t"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a32810c21702584e4d3090242818cbb06"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">time_diff_microseconds_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="lgraph_api::TimeZone::GetLocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a27c488e750c5dc4247d99d4db241b0bf"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone7LocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone7LocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone7LocalTZEv"></span><span id="lgraph_api::TimeZone::LocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a8aa7218fc3680021035c689a23159760"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone7LocalTZEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-db">
+<h2>lgraph_db<a class="headerlink" href="#lgraph-db" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46lgraph">
+<span id="_CPPv36lgraph"></span><span id="_CPPv26lgraph"></span><span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><a class="headerlink" href="#_CPPv46lgraph" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskEv"></span><span id="lgraph_api::ShouldKillThisTask"></span><span class="target" id="namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Determine if we should kill current task. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if a KillTask command was issued for this task, either due to user request or timeout. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16GetThreadContextEv">
+<span id="_CPPv3N10lgraph_api16GetThreadContextEv"></span><span id="_CPPv2N10lgraph_api16GetThreadContextEv"></span><span id="lgraph_api::GetThreadContext"></span><span class="target" id="namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"></span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetThreadContext</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api16GetThreadContextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets thread context pointer, which can then be used in ShouldKillThisTask(ctx). Calling <a class="reference internal" href="#namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"><span class="std std-ref">ShouldKillThisTask()</span></a> is equivalent to ShouldKillThisTask(GetThreadContext()). In order to save the cost of <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>, you can store the context and use it in ShouldKillThisTask(ctx). </p>
+<p>Example: ```c++ ThreadContextPtr ctx = <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>; while (HasMoreWorkToDo()) { if (ShouldKillThisTask(ctx)) { break; } DoWork(); } ```</p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The thread context. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="lgraph_api::ShouldKillThisTask__ThreadContextPtr"></span><span class="target" id="namespacelgraph__api_1a842a962cb406dd251be8aeb492510b6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ctx</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr" title="永久链接至目标"></a><br></dt>
+<dd><p>Determine if we should kill the task currently running in the thread identified by ctx. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>ctx</strong> – The context, as obtained with GetThreadContext.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if a KillTask command was issued for this task. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1a340bf8a3bf351920b9c20fe861372bcf"></span><span class="sig-name descname"><span class="pre">const</span> <span class="pre">typedef</span> <span class="pre">void</span> <span class="pre">*</span> <span class="pre">ThreadContextPtr</span></span></dt>
+<dd><p>Defines an alias representing the thread context pointer </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBE">
+<span id="_CPPv3N10lgraph_api7GraphDBE"></span><span id="_CPPv2N10lgraph_api7GraphDBE"></span><span id="lgraph_api::GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_db.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> represents a graph instance. In TuGraph, each graph instance has its own schema and access control settings. Accessing a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> without appropriate access rights yields WriteNotAllowed. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> becomes invalid if <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a> is called, in which case all transactions and iterators associated with that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> become invalid. Further operation on that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> yields InvalidGraphDB. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="lgraph_api::GraphDB::GraphDB__lgraph::AccessControlledDBP.b.b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8ed8306aab2d4ea17475888d25737f69"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db_with_access_control</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">owns_db</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb" title="永久链接至目标"></a><br></dt>
+<dd><p>For internal use only. Users should use <a class="reference internal" href="#classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"><span class="std std-ref">Galaxy::OpenGraph()</span></a> to get <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5884af0fb5900e58a13e6cf2c64e9061"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a43a244ebb2089430b84e50667e89d015"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBD0Ev">
+<span id="_CPPv3N10lgraph_api7GraphDBD0Ev"></span><span id="_CPPv2N10lgraph_api7GraphDBD0Ev"></span><span id="lgraph_api::GraphDB::~GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad0d3a9bb78624594d45104c0ec3566d2"></span><span class="sig-name descname"><span class="n"><span class="pre">~GraphDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5CloseEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5CloseEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5CloseEv"></span><span id="lgraph_api::GraphDB::Close"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Close the graph. This will close the graph and release all transactions, iterators associated with the graph. After calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a>, the graph becomes invalid, and cannot be used anymore. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="lgraph_api::GraphDB::CreateReadTxn"></span><span class="target" id="classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateReadTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Creates a read transaction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The new read transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb">
+<span id="_CPPv3N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="_CPPv2N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="lgraph_api::GraphDB::CreateWriteTxn__b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateWriteTxn</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">optimistic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Creates a write transaction. Write operations can only be performed in write transactions, otherwise exceptions will be thrown. A write transaction can be optimistic. Optimistic transactions can run in parallel and any conflict will be detected during commit. If a transaction conflicts with an ealier one, a TxnConflict will be thrown during commit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>optimistic</strong> – (Optional) True to create an optimistic transaction.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The new write transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction">
+<span id="_CPPv3N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="_CPPv2N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="lgraph_api::GraphDB::ForkTxn__TransactionR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForkTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction" title="永久链接至目标"></a><br></dt>
+<dd><p>Forks a read transaction. The resulting read transaction will share the same view as the forked one, meaning that when reads are performed on the same vertex/edge, the results will always be identical, whether they are performed in the original transaction or the forked one. Only read transactions can be forked. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"><span class="std std-ref">ForkTxn()</span></a> on a write txn causes an InvalidFork to be thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidFork</span></span></span> – Thrown when txn is a write transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>txn</strong> – <strong>[in]</strong> The read transaction to be forked.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A new read <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> that shares the same view with txn. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5FlushEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5FlushEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5FlushEv"></span><span id="lgraph_api::GraphDB::Flush"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Flush</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5FlushEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Flushes buffered data to disk. If there have been some async transactions, there could be data that are written to this graph, but not persisted to disk yet. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"><span class="std std-ref">Flush()</span></a> will persist the data and prevent data loss in case of system crash. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB11DropAllDataEv">
+<span id="_CPPv3N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="_CPPv2N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="lgraph_api::GraphDB::DropAllData"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a784e2f7141aaed6b547faaaf52e87880"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB11DropAllDataEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Drop all the data in the graph, including labels, indexes and vertexes/edges.. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="lgraph_api::GraphDB::DropAllVertex"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad51e4783ef7de143949c05311a0f2b54"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Drop all vertex and edges but keep the labels and indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="lgraph_api::GraphDB::EstimateNumVertices"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8434ac9ad087a3f57b96f6c8bed664d6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EstimateNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Estimate number of vertices. We don’t maintain the exact number of vertices, but only the next vid. This function actually returns the next vid to be used. So if you have deleted a lot of vertices, the result can be quite different from actual number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Estimated number of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="lgraph_api::GraphDB::AddVertexLabel__ssCR.std::vector:FieldSpec:CR.VertexOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0c0f79500ca028b8342cc6af9b363c83"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="lgraph_api::VertexOptions"><span class="n"><span class="pre">VertexOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the schema is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>primary_field</strong> – The primary field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteVertexLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6d74b689bd295b71c8857f26b77cb4a2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes a vertex label and all the vertices with this label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a15a25572790ab89a16815409cbc5a869"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes fields in a vertex label. This function also updates the vertex data and indices accordingly to make sure the database remains in consistent state. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or some fields cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – Labels of the fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1abdca8d18155cbb711386a18d8f206c66"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fields to a vertex label. The new fields in existing vertices will be filled with default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field already exists.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The add fields. </p></li>
+<li><p><strong>default_values</strong> – The default values of the newly added fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3becea45eab0d50d4c09232b211944d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify fields in a vertex label, either chage the data type or optional, or both. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The new specification of the modified fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="lgraph_api::GraphDB::AddEdgeLabel__ssCR.std::vector:FieldSpec:CR.EdgeOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3c5434fc9c650a6f09465c32db1b16d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a edge label, specifying its schema. It is allowed to specify edge constrains, too. An edge can be bound to several (source_label, destination_label) pairs, which makes sure this type of edges will only be added between these types of vertices. By default, the constain is empty, meaning that the edge is not restricted. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if invalid schema (invalid specification, re- definition of the same field, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>temporal_field</strong> – The temporal field for tid. </p></li>
+<li><p><strong>edge_constraints</strong> – (Optional) The edge constraints. An empty constrain means no restriction.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteEdgeLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0bf6aee53c6c7412806a6a1dcdcd6377"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes an edge label and all the edges of this type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="lgraph_api::GraphDB::AlterLabelModEdgeConstraints__ssCR.std::vector:std::pair:ss.ss::CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7ab2ca321e3bd68c1a9f33aeaa3bd747"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterLabelModEdgeConstraints</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify edge constraint. Existing edges that violate the new constrain will be removed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any vertex label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>constraints</strong> – The new edge constraint.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a08241fee881005b37982621a31fb5e00"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes fields in an edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – The fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of edges modified.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab43144d999e3f539a42c5aa6a4ec21c0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fields to an edge label. The new fields in existing edges will be set to default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field already exists, or the default value is of incompatible type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The fields to add. </p></li>
+<li><p><strong>default_values</strong> – The default values. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aae83cf6042c04347d6cc6147289bced0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify fields in an edge label. Data type and OPTIONAL can be modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The modifier fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddVertexIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4e0da14c082f2be3f4d29ef888daad64"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field</strong> – The field name. </p></li>
+<li><p><strong>is_unique</strong> – True if is unique index, false if not.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddEdgeIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aa33f376759b00da1070c16167f8650bf"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>is_unique</strong> – True if the field content is unique for each vertex.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Check if this vertex_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Check if this edge_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5dd0b2831686ab10c9cf641b1f5a04c8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the index to ‘vertex_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0b04c7d95efa608199ffd43074698a26"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the index to ‘edge_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="lgraph_api::GraphDB::GetDescriptionC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a10eafac774946c9fda6acd8368e6b254"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDescription</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get graph description </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The description. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="lgraph_api::GraphDB::GetMaxSizeC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3cd10a9d8a077a9b838fecc8d894550c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetMaxSize</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get maximum graph size </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The maximum size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a1f9045086aaa5274c657b8020ed8d314"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fulltext index to ‘vertex_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad67d845d1e7c6d3a230ebca0eac15138"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fulltext index to ‘edge_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2d13791623a99511d3d743e811097b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘vertex_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab7e3ee69c450474f77d621b7310b1621"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘edge_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="lgraph_api::GraphDB::RebuildFullTextIndex__std::set:ss:CR.std::set:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6902d07efdba3ff5c2be81311534e752"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RebuildFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_labels</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_labels</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Rebuild the fulltext index of <code class="docutils literal notranslate"><span class="pre">vertex_labels</span></code> and <code class="docutils literal notranslate"><span class="pre">edge_labels</span></code>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_labels</strong> – The vertex labels whose fulltext index need to rebuild. </p></li>
+<li><p><strong>edge_labels</strong> – The edge labels whose fulltext index need to rebuild. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="lgraph_api::GraphDB::ListFullTextIndexes"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ae2b1b58ffc70106433bee030842e3e27"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListFullTextIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List fulltext indexes of vertex and edge </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Format of returned data : (is_vertex, label_name, property_name) </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryVertexByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a696a8bc40c23002921ccd4983b1e2550"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryVertexByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Query vertex by fulltext index. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The vertex label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Vertex vids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryEdgeByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4f09813ea8812322180569bd2b48fe05"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryEdgeByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Query edge by fulltext index </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The edge label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Edge uids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12RefreshCountEv">
+<span id="_CPPv3N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="_CPPv2N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="lgraph_api::GraphDB::RefreshCount"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ade8d799b8354403e99298d493a3509f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshCount</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12RefreshCountEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Recount the total number of vertex and edge, stop writing during the count </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3ea21ec359220a8c4e0ea72adb0c1ba0"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd><p>Copying is disabled. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3bc8ff8539363d5511d9a6936bae7899"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB3db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB3db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB3db_E"></span><span id="lgraph_api::GraphDB::db___lgraph::AccessControlledDBP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a35f581fb0d14734506768c1a61296979"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17should_delete_db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="lgraph_api::GraphDB::should_delete_db___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac2e6f7ca5ee0fc92e2579a7de9303eac"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">should_delete_db_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17should_delete_db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB10read_only_E">
+<span id="_CPPv3N10lgraph_api7GraphDB10read_only_E"></span><span id="_CPPv2N10lgraph_api7GraphDB10read_only_E"></span><span id="lgraph_api::GraphDB::read_only___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac22ad4698a78f7e4ab74ec4450647125"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">read_only_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB10read_only_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-index-iterator">
+<h2>lgraph_edge_index_iterator<a class="headerlink" href="#lgraph-edge-index-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorE"></span><span id="lgraph_api::EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> can be used to access a set of edges that has the same indexed value. If the index is unique (that is, each Edge has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> will only have one edge unique id, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> is valid iff it points to a valid (index_value, euid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ae51a6e1b90b7343b4012be9cc7ae3daa"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a584635e9e5d92688527dbae26f926f80"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="lgraph_api::EdgeIndexIterator::~EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aa1bb455fd404e4102a0e6b637283db00"></span><span class="sig-name descname"><span class="n"><span class="pre">~EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="lgraph_api::EdgeIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="lgraph_api::EdgeIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="lgraph_api::EdgeIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next edge unique id in the list, which consists of all the valid edge unique ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::EdgeIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the current index value. The euids are sorted in ( EdgeIndexValue, euid) order. When <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one euid to next, possibly moving from one EdgeIndexValue to another. This function tells the EdgeIndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="lgraph_api::EdgeIndexIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the Edge Unique Id </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="lgraph_api::EdgeIndexIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="lgraph_api::EdgeIndexIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__lgraph::EdgeIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a2266e13c0886456df166e683e4a04cc5"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1acd1c7e3f9d88fcc2a2fa0dbdbb5b2bf8"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1abda22c9f1d7924e06efe4e12a1986292"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="lgraph_api::EdgeIndexIterator::it___std::unique_ptr:lgraph::EdgeIndexIterator:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a8c447e8d8d6d5ae41372b160dec982b1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="lgraph_api::EdgeIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-iterator">
+<h2>lgraph_edge_iterator<a class="headerlink" href="#lgraph-edge-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph5graphE">
+<span id="_CPPv3N6lgraph5graphE"></span><span id="_CPPv2N6lgraph5graphE"></span><span id="lgraph::graph"></span><span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph5graphE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aa64cc73da05613af93f74fbba0e40685"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a92a989ca7aa12f6bf9312acca6a24b9d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aae356ade132bced19db97d69e2693926"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1ad917857534c392eb3de3718007839e87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1acae8199afd0a5a7026d057a2ede19e29"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a623f694634f9b740f6e8432ad5e8fed7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a145cb4680fe351655b20bcefbf1d10c6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a46e696695da45853cbeb5905719210fa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> can be used to iterate through the in-coming edges of a vertex. Edges are sorted in (lid, tid, src, eid) order, and each (dst, lid, tid, src, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> is valid iff it points to a valid in-coming edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a73ca326056d2877cea6b09a683b8c0ba"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a20741057cf223945a84f2ebe4cb73b2f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="lgraph_api::InEdgeIterator::~InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a299e60d91351d2ceb0da9445d3d53ab9"></span><span class="sig-name descname"><span class="n"><span class="pre">~InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="lgraph_api::InEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4NextEv"></span><span id="lgraph_api::InEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next incoming edge to current destination vertex. If there is no more edge, the iterator becomes invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::InEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Go to the edge specified by euid. If the specified edge cannot be found and nearest==true, then try to get the next in-coming edge to the vertex euid.dst, sorted by (label, tid, src, eid). If there is no such edge, iterator is invalidated and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="lgraph_api::InEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the Edge Unique Id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="lgraph_api::InEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="lgraph_api::InEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets destination vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::InEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::InEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets temporal id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The temporal id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="lgraph_api::InEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::InEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field_name </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::InEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>All field names and values stored as a {(field_name, field_value),…} map. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="lgraph_api::InEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next incoming edge sorted by (lid, tid, src, eid) if there is any. If no in-coming edge is left for this vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="lgraph_api::InEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__lgraph::graph::InEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a92769487b9004274f36dccbc5b26dc1d"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aaf872d62e0bcd4680527d2c086433151"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5110071efc6781255ae9ce68e3634205"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator3it_E"></span><span id="lgraph_api::InEdgeIterator::it___std::unique_ptr:lgraph::graph::InEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a17c31f91df04ddbd378b1d23c6c18568"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4txn_E"></span><span id="lgraph_api::InEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> can be used to iterate through the out-going edges of a vertex. Edges are sorted in (lid, dst, eid) order, and each (src, lid, tid, dst, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> is valid iff it points to a valid out-going edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1abab68117b55783f6c38a899396f169a3"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a088017d735536fa934b5fb2cba592e43"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="lgraph_api::OutEdgeIterator::~OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa0e08e47018ad64858af8310913383b1"></span><span class="sig-name descname"><span class="n"><span class="pre">~OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="lgraph_api::OutEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::OutEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Go to the edge specified by euid. That is, an edge from Vertex euid.src to euid.dst, with LabelId==euid.label, Tid==euid.tid, and EdgeId==euid.eid. If neareast==true and the exact edge was not found, the iterator tries to get the next edge that sorts after the specified edge. The edges are sorted in (label, tid, dst, eid) order. The iterator becomes invalid if there is no outgoing edge from euid.src that sorts after euid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique ID. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if there is no such edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="lgraph_api::OutEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="lgraph_api::OutEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next edge. Invalidates iterator if there is no more out edges from current source vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails (no more out edge from current source). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="lgraph_api::OutEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the Edge Unique Id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="lgraph_api::OutEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets primary id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The primary id of the edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="lgraph_api::OutEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::OutEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – The name of the field to get.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field id. FieldId can be obtained with txn.GetEdgeFieldId() </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>fid</strong> – fid The field id.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::OutEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>All fields in a dictionary of {(field_name, field_value),…}. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value in string representation. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="lgraph_api::OutEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next out-going edge sorted by (label, tid, dst, eid) if there is any. If there is no more out-going edges for this source vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="lgraph_api::OutEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A std::string that represents this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__lgraph::graph::OutEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aec68967791b2a1c92ff94c646853c14a"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ab98d1e207b5ecce1a7dcea1478577558"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a65896ed24e13cd2af266a344a655419c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator3it_E"></span><span id="lgraph_api::OutEdgeIterator::it___std::unique_ptr:lgraph::graph::OutEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa9051f34e34c3c714096054e271c72a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="lgraph_api::OutEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-exceptions">
+<h2>lgraph_exceptions<a class="headerlink" href="#lgraph-exceptions" title="永久链接至标题"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.ERROR_CODES">
+<span class="target" id="lgraph__exceptions_8h_1a202796cec2c73e6a15b8ae40423102d2"></span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#c.ERROR_CODES" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.X">
+<span class="target" id="lgraph__exceptions_8h_1a1f09736ce2d0b353925675b9c17f9b58"></span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="n"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.X" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THROW_CODE">
+<span class="target" id="lgraph__exceptions_8h_1a0a6acbf1c6c9172f6be1c808cfa03f10"></span><span class="sig-name descname"><span class="n"><span class="pre">THROW_CODE</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="p"><span class="pre">...</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.THROW_CODE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCodeE">
+<span id="_CPPv3N10lgraph_api9ErrorCodeE"></span><span id="_CPPv2N10lgraph_api9ErrorCodeE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05f"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCode</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode1XE">
+<span id="_CPPv3N10lgraph_api9ErrorCode1XE"></span><span id="_CPPv2N10lgraph_api9ErrorCode1XE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa13397c15c68eb3e5e33a0196e8988a24"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode1XE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE">
+<span id="_CPPv3N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span id="_CPPv2N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa0afdd4a4fb13896180b64bd313a17dc2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode">
+<span id="_CPPv3N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="_CPPv2N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="lgraph_api::ErrorCodeToString__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a13525881a01e59b5a69b74c47d95dcd3"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeToString</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode">
+<span id="_CPPv3N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="_CPPv2N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="lgraph_api::ErrorCodeDesc__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a82ab07d2676a279295157e65beeedcbc"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeDesc</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphExceptionE">
+<span id="_CPPv3N10lgraph_api15LgraphExceptionE"></span><span id="_CPPv2N10lgraph_api15LgraphExceptionE"></span><span id="lgraph_api::LgraphException"></span><span class="target" id="classlgraph__api_1_1LgraphException"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><span class="n"><span class="pre">exception</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphExceptionE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_exceptions.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aa1104fdb0328ecad056440c0498affa5"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.ssCR"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af986a8520040b3af5568e7f4f2b3d813"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.cCP"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af81b58e697be8127dd1310a7297a886b"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts">
+<span id="_CPPv3IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span id="_CPPv2IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="p"><span class="pre">...</span></span><span class="sig-name descname"><span class="n"><span class="pre">Ts</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1LgraphException_1a8cc576c0c99e4c712a0fc91ca67868fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">format</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="lgraph_api::LgraphException::LgraphException::Ts"><span class="n"><span class="pre">Ts</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">...</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4codeEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4codeEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4codeEv"></span><span id="lgraph_api::LgraphException::codeC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a833a074d2f56630e12d5c66e6ebb5862"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4codeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException3msgEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException3msgEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException3msgEv"></span><span id="lgraph_api::LgraphException::msgC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1e6c05d855e126b4ecfaa8241f8cca33"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">msg</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException3msgEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4whatEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4whatEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4whatEv"></span><span id="lgraph_api::LgraphException::whatC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aac1c33909e01e1dfc85617cf2477d3eb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">what</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><span class="w"> </span><span class="k"><span class="pre">override</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4whatEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5code_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5code_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5code_E"></span><span id="lgraph_api::LgraphException::code___ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1ac8cce82dda9537fdb72dac589a6ac5f2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5code_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException4msg_E">
+<span id="_CPPv3N10lgraph_api15LgraphException4msg_E"></span><span id="_CPPv2N10lgraph_api15LgraphException4msg_E"></span><span id="lgraph_api::LgraphException::msg___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1da24fcb3b81cddc8a32815f13997437"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">msg_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException4msg_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5what_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5what_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5what_E"></span><span id="lgraph_api::LgraphException::what___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a415baaef606c6f5e5e1104719a84dc72"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">what_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5what_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-galaxy">
+<h2>lgraph_galaxy<a class="headerlink" href="#lgraph-galaxy" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyE">
+<span id="_CPPv3N10lgraph_api6GalaxyE"></span><span id="_CPPv2N10lgraph_api6GalaxyE"></span><span id="lgraph_api::Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_galaxy.h&gt;</em></div>
+<p>A galaxy is the storage engine for one TuGraph instance. It manages a set of User/Role/GraphDBs. </p>
+<p>A galaxy can be opened in async mode, in which case <em>ALL</em> write transactions will be treated as async, whether they declare async or not. This can come in handy if we are performing a lot of writing, but can cause data loss for online processing. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aff4d727c87112ab1ae56882ed7c90ae8"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The TuGraph dir. </p></li>
+<li><p><strong>durable</strong> – (Optional) True to open in durable mode. If set to false, ALL write transactions are async, whether they declare async or not. </p></li>
+<li><p><strong>create_if_not_exist</strong> – (Optional) If true, the TuGraph DB will be created if dir does not exist; otherwise, an exception is thrown. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.ssCR.ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac04eaf83ff6ed47d4e77bbcb06b432f5"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor. Open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> and try to login with specified user and password. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is not correct.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The dir. </p></li>
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>durable</strong> – True to open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> in durable mode. </p></li>
+<li><p><strong>create_if_not_exist</strong> – True to create if DB does not exist. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a57bcd86daa9d4cdbfb367a0e43d8b039"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aead55554e77f85378cd82ece56cfde96"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyD0Ev">
+<span id="_CPPv3N10lgraph_api6GalaxyD0Ev"></span><span id="_CPPv2N10lgraph_api6GalaxyD0Ev"></span><span id="lgraph_api::Galaxy::~Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a00577f1737a890a15dbd7b409a2f1cd8"></span><span class="sig-name descname"><span class="n"><span class="pre">~Galaxy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetCurrentUser__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac428a8a912bf43cf72c9a908ef6c7c15"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetCurrentUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Validate and set current user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a568523d4c1b5a1cde2fafa5fd2d702f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set current user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if token is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The current user. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="lgraph_api::Galaxy::CreateGraph__ssCR.ssCR.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a480909a8d20e7b8a904030fc5be34da0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">description</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">max_size</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="m"><span class="pre">1</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">40</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Validate token and set current user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to create graph. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Other input errors such as invalid graph name, size, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph to create. description (Optional) Description of the graph. max_size (Optional) Maximum size of the graph.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if graph already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteGraph__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1f0d94b15f7b718f6aa4f1dc01656f0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Delete a graph </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to delete graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the graph does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="lgraph_api::Galaxy::ModGraph__ssCR.b.ssCR.b.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4d8cdf497e81b2b9d1fc95f980319a0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ModGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_size</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">new_max_size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify graph info </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to modify graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph_name</strong> – Name of the graph. </p></li>
+<li><p><strong>mod_desc</strong> – True to modifier description. </p></li>
+<li><p><strong>desc</strong> – The new description. </p></li>
+<li><p><strong>mod_size</strong> – True to modifier size. </p></li>
+<li><p><strong>new_max_size</strong> – New maximum size.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="lgraph_api::Galaxy::ListGraphsC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a4c64be90601e4a55971798b4272ebf"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListGraphs</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List graphs </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to list graphs.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A dictionary of {graph_name: (description, max_size)} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateUser__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a97e43d10d6b95de4d68ca3c7919bcacb"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Creates a user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if other input errors, such as illegal user name, password, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>desc</strong> – (Optional) The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab111a438ea5f846881da6c03d3e34115"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetPassword__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a29f197aed82ca28992c87b797b5e4186"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetPassword</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">old_password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">new_password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the password of the specified user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission, or curr_user==user, but old_password is incorrect. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if new_password is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user to modify. </p></li>
+<li><p><strong>old_password</strong> – The old password, required if curr_user==user. </p></li>
+<li><p><strong>new_password</strong> – The new password.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUserDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aca1ba2352c5365a0e82f522d79b51219"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets user description. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>desc</strong> – The new description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Galaxy::SetUserRoles__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a0c5796bfe855125cf1b3675c4a3b87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserRoles</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">roles</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the roles of the specified user. If you need to add or delete a role, you will need to use GetUserInfo to get the roles first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any role does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>roles</strong> – A list of roles.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="lgraph_api::Galaxy::SetUserGraphAccess__ssCR.ssCR.AccessLevelCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3f0fcfae10bf1776e39ecc3205fc6c85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserGraphAccess</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets user access rights on a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>access</strong> – The access level.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a0edfd7185553ceb6c81f303acdbf163c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Disable a user. A disabled user is not able to login or perform any operation. A user cannot disable itself. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user to disable.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1af07907500b4d6142b9416e74df4557a4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Enables the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListUsersEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="lgraph_api::Galaxy::ListUsersC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a55e8c41afb9c217b63872b76b1486691"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListUsers</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListUsersEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List all users </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A dictionary of {user_name:user_info} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetUserInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab5010716ab86c5f6650672ce885c4bd9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUserInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets user information </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The user information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateRole__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a550aaacf7d2580baf77c3eb7706cafd7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Create a role. A role has different access levels to different graphs. Every user must be assigned some role to get access to graphs. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1add07dbe39e13e5c47e82c4b621963d7f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the role described by role </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6007103b069eebe456d17e6035c763ce"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Disable a role. A disabled role still has the data, but is not effective. i.e., users will not have access rights to graphs that are obtained by having this role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a88b1cf70763b8f517a8a67fd70f45ba6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Enables the role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetRoleDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a09988e113e9709e0ae2d8a9ae55bfd97"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the description of the specified role </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRights__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7da90a98fb519cf1557c82f9780bf2aa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRights</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set access of the role to graphs. If you need to add or remove access to part of the graphs, you need to get full graph_access map by using GetRoleInfo first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRightsIncremental__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3ad7fb60a0413742007dceff71f34f9b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRightsIncremental</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Incrementally modify the access right of the specified role. For example, for a role that has access right {graph1:READ, graph2:WRITE}, calling this function with graph_access={graph2:READ, graph3:FULL} will set the access right of this role to {graph1:READ, graph2:READ, graph3:FULL} </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetRoleInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3d2426344ffa4ccd2c3d99af236bbc83"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetRoleInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets role information </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The role information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListRolesEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="lgraph_api::Galaxy::ListRolesC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ae420054434acdb37d8d242926c2eece7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListRoles</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListRolesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List all the roles </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A dictionary of {role_name:<a class="reference internal" href="#structlgraph__api_1_1RoleInfo"><span class="std std-ref">RoleInfo</span></a>} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetAccessLevel__ssCR.ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a9b5d700cf67ddcd6dc08a73271034c66"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAccessLevel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the access level that the specified user have to the graph </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name or graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The access level. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb">
+<span id="_CPPv3NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="_CPPv2NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="lgraph_api::Galaxy::OpenGraph__ssCR.bC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OpenGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Opens a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>read_only</strong> – (Optional) True to open in read-only mode. A read-only <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> cannot be written to.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5CloseEv">
+<span id="_CPPv3N10lgraph_api6Galaxy5CloseEv"></span><span id="_CPPv2N10lgraph_api6Galaxy5CloseEv"></span><span id="lgraph_api::Galaxy::Close"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a>, turning it into an invalid state. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="lgraph_api::Galaxy::Galaxy__lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a18b1851884f7ba7148f9488f0669212a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aa5da67d606e1c4a26b0733a2f0082f1a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4ea0661db673b9f0f9e2d4fd01cfa2a3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5user_E">
+<span id="_CPPv3N10lgraph_api6Galaxy5user_E"></span><span id="_CPPv2N10lgraph_api6Galaxy5user_E"></span><span id="lgraph_api::Galaxy::user___ss"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a17442452651ea1479fa7d0e652f90810"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5user_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy3db_E">
+<span id="_CPPv3N10lgraph_api6Galaxy3db_E"></span><span id="_CPPv2N10lgraph_api6Galaxy3db_E"></span><span id="lgraph_api::Galaxy::db___lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1d7badecbe92fb1d1d48f412eb80beef"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-result">
+<h2>lgraph_result<a class="headerlink" href="#lgraph-result" title="永久链接至标题"></a></h2>
+<p>Result interface for plugins and built-in procedures. The result of a plugin should be provided in this format in order for the Cypher engine and the graph visualizer to understand. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46cypher">
+<span id="_CPPv36cypher"></span><span id="_CPPv26cypher"></span><span id="cypher"></span><span class="target" id="namespacecypher"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher</span></span></span><a class="headerlink" href="#_CPPv46cypher" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordE">
+<span id="_CPPv3N10lgraph_api6RecordE"></span><span id="_CPPv2N10lgraph_api6RecordE"></span><span id="lgraph_api::Record"></span><span class="target" id="classlgraph__api_1_1Record"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p>You only initialize the class by <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> instance. <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a> provide some insert method to insert data to the record. eg. Insert, InsertVertexByID, InsertEdgeByID. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERK6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERK6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERK6Record"></span><span id="lgraph_api::Record::Record__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1ac650ba988b5c162c621cabf07c18d497"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERR6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERR6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERR6Record"></span><span id="lgraph_api::Record::Record__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1adb1c42c8dbe94932471cc2fa3b1de7a6"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERK6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERK6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERK6Record"></span><span id="lgraph_api::Record::assign-operator__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1a820a033a9bfbbf0a1a0cff6ae779c715"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERK6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERR6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERR6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERR6Record"></span><span id="lgraph_api::Record::assign-operator__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1ab8d2b9aec7327774226f29c455791dad"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERR6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Record::Insert__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Record_1a38f91b3aee5d1880237939f77fd5c2fb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>fv</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.int64_tC.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a171dbf3555be4830b723f1963518c8d2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertVertexByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId </p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.EdgeUidR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a0947956a5583ac30f6437ccba45e6dbc"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertEdgeByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>euid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t">
+<span id="_CPPv3N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="_CPPv2N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="lgraph_api::Record::InsertVertexByID__ssCR.int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a0445d0d62a48711ddef6e9988bd0fa09"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertVertexByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid">
+<span id="_CPPv3N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="_CPPv2N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="lgraph_api::Record::InsertEdgeByID__ssCR.EdgeUidCR"></span><span class="target" id="classlgraph__api_1_1Record_1abede73c241382ea0e55f76b90e3a7f42"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertEdgeByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">uid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>uid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1af585894e04343f4c80843dcdebdbef9d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>vit</strong> – <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1a1f507fb00296a8e04f98a391ec597ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ieit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>ieit</strong> – <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1aa5d88aae93b2cf484beb632d88420adf"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">oeit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>oeit</strong> – <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a59b5dffacde269b5df6612c00771b9a1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">list</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>list</strong> – LIST OF <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::map:ss.FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a7d99978348600b14abe0049be705b625"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">map</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>map</strong> – MAP OF &lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.traversal::PathCR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a527ac8a8e078306bcda8963a22813afb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversalE" title="lgraph_api::traversal"><span class="n"><span class="pre">traversal</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">path</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert value into result table. You can insert a value by the function, and value must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>path</strong> – Path of traverse api. </p></li>
+<li><p><strong>txn</strong> – Trasaction </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Record4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Record4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Record4SizeEv"></span><span id="lgraph_api::Record::SizeC"></span><span class="target" id="classlgraph__api_1_1Record_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Record4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the size of record. If record is empty, return 0, max size is not beyond the length of your defined param list </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Size of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="lgraph_api::Record::HasKey__ssCR"></span><span class="target" id="classlgraph__api_1_1Record_1a2a2d1b3e4e37484e8bce95728db6b770"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HasKey</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Check a key is exist or not. The key is the one of titile your defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>key</strong> – The key.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if exsit, otherwise fasle. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Record::Record__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Record_1af5b8557af6ac3c8c4af28c7fc79a6b42"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6recordE">
+<span id="_CPPv3N10lgraph_api6Record6recordE"></span><span id="_CPPv2N10lgraph_api6Record6recordE"></span><span id="lgraph_api::Record::record__std::unordered_map:ss.std::shared_ptr:ResultElement::"></span><span class="target" id="classlgraph__api_1_1Record_1a2248d027c6bbadbd043ee858e5656d7a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6recordE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6headerE">
+<span id="_CPPv3N10lgraph_api6Record6headerE"></span><span id="_CPPv2N10lgraph_api6Record6headerE"></span><span id="lgraph_api::Record::header__std::unordered_map:ss.LGraphType:"></span><span class="target" id="classlgraph__api_1_1Record_1a38c0d41af0c74862a17017322f4171d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6headerE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record7length_E">
+<span id="_CPPv3N10lgraph_api6Record7length_E"></span><span id="_CPPv2N10lgraph_api6Record7length_E"></span><span id="lgraph_api::Record::length___int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a5f8ae7abecbad53a2b4130540267cddf"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">length_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record7length_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Result</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6ResultE">
+<span id="_CPPv3N10lgraph_api6ResultE"></span><span id="_CPPv2N10lgraph_api6ResultE"></span><span id="lgraph_api::Result"></span><span class="target" id="classlgraph__api_1_1Result"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6ResultE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> table, result instance provide [MutableRecord], [ResetHeader], [Dump] and [Load] method. Table also provide some method to view content of table. For example, [Header] and [Recordview]. </p>
+<p>It’s worth noting that you are best to define your header before using result table. eg. auto result = <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a>({title, LGraphType}…) If you do not define header and initialize by <a class="reference internal" href="#classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"><span class="std std-ref">Result()</span></a>, you will get a empty table without header, you just use the table after using [ResetHeader] method to set your header. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultEv">
+<span id="_CPPv3N10lgraph_api6Result6ResultEv"></span><span id="_CPPv2N10lgraph_api6Result6ResultEv"></span><span id="lgraph_api::Result::Result"></span><span class="target" id="classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aec54d6cf6ac1ac561febf2d4db046bd6"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1adbe90e1fe046f2cd689d8dadd67177c9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="lgraph_api::Result::GetType__ss"></span><span class="target" id="classlgraph__api_1_1Result_1a1015a1bde96a85591fc70273ad140b35"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">title</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get type of title. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>title</strong> – One of titles in table.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>LGraphType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aa5f20d3711f82acbdd1fbf2ea28d5ece"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1a45a2260d7f28e56b5c3e5a7b94789766"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result13MutableRecordEv">
+<span id="_CPPv3N10lgraph_api6Result13MutableRecordEv"></span><span id="_CPPv2N10lgraph_api6Result13MutableRecordEv"></span><span id="lgraph_api::Result::MutableRecord"></span><span class="target" id="classlgraph__api_1_1Result_1ad4bea412e4aef69da8464dd0a83b2a64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">MutableRecord</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result13MutableRecordEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Create a new record in the table and return the record. The record is the reference of record in the table, if you want to modify the record, you must assign return value to a reference variable. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The reference of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7ReserveE6size_t">
+<span id="_CPPv3N10lgraph_api6Result7ReserveE6size_t"></span><span id="_CPPv2N10lgraph_api6Result7ReserveE6size_t"></span><span id="lgraph_api::Result::Reserve__s"></span><span class="target" id="classlgraph__api_1_1Result_1a204d25ea43252cdf35dc6e859f765410"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reserve</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7ReserveE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>This function attempts to reserve enough memory for the result vector to hold the specified number of elements. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api6Result6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api6Result6ResizeE6size_t"></span><span id="lgraph_api::Result::Resize__s"></span><span class="target" id="classlgraph__api_1_1Result_1a9b2c775a0d09660185780ee0a7ea6be1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResizeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>This function will resize the vector to the specified number of elements </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result2AtE6size_t">
+<span id="_CPPv3N10lgraph_api6Result2AtE6size_t"></span><span id="_CPPv2N10lgraph_api6Result2AtE6size_t"></span><span id="lgraph_api::Result::At__s"></span><span class="target" id="classlgraph__api_1_1Result_1a030c64fc1715cdb057995bf9ff5870f6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">At</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result2AtE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Provides access to the data contained in the vector. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6HeaderEv">
+<span id="_CPPv3N10lgraph_api6Result6HeaderEv"></span><span id="_CPPv2N10lgraph_api6Result6HeaderEv"></span><span id="lgraph_api::Result::Header"></span><span class="target" id="classlgraph__api_1_1Result_1accfa1228e11954438cbaa8ad4d6be5e9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Header</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6HeaderEv" title="永久链接至目标"></a><br></dt>
+<dd><p>return header of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>header. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Result4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Result4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Result4SizeEv"></span><span id="lgraph_api::Result::SizeC"></span><span class="target" id="classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Result4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>return size of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>table size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4DumpEb">
+<span id="_CPPv3N10lgraph_api6Result4DumpEb"></span><span id="_CPPv2N10lgraph_api6Result4DumpEb"></span><span id="lgraph_api::Result::Dump__b"></span><span class="target" id="classlgraph__api_1_1Result_1ac839e6ed0453fe8ed7fac29e9a6803d1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Dump</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_standard</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4DumpEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Serialize the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>is_standard</strong> – (Optional) If true, the result will serialize to a standard result, the standard result can be Visualized in web. If false, result will serialize a json object &amp;#8212; SDK result.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Serialize result. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="lgraph_api::Result::Load__ssCR"></span><span class="target" id="classlgraph__api_1_1Result_1a405e30d792103a7989739a05f992c94a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Load</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">json</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deserialize data to result table. This will be clear original data and header, please use this function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>json</strong> – Json string to be deserialized. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result12ClearRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result12ClearRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result12ClearRecordsEv"></span><span id="lgraph_api::Result::ClearRecords"></span><span class="target" id="classlgraph__api_1_1Result_1af629a0e98c5fbb4adf85475b0073f48a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClearRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result12ClearRecordsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Clear all the records, <a class="reference internal" href="#classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"><span class="std std-ref">Size()</span></a> will be 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10BoltHeaderEv">
+<span id="_CPPv3N10lgraph_api6Result10BoltHeaderEv"></span><span id="_CPPv2N10lgraph_api6Result10BoltHeaderEv"></span><span id="lgraph_api::Result::BoltHeader"></span><span class="target" id="classlgraph__api_1_1Result_1a18c695165355bb5431690e26af2a2d28"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltHeader</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10BoltHeaderEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11BoltRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result11BoltRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result11BoltRecordsEv"></span><span id="lgraph_api::Result::BoltRecords"></span><span class="target" id="classlgraph__api_1_1Result_1a55a40428869f85c65c6dfa3389fe75dc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11BoltRecordsEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10RecordViewE7int64_t">
+<span id="_CPPv3N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="_CPPv2N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="lgraph_api::Result::RecordView__int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1abc994177cadf7bb0d070dd81ad8ea8b9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">RecordView</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">row_num</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10RecordViewE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get record of the table, if row number is more bigger than max length of table, throw a exception. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>row_num</strong> – row number of the table.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>One <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6resultE">
+<span id="_CPPv3N10lgraph_api6Result6resultE"></span><span id="_CPPv2N10lgraph_api6Result6resultE"></span><span id="lgraph_api::Result::result__std::vector:Record:"></span><span class="target" id="classlgraph__api_1_1Result_1a81372de9efc3519cb68a6e51335acfd4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6resultE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6headerE">
+<span id="_CPPv3N10lgraph_api6Result6headerE"></span><span id="_CPPv2N10lgraph_api6Result6headerE"></span><span id="lgraph_api::Result::header__std::vector:std::pair:ss.LGraphType::"></span><span class="target" id="classlgraph__api_1_1Result_1ac1d5325a16b7b45115c0e32c73078d4d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6headerE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10row_count_E">
+<span id="_CPPv3N10lgraph_api6Result10row_count_E"></span><span id="_CPPv2N10lgraph_api6Result10row_count_E"></span><span id="lgraph_api::Result::row_count___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0a15002d39b5391c9c693671d605e56c"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">row_count_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10row_count_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">lgraph::StateMachine</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">cypher::PluginAdapter</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-rpc-client">
+<h2>lgraph_rpc_client<a class="headerlink" href="#lgraph-rpc-client" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410fma_common">
+<span id="_CPPv310fma_common"></span><span id="_CPPv210fma_common"></span><span id="fma_common"></span><span class="target" id="namespacefma__common"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fma_common</span></span></span><a class="headerlink" href="#_CPPv410fma_common" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_rpc">
+<span id="_CPPv310lgraph_rpc"></span><span id="_CPPv210lgraph_rpc"></span><span id="lgraph_rpc"></span><span class="target" id="namespacelgraph__rpc"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_rpc</span></span></span><a class="headerlink" href="#_CPPv410lgraph_rpc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryTypeE">
+<span id="_CPPv3N6lgraph14GraphQueryTypeE"></span><span id="_CPPv2N6lgraph14GraphQueryTypeE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType6CYPHERE">
+<span id="_CPPv3N6lgraph14GraphQueryType6CYPHERE"></span><span id="_CPPv2N6lgraph14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType6CYPHERE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType3GQLE">
+<span id="_CPPv3N6lgraph14GraphQueryType3GQLE"></span><span id="_CPPv2N6lgraph14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType3GQLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientTypeE">
+<span id="_CPPv3N6lgraph10ClientTypeE"></span><span id="_CPPv2N6lgraph10ClientTypeE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClientType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a60813255cdc667f2d2f2ddb427d32d44"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98ab892a078fa6077db32721c67735c56fd"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INDIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a43005cd0efa3b1e1373be596db0ee869"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SINGLE_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientE">
+<span id="_CPPv3N6lgraph9RpcClientE"></span><span id="_CPPv2N6lgraph9RpcClientE"></span><span id="lgraph::RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_rpc_client.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a8995083e1c9332090bdbbced0704b1b9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__std::vector:ss:R.ss.ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a59ff51f4744de0edfe8571844287a51a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">urls</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">user</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>urls</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClientD0Ev"></span><span id="lgraph::RpcClient::~RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient_1a0f8219dbf08d58f7cfc0a853538176a4"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallCypher__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a456fdf97ad54654b985ebd5add140db3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a cypher query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallCypherToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1af9ef8ca1182193ef2c18062ecf23eeb7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypherToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a cypher query to leader </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallGql__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a7cfb10baca3d2f668a10ca43e399afc5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a gql query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallGqlToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a189850ee468b61a65982b7e505c8265b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGqlToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a gql query to leader </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="lgraph::RpcClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a93f4c769de4f1979e4ab824afdaa8ead"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::CallProcedureToLeader__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1a3e5b11b2f703f41d40a2afd9c7581376"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedureToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure to leader </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.ssCR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a0081b8bb075d1be82d8c92281d907cdc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Load a built-in procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_file</strong> – <strong>[in]</strong> the source_file contain procedure code. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Load a built-in procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::ListProcedures__ssR.ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa090037a4c3944d76e3cbf8c07f569b0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>List user-defined procedures </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient6LogoutEv"></span><span id="lgraph::RpcClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient6LogoutEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Client log out </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::IsReadQuery__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a891d9b465df285ae69983ea3aabebde0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Determine whether it is a read-only query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClient__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af77b4e340b5e79a7875f8f065fd221e5"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEb">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEb"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEb"></span><span id="lgraph::RpcClient::GetClient__b"></span><span class="target" id="classlgraph_1_1RpcClient_1ac3415aee2cca8ddb4c12473be63f42a2"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">isReadQuery</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>isReadQuery</strong> – <strong>[in]</strong> read query or not. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClientByNode__ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af935a15699e0f1004779a265afd67c0a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClientByNode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the client according to the node url </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>url</strong> – <strong>[in]</strong> Node address of client connection. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Rpc client connecting to url. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="lgraph::RpcClient::RefreshUserDefinedProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1af85d15b19d971fbe1babd8d06f5ae2c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshUserDefinedProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh User-defined Procedure </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="lgraph::RpcClient::RefreshBuiltInProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1a5d1a4ee81316d67c4d000e598ef41fec"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshBuiltInProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh Built-in Procedure </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="lgraph::RpcClient::RefreshClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1ab683309ba410ef5c7c65ed6a08b085d9"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh the client connection pool according to the cluster status </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="lgraph::RpcClient::LoadBalanceClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1a9b83e575619171ca739b140ffe024207"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadBalanceClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Load balance the client pool </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshConnectionEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="lgraph::RpcClient::RefreshConnection"></span><span class="target" id="classlgraph_1_1RpcClient_1a8957fe9842f100f0e80778649ab7ba14"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshConnection</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshConnectionEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh client pool, procedure info </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F">
+<span id="_CPPv3I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span id="_CPPv2I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">F</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph_1_1RpcClient_1a83227aa710bb0fb4cd66dc7e4b00af5a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DoubleCheckQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="lgraph::RpcClient::DoubleCheckQuery::F"><span class="n"><span class="pre">F</span></span></a><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">f</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="永久链接至目标"></a><br></dt>
+<dd><p>If an exception is thrown in the query, refresh the connection and re-execute </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_typeE">
+<span id="_CPPv3N6lgraph9RpcClient11client_typeE"></span><span id="_CPPv2N6lgraph9RpcClient11client_typeE"></span><span id="lgraph::RpcClient::client_type__ClientType"></span><span class="target" id="classlgraph_1_1RpcClient_1a376acacd121bd1f972b5fb097e220fd9"></span><a class="reference internal" href="#_CPPv4N6lgraph10ClientTypeE" title="lgraph::ClientType"><span class="n"><span class="pre">ClientType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_type</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient4userE"></span><span id="lgraph::RpcClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4userE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient8passwordE"></span><span id="lgraph::RpcClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient8passwordE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11base_clientE">
+<span id="_CPPv3N6lgraph9RpcClient11base_clientE"></span><span id="_CPPv2N6lgraph9RpcClient11base_clientE"></span><span id="lgraph::RpcClient::base_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a58adfed74cd9daeb6b32a267039e925b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11base_clientE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4urlsE">
+<span id="_CPPv3N6lgraph9RpcClient4urlsE"></span><span id="_CPPv2N6lgraph9RpcClient4urlsE"></span><span id="lgraph::RpcClient::urls__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a306ada97a24c8198c1a0c9c3c5b0bb25"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">urls</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4urlsE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13leader_clientE">
+<span id="_CPPv3N6lgraph9RpcClient13leader_clientE"></span><span id="_CPPv2N6lgraph9RpcClient13leader_clientE"></span><span id="lgraph::RpcClient::leader_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a13cc47368956dc5404b8c30b89c359f9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">leader_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13leader_clientE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_poolE">
+<span id="_CPPv3N6lgraph9RpcClient11client_poolE"></span><span id="_CPPv2N6lgraph9RpcClient11client_poolE"></span><span id="lgraph::RpcClient::client_pool__std::deque:std::shared_ptr:lgraph::RpcClient::RpcSingleClient::"></span><span class="target" id="classlgraph_1_1RpcClient_1a844140b131b865884e1233813d5ed217"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">deque</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_pool</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_poolE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient19built_in_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient19built_in_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient19built_in_proceduresE"></span><span id="lgraph::RpcClient::built_in_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1a18060c9aed7ccf4e945b9f88d03142d2"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">built_in_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient19built_in_proceduresE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23user_defined_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="lgraph::RpcClient::user_defined_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1aea4d05a8b62f0732342d07a9495616cf"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_defined_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23user_defined_proceduresE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21cypher_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient21cypher_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient21cypher_write_constantE"></span><span id="lgraph::RpcClient::cypher_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a632dd8c3163187f7e6faa9271b7b4cfc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21cypher_write_constantE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18gql_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient18gql_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient18gql_write_constantE"></span><span id="lgraph::RpcClient::gql_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a9ec0e77daff8924f52eb7f2e177cc1fc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">gql_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18gql_write_constantE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientE"></span><span id="lgraph::RpcClient::RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::RpcSingleClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae26aab72012bcb1ee86fb02e92a9613d"></span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>RpcSingleClient Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="lgraph::RpcClient::RpcSingleClient::~RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a1a143a1804f6bf71869b0ee5a6dc1462"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::RpcSingleClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Load a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::RpcSingleClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2b0a265853b25e1e9b36de7acc58c470"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json， Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::ListProcedures__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a44431b16908099e6e5134afbe127ab63"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>List user-defined procedures </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallCypher__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aff1bfcba1cd1754363bb2adf51db086a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a cypher query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallGql__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2fb61a89fc5e431b2433d52059467be0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a gql query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="lgraph::RpcClient::RpcSingleClient::GetUrl"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad4d20fca6bae3f93f4d1e714aacb03cd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUrl</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the url of single client. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>the url of single client. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="lgraph::RpcClient::RpcSingleClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Client log out </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleRequest__LGraphRequestP"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a61415af9341546df1ad67eed0ea2dbaa"></span><span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleRequest</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">LGraphRequest</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">req</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleGraphQueryRequest__lgraph::GraphQueryType.LGraphResponseP.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a63cc8e69616efdad5460f648780a6bb2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleGraphQueryRequest</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">res</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="lgraph::RpcClient::RpcSingleClient::GraphQueryResponseExtractor__GraphQueryResponseCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a4eb9039c5c4d7e1bd1c065e71aaa75d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryResponseExtractor</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">GraphQueryResponse</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="lgraph::RpcClient::RpcSingleClient::url__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae43c7d8d482ec3550b30cbc7dc23b9f0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">url</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="lgraph::RpcClient::RpcSingleClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="lgraph::RpcClient::RpcSingleClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="lgraph::RpcClient::RpcSingleClient::token__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a9f7d94df8d0a73f04a003fe5032ba32d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">token</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="lgraph::RpcClient::RpcSingleClient::server_version__int64_t"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a3de46036a491e337d41dba033c215120"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">server_version</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="lgraph::RpcClient::RpcSingleClient::channel__std::shared_ptr:lgraph_rpc::m_channel:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ac34b00e3851c29e651d8ca31fe21a9be"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">channel</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="lgraph::RpcClient::RpcSingleClient::cntl__std::shared_ptr:lgraph_rpc::m_controller:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a7d9cee7bb74b09c0ff1b71d2a1b4ef8d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_controller</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cntl</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="lgraph::RpcClient::RpcSingleClient::options__std::shared_ptr:lgraph_rpc::m_channel_options:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a18a1c01a5579128138eeddb758b305d6"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel_options</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">options</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-traversal">
+<h2>lgraph_traversal<a class="headerlink" href="#lgraph-traversal" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalE">
+<span id="_CPPv3N10lgraph_api9traversalE"></span><span id="_CPPv2N10lgraph_api9traversalE"></span><span id="lgraph_api::traversal"></span><span class="target" id="namespacelgraph__api_1_1traversal"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">traversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalE" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb">
+<span id="_CPPv3N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span id="_CPPv2N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a726096df46599bdfb914a6ca3420ec96"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FindVertices</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">filter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Retrieve all vertices passing the specified filter. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>filter</strong> – <strong>[inout]</strong> The user-defined filter function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The corresponding list of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb">
+<span id="_CPPv3I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span id="_CPPv2I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1aceb3385f1d10f71f5d9aa46fcdd92915"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">frontier</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Extract data from specified vertices. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">模板参数</dt>
+<dd class="field-even"><p><strong>VertexData</strong> – Type of the vertex data. </p>
+</dd>
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The database. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>frontier</strong> – <strong>[inout]</strong> The vertices to extract data from. </p></li>
+<li><p><strong>extract</strong> – <strong>[inout]</strong> The user-defined extract function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The corresponding extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT">
+<span id="_CPPv3I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span id="_CPPv2I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a860101673fe319842615891bdce356d5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DefaultFilter</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="lgraph_api::traversal::DefaultFilter::IT"><span class="n"><span class="pre">IT</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="永久链接至目标"></a><br></dt>
+<dd><p>The default filter you may use. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>it</strong> – <strong>[inout]</strong> An iterator class.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Always true. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a0be095f6cae74a9b2b83368bcaa8bb9d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Function closure filtering by label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>label</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a916a3c242ae9447471b4116416ac3200"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Function closure filtering by label id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>label_id</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::eq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a787283b8c440e78fe08f3233ec9927d1"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::neq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a5a867323375932ba84f360b8f7ba104d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::eq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1aca364480fdfefebade068076c782085e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::neq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a2360c3785fed893a88cc4ab67d8a56de"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE">
+<span id="_CPPv3N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="_CPPv2N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="lgraph_api::traversal::MAX_RESULT_SIZE__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a19036385f876c801d15c194fc62e7531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE">
+<span id="_CPPv3N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="_CPPv2N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="lgraph_api::traversal::TRAVERSAL_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a86e405bbe2ac6d2a74230ae2305fd8e0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE">
+<span id="_CPPv3N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="_CPPv2N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="lgraph_api::traversal::TRAVERSAL_ALLOW_REVISITS__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a92a5114a7f6be9af4e24557fa238f8b7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_ALLOW_REVISITS</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4EdgeE">
+<span id="_CPPv3N10lgraph_api9traversal4EdgeE"></span><span id="_CPPv2N10lgraph_api9traversal4EdgeE"></span><span id="lgraph_api::traversal::Edge"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent an edge. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="lgraph_api::traversal::Edge::Edge__s.uint16_t.uint64_t.s.s.b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5fa8e10b10d8db22077e6a8f51c56a4f"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">start</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">tid</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">end</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">eid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">forward</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>start</strong> – The start. </p></li>
+<li><p><strong>lid</strong> – The lid. </p></li>
+<li><p><strong>tid</strong> – The tid. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>eid</strong> – The eid. </p></li>
+<li><p><strong>forward</strong> – True to forward. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="lgraph_api::traversal::Edge::Edge__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1accd38aace77501c9cf5cae967e894970"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="lgraph_api::traversal::Edge::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="lgraph_api::traversal::Edge::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the start vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The start vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="lgraph_api::traversal::Edge::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the end vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The end vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="lgraph_api::traversal::Edge::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a15b074c85865e730723336acec71f79e"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the label ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The label ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="lgraph_api::traversal::Edge::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a02537fe49ffb801dd20bdaae51b29325"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Temporal ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The temporal ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="lgraph_api::traversal::Edge::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a2592e180e605668b296b9251bc4d275a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the edge ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The edge ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="lgraph_api::traversal::Edge::IsForwardC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a41a01f6b828238200fef82f544fd172e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsForward</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the direction of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>true : forward; false: backward. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="lgraph_api::traversal::Edge::GetSrcVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5490526b0251ebb9ad277c9b314eedbb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrcVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the source vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The source vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="lgraph_api::traversal::Edge::GetDstVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ab717cca464319d1b380648aedbaaca1d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDstVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the destination vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The destination vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge6start_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge6start_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge6start_E"></span><span id="lgraph_api::traversal::Edge::start___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ad914f6be659b44fe8e11acc02cf6eeb6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">start_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge6start_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4end_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4end_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4end_E"></span><span id="lgraph_api::traversal::Edge::end___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1afdac24f7adfe72f79983c12b08e566e5"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4end_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4eid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4eid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4eid_E"></span><span id="lgraph_api::traversal::Edge::eid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a74dfb17650dad72d071112c995343f25"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4eid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4lid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4lid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4lid_E"></span><span id="lgraph_api::traversal::Edge::lid___uint16_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4b77269210d4ee2d997719c8dee806ea"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4lid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4tid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4tid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4tid_E"></span><span id="lgraph_api::traversal::Edge::tid___int64_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a6ec1f5936b6351a1911a966a8a08fd42"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4tid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge8forward_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge8forward_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge8forward_E"></span><span id="lgraph_api::traversal::Edge::forward___b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1aae1b80cda1e8b80f4a52f8a6d1f22df8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">forward_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge8forward_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversalE"></span><span id="lgraph_api::traversal::FrontierTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversalE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> provides the most common way to traverse graphs. You can start from a single vertex or a set of vertices (known as the initial frontier), and expand them frontier by frontier, each time visiting neighboring vertices of the current frontier and make those matching specified conditions the new frontier. One powerful feature of <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> is that the traversal can be performed in parallel, accelerating those <em>deep</em> queries significantly. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::FrontierTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a545b378096e3004e11024a15fd17bd27"></span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> object. Note that the transaction must be read- only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Be careful when TRAVERSAL_ALLOW_REVISITS is used, as each vertex may be visited more than once, making the result set huge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::FrontierTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a9c2251578e77394a41833329c9200e72"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ae8aee8d3fccc6f15e21f0e5a4652c33e"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a79b977639f217d9411ac48a32c6e83f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad655c689b55d2072e9212b55ea015bb0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="lgraph_api::traversal::FrontierTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="lgraph_api::traversal::FrontierTraversal::ResetVisited"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aaf986f1e13f0da831c3d8277cdb860f0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetVisited</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset only the visited flags. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="lgraph_api::traversal::FrontierTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="lgraph_api::traversal::FrontierTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="lgraph_api::traversal::FrontierTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::FrontierTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::curr_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a272d864e6eface58376c0d0c08c89401"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::next_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad05308b798bf29c2e2e6fcf6331150c6"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="lgraph_api::traversal::FrontierTraversal::visited___ParallelBitset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ac784cfc9970b0a1fb2e5a1678ed59284"></span><span class="n"><span class="pre">ParallelBitset</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">visited_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelperE">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelperE"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelperE"></span><span id="lgraph_api::traversal::IteratorHelper"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1IteratorHelper"><span class="std std-ref">IteratorHelper</span></a> provides some useful methods, such as casting Vertex/Edge objects to their iterator forms. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="lgraph_api::traversal::IteratorHelper::IteratorHelper__TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a7d72fd8bc5a5a60f16a5eea5b1ae781e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a9db8a753c5773fd00186665e172e8df2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd><p>Casting a <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> to a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vertex</strong> – A <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> object.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> corresponding to vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1ab5ec73c9874f5c269c066857075d67c6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge" title="永久链接至目标"></a><br></dt>
+<dd><p>Casting an <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Edge"><span class="std std-ref">Edge</span></a> to an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>edge</strong> – An edge object.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> corresponding to edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="lgraph_api::traversal::IteratorHelper::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathE">
+<span id="_CPPv3N10lgraph_api9traversal4PathE"></span><span id="_CPPv2N10lgraph_api9traversal4PathE"></span><span id="lgraph_api::traversal::Path"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="lgraph_api::traversal::Path::Path__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abd76ad8cca7c9f5611d89b6c94e88d53"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">start</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>start</strong> – The start. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="lgraph_api::traversal::Path::Path__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a6f0b65d8220590bc0de51a6f9178db0c"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="lgraph_api::traversal::Path::Path__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae8d80e874d2f88e507218f6db1ed2cdc"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Move constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERK4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a3640a670cabc7ff15a8bf5e31f83b3e9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERK4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Assignment operator </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERR4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae3dcf33db8617fe1de00cedc6541ae98"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERR4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Move assignment operator </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path6LengthEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path6LengthEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path6LengthEv"></span><span id="lgraph_api::traversal::Path::LengthC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1aa63d0332a20e86302501c8bd1db921c2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Length</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path6LengthEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the length of this path. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The path length. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="lgraph_api::traversal::Path::Append__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab88413d902928384d83cbad1df6de769"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge" title="永久链接至目标"></a><br></dt>
+<dd><p>Append an edge to the path. Note that the edge’s start vertex should match the current path’s end vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>edge</strong> – edge to append. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="lgraph_api::traversal::Path::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the start vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="lgraph_api::traversal::Path::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the end vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="lgraph_api::traversal::Path::GetLastEdgeC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abf723fca4ce807ccf77dc91e685b5545"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLastEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the last edge of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthEdge__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a7f37b5b5e876c5ec8836bba603e526e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Nth edge of this path. The available range of N is [0, Length). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthVertex__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab6aa8a9295375d526831278b2690558e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Nth vertex of this path. The available range of N is [0, Length]. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5dirs_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5dirs_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5dirs_E"></span><span id="lgraph_api::traversal::Path::dirs___std::vector:b:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a0ad3ec1585be61bf4e9ab8ae94bb4406"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dirs_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5dirs_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5lids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5lids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5lids_E"></span><span id="lgraph_api::traversal::Path::lids___std::vector:uint16_t:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a58d741b575ad6c800db503b3d2db61d3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint16_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5lids_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4ids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path4ids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path4ids_E"></span><span id="lgraph_api::traversal::Path::ids___std::vector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a2a21c3f2f91696ebc1c7d5109b5cc921"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4ids_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversalE"></span><span id="lgraph_api::traversal::PathTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversalE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> behaves similar to <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a>, except that 1) Each vertex could be revisited multiple times. 2) Each traversed path would be stored, and the filter function has access to the path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::PathTraversal::PathTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af738f641e5877af62941a670ceedd359"></span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> object. Note that the transaction must be read-only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Since TRAVERSAL_ALLOW_REVISITS is implied in <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> and storing the Paths also takes a lot of space, the memory consumption could be very large if the filters are not very selective. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::PathTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4664408bde6c8bc833b2d308a7a9c770"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a346ba8aed662685cd78506c8baec815c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a0a54b5500485e208383933b8f2817675"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1abb7d1f2986dde079c71c568410386249"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="lgraph_api::traversal::PathTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="lgraph_api::traversal::PathTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="lgraph_api::traversal::PathTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="lgraph_api::traversal::PathTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::PathTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::curr_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ac73154ee309f0dad63fb1a1790e23025"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::next_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af032087096fefc9f61b4351bc5e9a71d"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6VertexE">
+<span id="_CPPv3N10lgraph_api9traversal6VertexE"></span><span id="_CPPv2N10lgraph_api9traversal6VertexE"></span><span id="lgraph_api::traversal::Vertex"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a vertex. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="lgraph_api::traversal::Vertex::Vertex__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a3f6911c4ec59435701457f131e89af4a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="lgraph_api::traversal::Vertex::Vertex__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a13f7b30a546a536a3dfafd128adb609f"></span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="lgraph_api::traversal::Vertex::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="lgraph_api::traversal::Vertex::GetIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a63765fbd0690661e2af3bc97083475fc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The Id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex4vid_E">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex4vid_E"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex4vid_E"></span><span id="lgraph_api::traversal::Vertex::vid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a224220636b53e35b1b5bf8c0e88717d0"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex4vid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-txn">
+<h2>lgraph_txn<a class="headerlink" href="#lgraph-txn" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api11TransactionE"></span><span id="lgraph_api::Transaction"></span><span class="target" id="classlgraph__api_1_1Transaction"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_txn.h&gt;</em></div>
+<p>TuGraph operations happen in transactions. A transaction is sequence of operations that is carried out atomically on the <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. TuGraph transactions provides full ACID guarantees. </p>
+<p>Transactions are created using <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"><span class="std std-ref">GraphDB::CreateReadTxn()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"><span class="std std-ref">GraphDB::CreateWriteTxn()</span></a>. A read transaction can only perform read operations, otherwise an exception is thrown. A write transaction can perform reads as well as writes. There are performance differences between read and write operations. So if you only need read in a transaction, you should create a read transaction.</p>
+<p>Each transaction must be used in one thread only, and they should not be passed from one thread to another unless it is a forked transaction.</p>
+<p>Read transactions can be forked. The new copy of the transaction will have the same view as the forked one, and it can be used in a separate thread. By forking from one read transaction and using the forked copies in different threads, we can parallelize the execution of specific operations. For example, you can implement a parallel BFS with this capability. Also, you can dump a snapshot of the whole graph using </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09c0d46171b7562e16c3a697f77fca90"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERR11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERR11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERR11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3d6029838ae611c2c7bbc3c59afe059"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERR11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a44fabd0e73ed35b6d683051496a3f30f"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERK11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERK11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERK11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1abde1d510a232da04117f21bd23de8143"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERK11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6CommitEv">
+<span id="_CPPv3N10lgraph_api11Transaction6CommitEv"></span><span id="_CPPv2N10lgraph_api11Transaction6CommitEv"></span><span id="lgraph_api::Transaction::Commit"></span><span class="target" id="classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Commit</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6CommitEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Commits this transaction. Note that optimistic write transactions may fail to commit (an TxnConflict would be thrown). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5AbortEv">
+<span id="_CPPv3N10lgraph_api11Transaction5AbortEv"></span><span id="_CPPv2N10lgraph_api11Transaction5AbortEv"></span><span id="lgraph_api::Transaction::Abort"></span><span class="target" id="classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Abort</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5AbortEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Aborts this transaction. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction7IsValidEv">
+<span id="_CPPv3NK10lgraph_api11Transaction7IsValidEv"></span><span id="_CPPv2NK10lgraph_api11Transaction7IsValidEv"></span><span id="lgraph_api::Transaction::IsValidC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this transaction is valid. <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> becomes invalid after calling <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"><span class="std std-ref">Abort()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"><span class="std std-ref">Commit()</span></a>. Operations on invalid transaction yields exceptions. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv">
+<span id="_CPPv3NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="_CPPv2NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="lgraph_api::Transaction::IsReadOnlyC"></span><span class="target" id="classlgraph__api_1_1Transaction_1afde2da3cd793a0a0403ea2ea0c9b9ea7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadOnly</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this txn is read only </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if read only, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6GetTxnEv">
+<span id="_CPPv3N10lgraph_api11Transaction6GetTxnEv"></span><span id="_CPPv2N10lgraph_api11Transaction6GetTxnEv"></span><span id="lgraph_api::Transaction::GetTxn"></span><span class="target" id="classlgraph__api_1_1Transaction_1a94bc9b71b14ae6ad7c788d20ec39b769"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6GetTxnEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="lgraph_api::Transaction::GetVertexIterator"></span><span class="target" id="classlgraph__api_1_1Transaction_1a16d76f5c12d744846d85b007cf4e094c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get a vertex iterator pointing to the first vertex. If there is no vertex, the iterator is invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="lgraph_api::Transaction::GetVertexIterator__int64_t.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1af8c95376a78769b0717fd40fdcd274eb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets a vertex iterator pointing to the Vertex with vid. If the vertex does not exist, the iterator is invalid. If nearest==true, the iterator points to the first vertex sorted by vid, with id&gt;=vid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vid</strong> – The vid. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to point to the nearest vertex sorted by vid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9bcd70f9274974a3028ef762228e176e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an out edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1add821551447553956775fac4656f3d94"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an in edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab3bfd10ebeec5f7d0455d1fbc0762e73"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="lgraph_api::Transaction::GetNumVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4b870210a66a2f239535915497e26278"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of vertex labels </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The number of vertex labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="lgraph_api::Transaction::GetNumEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1aec256df0cdfca791031bad9c43c63061"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of edge labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The number of edge labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="lgraph_api::Transaction::ListVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a5b2320193bfb8ffbfaa157a110d550ad"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Lists all vertex labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="lgraph_api::Transaction::ListEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae77fe52ec78bc3e8d8d92fe8d7a3accb"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List all edge labels </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1a3769873514b6a5dd62b04414ff627c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label name.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab030e136e6b28679acbb59a08a977090"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1afd8f546dcb187e1be6f86d268c62996b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4afb55d1ce9b5906c6721f5c4b3b3d82"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac461aea7ee379f8669f45f9782cea1f4"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a55194445591f9fa6730dd8deb99e2414"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2d9a2f736cfb96a2f61e4de3072eb811"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetEdgeFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c13f1f3f527b37d3a221d4adb06cc5c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae62bafbd58f35cfcc01255fe4113094f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2c972657b35f86a21527bc2ad1be741e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae57f64149da2f4d2f972f49a53943591"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee14b2bcd0e170d5b87924a6a9a3e16f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3452ae2c9cae9850a7e53c2ddcc6240"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add0eea119e67210b57d9b8b6119e88d4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad342ee46d6f7f955529018100a701185"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9663b407c7f5ce18af938c7b670dd3fd"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1af3a3806320f56cb01f5edc7ff364ad80"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a66d9f07dc220285b2fbec99fb088ad4a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List indexes </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A vector of vertex index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="lgraph_api::Transaction::ListEdgeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee4d71f4e5ce213bbe886162db6edba0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List indexes </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A vector of edge index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aea99efb5e098fca6157f419ec7e4396c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e87da96ea73d8c709ef75a92b2bf5c4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add8eaa25484aefe92c14c0340bb35841"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a49deaf34c918d940432204e5a5a16cff"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09382e2279bb78f1a79443741112a57e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0a484619a92fe73247f86d9db09d2ead"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of vertices. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of edges. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee85d698359c92dc3c9bc9f9e65ecf0f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2eddb62a56cf0030545bce6bef00104f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9af16d5a13268c711610cc3c615592c0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9cc46853b60d578578649f8bef35d84d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9a16d2c7f0770fbfd38e53a4a95a165f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a99a3bbbf134a20c992b10ac015ea4131"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv">
+<span id="_CPPv3N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="_CPPv2N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="lgraph_api::Transaction::GetNumVertices"></span><span class="target" id="classlgraph__api_1_1Transaction_1a84acf46e241f12fe3480c203cbd59d3c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The nubmer of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexPrimaryField__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0b662063aee62d2793c634a132375ae9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexPrimaryField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex primary field </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The primary field. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5CountEv">
+<span id="_CPPv3N10lgraph_api11Transaction5CountEv"></span><span id="_CPPv2N10lgraph_api11Transaction5CountEv"></span><span id="lgraph_api::Transaction::Count"></span><span class="target" id="classlgraph__api_1_1Transaction_1a420ff169b39c4ce47b02a25a1eda00ae"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Count</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5CountEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the total number of vertex and edge </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>std::pair object, first element is vertex number, second is edge number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11CountDetailEv">
+<span id="_CPPv3N10lgraph_api11Transaction11CountDetailEv"></span><span id="_CPPv2N10lgraph_api11Transaction11CountDetailEv"></span><span id="lgraph_api::Transaction::CountDetail"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e88abab9d0a158b1dd1f72d97dcbda1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CountDetail</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11CountDetailEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the total number of vertex or edge for each label </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>std::tuple object list, first element indicates whether it is VERTEX or EDGE, second is label name, third is number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="lgraph_api::Transaction::Transaction__lgraph::TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1b5dc38854e41e00ee874297e73343af"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction4txn_E">
+<span id="_CPPv3N10lgraph_api11Transaction4txn_E"></span><span id="_CPPv2N10lgraph_api11Transaction4txn_E"></span><span id="lgraph_api::Transaction::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">GraphDB</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-types">
+<h2>lgraph_types<a class="headerlink" href="#lgraph-types" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15EdgeConstraintsE">
+<span id="_CPPv3N10lgraph_api15EdgeConstraintsE"></span><span id="_CPPv2N10lgraph_api15EdgeConstraintsE"></span><span id="lgraph_api::EdgeConstraints"></span><span class="target" id="namespacelgraph__api_1a7d597d281cbcd87325f58fcce96e5d34"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeConstraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="永久链接至目标"></a><br></dt>
+<dd><p>Edge constraints type define </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevelE">
+<span id="_CPPv3N10lgraph_api11AccessLevelE"></span><span id="_CPPv2N10lgraph_api11AccessLevelE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevelE" title="永久链接至目标"></a><br></dt>
+<dd><p>Access level a user or role has on a graph. NONE: no permission. READ: read-only, no write access. WRITE: can read and write vertex and edge, but cannot change meta data such as schema or access. FULL: full access, can modify schema, grant access to other users, or even delete this graph. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4NONEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4READE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4READE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62a3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4READE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ad4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel5WRITEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4FULLE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4FULLE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4FULLE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62aba7de5bc6888294e5884b024a4c894f1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FULL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4FULLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevelE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevelE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevelE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afe"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldAccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afeab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4NONEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4READE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4READE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afea3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4READE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afead4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryTypeE">
+<span id="_CPPv3N10lgraph_api14GraphQueryTypeE"></span><span id="_CPPv2N10lgraph_api14GraphQueryTypeE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType6CYPHERE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType6CYPHERE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType6CYPHERE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType3GQLE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType3GQLE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType3GQLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldTypeE">
+<span id="_CPPv3N10lgraph_api9FieldTypeE"></span><span id="_CPPv2N10lgraph_api9FieldTypeE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1da"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>Field and value types. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType3NULE">
+<span id="_CPPv3N10lgraph_api9FieldType3NULE"></span><span id="_CPPv2N10lgraph_api9FieldType3NULE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa4c175fbb65c723226d182dbfd556136a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType3NULE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BOOLE">
+<span id="_CPPv3N10lgraph_api9FieldType4BOOLE"></span><span id="_CPPv2N10lgraph_api9FieldType4BOOLE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daae663dbb8f8244e122acb5bd6b2c216e1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BOOLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4INT8E">
+<span id="_CPPv3N10lgraph_api9FieldType4INT8E"></span><span id="_CPPv2N10lgraph_api9FieldType4INT8E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daada138aad097eaac8697fe3661c91af95"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4INT8E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT16E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT16E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT16E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac4a99142c241d04e1607af8a319c201b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT16E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT32E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT32E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT32E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac1081c62db14e24ef35a1c3c36cba2e7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT32E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT64E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT64E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT64E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa423a1db7cbc915478f654b15f87f3aac"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT64E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5FLOATE">
+<span id="_CPPv3N10lgraph_api9FieldType5FLOATE"></span><span id="_CPPv2N10lgraph_api9FieldType5FLOATE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa9cf4a0866224b0bb4a7a895da27c9c4c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5FLOATE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api9FieldType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api9FieldType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa33465d1d419b1074fb259ef444609e92"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6DOUBLEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4DATEE">
+<span id="_CPPv3N10lgraph_api9FieldType4DATEE"></span><span id="_CPPv2N10lgraph_api9FieldType4DATEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa0ace72efd9e987dfd807365d0ca50141"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4DATEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType8DATETIMEE">
+<span id="_CPPv3N10lgraph_api9FieldType8DATETIMEE"></span><span id="_CPPv2N10lgraph_api9FieldType8DATETIMEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa86797ee5836338ee241ceee5cfc669e2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATETIME</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType8DATETIMEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6STRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType6STRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType6STRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaee847e634a4297b274316de8a8ca9921"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6STRINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BLOBE">
+<span id="_CPPv3N10lgraph_api9FieldType4BLOBE"></span><span id="_CPPv2N10lgraph_api9FieldType4BLOBE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa3a625432a45f9c83112036bc7a2d2d70"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BLOB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BLOBE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5POINTE">
+<span id="_CPPv3N10lgraph_api9FieldType5POINTE"></span><span id="_CPPv2N10lgraph_api9FieldType5POINTE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa15108ccafa3232b9067f889b6156f565"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5POINTE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaaebdbcb765394d25d6a604589a890f82"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType10LINESTRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType10LINESTRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType10LINESTRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa21af7314ca158a415f7e073333d14447"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType10LINESTRINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaa90611ea278d30580b21af6d65208307"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7POLYGONE">
+<span id="_CPPv3N10lgraph_api9FieldType7POLYGONE"></span><span id="_CPPv2N10lgraph_api9FieldType7POLYGONE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daad5355465780b9a6259ebbc74d47477db"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7POLYGONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaecdc92bf56d960b73b02ee40125758bc"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7SPATIALE">
+<span id="_CPPv3N10lgraph_api9FieldType7SPATIALE"></span><span id="_CPPv2N10lgraph_api9FieldType7SPATIALE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa608c1acc2033e0e07248c48ea01746ce"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SPATIAL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7SPATIALE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphTypeE">
+<span id="_CPPv3N10lgraph_api10LGraphTypeE"></span><span id="_CPPv2N10lgraph_api10LGraphTypeE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00d"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphType</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">uint16_t</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>a type of value used in result entry and parameter in procedure or plugin signature </p>
+<dl class="field-list simple">
+<dt class="field-odd">Param INTEGER</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param FLOAT</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param DOUBLE</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param BOOLEAN</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param STRING</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param MAP</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param NODE</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>, VertexId </p>
+</dd>
+<dt class="field-even">Param RELATIONSHIP</dt>
+<dd class="field-even"><p><a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> || <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>, <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p>
+</dd>
+<dt class="field-odd">Param PATH</dt>
+<dd class="field-odd"><p>lgraph_api::Path </p>
+</dd>
+<dt class="field-even">Param LIST</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param ANY</dt>
+<dd class="field-odd"><p>like Object in Java, its procedure author’s responsibility to check the underlying concrete type whether valid in runtime. </p>
+</dd>
+</dl>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3NULE">
+<span id="_CPPv3N10lgraph_api10LGraphType3NULE"></span><span id="_CPPv2N10lgraph_api10LGraphType3NULE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3NULE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7INTEGERE">
+<span id="_CPPv3N10lgraph_api10LGraphType7INTEGERE"></span><span id="_CPPv2N10lgraph_api10LGraphType7INTEGERE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5d5cd46919fa987731fb2edefe0f2a0c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INTEGER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7INTEGERE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType5FLOATE">
+<span id="_CPPv3N10lgraph_api10LGraphType5FLOATE"></span><span id="_CPPv2N10lgraph_api10LGraphType5FLOATE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dae738c26bf4ce1037fa81b039a915cbf6"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType5FLOATE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api10LGraphType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api10LGraphType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dafd3e4ece78a7d422280d5ed379482229"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6DOUBLEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7BOOLEANE">
+<span id="_CPPv3N10lgraph_api10LGraphType7BOOLEANE"></span><span id="_CPPv2N10lgraph_api10LGraphType7BOOLEANE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac48d5da12d702e73d6966069f2687376"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOLEAN</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7BOOLEANE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6STRINGE">
+<span id="_CPPv3N10lgraph_api10LGraphType6STRINGE"></span><span id="_CPPv2N10lgraph_api10LGraphType6STRINGE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da63b588d5559f64f89a416e656880b949"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6STRINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4NODEE">
+<span id="_CPPv3N10lgraph_api10LGraphType4NODEE"></span><span id="_CPPv2N10lgraph_api10LGraphType4NODEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da0cc25b606fe928a0c9a58f7f209c4495"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NODE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4NODEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE">
+<span id="_CPPv3N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span id="_CPPv2N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac5a4cec9a456484389b2573c8ae0a8bf"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RELATIONSHIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4PATHE">
+<span id="_CPPv3N10lgraph_api10LGraphType4PATHE"></span><span id="_CPPv2N10lgraph_api10LGraphType4PATHE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5ffb5f0d0de78321df46fc7c93ca64a3"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PATH</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4PATHE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4LISTE">
+<span id="_CPPv3N10lgraph_api10LGraphType4LISTE"></span><span id="_CPPv2N10lgraph_api10LGraphType4LISTE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da298cb25408234de02baf2085803a464a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LIST</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4LISTE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3MAPE">
+<span id="_CPPv3N10lgraph_api10LGraphType3MAPE"></span><span id="_CPPv2N10lgraph_api10LGraphType3MAPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5af1a3a285c2bdee4192223e31e1f833"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3MAPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3ANYE">
+<span id="_CPPv3N10lgraph_api10LGraphType3ANYE"></span><span id="_CPPv2N10lgraph_api10LGraphType3ANYE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da8e1bde3c3d303163521522cf1d62f21f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ANY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3ANYE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeTypeE">
+<span id="_CPPv3N10lgraph_api14PluginCodeTypeE"></span><span id="_CPPv2N10lgraph_api14PluginCodeTypeE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>Type of code given when loading a new plugin. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2PYE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2PYE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2PYE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3ae0a77e22f8238541046ba5f9a5941e9e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2PYE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2SOE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2SOE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2SOE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3af9f590fe6d84e72c832e714b75b1604b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SO</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2SOE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3CPPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3CPPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3CPPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aca1ef9dc7006f2011c38e2bcc8f64d16"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CPP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3CPPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3ZIPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3ZIPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3ZIPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aed0690cdc850739d6e2b7b888311e32c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ZIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3ZIPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexTypeE">
+<span id="_CPPv3N10lgraph_api9IndexTypeE"></span><span id="_CPPv2N10lgraph_api9IndexTypeE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>index type </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType14NonuniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType14NonuniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a5e3e0d5af84f4b5e85c9dca495b47018"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NonuniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is not unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a7f0f75f7fcd7d67aa985f11f3ebf2712"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GlobalUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is a global unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType15PairUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType15PairUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a89627e6fbb7ed5b8b3913ecbd253b52f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PairUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is a pair unique index, for edge index only key of pair unique index is one of the follow case : if src_vid &lt; dst_vid ,key is (index field value + src_vid + dst_vid) if src_vid &gt; dst_vid ,key is (index field value + dst_vid + src_vid) </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK11AccessLevel"></span><span id="lgraph_api::to_string__AccessLevelCR"></span><span class="target" id="namespacelgraph__api_1aaa50da267713908744fd8e2c5a6a4373"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK11AccessLevel" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="lgraph_api::to_string__FieldAccessLevelCR"></span><span class="target" id="namespacelgraph__api_1af06d7db8c2df7831e02af25d45ad43ef"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="lgraph_api::FieldAccessLevel"><span class="n"><span class="pre">FieldAccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK14GraphQueryType">
+<span id="_CPPv3N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="_CPPv2N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="lgraph_api::to_string__GraphQueryTypeCR"></span><span class="target" id="namespacelgraph__api_1acd1e36eab9c9fc42d4192f3d55e4504a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="lgraph_api::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK14GraphQueryType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE9FieldType">
+<span id="_CPPv3N10lgraph_api9to_stringE9FieldType"></span><span id="_CPPv2N10lgraph_api9to_stringE9FieldType"></span><span id="lgraph_api::to_string__FieldType"></span><span class="target" id="namespacelgraph__api_1a584042d80e34528010e1ad8e3e499b1d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the name of the given FieldType. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – when an unrecognizable FieldType is given.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>v</strong> – A FieldType.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Name of the given FieldType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType">
+<span id="_CPPv3N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="_CPPv2N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsField__LGraphType"></span><span class="target" id="namespacelgraph__api_1a4f4fd20c65be1aaa3f4d6e70e7d7218a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsField</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType">
+<span id="_CPPv3N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="_CPPv2N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsGraphElement__LGraphType"></span><span class="target" id="namespacelgraph__api_1a9fb9c1e160b13a90e177a8e8ec0e00fa"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsGraphElement</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType">
+<span id="_CPPv3N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="_CPPv2N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsCollection__LGraphType"></span><span class="target" id="namespacelgraph__api_1a82cc6a5df4119f903835efab9edbf4fe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsCollection</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType">
+<span id="_CPPv3N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="_CPPv2N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsAny__LGraphType"></span><span class="target" id="namespacelgraph__api_1aca1c7356409eb19c5deab724bc4fff2d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsAny</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE10LGraphType">
+<span id="_CPPv3N10lgraph_api9to_stringE10LGraphType"></span><span id="_CPPv2N10lgraph_api9to_stringE10LGraphType"></span><span id="lgraph_api::to_string__LGraphType"></span><span class="target" id="namespacelgraph__api_1a5113ccea82007fb6b30d591032637775"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType">
+<span id="_CPPv3N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="_CPPv2N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="lgraph_api::PluginCodeTypeStr__PluginCodeType"></span><span class="target" id="namespacelgraph__api_1ad94969b6b33bfee0e009c16ba50623a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeTypeStr</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="lgraph_api::PluginCodeType"><span class="n"><span class="pre">PluginCodeType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code_type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the name of plugin code types. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptionsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptionsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptionsE"></span><span id="lgraph_api::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Edge label options, contain fields only edge have </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-types">Public Types</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TemporalFieldOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439ac6e421eaad140c1bc1a39980502df80c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ASC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439a65a6d757dbb571ccc3af9706e9a5f607"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DESC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="lgraph_api::EdgeOptions::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5708a1309a1260a1c5a7208f9d7f25c2"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="lgraph_api::EdgeOptions::EdgeOptions__EdgeConstraintsCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5a91f7f6cbcd9600e96add55f510a9d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="lgraph_api::EdgeOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions5clearEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions5clearEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions5clearEv"></span><span id="lgraph_api::EdgeOptions::clear"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions5clearEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="lgraph_api::EdgeOptions::edge_constraints__EdgeConstraints"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ab879b0258a59289c195a102d07ae88bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_constraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="lgraph_api::EdgeOptions::temporal_field__ss"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aed02035800f19fa3eb75108a4ed4489a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="lgraph_api::EdgeOptions::temporal_field_order__lgraph_api::EdgeOptions::TemporalFieldOrder"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a7e866158b92a86c3db1a2db0ad830104"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field_order</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="lgraph_api::EdgeOptions::TemporalFieldOrder::ASC"><span class="n"><span class="pre">ASC</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder">
+<span id="_CPPv3N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="_CPPv2N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="lgraph_api::EdgeOptions::to_string__TemporalFieldOrderCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a02b8f61202a7e3f790caaaece23d1cfc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUidE">
+<span id="_CPPv3N10lgraph_api7EdgeUidE"></span><span id="_CPPv2N10lgraph_api7EdgeUidE"></span><span id="lgraph_api::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUidE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="lgraph_api::EdgeUid::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ac4a49320d7fa2c7fba9bdad45e49e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="lgraph_api::EdgeUid::EdgeUid__int64_t.int64_t.uint16_t.int64_t.int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a3ecba2c59d236b1b4f042d4274f51264"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">l</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">e</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7ReverseEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7ReverseEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7ReverseEv"></span><span id="lgraph_api::EdgeUid::Reverse"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae1b551cc51c9d556342b27b466a7c7cb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reverse</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7ReverseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reverses side of this edge </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::eq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae10ec79b489d4c829b1b28a4c14b7f7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::lt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1afde4cbd02b63c9acd53e61d5e49787e6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::gt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a92818596b49b9fd47fa4b4ce4c203094"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid8ToStringEv">
+<span id="_CPPv3NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="_CPPv2NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="lgraph_api::EdgeUid::ToStringC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of this object </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3srcE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3srcE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3srcE"></span><span id="lgraph_api::EdgeUid::src__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7d1e8afde8407667e51f6de0ba9d6453"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3srcE" title="永久链接至目标"></a><br></dt>
+<dd><p>source vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3dstE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3dstE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3dstE"></span><span id="lgraph_api::EdgeUid::dst__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1adbdebae8daea6c03c200361fa8840a80"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3dstE" title="永久链接至目标"></a><br></dt>
+<dd><p>destination vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3lidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3lidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3lidE"></span><span id="lgraph_api::EdgeUid::lid__uint16_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a16870a9bf8dc2c31ee3c874d7adbd02a"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3lidE" title="永久链接至目标"></a><br></dt>
+<dd><p>label id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3tidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3tidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3tidE"></span><span id="lgraph_api::EdgeUid::tid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a523c7bbc2f001feab204b52b533f7c87"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3tidE" title="永久链接至目标"></a><br></dt>
+<dd><p>timestamp </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3eidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3eidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3eidE"></span><span id="lgraph_api::EdgeUid::eid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ea4961b92589517fd8cfafc0f945033"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3eidE" title="永久链接至目标"></a><br></dt>
+<dd><p>additional edge id to distinguish edges with the same tid </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="lgraph_api::EdgeUid::AnyEdge"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ab5a73d71df790d8768376a4d13608773"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AnyEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of in-coming edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of out-going edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataE">
+<span id="_CPPv3N10lgraph_api9FieldDataE"></span><span id="_CPPv2N10lgraph_api9FieldDataE"></span><span id="lgraph_api::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A class that represents variant type. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEv">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEv"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEv"></span><span id="lgraph_api::FieldData::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a33d34623467e64a3352cd10e53c85ca5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEb">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEb"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEb"></span><span id="lgraph_api::FieldData::FieldData__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a06ad1d80ad369afa643075cbe87f02ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="lgraph_api::FieldData::FieldData__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a265c89b1a86a0bbad89cf42661828f8c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="lgraph_api::FieldData::FieldData__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7e0e988dd1d89abbdacbf4d99fd7b2bf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="lgraph_api::FieldData::FieldData__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1aea814e9fb09dda664977d12f5b350d57"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="lgraph_api::FieldData::FieldData__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a38a8108c47e489a360ebece5e593ca7f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEf">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEf"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEf"></span><span id="lgraph_api::FieldData::FieldData__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab8122e35f0b0a42212299fb31ba8cf8d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEf" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEd">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEd"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEd"></span><span id="lgraph_api::FieldData::FieldData__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad56e5648c7943ef08a593aaf5c231985"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEd" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="lgraph_api::FieldData::FieldData__DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a484a31f1c0cba4531908a803a1782258"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="lgraph_api::FieldData::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="lgraph_api::FieldData::FieldData__DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a870fede3129fb7b07d10096b7adf796f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="lgraph_api::FieldData::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50384efa457e9883b378314910e01ccc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d1752cfc22854c2c44381b0a443fb56"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="lgraph_api::FieldData::FieldData__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a28485df6381f6dc1ba4b30a8087e39fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="lgraph_api::FieldData::FieldData__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a72fde0d7ac627644c3dff536d09a45f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aff76c6792c66514d775ba8be88b789ab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a388fd3199bf652332ce922fe0a25f145"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad19f579289333ecf8515aae8f3bb903a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aafaa13b9ee556736c8992f555e99eda6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a393d9735468c278ddf48b9cf8ef95891"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a59b4b116bc89bf0718ba25b9749c2cce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac81b0f4a81a11954f3afcaa9872b396b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5da2cfc866cfdbe5db69ba9ef1dab2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataD0Ev">
+<span id="_CPPv3N10lgraph_api9FieldDataD0Ev"></span><span id="_CPPv2N10lgraph_api9FieldDataD0Ev"></span><span id="lgraph_api::FieldData::~FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6e58de1884451d88a24994e2875b1d6a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a74cb11c1f4f0a79d6f7a278fc84074ba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5a88873a071ad0c03bcf2c2a498e90bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac721aa38df96b34b841cd4bbc608abdf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b27ecbef11936a80c911800629edd46"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERR9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7integerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7integerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7integerEv"></span><span id="lgraph_api::FieldData::integerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1e5b6bc8e5ac95ae151fdaf8894201e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">integer</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7integerEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as int64. Valid only when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is of INT8, INT16, INT32, or INT64 types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of int types.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>An int64_t. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData4realEv">
+<span id="_CPPv3NK10lgraph_api9FieldData4realEv"></span><span id="_CPPv2NK10lgraph_api9FieldData4realEv"></span><span id="lgraph_api::FieldData::realC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a3f678878dde3a729f94dfefbdc4ef2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">real</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData4realEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as a double. The <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> must be of FLOAT or DOUBLE types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown if the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of FLOAT or DOUBLE types.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A double. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6stringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6stringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6stringEv"></span><span id="lgraph_api::FieldData::stringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7314f49a51859d46439cfeddb9ea06ec"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6stringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as std::string. Valid only for STRING, BLOB and SPATIAL. BLOB data is returned as-is, since std::string can also hold byte array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when a bad cast error condition occurs.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A reference to a const std::string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBoolEv"></span><span id="lgraph_api::FieldData::AsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac488187ef67bf8905cbe686daab95183"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBoolEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="lgraph_api::FieldData::AsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0094a31af359f4684c261a56f780cfb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsInt8Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="lgraph_api::FieldData::AsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aaca113d03918222c50977a094b75c2d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt16Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="lgraph_api::FieldData::AsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0cc24eb0e06a5f5b5476f5739b6ae51e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt32Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="lgraph_api::FieldData::AsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a16e138db4d9a0defc0ab8f03a7864d65"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt64Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsFloatEv"></span><span id="lgraph_api::FieldData::AsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8f86682f960b846e1c3a59eb7fc6ae95"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsFloatEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="lgraph_api::FieldData::AsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2894e904ceb04109370957ba7c48e189"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsDoubleEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1accfbae3969f742ce3621560fee34dbda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Date</span> <span class="pre">AsDate</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1abd4d1fc803c662e145761278c129d3c9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::DateTime</span> <span class="pre">AsDateTime</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsStringEv"></span><span id="lgraph_api::FieldData::AsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5e3562cda960da001597e7dd5679b140"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsStringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBlobEv"></span><span id="lgraph_api::FieldData::AsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9a5a106b2ee0d6fa3c78592852682f0b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBlobEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="lgraph_api::FieldData::AsBase64BlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1afc4b6bc9a7a4d42a981579e04b86b3a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBase64Blob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a8128129ec0fa7689772f0c437fe93a1f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::SRID</span> <span class="pre">GetSRID</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a26726ddebb182026865e77b4e68f8f53"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a31ea41c18cb7507bfefbb18971a3dd0e"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ad5f639edaa8b36e90cff7192554b8723"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1aaef5ea8cbde81ad51459f035a99bdd7f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a7fce7150c8ad873933a8028b16a72a69"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a0015550261b9e976e07e61a3d5790fda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1afb01ecb2663024f0adedfcfe05928d45"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ade0f7fe05edb1eb43c1f4057275967f9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6ToBoltEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6ToBoltEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6ToBoltEv"></span><span id="lgraph_api::FieldData::ToBoltC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3b294f10df124b9d290c7d8fb37e1243"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToBolt</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6ToBoltEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::ToString__ssCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5290ed610cdd3fb38c0d09be107dce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">null_value</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"NUL"</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of this <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="lgraph_api::FieldData::eq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1360e03268a1c10e4a40573e61f2f5ae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataneERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="lgraph_api::FieldData::neq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade1a5ee8968dbf6e7656e5adf96be546"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataneERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="lgraph_api::FieldData::gt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a936f13e9913fde88ff4beb6ba8cabbba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatageERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="lgraph_api::FieldData::gte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9dbdaf01c34ed106fe44fb5f4df2a43b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatageERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataltERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="lgraph_api::FieldData::lt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b808b6437787ab0de4133d7f1cd077"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataltERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataleERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="lgraph_api::FieldData::lte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a34d5df1f1114d3fe8c15bce452736680"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataleERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7GetTypeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7GetTypeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7GetTypeEv"></span><span id="lgraph_api::FieldData::GetTypeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aacf5cac64e0e4e0fba5962f6f1ecf925"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7GetTypeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7is_nullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7is_nullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7is_nullEv"></span><span id="lgraph_api::FieldData::is_nullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a54e61d2bb6c2a58d7b98180555af09e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_null</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7is_nullEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6is_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6is_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6is_bufEv"></span><span id="lgraph_api::FieldData::is_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a49ddf20e31700f6609ffa379f0d25a8f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6is_bufEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="lgraph_api::FieldData::is_empty_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade6523aa6dc019354f36c47aeb4dfd21"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_empty_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsNullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsNullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsNullEv"></span><span id="lgraph_api::FieldData::IsNullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac4d637a0dec45d546495c1660c9f6047"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsNull</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsNullEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is null </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBoolEv"></span><span id="lgraph_api::FieldData::IsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec3bdef27fa2d4de29db82d2334ad2d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBoolEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is bool </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBlobEv"></span><span id="lgraph_api::FieldData::IsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50d95767570c5cc1599c634b7b33e916"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBlobEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is BLOB </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsStringEv"></span><span id="lgraph_api::FieldData::IsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7c412f98489e7d252ef40ed053a3908c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is string </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="lgraph_api::FieldData::IsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a325f297dbf3554c5dbb109b2dada4a43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsInt8Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT8 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="lgraph_api::FieldData::IsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefe2db06fec008bc80e0d15ab52949c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt16Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT16 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="lgraph_api::FieldData::IsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a480ddcb154c9e18b948ff3850a42c22d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt32Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT32 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="lgraph_api::FieldData::IsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b0be739d239c9d646696e1bfe3b2bae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt64Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT64 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsIntegerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="lgraph_api::FieldData::IsIntegerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8543c359835d7977b96446aaef126344"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsIntegerEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Is this a INT8, INT16, INT32 or INT64? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsFloatEv"></span><span id="lgraph_api::FieldData::IsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec0a6f81c7581924db00ea960358d91b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsFloatEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is float </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="lgraph_api::FieldData::IsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a300a2e608e8144e2fbe4588729dd34e3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsDoubleEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is double </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsRealEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsRealEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsRealEv"></span><span id="lgraph_api::FieldData::IsRealC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab6d49b63cf486d609f6286f8b26887f9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsRealEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Is this a FLOAT or DOUBLE? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsDateEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsDateEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsDateEv"></span><span id="lgraph_api::FieldData::IsDateC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8aa76d397e0e2b1d0cb09487316210cc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsDateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is date </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="lgraph_api::FieldData::IsDateTimeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1b1b2b6676359ff4d4ec77eb7e7ee62e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is date time </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsPointEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsPointEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsPointEv"></span><span id="lgraph_api::FieldData::IsPointC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab50e9ff6a50f06668ea577fe1d963a8b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsPointEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is Point</p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12IsLineStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="lgraph_api::FieldData::IsLineStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a795fc6d4d17d385f07d87f82bb247c45"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsLineString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12IsLineStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is LineString</p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsPolygonEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="lgraph_api::FieldData::IsPolygonC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a57c2b6137c6ae390b86d5f341b900992"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPolygon</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsPolygonEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is Polygon</p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsSpatialEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="lgraph_api::FieldData::IsSpatialC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad51d37e3d848990cec85e7de187309fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsSpatial</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsSpatialEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is spatial </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4typeE">
+<span id="_CPPv3N10lgraph_api9FieldData4typeE"></span><span id="_CPPv2N10lgraph_api9FieldData4typeE"></span><span id="lgraph_api::FieldData::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7booleanE">
+<span id="_CPPv3N10lgraph_api9FieldData7booleanE"></span><span id="_CPPv2N10lgraph_api9FieldData7booleanE"></span><span id="lgraph_api::FieldData::boolean__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a857e4e5a2613b7cf584dbf12dae00525"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">boolean</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7booleanE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4int8E">
+<span id="_CPPv3N10lgraph_api9FieldData4int8E"></span><span id="_CPPv2N10lgraph_api9FieldData4int8E"></span><span id="lgraph_api::FieldData::int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae0a430ab8199def132f3f07af5c84066"></span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4int8E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int16E">
+<span id="_CPPv3N10lgraph_api9FieldData5int16E"></span><span id="_CPPv2N10lgraph_api9FieldData5int16E"></span><span id="lgraph_api::FieldData::int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7cd86ccaa2b7be3ef15423f3f58e929e"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int16E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int32E">
+<span id="_CPPv3N10lgraph_api9FieldData5int32E"></span><span id="_CPPv2N10lgraph_api9FieldData5int32E"></span><span id="lgraph_api::FieldData::int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f658422e832e5e2d56e2245cb84be84"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int32E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int64E">
+<span id="_CPPv3N10lgraph_api9FieldData5int64E"></span><span id="_CPPv2N10lgraph_api9FieldData5int64E"></span><span id="lgraph_api::FieldData::int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a45d113f8d303eebb3734306531862812"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int64E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2spE">
+<span id="_CPPv3N10lgraph_api9FieldData2spE"></span><span id="_CPPv2N10lgraph_api9FieldData2spE"></span><span id="lgraph_api::FieldData::sp__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8d3eff5289da252b05248e40c1cd8188"></span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">sp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2spE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2dpE">
+<span id="_CPPv3N10lgraph_api9FieldData2dpE"></span><span id="_CPPv2N10lgraph_api9FieldData2dpE"></span><span id="lgraph_api::FieldData::dp__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae571d69d755e366904e8663a4c643901"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2dpE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData3bufE">
+<span id="_CPPv3N10lgraph_api9FieldData3bufE"></span><span id="_CPPv2N10lgraph_api9FieldData3bufE"></span><span id="lgraph_api::FieldData::buf__ssP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00201fbea83f2e7a263f58098aa98cd7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">buf</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData3bufE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4dataE">
+<span id="_CPPv3N10lgraph_api9FieldData4dataE"></span><span id="_CPPv2N10lgraph_api9FieldData4dataE"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b1a03093018acfa0d961cae96146f6"></span><span class="k"><span class="pre">union</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">[anonymous]</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BoolEb">
+<span id="_CPPv3N10lgraph_api9FieldData4BoolEb"></span><span id="_CPPv2N10lgraph_api9FieldData4BoolEb"></span><span id="lgraph_api::FieldData::Bool__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbaec39a10e97bfc380b60052450b22b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Bool</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BoolEb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4Int8E6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="lgraph_api::FieldData::Int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbc62444e525fdbd056581b349b2a7ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int8</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4Int8E6int8_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int16E7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="lgraph_api::FieldData::Int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f690c1758c4620ba79e4b03bf703531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int16</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int16E7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int32E7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="lgraph_api::FieldData::Int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a99c13db42b1525365635d10480b7d4ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int32</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int32E7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int64E7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="lgraph_api::FieldData::Int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7301552563e8fae5960de9efe235959b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int64</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int64E7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5FloatEf">
+<span id="_CPPv3N10lgraph_api9FieldData5FloatEf"></span><span id="_CPPv2N10lgraph_api9FieldData5FloatEf"></span><span id="lgraph_api::FieldData::Float__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a326651bedfdc7a8f5743e42b7264003b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Float</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5FloatEf" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6DoubleEd">
+<span id="_CPPv3N10lgraph_api9FieldData6DoubleEd"></span><span id="_CPPv2N10lgraph_api9FieldData6DoubleEd"></span><span id="lgraph_api::FieldData::Double__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5304168443248acb485e7e600e150feb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Double</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6DoubleEd" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="lgraph_api::FieldData::Date__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a88a43a9fe1328b1c06a36f469c286b29"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="lgraph_api::FieldData::Date__lgraph_api::DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a217032b1e975d7f3e8c81d0b10ef2eaa"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="lgraph_api::FieldData::DateTime__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a07cfe75d33077c683aa297554049e1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="lgraph_api::FieldData::DateTime__lgraph_api::DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00245f8fabb288c073b2b8b6310c95ae"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a46cdb6bb8f5ed9047595d8a0559960f9"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0abb491f06b5016de61c1a37dc22cca1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc"></span><span id="lgraph_api::FieldData::String__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefd38e03044cc9574ec9f82f8d8646db"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="lgraph_api::FieldData::String__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0500c9ca63c2c826c5f957706676717a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa6b8639fdb113bf8fe4a6556a161386e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1aa9bc69d37ba46872d769a6678058f5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="lgraph_api::FieldData::Point__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aed6deea650cc82d203060e3db07d2d3b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aadeac21d00b14c4fe99ca7356b38c4c5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1134a797ff8e36b78b12ffa26d3fe7ea"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::LineString__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1af7a37b2d5b7065e5f077d5ed9c203c6a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a89db7b33c84d04f622917e6096f32677"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac595c7685df74f6f1e439c1f14b4fb5c"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="lgraph_api::FieldData::Polygon__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac2f0d143ec079d8c6e6d340d383f0ee1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0051c95b3f512cf741e877d7d84e4298"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac60a663a7f4b31bc4a2ff727d6632f00"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="lgraph_api::FieldData::Spatial__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a32852c0236f9dab9f44a4ad88026f3d1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6277538e024b6bce57fed9ff337fd973"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa40480bb254330540b587feb99e8cded"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="lgraph_api::FieldData::Blob__std::vector:uint8_t:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a07c0ced9778df1c5fed3a4663cc45abd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint8_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructs a Blob from vector of uint8_t, treated as byte array. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="lgraph_api::FieldData::BlobFromBase64__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa1ff897ed22d2524b5caaedb4aadb3dd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BlobFromBase64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">base64_encoded</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructs a BLOB from Base64 encoded string. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="lgraph_api::FieldData::IsBufType__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1abbb98d7d3792559fa61cca3554aeaba7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBufType</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if ‘t’ is BLOB or STRING </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="lgraph_api::FieldData::IsInteger__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae00a13411b0557d842ffb8ea5f89e413"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if ‘t’ is INT8, 16, 32, or 64 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="lgraph_api::FieldData::IsReal__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a884ee60f7e50a01ab3a12179298fb9cb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if ‘t’ is FLLOAT or DOUBLE </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpecE">
+<span id="_CPPv3N10lgraph_api9FieldSpecE"></span><span id="_CPPv2N10lgraph_api9FieldSpecE"></span><span id="lgraph_api::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Specification for a field. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="lgraph_api::FieldSpec::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1abfe187a3e79a4445a5270bba3bfaf72c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssCR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a8428f3af5f513d918d94feb5c78fa7e0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>n</strong> – Field name </p></li>
+<li><p><strong>t</strong> – Field type </p></li>
+<li><p><strong>nu</strong> – True if field is optional </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssRR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ada0df81c60e30bca34ba912a11fcdd9f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec">
+<span id="_CPPv3NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="_CPPv2NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="lgraph_api::FieldSpec::eq-operator__FieldSpecCRC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ac1104e4f8ee3666f766a09745b03836d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpec8ToStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="lgraph_api::FieldSpec::ToStringC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpec8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the string representation of the <a class="reference internal" href="#structlgraph__api_1_1FieldSpec"><span class="std std-ref">FieldSpec</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4nameE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4nameE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4nameE"></span><span id="lgraph_api::FieldSpec::name__ss"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4nameE" title="永久链接至目标"></a><br></dt>
+<dd><p>name of the field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4typeE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4typeE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4typeE"></span><span id="lgraph_api::FieldSpec::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4typeE" title="永久链接至目标"></a><br></dt>
+<dd><p>type of that field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec8optionalE">
+<span id="_CPPv3N10lgraph_api9FieldSpec8optionalE"></span><span id="_CPPv2N10lgraph_api9FieldSpec8optionalE"></span><span id="lgraph_api::FieldSpec::optional__b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a1b3b38329495fc55fd443dfa2246337b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">optional</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec8optionalE" title="永久链接至目标"></a><br></dt>
+<dd><p>is this field optional? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpecE">
+<span id="_CPPv3N10lgraph_api9IndexSpecE"></span><span id="_CPPv2N10lgraph_api9IndexSpecE"></span><span id="lgraph_api::IndexSpec"></span><span class="target" id="structlgraph__api_1_1IndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>An index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5labelE"></span><span id="lgraph_api::IndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5labelE" title="永久链接至目标"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5fieldE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5fieldE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5fieldE"></span><span id="lgraph_api::IndexSpec::field__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a97bab0e4c0ea8b12272a606c825360e7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5fieldE" title="永久链接至目标"></a><br></dt>
+<dd><p>field name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api9IndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api9IndexSpec4typeE"></span><span id="lgraph_api::IndexSpec::type__IndexType"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1ac8263343d7a58ec888a110427f522b64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec4typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsE">
+<span id="_CPPv3N10lgraph_api12LabelOptionsE"></span><span id="_CPPv2N10lgraph_api12LabelOptionsE"></span><span id="lgraph_api::LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelOptions</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Label options, base class, define some common fields and methods </p>
+<p>Subclassed by <a class="reference internal" href="#structlgraph__api_1_1EdgeOptions"><span class="std std-ref">EdgeOptions</span></a>, <a class="reference internal" href="#structlgraph__api_1_1VertexOptions"><span class="std std-ref">VertexOptions</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api12LabelOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="lgraph_api::LabelOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a630c29d66f94446c4292172285d61492"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api12LabelOptions9to_stringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions5clearEv">
+<span id="_CPPv3N10lgraph_api12LabelOptions5clearEv"></span><span id="_CPPv2N10lgraph_api12LabelOptions5clearEv"></span><span id="lgraph_api::LabelOptions::clear"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a5eeb94d22b8366d1b68d0614384802fe"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions5clearEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsD0Ev">
+<span id="_CPPv3N10lgraph_api12LabelOptionsD0Ev"></span><span id="_CPPv2N10lgraph_api12LabelOptionsD0Ev"></span><span id="lgraph_api::LabelOptions::~LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a0c56bbf380b6ce74a532637b65f7e7a4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~LabelOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions15detach_propertyE">
+<span id="_CPPv3N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="_CPPv2N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="lgraph_api::LabelOptions::detach_property__b"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a6057cc32d98316ec805c453db60c48ef"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">detach_property</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions15detach_propertyE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ParameterE">
+<span id="_CPPv3N10lgraph_api9ParameterE"></span><span id="_CPPv2N10lgraph_api9ParameterE"></span><span id="lgraph_api::Parameter"></span><span class="target" id="structlgraph__api_1_1Parameter"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parameter</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ParameterE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>The parameter of procedure/plugin </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4nameE">
+<span id="_CPPv3N10lgraph_api9Parameter4nameE"></span><span id="_CPPv2N10lgraph_api9Parameter4nameE"></span><span id="lgraph_api::Parameter::name__ss"></span><span class="target" id="structlgraph__api_1_1Parameter_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4nameE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter5indexE">
+<span id="_CPPv3N10lgraph_api9Parameter5indexE"></span><span id="_CPPv2N10lgraph_api9Parameter5indexE"></span><span id="lgraph_api::Parameter::index__i"></span><span class="target" id="structlgraph__api_1_1Parameter_1a750b5d744c39a06bfb13e6eb010e35d0"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">index</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter5indexE" title="永久链接至目标"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>name of the parameter </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4typeE">
+<span id="_CPPv3N10lgraph_api9Parameter4typeE"></span><span id="_CPPv2N10lgraph_api9Parameter4typeE"></span><span id="lgraph_api::Parameter::type__LGraphType"></span><span class="target" id="structlgraph__api_1_1Parameter_1ac8ec89e84ffc9d1ffe1b030f61a76e44"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4typeE" title="永久链接至目标"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>index of the parameter list in which the parameter stay </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfoE">
+<span id="_CPPv3N10lgraph_api8RoleInfoE"></span><span id="_CPPv2N10lgraph_api8RoleInfoE"></span><span id="lgraph_api::RoleInfo"></span><span class="target" id="structlgraph__api_1_1RoleInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RoleInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfoE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the role. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo4descE">
+<span id="_CPPv3N10lgraph_api8RoleInfo4descE"></span><span id="_CPPv2N10lgraph_api8RoleInfo4descE"></span><span id="lgraph_api::RoleInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo4descE" title="永久链接至目标"></a><br></dt>
+<dd><p>description </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo12graph_accessE">
+<span id="_CPPv3N10lgraph_api8RoleInfo12graph_accessE"></span><span id="_CPPv2N10lgraph_api8RoleInfo12graph_accessE"></span><span id="lgraph_api::RoleInfo::graph_access__std::map:ss.AccessLevel:"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1ac689f8bad73d3d9b3c2a1c11f1296905"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph_access</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo12graph_accessE" title="永久链接至目标"></a><br></dt>
+<dd><p>access levels on different graphs </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8RoleInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8RoleInfo8disabledE"></span><span id="lgraph_api::RoleInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo8disabledE" title="永久链接至目标"></a><br></dt>
+<dd><p>is this role disabled? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpecE">
+<span id="_CPPv3N10lgraph_api7SigSpecE"></span><span id="_CPPv2N10lgraph_api7SigSpecE"></span><span id="lgraph_api::SigSpec"></span><span class="target" id="structlgraph__api_1_1SigSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SigSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec10input_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec10input_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec10input_listE"></span><span id="lgraph_api::SigSpec::input_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a4f4b1c5201f32fae15b91c8a51021f63"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">input_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec10input_listE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec11result_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec11result_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec11result_listE"></span><span id="lgraph_api::SigSpec::result_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a23e292d0e3f983f3ceba15f9f6249209"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec11result_listE" title="永久链接至目标"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>input parameter list </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfoE">
+<span id="_CPPv3N10lgraph_api8UserInfoE"></span><span id="_CPPv2N10lgraph_api8UserInfoE"></span><span id="lgraph_api::UserInfo"></span><span class="target" id="structlgraph__api_1_1UserInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UserInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfoE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the user. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo4descE">
+<span id="_CPPv3N10lgraph_api8UserInfo4descE"></span><span id="_CPPv2N10lgraph_api8UserInfo4descE"></span><span id="lgraph_api::UserInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo4descE" title="永久链接至目标"></a><br></dt>
+<dd><p>description of the user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo5rolesE">
+<span id="_CPPv3N10lgraph_api8UserInfo5rolesE"></span><span id="_CPPv2N10lgraph_api8UserInfo5rolesE"></span><span id="lgraph_api::UserInfo::roles__std::set:ss:"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1f4c5a9d9b2a7c1022128d3201f03648"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">roles</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo5rolesE" title="永久链接至目标"></a><br></dt>
+<dd><p>roles of this user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8UserInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8UserInfo8disabledE"></span><span id="lgraph_api::UserInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo8disabledE" title="永久链接至目标"></a><br></dt>
+<dd><p>is this user disabled? </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo12memory_limitE">
+<span id="_CPPv3N10lgraph_api8UserInfo12memory_limitE"></span><span id="_CPPv2N10lgraph_api8UserInfo12memory_limitE"></span><span id="lgraph_api::UserInfo::memory_limit__s"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1943ac86ca89eaf251c01c16772dfc00"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">memory_limit</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo12memory_limitE" title="永久链接至目标"></a><br></dt>
+<dd><p>memory limit for this user </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptionsE">
+<span id="_CPPv3N10lgraph_api13VertexOptionsE"></span><span id="_CPPv2N10lgraph_api13VertexOptionsE"></span><span id="lgraph_api::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Vertex label options, contain fields only vertex have </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="lgraph_api::VertexOptions::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1afd0ea869dba2b64723f3643ef5f6d2df"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="lgraph_api::VertexOptions::VertexOptions__ssCR"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac769e8bf000b16416a763894714829c7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">primary_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api13VertexOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="lgraph_api::VertexOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api13VertexOptions9to_stringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions5clearEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions5clearEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions5clearEv"></span><span id="lgraph_api::VertexOptions::clear"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions5clearEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13primary_fieldE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="lgraph_api::VertexOptions::primary_field__ss"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1a72852ec13f99950d76332fad99c71dd0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">primary_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13primary_fieldE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-utils">
+<h2>lgraph_utils<a class="headerlink" href="#lgraph-utils" title="永久链接至标题"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv44json">
+<span id="_CPPv34json"></span><span id="_CPPv24json"></span><span class="target" id="lgraph__utils_8h_1ab701e3ac61a85b337ec5c1abaad6742d"></span><span class="k"><span class="pre">using</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">json</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><a class="headerlink" href="#_CPPv44json" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8get_timeEv">
+<span id="_CPPv3N10lgraph_api8get_timeEv"></span><span id="_CPPv2N10lgraph_api8get_timeEv"></span><span id="lgraph_api::get_time"></span><span class="target" id="namespacelgraph__api_1ab3691fc022301a72d8cb766dc0c17fdf"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">get_time</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8get_timeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Digit value of current time. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE">
+<span id="_CPPv3N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="_CPPv2N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="lgraph_api::split_string__ss.std::vector:ss:R.ss"></span><span class="target" id="namespacelgraph__api_1ae25400b1a7ff2282865cd3cc2353a536"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">split_string</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">origin_string</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sub_strings</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">string_delimiter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Split the original string by format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>origin_string</strong> – original string to be split. </p></li>
+<li><p><strong>sub_strings</strong> – split substring. </p></li>
+<li><p><strong>string_delimiter</strong> – Split format. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE">
+<span id="_CPPv3N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="_CPPv2N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="lgraph_api::rc4__ssR.ss.ss"></span><span class="target" id="namespacelgraph__api_1a985e409c942e1068d32b795a27024122"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">rc4</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">key</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mode</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Encrypt the input string in ac4 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>input</strong> – input string. </p></li>
+<li><p><strong>key</strong> – encryption key. </p></li>
+<li><p><strong>mode</strong> – encryption mode </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13encode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="lgraph_api::encode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a2e5f53c59cee61047cb4e283fb6c1950"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">encode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13encode_base64EKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Encode the input string in encode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13decode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="lgraph_api::decode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a047800adaceb796bbb0eb71c016e4fa3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">decode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13decode_base64EKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Decode the input string in decode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Decrypted string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12alloc_bufferE6size_t">
+<span id="_CPPv3N10lgraph_api12alloc_bufferE6size_t"></span><span id="_CPPv2N10lgraph_api12alloc_bufferE6size_t"></span><span id="lgraph_api::alloc_buffer__s"></span><span class="target" id="namespacelgraph__api_1a3274ccf2c4d0f0990a6edbdee20109c4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">alloc_buffer</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12alloc_bufferE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Allocate memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>bytes</strong> – Size in byte of request memory. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Pointer of allocated memory. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t">
+<span id="_CPPv3N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="_CPPv2N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="lgraph_api::dealloc_buffer__voidP.s"></span><span class="target" id="namespacelgraph__api_1ad6721e43c2327ad8e4c6e19c0996a770"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dealloc_buffer</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buffer</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Free memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>buffer</strong> – Size in bytes of request memory </p></li>
+<li><p><strong>bytes</strong> – Pointer of memory to free. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ae22fdc516fa3fd1ee7f8ad22d877bc64"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a54668379bc6d79cb28f24c532d6ceb28"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse vector parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="lgraph_api::GetVidFromNodeString__ssCR"></span><span class="target" id="namespacelgraph__api_1aa24b1e990b795a8d59c369760c930c7f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVidFromNodeString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">node_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse vid from the node passed in by cypher. For V2 procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>node_string</strong> – <strong>[in]</strong> node </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>vid </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-index-iterator">
+<h2>lgraph_vertex_index_iterator<a class="headerlink" href="#lgraph-vertex-index-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorE"></span><span id="lgraph_api::VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> can be used to access a set of vertices that has the same indexed value. If the index is unique (that is, each vertex has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> will only have one VertexId, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> is valid iff it points to a valid (index_value, vid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a73eb49fc5a21c2eab2d862fb07231061"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1adf8da63a296279030584c1d539dfc7e0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="lgraph_api::VertexIndexIterator::~VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a4a5611b7ffb02851074518d929862608"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="lgraph_api::VertexIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="lgraph_api::VertexIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="lgraph_api::VertexIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next vertex id in the list, which consists of all the valid vertex ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::VertexIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the current index value. The vids are sorted in (IndexValue, Vid) order. When <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one vid to next, possibly moving from one IndexValue to another. This function tells the IndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="lgraph_api::VertexIndexIterator::GetVidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a89f7ed3f184862498c0df7d87b97a1b4"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the current vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The current vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__lgraph::VertexIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a8adfcdcf8d9abeee72c3da1b9f21edaa"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae8421018f7913edfc4d82d2c0f209085"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1abe6ca171051639d874dbfb573a9d4cb3"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator3it_E"></span><span id="lgraph_api::VertexIndexIterator::it___std::unique_ptr:lgraph::VertexIndexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae02cf2beed475be9b6af2ddacf99f077"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="lgraph_api::VertexIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-iterator">
+<h2>lgraph_vertex_iterator<a class="headerlink" href="#lgraph-vertex-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> can be used to iterate through vertices in the DB. Vertices are sorted according to vertex id in the DB. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> is valid iff it points to a valid vertex. Calling method functions on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> for non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> with the id of a non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"><span class="std std-ref">Delete()</span></a> on the last vertex. </p></li>
+</ol>
+<p></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7888300a9ddafc0d6814c54b7d2f1f11"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac4f5daf4ebb180eb1a0c9d1ba024bf38"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14VertexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14VertexIteratorD0Ev"></span><span id="lgraph_api::VertexIterator::~VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ab031829b35061e00c09bf2f5c951063f"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator5CloseEv"></span><span id="lgraph_api::VertexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator4NextEv"></span><span id="lgraph_api::VertexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, otherwise return false (no more vertex) and invalidate the iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb">
+<span id="_CPPv3N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="_CPPv2N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="lgraph_api::VertexIterator::Goto__int64_t.b"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Goto the vertex with id src. If there is no vertex with exactly the same vid, and nearest==true, go to the next vertex with id&gt;=vid, otherwise return false and invalidate the iterator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vid</strong> – Vertex id of the vertex to go. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to go to the closest vertex with id&gt;=vid.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false (no such vertex). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator5GetIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="lgraph_api::VertexIterator::GetIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a9fedaf26513596c151c16f829b47038e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator5GetIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a594a8927f27893b46f4f8ce547b5e558"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the first out-going edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1abb6aadfa764244d29f6458a40f5c4f17"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge, and nearest==false an invalid iterator is returned. If the specified out-edge does not exist, and nearest==true, get the first out-edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetInEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the first in-coming edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetInEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a1013d34130e78bd8715e7b7a0759b578"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge and nearest==false, an invalid iterator is returned. If the specified edge does not exist and nearest==true, </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="lgraph_api::VertexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="lgraph_api::VertexIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the label of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="lgraph_api::VertexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="lgraph_api::VertexIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field_name </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="lgraph_api::VertexIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="lgraph_api::VertexIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>all fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListSrcVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a910d02e24a65995a2784e2028d6244ac"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListSrcVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>List source vids. Each source vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>List of source vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListDstVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1add92b73ced9e72b3b87fa80f486c27a9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListDstVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>List destination vids. Each vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit of number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>List of desitnation vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumInEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1acba67b0fdb21bf78555353cf53fb4f6f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of incoming edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of in-coming edges to count. When the limit is reached, n_limit is returned. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of incoming edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumOutEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a273dc0f4b8ddf828a89ae68748ed0c74"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of out-going edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of out-going edges to count. When the limit is reached, n_limit is returned and limit_exceeded is set to true. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of out-going edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t">
+<span id="_CPPv3N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="_CPPv2N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="lgraph_api::VertexIterator::Delete__sP.sP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_in_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_out_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes this vertex, also deletes all incoming and outgoing edges of this vertex. The iterator will point to the next vertex by vid if there is any. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_in_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of in edges the vertex had. </p></li>
+<li><p><strong>n_out_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of out edges the vertex had. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="lgraph_api::VertexIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the string representation of this vertex. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIterator::VertexIterator__lgraph::graph::VertexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a77858ba7e00cd9e8676e4b168d95f931"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a4b166320bbbeadd713f612c540094bf9"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a25e24a42419e107fee77196a8a9fc488"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator3it_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator3it_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator3it_E"></span><span id="lgraph_api::VertexIterator::it___std::unique_ptr:lgraph::graph::VertexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a26ee2d6416d9ad738ce344fb2b1a2972"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator4txn_E"></span><span id="lgraph_api::VertexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-base">
+<h2>olap_base<a class="headerlink" href="#olap-base" title="永久链接至标题"></a></h2>
+<p>This is an implementation of the TuGraph graph analytics engine. The graph analytics engine is a general-purpose processing engine useful for implementing various graph analytics algorithms such as PageRank, ShortestPath, etc.. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_WORKING">
+<span class="target" id="olap__base_8h_1af8106a969b5fe14011400dcc5de93889"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_WORKING</span></span></span><a class="headerlink" href="#c.THREAD_WORKING" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_STEALING">
+<span class="target" id="olap__base_8h_1a3537fbf36165f2b4f963e4dd7462ec22"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_STEALING</span></span></span><a class="headerlink" href="#c.THREAD_STEALING" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.VERTEX_BATCH_SIZE">
+<span class="target" id="olap__base_8h_1a7655fa441302a14fb0f2f7f74ebe9e64"></span><span class="sig-name descname"><span class="n"><span class="pre">VERTEX_BATCH_SIZE</span></span></span><a class="headerlink" href="#c.VERTEX_BATCH_SIZE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.WORD_OFFSET">
+<span class="target" id="olap__base_8h_1aaa604dee271e714e574fa9a36fd57682"></span><span class="sig-name descname"><span class="n"><span class="pre">WORD_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.WORD_OFFSET" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.BIT_OFFSET">
+<span class="target" id="olap__base_8h_1a5a49e33dd4567ba395e94a35716669b6"></span><span class="sig-name descname"><span class="n"><span class="pre">BIT_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.BIT_OFFSET" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="olap__base_8h_1a539fe76ede7635af5ee150bd33d03317"></span><span class="sig-name descname"><span class="pre">union</span> <span class="pre">@5</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49neighbour">
+<span id="_CPPv39neighbour"></span><span id="_CPPv29neighbour"></span><span id="neighbour__s"></span><span class="target" id="olap__base_8h_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv49neighbour" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49edge_data">
+<span id="_CPPv39edge_data"></span><span id="_CPPv29edge_data"></span><span id="edge_data__EdgeData"></span><span class="target" id="olap__base_8h_1a24f41c52f29d0ba9636668d50ed99a63"></span><span class="n"><span class="pre">EdgeData</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv49edge_data" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43src">
+<span id="_CPPv33src"></span><span id="_CPPv23src"></span><span id="src__s"></span><span class="target" id="olap__base_8h_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv43src" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43dst">
+<span id="_CPPv33dst"></span><span id="_CPPv23dst"></span><span id="dst__s"></span><span class="target" id="olap__base_8h_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv43dst" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olapE">
+<span id="_CPPv3N10lgraph_api4olapE"></span><span id="_CPPv2N10lgraph_api4olapE"></span><span id="lgraph_api::olap"></span><span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olapE" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aae"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="永久链接至目标"></a><br></dt>
+<dd><p>Define the edge direction policy of graph The policy determines the graph symmetric and undirected feature. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaea17946ea357e5e0a46f7354049d684ba1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DUAL_DIRECTION</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE" title="永久链接至目标"></a><br></dt>
+<dd><p>The graph is asymmetric. The edges from input files are outgoing edges. The reversed edges form incoming edges. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeafdc4fc0261af8c2b6f66ab00eed5fe55"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAKE_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE" title="永久链接至目标"></a><br></dt>
+<dd><p>The graph is symmetric but the input files are asymmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeaa1b7f74c74bb030bf8360c598fdfc08f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INPUT_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE" title="永久链接至目标"></a><br></dt>
+<dd><p>Both the graph and the input files are symmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a944bcbf0349029631b4fbda1660df186"></span><span class="sig-name descname"><span class="pre">template&lt;typename</span> <span class="pre">EdgeData&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a6eded0577caa238e1cf59a742cbc7eeb"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum">
+<span id="_CPPv3I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span id="_CPPv2I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aaa30a5461bdf30947283236f847714e7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reduce_plus</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="永久链接至目标"></a><br></dt>
+<dd><p>The default reduce function which uses the plus operator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a5bcc917c95bec960faafcf5506201325"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1ac8203a028b53e5841a52737f4a4f3bcd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1abf9e945446fe724862c9960198e7174f"></span><span class="sig-name descname"><span class="pre">struct</span> <span class="pre">lgraph_api::olap::EdgeStringUnit</span> <span class="pre">__attribute__</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="lgraph_api::olap::MAX_NUM_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a8b2861b30aec5ae10d4519bf3a8ce0f2"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_NUM_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE" title="永久链接至目标"></a><br></dt>
+<dd><p>The maximum number of edges. Change this value if needed. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjListE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjListE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjListE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1AdjList"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="lgraph_api::olap::AdjList::AdjList"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a8b7b96acd6306a4b7c5b74df226e6f7e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList5beginEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList5beginEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList5beginEv"></span><span id="lgraph_api::olap::AdjList::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a1b44a588619cf9b27a4cf547d290bcf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList5beginEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList3endEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList3endEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList3endEv"></span><span id="lgraph_api::olap::AdjList::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1af77a3b6fb415f06e5b56bfc9be448a70"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList3endEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjListixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap7AdjListixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap7AdjListixE6size_t"></span><span id="lgraph_api::olap::AdjList::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a62df7b80147908931b2be1c979639f43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjListixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="lgraph_api::olap::AdjList::AdjList__AdjUnit:EdgeData:P.AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a50f0d642dca2d5631b139d235bd790f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">begin</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList6begin_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList6begin_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList6begin_E"></span><span id="lgraph_api::olap::AdjList::begin___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1aaf99bb4a670e8aa9cae1d700f1e57c5c"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList6begin_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList4end_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList4end_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList4end_E"></span><span id="lgraph_api::olap::AdjList::end___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a90c044b28a9a95203b0a0c289772e178"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList4end_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">OlapBase&lt;</span> <span class="pre">EdgeData</span> <span class="pre">&gt;</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjUnit&lt;EdgeData&gt; represents an adjacent edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="lgraph_api::olap::AdjUnit::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1aacfa29d2dd368a125e50f21c115ec46f"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@4</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeStringUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeStringUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type, The vertex is of string type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="lgraph_api::olap::EdgeStringUnit::src__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1aac2e7b82f607b746d5b33c401a555ad4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="lgraph_api::olap::EdgeStringUnit::dst__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1a030e02dd512080f9859d50b7c2f10db0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeStringUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="lgraph_api::olap::EdgeStringUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8EdgeUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap8EdgeUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap8EdgeUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="lgraph_api::olap::EdgeUnit::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3srcE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="lgraph_api::olap::EdgeUnit::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3dstE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a4a58050a4c0f1da86ec007813a4ec308"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::EdgeUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@6</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap5EmptyE">
+<span id="_CPPv3N10lgraph_api4olap5EmptyE"></span><span id="_CPPv2N10lgraph_api4olap5EmptyE"></span><span id="lgraph_api::olap::Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1Empty"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Empty</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> is used for representing unweighted graphs. </p>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBaseE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBaseE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBaseE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjList&lt;EdgeData&gt; allows range-based for-loop over AdjUnit&lt;EdgeData&gt;. </p>
+<p>Graph</p>
+<p>
+EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>EdgeData</strong> – Type of the edge data.</p></li>
+<li><p><strong>EdgeData</strong> – Graph instances represent static (sub)graphs loaded from txt file. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses.</p></li>
+<li><p><strong>EdgeData</strong> – Type of the edge data. </p></li>
+</ul>
+</dd>
+</dl>
+<p>Subclassed by <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB&lt; EdgeData &gt;</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="lgraph_api::olap::OlapBase::OlapBase"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8b1cb218d9ddbe502eda5a2f0d674d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor of Graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapBase::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af1aedb46d1972859e79efafbe6c33ec2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a6c48401f52e77a7286b04c528b98dc5e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the out-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The out-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::InDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aaa9b9b0056536f6d533c1dfed9fc0ef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the in-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The in-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ada8118bd934579318a4ed38d0233b70d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the outgoing edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The outgoing edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::InEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a19e62567748b5c1a224457b9756d4002"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the incoming edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The incoming edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="lgraph_api::olap::OlapBase::Transpose"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a109318636af36bc89e9853f19e4369e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transpose</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Transpose the graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="lgraph_api::olap::OlapBase::NumVertices"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a07d9840894a10d114719bcf339a5a20d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get number of vertices of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of vertices of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="lgraph_api::olap::OlapBase::NumEdges"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af16ce4014b334a365ccac510c4e4045d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumEdges</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get number of edges of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of edges of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a010ffba60888eacee4ed8153d69e22d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="lgraph_api::olap::OlapBase::AllocVertexArray::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexArray</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Allocate a vertex array with type VertexData. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>VertexData</strong> – Type of the vertex data.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> with type VertexData. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="lgraph_api::olap::OlapBase::AllocVertexSubset"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a950a6ba41cf3e3885d043c15616f583d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexSubset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Allocate a vertex subset represented with <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> sized |V| of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::AcquireVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac15d778dde37cd4ec7f0471d170fe35a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AcquireVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Lock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::ReleaseVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a3d005cde32497e212181e88217938f25"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReleaseVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Unlock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::GuardVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea1c361387ef31606753020550642cf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="lgraph_api::olap::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GuardVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock/unlock.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> corresponding to the specified vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="lgraph_api::olap::OlapBase::IfSparse__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8096171f84ad9c7c78c9ea965c475a8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IfSparse</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd><p>Judging whether it is sparse mode or dense mode according to the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>active_vertices</strong> – The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> of active_vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="lgraph_api::olap::OlapBase::set_num_vertices__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab0c9ca5cca45f72dcbb4ebe427e64b4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">set_num_vertices</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Assign vertices to the first loaded graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vertices</strong> – The vertex id (in the Graph) to lock/unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="lgraph_api::olap::OlapBase::LoadFromArray__cP.s.s.EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a16c3082aa7057bdc8e80f6491e6d8e88"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadFromArray</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">edge_array</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_vertices</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_edges</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">edge_direction_policy</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy" title="永久链接至目标"></a><br></dt>
+<dd><p>Load graph data from edge_array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>edge_array</strong> – <strong>[in]</strong> The data in this array is read into the graph. </p></li>
+<li><p><strong>input_vertices</strong> – The number of vertices in the input graph data. </p></li>
+<li><p><strong>input_edges</strong> – The number of edges in the input graph data. </p></li>
+<li><p><strong>edge_direction_policy</strong> – Graph data loading method. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a23cdd3850d0641f99a761cd30318ddae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a parallel-for loop in the range [lower, upper). </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">模板参数</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing the work. </p></li>
+<li><p><strong>lower</strong> – The lower bound of the range (inclusive). </p></li>
+<li><p><strong>upper</strong> – The upper bound of the range (exclusive). </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adbf76a87d17dfdeb4554fc058772f351"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a2115dc228e9cde0ea88fad83d9527ebe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Process a set of active vertices in parallel. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">模板参数</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing each vertex’s work. </p></li>
+<li><p><strong>active_vertices</strong> – <strong>[inout]</strong> The active vertex set. </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac8cdec9111784ddeb528c899d99ea5bd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-functions">Protected Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="lgraph_api::olap::OlapBase::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ad0df12e23dc13705b7160effdecdca73"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-attributes">Protected Attributes</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="lgraph_api::olap::OlapBase::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="lgraph_api::olap::OlapBase::num_edges___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac4dfd32613a83596fa43818fd979a6e2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_data_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a703092681fc7abbc984632b1644216cd"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::adj_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aec12c1eea29776d600cedb7c8de70b71"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">adj_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea4bca314eba173531bc9f04e35888e7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="lgraph_api::olap::OlapBase::edge_direction_policy___EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a59e5aefcf4de1752fda0c644c4bf920a"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_direction_policy_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="lgraph_api::olap::OlapBase::edge_list___EdgeUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aa463cdb96cdb7fa5bc259c8facc9aed9"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit"><span class="n"><span class="pre">EdgeUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">edge_list_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="lgraph_api::olap::OlapBase::out_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adb8e1bf54dfd199e838ec45066f8f758"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="lgraph_api::olap::OlapBase::in_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a55bb224127fd22ab38d9ea251d83895a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="lgraph_api::olap::OlapBase::out_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af6c2b6632374310efa986cf7aa54fd55"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_index_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="lgraph_api::olap::OlapBase::in_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a8f5032936723f9e23aec62f377b2a3ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_index_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="lgraph_api::olap::OlapBase::out_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a890254f0669f50d5d51c0b7f3c6b94ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="lgraph_api::olap::OlapBase::in_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a35d8cc39082a3468d82e0bf4412aee62"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="lgraph_api::olap::OlapBase::lock_array___ParallelVector:b:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aee90f899c9abd99447bfa22781c5634d"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lock_array_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetE"></span><span id="lgraph_api::olap::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> implements the concurrent bitset data structure, which is usually used to represent active vertex sets. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af71b86fef4aceb1ea4e0c39a4ee73369"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>size</strong> – The size of the bitset (i.e. the number of bits). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7242b92edfd78d370c06883f93674ebe"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::assign-operator__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ab16e3e695d258f2ce3d1ad5eef412a12"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ae83afc3b8694c5e279c03836a293ca1c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a1f67570cf9608fb5b62de10c44519e6e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="lgraph_api::olap::ParallelBitset::~ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7779a66d09a414c3ef215609e2dc9da8"></span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="lgraph_api::olap::ParallelBitset::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Clear the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="lgraph_api::olap::ParallelBitset::Fill"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af5105c0eef86140ad8203af2bf159d57"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Fill the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Has__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ade408d5cd908ff319ee49500dbb898da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Has</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Test a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to test.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Whether the bit is set or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Add__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a9d6d2b50895f5add363b7a1a30b0b804"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Set a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to set.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Whether the operation is a true addition or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::Swap__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad079bdc6ea46251fa256de71ac77c8db"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd><p>Swap the current bitset with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other bitset to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="lgraph_api::olap::ParallelBitset::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5503ab878f0444a70c87fcce727a4b3c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="lgraph_api::olap::ParallelBitset::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="lgraph_api::olap::ParallelBitset::data___uint64_tP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad26e57b8e7bb88f06c363fab8e7009a2"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5data_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="lgraph_api::olap::ParallelBitset::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14ParallelVectorE">
+<span id="_CPPv3I0EN10lgraph_api4olap14ParallelVectorE"></span><span id="_CPPv2I0EN10lgraph_api4olap14ParallelVectorE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>ParallelVector&lt;T&gt; aims to mimic std::vector&lt;T&gt;. Note that the deletions other than clearing are not supported. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aef646925bb31e3dcc02a67e584e6d2d4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>capacity</strong> – The capacity of the vector. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab1334ee433460a07146e277f7e4c30d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>capacity</strong> – The capacity of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__TP.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a140f4d7cdcdfec667cf096f6d855b155"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt; </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>data</strong> – The initial data of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. And the initial capacity equals initial size. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a3aae6881aa98ab806d5eabd668491187"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1af4d6dc6eecb55e2ddf126fef29b17c79"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::assign-operator__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a70489ba54b4027e4e589c93a6a474666"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ae3fed3af74f330a9856fe2cd42482f44"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Default constructor of ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="lgraph_api::olap::ParallelVector::Destroy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ac919a991060ede6983343719401686de"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Destroy ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="lgraph_api::olap::ParallelVector::~ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2a254fcaade5cc8050f3c5eca1893619"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="lgraph_api::olap::ParallelVector::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5d56cb4cffc7089978d354304eb5a7a6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5beginEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="lgraph_api::olap::ParallelVector::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a23e2fdb99370f37cb764cac10378c721"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5beginEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector3endEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector3endEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector3endEv"></span><span id="lgraph_api::olap::ParallelVector::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5994ad65dce0457b21adb6a10c8642dc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector3endEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4BackEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="lgraph_api::olap::ParallelVector::Back"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9fadc3b5d96a350533f1221345259aab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Back</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4BackEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="lgraph_api::olap::ParallelVector::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab2c9a1b384ad445ddc5da54c669e3136"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4DataEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="lgraph_api::olap::ParallelVector::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="lgraph_api::olap::ParallelVector::Capacity"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2ee0a564b6468179fd94541c4bbf85d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Capacity</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="lgraph_api::olap::ParallelVector::Destroyed"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a907f5acbcd44ca4faa2f02fde7bd2df1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroyed</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="lgraph_api::olap::ParallelVector::Resize__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ad9cf0e91780366986c2f047bd796cdd5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>size</strong> – Value of new size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="lgraph_api::olap::ParallelVector::Resize__s.TCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a4a62b4cde89680b486c2560241cd594a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T" title="永久链接至目标"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size and initialize the new element with elem. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>size</strong> – Value of new size. </p></li>
+<li><p><strong>elem</strong> – Initial value of new-added element. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="lgraph_api::olap::ParallelVector::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Clear all data and change size to 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ReAlloc__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a1a61eab0948012f137795032a19d4664"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReAlloc</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Destroy elder data and allocate with new capacity. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>capacity</strong> – New capacity value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="lgraph_api::olap::ParallelVector::Fill__T"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a016e89b3314c7d5d0b82b762bad05a28"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T" title="永久链接至目标"></a><br></dt>
+<dd><p>Assign the vector’s elements with a common value. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>elem</strong> – The common value. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>     <span class="n">This</span> <span class="n">action</span> <span class="ow">is</span> <span class="n">performed</span> <span class="ow">in</span> <span class="n">parallel</span><span class="p">,</span> <span class="n">so</span> <span class="n">you</span> <span class="n">should</span> <span class="ow">not</span> <span class="n">call</span>
+     <span class="n">it</span> <span class="n">inside</span> <span class="n">another</span> <span class="n">parallel</span> <span class="n">region</span> <span class="p">(</span><span class="n">via</span> <span class="n">Worker</span><span class="p">::</span><span class="n">Delegate</span><span class="p">)</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TCR.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a43b8a4f1da7a245932babf7b42aa69db"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Append an element to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>elem</strong> – The element. </p></li>
+<li><p><strong>atomic</strong> – (Optional) Whether atomic instructions should be used or not. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TP.s.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a26d7da32681aab4177e5404de5216525"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">count</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Append an array of elements to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>buf</strong> – <strong>[inout]</strong> The array pointer. </p></li>
+<li><p><strong>count</strong> – The array length. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="lgraph_api::olap::ParallelVector::Append__ParallelVector:T:R.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9c6d119f42bbb02b422f2abdf5a39a26"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Append another vector of elements to this. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>other</strong> – <strong>[inout]</strong> The other vector. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::Swap__ParallelVector:T:R"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1acd7f1912f9dbf8e003bd6e72e4e9efd2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd><p>Swap the current vector with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other vector to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="lgraph_api::olap::ParallelVector::Copy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a6ea526f22af350302e37123f3c37e4ff"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Copy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy the current vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A new vector with the same copied content. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="lgraph_api::olap::ParallelVector::destroyed___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a62dfd137075e11ff18b5516f41bd50c2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">destroyed_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="lgraph_api::olap::ParallelVector::capacity___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa3099a4c2b0b3ab5ba4188b4a8f59b26"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">capacity_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5data_E"></span><span id="lgraph_api::olap::ParallelVector::data___TP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa5a936fbbc363fa1913fdaadc70d872a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5data_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5size_E"></span><span id="lgraph_api::olap::ParallelVector::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadStateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadStateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadStateE"></span><span id="lgraph_api::olap::ThreadState"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ThreadState</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadStateE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState4currE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState4currE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState4currE"></span><span id="lgraph_api::olap::ThreadState::curr__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a8eea8ae4d204a609211b5cdf1e0aa19a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState4currE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState3endE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState3endE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState3endE"></span><span id="lgraph_api::olap::ThreadState::end__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1aca05b1afbbe1c83cf087b49df03c441a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState3endE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState5stateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState5stateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState5stateE"></span><span id="lgraph_api::olap::ThreadState::state__i"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a89f234133d3efe315836311cbf21c64b"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">state</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState5stateE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardE">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardE"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardE"></span><span id="lgraph_api::olap::VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> automatically acquires the lock on construction and releases the lock on destruction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__bVP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aca9940bbc3948c4b105cf4edf770aeac"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">volatile</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">lock</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1a89a098e56f889f8015db67136b3c8ee3"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aeb1d045c401b22855341e0084681ec13"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="lgraph_api::olap::VertexLockGuard::~VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aa7fb9013a4d1c11f4bf8c73c079d8e55"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="lgraph_api::olap::VertexLockGuard::lock___bP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1ac56529c72897ed7db313a69efe299cb3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">lock_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerE">
+<span id="_CPPv3N10lgraph_api4olap6WorkerE"></span><span id="_CPPv2N10lgraph_api4olap6WorkerE"></span><span id="lgraph_api::olap::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>All the parallel tasks should be delegated through <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> to prevent a huge number of threads being populated via OpenMP. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6WorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker6WorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker6WorkerEv"></span><span id="lgraph_api::olap::Worker::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1ac243ac161c3b8a4e9b7d8ab6cccceed7"></span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6WorkerEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerD0Ev">
+<span id="_CPPv3N10lgraph_api4olap6WorkerD0Ev"></span><span id="_CPPv2N10lgraph_api4olap6WorkerD0Ev"></span><span id="lgraph_api::olap::Worker::~Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a6c90b9d499e906079194f681b6cb90ca"></span><span class="sig-name descname"><span class="n"><span class="pre">~Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE">
+<span id="_CPPv3N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span id="_CPPv2N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a78582857fb711225979abb2702d89bad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delegate</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Send some work to the <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>work</strong> – The function describing the work. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>             <span class="n">Exceptions</span> <span class="n">can</span> <span class="n">be</span> <span class="n">thrown</span> <span class="ow">in</span> <span class="n">the</span> <span class="n">work</span> <span class="n">function</span> <span class="k">if</span> <span class="n">necessary</span><span class="o">.</span>
+             <span class="n">Note</span> <span class="n">that</span> <span class="n">Delegate</span> <span class="n">cannot</span> <span class="n">be</span> <span class="n">nested</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute">
+<span id="_CPPv3I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span id="_CPPv2I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Compute</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a7515974ca033a44c70f5b965ba736c7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DelegateCompute</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">compute</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="lgraph_api::olap::Worker::SharedWorker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a21214620b0c58b939404d191d78e1415"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">SharedWorker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the global (shared) worker. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A shared pointer to the global <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9stopping_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9stopping_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9stopping_E"></span><span id="lgraph_api::olap::Worker::stopping___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a72446f290a943941576f6803ea96a0da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">stopping_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9stopping_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9has_work_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9has_work_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9has_work_E"></span><span id="lgraph_api::olap::Worker::has_work___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a3b09e0253be21a64efc11b5ad9887b10"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">has_work_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9has_work_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6mutex_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker6mutex_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker6mutex_E"></span><span id="lgraph_api::olap::Worker::mutex___std::mutex"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a281b5ec791338d4378e22ef44a51b4a1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">mutex</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">mutex_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6mutex_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker3cv_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker3cv_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker3cv_E"></span><span id="lgraph_api::olap::Worker::cv___std::condition_variable"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a5eb1f373ea25b73577b6e0205ad7b399"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">condition_variable</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cv_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker3cv_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker5task_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker5task_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker5task_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a173918333017695d1cb7984078721f78"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">packaged_task</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">task_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker5task_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker7worker_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker7worker_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker7worker_E"></span><span id="lgraph_api::olap::Worker::worker___std::thread"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a2d17662c59ba51130a35fdaa8567db74"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">thread</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">worker_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker7worker_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-on-db">
+<h2>olap_on_db<a class="headerlink" href="#olap-on-db" title="永久链接至标题"></a></h2>
+<p>TuGraph OLAP interface. To implement a plugin that perform graph analytics on TuGraph, user can load a Snapshot from the database, and then use the Gather-Apply-Scatter style interface to do the computation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="lgraph_api::olap::SNAPSHOT_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a24ed9da8cd6c1132a468b64f9ed37f7a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE" title="永久链接至目标"></a><br></dt>
+<dd><p>The available options for (graph construction) flags. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="lgraph_api::olap::SNAPSHOT_UNDIRECTED__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1ac92e5bd74f22a5d50d401c61577c2502"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_UNDIRECTED</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="lgraph_api::olap::SNAPSHOT_IDMAPPING__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1af550d7266e9792ecd7c8d4cec91b8ceb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IDMAPPING</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">2</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a7942e3aa179aef017291e80f6cab14ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">3</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE" title="永久链接至目标"></a><br></dt>
+<dd><p>The following options are not implemented yet. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a5553d31915ca2c1c043688e19a45ac10"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">4</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a1a3bf7fdc6b1674e1dc931f68c1b783e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">5</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a44ce105282f3a854a595cc978fa04693"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">6</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE">
+<span id="_CPPv3I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span id="_CPPv2I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a6f30998cf8b6f4da8c4d3cbb308b08ca"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="lgraph_api::olap::edge_convert_default::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_default</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">1;return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="永久链接至目标"></a><br></dt>
+<dd><p>Default Parser for weighted edges for graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE">
+<span id="_CPPv3I0EN10lgraph_api4olap19edge_convert_weightE"></span><span id="_CPPv2I0EN10lgraph_api4olap19edge_convert_weightE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aa93176409e55c8dbf3df1979c99bb07d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="lgraph_api::olap::edge_convert_weight::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_weight</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">eit.GetField("weight").real();return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="永久链接至目标"></a><br></dt>
+<dd><p>Example parser for extract from edge property “weight” </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDBE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDBE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDBE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olapE" title="lgraph_api::olap"><span class="n"><span class="pre">olap</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase"><span class="n"><span class="pre">OlapBase</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_on_db.h&gt;</em></div>
+<p>Snapshot is a derived class of Graph. Snapshot instances represent static (sub)graphs exported from LightningGraph. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses. </p>
+<p>EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a49ed16af93c6bfbaff9856aefb2d8f04"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1/V2 Procedures </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a31bb964e9baa8452632dfe0d97f253fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1 Procedures </p>
+<p>
+Note: read-write transactions are not recommended here for safety, e.g. some vertices might be removed causing inconsistencies of the analysis, and vertex data extraction may not work for deleted vertices). The constructed graph should contain all vertices whose vertex_filter calls return true and all edges <em>sourced from</em> these vertices whose out_edge_filter calls return true. If SNAPSHOT_UNDIRECTED is specified, the graph will be made symmetric (i.e. reversed edges are also added to the graph). </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges.</p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__GraphDBR.TransactionR.std::vector:std::vector:ss::.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a38771d37dea34f28513dd5305385dfa4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_list</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a428105b32ebebb9bd1ad5df715e8b3d5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Generate a graph without LightningGraph. For V2 Procedures </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a384cbed54b1bcd0610dfc176b0b58563"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a80b05d175e882c00a314f5ba518a55d4"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a79cc725b6c20ffac60c4c980e472d7e1"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::assign-operator__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaa45fb6b0cfa2ce83892f4667684d92a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="lgraph_api::olap::OlapOnDB::~OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c2abb48c34772b4ffd882210300572b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a14ebd243f449d5ef5dc6ffc56d0855c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Extract a vertex array from the graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>extract</strong> – The function describing the extraction logic.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> containing each vertex’s extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab5f0b3fee89201df1f5fa5bd06cceb4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToFile</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToFile::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output_file</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Write vertex data to a file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – The parallel vector storing the vertex data. </p></li>
+<li><p><strong>output_file</strong> – The path to the output file. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c18bf21eacc3c981bb129d99ae63f86"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToGraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToGraphDB::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Write vertex data to the graph database. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – <strong>[inout]</strong> The parallel vector storing the vertex data. </p></li>
+<li><p><strong>vertex_field</strong> – <strong>[in]</strong> The name of the vertex field. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OriginalVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a514e2403802681b3a6ab6e3e1521f3ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OriginalVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the original vertex id (in LightningGraph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The original id of the specified vertex in the graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::MappedVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a6ed1fe8e61e5879a68744a79c522ee0a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MappedVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">original_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the mapped vertex id (in the graph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>original_vid</strong> – The original vertex id (in LightningGraph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The mapped id of the specified vertex (in LightningGraph). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="lgraph_api::olap::OlapOnDB::GetTransaction"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a05e20809b4047a9dc2d54f28b3f62528"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetTransaction</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::Init__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a4457f7e41bdf9a2d7fe100d1bdc32ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Init</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">num_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapOnDB::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab7d7ef02dcbc497f1bc8e738188613c8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv" title="永久链接至目标"></a><br></dt>
+<dd><p>This decision formula is used to determine whether to stop the algorithm running in <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="lgraph_api::olap::OlapOnDB::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a9af72b216eb95e320f0f261d9497c5c1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithVid"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a85b384fc73a534221f880e966c2ca608"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithDegree"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ac2d9a6a8d98a79402d9505ac3270373f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithDegree</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB3db_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="lgraph_api::olap::OlapOnDB::db___GraphDBP"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaaee9f9643b55632219320d15882f548"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="lgraph_api::olap::OlapOnDB::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="lgraph_api::olap::OlapOnDB::original_vids___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a82054e1776bcb3b09cb66389c1eeb781"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">original_vids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="lgraph_api::olap::OlapOnDB::vid_map___cuckoohash_map:s.s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a2871a76b39823e6482e093f9b0cacb78"></span><span class="n"><span class="pre">cuckoohash_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_map_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="lgraph_api::olap::OlapOnDB::flags___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a5bb1ec258a7281a0702e64c19bcda816"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vertex_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa4b2136dfe22d40f01778f7b04aa9993"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edge_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-profile">
+<h2>olap_profile<a class="headerlink" href="#olap-profile" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsageE"></span><span id="lgraph_api::olap::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsageE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_profile.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="lgraph_api::olap::MemUsage::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac231833949c8ed135c0e8e59af8d7e6c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="lgraph_api::olap::MemUsage::getMaxMemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a4f02170838631103c72261595c35916b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">getMaxMemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5resetEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5resetEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5resetEv"></span><span id="lgraph_api::olap::MemUsage::reset"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ad20897c5c8bd47f5d4005989bead0e55"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5resetEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="lgraph_api::olap::MemUsage::startMemRecord__unsigned-i"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac3db2b796bdfa6e43a1302c5a1072ba3"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">startMemRecord</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">interval</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1000</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5printEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5printEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5printEv"></span><span id="lgraph_api::olap::MemUsage::print"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a388f572c62279f839ee138a9afbdeeb5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">print</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5printEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="lgraph_api::olap::MemUsage::parseMemLine__cP"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a07befe13a6e76ab6c84719817c5fadbf"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parseMemLine</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">line</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="lgraph_api::olap::MemUsage::maxMemUsage__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a274bce27e5ba57cce5606ba61eb28489"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">maxMemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..7773487052
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++存储过程接口
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.md
new file mode 100644
index 0000000000..6bd2d73a42
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.md
@@ -0,0 +1,1543 @@
+
+
+             
+  <section id="python">
+
+<p>Version: 4.2.0</p>
+<p>Copyright (C) 2018-2022 Ant Group.</p>
+<div class="toctree-wrapper compound">
+</div>
+<section id="id1">
+<h2>介绍<a class="headerlink" href="#id1" title="永久链接至标题"></a></h2>
+<p>与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。</p>
+<p>这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。</p>
+</section>
+<section id="module-liblgraph_python_api">
+<span id="id2"></span><h2>接口<a class="headerlink" href="#module-liblgraph_python_api" title="永久链接至标题"></a></h2>
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">AccessLevel</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel" title="永久链接至目标"></a></dt>
+<dd><p>Access that a user has on a graph.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NONE</p>
+<p>READ</p>
+<p>WRITE</p>
+<p>FULL</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">EdgeUid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid" title="永久链接至目标"></a></dt>
+<dd><p>Edge identifier.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.dst">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">dst</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.dst" title="永久链接至目标"></a></dt>
+<dd><p>Destination vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.eid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">eid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.eid" title="永久链接至目标"></a></dt>
+<dd><p>ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.lid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">lid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.lid" title="永久链接至目标"></a></dt>
+<dd><p>Label ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.src">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">src</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.src" title="永久链接至目标"></a></dt>
+<dd><p>Source vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.tid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">tid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.tid" title="永久链接至目标"></a></dt>
+<dd><p>Temporal ID of the edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldData</span></span><a class="headerlink" href="#liblgraph_python_api.FieldData" title="永久链接至目标"></a></dt>
+<dd><p>FieldData is the data type of field value.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBlob">
+<span class="sig-name descname"><span class="pre">AsBlob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bytes</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBlob" title="永久链接至目标"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBool">
+<span class="sig-name descname"><span class="pre">AsBool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBool" title="永久链接至目标"></a></dt>
+<dd><p>Get value as bool, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDate">
+<span class="sig-name descname"><span class="pre">AsDate</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDate" title="永久链接至目标"></a></dt>
+<dd><p>Get value as date, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDateTime">
+<span class="sig-name descname"><span class="pre">AsDateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDateTime" title="永久链接至目标"></a></dt>
+<dd><p>Get value as datetime, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDouble">
+<span class="sig-name descname"><span class="pre">AsDouble</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDouble" title="永久链接至目标"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsFloat">
+<span class="sig-name descname"><span class="pre">AsFloat</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsFloat" title="永久链接至目标"></a></dt>
+<dd><p>Get value as float, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt16">
+<span class="sig-name descname"><span class="pre">AsInt16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt16" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int16, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt32">
+<span class="sig-name descname"><span class="pre">AsInt32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt32" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int32, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt64">
+<span class="sig-name descname"><span class="pre">AsInt64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt64" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int64, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt8">
+<span class="sig-name descname"><span class="pre">AsInt8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt8" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int8, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsString">
+<span class="sig-name descname"><span class="pre">AsString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsString" title="永久链接至目标"></a></dt>
+<dd><p>Get value as string, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Blob">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Blob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bytes</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Blob" title="永久链接至目标"></a></dt>
+<dd><p>Make a BLOB value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Bool">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Bool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Bool" title="永久链接至目标"></a></dt>
+<dd><p>Make a BOOL value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Date">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Date</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.Date" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>Date(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+<ol class="arabic simple" start="2">
+<li><p>Date(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.DateTime">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">DateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.DateTime" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>DateTime(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+<ol class="arabic simple" start="2">
+<li><p>DateTime(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Double">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Double</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Double" title="永久链接至目标"></a></dt>
+<dd><p>Make a DOUBLE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Float">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Float</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Float" title="永久链接至目标"></a></dt>
+<dd><p>Make a FLOAT value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int16">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int16" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT16 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int32">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int32" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT32 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int64">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int64" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT64 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int8">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int8" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT8 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.String">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">String</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.String" title="永久链接至目标"></a></dt>
+<dd><p>Make a STRING value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.ToPython">
+<span class="sig-name descname"><span class="pre">ToPython</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.ToPython" title="永久链接至目标"></a></dt>
+<dd><p>Convert to corresponding Python type.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.get">
+<span class="sig-name descname"><span class="pre">get</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.get" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.isNull">
+<span class="sig-name descname"><span class="pre">isNull</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.isNull" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.set">
+<span class="sig-name descname"><span class="pre">set</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.set" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldSpec</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec" title="永久链接至目标"></a></dt>
+<dd><p>Field specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.name" title="永久链接至目标"></a></dt>
+<dd><p>Name of this field.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.nullable">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">nullable</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.nullable" title="永久链接至目标"></a></dt>
+<dd><p>Whether this field can be null.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.type">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">type</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.type" title="永久链接至目标"></a></dt>
+<dd><p>Type of this field, INT8, INT16, …, FLOAT, DOUBLE, STRING.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldType</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType" title="永久链接至目标"></a></dt>
+<dd><p>Data type of FieldData.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NUL</p>
+<p>BOOL</p>
+<p>INT8</p>
+<p>INT16</p>
+<p>INT32</p>
+<p>INT64</p>
+<p>FLOAT</p>
+<p>DOUBLE</p>
+<p>DATE</p>
+<p>DATETIME</p>
+<p>STRING</p>
+<p>BLOB</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Galaxy</span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy" title="永久链接至目标"></a></dt>
+<dd><p>A galaxy is a TuGraph instance that holds multiple GraphDBs.
+A galaxy is stored in a directory and manages users and GraphDBs. Each (user, GraphDB) pair can have different access levels. You can use db=Galaxy.OpenGraph(graph) to open a graph. Since garbage collection in Python is automatic, you need to close the galaxy with Galaxy.Close() when you are done with it.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.Close" title="永久链接至目标"></a></dt>
+<dd><p>Closes this galaxy</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateGraph">
+<span class="sig-name descname"><span class="pre">CreateGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">4398046511104</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateGraph" title="永久链接至目标"></a></dt>
+<dd><p>Creates a graph.
+name: the name of the graph
+description: description of the graph
+max_size: maximum size of the graph, default 1TB</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateRole">
+<span class="sig-name descname"><span class="pre">CreateRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateRole" title="永久链接至目标"></a></dt>
+<dd><p>Create a role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateUser">
+<span class="sig-name descname"><span class="pre">CreateUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateUser" title="永久链接至目标"></a></dt>
+<dd><p>Creates a new user account.
+name: name of the user
+password: password for the user
+desc: description of this user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteGraph">
+<span class="sig-name descname"><span class="pre">DeleteGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteGraph" title="永久链接至目标"></a></dt>
+<dd><p>Deletes a graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteRole">
+<span class="sig-name descname"><span class="pre">DeleteRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteRole" title="永久链接至目标"></a></dt>
+<dd><p>Deletes the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteUser">
+<span class="sig-name descname"><span class="pre">DeleteUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteUser" title="永久链接至目标"></a></dt>
+<dd><p>Deletes a user account</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DisableUser">
+<span class="sig-name descname"><span class="pre">DisableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DisableUser" title="永久链接至目标"></a></dt>
+<dd><p>Disables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.EnableUser">
+<span class="sig-name descname"><span class="pre">EnableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.EnableUser" title="永久链接至目标"></a></dt>
+<dd><p>Enables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.GetUserInfo">
+<span class="sig-name descname"><span class="pre">GetUserInfo</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::UserInfo</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.GetUserInfo" title="永久链接至目标"></a></dt>
+<dd><p>Get information of the specified user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListGraphs">
+<span class="sig-name descname"><span class="pre">ListGraphs</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListGraphs" title="永久链接至目标"></a></dt>
+<dd><p>Lists graphs and returns a dictionary of {name:(desc, max_size)}</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListUsers">
+<span class="sig-name descname"><span class="pre">ListUsers</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict[str,</span> <span class="pre">lgraph_api::UserInfo]</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListUsers" title="永久链接至目标"></a></dt>
+<dd><p>Lists all users and whether they are admin</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ModGraph">
+<span class="sig-name descname"><span class="pre">ModGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ModGraph" title="永久链接至目标"></a></dt>
+<dd><p>mod_size: whether to modify max graph size
+new_max_size: new maximum size of the graph, in bytes</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.OpenGraph">
+<span class="sig-name descname"><span class="pre">OpenGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">read_only</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::GraphDB</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.OpenGraph" title="永久链接至目标"></a></dt>
+<dd><p>Opens a graph and returns a GraphDB instance.
+graph: name of the graph
+read_only: whether to open the graph in read-only mode</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetCurrentUser">
+<span class="sig-name descname"><span class="pre">SetCurrentUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetCurrentUser" title="永久链接至目标"></a></dt>
+<dd><p>Validate user password and set current user.
+user: user name
+password: password of the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRights">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRights</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRights" title="永久链接至目标"></a></dt>
+<dd><p>Set access rights for the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRightsIncremental</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental" title="永久链接至目标"></a></dt>
+<dd><p>Set access rights for the specified role, only affects the specified graphs</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleDesc">
+<span class="sig-name descname"><span class="pre">SetRoleDesc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleDesc" title="永久链接至目标"></a></dt>
+<dd><p>Set description of the specified role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUser">
+<span class="sig-name descname"><span class="pre">SetUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUser" title="永久链接至目标"></a></dt>
+<dd><p>Validate the given user and set current user given in the user.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserGraphAccess">
+<span class="sig-name descname"><span class="pre">SetUserGraphAccess</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">access</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserGraphAccess" title="永久链接至目标"></a></dt>
+<dd><p>Set the access level of the specified user on the graph.
+user: name of the user
+graph: name of the graph
+access: access level of the user on that graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserPass">
+<span class="sig-name descname"><span class="pre">SetUserPass</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self:</span> <span class="pre">liblgraph_python_api.Galaxy</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">name:</span> <span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">old_password:</span> <span class="pre">str</span> <span class="pre">=</span> <span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_password:</span> <span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserPass" title="永久链接至目标"></a></dt>
+<dd><p>Modifies user password.
+name: name of the user
+old_password: current password, not needed when modifying another user
+new_password: new password for the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserRoles">
+<span class="sig-name descname"><span class="pre">SetUserRoles</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">roles</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserRoles" title="永久链接至目标"></a></dt>
+<dd><p>Set the roles for the specified user.
+name: name of the user
+roles: list of roles for this user</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">GraphDB</span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB" title="永久链接至目标"></a></dt>
+<dd><p>The graph database class.
+A GraphDB stores the data about the graph, including labels, vertices, edges and indexes.Since Garbage Collection in Python is automatic, you need to close the DB with GraphDB.Close() at the end of its lifetime.Make sure you have either committed or aborted every transaction that is using the DB before you close the DB.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddEdgeLabel">
+<span class="sig-name descname"><span class="pre">AddEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">temporal_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">[]</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddEdgeLabel" title="永久链接至目标"></a></dt>
+<dd><p>Adds an edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexIndex">
+<span class="sig-name descname"><span class="pre">AddVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">is_unique</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexIndex" title="永久链接至目标"></a></dt>
+<dd><p>Adds an index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexLabel">
+<span class="sig-name descname"><span class="pre">AddVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">primary_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexLabel" title="永久链接至目标"></a></dt>
+<dd><p>Add a vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields" title="永久链接至目标"></a></dt>
+<dd><p>Add fields to an edge label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields" title="永久链接至目标"></a></dt>
+<dd><p>Delete fields from an edge label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModFields" title="永久链接至目标"></a></dt>
+<dd><p>Modify fields in an edge label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModifyConstraints</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints" title="永久链接至目标"></a></dt>
+<dd><p>Modify edge constraints</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelAddFields" title="永久链接至目标"></a></dt>
+<dd><p>Add fields to a vertex label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelDelFields" title="永久链接至目标"></a></dt>
+<dd><p>Delete fields from a vertex label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelModFields" title="永久链接至目标"></a></dt>
+<dd><p>Modify fields in a vertex label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Close" title="永久链接至目标"></a></dt>
+<dd><p>Closes the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateReadTxn">
+<span class="sig-name descname"><span class="pre">CreateReadTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateReadTxn" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateWriteTxn">
+<span class="sig-name descname"><span class="pre">CreateWriteTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">optimistic</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateWriteTxn" title="永久链接至目标"></a></dt>
+<dd><p>Create a write transaction.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteEdgeLabel">
+<span class="sig-name descname"><span class="pre">DeleteEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteEdgeLabel" title="永久链接至目标"></a></dt>
+<dd><p>Deletes an edge label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexIndex">
+<span class="sig-name descname"><span class="pre">DeleteVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexIndex" title="永久链接至目标"></a></dt>
+<dd><p>Deletes the specified index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexLabel">
+<span class="sig-name descname"><span class="pre">DeleteVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexLabel" title="永久链接至目标"></a></dt>
+<dd><p>Deletes a vertex label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllData">
+<span class="sig-name descname"><span class="pre">DropAllData</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllData" title="永久链接至目标"></a></dt>
+<dd><p>Drop all the data in this DB.
+All vertices, edges, labels and indexes will be dropped.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllVertex">
+<span class="sig-name descname"><span class="pre">DropAllVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllVertex" title="永久链接至目标"></a></dt>
+<dd><p>Drops all the vertices and edges in this DB.
+Labels and indexes (though index contents will be cleared due to deletion of vertices) will be preserved.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.EstimateNumVertices">
+<span class="sig-name descname"><span class="pre">EstimateNumVertices</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.EstimateNumVertices" title="永久链接至目标"></a></dt>
+<dd><p>Gets an estimation of the number of vertices.
+This can be inaccurate if there were vertex removals.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Flush">
+<span class="sig-name descname"><span class="pre">Flush</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Flush" title="永久链接至目标"></a></dt>
+<dd><p>Flushes written data into disk.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetDescription">
+<span class="sig-name descname"><span class="pre">GetDescription</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetDescription" title="永久链接至目标"></a></dt>
+<dd><p>Gets description of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetMaxSize">
+<span class="sig-name descname"><span class="pre">GetMaxSize</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetMaxSize" title="永久链接至目标"></a></dt>
+<dd><p>Gets maximum size of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.IsVertexIndexed" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">InEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>InEdgeIterator can be used to iterate through all the incoming edges of the destination vertex.
+Incoming edges are sorted in (dst, label, src, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Delete" title="永久链接至目标"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetAllFields" title="永久链接至目标"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetDst" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetEdgeId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetField" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabel" title="永久链接至目标"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetSrc" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetUid" title="永久链接至目标"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Goto" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the in edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next in edge to current destination vertex.
+If there is no more in edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetField" title="永久链接至目标"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.ToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">IndexSpec</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec" title="永久链接至目标"></a></dt>
+<dd><p>Index specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.field">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">field</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.field" title="永久链接至目标"></a></dt>
+<dd><p>Name of the field</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.label">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">label</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.label" title="永久链接至目标"></a></dt>
+<dd><p>Name of the label.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.unique">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">unique</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.unique" title="永久链接至目标"></a></dt>
+<dd><p>Whether the indexed values are unique.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">LGraphType</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType" title="永久链接至目标"></a></dt>
+<dd><p>Members:</p>
+<p>NUL : NUL</p>
+<p>INTEGER : INTEGER</p>
+<p>FLOAT : FLOAT</p>
+<p>DOUBLE : DOUBLE</p>
+<p>BOOLEAN : BOOLEAN</p>
+<p>STRING : STRING</p>
+<p>NODE : NODE</p>
+<p>RELATIONSHIP : RELATIONSHIP</p>
+<p>PATH : PATH</p>
+<p>LIST : LIST</p>
+<p>MAP : MAP</p>
+<p>ANY : ANY</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">OutEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>OutEdgeIterator can be used to iterate through all the out-going edges of the source vertex.
+Out-going edges are sorted in (src, lid, dst, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Delete" title="永久链接至目标"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetAllFields" title="永久链接至目标"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetDst" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetEdgeId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetField" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabel" title="永久链接至目标"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetSrc" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetUid" title="永久链接至目标"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Goto" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the out edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next out edge from current source vertex.
+If there is no more out edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetField" title="永久链接至目标"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_values are FieldData containing the field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the field values as specified in value_dict.
+value_dict specifies the field_name:value dictionary.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.ToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">PluginErrorCode</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode" title="永久链接至目标"></a></dt>
+<dd><p>ErrorCode of plugin.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>SUCCESS</p>
+<p>INPUT_ERR</p>
+<p>INTERNAL_ERR</p>
+<p>SUCCESS_WITH_SIGNATURE</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Transaction</span></span><a class="headerlink" href="#liblgraph_python_api.Transaction" title="永久链接至目标"></a></dt>
+<dd><p>In embedded mode, all the operations are performed in transactions and thus enjoys the power of
+transactions such as atomicity and isolation. You can commit or abort a transaction at any time
+without worrying about the side effects it has already made.
+Transactions can be either committed or aborted, after which it is destructed and becomes invalid.
+Make sure you have destructed every transaction before you closes the corresponding GraphDB.
+Transactions also track the created iterators and releases all the iterators during destruction.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Abort">
+<span class="sig-name descname"><span class="pre">Abort</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Abort" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddEdge">
+<span class="sig-name descname"><span class="pre">AddEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddEdge" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values in string format.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label id, field ids, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+Returns the id of the newly added edge.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddVertex">
+<span class="sig-name descname"><span class="pre">AddVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddVertex" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values in string format.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label ids, field ids, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_ids are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, value_dict: dict) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name and set the value as specified in value_dict.
+Returns the id of the newly added vertex.
+Fields that are not specified in the dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Commit">
+<span class="sig-name descname"><span class="pre">Commit</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Commit" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.DumpGraph">
+<span class="sig-name descname"><span class="pre">DumpGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.DumpGraph" title="永久链接至目标"></a></dt>
+<dd><p>Prints the string representation of the WHOLE graph to stdout.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeFieldId">
+<span class="sig-name descname"><span class="pre">GetEdgeFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeFieldId" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_name: str) -&gt; int</p></li>
+</ol>
+<p>Gets the edge field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_names: List[str]) -&gt; List[int]</p></li>
+</ol>
+<p>Gets the edge field ids associated with this (label_id, field_names).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeLabelId">
+<span class="sig-name descname"><span class="pre">GetEdgeLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the edge label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeSchema">
+<span class="sig-name descname"><span class="pre">GetEdgeSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeSchema" title="永久链接至目标"></a></dt>
+<dd><p>Gets the schema specification of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetInEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator pointing to the in-edge of vertex dst with EdgeUid==euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumEdgeLabels">
+<span class="sig-name descname"><span class="pre">GetNumEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumEdgeLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumVertexLabels">
+<span class="sig-name descname"><span class="pre">GetNumVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumVertexLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetOutEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator pointing to the edge identified by euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexByUniqueIndex">
+<span class="sig-name descname"><span class="pre">GetVertexByUniqueIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexByUniqueIndex" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value_string: str) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value_string specifies the string representation of the indexed field value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value: object) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value specifies the indexed field value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, field_value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+field_value is a FieldData specifying the indexed field value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldId">
+<span class="sig-name descname"><span class="pre">GetVertexFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the vertex field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldIds">
+<span class="sig-name descname"><span class="pre">GetVertexFieldIds</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_names</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldIds" title="永久链接至目标"></a></dt>
+<dd><p>Gets the vertex field ids associated with this (label_id, [field_names]).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIndexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIndexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIndexIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>Gets an VertexIndexIterator pointing to the indexed item which has index value [key_start, key_end].
+key_start=key_end=v returns an iterator pointing to all vertexes that has field value v.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+value is a FieldData containing the indexed value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start_string: str, key_end_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start_string is the string representation of the minimum indexed value.
+key_end_string is the string representation of the maximum indexed value.</p>
+<ol class="arabic simple" start="4">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="5">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value_string is the string representation of the indexed value.</p>
+<ol class="arabic simple" start="6">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value is a FieldData containing the indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the first vertex in the graph.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the vertex specified by vid.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int, nearest: bool) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets VertexIterator with vertex id.
+If nearest==true, go to the first vertex with id &gt;= vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexLabelId">
+<span class="sig-name descname"><span class="pre">GetVertexLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the vertex label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexSchema">
+<span class="sig-name descname"><span class="pre">GetVertexSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexSchema" title="永久链接至目标"></a></dt>
+<dd><p>Gets the schema specification of the vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsReadOnly">
+<span class="sig-name descname"><span class="pre">IsReadOnly</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsReadOnly" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsValid" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsVertexIndexed" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListEdgeLabels">
+<span class="sig-name descname"><span class="pre">ListEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListEdgeLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexIndexes">
+<span class="sig-name descname"><span class="pre">ListVertexIndexes</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.IndexSpec" title="liblgraph_python_api.IndexSpec"><span class="pre">liblgraph_python_api.IndexSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexIndexes" title="永久链接至目标"></a></dt>
+<dd><p>Gets the list of all the vertex indexes in the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexLabels">
+<span class="sig-name descname"><span class="pre">ListVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.UpsertEdge">
+<span class="sig-name descname"><span class="pre">UpsertEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.UpsertEdge" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values in string format.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label id, field ids, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.VertexToString">
+<span class="sig-name descname"><span class="pre">VertexToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.VertexToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of the vertex specified by vid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIndexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator" title="永久链接至目标"></a></dt>
+<dd><p>VertexIndexIterator can be used to retrieve the id of indexed vertices.
+Vertex ids are sorted in ascending order of (index_value, vertex_id).</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetIndexValue">
+<span class="sig-name descname"><span class="pre">GetIndexValue</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetIndexValue" title="永久链接至目标"></a></dt>
+<dd><p>Gets the indexed value.
+Since vertex ids are sorted in (index_value, vertex_id) order, calling Next() may change the current indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetVid">
+<span class="sig-name descname"><span class="pre">GetVid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetVid" title="永久链接至目标"></a></dt>
+<dd><p>Gets the id of the vertex currently pointed to.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether this iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next indexed vid.
+If there is no more vertex within the specified key range, the iterator becomes invalid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator" title="永久链接至目标"></a></dt>
+<dd><p>VertexIterator can be used to retrieve info of a vertex, or to scan through multiple vertices.
+Vertexes are sorted in ascending order of the their ids.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Delete" title="永久链接至目标"></a></dt>
+<dd><p>Deletes current vertex.
+The iterator will point to the next vertex if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetAllFields" title="永久链接至目标"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetField" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetId">
+<span class="sig-name descname"><span class="pre">GetId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the integer id of this vertex.
+GraphDB assigns an integer id for each vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetInEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the first in-coming edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the in-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabel" title="永久链接至目标"></a></dt>
+<dd><p>Gets the label name of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the label id of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumInEdges">
+<span class="sig-name descname"><span class="pre">GetNumInEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumInEdges" title="永久链接至目标"></a></dt>
+<dd><p>Gets the number of in-coming edges of this vertex.
+n_limit specifies the maximum number of edges to scan.
+Returns a tuple containing the number of in-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumOutEdges">
+<span class="sig-name descname"><span class="pre">GetNumOutEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumOutEdges" title="永久链接至目标"></a></dt>
+<dd><p>Gets the number of out edges of this vertex.
+n_limit specifies the maximum number of vids to scan.Returns a tuple containing the number of out-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetOutEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the first out-going edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the out-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Goto" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the vertex specified by vid.
+If nearest==true, go to the nearest vertex with id&gt;=vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListDstVids">
+<span class="sig-name descname"><span class="pre">ListDstVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListDstVids" title="永久链接至目标"></a></dt>
+<dd><p>Lists all destination vids of the out edges.
+n_limit specifies the maximum number of vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListSrcVids">
+<span class="sig-name descname"><span class="pre">ListSrcVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListSrcVids" title="永久链接至目标"></a></dt>
+<dd><p>Lists all source vids of the in edges.
+n_limit specifies the maximum number of src vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next vertex with id&gt;{current_vid}.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetField" title="永久链接至目标"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of current vertex, including properties and edges.</p>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..77b549c5dc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,25 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python存储过程接口
+====================================
+Version: 4.2.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+介绍
+------------------
+与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。
+
+这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。
+
+接口
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..1db9127da9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,19 @@
+# Rust 存储过程
+
+## 1. 介绍
+Rust 存储过程目前仅支持v1版本，TuGraph能够支持一切编译成动态库的语言作为插件。Rust语言作为系统编程语言的新起之秀，在安全性上、可靠性以及人体工程学上相较于C++具有较大优势。
+
+我们提供了TuGraph的[Rust binding]库来支持在Rust中调用lgrahp api，同时提供[tugraph-plugin-util] 工具库来帮助大家更加简洁地编写Rust插件代码。
+
+[Rust binding]: https://crates.io/crates/tugraph
+[tugraph-plugin-util]: https://crates.io/crates/tugraph-plugin-util
+
+## 2. 如何使用
+
+Rust存储过程的使用分三步：
+* 编译，从rust源码编译出so库。我们准备了一份一站式的插件编写教程，从IDE的插件安装，环境配置，到编译，详细参考`rust-tugraph-plugin-tutorial`。
+* 加载，将so库加载到服务端，可以通过REST或RPC接口，这一步和C++库的使用方式类似，可以参考[文档](1.procedure.md)。
+* 运行，和c++ procdure使用方式相同，不在赘述。
+
+## 3.API文档
+Rust社区习惯，所有的代码和文档都可以从[`crates.io`](https://crates.io/crates/tugraph )以及[`docs.rs`](https://docs.rs/tugraph/latest/tugraph )找到。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..3463d60bfd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.2.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = Chinese
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..27a86697ca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..81b77be986
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..418a3cad66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,207 @@
+# OLAP API
+
+> 本文档是为TuGraph的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对TuGraph的图计算运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于Tugraph的一个简单的[BFS(宽度优先搜索)](https://en.wikipedia.org/wiki/Breadth-first_search "wikipedia")程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图分析引擎介绍
+
+TuGraph的图分析引擎，面向的场景主要是全图/全量数据分析类的任务。借助TuGraph的 C++ / Python 图分析引擎 API ，用户可以对不同数据来源的图数据快速导出一个待处理的复杂子图，然后在该子图上运行诸如PageRank、LPA、WCC等迭代式图算法，最后根据运行结果做出相应的对策。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph图计算系统社区版内置6个算法，商业版内置了25种算法，用户几乎不需要自己实现具体的图计算过程。其详细介绍可参考algorithms.md。
+
+根据数据来源及实现不同，可分为Procedure、Embed和Standalone三种运行方式，均继承于OlapBase API，OlapBase API接口文档可参考olapbase-api.md。
+
+其中Procedure和Embed的数据来源是图数据库中预加载的db数据，可以分别编译生成tugraph-web加载使用的.so文件和后台终端使用的embed文件，输入的图数据均通过db的加载形式，其接口文档可参考olapondb-api.md。
+Standalone用于编译生成standalone文件，区别于前者，该文件的输入图数据通过txt、二进制、ODPS文件的形式加载，其接口文档可参考olapondisk-api.md。
+
+## 2. Procedure 编译与运行
+
+该种方式主要用于tugraph-web界面进行可视化加载及运行。使用方法如下：
+
+### C++:
+在tugraph-db/procedures 目录下执行`bash make_so_cpp.sh bfs`即可在tugraph-db/procedures目录下得到bfs.so文件，将该文件以插件形式上传至tugraph-web，输入参数后即可执行。
+
+### Python:
+在tugraph-web的前端将python文件以插件形式上传，输入参数后即可执行。
+
+示例：
+在tugraph-db/procedures 编译.so算法文件
+`bash make_so_cpp.sh bfs`
+
+将bfs.so（或tugraph-db/procedures/algo_cython/bfs.py）文件以插件形式加载至tugraph-web后，输入如下json参数：
+
+```json
+{
+    "root_id":"0",
+    "label":"node",
+    "field":"id"
+}
+```
+即可得到返回结果如下。
+
+```json
+{
+  "core_cost": 0.013641119003295898,
+  "found_vertices": 3829,
+  "num_edges": 88234,
+  "num_vertices": 4039,
+  "output_cost": 8.821487426757813e-06,
+  "prepare_cost": 0.03479194641113281,
+  "total_cost": 0.04844188690185547
+}
+```
+
+输出内容解释如下：
+- core_cost: 表示算法运行所需要的时间。
+- found_vertices: 表示查找到点的个数。
+- num_edges: 表示该图数据的边数量。
+- num_vertices: 表示该图数据点的数量。
+- output_cost: 表示算法结果写回db所需要的时间。
+- prepare_cost: 表示预处理阶段所需要的时间。预处理阶段的工作：加载参数、图数据加载、索引初始化等。
+- total_cost: 表示执行该算法整体运行时间。
+
+make_so.sh文件介绍：该文件用于将TuGraph-OLAP所涉及到的图算法文件编译成一个可供tugraph-web使用的.so文件。
+
+## 3. Embed 编译与运行
+
+该种方式主要用于TuGraph在后台程序中对预加载的db图数据进行算法分析。其使用方法如下：
+在tugraph-db/procedures 目录下对embed_main.cpp文件完善，补充数据名称、输入参数、数据路径等信息，示例如下：
+
+### C++:
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path表示预加载图数据存放的路径
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // 指定图数据的名称
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // 以json形式输入算法参数
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+保存后在tugraph-db/procedures 目录下执行`bash make_embed.sh bfs`即可在tugraph-db/procedures/algo_cpp 目录下得到bfs_procedure文件。
+
+在tugraph-db/procedures 文件夹下执行`./algo_cpp/bfs_procedure` 即可得到返回结果：
+
+```json
+{
+  "core_cost":0.025603055953979492,
+  "found_vertices":3829,
+  "num_edges":88234,
+  "num_vertices":4039,
+  "output_cost":9.059906005859375e-06,
+  "prepare_cost":0.056738853454589844,
+  "total_cost":0.0823509693145752
+}
+```
+
+参数解释同上。
+
+### Python：
+在tugraph-db/procedures文件夹下执行
+`bash make_so_cython.sh bfs`
+或在tugraph-db/procedures/algo_cython文件夹下执行
+`python3 setup.py build_ext -i`
+得到bfs.so后，在Python中import bfs可使用，如tugraph-db/procedures/run_embed.py所示
+
+```python
+# tugraph-db/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+```
+通过如下命令执行
+
+```bash
+python3 run_embed.py
+```
+
+输出结果与C++相同。
+
+## 4. Standalone 编译与运行
+
+该文件主要用于在终端处直接加载图数据，并运行打印输出结果。使用方法如下：
+在tugraph-db/build目录下执行`make bfs_standalone` (需要在g++默认include路径中包含boost/sort/sort.hpp)即可得到bfs_standalone文件,该文件生成于tugraph-db/build/output/algo文件夹下。
+运行方式：在tugraph-db/build目录下执行`./output/algo/bfs_standalone -–type [type] –-input_dir [input_dir] --id_mapping [id_mapping] -–vertices [vertices] --root [root] –-output_dir [output_dir]`即可运行。
+
+- `[type]`：表示输入图文件的类型来源，包含text文本文件、BINARY_FILE二进制文件和ODPS源。
+- `[input_dir]`：表示输入图文件的文件夹路径，文件夹下可包含一个或多个输入文件。TuGraph在读取输入文件时会读取[input_dir]下的所有文件，要求[input_dir]下只能包含输入文件，不能包含其它文件。参数不可省略。
+- `[id_mapping]`：当读入边表时，是否对输入数据做id映射，使达到符合算法运行的形式。1为需要做id映射，0为不需要做。该过程会消耗一定时间。参数可省略，默认值为0。
+- `[vertices]`：表示图的点个数，为0时表示用户希望系统自动识别点数量；为非零值时表示用户希望自定义点个数，要求用户自定义点个数需大于最大的点ID。参数可省略，默认值为0。
+- `[root]`：表示进行bfs的起始点id。参数不可省略。
+- `[output_dir]`：表示输出数据保存的文件夹路径，将输出内容保存至该文件中，参数不可省略。
+
+示例：
+
+### C++:
+在tugraph-db/build编译standalone算法程序
+
+```bash
+make bfs_standalone
+```
+
+在tugraph-db/build/output目录下运行text源文件
+
+```bash
+./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+得到运行结果：
+
+```text
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+结果参数解释同上。
+
+对于新的算法，运行时不了解该算法的所需参数时，可通过`./output/algo/bfs_standalone -h`进行查阅对应参数。
+
+### Python:
+Python语言的bfs拓展编译过程与embed模式无区别，在运行时通过`Standalone`接口调用，示例如下：
+```python
+# tugraph-db/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(input_dir=
+                             "../test/integration/data/algo/fb_unweighted",
+                             root=0)
+```
+
+通过如下命令执行
+
+```bash
+python3 run_standalone.py
+```
+
+至此，通过TuGraph对上图进行bfs运算的过程已经完成。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..6991d63290
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,179 @@
+# OlapBase API
+
+> 此文档主要详细介绍了OlapBase API的使用说明
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统需要的简单配置，同时结合代码对TuGraph中几个共同的重要文件和接口进行解释。
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+
+## 3. 原子操作
+
+TuGraph使用了多线程技术进行批处理操作，在这种情况下可能会出现访存冲突现象。为了保证并行计算时修改操作的正确性，TuGraph实现了原子操作。代码部分见lgraph文件夹下的lgraph_atomic.cpp文件。
+TuGraph还自定义了4个常用的原子操作。当我们需要在多线程模式下修改点的数据时，我们都应该使用原子操作来确保并行环境下修改操作的正确性。除了这4个原子操作外，用户也可以使用“cas”来构建自己的原子操作函数。
+
+- `bool cas(T * ptr, T oldv, T newv)`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `bool write_min(T *a, T b)`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `bool write_max(T *a, T b)`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `void write_add(T *a, T b)`：将b的值加到a指向的值上。
+- `void write_sub(T *a, T b)`：将a指向的值减去b的值。
+
+## 4. 点集合类ParallelBitset
+
+在使用TuGraph进行批处理操作时，需要使用点集合来表示需要处理的点。ParallelBitset实现了点集合类，以bit为单位表示点，因此能够节省大量内存。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 4.1 ParallelBitset类成员
+
+- `size_t Size()`：表示Bitmap中的点个数。
+- `ParallelBitset(size_t size)`：初始化size和data，data长度为(size >> 6)+1
+- `void Clear()`：清空集合
+- `void Fill()`：将所有点加入集合
+- `bool Has(size_t i)`：检查点i是否在集合中
+- `bool Add(size_t i)`：将点i加入集合中
+- `void Swap(ParallelBitset &other)`：和另一组ParallelBitset集合交换元素
+
+## 5. 点数组类ParallelVector
+
+在使用TuGraph进行批处理操作时，需要使用点数组来表示对点的处理结果。ParallelVector实现了点数组类。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 5.1 ParallelVector类成员
+
+- `ParallelVector(size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `T &operator[](size_t i)`：下标为i的数据
+- `T *begin()`：ParallelVector的起始指针
+- `T *end()`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `T &Back()`：ParallelVector最后一个数据
+- `T *Data()`：表示数组本身数据
+- `void Destroy()`：清空ParallelVector数组内数据并删除数组
+- `size_t Size()`：表示ParallelVector中的数据个数
+- `size_t Capacity()`：表示ParallelVector的容量大小
+- `void Resize(size_t size)`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `void Clear()`：清空ParallelVector内数据
+- `void ReAlloc(size_t capacity)`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `void Fill(T elem)`：为ParallelVector的全部数据赋值为elem
+- `void Append(const T &elem, bool atomic = true)`：向ParallelVector结尾添加一个数据
+- `void Swap(ParallelVector<T> &other)`：和其他的ParallelVector交换数据
+- `ParallelVector<T> Copy()`：复制当前的ParallelVector数据存至Copy数组中
+
+## 6. 自定义数据结构
+
+### 6.1 基本数据类型
+
+我们自定义了点和边的数据结构表示，用于在覆盖所有点的同时节省内存空间：
+
+- `Empty`：内容为空的特殊数据类型。
+
+### 6.2 组合数据结构
+
+为了便于计算，我们根据计算场景不同，定义了几种点和边数据的数据结构，分别是：
+
+- `EdgeUnit<EdgeData>`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+  - `size_t src`：边的起始点
+  - `size_t dst`：边的终点
+  - `EdgeData edge_data`：边的权值
+- `AdjUnit<EdgeData>`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+  - `size_t neighbour`：边的邻居点
+  - `EdgeData edge_data`：边的权值
+- `AdjList<EdgeData>`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+  - `AdjUnit<T> * begin`：列表的起始指针
+  - `AdjUnit<T> * end`：列表的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对邻接表进行循环访问。
+
+## 7. 图类OlapBase
+
+图类OlapBase是TuGraph用于加载图以及进行图计算操作的主类，常用OlapBase<EdgeData>表示权值类型为EdgeData的图，代码部分见lgraph文件夹下的olap_base.hpp。本章将介绍Graph类中常用的类型和API接口。上文介绍Procedure、Embed及Standalone功能所使用的类均为该类的子类。
+
+### 7.1 基本信息
+
+- `size_t NumVertices()`：获取点数
+- `size_t NumEdges()`：获取边数
+- `size_t OutDegree(size_t vid)`：点vid的出度
+- `size_t InDegree(size_t vid)`：点vid的入度
+
+### 7.2 点集和边集及其相关操作
+
+- `ParallelVector<VertexData> AllocVertexArray<VertexData>()`：分配一个类型为VertexData的数组，大小为点个数
+- `void fill_vertex_array<V>(V * array, V value)`：将数组array中的所有元素赋值为value
+- `ParallelBitset AllocVertexSubset()`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `AdjList<EdgeData> OutEdges(size_t vid)`：获取点v的所有出边集合
+- `AdjList<EdgeData> InEdges(size_t vid)`：获取点v的所有入边集合
+- `void Transpose()`：对有向图进行图反转
+- `LoadFromArray(char * edge_array, VertexId input_vertices, EdgeId input_edges,  EdgeDirectionPolicy edge_direction_policy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+  - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+  - `input_vertices`：指定数组读入图的点个数。
+  - `input_edges`：指定数组读入图的边的条数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+### 7.3 锁机制
+
+TuGraph实现了一对锁机制，来控制程序对于点数据的访存权限。分别是：
+
+- `void AcquireVertexLock(size_t vid)`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(size_t vid)`：对点vid解锁，所有线程均可访存该锁对应的点数据
+- `VertexLockGuard GuardVertexLock(size_t vid)`：在对vid操作时，对点vid加锁，退出作用域时时自动释放锁
+
+### 7.4 批处理操作
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程。分别是：
+
+```c++
+/*
+    函数名称:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+    第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考include/lgraph/olap_base.h中具体代码
+
+    使用示例:统计数组parent数组中有出边的点个数
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+其中graph为图类OlapBase的实例化对象
+
+```C++
+/*
+    函数名称:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+    第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考/include/lgraph/olap_base.h中具体代码
+    
+    使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..1e94fb946e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,296 @@
+# OlapOnDB API
+
+> 此文档主要详细介绍了OlapOnDB API的使用说明
+
+
+## 1. 简介
+
+一般用户需要自己实现的只是将需要分析的子图抽取出来的过程。用户也可以通过使用TuGraph中丰富的辅助接口实现自己的图分析算法。
+
+该文档主要介绍Procedure及Embed的接口设计，并介绍部分常用接口，具体的接口信息参见include/lgraph/olap_on_db.h文件。
+
+## 2. 模型
+
+Procedure及Embed使用到的辅助函数主要包含在OlapOnDB类，还有一些使用频率较高的函数都会逐一介绍
+
+在TuGraph中OLAP相关的有以下常用的数据结构：
+
+1. DB图分析类 `OlapOnDB<EdgeData>`
+2. 点数组`ParallelVector<VertexData>`
+3. 点集合`ParallelBitset`
+4. 边数据结构`AdjUnit/AdjUnit<Empty>`
+5. 边集合数据结构`AdjList<EdgeData>`
+
+### 2.1 基于快照的存储结构
+
+TuGraph中的OlapOnDB类能够提供数据“快照”，即建立一个对指定数据集的完全可用拷贝，该拷贝包括相应数据在某个时间点（拷贝开始的时间点）的镜像。由于OLAP的操作仅涉及读操作而不涉及写操作，OlapOnDB会以一种更紧凑的方式对数据进行排布，在节省空间的同时，提高数据访问的局部性。
+
+### 2.2 BSP计算模型
+
+TuGraph在计算的过程中使用了BSP（Bulk Synchronous Parallel）模型，使得该过程能够并行执行，极大的提高了程序运行效率。
+
+BSP计算模型的核心思路为超步（Super Step）的提出和使用。在OlapOnDB创建后，在该数据上的计算分为多个超步，比如PageRank，分为多轮迭代，每轮迭代就是一个超步。不同超步之间用存在显式同步，从而保证所有线程在完成同一超步后同时进入下一个超步。在一个超步内部，所有的线程异步执行，利用并行提升计算效率。
+
+利用BSP计算模型能够有效避免死锁，通过障碍同步的方式能够以硬件方式实现粗粒度的全局同步，使得图计算能够并行化执行，而程序员无需在同步互斥上大费周章。
+
+## 3. 算法举例
+
+在这里对PageRank算法分块做解释，大体上分为主函数`Process`和PageRank算法流程`PageRank`函数
+
+### 3.1 主函数
+
+主函数输入有三个参数，`TuGraph`数据库参数`db`，从网页端获取的请求`request`，给网页端的返回值`response`，整体流程可以分为一下几步：
+
+1. 相关参数的获取
+2. 快照类的创建
+3. PageRank算法主流程
+4. 网页端返回值的获取和发送
+
+```C++
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+    
+    // 从网页端请求中获取迭代次数（num_iterations），
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // 读事务的创建以及快照类的创建
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+	
+    // 创建pr数组用于存储每个节点的pr值
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank算法主流程，获取每个节点的pagerank值
+    PageRankCore(olapondb, num_iterations, pr);
+    
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        函数用途：从所有节点中获取pagerank值最大的节点编号
+    
+        函数流程描述：该函数对点集合all_vertices中所有为1的位对应的节点vi（又称为活跃点）执行Func A，再将Func A的返回值作为Func B的第二个输入参数，得到局部最大值（因为第一个输入参数为0，因此实际上返回值就是每个节点的pagerank值），最后再将所有线程的返回值汇总，再次 执行Func B得到全局返回值，并存入max_pr_vi变量中
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+        
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+        
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+    
+    // 网页端返回值的获取和发送
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2 PageRank算法流程
+
+`pagerank`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关数据结构的初始化
+1. 每个节点pagerank值的初始化
+1. 每个节点pagerank值的计算，活跃点为所有点（意味着所有点都需要计算pagerank值）
+1. 得到每个节点经过`num_iterations`次迭代后的pagerank值
+
+```C++
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+    
+    // 相关数据结构的初始化
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // 每个节点pagerank值的初始化，和该节点的出度成反比
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // 总迭代过程
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            函数用途：计算所有节点的pagerank值
+
+            函数流程描述：该函数用于计算所有节点的pagerank值，对all_vertices中所有为1的位对应的节点vi执行Func C，得到本轮迭代中vi的pagerank值，并返回vi节点的pagerank变化值，最终经过函数内部处理汇总所有活跃节点的总变化值并返回，该值被存储在delta变量中
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // 从邻居中获取当前节点的pagerank值
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank值计算核心公式
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+    
+                    // 相关中间变量统计
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // 将本轮迭代得到的pagerank值输出作为下一轮迭代的输入
+        curr.Swap(next);
+    }
+}
+```
+
+## 4. 其他常用函数功能描述
+
+### 4.1 事务的创建
+
+```C++
+//读事务的创建
+auto txn = db.CreateReadTxn();
+
+//写事务的创建
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2 并行化创建有向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3 并行化创建无向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED
+)
+```
+
+### 4.4 获取出度
+
+```C++
+size_t OutDegree(size_t vid)
+```
+
+### 4.5 获取入度
+
+```C++
+size_t InDegree(size_t vid)
+```
+
+### 4.6 获取出边集合
+
+```C++
+/*
+    函数名称：AdjList<EdgeData> OutEdges(size_t vid)
+    数据结构:
+        AdjList 可以理解为类型为AdjUnit结构体的数组
+        AdjUnit 有两个成员变量： 1. size_t neighbour 2. edge_data，其中neighbour表示该出边指向的目标节点编号，如果为有权图，则edge_data数据类型和输入文件中边的权重值相同，否则数据类型为Empty
+
+    使用示例：输出节点vid的所有出度邻居
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7 获取入边集合
+
+```C++
+AdjList<EdgeData> InEdges(size_t vid)
+
+// 使用示例：输出节点vid的所有入度邻居
+for (auto & edge : olapondb.InEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8 获取TuGraph中节点对应OlapOnDB的节点编号
+
+```C++
+size_t OriginalVid(size_t vid)
+
+// 备注： TuGraph中输入的节点编号可以是非数字，比如人名等，在生成OlapOnDB子图的时候，会将人名等转化为数字进行后续处理，因此该方法可能不适用于某些特定场景
+```
+
+### 4.9 获取OlapOnDB中节点对应TuGraph的节点编号
+
+```C++
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10 活跃点的描述
+
+活跃点指的是在批处理函数中需要处理的点，在本例子中只是输出了活跃点的编号，并且汇总活跃点的数量：
+
+```C++
+ParallelBitset temp = 000111;	//当前活跃点为3，4，5号点
+
+size_t delta = ForEachActiveVertex<double>(
+    //void c
+    [&](size_t vi) {
+        printf("active_vertexId = %lu\n",vi);
+        return 1;
+    },
+    all_vertices
+);
+```
+
+函数的运行结果显而易见，因为多线程的关系，一下输出顺序可能有所变化：
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+局部返回值均为1，该函数会在保证线程安全的情况下将所有的局部返回值累加得到最终的返回值，并存储在`delta`变量中，该值最终为3
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..1ece4cc8e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,202 @@
+# OlapOnDisk API
+
+> 此文档主要详细介绍了OlapOnDisk API的使用说明
+
+    
+## 1. 简介
+
+TuGraph的Standalone模式可用于加载图数据文件，其中图数据文件来源可包含text文本文件、BINARY_FILE二进制文件和ODPS源。在该模式下，TuGraph可实现多数据来源快速加载成图，然后在该图上运行如BFS、WCC、SSSP等迭代式算法，并输出最终结果至终端。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph内置了大量的常见图分析算法和丰富的辅助接口，因此用户几乎不需要自己实现具体的图计算过程，只需要在实现自己的存储过程的时候将相应算法库的头文件(.h)包含到自己的程序中，并在编译阶段链接自己的动态库文件即可。
+
+该文档主要介绍了Standalone的常用接口，使用到的辅助函数主要包含在OlapOnDB类。同时为帮助用户理解方便，对BFS算法进行举例说明。
+
+## 2. 算法举例
+
+在这里对BFS算法分块做解释，大体上分为主函数`main`、BFS算法流程`BFSCore`函数和配置类MyConfig。
+
+### 2.1 头文件
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //使用 TuGraph 时需要包含的头文件
+#include "./algo.h"   //包含各种算法逻辑函数的头文件
+```
+
+在使用 TuGraph 实现图数据文件计算应用时，一般首先建立StandaloneGraph类对象graph，将图文件数据加载进graph中，之后通过调用图逻辑函数实现图计算过程，最后对图计算的结果进行打印输出。
+
+### 2.2 配置类MyConfig
+
+MyConfig配置类函数用于提供算法逻辑计算时所需的配置信息，继承于ConfigBase<EdgeData>,其中EdgeDate可根据加载图类型不同选择Empty（无权图）、int（带权图权重为整数）或者double（带权图权重为double）类型。
+
+MyConfig配置类一般根据算法不同，需要额外配置信息如下：
+
+1.算法所需参数
+2.算法名称
+3.配置类内Print函数
+其余公用成员继承与ConfigBase，可参考src/olap/olap_config.h查阅。
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // 算法所需参数初始化
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // 配置文件接受命令行参数，该用例会顺次读取命令行调用算法时的参数，优先使用用户指定数值，若用户并未指定则选择默认参数。
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+### 2.3 主函数
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // 统计内存消耗类MemUsage实例化
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // 配置类MyConfig实例化
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk类实例化
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // 统计图加载消耗时间
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // 创建数组用于统计某节点是否遍历过
+    auto parent = graph.AllocVertexArray<size_t>();
+    // 宽度优先搜索算法，返回图内root_vid根结点连接的节点个数
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // 打印相关信息至终端
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+### 2.4 bfs算法流程
+
+`bfs`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关定义、数据结构的初始化
+2. 使用批处理函数对每个节点进行循环计算，每一轮找到与当前节点相邻的全部节点，并在该轮次终止时进行交换。
+3. 直到找到全部节点，返回节点个数discovered_vertices。
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //分配数组，active_in用于存放上一循环阶段已找到的节点
+  active_in.Add(root);            //把跟节点加入数组中
+  auto active_out = graph.AllocVertexSubset();  //分配数组active_out用于存放当前循环阶段找到的节点
+  parent.Fill((size_t)-1);               //将parent数组中的节点赋值为-1，-1表示未被找到
+  parent[root] = root;
+  size_t num_activations = 1;       //表示当前循环阶段找到的节点个数
+  size_t discovered_vertices = 0;    //表示当前循环阶段找到节点的总个数
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations表示当前循环阶段找到的节点个数
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices表示当前循环阶段找到节点的总个数
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //每一次循环从根节点出发，查找邻近的相邻节点，对其parent值改变，并num_activations+1操作
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //存放当前循环阶段找到的节点
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // 返回全部节点数
+  return discovered_vertices;
+}
+```
+
+## 3. 其他常用函数功能描述
+
+### 3.1 图加载
+
+TuGraph-Standalone对于图数据文件的加载来源主要分为三大类：文本文件、二进制文件和ODPS。二进制文件为将边数据的二进制表示按顺序排列的文件，能够节省大量存储空间。其加载函数分为三种，分别是：
+
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：图数据文件的加载方式，包含两个参数，其含义分别表示：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。其中DUAL_DIRECTION为默认的图加载方式。
+  DUAL_DIRECTION : 输入文件为非对称图，加载图为非对称图。
+  MAKE_SYMMETRIC : 输入文件为非对称图，加载图为对称图。
+  INPUT_SYMMETRIC : 输入文件为对称图，加载图为对称图。
+  对应的详细介绍见lgraph文件夹下的olap_config.h文件的`enum EdgeDirectionPolicy`。
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：将文件中的点-数据对按照点id的顺序加载到数组中。各参数表示意义分别为：
+  - `array`：待读入数据的数组
+  - `path`：读取文件的路径，文件中每行表示一对点-数据对
+  - `parse_line`：用户自定义函数，告诉系统如何将一行文本数据解析为一个点-数据对。
+
+
+### 3.2 图写入
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：把array中数据写回文件中，各参数表示意义分别是：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `array`：待写入数据的数组
+  - `array_size`：待写入数据的数字长度
+  - `name`：算法名称
+  - `filter_output`：写入数据规则函数，待写入数据需要满足该函数的要求。
+
+### 3.3 图解析函数
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：对图数据文件进行解析，加载图为无权图。
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：对图数据文件进行解析，加载图为有权图，权重数据类型可以通过修改<EdgeData>指定。
+
+该函数可通过MyConfig类定义时的构造函数parse_line进行指定。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..0ca16518f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,428 @@
+# Python Olap API
+
+> 本文档主要介绍 OlapBase OlapOnDB 和 OlapOnDisk 在Python中的API用法
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统Python接口需要的简单配置，同时结合代码对TuGraph Python API进行解释。关于ParallelBitset、OlapBase各类的作用，详见olap-base-api.md，olap-on-db-api.md和olap-on-disk-api.md
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+- Cython，版本要求3.0.0以上，已测试可运行版本为3.0.0a11
+
+## 3. Cython
+Cython是一种高效的编程语言，是Python的超集。Cython能将py文件翻译为C/C++代码后编译为Python拓展类，在Python中通过import调用。在TuGraph中，所有的Python plugin都由Cython编译为Python拓展类后使用。
+
+Cython的Pure Python模式在保证Python语法的同时具有C/C++的性能，TuGraph Python接口均使用Cython实现。
+
+[Cython 文档](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+见procedures/algo_cython/olap_base.pxd文件，用法与功能基本与C++接口相同，olap_base.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### 原子操作
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `write_min[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_max[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_add[T](a: cython.pointer(T), b: T)-> cython.bint`：将b的值加到a指向的值上。
+- `write_sub[T](a: cython.pointer(T), b: T)-> cython.bint`：将a指向的值减去b的值。
+
+### 点集合类ParallelBitset
+- `Size()-> size_t`：表示Bitmap中的点个数。
+- `ParallelBitset(size: size_t)`：初始化size和data，data长度为(size >> 6)+1
+- `Clear()-> cython.void`：清空集合
+- `Fill()-> cython.void`：将所有点加入集合
+- `Has(size_t i)-> cython.bint`：检查点i是否在集合中
+- `Add(size_t i)-> cython.bint`：将点i加入集合中
+- `Swap(ParallelBitset &other)-> cython.void`：和另一组ParallelBitset集合交换元素
+
+### 点数组类ParallelVector
+- `ParallelVector[T](size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `operator[](i: size_t)-> T`：下标为i的数据
+- `begin()-> cython.pointer(T)`：ParallelVector的起始指针
+- `end()-> cython.pointer(T)`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `Back()-> T`：ParallelVector最后一个数据
+- `Data()-> cython.pointer(T)`：表示数组本身数据
+- `Destroy()-> cython.void`：清空ParallelVector数组内数据并删除数组
+- `Size()-> size_t`：表示ParallelVector中的数据个数
+- `Resize(size: size_t)-> cython.void`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `Clear()-> cython.void`：清空ParallelVector内数据
+- `ReAlloc(capacity: size_t)-> cython.void`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `Fill(elem: T)-> cython.void`：为ParallelVector的全部数据赋值为elem
+- `Append(elem: T, atomic: cython.bint = true)-> cython.void`：向ParallelVector结尾添加一个数据
+- `Swap(other: ParallelVector[T])-> cython.void`：和其他的ParallelVector交换数据
+- `Copy()-> ParallelVector[T]`：复制当前的ParallelVector数据存至Copy数组中
+
+### 自定义数据结构
+- `Empty`：内容为空的特殊数据类型。
+- `EdgeUnit[EdgeData]`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+    - `src: size_t`：边的起始点
+    - `dst: size_t`：边的终点
+    - `edge_data: EdgeData`：边的权值
+- `AdjUnit[EdgeData]`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+    - `neighbour: size_t`：边的邻居点
+    - `edge_data: EdgeData`：边的权值
+- `AdjList[EdgeData]`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+    - `begin()-> cython.pointer(AdjUnit[T])`：列表的起始指针
+    - `end()-> cython.pointer(AdjUnit[T])`：列表的结束指针。
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: 下标为i的数据
+
+### 图类OlapBase
+- `NumVertices()-> size_t`：获取点数
+- `NumEdges()-> size_t`：获取边数
+- `OutDegree(size_t vid)-> size_t`：点vid的出度
+- `InDegree(size_t vid)-> size_t`：点vid的入度
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`：分配一个类型为VertexData的数组，大小为点个数
+- `AllocVertexSubset()-> ParallelBitset`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有出边集合
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有入边集合
+- `Transpose()-> cython.void`：对有向图进行图反转
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+    - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+    - `input_vertices`：指定数组读入图的点个数。
+    - `input_edges`：指定数组读入图的边的条数。
+    - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`：对点vid解锁，所有线程均可访存该锁对应的点数据
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程，在Python中与C++使用方法稍有不同。
+
+```python
+# 函数名称:ProcessVertexInRange[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           lower: size_t, upper: size_t,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#     函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+#     第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#     具体实现请参考include/lgraph/olap_base.h中具体代码
+#
+#     使用示例:统计数组parent数组中有出边的点个数
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython. pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython. pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+其中g为图类OlapBase的实例化对象
+
+```python
+# 函数名称:ProcessVertexActive[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           active: ParallelBitset,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#   函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+#   第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#   具体实现请参考/include/lgraph/olap_base.h中具体代码
+#
+# 使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self.graph.OutDegree(vi)
+        dst: size_t
+        edges = self.graph.OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbour
+            printf("node %lu has neighbour %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+如上面两个例子所展示，在Python中ProcessVertexActive与ProcessVertexInRange比在C++中额外需要一个算法类指针参数，Work函数一般也作为该算法类的成员函数，满足Work函数访问成员变量的需求（如图graph，点数组parent），在调用批处理函数时将Work函数和算法类的self指针传入批处理函数。
+
+其中Work函数会在多线程中调用，因此加上修饰器`@cython.nogil`释放Python全局解释锁，在多线程执行的代码中（例如批处理函数中的Work函数，`cython.parallel.prange`中），不能包含Python对象，最好通过`dst: type`或者`dst = cython.declare(type)`的方式声明变量为C/C++类型。
+
+### 图类OlapOnDB:
+并行化创建有向图：
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+并行化创建无向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING创建有向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### 图类OlapOnDisk
+
+#### ConfigBase：
+- `ConfigBase()`: 构造函数
+- `std::string input_dir`: 图边表数据路径
+- `std::string output_dir`: 输出结果路径
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: 读入图数据
+
+
+## 5. lgraph_db API
+见procedures/algo_cython/lgraph_db.pxd与lgraph_db_python.py文件。
+
+lgraph_db.pxd中接口用法与功能基本与C++接口相同，lgraph_db.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: 获取点的vid
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: 设置用户
+- `SetUser(user: std::string)-> cython.void`: 设置用户
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: 创建GraphDB
+
+### GraphDB：
+- `CreateReadTxn()-> Transaction`: 创建只读事务
+- `CreateWriteTxn()-> Transaction`: 创建写事务
+- `ForkTxn(txn: Transaction)-> Transaction`: 复制事务，只能复制读事务
+
+### Transaction：
+```
+GetVertexIndexIterator(
+                label: std::string,
+                field: std::string,
+                key_start: std::string,
+                key_end: std::string)-> VertexIndexIterator
+```
+获取索引迭代器。迭代器的field值为 [key_start, key_end]。所以在key_start=key_end=v时，返回指向field值为v的点的迭代器
+
+lgraph_db_python.py是lgraph_db.pxd中C++类 Galaxy与GraphDB的包装，将C++类包装为Python类，将lgraph_db_python.py编译为Python拓展后，可以直接在Python文件或Python命令行中`import lgraph_db_python`访问lgraph_db_python.PyGraphDB与PyGraphDB.PyGalaxy。
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(self, user: str password: str)-> void`: 设置用户
+- `SetUser(self, user: std::string)-> void`: 设置用户
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: 创建PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)-> cython.Py_ssize_t`: C++ 类GraphDB的地址
+
+## 6. 算法插件示例
+下面为Python实现的BFS算法的代码示例：
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# 注释作用如下：
+# language_level=3: 使用Python3
+# cpp_locals=True: 需要c++17，使用std::optional管理Python代码中的C++对象，可以避免C++对象的拷贝构造
+# boundscheck=False: 关闭索引的边界检查
+# wraparound=False: 关闭负数下标的处理（类似Python List）
+# initializedcheck=False: 关闭检查内存是否初始化，关闭检查后运行性能更快
+# language = c++: 将此py文件翻译为C++而不是C文件，TuGraph使用大量模板函数，所以都应该使用C++
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# 从procedures/algo_cython/ 中cimportolap_base.pxd与lgraph_db.pxd, 类似C++中#include "xxx.h"
+
+from cython.cimports.libc.stdio import printf
+# 类似C++中#include <stdio.h>
+# 其他常见的还有cython.cimports.libcpp.unordered_map等
+
+import time
+import lgraph_db_python
+
+
+@cython.cclass
+# cython.cclass 表示BFSCore为C类型的Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty])表示OlapBase[Empty]的指针，类似C++中OlapBase[Empty]*
+    # cython提供了常见类型的指针，如cython.p_int, cython.p_char等，表示int*, char*, ...
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t 声明root为C++ size_t类型变量，等效于root = cython.declare(size_t)
+    # 不声明类型的变量为Python object类型
+    # 声明变量类型会大幅提高性能，同时在多线程部分，只有C/C++类型的变量可以访问
+
+    @cython.cfunc
+    # cython.cfunc 表示Work为C类型的函数，参数与返回值应声明
+    # cfunc性能好，能接受C/C++对象为参数、返回值，但是不能在其他python文件中调用
+    # 类似的有cython.ccall，如Standalone函数，可以在其他python文件中调用
+    @cython.nogil
+    # cython.nogil 表示释放Python全局解释锁，在nogil修饰的部分，不能访问Python对象
+    # 在多线程部分，都应有nogil修饰器
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) 表示禁用异常传播，将忽略函数内部引发的Python异常
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbour
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 表示dst没有被bfs访问过
+                if self.active_out.Add(dst):
+                    # 将dst设置为为活跃节点；ParallelBitmap.Add为原子操作，防止重复计算
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython.size_t:
+        self.graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self.parent.Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self.active_in.Add(self.root)
+        while num_activations > 0:
+            self.active_out.Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self.active_out.Swap(self.active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time.time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # 并行创建OlapOnDB
+    # Cython不支持如 *db 的解引用操作，通过db[0]来解引用
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # 通过 GetVertexIndexIterator 根据root节点label名和filed名与filed值（root_id）
+    # 获取root节点的迭代器，通过迭代器获取vid，在无ID_MAPPING时，该vid与OlapOnDB中的id相同
+    cost = time.time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time.time()
+    count = a.run(cython.address(olapondb), root_vid)
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb.NumVertices()
+    response["num_edges"] = olapondb.NumEdges()
+    return True
+
+
+@cython.ccall
+def Standalone(input_dir: str, root: size_t):
+    # Standalone为Standalone模式下插件入口，用cython.ccall修饰
+    # 可以任意设置参数，相应修改procedures/algo_cython/run_standalone.py即可
+    cost = time.time()
+    graph = OlapOnDisk[Empty]()
+    config = ConfigBase[Empty]()
+    config.input_dir = input_dir.encode("utf-8")
+    # config为C++类，config.input_dir为std::string，Python str需要encode才能传给std::string
+    graph.Load(config, DUAL_DIRECTION)
+    # 读入图
+    cost = time.time() - cost
+    printf("load_cost = %lf s\n", cython.cast(cython.double, cost))
+
+    cost = time.time()
+    a = BFSCore()
+    count = a.run(cython.address(graph), root)
+    # cython.address(graph)，取址，类似C++中&graph
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    print("find {} vertices".format(count))
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process为embed模式和procedure模式下插件入口，用cython.ccall修饰
+    # Process函数必须名为Process，参数为lgraph_db_python.PyGraphDB与bytes
+    # 返回值必须为(bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # 获取PyGraphDB中GraphDB对象的地址，转换为指针后传递
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..7bf7f3ebf1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,189 @@
+# 内置算法
+
+> 此文档主要详细介绍了TuGraph内置的算法程序，社区版6种算法可参考基础算法报
+
+## 简介
+
+TuGraph目前包含以下6个基础算法28种扩展算法，共34个图算法：
+
+### 基础算法包：
+| 中文算法名 | 英文算法名 | 程序名
+|  :----:  | :----: | :----: |
+| 广度优先搜索 | Breadth-First Search  | bfs 
+| 网页排序 | Pagerank | pagerank 
+| 单源最短路径 | Single-Source Shortest Path | sssp 
+| 弱连通分量 | Weakly Connected Components | wcc 
+| 平均集聚系数 | Local Clustering Coefficient  | lcc
+| 标签传播 | Label Propagation Algorithm | lpa 
+
+### 扩展算法包：
+| 中文算法名 | 英文算法名 | 程序名
+| :----: | :----: | :----: |
+| 全对最短路径 | All-Pair Shortest Path  | apsp 
+| 介数中心度 | Betweenness Centrality | bc 
+| 置信度传播 | Belief Propagation | bp
+| 距离中心度 | Closeness Centrality | clce
+| 共同邻居 | Common Neighborhood | cn 
+| 度数关联度 | Degree Correlation  | dc
+| 直径估计 | Dimension Estimation | de 
+| EgoNet算法 | EgoNet | en
+| 超链接主题搜索 | Hyperlink-Induced Topic Search | hits
+| 杰卡德系数 | Jaccard Index | ji
+| K核算法 | K-core | kcore
+| 鲁汶社区发现 | Louvain | louvain 
+| 多源最短路径 | Multiple-source Shortest Paths | mssp
+| 个性化网页排序 | Personalized PageRank | ppr
+| 强连通分量 | Strongly Connected Components | scc 
+| 监听标签传播 | Speaker-listener Label Propagation Algorithm | slpa
+| 两点间最短路径 | Single-Pair Shortest Path | spsp
+| 三角计数 | Triangle Counting | triangle 
+| 信任指数排名 | Trustrank | trustrank 
+| 带权重的标签传播 | Weighted Label Propagation Algorithm | wlpa 
+| 带权重的网页排序 | Weighted Pagerank Algorithm | wpagerank 
+| 最大独立集算法 | Maximal independent set | mis 
+| sybil检测算法 | Sybil Rank | sybilrank 
+| 子图匹配算法 | Subgraph Isomorphism | subgraph_isomorphism
+| 模式匹配算法 | Motif | motif
+| k阶团计数算法 | Kcliques | kcliques
+| k阶桁架计数算法 | Ktruss | ktruss 
+| 莱顿算法 | Leiden | leiden
+
+## 基础算法包
+
+### 广度优先搜索
+
+广度优先搜索实现了Breadth-first Search算法，从根点开始，沿着图的宽度遍历所有可访问点。返回结果为遍历点个数。算法内容请参考 [https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 网页排序
+
+网页排序程序实现了常用的Pagerank算法。该算法根据图中边和边权值计算所有点的重要性排名，PageRank值越高，表示该点在图中的重要性越高。计算时以点数量的倒数为各点初始Rank值，然后将点的Rank值按照出边平均传递到相邻点，重复该传递过程直到满足给定的收敛阈值或达到给定迭代轮数。每轮传递结束后，所有点的Rank值会有一定的的比例随机传递到任意点上。算法内容请参考 [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 单源最短路径
+
+单源最短路径实现了Single Source Shortest Path算法，根据给定的源点，计算从该源点出发到其他任意点的最短路径长度。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 弱连通分量
+
+弱连通分量程序实现了Weakly Connected Components算法，该算法会计算图中所有的弱连通分量。弱连通分量是图的一个子图，子图中任意两点之间均存在可达路径。算法内容请参考[https://en.wikipedia.org/wiki/Connected_component_(graph_theory)](https://en.wikipedia.org/wiki/Connected_component_(graph_theory) "scc wiki")。
+
+### 平均集聚系数
+
+平均集聚系数程序实现了Local Clustering Coefficient算法，计算图中点之间聚集程度的系数。返回结果包括整体集聚系数和点集聚系数。整体集聚系数反映了图中整体的集聚程度的评估，点集聚系数包括任意点的集聚系数，反映了该点附近的集聚程度。集聚系数越高，表示集聚程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 标签传播
+
+标签传播算法程序实现了Label Propagation Algorithm算法。该算法是基于标签传播的社区发现算法，计算对象为无权图。在标签传递时，每个点对收到的所有标签进行次数累加，在累加和最高的标签中随机选择一个。迭代收敛或执行到给定轮数后算法终止。最终输出结果为每个点的标签，标签值相同的点视为在同一社区。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+
+## 扩展算法包
+
+### 全对最短路径
+
+全对最短路径程序实现了All-Pair Shortest Path算法，计算图中任意两点间的最短路径。返回结果为任意存在路径的点对之间的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 介数中心度
+
+介数中心度程序实现了Betweenness Centrality算法，估算图中所有点的介数中心度值。介数中心度值反映了图中任一最短路径经过该点的可能性，值越高表示有越多的最短路径经过了该点。计算时需给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 置信度传播
+
+置信度传播程序实现了Belief Propagation算法。该算法给定已观测点的边缘分布，利用点之间相互传递消息的机制来估算未观测点的边缘分布。算法内容请参考[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 距离中心度
+
+距离中心度程序实现了Closeness Centrality算法，估算任意点到图中其他点的最短路径的平均长度。距离中心度越小，表示该点到其他点的平均最短距离最小，意味着该点从几何角度看更位于图的中心位置。计算时需要给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki")。
+
+### 共同邻居
+
+共同邻居程序实现了Common Neighborhood算法，计算任意给定相邻点对之间的共同邻居数量。计算时给定待查询的若干个点对，返回结果为待查询的任意点对的共同邻居数量。
+
+### 度数关联度
+
+度数关联度程序实现了Degree Correlation算法，通过计算任意相邻点对之间的Pearson关联系数来计算图的度数关联度，可用来表征图中高度数点之间关联程度。度数关联度越高，表示图中高度数点之间的关联程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 直径估计
+
+直径估计程序实现了Dimension Estimation算法。该算法会计算图中最长的最短路径长度，用来表征图的直径大小。算法内容请参考[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### EgoNet算法
+
+EgoNet算法需要给定根点和K值，以根点为源点进行宽度优先搜索，找出所有K度以内的邻居组成的子图。找到的子图称为根点的EgoNet。
+
+### 超链接主题搜索
+
+超链接主题搜索算法实现了Hyperlink-Induced Topic Search算法，该算法假定每个点具有权威性Authority和枢纽性Hub两个属性，一个好的枢纽点应该指向许多高权威性的点，而一个良好的权威点应该被许多高枢纽型的点指向。算法将返回每个点的权威性值和枢纽性值。算法内容请参考[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 杰卡德系数
+
+杰卡德系数程序实现了Jaccard Index算法。该算法计算了给定点对之间的Jaccard系数，可用来表示这两个点的相似度。Jaccard系数越高，表示点对之间的相似程度越高。计算时给定带查询的若干点对，返回结果为这些点对的Jaccard系数。算法内容请参考[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### k核算法
+
+k核算法实现了k-core算法。该算法计算所有点的核数，或找出图中所有的K核子图。K核子图是一种特殊子图，子图中任意点度数都不小于给定K值。算法内容请参考 [https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)](https://en.wikipedia.org/wiki/Degeneracy_(graph_theory) "kcore wiki")。
+
+### 鲁汶社区发现
+
+鲁汶社区发现程序实现了Fast-unfolding算法。该算法是基于模块度的社区发现算法，通过不断合并点社区来最大化图的模块度，能够发现层次性的社区结构。算法内容请参考 [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 多源最短路径
+
+多源最短路径程序实现了Multiple-source Shortest Paths算法，根据给定的多个源点，从这些源点出发，计算到达任意点的最短路径值。其中，多个源点到某一点的最短路径值为分别从每个源点出发到达该点的最短路径的最小值。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 个性化网页排序
+
+个性化网页排序程序实现了Personalized PageRank算法。该算法根据给定的源点，基于该源点个性化计算所有点对于源点的重要性排名。Rank值越高，表示该点对于源点越重要。与PageRank不同的是，初始化时源点Rank值为1，其余点Rank值为0；并且每轮传递结束后，Rank值会有一定的比例随即传递回源点。算法内容请参考 [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 强连通分量
+
+强连通分量程序实现了Strongly Connected Components算法。该算法计算了图中所有的强连通分量，强连通分量是图的一个子图，子图中可从任意点出发到达其他任意点。算法内容请参考[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 监听标签传播
+
+监听标签传播算法程序实现了Speaker-listener Label Propagation Algorithm算法。该算法是基于标签传播和历史标签记录的社区发现算法，是对标签传播算法的扩展。与标签传播算法不同的是，本算法会对所有点记录其历史标签，在迭代中对标签进行累加时，会将历史标签也计算在内。最终输出结果为每个点的所有历史标签记录。算法内容请参考论文：“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 两点间最短路径
+
+两点间最短路径程序实现了Bidirectional Breadth-First Search算法，在有向无权图上从起点沿着出边做正向宽度优先搜搜，从终点沿着入边做反向宽度优先搜索，通过起点和终点共同遍历到的点来确定从起点到终点的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 三角计数
+
+三角计数实现了Triangle-counting算法，计算无向图中的三角形个数，可用来表征图中点的关联程度。三角形数越多，表示图中点的关联程度越高。算法内容请参考论文：“Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study” 。
+
+### 信任指数排名
+
+信任指数排名算法实现了Trustrank算法，可以根据给定的白名单，计算任意点的信任指数。信任指数越高，表示该点为非法点的可能性越小。算法内容请参考 [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 带权重的标签传播
+
+带权重的标签传播算法程序实现了Weighted Label Propagation Algorithm算法。=与标签传播算法不同的是，标签的传递跟边的权重相关，在标签传递时，每个点会根据标签的入边进行权重累加，在累加和最高的标签中随机选择一个。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 带权重的网页排序
+
+带权重的网页排序算法程序实现了Weighted Pagerank算法。与PageRank算法不同的是，Rank值的传递跟边的权重有关，点的Rank值将按照边权重加权传递到相邻点。算法内容请参考[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 最大独立集算法
+
+最大独立集算法实现了Maximal independent set算法。最大独立集是指在这个独立集之外没有可以加入它的点。一个图可能有许多大小差异很大的 MIS，算法找出其中一个。算法内容请参考 [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### Sybil检测算法
+
+Sybil检测算法实现了Sybil Rank算法。SybilRank算法从非Sybil节点开始进行提前终止的随机游走。算法内容请参考论文：“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 子图匹配算法
+
+子图匹配算法实现了subgraph_isomorphism算法。subgraph_isomorphism算法对全图所有节点匹配子图，最后输出每个节点被匹配的次数。算法内容参考 [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 模式匹配算法
+
+模式匹配算法实现了motif算法。motif算法对指定的节点匹配k阶子图，最后输出每个指定节点每种k阶子图个数，每个k阶子图用一个64位整数表示，整数的第$i \times k + j$位为1表示子图中有边i->j。算法内容参考 [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### k阶团计数算法
+
+k阶团计数算法实现了k-cliques算法。k-cliques算法对计算图中所有的k阶完全子图的个数，最后输出每个节点所在的k阶完全子图个数。算法内容参考 [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### k阶桁架计数算法
+
+k阶桁架计数算法实现了k-truss算法。k-truss指每条边都至少是k-2个三角形的边的子图。k-truss算法找出图的k-truss子图，最后输出每个节点在子图中的邻居节点列表。算法内容参考 [https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+### 莱顿算法
+
+莱顿算法实现了了leiden算法。leiden算法是基于模块度的社区发现算法，与louvain算法优势在于leiden算法检测出社区中的断链，保证每个社区具有良好的连通性。算法内容参考 [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..bc80c68c65
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+分析接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..46813c7cca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,83 @@
+# Learn Tutorial
+
+> 本文档是为 TuGraph 的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对 TuGraph 的图学习运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于 Tugraph 的一个简单的程序实例，我们将重点介绍其使用方式。
+
+## 1.TuGraph 图学习模块简介
+图学习是一种机器学习方法，其核心思想是利用图结构中的拓扑信息，通过顶点之间的联系及规律来进行数据分析和建模。不同于传统机器学习方法，图学习利用的数据形式为图结构，其中顶点表示数据中的实体，而边则表示实体之间的关系。通过对这些顶点和边进行特征提取和模式挖掘，可以揭示出数据中深层次的关联和规律，从而用于各种实际应用中。
+
+这个模块是一个基于图数据库的图学习模块，主要提供了四种采样算子：Neighbor Sampling、Edge Sampling、Random Walk Sampling 和 Negative Sampling。这些算子可以用于对图中的顶点和边进行采样，从而生成训练数据。采样过程是在并行计算环境下完成的，具有高效性和可扩展性。
+
+在采样后，我们可以使用得到的训练数据来训练一个模型。该模型可以用于各种图学习任务，比如预测、分类等。通过训练，模型可以学习到图中的顶点和边之间的关系，从而能够对新的顶点和边进行预测和分类。在实际应用中，这个模块可以被用来处理各种大规模的图数据，比如社交网络、推荐系统、生物信息学等。
+
+## 2. 运行流程
+TuGraph 图学习模块将TuGraph中的图数据采样，采样后的顶点和边作为图学习的特征，进行学习训练。运行流程如下图所示：
+![Alt text](../../../../images/learn_flow_chart_zh.png)
+
+## 3.TuGraph编译及数据准备
+TuGraph编译请参考：[编译](../../5.installation&running/6.compile.md)
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+## 4. 数据导入
+数据导入请参考[数据导入](../../6.utility-tools/1.data-import.md)
+
+导入过程以cora数据集为例：
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+## 5. feature特征转换
+由于图学习中的feature特征一般表示为较长的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+## 6. 采样算子及编译
+TuGraph在cython层实现了一种获取全图数据的算子及4种采样算子，具体如下：
+### 6.1.采样算子介绍
+| 采样算子 | 采样方式 |
+| --- | --- |
+| GetDB | 从数据库中获取图数据并转换成所需数据结构 |
+| Neighbor Sampling | 根据给定的顶点采样其邻居顶点，得到采样子图 |
+| Edge Sampling | 根据采样率采样图中的边，得到采样子图 |
+| Random Walk Sampling | 根据给定的顶点，进行随机游走，得到采样子图 |
+| Negative Sampling | 生成不存在边的子图。 |
+
+### 6.2.编译
+如果TuGraph已编译，可跳过此步骤。
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+得到算子so后，在Python中import 即可使用。
+
+## 7. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+## 8. 模型加载
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+在使用保存的模型之前，首先需要对其进行加载。代码中，使用如上的代码对已训练模型进行加载。
+
+加载之后，我们可以使用模型对新的顶点和边进行预测和分类。在预测时，我们可以输入一个或多个顶点，模型将输出相应的预测结果。在分类时，我们可以将整个图作为输入，模型将对图中的顶点和边进行分类，以实现任务的目标。
+使用已训练的模型可以避免重新训练模型的时间和资源消耗。此外，由于模型已经学习到了图数据中顶点和边之间的关系，它可以很好地适应新的数据，从而提高预测和分类的准确度。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..2a1c0ac8d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,97 @@
+# Sampling API
+
+> 此文档主要详细介绍了Sampling API的使用说明
+
+## 1. 概述
+
+本手册介绍使用TuGraph的Sampling API接口。
+
+## 2. 图数据预处理
+在采样操作之前，根据图数据路径加载图数据，并映射成olapondb图分析类，代码如下：
+
+```python
+galaxy = PyGalaxy(args.db_path) # 根据路径创建一个galaxy实例
+galaxy.SetCurrentUser(args.username, args.password) # 设置当前用户
+db = galaxy.OpenGraph('default', False) # 打开图数据库指定db
+txn = db.CreateReadTxn() # 创建一个事务实例
+olapondb = PyOlapOnDB('Empty', db, txn) # 根据图加载方式、图数据库实例、事务实例实例化OlapOnDB
+del txn
+del db
+del galaxy
+```
+## 3. 图采样算子介绍
+图采样算子在cython层实现，用于对输入的图进行采样处理，生成的NodeInfo用于保存feature属性、label属性等点信息，EdgeInfo用于保存边信息，这些元数据信息可以被用于特征抽取、网络嵌入等任务中。目前TuGraph图学习模块支持GetDB、NeighborSampling、EdgeSampling、RandomWalkSampling、NegativeSampling五种采样算子。
+### 3.1.RandomWalk算子：
+在给定的采样点周围进行指定次数的随机游走，得到采样子图。
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+step: size_t类型，采样步数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.2.NeighborSample算子：
+在给定采样点的一度邻居中采样一定数量的点，得到采样子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+nei_num: size_t类型，邻居采样点数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.3.Nagetive算子：
+采用负采样算法，生成不存在边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+num_samples: size_t类型，生成不存在边的数量。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值： 无。
+
+### 3.4.EdgeSampling算子：
+根据边采样率，生成采样边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list,EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_rate: double类型，采样率。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.5.GetDB算子：
+从数据库中获取图数据并转换成所需数据结构。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+## 4. 用户自定义采样算法
+用户也可以通过TuGraph Olap接口实现自定义采样算法，接口文档参见[此处](../2.olap/5.python-api.md)，该文档主要介绍图采样算法使用的相关函数的接口设计。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..c8dd5e8e1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,101 @@
+# Training
+
+> 本文档详细介绍了如何使用TuGraph进行图神经网络（GNN）的训练。
+
+## 1. 训练
+使用TuGraph 图学习模块进行训练时，可以分为全图训练和mini-batch训练。
+全图训练即把全图从TuGraph db加载到内存中，再进行GNN的训练。而mini-batch训练则使用上面提到的TuGraph 图学习模块的采样算子，将全图数据进行采样后，再送入训练框架中进行训练。
+## 2. Mini-Batch训练
+Mini-Batch训练需要使用TuGraph 图学习模块的采样算子，目前支持Neighbor Sampling、Edge Sampling、Random Walk Sampling和Negative Sampling。
+TuGraph 图学习模块的采样算子进行采样后的结果以List的形式返回。
+下面以Neighbor Sampling为例，介绍如何将采样后的结果，进行格式转换，送入到训练框架中进行训练。
+用户需要提供一个Sample类：
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. 加载图数据
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+
+        # 2. 采样方法，结果存储在NodeInfo和EdgeInfo中
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+
+        # 3. 对结果进行格式转换，使之符合训练格式
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+如代码所示，首先将图数据加载到内存中。然后使用采样算子对图数据进行采样，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+最后对结果进行格式转换，使之符合训练格式。这里我们使用的是DGL训练框架，因此使用结果数据构造了DGL Graph，最终将DGL Graph返回。
+我们提供TuGraphSample类之后，就可以使用它进行Mini-Batch训练了。
+令DGL的数据加载部分使用TuGraphSample的实例sampler：
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+使用DGL进行模型训练：
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+
+## 3. 全图训练
+GNN（图神经网络）的全图训练是一种涉及一次处理整个训练数据集的训练。它是 GNN 最简单、最直接的训练方法之一，整个图被视为单个实例。 在全图训练中，整个数据集被加载到内存中，模型在整个图上进行训练。这种类型的训练对于中小型图特别有用，并且主要用于不随时间变化的静态图。
+在算子调用时，使用以下方式：
+```python
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+获取全图数据，然后将全图送入训练框架中进行训练。
+完整代码：请参考learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..b5c8888189
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,102 @@
+# Heterogeneous Graph
+
+> 本文档介绍如何使用异质图进行训练。
+
+## 1. 异质图简介
+异质图（Heterogeneous Graph）是指由不同类型的节点和边构成的图结构。在异质图中，节点和边可以具有多样化的属性和关系，代表了不同实体以及它们之间的复杂关联。
+
+在异质图中，节点类型可以代表不同的实体，如用户、商品、话题等，而边类型表示不同实体之间的关系，如用户之间的关注关系、用户与商品之间的购买关系等。节点和边可以具有不同的属性。
+
+异质图提供了一种强大的图模型，能够更好地表达和分析具有多种类型实体和复杂关系的现实世界系统。在不同领域的数据分析和应用中，异质图具有广泛的应用前景和研究价值。
+
+## 2. 异质图创建
+在TuGraph中，一个异构图由一系列边关系构成。每个关系由一个字符串三元组定义 (源节点类型, 边类型, 目标节点类型) 。异质图的创建方式与同质图类似，只是在创建图时需要指定字符串三元组定义。如下所示。
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+其中，第四个参数为异质图的边关系定义，可以通过该参数，指定筛选的异质图点边类型。如果不指定该参数，则默认将全部点边类型的数据进行构图训练。
+
+## 3. 异质图查询接口
+为了方便用户使用，当用户给定第四个参数时，TuGraph提供了查询异质图点边类型的接口。示例如下所示：
+
+### 3.1 点类型查询接口
+```python
+olapondb.ntypes()
+```
+返回值为点类型列表，如['node1', 'node2', 'node3']。
+
+### 3.2 边类型查询接口
+```python
+olapondb.etypes()
+```
+返回值为边类型列表，如['edge1', 'edge2', 'edge3']。
+
+### 3.3 点类型和边类型查询接口
+```python
+olapondb.metagraph()
+```
+返回值为字符串三元组定义 (源节点类型, 边类型, 目标节点类型)，如
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')]。
+
+## 4. 异质图输出格式
+和同质图相同的是，异质图的采样数据结果也存储在NodeInfo和EdgeInfo中。
+可通过如下方式获取输出数据。
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+其中getdb为获取全图数据的函数，db为图数据库实例，olapondb为图分析类。feature_len为节点特征长度，NodeInfo和EdgeInfo为输出的节点和边信息。
+
+其存储信息结果如下：
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 边类型 | EdgeInfo[2] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+| 顶点类型 | NodeInfo[3] |
+
+## 5. 异质图训练
+异构图训练的目标是学习图中节点和边的表示，以便于进行后续的任务，如节点分类、链接预测、图聚类等。为了实现这一目标，研究者们提出了多种基于图神经网络（Graph Neural Networks，GNNs）的模型。这些模型通过聚合邻居节点的信息来更新节点的表示，进而捕捉图结构中的复杂关系。
+
+由于异构图中包含多种类型的节点和边，因此在设计GNN模型时需要考虑如何处理这些不同类型的信息。一种常见的方法是设计不同的聚合函数来分别处理不同类型的邻居节点。此外，还需要考虑如何将这些不同类型的信息整合到一起，以便于模型能够有效地学习到节点和边的表示。
+
+TuGraph 提供了使用裁剪版ogbn-mag数据集进行异质图训练的方法，可供使用者参考。
+
+TuGraph提供的官方docker中暂未提供异质图训练的环境，因此需要用户自行安装相关依赖包。
+在训练之前需要下载ogb和pandas包，具体安装方式如下：
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+训练代码如下所示：
+
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+全部训练代码可参考tugraph/learn/examples/train_full_mag.py文件。
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..e79e36ea91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+图学习
+======
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..d4c9759490
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+存储过程和分析接口
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/conf.py b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/conf.py
new file mode 100644
index 0000000000..34515a01b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.2.0/zh-CN/source/index.rst b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/index.rst
new file mode 100644
index 0000000000..6834fd569c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.2.0/zh-CN/source/index.rst
@@ -0,0 +1,23 @@
+TuGraph高性能图数据库
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile
new file mode 100644
index 0000000000..f60cfe1f1a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-CPP-Procedure-API/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.3.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-CPP-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-CPP-Procedure-API/run.sh
new file mode 100644
index 0000000000..e2455bfbc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-CPP-Procedure-API/run.sh
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+# 0. install: yum install doxygen, graphviz
+# 1. run this script
+doxygen Doxyfile
diff --git a/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/Makefile b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/Makefile
new file mode 100644
index 0000000000..e58ac30a31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+SPHINXPROJ    = TuGraph
+SOURCEDIR     = .
+BUILDDIR      = _build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/conf.py b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/conf.py
new file mode 100644
index 0000000000..8af367a431
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/conf.py
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+#
+# Configuration file for the Sphinx documentation builder.
+#
+# This file does only contain a selection of the most common options. For a
+# full list see the documentation:
+# http://www.sphinx-doc.org/en/master/config
+
+# -- Path setup --------------------------------------------------------------
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#
+import os
+import sys
+sys.path.insert(0, os.path.abspath('../../../build/output/'))
+
+
+# -- Project information -----------------------------------------------------
+
+project = u'TuGraph'
+copyright = u'2018-2022, Ant Group'
+author = u'Ant Group'
+
+# The short X.Y version
+version = u''
+# The full version, including alpha/beta/rc tags
+release = u''
+
+
+# -- General configuration ---------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#
+# needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.autodoc',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+#
+# source_suffix = ['.rst', '.md']
+source_suffix = '.rst'
+
+# The master toctree document.
+master_doc = 'index'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+# This pattern also affects html_static_path and html_extra_path .
+exclude_patterns = [u'_build', 'Thumbs.db', '.DS_Store']
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+
+# -- Options for HTML output -------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+#
+html_theme = 'nature'
+#html_theme = 'haiku'
+#html_theme = 'pyramid'
+#html_theme = 'sphinxdoc'
+#html_theme = 'bizstyle'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#
+# html_theme_options = {}
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Custom sidebar templates, must be a dictionary that maps document names
+# to template names.
+#
+# The default sidebars (for documents that don't match any pattern) are
+# defined by theme itself.  Builtin themes are using these templates by
+# default: ``['localtoc.html', 'relations.html', 'sourcelink.html',
+# 'searchbox.html']``.
+#
+# html_sidebars = {}
+
+
+# -- Options for HTMLHelp output ---------------------------------------------
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'TuGraphdoc'
+
+
+# -- Options for LaTeX output ------------------------------------------------
+
+latex_elements = {
+    # The paper size ('letterpaper' or 'a4paper').
+    #
+    # 'papersize': 'letterpaper',
+
+    # The font size ('10pt', '11pt' or '12pt').
+    #
+    # 'pointsize': '10pt',
+
+    # Additional stuff for the LaTeX preamble.
+    #
+    # 'preamble': '',
+
+    # Latex figure (float) alignment
+    #
+    # 'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'TuGraph.tex', u'TuGraph Documentation',
+     u'Ant Group', 'manual'),
+]
+
+
+# -- Options for manual page output ------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'tugraph', u'TuGraph Documentation',
+     [author], 1)
+]
+
+
+# -- Options for Texinfo output ----------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'TuGraph', u'TuGraph Documentation',
+     author, 'TuGraph', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+
+# -- Extension configuration -------------------------------------------------
diff --git a/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/index.rst b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/index.rst
new file mode 100644
index 0000000000..18529f2a3b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/index.rst
@@ -0,0 +1,37 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+TuGraph Procedure API - Python
+====================================
+Version: 4.3.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Noe4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
+
+
+Indices and tables
+-------------------
+
+* :ref:`genindex`
+* :ref:`modindex`
+* :ref:`search`
diff --git a/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/make.bat b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/make.bat
new file mode 100644
index 0000000000..b1d0c9a1dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=.
+set BUILDDIR=_build
+set SPHINXPROJ=TuGraph
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.http://sphinx-doc.org/
+	exit /b 1
+)
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/run.sh
new file mode 100755
index 0000000000..d10e0a2b1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/autogen/TuGraph-Python-Procedure-API/run.sh
@@ -0,0 +1,7 @@
+# 0. install sphinx-build: yum install python3-sphinx
+# 1. default lgrpah module path: ../../../build/output/lgraph_python.so
+# 2. make lgraph_python
+# 3. run this script
+rm output -rf
+mkdir -p _static _templates
+sphinx-build -W -b html . output
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/.readthedocs.yaml b/docs/docusaurus/versions/version-4.3.0/en-US/.readthedocs.yaml
new file mode 100644
index 0000000000..92cd0965f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/en-US/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/Makefile b/docs/docusaurus/versions/version-4.3.0/en-US/Makefile
new file mode 100644
index 0000000000..a4de0bff18
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?= -W
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/make.bat b/docs/docusaurus/versions/version-4.3.0/en-US/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/1.guide.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/1.guide.md
new file mode 100644
index 0000000000..365e928583
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/1.guide.md
@@ -0,0 +1,76 @@
+# Guide
+
+> Here is the document map that helps users learn and use the TuGraph community version quickly.
+
+## Quick Start
+
+> Understand [What is a Graph](./2.introduction/1.what-is-graph.md),[The application scenarios of graph](./2.introduction/8.scenarios.md),[What is TuGraph](./2.introduction/3.what-is-tugraph.md).
+
+> Quickly Install and deploy TuGraph:[Cloud Deployment](5.installation&running/5.cloud-deployment.md),[Docker Deployment](5.installation&running/3.docker-deployment.md)Rapid deployment TuGraph.
+
+> Quickly get started with DEMO:[Movie](./3.quick-start/2.demo/1.movie.md),[The Wandering Earth](./3.quick-start/2.demo/2.wandering-earth.md),[Three Body](./3.quick-start/2.demo/3.the-three-body.md),[Three Kingdoms](./3.quick-start/2.demo/4.three-kingdoms.md).
+
+> User Guide:[TuGraph Browser](./4.user-guide/1.tugraph-browser.md),[TuGraph Browser Legacy](./4.user-guide/2.tugraph-browser-legacy.md).
+
+## Development Guide
+
+> Client Tools: [Bolt Client](7.client-tools/5.bolt-client.md).
+
+> TuGraph Query Language:[Cypher API](8.query/1.cypher.md).
+
+> Procedure And Algorithm:[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md).
+
+> C++/Python Procedure Interfaces:[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## Community Contribution
+
+> Before starting to contribute, you can learn [how to contribute](12.contributor-manual/1.contributing.md)
+
+> If you want to understand the division of community roles, please visit [community roles](12.contributor-manual/2.community-roles.md)
+
+## Main warehouse
+
+> TuGraph-DB repository: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> Visual interface: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java client: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> Simple test method based on twitter data: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> Test method based on standard LDBC-SNB: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics repository: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## Video Center
+
+> [Get started quickly with TuGraph](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph technology sharing collection](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [Understand graph calculation in 3 minutes](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph-Latest-Version
+
+| Description | File | Link |
+|---------------------|--------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 runtime package | tugraph-4.3.0-1.el7.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-4.3.0-1.el7.x86_64.rpm) |
+| CentOS8 runtime package | tugraph-4.3.0-1.el8.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-4.3.0-1.el8.x86_64.rpm) |
+| Ubuntu18.04 runtime package | tugraph-4.3.0-1.x86_64.deb | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-4.3.0-1.x86_64.deb) |
+| CentOS7 runtime image | tugraph-runtime-centos7-4.3.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-runtime-centos7-4.3.0.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7) |
+| CentOS8 runtime image | tugraph-runtime-centos8-4.3.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-runtime-centos8-4.3.0.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8) |
+| Ubuntu18.04 runtime image | tugraph-runtime-ubuntu18.04-4.3.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-runtime-ubuntu18.04-4.3.0.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04) |
+| CentOS7 mini runtime package | tugraph-mini-4.3.0-1.el7.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-4.3.0-1.el7.x86_64.rpm) |
+| CentOS8 mini runtime package | tugraph-mini-4.3.0-1.el8.x86_64.rpm | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-4.3.0-1.el8.x86_64.rpm) |
+| Ubuntu18.04 mini runtime package | tugraph-mini-4.3.0-1.x86_64.deb | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-4.3.0-1.x86_64.deb) |
+| CentOS7 mini runtime image | tugraph-mini-runtime-centos7-4.3.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-runtime-centos7-4.3.0.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7) |
+| CentOS8 mini runtime image | tugraph-mini-runtime-centos8-4.3.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-runtime-centos8-4.3.0.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8) |
+| Ubuntu18.04 mini runtime image | tugraph-mini-runtime-ubuntu18.04-4.3.0.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-runtime-ubuntu18.04-4.3.0.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 compilation image | tugraph-compile-centos7-1.2.9.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.2.9.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos7) |
+| CentOS8 compilation image | tugraph-compile-centos8-1.2.9.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.2.9.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos8) |
+| Ubuntu18.04 compilation image | tugraph-compile-ubuntu18.04-1.2.9.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.2.9.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04) |
+
+
+For the version update log, see: [Link](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md).
+
+If you don't know how to use installation packages and images, please refer to [Environment and Version Selection](13.best-practices/4.selection.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..c04cb1030c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/1.privilege.md
@@ -0,0 +1,141 @@
+# Privilege
+
+## 1.Introduce
+
+> The permissions of TuGraph are managed based on role-based access control. The permissions that define access control are assigned to roles, and the roles are then assigned to users.
+
+## 2.Level of permissions
+
+- Global layer: indicates global permissions, which have permissions for management and graph operations.
+- Graph layer: control permissions on each graph;
+- Property level (Commercial version only) : control permissions on a property
+
+## 3.Permission keyword
+
+At present, the control of permissions is relatively simple
+
+- The Global layer currently has admin permission, and the admin user is preset.
+
+* The Graph layer has four operation permissions: none, read, write, and full
+
+- none: No permission, no operation permission for the graph
+- read: Read-only permission, only has read permission for the graph
+- write: Read and write permission, not only has read permission for the graph, but also has write permission
+- full: All permissions, not only have read and write permissions for graphs, but also have permissions to delete graphs, modify graphs, and modify schemas
+
+* The Property layer (Commercial version only)  has the following permissions: none, read, and write
+
+- none: No permission, no operation permission for the property
+- read: Read-only permission, only has read permission for the property
+- write: Read and write permission, not only has read permission for the property, but also has write permission
+
+## 4.Common permission operations
+
+### 4.1.User action
+
+- Creating a user
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- Deleting a user
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- Change the password of the current user
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- Changes the password of a specified user
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- Disable or enable a user
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- List all users
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- Lists the current user information
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- Obtain user details
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.Role actions
+
+- Create a role
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- Delete a role
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- List all characters
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- Disable or enable the role
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.Assign roles to users
+
+- Adds the association between the user and the role
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- Deletes the association between the user and the role
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- Clears the relationship between user roles and rebuilds them
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.Role empowerment
+
+- Modifies the access permission of a role to a specified graph
+
+```cypher
+CALL dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP)
+```
+
+Example
+
+```cypher
+CALL dbms.security.modRoleAccessLevel("test_role", {test_graph1:"FULL", test_graph2:"NONE"})
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/2.token.md
new file mode 100644
index 0000000000..dd4ac2e2e5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/2.token.md
@@ -0,0 +1,42 @@
+# Token Usage Guide
+## 1. Introduction to Token
+JWT (JSON Web Token) is an open standard used for authentication and authorization. It is based on the JSON (JavaScript Object Notation) format and is designed for securely transmitting claim information between network applications.
+
+JWT consists of three parts: the header, payload, and signature. The header contains the type of JWT and the signature algorithm used, the payload contains the information to be transmitted, and the signature is used to verify the integrity and authenticity of the JWT.
+
+In TuGraph, JWT is used to implement a stateless authentication and authorization mechanism. After a user logs in successfully, the server generates a JWT and returns it to the client. The client passes this JWT as an identity credential in subsequent requests to the server. Upon receiving the JWT, the server verifies the signature and parses the information in the payload to determine the user's identity and permissions, and decides whether to allow the execution of the request.
+
+## 2. Token Expiration
+### 2.1. Browser Token Interaction Logic
+1. The user opens the browser, enters the username and password, and clicks login.
+2. The frontend calls the login interface and inputs the account and password to the backend.
+3. After receiving the account and password, the backend verifies them and returns a Token.
+4. The frontend stores the Token in the browser cache, and all subsequent requests must carry this Token.
+5. If the frontend actively clicks logout or closes the page, it should actively call the logout interface and pass the Token to the backend.
+6. After receiving the Token, the backend invalidates it, returns a status code 200, and "logout successful". After receiving the message, the frontend clears the Token in the browser memory, and returns to the login page.
+7. The Token expires (initially set to 24 hours), and the user needs to log in again.
+### 2.3. Token Expiration Refresh Mechanism
+Token expiration has a refresh mechanism that is turned off by default. If turned on, the security of the Token will be higher, and there will be two timestamps.
+
+The first timestamp `refresh_time` is used to determine whether the Token has expired (default 24 hours): after expiration, the refresh interface can be called to obtain a new Token, which can be set to a shorter time, such as 1 hour.
+
+The second timestamp `expire_time` is the forced expiration timestamp (default 24 hours): after expiration, the user must log in again.
+
+### 2.4. Token Expiration Modification
+To facilitate developers to develop on their own, TuGraph provides two ways to modify the expiration time, both of which require admin privileges.
+
+* Set through the interface call. The interfaces involved in modifying the expiration time are `update_token_time` and `get_token_time` for querying the expiration time. For details, please refer to the [REST interface document](../7.client-tools/9.restful-api-legacy.md).
+* Set through startup parameters. When the server-side is started, adding the parameter `-unlimited_token 1` can set the Token to be unlimited. Please refer to the [service running document](../5.installation&running/7.tugraph-running.md) for details.
+## 3. Introduction to Token-Related Requests Sent by Clients
+The client handles two types of protocol-related requests: REST and RPC.
+
+### 3.1. REST
+If the client uses the REST protocol (including the browser), because it is a short connection, Token needs to be carried in every request, and a new Token needs to be obtained after it expires.
+
+For self-developed clients, if the REST protocol is used, Token logic needs to be considered.
+
+### 3.2. RPC
+If the client uses the RPC protocol (including the official C++/Java/Python), it uses a long connection to maintain, and no Token operation is involved after login.
+
+## 4. Token upper limit
+The upper limit of Token refers to the maximum number of Tokens that a user can own at the same time. To prevent unlimited logins, the upper limit of Token is 10000 by default. Since the token generation logic is strongly related to time, a token will be generated for storage every time you log in. The validity period of the token is 24 hours by default. Therefore, it is recommended to log out the unused token in time after login.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..706d377c16
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,20 @@
+# Forgot Admin Password
+> TuGraph provides a password reset feature. If you forget the password for the admin account, you can reset it by following these steps.
+
+## 1. Reset Password
+First, stop the TuGraph server.
+
+When starting the TuGraph server again, add the following parameter:
+```bash
+--reset_admin_password 1
+```
+
+Here is an example:
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+This operation will reset the password for the admin account to the default password: 73@TuGraph when starting the TuGraph server.
+If the password reset is successful, you will receive the message "Reset admin password successfully" and the current server process will be closed.
+
+You need to restart the server in normal mode and then use the default account and password to log in. After logging in, you can reset the password to continue using TuGraph.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..6695299a7d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/4.monitoring.md
@@ -0,0 +1,1019 @@
+# Monitoring
+
+> This document mainly introduces the visualization operation and maintenance monitoring of TuGraph.
+
+## 1.Design Concept
+
+Visualization monitoring is not an indispensable part of TuGraph itself. Therefore, in the design, visualization monitoring is regarded as an application in the peripheral ecology of TuGraph to reduce the coupling with TuGraph database and its own impact. TuGraph visualization monitoring adopts the hottest open source solution - TuGraph Monitor + Prometheus + Grafana. Wherein, TuGraph Monitor is the client of TuGraph service, which initiates Procedure requests to TuGraph service through TCP connection. After receiving the request, TuGraph service collects statistics of CPU, memory, disk, IO, and number of requests on its own machine and responds. TuGraph Monitor packages the index data received from TuGraph into the format required by Prometheus and saves it in memory, waiting for Prometheus to obtain it through HTTP request. Prometheus regularly obtains packaged request data from TuGraph Monitor through HTTP requests and saves it in its own time-series database according to the time obtained. Grafana can obtain the statistical data within a certain time period from Prometheus according to user configuration and draw easy-to-understand graphics on the web interface to display the final result. In the entire request chain, the active acquisition, i.e. pull model, is used, which has the advantages of minimizing the coupling between data producers and data consumers, making development simpler, and not requiring data producers to consider the data processing capability of data consumers. Even if the data processing ability of a consumer is weak, it will not be crushed by the data producer producing data too fast. One of the shortcomings of the active pulling model is that the real-time performance of the data is insufficient. However, in this scenario, data does not have high real-time requirements.
+
+### 1.1.TuGraph
+
+TuGraph database provides the ability to collect multiple data information, such as disk, memory, network IO, and query requests, in the service machine, and provides queries through standard Procedure methods. This action of collecting data only occurs when a user queries through the interface, avoiding the impact of TuGraph monitoring service on user business query requests when users do not need the indicators on TuGraph monitoring service machine.
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor is a tool in the peripheral ecology of TuGraph. It communicates with TuGraph through C++ RPC Client as one of the many users of TuGraph and queries the performance indicators of the machine where TuGraph service is located through the Procedure query interface. It packages the results returned by TuGraph into the data model required by Prometheus and waits for Prometheus to obtain them. Users can set the query time interval to minimize the impact of obtaining monitoring indicators on business queries.
+
+### 1.3.Prometheus
+
+Prometheus is an open-source monitoring platform with a dedicated time-series database. It regularly obtains statistical indicators from the TuGraph Monitor service through HTTP requests and saves them in its own time-series database. For details, please refer to the official website:[https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana is an open-source visualization and analysis software. It can obtain data from multiple data sources, including Prometheus, and can convert data in the time-series database into tools for beautiful graphics and visual effects. For specific information, please refer to the official website:[https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.Deployment Solution
+
+### 2.1.Step 1
+
+Start the TuGraph service. For details, please refer to the documentation:[https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.Step 2
+
+Start the TuGraph Monitor tool. The startup command is as follows:
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+The meanings of the parameters are as follows:
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.Step Three
+
++ Download the Prometheus tarball that matches your machine architecture and system version. Download link:[https://prometheus.io/download/](https://prometheus.io/download/)
+
++ Unzip the tarball with the following command:
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ Modify the configuration file prometheus.yml and add the following configuration to enable Prometheus to scrape performance data packaged by TuGraph Monitor.
+
+```
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ Start Prometheus. You can obtain specific startup parameters with the following command:
+
+```shell
+./prometheus -h
+```
+
++ Verify if the Prometheus service is running properly by logging into the Prometheus service through the web portal, and querying whether the monitoring index resources_report has been obtained. If the data can be successfully queried, the operation is successful.
+
+### 2.4.Step Four
+
++ Download the Grafana installation package that matches your machine architecture and system version. Download link:[https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ Install Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Start Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Configure Grafana. First, configure the IP address of Prometheus in the data source settings. After the configuration is completed, verify if the data source is connected successfully by testing the connection function. Then, import the following template and modify the correct interface IP and port in the page according to the actual situation. Finally, set the refresh time and monitoring time range according to the actual situation.
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana",
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{label_name}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "memory",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \n  QPS exceeds 1000",
+        "name": "Request statistics alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "Request statistics",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "disk",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \nCPU usage rate exceeds 90%",
+        "name": "CPU usage rate alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU usage rate",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] Disk IO exceeds 10MB/S",
+        "name": "Disk IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph Monitoring Web",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+Verify the effect by refreshing the browser page. If the pie chart and line chart are displayed correctly, the configuration is completed.
+
+## 3.Future Plans
+
+Currently, visual monitoring only supports single-machine monitoring and can monitor performance indicators such as CPU, disk, network IO, and request QPS of the machine on which the service is located. In the future, monitoring for HA clusters will be implemented, and more meaningful indicators will be included in the monitoring scope.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/5.log.md
new file mode 100644
index 0000000000..caca9a40f7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# Log
+
+> This document mainly introduces the logging function of TuGraph.
+
+## 1.Introduction
+
+TuGraph keeps two types of logs: server logs and audit logs. Server logs record human-readable server status information, while audit logs maintain encrypted information for every operation performed on the server.
+
+## 2.Server log
+
+### 2.1.Server Log Configuration Items
+The output directory of server logs can be specified through the `log_dir` configuration item. The level of log can be specified through the `verbose` configuration item.
+
+The `log_dir` configuration item is empty by default. If `log_dir` configuration item is empty, then all logs will be write to the console(nothing will be written to the console if the `log_dir` configuration item is empty under daemon mode); if `log_dir` configuration item is configured specifically, log files will bew generated under that path. The maximum size of a single log file is 256MB.
+
+The `verbose` configuration item controls the level of log, and is divided into three levels of `0, 1, 2`. Ther verbosity of log record grows as the number grows. The default level is `1`. When the level is set to `2`, the server will print logs in `DEBUG` level and above. When the level is set to `1`, the server will print logs in `INFO` level and above. When the level is set to `0`, the server will print log in `ERROR` level and above.
+
+### 2.2.Example of Server Log Output Macro Usage
+
+If the developer wants to add logs to the code during development, they can refer to the following example:
+
+```
+#include "tools/lgraph_log.h" // add log dependency.
+
+void LogExample() {
+    // The log module has been initialized during the database startup, and developers can directly call the macro.
+    // The log level is divided into five levels: DEBUG, INFO, WARNING, ERROR, and FATAL.
+
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+
+You can also refer to the log macro usage in test/test_lgraph_log.cpp.
+
+### 2.3.Procedure log
+
+Developers can use the log function to output debug information that they need to the log for looking up and assisting development during the development of procedures. Debug information will be output to the same log file as the server log (if `log_dir` configuration item is not specified, it will also be output to the console)
+
+#### 2.3.1.Cpp procedure
+Please use the log macro provided in 2.2 to output debug information, and avoid using output methods such as cout or printf. For specific usage, please refer to the following sample code (see `procedures/demo/log_demo.cpp` for details)
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+After inserting the above sample code into the database as a procedure and running it, you can see the corresponding log entries in the log file.
+
+#### 2.3.1.python procedure
+Please use Python's built-in print to output debug information. The debug information will be merged into a WARN-level log entry and output to the log file after the procedure is executed.
+
+## 3.Audit log
+
+Audit logs record each request and response, as well as the user who sent the request and when the request received. Audit logging can only be turned on or off. The results can be queried using the TuGraph visualization tool and the REST API.
+
+To enable the Audit Log, you need to set the `enable_audit_log` parameter to `true` in the configuration file. For the configuration file and parameter descriptions, see:[Tugraph Running/Service configuration](../../5.installation&running/7.tugraph-running.md)
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/index.rst
new file mode 100644
index 0000000000..4dc0c67422
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Privilege And Operations
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..2cdb8d3f31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# Unit Testing
+
+> This document is the unit testing documentation for TuGraph.
+
+## 1.Introduction
+
+TuGraph unit testing uses the gtest framework, which can choose to run all tests at once or specify certain tests.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..b98cf7f62a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/11.quality/2.integration-testing.md
@@ -0,0 +1,400 @@
+# Integration Testing
+
+> This document mainly introduces how to use the TuGraph integration testing framework.
+
+## 1.The Significance of TuGraph Integration Testing
+
+In unit tests and function tests, some test cases directly use Galaxy or Statemachine to perform tests, which is not a complete process. In the complete CS architecture, user requests are sent to the server through the client, and network communication is essential. To avoid bugs caused by incomplete unit testing, TuGraph uses an integration testing framework to perform end-to-end testing.
+
+## 2.TuGraph Integration Testing Framework
+
+TuGraph uses the Pytest framework as its integration testing framework. Pytest is currently the most widely used CS-side integration testing framework. It is known for its flexibility, ease of use, and the ability to support parameterization. Based on the functionality provided by Pytest, TuGraph abstracts different tools and controls the processing logic of each tool through parameters to facilitate efficient testing code development.
+
+For more information on Pytest, please refer to the official website: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.Component Description
+
+| Component Name    |Component Function      | Implementation Method                              |
+| --------------- | -------------------------- | ------------------------------------------------ |
+| server          | TuGraph standalone service | Start a child process and launch the service       |
+| client          | TuGraph Rpc Client         | Open TuGraph Python Rpc Client in the current process and send requests  |
+| importor        | TuGraph Importor           | Start a child process to process import requests               |
+| exportor        | TuGraph Exportor           | Start a child process to process export requests               |
+| backup_binlog   | TuGraph Backup Binlog      | Start a child process to process binlog backup requests       |
+| backup_copy_dir | TuGraph Backup             | Start a child process to process full db backup requests       |
+| build_so        | Component for compiling C++ dynamic libraries    | Start a child process to handle GCC compilation logic            |
+| copy_snapshot   | TuGraph Copy Snapshot      | Handle backup snapshot requests in the current process                 |
+| copydir         | Folder copy                 | Handle folder copy requests in the current process                     |
+| exec            | Execute C++/Java executable files     | Start a child process to launch the C++ executable file  |
+| algo            | Execute algorithm                   | Start a child process to run the algorithm     |
+| bash            | Execute bash commands               | Start a child process to execute bash commands      |
+| rest            | TuGraph Python Rest Client | Open TuGraph Python Rest Client in the current process and send requests|
+
+### 2.2.Component Usage
+
+#### 2.2.1.server
+
+##### 2.2.1.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The server will be started before the function starts executing, and the server will be stopped and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ host is the IP and port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to the user in the TuGraph Server
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The client will be started before the function starts executing, and the client will be stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.Startup Command
+
+Import the tool through the fixtures component and control the import of different data through startup parameters. The data will be imported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.Startup Command
+
+Import the tool through the fixtures component and control the export of different data through startup parameters. The data will be exported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.Startup Parameters
+采用python字典传入
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different binlogs through startup parameters. The binlogs will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different databases through startup parameters. The database will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command, passed in as a Python list, and multiple so can be compiled at once
++ so_name is the dynamic library that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.Startup Command
+
+Import the tool through the fixtures component and control the compilation of different dynamic libraries through startup parameters. The dynamic libraries will be generated to the specified directory before the function starts executing, and the dynamic libraries specified in the so_name list will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original database
++ dst is the snapshot copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.Startup Command
+Import the tool through the fixtures component and control the copying of different snapshots through startup parameters. The snapshot in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original directory
++ dst is the directory copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.Startup Command
+Import the tool through the fixtures component and control the copying of different directories through startup parameters. The directory in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.Startup Command
+Import the tool through the fixtures component and control the execution of different logic through startup parameters. A child process will be started to execute the command passed in through the cmd parameter before the function starts executing.
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ result is the expected execution result of the algorithm. After execution is completed, the actual result will be compared with the expected result. If they are different, the test will fail.
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.Startup Command
+Import the tool through the fixtures component and control the execution of different algorithm logic through startup parameters. A child process will be started to execute the algorithm passed in through the cmd parameter before the function starts executing. The function body will wait for the algorithm to complete and compare the result with the expected result.
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.Startup Command
+
+Import the tool through the fixtures component and control the execution of different bash commands through startup parameters. A child process will be started to execute the bash command passed in through the cmd parameter before the function starts executing. The function body will wait for the command to complete.
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ port is the port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to user in TuGraph Server
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.Startup Command
+
+Import the tool through the fixtures component and link to different TuGraph Rest Servers through startup parameters. The client will be started before the function starts executing and stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.Test Cases
+
+#### 2.3.1.rest
+
+In the sample code, before the test_get_info function is executed, the server is started, and a rest client is started after the server is started. After entering the test_get_info function, some information about the server is obtained, and assert is used to determine whether cpu information is obtained.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+In the sample code, before the test_flushdb function is executed, the offline data import logic is executed and the server is started. After creating a connection through the client, the function enters the test_flushdb function. The number of points is queried to determine whether the import is successful. After the import is successful, the flushDB operation is executed. assert is used again to determine whether the db can be emptied normally.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+In the sample code, before the test_export_default function is executed, the offline data import logic is executed. After the import is successful, the data of the current db is exported. Then, the offline import logic is used again to import the exported data into a new directory. The newly imported data is used to start the db and create a connection. In the body of the test_export_default function, it is determined whether the data after export and import is consistent with the original data.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.Other Tests
+For more test cases, please refer to the integration test code [https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/11.quality/index.rst
new file mode 100644
index 0000000000..f3b6e0e061
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Quality
+==============================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..bf465539f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,93 @@
+# TuGraph Contribution Guide
+
+## 1. Preface
+
+Thank you for your contribution to TuGraph. We sincerely hope that more students from the community will join in and build a better graph database project together.
+
+For outstanding community contributors, we will award the TuGraph Outstanding Community Contributor Certificate.
+
+## 2. What to contribute
+
+We welcome any contribution at any time, whether it's a simple typo fix, bug fix, or new feature addition. Feel free to ask questions or initiate PRs. We also value documentation and integration with other open source projects, and welcome contributions in this regard. For any modification, especially the more complex modification, it is recommended to create an issue and fill it out according to the BUG or PR template.
+
+## 3. Preparation
+
+## 3.1. Knowing TuGraph
+
+You can get start with TuGraph follow instrcutions in [Guide Doc](../1.guide.md).
+
+## 3.2. Environment
+
+For document contributions, you can directly modify and submit a pull request by clicking on "Edit on GitHub" in the upper right corner of the [documentation](https://tugraph-db.readthedocs.io/en/latest).
+
+For code contributions, it is usually necessary to set up the environment for compilation and execution. You can deploy using [Docker](../5.installation&running/3.docker-deployment.md) or [local package deployment](../5.installation&running/4.local-package-deployment.md).
+
+## 3.3. License Agreement
+
+Before contributing code, please take some time to understand the process of contributing code to TuGraph, and read the [Contributor License Agreement](3.individual-cla.md) or [Corporate Contributor License Agreement](4.corporate-cla.md). Participating in the contribution is deemed to agree to the above agreement.
+
+## 4. Contribute code process
+
+### 4.1. Submit the issue
+
+Whether you are fixing a bug in TuGraph or adding a new feature to TuGraph, before you submit the code, submit an issue on TuGraph's GitHub, describing the problem you want to fix or the function you want to add. There are several advantages to doing this:
+
+- There will be no duplication of work in conflict with other developers or their plans for the project.
+- TuGraph maintainers will discuss the bugs or new features you mentioned to determine whether the modification is necessary, whether there is room for improvement or a better way.
+- After reaching an agreement, develop and submit the code, reducing the cost of communication between the two parties and reducing the rejection of pull requests.
+
+### 4.2. Pull the branch
+
+All modifications of TuGraph are made on branches. After modification, the pull request is submitted and merged into the Master by the project maintenance personnel after Code Review. Therefore, after the source code steps are described, you need:
+
+1. Download the code to a local directory. In this step, you can choose git or https. In recent years, github has stricter permission requirements. The git approach, for example, requires the more complex ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)). https authentication cannot be performed using the user name and password. git clone https://github.com/ Your account name /tugraph-db
+2. Pull branch ready to modify code:
+   git branch add_xxx_feature
+3. After executing the above command, your code repository switches to the appropriate branch. Run the following command to view your current branch: git branch -a
+4. If you want to switch back to Master, run the git checkout -b master command
+5. If you want to switch back to branching, run the following command: git checkout -b "branchName"
+
+### 4.3. Configuring Github Information
+
+Run git config --list on your machine to view git's global username and mailbox. Check whether the displayed user.name and user.email match your github user name and email address.
+
+If a company has its own gitlab in-house or uses other commercial GitLabs, a mismatch may occur. At this point, you need to set up a separate user name and mailbox for the tugraph-db project. For details about how to set the user name and email address, see github's official documentation.
+
+### 4.4. Compile and Run
+
+The process of compile and run can reference [ci script](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. Change the code and submit it locally
+
+Once you've pulled the branch, you're ready to change the code.
+
+**Code modification Notes**
+
+Code style consistency: TuGraph uses cpplint to keep code in the same format, and IDE can use.clang to configure the style. Be sure to check the code style locally before submitting it, or ACI will report an error.
+
+Add unit test code: New changes should pass through existing unit tests. New unit tests should be provided to prove that there are bugs in the previous code and that the new code has resolved these bugs. You can run all tests with the following command:./unit_test
+It can also be run with the help of an IDE.
+
+**Other precautions**
+
+Please keep the code you are editing in the original style, especially the space feed, etc. For unnecessary comments, delete them directly. Add comments where logic and functionality are not easily understood. Keep documentation up to date. After modifying the code, run the following command to submit all the changes to the local computer:
+git commit -am '(feat) Add the xx function 'git commit -am '(fix) fix xx problem' '
+
+Submit the code to the remote repository
+After the code is committed locally, you can then synchronize the code with the remote repository. Run the following command to submit local changes to github: git push origin "branchname"
+
+If you were forking earlier, the origin here is pushed to your code repository, not TuGraph's.
+
+After the code has been submitted to GitHub, you can send a request to merge your changes into the TuGraph Master. At this point, you need to go to your corresponding repository on GitHub and press the pull request button in the upper right corner. Select the target branch, which is usually the master, and the system will notify the TuGraph staff, who will Review your code, and when it meets the requirements, it will join the main branch and become part of TuGraph.
+
+Please note that the CI will be automatically checked, as well as all Commits signing the cla, with green signs on the commits.
+
+### 4.6. Code Review
+
+After you submit your code, your code will be assigned to a maintainer for Review. Please wait patiently. If no one has responded to your submission after two working days, you can leave a message under PR and @ the corresponding person.
+
+Comments on code Review will be directly noted to the corresponding PR or Issue. If you find the suggestions reasonable, please update them to your code.
+
+### 4.7. Merge code into Master
+
+After the code Review is approved, the TuGraph maintainer will put it into the Master. During this process, the maintainer may specify a new Reviewer and put forward new comments that need to be revised. Normally this step is omitted, and after the code is merged, you will receive an indication that the merge was successful.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..27cff88ae8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,72 @@
+# TuGraph community roles
+
+## 1. Preface
+
+This document describes the roles of membership in the TuGraph community, the requirements and permissions for each role.
+
+## 2. Role summary
+
+This is the division of roles in the TuGraph community, describing the responsibilities of each role, the requirements to become and remain a role, and the permissions of the corresponding role.
+
+Our community is divided into three roles based on the Apache specification:
+
+- Contributor
+- Maintainer
+- PMC
+
+The requirements, responsibilities, and authorities for each role are described below.
+
+## 3. Contributor
+
+### 3.1. requirements
+
+Successfully submit a PR and merge in any of TuGraph's official projects.
+
+### 3.2. responsibility
+
+- Actively respond to issues or PR assigned to you
+- Help reply the issue/pr together and assign the issue to the person in charge of the corresponding module
+
+### 3.3. permissions
+
+- Join the TuGraph GitHub organization and become a member of the TuGraph open source community.
+
+## 4 Maintainer
+
+### 4.1. requirements
+
+The new Committer is recommended by the existing PMC and approved by 2/3 of the votes. The Commiter meets at least one of the following conditions:
+
+- Been a community member for more than three months
+- More than 10 PR for PMC approve
+- Complete major functions
+- Fixed serious bugs
+- Follow project development and participate in community discussion
+
+### 4.2. responsibility
+
+- Community counseling support
+- Actively respond to issues or PR assigned to you
+- The right to vote on major community decisions
+- Review community PR
+
+### 4.4. permissions
+
+- Pull Request review permission
+
+## 5. PMC
+
+### 5.1. requirements
+
+- Not open at the moment, if you have a strong desire please contact PMC
+
+### 5.2. responsibility
+
+- Actively participate in community discussions and give guidance to major community decisions
+- Responsible for ensuring that the community activities of open source projects are running smoothly
+
+### 5.3. permissions
+
+- Pull Request review permission
+- Pull Request approve permission
+- Community role member management
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..4798fc9db4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# Individual Contributor License Agreement
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..5ff3ff31e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# Corporate Contributor License Agreement
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..40b9d098f0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,73 @@
+# TuGraph Roadmap
+
+## 1. Introduction
+
+This document outlines the future development plans for TuGraph, including features currently under development, those
+not in the development pipeline, and completed functionalities not included in the open-source version.
+
+TuGraph aims to be an open-source, high-performance graph database. It adopts a centralized storage approach for graph
+data and, in the short term, does not consider data sharding. Instead, it employs a master-slave replication mode to
+address high-concurrency read scenarios, while utilizing cloud-based storage solutions to address storage capacity
+challenges.
+
+## 2. Completed Functionalities
+
+TuGraph was open-sourced on September 1, 2022, and has received regular bug fixes and enhancements based on community
+feedback.
+
+| Version | Functionality                                                                                 | Date       |
+|---------|-----------------------------------------------------------------------------------------------|------------|
+| 3.3.0   | Initial open-source release                                                                   | 2022.9.1   |
+| 3.3.1   | Refactored graph analysis engine with multi-mode support                                      | 2022.10.14 |
+| 3.3.2   | Added OGM support and improved unit test coverage                                             | 2022.11.21 |
+| 3.3.3   | Iterative improvements to link authentication mechanism and addition of English documentation | 2022.12.23 |
+| 3.3.4   | Cloud deployment support and streamlined LDBC SNB Audit process                               | 2023.1.28  |
+| 3.4.0   | Added support for OLAP Python API and upgraded offline data import                            | 2023.3.11  |
+| 3.5.0   | Introduced POG (Procedures On Graph query language), frontend upgrades                        | 2023.6.5   |
+| 3.5.1   | Added learning engine, Procedure Rust API, and storage-property separation                    | 2023.7.14  |
+| 3.6.0   | High availability support, log system upgrade                                                 | 2023.8.11  |
+| 4.0.0   | ISO GQL support, 11 new open-source graph algorithms, m1 Docker support                       | 2023.9.6   |
+| 4.0.1   | Support for temporal edge sorting, 5 new open-source graph algorithms                         | 2023.9.28  |
+| 4.1.0   | Bolt protocol support, fast online full import, support for geospatial data types             | 2023.12.25 |
+
+In addition, TuGraph has established a comprehensive quality system, including automated unit testing, integration
+testing, and performance testing.
+
+For more detailed information, refer to the "[root]/release/CHANGELOG.md" file in the source code directory.
+
+## 3. Functional Updates in 2024
+
+In addition to the aforementioned core functionalities, the following components are planned for development in 2024.
+
+| Version | 	Functionality                                                | 	Planned Date |
+|---------|---------------------------------------------------------------|---------------|
+| 4.2.x   | 	HA support for Witness role and management tools             | 	2024.3       |
+| 4.2.x   | 	Bolt support for stream processing and parameterized queries | 	2024.3       |
+| x.x.x   | 	GeaX support for Cypher                                      | 	2024.6       |
+| x.x.x   | 	Support for composite indexes                                | 	2024.6       |
+| x.x.x   | 	Optimization of data import functionality                    | 	2024.6       |
+| x.x.x   | 	[Community Feature] Support for geospatial data types        | 	2024.6       |
+| x.x.x   | 	Enhanced Cypher capabilities                                 | 	2024.9       |
+| x.x.x   | 	Support for rapid schema changes                             | 	2024.9       |
+| x.x.x   | 	Vectorization support                                        | 	2024.12      |
+| x.x.x   | 	RPQ support                                                  | 	2024.12      |
+| x.x.x   | 	[Optional] Query engine upgrade                              | 	2024.12      |
+| x.x.x   | 	[Community Feature] Support for GraphAr                      | 	2024.12      |
+
+## 4. Community Collaboration Features
+
+Currently, the development team's resources are limited, and we cannot implement all the desired features for TuGraph.
+However, during the feature planning process, we have identified a range of ideas worth exploring. The team has
+conducted some initial exploration, and we welcome community collaboration in developing the following features:
+
+| Version	 | Functionality	                                                | Planned Date |
+|----------|---------------------------------------------------------------|--------------|
+| x.x.x    | Rich graph algorithm library	                                 | 2024.x       |
+| x.x.x    | Support for default attribute values	                         | 2024.x       |
+| x.x.x    | Best practice of embedded TuGraph-DB usage                    | 2024.x       |
+| x.x.x    | Support for transaction in Bolt clients	                      | 2024.x       |
+| x.x.x    | Support for composite data types like List, Map, and Decimal	 | 2024.x       |
+| x.x.x    | Support of multiple storage engine	                           | 2024.x       |
+
+For simpler features, we will label them as "good first issue" on GitHub issues, and we welcome discussions from
+technology enthusiasts interested in graph databases.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..07fee7bd7a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Contributor Manual
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..baef5017a6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# Importing Data from Relational Databases to TuGraph
+
+> Using [DataX](../6.utility-tools/7.tugraph-datax.md)，to be completed.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..c7b094b1b7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,217 @@
+# Using TuGraph Graph Learning Module for Node Classification
+
+## 1. Introduction
+GNN is a powerful tool for many machine learning tasks on graphs. In this introductory tutorial, you will learn the basic workflow of using GNN for node classification, i.e., predicting the category of nodes in a graph.
+
+This document will show how to build a GNN for semi-supervised node classification on the Cora dataset with only a few labels, which is a citation network with papers as nodes and citations as edges. The task is to predict the category of a given paper.
+By completing this tutorial, you will be able to:
+
+Load the Cora dataset.
+
+Sample and build a GNN model using the sampling operator provided by TuGraph.
+Train the GNN model for node classification on CPU or GPU.
+
+This document requires some experience in using graph neural networks and DGL.
+
+## 2. Prerequisites
+The TuGraph graph learning module requires TuGraph-db version 3.5.1 or above.
+
+It is recommended to use Docker image tugraph-compile 1.2.4 or above for TuGraph deployment:
+
+tugraph/tugraph-compile-ubuntu18.04:latest
+
+tugraph/tugraph-compile-centos7:latest
+
+tugraph/tugraph-compile-centos8:latest
+
+The above images can be obtained on DockerHub.
+Please refer to [Quick Start](../3.quick-start/1.preparation.md) for specific operations.
+
+## 3. Import Cora Dataset to TuGraph Database
+### 3.1. Introduction to Cora Dataset
+The Cora dataset consists of 2708 papers, classified into 7 categories. Each paper is represented by a 1433-dimensional bag-of-words feature, indicating whether a certain word appears in the paper. These bag-of-words features have been preprocessed to be normalized to a range from 0 to 1. The edges represent citation relationships between papers.
+
+TuGraph has provided the Cora dataset import tool, which users can use directly.
+
+### 3.2. Data Import
+The Cora dataset is located in the test/integration/data/algo directory and contains the cora_vertices point set and the cora_edge edge set.
+
+First, the Cora dataset needs to be imported into the TuGraph database. Please refer to [Data Import](../6.utility-tools/1.data-import.md).
+
+In the build/output section below the line:
+``` bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+The number of commands related to the relevant document is to be built/output.
+
+Execute the following command in the build/output directory:
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Here, cora.conf is the graph schema file representing the format of graph data, which can be found in test/integration/data/algo/cora.conf. coradb is the name of the graph data file after import, which represents the storage location of graph data.
+
+## 4. Feature Conversion
+Since the features in the Cora dataset are float arrays of length 1433, which are not supported by TuGraph for loading, they can be imported as strings and converted to char* for easier access later. The implementation can be referred to the feature_float.cpp file.
+The specific execution process is as follows:
+
+Compile the import plugin in the build directory.(Can be skipped if TuGraph has been compiled):
+`make feature_float_embed`
+
+Execute the following command in the build/output directory to perform the conversion:
+`./algo/feature_float_embed ./coradb`
+
+## 5. Compile Sampling Operator
+The sampling operator is used to obtain graph data from the database and convert it into the required data structure. The specific execution process is as follows:
+Can be skipped if TuGraph has been compiled.
+Execute the following command in the tugraph-db/build directory:
+`make -j2`
+
+or execute the following command in the tugraph-db/learn/procedures directory:
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *
+import importlib
+getdb = importlib.import_module("getdb")
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+As shown in the code, after obtaining the algorithm .so file, import and use it.
+
+## 6. Model training and saving
+TuGraph calls the operators of the cython layer in the python layer to realize the training of the graph learning model.
+The usage of the TuGraph graph learning module is introduced as follows:
+Execute under the build/output folder
+`python3 train_full_cora.py --model_save_path ./cora_model`
+You can start training.
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+The detailed training process is as follows:
+### 6.1. Data Loading
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+As shown in the code, load the data into memory based on the path of the graph data, username, password, and subgraph name. TuGraph can load multiple subgraphs for graph training, but we only load one subgraph here.
+
+### 6.2. Build Sampler
+During the training process, the GetDB operator is first used to obtain the graph data from the database and convert it into the required data structure. The specific code is as follows:
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+As shown in the code, the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and their stored information is as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Then a sampler is constructed:
+```python
+batch_size = 5
+count = 2708
+sampler = TugraphSample(args)
+dataloader = dgl.dataloading.DataLoader(fake_g,
+    torch.arange(count),
+    sampler,
+    batch_size=batch_size,
+    num_workers=0,
+    )
+```
+
+### 6.3. Convert the results to the required format
+```python
+src = EdgeInfo[0].astype('int64')
+dst = EdgeInfo[1].astype('int64')
+nodes_idx = NodeInfo[0].astype('int64')
+remap(src, dst, nodes_idx)
+features = NodeInfo[1].astype('float32')
+labels = NodeInfo[2].astype('int64')
+g = dgl.graph((src, dst))
+g.ndata['feat'] = torch.tensor(features)
+g.ndata['label'] = torch.tensor(labels)
+return g
+```
+The results are converted to the required format to fit the training format.
+
+### 6.4. Build the GCN model
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+def build_model():
+    in_size = feature_len  # feature_len is the length of features, which is 1433 here
+    out_size = classes  # classes is the number of classes, which is 7 here
+    model = GCN(in_size, 16, out_size)  # 16 is the size of the hidden layer
+    return model
+```
+In this tutorial, a two-layer Graph Convolutional Network (GCN) will be built. Each layer aggregates neighbor information to compute new node representations.
+
+### 6.5. Train the GCN model
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #If you need to save the model, give the model save path
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+As shown in the code, iterative training is performed 50 times according to the defined sampler, optimizer and model, and the trained model is saved to the path model_save_path.
+
+The output is as follows:
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+The graph learning module can be accelerated by using a GPU. If users want to run it on the GPU, they need to install the corresponding GPU driver and environment. For details, please refer to learn/README.md.
+
+The complete code can be found in learn/examples/train_full_cora.py.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..f769293858
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# Data Migration
+
+## 1 Introduction
+Data migration refers to the process of moving data from one system, storage medium, or application to another system, storage medium, or application. When TuGraph needs to be upgraded or the system hardware environment changes,
+The data in the original TuGraph service needs to be migrated. Based on the system hardware environment and software version, this paper divides data migration into three schemes:
+1. Compatible migration: When the system environment before and after the migration is consistent and the TuGraph software is compatible, you can directly use the backup and recovery method to migrate data;
+2. Upgrade and migration: When the system environment before and after the migration is inconsistent or the TuGraph software is not compatible, it is necessary to migrate the data by first exporting the data and then re-importing;
+3. Online migration: When data migration is performed on a high-availability cluster and the network environment of the cluster is good, the original cluster can be smoothly switched to the new cluster by adding or deleting nodes.
+The following article will introduce these three schemes in detail.
+
+## 2. Compatible Migration
+Compatible migration means that when the system environment remains unchanged and the TuGraph software version is compatible, the data and stored procedures of the original service can be used in the new service, so it can be directly migrated.
+Users can first use the `lgraph_backup` tool to back up the data, then transfer the data to a new machine and restart the service. The specific migration steps are as follows:
+
+### 2.1. Backup data
+Backup data using `lgraph_backup` tool
+```bash
+   lgraph_backup -s db -d db.bck
+```
+You can also directly use the `cp` command in this step, but the `cp` command will copy some redundant metadata, and the raft metadata will also be copied in the HA mode, causing the cluster to fail to restart after migration.
+Therefore, it is recommended to use the `lgraph_backup` tool instead of the `cp` command during data migration.
+
+### 2.2. Start a new service
+Use the following command to start the new service, and the stored procedure will be automatically loaded into the new service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. Stop the original service
+Use the following command to stop the original service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. Upgrade migration
+When the user wants to migrate the original service to a differentiated environment (such as migrating from centos7 to ubuntu18.04), or when the version of TuGraph changes greatly and is incompatible (such as 3.4.0 and 3.6.0),
+Users can first use the `lgraph_export` tool to export the data into a file, transfer it to a new machine, and then use the `lgraph_import` tool to re-import and restart the cluster.
+This can ensure that it can be used in the new environment, but the efficiency is low, and the stored procedure needs to be reloaded. The specific migration steps are as follows:
+
+### 3.1. Export data
+Use the `lgraph_export` tool to export the data and transfer the data to the new machine
+```bash
+   lgraph_export -d db -e db.export
+```
+
+### 3.2. Import data
+Use the `lgraph_import` tool to import data and manually load the stored procedure (see [client operation steps](../7.client-tools/2.cpp-client.md) for details)
+```bash
+   lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. Start a new service
+Start the new service with the following command
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. Stop the original service
+Use the following command to stop the original service
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. Online Migration
+When performing data migration on the server cluster deployed by the high-availability version of TuGraph, if the network bandwidth is sufficient, you can directly migrate the service online by adding or deleting nodes. The specific migration steps are as follows:
+
+### 4.1. Copy data
+Use the following commands to copy the data on the leader node and transfer it to the machine nodes of the new cluster. Since the leader node has the most complete raft log, copying the leader's data can minimize
+The time for the log to catch up.
+```bash
+   cp -r db db.cp
+```
+### 4.2. Starting a new node
+Use the following command to join the new node to the cluster. After joining the cluster, the incremental data will be automatically synchronized to the new node
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. Stop the original node
+Stop the original node service, and send subsequent application requests directly to the new cluster
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..62f7a61957
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# Environment and version selection
+
+> This document introduces how to select the system environment and deployment method
+
+## 1 Introduction
+
+TuGraph provides differentiated system environments and deployment methods for users with different needs to meet the needs of different users such as novices, system developers, production operation and maintenance personnel, and researchers.
+
+## 2. Environmental capability selection
+
+Users can choose different environments based on actual usage scenarios. The compilation environment has the most complete capabilities and requires more third-party software. Correspondingly, the streamlined operating environment requires almost no installation of any dependent libraries and can run TuGraph's basic functions except stored procedures.
+
+| Environment                      | Purpose                                     | Remarks                                 |
+|----------------------------------|---------------------------------------------|-----------------------------------------|
+| Compilation environment          | Compile TuGraph from source                 | For developers                          |
+| Running environment              | Run TuGraph installation package            | Applicable to most users                |
+| Simplified operating environment | Run simplified TuGraph installation package | Less dependence on the operating system |
+
+For a detailed introduction to different environments, see [link](../5.installation&running/2.environment-mode.md).
+
+## 3. Deployment method selection
+
+TuGraph deployment only requires one server (high availability mode requires multiple servers), and you can choose a suitable deployment method based on actual resource conditions and usage scenarios.
+
+| Deployment method | Description | Remarks |
+|----------|-----------------------|--------------- -------------------------------------------------- --------------------------|
+| Cloud deployment | Alibaba Cloud Computing Nest one-click deployment, free trial | Suitable for novices, process reference [Link](../5.installation&running/5.cloud-deployment.md) |
+| Docker deployment | Cross-platform deployment through pre-prepared Docker images | Users with hardware requirements, such as performance testing, please refer to [link](../5.developer-manual/1.installation/3.docker-deployment. md) |
+| Local deployment | Tightly coupled deployment in existing systems | Applicable to specified production environment, refer to the process [Link](../5.installation&running/4.local-package-deployment.md) |
+
+## 4. Next steps
+
+After the deployment is completed, you can proceed to [Start Service](../5.installation&running/7.tugraph-running.md) and [Data Import](../5.developer-manual/3. server-tools/1.data-import.md) and other operations, you can also experience the entire process through [Sample Data](../3.quick-start/2.demo/1.movie.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..4292d5488f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Best Practices
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/14.faq.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/14.faq.md
new file mode 100644
index 0000000000..48704dfccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/14.faq.md
@@ -0,0 +1,58 @@
+# FAQ
+
+During the use of TuGraph, if you encounter problems, you can first check [User Documentation](https://github.com/TuGraph-db/tugraph-db/tree/master/doc/zh-CN). Second, check to see if the FAQ list below matches your question.
+
+1. **[Kernel Engine QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussion-4575385)**
+   
+   1.1 [Does the edge of TuGraph support index? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165379)
+   
+   1.2 [What is the QPS of a single TuGraph machine? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussion-4575381)**
+   
+   2.1 [How to update the tugraph service after the visualization file is built? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165364)
+   
+   2.2 [How to connect the existing tugraph service through npm run dev? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165366)
+   
+   2.3 [TuGraph Browser version 3.3.0 failed to delete node label? ](https://github.com/TuGraph-db/tugraph-db/discussions/82#discussion-4465791)
+3. **[Client QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussion-4575378)**
+   
+   3.1 [What programming languages ​​does the client currently have, and does it support node js? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165351)
+   
+   3.2 [Does the python client support pip install? Where is the client referenced? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165353)
+4. **[Data Import QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussion-4575373)**
+   
+   4.1 [Which common databases can TuGraph connect to? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165335)
+   
+   4.2 [How to import data? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[Stored Procedure QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussion-4575369)**
+   
+   5.1 [How to load stored procedure or algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165313)
+   
+   5.2 [How to call or execute the stored procedure? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165317)
+   
+   5.3 [Where is the open source built-in algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[Installation and deployment QA summary](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussion-4575364)**
+   
+   6.1 [How to install using docker image? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165287)
+   
+   6.2 [After the rpm package and deb package are installed, start the lgraph_server service. Prompt missing 'liblgraph.so' error? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165289)
+   
+   6.3 [How to compile TuGraph on Mac's M1 chip? ](https://github.com/TuGraph-db/tugraph-db/discussions/47#discussion-4393165)
+   
+   6.4 [How to Handle Error: 'jemalloc: Unsupported system page size'? ](https://github.com/TuGraph-family/tugraph-db/issues/477)
+7. **[Cypher QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussion-4575018)**
+   
+   7.1 [Does it support conditional query of indefinite length? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165252)
+   
+   7.2 [How to query the shortest path, how to use the shortestPath function? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165256)
+   
+   7.3 [Using and after the query statement Where to splice the query speed is slow, how should the statement be optimized and improved? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165260)
+   
+   7.4 [How to query the edge of any jump? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165262)
+   
+   7.5 [Is there a date() function in Cypher? ](https://github.com/TuGraph-db/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA Summay](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+   
+   8.1 [What should I do after the error "User has reached the maximum number of tokens" is reported? ](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+If the problem is still not resolved, we recommend you follow up or create a new thread describing your problem. At the same time, the TuGraph QA summary will be updated regularly based on the posts initiated by everyone in the discussion area.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/15.contacts.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/15.contacts.md
new file mode 100644
index 0000000000..fb28a5f1aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/15.contacts.md
@@ -0,0 +1,17 @@
+# Contacts
+
+If you have any feedback or suggestions for the product, You are welcome to join the discussion or make suggestions through the following contact methods.
+
+Official website: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue:
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions:
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack:
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+Contact us via dingtalk, wechat, email and telephone:
+![contacts](../../images/contact-en.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..549043a94c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,15 @@
+# What is Graph
+
+The graph that we're going to introduce today, it's neither a picture, nor a diagram，it's a class of mathematics called graph theory. We can see on the screen that there are two graphs on the left and right, which represent things and their relationship. We abstract it out in a form, and we call such a form a graph.
+
+![alt what is graph](../../../images/what-is-graph-en.png)
+
+The basic elements of a graph are a vertex, and an edge, a vertex is a representation of the thing, of the entity, and an edge is a representation of the relationship between them.
+
+We see the graph on the left, the dots have companies, they have employees, and they have projects. What are their sides? The relationship between the company and the employees is an employment relationship, and there can be a friend relationship between the employees, and there can be a participation relationship between the project and the employees. That is, we can use graphs to abstract things and their relationships.
+
+The diagram on the right is a schematic diagram of a financial transaction. Each of us has a bank account, and when our bank account makes a consumption or makes a transfer, this account is the point on the graph, and this edge can indicate that there is such a transfer relationship between us.
+
+We can also see from this example that edges can attach information and points can attach information. The point can attach which bank this account is in and what the account is. The value of the transaction can be attached to the edge, and many times, if your transaction is large, it indicates that special attention is needed. This edge might not necessarily be the amount of a particular transfer, it might be the amount accumulated over a period of time and so on. Graphs can actually be very expressive.
+
+On the other hand, for a graph like finance, it can be very large. There could be more than a billion points, a hundred billion or even a trillion edges. As you can imagine, it's actually quite challenging to actually work with these graphs.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..935aa4ffa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# What is a graph database
+
+> This document mainly introduce what is a graph database, the advantages of graph database compared with relational database, and the comparison between graph database and relational database
+
+## 1. Introduction
+
+Graph database is a database based on graph model. The main function of graph database is to manage graph data, so it needs to support efficient vertex/edge query and update; To facilitate user use, it is usually necessary to add transaction support to ensure the normal operation of concurrent operations.
+
+## 2. Advantages of graph databases over relational databases
+
+The function of graph database is an extension of traditional relational database. Compared with relational database, the graph structure supported by graph data is more flexible. Graph database is different from other databases in terms of data addition, deletion, query and modification based on graph. On the operation abstraction of graph data, a vertex-based perspective is adopted, for example, a vertex accesses its neighboring vertices through all its outgoing edges. This kind of operation is also the core of the design of graph database system.
+
+The uniqueness of graph database can be reflected in the following three aspects:
+
+### 2.1 Performance
+
+Handling the relationship between data, it is inevitable to use table JOIN operation in relational database, which has a great impact on performance. Graph database is a direct access, similar to pointer access, which is more efficient operation of associated data, compared with relational database performance improvement of 2 to 4 orders of magnitude.
+
+### 2.2 Compatibility
+
+In reality, the process of a project is often evolutionary. The content and even the format of the data are constantly changing. In a relational database, this means that a change in the table structure, or the creation of multiple new tables, significantly changes the source data. In the graph database, you simply add new vertices, edges, and attributes, and set them to the corresponding types. In essence, a table represents a type of data, and a vertex represents a specific data, meaning that relational databases pay more attention to the type of data, while graph databases pay more attention to the individuals of data and identify their association relationships.
+
+### 2.3 Intuitive
+
+Using graphs (or nets) to express real-world relationships is more straightforward and natural, especially in the Internet of Things era. If relational data used, a high degree of abstract thinking required to build a table of characters first, then a table of relations, and finally a map of data. When analyzing and querying the graph data, you can also intuitively find the desired data interactively through the point-edge connection topology, without any professional knowledge.
+
+## 3. Comparison between graph database and relational database
+
+| classification      | model           | advantage                                                            | disadvantage                                                                 | example        |
+| ------------------- | --------------- | -------------------------------------------------------------------- | ---------------------------------------------------------------------------- | -------------- |
+| Relational database | Table structure | Data is highly structured, consistent, and software maturity is high | The multi-hop association query is inefficient or not supported              | MySQL、Oracle  |
+| Graph database      | graph structure | Modeling and manipulating associations is very efficient             | Highly structured data processing is not as powerful as relational databases | Neo4j、TuGraph |
+
+In a word, in the face of massive data storage and processing problems, the traditional relational database has been unable to meet most of the daily data storage needs. Graph database technology can store relational information as entities and expand data model flexibly. Because it provides the most direct expression of related data, and the graph model is naturally tolerant to heterogeneous data. In the future, graph database technology will become one of the most popular technologies, which will provide powerful support for enterprises to store and analyze large-scale graph data.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..da6cbf6318
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,46 @@
+# What is TuGraph
+
+> This document mainly introduces the main features and characteristics of TuGraph Community Edition, as well as the differences between TuGraph Enterprise Edition and Community Edition.
+
+
+## 1.Introduction
+
+Graph database is a non-relational database that stores data by vertices and edges. It can be used to store complex data network models, such as social networks and transaction networks. TuGraph is a graph database developed by Ant Group. This manual introduces the functions and usage of TuGraph.
+
+## 2.TuGraph Community Edition
+
+The Community Edition is a fully functional version of TuGraph, suitable for single-instance deployment. It provides complete basic fuctions of graph database, such as ACID-compatible transactions, programming APIs, and associated tools. It is ideal for learning TuGraph and implementing small projects.
+
+## 3.TuGraph features
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property graph model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+## 4.TuGraph Enterprise Edition
+
+The Enterprise Edition has more comprehensive support for commercial features, including distributed cluster architecture, a one-stop graph platform covering exploration, research and development, service and operation and maintenance throughout the lifecycle, online, near-line, and offline graph computing engines, support for streaming and big data data sources, multi-site and multi-center deployment, making it an ideal choice for commercial solutions.
+
+```text
+    If you need to implement production-level high-availability cluster architecture, operation and maintenance and other enterprise-level services, please contact us to obtain commercial support:
+    Email:tugraph@service.alipay.com
+    Tel:0571-85022088,extension number 83789993#
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..095b108d91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/4.schema.md
@@ -0,0 +1,144 @@
+# TuGraph schema  Instructions
+## 1.The data model
+
+### 1.1.Graph model
+TuGraph is a strong schema, directed property graph database with multi-graph capability.
+
+- Graph Project: Each database service can host multiple graph projects (multi-graphs), and each graph project can have its own access control configuration. The database administrator can create or delete specified graph projects.
+- Vertex: Refers to entity, generally used to express real-world entities, such as a movie or an actor.
+    - Primary Key: User-defined vertex data primary key, unique in the corresponding graph project and vertex type.
+    - VID: Refers to the auto-generated unique ID of the vertex, which cannot be modified by the user.
+    - Upper Limit: Each graph project can store up to 2^(40) vertex data.
+- Edge: Used to express the relationship between vertexs, such as an actor appears in a movie.
+    - Directed Edge: The edge is a directed edge. If you want to simulate an undirected edge, the user can create two edges with opposite directions.
+    - Duplicate Edge: TuGraph currently supports duplicate edges. If you want to ensure the uniqueness of the edge, you need to implement it through business policies.
+    - Upper Limit: Up to 2^(32) edge data can be stored between two vertex data.
+- Property Graph: vertexs and edges can have properties associated with them, and each property can have a different type.
+- Strong-typed: Each vertex and edge has only one label, and after creating a label, there is a cost to modify the number and type of attributes.
+    - Specify the starting/ending vertex type of the edge: You can limit the starting and ending vertex types of the edge, and support different vertex types of the starting and ending vertexs of the same type of edge, such as individuals transferring money to companies, companies transferring money to companies. After specifying the starting/ending vertex type of the edge, you can add multiple sets of starting/ending vertex types, but you cannot delete the restricted starting/ending vertex types.
+    - Unrestricted Mode: Supports creating edge data of this type between any two vertex types without specifying the starting and ending vertex types of the edge. Note: After specifying the starting/ending vertex type of the edge, the unrestricted mode cannot be used again.
+
+### 1.2.The data type
+
+TuGraph Supports a variety of data types that can be used as attributes, the specific supported data types are as follows:
+
+<caption>Table 1. TuGraph supported data types</caption>
+
+| **Type** | **Min**             | **Max**             | **Description**                                  |
+|----------|---------------------|---------------------|--------------------------------------------------|
+| BOOL     | false               | true                | Boolean                                          |
+| INT8     | -128                | 127                 | 8-bit int                                        |
+| INT16    | -32768              | 32767               | 16-bit int                                       |
+| INT32    | - 2^31              | 2^31 - 1            | 32-bit int                                       |
+| INT64    | - 2^63              | 2^63 - 1            | 64-bit int                                       |
+| DATE     | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" Date of format                      |
+| DATETIME | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD hh:mm:ss[.ffffff]"Format of the date and time |
+| FLOAT    |                     |                     | 32-bit float                                     |
+| DOUBLE   |                     |                     | 64-bit float                                     |
+| STRING   |                     |                     | A string of variable length                      |
+| BLOB     |                     |                     | Binary data                                      |
+| POINT    |                     |                     | EWKB format data of point                        |
+| LINESTRING |                   |                     | EWKB format data of linestring                   |
+| POLYGON  |                     |                     | EWKB format data of polygon                      |
+
+_BLOB data is BASE64 encoded in input and output_
+
+### 1.3.Index
+
+TuGraph supports indexing vertex fields.
+
+Indexes can be unique or non-unique. If a unique index is created for a vertex label, TuGraph will perform a data integrity check to ensure the uniqueness of the index before modifying the vertex of the label.
+
+Each index built on a single field of a label, and multiple fields can be indexed using the same label.
+
+BLOB fields cannot be indexed.
+
+TuGraph supports creating indexes on node or edge attributes to improve query efficiency. Its characteristics are as follows:
+- Each index is created based on an attribute of a node or edge, and indexes can be created on multiple attributes of the same node or edge.
+- If a unique index is created for a node label, when modifying a node for that label, a data integrity check is first performed to ensure the uniqueness of the index.
+- Attributes of type BLOB cannot be indexed.
+
+There are multiple index types for TuGraph's vertices and edges. Different index types have different functions and restrictions, as follows:
+
+#### 1.3.1 Node index
+##### 1.3.1.1 unique index
+
+The unique index of a node refers to a globally unique index. That is, if a unique index is set for an attribute, in the same graph, the attribute of nodes with the same label will not have the same value.
+The maximum length of a unique index key is 480 bytes. **Unique indexes cannot be created for attributes exceeding 480 bytes**.
+Primary is a special unique index, so the maximum key length is also 480 bytes.
+
+##### 1.3.1.2 non_unique index
+
+The non_unique index of a node refers to a non-global unique index, that is, if an attribute is set with a non_unique index,
+In the same graph, nodes with the same label can have the same value for this attribute.
+Since a key in a non_unique index may be mapped to multiple values, in order to speed up search and writing,
+The maximum value of a group of vids with the same index key is added after the user-specified key.
+Each vid is 5 bytes long, so the maximum length of a non_unique index key is 475 bytes.
+However, unlike unique indexes, non_unique indexes can also be established if they exceed 475 bytes.
+However, when indexing such an attribute, only **the first 475 bytes** will be intercepted as the index key (the value stored in the attribute itself will not be affected).
+Moreover, when traversing through an iterator, the first 475 bytes of the query value are automatically intercepted before traversing.
+Therefore, the results may be inconsistent with expectations and require users to filter again.
+
+#### 1.3.2 Edge index
+
+##### 1.3.2.1 unique index
+
+Similar to node, the unique index of an edge refers to a globally unique index. That is, if an attribute is set to a unique index, in the same graph, the attribute of the edge with the same label will not have the same value.
+The maximum length of a unique index key is 480 bytes. **Unique indexes cannot be created for attributes exceeding 480 bytes**.
+
+##### 1.3.2.2 pair_unique index
+
+pair_unique index refers to the unique index between two nodes, that is, if an attribute sets a unique index, between the same set of the starting node and the ending node in the same graph,
+Edges with the same label will not have the same value for this attribute. In order to ensure that the pair_unique index key does not repeat between the starting node and the end node of the same group,
+The index adds the starting and ending vids after the user-specified key. Each vid is 5 bytes in length.
+Therefore, the maximum key length is 470 bytes, and **a pair_unique index cannot be created for attributes exceeding 470 bytes**.
+
+##### 1.3.2.3 non_unique index
+
+Similar to node, the non_unique index of an edge refers to a non-global unique index, that is, if an attribute sets a non_unique index,
+In the same graph, edges with the same label can have the same value for this attribute.
+Since a key in a non_unique index may be mapped to multiple values, in order to speed up search and writing,
+The maximum value of a group of eids with the same index key is added after the user-specified key.
+Each eid is 24 bytes in length, so the maximum length of a non_unique index key is 456 bytes.
+However, unlike unique indexes, non_unique indexes can also be established if they exceed 456 bytes.
+However, when indexing such an attribute, only **the first 456 bytes** will be intercepted as the index key (the value stored in the attribute itself will not be affected).
+Moreover, when traversing through an iterator, the first 475 bytes of the query value are automatically intercepted before traversing.
+Therefore, the results may be inconsistent with expectations and require users to filter again.
+
+## 2. Graph Project, Vertex, Edge, and Attribute Naming Conventions and suggestions
+
+### 2.1 Naming Rules
+Graph projects, vertices, edges, and attributes are identifiers. This section describes the allowed syntax for identifiers in TuGraph.
+The table below describes the maximum length and allowed characters for each type of identifier.
+
+|**Identifier** |**Length** |**Allowed Characters**|
+|---------  |---------  |---------  |
+|User, role, graph project	|1-64 characters	|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+|Vertex type, edge type, attribute	|1-256 characters		|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+
+### 2.2 Usage Restrictions
+
+|**Description**|	**Maximum number**|
+|-------- |--------- |
+|Number of users, number of roles	|65536|
+|Number of graphs	|4096|
+|Number of vertex and edge types per graph	|4096|
+|Number of attributes per type	|1024|
+
+Note:
+1.Special characters and keywords: When using special characters or keywords, they need to be enclosed in backquotes (``) for reference;
+
+Example: ```match (`match`:match) return `match`.id limit 1```
+
+2.Case sensitivity: TuGraph is case-sensitive;
+
+3.Graph project, vertex/edge, and attribute names can be reused, but attribute names under the same vertex or edge cannot be duplicated;
+
+4.Reserved keywords for attribute names: SRC_ID / DST_ID / SKIP.
+
+### 2.3 Naming Suggestions
+|**Identifier**|**Description**|**Suggestions**|
+|-------|-------|--------|
+|Graph project	|Start with a letter or Chinese character	|Examples: graph123, project123, etc.|
+|Vertex/edge type	|Start with a letter or Chinese character and use underscores to separate words		|Examples: person, act_in, etc.|
+|Attribute	|Letters or Chinese characters	|Examples: name, age, etc.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..de894fa1b0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# Performance Oriented
+
+> This document mainly introduces TuGraph's performance-oriented design philosophy as an open-source graph database.
+
+## 1.Introduction
+
+TuGraph is currently the fastest graph database in the world, ranking first in the LDBC SNB Interactive graph database standard evaluation (March 2023). The design of TuGraph is based on performance optimization, and is committed to building a high-performance single-machine graph database. This document describes the core design of TuGraph's storage layer based on performance optimization.
+
+## 2.Characteristics of Graph Operations
+
+Operations on property graphs involve reading, writing, and their attributes, and the access patterns of some special attributes such as timestamps can also affect overall performance. Here, by summarizing the regularities of some graph operation characteristics, we can guide the final performance.
+
+We observe that many graph applications have similar data access patterns. For example, in credit risk control, we use recursive path filtering to search for many-to-one patterns to find suspicious credit fraud users and behaviors. For online gambling, we can identify gambling-related fund accounts by recognizing multiple fund transfers in a short period of time. The equity penetration scenario recursively calculates the equity relationship between entities. These scenarios have common patterns such as multi-hop entity and relationship access, time window constraints, and read/write transactions.
+Furthermore, from the discussion in the introduction and the analysis of graph workloads, the following characteristics can be summarized:
+
+**Characteristic 1** KHop is the most typical operation in a graph, based on the data access pattern of the graph topology of points and edges, and has essential differences from relational databases. The typicality of KHop is not only reflected in the different data access patterns, but it is also the performance point that graph databases need to pay attention to the most.
+
+**Characteristic 2** Data access of graph workloads has a certain degree of locality on the topology, and the edges of the same point are usually accessed simultaneously. When the labels of these edges are the same, there is a greater probability of simultaneous access.
+
+**Characteristic 3** When accessing points and edges in graph workloads, their corresponding attributes are usually accessed as a traversal filter condition.
+
+**Characteristic 4** In time-based graph workloads, filtering of points and edges is usually within a certain time range, such as the past week.
+
+**Characteristic 5** Write operations may be accompanied by a large number of read operations, which need to be processed in a single transaction cycle.
+
+Through the analysis of actual online graph applications, the read/write ratio of graph workloads is about 20:1, although the scenarios are limited to the financial field and the number of clusters is also limited, the scale of the data involved and the number of users are very large, which is representative to some extent. The 20:1 read/write ratio of graph workloads indicates that the impact of read workload on overall performance is greater, and the performance of write workload cannot be ignored either.
+
+## 3.Storage Data Structures
+
+TuGraph uses B+ trees as the underlying data structure to support real-time transactional operations for insertion, deletion, querying, and updating.
+
+In sorting tree data structures, B+ trees and LSM trees are the main representatives. B+ trees use a split and merge method to update sorted data in tree nodes, while LSM trees append updates to logs for delayed data merging. B+ trees were originally used in file system implementations, solving the problem of differences in performance between sequential and random operations on hard disks by storing data in adaptive-length leaf nodes, and have a relatively balanced read/write performance. The main advantage of LSM trees is to use WAL (Write Ahead Log) to perform updates, which turns update operations into sequential operations, especially in the case of small key-value pairs. WAL means that the update of data is deferred until it is merged in batches, which can improve the comprehensive efficiency of batch updates, but also makes the system scheduling more complicated. If the update merge is not completed, and the data is read again, LSM trees need to read several levels of locally merged logs, which will cause read amplification and space amplification, thereby affecting read efficiency.
+
+To sum up, B+ trees have better sequential read/write performance, while LSM trees have advantages in random write data. In addition, the way of LSM trees using background merging makes the performance fluctuation difficult to predict, and the correlation between performance fluctuation and upper-level storage and computation is weak, which increases the overall design cost. Considering the above factors, TuGraph chooses B+ trees as the implementation for read performance optimization.
+
+## 4.Data Encoding
+
+For property graph models, in addition to graph topology encoding, property data also greatly affects functionality and performance. We first discuss how property data can be encoded together with topology data. From current research, there are two ways of encoding properties: discrete encoding, which stores property data separately based on pointer indexes, and compact encoding, which packs property data and topology data together. Discrete encoding can store each property separately or pack each edge's properties separately, and the following discussion applies to both situations.
+
+Vertex Query: Property encoding mainly focuses on edges and does not involve vertex queries.
+
+Single-Edge Query: Discrete encoding locates edges through pointers, while compact encoding requires binary search to locate the edge position. Discrete encoding has a slight advantage.
+
+Edge Traversal: Discrete encoding requires constant random access through pointer jumps during edge traversal, while compact encoding arranges data together in advance, greatly improving efficiency due to its sequential access feature. Since edge traversal operations are common according to Rule 3, compact encoding has obvious advantages in edge traversal.
+
+Single-Edge Update: Discrete encoding only requires finding the corresponding pointer position and modifying the pointer's location before and after inserting data. Compact encoding needs to re-encode the compactly arranged data and rewrite the entire edge value, resulting in significant overhead compared to discrete encoding.
+
+Batch Edge Update: Batch updates can pre-build all edge properties for a vertex in memory and write them in one encoding, making both discrete encoding and compact encoding equivalent. However, compact encoding does not require storing pointer variables, so it has higher storage space efficiency.
+
+The performance issues of discrete encoding and compact encoding for a certain type of query discussed above can be alleviated through optimization. Overall, due to the 20:1 read-write load of graphs and the characteristics of property access revealed by Rule 3, TuGraph tends to use compact encoding to ensure read performance. Its main weakness is the overhead of re-encoding during single-edge updates, which can be solved using adaptive mapping technology.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3407932273
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,33 @@
+# Multi Level Interfaces
+
+> This document mainly introduces the design concept of TuGraph's multi-level interfaces.
+
+## 1.Introduction
+
+The multi-level interface is a balance between usability and high performance that TuGraph has designed to meet a variety of use cases. For example, Cypher, a declarative graph query language, can abstract away the implementation details of a graph database and express queries based on the graph model. However, Cypher's high-level descriptions cannot be efficiently translated into low-level execution, so TuGraph provides a procedural language, Procedure API, to achieve optimal database performance.
+
+Interfaces can be roughly divided into client interfaces and server interfaces. Most operations are performed on the server, and the client only does data encapsulation and parsing. The client and server are connected through a network, and TuGraph supports both flexible short-connection REST protocol and more efficient long-connection RPC protocol, which can be selected according to different business scenarios.
+
+The server interfaces are all at the calculation layer and are logically separated from the graph data storage by a Core API layer.
+
+![Multi Level Interfaces](../../../../images/multi-level-Interfaces-en.png)
+
+### 2.Client Interface
+
+The client interface refers to the interface executed on the client and is typically used for integration into software applications. TuGraph's client interface is relatively simple, including login/logout, data import/export, stored procedure loading and calling, and Cypher operations. Cypher integrates most of the functions, including data operations, graph model operations, operations and account management.
+
+Since the parameters and return values of Cypher are strings, JAVA OGM is a structured wrapper for Cypher, meaning that query results can be encapsulated into a typed object for ease of use.
+
+### 3.Server Interface
+
+The server interface includes Cypher, Procedure API, OLAP API, and GNN PI, which provide services for graph transaction engines, graph analysis engines, and graph neural network engines. The characteristics of each interface are explained in detail below.
+
+> __Cypher__ is an abstract description of query logic that is independent of execution logic and is more user-friendly for graph database applications, similar to the SQL language of relational databases. TuGraph's Cypher language mainly follows the OpenCypher query standard open-sourced by Neo4j and extends auxiliary functions such as operations and maintenance management. Descriptive graph query language will become the main data operation method for graph databases, but generating the optimal execution plan between description and execution still requires a long way to go in both academia and industry.
+
+> __Procedure API__ is designed to bridge the gap between descriptive graph query language and optimal performance. TuGraph's Procedure API provides a simple wrapper on top of the Core API, which maximizes the storage's performance efficiency and is the upper limit of Cypher optimization performance. Python Procedure API is a cross-language wrapper on top of C++ Procedure API, but the copying of values during translation may result in some performance loss, and its advantage lies mainly in the ease of use of the Python language. The traversal API is a parallel-executing Procedure interface that is more similar to set operations in terms of description, such as expanding all outgoing neighbors of a point set to obtain a new point set.
+
+> __OLAP API__ belongs to the category of "graph computing systems" and exports snapshots of graph data from storage that supports insert, update, delete, and query operations to support read-only complex graph analysis in a more compact data storage format. OLAP API encapsulates data structures that support high-concurrency execution, including Vector, Bitmap, and CSR-based graph snapshot data structures, and provides a set of concurrent fast point-edge operation frameworks. After the graph analysis task is completed, the data can be written back to the graph database through the interface.
+
+> __GNN API__ mainly provides the interfaces needed for graph neural network applications and can be integrated with machine learning frameworks such as PyTorch. TuGraph's GNN PI mainly integrates DGL and completes the entire process from graph storage to graph neural network application in the Python language environment.
+
+Except for Cypher's interpretive execution, all other server interfaces are compiled and executed, meaning that the corresponding code needs to be sent to the server and compiled (which may take some time) before execution on the server. Therefore, it is usually necessary to load the program first, then find it in the list of loaded applications, and execute it after passing in the input parameters.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..080cc02e48
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> This document mainly introduces the design philosophy of TuGraph's HTAP.
+
+## 1.Introduction
+
+![htap](../../../../images/htap-en.png)
+
+There are different ways to implement HTAP in architecture: one is to use two different copies to handle OLTP and OLAP tasks separately, with the core being data consistency synchronization and additional resource overhead; the other is to use the same data storage at all times, but this implementation has memory bloat in its data structure and needs further work for industrialization. In TuGraph's design, simple OLAP and OLTP operations share the same data, while complex OLAP operations are exported and handled separately as snapshots.
+
+## 2.Design
+
+In TuGraph, OLTP is the graph transaction engine, corresponding to transaction operations in Figure; OLAP is the graph analysis engine, corresponding to simple graph analysis operations (such as SPSP) and complex graph analysis operations (such as PageRank), the former of which can be executed directly on the graph storage, while the latter requires exporting a snapshot for execution.
+
+- Transaction operations, measured by the graph transaction engine, are local graph add, delete, query and modify operations, typically used for K-hop access.
+- Simple analysis operations are the simpler part of the graph analysis engine, usually local graph analysis operations, such as the shortest path algorithm SPSP and Jaccard algorithm.
+- Complex analysis operations are the more complex part of the graph analysis engine, usually involving multi-round data iteration operations across the entire graph, such as the PageRank algorithm for webpage ranking and the Louvain algorithm for community discovery.
+
+As shown in Figure , external storage is added to the architecture diagram, making the data source for graph analysis not limited to the graph database and can be directly read from text files.
+
+- Graph storage, which is the storage in the graph database, has carefully designed data structures that can perform real-time add, delete, query and modify operations.
+- External storage, which can be an RDBMS or text file, is stored in a simple way as an edge table, only for one-time batch reading and batch result writing. In the calculation layer, it corresponds to the interface in the overall architecture diagram.
+- Cypher, the declarative graph query language, can be executed concurrently.
+- Procedure API, the procedural graph query language, is flexible and can support both transaction operations and graph analysis operations, but its efficiency is not sufficient to complete complex graph analysis operations, and it can be executed concurrently.
+- OLAP API, for multi-round iteration of complex graph analysis. Applications need to first export the graph data in storage into a snapshot in memory, which is only used for fast access and does not need to consider the write support of ACID, so it can be arranged more compactly, and the read efficiency of CSR arrangement is much higher than that of graph storage data arrangement. OLAP API can only be executed serially, and each operation uses full CPU resources.
+
+OLAP API snapshots can be created from external storage, where the edge table data is formatted as CSR, or from the graph storage. It should be noted that OLAP API requires that the IDs of the vertices be consecutive natural numbers, which may require additional ID mapping. This step can be mapped to a specified attribute when creating a snapshot or directly using the attribute value as the ID.
+
+Corresponding to the calculation interface and storage, there are four operating modes.
+
+- Transaction mode, each operation corresponds to a Cypher statement, which is a transaction by default.
+- Plugin mode, call through plugins, after the calculation logic is loaded on the server, also known as stored procedures.
+- Embed mode, which has the same interface as Plugin mode but the graph database service does not need to be started and can directly call the data in the database through the interface. This mode is usually used for debugging Procedure API and OLAP API code, and the debugging information and operation steps are more friendly than Plugin mode.
+- Standalone mode, which maximally separates from the graph database, is more direct when only using the graph analysis engine for data analysis. Standalone mode will directly use the data of the external storage.
+
+The use of the graph neural network engine is similar to the 'complex graph analysis operation', which calls part of the OLAP API and GNN API at the same time, which is not elaborated here.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..b42c13eac8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Characteristics
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..198facd84b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# Architecture
+
+> This document mainly introduces the product architecture of TuGraph.
+
+## 1.Introduction
+
+![Architecture](../../../images/architecture-en.png)
+
+The following diagram shows the overall architecture of an enterprise-level graph database from the perspective of functional modules, using TuGraph as an example, from bottom to top:
+
+- Software and hardware environment. This involves the development and use environment of the graph database. TuGraph is mainly developed based on the underlying C++ language, and is compatible with most operating systems and CPUs on the market.
+- Storage layer, including the KV storage layer and the graph storage layer. The storage layer needs to support various functions required by the calculation layer.
+- Calculation layer. The calculation layer should include the graph transaction engine, graph analysis engine, and graph neural network engine. It also includes a variety of programming interfaces provided by the server, including descriptive query language Cypher, stored procedures, and so on.
+- Client. The client SDK should support multiple languages such as Java, Python, and C++, and also support command-line interaction. The Browser and Explorer reduce the threshold for using the graph database through web-based interaction.
+- In terms of ecological tools, it covers the development, operation, and management links of enterprise-level graph databases, improving usability.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..c8bc65a993
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/7.functionality.md
@@ -0,0 +1,99 @@
+# Functionality
+
+> This document mainly introduces the main functions and features of TuGraph.
+
+## 1.Installation
+
+## 1.1.Installation
+
+Deployment methods TuGraph currently provides three deployment methods: cloud deployment, Docker deployment, and local package deployment. Users can choose the appropriate deployment method according to their actual situation.
+
+## 1.2.Software and Hardware Environment
+
+TuGraph core is developed in C++, and the default compiler used is GCC8.4, using c++14 standard. Some functions use other compilers, such as ApacheLucene-based full-text indexing, which uses JNI interface and requires a Java compiler. In addition, the Python Procedure API is provided in the stored procedure, which requires a Python environment. TuGraph does not require special hardware such as GPUs, and can naturally adapt to general hardware upgrades such as RDMA and HBM with high latency and low bandwidth.
+
+TuGraph has been tested on CPUs based on X86 and ARM, including Intel, AMD, Kunpeng, Hygon, Feiteng, etc., and also runs on multiple operating systems, including mainstream versions of Ubuntu, CentOS, SUSE, Galaxy Kylin, Zhongbiao Kylin, and UOS, without special requirements for operating systems and CPUs.
+
+The software and hardware environment also includes the environment of dependent libraries. Since the default KV storage in TuGraph's storage layer is LMDB, the file system needs to support POSIX interfaces. The compilation and parameter configuration in different environments will be slightly different. For example, in the packaging of point-edge data in graph storage, it should match the page table size of the operating system, which is 4KB by default, and it is recommended to set the system's page table size to 4KB.
+
+## 2.Storage layer
+
+In the graph data model, TUGraph supports the attribute graph model, which can be divided into subgraphs, tags (including vertex tags and edge tags), and attributes according to the hierarchy.
+
+From the perspective of the storage layer, TuGraph uses an intuitive multi-layered tree model, without tags across subgraphs or attributes across tags, and only retains the core logic of the graph model. In terms of subgraph storage, TuGraph has performed data physical isolation for multiple graphs, and each graph corresponds to an instance of LMDB. The metadata description information of multiple graphs is saved in a special public LMDB instance called meta. The storage of vertex and edge tags and their attributes maps graph data adaptively to KV key-value pairs, maximizing read performance. At the same time, multi-threaded writing is implemented at the KV layer, solving the disadvantage of low write performance of LMDB. Primary key indexes and secondary indexes correspond to B+ tables in LMDB, supporting index value addition, deletion, query, and modification based on comparison.
+
+The storage layer also retains some other non-core functional data, including permission data, pre-compiled plugin data, and monitoring data.
+
+## 3.Calculation layer
+
+The calculation layer is divided into three parts in terms of function, including the TP-class graph transaction engine, the AP-class graph analysis engine, and the graph neural network engine.
+
+__The graph transaction engine__ is mainly used to process concurrent graph operations, including single-point queries, neighbor queries, and path traversal. The graph transaction engine focuses on ACID transactions of concurrent operations, ensuring that the operation logic will not interfere with each other. The main performance indicator is QPS, which is the number of completed queries per second.
+
+__The graph analysis engine__ usually operates as a full-graph iteration. Some simple analysis tasks (such as SPSP) can be completed by the graph transaction engine, and complex analysis tasks are completed by the graph analysis engine, which usually takes several seconds to several hours for a single task. Therefore, a single graph analysis task should use all hardware resources in parallel, and the performance indicator is the total time for completing the task.
+
+__The graph neural network engine__ usually operates as a full-graph iteration. In addition to graph topology-based operations, the graph neural network engine also needs to integrate a machine learning framework to handle vector operations, such as PyTorch, MXNet, and TenserFlow.
+
+The logic of the three engines is different and independently configured for resource pools. The graph transaction engine sets up a thread pool based on RPC operations. For each operation received from the client, a thread is taken from the pool to process it, and the number of concurrent executions is equal to the capacity of the RPC thread pool, which is usually configured as the number of server cores. The graph analysis engine has an analysis thread pool, and each graph analysis task is executed concurrently, that is, all threads are used to execute a task to speed up the performance of the operation. The serial execution feature of TuGraph graph analysis operations will restrict the user experience to a certain extent. The demand for concurrent graph analysis can be processed by deploying high-availability, increasing machine resources, or connecting to an external task scheduler to transfer data to a container for real-time scheduling and calculation. Graph neural network operations will reuse the resources of the graph transaction
+
+## 4.Core Features
+
+### 4.1.Query Language
+
+TuGraph provides Cypher graph query language that follows the OpenCypher standard.
+- Supports Procedure embedding.
+- Supports pluggable optimization frameworks with various optimization features.
+- Supports extensible security check framework for Cypher.
+
+### 4.2.Stored Procedures
+
+When users need to express complex query/update logic that Cypher cannot describe, or when high performance is required, TuGraph's stored procedures (Procedure) is a more concise and efficient choice than calling multiple REST requests and completing the entire processing flow on the client-side.
+
+### 4.3.Data Import/Export
+
+Although TuGraph supports data insertion, batch import can greatly improve efficiency. The import function can be divided into importing into an empty database (offline import) and incremental import. The former refers to importing when the subgraph is empty, and the additional assumption can greatly improve the import performance. In TuGraph, the throughput rate of empty database import and incremental import differs by 10 times. Data consistency needs to be considered in data export, which is based on exporting data based on a snapshot.
+
+TuGraph can perform data export on graph data already stored in TuGraph using the command-line tool `lgraph_export`. The export format supports CSV and JSON.
+
+### 4.4.Backup and Restore
+
+ TuGraph's backup function can be divided into active/scheduled, offline/online, and full/incremental backup. The goal is to complete the backup with the smallest storage and computing costs possible. The Restore function can restore to the latest state or a historical marked time point, ensuring that the database is in a consistent state.
+
+### 4.5 Data Warmup
+
+TuGraph is a disk-based graph database, and data is loaded into memory only when it is accessed. Therefore, system performance may deteriorate due to frequent IO operations in the first period after the server is opened. We can improve this problem by preheating the data in advance.
+
+### 4.6 High Availability Mode
+
+High availability means that by configuring a cluster, real-time multi-replica data hot backup can be achieved, and the cluster can still provide services when some replicas are not in use. TuGraph uses the multi-machine hot backup mechanism of the RAFT protocol, which can reduce RPO to near 0. Data synchronization is performed at the computation layer through RPC interfaces for write operations. The high availability cluster of TuGraph adopts a master-slave mode, where only the master node processes write requests, and both master and slave nodes can process read requests. The write request processing of the master node needs to be synchronized to more than half of the total nodes. The write request is considered complete when the majority of the nodes have written successfully.
+
+## 5.Client Tools
+
+Client Tools Client tools mainly include SDKs for various programming languages, OGM, and command-line tools.
+
+The client SDK is mainly used for secondary development and can be linked to the server through RPC or REST protocols. RPC has better performance based on long links, and data needs to be uniformly serialized through protobuf. TuGraph uses brpc, which supports rpc clients in Java, Python, and C++. REST's protocol is more flexible and can be easily adapted to more diverse environments, and different programming languages can easily connect. TuGraph provides a Python REST client instance, and command-line interaction is also implemented using REST.
+
+OGM (Object Graph Mapping) is a graph object mapping tool for TuGraph, which supports mapping JAVA objects (POJO) to TuGraph. Classes in JAVA are mapped to nodes in the graph, collections in classes are mapped to edges, and properties of classes are mapped to properties of graph objects. It also provides corresponding function to operate the graph database. Therefore, JAVA developers can easily use TuGraph database in a familiar ecosystem.
+
+The command-line tool `lgraph_cypher` is a query client that can be used to submit OpenCypher requests to the TuGraph server. `lgraph_cypher` client has two execution modes: single-command mode and interactive mode.
+
+
+## 6.Ecological Tools
+
+Ecological tools are a crucial component of enterprise-level databases, and a rich array of ecological tools can greatly enhance the usability and stability of graph databases.
+
+### 6.1.TuGraph DataX
+
+![Import&Export](../../../images/tugraph-datax.png)
+
+TuGraph's core supports importing and exporting CSV and JSON data, offering both full database and incremental importing modes. In practice, there may be a need to import from multiple data sources such as MySQL, Kafka, and Hive, and TuGraph connects to these sources using DataX. Due to the differences between relational and graph models, data cleaning processes can be quickly processed using SparkSQL. TuGraph focuses only on the reliability and performance of simple CSV and JSON scenario imports.
+
+### 6.2.Visual Interaction
+
+TuGraph Browser is a visual interface for direct users of graph databases, covering most of TuGraph's capabilities, including data import, graph model building, data addition/deletion/query/modify, and monitoring and maintenance operations.
+
+### 6.3.Monitoring
+
+TuGraph uses the Prometheus + Grafana monitoring framework in a loosely coupled manner. Prometheus obtains monitoring information from TuGraph's monitoring interface, stores it in a local time-series database, and then displays it interactively on the web using Grafana.
+
+The monitoring states provided by TuGraph include the state of the graph database and the state of the server. The former includes the database-side status such as read/write load and number of vertices/edges, while the latter includes the real-time status of the server's memory, CPU, and hard disk. If some monitoring state exceeds the expected threshold, proactive alerts are necessary, usually requiring integration with other operations and control systems such as group messaging and email alerts.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..9d5a7ac434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# Scenarios
+
+> This document mainly introduces the application scenarios of graph databases.
+
+## 1.Financial Industry
+
+The entities in the financial industry mainly involve people, companies, accounts, products, etc., and their relationships include transaction relationships, logging relationships, equity relationships, employment relationships, etc. These entities form a financial graph data network. By applying graph databases, we can discover a lot of useful information from the financial graph data network, which helps us make more accurate financial decisions.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Loan review|By analyzing the applicant's relationship and transaction history, etc., it is auxiliary to judge the applicant's repayment ability and willingness. It can be applied to retail loan review, small and micro loan review, supply chain finance, etc. This method can complement the traditional audit mechanism based on the applicant's own information, which is particularly useful for small and micro loan audits with low individual information coverage.|
+|Post-loan|By analyzing the borrower's transaction history, it assists in analyzing whether the borrower has default risk. Compared with the traditional method of issuing alerts only when loan funds flow to specific users, this method can assign a risk value to each account and issue warnings when the loan flows to high-risk accounts.|
+|Missing recovery|By analyzing the social and shopping data of missing borrowers, other contact methods can be found. This method can significantly improve the recovery rate of missing borrowers.|
+|Guarantor loop detection|Special guarantee structures such as cyclic, chain, family-style, and cross can be found in the guarantee relationship graph to expose potential risks. Compared with the JOIN method of a relational database, the solution based on graph algorithms is more efficient, can detect any length of guarantee loop, and can achieve more complex limited condition detection.|
+|Credit card fraud detection|A relationship network of addresses, contact information, etc. in credit card application information is constructed, and a community discovery algorithm is run in the application relationship network to detect suspected fraudulent gangs, thereby rejecting suspected fraudulent applications and reducing economic losses.|
+|Anti-money laundering|Suspected money laundering behaviors and links can be found through the transaction network and medium network. Money laundering is a complex process involving multiple parties. By conducting graph analysis in transaction and social networks, we can more accurately detect money laundering behaviors.|
+|Car insurance anti-fraud|For insurance fraud involving repair shops, by analyzing the relationship between the insured person, the case location, and the repair shop, fraudulent claims can be more accurately identified, reducing economic losses.|
+
+## 2.Industrial Industry
+
+A large amount of heterogeneous data will be generated in the production and manufacturing process, and how to effectively organize and manage these data is one of the most important issues in industrial big data. These data include design documents, equipment data, simulation plans and results, experimental results, experience documents, etc. The relationships between these data are complex, and traditional data management systems can only accumulate data, and they are often unable to search for related materials. Using graph models, these different types of data are organized into a network, which makes it easy to browse and search for data.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Supply chain management|Supply chain data mainly concerns the correspondence between products, components, and parts, the correspondence between parts and suppliers, and sensitive components in parts. Compared with the traditional BOM system, the solution using graph databases can more conveniently maintain complex networks of multiple component levels and multiple supplier levels, thereby providing basic support for a through supply chain.|
+|Document management|Using graph databases can organize different types of documents together organically according to different relationships. For example, design documents for components, component-part relationships, component test documents, relevant experience documents, etc. can be organized together so that all relevant information for the component can be obtained easily when needed.|
+|R&D process management|A large amount of simulation, experimentation, and testing needs to be performed in the product development and verification process. Each test process involves many different steps, the connection between the steps, the data versions used in each step, and the algorithm versions all make up a complicated relationship network. Using graph databases can better manage this relationship network, providing a good foundation for data reuse and process improvement in the R&D process.|
+|Equipment information management|Manufacturing requires the management of a large number of devices, which are interrelated (power supply, feeding, spatial relationship) to form a complex network. Traditional databases are difficult to reflect this complex relationship. Using graph databases can easily represent these relationships, thereby better managing equipment information.|
+
+## 3.Smart City
+
+With the development of technology, intelligent management of cities has become a major trend. Intelligent management requires a strong system software to support it, built on a good information management platform. In an intelligent city management system, an intelligent decision-making system needs to make decisions based on a large amount of different information, including various topology information (such as roads, pipelines, etc.), supply and demand information (such as electricity transmission, drinking water supply, sewage discharge, etc.), environmental information (such as temperature, humidity, rainfall, etc.), and so on. To manage these complex and heterogeneous data organically and make decisions based on them, a mature system is needed. Traditional data management systems based on relational data models are not suitable for managing such complex and heterogeneous data. Using a graph model can solve this problem well. If we manage these different data using a graph database, we can achieve many complex intelligent management scenarios.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Smart Traffic|Based on road topology, road capacity, and current traffic flow, intelligent traffic signal scheduling can be performed to improve traffic efficiency.|
+|Smart Drainage|Based on drainage system information and current rainfall, the drainage system can be scheduled to reduce the occurrence of waterlogging.|
+|Pipeline Management|Organizing the production, installation, topology information, and historical status information of pipelines can help us manage the pipelines throughout their lifecycle, including fault diagnosis, life assessment, etc.|
+|Crowd Evacuation|When a large number of people need to be evacuated, multiple transportation modes such as buses, subways, taxis, shared bicycles, etc., need to be considered, as well as the road carrying capacity. Using a graph database to organically integrate this information can help us make better decisions and provide better support for large public events.|
+
+## 4.Social Governance
+
+Social governance involves public safety, legal affairs, public opinion, network security, and more. Social governance is a comprehensive, multi-system linkage problem. It requires the synthesis of a large amount of data and global considerations to make better decisions. In this multidimensional and complex data problem, the graph data model can provide better adaptability and provide a solid foundation for intelligent social governance decision-making platforms.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Criminal Gang|Conspiratorial gangs will inevitably make contact through some means, including face-to-face meetings (appearing in the same place), phone calls, or internet contacts, and they may also have economic exchanges. If we store all of this data in a unified graph, we can use graph analysis algorithms to identify closely connected groups and then discover and identify the entire criminal gang.|
+|Stakeholder Case Investigation|Stakeholder cases, especially stakeholder economic cases, often involve a large number of personnel and elements (money, location, events, etc.). How to effectively organize this information to provide evidence for handling cases is a difficulty in stakeholder case investigation. Using graph databases to store and analyze this information can help us quickly locate the data, analyze the personnel structure, and provide better technical support for case investigation.|
+|Illegal Website Identification|Illegal websites, phishing websites, yellow websites, and so on, often use different domain names and IPs to avoid being blocked. The filter method based on a blacklist can only block known illegal websites and cannot effectively identify new domain names and IPs. Based on the IP-domain name network mapping relationship, we can create a graph and then use graph calculations to establish a "trustworthiness" model for domain names and IPs to determine whether a website belongs to an illegal website.|
+|Court File Management|Case files are often complex, and different cases may be linked through parties, locations, case nature, judges, and so on. These links constitute a complex network. Using a graph database, we can more conveniently manage these complex relationships and improve case handling and query efficiency.|
+
+## 5.Internet
+
+Social networks and person-product purchase relationships can all form a network. By analyzing this network data, we can provide users with better services, including relevant recommendations, user information collection, important user identification, and spam user identification, and so on.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|ID-Mapping|Graph databases can store all user-related information, including the relationships between users, in one database, and can also use these relationships to identify situations where one person has multiple accounts or multiple people share an account, thus providing decision support for future risk control, recommendations, and other businesses.|
+|Friend Recommendation|Based on the analysis of social networks, we can provide friend recommendations such as "friends of friends" and "common friends".|
+|Product Recommendation|Based on the user-product relationship graph, we can find users with similar interests and recommend other products that similar users have chosen.|
+|Spam User Identification|Traditional spam user identification is mainly based on user account information, such as registration information and posting information, but these types of information are relatively easy to forge. On the other hand, network-based information doesn't have this problem: it's difficult to forge. Therefore, spam user identification based on network information can be more accurate and efficient.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..6f2aa1629a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/9.glossary.md
@@ -0,0 +1,27 @@
+# Glossary
+
+## 1.Graph Technology
+
+> __Graph Computing__:Generalized graph computing, including graph databases, graph analysis, and graph learning; Narrowly defined graph computing only includes graph analysis. The generalized definition is used by default.
+
+> __Graph Database__:Focuses on operations such as adding, deleting, modifying, querying, and transaction processing for graph data, such as TuGraph DB.
+
+> __Graph Analysis__:Focuses on algorithmic analysis and pattern analysis of entire graph data, such as TuGraph Analytics.
+
+> __Graph Learning__:Refers to the same meaning as graph neural networks and graph machine learning, such as TuGraph Learn.
+
+> __Graph Intelligence__:Same as generalized graph computing, including graph databases, graph analysis, and graph learning. It is usually used for conceptual promotion and not for products.
+
+## 2.Specific Concepts
+
+> __Vertex__:Also known as node or point. Avoid using the term "node" as it is often used to refer to the number of servers and can be easily confused. "Node" refers to the meaning of combination, intersection, and crossing; "node" can refer to a milestone on a timeline (key node) or a processing entity in a computer system (such as a server in a computer network).
+
+> __Edge__:Refers to the connection between two vertices.
+
+> __Degree__:Refers to the number of incoming or outgoing edges on a vertex. Note that in non-graph theory scenarios, "hops" are often referred to as "degrees".
+
+> __Hop__:Refers to the number of vertices between two vertices on a path (excluding the starting point and including the endpoint). "K-Hop" in the algorithm performance test refers to this meaning.
+
+> __Vertex Label__:Refers to the type of a vertex, also known as a point label.
+
+> __Edge Label__:Refers to the type of an edge, also known as an edge label.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/index.rst
new file mode 100644
index 0000000000..076b7d0434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph DB Introduction
+=================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..390a685659
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/1.preparation.md
@@ -0,0 +1,90 @@
+# Quick Start
+
+> This document is intended for new users to get started quickly and contains an introduction, features, installation, and use of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property Graph Model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+### 1.1.Supported Platforms
+
+TuGraph supports both X86_64 and ARM64 architectures in physical, virtual, and containerized environments.
+
+### 1.2.Hardware requirements
+
+_You are advised to use NVMe SSDS with large memory configurations for optimal performance。_
+
+| Hardware | Minimum Configuration | Recommended configuration |
+|----------|-----------------------|---------------------------|
+| CPU      | X86_64                | Xeon E5 2670 v4           |
+| Memory   | 4GB                   | 256GB                     |
+| Disk     | 100GB                 | 1TB NVMe SSD              |
+| System   | Linux 2.6             | Ubuntu 18.04, CentOS 7.3  |
+
+## 2.Installation
+
+TuGraph can be installed quickly via Docker Image or locally via RPM /deb packages.In addition, TuGraph offers community edition services on Alibaba Cloud Computing Nest, which means you don't need to purchase your own cloud host to quickly deploy TuGraph services and achieve operational monitoring, thus building your own graph application.
+
+> Installation package/image download: refer to the TuGraph-Latest-Version section in [Download address](../1.guide.md).
+
+> Computing Nest Deployment: You can search for it on Alibaba Cloud Computing Nest, or you can quickly access it through [deployment link] (../5.developer-manual/1.installation/5.cloud-deployment.md).
+
+### 2.1.Fast experience through Docker
+
+1. The Docker environment installed locally
+
+   The docker official documentation：https://docs.docker.com/get-started/
+
+2. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. Start docker
+
+   ```shell
+    docker run -it -d -p 7001:7001 -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 8888:8888 -p 8889:8889 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000 is default http port，for tugraph-db-browser accessing.
+   # 7070 is default http port，for legacy tugraph-web accessing.
+   # 7687 is bolt port, for neo4j client accessing.
+   # 9090 is default RPC port，for RPC client accessing.
+   
+   # The default data directory is /var/lib/lgraph/data and the default log directory is /var/log/lgraph_log,
+   # which is configured in the tugraph configuration file at /usr/local/etc/lgraph.json inside the docker.
+   # This command mounts the data directory and log directory to /root/tugraph/ on the host for persistence,
+   # which you can modify according to your actual situation.
+   ```
+
+4. Open by browser
+
+Accessing tugraph-db-browser: `http://x.x.x.x:8000`. Default account is `admin` and default password is `73@TuGraph`.
+The page will be redirected to the password modification page for the first login. Please modify the password according to the page prompt.
+
+**Note**: 
+Access `http://x.x.x.x:7070` if you want to access legacy tugraph-web, with default account `admin` and default password `73@TuGraph`.
+But please note that legacy web is no longer maintained, it is recommended to use tugraph-db-browser.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..2ec92747d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# DEMO:Movie
+
+> This document mainly introduces the usage of the movie demo.
+
+## 1.Modeling and Data Import
+
+After logging in, click "Help", click "Quick Start", click "One-Click Model Creation", click "One-Click Data Creation", and complete the creation of the Movie Scene Graph.
+
+Movie：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| Label       | Type   | Description                                                                                           |
+|-------------|--------|-------------------------------------------------------------------------------------------------------|
+| movie       | Vertex | Represents a specific movie, such as "Forrest Gump".                                                  |
+| person      | Vertex | Represents a person, who may be an actor, director, or screenwriter for a movie.                      |
+| genre       | Vertex | Represents the genre of a movie, such as drama, horror.                                               |
+| keyword     | Vertex | Represents some keywords related to the movie, such as "save the world", "virtual reality", "subway". |
+| user        | Vertex | Represents a user who watches movies.                                                                 |
+| produce     | Edge   | Represents the relationship between the producer of a movie.                                          |
+| acted_in    | Edge   | Represents the relationship between actors and the movies they have appeared in.                      |
+| direct      | Edge   | Represents the relationship between a movie and its director.                                         |
+| write       | Edge   | Represents the screenwriting relationship of a movie.                                                 |
+| has_genre   | Edge   | Represents the genre classification of a movie.                                                       |
+| has_keyword | Edge   | Represents some keywords of a movie, which are more specific labels for classification.               |
+| rate        | Edge   | Represents the rating given by a user to a movie.                                                     |
+
+## 2.Query Examples
+
+### 2.1.Example One
+
+Query all actors of the movie 'Forrest Gump' and return the subgraph composed of the movie and the actors.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.Example Two
+
+Query all actors of the movie 'Forrest Gump' and list the roles they played in the movie.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.Example Three
+
+Query all movies rated below 3 by Michael.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.Example Four
+
+Query users who have the same dislike of movies as Michael, where the standard for dislike is a rating of less than three.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.Example Five
+
+Recommend movies to Michael by first finding users who dislike the same movies as Michael, and then filtering out the movies that these users like.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.Example Six
+
+Query the movies that Michael's friends like.
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.Example Seven
+
+By querying the movies that people who gave 'Forrest Gump' a high rating also like, recommend similar movies to users who like 'Forrest Gump'.
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..e07192fa2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,48 @@
+# DEMO:Wandering Earth
+
+> This document mainly introduces the usage of the Wandering Earth demo.
+
+## 1.Demo Scene Design
+
+The demo is based on the story background of The Wandering Earth 1 and The Wandering Earth 2.
+
+- Based on the plot, a graph structure is designed, including three types of points: organization, character, celestial body, and facility, and two types of edges: event and relationship.
+- Prepared data corresponding to the schema based on the plot.
+- Prepared some queries to ask questions about the plot.
+
+## 2.Directory structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to queries.
+- control.sh: Script to control the start and stop of TuGraph Server.
+lgraph_standalone.json: Configuration file for starting TuGraph Server.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 4.Data Import
+
+- Modify DATA_PATH in import.json according to the data storage directory.
+- Refer to the load function in control.sh to load data.
+- Refer to the start function in control.sh to start TuGraph Server.
+- After starting TuGraph Server, access ${HOST_IP}:8888 to open the web page and confirm whether the data is successfully imported.
+
+## 5.Cypher Query
+
+Refer to the Cypher document and enter Cypher in the TuGraph web page frontend for queries.
+
+## 6.Usage Display
+
+### 6.1.Data Import Display
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.Query Display
+Query all event processes related to the crisis on Jupiter.
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+Query all event processes related to all crises.
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..64ea337fa8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# The Three Body
+
+> This document mainly introduces the usage of Three-Body demo.
+
+## 1.Demo Scenario Design
+The demo scenario is designed based on the story background of Three-Body 1, 2, and 3.
+
+According to the setting of the Three-Body story, we have designed 4 types of nodes and 6 types of edges. The nodes include "character", "organization", "plan", and "timeline", while the edges include "character-character relationship", "character-plan relationship", "character-organization relationship", "organization-plan relationship", and "organization-organization relationship". According to the plot, corresponding schema data and some queries have been prepared to propose some questions about the plot.
+
+## 2.Directory Structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to the query.
+- control.sh: Script to start and stop TuGraph Server.
+- lgraph_standalone.json: Configuration file for TuGraph Server startup.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+### 4.Data Import
+
+- Manual import
+    - Modify DATA_PATH in import.json according to the data storage directory.
+    - Refer to the load function in control.sh to load the data.
+    - Refer to the start function in control.sh to start the TuGraph service.
+    - After starting the TuGraph service, access ${HOST_IP}:8888 to open the web page and confirm whether the data is imported successfully.
+- Automatic creation
+    - Click `New Graph Project`, select Three-Body data, fill in the graph project configuration, and the system will automatically create the Three-Body scenario graph project.
+    - Alternatively, use the pre-installed Three-Body graph project provided by the product.
+
+### 5.Cypher Query
+
+Refer to the TuGraph documentation and enter Cypher in the TuGraph web page frontend to execute a query.
+
+## 6.Usage Demo
+
+### 6.1.Data Import Demo
+
+![data](../../../../images/three-body-data.png)
+
+### 7.Query Demo
+
+#### 7.1.Character Relationship Query
+In the plot of Three-Body 1, a large number of scientists committed suicide all over the world at the beginning, which aroused the attention of the police. During the investigation process, the truth behind it gradually surfaced step by step according to the clues of the character relationships, as shown in the above graph. Shi Qiang and Wang Miao discovered that most people had direct or indirect connections with Ye Wenjie, and sent Wang Miao undercover to finally discover Ye Wenjie's ultimate commander identity. As can be seen in the graph, there are many edge relationships (many one-degree or two-degree neighbors) around Ye Wenjie's vertex.
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.Neighbor Vertex Analysis
+There are many plans in Three-Body, and sometimes we may be confused. At this time, we can use the graph's neighbor vertex query to view the relevant characters and organizations of the plan. For example, in the "Wallfacer Project", we can see that there are four characters related to it, and these four are also the "Wallfacers" who are highly expected by the world.
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.Query Common Neighbors of Node A and B
+We often want to know who are the common related characters between two characters, so that we can quickly grasp the relationship between these two characters. In the case of large amounts of data, it is very convenient to use Cypher for graph relationship analysis!
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.Set/Change Properties
+As the plot progresses, we gradually learn about the various labels on "Ye Wenjie", so we can also update these labels to the "Ye Wenjie" node:
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.Add/Delete Nodes
+Later, we learned about characters such as Luo Ji and Cheng Xin, and organizations such as PIA and the Star Ring Group, and wanted to add them as nodes to the graph:
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..0bb359cbe0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# Three Kingdoms
+
+> This document mainly introduces the usage of the Three Kingdoms demo.
+
+## 1. Introduction
+Due to the lack of historical records, there are often many mysteries surrounding even well-known historical events. Taking the history of the Three Kingdoms as an example, why did Zhuge Liang come out of seclusion to help Liu Bei, and why there was a huge gap in achievements between Cao Cao and Liu Bei, both heroes of the time, are some of the unsolved mysteries. Historians in the past often used two-dimensional relationship analysis of history, and the conclusions drawn were often one-sided. Using TuGraph to import historical figures and events of the Three Kingdoms into a graph model, and analyzing them using graph calculation methods can help us obtain more valuable knowledge from limited information, which is a very meaningful interdisciplinary attempt.
+## 2. Data Modeling
+We designed 5 types of vertices and 5 types of edges. The vertices include "Lord", "Province", "Civilian", "Military Officer", and "Battle"; the edges include "Father", "Brother", "Belongs To", "Native Place", and "Participate In". The specific modeling information is shown below:
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. Data Import
+- Manual import
+    - To import data into TuGraph, you can use the lgraph_import tool to import it offline. The import command of lgraph_import is as follows:
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- Automatic creation
+    - Click `New Graph Project`, select the Three Kingdoms data, fill in the graph project configuration, and the system will automatically create the Three Kingdoms scene graph project.
+    - Or use the built-in Three Kingdoms graph project provided by the product directly.
+## 4. Cypher Query
+### 4.1. Why did Zhuge Liang Choose Liu Bei?
+The following Cypher command can be used to view the relationship between Zhuge Liang, Cao Cao, and Liu Bei:
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+From the graph, we can intuitively see that one of the shortest paths between Cao Cao and Zhuge Liang includes the battle of Xuzhou. Cao Cao once committed a massacre in Xuzhou because his father was killed, and nobody would choose a warlord who had previously massacred their hometown as their lord. In contrast, Liu Bei once prevented Cao Cao's violence during the battle of Xuzhou, which should be one of the reasons why Zhuge Liang had a good impression of Liu Bei.
+
+### 4.2. Why Did Cao Cao Achieve More Than Liu Bei?
+The following Cypher command can be used to view the family's support for Cao Cao's career:
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+The most important thing for pacifying the world is military talent. Cao Cao's father originally had the surname Xiahou, but was adopted into the Cao family. The Cao and Xiahou families were both local big clans in Qiao County, providing Cao Cao with a large number of military talents such as Xiahou Dun, Xiahou Yuan, Cao Ren, and Cao Hong in the early days of his career. In contrast, Liu Bei's father died early and he didn't have any family support. He only gathered his Five Tiger Generals when he was over 50 years old, by which time the best time to fight for land in the chaotic world had passed. Cao Cao had already controlled six of the nine provinces in the world.
+
+### 4.3. Why Did the Most Powerful Wei Kingdom in the Three Kingdoms Perish First?
+The following Cypher command can be used to view the important civilian officials of the Cao Cao group:
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+In fact, Cao Wei was overthrown in the Gao Ping Ling incident in 249 AD, after only 29 years of existence, which was shorter than Shu Han (43 years) and Dong Wu (51 years). The reason why the most powerful Wei Kingdom in the Three Kingdoms perished first was that the civilian official system of Cao Wei (the nine-rank system) made it easy for power to be concentrated in the hands of aristocratic families. From the graph, we can see that almost all the important civilian officials of Cao Cao and Cao Pi's generations were from aristocratic families, such as Xun Clan of Yingchuan, Zhong Clan of Yingchuan, Chen Clan of Yingchuan, Jia Clan of Wuxi, etc. There was even a trend of regionalization, centered on Yingchuan. Ultimately, the regime was usurped by the Sima family of Henei, which had close ties with the Xun Clan of Yingchuan.
+
+### 4.4. What Were the Strengths of Each of the Three Kingdoms?
+The following Cypher command can be used to view the population strength of each group in the Three Kingdoms:
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+The query result is shown in the following table:
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+In ancient society, an important indicator of a country's strength was its population. Since population data is missing, we estimate the population of each province using the birthplace data of all lords, civilians, and military officers in the Three Kingdoms. It is found that among the main characters of the Three Kingdoms, 60 belong to Wei, 23 belong to Wu, and only 2 belong to Shu, which proves that Wei was indeed the most powerful country in the Three Kingdoms.
+
+### 4.5. How Should Cao Cao's Military Ability Be Evaluated?
+The following Cypher command can be used to view the main battles that Cao Cao participated in:
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+From the graph, we can see that Cao Cao participated in 8 out of the 15 major battles in the Three Kingdoms, with a high participation rate. However, Cao Cao only won the battles of Xuzhou, Yanzhou, Guandu, and Xiangyang, while losing the battles of Hanzhong, Wancheng, the Campaign against Dong Zhuo and the Battle of Red Cliffs. His overall win rate was 50%, which proves that Cao Cao was not a very outstanding military strategist.
+
+## 5. Remarks
+More analysis is needed and encouraged to be added by everyone!
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..b2e7d4b257
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Demo:Round The World
+
+> This document mainly introduces the usage of the round-the-world demo.
+
+## Brief
+
+Based on the virtual background of "Around the World in 80 Days" and partial public historical flight data, it helps users design optimal flight plans for multiple cities.
+- Demo designed custom website service
+- The data source is a foreign open source website and does not include mainland city flight data
+- The flight prices in the data are simulated data and do not represent real prices.
+
+## Example
+
+### Login Page
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### Query Page
+
+Click on the login page to enter the query page.
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### Query Example
+
+Select no more than 8 cities from the city list in the lower left corner, click Query to return the recommended flight plan, and return the 10 path plans with the lowest cost and shortest flight time, provided that the interval between previous and later flights is 2-6 hours.
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+For detailed instructions, see the [manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "") document.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..106f943e05
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo example
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..b2ed78a618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+TuGraph DB Quick Start
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..6900158788
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,685 @@
+# TuGraph Browser
+
+> This document focuses on the use of TuGraph Browser.
+
+## 1.Introduction
+
+TuGraph Browser (hereinafter referred to as Browser) is a powerful product visualization development tool that presents graph data in an intuitive visual way, allowing users to easily manage, maintain, and view the database running status. This tool not only supports graph data management and visualization but also supports system account management, providing users with a comprehensive operation and management experience, enabling users to manage and utilize graph databases more efficiently.
+
+## 2.User Guide
+
+### 2.1.Accessing
+
+After the user completes the installation of the graph database, they can access the Browser through a browser. Users only need to enter the IP:Port of the server where TuGraph is located in the browser address bar. The default port used is 8000.
+
+- For example:127.0.0.1:8000
+- Recommend using Chrome
+
+#### 2.1.1. Startup configuration
+
+Before starting Browser, you need to start TuGraph-Server in advance and configure the connection between Browser and TuGraph-Server. The configuration file is the env.json file in the Browser directory. The specific configuration is as follows
+```shell
+# vim /usr/local/share/lgraph/tugraph-db-browser/env.json
+{
+   "tugraph_db_host": "http://127.0.0.1:9090"
+}
+```
+Tugraph_db_host needs to be modified to the address of the actual TuGraph-Server RPC service
+
+#### 2.1.2.Startup method
+There are two ways to start Browser. One is to directly switch to the directory where Browser is located in the docker image and execute the startup command.
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run dev
+```
+The other is to use the rpm/deb installation package in the local environment. In this case, it needs to be built first and then started. Therefore, the Node environment needs to be installed locally in advance. For details, see the source code directory.
+ci/images/tugraph-runtime-*-Dockerfile. When installing TuGraph locally,
+Browser will be installed to the specified local directory, switch to the directory, and execute the following command to build and start
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run bootstrap
+pnpm run dev
+```
+
+### 2.2.Logging in
+
+![login](../../../images/browser/login.png)
+
+- After successfully accessing the Browser, the login page appears first (as shown above), where users need to fill in their account and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- After the user's first login, they will be redirected to the password modification page. Once the password is successfully modified, they can only use the new password to log in.
+
+### 2.3.Quick Start
+
+For first-time users of TuGraph, you can quickly build a graph project with the built-in demo data and get started with graph data projects quickly.
+
+#### 2.3.1.Creating a Graph Project
+
+In the `Graph Project` homepage tab, click `Create New Graph Project` to create a new graph project.
+
+![quickstart-creategraph](../../../images/browser/quickstart-creategraph.png)
+
+Select a built-in demo data, and click the `Next` button.
+
+![quickstart-selectdemo](../../../images/browser/quickstart-selectdemo.png)
+
+In the Fill in Configurations interface, enter the graph project information. Since the demo data is relatively small in size, set the Maximum Storage Space to 1 GB. After entering the graph project information, click the Create button, and the system will automatically create the graph model of the demo data and import the graph data.
+
+![quickstart-configure](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.Starting a Graph Project
+
+After creating a graph project with demo data, you can find the corresponding graph project in the `Graph Project` tab, and then click `Graph Query` to query graph data.
+
+![quickstart-graphtab](../../../images/browser/quickstart-graphtab.png)
+
+Execute the default query statement to browse the graph data in the demo.
+
+![quickstart-result](../../../images/browser/quickstart-result.png)
+
+For more quick start documents, please visit the[Quick Start Documents](../3.quick-start/1.preparation.md)
+
+### 2.4.Graph Project
+
+`Graph Project` provides visualized graph project management and graph data development functions, providing users with a series of convenient graph data visualization operations, including graph project creation, modification, deletion, and other management operations, as well as graph data queries, vertex-edge statistics, and other operations. In addition, it also supports graph model management, making it more convenient for users to manage and maintain graph data.
+
+#### 2.4.1.Graph Project Management
+
+On the `Graph Project` page, you can see the graph projects in the current graph database.
+
+![graphmanagement-homepage](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.Creating a Graph Project
+
+On the `Graph Project` page, click the `Create New Graph Project` button to create a new graph project.
+
+![graphmanagement-creategraph](../../../images/browser/graphmanagement-creategraph.png)
+
+Creating a new graph project requires completing the creation of the graph project through two pages: `Select Template` and `Fill in Configurations`.
+
+- __Select Template__: The product provides two types of templates: empty templates and demo templates.
+    - Empty templates: A brand new graph project where users need to create their own graph model and import graph data, generally used for formal project development.
+    - Demo templates: Built-in demo data in the product. After the graph project is created successfully, the system will automatically create a demo graph model and import demo graph data, usually used for trial and learning.
+
+![graphmanagement-selecttemplate](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __Fill in Configurations__: Users need to fill in basic information about the graph project and click the `Create` button to create the graph project.
+    - Graph Name: The name of the new graph project, which is also the unique primary key of the graph project. Supports Chinese characters, letters, numbers, and underscores, but does not support spaces or other special characters.
+    - Graph Description: The description of the new graph project can be used to describe the background and objectives of the project in detail.
+    - Advanced Configuration - Maximum Storage Space: Set the maximum storage space that the graph project can occupy. It does not actually occupy physical storage space in advance. After the actual data volume reaches the maximum storage space threshold, no more data can be written.
+
+![graphmanagement-configure](../../../images/browser/graphmanagement-configure.png)
+
+After creation, the graph project can be viewed in the graph project tab on the `Graph Project` page.
+
+##### 2.4.1.2.Editing a Graph Project
+
+On the `Graph Project` page, click the `Edit button` (pencil icon) in the graph project tab to edit the basic information of the corresponding graph project.
+
+![graphmanagement-editgraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+graphmanagement-editgraph-button
+
+![graphmanagement-editgraph](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.Deleting a Graph Project
+
+On the `Graph Project` page, click the `Delete` button (trash can icon) in the graph project tab to delete the corresponding graph project.
+
+![graphmanagement-deletegraph-button](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_Note: Graph projects cannot be restored after deletion._
+
+##### 2.4.1.4.Vertex-Edge Statistics
+
+On the `Graph Project` page, click the `Vertex-Edge Statistics` button (line graph icon or refresh icon) in the graph project tab to count the number of vertexs and edges in the corresponding graph project.
+
+![graphmanagement-statistics-button](../../../images/browser/graphmanagement-statistics-button.png)
+
+The statistical results will be displayed on the graph project tab. Graph projects that have not been vertex-edge statistics will display `No vertex-edge data`, and graph projects that have already been vertex-edge statistics need to click the `Refresh` button to count again.
+
+![graphmanagement-statistics](../../../images/browser/graphmanagement-statistics.png)
+
+![graphmanagement-statistics-refresh-button](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.Graph Building
+
+The `Graph Building` function in Browser is mainly used for graph project model definition and data import. On the `Graph Project` page, click the `Graph Building` button in the graph project tab.
+
+![graphbuild-button](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.Model Definition
+
+Browser provides a visualization way to create and maintain graph models.
+
+- Graph models can also be created and maintained through the `Cypher` tool and the `lgraph_import` tool. For details, please refer to the [Cypher API Document](../8.query/1.cypher.md) and [Data Import Document](../6.utility-tools/1.data-import.md).
+
+###### a.Browse Graph Models
+
+On the `Model Definition` page, you can view detailed graph model settings, support list and canvas view of the graph model, support list display of vertex type properties and indexes, edge type properties and start/end vertex types.
+
+![graphbuild](../../../images/browser/graphbuild.png)
+
+- Supports list view of vertex types and edge types.
+    - Supports the display of the number of vertexs or edges in the corresponding vertex type or edge type in the vertex type or edge type tab.
+    - Supports keyword search for vertex type or edge type names. Enter the keyword in the `search box` to display the corresponding vertexs or edges.
+
+        ![graphbuild-list-search](../../../images/browser/graphbuild-list-search.png)
+    - Supports copying vertex type or edge type names. Click the `Copy` button to copy the name of the vertex or edge to the clipboard.
+
+        ![graphbuild-list-copy](../../../images/browser/graphbuild-list-copy.png)
+    - Supports deleting vertex types or edge types. Click the `Delete` button to delete the corresponding vertex or edge.
+
+        ![graphbuild-list-delete](../../../images/browser/graphbuild-list-delete.png)
+- Supports canvas view of vertex types and edge types.
+- Clicking the corresponding vertex type or edge type in the list or canvas can display the model details.
+        ![graphbuild-select](../../../images/browser/graphbuild-select.png)
+
+###### b.Add Vertex
+
+Click the `Add Vertex` button on the `Model Definition` page to add a vertex type in the right sliding window.
+
+![graphbuild-addvertex-button](../../../images/browser/graphbuild-addvertex-button.png)
+
+The user needs to enter the Vertex type name, properties, and indexes, and click the `Complete` button to complete the creation of the Vertex type.
+- Vertex Type Name: The name of the Vertex, which is also the unique identifier of the Vertex.
+- Properties: The attributes of the Vertex, and one attribute needs to be used as the primary key.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating Vertexs.
+- Indexes: The indexing attributes of the Vertex, you need to create attributes first and then set the attribute as an index.
+    - Attribute: The attribute that needs to be indexed.
+    - Unique:Set the attribute field as a unique value.
+    - Primary Key: Whether the corresponding attribute is a primary key. The Unique option must be `Yes` after selecting `Yes`.
+    - Delete: Indexes can be deleted arbitrarily during Vertex creation.
+
+![graphbuild-addvertex](../../../images/browser/graphbuild-addvertex.png)
+
+- Edit Vertex: You can add Vertex properties, modify the data type of existing properties, and add or delete indexes. You need to click the `Save` button for each newly added or modified attribute to take effect.
+_Note: Once the primary key field attribute is created, it cannot be modified._
+
+![graphbuild-editvertex](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.Add Edges
+
+Click the `Add Edge` button on the `Model Definition` page to add an edge type in the right sliding window.
+
+![graphbuild-addedge-button](../../../images/browser/graphbuild-addedge-button.png)
+
+The user needs to enter the edge type name, properties, select the start vertex type and end vertex type, and click the `Complete` button to complete the creation of the edge type.
+- Edge Type Name: The name of the edge, which is also the unique identifier of the edge.
+- Properties: The attributes of the edge, which may not exist on the edge.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating edges.
+- Selecting start vertex type and end vertex type: Set the start vertex type and end vertex type of the edge, and support multiple start vertex types and end vertex types.
+    - Start vertex: Select the vertex type of the start vertex.
+    - End vertex: Select the vertex type of the end vertex.
+    - At least one vertex type needs to be created in advance to set the start vertex type and end vertex of the edge.
+    - If not selected, it means that the start vertex and end vertex can be any vertex type, and the corresponding edge is not displayed on the canvas, and you need to view the edge type in the left list.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+- Edit Edge: You can add edge properties and modify the data type of existing properties. You need to click the `Save` button for each newly added or modified attribute to take effect.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+###### d.Import Model
+
+Click the `Import Model` button on the `Model Definition` page to upload a model file and quickly create a model.
+
+![graphbuild-importmodel-button](../../../images/browser/graphbuild-importmodel-button.png)
+
+Click the `Upload File` button on the `Import Model` page to upload the model file. After the upload is successful, click `OK` to import the graph model.
+
+- Overwrite the current canvas model: If this option is selected, the existing graph model will be cleared before importing the graph model in the model file; if not selected, the vertex types and edge types in the model file will be imported, but the existing vertex types and edge types will not be modified.
+
+![graphbuild-importmodel](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.Export Model
+
+Click the `Export Model` button on the `Model Definition` page to export the graph model in the current graph project to a JSON file.
+
+![graphbuild-exportmodel-button](../../../images/browser/graphbuild-exportmodel-button.png)
+
+The model file is in JSON format and is not recommended to be manually modified.
+
+![graphbuild-exportmodel](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.Data Import
+
+After completing the `Model Definition`, click the `Next` button to enter the data import page.
+
+###### a.Data Preparation
+
+Data needs to be prepared in advance before importing data. The current browser supports the uploading of CSV files, and the data file suffix needs to be ensured to be CSV.
+- The header is not mandatory.
+- Text qualifiers are supported, and the text qualifier is double quotes. Data Import - CSV
+
+![graphbuild-import-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.Upload Files
+
+Upload the required data files on the `Data Import` page and import the data into the graph project.
+
+![graphbuild-import](../../../images/browser/graphbuild-import.png)
+
+- Separator: The column separator of the data file.
+- File upload: Supports uploading multiple files.
+    - Supports selecting multiple upload files in the pop-up window.
+    - Supports dragging and dropping files to upload on the page.
+    - Supports uploading vertex files and edge files at the same time.
+
+###### c.Data Mapping
+
+After the file is successfully uploaded, you need to set the `Data Corresponding Table` on the `Data Import` page to establish a mapping relationship between the data columns in the data file and the target vertexs/edges and corresponding attributes.
+
+- Data Corresponding Table: Displays uploaded data problems.
+    - File Name: The name of the uploaded data file.
+    - File Size: The size of the uploaded data file.
+    - Read Result: The result of uploading the data file, success means uploaded successfully.
+    - Delete: Delete on the page, the local file will not be deleted.
+- Data File Mapping: Each uploaded data file needs to configure a mapping relationship.
+    - Label: Select the corresponding vertex or edge type for the file, and you can only select one type of vertex or one type of edge.
+    - Starting from the Nth row: Start reading data from the Nth row. The system defaults to start reading data from the 0th row. To skip the header, you can enter 1.
+    - Attribute Mapping: Select the attribute field corresponding to the data column from the drop-down list.
+    - Data Preview: The system will pre-read the first 5 rows of the data file.
+
+![graphbuild-import-datamapping](../../../images/browser/graphbuild-import-datamapping.png)
+
+After the file is successfully uploaded, you can click the `Continue Import` button to continue importing other data or click the `Go to Graph Query` button to query the imported data on the `Graph Query` page.
+
+![graphbuild-import-success](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.Graph Query
+
+Click the `Graph Query` button in the `graph project tab` on the `Graph Project` page to query and access graph data in the graph project. The product provides multiple modes for querying graph data, such as Statement Query, Path Query, and Vertex Query, and supports switching between graph projects and query result display.
+
+![query-button](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.Switch Graph Project
+
+The `Graph Query` function can only access one graph project data. Users can select and switch to other graph data in the `Switch Graph Project drop-down list`.
+
+![query-selectgraph](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.Statement Query
+
+The Browser provides a visual way to develop and debug graph query statements. Users can enter graph query statements, execute and return results, and support collecting statements and viewing graph models.
+
+![query-view](../../../images/browser/query-view.png)
+
+###### a.Statement Query Window
+
+Users enter graph query statements in the `Statement Query Window`, click the `Execute` button to run the corresponding statement, and display the result in the `Execution Result tab`.
+
+- Switch Query Language: Provides switching between different graph query language modes.
+    - _Currently only supports Cypher syntax._
+
+![query-selectgql](../../../images/browser/query-selectgql.png)
+
+- Statement Query Window: Provides syntax prompts for the current query language.
+
+![query-gqltips](../../../images/browser/query-gqltips.png)
+
+- Execute: Click the `Execute` button to send the entered query statement to the background for execution.
+
+![query-execute-button](../../../images/browser/query-execute-button.png)
+
+- Bookmark: Click the `Bookmark` button to save the content of the current statement query window as a template for future use.
+
+![query-bookmark-button](../../../images/browser/query-bookmark-button.png)
+
+- Download: Click the `Download` button to save the content of the current statement query window as a text file and download it to the local computer for future use.
+
+![query-download-button](../../../images/browser/query-download-button.png)
+
+For detailed Cypher usage guidelines, please refer to the document: [Cypher API](../8.query/1.cypher.md)
+
+###### b.Bookmark List
+
+Displays the collected query statements in a list, and clicking on a bookmark in the list allows using the statement. Supports keyword search, name modification, and deletion.
+
+![query-bookmark](../../../images/browser/query-bookmark.png)
+
+###### c.View Graph Model
+
+The Browser provides a graph model query for the current graph project, which allows users to query vertex types and edge types conveniently. It supports both list display and canvas graph display, and can be hidden.
+
+![query-schema-list](../../../images/browser/query-schema-list.png)
+![query-schema-graph](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.Path Query
+
+The Browser provides `Path Query templates`. Users can search whether corresponding paths exist in the graph data of the graph project by selecting paths.
+
+![pathquery-result](../../../images/browser/pathquery-result.png)
+
+- Path: Select the path to search in the path selection drop-down list.
+    - Select a Path: Based on the definition of the graph model, the system will automatically match the corresponding first-degree relationship path. Clicking the path drop-down box again will automatically match the next-degree relationship path based on the endvertex vertex type of the path.
+![pathquery-select](../../../images/browser/pathquery-select.png)
+    - Execute: Click the `Execute` button to return the matched paths in the graph project.
+    - Advanced Configuration: Set the number of paths to scan. The default is 100 paths.
+![pathquery-configuration](../../../images/browser/pathquery-configuration.png)
+
+_Note: The edges in the graph model need to set the starting vertex and endvertex. If no edge in the graph project has set the starting vertex and endvertex, the drop-down list will have no results._
+
+##### 2.4.3.4.Vertex Query
+
+The Browser provides `Vertex Query templates`. Users can query vertex data in the graph project by selecting vertex attributes.
+
+![vertexquery](../../../images/browser/vertexquery.png)
+
+- Select Vertex: Select the vertex type to be queried.
+    - Attribute: The system will automatically match the schema of the vertex type, set the corresponding query conditions, and click the execute button to return the results.
+- Return vertex Limit: Set the upper limit of the returned vertex data.
+
+![vertexquery-criteria](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.Execution Result Tab
+
+The Browser provides multiple ways to display graph query results, such as JSON view, JSON text, vertex-edge list, and vertex-edge view. It supports result download, data insertion, and full-screen display.
+
+###### a.JSON View
+
+The Browser provides JSON view to display query results.
+
+![query-result-jsonview](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON Text
+
+![query-result-jsontxt](../../../images/browser/query-result-jsontxt.png)
+
+###### c.Vertex-Edge List
+
+The Browser provides vertex and edge list to display query results.
+
+![query-result-list](../../../images/browser/query-result-list.png)
+
+###### d.Vertex-Edge View
+
+The Browser provides canvas view to display query results.
+
+![query-result-graph](../../../images/browser/query-result-graph.png)
+
+###### e.Data Insertion
+
+The Browser provides a visual way to insert vertex or edge data in the corresponding graph project. Click the `Insert Data` button, select the Vertex Type or Edge Type on the Insert Data tab, enter the attribute values, and click `OK` to complete the data insertion.
+
+![query-result-insert-button](../../../images/browser/query-result-insert-button.png)
+
+![query-result-insert](../../../images/browser/query-result-insert.png)
+
+###### f.Download Execution Result
+
+The Browser provides a function to export graph query results as text files. Click the `Download Execution Result` button, and the system will automatically save the result as a text file and download it to the local computer.
+
+![query-result-download](../../../images/browser/query-result-download.png)
+![query-result-downloadtxt](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.Full-Screen Display
+
+The Browser provides full-screen display for graph query results. Click the `Full-Screen` Display button to display the results in full screen, and click the `Exit Full Screen` button to exit full-screen display.
+
+![query-result-fullscreen-button](../../../images/browser/query-result-fullscreen-button.png)
+![query-result-fullscreen](../../../images/browser/query-result-fullscreen.png)
+![query-result-fullscreen-close](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.Graph Analysis
+
+Click the `Graph Analysis` button in the `Graph Project` tab in the `Graph Project` interface to display and analyze graph data on the canvas. The product provides `Query by Statement` and `Query by Configuration` to query and load data from the graph project to the canvas. It supports filtering, layout adjustment, and canvas operations on the canvas data.
+
+![graphanalysis-button](../../../images/browser/graphanalysis-button.png)
+
+As shown in the figure below, the graph analysis function mainly includes: 1. Operation bar: the main operation functions of graph analysis, including view switching, query filtering, layout style, and canvas operations; 2. Left sidebar: query, filter, and appearance operation area; 3. Canvas area: the area for displaying graph data, displaying vertex and edge data, supporting vertex expansion query, collapsing vertexs, fixing vertexs, deleting vertexs, and providing canvas graph data statistics; 4. Right sidebar: when a vertex or edge data is selected, the corresponding attribute information will be displayed; 5. Switch graph project: switch to different graph projects for analysis.
+
+![graphanalysis-operation-area](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.Query by Statement
+
+In the `Query by Statement` function, users can enter query statements to query graph data and load the data to the canvas area for display.
+- Syntax Description: TuGraph's query language and syntax documentation.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-query](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.Query by Configuration
+
+In the `Query by Configuration` function, users can select vertex types and enter attribute conditions to query graph data and load the data to the canvas area for display.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-configurequery](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.Canvas Analysis
+
+In the `Canvas Analysis` function, users can perform operations and analysis on the vertex or edge data on the canvas, including: expanding queries by selecting vertexs, collapsing/expanding vertexs, fixing vertexs, clearing the canvas, lassoing, vertex/edge retrieval, and canvas legend. The most basic operation on the canvas is dragging vertex data. By selecting a vertex with the left mouse button and moving the mouse, the position of the vertex data can be changed.
+
+###### a.Expand Query
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, move the mouse to `Expand Query`, and a secondary window will pop up. Click on the corresponding expansion degree to perform the query.
+- First-degree Query: Bidirectional expansion of first-degree relationships.
+- Second-degree Query: Bidirectional expansion of second-degree relationships.
+- Third-degree Query: Bidirectional expansion of third-degree relationships.
+- Custom Query: Expand based on selected conditions.
+    - Edge Direction: Set the direction of the expansion relationship, Bidirectional: includes outgoing edges and incoming edges, Outgoing: edges pointing outward from the selected starting vertex, Incoming: edges pointing to the selected starting vertex.
+    - Degree of Diffusion: The degree of expansion.
+    - Custom Return vertex Count: Configure the number of vertexs returned to the front end, default is 100, to prevent exceptions on the front end caused by super vertexs.
+    - Add Filter Group: Set the relationship type and attribute conditions of the expansion, multiple relationship types can be set.
+
+![graphanalysis-canvas-expand-before](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![graphanalysis-canvas-expand-after](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![graphanalysis-canvas-expand-custom](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.Collapse/Expand Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Collapse Vertexs` to hide the first-degree relationship Vertexs of the selected Vertexs; right-click on the collapsed Vertex data again to perform Expand Vertexs operation to show the hidden first-degree relationship Vertexs.
+
+![graphanalysis-canvas-collapse](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![graphanalysis-canvas-expand](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.Fix Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Fix vertexs` to fix the selected vertexs in place. The fixed vertexs cannot be moved (including layout adjustment); right-click on the fixed vertex data again to perform `Unfix vertexs` operation to restore the normal operation of the selected.
+
+![graphanalysis-canvas-fixed](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![graphanalysis-canvas-unfix](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.Delete Vertex
+
+Right-click on a vertex in the `Canvas` area to open the operation window. Click on `Delete Vertex` to remove the selected vertex from the canvas.
+
+![graphanalysis-canvas-delete](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.Clear Canvas
+
+Click on the `Clear Canvas` button in the `Toolbar` area to clear all data on the canvas.
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.Vertex/Edge Retrieval
+
+Select a vertex or edge in the `Vertex/Edge Retrieval` window and enter a keyword to perform a fuzzy search for attribute data on the canvas. After the search, you can locate the data position.
+
+![graphanalysis-canvas-retrieval](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.Canvas Legend
+
+In the legend area of the `Canvas` area, the vertex types in the canvas will be displayed. Click on a vertex type to select the corresponding vertex data. Click on the "More" button to display the statistics, which can be displayed in a list or chart format to show the number of vertexs or edges.
+
+![graphanalysis-canvas-legend-list](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![graphanalysis-canvas-legend-chart](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.Attribute Filter
+
+Click on the `Filter` button in the `Toolbar` area, and click on `Attribute Filter` in the `Sidebar` to perform filter and filtering. Users can select the vertex or edge types to be filtered, and set the corresponding attribute values. After retrieving the filtered group conditions, the corresponding vertex or edge data will be highlighted on the canvas.
+- Please select the vertex/edge type: Select the vertex type or edge type to be searched.
+- Attribute condition: Set the attribute conditions to be searched. Multiple groups can be set to take the union of the filtering results.
+- Add filter group: Multiple filter conditions can be set to take the union of the filtering results.
+- Reset: Clear the filter conditions.
+
+![graphanalysis-queryfilter-attributefilter](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.Statistical Filter
+
+Click on the Filter button in the Toolbar area, and click on Statistical Filter in the Sidebar to perform statistical filtering of canvas data. Users can select the vertex or edge types to be counted, and set the corresponding attribute values. The system will automatically group and count based on the selected vertex/edge types and attributes. The results can be displayed in chart and list formats. Clicking on the values in the chart or list area will highlight the corresponding data on the canvas.
+
+![graphanalysis-queryfilter-statisticalfilter](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![graphanalysis-queryfilter-statisticalfilter-chartswitch](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.Layout Style
+
+Click on the `Layout` button in the `Toolbar` area, and select the corresponding layout method to rearrange the data on the canvas. It supports force-directed layout, concentric circle layout, circular layout, radial layout, Dagre layout, and grid layout. Each layout method has different layout parameters. After adjusting the parameters, the data on the canvas will be rearranged.
+
+![graphanalysis-style-layout-button](../../../images/browser/graphanalysis-style-layout-button.png)
+![graphanalysis-style-layout-parameters](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+For detailed layout parameters, please refer to[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide).
+
+##### 2.4.4.6.Appearance Style
+
+Click on the `Appearance` button in the `Toolbar` area, and click on `Vertex Style` or `Edge Style` in the `Sidebar` to configure the appearance style.
+- Vertex Style
+    - Apply to vertex type: Set the display style for the corresponding vertex type. Multiple vertex types can be configured simultaneously.
+    - Size: The display size for the corresponding vertex type.
+    - Color: The display color for the corresponding vertex type.
+    - Icon: The icon style for the corresponding vertex type.
+    - Display Text: The text content displayed for the corresponding vertex type, defaulting to id.
+    - Advanced Configuration: Mark the corresponding vertex data based on the set conditions.
+- Edge Style
+    - Apply to Edge Type: Set the display style for the corresponding edge type, supports configuring the appearance of multiple edge types simultaneously.
+    - Color: The display color for the corresponding edge type.
+    - Width: The display width for the corresponding edge type.
+    - Display Text: The text content displayed for the corresponding edge type, not displayed by default.
+    - Advanced Configuration: Display the corresponding edge data based on the set conditions.
+
+![graphanalysis-style-appearance](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.Console
+
+The `Console` provides a visualized account management and database information viewing function. It provides users with comprehensive account and role management functions, including adding, deleting, modifying, and disabling accounts and roles. In addition, it also provides users with convenient database information viewing function, allowing users to easily view the basic information and configuration information of the graph database. Basic information mainly includes version number, running time, CPP compilation version number, etc., while database configuration information includes port number, system function parameter configuration, etc.
+
+#### 2.5.1.Account Management
+
+##### 2.5.1.1.Account Management
+
+##### a.Add Account
+
+Click the `Add` button in the `Account Management` interface to create a new account. Users need to enter the account name, account description, account password, and related roles.
+
+- Account Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Related Roles: When creating a new account, you must select a role. After the account is added successfully, the system will automatically generate a role with the same name as the account name.
+
+![account-add-button](../../../images/browser/account-add-button.png)
+![account-add](../../../images/browser/account-add.png)
+
+##### b.Edit Account
+
+Click the `Edit` button in the `Account Management` interface to edit the account description, account password, and related roles.
+
+![account-edit](../../../images/browser/account-edit.png)
+
+##### c.Disable Account
+
+Click the `Disable` button in the `Account Management` interface to prevent the corresponding account from logging in and accessing. Click the `Enable` button to enable the corresponding account login and access permissions.
+
+![account-disable](../../../images/browser/account-disable.png)
+![account-enable](../../../images/browser/account-enable.png)
+
+##### d.Delete Account
+
+Click the `Delete` button in the `Account Management` interface to delete the corresponding account.
+
+![account-delete](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.Role Management
+
+##### a.Add Role
+
+Click the `Add` button in the `Role Management` interface to create a new role. Users need to enter the role name, role description, and graph permissions.
+
+![role-add-button](../../../images/browser/role-add-button.png)
+
+- Role Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Graph Permissions: The browser supports four types of graph permission configurations: All, Read/Write, Read-Only, and None.
+    - All: corresponds to the read and write permissions of the graph, including editing the graph model permissions (schema).
+    - Read/Write: corresponds to the write permission of the graph, but does not include the permission to edit the graph model (schema).
+    - Read-Only: corresponds to the read permission of the graph.
+    - None: cannot access or operate the corresponding graph.
+- Role Conflict: When two roles have different graph permissions for the same graph, and both roles are authorized to the same account, the graph permission of the account for the graph is the union of the graph permissions of the two roles.
+
+![role-add](../../../images/browser/role-add.png)
+
+##### b.Edit Role
+
+Click the `Edit` button in the `Role Management` interface to edit an existing role. Users can edit the role description and graph permissions.
+
+![role-edit](../../../images/browser/role-edit.png)
+
+##### c.Disable Role
+
+Click the `Disable` button in the `Role Management` interface to disable the corresponding role. Click the `Enable` button to enable the corresponding role. After the role is disabled, the corresponding graph permissions of the role become invalid.
+
+- Disabled Role: After the role is disabled, the corresponding graph permissions become invalid.
+    - When a user has two roles with operating permissions on the same graph, if one of the roles is disabled, the permission of the other role is still valid.
+
+![role-disable](../../../images/browser/role-disable.png)
+![role-enable](../../../images/browser/role-enable.png)
+
+##### d.Delete Role
+
+Click the `Delete` button in the `Role Management` interface to delete the corresponding role.
+
+![role-delete](../../../images/browser/role-delete.png)
+
+#### 2.5.2.Database Information
+
+##### 2.5.2.1.Basic Information
+
+`Basic Information` obtains the current running status of the system and displays key information.
+
+![db_basic](../../../images/browser/db_basic.png)
+
+|Parameter    |Meaning    |
+|-------|--------|
+|TuGraph Version Number|The current version number of TuGraph, x.x.x|
+|Running Time|The time from when TuGraph service starts to now|
+|Server Code Version|The current commit of the tugraph-db repository|
+|Front-end Code Version|The current commit of the tugraph-web repository|
+|CPP Compiler Version|The CPP version number when compiling TuGraph|
+|Python Version Number|The Python version number when compiling TuGraph|
+|CPP Compiler ID|The CPP type when compiling TuGraph|
+
+The current running status of the system can also be obtained through commands.
+
+```cypher
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.Database Configuration Information
+
+`Database Configuration Information` obtains the current configuration parameters of the system and displays key information. To adjust the configuration parameters or understand the detailed configuration parameters, please refer to [Database Running-Service Configuration](../5.installation&running/7.tugraph-running.md).
+
+![db_configuration](../../../images/browser/db_configuration.png)
+
+| Parameter                   | Meaning                                                                                                                                         |
+|-----------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------|
+| bind_host                   | The host set when the system starts, usually 0.0.0.0                                                                                            |
+| disable_auth                | Whether to disable the regular update of token authentication. If set to true, the token can be used permanently                                |
+| durable                     | Whether to enable persistent storage of the underlying layer. If set to false, the data is updated asynchronously to the disk                   |
+| enable_audit_log            | Whether to enable audit log                                                                                                                     |
+| enable_backup_log           | Whether to enable real-time incremental backup                                                                                                  |
+| enable_fulltext_index       | Whether to enable full-text indexing                                                                                                            |
+| enable_ip_check             | Whether to enable IP whitelist                                                                                                                  |
+| enable_rpc                  | Whether to enable the RPC port                                                                                                                  |
+| enable_ssl                  | Whether to enable SSL encrypted transmission                                                                                                    |
+| optimistic_txn              | Whether to enable optimistic multi-threaded write transactions                                                                                  |
+| port                        | The REST access port of the current system                                                                                                      |
+| rpc_port                    | The port used by the RPC and HA services                                                                                                        |
+| subprocess_max_idle_seconds | The maximum idle time of the subprocess, a thread pool parameter                                                                                |
+| thread_limit                | The maximum number of threads used by the server at the same time                                                                               |
+| verbose                     | The level of detail of the log output information. It can be set to 0, 1, or 2, with larger values indicating more detailed output information. |
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..c0a3a1674b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# TuGraph Browser(old version)
+
+> This document focuses on the use of TuGraph Browser
+
+## Definition
+
+TuGraph Browser is a visual development tool provided by TuGraph.
+
+## Functionality
+
+TuGraph Browser provides graph database developers with functions such as visual graph data development, graph data management and maintenance.
+
+## How to use it
+
+### 1. Connect to the database
+
+When the user completes the installation of the graph database, you can access it through the Browser, TuGraph Browser tool. The user only needs to type in the browser address bar: IP of the server where TuGraph is located :Port. The default port is 7090.
+
+### 2. Login
+
+![alt Login](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- When the page is opened successfully, the first thing you see is the login page, and the user needs to fill in the account number and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change the initialized password in time after logging in
+
+### 3. Workbench
+
+#### 3.1 Quick Start
+
+- When you log in for the first time, the system will create an empty graph by default
+
+  ![alt quick start](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- The user clicks on the help option and selects Get Started quickly
+
+  ![alt help](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- Then click "One-click Create Model" -- >" One-click Create Data "to complete the construction of the built-in Movie data graph
+
+#### 3.2 Create subgraphs and examples
+
+##### 3.2.1 Create a subgraph
+
+- Click on New subgraph
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- Fill in the form information
+  ![alt Fill out the form](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+- Subgraph name
+- Subgraph description
+- Configuration information
+- Click OK to prompt that creation succeeded
+- Toggle the subgraph
+  ![alt Toggle subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- Click New Example
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- Select the example and click Create
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 query
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 User Interface Layout
+
+- Cypher input box
+- Result set display area
+
+##### 3.3.2 Result set display area function details
+
+- Result set tag display and functions
+  ![alt Result set tag](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+- All types of statistics for the result set are shown here
+- Click on the different "label" to make the following changes
+  -Change the display color
+- Modify the node size or edge thickness
+- Modify default display properties or system properties
+- Layout modification
+- Force guide layout
+- Grid layout
+- Tree layout
+- Environment layout
+- edge polymerization
+- Edges of the same type and direction can be merged
+- Create nodes
+- Click the Create Node button
+- Select the node type
+- Add node content
+- Create relationships
+- Select start and end points in the canvas
+- Select the type that can be matched
+- Enter node information
+- Stop layout
+- When too much data is causing the browser page to stall, you can click this stop layout button to improve the smoothness of the experience
+- Mouse hover
+- Enable this feature to highlight the one-degree neighbors of the mouse-over node
+- Result set export
+- Result sets can be exported as png, json, csv three different file forms
+- the refresh
+- Clicking the refresh button will re-execute the initial cypher statement for the current page and refresh the result set
+  Maximize -
+  -Click Maximize button, the result set display area will be displayed in full screen
+- Result set display mode switching
+  - Support graph, table and text modes
+
+##### 3.3.3 Schema
+
+- model
+  ![Modeling Alt](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- schema supports real-time addition, deletion, modification and query
+
+- schema supports import and export
+
+##### 3.3.4 Data import
+
+- Local data import
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+- Select the file encoding format
+- Select a local CSV file
+- Select the model for the corresponding node or edge
+- Do the data mapping
+- Complete the data import
+- The maximum supported size for a single file is 2GB.
+
+##### 3.3.5 plug-in (Stored Procedure)
+
+- Use of plug-ins
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+- Users can upload the plug-in program written locally, execute it in the visual page, and view the execution result
+- Users can perform, uninstall, execute, and download plug-ins in the visualization page
+
+##### 3.3.6 Help
+
+- where it records how TuGraph-browser is used
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 Console
+
+##### 3.4.1 Basic database information
+
+- Displays basic database configuration information
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 Permission management
+
+- A function module used to create users and roles. Users can manage permissions here
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 Live status
+
+- This shows the database real-time status, including: CPU usage, memory usage, disk usage, number of data requests, disk IO
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 Task Management
+
+- Here the user can see the task in execution and stop the task
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 Audit logs
+
+- Database related audit logs recorded here, used to troubleshoot problems encountered in use
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6c4d063e26
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB User Guide
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..f2cdffe578
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/1.environment.md
@@ -0,0 +1,41 @@
+# Environment
+
+> This document provides an overview of the required hardware and software environment for deploying TuGraph.
+
+## 1.Hardware Environment
+
+### 1.1. CPU
+TuGraph supports X86_64 and ARM64 architectures for both physical, virtual, and containerized environments. Tested and certified hardware platforms include Intel, AMD, Kunpeng, Hygon, Feiteng, and others.
+
+### 1.2. Memory
+We recommend having a memory capacity that is equal to or greater than the actual data size. For optimal performance, caching all data in memory is ideal. In terms of data locality, graph databases have poorer locality compared to relational databases. Therefore, if the data cannot fit in memory, frequent swapping may occur.
+
+### 1.3. Storage
+We strongly recommend using NVMe SSD as external storage. The database performs numerous synchronous write operations, often in a random manner, making the read/write performance of the external storage critical to the overall database performance. Hence, high IOPS and low-latency NVMe SSDs are the optimal choice.
+
+If circumstances permit only the use of SATA interface SSDs or cloud-based network disks, although performance may be affected, TuGraph can still run correctly.
+
+It is recommended to have external storage size at least four times the actual data size. For example, if the data size is 1TB, preparing a 4TB hard drive would be more reliable.
+
+
+
+## 2. Software environment
+
+### 2.1. Operating System
+
+TuGraph is compatible with popular operating systems, including Ubuntu, CentOS, SUSE, Galaxy Kylin, China Standard Software, UOS, and others, all of which have been tested and certified.
+
+Among them, the most stable system versions are Ubuntu 18.04, CentOS 7, and CentOS 8.
+
+### 2.2. System Libraries
+
+The requirements for system libraries differ between the compilation environment and the runtime environment. For specific details, please refer to the[environment mode](2.environment-mode.md)。
+
+## 3.Recommended Configuration
+
+| Hardware | Minimum Configuration	   | Recommended Configuration                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| Memory   | 4GB       | 512GB                    |
+| Storage  | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..98f9820ba2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,24 @@
+# Environment Mode
+
+> This document primarily introduces the three types of environments involved in TuGraph.
+
+## 1.Classification
+
+Based on the different functionalities supported by the environments, they can be categorized into the following:
+
+* The compilation environment has all dependent libraries for TuGraph compilation, including all dependencies of the running environment, and can compile TuGraph source code, but does not include precompiled TuGraph executable files and library files for developers to compile source code.
+
+* Running environment, with GCC/Java/Python environment, can run all functions of TuGraph, and can host full-text indexing, java client, c++ source code uploaded as plugin, and complete functions of python plugin, built-in TuGraph precompiled executable file and library files for customers to install and use directly without compiling source code.
+
+* Simplified operating environment, which is approximately equivalent to a bare system plus precompiled TuGraph. It can only run the basic functions of TuGraph. There is no C++ plugin to compile and run, only so upload, no full-text index, and no python plugin. It is for quick setup and trial use.
+After compiling TuGraph, all the required dependencies are packaged together in the form of .a files, eliminating the need for unnecessary additional dependencies during runtime. However, since TuGraph supports stored procedures, which involve compiling C++ code on the server, the required compilers still need to be present in the environment.
+
+## 2.System Library
+
+For the three types of environments, the required system libraries, excluding the TuGraph runtime package, are as follows:
+
+* Compilation Environment: It includes GCC, Python, Java compilers, as well as libraries such as ANTLR4 and Pybind11. Please refer to the tugraph-compile-*-Dockerfile for more details.
+
+* Runtime Environment: The main dependencies introduced by stored procedures include GCC, Boost, CMake, and others. Please refer to the tugraph-runtime-*-Dockerfile for more details.
+
+* Mini-Runtime Environment: There are no additional system library dependencies. Please refer to the tugraph-mini-runtime-*-Dockerfile for more details.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..bb966b75b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,103 @@
+# Docker Deployment
+
+>This document introduces the creation and download of Docker images for TuGraph Compile and TuGraph Runtime.
+
+## 1.Introduction
+
+- TuGraph Compile Image: Provides a compilation environment and can be used for TuGraph compilation and testing.
+- TuGraph Runtime Image: Provides a binary executable environment with TuGraph library and executable files.
+- TuGraph Mini Runtime Image: Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+## 2.Existing Docker Images
+
+### 2.1.Image Download
+
+The images are hosted on [DockerHub]( https://hub.docker.com/u/tugraph ) and can be downloaded and used directly.
+
+For the latest version of Docker address, see the TuGraph-Latest-Version section in [Guide](../../1.guide.md).
+
+### 2.2.Naming Convention
+
+#### 2.2.1.TuGraph Compile Image
+
+Provides a compilation environment and can be used for TuGraph compilation.
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+For example: `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+Provides a binary executable environment with TuGraph library and executable files.
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example:`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example: `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.Common Docker Operations
+
+Docker is generated from Dockerfile. Note that creating images requires downloading dependencies, so network issues may cause slow creation or creation failure. Do not overwrite images unless the tag is `latest`.
+
+build Compile image
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+build Runtime / Mini Runtime image
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+Modify image name
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+push image
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+pull image
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+save image
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+load image
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+Refer to the [docker official documentation](https://docs.docker.com/engine/reference/commandline/cli ) for other Docker operations.
+
+### 2.4. M1 Supports
+
+Running amd64 containers on M1-chip machines may cause unknown errors. TuGraph provides arm64 images for M1 machines. Contains compile and runtime images.
+
+In `tugraph-runtime-centos7:3.6.0` and `tugraph-compile-centos7:1.2.7` and later, `tugraph-runtime-centos7` and `tugraph-compile-centos7` provide images of two architectures: linux/amd64 and linux/arm64/v8. You can obtain the arm64 architecture image through docker pull on the M1 machine.
+
+## 3. Best Practice in Using and Developing Docker Images for TuGraph-DB
+
+Please carefully read the points below and follow them if you are new to contribute to TuGraph.
+
+- To get rid of too much docker layer, please add your dependency to the Docker with the style writing ENV and RUN in a
+  single line.
+- For the packages/resources you need to build the dependency, use the original ones instead of tweaking them without
+  tracking by VCS. And then contact TuGraph team to upload it to OSS to accelerate the building process, as the urls you
+  see in the Dockerfiles.
+- To make the development more efficient, you would better start from adding dependencies to base TuGraph Compile Images
+  and then reproduce the process in the Dockerfile after confirming the enviroment works.
+- CI uses the docker images. Please check the dependency problems if your CI fails.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..cb40030596
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# Local Package Deployment
+
+> This document describes TuGraph Local Package Deployment.
+
+## 1. Environment preparation
+
+TuGraph local package deployment requires a corresponding environment, and quick verification can use streamlined installation packages, which require almost no third-party libraries.
+
+If you need to use the complete TuGraph function, please refer to the tugraph-db source code directory ci/images/tugraph-runtime-*-Dockerfile. This script contains the complete environment construction process.
+
+## 2. Download the installation package
+
+For the latest version of the installation package address, see "TuGraph-Latest-Version" of [Guide](../../1.guide.md) 
+
+You can also visit Github to download: [TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. Installation method under CentOS
+
+The .rpm installation package for TuGraph installed on CentOS, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.rpm installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+Users can also specify the installation directory by specifying the `--prefix` option.
+
+## 4. Installation method under Ubuntu
+
+A .deb installation package for TuGraph installed on Ubuntu, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.deb` installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+This command installs TuGraph in the `/usr/local` directory by default. Users can also change the installation directory by specifying the `--instdir=<directory>` option.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..77bfda5171
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,128 @@
+# Cloud Deployment
+
+> This document mainly introduces the cloud deployment of TuGraph, and you can also refer to the[Alibaba Cloud ComputeNest deployment document.](https://aliyun-computenest.github.io/quickstart-tugraph/)。
+
+## 1.Introduction
+
+TuGraph (tugraph.antgroup.com) is a high-performance graph database of Alibaba Group. TuGraph provides community version services on ComputeNest, so you can quickly deploy TuGraph services on ComputeNest and achieve operation and maintenance monitoring, thereby building your own graph application. This document introduces how to open TuGraph community version services on ComputeNest, as well as deployment process and usage instructions.
+
+## 2.Instance Description
+
+TuGraph is deployed as a community open source version, and the source code can be found in the Github Repo. Currently, the available instance specifications are as follows:
+
+| Instance Family | vCPU and Memory             | System Disk                | Public Bandwidth         |
+|-----------------|-----------------------------|----------------------------|--------------------------|
+| ecs.r7a.xlarge  | AMD Memory r7a, 4vCPU 32GiB | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+| ecs.r6.xlarge   | Memory r6, 4vCPU 32GiB      | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+
+Estimated costs can be seen in real time when creating instances (currently free). If you need more specifications or other services (such as cluster high availability requirements, enterprise-level support services, etc.), please contact us at tugraph@service.alipay.com.
+
+## 3.Deployment Process
+
+### 3.1.Preparation
+
+Before starting to use, you need an Alibaba Cloud account to access and create resources such as ECS and VPC.
+
+- If you use a personal account, you can directly create a service instance.
+- If you create a service instance using a RAM user and use Alibaba Cloud ComputeNest for the first time:
+    - Before creating a service instance, you need to add permissions for the corresponding resources to the account of the RAM user. For detailed operations on adding RAM permissions, please see Grant RAM user permissions. The required permissions are shown in the following table.
+    - Authorization to create associated roles is also required. Refer to the following figure and select Agree to authorize and create associated roles.
+
+| Permission Policy Name          | Remark                                                                       |
+|---------------------------------|------------------------------------------------------------------------------|
+| AliyunECSFullAccess             | Permissions for managing cloud server services (ECS)                         |
+| AliyunVPCFullAccess             | Permissions for managing Virtual Private Cloud (VPC)                         |
+| AliyunROSFullAccess             | Permissions for managing Resource Orchestration Service (ROS)                |
+| AliyunComputeNestUserFullAccess | Permissions for managing ComputeNest services (ComputeNest) on the user side |
+| AliyunCloudMonitorFullAccess    | Permissions for managing Alibaba Cloud Monitor (CloudMonitor)                |
+
+![Cloud Deployment](../../../images/cloud-deployment-1.png)
+
+### 3.2.Deployment Entrance
+
+You can search in Alibaba Cloud ComputeNest, or quickly access it through the following deployment link.
+
+[Deployment Link](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.Apply for Trial Use
+
+Before formal trial use, you need to apply for trial use, fill in the information as prompted, and create the TuGraph service after passing the review.
+
+![Apply for Trial Use](../../../images/cloud-deployment-2.png)
+
+### 3.4.Create TuGraph Service
+
+#### 3.4.1.Parameter List
+
+During the process of creating a service instance, you need to configure the parameter list of the service instance information. The specific parameters are as follows.
+
+| Parameter Group                              | Parameter Item  | Example                 | Description                                                                                                                            |
+|----------------------------------------------|-----------------|-------------------------|----------------------------------------------------------------------------------------------------------------------------------------|
+| Service Instance Name                        | N/A             | test                    | The name of the instance.                                                                                                              |
+| Region                                       | N/A             | China East 1 (Hangzhou) | Select the region of the service instance. It is recommended to select nearby regions to obtain better network latency.                |
+| Payment Type Configuration                   | Payment Type    | Pay-As-You-Go           | For free use, please select Pay-As-You-Go.                                                                                             |
+| Availability Zone Configuration              | Deployment Area | Availability ZoneI      | Different available zones under the region, ensure that the instance is not empty.                                                     |
+| Select Existing Basic Resource Configuration | VPC ID          | vpc-xxx                 | Select the ID of the Virtual Private Cloud according to the actual situation.                                                          |
+| Select Existing Basic Resource Configuration | Switch ID       | vsw-xxx                 | Select the Switch ID according to the actual situation. If the Switch ID cannot be found, try switching the region and available zone. |
+| ECS Instance Configuration                   | Instance Type   | ecs.r6.xlarge           | Currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications.                                                                    |
+|ECS Instance Configuration|	Instance Password|	**|	Set the instance password. Length of 8-30 characters, must include three items (uppercase letters, lowercase letters, numbers, special characters in ()`~!@#$%^&*_-+={}[]:;'<>,.?/).
+|
+
+#### 3.4.2.Specific Steps
+
+The creation of the service is carried out according to the following steps, refer to the figure below:
+
+- Create an instance name, such as "test" in the figure below
+- Select the region, such as "China East 1 (Hangzhou)" in the figure below
+
+![Create Instance](../../../images/cloud-deployment-3.png)
+
+- Select the instance type, currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications. If there is no model available in the list, try selecting other deployment areas.
+- Select the model
+- Configure the password for the instance
+- Select the deployment area, such as "Availability Zone I" in the figure below
+
+![Select Region](../../../images/cloud-deployment-4.png)
+
+- Click next to enter the order confirmation page
+- Check the checkboxes for "Permission Confirmation" and "Service Terms"
+- Click the green "Start Free Trial" button in the lower left corner to create a service instance
+
+![Confirmation](../../../images/cloud-deployment-5.png)
+
+### 3.5.Start TuGraph Service
+
+- View the service instance: After the service instance is created successfully, it takes about 2 minutes for deployment. After the deployment is complete, you can see the corresponding service instance on the page, as shown in the figure below.
+
+![View Instance](../../../images/cloud-deployment-6.png)
+
+- Click the service instance to access TuGraph. After entering the corresponding service instance, you can get 3 ways to
+  use it on the page: web, rpc, ssh. You can also see the password of user admin on the page.
+
+![Access Method](../../../images/cloud-deployment-7.png)
+
+- Click the link of web to jump to the deployed TuGraph Web. It is recommended that novice users first use the demo to quickly get started with TuGraph.
+    - First, on the TuGraph Web login page, enter the default username (admin) and the password on the page to log in, as shown in the figure below.
+    - After the login is completed, click "New Instance" -> "Create Instance" in sequence, wait for the creation to be completed, and the steps in 3 will change to green in turn, and it will automatically switch to the subgraph MovieDemo1, as shown in the figure below.
+
+![Login](../../../images/cloud-deployment-8.png)
+![Create Demo](../../../images/cloud-deployment-9.png)
+
+## 4.Common FAQs
+
+### No available resources in the selected deployment area
+
+Sometimes, the selected deployment area (such as Availability Zone G) does not have available resources for the selected package, and an error will be reported as shown in the figure below.
+
+![Deployment Error](../../../images/cloud-deployment-10.png)
+
+__Solution__:Try selecting other regions, such as Availability Zone I
+
+### Unaccessible to the web port
+
+It takes some time for the server to get ready. Just wait for a few seconds.
+
+
+### Username or password is not correct
+
+Please make sure that you are using the password on the page instead of the default one.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..2f28bee61e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/6.compile.md
@@ -0,0 +1,31 @@
+# Compile
+
+> This document mainly describes how to compile TuGraph from source code.
+
+## 1.Prerequisites
+
+It is recommended to build TuGraph on a Linux system. Meanwhile, Docker is a good choice. If you want to set up a new environment, please refer to [Dockerfile](3.docker-deployment.md)。
+
+## 2.compile
+
+Here are steps to compile TuGraph:
+
+1. run `deps/build_deps.sh` to build tugraph-web if you need. Skip this step otherwise.
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If support shell lgraph_cypher, use `-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+4. If compiling on an arm machine (such as a Mac with M1 chip), add `-DENABLE_BUILD_ON_AARCH64=ON`
+5`make`
+6`make package` or `cpack --config CPackConfig.cmake`
+
+Example:
+`tugraph/tugraph-compile-centos7`Docker environment
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..36387de079
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,202 @@
+# Tugraph Running
+
+> This document describes the operation mode of the TuGraph service, starting, stopping, and restarting operations.And TuGraph's service configuration parameters, configuration file format, and command-line configuration parameters.
+
+## 1. Prerequisites
+TuGraph has the following prerequisites for its execution: a correct [installation of TuGraph](1.environment.md).
+
+TuGraph execution requires ensuring that the library file "liblgraph.so" is located in the environment variable LD_LIBRARY_PATH.
+
+The user running the TuGraph process does not need superuser privileges. However, they need read permissions for the configuration file (usually lgraph.json) and any files referenced within it. Additionally, they should have write permissions for data folders, log files, etc.
+
+## 2.The operation mode
+
+TuGraph can be started as a normal process in the foreground or as a daemon in the background.
+
+When running as a normal process, TuGraph can print logs directly to the terminal, which is handy when debugging server configurations. However, because the foreground process is terminated after the terminal exits, the user must ensure that the terminal remains open while the TuGraph server is running. In daemon mode, on the other hand, the TuGraph server can continue to run even if the terminal that started it exits. If TuGraph needs to run for a long time, it is recommended to start the TuGraph server in daemon mode.
+
+### 2.1.Running a normal process
+
+The `lgraph_server -d run` command runs TuGraph as a normal process. Normal processes depend on the command line terminal, so when the terminal ends, the TuGraph process is automatically terminated. Normal process mode with `--log_dir ""` can output the process log directly to the terminal, so it is easier to debug.Note: When not using the `-d run` command, the default behavior is to run as a normal process.
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d run -c lgraph_standalone.json --log_dir ""
+```
+or:
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+Example of running output in normal mode：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+In normal process mode, the user can prematurely terminate the TuGraph process by pressing 'CTRL+C'.
+
+### 2.2.Run process daemon mode
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+Example output from running in daemon mode:
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+## 3.Service operation
+
+### 3.1.Start the service
+
+TuGraph needs to be started using the 'lgraph_server -d start' command line. The following is an example of the command to start TuGraph:
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+### 3.2.Stop the service
+
+You can stop the TuGraph daemon using the 'kill' command and the 'lgraph_server -d stop' command. Since it is possible to run multiple TuGraph server processes on the same computer, we distinguish between the different server processes using the '.pid 'file, which is written to the working directory where the process was started. Therefore, you need to run the command 'lgraph_server-d stop' in the same working directory to stop the correct server process.
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.Restart the service
+
+Users can also restart the TuGraph service by 'lgraph_server -d restart' :
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.Service configuration
+
+The TuGraph server loads configurations from the configuration file and command line options at startup, and if different values are specified for the same option in the configuration file and command line, the value specified in the command line will be used preferentially.
+
+### 4.1.Configuration parameters
+
+The parameters and their types are described as follows:
+
+| **Parameter names**          | **<nobr>Type</nobr>** | **Instructions**                                                                                                                                                                                                                                                                                                                                                                            |
+|------------------------------|-----------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                    | string                | Directory where data files are stored. If the directory does not exist, it is automatically created. The default directory is /var/lib/lgraph/data.                                                                                                                                                                                                                                         |
+| durable                      | boolean               | Whether to enable real-time persistence. Turning off persistence can reduce the disk IO overhead when writing, but data may be lost in extreme cases such as machine power failure. The default value is `true`.                                                                                                                                                                            |
+| host                         | string                | The IP address on which the REST server listens. The default address is 0.0.0.0. Note: In HA mode, the host needs to be set to the IP address of the corresponding server and cannot be set to 0.0.0.0.                                                                                                                                                                                     |
+| port                         | int                   | The Port on which the REST server listens. The default port is 7070.                                                                                                                                                                                                                                                                                                                        |
+| enable_rpc                   | boolean               | Whether to use RPC services. The default value is false.                                                                                                                                                                                                                                                                                                                                    |
+| rpc_port                     | int                   | Port used by RPC and HA services. The default port number is 9090.                                                                                                                                                                                                                                                                                                                          |
+| enable_ha                    | boolean               | Whether to enable the HA mode. The default value is false.                                                                                                                                                                                                                                                                                                                                  |
+| ha_log_dir                   | string                | HA log directory. The HA mode needs to be enabled. The default value is null.                                                                                                                                                                                                                                                                                                               |
+| verbose                      | int                   | Detail level of log output information. The value can be 0,1,2. The larger the value, the more detailed the output information. The default value is 1.                                                                                                                                                                                                                                     |
+| log_dir                      | string                | Directory where log files are stored. The default directory is /var/log/lgraph/.                                                                                                                                                                                                                                                                                                            |
+| ssl_auth                     | boolean               | Whether to use SSL authentication. When HTTPS is enabled, only the HTTPS service is enabled on the REST server. The default value is false.                                                                                                                                                                                                                                                 |
+| web                          | string                | The directory where the web files (including the visual part) are located. The default directory is/usr/local/share/lgraph/resource.                                                                                                                                                                                                                                                        |
+| server_cert                  | string                | certificate file path used by the server when SSL authentication is enabled. The default path is/usr/local/etc/lgraph/server - cert.pem.                                                                                                                                                                                                                                                    |
+| server_key                   | string                | The public key file used by the server when SSL authentication is enabled. The default directory is/usr/local/etc/lgraph/server - key.pem。                                                                                                                                                                                                                                                  |
+| enable_audit_log             | boolean               | Whether to enable audit logs. The default value is false.                                                                                                                                                                                                                                                                                                                                   |
+| audit_log_expire             | int                   | When audit logs are enabled, the validity period (hours) of audit logs is automatically cleared upon timeout. If the value is 0, the logs are not cleared. The default value is 0.                                                                                                                                                                                                          |
+| audit_log_dir                | string                | Specifies the directory for storing log files when audit logs are enabled. The default directory is $directory/_audit_log_.                                                                                                                                                                                                                                                                 |
+| load_plugins                 | boolean               | Import all stored procedures when starting the service. The default value is true.                                                                                                                                                                                                                                                                                                          |
+| optimistic_txn               | boolean               | Enable optimistic multithreaded write transactions for Cypher. The default is false.                                                                                                                                                                                                                                                                                                        |
+| disable_auth                 | boolean               | Disable REST authentication. The default is false.                                                                                                                                                                                                                                                                                                                                          |
+| ha_snapshot_interval_s       | int                   | Snapshot interval (in seconds). The default value is 604800. -1 means not to automatically generate snapshots.                                                                                                                                                                                                                                                                              |
+| ha_heartbeat_interval_ms     | int                   | Heartbeat interval in milliseconds. The default value is 1000.                                                                                                                                                                                                                                                                                                                              |
+| ha_node_offline_ms           | int                   | The heartbeat times out and the interval (in milliseconds) between nodes going offline. The default value is 60000.                                                                                                                                                                                                                                                                         |
+| ha_node_remove_ms            | int                   | The interval (in milliseconds) at which a node is considered completely dead and removed from the list. The default value is 120000.                                                                                                                                                                                                                                                        |
+| ha_first_snapshot_start_time | string                | The time when the first snapshot is taken, the format is "HH:MM:SS", which means the first snapshot is taken at the next HH:MM:SS time point, and then every ha_snapshot_interval_s seconds. The default value is "", which means that the first snapshot is taken randomly at any time within 0-ha_snapshot_interval_s, and then a snapshot is taken every ha_snapshot_interval_s seconds. |
+| enable_ip_check              | boolean               | Allow IP address whitelists. The default value is false。                                                                                                                                                                                                                                                                                                                                    |
+| idle_seconds                 | int                   | The maximum number of seconds a child process can be idle. The default value is 600.                                                                                                                                                                                                                                                                                                        |
+| enable_backup_log            | boolean               | Whether to enable backup logging. The default value is false.                                                                                                                                                                                                                                                                                                                               |
+| backup_log_dir               | string                | The directory where backup files are stored. The default value is null.                                                                                                                                                                                                                                                                                                                     |
+| snapshot_dir                 | string                | Directory where snapshot files are stored. The default value is null.                                                                                                                                                                                                                                                                                                                       |
+| thread_limit                 | int                   | The maximum number of threads that can be used simultaneously. The default value is 0, which means that no restriction is imposed. The license file prevails.                                                                                                                                                                                                                               |
+| unlimited_token              | boolean               | Whether to set the link token to be infinite. The default value is false and the validity period is 24 hours.                                                                                                                                                                                                                                                                               |
+| reset_admin_password         | boolean               | Whether to reset the password. The default value is false. When the value is true, the password will be reset to "73@TuGraph"。                                                                                                                                                                                                                                                              |
+| enable_fulltext_index        | boolean               | Whether to enable the full-text index function, the default value is false.                                                                                                                                                                                                                                                                                                                 |
+| fulltext_analyzer            | string                | Full-text index tokenizer type. Can be set to `StandardAnalyzer` or `SmartChineseAnalyzer`. Default is `StandardAnalyzer`                                                                                                                                                                                                                                                                   |
+| fulltext_commit_interval     | int                   | Full-text index data submission period, for write operations, in seconds. The default is 0, which commits immediately.                                                                                                                                                                                                                                                                      |
+| fulltext_refresh_interval    | int                   | Full-text index data refresh cycle, for read operations, in seconds. The default is 0, and the latest written data can be read immediately.                                                                                                                                                                                                                                                 |
+| ha_conf                      | string                | Initialize the HA cluster according to host1:port1,host2:port2,host3:port3, the default value is empty.                                                                                                                                                                                                                                                                                     |
+| ha_node_join_group_s         | int                   | The waiting time for a node to try to join the high availability cluster, in seconds, the default is 10.                                                                                                                                                                                                                                                                                    |
+| ha_bootstrap_role            | int                   | Whether to use bootstrap to start, and the server role to start using this method, 0 means not to use bootstrap to start, 1 means to use bootstrap to start and this node is a leader, 2 means to use bootstrap to start and this node is a follower, only these 3 options. The default value is 0.                                                                                         |
+| help                         | boolean               | Print the help message. The default value is false.                                                                                                                                                                                                                                                                                                                                         |
+
+### 4.2.Server configuration file
+
+TuGraph's configuration file is stored in JSON format. It is recommended that most configuration be stored in configuration files and that some configuration parameters be modified only temporarily using command-line options when needed.
+
+A typical configuration file looks like this:
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7070,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..4f363b5a53
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,168 @@
+# High Availability mode
+
+> This document describes the principles, preparations, and server operations of the high availability mode
+
+## 1.Theory
+
+TuGraph provides high availability (HA) mode through multi-machine hot backup. In high availability mode, write operations to the database will be synchronized to all servers (non-witness), so that even if some servers are down, the availability of the service will not be affected.
+
+When the high-availability mode is started, multiple TuGraph servers form a backup group, which is a high-availability cluster. Each backup group consists of three or more TuGraph servers, one of which serves as the `leader` and the other replication group servers as `followers`. Write requests are served by a `leader`, which replicates and synchronizes each request to a `follower` and can only respond to the client after the request has been synchronized to the server. This way, if any server fails, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically select a new `leader`.
+
+TuGraph's high-availability mode provides two types of nodes: `replica` nodes and `witness` nodes. Among them, the `replica` node is an ordinary node, has logs and data, and can provide services to the outside world. The `witness` node is a node that only receives heartbeats and logs but does not save data. According to deployment requirements, `leader` nodes and `follower` nodes can be flexibly deployed as `replica` nodes or `witness` nodes. Based on this, there are two deployment methods for TuGraph high-availability mode: one is the ordinary deployment mode, and the other is the simple deployment mode with witness.
+
+For normal deployment mode, `leader` and all `followers` are nodes of type `replica`. Write requests are served by a `leader`, which copies each request to a `follower` and cannot respond to the client until the request has been synchronized to more than half of the servers. This way, if less than half of the servers fail, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically elect a new `leader` to ensure data consistency and service availability.
+
+However, when the user server resources are insufficient or a network partition occurs, a normal HA cluster cannot be established. At this time, since the `witness` node has no data and takes up little resources, the `witness` node and the `replica` node can be deployed on one machine. For example, when there are only 2 machines, you can deploy the `replica` node on one machine, and the `replica` node and `witness` node on another machine, which not only saves resources, but also does not require log application To the state machine, there is no need to generate and install snapshots, so the response to requests is very fast, and it can help quickly elect a new leader when the cluster crashes or the network is partitioned. This is the simple deployment mode of the TuGraph HA cluster. Although `witness` nodes have many benefits, since there is no data, the cluster actually adds a node that cannot become `leader`, so the availability will be slightly reduced. To improve the availability of the cluster, you can allow the `witness` node to be the leader temporarily by specifying the `ha_enable_witness_to_leader` parameter as `true`. After the `witness` node synchronizes the new log to other nodes, it will actively switch the leader role to the node with the latest log.
+
+This feature is supported in version 3.6 and above.
+
+## 2.Preparation
+
+To enable high availability mode, users need to:
+
+- Three or more instances of TuGraph servers.
+- To enable high availability mode when starting lgraph_server, the 'enable_ha' option can be set to 'true' using a configuration file or the command line.
+- Set the correct rpc_port through the configuration file or command line
+
+## 3.Start the initial backup group
+
+After installing TuGraph, you can use the `lgraph_server` command to start a high-availability cluster on different machines. This section mainly explains how to start a high-availability cluster. For cluster status management after startup, see [lgraph_peer tool](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.The initial data is consistent
+
+When the data in all servers is the same or there is no data at startup, the user can
+specify `--ha_conf host1:port1,host2:port2` to start the server.
+In this way, all prepared TuGraph instances can be added to the initial backup group at one time,
+All servers in the backup group elect `leader` according to the RAFT protocol, and other
+servers join the backup group with the role of `follower`.
+
+An example command to start an initial backup group is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+After the first server is started, it will elect itself as the 'leader' and organize a backup group with only itself.
+
+### 3.2.Inconsistent initial data
+If there is already data in the first server (imported by the `lgraph_import` tool or transferred from a server in non-high availability mode),
+And it has not been used in high-availability mode before, the user should use the boostrap method to start. Start the server with data in bootstrap
+mode with the `ha_bootstrap_role` parameter as 1, and specify the machine as the `leader` through the `ha_conf`
+parameter. In bootstrap mode, the server will copy its own data to the new server before adding the newly
+joined server to the backup group, so that the data in each server is consistent.
+
+An example command to start a data server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+Other servers without data need to specify the `ha_bootstrap_role` parameter as 2, and specify the `leader` through the `ha_conf` parameter. The command example is as follows
+
+```bash
+**$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**You need to pay attention to two points when using bootstrap to start an HA cluster:**
+1. You need to wait for the `leader` node to generate a snapshot and start successfully before joining the `follower` node, otherwise the `follower` node may fail to join. When starting the `follower` node, you can configure the `ha_node_join_group_s` parameter to be slightly larger to allow multiple waits and timeout retries when joining the HA cluster.
+2. The HA cluster can only use the bootstrap mode when it is started for the first time. It can only be started in the normal mode (see Section 3.1) when it is started later. In particular, multiple nodes of the same cluster cannot be started in the bootstrap mode, otherwise it may cause Data inconsistency
+
+## 4.Start witness node
+
+### 4.1. Witness nodes are not allowed to become leader
+
+The startup method of `witness` node is the same as that of ordinary nodes. You only need to set the `ha_is_witness` parameter to `true`. Note that the number of witness nodes should be less than half of the total number of cluster nodes.
+
+An example command to start the witness node server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+Note: By default, the `witness` node is not allowed to become the `leader` node, which can improve the performance of the cluster, but will reduce the availability of the cluster when the `leader` node crashes.
+
+### 4.1. Allow witness nodes to become leaders
+
+You can specify the `ha_enable_witness_to_leader` parameter as `true`, so that the `witness` node can temporarily become the `leader` node, and then actively switch to the master after the new log synchronization is completed.
+
+An example of the command to start the `witness` node server that is allowed to become the `leader` node is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+Note: Although allowing `witness` nodes to become `leader` nodes can improve the availability of the cluster, it may affect data consistency in extreme cases. Therefore, it should generally be ensured that the number of `witness` nodes + 1 is less than half of the total number of cluster nodes.
+
+## 5.Scale out other servers
+
+After starting the initial backup group, if you want to scale out the backup group, add new servers to the backup group,
+The `--ha_conf HOST:PORT` option should be used, where `HOST` can be the IP address of any server already in this backup group,
+And `PORT` is its RPC port. E.g:
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+This command will start a TuGraph server in high availability mode and try to add it to the backup group containing the server `172.22.224.15:9090`.
+Note that joining a backup group requires a server to synchronize its data with the backup group's `leader` server, and this process may take a considerable amount of time, depending on the size of the data.
+
+## 6.Stopping the Server
+
+When a server goes offline via 'CTRL-C', it will notify the current 'leader' server to remove the server from the backup group. If the leader server goes offline, it will pass the leader identity permission to another server before going offline.
+
+If a server is terminated or disconnected from other servers in the backup group, the server is considered a failed node and the leader server will remove it from the backup group after a specified time limit.
+
+If any server leaves the backup group and wishes to rejoin, it must start with the '--ha_conf {HOST:PORT}' option, where 'HOST' is the IP address of a server in the current backup group.
+
+## 7.Restarting the Server
+
+Restarting the entire backup group is not recommended as it disrupts service. All servers can be shut down if desired. But on reboot,
+It must be ensured that at least N/2+1 servers in the backup group at shutdown can start normally, otherwise the startup will fail. and,
+Regardless of whether `enable_bootstrap` is specified as true when initially starting the replication group, restarting the server only needs to pass
+Specify the `--ha_conf host1:port1,host2:port2` parameter to restart all servers at once. The command example is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker deploys a highly available cluster
+In real business scenarios, it is likely to encounter the need to deploy high-availability clusters on multiple operating systems or architectures.
+Differentiated environments may cause some dependencies to be missing when compiling TuGraph. therefore,
+Compiling software in docker and deploying high-availability clusters is very valuable. Take the centos7 version of docker as an example,
+The steps to deploy a highly available cluster are as follows.
+
+### 8.1.Install mirror
+Use the following command to download TuGraph's compiled docker image environment
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+Then pull the TuGraph source code and compile and install
+
+### 8.2.Create container
+Use the following command to create a container, use `--net=host` to make the container run in host mode, in this mode
+Docker and the host machine share the network namespace, that is, they share the same IP.
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.Start service
+Use the following command to start the service on each server, because docker and the host share IP, so you can directly specify to start the service on the host IP
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.Server Status
+
+The current status of the backup group can be obtained from the TuGraph visualization tool, REST API, and Cypher query.
+
+In the TuGraph visualization tool, you can find the list of servers and their roles in the backup group in the DBInfo section.
+
+With the REST API, you can use `GET /info/peers` to request information.
+
+In Cypher, the `CALL dbms.listServers()` statement is used to query the status information of the current backup group.
+
+## 10.Data synchronization in high availability mode
+
+In high availability mode, different servers in the same backup group may not always be in the same state. For performance reasons, if a request has been synchronized to more than half of the servers, the leader server will consider the request to be in the committed state. Although the rest of the servers will eventually receive the new request, the inconsistent state of the servers will persist for some time. A client may also send a request to a server that has just restarted, thus having an older state and waiting to join a backup group.
+
+To ensure that the client sees consistently continuous data, and in particular to get rid of the 'reverse time travel' problem, where the client reads a state older than it has seen before, each TuGraph server keeps a monotonically increasing data version number. The mapping of the data version number to the database state in the backup group is globally consistent, meaning that if two servers have the same data version number, they must have the same data. When responding to a request, the server includes its data version number in the response. Thus, the client can tell which version it has seen. The client can choose to send this data version number along with the request. Upon receiving a request with a data version number, the server compares the data version number to its current version and rejects the request if its own version is lower than the requested version. This mechanism ensures that the client never reads a state that is older than before.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..bf30d63598
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+Installation And Running
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..8a46e25efe
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,475 @@
+# Data Importing
+
+> This document describes the data import function of TuGraph. These include delimiters in CSV format, sample formats for jsonline, and two modes for importing online and offline.
+
+## 1. Introduction
+
+After the installation is successful, you can use the `lgraph_import` batch import tool to import existing data into TuGraph. `lgraph_import` supports importing data from CSV files and JSON data sources.
+
+> `sonline format, a row of a json array string`
+
+> CSV format
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline format
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph supports two data importing modes：
+
+- _offline_：Read the data and import it into a data file for the specified server, it should only be done when the server is offline.
+- _online_：Read the data and send it to the running server, which then imports the data into its database.
+
+## 2.CSV file format delimiter
+
+    CSV delimiters can be single-character or multi-character strings, which cannot contain 'r' or 'n'. Note that different shells handle input strings differently, so different escape handling may be required for different shell input parameters.
+
+In addition, 'lgraph_import' also supports the following escape characters for entering special symbols:
+
+| Escape character | Instructions                                                                                              |
+| ---------------- | --------------------------------------------------------------------------------------------------------- |
+| \\               | The backslash`\\`                                                                                         |
+| \\a              | ASCII code 0x07                                                                                           |
+| \\f              | form-feed，ASCII code 0x0c                                                                                |
+| \\t              | Horizontal tab characters， ASCII code 0x09                                                               |
+| \\v              | Vertical tab characters， ASCII code 0x0b                                                                 |
+| \\xnn            | Two hexadecimal digits representing one byte，example \\x9A                                               |
+| \\nnn            | A three-digit octal number representing a single byte，example \\001, \\443，data range cannot exceed 255 |
+
+Demo：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.The configuration file
+
+    `lgraph_import`tool configures the environment using the specified configuration file. The configuration file describes the paths to the input files, the vertices/edges they represent, and the vertex/edge format.
+
+### 3.1.Configuration File Format
+
+The configuration file consists of two parts: schema and files. The 'schema' part defines label, and the 'files' part describes the data files to be imported.
+
+#### 3.1.1.The keyword
+
+- schema (Array）
+  - label（required，string）
+  - type（required， VERTEX or EDGE）
+  - properties（Array，required for vertex，If there is no property for the edge, you can leave it unconfigured）
+    - name（required, string）
+    - type （required,，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（optional，Indicates that the field can be configured or not configured）
+    - index（optional，Whether the field needs to be indexed）
+    - unique（optional, whether the field indexed and is of type unique）
+    - pair_unique（optional, whether the field indexed and is of type pair_unique）only one unique and pair_unique can be set. Setting up and running at the same time will terminate due to an input exception
+  - primary (vertex-only configuration, specify a property that uniquely identifies a point in the primary key field)
+  - temproal (edge-only configuration, optional, specifies the timestamp field for storage tier sorting)
+  - temporal_field_order (edge-only configuration, optional, the default value is ASC, indicating the ascending order, or DESC, indicating the descending order)
+  - constraints (edge-only configuration, optional, array form, start and end labels, unconfigured or empty means unrestricted)
+  - detach_property (optional, both Edge and Vertex can config，default is `false`. `true` means the property data is stored in detached model, which can reduce io read amplification in cases with less memory and much property data.)
+- files （Array）
+  - path（required，string，The value can be a file path or a directory path. If it is a directory, all files in the directory will be imported. Ensure that they have the same schema）
+  - header（Optional, numeric, header in the first few lines of the file, or 0）
+  - format（required，JSON or CSV）
+  - label（required，string）
+  - columns（Array）
+    - SRC_ID (Special string，only on the edges,That means this column is the source data)
+    - DST_ID (A special string, only on the edges, indicates that this column is the destination data)
+    - SKIP   (A special string to skip this column of data)
+    - [property]
+  - SRC_ID (Edge-only configuration. The value is the start label)
+  - DST_ID (Edge-only configuration. The value is the destination point label)
+
+#### 3.1.2. Index length
+Because TuGraph has limits on the length of keys, unique indexes do not allow the establishment of indexes that exceed the limit length. Non-unique indexes will truncate attributes that exceed the length limit, and when traversing non-unique indexes through iterators, the key obtained It is also truncated and may not be consistent with expectations. The truncation length is different for different types of non-unique indexes.
+##### 3.1.2.1.unique index
+A unique index is globally unique, and the maximum length of the index key is 480 bytes. Primary is a special unique index, so the maximum key length is also 480 bytes, and no index can be created if it exceeds 480 bytes.
+##### 3.1.2.2.pair_unique index
+A pair_unique index refers to a unique index between two nodes. This type of index can only be created in the edge schema. This type of index adds the vid of the source node and the target node after the user-specified key. Each vid is 5 bytes. length. Therefore, the maximum key length is 470 bytes, and indexing cannot be established if it exceeds 470 bytes.
+##### 3.1.2.3. Non-unique index
+A non-unique index refers to an index that neither unique nor pair_unique is set to 1. In the implementation of TuGraph, one key of this type of index may be mapped to multiple values. In order to speed up search and writing, the user-specified The key is followed by the maximum value in a set of vid or euid. For non-unique indexes created in nodes, the key is followed by vid, and each vid is 5 bytes in length, so the maximum length is 475 bytes.
+For non-unique indexes created in edges, the key is followed by euid, and each euid is 24 bytes long, so the maximum length is 456 bytes. If the index key exceeds the corresponding length, it will be automatically truncated.
+
+### 3.2.Example Configuration File
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+For the above Example Configuration File, three labels defined: two point types' actor 'and' movie ', and one edge type 'role'. Each label describes: the name of the label, the type (dot or edge), which attribute fields are available, and the type of each field. For points, the primary field also defined; For edges, the constraints field also defined, which limits the starting and ending points of the edges.
+
+It also describes three data files, two dot data files' actors.csv 'and' movies.csv ', and one edge data file 'roles.csv'. Each section describes the path of the file, the format of the data, the first few lines of the header, the label of the data, and the corresponding field of each column in each row of data in the file.
+
+For the above configuration files, the import tool will first create labels' actor ', 'movie', and 'role' in TuGraph, and then perform data import of the three files.
+
+## 4.Offline full import
+
+The offline mode can be used only on offline servers. An offline import creates a new graph, so it's more suitable for your first data import on a newly installed TuGraph server.
+
+To use the 'lgraph_import' tool in offline mode, you can specify the 'lgraph_import --online false' option. To see the command-line options available, use 'lgraph_import --online false --help' :
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+Command line arguments:
+
+- **-c, --config_file** `config_file`: Import the configuration file name in the following format:
+- **--log** `log_dir`: Log directory. The default is an empty string, in which case the log information output to the console.
+- **--verbose** `0/1/2`: Log level. The higher the log level, the more detailed the output information is. The default value is 1.
+- **-i, --continue_on_error** `true/false`: If an error occurs, skip the error and continue. The default is false. If an error occurs, exit.
+- **-d, --dir** `{diretory}`:The database directory to which the import tool will write data. Default is'./db '.
+- **--delimiter** `{delimiter}`: Data file separator. This is used only when the data source is in CSV format. The default is', '。
+- **-u, --username** `{user}`: Username of the database. You need to be an administrator to perform offline import.
+- **-p, --password** `{password}`: Specifies the password of the database user
+- **--overwrite** `true/false`: Whether to overwrite data. When set to true, the data directory overwritten if it already exists. Default to 'false'.
+- **-g, --graph** `{graph_name}`: Specify the kind of graph to import.
+- **-h, --help**: The help information displayed.
+
+### 4.1.Offline Import Example
+
+    In this example, we use the movie-actor data described above to demonstrate the use of the import tool. The data to be imported is divided into three files: 'movies.csv', 'actors.csv', and 'roles.csv'.
+
+'movies.csv' contains information about movies, where each movie has an id (as a primary key for retrieval), and each movie also has attributes such as title, year, and rating. (Data from [IMDb](http://www.imdb.com)).
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+> The jsonline format is as follows:
+> All fields can be strings, which will be converted to the corresponding type when imported
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`It contains information about the actors. Each actor also has an id, as well as properties such as name.
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`It contains information about which role an actor played in which movie. Each row records a character played by a given actor in a given movie, corresponding to an edge in the database.`SRC_ID` and `DST_ID` are the source and target vertices of the edge, which are the 'primary' properties defined in 'actors.csv' and 'movies.csv', respectively.
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+'configuration file import.conf', notice that there are two HEADER lines in each file, so we need to specify the 'HEADER=2' option.
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+Using the import configuration file, we can now import data using the following command:
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # Read configuration information from import.conf
+        --dir /data/lgraph_db      # Store the data in /data/lgraph_db
+        --graph mygraph            # Import the graph named mygraph
+```
+
+**Notice**：
+
+- If a graph named 'mygraph' already exists, the import tool will print an error message and exit. To force a graph to be overwritten, use the '--overwrite true' option.
+- Configuration and data files must be stored in UTF-8 encoding (or normal ASCII encoding, which is a subset of UTF-8). If any file uses an encoding other than UTF-8 (for example, UTF-8 with BOM or GBK), the import will fail and output a profiler error.
+
+## 5.Online incremental Import
+
+The online import mode can be used to import a batch of files into an already running instance of TuGraph. This is handy for processing incremental batch updates that typically occur at fixed intervals. The 'lgraph_import --online true' option enables the import tool to work in online mode. Like offline mode, online mode has its own set of command-line options, which can be printed using the '-h, --help' options:
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+The configuration related to the file specified in the configuration file, and its format is exactly the same as' offline mode '. However, instead of importing the data into a local database, we are now sending the data to a running TuGraph instance, which is typically running on a different computer than the client machine on which the import tool is running. Therefore, we need to specify the URL, DB user, and password for the HTTP address of the remote machine.
+
+If the user and password are valid, and the specified graph exists, the import tool sends the data to the server, which then parses the data and writes it to the specified graph. The data will be sent in a packet of about 16 MB, interrupted at the nearest newline. Each package imported atomically, which means that if the package is successfully imported, all data is successfully imported; otherwise, none of the data enters the database. If '--continue_on_error true' is specified, data integrity errors are ignored and offending lines are ignored. Otherwise, the import stops at the first error package and prints out the number of packages that have been imported. In this case, the user can modify the data to eliminate errors, and then use '--skip_packages N' to redo the import to skip the imported packages.
+
+## 6. Online full import
+
+Online full import can be used to import a batch of files into a running TuGraph instance. TuGraph supports importing two different types of data into the instance online:
+1. Original data files of the same type as the offline import (csv, etc.)
+2. The underlying storage file of TuGraph is the data.mdb file. This file can be generated by offline import, or it can be a file of other TuGraph db.
+The applicable scenarios of these two methods are different. The first method is to directly import data into TuGraph. The advantage is that it is automatically imported at one time and the operation steps are simple. However, an offline import thread will be started on the server side, which is only suitable for small-scale data import in a stand-alone situation. The second is to import the prepared underlying storage files into TuGraph. Although the mdb file needs to be prepared in advance, it does not have high requirements on system resources. It also supports remote download and file import, which is very convenient and suitable for high availability. Online import of schema or large-scale data.
+
+### 6.1 Import from original data
+The execution method of importing from the original data is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and The data files of the temporary db are migrated to the new subgraph, and finally the metadata of the instance is refreshed. Compared with online incremental import, online full import has higher performance. The `lgraph_import --online true --online_type 1` option enables the import tool to fully import online. Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+Online full import can be used to import a batch of files into an already running TuGraph instance. The execution method is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and stores the data in the temporary db. The files are migrated to the new subgraph, and finally the instance's metadata is refreshed. Compared with online incremental import, online full import has higher performance and is suitable for processing large-scale data. The `lgraph_import --online true --full true` option enables the import tool to fully import online.
+Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+The relevant configuration of the file is specified in the configuration file, and its format is exactly the same as in `offline mode`. However, instead of importing the data into a local database, we now import the data into a running TuGraph instance, which is typically running on a different machine than the client machine running the import tool. Therefore, we need to specify the URL, DB user and password of the remote computer's HTTP address. Moreover, the configuration file (config_file parameter) is required to be the uri path on the TuGraph instance machine, and its file configuration is also required to be the absolute path of the resource on the TuGraph instance machine.
+
+If the user and password are valid, the import tool will perform an online full import on the server side. If the graph you want to import already exists, you can use the `--overwrite true` option to force overwriting of the subgraph.
+
+### 6.2 Import from database file
+Although the full online import of original data is simple to operate and has high performance, it requires high server resources and takes a long time. A more general way is to first use offline import to import the subgraph in an empty db, obtain the data.mdb file, and then import the file into the TuGraph service online. How to use it is as follows:
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+In addition to the url, user and password parameters used in ordinary online import, the online full import method imported from a database file uses the graph parameter to specify the name of the imported subgraph, the path parameter to specify the file path, and remote to specify whether the file exists remotely or locally. If it is a local file, you need to ensure that all nodes in the HA cluster have the file in the path. If it is a remote file, it will be downloaded first and then imported. It should be noted that since there is only one copy of data.mdb, it is necessary to ensure that the environment of each node of HA and the machine where data.mdb is generated offline are completely consistent to ensure that no environmental problems will occur.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..b1ad57de6f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# Data Export
+
+> This document mainly introduces the data export function of TuGraph.
+
+## 1.Introduction
+
+TuGraph can use the tool `lgraph_export` to export data from the database that has been imported successfully. The 'lgraph_export' tool can export the data of the specified TuGraph database to the specified directory in the form of 'csv' or 'json' file, and export the configuration file 'import.config'. That required for re-importing the data.
+
+## 2.Data Export
+
+The following is an example of a command for the tool:
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+Details:
+
+- `-d {database_dir}` specifies the directory of the database from which the data will be exported. The default value is./testdb '.
+- `-e {export_destination_dir}` specifies the directory where the export file is stored. The default value is./exportdir.
+- `-g {graph_to_use}` specifies the type of graph database. default is' default '.
+- `-u {username}` Specifies the name of the user who performs the export operation.
+- `-p {password}` Specifies the password of the user who performs the export operation.
+- `-s {field_separator}` specifies the separator for the exported file. The default is comma.
+- `-f {output_format}` specifies the format of the exported data. It can be 'json' or 'csv'.
+- `-h` In addition to the specified parameters, you can also use this parameter to view the help of the tool.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..fa1839724b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,32 @@
+# Backup and Restore
+
+> This document mainly introduces the data backup and restore function of TuGraph.
+
+## 1.Data Backup
+
+TuGraph can use the 'lgraph_backup' tool to backup data.
+The 'lgraph_backup' tool can backup data from a TuGraph database to another directory. It can be used as follows:
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+Details:
+
+- `-s {source_dir}` specifies the directory where the database (source database) to be backed up resides.
+- `-d {destination_dir}` specifies the directory where the backup file (destination database) is stored.
+  If the target database is not empty, 'lgraph_backup' prompts you whether to overwrite the database.
+- `-c {true/false}` indicates whether a compaction occurs during backup.
+  Every compaction creates a tighter backup, but every compaction takes longer to create. This option defaults to 'true'.
+
+## 2.Data Restore
+
+The target database `{destination_dir}` obtained using the `lgraph_backup` tool backs up all subgraphs of the source database `{source_dir}`, but does not include the raft information of the HA cluster, thereby ensuring that the service and cluster can be successfully restarted with the backup database and the data is consistent with the source database. The following command can be used to restart the service with the backup database. When the service starts, the storage process of all subgraphs will be restored to ensure that the backup service is completely consistent with the original service.
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+Details
+
+- `-d {destination_dir}` Specify the directory where the backup file (target database) is located.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..6782a43d0e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# Data Warmup
+
+> This document mainly introduces the data Warmup function of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a disk-based database where data loaded into memory only when accessed. Therefore, for a period of time after the server just turned on, the system performance may be degraded due to frequent IO operations. At this point, we can improve this problem by data warm-up.
+
+## 2.lgraph_warmup
+
+Data warmup can be done using the tool lgraph_warmup. An example of its use is as follows:
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+Details:
+
+The - '-d {db_dir}' option specifies the data directory for the TuGraph server
+
+The - '-g {graph_list}' option specifies the names of graphs to be warmed-up, separated by commas
+
+The warm-up process takes different times depending on the data size and the type of disk being used. Preheating a large database on a mechanical disk may take a long time. Please wait patiently.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..d830586b92
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# Cluster management
+
+> This document mainly introduces the management tools of TuGraph HA cluster, including the functions of deleting nodes, leader transfer and generating snapshots.
+
+## 1 Introduction
+
+After the HA cluster is started, you can use the `lgraph_peer` tool for cluster management, which can perform functions such as deleting nodes, transferring leaders, and generating snapshots.
+
+## 2. Delete node
+
+For nodes in the TuGraph HA cluster that are offline for a long time or have network partitions, you can use the `remove_peer` command of `lgraph_peer` to delete the node. An example command is as follows:
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command remove_peer` specifies that the operation to be performed is remove_peer, that is, delete the node.
+- `--peer {peer_id}` specifies the rpc network address of the node to be deleted, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 3. leader transfer
+
+When you need to shut down or restart the master node, in order to reduce the unserviceable time of the cluster, you can use the `transfer_leader` command of `lgraph_peer` to transfer the master node. An example command is as follows:
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command transfer_leader` specifies that the operation to be performed is transfer_leader, that is, transferring the master node.
+- `--peer {peer_id}` specifies the rpc network address to become the master node, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 4. Generate snapshot
+
+For reasons such as setting ha_snapshot_interval_s to -1 when the node starts so that snapshots are not taken by default or other reasons,
+when you need to tell a node generate a snapshot, you can use the `snapshot` command of `lgraph_peer`. An example command is as follows:
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+in:
+
+- `--command snapshot` specifies that the operation to be performed is snapshot, that is, generating a snapshot.
+- `--peer {peer_id}` specifies the rpc network address of the node to generate a snapshot, such as `127.0.0.1:9092`.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..dd74d08869
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,145 @@
+# Tugraph CLI
+
+> This document mainly introduces the CLI tool lgraph_cypher of TuGraph.
+
+## 1.Instructions
+
+The TuGraph release comes with a query client named 'lgraph_cypher' that can be used to submit OpenCypher requests to the TuGraph server. The 'lgraph_cypher' client has two execution modes: single command mode and interactive mode.
+
+## Single command mode
+
+In single-command mode, 'lgraph_cypher' can be used to submit a single Cypher query and print the result directly to the terminal. The printed result can also be easily redirected to a specified file. This is handy when users need to get a lot of results from the server and save them in files.
+
+In this mode, the 'lgraph_cypher' tool has the following options:
+
+### Command line Parameters:
+
+| Parameter | Type   | Instructions                                                                                                                                                                                                                           |
+| --------- | ------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| --help    | \\     | List all parameters and descriptions.                                                                                                                                                                                                  |
+| -example  | \\     | List the command instances.                                                                                                                                                                                                            |
+| -c        | string | A database configuration file used to obtain ip and port information.                                                                                                                                                                  |
+| -h        | string | Database server IP address. Omit this parameter if you have a configuration file. The default value is' 127.0.0.1 '                                                                                               |
+| -p        | string | Database server port. Omit this parameter if you have a configuration file. The default value is 7071                                                                                                                                  |
+| -u        | string | User name for logging in to the database.                                                                                                                                                                                              |
+| -P        | string | Password for logging in to the database.                                                                                                                                                                                               |
+| -f        | string | Contains the path to a single Cypher query single text file.                                                                                                                                                                           |
+| -s        | string | Single-line cypher query command. Start and end with `"`.                                                                                                                                                                              |
+| -t        | int    | Specifies the server timeout threshold for cypher queries. The default value is 150 seconds.                                                                                                                                           |
+| -format   | string | Query result display mode. Supports two formats: 'plain' and 'table'. The 'plain' format prints the query results in a single column. The 'table' format displays the query results in a tabular format. The default value is' table ' |
+
+### Examples:
+
+**cypher command file query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+
+```
+
+**cypher command single-sentence query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+
+```
+
+## Interactive mode
+
+'lgraph_cypher' can also be run in interactive mode. In interactive mode, the client stays connected to the server and interacts with the user in read-evaluate-print-loop.
+
+### Enter lgraph_cypher interaction mode:
+
+If no '-f' or '-s' command line option added, 'lgraph_cypher' will enter interactive mode when running. how to use it:
+
+```
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+
+```
+
+If the login is successful, the corresponding login success message will be displayed:
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2018 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+Now we also provide an interactive shell for users to enter Cypher queries or use the ':help' command to check for available commands.
+
+### Command Description
+
+In addition to the Cypher query, the shell of 'lgraph_cypher' accepts the following commands:
+
+| Command                  | Parameters                                         | instructions                                                                                                                                              |
+| ------------------------ | -------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                                 | Displays the server information and the corresponding description of all commands.                                                                        |
+| :db_info                 | \\                                                 | Query the current server status. /db/info for the corresponding REST API.                                                                                 |
+| :clear                   | \\                                                 | Clear the screen.                                                                                                                                         |
+| :use                     | {Graph Name}                                       | The graph specified with this name defaults to `default`                                                                                                  |
+| :source                  | `-t {Query the timeout value} -f {The query file}` | cypher command file query in interactive mode. The default timeout threshold is 150 seconds. Query file format reference No interactive query parameters. |
+| :exit                    | \\                                                 | Exit interactive mode and return to the original command line.                                                                                            |
+| :format                  | `plain` or `table`                                 | Change the display mode of cypher query results. Support 'plain' and 'table' modes.                                                                       |
+| :save all/command/result | `-f {The file path}` `{Cypher}`                    | The cypher command (command), query result (result) or both (all) are stored. The default location is' /saved_cypher.txt '                                |
+
+**Note:**
+
+- Each command should start with a colon `:`.
+
+**:save command example :**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+
+```
+
+### cypher query command:
+
+In interactive mode, users can also directly input a single sentence cypher command for query, with "'; ` "end. Enter commands that are case insensitive. Here's an example:
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher` supports multi-line input when typing commands. Users can use the `ENTER` key to type long query statements into multiple lines. In the case of multi-line input, the beginning of the command line will change from `>` to `=>`, and the user can continue to type the rest of the query.
+
+Example:
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### Auxiliary Features:
+
+**Input History:** Press the up and down arrow keys in interactive mode to display the input history.
+
+**Auto Completion:** lgraph_cypher will automatically complete based on the input history. In the event of a completion prompt, pressing the right arrow key will automatically complete the command.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..bee9d4c8df
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,440 @@
+# TuGraph DataX
+
+> This document mainly introduces the installation, compilation and usage examples of TuGraph DataX
+
+## 1.Introduction
+
+On the basis of Ali's open source DataX, TuGraph implements the support of writing plug-ins and jsonline data format, and other data sources can write data into TuGraph through DataX.
+TuGraph DataX introduces [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX), Supported features include:
+
+- Import TuGraph from various heterogeneous data sources such as MySQL, SQL Server,Oracle, PostgreSQL, HDFS, Hive, HBase, OTS, ODPS, Kafka and so on. 
+  
+- Import TuGraph to the corresponding target source (to be developed).
+
+Reference for DataX Original Project Introduction [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.Compile and Install
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+The compiled DataX file is in the target directory
+
+## 3.Text data imported into TuGraph with DataX
+
+Using the data from the lgraph_import section of the TuGraph manual as an example, we have three csv data files, as follows:
+`actors.csv`
+
+```
+
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+
+```
+
+`movies.csv`
+
+```
+
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+
+```
+
+`roles.csv`
+
+```
+
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+
+```
+
+Then create three DataX job profiles:
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`/lgraph_server -c lgraph_standalone.json -d 'run'` 'Start TuGraph and run the following commands in sequence:
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## MySQL's data imported into TuGraph with DataX
+
+We create the following table of movies under 'test' database
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+Insert some data into the table
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+Create a DataX job configuration file
+
+`job_mysql_to_tugraph.json`
+
+**Configuring Field**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**Write simple sql**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` Start TuGraph and run the following command：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..a01cf32e66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph Explorer
+
+> TuGraph Explorer has merged to [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..8519247cc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Utility Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..8ebe10da56
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/1.python-client.md
@@ -0,0 +1,222 @@
+# TuGraph Python SDK
+
+> This document is the usage instruction of TuGraph Python SDK
+
+## 1.Overview
+There are two kinds of Python's TuGraph Client. One is the RESTful Client, which uses the HTTP method to send requests to the server. The other is the RPC Client, which uses the RPC method to call the server remote service. Both have their own advantages and disadvantages. The RESTful client is simple to use. You can find the source code file of the Client in the src/client/python/TuGraphClient directory of the project. You can install it directly into the user environment and use it. However, it supports fewer functions and its performance is not high. RPC Client supports both stand-alone servers and high-availability clusters and load balancing. It has many interfaces and powerful functions. However, the usage is more complicated. Users need to compile the TuGraph project themselves to obtain liblgraph_client_python.so, or directly find the dependent library in the /usr/local/lib64 directory when using the runtime image, and introduce it into the python project for normal use. Next, the usage of these two Clients will be introduced in detail.
+
+## 2.RESTful Client
+
+### 2.1. Install Client
+
+TuGraph's Python RESTful client uses the setuptools tool for packaging and distribution. Users can install the client directly into the local environment and introduce it directly when using it.
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+Note: When using the setuptools tool to install the python client, dependencies such as httpx will be installed and need to be executed in an environment with external network access.
+
+### 2.2.Call cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.Call stored procedure
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python's TuGraph Rpc Client is a CPP Client SDK packaged using pybind11. The following table lists the correspondence between Python and CPP Client SDK.
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+The use of Python RPC Client is more complicated. Users can compile TuGraph in the local environment to get liblgraph_client_python.so, or they can use the official runtime image. The dependent library can be found directly in the /usr/local/lib64 directory in the image. It can be used after introducing the user project.
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.Instantiate the client object
+
+#### 3.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+
+#### 3.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 3.2.Call cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.3.Send cypher request to leader
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.4.Call GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.5.Send GQL request to leader
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.6.Calling stored procedures
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.7.Call the stored procedure to the leader
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 3.8.Load stored procedure
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 3.9.List stored procedures
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.10.Delete stored procedures
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 3.11.Import schema from byte stream
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.12.Import edge data from byte stream
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 3.13.Import schema from file
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.14.Import point and edge data from file
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..260a8c6c29
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,339 @@
+# TuGraph C++ SDK
+
+> This document is the usage instruction of TuGraph C++ SDK
+
+## 1.Instructions
+
+C++ Client can use RPC to connect to lgraph_server to import data, execute stored procedures, call Cypher and other operations.
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+#### 2.1.1. Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2. Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3. Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.3. Send cypher request to leader
+```C++
+     std::string str;
+     bool ret = client.CallCypherToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0);
+     @param [out] result The result.
+     @param [in] cypher inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```C++
+     std::string str;
+     bool ret = client.CallGql(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGql(std::string& result, const std::string& gql,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0, const std::string& url = "");
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @param [in] url (Optional) Node address of calling gql.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.5. Send GQL request to leader
+```C++
+     std::string str;
+     bool ret = client.CallGqlToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGqlToLeader(std::string& result, const std::string& gql,
+                  const std::string& graph = "default", bool json_format = true,
+                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```C++
+     std::string str;
+     bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedure(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true,
+                        const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] url (Optional) Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```C++
+     std::string str;
+     bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true);
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+
+### 2.8. Load stored procedure
+```C++
+     std::string str;
+     bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+     bool LoadProcedure(std::string& result, const std::string& source_file,
+                        const std::string& procedure_type, const std::string& procedure_name,
+                        const std::string& code_type, const std::string& procedure_description,
+                        bool read_only, const std::string& version = "v1",
+                        const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] source_file the source_file contain procedure code.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] code_type code type, currently supported PY, SO, CPP, ZIP.
+     @param [in] procedure_description procedure description.
+     @param [in] read_only procedure is read only or not.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```C++
+     std::string str;
+     bool ret = client.ListProcedures(str);
+```
+```
+     bool ListProcedures(std::string& result, const std::string& procedure_type,
+                         const std::string& version = "any",
+                         const std::string& graph = "default", const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type (Optional) the procedure type, "" for all procedures,
+                                  CPP and PY for special type.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] url Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, the request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```C++
+     std::string str;
+     bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+     bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                          const std::string& procedure_name, const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```C++
+     std::string str;
+     bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+     bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                  const std::string& graph = "default", bool json_format = true,
+                                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema the schema to be imported.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```C++
+     std::string str;
+     ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+     bool ImportDataFromContent(std::string& result, const std::string& desc,
+                                const std::string& data, const std::string& delimiter,
+                                bool continue_on_error = false, int thread_nums = 8,
+                                const std::string& graph = "default", bool json_format = true,
+                                double timeout = 0);
+     @param [out] result The result.
+     @param [in] desc data format description.
+     @param [in] data the data to be imported.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+     bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema_file the schema_file contain schema.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+     bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                             const std::string& delimiter, bool continue_on_error = false,
+                             int thread_nums = 8, int skip_packages = 0,
+                             const std::string& graph = "default", bool json_format = true,
+                             double timeout = 0);
+     @param [out] result The result.
+     @param [in] conf_file data file contains format description and data.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] skip_packages (Optional) skip packages number.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..1c560141d3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/3.java-client.md
@@ -0,0 +1,289 @@
+# TuGraph Java SDK
+
+> This document primarily provides usage instructions for the TuGraph Java SDK. It is crucial to note that the TuGraph Java SDK will no longer receive updates or maintenance in the future. Users are strongly advised to utilize [bolt](./5.bolt-client.md) instead.
+
+## 1.Compile java client code
+
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Adding maven dependencies
+
+```xml
+<dependency>
+    <groupId>com.antgroup.tugraph</groupId>
+    <artifactId>tugraph-db-java-rpc-client</artifactId>
+    <version>1.4.1</version>
+</dependency>
+```
+
+Introduce dependencies
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.3. Send cypher request to leader
+```java
+     String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param cypher: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```java
+     String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @param url: (Optional) Node address of calling GQL
+     @return: the result of GQL query execution
+     public String callGql(String gql, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.5. Send GQL request to leader
+```java
+     String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```java
+     String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @param url: (Optional) Node address of calling procedure
+     @return: the result of procedure execution
+     public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph, String url)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```java
+     String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedureToLeader : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @return: the result of procedure execution
+     public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 2.8. Load stored procedure
+```java
+     boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param sourceFile: the source_file contains procedure code
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param codeType: code type, currently supported PY, SO, CPP, ZIP
+     @param procedureDescription: procedure description
+     @param readOnly: procedure is read only or not
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                               String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```java
+     String result = client.listProcedures("CPP", "any", "default");
+     log.info("listProcedures : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @param url: (Optional) Node address of listing procedure
+     @return: the list of procedures
+     public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```java
+     String result = client.deleteProcedure("CPP", "sortstr", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```java
+     boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+     log.info("importSchemaFromContent : " + ret);
+```
+```
+     @param schema: the schema to be imported
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```java
+     boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+     log.info("importDataFromContent : " + ret);
+```
+```
+     @param desc: data format description
+     @param data: the data to be imported
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+             int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```java
+     boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+     log.info("importSchemaFromFile : " + ret);
+```
+```
+     @param schemaFile: the schema_file contains schema
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromFile(String schemaFile, String graph, double timeout)
+             throws UnsupportedEncodingException, IOException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```java
+     boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+     log.info("importDataFromFile : " + ret);
+```
+```
+     @param confFile: data file contains format description and data
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param skipPackages: skip packages number
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+             int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..1a778b73ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,176 @@
+# TuGraph-OGM
+
+@TODO
+
+## 1.Introduction
+
+> TuGraph-OGM project is open source on other repositories.
+
+TuGraph-OGM (Object Graph Mapping) is a graph object mapping tool designed for TuGraph. It supports the mapping of Java objects (POJO) into TuGraph. The classes in Java are mapped to nodes in the graph, the collections in the classes are mapped to edges, and the properties of the classes are mapped to the attributes of the graph objects. It also provides corresponding functions to manipulate the graph database. Therefore, Java developers can easily use TuGraph database in the familiar ecosystem. TuGraph-OGM is also compatible with Neo4j-OGM. Neo4j ecosystem users can migrate seamlessly to TuGraph database.
+
+### 1.1.Functions of TuGraph-OGM
+
+TuGraph-OGM provides the following functions for operating TuGraph:
+
+| Function                            | Usage                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| Insert single vertex/edge                 | void session.save(T object)                                                      |
+| Batch insert vertexs/edges                 | void session.save(T object)                                                      |
+| Delete vertex and its corresponding edges                | void session.delete(T object)                                                    |
+| Delete all vertexs with specific label       | void session.deleteAll(Class\<T> type)                                           |
+| Clear the database                      | void purgeDatabase()                                                             |
+| Update vertex                        | void session.save(T newObject)                                                   |
+| Query single node by id            | T load(Class<T> type, ID id)                                                     |
+| Query multiple nodes by ids           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| Query all nodes with specific label         | Collection\<T> loadAll(Class\<T> type)                                           |
+| Query with conditions                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher query (specify the return type) | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher query                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.Compile TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.Use TuGraph-OGM
+
+Please refer to the detailed examples in TuGraphOGMDemo under the demo folder.How to import dependencies in `pom.xml`.
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // create Movie vertex
+    @Id
+    private Long id;      // Movie id
+    private String title; // title attribute
+    private int released; // released attribute
+
+    // create Edge ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // create Actor vertex
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// configuration
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//Start driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// Open session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.Perform CRUD operations through OGM
+
+```java
+// new
+Movie jokes = new Movie("Jokes", 1990);  // Create Movie-vertex "jokes"
+session.save(jokes);                     // Store "jokes" in TuGraph
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // Connect the "speed" vertex with the "alice" vertex through the ACTS_IN relationship
+session.save(speed);                    // Store two vertexs and one edge
+
+// delete
+session.delete(alice);                  // Delete the "alice" vertex and its connected edge
+Movie m = session.load(Movie.class, jokes.getId());   // Get the "jokes" vertex based on its id
+session.delete(m);                                    // Delete the "jokes" node
+
+// update
+speed.setReleased(2018);
+session.save(speed);                   // Update the "speed" attribute
+
+// get
+Collection<Movie> movies = session.loadAll(Movie.class);  // Get all Movie vertexs
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // Query all movies released before 1995
+
+// Call Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // Query the Movie with "Speed" of 2018
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // Create vertex label "Director"
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // Create edge label "DIRECT"
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // Get the create result
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // View the number of vertexs created
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //View the number of edges created
+
+// Clear the database
+session.deleteAll(Movie.class);        // Delete all Movie vertexs
+session.purgeDatabase();               // Delete all data
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..e45c65a194
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,17 @@
+# Bolt client
+
+TuGraph implements Neo4j's bolt protocol, you can use Neo4j's client to access TuGraph.
+
+## Enable bolt port
+
+If you are using the TuGraph runtime docker image, the config file is `/usr/local/etc/lgraph.json`.
+
+Add `bolt_port=7687` (modify the port) to TuGraph's config file to enable the bolt port, Neo4j clients should connect to the bolt port.
+
+## Limitations on use
+
+TuGraph does not implement all the features of neo4j bolt protocol.
+
+Explicit transactions are currently not supported and need to avoid using these features.
+
+There are some examples for reference under `demos/Bolt` in the code repository.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..3ba53fb6f5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,107 @@
+# TuGraph console client
+
+`lgraph_cli` is a console client based on the bolt protocol, written in c++, which requires a connection to tugraph's bolt port.
+
+`lgraph_cypher` is a console client based on http, written in python, which requires a connection to tugraph's http port.
+
+`lgraph_cypher` needs some python libraries to be installed.
+
+`lgraph_cli` is a binary executable file that has no dependencies on other dynamic libraries and can be executed by copying it to a linux server.
+
+## `lgraph_cli`
+
+The statement ends with a semicolon, type `exit`, `quit` or Ctrl-C to exit the client.
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+The statement can be inputed on more than one line.
+
+```
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+non-interactive
+
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+read statements from file
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## online export
+
+lgraph_cli supports streaming read, so just redirect the output to a file. The output format supports csv and json
+
+### csv
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..b5679e97fd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,341 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+## 2.Request And Response Format
+Tugraph HTTP Server receives requests in json format，After authentication, fields in the request are extracted, the request is processed according to the defined interface logic, and the response in json format is returned.
+
+### 2.1.Standard Response Format
+Each response is returned in the standard response format, as follows：
+
+| body parameter  | parameter description  | parameter type | necessary |
+|--------------|------------------------|----------|-----------|
+| errorCode    | error code             | int      | yes       |
+| success      | Whether the request was successful | int      | yes       |
+| errorMessage | error message          | string   | yes         |
+| data         | the response information returned when the request is successful | json string | yes         |
+
+### 2.2. Request Type
+
+#### 2.2.1. User Login
+The user sends the login request to the server with the user name and password. After successful login, the client receives a signed token (the Json Web Token) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token stored by the client and added to the Authorization domain of the request header in subsequent requests. If the login fails, you will receive the Authentication failed error.
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary       |
+| ------- |-----------------------|-------|------------|
+| userName   | name of the user      | string   | yes          |
+| password   | password of the user  | string | yes          |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00 and the token will be included in data
+
+| body parameter  | parameter description  | parameter type   | necessary |
+| ------- |-------|--------|------|
+| authorization   | token | string | yes  |
+| default_password  | whether the password is the default password | bool | yes  |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. User Logout
+When a user logs out, the authenticated token is deleted. and the user needs to log in again to obtain a new token when sending subsequent requests.
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and data is empty
+
+#### 2.2.3. Refresh Token
+If the delivered token becomes invalid, you need to invoke this interface for re-authentication. The token is valid within one hour after the first login and needs to be refreshed
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the token will be included in data
+
+| body parameter  | parameter description | parameter type | necessary       |
+| ------- |------|----------------|------------|
+| authorization   | token  | string         | yes          |
+
+#### 2.2.4. Call Cypher
+User manipulation of data and models in tugraph requires calling the cypher interface and is initiated through the standard cypher query language
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------------------|---------|-----------|
+| graph   | the name of the subgraph to be queried | string  | yes       |
+| script   | query statement  | string  | yes         |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the query results will be included in data
+
+| body parameter  | parameter description | parameter type | necessary    |
+| ------- |------|----------------|------------|
+| result   | query results | json string    | yes          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. Upload File
+This interface is used to upload local files to the TuGraph machine. You can upload text/binary files, large files, and small files. For large files, the client must split the files, and each file fragment must not be larger than 1MB. Parameters Begin-Pos and Size correspond to the offset and fragment size of this fragment in the complete file. The parameter must be placed in the header of the http request, and the request body contains only the file fragment content. The request header of this interface contains more than token parameters
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header parameter | parameter description                | parameter type | necessary |
+|------------------|--------------------------------------|---------|-------|
+| File-Name        | the name of the file                 | string  | yes   |
+| Begin-Pos        | Offset of the start position of the current file fragment within the file | string  | yes   |
+| Size             | the current file fragment size       | string | yes   |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+#### 2.2.6. Check File
+this interface is used to check the correctness of uploaded files. If the check succeeds, the system returns a success message when the same file is uploaded again
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description       | parameter type | necessary |
+| ------- |-----------------------------|----------------|-----------|
+| fileName   | the name of the file        | string         | yes       |
+| checkSum   | the checksum of the file    | string  | yes when flag set to "1" |
+| fileSize   | the size of the file        | string  | yes when flag set to "2" |
+| flag   | If flag is "1", check md5. If flag is "2"，check file size | string  | yes       |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------|------|------|
+| pass   | true on success, false otherwise | bool | yes  |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. Delete Cached File
+The admin user can delete all the files uploaded by anyone. Other users can delete their own files. You can delete a file with a specified name, a file uploaded by a specified user, or all files
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary |
+| ------- |-----------------------|--------|--------|
+| fileName   | the name of the file  | string | yes when flag set to "0" |
+| userName   | the name of the user  | string | yes when flag set to "1" |
+| flag   | When flag is set to 0, the file specified by fileName is deleted; when flag is set to 1, all files uploaded by userName are deleted; when flag is set to 2, all files are deleted | string | yes    |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. Import Schema
+This interface can create a schema model based on the schema information specified by description parameter. For details about the schema format, refer to data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |-----------------------|----------------|-----------|
+| graph   | name of the subgraph  | string         | yes       |
+| description   | schema infomation     | json string    | yes         |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. Import Data
+This interface allows users to specify uploaded and verified files as data files and import them to the subgraph specified by the graph parameter. The import process is asynchronous, and the server returns a task id after receiving the import request
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description     | parameter type | necessary |
+| ------- |---------------------------|--------|-----|
+| graph   | name of the subgraph      | string | yes |
+| schema   | schema infomation         | json string | yes |
+| delimiter   | column delimiter          | string | yes |
+| continueOnError   | Whether to skip the error and continue when an error occurs | boolean | no  |
+| skipPackages   | number of packets skipped | string | no  |
+| taskId   | used to restart the failed task | string | no  |
+| flag   | If flag is set to 1, the data file is deleted after the import is successful | string | no  |
+| other   | other parameter           | string | no  |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                 | parameter type   | necessary       |
+| ------- |---------------------------------------|--------|------------|
+| taskId   | task id is used to find a import task | string | yes          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. Import Progress Query
+This interface is used to query the execution progress of a import task
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description                     | parameter type    | necessary |
+| ------- |-------------------------------------------|---------|----|
+| taskId   | task id returned by import_data interface | string | 是 |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                | parameter type | necessary |
+| ------- |--------------------------------------|----------------|-----------|
+| success   | 	whether import is successful        | boolean        | yes       |
+| reason   | 	reason of the import failure        | string         | yes if success is false      |
+| progress   | 	import progress at the current time | string         | yes       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..911de26909
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,269 @@
+# RPC API
+
+> This document mainly introduces the details of calling TuGraph's RPC API.
+
+## 1.Introduction
+
+TuGraph provides rich RPC APIs for developers to remotely call the services provided by TuGraph through RPC requests.
+
+RPC (Remote Procedure Call) is a protocol for requesting services from remote computer programs through a network without the need to understand the underlying network technology.
+Compared with REST, RPC is method-oriented and mainly used for calling function methods. It is suitable for more complex communication scenarios and has higher performance.
+brpc is an industrial-grade RPC framework written in C++. Based on brpc, TuGraph provides rich RPC APIs. This document describes how to use TuGraph's RPC API.
+
+## 2.Request
+
+### 2.1.Establishing a Connection
+
+When developers send RPC requests to TuGraph services, they must first establish a connection. Taking C++ as an example, developers create a channel with the specified URL and create a specified service stub (LGraphRPCService_Stub) from the channel. Subsequently, they can send requests to the remote server through the stub like calling local methods.
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.Request Types
+
+TuGraph supports 10 types of RPC requests, and each request's functionality is shown in the following table:
+
+| Request              | Functionality         |
+|-----------------|------------|
+| GraphApiRequest | Vertex-Edge Index   |
+| CypherRequest   | cypher   |
+| PluginRequest   | Stored Procedures     |
+| HARequest       | High Availability    |
+| ImportRequest   | Data Import     |
+| GraphRequest    | Subgraph Operations     |
+| AclRequest      | Access Control     |
+| ConfigRequest   | Configuration     |
+| RestoreRequest  | Backup       |
+| SchemaRequest   | Schema Management |
+
+When a user sends a request, the following parameters need to be passed in:
+- client_version: an optional parameter, in HA mode, it can prevent outdated responses by comparing `client_version` and `server_version`
+- token: a necessary parameter, the client obtains the token after logging in, and the token is passed in with each request to verify the user's identity
+- is_write_op: an optional parameter, indicating whether the request is a write request
+- user: an optional parameter, set user when synchronizing requests between master and slave in HA mode, and no token verification is required After the service processes the RPC request, it sends back a response.
+
+In addition to containing separate response information for each request, the response message also includes the following parameters:
+- error_code: a necessary parameter, indicating the processing status of the request
+- redirect: an optional parameter, when processing fails to send a write request to a follower in HA mode, set redirect as the request forwarding address, that is, the leader address
+- error: an optional parameter, indicating the error information of the request
+- server_version: an optional parameter, set `server_version` in the HA mode request response to avoid reverse time travel when client reads data
+
+:warning:  **Except for CypherRequest, PluginRequest, HARequest and AclRequest, all other RPC interfaces will be gradually deprecated, and their functions will be unified into the CypherRequest interface.**
+
+## 3.Login
+
+The login request message contains the following parameters:
+- user: a necessary parameter, the username
+- pass: a necessary parameter, the password
+
+Taking C++ as an example, the user sends a login request using the constructed service stub:
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+The login response message contains the following parameters:
+- token: a necessary parameter. After successful login, a signed token, namely Json Web Token, will be received. The client stores the token and uses it for each subsequent request. If the login fails, an "Authentication failed" error will be received.
+
+## 4.Query
+Users can interact with TuGraph through Cypher queries. The Cypher request message contains the following parameters:
+- query: a necessary parameter, the Cypher query statement
+- param_names: an optional parameter, the parameter name
+- param_values: an optional parameter, the parameter value
+- result_in_json_format: a necessary parameter, whether to return the query results in JSON format
+- graph: an optional parameter, the subgraph name for executing the Cypher statement
+- timeout: an optional parameter, the timeout for executing the Cypher statement
+
+Taking C++ as an example, the user sends a Cypher request as follows:
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+The Cypher request response contains one of the following two parameters:
+- json_result: the Cypher query result in JSON format
+- binary_result: the Cypher query result in the CypherResult format
+
+## 5.Stored Procedures
+To meet users' more complex query/update logic, TuGraph supports stored procedures written in C and Python. Users can use RPC requests to perform CRUD operations on stored procedures.
+
+### 5.1.Load Stored Procedures
+The request for loading stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- read_only: a necessary parameter, whether it is read-only
+- code: a necessary parameter, the ByteString generated by reading the stored procedure file
+- desc: an optional parameter, the stored procedure description
+- code_type: an optional parameter, the stored procedure code type, which can be PY, SO, CPP, or ZIP
+
+Taking C++ as an example, the user loads the stored procedure as follows:
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for loading the stored procedure does not contain parameters, and if the loading fails, a BadInput exception will be thrown.
+
+### 5.2.Invoke Stored Procedures
+
+The request for invoking stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- param: a necessary parameter, the stored procedure parameters
+- result_in_json_format: an optional parameter, whether to return the invocation result in JSON format
+- in_process: an optional parameter, to be supported in the future
+- timeout: an optional parameter, the timeout for invoking the stored procedure
+
+Taking C++ as an example, the user invokes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+The response for invoking the stored procedure contains one of the following two parameters:
+- reply: the stored procedure invocation result in the ByteString format
+- json_result: the stored procedure invocation result in JSON format
+
+### 5.3.Delete Stored Procedures
+
+The request for deleting stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+
+Taking C++ as an example, the user deletes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for deleting the stored procedure does not contain parameters, and if the deletion fails, a BadInput exception will be thrown.
+
+### 5.4.List Stored Procedures
+
+The request for listing stored procedures does not require parameters. Taking C++ as an example, the user lists the stored procedures as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+The response for listing the stored procedures contains the following parameter:
+- reply: the procedure list in JSON format
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..3ecfbae4cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2738 @@
+# TuGraph RESTful API Legacy
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+:warning: **All the other RESTful APIs excluding the three below will be deprived after 4/30/2023.**
+- **Login**
+- **Query**
+- **Store Procedures**
+
+## 2.Protocols And Data Format
+
+### 2.1.Protocols
+
+Both HTTP and HTTPS protocols are supported by TuGraph. The system uses HTTP protocol by default. To use HTTPS, the `ssl_auth` option should be set to `true` in the DB configuration.
+
+### 2.2.Request
+
+TuGraph supports HTTP GET/POST/PUT/DELETE requests, in which:
+
+- `GET` requests are used for read-only requests, such as getting vertex properties, edge properties, etc.
+
+- `POST` requests are used to create entities, submit Cypher, and to manage and call stored procedures;
+
+- `PUT` requests are used to modify existing entities, for example, to modify vertex properties, edge properties, etc.
+
+- `DELETE` requests are used to delete existing entities, such as vertices, edges, etc.
+
+In high-availability mode, users can set `ServerVersion` in the request header to make sure the request is never served with an outdated version.
+The current `ServerVersion` can be obtained from the header returned by the server.
+
+### 2.3.Response
+
+TuGraph returns the following HTTP status codes:
+
+- **200 OK**: operation is successful.
+- **307 Temporary Redirect**: the operation is redirected, typically in high-availability mode, to the master.
+- **400 Bad Request**: incorrect input, such as URI error, or invalid parameters.
+- **500 Internal Server Error**: server error.
+
+When the operation is successful, the JSON response contains the return value of the operation. When the operation is redirected, the `location` field in the returned HTTP header contains the redirect destination address.
+When an input error or server error occurs, the JSON response contains a `error_message` field that describes the error.
+
+In high-availability mode, the server will set `server_version` field in the header to inform the client of the data version of the current server. When clients switch between several different servers, this version number guarantees that the client will not read from an outdated server.
+
+### 2.4.Data Format
+
+The server and clients exchange data in JSON format. When sending a request, the header of the HTTP request should be set with `Accept:application/json, Content-Type:app/json`.
+For example, to create a new vertex, the request header should look like the following:
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.5.URI Format
+
+TuGraph REST API provides access to: web visualization, login, db info, label, index, node, relationship, cypher, task, cpp_plugin, and python_plugin.
+The URI format used for each function is as follows:
+
+| URI     | Description                     |
+| ------- | ------------------------------- |
+| /web    | web visualization               |
+| /cypher | cypher request                  |
+| /acl    | access control                  |
+| /user   | user management                 |
+| /login  | user login                      |
+| /info   | database status and information |
+| /task   | task management                 |
+| /db     | subgraph management             |
+
+For each subgraph, the following interfaces are provided:
+
+| URI                              | Description                         |
+| -------------------------------- | ----------------------------------- |
+| /db                              | create, modify, and delete subgraph |
+| /db/_{graph_name}_/node          | vertex operations                   |
+| /db/_{graph_name}_/relationship  | edge operations                     |
+| /db/_{graph_name}_/label         | label-related operations            |
+| /db/_{graph_name}_/index         | index-related operations            |
+| /db/_{graph_name}_/cypher        | subgraph-specific cypher operation  |
+| /db/_{graph_name}_/cpp_plugin    | C++ plugin(stored procedure)        |
+| /db/_{graph_name}_/python_plugin | Python plugin(stored procedure)     |
+| /db/_{graph_name}_/import        | online import                       |
+| /db/_{graph_name}_/misc          | other operations                    |
+
+## 3.Login
+
+The system creates an administrator by default, whose username is _admin_ and password is _73@TuGraph_. For security reasons, please remember to change your password after first starting the server.
+
+### 3.1.User Login
+
+TuGraph provides JWT-based user authentication. To log in to the server, the REST client should send a login request containing a username and password. Upon success, the client will receive a signed token in the form of a Json Web Token (JWT) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token should be stored by the client and used for each subsequent request.
+
+- **URI**: `/login`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| user     | username    | String |
+| password | password    | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+| default_password | whether it is the default password | Bool |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.Token Refresh
+
+After the token expires, the front-end initiates a refresh token interface, and the back-end verifies the validity of the token.
+If the verification passes, a new token is generated; if the verification fails, status code 401 is returned.
+
+- **URI**: `/refresh`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.Modify Token Validity Period
+
+To modify the validity period of Token, three parameters need to be transmitted: jwt, refresh_time and expire_time, among which jwt is used to verify the user’s identity. When refresh_time and expire_time are equal to 0, the validity period is indefinite. When refresh_time exceeds, you need to call the refresh interface to obtain a new Token; When expire_time expires, you need to log in again. (This interface call needs to confirm the security by itself, do not call unless necessary)
+
+- **URI**: `/update_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+| refresh_time | Valid time (deafult set to 0) | Int64 |
+| expire_time | Expire time (deafult set to 0) | Int64 |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.Query Token validity period
+To query the validity period of the Token, you need to transmit jwt to verify the user's identity, and return, refresh_time and expire_time, where refresh_time indicates the refresh time, and you need to call the refresh interface to obtain a new Token when it exceeds; expire_time indicates the expiration time, and you need to log in again when it exceeds.
+
+- **URI**: `/get_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return "refresh_time" and "expire_time".
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+### 3.5.Logout
+
+The user logs out and deletes the token at the same time.
+
+- **URI**: `/logout`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+## 4.Query
+
+URI format is:
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.Call Cypher
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description   | Type   |
+| ------ | ------------- | ------ |
+| graph  | subgraph name | String |
+| cypher | Cypher query  | String |
+
+- **RESPONSE**:
+
+| Field   | Description             | Type    |
+| ------- | ----------------------- | ------- |
+| result  | running results         | List    |
+| elapsed | running time in seconds | Float   |
+| header  | header of the results   | List    |
+| size    | number of results       | Integer |
+
+in which `header` is a list with each element in the form of:
+
+| Field | Description                                                | Type   |
+| ----- | ---------------------------------------------------------- | ------ |
+| name  | the name of column                                         | String |
+| type  | column data type, 0 is scalar, 1 is vertex id, 2 is vector |        |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.Call Cypher with Parameters
+
+Cypher supports querying with parameters. When a Cypher query with parameters is called, TuGraph caches the execution plan for that query to speed up the following queries of the same kind.
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type   |
+| ---------- | ------------- | ------ |
+| graph      | subgraph name | String |
+| cypher     | Cypher query  | String |
+| parameters | parameters    | List   |
+
+- **RESPONSE**:
+
+Same as [Call Cypher](#Call-Cypher).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+## 5.Stored Procedures
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.Create Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                                                                       | Type   |
+| ----------- | --------------------------------------------------------------------------------- | ------ |
+| name        | name of the plugin                                                                | String |
+| description | description of the plugin                                                         | String |
+| code_base64 | code of plugin encoded in base64                                                  | String |
+| read_only   | whether it is a read-only stored procedure                                        | Bool   |
+| code_type   | type of plugin code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String |
+
+_Note: read-only plugins are more efficient than write plugins. Always specify `read-only=true` for read-only transactions._
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.so}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 5.2.List Stored Procedures
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list in which each element is a plugin description, in the format of:
+
+| Field       | Description                               | Type   |
+| ----------- | ----------------------------------------- | ------ |
+| name        | name of the stored procedure              | String |
+| description | description of the stored procedure       | String |
+| read_only   | whether the stored procedure is read-only | Bool   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.Retrieve Stored Procedure Detail
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Procedure detail, including code, in the format of:
+
+| Field       | Description                                                                         | Type                   |
+| ----------- | ----------------------------------------------------------------------------------- | ---------------------- |
+| name        | Procedure name                                                                      | String                 |
+| description | Procedure descrition                                                                | String                 |
+| read_only   | Read only or not                                                                    | Bool                   |
+| code_base64 | 存储过程的代码                                                                      | String, Base64 encoded |
+| code_type   | Type of procedue code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String                 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.Call Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: POST
+
+- **REQUEST**: String input.
+
+| Field   | Description                                               | Type   |
+| ------- | --------------------------------------------------------- | ------ |
+| data    | input data                                                | String |
+| timeout | timeout in seconds, defaults to 0, which means no timeout | Float  |
+
+- **RESPONSE**:
+
+| Field  | Description     | Type   |
+| ------ | --------------- | ------ |
+| result | running results | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.Delete Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+## 6.Deprecated
+
+The APIs below will be removed after 4/30/2023.
+
+### 6.1.User Management
+
+#### 6.1.1.Add User
+
+Add a new user and set the initial password for the user. Only administrators have permission to add new users. The username can only have letters, numbers, and underscores, and should not begin with a number. The password can contain any character. The username and password have a maximum length of 64 bytes.
+
+- **URI**: `/user`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                                 | Type   |
+| -------- | ------------------------------------------- | ------ |
+| user     | username                                    | String |
+| password | password                                    | String |
+| is_admin | whether the user is an administrator or not | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "is_admin": false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.Change Password
+
+Users can change their own passwords, in which case the original password needs to be verified.
+
+Administrators can change the passwords of any user and promote non-admin users to administrators, or demote administrator users to regular users. When modifying another user's password, the original password of the user is not needed.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field            | Description                                                                     | Type   |
+| ---------------- | ------------------------------------------------------------------------------- | ------ |
+| current_password | user's current password, if modifying its own password                          | String |
+| new_password     | user's new password                                                             | String |
+| is_admin         | should this user be administrator or not, used when promoting or demoting users | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user/user1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+        "is_admin": true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.3.List All Users
+
+List all users of the database. Only administrators are allowed to perform this operation.
+
+- **URI**: `/user/`
+
+- **METHOD**: GET
+
+- **RESPONSE**: a dictionary of {`user_name`:`is_admin`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+    • 200: OK
+    Output:
+    {
+        "admin": true,
+        "guest1": false
+    }
+
+#### 6.1.4.Delete User
+
+Delete a user from the DB. Only administrators have permission to do so.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.2.Access Control
+
+TuGraph has four access levels. Different users can have different permissions for each subgraph. The four access levels are as follows:
+
+| Access Level | Description                                                                                                               |
+| ------------ | ------------------------------------------------------------------------------------------------------------------------- |
+| NONE         | no access                                                                                                                 |
+| READ         | read-only                                                                                                                 |
+| WRITE        | can read and write vertexes and edges of the subgraph                                                                     |
+| FULL         | full access, including changing metadata (label, index), managing stored procedures and deleting all data in the subgraph |
+
+Administrators have full access on all subgraphs, and a newly created non-admin user does not have access for any subgraph. Users who have full access on a subgraph can set the access level for other users on that subgraph.
+
+#### 6.2.1.Query User's Access Level
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+When both `user` and `graph` are specified, the user's access level for the subgraph is returned, such as `READ`.
+
+When only `user` is specified, all subgraphs that the user can access (access level not `NONE`) are returned, as well as the user's access level on the subgraph.
+
+When only `graph` is specified, all users who have access level on this graph (excluding administrators, who have implicit `FULL` access) and their access levels are returned. This operation requires administrator permission.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/acl/?user=user1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "graph1": "READ",
+      "graph2": "WRITE",
+      "graph3": "FULL"
+    }
+```
+
+#### 6.2.2.Change User's Access Level
+
+- **URI**: `/acl`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field | Description     | Type   |
+| ----- | --------------- | ------ |
+| user  | username        | String |
+| graph | subgraph's name | String |
+| acl   | access level    | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/acl
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "user1",
+        "graph": "graph1",
+        "acl": "FULL"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.Remove User's Access Right
+
+This is equivalent to setting access level to `NONE`.
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/acl/?user=user1&graph=graph1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.Server Status
+
+#### 6.3.1.Modify Server Configuration
+
+Modifying the server configuration will take effect immediately after the configuration modification and will affect all servers. These configurations take precedence over configuration files and command line arguments.
+
+- **URI**: `/config`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+  | Field            | Description                                           | Type |
+  | ---------------- | ----------------------------------------------------- | ---- |
+  | db_async         | Whether to enable asynchronous mode                   | Bool |
+  | optimistic_txn   | Whether to use optimistic transaction lock by default | Bool |
+  | enable_audit_log | Whether to enable audit logging                       | Bool |
+
+- **RESPONSE**: If successful, return status code 200.
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "db_async": true,
+        "enable_audit_log": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.Current Server Status
+
+- **URI**: `/info`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field          | Description                    | Type                                                                                    |
+| -------------- | ------------------------------ | --------------------------------------------------------------------------------------- |
+| lgraph_version | TuGraph version                | String                                                                                  |
+| git_branch     | server's git branch            | String                                                                                  |
+| git_commit     | server's git commit version    | String                                                                                  |
+| web_commit     | web client commit version      | String                                                                                  |
+| cpp_id         | cpp compiler id                | String                                                                                  |
+| cpp_version    | cpp compiler version           | String                                                                                  |
+| python_version | python lib version             | String                                                                                  |
+| cpu            | cpu information                | Dictionary, format refers [CPU Status](#CPU-Status)                                     |
+| disk           | disk IO information            | Dictionary, format refers [Disk Status](#Disk-Status)                                   |
+| memory         | memory information             | Dictionary, format refers [Memory Status](#Memory-Status)                               |
+| db_space       | graph database storage         | Dictionary, format refers [Graph Database Storage](#Graph-Database-Storage)             |
+| db_config      | graph database configuration   | Dictionary, format refers [Graph Database Configuration](#Graph-Database-Configuration) |
+| up_time        | database's online running time | Integer                                                                                 |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.CPU Status
+
+- **URI**: `/info/cpu`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description        | Type    |
+| ------ | ------------------ | ------- |
+| self   | TuGraph CPU usage  | Integer |
+| server | server's CPU usage | Integer |
+| unit   | metric unit        | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.Disk Status
+
+- **URI**: `/info/disk`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description              | Type    |
+| ----- | ------------------------ | ------- |
+| read  | server's disk read rate  | Integer |
+| write | server's disk wrtie rate | Integer |
+| unit  | metric unit              | String  |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.Memory Status
+
+- **URI**: `/info/memory`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description               | Type    |
+| ------------ | ------------------------- | ------- |
+| self         | TuGraph memory usage      | Integer |
+| server_avail | server's available memory | Integer |
+| server_total | server's total memory     | Integer |
+| unit         | metric unit               | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.Database Size
+
+- **URI**: `/info/db_space`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                | Type    |
+| ----- | -------------------------- | ------- |
+| space | total size of the database | Integer |
+| unit  | metric unit                | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.DB Configuration
+
+- **URI**: `/info/db_config`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description                                       | Type    |
+| ------------ | ------------------------------------------------- | ------- |
+| async        | asynchronous mode                                 | Bool    |
+| disable_auth | whether to disable authentication                 | Bool    |
+| enable_ha    | whether to enable high-availability mode          | Bool    |
+| enable_rpc   | whether to enable RPC server                      | Bool    |
+| host         | bound host address                                | String  |
+| port         | port of REST server                               | Integer |
+| rpc_port     | port of RPC server                                | Integer |
+| thread_limit | limit of available threads for the graph database | Integer |
+| use_ssl      | whether to use SSL for authentication             | Bool    |
+| verbose      | verbose level of the output                       | Integer |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "host":"127.0.0.1",
+      "port":7070,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "use_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.7.High Availability Server List
+
+Get a list of replication servers. Valid only in high-availability mode.
+
+- **URI**: `/info/peers`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of server information, each of server information is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+| state        | server state          | String |
+
+The server state can be `MASTER`, `SLAVE`, or `OFFLINE`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.8.Current Leader Information
+
+Get information of current leader. Valid only in HA mode.
+
+- **URI**: `/info/leader`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current leader server information, which is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.9.Server Statistics
+
+- **URI**: `/info/statistics`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current server statistics, which is formatted as:
+
+| Field           | Description                                   | Type    |
+| --------------- | --------------------------------------------- | ------- |
+| requests/second | number of requests processed per second       | Float   |
+| writes/second   | number of write requests processed per second | Float   |
+| running_tasks   | number of requests in progress                | Integer |
+| failure_rate    | request failure rate                          | Float   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 0.023,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.10.Get Audit Logs
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+
+| Field            | Description                                                                                                             | Type      |
+| ---------------- | ----------------------------------------------------------------------------------------------------------------------- | --------- |
+| begin_time       | start time of the queried log (required, format YYYY-mm-dd HH:MM:SS)                                                    | Timestamp |
+| end_time         | end time of the queried log (default is current time, format YYYY-mm-dd HH:MM:SS)                                       | Timestamp |
+| user             | the operator of the queried log (administrator can query all users' logs, ordinary users can only query their own logs) | String    |
+| num_log          | maximum number of logs to return (default 100)                                                                          | Integer   |
+| descending_order | whether to sort the result in descending order(default is true)                                                         | Bool      |
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of audit logs, each of which is an action log in the format of:
+
+| Field      | Description                                        | Type    |
+| ---------- | -------------------------------------------------- | ------- |
+| index      | the index of the operation                         | Integer |
+| begin_time | the start time of the operation                    | String  |
+| end_time   | the end time of the operation                      | String  |
+| user       | the user of the operation                          | String  |
+| graph      | the graph of the operation                         | String  |
+| type       | the type of the operation                          | String  |
+| read_write | the operation is read operation or write operation | String  |
+| success    | whether the operation is successful                | Bool    |
+| content    | the content of the operation                       | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.Task Management
+
+TuGraph tracks long-running tasks such as complex Cypher queries and plugins. Administrators can query currently running tasks through the REST API and choose to abort the queries if necessary.
+
+The URI format for task management is :
+
+```
+    http://{host}:{port}/task/{task_id}
+```
+
+#### 6.4.1.List Running Tasks
+
+- **URI**: `/task`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+The returned JSON is an array, each of which is formatted as follows:
+
+| Field        | Description                                      | Type   |
+| ------------ | ------------------------------------------------ | ------ |
+| description  | the description of the task                      | String |
+| time_elapsed | time the task has been executing for, in seconds | Float  |
+| task_id      | the ID of the task                               | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.Abort Task
+
+- **URI**: `/task/{task_id}`
+
+Where `task_id` is the `task_id` returned by `GET /task` .
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.5.Subgraph Management
+
+TuGraph supports multiple subgraphs and all subgraphs are completely independent from others. Different subgraphs can have different permissions to different users. Administrators can add, modify and delete subgraphs.
+
+#### 6.5.1.Create New Subgraph
+
+- **URI**: `/db`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description                   | Type                                                                |
+| ------ | ----------------------------- | ------------------------------------------------------------------- |
+| name   | the name of subgraph          | String                                                              |
+| config | the configuration of subgraph | Dictionary, in the format of {{column name 1}:{column value 1},...} |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1"
+        "config" : {
+            "max_size_GB":2048,
+            "async":True
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.Delete Subgraph
+
+- **URI**: `/db/{graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.List All Subgraphs
+
+- **URI**: `/db`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of all subgraphs.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_gb":1024,
+            "async":false
+        }
+    }
+```
+
+### 6.6.Label
+
+TuGraph is a strong-schema database. In each subgraph, each vertex and edge need to have a predefined data format. The data format is determined by Label. Users can use the REST API to add, delete, and query labels and their corresponding data format.
+
+The URI format of the Label operation is
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+Where the {type} can be `node` or `relationship`.
+
+#### 6.6.1.Create Label
+
+A label is created with a fixed data format. A label must be defined before any node or relationship can be created with that label.
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field            | Description                  | Type   |
+| ---------------- | ---------------------------- | ------ |
+| name             | the name of label            | String |
+| fields           | data column definition       | List   |
+| is_vertex        | whether it is a vertex Label | Bool   |
+| primary          | vertex primary property      | String |
+| edge_constraints | edge constraints             | List   |
+
+`primary` should be set when `is_vertex` is `true`. This field is only available for Vertex, and must be set when creating Vertex.
+
+`edge_constraints` could be set when `is_vertex` is `false`, This field is only available for Edge. This field limits the combination of starting and ending vertex of the edge, for example: `[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, just leave this field unset.
+
+In which `fields` is an array, in which each element defines a column of data, as follows:
+
+| Field    | Description                                                | Type                                                                                                         |
+| -------- | ---------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------ |
+| name     | the name of the column                                     | String                                                                                                       |
+| type     | the data type of the column                                | String, with following types: int8, int16, int32, int64, float, double, string, date, datetime, binary, blob |
+| optional | whether the data can be empty (optional, default is false) | Bool                                                                                                         |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.List All Labels
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description               | Type |
+| ------ | ------------------------- | ---- |
+| edge   | the list of edge labels   | List |
+| vertex | the list of vertex labels | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.Get Label Data Format
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Data column definition table as a dictionary, in which each key is the column name, and corresponding value is the column definition defined as follows:
+- | Field    | Description                           | Type   |
+  | -------- | ------------------------------------- | ------ |
+  | optional | whether the column value can be empty | Bool   |
+  | type     | the type of the column value          | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema Import
+
+- **URI**: `/db/{graph_name}/schema/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description              | Type   |
+| ----------- | ------------------------ | ------ |
+| description | Graph labels description | String |
+
+The detail description can refer to `TuGraph Manual`.
+
+- **RESPONSE**:
+
+Schema import will check the new schema and original schema in database if compatible or not. If yes, this request will add the label only in new schema. If no, will return an error code.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.Vertex Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+in which `vid` is a unique integer identifying the vertex, which can be obtained when creating new vertexes or by looking up index.
+
+#### 6.7.1.List Vertex and Label Number
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field      | Description                | Type    |
+| ---------- | -------------------------- | ------- |
+| num_label  | the number of vertex label | Integer |
+| num_vertex | the number of vertex       | Integer |
+
+_Note: `num_vertex` returns an estimate of the number of vertexes, not the exact number. To get the exact number, please use Cypher queries._
+
+#### 6.7.2.Create New Vertex
+
+Insert a vertex into the database.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                  | Type       |
+| -------- | ---------------------------- | ---------- |
+| label    | the name of label            | String     |
+| property | the properties of the vertex | Dictionary |
+
+in which `property` is a dictionary of {`column_name`:`column_value`}.
+
+- **RESPONSE**: if successful, return status code 200 and the new vertex's vid, which can be used in later vertex operations.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.Batch Create Vertexes
+
+TuGraph allows multiple vertices to be inserted as one batch to reduce network overhead.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description               | Type   |
+| ------ | ------------------------- | ------ |
+| label  | the name of Label         | String |
+| fields | the column names          | List   |
+| values | the values of each vertex | List   |
+
+in which `fields` is a list of strings specifying column names, and `values` is a list in which each element is a list of `column_values` corresponding to the column names as specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200, and return the vid list of newly added vertices in the JSON content, where each vid corresponds to each vertex in the request.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.Get Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description       | Type                                                             |
+| -------- | ----------------- | ---------------------------------------------------------------- |
+| label    | the name of Label | String                                                           |
+| property | property          | Dictionary, in the format of {column_name_1:column_value_1, ...} |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.Delete Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200, and also the following content in JSON:
+
+| Field | Description                                    | Type    |
+| ----- | ---------------------------------------------- | ------- |
+| in    | number of incoming edges of the deleted vertex | Integer |
+| out   | number of outgoing edges of the deleted vertex | Integer |
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.Get Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Vertex properties as a dictionary of {`column_name`:`column_value`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.Get Vertex Field
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Value corresponding to the specified `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.Update Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description          | Type       |
+| -------- | -------------------- | ---------- |
+| property | properties to update | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "13737299333"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.8.Edge Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+in which `euid` is a string uniquely identifying the edge, which can be obtained when creating edges or by iterating through the edges of a vertex.
+
+#### 6.8.1.Create Edge
+
+- **URI**: `/db/{graph_name}/node/{src_vid}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                     | Type       |
+| ----------- | ------------------------------- | ---------- |
+| label       | the label of edge               | String     |
+| destination | the `vid` of destination vertex | Integer    |
+| property    | the property of edge            | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200 and the `euid` of new created edge (type is String).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.Batch Create Edges
+
+- **URI**: `/db/{graph_name}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description          | Type   |
+| ------ | -------------------- | ------ |
+| label  | the label of edge    | String |
+| fields | the data column name | List   |
+| edge   | the data of edge     | List   |
+
+where the edge is a list of data, each of which specifies and edge, defined as follows:
+
+| Field       | Description           | Type    |
+| ----------- | --------------------- | ------- |
+| source      | source vertex id      | Integer |
+| destination | destination vertex id | Integer |
+| values      | the data list         | List    |
+
+in which `values` is a list of column values, each of which correspond to the a column name specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200 and the list of `euid`s of the newly created edges.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.List Out-going Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of source vertex's out-going edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.List Incoming Edges
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of destination vertex's incoming edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.List All Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                     | Type |
+| ----- | ------------------------------- | ---- |
+| in    | list of incoming edges' `euid`s | List |
+| out   | list of outgoing edges' `euid`s | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.Get Edge Information
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description                | Type       |
+| -------- | -------------------------- | ---------- |
+| label    | the label of the edge      | String     |
+| property | the properties of the edge | Dictionary |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.Delete Edge
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.Get Edge Properties
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The dictionary of edge's properties.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.Get Edge Field
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the value corresponding to given `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.Update Edge Property
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description              | Type       |
+| -------- | ------------------------ | ---------- |
+| property | properties to be updated | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.9.Index
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+#### 6.9.1.Create Index
+
+Create an index on a (label, field) pair. Blocks until the index is successfully built.
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field     | Description                                                                                 | Type   |
+| --------- |---------------------------------------------------------------------------------------------|--------|
+| label     | the name of label                                                                           | String |
+| field     | field to be indexed                                                                         | String |
+| type | the type of index, 0 means nonunique index, 1 means unique index, 2 means pair_unique index | int      |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.List All Indexes
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.List Indexes Related with Specified Label
+
+- **URI**: `/db/{graph_name}/index/{label}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.Delete Index
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.Get Vertex by Index
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of `vid`s.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+
+
+
+### 6.10.Data Import
+
+- **URI**: `/db/{graph_name}/import/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field             | Description                                                                                        | Type                       |
+|-------------------|----------------------------------------------------------------------------------------------------|----------------------------|
+| description       | description of the file content                                                                    | String                     |
+| data              | contents of the file to be imported (recommended to have a size of 16MB, has a hard limit of 17MB) | Strings / Arrays / Objects |
+| continue_on_error | whether to continue import when an error occurred (optional, default is `false`)                   | Bool                       |
+| delimiter         | delimiter used in the data file (optional, default is `“,”`)                                       | String                     |
+
+The details of the `description` field can be found in [TuGraph Import Tool](../6.utility-tools/1.data-import.md).
+
+`delimiter` can be a single character or multi-character string, but must not contain `\r` or `\n`.
+
+`data` can be one of the following:
+
+- String, such as `"1,2\n3,4\n"`
+- Array of ASCII codes, such as `[49,44,50,10,51,44,52,10]`
+- Dictionary shaped like the above array, such as `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+* **RESPONSE**:
+
+The system **will not** automatically perform actions such as creating a new label, adding an index, and so on. Before you do this, please make sure that the label involved already exists and has an appropriate index.
+
+If the import is successful, return code 200 and return log information (possibly empty) in the `log` field. Otherwise, returns status code 400. None of the data is imported on failure, and error message is set in `error_message`.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+Because the request specifies `continue_on_error: true`, the returned `log` indicates that the first edge cannot be inserted because there is no vertex with uid==1, while the second edge was imported successfully.
+
+### 6.11.Miscellany
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.Extract Subgraph
+
+Give a set of `vid`s and return the minimum subgraph which contains the vertex set and the edges between them.
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type |
+| ---------- | ------------- | ---- |
+| vertex_ids | vertex id set | List |
+
+- **RESPONSE**:
+
+| Field         | description        | Type                                                               |
+| ------------- | ------------------ | ------------------------------------------------------------------ |
+| nodes         | vertex information | List, each element contains vid, label, and properties.            |
+| relationships | edge information   | List, each element contains src, dst, euid, label, and properties. |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..8a5a18add0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Client Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..a3203b50f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/8.query/1.cypher.md
@@ -0,0 +1,2569 @@
+# Cypher API
+
+> This document mainly introduces the detailed usage instructions of TuGraph-Cypher.
+
+## Table of contents
+- [1.Operators](#1operators)
+  - [1.1.Summary](#11summary)
+  - [1.2.General Operators](#12general-operators)
+  - [1.3.Mathematical Operators](#13mathematical-operators)
+  - [1.4.Comparison Operators](#14comparison-operators)
+  - [1.5.String Specific Comparison Operators](#15string-specific-comparison-operators)
+  - [1.6.Boolean Operators](#16boolean-operators)
+  - [1.7.String Operators](#17string-operators)
+  - [1.8.List Operators](#18list-operators)
+- [2.Clauses](#2clauses)
+  - [2.1.Summary](#21summary)
+  - [2.2.Match](#22match)
+  - [2.3.Return](#23return)
+  - [2.4.Where](#24where)
+  - [2.5.Skip](#25skip)
+  - [2.6.Limit](#26limit)
+  - [2.7.Create](#27create)
+  - [2.8.Callyield](#28callyield)
+  - [2.9.Union](#29union)
+- [3.Functions](#3functions)
+  - [3.1.Whole List of Functions](#31whole-list-of-functions)
+  - [3.2.Predicate Functions](#32predicate-functions)
+  - [3.3.Scalar Functions](#33scalar-functions)
+  - [3.4.Aggregating Functions](#34aggregating-functions)
+  - [3.5.List Funtions](#35list-funtions)
+  - [3.6.Mathematical Functions](#36mathematical-functions)
+- [4.Extensions to Opencypher](#4extensions-to-opencypher)
+- [5.Procedures](#5procedures)
+  - [5.1.Procedures Demos](#51procedures-demos)
+  - [5.2.Whole List of Procedures](#52whole-list-of-procedures)
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators support progress overview：
+
+| category                             | supported                                                                                                                                                       | unsupported                                 |
+| ------------------------------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------- |
+| General operators                    | <code>DISTINCT</code>, <code>.</code> for property access                                                                                                       | <code>[]</code> for dynamic property access |
+| Mathematical operators               | <code>+</code>, <code>-</code>, <code>\*</code>, <code>/</code>, <code>%</code>, <code>^</code>                                                                 |                                             |
+| Comparison operators                 | <code>=</code>, <code>&lt;&gt;</code>, <code>&lt;</code>, <code>&gt;</code>, <code>⇐</code>, <code>&gt;=</code>, <code>IS NULL</code>, <code>IS NOT NULL</code> |                                             |
+| String-specific comparison operators | <code>STARTS WITH</code>, <code>ENDS WITH</code>, <code>CONTAINS</code>, <code>REGEXP</code>                                                                    |                                             |
+| Boolean operators                    | <code>AND</code>, <code>OR</code>, <code>XOR</code>, <code>NOT</code>                                                                                           |                                             |
+| String operators                     | <code>+</code> for concatenation                                                                                                                                |                                             |
+| List operators                       | <code>+</code> for concatenation, <code>IN</code> to check existence of an element in a list, <code>[]</code> for accessing element(s)                          |                                             |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+  ```
+  CREATE (a:Person {name: 'Anne', eyeColor: 'blue'}),
+         (b:Person {name: 'Bill', eyeColor: 'brown'}),
+         (c:Person {name: 'Carol', eyeColor: 'blue'})
+  ```
+
+  ```
+  MATCH (p:Person ) RETURN DISTINCT p.eyeColor
+  ```
+
+- ✓ Accessing properties of a nested literal map using the `.` operator
+
+  ```
+  WITH {person: {name: 'Anne', age: 25}} AS p
+  RETURN p.person.name
+  ```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+  ```
+  CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+         (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+         (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+  ```
+  ```
+  MATCH (restaurant:Restaurant), (category:Category)
+  WHERE restaurant["rating_" + category.name] > 6
+  RETURN DISTINCT restaurant.name
+  ```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator `^`
+
+  ```
+  WITH 2 AS number, 3 AS exponent
+  RETURN number ^ exponent AS result
+  ```
+
+- ✓ Using the unary minus operator `-`
+  ```
+  WITH -3 AS a, 4 AS b
+  RETURN b - a AS result
+  ```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+  ```
+  WITH 4 AS one, 3 AS two
+  RETURN one > two AS result
+  ```
+
+### 1.5.String-specific comparison operators
+
+<span id="jump"></span>
+
+- ✓ Using STARTS WITH to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate STARTS WITH 'Jo'
+  RETURN candidate
+  ```
+
+- ✓ Using REGEXP to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate REGEXP 'Jo.*n'
+  RETURN candidate
+  ```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+  ```
+  WITH [2, 4, 7, 9, 12] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number = 4 OR (number > 6 AND number < 10)
+  RETURN number
+  ```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+  More details on string-specific comparison operators can be found [here](#jump)
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+  ```
+  RETURN [1,2,3,4,5]+[6,7] AS myList
+  ```
+- ✓ Using IN to check if a number is in a list
+
+  ```
+  WITH [2, 3, 4, 5] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number IN [2, 3, 8]
+  RETURN number
+  ```
+
+- ✓ Accessing elements in a list using the [] operator
+  ```
+  WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+  RETURN names[1..3] AS result
+  ```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses support progress list：
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>grammar</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="3"><p>Reading clauses</p></td>
+			<td><p>MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>OPTIONAL MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>MANDATORY MATCH</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="3"><p>Projecting clauses</p></td>
+			<td><p>RETURN … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>WITH … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>UNWIND … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="4"><p>Reading sub-clauses</p></td>
+			<td><p>WHERE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>ORDER BY [ASC[ENDING] / DESC[ENDING]]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>SKIP</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>LIMIT</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>Writing clauses</p></td>
+			<td><p>CREATE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>DETACH DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>SET</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>REMOVE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Reading/Writing clauses</p></td>
+			<td><p>MERGE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>CALL […YIELD]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Set operations</p></td>
+			<td><p>UNION</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>UNION ALL</p></td>
+			<td><p>supported</p></td>
+		</tr>
+	</tbody>
+</table>
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+    ```
+    MATCH (n)
+    RETURN n
+    ```
+  - ✓ Get all nodes with a label
+    ```
+    MATCH (movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Related nodes
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+  - ✓ Match with labels
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[]->(movie)
+    RETURN movie.title
+    ```
+  - ✓ Directed relationships and variable
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[r]->(movie)
+    RETURN type(r)
+    ```
+  - ✓ Match on relationship type
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})<-[:ACTED_IN]-(actor)
+    RETURN actor.name
+    ```
+  - ✓ Match on multiple relationship types
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[:ACTED_IN|:DIRECTED]-(person)
+    RETURN person.name
+    ```
+  - ✓ Match on relationship type and use a variable
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[r:ACTED_IN]-(actor)
+    RETURN r.role
+    ```
+
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+    ```
+    MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+    RETURN type(r)
+    ```
+  - ✓ Multiple relationships
+    ```
+    MATCH (charlie {name: 'Charlie Sheen'})-[:ACTED_IN]->(movie)<-[:DIRECTED]-(director)
+    RETURN movie.title, director.name
+    ```
+  - ✓ Variable-length relationships
+    ```
+    MATCH (martin {name: 'Charlie Sheen'})-[:ACTED_IN*1..3]-(movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Relationship variable in variable-length relationships
+    ```
+    MATCH p = (actor {name: 'Charlie Sheen'})-[:ACTED_IN*2]-(co_actor)
+    RETURN relationships(p)
+    ```
+  - ❏ Match with properties on a variable-length path
+    ```
+    MATCH p = (charlie:Person)-[* {blocked:false}]-(martin:Person)
+    WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+    RETURN p
+    ```
+  - ✓ Zero-length paths
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})-[*0..1]-(x)
+    RETURN x
+    ```
+  - ✓ Named paths
+
+    ```
+    MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+    ```
+
+  - ✓ Matching on a bound relationship
+
+    ```
+    MATCH (a)-[r]-(b)
+    WHERE id(r)= 0
+    RETURN a,b
+    ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (oliver:Person {name: 'Oliver Stone'}),
+    p = shortestPath((martin)-[*..15]-(oliver))
+    RETURN p
+    ```
+  - ✓ All shortest paths
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (michael:Person {name: 'Michael
+    Douglas'}), p = allShortestPaths((martin)-[*]-(michael))
+    RETURN p
+    ```
+
+- Get node or relationship by id
+
+  - ✓ Node by id
+    ```
+    MATCH (n)
+    WHERE id(n)= 0
+    RETURN n
+    ```
+  - ☒ Relationship by id
+    ```
+    MATCH ()-[r]->()
+    WHERE id(r) = 0
+    RETURN r
+    ```
+  - ✓ Multiple nodes by id
+    ```
+    MATCH (n)
+    WHERE id(n) IN [0, 3, 5]
+    RETURN n
+    ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+  ```
+  MATCH (n {name: 'B'}) RETURN n
+  ```
+
+  > **Note**
+  >
+  > Return `id` of n.
+
+- ✓ Return relationships
+
+  ```
+  MATCH (n {name: 'A'})-[r:KNOWS]->(c)
+  RETURN r
+  ```
+
+  > **Note**
+  >
+  > Return `EdgeUid` of r.
+
+- ✓ Return property
+  ```
+  MATCH (n {name: 'A'}) RETURN n.name
+  ```
+- ❏ Return all elements
+  ```
+  MATCH p = (a {name: 'A'})-[r]->(b)
+  RETURN *
+  ```
+- ❏ Variable with uncommon characters
+  ```
+  MATCH (`This isn\'t a common variable`)
+  WHERE `This isn\'t a common variable`.name = 'A'
+  RETURN `This isn\'t a common variable`.happy
+  ```
+- ✓ Aliasing a field
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age AS SomethingTotallyDifferent
+  ```
+- ✓ Optional properties
+  ```
+  MATCH (n)
+  RETURN n.age
+  ```
+- ❏ Other expressions
+
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age > 30, "I'm a literal", (a)-[]->()
+  ```
+
+  `(a)-[]->()` not supported.
+
+- ✓ Unique results
+  ```
+  MATCH (a {name: 'A'})-[]->(b)
+  RETURN DISTINCT b
+  ```
+
+### 2.4.WHERE
+
+- Basic usage
+
+  - ✓ Boolean operations
+    ```
+    MATCH (n)
+    WHERE n.name = 'Peter' XOR (n.age < 30 AND n.name = 'Tobias') OR NOT (n.name =
+    'Tobias' OR n.name = 'Peter')
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node label
+    ```
+    MATCH (n)
+    WHERE n:Swedish
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node property
+    ```
+    MATCH (n)
+    WHERE n.age < 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on relationship property
+    ```
+    MATCH (n)-[k:KNOWS]->(f)
+    WHERE k.since < 2000
+    RETURN f.name, f.age, f.email
+    ```
+  - ❏ Filter on dynamically-computed property
+    ```
+    WITH 'AGE' AS propname
+    MATCH (n)
+    WHERE n[toLower(propname)]< 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Property existence checking
+    ```
+    MATCH (n)
+    WHERE exists(n.belt)
+    RETURN n.name, n.belt
+    ```
+
+- String matching
+
+  - ✓ Match the beginning of a string
+    ```
+    MATCH (n)
+    WHERE n.name STARTS WITH 'Pet'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match the ending of a string
+    ```
+    MATCH (n)
+    WHERE n.name ENDS WITH 'ter'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match anywhere within a string
+    ```
+    MATCH (n)
+    WHERE n.name CONTAINS 'ete'
+    RETURN n.name, n.age
+    ```
+  - ✓ String matching negation
+    ```
+    MATCH (n)
+    WHERE NOT n.name ENDS WITH 's'
+    RETURN n.name, n.age
+    ```
+
+- Using path patterns in `WHERE`
+
+  - ✓ Filter on patterns
+    ```
+    MATCH (tobias {name: 'Tobias'}), (others)
+    WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+    RETURN others.name, others.age
+    ```
+  - ✓ Filter on patterns using NOT
+    ```
+    MATCH (persons), (peter {name: 'Peter'})
+    WHERE NOT (persons)-[]->(peter)
+    RETURN persons.name, persons.age
+    ```
+  - ✓ Filter on patterns with properties
+
+    ```
+    MATCH (n)
+    WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+    RETURN n.name, n.age
+    ```
+
+  - ✓ Filter on relationship type
+    ```
+    MATCH (n)-[r]->()
+    WHERE n.name='Andres' AND type(r) STARTS WITH 'K'
+    RETURN type(r), r.since
+    ```
+
+- Lists
+
+  - ✓ IN operator
+    ```
+    MATCH (a)
+    WHERE a.name IN ['Peter', 'Tobias']
+    RETURN a.name, a.age
+    ```
+
+- Missing properties and values
+
+  - ✓ Default to false if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white'
+    RETURN n.name, n.age, n.belt
+    ```
+  - ✓ Default to true if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+    ORDER BY n.name
+    ```
+  - ✓ Filter on null
+    ```
+    MATCH (person)
+    WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+    person.belt
+    ```
+
+- Using ranges
+
+  - ✓ Simple range
+    ```
+    MATCH (a)
+    WHERE a.name >= 'Peter'
+    RETURN a.name, a.age
+    ```
+  - ✓ Composite range
+    ```
+    MATCH (a)
+    WHERE a.name > 'Andres' AND a.name < 'Tobias'
+    RETURN a.name, a.age
+    ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 3
+  ```
+- ✓ Return middle two records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 1
+  LIMIT 2
+  ```
+- ✓ Using an expression with SKIP to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP toInteger(3*rand())+ 1
+  ```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT 3
+  ```
+- ✓ Using an expression with LIMIT to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT toInteger(3 * rand())+ 1
+  ```
+
+### 2.7.CREATE
+
+- Create nodes
+
+  > **Note**
+  >
+  > TuGraph does not support creating empty nodes and does not support multiple labels.
+
+  - ☒ Create single node
+    ```
+    CREATE (n)
+    ```
+  - ☒ Create multiple nodes
+    ```
+    CREATE (n), (m)
+    ```
+  - ✓ Create a node with a label
+    ```
+    CREATE (n:Person)
+    ```
+  - ☒ Create a node with multiple labels
+    ```
+    CREATE (n:Person:Swedish)
+    ```
+  - ✓ Create node and add labels and properties
+    ```
+    CREATE (n:Person {name: 'Andres', title: 'Developer'})
+    ```
+  - ✓ Return created node
+    ```
+    CREATE (a {name: 'Andres'})
+    RETURN a
+    ```
+
+- Create relationships
+
+  - ✓ Create a relationship between two nodes
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE]->(b)
+    ```
+  - ✓ Create a relationship and set properties
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE {name: a.name + '<->' + b.name}]->(b)
+    ```
+  - ✓ Create a full path
+    ```
+    CREATE p = (andres {name:'Andres'})-[:WORKS_AT]->(neo)<-[:WORKS_AT]-(michael {name:'Michael'})
+    RETURN p
+    ```
+
+- Use parameters with CREATE
+
+  - ❏ Create node with a parameter for the properties
+    ```
+    CREATE (n:Person $props)
+    RETURN n
+    ```
+  - ☒ Create multiple nodes with a parameter for their properties
+    ```
+    UNWIND $props AS map
+    CREATE (n)
+    SET n = map
+    ```
+    cannot create vertex without label.
+
+### 2.8.CALL\[…YIELD\]
+
+- ✓ Call a procedure using CALL
+  ```
+  CALL db.vertexLabels
+  ```
+- ✓ View the signature for a procedure
+  ```
+  CALL dbms.procedures() YIELD name, signature
+  WHERE name='dbms.listConfig'
+  RETURN signature
+  ```
+- ❏ Call a procedure using a quoted namespace and name
+  ```
+  CALL `db`.`vertexLabels`
+  ```
+- ✓ Call a procedure with literal arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+  ```
+- ❏ Call a procedure with parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+  ```
+- ❏ Call a procedure with mixed literal and parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+  ```
+- ✓ Call a procedure with literal and default arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+  ```
+- ✓ Call a procedure within a complex query using CALL…YIELD
+  ```
+  CALL db.vertexLabels() YIELD label
+  RETURN count(label) AS numLabels
+  ```
+- ✓ Call a procedure and filter its results
+  ```
+  CALL db.vertexLabels() YIELD label
+  WHERE label CONTAINS 'User'
+  RETURN count(label) AS numLabels
+  ```
+- ❏ Call a procedure within a complex query and rename its outputs
+  ```
+  CALL db.propertyKeys() YIELD propertyKey AS prop
+  MATCH (n)
+  WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+  ```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION ALL MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+- ❏ Combine two queries and remove duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION
+  MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>function</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="5"><p>Predicate functions</p></td>
+			<td><p>exists()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>all()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>any()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>single()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>none()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="16"><p>Scalar functions</p></td>
+			<td><p>id()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>properties()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>head()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>last()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toBoolean()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>toFloat()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toInteger()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toString()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>type()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>startnode()</p></td>
+            <td><p></p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>size()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>length()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+            <td><p>substring()</p></td>
+            <td><p></p></td>
+        </tr>
+        <tr class="odd">
+            <td><p>concat()</p></td>
+            <td><p></p></td>
+        </tr>
+        <tr class="even">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>label()</p></td>
+            <td><p>OpenCypher extension method</p></td>
+		</tr>
+        <tr class="even">
+			<td rowspan="12"><p>Aggregating functions</p></td>
+			<td><p>avg()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>collect()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>count()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>max()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>min()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>percentileCont()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>percentileDisc()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>stDev()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>stDevP()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+                <td><p>variance()</p></td>
+                <td></td>
+            </tr>
+        <tr class="odd">
+                <td><p>varianceP()</p></td>
+                <td></td>
+            </tr>
+        <tr class="even">
+                <td><p>sum()</p></td>
+                <td></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>List functions</p></td>
+			<td><p>keys()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>labels()</p></td>
+			<td><p></p></td>
+		</tr>
+	<tr class="odd">
+			<td><p>nodes()</p></td>
+			<td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>range()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>subscript()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="6"><p>Mathematical functions</p></td>
+			<td><p>abs()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>ceil()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>floor()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>rand()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>round()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>sign()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>String functions</p></td>
+			<td><p>/</p></td>
+			<td></td>
+		</tr>
+	</tbody>
+</table>
+
+### 3.2.Predicate functions
+
+- exists()
+
+  judge it whether a vertex or edge has the field .
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE exists(n.belt)
+  RETURN n.name, n.belt
+  ```
+
+  **Example output:**
+
+  | exists(name) |
+  | ------------ |
+  | true         |
+
+### 3.3.Scalar functions
+
+- id()
+
+  get the id of vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  RETURN id(a)
+  ```
+
+  **Example output:**
+
+  | vid |
+  | --- |
+  | 1   |
+  | 2   |
+  | ... |
+
+- properties()
+
+  get a map containing all the properties of a node or relationship.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  CREATE (p:Person {name: 'Stefan', city: 'Berlin'})
+  RETURN properties(p)
+  ```
+
+  **Example output:**
+
+  | properties                |
+  | ------------------------- |
+  | {name:Stefan,city:Berlin} |
+
+- head()
+
+  get the first element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, head(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | head(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "one"         |
+
+- last()
+
+  get the last element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, last(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | last(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "three"       |
+
+- toFloat()
+
+  Converts an integer or string value to a floating point number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toFloat('11.5'), toFloat('not a number')
+  ```
+
+  **Example output:**
+  | float |
+  | ----- |
+  | 11.5 |
+  |null|
+
+- toInteger()
+
+  Converts a floating point or string value to an integer value.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toInteger('2.3') AS integer
+  ```
+
+  **Example output:**
+
+  | integer |
+  | ------- |
+  | 2       |
+
+- toString()
+
+  Converts an integer, float, boolean value to a string.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toString(2.3)
+  ```
+
+- type()
+
+  get the string representation of the relationship type.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name = 'Alice'
+  RETURN type(r)
+  ```
+
+  **Example output:**
+
+  | type     |
+  | -------- |
+  | acted_in |
+  | acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+
+  Returns the average of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN avg(n.age)
+  ```
+
+  **Example output:**
+
+  | avg(n.born)        |
+  | ------------------ |
+  | 1869.2661654135338 |
+
+- collect()
+
+  Returns a list containing the values returned by an expression.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN collect(n.age)
+  ```
+
+  **Example output:**
+
+  | collect(n.born) |
+  | --------------- |
+  | [1967,...]      |
+
+- count()
+
+  Returns the number of values or records.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n {name: 'A'})-[]->(x)
+  RETURN labels(n), n.age, count(*)
+  ```
+
+  **Example output:**
+
+  | labels(n)  | n.age | count(\*) |
+  | ---------- | ----- | --------- |
+  | ["Person"] | 13    | 3         |
+
+- max()
+
+  Returns the maximum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN max(n.age)
+  ```
+
+  **Example output:**
+
+  | max(n.age) |
+  | ---------- |
+  | 44         |
+
+- min()
+
+  Returns the minimum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN min(n.age)
+  ```
+
+  **Example output:**
+
+  | min(n.age) |
+  | ---------- |
+  | 13         |
+
+- percentileCont()
+
+  Returns the percentile of a value over a group using linear interpolation.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileCont(n.age, 0.4)
+  ```
+
+  **Example output:**
+
+  | percentileCont(n.age, 0.4) |
+  | -------------------------- |
+  | 29                         |
+
+* percentileDisc()
+
+  Returns the nearest value to the given percentile over a group using a rounding method.
+
+  **Scope:** whole instance.
+
+  **Output:** the percentile of the given value over a group.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileDisc(n.age, 0.5)
+  ```
+
+  **Example output:**
+
+  | percentileDisc(n.age, 0.5) |
+  | -------------------------- |
+  | 33                         |
+
+* stDev()
+
+  Returns the standard deviation for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDev(n.age)
+  ```
+
+  **Example output:**
+
+  | stDev(n.age)       |
+  | ------------------ |
+  | 15.716233645501712 |
+
+* stDevP()
+
+  Returns the standard deviation for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDevP(n.age)
+  ```
+
+  **Example output:**
+
+  | stDevP(n.age)      |
+  | ------------------ |
+  | 12.832251036613439 |
+
+* variance()
+
+  Returns the variance for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN variance(n.age)
+  ```
+
+  **Example output:**
+
+  | variance(n.age) |
+  | --------------- |
+  | 247             |
+
+* varianceP()
+
+  Returns the variance for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN varianceP(n.age)
+  ```
+
+  **Example output:**
+
+  | varianceP(n.age) |
+  | ---------------- |
+  | 164.66666666667  |
+
+* sum()
+
+  Returns the sum of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN sum(n.age)
+  ```
+
+  **Example output:**
+
+  | sum(n.age) |
+  | ---------- |
+  | 90         |
+
+### 3.5.List Funtions:
+
+- keys()
+
+  get the field names of some vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN keys(a)
+  ```
+
+  **Example output:**
+
+  | keys(a)               |
+  | --------------------- |
+  | ["name","age","eyes"] |
+
+- labels()/label()
+
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN labels(a)
+  ```
+
+  **Example output:**
+
+  | labels                 |
+  | ---------------------- |
+  | ["Person","Developer"] |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice'})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+### 3.6.Mathematical functions
+
+- abs()
+
+  get the absolute value of some data.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a), (e)
+  WHERE a.name = 'Alice' AND e.name = 'Eskil'
+  RETURN a.age, e.age, abs(a.age - e.age)
+  ```
+
+  **Example output:**
+
+  | a.age | e.age | abs(a.age - e.age) |
+  | ----- | ----- | ------------------ |
+  | 38    | 41    | 1                  |
+
+- ceil()
+
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+  **Example input:**
+
+  ```
+  RETURN ceil(0.1)
+  ```
+
+  **Example output:**
+
+  | ceil(0.1) |
+  | --------- |
+  | 1.0       |
+
+- floor()
+
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN floor(0.9)
+  ```
+
+  **Example output:**
+
+  | floor(0.9) |
+  | ---------- |
+  | 0.0        |
+
+- round()
+
+  Returns the value of a number rounded to the nearest integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN round(3.141592)
+  ```
+
+  **Example output:**
+
+  | round |
+  | ----- |
+  | 3     |
+
+- rand()
+
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN rand()
+  ```
+
+  **Example output:**
+
+  | rand()             |
+  | ------------------ |
+  | 0.9797131960534085 |
+
+- sign()
+
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN sign(-17), sign(0.1)
+  ```
+
+  **Example output:**
+
+  | sign(-17) | sign(0.1) |
+  | --------- | --------- |
+  | -1        | 1         |
+
+## 4.Extensions To OpenCypher
+
+- Number of Labels
+
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+
+  - OpenCypher: One node/relationship may have 0 to many labels.
+
+- Schema.
+
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.Procedures
+
+### 5.1.procedures' demos
+
+- dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                               | name            |
+  | --------------------------------------- | --------------- |
+  | db.vertexLabels() :: (label::STRING)    | db.vertexLabels |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels   |
+  | db.indexes() :: (index::LIST)           | db.indexes      |
+  | ...                                     | ...             |
+
+- db.vertexLabels()
+
+  Lists all available labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+
+  **Example output:**
+
+  | label   |
+  | ------- |
+  | genre   |
+  | keyword |
+  | movie   |
+  | ...     |
+
+- db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edgeLabels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | edgeLabel |
+  | --------- |
+  | acted_in  |
+  | directed  |
+  | ...       |
+
+- db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter     | parameter type | description                   |
+  | ------------- | -------------- | ----------------------------- |
+  | label_name    | string         | name of vertex label          |
+  | primary_field | string         | primary field of vertex label |
+  | field_spec    | list           | specification of a field      |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+  **Output:** If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added label [Person]
+  ```
+
+- db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description                   |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field             |
+  | type       | string     | type of the field             |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name         | type   | optional |
+  | ------------ | ------ | -------- |
+  | id           | INT32  | false    |
+  | born         | INT32  | true     |
+  | name         | STRING | true     |
+  | poster_image | STRING | true     |
+
+- db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | label_type | string         | either 'vertex' or 'edge'                                             |
+  | label_name | string         | name of the label                                                     |
+  | extra      | string         | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list           | specification of a field                                              |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.
+  for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+- db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:**
+
+  | field_name | field_type | description                      |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description                   |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string          | either 'vertex' or 'edge'     |
+  | label_name  | string          | name of the label             |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description               |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string         | either 'vertex' or 'edge' |
+  | label_name       | string         | name of the label         |
+  | field_value_spec | list           | specification of a field  |
+
+  in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, 'optional']`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+  | field_spec | list           | specification of a field  |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelModFields(
+  'vertex',
+  'new_label',
+  ['birth_date', 'DATETIME', '1900-01-01 00:00:00'],
+  ['gender', 'BOOL', false])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description              |
+  | ---------------- | -------------- | ------------------------ |
+  | label_name       | string         | name of the label        |
+  | edge_constraints | string         | edge constraints         |
+  | field_spec       | list           | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for optional fields.
+
+- `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32,true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+- db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+- db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+- | pair_unique  | boolean        | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+- dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description          |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string         | the current password |
+  | new_password     | string         | new password         |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string         | the user's name |
+  | new_password | string         | new password    |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.createUser(user_name, password)
+
+  create new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | ------------------------ |
+  | user_name | string         | the new user name        |
+  | password  | string         | the password of new user |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string         | the user name to be deleted |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string         | the user name               |
+  | is.admin  | boolean        | the permission of this user |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       | ...      |
+
+- dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description           |
+  | --------- | -------------- | --------------------- |
+  | user.user | string         | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+- dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+  a list of ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host         |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...          |
+
+- dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been deleted.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description                      |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string         | the name of new subgraph         |
+  | description | string         | description of new subgraph      |
+  | max_size_GB | integer        | Upper limit of subgraph capacity |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+  | config     | map            | the configuration to be modified     |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.listGraphs()
+
+  get all subgraph in this graph database .
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.config.list()
+
+  get some config of this graph database .
+
+  **Output:**
+
+  a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  | --------- | ------- |
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       | ...     |
+
+- dbms.config.update(updates)
+
+  get some config of this graph database .
+
+  **Output:**
+
+  If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+      enable_ip_check:false,
+      durable:true,
+      optimistic_txn:true,
+      enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+- dbms.takeSnapshot()
+
+  take the snapshot on this current graph database.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+- dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path                       |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+- algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                                                             |
+  | --------- | -------------- | --------------------------------------------------------------------------------------- |
+  | startNode | Node           | the source node of paths                                                                |
+  | endNode   | Node           | the destination node paths                                                              |
+  | config    | MAP            | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+  If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2         | 1         |
+
+- algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+- algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                               |
+  | --------- | -------------- | --------------------------------------------------------- |
+  | id        | ANY            | the id of vertexes or edges , the id must be variable     |
+  | config    | MAP            | the configuration of this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or it is an edge id.
+
+  **Output:**
+
+  If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.Whole List Of Procedures
+
+| Name                                  | Description                                                          | Signature                                                                                                                                                                                |
+|---------------------------------------|----------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.vertexLabels                       | list all vertex labels                                               | db.vertexLabels() :: (label::STRING)                                                                                                                                                     |
+| db.edgeLabels                         | list all edge labels                                                 | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                  |
+| db.indexes                            | list all indexes                                                     | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                     |
+| db.listLabelIndexes                   | list indexes by label                                                | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                           |
+| db.warmup                             | warm up the DB                                                       | db.warmup() :: (time_used::STRING)                                                                                                                                                       |
+| db.createVertexLabel                  | create a vertex label                                                | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                   |
+| db.createLabel                        | create a vertex/edge label                                           | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                              |
+| db.getLabelSchema                     | get the schema of label                                              | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                                |
+| db.getVertexSchema                    | get the schema of vertex label                                       | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                       |
+| db.getEdgeSchema                      | get the schema of edge label                                         | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                         |
+| db.deleteLabel                        | delete vertex/edge label                                             | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                        |
+| db.alterLabelDelFields                | delete some fields of a label on a subgraph                          | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                             |
+| db.alterLabelAddFields                | add some fields of a label on a subgraph                             | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                  |
+| db.alterLabelModFields                | modify some fields of a label on a subgraph                          | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                        |
+| db.createEdgeLabel                    | create a edge label                                                  | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                      |
+| db.addIndex                           | add an index                                                         | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                           |
+| db.addEdgeIndex                       | add an index                                                         | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                  |
+| db.deleteIndex                        | delete an index                                                      | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                        |
+| db.backup                             | backup the db                                                        | db.backup(destination::STRING) :: ()                                                                                                                                                     |
+| dbms.procedures                       | list all procedures                                                  | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                    |
+| dbms.security.changePassword          | change current user password                                         | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                  |
+| dbms.security.changeUserPassword      | change user password                                                 | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                     |
+| dbms.security.createUser              | create an account                                                    | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.deleteUser              | delete an account                                                    | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.listUsers               | list all accounts                                                    | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                          |
+| dbms.security.showCurrentUser         | get current user name                                                | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                                |
+| dbms.security.getUserPermissions      | get the permissions of a specified user                              | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                  |
+| dbms.graph.createGraph                | create a subgraph                                                    | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                        |
+| dbms.graph.modGraph                   | modify the config of a subgraph                                      | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                          |
+| dbms.graph.deleteGraph                | delete a subgraph                                                    | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                   |
+| dbms.graph.listGraphs                 | list all subgraphs                                                   | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                       |
+| dbms.graph.getGraphInfo               | get the information of a specified graph                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                     |
+| dbms.security.addAllowedHosts         | add to the trust list                                                | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                         |
+| dbms.security.deleteAllowedHosts      | remove from the trust list                                           | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                              |
+| dbms.security.listAllowedHosts        | list the trust list                                                  | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                       |
+| dbms.config.update                    | update the configuration                                             | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                    |
+| dbms.config.list                      | list the configuration                                               | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                          |
+| algo.shortestPath                     | get a shortest path between two vertexes                             | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                    |
+| algo.allShortestPaths                 | get all the shortest paths between two vertexes                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                     |
+| algo.native.extract                   | get the field values of a list of vertexes or edges specified id     | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                 |
+| db.flushDB                            | flush the db                                                         | db.flushDB() :: (::VOID)                                                                                                                                                                 |
+| dbms.security.listRoles               | list all roles                                                       | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                          |
+| dbms.security.createRole              | create a role                                                        | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                     |
+| dbms.security.deleteRole              | delete a role                                                        | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.getRoleInfo             | get the role information                                             | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                              |
+| dbms.security.disableRole             | enable/disable the role                                              | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.modRoleDesc             | modify the description of a role                                     | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.rebuildRoleAccessLevel  | rebuild the user subgraph access rights                              | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                         |
+| dbms.security.modRoleAccessLevel      | modify the user subgraph access rights                               | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                             |
+| dbms.security.modRoleFieldAccessLevel | modify the user property access rights                               | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                  |
+| dbms.security.getUserInfo             | get the user information                                             | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                              |
+| dbms.security.getUserMemoryUsage      | get the memory usage for a user                                      | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                                |
+| dbms.security.disableUser             | enable/disable the user                                              | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.setCurrentDesc          | set the current user description                                     | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                            |
+| dbms.security.setUserDesc             | set user description                                                 | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.setUserMemoryLimit      | set user memory limit                                                | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                          |
+| dbms.security.deleteUserRoles         | delete roles from the user                                           | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                      |
+| dbms.security.rebuildUserRoles        | rebuild the relationship between the user and the role               | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.addUserRoles            | add the user roles                                                   | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                         |
+| db.plugin.loadPlugin                  | load a plugin                                                        | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN, version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | unload a plugin                                                      | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                              |
+| db.plugin.listPlugin                  | list all plugins                                                     | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                           |
+| db.plugin.getPluginInfo               | get the information of a specified plugin                            | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                           |
+| db.plugin.callPlugin                  | execute the plugins                                                  | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                     |
+| db.importor.dataImportor              | import vertex/edge data                                              | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                              |
+| db.importor.schemaImportor            | import vertex/edge schema                                            | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                              |
+| dbms.meta.count                       | get the total number of vertex and edge                              | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                  |
+| dbms.meta.countDetail                 | get the number of vertex and edge for each label                     | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                        |
+| dbms.meta.refreshCount                | recount the number of vertex and edge, stop writing during the count | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                  |
+| dbms.task.listTasks                   | list running tasks                                                   | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                     |
+| dbms.task.terminateTask               | terminate task                                                       | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                       |
+| dbms.ha.clusterInfo                   | get cluster info in HA mode                                          | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                        |
+| db.dropDB                             | empty the db                                                         | db.dropDB() :: (::VOID)                                                                                                                                                                  |
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/8.query/2.gql.md
new file mode 100644
index 0000000000..ea00f3ceb1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/8.query/2.gql.md
@@ -0,0 +1,392 @@
+# ISO GQL
+
+
+## 1.Introduction to ISO GQL
+
+Graph Query Language (GQL) is an upcoming International Standard language for property graph querying. It builds on the foundations of SQL and integrates proven ideas from the existing [openCypher, PGQL, GSQL, and G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/) languages. The standard is currently in the draft stage.
+
+TuGraph has implemented GQL based on the [ISO GQL (ISO/IEC 39075) Antlr4 grammar file](https://github.com/TuGraph-family/gql-grammar). It includes some extensions and modifications. Not all GQL syntax is fully supported at the moment, but we will continue to improve and enhance it in the future.
+
+## 2.List of Clauses
+
+| Category            | Clauses        |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+
+### 2.1.MATCH
+
+The `MATCH` clause is the most basic clause in GQL, and almost all queries are expanded through `MATCH`.
+
+The `MATCH` clause is used to specify the matching pattern to search in the graph, to match vertices or paths that meet certain conditions.
+
+
+#### Vertex basics
+
+##### Get all vertices
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### Get all vertices with a label
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### Vertex matching with property
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### Vertex matching with filter
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Edge basics
+
+##### Edge pointing right
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### Edge pointing left
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### Edge matching with filter
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+return
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### Path matching
+
+##### Variable length
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+return
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+The `OPTIONAL MATCH` clause matches a graph pattern and returns `null` if there is no match.
+
+
+#### Match found
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### Match Not Found
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+return
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+The `RETURN` clause specifies the results to be returned, including vertices, edges, paths, properties, etc.
+
+#### Return vertices
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+return
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### Return edges
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+return
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### Return property
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Uncommon string used as variable name
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### Alias
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+return
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### Optional property
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### Other expressions
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+return
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### Distinct
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+return
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+The `NEXT` clause is used to connect multiple clauses.
+
+#### Connecting MATCH clauses
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE` clause is used to filter records.
+
+#### Filter vertex
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+returns
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### Filter edge
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+returns
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### Boolean expressions
+
+`AND`, `OR`, `XOR`, and `NOT` Boolean expressions can be used in the `WHERE` clause to filter data.
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+returns
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+### 2.6.ORDER BY
+
+`ORDER BY` is a clause of `RETURN` that sorts the output result.
+
+#### Sorting the Result
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+return
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP` specifies the offset of the result rows.
+
+#### Without SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### Using SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+The `LIMIT` clause is used to limit the number of rows in the result.
+
+#### Using LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/8.query/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/8.query/index.rst
new file mode 100644
index 0000000000..5e736c4232
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/8.query/index.rst
@@ -0,0 +1,9 @@
+Query
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..83ba668355
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,342 @@
+# TuGraph Stored Procedure Guide
+
+> This document mainly explains the instructions for using the TuGraph stored procedure.
+
+## 1. Introduction
+
+When the query/update logic that users need to express is more complex (such as cannot be described by Cypher or has high performance requirements), compared to calling multiple requests and completing the entire processing flow on the client, the stored procedure provided by TuGraph is a more concise and efficient choice.
+
+Similar to traditional databases, the TuGraph stored procedure runs on the server side. Users can encapsulate the processing logic (i.e., multiple operations) into a procedure call, and further improve performance by parallel processing (such as using relevant C++ OLAP interfaces and built-in algorithms) during implementation.
+
+There is a special type of API in the stored procedure for parallel data operations, which we call the Traversal API. Please refer to the [documentation](2.traversal.md) for more information.
+
+## 2. Stored Procedure Version
+
+Currently, TuGraph supports two versions of stored procedures, which are suitable for different scenarios. Version 3.5 only supports v1, which can be directly called through the REST or RPC interface. Starting from version 3.5, v2 is supported, which allows embedding calls in graph query languages ​​(such as Cypher). We call it POG (Procedure On Graph query language, APOC).
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+|Applicable Scenarios	|Extreme performance or complex multi-transaction management scenarios	|General scenarios, highly integrated with Cypher|
+|Transaction	|Created internally in the function, multiple transactions |can be freely controlled	Passed into the external function, single transaction|
+|Signature (parameter definition)	|Not required	|Required|
+|Input and output parameter types	|Not required to specify	|Need to specify parameter types|
+|Cypher Standalone Call	|Supported	|Supported
+|Cypher Embeded Call	|Not supported	|Supported|
+|Language	|C++/Python/Rust	|C++|
+|Calling mode	|Directly pass the string, usually in JSON format	|Through variables in Cypher statements|
+
+
+In TuGraph, stored procedures v1 and v2 are managed separately, and support for create, delete, and query operations is provided. However, it is still not recommended to have the same name for multiple stored procedures.
+
+## 3. Supported Languages
+
+In TuGraph, users can dynamically load, update, and delete stored procedures. TuGraph supports the use of C++, Python, and Rust languages to write stored procedures. Among them, C++ language has the most complete support and the best performance.
+
+Note that the stored procedure is the logic compiled and executed on the server side, which is independent of the language support on the client side.
+
+## 4. Procedure v1 Interface
+
+## 4.1.Write stored procedures
+### 4.1.1.Write C++ stored procedure
+
+Users can write C stored procedures by using core API or Traversal API. An example of a simple C stored procedure is as follows:
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## Count all students whose age is 10
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+From the code, we can see the entry of a TuGraph C++ stored procedure is the `Process` function, with three parameters:
+
+- `db`: the TuGraph database instance
+- `request`: the input data, which can be a binary byte array, or any other format such as JSON string.
+- `response`: the output data, which can be a string or directly return binary data.
+
+The return value of the `Process` function is a boolean value. When it returns `true`, it means that the request is successfully completed, otherwise it means that the stored procedure found an error during execution, and the user can return an error message through `response` to facilitate debugging.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which is `age_10` in the above example. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, age_10.so will be generated, which can then be loaded into the server by the user.
+
+### 4.1.2 Writing Python stored procedures
+
+The following snippet does the same thing as the above C++ stored procedure, but via TuGraph Python API:
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+The Python stored procedure returns a tuple, the first element of which is a Boolean value indicating whether the stored procedure was successfully executed; the second element is a `str`, which contains the result to be returned.
+
+Python stored procedures do not need to be compiled and can be loaded directly.
+
+## 4.2.How to use stored procedures
+
+### 4.2.1.Install Stored Procedures
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `age_10.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+                  headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `age_10.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+### 4.2.2.List Stored Procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.Retrieve Stored Procedures Detail
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.Uninstall Stored Procedures
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+### 4.2.6.Upgrade Stored Procedures
+
+You can upgrade a stored procedure with the following two steps:
+
+1. Uninstall the existing one.
+2. Install the new on.
+
+TuGraph carefully manages the concurrency of stored procedure operations. Upgrading stored procedures will not affect concurrent runs of existing ones.
+
+## 5. Procedure v2 Interface
+
+### 5.1.Writing stored procedures
+
+Users can write C++ stored procedures by using lgraph API. A simple C++ stored procedure example is as follows:
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+From the code we can see:
+- The stored procedure defines a method `GetSignature` to get the signature. This method returns the signature of the stored procedure, which includes input parameter names and their types, and return parameters and their types. This enables the Cypher query statement to use the signature information to verify whether the input data and the returned data are reasonable when calling the stored procedure.
+- The entry function is the `ProcessInTxn` function, which has three parameters, which are:
+
+- `txn`: The transaction of the stored procedure, generally speaking, the transaction of the Cypher statement that calls the stored procedure.
+- `request`: input data, its content is the string of the input parameter type defined in `GetSignature` and the value passed in the Cypher query statement after json serialization. e.g. `{num_iteration: 10}`
+- `response`: output data, in order to ensure compatibility in the Cypher language, users can write the data processed by the stored procedure to `lgraph_api::Result`, and finally use `lgraph_api::Result::Dump` to serialize it into data in json format.
+
+The return value of the `ProcessInTxn` function is a boolean value. When it returns `true`, it means that the request was successfully completed, otherwise it means that the stored procedure found an error during execution.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which in the above example is `custom_pagerank`. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, custom_pagerank.so will be generated, which can then be loaded into the server by the user.
+
+### 5.2.Load stored procedure
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `custom_pagerank.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `custom_pagerank.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+#### 5.2.1.List loaded stored procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.Get stored procedure details
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.Delete stored procedure
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+#### 5.2.5.Update stored procedure
+
+Updating a stored procedure requires the following two steps:
+
+1. Delete the existing stored procedure
+2. Install the new stored procedure
+
+TuGraph carefully manages the concurrency of stored procedure operations, and updating stored procedures will not affect the operation of existing stored procedures.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..e4abd3a263
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,125 @@
+# Traversal API
+
+> This document mainly explains the Traversal API in the stored procedure of TuGraph.
+
+1. Introduction
+The powerful online analytical processing (OLAP) capability of TuGraph is an important feature that sets it apart from other graph databases. With the help of the C++ OLAP API (olap_on_db.h), users can quickly export a subgraph that needs to be analyzed, and then run iterative graph computing processes such as PageRank, connected components, and community detection on it, and then make corresponding decisions based on the results. The export and computation processes can be accelerated through parallel processing, achieving almost real-time analysis and processing, and avoiding the lengthy steps of traditional solutions that require exporting, transforming, and reimporting (ETL) data into dedicated analytical systems for offline processing.
+
+TuGraph has built-in many commonly used graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement specific graph computing processes themselves. They just need to include the header files (.h files) of the corresponding algorithm library in their own programs when implementing their own storage procedures, and link the corresponding dynamic library files (.so) during compilation. In general, the only process that users need to implement themselves is the extraction of the subgraph to be analyzed.
+
+Currently, the Traversal API only supports C++.
+
+## 2. Interface
+
+### 2.1. Snapshot
+
+The Snapshot template class in C++ OLAP API is used to represent extracted static subgraphs. The EdgeData is used to represent the data type of the weight used for each edge in the subgraph. If the edges do not require weights, Empty is used as the EdgeData.
+
+The extracted subgraph can be described using the constructor of the Snapshot class.
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+In the above text, "db" represents the database handle, "txn" represents the transaction handle, and "flags" represents the options used during generation, with the optional values including the following combinations: SNAPSHOT_PARALLEL indicates that multiple threads are used for parallel extraction during export; SNAPSHOT_UNDIRECTED indicates that the exported graph needs to be transformed into an undirected graph.
+
+"vertex_filter" is a user-defined filtering function for vertices, where a return value of true indicates that the vertex needs to be included in the extracted subgraph, and vice versa.
+
+"out_edge_filter" is a user-defined filtering function for edges, where a return value of true indicates that the edge needs to be included in the extracted subgraph, and vice versa.
+
+When the filtering functions are set to default values, it means that all vertices/edges should be included.
+
+For other methods provided by the Snapshot class, please refer to the detailed C++ API documentation (olap_on_db.h).
+
+### 2.2. Traversal
+
+A common type of analysis in graph databases is to start from one or more vertices and iteratively expand and access their neighbors. Although this type of analysis can be done using Cypher, its performance is limited by the serial interpretation and execution when the depth of traversal is large. Writing stored procedures using the C++ Core API eliminates the overhead of interpretation but is still limited by the processing power of a single thread.
+
+In order to enable users to accelerate these types of analysis tasks through parallel processing, we have wrapped a Traversal framework based on the C++ OLAP API. Users can directly use the FrontierTraversal and PathTraversal classes in this framework to perform iterative traversal analysis tasks. For specific usage instructions, please refer to the corresponding C++ API documentation (lgraph_traversal.h).
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+This method can be used to find all vertices that satisfy a certain condition (when the filter returns true). When the "parallel" parameter is set to true, the search process will be executed in parallel.
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+This method can be used to extract (VertexData type) properties from a specified set of vertices (frontier) using the extract method. When the "parallel" parameter is set to true, the extraction process will be executed in parallel.
+
+FrontierTraversal is suitable for cases where only the traversed set of vertices is of interest. When a user needs to access information along the path (vertices/edges along the path) in the traversal process or result, PathTraversal needs to be used. Both types of traversal have four parameters in their constructor, namely the database handle db, transaction handle txn, options flags and capacity. The available options include the following combinations: TRAVERSAL_PARALLEL indicates that multiple threads are used for parallel traversal; TRAVERSAL_ALLOW_REVISITS indicates that vertices can be visited repeatedly during traversal (PathTraversal implicitly includes this option).
+capacity indicates the capacity of the path collection during initialization.
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+Both types of traversal have three ways to set the starting vertex/vertex set for traversal. The first two methods directly specify the vertex ID, while the last method is similar to FindVertices.
+
+Both types of traversal start from the set of vertices in the current layer. They use the extension function to access each outgoing edge/incoming edge/outgoing and incoming edges, and use a user-defined filter function to determine if the extension is successful. If successful, the neighboring vertex/appended path with the edge is added to the set of vertices/paths in the next layer.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+The above describes the three traversal methods of FrontierTraversal. It starts from the current set of vertices and, for each vertex in the set, iterates through each outgoing edge/incoming edge/outgoing and incoming edges. If the edge or neighbor vertex satisfies the user-defined filter conditions (where edge_filter is the filter function for edges and neighbour_filter is the filter function for neighbor vertices), the neighbor vertex is added to the new set of vertices.
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+After the expansion of the current set of vertices is finished, the new set of vertices can be obtained using the above method.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+The three traversal methods of PathTraversal are similar to FrontierTraversal, except that the user-defined filter function adds two additional parameters: Path, which contains the path before the new edge is expanded, and IteratorHelper, which can be used to convert the vertices/edges in the path to corresponding iterators in the database. The relevant documentation can be found in the corresponding C++ API documentation.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.md
new file mode 100644
index 0000000000..5579a0c754
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.md
@@ -0,0 +1,11605 @@
+
+
+             
+  <section id="c-stored-procedures">
+
+<div class="toctree-wrapper compound">
+</div>
+<section id="base64-encode">
+<h2>base64_encode<a class="headerlink" href="#base64-encode" title="Permalink to this headline"></a></h2>
+<p>Base64 encode and decode. Simple implementation, to be used with BLOB fields. If performance is important, look for an optimized implementation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_api">
+<span id="_CPPv310lgraph_api"></span><span id="_CPPv210lgraph_api"></span><span id="lgraph_api"></span><span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><a class="headerlink" href="#_CPPv410lgraph_api" title="Permalink to this definition"></a><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base64E">
+<span id="_CPPv3N10lgraph_api6base64E"></span><span id="_CPPv2N10lgraph_api6base64E"></span><span id="lgraph_api::base64"></span><span class="target" id="namespacelgraph__api_1_1base64"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6base64E" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="lgraph_api::base64::Encode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1a18e9a89247359b1a4abc31183a17f8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to encode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The encoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="lgraph_api::base64::Encode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1c276e294945b5f438b8ea942692e730"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__cCP.s.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac29334d4c57dcc18603ff6ad813e6cb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ret</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string. </p></li>
+<li><p><strong>ret</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__ssCR.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a970296461b9202f8fb91e56590fb160b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">out</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string to decode. </p></li>
+<li><p><strong>out</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="lgraph_api::base64::Decode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac2d795c4f1fcd79f41e3bb8591c03c81"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="lgraph_api::base64::Decode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ab07cfe3bb273d86861a477a435a7686a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph">
+<h2>lgraph<a class="headerlink" href="#lgraph" title="Permalink to this headline"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.LGAPI">
+<span class="target" id="lgraph_8h_1ad89ce29b199ac3372f644ffc910a466a"></span><span class="sig-name descname"><span class="n"><span class="pre">LGAPI</span></span></span><a class="headerlink" href="#c.LGAPI" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12GetSignatureE">
+<span id="_CPPv3N10lgraph_api12GetSignatureE"></span><span id="_CPPv2N10lgraph_api12GetSignatureE"></span><span id="lgraph_api::GetSignature"></span><span class="target" id="namespacelgraph__api_1a0e7238ee4b0e28208b594b2bc334b031"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSignature</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7SigSpecE" title="lgraph_api::SigSpec"><span class="n"><span class="pre">SigSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sig_spec</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12GetSignatureE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7ProcessE">
+<span id="_CPPv3N10lgraph_api7ProcessE"></span><span id="_CPPv2N10lgraph_api7ProcessE"></span><span id="lgraph_api::Process"></span><span class="target" id="namespacelgraph__api_1abc0e7fd5062a22bca6290439450eb245"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Process</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7ProcessE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12ProcessInTxnE">
+<span id="_CPPv3N10lgraph_api12ProcessInTxnE"></span><span id="_CPPv2N10lgraph_api12ProcessInTxnE"></span><span id="lgraph_api::ProcessInTxn"></span><span class="target" id="namespacelgraph__api_1afb8681ba4f3cc04bdc96b9b8ccc17775"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessInTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6ResultE" title="lgraph_api::Result"><span class="n"><span class="pre">Result</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12ProcessInTxnE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-atomic">
+<h2>lgraph_atomic<a class="headerlink" href="#lgraph-atomic" title="Permalink to this headline"></a></h2>
+<p>Implementation of atomic operations, used in lgraph_traversal. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api3casEbP1T1T1T">
+<span id="_CPPv3I0EN10lgraph_api3casEP1T1T1T"></span><span id="_CPPv2I0EN10lgraph_api3casEP1T1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab1806f690b319d23b933206cd295f745"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cas</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">ptr</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">oldv</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">newv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_minEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_minEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_minEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1acd8330b393c3cb2b46c461119f4aa484"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_min</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_maxEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_maxEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_maxEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a451eee503d74e69ad9fc6db943ee446f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_max</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_addEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_addEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_addEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab5f65d4fa238b2bc6675bba789e5d635"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_add__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a17b724a3f516c98594033b9cbf7e2dd6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_add__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1ae1334e7bca1be121f4a9099ee1499872"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="lgraph_api::write_add__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1ab7aec34df35e5fe40f87f17cd8384759"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="lgraph_api::write_add__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a4688a3165d87b264a0f0e0d747add460"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_subEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_subEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_subEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a34d077b3ffee356fb73bdc35a7cb8819"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_sub__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a3e0a202ef30dd1729c3671b217c7a0b3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_sub__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1aa321f049db89fbc2c821e62ede09b00e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="lgraph_api::write_sub__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1adc6709b36af7ba0701e624044f2cf9d0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="lgraph_api::write_sub__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a15cf35d73dc33e1a0fad97647beaca63"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-date-time">
+<h2>lgraph_date_time<a class="headerlink" href="#lgraph-date-time" title="Permalink to this headline"></a></h2>
+<p>Implemnets the DateTime, Date and TimeZone classes. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="lgraph_api::MinDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a7d4a5022a392e2f121804ec89c1f4819"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="lgraph_api::MaxDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a57143a0e3c25aaa249ec45411aeed284"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Maximum days since epoch for date. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MinMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ace6f22166909871827c64134bc108c4f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MaxMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ae9241a416800bd43775b274c3d68b24a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Maximum microseconds since epoch for date time. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api4DateE"></span><span id="lgraph_api::Date"></span><span class="target" id="classlgraph__api_1_1Date"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4DateE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> class. Range of dates is from 0/1/1 to 12/31/9999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateEv">
+<span id="_CPPv3N10lgraph_api4Date4DateEv"></span><span id="_CPPv2N10lgraph_api4Date4DateEv"></span><span id="lgraph_api::Date::Date"></span><span class="target" id="classlgraph__api_1_1Date_1aff49fc2cda4491ff4457ca481bb8edf9"></span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with the date set to 1970/1/1. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::Date::Date__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1Date_1a1d304cb3d2f5bedd0a4585c4a1e6af70"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified time. The time point must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>tp</strong> – Time point to set the date to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay">
+<span id="_CPPv3N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="_CPPv2N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="lgraph_api::Date::Date__YearMonthDayCR"></span><span class="target" id="classlgraph__api_1_1Date_1ac753f0ab0017908da2e04a5601fbbb02"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymd</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified date. The date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>ymd</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateE7int32_t">
+<span id="_CPPv3N10lgraph_api4Date4DateE7int32_t"></span><span id="_CPPv2N10lgraph_api4Date4DateE7int32_t"></span><span id="lgraph_api::Date::Date__int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1afb34a93316bafa170db694675f3ba391"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateE7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to an offset from epoch, i.e. the date is set to the specified number of days from epoch. The result date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days_since_epoch</strong> – Number of days since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="lgraph_api::Date::Date__ssCR"></span><span class="target" id="classlgraph__api_1_1Date_1aa34be0efffbb041680f06e2e51226b64"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from a YYYY-MM-DD string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if the string is not in the correct format.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>str</strong> – The string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv">
+<span id="_CPPv3NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="_CPPv2NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="lgraph_api::Date::GetYearMonthDayC"></span><span class="target" id="classlgraph__api_1_1Date_1ab2d9b29e32b6adb74401c6d85fd5ffb0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYearMonthDay</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The year month day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateplEi">
+<span id="_CPPv3NK10lgraph_api4DateplEi"></span><span id="_CPPv2NK10lgraph_api4DateplEi"></span><span id="lgraph_api::Date::add-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1ad3fe85f66511da6deb3ca8d54edf51bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateplEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a number of days to the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatepLEi">
+<span id="_CPPv3N10lgraph_api4DatepLEi"></span><span id="_CPPv2N10lgraph_api4DatepLEi"></span><span id="lgraph_api::Date::add-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1a3b36b3e6261a05420139a4eba5eea5dd"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatepLEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a number of days to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Reference to the current date. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DatemiEi">
+<span id="_CPPv3NK10lgraph_api4DatemiEi"></span><span id="_CPPv2NK10lgraph_api4DatemiEi"></span><span id="lgraph_api::Date::sub-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1a54622b3edddecff4df3c9f572a7cdcc5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DatemiEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of days from the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatemIEi">
+<span id="_CPPv3N10lgraph_api4DatemIEi"></span><span id="_CPPv2N10lgraph_api4DatemIEi"></span><span id="lgraph_api::Date::sub-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1aaa15a5d3c4427b09ebb8e2bba5de64b5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatemIEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of days from the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Reference to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateltERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateltERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateltERK4Date"></span><span id="lgraph_api::Date::lt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abf811a8c8e2765b24426cc2ff6fe13f9"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateltERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateleERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateleERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateleERK4Date"></span><span id="lgraph_api::Date::lte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1a3c9beee445a203e18d4a9145132f7b2f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateleERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategtERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategtERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategtERK4Date"></span><span id="lgraph_api::Date::gt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1af35d39c86aa4c554db7e553b09708907"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategtERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategeERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategeERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategeERK4Date"></span><span id="lgraph_api::Date::gte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abd180b0c29b2c846b8d58e2b4c9e822a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategeERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateeqERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateeqERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateeqERK4Date"></span><span id="lgraph_api::Date::eq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1ac8e2b0b0dfb86a868f9d602643a58dae"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateeqERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateneERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateneERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateneERK4Date"></span><span id="lgraph_api::Date::neq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1aec998ec2d30eb9705f995cf55907dae4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateneERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="lgraph_api::Date::DaysSinceEpochC"></span><span class="target" id="classlgraph__api_1_1Date_1aba5994b68821ee6127c84c8134823f8a"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DaysSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api4Date10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api4Date10GetStorageEv"></span><span id="lgraph_api::Date::GetStorageC"></span><span class="target" id="classlgraph__api_1_1Date_1ad8100ffff03d1b59ec5eae1e166b7979"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date10GetStorageEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv7int32_tEv">
+<span id="_CPPv3NK10lgraph_api4Datecv7int32_tEv"></span><span id="_CPPv2NK10lgraph_api4Datecv7int32_tEv"></span><span id="lgraph_api::Date::castto-int32_t-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1acdefe8b0c57d12e7de99a1f168a4f60e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv7int32_tEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date9TimePointEv">
+<span id="_CPPv3NK10lgraph_api4Date9TimePointEv"></span><span id="_CPPv2NK10lgraph_api4Date9TimePointEv"></span><span id="lgraph_api::Date::TimePointC"></span><span class="target" id="classlgraph__api_1_1Date_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date9TimePointEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the timepoint corresponding to this date at 00:00 am. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date8ToStringEv">
+<span id="_CPPv3NK10lgraph_api4Date8ToStringEv"></span><span id="_CPPv2NK10lgraph_api4Date8ToStringEv"></span><span id="lgraph_api::Date::ToStringC"></span><span class="target" id="classlgraph__api_1_1Date_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the string representation of the date in the format of YYYY-MM-DD. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv8DateTimeEv">
+<span id="_CPPv3NK10lgraph_api4Datecv8DateTimeEv"></span><span id="_CPPv2NK10lgraph_api4Datecv8DateTimeEv"></span><span id="lgraph_api::Date::castto-DateTime-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1af6857cebc4d28eb784e6bdbac1fe0ba9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv8DateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object corresponding to 00:00 am on this date. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="lgraph_api::Date::Parse__ssCR.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1aad607a219665901350781e377d7b82ee"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="lgraph_api::Date::Parse__cCP.cCP.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1a7c3a61e8da1dbf48e1b7f2b65550d815"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The result.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 10), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date3NowEv">
+<span id="_CPPv3N10lgraph_api4Date3NowEv"></span><span id="_CPPv2N10lgraph_api4Date3NowEv"></span><span id="lgraph_api::Date::Now"></span><span class="target" id="classlgraph__api_1_1Date_1a3e7d4298fa0246f18cb55d621635b2bc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date3NowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date8LocalNowEv">
+<span id="_CPPv3N10lgraph_api4Date8LocalNowEv"></span><span id="_CPPv2N10lgraph_api4Date8LocalNowEv"></span><span id="lgraph_api::Date::LocalNow"></span><span class="target" id="classlgraph__api_1_1Date_1aac31515c859f4e327724992a762ca42f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date8LocalNowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date17days_since_epoch_E">
+<span id="_CPPv3N10lgraph_api4Date17days_since_epoch_E"></span><span id="_CPPv2N10lgraph_api4Date17days_since_epoch_E"></span><span id="lgraph_api::Date::days_since_epoch___int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1ac7f1cae7e807741a698b319ead8869cc"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">days_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date17days_since_epoch_E" title="Permalink to this definition"></a><br></dt>
+<dd><p>The days since epoch. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDayE"></span><span id="lgraph_api::Date::YearMonthDay"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YearMonthDay</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Structure representing a date in the format of year, month and day. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay4yearE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="lgraph_api::Date::YearMonthDay::year__i"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay4yearE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The year, 0-9999. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay5monthE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="lgraph_api::Date::YearMonthDay::month__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay5monthE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Month, 1-12. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay3dayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="lgraph_api::Date::YearMonthDay::day__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay3dayE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Day, 1-31. </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api8DateTimeE"></span><span id="lgraph_api::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimeE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> class that holds <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the range of 0000-01-01 00:00:00.000000 to 9999-12-31 23:59:59.999999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeEv">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeEv"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeEv"></span><span id="lgraph_api::DateTime::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime_1a3e93cd7baeb8b4448482a450df21ab20"></span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the epoch time, i.e., 1970-1-1 00:00:00. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::DateTime::DateTime__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1acf8d529b725b6346cad668a4b7d6f5cf"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified timepoint. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>tp</strong> – Timepoint to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="lgraph_api::DateTime::DateTime__YMDHMSFCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a58680ad139b71f8686734b52e6a4d545"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymdhmsf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in <a class="reference internal" href="#structlgraph__api_1_1DateTime_1_1YMDHMSF"><span class="std std-ref">YMDHMSF</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>ymdhmsf</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and time to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="lgraph_api::DateTime::DateTime__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae5e26b24f48dd42cffd98d526bd74aab"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">microseconds_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to specified number of microseconds since epoch. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>microseconds_since_epoch</strong> – Number of microseconds since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="lgraph_api::DateTime::DateTime__ssCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae891fafda07463e06dbee5b88203da54"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in the form of YYYY-MM-DD HH:MM:SS[.FFFFFF]. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if str has invalid format.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>str</strong> – String representation of the date and time in the form of YYYY-MM-DD HH:MM:SS. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="lgraph_api::DateTime::GetYMDHMSFC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5027ca2fdaa6be6b27f7d4acb2bfabf7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYMDHMSF</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the form of year, month, day, hour, minute, second, fraction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The ymdhmsf. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeplE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimeplE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimeplE7int64_t"></span><span id="lgraph_api::DateTime::add-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5da5a7459ddc40a149081b898ea98951"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeplE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a number of microseconds to the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of micorseconds to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimepLE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimepLE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimepLE7int64_t"></span><span id="lgraph_api::DateTime::add-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5bdd35f5b63bc64bb6af19e96fa9e803"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimepLE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a number of microseconds to the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimemiE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimemiE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimemiE7int64_t"></span><span id="lgraph_api::DateTime::sub-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1afcd73eec42253057720a4a0d140e5eee"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimemiE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimemIE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimemIE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimemIE7int64_t"></span><span id="lgraph_api::DateTime::sub-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5a80be41155d8105875e8a3eb51c2c7b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimemIE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeltERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="lgraph_api::DateTime::lt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a16dffc2ee84f6e10fd3271e9b0cb5306"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeltERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeleERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="lgraph_api::DateTime::lte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a40adc1eacbf9ed88ac1cc35dc3d51f30"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeleERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegtERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="lgraph_api::DateTime::gt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae96fabdd15f3dfd300e7d399b12305bc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegtERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegeERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="lgraph_api::DateTime::gte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1adc2ea02a36b0f48b50f6e863facd20e6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegeERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="lgraph_api::DateTime::eq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a30d73527665a6b136070874aeb9b4c2e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeneERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="lgraph_api::DateTime::neq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac9b0839d6be50242b118d69b0ead3e24"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeneERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="lgraph_api::DateTime::MicroSecondsSinceEpochC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7576b1eff7b32d33fef2cfc541c0d7ae"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MicroSecondsSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetStorageEv"></span><span id="lgraph_api::DateTime::GetStorageC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a92a5a81985fd01aa29a8923985ee350a"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetStorageEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv7int64_tEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="lgraph_api::DateTime::castto-int64_t-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a9223b52f5d6412f67b24aaa89c360d7c"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv7int64_tEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime9TimePointEv">
+<span id="_CPPv3NK10lgraph_api8DateTime9TimePointEv"></span><span id="_CPPv2NK10lgraph_api8DateTime9TimePointEv"></span><span id="lgraph_api::DateTime::TimePointC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime9TimePointEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the timepoint correponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime8ToStringEv">
+<span id="_CPPv3NK10lgraph_api8DateTime8ToStringEv"></span><span id="_CPPv2NK10lgraph_api8DateTime8ToStringEv"></span><span id="lgraph_api::DateTime::ToStringC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of the date and time in the form of YYYY-MM-DD HH:MM:SS.[ffffff]. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv4DateEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv4DateEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv4DateEv"></span><span id="lgraph_api::DateTime::castto-Date-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a8049aeab68ea779547e65cd4b2058bd1"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv4DateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv">
+<span id="_CPPv3N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="_CPPv2N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="lgraph_api::DateTime::ConvertToUTC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a56e9bf4e6d3c6e9610e1f572f112d13c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToUTC</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the UTC time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a local time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Object converted to an UTC.</p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv">
+<span id="_CPPv3N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="_CPPv2N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="lgraph_api::DateTime::ConvertToLocal"></span><span class="target" id="classlgraph__api_1_1DateTime_1ad05a5ca52a97c6a3c4e4c62bbcdd0ff9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToLocal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the local time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Object converted to a local.</p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="lgraph_api::DateTime::Parse__ssCR.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a53252357cbc4cfe0040f4b0c31a6ca93"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="lgraph_api::DateTime::Parse__cCP.cCP.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7f3b51df42213d000e5cf8499fc9583f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[inout]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 19 or 26), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime3NowEv">
+<span id="_CPPv3N10lgraph_api8DateTime3NowEv"></span><span id="_CPPv2N10lgraph_api8DateTime3NowEv"></span><span id="lgraph_api::DateTime::Now"></span><span class="target" id="classlgraph__api_1_1DateTime_1afdf6bfab9c1625bea9fe0d88052eb9be"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime3NowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8LocalNowEv">
+<span id="_CPPv3N10lgraph_api8DateTime8LocalNowEv"></span><span id="_CPPv2N10lgraph_api8DateTime8LocalNowEv"></span><span id="lgraph_api::DateTime::LocalNow"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac419c09087e3dfbeb9b13a52cf5ca63b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8LocalNowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E">
+<span id="_CPPv3N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="_CPPv2N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="lgraph_api::DateTime::microseconds_since_epoch___int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a35d4677c58d7dc9be8f6566632ef33ea"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">microseconds_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSFE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSFE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSFE"></span><span id="lgraph_api::DateTime::YMDHMSF"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YMDHMSF</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Representation of a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in year, month, day, hour, minute, second, fraction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="lgraph_api::DateTime::YMDHMSF::year__i"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The year, 0-9999. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="lgraph_api::DateTime::YMDHMSF::month__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The month, 1-12. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="lgraph_api::DateTime::YMDHMSF::day__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The day, 1-31. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="lgraph_api::DateTime::YMDHMSF::hour__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a7f39b6fc12f0b04a38625ff3040dd30c"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">hour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The hour, 0-23. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="lgraph_api::DateTime::YMDHMSF::minute__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a408e3d60d59afc5b5a6f35ac9f5c8fbb"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">minute</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The minute, 0-59. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="lgraph_api::DateTime::YMDHMSF::second__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1af7633c5cbb76481bafd5e3e1ec07ca37"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">second</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The second, 0-59. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="lgraph_api::DateTime::YMDHMSF::fraction__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a4a3d5aea78d5e1e01c7be45e6990456f"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fraction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The fraction 000000-999999. </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZoneE">
+<span id="_CPPv3N10lgraph_api8TimeZoneE"></span><span id="_CPPv2N10lgraph_api8TimeZoneE"></span><span id="lgraph_api::TimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZoneE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>A class that represents a time zone. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone8TimeZoneEi">
+<span id="_CPPv3N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="_CPPv2N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="lgraph_api::TimeZone::TimeZone__i"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a4cbdd9521cf61ed9457984aeff9c4e13"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">time_diff_hours</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone8TimeZoneEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Create a timezone which has time difference with UTC in hours time_diff_hours. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidParameter</span></span></span> – Thrown if time_diff_hours is invalid.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>time_diff_hours</strong> – (Optional) Difference between local timezone and UTC. Must be &gt; =-10 &amp;&amp; &lt;=14. Otherwise the function will throw. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::FromUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae70105315a4e43ef16dcc94d07a69769"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FromUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from UTC time to this time zone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC time.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::ToUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1aa0d29ab9305bb5efa5bd1cdc48647086"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from this timezone to UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="lgraph_api::TimeZone::UTCDiffSecondsC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a9aaed281da56442099de67e51fe47638"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffSeconds</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns diff from UTC in seconds, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of seconds local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="lgraph_api::TimeZone::UTCDiffHoursC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a56914c89b37c60dcfc9db708d3a89446"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffHours</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns diff from UTC in hours, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of hours local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::LocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A const reference to local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::UpdateLocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae9cf01b0a4d1e6cfc21306569d8260f0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpdateLocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Update local timezone, used only when daylight saving time changes. Daylight saving time may change after LocalTZ was initialized, in which case we need to update it. This function will update all references returned by <a class="reference internal" href="#classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"><span class="std std-ref">LocalTimeZone()</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E">
+<span id="_CPPv3N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="_CPPv2N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="lgraph_api::TimeZone::time_diff_microseconds___int64_t"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a32810c21702584e4d3090242818cbb06"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">time_diff_microseconds_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="lgraph_api::TimeZone::GetLocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a27c488e750c5dc4247d99d4db241b0bf"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone7LocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone7LocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone7LocalTZEv"></span><span id="lgraph_api::TimeZone::LocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a8aa7218fc3680021035c689a23159760"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone7LocalTZEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-db">
+<h2>lgraph_db<a class="headerlink" href="#lgraph-db" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46lgraph">
+<span id="_CPPv36lgraph"></span><span id="_CPPv26lgraph"></span><span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><a class="headerlink" href="#_CPPv46lgraph" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskEv"></span><span id="lgraph_api::ShouldKillThisTask"></span><span class="target" id="namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Determine if we should kill current task. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if a KillTask command was issued for this task, either due to user request or timeout. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16GetThreadContextEv">
+<span id="_CPPv3N10lgraph_api16GetThreadContextEv"></span><span id="_CPPv2N10lgraph_api16GetThreadContextEv"></span><span id="lgraph_api::GetThreadContext"></span><span class="target" id="namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"></span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetThreadContext</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api16GetThreadContextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets thread context pointer, which can then be used in ShouldKillThisTask(ctx). Calling <a class="reference internal" href="#namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"><span class="std std-ref">ShouldKillThisTask()</span></a> is equivalent to ShouldKillThisTask(GetThreadContext()). In order to save the cost of <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>, you can store the context and use it in ShouldKillThisTask(ctx). </p>
+<p>Example: ```c++ ThreadContextPtr ctx = <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>; while (HasMoreWorkToDo()) { if (ShouldKillThisTask(ctx)) { break; } DoWork(); } ```</p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The thread context. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="lgraph_api::ShouldKillThisTask__ThreadContextPtr"></span><span class="target" id="namespacelgraph__api_1a842a962cb406dd251be8aeb492510b6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ctx</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr" title="Permalink to this definition"></a><br></dt>
+<dd><p>Determine if we should kill the task currently running in the thread identified by ctx. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>ctx</strong> – The context, as obtained with GetThreadContext.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if a KillTask command was issued for this task. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1a340bf8a3bf351920b9c20fe861372bcf"></span><span class="sig-name descname"><span class="pre">const</span> <span class="pre">typedef</span> <span class="pre">void</span> <span class="pre">*</span> <span class="pre">ThreadContextPtr</span></span></dt>
+<dd><p>Defines an alias representing the thread context pointer. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBE">
+<span id="_CPPv3N10lgraph_api7GraphDBE"></span><span id="_CPPv2N10lgraph_api7GraphDBE"></span><span id="lgraph_api::GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_db.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> represents a graph instance. In TuGraph, each graph instance has its own schema and access control settings. Accessing a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> without appropriate access rights yields WriteNotAllowed. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> becomes invalid if <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a> is called, in which case all transactions and iterators associated with that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> become invalid. Further operation on that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> yields InvalidGraphDB. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="lgraph_api::GraphDB::GraphDB__lgraph::AccessControlledDBP.b.b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8ed8306aab2d4ea17475888d25737f69"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db_with_access_control</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">owns_db</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb" title="Permalink to this definition"></a><br></dt>
+<dd><p>For internal use only. Users should use <a class="reference internal" href="#classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"><span class="std std-ref">Galaxy::OpenGraph()</span></a> to get <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5884af0fb5900e58a13e6cf2c64e9061"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a43a244ebb2089430b84e50667e89d015"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBD0Ev">
+<span id="_CPPv3N10lgraph_api7GraphDBD0Ev"></span><span id="_CPPv2N10lgraph_api7GraphDBD0Ev"></span><span id="lgraph_api::GraphDB::~GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad0d3a9bb78624594d45104c0ec3566d2"></span><span class="sig-name descname"><span class="n"><span class="pre">~GraphDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5CloseEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5CloseEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5CloseEv"></span><span id="lgraph_api::GraphDB::Close"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Close the graph. This will close the graph and release all transactions, iterators associated with the graph. After calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a>, the graph becomes invalid, and cannot be used anymore. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="lgraph_api::GraphDB::CreateReadTxn"></span><span class="target" id="classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateReadTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Creates a read transaction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The new read transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb">
+<span id="_CPPv3N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="_CPPv2N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="lgraph_api::GraphDB::CreateWriteTxn__b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateWriteTxn</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">optimistic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Creates a write transaction. Write operations can only be performed in write transactions, otherwise exceptions will be thrown. A write transaction can be optimistic. Optimistic transactions can run in parallel and any conflict will be detected during commit. If a transaction conflicts with an ealier one, a TxnConflict will be thrown during commit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>optimistic</strong> – (Optional) True to create an optimistic transaction.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The new write transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction">
+<span id="_CPPv3N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="_CPPv2N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="lgraph_api::GraphDB::ForkTxn__TransactionR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForkTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd><p>Forks a read transaction. The resulting read transaction will share the same view as the forked one, meaning that when reads are performed on the same vertex/edge, the results will always be identical, whether they are performed in the original transaction or the forked one. Only read transactions can be forked. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"><span class="std std-ref">ForkTxn()</span></a> on a write txn causes an InvalidFork to be thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidFork</span></span></span> – Thrown when txn is a write transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>txn</strong> – <strong>[in]</strong> The read transaction to be forked.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A new read <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> that shares the same view with txn. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5FlushEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5FlushEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5FlushEv"></span><span id="lgraph_api::GraphDB::Flush"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Flush</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5FlushEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Flushes buffered data to disk. If there have been some async transactions, there could be data that are written to this graph, but not persisted to disk yet. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"><span class="std std-ref">Flush()</span></a> will persist the data and prevent data loss in case of system crash. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB11DropAllDataEv">
+<span id="_CPPv3N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="_CPPv2N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="lgraph_api::GraphDB::DropAllData"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a784e2f7141aaed6b547faaaf52e87880"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB11DropAllDataEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Drop all the data in the graph, including labels, indexes and vertexes/edges.. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="lgraph_api::GraphDB::DropAllVertex"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad51e4783ef7de143949c05311a0f2b54"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Drop all vertex and edges but keep the labels and indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="lgraph_api::GraphDB::EstimateNumVertices"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8434ac9ad087a3f57b96f6c8bed664d6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EstimateNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Estimate number of vertices. We don’t maintain the exact number of vertices, but only the next vid. This function actually returns the next vid to be used. So if you have deleted a lot of vertices, the result can be quite different from actual number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Estimated number of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="lgraph_api::GraphDB::AddVertexLabel__ssCR.std::vector:FieldSpec:CR.VertexOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0c0f79500ca028b8342cc6af9b363c83"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="lgraph_api::VertexOptions"><span class="n"><span class="pre">VertexOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the schema is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>primary_field</strong> – The primary field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteVertexLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6d74b689bd295b71c8857f26b77cb4a2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes a vertex label and all the vertices with this label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a15a25572790ab89a16815409cbc5a869"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes fields in a vertex label. This function also updates the vertex data and indices accordingly to make sure the database remains in consistent state. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or some fields cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – Labels of the fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1abdca8d18155cbb711386a18d8f206c66"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fields to a vertex label. The new fields in existing vertices will be filled with default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field already exists.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The add fields. </p></li>
+<li><p><strong>default_values</strong> – The default values of the newly added fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3becea45eab0d50d4c09232b211944d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify fields in a vertex label, either chage the data type or optional, or both. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The new specification of the modified fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="lgraph_api::GraphDB::AddEdgeLabel__ssCR.std::vector:FieldSpec:CR.EdgeOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3c5434fc9c650a6f09465c32db1b16d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a edge label, specifying its schema. It is allowed to specify edge constrains, too. An edge can be bound to several (source_label, destination_label) pairs, which makes sure this type of edges will only be added between these types of vertices. By default, the constain is empty, meaning that the edge is not restricted. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if invalid schema (invalid specification, re- definition of the same field, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>temporal_field</strong> – The temporal field for tid. </p></li>
+<li><p><strong>edge_constraints</strong> – (Optional) The edge constraints. An empty constrain means no restriction.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteEdgeLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0bf6aee53c6c7412806a6a1dcdcd6377"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes an edge label and all the edges of this type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="lgraph_api::GraphDB::AlterLabelModEdgeConstraints__ssCR.std::vector:std::pair:ss.ss::CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7ab2ca321e3bd68c1a9f33aeaa3bd747"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterLabelModEdgeConstraints</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify edge constraint. Existing edges that violate the new constrain will be removed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any vertex label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>constraints</strong> – The new edge constraint.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a08241fee881005b37982621a31fb5e00"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes fields in an edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – The fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of edges modified.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab43144d999e3f539a42c5aa6a4ec21c0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fields to an edge label. The new fields in existing edges will be set to default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field already exists, or the default value is of incompatible type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The fields to add. </p></li>
+<li><p><strong>default_values</strong> – The default values. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aae83cf6042c04347d6cc6147289bced0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify fields in an edge label. Data type and OPTIONAL can be modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The modifier fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddVertexIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4e0da14c082f2be3f4d29ef888daad64"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field</strong> – The field name. </p></li>
+<li><p><strong>is_unique</strong> – True if is unique index, false if not.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddEdgeIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aa33f376759b00da1070c16167f8650bf"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>is_unique</strong> – True if the field content is unique for each vertex.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType"></span><span id="lgraph_api::GraphDB::AddVertexCompositeIndex__ssCR.std::vector:ss:CR.CompositeIndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1afffc035485855bc3f44ef01bd488d64b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fields</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="lgraph_api::CompositeIndexType"><span class="n"><span class="pre">CompositeIndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check if this vertex_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check if this edge_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::GraphDB::IsVertexCompositeIndexed__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a2f37f96ce8798934819071be98abb901"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexCompositeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5dd0b2831686ab10c9cf641b1f5a04c8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the index to ‘vertex_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::GraphDB::DeleteVertexCompositeIndex__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac9bde44178388ef9fce8ca86b28d6a4b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fields</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0b04c7d95efa608199ffd43074698a26"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the index to ‘edge_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="lgraph_api::GraphDB::GetDescriptionC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a10eafac774946c9fda6acd8368e6b254"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDescription</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get graph description. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The description. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="lgraph_api::GraphDB::GetMaxSizeC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3cd10a9d8a077a9b838fecc8d894550c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetMaxSize</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get maximum graph size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The maximum size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a1f9045086aaa5274c657b8020ed8d314"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fulltext index to ‘vertex_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad67d845d1e7c6d3a230ebca0eac15138"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fulltext index to ‘edge_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2d13791623a99511d3d743e811097b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘vertex_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab7e3ee69c450474f77d621b7310b1621"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘edge_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="lgraph_api::GraphDB::RebuildFullTextIndex__std::set:ss:CR.std::set:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6902d07efdba3ff5c2be81311534e752"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RebuildFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_labels</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_labels</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Rebuild the fulltext index of <code class="docutils literal notranslate"><span class="pre">vertex_labels</span></code> and <code class="docutils literal notranslate"><span class="pre">edge_labels</span></code>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_labels</strong> – The vertex labels whose fulltext index need to rebuild. </p></li>
+<li><p><strong>edge_labels</strong> – The edge labels whose fulltext index need to rebuild. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="lgraph_api::GraphDB::ListFullTextIndexes"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ae2b1b58ffc70106433bee030842e3e27"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListFullTextIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List fulltext indexes of vertex and edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Format of returned data : (is_vertex, label_name, property_name) </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryVertexByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a696a8bc40c23002921ccd4983b1e2550"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryVertexByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query vertex by fulltext index. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The vertex label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Vertex vids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryEdgeByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4f09813ea8812322180569bd2b48fe05"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryEdgeByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query edge by fulltext index. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The edge label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Edge uids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12RefreshCountEv">
+<span id="_CPPv3N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="_CPPv2N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="lgraph_api::GraphDB::RefreshCount"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ade8d799b8354403e99298d493a3509f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshCount</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12RefreshCountEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Recount the total number of vertex and edge, stop writing during the count. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3ea21ec359220a8c4e0ea72adb0c1ba0"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copying is disabled. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3bc8ff8539363d5511d9a6936bae7899"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB3db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB3db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB3db_E"></span><span id="lgraph_api::GraphDB::db___lgraph::AccessControlledDBP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a35f581fb0d14734506768c1a61296979"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17should_delete_db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="lgraph_api::GraphDB::should_delete_db___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac2e6f7ca5ee0fc92e2579a7de9303eac"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">should_delete_db_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17should_delete_db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB10read_only_E">
+<span id="_CPPv3N10lgraph_api7GraphDB10read_only_E"></span><span id="_CPPv2N10lgraph_api7GraphDB10read_only_E"></span><span id="lgraph_api::GraphDB::read_only___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac22ad4698a78f7e4ab74ec4450647125"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">read_only_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB10read_only_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-index-iterator">
+<h2>lgraph_edge_index_iterator<a class="headerlink" href="#lgraph-edge-index-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorE"></span><span id="lgraph_api::EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> can be used to access a set of edges that has the same indexed value. If the index is unique (that is, each Edge has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> will only have one edge unique id, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> is valid iff it points to a valid (index_value, euid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ae51a6e1b90b7343b4012be9cc7ae3daa"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a584635e9e5d92688527dbae26f926f80"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="lgraph_api::EdgeIndexIterator::~EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aa1bb455fd404e4102a0e6b637283db00"></span><span class="sig-name descname"><span class="n"><span class="pre">~EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="lgraph_api::EdgeIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="lgraph_api::EdgeIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="lgraph_api::EdgeIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next edge unique id in the list, which consists of all the valid edge unique ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::EdgeIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the current index value. The euids are sorted in ( EdgeIndexValue, euid) order. When <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one euid to next, possibly moving from one EdgeIndexValue to another. This function tells the EdgeIndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="lgraph_api::EdgeIndexIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the Edge Unique Id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="lgraph_api::EdgeIndexIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="lgraph_api::EdgeIndexIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__lgraph::EdgeIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a2266e13c0886456df166e683e4a04cc5"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1acd1c7e3f9d88fcc2a2fa0dbdbb5b2bf8"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1abda22c9f1d7924e06efe4e12a1986292"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="lgraph_api::EdgeIndexIterator::it___std::unique_ptr:lgraph::EdgeIndexIterator:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a8c447e8d8d6d5ae41372b160dec982b1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="lgraph_api::EdgeIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-iterator">
+<h2>lgraph_edge_iterator<a class="headerlink" href="#lgraph-edge-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph5graphE">
+<span id="_CPPv3N6lgraph5graphE"></span><span id="_CPPv2N6lgraph5graphE"></span><span id="lgraph::graph"></span><span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph5graphE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aa64cc73da05613af93f74fbba0e40685"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a92a989ca7aa12f6bf9312acca6a24b9d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aae356ade132bced19db97d69e2693926"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1ad917857534c392eb3de3718007839e87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1acae8199afd0a5a7026d057a2ede19e29"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a623f694634f9b740f6e8432ad5e8fed7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a145cb4680fe351655b20bcefbf1d10c6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a46e696695da45853cbeb5905719210fa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> can be used to iterate through the in-coming edges of a vertex. Edges are sorted in (lid, tid, src, eid) order, and each (dst, lid, tid, src, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> is valid iff it points to a valid in-coming edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a73ca326056d2877cea6b09a683b8c0ba"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a20741057cf223945a84f2ebe4cb73b2f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="lgraph_api::InEdgeIterator::~InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a299e60d91351d2ceb0da9445d3d53ab9"></span><span class="sig-name descname"><span class="n"><span class="pre">~InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="lgraph_api::InEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4NextEv"></span><span id="lgraph_api::InEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next incoming edge to current destination vertex. If there is no more edge, the iterator becomes invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::InEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Go to the edge specified by euid. If the specified edge cannot be found and nearest==true, then try to get the next in-coming edge to the vertex euid.dst, sorted by (label, tid, src, eid). If there is no such edge, iterator is invalidated and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="lgraph_api::InEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the Edge Unique Id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="lgraph_api::InEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="lgraph_api::InEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets destination vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::InEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::InEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets temporal id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The temporal id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="lgraph_api::InEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::InEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::InEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>All field names and values stored as a {(field_name, field_value),…} map. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="lgraph_api::InEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next incoming edge sorted by (lid, tid, src, eid) if there is any. If no in-coming edge is left for this vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="lgraph_api::InEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__lgraph::graph::InEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a92769487b9004274f36dccbc5b26dc1d"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aaf872d62e0bcd4680527d2c086433151"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5110071efc6781255ae9ce68e3634205"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator3it_E"></span><span id="lgraph_api::InEdgeIterator::it___std::unique_ptr:lgraph::graph::InEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a17c31f91df04ddbd378b1d23c6c18568"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4txn_E"></span><span id="lgraph_api::InEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> can be used to iterate through the out-going edges of a vertex. Edges are sorted in (lid, dst, eid) order, and each (src, lid, tid, dst, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> is valid iff it points to a valid out-going edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1abab68117b55783f6c38a899396f169a3"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a088017d735536fa934b5fb2cba592e43"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="lgraph_api::OutEdgeIterator::~OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa0e08e47018ad64858af8310913383b1"></span><span class="sig-name descname"><span class="n"><span class="pre">~OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="lgraph_api::OutEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::OutEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Go to the edge specified by euid. That is, an edge from Vertex euid.src to euid.dst, with LabelId==euid.label, Tid==euid.tid, and EdgeId==euid.eid. If neareast==true and the exact edge was not found, the iterator tries to get the next edge that sorts after the specified edge. The edges are sorted in (label, tid, dst, eid) order. The iterator becomes invalid if there is no outgoing edge from euid.src that sorts after euid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique ID. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if there is no such edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="lgraph_api::OutEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="lgraph_api::OutEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next edge. Invalidates iterator if there is no more out edges from current source vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails (no more out edge from current source). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="lgraph_api::OutEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the Edge Unique Id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="lgraph_api::OutEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets primary id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The primary id of the edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="lgraph_api::OutEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::OutEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – The name of the field to get.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field id. FieldId can be obtained with txn.GetEdgeFieldId() </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>fid</strong> – fid The field id.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::OutEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>All fields in a dictionary of {(field_name, field_value),…}. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value in string representation. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="lgraph_api::OutEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next out-going edge sorted by (label, tid, dst, eid) if there is any. If there is no more out-going edges for this source vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="lgraph_api::OutEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A std::string that represents this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__lgraph::graph::OutEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aec68967791b2a1c92ff94c646853c14a"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ab98d1e207b5ecce1a7dcea1478577558"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a65896ed24e13cd2af266a344a655419c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator3it_E"></span><span id="lgraph_api::OutEdgeIterator::it___std::unique_ptr:lgraph::graph::OutEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa9051f34e34c3c714096054e271c72a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="lgraph_api::OutEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-exceptions">
+<h2>lgraph_exceptions<a class="headerlink" href="#lgraph-exceptions" title="Permalink to this headline"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.ERROR_CODES">
+<span class="target" id="lgraph__exceptions_8h_1a202796cec2c73e6a15b8ae40423102d2"></span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#c.ERROR_CODES" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.X">
+<span class="target" id="lgraph__exceptions_8h_1a1f09736ce2d0b353925675b9c17f9b58"></span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="n"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.X" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THROW_CODE">
+<span class="target" id="lgraph__exceptions_8h_1a0a6acbf1c6c9172f6be1c808cfa03f10"></span><span class="sig-name descname"><span class="n"><span class="pre">THROW_CODE</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="p"><span class="pre">...</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.THROW_CODE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCodeE">
+<span id="_CPPv3N10lgraph_api9ErrorCodeE"></span><span id="_CPPv2N10lgraph_api9ErrorCodeE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05f"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCode</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode1XE">
+<span id="_CPPv3N10lgraph_api9ErrorCode1XE"></span><span id="_CPPv2N10lgraph_api9ErrorCode1XE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa13397c15c68eb3e5e33a0196e8988a24"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode1XE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE">
+<span id="_CPPv3N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span id="_CPPv2N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa0afdd4a4fb13896180b64bd313a17dc2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode">
+<span id="_CPPv3N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="_CPPv2N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="lgraph_api::ErrorCodeToString__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a13525881a01e59b5a69b74c47d95dcd3"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeToString</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode">
+<span id="_CPPv3N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="_CPPv2N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="lgraph_api::ErrorCodeDesc__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a82ab07d2676a279295157e65beeedcbc"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeDesc</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphExceptionE">
+<span id="_CPPv3N10lgraph_api15LgraphExceptionE"></span><span id="_CPPv2N10lgraph_api15LgraphExceptionE"></span><span id="lgraph_api::LgraphException"></span><span class="target" id="classlgraph__api_1_1LgraphException"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><span class="n"><span class="pre">exception</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphExceptionE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_exceptions.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aa1104fdb0328ecad056440c0498affa5"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.ssCR"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af986a8520040b3af5568e7f4f2b3d813"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.cCP"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af81b58e697be8127dd1310a7297a886b"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts">
+<span id="_CPPv3IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span id="_CPPv2IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="p"><span class="pre">...</span></span><span class="sig-name descname"><span class="n"><span class="pre">Ts</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1LgraphException_1a8cc576c0c99e4c712a0fc91ca67868fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">format</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="lgraph_api::LgraphException::LgraphException::Ts"><span class="n"><span class="pre">Ts</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">...</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4codeEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4codeEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4codeEv"></span><span id="lgraph_api::LgraphException::codeC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a833a074d2f56630e12d5c66e6ebb5862"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4codeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException3msgEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException3msgEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException3msgEv"></span><span id="lgraph_api::LgraphException::msgC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1e6c05d855e126b4ecfaa8241f8cca33"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">msg</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException3msgEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4whatEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4whatEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4whatEv"></span><span id="lgraph_api::LgraphException::whatC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aac1c33909e01e1dfc85617cf2477d3eb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">what</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><span class="w"> </span><span class="k"><span class="pre">override</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4whatEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5code_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5code_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5code_E"></span><span id="lgraph_api::LgraphException::code___ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1ac8cce82dda9537fdb72dac589a6ac5f2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5code_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException4msg_E">
+<span id="_CPPv3N10lgraph_api15LgraphException4msg_E"></span><span id="_CPPv2N10lgraph_api15LgraphException4msg_E"></span><span id="lgraph_api::LgraphException::msg___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1da24fcb3b81cddc8a32815f13997437"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">msg_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException4msg_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5what_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5what_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5what_E"></span><span id="lgraph_api::LgraphException::what___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a415baaef606c6f5e5e1104719a84dc72"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">what_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5what_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-galaxy">
+<h2>lgraph_galaxy<a class="headerlink" href="#lgraph-galaxy" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyE">
+<span id="_CPPv3N10lgraph_api6GalaxyE"></span><span id="_CPPv2N10lgraph_api6GalaxyE"></span><span id="lgraph_api::Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_galaxy.h&gt;</em></div>
+<p>A galaxy is the storage engine for one TuGraph instance. It manages a set of User/Role/GraphDBs. </p>
+<p>A galaxy can be opened in async mode, in which case <em>ALL</em> write transactions will be treated as async, whether they declare async or not. This can come in handy if we are performing a lot of writing, but can cause data loss for online processing. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aff4d727c87112ab1ae56882ed7c90ae8"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The TuGraph dir. </p></li>
+<li><p><strong>durable</strong> – (Optional) True to open in durable mode. If set to false, ALL write transactions are async, whether they declare async or not. </p></li>
+<li><p><strong>create_if_not_exist</strong> – (Optional) If true, the TuGraph DB will be created if dir does not exist; otherwise, an exception is thrown. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.ssCR.ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac04eaf83ff6ed47d4e77bbcb06b432f5"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. Open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> and try to login with specified user and password. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is not correct.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The dir. </p></li>
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>durable</strong> – True to open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> in durable mode. </p></li>
+<li><p><strong>create_if_not_exist</strong> – True to create if DB does not exist. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a57bcd86daa9d4cdbfb367a0e43d8b039"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aead55554e77f85378cd82ece56cfde96"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyD0Ev">
+<span id="_CPPv3N10lgraph_api6GalaxyD0Ev"></span><span id="_CPPv2N10lgraph_api6GalaxyD0Ev"></span><span id="lgraph_api::Galaxy::~Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a00577f1737a890a15dbd7b409a2f1cd8"></span><span class="sig-name descname"><span class="n"><span class="pre">~Galaxy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetCurrentUser__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac428a8a912bf43cf72c9a908ef6c7c15"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetCurrentUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Validate and set current user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a568523d4c1b5a1cde2fafa5fd2d702f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set current user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if token is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The current user. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="lgraph_api::Galaxy::CreateGraph__ssCR.ssCR.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a480909a8d20e7b8a904030fc5be34da0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">description</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">max_size</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="m"><span class="pre">1</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">40</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Validate token and set current user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to create graph. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Other input errors such as invalid graph name, size, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph to create. description (Optional) Description of the graph. max_size (Optional) Maximum size of the graph.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if graph already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteGraph__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1f0d94b15f7b718f6aa4f1dc01656f0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Delete a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to delete graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the graph does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="lgraph_api::Galaxy::ModGraph__ssCR.b.ssCR.b.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4d8cdf497e81b2b9d1fc95f980319a0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ModGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_size</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">new_max_size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify graph info. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to modify graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph_name</strong> – Name of the graph. </p></li>
+<li><p><strong>mod_desc</strong> – True to modifier description. </p></li>
+<li><p><strong>desc</strong> – The new description. </p></li>
+<li><p><strong>mod_size</strong> – True to modifier size. </p></li>
+<li><p><strong>new_max_size</strong> – New maximum size.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="lgraph_api::Galaxy::ListGraphsC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a4c64be90601e4a55971798b4272ebf"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListGraphs</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List graphs. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to list graphs.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A dictionary of {graph_name: (description, max_size)} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateUser__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a97e43d10d6b95de4d68ca3c7919bcacb"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Creates a user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if other input errors, such as illegal user name, password, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>desc</strong> – (Optional) The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab111a438ea5f846881da6c03d3e34115"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetPassword__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a29f197aed82ca28992c87b797b5e4186"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetPassword</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">old_password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">new_password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the password of the specified user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission, or curr_user==user, but old_password is incorrect. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if new_password is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user to modify. </p></li>
+<li><p><strong>old_password</strong> – The old password, required if curr_user==user. </p></li>
+<li><p><strong>new_password</strong> – The new password.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUserDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aca1ba2352c5365a0e82f522d79b51219"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets user description. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>desc</strong> – The new description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Galaxy::SetUserRoles__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a0c5796bfe855125cf1b3675c4a3b87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserRoles</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">roles</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the roles of the specified user. If you need to add or delete a role, you will need to use GetUserInfo to get the roles first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any role does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>roles</strong> – A list of roles.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="lgraph_api::Galaxy::SetUserGraphAccess__ssCR.ssCR.AccessLevelCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3f0fcfae10bf1776e39ecc3205fc6c85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserGraphAccess</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets user access rights on a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>access</strong> – The access level.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a0edfd7185553ceb6c81f303acdbf163c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Disable a user. A disabled user is not able to login or perform any operation. A user cannot disable itself. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user to disable.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1af07907500b4d6142b9416e74df4557a4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Enables the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListUsersEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="lgraph_api::Galaxy::ListUsersC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a55e8c41afb9c217b63872b76b1486691"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListUsers</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListUsersEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List all users. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A dictionary of {user_name:user_info} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetUserInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab5010716ab86c5f6650672ce885c4bd9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUserInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets user information. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The user information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateRole__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a550aaacf7d2580baf77c3eb7706cafd7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Create a role. A role has different access levels to different graphs. Every user must be assigned some role to get access to graphs. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1add07dbe39e13e5c47e82c4b621963d7f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the role described by role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6007103b069eebe456d17e6035c763ce"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Disable a role. A disabled role still has the data, but is not effective. i.e., users will not have access rights to graphs that are obtained by having this role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a88b1cf70763b8f517a8a67fd70f45ba6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Enables the role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetRoleDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a09988e113e9709e0ae2d8a9ae55bfd97"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the description of the specified role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRights__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7da90a98fb519cf1557c82f9780bf2aa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRights</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set access of the role to graphs. If you need to add or remove access to part of the graphs, you need to get full graph_access map by using GetRoleInfo first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRightsIncremental__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3ad7fb60a0413742007dceff71f34f9b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRightsIncremental</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Incrementally modify the access right of the specified role. For example, for a role that has access right {graph1:READ, graph2:WRITE}, calling this function with graph_access={graph2:READ, graph3:FULL} will set the access right of this role to {graph1:READ, graph2:READ, graph3:FULL}. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetRoleInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3d2426344ffa4ccd2c3d99af236bbc83"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetRoleInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets role information. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The role information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListRolesEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="lgraph_api::Galaxy::ListRolesC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ae420054434acdb37d8d242926c2eece7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListRoles</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListRolesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List all the roles. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A dictionary of {role_name:<a class="reference internal" href="#structlgraph__api_1_1RoleInfo"><span class="std std-ref">RoleInfo</span></a>} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetAccessLevel__ssCR.ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a9b5d700cf67ddcd6dc08a73271034c66"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAccessLevel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the access level that the specified user have to the graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name or graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The access level. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb">
+<span id="_CPPv3NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="_CPPv2NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="lgraph_api::Galaxy::OpenGraph__ssCR.bC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OpenGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Opens a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>read_only</strong> – (Optional) True to open in read-only mode. A read-only <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> cannot be written to.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5CloseEv">
+<span id="_CPPv3N10lgraph_api6Galaxy5CloseEv"></span><span id="_CPPv2N10lgraph_api6Galaxy5CloseEv"></span><span id="lgraph_api::Galaxy::Close"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a>, turning it into an invalid state. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="lgraph_api::Galaxy::Galaxy__lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a18b1851884f7ba7148f9488f0669212a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aa5da67d606e1c4a26b0733a2f0082f1a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4ea0661db673b9f0f9e2d4fd01cfa2a3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5user_E">
+<span id="_CPPv3N10lgraph_api6Galaxy5user_E"></span><span id="_CPPv2N10lgraph_api6Galaxy5user_E"></span><span id="lgraph_api::Galaxy::user___ss"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a17442452651ea1479fa7d0e652f90810"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5user_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy3db_E">
+<span id="_CPPv3N10lgraph_api6Galaxy3db_E"></span><span id="_CPPv2N10lgraph_api6Galaxy3db_E"></span><span id="lgraph_api::Galaxy::db___lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1d7badecbe92fb1d1d48f412eb80beef"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-result">
+<h2>lgraph_result<a class="headerlink" href="#lgraph-result" title="Permalink to this headline"></a></h2>
+<p>Result interface for plugins and built-in procedures. The result of a plugin should be provided in this format in order for the Cypher engine and the graph visualizer to understand. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46cypher">
+<span id="_CPPv36cypher"></span><span id="_CPPv26cypher"></span><span id="cypher"></span><span class="target" id="namespacecypher"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher</span></span></span><a class="headerlink" href="#_CPPv46cypher" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordE">
+<span id="_CPPv3N10lgraph_api6RecordE"></span><span id="_CPPv2N10lgraph_api6RecordE"></span><span id="lgraph_api::Record"></span><span class="target" id="classlgraph__api_1_1Record"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p>You only initialize the class by <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> instance. <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a> provide some insert method to insert data to the record. eg. Insert, InsertVertexByID, InsertEdgeByID. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERK6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERK6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERK6Record"></span><span id="lgraph_api::Record::Record__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1ac650ba988b5c162c621cabf07c18d497"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERR6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERR6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERR6Record"></span><span id="lgraph_api::Record::Record__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1adb1c42c8dbe94932471cc2fa3b1de7a6"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERK6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERK6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERK6Record"></span><span id="lgraph_api::Record::assign-operator__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1a820a033a9bfbbf0a1a0cff6ae779c715"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERK6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERR6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERR6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERR6Record"></span><span id="lgraph_api::Record::assign-operator__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1ab8d2b9aec7327774226f29c455791dad"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERR6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Record::Insert__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Record_1a38f91b3aee5d1880237939f77fd5c2fb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>fv</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.int64_tC.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a171dbf3555be4830b723f1963518c8d2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertVertexByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId </p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.EdgeUidR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a0947956a5583ac30f6437ccba45e6dbc"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertEdgeByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>euid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t">
+<span id="_CPPv3N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="_CPPv2N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="lgraph_api::Record::InsertVertexByID__ssCR.int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a0445d0d62a48711ddef6e9988bd0fa09"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertVertexByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid">
+<span id="_CPPv3N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="_CPPv2N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="lgraph_api::Record::InsertEdgeByID__ssCR.EdgeUidCR"></span><span class="target" id="classlgraph__api_1_1Record_1abede73c241382ea0e55f76b90e3a7f42"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertEdgeByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">uid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>uid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1af585894e04343f4c80843dcdebdbef9d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>vit</strong> – <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1a1f507fb00296a8e04f98a391ec597ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ieit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>ieit</strong> – <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1aa5d88aae93b2cf484beb632d88420adf"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">oeit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>oeit</strong> – <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a59b5dffacde269b5df6612c00771b9a1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">list</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>list</strong> – LIST OF <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::map:ss.FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a7d99978348600b14abe0049be705b625"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">map</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>map</strong> – MAP OF &lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.traversal::PathCR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a527ac8a8e078306bcda8963a22813afb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversalE" title="lgraph_api::traversal"><span class="n"><span class="pre">traversal</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">path</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert value into result table. You can insert a value by the function, and value must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>path</strong> – Path of traverse api. </p></li>
+<li><p><strong>txn</strong> – Trasaction </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Record4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Record4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Record4SizeEv"></span><span id="lgraph_api::Record::SizeC"></span><span class="target" id="classlgraph__api_1_1Record_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Record4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the size of record. If record is empty, return 0, max size is not beyond the length of your defined param list. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Size of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="lgraph_api::Record::HasKey__ssCR"></span><span class="target" id="classlgraph__api_1_1Record_1a2a2d1b3e4e37484e8bce95728db6b770"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HasKey</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check a key is exist or not. The key is the one of titile your defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>key</strong> – The key.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if exsit, otherwise fasle. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Record::Record__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Record_1af5b8557af6ac3c8c4af28c7fc79a6b42"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6recordE">
+<span id="_CPPv3N10lgraph_api6Record6recordE"></span><span id="_CPPv2N10lgraph_api6Record6recordE"></span><span id="lgraph_api::Record::record__std::unordered_map:ss.std::shared_ptr:ResultElement::"></span><span class="target" id="classlgraph__api_1_1Record_1a2248d027c6bbadbd043ee858e5656d7a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6recordE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6headerE">
+<span id="_CPPv3N10lgraph_api6Record6headerE"></span><span id="_CPPv2N10lgraph_api6Record6headerE"></span><span id="lgraph_api::Record::header__std::unordered_map:ss.LGraphType:"></span><span class="target" id="classlgraph__api_1_1Record_1a38c0d41af0c74862a17017322f4171d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6headerE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record7length_E">
+<span id="_CPPv3N10lgraph_api6Record7length_E"></span><span id="_CPPv2N10lgraph_api6Record7length_E"></span><span id="lgraph_api::Record::length___int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a5f8ae7abecbad53a2b4130540267cddf"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">length_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record7length_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Result</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6ResultE">
+<span id="_CPPv3N10lgraph_api6ResultE"></span><span id="_CPPv2N10lgraph_api6ResultE"></span><span id="lgraph_api::Result"></span><span class="target" id="classlgraph__api_1_1Result"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6ResultE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> table, result instance provide [MutableRecord], [ResetHeader], [Dump] and [Load] method. Table also provide some method to view content of table. For example, [Header] and [Recordview]. </p>
+<p>It’s worth noting that you are best to define your header before using result table. eg. auto result = <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a>({title, LGraphType}…) If you do not define header and initialize by <a class="reference internal" href="#classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"><span class="std std-ref">Result()</span></a>, you will get a empty table without header, you just use the table after using [ResetHeader] method to set your header. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultEv">
+<span id="_CPPv3N10lgraph_api6Result6ResultEv"></span><span id="_CPPv2N10lgraph_api6Result6ResultEv"></span><span id="lgraph_api::Result::Result"></span><span class="target" id="classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aec54d6cf6ac1ac561febf2d4db046bd6"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1adbe90e1fe046f2cd689d8dadd67177c9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="lgraph_api::Result::GetType__ss"></span><span class="target" id="classlgraph__api_1_1Result_1a1015a1bde96a85591fc70273ad140b35"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">title</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get type of title. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>title</strong> – One of titles in table.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>LGraphType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aa5f20d3711f82acbdd1fbf2ea28d5ece"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1a45a2260d7f28e56b5c3e5a7b94789766"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result13MutableRecordEv">
+<span id="_CPPv3N10lgraph_api6Result13MutableRecordEv"></span><span id="_CPPv2N10lgraph_api6Result13MutableRecordEv"></span><span id="lgraph_api::Result::MutableRecord"></span><span class="target" id="classlgraph__api_1_1Result_1ad4bea412e4aef69da8464dd0a83b2a64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">MutableRecord</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result13MutableRecordEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Create a new record in the table and return the record. The record is the reference of record in the table, if you want to modify the record, you must assign return value to a reference variable. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The reference of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7ReserveE6size_t">
+<span id="_CPPv3N10lgraph_api6Result7ReserveE6size_t"></span><span id="_CPPv2N10lgraph_api6Result7ReserveE6size_t"></span><span id="lgraph_api::Result::Reserve__s"></span><span class="target" id="classlgraph__api_1_1Result_1a204d25ea43252cdf35dc6e859f765410"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reserve</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7ReserveE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>This function attempts to reserve enough memory for the result vector to hold the specified number of elements. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api6Result6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api6Result6ResizeE6size_t"></span><span id="lgraph_api::Result::Resize__s"></span><span class="target" id="classlgraph__api_1_1Result_1a9b2c775a0d09660185780ee0a7ea6be1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResizeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>This function will resize the vector to the specified number of elements. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result2AtE6size_t">
+<span id="_CPPv3N10lgraph_api6Result2AtE6size_t"></span><span id="_CPPv2N10lgraph_api6Result2AtE6size_t"></span><span id="lgraph_api::Result::At__s"></span><span class="target" id="classlgraph__api_1_1Result_1a030c64fc1715cdb057995bf9ff5870f6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">At</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result2AtE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Provides access to the data contained in the vector. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6HeaderEv">
+<span id="_CPPv3N10lgraph_api6Result6HeaderEv"></span><span id="_CPPv2N10lgraph_api6Result6HeaderEv"></span><span id="lgraph_api::Result::Header"></span><span class="target" id="classlgraph__api_1_1Result_1accfa1228e11954438cbaa8ad4d6be5e9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Header</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6HeaderEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>return header of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>header. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Result4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Result4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Result4SizeEv"></span><span id="lgraph_api::Result::SizeC"></span><span class="target" id="classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Result4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>return size of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>table size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4DumpEb">
+<span id="_CPPv3N10lgraph_api6Result4DumpEb"></span><span id="_CPPv2N10lgraph_api6Result4DumpEb"></span><span id="lgraph_api::Result::Dump__b"></span><span class="target" id="classlgraph__api_1_1Result_1ac839e6ed0453fe8ed7fac29e9a6803d1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Dump</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_standard</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4DumpEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Serialize the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>is_standard</strong> – (Optional) If true, the result will serialize to a standard result, the standard result can be Visualized in web. If false, result will serialize a json object &amp;#8212; SDK result.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Serialize result. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="lgraph_api::Result::Load__ssCR"></span><span class="target" id="classlgraph__api_1_1Result_1a405e30d792103a7989739a05f992c94a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Load</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">json</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deserialize data to result table. This will be clear original data and header, please use this function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>json</strong> – Json string to be deserialized. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result12ClearRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result12ClearRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result12ClearRecordsEv"></span><span id="lgraph_api::Result::ClearRecords"></span><span class="target" id="classlgraph__api_1_1Result_1af629a0e98c5fbb4adf85475b0073f48a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClearRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result12ClearRecordsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Clear all the records, <a class="reference internal" href="#classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"><span class="std std-ref">Size()</span></a> will be 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10BoltHeaderEv">
+<span id="_CPPv3N10lgraph_api6Result10BoltHeaderEv"></span><span id="_CPPv2N10lgraph_api6Result10BoltHeaderEv"></span><span id="lgraph_api::Result::BoltHeader"></span><span class="target" id="classlgraph__api_1_1Result_1a18c695165355bb5431690e26af2a2d28"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltHeader</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10BoltHeaderEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11BoltRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result11BoltRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result11BoltRecordsEv"></span><span id="lgraph_api::Result::BoltRecords"></span><span class="target" id="classlgraph__api_1_1Result_1a55a40428869f85c65c6dfa3389fe75dc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11BoltRecordsEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result16MarkPythonDriverEb">
+<span id="_CPPv3N10lgraph_api6Result16MarkPythonDriverEb"></span><span id="_CPPv2N10lgraph_api6Result16MarkPythonDriverEb"></span><span id="lgraph_api::Result::MarkPythonDriver__b"></span><span class="target" id="classlgraph__api_1_1Result_1aac0dbd9e0db9031bf18adb7e7618aac6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MarkPythonDriver</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_python_driver</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result16MarkPythonDriverEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Mark that the result is returned to python driver. Python driver is special, use the virtual edge id instead of the real edge id. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10RecordViewE7int64_t">
+<span id="_CPPv3N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="_CPPv2N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="lgraph_api::Result::RecordView__int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1abc994177cadf7bb0d070dd81ad8ea8b9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">RecordView</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">row_num</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10RecordViewE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get record of the table, if row number is more bigger than max length of table, throw a exception. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>row_num</strong> – row number of the table.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>One <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6resultE">
+<span id="_CPPv3N10lgraph_api6Result6resultE"></span><span id="_CPPv2N10lgraph_api6Result6resultE"></span><span id="lgraph_api::Result::result__std::vector:Record:"></span><span class="target" id="classlgraph__api_1_1Result_1a81372de9efc3519cb68a6e51335acfd4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6resultE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6headerE">
+<span id="_CPPv3N10lgraph_api6Result6headerE"></span><span id="_CPPv2N10lgraph_api6Result6headerE"></span><span id="lgraph_api::Result::header__std::vector:std::pair:ss.LGraphType::"></span><span class="target" id="classlgraph__api_1_1Result_1ac1d5325a16b7b45115c0e32c73078d4d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6headerE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10row_count_E">
+<span id="_CPPv3N10lgraph_api6Result10row_count_E"></span><span id="_CPPv2N10lgraph_api6Result10row_count_E"></span><span id="lgraph_api::Result::row_count___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0a15002d39b5391c9c693671d605e56c"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">row_count_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10row_count_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result17is_python_driver_E">
+<span id="_CPPv3N10lgraph_api6Result17is_python_driver_E"></span><span id="_CPPv2N10lgraph_api6Result17is_python_driver_E"></span><span id="lgraph_api::Result::is_python_driver___b"></span><span class="target" id="classlgraph__api_1_1Result_1a8714076c1ee8bd005935652057221763"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_python_driver_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result17is_python_driver_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6v_eid_E">
+<span id="_CPPv3N10lgraph_api6Result6v_eid_E"></span><span id="_CPPv2N10lgraph_api6Result6v_eid_E"></span><span id="lgraph_api::Result::v_eid___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0c2a905250ba619da58c3592f54daea7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">v_eid_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6v_eid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">lgraph::StateMachine</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">cypher::PluginAdapter</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-rpc-client">
+<h2>lgraph_rpc_client<a class="headerlink" href="#lgraph-rpc-client" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410fma_common">
+<span id="_CPPv310fma_common"></span><span id="_CPPv210fma_common"></span><span id="fma_common"></span><span class="target" id="namespacefma__common"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fma_common</span></span></span><a class="headerlink" href="#_CPPv410fma_common" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_rpc">
+<span id="_CPPv310lgraph_rpc"></span><span id="_CPPv210lgraph_rpc"></span><span id="lgraph_rpc"></span><span class="target" id="namespacelgraph__rpc"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_rpc</span></span></span><a class="headerlink" href="#_CPPv410lgraph_rpc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryTypeE">
+<span id="_CPPv3N6lgraph14GraphQueryTypeE"></span><span id="_CPPv2N6lgraph14GraphQueryTypeE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType6CYPHERE">
+<span id="_CPPv3N6lgraph14GraphQueryType6CYPHERE"></span><span id="_CPPv2N6lgraph14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType6CYPHERE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType3GQLE">
+<span id="_CPPv3N6lgraph14GraphQueryType3GQLE"></span><span id="_CPPv2N6lgraph14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType3GQLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientTypeE">
+<span id="_CPPv3N6lgraph10ClientTypeE"></span><span id="_CPPv2N6lgraph10ClientTypeE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClientType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a60813255cdc667f2d2f2ddb427d32d44"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98ab892a078fa6077db32721c67735c56fd"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INDIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a43005cd0efa3b1e1373be596db0ee869"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SINGLE_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientE">
+<span id="_CPPv3N6lgraph9RpcClientE"></span><span id="_CPPv2N6lgraph9RpcClientE"></span><span id="lgraph::RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_rpc_client.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a8995083e1c9332090bdbbced0704b1b9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__std::vector:ss:R.ss.ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a59ff51f4744de0edfe8571844287a51a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">urls</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">user</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>urls</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClientD0Ev"></span><span id="lgraph::RpcClient::~RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient_1a0f8219dbf08d58f7cfc0a853538176a4"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallCypher__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a456fdf97ad54654b985ebd5add140db3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a cypher query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallCypherToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1af9ef8ca1182193ef2c18062ecf23eeb7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypherToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a cypher query to leader. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallGql__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a7cfb10baca3d2f668a10ca43e399afc5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a gql query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallGqlToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a189850ee468b61a65982b7e505c8265b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGqlToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a gql query to leader. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="lgraph::RpcClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a93f4c769de4f1979e4ab824afdaa8ead"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::CallProcedureToLeader__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1a3e5b11b2f703f41d40a2afd9c7581376"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedureToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure to leader. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.ssCR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a0081b8bb075d1be82d8c92281d907cdc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load a built-in procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_file</strong> – <strong>[in]</strong> the source_file contain procedure code. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load a built-in procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::ListProcedures__ssR.ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa090037a4c3944d76e3cbf8c07f569b0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>List user-defined procedures. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient6LogoutEv"></span><span id="lgraph::RpcClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient6LogoutEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Client log out. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::IsReadQuery__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a891d9b465df285ae69983ea3aabebde0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Determine whether it is a read-only query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClient__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af77b4e340b5e79a7875f8f065fd221e5"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEb">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEb"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEb"></span><span id="lgraph::RpcClient::GetClient__b"></span><span class="target" id="classlgraph_1_1RpcClient_1ac3415aee2cca8ddb4c12473be63f42a2"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">isReadQuery</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>isReadQuery</strong> – <strong>[in]</strong> read query or not. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClientByNode__ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af935a15699e0f1004779a265afd67c0a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClientByNode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the client according to the node url. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>url</strong> – <strong>[in]</strong> Node address of client connection. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Rpc client connecting to url. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="lgraph::RpcClient::RefreshUserDefinedProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1af85d15b19d971fbe1babd8d06f5ae2c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshUserDefinedProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh User-defined Procedure. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="lgraph::RpcClient::RefreshBuiltInProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1a5d1a4ee81316d67c4d000e598ef41fec"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshBuiltInProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh Built-in Procedure. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="lgraph::RpcClient::RefreshClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1ab683309ba410ef5c7c65ed6a08b085d9"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh the client connection pool according to the cluster status. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="lgraph::RpcClient::LoadBalanceClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1a9b83e575619171ca739b140ffe024207"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadBalanceClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load balance the client pool. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshConnectionEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="lgraph::RpcClient::RefreshConnection"></span><span class="target" id="classlgraph_1_1RpcClient_1a8957fe9842f100f0e80778649ab7ba14"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshConnection</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshConnectionEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh client pool, procedure info. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F">
+<span id="_CPPv3I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span id="_CPPv2I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">F</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph_1_1RpcClient_1a83227aa710bb0fb4cd66dc7e4b00af5a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DoubleCheckQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="lgraph::RpcClient::DoubleCheckQuery::F"><span class="n"><span class="pre">F</span></span></a><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">f</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="Permalink to this definition"></a><br></dt>
+<dd><p>If an exception is thrown in the query, refresh the connection and re-execute. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_typeE">
+<span id="_CPPv3N6lgraph9RpcClient11client_typeE"></span><span id="_CPPv2N6lgraph9RpcClient11client_typeE"></span><span id="lgraph::RpcClient::client_type__ClientType"></span><span class="target" id="classlgraph_1_1RpcClient_1a376acacd121bd1f972b5fb097e220fd9"></span><a class="reference internal" href="#_CPPv4N6lgraph10ClientTypeE" title="lgraph::ClientType"><span class="n"><span class="pre">ClientType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_type</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient4userE"></span><span id="lgraph::RpcClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4userE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient8passwordE"></span><span id="lgraph::RpcClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient8passwordE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11base_clientE">
+<span id="_CPPv3N6lgraph9RpcClient11base_clientE"></span><span id="_CPPv2N6lgraph9RpcClient11base_clientE"></span><span id="lgraph::RpcClient::base_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a58adfed74cd9daeb6b32a267039e925b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11base_clientE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4urlsE">
+<span id="_CPPv3N6lgraph9RpcClient4urlsE"></span><span id="_CPPv2N6lgraph9RpcClient4urlsE"></span><span id="lgraph::RpcClient::urls__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a306ada97a24c8198c1a0c9c3c5b0bb25"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">urls</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4urlsE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13leader_clientE">
+<span id="_CPPv3N6lgraph9RpcClient13leader_clientE"></span><span id="_CPPv2N6lgraph9RpcClient13leader_clientE"></span><span id="lgraph::RpcClient::leader_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a13cc47368956dc5404b8c30b89c359f9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">leader_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13leader_clientE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_poolE">
+<span id="_CPPv3N6lgraph9RpcClient11client_poolE"></span><span id="_CPPv2N6lgraph9RpcClient11client_poolE"></span><span id="lgraph::RpcClient::client_pool__std::deque:std::shared_ptr:lgraph::RpcClient::RpcSingleClient::"></span><span class="target" id="classlgraph_1_1RpcClient_1a844140b131b865884e1233813d5ed217"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">deque</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_pool</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_poolE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient19built_in_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient19built_in_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient19built_in_proceduresE"></span><span id="lgraph::RpcClient::built_in_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1a18060c9aed7ccf4e945b9f88d03142d2"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">built_in_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient19built_in_proceduresE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23user_defined_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="lgraph::RpcClient::user_defined_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1aea4d05a8b62f0732342d07a9495616cf"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_defined_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23user_defined_proceduresE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21cypher_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient21cypher_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient21cypher_write_constantE"></span><span id="lgraph::RpcClient::cypher_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a632dd8c3163187f7e6faa9271b7b4cfc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21cypher_write_constantE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18gql_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient18gql_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient18gql_write_constantE"></span><span id="lgraph::RpcClient::gql_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a9ec0e77daff8924f52eb7f2e177cc1fc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">gql_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18gql_write_constantE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientE"></span><span id="lgraph::RpcClient::RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::RpcSingleClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae26aab72012bcb1ee86fb02e92a9613d"></span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>RpcSingleClient Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="lgraph::RpcClient::RpcSingleClient::~RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a1a143a1804f6bf71869b0ee5a6dc1462"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::RpcSingleClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::RpcSingleClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2b0a265853b25e1e9b36de7acc58c470"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json， Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::ListProcedures__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a44431b16908099e6e5134afbe127ab63"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>List user-defined procedures. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallCypher__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aff1bfcba1cd1754363bb2adf51db086a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a cypher query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallGql__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2fb61a89fc5e431b2433d52059467be0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a gql query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="lgraph::RpcClient::RpcSingleClient::GetUrl"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad4d20fca6bae3f93f4d1e714aacb03cd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUrl</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the url of single client. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>the url of single client. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="lgraph::RpcClient::RpcSingleClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Client log out. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleRequest__LGraphRequestP"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a61415af9341546df1ad67eed0ea2dbaa"></span><span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleRequest</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">LGraphRequest</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">req</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleGraphQueryRequest__lgraph::GraphQueryType.LGraphResponseP.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a63cc8e69616efdad5460f648780a6bb2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleGraphQueryRequest</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">res</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="lgraph::RpcClient::RpcSingleClient::GraphQueryResponseExtractor__GraphQueryResponseCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a4eb9039c5c4d7e1bd1c065e71aaa75d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryResponseExtractor</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">GraphQueryResponse</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="lgraph::RpcClient::RpcSingleClient::url__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae43c7d8d482ec3550b30cbc7dc23b9f0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">url</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="lgraph::RpcClient::RpcSingleClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="lgraph::RpcClient::RpcSingleClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="lgraph::RpcClient::RpcSingleClient::token__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a9f7d94df8d0a73f04a003fe5032ba32d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">token</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="lgraph::RpcClient::RpcSingleClient::server_version__int64_t"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a3de46036a491e337d41dba033c215120"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">server_version</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="lgraph::RpcClient::RpcSingleClient::channel__std::shared_ptr:lgraph_rpc::m_channel:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ac34b00e3851c29e651d8ca31fe21a9be"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">channel</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="lgraph::RpcClient::RpcSingleClient::cntl__std::shared_ptr:lgraph_rpc::m_controller:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a7d9cee7bb74b09c0ff1b71d2a1b4ef8d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_controller</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cntl</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="lgraph::RpcClient::RpcSingleClient::options__std::shared_ptr:lgraph_rpc::m_channel_options:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a18a1c01a5579128138eeddb758b305d6"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel_options</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">options</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-traversal">
+<h2>lgraph_traversal<a class="headerlink" href="#lgraph-traversal" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalE">
+<span id="_CPPv3N10lgraph_api9traversalE"></span><span id="_CPPv2N10lgraph_api9traversalE"></span><span id="lgraph_api::traversal"></span><span class="target" id="namespacelgraph__api_1_1traversal"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">traversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb">
+<span id="_CPPv3N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span id="_CPPv2N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a726096df46599bdfb914a6ca3420ec96"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FindVertices</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">filter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Retrieve all vertices passing the specified filter. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>filter</strong> – <strong>[inout]</strong> The user-defined filter function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The corresponding list of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb">
+<span id="_CPPv3I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span id="_CPPv2I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1aceb3385f1d10f71f5d9aa46fcdd92915"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">frontier</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Extract data from specified vertices. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Template Parameters</dt>
+<dd class="field-even"><p><strong>VertexData</strong> – Type of the vertex data. </p>
+</dd>
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The database. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>frontier</strong> – <strong>[inout]</strong> The vertices to extract data from. </p></li>
+<li><p><strong>extract</strong> – <strong>[inout]</strong> The user-defined extract function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The corresponding extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT">
+<span id="_CPPv3I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span id="_CPPv2I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a860101673fe319842615891bdce356d5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DefaultFilter</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="lgraph_api::traversal::DefaultFilter::IT"><span class="n"><span class="pre">IT</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="Permalink to this definition"></a><br></dt>
+<dd><p>The default filter you may use. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>it</strong> – <strong>[inout]</strong> An iterator class.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Always true. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a0be095f6cae74a9b2b83368bcaa8bb9d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Function closure filtering by label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>label</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a916a3c242ae9447471b4116416ac3200"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Function closure filtering by label id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>label_id</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::eq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a787283b8c440e78fe08f3233ec9927d1"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::neq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a5a867323375932ba84f360b8f7ba104d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::eq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1aca364480fdfefebade068076c782085e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::neq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a2360c3785fed893a88cc4ab67d8a56de"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE">
+<span id="_CPPv3N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="_CPPv2N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="lgraph_api::traversal::MAX_RESULT_SIZE__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a19036385f876c801d15c194fc62e7531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE">
+<span id="_CPPv3N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="_CPPv2N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="lgraph_api::traversal::TRAVERSAL_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a86e405bbe2ac6d2a74230ae2305fd8e0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE">
+<span id="_CPPv3N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="_CPPv2N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="lgraph_api::traversal::TRAVERSAL_ALLOW_REVISITS__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a92a5114a7f6be9af4e24557fa238f8b7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_ALLOW_REVISITS</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4EdgeE">
+<span id="_CPPv3N10lgraph_api9traversal4EdgeE"></span><span id="_CPPv2N10lgraph_api9traversal4EdgeE"></span><span id="lgraph_api::traversal::Edge"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent an edge. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="lgraph_api::traversal::Edge::Edge__s.uint16_t.uint64_t.s.s.b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5fa8e10b10d8db22077e6a8f51c56a4f"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">start</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">tid</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">end</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">eid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">forward</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>start</strong> – The start. </p></li>
+<li><p><strong>lid</strong> – The lid. </p></li>
+<li><p><strong>tid</strong> – The tid. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>eid</strong> – The eid. </p></li>
+<li><p><strong>forward</strong> – True to forward. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="lgraph_api::traversal::Edge::Edge__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1accd38aace77501c9cf5cae967e894970"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="lgraph_api::traversal::Edge::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="lgraph_api::traversal::Edge::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the start vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The start vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="lgraph_api::traversal::Edge::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the end vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The end vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="lgraph_api::traversal::Edge::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a15b074c85865e730723336acec71f79e"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the label ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The label ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="lgraph_api::traversal::Edge::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a02537fe49ffb801dd20bdaae51b29325"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Temporal ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The temporal ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="lgraph_api::traversal::Edge::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a2592e180e605668b296b9251bc4d275a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the edge ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The edge ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="lgraph_api::traversal::Edge::IsForwardC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a41a01f6b828238200fef82f544fd172e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsForward</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the direction of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>true : forward; false: backward. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="lgraph_api::traversal::Edge::GetSrcVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5490526b0251ebb9ad277c9b314eedbb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrcVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the source vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The source vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="lgraph_api::traversal::Edge::GetDstVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ab717cca464319d1b380648aedbaaca1d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDstVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the destination vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The destination vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge6start_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge6start_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge6start_E"></span><span id="lgraph_api::traversal::Edge::start___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ad914f6be659b44fe8e11acc02cf6eeb6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">start_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge6start_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4end_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4end_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4end_E"></span><span id="lgraph_api::traversal::Edge::end___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1afdac24f7adfe72f79983c12b08e566e5"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4end_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4eid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4eid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4eid_E"></span><span id="lgraph_api::traversal::Edge::eid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a74dfb17650dad72d071112c995343f25"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4eid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4lid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4lid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4lid_E"></span><span id="lgraph_api::traversal::Edge::lid___uint16_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4b77269210d4ee2d997719c8dee806ea"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4lid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4tid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4tid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4tid_E"></span><span id="lgraph_api::traversal::Edge::tid___int64_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a6ec1f5936b6351a1911a966a8a08fd42"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4tid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge8forward_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge8forward_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge8forward_E"></span><span id="lgraph_api::traversal::Edge::forward___b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1aae1b80cda1e8b80f4a52f8a6d1f22df8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">forward_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge8forward_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversalE"></span><span id="lgraph_api::traversal::FrontierTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversalE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> provides the most common way to traverse graphs. You can start from a single vertex or a set of vertices (known as the initial frontier), and expand them frontier by frontier, each time visiting neighboring vertices of the current frontier and make those matching specified conditions the new frontier. One powerful feature of <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> is that the traversal can be performed in parallel, accelerating those <em>deep</em> queries significantly. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::FrontierTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a545b378096e3004e11024a15fd17bd27"></span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> object. Note that the transaction must be read- only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Be careful when TRAVERSAL_ALLOW_REVISITS is used, as each vertex may be visited more than once, making the result set huge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::FrontierTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a9c2251578e77394a41833329c9200e72"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ae8aee8d3fccc6f15e21f0e5a4652c33e"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a79b977639f217d9411ac48a32c6e83f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad655c689b55d2072e9212b55ea015bb0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="lgraph_api::traversal::FrontierTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="lgraph_api::traversal::FrontierTraversal::ResetVisited"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aaf986f1e13f0da831c3d8277cdb860f0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetVisited</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset only the visited flags. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="lgraph_api::traversal::FrontierTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="lgraph_api::traversal::FrontierTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="lgraph_api::traversal::FrontierTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::FrontierTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::curr_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a272d864e6eface58376c0d0c08c89401"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::next_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad05308b798bf29c2e2e6fcf6331150c6"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="lgraph_api::traversal::FrontierTraversal::visited___ParallelBitset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ac784cfc9970b0a1fb2e5a1678ed59284"></span><span class="n"><span class="pre">ParallelBitset</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">visited_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelperE">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelperE"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelperE"></span><span id="lgraph_api::traversal::IteratorHelper"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1IteratorHelper"><span class="std std-ref">IteratorHelper</span></a> provides some useful methods, such as casting Vertex/Edge objects to their iterator forms. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="lgraph_api::traversal::IteratorHelper::IteratorHelper__TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a7d72fd8bc5a5a60f16a5eea5b1ae781e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a9db8a753c5773fd00186665e172e8df2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd><p>Casting a <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> to a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vertex</strong> – A <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> object.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> corresponding to vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1ab5ec73c9874f5c269c066857075d67c6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd><p>Casting an <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Edge"><span class="std std-ref">Edge</span></a> to an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>edge</strong> – An edge object.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> corresponding to edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="lgraph_api::traversal::IteratorHelper::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathE">
+<span id="_CPPv3N10lgraph_api9traversal4PathE"></span><span id="_CPPv2N10lgraph_api9traversal4PathE"></span><span id="lgraph_api::traversal::Path"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="lgraph_api::traversal::Path::Path__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abd76ad8cca7c9f5611d89b6c94e88d53"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">start</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>start</strong> – The start. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="lgraph_api::traversal::Path::Path__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a6f0b65d8220590bc0de51a6f9178db0c"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="lgraph_api::traversal::Path::Path__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae8d80e874d2f88e507218f6db1ed2cdc"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERK4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a3640a670cabc7ff15a8bf5e31f83b3e9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERK4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Assignment operator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERR4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae3dcf33db8617fe1de00cedc6541ae98"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERR4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move assignment operator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path6LengthEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path6LengthEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path6LengthEv"></span><span id="lgraph_api::traversal::Path::LengthC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1aa63d0332a20e86302501c8bd1db921c2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Length</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path6LengthEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the length of this path. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The path length. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="lgraph_api::traversal::Path::Append__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab88413d902928384d83cbad1df6de769"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append an edge to the path. Note that the edge’s start vertex should match the current path’s end vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>edge</strong> – edge to append. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="lgraph_api::traversal::Path::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the start vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="lgraph_api::traversal::Path::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the end vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="lgraph_api::traversal::Path::GetLastEdgeC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abf723fca4ce807ccf77dc91e685b5545"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLastEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the last edge of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthEdge__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a7f37b5b5e876c5ec8836bba603e526e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Nth edge of this path. The available range of N is [0, Length). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthVertex__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab6aa8a9295375d526831278b2690558e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Nth vertex of this path. The available range of N is [0, Length]. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5dirs_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5dirs_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5dirs_E"></span><span id="lgraph_api::traversal::Path::dirs___std::vector:b:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a0ad3ec1585be61bf4e9ab8ae94bb4406"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dirs_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5dirs_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5lids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5lids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5lids_E"></span><span id="lgraph_api::traversal::Path::lids___std::vector:uint16_t:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a58d741b575ad6c800db503b3d2db61d3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint16_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5lids_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4ids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path4ids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path4ids_E"></span><span id="lgraph_api::traversal::Path::ids___std::vector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a2a21c3f2f91696ebc1c7d5109b5cc921"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4ids_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversalE"></span><span id="lgraph_api::traversal::PathTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversalE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> behaves similar to <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a>, except that 1) Each vertex could be revisited multiple times. 2) Each traversed path would be stored, and the filter function has access to the path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::PathTraversal::PathTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af738f641e5877af62941a670ceedd359"></span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> object. Note that the transaction must be read-only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Since TRAVERSAL_ALLOW_REVISITS is implied in <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> and storing the Paths also takes a lot of space, the memory consumption could be very large if the filters are not very selective. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::PathTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4664408bde6c8bc833b2d308a7a9c770"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a346ba8aed662685cd78506c8baec815c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a0a54b5500485e208383933b8f2817675"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1abb7d1f2986dde079c71c568410386249"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="lgraph_api::traversal::PathTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="lgraph_api::traversal::PathTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="lgraph_api::traversal::PathTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="lgraph_api::traversal::PathTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::PathTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::curr_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ac73154ee309f0dad63fb1a1790e23025"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::next_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af032087096fefc9f61b4351bc5e9a71d"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6VertexE">
+<span id="_CPPv3N10lgraph_api9traversal6VertexE"></span><span id="_CPPv2N10lgraph_api9traversal6VertexE"></span><span id="lgraph_api::traversal::Vertex"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a vertex. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="lgraph_api::traversal::Vertex::Vertex__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a3f6911c4ec59435701457f131e89af4a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="lgraph_api::traversal::Vertex::Vertex__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a13f7b30a546a536a3dfafd128adb609f"></span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="lgraph_api::traversal::Vertex::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="lgraph_api::traversal::Vertex::GetIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a63765fbd0690661e2af3bc97083475fc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The Id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex4vid_E">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex4vid_E"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex4vid_E"></span><span id="lgraph_api::traversal::Vertex::vid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a224220636b53e35b1b5bf8c0e88717d0"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex4vid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-txn">
+<h2>lgraph_txn<a class="headerlink" href="#lgraph-txn" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api11TransactionE"></span><span id="lgraph_api::Transaction"></span><span class="target" id="classlgraph__api_1_1Transaction"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_txn.h&gt;</em></div>
+<p>TuGraph operations happen in transactions. A transaction is sequence of operations that is carried out atomically on the <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. TuGraph transactions provides full ACID guarantees. </p>
+<p>Transactions are created using <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"><span class="std std-ref">GraphDB::CreateReadTxn()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"><span class="std std-ref">GraphDB::CreateWriteTxn()</span></a>. A read transaction can only perform read operations, otherwise an exception is thrown. A write transaction can perform reads as well as writes. There are performance differences between read and write operations. So if you only need read in a transaction, you should create a read transaction.</p>
+<p>Each transaction must be used in one thread only, and they should not be passed from one thread to another unless it is a forked transaction.</p>
+<p>Read transactions can be forked. The new copy of the transaction will have the same view as the forked one, and it can be used in a separate thread. By forking from one read transaction and using the forked copies in different threads, we can parallelize the execution of specific operations. For example, you can implement a parallel BFS with this capability. Also, you can dump a snapshot of the whole graph using </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09c0d46171b7562e16c3a697f77fca90"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERR11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERR11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERR11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3d6029838ae611c2c7bbc3c59afe059"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERR11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a44fabd0e73ed35b6d683051496a3f30f"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERK11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERK11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERK11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1abde1d510a232da04117f21bd23de8143"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERK11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6CommitEv">
+<span id="_CPPv3N10lgraph_api11Transaction6CommitEv"></span><span id="_CPPv2N10lgraph_api11Transaction6CommitEv"></span><span id="lgraph_api::Transaction::Commit"></span><span class="target" id="classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Commit</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6CommitEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Commits this transaction. Note that optimistic write transactions may fail to commit (an TxnConflict would be thrown). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5AbortEv">
+<span id="_CPPv3N10lgraph_api11Transaction5AbortEv"></span><span id="_CPPv2N10lgraph_api11Transaction5AbortEv"></span><span id="lgraph_api::Transaction::Abort"></span><span class="target" id="classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Abort</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5AbortEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Aborts this transaction. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction7IsValidEv">
+<span id="_CPPv3NK10lgraph_api11Transaction7IsValidEv"></span><span id="_CPPv2NK10lgraph_api11Transaction7IsValidEv"></span><span id="lgraph_api::Transaction::IsValidC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this transaction is valid. <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> becomes invalid after calling <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"><span class="std std-ref">Abort()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"><span class="std std-ref">Commit()</span></a>. Operations on invalid transaction yields exceptions. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv">
+<span id="_CPPv3NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="_CPPv2NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="lgraph_api::Transaction::IsReadOnlyC"></span><span class="target" id="classlgraph__api_1_1Transaction_1afde2da3cd793a0a0403ea2ea0c9b9ea7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadOnly</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this txn is read only. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if read only, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6GetTxnEv">
+<span id="_CPPv3N10lgraph_api11Transaction6GetTxnEv"></span><span id="_CPPv2N10lgraph_api11Transaction6GetTxnEv"></span><span id="lgraph_api::Transaction::GetTxn"></span><span class="target" id="classlgraph__api_1_1Transaction_1a94bc9b71b14ae6ad7c788d20ec39b769"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6GetTxnEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="lgraph_api::Transaction::GetVertexIterator"></span><span class="target" id="classlgraph__api_1_1Transaction_1a16d76f5c12d744846d85b007cf4e094c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get a vertex iterator pointing to the first vertex. If there is no vertex, the iterator is invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="lgraph_api::Transaction::GetVertexIterator__int64_t.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1af8c95376a78769b0717fd40fdcd274eb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets a vertex iterator pointing to the Vertex with vid. If the vertex does not exist, the iterator is invalid. If nearest==true, the iterator points to the first vertex sorted by vid, with id&gt;=vid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vid</strong> – The vid. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to point to the nearest vertex sorted by vid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9bcd70f9274974a3028ef762228e176e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an out edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1add821551447553956775fac4656f3d94"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an in edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab3bfd10ebeec5f7d0455d1fbc0762e73"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="lgraph_api::Transaction::GetNumVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4b870210a66a2f239535915497e26278"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of vertex labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The number of vertex labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="lgraph_api::Transaction::GetNumEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1aec256df0cdfca791031bad9c43c63061"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of edge labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The number of edge labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="lgraph_api::Transaction::ListVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a5b2320193bfb8ffbfaa157a110d550ad"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Lists all vertex labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="lgraph_api::Transaction::ListEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae77fe52ec78bc3e8d8d92fe8d7a3accb"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List all edge labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1a3769873514b6a5dd62b04414ff627c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label name.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab030e136e6b28679acbb59a08a977090"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1afd8f546dcb187e1be6f86d268c62996b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4afb55d1ce9b5906c6721f5c4b3b3d82"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac461aea7ee379f8669f45f9782cea1f4"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a55194445591f9fa6730dd8deb99e2414"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2d9a2f736cfb96a2f61e4de3072eb811"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetEdgeFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c13f1f3f527b37d3a221d4adb06cc5c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae62bafbd58f35cfcc01255fe4113094f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2c972657b35f86a21527bc2ad1be741e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae57f64149da2f4d2f972f49a53943591"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertVertex__s.s.std::vector:s:CR.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad86ef0cb03585dd0361042f69fb6714c"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">primary_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">unique_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert a vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>primary_pos</strong> – The location of the primary field in field_ids. </p></li>
+<li><p><strong>unique_pos</strong> – The locations of the unique index field in field_ids, can be empty. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>0: nothing happened because of index conflict 1: the vertex is inserted 2: the vertex is updated </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee14b2bcd0e170d5b87924a6a9a3e16f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3452ae2c9cae9850a7e53c2ddcc6240"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add0eea119e67210b57d9b8b6119e88d4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad342ee46d6f7f955529018100a701185"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9663b407c7f5ce18af938c7b670dd3fd"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1af3a3806320f56cb01f5edc7ff364ad80"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1acd0cba3b23983114fdd65784b11a3297"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">unique_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>unique_pos</strong> – The locations of the unique index field in field_ids, can be empty. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>0: nothing happened because of index conflict 1: the vertex is inserted 2: the vertex is updated </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a66d9f07dc220285b2fbec99fb088ad4a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A vector of vertex index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction26ListVertexCompositeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction26ListVertexCompositeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction26ListVertexCompositeIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexCompositeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a35a12d4a7a7fe0dc31d3221e8afcc676"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexSpecE" title="lgraph_api::CompositeIndexSpec"><span class="n"><span class="pre">CompositeIndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexCompositeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction26ListVertexCompositeIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A vector of vertex composite index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="lgraph_api::Transaction::ListEdgeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee4d71f4e5ce213bbe886162db6edba0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A vector of edge index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aea99efb5e098fca6157f419ec7e4396c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__s.std::vector:s:CR.std::vector:FieldData:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aa4db70c6d33c32018c0279601634e1b6"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e87da96ea73d8c709ef75a92b2bf5c4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add8eaa25484aefe92c14c0340bb35841"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__ssCR.std::vector:ss:CR.std::vector:FieldData:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab13a6cc8d58d716f8388455b1b571e4a"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a49deaf34c918d940432204e5a5a16cff"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09382e2279bb78f1a79443741112a57e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__ssCR.std::vector:ss:CR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c87149e83ca6f4de94e0c5c9bf88a41"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0a484619a92fe73247f86d9db09d2ead"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of vertices. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of edges. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee85d698359c92dc3c9bc9f9e65ecf0f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab94cbd4824258986d5d32d00453c85f7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2eddb62a56cf0030545bce6bef00104f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9af16d5a13268c711610cc3c615592c0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a594aa9d948f61ee8d06d5a3f8925c4e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9cc46853b60d578578649f8bef35d84d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9a16d2c7f0770fbfd38e53a4a95a165f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1adefa9906e0325df0316c499491f22adb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a99a3bbbf134a20c992b10ac015ea4131"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv">
+<span id="_CPPv3N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="_CPPv2N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="lgraph_api::Transaction::GetNumVertices"></span><span class="target" id="classlgraph__api_1_1Transaction_1a84acf46e241f12fe3480c203cbd59d3c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The nubmer of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexPrimaryField__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0b662063aee62d2793c634a132375ae9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexPrimaryField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex primary field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The primary field. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5CountEv">
+<span id="_CPPv3N10lgraph_api11Transaction5CountEv"></span><span id="_CPPv2N10lgraph_api11Transaction5CountEv"></span><span id="lgraph_api::Transaction::Count"></span><span class="target" id="classlgraph__api_1_1Transaction_1a420ff169b39c4ce47b02a25a1eda00ae"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Count</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5CountEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the total number of vertex and edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>std::pair object, first element is vertex number, second is edge number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11CountDetailEv">
+<span id="_CPPv3N10lgraph_api11Transaction11CountDetailEv"></span><span id="_CPPv2N10lgraph_api11Transaction11CountDetailEv"></span><span id="lgraph_api::Transaction::CountDetail"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e88abab9d0a158b1dd1f72d97dcbda1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CountDetail</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11CountDetailEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the total number of vertex or edge for each label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>std::tuple object list, first element indicates whether it is VERTEX or EDGE, second is label name, third is number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="lgraph_api::Transaction::Transaction__lgraph::TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1b5dc38854e41e00ee874297e73343af"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction4txn_E">
+<span id="_CPPv3N10lgraph_api11Transaction4txn_E"></span><span id="_CPPv2N10lgraph_api11Transaction4txn_E"></span><span id="lgraph_api::Transaction::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">GraphDB</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-types">
+<h2>lgraph_types<a class="headerlink" href="#lgraph-types" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15EdgeConstraintsE">
+<span id="_CPPv3N10lgraph_api15EdgeConstraintsE"></span><span id="_CPPv2N10lgraph_api15EdgeConstraintsE"></span><span id="lgraph_api::EdgeConstraints"></span><span class="target" id="namespacelgraph__api_1a7d597d281cbcd87325f58fcce96e5d34"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeConstraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Edge constraints type define. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevelE">
+<span id="_CPPv3N10lgraph_api11AccessLevelE"></span><span id="_CPPv2N10lgraph_api11AccessLevelE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevelE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access level a user or role has on a graph. NONE: no permission. READ: read-only, no write access. WRITE: can read and write vertex and edge, but cannot change meta data such as schema or access. FULL: full access, can modify schema, grant access to other users, or even delete this graph. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4NONEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4READE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4READE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62a3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4READE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ad4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel5WRITEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4FULLE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4FULLE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4FULLE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62aba7de5bc6888294e5884b024a4c894f1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FULL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4FULLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevelE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevelE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevelE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afe"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldAccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afeab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4NONEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4READE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4READE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afea3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4READE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afead4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryTypeE">
+<span id="_CPPv3N10lgraph_api14GraphQueryTypeE"></span><span id="_CPPv2N10lgraph_api14GraphQueryTypeE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType6CYPHERE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType6CYPHERE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType6CYPHERE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType3GQLE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType3GQLE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType3GQLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldTypeE">
+<span id="_CPPv3N10lgraph_api9FieldTypeE"></span><span id="_CPPv2N10lgraph_api9FieldTypeE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1da"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Field and value types. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType3NULE">
+<span id="_CPPv3N10lgraph_api9FieldType3NULE"></span><span id="_CPPv2N10lgraph_api9FieldType3NULE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa4c175fbb65c723226d182dbfd556136a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType3NULE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BOOLE">
+<span id="_CPPv3N10lgraph_api9FieldType4BOOLE"></span><span id="_CPPv2N10lgraph_api9FieldType4BOOLE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daae663dbb8f8244e122acb5bd6b2c216e1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BOOLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4INT8E">
+<span id="_CPPv3N10lgraph_api9FieldType4INT8E"></span><span id="_CPPv2N10lgraph_api9FieldType4INT8E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daada138aad097eaac8697fe3661c91af95"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4INT8E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT16E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT16E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT16E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac4a99142c241d04e1607af8a319c201b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT16E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT32E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT32E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT32E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac1081c62db14e24ef35a1c3c36cba2e7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT32E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT64E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT64E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT64E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa423a1db7cbc915478f654b15f87f3aac"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT64E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5FLOATE">
+<span id="_CPPv3N10lgraph_api9FieldType5FLOATE"></span><span id="_CPPv2N10lgraph_api9FieldType5FLOATE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa9cf4a0866224b0bb4a7a895da27c9c4c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5FLOATE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api9FieldType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api9FieldType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa33465d1d419b1074fb259ef444609e92"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6DOUBLEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4DATEE">
+<span id="_CPPv3N10lgraph_api9FieldType4DATEE"></span><span id="_CPPv2N10lgraph_api9FieldType4DATEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa0ace72efd9e987dfd807365d0ca50141"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4DATEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType8DATETIMEE">
+<span id="_CPPv3N10lgraph_api9FieldType8DATETIMEE"></span><span id="_CPPv2N10lgraph_api9FieldType8DATETIMEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa86797ee5836338ee241ceee5cfc669e2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATETIME</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType8DATETIMEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6STRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType6STRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType6STRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaee847e634a4297b274316de8a8ca9921"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6STRINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BLOBE">
+<span id="_CPPv3N10lgraph_api9FieldType4BLOBE"></span><span id="_CPPv2N10lgraph_api9FieldType4BLOBE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa3a625432a45f9c83112036bc7a2d2d70"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BLOB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BLOBE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5POINTE">
+<span id="_CPPv3N10lgraph_api9FieldType5POINTE"></span><span id="_CPPv2N10lgraph_api9FieldType5POINTE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa15108ccafa3232b9067f889b6156f565"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5POINTE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaaebdbcb765394d25d6a604589a890f82"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType10LINESTRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType10LINESTRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType10LINESTRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa21af7314ca158a415f7e073333d14447"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType10LINESTRINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaa90611ea278d30580b21af6d65208307"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7POLYGONE">
+<span id="_CPPv3N10lgraph_api9FieldType7POLYGONE"></span><span id="_CPPv2N10lgraph_api9FieldType7POLYGONE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daad5355465780b9a6259ebbc74d47477db"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7POLYGONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaecdc92bf56d960b73b02ee40125758bc"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7SPATIALE">
+<span id="_CPPv3N10lgraph_api9FieldType7SPATIALE"></span><span id="_CPPv2N10lgraph_api9FieldType7SPATIALE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa608c1acc2033e0e07248c48ea01746ce"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SPATIAL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7SPATIALE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphTypeE">
+<span id="_CPPv3N10lgraph_api10LGraphTypeE"></span><span id="_CPPv2N10lgraph_api10LGraphTypeE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00d"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphType</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">uint16_t</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>a type of value used in result entry and parameter in procedure or plugin signature </p>
+<dl class="field-list simple">
+<dt class="field-odd">Param INTEGER</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param FLOAT</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param DOUBLE</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param BOOLEAN</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param STRING</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param MAP</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param NODE</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>, VertexId </p>
+</dd>
+<dt class="field-even">Param RELATIONSHIP</dt>
+<dd class="field-even"><p><a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> || <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>, <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p>
+</dd>
+<dt class="field-odd">Param PATH</dt>
+<dd class="field-odd"><p>lgraph_api::Path </p>
+</dd>
+<dt class="field-even">Param LIST</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param ANY</dt>
+<dd class="field-odd"><p>like Object in Java, its procedure author’s responsibility to check the underlying concrete type whether valid in runtime. </p>
+</dd>
+</dl>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3NULE">
+<span id="_CPPv3N10lgraph_api10LGraphType3NULE"></span><span id="_CPPv2N10lgraph_api10LGraphType3NULE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3NULE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7INTEGERE">
+<span id="_CPPv3N10lgraph_api10LGraphType7INTEGERE"></span><span id="_CPPv2N10lgraph_api10LGraphType7INTEGERE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5d5cd46919fa987731fb2edefe0f2a0c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INTEGER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7INTEGERE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType5FLOATE">
+<span id="_CPPv3N10lgraph_api10LGraphType5FLOATE"></span><span id="_CPPv2N10lgraph_api10LGraphType5FLOATE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dae738c26bf4ce1037fa81b039a915cbf6"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType5FLOATE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api10LGraphType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api10LGraphType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dafd3e4ece78a7d422280d5ed379482229"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6DOUBLEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7BOOLEANE">
+<span id="_CPPv3N10lgraph_api10LGraphType7BOOLEANE"></span><span id="_CPPv2N10lgraph_api10LGraphType7BOOLEANE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac48d5da12d702e73d6966069f2687376"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOLEAN</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7BOOLEANE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6STRINGE">
+<span id="_CPPv3N10lgraph_api10LGraphType6STRINGE"></span><span id="_CPPv2N10lgraph_api10LGraphType6STRINGE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da63b588d5559f64f89a416e656880b949"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6STRINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4NODEE">
+<span id="_CPPv3N10lgraph_api10LGraphType4NODEE"></span><span id="_CPPv2N10lgraph_api10LGraphType4NODEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da0cc25b606fe928a0c9a58f7f209c4495"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NODE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4NODEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE">
+<span id="_CPPv3N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span id="_CPPv2N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac5a4cec9a456484389b2573c8ae0a8bf"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RELATIONSHIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4PATHE">
+<span id="_CPPv3N10lgraph_api10LGraphType4PATHE"></span><span id="_CPPv2N10lgraph_api10LGraphType4PATHE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5ffb5f0d0de78321df46fc7c93ca64a3"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PATH</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4PATHE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4LISTE">
+<span id="_CPPv3N10lgraph_api10LGraphType4LISTE"></span><span id="_CPPv2N10lgraph_api10LGraphType4LISTE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da298cb25408234de02baf2085803a464a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LIST</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4LISTE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3MAPE">
+<span id="_CPPv3N10lgraph_api10LGraphType3MAPE"></span><span id="_CPPv2N10lgraph_api10LGraphType3MAPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5af1a3a285c2bdee4192223e31e1f833"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3MAPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3ANYE">
+<span id="_CPPv3N10lgraph_api10LGraphType3ANYE"></span><span id="_CPPv2N10lgraph_api10LGraphType3ANYE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da8e1bde3c3d303163521522cf1d62f21f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ANY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3ANYE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeTypeE">
+<span id="_CPPv3N10lgraph_api14PluginCodeTypeE"></span><span id="_CPPv2N10lgraph_api14PluginCodeTypeE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Type of code given when loading a new plugin. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2PYE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2PYE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2PYE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3ae0a77e22f8238541046ba5f9a5941e9e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2PYE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2SOE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2SOE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2SOE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3af9f590fe6d84e72c832e714b75b1604b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SO</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2SOE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3CPPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3CPPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3CPPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aca1ef9dc7006f2011c38e2bcc8f64d16"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CPP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3CPPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3ZIPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3ZIPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3ZIPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aed0690cdc850739d6e2b7b888311e32c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ZIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3ZIPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexTypeE">
+<span id="_CPPv3N10lgraph_api9IndexTypeE"></span><span id="_CPPv2N10lgraph_api9IndexTypeE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>index type </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType14NonuniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType14NonuniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a5e3e0d5af84f4b5e85c9dca495b47018"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NonuniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is not unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a7f0f75f7fcd7d67aa985f11f3ebf2712"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GlobalUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is a global unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType15PairUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType15PairUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a89627e6fbb7ed5b8b3913ecbd253b52f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PairUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is a pair unique index, for edge index only key of pair unique index is one of the follow case : if src_vid &lt; dst_vid ,key is (index field value + src_vid + dst_vid) if src_vid &gt; dst_vid ,key is (index field value + dst_vid + src_vid) </p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexTypeE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexTypeE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexTypeE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CompositeIndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexType11UniqueIndexE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexType11UniqueIndexE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexType11UniqueIndexE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03afa1a33f381dab5d21a8c1241468b00c4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexType11UniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is not unique composite index Temporarily require all attributes to be non-empty attributes </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK11AccessLevel"></span><span id="lgraph_api::to_string__AccessLevelCR"></span><span class="target" id="namespacelgraph__api_1aaa50da267713908744fd8e2c5a6a4373"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK11AccessLevel" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="lgraph_api::to_string__FieldAccessLevelCR"></span><span class="target" id="namespacelgraph__api_1af06d7db8c2df7831e02af25d45ad43ef"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="lgraph_api::FieldAccessLevel"><span class="n"><span class="pre">FieldAccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK14GraphQueryType">
+<span id="_CPPv3N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="_CPPv2N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="lgraph_api::to_string__GraphQueryTypeCR"></span><span class="target" id="namespacelgraph__api_1acd1e36eab9c9fc42d4192f3d55e4504a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="lgraph_api::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK14GraphQueryType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE9FieldType">
+<span id="_CPPv3N10lgraph_api9to_stringE9FieldType"></span><span id="_CPPv2N10lgraph_api9to_stringE9FieldType"></span><span id="lgraph_api::to_string__FieldType"></span><span class="target" id="namespacelgraph__api_1a584042d80e34528010e1ad8e3e499b1d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the name of the given FieldType. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – when an unrecognizable FieldType is given.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>v</strong> – A FieldType.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Name of the given FieldType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType">
+<span id="_CPPv3N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="_CPPv2N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsField__LGraphType"></span><span class="target" id="namespacelgraph__api_1a4f4fd20c65be1aaa3f4d6e70e7d7218a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsField</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType">
+<span id="_CPPv3N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="_CPPv2N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsGraphElement__LGraphType"></span><span class="target" id="namespacelgraph__api_1a9fb9c1e160b13a90e177a8e8ec0e00fa"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsGraphElement</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType">
+<span id="_CPPv3N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="_CPPv2N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsCollection__LGraphType"></span><span class="target" id="namespacelgraph__api_1a82cc6a5df4119f903835efab9edbf4fe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsCollection</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType">
+<span id="_CPPv3N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="_CPPv2N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsAny__LGraphType"></span><span class="target" id="namespacelgraph__api_1aca1c7356409eb19c5deab724bc4fff2d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsAny</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE10LGraphType">
+<span id="_CPPv3N10lgraph_api9to_stringE10LGraphType"></span><span id="_CPPv2N10lgraph_api9to_stringE10LGraphType"></span><span id="lgraph_api::to_string__LGraphType"></span><span class="target" id="namespacelgraph__api_1a5113ccea82007fb6b30d591032637775"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType">
+<span id="_CPPv3N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="_CPPv2N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="lgraph_api::PluginCodeTypeStr__PluginCodeType"></span><span class="target" id="namespacelgraph__api_1ad94969b6b33bfee0e009c16ba50623a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeTypeStr</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="lgraph_api::PluginCodeType"><span class="n"><span class="pre">PluginCodeType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code_type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the name of plugin code types. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpecE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpecE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpecE"></span><span id="lgraph_api::CompositeIndexSpec"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CompositeIndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A composite index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec5labelE"></span><span id="lgraph_api::CompositeIndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec5labelE" title="Permalink to this definition"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec6fieldsE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec6fieldsE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec6fieldsE"></span><span id="lgraph_api::CompositeIndexSpec::fields__std::vector:ss:"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1acf26f1505f276ea0dbf631c4bf19727a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fields</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec6fieldsE" title="Permalink to this definition"></a><br></dt>
+<dd><p>fields name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec4typeE"></span><span id="lgraph_api::CompositeIndexSpec::type__CompositeIndexType"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1a2112c9c8e7921d5119a2aac88189e894"></span><a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="lgraph_api::CompositeIndexType"><span class="n"><span class="pre">CompositeIndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec4typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptionsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptionsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptionsE"></span><span id="lgraph_api::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Edge label options, contain fields only edge have. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-types">Public Types</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TemporalFieldOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439ac6e421eaad140c1bc1a39980502df80c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ASC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439a65a6d757dbb571ccc3af9706e9a5f607"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DESC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="lgraph_api::EdgeOptions::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5708a1309a1260a1c5a7208f9d7f25c2"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="lgraph_api::EdgeOptions::EdgeOptions__EdgeConstraintsCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5a91f7f6cbcd9600e96add55f510a9d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="lgraph_api::EdgeOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions5clearEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions5clearEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions5clearEv"></span><span id="lgraph_api::EdgeOptions::clear"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions5clearEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="lgraph_api::EdgeOptions::edge_constraints__EdgeConstraints"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ab879b0258a59289c195a102d07ae88bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_constraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="lgraph_api::EdgeOptions::temporal_field__ss"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aed02035800f19fa3eb75108a4ed4489a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="lgraph_api::EdgeOptions::temporal_field_order__lgraph_api::EdgeOptions::TemporalFieldOrder"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a7e866158b92a86c3db1a2db0ad830104"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field_order</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="lgraph_api::EdgeOptions::TemporalFieldOrder::ASC"><span class="n"><span class="pre">ASC</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder">
+<span id="_CPPv3N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="_CPPv2N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="lgraph_api::EdgeOptions::to_string__TemporalFieldOrderCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a02b8f61202a7e3f790caaaece23d1cfc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUidE">
+<span id="_CPPv3N10lgraph_api7EdgeUidE"></span><span id="_CPPv2N10lgraph_api7EdgeUidE"></span><span id="lgraph_api::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUidE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="lgraph_api::EdgeUid::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ac4a49320d7fa2c7fba9bdad45e49e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="lgraph_api::EdgeUid::EdgeUid__int64_t.int64_t.uint16_t.int64_t.int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a3ecba2c59d236b1b4f042d4274f51264"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">l</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">e</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7ReverseEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7ReverseEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7ReverseEv"></span><span id="lgraph_api::EdgeUid::Reverse"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae1b551cc51c9d556342b27b466a7c7cb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reverse</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7ReverseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reverses side of this edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::eq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae10ec79b489d4c829b1b28a4c14b7f7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidneERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidneERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidneERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::neq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a6f4701506d51e0489c36edf7251e9acd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidneERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::lt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1afde4cbd02b63c9acd53e61d5e49787e6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::gt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a92818596b49b9fd47fa4b4ce4c203094"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid8ToStringEv">
+<span id="_CPPv3NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="_CPPv2NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="lgraph_api::EdgeUid::ToStringC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of this object. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3srcE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3srcE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3srcE"></span><span id="lgraph_api::EdgeUid::src__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7d1e8afde8407667e51f6de0ba9d6453"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3srcE" title="Permalink to this definition"></a><br></dt>
+<dd><p>source vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3dstE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3dstE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3dstE"></span><span id="lgraph_api::EdgeUid::dst__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1adbdebae8daea6c03c200361fa8840a80"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3dstE" title="Permalink to this definition"></a><br></dt>
+<dd><p>destination vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3lidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3lidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3lidE"></span><span id="lgraph_api::EdgeUid::lid__uint16_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a16870a9bf8dc2c31ee3c874d7adbd02a"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3lidE" title="Permalink to this definition"></a><br></dt>
+<dd><p>label id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3tidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3tidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3tidE"></span><span id="lgraph_api::EdgeUid::tid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a523c7bbc2f001feab204b52b533f7c87"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3tidE" title="Permalink to this definition"></a><br></dt>
+<dd><p>timestamp </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3eidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3eidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3eidE"></span><span id="lgraph_api::EdgeUid::eid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ea4961b92589517fd8cfafc0f945033"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3eidE" title="Permalink to this definition"></a><br></dt>
+<dd><p>additional edge id to distinguish edges with the same tid </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="lgraph_api::EdgeUid::AnyEdge"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ab5a73d71df790d8768376a4d13608773"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AnyEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of in-coming edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of out-going edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataE">
+<span id="_CPPv3N10lgraph_api9FieldDataE"></span><span id="_CPPv2N10lgraph_api9FieldDataE"></span><span id="lgraph_api::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A class that represents variant type. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEv">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEv"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEv"></span><span id="lgraph_api::FieldData::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a33d34623467e64a3352cd10e53c85ca5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEb">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEb"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEb"></span><span id="lgraph_api::FieldData::FieldData__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a06ad1d80ad369afa643075cbe87f02ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="lgraph_api::FieldData::FieldData__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a265c89b1a86a0bbad89cf42661828f8c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="lgraph_api::FieldData::FieldData__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7e0e988dd1d89abbdacbf4d99fd7b2bf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="lgraph_api::FieldData::FieldData__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1aea814e9fb09dda664977d12f5b350d57"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="lgraph_api::FieldData::FieldData__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a38a8108c47e489a360ebece5e593ca7f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEf">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEf"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEf"></span><span id="lgraph_api::FieldData::FieldData__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab8122e35f0b0a42212299fb31ba8cf8d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEf" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEd">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEd"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEd"></span><span id="lgraph_api::FieldData::FieldData__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad56e5648c7943ef08a593aaf5c231985"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEd" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="lgraph_api::FieldData::FieldData__DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a484a31f1c0cba4531908a803a1782258"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="lgraph_api::FieldData::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="lgraph_api::FieldData::FieldData__DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a870fede3129fb7b07d10096b7adf796f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="lgraph_api::FieldData::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50384efa457e9883b378314910e01ccc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d1752cfc22854c2c44381b0a443fb56"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="lgraph_api::FieldData::FieldData__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a28485df6381f6dc1ba4b30a8087e39fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="lgraph_api::FieldData::FieldData__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a72fde0d7ac627644c3dff536d09a45f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aff76c6792c66514d775ba8be88b789ab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a388fd3199bf652332ce922fe0a25f145"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad19f579289333ecf8515aae8f3bb903a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aafaa13b9ee556736c8992f555e99eda6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a393d9735468c278ddf48b9cf8ef95891"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a59b4b116bc89bf0718ba25b9749c2cce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac81b0f4a81a11954f3afcaa9872b396b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5da2cfc866cfdbe5db69ba9ef1dab2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataD0Ev">
+<span id="_CPPv3N10lgraph_api9FieldDataD0Ev"></span><span id="_CPPv2N10lgraph_api9FieldDataD0Ev"></span><span id="lgraph_api::FieldData::~FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6e58de1884451d88a24994e2875b1d6a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a74cb11c1f4f0a79d6f7a278fc84074ba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5a88873a071ad0c03bcf2c2a498e90bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac721aa38df96b34b841cd4bbc608abdf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b27ecbef11936a80c911800629edd46"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERR9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7integerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7integerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7integerEv"></span><span id="lgraph_api::FieldData::integerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1e5b6bc8e5ac95ae151fdaf8894201e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">integer</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7integerEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as int64. Valid only when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is of INT8, INT16, INT32, or INT64 types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of int types.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>An int64_t. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData4realEv">
+<span id="_CPPv3NK10lgraph_api9FieldData4realEv"></span><span id="_CPPv2NK10lgraph_api9FieldData4realEv"></span><span id="lgraph_api::FieldData::realC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a3f678878dde3a729f94dfefbdc4ef2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">real</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData4realEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as a double. The <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> must be of FLOAT or DOUBLE types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown if the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of FLOAT or DOUBLE types.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A double. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6stringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6stringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6stringEv"></span><span id="lgraph_api::FieldData::stringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7314f49a51859d46439cfeddb9ea06ec"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6stringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as std::string. Valid only for STRING, BLOB and SPATIAL. BLOB data is returned as-is, since std::string can also hold byte array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when a bad cast error condition occurs.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A reference to a const std::string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBoolEv"></span><span id="lgraph_api::FieldData::AsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac488187ef67bf8905cbe686daab95183"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBoolEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="lgraph_api::FieldData::AsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0094a31af359f4684c261a56f780cfb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsInt8Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="lgraph_api::FieldData::AsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aaca113d03918222c50977a094b75c2d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt16Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="lgraph_api::FieldData::AsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0cc24eb0e06a5f5b5476f5739b6ae51e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt32Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="lgraph_api::FieldData::AsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a16e138db4d9a0defc0ab8f03a7864d65"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt64Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsFloatEv"></span><span id="lgraph_api::FieldData::AsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8f86682f960b846e1c3a59eb7fc6ae95"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsFloatEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="lgraph_api::FieldData::AsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2894e904ceb04109370957ba7c48e189"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsDoubleEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1accfbae3969f742ce3621560fee34dbda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Date</span> <span class="pre">AsDate</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1abd4d1fc803c662e145761278c129d3c9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::DateTime</span> <span class="pre">AsDateTime</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsStringEv"></span><span id="lgraph_api::FieldData::AsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5e3562cda960da001597e7dd5679b140"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsStringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBlobEv"></span><span id="lgraph_api::FieldData::AsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9a5a106b2ee0d6fa3c78592852682f0b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBlobEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="lgraph_api::FieldData::AsBase64BlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1afc4b6bc9a7a4d42a981579e04b86b3a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBase64Blob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a8128129ec0fa7689772f0c437fe93a1f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::SRID</span> <span class="pre">GetSRID</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a26726ddebb182026865e77b4e68f8f53"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a31ea41c18cb7507bfefbb18971a3dd0e"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ad5f639edaa8b36e90cff7192554b8723"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1aaef5ea8cbde81ad51459f035a99bdd7f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a7fce7150c8ad873933a8028b16a72a69"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a0015550261b9e976e07e61a3d5790fda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1afb01ecb2663024f0adedfcfe05928d45"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ade0f7fe05edb1eb43c1f4057275967f9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6ToBoltEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6ToBoltEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6ToBoltEv"></span><span id="lgraph_api::FieldData::ToBoltC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3b294f10df124b9d290c7d8fb37e1243"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToBolt</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6ToBoltEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::ToString__ssCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5290ed610cdd3fb38c0d09be107dce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">null_value</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"NUL"</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of this <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="lgraph_api::FieldData::eq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1360e03268a1c10e4a40573e61f2f5ae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataneERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="lgraph_api::FieldData::neq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade1a5ee8968dbf6e7656e5adf96be546"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataneERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="lgraph_api::FieldData::gt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a936f13e9913fde88ff4beb6ba8cabbba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatageERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="lgraph_api::FieldData::gte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9dbdaf01c34ed106fe44fb5f4df2a43b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatageERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataltERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="lgraph_api::FieldData::lt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b808b6437787ab0de4133d7f1cd077"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataltERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataleERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="lgraph_api::FieldData::lte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a34d5df1f1114d3fe8c15bce452736680"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataleERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7GetTypeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7GetTypeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7GetTypeEv"></span><span id="lgraph_api::FieldData::GetTypeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aacf5cac64e0e4e0fba5962f6f1ecf925"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7GetTypeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7is_nullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7is_nullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7is_nullEv"></span><span id="lgraph_api::FieldData::is_nullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a54e61d2bb6c2a58d7b98180555af09e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_null</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7is_nullEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6is_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6is_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6is_bufEv"></span><span id="lgraph_api::FieldData::is_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a49ddf20e31700f6609ffa379f0d25a8f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6is_bufEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="lgraph_api::FieldData::is_empty_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade6523aa6dc019354f36c47aeb4dfd21"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_empty_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsNullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsNullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsNullEv"></span><span id="lgraph_api::FieldData::IsNullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac4d637a0dec45d546495c1660c9f6047"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsNull</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsNullEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is null. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBoolEv"></span><span id="lgraph_api::FieldData::IsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec3bdef27fa2d4de29db82d2334ad2d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBoolEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is bool. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBlobEv"></span><span id="lgraph_api::FieldData::IsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50d95767570c5cc1599c634b7b33e916"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBlobEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is BLOB. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsStringEv"></span><span id="lgraph_api::FieldData::IsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7c412f98489e7d252ef40ed053a3908c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is string. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="lgraph_api::FieldData::IsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a325f297dbf3554c5dbb109b2dada4a43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsInt8Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT8. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="lgraph_api::FieldData::IsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefe2db06fec008bc80e0d15ab52949c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt16Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT16. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="lgraph_api::FieldData::IsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a480ddcb154c9e18b948ff3850a42c22d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt32Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT32. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="lgraph_api::FieldData::IsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b0be739d239c9d646696e1bfe3b2bae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt64Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT64. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsIntegerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="lgraph_api::FieldData::IsIntegerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8543c359835d7977b96446aaef126344"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsIntegerEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Is this a INT8, INT16, INT32 or INT64? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsFloatEv"></span><span id="lgraph_api::FieldData::IsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec0a6f81c7581924db00ea960358d91b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsFloatEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is float. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="lgraph_api::FieldData::IsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a300a2e608e8144e2fbe4588729dd34e3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsDoubleEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is double. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsRealEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsRealEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsRealEv"></span><span id="lgraph_api::FieldData::IsRealC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab6d49b63cf486d609f6286f8b26887f9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsRealEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Is this a FLOAT or DOUBLE? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsDateEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsDateEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsDateEv"></span><span id="lgraph_api::FieldData::IsDateC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8aa76d397e0e2b1d0cb09487316210cc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsDateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is date. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="lgraph_api::FieldData::IsDateTimeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1b1b2b6676359ff4d4ec77eb7e7ee62e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is date time. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsPointEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsPointEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsPointEv"></span><span id="lgraph_api::FieldData::IsPointC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab50e9ff6a50f06668ea577fe1d963a8b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsPointEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is Point. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12IsLineStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="lgraph_api::FieldData::IsLineStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a795fc6d4d17d385f07d87f82bb247c45"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsLineString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12IsLineStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is LineString. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsPolygonEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="lgraph_api::FieldData::IsPolygonC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a57c2b6137c6ae390b86d5f341b900992"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPolygon</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsPolygonEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is Polygon. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsSpatialEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="lgraph_api::FieldData::IsSpatialC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad51d37e3d848990cec85e7de187309fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsSpatial</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsSpatialEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is spatial. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4typeE">
+<span id="_CPPv3N10lgraph_api9FieldData4typeE"></span><span id="_CPPv2N10lgraph_api9FieldData4typeE"></span><span id="lgraph_api::FieldData::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7booleanE">
+<span id="_CPPv3N10lgraph_api9FieldData7booleanE"></span><span id="_CPPv2N10lgraph_api9FieldData7booleanE"></span><span id="lgraph_api::FieldData::boolean__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a857e4e5a2613b7cf584dbf12dae00525"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">boolean</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7booleanE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4int8E">
+<span id="_CPPv3N10lgraph_api9FieldData4int8E"></span><span id="_CPPv2N10lgraph_api9FieldData4int8E"></span><span id="lgraph_api::FieldData::int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae0a430ab8199def132f3f07af5c84066"></span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4int8E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int16E">
+<span id="_CPPv3N10lgraph_api9FieldData5int16E"></span><span id="_CPPv2N10lgraph_api9FieldData5int16E"></span><span id="lgraph_api::FieldData::int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7cd86ccaa2b7be3ef15423f3f58e929e"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int16E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int32E">
+<span id="_CPPv3N10lgraph_api9FieldData5int32E"></span><span id="_CPPv2N10lgraph_api9FieldData5int32E"></span><span id="lgraph_api::FieldData::int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f658422e832e5e2d56e2245cb84be84"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int32E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int64E">
+<span id="_CPPv3N10lgraph_api9FieldData5int64E"></span><span id="_CPPv2N10lgraph_api9FieldData5int64E"></span><span id="lgraph_api::FieldData::int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a45d113f8d303eebb3734306531862812"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int64E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2spE">
+<span id="_CPPv3N10lgraph_api9FieldData2spE"></span><span id="_CPPv2N10lgraph_api9FieldData2spE"></span><span id="lgraph_api::FieldData::sp__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8d3eff5289da252b05248e40c1cd8188"></span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">sp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2spE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2dpE">
+<span id="_CPPv3N10lgraph_api9FieldData2dpE"></span><span id="_CPPv2N10lgraph_api9FieldData2dpE"></span><span id="lgraph_api::FieldData::dp__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae571d69d755e366904e8663a4c643901"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2dpE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData3bufE">
+<span id="_CPPv3N10lgraph_api9FieldData3bufE"></span><span id="_CPPv2N10lgraph_api9FieldData3bufE"></span><span id="lgraph_api::FieldData::buf__ssP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00201fbea83f2e7a263f58098aa98cd7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">buf</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData3bufE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4dataE">
+<span id="_CPPv3N10lgraph_api9FieldData4dataE"></span><span id="_CPPv2N10lgraph_api9FieldData4dataE"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b1a03093018acfa0d961cae96146f6"></span><span class="k"><span class="pre">union</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">[anonymous]</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BoolEb">
+<span id="_CPPv3N10lgraph_api9FieldData4BoolEb"></span><span id="_CPPv2N10lgraph_api9FieldData4BoolEb"></span><span id="lgraph_api::FieldData::Bool__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbaec39a10e97bfc380b60052450b22b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Bool</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BoolEb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4Int8E6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="lgraph_api::FieldData::Int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbc62444e525fdbd056581b349b2a7ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int8</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4Int8E6int8_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int16E7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="lgraph_api::FieldData::Int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f690c1758c4620ba79e4b03bf703531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int16</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int16E7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int32E7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="lgraph_api::FieldData::Int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a99c13db42b1525365635d10480b7d4ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int32</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int32E7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int64E7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="lgraph_api::FieldData::Int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7301552563e8fae5960de9efe235959b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int64</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int64E7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5FloatEf">
+<span id="_CPPv3N10lgraph_api9FieldData5FloatEf"></span><span id="_CPPv2N10lgraph_api9FieldData5FloatEf"></span><span id="lgraph_api::FieldData::Float__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a326651bedfdc7a8f5743e42b7264003b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Float</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5FloatEf" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6DoubleEd">
+<span id="_CPPv3N10lgraph_api9FieldData6DoubleEd"></span><span id="_CPPv2N10lgraph_api9FieldData6DoubleEd"></span><span id="lgraph_api::FieldData::Double__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5304168443248acb485e7e600e150feb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Double</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6DoubleEd" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="lgraph_api::FieldData::Date__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a88a43a9fe1328b1c06a36f469c286b29"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="lgraph_api::FieldData::Date__lgraph_api::DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a217032b1e975d7f3e8c81d0b10ef2eaa"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="lgraph_api::FieldData::DateTime__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a07cfe75d33077c683aa297554049e1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="lgraph_api::FieldData::DateTime__lgraph_api::DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00245f8fabb288c073b2b8b6310c95ae"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a46cdb6bb8f5ed9047595d8a0559960f9"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0abb491f06b5016de61c1a37dc22cca1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc"></span><span id="lgraph_api::FieldData::String__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefd38e03044cc9574ec9f82f8d8646db"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="lgraph_api::FieldData::String__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0500c9ca63c2c826c5f957706676717a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa6b8639fdb113bf8fe4a6556a161386e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1aa9bc69d37ba46872d769a6678058f5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="lgraph_api::FieldData::Point__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aed6deea650cc82d203060e3db07d2d3b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aadeac21d00b14c4fe99ca7356b38c4c5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1134a797ff8e36b78b12ffa26d3fe7ea"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::LineString__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1af7a37b2d5b7065e5f077d5ed9c203c6a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a89db7b33c84d04f622917e6096f32677"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac595c7685df74f6f1e439c1f14b4fb5c"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="lgraph_api::FieldData::Polygon__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac2f0d143ec079d8c6e6d340d383f0ee1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0051c95b3f512cf741e877d7d84e4298"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac60a663a7f4b31bc4a2ff727d6632f00"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="lgraph_api::FieldData::Spatial__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a32852c0236f9dab9f44a4ad88026f3d1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6277538e024b6bce57fed9ff337fd973"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa40480bb254330540b587feb99e8cded"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="lgraph_api::FieldData::Blob__std::vector:uint8_t:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a07c0ced9778df1c5fed3a4663cc45abd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint8_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructs a Blob from vector of uint8_t, treated as byte array. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="lgraph_api::FieldData::BlobFromBase64__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa1ff897ed22d2524b5caaedb4aadb3dd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BlobFromBase64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">base64_encoded</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructs a BLOB from Base64 encoded string. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="lgraph_api::FieldData::IsBufType__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1abbb98d7d3792559fa61cca3554aeaba7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBufType</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if ‘t’ is BLOB or STRING. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="lgraph_api::FieldData::IsInteger__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae00a13411b0557d842ffb8ea5f89e413"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if ‘t’ is INT8, 16, 32, or 64. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="lgraph_api::FieldData::IsReal__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a884ee60f7e50a01ab3a12179298fb9cb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if ‘t’ is FLLOAT or DOUBLE. </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpecE">
+<span id="_CPPv3N10lgraph_api9FieldSpecE"></span><span id="_CPPv2N10lgraph_api9FieldSpecE"></span><span id="lgraph_api::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Specification for a field. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="lgraph_api::FieldSpec::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1abfe187a3e79a4445a5270bba3bfaf72c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssCR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a8428f3af5f513d918d94feb5c78fa7e0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>n</strong> – Field name </p></li>
+<li><p><strong>t</strong> – Field type </p></li>
+<li><p><strong>nu</strong> – True if field is optional </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssRR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ada0df81c60e30bca34ba912a11fcdd9f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec">
+<span id="_CPPv3NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="_CPPv2NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="lgraph_api::FieldSpec::eq-operator__FieldSpecCRC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ac1104e4f8ee3666f766a09745b03836d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpec8ToStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="lgraph_api::FieldSpec::ToStringC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpec8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the string representation of the <a class="reference internal" href="#structlgraph__api_1_1FieldSpec"><span class="std std-ref">FieldSpec</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4nameE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4nameE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4nameE"></span><span id="lgraph_api::FieldSpec::name__ss"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4nameE" title="Permalink to this definition"></a><br></dt>
+<dd><p>name of the field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4typeE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4typeE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4typeE"></span><span id="lgraph_api::FieldSpec::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4typeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>type of that field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec8optionalE">
+<span id="_CPPv3N10lgraph_api9FieldSpec8optionalE"></span><span id="_CPPv2N10lgraph_api9FieldSpec8optionalE"></span><span id="lgraph_api::FieldSpec::optional__b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a1b3b38329495fc55fd443dfa2246337b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">optional</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec8optionalE" title="Permalink to this definition"></a><br></dt>
+<dd><p>is this field optional? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpecE">
+<span id="_CPPv3N10lgraph_api9IndexSpecE"></span><span id="_CPPv2N10lgraph_api9IndexSpecE"></span><span id="lgraph_api::IndexSpec"></span><span class="target" id="structlgraph__api_1_1IndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>An index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5labelE"></span><span id="lgraph_api::IndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5labelE" title="Permalink to this definition"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5fieldE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5fieldE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5fieldE"></span><span id="lgraph_api::IndexSpec::field__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a97bab0e4c0ea8b12272a606c825360e7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5fieldE" title="Permalink to this definition"></a><br></dt>
+<dd><p>field name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api9IndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api9IndexSpec4typeE"></span><span id="lgraph_api::IndexSpec::type__IndexType"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1ac8263343d7a58ec888a110427f522b64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec4typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsE">
+<span id="_CPPv3N10lgraph_api12LabelOptionsE"></span><span id="_CPPv2N10lgraph_api12LabelOptionsE"></span><span id="lgraph_api::LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelOptions</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Label options, base class, define some common fields and methods. </p>
+<p>Subclassed by <a class="reference internal" href="#structlgraph__api_1_1EdgeOptions"><span class="std std-ref">EdgeOptions</span></a>, <a class="reference internal" href="#structlgraph__api_1_1VertexOptions"><span class="std std-ref">VertexOptions</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api12LabelOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="lgraph_api::LabelOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a630c29d66f94446c4292172285d61492"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api12LabelOptions9to_stringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions5clearEv">
+<span id="_CPPv3N10lgraph_api12LabelOptions5clearEv"></span><span id="_CPPv2N10lgraph_api12LabelOptions5clearEv"></span><span id="lgraph_api::LabelOptions::clear"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a5eeb94d22b8366d1b68d0614384802fe"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions5clearEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsD0Ev">
+<span id="_CPPv3N10lgraph_api12LabelOptionsD0Ev"></span><span id="_CPPv2N10lgraph_api12LabelOptionsD0Ev"></span><span id="lgraph_api::LabelOptions::~LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a0c56bbf380b6ce74a532637b65f7e7a4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~LabelOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions15detach_propertyE">
+<span id="_CPPv3N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="_CPPv2N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="lgraph_api::LabelOptions::detach_property__b"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a6057cc32d98316ec805c453db60c48ef"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">detach_property</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions15detach_propertyE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ParameterE">
+<span id="_CPPv3N10lgraph_api9ParameterE"></span><span id="_CPPv2N10lgraph_api9ParameterE"></span><span id="lgraph_api::Parameter"></span><span class="target" id="structlgraph__api_1_1Parameter"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parameter</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ParameterE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>The parameter of procedure/plugin. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4nameE">
+<span id="_CPPv3N10lgraph_api9Parameter4nameE"></span><span id="_CPPv2N10lgraph_api9Parameter4nameE"></span><span id="lgraph_api::Parameter::name__ss"></span><span class="target" id="structlgraph__api_1_1Parameter_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4nameE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter5indexE">
+<span id="_CPPv3N10lgraph_api9Parameter5indexE"></span><span id="_CPPv2N10lgraph_api9Parameter5indexE"></span><span id="lgraph_api::Parameter::index__i"></span><span class="target" id="structlgraph__api_1_1Parameter_1a750b5d744c39a06bfb13e6eb010e35d0"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">index</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter5indexE" title="Permalink to this definition"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>name of the parameter </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4typeE">
+<span id="_CPPv3N10lgraph_api9Parameter4typeE"></span><span id="_CPPv2N10lgraph_api9Parameter4typeE"></span><span id="lgraph_api::Parameter::type__LGraphType"></span><span class="target" id="structlgraph__api_1_1Parameter_1ac8ec89e84ffc9d1ffe1b030f61a76e44"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4typeE" title="Permalink to this definition"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>index of the parameter list in which the parameter stay </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfoE">
+<span id="_CPPv3N10lgraph_api8RoleInfoE"></span><span id="_CPPv2N10lgraph_api8RoleInfoE"></span><span id="lgraph_api::RoleInfo"></span><span class="target" id="structlgraph__api_1_1RoleInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RoleInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfoE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the role. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo4descE">
+<span id="_CPPv3N10lgraph_api8RoleInfo4descE"></span><span id="_CPPv2N10lgraph_api8RoleInfo4descE"></span><span id="lgraph_api::RoleInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo4descE" title="Permalink to this definition"></a><br></dt>
+<dd><p>description </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo12graph_accessE">
+<span id="_CPPv3N10lgraph_api8RoleInfo12graph_accessE"></span><span id="_CPPv2N10lgraph_api8RoleInfo12graph_accessE"></span><span id="lgraph_api::RoleInfo::graph_access__std::map:ss.AccessLevel:"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1ac689f8bad73d3d9b3c2a1c11f1296905"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph_access</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo12graph_accessE" title="Permalink to this definition"></a><br></dt>
+<dd><p>access levels on different graphs </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8RoleInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8RoleInfo8disabledE"></span><span id="lgraph_api::RoleInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo8disabledE" title="Permalink to this definition"></a><br></dt>
+<dd><p>is this role disabled? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpecE">
+<span id="_CPPv3N10lgraph_api7SigSpecE"></span><span id="_CPPv2N10lgraph_api7SigSpecE"></span><span id="lgraph_api::SigSpec"></span><span class="target" id="structlgraph__api_1_1SigSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SigSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec10input_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec10input_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec10input_listE"></span><span id="lgraph_api::SigSpec::input_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a4f4b1c5201f32fae15b91c8a51021f63"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">input_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec10input_listE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec11result_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec11result_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec11result_listE"></span><span id="lgraph_api::SigSpec::result_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a23e292d0e3f983f3ceba15f9f6249209"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec11result_listE" title="Permalink to this definition"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>input parameter list </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfoE">
+<span id="_CPPv3N10lgraph_api8UserInfoE"></span><span id="_CPPv2N10lgraph_api8UserInfoE"></span><span id="lgraph_api::UserInfo"></span><span class="target" id="structlgraph__api_1_1UserInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UserInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfoE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the user. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo4descE">
+<span id="_CPPv3N10lgraph_api8UserInfo4descE"></span><span id="_CPPv2N10lgraph_api8UserInfo4descE"></span><span id="lgraph_api::UserInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo4descE" title="Permalink to this definition"></a><br></dt>
+<dd><p>description of the user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo5rolesE">
+<span id="_CPPv3N10lgraph_api8UserInfo5rolesE"></span><span id="_CPPv2N10lgraph_api8UserInfo5rolesE"></span><span id="lgraph_api::UserInfo::roles__std::set:ss:"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1f4c5a9d9b2a7c1022128d3201f03648"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">roles</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo5rolesE" title="Permalink to this definition"></a><br></dt>
+<dd><p>roles of this user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8UserInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8UserInfo8disabledE"></span><span id="lgraph_api::UserInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo8disabledE" title="Permalink to this definition"></a><br></dt>
+<dd><p>is this user disabled? </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo12memory_limitE">
+<span id="_CPPv3N10lgraph_api8UserInfo12memory_limitE"></span><span id="_CPPv2N10lgraph_api8UserInfo12memory_limitE"></span><span id="lgraph_api::UserInfo::memory_limit__s"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1943ac86ca89eaf251c01c16772dfc00"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">memory_limit</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo12memory_limitE" title="Permalink to this definition"></a><br></dt>
+<dd><p>memory limit for this user </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptionsE">
+<span id="_CPPv3N10lgraph_api13VertexOptionsE"></span><span id="_CPPv2N10lgraph_api13VertexOptionsE"></span><span id="lgraph_api::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Vertex label options, contain fields only vertex have. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="lgraph_api::VertexOptions::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1afd0ea869dba2b64723f3643ef5f6d2df"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="lgraph_api::VertexOptions::VertexOptions__ssCR"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac769e8bf000b16416a763894714829c7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">primary_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api13VertexOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="lgraph_api::VertexOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api13VertexOptions9to_stringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions5clearEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions5clearEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions5clearEv"></span><span id="lgraph_api::VertexOptions::clear"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions5clearEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13primary_fieldE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="lgraph_api::VertexOptions::primary_field__ss"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1a72852ec13f99950d76332fad99c71dd0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">primary_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13primary_fieldE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-utils">
+<h2>lgraph_utils<a class="headerlink" href="#lgraph-utils" title="Permalink to this headline"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv44json">
+<span id="_CPPv34json"></span><span id="_CPPv24json"></span><span class="target" id="lgraph__utils_8h_1ab701e3ac61a85b337ec5c1abaad6742d"></span><span class="k"><span class="pre">using</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">json</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><a class="headerlink" href="#_CPPv44json" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8get_timeEv">
+<span id="_CPPv3N10lgraph_api8get_timeEv"></span><span id="_CPPv2N10lgraph_api8get_timeEv"></span><span id="lgraph_api::get_time"></span><span class="target" id="namespacelgraph__api_1ab3691fc022301a72d8cb766dc0c17fdf"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">get_time</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8get_timeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Digit value of current time. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE">
+<span id="_CPPv3N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="_CPPv2N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="lgraph_api::split_string__ss.std::vector:ss:R.ss"></span><span class="target" id="namespacelgraph__api_1ae25400b1a7ff2282865cd3cc2353a536"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">split_string</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">origin_string</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sub_strings</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">string_delimiter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Split the original string by format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>origin_string</strong> – original string to be split. </p></li>
+<li><p><strong>sub_strings</strong> – split substring. </p></li>
+<li><p><strong>string_delimiter</strong> – Split format. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE">
+<span id="_CPPv3N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="_CPPv2N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="lgraph_api::rc4__ssR.ss.ss"></span><span class="target" id="namespacelgraph__api_1a985e409c942e1068d32b795a27024122"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">rc4</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">key</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mode</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encrypt the input string in ac4 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>input</strong> – input string. </p></li>
+<li><p><strong>key</strong> – encryption key. </p></li>
+<li><p><strong>mode</strong> – encryption mode </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13encode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="lgraph_api::encode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a2e5f53c59cee61047cb4e283fb6c1950"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">encode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13encode_base64EKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encode the input string in encode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13decode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="lgraph_api::decode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a047800adaceb796bbb0eb71c016e4fa3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">decode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13decode_base64EKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Decode the input string in decode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Decrypted string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12alloc_bufferE6size_t">
+<span id="_CPPv3N10lgraph_api12alloc_bufferE6size_t"></span><span id="_CPPv2N10lgraph_api12alloc_bufferE6size_t"></span><span id="lgraph_api::alloc_buffer__s"></span><span class="target" id="namespacelgraph__api_1a3274ccf2c4d0f0990a6edbdee20109c4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">alloc_buffer</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12alloc_bufferE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Allocate memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>bytes</strong> – Size in byte of request memory. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Pointer of allocated memory. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t">
+<span id="_CPPv3N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="_CPPv2N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="lgraph_api::dealloc_buffer__voidP.s"></span><span class="target" id="namespacelgraph__api_1ad6721e43c2327ad8e4c6e19c0996a770"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dealloc_buffer</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buffer</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Free memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>buffer</strong> – Size in bytes of request memory </p></li>
+<li><p><strong>bytes</strong> – Pointer of memory to free. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ae22fdc516fa3fd1ee7f8ad22d877bc64"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a54668379bc6d79cb28f24c532d6ceb28"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse vector parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="lgraph_api::GetVidFromNodeString__ssCR"></span><span class="target" id="namespacelgraph__api_1aa24b1e990b795a8d59c369760c930c7f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVidFromNodeString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">node_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse vid from the node passed in by cypher. For V2 procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>node_string</strong> – <strong>[in]</strong> node </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>vid </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-index-iterator">
+<h2>lgraph_vertex_index_iterator<a class="headerlink" href="#lgraph-vertex-index-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorE"></span><span id="lgraph_api::VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> can be used to access a set of vertices that has the same indexed value. If the index is unique (that is, each vertex has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> will only have one VertexId, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> is valid iff it points to a valid (index_value, vid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a73eb49fc5a21c2eab2d862fb07231061"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1adf8da63a296279030584c1d539dfc7e0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="lgraph_api::VertexIndexIterator::~VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a4a5611b7ffb02851074518d929862608"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="lgraph_api::VertexIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="lgraph_api::VertexIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="lgraph_api::VertexIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next vertex id in the list, which consists of all the valid vertex ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::VertexIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the current index value. The vids are sorted in (IndexValue, Vid) order. When <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one vid to next, possibly moving from one IndexValue to another. This function tells the IndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="lgraph_api::VertexIndexIterator::GetVidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a89f7ed3f184862498c0df7d87b97a1b4"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the current vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The current vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__lgraph::VertexIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a8adfcdcf8d9abeee72c3da1b9f21edaa"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae8421018f7913edfc4d82d2c0f209085"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1abe6ca171051639d874dbfb573a9d4cb3"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator3it_E"></span><span id="lgraph_api::VertexIndexIterator::it___std::unique_ptr:lgraph::VertexIndexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae02cf2beed475be9b6af2ddacf99f077"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="lgraph_api::VertexIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-iterator">
+<h2>lgraph_vertex_iterator<a class="headerlink" href="#lgraph-vertex-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> can be used to iterate through vertices in the DB. Vertices are sorted according to vertex id in the DB. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> is valid iff it points to a valid vertex. Calling method functions on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> for non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> with the id of a non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"><span class="std std-ref">Delete()</span></a> on the last vertex. </p></li>
+</ol>
+<p></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7888300a9ddafc0d6814c54b7d2f1f11"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac4f5daf4ebb180eb1a0c9d1ba024bf38"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14VertexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14VertexIteratorD0Ev"></span><span id="lgraph_api::VertexIterator::~VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ab031829b35061e00c09bf2f5c951063f"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator5CloseEv"></span><span id="lgraph_api::VertexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator4NextEv"></span><span id="lgraph_api::VertexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, otherwise return false (no more vertex) and invalidate the iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb">
+<span id="_CPPv3N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="_CPPv2N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="lgraph_api::VertexIterator::Goto__int64_t.b"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Goto the vertex with id src. If there is no vertex with exactly the same vid, and nearest==true, go to the next vertex with id&gt;=vid, otherwise return false and invalidate the iterator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vid</strong> – Vertex id of the vertex to go. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to go to the closest vertex with id&gt;=vid.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false (no such vertex). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator5GetIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="lgraph_api::VertexIterator::GetIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a9fedaf26513596c151c16f829b47038e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator5GetIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a594a8927f27893b46f4f8ce547b5e558"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the first out-going edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1abb6aadfa764244d29f6458a40f5c4f17"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge, and nearest==false an invalid iterator is returned. If the specified out-edge does not exist, and nearest==true, get the first out-edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetInEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the first in-coming edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetInEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a1013d34130e78bd8715e7b7a0759b578"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge and nearest==false, an invalid iterator is returned. If the specified edge does not exist and nearest==true,. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="lgraph_api::VertexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="lgraph_api::VertexIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the label of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="lgraph_api::VertexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="lgraph_api::VertexIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="lgraph_api::VertexIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="lgraph_api::VertexIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>all fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListSrcVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a910d02e24a65995a2784e2028d6244ac"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListSrcVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>List source vids. Each source vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>List of source vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListDstVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1add92b73ced9e72b3b87fa80f486c27a9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListDstVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>List destination vids. Each vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit of number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>List of desitnation vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumInEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1acba67b0fdb21bf78555353cf53fb4f6f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of incoming edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of in-coming edges to count. When the limit is reached, n_limit is returned. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of incoming edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumOutEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a273dc0f4b8ddf828a89ae68748ed0c74"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of out-going edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of out-going edges to count. When the limit is reached, n_limit is returned and limit_exceeded is set to true. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of out-going edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t">
+<span id="_CPPv3N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="_CPPv2N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="lgraph_api::VertexIterator::Delete__sP.sP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_in_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_out_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes this vertex, also deletes all incoming and outgoing edges of this vertex. The iterator will point to the next vertex by vid if there is any. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_in_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of in edges the vertex had. </p></li>
+<li><p><strong>n_out_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of out edges the vertex had. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="lgraph_api::VertexIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the string representation of this vertex. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIterator::VertexIterator__lgraph::graph::VertexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a77858ba7e00cd9e8676e4b168d95f931"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a4b166320bbbeadd713f612c540094bf9"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a25e24a42419e107fee77196a8a9fc488"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator3it_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator3it_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator3it_E"></span><span id="lgraph_api::VertexIterator::it___std::unique_ptr:lgraph::graph::VertexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a26ee2d6416d9ad738ce344fb2b1a2972"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator4txn_E"></span><span id="lgraph_api::VertexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-base">
+<h2>olap_base<a class="headerlink" href="#olap-base" title="Permalink to this headline"></a></h2>
+<p>This is an implementation of the TuGraph graph analytics engine. The graph analytics engine is a general-purpose processing engine useful for implementing various graph analytics algorithms such as PageRank, ShortestPath, etc.. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_WORKING">
+<span class="target" id="olap__base_8h_1af8106a969b5fe14011400dcc5de93889"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_WORKING</span></span></span><a class="headerlink" href="#c.THREAD_WORKING" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_STEALING">
+<span class="target" id="olap__base_8h_1a3537fbf36165f2b4f963e4dd7462ec22"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_STEALING</span></span></span><a class="headerlink" href="#c.THREAD_STEALING" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.VERTEX_BATCH_SIZE">
+<span class="target" id="olap__base_8h_1a7655fa441302a14fb0f2f7f74ebe9e64"></span><span class="sig-name descname"><span class="n"><span class="pre">VERTEX_BATCH_SIZE</span></span></span><a class="headerlink" href="#c.VERTEX_BATCH_SIZE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.WORD_OFFSET">
+<span class="target" id="olap__base_8h_1aaa604dee271e714e574fa9a36fd57682"></span><span class="sig-name descname"><span class="n"><span class="pre">WORD_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.WORD_OFFSET" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.BIT_OFFSET">
+<span class="target" id="olap__base_8h_1a5a49e33dd4567ba395e94a35716669b6"></span><span class="sig-name descname"><span class="n"><span class="pre">BIT_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.BIT_OFFSET" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="olap__base_8h_1a539fe76ede7635af5ee150bd33d03317"></span><span class="sig-name descname"><span class="pre">union</span> <span class="pre">@5</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49neighbour">
+<span id="_CPPv39neighbour"></span><span id="_CPPv29neighbour"></span><span id="neighbour__s"></span><span class="target" id="olap__base_8h_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv49neighbour" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49edge_data">
+<span id="_CPPv39edge_data"></span><span id="_CPPv29edge_data"></span><span id="edge_data__EdgeData"></span><span class="target" id="olap__base_8h_1a24f41c52f29d0ba9636668d50ed99a63"></span><span class="n"><span class="pre">EdgeData</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv49edge_data" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43src">
+<span id="_CPPv33src"></span><span id="_CPPv23src"></span><span id="src__s"></span><span class="target" id="olap__base_8h_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv43src" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43dst">
+<span id="_CPPv33dst"></span><span id="_CPPv23dst"></span><span id="dst__s"></span><span class="target" id="olap__base_8h_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv43dst" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olapE">
+<span id="_CPPv3N10lgraph_api4olapE"></span><span id="_CPPv2N10lgraph_api4olapE"></span><span id="lgraph_api::olap"></span><span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olapE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aae"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Define the edge direction policy of graph The policy determines the graph symmetric and undirected feature. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaea17946ea357e5e0a46f7354049d684ba1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DUAL_DIRECTION</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The graph is asymmetric. The edges from input files are outgoing edges. The reversed edges form incoming edges. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeafdc4fc0261af8c2b6f66ab00eed5fe55"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAKE_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The graph is symmetric but the input files are asymmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeaa1b7f74c74bb030bf8360c598fdfc08f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INPUT_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Both the graph and the input files are symmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a944bcbf0349029631b4fbda1660df186"></span><span class="sig-name descname"><span class="pre">template&lt;typename</span> <span class="pre">EdgeData&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a6eded0577caa238e1cf59a742cbc7eeb"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum">
+<span id="_CPPv3I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span id="_CPPv2I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aaa30a5461bdf30947283236f847714e7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reduce_plus</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="Permalink to this definition"></a><br></dt>
+<dd><p>The default reduce function which uses the plus operator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a5bcc917c95bec960faafcf5506201325"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1ac8203a028b53e5841a52737f4a4f3bcd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1abf9e945446fe724862c9960198e7174f"></span><span class="sig-name descname"><span class="pre">struct</span> <span class="pre">lgraph_api::olap::EdgeStringUnit</span> <span class="pre">__attribute__</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="lgraph_api::olap::MAX_NUM_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a8b2861b30aec5ae10d4519bf3a8ce0f2"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_NUM_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The maximum number of edges. Change this value if needed. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjListE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjListE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjListE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1AdjList"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="lgraph_api::olap::AdjList::AdjList"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a8b7b96acd6306a4b7c5b74df226e6f7e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList5beginEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList5beginEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList5beginEv"></span><span id="lgraph_api::olap::AdjList::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a1b44a588619cf9b27a4cf547d290bcf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList5beginEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList3endEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList3endEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList3endEv"></span><span id="lgraph_api::olap::AdjList::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1af77a3b6fb415f06e5b56bfc9be448a70"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList3endEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjListixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap7AdjListixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap7AdjListixE6size_t"></span><span id="lgraph_api::olap::AdjList::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a62df7b80147908931b2be1c979639f43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjListixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="lgraph_api::olap::AdjList::AdjList__AdjUnit:EdgeData:P.AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a50f0d642dca2d5631b139d235bd790f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">begin</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList6begin_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList6begin_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList6begin_E"></span><span id="lgraph_api::olap::AdjList::begin___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1aaf99bb4a670e8aa9cae1d700f1e57c5c"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList6begin_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList4end_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList4end_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList4end_E"></span><span id="lgraph_api::olap::AdjList::end___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a90c044b28a9a95203b0a0c289772e178"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList4end_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">OlapBase&lt;</span> <span class="pre">EdgeData</span> <span class="pre">&gt;</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjUnit&lt;EdgeData&gt; represents an adjacent edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="lgraph_api::olap::AdjUnit::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1aacfa29d2dd368a125e50f21c115ec46f"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@4</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeStringUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeStringUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type, The vertex is of string type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="lgraph_api::olap::EdgeStringUnit::src__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1aac2e7b82f607b746d5b33c401a555ad4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="lgraph_api::olap::EdgeStringUnit::dst__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1a030e02dd512080f9859d50b7c2f10db0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeStringUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="lgraph_api::olap::EdgeStringUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8EdgeUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap8EdgeUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap8EdgeUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="lgraph_api::olap::EdgeUnit::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3srcE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="lgraph_api::olap::EdgeUnit::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3dstE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a4a58050a4c0f1da86ec007813a4ec308"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::EdgeUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@6</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap5EmptyE">
+<span id="_CPPv3N10lgraph_api4olap5EmptyE"></span><span id="_CPPv2N10lgraph_api4olap5EmptyE"></span><span id="lgraph_api::olap::Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1Empty"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Empty</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> is used for representing unweighted graphs. </p>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBaseE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBaseE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBaseE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjList&lt;EdgeData&gt; allows range-based for-loop over AdjUnit&lt;EdgeData&gt;. </p>
+<p>Graph.</p>
+<p>
+EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>EdgeData</strong> – Type of the edge data.</p></li>
+<li><p><strong>EdgeData</strong> – Graph instances represent static (sub)graphs loaded from txt file. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses.</p></li>
+<li><p><strong>EdgeData</strong> – Type of the edge data. </p></li>
+</ul>
+</dd>
+</dl>
+<p>Subclassed by <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB&lt; EdgeData &gt;</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="lgraph_api::olap::OlapBase::OlapBase"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8b1cb218d9ddbe502eda5a2f0d674d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor of Graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapBase::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af1aedb46d1972859e79efafbe6c33ec2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a6c48401f52e77a7286b04c528b98dc5e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the out-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The out-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::InDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aaa9b9b0056536f6d533c1dfed9fc0ef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the in-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The in-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ada8118bd934579318a4ed38d0233b70d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the outgoing edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The outgoing edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::InEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a19e62567748b5c1a224457b9756d4002"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the incoming edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The incoming edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="lgraph_api::olap::OlapBase::Transpose"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a109318636af36bc89e9853f19e4369e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transpose</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Transpose the graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="lgraph_api::olap::OlapBase::NumVertices"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a07d9840894a10d114719bcf339a5a20d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get number of vertices of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of vertices of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="lgraph_api::olap::OlapBase::NumEdges"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af16ce4014b334a365ccac510c4e4045d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumEdges</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get number of edges of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of edges of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a010ffba60888eacee4ed8153d69e22d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="lgraph_api::olap::OlapBase::AllocVertexArray::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexArray</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Allocate a vertex array with type VertexData. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>VertexData</strong> – Type of the vertex data.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> with type VertexData. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="lgraph_api::olap::OlapBase::AllocVertexSubset"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a950a6ba41cf3e3885d043c15616f583d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexSubset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Allocate a vertex subset represented with <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> sized |V| of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::AcquireVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac15d778dde37cd4ec7f0471d170fe35a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AcquireVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Lock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::ReleaseVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a3d005cde32497e212181e88217938f25"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReleaseVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Unlock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::GuardVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea1c361387ef31606753020550642cf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="lgraph_api::olap::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GuardVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock/unlock.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> corresponding to the specified vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="lgraph_api::olap::OlapBase::IfSparse__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8096171f84ad9c7c78c9ea965c475a8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IfSparse</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd><p>Judging whether it is sparse mode or dense mode according to the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>active_vertices</strong> – The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> of active_vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="lgraph_api::olap::OlapBase::set_num_vertices__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab0c9ca5cca45f72dcbb4ebe427e64b4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">set_num_vertices</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Assign vertices to the first loaded graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vertices</strong> – The vertex id (in the Graph) to lock/unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="lgraph_api::olap::OlapBase::LoadFromArray__cP.s.s.EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a16c3082aa7057bdc8e80f6491e6d8e88"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadFromArray</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">edge_array</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_vertices</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_edges</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">edge_direction_policy</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load graph data from edge_array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>edge_array</strong> – <strong>[in]</strong> The data in this array is read into the graph. </p></li>
+<li><p><strong>input_vertices</strong> – The number of vertices in the input graph data. </p></li>
+<li><p><strong>input_edges</strong> – The number of edges in the input graph data. </p></li>
+<li><p><strong>edge_direction_policy</strong> – Graph data loading method. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a23cdd3850d0641f99a761cd30318ddae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a parallel-for loop in the range [lower, upper). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Template Parameters</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing the work. </p></li>
+<li><p><strong>lower</strong> – The lower bound of the range (inclusive). </p></li>
+<li><p><strong>upper</strong> – The upper bound of the range (exclusive). </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adbf76a87d17dfdeb4554fc058772f351"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a2115dc228e9cde0ea88fad83d9527ebe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Process a set of active vertices in parallel. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Template Parameters</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing each vertex’s work. </p></li>
+<li><p><strong>active_vertices</strong> – <strong>[inout]</strong> The active vertex set. </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac8cdec9111784ddeb528c899d99ea5bd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-functions">Protected Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="lgraph_api::olap::OlapBase::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ad0df12e23dc13705b7160effdecdca73"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-attributes">Protected Attributes</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="lgraph_api::olap::OlapBase::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="lgraph_api::olap::OlapBase::num_edges___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac4dfd32613a83596fa43818fd979a6e2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_data_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a703092681fc7abbc984632b1644216cd"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::adj_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aec12c1eea29776d600cedb7c8de70b71"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">adj_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea4bca314eba173531bc9f04e35888e7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="lgraph_api::olap::OlapBase::edge_direction_policy___EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a59e5aefcf4de1752fda0c644c4bf920a"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_direction_policy_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="lgraph_api::olap::OlapBase::edge_list___EdgeUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aa463cdb96cdb7fa5bc259c8facc9aed9"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit"><span class="n"><span class="pre">EdgeUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">edge_list_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="lgraph_api::olap::OlapBase::out_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adb8e1bf54dfd199e838ec45066f8f758"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="lgraph_api::olap::OlapBase::in_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a55bb224127fd22ab38d9ea251d83895a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="lgraph_api::olap::OlapBase::out_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af6c2b6632374310efa986cf7aa54fd55"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_index_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="lgraph_api::olap::OlapBase::in_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a8f5032936723f9e23aec62f377b2a3ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_index_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="lgraph_api::olap::OlapBase::out_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a890254f0669f50d5d51c0b7f3c6b94ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="lgraph_api::olap::OlapBase::in_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a35d8cc39082a3468d82e0bf4412aee62"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="lgraph_api::olap::OlapBase::lock_array___ParallelVector:b:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aee90f899c9abd99447bfa22781c5634d"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lock_array_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetE"></span><span id="lgraph_api::olap::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> implements the concurrent bitset data structure, which is usually used to represent active vertex sets. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af71b86fef4aceb1ea4e0c39a4ee73369"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>size</strong> – The size of the bitset (i.e. the number of bits). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7242b92edfd78d370c06883f93674ebe"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::assign-operator__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ab16e3e695d258f2ce3d1ad5eef412a12"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ae83afc3b8694c5e279c03836a293ca1c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a1f67570cf9608fb5b62de10c44519e6e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="lgraph_api::olap::ParallelBitset::~ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7779a66d09a414c3ef215609e2dc9da8"></span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="lgraph_api::olap::ParallelBitset::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Clear the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="lgraph_api::olap::ParallelBitset::Fill"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af5105c0eef86140ad8203af2bf159d57"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Fill the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Has__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ade408d5cd908ff319ee49500dbb898da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Has</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Test a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to test.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Whether the bit is set or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Add__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a9d6d2b50895f5add363b7a1a30b0b804"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to set.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Whether the operation is a true addition or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::Swap__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad079bdc6ea46251fa256de71ac77c8db"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd><p>Swap the current bitset with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other bitset to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="lgraph_api::olap::ParallelBitset::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5503ab878f0444a70c87fcce727a4b3c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="lgraph_api::olap::ParallelBitset::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="lgraph_api::olap::ParallelBitset::data___uint64_tP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad26e57b8e7bb88f06c363fab8e7009a2"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5data_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="lgraph_api::olap::ParallelBitset::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14ParallelVectorE">
+<span id="_CPPv3I0EN10lgraph_api4olap14ParallelVectorE"></span><span id="_CPPv2I0EN10lgraph_api4olap14ParallelVectorE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>ParallelVector&lt;T&gt; aims to mimic std::vector&lt;T&gt;. Note that the deletions other than clearing are not supported. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aef646925bb31e3dcc02a67e584e6d2d4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>capacity</strong> – The capacity of the vector. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab1334ee433460a07146e277f7e4c30d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>capacity</strong> – The capacity of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__TP.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a140f4d7cdcdfec667cf096f6d855b155"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt; </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>data</strong> – The initial data of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. And the initial capacity equals initial size. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a3aae6881aa98ab806d5eabd668491187"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1af4d6dc6eecb55e2ddf126fef29b17c79"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::assign-operator__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a70489ba54b4027e4e589c93a6a474666"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ae3fed3af74f330a9856fe2cd42482f44"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Default constructor of ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="lgraph_api::olap::ParallelVector::Destroy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ac919a991060ede6983343719401686de"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Destroy ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="lgraph_api::olap::ParallelVector::~ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2a254fcaade5cc8050f3c5eca1893619"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="lgraph_api::olap::ParallelVector::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5d56cb4cffc7089978d354304eb5a7a6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5beginEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="lgraph_api::olap::ParallelVector::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a23e2fdb99370f37cb764cac10378c721"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5beginEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector3endEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector3endEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector3endEv"></span><span id="lgraph_api::olap::ParallelVector::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5994ad65dce0457b21adb6a10c8642dc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector3endEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4BackEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="lgraph_api::olap::ParallelVector::Back"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9fadc3b5d96a350533f1221345259aab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Back</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4BackEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="lgraph_api::olap::ParallelVector::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab2c9a1b384ad445ddc5da54c669e3136"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4DataEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="lgraph_api::olap::ParallelVector::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="lgraph_api::olap::ParallelVector::Capacity"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2ee0a564b6468179fd94541c4bbf85d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Capacity</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="lgraph_api::olap::ParallelVector::Destroyed"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a907f5acbcd44ca4faa2f02fde7bd2df1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroyed</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="lgraph_api::olap::ParallelVector::Resize__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ad9cf0e91780366986c2f047bd796cdd5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>size</strong> – Value of new size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="lgraph_api::olap::ParallelVector::Resize__s.TCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a4a62b4cde89680b486c2560241cd594a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T" title="Permalink to this definition"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size and initialize the new element with elem. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>size</strong> – Value of new size. </p></li>
+<li><p><strong>elem</strong> – Initial value of new-added element. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="lgraph_api::olap::ParallelVector::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Clear all data and change size to 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ReAlloc__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a1a61eab0948012f137795032a19d4664"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReAlloc</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Destroy elder data and allocate with new capacity. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>capacity</strong> – New capacity value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="lgraph_api::olap::ParallelVector::Fill__T"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a016e89b3314c7d5d0b82b762bad05a28"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T" title="Permalink to this definition"></a><br></dt>
+<dd><p>Assign the vector’s elements with a common value. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>elem</strong> – The common value. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>     <span class="n">This</span> <span class="n">action</span> <span class="ow">is</span> <span class="n">performed</span> <span class="ow">in</span> <span class="n">parallel</span><span class="p">,</span> <span class="n">so</span> <span class="n">you</span> <span class="n">should</span> <span class="ow">not</span> <span class="n">call</span>
+     <span class="n">it</span> <span class="n">inside</span> <span class="n">another</span> <span class="n">parallel</span> <span class="n">region</span> <span class="p">(</span><span class="n">via</span> <span class="n">Worker</span><span class="p">::</span><span class="n">Delegate</span><span class="p">)</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TCR.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a43b8a4f1da7a245932babf7b42aa69db"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append an element to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>elem</strong> – The element. </p></li>
+<li><p><strong>atomic</strong> – (Optional) Whether atomic instructions should be used or not. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TP.s.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a26d7da32681aab4177e5404de5216525"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">count</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append an array of elements to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>buf</strong> – <strong>[inout]</strong> The array pointer. </p></li>
+<li><p><strong>count</strong> – The array length. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="lgraph_api::olap::ParallelVector::Append__ParallelVector:T:R.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9c6d119f42bbb02b422f2abdf5a39a26"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append another vector of elements to this. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>other</strong> – <strong>[inout]</strong> The other vector. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::Swap__ParallelVector:T:R"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1acd7f1912f9dbf8e003bd6e72e4e9efd2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Swap the current vector with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other vector to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="lgraph_api::olap::ParallelVector::Copy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a6ea526f22af350302e37123f3c37e4ff"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Copy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy the current vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A new vector with the same copied content. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="lgraph_api::olap::ParallelVector::destroyed___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a62dfd137075e11ff18b5516f41bd50c2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">destroyed_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="lgraph_api::olap::ParallelVector::capacity___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa3099a4c2b0b3ab5ba4188b4a8f59b26"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">capacity_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5data_E"></span><span id="lgraph_api::olap::ParallelVector::data___TP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa5a936fbbc363fa1913fdaadc70d872a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5data_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5size_E"></span><span id="lgraph_api::olap::ParallelVector::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadStateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadStateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadStateE"></span><span id="lgraph_api::olap::ThreadState"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ThreadState</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadStateE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState4currE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState4currE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState4currE"></span><span id="lgraph_api::olap::ThreadState::curr__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a8eea8ae4d204a609211b5cdf1e0aa19a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState4currE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState3endE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState3endE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState3endE"></span><span id="lgraph_api::olap::ThreadState::end__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1aca05b1afbbe1c83cf087b49df03c441a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState3endE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState5stateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState5stateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState5stateE"></span><span id="lgraph_api::olap::ThreadState::state__i"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a89f234133d3efe315836311cbf21c64b"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">state</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState5stateE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardE">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardE"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardE"></span><span id="lgraph_api::olap::VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> automatically acquires the lock on construction and releases the lock on destruction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__bVP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aca9940bbc3948c4b105cf4edf770aeac"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">volatile</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">lock</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1a89a098e56f889f8015db67136b3c8ee3"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aeb1d045c401b22855341e0084681ec13"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="lgraph_api::olap::VertexLockGuard::~VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aa7fb9013a4d1c11f4bf8c73c079d8e55"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="lgraph_api::olap::VertexLockGuard::lock___bP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1ac56529c72897ed7db313a69efe299cb3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">lock_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerE">
+<span id="_CPPv3N10lgraph_api4olap6WorkerE"></span><span id="_CPPv2N10lgraph_api4olap6WorkerE"></span><span id="lgraph_api::olap::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>All the parallel tasks should be delegated through <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> to prevent a huge number of threads being populated via OpenMP. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6WorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker6WorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker6WorkerEv"></span><span id="lgraph_api::olap::Worker::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1ac243ac161c3b8a4e9b7d8ab6cccceed7"></span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6WorkerEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerD0Ev">
+<span id="_CPPv3N10lgraph_api4olap6WorkerD0Ev"></span><span id="_CPPv2N10lgraph_api4olap6WorkerD0Ev"></span><span id="lgraph_api::olap::Worker::~Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a6c90b9d499e906079194f681b6cb90ca"></span><span class="sig-name descname"><span class="n"><span class="pre">~Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE">
+<span id="_CPPv3N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span id="_CPPv2N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a78582857fb711225979abb2702d89bad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delegate</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Send some work to the <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>work</strong> – The function describing the work. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>             <span class="n">Exceptions</span> <span class="n">can</span> <span class="n">be</span> <span class="n">thrown</span> <span class="ow">in</span> <span class="n">the</span> <span class="n">work</span> <span class="n">function</span> <span class="k">if</span> <span class="n">necessary</span><span class="o">.</span>
+             <span class="n">Note</span> <span class="n">that</span> <span class="n">Delegate</span> <span class="n">cannot</span> <span class="n">be</span> <span class="n">nested</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute">
+<span id="_CPPv3I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span id="_CPPv2I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Compute</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a7515974ca033a44c70f5b965ba736c7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DelegateCompute</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">compute</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="lgraph_api::olap::Worker::SharedWorker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a21214620b0c58b939404d191d78e1415"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">SharedWorker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the global (shared) worker. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A shared pointer to the global <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9stopping_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9stopping_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9stopping_E"></span><span id="lgraph_api::olap::Worker::stopping___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a72446f290a943941576f6803ea96a0da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">stopping_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9stopping_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9has_work_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9has_work_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9has_work_E"></span><span id="lgraph_api::olap::Worker::has_work___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a3b09e0253be21a64efc11b5ad9887b10"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">has_work_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9has_work_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6mutex_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker6mutex_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker6mutex_E"></span><span id="lgraph_api::olap::Worker::mutex___std::mutex"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a281b5ec791338d4378e22ef44a51b4a1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">mutex</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">mutex_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6mutex_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker3cv_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker3cv_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker3cv_E"></span><span id="lgraph_api::olap::Worker::cv___std::condition_variable"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a5eb1f373ea25b73577b6e0205ad7b399"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">condition_variable</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cv_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker3cv_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker5task_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker5task_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker5task_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a173918333017695d1cb7984078721f78"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">packaged_task</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">task_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker5task_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker7worker_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker7worker_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker7worker_E"></span><span id="lgraph_api::olap::Worker::worker___std::thread"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a2d17662c59ba51130a35fdaa8567db74"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">thread</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">worker_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker7worker_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-on-db">
+<h2>olap_on_db<a class="headerlink" href="#olap-on-db" title="Permalink to this headline"></a></h2>
+<p>TuGraph OLAP interface. To implement a plugin that perform graph analytics on TuGraph, user can load a Snapshot from the database, and then use the Gather-Apply-Scatter style interface to do the computation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="lgraph_api::olap::SNAPSHOT_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a24ed9da8cd6c1132a468b64f9ed37f7a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The available options for (graph construction) flags. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="lgraph_api::olap::SNAPSHOT_UNDIRECTED__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1ac92e5bd74f22a5d50d401c61577c2502"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_UNDIRECTED</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="lgraph_api::olap::SNAPSHOT_IDMAPPING__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1af550d7266e9792ecd7c8d4cec91b8ceb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IDMAPPING</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">2</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a7942e3aa179aef017291e80f6cab14ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">3</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The following options are not implemented yet. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a5553d31915ca2c1c043688e19a45ac10"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">4</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a1a3bf7fdc6b1674e1dc931f68c1b783e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">5</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a44ce105282f3a854a595cc978fa04693"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">6</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE">
+<span id="_CPPv3I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span id="_CPPv2I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a6f30998cf8b6f4da8c4d3cbb308b08ca"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="lgraph_api::olap::edge_convert_default::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_default</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">1;return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Default Parser for weighted edges for graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE">
+<span id="_CPPv3I0EN10lgraph_api4olap19edge_convert_weightE"></span><span id="_CPPv2I0EN10lgraph_api4olap19edge_convert_weightE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aa93176409e55c8dbf3df1979c99bb07d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="lgraph_api::olap::edge_convert_weight::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_weight</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">eit.GetField("weight").real();return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Example parser for extract from edge property “weight”. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDBE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDBE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDBE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olapE" title="lgraph_api::olap"><span class="n"><span class="pre">olap</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase"><span class="n"><span class="pre">OlapBase</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_on_db.h&gt;</em></div>
+<p>Snapshot is a derived class of Graph. Snapshot instances represent static (sub)graphs exported from LightningGraph. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses. </p>
+<p>EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a49ed16af93c6bfbaff9856aefb2d8f04"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1/V2 Procedures. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a31bb964e9baa8452632dfe0d97f253fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1 Procedures. </p>
+<p>
+Note: read-write transactions are not recommended here for safety, e.g. some vertices might be removed causing inconsistencies of the analysis, and vertex data extraction may not work for deleted vertices). The constructed graph should contain all vertices whose vertex_filter calls return true and all edges <em>sourced from</em> these vertices whose out_edge_filter calls return true. If SNAPSHOT_UNDIRECTED is specified, the graph will be made symmetric (i.e. reversed edges are also added to the graph). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges.</p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__GraphDBR.TransactionR.std::vector:std::vector:ss::.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a38771d37dea34f28513dd5305385dfa4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_list</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a428105b32ebebb9bd1ad5df715e8b3d5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Generate a graph without LightningGraph. For V2 Procedures. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a384cbed54b1bcd0610dfc176b0b58563"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a80b05d175e882c00a314f5ba518a55d4"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a79cc725b6c20ffac60c4c980e472d7e1"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::assign-operator__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaa45fb6b0cfa2ce83892f4667684d92a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="lgraph_api::olap::OlapOnDB::~OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c2abb48c34772b4ffd882210300572b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a14ebd243f449d5ef5dc6ffc56d0855c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Extract a vertex array from the graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>extract</strong> – The function describing the extraction logic.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> containing each vertex’s extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab5f0b3fee89201df1f5fa5bd06cceb4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToFile</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToFile::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output_file</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Write vertex data to a file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – The parallel vector storing the vertex data. </p></li>
+<li><p><strong>output_file</strong> – The path to the output file. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c18bf21eacc3c981bb129d99ae63f86"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToGraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToGraphDB::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Write vertex data to the graph database. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – <strong>[inout]</strong> The parallel vector storing the vertex data. </p></li>
+<li><p><strong>vertex_field</strong> – <strong>[in]</strong> The name of the vertex field. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OriginalVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a514e2403802681b3a6ab6e3e1521f3ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OriginalVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the original vertex id (in LightningGraph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The original id of the specified vertex in the graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::MappedVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a6ed1fe8e61e5879a68744a79c522ee0a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MappedVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">original_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the mapped vertex id (in the graph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>original_vid</strong> – The original vertex id (in LightningGraph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The mapped id of the specified vertex (in LightningGraph). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="lgraph_api::olap::OlapOnDB::GetTransaction"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a05e20809b4047a9dc2d54f28b3f62528"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetTransaction</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::Init__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a4457f7e41bdf9a2d7fe100d1bdc32ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Init</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">num_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapOnDB::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab7d7ef02dcbc497f1bc8e738188613c8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>This decision formula is used to determine whether to stop the algorithm running in <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="lgraph_api::olap::OlapOnDB::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a9af72b216eb95e320f0f261d9497c5c1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithVid"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a85b384fc73a534221f880e966c2ca608"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithDegree"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ac2d9a6a8d98a79402d9505ac3270373f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithDegree</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB3db_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="lgraph_api::olap::OlapOnDB::db___GraphDBP"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaaee9f9643b55632219320d15882f548"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="lgraph_api::olap::OlapOnDB::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="lgraph_api::olap::OlapOnDB::original_vids___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a82054e1776bcb3b09cb66389c1eeb781"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">original_vids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="lgraph_api::olap::OlapOnDB::vid_map___cuckoohash_map:s.s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a2871a76b39823e6482e093f9b0cacb78"></span><span class="n"><span class="pre">cuckoohash_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_map_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="lgraph_api::olap::OlapOnDB::flags___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a5bb1ec258a7281a0702e64c19bcda816"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vertex_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa4b2136dfe22d40f01778f7b04aa9993"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edge_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-profile">
+<h2>olap_profile<a class="headerlink" href="#olap-profile" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsageE"></span><span id="lgraph_api::olap::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsageE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_profile.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="lgraph_api::olap::MemUsage::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac231833949c8ed135c0e8e59af8d7e6c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="lgraph_api::olap::MemUsage::getMaxMemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a4f02170838631103c72261595c35916b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">getMaxMemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5resetEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5resetEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5resetEv"></span><span id="lgraph_api::olap::MemUsage::reset"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ad20897c5c8bd47f5d4005989bead0e55"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5resetEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="lgraph_api::olap::MemUsage::startMemRecord__unsigned-i"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac3db2b796bdfa6e43a1302c5a1072ba3"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">startMemRecord</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">interval</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1000</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5printEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5printEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5printEv"></span><span id="lgraph_api::olap::MemUsage::print"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a388f572c62279f839ee138a9afbdeeb5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">print</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5printEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="lgraph_api::olap::MemUsage::parseMemLine__cP"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a07befe13a6e76ab6c84719817c5fadbf"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parseMemLine</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">line</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="lgraph_api::olap::MemUsage::maxMemUsage__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a274bce27e5ba57cce5606ba61eb28489"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">maxMemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..8fde487168
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++ Stored Procedures
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.md
new file mode 100644
index 0000000000..e0bc812dd8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.md
@@ -0,0 +1,1547 @@
+
+
+             
+  <section id="python-stored-procedure-api">
+
+<p>Version: 4.3.0</p>
+<p>Copyright (C) 2018-2022 Ant Group.</p>
+<div class="toctree-wrapper compound">
+</div>
+<section id="introduction">
+<h2>Introduction<a class="headerlink" href="#introduction" title="Permalink to this headline"></a></h2>
+<p>Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.</p>
+<p>This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.</p>
+</section>
+<section id="module-liblgraph_python_api">
+<span id="api"></span><h2>API<a class="headerlink" href="#module-liblgraph_python_api" title="Permalink to this headline"></a></h2>
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">AccessLevel</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel" title="Permalink to this definition"></a></dt>
+<dd><p>Access that a user has on a graph.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NONE</p>
+<p>READ</p>
+<p>WRITE</p>
+<p>FULL</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">EdgeUid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid" title="Permalink to this definition"></a></dt>
+<dd><p>Edge identifier.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.dst">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">dst</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.dst" title="Permalink to this definition"></a></dt>
+<dd><p>Destination vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.eid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">eid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.eid" title="Permalink to this definition"></a></dt>
+<dd><p>ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.lid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">lid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.lid" title="Permalink to this definition"></a></dt>
+<dd><p>Label ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.src">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">src</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.src" title="Permalink to this definition"></a></dt>
+<dd><p>Source vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.tid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">tid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.tid" title="Permalink to this definition"></a></dt>
+<dd><p>Temporal ID of the edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldData</span></span><a class="headerlink" href="#liblgraph_python_api.FieldData" title="Permalink to this definition"></a></dt>
+<dd><p>FieldData is the data type of field value.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBlob">
+<span class="sig-name descname"><span class="pre">AsBlob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bytes</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBlob" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBool">
+<span class="sig-name descname"><span class="pre">AsBool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBool" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as bool, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDate">
+<span class="sig-name descname"><span class="pre">AsDate</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDate" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as date, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDateTime">
+<span class="sig-name descname"><span class="pre">AsDateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDateTime" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as datetime, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDouble">
+<span class="sig-name descname"><span class="pre">AsDouble</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDouble" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsFloat">
+<span class="sig-name descname"><span class="pre">AsFloat</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsFloat" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as float, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt16">
+<span class="sig-name descname"><span class="pre">AsInt16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt16" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int16, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt32">
+<span class="sig-name descname"><span class="pre">AsInt32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt32" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int32, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt64">
+<span class="sig-name descname"><span class="pre">AsInt64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt64" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int64, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt8">
+<span class="sig-name descname"><span class="pre">AsInt8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt8" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int8, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsString">
+<span class="sig-name descname"><span class="pre">AsString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsString" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as string, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Blob">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Blob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bytes</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Blob" title="Permalink to this definition"></a></dt>
+<dd><p>Make a BLOB value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Bool">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Bool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Bool" title="Permalink to this definition"></a></dt>
+<dd><p>Make a BOOL value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Date">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Date</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.Date" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>Date(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+<ol class="arabic simple" start="2">
+<li><p>Date(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.DateTime">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">DateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.DateTime" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>DateTime(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+<ol class="arabic simple" start="2">
+<li><p>DateTime(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Double">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Double</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Double" title="Permalink to this definition"></a></dt>
+<dd><p>Make a DOUBLE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Float">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Float</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Float" title="Permalink to this definition"></a></dt>
+<dd><p>Make a FLOAT value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int16">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int16" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT16 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int32">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int32" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT32 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int64">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int64" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT64 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int8">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int8" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT8 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.String">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">String</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.String" title="Permalink to this definition"></a></dt>
+<dd><p>Make a STRING value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.ToPython">
+<span class="sig-name descname"><span class="pre">ToPython</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.ToPython" title="Permalink to this definition"></a></dt>
+<dd><p>Convert to corresponding Python type.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.get">
+<span class="sig-name descname"><span class="pre">get</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.get" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.isNull">
+<span class="sig-name descname"><span class="pre">isNull</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.isNull" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.set">
+<span class="sig-name descname"><span class="pre">set</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.set" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldSpec</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec" title="Permalink to this definition"></a></dt>
+<dd><p>Field specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.name" title="Permalink to this definition"></a></dt>
+<dd><p>Name of this field.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.nullable">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">nullable</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.nullable" title="Permalink to this definition"></a></dt>
+<dd><p>Whether this field can be null.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.type">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">type</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.type" title="Permalink to this definition"></a></dt>
+<dd><p>Type of this field, INT8, INT16, …, FLOAT, DOUBLE, STRING.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldType</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType" title="Permalink to this definition"></a></dt>
+<dd><p>Data type of FieldData.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NUL</p>
+<p>BOOL</p>
+<p>INT8</p>
+<p>INT16</p>
+<p>INT32</p>
+<p>INT64</p>
+<p>FLOAT</p>
+<p>DOUBLE</p>
+<p>DATE</p>
+<p>DATETIME</p>
+<p>STRING</p>
+<p>BLOB</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Galaxy</span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy" title="Permalink to this definition"></a></dt>
+<dd><p>A galaxy is a TuGraph instance that holds multiple GraphDBs.
+A galaxy is stored in a directory and manages users and GraphDBs. Each (user, GraphDB) pair can have different access levels. You can use db=Galaxy.OpenGraph(graph) to open a graph. Since garbage collection in Python is automatic, you need to close the galaxy with Galaxy.Close() when you are done with it.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.Close" title="Permalink to this definition"></a></dt>
+<dd><p>Closes this galaxy</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateGraph">
+<span class="sig-name descname"><span class="pre">CreateGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">4398046511104</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Creates a graph.
+name: the name of the graph
+description: description of the graph
+max_size: maximum size of the graph, default 1TB</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateRole">
+<span class="sig-name descname"><span class="pre">CreateRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateRole" title="Permalink to this definition"></a></dt>
+<dd><p>Create a role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateUser">
+<span class="sig-name descname"><span class="pre">CreateUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateUser" title="Permalink to this definition"></a></dt>
+<dd><p>Creates a new user account.
+name: name of the user
+password: password for the user
+desc: description of this user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteGraph">
+<span class="sig-name descname"><span class="pre">DeleteGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes a graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteRole">
+<span class="sig-name descname"><span class="pre">DeleteRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteRole" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteUser">
+<span class="sig-name descname"><span class="pre">DeleteUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteUser" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes a user account</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DisableUser">
+<span class="sig-name descname"><span class="pre">DisableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DisableUser" title="Permalink to this definition"></a></dt>
+<dd><p>Disables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.EnableUser">
+<span class="sig-name descname"><span class="pre">EnableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.EnableUser" title="Permalink to this definition"></a></dt>
+<dd><p>Enables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.GetUserInfo">
+<span class="sig-name descname"><span class="pre">GetUserInfo</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::UserInfo</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.GetUserInfo" title="Permalink to this definition"></a></dt>
+<dd><p>Get information of the specified user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListGraphs">
+<span class="sig-name descname"><span class="pre">ListGraphs</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListGraphs" title="Permalink to this definition"></a></dt>
+<dd><p>Lists graphs and returns a dictionary of {name:(desc, max_size)}</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListUsers">
+<span class="sig-name descname"><span class="pre">ListUsers</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict[str,</span> <span class="pre">lgraph_api::UserInfo]</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListUsers" title="Permalink to this definition"></a></dt>
+<dd><p>Lists all users and whether they are admin</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ModGraph">
+<span class="sig-name descname"><span class="pre">ModGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ModGraph" title="Permalink to this definition"></a></dt>
+<dd><p>mod_size: whether to modify max graph size
+new_max_size: new maximum size of the graph, in bytes</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.OpenGraph">
+<span class="sig-name descname"><span class="pre">OpenGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">read_only</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::GraphDB</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.OpenGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Opens a graph and returns a GraphDB instance.
+graph: name of the graph
+read_only: whether to open the graph in read-only mode</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetCurrentUser">
+<span class="sig-name descname"><span class="pre">SetCurrentUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetCurrentUser" title="Permalink to this definition"></a></dt>
+<dd><p>Validate user password and set current user.
+user: user name
+password: password of the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRights">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRights</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRights" title="Permalink to this definition"></a></dt>
+<dd><p>Set access rights for the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRightsIncremental</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental" title="Permalink to this definition"></a></dt>
+<dd><p>Set access rights for the specified role, only affects the specified graphs</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleDesc">
+<span class="sig-name descname"><span class="pre">SetRoleDesc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleDesc" title="Permalink to this definition"></a></dt>
+<dd><p>Set description of the specified role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUser">
+<span class="sig-name descname"><span class="pre">SetUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUser" title="Permalink to this definition"></a></dt>
+<dd><p>Validate the given user and set current user given in the user.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserGraphAccess">
+<span class="sig-name descname"><span class="pre">SetUserGraphAccess</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">access</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserGraphAccess" title="Permalink to this definition"></a></dt>
+<dd><p>Set the access level of the specified user on the graph.
+user: name of the user
+graph: name of the graph
+access: access level of the user on that graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserPass">
+<span class="sig-name descname"><span class="pre">SetUserPass</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self:</span> <span class="pre">liblgraph_python_api.Galaxy</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">name:</span> <span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">old_password:</span> <span class="pre">str</span> <span class="pre">=</span> <span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_password:</span> <span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserPass" title="Permalink to this definition"></a></dt>
+<dd><p>Modifies user password.
+name: name of the user
+old_password: current password, not needed when modifying another user
+new_password: new password for the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserRoles">
+<span class="sig-name descname"><span class="pre">SetUserRoles</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">roles</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserRoles" title="Permalink to this definition"></a></dt>
+<dd><p>Set the roles for the specified user.
+name: name of the user
+roles: list of roles for this user</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">GraphDB</span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB" title="Permalink to this definition"></a></dt>
+<dd><p>The graph database class.
+A GraphDB stores the data about the graph, including labels, vertices, edges and indexes.Since Garbage Collection in Python is automatic, you need to close the DB with GraphDB.Close() at the end of its lifetime.Make sure you have either committed or aborted every transaction that is using the DB before you close the DB.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddEdgeLabel">
+<span class="sig-name descname"><span class="pre">AddEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">temporal_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">[]</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddEdgeLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Adds an edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexIndex">
+<span class="sig-name descname"><span class="pre">AddVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">is_unique</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexIndex" title="Permalink to this definition"></a></dt>
+<dd><p>Adds an index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexLabel">
+<span class="sig-name descname"><span class="pre">AddVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">primary_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Add a vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields" title="Permalink to this definition"></a></dt>
+<dd><p>Add fields to an edge label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields" title="Permalink to this definition"></a></dt>
+<dd><p>Delete fields from an edge label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModFields" title="Permalink to this definition"></a></dt>
+<dd><p>Modify fields in an edge label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModifyConstraints</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints" title="Permalink to this definition"></a></dt>
+<dd><p>Modify edge constraints</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelAddFields" title="Permalink to this definition"></a></dt>
+<dd><p>Add fields to a vertex label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelDelFields" title="Permalink to this definition"></a></dt>
+<dd><p>Delete fields from a vertex label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelModFields" title="Permalink to this definition"></a></dt>
+<dd><p>Modify fields in a vertex label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Close" title="Permalink to this definition"></a></dt>
+<dd><p>Closes the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateReadTxn">
+<span class="sig-name descname"><span class="pre">CreateReadTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateReadTxn" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateWriteTxn">
+<span class="sig-name descname"><span class="pre">CreateWriteTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">optimistic</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateWriteTxn" title="Permalink to this definition"></a></dt>
+<dd><p>Create a write transaction.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteEdgeLabel">
+<span class="sig-name descname"><span class="pre">DeleteEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteEdgeLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes an edge label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexIndex">
+<span class="sig-name descname"><span class="pre">DeleteVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexIndex" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes the specified index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexLabel">
+<span class="sig-name descname"><span class="pre">DeleteVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes a vertex label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllData">
+<span class="sig-name descname"><span class="pre">DropAllData</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllData" title="Permalink to this definition"></a></dt>
+<dd><p>Drop all the data in this DB.
+All vertices, edges, labels and indexes will be dropped.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllVertex">
+<span class="sig-name descname"><span class="pre">DropAllVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllVertex" title="Permalink to this definition"></a></dt>
+<dd><p>Drops all the vertices and edges in this DB.
+Labels and indexes (though index contents will be cleared due to deletion of vertices) will be preserved.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.EstimateNumVertices">
+<span class="sig-name descname"><span class="pre">EstimateNumVertices</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.EstimateNumVertices" title="Permalink to this definition"></a></dt>
+<dd><p>Gets an estimation of the number of vertices.
+This can be inaccurate if there were vertex removals.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Flush">
+<span class="sig-name descname"><span class="pre">Flush</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Flush" title="Permalink to this definition"></a></dt>
+<dd><p>Flushes written data into disk.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetDescription">
+<span class="sig-name descname"><span class="pre">GetDescription</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetDescription" title="Permalink to this definition"></a></dt>
+<dd><p>Gets description of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetMaxSize">
+<span class="sig-name descname"><span class="pre">GetMaxSize</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetMaxSize" title="Permalink to this definition"></a></dt>
+<dd><p>Gets maximum size of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.IsVertexIndexed" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">InEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>InEdgeIterator can be used to iterate through all the incoming edges of the destination vertex.
+Incoming edges are sorted in (dst, label, src, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Delete" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetAllFields" title="Permalink to this definition"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetDst" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetEdgeId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetField" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetSrc" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetUid" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Goto" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the in edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next in edge to current destination vertex.
+If there is no more in edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetField" title="Permalink to this definition"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.ToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">IndexSpec</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec" title="Permalink to this definition"></a></dt>
+<dd><p>Index specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.field">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">field</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.field" title="Permalink to this definition"></a></dt>
+<dd><p>Name of the field</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.label">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">label</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.label" title="Permalink to this definition"></a></dt>
+<dd><p>Name of the label.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.unique">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">unique</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.unique" title="Permalink to this definition"></a></dt>
+<dd><p>Whether the indexed values are unique.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">LGraphType</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType" title="Permalink to this definition"></a></dt>
+<dd><p>Members:</p>
+<p>NUL : NUL</p>
+<p>INTEGER : INTEGER</p>
+<p>FLOAT : FLOAT</p>
+<p>DOUBLE : DOUBLE</p>
+<p>BOOLEAN : BOOLEAN</p>
+<p>STRING : STRING</p>
+<p>NODE : NODE</p>
+<p>RELATIONSHIP : RELATIONSHIP</p>
+<p>PATH : PATH</p>
+<p>LIST : LIST</p>
+<p>MAP : MAP</p>
+<p>ANY : ANY</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">OutEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>OutEdgeIterator can be used to iterate through all the out-going edges of the source vertex.
+Out-going edges are sorted in (src, lid, dst, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Delete" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetAllFields" title="Permalink to this definition"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetDst" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetEdgeId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetField" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetSrc" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetUid" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Goto" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the out edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next out edge from current source vertex.
+If there is no more out edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetField" title="Permalink to this definition"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_values are FieldData containing the field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the field values as specified in value_dict.
+value_dict specifies the field_name:value dictionary.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.ToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">PluginErrorCode</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode" title="Permalink to this definition"></a></dt>
+<dd><p>ErrorCode of plugin.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>SUCCESS</p>
+<p>INPUT_ERR</p>
+<p>INTERNAL_ERR</p>
+<p>SUCCESS_WITH_SIGNATURE</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Transaction</span></span><a class="headerlink" href="#liblgraph_python_api.Transaction" title="Permalink to this definition"></a></dt>
+<dd><p>In embedded mode, all the operations are performed in transactions and thus enjoys the power of
+transactions such as atomicity and isolation. You can commit or abort a transaction at any time
+without worrying about the side effects it has already made.
+Transactions can be either committed or aborted, after which it is destructed and becomes invalid.
+Make sure you have destructed every transaction before you closes the corresponding GraphDB.
+Transactions also track the created iterators and releases all the iterators during destruction.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Abort">
+<span class="sig-name descname"><span class="pre">Abort</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Abort" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddEdge">
+<span class="sig-name descname"><span class="pre">AddEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddEdge" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values in string format.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label id, field ids, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+Returns the id of the newly added edge.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddVertex">
+<span class="sig-name descname"><span class="pre">AddVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddVertex" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values in string format.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label ids, field ids, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_ids are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, value_dict: dict) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name and set the value as specified in value_dict.
+Returns the id of the newly added vertex.
+Fields that are not specified in the dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Commit">
+<span class="sig-name descname"><span class="pre">Commit</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Commit" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.DumpGraph">
+<span class="sig-name descname"><span class="pre">DumpGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.DumpGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Prints the string representation of the WHOLE graph to stdout.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeFieldId">
+<span class="sig-name descname"><span class="pre">GetEdgeFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeFieldId" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_name: str) -&gt; int</p></li>
+</ol>
+<p>Gets the edge field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_names: List[str]) -&gt; List[int]</p></li>
+</ol>
+<p>Gets the edge field ids associated with this (label_id, field_names).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeLabelId">
+<span class="sig-name descname"><span class="pre">GetEdgeLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the edge label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeSchema">
+<span class="sig-name descname"><span class="pre">GetEdgeSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeSchema" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the schema specification of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetInEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator pointing to the in-edge of vertex dst with EdgeUid==euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumEdgeLabels">
+<span class="sig-name descname"><span class="pre">GetNumEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumEdgeLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumVertexLabels">
+<span class="sig-name descname"><span class="pre">GetNumVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumVertexLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetOutEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator pointing to the edge identified by euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexByUniqueIndex">
+<span class="sig-name descname"><span class="pre">GetVertexByUniqueIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexByUniqueIndex" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value_string: str) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value_string specifies the string representation of the indexed field value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value: object) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value specifies the indexed field value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, field_value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+field_value is a FieldData specifying the indexed field value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldId">
+<span class="sig-name descname"><span class="pre">GetVertexFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the vertex field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldIds">
+<span class="sig-name descname"><span class="pre">GetVertexFieldIds</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_names</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldIds" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the vertex field ids associated with this (label_id, [field_names]).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIndexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIndexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIndexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>Gets an VertexIndexIterator pointing to the indexed item which has index value [key_start, key_end].
+key_start=key_end=v returns an iterator pointing to all vertexes that has field value v.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+value is a FieldData containing the indexed value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start_string: str, key_end_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start_string is the string representation of the minimum indexed value.
+key_end_string is the string representation of the maximum indexed value.</p>
+<ol class="arabic simple" start="4">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="5">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value_string is the string representation of the indexed value.</p>
+<ol class="arabic simple" start="6">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value is a FieldData containing the indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the first vertex in the graph.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the vertex specified by vid.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int, nearest: bool) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets VertexIterator with vertex id.
+If nearest==true, go to the first vertex with id &gt;= vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexLabelId">
+<span class="sig-name descname"><span class="pre">GetVertexLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the vertex label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexSchema">
+<span class="sig-name descname"><span class="pre">GetVertexSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexSchema" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the schema specification of the vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsReadOnly">
+<span class="sig-name descname"><span class="pre">IsReadOnly</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsReadOnly" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsValid" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsVertexIndexed" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListEdgeLabels">
+<span class="sig-name descname"><span class="pre">ListEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListEdgeLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexIndexes">
+<span class="sig-name descname"><span class="pre">ListVertexIndexes</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.IndexSpec" title="liblgraph_python_api.IndexSpec"><span class="pre">liblgraph_python_api.IndexSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexIndexes" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the list of all the vertex indexes in the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexLabels">
+<span class="sig-name descname"><span class="pre">ListVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.UpsertEdge">
+<span class="sig-name descname"><span class="pre">UpsertEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.UpsertEdge" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values in string format.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label id, field ids, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.VertexToString">
+<span class="sig-name descname"><span class="pre">VertexToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.VertexToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of the vertex specified by vid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIndexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>VertexIndexIterator can be used to retrieve the id of indexed vertices.
+Vertex ids are sorted in ascending order of (index_value, vertex_id).</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetIndexValue">
+<span class="sig-name descname"><span class="pre">GetIndexValue</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetIndexValue" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the indexed value.
+Since vertex ids are sorted in (index_value, vertex_id) order, calling Next() may change the current indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetVid">
+<span class="sig-name descname"><span class="pre">GetVid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetVid" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the id of the vertex currently pointed to.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether this iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next indexed vid.
+If there is no more vertex within the specified key range, the iterator becomes invalid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>VertexIterator can be used to retrieve info of a vertex, or to scan through multiple vertices.
+Vertexes are sorted in ascending order of the their ids.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Delete" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes current vertex.
+The iterator will point to the next vertex if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetAllFields" title="Permalink to this definition"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetField" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetId">
+<span class="sig-name descname"><span class="pre">GetId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the integer id of this vertex.
+GraphDB assigns an integer id for each vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetInEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the first in-coming edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the in-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the label name of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the label id of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumInEdges">
+<span class="sig-name descname"><span class="pre">GetNumInEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumInEdges" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the number of in-coming edges of this vertex.
+n_limit specifies the maximum number of edges to scan.
+Returns a tuple containing the number of in-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumOutEdges">
+<span class="sig-name descname"><span class="pre">GetNumOutEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumOutEdges" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the number of out edges of this vertex.
+n_limit specifies the maximum number of vids to scan.Returns a tuple containing the number of out-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetOutEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the first out-going edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the out-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Goto" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the vertex specified by vid.
+If nearest==true, go to the nearest vertex with id&gt;=vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListDstVids">
+<span class="sig-name descname"><span class="pre">ListDstVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListDstVids" title="Permalink to this definition"></a></dt>
+<dd><p>Lists all destination vids of the out edges.
+n_limit specifies the maximum number of vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListSrcVids">
+<span class="sig-name descname"><span class="pre">ListSrcVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListSrcVids" title="Permalink to this definition"></a></dt>
+<dd><p>Lists all source vids of the in edges.
+n_limit specifies the maximum number of src vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next vertex with id&gt;{current_vid}.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetField" title="Permalink to this definition"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of current vertex, including properties and edges.</p>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..e99c2f6e07
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,29 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python stored procedure API
+====================================
+Version: 4.3.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..d50c8ecdcf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,17 @@
+# Rust Stored Procedures
+
+## 1. Introduction
+Rust stored procedures currently only support v1 version. TuGraph supports plugins in any language that can be compiled into a dynamic library. Rust, as a rising star in system programming languages, has significant advantages in terms of safety, reliability, and ergonomics compared to C++.
+
+We provide the Rust binding library for TuGraph to support calling lgrahp API in Rust. We also provide the [tugraph-plugin-util](https://crates.io/crates/tugraph-plugin-util ) utility library to help simplify the process of writing Rust plugins.
+
+## 2. How to Use
+
+Using Rust stored procedures involves three steps:
+* Compilation: Compile the Rust source code into a dynamic library (so file). We have prepared a comprehensive plugin development tutorial that covers everything from IDE plugin installation and environment setup to compilation. Please refer to the `rust-tugraph-plugin-tutorial` for detailed instructions.
+* Loading: Load the dynamic library (so file) into the server. This can be done through the REST or RPC interface, similar to the usage of C++ libraries. Please refer to the documentation for more details on the [Procedure v1 API](1.procedure.md).
+* Execution: Once the library is loaded, use it as you would with a C++ stored procedure. The process is the same and does not need further explanation.
+
+## 3. API Documentation
+
+In the Rust community, all code and documentation can be found on [`crates.io`](https://crates.io/crates/tugraph ) and [`docs.rs`](https://docs.rs/tugraph/latest/tugraph ).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..1e97b2379e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.3.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..22403ca19e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..83cc10c52e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..5e4000b6ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,214 @@
+# Bootstrap program
+
+>This document is a bootstrap program designed for TuGraph users. Before reading the detailed documents, users should read this document first to have a general understanding of TuGraph's graph computing operation process, and it will be more convenient to read the detailed documents later. The bootstrap program is a simple instance of a bfs (breadth-first search) program based on Tugraph, and we will focus on how it is used.
+
+## 1.Introduction to TuGraph-Graph Analysis Engine
+
+TuGraph's graph analysis engine is mainly used for full graph/full data analysis tasks. With the help of TuGraph's C++ / Python graph analysis engine API, users can quickly derive a complex subgraph from different data sources, and then run iterative graph algorithms such as PageRank, LPA, WCC on the subgraph, and finally make corresponding countermeasures according to the running results.
+
+In TuGraph, the process of both exporting and computing can be accelerated by in-memory parallel processing, resulting in near-real-time processing and analysis. Compared to traditional methods, this approach can avoid the overhead of data export and disk drop, and can achieve ideal performance by using a compact graph data structure.
+
+TuGraph has 6 built-in algorithms in the community version and 25 built-in algorithms in the commercial version. Users hardly need to implement the specific graph calculation process themselves. For details, please refer to algorithms.md.
+
+According to different data sources and implementations, it can be divided into Procedure, Embed and Standalone, which all inherit from OlapBase API. OlapBase API interface documentation can be found in OlAPBase-APi.md.
+
+The data source of Procedure and Embed is the db data preloaded in the graph database, which can be compiled to generate the.so file used by TuGraph-Web loading and the embed file used by the background terminal respectively. The input graph data are loaded in the form of db. The interface document can refer to olapondb-api.md.
+
+Standalone is used to compile and generate a standalone file. Different from the former, the input graph data of the file is loaded in the form of txt, binary, and ODPS files, and the interface document can refer to olapondisk-api.md.
+
+## 2.Procedure compile and run
+
+This mode is mainly used for visual loading and running on the TuGraph-web interface. The usage method is as follows:
+
+### 2.1.C++
+Run bash make_so.sh bfs in the TuGraph/procedures directory to the BFs.so file in the TuGraph/procedures directory, upload the file as a plug-in to Tugraph-web, input parameters and then execute.
+
+### 2.2.Python
+Upload the python file as a plugin to TuGraph-web, and execute it after inputting parameters.
+
+Example:
+Compile the.so algorithm file at TuGraph/procedures
+`bash make_so.sh bfs`
+
+After loading the bfs.so (or TuGraph/procedures/algo_cython/bfs.py) file as a plug-in to TuGraph-web, enter the following json parameters:
+
+```json
+{
+  "root_id": "0",
+  "label": "node",
+  "field": "id"
+}
+```
+
+The following result
+
+result:"{"core_cost":0.013641119003295898,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":8.821487426757813e-06,
+"prepare_cost":0.03479194641113281,
+"total_cost":0.04844188690185547}"
+
+The output ：
+
+- num_edges: the number of edges in the graph
+- num_vertices: the number of nodes in the graph
+- prepare_cost: Represents the time required for the preprocessing phase. The preprocessing phase works: loading parameters, graph data loading, index initialization.
+- core_cost: Represents the time required for the algorithm to run.
+- found_vertices: Number of vertices found.
+- output_cost: the time it takes for the algorithm result to be written back to db.。
+- total_cost: The overall running time of the algorithm is executed.
+
+make_so.sh This file is used to compile the graph algorithm files involved in TuGraph-OLAP into a.so file available for TuGraph-web.
+
+## 3.Embed compile and run
+
+This way is mainly used for TuGraph in the background program on the preloaded db graph data algorithm analysis. Its use method is as follows:
+
+To complete the embed_main.cpp file in TuGraph/procedures directory, add the data name, input parameters, data path and other information, as shown in the following example:
+
+### 3.1.C++
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path Specifies the path for saving the preloaded graph data
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // Specifies the name of the graph
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // Enter the algorithm parameters in json format
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+
+Run bash make_so.sh bfs in TuGraph/procedures to bfs_procedure in TuGraph/procedures/algo_cpp.
+`bash make_embed.sh bfs`
+
+Do this in the TuGraph/procedures folder
+`./algo_cpp/bfs_procedure`
+The result is returned.
+
+Input: {"root_id":"0", "label":"node","field":"id"}
+found_vertices = 3829
+{"core_cost":0.025603055953979492,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":9.059906005859375e-06,
+"prepare_cost":0.056738853454589844,
+"total_cost":0.0823509693145752}
+
+`Input` indicates the input parameters.The other parameters are described as above.
+
+### 3.2.Python
+
+To compile bfs.so, run `bash make_so_cython.sh bfs` in TuGraph/procedures or `python3 setup.py build_ext -i` in TuGraph/procedures/algo_cython.
+
+After obtaining bfs.so, it can be imported and used in Python, as shown in TuGraph/procedures/run_embed.py:
+
+```python
+# TuGraph/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+
+# shell
+python3 run_embed.py
+```
+The output is the same as C++
+
+
+## 4.Standalone compile and run
+
+This file is mainly used to load the graph data directly at the terminal and run the printout results. Here's how to use it:
+
+In TuGraph/build directory `make bfs_standalone` (need to include boost/sort/sort.hpp in the g++ default include path) can get bfs_standalone file, the file is generated with TuGraph/build/output/algo folder.
+
+Run: Go to the TuGraph/build directory and do`./output/algo/bfs_standalone -- type [type] -- input_dir [input_dir] --id_mapping [id_mapping] -- vertices [vertices] --root (root) - output_dir [output_dir]`
+
+Ready to run.
+
+- `[type]` : indicates the type source of the input graph file, including text file, BINARY_FILE binary file, and ODPS source.
+
+- `[input_dir]` : indicates the path of the input graph file folder, which may contain one or more input files. TuGraph will read all the files under [input_dir] when reading the input file. It is required that [input_dir] can only contain the input file and cannot contain other files. Parameters cannot be omitted.
+
+- `[id_mapping]`：When reading the side table, whether to do id mapping for the input data to make it conform to the form of algorithm operation. 1 is required for id mapping, 0 is not required. This process will take some time. The parameter can be omitted, and the default value is 0.
+
+- `[vertices]` : represents the number of vertices in the graph. 0 indicates the number of vertices that the user wants the system to automatically recognize. When is non-zero, it indicates the number of vertices that the user wants to customize. The number of user-defined vertices must be greater than the maximum vertex ID. This parameter can be omitted. The default value is 0.
+
+- `[root]` : indicates the starting vertex id for bfs. The argument cannot be omitted.
+
+- `[output_dir]` : indicates the path of the folder where the output data is saved. The output content is saved to this file, and the parameter cannot be omitted.
+
+Example
+
+### 4.1.C++
+
+Compile the standalone algorithm program at TuGraph/build
+
+```shell
+make bfs_standalone
+```
+
+Run the text source file in TuGraph/build/output
+
+```
+    ./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+Result：
+
+```
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+Result Parameter description is the same as above.
+
+If you do not know the required parameters of a new algorithm, run the`./output/algo/bfs_standalone -h` to view the parameters.
+
+### 4.2.Python
+The bfs extension compilation process of the Python language is the same as that of the embed mode. It is called through the `Standalone` interface at runtime. The example is as follows:
+
+```python
+# TuGraph/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(
+        input_dir="../test/integration/data/algo/fb_unweighted",
+        root=0)
+
+# shell
+python3 run_standalone.py
+```
+
+At this point, the process of bfs operation on the figure above by TuGraph is complete.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..af510f95c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,196 @@
+# OlapBase API
+
+> This document will introduce how to use the OlapBase API
+
+## 1.The overview
+
+This manual will introduce the configuration of the TuGraph graph computing system. Combined with the code, several important files and interfaces in TuGraph are introduced.
+
+## 2.Configuration requirements
+
+To develop and compile applications using the TuGraph graph computing system, the configuration required:
+
+- linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+
+- Compiler that supports C++ 14, requires GCC version 5.4.1 or later.
+
+## 3.Atomic operations
+
+TuGraph uses multi-threading technology for batch operations, in which case memory access conflicts may occur. In order to ensure the correctness of modification operations in parallel computing, TuGraph implements atomic operations. The code section can be found in the lgraph_atomic.cpp file under the lgraph folder.
+
+TuGraph also customizes 4 commonly used atomic operations. When we need to modify the data of vertices in multithreaded mode, we should use atomic operations to ensure the correctness of the modification operation in parallel environment. In addition to these four atomic operations, users can also use "cas" to build their own atomic operation functions.
+
+- `bool cas(T \* ptr, T oldv, T newv)` : If the value pointed to by ptr is equal to oldv, the value pointed to by ptr is assigned to newv and returns true. Otherwise, false is returned
+- `bool write_min(T \*a, T b)` : If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `bool write_max(T \*a, T b)` : If b is larger than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `void write_add(T \*a, T b)` : adds the value of b to the value pointed to by a.
+- `void write_sub(T \*a, T b)` : subtract the value of b from the value pointed to by a.
+
+## 4.Vertex Class ParallelBitset
+
+When using TuGraph for batch operations, you need to use a vertex set to represent the vertices you want to process. ParallelBitset implements a vertex collection class that represents vertices in bits and thus saves a significant amount of memory. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 4.1ParallelBitset Class
+
+- `size_t Size()`：Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size_t size)`：Initialize size and data, the length of data is (size >> 6)+1.
+- `void Clear()`：clears the collection.
+- `void Fill()`：add all vertices to the set.
+- `bool Has(size_t i)`：check if vertex i is in the set.
+- `bool Add(size_t i)`：add vertex i to the set.
+- `void Swap(ParallelBitset &other)`：exchange elements with another set of ParallelBitset.
+
+## 5.Vertex Array Class ParallelVector
+
+When using TuGraph for batch operations, you need to use an array of vertices to represent the result of processing vertices. ParallelVector implements the vertex array class. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 5.1.ParallelVector Class
+
+- `ParallelVector(size_t capacity)` Builds ParallelVector. capacity is the initial size of the vertex array
+- `T& operator[](size_t i)` : data with subscript i
+- `T \*begin()` : ParallelVector the starting pointer
+- `T \*end()` : ParallelVector the end pointer to Parallelvector. begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to access an array sequentially
+- `T&Back ()` : ParallelVector the last data
+- `T \*Data()` : represents the data in the array itself
+- `void Destroy()' : empty the ParallelVector array and delete the array
+- `size_t Size()` : indicates the number of data in ParallelVector
+- `size_t Capacity()` : indicates the capacity of ParallelVector
+- `void Resize(size_t size)` : Change ParallelVector to size, which must be greater than or equal to the size before the change
+- `void Clear()` : empty the data in ParallelVector
+- `void ReAlloc(size_t capacity)` : ParallelVector is allocated with new capacity. If data exists in the array, it is migrated to the new memory
+- `void Fill(T elem)` : Assign elem to all data on ParallelVector
+- `void Append(const T&elem, bool atomic = true)` : Add a piece of data at the end of ParallelVector
+- `void Swap(ParallelVector<t> &other)` : to exchange data with other parallelvectors</t>
+- `ParallelVector<t> Copy()` : copies the current ParallelVector data into the Copy array</t>
+
+## 6.Customize data structures
+
+### 6.1.Basic data types
+
+We customize the data structure representation of points and edges to save memory space while covering all vertices:
+
+- 'Empty' : indicates a special data type with empty content.
+
+### 6.2.Combining data structures
+
+In order to facilitate calculation, we define several data structures of point and edge data according to different calculation scenarios, which are as follows:
+
+- `EdgeUnit<edgedata>` : represents an edge of weight type EdgeData, used to parse the input file, and contains three member variables:</edgedata>
+- `size_t src` : the starting vertex of an edge
+- `size_t dst` : the end of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjUnit<edgedata>` : represents an edge of weight type EdgeData, used during batch computation, and contains two member variables:</edgedata>
+- `size_t neighbour` : indicates the neighbor vertex of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjList<edgedata>` : Adjacency list of vertices with weights of type EdgeData, often used to represent the set of incoming and outgoing edges of vertices and containing two member variables:</edgedata>
+- `AdjUnit<t> \* begin` : indicates the start pointer of the list</t>
+- `AdjUnit<t> \* end` : The end pointer of the list.</t> begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to loop through the adjacency list.
+
+## 7.Graph class OlapBase
+
+Graph class OlapBase is the main class for TuGraph to load graphs and calculate graphs. OlapBase is commonly used to represent graphs with weights of type EdgeData. See olap_base.hpp under lgraph folder for the code. This chapter covers the types and API interfaces commonly used in Graph classes. The classes used by the Procedure, Embed, and Standalone functions described above are all subclasses of this class.
+
+### 7.1.Basic Information
+
+- `size_t NumVertices()` : obtains the number of vertices
+
+- `size_t NumEdges()` : Gets the number of edges
+
+- `size_t OutDegree(size_t vid)` : indicates the outdegree of the vid of the vertex
+
+- `size_t InDegree(size_t vid)` : indicates the input degree of vertex vid
+
+### 7.2.node sets and edge sets and their related operations
+
+- `ParallelVector AllocVertexArray()` : Allocates an array of type VertexData with size as the number of vertices
+
+- `void fill_vertex_array(V \* array, V value)` : assigns values to all elements in the array
+
+- `ParallelBitset AllocVertexSubset()` : Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+
+- `AdjList OutEdges(size_t vid)'`: gets the set of all outgoing edges of vertex v
+
+- `AdjList InEdges(size_t vid)` : Obtains the set of all incoming edges of vertex v
+
+- `void Transpose()` : transpose of a directed graph
+
+- `LoadFromArray(char \* edge_array, VertexId input_vertices, EdgeId input_edges, EdgeDirectionPolicy (edge_direction_policy) `: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+`edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+`input_vertices`: specifies the number of vertices read into the graph by the array.
+
+`input_edges` : specifies the number of edges that the array reads into the image.
+
+`edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+### 7.3.Locking mechanism
+
+TuGraph implements a pair of locks to control the program's access to vertex data. Respectively is:
+
+- `void AcquireVertexLock(size_t vid)` : locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(size_t vid)` : unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+- `VertexLockGuard GuardVertexLock(size_t vid)` : When the vid operation is performed, the vertex vid is locked, and the lock is automatically released upon exiting the scope
+
+### 7.4.Batch Processing Operations
+
+TuGraph provides two batch operations to do a point-centered batch process in parallel. Respectively is:
+
+```c++
+/*
+    Function Name:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    The work function executes the work function on nodes whose numbers are between lower and upper in the Graph. The fourth parameter indicates the accumulated base, which defaults to 0.The fifth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+For details, please refer to include/lgraph/olap_base.h
+
+    Example: Count the number of vertices in the parent array that have outgoing edges
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+graph is the instantiated object of graph class OlapBase
+
+```C++
+/*
+    Function Name:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    Function: Execute the work function for the node that corresponds to 1 in active_vertices. The third parameter represents the cumulative cardinality, which is 0 by default.
+
+    The fourth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+
+    For specific implementation, please refer to the specific code in /include/lgraph/olap_base
+
+
+
+    Example: Output all the out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..6015d7e1ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,303 @@
+# OlapOnDB API
+
+> This document provides detailed instructions for using the OlapOnDB API
+
+## 1.Introduction
+
+Generally speaking, users need to implement the process of subgraph extraction by themselves. Then use the rich interface in TuGraph to implement your own graph analysis algorithm.
+
+This document mainly introduces the Procedure and Embed interface design, and introduces some common interface, specific interface information see include/lgraph/olap_on_db.h file.
+
+## 2.Schema
+
+Procedure and Embed auxiliary functions are mainly included in the OlapOnDB class, and some more frequently used functions will be introduced one by one
+
+OLAP is associated with the following common data structures in TuGraph:
+
+1. DB graph analysis class `OlapOnDB`
+
+2. Vertex array `ParallelVector`
+
+3. Vertex set `ParallelBitset`
+
+4. Side data structure `AdjUnit/AdjUnit`
+
+5. Edge collection data structure `AdjList`
+
+### 2.1.Snapshot Based Storage Structure
+
+The OlapOnDB class in TuGraph provides a data "snapshot," that is, a fully usable copy of a given data set that includes a mirror image of the corresponding data at a certain point in time (the point at which the copy was started). Because OLAP operations involve only reads and not writes, OlapOnDB arranges data in a more compact manner, saving space while improving data access locality.
+
+### 2.2.BSP Calculation Model
+
+TuGraph uses the BSP (Bulk Synchronous Parallel) model in the process of calculation, which makes the process can be executed in parallel, and greatly improves the efficiency of the program.
+
+The core idea of BSP calculation model is to propose and use Super Step. After OlapOnDB is created, the computation on this data is divided into multiple supersteps, such as PageRank, which is divided into multiple iterations, and each iteration is a Super Step. There is explicit synchronization between different Super Steps to ensure that all threads proceed to the next Super Step at the same time after completing the same superstep. Within a Super Step, all threads execute asynchronously, using parallelism to improve computational efficiency.
+
+BSP calculation model can effectively avoid deadlock, and achieve coarse-grained global synchronization in hardware mode by means of obstacle synchronization, so that graph computation can be executed in parallel, and programmers do not need to spend much time on synchronization mutual exclusion.
+
+## 3.Algorithm example
+
+Here is an explanation of the PageRank algorithm, which is mainly divided into the main function Process and the PageRank algorithm process function.
+
+### 3.1.Main function
+
+The main function has three input parameters, 'TuGraph' database parameter 'db', the request 'request' obtained from the web side, and the return value 'response' given to the web side. The overall process can be divided into the following steps:
+
+1. Obtain related parameters
+
+2. Create a snapshot class
+
+3. Main process of PageRank algorithm
+
+4. Obtain and send the return value of the web page
+
+```c
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+
+    // Obtain the number of iterations from web side requests (num_iterations)，
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // Read transaction creation and snapshot class creation
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+
+    // Create a pr array to store the pr value for each node
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank algorithm main process, obtain the pagerank value of each node
+    PageRankCore(olapondb, num_iterations, pr);
+
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        Function Purpose: Gets the number of the node with the largest pagerank among all nodes
+
+        Function flow description: This function executes Func A for node vi (also known as the active vertices) corresponding to all bits of 1 in the vertex set all_vertices. The return value of Func A is then used as the second input parameter of Func B to obtain the local maximum value (because the first input parameter is 0. So the return value is actually the pagerank value of each node). Finally, the return value of all threads is summarized, and Func B is executed again to get the global return value, and stored in the max_pr_vi variable
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+
+    // Retrieve and send the return value from the web page
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2.PageRank Algorithm process
+
+`pagerank` main process has two input parameters, snapshot class (subgraph) and iteration times, the overall process can be divided into the following steps:
+
+1. Initialization of related data structures
+2. Initialize the pagerank value of each node
+3. Calculation of pagerank value of each node, active vertices for all vertices (means that all vertices need to calculate pagerank value)
+4. Obtain the pagerank value after 'num_iterations' of each node
+
+```c
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+
+    // Initialization of related data structures
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // The initialization of the pagerank value of each node is inversely proportional to the degree of the node
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // Total iteration process
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            Function Purpose: Calculates the pagerank of all nodes
+
+            Function flow description: This function is used to calculate the pagerank value of all nodes. Execute Func C on node vi corresponding to all the bits of 1 in all_vertices to obtain the pagerank value of vi in the current iteration and return the pagerank change value of vi node. The total change value of all active nodes is finally summarized and returned through the internal processing of the function, which is stored in the delta variable
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // Gets the pagerank value of the current node from its neighbor
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank value calculation core formula
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+
+                    // Statistics of relevant intermediate variables
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // The pagerank value obtained in this iteration is output as the input of the next iteration
+        curr.Swap(next);
+    }
+}
+```
+
+### 4.1.Transaction creation
+
+```c
+// Create a read transaction
+auto txn = db.CreateReadTxn();
+
+// Write transaction creation
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2.Parallelization to create a directed graph
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3.Create undirected graphs in parallel
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED;
+)
+```
+
+### 4.4.Obtain the output degree
+
+```c
+size_t OutDegree(size_t vid)
+```
+
+### 4.5.Obtain the input degree
+
+```c
+size_t InDegree(size_t vid)
+```
+
+### 4.6.Gets the outgoing edge set
+
+```c
+/*
+    Function name: AdjList OutEdges(size_t vid)
+
+    Data structure:
+
+    An AdjList can be understood as an array of structures of type AdjUnit
+
+    AdjUnit has two member variables: 1. size_t neighbour 2. edge_data: neighbour indicates the number of the target node pointed by the outgoing edge. If the value is a licensed graph, the data type of edge_data is the same as the weight value of the edge in the input file
+
+    Example Output all outgoing neighbors of node vid
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7.Gets the incoming edge set
+
+```c
+AdjList<edgedata> InEdges(size_t vid)</edgedata>
+
+// Example: Outputs all inbound neighbors of node vid
+for (auto & edge : olapondb.InEdges(vid)) {
+size_t dst = edge.neighbour;
+printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8.Get the node ID of OlapOnDB corresponding to the node in TuGraph
+
+```c
+size_t OriginalVid(size_t vid)
+
+// Note: The node numbers entered in TuGraph can be non-numbers, such as names. When OlapOnDB subgraphs are generated, names and other names will be converted to numbers for subsequent processing. Therefore, this method may not be applicable to some specific scenarios
+```
+
+### 4.9.Gets the node number of TuGraph corresponding to a node in OlapOnDB
+
+```c
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10.Description of active vertices
+
+Active vertices refer to the vertices that need to be processed in the batch function. In this example, we simply output the number of active vertices and summarize the number of active vertices:
+
+```c
+ParallelBitset temp = 000111; // The current active vertices are vertices 3, 4 and 5
+
+size_t delta = ForEachActiveVertex<double>(</double>
+//void c
+[&](size_t vi) {
+printf("active_vertexId = %lu\n",vi);
+return 1;
+},
+all_vertices
+);
+```
+
+The result of this function is obvious. Because of multiple threads, the output order may vary:
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+The local return value is 1. This function will add all the local return values in a thread-safe manner to the final return value, which is stored in the delta variable, and the final value is 3
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..bb3c784f13
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,213 @@
+# OlapOnDisk API
+
+> This document mainly introduces the usage instructions of OlapOnDisk API in detail
+
+## Table of contents
+
+- [1. Introduction](#1introduction)
+- [2. Algorithm Example](#2algorithm-example)
+     - [2.1 header files](#21head-file)
+     - [2.2 Configuration class MyConfig](#22configuration-class-myconfig)
+     - [2.3 Main function](#23main-function)
+     - [2.4 bfs algorithm flow](#24bfs-algorithm-process)
+- [3. Function description of other commonly used functions](#3description-of-other-commonly-used-functions)
+     - [3.1 Image Loading](#31graph-load)
+     - [3.2 Image writing](#32graph-write)
+     - [3.3 Graph Analysis Function](#33graph-parse-function)
+    
+### 1.Introduction
+
+The Standalone mode of TuGraph can be used to load graph data files, where the sources of graph data files can include text files, BINARY_FILE binary files, and ODPS sources. In this mode, TuGraph can quickly load multiple data sources into a graph, and then run iterative algorithms such as BFS, WCC, SSSP, etc. on the graph, and output the final result to the terminal.
+
+In TuGraph, the export and calculation process can be accelerated through parallel processing in memory, so as to achieve near real-time processing and analysis. Compared with traditional methods, it avoids the overhead of data export and storage, and can use compact Graph data structures achieve desirable performance for computation.
+
+TuGraph has built-in a large number of common graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement the specific graph calculation process by themselves. They only need to include the header file (.h) of the corresponding algorithm library when implementing their own stored procedures. To your own program, and link your own dynamic library files in the compilation phase.
+
+This document mainly introduces the common interfaces of Standalone, and the auxiliary functions used are mainly contained in the OlapOnDB class. At the same time, in order to help users understand and facilitate, the BFS algorithm is illustrated with examples.
+
+### 2.Algorithm example
+
+Here, the BFS algorithm is explained in blocks, which are roughly divided into the main function `main`, the BFS algorithm process `BFSCore` function and the configuration class MyConfig.
+
+#### 2.1.Head file
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //Header files to include when using TuGraph
+#include "./algo.h"   //A header file containing various algorithmic logic functions
+```
+
+When using TuGraph to realize the calculation application of graph data files, generally, the StandaloneGraph class object graph is first created, the graph file data is loaded into the graph, and then the graph calculation process is realized by calling the graph logic function, and finally the result of the graph calculation is printed out.
+
+#### 2.2.Configuration class MyConfig
+
+The MyConfig configuration class function is used to provide the configuration information required for the algorithm logic calculation, inherited from ConfigBase<EdgeData>, where EdgeDate can choose Empty (unweighted graph), int (the weight of the weighted graph is an integer) or double (the weight of the weighted graph is double) type.
+
+The MyConfig configuration class generally depends on the algorithm, and additional configuration information is required as follows:
+
+1. Parameters required by the algorithm
+2. Algorithm name
+3. Configure the Print function in the class
+Other common members inherit from ConfigBase, please refer to src/olap/olap_config.h for reference.
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // The parameters required by the algorithm are initialized
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // The configuration file accepts command line parameters. This use case will sequentially read the parameters when calling the algorithm from the command line. The value specified by the user is preferred. If the user does not specify it, the default parameter is selected.
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+#### 2.3.main function
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // Statistical memory consumption class MemUsage instantiation
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // Configuration class MyConfig instantiation
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk class instantiation
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // Statistical graph loading time consumption
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // Create an array to count whether a node has been traversed
+    auto parent = graph.AllocVertexArray<size_t>();
+    // Breadth-first search algorithm, returns the number of nodes connected to the root_vid root node in the graph
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // Print relevant information to the terminal
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+#### 2.4.bfs algorithm process
+
+The main process of `bfs` has two input parameters, the snapshot class (subgraph) and the number of iterations. The overall process can be divided into the following steps:
+
+1. Relevant definitions and initialization of data structures
+2. Use the batch function to perform cyclic calculations on each node, find all nodes adjacent to the current node in each round, and exchange them when the round ends.
+3. Until all nodes are found, return the number of nodes discovered_vertices.
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //Allocate an array, active_in is used to store the nodes found in the previous cycle stage
+  active_in.Add(root);            //Add the root node to the array
+  auto active_out = graph.AllocVertexSubset();  //Allocate the array active_out to store the nodes found in the current cycle stage
+  parent.Fill((size_t)-1);               //Assign a value of -1 to the node in the parent array, -1 means not found
+  parent[root] = root;
+  size_t num_activations = 1;       //Indicates the number of nodes found in the current loop phase
+  size_t discovered_vertices = 0;    //Indicates the total number of nodes found in the current cycle phase
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations indicates the number of nodes found in the current loop phase
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices indicates the total number of nodes found in the current cycle phase
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //Each cycle starts from the root node, finds adjacent adjacent nodes, changes its parent value, and operates num_activations+1
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //Store the nodes found in the current loop phase
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // return all nodes
+  return discovered_vertices;
+}
+```
+
+### 3.Description of other commonly used functions
+
+#### 3.1.Graph load
+
+TuGraph-StandaloneThe loading sources of graph data files are mainly divided into three categories: text files, binary files, and ODPS. The binary file is a file in which the binary representation of the edge data is arranged in order, which can save a lot of storage space. Its loading function is divided into three types, namely:
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：The loading method of the graph data file contains two parameters, and their meanings represent respectively
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `edge_direction_policy`：Specifies whether the graph is directed or undirected, including three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. Among them, DUAL_DIRECTION is the default graph loading method.
+  DUAL_DIRECTION : The input file is an asymmetric graph and the loaded graph is an asymmetric graph.
+  MAKE_SYMMETRIC : The input file is an asymmetric graph and the loaded graph is a symmetric graph.
+  INPUT_SYMMETRIC : The input file is a symmetric graph and the loaded graph is a symmetric graph.
+  For details, see `enum EdgeDirectionPolicy` in the olap_config.h file under the lgraph folder.
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：Load the vertices in the file into an array in the order of their ids. The meanings of each parameter are:
+  - `array`：array of data to be read
+  - `path`：The path to read the file, each line in the file represents a pair of vertex
+  - `parse_line`：A user-defined function that tells the system how to parse a line of text data into a vertex pair.
+
+
+#### 3.2.Graph write
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：Write the data in the array back to the file, and the meanings of each parameter are:
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `array`：array of data to be written
+  - `array_size`：The length of the number of data to be written
+  - `name`：algorithm name
+  - `filter_output`：Write data rule function, the data to be written needs to meet the requirements of this function.
+
+#### 3.3.graph parse function
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：Parse the graph data file, and load the graph as an unweighted graph.
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：Parse the graph data file, load the graph as a weighted graph, and specify the weight data type by modifying <EdgeData>.
+
+This function can be specified through the constructor parse_line when the MyConfig class is defined.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..9417b31135
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,423 @@
+# Python Olap API
+
+> This document mainly introduces the API usage of OlapBase OlapOnDB and OlapOnDisk in Python
+
+## Table of contents
+- [1.Overview](#1-overview)
+- [2.Configuration Requirements](#2-configuration-requirements)
+- [3.Cython](#3-cython)
+- [4.Olap API](#4-olap-api)
+    - [4.1. Atomic operations](#atomic-operations)
+    - [4.2. Vertex collection class ParallelBitset](#vertex-collection-class-parallelbitset)
+    - [4.3. Vertex array class ParallelVector](#vertex-array-class-parallelvector)
+    - [4.4. Custom data structure](#custom-data-structure)
+    - [4.5.Graph class OlapBase](#graph-class-olapbase)
+    - [4.6. Graph Class OlapOnDB](#graph-class-olapondb)
+    - [4.7.Graph class OlapOnDisk](#graph-class-olapondisk)
+- [5.lgraph DB API](#5-lgraph_db-api)
+- [6.Algorithm plugin example](#6-algorithm-plug-in-example)
+
+## 1 Overview
+
+This manual will introduce the simple configuration required to use the Python interface of the TuGraph graph computing system, and explain the TuGraph Python API in conjunction with the code. For details about the functions of class ParallelBitset, OlapBase, etc., see olap-base-api.md, olap-on-db-api.md and olap-on-disk-api.md.
+
+## 2. Configuration requirements
+
+If you want to use TuGraph to write and compile your own applications, the required configuration requirements are:
+
+- Linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+- A compiler that supports C++17 requires GCC version 5.4.1 or later.
+- Cython, version 3.0a1 or above is required, and the tested version is 3.0.0a11
+
+## 3. Cython
+Cython is an efficient programming language that is a superset of Python. Cython can translate .py files into C/C++ codes and compile them into Python extension modules, which can be called through import in Python. In TuGraph, all Python procedures are compiled into Python extension modules by Cython and then used.
+
+The main advantage of using Cython is that it combines the simplicity and ease of use of Python with the performance of C/C++. The TuGraph Python interface is implemented using Cython.
+
+[Cython Documentation](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+The Olap API is used for graph computing and is implemented in C++. The usage and functions are basically the same as the C++ interface. To use the API in a Python file, the interfaces declared in procedures/algo_cython/olap_base.pxd must be imported using `cython.cimports.olap_base import *`. The Python file can only be run after being compiled by Cython.
+
+### Atomic operations
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`: If the value pointed to by ptr is equal to oldv, assign the value pointed to by ptr to newv and return True, otherwise return False.
+- `write_min[T](a: cython.pointer(T), b: T)->cython.bint`: If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_max[T](a: cython.pointer(T), b: T)->cython.bint`: If b is greater than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_add[T](a: cython.pointer(T), b: T)->cython.bint`: Add the value of b to the value pointed to by a.
+- `write_sub[T](a: cython.pointer(T), b: T)->cython.bint`: Subtract the value pointed to by a from the value of b.
+
+### Vertex collection class ParallelBitset
+- `Size() -> size_t`: Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size: size_t)`: Initializes size and data, where the length of data is (size >> 6) + 1.
+- `Clear() -> cython.void`: Empties the collection.
+- `Fill() -> cython.void`: Adds all vertices to the set.
+- `Has(i: size_t) -> cython.bint`: Checks if vertex i is in the set.
+- `Add(i: size_t) -> cython.bint`: Adds vertex i to the set.
+- `Swap(other: ParallelBitset) -> cython.void`: Exchanges elements with another ParallelBitset set.
+
+### Vertex array class ParallelVector
+- `ParallelVector[T](size_t capacity)`: Constructs a ParallelVector, where capacity is the initial capacity of the vertex array.
+- `operator[](i: size_t) -> T`: Returns the data at index i.
+- `begin() -> cython.pointer(T)`: Returns the start pointer of ParallelVector.
+- `end() -> cython.pointer(T)`: Returns the end pointer of ParallelVector. The usage of begin() and end() is similar to the begin and end pointers of the vector container, and these two pointers can be used to sequentially access the array.
+- `Back() -> T`: Returns the last data of ParallelVector.
+- `Data() -> cython.pointer(T)`: Indicates the data of the array itself.
+- `Destroy() -> cython.void`: Clears the data in the ParallelVector array and deletes the array.
+- `Size() -> size_t`: Indicates the number of data in ParallelVector.
+- `Resize(size: size_t) -> cython.void`: Changes ParallelVector to size, which should be greater than or equal to the size before the change and less than capacity.
+- `Clear() -> cython.void`: Clears the data in ParallelVector.
+- `ReAlloc(capacity: size_t) -> cython.void`: Allocates a new capacity size to ParallelVector. If the array has data, it migrates the data to the new memory.
+- `Fill(elem: T) -> cython.void`: Assigns elem to all data of ParallelVector.
+- `Append(elem: T, atomic: cython.bint = true) -> cython.void`: Adds a data to the end of ParallelVector.
+- `Swap(other: ParallelVector[T]) -> cython.void`: Exchanges data with another ParallelVector.
+- `Copy() -> ParallelVector[T]`: Copies the current ParallelVector data and stores it in the copy array.
+
+
+### Custom Data Structure
+- `Empty`: A special data type whose content is empty.
+- `EdgeUnit[EdgeData]`: Indicates the edge whose weight type is EdgeData, used to parse the input file, including three member variables:
+    - `src: size_t`: starting vertex of the edge
+    - `dst: size_t`: end of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjUnit[EdgeData]`: indicates the edge whose weight type is EdgeData, which is used in the batch calculation process and contains two member variables:
+    - `neighbor: size_t`: neighbor vertex of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjList[EdgeData]`: The adjacency list of vertices whose weight type is EdgeData, often used to represent the set of incoming and outgoing edges of vertices, including three member functions:
+    - `begin()->cython.pointer(AdjUnit[T])`: the starting pointer of the list
+    - `end()->cython.pointer(AdjUnit[T])`: the end pointer of the list
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: the data whose subscript is i
+
+### Graph class OlapBase
+- `NumVertices()->size_t`: get the number of vertices
+- `NumEdges()-> size_t`: get the number of edges
+- `OutDegree(vid: size_t)-> size_t`: out-degree of vertex vid
+- `InDegree(vid: size_t)->size_t`: in-degree of the vertex vid
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`: Allocates an array of type VertexData with size as the number of vertices
+- `AllocVertexSubset()-> ParallelBitset`: Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all outgoing edges of vertex v
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all incoming edges of vertex v
+- `Transpose()->cython.void`: transpose of a directed graph
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+    - `edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+    - `input_vertices`: specifies the number of vertices read into the graph by the array.
+
+    - `input_edges` : specifies the number of edges that the array reads into the image.
+
+    - `edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`: locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`: unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+
+TuGraph provides two batch operations to perform point-centric batch processing in parallel, which is slightly different from C++ in Python.
+
+```python
+# Function name: ProcessVertexInRange[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# lower: size_t, upper: size_t,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Executes the work function on nodes whose node numbers are between lower and upper in the Graph. The fourth parameter indicates the base of accumulation, which is 0 by default.
+# The fifth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in include/lgraph/olap_base.h
+#
+# Example usage: Count the number of vertices with edges in the parent array.
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython.pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+g is the instantiated object of graph class OlapBase
+
+```python
+# Function name: ProcessVertexActive[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# active: ParallelBitset,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Execute the work function on the nodes corresponding to 1 in the active_vertices bitset. The third parameter indicates the base of accumulation, which is 0 by default;
+# The fourth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in /include/lgraph/olap_base.h
+#
+# Usage example: Output all out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes.
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self. graph. OutDegree(vi)
+        dst: size_t
+        edges = self. graph. OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbor
+            printf("node %lu has neighbor %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+As shown in the above two examples, ProcessVertexActive and ProcessVertexInRange in Python require an additional algorithm class pointer parameter compared to their C++ counterparts. The Work function is generally used as a member function of the algorithm class to access member variables, such as in the graph and ParallelVector parent examples shown above. When calling the batch function, the Work function and the self pointer of the algorithm class are passed to the batch function.
+
+The Work function will be called in multiple threads, so the @cython.nogil decorator is added to release the Python global interpretation lock. In code executed by multiple threads, such as the Work function in the batch function, variables are better declared as C/C++ types using `dst: type` or `dst = cython.declare(type)`. This is because Python objects cannot be used in multi-threaded code.
+
+### Graph class OlapOnDB:
+Parallelize to create a directed graph:
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+Parallelize to create an undirected graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING creates a directed graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### Graph class OlapOnDisk
+
+#### ConfigBase:
+- `ConfigBase()`: Constructor
+- `std::string input_dir`: graph edge table data path
+- `std::string output_dir`: output path
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: read in graph data
+
+## 5. lgraph_db API
+Please refer to the files procedures/algo_cython/lgraph_db.pxd and lgraph_db_python.py for the lgraph_db API.
+
+The usage and functions of the interface in lgraph_db.pxd are basically the same as the C++ interface. The interface declared in lgraph_db.pxd is implemented in C++. In the py file, it must be imported by `cython.cimports.olap_db import *` and compiled by the Cython file to run.
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: Get the vid of the vertex
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: constructor, dir_path is the db path
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: set user
+- `SetUser(user: std::string)-> cython.void`: set user
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: create GraphDB
+
+### GraphDB:
+- `CreateReadTxn()-> Transaction`: create a read-only transaction
+- `CreateWriteTxn()-> Transaction`: create a write transaction
+- `ForkTxn(txn: Transaction)-> Transaction`: Copy transactions, only read transactions can be copied
+
+### Transaction:
+```
+GetVertexIndexIterator(
+                 label: std::string,
+                 field: std::string,
+                 key_start: std::string,
+                 key_end: std::string) -> VertexIndexIterator
+```
+Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v
+
+
+
+lgraph_db_python.py packages the C++ classes Galaxy and GraphDB from lgraph_db.pxd as Python classes. After compiling lgraph_db_python.py into a Python extension, you can directly access it in a Python file or from the Python command line by importing it with `import lgraph_db_python`.
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: constructor, dir_path is the db path
+- `SetCurrentUser(self, user: str password: str)-> void`: set user
+- `SetUser(self, user: std::string)-> void`: set user
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: create PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)->cython.Py_ssize_t`: address of C++ class GraphDB
+
+## 6. Algorithm plug-in example
+The following is a code example of the BFS algorithm implemented in Python:
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# Comments work as follows:
+# language_level=3: use Python3
+# cpp_locals=True: C++17 is required, and std::optional is used to manage C++ objects in Python code, which can avoid copy construction of C++ objects
+# boundscheck=False: Turn off bounds checking for indexes
+# wraparound=False: Turn off the processing of negative subscripts (similar to Python List)
+# initializedcheck=False: Turn off checking whether the memory is initialized, and the running performance will be faster after turning off the check
+# language = c++: translate this .py file to C++ instead of C file. TuGraph uses a lot of template functions, so C++ should be used
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# From procedures/algo_cython/ cimportolap_base.pxd and lgraph_db.pxd, similar to #include "xxx.h" in C++
+
+from cython.cimports.libc.stdio import printf
+# Similar to #include <stdio.h> in C++
+# Other common ones include cython.cimports.libcpp.unordered_map, etc.
+
+import time
+
+@cython.cclass
+# cython.cclass indicates that BFSCore is a C-type Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty]) indicates the pointer of OlapBase[Empty], similar to OlapBase[Empty]* in C++
+    # Cython provides common types of pointers, such as cython.p_int, cython.p_char, etc.
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t declares root as a C++ size_t type variable, equivalent to root = cython.declare(size_t)
+    # Variables that do not declare a type are Python object types
+    # Declaring variable types will greatly improve performance, and in the multi-threaded part, only C/C++ type variables can be accessed
+
+    @cython.cfunc
+    # cython.cfunc indicates that Work is a C-type function, and the parameters and return values should be declared
+    # cfunc has good performance and can accept C/C++ objects as parameters and return values, but it cannot be called in other python files
+    # Similar to cython.ccall, such as Standalone function, which can be called in other python files
+    @cython.nogil
+    # cython.nogil means to release the Python global interpretation lock. In the part modified by nogil, Python objects cannot be accessed
+    # In the multi-threaded part, there should be nogil decorator
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) means that exception propagation is disabled, and Python exceptions raised inside the function will be ignored
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbor
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 means that dst has not been visited by bfs
+                if self.active_out.Add(dst):
+                    # Set dst as an active node; ParallelBitmap.Add is an atomic operation to prevent double calculation
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython. size_t:
+        self. graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self. parent. Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self. active_in. Add(self. root)
+        while num_activations > 0:
+            self. active_out. Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self. active_out. Swap(self. active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time. time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # Create OlapOnDB in parallel
+    # Cython does not support dereference operations such as *db, use db[0] to dereference
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # Get the iterator of the root node through GetVertexIndexIterator based on the root node label name, field name and field value (root_id),
+    # and get the vid through the iterator. When there is no ID_MAPPING, the vid is the same as the id in OlapOnDB
+    cost = time. time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time. time()
+    count = a. run(cython. address(olapondb), root_vid)
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb. NumVertices()
+    response["num_edges"] = olapondb. NumEdges()
+    return True
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process is the plug-in entry in embed mode and procedure mode, modified with cython.ccall
+    # The Process function must be named Process, and the parameters are lgraph_db_python.PyGraphDB and bytes
+    # The return value must be (bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # Get the address of the GraphDB object in the PyGraphDB, convert it to a pointer and pass it
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..e496945495
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,191 @@
+# TuGraph Built-in Algorithm Description
+
+> This document mainly introduces the TuGraph built-in algorithm program in detail, the community version of 6 algorithms can refer to the basic algorithm newspaper
+
+## 1.Introduction
+
+TuGraph currently contains the following 6 basic algorithms and 28 extended algorithms, a total of 34 graph algorithms:
+
+### 1.1.Basic algorithms:
+
+|    Algorithm name            | The program name |
+| :--------------------------: | :--------------: |
+|     Breadth-First Search     |       bfs        |
+|           Pagerank           |     pagerank     |
+| Single-Source Shortest Path  |       sssp       |
+| Weakly Connected Components  |       wcc        |
+| Local Clustering Coefficient |       lcc        |
+| Label Propagation Algorithm  |       lpa        |
+
+### 1.2.Extended algorithms:
+
+|            Algorithm name                    |   The program name   |
+| :------------------------------------------: | :------------------: |
+|            All-Pair Shortest Path            |         apsp         |
+|            Betweenness Centrality            |          bc          |
+|              Belief Propagation              |          bp          |
+|             Closeness Centrality             |          clce        |
+|             Common Neighborhood              |          cn          |
+|              Degree Correlation              |          dc          |
+|             Dimension Estimation             |          de          |
+|                    EgoNet                    |          en          |
+|        Hyperlink-Induced Topic Search        |         hits         |
+|                Jaccard Index                 |          ji          |
+|                    K-core                    |        kcore         |
+|                   Louvain                    |       louvain        |
+|        Multiple-source Shortest Paths        |         mssp         |
+|            Personalized PageRank             |         ppr          |
+|        Strongly Connected Components         |         scc          |
+| Speaker-listener Label Propagation Algorithm |         slpa         |
+|          Single-Pair Shortest Path           |         spsp         |
+|              Triangle Counting               |       triangle       |
+|                  Trustrank                   |      trustrank       |
+|     Weighted Label Propagation Algorithm     |         wlpa         |
+|         Weighted Pagerank Algorithm          |      wpagerank       |
+|           Maximal independent set            |         mis          |
+|                  Sybil Rank                  |      sybilrank       |
+|             Subgraph Isomorphism             | subgraph_isomorphism |
+|                    Motif                     |        motif         |
+|                   Kcliques                   |       kcliques       |
+|                    Ktruss                    |        ktruss        |
+|                    Leiden                    |        leiden        |
+
+## 2.Basic algorithms
+
+### 2.1.Breadth-First Search
+
+Breadth first Search implements the Breadth-first Search algorithm, which starts from the root vertex and traverses all accessible vertices along the width of the graph. Returns the number of vertices traversed. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 2.2.Pagerank
+
+Web page sorting program to achieve the commonly used Pagerank algorithm. The algorithm calculates the importance ranking of all vertices according to the edge and edge weight in the graph. The higher the PageRank value, the higher the importance of the vertex in the graph. The reciprocal of the number of vertices is used as the initial Rank value of each vertex, and then the Rank value of the vertices is transferred to the adjacent vertices on average according to the outgoing edges, and the transfer process is repeated until the given convergence threshold is met or the given number of iterations is reached. At the end of each pass round, a certain proportion of the Rank values of all vertices will be randomly transferred to any vertex. Please refer to the algorithm content [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 2.3.Single-Source Shortest Path
+
+The Single Source Shortest Path algorithm realizes the Single Source Shortest Path algorithm. It calculates the shortest path length from a given source vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 2.4.Weakly Connected Components
+
+The program of Weakly Connected Components has implemented the algorithm. It can calculate all the weakly connected components in the graph. A weakly connected component is a subgraph of a graph in which reachable paths exist between any two points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Connected*component*(graph_theory)](<https://en.wikipedia.org/wiki/Connected_component_(graph_theory)> "scc wiki")。
+
+### 2.5.Local Clustering Coefficient
+
+The average Clustering Coefficient program implements the Local Clustering Coefficient algorithm to calculate the coefficient of the degree of clustering between vertices in the graph. The returned results include the overall clustering coefficient and the vertex clustering coefficient. The overall agglomeration coefficient reflects the evaluation of the overall agglomeration degree in the graph, and the vertex agglomeration coefficient includes the agglomeration coefficient of any vertex, which reflects the agglomeration degree near the vertex. The higher the agglomeration coefficient, the higher the agglomeration degree. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 2.6.Label Propagation Algorithm
+
+The program implements Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and computes unauthorised graphs. In label passing, each vertex adds up all the labels received, and randomly selects one of the labels with the highest sum. The iteration converges or the algorithm terminates after a given number of rounds. The final output is a label for each vertex, and vertices with the same label value are considered to be in the same community. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+## 3.Extended algorithms
+
+### 3.1.All-Pair Shortest Path
+
+The All-Pair Shortest Path program realizes the all-pair Shortest Path algorithm and calculates the shortest path between any two points in the graph. Returns the shortest path length between any pair of vertices where the path exists. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 3.2.Betweenness Centrality
+
+Betweenness Centrality algorithm is implemented in Betweenness centrality program to estimate the betweenness centrality value of all vertices in a graph. The value of intermediate centrality reflects the possibility that any shortest path in the graph passes through the vertex, and the higher the value, the more shortest paths pass through the vertex. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 3.3.Belief Propagation
+
+The Belief Propagation algorithm is implemented in the confidence propagation program. Given the edge distribution of the observed vertices, the algorithm estimates the edge distribution of the unobserved vertices by using the mechanism of passing messages among vertices. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 3.4.Closeness Centrality
+
+The Distance Centrality program implements the Closeness Centrality algorithm, which estimates the average shortest path length from any node to other nodes in the graph. A smaller distance centrality value indicates that the node has a smaller average shortest distance to other nodes, meaning it is more centrally located in the graph from a geometric perspective. The calculation requires specifying the number of sampling points, and the algorithm computes the centrality values for each of these sampling points. For the algorithm content, please refer to [https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki").
+
+### 3.5.Common Neighborhood
+
+The Common Neighborhood program implements the common Neighborhood algorithm to count the number of common neighbors between any given pair of neighboring vertices. Given several pairs of vertices to be queried, the result is the number of common neighbors of any pair of vertices to be queried.
+
+### 3.6.Degree Correlation
+
+The Degree Correlation algorithm is implemented in the degree correlation program. It calculates the degree correlation degree of a graph by calculating the Pearson correlation coefficient between any adjacent vertex pairs, which can be used to characterize the correlation degree between high-degree vertices in the graph. A higher degree of correlation indicates a higher degree of correlation between vertices of higher degree in the graph. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 3.7.Dimension Estimation
+
+The diameter Estimation program implements the Dimension Estimation algorithm. The algorithm calculates the length of the longest shortest path in the graph, which is used to characterize the diameter of the graph. Please refer to the algorithm content[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### 3.8.EgoNet
+
+The EgoNet algorithm requires a given root vertex and K value, and takes the root vertex as the source vertex to conduct a width-first search to find the subgraph composed of all neighbors within K degrees. The found subgraph is called the EgoNet of the root vertex.
+
+### 3.9.Hyperlink-Induced Topic Search
+
+The Hyperlink Topic Search algorithm implements the Hyperlink-induced topic search algorithm, which assumes that each vertex has two attributes: Authority and Hub. A good hub vertex should point to many vertices with high authority. And a good authority vertex should be pointed to by many vertices of high pivot type. The algorithm returns the authority value and the hub value for each vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 3.10.Jaccard Index
+
+The Jaccard coefficient program implements the Jaccard Index algorithm. The algorithm calculates the Jaccard coefficient between a given pair of vertices, which can be used to represent the similarity of the two vertices. A higher Jaccard coefficient indicates a higher degree of similarity between pairs of vertices. Given several pairs of vertices with the query, the Jaccard coefficients of these pairs are returned. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### 3.11.K-core
+
+k accounting method implements k-core algorithm. The algorithm computes the number of kernels of all vertices, or finds all K-nucleon graphs in the graph. K-nucleon graph is a special subgraph in which the degree of any vertex is not less than a given K value. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Degeneracy\_(graph_theory)](<https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)> "kcore wiki")。
+
+### 3.12.Louvain
+
+The Louvain community discovery program implements the Fast-unfolding algorithm. The algorithm is a community discovery algorithm based on modularity. It maximizes the modularity of the graph by constantly merging vertex communities, and can discover the hierarchical community structure. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 3.13.Multiple-source Shortest Paths
+
+The multisource Shortest Paths program implements the multiple-source Shortest Paths algorithm to calculate the shortest path value to any vertex from the given Multiple source vertices. Where, the shortest path value of multiple source vertices to a vertex is the minimum value of the shortest path from each source vertex to the vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 3.14.Personalized PageRank
+
+Personalized web ranking program has Personalized PageRank algorithm. According to the given source vertex, the algorithm calculates the importance ranking of all vertices to the source vertex based on the source vertex. The higher the Rank value, the more important the vertex is to the source vertex. Unlike PageRank, the source vertex Rank value is 1, the rest of the vertex Rank value is 0; And a certain proportion of Rank value will be immediately transferred back to the source vertex after each round of transmission. Please refer to the algorithm content [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 3.15.Strongly Connected Components
+
+Strongly Connected component program realizes the Strongly Connected Components algorithm. The algorithm computes all strongly connected components of the graph, which is a subgraph of the graph that can start from any vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 3.16.Speaker-listener Label Propagation Algorithm
+
+The program realizes the Speaker-listener Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and historical tag record, which is an extension of tag propagation algorithm. Different from the label propagation algorithm, this algorithm records the historical labels of all vertices. When the labels are accumulated in the iteration, the historical labels are also counted. The final output is all the historical label records for each vertex. Please refer to the paper for the algorithm content:“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 3.17.Single-Pair Shortest Path
+
+The program of the shortest path between two points implements the Bidirectional point-first Search algorithm. It searches forward width First along the outgoing edge from the starting point and reverse width first along the incoming edge from the end point on the directed undirected graph. The shortest path length from the starting point to the ending point is determined by traversing the vertices of the starting point and the ending point together. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 3.18.Triangle Counting
+
+The Triangle-counting algorithm is implemented to calculate the number of triangles in an undirected graph, which can be used to characterize the correlation degree of the vertices in the graph. The higher the number of triangles, the higher the degree of correlation of the vertices in the graph. For the algorithm content, please refer to the paper, "Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study".
+
+### 3.19.Trustrank
+
+The Trust Index Sorting Algorithm implements the Trustrank algorithm, which can calculate the Trust Index of any vertex based on a given whitelist. The higher the trust score, the less likely the vertex is to be illegal. Please refer to the algorithm content for details. [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 3.20.Weighted Label Propagation Algorithm
+
+Weighted Label Propagation Algorithm is implemented in the program. = Different from the label propagation algorithm, the label transmission is related to the weight of the edge. During label transmission, the weight of each vertex will be accumulated according to the incoming edge of the label, and the label with the highest sum will be randomly selected. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 3.21.Weighted Pagerank Algorithm
+
+Weighted Pagerank is implemented in the weighted Pagerank algorithm. Different from PageRank algorithm, the transfer of Rank value is related to the weight of the edge. The Rank value of the vertex will be transferred to the adjacent vertices according to the weight of the edge. Please refer to the algorithm content[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 3.22.Maximal independent set
+
+Maximal independent set algorithm implements Maximal Independent Set algorithm. A maximum independent set means that there are no vertices outside the independent set that can join it. A graph may have many MIS that vary greatly in size, and the algorithm finds one of them. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### 3.23.Sybil Rank
+
+Sybil detection algorithm implements Sybil Rank algorithm. The SybilRank algorithm starts from non-Sybil nodes and performs a random walk with premature termination. Please refer to the paper for the algorithm content:“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 3.24.Subgraph Isomorphism
+
+The subgraph matching algorithm implements the subgraph_isomorphism algorithm. The subgraph_isomorphism algorithm matches all nodes in the whole graph and outputs the number of times each node is matched. Algorithm Content Reference [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 3.25.Motif
+
+Pattern matching algorithm implements motif algorithm. motif algorithm matches k-order subgraphs for the specified nodes, and finally outputs the number of each kind of K-order subgraphs for each specified node. Each K-order subgraph is represented by a 64-bit integer, and the $i \times k + j$bit is 1, indicating that there is an edge i->j in the subgraph. Algorithm Content Reference [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### 3.26.Kcliques
+
+The K-order clique counting algorithm implements the k-cliques algorithm. The k-cliques algorithm calculates the number of all K-order complete subgraphs in the graph, and finally outputs the number of k-order complete subgraphs of each node. Algorithm Content Reference [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### 3.27.Ktruss
+
+The k-order truss counting algorithm implements the k-truss algorithm. A k-truss is a subgraph in which each edge is the edge of at least k-2 triangles. The k-truss algorithm finds out the k-truss subgraph of the graph, and finally outputs the neighbor node list of each node in the subgraph. Algorithm Content Reference[https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+
+### 3.28.Leiden
+
+Leiden algorithm implements Leiden's algorithm. leiden algorithm is a community discovery algorithm based on modularity. Compared with louvain algorithm, leiden algorithm has the advantage that Leiden algorithm detects the broken links in the community to ensure that each community has good connectivity. Algorithm Content Reference [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..dc955b3b91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..689128d8a0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,100 @@
+# Learning Tutorial
+
+> This document is designed as a guide for TuGraph users. Before reading the detailed documentation, users should first read this document to have a general understanding of the graph learning process of TuGraph, which will make it easier to read the detailed documentation later. The guide program is based on a simple program instance of TuGraph, and we will focus on its usage.
+
+## 1. Introduction to TuGraph Graph Learning Module
+Graph learning is a machine learning method that utilizes the topological information of a graph structure to analyze and model data. Unlike traditional machine learning methods, graph learning uses graph structures where vertices represent entities in data and edges represent relationships between entities. By extracting features and patterns from these vertices and edges, deep associations and patterns can be revealed in data that can be used in various practical applications.
+
+The TuGraph Graph Learning Module is a graph learning module based on a graph database that provides four sampling operators: Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. These operators can be used to sample vertices and edges in a graph to generate training data. The sampling process is performed in a parallel computing environment, providing high efficiency and scalability.
+
+After sampling, the obtained training data can be used to train a model that can be used for various graph learning tasks such as prediction and classification. Through training, the model can learn the relationships between vertices and edges in the graph, allowing for prediction and classification of new vertices and edges. In practical applications, this module can be used to handle large-scale graph data such as social networks, recommendation systems, and bioinformatics.
+
+## 2. Run Process
+The TuGraph graph learning module samples graph data in TuGraph, and the sampled vertices and edges are used as graph learning features for learning and training. The operation process is shown in the figure below:
+
+![Alt text](../../../../images/learn_flow_chart_en.png)
+
+## 3. TuGraph compilation and data preparation
+For TuGraph compilation, please refer to: [Compile](../../5.installation&running/6.compile.md)
+Execute in the build/output directory:
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+This command copies the relevant files of the dataset to the build/output directory.
+
+## 4. Data Import
+Please refer to [Data Import](../../6.utility-tools/1.data-import.md) for data import.
+
+Taking the cora dataset as an example for the import process:
+
+Execute in the build/output directory:
+
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Where cora.conf is the graph schema file representing the format of the graph data. coradb is the imported graph data file name representing the storage location of the graph data.
+
+## 5. Feature Conversion
+Since the features in graph learning are generally represented as long float arrays, TuGraph does not support loading float array types, so they can be imported as string types and converted to char* for subsequent storage and access, and the implementation details can refer to the feature_float.cpp file.
+
+The specific execution process is as follows:
+
+Compile the imported plugin in the build directory.（Skip if TuGraph has been compiled）:
+
+`make feature_float_embed`
+
+Execute in the build/output directory:
+
+`./algo/feature_float_embed ./coradb`
+
+Then the conversion can be performed.
+
+## 6. Sampling Operators and Compilation
+TuGraph implements an operator for obtaining the full graph data and four sampling operators at the cython layer, as follows:
+
+### 6.1.Sampling Operator Introduction
+|Sampling Operator | Sampling Method |
+| --- | --- |
+|GetDB | Get the graph data from the database and convert it into the required data structure |
+|Neighbor Sampling | Sample the neighboring nodes of the given node to obtain the sampling subgraph |
+|Edge Sampling | Sample the edges in the graph according to the sampling rate to obtain the sampling subgraph |
+|Random Walk Sampling | Conduct a random walk based on the given node to obtain the sampling subgraph |
+|Negative Sampling | Generate a subgraph of non-existent edges|
+
+### 6.2.Compilation
+Skip if TuGraph has been compiled.
+Execute in the tugraph-db/build folder:
+
+`make -j2`
+
+Or execute in the tugraph-db/learn/procedures folder:
+
+`python3 setup.py build_ext -i`
+
+Once the algorithm so is obtained, it can be used by importing it in Python.
+
+## 7. Model Training and Storage
+TuGraph calls the cython layer operator at the Python layer to implement graph learning and training.
+
+The usage of the TuGraph graph learning module is as follows:
+
+Execute in the build/output folder:
+
+`python3 train_full_cora.py --model_save_path ./cora_model`
+
+Then training can be performed.
+
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+## 8. Model Loading
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+Before using a saved model, it is necessary to load it first. In the code above, the trained model is loaded using the provided code.
+
+After loading the model, we can use it to make predictions and classifications for new vertices and edges. For prediction, we can input one or multiple vertices and the model will output corresponding prediction results. For classification, we can input the whole graph, and the model will classify the vertices and edges in the graph to achieve the task goal.
+
+Using a trained model can save time and resources compared to retraining the model. Additionally, since the model has already learned the relationships between vertices and edges in the graph, it can adapt well to new data and improve the accuracy of predictions and classifications.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..c649fa50e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,102 @@
+# Sampling API
+
+>This document provides a detailed guide on using the Sampling API of TuGraph.
+
+## 1. Overview
+This manual introduces the Sampling API using TuGraph.
+
+## 2. Graph Data Instantiation
+Before the sampling operation, load the graph data according to the graph data path, and map it into the olapondb graph analysis class, the code is as follows:
+
+```python
+galaxy = PyGalaxy(args.db_path) # Create a galaxy instance based on the path
+galaxy.SetCurrentUser(args.username, args.password) # Set the current user
+db = galaxy.OpenGraph('default', False) # Open the graph database specified by db
+txn = db.CreateReadTxn() # Create a transaction instance
+olapondb = PyOlapOnDB('Empty', db, txn) # Instantiate OlapOnDB based on the graph loading method, graph database instance, and transaction instance
+del txn
+del db
+del galaxy
+```
+## 3. Introduction to Sampling Operators
+The graph sampling operator is implemented in the cython layer and is used to sample the input graph. The generated NodeInfo is used to save point information such as feature attributes and label attributes, and EdgeInfo is used to save edge information. These metadata information can be used for features Extraction, network embedding and other tasks. Currently, the TuGraph graph learning module supports five sampling operators: GetDB, NeighborSampling, EdgeSampling, RandomWalkSampling, and NegativeSampling.
+
+### 3.1.RandomWalk Operator
+Random walks are performed a specified number of times around the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.2.NeighborSampling Operator
+A certain number of nodes are sampled from the first-degree neighbors of the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.3.NegativeSampling Operator
+The negative sampling algorithm is used to generate a subgraph of non-existent edges.
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+num_samples: The number of false edges to be generated.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.4.EdgeSampling Operator
+The edge sampling algorithm is used to generate a subgraph of sampled edges.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_rate: The sampling rate of the edges to be selected.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.5.GetDB Operator
+Get the graph data from the database and convert it into the required data structure.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+## 4. User-Defined Sampling Algorithm
+Users can also implement a custom sampling algorithm through the TuGraph Olap interface. For the interface document, see [here](../2.olap/5.python-api.md). This document mainly introduces the interface of related functions used by the graph sampling algorithm design.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..510f3d4fcd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,96 @@
+# Training
+> This document details how to use TuGraph for training Graph Neural Networks (GNNs).
+
+## 1. Training
+When using TuGraph's graph learning module for training, it can be divided into two categories: full graph training and mini-batch training.
+
+Full graph training involves loading the entire graph from the TuGraph db into memory and training the GNN. Mini-batch training uses the sampling operator of the TuGraph graph learning module to sample the entire graph data and then input it into the training framework for training.
+
+## 2. Mini-Batch Training
+Mini-batch training requires the use of TuGraph's graph learning module's sampling operators, which currently support Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. The sampling result of the TuGraph graph learning module's sampling operator is returned in the form of a List.
+
+The following takes Neighbor Sampling as an example to introduce how to convert the sampled results into the training framework for format conversion.
+The user needs to provide a Sample class:
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. Load graph data
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+        # 2. Sampling method, the result is stored in NodeInfo and EdgeInfo
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+        # 3. Format conversion of the result to fit the training format
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+As shown in the code, the graph data is first loaded into memory. Then use the sampling operator to sample the graph data, and the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and the stored information results are as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Finally, we format the result to fit the training format. Here we use the DGL training framework, so we construct a DGL Graph using the result data, and then return the DGL Graph.
+
+Once we provide the TuGraphSample class, we can use it for Mini-Batch training. Let the data loading part of DGL use the sampler instance of TuGraphSample as follows:
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+Use DGL for model training:
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+## 3. Full-Batch training
+Full-Batch training of GNNs (Graph Neural Networks) is a type of training that involves processing the entire training dataset at once. It is one of the simplest and most straightforward training methods for GNNs, where the entire graph is treated as a single instance. In full-batch training, the entire dataset is loaded into memory and the model is trained on the entire graph. This type of training is especially useful for small to medium-sized graphs, and is mainly used for static graphs that do not change over time.
+```python
+getdb. Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+The full graph are then fed into the training framework for training.
+Full code: learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..556c3c1fd0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,101 @@
+# Heterogeneous Graph
+
+> This document describes how to use heterogeneous graphs for training.
+
+## 1. Introduction to Heterogeneous Graph
+A heterogeneous graph is a graph structure composed of nodes and edges of different types. In a heterogeneous graph, nodes and edges can have diverse attributes and relationships, representing different entities and their complex associations.
+
+In a heterogeneous graph, node types can represent different entities such as users, products, topics, etc., while edge types represent the relationships between different entities, such as the follow relationship between users, or the purchase relationship between users and products. Nodes and edges can have different attributes.
+
+Heterogeneous graphs provide a powerful graph model that can better express and analyze real-world systems with multiple entity types and complex relationships. They have broad application prospects and research value in various fields of data analysis and applications.
+
+## 2. Creating a Heterogeneous Graph
+In TuGraph, a heterogeneous graph is composed of a series of edge relationships. Each relationship is defined by a triplet of strings: (source node type, edge type, target node type). The creation of a heterogeneous graph is similar to that of a homogeneous graph, but the triplet definition needs to be specified when creating the graph. The following example demonstrates:
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+In the code snippet above, the fourth parameter is the edge relationship definition of the heterogeneous graph. By specifying this parameter, you can select specific node and edge types for graph construction and training. If this parameter is not specified, all node and edge types will be used for graph construction by default.
+
+## 3. Heterogeneous graph query interface
+To facilitate user usage, TuGraph provides interfaces for querying node and edge types when the fourth parameter is given. The following examples demonstrate these interfaces:
+
+### 3.1 Querying Node Types
+```python
+olapondb.ntypes()
+```
+The return value is a list of node types, such as ['node1', 'node2', 'node3'].
+
+### 3.2 Querying Edge Types
+```python
+olapondb.etypes()
+``` 
+The return value is a list of edge types, such as ['edge1', 'edge2', 'edge3'].
+
+### 3.3 Querying Node and Edge Types
+```python
+olapondb.metagraph()
+```
+The return value is a list of string triplets (source node type, edge type, target node type), such as
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')].
+
+## 4 Heterogeneous graph output format
+The same as the homogeneous graph, the sampling data results of the heterogeneous graph are also stored in NodeInfo and EdgeInfo.
+Output data can be obtained in the following ways.
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+
+The result of its stored information is as follows:
+| Graph Data | Storage Location |
+| --- | --- |
+| Edge Source | EdgeInfo[0] |
+| Edge Destination | EdgeInfo[1] |
+| Edge Type | EdgeInfo[2] |
+| Vertex ID | NodeInfo[0] |
+| Vertex Feature | NodeInfo[1] |
+| Vertex Label | NodeInfo[2] |
+| Vertex Type | NodeInfo[3] |
+
+## 5. Training Heterogeneous Graphs
+The goal of training a heterogeneous graph is to learn the representation of nodes and edges in the graph for subsequent tasks such as node classification, link prediction, and graph clustering. To achieve this goal, researchers have proposed a variety of models based on graph neural networks (GNNs). These models update the representation of nodes by aggregating the information of neighboring nodes, thereby capturing the complex relationships in the graph structure.
+
+Since heterogeneous graphs contain nodes and edges of multiple types, it is necessary to consider how to process these different types of information when designing GNN models. One common approach is to design different aggregation functions to process different types of neighboring nodes. In addition, it is also necessary to consider how to integrate these different types of information together so that the model can effectively learn the representation of nodes and edges.
+
+TuGraph provides a method for training heterogeneous graphs using the ogbn-mag dataset, which can be used for reference.
+
+The official docker provided by TuGraph does not yet provide an environment for heterogeneous graph training, so users need to install relevant dependency packages by themselves.
+Before training, you need to download the ogb and pandas packages. The specific installation method is as follows:
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+The training code looks like this:
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    # print('load time', load_time - s, 'train_time', train_time - load_time)
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+The complete training code can be found in tugraph/learn/examples/train_full_mag.py.
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..fbc920ad54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+TuGraph Learn
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..f4d9296bec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+Stored Procedures And OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/conf.py b/docs/docusaurus/versions/version-4.3.0/en-US/source/conf.py
new file mode 100644
index 0000000000..7712aee00e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.3.0/en-US/source/index.rst b/docs/docusaurus/versions/version-4.3.0/en-US/source/index.rst
new file mode 100644
index 0000000000..24b08fe10f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/en-US/source/index.rst
@@ -0,0 +1,23 @@
+TuGraph DB
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions/version-4.3.0/images/architecture-en.png b/docs/docusaurus/versions/version-4.3.0/images/architecture-en.png
new file mode 100644
index 0000000000..edf2bc873a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/architecture-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/architecture.png b/docs/docusaurus/versions/version-4.3.0/images/architecture.png
new file mode 100644
index 0000000000..e8eeea87e0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/architecture.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/account-add-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/account-add-button.png
new file mode 100644
index 0000000000..5b9c7e9378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/account-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/account-add.png b/docs/docusaurus/versions/version-4.3.0/images/browser/account-add.png
new file mode 100644
index 0000000000..b0b5068027
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/account-add.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/account-delete.png b/docs/docusaurus/versions/version-4.3.0/images/browser/account-delete.png
new file mode 100644
index 0000000000..bfe49fb093
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/account-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/account-disable.png b/docs/docusaurus/versions/version-4.3.0/images/browser/account-disable.png
new file mode 100644
index 0000000000..f8ff994f21
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/account-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/account-edit.png b/docs/docusaurus/versions/version-4.3.0/images/browser/account-edit.png
new file mode 100644
index 0000000000..939c374f25
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/account-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/account-enable.png b/docs/docusaurus/versions/version-4.3.0/images/browser/account-enable.png
new file mode 100644
index 0000000000..ddc8cef578
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/account-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/account.png b/docs/docusaurus/versions/version-4.3.0/images/browser/account.png
new file mode 100644
index 0000000000..0aa0cd195c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/account.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/db_basic.png b/docs/docusaurus/versions/version-4.3.0/images/browser/db_basic.png
new file mode 100644
index 0000000000..b78298825b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/db_basic.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/db_configuration.png b/docs/docusaurus/versions/version-4.3.0/images/browser/db_configuration.png
new file mode 100644
index 0000000000..2de3da502c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/db_configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-button.png
new file mode 100644
index 0000000000..dd8966d0d3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-clear.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-clear.png
new file mode 100644
index 0000000000..ee5d3c92a9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-clear.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-collapse.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-collapse.png
new file mode 100644
index 0000000000..e053061834
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-collapse.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-delete.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-delete.png
new file mode 100644
index 0000000000..5aefa20c43
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand-after.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand-after.png
new file mode 100644
index 0000000000..371efb6e6b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand-after.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand-before.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand-before.png
new file mode 100644
index 0000000000..80e74174af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand-before.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand-custom.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand-custom.png
new file mode 100644
index 0000000000..bed0a73705
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand-custom.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand.png
new file mode 100644
index 0000000000..75b0caf2b9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-expand.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-fixed.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-fixed.png
new file mode 100644
index 0000000000..aac4a18573
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-fixed.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-lasso.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-lasso.png
new file mode 100644
index 0000000000..53f743925b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-lasso.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-legend-chart.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-legend-chart.png
new file mode 100644
index 0000000000..0ddb63b926
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-legend-chart.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-legend-list.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-legend-list.png
new file mode 100644
index 0000000000..07d0bf0a4c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-legend-list.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-retrieval.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-retrieval.png
new file mode 100644
index 0000000000..57eafece0e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-retrieval.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-unfix.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-unfix.png
new file mode 100644
index 0000000000..80fa2c8b72
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-canvas-unfix.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-operation-area.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-operation-area.png
new file mode 100644
index 0000000000..b251837e26
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-operation-area.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-attributefilter.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-attributefilter.png
new file mode 100644
index 0000000000..8883301d09
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-attributefilter.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-configurequery.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-configurequery.png
new file mode 100644
index 0000000000..d294a8616b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-configurequery.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-query.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-query.png
new file mode 100644
index 0000000000..b745e4d5c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-query.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png
new file mode 100644
index 0000000000..afbaf3bfd5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-statisticalfilter.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-statisticalfilter.png
new file mode 100644
index 0000000000..7c2e3b635e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-queryfilter-statisticalfilter.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-appearance-Button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-appearance-Button.png
new file mode 100644
index 0000000000..dab00330b7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-appearance-Button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-appearance.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-appearance.png
new file mode 100644
index 0000000000..330ad3128e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-appearance.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-layout-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-layout-button.png
new file mode 100644
index 0000000000..49516d6427
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-layout-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-layout-parameters.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-layout-parameters.png
new file mode 100644
index 0000000000..d02772bfd9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphanalysis-style-layout-parameters.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addedge-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addedge-button.png
new file mode 100644
index 0000000000..b38900728e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addedge-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addedge.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addedge.png
new file mode 100644
index 0000000000..39eca4a772
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addedge.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addvertex-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addvertex-button.png
new file mode 100644
index 0000000000..e616ce0f89
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addvertex-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addvertex.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addvertex.png
new file mode 100644
index 0000000000..df56d537bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-addvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-button.png
new file mode 100644
index 0000000000..abf1fab48f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-editedge.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-editedge.png
new file mode 100644
index 0000000000..eb7206b771
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-editedge.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-editvertex.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-editvertex.png
new file mode 100644
index 0000000000..eb252761bf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-editvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-exportmodel-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-exportmodel-button.png
new file mode 100644
index 0000000000..acbaa80189
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-exportmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-exportmodel.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-exportmodel.png
new file mode 100644
index 0000000000..4991dc7378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-exportmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import-csv.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import-csv.png
new file mode 100644
index 0000000000..2301c01cfc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import-csv.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import-datamapping.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import-datamapping.png
new file mode 100644
index 0000000000..5d55861a95
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import-datamapping.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import-success.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import-success.png
new file mode 100644
index 0000000000..20a48beb0f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import-success.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import.png
new file mode 100644
index 0000000000..0154bac688
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-import.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-importmodel-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-importmodel-button.png
new file mode 100644
index 0000000000..bb7822aaef
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-importmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-importmodel.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-importmodel.png
new file mode 100644
index 0000000000..252b082100
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-importmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-list-copy.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-list-copy.png
new file mode 100644
index 0000000000..ea210495fc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-list-copy.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-list-delete.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-list-delete.png
new file mode 100644
index 0000000000..aeba09b532
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-list-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-list-search.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-list-search.png
new file mode 100644
index 0000000000..9313c8eb7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-list-search.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-select.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-select.png
new file mode 100644
index 0000000000..18bfb3be74
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild-select.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild.png
new file mode 100644
index 0000000000..cd1f0bda1c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphbuild.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-configure.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-configure.png
new file mode 100644
index 0000000000..91fa18814f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-creategraph.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-deletegraph-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-deletegraph-button.png
new file mode 100644
index 0000000000..34a4efd42a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-deletegraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-editgraph-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-editgraph-button.png
new file mode 100644
index 0000000000..773798b78b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-editgraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-editgraph.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-editgraph.png
new file mode 100644
index 0000000000..f6cc706f41
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-editgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-homepage.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-homepage.png
new file mode 100644
index 0000000000..c3af5618ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-homepage.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-selecttemplate.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-selecttemplate.png
new file mode 100644
index 0000000000..8a19d8da39
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-selecttemplate.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-statistics-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-statistics-button.png
new file mode 100644
index 0000000000..cdb25ed397
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-statistics-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-statistics-refresh-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-statistics-refresh-button.png
new file mode 100644
index 0000000000..e2ec35cbe1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-statistics-refresh-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-statistics.png b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-statistics.png
new file mode 100644
index 0000000000..49db6e652f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/graphmanagement-statistics.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/login.png b/docs/docusaurus/versions/version-4.3.0/images/browser/login.png
new file mode 100644
index 0000000000..3f4109b059
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/login.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/pathquery-configuration.png b/docs/docusaurus/versions/version-4.3.0/images/browser/pathquery-configuration.png
new file mode 100644
index 0000000000..579a7d99ee
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/pathquery-configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/pathquery-result.png b/docs/docusaurus/versions/version-4.3.0/images/browser/pathquery-result.png
new file mode 100644
index 0000000000..0cd90cad46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/pathquery-result.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/pathquery-select.png b/docs/docusaurus/versions/version-4.3.0/images/browser/pathquery-select.png
new file mode 100644
index 0000000000..3c5d0f7751
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/pathquery-select.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-bookmark-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-bookmark-button.png
new file mode 100644
index 0000000000..9a6f73bf7c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-bookmark-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-bookmark.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-bookmark.png
new file mode 100644
index 0000000000..a93315ab17
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-bookmark.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-button.png
new file mode 100644
index 0000000000..cd00d7f3fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-download-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-download-button.png
new file mode 100644
index 0000000000..ec59f7a0ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-download-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-execute-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-execute-button.png
new file mode 100644
index 0000000000..6c38e68c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-execute-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-gqltips.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-gqltips.png
new file mode 100644
index 0000000000..bdabee92e7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-gqltips.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-download.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-download.png
new file mode 100644
index 0000000000..48890083fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-download.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-downloadtxt.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-downloadtxt.png
new file mode 100644
index 0000000000..3554ef592c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-downloadtxt.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-fullscreen-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-fullscreen-button.png
new file mode 100644
index 0000000000..13925db74f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-fullscreen-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-fullscreen-close.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-fullscreen-close.png
new file mode 100644
index 0000000000..2a63926742
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-fullscreen-close.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-fullscreen.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-fullscreen.png
new file mode 100644
index 0000000000..2dcf0ca0b4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-fullscreen.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-graph.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-graph.png
new file mode 100644
index 0000000000..9b3edecb5f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-insert-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-insert-button.png
new file mode 100644
index 0000000000..8879b2c4bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-insert-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-insert.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-insert.png
new file mode 100644
index 0000000000..2cd23b6e84
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-insert.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-jsontxt.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-jsontxt.png
new file mode 100644
index 0000000000..5f265cfff1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-jsontxt.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-jsonview.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-jsonview.png
new file mode 100644
index 0000000000..8a774f91c9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-jsonview.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-list.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-list.png
new file mode 100644
index 0000000000..4692c49eca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-result-list.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-schema-graph.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-schema-graph.png
new file mode 100644
index 0000000000..ccc9e3126b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-schema-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-schema-list.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-schema-list.png
new file mode 100644
index 0000000000..3649b41272
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-schema-list.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-selectgql.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-selectgql.png
new file mode 100644
index 0000000000..1ea624b81f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-selectgql.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-selectgraph.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-selectgraph.png
new file mode 100644
index 0000000000..6dc14e486d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-selectgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/query-view.png b/docs/docusaurus/versions/version-4.3.0/images/browser/query-view.png
new file mode 100644
index 0000000000..8d1884ad82
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/query-view.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-configure.png b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-configure.png
new file mode 100644
index 0000000000..166e54cb75
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-creategraph.png b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-graphtab.png b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-graphtab.png
new file mode 100644
index 0000000000..0f7980bc46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-graphtab.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-result.png b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-result.png
new file mode 100644
index 0000000000..2a2a59ce02
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-result.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-selectdemo.png b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-selectdemo.png
new file mode 100644
index 0000000000..7dda3f06b0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/quickstart-selectdemo.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/role-add-button.png b/docs/docusaurus/versions/version-4.3.0/images/browser/role-add-button.png
new file mode 100644
index 0000000000..a4590ac431
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/role-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/role-add.png b/docs/docusaurus/versions/version-4.3.0/images/browser/role-add.png
new file mode 100644
index 0000000000..8f56b24bd7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/role-add.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/role-delete.png b/docs/docusaurus/versions/version-4.3.0/images/browser/role-delete.png
new file mode 100644
index 0000000000..3c09e7caa8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/role-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/role-disable.png b/docs/docusaurus/versions/version-4.3.0/images/browser/role-disable.png
new file mode 100644
index 0000000000..eb2e355d58
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/role-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/role-edit.png b/docs/docusaurus/versions/version-4.3.0/images/browser/role-edit.png
new file mode 100644
index 0000000000..7b5db6e48c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/role-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/role-enable.png b/docs/docusaurus/versions/version-4.3.0/images/browser/role-enable.png
new file mode 100644
index 0000000000..40b7909289
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/role-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/vertexquery-criteria.png b/docs/docusaurus/versions/version-4.3.0/images/browser/vertexquery-criteria.png
new file mode 100644
index 0000000000..b5f95c3d83
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/vertexquery-criteria.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/browser/vertexquery.png b/docs/docusaurus/versions/version-4.3.0/images/browser/vertexquery.png
new file mode 100644
index 0000000000..97aa28122b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/browser/vertexquery.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-1.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-1.png
new file mode 100644
index 0000000000..c7202ff3de
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-10.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-10.png
new file mode 100644
index 0000000000..d6ed55c8bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-10.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-2.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-2.png
new file mode 100644
index 0000000000..6fc79fde54
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-3.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-3.png
new file mode 100644
index 0000000000..0e59f028c7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-4.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-4.png
new file mode 100644
index 0000000000..b606ec8bb8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-4.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-5.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-5.png
new file mode 100644
index 0000000000..18d5845ec1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-5.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-6.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-6.png
new file mode 100644
index 0000000000..d939108e3b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-6.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-7.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-7.png
new file mode 100644
index 0000000000..5c5d1800af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-7.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-8.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-8.png
new file mode 100644
index 0000000000..5beb0628b3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-8.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-9.png b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-9.png
new file mode 100644
index 0000000000..d04282d95a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/cloud-deployment-9.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/contact-en.png b/docs/docusaurus/versions/version-4.3.0/images/contact-en.png
new file mode 100644
index 0000000000..47ac8b8297
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/contact-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/contact-zh.png b/docs/docusaurus/versions/version-4.3.0/images/contact-zh.png
new file mode 100644
index 0000000000..75c49540b5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/contact-zh.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/htap-en.png b/docs/docusaurus/versions/version-4.3.0/images/htap-en.png
new file mode 100644
index 0000000000..85479ac1e1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/htap-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/htap.png b/docs/docusaurus/versions/version-4.3.0/images/htap.png
new file mode 100644
index 0000000000..c7764a3fa7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/htap.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/learn_flow_chart_en.png b/docs/docusaurus/versions/version-4.3.0/images/learn_flow_chart_en.png
new file mode 100644
index 0000000000..c9e55a52a5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/learn_flow_chart_en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/learn_flow_chart_zh.png b/docs/docusaurus/versions/version-4.3.0/images/learn_flow_chart_zh.png
new file mode 100644
index 0000000000..9977dcfb6c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/learn_flow_chart_zh.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/multi-level-Interfaces-en.png b/docs/docusaurus/versions/version-4.3.0/images/multi-level-Interfaces-en.png
new file mode 100644
index 0000000000..b7de07422c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/multi-level-Interfaces-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/multi-level-Interfaces.png b/docs/docusaurus/versions/version-4.3.0/images/multi-level-Interfaces.png
new file mode 100644
index 0000000000..2c9694a476
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/multi-level-Interfaces.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/partners/fu.png b/docs/docusaurus/versions/version-4.3.0/images/partners/fu.png
new file mode 100644
index 0000000000..a238d3a5ce
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/partners/fu.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/partners/hust.png b/docs/docusaurus/versions/version-4.3.0/images/partners/hust.png
new file mode 100644
index 0000000000..e1219f932b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/partners/hust.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/partners/oceanbase.png b/docs/docusaurus/versions/version-4.3.0/images/partners/oceanbase.png
new file mode 100755
index 0000000000..978297d9bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/partners/oceanbase.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/partners/secretflow.png b/docs/docusaurus/versions/version-4.3.0/images/partners/secretflow.png
new file mode 100644
index 0000000000..d386ce72fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/partners/secretflow.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/partners/whaleops.png b/docs/docusaurus/versions/version-4.3.0/images/partners/whaleops.png
new file mode 100644
index 0000000000..7ace477cf4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/partners/whaleops.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/partners/zju.png b/docs/docusaurus/versions/version-4.3.0/images/partners/zju.png
new file mode 100644
index 0000000000..704f0bb867
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/partners/zju.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/round-the-world/flight_page.jpg b/docs/docusaurus/versions/version-4.3.0/images/round-the-world/flight_page.jpg
new file mode 100644
index 0000000000..bd296766c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/round-the-world/flight_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/round-the-world/main_page.jpg b/docs/docusaurus/versions/version-4.3.0/images/round-the-world/main_page.jpg
new file mode 100644
index 0000000000..2edc617c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/round-the-world/main_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/round-the-world/search_example.jpg b/docs/docusaurus/versions/version-4.3.0/images/round-the-world/search_example.jpg
new file mode 100644
index 0000000000..154d387721
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/round-the-world/search_example.jpg differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-body-cypher1.png b/docs/docusaurus/versions/version-4.3.0/images/three-body-cypher1.png
new file mode 100644
index 0000000000..3f85fd8412
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-body-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-body-cypher2.png b/docs/docusaurus/versions/version-4.3.0/images/three-body-cypher2.png
new file mode 100644
index 0000000000..41f0f914cc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-body-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-body-cypher3.png b/docs/docusaurus/versions/version-4.3.0/images/three-body-cypher3.png
new file mode 100644
index 0000000000..4776f26d77
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-body-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-body-data.png b/docs/docusaurus/versions/version-4.3.0/images/three-body-data.png
new file mode 100644
index 0000000000..1913b39cbc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-body-data.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher1.png b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher1.png
new file mode 100644
index 0000000000..4b5745b96d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher2.png b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher2.png
new file mode 100644
index 0000000000..fef4592cf3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher3.png b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher3.png
new file mode 100644
index 0000000000..c0790d5d7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher4.png b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher4.png
new file mode 100644
index 0000000000..49a6498d4a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher4.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher5.png b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher5.png
new file mode 100644
index 0000000000..5d3cc55cdf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-cypher5.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-schema.png b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-schema.png
new file mode 100644
index 0000000000..24aebca93a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/three-kingdoms-schema.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/tugraph-datax.png b/docs/docusaurus/versions/version-4.3.0/images/tugraph-datax.png
new file mode 100644
index 0000000000..c2968c0c38
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/tugraph-datax.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/wandering-earth-1.png b/docs/docusaurus/versions/version-4.3.0/images/wandering-earth-1.png
new file mode 100644
index 0000000000..955c565303
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/wandering-earth-1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/wandering-earth-2.png b/docs/docusaurus/versions/version-4.3.0/images/wandering-earth-2.png
new file mode 100644
index 0000000000..9cb17764ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/wandering-earth-2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/wandering-earth-3.png b/docs/docusaurus/versions/version-4.3.0/images/wandering-earth-3.png
new file mode 100644
index 0000000000..c6dabbec97
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/wandering-earth-3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/what-is-graph-en.png b/docs/docusaurus/versions/version-4.3.0/images/what-is-graph-en.png
new file mode 100644
index 0000000000..53d5ba05ca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/what-is-graph-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/images/what-is-graph.png b/docs/docusaurus/versions/version-4.3.0/images/what-is-graph.png
new file mode 100644
index 0000000000..6f3aa196fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.0/images/what-is-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.0/requirements.txt b/docs/docusaurus/versions/version-4.3.0/requirements.txt
new file mode 100644
index 0000000000..0201af0943
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/requirements.txt
@@ -0,0 +1,5 @@
+sphinx
+myst-parser
+sphinx-panels
+sphinx-rtd-theme
+breathe
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/.readthedocs.yaml b/docs/docusaurus/versions/version-4.3.0/zh-CN/.readthedocs.yaml
new file mode 100644
index 0000000000..5b91d3cd6c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/zh-CN/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/Makefile b/docs/docusaurus/versions/version-4.3.0/zh-CN/Makefile
new file mode 100644
index 0000000000..d0c3cbf102
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?=
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/make.bat b/docs/docusaurus/versions/version-4.3.0/zh-CN/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/1.guide.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/1.guide.md
new file mode 100644
index 0000000000..732ddde855
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/1.guide.md
@@ -0,0 +1,74 @@
+# 文档地图
+
+> 这里是文档地图，帮助用户快速学习和使用TuGraph社区版。
+
+## 快速上手
+
+> 可以先了解[什么是图](./2.introduction/1.what-is-graph.md)、图[可以做什么](./2.introduction/8.scenarios.md)、以及[什么是TuGraph](./2.introduction/3.what-is-tugraph.md)。
+
+> 基于[阿里云计算巢](5.installation&running/5.cloud-deployment.md)或[Docker方式](5.installation&running/3.docker-deployment.md)快速部署TuGraph。
+
+> 通过产品内置的场景上手体验：[电影](./3.quick-start/2.demo/1.movie.md)、[流浪地球](./3.quick-start/2.demo/2.wandering-earth.md)、[三体](./3.quick-start/2.demo/3.the-three-body.md)、[三国](./3.quick-start/2.demo/4.three-kingdoms.md)。
+
+> 可视化操作手册看这里：[可视化操作手册](./4.user-guide/1.tugraph-browser.md)、[可视化操作手册（旧版）](./4.user-guide/2.tugraph-browser-legacy.md)。
+
+## 开发指南
+
+> 通过客户端访问TuGraph：[Bolt Client](7.client-tools/5.bolt-client.md)
+
+> 查询语言、语句创建图模型看这里：[Cypher API](8.query/1.cypher.md).
+
+> 存储过程和算法介绍看这里：[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md)。
+
+> C++/Python开发存储过程接口看这里：[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## 参与社区贡献
+
+> 在开始贡献前，可以先了解[如何贡献](12.contributor-manual/1.contributing.md)
+
+> 如果想了解社区角色的划分，请访问[社区角色](12.contributor-manual/2.community-roles.md)
+
+## 主要仓库
+
+> TuGraph-DB 仓库: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> 可视化界面: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> 基于twitter数据的简单测试方法: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> 基于标准LDBC-SNB的测试方法: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics 仓库: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## 视频中心
+
+> [TuGraph快速上手](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph技术分享集合](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [3分钟读懂图计算](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph最新版本
+
+| 描述                  | 文件                                         | 链接                                                                                                                                                                                              |
+|---------------------|--------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 安装包         | tugraph-4.3.0-1.el7.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-4.3.0-1.el7.x86_64.rpm) |
+| CentOS8 安装包         | tugraph-4.3.0-1.el8.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-4.3.0-1.el8.x86_64.rpm) |
+| Ubuntu18.04 安装包     | tugraph-4.3.0-1.x86_64.deb                 | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-4.3.0-1.x86_64.deb)  |
+| CentOS7 预安装镜像       | tugraph-runtime-centos7-4.3.0.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-runtime-centos7-4.3.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                   |
+| CentOS8 预安装镜像       | tugraph-runtime-centos8-4.3.0.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-runtime-centos8-4.3.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8)                   |
+| Ubuntu18.04 预安装镜像   | tugraph-runtime-ubuntu18.04-4.3.0.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-runtime-ubuntu18.04-4.3.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04)           |
+| CentOS7 精简安装包       | tugraph-mini-4.3.0-1.el7.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-4.3.0-1.el7.x86_64.rpm)                                                                                 |
+| CentOS8 精简安装包       | tugraph-mini-4.3.0-1.el8.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-4.3.0-1.el8.x86_64.rpm)                                                                                 |
+| Ubuntu18.04 精简安装包   | tugraph-mini-4.3.0-1.x86_64.deb            | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-4.3.0-1.x86_64.deb)                                                                                     |
+| CentOS7 精简预安装镜像     | tugraph-mini-runtime-centos7-4.3.0.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-runtime-centos7-4.3.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7)         |
+| CentOS8 精简预安装镜像     | tugraph-mini-runtime-centos8-4.3.0.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-runtime-centos8-4.3.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8)         |
+| Ubuntu18.04 精简预安装镜像 | tugraph-mini-runtime-ubuntu18.04-4.3.0.tar | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.0/tugraph-mini-runtime-ubuntu18.04-4.3.0.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 编译镜像        | tugraph-compile-centos7-1.2.9.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.2.9.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)          |
+| CentOS8 编译镜像        | tugraph-compile-centos8-1.2.9.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.2.9.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)          |
+| Ubuntu18.04 编译镜像    | tugraph-compile-ubuntu18.04-1.2.9.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.2.9.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04)  |
+
+
+版本更新日志见：[链接](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md )。
+
+如果您不清楚使用安装包和镜像，请参考 [环境和版本选择](13.best-practices/4.selection.md)。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..bb808b54b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/1.privilege.md
@@ -0,0 +1,138 @@
+# 用户权限
+
+## 1.介绍
+
+> TuGraph 的权限是基于角色的访问控制进行管理，定义访问控制的权限分配给角色，角色再分配给用户。
+
+## 2.权限层级
+
+- Global 层：即全局权限，对管理、图操作均有权限；
+- Graph 层：即图级别，对每个图的权限；
+- （仅商业化版本支持）Property 层：即属性级别，对某个属性的权限控制
+
+## 3.权限关键字
+
+目前权限的控制较为简洁
+
+- Global 层目前为 admin 权限，并且预置了 admin 用户；
+
+* Graph 层的操作权限分为四种：none，read，write，full
+  - none：无权限，对于图没有任何操作权限
+  - read：只读权限，对于图只具备读取权限
+  - write：读写权限，对于图不仅具备读取权限，还具备了写入的权限
+  - full：所有权限，对于图不仅具备读写权限，同时也具备删除图、修改图、修改 Schema 等权限
+* （仅商业化版本支持）Property 层的权限分别为：none，read，write
+  - none：无权限，对于该属性没有任何操作权限
+  - read：只读权限，对于该属性只具备读取权限
+  - write：读写权限，对于该属性不仅具备读取权限，还具备了写入的权限
+
+## 4.常用权限操作
+
+### 4.1.用户操作
+
+- 创建用户
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- 删除用户
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- 修改当前用户密码
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- 修改指定用户密码
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- 禁用/启用用户
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- 列出所有用户
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- 列出当前用户信息
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- 获取用户详情
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.角色操作
+
+- 创建角色
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- 删除角色
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- 列出所有角色
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- 禁用/启用角色
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.赋予用户角色
+
+- 新增用户与角色的联系
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- 删除用户与角色的联系
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- 清空用户角色的关系并重建
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.角色赋权
+
+- 修改角色对指定图的访问权限
+
+```cypher
+CALL dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP)
+```
+
+示例
+
+```cypher
+CALL dbms.security.modRoleAccessLevel("test_role", {test_graph1:"FULL", test_graph2:"NONE"})
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/2.token.md
new file mode 100644
index 0000000000..02e265cf23
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/2.token.md
@@ -0,0 +1,50 @@
+# Token使用说明
+
+## 1.Token介绍
+JWT（JSON Web Token）是一种用于认证和授权的开放标准。它基于JSON（JavaScript Object Notation）格式，并被设计用于在网络应用之间安全地传输声明（claims）信息。
+
+JWT由三部分组成：头部（Header）、负载（Payload）和签名（Signature）。头部包含了JWT的类型以及所使用的签名算法，负载包含了需要传输的信息，而签名用于验证JWT的完整性和真实性。
+
+在TuGraph中，JWT用于实现无状态的认证和授权机制。当用户登录成功后，服务端会生成一个JWT并将其返回给客户端。客户端在后续的请求中将这个JWT作为身份凭证传递给服务端。服务端收到JWT后，通过验证签名和解析负载中的信息，判断用户的身份和权限，并决定是否允许该请求的执行。
+
+## 2. Token有效期
+
+### 2.1. 浏览器Token交互逻辑
+1. 用户打开浏览器，输入账号密码，并点击登录。
+2. 前端调用登录接口，向后端输入账号和密码。
+3. 后端接收到账号密码后，进行校验，校验成功后，返回Token。
+4. 前端将Token存储在浏览器缓存中，后续请求都要携带此Token。
+5. 如果前端，主动点击登出和关闭页面，前端应主动调用登出接口，向后端传递Token。
+6. 后端接收后，将Token失效，返回状态码200，以及“等出成功”。前端接收到信息后，清空浏览器内存中的Token，并将页面退至登录页。
+7. Token失效（初始设置为24小时），需要用户重新登录。
+
+### 2.3. Token有效期刷新机制
+
+Token有效期存在刷新机制，默认关闭。如果打开后，Token的安全性会更高，实现上则存在两个时间戳。
+
+第一个时间戳`refresh_time`用于判定Token是否过期（默认24小时）：过期后可以调用刷新接口获取新的Token，可以设置为更短的时间，比如1小时。
+
+第二个时间戳`expire_time`为强制过期时间戳（默认24小时）：过期后必须重新登陆。
+
+### 2.4. Token有效期修改
+为了方便开发者自行开发，TuGraph提供了两种方式修改有效期，均需要admin权限。
+
+* 通过接口调用设置。涉及有效期修改的接口`update_token_time`和有效期查询接口`get_token_time`。
+具体可查询[REST接口文档](../7.client-tools/9.restful-api-legacy.md)。
+
+* 通过启动参数设置。server端启动时，添加参数`-unlimited_token 1` 参数可以设置为无期限。可参考[服务运行文档](../5.installation&running/7.tugraph-running.md)。
+
+## 3. 客户端发送Token相关请求介绍
+
+客户端会两种协议处理相关请求，一种是REST，一种是RPC。
+
+### 3.1. REST
+如果客户端使用REST协议（包括Browser浏览器），由于是短链接，在每一次请求中都需要携带Token，过期后需要获取新的Token。
+
+对于自行开发的客户端，若采用REST协议则需要考虑Token的逻辑。
+
+### 3.2. RPC
+如果客户端使用RPC协议（包括官方的C++/Java/Python），使用长连接保持，登陆后不涉及Token操作。
+
+## 4. Token上限
+Token上限是指一个用户最多可以同时拥有的Token数量。为防止无限登陆，Token上限默认为10000。由于Token生成逻辑和时间强相关，每登录一次会生成一个Token进行存储，Token有效期默认为24小时，因此建议登录后不使用的Token及时登出。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..245d6075bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,19 @@
+# 忘记'admin'密码
+> TuGraph 提供了重置密码的功能，当用户忘记管理者账号`admin`密码时，可以通过重置密码的方式来修改密码。
+
+## 1.重置密码
+首先，需要停止TuGraph服务端。再次启动TuGraph服务端时，需要添加如下参数：
+
+```bash
+--reset_admin_password 1
+```
+
+如下所示：
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+这一操作可以使得TuGraph服务端在启动时，重置管理者`admin`的密码为默认密码：`73@TuGraph`。
+密码重置成功会给出相关信息“Reset admin password successfully”并关闭当前服务端进程。
+
+用户需要以正常模式重新启动服务端，然后使用默认账号密码进行登录，登录后重新设置密码即可正常使用。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..b79cc13cc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/4.monitoring.md
@@ -0,0 +1,1020 @@
+# 运维监控
+
+> 此文档主要介绍 TuGraph 的可视化运维监控
+
+## 1.设计思路
+
+可视化监控并不是TuGraph自身不可或缺的一部分，因此在设计时将可视化监控作为TuGraph周边生态中的一个应用，来减少和TuGraph数据库的耦合度，以及对于TuGraph自身的影响。TuGraph可视化监控采用目前最火热的开源解决方案，TuGraph Monitor + Prometheus + Grafana来实现。其中TuGraph Monitor作为TuGraph服务的客户端，通过TCP链接向TuGraph服务发起Procedure请求，TuGraph服务在接收到请求后收集自身所在机器的cpu，memory，disk，io，以及请求数量等指标的统计结果进行响应。TuGraph Monitor在接收到TuGraph响应的指标数据后，将数据包装成prometheus需要的格式，保存在内存中，等待Prometheus服务通过http请求获取。Prometheus服务会定期通过http请求从TuGraph Monitor获取封装好的请求数据，按照获取的时间保存在自己的时序数据库中。Grafana可以根据用户的配置，从Prometheus处获取某个时间段内的统计数据，并在web界面上绘制浅显易懂的图形来展示最终结果。整个请求链路中，都采用了主动获取，即PULL的模型，好处之一是它能最大限度的避免数据生产者和数据消费者之间的耦合度，使得开发更简单，好处之二是数据生产者不需要考虑数据消费者的数据处理能力，即使某个消费者的数据处理能力较弱，也不会因为生产者生产数据过快而压垮消费者。主动拉取模型的不足之处在于数据的实时性不够，但在这个场景中，数据并没有很高的实时性要求。
+
+### 1.1.TuGraph
+
+TuGraph数据库提供了收集服务所在机器中磁盘，内存，网络IO，以及查询请求等多种数据信息的能力，并通过标准Procedure方式提供查询。收集数据这一动作仅在有用户通过接口查询时才会发生，避免了在用户不需要TuGraph监控服务所在机器的指标时对用户业务查询请求带来的影响。
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor是TuGraph周边生态中的一个工具，它作为TuGraph众多用户中的一个，通过C++ RPC Client与TuGraph进行通信，通过Procedure查询接口来查询TuGraph服务所在机器的性能指标，并将TuGraph返回的结果包装成Prometheus需要的数据模型，等待Prometheus获取。用户可以通过设置查询时间间隔来保证获取监控指标对于业务查询的影响最小化。
+
+### 1.3.Prometheus
+
+Prometheus是一个开源的监控平台，并配备有专属的时序数据库，它会定期通过http请求从TuGraph Monitor服务获取统计指标，并保存在自己的时序数据库中。详细信息请参考官网: [https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana是一个开源的可视化和分析软件，它可以从包含Prometheus在内的多个数据源中获取数据，并且可以将时序数据库中的数据转换为精美图形和可视化效果的工具。具体信息请参考官网: [https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.部署方案
+
+### 2.1.第一步
+
+启动TuGraph服务，详细方法请参考文档: [https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.第二步
+
+启动TuGraph Monitor工具，启动命令如下：
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+参数含义如下
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.第三步
+
++ 下载符合您机器架构以及系统版本的Prometheus tar包，下载地址: [https://prometheus.io/download/](https://prometheus.io/download/)
+
++ 解压tar包，命令如下
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ 修改配置文件prometheus.yml，新增如下配置，使其可以抓取TuGraph Monitor包装好的性能数据
+
+```yaml
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ 启动prometheus，具体的启动参数可以通过如下命令获取
+
+```shell
+./prometheus -h
+```
+
++ 验证prometheus服务是否正常，可以通过web端登陆prometheus服务，查询监控指标resources_report是否已经获取到，能成功查询到数据则正确
+
+### 2.4.第四步
+
++ 下载符合您机器架构以及系统版本的Grafana安装包，下载地址: [https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ 安装Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 启动Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 配置Grafana，首先在数据源设置中配置Prometheus的IP地址，配置完成后可以通过测试连接功能，验证是否成功连接数据源。然后，导入如下模版，并在页面中根据实际情况，修改正确的接口IP和端口。最后可以根据实际情况设置刷新时间和监控时间范围
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana"
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {label_name} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "内存",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  QPS超过1000",
+        "name": "请求统计 alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "请求统计",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "磁盘",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\nCPU使用率超过90%",
+        "name": "CPU使用率 alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU使用率",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  磁盘IO超过10MB/S",
+        "name": "磁盘IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph监控页面",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+验证效果，刷新浏览器页面。如果正确显示饼图和折线图，则配置完成。
+
+## 3.未来计划
+
+目前可视化监控只支持单机监控，能监控服务所在机器的cpu，磁盘，网络io，请求qps等性能指标，未来将会实现监控ha集群的功能，也会将更多有意义的指标纳入监控范围
+
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/5.log.md
new file mode 100644
index 0000000000..519b3d675f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# 日志信息
+
+> 此文档主要介绍 TuGraph 的日志功能。
+
+## 1.简介
+
+TuGraph 保留两种类型的日志：服务器日志和审计日志。服务器日志记录人为可读的服务器状态信息，而审核日志维护服务器上执行的每个操作加密后的信息。
+
+## 2.服务器日志
+
+### 2.1.服务器日志配置项
+
+服务器日志的输出位置可以通过`log_dir`配置指定。服务器日志详细程度可通过`verbose`配置项指定。
+
+`log_dir`配置项默认为空。若`log_dir`配置项为空，则所有日志会输出到控制台(daemon模式下若log_dir配置项为空则不会向console输出任何日志)；若手动指定`log_dir`配置项，则日志文件会生成在对应的路径下面。单个日志文件最大大小为256MB。
+
+`verbose`配置项控制日志的详细程度，从粗到细分为`0, 1, 2`三个等级，默认等级为`1`。等级为`2`时，日志记录最详细，服务器将打印`DEBUG`及以上等级的全部日志信息；等级为`1`时，服务器将仅打印`INFO`等级及以上的主要事件的日志；等级为`0`时，服务器将仅打印`ERROR`等级及以上的错误日志。
+
+### 2.2.服务器日志输出宏使用示例
+
+如果开发者在开发过程中希望在代码中添加日志，可以参考如下示例
+
+```
+#include "tools/lgraph_log.h" //添加日志依赖
+
+
+void LogExample() {
+    // 数据库启动阶段已经对日志模块进行了初始化，开发者只需直接调用宏即可
+    // 日志等级分为DEBUG, INFO, WARNING, ERROR, FATAL五个等级
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+更多用法可以参考test/test_lgraph_log.cpp中的日志宏的使用方法
+
+### 2.3.存储过程日志
+
+用户在存储过程的编写过程中可以使用日志功能将所需的调试信息输出到日志中进行查看，辅助开发。调试信息会输出到与服务器日志相同的日志文件中(如未指定`log_dir`则同样输出至console)
+
+#### 2.3.1.cpp存储过程
+请使用2.2中提供的log宏输出调试信息，避免使用cout或者printf等输出方式。具体使用方式可参考如下示例代码（详见`procedures/demo/log_demo.cpp`）
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+将以上示例代码作为存储过程插入数据库并运行后，可以在日志文件中看到相应的日志条目。
+
+#### 2.3.1.python存储过程
+请使用python自带的print输出调试信息，调试信息会在存储过程运行结束后合并为一条WARN等级的日志条目输出至日志文件中。
+
+## 3.审计日志
+
+审核日志记录每个请求和响应，以及发送请求的用户以及收到请求的时间。审核日志只能是打开或关闭状态。可以使用 TuGraph 可视化工具和 REST API 查询结果。
+
+开启审计日志需要在配置文件中将`enable_audit_log`参数设置为`true`。配置文件和配置参数说明详见：[数据库运行/服务配置](../../5.installation&running/7.tugraph-running.md)。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/index.rst
new file mode 100644
index 0000000000..f8e9db5345
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+运维与权限管理
+================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..ff3fcd8048
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# 单元测试
+
+> 该文档是TuGraph的单元测试文档
+
+## 1.简介
+
+TuGraph单元测试采用gtest框架，可以选择一次跑全部test或者制定某些test。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..5d49f35255
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/11.quality/2.integration-testing.md
@@ -0,0 +1,399 @@
+# 集成测试
+
+> 此文档主要介绍 TuGraph 的集成测试框架如何使用
+
+## 1.TuGraph集成测试的意义
+
+在单元测试与功能测试中，有部分用例直接开启galaxy或statemachine来进行测试，这并不是一个完整的流程。在完整的cs架构中，用户请求是通过客户端发往服务端，网络通信是必不可少的，为了避免单元测试不完整带来的bug，针对这种情况，使用集成测试框架进行全链路的完整测试。
+
+## 2.TuGraph集成测试框架
+
+TuGraph采用pytest框架作为自己的集成测试框架，pytest框架作为目前使用最广泛的cs端集成测试框架，以其灵活简单，容易上手，并且支持参数化的使用方式而著称，TuGraph基于pytest提供的功能，抽象出了不同的工具，通过参数来控制各个工具的处理逻辑，以方便大家进行高效的测试代码开发。
+
+更多pytest信息请参考官网: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.组件描述
+
+| 组件名称            | 组件功能                       | 实现方式                                  |
+|-----------------|----------------------------|---------------------------------------|
+| server          | TuGraph单机服务                | 开启子进程并在子进程中启动服务                       |
+| client          | TuGraph Rpc Client         | 当前进程中开启TuGraph Python Rpc Client发送请求  |
+| importor        | TuGraph Importor           | 开启子进程并在子进程中处理导入请求                     |
+| exportor        | TuGraph Exportor           | 开启子进程并在子进程中处理导出请求                     |
+| backup_binlog   | TuGraph Backup Binlog      | 开启子进程并在子进程中处理备份binlog的请求              |
+| backup_copy_dir | TuGraph Backup             | 开启子进程并在子进程中处理备份完整db的请求                |
+| build_so        | 编译c++动态连接库的组件              | 开启子进程并在子进程中处理gcc编译逻辑                  |
+| copy_snapshot   | TuGraph Copy Snapshot      | 当前进程中处理备份snapshot的请求                  |
+| copydir         | 文件夹拷贝                      | 当前进程中处理文件夹拷贝请求                        |
+| exec            | 执行c++/java可执行文件            | 开启子进程并在子进程中启动C++可执行文件                 |
+| algo            | 执行算法                       | 开启子进程并在子进程中执行算法                       |
+| bash            | 执行bash命令                   | 开启子进程并在子进程中执行bash命令                   |
+| rest            | TuGraph Python Rest Client | 当前进程中开启TuGraph Python Rest Client发送请求 |
+
+### 2.2.组件用法
+
+#### 2.2.1.server
+
+##### 2.2.1.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动server，函数执行完成后会停止server，并清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.启动参数
+采用python字典传入
++ host是TuGraph Server的ip和端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导入不同的数据，函数开始执行前会导入数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导出不同的数据，函数开始执行前会导出数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的binlog，函数开始执行前会拷贝binlog到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的db，函数开始执行前会拷贝db到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.启动参数
+采用python字典传入
++ cmd是启动命令，采用python列表传入，可以一次编译多个so
++ so_name是执行完成后需要清理的so，可以是多个，通过python列表传入
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制编译不同的so，函数开始执行前会生成so到指定的目录，函数执行完成后会清理so_name列表指定的动态库
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的snapshot，函数开始执行前会拷贝src中的snapshot到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的目录，函数开始执行前会拷贝src到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的命令
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ result是算法预期的执行结果，执行完成会通过实际结果与预期结果进行比较，不同则测试失败
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的算法逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的算法，函数主体等待算法执行完成后对比结果
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的bash命令，函数开始执行前会开启子进程执行通过cmd参数传入的bash命令，函数主体等待算法执行完成
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.启动参数
+采用python字典传入
++ port是TuGraph Server的端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来链接不同的TuGraph Rest Server，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.测试样例
+
+#### 2.3.1.rest
+
+样例代码中在test_get_info函数执行之前先启动server，server启动后启动了rest client，进入test_get_info函数后获取server的一些信息，并通过assert判断是否有获取到cpu的信息。
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+样例代码中在test_flushdb函数执行之前先执行了数据离线导入逻辑，并启动server后，通过client创建链接，进入test_flushdb函数后，通过查询点的个数判断导入是否成功，导入成功后执行flushDB操作，再次通过assert判断是否能正常清空db
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+     assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+样例代码中在test_export_default函数执行之前先执行了数据离线导入逻辑，导入成功后将当前db的数据导出，然后再次通过离线导入逻辑将exportor导出的数据导入到新的目录中，以新导入的数据启动db，并且创建链接。在test_export_default函数主体中判断导出后再次导入的数据是否与原始数据一致
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.其他测试
+更多用例请参考集成测试代码 [https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration)
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/11.quality/index.rst
new file mode 100644
index 0000000000..9b190aa284
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+测试与质量保障
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..18c9c1daec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,91 @@
+# 如何贡献
+
+## 1. 前言
+感谢您为TuGraph做出贡献，我们由衷地希望有更多社区的同学加入进来，一起建设一个更好的图数据库项目。
+
+对于优秀社区贡献者，我们将颁发TuGraph优秀社区贡献者证书。
+
+## 2. 贡献什么
+我们随时都欢迎任何贡献，无论是简单的错别字修正，BUG 修复还是增加新功能。请踊跃提出问题或发起 PR。我们同样重视文档以及与其它开源项目的整合，欢迎在这方面做出贡献。
+对于任何修改，尤其是较为复杂的修改，建议新建一个issue ，按照BUG或者PR的模板填写。
+
+## 3. 准备工作
+
+### 3.1. 了解TuGraph
+
+建议您从[文档地图](../1.guide.md)开始，了解TuGraph的特性和接口。
+
+### 3.2. 准备环境
+
+对于文档贡献，可以直接通过[文档](https://tugraph-db.readthedocs.io/zh_CN/latest)，点击右上角的"在GitHub上编译"直接修改并提PR。
+
+对于代码贡献，通常需要在搭建编译执行的环境，可以采用[Docker部署](../5.installation&running/3.docker-deployment.md)或[本地部署](../5.installation&running/4.local-package-deployment.md)。
+
+### 3.3. 许可协议
+
+在贡献代码之前，请您稍微花一些时间了解为TuGraph贡献代码的流程，并阅读 [个人贡献者许可协议](3.individual-cla.md) 或 [公司贡献者许可协议](4.corporate-cla.md)，参与贡献则视为同意上述协议。
+
+## 4. 贡献代码流程
+### 4.1. 提交issue
+不论您是修复 TuGraph 的 bug 还是新增 TuGraph 的功能，在您提交代码之前，请在 TuGraph 的 GitHub 上提交一个 issue，描述您要修复的问题或者要增加的功能。这么做有几个好处:
+
+- 不会与其它开发者或是他们对这个项目的计划发生冲突，产生重复工作。
+- TuGraph 的维护人员会对您提的 bug 或者新增功能进行相关讨论，确定该修改是不是必要，有没有提升的空间或更好的办法。
+- 在达成一致后再开发，并提交代码，减少双方沟通成本，也减少 pull request 被拒绝的情况。
+### 4.2. 获取源码
+要修改或新增功能，在提交 issue 后，fork一份 TuGraph  Master代码到您的代码仓库。
+### 4.3. 拉分支
+TuGraph 所有修改都在分支上进行，修改完成后提交 pull request，在 Code Review 后由项目维护人员 Merge 到 Master。 因此，在获取源码步骤介绍后，您需要:
+
+1. 下载代码到本地，这一步您可以选择git/https方式，近年github的权限要求更加严格，比如git方式需要更复杂的ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent))，https方式不能直接使用用户名密码验证，请按照指引授权。 git clone https://github.com/您的账号名/tugraph-db
+2. 拉分支准备修改代码:
+git branch add_xxx_feature 
+3. 执行完上述命令后，您的代码仓库就切换到相应分支了。执行如下命令可以看到您当前分支: git branch -a 
+4. 如果您想切换回 Master，执行下面命令: git checkout -b master
+5. 如果您想切换回分支，执行下面命令: git checkout -b "branchName"
+
+### 4.4. 编译运行
+
+代码的编译运行流程可以参考[ci脚本](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. 配置 Github 信息
+在您的机器执行 git config  --list ，查看 git 的全局用户名和邮箱。检查显示的 user.name 和 user.email 是不是与自己 github 的用户名和邮箱相匹配。
+
+如果公司内部有自己的 gitlab 或者使用了其他商业化的 gitlab，则可能会出现不匹配的情况。这时候，您需要为 TuGraph DB 项目单独设置用户名和邮箱。设置用户名和邮箱的方式请参考 github 官方文档。
+
+### 4.6. 修改代码提交到本地
+
+拉完分支后，就可以修改代码了。
+
+**修改代码注意事项 **
+
+代码⻛格保持一致：TuGraph 通过 cpplint 来保持代码格式一致，IDE可以通过.clang来配置风格。在提交代码前，务必本地检查代码风格，否则ACI将报错。
+
+补充单元测试代码：新有修改应该通过已有的单元测试,应该提供新的单元测试来证明以前的代码存在 bug，而新的代码已经解决了这些 bug ,您可以用如下命令运行所有测试: ./unit_test
+也可以通过IDE来辅助运行。
+
+**其它注意事项 **
+
+请保持您编辑的代码的原有⻛格，尤其是空格、换行等。 对于无用的注释，请直接删除。 对逻辑和功能不容易被理解的地方添加注释。 及时更新文档。 修改完代码后，请按照如下格式执行命令提交所有的修改到本地:
+git commit -am '(feat) 添加xx功能' git commit -am '(fix) 修复xx问题'`
+
+### 4.7. 提交代码到远程仓库
+在代码提交到本地后，接下来就可以与远程仓库同步代码了，执行如下命令提交本地修改到 github 上: git push origin "branchname"
+
+如果前面您是通过 fork 来做的，那么这里的 origin 是 push 到您的代码仓库，而不是 TuGraph 的代码仓库。
+
+提交合并代码到 Master 的请求 在的代码提交到 GitHub 后，您就可以发送请求来把您改好的代码合入 TuGraph Master 代码了。此时您需要进入您在 GitHub 上的对应仓库，按右上⻆的 pull request 按钮。选择目标分支，一般就是 master，系统会通知 TuGraph 的人员， TuGraph 人员会 Review 您的代码，符合要求后就会合入主干，成为 TuGraph 的一部分。 
+
+请注意会自动检查CI，以及所有Commits中的贡献者是否签署了cla，通过后会有绿色的标识。
+
+### 4.8. 代码 Review
+
+在您提交代码后，您的代码会被指派给维护人员 Review，请耐心等待。如果两个工作日后，仍然没有人对您的提交给予任何回复，可以在 PR 下面留言，并 @ 对应的人员。
+
+对于代码 Review 的意⻅会直接备注到到对应 PR 或者 Issue。如果觉得建议是合理的，也请您把这些建议更新到您的代码中。
+
+### 4.9. 合并代码到Master
+
+在代码 Review 通过后，就由 TuGraph 维护人员操作合入 Master，在此过程中维护人员可能会指定新的Reviewer，提出新的意见需要修改。一般这一步不用参与，代码合并之后，您会收到合并成功的提示。
+
+
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..109a1d8f04
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,57 @@
+# 社区角色
+
+## 1. 前言
+本文档描述 TuGraph 社区中成员身份的⻆色，对每种⻆色的要求及权限。 
+
+## 2. ⻆色摘要
+
+这是 TuGraph 社区的⻆色划分，描述了每种⻆色的职责，成为某种⻆色并保持该⻆色的要求，以及相应⻆色的权限。
+
+TuGraph 社区参照 Apache 规范划分为以下三种⻆色：
+
+- Contributor 
+- Maintainer 
+- PMC 
+
+以下描述了每种⻆色的要求、职责和权限。 		 						 					
+## 3. Contributor
+### 3.1. 要求
+在 TuGraph 的任何一个正式项目中成功提交一个 PR 并合并。 
+### 3.2. 职责
+
+- 积极响应指派给您的 Issue 或 PR
+- 一起帮忙回复 Issue 或 PR，把 Issue 分配给对应模块的负责人
+### 3.3. 权限
+
+- 加入 TuGraph GitHub 组织，成为 TuGraph 开源社区的一员。 
+## 4. Maintainer
+### 4.1. 要求
+新的 Committer 由已有的 PMC 推荐，并通过 2/3 以上投票通过，Committer 至少满足以下一个条件：
+
+- 成为社区成员时间超过三个月 
+- 超过 10 个 PMC approve 的 PR 
+- 完成重大功能 
+- 修复严重 Bug 
+- 长期关注项目发展并参与社区讨论
+### 4.2. 职责
+
+- 社区咨询支持
+- 积极响应指派给您的 Issue 或 PR
+- 对于社区重大决定的投票权
+- Review 社区的 PR 
+### 4.3. 权限
+
+- Pull Request review 权限 
+## 5. PMC
+### 5.1. 要求
+
+- 暂不开放，如有强烈愿望请联系PMC
+### 5.2. 职责
+
+- 积极参与社区讨论，对社区重大决策给予指导 
+- 负责保证开源项目的社区活动都能运转良好 
+### 5.3. 权限
+
+- Pull Request review 权限 
+- Pull Request approve 权限 
+- 社区角色成员管理
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..514825b414
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# 个人贡献者许可协议
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..d1f5e1f62d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# 公司贡献者许可协议
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..6668c91d5e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,66 @@
+# 技术规划
+
+## 1. 简介
+
+该文档是 TuGraph-DB 未来开发的规划，包括正在开发中、不在开发计划里、已经开发完成但不在开源版本里的功能等。
+
+TuGraph-DB定位开源高性能图数据库，图数据采用集中存储的方式，短期 **不会** 考虑基于分片（Sharding）的数据切分，
+而将支持主备复制的模式来解决高并发读的场景，采用云上存储解决存储容量的问题。
+
+## 2. 已完成功能
+
+TuGraph-DB于2022年9月1日开源，TuGraph-DB在社区的反馈声中，进行日常BUG修复，自身能力得到了完善。
+
+| 版本号   | 功能                               | 时间         |
+|-------|----------------------------------|------------|
+| 3.3.0 | 开源初版                             | 2022.9.1   |
+| 3.3.1 | 图分析引擎重构，多模式支持                    | 2022.10.14 |
+| 3.3.2 | OGM支持，UT覆盖率提升                    | 2022.11.21 |
+| 3.3.3 | 链接认证机制迭代，加入英文文档                  | 2022.12.23 |
+| 3.3.4 | 支持上云，梳理LDBC SNB Audit流程          | 2023.1.28  |
+| 3.4.0 | 支持OLAP Python API, 离线导入升级        | 2023.3.11  |
+| 3.5.0 | 支持POG，前端升级，文档梳理                  | 2023.6.5   |
+| 3.5.1 | 图学习引擎，Procedure Rust API，存储属性分离  | 2023.7.14  |
+| 3.6.0 | 高可用开源，日志系统升级                     | 2023.8.11  |
+| 4.0.0 | ISO GQL支持，新增11个开源图算法，支持m1 Docker | 2023.9.6   |
+| 4.0.1 | 支持时序边排序，新增5个开源图算法                | 2023.9.28  |
+| 4.1.0 | 支持Bolt协议，支持快速在线全量导入，支持地理空间数据类型   | 2023.12.25 |
+
+除此之外，TuGraph-DB搭建了较为完善的质量体系，涵盖自动化的单元测试、集成测试、性能测试等。
+
+更详细的描述可以在源码目录在的 "[root]/release/CHANGELOG.md" 文件查看。
+
+## 3. 2024年功能更新
+
+在2024年度，我们计划的功能更新包括：
+
+| 版本号   | 功能                 | 计划时间    |
+|-------|--------------------|---------|
+| 4.2.x | HA支持Witness角色和管理工具 | 2024.3  |
+| 4.2.x | Bolt支持流处理和参数化查询    | 2024.3  |
+| x.x.x | GeaX支持Cypher       | 2024.6  |
+| x.x.x | 支持组合索引             | 2024.6  |
+| x.x.x | 数据导入功能优化           | 2024.6  |
+| x.x.x | 【社区功能】支持地理数据类型使用   | 2024.6  |
+| x.x.x | Cypher能力提升         | 2024.9  |
+| x.x.x | 支持Schema快速变更       | 2024.9  |
+| x.x.x | 向量化支持              | 2024.12 |
+| x.x.x | RPQ支持              | 2024.12 |
+| x.x.x | 【可选】查询引擎升级         | 2024.12 |
+| x.x.x | 【社区功能】支持GraphAr    | 2024.12 |
+
+## 4. 期望社区共创的功能
+
+目前团队研发精力并不能实现我们对TuGraph-DB的全部期望，在功能的梳理中，我们发现有一系列值得挖掘的想法，
+团队也有一些初步的探索，期望下面功能能够在社区中共同研发。
+
+| 版本号   | 功能                      | 计划时间   |
+|-------|-------------------------|--------|
+| x.x.x | 图算法库丰富                  | 2024.x |
+| x.x.x | 属性默认值支持                 | 2024.x |
+| x.x.x | Embedded TuGraph-DB最佳实践 | 2024.x |
+| x.x.x | Bolt显式事务支持              | 2024.x |
+| x.x.x | List、Map和Decimal等数据类型扩展 | 2024.x |
+| x.x.x | 探索多存储引擎                 | 2024.x |
+
+一些更加简单的功能，我们会在github的issue中打上 good first issue 的标签，欢迎对图数据库感兴趣的技术爱好者共同研讨。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..f2319d2358
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+贡献者文档
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..addc159170
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# 从关系型数据库导入TuGraph
+
+> 使用 [DataX](../6.utility-tools/7.tugraph-datax.md)，待完善
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..01171c1f11
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,223 @@
+# 使用 TuGraph 图学习模块进行点分类
+
+## 1.简介
+GNN 是许多图上机器学习任务的强大工具。在本介绍性教程中，您将学习使用 GNN 进行点分类的基本工作流程，即预测图中点的类别。
+
+此文档将展示如何构建一个 GNN 用于在 Cora 数据集上仅使用少量标签进行半监督点分类，这是一个以论文为点、引文为边的引文网络。任务是预测给定论文的类别。
+
+通过完成本教程，您可以
+
+使用 TuGraph 加载 cora 数据集。
+
+使用 TuGraph 提供的采样算子采样，并构建 GNN 模型。
+
+在 CPU 或 GPU 上训练用于点分类的 GNN 模型。
+
+此文档需要对图神经网络、DGL等使用有一定经验。
+
+## 2. 前置条件
+
+TuGraph图学习模块需要TuGraph-db 3.5.1及以上版本。
+
+TuGraph部署推荐采用Docker镜像tugraph-compile 1.2.4及以上版本:
+
+tugraph / tugraph-compile-ubuntu18.04:latest
+
+tugraph / tugraph-compile-centos7:latest
+
+tugraph / tugraph-compile-centos8:latest
+
+以上镜像均可在DockerHub上获取。
+具体操作请参考[快速上手](../3.quick-start/1.preparation.md)。
+
+## 3. Cora 数据集导入TuGraph数据库
+### 3.1. Cora 数据集介绍
+Cora 数据集由 2708 篇论文组成，分为 7 个类别。每篇论文由一个 1433 维的词袋表示，表示论文中的单词是否出现。这些词袋特征已经预处理，以从 0 到 1 的范围归一化。边表示论文之间的引用关系。
+
+TuGraph中已经提供了Cora数据集的导入工具，用户可以直接使用。
+
+### 3.2. 数据导入
+Cora数据集在test/integration/data/algo目录下，包含点集cora_vertices和边集cora_edge。
+
+首先需要将Cora数据集导入到TuGraph数据库中，详细操作可参考[数据导入](../6.utility-tools/1.data-import.md)。
+
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+然后进行数据导入：
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式,可参考test/integration/data/algo/cora.conf。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+
+## 4. feature特征转换
+由于Cora数据集中的feature特征为长度为1433的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+
+## 5. 编译采样算子
+采样算子用于从数据库中获取图数据并转换成所需数据结构，具体执行过程如下(如果TuGraph已编译，可跳过此步骤)：
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *  # 导入tugraph-db的python接口模块
+import importlib  # 导入importlib模块
+getdb = importlib.import_module("getdb")  #获取getdb算子
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo) #调用getdb算子
+```
+
+如代码所示，得到算子so文件后，import 导入使用。
+
+## 6. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+训练详细过程如下：
+### 6.1.数据加载
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+如代码所示，根据图数据路径、用户名、密码和子图名称将数据加载到内存中。TuGraph可以载入多个子图用于图训练，在此处我们只载入一个子图。
+
+### 6.2.构建采样器
+训练过程中，首先使用GetDB算子从数据库中获取图数据并转换成所需数据结构，具体代码如下：
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+如代码所示，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+然后构建采样器
+```python
+    batch_size = 5
+    count = 2708
+    sampler = TugraphSample(args)
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(count),
+        sampler,
+        batch_size=batch_size,
+        num_workers=0,
+        )
+```
+
+### 6.3.对结果进行格式转换
+```python
+    src = EdgeInfo[0].astype('int64')
+    dst = EdgeInfo[1].astype('int64')
+    nodes_idx = NodeInfo[0].astype('int64')
+    remap(src, dst, nodes_idx)
+    features = NodeInfo[1].astype('float32')
+    labels = NodeInfo[2].astype('int64')
+    g = dgl.graph((src, dst))
+    g.ndata['feat'] = torch.tensor(features)
+    g.ndata['label'] = torch.tensor(labels)
+    return g
+```
+对结果进行格式转换，使之符合训练格式
+
+### 6.4.构建GCN模型
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+
+def build_model():
+    in_size = feature_len  #feature_len为feature的长度，在此处为1433
+    out_size = classes  #classes为类别数，在此处为7
+    model = GCN(in_size, 16, out_size)  #16为隐藏层大小
+    return model
+```
+本教程将构建一个两层图卷积网络（GCN）。每层通过聚合邻居信息来计算新的点表示。
+
+### 6.5.训练GCN模型
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #如果需要保存模型，则给出模型保存路径
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+如代码所示，根据定义好的采样器、优化器和模型进行迭代训练50次，训练后的模型保存至model_save_path路径中。
+
+输出结果如下：
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+同时，图学习模块可采用GPU进行加速，用户如果需要再GPU上运行，需要用户自行安装相应的GPU驱动和环境。具体可参考learn/README.md。
+
+完整代码可参考learn/examples/train_full_cora.py
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..df74c5c673
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# 数据迁移
+
+## 1. 简介
+   数据迁移是指将数据从一个系统、存储介质或应用程序迁移到另一个系统、存储介质或应用程序的过程。当TuGraph要升级或者系统硬件环境发生变化时，
+需要对原TuGraph服务中的数据进行迁移。以系统硬件环境和软件版本为依据进行划分，本文将数据迁移分为三种方案：
+1. 兼容迁移：当迁移前后系统环境一致且TuGraph软件兼容时，可以直接使用备份恢复的方式迁移数据；
+2. 升级迁移：当迁移前后系统环境不一致或TuGraph软件不兼容时，需要使用先导出数据再重新导入的方式迁移数据；
+3. 在线迁移：当对高可用集群进行数据迁移且集群网络环境良好时，可以使用增删节点的的方式将原集群平滑切换到新集群。
+接下来本文将详细介绍这三种方案。
+
+## 2. 兼容迁移
+兼容迁移指的是在系统环境不变，且TuGraph软件版本兼容时，原服务的数据和存储过程可以在新服务中使用，所以可以直接迁移。
+用户可以先使用`lgraph_backup`工具备份数据，然后将数据传输到新机器中并重启服务。具体迁移步骤如下：
+
+### 2.1. 备份数据
+使用`lgraph_backup`工具备份数据
+```bash
+  lgraph_backup -s db -d db.bck
+```
+本步骤也可以直接使用`cp`命令，不过`cp`命令会拷贝一些多余的元数据，HA模式下也会拷贝raft的元数据导致迁移之后集群重启失败，
+因此建议数据迁移时使用`lgraph_backup`工具替代`cp`命令。
+
+### 2.2. 启动新服务
+使用如下命令启动新服务，存储过程会自动加载到新服务中
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. 停止原服务
+使用如下命令停止原服务
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. 升级迁移
+当用户要把原始服务迁移到一个差异化环境中（比如从centos7迁移到ubuntu18.04），或者TuGraph版本变化较大前后不兼容时（如3.4.0和3.6.0），
+用户可以先使用`lgraph_export`工具将数据导出成文件，传输到新机器中，再使用`lgraph_import`工具重新导入并重启集群。
+这样可以保证在新环境上能够使用，但是效率较低，存储过程也需要重新加载。具体的迁移步骤如下：
+
+### 3.1. 导出数据
+使用`lgraph_export`工具导出数据，并将数据传输到新机器上
+```bash
+  lgraph_export -d db -e db.export
+```
+
+### 3.2. 导入数据
+使用`lgraph_import`工具导入数据，并手动加载存储过程（详见[client操作步骤](../7.client-tools/2.cpp-client.md)）
+```bash
+  lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. 启动新服务
+使用如下命令启动新服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. 停止原服务
+使用如下命令停止原服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. 在线迁移
+当对TuGraph高可用版本部署的服务器集群进行数据迁移时，如果网络带宽充足，可以直接使用增删节点的方式对服务进行在线迁移。具体迁移步骤如下所示：
+
+### 4.1. 拷贝数据
+使用如下命令拷贝leader节点上的数据，并且传输到新集群的机器节点上。由于leader节点上有最完整的raft日志，拷贝leader的数据可以最大程度地减少
+日志追赶的时间。
+```bash
+  cp -r db db.cp
+```
+### 4.2. 启动新节点
+使用如下命令将新节点加入集群，加入集群后，增量数据自动同步到新节点
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. 停止原节点
+停止原节点服务，后续应用请求直接发给新集群
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..dd635f6f27
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# 环境和版本选择
+
+> 该文档介绍如何选择系统环境，以及部署方式
+
+## 1. 简介
+
+TuGraph为不同需求的用户提供了差异化的系统环境和部署方式，来满足新手、系统开发者、生产运维人员、研究人员等不同用户的需求。
+
+## 2. 环境能力选择
+
+用户可以根据实际使用场景，来选择不同的环境。编译环境的能力最完备，所需的第三方软件也越多。与其相对应的，精简运行环境几乎不需要安装任何依赖库，能运行TuGraph除存储过程外的基础功能。
+
+| 环境     | 用途             | 备注        |
+|--------|----------------|-----------|
+| 编译环境   | 从源码编译TuGraph   | 适用于开发人员   |
+| 运行环境   | 运行TuGraph安装包   | 适用于大部分用户  |
+| 精简运行环境 | 运行精简TuGraph安装包 | 对系运行统依赖较小 |
+
+不同环境的具体介绍参见 [链接](../5.installation&running/2.environment-mode.md)。
+
+## 3. 部署方式选择
+
+TuGraph部署仅需一台服务器（高可用模式需要多台），可根据实际资源情况和使用场景，选择适合的部署方式。
+
+| 部署方式     | 描述                   | 备注                                                                                      |
+|----------|----------------------|-----------------------------------------------------------------------------------------|
+| 云部署      | 阿里云计算巢一键部署，免费试用      | 新手适用，流程参考 [链接](../5.installation&running/5.cloud-deployment.md)              |
+| Docker部署 | 通过预先准备的Docker镜像跨平台部署 | 对硬件有要求的用户，比如性能测试，流程参考 [链接](../5.installation&running/3.docker-deployment.md) |
+| 本地部署     | 在现有系统紧耦合部署           | 指定生产环境适用，流程参考 [链接](../5.installation&running/4.local-package-deployment.md)  |
+
+## 4. 后续步骤
+
+部署完成后，后续可以进行[启动服务](../5.installation&running/7.tugraph-running.md)、[数据导入](../6.utility-tools/1.data-import.md)等操作，也可以通过[样例数据](../3.quick-start/2.demo/1.movie.md)来体验整个流程。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..dc5546f1d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+最佳实践
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/14.faq.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/14.faq.md
new file mode 100644
index 0000000000..596cab6378
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/14.faq.md
@@ -0,0 +1,59 @@
+# FAQ
+
+在 TuGraph 使用过程中，如果遇到问题可优先查看[用户文档](https://github.com/TuGraph-family/tugraph-db/tree/master/doc/zh-CN) 。其次，请查看如下 FAQ 列表是否能够匹配您的问题。
+
+1. **[内核引擎 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussion-4575385)**
+
+   1.1 [TuGraph 的边是否支持索引？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165379)
+
+   1.2 [TuGraph 单机的 QPS 是多少？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussion-4575381)**
+
+   2.1 [可视化文件 build 后如何更新到 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165364)
+
+   2.2 [如何通过 npm run dev，连接已有的 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165366)
+
+   2.3 [3.3.0 版本 TuGraph Browser 删除 node label 失败？](https://github.com/TuGraph-family/tugraph-db/discussions/82#discussion-4465791)
+3. **[客户端 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussion-4575378)**
+
+   3.1 [Client 目前有哪些编程语言，是否支持 Node.js？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165351)
+
+   3.2 [Python Client 是否支持 pip install？Client 在哪里进行引用？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165353)
+
+4. **[数据导入 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussion-4575373)**
+
+   4.1 [TuGraph 可以对接哪些常用数据库？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165335)
+
+   4.2 [如何进行数据导入？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[存储过程 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussion-4575369)**
+
+   5.1 [如何加载存储过程或算法包？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165313)
+
+   5.2 [如何调用或执行存储过程？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165317)
+
+   5.3 [开源内置的算法包在哪里？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[安装部署 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussion-4575364)**
+
+   6.1 [如何使用 docker 镜像安装？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165287)
+
+   6.2 [rpm 包和 deb 包安装后，启动 lgraph_server 服务，提示缺少'liblgraph.so'报错？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165289)
+
+   6.3 [如何在 Mac 的 M1 芯片上编译 TuGraph？](https://github.com/TuGraph-family/tugraph-db/discussions/47#discussion-4393165)
+
+   6.4 [安装报错 jemalloc: Unsupported system page size 该如何处理？](https://github.com/TuGraph-family/tugraph-db/issues/477)
+7. **[Cypher QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussion-4575018)**
+
+   7.1 [是否支持不定长边的条件查询？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165252)
+
+   7.2 [如何查询最短路径，shortestPath 函数如何使用？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165256)
+
+   7.3 [查询语句 Where 后使用 and 进行拼接查询速度较慢，语句应如何优化改进？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165260)
+
+   7.4 [如何查询任意跳的边？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165262)
+
+   7.5 [Cypher 是否 date()函数？](https://github.com/TuGraph-family/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+
+   8.1 [报错“User has reached the maximum number of tokens”后该如何处理？](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+如果问题仍然无法得到解决，我们推荐您在[Discussions](https://github.com/TuGraph-family/tugraph-db/discussions)跟帖或发起新贴来描述您的问题。同时 TuGraph QA 大汇总也会根据大家在讨论区发起的帖子，进行定期的更新。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/15.contacts.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/15.contacts.md
new file mode 100644
index 0000000000..e003ef4098
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/15.contacts.md
@@ -0,0 +1,17 @@
+# 联系方式
+
+您有任何对产品的意见和建议，欢迎通过以下联系方式加入讨论，或提出建议。
+
+官网: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue (错误反馈、功能讨论)
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions (技术讨论)
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack (在线开发沟通):
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+通过钉钉群、微信群、微信公众号、邮箱和电话联系我们:
+![contacts](../../images/contact-zh.png)
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..4cbe4ce767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,13 @@
+# 什么是图
+
+> 本文面向初学者，介绍图（Graph）的基本概念。
+
+我们今天介绍的图，是图论中使用点和边表示的图（Graph），而非图像的图（Image）。
+
+![alt what is graph](../../../images/what-is-graph.png)
+
+图的基本元素是点和边，其中点表示事物或实体，边表示点之间的关联关系。
+
+如上图左侧所示，点表示的有公司、员工、项目。边表示的是他们之间的关系，包括：公司和员工之间的雇佣关系，员工和员工之间的好友关系，项目和员工之间的参与关系。除此之外，点和边上可以附加属性，比如员工的工号，雇佣的时间，这样的图是属性图。也就是说，我们可以用图的方式来抽象地表示实体及其关联关系，图有非常丰富的表达能力。
+
+除了上述的员工图谱，图还可以用于金融、工业、医疗等各个领域。在实际应用中，图的规模越来越大，比如金融交易图，点边规模可能到达百亿，与其同时，基于图的查询通常会复杂，最典型的是K跳查询，每增加一跳访问的数据都呈指数增长。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..eeb4dfd11f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# 什么是图数据库
+
+> 本文主要介绍什么是图数据库，图数据库相比于关系型数据库的优势，以及两者特点的对比。
+
+## 1. 图数据库介绍
+
+图数据库是基于图模型的数据库。与关系型数据库相比，图数据库真正注重“关系”。图数据库的主要功能是管理图数据，因此需要支持高效的点、边查询和更新；为方便用户使用，通常还需要增加对事务（transaction）的支持，以确保并发操作下的正常运行。
+
+## 2. 图数据库相比较于关系型数据库的优势
+
+图数据库的功能是传统关系型数据库的扩展。与关系型数据库仅支持的“表结构”相比，图数据库所支持的“图结构”更为灵活。图数据库在基于图的增加、删除、查询和修改方面采用不同于其他数据库的设计。在图数据操作抽象上，采用基于点的视角，例如点通过其所有“出边”（从一个点出发，连接到其他点的边）访问其邻接点。这是图数据库系统设计的核心。
+
+图数据库的独特性体现在以下三个方面:
+
+### 2.1. 性能
+
+在关联关系处理上，使用关系型数据库不可避免地要使用表的JOIN操作，这会对性能产生较大影响；而图数据库则直接跳转访问类指针，操作关联数据的效率更高，比关系型数据库提高2到4个数量级的性能。
+
+### 2.2. 兼容性
+
+现实中，项目进程通常不断演变，数据的内容甚至数据格式也在不断变化。在关系型数据库中，这意味着表结构的变化或建立多个新表，对源数据的修改非常大。而在图数据库中，仅需添加新的点、边和属性，并将其设置为对应的类型即可。从本质上说，一个表代表一种类型的数据，一个点代表一个特定的数据。这意味着关系型数据库更关注数据类型，而图数据库更关注数据个体及其关联关系。
+
+### 2.3. 直观性
+
+使用图的方式表达现实世界的关系更直接和自然，在万物互联的时代尤为突出。如果使用关系型数据，先建立实体表，再建立关系表，最后映射数据，需要高度的抽象思维。在图数据上进行分析查询时，可以直观地通过点边连接的拓扑结构找到所需数据，无需任何专业知识。
+
+## 3. 图数据库与关系型数据库对比
+
+| 分类         | 模型   | 优势                                   | 劣势                                     | 举例           |
+| ------------ | ------ | -------------------------------------- | ---------------------------------------- | -------------- |
+| 关系型数据库 | 表结构 | 数据高度结构化，一致性强，软件成熟度高 | 面向多跳的关联关系查询低效或不支持       | MySQL、Oracle  |
+| 图数据库     | 图结构 | 针对关联关系的建模建模和操作效率非常高 | 高度结构化的数据处理能力不及关系型数据库 | Neo4j、TuGraph |
+
+总之，面对海量数据的存储和处理问题，传统的关系数据库已经无法满足大部分的日常数据存储需求。图数据库技术可以将关系信息存储为实体，灵活拓展数据模型。由于提供了对关联数据最直接的表达方式和图模型对异构数据的天然包容性，图数据库技术必将成为未来最热点的技术之一，为企业提供存储和分析大规模图数据的有力支持。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..41ed5c6aa5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,49 @@
+# 什么是TuGraph
+
+> 本文主要介绍TuGraph社区版的主要功能和特性，以及TuGraph企业版和社区版的差异。
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群，解决了图数据分析面临的大数据量、高吞吐率和低延迟等重大挑战，是蚂蚁集团金融风控能力的重要基础设施，显著提升了欺诈洗钱等金融风险的实时识别能力和审理分析效率，并面向金融、工业、政务服务等行业客户。
+
+## 2. TuGraph社区版
+
+2022年9月，TuGraph单机版开源，提供了完备的图数据库基础功能和成熟的产品设计，支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台。
+
+TuGraph社区版于2022年9月开源，提供了完整的图数据库基础功能和成熟的产品设计（如ACID兼容的事务、编程API和配套工具等），适用于单实例部署。社区版支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台，是学习TuGraph和实现小型项目的理想选择。
+
+## 3. TuGraph特性
+
+TuGraph是支持大数据量、低延迟查找和快速图分析功能的高效图数据库。TuGraph也是基于磁盘的数据库，支持存储多达数十TB的数据。TuGraph提供多种API，使用户能够轻松构建应用程序，并使其易于扩展和优化。
+
+它具有如下功能特征：
+
+- 属性图模型
+- 实时增删查改
+- 多重图（点间允许多重边）
+- 多图（大图与多个子图）
+- 完善的ACID事务处理，隔离级别为可串行化（serializable）
+- 点边索引
+- 混合事务和分析处理（HTAP），支持图查询、图分析、图学习
+- 主流图查询语言（OpenCypher、ISO GQL等）
+- 支持OLAP API，内置30多种图分析算法
+- 基于C++/Python的存储过程，含事务内并行Traversal API
+- 提供图可视化工具
+
+在性能和可扩展性方面的支持：
+
+- 千万点/秒的高吞吐率
+- TB级大容量
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线的备份恢复
+
+## 4. TuGraph企业版
+
+企业版对商业化功能支持更加完善，包括分布式集群架构，覆盖探索、研发、服务、运维管理全生命周期的一站式图平台，在线、近线、离线的图计算引擎，支持流式、大数据类数据源，多地多中心的部署形态，以及专家支持服务等。企业版是商业化解决方案的理想选择。
+
+如需商业支持，请联系我们：
+
+- 电话：400-903-0809
+- 邮件：tugraph@service.alipay.com
+- 官网：https://tugraph.antgroup.com
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..07d7e196be
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/4.schema.md
@@ -0,0 +1,134 @@
+# TuGraph图模型说明
+## 1. 数据模型
+
+### 1.1. 图模型
+
+TuGraph是一个具备多图能力的强类型、有向属性图数据库。
+
+- 图项目：每个数据库服务可以承载多个图项目（多图），每个图项目可以有自己的访问控制配置，数据库管理员可以创建或删除指定图项目。
+- 点：指实体，一般用于表达现实中的实体对象，如一部电影、一个演员。
+    - 主键：用户自定义的点数据主键，默认唯一索引，在对应的点类型中唯一。
+    - VID：点在存储层自动分配图项目中的唯一ID，用户不可修改。
+    - 上限：每个图项目存储最多2^(40)个点数据。
+- 边：用于表达点与点之间的关系，如演员出演电影。
+    - 有向边：边为有向边。若要模拟无向边，用户可以创建两个方向相反的边。
+    - 多条边：两个点数据之间可以有多条边数据。当前TuGraph支持重复边，如要确保边边唯一，需要通过业务策略实现。
+    - 上限：两个点数据之间存储最多2^(32)条边数据。
+- 属性图：点和边可以具有与其关联的属性，每个属性可以有不同的类型。
+- 强类型：每个点和边有且仅有一个标签，创建标签后，修改属性数量及类型有代价。
+    - 指定边的起/终点类型：可限制边的起点和终点点类型，支持同类型边的起点和终点的点类型不同，如个人转账给公司、公司转账给公司；当指定边的起/终点类型后，可增加多组起/终点类型，不可删除已限制的起/终点类型。
+    - 无限制模式：支持不指定边的起点和终点的点类型，任意两个点类型间均可创建该类型的边数据。注：当指定边的起/终点类型后无法再采用无限制模式。
+
+### 1.2. 数据类型
+
+TuGraph支持多种可用于属性的数据类型。具体支持的数据类型如下：
+
+| **数据类型** | **最小值**          | **最大值**          | **描述**                            |
+| ------------ | ------------------- | ------------------- | ----------------------------------- |
+| BOOL         | false               | true                | 布尔值                              |
+| INT8         | -128                | 127                 | 8位整型                          |
+| INT16        | -32768              | 32767               | 16位整型                         |
+| INT32        | - 2^31              | 2^31 - 1            | 32位整型                         |
+| INT64        | - 2^63              | 2^63 - 1            | 64位整型                         |
+| DATE         | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" 格式的日期             |
+| DATETIME     | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD HH:mm:ss[.ffffff]" 格式的日期时间 |
+| FLOAT        |                     |                     | 32位浮点数                       |
+| DOUBLE       |                     |                     | 64位浮点数                       |
+| STRING       |                     |                     | 不定长度的字符串                    |
+| BLOB         |                     |                     | 二进制数据（在输入输出时使用Base64编码） |
+| POINT        |                     |                     | EWKB格式数据，表示点              |
+| LINESTRING   |                     |                     | EWKB格式数据，表示线              |
+| POLYGON      |                     |                     | EWKB格式数据，表示面(多边形)       |
+
+### 1.3. 索引
+
+TuGraph支持对点或边的属性创建索引，以提升查询效率。其特点如下：
+- 每个索引都基于一个点或边的一个属性创建，可以对同一点或边的多个属性创建索引。
+- 如果为点标签创建了唯一索引，在修改该标签的点时，会先执行数据完整性检查，以确保该索引的唯一性。
+- BLOB类型的属性不能建立索引。
+
+TuGraph的点边均有多种索引类型，不同的索引类型的功能和限制不同，具体如下：
+
+#### 1.3.1 点索引
+##### 1.3.1.1 unique索引
+
+点的unique索引指的是全局唯一的索引，即若一个属性设置了unique索引，在同一个图中，相同label的点的该属性不会存在相同的值，
+unique索引key的最大长度是480bytes，**超过480bytes的属性不能建立unique索引**。
+primary作为特殊的unique索引，因此最大key的长度也是480bytes。
+
+##### 1.3.1.2 non_unique索引
+
+点的non_unique索引指的是非全局唯一的索引，即若一个属性设置了non_unique索引，
+在同一个图中，相同label的点的该属性可以存在相同的值。
+由于non_unique索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组vid的最大值。
+每个vid是5bytes长度，因此non_unique索引key最大长度是475bytes。
+但是，不同于unique索引，超过475bytes也可以建立non_unique索引。
+只不过在对这样的属性建立索引时会只截取**前475bytes**作为索引key（属性本身存储的值不受影响）。
+并且，在通过迭代器遍历时，也是先自动截取查询值的前475bytes再进行遍历，
+所以结果可能和预期不一致，需要用户再过滤。
+
+#### 1.3.2 边索引
+
+##### 1.3.2.1 unique索引
+
+和点类似，边的unique索引指的是全局唯一的索引，即若一个属性设置了unique索引，在同一个图中，相同label的边的该属性不会存在相同的值，
+unique索引key的最大长度是480bytes，**超过480bytes的属性不能建立unique索引**。
+
+##### 1.3.2.2 pair_unique索引
+
+pair_unique索引指的是两点间的唯一索引，即若一个属性设置了unique索引，在同一个图的同一组起点和终点之间，
+相同label的边的该属性不会存在相同的值。为了保证pair_unique索引key在同一组起点和终点之间不重复，
+索引在用户指定的key后面加上了起点和终点的vid，每个vid是5bytes长度。
+因此最大key的长度是470bytes，**超过470bytes的属性不能建立pair_unique索引**。
+
+##### 1.3.2.3 non_unique索引
+
+和点类似，边的non_unique索引指的是非全局唯一的索引，即若一个属性设置了non_unique索引，
+在同一个图中，相同label的边的该属性可以存在相同的值。
+由于non_unique索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组eid的最大值。
+每个eid是24bytes长度，因此non_unique索引key最大长度是456bytes。
+但是，不同于unique索引，超过456bytes也可以建立non_unique索引。
+只不过在对这样的属性建立索引时会只截取**前456bytes**作为索引key（属性本身存储的值不受影响）。
+并且，在通过迭代器遍历时，也是先自动截取查询值的前456bytes再进行遍历，
+所以结果可能和预期不一致，需要用户再过滤。
+
+## 2. 图项目、点、边、属性命名规则和建议
+
+### 2.1 命名规则
+图项目、点、边和属性是识别符。该节描述了在TuGraph中识别符的允许的语法。
+下面的表描述了每类识别符的最大长度和允许的字符。
+
+|**识别符** |**长度** |**允许的字符**|
+|---------  |---------  |---------  |
+|用户、角色、图项目	|1-64字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+|点类型、边类型、属性	|1~256字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+
+### 2.2 使用限制
+
+|**描述**|	**最大个数**|
+|-------- |--------- |
+|用户数、角色数	|65536|
+|图项目的个数	|4096|
+|每个图项目的点和边类型数量之和	|4096|
+|每个点或边类型的属性数量	|1024|
+
+注：
+1、特殊字符和关键字说明：使用特殊字符或非保留关键字时，需要使用反单引号/backquote（``）进行引用；
+
+示例： ```match (`match`:match) return `match`.id limit 1```
+
+2、大小写敏感性：TuGraph大小写敏感；
+
+3、图项目、点/边、属性名称之间可以重复使用，同一点或边下的属性名称不可以重复；
+
+4、属性名字保留关键字：SRC_ID / DST_ID / SKIP
+
+
+### 2.3 命名建议
+|**识别符**|**描述**|**建议**|
+|-------|-------|--------|
+|图项目	|字母或中文开头	|如graph123、project123等|
+|点/边类型	|字母或中文开头，使用下划线区分单词	|如person、act_in等|
+|属性	|字母或中文	|如name、age等|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..ddb01d4a54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# 性能优先
+
+> 此文档主要介绍 TuGraph 性能优先的设计理念。
+
+## 1.简介
+
+TuGraph目前是世界上最快的图数据库，在图数据库标准评测LDBC SNB Interactive位居榜首（2023.3）。TuGraph的设计基于性能优先，致力于打造高性能的单机图数据库。该文档是TuGraph基于性能优先在存储层的核心设计。
+
+## 2.图操作的特性
+
+在属性图上的操作涉及读、写及其属性，对一些特殊的属性比如时间戳也访问模式也会影响到整体性能。这里通过对一些图操作特性的规律总结，来指导最终的性能。
+
+我们观察到很多图应用有类似的数据访问模式。例如，在信贷风险控制中，我们使用递归路径过滤搜索多对一模式，以找到可疑的信用欺诈用户和行为。针对网络赌博，可以通过识别短时间内的多笔资金转移，来发现涉赌的资金账号。股权穿透场景对实体间的股权关系进行递归计算。这些场景具有多跳实体和关系访问、时间窗口约束和读写事务等常见模式。
+更进一步，从介绍中的讨论和图负载的分析中，归纳出以下特征:
+
+**规律一** KHop是图中最典型的操作，它基于点和边的图拓扑的数据访问模式，和关系型数据库有着本质的区别。KHop 的典型性除了表现在数据访问模式不同，它同时也是图数据库最需要关注的性能点。
+
+**规律二** 图负载的数据访问在拓扑上有一定的局部性，同一个点的边通常会被同时访问。当这些边的标签相同时，有更大的概率会被同时访问。
+
+**规律三** 图负载在访问点边时，通常会访问其对应的属性，来作为遍历过滤的条件。
+
+**规律四** 在基于时序的图负载，对点边的过滤通常是在某个时间范围，比如最近的一周。
+
+**规律五** 写操作可能伴随着大量的读操作，需要在单个事务周期里处理。
+
+通过对实际线上图应用的分析，图负载的读写比率大约为 20:1，虽然场景局限在金融场景，集群数也有限，但涉及的数据规模和用户量非常庞大，具有一定代表性。20:1 的图负载读写比率，说明读工作负载对整体性能的影响更大， 而写工作负载的性能也不能忽视。
+
+## 3.存储数据结构
+
+TuGraph底层采用B+树来支持实时的增删查改事务。
+
+在排序树的数据结构中，B+树和LSM树为主要代表。B+树在树节点中使用拆分和合并式来更新排序数据，而 LSM 树在日志中追加更新，以进行延迟数据合并。B+ 早期用在文件系统的实现中，通过将数据保存 在自适应长度的叶子节点中，解决硬盘顺序操作和随机操作性能存在数据量级差别的问题，有较均衡的读写性能。LSM 树的主要优势使用 WAL(Write Ahead Log) 进行更新，将更新操作变成顺序操作，在键值较小时性能优势尤为突出。WAL 意味着将数据的更新合并推迟，批量更新能提升综合效率，也使得系统的调度变得复杂。如果更新合并完成前，恰好对其中的数据继续读取，LSM 树就需要读取几个层级局部合并的日志，会导致读取放大和空间放大，从而影响读效率。
+
+总结来说，B+ 树有较好的顺序读写性能，而 LSM 树在数据随机写方面占优。此外 LSM 树采用后台合并的方式，使得性能的波动难以预期，性能波动和上层存储和计算的关联性较弱，增加了整体设计的成本。综上考虑，TuGraph 选用 B+ 树作为读性能优先的实现。
+
+## 4.数据编码
+
+对于属性图模型而言，除了图拓扑编码外，属性数据也会很大程度影响功能和性能，我们先讨论属性数据如何与拓扑数据共存的编码格式。从目前的调研来看，属性编码有两种方式，我们称之为基于指针索引将属性数据单独存储的离散编码，和将属性数据和拓扑数据打包在一起的紧凑编码。离散编码根据程度的不同，可以每个属性都单独存储，或者每条边的属性打包后各自存储，下面的讨论对两种情况都适用。
+
+点查询。属性编码主要针对边，不涉及点查询。
+
+单边查询。离散编码通过指针定位边，紧凑编码则需要二分查找定位边的位置，离散编码有略微的优势。
+
+边遍历。离散编码在边遍历过程需要不断地进行指针跳转进行随机数据访问，而紧凑编码提前把数据排列在一起，顺序访问的特性使得效率大大提升。 由规律三知对边的遍历操作很普遍，紧凑编码在边遍历的优势明显。
+
+单边更新。离散编码对边的更新仅需找到对应的指针位置，插入数据后修改前后指针指向。紧凑编码则需要对紧凑排列的数据进行重编码，对整个边值进行重新写入，开销显著大于离散编码的情形。
+
+批量边更新。批量更新可以在内存中预先构建点的所有边属性，一次性编码写入，离散编码和紧凑编码相当。但紧凑编码不需要存储指针变量，更少的存储空间效率也会更高。
+
+以上离散编码和紧凑编码在某一类的查询的性能问题，可以通过优化的来缓解。整体上说，由于图负载读写 20:1 的特性，读性能在整体性能中占比更高。以及规律三所揭示的对属性访问的特征，TuGraph 更倾向于采用紧凑编码来保证读性能。其主要弱势为单边更新时重编码的开销，可以用自适应映射的技术来解决。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3f89389b2b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,34 @@
+# 多层级接口
+
+
+> 此文档主要介绍 TuGraph 的多层级接口的设计理念。
+
+## 1.简介
+
+多层级接口是 TuGraph 针对多丰富的使用场景，在易用性和高性中作出的平衡。比如描述式图查询语言 Cypher 能够抹去图数据库实现的细节，基于图模型的抽象来进行表达。Cypher 过于高层的表述，无法高效转化成底层的执行，因此提供了 Procedure API 的过程式语言，来发挥图数据库的最佳性能。
+
+接口可以大致分为客户端接口和服务端接口，大部分操作都在服务端完成，客户端只做数据的封装和解析。客户端和服务端通过网络连接，TuGraph 支持更加灵活的短连接 REST 协议，以及更加高效的长链接 RPC 协议，可根据不同的业务场景来选择。
+
+服务端接口均处在计算层，和图数据存储间用一层 Core API 在逻辑上隔开。
+
+![多层级接口架构](../../../../images/multi-level-Interfaces.png)
+
+## 2.客户端接口
+
+客户端接口指在客户端执行的接口，通常用于集成到软件应用中。TuGraph 的客户端的接口比较简单，包括登录登出、数据导入导出、存储过程加载调用、Cypher操作等。其中 Cypher 中集成了大部分的功能，包括数据操作、图模型操作、运维管理、账户管理等。
+
+由于 Cypher 的参数和返回值都是字符串，JAVA OGM 是对 Cypher 的结构化封装，即查询结果能够被封装为一个有类型的对象，方便使用。
+
+## 3.服务端接口
+
+服务端接口包括描述式图查询语言 Cypher、过程式图查询语言 Procedure API、图分析编程框架 OLAP API 和图神经网络编程框架 GNN PI，为图事务引擎、图分析引擎、图神经网络引擎提供服务，下面先展开介绍各个接口的特点。
+
+> __描述式图查询语言__ 是对查询逻辑的抽象描述，而与执行逻辑无关，对图数据库应用者比较友好，类比关系型数据库的 SQL 语言。TuGraph 的 Cypher 语言主要依照 Neo4j 开源的 OpenCypher 查询标准，同时对运维管理等辅助功能进行了扩展，在功能上囊括了 TuGraph 的大部分操作。描述式图查询语言会成为图数据库的主要数据操作方式，但由于描述到执行之间需要生成执行计划（Execution Plan），生成最优执行计划在学术界和工业界均有很长的路要走。
+
+> __过程式图查询语言__ 是为了解决描述式图查询语言与最优性能间的鸿沟。TuGraph的 Procedure API 是在 Core API 上做了一层简单的封装，C++ Procedure API的灵活性和高效性能够充分发挥存储的极致性能，也是 Cypher 优化的上限性能。Python Procedure API 是 C++ Procedure API 上的一层跨语言封装，翻译过程中值的拷贝会带来一定的性能损失，优势则主要是 python 语言本身的易用性。raversal API 是并行执行的 Procedure 接口，描述上更接近于集合的操作，比如扩展点集合所有出度邻居，获得一个新的点集。
+
+> __图分析编程框架__ 属于 ‘图计算系统’ 的范畴，会将图数据从支持增删改查的存储中导出快照，以更紧凑的数据存储格式来支持只读的复杂图分析，这里叫做OLAP API。OLAP API 封装了高并发执行的数据结构，包括 Vector、Bitmap等，以及基于 CSR 格式的图快照数据结构，然后提供一套并发的快速点边操作框架。在图分析任务完成后，数据可以通过接口写回图数据库。
+
+> __图神经网络编程框架__ 主要提供了图神经网络应用编程所需要的接口，能够对接PyTorch 等机器学习框架。TuGraph 的图神经网络编程框架主要集成了 DGL，在 Python 的语言环境中完成从图存储到图神经网络应用的完整流程。
+
+除了 Cypher 是解释执行外，其余服务端接口都是编译执行，即需要将对应代码传到服务端后，进行编译（可能会有时间开销），再在服务端执行。所以通常需要先加载，然后再已加载的应用列表中找到程序，传输入参数后执行。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..e895545616
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> 此文档主要介绍 TuGraph 的HTAP的设计理念。
+
+## 1.简介
+
+![htap架构](../../../../images/htap.png)
+
+HTAP 的实现在架构上有多种不同的方式：一是用两个不同的副本来分别处理 OLTP 和 OLAP 的任务，核心是数据的一致性同步和额外的资源开销；二是在任何时候都使用同一份数据存储，该实现的数据结构存在内存膨胀，在工业化落地还需要进一步工作。在 TuGraph 的设计中，简单的 OLAP 操作和 OLTP 操作共用一份数据，而复杂的 OLAP 操作则单独导出快照处理。
+
+## 2.设计
+
+在 TuGraph 中，OLTP 为图事务引擎，在图 4.4对应事务操作；OLAP 为图分析引擎，对应简单图分析操作（比如 SPSP）和复杂图分析操作（比如 PageRank），前者可以直接在图存储上执行，而后者需要额外导出快照执行。
+
+- 事务操作，即图事务引擎测的操作，为局部图的增删查改操作，典型的应用为 K 跳访问 K-Hop。
+- 简单分析操作，是图分析引擎中较为简单的部分，通常也是局部的图分析操作，比如两点间最短路算法 SPSP、Jaccard 算法。
+- 复杂分析操作，是图分析引擎中较为复杂的部分，通常涉及全图的多轮数据迭代操作，比如网页排序算法 PageRank、社区发现算法 Louvain。
+
+如架构图所示，我们在图中增加了外部存储，使得图分析的数据源不局限在图数据库中，可以直接从文本文件读取。
+
+- 图存储，即图数据库中的存储，有精心设计的数据结构，能够完成实时增删查改。
+- 外部存储，可以是 RDBMS 或文本文件，以边表的简单方式存储，仅供一次性批量读取，和批量结果写入。在计算层，和整体架构图中的接口对应。
+- Cypher，描述式图查询语言，可以并发执行。
+- Procedure API，过程式图查询语言，其灵活性能够同时支持事务操作和图分析操作，但效率上不足以完成复杂图分析操作，可以并发执行。
+- OLAP API，针对多轮迭代的复杂图分析。应用需要先将存储中的图数据导出成内存中的一个快照，该快照仅用来快速访问，而不需要考虑 ACID 的写支持，因此可以排布地更加紧凑，CSR 排布的读效率要远高于图存储的数据排布。OLAP API 只能串行执行，每个操作都用满 CPU 资源。
+
+OLAP API 的快照可以从外部存储创建，即将边表数据构成件 CSR 的格式；或者从图存储中创建。需要注意的是，OLAP API 要求点的 ID 是连续的自然数，可能需要额外的 ID 映射，该步骤在创建快照时可以在指定一个属性进行映射，或直接取属性值作为 ID。
+
+与计算接口和存储相对应，有四种运行模式。
+
+- 事务模式，每个操作对应一条 Cypher 语句，默认是一个事务。
+- Plugin 模式，通过插件的方式，在计算逻辑加载到服务端后调用，也叫存储过程。
+- Embed 模式，和 Plugin 模式的使用接口一致，区别是图数据库服务不需要起来，就可以直接用接口调用数据库中的数据，通常用于调试 Procedure API 和OLAP API 的代码，调试信息和操作步骤比 Plugin 模式更加友好。
+- Standalone 模式，最大程度剥离与图数据库的关系，仅想用图分析引擎做数据分析时，该模式会比较直接。Standalone 模式会直接使用外部存储的数据。
+
+图神经网络引擎的使用方式和 ‘复杂图分析操作’ 类似，会同时调用部分 OLAP API 和 GNN API，不在这里展开。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..c055f3df01
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,10 @@
+产品特点
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
+    
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..cf901d31cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# TuGraph产品架构
+
+> 此文档主要介绍 TuGraph 的产品架构。
+
+## 1.简介
+
+![产品架构](../../../images/architecture.png)
+
+上图从功能模块的角度，以 TuGraph 为例，给出了企业级图数据库的整体架构，自下而上包括：
+
+- 软硬件环境。涉及图数据库的开发和使用环境。TuGraph 主要基于底层的 C++语言开发，能够兼容市面上大部分操作系统和 CPU。
+- 存储层，包括 KV 存储层和图存储层。存储层需要支持计算层所需的各个功能。
+- 计算层。计算层应包括图事务引擎、图分析引擎和图神经网络引擎，也包含了服务端提供的多种编程接口，包括描述式查询语言 Cypher，存储过程等。
+- 客户端。客户端 SDK 应支持 Java、Python、C++ 等多种语言，也支持命令行的交互方式。Browser 和 Explorer 通过网页端交互的方式，降低了图数据库的使用门槛。
+- 在生态工具方面，覆盖了企业级图数据库的开发、运维、管理等链路，提升可用性。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..c24881b9cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/7.functionality.md
@@ -0,0 +1,110 @@
+# 功能概览
+
+> 此文档主要介绍 TuGraph 的主要功能和特性。
+
+## 1.安装部署
+
+## 1.1.部署方式
+
+TuGraph目前提供云部署、Docker部署以及安装包部署三种部署方式，用户可根据实际情况选择适合的部署方式。
+
+## 1.2.软硬件环境
+
+TuGraph核心是由C++开发，默认使用的编译器为GCC8.4，使用c++17标准。此外，存储过程中额外提供了Python Procedure API，该功能需要Python环境。TuGraph不需要特殊的硬件比如GPU，对RDMA、HBM等高延迟低带宽的通用硬件升级可以天然适配。
+
+TuGraph测试过基于X86和ARM的CPU，包括Intel、AMD、Kunpeng、Hygon、飞腾等，也同时在多个操作系统上运行，包括Ubuntu、CentOS、SUSE、银河麒麟、中标麒麟、UOS的主流版本，对操作系统和CPU没有特殊的要求。
+
+软硬件环境也包括依赖库的环境，由于TuGraph的存储层中默认的KV存储是LMDB，需要文件系统能够支持POSIX接口。在不同的环境下编译和参数配置会略有不同，比如在图存储的点边数据打包中，应和操作系统的页表大小匹配，默认为4KB，建议将系统的页表大小也设置为4KB。
+
+## 2.存储层
+
+在图数据模型上，TuGraph支持属性图模型，按照层次可以分为子图、标签（包括点标签和边标签）、属性。从存储层看，TuGraph使用使用直观的多层的树状模型，没有跨子图的标签，也没有跨标签的属性，仅保留图模型的核心逻辑。
+
+在子图的存储上，TuGraph对多图做了数据的物理隔离，每个图对应一个LMDB的实例。多图的元数据描述信息，保存在meta的特殊的公共LMDB实例中。点边标签及其属性的存储，通过将图数据自适应地映射到KV键值对，最大程度发挥读性能。同时在KV层实现了多线程写，解决了LMDB写性能较低的劣势。主键索引和二级索引，对应LMDB中B+的表，支持基于比较的索引值增删查改。
+
+存储层还保留了一些其他非核心功能的数据，包括权限数据、预编译的插件数据、监控数据等。
+
+## 3.计算层
+
+计算层在功能上分成三个部分，包括TP类的图事务引擎，AP类的图分析引擎和图神经网络引擎。
+
+- __图事务引擎__，主要用来处理并发的图操作，包括单点查询、邻居查询、路径遍历。图事务引擎侧重并发操作的ACID事务，确保操作逻辑不会互相干扰，主要性能指标为 QPS，即每秒完成的查询数量。
+
+- __图分析引擎__，操作类型通常为全图迭代。部分简单的分析任务（比如SPSP）可以由图事务引擎完成，复杂的分析任务均由图分析引擎完成，单个任务通常需要数秒至数小时。因此单个图分析任务要并发利用所有的硬件资源，性能指标为任务完成的总时长。
+
+- __图神经网络引擎__，通常也为全图迭代。图神经网络引擎除了基于图拓扑的操作，也需要集成一个机器学习的框架来处理向量操作，比如 PyTorch、MXNet、TenserFlow。
+
+三个引擎的操作逻辑不尽相同，独立配置资源池。事图事务引擎基于RPC操作设置了一个线程池，每接受客户端的一个操作，从线程中取一个线程来处理，并发执行的数量等于RPC线程池的容量，通常配置为服务器的核数。图分析引擎有一个分析线程池，每个图分析任务会并发执行，即用所有的线程来执行一个任务，来加速操作的性能。TuGraph图分析操作串行执行的特性会一定程度限制用户的使用体验，并发的图分析的需求可以通过高可用部署的方式，增加机器资源来处理，或者接入外部的任务调度器，将数据传到实时调度的容器来计算。图神经网络操作在图上的操作会复用图事务引擎或图分析引擎的资源，向量的操作会起单独的资源，在机器学习框架中可以使用GPU等单独的加速硬件。
+
+## 4.核心功能
+
+### 4.1.查询语言
+
+TuGraph 提供 Cypher 图查询语言，遵循OpenCypher标准。
+- __支持Procedure嵌入__
+
+- __可插拔优化框架__ 各类优化功能
+
+- __可扩展安全性检查框架__ 对于cypher进行
+
+### 4.2.存储过程
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个 REST 请求并在客户端完成整个
+处理流程的方式，TuGraph 提供的存储过程（Procedure）是更简洁和高效的选择。
+
+从 3.5 版本开始，TuGraph 重新设计了新的存储过程编程范式，支持定义标准的签名和结果，支持POG编程。
+
+TuGraph 支持 POG (Procedres on Graph Query Languages) 编程和 POG 库，其中“Graph Query Languages”包含 Cypher 以及
+制定中的 ISO GQL 等图查询语言。POG 库提供在查询语言中对用户定义的存储过程的访问，打破了查询语言和存储过程之间的界限，扩展了查询
+语言的使用范围。
+
+> 这个文档描述了 [新的 Procedure 编程范式以及 POG](../9.olap&procedure/1.procedure/1.procedure.md)。
+
+### 4.3.数据导入导出
+
+尽管TuGraph本身支持数据的插入，但批量导入能够大幅提升的效率。导入的功能可以分为空库导入（离线导入）和增量导入，前者指子图是空的时候进行导入，额外的假设能够大幅提升导入的性能，在 TuGraph 中，空库导入和增量导入的吞吐率差了10 倍。在数据导出中，需要考虑导出数据的一致性，即是基于一个快照数据导出的。
+
+TuGraph 可以通过 命令行工具`lgraph_export` 来对已经存放在TuGraph的图数据进行数据导出，导出格式支持CSV和JSON。
+
+### 4.4.备份恢复
+
+TUGraph的备份在功能上可分为主动/定时、离线/在线、全量/增量备份，用尽量小的存储和计算代价来完成备份。恢复功能可以恢复到最新的状态，或者历史标注的时间点，需要保证数据库是一致的状态。
+
+### 4.5 数据预热
+
+TuGraph 是基于磁盘的图数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+### 4.6 高可用
+
+高可用是指通过通过集群配置，做到实时多副本数据热备，在部分副本不用时，集群仍然能正常提供服务，TuGraph采用 RAFT 协议的多机热备机制，能够将 RPO 降低到接近 0 的程度。TuGraph 选择在计算层进行数据同步，同步的对象是写操作，通过 RPC 接口快速同步。TuGraph 的高可用集群采用主从模式，只有主节点处理写请求，主从节点均能处理读请求。主节点的写请求处理需要同步到多于二分之一的总节点上，多数节点写成功，该写请求才算完成。
+
+## 5.客户端工具
+
+客户端主要分为各种编程语言的SDK，OGM以及命令行工具。
+
+客户端 SDK 主要用于二次开发，可以通过 RPC 或 REST 协议链接服务端。RPC 基于长链接有较好的性能，数据需要通过 protobuf 统一序列化。TuGraph 使用brpc，支持 Java、Python、C++ 的 rpc 客户端。REST 的协议比较宽泛，能够简单适配更加多样的环境，不同的编程语言能够简单对接。TuGraph 给出了 Python 的REST 客户端实例，命令行的交互也是用 REST 实现。
+
+OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。
+
+命令行工具`lgraph_cypher`是查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+
+## 6.生态工具
+
+生态工具是企业级数据库一个非常重要的组成部分，丰富的生态工具能够大大提升图数据库的可用性，稳定性。
+
+### 6.1.TuGraph DataX
+
+![导入导出](../../../images/tugraph-datax.png)
+
+TuGraph 核心支持 CSV 和 JSON 合适的导入导出，提供空库导入和增量导入的模式。实际中会存在 MySQL、Kafka、Hive 等多数据源导入的需求，TuGraph 通过 DataX 做多数据源的对接。由于关系模型和图模型存在的差异，数据清洗的流程可以使用 SparkSQL 快速处理，TuGraph 本身仅关注 CSV 和 JSON 的简单场景导入可靠性和性能。
+
+### 6.2.可视化交互
+
+TuGraph Browser 是面向图数据库直接使用者的可视化交互界面，功能上覆盖了 TuGraph 的绝大部分能力，包括数据导入、图模型建立、数据增删查改、监控运维等操作链路。
+
+### 6.3.运维监控
+
+TuGraph 使用 Prometheus 加 Grafana 的监控框架，采用松耦合的方式。Prometheus 从 TuGraph 的监控接口获取监控信息，存储在本地时序数据库中，然后通过 Grafana 在网页端交互展示。
+
+TuGraph 提供的监控的状态包括图数据库的状态和服务器的状态，前者包括读写负载、点边数量等数据库端的状态，后者包括内存、CPU、硬盘等服务器的实时状态。如果某些监控状态超过了预期的阈值，就需要主动告警，通常需要对接其他运维管控系统，比如群消息、邮件告警等。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..4cc5c0c10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# 应用场景
+
+> 此文档主要介绍图数据库适用的应用场景。
+
+## 1. 金融领域
+
+金融领域的实体主要涉及人、公司、账户、产品等，它们之间的关系包括交易关系、登录关系、股权关系、雇佣关系等。这些实体构成了一张金融图数据网络。应用图数据库，我们可以从金融图数据网络里发掘出大量有用信息，帮助我们做出更准确的金融决策。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|贷款审核|通过分析申请人的关联关系、交易情况等辅助判断申请人的偿还能力和偿还意愿，可应用于零售贷款审核、小微贷款审核、供应链金融等。此方法可与传统的基于申请人自身信息的审核机制互补，在个体信息录覆盖较低的小微贷款审核中尤其有用。|
+|贷后管理|通过分析借款人交易情况，辅助分析借款人是否有逾期风险。相比于传统只在贷款资金流向特定用户的情况下发出警报的方式不同，该方法可以给每个账户赋予一个风险值，并在贷款流向高风险账户时给出预警。|
+|失联修复|通过分析失联贷款人的社交和购物数据，找出其它联系方式。该方法可以大幅改进失联修复率。|
+|担保环检测|可在担保关系图中找出环状、链式、家族式、交叉等特殊担保结构，揭露潜在风险。相比于关系型数据库的JOIN方法，基于图算法的方案更高效，可以检测出任意长的担保环，且可以实现更复杂限定条件的检测。|
+|信用卡团伙欺诈检测|构建信用卡申请信息中的地址、联系方式等关系网络，在申请关系网络中运行社区发现算法，可以检测出疑似欺诈的团伙，从而拒绝涉嫌欺诈的申请件，减少经济损失。|
+|反洗钱|通过交易网络和介质网络，找出疑似洗钱的行为和链路。洗钱是一个复杂的多方参与的过程，通过在交易和社交网络中进行图分析，我们可以更精准的检测出洗钱行为。|
+|车险反欺诈|针对有修理厂参与的骗保行为，通过分析被保人、案件地点和修理厂之间的关系，可以更精准的识别出骗保行为，减少经济损失。|
+
+## 2. 工业领域
+
+在生产和制造过程中会产生大量异构数据，如何有效的组织和管理这些数据是工业大数据中最重要的问题之一。这些数据包括设计文档、设备数据、仿真方案和结果、实验结果、经验文档等，关系错综复杂。传统的数据管理系统只能累积数据，而查找相关材料则往往力不从心。使用图模型，将这些不同类型的数据组织成一张网络，就可以方便地浏览和查找数据。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|供应链管理|供应链数据主要关心产品—部件—零件的对应关系、零件与供应商的对应关系、零件中的敏感成分等。相比于传统的物料管理（BOM）系统，使用图数据库的方案可以更方便地维护多个部件层次、多个供应商级别的复杂网络，从而为穿透式供应链提供基础支持。|
+|文档管理|使用图数据库可以将不同类型的文档按不同关系有机地组织在一起。例如将部件设计文档、部件—零件关系、部件测试文档、相关经验文档等组织起来，在需要查找时就可以方便获取该部件的所有相关信息。|
+|研发过程管理|产品研发和验证过程中需要进行大量仿真、试验和测试，每一个测试流程都会涉及大量不同的步骤。步骤之间的连接关系、每个步骤中使用的数据版本、算法版本等就构成了一张复杂的关系网络。使用图数据库可以更好管理这个关系网络，从而为研发过程中的数据复用、流程改进提供良好基础。|
+|设备信息管理|制造业需要管理大量设备，设备之间又互相关联（供电关系、供料关系、空间关系），从而形成了一张复杂的网络。传统的数据库很难体现这种复杂关系。而使用图数据库则可以便捷表示这些关系，从而更好的管理设备信息。|
+
+## 3. 智慧城市
+
+随着科技的发展，城市的智能化管理已成为一个大趋势。智能化管理需要建立在良好的信息管理平台之上，因此需要强大的系统软件做支撑。在智能化城市管理系统中，智能化决策系统需要基于大量不同信息做出决策，这些信息包括各种拓扑信息（道路、管线），供求信息（电力输送、饮用水供应、污水排放），环境信息（温度、湿度、雨量）等。要将这些复杂的异构数据有机管理起来，并基于它们做出决策，就需要一个成熟的系统。传统的数据管理系统基于关系数据模型，并不适合管理这种复杂异构数据。而使用图模型就可以很好的解决这一问题。如果我们将这些不同的数据利用图数据库进行管理，就可以实现很多复杂的智能管理场景。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|智能交通|基于道路拓扑、道路容量及当前流量，可以进行智能信号灯调度，从而提高通行效率。|
+|智能排水|基于排水系统信息及当前雨量，可以对排水系统进行调度，从而减少内涝的产生。|
+|管线管理|将管线的生产、安装、拓扑信息，以及历史状态信息有机组织起来，可以帮助我们对管线进行全周期管理，包括故障排查、寿命评估等。|
+|人群疏散|大量人群需要疏散时，需要考虑公交、地铁、出租车、共享单车等多种交通方式，同时还需要考虑道路承载量。使用图数据库将这些信息有机整合在一起，可以帮助我们更好的做出决策，以便为大型公共活动提供更好的支持。|
+
+## 4. 社会治理
+
+社会治理包括公共安全、法律事务、舆论、网络安全等多方面。社会治理是一个综合性的、多系统联动问题。它需要综合大量数据、全局考量才能做出更好的决策。在这种多维度复杂数据问题上，图数据模型可以提供更好的适应性，从而为智能化的社会治理决策平台提供坚实的基础。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|犯罪团伙发现|合谋团伙必然会通过某些方式产生联系，这种联系包括面谈（出现在同一地点）、电话联系、或者互联网联系，他们还可能有经济往来。如果我们将这些数据统一存放在一张图中，我们就可以通过图分析算法查找出联系紧密的群体，从而发现和识别整个犯罪团伙。|
+|涉众案件调查|涉众案件，特别是涉众经济案件往往涉及大量的人员和要素（货币、地点、事件等）。如何有效的组织这些资料，从而为办案提供证据支持是涉众案件调查的一个难点。使用图数据库来存储和分析这些资料，可以让我们快速定位资料、分析人员构成、为案件调查提供更好的技术支持。|
+|违法网站甄别|违法网站、钓鱼网站、黄色网站等往往通过使用不同的域名和IP来避免被封杀。基于黑名单的过滤方法只能封禁已知的违法网站，无法对新出现的域名和IP进行有效甄别。基于IP—域名网络的映射关系，我们可以建立一张图，然后通过图计算建立起域名和IP的“可信度”模型，利用该模型来判断网站是否属于违法网站。|
+|法院卷宗管理|卷宗往往错综复杂，不同的案件之间可能通过当事人产生联系，也可能通过案发地、案件性质、审判人员等产生联系。这些联系构成了一张复杂的网络。使用图数据库我们可以更方便的管理这些复杂关系，提高办案和查询效率。|
+
+## 5. 互联网
+
+人—人关系的社交网络、人—商品的购买关系都能构成图。通过分析这些网络数据，我们可以为用户提供更优质的服务，包括相关推荐、用户信息归集、重要用户识别、垃圾用户识别等。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|ID映射|图数据库可以将用户相关的所有信息，包括用户之间的关系统一存储在一个数据库中，同时还能通过这些关系来找出疑似单人多号和多人一号的情况，从而为后期的风控、推荐等业务提供决策支持。|
+|好友推荐|基于分析社交网络，我们可以提供“好友的好友”，“共同好友”等好友推荐。|
+|商品推荐|基于用户—商品关系图，我们可以找出兴趣爱好类似的用户，向他们推荐类似用户选择的其他商品。|
+|垃圾用户识别|传统的垃圾用户识别主要基于用户账号本身的信息，如注册信息、发帖信息等，但是这些信息都比较容易伪造。而基于网络的信息则不存在这个问题：它们很难被伪造。因此基于网络信息的垃圾用户识别可以更加精准和高效。|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..5171d5ece8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/9.glossary.md
@@ -0,0 +1,38 @@
+# 名词解释
+
+## 1.图技术
+
+> __图计算__：广义图计算，技术上包括图查询、图分析、图学习；狭义图计算，包括图计算任务和图分析。
+
+> __图查询__：指图数据库的查询能力，通常通过Cypher/ISO GQL等查询语言实现。
+
+> __图分析__：侧重于对全图数据的算法分析、模式分析等。
+
+> __图学习__：与图神经网络、图机器学习含义相同。
+
+> __图智能__：等于广义图计算，包括图数据库、图分析、图学习，通常用于概念推广，不用于产品。
+
+## 2.图产品
+
+> __图计算系统__：一般包括图数据库、图分析系统、图学习系统，有时也特指图分析系统。
+
+> __图数据库__：侧重于对图数据的增删改查、事务性操作等，如TuGraph DB、Neo4j、JanusGraph等。
+
+> __图分析系统__：解决图分析问题，可以细分为流水图分析、离线图分析，如TuGraph Analytics、GraphX等。
+
+> __图学习系统__：解决图学习问题，比如TuGraph Learn、DGL等。
+
+## 3.具体概念
+
+
+> __Vertex__：点，也叫顶点，也指 Vertex Value。尽量避免Node（结点、节点）的叫法，一般用Node表示服务器个数，容易叫混。结点指结合、交结、交叉的意思；节点可以指一个时间线上的里程碑（关键节点）或计算机系统里的一个处理实体（如计算机网络里的一台服务器）。
+
+> __Edge__：边，也指 Edge Value。
+
+> __Vertex Label__：点类型，也叫 Vertex Type。
+
+> __Edge Label__：边类型，也叫 Edge Type。
+
+> __Degree__：度，入度/出度，表示一个点的入边、出边的条数。注意，在非图论的场景中，往往把“跳”也称作“度”。
+
+> __Hop__：跳，表示一个点到另一个点之间的路径经过的点数（不含起点、含终点）。算法性能测试里K-Hop即为此义。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/index.rst
new file mode 100644
index 0000000000..efe03a5128
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph入门
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..f8ce47e572
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/1.preparation.md
@@ -0,0 +1,88 @@
+# 快速上手
+
+> 此文档主要用于新用户快速上手，其中包含了 TuGraph 的简介、特征、安装和使用。
+
+## 1.简介
+
+TuGraph 是蚂蚁集团自主研发的大规模图计算系统，提供图数据库引擎和图分析引擎。其主要特点是大数据量存储和计算，高吞吐率，以及灵活的 API，同时支持高效的在线事务处理（OLTP）和在线分析处理（OLAP）。 LightGraph、GeaGraph 是 TuGraph 的曾用名。
+
+主要功能特征包括：
+
+- 标签属性图模型
+- 支持多图
+- 完善的 ACID 事务处理
+- 内置 34 图分析算法
+- 基于 web 客户端的图可视化工具
+- 支持 RESTful API 和 RPC
+- OpenCypher 图查询语言
+- 基于 C++/Python 的存储过程
+- 适用于高效图算法开发的 Traversal API
+
+性能及可扩展性特征包括：
+
+- TB 级大容量
+- 千万点/秒的高吞吐率
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线备份
+
+
+### 1.1.支持的平台
+
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的的平台。
+
+### 1.2.硬件要求
+
+_目前我们建议用户使用 NVMe SSD 配合较大的内存配置以获取最佳性能。_
+
+| 硬件   | 最低配置      | 建议配置                     |
+|------|-----------|--------------------------|
+| CPU  | X86_64    | Xeon E5 2670 v4          |
+| 内存   | 4GB       | 256GB                    |
+| 硬盘   | 100GB     | 1TB NVMe SSD             |
+| 操作系统 | Linux 2.6 | Ubuntu 18.04, CentOS 7.3 |
+
+## 2.安装
+
+TuGraph 可以通过 Docker Image 快速安装，或者通过 rpm/deb 包本地安装。另外TuGraph在阿里云计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。
+
+> 安装包/镜像下载：参考[下载地址](../1.guide.md)中的“TuGraph最新版本”章节。
+
+> 计算巢部署：可以在阿里云计算巢自行搜索，也可以通过[部署链接]( ../5.installation&running/5.cloud-deployment.md )快速访问。
+
+### 2.1.通过docker快速体验
+
+1. 本地安装 docker 环境
+
+   参考 docker 官方文档：https://docs.docker.com/get-started/
+
+2. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. 启动docker
+   ```shell
+    docker run -it -d -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000是默认的http端口，访问tugraph-db-browser使用。
+   # 7070是默认的http端口，访问legacy tugraph-web访问使用。
+   # 7687是bolt端口，bolt client访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   
+   # 根据/usr/local/etc/lgraph.json的tugraph启动的默认配置，
+   # /var/lib/lgraph/data是容器内的默认数据目录，/var/log/lgraph_log是容器内的默认日志目录
+   # 命令将数据目录和日志目录挂载到了宿主机的/root/tugraph/上进行持久化，您可以根据实际情况修改。
+   ```
+
+4. 前端访问
+
+访问tugraph-db-browser: `http://x.x.x.x:8000`，默认用户名为 `admin`，密码为 `73@TuGraph`。
+首次登录会默认跳转修改密码页面，请尽快修改默认密码避免安全风险。
+
+**注意**：
+如果需要使用legacy tugraph-web，访问`http://x.x.x.x:7070`，默认用户名为 `admin`，密码为 `73@TuGraph`。 
+但请注意，legacy web是不再维护的版本，建议使用tugraph-db-browser。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..b8dd8d03ec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# 影视场景Demo
+
+> 此文档主要介绍 影视场景Demo 的使用方法。
+
+## 1.建模和数据导入
+
+完成登录后，点击`新建图项目`，选择movie数据，填写图项目配置，系统会自动完成Movie场景图项目创建。或者直接使用产品自带的movie图项目（带有官方图标）。
+
+Movie 场景图：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| 标签          | 类型  | 说明                                  |
+|-------------|-----|-------------------------------------|
+| movie       | 实体  | 表示某一部具体的影片，比如"阿甘正传"。                |
+| person      | 实体  | 表示个人，对影片来说可能是演员、导演，或编剧。             |
+| genre       | 实体  | 表示影片的类型，比如剧情片、恐怖片。                  |
+| keyword     | 实体  | 表示与影片相关的一些关键字，比如"拯救世界"、"虚拟现实"、"地铁"。 |
+| user        | 实体  | 表示观影的用户。                            |
+| produce     | 关系  | 表示影片的出品人关系。                         |
+| acted_in    | 关系  | 表示演员出演了哪些影片。                        |
+| direct      | 关系  | 表示影片的导演是谁。                          |
+| write       | 关系  | 表示影片的编剧关系。                          |
+| has_genre   | 关系  | 表示影片的类型分类。                          |
+| has_keyword | 关系  | 表示影片的一些关键字，即更细分类的标签。                |
+| rate        | 关系  | 表示用户对影片的打分。                         |
+
+## 2.查询示例
+
+### 2.1.示例一
+
+查询影片 'Forrest Gump' 的所有演员，返回影片和演员构成的子图。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.示例二
+
+查询影片 'Forrest Gump' 的所有演员，列出演员在影片中扮演的角色。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.示例三
+
+查询 Michael 所有评分低于 3 分的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.示例四
+
+查询和 Michael 有相同讨厌的影片的用户，讨厌标准为评分小于三分。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.示例五
+
+给 Michael 推荐影片，方法为先找出和 Michael 讨厌同样影片的用户，再筛选出这部分用户喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.示例六
+
+查询 Michael 的好友们喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.示例七
+
+通过查询给'Forrest Gump'打高分的人也喜欢哪些影片，给喜欢'Forrest Gump'的用户推荐类似的影片。
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..fee5e77f3e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,62 @@
+# 场景：流浪地球
+
+> 此文档主要介绍 流浪地球 demo的使用方法。
+
+## 1.Demo场景设计
+
+Demo背景基于流浪地球1、流浪地球2的故事背景进行设计
+
+- 基于剧情，设计了图结构，包含组织、角色、天体与设施3类点，事件、关系两类边
+- 根据剧情准备了对应Schema的数据
+- 准备了一些query，提出一些关于剧情的问题
+
+## 2.目录结构
+
+- rawdata: 原始剧情数据和schema定义文件
+- case.cypher: 查询相关的Cypher语句
+- control.sh: 控制TuGraph Server启动停止的脚本
+- lgraph_standalone.json: TuGraph Server启动的配置文件
+
+## 3.使用说明
+
+前置条件：TuGraph已安装
+
+## 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8000，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择流浪地球数据，填写图项目配置，系统会自动完成流浪地球场景图项目创建。
+    - 或者直接使用产品自带的流浪地球图项目（带有官方图标）。
+
+## 5.Cypher查询
+
+参考cypher文档，在TuGraph的Web页面前端输入Cypher进行查询
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.查询展示
+查询木星危机的所有事件经过
+
+```
+MATCH (n)-[e:事件关系]-(m) where e.title='木星危机' RETURN n,e
+```
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+查询所以危机的相关事件经过
+
+```cypher
+MATCH (n)-[e1]-(m)-[e2]-(p)
+where e1.title REGEXP ".*危机" and e2.title REGEXP ".*危机" and e1.title <> e2.title
+RETURN n,e1,e2,p
+```
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..41b58b1dfd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# 场景：三体
+
+> 此文档主要介绍 三体 demo的使用方法。
+
+## 1.Demo场景设计
+Demo背景基于三体1、三体2、三体3的故事背景进行设计。
+
+根据三体故事的设定，我们设计了4类点和6类边，点包括“人物”、“组织”、“计划”、“时间线”，边包括“人物-人物关系”、“人物-计划关系”、“人物-组织关系”、“组织-计划关系”、“组织-组织关系”。
+根据剧情准备了对应Schema的数据，准备了一些query，提出一些关于剧情的问题。
+
+## 2.目录结构
+rawdata: 原始剧情数据和schema定义文件。
+case.cypher: 查询相关的Cypher语句。
+control.sh: 控制TuGraph Server启动停止的脚本。
+lgraph_standalone.json: TuGraph Server启动的配置文件。
+
+## 3.使用说明
+
+前置条件：TuGraph已安装。
+
+### 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8000，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三体数据，填写图项目配置，系统会自动完成三体场景图项目创建。
+    - 或者直接使用产品自带的三体图项目（带有官方图标）。
+
+### 5.Cypher查询
+
+参考TuGraph文档，在TuGraph的Web页面前端输入Cypher进行查询。
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![data](../../../../images/three-body-data.png)
+
+### 7.查询展示
+
+#### 7.1.人物关系查询
+三体一剧情中，一开始全世界各地发生了大量科学家自杀事件，引起了警方重视，查案过程根据人物关系线索一步步排查，就如上面的图所示，随着线索越来越多，背后的真相逐步浮出水面。史强和汪淼发现大多数人都和叶文洁有着直接或者间接的联系，并派汪淼卧底，最终发现叶文洁的最终统帅身份。在图中也可以看出，叶文洁顶点周围有很多边关系（一度或二度邻居很多）。
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.邻域顶点分析
+三体中的各种计划比较多，有的时候可能会被绕晕，这时候我们可以通过图的邻居顶点查询来查看该计划的相关人物和组织等。如"面壁计划"中,我们可以看到有四位人物与之相关，这四位也是被世人所寄予厚望的“面壁者”。
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.查询a节点和b节点的共同邻居
+我们往往希望知道两个人物之间的共同关联的人物都有谁，这样就能很快的掌握这两个人物之间的关系，在大数据量的情况下，使用cypher进行图关系分析就很方便！
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.设置/更改属性
+随着剧情推进，我们逐步了解了"叶文洁"身上的多个标签，那么我们也可以将这些标签更新至“叶文洁”节点上：
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.增加/删除节点
+后续我们了解到了罗辑、程心等等人物和PIA、星环集团等组织，希望把这些作为节点添加至图中：
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..3252a13eb5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# 场景：三国
+
+> 此文档主要介绍 三国 demo的使用方法。
+
+## 1. 简介
+由于史料的缺失，一些即使为人们熟知的历史事件也往往存在着很多未解之谜。以三国历史为例，诸葛亮为什么出山帮助当时势力弱小的刘备，同为天下英雄的曹操和刘备为什么成就差距巨大等等。以往学者往往采用二维关系分析历史，这样得出的结论往往比较片面。使用TuGraph将三国的历史人物和事件导入图模型中，使用图计算方式进行分析，能够帮助我们从有限的信息中获得更有价值的知识，是一种非常有意义的跨学科尝试。
+## 2. 数据建模
+我们设计了5类顶点和5类边，点包括“主公”，“州”，“文臣”，“武将”，“战役”，边包括“父亲”，“兄长”，“隶属”，“籍贯”，“参战”。其具体建模信息如下所示：
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. 数据导入
+- 手动导入
+    - 向TuGraph导入数据，既可以使用TuGraph的`lgraph_import`工具离线导入。lgraph_import导入命令如下所示
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- 自动创建
+    - 点击`新建图项目`，选择三国数据，填写图项目配置，系统会自动完成三国场景图项目创建。
+    - 或者直接使用产品自带的三国图项目（带有官方图标）。
+## 4. Cypher分析
+### 4.1. 诸葛亮为什么选择刘备
+通过如下cypher命令可以查看诸葛亮和曹操、刘备之间的关系
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+从图中可以很直观的看出，曹操和诸葛亮之间的最短路径之一包含徐州之战，曹操曾经因父亲被杀对徐州进行过屠城，而诸葛亮是徐州琅琊郡人，任何人都断然不会选择一个屠杀过自己家乡的军阀作为主公。而相反，刘备曾经在徐州之战中阻止过曹操的暴行，这应当是诸葛亮对刘备好感的原因之一。
+
+### 4.2. 曹操为什么成就比刘备高
+通过如下cypher命令可以查看家族对曹操创业的助力
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+平定天下最重要的就是军事人才，曹操其父本姓夏侯，过继于曹氏，曹氏和夏侯氏在谯县都属于地方大族，在曹操创业初期提供了夏侯惇，夏侯渊，曹仁，曹洪在内大量的军事人才。而刘备其父早丧，没有家族助力，年过50才凑齐了自己的五虎上将，而这时已经过了天下大乱争夺地盘的最佳时机，曹操已经天下九州居其六了。
+
+### 4.3. 三国中最强大的魏国为何最先灭亡
+通过如下cypher命令可以查看曹操集团的重要文官组成
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+曹魏事实上于249年灭亡于高平陵之变，立国29年，少于蜀汉（43年）和东吴（51年）。三国中实力最强大的魏国最先灭亡的原因就在于曹魏的文官制度（九品中正制）使得权力很容易集中在世家大族手中。从图中可以看出，曹操曹丕父子两代的重要文臣几乎都是世家大族，颍川荀氏，颍川钟氏，颍川陈氏，武威贾氏等，甚至还出现了地区化趋势，集中于颍川，最终政权也为和颍川荀氏关系密切的河内司马氏所篡夺。
+
+### 4.4. 三国各自的实力究竟如何
+通过如下cypher命令可以查看三国各集团的人口实力
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+得到的查询结果如下表所示
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+古代社会衡量一个国家实力的重要指标是人口数量，由于人口数据缺失，我们使用三国所有主公和文臣武将的籍贯数据估计每个州的人口数量。发现三国主要人物中，按籍贯有60个属于魏国，有23个属于吴国，仅有2个属于蜀国，证明魏国确实是三国中最强大的国家。
+
+### 4.5. 曹操的军事能力如何评价
+通过如下cypher命令可以查看曹操参与的主要战役
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+从图中可以看出，曹操在三国主要的15场战役中参加了8场，出场率比较高。但是曹操只获胜了徐州之战、兖州之战、官渡之战和襄樊之战，汉中之战、宛城之战、群雄讨董和赤壁之战都失败了，综合胜率50%，证明曹操并不算一个非常优秀的军事家。
+
+## 5. 备注
+更多的分析有待大家积极补充和尝试！
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..976b97e0ac
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Round The World Demo
+
+> 此文档主要介绍了基于tugraph-db开发的环球旅行（Round The World）demo
+
+## 简介
+
+基于"80天环游世界"的虚拟背景，基于部分公开历史航班数据，帮助用户设计多个城市的最优航班规划。
+- demo设计了自定义网站服务
+- 数据来源为国外某开源网站，不包含大陆城市航班数据
+- 数据中航班价格为模拟数据，不代表真实价格
+
+## 示例
+
+### 登录页面
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### 查询页面
+
+在登录页面点击后进入查询页面
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### 查询示例
+
+在左下角的城市列表中选择不超过8个城市，点击查询可返回推荐的航班规划，在满足前后航班间隔在2-6小时的要求下，返回费用最低和飞行时间最短的10条路径规划。
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+详细使用说明见[manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "")文档。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..4a29f62826
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo示例
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..e630bd12bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+快速上手
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..2cfd4197a9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,685 @@
+# 可视化操作手册
+
+> 此文档主要介绍 TuGraph Browser 的使用和操作方法。
+
+## 1.简介
+
+TuGraph Browser（以下简称Browser）是一款功能强大的产品可视化开发工具，它以直观的可视化方式呈现图数据，使用户可以轻松地管理、维护和查看数据库运行状态。此工具不仅支持图数据的管理和可视化，还支持对系统账户的管理，为用户提供了全面的操作和管理体验，让用户能够更加高效地管理和利用图数据库。
+
+## 2.操作指南
+
+### 2.1.访问
+
+当用户完成图数据库的安装后，可以通过浏览器访问Browser。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 8000。
+
+- 例如：127.0.0.1:8000
+- 推荐使用Chrome
+
+#### 2.1.1.启动配置
+
+在启动Browser之前，需要提前启动TuGraph-Server并配置好Browser与TuGraph-Server连接，配置文件在Browser目录下的env.json文件，具体配置如下所示
+```shell
+# vim /usr/local/share/lgraph/tugraph-db-browser/env.json
+{
+  "tugraph_db_host": "http://127.0.0.1:9090"
+}
+```
+需要把tugraph_db_host修改为实际TuGraph-Server RPC服务的地址
+
+#### 2.1.2.启动方式
+Browser的启动方式分为两种，一种是在docker image中，直接切到Browser所在目录，执行启动命令即可
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run dev
+```
+另一种是在本地环境中使用rpm/deb安装包，此时需要先构建后启动，因此需要在本地提前安装Node环境，具体详见源码目录下的
+ci/images/tugraph-runtime-*-Dockerfile。在本地安装TuGraph时，
+Browser会安装到本地的指定目录，切到该目录，执行如下命令即可构建并启动
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run bootstrap
+pnpm run dev
+```
+
+### 2.2.登录
+
+![login](../../../images/browser/login.png)
+
+- 浏览器成功访问Browser后，首先进入的是登录页面（如上图所示），用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 用户首次登录后，会跳转至修改密码页面，密码修改成功后，使用新密码重新登录方可使用。
+
+### 2.3.快速上手
+
+对于首次使用TuGraph的用户，可以通过产品内置的demo数据快速构建一个图项目，快速上手图数据项目。
+
+#### 2.3.1.创建图项目
+
+在`图项目`首页的选项卡中，点击`新建图项目`创建新的图项目。
+
+![快速上手-新建图项目](../../../images/browser/quickstart-creategraph.png)
+
+选择一个产品内置的demo数据，点击`下一步`按钮。
+
+![快速上手-选择一个demo](../../../images/browser/quickstart-selectdemo.png)
+
+在`填写配置`界面输入图项目信息，demo数据量都相对较小，`最大存储空间`设置为1G即可。输入完图项目信息后，点击`创建`按钮后，系统会自动创建demo数据的图模型、导入图数据。
+
+![快速上手-填写配置](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.开始图项目
+
+demo数据的图项目创建完成后，可以在`图项目`的选项卡中找到相应的图项目，可以点击`图查询`查询图数据。
+
+![快速上手-图项目选项卡](../../../images/browser/quickstart-graphtab.png)
+
+执行默认的查询语句，浏览demo里的图数据。
+
+![快速上手-验证结果](../../../images/browser/quickstart-result.png)
+
+更多快速上手文档请浏览[快速上手文档](../3.quick-start/1.preparation.md)
+
+### 2.4.图项目
+
+`图项目`提供可视化的图项目管理和图数据研发功能，它为用户提供了一系列便捷的图数据可视化操作，包括图项目的创建、修改、删除等管理操作，以及图数据的查询、点边统计等操作。此外，它也支持图模型的管理，使用户可以更加方便地进行图数据的管理和维护。
+
+#### 2.4.1.图项目管理
+
+在`图项目`界面，可以看到当前图数据库中的图项目。
+
+![图项目-首页](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.新建图项目
+
+在`图项目`界面，点击`新建图项目`按钮创建一个新的图项目。
+
+![图项目-新建图项目按钮](../../../images/browser/graphmanagement-creategraph.png)
+
+新建图项目需要通过`选择模板`和`填写配置`两个页面完成图项目的创建。
+
+- __选择模板__：产品提供空模板和demo模板两类模板。
+    - 空模板：全新的图项目，用户需要自己创建图模型和导入图数据，一般用于正式项目开发。
+    - demo模板：产品内置的demo数据，图项目创建成功后，系统会自动创建demo图模型并导入demo图数据，一般用于试用和学习。
+
+![图项目-选择模板](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __填写配置__：用户需要填写图项目基本信息，并点击`创建`按钮创建图项目。
+    - 图名称：新建图项目的名称，同时作为该图项目的唯一主键。支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+    - 图描述：新建图项目的描述，可用于详细说明该项目的背景和目标。
+    - 高级配置-最大存储空间：设置图项目最大可占用的存储空间，实际并不会提前占用物理存储空间，实际数据量达到最大存储空间阈值后不可再写入数据。
+
+![图项目-填写配置](../../../images/browser/graphmanagement-configure.png)
+
+创建成功后，可在`图项目`页面的图项目选项卡中查看。
+
+##### 2.4.1.2.编辑图项目
+
+在`图项目`界面，点击图项目选项卡中的`编辑`按钮（笔形图标），编辑对应图项目的基础信息。
+
+![图项目-编辑图项目按钮](../../../images/browser/graphmanagement-editgraph-button.png)
+
+编辑图项目功能可以修改`图名称`和`图描述`。
+
+![图项目-编辑图项目](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.删除图项目
+
+在`图项目`界面，点击图项目选项卡中的`删除`按钮（垃圾桶图标），删除对应的图项目。
+
+![图项目-删除图项目按钮](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_需要注意：图项目删除后无法恢复_。
+
+##### 2.4.1.4.点边统计
+
+在`图项目`界面，点击图项目选项卡中的`点边统计`按钮（折线图标或刷新图标），统计对应图项目的点边数量。
+
+![图项目-点边统计按钮](../../../images/browser/graphmanagement-statistics-button.png)
+
+统计结果将展示展示图项目选项卡上，未进行过点边统计的图项目会显示`暂无点边数据`，已经统计过点边数据的图项目再次统计需要点击`刷新`按钮。
+
+![图项目-点边统计](../../../images/browser/graphmanagement-statistics.png)
+
+![图项目-刷新点边统计按钮](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.图构建
+
+Browser的`图构建`功能主要用于图项目的模型定义和数据导入。在`图项目`页面中，点击图项目选项卡中的`图构建`按钮。
+
+![图构建-按钮](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.模型定义
+
+Browser提供可视化的方式创建和维护图模型。
+
+- 也可用通过`cypher`工具和`lgraph_import`工具创建和维护图模型，详见[Cypher API](../8.query/1.cypher.md)和[数据导入](../6.utility-tools/1.data-import.md)文档。
+
+###### a.浏览图模型
+
+在`模型定义`界面可以查看详细的图模型设置，支持列表和画布方式查看图模型，支持列表展示点类型的属性和索引、边类型的属性和起点/终点类型。
+
+![图构建-浏览图模型](../../../images/browser/graphbuild.png)
+
+- 支持列表查看点类型和边类型。
+    - 支持点类型和边类型的个数展示，在点类型或边类型页签中展示对应的点或边数量。
+    - 支持点类型和边类型的名称关键字搜索，在`搜索框`输入关键字可展示对应的点或边。
+
+        ![图构建-浏览图模型-搜索](../../../images/browser/graphbuild-list-search.png)
+    - 支持点类型和边类型的名称复制，点击`复制`按钮可以复制点或边的名称至粘贴板。
+
+        ![图构建-浏览图模型-复制](../../../images/browser/graphbuild-list-copy.png)
+    - 支持点类型和边类型的删除，点击`删除`按钮可以删除对应的点或边。
+
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-list-delete.png)
+- 支持画布方式查看点类型和边类型。
+- 在列表或画布中点击相应的点类型或边类型，可以展示模型详情。
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-select.png)
+
+###### b.添加点
+
+在`模型定义`界面点击`添加点`按钮，在右侧滑动窗口中添加点类型。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex-button.png)
+
+用户需要输入点类型名称、属性和索引，点击`完成`按钮完成点类型的创建。
+- 点类型名称：点的名称，也是该点的唯一标识。
+- 属性：点的属性，需要一个属性作为主键。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建点时可以任意删除属性。
+- 索引：点的索引属性，需要先创建属性再设置该属性为索引，索引创建成功后无法修改。
+    - 属性：需要配置索引的属性。
+    - 唯一：设置该属性字段为唯一值。
+    - 主键：对应属性是否为主键，选择`是`后`唯一`选项必须为`是`。
+    - 删除：在创建点时可以任意删除索引。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex.png)
+
+- 编辑点：可以增加点的属性和修改已有属性的数据类型，新增或删除索引。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+_注：主键字段的属性创建后无修改_
+
+![图构建-编辑点](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.添加边
+
+在`模型定义`界面点击`添加边`按钮，在右侧滑动窗口中添加边类型。
+
+![图构建-添加边按钮](../../../images/browser/graphbuild-addedge-button.png)
+
+用户需要输入边类型名称、属性、选择起点类型和终点类型，点击`完成`按钮完成边类型的创建。
+- 边类型名称：边的名称，也是该边的唯一标识。
+- 属性：边的属性，边上可以没有属性。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建边时可以任意删除属性。
+- 选择起点类型和终点类型：设置边的起点点类型和终点点类型，支持多个起点类型和终点类型。
+    - 起点：选择起点的点类型。
+    - 终点：选择终点的点类型。
+    - 需要提前创建至少一个点类型才能设置边的起点类型和终点。
+    - 如果不选择则表示起点和终点可以为任意点类型，同时画布上不展示对应的边，需要在左侧列表查看边类型。
+
+![图构建-添加边](../../../images/browser/graphbuild-addedge.png)
+
+- 编辑边：可以增加边的属性和修改已有属性的数据类型。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+
+![图构建-编辑边](../../../images/browser/graphbuild-editedge.png)
+
+###### d.导入模型
+
+在`模型定义`界面点击`导入模型`按钮，可以上传模型文件快速创建模型。
+
+![图构建-导入模型按钮](../../../images/browser/graphbuild-importmodel-button.png)
+
+在`导入模型`界面点击`上传文件`按钮，上传模型文件成功后，点击确定可以导入图模型。
+
+- 覆盖当前画布中的模型：选中该选项，导入时会先清空已有图模型再导入模型文件中的图模型；不选择，会导入模型文件中新增的点类型和边类型，但不会修改已有的点类型和边类型。
+
+![图构建-导入模型](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.导出模型
+
+在`模型定义`界面点击`导出模型`按钮，可以将当前图项目中的图模型导出成json文件。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel-button.png)
+
+模型文件为json格式，不建议手动修改。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.数据导入
+
+完成`模型定义`之后，点击`下一步`按钮进入数据导入页面。
+
+###### a.数据准备
+
+在数据导入前需要提前准备数据，当前Browser支持CSV文件的上传，需要保证数据文件后缀为csv。
+- 不强制要求包含表头。
+- 支持文本限定符，文本限定符为双引号。
+
+![数据导入-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.上传文件
+
+在`数据导入`页面上传需要导入的数据文件，将数据导入到图项目中。
+
+![数据导入-上传文件](../../../images/browser/graphbuild-import.png)
+
+- 分隔符：数据文件的列分隔符。
+- 文件上传：支持上传多个文件。
+    - 支持弹窗中选择多个上传文件。
+    - 支持将文件拖拽至页面中上传。
+    - 支持同时上传点文件和边文件。
+
+###### c.数据映射
+
+文件上传成功后，需要在`数据导入`页面设置`数据对应表`，将数据文件中的数据列和目标点/边、对应属性建立映射关系。
+
+- 数据对应表：展示已经上传的数据问题。
+    - 文件名称：上传的数据文件名称。
+    - 文件大小：上传的数据文件大小。
+    - 读取结果：数据文件上传结果，success为读取成功。
+    - 删除：在页面中删除，不会删除本地文件。
+- 数据文件映射：每个已上传的数据文件都需要配置映射关系。
+    - 标签：选择该文件对应的点或边类型，只能选择一类点或一类边。
+    - 从第N行，开始：从第N行开始读取数据，系统默认从第0行开始读取数据，如需跳过表头可输入1。
+    - 属性映射：下拉选择数据列对应的属性字段。
+    - 数据预览：系统会预读数据文件的前5行。
+
+![数据导入-数据映射](../../../images/browser/graphbuild-import-datamapping.png)
+
+文件上传成功后，可以点击`继续导入`按钮继续导入其他数据，或者点击`前往图查询`按钮在`图查询`页面查询已导入的数据。
+
+![数据导入-导入成功](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.图查询
+
+在`图项目`界面点击图项目选项卡中的`图查询`按钮，可以查询和访问图项目中的图数据，产品提供`语句查询`、`路径查询`、`点查询`等多种模式查询图数据，支持切换图项目和查询结果展示。
+
+![图查询-按钮](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.切换图项目
+
+`图查询`功能只能访问一个图项目数据，用户可以在`切换图项目`下拉框中选择并切换至其他图数据。
+
+![图查询-切换图项目](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.语句查询
+
+Browser提供可视化方式开发和调试图查询语句，用户可以输入图查询语句、执行并返回结果，支持收藏语句和查看图模型。
+
+![图查询-语句查询](../../../images/browser/query-view.png)
+
+###### a.语句查询窗口
+
+用户在`语句查询窗口`输入图查询语句，点击`执行`按钮可以运行对应语句，并在`执行结果页签`展示结果。
+
+- 切换查询语言：提供不同图查询语言模式的切换。_当前只支持Cypher语法_
+
+![图查询-切换语言](../../../images/browser/query-selectgql.png)
+
+- 语句查询窗口：提供当前查询语言的语法提示。
+
+![图查询-语法提示](../../../images/browser/query-gqltips.png)
+
+- 执行：点击`执行`按钮，发送输入的查询语句至后台运行。
+
+![图查询-执行按钮](../../../images/browser/query-execute-button.png)
+
+- 收藏：点击`收藏`按钮，将当前语句查询窗口的内容保存成模板，以便下次使用。
+
+![图查询-收藏按钮](../../../images/browser/query-bookmark-button.png)
+
+- 下载：点击`下载`按钮，将当前语句查询窗口的内容保存成文本文件并下载至本地，以便下次使用。
+
+![图查询-下载按钮](../../../images/browser/query-download-button.png)
+
+详细Cypher使用指南请参考文档：[Cypher API](../8.query/1.cypher.md)
+
+###### b.收藏列表
+
+以列表方式展示已经收藏的查询语句，点击列表中的收藏模板可以使用其中的语句。支持关键字搜索、名称修改以及删除。
+
+![图查询-语句收藏](../../../images/browser/query-bookmark.png)
+
+###### c.查看图模型
+
+Browser提供当前图项目中的图模型查询，方便用户查询有些点类型和边类型，支持列表展示和画布图谱展示方式，支持隐藏查看图模型窗口。
+
+![图查询-图模型列表](../../../images/browser/query-schema-list.png)
+![图查询-图模型图谱](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.路径查询
+
+Browser提供`路径查询`模板，用户可以通过选择路径的方式，查找图项目中的图数据是否存在相应的路径。
+
+![路径查询](../../../images/browser/pathquery-result.png)
+
+- 路径：在路径选择下拉框内选择需要查找的路径。
+    - 选择路径：根据图模型的定义，系统会自动匹配出对应的一度关系路径；再次点击路径下拉框会，系统会根据路径终点的点类型自动匹配下一度关系路径。
+![路径查询-选择路径](../../../images/browser/pathquery-select.png)
+    - 执行：点击`执行`按钮返回图项目中匹配的路径。
+    - 高级配置：设置扫描的路径数目，默认为100条路径。
+![路径查询-高级配置](../../../images/browser/pathquery-configuration.png)
+
+_注：需要图模型中的边设置起点和终点，如果图项目中的边均未设置起点和终点，下拉选项无结果_
+
+##### 2.4.3.4.点查询
+
+Browser提供`点查询`模板，用户可以通过选择点属性进行查询，查找图项目中的点数据。
+
+![点查询](../../../images/browser/vertexquery.png)
+
+- 选择点：选择需要查询的点类型。
+    - 属性：系统会自动匹配点类型的schema，设置相应的查询条件，点击执行按钮返回结果。
+- 返回节点数目：设置返回点数据的上限。
+
+![点查询-条件](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.执行结果页签
+
+Browser提供JSON视图、JSON文本、点边列表、点边视图等多种方式展示图查询结果，支持结果下载、插入数据、全屏展示。
+
+###### a.JSON视图
+
+Browser提供以JSON视图方式展示查询结果。
+
+![JSON视图](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON文本
+
+![JSON文本](../../../images/browser/query-result-jsontxt.png)
+
+###### c.点边列表
+
+Browser提供以点和边列表方式展示查询结果。
+
+![点边列表](../../../images/browser/query-result-list.png)
+
+###### d.点边视图
+
+Browser提供以画布方式展示查询结果。
+
+![点边视图](../../../images/browser/query-result-graph.png)
+
+###### e.插入数据
+
+Browser提供可视化方式在对应图项目中插入点或边数据。点击`插入数据`按钮，在`插入数据`页签选择点类型或边类型，输入属性值，点击确定完成数据插入。
+
+![插入数据-按钮](../../../images/browser/query-result-insert-button.png)
+
+![插入数据](../../../images/browser/query-result-insert.png)
+
+###### f.下载执行结果
+
+Browser提供图查询结果导出成文本文件功能。点击`下载执行结果`按钮，系统会自动将结果保存成文本文件并下载至本地。
+
+![下载执行结果-按钮](../../../images/browser/query-result-download.png)
+![下载执行结果-按钮](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.全屏展示
+
+Browser提供全屏方式展示图查询结果，点击`全屏显示`按钮全屏展示结果，点击`退出全屏`按钮退出全屏展示。
+
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-button.png)
+![全屏展示](../../../images/browser/query-result-fullscreen.png)
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.图分析
+
+在`图项目`界面点击图项目选项卡中的`图分析`按钮，可以在画布中展示和分析图数据，产品提供`语句查询`和`配置查询`将图项目中的数据查询并加载至画布，支持画布数据的筛选、布局样式调整以及画布操作。
+
+![图分析-按钮](../../../images/browser/graphanalysis-button.png)
+
+如下图所示，图分析功能主要包括：1、操作栏：图分析主要操作功能，包括视图切换、查询过滤、布局样式以及画布操作；2、左边栏：查询、筛选、外观功能操作区域；3、画布区域：展示图数据的区域，展示点和边数据，支持点扩展查询、收起节点、固定节点、删除节点，提供画布图数据统计等功能；4：右边栏：选中一个点数据或边数据后，会展示对应的属性信息；5、切换图项目：切换不同的图项目进行分析。
+
+![图分析-操作区域](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.语句查询
+
+在`语句查询`功能中，用户可以输入查询语句来查询图数据，并加载数据至画布区域进行展示。
+- 语法说明：TuGraph的查询语言及语法说明文档。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-语句查询](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.模板查询
+
+在`模板查询`功能中，用户可以选择节点类型和输入属性条件来查询图数据，并加载数据至画布区域进行展示。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-模板查询](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.画布分析
+
+在`画布分析`功能中，用户可以对画布中的节点或边数据进行操作和分析，主要包括：选中节点进行扩展查询、收起/展开节点、固定节点，清空画布，套索，点/边检索，画布图例等。画布上的最基础操作是拖拽点数据，鼠标左键选住一个节点并移动鼠标，可以完成点数据位置的移动。
+
+###### a.扩展查询
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，鼠标移至`扩展查询`处弹出二级悬窗，点击对应的扩展度数进行查询。
+- 一度查询：双向扩展一度关系。
+- 二度查询：双向扩展二度关系。
+- 三度查询：双向扩展三度关系。
+- 自定义查询：根据选择的条件进行扩展。
+    -边的方向：设置扩展关系的方向，双向：包含出边和入边，出边：选中起点向外指向的边，入边：指向选中起点的边。
+    -扩散度数：扩展的度数。
+    -自定义返回节点数量：配置返回至前端的节点数量，默认为100，防止遇到超级节点导致前端异常的情况。
+    -添加筛选组：设置扩展的关系类型和关系的属性条件，可以设置多组关系类型。
+
+![图分析-画布分析-扩展查询-按钮](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![图分析-画布分析-扩展查询-查询后](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![图分析-画布分析-扩展查询-自定义查询](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.收起/展开节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`收起节点`会隐藏所选节点的一度关系节点；再次右键已`收起节点`的点数据可以进行`展开节点`操作，展示已隐藏的一度关系节点。
+
+![图分析-画布分析-收起节点](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![图分析-画布分析-展开节点](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.固定节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`固定节点`会将所选节点固定在原处，固定后的节点不可移动（包括重新布局）；再次右键已`固定节点`的点数据可以进行`解除固定`操作，恢复所选节点的正常操作。
+
+![图分析-画布分析-固定节点](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![图分析-画布分析-解除固定](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.删除节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`删除节点`会将所选节点移出画布。
+
+![图分析-画布分析-删除节点](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.清空画布
+
+在`操作栏`区域点击`清空画布`按钮，会清除所有画布中的数据。
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.点/边检索
+
+在`点/边检索`窗口选择点或边，并输入关键字，会模糊检索画布中的属性数据，检索后可定位至数据位置。
+
+![图分析-画布分析-检索](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.画布图例
+
+在`画布`区域的图例位置，会展示画布中的点类型，点击点类型可以选中对应的点数据，点击更多按钮可以展示统计情况，支持列表或图表方式展示点或边的数量。
+
+![图分析-画布分析-列表](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![图分析-画布分析-图表](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.属性筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`属性筛选`进行筛选过滤。用户可以选择要筛选的点或边类型，以及对应的属性值进行设置，检索到筛选组条件的数据后会在画布上高亮选中对应的点或边数据。
+- 请选择点/边类型：选择需要检索的点类型或边类型。
+- 属性条件：设置需要检索的属性条件，可以设置多组，取并集筛选结果。
+- 添加筛选组：可以多组筛选条件，取并集筛选结果。
+- 重置：可以清空筛选条件。
+
+![图分析-筛选-属性筛选](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.统计筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`统计筛选`进行画布数据统计。用户可以选择要统计的点或边类型，以及对应的属性值进行设置，系统会自动根据用户选择的点/边类型和属性进行分组统计，支持按照图表和列表两种方式展示结果，同时点击图表或列表区域的数值可以高亮选中画布中的数据。
+
+![图分析-筛选-统计筛选](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![图分析-统计筛选-图表切换](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.布局样式
+
+在`操作栏`区域点击`布局`按钮，选择对应的布局方式会将画布中的数据进行重新排布，支持力导向布局、同心圆布局、圆形布局、辐射布局、Dagre布局以及网格布局，每种布局方式均有不同布局参数，调整参数后画布中的数据会进行重新排布。
+
+![图分析-布局样式-按钮](../../../images/browser/graphanalysis-style-layout-button.png)
+![图分析-布局样式-布局参数](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+详细布局参数可参考[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide)。
+
+##### 2.4.4.6.外观样式
+
+在`操作栏`区域点击`外观`按钮，在`左边栏`点击`点样式`或`边样式`进行外观样式配置。
+- 点样式
+    - 应用点类型：设置对应点类型的展示样式，支持同时配置多个点类型外观。
+    - 大小：对应点类型的展示大小。
+    - 颜色：对应点类型的展示颜色。
+    - 图标：对应点类型的图标样式。
+    - 显示文本：对应点类型显示的文本内容，默认为id。
+    - 高级配置：根据设置的条件标记对应的点数据。
+- 边样式
+    - 应用边类型：设置对应边类型的展示样式，支持同时配置多个边类型外观。
+    - 颜色：对应点类型的展示颜色。
+    - 边宽：对应边类型的展示宽度。
+    - 显示文本：对应边类型显示的文本内容，默认不显示。
+    - 高级配置：根据设置的条件按颜色展示对应的边数据。
+
+![图分析-外观](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.控制台
+
+`控制台`提供可视化的的账户管理和数据库信息查看功能，它为用户提供了全面的账户和角色管理功能，包括账户的增删改查以及禁用，角色的增删改查以及禁用。此外，它也为用户提供了便捷的数据库信息查看功能，让用户可以轻松地查看图数据库的基础信息和配置信息。其中，基础信息主要包括版本号、运行时间、CPP编译版本号等，而数据库配置信息则包括端口号、系统功能参数配置等。
+
+#### 2.5.1.账户管理
+
+##### 2.5.1.1.账户管理
+
+###### a.添加账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户需要输入账户名称、账户描述、账户密码以及相关角色。
+
+![账户管理-添加账户按钮](../../../images/browser/account-add-button.png)
+
+- 账户名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 相关角色：新建账户时必须要选择一个角色，在账户添加成功后，系统会自动生成一个与账户名称一样的角色。
+
+![账户管理-添加账户](../../../images/browser/account-add.png)
+
+###### b.编辑账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户可以编辑账户描述、账户密码以及相关角色。
+
+![账户管理-编辑账户](../../../images/browser/account-edit.png)
+
+###### c.禁用账户
+
+在`账户管理`界面点击`禁用`按钮禁止对应的账户登录和访问，点击`启用`按钮开启对应的账户登录和访问权限。
+
+![账户管理-禁用](../../../images/browser/account-disable.png)
+![账户管理-启用](../../../images/browser/account-enable.png)
+
+###### d.删除账户
+
+在`账户管理`界面点击`删除`按钮删除对应的账户。
+
+![账户管理-删除](../../../images/browser/account-delete.png)
+
+##### 2.5.1.2.角色管理
+
+###### a.添加角色
+
+在`角色管理`界面点击`添加`按钮创建新的角色，用户需要输入角色名称、角色描述以及图权限。
+
+![角色管理-添加角色按钮](../../../images/browser/role-add-button.png)
+
+- 角色名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 图权限：browser支持全部、读、写和无共四类图权限配置。
+    - 全部：对应图的读和写权限，包含编辑图模型权限（schema）。
+    - 读写：对应图的写权限，不包含编辑图模型权限（schema）。
+    - 只读：对应图的读权限。
+    - 无：无法访问和操作对应图。
+- 角色冲突：当两个角色对同一个图有不同图权限，同时对一个账户授权了这两个角色，该账户对该图的图权限为两个角色的并集。
+
+![角色管理-添加角色](../../../images/browser/role-add.png)
+
+###### b.编辑角色
+
+在`角色管理`界面点击`编辑`按钮编辑已有角色，用户可以编辑角色描述以及图权限。
+
+![角色管理-编辑角色](../../../images/browser/role-edit.png)
+
+###### c.禁用角色
+
+在`角色管理`界面点击`禁用`按钮禁止对应的角色，点击`启用`按钮开启对应的角色。禁用角色后，对应角色图访问权限失效。
+
+- 禁用角色：禁用之后，对应角色图访问权限失效。
+    - 当一个用户拥有两个角色对同一个图有操作权限时，当禁用其中一个角色时，另一个角色权限同样有效。
+
+![角色管理-禁用](../../../images/browser/role-disable.png)
+![角色管理-启用](../../../images/browser/role-enable.png)
+
+###### d.删除角色
+
+在`角色管理`界面点击`删除`按钮删除对应的角色。
+
+![角色管理-删除](../../../images/browser/role-delete.png)
+
+#### 2.5.2.数据库信息
+
+##### 2.5.2.1.基础信息
+
+`基础信息`获取当前系统运行的状态，并展示关键信息。
+
+![数据库信息-基础信息](../../../images/browser/db_basic.png)
+
+|参数    |含义    |
+|-------|--------|
+|TuGraph版本号|当前TuGraph的版本号，x.x.x|
+|运行时间|TuGraph服务启动到现在的时间|
+|服务器代码版本|tugraph-db仓库的当前commit|
+|前端代码版本|tugraph-web仓库的当前commit|
+|CPP编译器版本号|编译TuGraph时的CPP版本号|
+|Python版本号|编译TuGraph时的Python版本号|
+|CPP编译器ID|编译TuGraph时的CPP类型|
+
+也可以通过命令获取当前系统运行状态。
+
+```
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.数据库配置信息
+
+`数据库配置信息`获取当前系统运行的配置参数，并展示关键信息。调整配置参数或了解详细配置参数请参考[数据库运行-服务配置](../5.installation&running/7.tugraph-running.md)。
+
+![数据库信息-数据库配置信息](../../../images/browser/db_configuration.png)
+
+| 参数                          | 含义                                  |
+|-----------------------------|-------------------------------------|
+| bind_host                   | 系统启动时设置的host，一般为0.0.0.0             |
+| disable_auth                | 是否关闭token认证的定期更新，如为true则token可以永久使用 |
+| durable                     | 是否开启存储底层持久化，如为false，数据异步更新到磁盘       |
+| enable_audit_log            | 是否开启审计日志                            |
+| enable_backup_log           | 是否开启实时增量备份                          |
+| enable_fulltext_index       | 是否开启全文索引                            |
+| enable_ip_check             | 是否开启IP白名单                           |
+| enable_rpc                  | 是否开启RPC端口                           |
+| enable_ssl                  | 是否开启ssl加密传输                         |
+| optimistic_txn              | 是否开启乐观多线程写入事务                       |
+| port                        | 当前系统的REST访问端口                       |
+| rpc_port                    | RPC 及 HA 服务所用端口                     |
+| subprocess_max_idle_seconds | 自进程最大空闲时间，线程池参数                     |
+| thread_limit                | 服务端同时使用的最大线程数                       |
+| verbose                     | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。  |
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..0815c0865d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# 可视化操作手册（旧版）
+
+> 此文档主要介绍 TuGraph Browser 的使用
+
+## 定义
+
+TuGraph Browser 是 TuGraph 提供的可视化开发工具。
+
+## 作用
+
+TuGraph Browser 的主要功能是为使用图数据库的开发人员，提供可视化的图数据开发，图数据管理和维护等功能。
+
+## 操作详情
+
+### 1.连接数据库
+
+当用户完成图数据库的安装后，可以通过浏览器进行访问，TuGraph Browser 工具。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7090。
+
+### 2.登录数据库
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- 页面打开成功会，首先进图的是登录页面，用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 3.工作台
+
+#### 3.1 快速上手
+
+- 首次登录，系统会默认创建 default 空图
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- 用户点击帮助选项，并选择快速上手
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- 然后点击“一键创建模型”——>"一键创建数据"，就可以完成内置的 Movie 数据图谱的构建
+
+#### 3.2 创建子图和示例
+
+##### 3.2.1 创建子图
+
+- 点击新建子图
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- 填写表单信息
+  ![alt 填写表单](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+  - 子图名称
+  - 子图描述
+  - 配置信息
+  - 点击确认，提示创建成功
+- 切换子图
+  ![alt 切换子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- 点击新建示例
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- 选择示例并点击创建
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 查询
+
+![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 页面组成
+
+- cypher 输入框
+- 结果集展示区域
+
+##### 3.3.2 结果集展示区域功能详情
+
+- 结果集标签展示及功能
+  ![alt 结果集标签](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+  - 这里展示了结果集的所有类型统计
+  - 点击不同的“label（标签）”，可以进行以下修改操作
+    - 修改展示颜色
+    - 修改节点大小或边的粗细
+    - 修改默认展示属性或系统属性
+    - 布局修改
+      - 力导布局
+      - 网格布局
+      - 树形布局
+      - 环境布局
+    - 边聚合
+      - 相同类型，方向的边可以进行合并
+    - 创建节点
+      - 点击创建节点按钮
+      - 选择节点类型
+      - 添写节点内容
+    - 创建关系
+      - 在画布中选择起点和终点
+      - 选择可以匹配的类型
+      - 填写节点信息
+    - 停止布局
+      - 当数据量过大，导致浏览器页面卡顿时候，可以点击这个停止布局的按钮，能够提高体验的流畅度
+    - 鼠标悬停
+      - 开启此功能，可以高亮显示鼠标悬停节点的一度邻居节点
+    - 结果集导出
+      - 可以将结果集导出为 png，json，csv 三种不同的文件形式
+    - 刷新
+      - 点击刷新按钮，会重新执行当前页面的初始 cypher 语句，并刷新结果集
+    - 最大化
+      - 点击最大化，结果集展示区域将全屏展示
+    - 结果集展示形式切换
+      - 支持图谱、表格、文本三种形式
+
+##### 3.3.3 建模
+
+- 点边模型
+  ![alt 建模](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- 点边模型支持实时的、增、删、改、查
+
+- 点边模型支持导入和导出
+
+##### 3.3.4 数据导入
+
+- 本地数据导入
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+  - 选择文件编码格式
+  - 选择本地 CSV 文件
+  - 选择对应的节点或边的模型
+  - 进行数据映射
+  - 完成数据导入
+  - 单个文件最大支持2GB
+
+##### 3.3.5 插件
+
+- 存储过程的使用
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+  - 用户可以上传本地编写的 Plugin 程序，并在可视化页面进行执行，并查看执行结果
+  - 用户可以在可视化对插件进行、卸载、执行、下载等操作
+
+##### 3.3.6 帮助
+
+- 其中记录了 TuGraph-browser 的使用方式
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 控制台
+
+##### 3.4.1 数据库基础信息
+
+- 展示数据库相关的基础配置信息
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 权限管理
+
+- 用来创建用户和角色的功能模块，用户可以在这里进行权限的管理操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 实时状态
+
+- 这里展示了数据库实时状态，包括：CPU 使用率、内存用率、磁盘使用率、数据请求次数、磁盘 IO
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 任务管理
+
+- 在这里用户可以看到在正在执行中的任务，可以在此进行停止任务的操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 审计日志
+
+- 这里记录的数据库相关的审计日志，用来排查使用遇到的问题
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..811fbf0563
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+可视化操作指南
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..e2524b4134
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/1.environment.md
@@ -0,0 +1,40 @@
+# 环境准备
+
+> 此文档主要介绍 TuGraph 部署时所需的软硬件环境。
+
+## 1.硬件环境
+
+### 1.1. CPU
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的硬件平台，测试认证过的硬件平台包括 Intel、AMD、Kunpeng、Hygon、飞腾等。
+
+### 1.2. 内存
+
+我们建议内存容量不小于实际的数据大小。如果最求极致的性能，把所有的数据缓存到内存里是最理想的。在数据访问的局部性上，图数据库的局部性要比关系型数据库差，因此如果数据在内存中放不下，通常会频繁地换入换出。
+
+### 1.3. 外存
+我们强烈建议用户使用 NVMe SSD 作为外存，数据库有大量的写操作需要同步的外存，通常为随机写，外存的读写性能很容易成为整体数据库运行的性能瓶颈。因此，高IOPS、低延迟的 NVMe SSD 是最优的选择。
+
+如果现实条件只能使用 SATA接口的SSD，或者云上的网盘，性能虽然会受到影响，但 TuGraph 依然能正确的运行。
+
+外存大小建议为实际数据大小的4倍，比如数据为1TB，则准备4TB的硬盘会比较稳妥。
+
+## 2.软件环境
+
+### 2.1. 操作系统
+
+TuGraph 能够兼容主流操作系统，包括Ubuntu、CentOS、SUSE、银河麒麟、 中标麒麟、UOS等，均通过测试认证。
+
+其中最稳定使用的系统版本是 Ubuntu 18.04、CentOS 7、CentOS 8。
+
+### 2.2. 系统库
+
+编译环境和运行环境对系统库的要求不一样，具体请参考[环境分类](2.environment-mode.md)。
+
+## 3.典型配置推荐
+
+| 硬件      | 最低配置   | 建议配置                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| 内存      | 4GB       | 512GB                    |
+| 外存      | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..3dbbe91ee5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,22 @@
+# 环境分类
+
+> 此文档主要介绍 TuGraph 涉及的三种环境。
+
+## 1.分类
+
+根据环境所承载功能的不同，区分为编译环境，运行环境，以及精简运行环境。
+* 编译环境，具备TuGraph编译的所有依赖库，包含运行环境的所有依赖，并且能够编译TuGraph源码，但不包含预编译好的TuGraph可执行文件和库文件，供开发者编译源码使用。
+* 运行环境，具备GCC/Java/Python环境，能够运行TuGraph的所有功能，并且能承载全文索引，java client，c++源码上传为plugin，以及python plugin的完整功能，内置TuGraph预编译好的可执行文件和库文件，供客户直接安装使用，无需编译源码。
+* 精简运行环境，约等于裸系统加预编译TuGraph，仅能运行TuGraph的基本功能，无C++ plugin编译运行，仅so上传，无全文索引，无python plugin，供快速搭建试用。
+
+TuGraph编译后，会把所有的依赖库以.a的形式打包在一起，因此原则上运行不需要的其他的依赖库。但TuGraph支持存储过程，即在服务端编译C++代码，因此在环境中依然需要涉及的编译器。
+
+## 2.依赖系统库
+
+针对三种环境，除去TuGraph的运行包，所需要的系统库如下：
+* 编译环境，包括gcc、python、java等编译器，也包含antlr4、pybind11等，具体参见tugraph-db源码目录 ci/images/tugraph-compile-*-Dockerfile。
+* 运行环境，主要由存储过程引入，包括gcc、boost、cmake等，具体参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile。
+* 精简运行环境，无，可以参见tugraph-db源码目录 ci/images/ tugraph-mini-runtime-*-Dockerfile。
+
+
+
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..7400804d9b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,101 @@
+# Docker部署
+
+>本文档介绍TuGraph Compile及TuGraph Runtime的Docker镜像的创建、下载。
+
+## 1.简介
+
+- TuGraph Compile Image：提供编译环境，可以用于TuGraph的编译，测试；
+- TuGraph Runtime Image：提供二进制可运行环境，附带TuGraph库和可执行文件；
+- TuGraph Mini Runtime Image: 提供二进制可运行环境，不包含TuGraph中Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+## 2.现有Docker Image
+
+### 2.1.镜像下载方式
+
+镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用。
+
+最新版本的Docker地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+### 2.2.命名规范
+
+#### 2.2.1.TuGraph Compile Image
+
+提供编译环境，可以用于TuGraph的编译。
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+例如： `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+提供二进制可运行环境，附带TuGraph库和可执行文件。
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如：`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+提供二进制可运行环境，不包含TuGraph种Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如： `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.常见Docker操作
+
+Docker由Dockerfile生成，注意创建镜像需要下载依赖，因此网络问题可能会导致创建较慢或者创建失败。注意不要覆盖镜像，除非tag为 `latest`。
+
+创建Compile镜像
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+创建Runtime / Mini Runtine镜像
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+修改镜像名称
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+上传镜像
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+获取镜像
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+导出镜像
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+导入镜像
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+其他Docker操作请参考[docker官方文档](https://docs.docker.com/engine/reference/commandline/cli )
+
+
+### 2.4. M1芯片支持
+
+在 M1 芯片的机器上运行 amd64 容器可能造成未知错误。TuGraph提供 arm64 的镜像供 M1 机器使用。
+包含compile和runtime两种镜像。
+
+在`tugraph-runtime-centos7:3.6.0`与`tugraph-compile-centos7:1.2.7`及之后，`tugraph-runtime-centos7`与`tugraph-compile-centos7`提供linux/amd64和linux/arm64/v8两种架构的镜像，可以在 M1 机器上通过docker pull获取arm64架构镜像。
+
+## 3. 使用和开发TuGraph-DB Docker镜像时的最佳实践
+
+在您刚开始为TuGraph做出贡献时，请仔细阅读以下要点，并遵循它们。
+
+- 为了避免过多的Docker Layer，请尽量像现有的Dockerfile一样单行的写ENV和RUN将您的依赖项添加到Docker中。
+- 对于您需要构建依赖项的软件包/资源，请使用原始的软件包/资源，而不是在没有VCS跟踪的情况下修改这些资源。之后联系TuGraph团队将其上传到OSS以加速构建过程，如同您在Dockerfiles中看到的URL一样。
+- 为了使开发更加高效，最好从Base TuGraph编译镜像添加依赖项开始，完成开发确认依赖没问题后在Dockerfile中重新复制该过程。
+- CI使用了Docker镜像。如果您的CI失败，请检查依赖项问题。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..04125f35c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# 本地包部署
+
+> 此文档主要介绍 TuGraph 的本地包部署。
+
+## 1. 环境准备
+
+TuGraph本地包部署需要对应的环境，快速验证可以使用精简安装包，几乎不需要任何第三方库。
+
+如果您需要使用完整的TuGraph功能，请参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile，该脚本包含完整的环境构建流程。
+
+## 2. 安装包下载
+
+最新版本的安装包地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+也可以访问Github进行下载：[TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. CentOS 下的安装方法
+
+用于在 CentOS 上安装的 TuGraph 的.rpm 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.rpm 安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+用户也可以通过指定`--prefix`选项指定安装目录。
+
+## 4. Ubuntu 下的安装方法
+
+用于在 Ubuntu 上安装的 TuGraph 的.deb 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.deb`安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+该命令默认将 TuGraph 安装于`/usr/local`目录下。用户也可以通过指定 `--instdir=<directory>` 选项更改安装目录。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..7ac7e1cfc0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,125 @@
+# 云部署
+
+> 此文档主要介绍 TuGraph 的云部署，也可参见[阿里云计算巢部署文档]( https://aliyun-computenest.github.io/quickstart-tugraph/ )。
+
+## 1.简介
+
+TuGraph（tugraph.antgroup.com）是蚂蚁集团研发的高性能图数据库（Graph Database）。TuGraph在计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。本文向您介绍如何开通计算巢上的TuGraph社区版服务，以及部署流程和使用说明。
+
+## 2.实例说明
+
+TuGraph部署的为社区开源版本，源码参考Github Repo，目前可以选择的实例规格如下：
+
+| 规格族         | vCPU与内存                 | 系统盘              | 公网带宽      |
+|----------------|-------------------------|-------------------|-----------|
+| ecs.r7a.xlarge | AMD 内存型 r7a，4vCPU 32GiB | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+| ecs.r6.xlarge  | 内存型r6，4vCPU 32GiB       | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+
+预估费用在创建实例时可实时看到（目前为免费）。 如需更多规格、其他服务（如集群高可用性要求、企业级支持服务等），请联系我们 tugraph@service.alipay.com。
+
+## 3.部署流程
+
+### 3.1.准备工作
+
+在正式开始使用前，您需要一个阿里云账号，对ECS、VPC等资源进行访问和创建操作。
+
+- 若您使用个人账号，可以直接创建服务实例
+- 若您使用RAM用户创建服务实例，且是第一次使用阿里云计算巢
+    - 需要在创建服务实例前，对使用的RAM用户的账号添加相应资源的权限。添加RAM权限的详细操作，请参见为 __RAM用户授权__。所需权限如下表所示。
+    - 且需要授权创建关联角色，参考下图，选中 __同意授权并创建关联角色__
+
+| 权限策略名称                    | 备注                                    |
+|---------------------------------|---------------------------------------|
+| AliyunECSFullAccess             | 管理云服务器服务（ECS）的权限             |
+| AliyunVPCFullAccess             | 管理专有网络（VPC）的权限                 |
+| AliyunROSFullAccess             | 管理资源编排服务（ROS）的权限             |
+| AliyunComputeNestUserFullAccess | 管理计算巢服务（ComputeNest）的用户侧权限 |
+| AliyunCloudMonitorFullAccess    | 管理云监控（CloudMonitor）的权限          |
+
+![同意授权并创建关联角色](../../../images/cloud-deployment-1.png)
+
+### 3.2.部署入口
+
+您可以在阿里云计算巢自行搜索，也可以通过下述部署链接快速到达。
+
+[部署链接](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.申请试用
+
+在正式试用前，需要申请试用，按照提示填写信息，在审核通过后就可以创建TuGraph服务。
+
+![申请试用](../../../images/cloud-deployment-2.png)
+
+### 3.4.创建TuGraph服务
+
+#### 3.4.1.参数列表
+
+您在创建服务实例的过程中，需要配置服务实例信息的参数列表，具体如下。
+
+| 参数组               | 参数项   | 示例          | 说明                                                           |
+|--------------------|----------|---------------|--------------------------------------------------------------|
+| 服务实例名称         | N/A      | test          | 实例的名称                                                     |
+| 地域                 | N/A      | 华东1（杭州）   | 选中服务实例的地域，建议就近选中，以获取更好的网络延时。          |
+| 付费类型配置         | 付费类型 | 按量付费      | 免费使用请选用按量付费                                         |
+| 可用区配置           | 部署区域 | 可用区I       | 地域下的不同可用区域，确保实例非空                              |
+| 选择已有基础资源配置 | VPC ID   | vpc-xxx       | 按实际情况，选择专有网络的ID。                                   |
+| 选择已有基础资源配置 | 交换机ID | vsw-xxx       | 按实际情况，选择交换机ID。若找不到交换机, 可尝试切换地域和可用区 |
+| ECS实例配置          | 实例类型 | ecs.r6.xlarge | 当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格                      |
+|ECS实例配置|	实例密码|	**|	设置实例密码。长度8~30个字符，必须包含三项（大写字母、小写字母、数字、 ()`~!@#$%^&*_-+={}[]:;'<>,.?/ 中的特殊符号）。|
+
+#### 3.4.2.具体步骤
+
+创建服务按如下步骤进行，参考下图：
+
+- 创建实例名称，如下图中“test”
+- 选择地域，如下图中“华东1（杭州）”
+
+![创建实例](../../../images/cloud-deployment-3.png)
+
+- 选择实例类型，当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格。如果列表中无机型可选，请尝试选择其他的部署区域
+- 选中机型
+- 配置实例的密码
+- 选择部署区域，如下图中“可用区I”
+
+![选择区域](../../../images/cloud-deployment-4.png)
+
+- 点击下一步，进入订单确认页面
+- 勾选“权限确认”和“服务条款”中的复选框
+- 点击左下角绿色背景的开始免费试用，即可创建服务实例
+
+![确认](../../../images/cloud-deployment-5.png)
+
+### 3.5.启动TuGraph服务
+
+- 查看服务实例：服务实例创建成功后，部署时间大约需要2分钟。部署完成后，页面上可以看到对应的服务实例，如下图
+
+![查看实例](../../../images/cloud-deployment-6.png)
+
+- 点击该服务实例访问TuGraph。进入到对应的服务实例后，可以在页面上获取到web、rpc、ssh共3种使用方式，并且页面上展示了admin用户的密码
+
+![访问方式](../../../images/cloud-deployment-7.png)
+
+- 点击web的链接，即可跳转访问已经部署好的TuGraph Web。建议新手先通过TuGraph Web，快速使用demo上手。
+    - 首先在TuGraph Web的登录页面上，输入默认用户名admin和页面上展示的admin用户的密码进行登录，参考下图
+    - 登录完成后，选择任意一个带有官方图标的图项目，其中内置了demo数据，开启图数据的探索和发现！
+
+![登录](../../../images/cloud-deployment-8.png)
+![创建demo](../../../images/cloud-deployment-9.png)
+
+## 4.常见FAQ
+
+### 问题一：部署区域无可用资源
+
+有时，所选部署区域（如可用区G）没有所选套餐的可用资源，会报错如下图所示
+
+![部署区域错误](../../../images/cloud-deployment-10.png)
+
+__解决办法__：尝试选择其他区域，如可用区I等
+
+### 问题二: 启动后web访问不通
+
+web的启动需要一点点时间，请稍后刷新页面即可。
+
+### 问题三: 登录时的用户名密码不正确
+
+请注意检查，登录时使用的密码应为详情页面展示的密码。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..7a460830fa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/6.compile.md
@@ -0,0 +1,28 @@
+# 从源码编译
+
+> 本文档主要描述 TuGraph 从源码进行编译。
+
+## 1.前置条件
+
+推荐在linux系统下搭建TuGraph。同时docker环境是个不错的选择,如果你想设置一个新的环境，请参考[Dockerfile](3.docker-deployment.md)。
+
+## 2.编译介绍
+
+以下是编译TuGraph的步骤：
+
+1. 如果需要web接口运行`deps/build_deps.sh`，不需要web接口则跳过此步骤
+2. 根据容器系统信息执行`cmake .. -DOURSYSTEM=centos`或者`cmake .. -DOURSYSTEM=ubuntu`，如果需要shell运行lgraph_cypher，加上`-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`，如果在arm机器编译（如M1芯片的Mac中，需要加上` -DENABLE_BUILD_ON_AARCH64=ON`）
+3. `make`
+4. `make package` 或者 `cpack --config CPackConfig.cmake`
+
+示例：`tugraph/tugraph-compile-centos7`Docker环境
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..07d934f2dc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,201 @@
+# 数据库运行
+
+> 本文档主要描述 TuGraph 服务的运行模式、启动、停止和重启的操作,以及 TuGraph 的服务配置参数、配置文件格式和命令行配置参数。
+
+## 1.前置条件
+
+TuGraph 运行的前置条件为 TuGraph 正确安装，参考[安装流程](1.environment.md)。
+
+TuGraph 运行需要保证库文件 liblgraph.so 的文件位置在环境变量 LD_LIBRARY_PATH。
+
+运行 TuGraph 进程的用户不需要超级权限，但需要对配置文件（一般为lgraph.json）及文件中涉及的文件有读权限，并且对数据文件夹、日志文件夹等有写权限。
+
+## 2.运行模式
+
+TuGraph 可以作为前台普通进程启动，也可以作为后台守护进程启动。
+当作为普通进程运行时，TuGraph 可以直接将日志打印到终端，这在调试服务器配置时非常方便。但是，由于前台进程在终端退出后被终止，因此用户须确保在 TuGraph 服务器处于运行状态时，终端保持打开状态。另一方面，在守护进程模式下，即使启动它的终端退出，TuGraph 服务器也可以继续运行。因此，在长时间运行的服务器下推荐以守护进程模式启动 TuGraph 服务器。
+
+### 2.1.运行普通进程
+
+`lgraph_server -d run`命令可以将 TuGraph 作为普通进程运行。普通进程依赖命令行终端，因此终端结束时，TuGraph 进程也会自动终止。普通进程模式配合`--log_dir ""`可以将进程日志直接输出到终端，因此更方便调试。注：当不使用`-d run`命令时，将默认运行普通进程。
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d run -c lgraph_standalone.json --log_dir ""
+```
+或者：
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+普通模式的运行输出示例：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+普通进程模式下，用户可以通过按 `CTRL+C` 来提前终止 TuGraph 进程。
+
+### 2.2.运行进程守护模式
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+守护模式的运行输出示例：
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+## 3.服务操作
+
+### 3.1.启动服务
+
+TuGraph 需要通过 `lgraph_server -d start` 命令行启动，启动命令示例如下：
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+### 3.2.停止服务
+
+用户可以使用`kill`命令以及`lgraph_server -d stop`命令停止 TuGraph 守护进程。由于可能在同一台计算机上运行多个 TuGraph 服务器进程，因此我们使用`.pid`文件区分不同的服务器进程，该文件写入启动该进程的工作目录。因此，需要在相同工作目录中运行`lgraph_server-d stop`命令，以停止正确的服务器进程。
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.重启服务
+
+用户也可以通过`lgraph_server -d restart`来重启 TuGraph 服务：
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.服务配置
+
+TuGraph 服务器在启动时从配置文件和命令行选项加载配置，如果在配置文件和命令行中同一选项指定了不同的值，将优先使用命令行中指定的值。
+
+### 4.1.配置参数
+
+具体参数及其类型描述如下：
+
+| **参数名**                      | **<nobr>参数类型</nobr>** | **参数说明**                                                                                                                                                                          |
+|------------------------------|-----------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                    | 字符串                   | 数据文件所在目录。如果目录不存在 ，则自动创建。默认目录为 /var/lib/lgraph/data。                                                                                                                               |
+| durable                      | 布尔值                   | 是否开启实时持久化。关闭持久化可以减少写入时的磁盘 IO 开销，但是在机器断电等极端情况下可能丢失数据。默认值为 `true`。                                                                                                                  |
+| host                         | 字符串                   | REST 服务器监听时使用的地址，一般为服务器的 IP 地址。默认地址为 0.0.0.0。注：在HA模式下，host需要设置为对应服务器的IP地址，不能设置为0.0.0.0。                                                                                           |
+| port                         | 整型                    | REST 服务器监听时使用的端口。默认端口为 7070。                                                                                                                                                      |
+| enable_rpc                   | 布尔值                   | 是否使用 RPC 服务。默认值为 false。                                                                                                                                                           |
+| rpc_port                     | 整型                    | RPC 及 HA 服务所用端口。默认端口为 9090。                                                                                                                                                       |
+| enable_ha                    | 布尔值                   | 是否启动高可用模式。默认值为 false。                                                                                                                                                             |
+| ha_log_dir                   | 字符串                   | HA 日志所在目录，需要启动 HA 模式。默认值为空。                                                                                                                                                       |
+| verbose                      | 整型                    | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。默认值为 1。                                                                                                                                         |
+| log_dir                      | 字符串                   | 日志文件所在的目录。默认目录为 /var/log/lgraph/。                                                                                                                                                 |
+| ssl_auth                     | 布尔值                   | 是否使用 SSL 安全认证。当开启时，REST 服务器只开启 HTTPS 服务。默认值为 false。                                                                                                                               |
+| web                          | 字符串                   | web 文件（包含可视化部分）所在目录。默认目录为 /usr/local/share/lgraph/resource。                                                                                                                       |
+| server_cert                  | 字符串                   | 在 SSL 认证开启时，服务器所使用的 certificate 文件路径。默认路径为 /usr/local/etc/lgraph/server-cert.pem。                                                                                                 |
+| server_key                   | 字符串                   | 在 SSL 认证开启时，服务器所使用的公钥文件。默认目录为 /usr/local/etc/lgraph/server-key.pem。                                                                                                               |
+| enable_audit_log             | 布尔值                   | 是否启用审计日志，默认值为 false。                                                                                                                                                              |
+| audit_log_expire             | 整型                    | 启用审计日志时，日志的有效时间（小时），超时自动清理，值为 0 时表示不清理。默认值为 0。                                                                                                                                    |
+| audit_log_dir                | 字符串                   | 启用审计日志时，日志文件的存放目录。默认目录为 $directory/_audit_log_。                                                                                                                                   |
+| load_plugins                 | 布尔值                   | 启动服务时导入所有存储过程。默认值为 true。                                                                                                                                                          |
+| optimistic_txn               | 布尔值                   | 为 Cypher 开启乐观多线程写入事务。默认为 false。                                                                                                                                                   |
+| disable_auth                 | 布尔值                   | 关闭 REST 验证。默认为 false。                                                                                                                                                             |
+| ha_snapshot_interval_s       | 整型                    | 快照间隔（以秒为单位），默认值为 604800。-1表示不自动生成快照。                                                                                                                                              |
+| ha_heartbeat_interval_ms     | 整型                    | 心跳间隔（以毫秒为单位）。 默认值为 1000。                                                                                                                                                          |
+| ha_node_offline_ms           | 整型                    | 心跳超时且节点下线间隔（以毫秒为单位）。默认为 60000。                                                                                                                                                    |
+| ha_node_remove_ms            | 整型                    | 节点被视为完全死亡并从列表中删除的间隔（以毫秒为单位）。默认值为 120000。                                                                                                                                          |
+| ha_first_snapshot_start_time | 字符串                   | 第一次打快照的时间，格式为"HH:MM:SS"，表示为在下一个HH:MM:SS时间点第一次打snapshot，以后每ha_snapshot_interval_s秒打一次。默认值为""，表示在0-ha_snapshot_interval_s内的任一时刻随机打第一次snapshot，以后每ha_snapshot_interval_s秒打一次snapshot |
+| enable_ip_check              | 布尔值                   | 允许 IP 白名单，默认值为 false。                                                                                                                                                             |
+| idle_seconds                 | 整型                    | 子进程可以处于空闲状态的最大秒数。 默认值为 600。                                                                                                                                                       |
+| enable_backup_log            | 布尔值                   | 是否启用备份日志记录。 默认值为 false。                                                                                                                                                           |
+| backup_log_dir               | 字符串                   | 存储备份文件的目录。 默认值为空。                                                                                                                                                                 |
+| snapshot_dir                 | 字符串                   | 存储快照文件的目录。 默认值为空。                                                                                                                                                                 |
+| thread_limit                 | 整型                    | 同时使用的最大线程数。 默认值为 0，即不做限制，以 license 为准。                                                                                                                                            |
+| unlimited_token              | 布尔值                   | 是否将链接token设置为无期限。 默认值为 false，有效期为24小时。                                                                                                                                            |
+| reset_admin_password         | 布尔值                   | 是否重置管理者密码。 默认值为 false。 为 true 时，密码重置为`73@TuGraph`。                                                                                                                                |
+| enable_fulltext_index        | 布尔值                   | 是否启用全文索引功能，默认值为 false。                                                                                                                                                            |
+| fulltext_analyzer            | 字符串                   | 全文索引分词器类型。可设为`StandardAnalyzer`或者`SmartChineseAnalyzer`。默认是`StandardAnalyzer`                                                                                                     |
+| fulltext_commit_interval     | 整形                    | 全文索引数据提交周期,针对写操作，单位秒。默认是 0，立即提交。                                                                                                                                                  |
+| fulltext_refresh_interval    | 整形                    | 全文索引数据刷新周期，针对读操作，单位秒。默认是 0，立即可以读到最新写入的数据。                                                                                                                                         |
+| ha_conf                      | 字符串                   | 根据 host1:port1,host2:port2,host3:port3 初始化HA集群，默认值为空。                                                                                                                             |
+| ha_node_join_group_s         | 整形                    | 节点尝试加入高可用集群的等待时长，单位秒，默认是 10。                                                                                                                                                      |
+| ha_bootstrap_role            | 整形                    | 是否使用bootstrap方式启动，以及使用该方式启动的服务器角色，0代表不使用bootstrap方式启动，1代表使用bootstrap方式启动且本节点为leader，2代表使用bootstrap方式启动且本节点为follower，只有这3种选项。 默认值为 0。                                              |
+| help                         | 布尔值                   | 打印此帮助消息。 默认值为 false。                                                                                                                                                              |
+
+### 4.2.服务器配置文件
+
+TuGraph 的配置文件以 JSON 格式存储。建议将大多数配置存储在配置文件中，并且仅在需要时使用命令行选项临时修改某些配置参数。
+一个典型的配置文件如下：
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7070,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..1d38b39017
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,179 @@
+# 部署高可用模式
+
+> 此文档主要介绍了高可用模式的原理、准备工作、以及服务器的操作说明
+
+## 1.原理
+
+TuGraph 通过多机热备份来提供高可用（HA）模式。在高可用模式下，对数据库的写操作会被同步到所有服务器（非witness）上，这样即使有部分服务器宕机也不会影响服务的可用性。
+
+高可用模式启动时，多个 TuGraph 服务器组成一个备份组，即高可用集群。每个备份组由三个或更多 TuGraph 服务器组成，其中某台服务器会作为`leader`，而其他复制组服务器则作为`follower`。写入请求由`leader`
+提供服务，该`leader`将每个请求复制同步到`follower`，并在请求同步到服务器后才能响应客户端。这样，如果任何服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选择出新的`leader`。
+
+TuGraph的高可用模式提供两种类型的节点：`replica`节点和`witness`节点。其中，`replica`节点是普通节点，有日志有数据，可对外提供服务。
+而`witness`节点是一种只接收心跳和日志但不保存数据的节点。根据部署需求，`leader`节点和`follower`节点可以灵活的部署为`replica`节点或`witness`节点。
+基于此，TuGraph高可用模式的部署方式有两种：一是普通部署模式，二是带witness的简约部署模式。
+
+对于普通部署模式，`leader`和所有`follower`均为`replica`类型的节点。写入请求由`leader`提供服务，该`leader`将每个请求复制同步到`follower`，
+并在请求同步到超过半数的服务器后才能响应客户端。这样，如果少于半数的服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选举出新的`leader`，通过这种方式保证数据的一致性和服务的可用性。
+
+然而，在用户服务器资源不够或者发生网络分区时，不能建立正常的HA集群。此时，由于`witness`节点没有数据，对资源占用小，可以将`witness`节点和`replica`节点部署在一台机器上。
+例如，当只有2台机器的情况下，可以在一台机器上部署`replica`节点，在另一台机器上部署`replica`节点和`witness`节点，不仅节省资源，而且不需要把日志应用到状态机上，
+也不需要生成和安装快照，因此响应请求的速度很快，可以在集群崩溃或网络分区时协助快速选举出新的`leader`，这就是TuGraph HA集群的简约部署模式。
+尽管`witness`节点有诸多好处，但是由于没有数据，集群实际上增加了一个不能成为`leader`的节点，因此可用性会略有降低。为提高集群的可用性，
+可通过指定`ha_enable_witness_to_leader`参数为`true`，允许`witness`节点临时当主。`witness`节点在把新日志同步到其他节点之后，
+会将leader角色主动切换到有最新日志的节点。
+
+v3.6及以上版本支持此功能。
+
+## 2.准备工作
+
+要启用高可用模式，用户需要：
+
+- 三台及以上的 TuGraph 服务器实例。
+
+- 在启动 lgraph_server 时打开高可用模式，可以使用配置文件或者命令行将`enable_ha`选项设置为`true`。
+
+- 设置正确的`rpc_port`，可通过配置文件或者命令行设置。
+
+## 3.启动初始备份组
+
+安装好TuGraph之后，可以使用`lgraph_server`命令在不同的机器上启动高可用集群。本节主要讲解高可用集群的启动方式，启动之后的集群状态管理参见[lgraph_peer工具](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.初始数据一致
+
+当启动时所有服务器中的数据相同或没有数据时，用户可以通过指定`--ha_conf host1:port1,host2:port2`启动服务器。
+这种方式可以将准备好的所有TuGraph实例一次性加入初始备份组，由备份组中的所有服务器根据raft协议选举出`leader`，并将其他服务器以`follower`的角色加入备份组。
+
+启动初始备份组的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+### 3.2.初始数据不一致
+
+如果第一台服务器中已有数据（以`lgraph_import`工具导入或从非高可用模式的服务器传输得到），
+并且之前并未在高可用模式下使用，则用户应使用boostrap方式启动。
+以`ha_bootstrap_role`参数为1在bootstrap模式下启动有数据的服务器，并通过`ha_conf`参数指定本机为`leader`。
+在bootstrap模式下，服务器在将新加入的服务器添加到备份组之前会将自己的
+数据复制到新服务器中，以使每个服务器中的数据保持一致。
+
+启动有数据服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+其他无数据的服务器需要指定`ha_bootstrap_role`参数为2，并通过`ha_conf`参数指定`leader`即可，命令示例如下所示
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**使用bootstrap启动HA集群时需要注意两点：**
+1. 需要等待`leader`节点生成snapshot并且成功启动之后再加入`follower`节点，否则`follower`节点可能加入失败。在启动`follower`节点时可以将`ha_node_join_group_s`参数配置的稍大，以在加入HA集群时多次等待和超时重试。
+2. HA集群只有在第一次启动时可以使用bootstrap模式，后续再启动时只能使用普通模式(见3.1节)启动，尤其不能让同一个集群的多个节点以bootstrap模式启动，否则可能产生数据不一致的情况
+
+## 4.启动witness节点
+
+### 4.1.不允许witness节点成为leader
+
+`witness`节点的启动方式和普通节点的启动方式一致，只需要设置`ha_is_witness`参数为`true`即可。需注意，witness节点的数量应少于集群节点总数量的一半。
+
+启动`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+注：默认不允许`witness`节点成为`leader`节点，这可以提高集群的性能，但是在`leader`节点崩溃时会降低集群的可用性。
+
+### 4.2.允许witness节点成为leader
+
+可以通过指定`ha_enable_witness_to_leader`参数为`true`，使得`witness`节点可以临时成为`leader`节点，在将新日志同步完成之后再主动切主
+
+启动允许成为`leader`节点的`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+注：尽管允许`witness`节点成为`leader`节点可以提高集群的可用性，但是在极端情况下可能会影响数据的一致性。因此一般应保证`witness`节点数量+1少于集群节点总数量的一半。
+
+## 5.横向扩展其他服务器
+
+启动初始备份组后，如果想对备份组进行横向扩展，要将新服务器添加到备份组，
+应使用`--ha_conf HOST：PORT`选项，其中`HOST`可以是该备份组中已有的任何服务器的 IP 地址，
+而`PORT`是其 RPC 端口。例如：
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+此命令将启动一台高可用模式的 TuGraph 服务器，并尝试将其添加到包含服务器`172.22.224.15:9090`的备份组中。
+请注意，加入备份组需要服务器将其数据与备份组的`leader`服务器同步，此过程可能需要相当长的时间，具体取决于数据的大小。
+
+## 6.停止服务器
+
+当服务器通过`CTRL-C`下线时，它将通知当前的`leader`服务器，告知其从备份组中删除该下线的服务器。如果`leader`服务器下线，
+它将在下线前将`leader`身份权限传给另一台服务器。
+
+如果服务器被终止或者与备份组中的其他服务器失去连接，则该服务器将被视为失败节点，`leader`服务器将在特定时限后将其从备份组中删除。
+
+如果任何服务器离开备份组并希望重新加入，则必须从`--ha_conf HOST:PORT`选项开始，其中`HOST`是当前备份组中的某台服务器的 IP 地址。
+
+## 7.重启服务器
+
+不建议重新启动整个备份组，因为它会中断服务。如果需要，可以关闭所有服务器。但在重新启动时，
+必须保证关闭时的备份组中至少有N/2+1的服务器能正常启动，否则启动失败。 并且，
+无论初始启动复制组时是否指定`enable_bootstrap`为true，重启服务器时都只需通过
+指定`--ha_conf host1:port1,host2:port2`参数一次性重启所有服务器即可，命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker部署高可用集群
+
+在真实业务场景中，很可能遇到在多种操作系统或架构上部署高可用集群的需求。
+差异化的环境可能导致编译TuGraph时缺少某些依赖。因此，
+在docker中编译软件并部署高可用集群是非常有应用价值的。以centos7版本的docker为例，
+部署高可用集群的步骤如下所示。
+
+### 8.1.安装镜像
+使用如下命令下载TuGraph的编译docker镜像环境
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+然后拉取TuGraph源码并编译安装
+
+### 8.2.创建容器
+使用如下命令创建容器，使用`--net=host`使得容器运行在host模式，此模式下
+docker和宿主机和共享网络namespace，即共用同一个IP。
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.启动服务
+在每台服务器上使用如下命令启动服务，因为docker和宿主机共享IP，所以可以直接指定在宿主机IP上启动服务
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.查看服务器状态
+
+备份组的当前状态可以在 TuGraph 可视化工具、REST API 以及 Cypher 查询中获取。
+
+在 TuGraph 可视化工具中，可以在 DBInfo 部分中找到备份组中的服务器及其角色列表。
+
+使用 REST API 时，可以使用`GET /info/peers` 请求获取信息。
+
+在 Cypher 中，使用`CALL dbms.listServers()`语句来查询当前备份组的状态信息。
+
+## 10.高可用模式下数据同步问题
+
+在高可用模式下，同一备份组中的不同服务器可能并不总是处于相同的状态。出于性能原因，如果请求已同步到超过一半的服务器，则`leader`服务器将认为该请求属于`committed`状态。尽管其余服务器最终将收到新请求，但服务器的状态不一致将持续一段时间。客户端也可能向刚刚重新启动的服务器发送请求，从而具有较旧的状态。
+
+为了确保客户端看到一致连续的数据，特别是为了摆脱`反向时间旅行`问题（其中客户端读取比以前看到的状态更旧的状态），每个 TuGraph 服务器都会保持一个单调增加的数据版本号。备份组中数据版本号到数据库状态的映射全局一致，这意味着如果两台服务器具有相同的数据版本号，则它们必须具有相同的数据。响应请求时，服务器在响应中包含了其数据版本号。因此，客户端可以知道它看到了哪个版本。客户端收到旧版本的数据之后可以重新向Leader发送请求，从而获取到最新的数据。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..f2bf6bb3a5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+安装和运行
+============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..30a7d25af3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,483 @@
+# 数据导入
+
+> 此文档主要介绍 TuGraph 的数据导入功能。其中包括 CSV 格式的分隔符，jsonline 的格式示例，以及导入在线和离线的两种模式。
+
+## 1.简介
+
+在图数据库服务安装成功后，您可以使用`lgraph_import`批量导入工具将现有数据导入 TuGraph。`lgraph_import`支持从 CSV 文件和 JSON 数据源导入数据。
+
+> CSV 格式
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline 格式
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph 支持两种导入模式：
+
+- _离线模式_：读取数据并将其导入指定服务器的数据文件，应仅在服务器离线时完成。
+- _在线模式_：读取数据并将其发送到工作中的服务器，然后将数据导入其数据库。
+
+## 2.CSV文件格式分隔符
+
+    CSV格式的分隔符可以是单字符或多字符组成的字符串，其中不能包含`\r`或`\n`。注意不同的shell会对输入字符串做不同的处理，因此针对不同的shell输入参数可能需要不同的转义处理。
+
+此外，`lgraph_import`还支持以下转义字符，以便输入特殊符号：
+
+| 转义符 | 说明                                                             |
+| ------ | ---------------------------------------------------------------- |
+| \\     | 反斜杠`\\`                                                       |
+| \\a    | 响铃，即 ASCII 码 0x07                                           |
+| \\f    | form-feed，即 ASCII 码 0x0c                                      |
+| \\t    | 水平制表符，即 ASCII 码 0x09                                     |
+| \\v    | 垂直制表符，即 ASCII 码 0x0b                                     |
+| \\xnn  | 两位十六进制数，表示一个字节，如\\x9A                            |
+| \\nnn  | 三位八进制数，表示一个字节，如\\001, \\443，数值范围不能超过 255 |
+
+例：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.配置文件
+
+`lgraph_import`工具通过指定的配置文件进行环境配置。配置文件描述输入文件的路径、它们所代表的点/边以及点/边的格式。
+
+### 3.1.配置文件格式
+
+配置文件包含两部分：schema 和 files。`schema`部分定义 label，`files`部分描述要导入的数据文件。
+
+#### 3.1.1.关键字
+
+- schema (数组形式）
+  - label（必选，字符串形式）
+  - type（必选，值只能是 VERTEX 或者 EDGE）
+  - properties（数组形式，对于点必选，对于边如果没有属性可以不配置）
+    - name（必选，字符串形式）
+    - type （必选，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（可选，代表该字段可以配置，也可以不配置）
+    - index（可选，该字段是否需要建索引）
+    - unique（可选，该字段是否建索引，并且是 unique 类型的，即全局唯一）
+    - pair_unique（可选，该字段是否建索引，并且是 pari_unique 类型的，即两点间唯一，仅用于边索引）unique与pair_unique只能设置一个，同时设置并运行将会因为输入异常而终止
+  - primary (仅点配置，必选，主键字段，需指定一个 property，用来唯一确定一个点)
+  - temproal (仅边配置，可选，指定时间戳属性用于存储层排序)
+  - temporal_field_order (仅边配置，可选，默认为"ASC"，表示升序，也可配置为"DESC"，表示降序)
+  - constraints (仅边配置，可选，数组形式，起点和终点的 label，不配置或者为空代表不限制)
+  - detach_property (点边都可配置，可选，默认是`false`。`true` 代表属性数据单独存放，在内存不够，属性数据比较多的场景下可以减少io读放大)
+- files （数组形式）
+  - path（必选，字符串，可以是文件路径或者目录的路径，如果是目录会导入此目录下的所有文件，需要保证有相同的 schema）
+  - header（可选，数字，头信息占文件起始的几行，没有就是 0）
+  - format（必须选，只能是 JSON 或者 CSV）
+  - label（必选，字符串）
+  - columns（数组形式）
+    - SRC_ID (特殊字符串，仅边有，代表这列是起始点数据)
+    - DST_ID (特殊字符串，仅边有，代表这列是目的点数据)
+    - SKIP   (特殊字符串，代表跳过这列数据)
+    - [property]
+  - SRC_ID (仅边配置，值是起始点标签)
+  - DST_ID (仅边配置，值是目的点标签)
+
+#### 3.1.2.索引长度
+因为TuGraph对key的长度有限制，唯一索引不允许建立超过限制长度的索引，而非唯一索引会对超过长度限制的属性进行截断处理，并且在通过迭代器遍历非唯一索引时，拿到的key也是经过截断的，可能和预期不一致。针对不同类型的非唯一索引，截断长度是不同的。
+##### 3.1.2.1.unique索引
+unique索引是全局唯一的，该索引key的最大长度是480bytes。primary作为特殊的unique索引，因此最大key的长度也是480bytes，超过无法建立索引。
+##### 3.1.2.2.pair_unique索引
+pair_unique索引是指两点间唯一的索引，这种类型的索引只能创建于边的schema中，这种索引在用户指定的key后面加上了源点和目标点的vid，每个vid是5bytes长度。因此最大key的长度是470bytes，超过无法建立索引。
+##### 3.1.2.3.非唯一索引
+非唯一索引是指既没有设置unique为1，也没有设置pair_unique为1的索引，在TuGraph的实现中，此类索引一个key可能映射到多个值，为了加速查找和写入，在用户指定的key后面加上了一组vid或euid中的最大值。其中对于创建于点中的非唯一索引，key后面跟着vid，每个vid是5bytes长度，因此最大长度是475bytes。
+对于创建于边中的非唯一索引，key后面跟着euid，每个euid是24bytes长度，因此最大长度是456bytes。索引key超过对应长度则会自动截断。
+
+### 3.2.配置文件示例
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+对于上述配置文件，定义了三个 label：两个点类型`actor`和`movie`，一个边类型`role`。每个 label 都描述了：label 的名字、类型（点还是边）、属性字段有哪些以及每个字段的类型。对于点，另外定义了 primary 字段是哪个；对于边，另外定义了 constraints 字段，用来限制边的起点和终点只能是哪些组合。
+
+还描述了三个数据文件，两个点的数据文件`actors.csv`和`movies.csv`，一个边的数据文件`roles.csv`。每个部分都描述了：文件的路径（path）、数据类型（format）、信息头占开头几行（header）、是哪个 label 的数据（label）、文件中每行数据中的每个列对应的字段是哪个。
+
+对于上述配置文件，import 工具在执行的过程中会先在 TuGraph 中创建`actor`、`movie`、`role`这三个 label，然后再执行三个文件的数据导入。
+
+## 4.离线全量导入
+
+离线模式只能在离线状态的服务器使用。离线导入会创建一张新图，因此更适合新安装的 TuGraph 服务器上的第一次数据导入。
+要在离线模式下使用`lgraph_import`工具，可以指定`lgraph_import --online false`选项。要了解可用的命令行选项，请使用`lgraph_import --online false --help`：
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+命令行参数：
+
+- **-c, --config_file** `config_file`: 导入配置文件名，其格式要求见下述。
+- **--log** `log_dir`: 日志目录。默认为空字符串，此时将日志信息输出到控制台。
+- **--verbose** `0/1/2`: 日志等级，等级越高输出信息越详细。默认为 1。
+- **-i, --continue_on_error** `true/false`: 在碰到错误时跳过错误并继续，默认为 false，碰到错误立即退出。
+- **-d, --dir** `{diretory}`: 数据库目录，导入工具会将数据写到这个目录。默认为`./db`。
+- **--delimiter** `{delimiter}`: 数据文件分隔符。只在数据源是 CSV 格式时使用，默认为`","`。
+- **-u, --username** `{user}`: 数据库用户名。需要是管理员用户才能执行离线导入。
+- **-p, --password** `{password}`: 指定的数据库用户的密码
+- **--overwrite** `true/false`: 是否覆盖数据。设为 true 时，如果数据目录已经存在，则覆盖数据。默认为`false`。
+- **-g, --graph** `{graph_name}`: 指定需要导入的图种类。
+- **-h, --help**: 输出帮助信息。
+
+### 4.1.离线导入示例
+
+在这个例子中，我们使用上面描述的电影-演员数据来演示导入工具的使用方法。待导入数据分为三个文件：`movies.csv`，`actors.csv`，`roles.csv`。
+
+`movies.csv`包含的是电影的信息，其中每部电影有一个 id（作为检索的 primary key），此外每部电影还拥有 title、year 和 rating 等属性。（数据来自[IMDb](http://www.imdb.com)）。
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+对应的 jsonline 格式如下:
+也可以所有字段都是字符串形式，导入的时候会转换成对应的类型
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`包含的是演员的信息。每个演员也拥有一个 id，以及 name 等属性。
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> 对应的 jsonline 格式如下:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`则包含了演员在哪个电影中扮演了哪个角色的信息。其中每一行记录的是指定演员在指定电影里饰演的角色，对应数据库中的一条边。`SRC_ID` 和 `DST_ID` 分别是边的源点和目标点，他们分别是`actors.csv`和`movies.csv`中定义的`primary`属性。
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+对应的 jsonline 格式如下:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+`配置文件import.conf`，注意每个文件中有两个标题行，因此我们需要指定`HEADER=2`选项。
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+使用导入配置文件，我们现在可以使用以下命令导入数据：
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # 从import.conf读取配置信息
+        --dir /data/lgraph_db      # 将数据存放在/data/lgraph_db
+        --graph mygraph            # 导入名为 mygraph 的图
+```
+
+**注意**：
+
+- 如果名为`mygraph`的图已存在，导入工具将打印错误消息并退出。要强制覆盖图形，可以使用`--overwrite true` 选项。
+- 配置文件和数据文件必须使用 UTF-8 编码（或普通 ASCII 编码，即 UTF-8 的子集）存储。如果任何文件使用 UTF-8 以外的编码（例如，带有 BOM 或 GBK 的 UTF-8）编码，则导入将失败，并输出分析器错误。
+
+## 5.在线增量导入
+
+在线导入模式可用于将一批文件导入已在运行中的 TuGraph 实例中。这对于处理通常以固定的时间间隔进行的增量批处理更新非常便利。`lgraph_import --online true`选项使导入工具能够在线模式工作。与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据发送到正在运行的 TuGraph 实例中，该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+
+如果用户和密码有效，并且指定的图存在，导入工具将将数据发送到服务器，服务器随后解析数据并将其写入指定的图。数据将以大约 16MB 大小的包发送，在最近的换行符处中断。每个包都是以原子方式导入的，这意味着如果成功导入包，则成功导入所有数据，否则，任何数据都不会进入数据库。如果指定了`--continue_on_error true`，则忽略数据完整性错误，并忽略违规行。否则，导入将在第一个错误包处停止，并打印出已导入的包数。在这种情况下，用户可以修改数据以消除错误，然后使用`--skip_packages N`重做导入以跳过已导入的包。
+
+## 6.在线全量导入
+
+在线全量导入可用于将一批文件导入运行中的TuGraph实例，TuGraph支持将两种不同类型的数据在线导入到实例中：
+1. 和离线导入类型相同的原数据文件（csv等）
+2. TuGraph的底层存储文件，即data.mdb文件，该文件可以由离线导入生成，也可以是其他TuGraph db的文件。
+这两种方式的适用场景不同，第一种是直接将数据导入到TuGraph中，优点是一次性自动导入，操作步骤简单。但是会在server端启动一个离线导入线程，
+只适合单机情况下的小规模数据导入。第二种是将已经准备好的底层存储文件导入到TuGraph中，虽然需要提前准备好mdb文件，但是对系统资源却没有很高的要求，
+而且支持远程下载文件导入，非常方便，适用于高可用模式或者大规模数据的在线导入。
+
+### 6.1 从原数据导入
+从原数据导入的执行方式是向运行中的TuGraph实例发送导入请求，
+实例接到请求后先使用离线导入（V3）的方式将数据导入一个临时的db中，然后在实例中新建子图并将临时db的数据文件迁移到新子图中，最后刷新实例的元数据。
+相比在线增量导入，在线全量导入的性能更高。
+`lgraph_import --online true --online_type 1`选项使导入工具能够在线全量导入。
+与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --full              Whether to full import online. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据导入正在运行的 TuGraph 实例中，
+该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+并且，配置文件（config_file参数）要求是 TuGraph 实例机器上的uri路径，其file配置也要求是 TuGraph 实例机器上资源的绝对路径。
+
+如果用户和密码有效，导入工具将在服务器端执行在线全量导入。如果想导入的图已存在，可以使用`--overwrite true` 选项强制覆盖子图。
+
+### 6.2 从数据库文件导入
+从原数据在线全量导入尽管操作简单、性能较高，但是对服务器资源要求较高，且耗时较长。
+一种更加通用的方式是先使用离线导入在一个空db中导入子图，得到data.mdb文件，然后把该文件在线导入到
+TuGraph服务中。其使用方式如下所示：
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+除普通在线导入用到的url, user和password参数之外，从数据库文件导入的在线全量导入方式
+使用graph参数指定导入的子图名称，path参数指定文件路径，remote指定文件存在在远程或者本地。
+如果是本地文件，则需要保证HA集群中所有的节点在path路径下都有该文件。如果是远程文件，则会先下载再导入。
+需要注意的是，由于data.mdb只有一份，需要保证HA的各个节点和离线导入生成data.mdb的机器的环境完全一致，
+以保证不会出现环境问题。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..5544169de0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# 数据导出
+
+> 此文档主要介绍 TuGraph 的数据导出功能。
+
+## 1.简介
+
+TuGraph 可以通过 `lgraph_export` 工具来对已经存放在TuGraph的图数据进行数据导出。 `lgraph_export` 工具可以将指定 TuGraph 数据库的数据以 `csv` 或者 `json` 文件形式导出到指定目录，同时导出这些数据进行再导入时需要的配置文件 `import.config` ，详细描述可参见[配置文件](1.data-import.md)。
+
+## 2.导出命令
+
+该工具的命令示例如下：
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+其中：
+
+- `-d {database_dir}` 指定需要进行数据导出的数据库所在目录，默认值为 `./testdb`。
+- `-e {export_destination_dir}` 指定导出文件存放的目录，默认值为 `./exportdir`。
+- `-g {graph_to_use}` 指定图数据库的种类，默认为 `default` 。
+- `-u {username}` 指定进行该导出操作的用户的用户名。
+- `-p {password}` 指定进行该导出操作的用户的用户密码。
+- `-s {field_separator}` 指定导出文件的分隔符，默认为逗号。
+- `-f {output_format}` 指定导出数据的格式，`json`或者`csv`，默认为`csv`。
+- `-h` 除上述指定参数外，也可以使用该参数查看该工具的使用帮助。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..ce113ad0a4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,35 @@
+# 备份恢复
+
+> 此文档主要介绍 TuGraph 的数据备份和恢复功能。
+
+## 1.数据备份
+
+TuGraph 可以通过 `lgraph_backup` 工具来进行数据备份。
+`lgraph_backup` 工具可以将一个 TuGraph 数据库中的数据备份到另一个目录下，它的用法如下：
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+其中：
+
+- `-s {source_dir}` 指定需要备份的数据库（源数据库）所在目录。
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
+  如果目标数据库不为空，`lgraph_backup` 会提示是否覆盖该数据库。
+- `-c {true/false}` 指明是否在备份过程中进行 compaction。
+  compaction 能使产生的备份文件更紧凑，但备份时间也会变长。该选项默认为 `true`。
+
+## 2.数据恢复
+
+使用`lgraph_backup` 工具得到的目标数据库`{destination_dir}`备份了源数据库
+`{source_dir}`的所有子图，但不包含HA集群的raft信息，从而保证服务和集群能
+以备份数据库成功重启并与源数据库的数据一致。使用如下命令可以用备份数据库重启服务，
+在服务启动时会恢复所有子图的存储过程，保证备份服务和原服务完全一致。
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+其中：
+
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..c0c5afb7eb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# 数据预热
+
+> 此文档主要介绍 TuGraph 的数据预热功能。
+
+## 1.简介
+
+TuGraph 是基于磁盘的数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+## 1.数据预热命令
+
+数据预热可以通过工具 `lgraph_warmup` 来进行。它的使用示例如下：
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+其中：
+
+- `-d {db_dir}` 选项指定了 TuGraph 服务器的数据目录
+
+- `-g {graph_list}` 选项指定需要进行数据预热的图名称，用逗号分隔
+
+根据数据大小和所使用的磁盘类型不同，预热过程运行时间也不同。机械磁盘上预热一个大数据库可能耗时较长，请耐心等待。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..0a113bfa78
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# 集群管理
+
+> 此文档主要介绍 TuGraph HA 集群的管理工具，主要包括删除节点、leader转移和生成snapshot功能
+
+## 1. 简介
+
+HA集群启动之后，可以使用`lgraph_peer`工具进行集群管理，可以执行删除节点，转移leader和生成snapshot等功能。
+
+## 2. 删除节点
+
+对于TuGraph HA集群中长期离线或者产生网络分区的节点，可以使用`lgraph_peer`的`remove_peer`命令删除节点。命令示例如下所示：
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command remove_peer` 指定要执行的操作为remove_peer，即删除节点。
+- `--peer {peer_id}` 指定要删除节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 3. leader 转移
+
+当需要对主节点执行停机或重启操作时，为减少集群的不可服务时间，可以使用`lgraph_peer`的`transfer_leader`命令转移主节点。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command transfer_leader` 指定要执行的操作为transfer_leader，即转移主节点。
+- `--peer {peer_id}` 指定要成为主节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 4. 生成snapshot
+
+出于节点启动时设置ha_snapshot_interval_s为-1以默认不打snapshot或其他原因，
+当需要让某个节点手动生成snapshot时，可以使用`lgraph_peer`的`snapshot`命令。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+其中：
+
+- `--command snapshot` 指定要执行的操作为snapshot，即生成快照。
+- `--peer {peer_id}` 指定要生成快照的节点的rpc网络地址，如 `127.0.0.1:9092`。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..72b6187767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,134 @@
+# 命令行工具
+
+> 此文档主要介绍 lgraph_cypher 文档的使用，注意不再更新维护，请使用 [lgraph_cli](../7.client-tools/6.bolt-console-client.md)
+
+TuGraph 发布版本附带名为`lgraph_cypher`的查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+## 1.单命令模式
+
+在单命令模式下，`lgraph_cypher`可用于提交单个 Cypher 查询并将结果直接打印到终端，打印结果也可以容易地重定向写入指定文件。当用户需要从服务器获取大量结果并将其保存在文件中时，这非常便利。
+在此模式下，`lgraph_cypher`工具具有以下选项：
+
+### 1.1.命令行参数:
+
+| 参数     | 类型   | 说明                                                                     |
+| -------- | ------ | ------------------------------------------------------------------------ | ------ | ----------------------------------------------------------------------------------------------------------------------------------------- |
+| --help   | \\     | 列出所有参数及说明。                                                     |
+| -example | \\     | 列出命令实例。                                                           |
+| -c       | string | 数据库的配置文件，用于获取 ip 与 port 信息。                             |
+| -h       | string | 数据库服务器 ip 地址，如有配置文件则可舍去此参数。默认值为`127.0.0.1` 。 |
+| -p       | string | 数据库服务器端口，如有配置文件则可舍去此参数。默认值为`7071` 。          |
+| -u       | string | 数据库登录用户名。                                                       |
+| -P       | string | 数据库登录密码。                                                         |
+| -f       | string | 包含单条 Cypher 查询单文本文件的路径。                                   |
+| -s       | string | 单行 cypher 查询命令。以`"`开头结尾。                                    |
+| -t       | int    | 进行 cypher 查询时服务器的超时阈值。默认值为`150`秒。 -format            | string | 查询结果显示模式。支持`plain`与`table`两种格式。`plain`格式会将查询结果单列打印。`table`格式会将查询结果以表格方式显示。默认值为`table`。 |
+
+### 1.2.命令示例:
+
+**cypher 命令文件查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+```
+
+**cypher 命令单句查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+```
+
+## 2.交互模式
+
+`lgraph_cypher`也可以在交互模式下运行。在交互式模式下，客户端与服务器保持连接，并在读取-评估-打印-循环中与用户进行交互。
+
+### 2.1.进入 lgraph_cypher 交互模式:
+
+如不加`-f`或`-s`命令行选项，运行`lgraph_cypher`时将会进入交互模式。使用方式如下：
+
+```
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+```
+
+如成功进入则会显示相应登录成功信息：
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2023 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+现在我们也提供一个交互式 shell ，用于用户输入 Cypher 查询语句或使用`:help`命令来检查可用命令。
+
+### 2.2.command种类与说明:
+
+除 Cypher 查询外，`lgraph_cypher` 的 shell 还接受以下命令：
+
+| 命令                     | 对应参数                           | 说明                                                                                                |
+| ------------------------ | ---------------------------------- | --------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                 | 显示服务器信息与所有 command 对应说明。                                                             |
+| :db_info                 | \\                                 | 当前服务器状态查询。对应 REST API 的/db/info。                                                      |
+| :clear                   | \\                                 | 清空屏幕。                                                                                          |
+| :use                     | {图的名称}                         | 使用该名称指定的图，默认值为`default` 。                                                            |
+| :source                  | `-t {查询timeout值} -f {查询文件}` | 可交互模式下的 cypher 命令文件查询。超时阈值默认值为`150`秒。查询文件格式参考无交互式查询参数。     |
+| :exit                    | \\                                 | 退出交互模式并返回原命令行。                                                                        |
+| :format                  | `plain` or `table`                 | 更改 cypher 查询结果的显示模式。支持`plain`与`table`模式。                                          |
+| :save all/command/result | `-f {文件路径}` `{cypher语句}`     | 存储 cypher 命令（command）或查询结果（result）或以上二者（all）。默认存储位置为`/saved_cypher.txt` |
+
+**注意:**
+
+- 每条命令都应该以冒号开始 `:`.
+
+**:save 命令例子:**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+```
+
+### 2.3.cypher 查询命令:
+
+在交互模式下，用户也可直接输入单句 cypher 命令进行查询，以"`;`"结束。输入命令不区分大小写。例子如下：
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher`输入命令时支持多行输入，用户可使用`ENTER`键将长查询语句分多行输入。多行输入情况下命令行开头会从`>`变为`=>`，然后用户可以继续输入查询的其余部分。
+
+例子如下：
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### 2.4.辅助功能:
+
+**历史查询：** 在交互模式下按上下方向键可查询输入历史。
+
+**自动补全：** lgraph_cypher 会根据输入历史进行自动补全。在补全提示出现的情况下，按下右方向键就会自动补全命令。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..643597f2bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,435 @@
+# TuGraph-DataX
+
+> 此文档主要介绍 TuGraph DataX 的安装编译和使用示例
+
+## 1.简介
+
+TuGraph 在阿里开源的 DataX 基础上添加了 TuGraph 的写插件以及 TuGraph jsonline 数据格式的支持，其他数据源可以通过 DataX 往 TuGraph 里面写数据。
+TuGraph DataX 介绍 [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX)，支持的功能包括：
+
+- 从 MySQL、SQL Server、Oracle、PostgreSQL、HDFS、Hive、HBase、OTS、ODPS、Kafka 等各种异构数据源导入 TuGraph
+- 将 TuGraph 导入相应的目标源 （待开发）
+
+![导入导出](../../../images/tugraph-datax.png)
+
+DataX 原始项目介绍参考 [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.编译安装
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+编译出来的 DataX 文件在 target 目录下
+
+## 3.文本数据通过DataX导入TuGraph
+
+我们以 TuGraph 手册中导入工具 lgraph_import 章节举的数据为例子，有三个 csv 数据文件，如下：
+`actors.csv`
+
+```
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+```
+
+`movies.csv`
+
+```
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+`roles.csv`
+
+```
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+```
+
+然后建三个 DataX 的 job 配置文件：
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后依次执行如下三个命令：
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## 4.MySQL数据通过DataX导入TuGraph
+
+我们在 `test` database 下建立如下电影 `movies` 表
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+往表中插入几条数据
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+建立一个 DataX 的 job 配置文件
+
+`job_mysql_to_tugraph.json`
+
+**配置字段方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**写简单 sql 方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后执行如下命令：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..ea866abf5d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph-Explorer
+
+> TuGraph Explorer 已经合并到 [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/9.restful.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/9.restful.md
new file mode 100644
index 0000000000..1a62bd27a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/9.restful.md
@@ -0,0 +1,198 @@
+# TuGraph-Restful-Server
+
+> TuGraph Restful Server 强依赖 TuGraph，Restful Server 与 Tugraph 共存
+
+## 1.TuGraph-Restful-Server 简介
+TuGraph Restful Server 使用brpc框架支持的http协议，提供restful接口查询功能，在实现中，restful server 与rpc server 使用同一个端口。目前restful接口提供文件上传，数据导入，导入进度查询，cypher查询，文件删除等功能
+
+## 2.启动 TuGraph-Restful-Server
+需要在启动Tugraph时设置enable_rpc参数为true的方式，正常启动TuGraph
+
+## 3.连接 TuGraph-Restful-Server
+TuGraph正常启动后，Restful Server 将监听在rpc_port上， 通过访问 http://${ip}:${rpc_port}/LGraphHttpService/Query/ url可以链接到TuGraph
+
+## 4.数据格式
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+## 5.返回值
+
+通用返回格式
+
+|  body参数  | 参数说明  |  参数类型  |  是否必填  |
+|:--------:|:-----:|:------:| :-----: |
+| errorCode |  状态码  |  字符串  |  是  |
+| errorMessage | 错误信息  |  字符串  |  是  |
+| data | 返回的数据 |  字符串  |  是  |
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 401 Unauthorized: 未通过鉴权认证，例如用户名密码错误，token超过有效期等
+- 500 Internal Server Error: 服务器端错误
+  当操作成功时，返回的 data 中包含操作的返回值。
+  当发生输入错误或者服务器错误时，返回的 errorMessage 中包含错误提示。
+
+## 6.URI格式
+
+| URI               | 说明                 |
+|-------------------|--------------------|
+| /cypher           | 执行cypher查询请求       |
+| /refresh          | 刷新token请求          |
+| /login            | 用户登陆请求             |
+| /logout           | 用户登出请求             |
+| /upload_files     | 上传文件请求             |
+| /clear_cache      | 清理用户上传文件请求         |
+| /check_file       | 文件认证请求             |
+| /import_data      | 数据导入请求             |
+| /import_progress  | 导入进度查询请求           |
+| /import_schema    | 批量创建schema请求       |
+
+## 7.接口
+### 7.1 用户登陆
+用于用户第一次与服务端通信时的鉴权操作，请求报文在 http body 中携带用户名和密码，响应报文在 http body 中会返回一个带有有效期的token，后续请求中需要在http header中携带该token作为凭证
+#### 7.1.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/login
+#### 7.1.2 REQUEST
+|  body参数  |  参数说明  |  参数类型  |  是否必填  |
+|:--------:|:------:|:------:| :-----: |
+ | userName |  用户名  |  字符串  |  是  |
+ | password |   密码   |  字符串  |  是  |
+#### 7.1.3 RESPONSE
+|    body参数     | 参数说明  |  参数类型  |  是否必填  |
+|:-------------:|:-----:|:------:| :-----: |
+| authorization | token |  字符串  |  是  |
+
+### 7.2 刷新token
+token到期后将无法使用此token与服务端正常通信，需要获取新的token作为后续请求的凭证，请求报文在http header中携带旧的token，响应报文在http body中返回新的token
+#### 7.2.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/refresh
+#### 7.2.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+#### 7.2.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| authorization | 新的token |  字符串  |  是  |
+
+### 7.3 用户登出
+用户不再需要与服务端进行通信时，需要请求登出接口，释放自己的token。请求报文在http header中携带旧的token，如果拿到返回errorCode为200的响应报文即为正常登出
+#### 7.3.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/logout
+#### 7.3.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+### 7.4 执行cypher查询请求
+用户通过此类请求发cypher给server端执行并获取执行结果，请求报文在http body 中将执行的cypher语句和目标子图发送给server，server执行完成后在响应报文的http body中返回执行结果
+#### 7.4.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/cypher
+
+#### 7.4.2 REQUEST
+| body参数 |    参数说明    |  参数类型  |  是否必填  |
+|:------:|:----------:|:------:| :-----: |
+| graph  |   查询目标子图   |  字符串  |  是  |
+| script | cypher查询语句 |  字符串  |  是  |
+
+#### 7.4.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| result | 返回结果 |  字符串  |  是  |
+
+### 7.5 上传文件请求
+用户通过此类请求向server发送文件，可以对文件进行分片，分片大小不大于1MB，支持多线程乱序发送，请求报文在http header 中包含文件名，第一字节内容在文件中的偏移和分片大小，在body中包含文件内容，server收到请求后将验证分片大小是否与分片内容一致，一致时将文件分段写入文件。不一致时将返回errorCode为400的响应
+#### 7.5.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/upload_files
+
+#### 7.5.2 REQUEST
+| header参数  |    参数说明    |  参数类型  |  是否必填  |
+|:---------:|:----------:|:------:| :-----: |
+| File-Name |   文件名   |  字符串  |  是  |
+| Begin-Pos | 开始位置在文件内的偏移 |  字符串  |  是  |
+|   Size    | 文件分片大小 |  字符串  |  是  |
+|  body参数   |  参数说明   |  参数类型  |  是否必填  |
+|     -     | 文件内容 |  字符串  |  是  |
+
+### 7.6 文件认证请求
+用户通过此类请求验证发送到server端的文件是否与期望一致，server端使用两种验证方式，md5值和文件长度，目前已支持文件长度验证。
+#### 7.6.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/check_file
+#### 7.6.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| fileName |           文件名           |  字符串  |  是  |
+| checkSum |        文件对应md5值         |  字符串  |  否  |
+| fileSize |       文件长度(以字节计算)       |  字符串  |  否  |
+| flag | 标记位，为1时校验md5值，为2时校验文件长度 |  字符串  |  是  |
+
+#### 7.6.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| pass | 检查成功为true，否则为false |  bool  |  是  |
+
+### 7.7 批量创建schema请求
+用户通过此类请求批量创建schema，请求报文在http body 中将创建schema的目标子图和schema信息发送给server，如果拿到返回errorCode为200的响应报文即为正常创建
+#### 7.7.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_schema
+#### 7.7.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| graph |   创建目标子图   |  字符串  |  是  |
+| schema | schema描述信息 |  字符串  |  是  |
+
+### 7.8 数据导入请求
+用户通过此类请求导入已经上传的数据文件。导入不论成功或失败，都将删除已上传文件。数据导入请求在server中实现为一个异步任务，响应返回并不意味着导入已完成，返回的是任务id，后续可以通过此任务id查询导入进度
+#### 7.8.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_data
+#### 7.8.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  | 是否必填 |
+|:--------:|:-----------------------:|:------:|:----:|
+| graph |         导入目标子图          |  字符串  |  是   |
+| schema |       导入schema描述        | json字符串  |  是   |
+| delimiter |           分隔符           |  字符串  |  是   |
+| continueOnError |     单行数据出错是否跳过错误并继续     |  boolean  |  否   |
+| skipPackages |         跳过的包个数          |  字符串  |  否   |
+| taskId |  任务id   |  字符串  |  否   |
+| other | 其他参数 |  json字符串  |  否   |
+
+#### 7.8.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| taskId | 任务编号 |  字符串  |  是  |
+
+### 7.9 清理用户上传文件请求
+用户通过此类请求清理已经上传的文件，如果拿到返回errorCode为200的响应报文即为正常清理
+#### 7.9.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/clear_cache
+#### 7.9.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| fileName |    文件名称    |  字符串  |  否  |
+| userName |    用户名称    |  字符串  |  否  |
+| flag | 标记位， flag = 0时删除fileName指定文件, flag = 1时删除userName指定用户已经上传的所有文件， flag = 2时删除所有用户上传的文件 |  字符串  |  是  |
+
+### 7.10. 导入进度查询请求
+用户通过此类请求获得导入任务的状态
+#### 7.10.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_progress
+#### 7.10.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| taskId |           任务编号           |  字符串  |  是  |
+
+#### 7.10.3 RESPONSE
+| body参数 |                  参数说明                   |  参数类型  |  是否必填  |
+|:------:|:---------------------------------------:|:------:| :-----: |
+| state  | 状态标记，为0表示准备导入，为1表示导入中，为2表示导入成功，为3表示导入失败 |  字符串  |  是  |
+|  progress  |             导入进度，state为1时包含             |  字符串  |  否  |
+|  reason  |             失败原因，state为3时包含             |  字符串  |  否  |
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..00a7df7efb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+实用工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..cacf2d18bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/1.python-client.md
@@ -0,0 +1,237 @@
+# Python客户端
+
+> 此文档主要是TuGraph Python SDK的使用说明, 注意将来不再更新维护，建议使用 [bolt客户端](./5.bolt-client.md)
+
+## 1. 概述
+Python的TuGraph Client有两种，一种是RESTful的Client，使用HTTP方法向server发送请求，另一种是RPC的Client，使用RPC方法调用server远程服务，两者各有优劣。
+RESTful client的使用方式简单，在项目的src/client/python/TuGraphClient目录下可以找到Client的源码文件，直接安装到用户环境中即可使用，但是支持的功能较少，
+性能也不高。RPC Client既支持单机的server，也支持高可用集群和负载均衡，接口较多，功能强大。但是使用方式较为复杂，需要用户自己编译TuGraph项目得到liblgraph_client_python.so，
+或者使用runtime镜像时直接在/usr/local/lib64目录下找到该依赖库，将其引入python项目即可正常使用。接下来将详细介绍这两种Client的使用方式。
+
+## 2. RESTful Client
+
+### 2.1.安装Client
+
+TuGraph的Python RESTful client使用setuptools工具进行打包和分发，用户可以将client直接安装到本地环境中，在使用时即可直接引入。
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+注：使用setuptools工具安装python client时会安装httpx等依赖，需要在通外网的环境下执行。
+
+### 2.2.调用Cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = await aclient.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.调用存储过程
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+res = await aclient.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python的TuGraph Rpc Client是使用pybind11包装的CPP Client SDK，下表列出了Python和CPP Client SDK的对应关系。
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+Python RPC Client的使用方式较为复杂，用户可以在本地环境中编译TuGraph得到liblgraph_client_python.so，也可以使用官方提供的runtime镜像，
+在镜像中的/usr/local/lib64目录下可以直接找到该依赖库，引入用户项目即可使用。
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.实例化client对象
+
+#### 3.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 3.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 3.2.调用cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.3.向leader发送cypher请求
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.4.调用GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.5.向leader发送GQL请求
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.6.调用存储过程
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.7.向leader调用存储过程
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 3.8.加载存储过程
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 3.9.列举存储过程
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.10.删除存储过程
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 3.11.从字节流中导入schema
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.12.从字节流中导入点边数据
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 3.13.从文件中导入schema
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.14.从文件中导入点边数据
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..ce29ac4bf4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,340 @@
+# C++客户端
+
+> 此文档主要是TuGraph C++ SDK的使用说明。
+
+## 1.概述
+C++ Client 能够使用 RPC 连接lgraph_server，进行数据导入、执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直接连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化。
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.3.向leader发送cypher请求
+```C++
+    std::string str;
+    bool ret = client.CallCypherToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```C++
+    std::string str;
+    bool ret = client.CallGql(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGql(std::string& result, const std::string& gql,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling gql.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.5.向leader发送GQL请求
+```C++
+    std::string str;
+    bool ret = client.CallGqlToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGqlToLeader(std::string& result, const std::string& gql,
+                 const std::string& graph = "default", bool json_format = true,
+                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true);
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+
+### 2.8.加载存储过程
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送请求。
+
+### 2.10.删除存储过程
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..7abfeb9639
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/3.java-client.md
@@ -0,0 +1,290 @@
+# Java客户端
+
+> 此文档主要是TuGraph Java SDK的使用说明，需要注意的是TuGraph Java SDK将来不再更新维护，建议使用 [bolt客户端](./5.bolt-client.md)
+
+## 1.编译java client代码
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+## 2.使用示例
+
+### 2.1.实例化client对象
+
+添加maven依赖
+
+```xml
+<dependency>
+    <groupId>com.antgroup.tugraph</groupId>
+    <artifactId>tugraph-db-java-rpc-client</artifactId>
+    <version>1.4.1</version>
+</dependency>
+```
+
+引入依赖
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.3.向leader发送cypher请求
+```java
+    String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```java
+    String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling GQL
+    @return: the result of GQL query execution
+    public String callGql(String gql, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.5.向leader发送GQL请求
+```java
+    String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```java
+    String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedureToLeader : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @return: the result of procedure execution
+    public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 2.8.加载存储过程
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.10.删除存储过程
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException 
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout) 
+            throws UnsupportedEncodingException, IOException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..a9c06de71b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,174 @@
+# TuGraph-OGM
+
+## 1.简介
+
+> TuGraph-OGM 项目在其他仓库开源。
+
+TuGraph-OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。同时 TuGraph-OGM 兼容 Neo4j-OGM，Neo4j 生态用户可以无缝迁移到 TuGraph 数据库上。
+
+### 1.1.TuGraph-OGM 功能
+
+TuGraph-OGM 提供以下函数操作 TuGraph：
+
+| 功能                            | 用法                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| 插入单个节点\边                 | void session.save(T object)                                                      |
+| 批量插入节点\边                 | void session.save(T object)                                                      |
+| 删除节点与对应边                | void session.delete(T object)                                                    |
+| 删除指定 label 的全部节点       | void session.deleteAll(Class\<T> type)                                           |
+| 清空数据库                      | void purgeDatabase()                                                             |
+| 更新节点                        | void session.save(T newObject)                                                   |
+| 根据 id 查询单个节点            | T load(Class<T> type, ID id)                                                     |
+| 根据 ids 查询多个节点           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| 根据 label 查询全部节点         | Collection\<T> loadAll(Class\<T> type)                                           |
+| 条件查询                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher 查询（指定返回结果类型） | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher 查询                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.编译 TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.使用 TuGraph-OGM
+
+详细示例请参考 demo 文件夹下的 TuGraphOGMDemo ###在`pom.xml`中引入依赖
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // 构建Movie节点
+    @Id
+    private Long id;      // Movie节点的id
+    private String title; // title属性
+    private int released; // released属性
+
+    // 构建边ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // 构建Actor节点
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// 配置
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//启动driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// 开启session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.通过OGM进行增删改查
+
+```java
+// 增
+Movie jokes = new Movie("Jokes", 1990);  // 新建Movie节点jokes
+session.save(jokes);                     // 将jokes存储在TuGraph中
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // 将speed节点与alice节点通过ACTS_IN进行连接
+session.save(speed);                    // 存储两个节点与一条边
+
+// 删
+session.delete(alice);                  // 删除alice节点以及相连的边
+Movie m = session.load(Movie.class, jokes.getId());   // 根据jokes节点的id获取jokes节点
+session.delete(m);                                    // 删除jokes节点
+
+// 改
+speed.setReleased(2018);
+session.save(speed);                   // 更新speed节点属性
+
+// 查
+Collection<Movie> movies = session.loadAll(Movie.class);  // 获取所有Movie节点
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // 查询所有小于1995年发布的电影
+
+// 调用Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // 查询Speed为2018的Movie
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // 创建节点Label Director
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // 创建边Label DIRECT
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // 获取create结果
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // 查看创建节点数目
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //查看创建边数目
+
+// 清空数据库
+session.deleteAll(Movie.class);        // 删除所有Movie节点
+session.purgeDatabase();               // 删除全部数据
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..d3bac11367
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,15 @@
+# Bolt客户端
+
+TuGraph目前兼容了Neo4j的bolt协议，可以直接使用Neo4j的客户端访问TuGraph。
+
+## 开启bolt端口
+
+如果使用的是TuGraph的docker容器，配置文件在 `/usr/local/etc/lgraph.json`
+
+在TuGraph的配置文件中添加 `bolt_port=7687`（端口号自己看情况修改），开启bolt端口，Neo4j的客户端需要与这个端口连接。
+
+## Neo4j客户端使用限制
+
+目前还没有兼容Neo4j bolt协议的全部功能，Neo4j客户端的显示事务功能目前还不支持，使用客户端的时候注意避免使用这个功能。
+
+在代码目录中的demo/Bolt下面有golang、java、js、python、rust 这几个语言的的例子，可供参考。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..bd3ff0f0ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,102 @@
+# TuGraph console client
+
+`lgraph_cli` 是基于bolt协议的 console client，c++编写，使用时需要连接tugraph的bolt端口。
+
+`lgraph_cli` 是一个二进制的可执行文件，不依赖其他动态库，拷贝到一台linux机器上就可执行。
+
+## `lgraph_cli`使用
+
+语句以分号结束，输入`exit`, `quit`或者Ctrl-C退出客户端。
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+语句可以中间换行，多行输入。
+
+```powershell
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+非交互式
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+从文件读取多条命令
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## 在线数据导出
+
+lgraph_cli 支持流式读取，导出数据只需要把lgraph_cli的输出重定向到文件中即可，导出格式支持csv和json。
+
+### csv格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..beb44d41aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,340 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+## 2.请求与响应格式
+TuGraph HTTP Server 接收json格式的请求，经过鉴权后开始提取请求中的字段，根据定义好的接口逻辑处理请求，并返回json格式的响应。
+
+### 2.1.标准响应格式
+每一个响应都以标准响应格式返回，格式如下：
+
+| body参数  | 参数说明         | 参数类型        | 是否必填       |
+| ------- |--------------|-------------|------------|
+| errorCode   | 业务级错误码       | int类型       | 是          |
+| success   | 请求是否成功       | int类型       | 是          |
+| errorMessage   | 业务级错误信息      | 字符串类型       | 是          |
+| data   | 请求成功时返回的响应信息 | json字符串     | 是          |
+
+### 2.2请求类型
+
+#### 2.2.1. 用户登陆
+用户在登陆请求中携带用户名和密码发送到服务端。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，在后续的请求中将令牌加入请求头的Authorization域中。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| userName   | 用户名  | 字符串类型   | 是          |
+| password   | 用户密码 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+| default_password  | 默认密码 | 布尔类型 | 是          |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. 用户登出
+用户登出，同时删除已经认证的token，用户后续发送请求时，需要重新登陆，并获取新的token。
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data为空
+
+#### 2.2.3. 身份刷新
+已下发的token失效后，需要调用本接口重新认证。后端验证token合法性。token在初次登录后，1小时内有效，过期需要刷新
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+
+#### 2.2.4. 调用cypher
+用户对TuGraph的增删改查请求需要调用cypher接口，并通过标准的cypher查询语言发起
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明     | 参数类型  | 是否必填       |
+| ------- |----------|-------|------------|
+| graph   | 查询的子图名称  | 字符串类型   | 是          |
+| script   | cypher语句 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含查询结果
+
+| body参数  | 参数说明 | 参数类型    | 是否必填       |
+| ------- |------|---------|------------|
+| result   | 查询结果 | json字符串 | 是          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. 上传文件
+接口用于将本地文件上传至TuGraph所在机器。可以上传文本文件，二进制文件，可以上传大文件，也可以上传小文件，对于大文件，客户端在上传时应该对文件做切分，每个文件分片不大于1MB，参数Begin-Pos和Size对应本次分片在完整文件中的偏移量与分片大小。参数需要放在http请求的报文头，请求内容对应文件分片内容。本接口请求头不止有token参数
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header参数  | 参数说明        | 参数类型             | 是否必填       |
+| ------- |-------------|------------------|------------|
+| File-Name   | 文件名称        | 字符串类型            | 是          |
+| Begin-Pos   | 开始位置在文件内的偏移 | 可以转成size_t类型的字符串 | 是          |
+| Size   | 本次请求文件分片大小    | 可以转成size_t类型的字符串 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+#### 2.2.6. 检查文件
+本接口用于检查已上传文件正确性，如果成功通过检查，再次上传同一文件时，直接返回成功
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明           | 参数类型          | 是否必填        |
+| ------- |----------------|---------------|-------------|
+| fileName   | 文件名称           | 字符串类型         | 是           |
+| checkSum   | 文件对应md5值       | 可以转成int类型的字符串 | flag为"1"时必填 |
+| fileSize   | 文件长度(以字节计算)    | 可以转成int类型的字符串  | flag为"2"时必填 |
+| flag   | 标记位，flag为1时校验md5。flag为2时校验文件长度 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| pass   | 检查成功为true，否则为false | bool类型 | 是          |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. 清理缓存文件
+admin用户可以删除所有用户上传的文件，其他用户可以删除自己的上传的文件，可以删除指定名称的文件，指定用户上传的文件，也可以删除所有文件
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明        | 参数类型          | 是否必填        |
+| ------- |-------------|---------------|-------------|
+| fileName   | 文件名称        | 字符串类型         | flag为"0"时必填 |
+| userName   | 用户名称        | 字符串类型 | flag为"1"时必填 |
+| flag   | 标记位，flag为0时删除fileName指定文件, flag为1时删除userName指定用户已经上传的所有文件，flag为2时删除所有用户上传的文件 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. 导入schema
+本接口可以根据用户指定的schema信息创建schema模型，schema的详细格式信息请参考data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明       | 参数类型          | 是否必填        |
+| ------- |------------|---------------|-------------|
+| graph   | 子图名称       | 字符串         | 是           |
+| description   | schema描述信息 | json字符串 | 是 |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. 导入数据
+本接口允许用户指定已经通过上传，校验的文件作为数据文件，按照schema参数描述的配置信息，导入到graph参数指定的子图中。导入过程是异步的，server在接收到导入请求后，返回一个任务id
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明  | 参数类型    | 是否必填 |
+| ------- |-------|---------|----|
+| graph   | 子图名称  | 字符串类型   | 是  |
+| schema   | 导入schema描述 | json字符串 | 是  |
+| delimiter   | 分隔符   | 字符串类型   | 是  |
+| continueOnError   | 单行数据出错是否跳过错误并继续 | boolean类型 | 否  |
+| skipPackages   | 跳过的包个数 | 可以转成int类型的字符串 | 否  |
+| taskId   | 任务id，用于重启出错的任务 | 字符串类型 | 否 |
+| flag   | 标记位，flag为1时导入成功将删除数据文件 | 可以转成int类型的字符串 | 否 |
+| other   | 其他参数 | 可以转成int类型的字符串 | 否  |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| taskId   | 任务编号 | 字符串类型 | 是          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. 导入进度查询
+本接口用于查询导入任务的执行进度
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明                 | 参数类型    | 是否必填 |
+| ------- |----------------------|---------|----|
+| taskId   | import_data接口返回的任务id | 字符串类型 | 是 |
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明    | 参数类型             | 是否必填    |
+| ------- |---------|------------------|---------|
+| success   | 	是否成功导入 | boolean类型        | 是       |
+| reason   | 	导入失败原因 | 字符串类型            | success为false时必填 |
+| progress   | 	当前导入进度 | 可以转成double类型的字符串 | 是       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..21ad033477
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,273 @@
+# RPC API
+
+> 此文档主要介绍 TuGraph 的 RPC API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供丰富的 RPC API，以供开发者通过 RPC 请求远程调用 TuGraph 提供的服务。
+
+RPC（远程过程调用）是一种通过网络从远程计算机程序上请求服务，而不需要了解底层网络技术的协议。
+相比REST，RPC 面向方法，主要用于函数方法的调用，可以适合更复杂通信需求的场景，且性能更高。
+brpc是用c++语言编写的工业级RPC框架，基于brpc，TuGraph 提供了丰富的RPC API，本文档描述
+TuGraph 的 RPC API 使用方式。
+
+## 2.请求
+
+### 2.1.建立连接
+
+开发者向TuGraph服务发送RPC请求，首先要建立连接。以C++语言为例，开发者创建指定url的通道（channel），
+由通道创建指定的服务存根（LGraphRPCService_Stub），后续即可通过存根像调用本地方法一样向远程
+服务器发送请求。
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.请求类型
+
+TuGraph支持10种RPC请求，其中每种请求的功能如下表所示：
+
+| 请求              | 功能         |
+|-----------------|------------|
+| GraphApiRequest | 点边索引操作请求   |
+| CypherRequest   | cypher请求   |
+| PluginRequest   | 存储过程请求     |
+| HARequest       | 高可用模式请求    |
+| ImportRequest   | 数据导入请求     |
+| GraphRequest    | 子图操作请求     |
+| AclRequest      | 权限管理请求     |
+| ConfigRequest   | 配置管理请求     |
+| RestoreRequest  | 备份请求       |
+| SchemaRequest   | schema管理请求 |
+
+用户发送请求时，需要传入以下参数：
+- client_version: 可选参数，HA模式下可通过对比`client_version`和`server_version`防止响应过时的请求
+- token: 必要参数，客户端登陆之后获得token，每次请求传入token以校验用户身份
+- is_write_op: 可选参数，标志请求是否是写请求
+- user: 可选参数，HA模式下主从之间同步请求时设置user，不需验证token
+
+服务处理完RPC请求之后发回响应，响应消息中除了包含每个请求的单独响应信息之外，还包含以下参数：
+- error_code: 必要参数，标志请求处理状态
+- redirect: 可选参数，HA模式下向follower发送写请求时处理失败，设置redirect为请求转发地址，即leader地址
+- error: 可选参数，请求错误信息
+- server_version: 可选参数，HA模式的请求响应中设置`server_version`以避免client读取数据时发生反向时间旅行问题
+
+:warning:  **除CypherRequest、PluginRequest、HARequest和AclRequest外，其余RPC接口将逐步废弃，其功能统一至CypherRequest接口。**
+
+## 3.登录
+
+登录请求信息包含以下参数：
+- user: 必要参数，用户名
+- pass: 必要参数，密码
+以C++为例，用户使用构建好的服务存根发送登录请求：
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+登录响应信息包含以下参数：
+- token: 必要参数，登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。
+如果登录失败会收到“Authentication failed”错误。
+
+## 4.查询
+用户可以通过Cypher查询和TuGraph进行绝大多数的交互，Cypher请求信息包含以下参数：
+- query: 必要参数，Cypher查询语句
+- param_names: 可选参数，参数名
+- param_values: 可选参数，参数值
+- result_in_json_format: 必要参数，查询结果是否以JSON格式返回
+- graph: 可选参数，Cypher语句执行的子图名称
+- timeout: 可选参数，Cypher语句执行的超时时间
+
+以C++为例，用户发送Cypher请求的方式如下所示：
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+Cypher请求响应为以下两个参数之一：
+- json_result: JSON格式的cypher查询结果
+- binary_result: CypherResult格式的cypher查询结果
+
+## 5.存储过程
+为满足用户较为复杂的查询/更新逻辑，TuGraph支持 C 语言和 Python 语言编写的存储过程。
+用户可以使用RPC请求对存储过程进行增删改查操作。
+
+### 5.1.加载存储过程
+加载存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- read_only: 必要参数，是否只读
+- code: 必要参数，存储过程文件读入生成的ByteString
+- desc: 可选参数，存储过程描述
+- code_type: 可选参数，存储过程代码类型，PY、SO、CPP、ZIP四者之一
+
+以C++为例，用户加载存储过程的方式如下所示：
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+加载存储过程的响应不包含参数，如果加载失败则抛出BadInput异常
+
+### 5.2.调用存储过程
+
+调用存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- param: 必要参数，存储过程参数
+- result_in_json_format: 可选参数，调用结果是否以JSON格式返回
+- in_process: 可选参数，未来支持
+- timeout: 可选参数，调用存储过程的超时时间
+
+以C++为例，用户调用存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+调用存储过程的响应为以下两个参数之一：
+- reply: ByteString格式的存储过程调用结果
+- json_result: JSON格式的存储过程调用结果
+
+### 5.3.删除存储过程
+
+删除存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+
+以C++为例，用户删除存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+删除存储过程的响应不包含参数，如果删除失败则抛出BadInput异常
+
+### 5.4.列举存储过程
+
+列举存储过程请求不需要参数，以C++为例，用户列举存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+列举存储过程的响应的参数如下所示：
+- reply: JSON格式的procedure列表
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..1928d70f07
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2918 @@
+# RESTful API Legacy
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+**注意：除"登陆"、"查询"和"存储过程"外，其余接口自 **2023年4月30日** 起将不再提供支持，统一使用Cypher接口提供服务。**
+
+## 2.请求与数据格式
+
+### 2.1请求
+
+TuGraph 支持 HTTP GET/POST/PUT/DELETE 请求。其中：
+
+- GET 请求用于只读请求，如读取点属性，边属性等操作；
+- POST 请求用于创建实体，提交 Cypher，以及加载和调用存储过程；
+- PUT 请求用于修改已有实体，如修改点属性，边属性等；
+- DELETE 请求用于删除已有实体，如删除点，边等。
+
+在高可用模式下，用户可以在请求的报头(request header)中设置 `server_version` 来保证请求的服务器有足够新的数据。
+当前的 `server_version` 可以从服务器返回的报头中获取。
+
+### 2.2.数据格式
+
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.3.返回值
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 307 Temporary Redirect: 操作被重定向，一般用于高可用模式下，把操作重定向到 master 上
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 500 Internal Server Error: 服务器端错误
+
+当操作成功时，返回的 JSON 中包含操作的返回值。当操作重定向时，返回的 HTTP 报头中的 `location` 域包含重定向目的地址。
+当发生输入错误或者服务器错误时，返回的 JSON 中包含 `error_message` 域，其内容是错误提示。
+
+在高可用模式下，服务器还会在报头中设置 `server_version`，以告知客户端当前服务器的数据版本号。当客户端在不同的服务器之间切换时，该数据版本号可以保证客户端不会读到错误的历史数据。
+
+### 2.4.URI格式
+
+TuGraph REST API 提供以下功能：Service Root, login, info, label, index, node, relationship, cypher, cpp_plugin, 以及 python_plugin。
+各功能使用的 URI 格式如下：
+
+| URI     | 说明                 |
+| ------- | -------------------- |
+| /web    | web 可视化界面       |
+| /cypher | cypher 请求          |
+| /acl    | 权限控制             |
+| /user   | 用户管理             |
+| /login  | 用户登录             |
+| /info   | 数据库状态及提示信息 |
+| /task   | 任务管理             |
+| /db     | 子图操作             |
+
+其中子图操作又分为：
+
+| URI                              | 说明                 |
+| -------------------------------- | -------------------- |
+| /db                              | 子图的创建，删除     |
+| /db/_{graph_name}_/node          | 点操作             |
+| /db/_{graph_name}_/relationship  | 边操作               |
+| /db/_{graph_name}_/label         | Label 相关操作       |
+| /db/_{graph_name}_/index         | 索引相关操作         |
+| /db/_{graph_name}_/cypher        | 子图相关 cypher 操作 |
+| /db/_{graph_name}_/cpp_plugin    | C++存储过程          |
+| /db/_{graph_name}_/python_plugin | Python 存储过程      |
+| /db/_{graph_name}_/import        | 在线导入             |
+| /db/_{graph_name}_/misc          | 其它操作             |
+
+## 3.登录
+
+TuGraph 提供基于 JWT 的用户认证方式，可以使用 HTTP 或 HTTPS 协议进行传输。系统默认使用 HTTP 协议，如果需要使用 HTTPS，需要在 lgraph.json 配置文件中将 ssl_auth 设为 1。
+
+### 3.1.登录
+
+用户通过用户名和密码发送登录请求。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，并且用于以后的每次发送请求。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**: `/login`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+  | default_password | 是否为默认密码 | 布尔值 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.身份刷新
+Token失效后，前端发起刷新token接口，后端验证token合法性。初次登录后，1小时内有效，需刷新使用。即使刷新，24小时后也会强制退出，需要重新登陆。
+验证通过，生成新的token；验证失败返回状态码401。
+
+- **URI**: `/refresh`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.修改Token有效期
+修改Token有效期，需要传输jwt，refresh_time和expire_time三个参数，其中jwt用于校验用户身份，refresh_time和expire_time等于0时，有效期为无期限，超过refresh_time时，需要调用refresh接口获取新的Token;超过expire_time时，需要重新登录。
+
+- **URI**: `/update_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+  | refresh_time | 有效时间（默认设置为0） | Int64 |
+  | expire_time | 有效时间（默认设置为0） | Int64 |
+
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0,
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.查询Token有效期
+查询Token有效期，需要传输jwt，用于校验用户身份，返回，refresh_time和expire_time，其中refresh_time表示刷新时间，超过时需要调用refresh接口获取新的Token;expire_time表示过期时间，超过时需要重新登录。
+- **URI**: `/get_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+
+- **RESPONSE**:  如果成功，返回"refresh_time"和"expire_time"。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+
+### 3.5.登出
+用户登出，同时删除token。
+
+- **URI**: `/logout`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/logout
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 4.查询
+
+URI 格式为
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.调用Cypher
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 列表 |
+  | elapsed | 运行时间（秒） | 浮点数 |
+  | header | 返回结果的表头 | 列表 |
+  | size | 结果数 | 整型 |
+
+其中 header 是一个列表，每一元素格式如下：
+
+| 域名 | 说明                                        | 类型   |
+| ---- | ------------------------------------------- | ------ |
+| name | 列名                                        | 字符串 |
+| type | 列数据类型，0 为标量，1 为点 id，2 为向量 |        |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.调用带参数的 Cypher
+
+Cypher 支持使用参数进行查询。当调用带参数的 Cypher 查询时，TuGraph 会缓存该查询的
+执行计划（execution plan），以加速后续同类查询的速度。
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+  | parameters | 参数 | 列表 |
+
+- **RESPONSE**:
+
+与 [调用 Cypher](#%E8%B0%83%E7%94%A8Cypher) 相同。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+
+## 5.存储过程
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.加载存储过程
+
+TuGraph 服务启动时，如果 load_plugins 为真，则会自动加载 plugin 目录下的所有 plugin。否则需要手动加载。此外，如果服务器运行过程中，管理员更新了 plugin 文件，也需要手动重新加载。重新加载 plugin 的调用格式为：
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 插件名称 | 字符串 |
+  | description | 插件说明 | 字符串 |
+  | code_base64 | 插件代码 | 字符串，使用 base64 编码 |
+  | read_only | 是否为只读存储过程 | 布尔值 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 5.2.列出所有存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程列表，其中每个元素是一个 plugin 的描述，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.获取存储过程的详细信息
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程信息，包括代码，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+  | code_base64 | 存储过程的代码 | 字符串，使用 base64 编码 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.调用存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: POST
+- **REQUEST**: 字符串输入
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | data | 输入数据 | 字符串 |
+  | timeout | 超时长度（秒，可选，缺省值为 0） | 浮点 |
+  | in_process | 是否在本进程调用（可选，缺省值为 false） | 布尔值 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.删除存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 6.Deprecated
+
+以下接口将在4/30/2023之后被删除。
+
+### 6.1.用户管理
+
+系统默认创建一个管理员，管理员用户名为 _admin_，密码为 _73@TuGraph_。为了安全起见，请用户在第一次启动服务器后更改密码。
+
+
+#### 6.1.1.添加用户
+
+添加一个新的用户，并为其设置初始密码。只有管理员有权限进行此操作。其中用户名只能由字母，数字以及下划线构成，密码则可以包含任意字符。用户名和密码长度不能超过 64 字节。添加用户时还可以为用户增加一个描述，用户描述可以包含任意字符，最长不超过 512 字节。
+
+新用户默认拥有同名的角色，不具备任何图的权限。
+
+- **URI**: `/user`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "description": "This is a user"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.列出所有用户
+
+列出数据库的所有用户。只有管理员拥有该操作权限。
+
+- **URI**: `/user/`
+- **METHOD**: GET
+- **RESPONSE**: 所有用户及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin admin user",
+        "roles": ["admin"]
+    },
+    "guest1": {
+        "disabled": true,
+        "description": "",
+        "roles": ["guest1", "some_other_role"]
+    }
+}
+```
+
+#### 6.1.3.获取用户信息
+
+列出给定用户的信息。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "A guest user"
+    "roles": ["guest1", "some_other_role"]
+}
+```
+
+#### 6.1.4.列出用户权限
+
+列出给定用户有权限访问的所有图及相应权限。
+
+- **URI**: `/user/{user_name}/graph`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1/graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "graph1" : "FULL",
+    "graph2" : "READ"
+}
+```
+
+#### 6.1.5.更改用户密码
+
+用户可以更改自己的密码，更改密码时需要同时提供原密码。管理员可以更改所有用户的密码。管理员更改其它用户密码时，可以不提供当前密码。
+
+- **URI**: `/user/{user_name}/password`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | current_password | 当前密码 | 字符串 |
+  | new_password | 新密码 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/password
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.6.修改用户描述
+
+用户可以修改自己的描述。管理员可以修改任意用户的描述。
+
+- **URI**: `/user/{user_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "New description for this user."
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.7.删除用户
+
+删除用户及其所有相关权限，只有管理员拥有该操作权限。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.8.禁用用户
+
+用户可以被禁用。被禁用的用户将不能登陆，但是其资料仍然保存。被禁用的用户可以被重新启用。
+
+- **URI**: `/user/{user_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.9.启用用户
+
+启用一个被禁用的用户。
+
+- **URI**: `/user/{user_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.10.设置用户角色
+
+为指定用户设置角色。只有管理员可以执行此操作。
+
+用户角色列表必须是“全量列表”，即该列表需要包含该用户需要的所有角色。唯一的例外是用户的同名角色，即使列表中不含该角色，它也会被加到用户角色中。
+
+- **URI**: `/user/{user_name}/role`
+- **METHOD**: POST
+- **REQUEST**: 角色列表
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+        ["role1", "role2"]
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+此时用户`guest1`拥有角色`guest1`, `role1`和`role2`。
+
+### 6.2.角色管理
+
+TuGraph 使用基于角色的权限管理。
+
+同一用户可以拥有多个角色。新用户默认拥有与其同名的角色。删除用户时，同名角色也会被删除。如果新建用户时同名角色已经存在，则创建失败。
+
+同一角色可以对多个图有不同的权限。用户对某张图的权限由其所有角色对该图的最高权限决定。
+
+TuGraph 使用四级权限，不用的用户对不同的子图可以有不同的权限，四种权限及其说明如下：
+
+| 权限  | 说明                                                                             |
+| ----- | -------------------------------------------------------------------------------- |
+| NONE  | 无权限                                                                           |
+| READ  | 只读                                                                             |
+| WRITE | 可读写子图中的点和边                                                           |
+| FULL  | 完全权限，包括更改元数据（label, index），管理存储过程，以及删除子图中的所有数据 |
+
+管理员对所有子图都有完全权限，新建的用户对所有子图都没有权限。将用户加入管理员角色中可以将用户提升为管理员。
+
+#### 6.2.1.添加角色
+
+添加一个新的角色，并设置其描述。只有管理员有权限进行此操作。
+
+角色名只能由字母，数字以及下划线构成，密码则可以包含任意字符。角色名长度不能超过 64 字节。
+
+角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | role | 角色名 | 字符串 |
+  | description | 角色描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "role": "new_role",
+        "description": "This is a new role.",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.2.修改角色描述
+
+修改角色的描述。只有管理员有权限进行此操作。角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role/{role_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 新描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "modified description"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.列出所有角色
+
+列出数据库的所有角色。只有管理员拥有该操作权限。
+
+- **URI**: `/role/`
+- **METHOD**: GET
+- **RESPONSE**: 所有角色及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin administrator group.",
+        "permissions": {"default":"FULL", "graph1":"FULL"}
+    },
+    "role1": {
+        "disabled": true,
+        "description": "Another role",
+        "permissions": {"default":"READ"}
+    }
+}
+```
+
+#### 6.2.4.获取角色信息
+
+列出给定角色的信息。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: GET
+- **RESPONSE**: 角色信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "Another role",
+    "permissions": {"default":"READ"}
+}
+```
+
+#### 6.2.5.删除角色
+
+删除指定角色，只有管理员拥有该操作权限。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.6.禁用角色
+
+角色可以被禁用。角色被禁用后，具有该角色的用户将不再从该角色中获得任何权限。只有管理员可以执行此操作。
+
+- **URI**: `/role/{role_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.7.启用角色
+
+启用一个被禁用的角色。
+
+- **URI**: `/role/{role_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.8.设置角色权限
+
+为指定角色设置权限。只有管理员可以执行此操作。
+
+角色权限列表必须是“全量列表”，即该列表需要包含该角色能操作的所有图及其权限。
+
+- **URI**: `/role/{role_name}/permissions`
+- **METHOD**: POST
+- **REQUEST**: 图名称及相应权限的字典。
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/permissions
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "graph1" : "FULL",
+        "graph2" : "READ"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.服务器状态
+
+#### 6.3.1.修改服务器配置
+
+修改服务器配置，配置修改后立即生效，并将影响所有服务器。这些配置的优先级高于配置文件以及命令行参数。
+
+- **URI**: `/config`
+- **METHOD**: PUT
+- **REQUEST**:
+
+请求为一个字典，使用 `{"opt1":v1}` 可以将名为`opt1`的配置修改为`v1`。
+
+| 配置名               | 说明                   | 值类型 |
+| -------------------- | ---------------------- | ------ |
+| OPT_DB_ASYNC         | 是否启用异步模式       | 布尔值 |
+| OPT_TXN_OPTIMISTIC   | 是否默认使用乐观事务锁 | 布尔值 |
+| OPT_AUDIT_LOG_ENABLE | 是否启用审计日志       | 布尔值 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "OPT_DB_ASYNC": true,
+        "OPT_AUDIT_LOG_ENABLE": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.当前服务器状态
+
+- **URI**: `/info`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | lgraph_version | 服务器版本号 | 字符串 |
+  | git_branch | 服务器代码分支 | 字符串 |
+  | git_commit | 服务器代码版本 | 字符串 |
+  | web_commit | 前端码版本 | 字符串 |
+  | cpp_id | CPP 编译器 ID | 字符串 |
+  | cpp_version | CPP 编译器版本 | 字符串 |
+  | python_version | PYTHON 版本 | 字符串 |
+  | node | 点 uri | 字符串 |
+  | relationship | 边 uri | 字符串 |
+  | cpu | cpu 信息 | 字典，格式参见[服务器 CPU 状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8CPU%E7%8A%B6%E6%80%81) |
+  | disk | 硬盘 IO 信息 | 字典，格式参见[服务器硬盘状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%A1%AC%E7%9B%98%E7%8A%B6%E6%80%81) |
+  | memory | 内存信息 | 字典，格式参见[服务器内存状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%86%85%E5%AD%98%E7%8A%B6%E6%80%81) |
+  | db_space | 图数据库占用空间 | 字典，格式参见[图数据库占用空间](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8D%A0%E7%94%A8%E7%A9%BA%E9%97%B4) |
+  | db_config | 图数据库配置信息 | 字典，格式参见[图数据库配置信息](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E9%85%8D%E7%BD%AE%E4%BF%A1%E6%81%AF) |
+  | up_time | 数据库在线时长（秒） | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.服务器 CPU 状态
+
+- **URI**: `/info/cpu`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序 CPU 使用率 | 整型 |
+  | server | 服务器 CPU 使用率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.服务器硬盘状态
+
+- **URI**: `/info/disk`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | read | 服务器硬盘读速率 | 整型 |
+  | write | 服务器硬盘写速率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.服务器内存状态
+
+- **URI**: `/info/memory`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序内存使用量 | 整型 |
+  | server_avail | 服务器可用内存 | 整型 |
+  | server_total | 服务器总内存 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.图数据库占用空间
+
+- **URI**: `/info/db_space`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | space | 图数据库占用空间 | 整型 |
+  | disk_avail | 图数据库可用空间 | 整型 |
+  | disk_total | 服务器硬盘总空间 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "disk_avail"::360074579968,
+      "disk_total"::984373800960,
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.图数据库配置信息
+
+- **URI**: `/info/db_config`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | db_async | 图数据库工作模式（同步或异步） | 布尔值 |
+  | disable_auth | 是否禁用身份验证 | 布尔值 |
+  | enable_ha | 是否启用高可用模式 | 布尔值 |
+  | enable_rpc | 是否启用 RPC 服务器 | 布尔值 |
+  | bind_host | REST 服务器的主机 | 字符串 |
+  | enable_audit_log | 是否启用日志审计 | 布尔值 |
+  | port | REST 服务器的端口 | 整型 |
+  | rpc_port | RPC 服务器的端口 | 整型 |
+  | optimistic_txn | 是否默认使用乐观事务锁 | 布尔值 |
+  | thread_limit | 图数据库应用程序的可用线程数 | 整型 |
+  | enable_ssl | 是否使用 SSL 进行身份验证 | 布尔值 |
+  | verbose | 输出的详细程度 | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "db_async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "bind_host":"127.0.0.1",
+      "enable_audit_log":false,
+      "port":7070,
+      "optimistic_txn":false,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "enable_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.8.高可用服务器列表
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/peers`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回一个服务器信息列表，其中每个服务器信息格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+  | state | 服务器状态 | 字符串 |
+
+其中服务器状态可为 `MASTER`,`SLAVE`,`OFFLINE`。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.9.当前 Leader 信息
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/leader`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前 leader 服务器信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.10.服务器统计信息
+
+- **URI**: `/info/statistics`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前服务器统计信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | requests/second | 每秒处理的请求数量 | 浮点型 |
+  | writes/second | 每秒处理的写请求数量 | 浮点型 |
+  | running_tasks | 正在执行的请求数量 | 整型 |
+  | failure_rate | 请求失败率 | 浮点型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 2.3,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.11.审计日志信息
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | begin_time | 查询日志的起始时间(必填，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | end_time | 查询日志的结束时间(默认为当前时间，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | user | 查询日志的操作者(管理员可查询所有用户的日志，普通用户只能查询本人日志) | 字符串 |
+  | num_log | 查询日志的数量(默认为 100) | 整型 |
+  | descending_order | 查询结果是否降序输出(默认为 true) | 布尔值 |
+
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回审计日志列表，其中每个元素是一条操作日志，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | index | 该操作的索引值 | 整型 |
+  | begin_time | 该操作的开始时间 | 字符串 |
+  | end_time | 该操作的结束时间 | 字符串 |
+  | user | 该操作的发起者 | 字符串 |
+  | graph | 该操作的图 | 字符串 |
+  | type | 该操作的类型 | 字符串 |
+  | read_write | 该操作为读操作或者写操作 | 字符串 |
+  | success | 该操作是否成功 | 布尔值 |
+  | content | 该操作的简要内容 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.任务管理
+
+TuGraph 提供长任务的跟踪和中止功能。用户可以通过 REST API 来查询当前正在运行的在 Cypher 和存储过程查询，并选择中止正在执行的查询。
+
+任务管理对应的 URI 格式为
+
+```
+    http://{host}:{port}/task/{thread_id}/{task_id}
+```
+
+#### 6.4.1.查询正在执行的任务
+
+- **URI**: `/task`
+- **METHOD**: GET
+- **RESPONSE**:
+
+返回的 JSON 为一个数组，其中每一个元素格式如下：
+
+| 域名         | 说明                         | 类型   |
+| ------------ | ---------------------------- | ------ |
+| description  | 任务描述                     | 字符串 |
+| time_elapsed | 任务已经执行的时间，单位为秒 | 浮点   |
+| task_id      | 任务 ID                      | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.中止任务
+
+- **URI**: `/task/{task_id}`
+  其中 `{task_id}` 是 `GET /task` 返回结果中的 `task_id`。
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.5.子图管理
+
+TuGraph 支持多子图，子图之间完全独立，不同的子图可以对不同用户开放不同权限。管理员可以添加和删除子图。
+
+#### 6.5.1.创建新子图
+
+- **URI**: `/db`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 子图名 | 字符串 |
+  | config | 配置 | 字典，格式为 { {列名 1}:{列值 1},... } |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1",
+        "config" : {
+            "max_size_GB":2048,
+            "description": "description of graph1"
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.删除子图
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.列出所有子图
+
+- **URI**: `/db`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_GB":1024,
+            "description":"description of graph1"
+        }
+    }
+```
+
+#### 6.5.4.获取子图信息
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "max_size_GB":1024,
+        "description":"description of graph1"
+    }
+```
+
+### 6.6.元数据管理
+
+TuGraph 是一个具备多图能力的强模式属性图数据库。在每一张子图中，每种点和边都需要有预定义的数据格式。数据格式由 Label 决定，每种 Label 都有自己的数据格式。用户可以使用 REST API 添加，删除和查询 Label 及其对应的数据格式。
+
+Label 操作对应的 URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+其中{type}可以是 node 或者 relationship。
+
+#### 6.6.1.创建Label
+
+创建 Label 的过程同时也是定义其数据类型的过程。只有创建了 Label 才能在图中插入相应类型的点或者边。
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | Label 名 | 字符串 |
+  | fields | 数据列定义 | 列表 |
+  | is_vertex | 是否是点 Label | 布尔值 |
+  | primary | 点的主键属性 | 字符串 |
+  | edge_constraints | 边的约束 | 列表 |
+
+`primary` 在 `is_vertex` 为 `true` 的时候设置，这个字段只有点才有, 创建点的时候必须设置。
+
+`edge_constraints` 在 `is_vertex` 为 `false` 的时候设置，这个字段只有边有。这个字段限制了该边的起点和终点只能是哪些点的组合，比如：`[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`，限制了该边只能是从 `vertex_label1` 到 `vertex_label2` 和 从 `vertex_label3` 到 `vertex_label4`。如果不想有任何限制，不设置该字段即可。
+
+其中`fields`为一个数组，其中每个元素定义数据的一列，内容如下：
+
+| 域名     | 说明                                     | 类型                                                                                                |
+| -------- | ---------------------------------------- | --------------------------------------------------------------------------------------------------- |
+| name     | 列名                                     | 字符串                                                                                              |
+| type     | 列数据类型                               | 字符串，有以下类型： int8, int16, int32, int64, float, double, string, date, datetime, binary, bool |
+| optional | 数据是否可以为空（可选，缺省值为 false） | 布尔值                                                                                              |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.列出所有 Label
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | edge | 边 Label 列表 | 列表 |
+  | vertex | 点 Label 列表 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.获取 Label 的数据格式定义
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+- **METHOD**: GET
+- **RESPONSE**: 数据列定义表，类型是一个词典，key 为列名，value 为列定义，列定义见如下：
+-
+
+| 域名     | 说明             | 类型   |
+| -------- | ---------------- | ------ |
+| optional | 该列值是否可为空 | 布尔值 |
+| type     | 列值类型         | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema 导入
+
+- **URI**: `/db/{graph_name}/schema/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+- **RESPONSE**:
+
+Schema 导入会根据 description 比较新的 Schema 和数据库中原有的 Schema 是否兼容，检查的粒度为 Label。如果不一致则出错，如果一致则添加原先 Schema 中不存在的 Label，返回 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串:
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.点操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+Nodes 提供节点（Vertex）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。
+
+#### 6.7.1.列出点数量和label数量
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | num_label | 点 label 数量 | 整数 |
+  | num_vertex | 点数量 | 整数 |
+
+_注意 num_vertex 返回的并不是准确的点数量，只是一个估计值。_
+
+#### 6.7.2.创建一个点
+
+向数据库中插入一个点。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 点属性 | 字典，其中 key 是列名，value 是相应值。value 必须是与列类型相应的类型，如列为 int32，则 value 只能是整数。 |
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新点 vid。该 ID 可用于后续的点操作中。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.批量创建点
+
+TuGraph 允许一次性插入多个点，以减少网络开销。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | fields | 点属性 | 列表 |
+  | values | 点数据 | 列表 |
+
+其中 fields 是一个字符串列表，列出一系列列名；values 是一个列表，其中每个元素是一个列表，列表中每个元素是列数据。
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新增加的点的 vid 列表，该列表中每一个 vid 按顺序对应请求中的每一个点。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.获取点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 属性 | 字典，格式为 { {列名 1}:{列值 1},...} |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.删除点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 被删掉的点的入边数量 | 整数值 |
+  | out | 被删掉的点的出边数量 | 整数值 |
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.获取点所有属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+- **METHOD**: GET
+- **RESPONSE**: Node 所有属性（字典）
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.获取点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: Node 某一属性
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.更新点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 点属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "********"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.8.边操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+与 Nodes 功能类似，Relationships 提供边（edge）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。每一条边都可以由一个唯一 ID（euid）来标识。这个 ID 可以从在插入边时获得，或者在 [列出所有边](#%E5%88%97%E5%87%BA%E6%89%80%E6%9C%89%E8%BE%B9) 操作中得到。
+
+#### 6.8.1.创建一条边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | destination | 目的点 ID | 整数值 |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid（字符串）。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.批量创建边
+
+- **URI**: `/db/{graph_name}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | fields | 数据列名 | 列表 |
+  | edge | 边数据 | 列表 |
+
+其中 edge 是一个数据列表，其中每个元素都是一条边，其定义如下：
+
+| 域名        | 说明     | 类型                                                   |
+| ----------- | -------- | ------------------------------------------------------ |
+| source      | 起点 id  | 整数                                                   |
+| destination | 终点 id  | 整数                                                   |
+| values      | 数据列表 | 列表，每列对应 fields 中的一个列，类型是该列对应的类型 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid 列表。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.列出所有出边（outgoing relationships）
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+- **METHOD**: GET
+- **RESPONSE**: 点 src 的所有出边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.列出所有入边（incoming relationships）
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+- **METHOD**: GET
+- **RESPONSE**: 点 dst 的所有入边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.列出所有边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 入边 | 列表 |
+  | out | 出边 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationships/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.获取边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | property | 边属性 | 字典 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.删除边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.获取边的所有属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+- **METHOD**: GET
+- **RESPONSE**: 边属性字典
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.获取边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功,返回代码 200,同时返回边的属性。如果失败,返回代码 400,同时返回 "Illegal field."。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.更新边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.9.索引
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+提供索引操作，接受 GET/POST 请求。
+
+#### 6.9.1.创建索引
+
+该操作会启动一个创建索引的后台任务，用户可以通过列出该 Label 相关的所有索引来检查新建索引的状态。
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: POST
+- **REQUEST**:
+
+| 域名    | 说明     | 类型                                  |
+|-------|--------|-------------------------------------|
+| label | Label 名 | 字符串                                 |
+| field | 域名     | 字符串                                 |
+| type  | 索引类型   | int类型，0表示非唯一索引，1表示全局唯一索引，2表示两点间唯一索引 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.列出所有索引
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.列出所有与某个 Label 相关的索引
+
+- **URI**: `/db/{graph_name}/index/{label}`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.删除索引
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.根据索引获取点
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+- **METHOD**: GET
+- **RESPONSE**: 点 vid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+### 6.10.在线增量导入
+
+#### 6.10.1.指定文件内容导入
+
+- **URI**: `/db/{graph_name}/import/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+  | data | 要导入的文件内容（建议最大在 16MB 左右，最长不超过 17MB） | 字符串 / 数组 / 对象 |
+  | continue_on_error | 出错后是否继续导入（可选，默认为`false`
+  ） | 布尔值 |
+  | delimiter | 分隔符（可选，默认为`“,”`
+  ） | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+分隔符可以是单字符，也可以是字符串，但不能包含`\r`或者`\n`。
+
+data 可以是如下形式之一：
+
+- 字符串如 `"1,2\n3,4\n"`
+- ASCII 码组成的数组如 `[49,44,50,10,51,44,52,10]`
+- 形如上述数组的字典如 `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+- **RESPONSE**:
+
+系统**不会**自动执行新建 label、添加索引等操作。在此操作之前需要保证涉及的 label 已经存在并具有适当的索引。
+
+如果成功导入完毕，返回代码 200，并在 `log` 字段返回一些日志信息（可能为空）；否则，保证所有的数据均未被导入，并在 `error_message` 字段返回错误信息。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true,
+      "delimiter": ","
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+由于请求中指定了在出错时继续，该返回信息说明 SRC_ID 为 1 的边没有被导入，而其他信息导入成功。
+
+### 6.11.其他
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.提取子图
+
+给出点 id 集合，返回包含该集合的最小子图。
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | vertex_ids | 点 id 集合 | 列表 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | nodes | 点数据 | 列表，每元素包含 vid, label, 以及属性 |
+  | relationships | 边数据 | 列表，每元素包含 src, dst, euid, label, 以及属性 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example response.**
+
+```
+• 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..f35f8d98d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+客户端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..dc6a25ef0c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/8.query/1.cypher.md
@@ -0,0 +1,2351 @@
+# Cypher API
+
+> 此文档主要介绍了TuGraph-Cypher的详细使用说明
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators支持进度一览：
+
+| 类别                                 | 支持                                                                                                        | 待支持                             |
+| ------------------------------------ | ----------------------------------------------------------------------------------------------------------- | ---------------------------------- |
+| General operators                    | `DISTINCT`, `.` for property access                                                                     | `[]` for dynamic property access |
+| Mathematical operators               | `+`, `-`, `*`, `/`, `%`, `^`                                                                    |                                    |
+| Comparison operators                 | `=`, `<>`, `<`, `>`, `<=`, `>=`, `IS NULL`, `IS NOT NULL`                                   |                                    |
+| String-specific comparison operators | `STARTS WITH`, `ENDS WITH`, `CONTAINS`, `REGEXP`                                                    |                                    |
+| Boolean operators                    | `AND`, `OR`, `XOR`, `NOT`                                                                           |                                    |
+| String operators                     | `+` for concatenation                                                                                     |                                    |
+| List operators                       | `+` for concatenation, `IN` to check existence of an element in a list, `[]` for accessing element(s) |                                    |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+```
+MATCH (p:person) RETURN DISTINCT p.born
+```
+
+- ❏ Accessing properties of a nested literal map using the `.` operator
+
+```
+WITH {person: {name: 'Anne', age: 25}} AS p
+RETURN p.person.name
+```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+
+```
+CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+       (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+       (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+```
+
+```
+MATCH (restaurant:Restaurant), (category:Category)
+WHERE restaurant["rating_" + category.name] > 6
+RETURN DISTINCT restaurant.name
+```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator  `^`
+
+```
+WITH 2 AS number, 3 AS exponent
+RETURN number ^ exponent AS result
+```
+
+- ✓ Using the unary minus operator `-`
+
+```
+WITH -3 AS a, 4 AS b
+RETURN b - a AS result
+```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+
+```
+WITH 4 AS one, 3 AS two
+RETURN one > two AS result
+```
+ 
+### 1.5.String-specific comparison operators
+
+- ✓ Using STARTS WITH to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate STARTS WITH 'Jo'
+RETURN candidate
+```
+
+- ✓ Using REGEXP to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate REGEXP 'Jo.*n'
+RETURN candidate
+```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+```
+WITH [2, 4, 7, 9, 12] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number = 4 OR (number > 6 AND number < 10)
+RETURN number
+```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+
+```
+RETURN [1,2,3,4,5]+[6,7] AS myList
+```
+
+- ✓ Using IN to check if a number is in a list
+
+```
+WITH [2, 3, 4, 5] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number IN [2, 3, 8]
+RETURN number
+```
+
+- ✓ Accessing elements in a list using the [] operator
+
+```
+WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+RETURN names[1..3] AS result
+```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses支持进度一览：
+
+| 类别                    | 语法                                  | 备注   |
+| ----------------------- | ------------------------------------- | ------ |
+| Reading clauses         | MATCH                                 | 支持   |
+|                         | OPTIONAL MATCH                        | 支持   |
+|                         | MANDATORY MATCH                       | 待支持 |
+| Projecting clauses      | RETURN … [AS]                        | 支持   |
+|                         | WITH … [AS]                          | 支持   |
+|                         | UNWIND … [AS]                        | 支持   |
+| Reading sub-clauses     | WHERE                                 | 支持   |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | 支持   |
+|                         | SKIP                                  | 支持   |
+|                         | LIMIT                                 | 支持   |
+| Writing clauses         | CREATE                                | 支持   |
+|                         | DELETE                                | 支持   |
+|                         | DETACH DELETE                         | 支持   |
+|                         | SET                                   | 支持   |
+|                         | REMOVE                                | 支持   |
+| Reading/Writing clauses | MERGE                                 | 支持   |
+|                         | CALL […YIELD]                        | 支持   |
+| Set operations          | UNION                                 | 待支持 |
+|                         | UNION ALL                             | 支持   |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+
+  ```
+  MATCH (n)
+  RETURN n
+  ```
+
+  - ✓ Get all nodes with a label
+
+  ```
+  MATCH (movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Related nodes
+
+  ```
+  MATCH (person {name: 'Laurence Fishburne'})-[]-(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Match with labels
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]-(movie:movie)
+  RETURN movie.title
+  ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]->(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Directed relationships and variable
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[r]->(movie)
+  RETURN type(r)
+  ```
+
+  - ✓ Match on relationship type
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})<-[:acted_in]-(actor)
+  RETURN actor.name
+  ```
+
+  - ✓ Match on multiple relationship types
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[:acted_in|:directed]-(person)
+  RETURN person.name
+  ```
+
+  - ✓ Match on relationship type and use a variable
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[r:acted_in]-(actor)
+  RETURN r.role
+  ```
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+
+  ```
+  MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+  RETURN type(r)
+  ```
+
+  - ✓ Multiple relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in]->(movie)<-[:directed]-(director)
+  RETURN movie.title, director.name
+  ```
+
+  - ✓ Variable-length relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in*1..3]-(movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Relationship variable in variable-length relationships
+
+  ```
+  MATCH p = (laurence {name: 'Laurence Fishburne'})-[:acted_in*2]-(co_actor)
+  RETURN p
+  ```
+
+  - ❏ Match with properties on a variable-length path
+
+  ```
+  MATCH p = (charlie:person)-[* {blocked:false}]-(martin:person)
+  WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+  RETURN p
+  ```
+
+  - ✓ Zero-length paths
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})-[*0..1]-(x)
+  RETURN x
+  ```
+
+  - ✓ Named paths
+
+  ```
+  MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+  ```
+
+  - ✓ Matching on a bound relationship
+
+  ```
+  MATCH (a)-[r]->(b)
+  WHERE euid(r)="0_3937_0_0_0"
+  RETURN a,b
+  ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+  CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+  ```
+
+  - ✓ All shortest paths
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+  CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN
+  nodeIds,relationshipIds,cost
+  ```
+- Get node or relationship by id
+
+  - ✓ Node by id
+
+  ```
+  MATCH (n)
+  WHERE id(n)= 0
+  RETURN n
+  ```
+
+  - ✓ Relationship by id
+
+  ```
+  MATCH ()-[r]->()
+  WHERE euid(r) = "0_3937_0_0_0"
+  RETURN r
+  ```
+
+  - ✓ Multiple nodes by id
+
+  ```
+  MATCH (n)
+  WHERE id(n) IN [0, 3, 5]
+  RETURN n
+  ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n
+```
+
+- ✓ Return relationships
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'})-[r:acted_in]->(c)
+RETURN r
+```
+
+- ✓ Return property
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n.born
+```
+
+- ❏ Return all elements
+
+```
+MATCH p = (a {name: 'A'})-[r]->(b)
+RETURN *
+```
+
+- ❏ Variable with uncommon characters
+
+```
+MATCH (`This isn\'t a common variable`)
+WHERE `This isn\'t a common variable`.name = 'A'
+RETURN `This isn\'t a common variable`.happy
+```
+
+- ✓ Aliasing a field
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born AS SomethingTotallyDifferent
+```
+
+- ✓ Optional properties
+
+```
+MATCH (n)
+RETURN n.age
+```
+
+- ❏ Other expressions
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born > 1900, "I'm a literal", (a)-[]->()
+```
+
+`(a)-[]->()`  not supported.
+
+- ✓ Unique results
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})-[]->(b)
+RETURN DISTINCT b
+```
+
+### 2.4.WHERE
+
+- Basic usage
+  - ✓ Boolean operations
+
+  ```
+  MATCH (n)
+  WHERE n.name = 'Laurence Fishburne' XOR (n.born > 1965 AND n.name = 'Carrie-Anne Moss')
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node label
+
+  ```
+  MATCH (n)
+  WHERE n:person
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node property
+
+  ```
+  MATCH (n)
+  WHERE n.born > 2000
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on relationship property
+
+  ```
+  MATCH (n)-[k:acted_in]->(f)
+  WHERE k.role = "Trinity"
+  RETURN f.title
+  ```
+
+  - ❏ Filter on dynamically-computed property
+
+  ```
+  WITH 'AGE' AS propname
+  MATCH (n)
+  WHERE n[toLower(propname)]< 30
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Property existence checking
+
+  ```
+  MATCH (n)
+  WHERE exists(n.born)
+  RETURN n.name, n.born
+  ```
+
+- String matching
+  - ✓ Match the beginning of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name STARTS WITH 'Pet'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match the ending of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name ENDS WITH 'ter'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match anywhere within a string
+
+  ```
+  MATCH (n)
+  WHERE n.name CONTAINS 'ete'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ String matching negation
+
+  ```
+  MATCH (n)
+  WHERE NOT n.name ENDS WITH 's'
+  RETURN n.name, n.born
+  ```
+
+- Using path patterns in `WHERE`
+  - ❏ Filter on patterns
+
+  ```
+  MATCH (tobias {name: 'Tobias'}), (others)
+  WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+  RETURN others.name, others.age
+  ```
+
+  - ❏ Filter on patterns using NOT
+
+  ```
+  MATCH (persons), (peter {name: 'Peter'})
+  WHERE NOT (persons)-[]->(peter)
+  RETURN persons.name, persons.age
+  ```
+
+  - ❏ Filter on patterns with properties
+
+  ```
+  MATCH (n)
+  WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Filter on relationship type
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name='Laurence Fishburne' AND type(r) STARTS WITH 'ac'
+  RETURN type(r), r.role
+  ```
+
+- Lists
+  - ✓ IN operator
+
+  ```
+  MATCH (a)
+  WHERE a.name IN ['Laurence Fishburne', 'Tobias']
+  RETURN a.name, a.born
+  ```
+
+- Missing properties and values
+  - ✓ Default to false if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white'
+  RETURN n.name, n.age, n.belt
+  ```
+
+  - ✓ Default to true if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+  ORDER BY n.name
+  ```
+
+  - ✓ Filter on null
+
+  ```
+  MATCH (person)
+  WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+  person.belt
+  ```
+
+- Using ranges
+  - ✓ Simple range
+
+  ```
+  MATCH (a)
+  WHERE a.name >= 'Peter'
+  RETURN a.name, a.born
+  ```
+
+  - ✓ Composite range
+
+  ```
+  MATCH (a)
+  WHERE a.name > 'Andres' AND a.name < 'Tobias'
+  RETURN a.name, a.born
+  ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 3
+```
+
+- ✓ Return middle two records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 1
+LIMIT 2
+```
+
+- ❏ Using an expression with SKIP to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP toInteger(3*rand())+ 1
+```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT 3
+```
+
+- ❏ Using an expression with LIMIT to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT toInteger(3 * rand())+ 1
+```
+
+### 2.7.CREATE
+
+- Create nodes
+
+> **Note**
+> TuGraph不支持创建空的nodes，不支持多labels。
+
+  - ☒ Create single node
+
+  ```
+  CREATE (n)
+  ```
+
+  - ☒ Create multiple nodes
+
+  ```
+  CREATE (n), (m)
+  ```
+
+  - ☒ Create a node with a label
+
+  ```
+  CREATE (n:person)
+  ```
+
+  - ☒ Create a node with multiple labels
+
+  ```
+  CREATE (n:Person:Swedish)
+  ```
+
+  - ✓ Create node and add labels and properties
+
+  ```
+  CREATE (n:person {id:2001, name: 'Andres'})
+  ```
+
+  - ✓ Return created node
+
+  ```
+  CREATE (n:person {id:2002, name: 'Andres'})
+  RETURN n
+  ```
+
+- Create relationships
+  - ✓ Create a relationship between two nodes
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:write]->(m)
+  ```
+
+  - ✓ Create a relationship and set properties
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:acted_in{role: 'Trinity'}]->(m)
+  ```
+
+  - ❏ Create a full path
+
+  ```
+  CREATE p = (andres:person {id: 2005, name:'Andres'})-[:acted_in {role: 'Trinity'}]->
+  (m:movie {id: 2006})<-[:acted_in {role: 'Trinity'}]-(michael {id: 2006, name:'Michael'})
+  RETURN p
+  ```
+
+- Use parameters with CREATE
+  - ❏ Create node with a parameter for the properties
+
+  ```
+  CREATE (n:Person $props)
+  RETURN n
+  ```
+
+  - ☒ Create multiple nodes with a parameter for their properties
+
+  ```
+  UNWIND $props AS map
+  CREATE (n)
+  SET n = map
+  ```
+  cannot create vertex without label.
+
+### 2.8.CALL[…YIELD]
+
+- ✓ Call a procedure using CALL
+
+```
+CALL db.vertexLabels
+```
+
+- ✓ View the signature for a procedure
+
+```
+CALL dbms.procedures() YIELD name, signature
+RETURN signature
+```
+
+- ❏ Call a procedure using a quoted namespace and name
+
+```
+CALL `db`.`vertexLabels`
+```
+
+- ✓ Call a procedure with literal arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+```
+
+- ❏ Call a procedure with parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+```
+
+- ❏ Call a procedure with mixed literal and parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+```
+
+- ✓ Call a procedure with literal and default arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+```
+
+- ✓ Call a procedure within a complex query using CALL…YIELD
+
+```
+CALL db.vertexLabels() YIELD label
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure and filter its results
+
+```
+CALL db.vertexLabels() YIELD label
+WHERE label CONTAINS 'User'
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure within a complex query and rename its outputs
+
+```
+CALL db.propertyKeys() YIELD propertyKey AS prop
+MATCH (n)
+WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+
+```
+MATCH (n:person)
+RETURN n.name AS name
+UNION ALL MATCH (n:movie)
+RETURN n.title AS name
+```
+
+- ❏ Combine two queries and remove duplicates
+
+```
+MATCH (n:Actor)
+RETURN n.name AS name
+UNION
+MATCH (n:Movie)
+RETURN n.title AS name
+```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| 种类                   | 功能               | 备注                      |
+| ---------------------- |------------------| ------------------------- |
+| Predicate functions    | exists()         |                           |
+|                        | all()            | 不支持                    |
+|                        | any()            | 不支持                    |
+|                        | single()         | 不支持                    |
+|                        | none()           | 不支持                    |
+| Scalar functions       | id()             |                           |
+|                        | euid()           |                           |
+|                        | properties()     |                           |
+|                        | head()           |                           |
+|                        | last()           |                           |
+|                        | toBoolean()      |                           |
+|                        | toFloat()        |                           |
+|                        | toInteger()      |                           |
+|                        | toString()       |                           |
+|                        | type()           |                           |
+|                        | startnode()      |                           |
+|                        | endnode()        |                           |
+|                        | size()           |                           |
+|                        | length()         |                           |
+|                        | substring()      |                           |
+|                        | concat()         |                           |
+|                        | label()          | OpenCypher扩展方法      |
+| Aggregating functions  | avg()            |                           |
+|                        | collect()        |                           |
+|                        | count()          |                           |
+|                        | max()            |                           |
+|                        | min()            |                           |
+|                        | percentileCont() |                           |
+|                        | percentileDisc() |                           |
+|                        | stDev()          |                           |
+|                        | stDevP()         |                           |
+|                        | variance()       |                           |
+|                        | varianceP()      |                           |
+|                        | sum()            |                           |
+| List functions         | keys()           |                           |
+|                        | labels()         | 返回结果有且只有一个label |
+|                        | nodes()          |                           |
+|                        | range()          |                           |
+|                        | subscript()      | 不支持                    |
+| Mathematical functions | abs()            |                           |
+|                        | ceil()           |                           |
+|                        | floor()          |                           |
+|                        | rand()           |                           |
+|                        | round()          |                           |
+|                        | sign()           |                           |
+| String functions       | /                |                           |
+
+### 3.2.Predicate functions
+
+- exists()
+  judge it whether a vertex or edge has the field  .
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+WHERE exists(n.born)
+RETURN n.name, n.born
+```
+
+**Example output:**
+
+| exists(name) |
+| ------------ |
+| true         |
+
+### 3.3.Scalar functions
+
+- id()
+  get the id of vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN id(a)
+```
+
+**Example output:**
+
+| vid |
+| --- |
+| 1   |
+| 2   |
+| ... |
+
+- properties()
+  get  a map containing all the properties of a node or relationship.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person {name: 'Laurence Fishburne'})
+RETURN n
+```
+
+- head()
+  get the first element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, head(coll)
+```
+
+**Example output:**
+
+| coll                  | head(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "one"         |
+
+- last()
+  get the last element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, last(coll)
+```
+
+**Example output:**
+
+| coll                  | last(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "three"       |
+
+- toFloat()
+  Converts an integer or string value to a floating point number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toFloat('11.5')
+```
+
+**Example output:**
+
+| float |
+| ----- |
+| 11.5  |
+
+- toInteger()
+  Converts a floating point or string value to an integer value.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toInteger('2.3') AS integer
+```
+
+**Example output:**
+
+| integer |
+| ------- |
+| 2       |
+
+- toString()
+  Converts an integer, float, boolean value to a string.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toString(2.3)
+```
+
+- type()
+  get the string representation of the relationship type.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)-[r]->()
+WHERE n.name = 'Laurence Fishburne'
+RETURN type(r)
+```
+
+**Example output:**
+
+| type     |
+| -------- |
+| acted_in |
+| acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+  Returns the average of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN avg(n.born)
+```
+
+**Example output:**
+
+| avg(n.born)        |
+| ------------------ |
+| 1869.2661654135338 |
+
+- collect()
+  Returns a list containing the values returned by an expression.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN collect(n.born)
+```
+
+**Example output:**
+
+| collect(n.born) |
+| --------------- |
+| [1967,...]      |
+
+- count()
+  Returns the number of values or records.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n {name: 'Laurence Fishburne'})-[]->(x)
+RETURN labels(n), n.born, count(*)
+```
+
+**Example output:**
+
+| labels(n)  | n.born | count(*) |
+| ---------- | ------ | -------- |
+| ["person"] | 1961   | 3        |
+
+- max()
+  Returns the maximum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN max(n.born)
+```
+
+**Example output:**
+
+| max(n.born) |
+| ----------- |
+| 2003        |
+
+- min()
+  Returns the minimum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN min(n.born)
+```
+
+**Example output:**
+
+| min(n.born) |
+| ----------- |
+| 1000        |
+
+- percentileCont()
+  Returns the percentile of a value over a group using linear interpolation.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileCont(n.born, 0.4)
+```
+
+**Example output:**
+
+| percentileCont(n.born, 0.4) |
+| --------------------------- |
+| 1953                        |
+
+- percentileDisc()
+  Returns the nearest value to the given percentile over a group using a rounding method.
+  **Scope:** whole instance.
+  **Output:** the percentile of the given value over a group.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileDisc(n.born, 0.5)
+```
+
+**Example output:**
+
+| percentileDisc(n.age, 0.5) |
+| -------------------------- |
+| 1959                       |
+
+- stDev()
+  Returns the standard deviation for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDev(n.born)
+```
+
+**Example output:**
+
+| stDev(n.born)      |
+| ------------------ |
+| 279.53117993401725 |
+
+- stDevP()
+  Returns the standard deviation for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDevP(n.born)
+```
+
+**Example output:**
+
+| stDevP(n.born)     |
+| ------------------ |
+| 279.3209270423399  |
+
+- variance()
+  Returns the variance for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN variance(n.born)
+```
+
+**Example output:**
+
+| variance(n.age)   |
+| ----------------- |
+| 78137.68055530392 |
+
+- varianceP()
+  Returns the variance for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN varianceP(n.born)
+```
+
+**Example output:**
+
+| varianceP(n.age)  |
+| ----------------- |
+| 78020.18028379219 |
+
+- sum()
+  Returns the sum of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN sum(n.born)
+```
+
+**Example output:**
+
+| sum(n.born) |
+| ----------- |
+| 1243062     |
+
+### 3.5.List Funtions:
+
+- keys()
+  get the field names of some vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN keys(a) LIMIT 1
+```
+
+**Example output:**
+
+| keys(a)               |
+| --------------------- |
+| ["name","age","eyes"] |
+
+- labels()/label()
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN labels(a) LIMIT 1
+```
+
+**Example output:**
+
+| labels                 |
+| ---------------------- |
+| ["Person"]             |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice"})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+
+### 3.6.Mathematical functions
+
+- abs()
+  get the absolute value of some data.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a:person {name: 'Laurence Fishburne'}),
+(e:person {name: 'Carrie-Anne Moss'})
+RETURN a.born, e.born, abs(a.born-e.born)
+```
+
+**Example output:**
+
+| a.born | e.born | abs(a.born - e.born) |
+| ------ | ------ | -------------------- |
+| 38     | 41     | 1                    |
+
+- ceil()
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN ceil(0.1)
+```
+
+**Example output:**
+
+| ceil(0.1) |
+| --------- |
+| 1.0       |
+
+- floor()
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN floor(0.9)
+```
+
+**Example output:**
+
+| floor(0.9) |
+| ---------- |
+| 0.0        |
+
+- round()
+  Returns the value of a number rounded to the nearest integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN round(3.141592)
+```
+
+**Example output:**
+
+| round |
+| ----- |
+| 3     |
+
+- rand()
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN rand()
+```
+
+**Example output:**
+
+| rand()             |
+| ------------------ |
+| 0.9797131960534085 |
+
+- sign()
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN sign(-17), sign(0.1)
+```
+
+**Example output:**
+
+| sign(-17) | sign(0.1) |
+| --------- | --------- |
+| -1        | 1         |
+
+TuGraph 查询语言与 OpenCypher 的不同点如下：
+
+- Label 数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 4.附录1. 语法扩充及不同
+
+TuGraph查询语言与OpenCypher的不同点如下：
+
+- Label数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.附录2. 内置procedures列表
+### 5.1.procedures样例
+
+* dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                        | name         |
+  | ---------------------------------------------------- | -------------------- |
+  | db.vertexLabels() :: (label::STRING)               | db.vertexLabels        |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels |
+  | db.indexes() :: (index::LIST)            | db.indexes       |
+  | ...                          | ...          |
+
+* db.subgraph()
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | vids       | list           | list of vertex id                                                     |
+
+  **Output:**
+
+  Get a json containing all the properties of nodes and relationships.
+
+  **Example input:**
+
+  ```
+  CALL db.subgraph([3937,4126,4066,4010])
+  ```
+
+  **Example output**
+
+  | subgraph |
+  | -------- |
+  | {"nodes":[{"identity":3937,"label":"movie","properties":{"duration":136,"id":1,"poster_image":"http://image.tmdb.org/t/p/w185/gynBNzwyaHKtXqlEKKLioNkjKgN.jpg","rated":"R","summary":"Thomas A. Anderson is a man living two lives. By day he is an average computer programmer and by night a malevolent hacker known as Neo who finds himself targeted by the police when he is contacted by Morpheus a legendary computer hacker who reveals the shocking truth about our reality.","tagline":"Welcome to the Real World.","title":"The Matrix"}},{"identity":4010,"label":"user","properties":{"id":44,"login":"Howard"}},{"identity":4066,"label":"user","properties":{"id":202,"login":"Enoch"}},{"identity":4126,"label":"user","properties":{"id":464,"login":"Wilburn"}}],"relationships":[{"dst":4126,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4010,"temporal_id":0},{"dst":4010,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4066,"temporal_id":0},{"dst":4066,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4126,"temporal_id":0}]} |
+
+* db.vertexLabels()
+
+  Lists all available vertex labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+  **Example output:**
+
+    | label   |
+    | ------- |
+    | genre   |
+    | keyword |
+    | movie   |
+    | ...     |
+
+* db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edge labels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | relationshipType |
+  | ---------------- |
+  | acted_in     |
+  | directed     |
+  | ...          |
+
+* db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of  vertex label    |
+  | primary_field | string  | primary field of vertex label |
+  | field_spec | list       | specification of a field |
+
+   in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+    **Output:** If successful, it returns a success message.
+
+    **Example input:**
+
+    ```
+    CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+    ```
+
+    **Example output:**
+
+    ```
+    Added label [Person]
+    ```
+
+* db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description           |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field         |
+  | type       | string     | type of the field         |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name     | type   | optional |
+  | ------------ | ------ | -------- |
+  | id       | INT32  | false    |
+  | born     | INT32  | true     |
+  | name     | STRING | true     |
+  | poster_image | STRING | true     |
+
+* db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | extra      | string     | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.
+    for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+* db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:**
+
+  | field_name | field_type | description              |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description           |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string      | either 'vertex' or 'edge'     |
+  | label_name  | string      | name of the label         |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description           |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string     | either 'vertex' or 'edge' |
+  | label_name       | string     | name of the label     |
+  | field_value_spec | list       | specification of a field  |
+
+    in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, optional]`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+    ```
+    CALL db.alterLabelModFields(
+    'vertex',
+    'new_label',
+    ['birth_date', DATETIME, true],
+    ['gender', BOOL, true])
+    ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of the label    |
+  | edge_constraints | string | edge constraints |
+  | field_spec | list       | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for  optional fields.
+
+  `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+* db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+
+   **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+   **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+* db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+  | pair_unique | boolean    | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+* dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description      |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string     | the current password |
+  | new_password     | string     | new password     |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+   **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string     | the user's name |
+  | new_password | string     | new password    |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.createUser(user_name, password)
+
+  create  new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | -------------------------------- |
+  | user_name | string     | the new user name        |
+  | password  | string     | the password of new user     |
+  
+   **Output:**
+  
+    If successful, it returns a success message.
+  
+   **Example input:**
+  
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+  
+   **Example output:**
+  
+  ```
+  true
+  ```
+  
+* dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string     | the user name to be deleted |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+   a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string     | the user name           |
+  | is.admin  | boolean    | the permission of this user |
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       |  ...    |
+
+* dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+    a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description       |
+  | --------- | -------------- | --------------------- |
+  | user.user | string     | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+* dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+   a list of  ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host     |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...      |
+
+* dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+   the number of ip which been deleted.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+    the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description              |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string     | the name of new subgraph     |
+  | description | string     | description of new subgraph      |
+  | max_size_GB | integer    | Upper limit of subgraph capacity |
+
+   **Output:**
+
+    if successful , it will return true.
+
+   **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+   **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+  | config     | map        | the configuration to be modified     |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.listGraphs()
+
+  get all subgraphs in this graph database.
+
+  **Output:**
+
+    a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+
+* dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+    | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+* dbms.config.list()
+
+  get config of this graph database.
+
+  **Output:**
+
+    a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  |-----------| ---------|
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       |  ...    |
+
+* dbms.config.update(updates)
+
+  get some config of this graph database.
+
+  **Output:**
+
+    If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+    enable_ip_check:false,
+    durable:true,
+    optimistic_txn:true,
+    enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+* dbms.takeSnapshot()
+
+  take the  snapshot  on this current graph database.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+* dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path               |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+* algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                          |
+  | --------- | -------------- | ------------------------------------------------------------ |
+  | startNode | Node       | the source node of paths                     |
+  | endNode   | Node       | the destination node paths                   |
+  | config    | MAP        | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+    If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2     | 1     |
+
+* algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+* algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                        |
+  | --------- | -------------- | ---------------------------------------------------------- |
+  | id    | ANY        | the id of vertexes or edges , the id must be variable      |
+  | config    | MAP        | the configuration of  this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or  it is an edge id.
+
+  **Output:**
+
+    If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.内置procedures完整列表
+
+| Name                                  | Description                        | Signature                                                                                                                                                                               |
+|---------------------------------------|------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.subgraph                           | 列出点的子图                             | db.subgraph(vids::LIST) :: (subgraph::STRING)                                                                                                                                           |
+| db.vertexLabels                       | 列出所有Vertex Label                   | db.vertexLabels() :: (label::STRING)                                                                                                                                                    |
+| db.edgeLabels                         | 列出所有Edge Label                     | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                 |
+| db.indexes                            | 列出所有索引                             | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                    |
+| db.listLabelIndexes                   | 列出所有与某个Label相关的索引               | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                          |
+| db.warmup                             | 预热数据                               | db.warmup() :: (time_used::STRING)                                                                                                                                                      |
+| db.createVertexLabel                  | 创建Vertex Label                     | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                  |
+| db.createLabel                        | 创建Vertex/Edge Label                | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                             |
+| db.getLabelSchema                     | 列出label schema                     | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                               |
+| db.getVertexSchema                    | 列出点的 schema                        | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                      |
+| db.getEdgeSchema                      | 列出边的 schema                        | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                        |
+| db.deleteLabel                        | 删除Vertex/Edge Label                | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                       |
+| db.alterLabelDelFields                | 修改label删除属性                        | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                            |
+| db.alterLabelAddFields                | 修改label添加field                     | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                 |
+| db.alterLabelModFields                | 修改label field                      | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                       |
+| db.createEdgeLabel                    | 创建Edge Label                       | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                     |
+| db.addIndex                           | 创建索引                               | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                          |
+| db.addEdgeIndex                       | 创建索引                               | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                 |
+| db.deleteIndex                        | 删除索引                               | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                       |
+| db.backup                             | 备份数据                               | db.backup(destination::STRING) :: ()                                                                                                                                                    |
+| dbms.procedures                       | 列出所有procedures                     | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                   |
+| dbms.security.changePassword          | 更改当前用户的密码                          | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                 |
+| dbms.security.changeUserPassword      | 更改指定用户的密码                          | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.createUser              | 创建用户                               | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                |
+| dbms.security.deleteUser              | 删除用户                               | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.listUsers               | 列出所有用户                             | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                         |
+| dbms.security.showCurrentUser         | 列出当前用户信息                           | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                               |
+| dbms.security.getUserPermissions      | 列出指定用户的权限                          | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                 |
+| dbms.graph.createGraph                | 创建子图                               | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                       |
+| dbms.graph.modGraph                   | 修改子图属性                             | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                         |
+| dbms.graph.deleteGraph                | 删除子图                               | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.graph.listGraphs                 | 列出所有子图                             | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                      |
+| dbms.graph.getGraphInfo               | 列出指定子图的信息                          | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                    |
+| dbms.security.addAllowedHosts         | 添加ip到信任列表                          | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                        |
+| dbms.security.deleteAllowedHosts      | 从信任列表删除ip                          | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                             |
+| dbms.security.listAllowedHosts        | 列出信任列表中的主机ip                       | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                      |
+| dbms.config.update                    | 更新TuGraph配置                        | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                   |
+| dbms.config.list                      | 列出TuGraph配置                        | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                         |
+| algo.shortestPath                     | 查询两个点间的最短路径                        | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                   |
+| algo.allShortestPaths                 | 查询两个点间的所有最短路径                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                    |
+| algo.native.extract                   | 查询指定VertexId/EdgeUid（列表）指定field的值（列表） | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                |
+| db.flushDB                            | 刷新db                               | db.flushDB() :: (::VOID)                                                                                                                                                                |
+| dbms.security.listRoles               | 列出所有角色                             | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                         |
+| dbms.security.createRole              | 创建角色                               | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                    |
+| dbms.security.deleteRole              | 删除角色                               | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.getRoleInfo             | 获取角色详细信息                           | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                             |
+| dbms.security.disableRole             | 禁用/启用角色                            | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.modRoleDesc             | 修改角色描述信息                           | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.rebuildRoleAccessLevel  | 删除角色权限并重建                          | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                        |
+| dbms.security.modRoleAccessLevel      | 修改角色对指定图的访问权限                      | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                            |
+| dbms.security.modRoleFieldAccessLevel | 修改角色对指定属性的访问权限                     | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                 |
+| dbms.security.getUserInfo             | 获取用户详细信息                           | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                             |
+| dbms.security.disableUser             | 禁用/启用用户                            | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.setCurrentDesc          | 设置当前用户描述信息                         | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                           |
+| dbms.security.setUserDesc             | 设置用户描述信息                           | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.getUserMemoryUsage      | 获取用户内存用量                           | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                               |
+| dbms.security.setUserMemoryLimit      | 设置用户内存限制                           | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                         |
+| dbms.security.deleteUserRoles         | 删除用户与角色的联系                         | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.rebuildUserRoles        | 清空用户角色的关系并重建                       | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                    |
+| dbms.security.addUserRoles            | 新增用户与角色的联系                         | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                        |
+| db.plugin.loadPlugin                  | 装载plugin                           | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN,version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | 删除plugin                           | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                             |
+| db.plugin.listPlugin                  | 列出已装载的plugin                       | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | 获取plugin的详细信息                      | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                          |
+| db.plugin.callPlugin                  | 执行plugin                           | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                    |
+| db.importor.dataImportor              | 导入点或边数据                            | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                             |
+| db.importor.schemaImportor            | 导入点或边schema                        | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                             |
+| db.addFullTextIndex                   | 添加全文索引                             | db.addFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                             |
+| db.deleteFullTextIndex                | 删除全文索引                             | db.deleteFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                          |
+| db.rebuildFullTextIndex               | 重建全文索引                             | db.rebuildFullTextIndex(vertex_labels::STRING, edge_labels::STRING) :: (::VOID)                                                                                                         |
+| db.fullTextIndexes                    | 查看全文索引                             | db.fullTextIndexes() :: (is_vertex::BOOLEAN, label::STRING, field::STRING)                                                                                                              |
+| dbms.meta.count                       | 查看点边总数                             | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                 |
+| dbms.meta.countDetail                 | 查看点边总数详情                           | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                       |
+| dbms.meta.refreshCount                | 重新统计点边数量，统计期间停写。                   | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                 |
+| dbms.task.listTasks                   | 查询正在执行的任务                          | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                    |
+| dbms.task.terminateTask               | 中止任务                               | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                      |
+| dbms.ha.clusterInfo                   | HA模式下查看集群状态                        | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                       |
+| db.dropDB                             | 清空数据库                              | db.dropDB() :: (::VOID)                                                                                                                                                                 |
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/8.query/2.gql.md
new file mode 100644
index 0000000000..a5234f46aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/8.query/2.gql.md
@@ -0,0 +1,388 @@
+# ISO GQL
+
+
+## 1.GQL简介
+Graph Query Language(GQL, 图查询语言)是一种国际标准语言，用于属性图查询，该语言建立在SQL的基础上，并整合了现有的[openCypher、PGQL、GSQL和G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/)语言的成熟思想。目前该标准仍然处于草稿阶段。
+
+TuGraph基于[ISO GQL (ISO/IEC 39075) Antlr4 语法文件](https://github.com/TuGraph-family/gql-grammar)实现了GQL，并做了一些扩展与改造。目前并未完全支持所有的GQL语法，我们会在未来逐步完善。
+
+## 2.Clauses
+
+| 类别                | 子句           |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+### 2.1.MATCH
+
+`MATCH`子句式是GQL最基础的子句，几乎所有查询都是通过 `MATCH`展开。
+
+`MATCH`子句用于指定在图中搜索的匹配模式，用来匹配满足一定条件的点或者路径。
+
+#### 点查询
+
+##### 查询所有点
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### 查询特定标签的点
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### 通过属性匹配点
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### 通过过滤条件匹配点
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 边查询
+
+##### 出边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### 入边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### 带过滤条件的边匹配
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+返回结果
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### 路径匹配
+
+##### 不定跳查询
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+`OPTIONAL MATCH`匹配图模式，如果未命中，则返回`null`。
+
+#### 查询命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### 查询未命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+返回结果
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+`RETURN`子句指定返回结果，包括返回点、边、路径、属性等。
+
+#### 返回点
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### 返回边
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### 返回属性
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 不常见字符串作为变量名
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### 列别名
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### 可选属性
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### 其它表达式
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### 结果唯一性
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+返回结果
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+`NEXT`子句用于连接多个子句。
+
+#### 连接MATCH
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE`子句用于过滤记录。
+
+#### 过滤点
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### 过滤边
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+返回结果
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### 布尔表达式
+
+`AND`, `OR`, `XOR`和 `NOT`布尔表达式可以用在 `WHERE`中用来过滤数据。
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+
+### 2.6.ORDER BY
+
+`ORDER BY`是`RETURN`的子句，对输出的结果进行排序。
+
+#### 对结果排序
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+返回结果
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP`指定结果偏移行数。
+
+#### 未使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### 使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+`LIMIT`限制结果行数。
+
+#### 使用LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/8.query/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/8.query/index.rst
new file mode 100644
index 0000000000..0571c71701
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/8.query/index.rst
@@ -0,0 +1,9 @@
+查询语言
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..1748f19794
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,349 @@
+# Procedure API
+
+> 此文档主要讲解 TuGraph 的存储过程使用说明
+
+## 1.简介
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个请求并在客户端完成整个处理流程的方式，TuGraph 提供的存储过程是更简洁和高效的选择。
+
+与传统数据库类似，TuGraph 的存储过程运行在服务器端，用户通过将处理逻辑（即多个操作）封装到一个过程单次调用，并且可以在实现时通过并行处理的方式（例如使用相关的 C++ OLAP 接口以及基于其实现的内置算法）进一步提升性能。
+
+存储过程中有一类特殊的API来进行数据的并行操作，我们叫 Traversal API，见[文档](2.traversal.md)。
+
+## 2.存储过程的版本支持
+
+目前TuGraph支持两个版本的存储过程，适用于不同的场景，v3.5版本只支持v1，可通过REST或RPC接口直接调用；从v3.5版本开始支持v2，能够在图查询语言（比如Cypher）中嵌入调用，我们称之为POG（Procedure On Graph query language，APOC）。
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+| 适用场景                 | 极致性能，或者复杂的多事务管理情形       | 一般情况，与Cypher高度联动 |
+| 事务                    | 函数内部创建，可自由控制多事务          | 外部传入函数，单一事务     |
+| 签名（参数定义）          | 无                                 | 有                    |
+| 输入输出参数类型          | 不需要指定                           | 需要指定参数类型        |
+| Cypher Standalone Call | 支持                                | 支持                  |
+| Cypher Embeded Call    | 不支持                              | 支持                  |
+| 语言                    | C++/Python/Rust                    | C++                  |
+| 调用模式                 | 直接传字符串，一般为JSON               | 通过Cypher语句中的变量  |
+
+在TuGraph中，存储过程v1和v2单独管理，支持增删查，但仍不建议重名。
+
+## 3.存储过程语言支持
+
+在 TuGraph 中，用户可以动态的加载，更新和删除存储过程。TuGraph 支持 C++ 语言、 Python 语言和 Rust 语言编写存储过程。在性能上 C++ 语言支持的最完整，性能最优。
+
+注意存储过程是在服务端编译执行的逻辑，和客户端的语言支持无关。
+
+## 4.Procedure v1接口
+
+## 4.1.编写存储过程
+
+### 4.1.1.编写C++存储过程
+
+用户可以通过使用 Procedure API 或者 Traversal API 来编写 C 存储过程。一个简单的 C 存储过程举例如下：
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## 统计所有年龄为10的学生数量
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+从代码中我们可以看到，存储过程的入口函数是`Process`函数，它的参数有三个，分别为：
+
+- `db`: 数据库实例
+- `request`: 输入请求数据，可以是二进制字节数组，或者 JSON 串等其它任意格式。
+- `response`: 输出数据，可以是字符串，也可以直接返回二进制数据。
+
+`Process`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误，此时用户可以通过`response`来返回错误信息以方便调试。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`age_10`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 age_10.so，然后用户就可以将它加载到服务器中了。
+
+### 4.1.2.编写Python存储过程
+
+与 C++类似，Python 存储过程也可以调用 core API，一个简单的例子如下：
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+Python 存储过程返回的是一个 tuple，其中第一个元素是一个布尔值，表示该存储过程是否成功执行；第二个元素是一个`str`，里面是需要返回的结果。
+
+Python 存储过程不需要编译，可以直接加载。
+
+## 4.2.如何使用存储过程
+### 4.2.1.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`age_10.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`age_10.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+### 4.2.2.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+### 4.2.6.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
+
+## 5.Procedure v2接口
+
+下面的说明以 REST API 为例，介绍存储过程v2的调用。
+
+### 5.1.编写存储过程
+
+
+用户可以通过使用 lgraph API 来编写 C++ 存储过程。一个简单的 C++ 存储过程举例如下：
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+从代码中我们可以看到：
+- 存储过程定义了一个获取签名的方法`GetSignature`。该方法返回了存储过程的签名，其中包含输入参数名称及其类型，返回参数及其类型。这使得Cypher查询语句在调用存储过程能够利用签名信息校验输入数据以及返回数据是否合理。
+- 入口函数是`ProcessInTxn`函数，它的参数有三个，分别为：
+
+- `txn`: 存储过程所处的事务，通常来说即调用该存储过程的Cypher语句所处事务。
+- `request`: 输入数据，其内容为`GetSignature`中定义的输入参数类型及其Cypher查询语句中传入的值经过json序列化后的字符串。e.g. `{num_iteration: 10}`
+- `response`: 输出数据，为保证在Cypher语言中能够兼容，用户可以通过往`lgraph_api::Result` 写入存储过程处理后的数据，最后用`lgraph_api::Result::Dump`来序列化成json格式的数据。
+
+`ProcessInTxn`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`custom_pagerank`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 custom_pagerank.so，然后用户就可以将它加载到服务器中了。
+
+
+### 5.2.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`custom_pagerank.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`custom_pagerank.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+#### 5.2.1.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+#### 5.2.5.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..9613828c50
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,128 @@
+# Traversal API
+
+> 此文档主要讲解 TuGraph 的存储过程中的Traversal API
+
+## 1. 简介
+
+TuGraph 强大的在线分析处理（OLAP）能力是其区别于其它图数据库的一个重要特性。
+借助 C++ OLAP API（olap_on_db.h），用户可以快速地导出一个需要进行复杂分析的子图，然后在其上运行诸如 PageRank、连通分量、社区发现等迭代式图计算过程，最后根据结果做出相应决策。
+导出和计算的过程都可以通过并行处理的方式进行加速，从而实现几乎实时的分析处理，避免了传统解决方案需要将数据导出、转换、再导入（ETL）到专门的分析系统进行离线处理的冗长步骤。
+
+TuGraph 内置了大量常用的图分析算法和丰富的辅助接口，因此用户几乎不需要自己来实现具体的图计算过程，只需在实现自己的存储过程时将相应算法库的头文件（.h 文件）包含到自己程序中，并在编译时链接相应的动态库文件（.so）即可。
+一般情况下，用户需要自己实现的只有将需要分析的子图抽取出来的过程。
+
+目前 Traversal API 仅支持 C++。
+
+## 2. 接口说明
+
+### 2.1. Snapshot
+
+C++ OLAP API 中的 Snapshot 模版类用于表示抽取出来的静态子图，其中 EdgeData 用来表示该子图上每条边所用权值的数据类型（如果边不需要权值，使用 Empty 作为 EdgeData 即可）。
+
+抽取的子图通过 Snapshot 类的构造函数来描述：
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+其中，db 为数据库句柄，txn 为事务句柄，flags 为生成时使用的选项，可选值包括以下的组合：SNAPSHOT_PARALLEL 表示导出时使用多个线程进行并行；SNAPSHOT_UNDIRECTED 表示需要将导出的图变为无向图。
+vertex_filter 是面向点的用户自定义过滤函数，返回值为 true 表示该点需要被包含到待抽取的子图中，反之则表示需要被排除。
+out_edge_filter 是面向边的用户自定义过滤函数，返回值为 true 表示该边需要被包含到待抽取的子图中，反之则表示需要被排除。
+当过滤函数为缺省值时，则表示需要将所有点/边都包含进来。
+
+Snapshot 类提供的其它方法请参考详细的 C++ API 文档（olap_on_db.h）。
+
+### 2.2. Traversal
+
+图数据库中十分常见的一大类分析是基于一个或多个点出发，逐层地拓展并访问邻居。
+尽管这类分析也可以使用 Cypher 完成，但是当访问的层数较深时，其性能会受到串行解释执行的限制。
+使用 C++ Core API 编写存储过程尽管避免了解释执行，但依然受限于单个线程的处理能力。
+为了让用户能够方便地通过并行处理的方式加速这一类应用场景，我们基于 C++ OLAP API 封装了一个 Traversal 框架，用户可以直接使用其中的 FrontierTraversal 和 PathTraversal 类来完成这种逐层遍历的分析任务，具体的使用方法可以参考相应的 C++ API 文档（lgraph_traversal.h）。
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+该方法可用于找到所有满足条件（filter 返回 true）的点，当 parallel 为 true 时则会并行该查找过程。
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+该方法可用于从指定点集（frontier）中（通过 extract 方法）抽取（类型为 VertexData 的）属性，当 parallel 为 true 时会并行该抽取过程。
+
+FrontierTraversal 适用于只关注遍历扩展到的点集的情况；当用户在遍历过程或是结果中需要访问路径上的信息（路径上的点/边）时，则需要使用 PathTraversal。
+两类 Traversal 的构造函数均有四个参数，分别为数据库句柄 db、事务句柄 txn、选项 flags 和 初始化数组容量 capacity。
+选项的可选值包括以下的组合：TRAVERSAL_PARALLEL 表示遍历时使用多个线程并行；TRAVERSAL_ALLOW_REVISITS 表示遍历时允许重复地访问点（PathTraversal 隐含了该选项）。capacity 表示初始化时路径集合的容量。
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+两类 Traversal 设置遍历的起始点/点集有上述三种方式，前两种通过点 ID 直接指定，最后一种方式则类似于 FindVertices。
+
+两类 Traversal 的遍历都是从当前层的点集合出发，根据使用的扩展函数访问每条出边/入边/出边和入边，通过用户自定义的过滤函数决定扩展是否成功，若成功则将邻居点/追加了该条边的路径加入下一层的点/路径集合。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+上述为 FrontierTraversal 的三种遍历方式，即从当前的点集合出发，对集合中的每个点，依次访问每条出边/入边/出边和入边，若满足用户自定义的过滤条件（其中，edge_filter 为面向边的过滤函数，neighbour_filter 则为面向邻居点的过滤函数），则将邻居点加入新的点集合。
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+当前点集合的扩展结束后，新的点集合可以通过上述方法取得。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+PathTraversal 的三种遍历方式与 FrontierTraversal 类似，只是用户自定义的过滤函数中增加了两个参数，其中：Path 包含了到新扩展的这条边之前的路径，IteratorHelper 可用于将路径中的点/边转为数据库中对应的迭代器，相关文档可参考对应的 C++ API 文档。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.md
new file mode 100644
index 0000000000..1564b445e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.md
@@ -0,0 +1,11605 @@
+
+
+             
+  <section id="c">
+
+<div class="toctree-wrapper compound">
+</div>
+<section id="base64-encode">
+<h2>base64_encode<a class="headerlink" href="#base64-encode" title="永久链接至标题"></a></h2>
+<p>Base64 encode and decode. Simple implementation, to be used with BLOB fields. If performance is important, look for an optimized implementation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_api">
+<span id="_CPPv310lgraph_api"></span><span id="_CPPv210lgraph_api"></span><span id="lgraph_api"></span><span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><a class="headerlink" href="#_CPPv410lgraph_api" title="永久链接至目标"></a><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base64E">
+<span id="_CPPv3N10lgraph_api6base64E"></span><span id="_CPPv2N10lgraph_api6base64E"></span><span id="lgraph_api::base64"></span><span class="target" id="namespacelgraph__api_1_1base64"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6base64E" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="lgraph_api::base64::Encode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1a18e9a89247359b1a4abc31183a17f8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to encode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The encoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="lgraph_api::base64::Encode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1c276e294945b5f438b8ea942692e730"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__cCP.s.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac29334d4c57dcc18603ff6ad813e6cb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ret</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string. </p></li>
+<li><p><strong>ret</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__ssCR.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a970296461b9202f8fb91e56590fb160b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">out</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string to decode. </p></li>
+<li><p><strong>out</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="lgraph_api::base64::Decode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac2d795c4f1fcd79f41e3bb8591c03c81"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="lgraph_api::base64::Decode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ab07cfe3bb273d86861a477a435a7686a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph">
+<h2>lgraph<a class="headerlink" href="#lgraph" title="永久链接至标题"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.LGAPI">
+<span class="target" id="lgraph_8h_1ad89ce29b199ac3372f644ffc910a466a"></span><span class="sig-name descname"><span class="n"><span class="pre">LGAPI</span></span></span><a class="headerlink" href="#c.LGAPI" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12GetSignatureE">
+<span id="_CPPv3N10lgraph_api12GetSignatureE"></span><span id="_CPPv2N10lgraph_api12GetSignatureE"></span><span id="lgraph_api::GetSignature"></span><span class="target" id="namespacelgraph__api_1a0e7238ee4b0e28208b594b2bc334b031"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSignature</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7SigSpecE" title="lgraph_api::SigSpec"><span class="n"><span class="pre">SigSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sig_spec</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12GetSignatureE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7ProcessE">
+<span id="_CPPv3N10lgraph_api7ProcessE"></span><span id="_CPPv2N10lgraph_api7ProcessE"></span><span id="lgraph_api::Process"></span><span class="target" id="namespacelgraph__api_1abc0e7fd5062a22bca6290439450eb245"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Process</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7ProcessE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12ProcessInTxnE">
+<span id="_CPPv3N10lgraph_api12ProcessInTxnE"></span><span id="_CPPv2N10lgraph_api12ProcessInTxnE"></span><span id="lgraph_api::ProcessInTxn"></span><span class="target" id="namespacelgraph__api_1afb8681ba4f3cc04bdc96b9b8ccc17775"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessInTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6ResultE" title="lgraph_api::Result"><span class="n"><span class="pre">Result</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12ProcessInTxnE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-atomic">
+<h2>lgraph_atomic<a class="headerlink" href="#lgraph-atomic" title="永久链接至标题"></a></h2>
+<p>Implementation of atomic operations, used in lgraph_traversal. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api3casEbP1T1T1T">
+<span id="_CPPv3I0EN10lgraph_api3casEP1T1T1T"></span><span id="_CPPv2I0EN10lgraph_api3casEP1T1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab1806f690b319d23b933206cd295f745"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cas</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">ptr</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">oldv</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">newv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_minEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_minEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_minEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1acd8330b393c3cb2b46c461119f4aa484"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_min</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_maxEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_maxEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_maxEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a451eee503d74e69ad9fc6db943ee446f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_max</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_addEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_addEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_addEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab5f65d4fa238b2bc6675bba789e5d635"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_add__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a17b724a3f516c98594033b9cbf7e2dd6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_add__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1ae1334e7bca1be121f4a9099ee1499872"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="lgraph_api::write_add__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1ab7aec34df35e5fe40f87f17cd8384759"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="lgraph_api::write_add__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a4688a3165d87b264a0f0e0d747add460"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_subEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_subEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_subEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a34d077b3ffee356fb73bdc35a7cb8819"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_sub__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a3e0a202ef30dd1729c3671b217c7a0b3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_sub__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1aa321f049db89fbc2c821e62ede09b00e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="lgraph_api::write_sub__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1adc6709b36af7ba0701e624044f2cf9d0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="lgraph_api::write_sub__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a15cf35d73dc33e1a0fad97647beaca63"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-date-time">
+<h2>lgraph_date_time<a class="headerlink" href="#lgraph-date-time" title="永久链接至标题"></a></h2>
+<p>Implemnets the DateTime, Date and TimeZone classes. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="lgraph_api::MinDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a7d4a5022a392e2f121804ec89c1f4819"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="lgraph_api::MaxDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a57143a0e3c25aaa249ec45411aeed284"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Maximum days since epoch for date </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MinMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ace6f22166909871827c64134bc108c4f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MaxMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ae9241a416800bd43775b274c3d68b24a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Maximum microseconds since epoch for date time </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api4DateE"></span><span id="lgraph_api::Date"></span><span class="target" id="classlgraph__api_1_1Date"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4DateE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> class. Range of dates is from 0/1/1 to 12/31/9999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateEv">
+<span id="_CPPv3N10lgraph_api4Date4DateEv"></span><span id="_CPPv2N10lgraph_api4Date4DateEv"></span><span id="lgraph_api::Date::Date"></span><span class="target" id="classlgraph__api_1_1Date_1aff49fc2cda4491ff4457ca481bb8edf9"></span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with the date set to 1970/1/1. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::Date::Date__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1Date_1a1d304cb3d2f5bedd0a4585c4a1e6af70"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified time. The time point must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>tp</strong> – Time point to set the date to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay">
+<span id="_CPPv3N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="_CPPv2N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="lgraph_api::Date::Date__YearMonthDayCR"></span><span class="target" id="classlgraph__api_1_1Date_1ac753f0ab0017908da2e04a5601fbbb02"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymd</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified date. The date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>ymd</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateE7int32_t">
+<span id="_CPPv3N10lgraph_api4Date4DateE7int32_t"></span><span id="_CPPv2N10lgraph_api4Date4DateE7int32_t"></span><span id="lgraph_api::Date::Date__int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1afb34a93316bafa170db694675f3ba391"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateE7int32_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to an offset from epoch, i.e. the date is set to the specified number of days from epoch. The result date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days_since_epoch</strong> – Number of days since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="lgraph_api::Date::Date__ssCR"></span><span class="target" id="classlgraph__api_1_1Date_1aa34be0efffbb041680f06e2e51226b64"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from a YYYY-MM-DD string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if the string is not in the correct format.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>str</strong> – The string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv">
+<span id="_CPPv3NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="_CPPv2NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="lgraph_api::Date::GetYearMonthDayC"></span><span class="target" id="classlgraph__api_1_1Date_1ab2d9b29e32b6adb74401c6d85fd5ffb0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYearMonthDay</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The year month day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateplEi">
+<span id="_CPPv3NK10lgraph_api4DateplEi"></span><span id="_CPPv2NK10lgraph_api4DateplEi"></span><span id="lgraph_api::Date::add-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1ad3fe85f66511da6deb3ca8d54edf51bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateplEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a number of days to the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatepLEi">
+<span id="_CPPv3N10lgraph_api4DatepLEi"></span><span id="_CPPv2N10lgraph_api4DatepLEi"></span><span id="lgraph_api::Date::add-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1a3b36b3e6261a05420139a4eba5eea5dd"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatepLEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a number of days to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Reference to the current date. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DatemiEi">
+<span id="_CPPv3NK10lgraph_api4DatemiEi"></span><span id="_CPPv2NK10lgraph_api4DatemiEi"></span><span id="lgraph_api::Date::sub-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1a54622b3edddecff4df3c9f572a7cdcc5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DatemiEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of days from the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatemIEi">
+<span id="_CPPv3N10lgraph_api4DatemIEi"></span><span id="_CPPv2N10lgraph_api4DatemIEi"></span><span id="lgraph_api::Date::sub-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1aaa15a5d3c4427b09ebb8e2bba5de64b5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatemIEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of days from the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Reference to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateltERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateltERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateltERK4Date"></span><span id="lgraph_api::Date::lt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abf811a8c8e2765b24426cc2ff6fe13f9"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateltERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateleERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateleERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateleERK4Date"></span><span id="lgraph_api::Date::lte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1a3c9beee445a203e18d4a9145132f7b2f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateleERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategtERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategtERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategtERK4Date"></span><span id="lgraph_api::Date::gt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1af35d39c86aa4c554db7e553b09708907"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategtERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategeERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategeERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategeERK4Date"></span><span id="lgraph_api::Date::gte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abd180b0c29b2c846b8d58e2b4c9e822a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategeERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateeqERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateeqERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateeqERK4Date"></span><span id="lgraph_api::Date::eq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1ac8e2b0b0dfb86a868f9d602643a58dae"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateeqERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateneERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateneERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateneERK4Date"></span><span id="lgraph_api::Date::neq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1aec998ec2d30eb9705f995cf55907dae4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateneERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="lgraph_api::Date::DaysSinceEpochC"></span><span class="target" id="classlgraph__api_1_1Date_1aba5994b68821ee6127c84c8134823f8a"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DaysSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api4Date10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api4Date10GetStorageEv"></span><span id="lgraph_api::Date::GetStorageC"></span><span class="target" id="classlgraph__api_1_1Date_1ad8100ffff03d1b59ec5eae1e166b7979"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date10GetStorageEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv7int32_tEv">
+<span id="_CPPv3NK10lgraph_api4Datecv7int32_tEv"></span><span id="_CPPv2NK10lgraph_api4Datecv7int32_tEv"></span><span id="lgraph_api::Date::castto-int32_t-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1acdefe8b0c57d12e7de99a1f168a4f60e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv7int32_tEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date9TimePointEv">
+<span id="_CPPv3NK10lgraph_api4Date9TimePointEv"></span><span id="_CPPv2NK10lgraph_api4Date9TimePointEv"></span><span id="lgraph_api::Date::TimePointC"></span><span class="target" id="classlgraph__api_1_1Date_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date9TimePointEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the timepoint corresponding to this date at 00:00 am. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date8ToStringEv">
+<span id="_CPPv3NK10lgraph_api4Date8ToStringEv"></span><span id="_CPPv2NK10lgraph_api4Date8ToStringEv"></span><span id="lgraph_api::Date::ToStringC"></span><span class="target" id="classlgraph__api_1_1Date_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the string representation of the date in the format of YYYY-MM-DD. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv8DateTimeEv">
+<span id="_CPPv3NK10lgraph_api4Datecv8DateTimeEv"></span><span id="_CPPv2NK10lgraph_api4Datecv8DateTimeEv"></span><span id="lgraph_api::Date::castto-DateTime-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1af6857cebc4d28eb784e6bdbac1fe0ba9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv8DateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object corresponding to 00:00 am on this date. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="lgraph_api::Date::Parse__ssCR.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1aad607a219665901350781e377d7b82ee"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="lgraph_api::Date::Parse__cCP.cCP.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1a7c3a61e8da1dbf48e1b7f2b65550d815"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The result.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 10), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date3NowEv">
+<span id="_CPPv3N10lgraph_api4Date3NowEv"></span><span id="_CPPv2N10lgraph_api4Date3NowEv"></span><span id="lgraph_api::Date::Now"></span><span class="target" id="classlgraph__api_1_1Date_1a3e7d4298fa0246f18cb55d621635b2bc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date3NowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date8LocalNowEv">
+<span id="_CPPv3N10lgraph_api4Date8LocalNowEv"></span><span id="_CPPv2N10lgraph_api4Date8LocalNowEv"></span><span id="lgraph_api::Date::LocalNow"></span><span class="target" id="classlgraph__api_1_1Date_1aac31515c859f4e327724992a762ca42f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date8LocalNowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date17days_since_epoch_E">
+<span id="_CPPv3N10lgraph_api4Date17days_since_epoch_E"></span><span id="_CPPv2N10lgraph_api4Date17days_since_epoch_E"></span><span id="lgraph_api::Date::days_since_epoch___int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1ac7f1cae7e807741a698b319ead8869cc"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">days_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date17days_since_epoch_E" title="永久链接至目标"></a><br></dt>
+<dd><p>The days since epoch </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDayE"></span><span id="lgraph_api::Date::YearMonthDay"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YearMonthDay</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Structure representing a date in the format of year, month and day. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay4yearE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="lgraph_api::Date::YearMonthDay::year__i"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay4yearE" title="永久链接至目标"></a><br></dt>
+<dd><p>The year, 0-9999 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay5monthE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="lgraph_api::Date::YearMonthDay::month__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay5monthE" title="永久链接至目标"></a><br></dt>
+<dd><p>Month, 1-12 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay3dayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="lgraph_api::Date::YearMonthDay::day__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay3dayE" title="永久链接至目标"></a><br></dt>
+<dd><p>Day, 1-31 </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api8DateTimeE"></span><span id="lgraph_api::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimeE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> class that holds <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the range of 0000-01-01 00:00:00.000000 to 9999-12-31 23:59:59.999999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeEv">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeEv"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeEv"></span><span id="lgraph_api::DateTime::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime_1a3e93cd7baeb8b4448482a450df21ab20"></span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the epoch time, i.e., 1970-1-1 00:00:00. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::DateTime::DateTime__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1acf8d529b725b6346cad668a4b7d6f5cf"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified timepoint. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>tp</strong> – Timepoint to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="lgraph_api::DateTime::DateTime__YMDHMSFCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a58680ad139b71f8686734b52e6a4d545"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymdhmsf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in <a class="reference internal" href="#structlgraph__api_1_1DateTime_1_1YMDHMSF"><span class="std std-ref">YMDHMSF</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>ymdhmsf</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and time to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="lgraph_api::DateTime::DateTime__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae5e26b24f48dd42cffd98d526bd74aab"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">microseconds_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to specified number of microseconds since epoch. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>microseconds_since_epoch</strong> – Number of microseconds since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="lgraph_api::DateTime::DateTime__ssCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae891fafda07463e06dbee5b88203da54"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in the form of YYYY-MM-DD HH:MM:SS[.FFFFFF]. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if str has invalid format.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>str</strong> – String representation of the date and time in the form of YYYY-MM-DD HH:MM:SS. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="lgraph_api::DateTime::GetYMDHMSFC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5027ca2fdaa6be6b27f7d4acb2bfabf7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYMDHMSF</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the form of year, month, day, hour, minute, second, fraction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The ymdhmsf. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeplE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimeplE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimeplE7int64_t"></span><span id="lgraph_api::DateTime::add-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5da5a7459ddc40a149081b898ea98951"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeplE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a number of microseconds to the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of micorseconds to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimepLE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimepLE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimepLE7int64_t"></span><span id="lgraph_api::DateTime::add-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5bdd35f5b63bc64bb6af19e96fa9e803"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimepLE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a number of microseconds to the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimemiE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimemiE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimemiE7int64_t"></span><span id="lgraph_api::DateTime::sub-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1afcd73eec42253057720a4a0d140e5eee"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimemiE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimemIE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimemIE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimemIE7int64_t"></span><span id="lgraph_api::DateTime::sub-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5a80be41155d8105875e8a3eb51c2c7b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimemIE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeltERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="lgraph_api::DateTime::lt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a16dffc2ee84f6e10fd3271e9b0cb5306"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeltERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeleERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="lgraph_api::DateTime::lte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a40adc1eacbf9ed88ac1cc35dc3d51f30"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeleERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegtERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="lgraph_api::DateTime::gt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae96fabdd15f3dfd300e7d399b12305bc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegtERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegeERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="lgraph_api::DateTime::gte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1adc2ea02a36b0f48b50f6e863facd20e6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegeERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="lgraph_api::DateTime::eq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a30d73527665a6b136070874aeb9b4c2e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeneERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="lgraph_api::DateTime::neq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac9b0839d6be50242b118d69b0ead3e24"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeneERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="lgraph_api::DateTime::MicroSecondsSinceEpochC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7576b1eff7b32d33fef2cfc541c0d7ae"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MicroSecondsSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetStorageEv"></span><span id="lgraph_api::DateTime::GetStorageC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a92a5a81985fd01aa29a8923985ee350a"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetStorageEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv7int64_tEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="lgraph_api::DateTime::castto-int64_t-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a9223b52f5d6412f67b24aaa89c360d7c"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv7int64_tEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime9TimePointEv">
+<span id="_CPPv3NK10lgraph_api8DateTime9TimePointEv"></span><span id="_CPPv2NK10lgraph_api8DateTime9TimePointEv"></span><span id="lgraph_api::DateTime::TimePointC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime9TimePointEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the timepoint correponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime8ToStringEv">
+<span id="_CPPv3NK10lgraph_api8DateTime8ToStringEv"></span><span id="_CPPv2NK10lgraph_api8DateTime8ToStringEv"></span><span id="lgraph_api::DateTime::ToStringC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of the date and time in the form of YYYY-MM-DD HH:MM:SS.[ffffff] </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv4DateEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv4DateEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv4DateEv"></span><span id="lgraph_api::DateTime::castto-Date-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a8049aeab68ea779547e65cd4b2058bd1"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv4DateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv">
+<span id="_CPPv3N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="_CPPv2N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="lgraph_api::DateTime::ConvertToUTC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a56e9bf4e6d3c6e9610e1f572f112d13c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToUTC</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the UTC time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a local time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Object converted to an UTC.</p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv">
+<span id="_CPPv3N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="_CPPv2N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="lgraph_api::DateTime::ConvertToLocal"></span><span class="target" id="classlgraph__api_1_1DateTime_1ad05a5ca52a97c6a3c4e4c62bbcdd0ff9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToLocal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the local time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Object converted to a local.</p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="lgraph_api::DateTime::Parse__ssCR.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a53252357cbc4cfe0040f4b0c31a6ca93"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="lgraph_api::DateTime::Parse__cCP.cCP.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7f3b51df42213d000e5cf8499fc9583f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[inout]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 19 or 26), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime3NowEv">
+<span id="_CPPv3N10lgraph_api8DateTime3NowEv"></span><span id="_CPPv2N10lgraph_api8DateTime3NowEv"></span><span id="lgraph_api::DateTime::Now"></span><span class="target" id="classlgraph__api_1_1DateTime_1afdf6bfab9c1625bea9fe0d88052eb9be"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime3NowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8LocalNowEv">
+<span id="_CPPv3N10lgraph_api8DateTime8LocalNowEv"></span><span id="_CPPv2N10lgraph_api8DateTime8LocalNowEv"></span><span id="lgraph_api::DateTime::LocalNow"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac419c09087e3dfbeb9b13a52cf5ca63b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8LocalNowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E">
+<span id="_CPPv3N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="_CPPv2N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="lgraph_api::DateTime::microseconds_since_epoch___int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a35d4677c58d7dc9be8f6566632ef33ea"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">microseconds_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSFE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSFE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSFE"></span><span id="lgraph_api::DateTime::YMDHMSF"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YMDHMSF</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Representation of a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in year, month, day, hour, minute, second, fraction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="lgraph_api::DateTime::YMDHMSF::year__i"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE" title="永久链接至目标"></a><br></dt>
+<dd><p>The year, 0-9999 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="lgraph_api::DateTime::YMDHMSF::month__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE" title="永久链接至目标"></a><br></dt>
+<dd><p>The month, 1-12 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="lgraph_api::DateTime::YMDHMSF::day__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE" title="永久链接至目标"></a><br></dt>
+<dd><p>The day, 1-31 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="lgraph_api::DateTime::YMDHMSF::hour__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a7f39b6fc12f0b04a38625ff3040dd30c"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">hour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE" title="永久链接至目标"></a><br></dt>
+<dd><p>The hour, 0-23 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="lgraph_api::DateTime::YMDHMSF::minute__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a408e3d60d59afc5b5a6f35ac9f5c8fbb"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">minute</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE" title="永久链接至目标"></a><br></dt>
+<dd><p>The minute, 0-59 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="lgraph_api::DateTime::YMDHMSF::second__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1af7633c5cbb76481bafd5e3e1ec07ca37"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">second</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE" title="永久链接至目标"></a><br></dt>
+<dd><p>The second, 0-59 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="lgraph_api::DateTime::YMDHMSF::fraction__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a4a3d5aea78d5e1e01c7be45e6990456f"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fraction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE" title="永久链接至目标"></a><br></dt>
+<dd><p>The fraction 000000-999999 </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZoneE">
+<span id="_CPPv3N10lgraph_api8TimeZoneE"></span><span id="_CPPv2N10lgraph_api8TimeZoneE"></span><span id="lgraph_api::TimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZoneE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>A class that represents a time zone. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone8TimeZoneEi">
+<span id="_CPPv3N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="_CPPv2N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="lgraph_api::TimeZone::TimeZone__i"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a4cbdd9521cf61ed9457984aeff9c4e13"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">time_diff_hours</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone8TimeZoneEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Create a timezone which has time difference with UTC in hours time_diff_hours. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidParameter</span></span></span> – Thrown if time_diff_hours is invalid.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>time_diff_hours</strong> – (Optional) Difference between local timezone and UTC. Must be &gt; =-10 &amp;&amp; &lt;=14. Otherwise the function will throw. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::FromUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae70105315a4e43ef16dcc94d07a69769"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FromUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from UTC time to this time zone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC time.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::ToUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1aa0d29ab9305bb5efa5bd1cdc48647086"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from this timezone to UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="lgraph_api::TimeZone::UTCDiffSecondsC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a9aaed281da56442099de67e51fe47638"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffSeconds</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns diff from UTC in seconds, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a></p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of seconds local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="lgraph_api::TimeZone::UTCDiffHoursC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a56914c89b37c60dcfc9db708d3a89446"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffHours</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns diff from UTC in hours, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a></p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of hours local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::LocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A const reference to local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::UpdateLocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae9cf01b0a4d1e6cfc21306569d8260f0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpdateLocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Update local timezone, used only when daylight saving time changes. Daylight saving time may change after LocalTZ was initialized, in which case we need to update it. This function will update all references returned by <a class="reference internal" href="#classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"><span class="std std-ref">LocalTimeZone()</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E">
+<span id="_CPPv3N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="_CPPv2N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="lgraph_api::TimeZone::time_diff_microseconds___int64_t"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a32810c21702584e4d3090242818cbb06"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">time_diff_microseconds_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="lgraph_api::TimeZone::GetLocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a27c488e750c5dc4247d99d4db241b0bf"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone7LocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone7LocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone7LocalTZEv"></span><span id="lgraph_api::TimeZone::LocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a8aa7218fc3680021035c689a23159760"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone7LocalTZEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-db">
+<h2>lgraph_db<a class="headerlink" href="#lgraph-db" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46lgraph">
+<span id="_CPPv36lgraph"></span><span id="_CPPv26lgraph"></span><span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><a class="headerlink" href="#_CPPv46lgraph" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskEv"></span><span id="lgraph_api::ShouldKillThisTask"></span><span class="target" id="namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Determine if we should kill current task. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if a KillTask command was issued for this task, either due to user request or timeout. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16GetThreadContextEv">
+<span id="_CPPv3N10lgraph_api16GetThreadContextEv"></span><span id="_CPPv2N10lgraph_api16GetThreadContextEv"></span><span id="lgraph_api::GetThreadContext"></span><span class="target" id="namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"></span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetThreadContext</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api16GetThreadContextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets thread context pointer, which can then be used in ShouldKillThisTask(ctx). Calling <a class="reference internal" href="#namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"><span class="std std-ref">ShouldKillThisTask()</span></a> is equivalent to ShouldKillThisTask(GetThreadContext()). In order to save the cost of <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>, you can store the context and use it in ShouldKillThisTask(ctx). </p>
+<p>Example: ```c++ ThreadContextPtr ctx = <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>; while (HasMoreWorkToDo()) { if (ShouldKillThisTask(ctx)) { break; } DoWork(); } ```</p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The thread context. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="lgraph_api::ShouldKillThisTask__ThreadContextPtr"></span><span class="target" id="namespacelgraph__api_1a842a962cb406dd251be8aeb492510b6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ctx</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr" title="永久链接至目标"></a><br></dt>
+<dd><p>Determine if we should kill the task currently running in the thread identified by ctx. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>ctx</strong> – The context, as obtained with GetThreadContext.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if a KillTask command was issued for this task. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1a340bf8a3bf351920b9c20fe861372bcf"></span><span class="sig-name descname"><span class="pre">const</span> <span class="pre">typedef</span> <span class="pre">void</span> <span class="pre">*</span> <span class="pre">ThreadContextPtr</span></span></dt>
+<dd><p>Defines an alias representing the thread context pointer </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBE">
+<span id="_CPPv3N10lgraph_api7GraphDBE"></span><span id="_CPPv2N10lgraph_api7GraphDBE"></span><span id="lgraph_api::GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_db.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> represents a graph instance. In TuGraph, each graph instance has its own schema and access control settings. Accessing a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> without appropriate access rights yields WriteNotAllowed. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> becomes invalid if <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a> is called, in which case all transactions and iterators associated with that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> become invalid. Further operation on that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> yields InvalidGraphDB. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="lgraph_api::GraphDB::GraphDB__lgraph::AccessControlledDBP.b.b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8ed8306aab2d4ea17475888d25737f69"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db_with_access_control</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">owns_db</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb" title="永久链接至目标"></a><br></dt>
+<dd><p>For internal use only. Users should use <a class="reference internal" href="#classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"><span class="std std-ref">Galaxy::OpenGraph()</span></a> to get <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5884af0fb5900e58a13e6cf2c64e9061"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a43a244ebb2089430b84e50667e89d015"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBD0Ev">
+<span id="_CPPv3N10lgraph_api7GraphDBD0Ev"></span><span id="_CPPv2N10lgraph_api7GraphDBD0Ev"></span><span id="lgraph_api::GraphDB::~GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad0d3a9bb78624594d45104c0ec3566d2"></span><span class="sig-name descname"><span class="n"><span class="pre">~GraphDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5CloseEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5CloseEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5CloseEv"></span><span id="lgraph_api::GraphDB::Close"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Close the graph. This will close the graph and release all transactions, iterators associated with the graph. After calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a>, the graph becomes invalid, and cannot be used anymore. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="lgraph_api::GraphDB::CreateReadTxn"></span><span class="target" id="classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateReadTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Creates a read transaction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The new read transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb">
+<span id="_CPPv3N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="_CPPv2N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="lgraph_api::GraphDB::CreateWriteTxn__b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateWriteTxn</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">optimistic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Creates a write transaction. Write operations can only be performed in write transactions, otherwise exceptions will be thrown. A write transaction can be optimistic. Optimistic transactions can run in parallel and any conflict will be detected during commit. If a transaction conflicts with an ealier one, a TxnConflict will be thrown during commit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>optimistic</strong> – (Optional) True to create an optimistic transaction.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The new write transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction">
+<span id="_CPPv3N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="_CPPv2N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="lgraph_api::GraphDB::ForkTxn__TransactionR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForkTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction" title="永久链接至目标"></a><br></dt>
+<dd><p>Forks a read transaction. The resulting read transaction will share the same view as the forked one, meaning that when reads are performed on the same vertex/edge, the results will always be identical, whether they are performed in the original transaction or the forked one. Only read transactions can be forked. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"><span class="std std-ref">ForkTxn()</span></a> on a write txn causes an InvalidFork to be thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidFork</span></span></span> – Thrown when txn is a write transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>txn</strong> – <strong>[in]</strong> The read transaction to be forked.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A new read <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> that shares the same view with txn. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5FlushEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5FlushEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5FlushEv"></span><span id="lgraph_api::GraphDB::Flush"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Flush</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5FlushEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Flushes buffered data to disk. If there have been some async transactions, there could be data that are written to this graph, but not persisted to disk yet. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"><span class="std std-ref">Flush()</span></a> will persist the data and prevent data loss in case of system crash. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB11DropAllDataEv">
+<span id="_CPPv3N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="_CPPv2N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="lgraph_api::GraphDB::DropAllData"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a784e2f7141aaed6b547faaaf52e87880"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB11DropAllDataEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Drop all the data in the graph, including labels, indexes and vertexes/edges.. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="lgraph_api::GraphDB::DropAllVertex"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad51e4783ef7de143949c05311a0f2b54"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Drop all vertex and edges but keep the labels and indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="lgraph_api::GraphDB::EstimateNumVertices"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8434ac9ad087a3f57b96f6c8bed664d6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EstimateNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Estimate number of vertices. We don’t maintain the exact number of vertices, but only the next vid. This function actually returns the next vid to be used. So if you have deleted a lot of vertices, the result can be quite different from actual number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Estimated number of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="lgraph_api::GraphDB::AddVertexLabel__ssCR.std::vector:FieldSpec:CR.VertexOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0c0f79500ca028b8342cc6af9b363c83"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="lgraph_api::VertexOptions"><span class="n"><span class="pre">VertexOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the schema is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>primary_field</strong> – The primary field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteVertexLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6d74b689bd295b71c8857f26b77cb4a2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes a vertex label and all the vertices with this label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a15a25572790ab89a16815409cbc5a869"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes fields in a vertex label. This function also updates the vertex data and indices accordingly to make sure the database remains in consistent state. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or some fields cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – Labels of the fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1abdca8d18155cbb711386a18d8f206c66"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fields to a vertex label. The new fields in existing vertices will be filled with default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field already exists.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The add fields. </p></li>
+<li><p><strong>default_values</strong> – The default values of the newly added fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3becea45eab0d50d4c09232b211944d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify fields in a vertex label, either chage the data type or optional, or both. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The new specification of the modified fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="lgraph_api::GraphDB::AddEdgeLabel__ssCR.std::vector:FieldSpec:CR.EdgeOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3c5434fc9c650a6f09465c32db1b16d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a edge label, specifying its schema. It is allowed to specify edge constrains, too. An edge can be bound to several (source_label, destination_label) pairs, which makes sure this type of edges will only be added between these types of vertices. By default, the constain is empty, meaning that the edge is not restricted. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if invalid schema (invalid specification, re- definition of the same field, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>temporal_field</strong> – The temporal field for tid. </p></li>
+<li><p><strong>edge_constraints</strong> – (Optional) The edge constraints. An empty constrain means no restriction.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteEdgeLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0bf6aee53c6c7412806a6a1dcdcd6377"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes an edge label and all the edges of this type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="lgraph_api::GraphDB::AlterLabelModEdgeConstraints__ssCR.std::vector:std::pair:ss.ss::CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7ab2ca321e3bd68c1a9f33aeaa3bd747"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterLabelModEdgeConstraints</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify edge constraint. Existing edges that violate the new constrain will be removed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any vertex label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>constraints</strong> – The new edge constraint.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a08241fee881005b37982621a31fb5e00"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes fields in an edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – The fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of edges modified.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab43144d999e3f539a42c5aa6a4ec21c0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fields to an edge label. The new fields in existing edges will be set to default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field already exists, or the default value is of incompatible type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The fields to add. </p></li>
+<li><p><strong>default_values</strong> – The default values. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aae83cf6042c04347d6cc6147289bced0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify fields in an edge label. Data type and OPTIONAL can be modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The modifier fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddVertexIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4e0da14c082f2be3f4d29ef888daad64"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field</strong> – The field name. </p></li>
+<li><p><strong>is_unique</strong> – True if is unique index, false if not.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddEdgeIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aa33f376759b00da1070c16167f8650bf"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>is_unique</strong> – True if the field content is unique for each vertex.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType"></span><span id="lgraph_api::GraphDB::AddVertexCompositeIndex__ssCR.std::vector:ss:CR.CompositeIndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1afffc035485855bc3f44ef01bd488d64b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fields</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="lgraph_api::CompositeIndexType"><span class="n"><span class="pre">CompositeIndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Check if this vertex_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Check if this edge_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::GraphDB::IsVertexCompositeIndexed__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a2f37f96ce8798934819071be98abb901"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexCompositeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5dd0b2831686ab10c9cf641b1f5a04c8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the index to ‘vertex_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::GraphDB::DeleteVertexCompositeIndex__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac9bde44178388ef9fce8ca86b28d6a4b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fields</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0b04c7d95efa608199ffd43074698a26"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the index to ‘edge_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="lgraph_api::GraphDB::GetDescriptionC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a10eafac774946c9fda6acd8368e6b254"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDescription</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get graph description </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The description. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="lgraph_api::GraphDB::GetMaxSizeC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3cd10a9d8a077a9b838fecc8d894550c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetMaxSize</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get maximum graph size </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The maximum size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a1f9045086aaa5274c657b8020ed8d314"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fulltext index to ‘vertex_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad67d845d1e7c6d3a230ebca0eac15138"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fulltext index to ‘edge_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2d13791623a99511d3d743e811097b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘vertex_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab7e3ee69c450474f77d621b7310b1621"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘edge_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="lgraph_api::GraphDB::RebuildFullTextIndex__std::set:ss:CR.std::set:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6902d07efdba3ff5c2be81311534e752"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RebuildFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_labels</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_labels</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Rebuild the fulltext index of <code class="docutils literal notranslate"><span class="pre">vertex_labels</span></code> and <code class="docutils literal notranslate"><span class="pre">edge_labels</span></code>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_labels</strong> – The vertex labels whose fulltext index need to rebuild. </p></li>
+<li><p><strong>edge_labels</strong> – The edge labels whose fulltext index need to rebuild. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="lgraph_api::GraphDB::ListFullTextIndexes"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ae2b1b58ffc70106433bee030842e3e27"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListFullTextIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List fulltext indexes of vertex and edge </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Format of returned data : (is_vertex, label_name, property_name) </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryVertexByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a696a8bc40c23002921ccd4983b1e2550"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryVertexByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Query vertex by fulltext index. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The vertex label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Vertex vids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryEdgeByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4f09813ea8812322180569bd2b48fe05"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryEdgeByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Query edge by fulltext index </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The edge label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Edge uids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12RefreshCountEv">
+<span id="_CPPv3N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="_CPPv2N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="lgraph_api::GraphDB::RefreshCount"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ade8d799b8354403e99298d493a3509f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshCount</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12RefreshCountEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Recount the total number of vertex and edge, stop writing during the count </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3ea21ec359220a8c4e0ea72adb0c1ba0"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd><p>Copying is disabled. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3bc8ff8539363d5511d9a6936bae7899"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB3db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB3db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB3db_E"></span><span id="lgraph_api::GraphDB::db___lgraph::AccessControlledDBP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a35f581fb0d14734506768c1a61296979"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17should_delete_db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="lgraph_api::GraphDB::should_delete_db___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac2e6f7ca5ee0fc92e2579a7de9303eac"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">should_delete_db_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17should_delete_db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB10read_only_E">
+<span id="_CPPv3N10lgraph_api7GraphDB10read_only_E"></span><span id="_CPPv2N10lgraph_api7GraphDB10read_only_E"></span><span id="lgraph_api::GraphDB::read_only___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac22ad4698a78f7e4ab74ec4450647125"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">read_only_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB10read_only_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-index-iterator">
+<h2>lgraph_edge_index_iterator<a class="headerlink" href="#lgraph-edge-index-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorE"></span><span id="lgraph_api::EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> can be used to access a set of edges that has the same indexed value. If the index is unique (that is, each Edge has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> will only have one edge unique id, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> is valid iff it points to a valid (index_value, euid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ae51a6e1b90b7343b4012be9cc7ae3daa"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a584635e9e5d92688527dbae26f926f80"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="lgraph_api::EdgeIndexIterator::~EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aa1bb455fd404e4102a0e6b637283db00"></span><span class="sig-name descname"><span class="n"><span class="pre">~EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="lgraph_api::EdgeIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="lgraph_api::EdgeIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="lgraph_api::EdgeIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next edge unique id in the list, which consists of all the valid edge unique ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::EdgeIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the current index value. The euids are sorted in ( EdgeIndexValue, euid) order. When <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one euid to next, possibly moving from one EdgeIndexValue to another. This function tells the EdgeIndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="lgraph_api::EdgeIndexIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the Edge Unique Id </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="lgraph_api::EdgeIndexIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="lgraph_api::EdgeIndexIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__lgraph::EdgeIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a2266e13c0886456df166e683e4a04cc5"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1acd1c7e3f9d88fcc2a2fa0dbdbb5b2bf8"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1abda22c9f1d7924e06efe4e12a1986292"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="lgraph_api::EdgeIndexIterator::it___std::unique_ptr:lgraph::EdgeIndexIterator:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a8c447e8d8d6d5ae41372b160dec982b1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="lgraph_api::EdgeIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-iterator">
+<h2>lgraph_edge_iterator<a class="headerlink" href="#lgraph-edge-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph5graphE">
+<span id="_CPPv3N6lgraph5graphE"></span><span id="_CPPv2N6lgraph5graphE"></span><span id="lgraph::graph"></span><span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph5graphE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aa64cc73da05613af93f74fbba0e40685"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a92a989ca7aa12f6bf9312acca6a24b9d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aae356ade132bced19db97d69e2693926"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1ad917857534c392eb3de3718007839e87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1acae8199afd0a5a7026d057a2ede19e29"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a623f694634f9b740f6e8432ad5e8fed7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a145cb4680fe351655b20bcefbf1d10c6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a46e696695da45853cbeb5905719210fa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> can be used to iterate through the in-coming edges of a vertex. Edges are sorted in (lid, tid, src, eid) order, and each (dst, lid, tid, src, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> is valid iff it points to a valid in-coming edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a73ca326056d2877cea6b09a683b8c0ba"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a20741057cf223945a84f2ebe4cb73b2f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="lgraph_api::InEdgeIterator::~InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a299e60d91351d2ceb0da9445d3d53ab9"></span><span class="sig-name descname"><span class="n"><span class="pre">~InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="lgraph_api::InEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4NextEv"></span><span id="lgraph_api::InEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next incoming edge to current destination vertex. If there is no more edge, the iterator becomes invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::InEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Go to the edge specified by euid. If the specified edge cannot be found and nearest==true, then try to get the next in-coming edge to the vertex euid.dst, sorted by (label, tid, src, eid). If there is no such edge, iterator is invalidated and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="lgraph_api::InEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the Edge Unique Id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="lgraph_api::InEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="lgraph_api::InEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets destination vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::InEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::InEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets temporal id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The temporal id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="lgraph_api::InEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::InEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field_name </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::InEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>All field names and values stored as a {(field_name, field_value),…} map. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="lgraph_api::InEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next incoming edge sorted by (lid, tid, src, eid) if there is any. If no in-coming edge is left for this vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="lgraph_api::InEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__lgraph::graph::InEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a92769487b9004274f36dccbc5b26dc1d"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aaf872d62e0bcd4680527d2c086433151"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5110071efc6781255ae9ce68e3634205"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator3it_E"></span><span id="lgraph_api::InEdgeIterator::it___std::unique_ptr:lgraph::graph::InEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a17c31f91df04ddbd378b1d23c6c18568"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4txn_E"></span><span id="lgraph_api::InEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> can be used to iterate through the out-going edges of a vertex. Edges are sorted in (lid, dst, eid) order, and each (src, lid, tid, dst, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> is valid iff it points to a valid out-going edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1abab68117b55783f6c38a899396f169a3"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a088017d735536fa934b5fb2cba592e43"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="lgraph_api::OutEdgeIterator::~OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa0e08e47018ad64858af8310913383b1"></span><span class="sig-name descname"><span class="n"><span class="pre">~OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="lgraph_api::OutEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::OutEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Go to the edge specified by euid. That is, an edge from Vertex euid.src to euid.dst, with LabelId==euid.label, Tid==euid.tid, and EdgeId==euid.eid. If neareast==true and the exact edge was not found, the iterator tries to get the next edge that sorts after the specified edge. The edges are sorted in (label, tid, dst, eid) order. The iterator becomes invalid if there is no outgoing edge from euid.src that sorts after euid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique ID. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if there is no such edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="lgraph_api::OutEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="lgraph_api::OutEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next edge. Invalidates iterator if there is no more out edges from current source vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails (no more out edge from current source). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="lgraph_api::OutEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the Edge Unique Id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="lgraph_api::OutEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets primary id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The primary id of the edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="lgraph_api::OutEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::OutEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – The name of the field to get.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field id. FieldId can be obtained with txn.GetEdgeFieldId() </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>fid</strong> – fid The field id.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::OutEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>All fields in a dictionary of {(field_name, field_value),…}. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value in string representation. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="lgraph_api::OutEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next out-going edge sorted by (label, tid, dst, eid) if there is any. If there is no more out-going edges for this source vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="lgraph_api::OutEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A std::string that represents this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__lgraph::graph::OutEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aec68967791b2a1c92ff94c646853c14a"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ab98d1e207b5ecce1a7dcea1478577558"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a65896ed24e13cd2af266a344a655419c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator3it_E"></span><span id="lgraph_api::OutEdgeIterator::it___std::unique_ptr:lgraph::graph::OutEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa9051f34e34c3c714096054e271c72a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="lgraph_api::OutEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-exceptions">
+<h2>lgraph_exceptions<a class="headerlink" href="#lgraph-exceptions" title="永久链接至标题"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.ERROR_CODES">
+<span class="target" id="lgraph__exceptions_8h_1a202796cec2c73e6a15b8ae40423102d2"></span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#c.ERROR_CODES" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.X">
+<span class="target" id="lgraph__exceptions_8h_1a1f09736ce2d0b353925675b9c17f9b58"></span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="n"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.X" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THROW_CODE">
+<span class="target" id="lgraph__exceptions_8h_1a0a6acbf1c6c9172f6be1c808cfa03f10"></span><span class="sig-name descname"><span class="n"><span class="pre">THROW_CODE</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="p"><span class="pre">...</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.THROW_CODE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCodeE">
+<span id="_CPPv3N10lgraph_api9ErrorCodeE"></span><span id="_CPPv2N10lgraph_api9ErrorCodeE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05f"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCode</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode1XE">
+<span id="_CPPv3N10lgraph_api9ErrorCode1XE"></span><span id="_CPPv2N10lgraph_api9ErrorCode1XE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa13397c15c68eb3e5e33a0196e8988a24"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode1XE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE">
+<span id="_CPPv3N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span id="_CPPv2N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa0afdd4a4fb13896180b64bd313a17dc2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode">
+<span id="_CPPv3N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="_CPPv2N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="lgraph_api::ErrorCodeToString__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a13525881a01e59b5a69b74c47d95dcd3"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeToString</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode">
+<span id="_CPPv3N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="_CPPv2N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="lgraph_api::ErrorCodeDesc__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a82ab07d2676a279295157e65beeedcbc"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeDesc</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphExceptionE">
+<span id="_CPPv3N10lgraph_api15LgraphExceptionE"></span><span id="_CPPv2N10lgraph_api15LgraphExceptionE"></span><span id="lgraph_api::LgraphException"></span><span class="target" id="classlgraph__api_1_1LgraphException"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><span class="n"><span class="pre">exception</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphExceptionE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_exceptions.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aa1104fdb0328ecad056440c0498affa5"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.ssCR"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af986a8520040b3af5568e7f4f2b3d813"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.cCP"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af81b58e697be8127dd1310a7297a886b"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts">
+<span id="_CPPv3IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span id="_CPPv2IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="p"><span class="pre">...</span></span><span class="sig-name descname"><span class="n"><span class="pre">Ts</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1LgraphException_1a8cc576c0c99e4c712a0fc91ca67868fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">format</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="lgraph_api::LgraphException::LgraphException::Ts"><span class="n"><span class="pre">Ts</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">...</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4codeEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4codeEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4codeEv"></span><span id="lgraph_api::LgraphException::codeC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a833a074d2f56630e12d5c66e6ebb5862"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4codeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException3msgEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException3msgEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException3msgEv"></span><span id="lgraph_api::LgraphException::msgC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1e6c05d855e126b4ecfaa8241f8cca33"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">msg</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException3msgEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4whatEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4whatEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4whatEv"></span><span id="lgraph_api::LgraphException::whatC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aac1c33909e01e1dfc85617cf2477d3eb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">what</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><span class="w"> </span><span class="k"><span class="pre">override</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4whatEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5code_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5code_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5code_E"></span><span id="lgraph_api::LgraphException::code___ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1ac8cce82dda9537fdb72dac589a6ac5f2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5code_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException4msg_E">
+<span id="_CPPv3N10lgraph_api15LgraphException4msg_E"></span><span id="_CPPv2N10lgraph_api15LgraphException4msg_E"></span><span id="lgraph_api::LgraphException::msg___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1da24fcb3b81cddc8a32815f13997437"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">msg_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException4msg_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5what_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5what_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5what_E"></span><span id="lgraph_api::LgraphException::what___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a415baaef606c6f5e5e1104719a84dc72"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">what_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5what_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-galaxy">
+<h2>lgraph_galaxy<a class="headerlink" href="#lgraph-galaxy" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyE">
+<span id="_CPPv3N10lgraph_api6GalaxyE"></span><span id="_CPPv2N10lgraph_api6GalaxyE"></span><span id="lgraph_api::Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_galaxy.h&gt;</em></div>
+<p>A galaxy is the storage engine for one TuGraph instance. It manages a set of User/Role/GraphDBs. </p>
+<p>A galaxy can be opened in async mode, in which case <em>ALL</em> write transactions will be treated as async, whether they declare async or not. This can come in handy if we are performing a lot of writing, but can cause data loss for online processing. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aff4d727c87112ab1ae56882ed7c90ae8"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The TuGraph dir. </p></li>
+<li><p><strong>durable</strong> – (Optional) True to open in durable mode. If set to false, ALL write transactions are async, whether they declare async or not. </p></li>
+<li><p><strong>create_if_not_exist</strong> – (Optional) If true, the TuGraph DB will be created if dir does not exist; otherwise, an exception is thrown. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.ssCR.ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac04eaf83ff6ed47d4e77bbcb06b432f5"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor. Open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> and try to login with specified user and password. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is not correct.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The dir. </p></li>
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>durable</strong> – True to open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> in durable mode. </p></li>
+<li><p><strong>create_if_not_exist</strong> – True to create if DB does not exist. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a57bcd86daa9d4cdbfb367a0e43d8b039"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aead55554e77f85378cd82ece56cfde96"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyD0Ev">
+<span id="_CPPv3N10lgraph_api6GalaxyD0Ev"></span><span id="_CPPv2N10lgraph_api6GalaxyD0Ev"></span><span id="lgraph_api::Galaxy::~Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a00577f1737a890a15dbd7b409a2f1cd8"></span><span class="sig-name descname"><span class="n"><span class="pre">~Galaxy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetCurrentUser__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac428a8a912bf43cf72c9a908ef6c7c15"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetCurrentUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Validate and set current user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a568523d4c1b5a1cde2fafa5fd2d702f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set current user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if token is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The current user. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="lgraph_api::Galaxy::CreateGraph__ssCR.ssCR.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a480909a8d20e7b8a904030fc5be34da0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">description</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">max_size</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="m"><span class="pre">1</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">40</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Validate token and set current user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to create graph. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Other input errors such as invalid graph name, size, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph to create. description (Optional) Description of the graph. max_size (Optional) Maximum size of the graph.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if graph already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteGraph__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1f0d94b15f7b718f6aa4f1dc01656f0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Delete a graph </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to delete graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the graph does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="lgraph_api::Galaxy::ModGraph__ssCR.b.ssCR.b.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4d8cdf497e81b2b9d1fc95f980319a0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ModGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_size</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">new_max_size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify graph info </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to modify graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph_name</strong> – Name of the graph. </p></li>
+<li><p><strong>mod_desc</strong> – True to modifier description. </p></li>
+<li><p><strong>desc</strong> – The new description. </p></li>
+<li><p><strong>mod_size</strong> – True to modifier size. </p></li>
+<li><p><strong>new_max_size</strong> – New maximum size.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="lgraph_api::Galaxy::ListGraphsC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a4c64be90601e4a55971798b4272ebf"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListGraphs</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List graphs </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to list graphs.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A dictionary of {graph_name: (description, max_size)} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateUser__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a97e43d10d6b95de4d68ca3c7919bcacb"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Creates a user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if other input errors, such as illegal user name, password, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>desc</strong> – (Optional) The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab111a438ea5f846881da6c03d3e34115"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetPassword__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a29f197aed82ca28992c87b797b5e4186"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetPassword</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">old_password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">new_password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the password of the specified user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission, or curr_user==user, but old_password is incorrect. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if new_password is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user to modify. </p></li>
+<li><p><strong>old_password</strong> – The old password, required if curr_user==user. </p></li>
+<li><p><strong>new_password</strong> – The new password.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUserDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aca1ba2352c5365a0e82f522d79b51219"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets user description. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>desc</strong> – The new description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Galaxy::SetUserRoles__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a0c5796bfe855125cf1b3675c4a3b87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserRoles</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">roles</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the roles of the specified user. If you need to add or delete a role, you will need to use GetUserInfo to get the roles first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any role does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>roles</strong> – A list of roles.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="lgraph_api::Galaxy::SetUserGraphAccess__ssCR.ssCR.AccessLevelCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3f0fcfae10bf1776e39ecc3205fc6c85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserGraphAccess</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets user access rights on a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>access</strong> – The access level.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a0edfd7185553ceb6c81f303acdbf163c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Disable a user. A disabled user is not able to login or perform any operation. A user cannot disable itself. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user to disable.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1af07907500b4d6142b9416e74df4557a4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Enables the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListUsersEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="lgraph_api::Galaxy::ListUsersC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a55e8c41afb9c217b63872b76b1486691"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListUsers</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListUsersEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List all users </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A dictionary of {user_name:user_info} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetUserInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab5010716ab86c5f6650672ce885c4bd9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUserInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets user information </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The user information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateRole__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a550aaacf7d2580baf77c3eb7706cafd7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Create a role. A role has different access levels to different graphs. Every user must be assigned some role to get access to graphs. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1add07dbe39e13e5c47e82c4b621963d7f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the role described by role </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6007103b069eebe456d17e6035c763ce"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Disable a role. A disabled role still has the data, but is not effective. i.e., users will not have access rights to graphs that are obtained by having this role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a88b1cf70763b8f517a8a67fd70f45ba6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Enables the role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetRoleDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a09988e113e9709e0ae2d8a9ae55bfd97"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the description of the specified role </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRights__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7da90a98fb519cf1557c82f9780bf2aa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRights</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set access of the role to graphs. If you need to add or remove access to part of the graphs, you need to get full graph_access map by using GetRoleInfo first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRightsIncremental__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3ad7fb60a0413742007dceff71f34f9b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRightsIncremental</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Incrementally modify the access right of the specified role. For example, for a role that has access right {graph1:READ, graph2:WRITE}, calling this function with graph_access={graph2:READ, graph3:FULL} will set the access right of this role to {graph1:READ, graph2:READ, graph3:FULL} </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetRoleInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3d2426344ffa4ccd2c3d99af236bbc83"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetRoleInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets role information </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The role information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListRolesEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="lgraph_api::Galaxy::ListRolesC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ae420054434acdb37d8d242926c2eece7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListRoles</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListRolesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List all the roles </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A dictionary of {role_name:<a class="reference internal" href="#structlgraph__api_1_1RoleInfo"><span class="std std-ref">RoleInfo</span></a>} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetAccessLevel__ssCR.ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a9b5d700cf67ddcd6dc08a73271034c66"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAccessLevel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the access level that the specified user have to the graph </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name or graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The access level. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb">
+<span id="_CPPv3NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="_CPPv2NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="lgraph_api::Galaxy::OpenGraph__ssCR.bC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OpenGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Opens a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>read_only</strong> – (Optional) True to open in read-only mode. A read-only <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> cannot be written to.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5CloseEv">
+<span id="_CPPv3N10lgraph_api6Galaxy5CloseEv"></span><span id="_CPPv2N10lgraph_api6Galaxy5CloseEv"></span><span id="lgraph_api::Galaxy::Close"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a>, turning it into an invalid state. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="lgraph_api::Galaxy::Galaxy__lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a18b1851884f7ba7148f9488f0669212a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aa5da67d606e1c4a26b0733a2f0082f1a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4ea0661db673b9f0f9e2d4fd01cfa2a3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5user_E">
+<span id="_CPPv3N10lgraph_api6Galaxy5user_E"></span><span id="_CPPv2N10lgraph_api6Galaxy5user_E"></span><span id="lgraph_api::Galaxy::user___ss"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a17442452651ea1479fa7d0e652f90810"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5user_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy3db_E">
+<span id="_CPPv3N10lgraph_api6Galaxy3db_E"></span><span id="_CPPv2N10lgraph_api6Galaxy3db_E"></span><span id="lgraph_api::Galaxy::db___lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1d7badecbe92fb1d1d48f412eb80beef"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-result">
+<h2>lgraph_result<a class="headerlink" href="#lgraph-result" title="永久链接至标题"></a></h2>
+<p>Result interface for plugins and built-in procedures. The result of a plugin should be provided in this format in order for the Cypher engine and the graph visualizer to understand. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46cypher">
+<span id="_CPPv36cypher"></span><span id="_CPPv26cypher"></span><span id="cypher"></span><span class="target" id="namespacecypher"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher</span></span></span><a class="headerlink" href="#_CPPv46cypher" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordE">
+<span id="_CPPv3N10lgraph_api6RecordE"></span><span id="_CPPv2N10lgraph_api6RecordE"></span><span id="lgraph_api::Record"></span><span class="target" id="classlgraph__api_1_1Record"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p>You only initialize the class by <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> instance. <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a> provide some insert method to insert data to the record. eg. Insert, InsertVertexByID, InsertEdgeByID. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERK6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERK6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERK6Record"></span><span id="lgraph_api::Record::Record__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1ac650ba988b5c162c621cabf07c18d497"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERR6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERR6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERR6Record"></span><span id="lgraph_api::Record::Record__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1adb1c42c8dbe94932471cc2fa3b1de7a6"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERK6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERK6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERK6Record"></span><span id="lgraph_api::Record::assign-operator__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1a820a033a9bfbbf0a1a0cff6ae779c715"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERK6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERR6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERR6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERR6Record"></span><span id="lgraph_api::Record::assign-operator__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1ab8d2b9aec7327774226f29c455791dad"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERR6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Record::Insert__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Record_1a38f91b3aee5d1880237939f77fd5c2fb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>fv</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.int64_tC.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a171dbf3555be4830b723f1963518c8d2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertVertexByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId </p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.EdgeUidR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a0947956a5583ac30f6437ccba45e6dbc"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertEdgeByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>euid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t">
+<span id="_CPPv3N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="_CPPv2N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="lgraph_api::Record::InsertVertexByID__ssCR.int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a0445d0d62a48711ddef6e9988bd0fa09"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertVertexByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid">
+<span id="_CPPv3N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="_CPPv2N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="lgraph_api::Record::InsertEdgeByID__ssCR.EdgeUidCR"></span><span class="target" id="classlgraph__api_1_1Record_1abede73c241382ea0e55f76b90e3a7f42"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertEdgeByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">uid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>uid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1af585894e04343f4c80843dcdebdbef9d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>vit</strong> – <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1a1f507fb00296a8e04f98a391ec597ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ieit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>ieit</strong> – <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1aa5d88aae93b2cf484beb632d88420adf"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">oeit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>oeit</strong> – <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a59b5dffacde269b5df6612c00771b9a1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">list</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>list</strong> – LIST OF <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::map:ss.FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a7d99978348600b14abe0049be705b625"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">map</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>map</strong> – MAP OF &lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.traversal::PathCR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a527ac8a8e078306bcda8963a22813afb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversalE" title="lgraph_api::traversal"><span class="n"><span class="pre">traversal</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">path</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert value into result table. You can insert a value by the function, and value must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>path</strong> – Path of traverse api. </p></li>
+<li><p><strong>txn</strong> – Trasaction </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Record4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Record4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Record4SizeEv"></span><span id="lgraph_api::Record::SizeC"></span><span class="target" id="classlgraph__api_1_1Record_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Record4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the size of record. If record is empty, return 0, max size is not beyond the length of your defined param list </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Size of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="lgraph_api::Record::HasKey__ssCR"></span><span class="target" id="classlgraph__api_1_1Record_1a2a2d1b3e4e37484e8bce95728db6b770"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HasKey</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Check a key is exist or not. The key is the one of titile your defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>key</strong> – The key.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if exsit, otherwise fasle. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Record::Record__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Record_1af5b8557af6ac3c8c4af28c7fc79a6b42"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6recordE">
+<span id="_CPPv3N10lgraph_api6Record6recordE"></span><span id="_CPPv2N10lgraph_api6Record6recordE"></span><span id="lgraph_api::Record::record__std::unordered_map:ss.std::shared_ptr:ResultElement::"></span><span class="target" id="classlgraph__api_1_1Record_1a2248d027c6bbadbd043ee858e5656d7a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6recordE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6headerE">
+<span id="_CPPv3N10lgraph_api6Record6headerE"></span><span id="_CPPv2N10lgraph_api6Record6headerE"></span><span id="lgraph_api::Record::header__std::unordered_map:ss.LGraphType:"></span><span class="target" id="classlgraph__api_1_1Record_1a38c0d41af0c74862a17017322f4171d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6headerE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record7length_E">
+<span id="_CPPv3N10lgraph_api6Record7length_E"></span><span id="_CPPv2N10lgraph_api6Record7length_E"></span><span id="lgraph_api::Record::length___int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a5f8ae7abecbad53a2b4130540267cddf"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">length_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record7length_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Result</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6ResultE">
+<span id="_CPPv3N10lgraph_api6ResultE"></span><span id="_CPPv2N10lgraph_api6ResultE"></span><span id="lgraph_api::Result"></span><span class="target" id="classlgraph__api_1_1Result"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6ResultE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> table, result instance provide [MutableRecord], [ResetHeader], [Dump] and [Load] method. Table also provide some method to view content of table. For example, [Header] and [Recordview]. </p>
+<p>It’s worth noting that you are best to define your header before using result table. eg. auto result = <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a>({title, LGraphType}…) If you do not define header and initialize by <a class="reference internal" href="#classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"><span class="std std-ref">Result()</span></a>, you will get a empty table without header, you just use the table after using [ResetHeader] method to set your header. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultEv">
+<span id="_CPPv3N10lgraph_api6Result6ResultEv"></span><span id="_CPPv2N10lgraph_api6Result6ResultEv"></span><span id="lgraph_api::Result::Result"></span><span class="target" id="classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aec54d6cf6ac1ac561febf2d4db046bd6"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1adbe90e1fe046f2cd689d8dadd67177c9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="lgraph_api::Result::GetType__ss"></span><span class="target" id="classlgraph__api_1_1Result_1a1015a1bde96a85591fc70273ad140b35"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">title</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get type of title. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>title</strong> – One of titles in table.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>LGraphType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aa5f20d3711f82acbdd1fbf2ea28d5ece"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1a45a2260d7f28e56b5c3e5a7b94789766"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result13MutableRecordEv">
+<span id="_CPPv3N10lgraph_api6Result13MutableRecordEv"></span><span id="_CPPv2N10lgraph_api6Result13MutableRecordEv"></span><span id="lgraph_api::Result::MutableRecord"></span><span class="target" id="classlgraph__api_1_1Result_1ad4bea412e4aef69da8464dd0a83b2a64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">MutableRecord</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result13MutableRecordEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Create a new record in the table and return the record. The record is the reference of record in the table, if you want to modify the record, you must assign return value to a reference variable. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The reference of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7ReserveE6size_t">
+<span id="_CPPv3N10lgraph_api6Result7ReserveE6size_t"></span><span id="_CPPv2N10lgraph_api6Result7ReserveE6size_t"></span><span id="lgraph_api::Result::Reserve__s"></span><span class="target" id="classlgraph__api_1_1Result_1a204d25ea43252cdf35dc6e859f765410"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reserve</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7ReserveE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>This function attempts to reserve enough memory for the result vector to hold the specified number of elements. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api6Result6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api6Result6ResizeE6size_t"></span><span id="lgraph_api::Result::Resize__s"></span><span class="target" id="classlgraph__api_1_1Result_1a9b2c775a0d09660185780ee0a7ea6be1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResizeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>This function will resize the vector to the specified number of elements </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result2AtE6size_t">
+<span id="_CPPv3N10lgraph_api6Result2AtE6size_t"></span><span id="_CPPv2N10lgraph_api6Result2AtE6size_t"></span><span id="lgraph_api::Result::At__s"></span><span class="target" id="classlgraph__api_1_1Result_1a030c64fc1715cdb057995bf9ff5870f6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">At</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result2AtE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Provides access to the data contained in the vector. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6HeaderEv">
+<span id="_CPPv3N10lgraph_api6Result6HeaderEv"></span><span id="_CPPv2N10lgraph_api6Result6HeaderEv"></span><span id="lgraph_api::Result::Header"></span><span class="target" id="classlgraph__api_1_1Result_1accfa1228e11954438cbaa8ad4d6be5e9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Header</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6HeaderEv" title="永久链接至目标"></a><br></dt>
+<dd><p>return header of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>header. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Result4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Result4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Result4SizeEv"></span><span id="lgraph_api::Result::SizeC"></span><span class="target" id="classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Result4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>return size of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>table size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4DumpEb">
+<span id="_CPPv3N10lgraph_api6Result4DumpEb"></span><span id="_CPPv2N10lgraph_api6Result4DumpEb"></span><span id="lgraph_api::Result::Dump__b"></span><span class="target" id="classlgraph__api_1_1Result_1ac839e6ed0453fe8ed7fac29e9a6803d1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Dump</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_standard</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4DumpEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Serialize the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>is_standard</strong> – (Optional) If true, the result will serialize to a standard result, the standard result can be Visualized in web. If false, result will serialize a json object &amp;#8212; SDK result.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Serialize result. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="lgraph_api::Result::Load__ssCR"></span><span class="target" id="classlgraph__api_1_1Result_1a405e30d792103a7989739a05f992c94a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Load</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">json</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deserialize data to result table. This will be clear original data and header, please use this function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>json</strong> – Json string to be deserialized. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result12ClearRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result12ClearRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result12ClearRecordsEv"></span><span id="lgraph_api::Result::ClearRecords"></span><span class="target" id="classlgraph__api_1_1Result_1af629a0e98c5fbb4adf85475b0073f48a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClearRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result12ClearRecordsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Clear all the records, <a class="reference internal" href="#classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"><span class="std std-ref">Size()</span></a> will be 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10BoltHeaderEv">
+<span id="_CPPv3N10lgraph_api6Result10BoltHeaderEv"></span><span id="_CPPv2N10lgraph_api6Result10BoltHeaderEv"></span><span id="lgraph_api::Result::BoltHeader"></span><span class="target" id="classlgraph__api_1_1Result_1a18c695165355bb5431690e26af2a2d28"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltHeader</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10BoltHeaderEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11BoltRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result11BoltRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result11BoltRecordsEv"></span><span id="lgraph_api::Result::BoltRecords"></span><span class="target" id="classlgraph__api_1_1Result_1a55a40428869f85c65c6dfa3389fe75dc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11BoltRecordsEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result16MarkPythonDriverEb">
+<span id="_CPPv3N10lgraph_api6Result16MarkPythonDriverEb"></span><span id="_CPPv2N10lgraph_api6Result16MarkPythonDriverEb"></span><span id="lgraph_api::Result::MarkPythonDriver__b"></span><span class="target" id="classlgraph__api_1_1Result_1aac0dbd9e0db9031bf18adb7e7618aac6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MarkPythonDriver</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_python_driver</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result16MarkPythonDriverEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Mark that the result is returned to python driver. Python driver is special, use the virtual edge id instead of the real edge id </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10RecordViewE7int64_t">
+<span id="_CPPv3N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="_CPPv2N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="lgraph_api::Result::RecordView__int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1abc994177cadf7bb0d070dd81ad8ea8b9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">RecordView</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">row_num</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10RecordViewE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get record of the table, if row number is more bigger than max length of table, throw a exception. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>row_num</strong> – row number of the table.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>One <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6resultE">
+<span id="_CPPv3N10lgraph_api6Result6resultE"></span><span id="_CPPv2N10lgraph_api6Result6resultE"></span><span id="lgraph_api::Result::result__std::vector:Record:"></span><span class="target" id="classlgraph__api_1_1Result_1a81372de9efc3519cb68a6e51335acfd4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6resultE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6headerE">
+<span id="_CPPv3N10lgraph_api6Result6headerE"></span><span id="_CPPv2N10lgraph_api6Result6headerE"></span><span id="lgraph_api::Result::header__std::vector:std::pair:ss.LGraphType::"></span><span class="target" id="classlgraph__api_1_1Result_1ac1d5325a16b7b45115c0e32c73078d4d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6headerE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10row_count_E">
+<span id="_CPPv3N10lgraph_api6Result10row_count_E"></span><span id="_CPPv2N10lgraph_api6Result10row_count_E"></span><span id="lgraph_api::Result::row_count___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0a15002d39b5391c9c693671d605e56c"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">row_count_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10row_count_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result17is_python_driver_E">
+<span id="_CPPv3N10lgraph_api6Result17is_python_driver_E"></span><span id="_CPPv2N10lgraph_api6Result17is_python_driver_E"></span><span id="lgraph_api::Result::is_python_driver___b"></span><span class="target" id="classlgraph__api_1_1Result_1a8714076c1ee8bd005935652057221763"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_python_driver_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result17is_python_driver_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6v_eid_E">
+<span id="_CPPv3N10lgraph_api6Result6v_eid_E"></span><span id="_CPPv2N10lgraph_api6Result6v_eid_E"></span><span id="lgraph_api::Result::v_eid___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0c2a905250ba619da58c3592f54daea7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">v_eid_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6v_eid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">lgraph::StateMachine</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">cypher::PluginAdapter</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-rpc-client">
+<h2>lgraph_rpc_client<a class="headerlink" href="#lgraph-rpc-client" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410fma_common">
+<span id="_CPPv310fma_common"></span><span id="_CPPv210fma_common"></span><span id="fma_common"></span><span class="target" id="namespacefma__common"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fma_common</span></span></span><a class="headerlink" href="#_CPPv410fma_common" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_rpc">
+<span id="_CPPv310lgraph_rpc"></span><span id="_CPPv210lgraph_rpc"></span><span id="lgraph_rpc"></span><span class="target" id="namespacelgraph__rpc"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_rpc</span></span></span><a class="headerlink" href="#_CPPv410lgraph_rpc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryTypeE">
+<span id="_CPPv3N6lgraph14GraphQueryTypeE"></span><span id="_CPPv2N6lgraph14GraphQueryTypeE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType6CYPHERE">
+<span id="_CPPv3N6lgraph14GraphQueryType6CYPHERE"></span><span id="_CPPv2N6lgraph14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType6CYPHERE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType3GQLE">
+<span id="_CPPv3N6lgraph14GraphQueryType3GQLE"></span><span id="_CPPv2N6lgraph14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType3GQLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientTypeE">
+<span id="_CPPv3N6lgraph10ClientTypeE"></span><span id="_CPPv2N6lgraph10ClientTypeE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClientType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a60813255cdc667f2d2f2ddb427d32d44"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98ab892a078fa6077db32721c67735c56fd"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INDIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a43005cd0efa3b1e1373be596db0ee869"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SINGLE_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientE">
+<span id="_CPPv3N6lgraph9RpcClientE"></span><span id="_CPPv2N6lgraph9RpcClientE"></span><span id="lgraph::RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_rpc_client.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a8995083e1c9332090bdbbced0704b1b9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__std::vector:ss:R.ss.ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a59ff51f4744de0edfe8571844287a51a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">urls</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">user</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>urls</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClientD0Ev"></span><span id="lgraph::RpcClient::~RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient_1a0f8219dbf08d58f7cfc0a853538176a4"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallCypher__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a456fdf97ad54654b985ebd5add140db3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a cypher query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallCypherToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1af9ef8ca1182193ef2c18062ecf23eeb7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypherToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a cypher query to leader </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallGql__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a7cfb10baca3d2f668a10ca43e399afc5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a gql query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallGqlToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a189850ee468b61a65982b7e505c8265b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGqlToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a gql query to leader </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="lgraph::RpcClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a93f4c769de4f1979e4ab824afdaa8ead"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::CallProcedureToLeader__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1a3e5b11b2f703f41d40a2afd9c7581376"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedureToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure to leader </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.ssCR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a0081b8bb075d1be82d8c92281d907cdc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Load a built-in procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_file</strong> – <strong>[in]</strong> the source_file contain procedure code. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Load a built-in procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::ListProcedures__ssR.ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa090037a4c3944d76e3cbf8c07f569b0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>List user-defined procedures </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient6LogoutEv"></span><span id="lgraph::RpcClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient6LogoutEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Client log out </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::IsReadQuery__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a891d9b465df285ae69983ea3aabebde0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Determine whether it is a read-only query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClient__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af77b4e340b5e79a7875f8f065fd221e5"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEb">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEb"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEb"></span><span id="lgraph::RpcClient::GetClient__b"></span><span class="target" id="classlgraph_1_1RpcClient_1ac3415aee2cca8ddb4c12473be63f42a2"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">isReadQuery</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>isReadQuery</strong> – <strong>[in]</strong> read query or not. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClientByNode__ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af935a15699e0f1004779a265afd67c0a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClientByNode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the client according to the node url </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>url</strong> – <strong>[in]</strong> Node address of client connection. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Rpc client connecting to url. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="lgraph::RpcClient::RefreshUserDefinedProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1af85d15b19d971fbe1babd8d06f5ae2c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshUserDefinedProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh User-defined Procedure </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="lgraph::RpcClient::RefreshBuiltInProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1a5d1a4ee81316d67c4d000e598ef41fec"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshBuiltInProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh Built-in Procedure </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="lgraph::RpcClient::RefreshClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1ab683309ba410ef5c7c65ed6a08b085d9"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh the client connection pool according to the cluster status </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="lgraph::RpcClient::LoadBalanceClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1a9b83e575619171ca739b140ffe024207"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadBalanceClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Load balance the client pool </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshConnectionEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="lgraph::RpcClient::RefreshConnection"></span><span class="target" id="classlgraph_1_1RpcClient_1a8957fe9842f100f0e80778649ab7ba14"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshConnection</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshConnectionEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh client pool, procedure info </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F">
+<span id="_CPPv3I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span id="_CPPv2I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">F</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph_1_1RpcClient_1a83227aa710bb0fb4cd66dc7e4b00af5a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DoubleCheckQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="lgraph::RpcClient::DoubleCheckQuery::F"><span class="n"><span class="pre">F</span></span></a><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">f</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="永久链接至目标"></a><br></dt>
+<dd><p>If an exception is thrown in the query, refresh the connection and re-execute </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_typeE">
+<span id="_CPPv3N6lgraph9RpcClient11client_typeE"></span><span id="_CPPv2N6lgraph9RpcClient11client_typeE"></span><span id="lgraph::RpcClient::client_type__ClientType"></span><span class="target" id="classlgraph_1_1RpcClient_1a376acacd121bd1f972b5fb097e220fd9"></span><a class="reference internal" href="#_CPPv4N6lgraph10ClientTypeE" title="lgraph::ClientType"><span class="n"><span class="pre">ClientType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_type</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient4userE"></span><span id="lgraph::RpcClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4userE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient8passwordE"></span><span id="lgraph::RpcClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient8passwordE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11base_clientE">
+<span id="_CPPv3N6lgraph9RpcClient11base_clientE"></span><span id="_CPPv2N6lgraph9RpcClient11base_clientE"></span><span id="lgraph::RpcClient::base_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a58adfed74cd9daeb6b32a267039e925b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11base_clientE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4urlsE">
+<span id="_CPPv3N6lgraph9RpcClient4urlsE"></span><span id="_CPPv2N6lgraph9RpcClient4urlsE"></span><span id="lgraph::RpcClient::urls__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a306ada97a24c8198c1a0c9c3c5b0bb25"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">urls</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4urlsE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13leader_clientE">
+<span id="_CPPv3N6lgraph9RpcClient13leader_clientE"></span><span id="_CPPv2N6lgraph9RpcClient13leader_clientE"></span><span id="lgraph::RpcClient::leader_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a13cc47368956dc5404b8c30b89c359f9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">leader_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13leader_clientE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_poolE">
+<span id="_CPPv3N6lgraph9RpcClient11client_poolE"></span><span id="_CPPv2N6lgraph9RpcClient11client_poolE"></span><span id="lgraph::RpcClient::client_pool__std::deque:std::shared_ptr:lgraph::RpcClient::RpcSingleClient::"></span><span class="target" id="classlgraph_1_1RpcClient_1a844140b131b865884e1233813d5ed217"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">deque</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_pool</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_poolE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient19built_in_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient19built_in_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient19built_in_proceduresE"></span><span id="lgraph::RpcClient::built_in_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1a18060c9aed7ccf4e945b9f88d03142d2"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">built_in_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient19built_in_proceduresE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23user_defined_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="lgraph::RpcClient::user_defined_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1aea4d05a8b62f0732342d07a9495616cf"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_defined_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23user_defined_proceduresE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21cypher_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient21cypher_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient21cypher_write_constantE"></span><span id="lgraph::RpcClient::cypher_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a632dd8c3163187f7e6faa9271b7b4cfc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21cypher_write_constantE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18gql_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient18gql_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient18gql_write_constantE"></span><span id="lgraph::RpcClient::gql_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a9ec0e77daff8924f52eb7f2e177cc1fc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">gql_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18gql_write_constantE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientE"></span><span id="lgraph::RpcClient::RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::RpcSingleClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae26aab72012bcb1ee86fb02e92a9613d"></span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>RpcSingleClient Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="lgraph::RpcClient::RpcSingleClient::~RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a1a143a1804f6bf71869b0ee5a6dc1462"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::RpcSingleClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Load a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::RpcSingleClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2b0a265853b25e1e9b36de7acc58c470"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json， Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::ListProcedures__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a44431b16908099e6e5134afbe127ab63"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>List user-defined procedures </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallCypher__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aff1bfcba1cd1754363bb2adf51db086a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a cypher query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallGql__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2fb61a89fc5e431b2433d52059467be0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a gql query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="lgraph::RpcClient::RpcSingleClient::GetUrl"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad4d20fca6bae3f93f4d1e714aacb03cd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUrl</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the url of single client. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>the url of single client. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="lgraph::RpcClient::RpcSingleClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Client log out </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleRequest__LGraphRequestP"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a61415af9341546df1ad67eed0ea2dbaa"></span><span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleRequest</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">LGraphRequest</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">req</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleGraphQueryRequest__lgraph::GraphQueryType.LGraphResponseP.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a63cc8e69616efdad5460f648780a6bb2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleGraphQueryRequest</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">res</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="lgraph::RpcClient::RpcSingleClient::GraphQueryResponseExtractor__GraphQueryResponseCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a4eb9039c5c4d7e1bd1c065e71aaa75d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryResponseExtractor</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">GraphQueryResponse</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="lgraph::RpcClient::RpcSingleClient::url__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae43c7d8d482ec3550b30cbc7dc23b9f0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">url</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="lgraph::RpcClient::RpcSingleClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="lgraph::RpcClient::RpcSingleClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="lgraph::RpcClient::RpcSingleClient::token__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a9f7d94df8d0a73f04a003fe5032ba32d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">token</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="lgraph::RpcClient::RpcSingleClient::server_version__int64_t"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a3de46036a491e337d41dba033c215120"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">server_version</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="lgraph::RpcClient::RpcSingleClient::channel__std::shared_ptr:lgraph_rpc::m_channel:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ac34b00e3851c29e651d8ca31fe21a9be"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">channel</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="lgraph::RpcClient::RpcSingleClient::cntl__std::shared_ptr:lgraph_rpc::m_controller:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a7d9cee7bb74b09c0ff1b71d2a1b4ef8d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_controller</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cntl</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="lgraph::RpcClient::RpcSingleClient::options__std::shared_ptr:lgraph_rpc::m_channel_options:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a18a1c01a5579128138eeddb758b305d6"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel_options</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">options</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-traversal">
+<h2>lgraph_traversal<a class="headerlink" href="#lgraph-traversal" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalE">
+<span id="_CPPv3N10lgraph_api9traversalE"></span><span id="_CPPv2N10lgraph_api9traversalE"></span><span id="lgraph_api::traversal"></span><span class="target" id="namespacelgraph__api_1_1traversal"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">traversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalE" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb">
+<span id="_CPPv3N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span id="_CPPv2N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a726096df46599bdfb914a6ca3420ec96"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FindVertices</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">filter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Retrieve all vertices passing the specified filter. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>filter</strong> – <strong>[inout]</strong> The user-defined filter function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The corresponding list of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb">
+<span id="_CPPv3I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span id="_CPPv2I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1aceb3385f1d10f71f5d9aa46fcdd92915"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">frontier</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Extract data from specified vertices. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">模板参数</dt>
+<dd class="field-even"><p><strong>VertexData</strong> – Type of the vertex data. </p>
+</dd>
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The database. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>frontier</strong> – <strong>[inout]</strong> The vertices to extract data from. </p></li>
+<li><p><strong>extract</strong> – <strong>[inout]</strong> The user-defined extract function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The corresponding extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT">
+<span id="_CPPv3I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span id="_CPPv2I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a860101673fe319842615891bdce356d5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DefaultFilter</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="lgraph_api::traversal::DefaultFilter::IT"><span class="n"><span class="pre">IT</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="永久链接至目标"></a><br></dt>
+<dd><p>The default filter you may use. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>it</strong> – <strong>[inout]</strong> An iterator class.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Always true. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a0be095f6cae74a9b2b83368bcaa8bb9d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Function closure filtering by label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>label</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a916a3c242ae9447471b4116416ac3200"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Function closure filtering by label id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>label_id</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::eq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a787283b8c440e78fe08f3233ec9927d1"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::neq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a5a867323375932ba84f360b8f7ba104d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::eq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1aca364480fdfefebade068076c782085e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::neq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a2360c3785fed893a88cc4ab67d8a56de"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE">
+<span id="_CPPv3N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="_CPPv2N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="lgraph_api::traversal::MAX_RESULT_SIZE__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a19036385f876c801d15c194fc62e7531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE">
+<span id="_CPPv3N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="_CPPv2N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="lgraph_api::traversal::TRAVERSAL_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a86e405bbe2ac6d2a74230ae2305fd8e0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE">
+<span id="_CPPv3N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="_CPPv2N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="lgraph_api::traversal::TRAVERSAL_ALLOW_REVISITS__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a92a5114a7f6be9af4e24557fa238f8b7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_ALLOW_REVISITS</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4EdgeE">
+<span id="_CPPv3N10lgraph_api9traversal4EdgeE"></span><span id="_CPPv2N10lgraph_api9traversal4EdgeE"></span><span id="lgraph_api::traversal::Edge"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent an edge. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="lgraph_api::traversal::Edge::Edge__s.uint16_t.uint64_t.s.s.b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5fa8e10b10d8db22077e6a8f51c56a4f"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">start</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">tid</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">end</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">eid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">forward</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>start</strong> – The start. </p></li>
+<li><p><strong>lid</strong> – The lid. </p></li>
+<li><p><strong>tid</strong> – The tid. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>eid</strong> – The eid. </p></li>
+<li><p><strong>forward</strong> – True to forward. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="lgraph_api::traversal::Edge::Edge__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1accd38aace77501c9cf5cae967e894970"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="lgraph_api::traversal::Edge::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="lgraph_api::traversal::Edge::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the start vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The start vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="lgraph_api::traversal::Edge::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the end vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The end vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="lgraph_api::traversal::Edge::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a15b074c85865e730723336acec71f79e"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the label ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The label ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="lgraph_api::traversal::Edge::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a02537fe49ffb801dd20bdaae51b29325"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Temporal ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The temporal ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="lgraph_api::traversal::Edge::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a2592e180e605668b296b9251bc4d275a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the edge ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The edge ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="lgraph_api::traversal::Edge::IsForwardC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a41a01f6b828238200fef82f544fd172e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsForward</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the direction of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>true : forward; false: backward. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="lgraph_api::traversal::Edge::GetSrcVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5490526b0251ebb9ad277c9b314eedbb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrcVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the source vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The source vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="lgraph_api::traversal::Edge::GetDstVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ab717cca464319d1b380648aedbaaca1d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDstVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the destination vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The destination vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge6start_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge6start_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge6start_E"></span><span id="lgraph_api::traversal::Edge::start___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ad914f6be659b44fe8e11acc02cf6eeb6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">start_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge6start_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4end_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4end_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4end_E"></span><span id="lgraph_api::traversal::Edge::end___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1afdac24f7adfe72f79983c12b08e566e5"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4end_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4eid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4eid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4eid_E"></span><span id="lgraph_api::traversal::Edge::eid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a74dfb17650dad72d071112c995343f25"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4eid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4lid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4lid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4lid_E"></span><span id="lgraph_api::traversal::Edge::lid___uint16_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4b77269210d4ee2d997719c8dee806ea"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4lid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4tid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4tid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4tid_E"></span><span id="lgraph_api::traversal::Edge::tid___int64_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a6ec1f5936b6351a1911a966a8a08fd42"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4tid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge8forward_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge8forward_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge8forward_E"></span><span id="lgraph_api::traversal::Edge::forward___b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1aae1b80cda1e8b80f4a52f8a6d1f22df8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">forward_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge8forward_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversalE"></span><span id="lgraph_api::traversal::FrontierTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversalE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> provides the most common way to traverse graphs. You can start from a single vertex or a set of vertices (known as the initial frontier), and expand them frontier by frontier, each time visiting neighboring vertices of the current frontier and make those matching specified conditions the new frontier. One powerful feature of <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> is that the traversal can be performed in parallel, accelerating those <em>deep</em> queries significantly. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::FrontierTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a545b378096e3004e11024a15fd17bd27"></span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> object. Note that the transaction must be read- only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Be careful when TRAVERSAL_ALLOW_REVISITS is used, as each vertex may be visited more than once, making the result set huge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::FrontierTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a9c2251578e77394a41833329c9200e72"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ae8aee8d3fccc6f15e21f0e5a4652c33e"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a79b977639f217d9411ac48a32c6e83f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad655c689b55d2072e9212b55ea015bb0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="lgraph_api::traversal::FrontierTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="lgraph_api::traversal::FrontierTraversal::ResetVisited"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aaf986f1e13f0da831c3d8277cdb860f0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetVisited</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset only the visited flags. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="lgraph_api::traversal::FrontierTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="lgraph_api::traversal::FrontierTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="lgraph_api::traversal::FrontierTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::FrontierTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::curr_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a272d864e6eface58376c0d0c08c89401"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::next_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad05308b798bf29c2e2e6fcf6331150c6"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="lgraph_api::traversal::FrontierTraversal::visited___ParallelBitset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ac784cfc9970b0a1fb2e5a1678ed59284"></span><span class="n"><span class="pre">ParallelBitset</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">visited_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelperE">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelperE"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelperE"></span><span id="lgraph_api::traversal::IteratorHelper"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1IteratorHelper"><span class="std std-ref">IteratorHelper</span></a> provides some useful methods, such as casting Vertex/Edge objects to their iterator forms. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="lgraph_api::traversal::IteratorHelper::IteratorHelper__TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a7d72fd8bc5a5a60f16a5eea5b1ae781e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a9db8a753c5773fd00186665e172e8df2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd><p>Casting a <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> to a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vertex</strong> – A <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> object.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> corresponding to vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1ab5ec73c9874f5c269c066857075d67c6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge" title="永久链接至目标"></a><br></dt>
+<dd><p>Casting an <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Edge"><span class="std std-ref">Edge</span></a> to an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>edge</strong> – An edge object.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> corresponding to edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="lgraph_api::traversal::IteratorHelper::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathE">
+<span id="_CPPv3N10lgraph_api9traversal4PathE"></span><span id="_CPPv2N10lgraph_api9traversal4PathE"></span><span id="lgraph_api::traversal::Path"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="lgraph_api::traversal::Path::Path__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abd76ad8cca7c9f5611d89b6c94e88d53"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">start</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>start</strong> – The start. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="lgraph_api::traversal::Path::Path__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a6f0b65d8220590bc0de51a6f9178db0c"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="lgraph_api::traversal::Path::Path__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae8d80e874d2f88e507218f6db1ed2cdc"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Move constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERK4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a3640a670cabc7ff15a8bf5e31f83b3e9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERK4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Assignment operator </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERR4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae3dcf33db8617fe1de00cedc6541ae98"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERR4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Move assignment operator </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path6LengthEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path6LengthEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path6LengthEv"></span><span id="lgraph_api::traversal::Path::LengthC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1aa63d0332a20e86302501c8bd1db921c2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Length</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path6LengthEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the length of this path. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The path length. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="lgraph_api::traversal::Path::Append__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab88413d902928384d83cbad1df6de769"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge" title="永久链接至目标"></a><br></dt>
+<dd><p>Append an edge to the path. Note that the edge’s start vertex should match the current path’s end vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>edge</strong> – edge to append. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="lgraph_api::traversal::Path::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the start vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="lgraph_api::traversal::Path::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the end vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="lgraph_api::traversal::Path::GetLastEdgeC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abf723fca4ce807ccf77dc91e685b5545"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLastEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the last edge of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthEdge__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a7f37b5b5e876c5ec8836bba603e526e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Nth edge of this path. The available range of N is [0, Length). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthVertex__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab6aa8a9295375d526831278b2690558e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Nth vertex of this path. The available range of N is [0, Length]. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5dirs_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5dirs_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5dirs_E"></span><span id="lgraph_api::traversal::Path::dirs___std::vector:b:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a0ad3ec1585be61bf4e9ab8ae94bb4406"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dirs_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5dirs_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5lids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5lids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5lids_E"></span><span id="lgraph_api::traversal::Path::lids___std::vector:uint16_t:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a58d741b575ad6c800db503b3d2db61d3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint16_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5lids_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4ids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path4ids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path4ids_E"></span><span id="lgraph_api::traversal::Path::ids___std::vector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a2a21c3f2f91696ebc1c7d5109b5cc921"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4ids_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversalE"></span><span id="lgraph_api::traversal::PathTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversalE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> behaves similar to <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a>, except that 1) Each vertex could be revisited multiple times. 2) Each traversed path would be stored, and the filter function has access to the path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::PathTraversal::PathTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af738f641e5877af62941a670ceedd359"></span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> object. Note that the transaction must be read-only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Since TRAVERSAL_ALLOW_REVISITS is implied in <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> and storing the Paths also takes a lot of space, the memory consumption could be very large if the filters are not very selective. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::PathTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4664408bde6c8bc833b2d308a7a9c770"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a346ba8aed662685cd78506c8baec815c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a0a54b5500485e208383933b8f2817675"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1abb7d1f2986dde079c71c568410386249"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="lgraph_api::traversal::PathTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="lgraph_api::traversal::PathTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="lgraph_api::traversal::PathTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="lgraph_api::traversal::PathTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::PathTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::curr_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ac73154ee309f0dad63fb1a1790e23025"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::next_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af032087096fefc9f61b4351bc5e9a71d"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6VertexE">
+<span id="_CPPv3N10lgraph_api9traversal6VertexE"></span><span id="_CPPv2N10lgraph_api9traversal6VertexE"></span><span id="lgraph_api::traversal::Vertex"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a vertex. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="lgraph_api::traversal::Vertex::Vertex__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a3f6911c4ec59435701457f131e89af4a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="lgraph_api::traversal::Vertex::Vertex__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a13f7b30a546a536a3dfafd128adb609f"></span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="lgraph_api::traversal::Vertex::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="lgraph_api::traversal::Vertex::GetIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a63765fbd0690661e2af3bc97083475fc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The Id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex4vid_E">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex4vid_E"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex4vid_E"></span><span id="lgraph_api::traversal::Vertex::vid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a224220636b53e35b1b5bf8c0e88717d0"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex4vid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-txn">
+<h2>lgraph_txn<a class="headerlink" href="#lgraph-txn" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api11TransactionE"></span><span id="lgraph_api::Transaction"></span><span class="target" id="classlgraph__api_1_1Transaction"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_txn.h&gt;</em></div>
+<p>TuGraph operations happen in transactions. A transaction is sequence of operations that is carried out atomically on the <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. TuGraph transactions provides full ACID guarantees. </p>
+<p>Transactions are created using <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"><span class="std std-ref">GraphDB::CreateReadTxn()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"><span class="std std-ref">GraphDB::CreateWriteTxn()</span></a>. A read transaction can only perform read operations, otherwise an exception is thrown. A write transaction can perform reads as well as writes. There are performance differences between read and write operations. So if you only need read in a transaction, you should create a read transaction.</p>
+<p>Each transaction must be used in one thread only, and they should not be passed from one thread to another unless it is a forked transaction.</p>
+<p>Read transactions can be forked. The new copy of the transaction will have the same view as the forked one, and it can be used in a separate thread. By forking from one read transaction and using the forked copies in different threads, we can parallelize the execution of specific operations. For example, you can implement a parallel BFS with this capability. Also, you can dump a snapshot of the whole graph using </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09c0d46171b7562e16c3a697f77fca90"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERR11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERR11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERR11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3d6029838ae611c2c7bbc3c59afe059"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERR11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a44fabd0e73ed35b6d683051496a3f30f"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERK11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERK11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERK11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1abde1d510a232da04117f21bd23de8143"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERK11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6CommitEv">
+<span id="_CPPv3N10lgraph_api11Transaction6CommitEv"></span><span id="_CPPv2N10lgraph_api11Transaction6CommitEv"></span><span id="lgraph_api::Transaction::Commit"></span><span class="target" id="classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Commit</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6CommitEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Commits this transaction. Note that optimistic write transactions may fail to commit (an TxnConflict would be thrown). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5AbortEv">
+<span id="_CPPv3N10lgraph_api11Transaction5AbortEv"></span><span id="_CPPv2N10lgraph_api11Transaction5AbortEv"></span><span id="lgraph_api::Transaction::Abort"></span><span class="target" id="classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Abort</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5AbortEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Aborts this transaction. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction7IsValidEv">
+<span id="_CPPv3NK10lgraph_api11Transaction7IsValidEv"></span><span id="_CPPv2NK10lgraph_api11Transaction7IsValidEv"></span><span id="lgraph_api::Transaction::IsValidC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this transaction is valid. <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> becomes invalid after calling <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"><span class="std std-ref">Abort()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"><span class="std std-ref">Commit()</span></a>. Operations on invalid transaction yields exceptions. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv">
+<span id="_CPPv3NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="_CPPv2NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="lgraph_api::Transaction::IsReadOnlyC"></span><span class="target" id="classlgraph__api_1_1Transaction_1afde2da3cd793a0a0403ea2ea0c9b9ea7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadOnly</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this txn is read only </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if read only, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6GetTxnEv">
+<span id="_CPPv3N10lgraph_api11Transaction6GetTxnEv"></span><span id="_CPPv2N10lgraph_api11Transaction6GetTxnEv"></span><span id="lgraph_api::Transaction::GetTxn"></span><span class="target" id="classlgraph__api_1_1Transaction_1a94bc9b71b14ae6ad7c788d20ec39b769"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6GetTxnEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="lgraph_api::Transaction::GetVertexIterator"></span><span class="target" id="classlgraph__api_1_1Transaction_1a16d76f5c12d744846d85b007cf4e094c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get a vertex iterator pointing to the first vertex. If there is no vertex, the iterator is invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="lgraph_api::Transaction::GetVertexIterator__int64_t.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1af8c95376a78769b0717fd40fdcd274eb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets a vertex iterator pointing to the Vertex with vid. If the vertex does not exist, the iterator is invalid. If nearest==true, the iterator points to the first vertex sorted by vid, with id&gt;=vid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vid</strong> – The vid. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to point to the nearest vertex sorted by vid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9bcd70f9274974a3028ef762228e176e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an out edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1add821551447553956775fac4656f3d94"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an in edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab3bfd10ebeec5f7d0455d1fbc0762e73"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="lgraph_api::Transaction::GetNumVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4b870210a66a2f239535915497e26278"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of vertex labels </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The number of vertex labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="lgraph_api::Transaction::GetNumEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1aec256df0cdfca791031bad9c43c63061"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of edge labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The number of edge labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="lgraph_api::Transaction::ListVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a5b2320193bfb8ffbfaa157a110d550ad"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Lists all vertex labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="lgraph_api::Transaction::ListEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae77fe52ec78bc3e8d8d92fe8d7a3accb"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List all edge labels </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1a3769873514b6a5dd62b04414ff627c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label name.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab030e136e6b28679acbb59a08a977090"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1afd8f546dcb187e1be6f86d268c62996b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4afb55d1ce9b5906c6721f5c4b3b3d82"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac461aea7ee379f8669f45f9782cea1f4"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a55194445591f9fa6730dd8deb99e2414"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2d9a2f736cfb96a2f61e4de3072eb811"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetEdgeFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c13f1f3f527b37d3a221d4adb06cc5c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae62bafbd58f35cfcc01255fe4113094f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2c972657b35f86a21527bc2ad1be741e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae57f64149da2f4d2f972f49a53943591"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertVertex__s.s.std::vector:s:CR.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad86ef0cb03585dd0361042f69fb6714c"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">primary_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">unique_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert a vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>primary_pos</strong> – The location of the primary field in field_ids. </p></li>
+<li><p><strong>unique_pos</strong> – The locations of the unique index field in field_ids, can be empty. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>0: nothing happened because of index conflict 1: the vertex is inserted 2: the vertex is updated </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee14b2bcd0e170d5b87924a6a9a3e16f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3452ae2c9cae9850a7e53c2ddcc6240"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add0eea119e67210b57d9b8b6119e88d4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad342ee46d6f7f955529018100a701185"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9663b407c7f5ce18af938c7b670dd3fd"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1af3a3806320f56cb01f5edc7ff364ad80"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1acd0cba3b23983114fdd65784b11a3297"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">unique_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>unique_pos</strong> – The locations of the unique index field in field_ids, can be empty. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>0: nothing happened because of index conflict 1: the vertex is inserted 2: the vertex is updated </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a66d9f07dc220285b2fbec99fb088ad4a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List indexes </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A vector of vertex index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction26ListVertexCompositeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction26ListVertexCompositeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction26ListVertexCompositeIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexCompositeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a35a12d4a7a7fe0dc31d3221e8afcc676"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexSpecE" title="lgraph_api::CompositeIndexSpec"><span class="n"><span class="pre">CompositeIndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexCompositeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction26ListVertexCompositeIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List indexes </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A vector of vertex composite index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="lgraph_api::Transaction::ListEdgeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee4d71f4e5ce213bbe886162db6edba0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List indexes </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A vector of edge index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aea99efb5e098fca6157f419ec7e4396c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__s.std::vector:s:CR.std::vector:FieldData:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aa4db70c6d33c32018c0279601634e1b6"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e87da96ea73d8c709ef75a92b2bf5c4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add8eaa25484aefe92c14c0340bb35841"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__ssCR.std::vector:ss:CR.std::vector:FieldData:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab13a6cc8d58d716f8388455b1b571e4a"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a49deaf34c918d940432204e5a5a16cff"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09382e2279bb78f1a79443741112a57e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__ssCR.std::vector:ss:CR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c87149e83ca6f4de94e0c5c9bf88a41"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0a484619a92fe73247f86d9db09d2ead"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of vertices. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of edges. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee85d698359c92dc3c9bc9f9e65ecf0f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab94cbd4824258986d5d32d00453c85f7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2eddb62a56cf0030545bce6bef00104f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9af16d5a13268c711610cc3c615592c0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a594aa9d948f61ee8d06d5a3f8925c4e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9cc46853b60d578578649f8bef35d84d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9a16d2c7f0770fbfd38e53a4a95a165f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1adefa9906e0325df0316c499491f22adb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a99a3bbbf134a20c992b10ac015ea4131"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv">
+<span id="_CPPv3N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="_CPPv2N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="lgraph_api::Transaction::GetNumVertices"></span><span class="target" id="classlgraph__api_1_1Transaction_1a84acf46e241f12fe3480c203cbd59d3c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The nubmer of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexPrimaryField__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0b662063aee62d2793c634a132375ae9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexPrimaryField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex primary field </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The primary field. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5CountEv">
+<span id="_CPPv3N10lgraph_api11Transaction5CountEv"></span><span id="_CPPv2N10lgraph_api11Transaction5CountEv"></span><span id="lgraph_api::Transaction::Count"></span><span class="target" id="classlgraph__api_1_1Transaction_1a420ff169b39c4ce47b02a25a1eda00ae"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Count</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5CountEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the total number of vertex and edge </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>std::pair object, first element is vertex number, second is edge number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11CountDetailEv">
+<span id="_CPPv3N10lgraph_api11Transaction11CountDetailEv"></span><span id="_CPPv2N10lgraph_api11Transaction11CountDetailEv"></span><span id="lgraph_api::Transaction::CountDetail"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e88abab9d0a158b1dd1f72d97dcbda1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CountDetail</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11CountDetailEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the total number of vertex or edge for each label </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>std::tuple object list, first element indicates whether it is VERTEX or EDGE, second is label name, third is number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="lgraph_api::Transaction::Transaction__lgraph::TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1b5dc38854e41e00ee874297e73343af"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction4txn_E">
+<span id="_CPPv3N10lgraph_api11Transaction4txn_E"></span><span id="_CPPv2N10lgraph_api11Transaction4txn_E"></span><span id="lgraph_api::Transaction::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">GraphDB</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-types">
+<h2>lgraph_types<a class="headerlink" href="#lgraph-types" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15EdgeConstraintsE">
+<span id="_CPPv3N10lgraph_api15EdgeConstraintsE"></span><span id="_CPPv2N10lgraph_api15EdgeConstraintsE"></span><span id="lgraph_api::EdgeConstraints"></span><span class="target" id="namespacelgraph__api_1a7d597d281cbcd87325f58fcce96e5d34"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeConstraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="永久链接至目标"></a><br></dt>
+<dd><p>Edge constraints type define </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevelE">
+<span id="_CPPv3N10lgraph_api11AccessLevelE"></span><span id="_CPPv2N10lgraph_api11AccessLevelE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevelE" title="永久链接至目标"></a><br></dt>
+<dd><p>Access level a user or role has on a graph. NONE: no permission. READ: read-only, no write access. WRITE: can read and write vertex and edge, but cannot change meta data such as schema or access. FULL: full access, can modify schema, grant access to other users, or even delete this graph. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4NONEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4READE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4READE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62a3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4READE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ad4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel5WRITEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4FULLE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4FULLE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4FULLE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62aba7de5bc6888294e5884b024a4c894f1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FULL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4FULLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevelE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevelE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevelE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afe"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldAccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afeab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4NONEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4READE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4READE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afea3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4READE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afead4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryTypeE">
+<span id="_CPPv3N10lgraph_api14GraphQueryTypeE"></span><span id="_CPPv2N10lgraph_api14GraphQueryTypeE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType6CYPHERE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType6CYPHERE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType6CYPHERE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType3GQLE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType3GQLE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType3GQLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldTypeE">
+<span id="_CPPv3N10lgraph_api9FieldTypeE"></span><span id="_CPPv2N10lgraph_api9FieldTypeE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1da"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>Field and value types. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType3NULE">
+<span id="_CPPv3N10lgraph_api9FieldType3NULE"></span><span id="_CPPv2N10lgraph_api9FieldType3NULE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa4c175fbb65c723226d182dbfd556136a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType3NULE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BOOLE">
+<span id="_CPPv3N10lgraph_api9FieldType4BOOLE"></span><span id="_CPPv2N10lgraph_api9FieldType4BOOLE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daae663dbb8f8244e122acb5bd6b2c216e1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BOOLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4INT8E">
+<span id="_CPPv3N10lgraph_api9FieldType4INT8E"></span><span id="_CPPv2N10lgraph_api9FieldType4INT8E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daada138aad097eaac8697fe3661c91af95"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4INT8E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT16E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT16E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT16E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac4a99142c241d04e1607af8a319c201b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT16E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT32E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT32E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT32E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac1081c62db14e24ef35a1c3c36cba2e7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT32E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT64E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT64E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT64E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa423a1db7cbc915478f654b15f87f3aac"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT64E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5FLOATE">
+<span id="_CPPv3N10lgraph_api9FieldType5FLOATE"></span><span id="_CPPv2N10lgraph_api9FieldType5FLOATE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa9cf4a0866224b0bb4a7a895da27c9c4c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5FLOATE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api9FieldType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api9FieldType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa33465d1d419b1074fb259ef444609e92"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6DOUBLEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4DATEE">
+<span id="_CPPv3N10lgraph_api9FieldType4DATEE"></span><span id="_CPPv2N10lgraph_api9FieldType4DATEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa0ace72efd9e987dfd807365d0ca50141"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4DATEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType8DATETIMEE">
+<span id="_CPPv3N10lgraph_api9FieldType8DATETIMEE"></span><span id="_CPPv2N10lgraph_api9FieldType8DATETIMEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa86797ee5836338ee241ceee5cfc669e2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATETIME</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType8DATETIMEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6STRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType6STRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType6STRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaee847e634a4297b274316de8a8ca9921"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6STRINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BLOBE">
+<span id="_CPPv3N10lgraph_api9FieldType4BLOBE"></span><span id="_CPPv2N10lgraph_api9FieldType4BLOBE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa3a625432a45f9c83112036bc7a2d2d70"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BLOB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BLOBE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5POINTE">
+<span id="_CPPv3N10lgraph_api9FieldType5POINTE"></span><span id="_CPPv2N10lgraph_api9FieldType5POINTE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa15108ccafa3232b9067f889b6156f565"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5POINTE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaaebdbcb765394d25d6a604589a890f82"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType10LINESTRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType10LINESTRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType10LINESTRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa21af7314ca158a415f7e073333d14447"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType10LINESTRINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaa90611ea278d30580b21af6d65208307"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7POLYGONE">
+<span id="_CPPv3N10lgraph_api9FieldType7POLYGONE"></span><span id="_CPPv2N10lgraph_api9FieldType7POLYGONE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daad5355465780b9a6259ebbc74d47477db"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7POLYGONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaecdc92bf56d960b73b02ee40125758bc"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7SPATIALE">
+<span id="_CPPv3N10lgraph_api9FieldType7SPATIALE"></span><span id="_CPPv2N10lgraph_api9FieldType7SPATIALE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa608c1acc2033e0e07248c48ea01746ce"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SPATIAL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7SPATIALE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphTypeE">
+<span id="_CPPv3N10lgraph_api10LGraphTypeE"></span><span id="_CPPv2N10lgraph_api10LGraphTypeE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00d"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphType</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">uint16_t</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>a type of value used in result entry and parameter in procedure or plugin signature </p>
+<dl class="field-list simple">
+<dt class="field-odd">Param INTEGER</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param FLOAT</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param DOUBLE</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param BOOLEAN</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param STRING</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param MAP</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param NODE</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>, VertexId </p>
+</dd>
+<dt class="field-even">Param RELATIONSHIP</dt>
+<dd class="field-even"><p><a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> || <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>, <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p>
+</dd>
+<dt class="field-odd">Param PATH</dt>
+<dd class="field-odd"><p>lgraph_api::Path </p>
+</dd>
+<dt class="field-even">Param LIST</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param ANY</dt>
+<dd class="field-odd"><p>like Object in Java, its procedure author’s responsibility to check the underlying concrete type whether valid in runtime. </p>
+</dd>
+</dl>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3NULE">
+<span id="_CPPv3N10lgraph_api10LGraphType3NULE"></span><span id="_CPPv2N10lgraph_api10LGraphType3NULE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3NULE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7INTEGERE">
+<span id="_CPPv3N10lgraph_api10LGraphType7INTEGERE"></span><span id="_CPPv2N10lgraph_api10LGraphType7INTEGERE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5d5cd46919fa987731fb2edefe0f2a0c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INTEGER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7INTEGERE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType5FLOATE">
+<span id="_CPPv3N10lgraph_api10LGraphType5FLOATE"></span><span id="_CPPv2N10lgraph_api10LGraphType5FLOATE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dae738c26bf4ce1037fa81b039a915cbf6"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType5FLOATE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api10LGraphType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api10LGraphType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dafd3e4ece78a7d422280d5ed379482229"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6DOUBLEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7BOOLEANE">
+<span id="_CPPv3N10lgraph_api10LGraphType7BOOLEANE"></span><span id="_CPPv2N10lgraph_api10LGraphType7BOOLEANE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac48d5da12d702e73d6966069f2687376"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOLEAN</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7BOOLEANE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6STRINGE">
+<span id="_CPPv3N10lgraph_api10LGraphType6STRINGE"></span><span id="_CPPv2N10lgraph_api10LGraphType6STRINGE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da63b588d5559f64f89a416e656880b949"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6STRINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4NODEE">
+<span id="_CPPv3N10lgraph_api10LGraphType4NODEE"></span><span id="_CPPv2N10lgraph_api10LGraphType4NODEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da0cc25b606fe928a0c9a58f7f209c4495"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NODE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4NODEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE">
+<span id="_CPPv3N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span id="_CPPv2N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac5a4cec9a456484389b2573c8ae0a8bf"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RELATIONSHIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4PATHE">
+<span id="_CPPv3N10lgraph_api10LGraphType4PATHE"></span><span id="_CPPv2N10lgraph_api10LGraphType4PATHE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5ffb5f0d0de78321df46fc7c93ca64a3"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PATH</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4PATHE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4LISTE">
+<span id="_CPPv3N10lgraph_api10LGraphType4LISTE"></span><span id="_CPPv2N10lgraph_api10LGraphType4LISTE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da298cb25408234de02baf2085803a464a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LIST</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4LISTE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3MAPE">
+<span id="_CPPv3N10lgraph_api10LGraphType3MAPE"></span><span id="_CPPv2N10lgraph_api10LGraphType3MAPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5af1a3a285c2bdee4192223e31e1f833"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3MAPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3ANYE">
+<span id="_CPPv3N10lgraph_api10LGraphType3ANYE"></span><span id="_CPPv2N10lgraph_api10LGraphType3ANYE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da8e1bde3c3d303163521522cf1d62f21f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ANY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3ANYE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeTypeE">
+<span id="_CPPv3N10lgraph_api14PluginCodeTypeE"></span><span id="_CPPv2N10lgraph_api14PluginCodeTypeE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>Type of code given when loading a new plugin. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2PYE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2PYE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2PYE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3ae0a77e22f8238541046ba5f9a5941e9e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2PYE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2SOE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2SOE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2SOE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3af9f590fe6d84e72c832e714b75b1604b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SO</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2SOE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3CPPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3CPPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3CPPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aca1ef9dc7006f2011c38e2bcc8f64d16"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CPP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3CPPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3ZIPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3ZIPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3ZIPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aed0690cdc850739d6e2b7b888311e32c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ZIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3ZIPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexTypeE">
+<span id="_CPPv3N10lgraph_api9IndexTypeE"></span><span id="_CPPv2N10lgraph_api9IndexTypeE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>index type </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType14NonuniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType14NonuniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a5e3e0d5af84f4b5e85c9dca495b47018"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NonuniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is not unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a7f0f75f7fcd7d67aa985f11f3ebf2712"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GlobalUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is a global unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType15PairUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType15PairUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a89627e6fbb7ed5b8b3913ecbd253b52f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PairUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is a pair unique index, for edge index only key of pair unique index is one of the follow case : if src_vid &lt; dst_vid ,key is (index field value + src_vid + dst_vid) if src_vid &gt; dst_vid ,key is (index field value + dst_vid + src_vid) </p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexTypeE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexTypeE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexTypeE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CompositeIndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexType11UniqueIndexE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexType11UniqueIndexE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexType11UniqueIndexE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03afa1a33f381dab5d21a8c1241468b00c4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexType11UniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is not unique composite index Temporarily require all attributes to be non-empty attributes </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK11AccessLevel"></span><span id="lgraph_api::to_string__AccessLevelCR"></span><span class="target" id="namespacelgraph__api_1aaa50da267713908744fd8e2c5a6a4373"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK11AccessLevel" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="lgraph_api::to_string__FieldAccessLevelCR"></span><span class="target" id="namespacelgraph__api_1af06d7db8c2df7831e02af25d45ad43ef"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="lgraph_api::FieldAccessLevel"><span class="n"><span class="pre">FieldAccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK14GraphQueryType">
+<span id="_CPPv3N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="_CPPv2N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="lgraph_api::to_string__GraphQueryTypeCR"></span><span class="target" id="namespacelgraph__api_1acd1e36eab9c9fc42d4192f3d55e4504a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="lgraph_api::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK14GraphQueryType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE9FieldType">
+<span id="_CPPv3N10lgraph_api9to_stringE9FieldType"></span><span id="_CPPv2N10lgraph_api9to_stringE9FieldType"></span><span id="lgraph_api::to_string__FieldType"></span><span class="target" id="namespacelgraph__api_1a584042d80e34528010e1ad8e3e499b1d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the name of the given FieldType. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – when an unrecognizable FieldType is given.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>v</strong> – A FieldType.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Name of the given FieldType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType">
+<span id="_CPPv3N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="_CPPv2N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsField__LGraphType"></span><span class="target" id="namespacelgraph__api_1a4f4fd20c65be1aaa3f4d6e70e7d7218a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsField</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType">
+<span id="_CPPv3N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="_CPPv2N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsGraphElement__LGraphType"></span><span class="target" id="namespacelgraph__api_1a9fb9c1e160b13a90e177a8e8ec0e00fa"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsGraphElement</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType">
+<span id="_CPPv3N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="_CPPv2N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsCollection__LGraphType"></span><span class="target" id="namespacelgraph__api_1a82cc6a5df4119f903835efab9edbf4fe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsCollection</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType">
+<span id="_CPPv3N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="_CPPv2N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsAny__LGraphType"></span><span class="target" id="namespacelgraph__api_1aca1c7356409eb19c5deab724bc4fff2d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsAny</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE10LGraphType">
+<span id="_CPPv3N10lgraph_api9to_stringE10LGraphType"></span><span id="_CPPv2N10lgraph_api9to_stringE10LGraphType"></span><span id="lgraph_api::to_string__LGraphType"></span><span class="target" id="namespacelgraph__api_1a5113ccea82007fb6b30d591032637775"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType">
+<span id="_CPPv3N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="_CPPv2N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="lgraph_api::PluginCodeTypeStr__PluginCodeType"></span><span class="target" id="namespacelgraph__api_1ad94969b6b33bfee0e009c16ba50623a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeTypeStr</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="lgraph_api::PluginCodeType"><span class="n"><span class="pre">PluginCodeType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code_type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the name of plugin code types. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpecE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpecE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpecE"></span><span id="lgraph_api::CompositeIndexSpec"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CompositeIndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A composite index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec5labelE"></span><span id="lgraph_api::CompositeIndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec5labelE" title="永久链接至目标"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec6fieldsE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec6fieldsE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec6fieldsE"></span><span id="lgraph_api::CompositeIndexSpec::fields__std::vector:ss:"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1acf26f1505f276ea0dbf631c4bf19727a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fields</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec6fieldsE" title="永久链接至目标"></a><br></dt>
+<dd><p>fields name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec4typeE"></span><span id="lgraph_api::CompositeIndexSpec::type__CompositeIndexType"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1a2112c9c8e7921d5119a2aac88189e894"></span><a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="lgraph_api::CompositeIndexType"><span class="n"><span class="pre">CompositeIndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec4typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptionsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptionsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptionsE"></span><span id="lgraph_api::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Edge label options, contain fields only edge have </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-types">Public Types</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TemporalFieldOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439ac6e421eaad140c1bc1a39980502df80c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ASC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439a65a6d757dbb571ccc3af9706e9a5f607"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DESC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="lgraph_api::EdgeOptions::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5708a1309a1260a1c5a7208f9d7f25c2"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="lgraph_api::EdgeOptions::EdgeOptions__EdgeConstraintsCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5a91f7f6cbcd9600e96add55f510a9d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="lgraph_api::EdgeOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions5clearEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions5clearEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions5clearEv"></span><span id="lgraph_api::EdgeOptions::clear"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions5clearEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="lgraph_api::EdgeOptions::edge_constraints__EdgeConstraints"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ab879b0258a59289c195a102d07ae88bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_constraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="lgraph_api::EdgeOptions::temporal_field__ss"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aed02035800f19fa3eb75108a4ed4489a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="lgraph_api::EdgeOptions::temporal_field_order__lgraph_api::EdgeOptions::TemporalFieldOrder"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a7e866158b92a86c3db1a2db0ad830104"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field_order</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="lgraph_api::EdgeOptions::TemporalFieldOrder::ASC"><span class="n"><span class="pre">ASC</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder">
+<span id="_CPPv3N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="_CPPv2N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="lgraph_api::EdgeOptions::to_string__TemporalFieldOrderCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a02b8f61202a7e3f790caaaece23d1cfc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUidE">
+<span id="_CPPv3N10lgraph_api7EdgeUidE"></span><span id="_CPPv2N10lgraph_api7EdgeUidE"></span><span id="lgraph_api::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUidE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="lgraph_api::EdgeUid::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ac4a49320d7fa2c7fba9bdad45e49e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="lgraph_api::EdgeUid::EdgeUid__int64_t.int64_t.uint16_t.int64_t.int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a3ecba2c59d236b1b4f042d4274f51264"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">l</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">e</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7ReverseEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7ReverseEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7ReverseEv"></span><span id="lgraph_api::EdgeUid::Reverse"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae1b551cc51c9d556342b27b466a7c7cb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reverse</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7ReverseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reverses side of this edge </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::eq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae10ec79b489d4c829b1b28a4c14b7f7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidneERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidneERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidneERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::neq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a6f4701506d51e0489c36edf7251e9acd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidneERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::lt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1afde4cbd02b63c9acd53e61d5e49787e6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::gt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a92818596b49b9fd47fa4b4ce4c203094"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid8ToStringEv">
+<span id="_CPPv3NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="_CPPv2NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="lgraph_api::EdgeUid::ToStringC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of this object </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3srcE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3srcE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3srcE"></span><span id="lgraph_api::EdgeUid::src__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7d1e8afde8407667e51f6de0ba9d6453"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3srcE" title="永久链接至目标"></a><br></dt>
+<dd><p>source vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3dstE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3dstE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3dstE"></span><span id="lgraph_api::EdgeUid::dst__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1adbdebae8daea6c03c200361fa8840a80"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3dstE" title="永久链接至目标"></a><br></dt>
+<dd><p>destination vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3lidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3lidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3lidE"></span><span id="lgraph_api::EdgeUid::lid__uint16_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a16870a9bf8dc2c31ee3c874d7adbd02a"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3lidE" title="永久链接至目标"></a><br></dt>
+<dd><p>label id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3tidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3tidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3tidE"></span><span id="lgraph_api::EdgeUid::tid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a523c7bbc2f001feab204b52b533f7c87"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3tidE" title="永久链接至目标"></a><br></dt>
+<dd><p>timestamp </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3eidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3eidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3eidE"></span><span id="lgraph_api::EdgeUid::eid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ea4961b92589517fd8cfafc0f945033"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3eidE" title="永久链接至目标"></a><br></dt>
+<dd><p>additional edge id to distinguish edges with the same tid </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="lgraph_api::EdgeUid::AnyEdge"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ab5a73d71df790d8768376a4d13608773"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AnyEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of in-coming edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of out-going edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataE">
+<span id="_CPPv3N10lgraph_api9FieldDataE"></span><span id="_CPPv2N10lgraph_api9FieldDataE"></span><span id="lgraph_api::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A class that represents variant type. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEv">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEv"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEv"></span><span id="lgraph_api::FieldData::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a33d34623467e64a3352cd10e53c85ca5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEb">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEb"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEb"></span><span id="lgraph_api::FieldData::FieldData__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a06ad1d80ad369afa643075cbe87f02ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="lgraph_api::FieldData::FieldData__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a265c89b1a86a0bbad89cf42661828f8c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="lgraph_api::FieldData::FieldData__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7e0e988dd1d89abbdacbf4d99fd7b2bf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="lgraph_api::FieldData::FieldData__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1aea814e9fb09dda664977d12f5b350d57"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="lgraph_api::FieldData::FieldData__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a38a8108c47e489a360ebece5e593ca7f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEf">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEf"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEf"></span><span id="lgraph_api::FieldData::FieldData__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab8122e35f0b0a42212299fb31ba8cf8d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEf" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEd">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEd"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEd"></span><span id="lgraph_api::FieldData::FieldData__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad56e5648c7943ef08a593aaf5c231985"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEd" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="lgraph_api::FieldData::FieldData__DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a484a31f1c0cba4531908a803a1782258"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="lgraph_api::FieldData::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="lgraph_api::FieldData::FieldData__DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a870fede3129fb7b07d10096b7adf796f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="lgraph_api::FieldData::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50384efa457e9883b378314910e01ccc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d1752cfc22854c2c44381b0a443fb56"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="lgraph_api::FieldData::FieldData__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a28485df6381f6dc1ba4b30a8087e39fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="lgraph_api::FieldData::FieldData__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a72fde0d7ac627644c3dff536d09a45f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aff76c6792c66514d775ba8be88b789ab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a388fd3199bf652332ce922fe0a25f145"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad19f579289333ecf8515aae8f3bb903a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aafaa13b9ee556736c8992f555e99eda6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a393d9735468c278ddf48b9cf8ef95891"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a59b4b116bc89bf0718ba25b9749c2cce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac81b0f4a81a11954f3afcaa9872b396b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5da2cfc866cfdbe5db69ba9ef1dab2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataD0Ev">
+<span id="_CPPv3N10lgraph_api9FieldDataD0Ev"></span><span id="_CPPv2N10lgraph_api9FieldDataD0Ev"></span><span id="lgraph_api::FieldData::~FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6e58de1884451d88a24994e2875b1d6a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a74cb11c1f4f0a79d6f7a278fc84074ba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5a88873a071ad0c03bcf2c2a498e90bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac721aa38df96b34b841cd4bbc608abdf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b27ecbef11936a80c911800629edd46"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERR9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7integerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7integerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7integerEv"></span><span id="lgraph_api::FieldData::integerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1e5b6bc8e5ac95ae151fdaf8894201e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">integer</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7integerEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as int64. Valid only when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is of INT8, INT16, INT32, or INT64 types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of int types.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>An int64_t. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData4realEv">
+<span id="_CPPv3NK10lgraph_api9FieldData4realEv"></span><span id="_CPPv2NK10lgraph_api9FieldData4realEv"></span><span id="lgraph_api::FieldData::realC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a3f678878dde3a729f94dfefbdc4ef2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">real</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData4realEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as a double. The <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> must be of FLOAT or DOUBLE types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown if the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of FLOAT or DOUBLE types.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A double. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6stringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6stringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6stringEv"></span><span id="lgraph_api::FieldData::stringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7314f49a51859d46439cfeddb9ea06ec"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6stringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as std::string. Valid only for STRING, BLOB and SPATIAL. BLOB data is returned as-is, since std::string can also hold byte array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when a bad cast error condition occurs.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A reference to a const std::string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBoolEv"></span><span id="lgraph_api::FieldData::AsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac488187ef67bf8905cbe686daab95183"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBoolEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="lgraph_api::FieldData::AsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0094a31af359f4684c261a56f780cfb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsInt8Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="lgraph_api::FieldData::AsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aaca113d03918222c50977a094b75c2d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt16Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="lgraph_api::FieldData::AsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0cc24eb0e06a5f5b5476f5739b6ae51e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt32Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="lgraph_api::FieldData::AsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a16e138db4d9a0defc0ab8f03a7864d65"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt64Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsFloatEv"></span><span id="lgraph_api::FieldData::AsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8f86682f960b846e1c3a59eb7fc6ae95"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsFloatEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="lgraph_api::FieldData::AsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2894e904ceb04109370957ba7c48e189"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsDoubleEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1accfbae3969f742ce3621560fee34dbda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Date</span> <span class="pre">AsDate</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1abd4d1fc803c662e145761278c129d3c9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::DateTime</span> <span class="pre">AsDateTime</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsStringEv"></span><span id="lgraph_api::FieldData::AsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5e3562cda960da001597e7dd5679b140"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsStringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBlobEv"></span><span id="lgraph_api::FieldData::AsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9a5a106b2ee0d6fa3c78592852682f0b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBlobEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="lgraph_api::FieldData::AsBase64BlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1afc4b6bc9a7a4d42a981579e04b86b3a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBase64Blob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a8128129ec0fa7689772f0c437fe93a1f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::SRID</span> <span class="pre">GetSRID</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a26726ddebb182026865e77b4e68f8f53"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a31ea41c18cb7507bfefbb18971a3dd0e"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ad5f639edaa8b36e90cff7192554b8723"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1aaef5ea8cbde81ad51459f035a99bdd7f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a7fce7150c8ad873933a8028b16a72a69"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a0015550261b9e976e07e61a3d5790fda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1afb01ecb2663024f0adedfcfe05928d45"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ade0f7fe05edb1eb43c1f4057275967f9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6ToBoltEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6ToBoltEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6ToBoltEv"></span><span id="lgraph_api::FieldData::ToBoltC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3b294f10df124b9d290c7d8fb37e1243"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToBolt</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6ToBoltEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::ToString__ssCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5290ed610cdd3fb38c0d09be107dce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">null_value</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"NUL"</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of this <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="lgraph_api::FieldData::eq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1360e03268a1c10e4a40573e61f2f5ae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataneERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="lgraph_api::FieldData::neq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade1a5ee8968dbf6e7656e5adf96be546"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataneERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="lgraph_api::FieldData::gt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a936f13e9913fde88ff4beb6ba8cabbba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatageERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="lgraph_api::FieldData::gte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9dbdaf01c34ed106fe44fb5f4df2a43b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatageERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataltERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="lgraph_api::FieldData::lt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b808b6437787ab0de4133d7f1cd077"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataltERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataleERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="lgraph_api::FieldData::lte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a34d5df1f1114d3fe8c15bce452736680"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataleERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7GetTypeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7GetTypeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7GetTypeEv"></span><span id="lgraph_api::FieldData::GetTypeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aacf5cac64e0e4e0fba5962f6f1ecf925"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7GetTypeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7is_nullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7is_nullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7is_nullEv"></span><span id="lgraph_api::FieldData::is_nullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a54e61d2bb6c2a58d7b98180555af09e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_null</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7is_nullEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6is_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6is_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6is_bufEv"></span><span id="lgraph_api::FieldData::is_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a49ddf20e31700f6609ffa379f0d25a8f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6is_bufEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="lgraph_api::FieldData::is_empty_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade6523aa6dc019354f36c47aeb4dfd21"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_empty_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsNullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsNullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsNullEv"></span><span id="lgraph_api::FieldData::IsNullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac4d637a0dec45d546495c1660c9f6047"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsNull</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsNullEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is null </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBoolEv"></span><span id="lgraph_api::FieldData::IsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec3bdef27fa2d4de29db82d2334ad2d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBoolEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is bool </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBlobEv"></span><span id="lgraph_api::FieldData::IsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50d95767570c5cc1599c634b7b33e916"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBlobEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is BLOB </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsStringEv"></span><span id="lgraph_api::FieldData::IsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7c412f98489e7d252ef40ed053a3908c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is string </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="lgraph_api::FieldData::IsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a325f297dbf3554c5dbb109b2dada4a43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsInt8Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT8 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="lgraph_api::FieldData::IsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefe2db06fec008bc80e0d15ab52949c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt16Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT16 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="lgraph_api::FieldData::IsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a480ddcb154c9e18b948ff3850a42c22d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt32Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT32 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="lgraph_api::FieldData::IsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b0be739d239c9d646696e1bfe3b2bae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt64Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT64 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsIntegerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="lgraph_api::FieldData::IsIntegerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8543c359835d7977b96446aaef126344"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsIntegerEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Is this a INT8, INT16, INT32 or INT64? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsFloatEv"></span><span id="lgraph_api::FieldData::IsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec0a6f81c7581924db00ea960358d91b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsFloatEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is float </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="lgraph_api::FieldData::IsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a300a2e608e8144e2fbe4588729dd34e3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsDoubleEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is double </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsRealEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsRealEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsRealEv"></span><span id="lgraph_api::FieldData::IsRealC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab6d49b63cf486d609f6286f8b26887f9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsRealEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Is this a FLOAT or DOUBLE? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsDateEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsDateEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsDateEv"></span><span id="lgraph_api::FieldData::IsDateC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8aa76d397e0e2b1d0cb09487316210cc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsDateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is date </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="lgraph_api::FieldData::IsDateTimeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1b1b2b6676359ff4d4ec77eb7e7ee62e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is date time </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsPointEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsPointEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsPointEv"></span><span id="lgraph_api::FieldData::IsPointC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab50e9ff6a50f06668ea577fe1d963a8b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsPointEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is Point</p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12IsLineStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="lgraph_api::FieldData::IsLineStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a795fc6d4d17d385f07d87f82bb247c45"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsLineString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12IsLineStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is LineString</p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsPolygonEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="lgraph_api::FieldData::IsPolygonC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a57c2b6137c6ae390b86d5f341b900992"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPolygon</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsPolygonEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is Polygon</p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsSpatialEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="lgraph_api::FieldData::IsSpatialC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad51d37e3d848990cec85e7de187309fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsSpatial</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsSpatialEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is spatial </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4typeE">
+<span id="_CPPv3N10lgraph_api9FieldData4typeE"></span><span id="_CPPv2N10lgraph_api9FieldData4typeE"></span><span id="lgraph_api::FieldData::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7booleanE">
+<span id="_CPPv3N10lgraph_api9FieldData7booleanE"></span><span id="_CPPv2N10lgraph_api9FieldData7booleanE"></span><span id="lgraph_api::FieldData::boolean__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a857e4e5a2613b7cf584dbf12dae00525"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">boolean</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7booleanE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4int8E">
+<span id="_CPPv3N10lgraph_api9FieldData4int8E"></span><span id="_CPPv2N10lgraph_api9FieldData4int8E"></span><span id="lgraph_api::FieldData::int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae0a430ab8199def132f3f07af5c84066"></span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4int8E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int16E">
+<span id="_CPPv3N10lgraph_api9FieldData5int16E"></span><span id="_CPPv2N10lgraph_api9FieldData5int16E"></span><span id="lgraph_api::FieldData::int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7cd86ccaa2b7be3ef15423f3f58e929e"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int16E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int32E">
+<span id="_CPPv3N10lgraph_api9FieldData5int32E"></span><span id="_CPPv2N10lgraph_api9FieldData5int32E"></span><span id="lgraph_api::FieldData::int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f658422e832e5e2d56e2245cb84be84"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int32E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int64E">
+<span id="_CPPv3N10lgraph_api9FieldData5int64E"></span><span id="_CPPv2N10lgraph_api9FieldData5int64E"></span><span id="lgraph_api::FieldData::int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a45d113f8d303eebb3734306531862812"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int64E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2spE">
+<span id="_CPPv3N10lgraph_api9FieldData2spE"></span><span id="_CPPv2N10lgraph_api9FieldData2spE"></span><span id="lgraph_api::FieldData::sp__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8d3eff5289da252b05248e40c1cd8188"></span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">sp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2spE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2dpE">
+<span id="_CPPv3N10lgraph_api9FieldData2dpE"></span><span id="_CPPv2N10lgraph_api9FieldData2dpE"></span><span id="lgraph_api::FieldData::dp__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae571d69d755e366904e8663a4c643901"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2dpE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData3bufE">
+<span id="_CPPv3N10lgraph_api9FieldData3bufE"></span><span id="_CPPv2N10lgraph_api9FieldData3bufE"></span><span id="lgraph_api::FieldData::buf__ssP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00201fbea83f2e7a263f58098aa98cd7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">buf</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData3bufE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4dataE">
+<span id="_CPPv3N10lgraph_api9FieldData4dataE"></span><span id="_CPPv2N10lgraph_api9FieldData4dataE"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b1a03093018acfa0d961cae96146f6"></span><span class="k"><span class="pre">union</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">[anonymous]</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BoolEb">
+<span id="_CPPv3N10lgraph_api9FieldData4BoolEb"></span><span id="_CPPv2N10lgraph_api9FieldData4BoolEb"></span><span id="lgraph_api::FieldData::Bool__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbaec39a10e97bfc380b60052450b22b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Bool</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BoolEb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4Int8E6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="lgraph_api::FieldData::Int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbc62444e525fdbd056581b349b2a7ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int8</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4Int8E6int8_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int16E7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="lgraph_api::FieldData::Int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f690c1758c4620ba79e4b03bf703531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int16</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int16E7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int32E7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="lgraph_api::FieldData::Int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a99c13db42b1525365635d10480b7d4ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int32</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int32E7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int64E7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="lgraph_api::FieldData::Int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7301552563e8fae5960de9efe235959b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int64</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int64E7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5FloatEf">
+<span id="_CPPv3N10lgraph_api9FieldData5FloatEf"></span><span id="_CPPv2N10lgraph_api9FieldData5FloatEf"></span><span id="lgraph_api::FieldData::Float__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a326651bedfdc7a8f5743e42b7264003b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Float</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5FloatEf" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6DoubleEd">
+<span id="_CPPv3N10lgraph_api9FieldData6DoubleEd"></span><span id="_CPPv2N10lgraph_api9FieldData6DoubleEd"></span><span id="lgraph_api::FieldData::Double__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5304168443248acb485e7e600e150feb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Double</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6DoubleEd" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="lgraph_api::FieldData::Date__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a88a43a9fe1328b1c06a36f469c286b29"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="lgraph_api::FieldData::Date__lgraph_api::DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a217032b1e975d7f3e8c81d0b10ef2eaa"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="lgraph_api::FieldData::DateTime__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a07cfe75d33077c683aa297554049e1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="lgraph_api::FieldData::DateTime__lgraph_api::DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00245f8fabb288c073b2b8b6310c95ae"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a46cdb6bb8f5ed9047595d8a0559960f9"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0abb491f06b5016de61c1a37dc22cca1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc"></span><span id="lgraph_api::FieldData::String__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefd38e03044cc9574ec9f82f8d8646db"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="lgraph_api::FieldData::String__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0500c9ca63c2c826c5f957706676717a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa6b8639fdb113bf8fe4a6556a161386e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1aa9bc69d37ba46872d769a6678058f5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="lgraph_api::FieldData::Point__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aed6deea650cc82d203060e3db07d2d3b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aadeac21d00b14c4fe99ca7356b38c4c5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1134a797ff8e36b78b12ffa26d3fe7ea"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::LineString__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1af7a37b2d5b7065e5f077d5ed9c203c6a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a89db7b33c84d04f622917e6096f32677"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac595c7685df74f6f1e439c1f14b4fb5c"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="lgraph_api::FieldData::Polygon__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac2f0d143ec079d8c6e6d340d383f0ee1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0051c95b3f512cf741e877d7d84e4298"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac60a663a7f4b31bc4a2ff727d6632f00"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="lgraph_api::FieldData::Spatial__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a32852c0236f9dab9f44a4ad88026f3d1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6277538e024b6bce57fed9ff337fd973"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa40480bb254330540b587feb99e8cded"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="lgraph_api::FieldData::Blob__std::vector:uint8_t:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a07c0ced9778df1c5fed3a4663cc45abd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint8_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructs a Blob from vector of uint8_t, treated as byte array. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="lgraph_api::FieldData::BlobFromBase64__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa1ff897ed22d2524b5caaedb4aadb3dd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BlobFromBase64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">base64_encoded</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructs a BLOB from Base64 encoded string. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="lgraph_api::FieldData::IsBufType__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1abbb98d7d3792559fa61cca3554aeaba7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBufType</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if ‘t’ is BLOB or STRING </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="lgraph_api::FieldData::IsInteger__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae00a13411b0557d842ffb8ea5f89e413"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if ‘t’ is INT8, 16, 32, or 64 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="lgraph_api::FieldData::IsReal__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a884ee60f7e50a01ab3a12179298fb9cb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if ‘t’ is FLLOAT or DOUBLE </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpecE">
+<span id="_CPPv3N10lgraph_api9FieldSpecE"></span><span id="_CPPv2N10lgraph_api9FieldSpecE"></span><span id="lgraph_api::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Specification for a field. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="lgraph_api::FieldSpec::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1abfe187a3e79a4445a5270bba3bfaf72c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssCR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a8428f3af5f513d918d94feb5c78fa7e0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>n</strong> – Field name </p></li>
+<li><p><strong>t</strong> – Field type </p></li>
+<li><p><strong>nu</strong> – True if field is optional </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssRR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ada0df81c60e30bca34ba912a11fcdd9f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec">
+<span id="_CPPv3NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="_CPPv2NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="lgraph_api::FieldSpec::eq-operator__FieldSpecCRC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ac1104e4f8ee3666f766a09745b03836d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpec8ToStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="lgraph_api::FieldSpec::ToStringC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpec8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the string representation of the <a class="reference internal" href="#structlgraph__api_1_1FieldSpec"><span class="std std-ref">FieldSpec</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4nameE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4nameE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4nameE"></span><span id="lgraph_api::FieldSpec::name__ss"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4nameE" title="永久链接至目标"></a><br></dt>
+<dd><p>name of the field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4typeE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4typeE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4typeE"></span><span id="lgraph_api::FieldSpec::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4typeE" title="永久链接至目标"></a><br></dt>
+<dd><p>type of that field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec8optionalE">
+<span id="_CPPv3N10lgraph_api9FieldSpec8optionalE"></span><span id="_CPPv2N10lgraph_api9FieldSpec8optionalE"></span><span id="lgraph_api::FieldSpec::optional__b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a1b3b38329495fc55fd443dfa2246337b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">optional</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec8optionalE" title="永久链接至目标"></a><br></dt>
+<dd><p>is this field optional? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpecE">
+<span id="_CPPv3N10lgraph_api9IndexSpecE"></span><span id="_CPPv2N10lgraph_api9IndexSpecE"></span><span id="lgraph_api::IndexSpec"></span><span class="target" id="structlgraph__api_1_1IndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>An index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5labelE"></span><span id="lgraph_api::IndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5labelE" title="永久链接至目标"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5fieldE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5fieldE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5fieldE"></span><span id="lgraph_api::IndexSpec::field__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a97bab0e4c0ea8b12272a606c825360e7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5fieldE" title="永久链接至目标"></a><br></dt>
+<dd><p>field name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api9IndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api9IndexSpec4typeE"></span><span id="lgraph_api::IndexSpec::type__IndexType"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1ac8263343d7a58ec888a110427f522b64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec4typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsE">
+<span id="_CPPv3N10lgraph_api12LabelOptionsE"></span><span id="_CPPv2N10lgraph_api12LabelOptionsE"></span><span id="lgraph_api::LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelOptions</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Label options, base class, define some common fields and methods </p>
+<p>Subclassed by <a class="reference internal" href="#structlgraph__api_1_1EdgeOptions"><span class="std std-ref">EdgeOptions</span></a>, <a class="reference internal" href="#structlgraph__api_1_1VertexOptions"><span class="std std-ref">VertexOptions</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api12LabelOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="lgraph_api::LabelOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a630c29d66f94446c4292172285d61492"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api12LabelOptions9to_stringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions5clearEv">
+<span id="_CPPv3N10lgraph_api12LabelOptions5clearEv"></span><span id="_CPPv2N10lgraph_api12LabelOptions5clearEv"></span><span id="lgraph_api::LabelOptions::clear"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a5eeb94d22b8366d1b68d0614384802fe"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions5clearEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsD0Ev">
+<span id="_CPPv3N10lgraph_api12LabelOptionsD0Ev"></span><span id="_CPPv2N10lgraph_api12LabelOptionsD0Ev"></span><span id="lgraph_api::LabelOptions::~LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a0c56bbf380b6ce74a532637b65f7e7a4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~LabelOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions15detach_propertyE">
+<span id="_CPPv3N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="_CPPv2N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="lgraph_api::LabelOptions::detach_property__b"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a6057cc32d98316ec805c453db60c48ef"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">detach_property</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions15detach_propertyE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ParameterE">
+<span id="_CPPv3N10lgraph_api9ParameterE"></span><span id="_CPPv2N10lgraph_api9ParameterE"></span><span id="lgraph_api::Parameter"></span><span class="target" id="structlgraph__api_1_1Parameter"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parameter</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ParameterE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>The parameter of procedure/plugin </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4nameE">
+<span id="_CPPv3N10lgraph_api9Parameter4nameE"></span><span id="_CPPv2N10lgraph_api9Parameter4nameE"></span><span id="lgraph_api::Parameter::name__ss"></span><span class="target" id="structlgraph__api_1_1Parameter_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4nameE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter5indexE">
+<span id="_CPPv3N10lgraph_api9Parameter5indexE"></span><span id="_CPPv2N10lgraph_api9Parameter5indexE"></span><span id="lgraph_api::Parameter::index__i"></span><span class="target" id="structlgraph__api_1_1Parameter_1a750b5d744c39a06bfb13e6eb010e35d0"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">index</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter5indexE" title="永久链接至目标"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>name of the parameter </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4typeE">
+<span id="_CPPv3N10lgraph_api9Parameter4typeE"></span><span id="_CPPv2N10lgraph_api9Parameter4typeE"></span><span id="lgraph_api::Parameter::type__LGraphType"></span><span class="target" id="structlgraph__api_1_1Parameter_1ac8ec89e84ffc9d1ffe1b030f61a76e44"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4typeE" title="永久链接至目标"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>index of the parameter list in which the parameter stay </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfoE">
+<span id="_CPPv3N10lgraph_api8RoleInfoE"></span><span id="_CPPv2N10lgraph_api8RoleInfoE"></span><span id="lgraph_api::RoleInfo"></span><span class="target" id="structlgraph__api_1_1RoleInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RoleInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfoE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the role. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo4descE">
+<span id="_CPPv3N10lgraph_api8RoleInfo4descE"></span><span id="_CPPv2N10lgraph_api8RoleInfo4descE"></span><span id="lgraph_api::RoleInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo4descE" title="永久链接至目标"></a><br></dt>
+<dd><p>description </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo12graph_accessE">
+<span id="_CPPv3N10lgraph_api8RoleInfo12graph_accessE"></span><span id="_CPPv2N10lgraph_api8RoleInfo12graph_accessE"></span><span id="lgraph_api::RoleInfo::graph_access__std::map:ss.AccessLevel:"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1ac689f8bad73d3d9b3c2a1c11f1296905"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph_access</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo12graph_accessE" title="永久链接至目标"></a><br></dt>
+<dd><p>access levels on different graphs </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8RoleInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8RoleInfo8disabledE"></span><span id="lgraph_api::RoleInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo8disabledE" title="永久链接至目标"></a><br></dt>
+<dd><p>is this role disabled? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpecE">
+<span id="_CPPv3N10lgraph_api7SigSpecE"></span><span id="_CPPv2N10lgraph_api7SigSpecE"></span><span id="lgraph_api::SigSpec"></span><span class="target" id="structlgraph__api_1_1SigSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SigSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec10input_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec10input_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec10input_listE"></span><span id="lgraph_api::SigSpec::input_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a4f4b1c5201f32fae15b91c8a51021f63"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">input_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec10input_listE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec11result_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec11result_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec11result_listE"></span><span id="lgraph_api::SigSpec::result_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a23e292d0e3f983f3ceba15f9f6249209"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec11result_listE" title="永久链接至目标"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>input parameter list </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfoE">
+<span id="_CPPv3N10lgraph_api8UserInfoE"></span><span id="_CPPv2N10lgraph_api8UserInfoE"></span><span id="lgraph_api::UserInfo"></span><span class="target" id="structlgraph__api_1_1UserInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UserInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfoE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the user. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo4descE">
+<span id="_CPPv3N10lgraph_api8UserInfo4descE"></span><span id="_CPPv2N10lgraph_api8UserInfo4descE"></span><span id="lgraph_api::UserInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo4descE" title="永久链接至目标"></a><br></dt>
+<dd><p>description of the user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo5rolesE">
+<span id="_CPPv3N10lgraph_api8UserInfo5rolesE"></span><span id="_CPPv2N10lgraph_api8UserInfo5rolesE"></span><span id="lgraph_api::UserInfo::roles__std::set:ss:"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1f4c5a9d9b2a7c1022128d3201f03648"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">roles</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo5rolesE" title="永久链接至目标"></a><br></dt>
+<dd><p>roles of this user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8UserInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8UserInfo8disabledE"></span><span id="lgraph_api::UserInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo8disabledE" title="永久链接至目标"></a><br></dt>
+<dd><p>is this user disabled? </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo12memory_limitE">
+<span id="_CPPv3N10lgraph_api8UserInfo12memory_limitE"></span><span id="_CPPv2N10lgraph_api8UserInfo12memory_limitE"></span><span id="lgraph_api::UserInfo::memory_limit__s"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1943ac86ca89eaf251c01c16772dfc00"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">memory_limit</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo12memory_limitE" title="永久链接至目标"></a><br></dt>
+<dd><p>memory limit for this user </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptionsE">
+<span id="_CPPv3N10lgraph_api13VertexOptionsE"></span><span id="_CPPv2N10lgraph_api13VertexOptionsE"></span><span id="lgraph_api::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Vertex label options, contain fields only vertex have </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="lgraph_api::VertexOptions::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1afd0ea869dba2b64723f3643ef5f6d2df"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="lgraph_api::VertexOptions::VertexOptions__ssCR"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac769e8bf000b16416a763894714829c7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">primary_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api13VertexOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="lgraph_api::VertexOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api13VertexOptions9to_stringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions5clearEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions5clearEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions5clearEv"></span><span id="lgraph_api::VertexOptions::clear"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions5clearEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13primary_fieldE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="lgraph_api::VertexOptions::primary_field__ss"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1a72852ec13f99950d76332fad99c71dd0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">primary_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13primary_fieldE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-utils">
+<h2>lgraph_utils<a class="headerlink" href="#lgraph-utils" title="永久链接至标题"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv44json">
+<span id="_CPPv34json"></span><span id="_CPPv24json"></span><span class="target" id="lgraph__utils_8h_1ab701e3ac61a85b337ec5c1abaad6742d"></span><span class="k"><span class="pre">using</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">json</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><a class="headerlink" href="#_CPPv44json" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8get_timeEv">
+<span id="_CPPv3N10lgraph_api8get_timeEv"></span><span id="_CPPv2N10lgraph_api8get_timeEv"></span><span id="lgraph_api::get_time"></span><span class="target" id="namespacelgraph__api_1ab3691fc022301a72d8cb766dc0c17fdf"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">get_time</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8get_timeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Digit value of current time. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE">
+<span id="_CPPv3N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="_CPPv2N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="lgraph_api::split_string__ss.std::vector:ss:R.ss"></span><span class="target" id="namespacelgraph__api_1ae25400b1a7ff2282865cd3cc2353a536"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">split_string</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">origin_string</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sub_strings</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">string_delimiter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Split the original string by format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>origin_string</strong> – original string to be split. </p></li>
+<li><p><strong>sub_strings</strong> – split substring. </p></li>
+<li><p><strong>string_delimiter</strong> – Split format. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE">
+<span id="_CPPv3N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="_CPPv2N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="lgraph_api::rc4__ssR.ss.ss"></span><span class="target" id="namespacelgraph__api_1a985e409c942e1068d32b795a27024122"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">rc4</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">key</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mode</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Encrypt the input string in ac4 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>input</strong> – input string. </p></li>
+<li><p><strong>key</strong> – encryption key. </p></li>
+<li><p><strong>mode</strong> – encryption mode </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13encode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="lgraph_api::encode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a2e5f53c59cee61047cb4e283fb6c1950"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">encode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13encode_base64EKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Encode the input string in encode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13decode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="lgraph_api::decode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a047800adaceb796bbb0eb71c016e4fa3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">decode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13decode_base64EKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Decode the input string in decode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Decrypted string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12alloc_bufferE6size_t">
+<span id="_CPPv3N10lgraph_api12alloc_bufferE6size_t"></span><span id="_CPPv2N10lgraph_api12alloc_bufferE6size_t"></span><span id="lgraph_api::alloc_buffer__s"></span><span class="target" id="namespacelgraph__api_1a3274ccf2c4d0f0990a6edbdee20109c4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">alloc_buffer</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12alloc_bufferE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Allocate memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>bytes</strong> – Size in byte of request memory. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Pointer of allocated memory. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t">
+<span id="_CPPv3N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="_CPPv2N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="lgraph_api::dealloc_buffer__voidP.s"></span><span class="target" id="namespacelgraph__api_1ad6721e43c2327ad8e4c6e19c0996a770"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dealloc_buffer</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buffer</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Free memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>buffer</strong> – Size in bytes of request memory </p></li>
+<li><p><strong>bytes</strong> – Pointer of memory to free. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ae22fdc516fa3fd1ee7f8ad22d877bc64"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a54668379bc6d79cb28f24c532d6ceb28"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse vector parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="lgraph_api::GetVidFromNodeString__ssCR"></span><span class="target" id="namespacelgraph__api_1aa24b1e990b795a8d59c369760c930c7f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVidFromNodeString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">node_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse vid from the node passed in by cypher. For V2 procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>node_string</strong> – <strong>[in]</strong> node </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>vid </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-index-iterator">
+<h2>lgraph_vertex_index_iterator<a class="headerlink" href="#lgraph-vertex-index-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorE"></span><span id="lgraph_api::VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> can be used to access a set of vertices that has the same indexed value. If the index is unique (that is, each vertex has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> will only have one VertexId, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> is valid iff it points to a valid (index_value, vid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a73eb49fc5a21c2eab2d862fb07231061"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1adf8da63a296279030584c1d539dfc7e0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="lgraph_api::VertexIndexIterator::~VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a4a5611b7ffb02851074518d929862608"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="lgraph_api::VertexIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="lgraph_api::VertexIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="lgraph_api::VertexIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next vertex id in the list, which consists of all the valid vertex ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::VertexIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the current index value. The vids are sorted in (IndexValue, Vid) order. When <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one vid to next, possibly moving from one IndexValue to another. This function tells the IndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="lgraph_api::VertexIndexIterator::GetVidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a89f7ed3f184862498c0df7d87b97a1b4"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the current vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The current vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__lgraph::VertexIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a8adfcdcf8d9abeee72c3da1b9f21edaa"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae8421018f7913edfc4d82d2c0f209085"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1abe6ca171051639d874dbfb573a9d4cb3"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator3it_E"></span><span id="lgraph_api::VertexIndexIterator::it___std::unique_ptr:lgraph::VertexIndexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae02cf2beed475be9b6af2ddacf99f077"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="lgraph_api::VertexIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-iterator">
+<h2>lgraph_vertex_iterator<a class="headerlink" href="#lgraph-vertex-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> can be used to iterate through vertices in the DB. Vertices are sorted according to vertex id in the DB. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> is valid iff it points to a valid vertex. Calling method functions on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> for non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> with the id of a non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"><span class="std std-ref">Delete()</span></a> on the last vertex. </p></li>
+</ol>
+<p></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7888300a9ddafc0d6814c54b7d2f1f11"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac4f5daf4ebb180eb1a0c9d1ba024bf38"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14VertexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14VertexIteratorD0Ev"></span><span id="lgraph_api::VertexIterator::~VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ab031829b35061e00c09bf2f5c951063f"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator5CloseEv"></span><span id="lgraph_api::VertexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator4NextEv"></span><span id="lgraph_api::VertexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, otherwise return false (no more vertex) and invalidate the iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb">
+<span id="_CPPv3N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="_CPPv2N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="lgraph_api::VertexIterator::Goto__int64_t.b"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Goto the vertex with id src. If there is no vertex with exactly the same vid, and nearest==true, go to the next vertex with id&gt;=vid, otherwise return false and invalidate the iterator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vid</strong> – Vertex id of the vertex to go. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to go to the closest vertex with id&gt;=vid.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false (no such vertex). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator5GetIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="lgraph_api::VertexIterator::GetIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a9fedaf26513596c151c16f829b47038e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator5GetIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a594a8927f27893b46f4f8ce547b5e558"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the first out-going edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1abb6aadfa764244d29f6458a40f5c4f17"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge, and nearest==false an invalid iterator is returned. If the specified out-edge does not exist, and nearest==true, get the first out-edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetInEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the first in-coming edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetInEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a1013d34130e78bd8715e7b7a0759b578"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge and nearest==false, an invalid iterator is returned. If the specified edge does not exist and nearest==true, </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="lgraph_api::VertexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="lgraph_api::VertexIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the label of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="lgraph_api::VertexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="lgraph_api::VertexIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field_name </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="lgraph_api::VertexIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="lgraph_api::VertexIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>all fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListSrcVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a910d02e24a65995a2784e2028d6244ac"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListSrcVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>List source vids. Each source vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>List of source vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListDstVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1add92b73ced9e72b3b87fa80f486c27a9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListDstVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>List destination vids. Each vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit of number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>List of desitnation vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumInEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1acba67b0fdb21bf78555353cf53fb4f6f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of incoming edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of in-coming edges to count. When the limit is reached, n_limit is returned. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of incoming edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumOutEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a273dc0f4b8ddf828a89ae68748ed0c74"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of out-going edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of out-going edges to count. When the limit is reached, n_limit is returned and limit_exceeded is set to true. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of out-going edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t">
+<span id="_CPPv3N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="_CPPv2N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="lgraph_api::VertexIterator::Delete__sP.sP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_in_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_out_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes this vertex, also deletes all incoming and outgoing edges of this vertex. The iterator will point to the next vertex by vid if there is any. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_in_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of in edges the vertex had. </p></li>
+<li><p><strong>n_out_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of out edges the vertex had. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="lgraph_api::VertexIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the string representation of this vertex. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIterator::VertexIterator__lgraph::graph::VertexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a77858ba7e00cd9e8676e4b168d95f931"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a4b166320bbbeadd713f612c540094bf9"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a25e24a42419e107fee77196a8a9fc488"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator3it_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator3it_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator3it_E"></span><span id="lgraph_api::VertexIterator::it___std::unique_ptr:lgraph::graph::VertexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a26ee2d6416d9ad738ce344fb2b1a2972"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator4txn_E"></span><span id="lgraph_api::VertexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-base">
+<h2>olap_base<a class="headerlink" href="#olap-base" title="永久链接至标题"></a></h2>
+<p>This is an implementation of the TuGraph graph analytics engine. The graph analytics engine is a general-purpose processing engine useful for implementing various graph analytics algorithms such as PageRank, ShortestPath, etc.. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_WORKING">
+<span class="target" id="olap__base_8h_1af8106a969b5fe14011400dcc5de93889"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_WORKING</span></span></span><a class="headerlink" href="#c.THREAD_WORKING" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_STEALING">
+<span class="target" id="olap__base_8h_1a3537fbf36165f2b4f963e4dd7462ec22"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_STEALING</span></span></span><a class="headerlink" href="#c.THREAD_STEALING" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.VERTEX_BATCH_SIZE">
+<span class="target" id="olap__base_8h_1a7655fa441302a14fb0f2f7f74ebe9e64"></span><span class="sig-name descname"><span class="n"><span class="pre">VERTEX_BATCH_SIZE</span></span></span><a class="headerlink" href="#c.VERTEX_BATCH_SIZE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.WORD_OFFSET">
+<span class="target" id="olap__base_8h_1aaa604dee271e714e574fa9a36fd57682"></span><span class="sig-name descname"><span class="n"><span class="pre">WORD_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.WORD_OFFSET" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.BIT_OFFSET">
+<span class="target" id="olap__base_8h_1a5a49e33dd4567ba395e94a35716669b6"></span><span class="sig-name descname"><span class="n"><span class="pre">BIT_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.BIT_OFFSET" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="olap__base_8h_1a539fe76ede7635af5ee150bd33d03317"></span><span class="sig-name descname"><span class="pre">union</span> <span class="pre">@5</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49neighbour">
+<span id="_CPPv39neighbour"></span><span id="_CPPv29neighbour"></span><span id="neighbour__s"></span><span class="target" id="olap__base_8h_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv49neighbour" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49edge_data">
+<span id="_CPPv39edge_data"></span><span id="_CPPv29edge_data"></span><span id="edge_data__EdgeData"></span><span class="target" id="olap__base_8h_1a24f41c52f29d0ba9636668d50ed99a63"></span><span class="n"><span class="pre">EdgeData</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv49edge_data" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43src">
+<span id="_CPPv33src"></span><span id="_CPPv23src"></span><span id="src__s"></span><span class="target" id="olap__base_8h_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv43src" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43dst">
+<span id="_CPPv33dst"></span><span id="_CPPv23dst"></span><span id="dst__s"></span><span class="target" id="olap__base_8h_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv43dst" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olapE">
+<span id="_CPPv3N10lgraph_api4olapE"></span><span id="_CPPv2N10lgraph_api4olapE"></span><span id="lgraph_api::olap"></span><span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olapE" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aae"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="永久链接至目标"></a><br></dt>
+<dd><p>Define the edge direction policy of graph The policy determines the graph symmetric and undirected feature. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaea17946ea357e5e0a46f7354049d684ba1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DUAL_DIRECTION</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE" title="永久链接至目标"></a><br></dt>
+<dd><p>The graph is asymmetric. The edges from input files are outgoing edges. The reversed edges form incoming edges. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeafdc4fc0261af8c2b6f66ab00eed5fe55"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAKE_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE" title="永久链接至目标"></a><br></dt>
+<dd><p>The graph is symmetric but the input files are asymmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeaa1b7f74c74bb030bf8360c598fdfc08f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INPUT_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE" title="永久链接至目标"></a><br></dt>
+<dd><p>Both the graph and the input files are symmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a944bcbf0349029631b4fbda1660df186"></span><span class="sig-name descname"><span class="pre">template&lt;typename</span> <span class="pre">EdgeData&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a6eded0577caa238e1cf59a742cbc7eeb"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum">
+<span id="_CPPv3I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span id="_CPPv2I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aaa30a5461bdf30947283236f847714e7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reduce_plus</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="永久链接至目标"></a><br></dt>
+<dd><p>The default reduce function which uses the plus operator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a5bcc917c95bec960faafcf5506201325"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1ac8203a028b53e5841a52737f4a4f3bcd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1abf9e945446fe724862c9960198e7174f"></span><span class="sig-name descname"><span class="pre">struct</span> <span class="pre">lgraph_api::olap::EdgeStringUnit</span> <span class="pre">__attribute__</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="lgraph_api::olap::MAX_NUM_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a8b2861b30aec5ae10d4519bf3a8ce0f2"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_NUM_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE" title="永久链接至目标"></a><br></dt>
+<dd><p>The maximum number of edges. Change this value if needed. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjListE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjListE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjListE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1AdjList"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="lgraph_api::olap::AdjList::AdjList"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a8b7b96acd6306a4b7c5b74df226e6f7e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList5beginEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList5beginEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList5beginEv"></span><span id="lgraph_api::olap::AdjList::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a1b44a588619cf9b27a4cf547d290bcf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList5beginEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList3endEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList3endEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList3endEv"></span><span id="lgraph_api::olap::AdjList::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1af77a3b6fb415f06e5b56bfc9be448a70"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList3endEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjListixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap7AdjListixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap7AdjListixE6size_t"></span><span id="lgraph_api::olap::AdjList::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a62df7b80147908931b2be1c979639f43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjListixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="lgraph_api::olap::AdjList::AdjList__AdjUnit:EdgeData:P.AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a50f0d642dca2d5631b139d235bd790f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">begin</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList6begin_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList6begin_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList6begin_E"></span><span id="lgraph_api::olap::AdjList::begin___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1aaf99bb4a670e8aa9cae1d700f1e57c5c"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList6begin_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList4end_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList4end_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList4end_E"></span><span id="lgraph_api::olap::AdjList::end___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a90c044b28a9a95203b0a0c289772e178"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList4end_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">OlapBase&lt;</span> <span class="pre">EdgeData</span> <span class="pre">&gt;</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjUnit&lt;EdgeData&gt; represents an adjacent edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="lgraph_api::olap::AdjUnit::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1aacfa29d2dd368a125e50f21c115ec46f"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@4</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeStringUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeStringUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type, The vertex is of string type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="lgraph_api::olap::EdgeStringUnit::src__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1aac2e7b82f607b746d5b33c401a555ad4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="lgraph_api::olap::EdgeStringUnit::dst__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1a030e02dd512080f9859d50b7c2f10db0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeStringUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="lgraph_api::olap::EdgeStringUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8EdgeUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap8EdgeUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap8EdgeUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="lgraph_api::olap::EdgeUnit::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3srcE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="lgraph_api::olap::EdgeUnit::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3dstE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a4a58050a4c0f1da86ec007813a4ec308"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::EdgeUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@6</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap5EmptyE">
+<span id="_CPPv3N10lgraph_api4olap5EmptyE"></span><span id="_CPPv2N10lgraph_api4olap5EmptyE"></span><span id="lgraph_api::olap::Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1Empty"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Empty</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> is used for representing unweighted graphs. </p>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBaseE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBaseE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBaseE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjList&lt;EdgeData&gt; allows range-based for-loop over AdjUnit&lt;EdgeData&gt;. </p>
+<p>Graph</p>
+<p>
+EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>EdgeData</strong> – Type of the edge data.</p></li>
+<li><p><strong>EdgeData</strong> – Graph instances represent static (sub)graphs loaded from txt file. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses.</p></li>
+<li><p><strong>EdgeData</strong> – Type of the edge data. </p></li>
+</ul>
+</dd>
+</dl>
+<p>Subclassed by <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB&lt; EdgeData &gt;</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="lgraph_api::olap::OlapBase::OlapBase"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8b1cb218d9ddbe502eda5a2f0d674d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor of Graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapBase::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af1aedb46d1972859e79efafbe6c33ec2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a6c48401f52e77a7286b04c528b98dc5e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the out-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The out-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::InDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aaa9b9b0056536f6d533c1dfed9fc0ef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the in-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The in-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ada8118bd934579318a4ed38d0233b70d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the outgoing edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The outgoing edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::InEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a19e62567748b5c1a224457b9756d4002"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the incoming edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The incoming edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="lgraph_api::olap::OlapBase::Transpose"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a109318636af36bc89e9853f19e4369e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transpose</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Transpose the graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="lgraph_api::olap::OlapBase::NumVertices"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a07d9840894a10d114719bcf339a5a20d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get number of vertices of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of vertices of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="lgraph_api::olap::OlapBase::NumEdges"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af16ce4014b334a365ccac510c4e4045d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumEdges</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get number of edges of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of edges of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a010ffba60888eacee4ed8153d69e22d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="lgraph_api::olap::OlapBase::AllocVertexArray::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexArray</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Allocate a vertex array with type VertexData. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>VertexData</strong> – Type of the vertex data.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> with type VertexData. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="lgraph_api::olap::OlapBase::AllocVertexSubset"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a950a6ba41cf3e3885d043c15616f583d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexSubset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Allocate a vertex subset represented with <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> sized |V| of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::AcquireVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac15d778dde37cd4ec7f0471d170fe35a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AcquireVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Lock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::ReleaseVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a3d005cde32497e212181e88217938f25"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReleaseVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Unlock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::GuardVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea1c361387ef31606753020550642cf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="lgraph_api::olap::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GuardVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock/unlock.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> corresponding to the specified vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="lgraph_api::olap::OlapBase::IfSparse__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8096171f84ad9c7c78c9ea965c475a8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IfSparse</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd><p>Judging whether it is sparse mode or dense mode according to the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>active_vertices</strong> – The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> of active_vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="lgraph_api::olap::OlapBase::set_num_vertices__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab0c9ca5cca45f72dcbb4ebe427e64b4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">set_num_vertices</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Assign vertices to the first loaded graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vertices</strong> – The vertex id (in the Graph) to lock/unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="lgraph_api::olap::OlapBase::LoadFromArray__cP.s.s.EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a16c3082aa7057bdc8e80f6491e6d8e88"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadFromArray</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">edge_array</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_vertices</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_edges</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">edge_direction_policy</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy" title="永久链接至目标"></a><br></dt>
+<dd><p>Load graph data from edge_array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>edge_array</strong> – <strong>[in]</strong> The data in this array is read into the graph. </p></li>
+<li><p><strong>input_vertices</strong> – The number of vertices in the input graph data. </p></li>
+<li><p><strong>input_edges</strong> – The number of edges in the input graph data. </p></li>
+<li><p><strong>edge_direction_policy</strong> – Graph data loading method. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a23cdd3850d0641f99a761cd30318ddae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a parallel-for loop in the range [lower, upper). </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">模板参数</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing the work. </p></li>
+<li><p><strong>lower</strong> – The lower bound of the range (inclusive). </p></li>
+<li><p><strong>upper</strong> – The upper bound of the range (exclusive). </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adbf76a87d17dfdeb4554fc058772f351"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a2115dc228e9cde0ea88fad83d9527ebe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Process a set of active vertices in parallel. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">模板参数</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing each vertex’s work. </p></li>
+<li><p><strong>active_vertices</strong> – <strong>[inout]</strong> The active vertex set. </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac8cdec9111784ddeb528c899d99ea5bd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-functions">Protected Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="lgraph_api::olap::OlapBase::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ad0df12e23dc13705b7160effdecdca73"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-attributes">Protected Attributes</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="lgraph_api::olap::OlapBase::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="lgraph_api::olap::OlapBase::num_edges___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac4dfd32613a83596fa43818fd979a6e2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_data_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a703092681fc7abbc984632b1644216cd"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::adj_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aec12c1eea29776d600cedb7c8de70b71"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">adj_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea4bca314eba173531bc9f04e35888e7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="lgraph_api::olap::OlapBase::edge_direction_policy___EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a59e5aefcf4de1752fda0c644c4bf920a"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_direction_policy_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="lgraph_api::olap::OlapBase::edge_list___EdgeUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aa463cdb96cdb7fa5bc259c8facc9aed9"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit"><span class="n"><span class="pre">EdgeUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">edge_list_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="lgraph_api::olap::OlapBase::out_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adb8e1bf54dfd199e838ec45066f8f758"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="lgraph_api::olap::OlapBase::in_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a55bb224127fd22ab38d9ea251d83895a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="lgraph_api::olap::OlapBase::out_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af6c2b6632374310efa986cf7aa54fd55"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_index_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="lgraph_api::olap::OlapBase::in_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a8f5032936723f9e23aec62f377b2a3ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_index_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="lgraph_api::olap::OlapBase::out_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a890254f0669f50d5d51c0b7f3c6b94ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="lgraph_api::olap::OlapBase::in_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a35d8cc39082a3468d82e0bf4412aee62"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="lgraph_api::olap::OlapBase::lock_array___ParallelVector:b:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aee90f899c9abd99447bfa22781c5634d"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lock_array_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetE"></span><span id="lgraph_api::olap::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> implements the concurrent bitset data structure, which is usually used to represent active vertex sets. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af71b86fef4aceb1ea4e0c39a4ee73369"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>size</strong> – The size of the bitset (i.e. the number of bits). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7242b92edfd78d370c06883f93674ebe"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::assign-operator__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ab16e3e695d258f2ce3d1ad5eef412a12"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ae83afc3b8694c5e279c03836a293ca1c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a1f67570cf9608fb5b62de10c44519e6e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="lgraph_api::olap::ParallelBitset::~ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7779a66d09a414c3ef215609e2dc9da8"></span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="lgraph_api::olap::ParallelBitset::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Clear the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="lgraph_api::olap::ParallelBitset::Fill"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af5105c0eef86140ad8203af2bf159d57"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Fill the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Has__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ade408d5cd908ff319ee49500dbb898da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Has</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Test a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to test.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Whether the bit is set or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Add__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a9d6d2b50895f5add363b7a1a30b0b804"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Set a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to set.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Whether the operation is a true addition or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::Swap__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad079bdc6ea46251fa256de71ac77c8db"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd><p>Swap the current bitset with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other bitset to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="lgraph_api::olap::ParallelBitset::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5503ab878f0444a70c87fcce727a4b3c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="lgraph_api::olap::ParallelBitset::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="lgraph_api::olap::ParallelBitset::data___uint64_tP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad26e57b8e7bb88f06c363fab8e7009a2"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5data_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="lgraph_api::olap::ParallelBitset::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14ParallelVectorE">
+<span id="_CPPv3I0EN10lgraph_api4olap14ParallelVectorE"></span><span id="_CPPv2I0EN10lgraph_api4olap14ParallelVectorE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>ParallelVector&lt;T&gt; aims to mimic std::vector&lt;T&gt;. Note that the deletions other than clearing are not supported. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aef646925bb31e3dcc02a67e584e6d2d4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>capacity</strong> – The capacity of the vector. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab1334ee433460a07146e277f7e4c30d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>capacity</strong> – The capacity of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__TP.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a140f4d7cdcdfec667cf096f6d855b155"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt; </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>data</strong> – The initial data of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. And the initial capacity equals initial size. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a3aae6881aa98ab806d5eabd668491187"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1af4d6dc6eecb55e2ddf126fef29b17c79"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::assign-operator__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a70489ba54b4027e4e589c93a6a474666"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ae3fed3af74f330a9856fe2cd42482f44"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Default constructor of ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="lgraph_api::olap::ParallelVector::Destroy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ac919a991060ede6983343719401686de"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Destroy ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="lgraph_api::olap::ParallelVector::~ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2a254fcaade5cc8050f3c5eca1893619"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="lgraph_api::olap::ParallelVector::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5d56cb4cffc7089978d354304eb5a7a6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5beginEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="lgraph_api::olap::ParallelVector::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a23e2fdb99370f37cb764cac10378c721"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5beginEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector3endEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector3endEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector3endEv"></span><span id="lgraph_api::olap::ParallelVector::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5994ad65dce0457b21adb6a10c8642dc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector3endEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4BackEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="lgraph_api::olap::ParallelVector::Back"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9fadc3b5d96a350533f1221345259aab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Back</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4BackEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="lgraph_api::olap::ParallelVector::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab2c9a1b384ad445ddc5da54c669e3136"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4DataEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="lgraph_api::olap::ParallelVector::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="lgraph_api::olap::ParallelVector::Capacity"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2ee0a564b6468179fd94541c4bbf85d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Capacity</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="lgraph_api::olap::ParallelVector::Destroyed"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a907f5acbcd44ca4faa2f02fde7bd2df1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroyed</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="lgraph_api::olap::ParallelVector::Resize__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ad9cf0e91780366986c2f047bd796cdd5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>size</strong> – Value of new size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="lgraph_api::olap::ParallelVector::Resize__s.TCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a4a62b4cde89680b486c2560241cd594a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T" title="永久链接至目标"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size and initialize the new element with elem. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>size</strong> – Value of new size. </p></li>
+<li><p><strong>elem</strong> – Initial value of new-added element. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="lgraph_api::olap::ParallelVector::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Clear all data and change size to 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ReAlloc__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a1a61eab0948012f137795032a19d4664"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReAlloc</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Destroy elder data and allocate with new capacity. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>capacity</strong> – New capacity value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="lgraph_api::olap::ParallelVector::Fill__T"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a016e89b3314c7d5d0b82b762bad05a28"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T" title="永久链接至目标"></a><br></dt>
+<dd><p>Assign the vector’s elements with a common value. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>elem</strong> – The common value. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>     <span class="n">This</span> <span class="n">action</span> <span class="ow">is</span> <span class="n">performed</span> <span class="ow">in</span> <span class="n">parallel</span><span class="p">,</span> <span class="n">so</span> <span class="n">you</span> <span class="n">should</span> <span class="ow">not</span> <span class="n">call</span>
+     <span class="n">it</span> <span class="n">inside</span> <span class="n">another</span> <span class="n">parallel</span> <span class="n">region</span> <span class="p">(</span><span class="n">via</span> <span class="n">Worker</span><span class="p">::</span><span class="n">Delegate</span><span class="p">)</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TCR.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a43b8a4f1da7a245932babf7b42aa69db"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Append an element to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>elem</strong> – The element. </p></li>
+<li><p><strong>atomic</strong> – (Optional) Whether atomic instructions should be used or not. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TP.s.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a26d7da32681aab4177e5404de5216525"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">count</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Append an array of elements to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>buf</strong> – <strong>[inout]</strong> The array pointer. </p></li>
+<li><p><strong>count</strong> – The array length. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="lgraph_api::olap::ParallelVector::Append__ParallelVector:T:R.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9c6d119f42bbb02b422f2abdf5a39a26"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Append another vector of elements to this. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>other</strong> – <strong>[inout]</strong> The other vector. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::Swap__ParallelVector:T:R"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1acd7f1912f9dbf8e003bd6e72e4e9efd2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd><p>Swap the current vector with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other vector to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="lgraph_api::olap::ParallelVector::Copy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a6ea526f22af350302e37123f3c37e4ff"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Copy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy the current vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A new vector with the same copied content. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="lgraph_api::olap::ParallelVector::destroyed___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a62dfd137075e11ff18b5516f41bd50c2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">destroyed_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="lgraph_api::olap::ParallelVector::capacity___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa3099a4c2b0b3ab5ba4188b4a8f59b26"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">capacity_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5data_E"></span><span id="lgraph_api::olap::ParallelVector::data___TP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa5a936fbbc363fa1913fdaadc70d872a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5data_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5size_E"></span><span id="lgraph_api::olap::ParallelVector::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadStateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadStateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadStateE"></span><span id="lgraph_api::olap::ThreadState"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ThreadState</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadStateE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState4currE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState4currE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState4currE"></span><span id="lgraph_api::olap::ThreadState::curr__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a8eea8ae4d204a609211b5cdf1e0aa19a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState4currE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState3endE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState3endE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState3endE"></span><span id="lgraph_api::olap::ThreadState::end__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1aca05b1afbbe1c83cf087b49df03c441a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState3endE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState5stateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState5stateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState5stateE"></span><span id="lgraph_api::olap::ThreadState::state__i"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a89f234133d3efe315836311cbf21c64b"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">state</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState5stateE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardE">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardE"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardE"></span><span id="lgraph_api::olap::VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> automatically acquires the lock on construction and releases the lock on destruction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__bVP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aca9940bbc3948c4b105cf4edf770aeac"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">volatile</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">lock</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1a89a098e56f889f8015db67136b3c8ee3"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aeb1d045c401b22855341e0084681ec13"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="lgraph_api::olap::VertexLockGuard::~VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aa7fb9013a4d1c11f4bf8c73c079d8e55"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="lgraph_api::olap::VertexLockGuard::lock___bP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1ac56529c72897ed7db313a69efe299cb3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">lock_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerE">
+<span id="_CPPv3N10lgraph_api4olap6WorkerE"></span><span id="_CPPv2N10lgraph_api4olap6WorkerE"></span><span id="lgraph_api::olap::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>All the parallel tasks should be delegated through <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> to prevent a huge number of threads being populated via OpenMP. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6WorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker6WorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker6WorkerEv"></span><span id="lgraph_api::olap::Worker::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1ac243ac161c3b8a4e9b7d8ab6cccceed7"></span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6WorkerEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerD0Ev">
+<span id="_CPPv3N10lgraph_api4olap6WorkerD0Ev"></span><span id="_CPPv2N10lgraph_api4olap6WorkerD0Ev"></span><span id="lgraph_api::olap::Worker::~Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a6c90b9d499e906079194f681b6cb90ca"></span><span class="sig-name descname"><span class="n"><span class="pre">~Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE">
+<span id="_CPPv3N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span id="_CPPv2N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a78582857fb711225979abb2702d89bad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delegate</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Send some work to the <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>work</strong> – The function describing the work. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>             <span class="n">Exceptions</span> <span class="n">can</span> <span class="n">be</span> <span class="n">thrown</span> <span class="ow">in</span> <span class="n">the</span> <span class="n">work</span> <span class="n">function</span> <span class="k">if</span> <span class="n">necessary</span><span class="o">.</span>
+             <span class="n">Note</span> <span class="n">that</span> <span class="n">Delegate</span> <span class="n">cannot</span> <span class="n">be</span> <span class="n">nested</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute">
+<span id="_CPPv3I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span id="_CPPv2I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Compute</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a7515974ca033a44c70f5b965ba736c7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DelegateCompute</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">compute</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="lgraph_api::olap::Worker::SharedWorker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a21214620b0c58b939404d191d78e1415"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">SharedWorker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the global (shared) worker. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A shared pointer to the global <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9stopping_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9stopping_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9stopping_E"></span><span id="lgraph_api::olap::Worker::stopping___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a72446f290a943941576f6803ea96a0da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">stopping_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9stopping_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9has_work_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9has_work_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9has_work_E"></span><span id="lgraph_api::olap::Worker::has_work___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a3b09e0253be21a64efc11b5ad9887b10"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">has_work_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9has_work_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6mutex_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker6mutex_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker6mutex_E"></span><span id="lgraph_api::olap::Worker::mutex___std::mutex"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a281b5ec791338d4378e22ef44a51b4a1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">mutex</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">mutex_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6mutex_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker3cv_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker3cv_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker3cv_E"></span><span id="lgraph_api::olap::Worker::cv___std::condition_variable"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a5eb1f373ea25b73577b6e0205ad7b399"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">condition_variable</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cv_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker3cv_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker5task_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker5task_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker5task_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a173918333017695d1cb7984078721f78"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">packaged_task</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">task_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker5task_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker7worker_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker7worker_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker7worker_E"></span><span id="lgraph_api::olap::Worker::worker___std::thread"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a2d17662c59ba51130a35fdaa8567db74"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">thread</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">worker_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker7worker_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-on-db">
+<h2>olap_on_db<a class="headerlink" href="#olap-on-db" title="永久链接至标题"></a></h2>
+<p>TuGraph OLAP interface. To implement a plugin that perform graph analytics on TuGraph, user can load a Snapshot from the database, and then use the Gather-Apply-Scatter style interface to do the computation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="lgraph_api::olap::SNAPSHOT_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a24ed9da8cd6c1132a468b64f9ed37f7a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE" title="永久链接至目标"></a><br></dt>
+<dd><p>The available options for (graph construction) flags. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="lgraph_api::olap::SNAPSHOT_UNDIRECTED__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1ac92e5bd74f22a5d50d401c61577c2502"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_UNDIRECTED</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="lgraph_api::olap::SNAPSHOT_IDMAPPING__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1af550d7266e9792ecd7c8d4cec91b8ceb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IDMAPPING</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">2</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a7942e3aa179aef017291e80f6cab14ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">3</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE" title="永久链接至目标"></a><br></dt>
+<dd><p>The following options are not implemented yet. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a5553d31915ca2c1c043688e19a45ac10"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">4</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a1a3bf7fdc6b1674e1dc931f68c1b783e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">5</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a44ce105282f3a854a595cc978fa04693"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">6</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE">
+<span id="_CPPv3I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span id="_CPPv2I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a6f30998cf8b6f4da8c4d3cbb308b08ca"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="lgraph_api::olap::edge_convert_default::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_default</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">1;return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="永久链接至目标"></a><br></dt>
+<dd><p>Default Parser for weighted edges for graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE">
+<span id="_CPPv3I0EN10lgraph_api4olap19edge_convert_weightE"></span><span id="_CPPv2I0EN10lgraph_api4olap19edge_convert_weightE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aa93176409e55c8dbf3df1979c99bb07d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="lgraph_api::olap::edge_convert_weight::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_weight</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">eit.GetField("weight").real();return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="永久链接至目标"></a><br></dt>
+<dd><p>Example parser for extract from edge property “weight” </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDBE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDBE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDBE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olapE" title="lgraph_api::olap"><span class="n"><span class="pre">olap</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase"><span class="n"><span class="pre">OlapBase</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_on_db.h&gt;</em></div>
+<p>Snapshot is a derived class of Graph. Snapshot instances represent static (sub)graphs exported from LightningGraph. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses. </p>
+<p>EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a49ed16af93c6bfbaff9856aefb2d8f04"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1/V2 Procedures </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a31bb964e9baa8452632dfe0d97f253fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1 Procedures </p>
+<p>
+Note: read-write transactions are not recommended here for safety, e.g. some vertices might be removed causing inconsistencies of the analysis, and vertex data extraction may not work for deleted vertices). The constructed graph should contain all vertices whose vertex_filter calls return true and all edges <em>sourced from</em> these vertices whose out_edge_filter calls return true. If SNAPSHOT_UNDIRECTED is specified, the graph will be made symmetric (i.e. reversed edges are also added to the graph). </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges.</p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__GraphDBR.TransactionR.std::vector:std::vector:ss::.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a38771d37dea34f28513dd5305385dfa4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_list</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a428105b32ebebb9bd1ad5df715e8b3d5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Generate a graph without LightningGraph. For V2 Procedures </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a384cbed54b1bcd0610dfc176b0b58563"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a80b05d175e882c00a314f5ba518a55d4"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a79cc725b6c20ffac60c4c980e472d7e1"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::assign-operator__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaa45fb6b0cfa2ce83892f4667684d92a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="lgraph_api::olap::OlapOnDB::~OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c2abb48c34772b4ffd882210300572b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a14ebd243f449d5ef5dc6ffc56d0855c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Extract a vertex array from the graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>extract</strong> – The function describing the extraction logic.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> containing each vertex’s extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab5f0b3fee89201df1f5fa5bd06cceb4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToFile</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToFile::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output_file</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Write vertex data to a file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – The parallel vector storing the vertex data. </p></li>
+<li><p><strong>output_file</strong> – The path to the output file. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c18bf21eacc3c981bb129d99ae63f86"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToGraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToGraphDB::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Write vertex data to the graph database. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – <strong>[inout]</strong> The parallel vector storing the vertex data. </p></li>
+<li><p><strong>vertex_field</strong> – <strong>[in]</strong> The name of the vertex field. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OriginalVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a514e2403802681b3a6ab6e3e1521f3ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OriginalVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the original vertex id (in LightningGraph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The original id of the specified vertex in the graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::MappedVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a6ed1fe8e61e5879a68744a79c522ee0a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MappedVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">original_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the mapped vertex id (in the graph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>original_vid</strong> – The original vertex id (in LightningGraph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The mapped id of the specified vertex (in LightningGraph). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="lgraph_api::olap::OlapOnDB::GetTransaction"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a05e20809b4047a9dc2d54f28b3f62528"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetTransaction</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::Init__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a4457f7e41bdf9a2d7fe100d1bdc32ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Init</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">num_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapOnDB::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab7d7ef02dcbc497f1bc8e738188613c8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv" title="永久链接至目标"></a><br></dt>
+<dd><p>This decision formula is used to determine whether to stop the algorithm running in <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="lgraph_api::olap::OlapOnDB::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a9af72b216eb95e320f0f261d9497c5c1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithVid"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a85b384fc73a534221f880e966c2ca608"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithDegree"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ac2d9a6a8d98a79402d9505ac3270373f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithDegree</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB3db_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="lgraph_api::olap::OlapOnDB::db___GraphDBP"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaaee9f9643b55632219320d15882f548"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="lgraph_api::olap::OlapOnDB::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="lgraph_api::olap::OlapOnDB::original_vids___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a82054e1776bcb3b09cb66389c1eeb781"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">original_vids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="lgraph_api::olap::OlapOnDB::vid_map___cuckoohash_map:s.s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a2871a76b39823e6482e093f9b0cacb78"></span><span class="n"><span class="pre">cuckoohash_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_map_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="lgraph_api::olap::OlapOnDB::flags___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a5bb1ec258a7281a0702e64c19bcda816"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vertex_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa4b2136dfe22d40f01778f7b04aa9993"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edge_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-profile">
+<h2>olap_profile<a class="headerlink" href="#olap-profile" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsageE"></span><span id="lgraph_api::olap::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsageE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_profile.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="lgraph_api::olap::MemUsage::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac231833949c8ed135c0e8e59af8d7e6c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="lgraph_api::olap::MemUsage::getMaxMemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a4f02170838631103c72261595c35916b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">getMaxMemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5resetEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5resetEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5resetEv"></span><span id="lgraph_api::olap::MemUsage::reset"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ad20897c5c8bd47f5d4005989bead0e55"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5resetEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="lgraph_api::olap::MemUsage::startMemRecord__unsigned-i"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac3db2b796bdfa6e43a1302c5a1072ba3"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">startMemRecord</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">interval</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1000</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5printEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5printEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5printEv"></span><span id="lgraph_api::olap::MemUsage::print"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a388f572c62279f839ee138a9afbdeeb5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">print</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5printEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="lgraph_api::olap::MemUsage::parseMemLine__cP"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a07befe13a6e76ab6c84719817c5fadbf"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parseMemLine</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">line</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="lgraph_api::olap::MemUsage::maxMemUsage__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a274bce27e5ba57cce5606ba61eb28489"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">maxMemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..7773487052
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++存储过程接口
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.md
new file mode 100644
index 0000000000..ddd44d41a5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.md
@@ -0,0 +1,1543 @@
+
+
+             
+  <section id="python">
+
+<p>Version: 4.3.0</p>
+<p>Copyright (C) 2018-2022 Ant Group.</p>
+<div class="toctree-wrapper compound">
+</div>
+<section id="id1">
+<h2>介绍<a class="headerlink" href="#id1" title="永久链接至标题"></a></h2>
+<p>与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。</p>
+<p>这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。</p>
+</section>
+<section id="module-liblgraph_python_api">
+<span id="id2"></span><h2>接口<a class="headerlink" href="#module-liblgraph_python_api" title="永久链接至标题"></a></h2>
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">AccessLevel</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel" title="永久链接至目标"></a></dt>
+<dd><p>Access that a user has on a graph.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NONE</p>
+<p>READ</p>
+<p>WRITE</p>
+<p>FULL</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">EdgeUid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid" title="永久链接至目标"></a></dt>
+<dd><p>Edge identifier.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.dst">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">dst</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.dst" title="永久链接至目标"></a></dt>
+<dd><p>Destination vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.eid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">eid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.eid" title="永久链接至目标"></a></dt>
+<dd><p>ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.lid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">lid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.lid" title="永久链接至目标"></a></dt>
+<dd><p>Label ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.src">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">src</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.src" title="永久链接至目标"></a></dt>
+<dd><p>Source vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.tid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">tid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.tid" title="永久链接至目标"></a></dt>
+<dd><p>Temporal ID of the edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldData</span></span><a class="headerlink" href="#liblgraph_python_api.FieldData" title="永久链接至目标"></a></dt>
+<dd><p>FieldData is the data type of field value.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBlob">
+<span class="sig-name descname"><span class="pre">AsBlob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bytes</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBlob" title="永久链接至目标"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBool">
+<span class="sig-name descname"><span class="pre">AsBool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBool" title="永久链接至目标"></a></dt>
+<dd><p>Get value as bool, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDate">
+<span class="sig-name descname"><span class="pre">AsDate</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDate" title="永久链接至目标"></a></dt>
+<dd><p>Get value as date, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDateTime">
+<span class="sig-name descname"><span class="pre">AsDateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDateTime" title="永久链接至目标"></a></dt>
+<dd><p>Get value as datetime, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDouble">
+<span class="sig-name descname"><span class="pre">AsDouble</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDouble" title="永久链接至目标"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsFloat">
+<span class="sig-name descname"><span class="pre">AsFloat</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsFloat" title="永久链接至目标"></a></dt>
+<dd><p>Get value as float, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt16">
+<span class="sig-name descname"><span class="pre">AsInt16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt16" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int16, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt32">
+<span class="sig-name descname"><span class="pre">AsInt32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt32" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int32, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt64">
+<span class="sig-name descname"><span class="pre">AsInt64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt64" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int64, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt8">
+<span class="sig-name descname"><span class="pre">AsInt8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt8" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int8, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsString">
+<span class="sig-name descname"><span class="pre">AsString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsString" title="永久链接至目标"></a></dt>
+<dd><p>Get value as string, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Blob">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Blob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bytes</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Blob" title="永久链接至目标"></a></dt>
+<dd><p>Make a BLOB value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Bool">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Bool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Bool" title="永久链接至目标"></a></dt>
+<dd><p>Make a BOOL value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Date">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Date</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.Date" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>Date(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+<ol class="arabic simple" start="2">
+<li><p>Date(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.DateTime">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">DateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.DateTime" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>DateTime(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+<ol class="arabic simple" start="2">
+<li><p>DateTime(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Double">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Double</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Double" title="永久链接至目标"></a></dt>
+<dd><p>Make a DOUBLE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Float">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Float</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Float" title="永久链接至目标"></a></dt>
+<dd><p>Make a FLOAT value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int16">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int16" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT16 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int32">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int32" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT32 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int64">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int64" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT64 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int8">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int8" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT8 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.String">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">String</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.String" title="永久链接至目标"></a></dt>
+<dd><p>Make a STRING value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.ToPython">
+<span class="sig-name descname"><span class="pre">ToPython</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.ToPython" title="永久链接至目标"></a></dt>
+<dd><p>Convert to corresponding Python type.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.get">
+<span class="sig-name descname"><span class="pre">get</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.get" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.isNull">
+<span class="sig-name descname"><span class="pre">isNull</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.isNull" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.set">
+<span class="sig-name descname"><span class="pre">set</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.set" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldSpec</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec" title="永久链接至目标"></a></dt>
+<dd><p>Field specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.name" title="永久链接至目标"></a></dt>
+<dd><p>Name of this field.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.nullable">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">nullable</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.nullable" title="永久链接至目标"></a></dt>
+<dd><p>Whether this field can be null.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.type">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">type</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.type" title="永久链接至目标"></a></dt>
+<dd><p>Type of this field, INT8, INT16, …, FLOAT, DOUBLE, STRING.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldType</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType" title="永久链接至目标"></a></dt>
+<dd><p>Data type of FieldData.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NUL</p>
+<p>BOOL</p>
+<p>INT8</p>
+<p>INT16</p>
+<p>INT32</p>
+<p>INT64</p>
+<p>FLOAT</p>
+<p>DOUBLE</p>
+<p>DATE</p>
+<p>DATETIME</p>
+<p>STRING</p>
+<p>BLOB</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Galaxy</span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy" title="永久链接至目标"></a></dt>
+<dd><p>A galaxy is a TuGraph instance that holds multiple GraphDBs.
+A galaxy is stored in a directory and manages users and GraphDBs. Each (user, GraphDB) pair can have different access levels. You can use db=Galaxy.OpenGraph(graph) to open a graph. Since garbage collection in Python is automatic, you need to close the galaxy with Galaxy.Close() when you are done with it.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.Close" title="永久链接至目标"></a></dt>
+<dd><p>Closes this galaxy</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateGraph">
+<span class="sig-name descname"><span class="pre">CreateGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">4398046511104</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateGraph" title="永久链接至目标"></a></dt>
+<dd><p>Creates a graph.
+name: the name of the graph
+description: description of the graph
+max_size: maximum size of the graph, default 1TB</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateRole">
+<span class="sig-name descname"><span class="pre">CreateRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateRole" title="永久链接至目标"></a></dt>
+<dd><p>Create a role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateUser">
+<span class="sig-name descname"><span class="pre">CreateUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateUser" title="永久链接至目标"></a></dt>
+<dd><p>Creates a new user account.
+name: name of the user
+password: password for the user
+desc: description of this user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteGraph">
+<span class="sig-name descname"><span class="pre">DeleteGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteGraph" title="永久链接至目标"></a></dt>
+<dd><p>Deletes a graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteRole">
+<span class="sig-name descname"><span class="pre">DeleteRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteRole" title="永久链接至目标"></a></dt>
+<dd><p>Deletes the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteUser">
+<span class="sig-name descname"><span class="pre">DeleteUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteUser" title="永久链接至目标"></a></dt>
+<dd><p>Deletes a user account</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DisableUser">
+<span class="sig-name descname"><span class="pre">DisableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DisableUser" title="永久链接至目标"></a></dt>
+<dd><p>Disables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.EnableUser">
+<span class="sig-name descname"><span class="pre">EnableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.EnableUser" title="永久链接至目标"></a></dt>
+<dd><p>Enables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.GetUserInfo">
+<span class="sig-name descname"><span class="pre">GetUserInfo</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::UserInfo</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.GetUserInfo" title="永久链接至目标"></a></dt>
+<dd><p>Get information of the specified user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListGraphs">
+<span class="sig-name descname"><span class="pre">ListGraphs</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListGraphs" title="永久链接至目标"></a></dt>
+<dd><p>Lists graphs and returns a dictionary of {name:(desc, max_size)}</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListUsers">
+<span class="sig-name descname"><span class="pre">ListUsers</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict[str,</span> <span class="pre">lgraph_api::UserInfo]</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListUsers" title="永久链接至目标"></a></dt>
+<dd><p>Lists all users and whether they are admin</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ModGraph">
+<span class="sig-name descname"><span class="pre">ModGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ModGraph" title="永久链接至目标"></a></dt>
+<dd><p>mod_size: whether to modify max graph size
+new_max_size: new maximum size of the graph, in bytes</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.OpenGraph">
+<span class="sig-name descname"><span class="pre">OpenGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">read_only</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::GraphDB</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.OpenGraph" title="永久链接至目标"></a></dt>
+<dd><p>Opens a graph and returns a GraphDB instance.
+graph: name of the graph
+read_only: whether to open the graph in read-only mode</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetCurrentUser">
+<span class="sig-name descname"><span class="pre">SetCurrentUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetCurrentUser" title="永久链接至目标"></a></dt>
+<dd><p>Validate user password and set current user.
+user: user name
+password: password of the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRights">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRights</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRights" title="永久链接至目标"></a></dt>
+<dd><p>Set access rights for the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRightsIncremental</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental" title="永久链接至目标"></a></dt>
+<dd><p>Set access rights for the specified role, only affects the specified graphs</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleDesc">
+<span class="sig-name descname"><span class="pre">SetRoleDesc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleDesc" title="永久链接至目标"></a></dt>
+<dd><p>Set description of the specified role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUser">
+<span class="sig-name descname"><span class="pre">SetUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUser" title="永久链接至目标"></a></dt>
+<dd><p>Validate the given user and set current user given in the user.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserGraphAccess">
+<span class="sig-name descname"><span class="pre">SetUserGraphAccess</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">access</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserGraphAccess" title="永久链接至目标"></a></dt>
+<dd><p>Set the access level of the specified user on the graph.
+user: name of the user
+graph: name of the graph
+access: access level of the user on that graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserPass">
+<span class="sig-name descname"><span class="pre">SetUserPass</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self:</span> <span class="pre">liblgraph_python_api.Galaxy</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">name:</span> <span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">old_password:</span> <span class="pre">str</span> <span class="pre">=</span> <span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_password:</span> <span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserPass" title="永久链接至目标"></a></dt>
+<dd><p>Modifies user password.
+name: name of the user
+old_password: current password, not needed when modifying another user
+new_password: new password for the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserRoles">
+<span class="sig-name descname"><span class="pre">SetUserRoles</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">roles</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserRoles" title="永久链接至目标"></a></dt>
+<dd><p>Set the roles for the specified user.
+name: name of the user
+roles: list of roles for this user</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">GraphDB</span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB" title="永久链接至目标"></a></dt>
+<dd><p>The graph database class.
+A GraphDB stores the data about the graph, including labels, vertices, edges and indexes.Since Garbage Collection in Python is automatic, you need to close the DB with GraphDB.Close() at the end of its lifetime.Make sure you have either committed or aborted every transaction that is using the DB before you close the DB.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddEdgeLabel">
+<span class="sig-name descname"><span class="pre">AddEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">temporal_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">[]</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddEdgeLabel" title="永久链接至目标"></a></dt>
+<dd><p>Adds an edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexIndex">
+<span class="sig-name descname"><span class="pre">AddVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">is_unique</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexIndex" title="永久链接至目标"></a></dt>
+<dd><p>Adds an index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexLabel">
+<span class="sig-name descname"><span class="pre">AddVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">primary_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexLabel" title="永久链接至目标"></a></dt>
+<dd><p>Add a vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields" title="永久链接至目标"></a></dt>
+<dd><p>Add fields to an edge label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields" title="永久链接至目标"></a></dt>
+<dd><p>Delete fields from an edge label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModFields" title="永久链接至目标"></a></dt>
+<dd><p>Modify fields in an edge label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModifyConstraints</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints" title="永久链接至目标"></a></dt>
+<dd><p>Modify edge constraints</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelAddFields" title="永久链接至目标"></a></dt>
+<dd><p>Add fields to a vertex label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelDelFields" title="永久链接至目标"></a></dt>
+<dd><p>Delete fields from a vertex label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelModFields" title="永久链接至目标"></a></dt>
+<dd><p>Modify fields in a vertex label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Close" title="永久链接至目标"></a></dt>
+<dd><p>Closes the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateReadTxn">
+<span class="sig-name descname"><span class="pre">CreateReadTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateReadTxn" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateWriteTxn">
+<span class="sig-name descname"><span class="pre">CreateWriteTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">optimistic</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateWriteTxn" title="永久链接至目标"></a></dt>
+<dd><p>Create a write transaction.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteEdgeLabel">
+<span class="sig-name descname"><span class="pre">DeleteEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteEdgeLabel" title="永久链接至目标"></a></dt>
+<dd><p>Deletes an edge label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexIndex">
+<span class="sig-name descname"><span class="pre">DeleteVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexIndex" title="永久链接至目标"></a></dt>
+<dd><p>Deletes the specified index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexLabel">
+<span class="sig-name descname"><span class="pre">DeleteVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexLabel" title="永久链接至目标"></a></dt>
+<dd><p>Deletes a vertex label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllData">
+<span class="sig-name descname"><span class="pre">DropAllData</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllData" title="永久链接至目标"></a></dt>
+<dd><p>Drop all the data in this DB.
+All vertices, edges, labels and indexes will be dropped.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllVertex">
+<span class="sig-name descname"><span class="pre">DropAllVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllVertex" title="永久链接至目标"></a></dt>
+<dd><p>Drops all the vertices and edges in this DB.
+Labels and indexes (though index contents will be cleared due to deletion of vertices) will be preserved.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.EstimateNumVertices">
+<span class="sig-name descname"><span class="pre">EstimateNumVertices</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.EstimateNumVertices" title="永久链接至目标"></a></dt>
+<dd><p>Gets an estimation of the number of vertices.
+This can be inaccurate if there were vertex removals.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Flush">
+<span class="sig-name descname"><span class="pre">Flush</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Flush" title="永久链接至目标"></a></dt>
+<dd><p>Flushes written data into disk.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetDescription">
+<span class="sig-name descname"><span class="pre">GetDescription</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetDescription" title="永久链接至目标"></a></dt>
+<dd><p>Gets description of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetMaxSize">
+<span class="sig-name descname"><span class="pre">GetMaxSize</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetMaxSize" title="永久链接至目标"></a></dt>
+<dd><p>Gets maximum size of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.IsVertexIndexed" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">InEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>InEdgeIterator can be used to iterate through all the incoming edges of the destination vertex.
+Incoming edges are sorted in (dst, label, src, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Delete" title="永久链接至目标"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetAllFields" title="永久链接至目标"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetDst" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetEdgeId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetField" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabel" title="永久链接至目标"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetSrc" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetUid" title="永久链接至目标"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Goto" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the in edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next in edge to current destination vertex.
+If there is no more in edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetField" title="永久链接至目标"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.ToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">IndexSpec</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec" title="永久链接至目标"></a></dt>
+<dd><p>Index specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.field">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">field</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.field" title="永久链接至目标"></a></dt>
+<dd><p>Name of the field</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.label">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">label</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.label" title="永久链接至目标"></a></dt>
+<dd><p>Name of the label.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.unique">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">unique</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.unique" title="永久链接至目标"></a></dt>
+<dd><p>Whether the indexed values are unique.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">LGraphType</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType" title="永久链接至目标"></a></dt>
+<dd><p>Members:</p>
+<p>NUL : NUL</p>
+<p>INTEGER : INTEGER</p>
+<p>FLOAT : FLOAT</p>
+<p>DOUBLE : DOUBLE</p>
+<p>BOOLEAN : BOOLEAN</p>
+<p>STRING : STRING</p>
+<p>NODE : NODE</p>
+<p>RELATIONSHIP : RELATIONSHIP</p>
+<p>PATH : PATH</p>
+<p>LIST : LIST</p>
+<p>MAP : MAP</p>
+<p>ANY : ANY</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">OutEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>OutEdgeIterator can be used to iterate through all the out-going edges of the source vertex.
+Out-going edges are sorted in (src, lid, dst, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Delete" title="永久链接至目标"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetAllFields" title="永久链接至目标"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetDst" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetEdgeId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetField" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabel" title="永久链接至目标"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetSrc" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetUid" title="永久链接至目标"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Goto" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the out edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next out edge from current source vertex.
+If there is no more out edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetField" title="永久链接至目标"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_values are FieldData containing the field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the field values as specified in value_dict.
+value_dict specifies the field_name:value dictionary.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.ToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">PluginErrorCode</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode" title="永久链接至目标"></a></dt>
+<dd><p>ErrorCode of plugin.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>SUCCESS</p>
+<p>INPUT_ERR</p>
+<p>INTERNAL_ERR</p>
+<p>SUCCESS_WITH_SIGNATURE</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Transaction</span></span><a class="headerlink" href="#liblgraph_python_api.Transaction" title="永久链接至目标"></a></dt>
+<dd><p>In embedded mode, all the operations are performed in transactions and thus enjoys the power of
+transactions such as atomicity and isolation. You can commit or abort a transaction at any time
+without worrying about the side effects it has already made.
+Transactions can be either committed or aborted, after which it is destructed and becomes invalid.
+Make sure you have destructed every transaction before you closes the corresponding GraphDB.
+Transactions also track the created iterators and releases all the iterators during destruction.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Abort">
+<span class="sig-name descname"><span class="pre">Abort</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Abort" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddEdge">
+<span class="sig-name descname"><span class="pre">AddEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddEdge" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values in string format.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label id, field ids, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+Returns the id of the newly added edge.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddVertex">
+<span class="sig-name descname"><span class="pre">AddVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddVertex" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values in string format.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label ids, field ids, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_ids are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, value_dict: dict) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name and set the value as specified in value_dict.
+Returns the id of the newly added vertex.
+Fields that are not specified in the dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Commit">
+<span class="sig-name descname"><span class="pre">Commit</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Commit" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.DumpGraph">
+<span class="sig-name descname"><span class="pre">DumpGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.DumpGraph" title="永久链接至目标"></a></dt>
+<dd><p>Prints the string representation of the WHOLE graph to stdout.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeFieldId">
+<span class="sig-name descname"><span class="pre">GetEdgeFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeFieldId" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_name: str) -&gt; int</p></li>
+</ol>
+<p>Gets the edge field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_names: List[str]) -&gt; List[int]</p></li>
+</ol>
+<p>Gets the edge field ids associated with this (label_id, field_names).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeLabelId">
+<span class="sig-name descname"><span class="pre">GetEdgeLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the edge label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeSchema">
+<span class="sig-name descname"><span class="pre">GetEdgeSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeSchema" title="永久链接至目标"></a></dt>
+<dd><p>Gets the schema specification of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetInEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator pointing to the in-edge of vertex dst with EdgeUid==euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumEdgeLabels">
+<span class="sig-name descname"><span class="pre">GetNumEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumEdgeLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumVertexLabels">
+<span class="sig-name descname"><span class="pre">GetNumVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumVertexLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetOutEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator pointing to the edge identified by euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexByUniqueIndex">
+<span class="sig-name descname"><span class="pre">GetVertexByUniqueIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexByUniqueIndex" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value_string: str) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value_string specifies the string representation of the indexed field value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value: object) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value specifies the indexed field value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, field_value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+field_value is a FieldData specifying the indexed field value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldId">
+<span class="sig-name descname"><span class="pre">GetVertexFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the vertex field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldIds">
+<span class="sig-name descname"><span class="pre">GetVertexFieldIds</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_names</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldIds" title="永久链接至目标"></a></dt>
+<dd><p>Gets the vertex field ids associated with this (label_id, [field_names]).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIndexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIndexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIndexIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>Gets an VertexIndexIterator pointing to the indexed item which has index value [key_start, key_end].
+key_start=key_end=v returns an iterator pointing to all vertexes that has field value v.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+value is a FieldData containing the indexed value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start_string: str, key_end_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start_string is the string representation of the minimum indexed value.
+key_end_string is the string representation of the maximum indexed value.</p>
+<ol class="arabic simple" start="4">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="5">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value_string is the string representation of the indexed value.</p>
+<ol class="arabic simple" start="6">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value is a FieldData containing the indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the first vertex in the graph.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the vertex specified by vid.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int, nearest: bool) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets VertexIterator with vertex id.
+If nearest==true, go to the first vertex with id &gt;= vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexLabelId">
+<span class="sig-name descname"><span class="pre">GetVertexLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the vertex label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexSchema">
+<span class="sig-name descname"><span class="pre">GetVertexSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexSchema" title="永久链接至目标"></a></dt>
+<dd><p>Gets the schema specification of the vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsReadOnly">
+<span class="sig-name descname"><span class="pre">IsReadOnly</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsReadOnly" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsValid" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsVertexIndexed" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListEdgeLabels">
+<span class="sig-name descname"><span class="pre">ListEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListEdgeLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexIndexes">
+<span class="sig-name descname"><span class="pre">ListVertexIndexes</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.IndexSpec" title="liblgraph_python_api.IndexSpec"><span class="pre">liblgraph_python_api.IndexSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexIndexes" title="永久链接至目标"></a></dt>
+<dd><p>Gets the list of all the vertex indexes in the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexLabels">
+<span class="sig-name descname"><span class="pre">ListVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.UpsertEdge">
+<span class="sig-name descname"><span class="pre">UpsertEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.UpsertEdge" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values in string format.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label id, field ids, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.VertexToString">
+<span class="sig-name descname"><span class="pre">VertexToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.VertexToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of the vertex specified by vid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIndexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator" title="永久链接至目标"></a></dt>
+<dd><p>VertexIndexIterator can be used to retrieve the id of indexed vertices.
+Vertex ids are sorted in ascending order of (index_value, vertex_id).</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetIndexValue">
+<span class="sig-name descname"><span class="pre">GetIndexValue</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetIndexValue" title="永久链接至目标"></a></dt>
+<dd><p>Gets the indexed value.
+Since vertex ids are sorted in (index_value, vertex_id) order, calling Next() may change the current indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetVid">
+<span class="sig-name descname"><span class="pre">GetVid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetVid" title="永久链接至目标"></a></dt>
+<dd><p>Gets the id of the vertex currently pointed to.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether this iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next indexed vid.
+If there is no more vertex within the specified key range, the iterator becomes invalid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator" title="永久链接至目标"></a></dt>
+<dd><p>VertexIterator can be used to retrieve info of a vertex, or to scan through multiple vertices.
+Vertexes are sorted in ascending order of the their ids.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Delete" title="永久链接至目标"></a></dt>
+<dd><p>Deletes current vertex.
+The iterator will point to the next vertex if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetAllFields" title="永久链接至目标"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetField" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetId">
+<span class="sig-name descname"><span class="pre">GetId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the integer id of this vertex.
+GraphDB assigns an integer id for each vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetInEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the first in-coming edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the in-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabel" title="永久链接至目标"></a></dt>
+<dd><p>Gets the label name of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the label id of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumInEdges">
+<span class="sig-name descname"><span class="pre">GetNumInEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumInEdges" title="永久链接至目标"></a></dt>
+<dd><p>Gets the number of in-coming edges of this vertex.
+n_limit specifies the maximum number of edges to scan.
+Returns a tuple containing the number of in-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumOutEdges">
+<span class="sig-name descname"><span class="pre">GetNumOutEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumOutEdges" title="永久链接至目标"></a></dt>
+<dd><p>Gets the number of out edges of this vertex.
+n_limit specifies the maximum number of vids to scan.Returns a tuple containing the number of out-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetOutEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the first out-going edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the out-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Goto" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the vertex specified by vid.
+If nearest==true, go to the nearest vertex with id&gt;=vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListDstVids">
+<span class="sig-name descname"><span class="pre">ListDstVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListDstVids" title="永久链接至目标"></a></dt>
+<dd><p>Lists all destination vids of the out edges.
+n_limit specifies the maximum number of vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListSrcVids">
+<span class="sig-name descname"><span class="pre">ListSrcVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListSrcVids" title="永久链接至目标"></a></dt>
+<dd><p>Lists all source vids of the in edges.
+n_limit specifies the maximum number of src vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next vertex with id&gt;{current_vid}.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetField" title="永久链接至目标"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of current vertex, including properties and edges.</p>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..0b4dddbea6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,25 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python存储过程接口
+====================================
+Version: 4.3.0
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+介绍
+------------------
+与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。
+
+这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。
+
+接口
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..1db9127da9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,19 @@
+# Rust 存储过程
+
+## 1. 介绍
+Rust 存储过程目前仅支持v1版本，TuGraph能够支持一切编译成动态库的语言作为插件。Rust语言作为系统编程语言的新起之秀，在安全性上、可靠性以及人体工程学上相较于C++具有较大优势。
+
+我们提供了TuGraph的[Rust binding]库来支持在Rust中调用lgrahp api，同时提供[tugraph-plugin-util] 工具库来帮助大家更加简洁地编写Rust插件代码。
+
+[Rust binding]: https://crates.io/crates/tugraph
+[tugraph-plugin-util]: https://crates.io/crates/tugraph-plugin-util
+
+## 2. 如何使用
+
+Rust存储过程的使用分三步：
+* 编译，从rust源码编译出so库。我们准备了一份一站式的插件编写教程，从IDE的插件安装，环境配置，到编译，详细参考`rust-tugraph-plugin-tutorial`。
+* 加载，将so库加载到服务端，可以通过REST或RPC接口，这一步和C++库的使用方式类似，可以参考[文档](1.procedure.md)。
+* 运行，和c++ procdure使用方式相同，不在赘述。
+
+## 3.API文档
+Rust社区习惯，所有的代码和文档都可以从[`crates.io`](https://crates.io/crates/tugraph )以及[`docs.rs`](https://docs.rs/tugraph/latest/tugraph )找到。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..a9d5269d58
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.3.0
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = Chinese
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..27a86697ca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..81b77be986
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..418a3cad66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,207 @@
+# OLAP API
+
+> 本文档是为TuGraph的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对TuGraph的图计算运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于Tugraph的一个简单的[BFS(宽度优先搜索)](https://en.wikipedia.org/wiki/Breadth-first_search "wikipedia")程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图分析引擎介绍
+
+TuGraph的图分析引擎，面向的场景主要是全图/全量数据分析类的任务。借助TuGraph的 C++ / Python 图分析引擎 API ，用户可以对不同数据来源的图数据快速导出一个待处理的复杂子图，然后在该子图上运行诸如PageRank、LPA、WCC等迭代式图算法，最后根据运行结果做出相应的对策。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph图计算系统社区版内置6个算法，商业版内置了25种算法，用户几乎不需要自己实现具体的图计算过程。其详细介绍可参考algorithms.md。
+
+根据数据来源及实现不同，可分为Procedure、Embed和Standalone三种运行方式，均继承于OlapBase API，OlapBase API接口文档可参考olapbase-api.md。
+
+其中Procedure和Embed的数据来源是图数据库中预加载的db数据，可以分别编译生成tugraph-web加载使用的.so文件和后台终端使用的embed文件，输入的图数据均通过db的加载形式，其接口文档可参考olapondb-api.md。
+Standalone用于编译生成standalone文件，区别于前者，该文件的输入图数据通过txt、二进制、ODPS文件的形式加载，其接口文档可参考olapondisk-api.md。
+
+## 2. Procedure 编译与运行
+
+该种方式主要用于tugraph-web界面进行可视化加载及运行。使用方法如下：
+
+### C++:
+在tugraph-db/procedures 目录下执行`bash make_so_cpp.sh bfs`即可在tugraph-db/procedures目录下得到bfs.so文件，将该文件以插件形式上传至tugraph-web，输入参数后即可执行。
+
+### Python:
+在tugraph-web的前端将python文件以插件形式上传，输入参数后即可执行。
+
+示例：
+在tugraph-db/procedures 编译.so算法文件
+`bash make_so_cpp.sh bfs`
+
+将bfs.so（或tugraph-db/procedures/algo_cython/bfs.py）文件以插件形式加载至tugraph-web后，输入如下json参数：
+
+```json
+{
+    "root_id":"0",
+    "label":"node",
+    "field":"id"
+}
+```
+即可得到返回结果如下。
+
+```json
+{
+  "core_cost": 0.013641119003295898,
+  "found_vertices": 3829,
+  "num_edges": 88234,
+  "num_vertices": 4039,
+  "output_cost": 8.821487426757813e-06,
+  "prepare_cost": 0.03479194641113281,
+  "total_cost": 0.04844188690185547
+}
+```
+
+输出内容解释如下：
+- core_cost: 表示算法运行所需要的时间。
+- found_vertices: 表示查找到点的个数。
+- num_edges: 表示该图数据的边数量。
+- num_vertices: 表示该图数据点的数量。
+- output_cost: 表示算法结果写回db所需要的时间。
+- prepare_cost: 表示预处理阶段所需要的时间。预处理阶段的工作：加载参数、图数据加载、索引初始化等。
+- total_cost: 表示执行该算法整体运行时间。
+
+make_so.sh文件介绍：该文件用于将TuGraph-OLAP所涉及到的图算法文件编译成一个可供tugraph-web使用的.so文件。
+
+## 3. Embed 编译与运行
+
+该种方式主要用于TuGraph在后台程序中对预加载的db图数据进行算法分析。其使用方法如下：
+在tugraph-db/procedures 目录下对embed_main.cpp文件完善，补充数据名称、输入参数、数据路径等信息，示例如下：
+
+### C++:
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path表示预加载图数据存放的路径
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // 指定图数据的名称
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // 以json形式输入算法参数
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+保存后在tugraph-db/procedures 目录下执行`bash make_embed.sh bfs`即可在tugraph-db/procedures/algo_cpp 目录下得到bfs_procedure文件。
+
+在tugraph-db/procedures 文件夹下执行`./algo_cpp/bfs_procedure` 即可得到返回结果：
+
+```json
+{
+  "core_cost":0.025603055953979492,
+  "found_vertices":3829,
+  "num_edges":88234,
+  "num_vertices":4039,
+  "output_cost":9.059906005859375e-06,
+  "prepare_cost":0.056738853454589844,
+  "total_cost":0.0823509693145752
+}
+```
+
+参数解释同上。
+
+### Python：
+在tugraph-db/procedures文件夹下执行
+`bash make_so_cython.sh bfs`
+或在tugraph-db/procedures/algo_cython文件夹下执行
+`python3 setup.py build_ext -i`
+得到bfs.so后，在Python中import bfs可使用，如tugraph-db/procedures/run_embed.py所示
+
+```python
+# tugraph-db/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+```
+通过如下命令执行
+
+```bash
+python3 run_embed.py
+```
+
+输出结果与C++相同。
+
+## 4. Standalone 编译与运行
+
+该文件主要用于在终端处直接加载图数据，并运行打印输出结果。使用方法如下：
+在tugraph-db/build目录下执行`make bfs_standalone` (需要在g++默认include路径中包含boost/sort/sort.hpp)即可得到bfs_standalone文件,该文件生成于tugraph-db/build/output/algo文件夹下。
+运行方式：在tugraph-db/build目录下执行`./output/algo/bfs_standalone -–type [type] –-input_dir [input_dir] --id_mapping [id_mapping] -–vertices [vertices] --root [root] –-output_dir [output_dir]`即可运行。
+
+- `[type]`：表示输入图文件的类型来源，包含text文本文件、BINARY_FILE二进制文件和ODPS源。
+- `[input_dir]`：表示输入图文件的文件夹路径，文件夹下可包含一个或多个输入文件。TuGraph在读取输入文件时会读取[input_dir]下的所有文件，要求[input_dir]下只能包含输入文件，不能包含其它文件。参数不可省略。
+- `[id_mapping]`：当读入边表时，是否对输入数据做id映射，使达到符合算法运行的形式。1为需要做id映射，0为不需要做。该过程会消耗一定时间。参数可省略，默认值为0。
+- `[vertices]`：表示图的点个数，为0时表示用户希望系统自动识别点数量；为非零值时表示用户希望自定义点个数，要求用户自定义点个数需大于最大的点ID。参数可省略，默认值为0。
+- `[root]`：表示进行bfs的起始点id。参数不可省略。
+- `[output_dir]`：表示输出数据保存的文件夹路径，将输出内容保存至该文件中，参数不可省略。
+
+示例：
+
+### C++:
+在tugraph-db/build编译standalone算法程序
+
+```bash
+make bfs_standalone
+```
+
+在tugraph-db/build/output目录下运行text源文件
+
+```bash
+./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+得到运行结果：
+
+```text
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+结果参数解释同上。
+
+对于新的算法，运行时不了解该算法的所需参数时，可通过`./output/algo/bfs_standalone -h`进行查阅对应参数。
+
+### Python:
+Python语言的bfs拓展编译过程与embed模式无区别，在运行时通过`Standalone`接口调用，示例如下：
+```python
+# tugraph-db/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(input_dir=
+                             "../test/integration/data/algo/fb_unweighted",
+                             root=0)
+```
+
+通过如下命令执行
+
+```bash
+python3 run_standalone.py
+```
+
+至此，通过TuGraph对上图进行bfs运算的过程已经完成。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..6991d63290
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,179 @@
+# OlapBase API
+
+> 此文档主要详细介绍了OlapBase API的使用说明
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统需要的简单配置，同时结合代码对TuGraph中几个共同的重要文件和接口进行解释。
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+
+## 3. 原子操作
+
+TuGraph使用了多线程技术进行批处理操作，在这种情况下可能会出现访存冲突现象。为了保证并行计算时修改操作的正确性，TuGraph实现了原子操作。代码部分见lgraph文件夹下的lgraph_atomic.cpp文件。
+TuGraph还自定义了4个常用的原子操作。当我们需要在多线程模式下修改点的数据时，我们都应该使用原子操作来确保并行环境下修改操作的正确性。除了这4个原子操作外，用户也可以使用“cas”来构建自己的原子操作函数。
+
+- `bool cas(T * ptr, T oldv, T newv)`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `bool write_min(T *a, T b)`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `bool write_max(T *a, T b)`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `void write_add(T *a, T b)`：将b的值加到a指向的值上。
+- `void write_sub(T *a, T b)`：将a指向的值减去b的值。
+
+## 4. 点集合类ParallelBitset
+
+在使用TuGraph进行批处理操作时，需要使用点集合来表示需要处理的点。ParallelBitset实现了点集合类，以bit为单位表示点，因此能够节省大量内存。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 4.1 ParallelBitset类成员
+
+- `size_t Size()`：表示Bitmap中的点个数。
+- `ParallelBitset(size_t size)`：初始化size和data，data长度为(size >> 6)+1
+- `void Clear()`：清空集合
+- `void Fill()`：将所有点加入集合
+- `bool Has(size_t i)`：检查点i是否在集合中
+- `bool Add(size_t i)`：将点i加入集合中
+- `void Swap(ParallelBitset &other)`：和另一组ParallelBitset集合交换元素
+
+## 5. 点数组类ParallelVector
+
+在使用TuGraph进行批处理操作时，需要使用点数组来表示对点的处理结果。ParallelVector实现了点数组类。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 5.1 ParallelVector类成员
+
+- `ParallelVector(size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `T &operator[](size_t i)`：下标为i的数据
+- `T *begin()`：ParallelVector的起始指针
+- `T *end()`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `T &Back()`：ParallelVector最后一个数据
+- `T *Data()`：表示数组本身数据
+- `void Destroy()`：清空ParallelVector数组内数据并删除数组
+- `size_t Size()`：表示ParallelVector中的数据个数
+- `size_t Capacity()`：表示ParallelVector的容量大小
+- `void Resize(size_t size)`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `void Clear()`：清空ParallelVector内数据
+- `void ReAlloc(size_t capacity)`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `void Fill(T elem)`：为ParallelVector的全部数据赋值为elem
+- `void Append(const T &elem, bool atomic = true)`：向ParallelVector结尾添加一个数据
+- `void Swap(ParallelVector<T> &other)`：和其他的ParallelVector交换数据
+- `ParallelVector<T> Copy()`：复制当前的ParallelVector数据存至Copy数组中
+
+## 6. 自定义数据结构
+
+### 6.1 基本数据类型
+
+我们自定义了点和边的数据结构表示，用于在覆盖所有点的同时节省内存空间：
+
+- `Empty`：内容为空的特殊数据类型。
+
+### 6.2 组合数据结构
+
+为了便于计算，我们根据计算场景不同，定义了几种点和边数据的数据结构，分别是：
+
+- `EdgeUnit<EdgeData>`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+  - `size_t src`：边的起始点
+  - `size_t dst`：边的终点
+  - `EdgeData edge_data`：边的权值
+- `AdjUnit<EdgeData>`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+  - `size_t neighbour`：边的邻居点
+  - `EdgeData edge_data`：边的权值
+- `AdjList<EdgeData>`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+  - `AdjUnit<T> * begin`：列表的起始指针
+  - `AdjUnit<T> * end`：列表的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对邻接表进行循环访问。
+
+## 7. 图类OlapBase
+
+图类OlapBase是TuGraph用于加载图以及进行图计算操作的主类，常用OlapBase<EdgeData>表示权值类型为EdgeData的图，代码部分见lgraph文件夹下的olap_base.hpp。本章将介绍Graph类中常用的类型和API接口。上文介绍Procedure、Embed及Standalone功能所使用的类均为该类的子类。
+
+### 7.1 基本信息
+
+- `size_t NumVertices()`：获取点数
+- `size_t NumEdges()`：获取边数
+- `size_t OutDegree(size_t vid)`：点vid的出度
+- `size_t InDegree(size_t vid)`：点vid的入度
+
+### 7.2 点集和边集及其相关操作
+
+- `ParallelVector<VertexData> AllocVertexArray<VertexData>()`：分配一个类型为VertexData的数组，大小为点个数
+- `void fill_vertex_array<V>(V * array, V value)`：将数组array中的所有元素赋值为value
+- `ParallelBitset AllocVertexSubset()`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `AdjList<EdgeData> OutEdges(size_t vid)`：获取点v的所有出边集合
+- `AdjList<EdgeData> InEdges(size_t vid)`：获取点v的所有入边集合
+- `void Transpose()`：对有向图进行图反转
+- `LoadFromArray(char * edge_array, VertexId input_vertices, EdgeId input_edges,  EdgeDirectionPolicy edge_direction_policy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+  - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+  - `input_vertices`：指定数组读入图的点个数。
+  - `input_edges`：指定数组读入图的边的条数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+### 7.3 锁机制
+
+TuGraph实现了一对锁机制，来控制程序对于点数据的访存权限。分别是：
+
+- `void AcquireVertexLock(size_t vid)`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(size_t vid)`：对点vid解锁，所有线程均可访存该锁对应的点数据
+- `VertexLockGuard GuardVertexLock(size_t vid)`：在对vid操作时，对点vid加锁，退出作用域时时自动释放锁
+
+### 7.4 批处理操作
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程。分别是：
+
+```c++
+/*
+    函数名称:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+    第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考include/lgraph/olap_base.h中具体代码
+
+    使用示例:统计数组parent数组中有出边的点个数
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+其中graph为图类OlapBase的实例化对象
+
+```C++
+/*
+    函数名称:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+    第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考/include/lgraph/olap_base.h中具体代码
+    
+    使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..1e94fb946e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,296 @@
+# OlapOnDB API
+
+> 此文档主要详细介绍了OlapOnDB API的使用说明
+
+
+## 1. 简介
+
+一般用户需要自己实现的只是将需要分析的子图抽取出来的过程。用户也可以通过使用TuGraph中丰富的辅助接口实现自己的图分析算法。
+
+该文档主要介绍Procedure及Embed的接口设计，并介绍部分常用接口，具体的接口信息参见include/lgraph/olap_on_db.h文件。
+
+## 2. 模型
+
+Procedure及Embed使用到的辅助函数主要包含在OlapOnDB类，还有一些使用频率较高的函数都会逐一介绍
+
+在TuGraph中OLAP相关的有以下常用的数据结构：
+
+1. DB图分析类 `OlapOnDB<EdgeData>`
+2. 点数组`ParallelVector<VertexData>`
+3. 点集合`ParallelBitset`
+4. 边数据结构`AdjUnit/AdjUnit<Empty>`
+5. 边集合数据结构`AdjList<EdgeData>`
+
+### 2.1 基于快照的存储结构
+
+TuGraph中的OlapOnDB类能够提供数据“快照”，即建立一个对指定数据集的完全可用拷贝，该拷贝包括相应数据在某个时间点（拷贝开始的时间点）的镜像。由于OLAP的操作仅涉及读操作而不涉及写操作，OlapOnDB会以一种更紧凑的方式对数据进行排布，在节省空间的同时，提高数据访问的局部性。
+
+### 2.2 BSP计算模型
+
+TuGraph在计算的过程中使用了BSP（Bulk Synchronous Parallel）模型，使得该过程能够并行执行，极大的提高了程序运行效率。
+
+BSP计算模型的核心思路为超步（Super Step）的提出和使用。在OlapOnDB创建后，在该数据上的计算分为多个超步，比如PageRank，分为多轮迭代，每轮迭代就是一个超步。不同超步之间用存在显式同步，从而保证所有线程在完成同一超步后同时进入下一个超步。在一个超步内部，所有的线程异步执行，利用并行提升计算效率。
+
+利用BSP计算模型能够有效避免死锁，通过障碍同步的方式能够以硬件方式实现粗粒度的全局同步，使得图计算能够并行化执行，而程序员无需在同步互斥上大费周章。
+
+## 3. 算法举例
+
+在这里对PageRank算法分块做解释，大体上分为主函数`Process`和PageRank算法流程`PageRank`函数
+
+### 3.1 主函数
+
+主函数输入有三个参数，`TuGraph`数据库参数`db`，从网页端获取的请求`request`，给网页端的返回值`response`，整体流程可以分为一下几步：
+
+1. 相关参数的获取
+2. 快照类的创建
+3. PageRank算法主流程
+4. 网页端返回值的获取和发送
+
+```C++
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+    
+    // 从网页端请求中获取迭代次数（num_iterations），
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // 读事务的创建以及快照类的创建
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+	
+    // 创建pr数组用于存储每个节点的pr值
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank算法主流程，获取每个节点的pagerank值
+    PageRankCore(olapondb, num_iterations, pr);
+    
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        函数用途：从所有节点中获取pagerank值最大的节点编号
+    
+        函数流程描述：该函数对点集合all_vertices中所有为1的位对应的节点vi（又称为活跃点）执行Func A，再将Func A的返回值作为Func B的第二个输入参数，得到局部最大值（因为第一个输入参数为0，因此实际上返回值就是每个节点的pagerank值），最后再将所有线程的返回值汇总，再次 执行Func B得到全局返回值，并存入max_pr_vi变量中
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+        
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+        
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+    
+    // 网页端返回值的获取和发送
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2 PageRank算法流程
+
+`pagerank`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关数据结构的初始化
+1. 每个节点pagerank值的初始化
+1. 每个节点pagerank值的计算，活跃点为所有点（意味着所有点都需要计算pagerank值）
+1. 得到每个节点经过`num_iterations`次迭代后的pagerank值
+
+```C++
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+    
+    // 相关数据结构的初始化
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // 每个节点pagerank值的初始化，和该节点的出度成反比
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // 总迭代过程
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            函数用途：计算所有节点的pagerank值
+
+            函数流程描述：该函数用于计算所有节点的pagerank值，对all_vertices中所有为1的位对应的节点vi执行Func C，得到本轮迭代中vi的pagerank值，并返回vi节点的pagerank变化值，最终经过函数内部处理汇总所有活跃节点的总变化值并返回，该值被存储在delta变量中
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // 从邻居中获取当前节点的pagerank值
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank值计算核心公式
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+    
+                    // 相关中间变量统计
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // 将本轮迭代得到的pagerank值输出作为下一轮迭代的输入
+        curr.Swap(next);
+    }
+}
+```
+
+## 4. 其他常用函数功能描述
+
+### 4.1 事务的创建
+
+```C++
+//读事务的创建
+auto txn = db.CreateReadTxn();
+
+//写事务的创建
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2 并行化创建有向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3 并行化创建无向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED
+)
+```
+
+### 4.4 获取出度
+
+```C++
+size_t OutDegree(size_t vid)
+```
+
+### 4.5 获取入度
+
+```C++
+size_t InDegree(size_t vid)
+```
+
+### 4.6 获取出边集合
+
+```C++
+/*
+    函数名称：AdjList<EdgeData> OutEdges(size_t vid)
+    数据结构:
+        AdjList 可以理解为类型为AdjUnit结构体的数组
+        AdjUnit 有两个成员变量： 1. size_t neighbour 2. edge_data，其中neighbour表示该出边指向的目标节点编号，如果为有权图，则edge_data数据类型和输入文件中边的权重值相同，否则数据类型为Empty
+
+    使用示例：输出节点vid的所有出度邻居
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7 获取入边集合
+
+```C++
+AdjList<EdgeData> InEdges(size_t vid)
+
+// 使用示例：输出节点vid的所有入度邻居
+for (auto & edge : olapondb.InEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8 获取TuGraph中节点对应OlapOnDB的节点编号
+
+```C++
+size_t OriginalVid(size_t vid)
+
+// 备注： TuGraph中输入的节点编号可以是非数字，比如人名等，在生成OlapOnDB子图的时候，会将人名等转化为数字进行后续处理，因此该方法可能不适用于某些特定场景
+```
+
+### 4.9 获取OlapOnDB中节点对应TuGraph的节点编号
+
+```C++
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10 活跃点的描述
+
+活跃点指的是在批处理函数中需要处理的点，在本例子中只是输出了活跃点的编号，并且汇总活跃点的数量：
+
+```C++
+ParallelBitset temp = 000111;	//当前活跃点为3，4，5号点
+
+size_t delta = ForEachActiveVertex<double>(
+    //void c
+    [&](size_t vi) {
+        printf("active_vertexId = %lu\n",vi);
+        return 1;
+    },
+    all_vertices
+);
+```
+
+函数的运行结果显而易见，因为多线程的关系，一下输出顺序可能有所变化：
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+局部返回值均为1，该函数会在保证线程安全的情况下将所有的局部返回值累加得到最终的返回值，并存储在`delta`变量中，该值最终为3
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..1ece4cc8e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,202 @@
+# OlapOnDisk API
+
+> 此文档主要详细介绍了OlapOnDisk API的使用说明
+
+    
+## 1. 简介
+
+TuGraph的Standalone模式可用于加载图数据文件，其中图数据文件来源可包含text文本文件、BINARY_FILE二进制文件和ODPS源。在该模式下，TuGraph可实现多数据来源快速加载成图，然后在该图上运行如BFS、WCC、SSSP等迭代式算法，并输出最终结果至终端。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph内置了大量的常见图分析算法和丰富的辅助接口，因此用户几乎不需要自己实现具体的图计算过程，只需要在实现自己的存储过程的时候将相应算法库的头文件(.h)包含到自己的程序中，并在编译阶段链接自己的动态库文件即可。
+
+该文档主要介绍了Standalone的常用接口，使用到的辅助函数主要包含在OlapOnDB类。同时为帮助用户理解方便，对BFS算法进行举例说明。
+
+## 2. 算法举例
+
+在这里对BFS算法分块做解释，大体上分为主函数`main`、BFS算法流程`BFSCore`函数和配置类MyConfig。
+
+### 2.1 头文件
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //使用 TuGraph 时需要包含的头文件
+#include "./algo.h"   //包含各种算法逻辑函数的头文件
+```
+
+在使用 TuGraph 实现图数据文件计算应用时，一般首先建立StandaloneGraph类对象graph，将图文件数据加载进graph中，之后通过调用图逻辑函数实现图计算过程，最后对图计算的结果进行打印输出。
+
+### 2.2 配置类MyConfig
+
+MyConfig配置类函数用于提供算法逻辑计算时所需的配置信息，继承于ConfigBase<EdgeData>,其中EdgeDate可根据加载图类型不同选择Empty（无权图）、int（带权图权重为整数）或者double（带权图权重为double）类型。
+
+MyConfig配置类一般根据算法不同，需要额外配置信息如下：
+
+1.算法所需参数
+2.算法名称
+3.配置类内Print函数
+其余公用成员继承与ConfigBase，可参考src/olap/olap_config.h查阅。
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // 算法所需参数初始化
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // 配置文件接受命令行参数，该用例会顺次读取命令行调用算法时的参数，优先使用用户指定数值，若用户并未指定则选择默认参数。
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+### 2.3 主函数
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // 统计内存消耗类MemUsage实例化
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // 配置类MyConfig实例化
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk类实例化
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // 统计图加载消耗时间
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // 创建数组用于统计某节点是否遍历过
+    auto parent = graph.AllocVertexArray<size_t>();
+    // 宽度优先搜索算法，返回图内root_vid根结点连接的节点个数
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // 打印相关信息至终端
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+### 2.4 bfs算法流程
+
+`bfs`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关定义、数据结构的初始化
+2. 使用批处理函数对每个节点进行循环计算，每一轮找到与当前节点相邻的全部节点，并在该轮次终止时进行交换。
+3. 直到找到全部节点，返回节点个数discovered_vertices。
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //分配数组，active_in用于存放上一循环阶段已找到的节点
+  active_in.Add(root);            //把跟节点加入数组中
+  auto active_out = graph.AllocVertexSubset();  //分配数组active_out用于存放当前循环阶段找到的节点
+  parent.Fill((size_t)-1);               //将parent数组中的节点赋值为-1，-1表示未被找到
+  parent[root] = root;
+  size_t num_activations = 1;       //表示当前循环阶段找到的节点个数
+  size_t discovered_vertices = 0;    //表示当前循环阶段找到节点的总个数
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations表示当前循环阶段找到的节点个数
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices表示当前循环阶段找到节点的总个数
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //每一次循环从根节点出发，查找邻近的相邻节点，对其parent值改变，并num_activations+1操作
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //存放当前循环阶段找到的节点
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // 返回全部节点数
+  return discovered_vertices;
+}
+```
+
+## 3. 其他常用函数功能描述
+
+### 3.1 图加载
+
+TuGraph-Standalone对于图数据文件的加载来源主要分为三大类：文本文件、二进制文件和ODPS。二进制文件为将边数据的二进制表示按顺序排列的文件，能够节省大量存储空间。其加载函数分为三种，分别是：
+
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：图数据文件的加载方式，包含两个参数，其含义分别表示：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。其中DUAL_DIRECTION为默认的图加载方式。
+  DUAL_DIRECTION : 输入文件为非对称图，加载图为非对称图。
+  MAKE_SYMMETRIC : 输入文件为非对称图，加载图为对称图。
+  INPUT_SYMMETRIC : 输入文件为对称图，加载图为对称图。
+  对应的详细介绍见lgraph文件夹下的olap_config.h文件的`enum EdgeDirectionPolicy`。
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：将文件中的点-数据对按照点id的顺序加载到数组中。各参数表示意义分别为：
+  - `array`：待读入数据的数组
+  - `path`：读取文件的路径，文件中每行表示一对点-数据对
+  - `parse_line`：用户自定义函数，告诉系统如何将一行文本数据解析为一个点-数据对。
+
+
+### 3.2 图写入
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：把array中数据写回文件中，各参数表示意义分别是：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `array`：待写入数据的数组
+  - `array_size`：待写入数据的数字长度
+  - `name`：算法名称
+  - `filter_output`：写入数据规则函数，待写入数据需要满足该函数的要求。
+
+### 3.3 图解析函数
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：对图数据文件进行解析，加载图为无权图。
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：对图数据文件进行解析，加载图为有权图，权重数据类型可以通过修改<EdgeData>指定。
+
+该函数可通过MyConfig类定义时的构造函数parse_line进行指定。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..0498446303
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,404 @@
+# Python Olap API
+
+> 本文档主要介绍 OlapBase OlapOnDB 和 OlapOnDisk 在Python中的API用法
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统Python接口需要的简单配置，同时结合代码对TuGraph Python API进行解释。关于ParallelBitset、OlapBase各类的作用，详见olap-base-api.md，olap-on-db-api.md和olap-on-disk-api.md
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+- Cython，版本要求3.0.0以上，已测试可运行版本为3.0.0a11
+
+## 3. Cython
+Cython是一种高效的编程语言，是Python的超集。Cython能将py文件翻译为C/C++代码后编译为Python拓展类，在Python中通过import调用。在TuGraph中，所有的Python plugin都由Cython编译为Python拓展类后使用。
+
+Cython的Pure Python模式在保证Python语法的同时具有C/C++的性能，TuGraph Python接口均使用Cython实现。
+
+[Cython 文档](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+见procedures/algo_cython/olap_base.pxd文件，用法与功能基本与C++接口相同，olap_base.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### 原子操作
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `write_min[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_max[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_add[T](a: cython.pointer(T), b: T)-> cython.bint`：将b的值加到a指向的值上。
+- `write_sub[T](a: cython.pointer(T), b: T)-> cython.bint`：将a指向的值减去b的值。
+
+### 点集合类ParallelBitset
+- `Size()-> size_t`：表示Bitmap中的点个数。
+- `ParallelBitset(size: size_t)`：初始化size和data，data长度为(size >> 6)+1
+- `Clear()-> cython.void`：清空集合
+- `Fill()-> cython.void`：将所有点加入集合
+- `Has(size_t i)-> cython.bint`：检查点i是否在集合中
+- `Add(size_t i)-> cython.bint`：将点i加入集合中
+- `Swap(ParallelBitset &other)-> cython.void`：和另一组ParallelBitset集合交换元素
+
+### 点数组类ParallelVector
+- `ParallelVector[T](size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `operator[](i: size_t)-> T`：下标为i的数据
+- `begin()-> cython.pointer(T)`：ParallelVector的起始指针
+- `end()-> cython.pointer(T)`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `Back()-> T`：ParallelVector最后一个数据
+- `Data()-> cython.pointer(T)`：表示数组本身数据
+- `Destroy()-> cython.void`：清空ParallelVector数组内数据并删除数组
+- `Size()-> size_t`：表示ParallelVector中的数据个数
+- `Resize(size: size_t)-> cython.void`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `Clear()-> cython.void`：清空ParallelVector内数据
+- `ReAlloc(capacity: size_t)-> cython.void`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `Fill(elem: T)-> cython.void`：为ParallelVector的全部数据赋值为elem
+- `Append(elem: T, atomic: cython.bint = true)-> cython.void`：向ParallelVector结尾添加一个数据
+- `Swap(other: ParallelVector[T])-> cython.void`：和其他的ParallelVector交换数据
+- `Copy()-> ParallelVector[T]`：复制当前的ParallelVector数据存至Copy数组中
+
+### 自定义数据结构
+- `Empty`：内容为空的特殊数据类型。
+- `EdgeUnit[EdgeData]`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+    - `src: size_t`：边的起始点
+    - `dst: size_t`：边的终点
+    - `edge_data: EdgeData`：边的权值
+- `AdjUnit[EdgeData]`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+    - `neighbour: size_t`：边的邻居点
+    - `edge_data: EdgeData`：边的权值
+- `AdjList[EdgeData]`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+    - `begin()-> cython.pointer(AdjUnit[T])`：列表的起始指针
+    - `end()-> cython.pointer(AdjUnit[T])`：列表的结束指针。
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: 下标为i的数据
+
+### 图类OlapBase
+- `NumVertices()-> size_t`：获取点数
+- `NumEdges()-> size_t`：获取边数
+- `OutDegree(size_t vid)-> size_t`：点vid的出度
+- `InDegree(size_t vid)-> size_t`：点vid的入度
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`：分配一个类型为VertexData的数组，大小为点个数
+- `AllocVertexSubset()-> ParallelBitset`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有出边集合
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有入边集合
+- `Transpose()-> cython.void`：对有向图进行图反转
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+    - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+    - `input_vertices`：指定数组读入图的点个数。
+    - `input_edges`：指定数组读入图的边的条数。
+    - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`：对点vid解锁，所有线程均可访存该锁对应的点数据
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程，在Python中与C++使用方法稍有不同。
+
+```python
+# 函数名称:ProcessVertexInRange[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           lower: size_t, upper: size_t,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#     函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+#     第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#     具体实现请参考include/lgraph/olap_base.h中具体代码
+#
+#     使用示例:统计数组parent数组中有出边的点个数
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython. pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython. pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+其中g为图类OlapBase的实例化对象
+
+```python
+# 函数名称:ProcessVertexActive[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           active: ParallelBitset,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#   函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+#   第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#   具体实现请参考/include/lgraph/olap_base.h中具体代码
+#
+# 使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self.graph.OutDegree(vi)
+        dst: size_t
+        edges = self.graph.OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbour
+            printf("node %lu has neighbour %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+如上面两个例子所展示，在Python中ProcessVertexActive与ProcessVertexInRange比在C++中额外需要一个算法类指针参数，Work函数一般也作为该算法类的成员函数，满足Work函数访问成员变量的需求（如图graph，点数组parent），在调用批处理函数时将Work函数和算法类的self指针传入批处理函数。
+
+其中Work函数会在多线程中调用，因此加上修饰器`@cython.nogil`释放Python全局解释锁，在多线程执行的代码中（例如批处理函数中的Work函数，`cython.parallel.prange`中），不能包含Python对象，最好通过`dst: type`或者`dst = cython.declare(type)`的方式声明变量为C/C++类型。
+
+### 图类OlapOnDB:
+并行化创建有向图：
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+并行化创建无向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING创建有向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### 图类OlapOnDisk
+
+#### ConfigBase：
+- `ConfigBase()`: 构造函数
+- `std::string input_dir`: 图边表数据路径
+- `std::string output_dir`: 输出结果路径
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: 读入图数据
+
+
+## 5. lgraph_db API
+见procedures/algo_cython/lgraph_db.pxd与lgraph_db_python.py文件。
+
+lgraph_db.pxd中接口用法与功能基本与C++接口相同，lgraph_db.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: 获取点的vid
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: 设置用户
+- `SetUser(user: std::string)-> cython.void`: 设置用户
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: 创建GraphDB
+
+### GraphDB：
+- `CreateReadTxn()-> Transaction`: 创建只读事务
+- `CreateWriteTxn()-> Transaction`: 创建写事务
+- `ForkTxn(txn: Transaction)-> Transaction`: 复制事务，只能复制读事务
+
+### Transaction：
+```
+GetVertexIndexIterator(
+                label: std::string,
+                field: std::string,
+                key_start: std::string,
+                key_end: std::string)-> VertexIndexIterator
+```
+获取索引迭代器。迭代器的field值为 [key_start, key_end]。所以在key_start=key_end=v时，返回指向field值为v的点的迭代器
+
+lgraph_db_python.py是lgraph_db.pxd中C++类 Galaxy与GraphDB的包装，将C++类包装为Python类，将lgraph_db_python.py编译为Python拓展后，可以直接在Python文件或Python命令行中`import lgraph_db_python`访问lgraph_db_python.PyGraphDB与PyGraphDB.PyGalaxy。
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(self, user: str password: str)-> void`: 设置用户
+- `SetUser(self, user: std::string)-> void`: 设置用户
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: 创建PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)-> cython.Py_ssize_t`: C++ 类GraphDB的地址
+
+## 6. 算法插件示例
+下面为Python实现的BFS算法的代码示例：
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# 注释作用如下：
+# language_level=3: 使用Python3
+# cpp_locals=True: 需要c++17，使用std::optional管理Python代码中的C++对象，可以避免C++对象的拷贝构造
+# boundscheck=False: 关闭索引的边界检查
+# wraparound=False: 关闭负数下标的处理（类似Python List）
+# initializedcheck=False: 关闭检查内存是否初始化，关闭检查后运行性能更快
+# language = c++: 将此py文件翻译为C++而不是C文件，TuGraph使用大量模板函数，所以都应该使用C++
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# 从procedures/algo_cython/ 中cimportolap_base.pxd与lgraph_db.pxd, 类似C++中#include "xxx.h"
+
+from cython.cimports.libc.stdio import printf
+# 类似C++中#include <stdio.h>
+# 其他常见的还有cython.cimports.libcpp.unordered_map等
+
+import time
+
+
+@cython.cclass
+# cython.cclass 表示BFSCore为C类型的Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty])表示OlapBase[Empty]的指针，类似C++中OlapBase[Empty]*
+    # cython提供了常见类型的指针，如cython.p_int, cython.p_char等，表示int*, char*, ...
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t 声明root为C++ size_t类型变量，等效于root = cython.declare(size_t)
+    # 不声明类型的变量为Python object类型
+    # 声明变量类型会大幅提高性能，同时在多线程部分，只有C/C++类型的变量可以访问
+
+    @cython.cfunc
+    # cython.cfunc 表示Work为C类型的函数，参数与返回值应声明
+    # cfunc性能好，能接受C/C++对象为参数、返回值，但是不能在其他python文件中调用
+    # 类似的有cython.ccall，如Standalone函数，可以在其他python文件中调用
+    @cython.nogil
+    # cython.nogil 表示释放Python全局解释锁，在nogil修饰的部分，不能访问Python对象
+    # 在多线程部分，都应有nogil修饰器
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) 表示禁用异常传播，将忽略函数内部引发的Python异常
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbour
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 表示dst没有被bfs访问过
+                if self.active_out.Add(dst):
+                    # 将dst设置为为活跃节点；ParallelBitmap.Add为原子操作，防止重复计算
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython.size_t:
+        self.graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self.parent.Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self.active_in.Add(self.root)
+        while num_activations > 0:
+            self.active_out.Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self.active_out.Swap(self.active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time.time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # 并行创建OlapOnDB
+    # Cython不支持如 *db 的解引用操作，通过db[0]来解引用
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # 通过 GetVertexIndexIterator 根据root节点label名和filed名与filed值（root_id）
+    # 获取root节点的迭代器，通过迭代器获取vid，在无ID_MAPPING时，该vid与OlapOnDB中的id相同
+    cost = time.time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time.time()
+    count = a.run(cython.address(olapondb), root_vid)
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb.NumVertices()
+    response["num_edges"] = olapondb.NumEdges()
+    return True
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process为embed模式和procedure模式下插件入口，用cython.ccall修饰
+    # Process函数必须名为Process，参数为lgraph_db_python.PyGraphDB与bytes
+    # 返回值必须为(bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # 获取PyGraphDB中GraphDB对象的地址，转换为指针后传递
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..7bf7f3ebf1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,189 @@
+# 内置算法
+
+> 此文档主要详细介绍了TuGraph内置的算法程序，社区版6种算法可参考基础算法报
+
+## 简介
+
+TuGraph目前包含以下6个基础算法28种扩展算法，共34个图算法：
+
+### 基础算法包：
+| 中文算法名 | 英文算法名 | 程序名
+|  :----:  | :----: | :----: |
+| 广度优先搜索 | Breadth-First Search  | bfs 
+| 网页排序 | Pagerank | pagerank 
+| 单源最短路径 | Single-Source Shortest Path | sssp 
+| 弱连通分量 | Weakly Connected Components | wcc 
+| 平均集聚系数 | Local Clustering Coefficient  | lcc
+| 标签传播 | Label Propagation Algorithm | lpa 
+
+### 扩展算法包：
+| 中文算法名 | 英文算法名 | 程序名
+| :----: | :----: | :----: |
+| 全对最短路径 | All-Pair Shortest Path  | apsp 
+| 介数中心度 | Betweenness Centrality | bc 
+| 置信度传播 | Belief Propagation | bp
+| 距离中心度 | Closeness Centrality | clce
+| 共同邻居 | Common Neighborhood | cn 
+| 度数关联度 | Degree Correlation  | dc
+| 直径估计 | Dimension Estimation | de 
+| EgoNet算法 | EgoNet | en
+| 超链接主题搜索 | Hyperlink-Induced Topic Search | hits
+| 杰卡德系数 | Jaccard Index | ji
+| K核算法 | K-core | kcore
+| 鲁汶社区发现 | Louvain | louvain 
+| 多源最短路径 | Multiple-source Shortest Paths | mssp
+| 个性化网页排序 | Personalized PageRank | ppr
+| 强连通分量 | Strongly Connected Components | scc 
+| 监听标签传播 | Speaker-listener Label Propagation Algorithm | slpa
+| 两点间最短路径 | Single-Pair Shortest Path | spsp
+| 三角计数 | Triangle Counting | triangle 
+| 信任指数排名 | Trustrank | trustrank 
+| 带权重的标签传播 | Weighted Label Propagation Algorithm | wlpa 
+| 带权重的网页排序 | Weighted Pagerank Algorithm | wpagerank 
+| 最大独立集算法 | Maximal independent set | mis 
+| sybil检测算法 | Sybil Rank | sybilrank 
+| 子图匹配算法 | Subgraph Isomorphism | subgraph_isomorphism
+| 模式匹配算法 | Motif | motif
+| k阶团计数算法 | Kcliques | kcliques
+| k阶桁架计数算法 | Ktruss | ktruss 
+| 莱顿算法 | Leiden | leiden
+
+## 基础算法包
+
+### 广度优先搜索
+
+广度优先搜索实现了Breadth-first Search算法，从根点开始，沿着图的宽度遍历所有可访问点。返回结果为遍历点个数。算法内容请参考 [https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 网页排序
+
+网页排序程序实现了常用的Pagerank算法。该算法根据图中边和边权值计算所有点的重要性排名，PageRank值越高，表示该点在图中的重要性越高。计算时以点数量的倒数为各点初始Rank值，然后将点的Rank值按照出边平均传递到相邻点，重复该传递过程直到满足给定的收敛阈值或达到给定迭代轮数。每轮传递结束后，所有点的Rank值会有一定的的比例随机传递到任意点上。算法内容请参考 [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 单源最短路径
+
+单源最短路径实现了Single Source Shortest Path算法，根据给定的源点，计算从该源点出发到其他任意点的最短路径长度。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 弱连通分量
+
+弱连通分量程序实现了Weakly Connected Components算法，该算法会计算图中所有的弱连通分量。弱连通分量是图的一个子图，子图中任意两点之间均存在可达路径。算法内容请参考[https://en.wikipedia.org/wiki/Connected_component_(graph_theory)](https://en.wikipedia.org/wiki/Connected_component_(graph_theory) "scc wiki")。
+
+### 平均集聚系数
+
+平均集聚系数程序实现了Local Clustering Coefficient算法，计算图中点之间聚集程度的系数。返回结果包括整体集聚系数和点集聚系数。整体集聚系数反映了图中整体的集聚程度的评估，点集聚系数包括任意点的集聚系数，反映了该点附近的集聚程度。集聚系数越高，表示集聚程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 标签传播
+
+标签传播算法程序实现了Label Propagation Algorithm算法。该算法是基于标签传播的社区发现算法，计算对象为无权图。在标签传递时，每个点对收到的所有标签进行次数累加，在累加和最高的标签中随机选择一个。迭代收敛或执行到给定轮数后算法终止。最终输出结果为每个点的标签，标签值相同的点视为在同一社区。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+
+## 扩展算法包
+
+### 全对最短路径
+
+全对最短路径程序实现了All-Pair Shortest Path算法，计算图中任意两点间的最短路径。返回结果为任意存在路径的点对之间的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 介数中心度
+
+介数中心度程序实现了Betweenness Centrality算法，估算图中所有点的介数中心度值。介数中心度值反映了图中任一最短路径经过该点的可能性，值越高表示有越多的最短路径经过了该点。计算时需给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 置信度传播
+
+置信度传播程序实现了Belief Propagation算法。该算法给定已观测点的边缘分布，利用点之间相互传递消息的机制来估算未观测点的边缘分布。算法内容请参考[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 距离中心度
+
+距离中心度程序实现了Closeness Centrality算法，估算任意点到图中其他点的最短路径的平均长度。距离中心度越小，表示该点到其他点的平均最短距离最小，意味着该点从几何角度看更位于图的中心位置。计算时需要给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki")。
+
+### 共同邻居
+
+共同邻居程序实现了Common Neighborhood算法，计算任意给定相邻点对之间的共同邻居数量。计算时给定待查询的若干个点对，返回结果为待查询的任意点对的共同邻居数量。
+
+### 度数关联度
+
+度数关联度程序实现了Degree Correlation算法，通过计算任意相邻点对之间的Pearson关联系数来计算图的度数关联度，可用来表征图中高度数点之间关联程度。度数关联度越高，表示图中高度数点之间的关联程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 直径估计
+
+直径估计程序实现了Dimension Estimation算法。该算法会计算图中最长的最短路径长度，用来表征图的直径大小。算法内容请参考[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### EgoNet算法
+
+EgoNet算法需要给定根点和K值，以根点为源点进行宽度优先搜索，找出所有K度以内的邻居组成的子图。找到的子图称为根点的EgoNet。
+
+### 超链接主题搜索
+
+超链接主题搜索算法实现了Hyperlink-Induced Topic Search算法，该算法假定每个点具有权威性Authority和枢纽性Hub两个属性，一个好的枢纽点应该指向许多高权威性的点，而一个良好的权威点应该被许多高枢纽型的点指向。算法将返回每个点的权威性值和枢纽性值。算法内容请参考[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 杰卡德系数
+
+杰卡德系数程序实现了Jaccard Index算法。该算法计算了给定点对之间的Jaccard系数，可用来表示这两个点的相似度。Jaccard系数越高，表示点对之间的相似程度越高。计算时给定带查询的若干点对，返回结果为这些点对的Jaccard系数。算法内容请参考[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### k核算法
+
+k核算法实现了k-core算法。该算法计算所有点的核数，或找出图中所有的K核子图。K核子图是一种特殊子图，子图中任意点度数都不小于给定K值。算法内容请参考 [https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)](https://en.wikipedia.org/wiki/Degeneracy_(graph_theory) "kcore wiki")。
+
+### 鲁汶社区发现
+
+鲁汶社区发现程序实现了Fast-unfolding算法。该算法是基于模块度的社区发现算法，通过不断合并点社区来最大化图的模块度，能够发现层次性的社区结构。算法内容请参考 [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 多源最短路径
+
+多源最短路径程序实现了Multiple-source Shortest Paths算法，根据给定的多个源点，从这些源点出发，计算到达任意点的最短路径值。其中，多个源点到某一点的最短路径值为分别从每个源点出发到达该点的最短路径的最小值。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 个性化网页排序
+
+个性化网页排序程序实现了Personalized PageRank算法。该算法根据给定的源点，基于该源点个性化计算所有点对于源点的重要性排名。Rank值越高，表示该点对于源点越重要。与PageRank不同的是，初始化时源点Rank值为1，其余点Rank值为0；并且每轮传递结束后，Rank值会有一定的比例随即传递回源点。算法内容请参考 [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 强连通分量
+
+强连通分量程序实现了Strongly Connected Components算法。该算法计算了图中所有的强连通分量，强连通分量是图的一个子图，子图中可从任意点出发到达其他任意点。算法内容请参考[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 监听标签传播
+
+监听标签传播算法程序实现了Speaker-listener Label Propagation Algorithm算法。该算法是基于标签传播和历史标签记录的社区发现算法，是对标签传播算法的扩展。与标签传播算法不同的是，本算法会对所有点记录其历史标签，在迭代中对标签进行累加时，会将历史标签也计算在内。最终输出结果为每个点的所有历史标签记录。算法内容请参考论文：“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 两点间最短路径
+
+两点间最短路径程序实现了Bidirectional Breadth-First Search算法，在有向无权图上从起点沿着出边做正向宽度优先搜搜，从终点沿着入边做反向宽度优先搜索，通过起点和终点共同遍历到的点来确定从起点到终点的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 三角计数
+
+三角计数实现了Triangle-counting算法，计算无向图中的三角形个数，可用来表征图中点的关联程度。三角形数越多，表示图中点的关联程度越高。算法内容请参考论文：“Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study” 。
+
+### 信任指数排名
+
+信任指数排名算法实现了Trustrank算法，可以根据给定的白名单，计算任意点的信任指数。信任指数越高，表示该点为非法点的可能性越小。算法内容请参考 [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 带权重的标签传播
+
+带权重的标签传播算法程序实现了Weighted Label Propagation Algorithm算法。=与标签传播算法不同的是，标签的传递跟边的权重相关，在标签传递时，每个点会根据标签的入边进行权重累加，在累加和最高的标签中随机选择一个。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 带权重的网页排序
+
+带权重的网页排序算法程序实现了Weighted Pagerank算法。与PageRank算法不同的是，Rank值的传递跟边的权重有关，点的Rank值将按照边权重加权传递到相邻点。算法内容请参考[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 最大独立集算法
+
+最大独立集算法实现了Maximal independent set算法。最大独立集是指在这个独立集之外没有可以加入它的点。一个图可能有许多大小差异很大的 MIS，算法找出其中一个。算法内容请参考 [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### Sybil检测算法
+
+Sybil检测算法实现了Sybil Rank算法。SybilRank算法从非Sybil节点开始进行提前终止的随机游走。算法内容请参考论文：“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 子图匹配算法
+
+子图匹配算法实现了subgraph_isomorphism算法。subgraph_isomorphism算法对全图所有节点匹配子图，最后输出每个节点被匹配的次数。算法内容参考 [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 模式匹配算法
+
+模式匹配算法实现了motif算法。motif算法对指定的节点匹配k阶子图，最后输出每个指定节点每种k阶子图个数，每个k阶子图用一个64位整数表示，整数的第$i \times k + j$位为1表示子图中有边i->j。算法内容参考 [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### k阶团计数算法
+
+k阶团计数算法实现了k-cliques算法。k-cliques算法对计算图中所有的k阶完全子图的个数，最后输出每个节点所在的k阶完全子图个数。算法内容参考 [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### k阶桁架计数算法
+
+k阶桁架计数算法实现了k-truss算法。k-truss指每条边都至少是k-2个三角形的边的子图。k-truss算法找出图的k-truss子图，最后输出每个节点在子图中的邻居节点列表。算法内容参考 [https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+### 莱顿算法
+
+莱顿算法实现了了leiden算法。leiden算法是基于模块度的社区发现算法，与louvain算法优势在于leiden算法检测出社区中的断链，保证每个社区具有良好的连通性。算法内容参考 [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..bc80c68c65
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+分析接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..46813c7cca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,83 @@
+# Learn Tutorial
+
+> 本文档是为 TuGraph 的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对 TuGraph 的图学习运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于 Tugraph 的一个简单的程序实例，我们将重点介绍其使用方式。
+
+## 1.TuGraph 图学习模块简介
+图学习是一种机器学习方法，其核心思想是利用图结构中的拓扑信息，通过顶点之间的联系及规律来进行数据分析和建模。不同于传统机器学习方法，图学习利用的数据形式为图结构，其中顶点表示数据中的实体，而边则表示实体之间的关系。通过对这些顶点和边进行特征提取和模式挖掘，可以揭示出数据中深层次的关联和规律，从而用于各种实际应用中。
+
+这个模块是一个基于图数据库的图学习模块，主要提供了四种采样算子：Neighbor Sampling、Edge Sampling、Random Walk Sampling 和 Negative Sampling。这些算子可以用于对图中的顶点和边进行采样，从而生成训练数据。采样过程是在并行计算环境下完成的，具有高效性和可扩展性。
+
+在采样后，我们可以使用得到的训练数据来训练一个模型。该模型可以用于各种图学习任务，比如预测、分类等。通过训练，模型可以学习到图中的顶点和边之间的关系，从而能够对新的顶点和边进行预测和分类。在实际应用中，这个模块可以被用来处理各种大规模的图数据，比如社交网络、推荐系统、生物信息学等。
+
+## 2. 运行流程
+TuGraph 图学习模块将TuGraph中的图数据采样，采样后的顶点和边作为图学习的特征，进行学习训练。运行流程如下图所示：
+![Alt text](../../../../images/learn_flow_chart_zh.png)
+
+## 3.TuGraph编译及数据准备
+TuGraph编译请参考：[编译](../../5.installation&running/6.compile.md)
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+## 4. 数据导入
+数据导入请参考[数据导入](../../6.utility-tools/1.data-import.md)
+
+导入过程以cora数据集为例：
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+## 5. feature特征转换
+由于图学习中的feature特征一般表示为较长的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+## 6. 采样算子及编译
+TuGraph在cython层实现了一种获取全图数据的算子及4种采样算子，具体如下：
+### 6.1.采样算子介绍
+| 采样算子 | 采样方式 |
+| --- | --- |
+| GetDB | 从数据库中获取图数据并转换成所需数据结构 |
+| Neighbor Sampling | 根据给定的顶点采样其邻居顶点，得到采样子图 |
+| Edge Sampling | 根据采样率采样图中的边，得到采样子图 |
+| Random Walk Sampling | 根据给定的顶点，进行随机游走，得到采样子图 |
+| Negative Sampling | 生成不存在边的子图。 |
+
+### 6.2.编译
+如果TuGraph已编译，可跳过此步骤。
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+得到算子so后，在Python中import 即可使用。
+
+## 7. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+## 8. 模型加载
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+在使用保存的模型之前，首先需要对其进行加载。代码中，使用如上的代码对已训练模型进行加载。
+
+加载之后，我们可以使用模型对新的顶点和边进行预测和分类。在预测时，我们可以输入一个或多个顶点，模型将输出相应的预测结果。在分类时，我们可以将整个图作为输入，模型将对图中的顶点和边进行分类，以实现任务的目标。
+使用已训练的模型可以避免重新训练模型的时间和资源消耗。此外，由于模型已经学习到了图数据中顶点和边之间的关系，它可以很好地适应新的数据，从而提高预测和分类的准确度。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..2a1c0ac8d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,97 @@
+# Sampling API
+
+> 此文档主要详细介绍了Sampling API的使用说明
+
+## 1. 概述
+
+本手册介绍使用TuGraph的Sampling API接口。
+
+## 2. 图数据预处理
+在采样操作之前，根据图数据路径加载图数据，并映射成olapondb图分析类，代码如下：
+
+```python
+galaxy = PyGalaxy(args.db_path) # 根据路径创建一个galaxy实例
+galaxy.SetCurrentUser(args.username, args.password) # 设置当前用户
+db = galaxy.OpenGraph('default', False) # 打开图数据库指定db
+txn = db.CreateReadTxn() # 创建一个事务实例
+olapondb = PyOlapOnDB('Empty', db, txn) # 根据图加载方式、图数据库实例、事务实例实例化OlapOnDB
+del txn
+del db
+del galaxy
+```
+## 3. 图采样算子介绍
+图采样算子在cython层实现，用于对输入的图进行采样处理，生成的NodeInfo用于保存feature属性、label属性等点信息，EdgeInfo用于保存边信息，这些元数据信息可以被用于特征抽取、网络嵌入等任务中。目前TuGraph图学习模块支持GetDB、NeighborSampling、EdgeSampling、RandomWalkSampling、NegativeSampling五种采样算子。
+### 3.1.RandomWalk算子：
+在给定的采样点周围进行指定次数的随机游走，得到采样子图。
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+step: size_t类型，采样步数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.2.NeighborSample算子：
+在给定采样点的一度邻居中采样一定数量的点，得到采样子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+nei_num: size_t类型，邻居采样点数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.3.Nagetive算子：
+采用负采样算法，生成不存在边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+num_samples: size_t类型，生成不存在边的数量。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值： 无。
+
+### 3.4.EdgeSampling算子：
+根据边采样率，生成采样边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list,EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_rate: double类型，采样率。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.5.GetDB算子：
+从数据库中获取图数据并转换成所需数据结构。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+## 4. 用户自定义采样算法
+用户也可以通过TuGraph Olap接口实现自定义采样算法，接口文档参见[此处](../2.olap/5.python-api.md)，该文档主要介绍图采样算法使用的相关函数的接口设计。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..c8dd5e8e1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,101 @@
+# Training
+
+> 本文档详细介绍了如何使用TuGraph进行图神经网络（GNN）的训练。
+
+## 1. 训练
+使用TuGraph 图学习模块进行训练时，可以分为全图训练和mini-batch训练。
+全图训练即把全图从TuGraph db加载到内存中，再进行GNN的训练。而mini-batch训练则使用上面提到的TuGraph 图学习模块的采样算子，将全图数据进行采样后，再送入训练框架中进行训练。
+## 2. Mini-Batch训练
+Mini-Batch训练需要使用TuGraph 图学习模块的采样算子，目前支持Neighbor Sampling、Edge Sampling、Random Walk Sampling和Negative Sampling。
+TuGraph 图学习模块的采样算子进行采样后的结果以List的形式返回。
+下面以Neighbor Sampling为例，介绍如何将采样后的结果，进行格式转换，送入到训练框架中进行训练。
+用户需要提供一个Sample类：
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. 加载图数据
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+
+        # 2. 采样方法，结果存储在NodeInfo和EdgeInfo中
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+
+        # 3. 对结果进行格式转换，使之符合训练格式
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+如代码所示，首先将图数据加载到内存中。然后使用采样算子对图数据进行采样，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+最后对结果进行格式转换，使之符合训练格式。这里我们使用的是DGL训练框架，因此使用结果数据构造了DGL Graph，最终将DGL Graph返回。
+我们提供TuGraphSample类之后，就可以使用它进行Mini-Batch训练了。
+令DGL的数据加载部分使用TuGraphSample的实例sampler：
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+使用DGL进行模型训练：
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+
+## 3. 全图训练
+GNN（图神经网络）的全图训练是一种涉及一次处理整个训练数据集的训练。它是 GNN 最简单、最直接的训练方法之一，整个图被视为单个实例。 在全图训练中，整个数据集被加载到内存中，模型在整个图上进行训练。这种类型的训练对于中小型图特别有用，并且主要用于不随时间变化的静态图。
+在算子调用时，使用以下方式：
+```python
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+获取全图数据，然后将全图送入训练框架中进行训练。
+完整代码：请参考learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..b5c8888189
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,102 @@
+# Heterogeneous Graph
+
+> 本文档介绍如何使用异质图进行训练。
+
+## 1. 异质图简介
+异质图（Heterogeneous Graph）是指由不同类型的节点和边构成的图结构。在异质图中，节点和边可以具有多样化的属性和关系，代表了不同实体以及它们之间的复杂关联。
+
+在异质图中，节点类型可以代表不同的实体，如用户、商品、话题等，而边类型表示不同实体之间的关系，如用户之间的关注关系、用户与商品之间的购买关系等。节点和边可以具有不同的属性。
+
+异质图提供了一种强大的图模型，能够更好地表达和分析具有多种类型实体和复杂关系的现实世界系统。在不同领域的数据分析和应用中，异质图具有广泛的应用前景和研究价值。
+
+## 2. 异质图创建
+在TuGraph中，一个异构图由一系列边关系构成。每个关系由一个字符串三元组定义 (源节点类型, 边类型, 目标节点类型) 。异质图的创建方式与同质图类似，只是在创建图时需要指定字符串三元组定义。如下所示。
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+其中，第四个参数为异质图的边关系定义，可以通过该参数，指定筛选的异质图点边类型。如果不指定该参数，则默认将全部点边类型的数据进行构图训练。
+
+## 3. 异质图查询接口
+为了方便用户使用，当用户给定第四个参数时，TuGraph提供了查询异质图点边类型的接口。示例如下所示：
+
+### 3.1 点类型查询接口
+```python
+olapondb.ntypes()
+```
+返回值为点类型列表，如['node1', 'node2', 'node3']。
+
+### 3.2 边类型查询接口
+```python
+olapondb.etypes()
+```
+返回值为边类型列表，如['edge1', 'edge2', 'edge3']。
+
+### 3.3 点类型和边类型查询接口
+```python
+olapondb.metagraph()
+```
+返回值为字符串三元组定义 (源节点类型, 边类型, 目标节点类型)，如
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')]。
+
+## 4. 异质图输出格式
+和同质图相同的是，异质图的采样数据结果也存储在NodeInfo和EdgeInfo中。
+可通过如下方式获取输出数据。
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+其中getdb为获取全图数据的函数，db为图数据库实例，olapondb为图分析类。feature_len为节点特征长度，NodeInfo和EdgeInfo为输出的节点和边信息。
+
+其存储信息结果如下：
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 边类型 | EdgeInfo[2] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+| 顶点类型 | NodeInfo[3] |
+
+## 5. 异质图训练
+异构图训练的目标是学习图中节点和边的表示，以便于进行后续的任务，如节点分类、链接预测、图聚类等。为了实现这一目标，研究者们提出了多种基于图神经网络（Graph Neural Networks，GNNs）的模型。这些模型通过聚合邻居节点的信息来更新节点的表示，进而捕捉图结构中的复杂关系。
+
+由于异构图中包含多种类型的节点和边，因此在设计GNN模型时需要考虑如何处理这些不同类型的信息。一种常见的方法是设计不同的聚合函数来分别处理不同类型的邻居节点。此外，还需要考虑如何将这些不同类型的信息整合到一起，以便于模型能够有效地学习到节点和边的表示。
+
+TuGraph 提供了使用裁剪版ogbn-mag数据集进行异质图训练的方法，可供使用者参考。
+
+TuGraph提供的官方docker中暂未提供异质图训练的环境，因此需要用户自行安装相关依赖包。
+在训练之前需要下载ogb和pandas包，具体安装方式如下：
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+训练代码如下所示：
+
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+全部训练代码可参考tugraph/learn/examples/train_full_mag.py文件。
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..e79e36ea91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+图学习
+======
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..d4c9759490
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+存储过程和分析接口
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/conf.py b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/conf.py
new file mode 100644
index 0000000000..34515a01b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/development_guide.md b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/development_guide.md
new file mode 100644
index 0000000000..147eff456f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/development_guide.md
@@ -0,0 +1,289 @@
+# 业务开发指南
+## 连接tugraph-db
+### 驱动连接
+tugraph-db兼容neo4j的通讯协议，因此可以使用neo4j的驱动连接tugraph-db的server。
+
+[bolt driver 使用介绍](./7.client-tools/5.bolt-client.md)
+
+[bolt driver 使用例子](https://github.com/TuGraph-family/tugraph-db/tree/master/demo/Bolt)
+
+### 终端连接
+驱动是业务代码里面使用的，对于服务器上终端访问，可以使用cli客户端。
+
+[console client 使用介绍](./7.client-tools/6.bolt-console-client.md)
+
+## 子图操作
+### 创建子图
+```
+CALL dbms.graph.createGraph('graph1')
+```
+### 删除子图
+```
+CALL dbms.graph.deleteGraph('graph1')
+```
+### 清空子图
+#### 删除所有的点边数据和图schema
+```
+CALL db.dropDB()
+```
+#### 只删除所有点边数据, 保留图schema
+```
+CALL db.dropAllVertex()
+```
+### 查看图schema
+```
+CALL dbms.graph.getGraphSchema()
+```
+### 列出所有子图
+```
+CALL dbms.graph.listGraphs()
+```
+
+### 刷新子图文件系统缓存数据
+```
+db.flushDB()
+```
+
+## 点类型操作
+### 创建点类型
+如下json定义了一个点类型，名字是`node1`。
+```json
+{
+	"label": "node1",
+	"primary": "id",
+	"type": "VERTEX",
+	"detach_property": true,
+	"properties": [{
+		"name": "id",
+		"type": "INT32",
+		"optional": false
+	}, {
+		"name": "name",
+		"type": "STRING",
+		"optional": false,
+		"index": true
+	}, {
+		"name": "num",
+		"type": "INT32",
+		"optional": false,
+		"index": true,
+		"unique": true
+	}, {
+		"name": "desc",
+		"type": "STRING",
+		"optional": true
+	}]
+}
+
+```
+把上面这个json序列化成字符串，作为参数传入，建议使用驱动的参数化特性，避免自己拼接语句。
+```
+CALL db.createVertexLabelByJson($json_data)
+```
+
+### 查看点类型schema
+```
+CALL db.getVertexSchema('node1')
+```
+
+### 删除点类型
+>该操作会同步删除所有该类型的点数据，数据量大的时候，有时间消耗。
+
+如下例子删除点类型`node1`以及该类型的所有点数据。
+```
+CALL db.deleteLabel('vertex', 'node1')
+```
+
+### 点类型添加字段
+>该操作会同步变更所有该类型点的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，一次添加了两个字段：`field1`，字符串类型，可选，默认值是 `null`; `field2`，`int64`类型，必选，默认值是0.
+```
+CALL db.alterLabelAddFields('vertex', 'node1', ['field1', string, null ,true], ['field2', int64, 0, false])
+```
+
+### 点类型删除字段
+>该操作会同步变更所有该类型点的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，一次删除了两个字段: `field1` 和 `field2`。
+```
+CALL db.alterLabelDelFields('vertex', 'node1', ['field1', 'field2'])
+```
+
+### 点类型添加索引
+>该操作会同步构建索引数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，给`field1`字段添加了一个非唯一索引。
+```
+CALL db.addIndex('node1', 'field1', false)
+```
+如下例子，对于点类型`node1`，给`field2`字段添加了一个唯一索引。
+```
+CALL db.addIndex('node1', 'field2', true)
+```
+
+### 点类型删除索引
+如下例子，对于点类型`node1`，删除字段`field1`上的索引。
+```
+CALL db.deleteIndex('node1', 'field1')
+```
+
+
+## 边类型操作
+### 创建边类型
+
+如下json定义了一个边的schema，名字是`edge1`。
+```json
+{
+  "label": "edge1",
+  "type": "EDGE",
+  "detach_property": true,
+  "constraints": [
+    ["node1", "node2"]
+  ]
+  "properties": [{
+    "name": "id",
+    "type": "INT32",
+    "optional": false
+  }, {
+    "name": "name",
+    "type": "STRING",
+    "optional": false,
+    "index": true
+  }, {
+    "name": "num",
+    "type": "INT32",
+    "optional": false,
+    "index": true,
+    "unique": true
+  }, {
+    "name": "desc",
+    "type": "STRING",
+    "optional": true
+  }]
+}
+```
+把上面这个json序列化成字符串，作为参数传入，建议使用驱动的参数化特性，避免自己拼接语句。
+```
+CALL db.createEdgeLabelByJson($json_data)
+```
+### 查看边类型schema
+```
+CALL db.getEdgeSchema('edge1')
+```
+
+### 删除边类型
+>该操作会同步删除所有该类型的边，数据量大的时候，有时间消耗。
+
+如下例子，删除边类型`edge1`以及该类型的所有边数据。
+```
+CALL db.deleteLabel('edge', 'edge1')
+```
+
+### 边类型添加字段
+>该操作会同步变更所有该类型边的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于边类型`edge1`，一次添加了两个字段: `field1`，字符串类型，可选，默认值是 `null`; `field2`，`int64`类型，必选，默认值是`0`.
+```
+CALL db.alterLabelAddFields('edge', 'edge1', ['field1', string, null ,true], ['field2', int64, 0, false])
+```
+
+### 边类型删除字段
+>该操作会同步变更所有该类型边的属性数据，数据量大的时候，有时间消耗。
+
+如下操作，对于边类型`edge1`，一次删除了两个字段: `field1` 和 `field2`。
+```
+CALL db.alterLabelDelFields('edge', 'edge1', ['field1', 'field2'])
+```
+
+### 边类型添加索引
+>该操作会同步构建索引数据，数据量大的时候，有时间消耗。
+
+如下例子，对于边类型`edge1`，给字段`field1`添加了一个非唯一索引。
+```
+CALL db.addEdgeIndex('edge1', 'field1', false, false)
+```
+如下例子，对于边类型`edge1`，给字段`field2`添加了一个唯一索引。
+```
+CALL db.addEdgeIndex('edge1', 'field2', true, false)
+```
+
+### 边类型删除索引
+如下例子，对于边类型`edge1`，删除字段`field1`上的索引。
+```
+CALL db.deleteEdgeIndex('edge1', 'field1')
+```
+
+## 实时查看当前点边数据量
+如下例子返回所有的点边类型，以及每种类型当前的数据量是多少。
+
+读的是统计数据，轻操作。
+```
+dbms.meta.countDetail()
+```
+
+## 导入数据
+### 批量upsert点数据
+如果不存在就插入点，如果存在就更新点的属性，根据点的主键字段值判断是否存在。
+
+第二个参数是一个`list`类型，每个`list`里面的元素是个`map`类型，每个`map`里面是点的字段和对应的值。
+
+推荐使用driver里面的参数化特性，第二个参数直接传入一个 `list`结构体，避免自己构造语句。
+```
+db.upsertVertex('node1', [{id:1, name:'name1'},{id:2, name:'name2'}])
+```
+### 批量upsert边数据
+如果两点之间不存在某条类型的边就插入，如果存在就更新该边的属性。
+
+第四个参数是一个`list`类型，每个数组里面的元素是个`map`类型，每个`map`里面是：边的起点类型主键字段和对应的值、边的终点类型主键字段和对应的值、边类型自身的属性字段和值。每个map里面至少有两个元素。
+
+第二个参数和第三个参数是为第四个参数服务的。分别说明了起点和终点的类型是什么，以及第四个参数中那个字段代表起点主键字段值，那个字段代表终点主键字段值。
+
+推荐使用driver里面的参数化特性，避免自己构造语句。
+```
+CALL db.upsertEdge('edge1',{type:'node1',key:'node1_id'}, {type:'node2',key:'node2_id'}, [{node1_id:1,node2_id:2,score:10},{node1_id:3,node2_id:4,score:20}])
+```
+
+### DataX
+
+https://github.com/ljcui/DataX/tree/bolt 自行编译。
+
+这个DataX实现的 tugraph writer 内部调用的是上面描述的`db.upsertVertex`和`db.upsertEdge`。
+
+### 离线脱机导入数据
+如果你有子图的schema以及子图里面所有的点边数据（csv或者json格式），可以利用`lgraph_import`工具离线将这些数据生成图数据。
+
+该方式适合初始阶段，先灌进去一批全量数据。注意server要停机，导入完再启动server，可以看到生成的子图数据。
+
+参考 [lgraph_import 使用介绍](./6.utility-tools/1.data-import.md) 中的**离线全量导入**部分
+
+## 导出数据
+
+### 在线远程流式导出数据
+[lgraph_cli 使用介绍](./7.client-tools/6.bolt-console-client.md)
+
+CSV 格式
+```
+echo "match(n:person) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+```
+JSON 格式
+```
+echo "match(n:person) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
+### 本地导出整个图的所有数据
+[lgraph_export 使用介绍](./6.utility-tools/2.data-export.md)
+
+CSV 格式
+```
+lgraph_export -d your_db_path -e export_data -g default -f json -u admin -p 73@TuGraph
+```
+JSON 格式
+```
+lgraph_export -d your_db_path -e export_data -g default -f json -u admin -p 73@TuGraph
+```
+
+### 跨版本迁移数据
+[lgraph_export 使用介绍](./6.utility-tools/2.data-export.md)
+
+对于不兼容的版本之间迁移数据，可以使用`lgraph_export`将旧版本server里面的数据全部导出成文本（里面包含图schema以及所有的点边数据），然后再选择合适的方法将这些文本数据导入到新版本。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.0/zh-CN/source/index.rst b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/index.rst
new file mode 100644
index 0000000000..88684b85d4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.0/zh-CN/source/index.rst
@@ -0,0 +1,24 @@
+TuGraph高性能图数据库
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   development_guide.md
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile
new file mode 100644
index 0000000000..ebf8f4d2ba
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.3.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-CPP-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-CPP-Procedure-API/run.sh
new file mode 100644
index 0000000000..e2455bfbc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-CPP-Procedure-API/run.sh
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+# 0. install: yum install doxygen, graphviz
+# 1. run this script
+doxygen Doxyfile
diff --git a/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/Makefile b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/Makefile
new file mode 100644
index 0000000000..e58ac30a31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+SPHINXPROJ    = TuGraph
+SOURCEDIR     = .
+BUILDDIR      = _build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/conf.py b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/conf.py
new file mode 100644
index 0000000000..8af367a431
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/conf.py
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+#
+# Configuration file for the Sphinx documentation builder.
+#
+# This file does only contain a selection of the most common options. For a
+# full list see the documentation:
+# http://www.sphinx-doc.org/en/master/config
+
+# -- Path setup --------------------------------------------------------------
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#
+import os
+import sys
+sys.path.insert(0, os.path.abspath('../../../build/output/'))
+
+
+# -- Project information -----------------------------------------------------
+
+project = u'TuGraph'
+copyright = u'2018-2022, Ant Group'
+author = u'Ant Group'
+
+# The short X.Y version
+version = u''
+# The full version, including alpha/beta/rc tags
+release = u''
+
+
+# -- General configuration ---------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#
+# needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.autodoc',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+#
+# source_suffix = ['.rst', '.md']
+source_suffix = '.rst'
+
+# The master toctree document.
+master_doc = 'index'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+# This pattern also affects html_static_path and html_extra_path .
+exclude_patterns = [u'_build', 'Thumbs.db', '.DS_Store']
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+
+# -- Options for HTML output -------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+#
+html_theme = 'nature'
+#html_theme = 'haiku'
+#html_theme = 'pyramid'
+#html_theme = 'sphinxdoc'
+#html_theme = 'bizstyle'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#
+# html_theme_options = {}
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Custom sidebar templates, must be a dictionary that maps document names
+# to template names.
+#
+# The default sidebars (for documents that don't match any pattern) are
+# defined by theme itself.  Builtin themes are using these templates by
+# default: ``['localtoc.html', 'relations.html', 'sourcelink.html',
+# 'searchbox.html']``.
+#
+# html_sidebars = {}
+
+
+# -- Options for HTMLHelp output ---------------------------------------------
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'TuGraphdoc'
+
+
+# -- Options for LaTeX output ------------------------------------------------
+
+latex_elements = {
+    # The paper size ('letterpaper' or 'a4paper').
+    #
+    # 'papersize': 'letterpaper',
+
+    # The font size ('10pt', '11pt' or '12pt').
+    #
+    # 'pointsize': '10pt',
+
+    # Additional stuff for the LaTeX preamble.
+    #
+    # 'preamble': '',
+
+    # Latex figure (float) alignment
+    #
+    # 'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'TuGraph.tex', u'TuGraph Documentation',
+     u'Ant Group', 'manual'),
+]
+
+
+# -- Options for manual page output ------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'tugraph', u'TuGraph Documentation',
+     [author], 1)
+]
+
+
+# -- Options for Texinfo output ----------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'TuGraph', u'TuGraph Documentation',
+     author, 'TuGraph', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+
+# -- Extension configuration -------------------------------------------------
diff --git a/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/index.rst b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/index.rst
new file mode 100644
index 0000000000..1cc3567d47
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/index.rst
@@ -0,0 +1,37 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+TuGraph Procedure API - Python
+====================================
+Version: 4.3.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Noe4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
+
+
+Indices and tables
+-------------------
+
+* :ref:`genindex`
+* :ref:`modindex`
+* :ref:`search`
diff --git a/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/make.bat b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/make.bat
new file mode 100644
index 0000000000..b1d0c9a1dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=.
+set BUILDDIR=_build
+set SPHINXPROJ=TuGraph
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.http://sphinx-doc.org/
+	exit /b 1
+)
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/run.sh
new file mode 100755
index 0000000000..d10e0a2b1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/autogen/TuGraph-Python-Procedure-API/run.sh
@@ -0,0 +1,7 @@
+# 0. install sphinx-build: yum install python3-sphinx
+# 1. default lgrpah module path: ../../../build/output/lgraph_python.so
+# 2. make lgraph_python
+# 3. run this script
+rm output -rf
+mkdir -p _static _templates
+sphinx-build -W -b html . output
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/.readthedocs.yaml b/docs/docusaurus/versions/version-4.3.1/en-US/.readthedocs.yaml
new file mode 100644
index 0000000000..92cd0965f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/en-US/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/Makefile b/docs/docusaurus/versions/version-4.3.1/en-US/Makefile
new file mode 100644
index 0000000000..a4de0bff18
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?= -W
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/make.bat b/docs/docusaurus/versions/version-4.3.1/en-US/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/1.guide.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/1.guide.md
new file mode 100644
index 0000000000..8dde4539c3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/1.guide.md
@@ -0,0 +1,76 @@
+# Guide
+
+> Here is the document map that helps users learn and use the TuGraph community version quickly.
+
+## Quick Start
+
+> Understand [What is a Graph](./2.introduction/1.what-is-graph.md),[The application scenarios of graph](./2.introduction/8.scenarios.md),[What is TuGraph](./2.introduction/3.what-is-tugraph.md).
+
+> Quickly Install and deploy TuGraph:[Cloud Deployment](5.installation&running/5.cloud-deployment.md),[Docker Deployment](5.installation&running/3.docker-deployment.md)Rapid deployment TuGraph.
+
+> Quickly get started with DEMO:[Movie](./3.quick-start/2.demo/1.movie.md),[The Wandering Earth](./3.quick-start/2.demo/2.wandering-earth.md),[Three Body](./3.quick-start/2.demo/3.the-three-body.md),[Three Kingdoms](./3.quick-start/2.demo/4.three-kingdoms.md).
+
+> User Guide:[TuGraph Browser](./4.user-guide/1.tugraph-browser.md),[TuGraph Browser Legacy](./4.user-guide/2.tugraph-browser-legacy.md).
+
+## Development Guide
+
+> Client Tools: [Bolt Client](7.client-tools/5.bolt-client.md).
+
+> TuGraph Query Language:[Cypher API](8.query/1.cypher.md).
+
+> Procedure And Algorithm:[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md).
+
+> C++/Python Procedure Interfaces:[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## Community Contribution
+
+> Before starting to contribute, you can learn [how to contribute](12.contributor-manual/1.contributing.md)
+
+> If you want to understand the division of community roles, please visit [community roles](12.contributor-manual/2.community-roles.md)
+
+## Main warehouse
+
+> TuGraph-DB repository: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> Visual interface: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java client: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> Simple test method based on twitter data: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> Test method based on standard LDBC-SNB: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics repository: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## Video Center
+
+> [Get started quickly with TuGraph](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph technology sharing collection](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [Understand graph calculation in 3 minutes](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph-Latest-Version
+
+| Description                      | File                                       | Link                                                                                                                                                                                                     |
+|----------------------------------|--------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 runtime package          | tugraph-4.3.1-1.el7.x86_64.rpm             | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-4.3.1-1.el7.x86_64.rpm)                                                                                         |
+| CentOS8 runtime package          | tugraph-4.3.1-1.el8.x86_64.rpm             | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-4.3.1-1.el8.x86_64.rpm)                                                                                         |
+| Ubuntu18.04 runtime package      | tugraph-4.3.1-1.x86_64.deb                 | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-4.3.1-1.x86_64.deb)                                                                                             |
+| CentOS7 runtime image            | tugraph-runtime-centos7-4.3.1.tar          | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-runtime-centos7-4.3.1.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                   |
+| CentOS8 runtime image            | tugraph-runtime-centos8-4.3.1.tar          | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-runtime-centos8-4.3.1.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8)                   |
+| Ubuntu18.04 runtime image        | tugraph-runtime-ubuntu18.04-4.3.1.tar      | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-runtime-ubuntu18.04-4.3.1.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04)          |
+| CentOS7 mini runtime package     | tugraph-mini-4.3.1-1.el7.x86_64.rpm        | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-4.3.1-1.el7.x86_64.rpm)                                                                                    |
+| CentOS8 mini runtime package     | tugraph-mini-4.3.1-1.el8.x86_64.rpm        | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-4.3.1-1.el8.x86_64.rpm)                                                                                    |
+| Ubuntu18.04 mini runtime package | tugraph-mini-4.3.1-1.x86_64.deb            | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-4.3.1-1.x86_64.deb)                                                                                        |
+| CentOS7 mini runtime image       | tugraph-mini-runtime-centos7-4.3.1.tar     | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-runtime-centos7-4.3.1.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7)        |
+| CentOS8 mini runtime image       | tugraph-mini-runtime-centos8-4.3.1.tar     | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-runtime-centos8-4.3.1.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8)        |
+| Ubuntu18.04 mini runtime image   | tugraph-mini-runtime-ubuntu18.04-4.3.1.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-runtime-ubuntu18.04-4.3.1.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 compilation image        | tugraph-compile-centos7-1.3.2.tar          | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.3.2.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)          |
+| CentOS8 compilation image        | tugraph-compile-centos8-1.3.2.tar          | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.3.2.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)          |
+| Ubuntu18.04 compilation image    | tugraph-compile-ubuntu18.04-1.3.2.tar      | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.3.2.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04) |
+
+
+For the version update log, see: [Link](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md).
+
+If you don't know how to use installation packages and images, please refer to [Environment and Version Selection](13.best-practices/4.selection.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..c04cb1030c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/1.privilege.md
@@ -0,0 +1,141 @@
+# Privilege
+
+## 1.Introduce
+
+> The permissions of TuGraph are managed based on role-based access control. The permissions that define access control are assigned to roles, and the roles are then assigned to users.
+
+## 2.Level of permissions
+
+- Global layer: indicates global permissions, which have permissions for management and graph operations.
+- Graph layer: control permissions on each graph;
+- Property level (Commercial version only) : control permissions on a property
+
+## 3.Permission keyword
+
+At present, the control of permissions is relatively simple
+
+- The Global layer currently has admin permission, and the admin user is preset.
+
+* The Graph layer has four operation permissions: none, read, write, and full
+
+- none: No permission, no operation permission for the graph
+- read: Read-only permission, only has read permission for the graph
+- write: Read and write permission, not only has read permission for the graph, but also has write permission
+- full: All permissions, not only have read and write permissions for graphs, but also have permissions to delete graphs, modify graphs, and modify schemas
+
+* The Property layer (Commercial version only)  has the following permissions: none, read, and write
+
+- none: No permission, no operation permission for the property
+- read: Read-only permission, only has read permission for the property
+- write: Read and write permission, not only has read permission for the property, but also has write permission
+
+## 4.Common permission operations
+
+### 4.1.User action
+
+- Creating a user
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- Deleting a user
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- Change the password of the current user
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- Changes the password of a specified user
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- Disable or enable a user
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- List all users
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- Lists the current user information
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- Obtain user details
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.Role actions
+
+- Create a role
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- Delete a role
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- List all characters
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- Disable or enable the role
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.Assign roles to users
+
+- Adds the association between the user and the role
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- Deletes the association between the user and the role
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- Clears the relationship between user roles and rebuilds them
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.Role empowerment
+
+- Modifies the access permission of a role to a specified graph
+
+```cypher
+CALL dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP)
+```
+
+Example
+
+```cypher
+CALL dbms.security.modRoleAccessLevel("test_role", {test_graph1:"FULL", test_graph2:"NONE"})
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/2.token.md
new file mode 100644
index 0000000000..dd4ac2e2e5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/2.token.md
@@ -0,0 +1,42 @@
+# Token Usage Guide
+## 1. Introduction to Token
+JWT (JSON Web Token) is an open standard used for authentication and authorization. It is based on the JSON (JavaScript Object Notation) format and is designed for securely transmitting claim information between network applications.
+
+JWT consists of three parts: the header, payload, and signature. The header contains the type of JWT and the signature algorithm used, the payload contains the information to be transmitted, and the signature is used to verify the integrity and authenticity of the JWT.
+
+In TuGraph, JWT is used to implement a stateless authentication and authorization mechanism. After a user logs in successfully, the server generates a JWT and returns it to the client. The client passes this JWT as an identity credential in subsequent requests to the server. Upon receiving the JWT, the server verifies the signature and parses the information in the payload to determine the user's identity and permissions, and decides whether to allow the execution of the request.
+
+## 2. Token Expiration
+### 2.1. Browser Token Interaction Logic
+1. The user opens the browser, enters the username and password, and clicks login.
+2. The frontend calls the login interface and inputs the account and password to the backend.
+3. After receiving the account and password, the backend verifies them and returns a Token.
+4. The frontend stores the Token in the browser cache, and all subsequent requests must carry this Token.
+5. If the frontend actively clicks logout or closes the page, it should actively call the logout interface and pass the Token to the backend.
+6. After receiving the Token, the backend invalidates it, returns a status code 200, and "logout successful". After receiving the message, the frontend clears the Token in the browser memory, and returns to the login page.
+7. The Token expires (initially set to 24 hours), and the user needs to log in again.
+### 2.3. Token Expiration Refresh Mechanism
+Token expiration has a refresh mechanism that is turned off by default. If turned on, the security of the Token will be higher, and there will be two timestamps.
+
+The first timestamp `refresh_time` is used to determine whether the Token has expired (default 24 hours): after expiration, the refresh interface can be called to obtain a new Token, which can be set to a shorter time, such as 1 hour.
+
+The second timestamp `expire_time` is the forced expiration timestamp (default 24 hours): after expiration, the user must log in again.
+
+### 2.4. Token Expiration Modification
+To facilitate developers to develop on their own, TuGraph provides two ways to modify the expiration time, both of which require admin privileges.
+
+* Set through the interface call. The interfaces involved in modifying the expiration time are `update_token_time` and `get_token_time` for querying the expiration time. For details, please refer to the [REST interface document](../7.client-tools/9.restful-api-legacy.md).
+* Set through startup parameters. When the server-side is started, adding the parameter `-unlimited_token 1` can set the Token to be unlimited. Please refer to the [service running document](../5.installation&running/7.tugraph-running.md) for details.
+## 3. Introduction to Token-Related Requests Sent by Clients
+The client handles two types of protocol-related requests: REST and RPC.
+
+### 3.1. REST
+If the client uses the REST protocol (including the browser), because it is a short connection, Token needs to be carried in every request, and a new Token needs to be obtained after it expires.
+
+For self-developed clients, if the REST protocol is used, Token logic needs to be considered.
+
+### 3.2. RPC
+If the client uses the RPC protocol (including the official C++/Java/Python), it uses a long connection to maintain, and no Token operation is involved after login.
+
+## 4. Token upper limit
+The upper limit of Token refers to the maximum number of Tokens that a user can own at the same time. To prevent unlimited logins, the upper limit of Token is 10000 by default. Since the token generation logic is strongly related to time, a token will be generated for storage every time you log in. The validity period of the token is 24 hours by default. Therefore, it is recommended to log out the unused token in time after login.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..706d377c16
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,20 @@
+# Forgot Admin Password
+> TuGraph provides a password reset feature. If you forget the password for the admin account, you can reset it by following these steps.
+
+## 1. Reset Password
+First, stop the TuGraph server.
+
+When starting the TuGraph server again, add the following parameter:
+```bash
+--reset_admin_password 1
+```
+
+Here is an example:
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+This operation will reset the password for the admin account to the default password: 73@TuGraph when starting the TuGraph server.
+If the password reset is successful, you will receive the message "Reset admin password successfully" and the current server process will be closed.
+
+You need to restart the server in normal mode and then use the default account and password to log in. After logging in, you can reset the password to continue using TuGraph.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..6695299a7d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/4.monitoring.md
@@ -0,0 +1,1019 @@
+# Monitoring
+
+> This document mainly introduces the visualization operation and maintenance monitoring of TuGraph.
+
+## 1.Design Concept
+
+Visualization monitoring is not an indispensable part of TuGraph itself. Therefore, in the design, visualization monitoring is regarded as an application in the peripheral ecology of TuGraph to reduce the coupling with TuGraph database and its own impact. TuGraph visualization monitoring adopts the hottest open source solution - TuGraph Monitor + Prometheus + Grafana. Wherein, TuGraph Monitor is the client of TuGraph service, which initiates Procedure requests to TuGraph service through TCP connection. After receiving the request, TuGraph service collects statistics of CPU, memory, disk, IO, and number of requests on its own machine and responds. TuGraph Monitor packages the index data received from TuGraph into the format required by Prometheus and saves it in memory, waiting for Prometheus to obtain it through HTTP request. Prometheus regularly obtains packaged request data from TuGraph Monitor through HTTP requests and saves it in its own time-series database according to the time obtained. Grafana can obtain the statistical data within a certain time period from Prometheus according to user configuration and draw easy-to-understand graphics on the web interface to display the final result. In the entire request chain, the active acquisition, i.e. pull model, is used, which has the advantages of minimizing the coupling between data producers and data consumers, making development simpler, and not requiring data producers to consider the data processing capability of data consumers. Even if the data processing ability of a consumer is weak, it will not be crushed by the data producer producing data too fast. One of the shortcomings of the active pulling model is that the real-time performance of the data is insufficient. However, in this scenario, data does not have high real-time requirements.
+
+### 1.1.TuGraph
+
+TuGraph database provides the ability to collect multiple data information, such as disk, memory, network IO, and query requests, in the service machine, and provides queries through standard Procedure methods. This action of collecting data only occurs when a user queries through the interface, avoiding the impact of TuGraph monitoring service on user business query requests when users do not need the indicators on TuGraph monitoring service machine.
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor is a tool in the peripheral ecology of TuGraph. It communicates with TuGraph through C++ RPC Client as one of the many users of TuGraph and queries the performance indicators of the machine where TuGraph service is located through the Procedure query interface. It packages the results returned by TuGraph into the data model required by Prometheus and waits for Prometheus to obtain them. Users can set the query time interval to minimize the impact of obtaining monitoring indicators on business queries.
+
+### 1.3.Prometheus
+
+Prometheus is an open-source monitoring platform with a dedicated time-series database. It regularly obtains statistical indicators from the TuGraph Monitor service through HTTP requests and saves them in its own time-series database. For details, please refer to the official website:[https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana is an open-source visualization and analysis software. It can obtain data from multiple data sources, including Prometheus, and can convert data in the time-series database into tools for beautiful graphics and visual effects. For specific information, please refer to the official website:[https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.Deployment Solution
+
+### 2.1.Step 1
+
+Start the TuGraph service. For details, please refer to the documentation:[https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.Step 2
+
+Start the TuGraph Monitor tool. The startup command is as follows:
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+The meanings of the parameters are as follows:
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.Step Three
+
++ Download the Prometheus tarball that matches your machine architecture and system version. Download link:[https://prometheus.io/download/](https://prometheus.io/download/)
+
++ Unzip the tarball with the following command:
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ Modify the configuration file prometheus.yml and add the following configuration to enable Prometheus to scrape performance data packaged by TuGraph Monitor.
+
+```
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ Start Prometheus. You can obtain specific startup parameters with the following command:
+
+```shell
+./prometheus -h
+```
+
++ Verify if the Prometheus service is running properly by logging into the Prometheus service through the web portal, and querying whether the monitoring index resources_report has been obtained. If the data can be successfully queried, the operation is successful.
+
+### 2.4.Step Four
+
++ Download the Grafana installation package that matches your machine architecture and system version. Download link:[https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ Install Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Start Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Configure Grafana. First, configure the IP address of Prometheus in the data source settings. After the configuration is completed, verify if the data source is connected successfully by testing the connection function. Then, import the following template and modify the correct interface IP and port in the page according to the actual situation. Finally, set the refresh time and monitoring time range according to the actual situation.
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana",
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{label_name}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "memory",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \n  QPS exceeds 1000",
+        "name": "Request statistics alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "Request statistics",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "disk",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \nCPU usage rate exceeds 90%",
+        "name": "CPU usage rate alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU usage rate",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] Disk IO exceeds 10MB/S",
+        "name": "Disk IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph Monitoring Web",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+Verify the effect by refreshing the browser page. If the pie chart and line chart are displayed correctly, the configuration is completed.
+
+## 3.Future Plans
+
+Currently, visual monitoring only supports single-machine monitoring and can monitor performance indicators such as CPU, disk, network IO, and request QPS of the machine on which the service is located. In the future, monitoring for HA clusters will be implemented, and more meaningful indicators will be included in the monitoring scope.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/5.log.md
new file mode 100644
index 0000000000..caca9a40f7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# Log
+
+> This document mainly introduces the logging function of TuGraph.
+
+## 1.Introduction
+
+TuGraph keeps two types of logs: server logs and audit logs. Server logs record human-readable server status information, while audit logs maintain encrypted information for every operation performed on the server.
+
+## 2.Server log
+
+### 2.1.Server Log Configuration Items
+The output directory of server logs can be specified through the `log_dir` configuration item. The level of log can be specified through the `verbose` configuration item.
+
+The `log_dir` configuration item is empty by default. If `log_dir` configuration item is empty, then all logs will be write to the console(nothing will be written to the console if the `log_dir` configuration item is empty under daemon mode); if `log_dir` configuration item is configured specifically, log files will bew generated under that path. The maximum size of a single log file is 256MB.
+
+The `verbose` configuration item controls the level of log, and is divided into three levels of `0, 1, 2`. Ther verbosity of log record grows as the number grows. The default level is `1`. When the level is set to `2`, the server will print logs in `DEBUG` level and above. When the level is set to `1`, the server will print logs in `INFO` level and above. When the level is set to `0`, the server will print log in `ERROR` level and above.
+
+### 2.2.Example of Server Log Output Macro Usage
+
+If the developer wants to add logs to the code during development, they can refer to the following example:
+
+```
+#include "tools/lgraph_log.h" // add log dependency.
+
+void LogExample() {
+    // The log module has been initialized during the database startup, and developers can directly call the macro.
+    // The log level is divided into five levels: DEBUG, INFO, WARNING, ERROR, and FATAL.
+
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+
+You can also refer to the log macro usage in test/test_lgraph_log.cpp.
+
+### 2.3.Procedure log
+
+Developers can use the log function to output debug information that they need to the log for looking up and assisting development during the development of procedures. Debug information will be output to the same log file as the server log (if `log_dir` configuration item is not specified, it will also be output to the console)
+
+#### 2.3.1.Cpp procedure
+Please use the log macro provided in 2.2 to output debug information, and avoid using output methods such as cout or printf. For specific usage, please refer to the following sample code (see `procedures/demo/log_demo.cpp` for details)
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+After inserting the above sample code into the database as a procedure and running it, you can see the corresponding log entries in the log file.
+
+#### 2.3.1.python procedure
+Please use Python's built-in print to output debug information. The debug information will be merged into a WARN-level log entry and output to the log file after the procedure is executed.
+
+## 3.Audit log
+
+Audit logs record each request and response, as well as the user who sent the request and when the request received. Audit logging can only be turned on or off. The results can be queried using the TuGraph visualization tool and the REST API.
+
+To enable the Audit Log, you need to set the `enable_audit_log` parameter to `true` in the configuration file. For the configuration file and parameter descriptions, see:[Tugraph Running/Service configuration](../../5.installation&running/7.tugraph-running.md)
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/index.rst
new file mode 100644
index 0000000000..4dc0c67422
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Privilege And Operations
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..2cdb8d3f31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# Unit Testing
+
+> This document is the unit testing documentation for TuGraph.
+
+## 1.Introduction
+
+TuGraph unit testing uses the gtest framework, which can choose to run all tests at once or specify certain tests.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..b98cf7f62a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/11.quality/2.integration-testing.md
@@ -0,0 +1,400 @@
+# Integration Testing
+
+> This document mainly introduces how to use the TuGraph integration testing framework.
+
+## 1.The Significance of TuGraph Integration Testing
+
+In unit tests and function tests, some test cases directly use Galaxy or Statemachine to perform tests, which is not a complete process. In the complete CS architecture, user requests are sent to the server through the client, and network communication is essential. To avoid bugs caused by incomplete unit testing, TuGraph uses an integration testing framework to perform end-to-end testing.
+
+## 2.TuGraph Integration Testing Framework
+
+TuGraph uses the Pytest framework as its integration testing framework. Pytest is currently the most widely used CS-side integration testing framework. It is known for its flexibility, ease of use, and the ability to support parameterization. Based on the functionality provided by Pytest, TuGraph abstracts different tools and controls the processing logic of each tool through parameters to facilitate efficient testing code development.
+
+For more information on Pytest, please refer to the official website: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.Component Description
+
+| Component Name    |Component Function      | Implementation Method                              |
+| --------------- | -------------------------- | ------------------------------------------------ |
+| server          | TuGraph standalone service | Start a child process and launch the service       |
+| client          | TuGraph Rpc Client         | Open TuGraph Python Rpc Client in the current process and send requests  |
+| importor        | TuGraph Importor           | Start a child process to process import requests               |
+| exportor        | TuGraph Exportor           | Start a child process to process export requests               |
+| backup_binlog   | TuGraph Backup Binlog      | Start a child process to process binlog backup requests       |
+| backup_copy_dir | TuGraph Backup             | Start a child process to process full db backup requests       |
+| build_so        | Component for compiling C++ dynamic libraries    | Start a child process to handle GCC compilation logic            |
+| copy_snapshot   | TuGraph Copy Snapshot      | Handle backup snapshot requests in the current process                 |
+| copydir         | Folder copy                 | Handle folder copy requests in the current process                     |
+| exec            | Execute C++/Java executable files     | Start a child process to launch the C++ executable file  |
+| algo            | Execute algorithm                   | Start a child process to run the algorithm     |
+| bash            | Execute bash commands               | Start a child process to execute bash commands      |
+| rest            | TuGraph Python Rest Client | Open TuGraph Python Rest Client in the current process and send requests|
+
+### 2.2.Component Usage
+
+#### 2.2.1.server
+
+##### 2.2.1.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The server will be started before the function starts executing, and the server will be stopped and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ host is the IP and port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to the user in the TuGraph Server
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The client will be started before the function starts executing, and the client will be stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.Startup Command
+
+Import the tool through the fixtures component and control the import of different data through startup parameters. The data will be imported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.Startup Command
+
+Import the tool through the fixtures component and control the export of different data through startup parameters. The data will be exported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.Startup Parameters
+采用python字典传入
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different binlogs through startup parameters. The binlogs will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different databases through startup parameters. The database will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command, passed in as a Python list, and multiple so can be compiled at once
++ so_name is the dynamic library that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.Startup Command
+
+Import the tool through the fixtures component and control the compilation of different dynamic libraries through startup parameters. The dynamic libraries will be generated to the specified directory before the function starts executing, and the dynamic libraries specified in the so_name list will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original database
++ dst is the snapshot copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.Startup Command
+Import the tool through the fixtures component and control the copying of different snapshots through startup parameters. The snapshot in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original directory
++ dst is the directory copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.Startup Command
+Import the tool through the fixtures component and control the copying of different directories through startup parameters. The directory in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.Startup Command
+Import the tool through the fixtures component and control the execution of different logic through startup parameters. A child process will be started to execute the command passed in through the cmd parameter before the function starts executing.
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ result is the expected execution result of the algorithm. After execution is completed, the actual result will be compared with the expected result. If they are different, the test will fail.
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.Startup Command
+Import the tool through the fixtures component and control the execution of different algorithm logic through startup parameters. A child process will be started to execute the algorithm passed in through the cmd parameter before the function starts executing. The function body will wait for the algorithm to complete and compare the result with the expected result.
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.Startup Command
+
+Import the tool through the fixtures component and control the execution of different bash commands through startup parameters. A child process will be started to execute the bash command passed in through the cmd parameter before the function starts executing. The function body will wait for the command to complete.
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ port is the port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to user in TuGraph Server
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.Startup Command
+
+Import the tool through the fixtures component and link to different TuGraph Rest Servers through startup parameters. The client will be started before the function starts executing and stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.Test Cases
+
+#### 2.3.1.rest
+
+In the sample code, before the test_get_info function is executed, the server is started, and a rest client is started after the server is started. After entering the test_get_info function, some information about the server is obtained, and assert is used to determine whether cpu information is obtained.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+In the sample code, before the test_flushdb function is executed, the offline data import logic is executed and the server is started. After creating a connection through the client, the function enters the test_flushdb function. The number of points is queried to determine whether the import is successful. After the import is successful, the flushDB operation is executed. assert is used again to determine whether the db can be emptied normally.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+In the sample code, before the test_export_default function is executed, the offline data import logic is executed. After the import is successful, the data of the current db is exported. Then, the offline import logic is used again to import the exported data into a new directory. The newly imported data is used to start the db and create a connection. In the body of the test_export_default function, it is determined whether the data after export and import is consistent with the original data.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.Other Tests
+For more test cases, please refer to the integration test code [https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/11.quality/index.rst
new file mode 100644
index 0000000000..f3b6e0e061
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Quality
+==============================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..bf465539f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,93 @@
+# TuGraph Contribution Guide
+
+## 1. Preface
+
+Thank you for your contribution to TuGraph. We sincerely hope that more students from the community will join in and build a better graph database project together.
+
+For outstanding community contributors, we will award the TuGraph Outstanding Community Contributor Certificate.
+
+## 2. What to contribute
+
+We welcome any contribution at any time, whether it's a simple typo fix, bug fix, or new feature addition. Feel free to ask questions or initiate PRs. We also value documentation and integration with other open source projects, and welcome contributions in this regard. For any modification, especially the more complex modification, it is recommended to create an issue and fill it out according to the BUG or PR template.
+
+## 3. Preparation
+
+## 3.1. Knowing TuGraph
+
+You can get start with TuGraph follow instrcutions in [Guide Doc](../1.guide.md).
+
+## 3.2. Environment
+
+For document contributions, you can directly modify and submit a pull request by clicking on "Edit on GitHub" in the upper right corner of the [documentation](https://tugraph-db.readthedocs.io/en/latest).
+
+For code contributions, it is usually necessary to set up the environment for compilation and execution. You can deploy using [Docker](../5.installation&running/3.docker-deployment.md) or [local package deployment](../5.installation&running/4.local-package-deployment.md).
+
+## 3.3. License Agreement
+
+Before contributing code, please take some time to understand the process of contributing code to TuGraph, and read the [Contributor License Agreement](3.individual-cla.md) or [Corporate Contributor License Agreement](4.corporate-cla.md). Participating in the contribution is deemed to agree to the above agreement.
+
+## 4. Contribute code process
+
+### 4.1. Submit the issue
+
+Whether you are fixing a bug in TuGraph or adding a new feature to TuGraph, before you submit the code, submit an issue on TuGraph's GitHub, describing the problem you want to fix or the function you want to add. There are several advantages to doing this:
+
+- There will be no duplication of work in conflict with other developers or their plans for the project.
+- TuGraph maintainers will discuss the bugs or new features you mentioned to determine whether the modification is necessary, whether there is room for improvement or a better way.
+- After reaching an agreement, develop and submit the code, reducing the cost of communication between the two parties and reducing the rejection of pull requests.
+
+### 4.2. Pull the branch
+
+All modifications of TuGraph are made on branches. After modification, the pull request is submitted and merged into the Master by the project maintenance personnel after Code Review. Therefore, after the source code steps are described, you need:
+
+1. Download the code to a local directory. In this step, you can choose git or https. In recent years, github has stricter permission requirements. The git approach, for example, requires the more complex ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)). https authentication cannot be performed using the user name and password. git clone https://github.com/ Your account name /tugraph-db
+2. Pull branch ready to modify code:
+   git branch add_xxx_feature
+3. After executing the above command, your code repository switches to the appropriate branch. Run the following command to view your current branch: git branch -a
+4. If you want to switch back to Master, run the git checkout -b master command
+5. If you want to switch back to branching, run the following command: git checkout -b "branchName"
+
+### 4.3. Configuring Github Information
+
+Run git config --list on your machine to view git's global username and mailbox. Check whether the displayed user.name and user.email match your github user name and email address.
+
+If a company has its own gitlab in-house or uses other commercial GitLabs, a mismatch may occur. At this point, you need to set up a separate user name and mailbox for the tugraph-db project. For details about how to set the user name and email address, see github's official documentation.
+
+### 4.4. Compile and Run
+
+The process of compile and run can reference [ci script](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. Change the code and submit it locally
+
+Once you've pulled the branch, you're ready to change the code.
+
+**Code modification Notes**
+
+Code style consistency: TuGraph uses cpplint to keep code in the same format, and IDE can use.clang to configure the style. Be sure to check the code style locally before submitting it, or ACI will report an error.
+
+Add unit test code: New changes should pass through existing unit tests. New unit tests should be provided to prove that there are bugs in the previous code and that the new code has resolved these bugs. You can run all tests with the following command:./unit_test
+It can also be run with the help of an IDE.
+
+**Other precautions**
+
+Please keep the code you are editing in the original style, especially the space feed, etc. For unnecessary comments, delete them directly. Add comments where logic and functionality are not easily understood. Keep documentation up to date. After modifying the code, run the following command to submit all the changes to the local computer:
+git commit -am '(feat) Add the xx function 'git commit -am '(fix) fix xx problem' '
+
+Submit the code to the remote repository
+After the code is committed locally, you can then synchronize the code with the remote repository. Run the following command to submit local changes to github: git push origin "branchname"
+
+If you were forking earlier, the origin here is pushed to your code repository, not TuGraph's.
+
+After the code has been submitted to GitHub, you can send a request to merge your changes into the TuGraph Master. At this point, you need to go to your corresponding repository on GitHub and press the pull request button in the upper right corner. Select the target branch, which is usually the master, and the system will notify the TuGraph staff, who will Review your code, and when it meets the requirements, it will join the main branch and become part of TuGraph.
+
+Please note that the CI will be automatically checked, as well as all Commits signing the cla, with green signs on the commits.
+
+### 4.6. Code Review
+
+After you submit your code, your code will be assigned to a maintainer for Review. Please wait patiently. If no one has responded to your submission after two working days, you can leave a message under PR and @ the corresponding person.
+
+Comments on code Review will be directly noted to the corresponding PR or Issue. If you find the suggestions reasonable, please update them to your code.
+
+### 4.7. Merge code into Master
+
+After the code Review is approved, the TuGraph maintainer will put it into the Master. During this process, the maintainer may specify a new Reviewer and put forward new comments that need to be revised. Normally this step is omitted, and after the code is merged, you will receive an indication that the merge was successful.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..27cff88ae8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,72 @@
+# TuGraph community roles
+
+## 1. Preface
+
+This document describes the roles of membership in the TuGraph community, the requirements and permissions for each role.
+
+## 2. Role summary
+
+This is the division of roles in the TuGraph community, describing the responsibilities of each role, the requirements to become and remain a role, and the permissions of the corresponding role.
+
+Our community is divided into three roles based on the Apache specification:
+
+- Contributor
+- Maintainer
+- PMC
+
+The requirements, responsibilities, and authorities for each role are described below.
+
+## 3. Contributor
+
+### 3.1. requirements
+
+Successfully submit a PR and merge in any of TuGraph's official projects.
+
+### 3.2. responsibility
+
+- Actively respond to issues or PR assigned to you
+- Help reply the issue/pr together and assign the issue to the person in charge of the corresponding module
+
+### 3.3. permissions
+
+- Join the TuGraph GitHub organization and become a member of the TuGraph open source community.
+
+## 4 Maintainer
+
+### 4.1. requirements
+
+The new Committer is recommended by the existing PMC and approved by 2/3 of the votes. The Commiter meets at least one of the following conditions:
+
+- Been a community member for more than three months
+- More than 10 PR for PMC approve
+- Complete major functions
+- Fixed serious bugs
+- Follow project development and participate in community discussion
+
+### 4.2. responsibility
+
+- Community counseling support
+- Actively respond to issues or PR assigned to you
+- The right to vote on major community decisions
+- Review community PR
+
+### 4.4. permissions
+
+- Pull Request review permission
+
+## 5. PMC
+
+### 5.1. requirements
+
+- Not open at the moment, if you have a strong desire please contact PMC
+
+### 5.2. responsibility
+
+- Actively participate in community discussions and give guidance to major community decisions
+- Responsible for ensuring that the community activities of open source projects are running smoothly
+
+### 5.3. permissions
+
+- Pull Request review permission
+- Pull Request approve permission
+- Community role member management
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..4798fc9db4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# Individual Contributor License Agreement
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..5ff3ff31e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# Corporate Contributor License Agreement
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..40b9d098f0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,73 @@
+# TuGraph Roadmap
+
+## 1. Introduction
+
+This document outlines the future development plans for TuGraph, including features currently under development, those
+not in the development pipeline, and completed functionalities not included in the open-source version.
+
+TuGraph aims to be an open-source, high-performance graph database. It adopts a centralized storage approach for graph
+data and, in the short term, does not consider data sharding. Instead, it employs a master-slave replication mode to
+address high-concurrency read scenarios, while utilizing cloud-based storage solutions to address storage capacity
+challenges.
+
+## 2. Completed Functionalities
+
+TuGraph was open-sourced on September 1, 2022, and has received regular bug fixes and enhancements based on community
+feedback.
+
+| Version | Functionality                                                                                 | Date       |
+|---------|-----------------------------------------------------------------------------------------------|------------|
+| 3.3.0   | Initial open-source release                                                                   | 2022.9.1   |
+| 3.3.1   | Refactored graph analysis engine with multi-mode support                                      | 2022.10.14 |
+| 3.3.2   | Added OGM support and improved unit test coverage                                             | 2022.11.21 |
+| 3.3.3   | Iterative improvements to link authentication mechanism and addition of English documentation | 2022.12.23 |
+| 3.3.4   | Cloud deployment support and streamlined LDBC SNB Audit process                               | 2023.1.28  |
+| 3.4.0   | Added support for OLAP Python API and upgraded offline data import                            | 2023.3.11  |
+| 3.5.0   | Introduced POG (Procedures On Graph query language), frontend upgrades                        | 2023.6.5   |
+| 3.5.1   | Added learning engine, Procedure Rust API, and storage-property separation                    | 2023.7.14  |
+| 3.6.0   | High availability support, log system upgrade                                                 | 2023.8.11  |
+| 4.0.0   | ISO GQL support, 11 new open-source graph algorithms, m1 Docker support                       | 2023.9.6   |
+| 4.0.1   | Support for temporal edge sorting, 5 new open-source graph algorithms                         | 2023.9.28  |
+| 4.1.0   | Bolt protocol support, fast online full import, support for geospatial data types             | 2023.12.25 |
+
+In addition, TuGraph has established a comprehensive quality system, including automated unit testing, integration
+testing, and performance testing.
+
+For more detailed information, refer to the "[root]/release/CHANGELOG.md" file in the source code directory.
+
+## 3. Functional Updates in 2024
+
+In addition to the aforementioned core functionalities, the following components are planned for development in 2024.
+
+| Version | 	Functionality                                                | 	Planned Date |
+|---------|---------------------------------------------------------------|---------------|
+| 4.2.x   | 	HA support for Witness role and management tools             | 	2024.3       |
+| 4.2.x   | 	Bolt support for stream processing and parameterized queries | 	2024.3       |
+| x.x.x   | 	GeaX support for Cypher                                      | 	2024.6       |
+| x.x.x   | 	Support for composite indexes                                | 	2024.6       |
+| x.x.x   | 	Optimization of data import functionality                    | 	2024.6       |
+| x.x.x   | 	[Community Feature] Support for geospatial data types        | 	2024.6       |
+| x.x.x   | 	Enhanced Cypher capabilities                                 | 	2024.9       |
+| x.x.x   | 	Support for rapid schema changes                             | 	2024.9       |
+| x.x.x   | 	Vectorization support                                        | 	2024.12      |
+| x.x.x   | 	RPQ support                                                  | 	2024.12      |
+| x.x.x   | 	[Optional] Query engine upgrade                              | 	2024.12      |
+| x.x.x   | 	[Community Feature] Support for GraphAr                      | 	2024.12      |
+
+## 4. Community Collaboration Features
+
+Currently, the development team's resources are limited, and we cannot implement all the desired features for TuGraph.
+However, during the feature planning process, we have identified a range of ideas worth exploring. The team has
+conducted some initial exploration, and we welcome community collaboration in developing the following features:
+
+| Version	 | Functionality	                                                | Planned Date |
+|----------|---------------------------------------------------------------|--------------|
+| x.x.x    | Rich graph algorithm library	                                 | 2024.x       |
+| x.x.x    | Support for default attribute values	                         | 2024.x       |
+| x.x.x    | Best practice of embedded TuGraph-DB usage                    | 2024.x       |
+| x.x.x    | Support for transaction in Bolt clients	                      | 2024.x       |
+| x.x.x    | Support for composite data types like List, Map, and Decimal	 | 2024.x       |
+| x.x.x    | Support of multiple storage engine	                           | 2024.x       |
+
+For simpler features, we will label them as "good first issue" on GitHub issues, and we welcome discussions from
+technology enthusiasts interested in graph databases.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..07fee7bd7a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Contributor Manual
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..baef5017a6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# Importing Data from Relational Databases to TuGraph
+
+> Using [DataX](../6.utility-tools/7.tugraph-datax.md)，to be completed.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..c7b094b1b7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,217 @@
+# Using TuGraph Graph Learning Module for Node Classification
+
+## 1. Introduction
+GNN is a powerful tool for many machine learning tasks on graphs. In this introductory tutorial, you will learn the basic workflow of using GNN for node classification, i.e., predicting the category of nodes in a graph.
+
+This document will show how to build a GNN for semi-supervised node classification on the Cora dataset with only a few labels, which is a citation network with papers as nodes and citations as edges. The task is to predict the category of a given paper.
+By completing this tutorial, you will be able to:
+
+Load the Cora dataset.
+
+Sample and build a GNN model using the sampling operator provided by TuGraph.
+Train the GNN model for node classification on CPU or GPU.
+
+This document requires some experience in using graph neural networks and DGL.
+
+## 2. Prerequisites
+The TuGraph graph learning module requires TuGraph-db version 3.5.1 or above.
+
+It is recommended to use Docker image tugraph-compile 1.2.4 or above for TuGraph deployment:
+
+tugraph/tugraph-compile-ubuntu18.04:latest
+
+tugraph/tugraph-compile-centos7:latest
+
+tugraph/tugraph-compile-centos8:latest
+
+The above images can be obtained on DockerHub.
+Please refer to [Quick Start](../3.quick-start/1.preparation.md) for specific operations.
+
+## 3. Import Cora Dataset to TuGraph Database
+### 3.1. Introduction to Cora Dataset
+The Cora dataset consists of 2708 papers, classified into 7 categories. Each paper is represented by a 1433-dimensional bag-of-words feature, indicating whether a certain word appears in the paper. These bag-of-words features have been preprocessed to be normalized to a range from 0 to 1. The edges represent citation relationships between papers.
+
+TuGraph has provided the Cora dataset import tool, which users can use directly.
+
+### 3.2. Data Import
+The Cora dataset is located in the test/integration/data/algo directory and contains the cora_vertices point set and the cora_edge edge set.
+
+First, the Cora dataset needs to be imported into the TuGraph database. Please refer to [Data Import](../6.utility-tools/1.data-import.md).
+
+In the build/output section below the line:
+``` bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+The number of commands related to the relevant document is to be built/output.
+
+Execute the following command in the build/output directory:
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Here, cora.conf is the graph schema file representing the format of graph data, which can be found in test/integration/data/algo/cora.conf. coradb is the name of the graph data file after import, which represents the storage location of graph data.
+
+## 4. Feature Conversion
+Since the features in the Cora dataset are float arrays of length 1433, which are not supported by TuGraph for loading, they can be imported as strings and converted to char* for easier access later. The implementation can be referred to the feature_float.cpp file.
+The specific execution process is as follows:
+
+Compile the import plugin in the build directory.(Can be skipped if TuGraph has been compiled):
+`make feature_float_embed`
+
+Execute the following command in the build/output directory to perform the conversion:
+`./algo/feature_float_embed ./coradb`
+
+## 5. Compile Sampling Operator
+The sampling operator is used to obtain graph data from the database and convert it into the required data structure. The specific execution process is as follows:
+Can be skipped if TuGraph has been compiled.
+Execute the following command in the tugraph-db/build directory:
+`make -j2`
+
+or execute the following command in the tugraph-db/learn/procedures directory:
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *
+import importlib
+getdb = importlib.import_module("getdb")
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+As shown in the code, after obtaining the algorithm .so file, import and use it.
+
+## 6. Model training and saving
+TuGraph calls the operators of the cython layer in the python layer to realize the training of the graph learning model.
+The usage of the TuGraph graph learning module is introduced as follows:
+Execute under the build/output folder
+`python3 train_full_cora.py --model_save_path ./cora_model`
+You can start training.
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+The detailed training process is as follows:
+### 6.1. Data Loading
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+As shown in the code, load the data into memory based on the path of the graph data, username, password, and subgraph name. TuGraph can load multiple subgraphs for graph training, but we only load one subgraph here.
+
+### 6.2. Build Sampler
+During the training process, the GetDB operator is first used to obtain the graph data from the database and convert it into the required data structure. The specific code is as follows:
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+As shown in the code, the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and their stored information is as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Then a sampler is constructed:
+```python
+batch_size = 5
+count = 2708
+sampler = TugraphSample(args)
+dataloader = dgl.dataloading.DataLoader(fake_g,
+    torch.arange(count),
+    sampler,
+    batch_size=batch_size,
+    num_workers=0,
+    )
+```
+
+### 6.3. Convert the results to the required format
+```python
+src = EdgeInfo[0].astype('int64')
+dst = EdgeInfo[1].astype('int64')
+nodes_idx = NodeInfo[0].astype('int64')
+remap(src, dst, nodes_idx)
+features = NodeInfo[1].astype('float32')
+labels = NodeInfo[2].astype('int64')
+g = dgl.graph((src, dst))
+g.ndata['feat'] = torch.tensor(features)
+g.ndata['label'] = torch.tensor(labels)
+return g
+```
+The results are converted to the required format to fit the training format.
+
+### 6.4. Build the GCN model
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+def build_model():
+    in_size = feature_len  # feature_len is the length of features, which is 1433 here
+    out_size = classes  # classes is the number of classes, which is 7 here
+    model = GCN(in_size, 16, out_size)  # 16 is the size of the hidden layer
+    return model
+```
+In this tutorial, a two-layer Graph Convolutional Network (GCN) will be built. Each layer aggregates neighbor information to compute new node representations.
+
+### 6.5. Train the GCN model
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #If you need to save the model, give the model save path
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+As shown in the code, iterative training is performed 50 times according to the defined sampler, optimizer and model, and the trained model is saved to the path model_save_path.
+
+The output is as follows:
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+The graph learning module can be accelerated by using a GPU. If users want to run it on the GPU, they need to install the corresponding GPU driver and environment. For details, please refer to learn/README.md.
+
+The complete code can be found in learn/examples/train_full_cora.py.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..f769293858
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# Data Migration
+
+## 1 Introduction
+Data migration refers to the process of moving data from one system, storage medium, or application to another system, storage medium, or application. When TuGraph needs to be upgraded or the system hardware environment changes,
+The data in the original TuGraph service needs to be migrated. Based on the system hardware environment and software version, this paper divides data migration into three schemes:
+1. Compatible migration: When the system environment before and after the migration is consistent and the TuGraph software is compatible, you can directly use the backup and recovery method to migrate data;
+2. Upgrade and migration: When the system environment before and after the migration is inconsistent or the TuGraph software is not compatible, it is necessary to migrate the data by first exporting the data and then re-importing;
+3. Online migration: When data migration is performed on a high-availability cluster and the network environment of the cluster is good, the original cluster can be smoothly switched to the new cluster by adding or deleting nodes.
+The following article will introduce these three schemes in detail.
+
+## 2. Compatible Migration
+Compatible migration means that when the system environment remains unchanged and the TuGraph software version is compatible, the data and stored procedures of the original service can be used in the new service, so it can be directly migrated.
+Users can first use the `lgraph_backup` tool to back up the data, then transfer the data to a new machine and restart the service. The specific migration steps are as follows:
+
+### 2.1. Backup data
+Backup data using `lgraph_backup` tool
+```bash
+   lgraph_backup -s db -d db.bck
+```
+You can also directly use the `cp` command in this step, but the `cp` command will copy some redundant metadata, and the raft metadata will also be copied in the HA mode, causing the cluster to fail to restart after migration.
+Therefore, it is recommended to use the `lgraph_backup` tool instead of the `cp` command during data migration.
+
+### 2.2. Start a new service
+Use the following command to start the new service, and the stored procedure will be automatically loaded into the new service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. Stop the original service
+Use the following command to stop the original service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. Upgrade migration
+When the user wants to migrate the original service to a differentiated environment (such as migrating from centos7 to ubuntu18.04), or when the version of TuGraph changes greatly and is incompatible (such as 3.4.0 and 3.6.0),
+Users can first use the `lgraph_export` tool to export the data into a file, transfer it to a new machine, and then use the `lgraph_import` tool to re-import and restart the cluster.
+This can ensure that it can be used in the new environment, but the efficiency is low, and the stored procedure needs to be reloaded. The specific migration steps are as follows:
+
+### 3.1. Export data
+Use the `lgraph_export` tool to export the data and transfer the data to the new machine
+```bash
+   lgraph_export -d db -e db.export
+```
+
+### 3.2. Import data
+Use the `lgraph_import` tool to import data and manually load the stored procedure (see [client operation steps](../7.client-tools/2.cpp-client.md) for details)
+```bash
+   lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. Start a new service
+Start the new service with the following command
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. Stop the original service
+Use the following command to stop the original service
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. Online Migration
+When performing data migration on the server cluster deployed by the high-availability version of TuGraph, if the network bandwidth is sufficient, you can directly migrate the service online by adding or deleting nodes. The specific migration steps are as follows:
+
+### 4.1. Copy data
+Use the following commands to copy the data on the leader node and transfer it to the machine nodes of the new cluster. Since the leader node has the most complete raft log, copying the leader's data can minimize
+The time for the log to catch up.
+```bash
+   cp -r db db.cp
+```
+### 4.2. Starting a new node
+Use the following command to join the new node to the cluster. After joining the cluster, the incremental data will be automatically synchronized to the new node
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. Stop the original node
+Stop the original node service, and send subsequent application requests directly to the new cluster
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..62f7a61957
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# Environment and version selection
+
+> This document introduces how to select the system environment and deployment method
+
+## 1 Introduction
+
+TuGraph provides differentiated system environments and deployment methods for users with different needs to meet the needs of different users such as novices, system developers, production operation and maintenance personnel, and researchers.
+
+## 2. Environmental capability selection
+
+Users can choose different environments based on actual usage scenarios. The compilation environment has the most complete capabilities and requires more third-party software. Correspondingly, the streamlined operating environment requires almost no installation of any dependent libraries and can run TuGraph's basic functions except stored procedures.
+
+| Environment                      | Purpose                                     | Remarks                                 |
+|----------------------------------|---------------------------------------------|-----------------------------------------|
+| Compilation environment          | Compile TuGraph from source                 | For developers                          |
+| Running environment              | Run TuGraph installation package            | Applicable to most users                |
+| Simplified operating environment | Run simplified TuGraph installation package | Less dependence on the operating system |
+
+For a detailed introduction to different environments, see [link](../5.installation&running/2.environment-mode.md).
+
+## 3. Deployment method selection
+
+TuGraph deployment only requires one server (high availability mode requires multiple servers), and you can choose a suitable deployment method based on actual resource conditions and usage scenarios.
+
+| Deployment method | Description | Remarks |
+|----------|-----------------------|--------------- -------------------------------------------------- --------------------------|
+| Cloud deployment | Alibaba Cloud Computing Nest one-click deployment, free trial | Suitable for novices, process reference [Link](../5.installation&running/5.cloud-deployment.md) |
+| Docker deployment | Cross-platform deployment through pre-prepared Docker images | Users with hardware requirements, such as performance testing, please refer to [link](../5.developer-manual/1.installation/3.docker-deployment. md) |
+| Local deployment | Tightly coupled deployment in existing systems | Applicable to specified production environment, refer to the process [Link](../5.installation&running/4.local-package-deployment.md) |
+
+## 4. Next steps
+
+After the deployment is completed, you can proceed to [Start Service](../5.installation&running/7.tugraph-running.md) and [Data Import](../5.developer-manual/3. server-tools/1.data-import.md) and other operations, you can also experience the entire process through [Sample Data](../3.quick-start/2.demo/1.movie.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..4292d5488f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Best Practices
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/14.faq.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/14.faq.md
new file mode 100644
index 0000000000..48704dfccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/14.faq.md
@@ -0,0 +1,58 @@
+# FAQ
+
+During the use of TuGraph, if you encounter problems, you can first check [User Documentation](https://github.com/TuGraph-db/tugraph-db/tree/master/doc/zh-CN). Second, check to see if the FAQ list below matches your question.
+
+1. **[Kernel Engine QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussion-4575385)**
+   
+   1.1 [Does the edge of TuGraph support index? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165379)
+   
+   1.2 [What is the QPS of a single TuGraph machine? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussion-4575381)**
+   
+   2.1 [How to update the tugraph service after the visualization file is built? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165364)
+   
+   2.2 [How to connect the existing tugraph service through npm run dev? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165366)
+   
+   2.3 [TuGraph Browser version 3.3.0 failed to delete node label? ](https://github.com/TuGraph-db/tugraph-db/discussions/82#discussion-4465791)
+3. **[Client QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussion-4575378)**
+   
+   3.1 [What programming languages ​​does the client currently have, and does it support node js? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165351)
+   
+   3.2 [Does the python client support pip install? Where is the client referenced? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165353)
+4. **[Data Import QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussion-4575373)**
+   
+   4.1 [Which common databases can TuGraph connect to? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165335)
+   
+   4.2 [How to import data? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[Stored Procedure QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussion-4575369)**
+   
+   5.1 [How to load stored procedure or algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165313)
+   
+   5.2 [How to call or execute the stored procedure? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165317)
+   
+   5.3 [Where is the open source built-in algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[Installation and deployment QA summary](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussion-4575364)**
+   
+   6.1 [How to install using docker image? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165287)
+   
+   6.2 [After the rpm package and deb package are installed, start the lgraph_server service. Prompt missing 'liblgraph.so' error? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165289)
+   
+   6.3 [How to compile TuGraph on Mac's M1 chip? ](https://github.com/TuGraph-db/tugraph-db/discussions/47#discussion-4393165)
+   
+   6.4 [How to Handle Error: 'jemalloc: Unsupported system page size'? ](https://github.com/TuGraph-family/tugraph-db/issues/477)
+7. **[Cypher QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussion-4575018)**
+   
+   7.1 [Does it support conditional query of indefinite length? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165252)
+   
+   7.2 [How to query the shortest path, how to use the shortestPath function? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165256)
+   
+   7.3 [Using and after the query statement Where to splice the query speed is slow, how should the statement be optimized and improved? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165260)
+   
+   7.4 [How to query the edge of any jump? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165262)
+   
+   7.5 [Is there a date() function in Cypher? ](https://github.com/TuGraph-db/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA Summay](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+   
+   8.1 [What should I do after the error "User has reached the maximum number of tokens" is reported? ](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+If the problem is still not resolved, we recommend you follow up or create a new thread describing your problem. At the same time, the TuGraph QA summary will be updated regularly based on the posts initiated by everyone in the discussion area.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/15.contacts.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/15.contacts.md
new file mode 100644
index 0000000000..fb28a5f1aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/15.contacts.md
@@ -0,0 +1,17 @@
+# Contacts
+
+If you have any feedback or suggestions for the product, You are welcome to join the discussion or make suggestions through the following contact methods.
+
+Official website: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue:
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions:
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack:
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+Contact us via dingtalk, wechat, email and telephone:
+![contacts](../../images/contact-en.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..549043a94c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,15 @@
+# What is Graph
+
+The graph that we're going to introduce today, it's neither a picture, nor a diagram，it's a class of mathematics called graph theory. We can see on the screen that there are two graphs on the left and right, which represent things and their relationship. We abstract it out in a form, and we call such a form a graph.
+
+![alt what is graph](../../../images/what-is-graph-en.png)
+
+The basic elements of a graph are a vertex, and an edge, a vertex is a representation of the thing, of the entity, and an edge is a representation of the relationship between them.
+
+We see the graph on the left, the dots have companies, they have employees, and they have projects. What are their sides? The relationship between the company and the employees is an employment relationship, and there can be a friend relationship between the employees, and there can be a participation relationship between the project and the employees. That is, we can use graphs to abstract things and their relationships.
+
+The diagram on the right is a schematic diagram of a financial transaction. Each of us has a bank account, and when our bank account makes a consumption or makes a transfer, this account is the point on the graph, and this edge can indicate that there is such a transfer relationship between us.
+
+We can also see from this example that edges can attach information and points can attach information. The point can attach which bank this account is in and what the account is. The value of the transaction can be attached to the edge, and many times, if your transaction is large, it indicates that special attention is needed. This edge might not necessarily be the amount of a particular transfer, it might be the amount accumulated over a period of time and so on. Graphs can actually be very expressive.
+
+On the other hand, for a graph like finance, it can be very large. There could be more than a billion points, a hundred billion or even a trillion edges. As you can imagine, it's actually quite challenging to actually work with these graphs.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..935aa4ffa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# What is a graph database
+
+> This document mainly introduce what is a graph database, the advantages of graph database compared with relational database, and the comparison between graph database and relational database
+
+## 1. Introduction
+
+Graph database is a database based on graph model. The main function of graph database is to manage graph data, so it needs to support efficient vertex/edge query and update; To facilitate user use, it is usually necessary to add transaction support to ensure the normal operation of concurrent operations.
+
+## 2. Advantages of graph databases over relational databases
+
+The function of graph database is an extension of traditional relational database. Compared with relational database, the graph structure supported by graph data is more flexible. Graph database is different from other databases in terms of data addition, deletion, query and modification based on graph. On the operation abstraction of graph data, a vertex-based perspective is adopted, for example, a vertex accesses its neighboring vertices through all its outgoing edges. This kind of operation is also the core of the design of graph database system.
+
+The uniqueness of graph database can be reflected in the following three aspects:
+
+### 2.1 Performance
+
+Handling the relationship between data, it is inevitable to use table JOIN operation in relational database, which has a great impact on performance. Graph database is a direct access, similar to pointer access, which is more efficient operation of associated data, compared with relational database performance improvement of 2 to 4 orders of magnitude.
+
+### 2.2 Compatibility
+
+In reality, the process of a project is often evolutionary. The content and even the format of the data are constantly changing. In a relational database, this means that a change in the table structure, or the creation of multiple new tables, significantly changes the source data. In the graph database, you simply add new vertices, edges, and attributes, and set them to the corresponding types. In essence, a table represents a type of data, and a vertex represents a specific data, meaning that relational databases pay more attention to the type of data, while graph databases pay more attention to the individuals of data and identify their association relationships.
+
+### 2.3 Intuitive
+
+Using graphs (or nets) to express real-world relationships is more straightforward and natural, especially in the Internet of Things era. If relational data used, a high degree of abstract thinking required to build a table of characters first, then a table of relations, and finally a map of data. When analyzing and querying the graph data, you can also intuitively find the desired data interactively through the point-edge connection topology, without any professional knowledge.
+
+## 3. Comparison between graph database and relational database
+
+| classification      | model           | advantage                                                            | disadvantage                                                                 | example        |
+| ------------------- | --------------- | -------------------------------------------------------------------- | ---------------------------------------------------------------------------- | -------------- |
+| Relational database | Table structure | Data is highly structured, consistent, and software maturity is high | The multi-hop association query is inefficient or not supported              | MySQL、Oracle  |
+| Graph database      | graph structure | Modeling and manipulating associations is very efficient             | Highly structured data processing is not as powerful as relational databases | Neo4j、TuGraph |
+
+In a word, in the face of massive data storage and processing problems, the traditional relational database has been unable to meet most of the daily data storage needs. Graph database technology can store relational information as entities and expand data model flexibly. Because it provides the most direct expression of related data, and the graph model is naturally tolerant to heterogeneous data. In the future, graph database technology will become one of the most popular technologies, which will provide powerful support for enterprises to store and analyze large-scale graph data.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..da6cbf6318
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,46 @@
+# What is TuGraph
+
+> This document mainly introduces the main features and characteristics of TuGraph Community Edition, as well as the differences between TuGraph Enterprise Edition and Community Edition.
+
+
+## 1.Introduction
+
+Graph database is a non-relational database that stores data by vertices and edges. It can be used to store complex data network models, such as social networks and transaction networks. TuGraph is a graph database developed by Ant Group. This manual introduces the functions and usage of TuGraph.
+
+## 2.TuGraph Community Edition
+
+The Community Edition is a fully functional version of TuGraph, suitable for single-instance deployment. It provides complete basic fuctions of graph database, such as ACID-compatible transactions, programming APIs, and associated tools. It is ideal for learning TuGraph and implementing small projects.
+
+## 3.TuGraph features
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property graph model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+## 4.TuGraph Enterprise Edition
+
+The Enterprise Edition has more comprehensive support for commercial features, including distributed cluster architecture, a one-stop graph platform covering exploration, research and development, service and operation and maintenance throughout the lifecycle, online, near-line, and offline graph computing engines, support for streaming and big data data sources, multi-site and multi-center deployment, making it an ideal choice for commercial solutions.
+
+```text
+    If you need to implement production-level high-availability cluster architecture, operation and maintenance and other enterprise-level services, please contact us to obtain commercial support:
+    Email:tugraph@service.alipay.com
+    Tel:0571-85022088,extension number 83789993#
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..62fcb093be
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/4.schema.md
@@ -0,0 +1,159 @@
+# TuGraph schema  Instructions
+## 1.The data model
+
+### 1.1.Graph model
+TuGraph is a strong schema, directed property graph database with multi-graph capability.
+
+- Graph Project: Each database service can host multiple graph projects (multi-graphs), and each graph project can have its own access control configuration. The database administrator can create or delete specified graph projects.
+- Vertex: Refers to entity, generally used to express real-world entities, such as a movie or an actor.
+    - Primary Key: User-defined vertex data primary key, unique in the corresponding graph project and vertex type.
+    - VID: Refers to the auto-generated unique ID of the vertex, which cannot be modified by the user.
+    - Upper Limit: Each graph project can store up to 2^(40) vertex data.
+- Edge: Used to express the relationship between vertexs, such as an actor appears in a movie.
+    - Directed Edge: The edge is a directed edge. If you want to simulate an undirected edge, the user can create two edges with opposite directions.
+    - Duplicate Edge: TuGraph currently supports duplicate edges. If you want to ensure the uniqueness of the edge, you need to implement it through business policies.
+    - Upper Limit: Up to 2^(32) edge data can be stored between two vertex data.
+- Property Graph: vertexs and edges can have properties associated with them, and each property can have a different type.
+- Strong-typed: Each vertex and edge has only one label, and after creating a label, there is a cost to modify the number and type of attributes.
+    - Specify the starting/ending vertex type of the edge: You can limit the starting and ending vertex types of the edge, and support different vertex types of the starting and ending vertexs of the same type of edge, such as individuals transferring money to companies, companies transferring money to companies. After specifying the starting/ending vertex type of the edge, you can add multiple sets of starting/ending vertex types, but you cannot delete the restricted starting/ending vertex types.
+    - Unrestricted Mode: Supports creating edge data of this type between any two vertex types without specifying the starting and ending vertex types of the edge. Note: After specifying the starting/ending vertex type of the edge, the unrestricted mode cannot be used again.
+
+### 1.2.The data type
+
+TuGraph Supports a variety of data types that can be used as attributes, the specific supported data types are as follows:
+
+<caption>Table 1. TuGraph supported data types</caption>
+
+| **Type** | **Min**             | **Max**             | **Description**                                  |
+|----------|---------------------|---------------------|--------------------------------------------------|
+| BOOL     | false               | true                | Boolean                                          |
+| INT8     | -128                | 127                 | 8-bit int                                        |
+| INT16    | -32768              | 32767               | 16-bit int                                       |
+| INT32    | - 2^31              | 2^31 - 1            | 32-bit int                                       |
+| INT64    | - 2^63              | 2^63 - 1            | 64-bit int                                       |
+| DATE     | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" Date of format                      |
+| DATETIME | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD hh:mm:ss[.ffffff]"Format of the date and time |
+| FLOAT    |                     |                     | 32-bit float                                     |
+| DOUBLE   |                     |                     | 64-bit float                                     |
+| STRING   |                     |                     | A string of variable length                      |
+| BLOB     |                     |                     | Binary data                                      |
+| POINT    |                     |                     | EWKB format data of point                        |
+| LINESTRING |                   |                     | EWKB format data of linestring                   |
+| POLYGON  |                     |                     | EWKB format data of polygon                      |
+
+_BLOB data is BASE64 encoded in input and output_
+
+### 1.3.Index
+
+TuGraph supports indexing vertex fields.
+
+Indexes can be unique or non-unique. If a unique index is created for a vertex label, TuGraph will perform a data integrity check to ensure the uniqueness of the index before modifying the vertex of the label.
+
+Each index built on a single field of a label, and multiple fields can be indexed using the same label.
+
+BLOB fields cannot be indexed.
+
+TuGraph supports creating indexes on node or edge attributes to improve query efficiency. Its characteristics are as follows:
+- Indexes include single indexes and composite indexes. A single index is created based on a single property of a node or an edge, while a composite index is created based on multiple properties of a node or an edge (no more than 16). Indexes can be created on multiple sets of properties for the same node or edge.
+- If a unique index is created for a node label, when modifying a node for that label, a data integrity check is first performed to ensure the uniqueness of the index.
+- Attributes of type BLOB cannot be indexed.
+
+There are multiple index types for TuGraph's vertices and edges. Different index types have different functions and restrictions, as follows:
+
+#### 1.3.1 Single index
+#### 1.3.1.1 Node index
+##### 1.3.1.1.1 unique index
+
+The unique index of a node refers to a globally unique index. That is, if a unique index is set for an attribute, in the same graph, the attribute of nodes with the same label will not have the same value.
+The maximum length of a unique index key is 480 bytes. **Unique indexes cannot be created for attributes exceeding 480 bytes**.
+Primary is a special unique index, so the maximum key length is also 480 bytes.
+
+##### 1.3.1.1.2 non_unique index
+
+The non_unique index of a node refers to a non-global unique index, that is, if an attribute is set with a non_unique index,
+In the same graph, nodes with the same label can have the same value for this attribute.
+Since a key in a non_unique index may be mapped to multiple values, in order to speed up search and writing,
+The maximum value of a group of vids with the same index key is added after the user-specified key.
+Each vid is 5 bytes long, so the maximum length of a non_unique index key is 475 bytes.
+However, unlike unique indexes, non_unique indexes can also be established if they exceed 475 bytes.
+However, when indexing such an attribute, only **the first 475 bytes** will be intercepted as the index key (the value stored in the attribute itself will not be affected).
+Moreover, when traversing through an iterator, the first 475 bytes of the query value are automatically intercepted before traversing.
+Therefore, the results may be inconsistent with expectations and require users to filter again.
+
+#### 1.3.1.2 Edge index
+
+##### 1.3.1.2.1 unique index
+
+Similar to node, the unique index of an edge refers to a globally unique index. That is, if an attribute is set to a unique index, in the same graph, the attribute of the edge with the same label will not have the same value.
+The maximum length of a unique index key is 480 bytes. **Unique indexes cannot be created for attributes exceeding 480 bytes**.
+
+##### 1.3.1.2.2 pair_unique index
+
+pair_unique index refers to the unique index between two nodes, that is, if an attribute sets a unique index, between the same set of the starting node and the ending node in the same graph,
+Edges with the same label will not have the same value for this attribute. In order to ensure that the pair_unique index key does not repeat between the starting node and the end node of the same group,
+The index adds the starting and ending vids after the user-specified key. Each vid is 5 bytes in length.
+Therefore, the maximum key length is 470 bytes, and **a pair_unique index cannot be created for attributes exceeding 470 bytes**.
+
+##### 1.3.1.2.3 non_unique index
+
+Similar to node, the non_unique index of an edge refers to a non-global unique index, that is, if an attribute sets a non_unique index,
+In the same graph, edges with the same label can have the same value for this attribute.
+Since a key in a non_unique index may be mapped to multiple values, in order to speed up search and writing,
+The maximum value of a group of eids with the same index key is added after the user-specified key.
+Each eid is 24 bytes in length, so the maximum length of a non_unique index key is 456 bytes.
+However, unlike unique indexes, non_unique indexes can also be established if they exceed 456 bytes.
+However, when indexing such an attribute, only **the first 456 bytes** will be intercepted as the index key (the value stored in the attribute itself will not be affected).
+Moreover, when traversing through an iterator, the first 475 bytes of the query value are automatically intercepted before traversing.
+Therefore, the results may be inconsistent with expectations and require users to filter again.
+
+#### 1.3.2 Composite index
+
+Currently, composite indexes are only supported for multiple properties of a vertex, and not supported for properties of an edge. There are two types of composite indexes: unique indexes and non-unique indexes. The requirements for creating a composite index are as follows:
+1. The number of properties for creating a composite index should be between 2 and 16 (inclusive).
+2. For a unique composite index, the sum of the lengths of the properties cannot exceed 480 - 2 * (number of properties - 1) bytes, while for a non-unique composite index, it cannot exceed 475 - 2 * (number of properties - 1) bytes.
+
+##### 1.3.2.1 Unique index
+Similar to a vertex's single unique index, a vertex's composite unique index refers to a globally unique index, meaning that for a set of properties with a unique index, there will not be another vertex with the same label in the same graph that has the same value for that group of properties.
+Due to the underlying storage design, the composite index key needs to retain the length of the properties; therefore, the maximum length for a composite unique index key is 480 - 2 * (number of properties - 1) bytes. Properties exceeding this length cannot be indexed uniquely.
+
+##### 1.3.2.2 non_unique index
+Similar to a vertex's single non-unique index, a vertex's non-unique index refers to a non-globally unique index, meaning that for a set of properties with a non-unique index, different vertices with the same label in the same graph may have the same value for that group of properties.
+Since a non-unique index key may map to multiple values to accelerate lookups and writing, the maximum value from a group of vertex IDs (vid) has been appended to the user-specified key where the index keys are identical. Each vid is 5 bytes in length; thus, the maximum length for a non-unique index key is 475 - 2 * (number of properties - 1) bytes. Properties exceeding this length cannot be indexed non-uniquely.
+
+## 2. Graph Project, Vertex, Edge, and Attribute Naming Conventions and suggestions
+
+### 2.1 Naming Rules
+Graph projects, vertices, edges, and attributes are identifiers. This section describes the allowed syntax for identifiers in TuGraph.
+The table below describes the maximum length and allowed characters for each type of identifier.
+
+|**Identifier** |**Length** |**Allowed Characters**|
+|---------  |---------  |---------  |
+|User, role, graph project	|1-64 characters	|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+|Vertex type, edge type, attribute	|1-256 characters		|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+
+### 2.2 Usage Restrictions
+
+|**Description**|	**Maximum number**|
+|-------- |--------- |
+|Number of users, number of roles	|65536|
+|Number of graphs	|4096|
+|Number of vertex and edge types per graph	|4096|
+|Number of attributes per type	|1024|
+
+Note:
+1.Special characters and keywords: When using special characters or keywords, they need to be enclosed in backquotes (``) for reference;
+
+Example: ```match (`match`:match) return `match`.id limit 1```
+
+2.Case sensitivity: TuGraph is case-sensitive;
+
+3.Graph project, vertex/edge, and attribute names can be reused, but attribute names under the same vertex or edge cannot be duplicated;
+
+4.Reserved keywords for attribute names: SRC_ID / DST_ID / SKIP.
+
+### 2.3 Naming Suggestions
+|**Identifier**|**Description**|**Suggestions**|
+|-------|-------|--------|
+|Graph project	|Start with a letter or Chinese character	|Examples: graph123, project123, etc.|
+|Vertex/edge type	|Start with a letter or Chinese character and use underscores to separate words		|Examples: person, act_in, etc.|
+|Attribute	|Letters or Chinese characters	|Examples: name, age, etc.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..de894fa1b0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# Performance Oriented
+
+> This document mainly introduces TuGraph's performance-oriented design philosophy as an open-source graph database.
+
+## 1.Introduction
+
+TuGraph is currently the fastest graph database in the world, ranking first in the LDBC SNB Interactive graph database standard evaluation (March 2023). The design of TuGraph is based on performance optimization, and is committed to building a high-performance single-machine graph database. This document describes the core design of TuGraph's storage layer based on performance optimization.
+
+## 2.Characteristics of Graph Operations
+
+Operations on property graphs involve reading, writing, and their attributes, and the access patterns of some special attributes such as timestamps can also affect overall performance. Here, by summarizing the regularities of some graph operation characteristics, we can guide the final performance.
+
+We observe that many graph applications have similar data access patterns. For example, in credit risk control, we use recursive path filtering to search for many-to-one patterns to find suspicious credit fraud users and behaviors. For online gambling, we can identify gambling-related fund accounts by recognizing multiple fund transfers in a short period of time. The equity penetration scenario recursively calculates the equity relationship between entities. These scenarios have common patterns such as multi-hop entity and relationship access, time window constraints, and read/write transactions.
+Furthermore, from the discussion in the introduction and the analysis of graph workloads, the following characteristics can be summarized:
+
+**Characteristic 1** KHop is the most typical operation in a graph, based on the data access pattern of the graph topology of points and edges, and has essential differences from relational databases. The typicality of KHop is not only reflected in the different data access patterns, but it is also the performance point that graph databases need to pay attention to the most.
+
+**Characteristic 2** Data access of graph workloads has a certain degree of locality on the topology, and the edges of the same point are usually accessed simultaneously. When the labels of these edges are the same, there is a greater probability of simultaneous access.
+
+**Characteristic 3** When accessing points and edges in graph workloads, their corresponding attributes are usually accessed as a traversal filter condition.
+
+**Characteristic 4** In time-based graph workloads, filtering of points and edges is usually within a certain time range, such as the past week.
+
+**Characteristic 5** Write operations may be accompanied by a large number of read operations, which need to be processed in a single transaction cycle.
+
+Through the analysis of actual online graph applications, the read/write ratio of graph workloads is about 20:1, although the scenarios are limited to the financial field and the number of clusters is also limited, the scale of the data involved and the number of users are very large, which is representative to some extent. The 20:1 read/write ratio of graph workloads indicates that the impact of read workload on overall performance is greater, and the performance of write workload cannot be ignored either.
+
+## 3.Storage Data Structures
+
+TuGraph uses B+ trees as the underlying data structure to support real-time transactional operations for insertion, deletion, querying, and updating.
+
+In sorting tree data structures, B+ trees and LSM trees are the main representatives. B+ trees use a split and merge method to update sorted data in tree nodes, while LSM trees append updates to logs for delayed data merging. B+ trees were originally used in file system implementations, solving the problem of differences in performance between sequential and random operations on hard disks by storing data in adaptive-length leaf nodes, and have a relatively balanced read/write performance. The main advantage of LSM trees is to use WAL (Write Ahead Log) to perform updates, which turns update operations into sequential operations, especially in the case of small key-value pairs. WAL means that the update of data is deferred until it is merged in batches, which can improve the comprehensive efficiency of batch updates, but also makes the system scheduling more complicated. If the update merge is not completed, and the data is read again, LSM trees need to read several levels of locally merged logs, which will cause read amplification and space amplification, thereby affecting read efficiency.
+
+To sum up, B+ trees have better sequential read/write performance, while LSM trees have advantages in random write data. In addition, the way of LSM trees using background merging makes the performance fluctuation difficult to predict, and the correlation between performance fluctuation and upper-level storage and computation is weak, which increases the overall design cost. Considering the above factors, TuGraph chooses B+ trees as the implementation for read performance optimization.
+
+## 4.Data Encoding
+
+For property graph models, in addition to graph topology encoding, property data also greatly affects functionality and performance. We first discuss how property data can be encoded together with topology data. From current research, there are two ways of encoding properties: discrete encoding, which stores property data separately based on pointer indexes, and compact encoding, which packs property data and topology data together. Discrete encoding can store each property separately or pack each edge's properties separately, and the following discussion applies to both situations.
+
+Vertex Query: Property encoding mainly focuses on edges and does not involve vertex queries.
+
+Single-Edge Query: Discrete encoding locates edges through pointers, while compact encoding requires binary search to locate the edge position. Discrete encoding has a slight advantage.
+
+Edge Traversal: Discrete encoding requires constant random access through pointer jumps during edge traversal, while compact encoding arranges data together in advance, greatly improving efficiency due to its sequential access feature. Since edge traversal operations are common according to Rule 3, compact encoding has obvious advantages in edge traversal.
+
+Single-Edge Update: Discrete encoding only requires finding the corresponding pointer position and modifying the pointer's location before and after inserting data. Compact encoding needs to re-encode the compactly arranged data and rewrite the entire edge value, resulting in significant overhead compared to discrete encoding.
+
+Batch Edge Update: Batch updates can pre-build all edge properties for a vertex in memory and write them in one encoding, making both discrete encoding and compact encoding equivalent. However, compact encoding does not require storing pointer variables, so it has higher storage space efficiency.
+
+The performance issues of discrete encoding and compact encoding for a certain type of query discussed above can be alleviated through optimization. Overall, due to the 20:1 read-write load of graphs and the characteristics of property access revealed by Rule 3, TuGraph tends to use compact encoding to ensure read performance. Its main weakness is the overhead of re-encoding during single-edge updates, which can be solved using adaptive mapping technology.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3407932273
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,33 @@
+# Multi Level Interfaces
+
+> This document mainly introduces the design concept of TuGraph's multi-level interfaces.
+
+## 1.Introduction
+
+The multi-level interface is a balance between usability and high performance that TuGraph has designed to meet a variety of use cases. For example, Cypher, a declarative graph query language, can abstract away the implementation details of a graph database and express queries based on the graph model. However, Cypher's high-level descriptions cannot be efficiently translated into low-level execution, so TuGraph provides a procedural language, Procedure API, to achieve optimal database performance.
+
+Interfaces can be roughly divided into client interfaces and server interfaces. Most operations are performed on the server, and the client only does data encapsulation and parsing. The client and server are connected through a network, and TuGraph supports both flexible short-connection REST protocol and more efficient long-connection RPC protocol, which can be selected according to different business scenarios.
+
+The server interfaces are all at the calculation layer and are logically separated from the graph data storage by a Core API layer.
+
+![Multi Level Interfaces](../../../../images/multi-level-Interfaces-en.png)
+
+### 2.Client Interface
+
+The client interface refers to the interface executed on the client and is typically used for integration into software applications. TuGraph's client interface is relatively simple, including login/logout, data import/export, stored procedure loading and calling, and Cypher operations. Cypher integrates most of the functions, including data operations, graph model operations, operations and account management.
+
+Since the parameters and return values of Cypher are strings, JAVA OGM is a structured wrapper for Cypher, meaning that query results can be encapsulated into a typed object for ease of use.
+
+### 3.Server Interface
+
+The server interface includes Cypher, Procedure API, OLAP API, and GNN PI, which provide services for graph transaction engines, graph analysis engines, and graph neural network engines. The characteristics of each interface are explained in detail below.
+
+> __Cypher__ is an abstract description of query logic that is independent of execution logic and is more user-friendly for graph database applications, similar to the SQL language of relational databases. TuGraph's Cypher language mainly follows the OpenCypher query standard open-sourced by Neo4j and extends auxiliary functions such as operations and maintenance management. Descriptive graph query language will become the main data operation method for graph databases, but generating the optimal execution plan between description and execution still requires a long way to go in both academia and industry.
+
+> __Procedure API__ is designed to bridge the gap between descriptive graph query language and optimal performance. TuGraph's Procedure API provides a simple wrapper on top of the Core API, which maximizes the storage's performance efficiency and is the upper limit of Cypher optimization performance. Python Procedure API is a cross-language wrapper on top of C++ Procedure API, but the copying of values during translation may result in some performance loss, and its advantage lies mainly in the ease of use of the Python language. The traversal API is a parallel-executing Procedure interface that is more similar to set operations in terms of description, such as expanding all outgoing neighbors of a point set to obtain a new point set.
+
+> __OLAP API__ belongs to the category of "graph computing systems" and exports snapshots of graph data from storage that supports insert, update, delete, and query operations to support read-only complex graph analysis in a more compact data storage format. OLAP API encapsulates data structures that support high-concurrency execution, including Vector, Bitmap, and CSR-based graph snapshot data structures, and provides a set of concurrent fast point-edge operation frameworks. After the graph analysis task is completed, the data can be written back to the graph database through the interface.
+
+> __GNN API__ mainly provides the interfaces needed for graph neural network applications and can be integrated with machine learning frameworks such as PyTorch. TuGraph's GNN PI mainly integrates DGL and completes the entire process from graph storage to graph neural network application in the Python language environment.
+
+Except for Cypher's interpretive execution, all other server interfaces are compiled and executed, meaning that the corresponding code needs to be sent to the server and compiled (which may take some time) before execution on the server. Therefore, it is usually necessary to load the program first, then find it in the list of loaded applications, and execute it after passing in the input parameters.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..080cc02e48
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> This document mainly introduces the design philosophy of TuGraph's HTAP.
+
+## 1.Introduction
+
+![htap](../../../../images/htap-en.png)
+
+There are different ways to implement HTAP in architecture: one is to use two different copies to handle OLTP and OLAP tasks separately, with the core being data consistency synchronization and additional resource overhead; the other is to use the same data storage at all times, but this implementation has memory bloat in its data structure and needs further work for industrialization. In TuGraph's design, simple OLAP and OLTP operations share the same data, while complex OLAP operations are exported and handled separately as snapshots.
+
+## 2.Design
+
+In TuGraph, OLTP is the graph transaction engine, corresponding to transaction operations in Figure; OLAP is the graph analysis engine, corresponding to simple graph analysis operations (such as SPSP) and complex graph analysis operations (such as PageRank), the former of which can be executed directly on the graph storage, while the latter requires exporting a snapshot for execution.
+
+- Transaction operations, measured by the graph transaction engine, are local graph add, delete, query and modify operations, typically used for K-hop access.
+- Simple analysis operations are the simpler part of the graph analysis engine, usually local graph analysis operations, such as the shortest path algorithm SPSP and Jaccard algorithm.
+- Complex analysis operations are the more complex part of the graph analysis engine, usually involving multi-round data iteration operations across the entire graph, such as the PageRank algorithm for webpage ranking and the Louvain algorithm for community discovery.
+
+As shown in Figure , external storage is added to the architecture diagram, making the data source for graph analysis not limited to the graph database and can be directly read from text files.
+
+- Graph storage, which is the storage in the graph database, has carefully designed data structures that can perform real-time add, delete, query and modify operations.
+- External storage, which can be an RDBMS or text file, is stored in a simple way as an edge table, only for one-time batch reading and batch result writing. In the calculation layer, it corresponds to the interface in the overall architecture diagram.
+- Cypher, the declarative graph query language, can be executed concurrently.
+- Procedure API, the procedural graph query language, is flexible and can support both transaction operations and graph analysis operations, but its efficiency is not sufficient to complete complex graph analysis operations, and it can be executed concurrently.
+- OLAP API, for multi-round iteration of complex graph analysis. Applications need to first export the graph data in storage into a snapshot in memory, which is only used for fast access and does not need to consider the write support of ACID, so it can be arranged more compactly, and the read efficiency of CSR arrangement is much higher than that of graph storage data arrangement. OLAP API can only be executed serially, and each operation uses full CPU resources.
+
+OLAP API snapshots can be created from external storage, where the edge table data is formatted as CSR, or from the graph storage. It should be noted that OLAP API requires that the IDs of the vertices be consecutive natural numbers, which may require additional ID mapping. This step can be mapped to a specified attribute when creating a snapshot or directly using the attribute value as the ID.
+
+Corresponding to the calculation interface and storage, there are four operating modes.
+
+- Transaction mode, each operation corresponds to a Cypher statement, which is a transaction by default.
+- Plugin mode, call through plugins, after the calculation logic is loaded on the server, also known as stored procedures.
+- Embed mode, which has the same interface as Plugin mode but the graph database service does not need to be started and can directly call the data in the database through the interface. This mode is usually used for debugging Procedure API and OLAP API code, and the debugging information and operation steps are more friendly than Plugin mode.
+- Standalone mode, which maximally separates from the graph database, is more direct when only using the graph analysis engine for data analysis. Standalone mode will directly use the data of the external storage.
+
+The use of the graph neural network engine is similar to the 'complex graph analysis operation', which calls part of the OLAP API and GNN API at the same time, which is not elaborated here.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..b42c13eac8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Characteristics
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..198facd84b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# Architecture
+
+> This document mainly introduces the product architecture of TuGraph.
+
+## 1.Introduction
+
+![Architecture](../../../images/architecture-en.png)
+
+The following diagram shows the overall architecture of an enterprise-level graph database from the perspective of functional modules, using TuGraph as an example, from bottom to top:
+
+- Software and hardware environment. This involves the development and use environment of the graph database. TuGraph is mainly developed based on the underlying C++ language, and is compatible with most operating systems and CPUs on the market.
+- Storage layer, including the KV storage layer and the graph storage layer. The storage layer needs to support various functions required by the calculation layer.
+- Calculation layer. The calculation layer should include the graph transaction engine, graph analysis engine, and graph neural network engine. It also includes a variety of programming interfaces provided by the server, including descriptive query language Cypher, stored procedures, and so on.
+- Client. The client SDK should support multiple languages such as Java, Python, and C++, and also support command-line interaction. The Browser and Explorer reduce the threshold for using the graph database through web-based interaction.
+- In terms of ecological tools, it covers the development, operation, and management links of enterprise-level graph databases, improving usability.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..c8bc65a993
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/7.functionality.md
@@ -0,0 +1,99 @@
+# Functionality
+
+> This document mainly introduces the main functions and features of TuGraph.
+
+## 1.Installation
+
+## 1.1.Installation
+
+Deployment methods TuGraph currently provides three deployment methods: cloud deployment, Docker deployment, and local package deployment. Users can choose the appropriate deployment method according to their actual situation.
+
+## 1.2.Software and Hardware Environment
+
+TuGraph core is developed in C++, and the default compiler used is GCC8.4, using c++14 standard. Some functions use other compilers, such as ApacheLucene-based full-text indexing, which uses JNI interface and requires a Java compiler. In addition, the Python Procedure API is provided in the stored procedure, which requires a Python environment. TuGraph does not require special hardware such as GPUs, and can naturally adapt to general hardware upgrades such as RDMA and HBM with high latency and low bandwidth.
+
+TuGraph has been tested on CPUs based on X86 and ARM, including Intel, AMD, Kunpeng, Hygon, Feiteng, etc., and also runs on multiple operating systems, including mainstream versions of Ubuntu, CentOS, SUSE, Galaxy Kylin, Zhongbiao Kylin, and UOS, without special requirements for operating systems and CPUs.
+
+The software and hardware environment also includes the environment of dependent libraries. Since the default KV storage in TuGraph's storage layer is LMDB, the file system needs to support POSIX interfaces. The compilation and parameter configuration in different environments will be slightly different. For example, in the packaging of point-edge data in graph storage, it should match the page table size of the operating system, which is 4KB by default, and it is recommended to set the system's page table size to 4KB.
+
+## 2.Storage layer
+
+In the graph data model, TUGraph supports the attribute graph model, which can be divided into subgraphs, tags (including vertex tags and edge tags), and attributes according to the hierarchy.
+
+From the perspective of the storage layer, TuGraph uses an intuitive multi-layered tree model, without tags across subgraphs or attributes across tags, and only retains the core logic of the graph model. In terms of subgraph storage, TuGraph has performed data physical isolation for multiple graphs, and each graph corresponds to an instance of LMDB. The metadata description information of multiple graphs is saved in a special public LMDB instance called meta. The storage of vertex and edge tags and their attributes maps graph data adaptively to KV key-value pairs, maximizing read performance. At the same time, multi-threaded writing is implemented at the KV layer, solving the disadvantage of low write performance of LMDB. Primary key indexes and secondary indexes correspond to B+ tables in LMDB, supporting index value addition, deletion, query, and modification based on comparison.
+
+The storage layer also retains some other non-core functional data, including permission data, pre-compiled plugin data, and monitoring data.
+
+## 3.Calculation layer
+
+The calculation layer is divided into three parts in terms of function, including the TP-class graph transaction engine, the AP-class graph analysis engine, and the graph neural network engine.
+
+__The graph transaction engine__ is mainly used to process concurrent graph operations, including single-point queries, neighbor queries, and path traversal. The graph transaction engine focuses on ACID transactions of concurrent operations, ensuring that the operation logic will not interfere with each other. The main performance indicator is QPS, which is the number of completed queries per second.
+
+__The graph analysis engine__ usually operates as a full-graph iteration. Some simple analysis tasks (such as SPSP) can be completed by the graph transaction engine, and complex analysis tasks are completed by the graph analysis engine, which usually takes several seconds to several hours for a single task. Therefore, a single graph analysis task should use all hardware resources in parallel, and the performance indicator is the total time for completing the task.
+
+__The graph neural network engine__ usually operates as a full-graph iteration. In addition to graph topology-based operations, the graph neural network engine also needs to integrate a machine learning framework to handle vector operations, such as PyTorch, MXNet, and TenserFlow.
+
+The logic of the three engines is different and independently configured for resource pools. The graph transaction engine sets up a thread pool based on RPC operations. For each operation received from the client, a thread is taken from the pool to process it, and the number of concurrent executions is equal to the capacity of the RPC thread pool, which is usually configured as the number of server cores. The graph analysis engine has an analysis thread pool, and each graph analysis task is executed concurrently, that is, all threads are used to execute a task to speed up the performance of the operation. The serial execution feature of TuGraph graph analysis operations will restrict the user experience to a certain extent. The demand for concurrent graph analysis can be processed by deploying high-availability, increasing machine resources, or connecting to an external task scheduler to transfer data to a container for real-time scheduling and calculation. Graph neural network operations will reuse the resources of the graph transaction
+
+## 4.Core Features
+
+### 4.1.Query Language
+
+TuGraph provides Cypher graph query language that follows the OpenCypher standard.
+- Supports Procedure embedding.
+- Supports pluggable optimization frameworks with various optimization features.
+- Supports extensible security check framework for Cypher.
+
+### 4.2.Stored Procedures
+
+When users need to express complex query/update logic that Cypher cannot describe, or when high performance is required, TuGraph's stored procedures (Procedure) is a more concise and efficient choice than calling multiple REST requests and completing the entire processing flow on the client-side.
+
+### 4.3.Data Import/Export
+
+Although TuGraph supports data insertion, batch import can greatly improve efficiency. The import function can be divided into importing into an empty database (offline import) and incremental import. The former refers to importing when the subgraph is empty, and the additional assumption can greatly improve the import performance. In TuGraph, the throughput rate of empty database import and incremental import differs by 10 times. Data consistency needs to be considered in data export, which is based on exporting data based on a snapshot.
+
+TuGraph can perform data export on graph data already stored in TuGraph using the command-line tool `lgraph_export`. The export format supports CSV and JSON.
+
+### 4.4.Backup and Restore
+
+ TuGraph's backup function can be divided into active/scheduled, offline/online, and full/incremental backup. The goal is to complete the backup with the smallest storage and computing costs possible. The Restore function can restore to the latest state or a historical marked time point, ensuring that the database is in a consistent state.
+
+### 4.5 Data Warmup
+
+TuGraph is a disk-based graph database, and data is loaded into memory only when it is accessed. Therefore, system performance may deteriorate due to frequent IO operations in the first period after the server is opened. We can improve this problem by preheating the data in advance.
+
+### 4.6 High Availability Mode
+
+High availability means that by configuring a cluster, real-time multi-replica data hot backup can be achieved, and the cluster can still provide services when some replicas are not in use. TuGraph uses the multi-machine hot backup mechanism of the RAFT protocol, which can reduce RPO to near 0. Data synchronization is performed at the computation layer through RPC interfaces for write operations. The high availability cluster of TuGraph adopts a master-slave mode, where only the master node processes write requests, and both master and slave nodes can process read requests. The write request processing of the master node needs to be synchronized to more than half of the total nodes. The write request is considered complete when the majority of the nodes have written successfully.
+
+## 5.Client Tools
+
+Client Tools Client tools mainly include SDKs for various programming languages, OGM, and command-line tools.
+
+The client SDK is mainly used for secondary development and can be linked to the server through RPC or REST protocols. RPC has better performance based on long links, and data needs to be uniformly serialized through protobuf. TuGraph uses brpc, which supports rpc clients in Java, Python, and C++. REST's protocol is more flexible and can be easily adapted to more diverse environments, and different programming languages can easily connect. TuGraph provides a Python REST client instance, and command-line interaction is also implemented using REST.
+
+OGM (Object Graph Mapping) is a graph object mapping tool for TuGraph, which supports mapping JAVA objects (POJO) to TuGraph. Classes in JAVA are mapped to nodes in the graph, collections in classes are mapped to edges, and properties of classes are mapped to properties of graph objects. It also provides corresponding function to operate the graph database. Therefore, JAVA developers can easily use TuGraph database in a familiar ecosystem.
+
+The command-line tool `lgraph_cypher` is a query client that can be used to submit OpenCypher requests to the TuGraph server. `lgraph_cypher` client has two execution modes: single-command mode and interactive mode.
+
+
+## 6.Ecological Tools
+
+Ecological tools are a crucial component of enterprise-level databases, and a rich array of ecological tools can greatly enhance the usability and stability of graph databases.
+
+### 6.1.TuGraph DataX
+
+![Import&Export](../../../images/tugraph-datax.png)
+
+TuGraph's core supports importing and exporting CSV and JSON data, offering both full database and incremental importing modes. In practice, there may be a need to import from multiple data sources such as MySQL, Kafka, and Hive, and TuGraph connects to these sources using DataX. Due to the differences between relational and graph models, data cleaning processes can be quickly processed using SparkSQL. TuGraph focuses only on the reliability and performance of simple CSV and JSON scenario imports.
+
+### 6.2.Visual Interaction
+
+TuGraph Browser is a visual interface for direct users of graph databases, covering most of TuGraph's capabilities, including data import, graph model building, data addition/deletion/query/modify, and monitoring and maintenance operations.
+
+### 6.3.Monitoring
+
+TuGraph uses the Prometheus + Grafana monitoring framework in a loosely coupled manner. Prometheus obtains monitoring information from TuGraph's monitoring interface, stores it in a local time-series database, and then displays it interactively on the web using Grafana.
+
+The monitoring states provided by TuGraph include the state of the graph database and the state of the server. The former includes the database-side status such as read/write load and number of vertices/edges, while the latter includes the real-time status of the server's memory, CPU, and hard disk. If some monitoring state exceeds the expected threshold, proactive alerts are necessary, usually requiring integration with other operations and control systems such as group messaging and email alerts.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..9d5a7ac434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# Scenarios
+
+> This document mainly introduces the application scenarios of graph databases.
+
+## 1.Financial Industry
+
+The entities in the financial industry mainly involve people, companies, accounts, products, etc., and their relationships include transaction relationships, logging relationships, equity relationships, employment relationships, etc. These entities form a financial graph data network. By applying graph databases, we can discover a lot of useful information from the financial graph data network, which helps us make more accurate financial decisions.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Loan review|By analyzing the applicant's relationship and transaction history, etc., it is auxiliary to judge the applicant's repayment ability and willingness. It can be applied to retail loan review, small and micro loan review, supply chain finance, etc. This method can complement the traditional audit mechanism based on the applicant's own information, which is particularly useful for small and micro loan audits with low individual information coverage.|
+|Post-loan|By analyzing the borrower's transaction history, it assists in analyzing whether the borrower has default risk. Compared with the traditional method of issuing alerts only when loan funds flow to specific users, this method can assign a risk value to each account and issue warnings when the loan flows to high-risk accounts.|
+|Missing recovery|By analyzing the social and shopping data of missing borrowers, other contact methods can be found. This method can significantly improve the recovery rate of missing borrowers.|
+|Guarantor loop detection|Special guarantee structures such as cyclic, chain, family-style, and cross can be found in the guarantee relationship graph to expose potential risks. Compared with the JOIN method of a relational database, the solution based on graph algorithms is more efficient, can detect any length of guarantee loop, and can achieve more complex limited condition detection.|
+|Credit card fraud detection|A relationship network of addresses, contact information, etc. in credit card application information is constructed, and a community discovery algorithm is run in the application relationship network to detect suspected fraudulent gangs, thereby rejecting suspected fraudulent applications and reducing economic losses.|
+|Anti-money laundering|Suspected money laundering behaviors and links can be found through the transaction network and medium network. Money laundering is a complex process involving multiple parties. By conducting graph analysis in transaction and social networks, we can more accurately detect money laundering behaviors.|
+|Car insurance anti-fraud|For insurance fraud involving repair shops, by analyzing the relationship between the insured person, the case location, and the repair shop, fraudulent claims can be more accurately identified, reducing economic losses.|
+
+## 2.Industrial Industry
+
+A large amount of heterogeneous data will be generated in the production and manufacturing process, and how to effectively organize and manage these data is one of the most important issues in industrial big data. These data include design documents, equipment data, simulation plans and results, experimental results, experience documents, etc. The relationships between these data are complex, and traditional data management systems can only accumulate data, and they are often unable to search for related materials. Using graph models, these different types of data are organized into a network, which makes it easy to browse and search for data.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Supply chain management|Supply chain data mainly concerns the correspondence between products, components, and parts, the correspondence between parts and suppliers, and sensitive components in parts. Compared with the traditional BOM system, the solution using graph databases can more conveniently maintain complex networks of multiple component levels and multiple supplier levels, thereby providing basic support for a through supply chain.|
+|Document management|Using graph databases can organize different types of documents together organically according to different relationships. For example, design documents for components, component-part relationships, component test documents, relevant experience documents, etc. can be organized together so that all relevant information for the component can be obtained easily when needed.|
+|R&D process management|A large amount of simulation, experimentation, and testing needs to be performed in the product development and verification process. Each test process involves many different steps, the connection between the steps, the data versions used in each step, and the algorithm versions all make up a complicated relationship network. Using graph databases can better manage this relationship network, providing a good foundation for data reuse and process improvement in the R&D process.|
+|Equipment information management|Manufacturing requires the management of a large number of devices, which are interrelated (power supply, feeding, spatial relationship) to form a complex network. Traditional databases are difficult to reflect this complex relationship. Using graph databases can easily represent these relationships, thereby better managing equipment information.|
+
+## 3.Smart City
+
+With the development of technology, intelligent management of cities has become a major trend. Intelligent management requires a strong system software to support it, built on a good information management platform. In an intelligent city management system, an intelligent decision-making system needs to make decisions based on a large amount of different information, including various topology information (such as roads, pipelines, etc.), supply and demand information (such as electricity transmission, drinking water supply, sewage discharge, etc.), environmental information (such as temperature, humidity, rainfall, etc.), and so on. To manage these complex and heterogeneous data organically and make decisions based on them, a mature system is needed. Traditional data management systems based on relational data models are not suitable for managing such complex and heterogeneous data. Using a graph model can solve this problem well. If we manage these different data using a graph database, we can achieve many complex intelligent management scenarios.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Smart Traffic|Based on road topology, road capacity, and current traffic flow, intelligent traffic signal scheduling can be performed to improve traffic efficiency.|
+|Smart Drainage|Based on drainage system information and current rainfall, the drainage system can be scheduled to reduce the occurrence of waterlogging.|
+|Pipeline Management|Organizing the production, installation, topology information, and historical status information of pipelines can help us manage the pipelines throughout their lifecycle, including fault diagnosis, life assessment, etc.|
+|Crowd Evacuation|When a large number of people need to be evacuated, multiple transportation modes such as buses, subways, taxis, shared bicycles, etc., need to be considered, as well as the road carrying capacity. Using a graph database to organically integrate this information can help us make better decisions and provide better support for large public events.|
+
+## 4.Social Governance
+
+Social governance involves public safety, legal affairs, public opinion, network security, and more. Social governance is a comprehensive, multi-system linkage problem. It requires the synthesis of a large amount of data and global considerations to make better decisions. In this multidimensional and complex data problem, the graph data model can provide better adaptability and provide a solid foundation for intelligent social governance decision-making platforms.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Criminal Gang|Conspiratorial gangs will inevitably make contact through some means, including face-to-face meetings (appearing in the same place), phone calls, or internet contacts, and they may also have economic exchanges. If we store all of this data in a unified graph, we can use graph analysis algorithms to identify closely connected groups and then discover and identify the entire criminal gang.|
+|Stakeholder Case Investigation|Stakeholder cases, especially stakeholder economic cases, often involve a large number of personnel and elements (money, location, events, etc.). How to effectively organize this information to provide evidence for handling cases is a difficulty in stakeholder case investigation. Using graph databases to store and analyze this information can help us quickly locate the data, analyze the personnel structure, and provide better technical support for case investigation.|
+|Illegal Website Identification|Illegal websites, phishing websites, yellow websites, and so on, often use different domain names and IPs to avoid being blocked. The filter method based on a blacklist can only block known illegal websites and cannot effectively identify new domain names and IPs. Based on the IP-domain name network mapping relationship, we can create a graph and then use graph calculations to establish a "trustworthiness" model for domain names and IPs to determine whether a website belongs to an illegal website.|
+|Court File Management|Case files are often complex, and different cases may be linked through parties, locations, case nature, judges, and so on. These links constitute a complex network. Using a graph database, we can more conveniently manage these complex relationships and improve case handling and query efficiency.|
+
+## 5.Internet
+
+Social networks and person-product purchase relationships can all form a network. By analyzing this network data, we can provide users with better services, including relevant recommendations, user information collection, important user identification, and spam user identification, and so on.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|ID-Mapping|Graph databases can store all user-related information, including the relationships between users, in one database, and can also use these relationships to identify situations where one person has multiple accounts or multiple people share an account, thus providing decision support for future risk control, recommendations, and other businesses.|
+|Friend Recommendation|Based on the analysis of social networks, we can provide friend recommendations such as "friends of friends" and "common friends".|
+|Product Recommendation|Based on the user-product relationship graph, we can find users with similar interests and recommend other products that similar users have chosen.|
+|Spam User Identification|Traditional spam user identification is mainly based on user account information, such as registration information and posting information, but these types of information are relatively easy to forge. On the other hand, network-based information doesn't have this problem: it's difficult to forge. Therefore, spam user identification based on network information can be more accurate and efficient.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..6f2aa1629a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/9.glossary.md
@@ -0,0 +1,27 @@
+# Glossary
+
+## 1.Graph Technology
+
+> __Graph Computing__:Generalized graph computing, including graph databases, graph analysis, and graph learning; Narrowly defined graph computing only includes graph analysis. The generalized definition is used by default.
+
+> __Graph Database__:Focuses on operations such as adding, deleting, modifying, querying, and transaction processing for graph data, such as TuGraph DB.
+
+> __Graph Analysis__:Focuses on algorithmic analysis and pattern analysis of entire graph data, such as TuGraph Analytics.
+
+> __Graph Learning__:Refers to the same meaning as graph neural networks and graph machine learning, such as TuGraph Learn.
+
+> __Graph Intelligence__:Same as generalized graph computing, including graph databases, graph analysis, and graph learning. It is usually used for conceptual promotion and not for products.
+
+## 2.Specific Concepts
+
+> __Vertex__:Also known as node or point. Avoid using the term "node" as it is often used to refer to the number of servers and can be easily confused. "Node" refers to the meaning of combination, intersection, and crossing; "node" can refer to a milestone on a timeline (key node) or a processing entity in a computer system (such as a server in a computer network).
+
+> __Edge__:Refers to the connection between two vertices.
+
+> __Degree__:Refers to the number of incoming or outgoing edges on a vertex. Note that in non-graph theory scenarios, "hops" are often referred to as "degrees".
+
+> __Hop__:Refers to the number of vertices between two vertices on a path (excluding the starting point and including the endpoint). "K-Hop" in the algorithm performance test refers to this meaning.
+
+> __Vertex Label__:Refers to the type of a vertex, also known as a point label.
+
+> __Edge Label__:Refers to the type of an edge, also known as an edge label.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/index.rst
new file mode 100644
index 0000000000..076b7d0434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph DB Introduction
+=================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..390a685659
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/1.preparation.md
@@ -0,0 +1,90 @@
+# Quick Start
+
+> This document is intended for new users to get started quickly and contains an introduction, features, installation, and use of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property Graph Model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+### 1.1.Supported Platforms
+
+TuGraph supports both X86_64 and ARM64 architectures in physical, virtual, and containerized environments.
+
+### 1.2.Hardware requirements
+
+_You are advised to use NVMe SSDS with large memory configurations for optimal performance。_
+
+| Hardware | Minimum Configuration | Recommended configuration |
+|----------|-----------------------|---------------------------|
+| CPU      | X86_64                | Xeon E5 2670 v4           |
+| Memory   | 4GB                   | 256GB                     |
+| Disk     | 100GB                 | 1TB NVMe SSD              |
+| System   | Linux 2.6             | Ubuntu 18.04, CentOS 7.3  |
+
+## 2.Installation
+
+TuGraph can be installed quickly via Docker Image or locally via RPM /deb packages.In addition, TuGraph offers community edition services on Alibaba Cloud Computing Nest, which means you don't need to purchase your own cloud host to quickly deploy TuGraph services and achieve operational monitoring, thus building your own graph application.
+
+> Installation package/image download: refer to the TuGraph-Latest-Version section in [Download address](../1.guide.md).
+
+> Computing Nest Deployment: You can search for it on Alibaba Cloud Computing Nest, or you can quickly access it through [deployment link] (../5.developer-manual/1.installation/5.cloud-deployment.md).
+
+### 2.1.Fast experience through Docker
+
+1. The Docker environment installed locally
+
+   The docker official documentation：https://docs.docker.com/get-started/
+
+2. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. Start docker
+
+   ```shell
+    docker run -it -d -p 7001:7001 -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 8888:8888 -p 8889:8889 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000 is default http port，for tugraph-db-browser accessing.
+   # 7070 is default http port，for legacy tugraph-web accessing.
+   # 7687 is bolt port, for neo4j client accessing.
+   # 9090 is default RPC port，for RPC client accessing.
+   
+   # The default data directory is /var/lib/lgraph/data and the default log directory is /var/log/lgraph_log,
+   # which is configured in the tugraph configuration file at /usr/local/etc/lgraph.json inside the docker.
+   # This command mounts the data directory and log directory to /root/tugraph/ on the host for persistence,
+   # which you can modify according to your actual situation.
+   ```
+
+4. Open by browser
+
+Accessing tugraph-db-browser: `http://x.x.x.x:8000`. Default account is `admin` and default password is `73@TuGraph`.
+The page will be redirected to the password modification page for the first login. Please modify the password according to the page prompt.
+
+**Note**: 
+Access `http://x.x.x.x:7070` if you want to access legacy tugraph-web, with default account `admin` and default password `73@TuGraph`.
+But please note that legacy web is no longer maintained, it is recommended to use tugraph-db-browser.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..2ec92747d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# DEMO:Movie
+
+> This document mainly introduces the usage of the movie demo.
+
+## 1.Modeling and Data Import
+
+After logging in, click "Help", click "Quick Start", click "One-Click Model Creation", click "One-Click Data Creation", and complete the creation of the Movie Scene Graph.
+
+Movie：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| Label       | Type   | Description                                                                                           |
+|-------------|--------|-------------------------------------------------------------------------------------------------------|
+| movie       | Vertex | Represents a specific movie, such as "Forrest Gump".                                                  |
+| person      | Vertex | Represents a person, who may be an actor, director, or screenwriter for a movie.                      |
+| genre       | Vertex | Represents the genre of a movie, such as drama, horror.                                               |
+| keyword     | Vertex | Represents some keywords related to the movie, such as "save the world", "virtual reality", "subway". |
+| user        | Vertex | Represents a user who watches movies.                                                                 |
+| produce     | Edge   | Represents the relationship between the producer of a movie.                                          |
+| acted_in    | Edge   | Represents the relationship between actors and the movies they have appeared in.                      |
+| direct      | Edge   | Represents the relationship between a movie and its director.                                         |
+| write       | Edge   | Represents the screenwriting relationship of a movie.                                                 |
+| has_genre   | Edge   | Represents the genre classification of a movie.                                                       |
+| has_keyword | Edge   | Represents some keywords of a movie, which are more specific labels for classification.               |
+| rate        | Edge   | Represents the rating given by a user to a movie.                                                     |
+
+## 2.Query Examples
+
+### 2.1.Example One
+
+Query all actors of the movie 'Forrest Gump' and return the subgraph composed of the movie and the actors.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.Example Two
+
+Query all actors of the movie 'Forrest Gump' and list the roles they played in the movie.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.Example Three
+
+Query all movies rated below 3 by Michael.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.Example Four
+
+Query users who have the same dislike of movies as Michael, where the standard for dislike is a rating of less than three.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.Example Five
+
+Recommend movies to Michael by first finding users who dislike the same movies as Michael, and then filtering out the movies that these users like.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.Example Six
+
+Query the movies that Michael's friends like.
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.Example Seven
+
+By querying the movies that people who gave 'Forrest Gump' a high rating also like, recommend similar movies to users who like 'Forrest Gump'.
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..e07192fa2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,48 @@
+# DEMO:Wandering Earth
+
+> This document mainly introduces the usage of the Wandering Earth demo.
+
+## 1.Demo Scene Design
+
+The demo is based on the story background of The Wandering Earth 1 and The Wandering Earth 2.
+
+- Based on the plot, a graph structure is designed, including three types of points: organization, character, celestial body, and facility, and two types of edges: event and relationship.
+- Prepared data corresponding to the schema based on the plot.
+- Prepared some queries to ask questions about the plot.
+
+## 2.Directory structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to queries.
+- control.sh: Script to control the start and stop of TuGraph Server.
+lgraph_standalone.json: Configuration file for starting TuGraph Server.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 4.Data Import
+
+- Modify DATA_PATH in import.json according to the data storage directory.
+- Refer to the load function in control.sh to load data.
+- Refer to the start function in control.sh to start TuGraph Server.
+- After starting TuGraph Server, access ${HOST_IP}:8888 to open the web page and confirm whether the data is successfully imported.
+
+## 5.Cypher Query
+
+Refer to the Cypher document and enter Cypher in the TuGraph web page frontend for queries.
+
+## 6.Usage Display
+
+### 6.1.Data Import Display
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.Query Display
+Query all event processes related to the crisis on Jupiter.
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+Query all event processes related to all crises.
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..64ea337fa8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# The Three Body
+
+> This document mainly introduces the usage of Three-Body demo.
+
+## 1.Demo Scenario Design
+The demo scenario is designed based on the story background of Three-Body 1, 2, and 3.
+
+According to the setting of the Three-Body story, we have designed 4 types of nodes and 6 types of edges. The nodes include "character", "organization", "plan", and "timeline", while the edges include "character-character relationship", "character-plan relationship", "character-organization relationship", "organization-plan relationship", and "organization-organization relationship". According to the plot, corresponding schema data and some queries have been prepared to propose some questions about the plot.
+
+## 2.Directory Structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to the query.
+- control.sh: Script to start and stop TuGraph Server.
+- lgraph_standalone.json: Configuration file for TuGraph Server startup.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+### 4.Data Import
+
+- Manual import
+    - Modify DATA_PATH in import.json according to the data storage directory.
+    - Refer to the load function in control.sh to load the data.
+    - Refer to the start function in control.sh to start the TuGraph service.
+    - After starting the TuGraph service, access ${HOST_IP}:8888 to open the web page and confirm whether the data is imported successfully.
+- Automatic creation
+    - Click `New Graph Project`, select Three-Body data, fill in the graph project configuration, and the system will automatically create the Three-Body scenario graph project.
+    - Alternatively, use the pre-installed Three-Body graph project provided by the product.
+
+### 5.Cypher Query
+
+Refer to the TuGraph documentation and enter Cypher in the TuGraph web page frontend to execute a query.
+
+## 6.Usage Demo
+
+### 6.1.Data Import Demo
+
+![data](../../../../images/three-body-data.png)
+
+### 7.Query Demo
+
+#### 7.1.Character Relationship Query
+In the plot of Three-Body 1, a large number of scientists committed suicide all over the world at the beginning, which aroused the attention of the police. During the investigation process, the truth behind it gradually surfaced step by step according to the clues of the character relationships, as shown in the above graph. Shi Qiang and Wang Miao discovered that most people had direct or indirect connections with Ye Wenjie, and sent Wang Miao undercover to finally discover Ye Wenjie's ultimate commander identity. As can be seen in the graph, there are many edge relationships (many one-degree or two-degree neighbors) around Ye Wenjie's vertex.
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.Neighbor Vertex Analysis
+There are many plans in Three-Body, and sometimes we may be confused. At this time, we can use the graph's neighbor vertex query to view the relevant characters and organizations of the plan. For example, in the "Wallfacer Project", we can see that there are four characters related to it, and these four are also the "Wallfacers" who are highly expected by the world.
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.Query Common Neighbors of Node A and B
+We often want to know who are the common related characters between two characters, so that we can quickly grasp the relationship between these two characters. In the case of large amounts of data, it is very convenient to use Cypher for graph relationship analysis!
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.Set/Change Properties
+As the plot progresses, we gradually learn about the various labels on "Ye Wenjie", so we can also update these labels to the "Ye Wenjie" node:
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.Add/Delete Nodes
+Later, we learned about characters such as Luo Ji and Cheng Xin, and organizations such as PIA and the Star Ring Group, and wanted to add them as nodes to the graph:
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..0bb359cbe0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# Three Kingdoms
+
+> This document mainly introduces the usage of the Three Kingdoms demo.
+
+## 1. Introduction
+Due to the lack of historical records, there are often many mysteries surrounding even well-known historical events. Taking the history of the Three Kingdoms as an example, why did Zhuge Liang come out of seclusion to help Liu Bei, and why there was a huge gap in achievements between Cao Cao and Liu Bei, both heroes of the time, are some of the unsolved mysteries. Historians in the past often used two-dimensional relationship analysis of history, and the conclusions drawn were often one-sided. Using TuGraph to import historical figures and events of the Three Kingdoms into a graph model, and analyzing them using graph calculation methods can help us obtain more valuable knowledge from limited information, which is a very meaningful interdisciplinary attempt.
+## 2. Data Modeling
+We designed 5 types of vertices and 5 types of edges. The vertices include "Lord", "Province", "Civilian", "Military Officer", and "Battle"; the edges include "Father", "Brother", "Belongs To", "Native Place", and "Participate In". The specific modeling information is shown below:
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. Data Import
+- Manual import
+    - To import data into TuGraph, you can use the lgraph_import tool to import it offline. The import command of lgraph_import is as follows:
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- Automatic creation
+    - Click `New Graph Project`, select the Three Kingdoms data, fill in the graph project configuration, and the system will automatically create the Three Kingdoms scene graph project.
+    - Or use the built-in Three Kingdoms graph project provided by the product directly.
+## 4. Cypher Query
+### 4.1. Why did Zhuge Liang Choose Liu Bei?
+The following Cypher command can be used to view the relationship between Zhuge Liang, Cao Cao, and Liu Bei:
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+From the graph, we can intuitively see that one of the shortest paths between Cao Cao and Zhuge Liang includes the battle of Xuzhou. Cao Cao once committed a massacre in Xuzhou because his father was killed, and nobody would choose a warlord who had previously massacred their hometown as their lord. In contrast, Liu Bei once prevented Cao Cao's violence during the battle of Xuzhou, which should be one of the reasons why Zhuge Liang had a good impression of Liu Bei.
+
+### 4.2. Why Did Cao Cao Achieve More Than Liu Bei?
+The following Cypher command can be used to view the family's support for Cao Cao's career:
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+The most important thing for pacifying the world is military talent. Cao Cao's father originally had the surname Xiahou, but was adopted into the Cao family. The Cao and Xiahou families were both local big clans in Qiao County, providing Cao Cao with a large number of military talents such as Xiahou Dun, Xiahou Yuan, Cao Ren, and Cao Hong in the early days of his career. In contrast, Liu Bei's father died early and he didn't have any family support. He only gathered his Five Tiger Generals when he was over 50 years old, by which time the best time to fight for land in the chaotic world had passed. Cao Cao had already controlled six of the nine provinces in the world.
+
+### 4.3. Why Did the Most Powerful Wei Kingdom in the Three Kingdoms Perish First?
+The following Cypher command can be used to view the important civilian officials of the Cao Cao group:
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+In fact, Cao Wei was overthrown in the Gao Ping Ling incident in 249 AD, after only 29 years of existence, which was shorter than Shu Han (43 years) and Dong Wu (51 years). The reason why the most powerful Wei Kingdom in the Three Kingdoms perished first was that the civilian official system of Cao Wei (the nine-rank system) made it easy for power to be concentrated in the hands of aristocratic families. From the graph, we can see that almost all the important civilian officials of Cao Cao and Cao Pi's generations were from aristocratic families, such as Xun Clan of Yingchuan, Zhong Clan of Yingchuan, Chen Clan of Yingchuan, Jia Clan of Wuxi, etc. There was even a trend of regionalization, centered on Yingchuan. Ultimately, the regime was usurped by the Sima family of Henei, which had close ties with the Xun Clan of Yingchuan.
+
+### 4.4. What Were the Strengths of Each of the Three Kingdoms?
+The following Cypher command can be used to view the population strength of each group in the Three Kingdoms:
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+The query result is shown in the following table:
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+In ancient society, an important indicator of a country's strength was its population. Since population data is missing, we estimate the population of each province using the birthplace data of all lords, civilians, and military officers in the Three Kingdoms. It is found that among the main characters of the Three Kingdoms, 60 belong to Wei, 23 belong to Wu, and only 2 belong to Shu, which proves that Wei was indeed the most powerful country in the Three Kingdoms.
+
+### 4.5. How Should Cao Cao's Military Ability Be Evaluated?
+The following Cypher command can be used to view the main battles that Cao Cao participated in:
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+From the graph, we can see that Cao Cao participated in 8 out of the 15 major battles in the Three Kingdoms, with a high participation rate. However, Cao Cao only won the battles of Xuzhou, Yanzhou, Guandu, and Xiangyang, while losing the battles of Hanzhong, Wancheng, the Campaign against Dong Zhuo and the Battle of Red Cliffs. His overall win rate was 50%, which proves that Cao Cao was not a very outstanding military strategist.
+
+## 5. Remarks
+More analysis is needed and encouraged to be added by everyone!
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..b2e7d4b257
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Demo:Round The World
+
+> This document mainly introduces the usage of the round-the-world demo.
+
+## Brief
+
+Based on the virtual background of "Around the World in 80 Days" and partial public historical flight data, it helps users design optimal flight plans for multiple cities.
+- Demo designed custom website service
+- The data source is a foreign open source website and does not include mainland city flight data
+- The flight prices in the data are simulated data and do not represent real prices.
+
+## Example
+
+### Login Page
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### Query Page
+
+Click on the login page to enter the query page.
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### Query Example
+
+Select no more than 8 cities from the city list in the lower left corner, click Query to return the recommended flight plan, and return the 10 path plans with the lowest cost and shortest flight time, provided that the interval between previous and later flights is 2-6 hours.
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+For detailed instructions, see the [manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "") document.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..106f943e05
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo example
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..b2ed78a618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+TuGraph DB Quick Start
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..6900158788
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,685 @@
+# TuGraph Browser
+
+> This document focuses on the use of TuGraph Browser.
+
+## 1.Introduction
+
+TuGraph Browser (hereinafter referred to as Browser) is a powerful product visualization development tool that presents graph data in an intuitive visual way, allowing users to easily manage, maintain, and view the database running status. This tool not only supports graph data management and visualization but also supports system account management, providing users with a comprehensive operation and management experience, enabling users to manage and utilize graph databases more efficiently.
+
+## 2.User Guide
+
+### 2.1.Accessing
+
+After the user completes the installation of the graph database, they can access the Browser through a browser. Users only need to enter the IP:Port of the server where TuGraph is located in the browser address bar. The default port used is 8000.
+
+- For example:127.0.0.1:8000
+- Recommend using Chrome
+
+#### 2.1.1. Startup configuration
+
+Before starting Browser, you need to start TuGraph-Server in advance and configure the connection between Browser and TuGraph-Server. The configuration file is the env.json file in the Browser directory. The specific configuration is as follows
+```shell
+# vim /usr/local/share/lgraph/tugraph-db-browser/env.json
+{
+   "tugraph_db_host": "http://127.0.0.1:9090"
+}
+```
+Tugraph_db_host needs to be modified to the address of the actual TuGraph-Server RPC service
+
+#### 2.1.2.Startup method
+There are two ways to start Browser. One is to directly switch to the directory where Browser is located in the docker image and execute the startup command.
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run dev
+```
+The other is to use the rpm/deb installation package in the local environment. In this case, it needs to be built first and then started. Therefore, the Node environment needs to be installed locally in advance. For details, see the source code directory.
+ci/images/tugraph-runtime-*-Dockerfile. When installing TuGraph locally,
+Browser will be installed to the specified local directory, switch to the directory, and execute the following command to build and start
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run bootstrap
+pnpm run dev
+```
+
+### 2.2.Logging in
+
+![login](../../../images/browser/login.png)
+
+- After successfully accessing the Browser, the login page appears first (as shown above), where users need to fill in their account and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- After the user's first login, they will be redirected to the password modification page. Once the password is successfully modified, they can only use the new password to log in.
+
+### 2.3.Quick Start
+
+For first-time users of TuGraph, you can quickly build a graph project with the built-in demo data and get started with graph data projects quickly.
+
+#### 2.3.1.Creating a Graph Project
+
+In the `Graph Project` homepage tab, click `Create New Graph Project` to create a new graph project.
+
+![quickstart-creategraph](../../../images/browser/quickstart-creategraph.png)
+
+Select a built-in demo data, and click the `Next` button.
+
+![quickstart-selectdemo](../../../images/browser/quickstart-selectdemo.png)
+
+In the Fill in Configurations interface, enter the graph project information. Since the demo data is relatively small in size, set the Maximum Storage Space to 1 GB. After entering the graph project information, click the Create button, and the system will automatically create the graph model of the demo data and import the graph data.
+
+![quickstart-configure](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.Starting a Graph Project
+
+After creating a graph project with demo data, you can find the corresponding graph project in the `Graph Project` tab, and then click `Graph Query` to query graph data.
+
+![quickstart-graphtab](../../../images/browser/quickstart-graphtab.png)
+
+Execute the default query statement to browse the graph data in the demo.
+
+![quickstart-result](../../../images/browser/quickstart-result.png)
+
+For more quick start documents, please visit the[Quick Start Documents](../3.quick-start/1.preparation.md)
+
+### 2.4.Graph Project
+
+`Graph Project` provides visualized graph project management and graph data development functions, providing users with a series of convenient graph data visualization operations, including graph project creation, modification, deletion, and other management operations, as well as graph data queries, vertex-edge statistics, and other operations. In addition, it also supports graph model management, making it more convenient for users to manage and maintain graph data.
+
+#### 2.4.1.Graph Project Management
+
+On the `Graph Project` page, you can see the graph projects in the current graph database.
+
+![graphmanagement-homepage](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.Creating a Graph Project
+
+On the `Graph Project` page, click the `Create New Graph Project` button to create a new graph project.
+
+![graphmanagement-creategraph](../../../images/browser/graphmanagement-creategraph.png)
+
+Creating a new graph project requires completing the creation of the graph project through two pages: `Select Template` and `Fill in Configurations`.
+
+- __Select Template__: The product provides two types of templates: empty templates and demo templates.
+    - Empty templates: A brand new graph project where users need to create their own graph model and import graph data, generally used for formal project development.
+    - Demo templates: Built-in demo data in the product. After the graph project is created successfully, the system will automatically create a demo graph model and import demo graph data, usually used for trial and learning.
+
+![graphmanagement-selecttemplate](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __Fill in Configurations__: Users need to fill in basic information about the graph project and click the `Create` button to create the graph project.
+    - Graph Name: The name of the new graph project, which is also the unique primary key of the graph project. Supports Chinese characters, letters, numbers, and underscores, but does not support spaces or other special characters.
+    - Graph Description: The description of the new graph project can be used to describe the background and objectives of the project in detail.
+    - Advanced Configuration - Maximum Storage Space: Set the maximum storage space that the graph project can occupy. It does not actually occupy physical storage space in advance. After the actual data volume reaches the maximum storage space threshold, no more data can be written.
+
+![graphmanagement-configure](../../../images/browser/graphmanagement-configure.png)
+
+After creation, the graph project can be viewed in the graph project tab on the `Graph Project` page.
+
+##### 2.4.1.2.Editing a Graph Project
+
+On the `Graph Project` page, click the `Edit button` (pencil icon) in the graph project tab to edit the basic information of the corresponding graph project.
+
+![graphmanagement-editgraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+graphmanagement-editgraph-button
+
+![graphmanagement-editgraph](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.Deleting a Graph Project
+
+On the `Graph Project` page, click the `Delete` button (trash can icon) in the graph project tab to delete the corresponding graph project.
+
+![graphmanagement-deletegraph-button](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_Note: Graph projects cannot be restored after deletion._
+
+##### 2.4.1.4.Vertex-Edge Statistics
+
+On the `Graph Project` page, click the `Vertex-Edge Statistics` button (line graph icon or refresh icon) in the graph project tab to count the number of vertexs and edges in the corresponding graph project.
+
+![graphmanagement-statistics-button](../../../images/browser/graphmanagement-statistics-button.png)
+
+The statistical results will be displayed on the graph project tab. Graph projects that have not been vertex-edge statistics will display `No vertex-edge data`, and graph projects that have already been vertex-edge statistics need to click the `Refresh` button to count again.
+
+![graphmanagement-statistics](../../../images/browser/graphmanagement-statistics.png)
+
+![graphmanagement-statistics-refresh-button](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.Graph Building
+
+The `Graph Building` function in Browser is mainly used for graph project model definition and data import. On the `Graph Project` page, click the `Graph Building` button in the graph project tab.
+
+![graphbuild-button](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.Model Definition
+
+Browser provides a visualization way to create and maintain graph models.
+
+- Graph models can also be created and maintained through the `Cypher` tool and the `lgraph_import` tool. For details, please refer to the [Cypher API Document](../8.query/1.cypher.md) and [Data Import Document](../6.utility-tools/1.data-import.md).
+
+###### a.Browse Graph Models
+
+On the `Model Definition` page, you can view detailed graph model settings, support list and canvas view of the graph model, support list display of vertex type properties and indexes, edge type properties and start/end vertex types.
+
+![graphbuild](../../../images/browser/graphbuild.png)
+
+- Supports list view of vertex types and edge types.
+    - Supports the display of the number of vertexs or edges in the corresponding vertex type or edge type in the vertex type or edge type tab.
+    - Supports keyword search for vertex type or edge type names. Enter the keyword in the `search box` to display the corresponding vertexs or edges.
+
+        ![graphbuild-list-search](../../../images/browser/graphbuild-list-search.png)
+    - Supports copying vertex type or edge type names. Click the `Copy` button to copy the name of the vertex or edge to the clipboard.
+
+        ![graphbuild-list-copy](../../../images/browser/graphbuild-list-copy.png)
+    - Supports deleting vertex types or edge types. Click the `Delete` button to delete the corresponding vertex or edge.
+
+        ![graphbuild-list-delete](../../../images/browser/graphbuild-list-delete.png)
+- Supports canvas view of vertex types and edge types.
+- Clicking the corresponding vertex type or edge type in the list or canvas can display the model details.
+        ![graphbuild-select](../../../images/browser/graphbuild-select.png)
+
+###### b.Add Vertex
+
+Click the `Add Vertex` button on the `Model Definition` page to add a vertex type in the right sliding window.
+
+![graphbuild-addvertex-button](../../../images/browser/graphbuild-addvertex-button.png)
+
+The user needs to enter the Vertex type name, properties, and indexes, and click the `Complete` button to complete the creation of the Vertex type.
+- Vertex Type Name: The name of the Vertex, which is also the unique identifier of the Vertex.
+- Properties: The attributes of the Vertex, and one attribute needs to be used as the primary key.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating Vertexs.
+- Indexes: The indexing attributes of the Vertex, you need to create attributes first and then set the attribute as an index.
+    - Attribute: The attribute that needs to be indexed.
+    - Unique:Set the attribute field as a unique value.
+    - Primary Key: Whether the corresponding attribute is a primary key. The Unique option must be `Yes` after selecting `Yes`.
+    - Delete: Indexes can be deleted arbitrarily during Vertex creation.
+
+![graphbuild-addvertex](../../../images/browser/graphbuild-addvertex.png)
+
+- Edit Vertex: You can add Vertex properties, modify the data type of existing properties, and add or delete indexes. You need to click the `Save` button for each newly added or modified attribute to take effect.
+_Note: Once the primary key field attribute is created, it cannot be modified._
+
+![graphbuild-editvertex](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.Add Edges
+
+Click the `Add Edge` button on the `Model Definition` page to add an edge type in the right sliding window.
+
+![graphbuild-addedge-button](../../../images/browser/graphbuild-addedge-button.png)
+
+The user needs to enter the edge type name, properties, select the start vertex type and end vertex type, and click the `Complete` button to complete the creation of the edge type.
+- Edge Type Name: The name of the edge, which is also the unique identifier of the edge.
+- Properties: The attributes of the edge, which may not exist on the edge.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating edges.
+- Selecting start vertex type and end vertex type: Set the start vertex type and end vertex type of the edge, and support multiple start vertex types and end vertex types.
+    - Start vertex: Select the vertex type of the start vertex.
+    - End vertex: Select the vertex type of the end vertex.
+    - At least one vertex type needs to be created in advance to set the start vertex type and end vertex of the edge.
+    - If not selected, it means that the start vertex and end vertex can be any vertex type, and the corresponding edge is not displayed on the canvas, and you need to view the edge type in the left list.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+- Edit Edge: You can add edge properties and modify the data type of existing properties. You need to click the `Save` button for each newly added or modified attribute to take effect.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+###### d.Import Model
+
+Click the `Import Model` button on the `Model Definition` page to upload a model file and quickly create a model.
+
+![graphbuild-importmodel-button](../../../images/browser/graphbuild-importmodel-button.png)
+
+Click the `Upload File` button on the `Import Model` page to upload the model file. After the upload is successful, click `OK` to import the graph model.
+
+- Overwrite the current canvas model: If this option is selected, the existing graph model will be cleared before importing the graph model in the model file; if not selected, the vertex types and edge types in the model file will be imported, but the existing vertex types and edge types will not be modified.
+
+![graphbuild-importmodel](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.Export Model
+
+Click the `Export Model` button on the `Model Definition` page to export the graph model in the current graph project to a JSON file.
+
+![graphbuild-exportmodel-button](../../../images/browser/graphbuild-exportmodel-button.png)
+
+The model file is in JSON format and is not recommended to be manually modified.
+
+![graphbuild-exportmodel](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.Data Import
+
+After completing the `Model Definition`, click the `Next` button to enter the data import page.
+
+###### a.Data Preparation
+
+Data needs to be prepared in advance before importing data. The current browser supports the uploading of CSV files, and the data file suffix needs to be ensured to be CSV.
+- The header is not mandatory.
+- Text qualifiers are supported, and the text qualifier is double quotes. Data Import - CSV
+
+![graphbuild-import-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.Upload Files
+
+Upload the required data files on the `Data Import` page and import the data into the graph project.
+
+![graphbuild-import](../../../images/browser/graphbuild-import.png)
+
+- Separator: The column separator of the data file.
+- File upload: Supports uploading multiple files.
+    - Supports selecting multiple upload files in the pop-up window.
+    - Supports dragging and dropping files to upload on the page.
+    - Supports uploading vertex files and edge files at the same time.
+
+###### c.Data Mapping
+
+After the file is successfully uploaded, you need to set the `Data Corresponding Table` on the `Data Import` page to establish a mapping relationship between the data columns in the data file and the target vertexs/edges and corresponding attributes.
+
+- Data Corresponding Table: Displays uploaded data problems.
+    - File Name: The name of the uploaded data file.
+    - File Size: The size of the uploaded data file.
+    - Read Result: The result of uploading the data file, success means uploaded successfully.
+    - Delete: Delete on the page, the local file will not be deleted.
+- Data File Mapping: Each uploaded data file needs to configure a mapping relationship.
+    - Label: Select the corresponding vertex or edge type for the file, and you can only select one type of vertex or one type of edge.
+    - Starting from the Nth row: Start reading data from the Nth row. The system defaults to start reading data from the 0th row. To skip the header, you can enter 1.
+    - Attribute Mapping: Select the attribute field corresponding to the data column from the drop-down list.
+    - Data Preview: The system will pre-read the first 5 rows of the data file.
+
+![graphbuild-import-datamapping](../../../images/browser/graphbuild-import-datamapping.png)
+
+After the file is successfully uploaded, you can click the `Continue Import` button to continue importing other data or click the `Go to Graph Query` button to query the imported data on the `Graph Query` page.
+
+![graphbuild-import-success](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.Graph Query
+
+Click the `Graph Query` button in the `graph project tab` on the `Graph Project` page to query and access graph data in the graph project. The product provides multiple modes for querying graph data, such as Statement Query, Path Query, and Vertex Query, and supports switching between graph projects and query result display.
+
+![query-button](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.Switch Graph Project
+
+The `Graph Query` function can only access one graph project data. Users can select and switch to other graph data in the `Switch Graph Project drop-down list`.
+
+![query-selectgraph](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.Statement Query
+
+The Browser provides a visual way to develop and debug graph query statements. Users can enter graph query statements, execute and return results, and support collecting statements and viewing graph models.
+
+![query-view](../../../images/browser/query-view.png)
+
+###### a.Statement Query Window
+
+Users enter graph query statements in the `Statement Query Window`, click the `Execute` button to run the corresponding statement, and display the result in the `Execution Result tab`.
+
+- Switch Query Language: Provides switching between different graph query language modes.
+    - _Currently only supports Cypher syntax._
+
+![query-selectgql](../../../images/browser/query-selectgql.png)
+
+- Statement Query Window: Provides syntax prompts for the current query language.
+
+![query-gqltips](../../../images/browser/query-gqltips.png)
+
+- Execute: Click the `Execute` button to send the entered query statement to the background for execution.
+
+![query-execute-button](../../../images/browser/query-execute-button.png)
+
+- Bookmark: Click the `Bookmark` button to save the content of the current statement query window as a template for future use.
+
+![query-bookmark-button](../../../images/browser/query-bookmark-button.png)
+
+- Download: Click the `Download` button to save the content of the current statement query window as a text file and download it to the local computer for future use.
+
+![query-download-button](../../../images/browser/query-download-button.png)
+
+For detailed Cypher usage guidelines, please refer to the document: [Cypher API](../8.query/1.cypher.md)
+
+###### b.Bookmark List
+
+Displays the collected query statements in a list, and clicking on a bookmark in the list allows using the statement. Supports keyword search, name modification, and deletion.
+
+![query-bookmark](../../../images/browser/query-bookmark.png)
+
+###### c.View Graph Model
+
+The Browser provides a graph model query for the current graph project, which allows users to query vertex types and edge types conveniently. It supports both list display and canvas graph display, and can be hidden.
+
+![query-schema-list](../../../images/browser/query-schema-list.png)
+![query-schema-graph](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.Path Query
+
+The Browser provides `Path Query templates`. Users can search whether corresponding paths exist in the graph data of the graph project by selecting paths.
+
+![pathquery-result](../../../images/browser/pathquery-result.png)
+
+- Path: Select the path to search in the path selection drop-down list.
+    - Select a Path: Based on the definition of the graph model, the system will automatically match the corresponding first-degree relationship path. Clicking the path drop-down box again will automatically match the next-degree relationship path based on the endvertex vertex type of the path.
+![pathquery-select](../../../images/browser/pathquery-select.png)
+    - Execute: Click the `Execute` button to return the matched paths in the graph project.
+    - Advanced Configuration: Set the number of paths to scan. The default is 100 paths.
+![pathquery-configuration](../../../images/browser/pathquery-configuration.png)
+
+_Note: The edges in the graph model need to set the starting vertex and endvertex. If no edge in the graph project has set the starting vertex and endvertex, the drop-down list will have no results._
+
+##### 2.4.3.4.Vertex Query
+
+The Browser provides `Vertex Query templates`. Users can query vertex data in the graph project by selecting vertex attributes.
+
+![vertexquery](../../../images/browser/vertexquery.png)
+
+- Select Vertex: Select the vertex type to be queried.
+    - Attribute: The system will automatically match the schema of the vertex type, set the corresponding query conditions, and click the execute button to return the results.
+- Return vertex Limit: Set the upper limit of the returned vertex data.
+
+![vertexquery-criteria](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.Execution Result Tab
+
+The Browser provides multiple ways to display graph query results, such as JSON view, JSON text, vertex-edge list, and vertex-edge view. It supports result download, data insertion, and full-screen display.
+
+###### a.JSON View
+
+The Browser provides JSON view to display query results.
+
+![query-result-jsonview](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON Text
+
+![query-result-jsontxt](../../../images/browser/query-result-jsontxt.png)
+
+###### c.Vertex-Edge List
+
+The Browser provides vertex and edge list to display query results.
+
+![query-result-list](../../../images/browser/query-result-list.png)
+
+###### d.Vertex-Edge View
+
+The Browser provides canvas view to display query results.
+
+![query-result-graph](../../../images/browser/query-result-graph.png)
+
+###### e.Data Insertion
+
+The Browser provides a visual way to insert vertex or edge data in the corresponding graph project. Click the `Insert Data` button, select the Vertex Type or Edge Type on the Insert Data tab, enter the attribute values, and click `OK` to complete the data insertion.
+
+![query-result-insert-button](../../../images/browser/query-result-insert-button.png)
+
+![query-result-insert](../../../images/browser/query-result-insert.png)
+
+###### f.Download Execution Result
+
+The Browser provides a function to export graph query results as text files. Click the `Download Execution Result` button, and the system will automatically save the result as a text file and download it to the local computer.
+
+![query-result-download](../../../images/browser/query-result-download.png)
+![query-result-downloadtxt](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.Full-Screen Display
+
+The Browser provides full-screen display for graph query results. Click the `Full-Screen` Display button to display the results in full screen, and click the `Exit Full Screen` button to exit full-screen display.
+
+![query-result-fullscreen-button](../../../images/browser/query-result-fullscreen-button.png)
+![query-result-fullscreen](../../../images/browser/query-result-fullscreen.png)
+![query-result-fullscreen-close](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.Graph Analysis
+
+Click the `Graph Analysis` button in the `Graph Project` tab in the `Graph Project` interface to display and analyze graph data on the canvas. The product provides `Query by Statement` and `Query by Configuration` to query and load data from the graph project to the canvas. It supports filtering, layout adjustment, and canvas operations on the canvas data.
+
+![graphanalysis-button](../../../images/browser/graphanalysis-button.png)
+
+As shown in the figure below, the graph analysis function mainly includes: 1. Operation bar: the main operation functions of graph analysis, including view switching, query filtering, layout style, and canvas operations; 2. Left sidebar: query, filter, and appearance operation area; 3. Canvas area: the area for displaying graph data, displaying vertex and edge data, supporting vertex expansion query, collapsing vertexs, fixing vertexs, deleting vertexs, and providing canvas graph data statistics; 4. Right sidebar: when a vertex or edge data is selected, the corresponding attribute information will be displayed; 5. Switch graph project: switch to different graph projects for analysis.
+
+![graphanalysis-operation-area](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.Query by Statement
+
+In the `Query by Statement` function, users can enter query statements to query graph data and load the data to the canvas area for display.
+- Syntax Description: TuGraph's query language and syntax documentation.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-query](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.Query by Configuration
+
+In the `Query by Configuration` function, users can select vertex types and enter attribute conditions to query graph data and load the data to the canvas area for display.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-configurequery](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.Canvas Analysis
+
+In the `Canvas Analysis` function, users can perform operations and analysis on the vertex or edge data on the canvas, including: expanding queries by selecting vertexs, collapsing/expanding vertexs, fixing vertexs, clearing the canvas, lassoing, vertex/edge retrieval, and canvas legend. The most basic operation on the canvas is dragging vertex data. By selecting a vertex with the left mouse button and moving the mouse, the position of the vertex data can be changed.
+
+###### a.Expand Query
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, move the mouse to `Expand Query`, and a secondary window will pop up. Click on the corresponding expansion degree to perform the query.
+- First-degree Query: Bidirectional expansion of first-degree relationships.
+- Second-degree Query: Bidirectional expansion of second-degree relationships.
+- Third-degree Query: Bidirectional expansion of third-degree relationships.
+- Custom Query: Expand based on selected conditions.
+    - Edge Direction: Set the direction of the expansion relationship, Bidirectional: includes outgoing edges and incoming edges, Outgoing: edges pointing outward from the selected starting vertex, Incoming: edges pointing to the selected starting vertex.
+    - Degree of Diffusion: The degree of expansion.
+    - Custom Return vertex Count: Configure the number of vertexs returned to the front end, default is 100, to prevent exceptions on the front end caused by super vertexs.
+    - Add Filter Group: Set the relationship type and attribute conditions of the expansion, multiple relationship types can be set.
+
+![graphanalysis-canvas-expand-before](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![graphanalysis-canvas-expand-after](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![graphanalysis-canvas-expand-custom](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.Collapse/Expand Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Collapse Vertexs` to hide the first-degree relationship Vertexs of the selected Vertexs; right-click on the collapsed Vertex data again to perform Expand Vertexs operation to show the hidden first-degree relationship Vertexs.
+
+![graphanalysis-canvas-collapse](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![graphanalysis-canvas-expand](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.Fix Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Fix vertexs` to fix the selected vertexs in place. The fixed vertexs cannot be moved (including layout adjustment); right-click on the fixed vertex data again to perform `Unfix vertexs` operation to restore the normal operation of the selected.
+
+![graphanalysis-canvas-fixed](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![graphanalysis-canvas-unfix](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.Delete Vertex
+
+Right-click on a vertex in the `Canvas` area to open the operation window. Click on `Delete Vertex` to remove the selected vertex from the canvas.
+
+![graphanalysis-canvas-delete](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.Clear Canvas
+
+Click on the `Clear Canvas` button in the `Toolbar` area to clear all data on the canvas.
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.Vertex/Edge Retrieval
+
+Select a vertex or edge in the `Vertex/Edge Retrieval` window and enter a keyword to perform a fuzzy search for attribute data on the canvas. After the search, you can locate the data position.
+
+![graphanalysis-canvas-retrieval](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.Canvas Legend
+
+In the legend area of the `Canvas` area, the vertex types in the canvas will be displayed. Click on a vertex type to select the corresponding vertex data. Click on the "More" button to display the statistics, which can be displayed in a list or chart format to show the number of vertexs or edges.
+
+![graphanalysis-canvas-legend-list](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![graphanalysis-canvas-legend-chart](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.Attribute Filter
+
+Click on the `Filter` button in the `Toolbar` area, and click on `Attribute Filter` in the `Sidebar` to perform filter and filtering. Users can select the vertex or edge types to be filtered, and set the corresponding attribute values. After retrieving the filtered group conditions, the corresponding vertex or edge data will be highlighted on the canvas.
+- Please select the vertex/edge type: Select the vertex type or edge type to be searched.
+- Attribute condition: Set the attribute conditions to be searched. Multiple groups can be set to take the union of the filtering results.
+- Add filter group: Multiple filter conditions can be set to take the union of the filtering results.
+- Reset: Clear the filter conditions.
+
+![graphanalysis-queryfilter-attributefilter](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.Statistical Filter
+
+Click on the Filter button in the Toolbar area, and click on Statistical Filter in the Sidebar to perform statistical filtering of canvas data. Users can select the vertex or edge types to be counted, and set the corresponding attribute values. The system will automatically group and count based on the selected vertex/edge types and attributes. The results can be displayed in chart and list formats. Clicking on the values in the chart or list area will highlight the corresponding data on the canvas.
+
+![graphanalysis-queryfilter-statisticalfilter](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![graphanalysis-queryfilter-statisticalfilter-chartswitch](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.Layout Style
+
+Click on the `Layout` button in the `Toolbar` area, and select the corresponding layout method to rearrange the data on the canvas. It supports force-directed layout, concentric circle layout, circular layout, radial layout, Dagre layout, and grid layout. Each layout method has different layout parameters. After adjusting the parameters, the data on the canvas will be rearranged.
+
+![graphanalysis-style-layout-button](../../../images/browser/graphanalysis-style-layout-button.png)
+![graphanalysis-style-layout-parameters](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+For detailed layout parameters, please refer to[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide).
+
+##### 2.4.4.6.Appearance Style
+
+Click on the `Appearance` button in the `Toolbar` area, and click on `Vertex Style` or `Edge Style` in the `Sidebar` to configure the appearance style.
+- Vertex Style
+    - Apply to vertex type: Set the display style for the corresponding vertex type. Multiple vertex types can be configured simultaneously.
+    - Size: The display size for the corresponding vertex type.
+    - Color: The display color for the corresponding vertex type.
+    - Icon: The icon style for the corresponding vertex type.
+    - Display Text: The text content displayed for the corresponding vertex type, defaulting to id.
+    - Advanced Configuration: Mark the corresponding vertex data based on the set conditions.
+- Edge Style
+    - Apply to Edge Type: Set the display style for the corresponding edge type, supports configuring the appearance of multiple edge types simultaneously.
+    - Color: The display color for the corresponding edge type.
+    - Width: The display width for the corresponding edge type.
+    - Display Text: The text content displayed for the corresponding edge type, not displayed by default.
+    - Advanced Configuration: Display the corresponding edge data based on the set conditions.
+
+![graphanalysis-style-appearance](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.Console
+
+The `Console` provides a visualized account management and database information viewing function. It provides users with comprehensive account and role management functions, including adding, deleting, modifying, and disabling accounts and roles. In addition, it also provides users with convenient database information viewing function, allowing users to easily view the basic information and configuration information of the graph database. Basic information mainly includes version number, running time, CPP compilation version number, etc., while database configuration information includes port number, system function parameter configuration, etc.
+
+#### 2.5.1.Account Management
+
+##### 2.5.1.1.Account Management
+
+##### a.Add Account
+
+Click the `Add` button in the `Account Management` interface to create a new account. Users need to enter the account name, account description, account password, and related roles.
+
+- Account Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Related Roles: When creating a new account, you must select a role. After the account is added successfully, the system will automatically generate a role with the same name as the account name.
+
+![account-add-button](../../../images/browser/account-add-button.png)
+![account-add](../../../images/browser/account-add.png)
+
+##### b.Edit Account
+
+Click the `Edit` button in the `Account Management` interface to edit the account description, account password, and related roles.
+
+![account-edit](../../../images/browser/account-edit.png)
+
+##### c.Disable Account
+
+Click the `Disable` button in the `Account Management` interface to prevent the corresponding account from logging in and accessing. Click the `Enable` button to enable the corresponding account login and access permissions.
+
+![account-disable](../../../images/browser/account-disable.png)
+![account-enable](../../../images/browser/account-enable.png)
+
+##### d.Delete Account
+
+Click the `Delete` button in the `Account Management` interface to delete the corresponding account.
+
+![account-delete](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.Role Management
+
+##### a.Add Role
+
+Click the `Add` button in the `Role Management` interface to create a new role. Users need to enter the role name, role description, and graph permissions.
+
+![role-add-button](../../../images/browser/role-add-button.png)
+
+- Role Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Graph Permissions: The browser supports four types of graph permission configurations: All, Read/Write, Read-Only, and None.
+    - All: corresponds to the read and write permissions of the graph, including editing the graph model permissions (schema).
+    - Read/Write: corresponds to the write permission of the graph, but does not include the permission to edit the graph model (schema).
+    - Read-Only: corresponds to the read permission of the graph.
+    - None: cannot access or operate the corresponding graph.
+- Role Conflict: When two roles have different graph permissions for the same graph, and both roles are authorized to the same account, the graph permission of the account for the graph is the union of the graph permissions of the two roles.
+
+![role-add](../../../images/browser/role-add.png)
+
+##### b.Edit Role
+
+Click the `Edit` button in the `Role Management` interface to edit an existing role. Users can edit the role description and graph permissions.
+
+![role-edit](../../../images/browser/role-edit.png)
+
+##### c.Disable Role
+
+Click the `Disable` button in the `Role Management` interface to disable the corresponding role. Click the `Enable` button to enable the corresponding role. After the role is disabled, the corresponding graph permissions of the role become invalid.
+
+- Disabled Role: After the role is disabled, the corresponding graph permissions become invalid.
+    - When a user has two roles with operating permissions on the same graph, if one of the roles is disabled, the permission of the other role is still valid.
+
+![role-disable](../../../images/browser/role-disable.png)
+![role-enable](../../../images/browser/role-enable.png)
+
+##### d.Delete Role
+
+Click the `Delete` button in the `Role Management` interface to delete the corresponding role.
+
+![role-delete](../../../images/browser/role-delete.png)
+
+#### 2.5.2.Database Information
+
+##### 2.5.2.1.Basic Information
+
+`Basic Information` obtains the current running status of the system and displays key information.
+
+![db_basic](../../../images/browser/db_basic.png)
+
+|Parameter    |Meaning    |
+|-------|--------|
+|TuGraph Version Number|The current version number of TuGraph, x.x.x|
+|Running Time|The time from when TuGraph service starts to now|
+|Server Code Version|The current commit of the tugraph-db repository|
+|Front-end Code Version|The current commit of the tugraph-web repository|
+|CPP Compiler Version|The CPP version number when compiling TuGraph|
+|Python Version Number|The Python version number when compiling TuGraph|
+|CPP Compiler ID|The CPP type when compiling TuGraph|
+
+The current running status of the system can also be obtained through commands.
+
+```cypher
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.Database Configuration Information
+
+`Database Configuration Information` obtains the current configuration parameters of the system and displays key information. To adjust the configuration parameters or understand the detailed configuration parameters, please refer to [Database Running-Service Configuration](../5.installation&running/7.tugraph-running.md).
+
+![db_configuration](../../../images/browser/db_configuration.png)
+
+| Parameter                   | Meaning                                                                                                                                         |
+|-----------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------|
+| bind_host                   | The host set when the system starts, usually 0.0.0.0                                                                                            |
+| disable_auth                | Whether to disable the regular update of token authentication. If set to true, the token can be used permanently                                |
+| durable                     | Whether to enable persistent storage of the underlying layer. If set to false, the data is updated asynchronously to the disk                   |
+| enable_audit_log            | Whether to enable audit log                                                                                                                     |
+| enable_backup_log           | Whether to enable real-time incremental backup                                                                                                  |
+| enable_fulltext_index       | Whether to enable full-text indexing                                                                                                            |
+| enable_ip_check             | Whether to enable IP whitelist                                                                                                                  |
+| enable_rpc                  | Whether to enable the RPC port                                                                                                                  |
+| enable_ssl                  | Whether to enable SSL encrypted transmission                                                                                                    |
+| optimistic_txn              | Whether to enable optimistic multi-threaded write transactions                                                                                  |
+| port                        | The REST access port of the current system                                                                                                      |
+| rpc_port                    | The port used by the RPC and HA services                                                                                                        |
+| subprocess_max_idle_seconds | The maximum idle time of the subprocess, a thread pool parameter                                                                                |
+| thread_limit                | The maximum number of threads used by the server at the same time                                                                               |
+| verbose                     | The level of detail of the log output information. It can be set to 0, 1, or 2, with larger values indicating more detailed output information. |
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..c0a3a1674b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# TuGraph Browser(old version)
+
+> This document focuses on the use of TuGraph Browser
+
+## Definition
+
+TuGraph Browser is a visual development tool provided by TuGraph.
+
+## Functionality
+
+TuGraph Browser provides graph database developers with functions such as visual graph data development, graph data management and maintenance.
+
+## How to use it
+
+### 1. Connect to the database
+
+When the user completes the installation of the graph database, you can access it through the Browser, TuGraph Browser tool. The user only needs to type in the browser address bar: IP of the server where TuGraph is located :Port. The default port is 7090.
+
+### 2. Login
+
+![alt Login](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- When the page is opened successfully, the first thing you see is the login page, and the user needs to fill in the account number and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change the initialized password in time after logging in
+
+### 3. Workbench
+
+#### 3.1 Quick Start
+
+- When you log in for the first time, the system will create an empty graph by default
+
+  ![alt quick start](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- The user clicks on the help option and selects Get Started quickly
+
+  ![alt help](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- Then click "One-click Create Model" -- >" One-click Create Data "to complete the construction of the built-in Movie data graph
+
+#### 3.2 Create subgraphs and examples
+
+##### 3.2.1 Create a subgraph
+
+- Click on New subgraph
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- Fill in the form information
+  ![alt Fill out the form](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+- Subgraph name
+- Subgraph description
+- Configuration information
+- Click OK to prompt that creation succeeded
+- Toggle the subgraph
+  ![alt Toggle subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- Click New Example
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- Select the example and click Create
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 query
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 User Interface Layout
+
+- Cypher input box
+- Result set display area
+
+##### 3.3.2 Result set display area function details
+
+- Result set tag display and functions
+  ![alt Result set tag](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+- All types of statistics for the result set are shown here
+- Click on the different "label" to make the following changes
+  -Change the display color
+- Modify the node size or edge thickness
+- Modify default display properties or system properties
+- Layout modification
+- Force guide layout
+- Grid layout
+- Tree layout
+- Environment layout
+- edge polymerization
+- Edges of the same type and direction can be merged
+- Create nodes
+- Click the Create Node button
+- Select the node type
+- Add node content
+- Create relationships
+- Select start and end points in the canvas
+- Select the type that can be matched
+- Enter node information
+- Stop layout
+- When too much data is causing the browser page to stall, you can click this stop layout button to improve the smoothness of the experience
+- Mouse hover
+- Enable this feature to highlight the one-degree neighbors of the mouse-over node
+- Result set export
+- Result sets can be exported as png, json, csv three different file forms
+- the refresh
+- Clicking the refresh button will re-execute the initial cypher statement for the current page and refresh the result set
+  Maximize -
+  -Click Maximize button, the result set display area will be displayed in full screen
+- Result set display mode switching
+  - Support graph, table and text modes
+
+##### 3.3.3 Schema
+
+- model
+  ![Modeling Alt](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- schema supports real-time addition, deletion, modification and query
+
+- schema supports import and export
+
+##### 3.3.4 Data import
+
+- Local data import
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+- Select the file encoding format
+- Select a local CSV file
+- Select the model for the corresponding node or edge
+- Do the data mapping
+- Complete the data import
+- The maximum supported size for a single file is 2GB.
+
+##### 3.3.5 plug-in (Stored Procedure)
+
+- Use of plug-ins
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+- Users can upload the plug-in program written locally, execute it in the visual page, and view the execution result
+- Users can perform, uninstall, execute, and download plug-ins in the visualization page
+
+##### 3.3.6 Help
+
+- where it records how TuGraph-browser is used
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 Console
+
+##### 3.4.1 Basic database information
+
+- Displays basic database configuration information
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 Permission management
+
+- A function module used to create users and roles. Users can manage permissions here
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 Live status
+
+- This shows the database real-time status, including: CPU usage, memory usage, disk usage, number of data requests, disk IO
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 Task Management
+
+- Here the user can see the task in execution and stop the task
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 Audit logs
+
+- Database related audit logs recorded here, used to troubleshoot problems encountered in use
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6c4d063e26
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB User Guide
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..f2cdffe578
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/1.environment.md
@@ -0,0 +1,41 @@
+# Environment
+
+> This document provides an overview of the required hardware and software environment for deploying TuGraph.
+
+## 1.Hardware Environment
+
+### 1.1. CPU
+TuGraph supports X86_64 and ARM64 architectures for both physical, virtual, and containerized environments. Tested and certified hardware platforms include Intel, AMD, Kunpeng, Hygon, Feiteng, and others.
+
+### 1.2. Memory
+We recommend having a memory capacity that is equal to or greater than the actual data size. For optimal performance, caching all data in memory is ideal. In terms of data locality, graph databases have poorer locality compared to relational databases. Therefore, if the data cannot fit in memory, frequent swapping may occur.
+
+### 1.3. Storage
+We strongly recommend using NVMe SSD as external storage. The database performs numerous synchronous write operations, often in a random manner, making the read/write performance of the external storage critical to the overall database performance. Hence, high IOPS and low-latency NVMe SSDs are the optimal choice.
+
+If circumstances permit only the use of SATA interface SSDs or cloud-based network disks, although performance may be affected, TuGraph can still run correctly.
+
+It is recommended to have external storage size at least four times the actual data size. For example, if the data size is 1TB, preparing a 4TB hard drive would be more reliable.
+
+
+
+## 2. Software environment
+
+### 2.1. Operating System
+
+TuGraph is compatible with popular operating systems, including Ubuntu, CentOS, SUSE, Galaxy Kylin, China Standard Software, UOS, and others, all of which have been tested and certified.
+
+Among them, the most stable system versions are Ubuntu 18.04, CentOS 7, and CentOS 8.
+
+### 2.2. System Libraries
+
+The requirements for system libraries differ between the compilation environment and the runtime environment. For specific details, please refer to the[environment mode](2.environment-mode.md)。
+
+## 3.Recommended Configuration
+
+| Hardware | Minimum Configuration	   | Recommended Configuration                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| Memory   | 4GB       | 512GB                    |
+| Storage  | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..98f9820ba2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,24 @@
+# Environment Mode
+
+> This document primarily introduces the three types of environments involved in TuGraph.
+
+## 1.Classification
+
+Based on the different functionalities supported by the environments, they can be categorized into the following:
+
+* The compilation environment has all dependent libraries for TuGraph compilation, including all dependencies of the running environment, and can compile TuGraph source code, but does not include precompiled TuGraph executable files and library files for developers to compile source code.
+
+* Running environment, with GCC/Java/Python environment, can run all functions of TuGraph, and can host full-text indexing, java client, c++ source code uploaded as plugin, and complete functions of python plugin, built-in TuGraph precompiled executable file and library files for customers to install and use directly without compiling source code.
+
+* Simplified operating environment, which is approximately equivalent to a bare system plus precompiled TuGraph. It can only run the basic functions of TuGraph. There is no C++ plugin to compile and run, only so upload, no full-text index, and no python plugin. It is for quick setup and trial use.
+After compiling TuGraph, all the required dependencies are packaged together in the form of .a files, eliminating the need for unnecessary additional dependencies during runtime. However, since TuGraph supports stored procedures, which involve compiling C++ code on the server, the required compilers still need to be present in the environment.
+
+## 2.System Library
+
+For the three types of environments, the required system libraries, excluding the TuGraph runtime package, are as follows:
+
+* Compilation Environment: It includes GCC, Python, Java compilers, as well as libraries such as ANTLR4 and Pybind11. Please refer to the tugraph-compile-*-Dockerfile for more details.
+
+* Runtime Environment: The main dependencies introduced by stored procedures include GCC, Boost, CMake, and others. Please refer to the tugraph-runtime-*-Dockerfile for more details.
+
+* Mini-Runtime Environment: There are no additional system library dependencies. Please refer to the tugraph-mini-runtime-*-Dockerfile for more details.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..bb966b75b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,103 @@
+# Docker Deployment
+
+>This document introduces the creation and download of Docker images for TuGraph Compile and TuGraph Runtime.
+
+## 1.Introduction
+
+- TuGraph Compile Image: Provides a compilation environment and can be used for TuGraph compilation and testing.
+- TuGraph Runtime Image: Provides a binary executable environment with TuGraph library and executable files.
+- TuGraph Mini Runtime Image: Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+## 2.Existing Docker Images
+
+### 2.1.Image Download
+
+The images are hosted on [DockerHub]( https://hub.docker.com/u/tugraph ) and can be downloaded and used directly.
+
+For the latest version of Docker address, see the TuGraph-Latest-Version section in [Guide](../../1.guide.md).
+
+### 2.2.Naming Convention
+
+#### 2.2.1.TuGraph Compile Image
+
+Provides a compilation environment and can be used for TuGraph compilation.
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+For example: `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+Provides a binary executable environment with TuGraph library and executable files.
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example:`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example: `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.Common Docker Operations
+
+Docker is generated from Dockerfile. Note that creating images requires downloading dependencies, so network issues may cause slow creation or creation failure. Do not overwrite images unless the tag is `latest`.
+
+build Compile image
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+build Runtime / Mini Runtime image
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+Modify image name
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+push image
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+pull image
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+save image
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+load image
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+Refer to the [docker official documentation](https://docs.docker.com/engine/reference/commandline/cli ) for other Docker operations.
+
+### 2.4. M1 Supports
+
+Running amd64 containers on M1-chip machines may cause unknown errors. TuGraph provides arm64 images for M1 machines. Contains compile and runtime images.
+
+In `tugraph-runtime-centos7:3.6.0` and `tugraph-compile-centos7:1.2.7` and later, `tugraph-runtime-centos7` and `tugraph-compile-centos7` provide images of two architectures: linux/amd64 and linux/arm64/v8. You can obtain the arm64 architecture image through docker pull on the M1 machine.
+
+## 3. Best Practice in Using and Developing Docker Images for TuGraph-DB
+
+Please carefully read the points below and follow them if you are new to contribute to TuGraph.
+
+- To get rid of too much docker layer, please add your dependency to the Docker with the style writing ENV and RUN in a
+  single line.
+- For the packages/resources you need to build the dependency, use the original ones instead of tweaking them without
+  tracking by VCS. And then contact TuGraph team to upload it to OSS to accelerate the building process, as the urls you
+  see in the Dockerfiles.
+- To make the development more efficient, you would better start from adding dependencies to base TuGraph Compile Images
+  and then reproduce the process in the Dockerfile after confirming the enviroment works.
+- CI uses the docker images. Please check the dependency problems if your CI fails.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..cb40030596
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# Local Package Deployment
+
+> This document describes TuGraph Local Package Deployment.
+
+## 1. Environment preparation
+
+TuGraph local package deployment requires a corresponding environment, and quick verification can use streamlined installation packages, which require almost no third-party libraries.
+
+If you need to use the complete TuGraph function, please refer to the tugraph-db source code directory ci/images/tugraph-runtime-*-Dockerfile. This script contains the complete environment construction process.
+
+## 2. Download the installation package
+
+For the latest version of the installation package address, see "TuGraph-Latest-Version" of [Guide](../../1.guide.md) 
+
+You can also visit Github to download: [TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. Installation method under CentOS
+
+The .rpm installation package for TuGraph installed on CentOS, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.rpm installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+Users can also specify the installation directory by specifying the `--prefix` option.
+
+## 4. Installation method under Ubuntu
+
+A .deb installation package for TuGraph installed on Ubuntu, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.deb` installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+This command installs TuGraph in the `/usr/local` directory by default. Users can also change the installation directory by specifying the `--instdir=<directory>` option.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..77bfda5171
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,128 @@
+# Cloud Deployment
+
+> This document mainly introduces the cloud deployment of TuGraph, and you can also refer to the[Alibaba Cloud ComputeNest deployment document.](https://aliyun-computenest.github.io/quickstart-tugraph/)。
+
+## 1.Introduction
+
+TuGraph (tugraph.antgroup.com) is a high-performance graph database of Alibaba Group. TuGraph provides community version services on ComputeNest, so you can quickly deploy TuGraph services on ComputeNest and achieve operation and maintenance monitoring, thereby building your own graph application. This document introduces how to open TuGraph community version services on ComputeNest, as well as deployment process and usage instructions.
+
+## 2.Instance Description
+
+TuGraph is deployed as a community open source version, and the source code can be found in the Github Repo. Currently, the available instance specifications are as follows:
+
+| Instance Family | vCPU and Memory             | System Disk                | Public Bandwidth         |
+|-----------------|-----------------------------|----------------------------|--------------------------|
+| ecs.r7a.xlarge  | AMD Memory r7a, 4vCPU 32GiB | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+| ecs.r6.xlarge   | Memory r6, 4vCPU 32GiB      | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+
+Estimated costs can be seen in real time when creating instances (currently free). If you need more specifications or other services (such as cluster high availability requirements, enterprise-level support services, etc.), please contact us at tugraph@service.alipay.com.
+
+## 3.Deployment Process
+
+### 3.1.Preparation
+
+Before starting to use, you need an Alibaba Cloud account to access and create resources such as ECS and VPC.
+
+- If you use a personal account, you can directly create a service instance.
+- If you create a service instance using a RAM user and use Alibaba Cloud ComputeNest for the first time:
+    - Before creating a service instance, you need to add permissions for the corresponding resources to the account of the RAM user. For detailed operations on adding RAM permissions, please see Grant RAM user permissions. The required permissions are shown in the following table.
+    - Authorization to create associated roles is also required. Refer to the following figure and select Agree to authorize and create associated roles.
+
+| Permission Policy Name          | Remark                                                                       |
+|---------------------------------|------------------------------------------------------------------------------|
+| AliyunECSFullAccess             | Permissions for managing cloud server services (ECS)                         |
+| AliyunVPCFullAccess             | Permissions for managing Virtual Private Cloud (VPC)                         |
+| AliyunROSFullAccess             | Permissions for managing Resource Orchestration Service (ROS)                |
+| AliyunComputeNestUserFullAccess | Permissions for managing ComputeNest services (ComputeNest) on the user side |
+| AliyunCloudMonitorFullAccess    | Permissions for managing Alibaba Cloud Monitor (CloudMonitor)                |
+
+![Cloud Deployment](../../../images/cloud-deployment-1.png)
+
+### 3.2.Deployment Entrance
+
+You can search in Alibaba Cloud ComputeNest, or quickly access it through the following deployment link.
+
+[Deployment Link](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.Apply for Trial Use
+
+Before formal trial use, you need to apply for trial use, fill in the information as prompted, and create the TuGraph service after passing the review.
+
+![Apply for Trial Use](../../../images/cloud-deployment-2.png)
+
+### 3.4.Create TuGraph Service
+
+#### 3.4.1.Parameter List
+
+During the process of creating a service instance, you need to configure the parameter list of the service instance information. The specific parameters are as follows.
+
+| Parameter Group                              | Parameter Item  | Example                 | Description                                                                                                                            |
+|----------------------------------------------|-----------------|-------------------------|----------------------------------------------------------------------------------------------------------------------------------------|
+| Service Instance Name                        | N/A             | test                    | The name of the instance.                                                                                                              |
+| Region                                       | N/A             | China East 1 (Hangzhou) | Select the region of the service instance. It is recommended to select nearby regions to obtain better network latency.                |
+| Payment Type Configuration                   | Payment Type    | Pay-As-You-Go           | For free use, please select Pay-As-You-Go.                                                                                             |
+| Availability Zone Configuration              | Deployment Area | Availability ZoneI      | Different available zones under the region, ensure that the instance is not empty.                                                     |
+| Select Existing Basic Resource Configuration | VPC ID          | vpc-xxx                 | Select the ID of the Virtual Private Cloud according to the actual situation.                                                          |
+| Select Existing Basic Resource Configuration | Switch ID       | vsw-xxx                 | Select the Switch ID according to the actual situation. If the Switch ID cannot be found, try switching the region and available zone. |
+| ECS Instance Configuration                   | Instance Type   | ecs.r6.xlarge           | Currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications.                                                                    |
+|ECS Instance Configuration|	Instance Password|	**|	Set the instance password. Length of 8-30 characters, must include three items (uppercase letters, lowercase letters, numbers, special characters in ()`~!@#$%^&*_-+={}[]:;'<>,.?/).
+|
+
+#### 3.4.2.Specific Steps
+
+The creation of the service is carried out according to the following steps, refer to the figure below:
+
+- Create an instance name, such as "test" in the figure below
+- Select the region, such as "China East 1 (Hangzhou)" in the figure below
+
+![Create Instance](../../../images/cloud-deployment-3.png)
+
+- Select the instance type, currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications. If there is no model available in the list, try selecting other deployment areas.
+- Select the model
+- Configure the password for the instance
+- Select the deployment area, such as "Availability Zone I" in the figure below
+
+![Select Region](../../../images/cloud-deployment-4.png)
+
+- Click next to enter the order confirmation page
+- Check the checkboxes for "Permission Confirmation" and "Service Terms"
+- Click the green "Start Free Trial" button in the lower left corner to create a service instance
+
+![Confirmation](../../../images/cloud-deployment-5.png)
+
+### 3.5.Start TuGraph Service
+
+- View the service instance: After the service instance is created successfully, it takes about 2 minutes for deployment. After the deployment is complete, you can see the corresponding service instance on the page, as shown in the figure below.
+
+![View Instance](../../../images/cloud-deployment-6.png)
+
+- Click the service instance to access TuGraph. After entering the corresponding service instance, you can get 3 ways to
+  use it on the page: web, rpc, ssh. You can also see the password of user admin on the page.
+
+![Access Method](../../../images/cloud-deployment-7.png)
+
+- Click the link of web to jump to the deployed TuGraph Web. It is recommended that novice users first use the demo to quickly get started with TuGraph.
+    - First, on the TuGraph Web login page, enter the default username (admin) and the password on the page to log in, as shown in the figure below.
+    - After the login is completed, click "New Instance" -> "Create Instance" in sequence, wait for the creation to be completed, and the steps in 3 will change to green in turn, and it will automatically switch to the subgraph MovieDemo1, as shown in the figure below.
+
+![Login](../../../images/cloud-deployment-8.png)
+![Create Demo](../../../images/cloud-deployment-9.png)
+
+## 4.Common FAQs
+
+### No available resources in the selected deployment area
+
+Sometimes, the selected deployment area (such as Availability Zone G) does not have available resources for the selected package, and an error will be reported as shown in the figure below.
+
+![Deployment Error](../../../images/cloud-deployment-10.png)
+
+__Solution__:Try selecting other regions, such as Availability Zone I
+
+### Unaccessible to the web port
+
+It takes some time for the server to get ready. Just wait for a few seconds.
+
+
+### Username or password is not correct
+
+Please make sure that you are using the password on the page instead of the default one.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..2f28bee61e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/6.compile.md
@@ -0,0 +1,31 @@
+# Compile
+
+> This document mainly describes how to compile TuGraph from source code.
+
+## 1.Prerequisites
+
+It is recommended to build TuGraph on a Linux system. Meanwhile, Docker is a good choice. If you want to set up a new environment, please refer to [Dockerfile](3.docker-deployment.md)。
+
+## 2.compile
+
+Here are steps to compile TuGraph:
+
+1. run `deps/build_deps.sh` to build tugraph-web if you need. Skip this step otherwise.
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If support shell lgraph_cypher, use `-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`
+4. If compiling on an arm machine (such as a Mac with M1 chip), add `-DENABLE_BUILD_ON_AARCH64=ON`
+5`make`
+6`make package` or `cpack --config CPackConfig.cmake`
+
+Example:
+`tugraph/tugraph-compile-centos7`Docker environment
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..36387de079
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,202 @@
+# Tugraph Running
+
+> This document describes the operation mode of the TuGraph service, starting, stopping, and restarting operations.And TuGraph's service configuration parameters, configuration file format, and command-line configuration parameters.
+
+## 1. Prerequisites
+TuGraph has the following prerequisites for its execution: a correct [installation of TuGraph](1.environment.md).
+
+TuGraph execution requires ensuring that the library file "liblgraph.so" is located in the environment variable LD_LIBRARY_PATH.
+
+The user running the TuGraph process does not need superuser privileges. However, they need read permissions for the configuration file (usually lgraph.json) and any files referenced within it. Additionally, they should have write permissions for data folders, log files, etc.
+
+## 2.The operation mode
+
+TuGraph can be started as a normal process in the foreground or as a daemon in the background.
+
+When running as a normal process, TuGraph can print logs directly to the terminal, which is handy when debugging server configurations. However, because the foreground process is terminated after the terminal exits, the user must ensure that the terminal remains open while the TuGraph server is running. In daemon mode, on the other hand, the TuGraph server can continue to run even if the terminal that started it exits. If TuGraph needs to run for a long time, it is recommended to start the TuGraph server in daemon mode.
+
+### 2.1.Running a normal process
+
+The `lgraph_server -d run` command runs TuGraph as a normal process. Normal processes depend on the command line terminal, so when the terminal ends, the TuGraph process is automatically terminated. Normal process mode with `--log_dir ""` can output the process log directly to the terminal, so it is easier to debug.Note: When not using the `-d run` command, the default behavior is to run as a normal process.
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d run -c lgraph_standalone.json --log_dir ""
+```
+or:
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+Example of running output in normal mode：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+In normal process mode, the user can prematurely terminate the TuGraph process by pressing 'CTRL+C'.
+
+### 2.2.Run process daemon mode
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+Example output from running in daemon mode:
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+## 3.Service operation
+
+### 3.1.Start the service
+
+TuGraph needs to be started using the 'lgraph_server -d start' command line. The following is an example of the command to start TuGraph:
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+### 3.2.Stop the service
+
+You can stop the TuGraph daemon using the 'kill' command and the 'lgraph_server -d stop' command. Since it is possible to run multiple TuGraph server processes on the same computer, we distinguish between the different server processes using the '.pid 'file, which is written to the working directory where the process was started. Therefore, you need to run the command 'lgraph_server-d stop' in the same working directory to stop the correct server process.
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.Restart the service
+
+Users can also restart the TuGraph service by 'lgraph_server -d restart' :
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.Service configuration
+
+The TuGraph server loads configurations from the configuration file and command line options at startup, and if different values are specified for the same option in the configuration file and command line, the value specified in the command line will be used preferentially.
+
+### 4.1.Configuration parameters
+
+The parameters and their types are described as follows:
+
+| **Parameter names**          | **<nobr>Type</nobr>** | **Instructions**                                                                                                                                                                                                                                                                                                                                                                            |
+|------------------------------|-----------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                    | string                | Directory where data files are stored. If the directory does not exist, it is automatically created. The default directory is /var/lib/lgraph/data.                                                                                                                                                                                                                                         |
+| durable                      | boolean               | Whether to enable real-time persistence. Turning off persistence can reduce the disk IO overhead when writing, but data may be lost in extreme cases such as machine power failure. The default value is `true`.                                                                                                                                                                            |
+| host                         | string                | The IP address on which the REST server listens. The default address is 0.0.0.0. Note: In HA mode, the host needs to be set to the IP address of the corresponding server and cannot be set to 0.0.0.0.                                                                                                                                                                                     |
+| port                         | int                   | The Port on which the REST server listens. The default port is 7070.                                                                                                                                                                                                                                                                                                                        |
+| enable_rpc                   | boolean               | Whether to use RPC services. The default value is false.                                                                                                                                                                                                                                                                                                                                    |
+| rpc_port                     | int                   | Port used by RPC and HA services. The default port number is 9090.                                                                                                                                                                                                                                                                                                                          |
+| enable_ha                    | boolean               | Whether to enable the HA mode. The default value is false.                                                                                                                                                                                                                                                                                                                                  |
+| ha_log_dir                   | string                | HA log directory. The HA mode needs to be enabled. The default value is null.                                                                                                                                                                                                                                                                                                               |
+| verbose                      | int                   | Detail level of log output information. The value can be 0,1,2. The larger the value, the more detailed the output information. The default value is 1.                                                                                                                                                                                                                                     |
+| log_dir                      | string                | Directory where log files are stored. The default directory is /var/log/lgraph/.                                                                                                                                                                                                                                                                                                            |
+| ssl_auth                     | boolean               | Whether to use SSL authentication. When HTTPS is enabled, only the HTTPS service is enabled on the REST server. The default value is false.                                                                                                                                                                                                                                                 |
+| web                          | string                | The directory where the web files (including the visual part) are located. The default directory is/usr/local/share/lgraph/resource.                                                                                                                                                                                                                                                        |
+| server_cert                  | string                | certificate file path used by the server when SSL authentication is enabled. The default path is/usr/local/etc/lgraph/server - cert.pem.                                                                                                                                                                                                                                                    |
+| server_key                   | string                | The public key file used by the server when SSL authentication is enabled. The default directory is/usr/local/etc/lgraph/server - key.pem。                                                                                                                                                                                                                                                  |
+| enable_audit_log             | boolean               | Whether to enable audit logs. The default value is false.                                                                                                                                                                                                                                                                                                                                   |
+| audit_log_expire             | int                   | When audit logs are enabled, the validity period (hours) of audit logs is automatically cleared upon timeout. If the value is 0, the logs are not cleared. The default value is 0.                                                                                                                                                                                                          |
+| audit_log_dir                | string                | Specifies the directory for storing log files when audit logs are enabled. The default directory is $directory/_audit_log_.                                                                                                                                                                                                                                                                 |
+| load_plugins                 | boolean               | Import all stored procedures when starting the service. The default value is true.                                                                                                                                                                                                                                                                                                          |
+| optimistic_txn               | boolean               | Enable optimistic multithreaded write transactions for Cypher. The default is false.                                                                                                                                                                                                                                                                                                        |
+| disable_auth                 | boolean               | Disable REST authentication. The default is false.                                                                                                                                                                                                                                                                                                                                          |
+| ha_snapshot_interval_s       | int                   | Snapshot interval (in seconds). The default value is 604800. -1 means not to automatically generate snapshots.                                                                                                                                                                                                                                                                              |
+| ha_heartbeat_interval_ms     | int                   | Heartbeat interval in milliseconds. The default value is 1000.                                                                                                                                                                                                                                                                                                                              |
+| ha_node_offline_ms           | int                   | The heartbeat times out and the interval (in milliseconds) between nodes going offline. The default value is 60000.                                                                                                                                                                                                                                                                         |
+| ha_node_remove_ms            | int                   | The interval (in milliseconds) at which a node is considered completely dead and removed from the list. The default value is 120000.                                                                                                                                                                                                                                                        |
+| ha_first_snapshot_start_time | string                | The time when the first snapshot is taken, the format is "HH:MM:SS", which means the first snapshot is taken at the next HH:MM:SS time point, and then every ha_snapshot_interval_s seconds. The default value is "", which means that the first snapshot is taken randomly at any time within 0-ha_snapshot_interval_s, and then a snapshot is taken every ha_snapshot_interval_s seconds. |
+| enable_ip_check              | boolean               | Allow IP address whitelists. The default value is false。                                                                                                                                                                                                                                                                                                                                    |
+| idle_seconds                 | int                   | The maximum number of seconds a child process can be idle. The default value is 600.                                                                                                                                                                                                                                                                                                        |
+| enable_backup_log            | boolean               | Whether to enable backup logging. The default value is false.                                                                                                                                                                                                                                                                                                                               |
+| backup_log_dir               | string                | The directory where backup files are stored. The default value is null.                                                                                                                                                                                                                                                                                                                     |
+| snapshot_dir                 | string                | Directory where snapshot files are stored. The default value is null.                                                                                                                                                                                                                                                                                                                       |
+| thread_limit                 | int                   | The maximum number of threads that can be used simultaneously. The default value is 0, which means that no restriction is imposed. The license file prevails.                                                                                                                                                                                                                               |
+| unlimited_token              | boolean               | Whether to set the link token to be infinite. The default value is false and the validity period is 24 hours.                                                                                                                                                                                                                                                                               |
+| reset_admin_password         | boolean               | Whether to reset the password. The default value is false. When the value is true, the password will be reset to "73@TuGraph"。                                                                                                                                                                                                                                                              |
+| enable_fulltext_index        | boolean               | Whether to enable the full-text index function, the default value is false.                                                                                                                                                                                                                                                                                                                 |
+| fulltext_analyzer            | string                | Full-text index tokenizer type. Can be set to `StandardAnalyzer` or `SmartChineseAnalyzer`. Default is `StandardAnalyzer`                                                                                                                                                                                                                                                                   |
+| fulltext_commit_interval     | int                   | Full-text index data submission period, for write operations, in seconds. The default is 0, which commits immediately.                                                                                                                                                                                                                                                                      |
+| fulltext_refresh_interval    | int                   | Full-text index data refresh cycle, for read operations, in seconds. The default is 0, and the latest written data can be read immediately.                                                                                                                                                                                                                                                 |
+| ha_conf                      | string                | Initialize the HA cluster according to host1:port1,host2:port2,host3:port3, the default value is empty.                                                                                                                                                                                                                                                                                     |
+| ha_node_join_group_s         | int                   | The waiting time for a node to try to join the high availability cluster, in seconds, the default is 10.                                                                                                                                                                                                                                                                                    |
+| ha_bootstrap_role            | int                   | Whether to use bootstrap to start, and the server role to start using this method, 0 means not to use bootstrap to start, 1 means to use bootstrap to start and this node is a leader, 2 means to use bootstrap to start and this node is a follower, only these 3 options. The default value is 0.                                                                                         |
+| help                         | boolean               | Print the help message. The default value is false.                                                                                                                                                                                                                                                                                                                                         |
+
+### 4.2.Server configuration file
+
+TuGraph's configuration file is stored in JSON format. It is recommended that most configuration be stored in configuration files and that some configuration parameters be modified only temporarily using command-line options when needed.
+
+A typical configuration file looks like this:
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7070,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..4f363b5a53
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,168 @@
+# High Availability mode
+
+> This document describes the principles, preparations, and server operations of the high availability mode
+
+## 1.Theory
+
+TuGraph provides high availability (HA) mode through multi-machine hot backup. In high availability mode, write operations to the database will be synchronized to all servers (non-witness), so that even if some servers are down, the availability of the service will not be affected.
+
+When the high-availability mode is started, multiple TuGraph servers form a backup group, which is a high-availability cluster. Each backup group consists of three or more TuGraph servers, one of which serves as the `leader` and the other replication group servers as `followers`. Write requests are served by a `leader`, which replicates and synchronizes each request to a `follower` and can only respond to the client after the request has been synchronized to the server. This way, if any server fails, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically select a new `leader`.
+
+TuGraph's high-availability mode provides two types of nodes: `replica` nodes and `witness` nodes. Among them, the `replica` node is an ordinary node, has logs and data, and can provide services to the outside world. The `witness` node is a node that only receives heartbeats and logs but does not save data. According to deployment requirements, `leader` nodes and `follower` nodes can be flexibly deployed as `replica` nodes or `witness` nodes. Based on this, there are two deployment methods for TuGraph high-availability mode: one is the ordinary deployment mode, and the other is the simple deployment mode with witness.
+
+For normal deployment mode, `leader` and all `followers` are nodes of type `replica`. Write requests are served by a `leader`, which copies each request to a `follower` and cannot respond to the client until the request has been synchronized to more than half of the servers. This way, if less than half of the servers fail, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically elect a new `leader` to ensure data consistency and service availability.
+
+However, when the user server resources are insufficient or a network partition occurs, a normal HA cluster cannot be established. At this time, since the `witness` node has no data and takes up little resources, the `witness` node and the `replica` node can be deployed on one machine. For example, when there are only 2 machines, you can deploy the `replica` node on one machine, and the `replica` node and `witness` node on another machine, which not only saves resources, but also does not require log application To the state machine, there is no need to generate and install snapshots, so the response to requests is very fast, and it can help quickly elect a new leader when the cluster crashes or the network is partitioned. This is the simple deployment mode of the TuGraph HA cluster. Although `witness` nodes have many benefits, since there is no data, the cluster actually adds a node that cannot become `leader`, so the availability will be slightly reduced. To improve the availability of the cluster, you can allow the `witness` node to be the leader temporarily by specifying the `ha_enable_witness_to_leader` parameter as `true`. After the `witness` node synchronizes the new log to other nodes, it will actively switch the leader role to the node with the latest log.
+
+This feature is supported in version 3.6 and above.
+
+## 2.Preparation
+
+To enable high availability mode, users need to:
+
+- Three or more instances of TuGraph servers.
+- To enable high availability mode when starting lgraph_server, the 'enable_ha' option can be set to 'true' using a configuration file or the command line.
+- Set the correct rpc_port through the configuration file or command line
+
+## 3.Start the initial backup group
+
+After installing TuGraph, you can use the `lgraph_server` command to start a high-availability cluster on different machines. This section mainly explains how to start a high-availability cluster. For cluster status management after startup, see [lgraph_peer tool](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.The initial data is consistent
+
+When the data in all servers is the same or there is no data at startup, the user can
+specify `--ha_conf host1:port1,host2:port2` to start the server.
+In this way, all prepared TuGraph instances can be added to the initial backup group at one time,
+All servers in the backup group elect `leader` according to the RAFT protocol, and other
+servers join the backup group with the role of `follower`.
+
+An example command to start an initial backup group is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+After the first server is started, it will elect itself as the 'leader' and organize a backup group with only itself.
+
+### 3.2.Inconsistent initial data
+If there is already data in the first server (imported by the `lgraph_import` tool or transferred from a server in non-high availability mode),
+And it has not been used in high-availability mode before, the user should use the boostrap method to start. Start the server with data in bootstrap
+mode with the `ha_bootstrap_role` parameter as 1, and specify the machine as the `leader` through the `ha_conf`
+parameter. In bootstrap mode, the server will copy its own data to the new server before adding the newly
+joined server to the backup group, so that the data in each server is consistent.
+
+An example command to start a data server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+Other servers without data need to specify the `ha_bootstrap_role` parameter as 2, and specify the `leader` through the `ha_conf` parameter. The command example is as follows
+
+```bash
+**$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**You need to pay attention to two points when using bootstrap to start an HA cluster:**
+1. You need to wait for the `leader` node to generate a snapshot and start successfully before joining the `follower` node, otherwise the `follower` node may fail to join. When starting the `follower` node, you can configure the `ha_node_join_group_s` parameter to be slightly larger to allow multiple waits and timeout retries when joining the HA cluster.
+2. The HA cluster can only use the bootstrap mode when it is started for the first time. It can only be started in the normal mode (see Section 3.1) when it is started later. In particular, multiple nodes of the same cluster cannot be started in the bootstrap mode, otherwise it may cause Data inconsistency
+
+## 4.Start witness node
+
+### 4.1. Witness nodes are not allowed to become leader
+
+The startup method of `witness` node is the same as that of ordinary nodes. You only need to set the `ha_is_witness` parameter to `true`. Note that the number of witness nodes should be less than half of the total number of cluster nodes.
+
+An example command to start the witness node server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+Note: By default, the `witness` node is not allowed to become the `leader` node, which can improve the performance of the cluster, but will reduce the availability of the cluster when the `leader` node crashes.
+
+### 4.1. Allow witness nodes to become leaders
+
+You can specify the `ha_enable_witness_to_leader` parameter as `true`, so that the `witness` node can temporarily become the `leader` node, and then actively switch to the master after the new log synchronization is completed.
+
+An example of the command to start the `witness` node server that is allowed to become the `leader` node is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+Note: Although allowing `witness` nodes to become `leader` nodes can improve the availability of the cluster, it may affect data consistency in extreme cases. Therefore, it should generally be ensured that the number of `witness` nodes + 1 is less than half of the total number of cluster nodes.
+
+## 5.Scale out other servers
+
+After starting the initial backup group, if you want to scale out the backup group, add new servers to the backup group,
+The `--ha_conf HOST:PORT` option should be used, where `HOST` can be the IP address of any server already in this backup group,
+And `PORT` is its RPC port. E.g:
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+This command will start a TuGraph server in high availability mode and try to add it to the backup group containing the server `172.22.224.15:9090`.
+Note that joining a backup group requires a server to synchronize its data with the backup group's `leader` server, and this process may take a considerable amount of time, depending on the size of the data.
+
+## 6.Stopping the Server
+
+When a server goes offline via 'CTRL-C', it will notify the current 'leader' server to remove the server from the backup group. If the leader server goes offline, it will pass the leader identity permission to another server before going offline.
+
+If a server is terminated or disconnected from other servers in the backup group, the server is considered a failed node and the leader server will remove it from the backup group after a specified time limit.
+
+If any server leaves the backup group and wishes to rejoin, it must start with the '--ha_conf {HOST:PORT}' option, where 'HOST' is the IP address of a server in the current backup group.
+
+## 7.Restarting the Server
+
+Restarting the entire backup group is not recommended as it disrupts service. All servers can be shut down if desired. But on reboot,
+It must be ensured that at least N/2+1 servers in the backup group at shutdown can start normally, otherwise the startup will fail. and,
+Regardless of whether `enable_bootstrap` is specified as true when initially starting the replication group, restarting the server only needs to pass
+Specify the `--ha_conf host1:port1,host2:port2` parameter to restart all servers at once. The command example is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker deploys a highly available cluster
+In real business scenarios, it is likely to encounter the need to deploy high-availability clusters on multiple operating systems or architectures.
+Differentiated environments may cause some dependencies to be missing when compiling TuGraph. therefore,
+Compiling software in docker and deploying high-availability clusters is very valuable. Take the centos7 version of docker as an example,
+The steps to deploy a highly available cluster are as follows.
+
+### 8.1.Install mirror
+Use the following command to download TuGraph's compiled docker image environment
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+Then pull the TuGraph source code and compile and install
+
+### 8.2.Create container
+Use the following command to create a container, use `--net=host` to make the container run in host mode, in this mode
+Docker and the host machine share the network namespace, that is, they share the same IP.
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.Start service
+Use the following command to start the service on each server, because docker and the host share IP, so you can directly specify to start the service on the host IP
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.Server Status
+
+The current status of the backup group can be obtained from the TuGraph visualization tool, REST API, and Cypher query.
+
+In the TuGraph visualization tool, you can find the list of servers and their roles in the backup group in the DBInfo section.
+
+With the REST API, you can use `GET /info/peers` to request information.
+
+In Cypher, the `CALL dbms.listServers()` statement is used to query the status information of the current backup group.
+
+## 10.Data synchronization in high availability mode
+
+In high availability mode, different servers in the same backup group may not always be in the same state. For performance reasons, if a request has been synchronized to more than half of the servers, the leader server will consider the request to be in the committed state. Although the rest of the servers will eventually receive the new request, the inconsistent state of the servers will persist for some time. A client may also send a request to a server that has just restarted, thus having an older state and waiting to join a backup group.
+
+To ensure that the client sees consistently continuous data, and in particular to get rid of the 'reverse time travel' problem, where the client reads a state older than it has seen before, each TuGraph server keeps a monotonically increasing data version number. The mapping of the data version number to the database state in the backup group is globally consistent, meaning that if two servers have the same data version number, they must have the same data. When responding to a request, the server includes its data version number in the response. Thus, the client can tell which version it has seen. The client can choose to send this data version number along with the request. Upon receiving a request with a data version number, the server compares the data version number to its current version and rejects the request if its own version is lower than the requested version. This mechanism ensures that the client never reads a state that is older than before.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..bf30d63598
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+Installation And Running
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..8a46e25efe
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,475 @@
+# Data Importing
+
+> This document describes the data import function of TuGraph. These include delimiters in CSV format, sample formats for jsonline, and two modes for importing online and offline.
+
+## 1. Introduction
+
+After the installation is successful, you can use the `lgraph_import` batch import tool to import existing data into TuGraph. `lgraph_import` supports importing data from CSV files and JSON data sources.
+
+> `sonline format, a row of a json array string`
+
+> CSV format
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline format
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph supports two data importing modes：
+
+- _offline_：Read the data and import it into a data file for the specified server, it should only be done when the server is offline.
+- _online_：Read the data and send it to the running server, which then imports the data into its database.
+
+## 2.CSV file format delimiter
+
+    CSV delimiters can be single-character or multi-character strings, which cannot contain 'r' or 'n'. Note that different shells handle input strings differently, so different escape handling may be required for different shell input parameters.
+
+In addition, 'lgraph_import' also supports the following escape characters for entering special symbols:
+
+| Escape character | Instructions                                                                                              |
+| ---------------- | --------------------------------------------------------------------------------------------------------- |
+| \\               | The backslash`\\`                                                                                         |
+| \\a              | ASCII code 0x07                                                                                           |
+| \\f              | form-feed，ASCII code 0x0c                                                                                |
+| \\t              | Horizontal tab characters， ASCII code 0x09                                                               |
+| \\v              | Vertical tab characters， ASCII code 0x0b                                                                 |
+| \\xnn            | Two hexadecimal digits representing one byte，example \\x9A                                               |
+| \\nnn            | A three-digit octal number representing a single byte，example \\001, \\443，data range cannot exceed 255 |
+
+Demo：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.The configuration file
+
+    `lgraph_import`tool configures the environment using the specified configuration file. The configuration file describes the paths to the input files, the vertices/edges they represent, and the vertex/edge format.
+
+### 3.1.Configuration File Format
+
+The configuration file consists of two parts: schema and files. The 'schema' part defines label, and the 'files' part describes the data files to be imported.
+
+#### 3.1.1.The keyword
+
+- schema (Array）
+  - label（required，string）
+  - type（required， VERTEX or EDGE）
+  - properties（Array，required for vertex，If there is no property for the edge, you can leave it unconfigured）
+    - name（required, string）
+    - type （required,，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（optional，Indicates that the field can be configured or not configured）
+    - index（optional，Whether the field needs to be indexed）
+    - unique（optional, whether the field indexed and is of type unique）
+    - pair_unique（optional, whether the field indexed and is of type pair_unique）only one unique and pair_unique can be set. Setting up and running at the same time will terminate due to an input exception
+  - primary (vertex-only configuration, specify a property that uniquely identifies a point in the primary key field)
+  - temproal (edge-only configuration, optional, specifies the timestamp field for storage tier sorting)
+  - temporal_field_order (edge-only configuration, optional, the default value is ASC, indicating the ascending order, or DESC, indicating the descending order)
+  - constraints (edge-only configuration, optional, array form, start and end labels, unconfigured or empty means unrestricted)
+  - detach_property (optional, both Edge and Vertex can config，default is `false`. `true` means the property data is stored in detached model, which can reduce io read amplification in cases with less memory and much property data.)
+- files （Array）
+  - path（required，string，The value can be a file path or a directory path. If it is a directory, all files in the directory will be imported. Ensure that they have the same schema）
+  - header（Optional, numeric, header in the first few lines of the file, or 0）
+  - format（required，JSON or CSV）
+  - label（required，string）
+  - columns（Array）
+    - SRC_ID (Special string，only on the edges,That means this column is the source data)
+    - DST_ID (A special string, only on the edges, indicates that this column is the destination data)
+    - SKIP   (A special string to skip this column of data)
+    - [property]
+  - SRC_ID (Edge-only configuration. The value is the start label)
+  - DST_ID (Edge-only configuration. The value is the destination point label)
+
+#### 3.1.2. Index length
+Because TuGraph has limits on the length of keys, unique indexes do not allow the establishment of indexes that exceed the limit length. Non-unique indexes will truncate attributes that exceed the length limit, and when traversing non-unique indexes through iterators, the key obtained It is also truncated and may not be consistent with expectations. The truncation length is different for different types of non-unique indexes.
+##### 3.1.2.1.unique index
+A unique index is globally unique, and the maximum length of the index key is 480 bytes. Primary is a special unique index, so the maximum key length is also 480 bytes, and no index can be created if it exceeds 480 bytes.
+##### 3.1.2.2.pair_unique index
+A pair_unique index refers to a unique index between two nodes. This type of index can only be created in the edge schema. This type of index adds the vid of the source node and the target node after the user-specified key. Each vid is 5 bytes. length. Therefore, the maximum key length is 470 bytes, and indexing cannot be established if it exceeds 470 bytes.
+##### 3.1.2.3. Non-unique index
+A non-unique index refers to an index that neither unique nor pair_unique is set to 1. In the implementation of TuGraph, one key of this type of index may be mapped to multiple values. In order to speed up search and writing, the user-specified The key is followed by the maximum value in a set of vid or euid. For non-unique indexes created in nodes, the key is followed by vid, and each vid is 5 bytes in length, so the maximum length is 475 bytes.
+For non-unique indexes created in edges, the key is followed by euid, and each euid is 24 bytes long, so the maximum length is 456 bytes. If the index key exceeds the corresponding length, it will be automatically truncated.
+
+### 3.2.Example Configuration File
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+For the above Example Configuration File, three labels defined: two point types' actor 'and' movie ', and one edge type 'role'. Each label describes: the name of the label, the type (dot or edge), which attribute fields are available, and the type of each field. For points, the primary field also defined; For edges, the constraints field also defined, which limits the starting and ending points of the edges.
+
+It also describes three data files, two dot data files' actors.csv 'and' movies.csv ', and one edge data file 'roles.csv'. Each section describes the path of the file, the format of the data, the first few lines of the header, the label of the data, and the corresponding field of each column in each row of data in the file.
+
+For the above configuration files, the import tool will first create labels' actor ', 'movie', and 'role' in TuGraph, and then perform data import of the three files.
+
+## 4.Offline full import
+
+The offline mode can be used only on offline servers. An offline import creates a new graph, so it's more suitable for your first data import on a newly installed TuGraph server.
+
+To use the 'lgraph_import' tool in offline mode, you can specify the 'lgraph_import --online false' option. To see the command-line options available, use 'lgraph_import --online false --help' :
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+Command line arguments:
+
+- **-c, --config_file** `config_file`: Import the configuration file name in the following format:
+- **--log** `log_dir`: Log directory. The default is an empty string, in which case the log information output to the console.
+- **--verbose** `0/1/2`: Log level. The higher the log level, the more detailed the output information is. The default value is 1.
+- **-i, --continue_on_error** `true/false`: If an error occurs, skip the error and continue. The default is false. If an error occurs, exit.
+- **-d, --dir** `{diretory}`:The database directory to which the import tool will write data. Default is'./db '.
+- **--delimiter** `{delimiter}`: Data file separator. This is used only when the data source is in CSV format. The default is', '。
+- **-u, --username** `{user}`: Username of the database. You need to be an administrator to perform offline import.
+- **-p, --password** `{password}`: Specifies the password of the database user
+- **--overwrite** `true/false`: Whether to overwrite data. When set to true, the data directory overwritten if it already exists. Default to 'false'.
+- **-g, --graph** `{graph_name}`: Specify the kind of graph to import.
+- **-h, --help**: The help information displayed.
+
+### 4.1.Offline Import Example
+
+    In this example, we use the movie-actor data described above to demonstrate the use of the import tool. The data to be imported is divided into three files: 'movies.csv', 'actors.csv', and 'roles.csv'.
+
+'movies.csv' contains information about movies, where each movie has an id (as a primary key for retrieval), and each movie also has attributes such as title, year, and rating. (Data from [IMDb](http://www.imdb.com)).
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+> The jsonline format is as follows:
+> All fields can be strings, which will be converted to the corresponding type when imported
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`It contains information about the actors. Each actor also has an id, as well as properties such as name.
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`It contains information about which role an actor played in which movie. Each row records a character played by a given actor in a given movie, corresponding to an edge in the database.`SRC_ID` and `DST_ID` are the source and target vertices of the edge, which are the 'primary' properties defined in 'actors.csv' and 'movies.csv', respectively.
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+'configuration file import.conf', notice that there are two HEADER lines in each file, so we need to specify the 'HEADER=2' option.
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+Using the import configuration file, we can now import data using the following command:
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # Read configuration information from import.conf
+        --dir /data/lgraph_db      # Store the data in /data/lgraph_db
+        --graph mygraph            # Import the graph named mygraph
+```
+
+**Notice**：
+
+- If a graph named 'mygraph' already exists, the import tool will print an error message and exit. To force a graph to be overwritten, use the '--overwrite true' option.
+- Configuration and data files must be stored in UTF-8 encoding (or normal ASCII encoding, which is a subset of UTF-8). If any file uses an encoding other than UTF-8 (for example, UTF-8 with BOM or GBK), the import will fail and output a profiler error.
+
+## 5.Online incremental Import
+
+The online import mode can be used to import a batch of files into an already running instance of TuGraph. This is handy for processing incremental batch updates that typically occur at fixed intervals. The 'lgraph_import --online true' option enables the import tool to work in online mode. Like offline mode, online mode has its own set of command-line options, which can be printed using the '-h, --help' options:
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+The configuration related to the file specified in the configuration file, and its format is exactly the same as' offline mode '. However, instead of importing the data into a local database, we are now sending the data to a running TuGraph instance, which is typically running on a different computer than the client machine on which the import tool is running. Therefore, we need to specify the URL, DB user, and password for the HTTP address of the remote machine.
+
+If the user and password are valid, and the specified graph exists, the import tool sends the data to the server, which then parses the data and writes it to the specified graph. The data will be sent in a packet of about 16 MB, interrupted at the nearest newline. Each package imported atomically, which means that if the package is successfully imported, all data is successfully imported; otherwise, none of the data enters the database. If '--continue_on_error true' is specified, data integrity errors are ignored and offending lines are ignored. Otherwise, the import stops at the first error package and prints out the number of packages that have been imported. In this case, the user can modify the data to eliminate errors, and then use '--skip_packages N' to redo the import to skip the imported packages.
+
+## 6. Online full import
+
+Online full import can be used to import a batch of files into a running TuGraph instance. TuGraph supports importing two different types of data into the instance online:
+1. Original data files of the same type as the offline import (csv, etc.)
+2. The underlying storage file of TuGraph is the data.mdb file. This file can be generated by offline import, or it can be a file of other TuGraph db.
+The applicable scenarios of these two methods are different. The first method is to directly import data into TuGraph. The advantage is that it is automatically imported at one time and the operation steps are simple. However, an offline import thread will be started on the server side, which is only suitable for small-scale data import in a stand-alone situation. The second is to import the prepared underlying storage files into TuGraph. Although the mdb file needs to be prepared in advance, it does not have high requirements on system resources. It also supports remote download and file import, which is very convenient and suitable for high availability. Online import of schema or large-scale data.
+
+### 6.1 Import from original data
+The execution method of importing from the original data is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and The data files of the temporary db are migrated to the new subgraph, and finally the metadata of the instance is refreshed. Compared with online incremental import, online full import has higher performance. The `lgraph_import --online true --online_type 1` option enables the import tool to fully import online. Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+Online full import can be used to import a batch of files into an already running TuGraph instance. The execution method is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and stores the data in the temporary db. The files are migrated to the new subgraph, and finally the instance's metadata is refreshed. Compared with online incremental import, online full import has higher performance and is suitable for processing large-scale data. The `lgraph_import --online true --full true` option enables the import tool to fully import online.
+Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+The relevant configuration of the file is specified in the configuration file, and its format is exactly the same as in `offline mode`. However, instead of importing the data into a local database, we now import the data into a running TuGraph instance, which is typically running on a different machine than the client machine running the import tool. Therefore, we need to specify the URL, DB user and password of the remote computer's HTTP address. Moreover, the configuration file (config_file parameter) is required to be the uri path on the TuGraph instance machine, and its file configuration is also required to be the absolute path of the resource on the TuGraph instance machine.
+
+If the user and password are valid, the import tool will perform an online full import on the server side. If the graph you want to import already exists, you can use the `--overwrite true` option to force overwriting of the subgraph.
+
+### 6.2 Import from database file
+Although the full online import of original data is simple to operate and has high performance, it requires high server resources and takes a long time. A more general way is to first use offline import to import the subgraph in an empty db, obtain the data.mdb file, and then import the file into the TuGraph service online. How to use it is as follows:
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+In addition to the url, user and password parameters used in ordinary online import, the online full import method imported from a database file uses the graph parameter to specify the name of the imported subgraph, the path parameter to specify the file path, and remote to specify whether the file exists remotely or locally. If it is a local file, you need to ensure that all nodes in the HA cluster have the file in the path. If it is a remote file, it will be downloaded first and then imported. It should be noted that since there is only one copy of data.mdb, it is necessary to ensure that the environment of each node of HA and the machine where data.mdb is generated offline are completely consistent to ensure that no environmental problems will occur.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..b1ad57de6f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# Data Export
+
+> This document mainly introduces the data export function of TuGraph.
+
+## 1.Introduction
+
+TuGraph can use the tool `lgraph_export` to export data from the database that has been imported successfully. The 'lgraph_export' tool can export the data of the specified TuGraph database to the specified directory in the form of 'csv' or 'json' file, and export the configuration file 'import.config'. That required for re-importing the data.
+
+## 2.Data Export
+
+The following is an example of a command for the tool:
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+Details:
+
+- `-d {database_dir}` specifies the directory of the database from which the data will be exported. The default value is./testdb '.
+- `-e {export_destination_dir}` specifies the directory where the export file is stored. The default value is./exportdir.
+- `-g {graph_to_use}` specifies the type of graph database. default is' default '.
+- `-u {username}` Specifies the name of the user who performs the export operation.
+- `-p {password}` Specifies the password of the user who performs the export operation.
+- `-s {field_separator}` specifies the separator for the exported file. The default is comma.
+- `-f {output_format}` specifies the format of the exported data. It can be 'json' or 'csv'.
+- `-h` In addition to the specified parameters, you can also use this parameter to view the help of the tool.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..fa1839724b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,32 @@
+# Backup and Restore
+
+> This document mainly introduces the data backup and restore function of TuGraph.
+
+## 1.Data Backup
+
+TuGraph can use the 'lgraph_backup' tool to backup data.
+The 'lgraph_backup' tool can backup data from a TuGraph database to another directory. It can be used as follows:
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+Details:
+
+- `-s {source_dir}` specifies the directory where the database (source database) to be backed up resides.
+- `-d {destination_dir}` specifies the directory where the backup file (destination database) is stored.
+  If the target database is not empty, 'lgraph_backup' prompts you whether to overwrite the database.
+- `-c {true/false}` indicates whether a compaction occurs during backup.
+  Every compaction creates a tighter backup, but every compaction takes longer to create. This option defaults to 'true'.
+
+## 2.Data Restore
+
+The target database `{destination_dir}` obtained using the `lgraph_backup` tool backs up all subgraphs of the source database `{source_dir}`, but does not include the raft information of the HA cluster, thereby ensuring that the service and cluster can be successfully restarted with the backup database and the data is consistent with the source database. The following command can be used to restart the service with the backup database. When the service starts, the storage process of all subgraphs will be restored to ensure that the backup service is completely consistent with the original service.
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+Details
+
+- `-d {destination_dir}` Specify the directory where the backup file (target database) is located.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..6782a43d0e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# Data Warmup
+
+> This document mainly introduces the data Warmup function of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a disk-based database where data loaded into memory only when accessed. Therefore, for a period of time after the server just turned on, the system performance may be degraded due to frequent IO operations. At this point, we can improve this problem by data warm-up.
+
+## 2.lgraph_warmup
+
+Data warmup can be done using the tool lgraph_warmup. An example of its use is as follows:
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+Details:
+
+The - '-d {db_dir}' option specifies the data directory for the TuGraph server
+
+The - '-g {graph_list}' option specifies the names of graphs to be warmed-up, separated by commas
+
+The warm-up process takes different times depending on the data size and the type of disk being used. Preheating a large database on a mechanical disk may take a long time. Please wait patiently.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..d830586b92
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# Cluster management
+
+> This document mainly introduces the management tools of TuGraph HA cluster, including the functions of deleting nodes, leader transfer and generating snapshots.
+
+## 1 Introduction
+
+After the HA cluster is started, you can use the `lgraph_peer` tool for cluster management, which can perform functions such as deleting nodes, transferring leaders, and generating snapshots.
+
+## 2. Delete node
+
+For nodes in the TuGraph HA cluster that are offline for a long time or have network partitions, you can use the `remove_peer` command of `lgraph_peer` to delete the node. An example command is as follows:
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command remove_peer` specifies that the operation to be performed is remove_peer, that is, delete the node.
+- `--peer {peer_id}` specifies the rpc network address of the node to be deleted, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 3. leader transfer
+
+When you need to shut down or restart the master node, in order to reduce the unserviceable time of the cluster, you can use the `transfer_leader` command of `lgraph_peer` to transfer the master node. An example command is as follows:
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command transfer_leader` specifies that the operation to be performed is transfer_leader, that is, transferring the master node.
+- `--peer {peer_id}` specifies the rpc network address to become the master node, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 4. Generate snapshot
+
+For reasons such as setting ha_snapshot_interval_s to -1 when the node starts so that snapshots are not taken by default or other reasons,
+when you need to tell a node generate a snapshot, you can use the `snapshot` command of `lgraph_peer`. An example command is as follows:
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+in:
+
+- `--command snapshot` specifies that the operation to be performed is snapshot, that is, generating a snapshot.
+- `--peer {peer_id}` specifies the rpc network address of the node to generate a snapshot, such as `127.0.0.1:9092`.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..dd74d08869
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,145 @@
+# Tugraph CLI
+
+> This document mainly introduces the CLI tool lgraph_cypher of TuGraph.
+
+## 1.Instructions
+
+The TuGraph release comes with a query client named 'lgraph_cypher' that can be used to submit OpenCypher requests to the TuGraph server. The 'lgraph_cypher' client has two execution modes: single command mode and interactive mode.
+
+## Single command mode
+
+In single-command mode, 'lgraph_cypher' can be used to submit a single Cypher query and print the result directly to the terminal. The printed result can also be easily redirected to a specified file. This is handy when users need to get a lot of results from the server and save them in files.
+
+In this mode, the 'lgraph_cypher' tool has the following options:
+
+### Command line Parameters:
+
+| Parameter | Type   | Instructions                                                                                                                                                                                                                           |
+| --------- | ------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| --help    | \\     | List all parameters and descriptions.                                                                                                                                                                                                  |
+| -example  | \\     | List the command instances.                                                                                                                                                                                                            |
+| -c        | string | A database configuration file used to obtain ip and port information.                                                                                                                                                                  |
+| -h        | string | Database server IP address. Omit this parameter if you have a configuration file. The default value is' 127.0.0.1 '                                                                                               |
+| -p        | string | Database server port. Omit this parameter if you have a configuration file. The default value is 7071                                                                                                                                  |
+| -u        | string | User name for logging in to the database.                                                                                                                                                                                              |
+| -P        | string | Password for logging in to the database.                                                                                                                                                                                               |
+| -f        | string | Contains the path to a single Cypher query single text file.                                                                                                                                                                           |
+| -s        | string | Single-line cypher query command. Start and end with `"`.                                                                                                                                                                              |
+| -t        | int    | Specifies the server timeout threshold for cypher queries. The default value is 150 seconds.                                                                                                                                           |
+| -format   | string | Query result display mode. Supports two formats: 'plain' and 'table'. The 'plain' format prints the query results in a single column. The 'table' format displays the query results in a tabular format. The default value is' table ' |
+
+### Examples:
+
+**cypher command file query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+
+```
+
+**cypher command single-sentence query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+
+```
+
+## Interactive mode
+
+'lgraph_cypher' can also be run in interactive mode. In interactive mode, the client stays connected to the server and interacts with the user in read-evaluate-print-loop.
+
+### Enter lgraph_cypher interaction mode:
+
+If no '-f' or '-s' command line option added, 'lgraph_cypher' will enter interactive mode when running. how to use it:
+
+```
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+
+```
+
+If the login is successful, the corresponding login success message will be displayed:
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2018 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+Now we also provide an interactive shell for users to enter Cypher queries or use the ':help' command to check for available commands.
+
+### Command Description
+
+In addition to the Cypher query, the shell of 'lgraph_cypher' accepts the following commands:
+
+| Command                  | Parameters                                         | instructions                                                                                                                                              |
+| ------------------------ | -------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                                 | Displays the server information and the corresponding description of all commands.                                                                        |
+| :db_info                 | \\                                                 | Query the current server status. /db/info for the corresponding REST API.                                                                                 |
+| :clear                   | \\                                                 | Clear the screen.                                                                                                                                         |
+| :use                     | {Graph Name}                                       | The graph specified with this name defaults to `default`                                                                                                  |
+| :source                  | `-t {Query the timeout value} -f {The query file}` | cypher command file query in interactive mode. The default timeout threshold is 150 seconds. Query file format reference No interactive query parameters. |
+| :exit                    | \\                                                 | Exit interactive mode and return to the original command line.                                                                                            |
+| :format                  | `plain` or `table`                                 | Change the display mode of cypher query results. Support 'plain' and 'table' modes.                                                                       |
+| :save all/command/result | `-f {The file path}` `{Cypher}`                    | The cypher command (command), query result (result) or both (all) are stored. The default location is' /saved_cypher.txt '                                |
+
+**Note:**
+
+- Each command should start with a colon `:`.
+
+**:save command example :**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+
+```
+
+### cypher query command:
+
+In interactive mode, users can also directly input a single sentence cypher command for query, with "'; ` "end. Enter commands that are case insensitive. Here's an example:
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher` supports multi-line input when typing commands. Users can use the `ENTER` key to type long query statements into multiple lines. In the case of multi-line input, the beginning of the command line will change from `>` to `=>`, and the user can continue to type the rest of the query.
+
+Example:
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### Auxiliary Features:
+
+**Input History:** Press the up and down arrow keys in interactive mode to display the input history.
+
+**Auto Completion:** lgraph_cypher will automatically complete based on the input history. In the event of a completion prompt, pressing the right arrow key will automatically complete the command.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..bee9d4c8df
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,440 @@
+# TuGraph DataX
+
+> This document mainly introduces the installation, compilation and usage examples of TuGraph DataX
+
+## 1.Introduction
+
+On the basis of Ali's open source DataX, TuGraph implements the support of writing plug-ins and jsonline data format, and other data sources can write data into TuGraph through DataX.
+TuGraph DataX introduces [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX), Supported features include:
+
+- Import TuGraph from various heterogeneous data sources such as MySQL, SQL Server,Oracle, PostgreSQL, HDFS, Hive, HBase, OTS, ODPS, Kafka and so on. 
+  
+- Import TuGraph to the corresponding target source (to be developed).
+
+Reference for DataX Original Project Introduction [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.Compile and Install
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+The compiled DataX file is in the target directory
+
+## 3.Text data imported into TuGraph with DataX
+
+Using the data from the lgraph_import section of the TuGraph manual as an example, we have three csv data files, as follows:
+`actors.csv`
+
+```
+
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+
+```
+
+`movies.csv`
+
+```
+
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+
+```
+
+`roles.csv`
+
+```
+
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+
+```
+
+Then create three DataX job profiles:
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`/lgraph_server -c lgraph_standalone.json -d 'run'` 'Start TuGraph and run the following commands in sequence:
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## MySQL's data imported into TuGraph with DataX
+
+We create the following table of movies under 'test' database
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+Insert some data into the table
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+Create a DataX job configuration file
+
+`job_mysql_to_tugraph.json`
+
+**Configuring Field**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**Write simple sql**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` Start TuGraph and run the following command：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..a01cf32e66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph Explorer
+
+> TuGraph Explorer has merged to [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..8519247cc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Utility Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..8ebe10da56
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/1.python-client.md
@@ -0,0 +1,222 @@
+# TuGraph Python SDK
+
+> This document is the usage instruction of TuGraph Python SDK
+
+## 1.Overview
+There are two kinds of Python's TuGraph Client. One is the RESTful Client, which uses the HTTP method to send requests to the server. The other is the RPC Client, which uses the RPC method to call the server remote service. Both have their own advantages and disadvantages. The RESTful client is simple to use. You can find the source code file of the Client in the src/client/python/TuGraphClient directory of the project. You can install it directly into the user environment and use it. However, it supports fewer functions and its performance is not high. RPC Client supports both stand-alone servers and high-availability clusters and load balancing. It has many interfaces and powerful functions. However, the usage is more complicated. Users need to compile the TuGraph project themselves to obtain liblgraph_client_python.so, or directly find the dependent library in the /usr/local/lib64 directory when using the runtime image, and introduce it into the python project for normal use. Next, the usage of these two Clients will be introduced in detail.
+
+## 2.RESTful Client
+
+### 2.1. Install Client
+
+TuGraph's Python RESTful client uses the setuptools tool for packaging and distribution. Users can install the client directly into the local environment and introduce it directly when using it.
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+Note: When using the setuptools tool to install the python client, dependencies such as httpx will be installed and need to be executed in an environment with external network access.
+
+### 2.2.Call cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.Call stored procedure
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python's TuGraph Rpc Client is a CPP Client SDK packaged using pybind11. The following table lists the correspondence between Python and CPP Client SDK.
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+The use of Python RPC Client is more complicated. Users can compile TuGraph in the local environment to get liblgraph_client_python.so, or they can use the official runtime image. The dependent library can be found directly in the /usr/local/lib64 directory in the image. It can be used after introducing the user project.
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.Instantiate the client object
+
+#### 3.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+
+#### 3.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 3.2.Call cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.3.Send cypher request to leader
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.4.Call GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.5.Send GQL request to leader
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.6.Calling stored procedures
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.7.Call the stored procedure to the leader
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 3.8.Load stored procedure
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 3.9.List stored procedures
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.10.Delete stored procedures
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 3.11.Import schema from byte stream
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.12.Import edge data from byte stream
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 3.13.Import schema from file
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.14.Import point and edge data from file
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..260a8c6c29
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,339 @@
+# TuGraph C++ SDK
+
+> This document is the usage instruction of TuGraph C++ SDK
+
+## 1.Instructions
+
+C++ Client can use RPC to connect to lgraph_server to import data, execute stored procedures, call Cypher and other operations.
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+#### 2.1.1. Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2. Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3. Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.3. Send cypher request to leader
+```C++
+     std::string str;
+     bool ret = client.CallCypherToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0);
+     @param [out] result The result.
+     @param [in] cypher inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```C++
+     std::string str;
+     bool ret = client.CallGql(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGql(std::string& result, const std::string& gql,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0, const std::string& url = "");
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @param [in] url (Optional) Node address of calling gql.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.5. Send GQL request to leader
+```C++
+     std::string str;
+     bool ret = client.CallGqlToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGqlToLeader(std::string& result, const std::string& gql,
+                  const std::string& graph = "default", bool json_format = true,
+                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```C++
+     std::string str;
+     bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedure(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true,
+                        const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] url (Optional) Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```C++
+     std::string str;
+     bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true);
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+
+### 2.8. Load stored procedure
+```C++
+     std::string str;
+     bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+     bool LoadProcedure(std::string& result, const std::string& source_file,
+                        const std::string& procedure_type, const std::string& procedure_name,
+                        const std::string& code_type, const std::string& procedure_description,
+                        bool read_only, const std::string& version = "v1",
+                        const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] source_file the source_file contain procedure code.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] code_type code type, currently supported PY, SO, CPP, ZIP.
+     @param [in] procedure_description procedure description.
+     @param [in] read_only procedure is read only or not.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```C++
+     std::string str;
+     bool ret = client.ListProcedures(str);
+```
+```
+     bool ListProcedures(std::string& result, const std::string& procedure_type,
+                         const std::string& version = "any",
+                         const std::string& graph = "default", const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type (Optional) the procedure type, "" for all procedures,
+                                  CPP and PY for special type.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] url Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, the request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```C++
+     std::string str;
+     bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+     bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                          const std::string& procedure_name, const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```C++
+     std::string str;
+     bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+     bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                  const std::string& graph = "default", bool json_format = true,
+                                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema the schema to be imported.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```C++
+     std::string str;
+     ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+     bool ImportDataFromContent(std::string& result, const std::string& desc,
+                                const std::string& data, const std::string& delimiter,
+                                bool continue_on_error = false, int thread_nums = 8,
+                                const std::string& graph = "default", bool json_format = true,
+                                double timeout = 0);
+     @param [out] result The result.
+     @param [in] desc data format description.
+     @param [in] data the data to be imported.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+     bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema_file the schema_file contain schema.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+     bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                             const std::string& delimiter, bool continue_on_error = false,
+                             int thread_nums = 8, int skip_packages = 0,
+                             const std::string& graph = "default", bool json_format = true,
+                             double timeout = 0);
+     @param [out] result The result.
+     @param [in] conf_file data file contains format description and data.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] skip_packages (Optional) skip packages number.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..1c560141d3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/3.java-client.md
@@ -0,0 +1,289 @@
+# TuGraph Java SDK
+
+> This document primarily provides usage instructions for the TuGraph Java SDK. It is crucial to note that the TuGraph Java SDK will no longer receive updates or maintenance in the future. Users are strongly advised to utilize [bolt](./5.bolt-client.md) instead.
+
+## 1.Compile java client code
+
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Adding maven dependencies
+
+```xml
+<dependency>
+    <groupId>com.antgroup.tugraph</groupId>
+    <artifactId>tugraph-db-java-rpc-client</artifactId>
+    <version>1.4.1</version>
+</dependency>
+```
+
+Introduce dependencies
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.3. Send cypher request to leader
+```java
+     String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param cypher: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```java
+     String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @param url: (Optional) Node address of calling GQL
+     @return: the result of GQL query execution
+     public String callGql(String gql, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.5. Send GQL request to leader
+```java
+     String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```java
+     String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @param url: (Optional) Node address of calling procedure
+     @return: the result of procedure execution
+     public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph, String url)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```java
+     String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedureToLeader : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @return: the result of procedure execution
+     public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 2.8. Load stored procedure
+```java
+     boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param sourceFile: the source_file contains procedure code
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param codeType: code type, currently supported PY, SO, CPP, ZIP
+     @param procedureDescription: procedure description
+     @param readOnly: procedure is read only or not
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                               String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```java
+     String result = client.listProcedures("CPP", "any", "default");
+     log.info("listProcedures : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @param url: (Optional) Node address of listing procedure
+     @return: the list of procedures
+     public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```java
+     String result = client.deleteProcedure("CPP", "sortstr", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```java
+     boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+     log.info("importSchemaFromContent : " + ret);
+```
+```
+     @param schema: the schema to be imported
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```java
+     boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+     log.info("importDataFromContent : " + ret);
+```
+```
+     @param desc: data format description
+     @param data: the data to be imported
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+             int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```java
+     boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+     log.info("importSchemaFromFile : " + ret);
+```
+```
+     @param schemaFile: the schema_file contains schema
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromFile(String schemaFile, String graph, double timeout)
+             throws UnsupportedEncodingException, IOException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```java
+     boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+     log.info("importDataFromFile : " + ret);
+```
+```
+     @param confFile: data file contains format description and data
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param skipPackages: skip packages number
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+             int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..1a778b73ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,176 @@
+# TuGraph-OGM
+
+@TODO
+
+## 1.Introduction
+
+> TuGraph-OGM project is open source on other repositories.
+
+TuGraph-OGM (Object Graph Mapping) is a graph object mapping tool designed for TuGraph. It supports the mapping of Java objects (POJO) into TuGraph. The classes in Java are mapped to nodes in the graph, the collections in the classes are mapped to edges, and the properties of the classes are mapped to the attributes of the graph objects. It also provides corresponding functions to manipulate the graph database. Therefore, Java developers can easily use TuGraph database in the familiar ecosystem. TuGraph-OGM is also compatible with Neo4j-OGM. Neo4j ecosystem users can migrate seamlessly to TuGraph database.
+
+### 1.1.Functions of TuGraph-OGM
+
+TuGraph-OGM provides the following functions for operating TuGraph:
+
+| Function                            | Usage                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| Insert single vertex/edge                 | void session.save(T object)                                                      |
+| Batch insert vertexs/edges                 | void session.save(T object)                                                      |
+| Delete vertex and its corresponding edges                | void session.delete(T object)                                                    |
+| Delete all vertexs with specific label       | void session.deleteAll(Class\<T> type)                                           |
+| Clear the database                      | void purgeDatabase()                                                             |
+| Update vertex                        | void session.save(T newObject)                                                   |
+| Query single node by id            | T load(Class<T> type, ID id)                                                     |
+| Query multiple nodes by ids           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| Query all nodes with specific label         | Collection\<T> loadAll(Class\<T> type)                                           |
+| Query with conditions                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher query (specify the return type) | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher query                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.Compile TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.Use TuGraph-OGM
+
+Please refer to the detailed examples in TuGraphOGMDemo under the demo folder.How to import dependencies in `pom.xml`.
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // create Movie vertex
+    @Id
+    private Long id;      // Movie id
+    private String title; // title attribute
+    private int released; // released attribute
+
+    // create Edge ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // create Actor vertex
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// configuration
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//Start driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// Open session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.Perform CRUD operations through OGM
+
+```java
+// new
+Movie jokes = new Movie("Jokes", 1990);  // Create Movie-vertex "jokes"
+session.save(jokes);                     // Store "jokes" in TuGraph
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // Connect the "speed" vertex with the "alice" vertex through the ACTS_IN relationship
+session.save(speed);                    // Store two vertexs and one edge
+
+// delete
+session.delete(alice);                  // Delete the "alice" vertex and its connected edge
+Movie m = session.load(Movie.class, jokes.getId());   // Get the "jokes" vertex based on its id
+session.delete(m);                                    // Delete the "jokes" node
+
+// update
+speed.setReleased(2018);
+session.save(speed);                   // Update the "speed" attribute
+
+// get
+Collection<Movie> movies = session.loadAll(Movie.class);  // Get all Movie vertexs
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // Query all movies released before 1995
+
+// Call Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // Query the Movie with "Speed" of 2018
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // Create vertex label "Director"
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // Create edge label "DIRECT"
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // Get the create result
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // View the number of vertexs created
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //View the number of edges created
+
+// Clear the database
+session.deleteAll(Movie.class);        // Delete all Movie vertexs
+session.purgeDatabase();               // Delete all data
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..e45c65a194
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,17 @@
+# Bolt client
+
+TuGraph implements Neo4j's bolt protocol, you can use Neo4j's client to access TuGraph.
+
+## Enable bolt port
+
+If you are using the TuGraph runtime docker image, the config file is `/usr/local/etc/lgraph.json`.
+
+Add `bolt_port=7687` (modify the port) to TuGraph's config file to enable the bolt port, Neo4j clients should connect to the bolt port.
+
+## Limitations on use
+
+TuGraph does not implement all the features of neo4j bolt protocol.
+
+Explicit transactions are currently not supported and need to avoid using these features.
+
+There are some examples for reference under `demos/Bolt` in the code repository.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..3ba53fb6f5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,107 @@
+# TuGraph console client
+
+`lgraph_cli` is a console client based on the bolt protocol, written in c++, which requires a connection to tugraph's bolt port.
+
+`lgraph_cypher` is a console client based on http, written in python, which requires a connection to tugraph's http port.
+
+`lgraph_cypher` needs some python libraries to be installed.
+
+`lgraph_cli` is a binary executable file that has no dependencies on other dynamic libraries and can be executed by copying it to a linux server.
+
+## `lgraph_cli`
+
+The statement ends with a semicolon, type `exit`, `quit` or Ctrl-C to exit the client.
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+The statement can be inputed on more than one line.
+
+```
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+non-interactive
+
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+read statements from file
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## online export
+
+lgraph_cli supports streaming read, so just redirect the output to a file. The output format supports csv and json
+
+### csv
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..b5679e97fd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,341 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+## 2.Request And Response Format
+Tugraph HTTP Server receives requests in json format，After authentication, fields in the request are extracted, the request is processed according to the defined interface logic, and the response in json format is returned.
+
+### 2.1.Standard Response Format
+Each response is returned in the standard response format, as follows：
+
+| body parameter  | parameter description  | parameter type | necessary |
+|--------------|------------------------|----------|-----------|
+| errorCode    | error code             | int      | yes       |
+| success      | Whether the request was successful | int      | yes       |
+| errorMessage | error message          | string   | yes         |
+| data         | the response information returned when the request is successful | json string | yes         |
+
+### 2.2. Request Type
+
+#### 2.2.1. User Login
+The user sends the login request to the server with the user name and password. After successful login, the client receives a signed token (the Json Web Token) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token stored by the client and added to the Authorization domain of the request header in subsequent requests. If the login fails, you will receive the Authentication failed error.
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary       |
+| ------- |-----------------------|-------|------------|
+| userName   | name of the user      | string   | yes          |
+| password   | password of the user  | string | yes          |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00 and the token will be included in data
+
+| body parameter  | parameter description  | parameter type   | necessary |
+| ------- |-------|--------|------|
+| authorization   | token | string | yes  |
+| default_password  | whether the password is the default password | bool | yes  |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. User Logout
+When a user logs out, the authenticated token is deleted. and the user needs to log in again to obtain a new token when sending subsequent requests.
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and data is empty
+
+#### 2.2.3. Refresh Token
+If the delivered token becomes invalid, you need to invoke this interface for re-authentication. The token is valid within one hour after the first login and needs to be refreshed
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the token will be included in data
+
+| body parameter  | parameter description | parameter type | necessary       |
+| ------- |------|----------------|------------|
+| authorization   | token  | string         | yes          |
+
+#### 2.2.4. Call Cypher
+User manipulation of data and models in tugraph requires calling the cypher interface and is initiated through the standard cypher query language
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------------------|---------|-----------|
+| graph   | the name of the subgraph to be queried | string  | yes       |
+| script   | query statement  | string  | yes         |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the query results will be included in data
+
+| body parameter  | parameter description | parameter type | necessary    |
+| ------- |------|----------------|------------|
+| result   | query results | json string    | yes          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. Upload File
+This interface is used to upload local files to the TuGraph machine. You can upload text/binary files, large files, and small files. For large files, the client must split the files, and each file fragment must not be larger than 1MB. Parameters Begin-Pos and Size correspond to the offset and fragment size of this fragment in the complete file. The parameter must be placed in the header of the http request, and the request body contains only the file fragment content. The request header of this interface contains more than token parameters
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header parameter | parameter description                | parameter type | necessary |
+|------------------|--------------------------------------|---------|-------|
+| File-Name        | the name of the file                 | string  | yes   |
+| Begin-Pos        | Offset of the start position of the current file fragment within the file | string  | yes   |
+| Size             | the current file fragment size       | string | yes   |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+#### 2.2.6. Check File
+this interface is used to check the correctness of uploaded files. If the check succeeds, the system returns a success message when the same file is uploaded again
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description       | parameter type | necessary |
+| ------- |-----------------------------|----------------|-----------|
+| fileName   | the name of the file        | string         | yes       |
+| checkSum   | the checksum of the file    | string  | yes when flag set to "1" |
+| fileSize   | the size of the file        | string  | yes when flag set to "2" |
+| flag   | If flag is "1", check md5. If flag is "2"，check file size | string  | yes       |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------|------|------|
+| pass   | true on success, false otherwise | bool | yes  |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. Delete Cached File
+The admin user can delete all the files uploaded by anyone. Other users can delete their own files. You can delete a file with a specified name, a file uploaded by a specified user, or all files
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary |
+| ------- |-----------------------|--------|--------|
+| fileName   | the name of the file  | string | yes when flag set to "0" |
+| userName   | the name of the user  | string | yes when flag set to "1" |
+| flag   | When flag is set to 0, the file specified by fileName is deleted; when flag is set to 1, all files uploaded by userName are deleted; when flag is set to 2, all files are deleted | string | yes    |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. Import Schema
+This interface can create a schema model based on the schema information specified by description parameter. For details about the schema format, refer to data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |-----------------------|----------------|-----------|
+| graph   | name of the subgraph  | string         | yes       |
+| description   | schema infomation     | json string    | yes         |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. Import Data
+This interface allows users to specify uploaded and verified files as data files and import them to the subgraph specified by the graph parameter. The import process is asynchronous, and the server returns a task id after receiving the import request
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description     | parameter type | necessary |
+| ------- |---------------------------|--------|-----|
+| graph   | name of the subgraph      | string | yes |
+| schema   | schema infomation         | json string | yes |
+| delimiter   | column delimiter          | string | yes |
+| continueOnError   | Whether to skip the error and continue when an error occurs | boolean | no  |
+| skipPackages   | number of packets skipped | string | no  |
+| taskId   | used to restart the failed task | string | no  |
+| flag   | If flag is set to 1, the data file is deleted after the import is successful | string | no  |
+| other   | other parameter           | string | no  |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                 | parameter type   | necessary       |
+| ------- |---------------------------------------|--------|------------|
+| taskId   | task id is used to find a import task | string | yes          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. Import Progress Query
+This interface is used to query the execution progress of a import task
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description                     | parameter type    | necessary |
+| ------- |-------------------------------------------|---------|----|
+| taskId   | task id returned by import_data interface | string | 是 |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                | parameter type | necessary |
+| ------- |--------------------------------------|----------------|-----------|
+| success   | 	whether import is successful        | boolean        | yes       |
+| reason   | 	reason of the import failure        | string         | yes if success is false      |
+| progress   | 	import progress at the current time | string         | yes       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..911de26909
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,269 @@
+# RPC API
+
+> This document mainly introduces the details of calling TuGraph's RPC API.
+
+## 1.Introduction
+
+TuGraph provides rich RPC APIs for developers to remotely call the services provided by TuGraph through RPC requests.
+
+RPC (Remote Procedure Call) is a protocol for requesting services from remote computer programs through a network without the need to understand the underlying network technology.
+Compared with REST, RPC is method-oriented and mainly used for calling function methods. It is suitable for more complex communication scenarios and has higher performance.
+brpc is an industrial-grade RPC framework written in C++. Based on brpc, TuGraph provides rich RPC APIs. This document describes how to use TuGraph's RPC API.
+
+## 2.Request
+
+### 2.1.Establishing a Connection
+
+When developers send RPC requests to TuGraph services, they must first establish a connection. Taking C++ as an example, developers create a channel with the specified URL and create a specified service stub (LGraphRPCService_Stub) from the channel. Subsequently, they can send requests to the remote server through the stub like calling local methods.
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.Request Types
+
+TuGraph supports 10 types of RPC requests, and each request's functionality is shown in the following table:
+
+| Request              | Functionality         |
+|-----------------|------------|
+| GraphApiRequest | Vertex-Edge Index   |
+| CypherRequest   | cypher   |
+| PluginRequest   | Stored Procedures     |
+| HARequest       | High Availability    |
+| ImportRequest   | Data Import     |
+| GraphRequest    | Subgraph Operations     |
+| AclRequest      | Access Control     |
+| ConfigRequest   | Configuration     |
+| RestoreRequest  | Backup       |
+| SchemaRequest   | Schema Management |
+
+When a user sends a request, the following parameters need to be passed in:
+- client_version: an optional parameter, in HA mode, it can prevent outdated responses by comparing `client_version` and `server_version`
+- token: a necessary parameter, the client obtains the token after logging in, and the token is passed in with each request to verify the user's identity
+- is_write_op: an optional parameter, indicating whether the request is a write request
+- user: an optional parameter, set user when synchronizing requests between master and slave in HA mode, and no token verification is required After the service processes the RPC request, it sends back a response.
+
+In addition to containing separate response information for each request, the response message also includes the following parameters:
+- error_code: a necessary parameter, indicating the processing status of the request
+- redirect: an optional parameter, when processing fails to send a write request to a follower in HA mode, set redirect as the request forwarding address, that is, the leader address
+- error: an optional parameter, indicating the error information of the request
+- server_version: an optional parameter, set `server_version` in the HA mode request response to avoid reverse time travel when client reads data
+
+:warning:  **Except for CypherRequest, PluginRequest, HARequest and AclRequest, all other RPC interfaces will be gradually deprecated, and their functions will be unified into the CypherRequest interface.**
+
+## 3.Login
+
+The login request message contains the following parameters:
+- user: a necessary parameter, the username
+- pass: a necessary parameter, the password
+
+Taking C++ as an example, the user sends a login request using the constructed service stub:
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+The login response message contains the following parameters:
+- token: a necessary parameter. After successful login, a signed token, namely Json Web Token, will be received. The client stores the token and uses it for each subsequent request. If the login fails, an "Authentication failed" error will be received.
+
+## 4.Query
+Users can interact with TuGraph through Cypher queries. The Cypher request message contains the following parameters:
+- query: a necessary parameter, the Cypher query statement
+- param_names: an optional parameter, the parameter name
+- param_values: an optional parameter, the parameter value
+- result_in_json_format: a necessary parameter, whether to return the query results in JSON format
+- graph: an optional parameter, the subgraph name for executing the Cypher statement
+- timeout: an optional parameter, the timeout for executing the Cypher statement
+
+Taking C++ as an example, the user sends a Cypher request as follows:
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+The Cypher request response contains one of the following two parameters:
+- json_result: the Cypher query result in JSON format
+- binary_result: the Cypher query result in the CypherResult format
+
+## 5.Stored Procedures
+To meet users' more complex query/update logic, TuGraph supports stored procedures written in C and Python. Users can use RPC requests to perform CRUD operations on stored procedures.
+
+### 5.1.Load Stored Procedures
+The request for loading stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- read_only: a necessary parameter, whether it is read-only
+- code: a necessary parameter, the ByteString generated by reading the stored procedure file
+- desc: an optional parameter, the stored procedure description
+- code_type: an optional parameter, the stored procedure code type, which can be PY, SO, CPP, or ZIP
+
+Taking C++ as an example, the user loads the stored procedure as follows:
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for loading the stored procedure does not contain parameters, and if the loading fails, a BadInput exception will be thrown.
+
+### 5.2.Invoke Stored Procedures
+
+The request for invoking stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- param: a necessary parameter, the stored procedure parameters
+- result_in_json_format: an optional parameter, whether to return the invocation result in JSON format
+- in_process: an optional parameter, to be supported in the future
+- timeout: an optional parameter, the timeout for invoking the stored procedure
+
+Taking C++ as an example, the user invokes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+The response for invoking the stored procedure contains one of the following two parameters:
+- reply: the stored procedure invocation result in the ByteString format
+- json_result: the stored procedure invocation result in JSON format
+
+### 5.3.Delete Stored Procedures
+
+The request for deleting stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+
+Taking C++ as an example, the user deletes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for deleting the stored procedure does not contain parameters, and if the deletion fails, a BadInput exception will be thrown.
+
+### 5.4.List Stored Procedures
+
+The request for listing stored procedures does not require parameters. Taking C++ as an example, the user lists the stored procedures as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+The response for listing the stored procedures contains the following parameter:
+- reply: the procedure list in JSON format
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..3ecfbae4cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2738 @@
+# TuGraph RESTful API Legacy
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+:warning: **All the other RESTful APIs excluding the three below will be deprived after 4/30/2023.**
+- **Login**
+- **Query**
+- **Store Procedures**
+
+## 2.Protocols And Data Format
+
+### 2.1.Protocols
+
+Both HTTP and HTTPS protocols are supported by TuGraph. The system uses HTTP protocol by default. To use HTTPS, the `ssl_auth` option should be set to `true` in the DB configuration.
+
+### 2.2.Request
+
+TuGraph supports HTTP GET/POST/PUT/DELETE requests, in which:
+
+- `GET` requests are used for read-only requests, such as getting vertex properties, edge properties, etc.
+
+- `POST` requests are used to create entities, submit Cypher, and to manage and call stored procedures;
+
+- `PUT` requests are used to modify existing entities, for example, to modify vertex properties, edge properties, etc.
+
+- `DELETE` requests are used to delete existing entities, such as vertices, edges, etc.
+
+In high-availability mode, users can set `ServerVersion` in the request header to make sure the request is never served with an outdated version.
+The current `ServerVersion` can be obtained from the header returned by the server.
+
+### 2.3.Response
+
+TuGraph returns the following HTTP status codes:
+
+- **200 OK**: operation is successful.
+- **307 Temporary Redirect**: the operation is redirected, typically in high-availability mode, to the master.
+- **400 Bad Request**: incorrect input, such as URI error, or invalid parameters.
+- **500 Internal Server Error**: server error.
+
+When the operation is successful, the JSON response contains the return value of the operation. When the operation is redirected, the `location` field in the returned HTTP header contains the redirect destination address.
+When an input error or server error occurs, the JSON response contains a `error_message` field that describes the error.
+
+In high-availability mode, the server will set `server_version` field in the header to inform the client of the data version of the current server. When clients switch between several different servers, this version number guarantees that the client will not read from an outdated server.
+
+### 2.4.Data Format
+
+The server and clients exchange data in JSON format. When sending a request, the header of the HTTP request should be set with `Accept:application/json, Content-Type:app/json`.
+For example, to create a new vertex, the request header should look like the following:
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.5.URI Format
+
+TuGraph REST API provides access to: web visualization, login, db info, label, index, node, relationship, cypher, task, cpp_plugin, and python_plugin.
+The URI format used for each function is as follows:
+
+| URI     | Description                     |
+| ------- | ------------------------------- |
+| /web    | web visualization               |
+| /cypher | cypher request                  |
+| /acl    | access control                  |
+| /user   | user management                 |
+| /login  | user login                      |
+| /info   | database status and information |
+| /task   | task management                 |
+| /db     | subgraph management             |
+
+For each subgraph, the following interfaces are provided:
+
+| URI                              | Description                         |
+| -------------------------------- | ----------------------------------- |
+| /db                              | create, modify, and delete subgraph |
+| /db/_{graph_name}_/node          | vertex operations                   |
+| /db/_{graph_name}_/relationship  | edge operations                     |
+| /db/_{graph_name}_/label         | label-related operations            |
+| /db/_{graph_name}_/index         | index-related operations            |
+| /db/_{graph_name}_/cypher        | subgraph-specific cypher operation  |
+| /db/_{graph_name}_/cpp_plugin    | C++ plugin(stored procedure)        |
+| /db/_{graph_name}_/python_plugin | Python plugin(stored procedure)     |
+| /db/_{graph_name}_/import        | online import                       |
+| /db/_{graph_name}_/misc          | other operations                    |
+
+## 3.Login
+
+The system creates an administrator by default, whose username is _admin_ and password is _73@TuGraph_. For security reasons, please remember to change your password after first starting the server.
+
+### 3.1.User Login
+
+TuGraph provides JWT-based user authentication. To log in to the server, the REST client should send a login request containing a username and password. Upon success, the client will receive a signed token in the form of a Json Web Token (JWT) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token should be stored by the client and used for each subsequent request.
+
+- **URI**: `/login`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| user     | username    | String |
+| password | password    | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+| default_password | whether it is the default password | Bool |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.Token Refresh
+
+After the token expires, the front-end initiates a refresh token interface, and the back-end verifies the validity of the token.
+If the verification passes, a new token is generated; if the verification fails, status code 401 is returned.
+
+- **URI**: `/refresh`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.Modify Token Validity Period
+
+To modify the validity period of Token, three parameters need to be transmitted: jwt, refresh_time and expire_time, among which jwt is used to verify the user’s identity. When refresh_time and expire_time are equal to 0, the validity period is indefinite. When refresh_time exceeds, you need to call the refresh interface to obtain a new Token; When expire_time expires, you need to log in again. (This interface call needs to confirm the security by itself, do not call unless necessary)
+
+- **URI**: `/update_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+| refresh_time | Valid time (deafult set to 0) | Int64 |
+| expire_time | Expire time (deafult set to 0) | Int64 |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.Query Token validity period
+To query the validity period of the Token, you need to transmit jwt to verify the user's identity, and return, refresh_time and expire_time, where refresh_time indicates the refresh time, and you need to call the refresh interface to obtain a new Token when it exceeds; expire_time indicates the expiration time, and you need to log in again when it exceeds.
+
+- **URI**: `/get_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return "refresh_time" and "expire_time".
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+### 3.5.Logout
+
+The user logs out and deletes the token at the same time.
+
+- **URI**: `/logout`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+## 4.Query
+
+URI format is:
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.Call Cypher
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description   | Type   |
+| ------ | ------------- | ------ |
+| graph  | subgraph name | String |
+| cypher | Cypher query  | String |
+
+- **RESPONSE**:
+
+| Field   | Description             | Type    |
+| ------- | ----------------------- | ------- |
+| result  | running results         | List    |
+| elapsed | running time in seconds | Float   |
+| header  | header of the results   | List    |
+| size    | number of results       | Integer |
+
+in which `header` is a list with each element in the form of:
+
+| Field | Description                                                | Type   |
+| ----- | ---------------------------------------------------------- | ------ |
+| name  | the name of column                                         | String |
+| type  | column data type, 0 is scalar, 1 is vertex id, 2 is vector |        |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.Call Cypher with Parameters
+
+Cypher supports querying with parameters. When a Cypher query with parameters is called, TuGraph caches the execution plan for that query to speed up the following queries of the same kind.
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type   |
+| ---------- | ------------- | ------ |
+| graph      | subgraph name | String |
+| cypher     | Cypher query  | String |
+| parameters | parameters    | List   |
+
+- **RESPONSE**:
+
+Same as [Call Cypher](#Call-Cypher).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+## 5.Stored Procedures
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.Create Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                                                                       | Type   |
+| ----------- | --------------------------------------------------------------------------------- | ------ |
+| name        | name of the plugin                                                                | String |
+| description | description of the plugin                                                         | String |
+| code_base64 | code of plugin encoded in base64                                                  | String |
+| read_only   | whether it is a read-only stored procedure                                        | Bool   |
+| code_type   | type of plugin code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String |
+
+_Note: read-only plugins are more efficient than write plugins. Always specify `read-only=true` for read-only transactions._
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.so}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 5.2.List Stored Procedures
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list in which each element is a plugin description, in the format of:
+
+| Field       | Description                               | Type   |
+| ----------- | ----------------------------------------- | ------ |
+| name        | name of the stored procedure              | String |
+| description | description of the stored procedure       | String |
+| read_only   | whether the stored procedure is read-only | Bool   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.Retrieve Stored Procedure Detail
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Procedure detail, including code, in the format of:
+
+| Field       | Description                                                                         | Type                   |
+| ----------- | ----------------------------------------------------------------------------------- | ---------------------- |
+| name        | Procedure name                                                                      | String                 |
+| description | Procedure descrition                                                                | String                 |
+| read_only   | Read only or not                                                                    | Bool                   |
+| code_base64 | 存储过程的代码                                                                      | String, Base64 encoded |
+| code_type   | Type of procedue code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String                 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.Call Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: POST
+
+- **REQUEST**: String input.
+
+| Field   | Description                                               | Type   |
+| ------- | --------------------------------------------------------- | ------ |
+| data    | input data                                                | String |
+| timeout | timeout in seconds, defaults to 0, which means no timeout | Float  |
+
+- **RESPONSE**:
+
+| Field  | Description     | Type   |
+| ------ | --------------- | ------ |
+| result | running results | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.Delete Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+## 6.Deprecated
+
+The APIs below will be removed after 4/30/2023.
+
+### 6.1.User Management
+
+#### 6.1.1.Add User
+
+Add a new user and set the initial password for the user. Only administrators have permission to add new users. The username can only have letters, numbers, and underscores, and should not begin with a number. The password can contain any character. The username and password have a maximum length of 64 bytes.
+
+- **URI**: `/user`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                                 | Type   |
+| -------- | ------------------------------------------- | ------ |
+| user     | username                                    | String |
+| password | password                                    | String |
+| is_admin | whether the user is an administrator or not | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "is_admin": false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.Change Password
+
+Users can change their own passwords, in which case the original password needs to be verified.
+
+Administrators can change the passwords of any user and promote non-admin users to administrators, or demote administrator users to regular users. When modifying another user's password, the original password of the user is not needed.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field            | Description                                                                     | Type   |
+| ---------------- | ------------------------------------------------------------------------------- | ------ |
+| current_password | user's current password, if modifying its own password                          | String |
+| new_password     | user's new password                                                             | String |
+| is_admin         | should this user be administrator or not, used when promoting or demoting users | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user/user1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+        "is_admin": true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.3.List All Users
+
+List all users of the database. Only administrators are allowed to perform this operation.
+
+- **URI**: `/user/`
+
+- **METHOD**: GET
+
+- **RESPONSE**: a dictionary of {`user_name`:`is_admin`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+    • 200: OK
+    Output:
+    {
+        "admin": true,
+        "guest1": false
+    }
+
+#### 6.1.4.Delete User
+
+Delete a user from the DB. Only administrators have permission to do so.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.2.Access Control
+
+TuGraph has four access levels. Different users can have different permissions for each subgraph. The four access levels are as follows:
+
+| Access Level | Description                                                                                                               |
+| ------------ | ------------------------------------------------------------------------------------------------------------------------- |
+| NONE         | no access                                                                                                                 |
+| READ         | read-only                                                                                                                 |
+| WRITE        | can read and write vertexes and edges of the subgraph                                                                     |
+| FULL         | full access, including changing metadata (label, index), managing stored procedures and deleting all data in the subgraph |
+
+Administrators have full access on all subgraphs, and a newly created non-admin user does not have access for any subgraph. Users who have full access on a subgraph can set the access level for other users on that subgraph.
+
+#### 6.2.1.Query User's Access Level
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+When both `user` and `graph` are specified, the user's access level for the subgraph is returned, such as `READ`.
+
+When only `user` is specified, all subgraphs that the user can access (access level not `NONE`) are returned, as well as the user's access level on the subgraph.
+
+When only `graph` is specified, all users who have access level on this graph (excluding administrators, who have implicit `FULL` access) and their access levels are returned. This operation requires administrator permission.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/acl/?user=user1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "graph1": "READ",
+      "graph2": "WRITE",
+      "graph3": "FULL"
+    }
+```
+
+#### 6.2.2.Change User's Access Level
+
+- **URI**: `/acl`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field | Description     | Type   |
+| ----- | --------------- | ------ |
+| user  | username        | String |
+| graph | subgraph's name | String |
+| acl   | access level    | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/acl
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "user1",
+        "graph": "graph1",
+        "acl": "FULL"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.Remove User's Access Right
+
+This is equivalent to setting access level to `NONE`.
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/acl/?user=user1&graph=graph1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.Server Status
+
+#### 6.3.1.Modify Server Configuration
+
+Modifying the server configuration will take effect immediately after the configuration modification and will affect all servers. These configurations take precedence over configuration files and command line arguments.
+
+- **URI**: `/config`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+  | Field            | Description                                           | Type |
+  | ---------------- | ----------------------------------------------------- | ---- |
+  | db_async         | Whether to enable asynchronous mode                   | Bool |
+  | optimistic_txn   | Whether to use optimistic transaction lock by default | Bool |
+  | enable_audit_log | Whether to enable audit logging                       | Bool |
+
+- **RESPONSE**: If successful, return status code 200.
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "db_async": true,
+        "enable_audit_log": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.Current Server Status
+
+- **URI**: `/info`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field          | Description                    | Type                                                                                    |
+| -------------- | ------------------------------ | --------------------------------------------------------------------------------------- |
+| lgraph_version | TuGraph version                | String                                                                                  |
+| git_branch     | server's git branch            | String                                                                                  |
+| git_commit     | server's git commit version    | String                                                                                  |
+| web_commit     | web client commit version      | String                                                                                  |
+| cpp_id         | cpp compiler id                | String                                                                                  |
+| cpp_version    | cpp compiler version           | String                                                                                  |
+| python_version | python lib version             | String                                                                                  |
+| cpu            | cpu information                | Dictionary, format refers [CPU Status](#CPU-Status)                                     |
+| disk           | disk IO information            | Dictionary, format refers [Disk Status](#Disk-Status)                                   |
+| memory         | memory information             | Dictionary, format refers [Memory Status](#Memory-Status)                               |
+| db_space       | graph database storage         | Dictionary, format refers [Graph Database Storage](#Graph-Database-Storage)             |
+| db_config      | graph database configuration   | Dictionary, format refers [Graph Database Configuration](#Graph-Database-Configuration) |
+| up_time        | database's online running time | Integer                                                                                 |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.CPU Status
+
+- **URI**: `/info/cpu`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description        | Type    |
+| ------ | ------------------ | ------- |
+| self   | TuGraph CPU usage  | Integer |
+| server | server's CPU usage | Integer |
+| unit   | metric unit        | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.Disk Status
+
+- **URI**: `/info/disk`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description              | Type    |
+| ----- | ------------------------ | ------- |
+| read  | server's disk read rate  | Integer |
+| write | server's disk wrtie rate | Integer |
+| unit  | metric unit              | String  |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.Memory Status
+
+- **URI**: `/info/memory`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description               | Type    |
+| ------------ | ------------------------- | ------- |
+| self         | TuGraph memory usage      | Integer |
+| server_avail | server's available memory | Integer |
+| server_total | server's total memory     | Integer |
+| unit         | metric unit               | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.Database Size
+
+- **URI**: `/info/db_space`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                | Type    |
+| ----- | -------------------------- | ------- |
+| space | total size of the database | Integer |
+| unit  | metric unit                | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.DB Configuration
+
+- **URI**: `/info/db_config`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description                                       | Type    |
+| ------------ | ------------------------------------------------- | ------- |
+| async        | asynchronous mode                                 | Bool    |
+| disable_auth | whether to disable authentication                 | Bool    |
+| enable_ha    | whether to enable high-availability mode          | Bool    |
+| enable_rpc   | whether to enable RPC server                      | Bool    |
+| host         | bound host address                                | String  |
+| port         | port of REST server                               | Integer |
+| rpc_port     | port of RPC server                                | Integer |
+| thread_limit | limit of available threads for the graph database | Integer |
+| use_ssl      | whether to use SSL for authentication             | Bool    |
+| verbose      | verbose level of the output                       | Integer |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "host":"127.0.0.1",
+      "port":7070,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "use_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.7.High Availability Server List
+
+Get a list of replication servers. Valid only in high-availability mode.
+
+- **URI**: `/info/peers`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of server information, each of server information is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+| state        | server state          | String |
+
+The server state can be `MASTER`, `SLAVE`, or `OFFLINE`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.8.Current Leader Information
+
+Get information of current leader. Valid only in HA mode.
+
+- **URI**: `/info/leader`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current leader server information, which is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.9.Server Statistics
+
+- **URI**: `/info/statistics`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current server statistics, which is formatted as:
+
+| Field           | Description                                   | Type    |
+| --------------- | --------------------------------------------- | ------- |
+| requests/second | number of requests processed per second       | Float   |
+| writes/second   | number of write requests processed per second | Float   |
+| running_tasks   | number of requests in progress                | Integer |
+| failure_rate    | request failure rate                          | Float   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 0.023,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.10.Get Audit Logs
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+
+| Field            | Description                                                                                                             | Type      |
+| ---------------- | ----------------------------------------------------------------------------------------------------------------------- | --------- |
+| begin_time       | start time of the queried log (required, format YYYY-mm-dd HH:MM:SS)                                                    | Timestamp |
+| end_time         | end time of the queried log (default is current time, format YYYY-mm-dd HH:MM:SS)                                       | Timestamp |
+| user             | the operator of the queried log (administrator can query all users' logs, ordinary users can only query their own logs) | String    |
+| num_log          | maximum number of logs to return (default 100)                                                                          | Integer   |
+| descending_order | whether to sort the result in descending order(default is true)                                                         | Bool      |
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of audit logs, each of which is an action log in the format of:
+
+| Field      | Description                                        | Type    |
+| ---------- | -------------------------------------------------- | ------- |
+| index      | the index of the operation                         | Integer |
+| begin_time | the start time of the operation                    | String  |
+| end_time   | the end time of the operation                      | String  |
+| user       | the user of the operation                          | String  |
+| graph      | the graph of the operation                         | String  |
+| type       | the type of the operation                          | String  |
+| read_write | the operation is read operation or write operation | String  |
+| success    | whether the operation is successful                | Bool    |
+| content    | the content of the operation                       | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.Task Management
+
+TuGraph tracks long-running tasks such as complex Cypher queries and plugins. Administrators can query currently running tasks through the REST API and choose to abort the queries if necessary.
+
+The URI format for task management is :
+
+```
+    http://{host}:{port}/task/{task_id}
+```
+
+#### 6.4.1.List Running Tasks
+
+- **URI**: `/task`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+The returned JSON is an array, each of which is formatted as follows:
+
+| Field        | Description                                      | Type   |
+| ------------ | ------------------------------------------------ | ------ |
+| description  | the description of the task                      | String |
+| time_elapsed | time the task has been executing for, in seconds | Float  |
+| task_id      | the ID of the task                               | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.Abort Task
+
+- **URI**: `/task/{task_id}`
+
+Where `task_id` is the `task_id` returned by `GET /task` .
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.5.Subgraph Management
+
+TuGraph supports multiple subgraphs and all subgraphs are completely independent from others. Different subgraphs can have different permissions to different users. Administrators can add, modify and delete subgraphs.
+
+#### 6.5.1.Create New Subgraph
+
+- **URI**: `/db`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description                   | Type                                                                |
+| ------ | ----------------------------- | ------------------------------------------------------------------- |
+| name   | the name of subgraph          | String                                                              |
+| config | the configuration of subgraph | Dictionary, in the format of {{column name 1}:{column value 1},...} |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1"
+        "config" : {
+            "max_size_GB":2048,
+            "async":True
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.Delete Subgraph
+
+- **URI**: `/db/{graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.List All Subgraphs
+
+- **URI**: `/db`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of all subgraphs.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_gb":1024,
+            "async":false
+        }
+    }
+```
+
+### 6.6.Label
+
+TuGraph is a strong-schema database. In each subgraph, each vertex and edge need to have a predefined data format. The data format is determined by Label. Users can use the REST API to add, delete, and query labels and their corresponding data format.
+
+The URI format of the Label operation is
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+Where the {type} can be `node` or `relationship`.
+
+#### 6.6.1.Create Label
+
+A label is created with a fixed data format. A label must be defined before any node or relationship can be created with that label.
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field            | Description                  | Type   |
+| ---------------- | ---------------------------- | ------ |
+| name             | the name of label            | String |
+| fields           | data column definition       | List   |
+| is_vertex        | whether it is a vertex Label | Bool   |
+| primary          | vertex primary property      | String |
+| edge_constraints | edge constraints             | List   |
+
+`primary` should be set when `is_vertex` is `true`. This field is only available for Vertex, and must be set when creating Vertex.
+
+`edge_constraints` could be set when `is_vertex` is `false`, This field is only available for Edge. This field limits the combination of starting and ending vertex of the edge, for example: `[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, just leave this field unset.
+
+In which `fields` is an array, in which each element defines a column of data, as follows:
+
+| Field    | Description                                                | Type                                                                                                         |
+| -------- | ---------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------ |
+| name     | the name of the column                                     | String                                                                                                       |
+| type     | the data type of the column                                | String, with following types: int8, int16, int32, int64, float, double, string, date, datetime, binary, blob |
+| optional | whether the data can be empty (optional, default is false) | Bool                                                                                                         |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.List All Labels
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description               | Type |
+| ------ | ------------------------- | ---- |
+| edge   | the list of edge labels   | List |
+| vertex | the list of vertex labels | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.Get Label Data Format
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Data column definition table as a dictionary, in which each key is the column name, and corresponding value is the column definition defined as follows:
+- | Field    | Description                           | Type   |
+  | -------- | ------------------------------------- | ------ |
+  | optional | whether the column value can be empty | Bool   |
+  | type     | the type of the column value          | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema Import
+
+- **URI**: `/db/{graph_name}/schema/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description              | Type   |
+| ----------- | ------------------------ | ------ |
+| description | Graph labels description | String |
+
+The detail description can refer to `TuGraph Manual`.
+
+- **RESPONSE**:
+
+Schema import will check the new schema and original schema in database if compatible or not. If yes, this request will add the label only in new schema. If no, will return an error code.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.Vertex Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+in which `vid` is a unique integer identifying the vertex, which can be obtained when creating new vertexes or by looking up index.
+
+#### 6.7.1.List Vertex and Label Number
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field      | Description                | Type    |
+| ---------- | -------------------------- | ------- |
+| num_label  | the number of vertex label | Integer |
+| num_vertex | the number of vertex       | Integer |
+
+_Note: `num_vertex` returns an estimate of the number of vertexes, not the exact number. To get the exact number, please use Cypher queries._
+
+#### 6.7.2.Create New Vertex
+
+Insert a vertex into the database.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                  | Type       |
+| -------- | ---------------------------- | ---------- |
+| label    | the name of label            | String     |
+| property | the properties of the vertex | Dictionary |
+
+in which `property` is a dictionary of {`column_name`:`column_value`}.
+
+- **RESPONSE**: if successful, return status code 200 and the new vertex's vid, which can be used in later vertex operations.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.Batch Create Vertexes
+
+TuGraph allows multiple vertices to be inserted as one batch to reduce network overhead.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description               | Type   |
+| ------ | ------------------------- | ------ |
+| label  | the name of Label         | String |
+| fields | the column names          | List   |
+| values | the values of each vertex | List   |
+
+in which `fields` is a list of strings specifying column names, and `values` is a list in which each element is a list of `column_values` corresponding to the column names as specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200, and return the vid list of newly added vertices in the JSON content, where each vid corresponds to each vertex in the request.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.Get Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description       | Type                                                             |
+| -------- | ----------------- | ---------------------------------------------------------------- |
+| label    | the name of Label | String                                                           |
+| property | property          | Dictionary, in the format of {column_name_1:column_value_1, ...} |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.Delete Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200, and also the following content in JSON:
+
+| Field | Description                                    | Type    |
+| ----- | ---------------------------------------------- | ------- |
+| in    | number of incoming edges of the deleted vertex | Integer |
+| out   | number of outgoing edges of the deleted vertex | Integer |
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.Get Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Vertex properties as a dictionary of {`column_name`:`column_value`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.Get Vertex Field
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Value corresponding to the specified `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.Update Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description          | Type       |
+| -------- | -------------------- | ---------- |
+| property | properties to update | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "13737299333"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.8.Edge Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+in which `euid` is a string uniquely identifying the edge, which can be obtained when creating edges or by iterating through the edges of a vertex.
+
+#### 6.8.1.Create Edge
+
+- **URI**: `/db/{graph_name}/node/{src_vid}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                     | Type       |
+| ----------- | ------------------------------- | ---------- |
+| label       | the label of edge               | String     |
+| destination | the `vid` of destination vertex | Integer    |
+| property    | the property of edge            | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200 and the `euid` of new created edge (type is String).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.Batch Create Edges
+
+- **URI**: `/db/{graph_name}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description          | Type   |
+| ------ | -------------------- | ------ |
+| label  | the label of edge    | String |
+| fields | the data column name | List   |
+| edge   | the data of edge     | List   |
+
+where the edge is a list of data, each of which specifies and edge, defined as follows:
+
+| Field       | Description           | Type    |
+| ----------- | --------------------- | ------- |
+| source      | source vertex id      | Integer |
+| destination | destination vertex id | Integer |
+| values      | the data list         | List    |
+
+in which `values` is a list of column values, each of which correspond to the a column name specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200 and the list of `euid`s of the newly created edges.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.List Out-going Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of source vertex's out-going edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.List Incoming Edges
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of destination vertex's incoming edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.List All Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                     | Type |
+| ----- | ------------------------------- | ---- |
+| in    | list of incoming edges' `euid`s | List |
+| out   | list of outgoing edges' `euid`s | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.Get Edge Information
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description                | Type       |
+| -------- | -------------------------- | ---------- |
+| label    | the label of the edge      | String     |
+| property | the properties of the edge | Dictionary |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.Delete Edge
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.Get Edge Properties
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The dictionary of edge's properties.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.Get Edge Field
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the value corresponding to given `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.Update Edge Property
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description              | Type       |
+| -------- | ------------------------ | ---------- |
+| property | properties to be updated | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.9.Index
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+#### 6.9.1.Create Index
+
+Create an index on a (label, field) pair. Blocks until the index is successfully built.
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field     | Description                                                                                 | Type   |
+| --------- |---------------------------------------------------------------------------------------------|--------|
+| label     | the name of label                                                                           | String |
+| field     | field to be indexed                                                                         | String |
+| type | the type of index, 0 means nonunique index, 1 means unique index, 2 means pair_unique index | int      |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.List All Indexes
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.List Indexes Related with Specified Label
+
+- **URI**: `/db/{graph_name}/index/{label}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.Delete Index
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.Get Vertex by Index
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of `vid`s.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+
+
+
+### 6.10.Data Import
+
+- **URI**: `/db/{graph_name}/import/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field             | Description                                                                                        | Type                       |
+|-------------------|----------------------------------------------------------------------------------------------------|----------------------------|
+| description       | description of the file content                                                                    | String                     |
+| data              | contents of the file to be imported (recommended to have a size of 16MB, has a hard limit of 17MB) | Strings / Arrays / Objects |
+| continue_on_error | whether to continue import when an error occurred (optional, default is `false`)                   | Bool                       |
+| delimiter         | delimiter used in the data file (optional, default is `“,”`)                                       | String                     |
+
+The details of the `description` field can be found in [TuGraph Import Tool](../6.utility-tools/1.data-import.md).
+
+`delimiter` can be a single character or multi-character string, but must not contain `\r` or `\n`.
+
+`data` can be one of the following:
+
+- String, such as `"1,2\n3,4\n"`
+- Array of ASCII codes, such as `[49,44,50,10,51,44,52,10]`
+- Dictionary shaped like the above array, such as `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+* **RESPONSE**:
+
+The system **will not** automatically perform actions such as creating a new label, adding an index, and so on. Before you do this, please make sure that the label involved already exists and has an appropriate index.
+
+If the import is successful, return code 200 and return log information (possibly empty) in the `log` field. Otherwise, returns status code 400. None of the data is imported on failure, and error message is set in `error_message`.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+Because the request specifies `continue_on_error: true`, the returned `log` indicates that the first edge cannot be inserted because there is no vertex with uid==1, while the second edge was imported successfully.
+
+### 6.11.Miscellany
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.Extract Subgraph
+
+Give a set of `vid`s and return the minimum subgraph which contains the vertex set and the edges between them.
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type |
+| ---------- | ------------- | ---- |
+| vertex_ids | vertex id set | List |
+
+- **RESPONSE**:
+
+| Field         | description        | Type                                                               |
+| ------------- | ------------------ | ------------------------------------------------------------------ |
+| nodes         | vertex information | List, each element contains vid, label, and properties.            |
+| relationships | edge information   | List, each element contains src, dst, euid, label, and properties. |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..8a5a18add0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Client Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..89977a5656
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/8.query/1.cypher.md
@@ -0,0 +1,2570 @@
+# Cypher API
+
+> This document mainly introduces the detailed usage instructions of TuGraph-Cypher.
+
+## Table of contents
+- [1.Operators](#1operators)
+  - [1.1.Summary](#11summary)
+  - [1.2.General Operators](#12general-operators)
+  - [1.3.Mathematical Operators](#13mathematical-operators)
+  - [1.4.Comparison Operators](#14comparison-operators)
+  - [1.5.String Specific Comparison Operators](#15string-specific-comparison-operators)
+  - [1.6.Boolean Operators](#16boolean-operators)
+  - [1.7.String Operators](#17string-operators)
+  - [1.8.List Operators](#18list-operators)
+- [2.Clauses](#2clauses)
+  - [2.1.Summary](#21summary)
+  - [2.2.Match](#22match)
+  - [2.3.Return](#23return)
+  - [2.4.Where](#24where)
+  - [2.5.Skip](#25skip)
+  - [2.6.Limit](#26limit)
+  - [2.7.Create](#27create)
+  - [2.8.Callyield](#28callyield)
+  - [2.9.Union](#29union)
+- [3.Functions](#3functions)
+  - [3.1.Whole List of Functions](#31whole-list-of-functions)
+  - [3.2.Predicate Functions](#32predicate-functions)
+  - [3.3.Scalar Functions](#33scalar-functions)
+  - [3.4.Aggregating Functions](#34aggregating-functions)
+  - [3.5.List Funtions](#35list-funtions)
+  - [3.6.Mathematical Functions](#36mathematical-functions)
+- [4.Extensions to Opencypher](#4extensions-to-opencypher)
+- [5.Procedures](#5procedures)
+  - [5.1.Procedures Demos](#51procedures-demos)
+  - [5.2.Whole List of Procedures](#52whole-list-of-procedures)
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators support progress overview：
+
+| category                             | supported                                                                                                                                                       | unsupported                                 |
+| ------------------------------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------- |
+| General operators                    | <code>DISTINCT</code>, <code>.</code> for property access                                                                                                       | <code>[]</code> for dynamic property access |
+| Mathematical operators               | <code>+</code>, <code>-</code>, <code>\*</code>, <code>/</code>, <code>%</code>, <code>^</code>                                                                 |                                             |
+| Comparison operators                 | <code>=</code>, <code>&lt;&gt;</code>, <code>&lt;</code>, <code>&gt;</code>, <code>⇐</code>, <code>&gt;=</code>, <code>IS NULL</code>, <code>IS NOT NULL</code> |                                             |
+| String-specific comparison operators | <code>STARTS WITH</code>, <code>ENDS WITH</code>, <code>CONTAINS</code>, <code>REGEXP</code>                                                                    |                                             |
+| Boolean operators                    | <code>AND</code>, <code>OR</code>, <code>XOR</code>, <code>NOT</code>                                                                                           |                                             |
+| String operators                     | <code>+</code> for concatenation                                                                                                                                |                                             |
+| List operators                       | <code>+</code> for concatenation, <code>IN</code> to check existence of an element in a list, <code>[]</code> for accessing element(s)                          |                                             |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+  ```
+  CREATE (a:Person {name: 'Anne', eyeColor: 'blue'}),
+         (b:Person {name: 'Bill', eyeColor: 'brown'}),
+         (c:Person {name: 'Carol', eyeColor: 'blue'})
+  ```
+
+  ```
+  MATCH (p:Person ) RETURN DISTINCT p.eyeColor
+  ```
+
+- ✓ Accessing properties of a nested literal map using the `.` operator
+
+  ```
+  WITH {person: {name: 'Anne', age: 25}} AS p
+  RETURN p.person.name
+  ```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+  ```
+  CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+         (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+         (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+  ```
+  ```
+  MATCH (restaurant:Restaurant), (category:Category)
+  WHERE restaurant["rating_" + category.name] > 6
+  RETURN DISTINCT restaurant.name
+  ```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator `^`
+
+  ```
+  WITH 2 AS number, 3 AS exponent
+  RETURN number ^ exponent AS result
+  ```
+
+- ✓ Using the unary minus operator `-`
+  ```
+  WITH -3 AS a, 4 AS b
+  RETURN b - a AS result
+  ```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+  ```
+  WITH 4 AS one, 3 AS two
+  RETURN one > two AS result
+  ```
+
+### 1.5.String-specific comparison operators
+
+<span id="jump"></span>
+
+- ✓ Using STARTS WITH to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate STARTS WITH 'Jo'
+  RETURN candidate
+  ```
+
+- ✓ Using REGEXP to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate REGEXP 'Jo.*n'
+  RETURN candidate
+  ```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+  ```
+  WITH [2, 4, 7, 9, 12] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number = 4 OR (number > 6 AND number < 10)
+  RETURN number
+  ```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+  More details on string-specific comparison operators can be found [here](#jump)
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+  ```
+  RETURN [1,2,3,4,5]+[6,7] AS myList
+  ```
+- ✓ Using IN to check if a number is in a list
+
+  ```
+  WITH [2, 3, 4, 5] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number IN [2, 3, 8]
+  RETURN number
+  ```
+
+- ✓ Accessing elements in a list using the [] operator
+  ```
+  WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+  RETURN names[1..3] AS result
+  ```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses support progress list：
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>grammar</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="3"><p>Reading clauses</p></td>
+			<td><p>MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>OPTIONAL MATCH</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>MANDATORY MATCH</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="3"><p>Projecting clauses</p></td>
+			<td><p>RETURN … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>WITH … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>UNWIND … [AS]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="4"><p>Reading sub-clauses</p></td>
+			<td><p>WHERE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>ORDER BY [ASC[ENDING] / DESC[ENDING]]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>SKIP</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>LIMIT</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>Writing clauses</p></td>
+			<td><p>CREATE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>DETACH DELETE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td><p>SET</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>REMOVE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Reading/Writing clauses</p></td>
+			<td><p>MERGE</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>CALL […YIELD]</p></td>
+			<td><p>supported</p></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="2"><p>Set operations</p></td>
+			<td><p>UNION</p></td>
+			<td><p>unsupported</p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>UNION ALL</p></td>
+			<td><p>supported</p></td>
+		</tr>
+	</tbody>
+</table>
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+    ```
+    MATCH (n)
+    RETURN n
+    ```
+  - ✓ Get all nodes with a label
+    ```
+    MATCH (movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Related nodes
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+  - ✓ Match with labels
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[]->(movie)
+    RETURN movie.title
+    ```
+  - ✓ Directed relationships and variable
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[r]->(movie)
+    RETURN type(r)
+    ```
+  - ✓ Match on relationship type
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})<-[:ACTED_IN]-(actor)
+    RETURN actor.name
+    ```
+  - ✓ Match on multiple relationship types
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[:ACTED_IN|:DIRECTED]-(person)
+    RETURN person.name
+    ```
+  - ✓ Match on relationship type and use a variable
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[r:ACTED_IN]-(actor)
+    RETURN r.role
+    ```
+
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+    ```
+    MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+    RETURN type(r)
+    ```
+  - ✓ Multiple relationships
+    ```
+    MATCH (charlie {name: 'Charlie Sheen'})-[:ACTED_IN]->(movie)<-[:DIRECTED]-(director)
+    RETURN movie.title, director.name
+    ```
+  - ✓ Variable-length relationships
+    ```
+    MATCH (martin {name: 'Charlie Sheen'})-[:ACTED_IN*1..3]-(movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Relationship variable in variable-length relationships
+    ```
+    MATCH p = (actor {name: 'Charlie Sheen'})-[:ACTED_IN*2]-(co_actor)
+    RETURN relationships(p)
+    ```
+  - ❏ Match with properties on a variable-length path
+    ```
+    MATCH p = (charlie:Person)-[* {blocked:false}]-(martin:Person)
+    WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+    RETURN p
+    ```
+  - ✓ Zero-length paths
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})-[*0..1]-(x)
+    RETURN x
+    ```
+  - ✓ Named paths
+
+    ```
+    MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+    ```
+
+  - ✓ Matching on a bound relationship
+
+    ```
+    MATCH (a)-[r]-(b)
+    WHERE id(r)= 0
+    RETURN a,b
+    ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (oliver:Person {name: 'Oliver Stone'}),
+    p = shortestPath((martin)-[*..15]-(oliver))
+    RETURN p
+    ```
+  - ✓ All shortest paths
+    ```
+    MATCH (martin:Person {name: 'Martin Sheen'}), (michael:Person {name: 'Michael
+    Douglas'}), p = allShortestPaths((martin)-[*]-(michael))
+    RETURN p
+    ```
+
+- Get node or relationship by id
+
+  - ✓ Node by id
+    ```
+    MATCH (n)
+    WHERE id(n)= 0
+    RETURN n
+    ```
+  - ☒ Relationship by id
+    ```
+    MATCH ()-[r]->()
+    WHERE id(r) = 0
+    RETURN r
+    ```
+  - ✓ Multiple nodes by id
+    ```
+    MATCH (n)
+    WHERE id(n) IN [0, 3, 5]
+    RETURN n
+    ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+  ```
+  MATCH (n {name: 'B'}) RETURN n
+  ```
+
+  > **Note**
+  >
+  > Return `id` of n.
+
+- ✓ Return relationships
+
+  ```
+  MATCH (n {name: 'A'})-[r:KNOWS]->(c)
+  RETURN r
+  ```
+
+  > **Note**
+  >
+  > Return `EdgeUid` of r.
+
+- ✓ Return property
+  ```
+  MATCH (n {name: 'A'}) RETURN n.name
+  ```
+- ❏ Return all elements
+  ```
+  MATCH p = (a {name: 'A'})-[r]->(b)
+  RETURN *
+  ```
+- ❏ Variable with uncommon characters
+  ```
+  MATCH (`This isn\'t a common variable`)
+  WHERE `This isn\'t a common variable`.name = 'A'
+  RETURN `This isn\'t a common variable`.happy
+  ```
+- ✓ Aliasing a field
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age AS SomethingTotallyDifferent
+  ```
+- ✓ Optional properties
+  ```
+  MATCH (n)
+  RETURN n.age
+  ```
+- ❏ Other expressions
+
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age > 30, "I'm a literal", (a)-[]->()
+  ```
+
+  `(a)-[]->()` not supported.
+
+- ✓ Unique results
+  ```
+  MATCH (a {name: 'A'})-[]->(b)
+  RETURN DISTINCT b
+  ```
+
+### 2.4.WHERE
+
+- Basic usage
+
+  - ✓ Boolean operations
+    ```
+    MATCH (n)
+    WHERE n.name = 'Peter' XOR (n.age < 30 AND n.name = 'Tobias') OR NOT (n.name =
+    'Tobias' OR n.name = 'Peter')
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node label
+    ```
+    MATCH (n)
+    WHERE n:Swedish
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node property
+    ```
+    MATCH (n)
+    WHERE n.age < 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on relationship property
+    ```
+    MATCH (n)-[k:KNOWS]->(f)
+    WHERE k.since < 2000
+    RETURN f.name, f.age, f.email
+    ```
+  - ❏ Filter on dynamically-computed property
+    ```
+    WITH 'AGE' AS propname
+    MATCH (n)
+    WHERE n[toLower(propname)]< 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Property existence checking
+    ```
+    MATCH (n)
+    WHERE exists(n.belt)
+    RETURN n.name, n.belt
+    ```
+
+- String matching
+
+  - ✓ Match the beginning of a string
+    ```
+    MATCH (n)
+    WHERE n.name STARTS WITH 'Pet'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match the ending of a string
+    ```
+    MATCH (n)
+    WHERE n.name ENDS WITH 'ter'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match anywhere within a string
+    ```
+    MATCH (n)
+    WHERE n.name CONTAINS 'ete'
+    RETURN n.name, n.age
+    ```
+  - ✓ String matching negation
+    ```
+    MATCH (n)
+    WHERE NOT n.name ENDS WITH 's'
+    RETURN n.name, n.age
+    ```
+
+- Using path patterns in `WHERE`
+
+  - ✓ Filter on patterns
+    ```
+    MATCH (tobias {name: 'Tobias'}), (others)
+    WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+    RETURN others.name, others.age
+    ```
+  - ✓ Filter on patterns using NOT
+    ```
+    MATCH (persons), (peter {name: 'Peter'})
+    WHERE NOT (persons)-[]->(peter)
+    RETURN persons.name, persons.age
+    ```
+  - ✓ Filter on patterns with properties
+
+    ```
+    MATCH (n)
+    WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+    RETURN n.name, n.age
+    ```
+
+  - ✓ Filter on relationship type
+    ```
+    MATCH (n)-[r]->()
+    WHERE n.name='Andres' AND type(r) STARTS WITH 'K'
+    RETURN type(r), r.since
+    ```
+
+- Lists
+
+  - ✓ IN operator
+    ```
+    MATCH (a)
+    WHERE a.name IN ['Peter', 'Tobias']
+    RETURN a.name, a.age
+    ```
+
+- Missing properties and values
+
+  - ✓ Default to false if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white'
+    RETURN n.name, n.age, n.belt
+    ```
+  - ✓ Default to true if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+    ORDER BY n.name
+    ```
+  - ✓ Filter on null
+    ```
+    MATCH (person)
+    WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+    person.belt
+    ```
+
+- Using ranges
+
+  - ✓ Simple range
+    ```
+    MATCH (a)
+    WHERE a.name >= 'Peter'
+    RETURN a.name, a.age
+    ```
+  - ✓ Composite range
+    ```
+    MATCH (a)
+    WHERE a.name > 'Andres' AND a.name < 'Tobias'
+    RETURN a.name, a.age
+    ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 3
+  ```
+- ✓ Return middle two records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 1
+  LIMIT 2
+  ```
+- ✓ Using an expression with SKIP to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP toInteger(3*rand())+ 1
+  ```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT 3
+  ```
+- ✓ Using an expression with LIMIT to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT toInteger(3 * rand())+ 1
+  ```
+
+### 2.7.CREATE
+
+- Create nodes
+
+  > **Note**
+  >
+  > TuGraph does not support creating empty nodes and does not support multiple labels.
+
+  - ☒ Create single node
+    ```
+    CREATE (n)
+    ```
+  - ☒ Create multiple nodes
+    ```
+    CREATE (n), (m)
+    ```
+  - ✓ Create a node with a label
+    ```
+    CREATE (n:Person)
+    ```
+  - ☒ Create a node with multiple labels
+    ```
+    CREATE (n:Person:Swedish)
+    ```
+  - ✓ Create node and add labels and properties
+    ```
+    CREATE (n:Person {name: 'Andres', title: 'Developer'})
+    ```
+  - ✓ Return created node
+    ```
+    CREATE (a {name: 'Andres'})
+    RETURN a
+    ```
+
+- Create relationships
+
+  - ✓ Create a relationship between two nodes
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE]->(b)
+    ```
+  - ✓ Create a relationship and set properties
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE {name: a.name + '<->' + b.name}]->(b)
+    ```
+  - ✓ Create a full path
+    ```
+    CREATE p = (andres {name:'Andres'})-[:WORKS_AT]->(neo)<-[:WORKS_AT]-(michael {name:'Michael'})
+    RETURN p
+    ```
+
+- Use parameters with CREATE
+
+  - ❏ Create node with a parameter for the properties
+    ```
+    CREATE (n:Person $props)
+    RETURN n
+    ```
+  - ☒ Create multiple nodes with a parameter for their properties
+    ```
+    UNWIND $props AS map
+    CREATE (n)
+    SET n = map
+    ```
+    cannot create vertex without label.
+
+### 2.8.CALL\[…YIELD\]
+
+- ✓ Call a procedure using CALL
+  ```
+  CALL db.vertexLabels
+  ```
+- ✓ View the signature for a procedure
+  ```
+  CALL dbms.procedures() YIELD name, signature
+  WHERE name='dbms.listConfig'
+  RETURN signature
+  ```
+- ❏ Call a procedure using a quoted namespace and name
+  ```
+  CALL `db`.`vertexLabels`
+  ```
+- ✓ Call a procedure with literal arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+  ```
+- ❏ Call a procedure with parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+  ```
+- ❏ Call a procedure with mixed literal and parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+  ```
+- ✓ Call a procedure with literal and default arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+  ```
+- ✓ Call a procedure within a complex query using CALL…YIELD
+  ```
+  CALL db.vertexLabels() YIELD label
+  RETURN count(label) AS numLabels
+  ```
+- ✓ Call a procedure and filter its results
+  ```
+  CALL db.vertexLabels() YIELD label
+  WHERE label CONTAINS 'User'
+  RETURN count(label) AS numLabels
+  ```
+- ❏ Call a procedure within a complex query and rename its outputs
+  ```
+  CALL db.propertyKeys() YIELD propertyKey AS prop
+  MATCH (n)
+  WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+  ```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION ALL MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+- ❏ Combine two queries and remove duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION
+  MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+<table>
+	<thead>
+		<tr class="header">
+			<th>category</th>
+			<th>function</th>
+			<th>comment</th>
+		</tr>
+	</thead>
+	<tbody>
+		<tr class="odd">
+			<td rowspan="5"><p>Predicate functions</p></td>
+			<td><p>exists()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>all()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>any()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>single()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>none()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="16"><p>Scalar functions</p></td>
+			<td><p>id()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>properties()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>head()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>last()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toBoolean()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>toFloat()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toInteger()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>toString()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>type()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>startnode()</p></td>
+            <td><p></p></td>
+		</tr>
+		<tr class="odd">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>size()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>length()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="even">
+            <td><p>substring()</p></td>
+            <td><p></p></td>
+        </tr>
+        <tr class="odd">
+            <td><p>concat()</p></td>
+            <td><p></p></td>
+        </tr>
+        <tr class="even">
+			<td><p>endnode()</p></td>
+            <td><p></p></td>
+		</tr>
+        <tr class="odd">
+			<td><p>label()</p></td>
+            <td><p>OpenCypher extension method</p></td>
+		</tr>
+        <tr class="even">
+			<td rowspan="12"><p>Aggregating functions</p></td>
+			<td><p>avg()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>collect()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>count()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>max()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>min()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>percentileCont()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>percentileDisc()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+			<td><p>stDev()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>stDevP()</p></td>
+			<td></td>
+		</tr>
+        <tr class="even">
+                <td><p>variance()</p></td>
+                <td></td>
+            </tr>
+        <tr class="odd">
+                <td><p>varianceP()</p></td>
+                <td></td>
+            </tr>
+        <tr class="even">
+                <td><p>sum()</p></td>
+                <td></td>
+		</tr>
+		<tr class="odd">
+			<td rowspan="5"><p>List functions</p></td>
+			<td><p>keys()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>labels()</p></td>
+			<td><p></p></td>
+		</tr>
+	<tr class="odd">
+			<td><p>nodes()</p></td>
+			<td><p></p></td>
+		</tr>
+        <tr class="even">
+			<td><p>range()</p></td>
+			<td></td>
+		</tr>
+        <tr class="odd">
+			<td><p>subscript()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td rowspan="6"><p>Mathematical functions</p></td>
+			<td><p>abs()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>ceil()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>floor()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>rand()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>round()</p></td>
+			<td></td>
+		</tr>
+		<tr class="odd">
+			<td><p>sign()</p></td>
+			<td></td>
+		</tr>
+		<tr class="even">
+			<td><p>String functions</p></td>
+			<td><p>/</p></td>
+			<td></td>
+		</tr>
+	</tbody>
+</table>
+
+### 3.2.Predicate functions
+
+- exists()
+
+  judge it whether a vertex or edge has the field .
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE exists(n.belt)
+  RETURN n.name, n.belt
+  ```
+
+  **Example output:**
+
+  | exists(name) |
+  | ------------ |
+  | true         |
+
+### 3.3.Scalar functions
+
+- id()
+
+  get the id of vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  RETURN id(a)
+  ```
+
+  **Example output:**
+
+  | vid |
+  | --- |
+  | 1   |
+  | 2   |
+  | ... |
+
+- properties()
+
+  get a map containing all the properties of a node or relationship.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  CREATE (p:Person {name: 'Stefan', city: 'Berlin'})
+  RETURN properties(p)
+  ```
+
+  **Example output:**
+
+  | properties                |
+  | ------------------------- |
+  | {name:Stefan,city:Berlin} |
+
+- head()
+
+  get the first element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, head(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | head(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "one"         |
+
+- last()
+
+  get the last element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, last(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | last(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "three"       |
+
+- toFloat()
+
+  Converts an integer or string value to a floating point number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toFloat('11.5'), toFloat('not a number')
+  ```
+
+  **Example output:**
+  | float |
+  | ----- |
+  | 11.5 |
+  |null|
+
+- toInteger()
+
+  Converts a floating point or string value to an integer value.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toInteger('2.3') AS integer
+  ```
+
+  **Example output:**
+
+  | integer |
+  | ------- |
+  | 2       |
+
+- toString()
+
+  Converts an integer, float, boolean value to a string.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toString(2.3)
+  ```
+
+- type()
+
+  get the string representation of the relationship type.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name = 'Alice'
+  RETURN type(r)
+  ```
+
+  **Example output:**
+
+  | type     |
+  | -------- |
+  | acted_in |
+  | acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+
+  Returns the average of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN avg(n.age)
+  ```
+
+  **Example output:**
+
+  | avg(n.born)        |
+  | ------------------ |
+  | 1869.2661654135338 |
+
+- collect()
+
+  Returns a list containing the values returned by an expression.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN collect(n.age)
+  ```
+
+  **Example output:**
+
+  | collect(n.born) |
+  | --------------- |
+  | [1967,...]      |
+
+- count()
+
+  Returns the number of values or records.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n {name: 'A'})-[]->(x)
+  RETURN labels(n), n.age, count(*)
+  ```
+
+  **Example output:**
+
+  | labels(n)  | n.age | count(\*) |
+  | ---------- | ----- | --------- |
+  | ["Person"] | 13    | 3         |
+
+- max()
+
+  Returns the maximum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN max(n.age)
+  ```
+
+  **Example output:**
+
+  | max(n.age) |
+  | ---------- |
+  | 44         |
+
+- min()
+
+  Returns the minimum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN min(n.age)
+  ```
+
+  **Example output:**
+
+  | min(n.age) |
+  | ---------- |
+  | 13         |
+
+- percentileCont()
+
+  Returns the percentile of a value over a group using linear interpolation.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileCont(n.age, 0.4)
+  ```
+
+  **Example output:**
+
+  | percentileCont(n.age, 0.4) |
+  | -------------------------- |
+  | 29                         |
+
+* percentileDisc()
+
+  Returns the nearest value to the given percentile over a group using a rounding method.
+
+  **Scope:** whole instance.
+
+  **Output:** the percentile of the given value over a group.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileDisc(n.age, 0.5)
+  ```
+
+  **Example output:**
+
+  | percentileDisc(n.age, 0.5) |
+  | -------------------------- |
+  | 33                         |
+
+* stDev()
+
+  Returns the standard deviation for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDev(n.age)
+  ```
+
+  **Example output:**
+
+  | stDev(n.age)       |
+  | ------------------ |
+  | 15.716233645501712 |
+
+* stDevP()
+
+  Returns the standard deviation for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDevP(n.age)
+  ```
+
+  **Example output:**
+
+  | stDevP(n.age)      |
+  | ------------------ |
+  | 12.832251036613439 |
+
+* variance()
+
+  Returns the variance for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN variance(n.age)
+  ```
+
+  **Example output:**
+
+  | variance(n.age) |
+  | --------------- |
+  | 247             |
+
+* varianceP()
+
+  Returns the variance for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN varianceP(n.age)
+  ```
+
+  **Example output:**
+
+  | varianceP(n.age) |
+  | ---------------- |
+  | 164.66666666667  |
+
+* sum()
+
+  Returns the sum of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN sum(n.age)
+  ```
+
+  **Example output:**
+
+  | sum(n.age) |
+  | ---------- |
+  | 90         |
+
+### 3.5.List Funtions:
+
+- keys()
+
+  get the field names of some vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN keys(a)
+  ```
+
+  **Example output:**
+
+  | keys(a)               |
+  | --------------------- |
+  | ["name","age","eyes"] |
+
+- labels()/label()
+
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN labels(a)
+  ```
+
+  **Example output:**
+
+  | labels                 |
+  | ---------------------- |
+  | ["Person","Developer"] |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice'})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+### 3.6.Mathematical functions
+
+- abs()
+
+  get the absolute value of some data.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a), (e)
+  WHERE a.name = 'Alice' AND e.name = 'Eskil'
+  RETURN a.age, e.age, abs(a.age - e.age)
+  ```
+
+  **Example output:**
+
+  | a.age | e.age | abs(a.age - e.age) |
+  | ----- | ----- | ------------------ |
+  | 38    | 41    | 1                  |
+
+- ceil()
+
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+  **Example input:**
+
+  ```
+  RETURN ceil(0.1)
+  ```
+
+  **Example output:**
+
+  | ceil(0.1) |
+  | --------- |
+  | 1.0       |
+
+- floor()
+
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN floor(0.9)
+  ```
+
+  **Example output:**
+
+  | floor(0.9) |
+  | ---------- |
+  | 0.0        |
+
+- round()
+
+  Returns the value of a number rounded to the nearest integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN round(3.141592)
+  ```
+
+  **Example output:**
+
+  | round |
+  | ----- |
+  | 3     |
+
+- rand()
+
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN rand()
+  ```
+
+  **Example output:**
+
+  | rand()             |
+  | ------------------ |
+  | 0.9797131960534085 |
+
+- sign()
+
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN sign(-17), sign(0.1)
+  ```
+
+  **Example output:**
+
+  | sign(-17) | sign(0.1) |
+  | --------- | --------- |
+  | -1        | 1         |
+
+## 4.Extensions To OpenCypher
+
+- Number of Labels
+
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+
+  - OpenCypher: One node/relationship may have 0 to many labels.
+
+- Schema.
+
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.Procedures
+
+### 5.1.procedures' demos
+
+- dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                               | name            |
+  | --------------------------------------- | --------------- |
+  | db.vertexLabels() :: (label::STRING)    | db.vertexLabels |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels   |
+  | db.indexes() :: (index::LIST)           | db.indexes      |
+  | ...                                     | ...             |
+
+- db.vertexLabels()
+
+  Lists all available labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+
+  **Example output:**
+
+  | label   |
+  | ------- |
+  | genre   |
+  | keyword |
+  | movie   |
+  | ...     |
+
+- db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edgeLabels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | edgeLabel |
+  | --------- |
+  | acted_in  |
+  | directed  |
+  | ...       |
+
+- db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter     | parameter type | description                   |
+  | ------------- | -------------- | ----------------------------- |
+  | label_name    | string         | name of vertex label          |
+  | primary_field | string         | primary field of vertex label |
+  | field_spec    | list           | specification of a field      |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+  **Output:** If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added label [Person]
+  ```
+
+- db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description                   |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field             |
+  | type       | string     | type of the field             |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name         | type   | optional |
+  | ------------ | ------ | -------- |
+  | id           | INT32  | false    |
+  | born         | INT32  | true     |
+  | name         | STRING | true     |
+  | poster_image | STRING | true     |
+
+- db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | label_type | string         | either 'vertex' or 'edge'                                             |
+  | label_name | string         | name of the label                                                     |
+  | extra      | string         | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list           | specification of a field                                              |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.
+  for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+- db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:**
+
+  | field_name | field_type | description                      |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description                   |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string          | either 'vertex' or 'edge'     |
+  | label_name  | string          | name of the label             |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description               |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string         | either 'vertex' or 'edge' |
+  | label_name       | string         | name of the label         |
+  | field_value_spec | list           | specification of a field  |
+
+  in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, 'optional']`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+  | field_spec | list           | specification of a field  |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelModFields(
+  'vertex',
+  'new_label',
+  ['birth_date', 'DATETIME', '1900-01-01 00:00:00'],
+  ['gender', 'BOOL', false])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description              |
+  | ---------------- | -------------- | ------------------------ |
+  | label_name       | string         | name of the label        |
+  | edge_constraints | string         | edge constraints         |
+  | field_spec       | list           | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for optional fields.
+
+- `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32,true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+- db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+- db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+- | pair_unique  | boolean        | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+- dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description          |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string         | the current password |
+  | new_password     | string         | new password         |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string         | the user's name |
+  | new_password | string         | new password    |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.createUser(user_name, password)
+
+  create new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | ------------------------ |
+  | user_name | string         | the new user name        |
+  | password  | string         | the password of new user |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string         | the user name to be deleted |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string         | the user name               |
+  | is.admin  | boolean        | the permission of this user |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       | ...      |
+
+- dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description           |
+  | --------- | -------------- | --------------------- |
+  | user.user | string         | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+- dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+  a list of ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host         |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...          |
+
+- dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been deleted.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description                      |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string         | the name of new subgraph         |
+  | description | string         | description of new subgraph      |
+  | max_size_GB | integer        | Upper limit of subgraph capacity |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+  | config     | map            | the configuration to be modified     |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.listGraphs()
+
+  get all subgraph in this graph database .
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.config.list()
+
+  get some config of this graph database .
+
+  **Output:**
+
+  a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  | --------- | ------- |
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       | ...     |
+
+- dbms.config.update(updates)
+
+  get some config of this graph database .
+
+  **Output:**
+
+  If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+      enable_ip_check:false,
+      durable:true,
+      optimistic_txn:true,
+      enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+- dbms.takeSnapshot()
+
+  take the snapshot on this current graph database.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+- dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path                       |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+- algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                                                             |
+  | --------- | -------------- | --------------------------------------------------------------------------------------- |
+  | startNode | Node           | the source node of paths                                                                |
+  | endNode   | Node           | the destination node paths                                                              |
+  | config    | MAP            | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+  If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2         | 1         |
+
+- algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+- algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                               |
+  | --------- | -------------- | --------------------------------------------------------- |
+  | id        | ANY            | the id of vertexes or edges , the id must be variable     |
+  | config    | MAP            | the configuration of this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or it is an edge id.
+
+  **Output:**
+
+  If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.Whole List Of Procedures
+
+| Name                                  | Description                                                          | Signature                                                                                                                                                                                |
+|---------------------------------------|----------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.vertexLabels                       | list all vertex labels                                               | db.vertexLabels() :: (label::STRING)                                                                                                                                                     |
+| db.edgeLabels                         | list all edge labels                                                 | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                  |
+| db.indexes                            | list all indexes                                                     | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                     |
+| db.listLabelIndexes                   | list indexes by label                                                | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                           |
+| db.warmup                             | warm up the DB                                                       | db.warmup() :: (time_used::STRING)                                                                                                                                                       |
+| db.createVertexLabel                  | create a vertex label                                                | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                   |
+| db.createLabel                        | create a vertex/edge label                                           | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                              |
+| db.getLabelSchema                     | get the schema of label                                              | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                                |
+| db.getVertexSchema                    | get the schema of vertex label                                       | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                       |
+| db.getEdgeSchema                      | get the schema of edge label                                         | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                         |
+| db.deleteLabel                        | delete vertex/edge label                                             | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                        |
+| db.alterLabelDelFields                | delete some fields of a label on a subgraph                          | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                             |
+| db.alterLabelAddFields                | add some fields of a label on a subgraph                             | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                  |
+| db.alterLabelModFields                | modify some fields of a label on a subgraph                          | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                        |
+| db.createEdgeLabel                    | create a edge label                                                  | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                      |
+| db.addIndex                           | add an index                                                         | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                           |
+| db.addEdgeIndex                       | add an index                                                         | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                  |
+| db.addVertexCompositeIndex            | add composite index                                                  | db.addVertexCompositeIndex(label_name::STRING,field_names::LIST,unique::BOOLEAN) :: (::VOID)                                                                                            |
+| db.deleteIndex                        | delete an index                                                      | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                        |
+| db.backup                             | backup the db                                                        | db.backup(destination::STRING) :: ()                                                                                                                                                     |
+| dbms.procedures                       | list all procedures                                                  | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                    |
+| dbms.security.changePassword          | change current user password                                         | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                  |
+| dbms.security.changeUserPassword      | change user password                                                 | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                     |
+| dbms.security.createUser              | create an account                                                    | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.deleteUser              | delete an account                                                    | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.listUsers               | list all accounts                                                    | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                          |
+| dbms.security.showCurrentUser         | get current user name                                                | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                                |
+| dbms.security.getUserPermissions      | get the permissions of a specified user                              | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                  |
+| dbms.graph.createGraph                | create a subgraph                                                    | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                        |
+| dbms.graph.modGraph                   | modify the config of a subgraph                                      | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                          |
+| dbms.graph.deleteGraph                | delete a subgraph                                                    | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                   |
+| dbms.graph.listGraphs                 | list all subgraphs                                                   | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                       |
+| dbms.graph.getGraphInfo               | get the information of a specified graph                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                     |
+| dbms.security.addAllowedHosts         | add to the trust list                                                | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                         |
+| dbms.security.deleteAllowedHosts      | remove from the trust list                                           | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                              |
+| dbms.security.listAllowedHosts        | list the trust list                                                  | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                       |
+| dbms.config.update                    | update the configuration                                             | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                    |
+| dbms.config.list                      | list the configuration                                               | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                          |
+| algo.shortestPath                     | get a shortest path between two vertexes                             | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                    |
+| algo.allShortestPaths                 | get all the shortest paths between two vertexes                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                     |
+| algo.native.extract                   | get the field values of a list of vertexes or edges specified id     | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                 |
+| db.flushDB                            | flush the db                                                         | db.flushDB() :: (::VOID)                                                                                                                                                                 |
+| dbms.security.listRoles               | list all roles                                                       | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                          |
+| dbms.security.createRole              | create a role                                                        | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                     |
+| dbms.security.deleteRole              | delete a role                                                        | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.getRoleInfo             | get the role information                                             | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                              |
+| dbms.security.disableRole             | enable/disable the role                                              | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.modRoleDesc             | modify the description of a role                                     | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.rebuildRoleAccessLevel  | rebuild the user subgraph access rights                              | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                         |
+| dbms.security.modRoleAccessLevel      | modify the user subgraph access rights                               | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                             |
+| dbms.security.modRoleFieldAccessLevel | modify the user property access rights                               | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                  |
+| dbms.security.getUserInfo             | get the user information                                             | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                              |
+| dbms.security.getUserMemoryUsage      | get the memory usage for a user                                      | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                                |
+| dbms.security.disableUser             | enable/disable the user                                              | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.setCurrentDesc          | set the current user description                                     | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                            |
+| dbms.security.setUserDesc             | set user description                                                 | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.setUserMemoryLimit      | set user memory limit                                                | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                          |
+| dbms.security.deleteUserRoles         | delete roles from the user                                           | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                      |
+| dbms.security.rebuildUserRoles        | rebuild the relationship between the user and the role               | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.addUserRoles            | add the user roles                                                   | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                         |
+| db.plugin.loadPlugin                  | load a plugin                                                        | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN, version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | unload a plugin                                                      | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                              |
+| db.plugin.listPlugin                  | list all plugins                                                     | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                           |
+| db.plugin.getPluginInfo               | get the information of a specified plugin                            | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                           |
+| db.plugin.callPlugin                  | execute the plugins                                                  | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                     |
+| db.importor.dataImportor              | import vertex/edge data                                              | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                              |
+| db.importor.schemaImportor            | import vertex/edge schema                                            | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                              |
+| dbms.meta.count                       | get the total number of vertex and edge                              | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                  |
+| dbms.meta.countDetail                 | get the number of vertex and edge for each label                     | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                        |
+| dbms.meta.refreshCount                | recount the number of vertex and edge, stop writing during the count | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                  |
+| dbms.task.listTasks                   | list running tasks                                                   | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                     |
+| dbms.task.terminateTask               | terminate task                                                       | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                       |
+| dbms.ha.clusterInfo                   | get cluster info in HA mode                                          | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                        |
+| db.dropDB                             | empty the db                                                         | db.dropDB() :: (::VOID)                                                                                                                                                                  |
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/8.query/2.gql.md
new file mode 100644
index 0000000000..ea00f3ceb1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/8.query/2.gql.md
@@ -0,0 +1,392 @@
+# ISO GQL
+
+
+## 1.Introduction to ISO GQL
+
+Graph Query Language (GQL) is an upcoming International Standard language for property graph querying. It builds on the foundations of SQL and integrates proven ideas from the existing [openCypher, PGQL, GSQL, and G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/) languages. The standard is currently in the draft stage.
+
+TuGraph has implemented GQL based on the [ISO GQL (ISO/IEC 39075) Antlr4 grammar file](https://github.com/TuGraph-family/gql-grammar). It includes some extensions and modifications. Not all GQL syntax is fully supported at the moment, but we will continue to improve and enhance it in the future.
+
+## 2.List of Clauses
+
+| Category            | Clauses        |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+
+### 2.1.MATCH
+
+The `MATCH` clause is the most basic clause in GQL, and almost all queries are expanded through `MATCH`.
+
+The `MATCH` clause is used to specify the matching pattern to search in the graph, to match vertices or paths that meet certain conditions.
+
+
+#### Vertex basics
+
+##### Get all vertices
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### Get all vertices with a label
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### Vertex matching with property
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### Vertex matching with filter
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Edge basics
+
+##### Edge pointing right
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### Edge pointing left
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### Edge matching with filter
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+return
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### Path matching
+
+##### Variable length
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+return
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+The `OPTIONAL MATCH` clause matches a graph pattern and returns `null` if there is no match.
+
+
+#### Match found
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### Match Not Found
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+return
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+The `RETURN` clause specifies the results to be returned, including vertices, edges, paths, properties, etc.
+
+#### Return vertices
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+return
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### Return edges
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+return
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### Return property
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Uncommon string used as variable name
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### Alias
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+return
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### Optional property
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### Other expressions
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+return
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### Distinct
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+return
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+The `NEXT` clause is used to connect multiple clauses.
+
+#### Connecting MATCH clauses
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE` clause is used to filter records.
+
+#### Filter vertex
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+returns
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### Filter edge
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+returns
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### Boolean expressions
+
+`AND`, `OR`, `XOR`, and `NOT` Boolean expressions can be used in the `WHERE` clause to filter data.
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+returns
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+### 2.6.ORDER BY
+
+`ORDER BY` is a clause of `RETURN` that sorts the output result.
+
+#### Sorting the Result
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+return
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP` specifies the offset of the result rows.
+
+#### Without SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### Using SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+The `LIMIT` clause is used to limit the number of rows in the result.
+
+#### Using LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/8.query/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/8.query/index.rst
new file mode 100644
index 0000000000..5e736c4232
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/8.query/index.rst
@@ -0,0 +1,9 @@
+Query
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..83ba668355
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,342 @@
+# TuGraph Stored Procedure Guide
+
+> This document mainly explains the instructions for using the TuGraph stored procedure.
+
+## 1. Introduction
+
+When the query/update logic that users need to express is more complex (such as cannot be described by Cypher or has high performance requirements), compared to calling multiple requests and completing the entire processing flow on the client, the stored procedure provided by TuGraph is a more concise and efficient choice.
+
+Similar to traditional databases, the TuGraph stored procedure runs on the server side. Users can encapsulate the processing logic (i.e., multiple operations) into a procedure call, and further improve performance by parallel processing (such as using relevant C++ OLAP interfaces and built-in algorithms) during implementation.
+
+There is a special type of API in the stored procedure for parallel data operations, which we call the Traversal API. Please refer to the [documentation](2.traversal.md) for more information.
+
+## 2. Stored Procedure Version
+
+Currently, TuGraph supports two versions of stored procedures, which are suitable for different scenarios. Version 3.5 only supports v1, which can be directly called through the REST or RPC interface. Starting from version 3.5, v2 is supported, which allows embedding calls in graph query languages ​​(such as Cypher). We call it POG (Procedure On Graph query language, APOC).
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+|Applicable Scenarios	|Extreme performance or complex multi-transaction management scenarios	|General scenarios, highly integrated with Cypher|
+|Transaction	|Created internally in the function, multiple transactions |can be freely controlled	Passed into the external function, single transaction|
+|Signature (parameter definition)	|Not required	|Required|
+|Input and output parameter types	|Not required to specify	|Need to specify parameter types|
+|Cypher Standalone Call	|Supported	|Supported
+|Cypher Embeded Call	|Not supported	|Supported|
+|Language	|C++/Python/Rust	|C++|
+|Calling mode	|Directly pass the string, usually in JSON format	|Through variables in Cypher statements|
+
+
+In TuGraph, stored procedures v1 and v2 are managed separately, and support for create, delete, and query operations is provided. However, it is still not recommended to have the same name for multiple stored procedures.
+
+## 3. Supported Languages
+
+In TuGraph, users can dynamically load, update, and delete stored procedures. TuGraph supports the use of C++, Python, and Rust languages to write stored procedures. Among them, C++ language has the most complete support and the best performance.
+
+Note that the stored procedure is the logic compiled and executed on the server side, which is independent of the language support on the client side.
+
+## 4. Procedure v1 Interface
+
+## 4.1.Write stored procedures
+### 4.1.1.Write C++ stored procedure
+
+Users can write C stored procedures by using core API or Traversal API. An example of a simple C stored procedure is as follows:
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## Count all students whose age is 10
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+From the code, we can see the entry of a TuGraph C++ stored procedure is the `Process` function, with three parameters:
+
+- `db`: the TuGraph database instance
+- `request`: the input data, which can be a binary byte array, or any other format such as JSON string.
+- `response`: the output data, which can be a string or directly return binary data.
+
+The return value of the `Process` function is a boolean value. When it returns `true`, it means that the request is successfully completed, otherwise it means that the stored procedure found an error during execution, and the user can return an error message through `response` to facilitate debugging.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which is `age_10` in the above example. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, age_10.so will be generated, which can then be loaded into the server by the user.
+
+### 4.1.2 Writing Python stored procedures
+
+The following snippet does the same thing as the above C++ stored procedure, but via TuGraph Python API:
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+The Python stored procedure returns a tuple, the first element of which is a Boolean value indicating whether the stored procedure was successfully executed; the second element is a `str`, which contains the result to be returned.
+
+Python stored procedures do not need to be compiled and can be loaded directly.
+
+## 4.2.How to use stored procedures
+
+### 4.2.1.Install Stored Procedures
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `age_10.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+                  headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `age_10.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+### 4.2.2.List Stored Procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.Retrieve Stored Procedures Detail
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.Uninstall Stored Procedures
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+### 4.2.6.Upgrade Stored Procedures
+
+You can upgrade a stored procedure with the following two steps:
+
+1. Uninstall the existing one.
+2. Install the new on.
+
+TuGraph carefully manages the concurrency of stored procedure operations. Upgrading stored procedures will not affect concurrent runs of existing ones.
+
+## 5. Procedure v2 Interface
+
+### 5.1.Writing stored procedures
+
+Users can write C++ stored procedures by using lgraph API. A simple C++ stored procedure example is as follows:
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+From the code we can see:
+- The stored procedure defines a method `GetSignature` to get the signature. This method returns the signature of the stored procedure, which includes input parameter names and their types, and return parameters and their types. This enables the Cypher query statement to use the signature information to verify whether the input data and the returned data are reasonable when calling the stored procedure.
+- The entry function is the `ProcessInTxn` function, which has three parameters, which are:
+
+- `txn`: The transaction of the stored procedure, generally speaking, the transaction of the Cypher statement that calls the stored procedure.
+- `request`: input data, its content is the string of the input parameter type defined in `GetSignature` and the value passed in the Cypher query statement after json serialization. e.g. `{num_iteration: 10}`
+- `response`: output data, in order to ensure compatibility in the Cypher language, users can write the data processed by the stored procedure to `lgraph_api::Result`, and finally use `lgraph_api::Result::Dump` to serialize it into data in json format.
+
+The return value of the `ProcessInTxn` function is a boolean value. When it returns `true`, it means that the request was successfully completed, otherwise it means that the stored procedure found an error during execution.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which in the above example is `custom_pagerank`. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, custom_pagerank.so will be generated, which can then be loaded into the server by the user.
+
+### 5.2.Load stored procedure
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `custom_pagerank.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `custom_pagerank.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+#### 5.2.1.List loaded stored procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.Get stored procedure details
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.Delete stored procedure
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+#### 5.2.5.Update stored procedure
+
+Updating a stored procedure requires the following two steps:
+
+1. Delete the existing stored procedure
+2. Install the new stored procedure
+
+TuGraph carefully manages the concurrency of stored procedure operations, and updating stored procedures will not affect the operation of existing stored procedures.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..e4abd3a263
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,125 @@
+# Traversal API
+
+> This document mainly explains the Traversal API in the stored procedure of TuGraph.
+
+1. Introduction
+The powerful online analytical processing (OLAP) capability of TuGraph is an important feature that sets it apart from other graph databases. With the help of the C++ OLAP API (olap_on_db.h), users can quickly export a subgraph that needs to be analyzed, and then run iterative graph computing processes such as PageRank, connected components, and community detection on it, and then make corresponding decisions based on the results. The export and computation processes can be accelerated through parallel processing, achieving almost real-time analysis and processing, and avoiding the lengthy steps of traditional solutions that require exporting, transforming, and reimporting (ETL) data into dedicated analytical systems for offline processing.
+
+TuGraph has built-in many commonly used graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement specific graph computing processes themselves. They just need to include the header files (.h files) of the corresponding algorithm library in their own programs when implementing their own storage procedures, and link the corresponding dynamic library files (.so) during compilation. In general, the only process that users need to implement themselves is the extraction of the subgraph to be analyzed.
+
+Currently, the Traversal API only supports C++.
+
+## 2. Interface
+
+### 2.1. Snapshot
+
+The Snapshot template class in C++ OLAP API is used to represent extracted static subgraphs. The EdgeData is used to represent the data type of the weight used for each edge in the subgraph. If the edges do not require weights, Empty is used as the EdgeData.
+
+The extracted subgraph can be described using the constructor of the Snapshot class.
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+In the above text, "db" represents the database handle, "txn" represents the transaction handle, and "flags" represents the options used during generation, with the optional values including the following combinations: SNAPSHOT_PARALLEL indicates that multiple threads are used for parallel extraction during export; SNAPSHOT_UNDIRECTED indicates that the exported graph needs to be transformed into an undirected graph.
+
+"vertex_filter" is a user-defined filtering function for vertices, where a return value of true indicates that the vertex needs to be included in the extracted subgraph, and vice versa.
+
+"out_edge_filter" is a user-defined filtering function for edges, where a return value of true indicates that the edge needs to be included in the extracted subgraph, and vice versa.
+
+When the filtering functions are set to default values, it means that all vertices/edges should be included.
+
+For other methods provided by the Snapshot class, please refer to the detailed C++ API documentation (olap_on_db.h).
+
+### 2.2. Traversal
+
+A common type of analysis in graph databases is to start from one or more vertices and iteratively expand and access their neighbors. Although this type of analysis can be done using Cypher, its performance is limited by the serial interpretation and execution when the depth of traversal is large. Writing stored procedures using the C++ Core API eliminates the overhead of interpretation but is still limited by the processing power of a single thread.
+
+In order to enable users to accelerate these types of analysis tasks through parallel processing, we have wrapped a Traversal framework based on the C++ OLAP API. Users can directly use the FrontierTraversal and PathTraversal classes in this framework to perform iterative traversal analysis tasks. For specific usage instructions, please refer to the corresponding C++ API documentation (lgraph_traversal.h).
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+This method can be used to find all vertices that satisfy a certain condition (when the filter returns true). When the "parallel" parameter is set to true, the search process will be executed in parallel.
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+This method can be used to extract (VertexData type) properties from a specified set of vertices (frontier) using the extract method. When the "parallel" parameter is set to true, the extraction process will be executed in parallel.
+
+FrontierTraversal is suitable for cases where only the traversed set of vertices is of interest. When a user needs to access information along the path (vertices/edges along the path) in the traversal process or result, PathTraversal needs to be used. Both types of traversal have four parameters in their constructor, namely the database handle db, transaction handle txn, options flags and capacity. The available options include the following combinations: TRAVERSAL_PARALLEL indicates that multiple threads are used for parallel traversal; TRAVERSAL_ALLOW_REVISITS indicates that vertices can be visited repeatedly during traversal (PathTraversal implicitly includes this option).
+capacity indicates the capacity of the path collection during initialization.
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+Both types of traversal have three ways to set the starting vertex/vertex set for traversal. The first two methods directly specify the vertex ID, while the last method is similar to FindVertices.
+
+Both types of traversal start from the set of vertices in the current layer. They use the extension function to access each outgoing edge/incoming edge/outgoing and incoming edges, and use a user-defined filter function to determine if the extension is successful. If successful, the neighboring vertex/appended path with the edge is added to the set of vertices/paths in the next layer.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+The above describes the three traversal methods of FrontierTraversal. It starts from the current set of vertices and, for each vertex in the set, iterates through each outgoing edge/incoming edge/outgoing and incoming edges. If the edge or neighbor vertex satisfies the user-defined filter conditions (where edge_filter is the filter function for edges and neighbour_filter is the filter function for neighbor vertices), the neighbor vertex is added to the new set of vertices.
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+After the expansion of the current set of vertices is finished, the new set of vertices can be obtained using the above method.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+The three traversal methods of PathTraversal are similar to FrontierTraversal, except that the user-defined filter function adds two additional parameters: Path, which contains the path before the new edge is expanded, and IteratorHelper, which can be used to convert the vertices/edges in the path to corresponding iterators in the database. The relevant documentation can be found in the corresponding C++ API documentation.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..8fde487168
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++ Stored Procedures
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..ee872967df
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,29 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python stored procedure API
+====================================
+Version: 4.3.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..d50c8ecdcf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,17 @@
+# Rust Stored Procedures
+
+## 1. Introduction
+Rust stored procedures currently only support v1 version. TuGraph supports plugins in any language that can be compiled into a dynamic library. Rust, as a rising star in system programming languages, has significant advantages in terms of safety, reliability, and ergonomics compared to C++.
+
+We provide the Rust binding library for TuGraph to support calling lgrahp API in Rust. We also provide the [tugraph-plugin-util](https://crates.io/crates/tugraph-plugin-util ) utility library to help simplify the process of writing Rust plugins.
+
+## 2. How to Use
+
+Using Rust stored procedures involves three steps:
+* Compilation: Compile the Rust source code into a dynamic library (so file). We have prepared a comprehensive plugin development tutorial that covers everything from IDE plugin installation and environment setup to compilation. Please refer to the `rust-tugraph-plugin-tutorial` for detailed instructions.
+* Loading: Load the dynamic library (so file) into the server. This can be done through the REST or RPC interface, similar to the usage of C++ libraries. Please refer to the documentation for more details on the [Procedure v1 API](1.procedure.md).
+* Execution: Once the library is loaded, use it as you would with a C++ stored procedure. The process is the same and does not need further explanation.
+
+## 3. API Documentation
+
+In the Rust community, all code and documentation can be found on [`crates.io`](https://crates.io/crates/tugraph ) and [`docs.rs`](https://docs.rs/tugraph/latest/tugraph ).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..d92b151f40
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.3.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..22403ca19e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..83cc10c52e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..5e4000b6ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,214 @@
+# Bootstrap program
+
+>This document is a bootstrap program designed for TuGraph users. Before reading the detailed documents, users should read this document first to have a general understanding of TuGraph's graph computing operation process, and it will be more convenient to read the detailed documents later. The bootstrap program is a simple instance of a bfs (breadth-first search) program based on Tugraph, and we will focus on how it is used.
+
+## 1.Introduction to TuGraph-Graph Analysis Engine
+
+TuGraph's graph analysis engine is mainly used for full graph/full data analysis tasks. With the help of TuGraph's C++ / Python graph analysis engine API, users can quickly derive a complex subgraph from different data sources, and then run iterative graph algorithms such as PageRank, LPA, WCC on the subgraph, and finally make corresponding countermeasures according to the running results.
+
+In TuGraph, the process of both exporting and computing can be accelerated by in-memory parallel processing, resulting in near-real-time processing and analysis. Compared to traditional methods, this approach can avoid the overhead of data export and disk drop, and can achieve ideal performance by using a compact graph data structure.
+
+TuGraph has 6 built-in algorithms in the community version and 25 built-in algorithms in the commercial version. Users hardly need to implement the specific graph calculation process themselves. For details, please refer to algorithms.md.
+
+According to different data sources and implementations, it can be divided into Procedure, Embed and Standalone, which all inherit from OlapBase API. OlapBase API interface documentation can be found in OlAPBase-APi.md.
+
+The data source of Procedure and Embed is the db data preloaded in the graph database, which can be compiled to generate the.so file used by TuGraph-Web loading and the embed file used by the background terminal respectively. The input graph data are loaded in the form of db. The interface document can refer to olapondb-api.md.
+
+Standalone is used to compile and generate a standalone file. Different from the former, the input graph data of the file is loaded in the form of txt, binary, and ODPS files, and the interface document can refer to olapondisk-api.md.
+
+## 2.Procedure compile and run
+
+This mode is mainly used for visual loading and running on the TuGraph-web interface. The usage method is as follows:
+
+### 2.1.C++
+Run bash make_so.sh bfs in the TuGraph/procedures directory to the BFs.so file in the TuGraph/procedures directory, upload the file as a plug-in to Tugraph-web, input parameters and then execute.
+
+### 2.2.Python
+Upload the python file as a plugin to TuGraph-web, and execute it after inputting parameters.
+
+Example:
+Compile the.so algorithm file at TuGraph/procedures
+`bash make_so.sh bfs`
+
+After loading the bfs.so (or TuGraph/procedures/algo_cython/bfs.py) file as a plug-in to TuGraph-web, enter the following json parameters:
+
+```json
+{
+  "root_id": "0",
+  "label": "node",
+  "field": "id"
+}
+```
+
+The following result
+
+result:"{"core_cost":0.013641119003295898,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":8.821487426757813e-06,
+"prepare_cost":0.03479194641113281,
+"total_cost":0.04844188690185547}"
+
+The output ：
+
+- num_edges: the number of edges in the graph
+- num_vertices: the number of nodes in the graph
+- prepare_cost: Represents the time required for the preprocessing phase. The preprocessing phase works: loading parameters, graph data loading, index initialization.
+- core_cost: Represents the time required for the algorithm to run.
+- found_vertices: Number of vertices found.
+- output_cost: the time it takes for the algorithm result to be written back to db.。
+- total_cost: The overall running time of the algorithm is executed.
+
+make_so.sh This file is used to compile the graph algorithm files involved in TuGraph-OLAP into a.so file available for TuGraph-web.
+
+## 3.Embed compile and run
+
+This way is mainly used for TuGraph in the background program on the preloaded db graph data algorithm analysis. Its use method is as follows:
+
+To complete the embed_main.cpp file in TuGraph/procedures directory, add the data name, input parameters, data path and other information, as shown in the following example:
+
+### 3.1.C++
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path Specifies the path for saving the preloaded graph data
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // Specifies the name of the graph
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // Enter the algorithm parameters in json format
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+
+Run bash make_so.sh bfs in TuGraph/procedures to bfs_procedure in TuGraph/procedures/algo_cpp.
+`bash make_embed.sh bfs`
+
+Do this in the TuGraph/procedures folder
+`./algo_cpp/bfs_procedure`
+The result is returned.
+
+Input: {"root_id":"0", "label":"node","field":"id"}
+found_vertices = 3829
+{"core_cost":0.025603055953979492,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":9.059906005859375e-06,
+"prepare_cost":0.056738853454589844,
+"total_cost":0.0823509693145752}
+
+`Input` indicates the input parameters.The other parameters are described as above.
+
+### 3.2.Python
+
+To compile bfs.so, run `bash make_so_cython.sh bfs` in TuGraph/procedures or `python3 setup.py build_ext -i` in TuGraph/procedures/algo_cython.
+
+After obtaining bfs.so, it can be imported and used in Python, as shown in TuGraph/procedures/run_embed.py:
+
+```python
+# TuGraph/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+
+# shell
+python3 run_embed.py
+```
+The output is the same as C++
+
+
+## 4.Standalone compile and run
+
+This file is mainly used to load the graph data directly at the terminal and run the printout results. Here's how to use it:
+
+In TuGraph/build directory `make bfs_standalone` (need to include boost/sort/sort.hpp in the g++ default include path) can get bfs_standalone file, the file is generated with TuGraph/build/output/algo folder.
+
+Run: Go to the TuGraph/build directory and do`./output/algo/bfs_standalone -- type [type] -- input_dir [input_dir] --id_mapping [id_mapping] -- vertices [vertices] --root (root) - output_dir [output_dir]`
+
+Ready to run.
+
+- `[type]` : indicates the type source of the input graph file, including text file, BINARY_FILE binary file, and ODPS source.
+
+- `[input_dir]` : indicates the path of the input graph file folder, which may contain one or more input files. TuGraph will read all the files under [input_dir] when reading the input file. It is required that [input_dir] can only contain the input file and cannot contain other files. Parameters cannot be omitted.
+
+- `[id_mapping]`：When reading the side table, whether to do id mapping for the input data to make it conform to the form of algorithm operation. 1 is required for id mapping, 0 is not required. This process will take some time. The parameter can be omitted, and the default value is 0.
+
+- `[vertices]` : represents the number of vertices in the graph. 0 indicates the number of vertices that the user wants the system to automatically recognize. When is non-zero, it indicates the number of vertices that the user wants to customize. The number of user-defined vertices must be greater than the maximum vertex ID. This parameter can be omitted. The default value is 0.
+
+- `[root]` : indicates the starting vertex id for bfs. The argument cannot be omitted.
+
+- `[output_dir]` : indicates the path of the folder where the output data is saved. The output content is saved to this file, and the parameter cannot be omitted.
+
+Example
+
+### 4.1.C++
+
+Compile the standalone algorithm program at TuGraph/build
+
+```shell
+make bfs_standalone
+```
+
+Run the text source file in TuGraph/build/output
+
+```
+    ./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+Result：
+
+```
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+Result Parameter description is the same as above.
+
+If you do not know the required parameters of a new algorithm, run the`./output/algo/bfs_standalone -h` to view the parameters.
+
+### 4.2.Python
+The bfs extension compilation process of the Python language is the same as that of the embed mode. It is called through the `Standalone` interface at runtime. The example is as follows:
+
+```python
+# TuGraph/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(
+        input_dir="../test/integration/data/algo/fb_unweighted",
+        root=0)
+
+# shell
+python3 run_standalone.py
+```
+
+At this point, the process of bfs operation on the figure above by TuGraph is complete.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..af510f95c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,196 @@
+# OlapBase API
+
+> This document will introduce how to use the OlapBase API
+
+## 1.The overview
+
+This manual will introduce the configuration of the TuGraph graph computing system. Combined with the code, several important files and interfaces in TuGraph are introduced.
+
+## 2.Configuration requirements
+
+To develop and compile applications using the TuGraph graph computing system, the configuration required:
+
+- linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+
+- Compiler that supports C++ 14, requires GCC version 5.4.1 or later.
+
+## 3.Atomic operations
+
+TuGraph uses multi-threading technology for batch operations, in which case memory access conflicts may occur. In order to ensure the correctness of modification operations in parallel computing, TuGraph implements atomic operations. The code section can be found in the lgraph_atomic.cpp file under the lgraph folder.
+
+TuGraph also customizes 4 commonly used atomic operations. When we need to modify the data of vertices in multithreaded mode, we should use atomic operations to ensure the correctness of the modification operation in parallel environment. In addition to these four atomic operations, users can also use "cas" to build their own atomic operation functions.
+
+- `bool cas(T \* ptr, T oldv, T newv)` : If the value pointed to by ptr is equal to oldv, the value pointed to by ptr is assigned to newv and returns true. Otherwise, false is returned
+- `bool write_min(T \*a, T b)` : If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `bool write_max(T \*a, T b)` : If b is larger than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `void write_add(T \*a, T b)` : adds the value of b to the value pointed to by a.
+- `void write_sub(T \*a, T b)` : subtract the value of b from the value pointed to by a.
+
+## 4.Vertex Class ParallelBitset
+
+When using TuGraph for batch operations, you need to use a vertex set to represent the vertices you want to process. ParallelBitset implements a vertex collection class that represents vertices in bits and thus saves a significant amount of memory. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 4.1ParallelBitset Class
+
+- `size_t Size()`：Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size_t size)`：Initialize size and data, the length of data is (size >> 6)+1.
+- `void Clear()`：clears the collection.
+- `void Fill()`：add all vertices to the set.
+- `bool Has(size_t i)`：check if vertex i is in the set.
+- `bool Add(size_t i)`：add vertex i to the set.
+- `void Swap(ParallelBitset &other)`：exchange elements with another set of ParallelBitset.
+
+## 5.Vertex Array Class ParallelVector
+
+When using TuGraph for batch operations, you need to use an array of vertices to represent the result of processing vertices. ParallelVector implements the vertex array class. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 5.1.ParallelVector Class
+
+- `ParallelVector(size_t capacity)` Builds ParallelVector. capacity is the initial size of the vertex array
+- `T& operator[](size_t i)` : data with subscript i
+- `T \*begin()` : ParallelVector the starting pointer
+- `T \*end()` : ParallelVector the end pointer to Parallelvector. begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to access an array sequentially
+- `T&Back ()` : ParallelVector the last data
+- `T \*Data()` : represents the data in the array itself
+- `void Destroy()' : empty the ParallelVector array and delete the array
+- `size_t Size()` : indicates the number of data in ParallelVector
+- `size_t Capacity()` : indicates the capacity of ParallelVector
+- `void Resize(size_t size)` : Change ParallelVector to size, which must be greater than or equal to the size before the change
+- `void Clear()` : empty the data in ParallelVector
+- `void ReAlloc(size_t capacity)` : ParallelVector is allocated with new capacity. If data exists in the array, it is migrated to the new memory
+- `void Fill(T elem)` : Assign elem to all data on ParallelVector
+- `void Append(const T&elem, bool atomic = true)` : Add a piece of data at the end of ParallelVector
+- `void Swap(ParallelVector<t> &other)` : to exchange data with other parallelvectors</t>
+- `ParallelVector<t> Copy()` : copies the current ParallelVector data into the Copy array</t>
+
+## 6.Customize data structures
+
+### 6.1.Basic data types
+
+We customize the data structure representation of points and edges to save memory space while covering all vertices:
+
+- 'Empty' : indicates a special data type with empty content.
+
+### 6.2.Combining data structures
+
+In order to facilitate calculation, we define several data structures of point and edge data according to different calculation scenarios, which are as follows:
+
+- `EdgeUnit<edgedata>` : represents an edge of weight type EdgeData, used to parse the input file, and contains three member variables:</edgedata>
+- `size_t src` : the starting vertex of an edge
+- `size_t dst` : the end of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjUnit<edgedata>` : represents an edge of weight type EdgeData, used during batch computation, and contains two member variables:</edgedata>
+- `size_t neighbour` : indicates the neighbor vertex of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjList<edgedata>` : Adjacency list of vertices with weights of type EdgeData, often used to represent the set of incoming and outgoing edges of vertices and containing two member variables:</edgedata>
+- `AdjUnit<t> \* begin` : indicates the start pointer of the list</t>
+- `AdjUnit<t> \* end` : The end pointer of the list.</t> begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to loop through the adjacency list.
+
+## 7.Graph class OlapBase
+
+Graph class OlapBase is the main class for TuGraph to load graphs and calculate graphs. OlapBase is commonly used to represent graphs with weights of type EdgeData. See olap_base.hpp under lgraph folder for the code. This chapter covers the types and API interfaces commonly used in Graph classes. The classes used by the Procedure, Embed, and Standalone functions described above are all subclasses of this class.
+
+### 7.1.Basic Information
+
+- `size_t NumVertices()` : obtains the number of vertices
+
+- `size_t NumEdges()` : Gets the number of edges
+
+- `size_t OutDegree(size_t vid)` : indicates the outdegree of the vid of the vertex
+
+- `size_t InDegree(size_t vid)` : indicates the input degree of vertex vid
+
+### 7.2.node sets and edge sets and their related operations
+
+- `ParallelVector AllocVertexArray()` : Allocates an array of type VertexData with size as the number of vertices
+
+- `void fill_vertex_array(V \* array, V value)` : assigns values to all elements in the array
+
+- `ParallelBitset AllocVertexSubset()` : Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+
+- `AdjList OutEdges(size_t vid)'`: gets the set of all outgoing edges of vertex v
+
+- `AdjList InEdges(size_t vid)` : Obtains the set of all incoming edges of vertex v
+
+- `void Transpose()` : transpose of a directed graph
+
+- `LoadFromArray(char \* edge_array, VertexId input_vertices, EdgeId input_edges, EdgeDirectionPolicy (edge_direction_policy) `: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+`edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+`input_vertices`: specifies the number of vertices read into the graph by the array.
+
+`input_edges` : specifies the number of edges that the array reads into the image.
+
+`edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+### 7.3.Locking mechanism
+
+TuGraph implements a pair of locks to control the program's access to vertex data. Respectively is:
+
+- `void AcquireVertexLock(size_t vid)` : locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(size_t vid)` : unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+- `VertexLockGuard GuardVertexLock(size_t vid)` : When the vid operation is performed, the vertex vid is locked, and the lock is automatically released upon exiting the scope
+
+### 7.4.Batch Processing Operations
+
+TuGraph provides two batch operations to do a point-centered batch process in parallel. Respectively is:
+
+```c++
+/*
+    Function Name:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    The work function executes the work function on nodes whose numbers are between lower and upper in the Graph. The fourth parameter indicates the accumulated base, which defaults to 0.The fifth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+For details, please refer to include/lgraph/olap_base.h
+
+    Example: Count the number of vertices in the parent array that have outgoing edges
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+graph is the instantiated object of graph class OlapBase
+
+```C++
+/*
+    Function Name:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    Function: Execute the work function for the node that corresponds to 1 in active_vertices. The third parameter represents the cumulative cardinality, which is 0 by default.
+
+    The fourth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+
+    For specific implementation, please refer to the specific code in /include/lgraph/olap_base
+
+
+
+    Example: Output all the out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..6015d7e1ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,303 @@
+# OlapOnDB API
+
+> This document provides detailed instructions for using the OlapOnDB API
+
+## 1.Introduction
+
+Generally speaking, users need to implement the process of subgraph extraction by themselves. Then use the rich interface in TuGraph to implement your own graph analysis algorithm.
+
+This document mainly introduces the Procedure and Embed interface design, and introduces some common interface, specific interface information see include/lgraph/olap_on_db.h file.
+
+## 2.Schema
+
+Procedure and Embed auxiliary functions are mainly included in the OlapOnDB class, and some more frequently used functions will be introduced one by one
+
+OLAP is associated with the following common data structures in TuGraph:
+
+1. DB graph analysis class `OlapOnDB`
+
+2. Vertex array `ParallelVector`
+
+3. Vertex set `ParallelBitset`
+
+4. Side data structure `AdjUnit/AdjUnit`
+
+5. Edge collection data structure `AdjList`
+
+### 2.1.Snapshot Based Storage Structure
+
+The OlapOnDB class in TuGraph provides a data "snapshot," that is, a fully usable copy of a given data set that includes a mirror image of the corresponding data at a certain point in time (the point at which the copy was started). Because OLAP operations involve only reads and not writes, OlapOnDB arranges data in a more compact manner, saving space while improving data access locality.
+
+### 2.2.BSP Calculation Model
+
+TuGraph uses the BSP (Bulk Synchronous Parallel) model in the process of calculation, which makes the process can be executed in parallel, and greatly improves the efficiency of the program.
+
+The core idea of BSP calculation model is to propose and use Super Step. After OlapOnDB is created, the computation on this data is divided into multiple supersteps, such as PageRank, which is divided into multiple iterations, and each iteration is a Super Step. There is explicit synchronization between different Super Steps to ensure that all threads proceed to the next Super Step at the same time after completing the same superstep. Within a Super Step, all threads execute asynchronously, using parallelism to improve computational efficiency.
+
+BSP calculation model can effectively avoid deadlock, and achieve coarse-grained global synchronization in hardware mode by means of obstacle synchronization, so that graph computation can be executed in parallel, and programmers do not need to spend much time on synchronization mutual exclusion.
+
+## 3.Algorithm example
+
+Here is an explanation of the PageRank algorithm, which is mainly divided into the main function Process and the PageRank algorithm process function.
+
+### 3.1.Main function
+
+The main function has three input parameters, 'TuGraph' database parameter 'db', the request 'request' obtained from the web side, and the return value 'response' given to the web side. The overall process can be divided into the following steps:
+
+1. Obtain related parameters
+
+2. Create a snapshot class
+
+3. Main process of PageRank algorithm
+
+4. Obtain and send the return value of the web page
+
+```c
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+
+    // Obtain the number of iterations from web side requests (num_iterations)，
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // Read transaction creation and snapshot class creation
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+
+    // Create a pr array to store the pr value for each node
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank algorithm main process, obtain the pagerank value of each node
+    PageRankCore(olapondb, num_iterations, pr);
+
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        Function Purpose: Gets the number of the node with the largest pagerank among all nodes
+
+        Function flow description: This function executes Func A for node vi (also known as the active vertices) corresponding to all bits of 1 in the vertex set all_vertices. The return value of Func A is then used as the second input parameter of Func B to obtain the local maximum value (because the first input parameter is 0. So the return value is actually the pagerank value of each node). Finally, the return value of all threads is summarized, and Func B is executed again to get the global return value, and stored in the max_pr_vi variable
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+
+    // Retrieve and send the return value from the web page
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2.PageRank Algorithm process
+
+`pagerank` main process has two input parameters, snapshot class (subgraph) and iteration times, the overall process can be divided into the following steps:
+
+1. Initialization of related data structures
+2. Initialize the pagerank value of each node
+3. Calculation of pagerank value of each node, active vertices for all vertices (means that all vertices need to calculate pagerank value)
+4. Obtain the pagerank value after 'num_iterations' of each node
+
+```c
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+
+    // Initialization of related data structures
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // The initialization of the pagerank value of each node is inversely proportional to the degree of the node
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // Total iteration process
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            Function Purpose: Calculates the pagerank of all nodes
+
+            Function flow description: This function is used to calculate the pagerank value of all nodes. Execute Func C on node vi corresponding to all the bits of 1 in all_vertices to obtain the pagerank value of vi in the current iteration and return the pagerank change value of vi node. The total change value of all active nodes is finally summarized and returned through the internal processing of the function, which is stored in the delta variable
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // Gets the pagerank value of the current node from its neighbor
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank value calculation core formula
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+
+                    // Statistics of relevant intermediate variables
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // The pagerank value obtained in this iteration is output as the input of the next iteration
+        curr.Swap(next);
+    }
+}
+```
+
+### 4.1.Transaction creation
+
+```c
+// Create a read transaction
+auto txn = db.CreateReadTxn();
+
+// Write transaction creation
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2.Parallelization to create a directed graph
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3.Create undirected graphs in parallel
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED;
+)
+```
+
+### 4.4.Obtain the output degree
+
+```c
+size_t OutDegree(size_t vid)
+```
+
+### 4.5.Obtain the input degree
+
+```c
+size_t InDegree(size_t vid)
+```
+
+### 4.6.Gets the outgoing edge set
+
+```c
+/*
+    Function name: AdjList OutEdges(size_t vid)
+
+    Data structure:
+
+    An AdjList can be understood as an array of structures of type AdjUnit
+
+    AdjUnit has two member variables: 1. size_t neighbour 2. edge_data: neighbour indicates the number of the target node pointed by the outgoing edge. If the value is a licensed graph, the data type of edge_data is the same as the weight value of the edge in the input file
+
+    Example Output all outgoing neighbors of node vid
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7.Gets the incoming edge set
+
+```c
+AdjList<edgedata> InEdges(size_t vid)</edgedata>
+
+// Example: Outputs all inbound neighbors of node vid
+for (auto & edge : olapondb.InEdges(vid)) {
+size_t dst = edge.neighbour;
+printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8.Get the node ID of OlapOnDB corresponding to the node in TuGraph
+
+```c
+size_t OriginalVid(size_t vid)
+
+// Note: The node numbers entered in TuGraph can be non-numbers, such as names. When OlapOnDB subgraphs are generated, names and other names will be converted to numbers for subsequent processing. Therefore, this method may not be applicable to some specific scenarios
+```
+
+### 4.9.Gets the node number of TuGraph corresponding to a node in OlapOnDB
+
+```c
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10.Description of active vertices
+
+Active vertices refer to the vertices that need to be processed in the batch function. In this example, we simply output the number of active vertices and summarize the number of active vertices:
+
+```c
+ParallelBitset temp = 000111; // The current active vertices are vertices 3, 4 and 5
+
+size_t delta = ForEachActiveVertex<double>(</double>
+//void c
+[&](size_t vi) {
+printf("active_vertexId = %lu\n",vi);
+return 1;
+},
+all_vertices
+);
+```
+
+The result of this function is obvious. Because of multiple threads, the output order may vary:
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+The local return value is 1. This function will add all the local return values in a thread-safe manner to the final return value, which is stored in the delta variable, and the final value is 3
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..bb3c784f13
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,213 @@
+# OlapOnDisk API
+
+> This document mainly introduces the usage instructions of OlapOnDisk API in detail
+
+## Table of contents
+
+- [1. Introduction](#1introduction)
+- [2. Algorithm Example](#2algorithm-example)
+     - [2.1 header files](#21head-file)
+     - [2.2 Configuration class MyConfig](#22configuration-class-myconfig)
+     - [2.3 Main function](#23main-function)
+     - [2.4 bfs algorithm flow](#24bfs-algorithm-process)
+- [3. Function description of other commonly used functions](#3description-of-other-commonly-used-functions)
+     - [3.1 Image Loading](#31graph-load)
+     - [3.2 Image writing](#32graph-write)
+     - [3.3 Graph Analysis Function](#33graph-parse-function)
+    
+### 1.Introduction
+
+The Standalone mode of TuGraph can be used to load graph data files, where the sources of graph data files can include text files, BINARY_FILE binary files, and ODPS sources. In this mode, TuGraph can quickly load multiple data sources into a graph, and then run iterative algorithms such as BFS, WCC, SSSP, etc. on the graph, and output the final result to the terminal.
+
+In TuGraph, the export and calculation process can be accelerated through parallel processing in memory, so as to achieve near real-time processing and analysis. Compared with traditional methods, it avoids the overhead of data export and storage, and can use compact Graph data structures achieve desirable performance for computation.
+
+TuGraph has built-in a large number of common graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement the specific graph calculation process by themselves. They only need to include the header file (.h) of the corresponding algorithm library when implementing their own stored procedures. To your own program, and link your own dynamic library files in the compilation phase.
+
+This document mainly introduces the common interfaces of Standalone, and the auxiliary functions used are mainly contained in the OlapOnDB class. At the same time, in order to help users understand and facilitate, the BFS algorithm is illustrated with examples.
+
+### 2.Algorithm example
+
+Here, the BFS algorithm is explained in blocks, which are roughly divided into the main function `main`, the BFS algorithm process `BFSCore` function and the configuration class MyConfig.
+
+#### 2.1.Head file
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //Header files to include when using TuGraph
+#include "./algo.h"   //A header file containing various algorithmic logic functions
+```
+
+When using TuGraph to realize the calculation application of graph data files, generally, the StandaloneGraph class object graph is first created, the graph file data is loaded into the graph, and then the graph calculation process is realized by calling the graph logic function, and finally the result of the graph calculation is printed out.
+
+#### 2.2.Configuration class MyConfig
+
+The MyConfig configuration class function is used to provide the configuration information required for the algorithm logic calculation, inherited from ConfigBase<EdgeData>, where EdgeDate can choose Empty (unweighted graph), int (the weight of the weighted graph is an integer) or double (the weight of the weighted graph is double) type.
+
+The MyConfig configuration class generally depends on the algorithm, and additional configuration information is required as follows:
+
+1. Parameters required by the algorithm
+2. Algorithm name
+3. Configure the Print function in the class
+Other common members inherit from ConfigBase, please refer to src/olap/olap_config.h for reference.
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // The parameters required by the algorithm are initialized
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // The configuration file accepts command line parameters. This use case will sequentially read the parameters when calling the algorithm from the command line. The value specified by the user is preferred. If the user does not specify it, the default parameter is selected.
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+#### 2.3.main function
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // Statistical memory consumption class MemUsage instantiation
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // Configuration class MyConfig instantiation
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk class instantiation
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // Statistical graph loading time consumption
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // Create an array to count whether a node has been traversed
+    auto parent = graph.AllocVertexArray<size_t>();
+    // Breadth-first search algorithm, returns the number of nodes connected to the root_vid root node in the graph
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // Print relevant information to the terminal
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+#### 2.4.bfs algorithm process
+
+The main process of `bfs` has two input parameters, the snapshot class (subgraph) and the number of iterations. The overall process can be divided into the following steps:
+
+1. Relevant definitions and initialization of data structures
+2. Use the batch function to perform cyclic calculations on each node, find all nodes adjacent to the current node in each round, and exchange them when the round ends.
+3. Until all nodes are found, return the number of nodes discovered_vertices.
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //Allocate an array, active_in is used to store the nodes found in the previous cycle stage
+  active_in.Add(root);            //Add the root node to the array
+  auto active_out = graph.AllocVertexSubset();  //Allocate the array active_out to store the nodes found in the current cycle stage
+  parent.Fill((size_t)-1);               //Assign a value of -1 to the node in the parent array, -1 means not found
+  parent[root] = root;
+  size_t num_activations = 1;       //Indicates the number of nodes found in the current loop phase
+  size_t discovered_vertices = 0;    //Indicates the total number of nodes found in the current cycle phase
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations indicates the number of nodes found in the current loop phase
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices indicates the total number of nodes found in the current cycle phase
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //Each cycle starts from the root node, finds adjacent adjacent nodes, changes its parent value, and operates num_activations+1
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //Store the nodes found in the current loop phase
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // return all nodes
+  return discovered_vertices;
+}
+```
+
+### 3.Description of other commonly used functions
+
+#### 3.1.Graph load
+
+TuGraph-StandaloneThe loading sources of graph data files are mainly divided into three categories: text files, binary files, and ODPS. The binary file is a file in which the binary representation of the edge data is arranged in order, which can save a lot of storage space. Its loading function is divided into three types, namely:
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：The loading method of the graph data file contains two parameters, and their meanings represent respectively
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `edge_direction_policy`：Specifies whether the graph is directed or undirected, including three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. Among them, DUAL_DIRECTION is the default graph loading method.
+  DUAL_DIRECTION : The input file is an asymmetric graph and the loaded graph is an asymmetric graph.
+  MAKE_SYMMETRIC : The input file is an asymmetric graph and the loaded graph is a symmetric graph.
+  INPUT_SYMMETRIC : The input file is a symmetric graph and the loaded graph is a symmetric graph.
+  For details, see `enum EdgeDirectionPolicy` in the olap_config.h file under the lgraph folder.
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：Load the vertices in the file into an array in the order of their ids. The meanings of each parameter are:
+  - `array`：array of data to be read
+  - `path`：The path to read the file, each line in the file represents a pair of vertex
+  - `parse_line`：A user-defined function that tells the system how to parse a line of text data into a vertex pair.
+
+
+#### 3.2.Graph write
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：Write the data in the array back to the file, and the meanings of each parameter are:
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `array`：array of data to be written
+  - `array_size`：The length of the number of data to be written
+  - `name`：algorithm name
+  - `filter_output`：Write data rule function, the data to be written needs to meet the requirements of this function.
+
+#### 3.3.graph parse function
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：Parse the graph data file, and load the graph as an unweighted graph.
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：Parse the graph data file, load the graph as a weighted graph, and specify the weight data type by modifying <EdgeData>.
+
+This function can be specified through the constructor parse_line when the MyConfig class is defined.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..9417b31135
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,423 @@
+# Python Olap API
+
+> This document mainly introduces the API usage of OlapBase OlapOnDB and OlapOnDisk in Python
+
+## Table of contents
+- [1.Overview](#1-overview)
+- [2.Configuration Requirements](#2-configuration-requirements)
+- [3.Cython](#3-cython)
+- [4.Olap API](#4-olap-api)
+    - [4.1. Atomic operations](#atomic-operations)
+    - [4.2. Vertex collection class ParallelBitset](#vertex-collection-class-parallelbitset)
+    - [4.3. Vertex array class ParallelVector](#vertex-array-class-parallelvector)
+    - [4.4. Custom data structure](#custom-data-structure)
+    - [4.5.Graph class OlapBase](#graph-class-olapbase)
+    - [4.6. Graph Class OlapOnDB](#graph-class-olapondb)
+    - [4.7.Graph class OlapOnDisk](#graph-class-olapondisk)
+- [5.lgraph DB API](#5-lgraph_db-api)
+- [6.Algorithm plugin example](#6-algorithm-plug-in-example)
+
+## 1 Overview
+
+This manual will introduce the simple configuration required to use the Python interface of the TuGraph graph computing system, and explain the TuGraph Python API in conjunction with the code. For details about the functions of class ParallelBitset, OlapBase, etc., see olap-base-api.md, olap-on-db-api.md and olap-on-disk-api.md.
+
+## 2. Configuration requirements
+
+If you want to use TuGraph to write and compile your own applications, the required configuration requirements are:
+
+- Linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+- A compiler that supports C++17 requires GCC version 5.4.1 or later.
+- Cython, version 3.0a1 or above is required, and the tested version is 3.0.0a11
+
+## 3. Cython
+Cython is an efficient programming language that is a superset of Python. Cython can translate .py files into C/C++ codes and compile them into Python extension modules, which can be called through import in Python. In TuGraph, all Python procedures are compiled into Python extension modules by Cython and then used.
+
+The main advantage of using Cython is that it combines the simplicity and ease of use of Python with the performance of C/C++. The TuGraph Python interface is implemented using Cython.
+
+[Cython Documentation](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+The Olap API is used for graph computing and is implemented in C++. The usage and functions are basically the same as the C++ interface. To use the API in a Python file, the interfaces declared in procedures/algo_cython/olap_base.pxd must be imported using `cython.cimports.olap_base import *`. The Python file can only be run after being compiled by Cython.
+
+### Atomic operations
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`: If the value pointed to by ptr is equal to oldv, assign the value pointed to by ptr to newv and return True, otherwise return False.
+- `write_min[T](a: cython.pointer(T), b: T)->cython.bint`: If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_max[T](a: cython.pointer(T), b: T)->cython.bint`: If b is greater than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_add[T](a: cython.pointer(T), b: T)->cython.bint`: Add the value of b to the value pointed to by a.
+- `write_sub[T](a: cython.pointer(T), b: T)->cython.bint`: Subtract the value pointed to by a from the value of b.
+
+### Vertex collection class ParallelBitset
+- `Size() -> size_t`: Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size: size_t)`: Initializes size and data, where the length of data is (size >> 6) + 1.
+- `Clear() -> cython.void`: Empties the collection.
+- `Fill() -> cython.void`: Adds all vertices to the set.
+- `Has(i: size_t) -> cython.bint`: Checks if vertex i is in the set.
+- `Add(i: size_t) -> cython.bint`: Adds vertex i to the set.
+- `Swap(other: ParallelBitset) -> cython.void`: Exchanges elements with another ParallelBitset set.
+
+### Vertex array class ParallelVector
+- `ParallelVector[T](size_t capacity)`: Constructs a ParallelVector, where capacity is the initial capacity of the vertex array.
+- `operator[](i: size_t) -> T`: Returns the data at index i.
+- `begin() -> cython.pointer(T)`: Returns the start pointer of ParallelVector.
+- `end() -> cython.pointer(T)`: Returns the end pointer of ParallelVector. The usage of begin() and end() is similar to the begin and end pointers of the vector container, and these two pointers can be used to sequentially access the array.
+- `Back() -> T`: Returns the last data of ParallelVector.
+- `Data() -> cython.pointer(T)`: Indicates the data of the array itself.
+- `Destroy() -> cython.void`: Clears the data in the ParallelVector array and deletes the array.
+- `Size() -> size_t`: Indicates the number of data in ParallelVector.
+- `Resize(size: size_t) -> cython.void`: Changes ParallelVector to size, which should be greater than or equal to the size before the change and less than capacity.
+- `Clear() -> cython.void`: Clears the data in ParallelVector.
+- `ReAlloc(capacity: size_t) -> cython.void`: Allocates a new capacity size to ParallelVector. If the array has data, it migrates the data to the new memory.
+- `Fill(elem: T) -> cython.void`: Assigns elem to all data of ParallelVector.
+- `Append(elem: T, atomic: cython.bint = true) -> cython.void`: Adds a data to the end of ParallelVector.
+- `Swap(other: ParallelVector[T]) -> cython.void`: Exchanges data with another ParallelVector.
+- `Copy() -> ParallelVector[T]`: Copies the current ParallelVector data and stores it in the copy array.
+
+
+### Custom Data Structure
+- `Empty`: A special data type whose content is empty.
+- `EdgeUnit[EdgeData]`: Indicates the edge whose weight type is EdgeData, used to parse the input file, including three member variables:
+    - `src: size_t`: starting vertex of the edge
+    - `dst: size_t`: end of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjUnit[EdgeData]`: indicates the edge whose weight type is EdgeData, which is used in the batch calculation process and contains two member variables:
+    - `neighbor: size_t`: neighbor vertex of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjList[EdgeData]`: The adjacency list of vertices whose weight type is EdgeData, often used to represent the set of incoming and outgoing edges of vertices, including three member functions:
+    - `begin()->cython.pointer(AdjUnit[T])`: the starting pointer of the list
+    - `end()->cython.pointer(AdjUnit[T])`: the end pointer of the list
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: the data whose subscript is i
+
+### Graph class OlapBase
+- `NumVertices()->size_t`: get the number of vertices
+- `NumEdges()-> size_t`: get the number of edges
+- `OutDegree(vid: size_t)-> size_t`: out-degree of vertex vid
+- `InDegree(vid: size_t)->size_t`: in-degree of the vertex vid
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`: Allocates an array of type VertexData with size as the number of vertices
+- `AllocVertexSubset()-> ParallelBitset`: Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all outgoing edges of vertex v
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all incoming edges of vertex v
+- `Transpose()->cython.void`: transpose of a directed graph
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+    - `edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+    - `input_vertices`: specifies the number of vertices read into the graph by the array.
+
+    - `input_edges` : specifies the number of edges that the array reads into the image.
+
+    - `edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`: locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`: unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+
+TuGraph provides two batch operations to perform point-centric batch processing in parallel, which is slightly different from C++ in Python.
+
+```python
+# Function name: ProcessVertexInRange[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# lower: size_t, upper: size_t,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Executes the work function on nodes whose node numbers are between lower and upper in the Graph. The fourth parameter indicates the base of accumulation, which is 0 by default.
+# The fifth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in include/lgraph/olap_base.h
+#
+# Example usage: Count the number of vertices with edges in the parent array.
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython.pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+g is the instantiated object of graph class OlapBase
+
+```python
+# Function name: ProcessVertexActive[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# active: ParallelBitset,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Execute the work function on the nodes corresponding to 1 in the active_vertices bitset. The third parameter indicates the base of accumulation, which is 0 by default;
+# The fourth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in /include/lgraph/olap_base.h
+#
+# Usage example: Output all out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes.
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self. graph. OutDegree(vi)
+        dst: size_t
+        edges = self. graph. OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbor
+            printf("node %lu has neighbor %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+As shown in the above two examples, ProcessVertexActive and ProcessVertexInRange in Python require an additional algorithm class pointer parameter compared to their C++ counterparts. The Work function is generally used as a member function of the algorithm class to access member variables, such as in the graph and ParallelVector parent examples shown above. When calling the batch function, the Work function and the self pointer of the algorithm class are passed to the batch function.
+
+The Work function will be called in multiple threads, so the @cython.nogil decorator is added to release the Python global interpretation lock. In code executed by multiple threads, such as the Work function in the batch function, variables are better declared as C/C++ types using `dst: type` or `dst = cython.declare(type)`. This is because Python objects cannot be used in multi-threaded code.
+
+### Graph class OlapOnDB:
+Parallelize to create a directed graph:
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+Parallelize to create an undirected graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING creates a directed graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### Graph class OlapOnDisk
+
+#### ConfigBase:
+- `ConfigBase()`: Constructor
+- `std::string input_dir`: graph edge table data path
+- `std::string output_dir`: output path
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: read in graph data
+
+## 5. lgraph_db API
+Please refer to the files procedures/algo_cython/lgraph_db.pxd and lgraph_db_python.py for the lgraph_db API.
+
+The usage and functions of the interface in lgraph_db.pxd are basically the same as the C++ interface. The interface declared in lgraph_db.pxd is implemented in C++. In the py file, it must be imported by `cython.cimports.olap_db import *` and compiled by the Cython file to run.
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: Get the vid of the vertex
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: constructor, dir_path is the db path
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: set user
+- `SetUser(user: std::string)-> cython.void`: set user
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: create GraphDB
+
+### GraphDB:
+- `CreateReadTxn()-> Transaction`: create a read-only transaction
+- `CreateWriteTxn()-> Transaction`: create a write transaction
+- `ForkTxn(txn: Transaction)-> Transaction`: Copy transactions, only read transactions can be copied
+
+### Transaction:
+```
+GetVertexIndexIterator(
+                 label: std::string,
+                 field: std::string,
+                 key_start: std::string,
+                 key_end: std::string) -> VertexIndexIterator
+```
+Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v
+
+
+
+lgraph_db_python.py packages the C++ classes Galaxy and GraphDB from lgraph_db.pxd as Python classes. After compiling lgraph_db_python.py into a Python extension, you can directly access it in a Python file or from the Python command line by importing it with `import lgraph_db_python`.
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: constructor, dir_path is the db path
+- `SetCurrentUser(self, user: str password: str)-> void`: set user
+- `SetUser(self, user: std::string)-> void`: set user
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: create PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)->cython.Py_ssize_t`: address of C++ class GraphDB
+
+## 6. Algorithm plug-in example
+The following is a code example of the BFS algorithm implemented in Python:
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# Comments work as follows:
+# language_level=3: use Python3
+# cpp_locals=True: C++17 is required, and std::optional is used to manage C++ objects in Python code, which can avoid copy construction of C++ objects
+# boundscheck=False: Turn off bounds checking for indexes
+# wraparound=False: Turn off the processing of negative subscripts (similar to Python List)
+# initializedcheck=False: Turn off checking whether the memory is initialized, and the running performance will be faster after turning off the check
+# language = c++: translate this .py file to C++ instead of C file. TuGraph uses a lot of template functions, so C++ should be used
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# From procedures/algo_cython/ cimportolap_base.pxd and lgraph_db.pxd, similar to #include "xxx.h" in C++
+
+from cython.cimports.libc.stdio import printf
+# Similar to #include <stdio.h> in C++
+# Other common ones include cython.cimports.libcpp.unordered_map, etc.
+
+import time
+
+@cython.cclass
+# cython.cclass indicates that BFSCore is a C-type Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty]) indicates the pointer of OlapBase[Empty], similar to OlapBase[Empty]* in C++
+    # Cython provides common types of pointers, such as cython.p_int, cython.p_char, etc.
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t declares root as a C++ size_t type variable, equivalent to root = cython.declare(size_t)
+    # Variables that do not declare a type are Python object types
+    # Declaring variable types will greatly improve performance, and in the multi-threaded part, only C/C++ type variables can be accessed
+
+    @cython.cfunc
+    # cython.cfunc indicates that Work is a C-type function, and the parameters and return values should be declared
+    # cfunc has good performance and can accept C/C++ objects as parameters and return values, but it cannot be called in other python files
+    # Similar to cython.ccall, such as Standalone function, which can be called in other python files
+    @cython.nogil
+    # cython.nogil means to release the Python global interpretation lock. In the part modified by nogil, Python objects cannot be accessed
+    # In the multi-threaded part, there should be nogil decorator
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) means that exception propagation is disabled, and Python exceptions raised inside the function will be ignored
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbor
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 means that dst has not been visited by bfs
+                if self.active_out.Add(dst):
+                    # Set dst as an active node; ParallelBitmap.Add is an atomic operation to prevent double calculation
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython. size_t:
+        self. graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self. parent. Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self. active_in. Add(self. root)
+        while num_activations > 0:
+            self. active_out. Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self. active_out. Swap(self. active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time. time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # Create OlapOnDB in parallel
+    # Cython does not support dereference operations such as *db, use db[0] to dereference
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # Get the iterator of the root node through GetVertexIndexIterator based on the root node label name, field name and field value (root_id),
+    # and get the vid through the iterator. When there is no ID_MAPPING, the vid is the same as the id in OlapOnDB
+    cost = time. time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time. time()
+    count = a. run(cython. address(olapondb), root_vid)
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb. NumVertices()
+    response["num_edges"] = olapondb. NumEdges()
+    return True
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process is the plug-in entry in embed mode and procedure mode, modified with cython.ccall
+    # The Process function must be named Process, and the parameters are lgraph_db_python.PyGraphDB and bytes
+    # The return value must be (bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # Get the address of the GraphDB object in the PyGraphDB, convert it to a pointer and pass it
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..e496945495
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,191 @@
+# TuGraph Built-in Algorithm Description
+
+> This document mainly introduces the TuGraph built-in algorithm program in detail, the community version of 6 algorithms can refer to the basic algorithm newspaper
+
+## 1.Introduction
+
+TuGraph currently contains the following 6 basic algorithms and 28 extended algorithms, a total of 34 graph algorithms:
+
+### 1.1.Basic algorithms:
+
+|    Algorithm name            | The program name |
+| :--------------------------: | :--------------: |
+|     Breadth-First Search     |       bfs        |
+|           Pagerank           |     pagerank     |
+| Single-Source Shortest Path  |       sssp       |
+| Weakly Connected Components  |       wcc        |
+| Local Clustering Coefficient |       lcc        |
+| Label Propagation Algorithm  |       lpa        |
+
+### 1.2.Extended algorithms:
+
+|            Algorithm name                    |   The program name   |
+| :------------------------------------------: | :------------------: |
+|            All-Pair Shortest Path            |         apsp         |
+|            Betweenness Centrality            |          bc          |
+|              Belief Propagation              |          bp          |
+|             Closeness Centrality             |          clce        |
+|             Common Neighborhood              |          cn          |
+|              Degree Correlation              |          dc          |
+|             Dimension Estimation             |          de          |
+|                    EgoNet                    |          en          |
+|        Hyperlink-Induced Topic Search        |         hits         |
+|                Jaccard Index                 |          ji          |
+|                    K-core                    |        kcore         |
+|                   Louvain                    |       louvain        |
+|        Multiple-source Shortest Paths        |         mssp         |
+|            Personalized PageRank             |         ppr          |
+|        Strongly Connected Components         |         scc          |
+| Speaker-listener Label Propagation Algorithm |         slpa         |
+|          Single-Pair Shortest Path           |         spsp         |
+|              Triangle Counting               |       triangle       |
+|                  Trustrank                   |      trustrank       |
+|     Weighted Label Propagation Algorithm     |         wlpa         |
+|         Weighted Pagerank Algorithm          |      wpagerank       |
+|           Maximal independent set            |         mis          |
+|                  Sybil Rank                  |      sybilrank       |
+|             Subgraph Isomorphism             | subgraph_isomorphism |
+|                    Motif                     |        motif         |
+|                   Kcliques                   |       kcliques       |
+|                    Ktruss                    |        ktruss        |
+|                    Leiden                    |        leiden        |
+
+## 2.Basic algorithms
+
+### 2.1.Breadth-First Search
+
+Breadth first Search implements the Breadth-first Search algorithm, which starts from the root vertex and traverses all accessible vertices along the width of the graph. Returns the number of vertices traversed. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 2.2.Pagerank
+
+Web page sorting program to achieve the commonly used Pagerank algorithm. The algorithm calculates the importance ranking of all vertices according to the edge and edge weight in the graph. The higher the PageRank value, the higher the importance of the vertex in the graph. The reciprocal of the number of vertices is used as the initial Rank value of each vertex, and then the Rank value of the vertices is transferred to the adjacent vertices on average according to the outgoing edges, and the transfer process is repeated until the given convergence threshold is met or the given number of iterations is reached. At the end of each pass round, a certain proportion of the Rank values of all vertices will be randomly transferred to any vertex. Please refer to the algorithm content [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 2.3.Single-Source Shortest Path
+
+The Single Source Shortest Path algorithm realizes the Single Source Shortest Path algorithm. It calculates the shortest path length from a given source vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 2.4.Weakly Connected Components
+
+The program of Weakly Connected Components has implemented the algorithm. It can calculate all the weakly connected components in the graph. A weakly connected component is a subgraph of a graph in which reachable paths exist between any two points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Connected*component*(graph_theory)](<https://en.wikipedia.org/wiki/Connected_component_(graph_theory)> "scc wiki")。
+
+### 2.5.Local Clustering Coefficient
+
+The average Clustering Coefficient program implements the Local Clustering Coefficient algorithm to calculate the coefficient of the degree of clustering between vertices in the graph. The returned results include the overall clustering coefficient and the vertex clustering coefficient. The overall agglomeration coefficient reflects the evaluation of the overall agglomeration degree in the graph, and the vertex agglomeration coefficient includes the agglomeration coefficient of any vertex, which reflects the agglomeration degree near the vertex. The higher the agglomeration coefficient, the higher the agglomeration degree. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 2.6.Label Propagation Algorithm
+
+The program implements Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and computes unauthorised graphs. In label passing, each vertex adds up all the labels received, and randomly selects one of the labels with the highest sum. The iteration converges or the algorithm terminates after a given number of rounds. The final output is a label for each vertex, and vertices with the same label value are considered to be in the same community. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+## 3.Extended algorithms
+
+### 3.1.All-Pair Shortest Path
+
+The All-Pair Shortest Path program realizes the all-pair Shortest Path algorithm and calculates the shortest path between any two points in the graph. Returns the shortest path length between any pair of vertices where the path exists. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 3.2.Betweenness Centrality
+
+Betweenness Centrality algorithm is implemented in Betweenness centrality program to estimate the betweenness centrality value of all vertices in a graph. The value of intermediate centrality reflects the possibility that any shortest path in the graph passes through the vertex, and the higher the value, the more shortest paths pass through the vertex. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 3.3.Belief Propagation
+
+The Belief Propagation algorithm is implemented in the confidence propagation program. Given the edge distribution of the observed vertices, the algorithm estimates the edge distribution of the unobserved vertices by using the mechanism of passing messages among vertices. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 3.4.Closeness Centrality
+
+The Distance Centrality program implements the Closeness Centrality algorithm, which estimates the average shortest path length from any node to other nodes in the graph. A smaller distance centrality value indicates that the node has a smaller average shortest distance to other nodes, meaning it is more centrally located in the graph from a geometric perspective. The calculation requires specifying the number of sampling points, and the algorithm computes the centrality values for each of these sampling points. For the algorithm content, please refer to [https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki").
+
+### 3.5.Common Neighborhood
+
+The Common Neighborhood program implements the common Neighborhood algorithm to count the number of common neighbors between any given pair of neighboring vertices. Given several pairs of vertices to be queried, the result is the number of common neighbors of any pair of vertices to be queried.
+
+### 3.6.Degree Correlation
+
+The Degree Correlation algorithm is implemented in the degree correlation program. It calculates the degree correlation degree of a graph by calculating the Pearson correlation coefficient between any adjacent vertex pairs, which can be used to characterize the correlation degree between high-degree vertices in the graph. A higher degree of correlation indicates a higher degree of correlation between vertices of higher degree in the graph. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 3.7.Dimension Estimation
+
+The diameter Estimation program implements the Dimension Estimation algorithm. The algorithm calculates the length of the longest shortest path in the graph, which is used to characterize the diameter of the graph. Please refer to the algorithm content[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### 3.8.EgoNet
+
+The EgoNet algorithm requires a given root vertex and K value, and takes the root vertex as the source vertex to conduct a width-first search to find the subgraph composed of all neighbors within K degrees. The found subgraph is called the EgoNet of the root vertex.
+
+### 3.9.Hyperlink-Induced Topic Search
+
+The Hyperlink Topic Search algorithm implements the Hyperlink-induced topic search algorithm, which assumes that each vertex has two attributes: Authority and Hub. A good hub vertex should point to many vertices with high authority. And a good authority vertex should be pointed to by many vertices of high pivot type. The algorithm returns the authority value and the hub value for each vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 3.10.Jaccard Index
+
+The Jaccard coefficient program implements the Jaccard Index algorithm. The algorithm calculates the Jaccard coefficient between a given pair of vertices, which can be used to represent the similarity of the two vertices. A higher Jaccard coefficient indicates a higher degree of similarity between pairs of vertices. Given several pairs of vertices with the query, the Jaccard coefficients of these pairs are returned. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### 3.11.K-core
+
+k accounting method implements k-core algorithm. The algorithm computes the number of kernels of all vertices, or finds all K-nucleon graphs in the graph. K-nucleon graph is a special subgraph in which the degree of any vertex is not less than a given K value. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Degeneracy\_(graph_theory)](<https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)> "kcore wiki")。
+
+### 3.12.Louvain
+
+The Louvain community discovery program implements the Fast-unfolding algorithm. The algorithm is a community discovery algorithm based on modularity. It maximizes the modularity of the graph by constantly merging vertex communities, and can discover the hierarchical community structure. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 3.13.Multiple-source Shortest Paths
+
+The multisource Shortest Paths program implements the multiple-source Shortest Paths algorithm to calculate the shortest path value to any vertex from the given Multiple source vertices. Where, the shortest path value of multiple source vertices to a vertex is the minimum value of the shortest path from each source vertex to the vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 3.14.Personalized PageRank
+
+Personalized web ranking program has Personalized PageRank algorithm. According to the given source vertex, the algorithm calculates the importance ranking of all vertices to the source vertex based on the source vertex. The higher the Rank value, the more important the vertex is to the source vertex. Unlike PageRank, the source vertex Rank value is 1, the rest of the vertex Rank value is 0; And a certain proportion of Rank value will be immediately transferred back to the source vertex after each round of transmission. Please refer to the algorithm content [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 3.15.Strongly Connected Components
+
+Strongly Connected component program realizes the Strongly Connected Components algorithm. The algorithm computes all strongly connected components of the graph, which is a subgraph of the graph that can start from any vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 3.16.Speaker-listener Label Propagation Algorithm
+
+The program realizes the Speaker-listener Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and historical tag record, which is an extension of tag propagation algorithm. Different from the label propagation algorithm, this algorithm records the historical labels of all vertices. When the labels are accumulated in the iteration, the historical labels are also counted. The final output is all the historical label records for each vertex. Please refer to the paper for the algorithm content:“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 3.17.Single-Pair Shortest Path
+
+The program of the shortest path between two points implements the Bidirectional point-first Search algorithm. It searches forward width First along the outgoing edge from the starting point and reverse width first along the incoming edge from the end point on the directed undirected graph. The shortest path length from the starting point to the ending point is determined by traversing the vertices of the starting point and the ending point together. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 3.18.Triangle Counting
+
+The Triangle-counting algorithm is implemented to calculate the number of triangles in an undirected graph, which can be used to characterize the correlation degree of the vertices in the graph. The higher the number of triangles, the higher the degree of correlation of the vertices in the graph. For the algorithm content, please refer to the paper, "Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study".
+
+### 3.19.Trustrank
+
+The Trust Index Sorting Algorithm implements the Trustrank algorithm, which can calculate the Trust Index of any vertex based on a given whitelist. The higher the trust score, the less likely the vertex is to be illegal. Please refer to the algorithm content for details. [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 3.20.Weighted Label Propagation Algorithm
+
+Weighted Label Propagation Algorithm is implemented in the program. = Different from the label propagation algorithm, the label transmission is related to the weight of the edge. During label transmission, the weight of each vertex will be accumulated according to the incoming edge of the label, and the label with the highest sum will be randomly selected. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 3.21.Weighted Pagerank Algorithm
+
+Weighted Pagerank is implemented in the weighted Pagerank algorithm. Different from PageRank algorithm, the transfer of Rank value is related to the weight of the edge. The Rank value of the vertex will be transferred to the adjacent vertices according to the weight of the edge. Please refer to the algorithm content[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 3.22.Maximal independent set
+
+Maximal independent set algorithm implements Maximal Independent Set algorithm. A maximum independent set means that there are no vertices outside the independent set that can join it. A graph may have many MIS that vary greatly in size, and the algorithm finds one of them. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### 3.23.Sybil Rank
+
+Sybil detection algorithm implements Sybil Rank algorithm. The SybilRank algorithm starts from non-Sybil nodes and performs a random walk with premature termination. Please refer to the paper for the algorithm content:“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 3.24.Subgraph Isomorphism
+
+The subgraph matching algorithm implements the subgraph_isomorphism algorithm. The subgraph_isomorphism algorithm matches all nodes in the whole graph and outputs the number of times each node is matched. Algorithm Content Reference [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 3.25.Motif
+
+Pattern matching algorithm implements motif algorithm. motif algorithm matches k-order subgraphs for the specified nodes, and finally outputs the number of each kind of K-order subgraphs for each specified node. Each K-order subgraph is represented by a 64-bit integer, and the $i \times k + j$bit is 1, indicating that there is an edge i->j in the subgraph. Algorithm Content Reference [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### 3.26.Kcliques
+
+The K-order clique counting algorithm implements the k-cliques algorithm. The k-cliques algorithm calculates the number of all K-order complete subgraphs in the graph, and finally outputs the number of k-order complete subgraphs of each node. Algorithm Content Reference [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### 3.27.Ktruss
+
+The k-order truss counting algorithm implements the k-truss algorithm. A k-truss is a subgraph in which each edge is the edge of at least k-2 triangles. The k-truss algorithm finds out the k-truss subgraph of the graph, and finally outputs the neighbor node list of each node in the subgraph. Algorithm Content Reference[https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+
+### 3.28.Leiden
+
+Leiden algorithm implements Leiden's algorithm. leiden algorithm is a community discovery algorithm based on modularity. Compared with louvain algorithm, leiden algorithm has the advantage that Leiden algorithm detects the broken links in the community to ensure that each community has good connectivity. Algorithm Content Reference [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..dc955b3b91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..689128d8a0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,100 @@
+# Learning Tutorial
+
+> This document is designed as a guide for TuGraph users. Before reading the detailed documentation, users should first read this document to have a general understanding of the graph learning process of TuGraph, which will make it easier to read the detailed documentation later. The guide program is based on a simple program instance of TuGraph, and we will focus on its usage.
+
+## 1. Introduction to TuGraph Graph Learning Module
+Graph learning is a machine learning method that utilizes the topological information of a graph structure to analyze and model data. Unlike traditional machine learning methods, graph learning uses graph structures where vertices represent entities in data and edges represent relationships between entities. By extracting features and patterns from these vertices and edges, deep associations and patterns can be revealed in data that can be used in various practical applications.
+
+The TuGraph Graph Learning Module is a graph learning module based on a graph database that provides four sampling operators: Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. These operators can be used to sample vertices and edges in a graph to generate training data. The sampling process is performed in a parallel computing environment, providing high efficiency and scalability.
+
+After sampling, the obtained training data can be used to train a model that can be used for various graph learning tasks such as prediction and classification. Through training, the model can learn the relationships between vertices and edges in the graph, allowing for prediction and classification of new vertices and edges. In practical applications, this module can be used to handle large-scale graph data such as social networks, recommendation systems, and bioinformatics.
+
+## 2. Run Process
+The TuGraph graph learning module samples graph data in TuGraph, and the sampled vertices and edges are used as graph learning features for learning and training. The operation process is shown in the figure below:
+
+![Alt text](../../../../images/learn_flow_chart_en.png)
+
+## 3. TuGraph compilation and data preparation
+For TuGraph compilation, please refer to: [Compile](../../5.installation&running/6.compile.md)
+Execute in the build/output directory:
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+This command copies the relevant files of the dataset to the build/output directory.
+
+## 4. Data Import
+Please refer to [Data Import](../../6.utility-tools/1.data-import.md) for data import.
+
+Taking the cora dataset as an example for the import process:
+
+Execute in the build/output directory:
+
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Where cora.conf is the graph schema file representing the format of the graph data. coradb is the imported graph data file name representing the storage location of the graph data.
+
+## 5. Feature Conversion
+Since the features in graph learning are generally represented as long float arrays, TuGraph does not support loading float array types, so they can be imported as string types and converted to char* for subsequent storage and access, and the implementation details can refer to the feature_float.cpp file.
+
+The specific execution process is as follows:
+
+Compile the imported plugin in the build directory.（Skip if TuGraph has been compiled）:
+
+`make feature_float_embed`
+
+Execute in the build/output directory:
+
+`./algo/feature_float_embed ./coradb`
+
+Then the conversion can be performed.
+
+## 6. Sampling Operators and Compilation
+TuGraph implements an operator for obtaining the full graph data and four sampling operators at the cython layer, as follows:
+
+### 6.1.Sampling Operator Introduction
+|Sampling Operator | Sampling Method |
+| --- | --- |
+|GetDB | Get the graph data from the database and convert it into the required data structure |
+|Neighbor Sampling | Sample the neighboring nodes of the given node to obtain the sampling subgraph |
+|Edge Sampling | Sample the edges in the graph according to the sampling rate to obtain the sampling subgraph |
+|Random Walk Sampling | Conduct a random walk based on the given node to obtain the sampling subgraph |
+|Negative Sampling | Generate a subgraph of non-existent edges|
+
+### 6.2.Compilation
+Skip if TuGraph has been compiled.
+Execute in the tugraph-db/build folder:
+
+`make -j2`
+
+Or execute in the tugraph-db/learn/procedures folder:
+
+`python3 setup.py build_ext -i`
+
+Once the algorithm so is obtained, it can be used by importing it in Python.
+
+## 7. Model Training and Storage
+TuGraph calls the cython layer operator at the Python layer to implement graph learning and training.
+
+The usage of the TuGraph graph learning module is as follows:
+
+Execute in the build/output folder:
+
+`python3 train_full_cora.py --model_save_path ./cora_model`
+
+Then training can be performed.
+
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+## 8. Model Loading
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+Before using a saved model, it is necessary to load it first. In the code above, the trained model is loaded using the provided code.
+
+After loading the model, we can use it to make predictions and classifications for new vertices and edges. For prediction, we can input one or multiple vertices and the model will output corresponding prediction results. For classification, we can input the whole graph, and the model will classify the vertices and edges in the graph to achieve the task goal.
+
+Using a trained model can save time and resources compared to retraining the model. Additionally, since the model has already learned the relationships between vertices and edges in the graph, it can adapt well to new data and improve the accuracy of predictions and classifications.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..c649fa50e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,102 @@
+# Sampling API
+
+>This document provides a detailed guide on using the Sampling API of TuGraph.
+
+## 1. Overview
+This manual introduces the Sampling API using TuGraph.
+
+## 2. Graph Data Instantiation
+Before the sampling operation, load the graph data according to the graph data path, and map it into the olapondb graph analysis class, the code is as follows:
+
+```python
+galaxy = PyGalaxy(args.db_path) # Create a galaxy instance based on the path
+galaxy.SetCurrentUser(args.username, args.password) # Set the current user
+db = galaxy.OpenGraph('default', False) # Open the graph database specified by db
+txn = db.CreateReadTxn() # Create a transaction instance
+olapondb = PyOlapOnDB('Empty', db, txn) # Instantiate OlapOnDB based on the graph loading method, graph database instance, and transaction instance
+del txn
+del db
+del galaxy
+```
+## 3. Introduction to Sampling Operators
+The graph sampling operator is implemented in the cython layer and is used to sample the input graph. The generated NodeInfo is used to save point information such as feature attributes and label attributes, and EdgeInfo is used to save edge information. These metadata information can be used for features Extraction, network embedding and other tasks. Currently, the TuGraph graph learning module supports five sampling operators: GetDB, NeighborSampling, EdgeSampling, RandomWalkSampling, and NegativeSampling.
+
+### 3.1.RandomWalk Operator
+Random walks are performed a specified number of times around the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.2.NeighborSampling Operator
+A certain number of nodes are sampled from the first-degree neighbors of the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.3.NegativeSampling Operator
+The negative sampling algorithm is used to generate a subgraph of non-existent edges.
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+num_samples: The number of false edges to be generated.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.4.EdgeSampling Operator
+The edge sampling algorithm is used to generate a subgraph of sampled edges.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_rate: The sampling rate of the edges to be selected.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.5.GetDB Operator
+Get the graph data from the database and convert it into the required data structure.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+## 4. User-Defined Sampling Algorithm
+Users can also implement a custom sampling algorithm through the TuGraph Olap interface. For the interface document, see [here](../2.olap/5.python-api.md). This document mainly introduces the interface of related functions used by the graph sampling algorithm design.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..510f3d4fcd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,96 @@
+# Training
+> This document details how to use TuGraph for training Graph Neural Networks (GNNs).
+
+## 1. Training
+When using TuGraph's graph learning module for training, it can be divided into two categories: full graph training and mini-batch training.
+
+Full graph training involves loading the entire graph from the TuGraph db into memory and training the GNN. Mini-batch training uses the sampling operator of the TuGraph graph learning module to sample the entire graph data and then input it into the training framework for training.
+
+## 2. Mini-Batch Training
+Mini-batch training requires the use of TuGraph's graph learning module's sampling operators, which currently support Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. The sampling result of the TuGraph graph learning module's sampling operator is returned in the form of a List.
+
+The following takes Neighbor Sampling as an example to introduce how to convert the sampled results into the training framework for format conversion.
+The user needs to provide a Sample class:
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. Load graph data
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+        # 2. Sampling method, the result is stored in NodeInfo and EdgeInfo
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+        # 3. Format conversion of the result to fit the training format
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+As shown in the code, the graph data is first loaded into memory. Then use the sampling operator to sample the graph data, and the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and the stored information results are as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Finally, we format the result to fit the training format. Here we use the DGL training framework, so we construct a DGL Graph using the result data, and then return the DGL Graph.
+
+Once we provide the TuGraphSample class, we can use it for Mini-Batch training. Let the data loading part of DGL use the sampler instance of TuGraphSample as follows:
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+Use DGL for model training:
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+## 3. Full-Batch training
+Full-Batch training of GNNs (Graph Neural Networks) is a type of training that involves processing the entire training dataset at once. It is one of the simplest and most straightforward training methods for GNNs, where the entire graph is treated as a single instance. In full-batch training, the entire dataset is loaded into memory and the model is trained on the entire graph. This type of training is especially useful for small to medium-sized graphs, and is mainly used for static graphs that do not change over time.
+```python
+getdb. Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+The full graph are then fed into the training framework for training.
+Full code: learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..556c3c1fd0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,101 @@
+# Heterogeneous Graph
+
+> This document describes how to use heterogeneous graphs for training.
+
+## 1. Introduction to Heterogeneous Graph
+A heterogeneous graph is a graph structure composed of nodes and edges of different types. In a heterogeneous graph, nodes and edges can have diverse attributes and relationships, representing different entities and their complex associations.
+
+In a heterogeneous graph, node types can represent different entities such as users, products, topics, etc., while edge types represent the relationships between different entities, such as the follow relationship between users, or the purchase relationship between users and products. Nodes and edges can have different attributes.
+
+Heterogeneous graphs provide a powerful graph model that can better express and analyze real-world systems with multiple entity types and complex relationships. They have broad application prospects and research value in various fields of data analysis and applications.
+
+## 2. Creating a Heterogeneous Graph
+In TuGraph, a heterogeneous graph is composed of a series of edge relationships. Each relationship is defined by a triplet of strings: (source node type, edge type, target node type). The creation of a heterogeneous graph is similar to that of a homogeneous graph, but the triplet definition needs to be specified when creating the graph. The following example demonstrates:
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+In the code snippet above, the fourth parameter is the edge relationship definition of the heterogeneous graph. By specifying this parameter, you can select specific node and edge types for graph construction and training. If this parameter is not specified, all node and edge types will be used for graph construction by default.
+
+## 3. Heterogeneous graph query interface
+To facilitate user usage, TuGraph provides interfaces for querying node and edge types when the fourth parameter is given. The following examples demonstrate these interfaces:
+
+### 3.1 Querying Node Types
+```python
+olapondb.ntypes()
+```
+The return value is a list of node types, such as ['node1', 'node2', 'node3'].
+
+### 3.2 Querying Edge Types
+```python
+olapondb.etypes()
+``` 
+The return value is a list of edge types, such as ['edge1', 'edge2', 'edge3'].
+
+### 3.3 Querying Node and Edge Types
+```python
+olapondb.metagraph()
+```
+The return value is a list of string triplets (source node type, edge type, target node type), such as
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')].
+
+## 4 Heterogeneous graph output format
+The same as the homogeneous graph, the sampling data results of the heterogeneous graph are also stored in NodeInfo and EdgeInfo.
+Output data can be obtained in the following ways.
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+
+The result of its stored information is as follows:
+| Graph Data | Storage Location |
+| --- | --- |
+| Edge Source | EdgeInfo[0] |
+| Edge Destination | EdgeInfo[1] |
+| Edge Type | EdgeInfo[2] |
+| Vertex ID | NodeInfo[0] |
+| Vertex Feature | NodeInfo[1] |
+| Vertex Label | NodeInfo[2] |
+| Vertex Type | NodeInfo[3] |
+
+## 5. Training Heterogeneous Graphs
+The goal of training a heterogeneous graph is to learn the representation of nodes and edges in the graph for subsequent tasks such as node classification, link prediction, and graph clustering. To achieve this goal, researchers have proposed a variety of models based on graph neural networks (GNNs). These models update the representation of nodes by aggregating the information of neighboring nodes, thereby capturing the complex relationships in the graph structure.
+
+Since heterogeneous graphs contain nodes and edges of multiple types, it is necessary to consider how to process these different types of information when designing GNN models. One common approach is to design different aggregation functions to process different types of neighboring nodes. In addition, it is also necessary to consider how to integrate these different types of information together so that the model can effectively learn the representation of nodes and edges.
+
+TuGraph provides a method for training heterogeneous graphs using the ogbn-mag dataset, which can be used for reference.
+
+The official docker provided by TuGraph does not yet provide an environment for heterogeneous graph training, so users need to install relevant dependency packages by themselves.
+Before training, you need to download the ogb and pandas packages. The specific installation method is as follows:
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+The training code looks like this:
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    # print('load time', load_time - s, 'train_time', train_time - load_time)
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+The complete training code can be found in tugraph/learn/examples/train_full_mag.py.
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..fbc920ad54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+TuGraph Learn
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..f4d9296bec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+Stored Procedures And OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/conf.py b/docs/docusaurus/versions/version-4.3.1/en-US/source/conf.py
new file mode 100644
index 0000000000..7712aee00e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.3.1/en-US/source/index.rst b/docs/docusaurus/versions/version-4.3.1/en-US/source/index.rst
new file mode 100644
index 0000000000..24b08fe10f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/en-US/source/index.rst
@@ -0,0 +1,23 @@
+TuGraph DB
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions/version-4.3.1/images/architecture-en.png b/docs/docusaurus/versions/version-4.3.1/images/architecture-en.png
new file mode 100644
index 0000000000..edf2bc873a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/architecture-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/architecture.png b/docs/docusaurus/versions/version-4.3.1/images/architecture.png
new file mode 100644
index 0000000000..e8eeea87e0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/architecture.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/account-add-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/account-add-button.png
new file mode 100644
index 0000000000..5b9c7e9378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/account-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/account-add.png b/docs/docusaurus/versions/version-4.3.1/images/browser/account-add.png
new file mode 100644
index 0000000000..b0b5068027
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/account-add.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/account-delete.png b/docs/docusaurus/versions/version-4.3.1/images/browser/account-delete.png
new file mode 100644
index 0000000000..bfe49fb093
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/account-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/account-disable.png b/docs/docusaurus/versions/version-4.3.1/images/browser/account-disable.png
new file mode 100644
index 0000000000..f8ff994f21
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/account-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/account-edit.png b/docs/docusaurus/versions/version-4.3.1/images/browser/account-edit.png
new file mode 100644
index 0000000000..939c374f25
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/account-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/account-enable.png b/docs/docusaurus/versions/version-4.3.1/images/browser/account-enable.png
new file mode 100644
index 0000000000..ddc8cef578
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/account-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/account.png b/docs/docusaurus/versions/version-4.3.1/images/browser/account.png
new file mode 100644
index 0000000000..0aa0cd195c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/account.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/db_basic.png b/docs/docusaurus/versions/version-4.3.1/images/browser/db_basic.png
new file mode 100644
index 0000000000..b78298825b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/db_basic.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/db_configuration.png b/docs/docusaurus/versions/version-4.3.1/images/browser/db_configuration.png
new file mode 100644
index 0000000000..2de3da502c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/db_configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-button.png
new file mode 100644
index 0000000000..dd8966d0d3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-clear.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-clear.png
new file mode 100644
index 0000000000..ee5d3c92a9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-clear.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-collapse.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-collapse.png
new file mode 100644
index 0000000000..e053061834
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-collapse.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-delete.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-delete.png
new file mode 100644
index 0000000000..5aefa20c43
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand-after.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand-after.png
new file mode 100644
index 0000000000..371efb6e6b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand-after.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand-before.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand-before.png
new file mode 100644
index 0000000000..80e74174af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand-before.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand-custom.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand-custom.png
new file mode 100644
index 0000000000..bed0a73705
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand-custom.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand.png
new file mode 100644
index 0000000000..75b0caf2b9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-expand.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-fixed.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-fixed.png
new file mode 100644
index 0000000000..aac4a18573
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-fixed.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-lasso.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-lasso.png
new file mode 100644
index 0000000000..53f743925b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-lasso.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-legend-chart.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-legend-chart.png
new file mode 100644
index 0000000000..0ddb63b926
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-legend-chart.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-legend-list.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-legend-list.png
new file mode 100644
index 0000000000..07d0bf0a4c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-legend-list.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-retrieval.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-retrieval.png
new file mode 100644
index 0000000000..57eafece0e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-retrieval.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-unfix.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-unfix.png
new file mode 100644
index 0000000000..80fa2c8b72
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-canvas-unfix.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-operation-area.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-operation-area.png
new file mode 100644
index 0000000000..b251837e26
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-operation-area.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-attributefilter.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-attributefilter.png
new file mode 100644
index 0000000000..8883301d09
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-attributefilter.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-configurequery.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-configurequery.png
new file mode 100644
index 0000000000..d294a8616b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-configurequery.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-query.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-query.png
new file mode 100644
index 0000000000..b745e4d5c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-query.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png
new file mode 100644
index 0000000000..afbaf3bfd5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-statisticalfilter.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-statisticalfilter.png
new file mode 100644
index 0000000000..7c2e3b635e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-queryfilter-statisticalfilter.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-appearance-Button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-appearance-Button.png
new file mode 100644
index 0000000000..dab00330b7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-appearance-Button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-appearance.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-appearance.png
new file mode 100644
index 0000000000..330ad3128e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-appearance.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-layout-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-layout-button.png
new file mode 100644
index 0000000000..49516d6427
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-layout-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-layout-parameters.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-layout-parameters.png
new file mode 100644
index 0000000000..d02772bfd9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphanalysis-style-layout-parameters.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addedge-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addedge-button.png
new file mode 100644
index 0000000000..b38900728e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addedge-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addedge.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addedge.png
new file mode 100644
index 0000000000..39eca4a772
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addedge.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addvertex-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addvertex-button.png
new file mode 100644
index 0000000000..e616ce0f89
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addvertex-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addvertex.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addvertex.png
new file mode 100644
index 0000000000..df56d537bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-addvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-button.png
new file mode 100644
index 0000000000..abf1fab48f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-editedge.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-editedge.png
new file mode 100644
index 0000000000..eb7206b771
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-editedge.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-editvertex.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-editvertex.png
new file mode 100644
index 0000000000..eb252761bf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-editvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-exportmodel-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-exportmodel-button.png
new file mode 100644
index 0000000000..acbaa80189
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-exportmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-exportmodel.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-exportmodel.png
new file mode 100644
index 0000000000..4991dc7378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-exportmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import-csv.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import-csv.png
new file mode 100644
index 0000000000..2301c01cfc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import-csv.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import-datamapping.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import-datamapping.png
new file mode 100644
index 0000000000..5d55861a95
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import-datamapping.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import-success.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import-success.png
new file mode 100644
index 0000000000..20a48beb0f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import-success.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import.png
new file mode 100644
index 0000000000..0154bac688
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-import.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-importmodel-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-importmodel-button.png
new file mode 100644
index 0000000000..bb7822aaef
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-importmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-importmodel.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-importmodel.png
new file mode 100644
index 0000000000..252b082100
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-importmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-list-copy.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-list-copy.png
new file mode 100644
index 0000000000..ea210495fc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-list-copy.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-list-delete.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-list-delete.png
new file mode 100644
index 0000000000..aeba09b532
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-list-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-list-search.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-list-search.png
new file mode 100644
index 0000000000..9313c8eb7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-list-search.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-select.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-select.png
new file mode 100644
index 0000000000..18bfb3be74
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild-select.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild.png
new file mode 100644
index 0000000000..cd1f0bda1c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphbuild.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-configure.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-configure.png
new file mode 100644
index 0000000000..91fa18814f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-creategraph.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-deletegraph-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-deletegraph-button.png
new file mode 100644
index 0000000000..34a4efd42a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-deletegraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-editgraph-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-editgraph-button.png
new file mode 100644
index 0000000000..773798b78b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-editgraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-editgraph.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-editgraph.png
new file mode 100644
index 0000000000..f6cc706f41
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-editgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-homepage.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-homepage.png
new file mode 100644
index 0000000000..c3af5618ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-homepage.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-selecttemplate.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-selecttemplate.png
new file mode 100644
index 0000000000..8a19d8da39
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-selecttemplate.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-statistics-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-statistics-button.png
new file mode 100644
index 0000000000..cdb25ed397
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-statistics-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-statistics-refresh-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-statistics-refresh-button.png
new file mode 100644
index 0000000000..e2ec35cbe1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-statistics-refresh-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-statistics.png b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-statistics.png
new file mode 100644
index 0000000000..49db6e652f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/graphmanagement-statistics.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/login.png b/docs/docusaurus/versions/version-4.3.1/images/browser/login.png
new file mode 100644
index 0000000000..3f4109b059
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/login.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/pathquery-configuration.png b/docs/docusaurus/versions/version-4.3.1/images/browser/pathquery-configuration.png
new file mode 100644
index 0000000000..579a7d99ee
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/pathquery-configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/pathquery-result.png b/docs/docusaurus/versions/version-4.3.1/images/browser/pathquery-result.png
new file mode 100644
index 0000000000..0cd90cad46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/pathquery-result.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/pathquery-select.png b/docs/docusaurus/versions/version-4.3.1/images/browser/pathquery-select.png
new file mode 100644
index 0000000000..3c5d0f7751
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/pathquery-select.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-bookmark-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-bookmark-button.png
new file mode 100644
index 0000000000..9a6f73bf7c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-bookmark-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-bookmark.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-bookmark.png
new file mode 100644
index 0000000000..a93315ab17
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-bookmark.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-button.png
new file mode 100644
index 0000000000..cd00d7f3fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-download-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-download-button.png
new file mode 100644
index 0000000000..ec59f7a0ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-download-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-execute-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-execute-button.png
new file mode 100644
index 0000000000..6c38e68c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-execute-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-gqltips.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-gqltips.png
new file mode 100644
index 0000000000..bdabee92e7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-gqltips.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-download.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-download.png
new file mode 100644
index 0000000000..48890083fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-download.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-downloadtxt.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-downloadtxt.png
new file mode 100644
index 0000000000..3554ef592c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-downloadtxt.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-fullscreen-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-fullscreen-button.png
new file mode 100644
index 0000000000..13925db74f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-fullscreen-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-fullscreen-close.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-fullscreen-close.png
new file mode 100644
index 0000000000..2a63926742
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-fullscreen-close.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-fullscreen.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-fullscreen.png
new file mode 100644
index 0000000000..2dcf0ca0b4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-fullscreen.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-graph.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-graph.png
new file mode 100644
index 0000000000..9b3edecb5f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-insert-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-insert-button.png
new file mode 100644
index 0000000000..8879b2c4bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-insert-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-insert.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-insert.png
new file mode 100644
index 0000000000..2cd23b6e84
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-insert.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-jsontxt.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-jsontxt.png
new file mode 100644
index 0000000000..5f265cfff1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-jsontxt.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-jsonview.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-jsonview.png
new file mode 100644
index 0000000000..8a774f91c9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-jsonview.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-list.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-list.png
new file mode 100644
index 0000000000..4692c49eca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-result-list.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-schema-graph.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-schema-graph.png
new file mode 100644
index 0000000000..ccc9e3126b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-schema-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-schema-list.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-schema-list.png
new file mode 100644
index 0000000000..3649b41272
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-schema-list.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-selectgql.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-selectgql.png
new file mode 100644
index 0000000000..1ea624b81f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-selectgql.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-selectgraph.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-selectgraph.png
new file mode 100644
index 0000000000..6dc14e486d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-selectgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/query-view.png b/docs/docusaurus/versions/version-4.3.1/images/browser/query-view.png
new file mode 100644
index 0000000000..8d1884ad82
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/query-view.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-configure.png b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-configure.png
new file mode 100644
index 0000000000..166e54cb75
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-creategraph.png b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-graphtab.png b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-graphtab.png
new file mode 100644
index 0000000000..0f7980bc46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-graphtab.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-result.png b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-result.png
new file mode 100644
index 0000000000..2a2a59ce02
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-result.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-selectdemo.png b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-selectdemo.png
new file mode 100644
index 0000000000..7dda3f06b0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/quickstart-selectdemo.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/role-add-button.png b/docs/docusaurus/versions/version-4.3.1/images/browser/role-add-button.png
new file mode 100644
index 0000000000..a4590ac431
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/role-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/role-add.png b/docs/docusaurus/versions/version-4.3.1/images/browser/role-add.png
new file mode 100644
index 0000000000..8f56b24bd7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/role-add.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/role-delete.png b/docs/docusaurus/versions/version-4.3.1/images/browser/role-delete.png
new file mode 100644
index 0000000000..3c09e7caa8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/role-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/role-disable.png b/docs/docusaurus/versions/version-4.3.1/images/browser/role-disable.png
new file mode 100644
index 0000000000..eb2e355d58
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/role-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/role-edit.png b/docs/docusaurus/versions/version-4.3.1/images/browser/role-edit.png
new file mode 100644
index 0000000000..7b5db6e48c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/role-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/role-enable.png b/docs/docusaurus/versions/version-4.3.1/images/browser/role-enable.png
new file mode 100644
index 0000000000..40b7909289
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/role-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/vertexquery-criteria.png b/docs/docusaurus/versions/version-4.3.1/images/browser/vertexquery-criteria.png
new file mode 100644
index 0000000000..b5f95c3d83
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/vertexquery-criteria.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/browser/vertexquery.png b/docs/docusaurus/versions/version-4.3.1/images/browser/vertexquery.png
new file mode 100644
index 0000000000..97aa28122b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/browser/vertexquery.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-1.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-1.png
new file mode 100644
index 0000000000..c7202ff3de
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-10.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-10.png
new file mode 100644
index 0000000000..d6ed55c8bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-10.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-2.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-2.png
new file mode 100644
index 0000000000..6fc79fde54
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-3.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-3.png
new file mode 100644
index 0000000000..0e59f028c7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-4.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-4.png
new file mode 100644
index 0000000000..b606ec8bb8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-4.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-5.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-5.png
new file mode 100644
index 0000000000..18d5845ec1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-5.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-6.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-6.png
new file mode 100644
index 0000000000..d939108e3b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-6.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-7.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-7.png
new file mode 100644
index 0000000000..5c5d1800af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-7.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-8.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-8.png
new file mode 100644
index 0000000000..5beb0628b3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-8.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-9.png b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-9.png
new file mode 100644
index 0000000000..d04282d95a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/cloud-deployment-9.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/contact-en.png b/docs/docusaurus/versions/version-4.3.1/images/contact-en.png
new file mode 100644
index 0000000000..47ac8b8297
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/contact-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/contact-zh.png b/docs/docusaurus/versions/version-4.3.1/images/contact-zh.png
new file mode 100644
index 0000000000..75c49540b5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/contact-zh.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/htap-en.png b/docs/docusaurus/versions/version-4.3.1/images/htap-en.png
new file mode 100644
index 0000000000..85479ac1e1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/htap-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/htap.png b/docs/docusaurus/versions/version-4.3.1/images/htap.png
new file mode 100644
index 0000000000..c7764a3fa7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/htap.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/learn_flow_chart_en.png b/docs/docusaurus/versions/version-4.3.1/images/learn_flow_chart_en.png
new file mode 100644
index 0000000000..c9e55a52a5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/learn_flow_chart_en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/learn_flow_chart_zh.png b/docs/docusaurus/versions/version-4.3.1/images/learn_flow_chart_zh.png
new file mode 100644
index 0000000000..9977dcfb6c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/learn_flow_chart_zh.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/multi-level-Interfaces-en.png b/docs/docusaurus/versions/version-4.3.1/images/multi-level-Interfaces-en.png
new file mode 100644
index 0000000000..b7de07422c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/multi-level-Interfaces-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/multi-level-Interfaces.png b/docs/docusaurus/versions/version-4.3.1/images/multi-level-Interfaces.png
new file mode 100644
index 0000000000..2c9694a476
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/multi-level-Interfaces.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/partners/fu.png b/docs/docusaurus/versions/version-4.3.1/images/partners/fu.png
new file mode 100644
index 0000000000..a238d3a5ce
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/partners/fu.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/partners/hust.png b/docs/docusaurus/versions/version-4.3.1/images/partners/hust.png
new file mode 100644
index 0000000000..e1219f932b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/partners/hust.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/partners/oceanbase.png b/docs/docusaurus/versions/version-4.3.1/images/partners/oceanbase.png
new file mode 100755
index 0000000000..978297d9bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/partners/oceanbase.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/partners/secretflow.png b/docs/docusaurus/versions/version-4.3.1/images/partners/secretflow.png
new file mode 100644
index 0000000000..d386ce72fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/partners/secretflow.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/partners/whaleops.png b/docs/docusaurus/versions/version-4.3.1/images/partners/whaleops.png
new file mode 100644
index 0000000000..7ace477cf4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/partners/whaleops.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/partners/zju.png b/docs/docusaurus/versions/version-4.3.1/images/partners/zju.png
new file mode 100644
index 0000000000..704f0bb867
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/partners/zju.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/round-the-world/flight_page.jpg b/docs/docusaurus/versions/version-4.3.1/images/round-the-world/flight_page.jpg
new file mode 100644
index 0000000000..bd296766c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/round-the-world/flight_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/round-the-world/main_page.jpg b/docs/docusaurus/versions/version-4.3.1/images/round-the-world/main_page.jpg
new file mode 100644
index 0000000000..2edc617c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/round-the-world/main_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/round-the-world/search_example.jpg b/docs/docusaurus/versions/version-4.3.1/images/round-the-world/search_example.jpg
new file mode 100644
index 0000000000..154d387721
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/round-the-world/search_example.jpg differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-body-cypher1.png b/docs/docusaurus/versions/version-4.3.1/images/three-body-cypher1.png
new file mode 100644
index 0000000000..3f85fd8412
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-body-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-body-cypher2.png b/docs/docusaurus/versions/version-4.3.1/images/three-body-cypher2.png
new file mode 100644
index 0000000000..41f0f914cc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-body-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-body-cypher3.png b/docs/docusaurus/versions/version-4.3.1/images/three-body-cypher3.png
new file mode 100644
index 0000000000..4776f26d77
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-body-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-body-data.png b/docs/docusaurus/versions/version-4.3.1/images/three-body-data.png
new file mode 100644
index 0000000000..1913b39cbc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-body-data.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher1.png b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher1.png
new file mode 100644
index 0000000000..4b5745b96d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher2.png b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher2.png
new file mode 100644
index 0000000000..fef4592cf3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher3.png b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher3.png
new file mode 100644
index 0000000000..c0790d5d7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher4.png b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher4.png
new file mode 100644
index 0000000000..49a6498d4a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher4.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher5.png b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher5.png
new file mode 100644
index 0000000000..5d3cc55cdf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-cypher5.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-schema.png b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-schema.png
new file mode 100644
index 0000000000..24aebca93a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/three-kingdoms-schema.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/tugraph-datax.png b/docs/docusaurus/versions/version-4.3.1/images/tugraph-datax.png
new file mode 100644
index 0000000000..c2968c0c38
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/tugraph-datax.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/wandering-earth-1.png b/docs/docusaurus/versions/version-4.3.1/images/wandering-earth-1.png
new file mode 100644
index 0000000000..955c565303
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/wandering-earth-1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/wandering-earth-2.png b/docs/docusaurus/versions/version-4.3.1/images/wandering-earth-2.png
new file mode 100644
index 0000000000..9cb17764ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/wandering-earth-2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/wandering-earth-3.png b/docs/docusaurus/versions/version-4.3.1/images/wandering-earth-3.png
new file mode 100644
index 0000000000..c6dabbec97
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/wandering-earth-3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/what-is-graph-en.png b/docs/docusaurus/versions/version-4.3.1/images/what-is-graph-en.png
new file mode 100644
index 0000000000..53d5ba05ca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/what-is-graph-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/images/what-is-graph.png b/docs/docusaurus/versions/version-4.3.1/images/what-is-graph.png
new file mode 100644
index 0000000000..6f3aa196fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.1/images/what-is-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.1/requirements.txt b/docs/docusaurus/versions/version-4.3.1/requirements.txt
new file mode 100644
index 0000000000..0201af0943
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/requirements.txt
@@ -0,0 +1,5 @@
+sphinx
+myst-parser
+sphinx-panels
+sphinx-rtd-theme
+breathe
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/.readthedocs.yaml b/docs/docusaurus/versions/version-4.3.1/zh-CN/.readthedocs.yaml
new file mode 100644
index 0000000000..5b91d3cd6c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/zh-CN/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/Makefile b/docs/docusaurus/versions/version-4.3.1/zh-CN/Makefile
new file mode 100644
index 0000000000..d0c3cbf102
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?=
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/make.bat b/docs/docusaurus/versions/version-4.3.1/zh-CN/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/1.guide.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/1.guide.md
new file mode 100644
index 0000000000..3da03232df
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/1.guide.md
@@ -0,0 +1,74 @@
+# 文档地图
+
+> 这里是文档地图，帮助用户快速学习和使用TuGraph社区版。
+
+## 快速上手
+
+> 可以先了解[什么是图](./2.introduction/1.what-is-graph.md)、图[可以做什么](./2.introduction/8.scenarios.md)、以及[什么是TuGraph](./2.introduction/3.what-is-tugraph.md)。
+
+> 基于[阿里云计算巢](5.installation&running/5.cloud-deployment.md)或[Docker方式](5.installation&running/3.docker-deployment.md)快速部署TuGraph。
+
+> 通过产品内置的场景上手体验：[电影](./3.quick-start/2.demo/1.movie.md)、[流浪地球](./3.quick-start/2.demo/2.wandering-earth.md)、[三体](./3.quick-start/2.demo/3.the-three-body.md)、[三国](./3.quick-start/2.demo/4.three-kingdoms.md)。
+
+> 可视化操作手册看这里：[可视化操作手册](./4.user-guide/1.tugraph-browser.md)、[可视化操作手册（旧版）](./4.user-guide/2.tugraph-browser-legacy.md)。
+
+## 开发指南
+
+> 通过客户端访问TuGraph：[Bolt Client](7.client-tools/5.bolt-client.md)
+
+> 查询语言、语句创建图模型看这里：[Cypher API](8.query/1.cypher.md).
+
+> 存储过程和算法介绍看这里：[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md)。
+
+> C++/Python开发存储过程接口看这里：[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## 参与社区贡献
+
+> 在开始贡献前，可以先了解[如何贡献](12.contributor-manual/1.contributing.md)
+
+> 如果想了解社区角色的划分，请访问[社区角色](12.contributor-manual/2.community-roles.md)
+
+## 主要仓库
+
+> TuGraph-DB 仓库: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> 可视化界面: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> 基于twitter数据的简单测试方法: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> 基于标准LDBC-SNB的测试方法: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics 仓库: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## 视频中心
+
+> [TuGraph快速上手](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph技术分享集合](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [3分钟读懂图计算](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph最新版本
+
+| 描述                  | 文件                                         | 链接                                                                                                                                                                                              |
+|---------------------|--------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 安装包         | tugraph-4.3.1-1.el7.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-4.3.1-1.el7.x86_64.rpm) |
+| CentOS8 安装包         | tugraph-4.3.1-1.el8.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-4.3.1-1.el8.x86_64.rpm) |
+| Ubuntu18.04 安装包     | tugraph-4.3.1-1.x86_64.deb                 | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-4.3.1-1.x86_64.deb)  |
+| CentOS7 预安装镜像       | tugraph-runtime-centos7-4.3.1.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-runtime-centos7-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                   |
+| CentOS8 预安装镜像       | tugraph-runtime-centos8-4.3.1.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-runtime-centos8-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8)                   |
+| Ubuntu18.04 预安装镜像   | tugraph-runtime-ubuntu18.04-4.3.1.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-runtime-ubuntu18.04-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04)           |
+| CentOS7 精简安装包       | tugraph-mini-4.3.1-1.el7.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-4.3.1-1.el7.x86_64.rpm)                                                                                 |
+| CentOS8 精简安装包       | tugraph-mini-4.3.1-1.el8.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-4.3.1-1.el8.x86_64.rpm)                                                                                 |
+| Ubuntu18.04 精简安装包   | tugraph-mini-4.3.1-1.x86_64.deb            | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-4.3.1-1.x86_64.deb)                                                                                     |
+| CentOS7 精简预安装镜像     | tugraph-mini-runtime-centos7-4.3.1.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-runtime-centos7-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7)         |
+| CentOS8 精简预安装镜像     | tugraph-mini-runtime-centos8-4.3.1.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-runtime-centos8-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8)         |
+| Ubuntu18.04 精简预安装镜像 | tugraph-mini-runtime-ubuntu18.04-4.3.1.tar | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-runtime-ubuntu18.04-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 编译镜像        | tugraph-compile-centos7-1.3.2.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.3.2.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)          |
+| CentOS8 编译镜像        | tugraph-compile-centos8-1.3.2.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.3.2.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)          |
+| Ubuntu18.04 编译镜像    | tugraph-compile-ubuntu18.04-1.3.2.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.3.2.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04)  |
+
+
+版本更新日志见：[链接](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md )。
+
+如果您不清楚使用安装包和镜像，请参考 [环境和版本选择](13.best-practices/4.selection.md)。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..bb808b54b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/1.privilege.md
@@ -0,0 +1,138 @@
+# 用户权限
+
+## 1.介绍
+
+> TuGraph 的权限是基于角色的访问控制进行管理，定义访问控制的权限分配给角色，角色再分配给用户。
+
+## 2.权限层级
+
+- Global 层：即全局权限，对管理、图操作均有权限；
+- Graph 层：即图级别，对每个图的权限；
+- （仅商业化版本支持）Property 层：即属性级别，对某个属性的权限控制
+
+## 3.权限关键字
+
+目前权限的控制较为简洁
+
+- Global 层目前为 admin 权限，并且预置了 admin 用户；
+
+* Graph 层的操作权限分为四种：none，read，write，full
+  - none：无权限，对于图没有任何操作权限
+  - read：只读权限，对于图只具备读取权限
+  - write：读写权限，对于图不仅具备读取权限，还具备了写入的权限
+  - full：所有权限，对于图不仅具备读写权限，同时也具备删除图、修改图、修改 Schema 等权限
+* （仅商业化版本支持）Property 层的权限分别为：none，read，write
+  - none：无权限，对于该属性没有任何操作权限
+  - read：只读权限，对于该属性只具备读取权限
+  - write：读写权限，对于该属性不仅具备读取权限，还具备了写入的权限
+
+## 4.常用权限操作
+
+### 4.1.用户操作
+
+- 创建用户
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- 删除用户
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- 修改当前用户密码
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- 修改指定用户密码
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- 禁用/启用用户
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- 列出所有用户
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- 列出当前用户信息
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- 获取用户详情
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.角色操作
+
+- 创建角色
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- 删除角色
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- 列出所有角色
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- 禁用/启用角色
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.赋予用户角色
+
+- 新增用户与角色的联系
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- 删除用户与角色的联系
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- 清空用户角色的关系并重建
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.角色赋权
+
+- 修改角色对指定图的访问权限
+
+```cypher
+CALL dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP)
+```
+
+示例
+
+```cypher
+CALL dbms.security.modRoleAccessLevel("test_role", {test_graph1:"FULL", test_graph2:"NONE"})
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/2.token.md
new file mode 100644
index 0000000000..02e265cf23
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/2.token.md
@@ -0,0 +1,50 @@
+# Token使用说明
+
+## 1.Token介绍
+JWT（JSON Web Token）是一种用于认证和授权的开放标准。它基于JSON（JavaScript Object Notation）格式，并被设计用于在网络应用之间安全地传输声明（claims）信息。
+
+JWT由三部分组成：头部（Header）、负载（Payload）和签名（Signature）。头部包含了JWT的类型以及所使用的签名算法，负载包含了需要传输的信息，而签名用于验证JWT的完整性和真实性。
+
+在TuGraph中，JWT用于实现无状态的认证和授权机制。当用户登录成功后，服务端会生成一个JWT并将其返回给客户端。客户端在后续的请求中将这个JWT作为身份凭证传递给服务端。服务端收到JWT后，通过验证签名和解析负载中的信息，判断用户的身份和权限，并决定是否允许该请求的执行。
+
+## 2. Token有效期
+
+### 2.1. 浏览器Token交互逻辑
+1. 用户打开浏览器，输入账号密码，并点击登录。
+2. 前端调用登录接口，向后端输入账号和密码。
+3. 后端接收到账号密码后，进行校验，校验成功后，返回Token。
+4. 前端将Token存储在浏览器缓存中，后续请求都要携带此Token。
+5. 如果前端，主动点击登出和关闭页面，前端应主动调用登出接口，向后端传递Token。
+6. 后端接收后，将Token失效，返回状态码200，以及“等出成功”。前端接收到信息后，清空浏览器内存中的Token，并将页面退至登录页。
+7. Token失效（初始设置为24小时），需要用户重新登录。
+
+### 2.3. Token有效期刷新机制
+
+Token有效期存在刷新机制，默认关闭。如果打开后，Token的安全性会更高，实现上则存在两个时间戳。
+
+第一个时间戳`refresh_time`用于判定Token是否过期（默认24小时）：过期后可以调用刷新接口获取新的Token，可以设置为更短的时间，比如1小时。
+
+第二个时间戳`expire_time`为强制过期时间戳（默认24小时）：过期后必须重新登陆。
+
+### 2.4. Token有效期修改
+为了方便开发者自行开发，TuGraph提供了两种方式修改有效期，均需要admin权限。
+
+* 通过接口调用设置。涉及有效期修改的接口`update_token_time`和有效期查询接口`get_token_time`。
+具体可查询[REST接口文档](../7.client-tools/9.restful-api-legacy.md)。
+
+* 通过启动参数设置。server端启动时，添加参数`-unlimited_token 1` 参数可以设置为无期限。可参考[服务运行文档](../5.installation&running/7.tugraph-running.md)。
+
+## 3. 客户端发送Token相关请求介绍
+
+客户端会两种协议处理相关请求，一种是REST，一种是RPC。
+
+### 3.1. REST
+如果客户端使用REST协议（包括Browser浏览器），由于是短链接，在每一次请求中都需要携带Token，过期后需要获取新的Token。
+
+对于自行开发的客户端，若采用REST协议则需要考虑Token的逻辑。
+
+### 3.2. RPC
+如果客户端使用RPC协议（包括官方的C++/Java/Python），使用长连接保持，登陆后不涉及Token操作。
+
+## 4. Token上限
+Token上限是指一个用户最多可以同时拥有的Token数量。为防止无限登陆，Token上限默认为10000。由于Token生成逻辑和时间强相关，每登录一次会生成一个Token进行存储，Token有效期默认为24小时，因此建议登录后不使用的Token及时登出。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..245d6075bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,19 @@
+# 忘记'admin'密码
+> TuGraph 提供了重置密码的功能，当用户忘记管理者账号`admin`密码时，可以通过重置密码的方式来修改密码。
+
+## 1.重置密码
+首先，需要停止TuGraph服务端。再次启动TuGraph服务端时，需要添加如下参数：
+
+```bash
+--reset_admin_password 1
+```
+
+如下所示：
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+这一操作可以使得TuGraph服务端在启动时，重置管理者`admin`的密码为默认密码：`73@TuGraph`。
+密码重置成功会给出相关信息“Reset admin password successfully”并关闭当前服务端进程。
+
+用户需要以正常模式重新启动服务端，然后使用默认账号密码进行登录，登录后重新设置密码即可正常使用。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..b79cc13cc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/4.monitoring.md
@@ -0,0 +1,1020 @@
+# 运维监控
+
+> 此文档主要介绍 TuGraph 的可视化运维监控
+
+## 1.设计思路
+
+可视化监控并不是TuGraph自身不可或缺的一部分，因此在设计时将可视化监控作为TuGraph周边生态中的一个应用，来减少和TuGraph数据库的耦合度，以及对于TuGraph自身的影响。TuGraph可视化监控采用目前最火热的开源解决方案，TuGraph Monitor + Prometheus + Grafana来实现。其中TuGraph Monitor作为TuGraph服务的客户端，通过TCP链接向TuGraph服务发起Procedure请求，TuGraph服务在接收到请求后收集自身所在机器的cpu，memory，disk，io，以及请求数量等指标的统计结果进行响应。TuGraph Monitor在接收到TuGraph响应的指标数据后，将数据包装成prometheus需要的格式，保存在内存中，等待Prometheus服务通过http请求获取。Prometheus服务会定期通过http请求从TuGraph Monitor获取封装好的请求数据，按照获取的时间保存在自己的时序数据库中。Grafana可以根据用户的配置，从Prometheus处获取某个时间段内的统计数据，并在web界面上绘制浅显易懂的图形来展示最终结果。整个请求链路中，都采用了主动获取，即PULL的模型，好处之一是它能最大限度的避免数据生产者和数据消费者之间的耦合度，使得开发更简单，好处之二是数据生产者不需要考虑数据消费者的数据处理能力，即使某个消费者的数据处理能力较弱，也不会因为生产者生产数据过快而压垮消费者。主动拉取模型的不足之处在于数据的实时性不够，但在这个场景中，数据并没有很高的实时性要求。
+
+### 1.1.TuGraph
+
+TuGraph数据库提供了收集服务所在机器中磁盘，内存，网络IO，以及查询请求等多种数据信息的能力，并通过标准Procedure方式提供查询。收集数据这一动作仅在有用户通过接口查询时才会发生，避免了在用户不需要TuGraph监控服务所在机器的指标时对用户业务查询请求带来的影响。
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor是TuGraph周边生态中的一个工具，它作为TuGraph众多用户中的一个，通过C++ RPC Client与TuGraph进行通信，通过Procedure查询接口来查询TuGraph服务所在机器的性能指标，并将TuGraph返回的结果包装成Prometheus需要的数据模型，等待Prometheus获取。用户可以通过设置查询时间间隔来保证获取监控指标对于业务查询的影响最小化。
+
+### 1.3.Prometheus
+
+Prometheus是一个开源的监控平台，并配备有专属的时序数据库，它会定期通过http请求从TuGraph Monitor服务获取统计指标，并保存在自己的时序数据库中。详细信息请参考官网: [https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana是一个开源的可视化和分析软件，它可以从包含Prometheus在内的多个数据源中获取数据，并且可以将时序数据库中的数据转换为精美图形和可视化效果的工具。具体信息请参考官网: [https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.部署方案
+
+### 2.1.第一步
+
+启动TuGraph服务，详细方法请参考文档: [https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.第二步
+
+启动TuGraph Monitor工具，启动命令如下：
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+参数含义如下
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.第三步
+
++ 下载符合您机器架构以及系统版本的Prometheus tar包，下载地址: [https://prometheus.io/download/](https://prometheus.io/download/)
+
++ 解压tar包，命令如下
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ 修改配置文件prometheus.yml，新增如下配置，使其可以抓取TuGraph Monitor包装好的性能数据
+
+```yaml
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ 启动prometheus，具体的启动参数可以通过如下命令获取
+
+```shell
+./prometheus -h
+```
+
++ 验证prometheus服务是否正常，可以通过web端登陆prometheus服务，查询监控指标resources_report是否已经获取到，能成功查询到数据则正确
+
+### 2.4.第四步
+
++ 下载符合您机器架构以及系统版本的Grafana安装包，下载地址: [https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ 安装Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 启动Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 配置Grafana，首先在数据源设置中配置Prometheus的IP地址，配置完成后可以通过测试连接功能，验证是否成功连接数据源。然后，导入如下模版，并在页面中根据实际情况，修改正确的接口IP和端口。最后可以根据实际情况设置刷新时间和监控时间范围
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana"
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {label_name} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "内存",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  QPS超过1000",
+        "name": "请求统计 alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "请求统计",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "磁盘",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\nCPU使用率超过90%",
+        "name": "CPU使用率 alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU使用率",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  磁盘IO超过10MB/S",
+        "name": "磁盘IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph监控页面",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+验证效果，刷新浏览器页面。如果正确显示饼图和折线图，则配置完成。
+
+## 3.未来计划
+
+目前可视化监控只支持单机监控，能监控服务所在机器的cpu，磁盘，网络io，请求qps等性能指标，未来将会实现监控ha集群的功能，也会将更多有意义的指标纳入监控范围
+
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/5.log.md
new file mode 100644
index 0000000000..519b3d675f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# 日志信息
+
+> 此文档主要介绍 TuGraph 的日志功能。
+
+## 1.简介
+
+TuGraph 保留两种类型的日志：服务器日志和审计日志。服务器日志记录人为可读的服务器状态信息，而审核日志维护服务器上执行的每个操作加密后的信息。
+
+## 2.服务器日志
+
+### 2.1.服务器日志配置项
+
+服务器日志的输出位置可以通过`log_dir`配置指定。服务器日志详细程度可通过`verbose`配置项指定。
+
+`log_dir`配置项默认为空。若`log_dir`配置项为空，则所有日志会输出到控制台(daemon模式下若log_dir配置项为空则不会向console输出任何日志)；若手动指定`log_dir`配置项，则日志文件会生成在对应的路径下面。单个日志文件最大大小为256MB。
+
+`verbose`配置项控制日志的详细程度，从粗到细分为`0, 1, 2`三个等级，默认等级为`1`。等级为`2`时，日志记录最详细，服务器将打印`DEBUG`及以上等级的全部日志信息；等级为`1`时，服务器将仅打印`INFO`等级及以上的主要事件的日志；等级为`0`时，服务器将仅打印`ERROR`等级及以上的错误日志。
+
+### 2.2.服务器日志输出宏使用示例
+
+如果开发者在开发过程中希望在代码中添加日志，可以参考如下示例
+
+```
+#include "tools/lgraph_log.h" //添加日志依赖
+
+
+void LogExample() {
+    // 数据库启动阶段已经对日志模块进行了初始化，开发者只需直接调用宏即可
+    // 日志等级分为DEBUG, INFO, WARNING, ERROR, FATAL五个等级
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+更多用法可以参考test/test_lgraph_log.cpp中的日志宏的使用方法
+
+### 2.3.存储过程日志
+
+用户在存储过程的编写过程中可以使用日志功能将所需的调试信息输出到日志中进行查看，辅助开发。调试信息会输出到与服务器日志相同的日志文件中(如未指定`log_dir`则同样输出至console)
+
+#### 2.3.1.cpp存储过程
+请使用2.2中提供的log宏输出调试信息，避免使用cout或者printf等输出方式。具体使用方式可参考如下示例代码（详见`procedures/demo/log_demo.cpp`）
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+将以上示例代码作为存储过程插入数据库并运行后，可以在日志文件中看到相应的日志条目。
+
+#### 2.3.1.python存储过程
+请使用python自带的print输出调试信息，调试信息会在存储过程运行结束后合并为一条WARN等级的日志条目输出至日志文件中。
+
+## 3.审计日志
+
+审核日志记录每个请求和响应，以及发送请求的用户以及收到请求的时间。审核日志只能是打开或关闭状态。可以使用 TuGraph 可视化工具和 REST API 查询结果。
+
+开启审计日志需要在配置文件中将`enable_audit_log`参数设置为`true`。配置文件和配置参数说明详见：[数据库运行/服务配置](../../5.installation&running/7.tugraph-running.md)。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/index.rst
new file mode 100644
index 0000000000..f8e9db5345
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+运维与权限管理
+================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..ff3fcd8048
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# 单元测试
+
+> 该文档是TuGraph的单元测试文档
+
+## 1.简介
+
+TuGraph单元测试采用gtest框架，可以选择一次跑全部test或者制定某些test。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..5d49f35255
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/11.quality/2.integration-testing.md
@@ -0,0 +1,399 @@
+# 集成测试
+
+> 此文档主要介绍 TuGraph 的集成测试框架如何使用
+
+## 1.TuGraph集成测试的意义
+
+在单元测试与功能测试中，有部分用例直接开启galaxy或statemachine来进行测试，这并不是一个完整的流程。在完整的cs架构中，用户请求是通过客户端发往服务端，网络通信是必不可少的，为了避免单元测试不完整带来的bug，针对这种情况，使用集成测试框架进行全链路的完整测试。
+
+## 2.TuGraph集成测试框架
+
+TuGraph采用pytest框架作为自己的集成测试框架，pytest框架作为目前使用最广泛的cs端集成测试框架，以其灵活简单，容易上手，并且支持参数化的使用方式而著称，TuGraph基于pytest提供的功能，抽象出了不同的工具，通过参数来控制各个工具的处理逻辑，以方便大家进行高效的测试代码开发。
+
+更多pytest信息请参考官网: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.组件描述
+
+| 组件名称            | 组件功能                       | 实现方式                                  |
+|-----------------|----------------------------|---------------------------------------|
+| server          | TuGraph单机服务                | 开启子进程并在子进程中启动服务                       |
+| client          | TuGraph Rpc Client         | 当前进程中开启TuGraph Python Rpc Client发送请求  |
+| importor        | TuGraph Importor           | 开启子进程并在子进程中处理导入请求                     |
+| exportor        | TuGraph Exportor           | 开启子进程并在子进程中处理导出请求                     |
+| backup_binlog   | TuGraph Backup Binlog      | 开启子进程并在子进程中处理备份binlog的请求              |
+| backup_copy_dir | TuGraph Backup             | 开启子进程并在子进程中处理备份完整db的请求                |
+| build_so        | 编译c++动态连接库的组件              | 开启子进程并在子进程中处理gcc编译逻辑                  |
+| copy_snapshot   | TuGraph Copy Snapshot      | 当前进程中处理备份snapshot的请求                  |
+| copydir         | 文件夹拷贝                      | 当前进程中处理文件夹拷贝请求                        |
+| exec            | 执行c++/java可执行文件            | 开启子进程并在子进程中启动C++可执行文件                 |
+| algo            | 执行算法                       | 开启子进程并在子进程中执行算法                       |
+| bash            | 执行bash命令                   | 开启子进程并在子进程中执行bash命令                   |
+| rest            | TuGraph Python Rest Client | 当前进程中开启TuGraph Python Rest Client发送请求 |
+
+### 2.2.组件用法
+
+#### 2.2.1.server
+
+##### 2.2.1.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动server，函数执行完成后会停止server，并清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.启动参数
+采用python字典传入
++ host是TuGraph Server的ip和端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导入不同的数据，函数开始执行前会导入数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导出不同的数据，函数开始执行前会导出数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的binlog，函数开始执行前会拷贝binlog到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的db，函数开始执行前会拷贝db到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.启动参数
+采用python字典传入
++ cmd是启动命令，采用python列表传入，可以一次编译多个so
++ so_name是执行完成后需要清理的so，可以是多个，通过python列表传入
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制编译不同的so，函数开始执行前会生成so到指定的目录，函数执行完成后会清理so_name列表指定的动态库
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的snapshot，函数开始执行前会拷贝src中的snapshot到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的目录，函数开始执行前会拷贝src到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的命令
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ result是算法预期的执行结果，执行完成会通过实际结果与预期结果进行比较，不同则测试失败
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的算法逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的算法，函数主体等待算法执行完成后对比结果
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的bash命令，函数开始执行前会开启子进程执行通过cmd参数传入的bash命令，函数主体等待算法执行完成
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.启动参数
+采用python字典传入
++ port是TuGraph Server的端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来链接不同的TuGraph Rest Server，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.测试样例
+
+#### 2.3.1.rest
+
+样例代码中在test_get_info函数执行之前先启动server，server启动后启动了rest client，进入test_get_info函数后获取server的一些信息，并通过assert判断是否有获取到cpu的信息。
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+样例代码中在test_flushdb函数执行之前先执行了数据离线导入逻辑，并启动server后，通过client创建链接，进入test_flushdb函数后，通过查询点的个数判断导入是否成功，导入成功后执行flushDB操作，再次通过assert判断是否能正常清空db
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+     assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+样例代码中在test_export_default函数执行之前先执行了数据离线导入逻辑，导入成功后将当前db的数据导出，然后再次通过离线导入逻辑将exportor导出的数据导入到新的目录中，以新导入的数据启动db，并且创建链接。在test_export_default函数主体中判断导出后再次导入的数据是否与原始数据一致
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.其他测试
+更多用例请参考集成测试代码 [https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration)
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/11.quality/index.rst
new file mode 100644
index 0000000000..9b190aa284
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+测试与质量保障
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..18c9c1daec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,91 @@
+# 如何贡献
+
+## 1. 前言
+感谢您为TuGraph做出贡献，我们由衷地希望有更多社区的同学加入进来，一起建设一个更好的图数据库项目。
+
+对于优秀社区贡献者，我们将颁发TuGraph优秀社区贡献者证书。
+
+## 2. 贡献什么
+我们随时都欢迎任何贡献，无论是简单的错别字修正，BUG 修复还是增加新功能。请踊跃提出问题或发起 PR。我们同样重视文档以及与其它开源项目的整合，欢迎在这方面做出贡献。
+对于任何修改，尤其是较为复杂的修改，建议新建一个issue ，按照BUG或者PR的模板填写。
+
+## 3. 准备工作
+
+### 3.1. 了解TuGraph
+
+建议您从[文档地图](../1.guide.md)开始，了解TuGraph的特性和接口。
+
+### 3.2. 准备环境
+
+对于文档贡献，可以直接通过[文档](https://tugraph-db.readthedocs.io/zh_CN/latest)，点击右上角的"在GitHub上编译"直接修改并提PR。
+
+对于代码贡献，通常需要在搭建编译执行的环境，可以采用[Docker部署](../5.installation&running/3.docker-deployment.md)或[本地部署](../5.installation&running/4.local-package-deployment.md)。
+
+### 3.3. 许可协议
+
+在贡献代码之前，请您稍微花一些时间了解为TuGraph贡献代码的流程，并阅读 [个人贡献者许可协议](3.individual-cla.md) 或 [公司贡献者许可协议](4.corporate-cla.md)，参与贡献则视为同意上述协议。
+
+## 4. 贡献代码流程
+### 4.1. 提交issue
+不论您是修复 TuGraph 的 bug 还是新增 TuGraph 的功能，在您提交代码之前，请在 TuGraph 的 GitHub 上提交一个 issue，描述您要修复的问题或者要增加的功能。这么做有几个好处:
+
+- 不会与其它开发者或是他们对这个项目的计划发生冲突，产生重复工作。
+- TuGraph 的维护人员会对您提的 bug 或者新增功能进行相关讨论，确定该修改是不是必要，有没有提升的空间或更好的办法。
+- 在达成一致后再开发，并提交代码，减少双方沟通成本，也减少 pull request 被拒绝的情况。
+### 4.2. 获取源码
+要修改或新增功能，在提交 issue 后，fork一份 TuGraph  Master代码到您的代码仓库。
+### 4.3. 拉分支
+TuGraph 所有修改都在分支上进行，修改完成后提交 pull request，在 Code Review 后由项目维护人员 Merge 到 Master。 因此，在获取源码步骤介绍后，您需要:
+
+1. 下载代码到本地，这一步您可以选择git/https方式，近年github的权限要求更加严格，比如git方式需要更复杂的ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent))，https方式不能直接使用用户名密码验证，请按照指引授权。 git clone https://github.com/您的账号名/tugraph-db
+2. 拉分支准备修改代码:
+git branch add_xxx_feature 
+3. 执行完上述命令后，您的代码仓库就切换到相应分支了。执行如下命令可以看到您当前分支: git branch -a 
+4. 如果您想切换回 Master，执行下面命令: git checkout -b master
+5. 如果您想切换回分支，执行下面命令: git checkout -b "branchName"
+
+### 4.4. 编译运行
+
+代码的编译运行流程可以参考[ci脚本](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. 配置 Github 信息
+在您的机器执行 git config  --list ，查看 git 的全局用户名和邮箱。检查显示的 user.name 和 user.email 是不是与自己 github 的用户名和邮箱相匹配。
+
+如果公司内部有自己的 gitlab 或者使用了其他商业化的 gitlab，则可能会出现不匹配的情况。这时候，您需要为 TuGraph DB 项目单独设置用户名和邮箱。设置用户名和邮箱的方式请参考 github 官方文档。
+
+### 4.6. 修改代码提交到本地
+
+拉完分支后，就可以修改代码了。
+
+**修改代码注意事项 **
+
+代码⻛格保持一致：TuGraph 通过 cpplint 来保持代码格式一致，IDE可以通过.clang来配置风格。在提交代码前，务必本地检查代码风格，否则ACI将报错。
+
+补充单元测试代码：新有修改应该通过已有的单元测试,应该提供新的单元测试来证明以前的代码存在 bug，而新的代码已经解决了这些 bug ,您可以用如下命令运行所有测试: ./unit_test
+也可以通过IDE来辅助运行。
+
+**其它注意事项 **
+
+请保持您编辑的代码的原有⻛格，尤其是空格、换行等。 对于无用的注释，请直接删除。 对逻辑和功能不容易被理解的地方添加注释。 及时更新文档。 修改完代码后，请按照如下格式执行命令提交所有的修改到本地:
+git commit -am '(feat) 添加xx功能' git commit -am '(fix) 修复xx问题'`
+
+### 4.7. 提交代码到远程仓库
+在代码提交到本地后，接下来就可以与远程仓库同步代码了，执行如下命令提交本地修改到 github 上: git push origin "branchname"
+
+如果前面您是通过 fork 来做的，那么这里的 origin 是 push 到您的代码仓库，而不是 TuGraph 的代码仓库。
+
+提交合并代码到 Master 的请求 在的代码提交到 GitHub 后，您就可以发送请求来把您改好的代码合入 TuGraph Master 代码了。此时您需要进入您在 GitHub 上的对应仓库，按右上⻆的 pull request 按钮。选择目标分支，一般就是 master，系统会通知 TuGraph 的人员， TuGraph 人员会 Review 您的代码，符合要求后就会合入主干，成为 TuGraph 的一部分。 
+
+请注意会自动检查CI，以及所有Commits中的贡献者是否签署了cla，通过后会有绿色的标识。
+
+### 4.8. 代码 Review
+
+在您提交代码后，您的代码会被指派给维护人员 Review，请耐心等待。如果两个工作日后，仍然没有人对您的提交给予任何回复，可以在 PR 下面留言，并 @ 对应的人员。
+
+对于代码 Review 的意⻅会直接备注到到对应 PR 或者 Issue。如果觉得建议是合理的，也请您把这些建议更新到您的代码中。
+
+### 4.9. 合并代码到Master
+
+在代码 Review 通过后，就由 TuGraph 维护人员操作合入 Master，在此过程中维护人员可能会指定新的Reviewer，提出新的意见需要修改。一般这一步不用参与，代码合并之后，您会收到合并成功的提示。
+
+
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..109a1d8f04
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,57 @@
+# 社区角色
+
+## 1. 前言
+本文档描述 TuGraph 社区中成员身份的⻆色，对每种⻆色的要求及权限。 
+
+## 2. ⻆色摘要
+
+这是 TuGraph 社区的⻆色划分，描述了每种⻆色的职责，成为某种⻆色并保持该⻆色的要求，以及相应⻆色的权限。
+
+TuGraph 社区参照 Apache 规范划分为以下三种⻆色：
+
+- Contributor 
+- Maintainer 
+- PMC 
+
+以下描述了每种⻆色的要求、职责和权限。 		 						 					
+## 3. Contributor
+### 3.1. 要求
+在 TuGraph 的任何一个正式项目中成功提交一个 PR 并合并。 
+### 3.2. 职责
+
+- 积极响应指派给您的 Issue 或 PR
+- 一起帮忙回复 Issue 或 PR，把 Issue 分配给对应模块的负责人
+### 3.3. 权限
+
+- 加入 TuGraph GitHub 组织，成为 TuGraph 开源社区的一员。 
+## 4. Maintainer
+### 4.1. 要求
+新的 Committer 由已有的 PMC 推荐，并通过 2/3 以上投票通过，Committer 至少满足以下一个条件：
+
+- 成为社区成员时间超过三个月 
+- 超过 10 个 PMC approve 的 PR 
+- 完成重大功能 
+- 修复严重 Bug 
+- 长期关注项目发展并参与社区讨论
+### 4.2. 职责
+
+- 社区咨询支持
+- 积极响应指派给您的 Issue 或 PR
+- 对于社区重大决定的投票权
+- Review 社区的 PR 
+### 4.3. 权限
+
+- Pull Request review 权限 
+## 5. PMC
+### 5.1. 要求
+
+- 暂不开放，如有强烈愿望请联系PMC
+### 5.2. 职责
+
+- 积极参与社区讨论，对社区重大决策给予指导 
+- 负责保证开源项目的社区活动都能运转良好 
+### 5.3. 权限
+
+- Pull Request review 权限 
+- Pull Request approve 权限 
+- 社区角色成员管理
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..514825b414
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# 个人贡献者许可协议
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..d1f5e1f62d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# 公司贡献者许可协议
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..6668c91d5e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,66 @@
+# 技术规划
+
+## 1. 简介
+
+该文档是 TuGraph-DB 未来开发的规划，包括正在开发中、不在开发计划里、已经开发完成但不在开源版本里的功能等。
+
+TuGraph-DB定位开源高性能图数据库，图数据采用集中存储的方式，短期 **不会** 考虑基于分片（Sharding）的数据切分，
+而将支持主备复制的模式来解决高并发读的场景，采用云上存储解决存储容量的问题。
+
+## 2. 已完成功能
+
+TuGraph-DB于2022年9月1日开源，TuGraph-DB在社区的反馈声中，进行日常BUG修复，自身能力得到了完善。
+
+| 版本号   | 功能                               | 时间         |
+|-------|----------------------------------|------------|
+| 3.3.0 | 开源初版                             | 2022.9.1   |
+| 3.3.1 | 图分析引擎重构，多模式支持                    | 2022.10.14 |
+| 3.3.2 | OGM支持，UT覆盖率提升                    | 2022.11.21 |
+| 3.3.3 | 链接认证机制迭代，加入英文文档                  | 2022.12.23 |
+| 3.3.4 | 支持上云，梳理LDBC SNB Audit流程          | 2023.1.28  |
+| 3.4.0 | 支持OLAP Python API, 离线导入升级        | 2023.3.11  |
+| 3.5.0 | 支持POG，前端升级，文档梳理                  | 2023.6.5   |
+| 3.5.1 | 图学习引擎，Procedure Rust API，存储属性分离  | 2023.7.14  |
+| 3.6.0 | 高可用开源，日志系统升级                     | 2023.8.11  |
+| 4.0.0 | ISO GQL支持，新增11个开源图算法，支持m1 Docker | 2023.9.6   |
+| 4.0.1 | 支持时序边排序，新增5个开源图算法                | 2023.9.28  |
+| 4.1.0 | 支持Bolt协议，支持快速在线全量导入，支持地理空间数据类型   | 2023.12.25 |
+
+除此之外，TuGraph-DB搭建了较为完善的质量体系，涵盖自动化的单元测试、集成测试、性能测试等。
+
+更详细的描述可以在源码目录在的 "[root]/release/CHANGELOG.md" 文件查看。
+
+## 3. 2024年功能更新
+
+在2024年度，我们计划的功能更新包括：
+
+| 版本号   | 功能                 | 计划时间    |
+|-------|--------------------|---------|
+| 4.2.x | HA支持Witness角色和管理工具 | 2024.3  |
+| 4.2.x | Bolt支持流处理和参数化查询    | 2024.3  |
+| x.x.x | GeaX支持Cypher       | 2024.6  |
+| x.x.x | 支持组合索引             | 2024.6  |
+| x.x.x | 数据导入功能优化           | 2024.6  |
+| x.x.x | 【社区功能】支持地理数据类型使用   | 2024.6  |
+| x.x.x | Cypher能力提升         | 2024.9  |
+| x.x.x | 支持Schema快速变更       | 2024.9  |
+| x.x.x | 向量化支持              | 2024.12 |
+| x.x.x | RPQ支持              | 2024.12 |
+| x.x.x | 【可选】查询引擎升级         | 2024.12 |
+| x.x.x | 【社区功能】支持GraphAr    | 2024.12 |
+
+## 4. 期望社区共创的功能
+
+目前团队研发精力并不能实现我们对TuGraph-DB的全部期望，在功能的梳理中，我们发现有一系列值得挖掘的想法，
+团队也有一些初步的探索，期望下面功能能够在社区中共同研发。
+
+| 版本号   | 功能                      | 计划时间   |
+|-------|-------------------------|--------|
+| x.x.x | 图算法库丰富                  | 2024.x |
+| x.x.x | 属性默认值支持                 | 2024.x |
+| x.x.x | Embedded TuGraph-DB最佳实践 | 2024.x |
+| x.x.x | Bolt显式事务支持              | 2024.x |
+| x.x.x | List、Map和Decimal等数据类型扩展 | 2024.x |
+| x.x.x | 探索多存储引擎                 | 2024.x |
+
+一些更加简单的功能，我们会在github的issue中打上 good first issue 的标签，欢迎对图数据库感兴趣的技术爱好者共同研讨。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..f2319d2358
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+贡献者文档
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..addc159170
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# 从关系型数据库导入TuGraph
+
+> 使用 [DataX](../6.utility-tools/7.tugraph-datax.md)，待完善
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..01171c1f11
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,223 @@
+# 使用 TuGraph 图学习模块进行点分类
+
+## 1.简介
+GNN 是许多图上机器学习任务的强大工具。在本介绍性教程中，您将学习使用 GNN 进行点分类的基本工作流程，即预测图中点的类别。
+
+此文档将展示如何构建一个 GNN 用于在 Cora 数据集上仅使用少量标签进行半监督点分类，这是一个以论文为点、引文为边的引文网络。任务是预测给定论文的类别。
+
+通过完成本教程，您可以
+
+使用 TuGraph 加载 cora 数据集。
+
+使用 TuGraph 提供的采样算子采样，并构建 GNN 模型。
+
+在 CPU 或 GPU 上训练用于点分类的 GNN 模型。
+
+此文档需要对图神经网络、DGL等使用有一定经验。
+
+## 2. 前置条件
+
+TuGraph图学习模块需要TuGraph-db 3.5.1及以上版本。
+
+TuGraph部署推荐采用Docker镜像tugraph-compile 1.2.4及以上版本:
+
+tugraph / tugraph-compile-ubuntu18.04:latest
+
+tugraph / tugraph-compile-centos7:latest
+
+tugraph / tugraph-compile-centos8:latest
+
+以上镜像均可在DockerHub上获取。
+具体操作请参考[快速上手](../3.quick-start/1.preparation.md)。
+
+## 3. Cora 数据集导入TuGraph数据库
+### 3.1. Cora 数据集介绍
+Cora 数据集由 2708 篇论文组成，分为 7 个类别。每篇论文由一个 1433 维的词袋表示，表示论文中的单词是否出现。这些词袋特征已经预处理，以从 0 到 1 的范围归一化。边表示论文之间的引用关系。
+
+TuGraph中已经提供了Cora数据集的导入工具，用户可以直接使用。
+
+### 3.2. 数据导入
+Cora数据集在test/integration/data/algo目录下，包含点集cora_vertices和边集cora_edge。
+
+首先需要将Cora数据集导入到TuGraph数据库中，详细操作可参考[数据导入](../6.utility-tools/1.data-import.md)。
+
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+然后进行数据导入：
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式,可参考test/integration/data/algo/cora.conf。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+
+## 4. feature特征转换
+由于Cora数据集中的feature特征为长度为1433的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+
+## 5. 编译采样算子
+采样算子用于从数据库中获取图数据并转换成所需数据结构，具体执行过程如下(如果TuGraph已编译，可跳过此步骤)：
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *  # 导入tugraph-db的python接口模块
+import importlib  # 导入importlib模块
+getdb = importlib.import_module("getdb")  #获取getdb算子
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo) #调用getdb算子
+```
+
+如代码所示，得到算子so文件后，import 导入使用。
+
+## 6. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+训练详细过程如下：
+### 6.1.数据加载
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+如代码所示，根据图数据路径、用户名、密码和子图名称将数据加载到内存中。TuGraph可以载入多个子图用于图训练，在此处我们只载入一个子图。
+
+### 6.2.构建采样器
+训练过程中，首先使用GetDB算子从数据库中获取图数据并转换成所需数据结构，具体代码如下：
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+如代码所示，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+然后构建采样器
+```python
+    batch_size = 5
+    count = 2708
+    sampler = TugraphSample(args)
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(count),
+        sampler,
+        batch_size=batch_size,
+        num_workers=0,
+        )
+```
+
+### 6.3.对结果进行格式转换
+```python
+    src = EdgeInfo[0].astype('int64')
+    dst = EdgeInfo[1].astype('int64')
+    nodes_idx = NodeInfo[0].astype('int64')
+    remap(src, dst, nodes_idx)
+    features = NodeInfo[1].astype('float32')
+    labels = NodeInfo[2].astype('int64')
+    g = dgl.graph((src, dst))
+    g.ndata['feat'] = torch.tensor(features)
+    g.ndata['label'] = torch.tensor(labels)
+    return g
+```
+对结果进行格式转换，使之符合训练格式
+
+### 6.4.构建GCN模型
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+
+def build_model():
+    in_size = feature_len  #feature_len为feature的长度，在此处为1433
+    out_size = classes  #classes为类别数，在此处为7
+    model = GCN(in_size, 16, out_size)  #16为隐藏层大小
+    return model
+```
+本教程将构建一个两层图卷积网络（GCN）。每层通过聚合邻居信息来计算新的点表示。
+
+### 6.5.训练GCN模型
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #如果需要保存模型，则给出模型保存路径
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+如代码所示，根据定义好的采样器、优化器和模型进行迭代训练50次，训练后的模型保存至model_save_path路径中。
+
+输出结果如下：
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+同时，图学习模块可采用GPU进行加速，用户如果需要再GPU上运行，需要用户自行安装相应的GPU驱动和环境。具体可参考learn/README.md。
+
+完整代码可参考learn/examples/train_full_cora.py
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..df74c5c673
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# 数据迁移
+
+## 1. 简介
+   数据迁移是指将数据从一个系统、存储介质或应用程序迁移到另一个系统、存储介质或应用程序的过程。当TuGraph要升级或者系统硬件环境发生变化时，
+需要对原TuGraph服务中的数据进行迁移。以系统硬件环境和软件版本为依据进行划分，本文将数据迁移分为三种方案：
+1. 兼容迁移：当迁移前后系统环境一致且TuGraph软件兼容时，可以直接使用备份恢复的方式迁移数据；
+2. 升级迁移：当迁移前后系统环境不一致或TuGraph软件不兼容时，需要使用先导出数据再重新导入的方式迁移数据；
+3. 在线迁移：当对高可用集群进行数据迁移且集群网络环境良好时，可以使用增删节点的的方式将原集群平滑切换到新集群。
+接下来本文将详细介绍这三种方案。
+
+## 2. 兼容迁移
+兼容迁移指的是在系统环境不变，且TuGraph软件版本兼容时，原服务的数据和存储过程可以在新服务中使用，所以可以直接迁移。
+用户可以先使用`lgraph_backup`工具备份数据，然后将数据传输到新机器中并重启服务。具体迁移步骤如下：
+
+### 2.1. 备份数据
+使用`lgraph_backup`工具备份数据
+```bash
+  lgraph_backup -s db -d db.bck
+```
+本步骤也可以直接使用`cp`命令，不过`cp`命令会拷贝一些多余的元数据，HA模式下也会拷贝raft的元数据导致迁移之后集群重启失败，
+因此建议数据迁移时使用`lgraph_backup`工具替代`cp`命令。
+
+### 2.2. 启动新服务
+使用如下命令启动新服务，存储过程会自动加载到新服务中
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. 停止原服务
+使用如下命令停止原服务
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. 升级迁移
+当用户要把原始服务迁移到一个差异化环境中（比如从centos7迁移到ubuntu18.04），或者TuGraph版本变化较大前后不兼容时（如3.4.0和3.6.0），
+用户可以先使用`lgraph_export`工具将数据导出成文件，传输到新机器中，再使用`lgraph_import`工具重新导入并重启集群。
+这样可以保证在新环境上能够使用，但是效率较低，存储过程也需要重新加载。具体的迁移步骤如下：
+
+### 3.1. 导出数据
+使用`lgraph_export`工具导出数据，并将数据传输到新机器上
+```bash
+  lgraph_export -d db -e db.export
+```
+
+### 3.2. 导入数据
+使用`lgraph_import`工具导入数据，并手动加载存储过程（详见[client操作步骤](../7.client-tools/2.cpp-client.md)）
+```bash
+  lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. 启动新服务
+使用如下命令启动新服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. 停止原服务
+使用如下命令停止原服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. 在线迁移
+当对TuGraph高可用版本部署的服务器集群进行数据迁移时，如果网络带宽充足，可以直接使用增删节点的方式对服务进行在线迁移。具体迁移步骤如下所示：
+
+### 4.1. 拷贝数据
+使用如下命令拷贝leader节点上的数据，并且传输到新集群的机器节点上。由于leader节点上有最完整的raft日志，拷贝leader的数据可以最大程度地减少
+日志追赶的时间。
+```bash
+  cp -r db db.cp
+```
+### 4.2. 启动新节点
+使用如下命令将新节点加入集群，加入集群后，增量数据自动同步到新节点
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. 停止原节点
+停止原节点服务，后续应用请求直接发给新集群
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..dd635f6f27
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# 环境和版本选择
+
+> 该文档介绍如何选择系统环境，以及部署方式
+
+## 1. 简介
+
+TuGraph为不同需求的用户提供了差异化的系统环境和部署方式，来满足新手、系统开发者、生产运维人员、研究人员等不同用户的需求。
+
+## 2. 环境能力选择
+
+用户可以根据实际使用场景，来选择不同的环境。编译环境的能力最完备，所需的第三方软件也越多。与其相对应的，精简运行环境几乎不需要安装任何依赖库，能运行TuGraph除存储过程外的基础功能。
+
+| 环境     | 用途             | 备注        |
+|--------|----------------|-----------|
+| 编译环境   | 从源码编译TuGraph   | 适用于开发人员   |
+| 运行环境   | 运行TuGraph安装包   | 适用于大部分用户  |
+| 精简运行环境 | 运行精简TuGraph安装包 | 对系运行统依赖较小 |
+
+不同环境的具体介绍参见 [链接](../5.installation&running/2.environment-mode.md)。
+
+## 3. 部署方式选择
+
+TuGraph部署仅需一台服务器（高可用模式需要多台），可根据实际资源情况和使用场景，选择适合的部署方式。
+
+| 部署方式     | 描述                   | 备注                                                                                      |
+|----------|----------------------|-----------------------------------------------------------------------------------------|
+| 云部署      | 阿里云计算巢一键部署，免费试用      | 新手适用，流程参考 [链接](../5.installation&running/5.cloud-deployment.md)              |
+| Docker部署 | 通过预先准备的Docker镜像跨平台部署 | 对硬件有要求的用户，比如性能测试，流程参考 [链接](../5.installation&running/3.docker-deployment.md) |
+| 本地部署     | 在现有系统紧耦合部署           | 指定生产环境适用，流程参考 [链接](../5.installation&running/4.local-package-deployment.md)  |
+
+## 4. 后续步骤
+
+部署完成后，后续可以进行[启动服务](../5.installation&running/7.tugraph-running.md)、[数据导入](../6.utility-tools/1.data-import.md)等操作，也可以通过[样例数据](../3.quick-start/2.demo/1.movie.md)来体验整个流程。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..dc5546f1d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+最佳实践
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/14.faq.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/14.faq.md
new file mode 100644
index 0000000000..596cab6378
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/14.faq.md
@@ -0,0 +1,59 @@
+# FAQ
+
+在 TuGraph 使用过程中，如果遇到问题可优先查看[用户文档](https://github.com/TuGraph-family/tugraph-db/tree/master/doc/zh-CN) 。其次，请查看如下 FAQ 列表是否能够匹配您的问题。
+
+1. **[内核引擎 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussion-4575385)**
+
+   1.1 [TuGraph 的边是否支持索引？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165379)
+
+   1.2 [TuGraph 单机的 QPS 是多少？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussion-4575381)**
+
+   2.1 [可视化文件 build 后如何更新到 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165364)
+
+   2.2 [如何通过 npm run dev，连接已有的 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165366)
+
+   2.3 [3.3.0 版本 TuGraph Browser 删除 node label 失败？](https://github.com/TuGraph-family/tugraph-db/discussions/82#discussion-4465791)
+3. **[客户端 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussion-4575378)**
+
+   3.1 [Client 目前有哪些编程语言，是否支持 Node.js？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165351)
+
+   3.2 [Python Client 是否支持 pip install？Client 在哪里进行引用？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165353)
+
+4. **[数据导入 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussion-4575373)**
+
+   4.1 [TuGraph 可以对接哪些常用数据库？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165335)
+
+   4.2 [如何进行数据导入？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[存储过程 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussion-4575369)**
+
+   5.1 [如何加载存储过程或算法包？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165313)
+
+   5.2 [如何调用或执行存储过程？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165317)
+
+   5.3 [开源内置的算法包在哪里？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[安装部署 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussion-4575364)**
+
+   6.1 [如何使用 docker 镜像安装？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165287)
+
+   6.2 [rpm 包和 deb 包安装后，启动 lgraph_server 服务，提示缺少'liblgraph.so'报错？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165289)
+
+   6.3 [如何在 Mac 的 M1 芯片上编译 TuGraph？](https://github.com/TuGraph-family/tugraph-db/discussions/47#discussion-4393165)
+
+   6.4 [安装报错 jemalloc: Unsupported system page size 该如何处理？](https://github.com/TuGraph-family/tugraph-db/issues/477)
+7. **[Cypher QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussion-4575018)**
+
+   7.1 [是否支持不定长边的条件查询？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165252)
+
+   7.2 [如何查询最短路径，shortestPath 函数如何使用？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165256)
+
+   7.3 [查询语句 Where 后使用 and 进行拼接查询速度较慢，语句应如何优化改进？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165260)
+
+   7.4 [如何查询任意跳的边？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165262)
+
+   7.5 [Cypher 是否 date()函数？](https://github.com/TuGraph-family/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+
+   8.1 [报错“User has reached the maximum number of tokens”后该如何处理？](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+如果问题仍然无法得到解决，我们推荐您在[Discussions](https://github.com/TuGraph-family/tugraph-db/discussions)跟帖或发起新贴来描述您的问题。同时 TuGraph QA 大汇总也会根据大家在讨论区发起的帖子，进行定期的更新。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/15.contacts.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/15.contacts.md
new file mode 100644
index 0000000000..e003ef4098
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/15.contacts.md
@@ -0,0 +1,17 @@
+# 联系方式
+
+您有任何对产品的意见和建议，欢迎通过以下联系方式加入讨论，或提出建议。
+
+官网: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue (错误反馈、功能讨论)
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions (技术讨论)
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack (在线开发沟通):
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+通过钉钉群、微信群、微信公众号、邮箱和电话联系我们:
+![contacts](../../images/contact-zh.png)
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..4cbe4ce767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,13 @@
+# 什么是图
+
+> 本文面向初学者，介绍图（Graph）的基本概念。
+
+我们今天介绍的图，是图论中使用点和边表示的图（Graph），而非图像的图（Image）。
+
+![alt what is graph](../../../images/what-is-graph.png)
+
+图的基本元素是点和边，其中点表示事物或实体，边表示点之间的关联关系。
+
+如上图左侧所示，点表示的有公司、员工、项目。边表示的是他们之间的关系，包括：公司和员工之间的雇佣关系，员工和员工之间的好友关系，项目和员工之间的参与关系。除此之外，点和边上可以附加属性，比如员工的工号，雇佣的时间，这样的图是属性图。也就是说，我们可以用图的方式来抽象地表示实体及其关联关系，图有非常丰富的表达能力。
+
+除了上述的员工图谱，图还可以用于金融、工业、医疗等各个领域。在实际应用中，图的规模越来越大，比如金融交易图，点边规模可能到达百亿，与其同时，基于图的查询通常会复杂，最典型的是K跳查询，每增加一跳访问的数据都呈指数增长。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..eeb4dfd11f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# 什么是图数据库
+
+> 本文主要介绍什么是图数据库，图数据库相比于关系型数据库的优势，以及两者特点的对比。
+
+## 1. 图数据库介绍
+
+图数据库是基于图模型的数据库。与关系型数据库相比，图数据库真正注重“关系”。图数据库的主要功能是管理图数据，因此需要支持高效的点、边查询和更新；为方便用户使用，通常还需要增加对事务（transaction）的支持，以确保并发操作下的正常运行。
+
+## 2. 图数据库相比较于关系型数据库的优势
+
+图数据库的功能是传统关系型数据库的扩展。与关系型数据库仅支持的“表结构”相比，图数据库所支持的“图结构”更为灵活。图数据库在基于图的增加、删除、查询和修改方面采用不同于其他数据库的设计。在图数据操作抽象上，采用基于点的视角，例如点通过其所有“出边”（从一个点出发，连接到其他点的边）访问其邻接点。这是图数据库系统设计的核心。
+
+图数据库的独特性体现在以下三个方面:
+
+### 2.1. 性能
+
+在关联关系处理上，使用关系型数据库不可避免地要使用表的JOIN操作，这会对性能产生较大影响；而图数据库则直接跳转访问类指针，操作关联数据的效率更高，比关系型数据库提高2到4个数量级的性能。
+
+### 2.2. 兼容性
+
+现实中，项目进程通常不断演变，数据的内容甚至数据格式也在不断变化。在关系型数据库中，这意味着表结构的变化或建立多个新表，对源数据的修改非常大。而在图数据库中，仅需添加新的点、边和属性，并将其设置为对应的类型即可。从本质上说，一个表代表一种类型的数据，一个点代表一个特定的数据。这意味着关系型数据库更关注数据类型，而图数据库更关注数据个体及其关联关系。
+
+### 2.3. 直观性
+
+使用图的方式表达现实世界的关系更直接和自然，在万物互联的时代尤为突出。如果使用关系型数据，先建立实体表，再建立关系表，最后映射数据，需要高度的抽象思维。在图数据上进行分析查询时，可以直观地通过点边连接的拓扑结构找到所需数据，无需任何专业知识。
+
+## 3. 图数据库与关系型数据库对比
+
+| 分类         | 模型   | 优势                                   | 劣势                                     | 举例           |
+| ------------ | ------ | -------------------------------------- | ---------------------------------------- | -------------- |
+| 关系型数据库 | 表结构 | 数据高度结构化，一致性强，软件成熟度高 | 面向多跳的关联关系查询低效或不支持       | MySQL、Oracle  |
+| 图数据库     | 图结构 | 针对关联关系的建模建模和操作效率非常高 | 高度结构化的数据处理能力不及关系型数据库 | Neo4j、TuGraph |
+
+总之，面对海量数据的存储和处理问题，传统的关系数据库已经无法满足大部分的日常数据存储需求。图数据库技术可以将关系信息存储为实体，灵活拓展数据模型。由于提供了对关联数据最直接的表达方式和图模型对异构数据的天然包容性，图数据库技术必将成为未来最热点的技术之一，为企业提供存储和分析大规模图数据的有力支持。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..41ed5c6aa5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,49 @@
+# 什么是TuGraph
+
+> 本文主要介绍TuGraph社区版的主要功能和特性，以及TuGraph企业版和社区版的差异。
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群，解决了图数据分析面临的大数据量、高吞吐率和低延迟等重大挑战，是蚂蚁集团金融风控能力的重要基础设施，显著提升了欺诈洗钱等金融风险的实时识别能力和审理分析效率，并面向金融、工业、政务服务等行业客户。
+
+## 2. TuGraph社区版
+
+2022年9月，TuGraph单机版开源，提供了完备的图数据库基础功能和成熟的产品设计，支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台。
+
+TuGraph社区版于2022年9月开源，提供了完整的图数据库基础功能和成熟的产品设计（如ACID兼容的事务、编程API和配套工具等），适用于单实例部署。社区版支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台，是学习TuGraph和实现小型项目的理想选择。
+
+## 3. TuGraph特性
+
+TuGraph是支持大数据量、低延迟查找和快速图分析功能的高效图数据库。TuGraph也是基于磁盘的数据库，支持存储多达数十TB的数据。TuGraph提供多种API，使用户能够轻松构建应用程序，并使其易于扩展和优化。
+
+它具有如下功能特征：
+
+- 属性图模型
+- 实时增删查改
+- 多重图（点间允许多重边）
+- 多图（大图与多个子图）
+- 完善的ACID事务处理，隔离级别为可串行化（serializable）
+- 点边索引
+- 混合事务和分析处理（HTAP），支持图查询、图分析、图学习
+- 主流图查询语言（OpenCypher、ISO GQL等）
+- 支持OLAP API，内置30多种图分析算法
+- 基于C++/Python的存储过程，含事务内并行Traversal API
+- 提供图可视化工具
+
+在性能和可扩展性方面的支持：
+
+- 千万点/秒的高吞吐率
+- TB级大容量
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线的备份恢复
+
+## 4. TuGraph企业版
+
+企业版对商业化功能支持更加完善，包括分布式集群架构，覆盖探索、研发、服务、运维管理全生命周期的一站式图平台，在线、近线、离线的图计算引擎，支持流式、大数据类数据源，多地多中心的部署形态，以及专家支持服务等。企业版是商业化解决方案的理想选择。
+
+如需商业支持，请联系我们：
+
+- 电话：400-903-0809
+- 邮件：tugraph@service.alipay.com
+- 官网：https://tugraph.antgroup.com
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..531ab07fde
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/4.schema.md
@@ -0,0 +1,157 @@
+# TuGraph图模型说明
+## 1. 数据模型
+
+### 1.1. 图模型
+
+TuGraph是一个具备多图能力的强类型、有向属性图数据库。
+
+- 图项目：每个数据库服务可以承载多个图项目（多图），每个图项目可以有自己的访问控制配置，数据库管理员可以创建或删除指定图项目。
+- 点：指实体，一般用于表达现实中的实体对象，如一部电影、一个演员。
+    - 主键：用户自定义的点数据主键，默认唯一索引，在对应的点类型中唯一。
+    - VID：点在存储层自动分配图项目中的唯一ID，用户不可修改。
+    - 上限：每个图项目存储最多2^(40)个点数据。
+- 边：用于表达点与点之间的关系，如演员出演电影。
+    - 有向边：边为有向边。若要模拟无向边，用户可以创建两个方向相反的边。
+    - 多条边：两个点数据之间可以有多条边数据。当前TuGraph支持重复边，如要确保边边唯一，需要通过业务策略实现。
+    - 上限：两个点数据之间存储最多2^(32)条边数据。
+- 属性图：点和边可以具有与其关联的属性，每个属性可以有不同的类型。
+- 强类型：每个点和边有且仅有一个标签，创建标签后，修改属性数量及类型有代价。
+    - 指定边的起/终点类型：可限制边的起点和终点点类型，支持同类型边的起点和终点的点类型不同，如个人转账给公司、公司转账给公司；当指定边的起/终点类型后，可增加多组起/终点类型，不可删除已限制的起/终点类型。
+    - 无限制模式：支持不指定边的起点和终点的点类型，任意两个点类型间均可创建该类型的边数据。注：当指定边的起/终点类型后无法再采用无限制模式。
+
+### 1.2. 数据类型
+
+TuGraph支持多种可用于属性的数据类型。具体支持的数据类型如下：
+
+| **数据类型** | **最小值**          | **最大值**          | **描述**                            |
+| ------------ | ------------------- | ------------------- | ----------------------------------- |
+| BOOL         | false               | true                | 布尔值                              |
+| INT8         | -128                | 127                 | 8位整型                          |
+| INT16        | -32768              | 32767               | 16位整型                         |
+| INT32        | - 2^31              | 2^31 - 1            | 32位整型                         |
+| INT64        | - 2^63              | 2^63 - 1            | 64位整型                         |
+| DATE         | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" 格式的日期             |
+| DATETIME     | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD HH:mm:ss[.ffffff]" 格式的日期时间 |
+| FLOAT        |                     |                     | 32位浮点数                       |
+| DOUBLE       |                     |                     | 64位浮点数                       |
+| STRING       |                     |                     | 不定长度的字符串                    |
+| BLOB         |                     |                     | 二进制数据（在输入输出时使用Base64编码） |
+| POINT        |                     |                     | EWKB格式数据，表示点              |
+| LINESTRING   |                     |                     | EWKB格式数据，表示线              |
+| POLYGON      |                     |                     | EWKB格式数据，表示面(多边形)       |
+
+### 1.3. 索引
+
+TuGraph支持对点或边的属性创建索引，以提升查询效率。其特点如下：
+- 索引包括普通索引和组合索引，普通索引基于一个点或边的一个属性创建，而组合索引基于一个点或边的多个属性创建（不超过16个），可以对同一点或边的多个（组）属性创建索引。
+- 如果为点标签创建了唯一索引，在修改该标签的点时，会先执行数据完整性检查，以确保该索引的唯一性。
+- BLOB类型的属性不能建立索引。
+
+TuGraph的点边均有多种索引类型，不同的索引类型的功能和限制不同，具体如下：
+
+#### 1.3.1 普通索引
+##### 1.3.1.1 点索引
+###### 1.3.1.1.1 unique索引
+
+点的unique索引指的是全局唯一的索引，即若一个属性设置了unique索引，在同一个图中，相同label的点的该属性不会存在相同的值，
+unique索引key的最大长度是480bytes，**超过480bytes的属性不能建立unique索引**。
+primary作为特殊的unique索引，因此最大key的长度也是480bytes。
+
+###### 1.3.1.1.2 non_unique索引
+
+点的non_unique索引指的是非全局唯一的索引，即若一个属性设置了non_unique索引，
+在同一个图中，相同label的点的该属性可以存在相同的值。
+由于non_unique索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组vid的最大值。
+每个vid是5bytes长度，因此non_unique索引key最大长度是475bytes。
+但是，不同于unique索引，超过475bytes也可以建立non_unique索引。
+只不过在对这样的属性建立索引时会只截取**前475bytes**作为索引key（属性本身存储的值不受影响）。
+并且，在通过迭代器遍历时，也是先自动截取查询值的前475bytes再进行遍历，
+所以结果可能和预期不一致，需要用户再过滤。
+
+##### 1.3.1.2 边索引
+
+###### 1.3.1.2.1 unique索引
+
+和点类似，边的unique索引指的是全局唯一的索引，即若一个属性设置了unique索引，在同一个图中，相同label的边的该属性不会存在相同的值，
+unique索引key的最大长度是480bytes，**超过480bytes的属性不能建立unique索引**。
+
+###### 1.3.1.2.2 pair_unique索引
+
+pair_unique索引指的是两点间的唯一索引，即若一个属性设置了unique索引，在同一个图的同一组起点和终点之间，
+相同label的边的该属性不会存在相同的值。为了保证pair_unique索引key在同一组起点和终点之间不重复，
+索引在用户指定的key后面加上了起点和终点的vid，每个vid是5bytes长度。
+因此最大key的长度是470bytes，**超过470bytes的属性不能建立pair_unique索引**。
+
+###### 1.3.1.2.3 non_unique索引
+
+和点类似，边的non_unique索引指的是非全局唯一的索引，即若一个属性设置了non_unique索引，
+在同一个图中，相同label的边的该属性可以存在相同的值。
+由于non_unique索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组eid的最大值。
+每个eid是24bytes长度，因此non_unique索引key最大长度是456bytes。
+但是，不同于unique索引，超过456bytes也可以建立non_unique索引。
+只不过在对这样的属性建立索引时会只截取**前456bytes**作为索引key（属性本身存储的值不受影响）。
+并且，在通过迭代器遍历时，也是先自动截取查询值的前456bytes再进行遍历，
+所以结果可能和预期不一致，需要用户再过滤。
+
+#### 1.3.2 组合索引
+
+目前只支持对点的多个属性建立组合索引，不支持对边的属性建立组合索引。组合索引支持唯一索引和非唯一索引两种类型，建立索引的要求如下：
+1. 建立组合索引的属性个数在2到16个之间（含）
+2. 唯一组合索引的属性长度之和不能超过480-2*(属性个数-1)字节，非唯一组合索引的属性长度之和不能超过475-2*(属性个数-1)字节
+
+##### 1.3.2.1 唯一索引
+
+和点的普通唯一索引类似，点的组合唯一索引指的是全局唯一的索引，即若一组属性设置了unique索引，
+在同一个图中，相同label的点的该组属性不会存在相同的值。
+由于底层存储设计，组合索引key需要保存属性的长度，因此，
+组合唯一索引key的最大长度是480-2*(属性个数-1) bytes，**超过的属性不能建立唯一索引**。
+
+##### 1.3.2.2 非唯一索引
+
+和点的普通非唯一索引类似，点的非唯一索引指的是非全局唯一的索引，即若一组属性设置了非唯一索引，
+在同一个图中，相同label的点的该组属性可以存在相同的值。
+由于非唯一索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组vid的最大值。
+每个vid是5bytes长度，因此non_unique索引key最大长度是475-2*(属性个数-1) bytes，
+**超过的属性不能建立非唯一索引**。
+
+## 2. 图项目、点、边、属性命名规则和建议
+
+### 2.1 命名规则
+图项目、点、边和属性是识别符。该节描述了在TuGraph中识别符的允许的语法。
+下面的表描述了每类识别符的最大长度和允许的字符。
+
+|**识别符** |**长度** |**允许的字符**|
+|---------  |---------  |---------  |
+|用户、角色、图项目	|1-64字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+|点类型、边类型、属性	|1~256字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+
+### 2.2 使用限制
+
+|**描述**|	**最大个数**|
+|-------- |--------- |
+|用户数、角色数	|65536|
+|图项目的个数	|4096|
+|每个图项目的点和边类型数量之和	|4096|
+|每个点或边类型的属性数量	|1024|
+
+注：
+1、特殊字符和关键字说明：使用特殊字符或非保留关键字时，需要使用反单引号/backquote（``）进行引用；
+
+示例： ```match (`match`:match) return `match`.id limit 1```
+
+2、大小写敏感性：TuGraph大小写敏感；
+
+3、图项目、点/边、属性名称之间可以重复使用，同一点或边下的属性名称不可以重复；
+
+4、属性名字保留关键字：SRC_ID / DST_ID / SKIP
+
+
+### 2.3 命名建议
+|**识别符**|**描述**|**建议**|
+|-------|-------|--------|
+|图项目	|字母或中文开头	|如graph123、project123等|
+|点/边类型	|字母或中文开头，使用下划线区分单词	|如person、act_in等|
+|属性	|字母或中文	|如name、age等|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..ddb01d4a54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# 性能优先
+
+> 此文档主要介绍 TuGraph 性能优先的设计理念。
+
+## 1.简介
+
+TuGraph目前是世界上最快的图数据库，在图数据库标准评测LDBC SNB Interactive位居榜首（2023.3）。TuGraph的设计基于性能优先，致力于打造高性能的单机图数据库。该文档是TuGraph基于性能优先在存储层的核心设计。
+
+## 2.图操作的特性
+
+在属性图上的操作涉及读、写及其属性，对一些特殊的属性比如时间戳也访问模式也会影响到整体性能。这里通过对一些图操作特性的规律总结，来指导最终的性能。
+
+我们观察到很多图应用有类似的数据访问模式。例如，在信贷风险控制中，我们使用递归路径过滤搜索多对一模式，以找到可疑的信用欺诈用户和行为。针对网络赌博，可以通过识别短时间内的多笔资金转移，来发现涉赌的资金账号。股权穿透场景对实体间的股权关系进行递归计算。这些场景具有多跳实体和关系访问、时间窗口约束和读写事务等常见模式。
+更进一步，从介绍中的讨论和图负载的分析中，归纳出以下特征:
+
+**规律一** KHop是图中最典型的操作，它基于点和边的图拓扑的数据访问模式，和关系型数据库有着本质的区别。KHop 的典型性除了表现在数据访问模式不同，它同时也是图数据库最需要关注的性能点。
+
+**规律二** 图负载的数据访问在拓扑上有一定的局部性，同一个点的边通常会被同时访问。当这些边的标签相同时，有更大的概率会被同时访问。
+
+**规律三** 图负载在访问点边时，通常会访问其对应的属性，来作为遍历过滤的条件。
+
+**规律四** 在基于时序的图负载，对点边的过滤通常是在某个时间范围，比如最近的一周。
+
+**规律五** 写操作可能伴随着大量的读操作，需要在单个事务周期里处理。
+
+通过对实际线上图应用的分析，图负载的读写比率大约为 20:1，虽然场景局限在金融场景，集群数也有限，但涉及的数据规模和用户量非常庞大，具有一定代表性。20:1 的图负载读写比率，说明读工作负载对整体性能的影响更大， 而写工作负载的性能也不能忽视。
+
+## 3.存储数据结构
+
+TuGraph底层采用B+树来支持实时的增删查改事务。
+
+在排序树的数据结构中，B+树和LSM树为主要代表。B+树在树节点中使用拆分和合并式来更新排序数据，而 LSM 树在日志中追加更新，以进行延迟数据合并。B+ 早期用在文件系统的实现中，通过将数据保存 在自适应长度的叶子节点中，解决硬盘顺序操作和随机操作性能存在数据量级差别的问题，有较均衡的读写性能。LSM 树的主要优势使用 WAL(Write Ahead Log) 进行更新，将更新操作变成顺序操作，在键值较小时性能优势尤为突出。WAL 意味着将数据的更新合并推迟，批量更新能提升综合效率，也使得系统的调度变得复杂。如果更新合并完成前，恰好对其中的数据继续读取，LSM 树就需要读取几个层级局部合并的日志，会导致读取放大和空间放大，从而影响读效率。
+
+总结来说，B+ 树有较好的顺序读写性能，而 LSM 树在数据随机写方面占优。此外 LSM 树采用后台合并的方式，使得性能的波动难以预期，性能波动和上层存储和计算的关联性较弱，增加了整体设计的成本。综上考虑，TuGraph 选用 B+ 树作为读性能优先的实现。
+
+## 4.数据编码
+
+对于属性图模型而言，除了图拓扑编码外，属性数据也会很大程度影响功能和性能，我们先讨论属性数据如何与拓扑数据共存的编码格式。从目前的调研来看，属性编码有两种方式，我们称之为基于指针索引将属性数据单独存储的离散编码，和将属性数据和拓扑数据打包在一起的紧凑编码。离散编码根据程度的不同，可以每个属性都单独存储，或者每条边的属性打包后各自存储，下面的讨论对两种情况都适用。
+
+点查询。属性编码主要针对边，不涉及点查询。
+
+单边查询。离散编码通过指针定位边，紧凑编码则需要二分查找定位边的位置，离散编码有略微的优势。
+
+边遍历。离散编码在边遍历过程需要不断地进行指针跳转进行随机数据访问，而紧凑编码提前把数据排列在一起，顺序访问的特性使得效率大大提升。 由规律三知对边的遍历操作很普遍，紧凑编码在边遍历的优势明显。
+
+单边更新。离散编码对边的更新仅需找到对应的指针位置，插入数据后修改前后指针指向。紧凑编码则需要对紧凑排列的数据进行重编码，对整个边值进行重新写入，开销显著大于离散编码的情形。
+
+批量边更新。批量更新可以在内存中预先构建点的所有边属性，一次性编码写入，离散编码和紧凑编码相当。但紧凑编码不需要存储指针变量，更少的存储空间效率也会更高。
+
+以上离散编码和紧凑编码在某一类的查询的性能问题，可以通过优化的来缓解。整体上说，由于图负载读写 20:1 的特性，读性能在整体性能中占比更高。以及规律三所揭示的对属性访问的特征，TuGraph 更倾向于采用紧凑编码来保证读性能。其主要弱势为单边更新时重编码的开销，可以用自适应映射的技术来解决。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3f89389b2b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,34 @@
+# 多层级接口
+
+
+> 此文档主要介绍 TuGraph 的多层级接口的设计理念。
+
+## 1.简介
+
+多层级接口是 TuGraph 针对多丰富的使用场景，在易用性和高性中作出的平衡。比如描述式图查询语言 Cypher 能够抹去图数据库实现的细节，基于图模型的抽象来进行表达。Cypher 过于高层的表述，无法高效转化成底层的执行，因此提供了 Procedure API 的过程式语言，来发挥图数据库的最佳性能。
+
+接口可以大致分为客户端接口和服务端接口，大部分操作都在服务端完成，客户端只做数据的封装和解析。客户端和服务端通过网络连接，TuGraph 支持更加灵活的短连接 REST 协议，以及更加高效的长链接 RPC 协议，可根据不同的业务场景来选择。
+
+服务端接口均处在计算层，和图数据存储间用一层 Core API 在逻辑上隔开。
+
+![多层级接口架构](../../../../images/multi-level-Interfaces.png)
+
+## 2.客户端接口
+
+客户端接口指在客户端执行的接口，通常用于集成到软件应用中。TuGraph 的客户端的接口比较简单，包括登录登出、数据导入导出、存储过程加载调用、Cypher操作等。其中 Cypher 中集成了大部分的功能，包括数据操作、图模型操作、运维管理、账户管理等。
+
+由于 Cypher 的参数和返回值都是字符串，JAVA OGM 是对 Cypher 的结构化封装，即查询结果能够被封装为一个有类型的对象，方便使用。
+
+## 3.服务端接口
+
+服务端接口包括描述式图查询语言 Cypher、过程式图查询语言 Procedure API、图分析编程框架 OLAP API 和图神经网络编程框架 GNN PI，为图事务引擎、图分析引擎、图神经网络引擎提供服务，下面先展开介绍各个接口的特点。
+
+> __描述式图查询语言__ 是对查询逻辑的抽象描述，而与执行逻辑无关，对图数据库应用者比较友好，类比关系型数据库的 SQL 语言。TuGraph 的 Cypher 语言主要依照 Neo4j 开源的 OpenCypher 查询标准，同时对运维管理等辅助功能进行了扩展，在功能上囊括了 TuGraph 的大部分操作。描述式图查询语言会成为图数据库的主要数据操作方式，但由于描述到执行之间需要生成执行计划（Execution Plan），生成最优执行计划在学术界和工业界均有很长的路要走。
+
+> __过程式图查询语言__ 是为了解决描述式图查询语言与最优性能间的鸿沟。TuGraph的 Procedure API 是在 Core API 上做了一层简单的封装，C++ Procedure API的灵活性和高效性能够充分发挥存储的极致性能，也是 Cypher 优化的上限性能。Python Procedure API 是 C++ Procedure API 上的一层跨语言封装，翻译过程中值的拷贝会带来一定的性能损失，优势则主要是 python 语言本身的易用性。raversal API 是并行执行的 Procedure 接口，描述上更接近于集合的操作，比如扩展点集合所有出度邻居，获得一个新的点集。
+
+> __图分析编程框架__ 属于 ‘图计算系统’ 的范畴，会将图数据从支持增删改查的存储中导出快照，以更紧凑的数据存储格式来支持只读的复杂图分析，这里叫做OLAP API。OLAP API 封装了高并发执行的数据结构，包括 Vector、Bitmap等，以及基于 CSR 格式的图快照数据结构，然后提供一套并发的快速点边操作框架。在图分析任务完成后，数据可以通过接口写回图数据库。
+
+> __图神经网络编程框架__ 主要提供了图神经网络应用编程所需要的接口，能够对接PyTorch 等机器学习框架。TuGraph 的图神经网络编程框架主要集成了 DGL，在 Python 的语言环境中完成从图存储到图神经网络应用的完整流程。
+
+除了 Cypher 是解释执行外，其余服务端接口都是编译执行，即需要将对应代码传到服务端后，进行编译（可能会有时间开销），再在服务端执行。所以通常需要先加载，然后再已加载的应用列表中找到程序，传输入参数后执行。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..e895545616
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> 此文档主要介绍 TuGraph 的HTAP的设计理念。
+
+## 1.简介
+
+![htap架构](../../../../images/htap.png)
+
+HTAP 的实现在架构上有多种不同的方式：一是用两个不同的副本来分别处理 OLTP 和 OLAP 的任务，核心是数据的一致性同步和额外的资源开销；二是在任何时候都使用同一份数据存储，该实现的数据结构存在内存膨胀，在工业化落地还需要进一步工作。在 TuGraph 的设计中，简单的 OLAP 操作和 OLTP 操作共用一份数据，而复杂的 OLAP 操作则单独导出快照处理。
+
+## 2.设计
+
+在 TuGraph 中，OLTP 为图事务引擎，在图 4.4对应事务操作；OLAP 为图分析引擎，对应简单图分析操作（比如 SPSP）和复杂图分析操作（比如 PageRank），前者可以直接在图存储上执行，而后者需要额外导出快照执行。
+
+- 事务操作，即图事务引擎测的操作，为局部图的增删查改操作，典型的应用为 K 跳访问 K-Hop。
+- 简单分析操作，是图分析引擎中较为简单的部分，通常也是局部的图分析操作，比如两点间最短路算法 SPSP、Jaccard 算法。
+- 复杂分析操作，是图分析引擎中较为复杂的部分，通常涉及全图的多轮数据迭代操作，比如网页排序算法 PageRank、社区发现算法 Louvain。
+
+如架构图所示，我们在图中增加了外部存储，使得图分析的数据源不局限在图数据库中，可以直接从文本文件读取。
+
+- 图存储，即图数据库中的存储，有精心设计的数据结构，能够完成实时增删查改。
+- 外部存储，可以是 RDBMS 或文本文件，以边表的简单方式存储，仅供一次性批量读取，和批量结果写入。在计算层，和整体架构图中的接口对应。
+- Cypher，描述式图查询语言，可以并发执行。
+- Procedure API，过程式图查询语言，其灵活性能够同时支持事务操作和图分析操作，但效率上不足以完成复杂图分析操作，可以并发执行。
+- OLAP API，针对多轮迭代的复杂图分析。应用需要先将存储中的图数据导出成内存中的一个快照，该快照仅用来快速访问，而不需要考虑 ACID 的写支持，因此可以排布地更加紧凑，CSR 排布的读效率要远高于图存储的数据排布。OLAP API 只能串行执行，每个操作都用满 CPU 资源。
+
+OLAP API 的快照可以从外部存储创建，即将边表数据构成件 CSR 的格式；或者从图存储中创建。需要注意的是，OLAP API 要求点的 ID 是连续的自然数，可能需要额外的 ID 映射，该步骤在创建快照时可以在指定一个属性进行映射，或直接取属性值作为 ID。
+
+与计算接口和存储相对应，有四种运行模式。
+
+- 事务模式，每个操作对应一条 Cypher 语句，默认是一个事务。
+- Plugin 模式，通过插件的方式，在计算逻辑加载到服务端后调用，也叫存储过程。
+- Embed 模式，和 Plugin 模式的使用接口一致，区别是图数据库服务不需要起来，就可以直接用接口调用数据库中的数据，通常用于调试 Procedure API 和OLAP API 的代码，调试信息和操作步骤比 Plugin 模式更加友好。
+- Standalone 模式，最大程度剥离与图数据库的关系，仅想用图分析引擎做数据分析时，该模式会比较直接。Standalone 模式会直接使用外部存储的数据。
+
+图神经网络引擎的使用方式和 ‘复杂图分析操作’ 类似，会同时调用部分 OLAP API 和 GNN API，不在这里展开。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..c055f3df01
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,10 @@
+产品特点
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
+    
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..cf901d31cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# TuGraph产品架构
+
+> 此文档主要介绍 TuGraph 的产品架构。
+
+## 1.简介
+
+![产品架构](../../../images/architecture.png)
+
+上图从功能模块的角度，以 TuGraph 为例，给出了企业级图数据库的整体架构，自下而上包括：
+
+- 软硬件环境。涉及图数据库的开发和使用环境。TuGraph 主要基于底层的 C++语言开发，能够兼容市面上大部分操作系统和 CPU。
+- 存储层，包括 KV 存储层和图存储层。存储层需要支持计算层所需的各个功能。
+- 计算层。计算层应包括图事务引擎、图分析引擎和图神经网络引擎，也包含了服务端提供的多种编程接口，包括描述式查询语言 Cypher，存储过程等。
+- 客户端。客户端 SDK 应支持 Java、Python、C++ 等多种语言，也支持命令行的交互方式。Browser 和 Explorer 通过网页端交互的方式，降低了图数据库的使用门槛。
+- 在生态工具方面，覆盖了企业级图数据库的开发、运维、管理等链路，提升可用性。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..c24881b9cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/7.functionality.md
@@ -0,0 +1,110 @@
+# 功能概览
+
+> 此文档主要介绍 TuGraph 的主要功能和特性。
+
+## 1.安装部署
+
+## 1.1.部署方式
+
+TuGraph目前提供云部署、Docker部署以及安装包部署三种部署方式，用户可根据实际情况选择适合的部署方式。
+
+## 1.2.软硬件环境
+
+TuGraph核心是由C++开发，默认使用的编译器为GCC8.4，使用c++17标准。此外，存储过程中额外提供了Python Procedure API，该功能需要Python环境。TuGraph不需要特殊的硬件比如GPU，对RDMA、HBM等高延迟低带宽的通用硬件升级可以天然适配。
+
+TuGraph测试过基于X86和ARM的CPU，包括Intel、AMD、Kunpeng、Hygon、飞腾等，也同时在多个操作系统上运行，包括Ubuntu、CentOS、SUSE、银河麒麟、中标麒麟、UOS的主流版本，对操作系统和CPU没有特殊的要求。
+
+软硬件环境也包括依赖库的环境，由于TuGraph的存储层中默认的KV存储是LMDB，需要文件系统能够支持POSIX接口。在不同的环境下编译和参数配置会略有不同，比如在图存储的点边数据打包中，应和操作系统的页表大小匹配，默认为4KB，建议将系统的页表大小也设置为4KB。
+
+## 2.存储层
+
+在图数据模型上，TuGraph支持属性图模型，按照层次可以分为子图、标签（包括点标签和边标签）、属性。从存储层看，TuGraph使用使用直观的多层的树状模型，没有跨子图的标签，也没有跨标签的属性，仅保留图模型的核心逻辑。
+
+在子图的存储上，TuGraph对多图做了数据的物理隔离，每个图对应一个LMDB的实例。多图的元数据描述信息，保存在meta的特殊的公共LMDB实例中。点边标签及其属性的存储，通过将图数据自适应地映射到KV键值对，最大程度发挥读性能。同时在KV层实现了多线程写，解决了LMDB写性能较低的劣势。主键索引和二级索引，对应LMDB中B+的表，支持基于比较的索引值增删查改。
+
+存储层还保留了一些其他非核心功能的数据，包括权限数据、预编译的插件数据、监控数据等。
+
+## 3.计算层
+
+计算层在功能上分成三个部分，包括TP类的图事务引擎，AP类的图分析引擎和图神经网络引擎。
+
+- __图事务引擎__，主要用来处理并发的图操作，包括单点查询、邻居查询、路径遍历。图事务引擎侧重并发操作的ACID事务，确保操作逻辑不会互相干扰，主要性能指标为 QPS，即每秒完成的查询数量。
+
+- __图分析引擎__，操作类型通常为全图迭代。部分简单的分析任务（比如SPSP）可以由图事务引擎完成，复杂的分析任务均由图分析引擎完成，单个任务通常需要数秒至数小时。因此单个图分析任务要并发利用所有的硬件资源，性能指标为任务完成的总时长。
+
+- __图神经网络引擎__，通常也为全图迭代。图神经网络引擎除了基于图拓扑的操作，也需要集成一个机器学习的框架来处理向量操作，比如 PyTorch、MXNet、TenserFlow。
+
+三个引擎的操作逻辑不尽相同，独立配置资源池。事图事务引擎基于RPC操作设置了一个线程池，每接受客户端的一个操作，从线程中取一个线程来处理，并发执行的数量等于RPC线程池的容量，通常配置为服务器的核数。图分析引擎有一个分析线程池，每个图分析任务会并发执行，即用所有的线程来执行一个任务，来加速操作的性能。TuGraph图分析操作串行执行的特性会一定程度限制用户的使用体验，并发的图分析的需求可以通过高可用部署的方式，增加机器资源来处理，或者接入外部的任务调度器，将数据传到实时调度的容器来计算。图神经网络操作在图上的操作会复用图事务引擎或图分析引擎的资源，向量的操作会起单独的资源，在机器学习框架中可以使用GPU等单独的加速硬件。
+
+## 4.核心功能
+
+### 4.1.查询语言
+
+TuGraph 提供 Cypher 图查询语言，遵循OpenCypher标准。
+- __支持Procedure嵌入__
+
+- __可插拔优化框架__ 各类优化功能
+
+- __可扩展安全性检查框架__ 对于cypher进行
+
+### 4.2.存储过程
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个 REST 请求并在客户端完成整个
+处理流程的方式，TuGraph 提供的存储过程（Procedure）是更简洁和高效的选择。
+
+从 3.5 版本开始，TuGraph 重新设计了新的存储过程编程范式，支持定义标准的签名和结果，支持POG编程。
+
+TuGraph 支持 POG (Procedres on Graph Query Languages) 编程和 POG 库，其中“Graph Query Languages”包含 Cypher 以及
+制定中的 ISO GQL 等图查询语言。POG 库提供在查询语言中对用户定义的存储过程的访问，打破了查询语言和存储过程之间的界限，扩展了查询
+语言的使用范围。
+
+> 这个文档描述了 [新的 Procedure 编程范式以及 POG](../9.olap&procedure/1.procedure/1.procedure.md)。
+
+### 4.3.数据导入导出
+
+尽管TuGraph本身支持数据的插入，但批量导入能够大幅提升的效率。导入的功能可以分为空库导入（离线导入）和增量导入，前者指子图是空的时候进行导入，额外的假设能够大幅提升导入的性能，在 TuGraph 中，空库导入和增量导入的吞吐率差了10 倍。在数据导出中，需要考虑导出数据的一致性，即是基于一个快照数据导出的。
+
+TuGraph 可以通过 命令行工具`lgraph_export` 来对已经存放在TuGraph的图数据进行数据导出，导出格式支持CSV和JSON。
+
+### 4.4.备份恢复
+
+TUGraph的备份在功能上可分为主动/定时、离线/在线、全量/增量备份，用尽量小的存储和计算代价来完成备份。恢复功能可以恢复到最新的状态，或者历史标注的时间点，需要保证数据库是一致的状态。
+
+### 4.5 数据预热
+
+TuGraph 是基于磁盘的图数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+### 4.6 高可用
+
+高可用是指通过通过集群配置，做到实时多副本数据热备，在部分副本不用时，集群仍然能正常提供服务，TuGraph采用 RAFT 协议的多机热备机制，能够将 RPO 降低到接近 0 的程度。TuGraph 选择在计算层进行数据同步，同步的对象是写操作，通过 RPC 接口快速同步。TuGraph 的高可用集群采用主从模式，只有主节点处理写请求，主从节点均能处理读请求。主节点的写请求处理需要同步到多于二分之一的总节点上，多数节点写成功，该写请求才算完成。
+
+## 5.客户端工具
+
+客户端主要分为各种编程语言的SDK，OGM以及命令行工具。
+
+客户端 SDK 主要用于二次开发，可以通过 RPC 或 REST 协议链接服务端。RPC 基于长链接有较好的性能，数据需要通过 protobuf 统一序列化。TuGraph 使用brpc，支持 Java、Python、C++ 的 rpc 客户端。REST 的协议比较宽泛，能够简单适配更加多样的环境，不同的编程语言能够简单对接。TuGraph 给出了 Python 的REST 客户端实例，命令行的交互也是用 REST 实现。
+
+OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。
+
+命令行工具`lgraph_cypher`是查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+
+## 6.生态工具
+
+生态工具是企业级数据库一个非常重要的组成部分，丰富的生态工具能够大大提升图数据库的可用性，稳定性。
+
+### 6.1.TuGraph DataX
+
+![导入导出](../../../images/tugraph-datax.png)
+
+TuGraph 核心支持 CSV 和 JSON 合适的导入导出，提供空库导入和增量导入的模式。实际中会存在 MySQL、Kafka、Hive 等多数据源导入的需求，TuGraph 通过 DataX 做多数据源的对接。由于关系模型和图模型存在的差异，数据清洗的流程可以使用 SparkSQL 快速处理，TuGraph 本身仅关注 CSV 和 JSON 的简单场景导入可靠性和性能。
+
+### 6.2.可视化交互
+
+TuGraph Browser 是面向图数据库直接使用者的可视化交互界面，功能上覆盖了 TuGraph 的绝大部分能力，包括数据导入、图模型建立、数据增删查改、监控运维等操作链路。
+
+### 6.3.运维监控
+
+TuGraph 使用 Prometheus 加 Grafana 的监控框架，采用松耦合的方式。Prometheus 从 TuGraph 的监控接口获取监控信息，存储在本地时序数据库中，然后通过 Grafana 在网页端交互展示。
+
+TuGraph 提供的监控的状态包括图数据库的状态和服务器的状态，前者包括读写负载、点边数量等数据库端的状态，后者包括内存、CPU、硬盘等服务器的实时状态。如果某些监控状态超过了预期的阈值，就需要主动告警，通常需要对接其他运维管控系统，比如群消息、邮件告警等。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..4cc5c0c10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# 应用场景
+
+> 此文档主要介绍图数据库适用的应用场景。
+
+## 1. 金融领域
+
+金融领域的实体主要涉及人、公司、账户、产品等，它们之间的关系包括交易关系、登录关系、股权关系、雇佣关系等。这些实体构成了一张金融图数据网络。应用图数据库，我们可以从金融图数据网络里发掘出大量有用信息，帮助我们做出更准确的金融决策。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|贷款审核|通过分析申请人的关联关系、交易情况等辅助判断申请人的偿还能力和偿还意愿，可应用于零售贷款审核、小微贷款审核、供应链金融等。此方法可与传统的基于申请人自身信息的审核机制互补，在个体信息录覆盖较低的小微贷款审核中尤其有用。|
+|贷后管理|通过分析借款人交易情况，辅助分析借款人是否有逾期风险。相比于传统只在贷款资金流向特定用户的情况下发出警报的方式不同，该方法可以给每个账户赋予一个风险值，并在贷款流向高风险账户时给出预警。|
+|失联修复|通过分析失联贷款人的社交和购物数据，找出其它联系方式。该方法可以大幅改进失联修复率。|
+|担保环检测|可在担保关系图中找出环状、链式、家族式、交叉等特殊担保结构，揭露潜在风险。相比于关系型数据库的JOIN方法，基于图算法的方案更高效，可以检测出任意长的担保环，且可以实现更复杂限定条件的检测。|
+|信用卡团伙欺诈检测|构建信用卡申请信息中的地址、联系方式等关系网络，在申请关系网络中运行社区发现算法，可以检测出疑似欺诈的团伙，从而拒绝涉嫌欺诈的申请件，减少经济损失。|
+|反洗钱|通过交易网络和介质网络，找出疑似洗钱的行为和链路。洗钱是一个复杂的多方参与的过程，通过在交易和社交网络中进行图分析，我们可以更精准的检测出洗钱行为。|
+|车险反欺诈|针对有修理厂参与的骗保行为，通过分析被保人、案件地点和修理厂之间的关系，可以更精准的识别出骗保行为，减少经济损失。|
+
+## 2. 工业领域
+
+在生产和制造过程中会产生大量异构数据，如何有效的组织和管理这些数据是工业大数据中最重要的问题之一。这些数据包括设计文档、设备数据、仿真方案和结果、实验结果、经验文档等，关系错综复杂。传统的数据管理系统只能累积数据，而查找相关材料则往往力不从心。使用图模型，将这些不同类型的数据组织成一张网络，就可以方便地浏览和查找数据。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|供应链管理|供应链数据主要关心产品—部件—零件的对应关系、零件与供应商的对应关系、零件中的敏感成分等。相比于传统的物料管理（BOM）系统，使用图数据库的方案可以更方便地维护多个部件层次、多个供应商级别的复杂网络，从而为穿透式供应链提供基础支持。|
+|文档管理|使用图数据库可以将不同类型的文档按不同关系有机地组织在一起。例如将部件设计文档、部件—零件关系、部件测试文档、相关经验文档等组织起来，在需要查找时就可以方便获取该部件的所有相关信息。|
+|研发过程管理|产品研发和验证过程中需要进行大量仿真、试验和测试，每一个测试流程都会涉及大量不同的步骤。步骤之间的连接关系、每个步骤中使用的数据版本、算法版本等就构成了一张复杂的关系网络。使用图数据库可以更好管理这个关系网络，从而为研发过程中的数据复用、流程改进提供良好基础。|
+|设备信息管理|制造业需要管理大量设备，设备之间又互相关联（供电关系、供料关系、空间关系），从而形成了一张复杂的网络。传统的数据库很难体现这种复杂关系。而使用图数据库则可以便捷表示这些关系，从而更好的管理设备信息。|
+
+## 3. 智慧城市
+
+随着科技的发展，城市的智能化管理已成为一个大趋势。智能化管理需要建立在良好的信息管理平台之上，因此需要强大的系统软件做支撑。在智能化城市管理系统中，智能化决策系统需要基于大量不同信息做出决策，这些信息包括各种拓扑信息（道路、管线），供求信息（电力输送、饮用水供应、污水排放），环境信息（温度、湿度、雨量）等。要将这些复杂的异构数据有机管理起来，并基于它们做出决策，就需要一个成熟的系统。传统的数据管理系统基于关系数据模型，并不适合管理这种复杂异构数据。而使用图模型就可以很好的解决这一问题。如果我们将这些不同的数据利用图数据库进行管理，就可以实现很多复杂的智能管理场景。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|智能交通|基于道路拓扑、道路容量及当前流量，可以进行智能信号灯调度，从而提高通行效率。|
+|智能排水|基于排水系统信息及当前雨量，可以对排水系统进行调度，从而减少内涝的产生。|
+|管线管理|将管线的生产、安装、拓扑信息，以及历史状态信息有机组织起来，可以帮助我们对管线进行全周期管理，包括故障排查、寿命评估等。|
+|人群疏散|大量人群需要疏散时，需要考虑公交、地铁、出租车、共享单车等多种交通方式，同时还需要考虑道路承载量。使用图数据库将这些信息有机整合在一起，可以帮助我们更好的做出决策，以便为大型公共活动提供更好的支持。|
+
+## 4. 社会治理
+
+社会治理包括公共安全、法律事务、舆论、网络安全等多方面。社会治理是一个综合性的、多系统联动问题。它需要综合大量数据、全局考量才能做出更好的决策。在这种多维度复杂数据问题上，图数据模型可以提供更好的适应性，从而为智能化的社会治理决策平台提供坚实的基础。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|犯罪团伙发现|合谋团伙必然会通过某些方式产生联系，这种联系包括面谈（出现在同一地点）、电话联系、或者互联网联系，他们还可能有经济往来。如果我们将这些数据统一存放在一张图中，我们就可以通过图分析算法查找出联系紧密的群体，从而发现和识别整个犯罪团伙。|
+|涉众案件调查|涉众案件，特别是涉众经济案件往往涉及大量的人员和要素（货币、地点、事件等）。如何有效的组织这些资料，从而为办案提供证据支持是涉众案件调查的一个难点。使用图数据库来存储和分析这些资料，可以让我们快速定位资料、分析人员构成、为案件调查提供更好的技术支持。|
+|违法网站甄别|违法网站、钓鱼网站、黄色网站等往往通过使用不同的域名和IP来避免被封杀。基于黑名单的过滤方法只能封禁已知的违法网站，无法对新出现的域名和IP进行有效甄别。基于IP—域名网络的映射关系，我们可以建立一张图，然后通过图计算建立起域名和IP的“可信度”模型，利用该模型来判断网站是否属于违法网站。|
+|法院卷宗管理|卷宗往往错综复杂，不同的案件之间可能通过当事人产生联系，也可能通过案发地、案件性质、审判人员等产生联系。这些联系构成了一张复杂的网络。使用图数据库我们可以更方便的管理这些复杂关系，提高办案和查询效率。|
+
+## 5. 互联网
+
+人—人关系的社交网络、人—商品的购买关系都能构成图。通过分析这些网络数据，我们可以为用户提供更优质的服务，包括相关推荐、用户信息归集、重要用户识别、垃圾用户识别等。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|ID映射|图数据库可以将用户相关的所有信息，包括用户之间的关系统一存储在一个数据库中，同时还能通过这些关系来找出疑似单人多号和多人一号的情况，从而为后期的风控、推荐等业务提供决策支持。|
+|好友推荐|基于分析社交网络，我们可以提供“好友的好友”，“共同好友”等好友推荐。|
+|商品推荐|基于用户—商品关系图，我们可以找出兴趣爱好类似的用户，向他们推荐类似用户选择的其他商品。|
+|垃圾用户识别|传统的垃圾用户识别主要基于用户账号本身的信息，如注册信息、发帖信息等，但是这些信息都比较容易伪造。而基于网络的信息则不存在这个问题：它们很难被伪造。因此基于网络信息的垃圾用户识别可以更加精准和高效。|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..5171d5ece8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/9.glossary.md
@@ -0,0 +1,38 @@
+# 名词解释
+
+## 1.图技术
+
+> __图计算__：广义图计算，技术上包括图查询、图分析、图学习；狭义图计算，包括图计算任务和图分析。
+
+> __图查询__：指图数据库的查询能力，通常通过Cypher/ISO GQL等查询语言实现。
+
+> __图分析__：侧重于对全图数据的算法分析、模式分析等。
+
+> __图学习__：与图神经网络、图机器学习含义相同。
+
+> __图智能__：等于广义图计算，包括图数据库、图分析、图学习，通常用于概念推广，不用于产品。
+
+## 2.图产品
+
+> __图计算系统__：一般包括图数据库、图分析系统、图学习系统，有时也特指图分析系统。
+
+> __图数据库__：侧重于对图数据的增删改查、事务性操作等，如TuGraph DB、Neo4j、JanusGraph等。
+
+> __图分析系统__：解决图分析问题，可以细分为流水图分析、离线图分析，如TuGraph Analytics、GraphX等。
+
+> __图学习系统__：解决图学习问题，比如TuGraph Learn、DGL等。
+
+## 3.具体概念
+
+
+> __Vertex__：点，也叫顶点，也指 Vertex Value。尽量避免Node（结点、节点）的叫法，一般用Node表示服务器个数，容易叫混。结点指结合、交结、交叉的意思；节点可以指一个时间线上的里程碑（关键节点）或计算机系统里的一个处理实体（如计算机网络里的一台服务器）。
+
+> __Edge__：边，也指 Edge Value。
+
+> __Vertex Label__：点类型，也叫 Vertex Type。
+
+> __Edge Label__：边类型，也叫 Edge Type。
+
+> __Degree__：度，入度/出度，表示一个点的入边、出边的条数。注意，在非图论的场景中，往往把“跳”也称作“度”。
+
+> __Hop__：跳，表示一个点到另一个点之间的路径经过的点数（不含起点、含终点）。算法性能测试里K-Hop即为此义。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/index.rst
new file mode 100644
index 0000000000..efe03a5128
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph入门
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..f8ce47e572
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/1.preparation.md
@@ -0,0 +1,88 @@
+# 快速上手
+
+> 此文档主要用于新用户快速上手，其中包含了 TuGraph 的简介、特征、安装和使用。
+
+## 1.简介
+
+TuGraph 是蚂蚁集团自主研发的大规模图计算系统，提供图数据库引擎和图分析引擎。其主要特点是大数据量存储和计算，高吞吐率，以及灵活的 API，同时支持高效的在线事务处理（OLTP）和在线分析处理（OLAP）。 LightGraph、GeaGraph 是 TuGraph 的曾用名。
+
+主要功能特征包括：
+
+- 标签属性图模型
+- 支持多图
+- 完善的 ACID 事务处理
+- 内置 34 图分析算法
+- 基于 web 客户端的图可视化工具
+- 支持 RESTful API 和 RPC
+- OpenCypher 图查询语言
+- 基于 C++/Python 的存储过程
+- 适用于高效图算法开发的 Traversal API
+
+性能及可扩展性特征包括：
+
+- TB 级大容量
+- 千万点/秒的高吞吐率
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线备份
+
+
+### 1.1.支持的平台
+
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的的平台。
+
+### 1.2.硬件要求
+
+_目前我们建议用户使用 NVMe SSD 配合较大的内存配置以获取最佳性能。_
+
+| 硬件   | 最低配置      | 建议配置                     |
+|------|-----------|--------------------------|
+| CPU  | X86_64    | Xeon E5 2670 v4          |
+| 内存   | 4GB       | 256GB                    |
+| 硬盘   | 100GB     | 1TB NVMe SSD             |
+| 操作系统 | Linux 2.6 | Ubuntu 18.04, CentOS 7.3 |
+
+## 2.安装
+
+TuGraph 可以通过 Docker Image 快速安装，或者通过 rpm/deb 包本地安装。另外TuGraph在阿里云计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。
+
+> 安装包/镜像下载：参考[下载地址](../1.guide.md)中的“TuGraph最新版本”章节。
+
+> 计算巢部署：可以在阿里云计算巢自行搜索，也可以通过[部署链接]( ../5.installation&running/5.cloud-deployment.md )快速访问。
+
+### 2.1.通过docker快速体验
+
+1. 本地安装 docker 环境
+
+   参考 docker 官方文档：https://docs.docker.com/get-started/
+
+2. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. 启动docker
+   ```shell
+    docker run -it -d -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000是默认的http端口，访问tugraph-db-browser使用。
+   # 7070是默认的http端口，访问legacy tugraph-web访问使用。
+   # 7687是bolt端口，bolt client访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   
+   # 根据/usr/local/etc/lgraph.json的tugraph启动的默认配置，
+   # /var/lib/lgraph/data是容器内的默认数据目录，/var/log/lgraph_log是容器内的默认日志目录
+   # 命令将数据目录和日志目录挂载到了宿主机的/root/tugraph/上进行持久化，您可以根据实际情况修改。
+   ```
+
+4. 前端访问
+
+访问tugraph-db-browser: `http://x.x.x.x:8000`，默认用户名为 `admin`，密码为 `73@TuGraph`。
+首次登录会默认跳转修改密码页面，请尽快修改默认密码避免安全风险。
+
+**注意**：
+如果需要使用legacy tugraph-web，访问`http://x.x.x.x:7070`，默认用户名为 `admin`，密码为 `73@TuGraph`。 
+但请注意，legacy web是不再维护的版本，建议使用tugraph-db-browser。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..b8dd8d03ec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# 影视场景Demo
+
+> 此文档主要介绍 影视场景Demo 的使用方法。
+
+## 1.建模和数据导入
+
+完成登录后，点击`新建图项目`，选择movie数据，填写图项目配置，系统会自动完成Movie场景图项目创建。或者直接使用产品自带的movie图项目（带有官方图标）。
+
+Movie 场景图：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| 标签          | 类型  | 说明                                  |
+|-------------|-----|-------------------------------------|
+| movie       | 实体  | 表示某一部具体的影片，比如"阿甘正传"。                |
+| person      | 实体  | 表示个人，对影片来说可能是演员、导演，或编剧。             |
+| genre       | 实体  | 表示影片的类型，比如剧情片、恐怖片。                  |
+| keyword     | 实体  | 表示与影片相关的一些关键字，比如"拯救世界"、"虚拟现实"、"地铁"。 |
+| user        | 实体  | 表示观影的用户。                            |
+| produce     | 关系  | 表示影片的出品人关系。                         |
+| acted_in    | 关系  | 表示演员出演了哪些影片。                        |
+| direct      | 关系  | 表示影片的导演是谁。                          |
+| write       | 关系  | 表示影片的编剧关系。                          |
+| has_genre   | 关系  | 表示影片的类型分类。                          |
+| has_keyword | 关系  | 表示影片的一些关键字，即更细分类的标签。                |
+| rate        | 关系  | 表示用户对影片的打分。                         |
+
+## 2.查询示例
+
+### 2.1.示例一
+
+查询影片 'Forrest Gump' 的所有演员，返回影片和演员构成的子图。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.示例二
+
+查询影片 'Forrest Gump' 的所有演员，列出演员在影片中扮演的角色。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.示例三
+
+查询 Michael 所有评分低于 3 分的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.示例四
+
+查询和 Michael 有相同讨厌的影片的用户，讨厌标准为评分小于三分。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.示例五
+
+给 Michael 推荐影片，方法为先找出和 Michael 讨厌同样影片的用户，再筛选出这部分用户喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.示例六
+
+查询 Michael 的好友们喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.示例七
+
+通过查询给'Forrest Gump'打高分的人也喜欢哪些影片，给喜欢'Forrest Gump'的用户推荐类似的影片。
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..fee5e77f3e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,62 @@
+# 场景：流浪地球
+
+> 此文档主要介绍 流浪地球 demo的使用方法。
+
+## 1.Demo场景设计
+
+Demo背景基于流浪地球1、流浪地球2的故事背景进行设计
+
+- 基于剧情，设计了图结构，包含组织、角色、天体与设施3类点，事件、关系两类边
+- 根据剧情准备了对应Schema的数据
+- 准备了一些query，提出一些关于剧情的问题
+
+## 2.目录结构
+
+- rawdata: 原始剧情数据和schema定义文件
+- case.cypher: 查询相关的Cypher语句
+- control.sh: 控制TuGraph Server启动停止的脚本
+- lgraph_standalone.json: TuGraph Server启动的配置文件
+
+## 3.使用说明
+
+前置条件：TuGraph已安装
+
+## 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8000，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择流浪地球数据，填写图项目配置，系统会自动完成流浪地球场景图项目创建。
+    - 或者直接使用产品自带的流浪地球图项目（带有官方图标）。
+
+## 5.Cypher查询
+
+参考cypher文档，在TuGraph的Web页面前端输入Cypher进行查询
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.查询展示
+查询木星危机的所有事件经过
+
+```
+MATCH (n)-[e:事件关系]-(m) where e.title='木星危机' RETURN n,e
+```
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+查询所以危机的相关事件经过
+
+```cypher
+MATCH (n)-[e1]-(m)-[e2]-(p)
+where e1.title REGEXP ".*危机" and e2.title REGEXP ".*危机" and e1.title <> e2.title
+RETURN n,e1,e2,p
+```
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..41b58b1dfd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# 场景：三体
+
+> 此文档主要介绍 三体 demo的使用方法。
+
+## 1.Demo场景设计
+Demo背景基于三体1、三体2、三体3的故事背景进行设计。
+
+根据三体故事的设定，我们设计了4类点和6类边，点包括“人物”、“组织”、“计划”、“时间线”，边包括“人物-人物关系”、“人物-计划关系”、“人物-组织关系”、“组织-计划关系”、“组织-组织关系”。
+根据剧情准备了对应Schema的数据，准备了一些query，提出一些关于剧情的问题。
+
+## 2.目录结构
+rawdata: 原始剧情数据和schema定义文件。
+case.cypher: 查询相关的Cypher语句。
+control.sh: 控制TuGraph Server启动停止的脚本。
+lgraph_standalone.json: TuGraph Server启动的配置文件。
+
+## 3.使用说明
+
+前置条件：TuGraph已安装。
+
+### 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8000，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三体数据，填写图项目配置，系统会自动完成三体场景图项目创建。
+    - 或者直接使用产品自带的三体图项目（带有官方图标）。
+
+### 5.Cypher查询
+
+参考TuGraph文档，在TuGraph的Web页面前端输入Cypher进行查询。
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![data](../../../../images/three-body-data.png)
+
+### 7.查询展示
+
+#### 7.1.人物关系查询
+三体一剧情中，一开始全世界各地发生了大量科学家自杀事件，引起了警方重视，查案过程根据人物关系线索一步步排查，就如上面的图所示，随着线索越来越多，背后的真相逐步浮出水面。史强和汪淼发现大多数人都和叶文洁有着直接或者间接的联系，并派汪淼卧底，最终发现叶文洁的最终统帅身份。在图中也可以看出，叶文洁顶点周围有很多边关系（一度或二度邻居很多）。
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.邻域顶点分析
+三体中的各种计划比较多，有的时候可能会被绕晕，这时候我们可以通过图的邻居顶点查询来查看该计划的相关人物和组织等。如"面壁计划"中,我们可以看到有四位人物与之相关，这四位也是被世人所寄予厚望的“面壁者”。
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.查询a节点和b节点的共同邻居
+我们往往希望知道两个人物之间的共同关联的人物都有谁，这样就能很快的掌握这两个人物之间的关系，在大数据量的情况下，使用cypher进行图关系分析就很方便！
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.设置/更改属性
+随着剧情推进，我们逐步了解了"叶文洁"身上的多个标签，那么我们也可以将这些标签更新至“叶文洁”节点上：
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.增加/删除节点
+后续我们了解到了罗辑、程心等等人物和PIA、星环集团等组织，希望把这些作为节点添加至图中：
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..3252a13eb5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# 场景：三国
+
+> 此文档主要介绍 三国 demo的使用方法。
+
+## 1. 简介
+由于史料的缺失，一些即使为人们熟知的历史事件也往往存在着很多未解之谜。以三国历史为例，诸葛亮为什么出山帮助当时势力弱小的刘备，同为天下英雄的曹操和刘备为什么成就差距巨大等等。以往学者往往采用二维关系分析历史，这样得出的结论往往比较片面。使用TuGraph将三国的历史人物和事件导入图模型中，使用图计算方式进行分析，能够帮助我们从有限的信息中获得更有价值的知识，是一种非常有意义的跨学科尝试。
+## 2. 数据建模
+我们设计了5类顶点和5类边，点包括“主公”，“州”，“文臣”，“武将”，“战役”，边包括“父亲”，“兄长”，“隶属”，“籍贯”，“参战”。其具体建模信息如下所示：
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. 数据导入
+- 手动导入
+    - 向TuGraph导入数据，既可以使用TuGraph的`lgraph_import`工具离线导入。lgraph_import导入命令如下所示
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- 自动创建
+    - 点击`新建图项目`，选择三国数据，填写图项目配置，系统会自动完成三国场景图项目创建。
+    - 或者直接使用产品自带的三国图项目（带有官方图标）。
+## 4. Cypher分析
+### 4.1. 诸葛亮为什么选择刘备
+通过如下cypher命令可以查看诸葛亮和曹操、刘备之间的关系
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+从图中可以很直观的看出，曹操和诸葛亮之间的最短路径之一包含徐州之战，曹操曾经因父亲被杀对徐州进行过屠城，而诸葛亮是徐州琅琊郡人，任何人都断然不会选择一个屠杀过自己家乡的军阀作为主公。而相反，刘备曾经在徐州之战中阻止过曹操的暴行，这应当是诸葛亮对刘备好感的原因之一。
+
+### 4.2. 曹操为什么成就比刘备高
+通过如下cypher命令可以查看家族对曹操创业的助力
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+平定天下最重要的就是军事人才，曹操其父本姓夏侯，过继于曹氏，曹氏和夏侯氏在谯县都属于地方大族，在曹操创业初期提供了夏侯惇，夏侯渊，曹仁，曹洪在内大量的军事人才。而刘备其父早丧，没有家族助力，年过50才凑齐了自己的五虎上将，而这时已经过了天下大乱争夺地盘的最佳时机，曹操已经天下九州居其六了。
+
+### 4.3. 三国中最强大的魏国为何最先灭亡
+通过如下cypher命令可以查看曹操集团的重要文官组成
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+曹魏事实上于249年灭亡于高平陵之变，立国29年，少于蜀汉（43年）和东吴（51年）。三国中实力最强大的魏国最先灭亡的原因就在于曹魏的文官制度（九品中正制）使得权力很容易集中在世家大族手中。从图中可以看出，曹操曹丕父子两代的重要文臣几乎都是世家大族，颍川荀氏，颍川钟氏，颍川陈氏，武威贾氏等，甚至还出现了地区化趋势，集中于颍川，最终政权也为和颍川荀氏关系密切的河内司马氏所篡夺。
+
+### 4.4. 三国各自的实力究竟如何
+通过如下cypher命令可以查看三国各集团的人口实力
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+得到的查询结果如下表所示
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+古代社会衡量一个国家实力的重要指标是人口数量，由于人口数据缺失，我们使用三国所有主公和文臣武将的籍贯数据估计每个州的人口数量。发现三国主要人物中，按籍贯有60个属于魏国，有23个属于吴国，仅有2个属于蜀国，证明魏国确实是三国中最强大的国家。
+
+### 4.5. 曹操的军事能力如何评价
+通过如下cypher命令可以查看曹操参与的主要战役
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+从图中可以看出，曹操在三国主要的15场战役中参加了8场，出场率比较高。但是曹操只获胜了徐州之战、兖州之战、官渡之战和襄樊之战，汉中之战、宛城之战、群雄讨董和赤壁之战都失败了，综合胜率50%，证明曹操并不算一个非常优秀的军事家。
+
+## 5. 备注
+更多的分析有待大家积极补充和尝试！
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..976b97e0ac
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Round The World Demo
+
+> 此文档主要介绍了基于tugraph-db开发的环球旅行（Round The World）demo
+
+## 简介
+
+基于"80天环游世界"的虚拟背景，基于部分公开历史航班数据，帮助用户设计多个城市的最优航班规划。
+- demo设计了自定义网站服务
+- 数据来源为国外某开源网站，不包含大陆城市航班数据
+- 数据中航班价格为模拟数据，不代表真实价格
+
+## 示例
+
+### 登录页面
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### 查询页面
+
+在登录页面点击后进入查询页面
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### 查询示例
+
+在左下角的城市列表中选择不超过8个城市，点击查询可返回推荐的航班规划，在满足前后航班间隔在2-6小时的要求下，返回费用最低和飞行时间最短的10条路径规划。
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+详细使用说明见[manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "")文档。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..4a29f62826
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo示例
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..e630bd12bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+快速上手
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..2cfd4197a9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,685 @@
+# 可视化操作手册
+
+> 此文档主要介绍 TuGraph Browser 的使用和操作方法。
+
+## 1.简介
+
+TuGraph Browser（以下简称Browser）是一款功能强大的产品可视化开发工具，它以直观的可视化方式呈现图数据，使用户可以轻松地管理、维护和查看数据库运行状态。此工具不仅支持图数据的管理和可视化，还支持对系统账户的管理，为用户提供了全面的操作和管理体验，让用户能够更加高效地管理和利用图数据库。
+
+## 2.操作指南
+
+### 2.1.访问
+
+当用户完成图数据库的安装后，可以通过浏览器访问Browser。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 8000。
+
+- 例如：127.0.0.1:8000
+- 推荐使用Chrome
+
+#### 2.1.1.启动配置
+
+在启动Browser之前，需要提前启动TuGraph-Server并配置好Browser与TuGraph-Server连接，配置文件在Browser目录下的env.json文件，具体配置如下所示
+```shell
+# vim /usr/local/share/lgraph/tugraph-db-browser/env.json
+{
+  "tugraph_db_host": "http://127.0.0.1:9090"
+}
+```
+需要把tugraph_db_host修改为实际TuGraph-Server RPC服务的地址
+
+#### 2.1.2.启动方式
+Browser的启动方式分为两种，一种是在docker image中，直接切到Browser所在目录，执行启动命令即可
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run dev
+```
+另一种是在本地环境中使用rpm/deb安装包，此时需要先构建后启动，因此需要在本地提前安装Node环境，具体详见源码目录下的
+ci/images/tugraph-runtime-*-Dockerfile。在本地安装TuGraph时，
+Browser会安装到本地的指定目录，切到该目录，执行如下命令即可构建并启动
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run bootstrap
+pnpm run dev
+```
+
+### 2.2.登录
+
+![login](../../../images/browser/login.png)
+
+- 浏览器成功访问Browser后，首先进入的是登录页面（如上图所示），用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 用户首次登录后，会跳转至修改密码页面，密码修改成功后，使用新密码重新登录方可使用。
+
+### 2.3.快速上手
+
+对于首次使用TuGraph的用户，可以通过产品内置的demo数据快速构建一个图项目，快速上手图数据项目。
+
+#### 2.3.1.创建图项目
+
+在`图项目`首页的选项卡中，点击`新建图项目`创建新的图项目。
+
+![快速上手-新建图项目](../../../images/browser/quickstart-creategraph.png)
+
+选择一个产品内置的demo数据，点击`下一步`按钮。
+
+![快速上手-选择一个demo](../../../images/browser/quickstart-selectdemo.png)
+
+在`填写配置`界面输入图项目信息，demo数据量都相对较小，`最大存储空间`设置为1G即可。输入完图项目信息后，点击`创建`按钮后，系统会自动创建demo数据的图模型、导入图数据。
+
+![快速上手-填写配置](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.开始图项目
+
+demo数据的图项目创建完成后，可以在`图项目`的选项卡中找到相应的图项目，可以点击`图查询`查询图数据。
+
+![快速上手-图项目选项卡](../../../images/browser/quickstart-graphtab.png)
+
+执行默认的查询语句，浏览demo里的图数据。
+
+![快速上手-验证结果](../../../images/browser/quickstart-result.png)
+
+更多快速上手文档请浏览[快速上手文档](../3.quick-start/1.preparation.md)
+
+### 2.4.图项目
+
+`图项目`提供可视化的图项目管理和图数据研发功能，它为用户提供了一系列便捷的图数据可视化操作，包括图项目的创建、修改、删除等管理操作，以及图数据的查询、点边统计等操作。此外，它也支持图模型的管理，使用户可以更加方便地进行图数据的管理和维护。
+
+#### 2.4.1.图项目管理
+
+在`图项目`界面，可以看到当前图数据库中的图项目。
+
+![图项目-首页](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.新建图项目
+
+在`图项目`界面，点击`新建图项目`按钮创建一个新的图项目。
+
+![图项目-新建图项目按钮](../../../images/browser/graphmanagement-creategraph.png)
+
+新建图项目需要通过`选择模板`和`填写配置`两个页面完成图项目的创建。
+
+- __选择模板__：产品提供空模板和demo模板两类模板。
+    - 空模板：全新的图项目，用户需要自己创建图模型和导入图数据，一般用于正式项目开发。
+    - demo模板：产品内置的demo数据，图项目创建成功后，系统会自动创建demo图模型并导入demo图数据，一般用于试用和学习。
+
+![图项目-选择模板](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __填写配置__：用户需要填写图项目基本信息，并点击`创建`按钮创建图项目。
+    - 图名称：新建图项目的名称，同时作为该图项目的唯一主键。支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+    - 图描述：新建图项目的描述，可用于详细说明该项目的背景和目标。
+    - 高级配置-最大存储空间：设置图项目最大可占用的存储空间，实际并不会提前占用物理存储空间，实际数据量达到最大存储空间阈值后不可再写入数据。
+
+![图项目-填写配置](../../../images/browser/graphmanagement-configure.png)
+
+创建成功后，可在`图项目`页面的图项目选项卡中查看。
+
+##### 2.4.1.2.编辑图项目
+
+在`图项目`界面，点击图项目选项卡中的`编辑`按钮（笔形图标），编辑对应图项目的基础信息。
+
+![图项目-编辑图项目按钮](../../../images/browser/graphmanagement-editgraph-button.png)
+
+编辑图项目功能可以修改`图名称`和`图描述`。
+
+![图项目-编辑图项目](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.删除图项目
+
+在`图项目`界面，点击图项目选项卡中的`删除`按钮（垃圾桶图标），删除对应的图项目。
+
+![图项目-删除图项目按钮](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_需要注意：图项目删除后无法恢复_。
+
+##### 2.4.1.4.点边统计
+
+在`图项目`界面，点击图项目选项卡中的`点边统计`按钮（折线图标或刷新图标），统计对应图项目的点边数量。
+
+![图项目-点边统计按钮](../../../images/browser/graphmanagement-statistics-button.png)
+
+统计结果将展示展示图项目选项卡上，未进行过点边统计的图项目会显示`暂无点边数据`，已经统计过点边数据的图项目再次统计需要点击`刷新`按钮。
+
+![图项目-点边统计](../../../images/browser/graphmanagement-statistics.png)
+
+![图项目-刷新点边统计按钮](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.图构建
+
+Browser的`图构建`功能主要用于图项目的模型定义和数据导入。在`图项目`页面中，点击图项目选项卡中的`图构建`按钮。
+
+![图构建-按钮](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.模型定义
+
+Browser提供可视化的方式创建和维护图模型。
+
+- 也可用通过`cypher`工具和`lgraph_import`工具创建和维护图模型，详见[Cypher API](../8.query/1.cypher.md)和[数据导入](../6.utility-tools/1.data-import.md)文档。
+
+###### a.浏览图模型
+
+在`模型定义`界面可以查看详细的图模型设置，支持列表和画布方式查看图模型，支持列表展示点类型的属性和索引、边类型的属性和起点/终点类型。
+
+![图构建-浏览图模型](../../../images/browser/graphbuild.png)
+
+- 支持列表查看点类型和边类型。
+    - 支持点类型和边类型的个数展示，在点类型或边类型页签中展示对应的点或边数量。
+    - 支持点类型和边类型的名称关键字搜索，在`搜索框`输入关键字可展示对应的点或边。
+
+        ![图构建-浏览图模型-搜索](../../../images/browser/graphbuild-list-search.png)
+    - 支持点类型和边类型的名称复制，点击`复制`按钮可以复制点或边的名称至粘贴板。
+
+        ![图构建-浏览图模型-复制](../../../images/browser/graphbuild-list-copy.png)
+    - 支持点类型和边类型的删除，点击`删除`按钮可以删除对应的点或边。
+
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-list-delete.png)
+- 支持画布方式查看点类型和边类型。
+- 在列表或画布中点击相应的点类型或边类型，可以展示模型详情。
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-select.png)
+
+###### b.添加点
+
+在`模型定义`界面点击`添加点`按钮，在右侧滑动窗口中添加点类型。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex-button.png)
+
+用户需要输入点类型名称、属性和索引，点击`完成`按钮完成点类型的创建。
+- 点类型名称：点的名称，也是该点的唯一标识。
+- 属性：点的属性，需要一个属性作为主键。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建点时可以任意删除属性。
+- 索引：点的索引属性，需要先创建属性再设置该属性为索引，索引创建成功后无法修改。
+    - 属性：需要配置索引的属性。
+    - 唯一：设置该属性字段为唯一值。
+    - 主键：对应属性是否为主键，选择`是`后`唯一`选项必须为`是`。
+    - 删除：在创建点时可以任意删除索引。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex.png)
+
+- 编辑点：可以增加点的属性和修改已有属性的数据类型，新增或删除索引。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+_注：主键字段的属性创建后无修改_
+
+![图构建-编辑点](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.添加边
+
+在`模型定义`界面点击`添加边`按钮，在右侧滑动窗口中添加边类型。
+
+![图构建-添加边按钮](../../../images/browser/graphbuild-addedge-button.png)
+
+用户需要输入边类型名称、属性、选择起点类型和终点类型，点击`完成`按钮完成边类型的创建。
+- 边类型名称：边的名称，也是该边的唯一标识。
+- 属性：边的属性，边上可以没有属性。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建边时可以任意删除属性。
+- 选择起点类型和终点类型：设置边的起点点类型和终点点类型，支持多个起点类型和终点类型。
+    - 起点：选择起点的点类型。
+    - 终点：选择终点的点类型。
+    - 需要提前创建至少一个点类型才能设置边的起点类型和终点。
+    - 如果不选择则表示起点和终点可以为任意点类型，同时画布上不展示对应的边，需要在左侧列表查看边类型。
+
+![图构建-添加边](../../../images/browser/graphbuild-addedge.png)
+
+- 编辑边：可以增加边的属性和修改已有属性的数据类型。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+
+![图构建-编辑边](../../../images/browser/graphbuild-editedge.png)
+
+###### d.导入模型
+
+在`模型定义`界面点击`导入模型`按钮，可以上传模型文件快速创建模型。
+
+![图构建-导入模型按钮](../../../images/browser/graphbuild-importmodel-button.png)
+
+在`导入模型`界面点击`上传文件`按钮，上传模型文件成功后，点击确定可以导入图模型。
+
+- 覆盖当前画布中的模型：选中该选项，导入时会先清空已有图模型再导入模型文件中的图模型；不选择，会导入模型文件中新增的点类型和边类型，但不会修改已有的点类型和边类型。
+
+![图构建-导入模型](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.导出模型
+
+在`模型定义`界面点击`导出模型`按钮，可以将当前图项目中的图模型导出成json文件。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel-button.png)
+
+模型文件为json格式，不建议手动修改。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.数据导入
+
+完成`模型定义`之后，点击`下一步`按钮进入数据导入页面。
+
+###### a.数据准备
+
+在数据导入前需要提前准备数据，当前Browser支持CSV文件的上传，需要保证数据文件后缀为csv。
+- 不强制要求包含表头。
+- 支持文本限定符，文本限定符为双引号。
+
+![数据导入-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.上传文件
+
+在`数据导入`页面上传需要导入的数据文件，将数据导入到图项目中。
+
+![数据导入-上传文件](../../../images/browser/graphbuild-import.png)
+
+- 分隔符：数据文件的列分隔符。
+- 文件上传：支持上传多个文件。
+    - 支持弹窗中选择多个上传文件。
+    - 支持将文件拖拽至页面中上传。
+    - 支持同时上传点文件和边文件。
+
+###### c.数据映射
+
+文件上传成功后，需要在`数据导入`页面设置`数据对应表`，将数据文件中的数据列和目标点/边、对应属性建立映射关系。
+
+- 数据对应表：展示已经上传的数据问题。
+    - 文件名称：上传的数据文件名称。
+    - 文件大小：上传的数据文件大小。
+    - 读取结果：数据文件上传结果，success为读取成功。
+    - 删除：在页面中删除，不会删除本地文件。
+- 数据文件映射：每个已上传的数据文件都需要配置映射关系。
+    - 标签：选择该文件对应的点或边类型，只能选择一类点或一类边。
+    - 从第N行，开始：从第N行开始读取数据，系统默认从第0行开始读取数据，如需跳过表头可输入1。
+    - 属性映射：下拉选择数据列对应的属性字段。
+    - 数据预览：系统会预读数据文件的前5行。
+
+![数据导入-数据映射](../../../images/browser/graphbuild-import-datamapping.png)
+
+文件上传成功后，可以点击`继续导入`按钮继续导入其他数据，或者点击`前往图查询`按钮在`图查询`页面查询已导入的数据。
+
+![数据导入-导入成功](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.图查询
+
+在`图项目`界面点击图项目选项卡中的`图查询`按钮，可以查询和访问图项目中的图数据，产品提供`语句查询`、`路径查询`、`点查询`等多种模式查询图数据，支持切换图项目和查询结果展示。
+
+![图查询-按钮](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.切换图项目
+
+`图查询`功能只能访问一个图项目数据，用户可以在`切换图项目`下拉框中选择并切换至其他图数据。
+
+![图查询-切换图项目](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.语句查询
+
+Browser提供可视化方式开发和调试图查询语句，用户可以输入图查询语句、执行并返回结果，支持收藏语句和查看图模型。
+
+![图查询-语句查询](../../../images/browser/query-view.png)
+
+###### a.语句查询窗口
+
+用户在`语句查询窗口`输入图查询语句，点击`执行`按钮可以运行对应语句，并在`执行结果页签`展示结果。
+
+- 切换查询语言：提供不同图查询语言模式的切换。_当前只支持Cypher语法_
+
+![图查询-切换语言](../../../images/browser/query-selectgql.png)
+
+- 语句查询窗口：提供当前查询语言的语法提示。
+
+![图查询-语法提示](../../../images/browser/query-gqltips.png)
+
+- 执行：点击`执行`按钮，发送输入的查询语句至后台运行。
+
+![图查询-执行按钮](../../../images/browser/query-execute-button.png)
+
+- 收藏：点击`收藏`按钮，将当前语句查询窗口的内容保存成模板，以便下次使用。
+
+![图查询-收藏按钮](../../../images/browser/query-bookmark-button.png)
+
+- 下载：点击`下载`按钮，将当前语句查询窗口的内容保存成文本文件并下载至本地，以便下次使用。
+
+![图查询-下载按钮](../../../images/browser/query-download-button.png)
+
+详细Cypher使用指南请参考文档：[Cypher API](../8.query/1.cypher.md)
+
+###### b.收藏列表
+
+以列表方式展示已经收藏的查询语句，点击列表中的收藏模板可以使用其中的语句。支持关键字搜索、名称修改以及删除。
+
+![图查询-语句收藏](../../../images/browser/query-bookmark.png)
+
+###### c.查看图模型
+
+Browser提供当前图项目中的图模型查询，方便用户查询有些点类型和边类型，支持列表展示和画布图谱展示方式，支持隐藏查看图模型窗口。
+
+![图查询-图模型列表](../../../images/browser/query-schema-list.png)
+![图查询-图模型图谱](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.路径查询
+
+Browser提供`路径查询`模板，用户可以通过选择路径的方式，查找图项目中的图数据是否存在相应的路径。
+
+![路径查询](../../../images/browser/pathquery-result.png)
+
+- 路径：在路径选择下拉框内选择需要查找的路径。
+    - 选择路径：根据图模型的定义，系统会自动匹配出对应的一度关系路径；再次点击路径下拉框会，系统会根据路径终点的点类型自动匹配下一度关系路径。
+![路径查询-选择路径](../../../images/browser/pathquery-select.png)
+    - 执行：点击`执行`按钮返回图项目中匹配的路径。
+    - 高级配置：设置扫描的路径数目，默认为100条路径。
+![路径查询-高级配置](../../../images/browser/pathquery-configuration.png)
+
+_注：需要图模型中的边设置起点和终点，如果图项目中的边均未设置起点和终点，下拉选项无结果_
+
+##### 2.4.3.4.点查询
+
+Browser提供`点查询`模板，用户可以通过选择点属性进行查询，查找图项目中的点数据。
+
+![点查询](../../../images/browser/vertexquery.png)
+
+- 选择点：选择需要查询的点类型。
+    - 属性：系统会自动匹配点类型的schema，设置相应的查询条件，点击执行按钮返回结果。
+- 返回节点数目：设置返回点数据的上限。
+
+![点查询-条件](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.执行结果页签
+
+Browser提供JSON视图、JSON文本、点边列表、点边视图等多种方式展示图查询结果，支持结果下载、插入数据、全屏展示。
+
+###### a.JSON视图
+
+Browser提供以JSON视图方式展示查询结果。
+
+![JSON视图](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON文本
+
+![JSON文本](../../../images/browser/query-result-jsontxt.png)
+
+###### c.点边列表
+
+Browser提供以点和边列表方式展示查询结果。
+
+![点边列表](../../../images/browser/query-result-list.png)
+
+###### d.点边视图
+
+Browser提供以画布方式展示查询结果。
+
+![点边视图](../../../images/browser/query-result-graph.png)
+
+###### e.插入数据
+
+Browser提供可视化方式在对应图项目中插入点或边数据。点击`插入数据`按钮，在`插入数据`页签选择点类型或边类型，输入属性值，点击确定完成数据插入。
+
+![插入数据-按钮](../../../images/browser/query-result-insert-button.png)
+
+![插入数据](../../../images/browser/query-result-insert.png)
+
+###### f.下载执行结果
+
+Browser提供图查询结果导出成文本文件功能。点击`下载执行结果`按钮，系统会自动将结果保存成文本文件并下载至本地。
+
+![下载执行结果-按钮](../../../images/browser/query-result-download.png)
+![下载执行结果-按钮](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.全屏展示
+
+Browser提供全屏方式展示图查询结果，点击`全屏显示`按钮全屏展示结果，点击`退出全屏`按钮退出全屏展示。
+
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-button.png)
+![全屏展示](../../../images/browser/query-result-fullscreen.png)
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.图分析
+
+在`图项目`界面点击图项目选项卡中的`图分析`按钮，可以在画布中展示和分析图数据，产品提供`语句查询`和`配置查询`将图项目中的数据查询并加载至画布，支持画布数据的筛选、布局样式调整以及画布操作。
+
+![图分析-按钮](../../../images/browser/graphanalysis-button.png)
+
+如下图所示，图分析功能主要包括：1、操作栏：图分析主要操作功能，包括视图切换、查询过滤、布局样式以及画布操作；2、左边栏：查询、筛选、外观功能操作区域；3、画布区域：展示图数据的区域，展示点和边数据，支持点扩展查询、收起节点、固定节点、删除节点，提供画布图数据统计等功能；4：右边栏：选中一个点数据或边数据后，会展示对应的属性信息；5、切换图项目：切换不同的图项目进行分析。
+
+![图分析-操作区域](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.语句查询
+
+在`语句查询`功能中，用户可以输入查询语句来查询图数据，并加载数据至画布区域进行展示。
+- 语法说明：TuGraph的查询语言及语法说明文档。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-语句查询](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.模板查询
+
+在`模板查询`功能中，用户可以选择节点类型和输入属性条件来查询图数据，并加载数据至画布区域进行展示。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-模板查询](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.画布分析
+
+在`画布分析`功能中，用户可以对画布中的节点或边数据进行操作和分析，主要包括：选中节点进行扩展查询、收起/展开节点、固定节点，清空画布，套索，点/边检索，画布图例等。画布上的最基础操作是拖拽点数据，鼠标左键选住一个节点并移动鼠标，可以完成点数据位置的移动。
+
+###### a.扩展查询
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，鼠标移至`扩展查询`处弹出二级悬窗，点击对应的扩展度数进行查询。
+- 一度查询：双向扩展一度关系。
+- 二度查询：双向扩展二度关系。
+- 三度查询：双向扩展三度关系。
+- 自定义查询：根据选择的条件进行扩展。
+    -边的方向：设置扩展关系的方向，双向：包含出边和入边，出边：选中起点向外指向的边，入边：指向选中起点的边。
+    -扩散度数：扩展的度数。
+    -自定义返回节点数量：配置返回至前端的节点数量，默认为100，防止遇到超级节点导致前端异常的情况。
+    -添加筛选组：设置扩展的关系类型和关系的属性条件，可以设置多组关系类型。
+
+![图分析-画布分析-扩展查询-按钮](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![图分析-画布分析-扩展查询-查询后](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![图分析-画布分析-扩展查询-自定义查询](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.收起/展开节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`收起节点`会隐藏所选节点的一度关系节点；再次右键已`收起节点`的点数据可以进行`展开节点`操作，展示已隐藏的一度关系节点。
+
+![图分析-画布分析-收起节点](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![图分析-画布分析-展开节点](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.固定节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`固定节点`会将所选节点固定在原处，固定后的节点不可移动（包括重新布局）；再次右键已`固定节点`的点数据可以进行`解除固定`操作，恢复所选节点的正常操作。
+
+![图分析-画布分析-固定节点](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![图分析-画布分析-解除固定](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.删除节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`删除节点`会将所选节点移出画布。
+
+![图分析-画布分析-删除节点](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.清空画布
+
+在`操作栏`区域点击`清空画布`按钮，会清除所有画布中的数据。
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.点/边检索
+
+在`点/边检索`窗口选择点或边，并输入关键字，会模糊检索画布中的属性数据，检索后可定位至数据位置。
+
+![图分析-画布分析-检索](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.画布图例
+
+在`画布`区域的图例位置，会展示画布中的点类型，点击点类型可以选中对应的点数据，点击更多按钮可以展示统计情况，支持列表或图表方式展示点或边的数量。
+
+![图分析-画布分析-列表](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![图分析-画布分析-图表](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.属性筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`属性筛选`进行筛选过滤。用户可以选择要筛选的点或边类型，以及对应的属性值进行设置，检索到筛选组条件的数据后会在画布上高亮选中对应的点或边数据。
+- 请选择点/边类型：选择需要检索的点类型或边类型。
+- 属性条件：设置需要检索的属性条件，可以设置多组，取并集筛选结果。
+- 添加筛选组：可以多组筛选条件，取并集筛选结果。
+- 重置：可以清空筛选条件。
+
+![图分析-筛选-属性筛选](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.统计筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`统计筛选`进行画布数据统计。用户可以选择要统计的点或边类型，以及对应的属性值进行设置，系统会自动根据用户选择的点/边类型和属性进行分组统计，支持按照图表和列表两种方式展示结果，同时点击图表或列表区域的数值可以高亮选中画布中的数据。
+
+![图分析-筛选-统计筛选](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![图分析-统计筛选-图表切换](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.布局样式
+
+在`操作栏`区域点击`布局`按钮，选择对应的布局方式会将画布中的数据进行重新排布，支持力导向布局、同心圆布局、圆形布局、辐射布局、Dagre布局以及网格布局，每种布局方式均有不同布局参数，调整参数后画布中的数据会进行重新排布。
+
+![图分析-布局样式-按钮](../../../images/browser/graphanalysis-style-layout-button.png)
+![图分析-布局样式-布局参数](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+详细布局参数可参考[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide)。
+
+##### 2.4.4.6.外观样式
+
+在`操作栏`区域点击`外观`按钮，在`左边栏`点击`点样式`或`边样式`进行外观样式配置。
+- 点样式
+    - 应用点类型：设置对应点类型的展示样式，支持同时配置多个点类型外观。
+    - 大小：对应点类型的展示大小。
+    - 颜色：对应点类型的展示颜色。
+    - 图标：对应点类型的图标样式。
+    - 显示文本：对应点类型显示的文本内容，默认为id。
+    - 高级配置：根据设置的条件标记对应的点数据。
+- 边样式
+    - 应用边类型：设置对应边类型的展示样式，支持同时配置多个边类型外观。
+    - 颜色：对应点类型的展示颜色。
+    - 边宽：对应边类型的展示宽度。
+    - 显示文本：对应边类型显示的文本内容，默认不显示。
+    - 高级配置：根据设置的条件按颜色展示对应的边数据。
+
+![图分析-外观](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.控制台
+
+`控制台`提供可视化的的账户管理和数据库信息查看功能，它为用户提供了全面的账户和角色管理功能，包括账户的增删改查以及禁用，角色的增删改查以及禁用。此外，它也为用户提供了便捷的数据库信息查看功能，让用户可以轻松地查看图数据库的基础信息和配置信息。其中，基础信息主要包括版本号、运行时间、CPP编译版本号等，而数据库配置信息则包括端口号、系统功能参数配置等。
+
+#### 2.5.1.账户管理
+
+##### 2.5.1.1.账户管理
+
+###### a.添加账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户需要输入账户名称、账户描述、账户密码以及相关角色。
+
+![账户管理-添加账户按钮](../../../images/browser/account-add-button.png)
+
+- 账户名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 相关角色：新建账户时必须要选择一个角色，在账户添加成功后，系统会自动生成一个与账户名称一样的角色。
+
+![账户管理-添加账户](../../../images/browser/account-add.png)
+
+###### b.编辑账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户可以编辑账户描述、账户密码以及相关角色。
+
+![账户管理-编辑账户](../../../images/browser/account-edit.png)
+
+###### c.禁用账户
+
+在`账户管理`界面点击`禁用`按钮禁止对应的账户登录和访问，点击`启用`按钮开启对应的账户登录和访问权限。
+
+![账户管理-禁用](../../../images/browser/account-disable.png)
+![账户管理-启用](../../../images/browser/account-enable.png)
+
+###### d.删除账户
+
+在`账户管理`界面点击`删除`按钮删除对应的账户。
+
+![账户管理-删除](../../../images/browser/account-delete.png)
+
+##### 2.5.1.2.角色管理
+
+###### a.添加角色
+
+在`角色管理`界面点击`添加`按钮创建新的角色，用户需要输入角色名称、角色描述以及图权限。
+
+![角色管理-添加角色按钮](../../../images/browser/role-add-button.png)
+
+- 角色名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 图权限：browser支持全部、读、写和无共四类图权限配置。
+    - 全部：对应图的读和写权限，包含编辑图模型权限（schema）。
+    - 读写：对应图的写权限，不包含编辑图模型权限（schema）。
+    - 只读：对应图的读权限。
+    - 无：无法访问和操作对应图。
+- 角色冲突：当两个角色对同一个图有不同图权限，同时对一个账户授权了这两个角色，该账户对该图的图权限为两个角色的并集。
+
+![角色管理-添加角色](../../../images/browser/role-add.png)
+
+###### b.编辑角色
+
+在`角色管理`界面点击`编辑`按钮编辑已有角色，用户可以编辑角色描述以及图权限。
+
+![角色管理-编辑角色](../../../images/browser/role-edit.png)
+
+###### c.禁用角色
+
+在`角色管理`界面点击`禁用`按钮禁止对应的角色，点击`启用`按钮开启对应的角色。禁用角色后，对应角色图访问权限失效。
+
+- 禁用角色：禁用之后，对应角色图访问权限失效。
+    - 当一个用户拥有两个角色对同一个图有操作权限时，当禁用其中一个角色时，另一个角色权限同样有效。
+
+![角色管理-禁用](../../../images/browser/role-disable.png)
+![角色管理-启用](../../../images/browser/role-enable.png)
+
+###### d.删除角色
+
+在`角色管理`界面点击`删除`按钮删除对应的角色。
+
+![角色管理-删除](../../../images/browser/role-delete.png)
+
+#### 2.5.2.数据库信息
+
+##### 2.5.2.1.基础信息
+
+`基础信息`获取当前系统运行的状态，并展示关键信息。
+
+![数据库信息-基础信息](../../../images/browser/db_basic.png)
+
+|参数    |含义    |
+|-------|--------|
+|TuGraph版本号|当前TuGraph的版本号，x.x.x|
+|运行时间|TuGraph服务启动到现在的时间|
+|服务器代码版本|tugraph-db仓库的当前commit|
+|前端代码版本|tugraph-web仓库的当前commit|
+|CPP编译器版本号|编译TuGraph时的CPP版本号|
+|Python版本号|编译TuGraph时的Python版本号|
+|CPP编译器ID|编译TuGraph时的CPP类型|
+
+也可以通过命令获取当前系统运行状态。
+
+```
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.数据库配置信息
+
+`数据库配置信息`获取当前系统运行的配置参数，并展示关键信息。调整配置参数或了解详细配置参数请参考[数据库运行-服务配置](../5.installation&running/7.tugraph-running.md)。
+
+![数据库信息-数据库配置信息](../../../images/browser/db_configuration.png)
+
+| 参数                          | 含义                                  |
+|-----------------------------|-------------------------------------|
+| bind_host                   | 系统启动时设置的host，一般为0.0.0.0             |
+| disable_auth                | 是否关闭token认证的定期更新，如为true则token可以永久使用 |
+| durable                     | 是否开启存储底层持久化，如为false，数据异步更新到磁盘       |
+| enable_audit_log            | 是否开启审计日志                            |
+| enable_backup_log           | 是否开启实时增量备份                          |
+| enable_fulltext_index       | 是否开启全文索引                            |
+| enable_ip_check             | 是否开启IP白名单                           |
+| enable_rpc                  | 是否开启RPC端口                           |
+| enable_ssl                  | 是否开启ssl加密传输                         |
+| optimistic_txn              | 是否开启乐观多线程写入事务                       |
+| port                        | 当前系统的REST访问端口                       |
+| rpc_port                    | RPC 及 HA 服务所用端口                     |
+| subprocess_max_idle_seconds | 自进程最大空闲时间，线程池参数                     |
+| thread_limit                | 服务端同时使用的最大线程数                       |
+| verbose                     | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。  |
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..0815c0865d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# 可视化操作手册（旧版）
+
+> 此文档主要介绍 TuGraph Browser 的使用
+
+## 定义
+
+TuGraph Browser 是 TuGraph 提供的可视化开发工具。
+
+## 作用
+
+TuGraph Browser 的主要功能是为使用图数据库的开发人员，提供可视化的图数据开发，图数据管理和维护等功能。
+
+## 操作详情
+
+### 1.连接数据库
+
+当用户完成图数据库的安装后，可以通过浏览器进行访问，TuGraph Browser 工具。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7090。
+
+### 2.登录数据库
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- 页面打开成功会，首先进图的是登录页面，用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 3.工作台
+
+#### 3.1 快速上手
+
+- 首次登录，系统会默认创建 default 空图
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- 用户点击帮助选项，并选择快速上手
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- 然后点击“一键创建模型”——>"一键创建数据"，就可以完成内置的 Movie 数据图谱的构建
+
+#### 3.2 创建子图和示例
+
+##### 3.2.1 创建子图
+
+- 点击新建子图
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- 填写表单信息
+  ![alt 填写表单](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+  - 子图名称
+  - 子图描述
+  - 配置信息
+  - 点击确认，提示创建成功
+- 切换子图
+  ![alt 切换子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- 点击新建示例
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- 选择示例并点击创建
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 查询
+
+![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 页面组成
+
+- cypher 输入框
+- 结果集展示区域
+
+##### 3.3.2 结果集展示区域功能详情
+
+- 结果集标签展示及功能
+  ![alt 结果集标签](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+  - 这里展示了结果集的所有类型统计
+  - 点击不同的“label（标签）”，可以进行以下修改操作
+    - 修改展示颜色
+    - 修改节点大小或边的粗细
+    - 修改默认展示属性或系统属性
+    - 布局修改
+      - 力导布局
+      - 网格布局
+      - 树形布局
+      - 环境布局
+    - 边聚合
+      - 相同类型，方向的边可以进行合并
+    - 创建节点
+      - 点击创建节点按钮
+      - 选择节点类型
+      - 添写节点内容
+    - 创建关系
+      - 在画布中选择起点和终点
+      - 选择可以匹配的类型
+      - 填写节点信息
+    - 停止布局
+      - 当数据量过大，导致浏览器页面卡顿时候，可以点击这个停止布局的按钮，能够提高体验的流畅度
+    - 鼠标悬停
+      - 开启此功能，可以高亮显示鼠标悬停节点的一度邻居节点
+    - 结果集导出
+      - 可以将结果集导出为 png，json，csv 三种不同的文件形式
+    - 刷新
+      - 点击刷新按钮，会重新执行当前页面的初始 cypher 语句，并刷新结果集
+    - 最大化
+      - 点击最大化，结果集展示区域将全屏展示
+    - 结果集展示形式切换
+      - 支持图谱、表格、文本三种形式
+
+##### 3.3.3 建模
+
+- 点边模型
+  ![alt 建模](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- 点边模型支持实时的、增、删、改、查
+
+- 点边模型支持导入和导出
+
+##### 3.3.4 数据导入
+
+- 本地数据导入
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+  - 选择文件编码格式
+  - 选择本地 CSV 文件
+  - 选择对应的节点或边的模型
+  - 进行数据映射
+  - 完成数据导入
+  - 单个文件最大支持2GB
+
+##### 3.3.5 插件
+
+- 存储过程的使用
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+  - 用户可以上传本地编写的 Plugin 程序，并在可视化页面进行执行，并查看执行结果
+  - 用户可以在可视化对插件进行、卸载、执行、下载等操作
+
+##### 3.3.6 帮助
+
+- 其中记录了 TuGraph-browser 的使用方式
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 控制台
+
+##### 3.4.1 数据库基础信息
+
+- 展示数据库相关的基础配置信息
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 权限管理
+
+- 用来创建用户和角色的功能模块，用户可以在这里进行权限的管理操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 实时状态
+
+- 这里展示了数据库实时状态，包括：CPU 使用率、内存用率、磁盘使用率、数据请求次数、磁盘 IO
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 任务管理
+
+- 在这里用户可以看到在正在执行中的任务，可以在此进行停止任务的操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 审计日志
+
+- 这里记录的数据库相关的审计日志，用来排查使用遇到的问题
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..811fbf0563
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+可视化操作指南
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..e2524b4134
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/1.environment.md
@@ -0,0 +1,40 @@
+# 环境准备
+
+> 此文档主要介绍 TuGraph 部署时所需的软硬件环境。
+
+## 1.硬件环境
+
+### 1.1. CPU
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的硬件平台，测试认证过的硬件平台包括 Intel、AMD、Kunpeng、Hygon、飞腾等。
+
+### 1.2. 内存
+
+我们建议内存容量不小于实际的数据大小。如果最求极致的性能，把所有的数据缓存到内存里是最理想的。在数据访问的局部性上，图数据库的局部性要比关系型数据库差，因此如果数据在内存中放不下，通常会频繁地换入换出。
+
+### 1.3. 外存
+我们强烈建议用户使用 NVMe SSD 作为外存，数据库有大量的写操作需要同步的外存，通常为随机写，外存的读写性能很容易成为整体数据库运行的性能瓶颈。因此，高IOPS、低延迟的 NVMe SSD 是最优的选择。
+
+如果现实条件只能使用 SATA接口的SSD，或者云上的网盘，性能虽然会受到影响，但 TuGraph 依然能正确的运行。
+
+外存大小建议为实际数据大小的4倍，比如数据为1TB，则准备4TB的硬盘会比较稳妥。
+
+## 2.软件环境
+
+### 2.1. 操作系统
+
+TuGraph 能够兼容主流操作系统，包括Ubuntu、CentOS、SUSE、银河麒麟、 中标麒麟、UOS等，均通过测试认证。
+
+其中最稳定使用的系统版本是 Ubuntu 18.04、CentOS 7、CentOS 8。
+
+### 2.2. 系统库
+
+编译环境和运行环境对系统库的要求不一样，具体请参考[环境分类](2.environment-mode.md)。
+
+## 3.典型配置推荐
+
+| 硬件      | 最低配置   | 建议配置                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| 内存      | 4GB       | 512GB                    |
+| 外存      | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..3dbbe91ee5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,22 @@
+# 环境分类
+
+> 此文档主要介绍 TuGraph 涉及的三种环境。
+
+## 1.分类
+
+根据环境所承载功能的不同，区分为编译环境，运行环境，以及精简运行环境。
+* 编译环境，具备TuGraph编译的所有依赖库，包含运行环境的所有依赖，并且能够编译TuGraph源码，但不包含预编译好的TuGraph可执行文件和库文件，供开发者编译源码使用。
+* 运行环境，具备GCC/Java/Python环境，能够运行TuGraph的所有功能，并且能承载全文索引，java client，c++源码上传为plugin，以及python plugin的完整功能，内置TuGraph预编译好的可执行文件和库文件，供客户直接安装使用，无需编译源码。
+* 精简运行环境，约等于裸系统加预编译TuGraph，仅能运行TuGraph的基本功能，无C++ plugin编译运行，仅so上传，无全文索引，无python plugin，供快速搭建试用。
+
+TuGraph编译后，会把所有的依赖库以.a的形式打包在一起，因此原则上运行不需要的其他的依赖库。但TuGraph支持存储过程，即在服务端编译C++代码，因此在环境中依然需要涉及的编译器。
+
+## 2.依赖系统库
+
+针对三种环境，除去TuGraph的运行包，所需要的系统库如下：
+* 编译环境，包括gcc、python、java等编译器，也包含antlr4、pybind11等，具体参见tugraph-db源码目录 ci/images/tugraph-compile-*-Dockerfile。
+* 运行环境，主要由存储过程引入，包括gcc、boost、cmake等，具体参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile。
+* 精简运行环境，无，可以参见tugraph-db源码目录 ci/images/ tugraph-mini-runtime-*-Dockerfile。
+
+
+
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..7400804d9b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,101 @@
+# Docker部署
+
+>本文档介绍TuGraph Compile及TuGraph Runtime的Docker镜像的创建、下载。
+
+## 1.简介
+
+- TuGraph Compile Image：提供编译环境，可以用于TuGraph的编译，测试；
+- TuGraph Runtime Image：提供二进制可运行环境，附带TuGraph库和可执行文件；
+- TuGraph Mini Runtime Image: 提供二进制可运行环境，不包含TuGraph中Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+## 2.现有Docker Image
+
+### 2.1.镜像下载方式
+
+镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用。
+
+最新版本的Docker地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+### 2.2.命名规范
+
+#### 2.2.1.TuGraph Compile Image
+
+提供编译环境，可以用于TuGraph的编译。
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+例如： `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+提供二进制可运行环境，附带TuGraph库和可执行文件。
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如：`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+提供二进制可运行环境，不包含TuGraph种Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如： `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.常见Docker操作
+
+Docker由Dockerfile生成，注意创建镜像需要下载依赖，因此网络问题可能会导致创建较慢或者创建失败。注意不要覆盖镜像，除非tag为 `latest`。
+
+创建Compile镜像
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+创建Runtime / Mini Runtine镜像
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+修改镜像名称
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+上传镜像
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+获取镜像
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+导出镜像
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+导入镜像
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+其他Docker操作请参考[docker官方文档](https://docs.docker.com/engine/reference/commandline/cli )
+
+
+### 2.4. M1芯片支持
+
+在 M1 芯片的机器上运行 amd64 容器可能造成未知错误。TuGraph提供 arm64 的镜像供 M1 机器使用。
+包含compile和runtime两种镜像。
+
+在`tugraph-runtime-centos7:3.6.0`与`tugraph-compile-centos7:1.2.7`及之后，`tugraph-runtime-centos7`与`tugraph-compile-centos7`提供linux/amd64和linux/arm64/v8两种架构的镜像，可以在 M1 机器上通过docker pull获取arm64架构镜像。
+
+## 3. 使用和开发TuGraph-DB Docker镜像时的最佳实践
+
+在您刚开始为TuGraph做出贡献时，请仔细阅读以下要点，并遵循它们。
+
+- 为了避免过多的Docker Layer，请尽量像现有的Dockerfile一样单行的写ENV和RUN将您的依赖项添加到Docker中。
+- 对于您需要构建依赖项的软件包/资源，请使用原始的软件包/资源，而不是在没有VCS跟踪的情况下修改这些资源。之后联系TuGraph团队将其上传到OSS以加速构建过程，如同您在Dockerfiles中看到的URL一样。
+- 为了使开发更加高效，最好从Base TuGraph编译镜像添加依赖项开始，完成开发确认依赖没问题后在Dockerfile中重新复制该过程。
+- CI使用了Docker镜像。如果您的CI失败，请检查依赖项问题。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..04125f35c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# 本地包部署
+
+> 此文档主要介绍 TuGraph 的本地包部署。
+
+## 1. 环境准备
+
+TuGraph本地包部署需要对应的环境，快速验证可以使用精简安装包，几乎不需要任何第三方库。
+
+如果您需要使用完整的TuGraph功能，请参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile，该脚本包含完整的环境构建流程。
+
+## 2. 安装包下载
+
+最新版本的安装包地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+也可以访问Github进行下载：[TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. CentOS 下的安装方法
+
+用于在 CentOS 上安装的 TuGraph 的.rpm 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.rpm 安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+用户也可以通过指定`--prefix`选项指定安装目录。
+
+## 4. Ubuntu 下的安装方法
+
+用于在 Ubuntu 上安装的 TuGraph 的.deb 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.deb`安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+该命令默认将 TuGraph 安装于`/usr/local`目录下。用户也可以通过指定 `--instdir=<directory>` 选项更改安装目录。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..7ac7e1cfc0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,125 @@
+# 云部署
+
+> 此文档主要介绍 TuGraph 的云部署，也可参见[阿里云计算巢部署文档]( https://aliyun-computenest.github.io/quickstart-tugraph/ )。
+
+## 1.简介
+
+TuGraph（tugraph.antgroup.com）是蚂蚁集团研发的高性能图数据库（Graph Database）。TuGraph在计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。本文向您介绍如何开通计算巢上的TuGraph社区版服务，以及部署流程和使用说明。
+
+## 2.实例说明
+
+TuGraph部署的为社区开源版本，源码参考Github Repo，目前可以选择的实例规格如下：
+
+| 规格族         | vCPU与内存                 | 系统盘              | 公网带宽      |
+|----------------|-------------------------|-------------------|-----------|
+| ecs.r7a.xlarge | AMD 内存型 r7a，4vCPU 32GiB | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+| ecs.r6.xlarge  | 内存型r6，4vCPU 32GiB       | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+
+预估费用在创建实例时可实时看到（目前为免费）。 如需更多规格、其他服务（如集群高可用性要求、企业级支持服务等），请联系我们 tugraph@service.alipay.com。
+
+## 3.部署流程
+
+### 3.1.准备工作
+
+在正式开始使用前，您需要一个阿里云账号，对ECS、VPC等资源进行访问和创建操作。
+
+- 若您使用个人账号，可以直接创建服务实例
+- 若您使用RAM用户创建服务实例，且是第一次使用阿里云计算巢
+    - 需要在创建服务实例前，对使用的RAM用户的账号添加相应资源的权限。添加RAM权限的详细操作，请参见为 __RAM用户授权__。所需权限如下表所示。
+    - 且需要授权创建关联角色，参考下图，选中 __同意授权并创建关联角色__
+
+| 权限策略名称                    | 备注                                    |
+|---------------------------------|---------------------------------------|
+| AliyunECSFullAccess             | 管理云服务器服务（ECS）的权限             |
+| AliyunVPCFullAccess             | 管理专有网络（VPC）的权限                 |
+| AliyunROSFullAccess             | 管理资源编排服务（ROS）的权限             |
+| AliyunComputeNestUserFullAccess | 管理计算巢服务（ComputeNest）的用户侧权限 |
+| AliyunCloudMonitorFullAccess    | 管理云监控（CloudMonitor）的权限          |
+
+![同意授权并创建关联角色](../../../images/cloud-deployment-1.png)
+
+### 3.2.部署入口
+
+您可以在阿里云计算巢自行搜索，也可以通过下述部署链接快速到达。
+
+[部署链接](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.申请试用
+
+在正式试用前，需要申请试用，按照提示填写信息，在审核通过后就可以创建TuGraph服务。
+
+![申请试用](../../../images/cloud-deployment-2.png)
+
+### 3.4.创建TuGraph服务
+
+#### 3.4.1.参数列表
+
+您在创建服务实例的过程中，需要配置服务实例信息的参数列表，具体如下。
+
+| 参数组               | 参数项   | 示例          | 说明                                                           |
+|--------------------|----------|---------------|--------------------------------------------------------------|
+| 服务实例名称         | N/A      | test          | 实例的名称                                                     |
+| 地域                 | N/A      | 华东1（杭州）   | 选中服务实例的地域，建议就近选中，以获取更好的网络延时。          |
+| 付费类型配置         | 付费类型 | 按量付费      | 免费使用请选用按量付费                                         |
+| 可用区配置           | 部署区域 | 可用区I       | 地域下的不同可用区域，确保实例非空                              |
+| 选择已有基础资源配置 | VPC ID   | vpc-xxx       | 按实际情况，选择专有网络的ID。                                   |
+| 选择已有基础资源配置 | 交换机ID | vsw-xxx       | 按实际情况，选择交换机ID。若找不到交换机, 可尝试切换地域和可用区 |
+| ECS实例配置          | 实例类型 | ecs.r6.xlarge | 当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格                      |
+|ECS实例配置|	实例密码|	**|	设置实例密码。长度8~30个字符，必须包含三项（大写字母、小写字母、数字、 ()`~!@#$%^&*_-+={}[]:;'<>,.?/ 中的特殊符号）。|
+
+#### 3.4.2.具体步骤
+
+创建服务按如下步骤进行，参考下图：
+
+- 创建实例名称，如下图中“test”
+- 选择地域，如下图中“华东1（杭州）”
+
+![创建实例](../../../images/cloud-deployment-3.png)
+
+- 选择实例类型，当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格。如果列表中无机型可选，请尝试选择其他的部署区域
+- 选中机型
+- 配置实例的密码
+- 选择部署区域，如下图中“可用区I”
+
+![选择区域](../../../images/cloud-deployment-4.png)
+
+- 点击下一步，进入订单确认页面
+- 勾选“权限确认”和“服务条款”中的复选框
+- 点击左下角绿色背景的开始免费试用，即可创建服务实例
+
+![确认](../../../images/cloud-deployment-5.png)
+
+### 3.5.启动TuGraph服务
+
+- 查看服务实例：服务实例创建成功后，部署时间大约需要2分钟。部署完成后，页面上可以看到对应的服务实例，如下图
+
+![查看实例](../../../images/cloud-deployment-6.png)
+
+- 点击该服务实例访问TuGraph。进入到对应的服务实例后，可以在页面上获取到web、rpc、ssh共3种使用方式，并且页面上展示了admin用户的密码
+
+![访问方式](../../../images/cloud-deployment-7.png)
+
+- 点击web的链接，即可跳转访问已经部署好的TuGraph Web。建议新手先通过TuGraph Web，快速使用demo上手。
+    - 首先在TuGraph Web的登录页面上，输入默认用户名admin和页面上展示的admin用户的密码进行登录，参考下图
+    - 登录完成后，选择任意一个带有官方图标的图项目，其中内置了demo数据，开启图数据的探索和发现！
+
+![登录](../../../images/cloud-deployment-8.png)
+![创建demo](../../../images/cloud-deployment-9.png)
+
+## 4.常见FAQ
+
+### 问题一：部署区域无可用资源
+
+有时，所选部署区域（如可用区G）没有所选套餐的可用资源，会报错如下图所示
+
+![部署区域错误](../../../images/cloud-deployment-10.png)
+
+__解决办法__：尝试选择其他区域，如可用区I等
+
+### 问题二: 启动后web访问不通
+
+web的启动需要一点点时间，请稍后刷新页面即可。
+
+### 问题三: 登录时的用户名密码不正确
+
+请注意检查，登录时使用的密码应为详情页面展示的密码。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..7a460830fa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/6.compile.md
@@ -0,0 +1,28 @@
+# 从源码编译
+
+> 本文档主要描述 TuGraph 从源码进行编译。
+
+## 1.前置条件
+
+推荐在linux系统下搭建TuGraph。同时docker环境是个不错的选择,如果你想设置一个新的环境，请参考[Dockerfile](3.docker-deployment.md)。
+
+## 2.编译介绍
+
+以下是编译TuGraph的步骤：
+
+1. 如果需要web接口运行`deps/build_deps.sh`，不需要web接口则跳过此步骤
+2. 根据容器系统信息执行`cmake .. -DOURSYSTEM=centos`或者`cmake .. -DOURSYSTEM=ubuntu`，如果需要shell运行lgraph_cypher，加上`-DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1`，如果在arm机器编译（如M1芯片的Mac中，需要加上` -DENABLE_BUILD_ON_AARCH64=ON`）
+3. `make`
+4. `make package` 或者 `cpack --config CPackConfig.cmake`
+
+示例：`tugraph/tugraph-compile-centos7`Docker环境
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos -DENABLE_PREDOWNLOAD_DEPENDS_PACKAGE=1
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..07d934f2dc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,201 @@
+# 数据库运行
+
+> 本文档主要描述 TuGraph 服务的运行模式、启动、停止和重启的操作,以及 TuGraph 的服务配置参数、配置文件格式和命令行配置参数。
+
+## 1.前置条件
+
+TuGraph 运行的前置条件为 TuGraph 正确安装，参考[安装流程](1.environment.md)。
+
+TuGraph 运行需要保证库文件 liblgraph.so 的文件位置在环境变量 LD_LIBRARY_PATH。
+
+运行 TuGraph 进程的用户不需要超级权限，但需要对配置文件（一般为lgraph.json）及文件中涉及的文件有读权限，并且对数据文件夹、日志文件夹等有写权限。
+
+## 2.运行模式
+
+TuGraph 可以作为前台普通进程启动，也可以作为后台守护进程启动。
+当作为普通进程运行时，TuGraph 可以直接将日志打印到终端，这在调试服务器配置时非常方便。但是，由于前台进程在终端退出后被终止，因此用户须确保在 TuGraph 服务器处于运行状态时，终端保持打开状态。另一方面，在守护进程模式下，即使启动它的终端退出，TuGraph 服务器也可以继续运行。因此，在长时间运行的服务器下推荐以守护进程模式启动 TuGraph 服务器。
+
+### 2.1.运行普通进程
+
+`lgraph_server -d run`命令可以将 TuGraph 作为普通进程运行。普通进程依赖命令行终端，因此终端结束时，TuGraph 进程也会自动终止。普通进程模式配合`--log_dir ""`可以将进程日志直接输出到终端，因此更方便调试。注：当不使用`-d run`命令时，将默认运行普通进程。
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d run -c lgraph_standalone.json --log_dir ""
+```
+或者：
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+普通模式的运行输出示例：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+普通进程模式下，用户可以通过按 `CTRL+C` 来提前终止 TuGraph 进程。
+
+### 2.2.运行进程守护模式
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+守护模式的运行输出示例：
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+## 3.服务操作
+
+### 3.1.启动服务
+
+TuGraph 需要通过 `lgraph_server -d start` 命令行启动，启动命令示例如下：
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+### 3.2.停止服务
+
+用户可以使用`kill`命令以及`lgraph_server -d stop`命令停止 TuGraph 守护进程。由于可能在同一台计算机上运行多个 TuGraph 服务器进程，因此我们使用`.pid`文件区分不同的服务器进程，该文件写入启动该进程的工作目录。因此，需要在相同工作目录中运行`lgraph_server-d stop`命令，以停止正确的服务器进程。
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.重启服务
+
+用户也可以通过`lgraph_server -d restart`来重启 TuGraph 服务：
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.服务配置
+
+TuGraph 服务器在启动时从配置文件和命令行选项加载配置，如果在配置文件和命令行中同一选项指定了不同的值，将优先使用命令行中指定的值。
+
+### 4.1.配置参数
+
+具体参数及其类型描述如下：
+
+| **参数名**                      | **<nobr>参数类型</nobr>** | **参数说明**                                                                                                                                                                          |
+|------------------------------|-----------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                    | 字符串                   | 数据文件所在目录。如果目录不存在 ，则自动创建。默认目录为 /var/lib/lgraph/data。                                                                                                                               |
+| durable                      | 布尔值                   | 是否开启实时持久化。关闭持久化可以减少写入时的磁盘 IO 开销，但是在机器断电等极端情况下可能丢失数据。默认值为 `true`。                                                                                                                  |
+| host                         | 字符串                   | REST 服务器监听时使用的地址，一般为服务器的 IP 地址。默认地址为 0.0.0.0。注：在HA模式下，host需要设置为对应服务器的IP地址，不能设置为0.0.0.0。                                                                                           |
+| port                         | 整型                    | REST 服务器监听时使用的端口。默认端口为 7070。                                                                                                                                                      |
+| enable_rpc                   | 布尔值                   | 是否使用 RPC 服务。默认值为 false。                                                                                                                                                           |
+| rpc_port                     | 整型                    | RPC 及 HA 服务所用端口。默认端口为 9090。                                                                                                                                                       |
+| enable_ha                    | 布尔值                   | 是否启动高可用模式。默认值为 false。                                                                                                                                                             |
+| ha_log_dir                   | 字符串                   | HA 日志所在目录，需要启动 HA 模式。默认值为空。                                                                                                                                                       |
+| verbose                      | 整型                    | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。默认值为 1。                                                                                                                                         |
+| log_dir                      | 字符串                   | 日志文件所在的目录。默认目录为 /var/log/lgraph/。                                                                                                                                                 |
+| ssl_auth                     | 布尔值                   | 是否使用 SSL 安全认证。当开启时，REST 服务器只开启 HTTPS 服务。默认值为 false。                                                                                                                               |
+| web                          | 字符串                   | web 文件（包含可视化部分）所在目录。默认目录为 /usr/local/share/lgraph/resource。                                                                                                                       |
+| server_cert                  | 字符串                   | 在 SSL 认证开启时，服务器所使用的 certificate 文件路径。默认路径为 /usr/local/etc/lgraph/server-cert.pem。                                                                                                 |
+| server_key                   | 字符串                   | 在 SSL 认证开启时，服务器所使用的公钥文件。默认目录为 /usr/local/etc/lgraph/server-key.pem。                                                                                                               |
+| enable_audit_log             | 布尔值                   | 是否启用审计日志，默认值为 false。                                                                                                                                                              |
+| audit_log_expire             | 整型                    | 启用审计日志时，日志的有效时间（小时），超时自动清理，值为 0 时表示不清理。默认值为 0。                                                                                                                                    |
+| audit_log_dir                | 字符串                   | 启用审计日志时，日志文件的存放目录。默认目录为 $directory/_audit_log_。                                                                                                                                   |
+| load_plugins                 | 布尔值                   | 启动服务时导入所有存储过程。默认值为 true。                                                                                                                                                          |
+| optimistic_txn               | 布尔值                   | 为 Cypher 开启乐观多线程写入事务。默认为 false。                                                                                                                                                   |
+| disable_auth                 | 布尔值                   | 关闭 REST 验证。默认为 false。                                                                                                                                                             |
+| ha_snapshot_interval_s       | 整型                    | 快照间隔（以秒为单位），默认值为 604800。-1表示不自动生成快照。                                                                                                                                              |
+| ha_heartbeat_interval_ms     | 整型                    | 心跳间隔（以毫秒为单位）。 默认值为 1000。                                                                                                                                                          |
+| ha_node_offline_ms           | 整型                    | 心跳超时且节点下线间隔（以毫秒为单位）。默认为 60000。                                                                                                                                                    |
+| ha_node_remove_ms            | 整型                    | 节点被视为完全死亡并从列表中删除的间隔（以毫秒为单位）。默认值为 120000。                                                                                                                                          |
+| ha_first_snapshot_start_time | 字符串                   | 第一次打快照的时间，格式为"HH:MM:SS"，表示为在下一个HH:MM:SS时间点第一次打snapshot，以后每ha_snapshot_interval_s秒打一次。默认值为""，表示在0-ha_snapshot_interval_s内的任一时刻随机打第一次snapshot，以后每ha_snapshot_interval_s秒打一次snapshot |
+| enable_ip_check              | 布尔值                   | 允许 IP 白名单，默认值为 false。                                                                                                                                                             |
+| idle_seconds                 | 整型                    | 子进程可以处于空闲状态的最大秒数。 默认值为 600。                                                                                                                                                       |
+| enable_backup_log            | 布尔值                   | 是否启用备份日志记录。 默认值为 false。                                                                                                                                                           |
+| backup_log_dir               | 字符串                   | 存储备份文件的目录。 默认值为空。                                                                                                                                                                 |
+| snapshot_dir                 | 字符串                   | 存储快照文件的目录。 默认值为空。                                                                                                                                                                 |
+| thread_limit                 | 整型                    | 同时使用的最大线程数。 默认值为 0，即不做限制，以 license 为准。                                                                                                                                            |
+| unlimited_token              | 布尔值                   | 是否将链接token设置为无期限。 默认值为 false，有效期为24小时。                                                                                                                                            |
+| reset_admin_password         | 布尔值                   | 是否重置管理者密码。 默认值为 false。 为 true 时，密码重置为`73@TuGraph`。                                                                                                                                |
+| enable_fulltext_index        | 布尔值                   | 是否启用全文索引功能，默认值为 false。                                                                                                                                                            |
+| fulltext_analyzer            | 字符串                   | 全文索引分词器类型。可设为`StandardAnalyzer`或者`SmartChineseAnalyzer`。默认是`StandardAnalyzer`                                                                                                     |
+| fulltext_commit_interval     | 整形                    | 全文索引数据提交周期,针对写操作，单位秒。默认是 0，立即提交。                                                                                                                                                  |
+| fulltext_refresh_interval    | 整形                    | 全文索引数据刷新周期，针对读操作，单位秒。默认是 0，立即可以读到最新写入的数据。                                                                                                                                         |
+| ha_conf                      | 字符串                   | 根据 host1:port1,host2:port2,host3:port3 初始化HA集群，默认值为空。                                                                                                                             |
+| ha_node_join_group_s         | 整形                    | 节点尝试加入高可用集群的等待时长，单位秒，默认是 10。                                                                                                                                                      |
+| ha_bootstrap_role            | 整形                    | 是否使用bootstrap方式启动，以及使用该方式启动的服务器角色，0代表不使用bootstrap方式启动，1代表使用bootstrap方式启动且本节点为leader，2代表使用bootstrap方式启动且本节点为follower，只有这3种选项。 默认值为 0。                                              |
+| help                         | 布尔值                   | 打印此帮助消息。 默认值为 false。                                                                                                                                                              |
+
+### 4.2.服务器配置文件
+
+TuGraph 的配置文件以 JSON 格式存储。建议将大多数配置存储在配置文件中，并且仅在需要时使用命令行选项临时修改某些配置参数。
+一个典型的配置文件如下：
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7070,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..1d38b39017
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,179 @@
+# 部署高可用模式
+
+> 此文档主要介绍了高可用模式的原理、准备工作、以及服务器的操作说明
+
+## 1.原理
+
+TuGraph 通过多机热备份来提供高可用（HA）模式。在高可用模式下，对数据库的写操作会被同步到所有服务器（非witness）上，这样即使有部分服务器宕机也不会影响服务的可用性。
+
+高可用模式启动时，多个 TuGraph 服务器组成一个备份组，即高可用集群。每个备份组由三个或更多 TuGraph 服务器组成，其中某台服务器会作为`leader`，而其他复制组服务器则作为`follower`。写入请求由`leader`
+提供服务，该`leader`将每个请求复制同步到`follower`，并在请求同步到服务器后才能响应客户端。这样，如果任何服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选择出新的`leader`。
+
+TuGraph的高可用模式提供两种类型的节点：`replica`节点和`witness`节点。其中，`replica`节点是普通节点，有日志有数据，可对外提供服务。
+而`witness`节点是一种只接收心跳和日志但不保存数据的节点。根据部署需求，`leader`节点和`follower`节点可以灵活的部署为`replica`节点或`witness`节点。
+基于此，TuGraph高可用模式的部署方式有两种：一是普通部署模式，二是带witness的简约部署模式。
+
+对于普通部署模式，`leader`和所有`follower`均为`replica`类型的节点。写入请求由`leader`提供服务，该`leader`将每个请求复制同步到`follower`，
+并在请求同步到超过半数的服务器后才能响应客户端。这样，如果少于半数的服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选举出新的`leader`，通过这种方式保证数据的一致性和服务的可用性。
+
+然而，在用户服务器资源不够或者发生网络分区时，不能建立正常的HA集群。此时，由于`witness`节点没有数据，对资源占用小，可以将`witness`节点和`replica`节点部署在一台机器上。
+例如，当只有2台机器的情况下，可以在一台机器上部署`replica`节点，在另一台机器上部署`replica`节点和`witness`节点，不仅节省资源，而且不需要把日志应用到状态机上，
+也不需要生成和安装快照，因此响应请求的速度很快，可以在集群崩溃或网络分区时协助快速选举出新的`leader`，这就是TuGraph HA集群的简约部署模式。
+尽管`witness`节点有诸多好处，但是由于没有数据，集群实际上增加了一个不能成为`leader`的节点，因此可用性会略有降低。为提高集群的可用性，
+可通过指定`ha_enable_witness_to_leader`参数为`true`，允许`witness`节点临时当主。`witness`节点在把新日志同步到其他节点之后，
+会将leader角色主动切换到有最新日志的节点。
+
+v3.6及以上版本支持此功能。
+
+## 2.准备工作
+
+要启用高可用模式，用户需要：
+
+- 三台及以上的 TuGraph 服务器实例。
+
+- 在启动 lgraph_server 时打开高可用模式，可以使用配置文件或者命令行将`enable_ha`选项设置为`true`。
+
+- 设置正确的`rpc_port`，可通过配置文件或者命令行设置。
+
+## 3.启动初始备份组
+
+安装好TuGraph之后，可以使用`lgraph_server`命令在不同的机器上启动高可用集群。本节主要讲解高可用集群的启动方式，启动之后的集群状态管理参见[lgraph_peer工具](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.初始数据一致
+
+当启动时所有服务器中的数据相同或没有数据时，用户可以通过指定`--ha_conf host1:port1,host2:port2`启动服务器。
+这种方式可以将准备好的所有TuGraph实例一次性加入初始备份组，由备份组中的所有服务器根据raft协议选举出`leader`，并将其他服务器以`follower`的角色加入备份组。
+
+启动初始备份组的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+### 3.2.初始数据不一致
+
+如果第一台服务器中已有数据（以`lgraph_import`工具导入或从非高可用模式的服务器传输得到），
+并且之前并未在高可用模式下使用，则用户应使用boostrap方式启动。
+以`ha_bootstrap_role`参数为1在bootstrap模式下启动有数据的服务器，并通过`ha_conf`参数指定本机为`leader`。
+在bootstrap模式下，服务器在将新加入的服务器添加到备份组之前会将自己的
+数据复制到新服务器中，以使每个服务器中的数据保持一致。
+
+启动有数据服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+其他无数据的服务器需要指定`ha_bootstrap_role`参数为2，并通过`ha_conf`参数指定`leader`即可，命令示例如下所示
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**使用bootstrap启动HA集群时需要注意两点：**
+1. 需要等待`leader`节点生成snapshot并且成功启动之后再加入`follower`节点，否则`follower`节点可能加入失败。在启动`follower`节点时可以将`ha_node_join_group_s`参数配置的稍大，以在加入HA集群时多次等待和超时重试。
+2. HA集群只有在第一次启动时可以使用bootstrap模式，后续再启动时只能使用普通模式(见3.1节)启动，尤其不能让同一个集群的多个节点以bootstrap模式启动，否则可能产生数据不一致的情况
+
+## 4.启动witness节点
+
+### 4.1.不允许witness节点成为leader
+
+`witness`节点的启动方式和普通节点的启动方式一致，只需要设置`ha_is_witness`参数为`true`即可。需注意，witness节点的数量应少于集群节点总数量的一半。
+
+启动`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+注：默认不允许`witness`节点成为`leader`节点，这可以提高集群的性能，但是在`leader`节点崩溃时会降低集群的可用性。
+
+### 4.2.允许witness节点成为leader
+
+可以通过指定`ha_enable_witness_to_leader`参数为`true`，使得`witness`节点可以临时成为`leader`节点，在将新日志同步完成之后再主动切主
+
+启动允许成为`leader`节点的`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+注：尽管允许`witness`节点成为`leader`节点可以提高集群的可用性，但是在极端情况下可能会影响数据的一致性。因此一般应保证`witness`节点数量+1少于集群节点总数量的一半。
+
+## 5.横向扩展其他服务器
+
+启动初始备份组后，如果想对备份组进行横向扩展，要将新服务器添加到备份组，
+应使用`--ha_conf HOST：PORT`选项，其中`HOST`可以是该备份组中已有的任何服务器的 IP 地址，
+而`PORT`是其 RPC 端口。例如：
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+此命令将启动一台高可用模式的 TuGraph 服务器，并尝试将其添加到包含服务器`172.22.224.15:9090`的备份组中。
+请注意，加入备份组需要服务器将其数据与备份组的`leader`服务器同步，此过程可能需要相当长的时间，具体取决于数据的大小。
+
+## 6.停止服务器
+
+当服务器通过`CTRL-C`下线时，它将通知当前的`leader`服务器，告知其从备份组中删除该下线的服务器。如果`leader`服务器下线，
+它将在下线前将`leader`身份权限传给另一台服务器。
+
+如果服务器被终止或者与备份组中的其他服务器失去连接，则该服务器将被视为失败节点，`leader`服务器将在特定时限后将其从备份组中删除。
+
+如果任何服务器离开备份组并希望重新加入，则必须从`--ha_conf HOST:PORT`选项开始，其中`HOST`是当前备份组中的某台服务器的 IP 地址。
+
+## 7.重启服务器
+
+不建议重新启动整个备份组，因为它会中断服务。如果需要，可以关闭所有服务器。但在重新启动时，
+必须保证关闭时的备份组中至少有N/2+1的服务器能正常启动，否则启动失败。 并且，
+无论初始启动复制组时是否指定`enable_bootstrap`为true，重启服务器时都只需通过
+指定`--ha_conf host1:port1,host2:port2`参数一次性重启所有服务器即可，命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker部署高可用集群
+
+在真实业务场景中，很可能遇到在多种操作系统或架构上部署高可用集群的需求。
+差异化的环境可能导致编译TuGraph时缺少某些依赖。因此，
+在docker中编译软件并部署高可用集群是非常有应用价值的。以centos7版本的docker为例，
+部署高可用集群的步骤如下所示。
+
+### 8.1.安装镜像
+使用如下命令下载TuGraph的编译docker镜像环境
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+然后拉取TuGraph源码并编译安装
+
+### 8.2.创建容器
+使用如下命令创建容器，使用`--net=host`使得容器运行在host模式，此模式下
+docker和宿主机和共享网络namespace，即共用同一个IP。
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.启动服务
+在每台服务器上使用如下命令启动服务，因为docker和宿主机共享IP，所以可以直接指定在宿主机IP上启动服务
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.查看服务器状态
+
+备份组的当前状态可以在 TuGraph 可视化工具、REST API 以及 Cypher 查询中获取。
+
+在 TuGraph 可视化工具中，可以在 DBInfo 部分中找到备份组中的服务器及其角色列表。
+
+使用 REST API 时，可以使用`GET /info/peers` 请求获取信息。
+
+在 Cypher 中，使用`CALL dbms.listServers()`语句来查询当前备份组的状态信息。
+
+## 10.高可用模式下数据同步问题
+
+在高可用模式下，同一备份组中的不同服务器可能并不总是处于相同的状态。出于性能原因，如果请求已同步到超过一半的服务器，则`leader`服务器将认为该请求属于`committed`状态。尽管其余服务器最终将收到新请求，但服务器的状态不一致将持续一段时间。客户端也可能向刚刚重新启动的服务器发送请求，从而具有较旧的状态。
+
+为了确保客户端看到一致连续的数据，特别是为了摆脱`反向时间旅行`问题（其中客户端读取比以前看到的状态更旧的状态），每个 TuGraph 服务器都会保持一个单调增加的数据版本号。备份组中数据版本号到数据库状态的映射全局一致，这意味着如果两台服务器具有相同的数据版本号，则它们必须具有相同的数据。响应请求时，服务器在响应中包含了其数据版本号。因此，客户端可以知道它看到了哪个版本。客户端收到旧版本的数据之后可以重新向Leader发送请求，从而获取到最新的数据。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..f2bf6bb3a5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+安装和运行
+============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..30a7d25af3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,483 @@
+# 数据导入
+
+> 此文档主要介绍 TuGraph 的数据导入功能。其中包括 CSV 格式的分隔符，jsonline 的格式示例，以及导入在线和离线的两种模式。
+
+## 1.简介
+
+在图数据库服务安装成功后，您可以使用`lgraph_import`批量导入工具将现有数据导入 TuGraph。`lgraph_import`支持从 CSV 文件和 JSON 数据源导入数据。
+
+> CSV 格式
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline 格式
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph 支持两种导入模式：
+
+- _离线模式_：读取数据并将其导入指定服务器的数据文件，应仅在服务器离线时完成。
+- _在线模式_：读取数据并将其发送到工作中的服务器，然后将数据导入其数据库。
+
+## 2.CSV文件格式分隔符
+
+    CSV格式的分隔符可以是单字符或多字符组成的字符串，其中不能包含`\r`或`\n`。注意不同的shell会对输入字符串做不同的处理，因此针对不同的shell输入参数可能需要不同的转义处理。
+
+此外，`lgraph_import`还支持以下转义字符，以便输入特殊符号：
+
+| 转义符 | 说明                                                             |
+| ------ | ---------------------------------------------------------------- |
+| \\     | 反斜杠`\\`                                                       |
+| \\a    | 响铃，即 ASCII 码 0x07                                           |
+| \\f    | form-feed，即 ASCII 码 0x0c                                      |
+| \\t    | 水平制表符，即 ASCII 码 0x09                                     |
+| \\v    | 垂直制表符，即 ASCII 码 0x0b                                     |
+| \\xnn  | 两位十六进制数，表示一个字节，如\\x9A                            |
+| \\nnn  | 三位八进制数，表示一个字节，如\\001, \\443，数值范围不能超过 255 |
+
+例：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.配置文件
+
+`lgraph_import`工具通过指定的配置文件进行环境配置。配置文件描述输入文件的路径、它们所代表的点/边以及点/边的格式。
+
+### 3.1.配置文件格式
+
+配置文件包含两部分：schema 和 files。`schema`部分定义 label，`files`部分描述要导入的数据文件。
+
+#### 3.1.1.关键字
+
+- schema (数组形式）
+  - label（必选，字符串形式）
+  - type（必选，值只能是 VERTEX 或者 EDGE）
+  - properties（数组形式，对于点必选，对于边如果没有属性可以不配置）
+    - name（必选，字符串形式）
+    - type （必选，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（可选，代表该字段可以配置，也可以不配置）
+    - index（可选，该字段是否需要建索引）
+    - unique（可选，该字段是否建索引，并且是 unique 类型的，即全局唯一）
+    - pair_unique（可选，该字段是否建索引，并且是 pari_unique 类型的，即两点间唯一，仅用于边索引）unique与pair_unique只能设置一个，同时设置并运行将会因为输入异常而终止
+  - primary (仅点配置，必选，主键字段，需指定一个 property，用来唯一确定一个点)
+  - temproal (仅边配置，可选，指定时间戳属性用于存储层排序)
+  - temporal_field_order (仅边配置，可选，默认为"ASC"，表示升序，也可配置为"DESC"，表示降序)
+  - constraints (仅边配置，可选，数组形式，起点和终点的 label，不配置或者为空代表不限制)
+  - detach_property (点边都可配置，可选，默认是`false`。`true` 代表属性数据单独存放，在内存不够，属性数据比较多的场景下可以减少io读放大)
+- files （数组形式）
+  - path（必选，字符串，可以是文件路径或者目录的路径，如果是目录会导入此目录下的所有文件，需要保证有相同的 schema）
+  - header（可选，数字，头信息占文件起始的几行，没有就是 0）
+  - format（必须选，只能是 JSON 或者 CSV）
+  - label（必选，字符串）
+  - columns（数组形式）
+    - SRC_ID (特殊字符串，仅边有，代表这列是起始点数据)
+    - DST_ID (特殊字符串，仅边有，代表这列是目的点数据)
+    - SKIP   (特殊字符串，代表跳过这列数据)
+    - [property]
+  - SRC_ID (仅边配置，值是起始点标签)
+  - DST_ID (仅边配置，值是目的点标签)
+
+#### 3.1.2.索引长度
+因为TuGraph对key的长度有限制，唯一索引不允许建立超过限制长度的索引，而非唯一索引会对超过长度限制的属性进行截断处理，并且在通过迭代器遍历非唯一索引时，拿到的key也是经过截断的，可能和预期不一致。针对不同类型的非唯一索引，截断长度是不同的。
+##### 3.1.2.1.unique索引
+unique索引是全局唯一的，该索引key的最大长度是480bytes。primary作为特殊的unique索引，因此最大key的长度也是480bytes，超过无法建立索引。
+##### 3.1.2.2.pair_unique索引
+pair_unique索引是指两点间唯一的索引，这种类型的索引只能创建于边的schema中，这种索引在用户指定的key后面加上了源点和目标点的vid，每个vid是5bytes长度。因此最大key的长度是470bytes，超过无法建立索引。
+##### 3.1.2.3.非唯一索引
+非唯一索引是指既没有设置unique为1，也没有设置pair_unique为1的索引，在TuGraph的实现中，此类索引一个key可能映射到多个值，为了加速查找和写入，在用户指定的key后面加上了一组vid或euid中的最大值。其中对于创建于点中的非唯一索引，key后面跟着vid，每个vid是5bytes长度，因此最大长度是475bytes。
+对于创建于边中的非唯一索引，key后面跟着euid，每个euid是24bytes长度，因此最大长度是456bytes。索引key超过对应长度则会自动截断。
+
+### 3.2.配置文件示例
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+对于上述配置文件，定义了三个 label：两个点类型`actor`和`movie`，一个边类型`role`。每个 label 都描述了：label 的名字、类型（点还是边）、属性字段有哪些以及每个字段的类型。对于点，另外定义了 primary 字段是哪个；对于边，另外定义了 constraints 字段，用来限制边的起点和终点只能是哪些组合。
+
+还描述了三个数据文件，两个点的数据文件`actors.csv`和`movies.csv`，一个边的数据文件`roles.csv`。每个部分都描述了：文件的路径（path）、数据类型（format）、信息头占开头几行（header）、是哪个 label 的数据（label）、文件中每行数据中的每个列对应的字段是哪个。
+
+对于上述配置文件，import 工具在执行的过程中会先在 TuGraph 中创建`actor`、`movie`、`role`这三个 label，然后再执行三个文件的数据导入。
+
+## 4.离线全量导入
+
+离线模式只能在离线状态的服务器使用。离线导入会创建一张新图，因此更适合新安装的 TuGraph 服务器上的第一次数据导入。
+要在离线模式下使用`lgraph_import`工具，可以指定`lgraph_import --online false`选项。要了解可用的命令行选项，请使用`lgraph_import --online false --help`：
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+命令行参数：
+
+- **-c, --config_file** `config_file`: 导入配置文件名，其格式要求见下述。
+- **--log** `log_dir`: 日志目录。默认为空字符串，此时将日志信息输出到控制台。
+- **--verbose** `0/1/2`: 日志等级，等级越高输出信息越详细。默认为 1。
+- **-i, --continue_on_error** `true/false`: 在碰到错误时跳过错误并继续，默认为 false，碰到错误立即退出。
+- **-d, --dir** `{diretory}`: 数据库目录，导入工具会将数据写到这个目录。默认为`./db`。
+- **--delimiter** `{delimiter}`: 数据文件分隔符。只在数据源是 CSV 格式时使用，默认为`","`。
+- **-u, --username** `{user}`: 数据库用户名。需要是管理员用户才能执行离线导入。
+- **-p, --password** `{password}`: 指定的数据库用户的密码
+- **--overwrite** `true/false`: 是否覆盖数据。设为 true 时，如果数据目录已经存在，则覆盖数据。默认为`false`。
+- **-g, --graph** `{graph_name}`: 指定需要导入的图种类。
+- **-h, --help**: 输出帮助信息。
+
+### 4.1.离线导入示例
+
+在这个例子中，我们使用上面描述的电影-演员数据来演示导入工具的使用方法。待导入数据分为三个文件：`movies.csv`，`actors.csv`，`roles.csv`。
+
+`movies.csv`包含的是电影的信息，其中每部电影有一个 id（作为检索的 primary key），此外每部电影还拥有 title、year 和 rating 等属性。（数据来自[IMDb](http://www.imdb.com)）。
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+对应的 jsonline 格式如下:
+也可以所有字段都是字符串形式，导入的时候会转换成对应的类型
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`包含的是演员的信息。每个演员也拥有一个 id，以及 name 等属性。
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> 对应的 jsonline 格式如下:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`则包含了演员在哪个电影中扮演了哪个角色的信息。其中每一行记录的是指定演员在指定电影里饰演的角色，对应数据库中的一条边。`SRC_ID` 和 `DST_ID` 分别是边的源点和目标点，他们分别是`actors.csv`和`movies.csv`中定义的`primary`属性。
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+对应的 jsonline 格式如下:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+`配置文件import.conf`，注意每个文件中有两个标题行，因此我们需要指定`HEADER=2`选项。
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+使用导入配置文件，我们现在可以使用以下命令导入数据：
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # 从import.conf读取配置信息
+        --dir /data/lgraph_db      # 将数据存放在/data/lgraph_db
+        --graph mygraph            # 导入名为 mygraph 的图
+```
+
+**注意**：
+
+- 如果名为`mygraph`的图已存在，导入工具将打印错误消息并退出。要强制覆盖图形，可以使用`--overwrite true` 选项。
+- 配置文件和数据文件必须使用 UTF-8 编码（或普通 ASCII 编码，即 UTF-8 的子集）存储。如果任何文件使用 UTF-8 以外的编码（例如，带有 BOM 或 GBK 的 UTF-8）编码，则导入将失败，并输出分析器错误。
+
+## 5.在线增量导入
+
+在线导入模式可用于将一批文件导入已在运行中的 TuGraph 实例中。这对于处理通常以固定的时间间隔进行的增量批处理更新非常便利。`lgraph_import --online true`选项使导入工具能够在线模式工作。与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据发送到正在运行的 TuGraph 实例中，该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+
+如果用户和密码有效，并且指定的图存在，导入工具将将数据发送到服务器，服务器随后解析数据并将其写入指定的图。数据将以大约 16MB 大小的包发送，在最近的换行符处中断。每个包都是以原子方式导入的，这意味着如果成功导入包，则成功导入所有数据，否则，任何数据都不会进入数据库。如果指定了`--continue_on_error true`，则忽略数据完整性错误，并忽略违规行。否则，导入将在第一个错误包处停止，并打印出已导入的包数。在这种情况下，用户可以修改数据以消除错误，然后使用`--skip_packages N`重做导入以跳过已导入的包。
+
+## 6.在线全量导入
+
+在线全量导入可用于将一批文件导入运行中的TuGraph实例，TuGraph支持将两种不同类型的数据在线导入到实例中：
+1. 和离线导入类型相同的原数据文件（csv等）
+2. TuGraph的底层存储文件，即data.mdb文件，该文件可以由离线导入生成，也可以是其他TuGraph db的文件。
+这两种方式的适用场景不同，第一种是直接将数据导入到TuGraph中，优点是一次性自动导入，操作步骤简单。但是会在server端启动一个离线导入线程，
+只适合单机情况下的小规模数据导入。第二种是将已经准备好的底层存储文件导入到TuGraph中，虽然需要提前准备好mdb文件，但是对系统资源却没有很高的要求，
+而且支持远程下载文件导入，非常方便，适用于高可用模式或者大规模数据的在线导入。
+
+### 6.1 从原数据导入
+从原数据导入的执行方式是向运行中的TuGraph实例发送导入请求，
+实例接到请求后先使用离线导入（V3）的方式将数据导入一个临时的db中，然后在实例中新建子图并将临时db的数据文件迁移到新子图中，最后刷新实例的元数据。
+相比在线增量导入，在线全量导入的性能更高。
+`lgraph_import --online true --online_type 1`选项使导入工具能够在线全量导入。
+与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --full              Whether to full import online. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据导入正在运行的 TuGraph 实例中，
+该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+并且，配置文件（config_file参数）要求是 TuGraph 实例机器上的uri路径，其file配置也要求是 TuGraph 实例机器上资源的绝对路径。
+
+如果用户和密码有效，导入工具将在服务器端执行在线全量导入。如果想导入的图已存在，可以使用`--overwrite true` 选项强制覆盖子图。
+
+### 6.2 从数据库文件导入
+从原数据在线全量导入尽管操作简单、性能较高，但是对服务器资源要求较高，且耗时较长。
+一种更加通用的方式是先使用离线导入在一个空db中导入子图，得到data.mdb文件，然后把该文件在线导入到
+TuGraph服务中。其使用方式如下所示：
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+除普通在线导入用到的url, user和password参数之外，从数据库文件导入的在线全量导入方式
+使用graph参数指定导入的子图名称，path参数指定文件路径，remote指定文件存在在远程或者本地。
+如果是本地文件，则需要保证HA集群中所有的节点在path路径下都有该文件。如果是远程文件，则会先下载再导入。
+需要注意的是，由于data.mdb只有一份，需要保证HA的各个节点和离线导入生成data.mdb的机器的环境完全一致，
+以保证不会出现环境问题。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..5544169de0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# 数据导出
+
+> 此文档主要介绍 TuGraph 的数据导出功能。
+
+## 1.简介
+
+TuGraph 可以通过 `lgraph_export` 工具来对已经存放在TuGraph的图数据进行数据导出。 `lgraph_export` 工具可以将指定 TuGraph 数据库的数据以 `csv` 或者 `json` 文件形式导出到指定目录，同时导出这些数据进行再导入时需要的配置文件 `import.config` ，详细描述可参见[配置文件](1.data-import.md)。
+
+## 2.导出命令
+
+该工具的命令示例如下：
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+其中：
+
+- `-d {database_dir}` 指定需要进行数据导出的数据库所在目录，默认值为 `./testdb`。
+- `-e {export_destination_dir}` 指定导出文件存放的目录，默认值为 `./exportdir`。
+- `-g {graph_to_use}` 指定图数据库的种类，默认为 `default` 。
+- `-u {username}` 指定进行该导出操作的用户的用户名。
+- `-p {password}` 指定进行该导出操作的用户的用户密码。
+- `-s {field_separator}` 指定导出文件的分隔符，默认为逗号。
+- `-f {output_format}` 指定导出数据的格式，`json`或者`csv`，默认为`csv`。
+- `-h` 除上述指定参数外，也可以使用该参数查看该工具的使用帮助。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..ce113ad0a4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,35 @@
+# 备份恢复
+
+> 此文档主要介绍 TuGraph 的数据备份和恢复功能。
+
+## 1.数据备份
+
+TuGraph 可以通过 `lgraph_backup` 工具来进行数据备份。
+`lgraph_backup` 工具可以将一个 TuGraph 数据库中的数据备份到另一个目录下，它的用法如下：
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+其中：
+
+- `-s {source_dir}` 指定需要备份的数据库（源数据库）所在目录。
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
+  如果目标数据库不为空，`lgraph_backup` 会提示是否覆盖该数据库。
+- `-c {true/false}` 指明是否在备份过程中进行 compaction。
+  compaction 能使产生的备份文件更紧凑，但备份时间也会变长。该选项默认为 `true`。
+
+## 2.数据恢复
+
+使用`lgraph_backup` 工具得到的目标数据库`{destination_dir}`备份了源数据库
+`{source_dir}`的所有子图，但不包含HA集群的raft信息，从而保证服务和集群能
+以备份数据库成功重启并与源数据库的数据一致。使用如下命令可以用备份数据库重启服务，
+在服务启动时会恢复所有子图的存储过程，保证备份服务和原服务完全一致。
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+其中：
+
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..c0c5afb7eb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# 数据预热
+
+> 此文档主要介绍 TuGraph 的数据预热功能。
+
+## 1.简介
+
+TuGraph 是基于磁盘的数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+## 1.数据预热命令
+
+数据预热可以通过工具 `lgraph_warmup` 来进行。它的使用示例如下：
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+其中：
+
+- `-d {db_dir}` 选项指定了 TuGraph 服务器的数据目录
+
+- `-g {graph_list}` 选项指定需要进行数据预热的图名称，用逗号分隔
+
+根据数据大小和所使用的磁盘类型不同，预热过程运行时间也不同。机械磁盘上预热一个大数据库可能耗时较长，请耐心等待。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..0a113bfa78
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# 集群管理
+
+> 此文档主要介绍 TuGraph HA 集群的管理工具，主要包括删除节点、leader转移和生成snapshot功能
+
+## 1. 简介
+
+HA集群启动之后，可以使用`lgraph_peer`工具进行集群管理，可以执行删除节点，转移leader和生成snapshot等功能。
+
+## 2. 删除节点
+
+对于TuGraph HA集群中长期离线或者产生网络分区的节点，可以使用`lgraph_peer`的`remove_peer`命令删除节点。命令示例如下所示：
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command remove_peer` 指定要执行的操作为remove_peer，即删除节点。
+- `--peer {peer_id}` 指定要删除节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 3. leader 转移
+
+当需要对主节点执行停机或重启操作时，为减少集群的不可服务时间，可以使用`lgraph_peer`的`transfer_leader`命令转移主节点。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command transfer_leader` 指定要执行的操作为transfer_leader，即转移主节点。
+- `--peer {peer_id}` 指定要成为主节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 4. 生成snapshot
+
+出于节点启动时设置ha_snapshot_interval_s为-1以默认不打snapshot或其他原因，
+当需要让某个节点手动生成snapshot时，可以使用`lgraph_peer`的`snapshot`命令。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+其中：
+
+- `--command snapshot` 指定要执行的操作为snapshot，即生成快照。
+- `--peer {peer_id}` 指定要生成快照的节点的rpc网络地址，如 `127.0.0.1:9092`。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..72b6187767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,134 @@
+# 命令行工具
+
+> 此文档主要介绍 lgraph_cypher 文档的使用，注意不再更新维护，请使用 [lgraph_cli](../7.client-tools/6.bolt-console-client.md)
+
+TuGraph 发布版本附带名为`lgraph_cypher`的查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+## 1.单命令模式
+
+在单命令模式下，`lgraph_cypher`可用于提交单个 Cypher 查询并将结果直接打印到终端，打印结果也可以容易地重定向写入指定文件。当用户需要从服务器获取大量结果并将其保存在文件中时，这非常便利。
+在此模式下，`lgraph_cypher`工具具有以下选项：
+
+### 1.1.命令行参数:
+
+| 参数     | 类型   | 说明                                                                     |
+| -------- | ------ | ------------------------------------------------------------------------ | ------ | ----------------------------------------------------------------------------------------------------------------------------------------- |
+| --help   | \\     | 列出所有参数及说明。                                                     |
+| -example | \\     | 列出命令实例。                                                           |
+| -c       | string | 数据库的配置文件，用于获取 ip 与 port 信息。                             |
+| -h       | string | 数据库服务器 ip 地址，如有配置文件则可舍去此参数。默认值为`127.0.0.1` 。 |
+| -p       | string | 数据库服务器端口，如有配置文件则可舍去此参数。默认值为`7071` 。          |
+| -u       | string | 数据库登录用户名。                                                       |
+| -P       | string | 数据库登录密码。                                                         |
+| -f       | string | 包含单条 Cypher 查询单文本文件的路径。                                   |
+| -s       | string | 单行 cypher 查询命令。以`"`开头结尾。                                    |
+| -t       | int    | 进行 cypher 查询时服务器的超时阈值。默认值为`150`秒。 -format            | string | 查询结果显示模式。支持`plain`与`table`两种格式。`plain`格式会将查询结果单列打印。`table`格式会将查询结果以表格方式显示。默认值为`table`。 |
+
+### 1.2.命令示例:
+
+**cypher 命令文件查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+```
+
+**cypher 命令单句查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+```
+
+## 2.交互模式
+
+`lgraph_cypher`也可以在交互模式下运行。在交互式模式下，客户端与服务器保持连接，并在读取-评估-打印-循环中与用户进行交互。
+
+### 2.1.进入 lgraph_cypher 交互模式:
+
+如不加`-f`或`-s`命令行选项，运行`lgraph_cypher`时将会进入交互模式。使用方式如下：
+
+```
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+```
+
+如成功进入则会显示相应登录成功信息：
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2023 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+现在我们也提供一个交互式 shell ，用于用户输入 Cypher 查询语句或使用`:help`命令来检查可用命令。
+
+### 2.2.command种类与说明:
+
+除 Cypher 查询外，`lgraph_cypher` 的 shell 还接受以下命令：
+
+| 命令                     | 对应参数                           | 说明                                                                                                |
+| ------------------------ | ---------------------------------- | --------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                 | 显示服务器信息与所有 command 对应说明。                                                             |
+| :db_info                 | \\                                 | 当前服务器状态查询。对应 REST API 的/db/info。                                                      |
+| :clear                   | \\                                 | 清空屏幕。                                                                                          |
+| :use                     | {图的名称}                         | 使用该名称指定的图，默认值为`default` 。                                                            |
+| :source                  | `-t {查询timeout值} -f {查询文件}` | 可交互模式下的 cypher 命令文件查询。超时阈值默认值为`150`秒。查询文件格式参考无交互式查询参数。     |
+| :exit                    | \\                                 | 退出交互模式并返回原命令行。                                                                        |
+| :format                  | `plain` or `table`                 | 更改 cypher 查询结果的显示模式。支持`plain`与`table`模式。                                          |
+| :save all/command/result | `-f {文件路径}` `{cypher语句}`     | 存储 cypher 命令（command）或查询结果（result）或以上二者（all）。默认存储位置为`/saved_cypher.txt` |
+
+**注意:**
+
+- 每条命令都应该以冒号开始 `:`.
+
+**:save 命令例子:**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+```
+
+### 2.3.cypher 查询命令:
+
+在交互模式下，用户也可直接输入单句 cypher 命令进行查询，以"`;`"结束。输入命令不区分大小写。例子如下：
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher`输入命令时支持多行输入，用户可使用`ENTER`键将长查询语句分多行输入。多行输入情况下命令行开头会从`>`变为`=>`，然后用户可以继续输入查询的其余部分。
+
+例子如下：
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### 2.4.辅助功能:
+
+**历史查询：** 在交互模式下按上下方向键可查询输入历史。
+
+**自动补全：** lgraph_cypher 会根据输入历史进行自动补全。在补全提示出现的情况下，按下右方向键就会自动补全命令。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..643597f2bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,435 @@
+# TuGraph-DataX
+
+> 此文档主要介绍 TuGraph DataX 的安装编译和使用示例
+
+## 1.简介
+
+TuGraph 在阿里开源的 DataX 基础上添加了 TuGraph 的写插件以及 TuGraph jsonline 数据格式的支持，其他数据源可以通过 DataX 往 TuGraph 里面写数据。
+TuGraph DataX 介绍 [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX)，支持的功能包括：
+
+- 从 MySQL、SQL Server、Oracle、PostgreSQL、HDFS、Hive、HBase、OTS、ODPS、Kafka 等各种异构数据源导入 TuGraph
+- 将 TuGraph 导入相应的目标源 （待开发）
+
+![导入导出](../../../images/tugraph-datax.png)
+
+DataX 原始项目介绍参考 [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.编译安装
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+编译出来的 DataX 文件在 target 目录下
+
+## 3.文本数据通过DataX导入TuGraph
+
+我们以 TuGraph 手册中导入工具 lgraph_import 章节举的数据为例子，有三个 csv 数据文件，如下：
+`actors.csv`
+
+```
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+```
+
+`movies.csv`
+
+```
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+`roles.csv`
+
+```
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+```
+
+然后建三个 DataX 的 job 配置文件：
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后依次执行如下三个命令：
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## 4.MySQL数据通过DataX导入TuGraph
+
+我们在 `test` database 下建立如下电影 `movies` 表
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+往表中插入几条数据
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+建立一个 DataX 的 job 配置文件
+
+`job_mysql_to_tugraph.json`
+
+**配置字段方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**写简单 sql 方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后执行如下命令：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..ea866abf5d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph-Explorer
+
+> TuGraph Explorer 已经合并到 [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/9.restful.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/9.restful.md
new file mode 100644
index 0000000000..1a62bd27a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/9.restful.md
@@ -0,0 +1,198 @@
+# TuGraph-Restful-Server
+
+> TuGraph Restful Server 强依赖 TuGraph，Restful Server 与 Tugraph 共存
+
+## 1.TuGraph-Restful-Server 简介
+TuGraph Restful Server 使用brpc框架支持的http协议，提供restful接口查询功能，在实现中，restful server 与rpc server 使用同一个端口。目前restful接口提供文件上传，数据导入，导入进度查询，cypher查询，文件删除等功能
+
+## 2.启动 TuGraph-Restful-Server
+需要在启动Tugraph时设置enable_rpc参数为true的方式，正常启动TuGraph
+
+## 3.连接 TuGraph-Restful-Server
+TuGraph正常启动后，Restful Server 将监听在rpc_port上， 通过访问 http://${ip}:${rpc_port}/LGraphHttpService/Query/ url可以链接到TuGraph
+
+## 4.数据格式
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+## 5.返回值
+
+通用返回格式
+
+|  body参数  | 参数说明  |  参数类型  |  是否必填  |
+|:--------:|:-----:|:------:| :-----: |
+| errorCode |  状态码  |  字符串  |  是  |
+| errorMessage | 错误信息  |  字符串  |  是  |
+| data | 返回的数据 |  字符串  |  是  |
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 401 Unauthorized: 未通过鉴权认证，例如用户名密码错误，token超过有效期等
+- 500 Internal Server Error: 服务器端错误
+  当操作成功时，返回的 data 中包含操作的返回值。
+  当发生输入错误或者服务器错误时，返回的 errorMessage 中包含错误提示。
+
+## 6.URI格式
+
+| URI               | 说明                 |
+|-------------------|--------------------|
+| /cypher           | 执行cypher查询请求       |
+| /refresh          | 刷新token请求          |
+| /login            | 用户登陆请求             |
+| /logout           | 用户登出请求             |
+| /upload_files     | 上传文件请求             |
+| /clear_cache      | 清理用户上传文件请求         |
+| /check_file       | 文件认证请求             |
+| /import_data      | 数据导入请求             |
+| /import_progress  | 导入进度查询请求           |
+| /import_schema    | 批量创建schema请求       |
+
+## 7.接口
+### 7.1 用户登陆
+用于用户第一次与服务端通信时的鉴权操作，请求报文在 http body 中携带用户名和密码，响应报文在 http body 中会返回一个带有有效期的token，后续请求中需要在http header中携带该token作为凭证
+#### 7.1.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/login
+#### 7.1.2 REQUEST
+|  body参数  |  参数说明  |  参数类型  |  是否必填  |
+|:--------:|:------:|:------:| :-----: |
+ | userName |  用户名  |  字符串  |  是  |
+ | password |   密码   |  字符串  |  是  |
+#### 7.1.3 RESPONSE
+|    body参数     | 参数说明  |  参数类型  |  是否必填  |
+|:-------------:|:-----:|:------:| :-----: |
+| authorization | token |  字符串  |  是  |
+
+### 7.2 刷新token
+token到期后将无法使用此token与服务端正常通信，需要获取新的token作为后续请求的凭证，请求报文在http header中携带旧的token，响应报文在http body中返回新的token
+#### 7.2.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/refresh
+#### 7.2.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+#### 7.2.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| authorization | 新的token |  字符串  |  是  |
+
+### 7.3 用户登出
+用户不再需要与服务端进行通信时，需要请求登出接口，释放自己的token。请求报文在http header中携带旧的token，如果拿到返回errorCode为200的响应报文即为正常登出
+#### 7.3.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/logout
+#### 7.3.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+### 7.4 执行cypher查询请求
+用户通过此类请求发cypher给server端执行并获取执行结果，请求报文在http body 中将执行的cypher语句和目标子图发送给server，server执行完成后在响应报文的http body中返回执行结果
+#### 7.4.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/cypher
+
+#### 7.4.2 REQUEST
+| body参数 |    参数说明    |  参数类型  |  是否必填  |
+|:------:|:----------:|:------:| :-----: |
+| graph  |   查询目标子图   |  字符串  |  是  |
+| script | cypher查询语句 |  字符串  |  是  |
+
+#### 7.4.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| result | 返回结果 |  字符串  |  是  |
+
+### 7.5 上传文件请求
+用户通过此类请求向server发送文件，可以对文件进行分片，分片大小不大于1MB，支持多线程乱序发送，请求报文在http header 中包含文件名，第一字节内容在文件中的偏移和分片大小，在body中包含文件内容，server收到请求后将验证分片大小是否与分片内容一致，一致时将文件分段写入文件。不一致时将返回errorCode为400的响应
+#### 7.5.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/upload_files
+
+#### 7.5.2 REQUEST
+| header参数  |    参数说明    |  参数类型  |  是否必填  |
+|:---------:|:----------:|:------:| :-----: |
+| File-Name |   文件名   |  字符串  |  是  |
+| Begin-Pos | 开始位置在文件内的偏移 |  字符串  |  是  |
+|   Size    | 文件分片大小 |  字符串  |  是  |
+|  body参数   |  参数说明   |  参数类型  |  是否必填  |
+|     -     | 文件内容 |  字符串  |  是  |
+
+### 7.6 文件认证请求
+用户通过此类请求验证发送到server端的文件是否与期望一致，server端使用两种验证方式，md5值和文件长度，目前已支持文件长度验证。
+#### 7.6.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/check_file
+#### 7.6.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| fileName |           文件名           |  字符串  |  是  |
+| checkSum |        文件对应md5值         |  字符串  |  否  |
+| fileSize |       文件长度(以字节计算)       |  字符串  |  否  |
+| flag | 标记位，为1时校验md5值，为2时校验文件长度 |  字符串  |  是  |
+
+#### 7.6.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| pass | 检查成功为true，否则为false |  bool  |  是  |
+
+### 7.7 批量创建schema请求
+用户通过此类请求批量创建schema，请求报文在http body 中将创建schema的目标子图和schema信息发送给server，如果拿到返回errorCode为200的响应报文即为正常创建
+#### 7.7.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_schema
+#### 7.7.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| graph |   创建目标子图   |  字符串  |  是  |
+| schema | schema描述信息 |  字符串  |  是  |
+
+### 7.8 数据导入请求
+用户通过此类请求导入已经上传的数据文件。导入不论成功或失败，都将删除已上传文件。数据导入请求在server中实现为一个异步任务，响应返回并不意味着导入已完成，返回的是任务id，后续可以通过此任务id查询导入进度
+#### 7.8.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_data
+#### 7.8.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  | 是否必填 |
+|:--------:|:-----------------------:|:------:|:----:|
+| graph |         导入目标子图          |  字符串  |  是   |
+| schema |       导入schema描述        | json字符串  |  是   |
+| delimiter |           分隔符           |  字符串  |  是   |
+| continueOnError |     单行数据出错是否跳过错误并继续     |  boolean  |  否   |
+| skipPackages |         跳过的包个数          |  字符串  |  否   |
+| taskId |  任务id   |  字符串  |  否   |
+| other | 其他参数 |  json字符串  |  否   |
+
+#### 7.8.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| taskId | 任务编号 |  字符串  |  是  |
+
+### 7.9 清理用户上传文件请求
+用户通过此类请求清理已经上传的文件，如果拿到返回errorCode为200的响应报文即为正常清理
+#### 7.9.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/clear_cache
+#### 7.9.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| fileName |    文件名称    |  字符串  |  否  |
+| userName |    用户名称    |  字符串  |  否  |
+| flag | 标记位， flag = 0时删除fileName指定文件, flag = 1时删除userName指定用户已经上传的所有文件， flag = 2时删除所有用户上传的文件 |  字符串  |  是  |
+
+### 7.10. 导入进度查询请求
+用户通过此类请求获得导入任务的状态
+#### 7.10.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_progress
+#### 7.10.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| taskId |           任务编号           |  字符串  |  是  |
+
+#### 7.10.3 RESPONSE
+| body参数 |                  参数说明                   |  参数类型  |  是否必填  |
+|:------:|:---------------------------------------:|:------:| :-----: |
+| state  | 状态标记，为0表示准备导入，为1表示导入中，为2表示导入成功，为3表示导入失败 |  字符串  |  是  |
+|  progress  |             导入进度，state为1时包含             |  字符串  |  否  |
+|  reason  |             失败原因，state为3时包含             |  字符串  |  否  |
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..00a7df7efb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+实用工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..cacf2d18bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/1.python-client.md
@@ -0,0 +1,237 @@
+# Python客户端
+
+> 此文档主要是TuGraph Python SDK的使用说明, 注意将来不再更新维护，建议使用 [bolt客户端](./5.bolt-client.md)
+
+## 1. 概述
+Python的TuGraph Client有两种，一种是RESTful的Client，使用HTTP方法向server发送请求，另一种是RPC的Client，使用RPC方法调用server远程服务，两者各有优劣。
+RESTful client的使用方式简单，在项目的src/client/python/TuGraphClient目录下可以找到Client的源码文件，直接安装到用户环境中即可使用，但是支持的功能较少，
+性能也不高。RPC Client既支持单机的server，也支持高可用集群和负载均衡，接口较多，功能强大。但是使用方式较为复杂，需要用户自己编译TuGraph项目得到liblgraph_client_python.so，
+或者使用runtime镜像时直接在/usr/local/lib64目录下找到该依赖库，将其引入python项目即可正常使用。接下来将详细介绍这两种Client的使用方式。
+
+## 2. RESTful Client
+
+### 2.1.安装Client
+
+TuGraph的Python RESTful client使用setuptools工具进行打包和分发，用户可以将client直接安装到本地环境中，在使用时即可直接引入。
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+注：使用setuptools工具安装python client时会安装httpx等依赖，需要在通外网的环境下执行。
+
+### 2.2.调用Cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = await aclient.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.调用存储过程
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+res = await aclient.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python的TuGraph Rpc Client是使用pybind11包装的CPP Client SDK，下表列出了Python和CPP Client SDK的对应关系。
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+Python RPC Client的使用方式较为复杂，用户可以在本地环境中编译TuGraph得到liblgraph_client_python.so，也可以使用官方提供的runtime镜像，
+在镜像中的/usr/local/lib64目录下可以直接找到该依赖库，引入用户项目即可使用。
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.实例化client对象
+
+#### 3.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 3.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 3.2.调用cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.3.向leader发送cypher请求
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.4.调用GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.5.向leader发送GQL请求
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.6.调用存储过程
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.7.向leader调用存储过程
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 3.8.加载存储过程
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 3.9.列举存储过程
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.10.删除存储过程
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 3.11.从字节流中导入schema
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.12.从字节流中导入点边数据
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 3.13.从文件中导入schema
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.14.从文件中导入点边数据
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..ce29ac4bf4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,340 @@
+# C++客户端
+
+> 此文档主要是TuGraph C++ SDK的使用说明。
+
+## 1.概述
+C++ Client 能够使用 RPC 连接lgraph_server，进行数据导入、执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直接连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化。
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.3.向leader发送cypher请求
+```C++
+    std::string str;
+    bool ret = client.CallCypherToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```C++
+    std::string str;
+    bool ret = client.CallGql(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGql(std::string& result, const std::string& gql,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling gql.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.5.向leader发送GQL请求
+```C++
+    std::string str;
+    bool ret = client.CallGqlToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGqlToLeader(std::string& result, const std::string& gql,
+                 const std::string& graph = "default", bool json_format = true,
+                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true);
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+
+### 2.8.加载存储过程
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送请求。
+
+### 2.10.删除存储过程
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..7abfeb9639
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/3.java-client.md
@@ -0,0 +1,290 @@
+# Java客户端
+
+> 此文档主要是TuGraph Java SDK的使用说明，需要注意的是TuGraph Java SDK将来不再更新维护，建议使用 [bolt客户端](./5.bolt-client.md)
+
+## 1.编译java client代码
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+## 2.使用示例
+
+### 2.1.实例化client对象
+
+添加maven依赖
+
+```xml
+<dependency>
+    <groupId>com.antgroup.tugraph</groupId>
+    <artifactId>tugraph-db-java-rpc-client</artifactId>
+    <version>1.4.1</version>
+</dependency>
+```
+
+引入依赖
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.3.向leader发送cypher请求
+```java
+    String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```java
+    String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling GQL
+    @return: the result of GQL query execution
+    public String callGql(String gql, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.5.向leader发送GQL请求
+```java
+    String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```java
+    String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedureToLeader : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @return: the result of procedure execution
+    public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 2.8.加载存储过程
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.10.删除存储过程
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException 
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout) 
+            throws UnsupportedEncodingException, IOException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..a9c06de71b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,174 @@
+# TuGraph-OGM
+
+## 1.简介
+
+> TuGraph-OGM 项目在其他仓库开源。
+
+TuGraph-OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。同时 TuGraph-OGM 兼容 Neo4j-OGM，Neo4j 生态用户可以无缝迁移到 TuGraph 数据库上。
+
+### 1.1.TuGraph-OGM 功能
+
+TuGraph-OGM 提供以下函数操作 TuGraph：
+
+| 功能                            | 用法                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| 插入单个节点\边                 | void session.save(T object)                                                      |
+| 批量插入节点\边                 | void session.save(T object)                                                      |
+| 删除节点与对应边                | void session.delete(T object)                                                    |
+| 删除指定 label 的全部节点       | void session.deleteAll(Class\<T> type)                                           |
+| 清空数据库                      | void purgeDatabase()                                                             |
+| 更新节点                        | void session.save(T newObject)                                                   |
+| 根据 id 查询单个节点            | T load(Class<T> type, ID id)                                                     |
+| 根据 ids 查询多个节点           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| 根据 label 查询全部节点         | Collection\<T> loadAll(Class\<T> type)                                           |
+| 条件查询                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher 查询（指定返回结果类型） | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher 查询                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.编译 TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.使用 TuGraph-OGM
+
+详细示例请参考 demo 文件夹下的 TuGraphOGMDemo ###在`pom.xml`中引入依赖
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // 构建Movie节点
+    @Id
+    private Long id;      // Movie节点的id
+    private String title; // title属性
+    private int released; // released属性
+
+    // 构建边ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // 构建Actor节点
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// 配置
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//启动driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// 开启session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.通过OGM进行增删改查
+
+```java
+// 增
+Movie jokes = new Movie("Jokes", 1990);  // 新建Movie节点jokes
+session.save(jokes);                     // 将jokes存储在TuGraph中
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // 将speed节点与alice节点通过ACTS_IN进行连接
+session.save(speed);                    // 存储两个节点与一条边
+
+// 删
+session.delete(alice);                  // 删除alice节点以及相连的边
+Movie m = session.load(Movie.class, jokes.getId());   // 根据jokes节点的id获取jokes节点
+session.delete(m);                                    // 删除jokes节点
+
+// 改
+speed.setReleased(2018);
+session.save(speed);                   // 更新speed节点属性
+
+// 查
+Collection<Movie> movies = session.loadAll(Movie.class);  // 获取所有Movie节点
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // 查询所有小于1995年发布的电影
+
+// 调用Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // 查询Speed为2018的Movie
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // 创建节点Label Director
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // 创建边Label DIRECT
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // 获取create结果
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // 查看创建节点数目
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //查看创建边数目
+
+// 清空数据库
+session.deleteAll(Movie.class);        // 删除所有Movie节点
+session.purgeDatabase();               // 删除全部数据
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..d3bac11367
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,15 @@
+# Bolt客户端
+
+TuGraph目前兼容了Neo4j的bolt协议，可以直接使用Neo4j的客户端访问TuGraph。
+
+## 开启bolt端口
+
+如果使用的是TuGraph的docker容器，配置文件在 `/usr/local/etc/lgraph.json`
+
+在TuGraph的配置文件中添加 `bolt_port=7687`（端口号自己看情况修改），开启bolt端口，Neo4j的客户端需要与这个端口连接。
+
+## Neo4j客户端使用限制
+
+目前还没有兼容Neo4j bolt协议的全部功能，Neo4j客户端的显示事务功能目前还不支持，使用客户端的时候注意避免使用这个功能。
+
+在代码目录中的demo/Bolt下面有golang、java、js、python、rust 这几个语言的的例子，可供参考。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..bd3ff0f0ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,102 @@
+# TuGraph console client
+
+`lgraph_cli` 是基于bolt协议的 console client，c++编写，使用时需要连接tugraph的bolt端口。
+
+`lgraph_cli` 是一个二进制的可执行文件，不依赖其他动态库，拷贝到一台linux机器上就可执行。
+
+## `lgraph_cli`使用
+
+语句以分号结束，输入`exit`, `quit`或者Ctrl-C退出客户端。
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+语句可以中间换行，多行输入。
+
+```powershell
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+非交互式
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+从文件读取多条命令
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## 在线数据导出
+
+lgraph_cli 支持流式读取，导出数据只需要把lgraph_cli的输出重定向到文件中即可，导出格式支持csv和json。
+
+### csv格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..beb44d41aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,340 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+## 2.请求与响应格式
+TuGraph HTTP Server 接收json格式的请求，经过鉴权后开始提取请求中的字段，根据定义好的接口逻辑处理请求，并返回json格式的响应。
+
+### 2.1.标准响应格式
+每一个响应都以标准响应格式返回，格式如下：
+
+| body参数  | 参数说明         | 参数类型        | 是否必填       |
+| ------- |--------------|-------------|------------|
+| errorCode   | 业务级错误码       | int类型       | 是          |
+| success   | 请求是否成功       | int类型       | 是          |
+| errorMessage   | 业务级错误信息      | 字符串类型       | 是          |
+| data   | 请求成功时返回的响应信息 | json字符串     | 是          |
+
+### 2.2请求类型
+
+#### 2.2.1. 用户登陆
+用户在登陆请求中携带用户名和密码发送到服务端。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，在后续的请求中将令牌加入请求头的Authorization域中。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| userName   | 用户名  | 字符串类型   | 是          |
+| password   | 用户密码 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+| default_password  | 默认密码 | 布尔类型 | 是          |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. 用户登出
+用户登出，同时删除已经认证的token，用户后续发送请求时，需要重新登陆，并获取新的token。
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data为空
+
+#### 2.2.3. 身份刷新
+已下发的token失效后，需要调用本接口重新认证。后端验证token合法性。token在初次登录后，1小时内有效，过期需要刷新
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+
+#### 2.2.4. 调用cypher
+用户对TuGraph的增删改查请求需要调用cypher接口，并通过标准的cypher查询语言发起
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明     | 参数类型  | 是否必填       |
+| ------- |----------|-------|------------|
+| graph   | 查询的子图名称  | 字符串类型   | 是          |
+| script   | cypher语句 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含查询结果
+
+| body参数  | 参数说明 | 参数类型    | 是否必填       |
+| ------- |------|---------|------------|
+| result   | 查询结果 | json字符串 | 是          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. 上传文件
+接口用于将本地文件上传至TuGraph所在机器。可以上传文本文件，二进制文件，可以上传大文件，也可以上传小文件，对于大文件，客户端在上传时应该对文件做切分，每个文件分片不大于1MB，参数Begin-Pos和Size对应本次分片在完整文件中的偏移量与分片大小。参数需要放在http请求的报文头，请求内容对应文件分片内容。本接口请求头不止有token参数
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header参数  | 参数说明        | 参数类型             | 是否必填       |
+| ------- |-------------|------------------|------------|
+| File-Name   | 文件名称        | 字符串类型            | 是          |
+| Begin-Pos   | 开始位置在文件内的偏移 | 可以转成size_t类型的字符串 | 是          |
+| Size   | 本次请求文件分片大小    | 可以转成size_t类型的字符串 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+#### 2.2.6. 检查文件
+本接口用于检查已上传文件正确性，如果成功通过检查，再次上传同一文件时，直接返回成功
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明           | 参数类型          | 是否必填        |
+| ------- |----------------|---------------|-------------|
+| fileName   | 文件名称           | 字符串类型         | 是           |
+| checkSum   | 文件对应md5值       | 可以转成int类型的字符串 | flag为"1"时必填 |
+| fileSize   | 文件长度(以字节计算)    | 可以转成int类型的字符串  | flag为"2"时必填 |
+| flag   | 标记位，flag为1时校验md5。flag为2时校验文件长度 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| pass   | 检查成功为true，否则为false | bool类型 | 是          |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. 清理缓存文件
+admin用户可以删除所有用户上传的文件，其他用户可以删除自己的上传的文件，可以删除指定名称的文件，指定用户上传的文件，也可以删除所有文件
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明        | 参数类型          | 是否必填        |
+| ------- |-------------|---------------|-------------|
+| fileName   | 文件名称        | 字符串类型         | flag为"0"时必填 |
+| userName   | 用户名称        | 字符串类型 | flag为"1"时必填 |
+| flag   | 标记位，flag为0时删除fileName指定文件, flag为1时删除userName指定用户已经上传的所有文件，flag为2时删除所有用户上传的文件 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. 导入schema
+本接口可以根据用户指定的schema信息创建schema模型，schema的详细格式信息请参考data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明       | 参数类型          | 是否必填        |
+| ------- |------------|---------------|-------------|
+| graph   | 子图名称       | 字符串         | 是           |
+| description   | schema描述信息 | json字符串 | 是 |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. 导入数据
+本接口允许用户指定已经通过上传，校验的文件作为数据文件，按照schema参数描述的配置信息，导入到graph参数指定的子图中。导入过程是异步的，server在接收到导入请求后，返回一个任务id
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明  | 参数类型    | 是否必填 |
+| ------- |-------|---------|----|
+| graph   | 子图名称  | 字符串类型   | 是  |
+| schema   | 导入schema描述 | json字符串 | 是  |
+| delimiter   | 分隔符   | 字符串类型   | 是  |
+| continueOnError   | 单行数据出错是否跳过错误并继续 | boolean类型 | 否  |
+| skipPackages   | 跳过的包个数 | 可以转成int类型的字符串 | 否  |
+| taskId   | 任务id，用于重启出错的任务 | 字符串类型 | 否 |
+| flag   | 标记位，flag为1时导入成功将删除数据文件 | 可以转成int类型的字符串 | 否 |
+| other   | 其他参数 | 可以转成int类型的字符串 | 否  |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| taskId   | 任务编号 | 字符串类型 | 是          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. 导入进度查询
+本接口用于查询导入任务的执行进度
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明                 | 参数类型    | 是否必填 |
+| ------- |----------------------|---------|----|
+| taskId   | import_data接口返回的任务id | 字符串类型 | 是 |
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明    | 参数类型             | 是否必填    |
+| ------- |---------|------------------|---------|
+| success   | 	是否成功导入 | boolean类型        | 是       |
+| reason   | 	导入失败原因 | 字符串类型            | success为false时必填 |
+| progress   | 	当前导入进度 | 可以转成double类型的字符串 | 是       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..21ad033477
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,273 @@
+# RPC API
+
+> 此文档主要介绍 TuGraph 的 RPC API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供丰富的 RPC API，以供开发者通过 RPC 请求远程调用 TuGraph 提供的服务。
+
+RPC（远程过程调用）是一种通过网络从远程计算机程序上请求服务，而不需要了解底层网络技术的协议。
+相比REST，RPC 面向方法，主要用于函数方法的调用，可以适合更复杂通信需求的场景，且性能更高。
+brpc是用c++语言编写的工业级RPC框架，基于brpc，TuGraph 提供了丰富的RPC API，本文档描述
+TuGraph 的 RPC API 使用方式。
+
+## 2.请求
+
+### 2.1.建立连接
+
+开发者向TuGraph服务发送RPC请求，首先要建立连接。以C++语言为例，开发者创建指定url的通道（channel），
+由通道创建指定的服务存根（LGraphRPCService_Stub），后续即可通过存根像调用本地方法一样向远程
+服务器发送请求。
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.请求类型
+
+TuGraph支持10种RPC请求，其中每种请求的功能如下表所示：
+
+| 请求              | 功能         |
+|-----------------|------------|
+| GraphApiRequest | 点边索引操作请求   |
+| CypherRequest   | cypher请求   |
+| PluginRequest   | 存储过程请求     |
+| HARequest       | 高可用模式请求    |
+| ImportRequest   | 数据导入请求     |
+| GraphRequest    | 子图操作请求     |
+| AclRequest      | 权限管理请求     |
+| ConfigRequest   | 配置管理请求     |
+| RestoreRequest  | 备份请求       |
+| SchemaRequest   | schema管理请求 |
+
+用户发送请求时，需要传入以下参数：
+- client_version: 可选参数，HA模式下可通过对比`client_version`和`server_version`防止响应过时的请求
+- token: 必要参数，客户端登陆之后获得token，每次请求传入token以校验用户身份
+- is_write_op: 可选参数，标志请求是否是写请求
+- user: 可选参数，HA模式下主从之间同步请求时设置user，不需验证token
+
+服务处理完RPC请求之后发回响应，响应消息中除了包含每个请求的单独响应信息之外，还包含以下参数：
+- error_code: 必要参数，标志请求处理状态
+- redirect: 可选参数，HA模式下向follower发送写请求时处理失败，设置redirect为请求转发地址，即leader地址
+- error: 可选参数，请求错误信息
+- server_version: 可选参数，HA模式的请求响应中设置`server_version`以避免client读取数据时发生反向时间旅行问题
+
+:warning:  **除CypherRequest、PluginRequest、HARequest和AclRequest外，其余RPC接口将逐步废弃，其功能统一至CypherRequest接口。**
+
+## 3.登录
+
+登录请求信息包含以下参数：
+- user: 必要参数，用户名
+- pass: 必要参数，密码
+以C++为例，用户使用构建好的服务存根发送登录请求：
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+登录响应信息包含以下参数：
+- token: 必要参数，登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。
+如果登录失败会收到“Authentication failed”错误。
+
+## 4.查询
+用户可以通过Cypher查询和TuGraph进行绝大多数的交互，Cypher请求信息包含以下参数：
+- query: 必要参数，Cypher查询语句
+- param_names: 可选参数，参数名
+- param_values: 可选参数，参数值
+- result_in_json_format: 必要参数，查询结果是否以JSON格式返回
+- graph: 可选参数，Cypher语句执行的子图名称
+- timeout: 可选参数，Cypher语句执行的超时时间
+
+以C++为例，用户发送Cypher请求的方式如下所示：
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+Cypher请求响应为以下两个参数之一：
+- json_result: JSON格式的cypher查询结果
+- binary_result: CypherResult格式的cypher查询结果
+
+## 5.存储过程
+为满足用户较为复杂的查询/更新逻辑，TuGraph支持 C 语言和 Python 语言编写的存储过程。
+用户可以使用RPC请求对存储过程进行增删改查操作。
+
+### 5.1.加载存储过程
+加载存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- read_only: 必要参数，是否只读
+- code: 必要参数，存储过程文件读入生成的ByteString
+- desc: 可选参数，存储过程描述
+- code_type: 可选参数，存储过程代码类型，PY、SO、CPP、ZIP四者之一
+
+以C++为例，用户加载存储过程的方式如下所示：
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+加载存储过程的响应不包含参数，如果加载失败则抛出BadInput异常
+
+### 5.2.调用存储过程
+
+调用存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- param: 必要参数，存储过程参数
+- result_in_json_format: 可选参数，调用结果是否以JSON格式返回
+- in_process: 可选参数，未来支持
+- timeout: 可选参数，调用存储过程的超时时间
+
+以C++为例，用户调用存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+调用存储过程的响应为以下两个参数之一：
+- reply: ByteString格式的存储过程调用结果
+- json_result: JSON格式的存储过程调用结果
+
+### 5.3.删除存储过程
+
+删除存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+
+以C++为例，用户删除存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+删除存储过程的响应不包含参数，如果删除失败则抛出BadInput异常
+
+### 5.4.列举存储过程
+
+列举存储过程请求不需要参数，以C++为例，用户列举存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+列举存储过程的响应的参数如下所示：
+- reply: JSON格式的procedure列表
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..1928d70f07
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2918 @@
+# RESTful API Legacy
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+**注意：除"登陆"、"查询"和"存储过程"外，其余接口自 **2023年4月30日** 起将不再提供支持，统一使用Cypher接口提供服务。**
+
+## 2.请求与数据格式
+
+### 2.1请求
+
+TuGraph 支持 HTTP GET/POST/PUT/DELETE 请求。其中：
+
+- GET 请求用于只读请求，如读取点属性，边属性等操作；
+- POST 请求用于创建实体，提交 Cypher，以及加载和调用存储过程；
+- PUT 请求用于修改已有实体，如修改点属性，边属性等；
+- DELETE 请求用于删除已有实体，如删除点，边等。
+
+在高可用模式下，用户可以在请求的报头(request header)中设置 `server_version` 来保证请求的服务器有足够新的数据。
+当前的 `server_version` 可以从服务器返回的报头中获取。
+
+### 2.2.数据格式
+
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.3.返回值
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 307 Temporary Redirect: 操作被重定向，一般用于高可用模式下，把操作重定向到 master 上
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 500 Internal Server Error: 服务器端错误
+
+当操作成功时，返回的 JSON 中包含操作的返回值。当操作重定向时，返回的 HTTP 报头中的 `location` 域包含重定向目的地址。
+当发生输入错误或者服务器错误时，返回的 JSON 中包含 `error_message` 域，其内容是错误提示。
+
+在高可用模式下，服务器还会在报头中设置 `server_version`，以告知客户端当前服务器的数据版本号。当客户端在不同的服务器之间切换时，该数据版本号可以保证客户端不会读到错误的历史数据。
+
+### 2.4.URI格式
+
+TuGraph REST API 提供以下功能：Service Root, login, info, label, index, node, relationship, cypher, cpp_plugin, 以及 python_plugin。
+各功能使用的 URI 格式如下：
+
+| URI     | 说明                 |
+| ------- | -------------------- |
+| /web    | web 可视化界面       |
+| /cypher | cypher 请求          |
+| /acl    | 权限控制             |
+| /user   | 用户管理             |
+| /login  | 用户登录             |
+| /info   | 数据库状态及提示信息 |
+| /task   | 任务管理             |
+| /db     | 子图操作             |
+
+其中子图操作又分为：
+
+| URI                              | 说明                 |
+| -------------------------------- | -------------------- |
+| /db                              | 子图的创建，删除     |
+| /db/_{graph_name}_/node          | 点操作             |
+| /db/_{graph_name}_/relationship  | 边操作               |
+| /db/_{graph_name}_/label         | Label 相关操作       |
+| /db/_{graph_name}_/index         | 索引相关操作         |
+| /db/_{graph_name}_/cypher        | 子图相关 cypher 操作 |
+| /db/_{graph_name}_/cpp_plugin    | C++存储过程          |
+| /db/_{graph_name}_/python_plugin | Python 存储过程      |
+| /db/_{graph_name}_/import        | 在线导入             |
+| /db/_{graph_name}_/misc          | 其它操作             |
+
+## 3.登录
+
+TuGraph 提供基于 JWT 的用户认证方式，可以使用 HTTP 或 HTTPS 协议进行传输。系统默认使用 HTTP 协议，如果需要使用 HTTPS，需要在 lgraph.json 配置文件中将 ssl_auth 设为 1。
+
+### 3.1.登录
+
+用户通过用户名和密码发送登录请求。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，并且用于以后的每次发送请求。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**: `/login`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+  | default_password | 是否为默认密码 | 布尔值 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.身份刷新
+Token失效后，前端发起刷新token接口，后端验证token合法性。初次登录后，1小时内有效，需刷新使用。即使刷新，24小时后也会强制退出，需要重新登陆。
+验证通过，生成新的token；验证失败返回状态码401。
+
+- **URI**: `/refresh`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.修改Token有效期
+修改Token有效期，需要传输jwt，refresh_time和expire_time三个参数，其中jwt用于校验用户身份，refresh_time和expire_time等于0时，有效期为无期限，超过refresh_time时，需要调用refresh接口获取新的Token;超过expire_time时，需要重新登录。
+
+- **URI**: `/update_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+  | refresh_time | 有效时间（默认设置为0） | Int64 |
+  | expire_time | 有效时间（默认设置为0） | Int64 |
+
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0,
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.查询Token有效期
+查询Token有效期，需要传输jwt，用于校验用户身份，返回，refresh_time和expire_time，其中refresh_time表示刷新时间，超过时需要调用refresh接口获取新的Token;expire_time表示过期时间，超过时需要重新登录。
+- **URI**: `/get_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+
+- **RESPONSE**:  如果成功，返回"refresh_time"和"expire_time"。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+
+### 3.5.登出
+用户登出，同时删除token。
+
+- **URI**: `/logout`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/logout
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 4.查询
+
+URI 格式为
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.调用Cypher
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 列表 |
+  | elapsed | 运行时间（秒） | 浮点数 |
+  | header | 返回结果的表头 | 列表 |
+  | size | 结果数 | 整型 |
+
+其中 header 是一个列表，每一元素格式如下：
+
+| 域名 | 说明                                        | 类型   |
+| ---- | ------------------------------------------- | ------ |
+| name | 列名                                        | 字符串 |
+| type | 列数据类型，0 为标量，1 为点 id，2 为向量 |        |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.调用带参数的 Cypher
+
+Cypher 支持使用参数进行查询。当调用带参数的 Cypher 查询时，TuGraph 会缓存该查询的
+执行计划（execution plan），以加速后续同类查询的速度。
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+  | parameters | 参数 | 列表 |
+
+- **RESPONSE**:
+
+与 [调用 Cypher](#%E8%B0%83%E7%94%A8Cypher) 相同。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+
+## 5.存储过程
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.加载存储过程
+
+TuGraph 服务启动时，如果 load_plugins 为真，则会自动加载 plugin 目录下的所有 plugin。否则需要手动加载。此外，如果服务器运行过程中，管理员更新了 plugin 文件，也需要手动重新加载。重新加载 plugin 的调用格式为：
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 插件名称 | 字符串 |
+  | description | 插件说明 | 字符串 |
+  | code_base64 | 插件代码 | 字符串，使用 base64 编码 |
+  | read_only | 是否为只读存储过程 | 布尔值 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 5.2.列出所有存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程列表，其中每个元素是一个 plugin 的描述，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.获取存储过程的详细信息
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程信息，包括代码，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+  | code_base64 | 存储过程的代码 | 字符串，使用 base64 编码 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.调用存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: POST
+- **REQUEST**: 字符串输入
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | data | 输入数据 | 字符串 |
+  | timeout | 超时长度（秒，可选，缺省值为 0） | 浮点 |
+  | in_process | 是否在本进程调用（可选，缺省值为 false） | 布尔值 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.删除存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 6.Deprecated
+
+以下接口将在4/30/2023之后被删除。
+
+### 6.1.用户管理
+
+系统默认创建一个管理员，管理员用户名为 _admin_，密码为 _73@TuGraph_。为了安全起见，请用户在第一次启动服务器后更改密码。
+
+
+#### 6.1.1.添加用户
+
+添加一个新的用户，并为其设置初始密码。只有管理员有权限进行此操作。其中用户名只能由字母，数字以及下划线构成，密码则可以包含任意字符。用户名和密码长度不能超过 64 字节。添加用户时还可以为用户增加一个描述，用户描述可以包含任意字符，最长不超过 512 字节。
+
+新用户默认拥有同名的角色，不具备任何图的权限。
+
+- **URI**: `/user`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "description": "This is a user"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.列出所有用户
+
+列出数据库的所有用户。只有管理员拥有该操作权限。
+
+- **URI**: `/user/`
+- **METHOD**: GET
+- **RESPONSE**: 所有用户及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin admin user",
+        "roles": ["admin"]
+    },
+    "guest1": {
+        "disabled": true,
+        "description": "",
+        "roles": ["guest1", "some_other_role"]
+    }
+}
+```
+
+#### 6.1.3.获取用户信息
+
+列出给定用户的信息。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "A guest user"
+    "roles": ["guest1", "some_other_role"]
+}
+```
+
+#### 6.1.4.列出用户权限
+
+列出给定用户有权限访问的所有图及相应权限。
+
+- **URI**: `/user/{user_name}/graph`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1/graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "graph1" : "FULL",
+    "graph2" : "READ"
+}
+```
+
+#### 6.1.5.更改用户密码
+
+用户可以更改自己的密码，更改密码时需要同时提供原密码。管理员可以更改所有用户的密码。管理员更改其它用户密码时，可以不提供当前密码。
+
+- **URI**: `/user/{user_name}/password`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | current_password | 当前密码 | 字符串 |
+  | new_password | 新密码 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/password
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.6.修改用户描述
+
+用户可以修改自己的描述。管理员可以修改任意用户的描述。
+
+- **URI**: `/user/{user_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "New description for this user."
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.7.删除用户
+
+删除用户及其所有相关权限，只有管理员拥有该操作权限。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.8.禁用用户
+
+用户可以被禁用。被禁用的用户将不能登陆，但是其资料仍然保存。被禁用的用户可以被重新启用。
+
+- **URI**: `/user/{user_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.9.启用用户
+
+启用一个被禁用的用户。
+
+- **URI**: `/user/{user_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.10.设置用户角色
+
+为指定用户设置角色。只有管理员可以执行此操作。
+
+用户角色列表必须是“全量列表”，即该列表需要包含该用户需要的所有角色。唯一的例外是用户的同名角色，即使列表中不含该角色，它也会被加到用户角色中。
+
+- **URI**: `/user/{user_name}/role`
+- **METHOD**: POST
+- **REQUEST**: 角色列表
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+        ["role1", "role2"]
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+此时用户`guest1`拥有角色`guest1`, `role1`和`role2`。
+
+### 6.2.角色管理
+
+TuGraph 使用基于角色的权限管理。
+
+同一用户可以拥有多个角色。新用户默认拥有与其同名的角色。删除用户时，同名角色也会被删除。如果新建用户时同名角色已经存在，则创建失败。
+
+同一角色可以对多个图有不同的权限。用户对某张图的权限由其所有角色对该图的最高权限决定。
+
+TuGraph 使用四级权限，不用的用户对不同的子图可以有不同的权限，四种权限及其说明如下：
+
+| 权限  | 说明                                                                             |
+| ----- | -------------------------------------------------------------------------------- |
+| NONE  | 无权限                                                                           |
+| READ  | 只读                                                                             |
+| WRITE | 可读写子图中的点和边                                                           |
+| FULL  | 完全权限，包括更改元数据（label, index），管理存储过程，以及删除子图中的所有数据 |
+
+管理员对所有子图都有完全权限，新建的用户对所有子图都没有权限。将用户加入管理员角色中可以将用户提升为管理员。
+
+#### 6.2.1.添加角色
+
+添加一个新的角色，并设置其描述。只有管理员有权限进行此操作。
+
+角色名只能由字母，数字以及下划线构成，密码则可以包含任意字符。角色名长度不能超过 64 字节。
+
+角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | role | 角色名 | 字符串 |
+  | description | 角色描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "role": "new_role",
+        "description": "This is a new role.",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.2.修改角色描述
+
+修改角色的描述。只有管理员有权限进行此操作。角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role/{role_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 新描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "modified description"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.列出所有角色
+
+列出数据库的所有角色。只有管理员拥有该操作权限。
+
+- **URI**: `/role/`
+- **METHOD**: GET
+- **RESPONSE**: 所有角色及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin administrator group.",
+        "permissions": {"default":"FULL", "graph1":"FULL"}
+    },
+    "role1": {
+        "disabled": true,
+        "description": "Another role",
+        "permissions": {"default":"READ"}
+    }
+}
+```
+
+#### 6.2.4.获取角色信息
+
+列出给定角色的信息。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: GET
+- **RESPONSE**: 角色信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "Another role",
+    "permissions": {"default":"READ"}
+}
+```
+
+#### 6.2.5.删除角色
+
+删除指定角色，只有管理员拥有该操作权限。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.6.禁用角色
+
+角色可以被禁用。角色被禁用后，具有该角色的用户将不再从该角色中获得任何权限。只有管理员可以执行此操作。
+
+- **URI**: `/role/{role_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.7.启用角色
+
+启用一个被禁用的角色。
+
+- **URI**: `/role/{role_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.8.设置角色权限
+
+为指定角色设置权限。只有管理员可以执行此操作。
+
+角色权限列表必须是“全量列表”，即该列表需要包含该角色能操作的所有图及其权限。
+
+- **URI**: `/role/{role_name}/permissions`
+- **METHOD**: POST
+- **REQUEST**: 图名称及相应权限的字典。
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/permissions
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "graph1" : "FULL",
+        "graph2" : "READ"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.服务器状态
+
+#### 6.3.1.修改服务器配置
+
+修改服务器配置，配置修改后立即生效，并将影响所有服务器。这些配置的优先级高于配置文件以及命令行参数。
+
+- **URI**: `/config`
+- **METHOD**: PUT
+- **REQUEST**:
+
+请求为一个字典，使用 `{"opt1":v1}` 可以将名为`opt1`的配置修改为`v1`。
+
+| 配置名               | 说明                   | 值类型 |
+| -------------------- | ---------------------- | ------ |
+| OPT_DB_ASYNC         | 是否启用异步模式       | 布尔值 |
+| OPT_TXN_OPTIMISTIC   | 是否默认使用乐观事务锁 | 布尔值 |
+| OPT_AUDIT_LOG_ENABLE | 是否启用审计日志       | 布尔值 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "OPT_DB_ASYNC": true,
+        "OPT_AUDIT_LOG_ENABLE": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.当前服务器状态
+
+- **URI**: `/info`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | lgraph_version | 服务器版本号 | 字符串 |
+  | git_branch | 服务器代码分支 | 字符串 |
+  | git_commit | 服务器代码版本 | 字符串 |
+  | web_commit | 前端码版本 | 字符串 |
+  | cpp_id | CPP 编译器 ID | 字符串 |
+  | cpp_version | CPP 编译器版本 | 字符串 |
+  | python_version | PYTHON 版本 | 字符串 |
+  | node | 点 uri | 字符串 |
+  | relationship | 边 uri | 字符串 |
+  | cpu | cpu 信息 | 字典，格式参见[服务器 CPU 状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8CPU%E7%8A%B6%E6%80%81) |
+  | disk | 硬盘 IO 信息 | 字典，格式参见[服务器硬盘状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%A1%AC%E7%9B%98%E7%8A%B6%E6%80%81) |
+  | memory | 内存信息 | 字典，格式参见[服务器内存状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%86%85%E5%AD%98%E7%8A%B6%E6%80%81) |
+  | db_space | 图数据库占用空间 | 字典，格式参见[图数据库占用空间](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8D%A0%E7%94%A8%E7%A9%BA%E9%97%B4) |
+  | db_config | 图数据库配置信息 | 字典，格式参见[图数据库配置信息](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E9%85%8D%E7%BD%AE%E4%BF%A1%E6%81%AF) |
+  | up_time | 数据库在线时长（秒） | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.服务器 CPU 状态
+
+- **URI**: `/info/cpu`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序 CPU 使用率 | 整型 |
+  | server | 服务器 CPU 使用率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.服务器硬盘状态
+
+- **URI**: `/info/disk`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | read | 服务器硬盘读速率 | 整型 |
+  | write | 服务器硬盘写速率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.服务器内存状态
+
+- **URI**: `/info/memory`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序内存使用量 | 整型 |
+  | server_avail | 服务器可用内存 | 整型 |
+  | server_total | 服务器总内存 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.图数据库占用空间
+
+- **URI**: `/info/db_space`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | space | 图数据库占用空间 | 整型 |
+  | disk_avail | 图数据库可用空间 | 整型 |
+  | disk_total | 服务器硬盘总空间 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "disk_avail"::360074579968,
+      "disk_total"::984373800960,
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.图数据库配置信息
+
+- **URI**: `/info/db_config`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | db_async | 图数据库工作模式（同步或异步） | 布尔值 |
+  | disable_auth | 是否禁用身份验证 | 布尔值 |
+  | enable_ha | 是否启用高可用模式 | 布尔值 |
+  | enable_rpc | 是否启用 RPC 服务器 | 布尔值 |
+  | bind_host | REST 服务器的主机 | 字符串 |
+  | enable_audit_log | 是否启用日志审计 | 布尔值 |
+  | port | REST 服务器的端口 | 整型 |
+  | rpc_port | RPC 服务器的端口 | 整型 |
+  | optimistic_txn | 是否默认使用乐观事务锁 | 布尔值 |
+  | thread_limit | 图数据库应用程序的可用线程数 | 整型 |
+  | enable_ssl | 是否使用 SSL 进行身份验证 | 布尔值 |
+  | verbose | 输出的详细程度 | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "db_async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "bind_host":"127.0.0.1",
+      "enable_audit_log":false,
+      "port":7070,
+      "optimistic_txn":false,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "enable_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.8.高可用服务器列表
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/peers`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回一个服务器信息列表，其中每个服务器信息格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+  | state | 服务器状态 | 字符串 |
+
+其中服务器状态可为 `MASTER`,`SLAVE`,`OFFLINE`。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.9.当前 Leader 信息
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/leader`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前 leader 服务器信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.10.服务器统计信息
+
+- **URI**: `/info/statistics`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前服务器统计信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | requests/second | 每秒处理的请求数量 | 浮点型 |
+  | writes/second | 每秒处理的写请求数量 | 浮点型 |
+  | running_tasks | 正在执行的请求数量 | 整型 |
+  | failure_rate | 请求失败率 | 浮点型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 2.3,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.11.审计日志信息
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | begin_time | 查询日志的起始时间(必填，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | end_time | 查询日志的结束时间(默认为当前时间，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | user | 查询日志的操作者(管理员可查询所有用户的日志，普通用户只能查询本人日志) | 字符串 |
+  | num_log | 查询日志的数量(默认为 100) | 整型 |
+  | descending_order | 查询结果是否降序输出(默认为 true) | 布尔值 |
+
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回审计日志列表，其中每个元素是一条操作日志，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | index | 该操作的索引值 | 整型 |
+  | begin_time | 该操作的开始时间 | 字符串 |
+  | end_time | 该操作的结束时间 | 字符串 |
+  | user | 该操作的发起者 | 字符串 |
+  | graph | 该操作的图 | 字符串 |
+  | type | 该操作的类型 | 字符串 |
+  | read_write | 该操作为读操作或者写操作 | 字符串 |
+  | success | 该操作是否成功 | 布尔值 |
+  | content | 该操作的简要内容 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.任务管理
+
+TuGraph 提供长任务的跟踪和中止功能。用户可以通过 REST API 来查询当前正在运行的在 Cypher 和存储过程查询，并选择中止正在执行的查询。
+
+任务管理对应的 URI 格式为
+
+```
+    http://{host}:{port}/task/{thread_id}/{task_id}
+```
+
+#### 6.4.1.查询正在执行的任务
+
+- **URI**: `/task`
+- **METHOD**: GET
+- **RESPONSE**:
+
+返回的 JSON 为一个数组，其中每一个元素格式如下：
+
+| 域名         | 说明                         | 类型   |
+| ------------ | ---------------------------- | ------ |
+| description  | 任务描述                     | 字符串 |
+| time_elapsed | 任务已经执行的时间，单位为秒 | 浮点   |
+| task_id      | 任务 ID                      | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.中止任务
+
+- **URI**: `/task/{task_id}`
+  其中 `{task_id}` 是 `GET /task` 返回结果中的 `task_id`。
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.5.子图管理
+
+TuGraph 支持多子图，子图之间完全独立，不同的子图可以对不同用户开放不同权限。管理员可以添加和删除子图。
+
+#### 6.5.1.创建新子图
+
+- **URI**: `/db`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 子图名 | 字符串 |
+  | config | 配置 | 字典，格式为 { {列名 1}:{列值 1},... } |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1",
+        "config" : {
+            "max_size_GB":2048,
+            "description": "description of graph1"
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.删除子图
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.列出所有子图
+
+- **URI**: `/db`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_GB":1024,
+            "description":"description of graph1"
+        }
+    }
+```
+
+#### 6.5.4.获取子图信息
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "max_size_GB":1024,
+        "description":"description of graph1"
+    }
+```
+
+### 6.6.元数据管理
+
+TuGraph 是一个具备多图能力的强模式属性图数据库。在每一张子图中，每种点和边都需要有预定义的数据格式。数据格式由 Label 决定，每种 Label 都有自己的数据格式。用户可以使用 REST API 添加，删除和查询 Label 及其对应的数据格式。
+
+Label 操作对应的 URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+其中{type}可以是 node 或者 relationship。
+
+#### 6.6.1.创建Label
+
+创建 Label 的过程同时也是定义其数据类型的过程。只有创建了 Label 才能在图中插入相应类型的点或者边。
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | Label 名 | 字符串 |
+  | fields | 数据列定义 | 列表 |
+  | is_vertex | 是否是点 Label | 布尔值 |
+  | primary | 点的主键属性 | 字符串 |
+  | edge_constraints | 边的约束 | 列表 |
+
+`primary` 在 `is_vertex` 为 `true` 的时候设置，这个字段只有点才有, 创建点的时候必须设置。
+
+`edge_constraints` 在 `is_vertex` 为 `false` 的时候设置，这个字段只有边有。这个字段限制了该边的起点和终点只能是哪些点的组合，比如：`[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`，限制了该边只能是从 `vertex_label1` 到 `vertex_label2` 和 从 `vertex_label3` 到 `vertex_label4`。如果不想有任何限制，不设置该字段即可。
+
+其中`fields`为一个数组，其中每个元素定义数据的一列，内容如下：
+
+| 域名     | 说明                                     | 类型                                                                                                |
+| -------- | ---------------------------------------- | --------------------------------------------------------------------------------------------------- |
+| name     | 列名                                     | 字符串                                                                                              |
+| type     | 列数据类型                               | 字符串，有以下类型： int8, int16, int32, int64, float, double, string, date, datetime, binary, bool |
+| optional | 数据是否可以为空（可选，缺省值为 false） | 布尔值                                                                                              |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.列出所有 Label
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | edge | 边 Label 列表 | 列表 |
+  | vertex | 点 Label 列表 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.获取 Label 的数据格式定义
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+- **METHOD**: GET
+- **RESPONSE**: 数据列定义表，类型是一个词典，key 为列名，value 为列定义，列定义见如下：
+-
+
+| 域名     | 说明             | 类型   |
+| -------- | ---------------- | ------ |
+| optional | 该列值是否可为空 | 布尔值 |
+| type     | 列值类型         | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema 导入
+
+- **URI**: `/db/{graph_name}/schema/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+- **RESPONSE**:
+
+Schema 导入会根据 description 比较新的 Schema 和数据库中原有的 Schema 是否兼容，检查的粒度为 Label。如果不一致则出错，如果一致则添加原先 Schema 中不存在的 Label，返回 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串:
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.点操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+Nodes 提供节点（Vertex）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。
+
+#### 6.7.1.列出点数量和label数量
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | num_label | 点 label 数量 | 整数 |
+  | num_vertex | 点数量 | 整数 |
+
+_注意 num_vertex 返回的并不是准确的点数量，只是一个估计值。_
+
+#### 6.7.2.创建一个点
+
+向数据库中插入一个点。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 点属性 | 字典，其中 key 是列名，value 是相应值。value 必须是与列类型相应的类型，如列为 int32，则 value 只能是整数。 |
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新点 vid。该 ID 可用于后续的点操作中。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.批量创建点
+
+TuGraph 允许一次性插入多个点，以减少网络开销。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | fields | 点属性 | 列表 |
+  | values | 点数据 | 列表 |
+
+其中 fields 是一个字符串列表，列出一系列列名；values 是一个列表，其中每个元素是一个列表，列表中每个元素是列数据。
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新增加的点的 vid 列表，该列表中每一个 vid 按顺序对应请求中的每一个点。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.获取点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 属性 | 字典，格式为 { {列名 1}:{列值 1},...} |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.删除点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 被删掉的点的入边数量 | 整数值 |
+  | out | 被删掉的点的出边数量 | 整数值 |
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.获取点所有属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+- **METHOD**: GET
+- **RESPONSE**: Node 所有属性（字典）
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.获取点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: Node 某一属性
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.更新点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 点属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "********"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.8.边操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+与 Nodes 功能类似，Relationships 提供边（edge）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。每一条边都可以由一个唯一 ID（euid）来标识。这个 ID 可以从在插入边时获得，或者在 [列出所有边](#%E5%88%97%E5%87%BA%E6%89%80%E6%9C%89%E8%BE%B9) 操作中得到。
+
+#### 6.8.1.创建一条边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | destination | 目的点 ID | 整数值 |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid（字符串）。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.批量创建边
+
+- **URI**: `/db/{graph_name}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | fields | 数据列名 | 列表 |
+  | edge | 边数据 | 列表 |
+
+其中 edge 是一个数据列表，其中每个元素都是一条边，其定义如下：
+
+| 域名        | 说明     | 类型                                                   |
+| ----------- | -------- | ------------------------------------------------------ |
+| source      | 起点 id  | 整数                                                   |
+| destination | 终点 id  | 整数                                                   |
+| values      | 数据列表 | 列表，每列对应 fields 中的一个列，类型是该列对应的类型 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid 列表。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.列出所有出边（outgoing relationships）
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+- **METHOD**: GET
+- **RESPONSE**: 点 src 的所有出边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.列出所有入边（incoming relationships）
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+- **METHOD**: GET
+- **RESPONSE**: 点 dst 的所有入边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.列出所有边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 入边 | 列表 |
+  | out | 出边 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationships/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.获取边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | property | 边属性 | 字典 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.删除边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.获取边的所有属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+- **METHOD**: GET
+- **RESPONSE**: 边属性字典
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.获取边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功,返回代码 200,同时返回边的属性。如果失败,返回代码 400,同时返回 "Illegal field."。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.更新边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.9.索引
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+提供索引操作，接受 GET/POST 请求。
+
+#### 6.9.1.创建索引
+
+该操作会启动一个创建索引的后台任务，用户可以通过列出该 Label 相关的所有索引来检查新建索引的状态。
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: POST
+- **REQUEST**:
+
+| 域名    | 说明     | 类型                                  |
+|-------|--------|-------------------------------------|
+| label | Label 名 | 字符串                                 |
+| field | 域名     | 字符串                                 |
+| type  | 索引类型   | int类型，0表示非唯一索引，1表示全局唯一索引，2表示两点间唯一索引 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.列出所有索引
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.列出所有与某个 Label 相关的索引
+
+- **URI**: `/db/{graph_name}/index/{label}`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.删除索引
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.根据索引获取点
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+- **METHOD**: GET
+- **RESPONSE**: 点 vid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+### 6.10.在线增量导入
+
+#### 6.10.1.指定文件内容导入
+
+- **URI**: `/db/{graph_name}/import/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+  | data | 要导入的文件内容（建议最大在 16MB 左右，最长不超过 17MB） | 字符串 / 数组 / 对象 |
+  | continue_on_error | 出错后是否继续导入（可选，默认为`false`
+  ） | 布尔值 |
+  | delimiter | 分隔符（可选，默认为`“,”`
+  ） | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+分隔符可以是单字符，也可以是字符串，但不能包含`\r`或者`\n`。
+
+data 可以是如下形式之一：
+
+- 字符串如 `"1,2\n3,4\n"`
+- ASCII 码组成的数组如 `[49,44,50,10,51,44,52,10]`
+- 形如上述数组的字典如 `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+- **RESPONSE**:
+
+系统**不会**自动执行新建 label、添加索引等操作。在此操作之前需要保证涉及的 label 已经存在并具有适当的索引。
+
+如果成功导入完毕，返回代码 200，并在 `log` 字段返回一些日志信息（可能为空）；否则，保证所有的数据均未被导入，并在 `error_message` 字段返回错误信息。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true,
+      "delimiter": ","
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+由于请求中指定了在出错时继续，该返回信息说明 SRC_ID 为 1 的边没有被导入，而其他信息导入成功。
+
+### 6.11.其他
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.提取子图
+
+给出点 id 集合，返回包含该集合的最小子图。
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | vertex_ids | 点 id 集合 | 列表 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | nodes | 点数据 | 列表，每元素包含 vid, label, 以及属性 |
+  | relationships | 边数据 | 列表，每元素包含 src, dst, euid, label, 以及属性 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example response.**
+
+```
+• 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..f35f8d98d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+客户端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..c87c0ed2b8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/8.query/1.cypher.md
@@ -0,0 +1,2353 @@
+# Cypher API
+
+> 此文档主要介绍了TuGraph-Cypher的详细使用说明
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators支持进度一览：
+
+| 类别                                 | 支持                                                                                                        | 待支持                             |
+| ------------------------------------ | ----------------------------------------------------------------------------------------------------------- | ---------------------------------- |
+| General operators                    | `DISTINCT`, `.` for property access                                                                     | `[]` for dynamic property access |
+| Mathematical operators               | `+`, `-`, `*`, `/`, `%`, `^`                                                                    |                                    |
+| Comparison operators                 | `=`, `<>`, `<`, `>`, `<=`, `>=`, `IS NULL`, `IS NOT NULL`                                   |                                    |
+| String-specific comparison operators | `STARTS WITH`, `ENDS WITH`, `CONTAINS`, `REGEXP`                                                    |                                    |
+| Boolean operators                    | `AND`, `OR`, `XOR`, `NOT`                                                                           |                                    |
+| String operators                     | `+` for concatenation                                                                                     |                                    |
+| List operators                       | `+` for concatenation, `IN` to check existence of an element in a list, `[]` for accessing element(s) |                                    |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+```
+MATCH (p:person) RETURN DISTINCT p.born
+```
+
+- ❏ Accessing properties of a nested literal map using the `.` operator
+
+```
+WITH {person: {name: 'Anne', age: 25}} AS p
+RETURN p.person.name
+```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+
+```
+CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+       (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+       (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+```
+
+```
+MATCH (restaurant:Restaurant), (category:Category)
+WHERE restaurant["rating_" + category.name] > 6
+RETURN DISTINCT restaurant.name
+```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator  `^`
+
+```
+WITH 2 AS number, 3 AS exponent
+RETURN number ^ exponent AS result
+```
+
+- ✓ Using the unary minus operator `-`
+
+```
+WITH -3 AS a, 4 AS b
+RETURN b - a AS result
+```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+
+```
+WITH 4 AS one, 3 AS two
+RETURN one > two AS result
+```
+ 
+### 1.5.String-specific comparison operators
+
+- ✓ Using STARTS WITH to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate STARTS WITH 'Jo'
+RETURN candidate
+```
+
+- ✓ Using REGEXP to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate REGEXP 'Jo.*n'
+RETURN candidate
+```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+```
+WITH [2, 4, 7, 9, 12] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number = 4 OR (number > 6 AND number < 10)
+RETURN number
+```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+
+```
+RETURN [1,2,3,4,5]+[6,7] AS myList
+```
+
+- ✓ Using IN to check if a number is in a list
+
+```
+WITH [2, 3, 4, 5] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number IN [2, 3, 8]
+RETURN number
+```
+
+- ✓ Accessing elements in a list using the [] operator
+
+```
+WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+RETURN names[1..3] AS result
+```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses支持进度一览：
+
+| 类别                    | 语法                                  | 备注   |
+| ----------------------- | ------------------------------------- | ------ |
+| Reading clauses         | MATCH                                 | 支持   |
+|                         | OPTIONAL MATCH                        | 支持   |
+|                         | MANDATORY MATCH                       | 待支持 |
+| Projecting clauses      | RETURN … [AS]                        | 支持   |
+|                         | WITH … [AS]                          | 支持   |
+|                         | UNWIND … [AS]                        | 支持   |
+| Reading sub-clauses     | WHERE                                 | 支持   |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | 支持   |
+|                         | SKIP                                  | 支持   |
+|                         | LIMIT                                 | 支持   |
+| Writing clauses         | CREATE                                | 支持   |
+|                         | DELETE                                | 支持   |
+|                         | DETACH DELETE                         | 支持   |
+|                         | SET                                   | 支持   |
+|                         | REMOVE                                | 支持   |
+| Reading/Writing clauses | MERGE                                 | 支持   |
+|                         | CALL […YIELD]                        | 支持   |
+| Set operations          | UNION                                 | 待支持 |
+|                         | UNION ALL                             | 支持   |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+
+  ```
+  MATCH (n)
+  RETURN n
+  ```
+
+  - ✓ Get all nodes with a label
+
+  ```
+  MATCH (movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Related nodes
+
+  ```
+  MATCH (person {name: 'Laurence Fishburne'})-[]-(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Match with labels
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]-(movie:movie)
+  RETURN movie.title
+  ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]->(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Directed relationships and variable
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[r]->(movie)
+  RETURN type(r)
+  ```
+
+  - ✓ Match on relationship type
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})<-[:acted_in]-(actor)
+  RETURN actor.name
+  ```
+
+  - ✓ Match on multiple relationship types
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[:acted_in|:directed]-(person)
+  RETURN person.name
+  ```
+
+  - ✓ Match on relationship type and use a variable
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[r:acted_in]-(actor)
+  RETURN r.role
+  ```
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+
+  ```
+  MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+  RETURN type(r)
+  ```
+
+  - ✓ Multiple relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in]->(movie)<-[:directed]-(director)
+  RETURN movie.title, director.name
+  ```
+
+  - ✓ Variable-length relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in*1..3]-(movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Relationship variable in variable-length relationships
+
+  ```
+  MATCH p = (laurence {name: 'Laurence Fishburne'})-[:acted_in*2]-(co_actor)
+  RETURN p
+  ```
+
+  - ❏ Match with properties on a variable-length path
+
+  ```
+  MATCH p = (charlie:person)-[* {blocked:false}]-(martin:person)
+  WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+  RETURN p
+  ```
+
+  - ✓ Zero-length paths
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})-[*0..1]-(x)
+  RETURN x
+  ```
+
+  - ✓ Named paths
+
+  ```
+  MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+  ```
+
+  - ✓ Matching on a bound relationship
+
+  ```
+  MATCH (a)-[r]->(b)
+  WHERE euid(r)="0_3937_0_0_0"
+  RETURN a,b
+  ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+  CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+  ```
+
+  - ✓ All shortest paths
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+  CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN
+  nodeIds,relationshipIds,cost
+  ```
+- Get node or relationship by id
+
+  - ✓ Node by id
+
+  ```
+  MATCH (n)
+  WHERE id(n)= 0
+  RETURN n
+  ```
+
+  - ✓ Relationship by id
+
+  ```
+  MATCH ()-[r]->()
+  WHERE euid(r) = "0_3937_0_0_0"
+  RETURN r
+  ```
+
+  - ✓ Multiple nodes by id
+
+  ```
+  MATCH (n)
+  WHERE id(n) IN [0, 3, 5]
+  RETURN n
+  ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n
+```
+
+- ✓ Return relationships
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'})-[r:acted_in]->(c)
+RETURN r
+```
+
+- ✓ Return property
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n.born
+```
+
+- ❏ Return all elements
+
+```
+MATCH p = (a {name: 'A'})-[r]->(b)
+RETURN *
+```
+
+- ❏ Variable with uncommon characters
+
+```
+MATCH (`This isn\'t a common variable`)
+WHERE `This isn\'t a common variable`.name = 'A'
+RETURN `This isn\'t a common variable`.happy
+```
+
+- ✓ Aliasing a field
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born AS SomethingTotallyDifferent
+```
+
+- ✓ Optional properties
+
+```
+MATCH (n)
+RETURN n.age
+```
+
+- ❏ Other expressions
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born > 1900, "I'm a literal", (a)-[]->()
+```
+
+`(a)-[]->()`  not supported.
+
+- ✓ Unique results
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})-[]->(b)
+RETURN DISTINCT b
+```
+
+### 2.4.WHERE
+
+- Basic usage
+  - ✓ Boolean operations
+
+  ```
+  MATCH (n)
+  WHERE n.name = 'Laurence Fishburne' XOR (n.born > 1965 AND n.name = 'Carrie-Anne Moss')
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node label
+
+  ```
+  MATCH (n)
+  WHERE n:person
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node property
+
+  ```
+  MATCH (n)
+  WHERE n.born > 2000
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on relationship property
+
+  ```
+  MATCH (n)-[k:acted_in]->(f)
+  WHERE k.role = "Trinity"
+  RETURN f.title
+  ```
+
+  - ❏ Filter on dynamically-computed property
+
+  ```
+  WITH 'AGE' AS propname
+  MATCH (n)
+  WHERE n[toLower(propname)]< 30
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Property existence checking
+
+  ```
+  MATCH (n)
+  WHERE exists(n.born)
+  RETURN n.name, n.born
+  ```
+
+- String matching
+  - ✓ Match the beginning of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name STARTS WITH 'Pet'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match the ending of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name ENDS WITH 'ter'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match anywhere within a string
+
+  ```
+  MATCH (n)
+  WHERE n.name CONTAINS 'ete'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ String matching negation
+
+  ```
+  MATCH (n)
+  WHERE NOT n.name ENDS WITH 's'
+  RETURN n.name, n.born
+  ```
+
+- Using path patterns in `WHERE`
+  - ❏ Filter on patterns
+
+  ```
+  MATCH (tobias {name: 'Tobias'}), (others)
+  WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+  RETURN others.name, others.age
+  ```
+
+  - ❏ Filter on patterns using NOT
+
+  ```
+  MATCH (persons), (peter {name: 'Peter'})
+  WHERE NOT (persons)-[]->(peter)
+  RETURN persons.name, persons.age
+  ```
+
+  - ❏ Filter on patterns with properties
+
+  ```
+  MATCH (n)
+  WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Filter on relationship type
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name='Laurence Fishburne' AND type(r) STARTS WITH 'ac'
+  RETURN type(r), r.role
+  ```
+
+- Lists
+  - ✓ IN operator
+
+  ```
+  MATCH (a)
+  WHERE a.name IN ['Laurence Fishburne', 'Tobias']
+  RETURN a.name, a.born
+  ```
+
+- Missing properties and values
+  - ✓ Default to false if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white'
+  RETURN n.name, n.age, n.belt
+  ```
+
+  - ✓ Default to true if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+  ORDER BY n.name
+  ```
+
+  - ✓ Filter on null
+
+  ```
+  MATCH (person)
+  WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+  person.belt
+  ```
+
+- Using ranges
+  - ✓ Simple range
+
+  ```
+  MATCH (a)
+  WHERE a.name >= 'Peter'
+  RETURN a.name, a.born
+  ```
+
+  - ✓ Composite range
+
+  ```
+  MATCH (a)
+  WHERE a.name > 'Andres' AND a.name < 'Tobias'
+  RETURN a.name, a.born
+  ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 3
+```
+
+- ✓ Return middle two records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 1
+LIMIT 2
+```
+
+- ❏ Using an expression with SKIP to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP toInteger(3*rand())+ 1
+```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT 3
+```
+
+- ❏ Using an expression with LIMIT to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT toInteger(3 * rand())+ 1
+```
+
+### 2.7.CREATE
+
+- Create nodes
+
+> **Note**
+> TuGraph不支持创建空的nodes，不支持多labels。
+
+  - ☒ Create single node
+
+  ```
+  CREATE (n)
+  ```
+
+  - ☒ Create multiple nodes
+
+  ```
+  CREATE (n), (m)
+  ```
+
+  - ☒ Create a node with a label
+
+  ```
+  CREATE (n:person)
+  ```
+
+  - ☒ Create a node with multiple labels
+
+  ```
+  CREATE (n:Person:Swedish)
+  ```
+
+  - ✓ Create node and add labels and properties
+
+  ```
+  CREATE (n:person {id:2001, name: 'Andres'})
+  ```
+
+  - ✓ Return created node
+
+  ```
+  CREATE (n:person {id:2002, name: 'Andres'})
+  RETURN n
+  ```
+
+- Create relationships
+  - ✓ Create a relationship between two nodes
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:write]->(m)
+  ```
+
+  - ✓ Create a relationship and set properties
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:acted_in{role: 'Trinity'}]->(m)
+  ```
+
+  - ❏ Create a full path
+
+  ```
+  CREATE p = (andres:person {id: 2005, name:'Andres'})-[:acted_in {role: 'Trinity'}]->
+  (m:movie {id: 2006})<-[:acted_in {role: 'Trinity'}]-(michael {id: 2006, name:'Michael'})
+  RETURN p
+  ```
+
+- Use parameters with CREATE
+  - ❏ Create node with a parameter for the properties
+
+  ```
+  CREATE (n:Person $props)
+  RETURN n
+  ```
+
+  - ☒ Create multiple nodes with a parameter for their properties
+
+  ```
+  UNWIND $props AS map
+  CREATE (n)
+  SET n = map
+  ```
+  cannot create vertex without label.
+
+### 2.8.CALL[…YIELD]
+
+- ✓ Call a procedure using CALL
+
+```
+CALL db.vertexLabels
+```
+
+- ✓ View the signature for a procedure
+
+```
+CALL dbms.procedures() YIELD name, signature
+RETURN signature
+```
+
+- ❏ Call a procedure using a quoted namespace and name
+
+```
+CALL `db`.`vertexLabels`
+```
+
+- ✓ Call a procedure with literal arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+```
+
+- ❏ Call a procedure with parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+```
+
+- ❏ Call a procedure with mixed literal and parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+```
+
+- ✓ Call a procedure with literal and default arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+```
+
+- ✓ Call a procedure within a complex query using CALL…YIELD
+
+```
+CALL db.vertexLabels() YIELD label
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure and filter its results
+
+```
+CALL db.vertexLabels() YIELD label
+WHERE label CONTAINS 'User'
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure within a complex query and rename its outputs
+
+```
+CALL db.propertyKeys() YIELD propertyKey AS prop
+MATCH (n)
+WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+
+```
+MATCH (n:person)
+RETURN n.name AS name
+UNION ALL MATCH (n:movie)
+RETURN n.title AS name
+```
+
+- ❏ Combine two queries and remove duplicates
+
+```
+MATCH (n:Actor)
+RETURN n.name AS name
+UNION
+MATCH (n:Movie)
+RETURN n.title AS name
+```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| 种类                   | 功能               | 备注                      |
+| ---------------------- |------------------| ------------------------- |
+| Predicate functions    | exists()         |                           |
+|                        | all()            | 不支持                    |
+|                        | any()            | 不支持                    |
+|                        | single()         | 不支持                    |
+|                        | none()           | 不支持                    |
+| Scalar functions       | id()             |                           |
+|                        | euid()           |                           |
+|                        | properties()     |                           |
+|                        | head()           |                           |
+|                        | last()           |                           |
+|                        | toBoolean()      |                           |
+|                        | toFloat()        |                           |
+|                        | toInteger()      |                           |
+|                        | toString()       |                           |
+|                        | type()           |                           |
+|                        | startnode()      |                           |
+|                        | endnode()        |                           |
+|                        | size()           |                           |
+|                        | length()         |                           |
+|                        | substring()      |                           |
+|                        | concat()         |                           |
+|                        | label()          | OpenCypher扩展方法      |
+| Aggregating functions  | avg()            |                           |
+|                        | collect()        |                           |
+|                        | count()          |                           |
+|                        | max()            |                           |
+|                        | min()            |                           |
+|                        | percentileCont() |                           |
+|                        | percentileDisc() |                           |
+|                        | stDev()          |                           |
+|                        | stDevP()         |                           |
+|                        | variance()       |                           |
+|                        | varianceP()      |                           |
+|                        | sum()            |                           |
+| List functions         | keys()           |                           |
+|                        | labels()         | 返回结果有且只有一个label |
+|                        | nodes()          |                           |
+|                        | range()          |                           |
+|                        | subscript()      | 不支持                    |
+| Mathematical functions | abs()            |                           |
+|                        | ceil()           |                           |
+|                        | floor()          |                           |
+|                        | rand()           |                           |
+|                        | round()          |                           |
+|                        | sign()           |                           |
+| String functions       | /                |                           |
+
+### 3.2.Predicate functions
+
+- exists()
+  judge it whether a vertex or edge has the field  .
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+WHERE exists(n.born)
+RETURN n.name, n.born
+```
+
+**Example output:**
+
+| exists(name) |
+| ------------ |
+| true         |
+
+### 3.3.Scalar functions
+
+- id()
+  get the id of vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN id(a)
+```
+
+**Example output:**
+
+| vid |
+| --- |
+| 1   |
+| 2   |
+| ... |
+
+- properties()
+  get  a map containing all the properties of a node or relationship.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person {name: 'Laurence Fishburne'})
+RETURN n
+```
+
+- head()
+  get the first element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, head(coll)
+```
+
+**Example output:**
+
+| coll                  | head(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "one"         |
+
+- last()
+  get the last element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, last(coll)
+```
+
+**Example output:**
+
+| coll                  | last(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "three"       |
+
+- toFloat()
+  Converts an integer or string value to a floating point number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toFloat('11.5')
+```
+
+**Example output:**
+
+| float |
+| ----- |
+| 11.5  |
+
+- toInteger()
+  Converts a floating point or string value to an integer value.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toInteger('2.3') AS integer
+```
+
+**Example output:**
+
+| integer |
+| ------- |
+| 2       |
+
+- toString()
+  Converts an integer, float, boolean value to a string.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toString(2.3)
+```
+
+- type()
+  get the string representation of the relationship type.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)-[r]->()
+WHERE n.name = 'Laurence Fishburne'
+RETURN type(r)
+```
+
+**Example output:**
+
+| type     |
+| -------- |
+| acted_in |
+| acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+  Returns the average of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN avg(n.born)
+```
+
+**Example output:**
+
+| avg(n.born)        |
+| ------------------ |
+| 1869.2661654135338 |
+
+- collect()
+  Returns a list containing the values returned by an expression.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN collect(n.born)
+```
+
+**Example output:**
+
+| collect(n.born) |
+| --------------- |
+| [1967,...]      |
+
+- count()
+  Returns the number of values or records.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n {name: 'Laurence Fishburne'})-[]->(x)
+RETURN labels(n), n.born, count(*)
+```
+
+**Example output:**
+
+| labels(n)  | n.born | count(*) |
+| ---------- | ------ | -------- |
+| ["person"] | 1961   | 3        |
+
+- max()
+  Returns the maximum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN max(n.born)
+```
+
+**Example output:**
+
+| max(n.born) |
+| ----------- |
+| 2003        |
+
+- min()
+  Returns the minimum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN min(n.born)
+```
+
+**Example output:**
+
+| min(n.born) |
+| ----------- |
+| 1000        |
+
+- percentileCont()
+  Returns the percentile of a value over a group using linear interpolation.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileCont(n.born, 0.4)
+```
+
+**Example output:**
+
+| percentileCont(n.born, 0.4) |
+| --------------------------- |
+| 1953                        |
+
+- percentileDisc()
+  Returns the nearest value to the given percentile over a group using a rounding method.
+  **Scope:** whole instance.
+  **Output:** the percentile of the given value over a group.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileDisc(n.born, 0.5)
+```
+
+**Example output:**
+
+| percentileDisc(n.age, 0.5) |
+| -------------------------- |
+| 1959                       |
+
+- stDev()
+  Returns the standard deviation for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDev(n.born)
+```
+
+**Example output:**
+
+| stDev(n.born)      |
+| ------------------ |
+| 279.53117993401725 |
+
+- stDevP()
+  Returns the standard deviation for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDevP(n.born)
+```
+
+**Example output:**
+
+| stDevP(n.born)     |
+| ------------------ |
+| 279.3209270423399  |
+
+- variance()
+  Returns the variance for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN variance(n.born)
+```
+
+**Example output:**
+
+| variance(n.age)   |
+| ----------------- |
+| 78137.68055530392 |
+
+- varianceP()
+  Returns the variance for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN varianceP(n.born)
+```
+
+**Example output:**
+
+| varianceP(n.age)  |
+| ----------------- |
+| 78020.18028379219 |
+
+- sum()
+  Returns the sum of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN sum(n.born)
+```
+
+**Example output:**
+
+| sum(n.born) |
+| ----------- |
+| 1243062     |
+
+### 3.5.List Funtions:
+
+- keys()
+  get the field names of some vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN keys(a) LIMIT 1
+```
+
+**Example output:**
+
+| keys(a)               |
+| --------------------- |
+| ["name","age","eyes"] |
+
+- labels()/label()
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN labels(a) LIMIT 1
+```
+
+**Example output:**
+
+| labels                 |
+| ---------------------- |
+| ["Person"]             |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice"})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+
+### 3.6.Mathematical functions
+
+- abs()
+  get the absolute value of some data.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a:person {name: 'Laurence Fishburne'}),
+(e:person {name: 'Carrie-Anne Moss'})
+RETURN a.born, e.born, abs(a.born-e.born)
+```
+
+**Example output:**
+
+| a.born | e.born | abs(a.born - e.born) |
+| ------ | ------ | -------------------- |
+| 38     | 41     | 1                    |
+
+- ceil()
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN ceil(0.1)
+```
+
+**Example output:**
+
+| ceil(0.1) |
+| --------- |
+| 1.0       |
+
+- floor()
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN floor(0.9)
+```
+
+**Example output:**
+
+| floor(0.9) |
+| ---------- |
+| 0.0        |
+
+- round()
+  Returns the value of a number rounded to the nearest integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN round(3.141592)
+```
+
+**Example output:**
+
+| round |
+| ----- |
+| 3     |
+
+- rand()
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN rand()
+```
+
+**Example output:**
+
+| rand()             |
+| ------------------ |
+| 0.9797131960534085 |
+
+- sign()
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN sign(-17), sign(0.1)
+```
+
+**Example output:**
+
+| sign(-17) | sign(0.1) |
+| --------- | --------- |
+| -1        | 1         |
+
+TuGraph 查询语言与 OpenCypher 的不同点如下：
+
+- Label 数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 4.附录1. 语法扩充及不同
+
+TuGraph查询语言与OpenCypher的不同点如下：
+
+- Label数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.附录2. 内置procedures列表
+### 5.1.procedures样例
+
+* dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                        | name         |
+  | ---------------------------------------------------- | -------------------- |
+  | db.vertexLabels() :: (label::STRING)               | db.vertexLabels        |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels |
+  | db.indexes() :: (index::LIST)            | db.indexes       |
+  | ...                          | ...          |
+
+* db.subgraph()
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | vids       | list           | list of vertex id                                                     |
+
+  **Output:**
+
+  Get a json containing all the properties of nodes and relationships.
+
+  **Example input:**
+
+  ```
+  CALL db.subgraph([3937,4126,4066,4010])
+  ```
+
+  **Example output**
+
+  | subgraph |
+  | -------- |
+  | {"nodes":[{"identity":3937,"label":"movie","properties":{"duration":136,"id":1,"poster_image":"http://image.tmdb.org/t/p/w185/gynBNzwyaHKtXqlEKKLioNkjKgN.jpg","rated":"R","summary":"Thomas A. Anderson is a man living two lives. By day he is an average computer programmer and by night a malevolent hacker known as Neo who finds himself targeted by the police when he is contacted by Morpheus a legendary computer hacker who reveals the shocking truth about our reality.","tagline":"Welcome to the Real World.","title":"The Matrix"}},{"identity":4010,"label":"user","properties":{"id":44,"login":"Howard"}},{"identity":4066,"label":"user","properties":{"id":202,"login":"Enoch"}},{"identity":4126,"label":"user","properties":{"id":464,"login":"Wilburn"}}],"relationships":[{"dst":4126,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4010,"temporal_id":0},{"dst":4010,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4066,"temporal_id":0},{"dst":4066,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4126,"temporal_id":0}]} |
+
+* db.vertexLabels()
+
+  Lists all available vertex labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+  **Example output:**
+
+    | label   |
+    | ------- |
+    | genre   |
+    | keyword |
+    | movie   |
+    | ...     |
+
+* db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edge labels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | relationshipType |
+  | ---------------- |
+  | acted_in     |
+  | directed     |
+  | ...          |
+
+* db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of  vertex label    |
+  | primary_field | string  | primary field of vertex label |
+  | field_spec | list       | specification of a field |
+
+   in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+    **Output:** If successful, it returns a success message.
+
+    **Example input:**
+
+    ```
+    CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+    ```
+
+    **Example output:**
+
+    ```
+    Added label [Person]
+    ```
+
+* db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description           |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field         |
+  | type       | string     | type of the field         |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name     | type   | optional |
+  | ------------ | ------ | -------- |
+  | id       | INT32  | false    |
+  | born     | INT32  | true     |
+  | name     | STRING | true     |
+  | poster_image | STRING | true     |
+
+* db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | extra      | string     | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.
+    for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+* db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:**
+
+  | field_name | field_type | description              |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description           |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string      | either 'vertex' or 'edge'     |
+  | label_name  | string      | name of the label         |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description           |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string     | either 'vertex' or 'edge' |
+  | label_name       | string     | name of the label     |
+  | field_value_spec | list       | specification of a field  |
+
+    in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, optional]`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+    ```
+    CALL db.alterLabelModFields(
+    'vertex',
+    'new_label',
+    ['birth_date', DATETIME, true],
+    ['gender', BOOL, true])
+    ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of the label    |
+  | edge_constraints | string | edge constraints |
+  | field_spec | list       | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for  optional fields.
+
+  `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+* db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+
+   **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+   **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+* db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+  | pair_unique | boolean    | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+* dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description      |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string     | the current password |
+  | new_password     | string     | new password     |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+   **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string     | the user's name |
+  | new_password | string     | new password    |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.createUser(user_name, password)
+
+  create  new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | -------------------------------- |
+  | user_name | string     | the new user name        |
+  | password  | string     | the password of new user     |
+  
+   **Output:**
+  
+    If successful, it returns a success message.
+  
+   **Example input:**
+  
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+  
+   **Example output:**
+  
+  ```
+  true
+  ```
+  
+* dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string     | the user name to be deleted |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+   a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string     | the user name           |
+  | is.admin  | boolean    | the permission of this user |
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       |  ...    |
+
+* dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+    a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description       |
+  | --------- | -------------- | --------------------- |
+  | user.user | string     | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+* dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+   a list of  ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host     |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...      |
+
+* dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+   the number of ip which been deleted.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+    the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description              |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string     | the name of new subgraph     |
+  | description | string     | description of new subgraph      |
+  | max_size_GB | integer    | Upper limit of subgraph capacity |
+
+   **Output:**
+
+    if successful , it will return true.
+
+   **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+   **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+  | config     | map        | the configuration to be modified     |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.listGraphs()
+
+  get all subgraphs in this graph database.
+
+  **Output:**
+
+    a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+
+* dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+    | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+* dbms.config.list()
+
+  get config of this graph database.
+
+  **Output:**
+
+    a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  |-----------| ---------|
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       |  ...    |
+
+* dbms.config.update(updates)
+
+  get some config of this graph database.
+
+  **Output:**
+
+    If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+    enable_ip_check:false,
+    durable:true,
+    optimistic_txn:true,
+    enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+* dbms.takeSnapshot()
+
+  take the  snapshot  on this current graph database.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+* dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path               |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+* algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                          |
+  | --------- | -------------- | ------------------------------------------------------------ |
+  | startNode | Node       | the source node of paths                     |
+  | endNode   | Node       | the destination node paths                   |
+  | config    | MAP        | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+    If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2     | 1     |
+
+* algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+* algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                        |
+  | --------- | -------------- | ---------------------------------------------------------- |
+  | id    | ANY        | the id of vertexes or edges , the id must be variable      |
+  | config    | MAP        | the configuration of  this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or  it is an edge id.
+
+  **Output:**
+
+    If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.内置procedures完整列表
+
+| Name                                  | Description                           | Signature                                                                                                                                                                               |
+|---------------------------------------|---------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.subgraph                           | 列出点的子图                                | db.subgraph(vids::LIST) :: (subgraph::STRING)                                                                                                                                           |
+| db.vertexLabels                       | 列出所有Vertex Label                      | db.vertexLabels() :: (label::STRING)                                                                                                                                                    |
+| db.edgeLabels                         | 列出所有Edge Label                        | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                 |
+| db.indexes                            | 列出所有索引                                | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                    |
+| db.listLabelIndexes                   | 列出所有与某个Label相关的索引                     | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                          |
+| db.warmup                             | 预热数据                                  | db.warmup() :: (time_used::STRING)                                                                                                                                                      |
+| db.createVertexLabel                  | 创建Vertex Label                        | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                  |
+| db.createLabel                        | 创建Vertex/Edge Label                   | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                             |
+| db.getLabelSchema                     | 列出label schema                        | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                               |
+| db.getVertexSchema                    | 列出点的 schema                           | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                      |
+| db.getEdgeSchema                      | 列出边的 schema                           | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                        |
+| db.deleteLabel                        | 删除Vertex/Edge Label                   | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                       |
+| db.alterLabelDelFields                | 修改label删除属性                           | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                            |
+| db.alterLabelAddFields                | 修改label添加field                        | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                 |
+| db.alterLabelModFields                | 修改label field                         | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                       |
+| db.createEdgeLabel                    | 创建Edge Label                          | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                     |
+| db.addIndex                           | 创建索引                                  | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                          |
+| db.addEdgeIndex                       | 创建索引                                  | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                 |
+| db.addVertexCompositeIndex            | 创建组合索引                                | db.addVertexCompositeIndex(label_name::STRING,field_names::LIST,unique::BOOLEAN) :: (::VOID)                                                                                            |
+| db.deleteIndex                        | 删除索引                                  | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                       |
+| db.deleteCompositeIndex               | 删除组合索引                                | db.deleteIndex(label_name::STRING,field_names::LIST) :: (::VOID)                                                                                                                        |
+| db.backup                             | 备份数据                                  | db.backup(destination::STRING) :: ()                                                                                                                                                    |
+| dbms.procedures                       | 列出所有procedures                        | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                   |
+| dbms.security.changePassword          | 更改当前用户的密码                             | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                 |
+| dbms.security.changeUserPassword      | 更改指定用户的密码                             | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.createUser              | 创建用户                                  | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                |
+| dbms.security.deleteUser              | 删除用户                                  | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.listUsers               | 列出所有用户                                | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                         |
+| dbms.security.showCurrentUser         | 列出当前用户信息                              | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                               |
+| dbms.security.getUserPermissions      | 列出指定用户的权限                             | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                 |
+| dbms.graph.createGraph                | 创建子图                                  | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                       |
+| dbms.graph.modGraph                   | 修改子图属性                                | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                         |
+| dbms.graph.deleteGraph                | 删除子图                                  | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.graph.listGraphs                 | 列出所有子图                                | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                      |
+| dbms.graph.getGraphInfo               | 列出指定子图的信息                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                    |
+| dbms.security.addAllowedHosts         | 添加ip到信任列表                             | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                        |
+| dbms.security.deleteAllowedHosts      | 从信任列表删除ip                             | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                             |
+| dbms.security.listAllowedHosts        | 列出信任列表中的主机ip                          | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                      |
+| dbms.config.update                    | 更新TuGraph配置                           | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                   |
+| dbms.config.list                      | 列出TuGraph配置                           | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                         |
+| algo.shortestPath                     | 查询两个点间的最短路径                           | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                   |
+| algo.allShortestPaths                 | 查询两个点间的所有最短路径                         | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                    |
+| algo.native.extract                   | 查询指定VertexId/EdgeUid（列表）指定field的值（列表） | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                |
+| db.flushDB                            | 刷新db                                  | db.flushDB() :: (::VOID)                                                                                                                                                                |
+| dbms.security.listRoles               | 列出所有角色                                | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                         |
+| dbms.security.createRole              | 创建角色                                  | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                    |
+| dbms.security.deleteRole              | 删除角色                                  | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.getRoleInfo             | 获取角色详细信息                              | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                             |
+| dbms.security.disableRole             | 禁用/启用角色                               | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.modRoleDesc             | 修改角色描述信息                              | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.rebuildRoleAccessLevel  | 删除角色权限并重建                             | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                        |
+| dbms.security.modRoleAccessLevel      | 修改角色对指定图的访问权限                         | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                            |
+| dbms.security.modRoleFieldAccessLevel | 修改角色对指定属性的访问权限                        | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                 |
+| dbms.security.getUserInfo             | 获取用户详细信息                              | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                             |
+| dbms.security.disableUser             | 禁用/启用用户                               | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.setCurrentDesc          | 设置当前用户描述信息                            | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                           |
+| dbms.security.setUserDesc             | 设置用户描述信息                              | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.getUserMemoryUsage      | 获取用户内存用量                              | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                               |
+| dbms.security.setUserMemoryLimit      | 设置用户内存限制                              | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                         |
+| dbms.security.deleteUserRoles         | 删除用户与角色的联系                            | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.rebuildUserRoles        | 清空用户角色的关系并重建                          | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                    |
+| dbms.security.addUserRoles            | 新增用户与角色的联系                            | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                        |
+| db.plugin.loadPlugin                  | 装载plugin                              | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN,version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | 删除plugin                              | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                             |
+| db.plugin.listPlugin                  | 列出已装载的plugin                          | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | 获取plugin的详细信息                         | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                          |
+| db.plugin.callPlugin                  | 执行plugin                              | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                    |
+| db.importor.dataImportor              | 导入点或边数据                               | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                             |
+| db.importor.schemaImportor            | 导入点或边schema                           | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                             |
+| db.addFullTextIndex                   | 添加全文索引                                | db.addFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                             |
+| db.deleteFullTextIndex                | 删除全文索引                                | db.deleteFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                          |
+| db.rebuildFullTextIndex               | 重建全文索引                                | db.rebuildFullTextIndex(vertex_labels::STRING, edge_labels::STRING) :: (::VOID)                                                                                                         |
+| db.fullTextIndexes                    | 查看全文索引                                | db.fullTextIndexes() :: (is_vertex::BOOLEAN, label::STRING, field::STRING)                                                                                                              |
+| dbms.meta.count                       | 查看点边总数                                | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                 |
+| dbms.meta.countDetail                 | 查看点边总数详情                              | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                       |
+| dbms.meta.refreshCount                | 重新统计点边数量，统计期间停写。                      | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                 |
+| dbms.task.listTasks                   | 查询正在执行的任务                             | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                    |
+| dbms.task.terminateTask               | 中止任务                                  | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                      |
+| dbms.ha.clusterInfo                   | HA模式下查看集群状态                           | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                       |
+| db.dropDB                             | 清空数据库                                 | db.dropDB() :: (::VOID)                                                                                                                                                                 |
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/8.query/2.gql.md
new file mode 100644
index 0000000000..a5234f46aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/8.query/2.gql.md
@@ -0,0 +1,388 @@
+# ISO GQL
+
+
+## 1.GQL简介
+Graph Query Language(GQL, 图查询语言)是一种国际标准语言，用于属性图查询，该语言建立在SQL的基础上，并整合了现有的[openCypher、PGQL、GSQL和G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/)语言的成熟思想。目前该标准仍然处于草稿阶段。
+
+TuGraph基于[ISO GQL (ISO/IEC 39075) Antlr4 语法文件](https://github.com/TuGraph-family/gql-grammar)实现了GQL，并做了一些扩展与改造。目前并未完全支持所有的GQL语法，我们会在未来逐步完善。
+
+## 2.Clauses
+
+| 类别                | 子句           |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+### 2.1.MATCH
+
+`MATCH`子句式是GQL最基础的子句，几乎所有查询都是通过 `MATCH`展开。
+
+`MATCH`子句用于指定在图中搜索的匹配模式，用来匹配满足一定条件的点或者路径。
+
+#### 点查询
+
+##### 查询所有点
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### 查询特定标签的点
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### 通过属性匹配点
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### 通过过滤条件匹配点
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 边查询
+
+##### 出边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### 入边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### 带过滤条件的边匹配
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+返回结果
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### 路径匹配
+
+##### 不定跳查询
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+`OPTIONAL MATCH`匹配图模式，如果未命中，则返回`null`。
+
+#### 查询命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### 查询未命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+返回结果
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+`RETURN`子句指定返回结果，包括返回点、边、路径、属性等。
+
+#### 返回点
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### 返回边
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### 返回属性
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 不常见字符串作为变量名
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### 列别名
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### 可选属性
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### 其它表达式
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### 结果唯一性
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+返回结果
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+`NEXT`子句用于连接多个子句。
+
+#### 连接MATCH
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE`子句用于过滤记录。
+
+#### 过滤点
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### 过滤边
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+返回结果
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### 布尔表达式
+
+`AND`, `OR`, `XOR`和 `NOT`布尔表达式可以用在 `WHERE`中用来过滤数据。
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+
+### 2.6.ORDER BY
+
+`ORDER BY`是`RETURN`的子句，对输出的结果进行排序。
+
+#### 对结果排序
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+返回结果
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP`指定结果偏移行数。
+
+#### 未使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### 使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+`LIMIT`限制结果行数。
+
+#### 使用LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/8.query/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/8.query/index.rst
new file mode 100644
index 0000000000..0571c71701
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/8.query/index.rst
@@ -0,0 +1,9 @@
+查询语言
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..1748f19794
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,349 @@
+# Procedure API
+
+> 此文档主要讲解 TuGraph 的存储过程使用说明
+
+## 1.简介
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个请求并在客户端完成整个处理流程的方式，TuGraph 提供的存储过程是更简洁和高效的选择。
+
+与传统数据库类似，TuGraph 的存储过程运行在服务器端，用户通过将处理逻辑（即多个操作）封装到一个过程单次调用，并且可以在实现时通过并行处理的方式（例如使用相关的 C++ OLAP 接口以及基于其实现的内置算法）进一步提升性能。
+
+存储过程中有一类特殊的API来进行数据的并行操作，我们叫 Traversal API，见[文档](2.traversal.md)。
+
+## 2.存储过程的版本支持
+
+目前TuGraph支持两个版本的存储过程，适用于不同的场景，v3.5版本只支持v1，可通过REST或RPC接口直接调用；从v3.5版本开始支持v2，能够在图查询语言（比如Cypher）中嵌入调用，我们称之为POG（Procedure On Graph query language，APOC）。
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+| 适用场景                 | 极致性能，或者复杂的多事务管理情形       | 一般情况，与Cypher高度联动 |
+| 事务                    | 函数内部创建，可自由控制多事务          | 外部传入函数，单一事务     |
+| 签名（参数定义）          | 无                                 | 有                    |
+| 输入输出参数类型          | 不需要指定                           | 需要指定参数类型        |
+| Cypher Standalone Call | 支持                                | 支持                  |
+| Cypher Embeded Call    | 不支持                              | 支持                  |
+| 语言                    | C++/Python/Rust                    | C++                  |
+| 调用模式                 | 直接传字符串，一般为JSON               | 通过Cypher语句中的变量  |
+
+在TuGraph中，存储过程v1和v2单独管理，支持增删查，但仍不建议重名。
+
+## 3.存储过程语言支持
+
+在 TuGraph 中，用户可以动态的加载，更新和删除存储过程。TuGraph 支持 C++ 语言、 Python 语言和 Rust 语言编写存储过程。在性能上 C++ 语言支持的最完整，性能最优。
+
+注意存储过程是在服务端编译执行的逻辑，和客户端的语言支持无关。
+
+## 4.Procedure v1接口
+
+## 4.1.编写存储过程
+
+### 4.1.1.编写C++存储过程
+
+用户可以通过使用 Procedure API 或者 Traversal API 来编写 C 存储过程。一个简单的 C 存储过程举例如下：
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## 统计所有年龄为10的学生数量
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+从代码中我们可以看到，存储过程的入口函数是`Process`函数，它的参数有三个，分别为：
+
+- `db`: 数据库实例
+- `request`: 输入请求数据，可以是二进制字节数组，或者 JSON 串等其它任意格式。
+- `response`: 输出数据，可以是字符串，也可以直接返回二进制数据。
+
+`Process`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误，此时用户可以通过`response`来返回错误信息以方便调试。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`age_10`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 age_10.so，然后用户就可以将它加载到服务器中了。
+
+### 4.1.2.编写Python存储过程
+
+与 C++类似，Python 存储过程也可以调用 core API，一个简单的例子如下：
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+Python 存储过程返回的是一个 tuple，其中第一个元素是一个布尔值，表示该存储过程是否成功执行；第二个元素是一个`str`，里面是需要返回的结果。
+
+Python 存储过程不需要编译，可以直接加载。
+
+## 4.2.如何使用存储过程
+### 4.2.1.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`age_10.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`age_10.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+### 4.2.2.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+### 4.2.6.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
+
+## 5.Procedure v2接口
+
+下面的说明以 REST API 为例，介绍存储过程v2的调用。
+
+### 5.1.编写存储过程
+
+
+用户可以通过使用 lgraph API 来编写 C++ 存储过程。一个简单的 C++ 存储过程举例如下：
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+从代码中我们可以看到：
+- 存储过程定义了一个获取签名的方法`GetSignature`。该方法返回了存储过程的签名，其中包含输入参数名称及其类型，返回参数及其类型。这使得Cypher查询语句在调用存储过程能够利用签名信息校验输入数据以及返回数据是否合理。
+- 入口函数是`ProcessInTxn`函数，它的参数有三个，分别为：
+
+- `txn`: 存储过程所处的事务，通常来说即调用该存储过程的Cypher语句所处事务。
+- `request`: 输入数据，其内容为`GetSignature`中定义的输入参数类型及其Cypher查询语句中传入的值经过json序列化后的字符串。e.g. `{num_iteration: 10}`
+- `response`: 输出数据，为保证在Cypher语言中能够兼容，用户可以通过往`lgraph_api::Result` 写入存储过程处理后的数据，最后用`lgraph_api::Result::Dump`来序列化成json格式的数据。
+
+`ProcessInTxn`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`custom_pagerank`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 custom_pagerank.so，然后用户就可以将它加载到服务器中了。
+
+
+### 5.2.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`custom_pagerank.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`custom_pagerank.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+#### 5.2.1.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+#### 5.2.5.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..9613828c50
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,128 @@
+# Traversal API
+
+> 此文档主要讲解 TuGraph 的存储过程中的Traversal API
+
+## 1. 简介
+
+TuGraph 强大的在线分析处理（OLAP）能力是其区别于其它图数据库的一个重要特性。
+借助 C++ OLAP API（olap_on_db.h），用户可以快速地导出一个需要进行复杂分析的子图，然后在其上运行诸如 PageRank、连通分量、社区发现等迭代式图计算过程，最后根据结果做出相应决策。
+导出和计算的过程都可以通过并行处理的方式进行加速，从而实现几乎实时的分析处理，避免了传统解决方案需要将数据导出、转换、再导入（ETL）到专门的分析系统进行离线处理的冗长步骤。
+
+TuGraph 内置了大量常用的图分析算法和丰富的辅助接口，因此用户几乎不需要自己来实现具体的图计算过程，只需在实现自己的存储过程时将相应算法库的头文件（.h 文件）包含到自己程序中，并在编译时链接相应的动态库文件（.so）即可。
+一般情况下，用户需要自己实现的只有将需要分析的子图抽取出来的过程。
+
+目前 Traversal API 仅支持 C++。
+
+## 2. 接口说明
+
+### 2.1. Snapshot
+
+C++ OLAP API 中的 Snapshot 模版类用于表示抽取出来的静态子图，其中 EdgeData 用来表示该子图上每条边所用权值的数据类型（如果边不需要权值，使用 Empty 作为 EdgeData 即可）。
+
+抽取的子图通过 Snapshot 类的构造函数来描述：
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+其中，db 为数据库句柄，txn 为事务句柄，flags 为生成时使用的选项，可选值包括以下的组合：SNAPSHOT_PARALLEL 表示导出时使用多个线程进行并行；SNAPSHOT_UNDIRECTED 表示需要将导出的图变为无向图。
+vertex_filter 是面向点的用户自定义过滤函数，返回值为 true 表示该点需要被包含到待抽取的子图中，反之则表示需要被排除。
+out_edge_filter 是面向边的用户自定义过滤函数，返回值为 true 表示该边需要被包含到待抽取的子图中，反之则表示需要被排除。
+当过滤函数为缺省值时，则表示需要将所有点/边都包含进来。
+
+Snapshot 类提供的其它方法请参考详细的 C++ API 文档（olap_on_db.h）。
+
+### 2.2. Traversal
+
+图数据库中十分常见的一大类分析是基于一个或多个点出发，逐层地拓展并访问邻居。
+尽管这类分析也可以使用 Cypher 完成，但是当访问的层数较深时，其性能会受到串行解释执行的限制。
+使用 C++ Core API 编写存储过程尽管避免了解释执行，但依然受限于单个线程的处理能力。
+为了让用户能够方便地通过并行处理的方式加速这一类应用场景，我们基于 C++ OLAP API 封装了一个 Traversal 框架，用户可以直接使用其中的 FrontierTraversal 和 PathTraversal 类来完成这种逐层遍历的分析任务，具体的使用方法可以参考相应的 C++ API 文档（lgraph_traversal.h）。
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+该方法可用于找到所有满足条件（filter 返回 true）的点，当 parallel 为 true 时则会并行该查找过程。
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+该方法可用于从指定点集（frontier）中（通过 extract 方法）抽取（类型为 VertexData 的）属性，当 parallel 为 true 时会并行该抽取过程。
+
+FrontierTraversal 适用于只关注遍历扩展到的点集的情况；当用户在遍历过程或是结果中需要访问路径上的信息（路径上的点/边）时，则需要使用 PathTraversal。
+两类 Traversal 的构造函数均有四个参数，分别为数据库句柄 db、事务句柄 txn、选项 flags 和 初始化数组容量 capacity。
+选项的可选值包括以下的组合：TRAVERSAL_PARALLEL 表示遍历时使用多个线程并行；TRAVERSAL_ALLOW_REVISITS 表示遍历时允许重复地访问点（PathTraversal 隐含了该选项）。capacity 表示初始化时路径集合的容量。
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+两类 Traversal 设置遍历的起始点/点集有上述三种方式，前两种通过点 ID 直接指定，最后一种方式则类似于 FindVertices。
+
+两类 Traversal 的遍历都是从当前层的点集合出发，根据使用的扩展函数访问每条出边/入边/出边和入边，通过用户自定义的过滤函数决定扩展是否成功，若成功则将邻居点/追加了该条边的路径加入下一层的点/路径集合。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+上述为 FrontierTraversal 的三种遍历方式，即从当前的点集合出发，对集合中的每个点，依次访问每条出边/入边/出边和入边，若满足用户自定义的过滤条件（其中，edge_filter 为面向边的过滤函数，neighbour_filter 则为面向邻居点的过滤函数），则将邻居点加入新的点集合。
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+当前点集合的扩展结束后，新的点集合可以通过上述方法取得。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+PathTraversal 的三种遍历方式与 FrontierTraversal 类似，只是用户自定义的过滤函数中增加了两个参数，其中：Path 包含了到新扩展的这条边之前的路径，IteratorHelper 可用于将路径中的点/边转为数据库中对应的迭代器，相关文档可参考对应的 C++ API 文档。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..7773487052
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++存储过程接口
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..ffd8771f0c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,25 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python存储过程接口
+====================================
+Version: 4.3.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+介绍
+------------------
+与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。
+
+这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。
+
+接口
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..1db9127da9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,19 @@
+# Rust 存储过程
+
+## 1. 介绍
+Rust 存储过程目前仅支持v1版本，TuGraph能够支持一切编译成动态库的语言作为插件。Rust语言作为系统编程语言的新起之秀，在安全性上、可靠性以及人体工程学上相较于C++具有较大优势。
+
+我们提供了TuGraph的[Rust binding]库来支持在Rust中调用lgrahp api，同时提供[tugraph-plugin-util] 工具库来帮助大家更加简洁地编写Rust插件代码。
+
+[Rust binding]: https://crates.io/crates/tugraph
+[tugraph-plugin-util]: https://crates.io/crates/tugraph-plugin-util
+
+## 2. 如何使用
+
+Rust存储过程的使用分三步：
+* 编译，从rust源码编译出so库。我们准备了一份一站式的插件编写教程，从IDE的插件安装，环境配置，到编译，详细参考`rust-tugraph-plugin-tutorial`。
+* 加载，将so库加载到服务端，可以通过REST或RPC接口，这一步和C++库的使用方式类似，可以参考[文档](1.procedure.md)。
+* 运行，和c++ procdure使用方式相同，不在赘述。
+
+## 3.API文档
+Rust社区习惯，所有的代码和文档都可以从[`crates.io`](https://crates.io/crates/tugraph )以及[`docs.rs`](https://docs.rs/tugraph/latest/tugraph )找到。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..dbca101674
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.3.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = Chinese
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..27a86697ca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..81b77be986
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..418a3cad66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,207 @@
+# OLAP API
+
+> 本文档是为TuGraph的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对TuGraph的图计算运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于Tugraph的一个简单的[BFS(宽度优先搜索)](https://en.wikipedia.org/wiki/Breadth-first_search "wikipedia")程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图分析引擎介绍
+
+TuGraph的图分析引擎，面向的场景主要是全图/全量数据分析类的任务。借助TuGraph的 C++ / Python 图分析引擎 API ，用户可以对不同数据来源的图数据快速导出一个待处理的复杂子图，然后在该子图上运行诸如PageRank、LPA、WCC等迭代式图算法，最后根据运行结果做出相应的对策。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph图计算系统社区版内置6个算法，商业版内置了25种算法，用户几乎不需要自己实现具体的图计算过程。其详细介绍可参考algorithms.md。
+
+根据数据来源及实现不同，可分为Procedure、Embed和Standalone三种运行方式，均继承于OlapBase API，OlapBase API接口文档可参考olapbase-api.md。
+
+其中Procedure和Embed的数据来源是图数据库中预加载的db数据，可以分别编译生成tugraph-web加载使用的.so文件和后台终端使用的embed文件，输入的图数据均通过db的加载形式，其接口文档可参考olapondb-api.md。
+Standalone用于编译生成standalone文件，区别于前者，该文件的输入图数据通过txt、二进制、ODPS文件的形式加载，其接口文档可参考olapondisk-api.md。
+
+## 2. Procedure 编译与运行
+
+该种方式主要用于tugraph-web界面进行可视化加载及运行。使用方法如下：
+
+### C++:
+在tugraph-db/procedures 目录下执行`bash make_so_cpp.sh bfs`即可在tugraph-db/procedures目录下得到bfs.so文件，将该文件以插件形式上传至tugraph-web，输入参数后即可执行。
+
+### Python:
+在tugraph-web的前端将python文件以插件形式上传，输入参数后即可执行。
+
+示例：
+在tugraph-db/procedures 编译.so算法文件
+`bash make_so_cpp.sh bfs`
+
+将bfs.so（或tugraph-db/procedures/algo_cython/bfs.py）文件以插件形式加载至tugraph-web后，输入如下json参数：
+
+```json
+{
+    "root_id":"0",
+    "label":"node",
+    "field":"id"
+}
+```
+即可得到返回结果如下。
+
+```json
+{
+  "core_cost": 0.013641119003295898,
+  "found_vertices": 3829,
+  "num_edges": 88234,
+  "num_vertices": 4039,
+  "output_cost": 8.821487426757813e-06,
+  "prepare_cost": 0.03479194641113281,
+  "total_cost": 0.04844188690185547
+}
+```
+
+输出内容解释如下：
+- core_cost: 表示算法运行所需要的时间。
+- found_vertices: 表示查找到点的个数。
+- num_edges: 表示该图数据的边数量。
+- num_vertices: 表示该图数据点的数量。
+- output_cost: 表示算法结果写回db所需要的时间。
+- prepare_cost: 表示预处理阶段所需要的时间。预处理阶段的工作：加载参数、图数据加载、索引初始化等。
+- total_cost: 表示执行该算法整体运行时间。
+
+make_so.sh文件介绍：该文件用于将TuGraph-OLAP所涉及到的图算法文件编译成一个可供tugraph-web使用的.so文件。
+
+## 3. Embed 编译与运行
+
+该种方式主要用于TuGraph在后台程序中对预加载的db图数据进行算法分析。其使用方法如下：
+在tugraph-db/procedures 目录下对embed_main.cpp文件完善，补充数据名称、输入参数、数据路径等信息，示例如下：
+
+### C++:
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path表示预加载图数据存放的路径
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // 指定图数据的名称
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // 以json形式输入算法参数
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+保存后在tugraph-db/procedures 目录下执行`bash make_embed.sh bfs`即可在tugraph-db/procedures/algo_cpp 目录下得到bfs_procedure文件。
+
+在tugraph-db/procedures 文件夹下执行`./algo_cpp/bfs_procedure` 即可得到返回结果：
+
+```json
+{
+  "core_cost":0.025603055953979492,
+  "found_vertices":3829,
+  "num_edges":88234,
+  "num_vertices":4039,
+  "output_cost":9.059906005859375e-06,
+  "prepare_cost":0.056738853454589844,
+  "total_cost":0.0823509693145752
+}
+```
+
+参数解释同上。
+
+### Python：
+在tugraph-db/procedures文件夹下执行
+`bash make_so_cython.sh bfs`
+或在tugraph-db/procedures/algo_cython文件夹下执行
+`python3 setup.py build_ext -i`
+得到bfs.so后，在Python中import bfs可使用，如tugraph-db/procedures/run_embed.py所示
+
+```python
+# tugraph-db/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+```
+通过如下命令执行
+
+```bash
+python3 run_embed.py
+```
+
+输出结果与C++相同。
+
+## 4. Standalone 编译与运行
+
+该文件主要用于在终端处直接加载图数据，并运行打印输出结果。使用方法如下：
+在tugraph-db/build目录下执行`make bfs_standalone` (需要在g++默认include路径中包含boost/sort/sort.hpp)即可得到bfs_standalone文件,该文件生成于tugraph-db/build/output/algo文件夹下。
+运行方式：在tugraph-db/build目录下执行`./output/algo/bfs_standalone -–type [type] –-input_dir [input_dir] --id_mapping [id_mapping] -–vertices [vertices] --root [root] –-output_dir [output_dir]`即可运行。
+
+- `[type]`：表示输入图文件的类型来源，包含text文本文件、BINARY_FILE二进制文件和ODPS源。
+- `[input_dir]`：表示输入图文件的文件夹路径，文件夹下可包含一个或多个输入文件。TuGraph在读取输入文件时会读取[input_dir]下的所有文件，要求[input_dir]下只能包含输入文件，不能包含其它文件。参数不可省略。
+- `[id_mapping]`：当读入边表时，是否对输入数据做id映射，使达到符合算法运行的形式。1为需要做id映射，0为不需要做。该过程会消耗一定时间。参数可省略，默认值为0。
+- `[vertices]`：表示图的点个数，为0时表示用户希望系统自动识别点数量；为非零值时表示用户希望自定义点个数，要求用户自定义点个数需大于最大的点ID。参数可省略，默认值为0。
+- `[root]`：表示进行bfs的起始点id。参数不可省略。
+- `[output_dir]`：表示输出数据保存的文件夹路径，将输出内容保存至该文件中，参数不可省略。
+
+示例：
+
+### C++:
+在tugraph-db/build编译standalone算法程序
+
+```bash
+make bfs_standalone
+```
+
+在tugraph-db/build/output目录下运行text源文件
+
+```bash
+./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+得到运行结果：
+
+```text
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+结果参数解释同上。
+
+对于新的算法，运行时不了解该算法的所需参数时，可通过`./output/algo/bfs_standalone -h`进行查阅对应参数。
+
+### Python:
+Python语言的bfs拓展编译过程与embed模式无区别，在运行时通过`Standalone`接口调用，示例如下：
+```python
+# tugraph-db/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(input_dir=
+                             "../test/integration/data/algo/fb_unweighted",
+                             root=0)
+```
+
+通过如下命令执行
+
+```bash
+python3 run_standalone.py
+```
+
+至此，通过TuGraph对上图进行bfs运算的过程已经完成。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..6991d63290
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,179 @@
+# OlapBase API
+
+> 此文档主要详细介绍了OlapBase API的使用说明
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统需要的简单配置，同时结合代码对TuGraph中几个共同的重要文件和接口进行解释。
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+
+## 3. 原子操作
+
+TuGraph使用了多线程技术进行批处理操作，在这种情况下可能会出现访存冲突现象。为了保证并行计算时修改操作的正确性，TuGraph实现了原子操作。代码部分见lgraph文件夹下的lgraph_atomic.cpp文件。
+TuGraph还自定义了4个常用的原子操作。当我们需要在多线程模式下修改点的数据时，我们都应该使用原子操作来确保并行环境下修改操作的正确性。除了这4个原子操作外，用户也可以使用“cas”来构建自己的原子操作函数。
+
+- `bool cas(T * ptr, T oldv, T newv)`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `bool write_min(T *a, T b)`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `bool write_max(T *a, T b)`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `void write_add(T *a, T b)`：将b的值加到a指向的值上。
+- `void write_sub(T *a, T b)`：将a指向的值减去b的值。
+
+## 4. 点集合类ParallelBitset
+
+在使用TuGraph进行批处理操作时，需要使用点集合来表示需要处理的点。ParallelBitset实现了点集合类，以bit为单位表示点，因此能够节省大量内存。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 4.1 ParallelBitset类成员
+
+- `size_t Size()`：表示Bitmap中的点个数。
+- `ParallelBitset(size_t size)`：初始化size和data，data长度为(size >> 6)+1
+- `void Clear()`：清空集合
+- `void Fill()`：将所有点加入集合
+- `bool Has(size_t i)`：检查点i是否在集合中
+- `bool Add(size_t i)`：将点i加入集合中
+- `void Swap(ParallelBitset &other)`：和另一组ParallelBitset集合交换元素
+
+## 5. 点数组类ParallelVector
+
+在使用TuGraph进行批处理操作时，需要使用点数组来表示对点的处理结果。ParallelVector实现了点数组类。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 5.1 ParallelVector类成员
+
+- `ParallelVector(size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `T &operator[](size_t i)`：下标为i的数据
+- `T *begin()`：ParallelVector的起始指针
+- `T *end()`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `T &Back()`：ParallelVector最后一个数据
+- `T *Data()`：表示数组本身数据
+- `void Destroy()`：清空ParallelVector数组内数据并删除数组
+- `size_t Size()`：表示ParallelVector中的数据个数
+- `size_t Capacity()`：表示ParallelVector的容量大小
+- `void Resize(size_t size)`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `void Clear()`：清空ParallelVector内数据
+- `void ReAlloc(size_t capacity)`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `void Fill(T elem)`：为ParallelVector的全部数据赋值为elem
+- `void Append(const T &elem, bool atomic = true)`：向ParallelVector结尾添加一个数据
+- `void Swap(ParallelVector<T> &other)`：和其他的ParallelVector交换数据
+- `ParallelVector<T> Copy()`：复制当前的ParallelVector数据存至Copy数组中
+
+## 6. 自定义数据结构
+
+### 6.1 基本数据类型
+
+我们自定义了点和边的数据结构表示，用于在覆盖所有点的同时节省内存空间：
+
+- `Empty`：内容为空的特殊数据类型。
+
+### 6.2 组合数据结构
+
+为了便于计算，我们根据计算场景不同，定义了几种点和边数据的数据结构，分别是：
+
+- `EdgeUnit<EdgeData>`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+  - `size_t src`：边的起始点
+  - `size_t dst`：边的终点
+  - `EdgeData edge_data`：边的权值
+- `AdjUnit<EdgeData>`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+  - `size_t neighbour`：边的邻居点
+  - `EdgeData edge_data`：边的权值
+- `AdjList<EdgeData>`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+  - `AdjUnit<T> * begin`：列表的起始指针
+  - `AdjUnit<T> * end`：列表的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对邻接表进行循环访问。
+
+## 7. 图类OlapBase
+
+图类OlapBase是TuGraph用于加载图以及进行图计算操作的主类，常用OlapBase<EdgeData>表示权值类型为EdgeData的图，代码部分见lgraph文件夹下的olap_base.hpp。本章将介绍Graph类中常用的类型和API接口。上文介绍Procedure、Embed及Standalone功能所使用的类均为该类的子类。
+
+### 7.1 基本信息
+
+- `size_t NumVertices()`：获取点数
+- `size_t NumEdges()`：获取边数
+- `size_t OutDegree(size_t vid)`：点vid的出度
+- `size_t InDegree(size_t vid)`：点vid的入度
+
+### 7.2 点集和边集及其相关操作
+
+- `ParallelVector<VertexData> AllocVertexArray<VertexData>()`：分配一个类型为VertexData的数组，大小为点个数
+- `void fill_vertex_array<V>(V * array, V value)`：将数组array中的所有元素赋值为value
+- `ParallelBitset AllocVertexSubset()`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `AdjList<EdgeData> OutEdges(size_t vid)`：获取点v的所有出边集合
+- `AdjList<EdgeData> InEdges(size_t vid)`：获取点v的所有入边集合
+- `void Transpose()`：对有向图进行图反转
+- `LoadFromArray(char * edge_array, VertexId input_vertices, EdgeId input_edges,  EdgeDirectionPolicy edge_direction_policy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+  - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+  - `input_vertices`：指定数组读入图的点个数。
+  - `input_edges`：指定数组读入图的边的条数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+### 7.3 锁机制
+
+TuGraph实现了一对锁机制，来控制程序对于点数据的访存权限。分别是：
+
+- `void AcquireVertexLock(size_t vid)`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(size_t vid)`：对点vid解锁，所有线程均可访存该锁对应的点数据
+- `VertexLockGuard GuardVertexLock(size_t vid)`：在对vid操作时，对点vid加锁，退出作用域时时自动释放锁
+
+### 7.4 批处理操作
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程。分别是：
+
+```c++
+/*
+    函数名称:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+    第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考include/lgraph/olap_base.h中具体代码
+
+    使用示例:统计数组parent数组中有出边的点个数
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+其中graph为图类OlapBase的实例化对象
+
+```C++
+/*
+    函数名称:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+    第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考/include/lgraph/olap_base.h中具体代码
+    
+    使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..1e94fb946e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,296 @@
+# OlapOnDB API
+
+> 此文档主要详细介绍了OlapOnDB API的使用说明
+
+
+## 1. 简介
+
+一般用户需要自己实现的只是将需要分析的子图抽取出来的过程。用户也可以通过使用TuGraph中丰富的辅助接口实现自己的图分析算法。
+
+该文档主要介绍Procedure及Embed的接口设计，并介绍部分常用接口，具体的接口信息参见include/lgraph/olap_on_db.h文件。
+
+## 2. 模型
+
+Procedure及Embed使用到的辅助函数主要包含在OlapOnDB类，还有一些使用频率较高的函数都会逐一介绍
+
+在TuGraph中OLAP相关的有以下常用的数据结构：
+
+1. DB图分析类 `OlapOnDB<EdgeData>`
+2. 点数组`ParallelVector<VertexData>`
+3. 点集合`ParallelBitset`
+4. 边数据结构`AdjUnit/AdjUnit<Empty>`
+5. 边集合数据结构`AdjList<EdgeData>`
+
+### 2.1 基于快照的存储结构
+
+TuGraph中的OlapOnDB类能够提供数据“快照”，即建立一个对指定数据集的完全可用拷贝，该拷贝包括相应数据在某个时间点（拷贝开始的时间点）的镜像。由于OLAP的操作仅涉及读操作而不涉及写操作，OlapOnDB会以一种更紧凑的方式对数据进行排布，在节省空间的同时，提高数据访问的局部性。
+
+### 2.2 BSP计算模型
+
+TuGraph在计算的过程中使用了BSP（Bulk Synchronous Parallel）模型，使得该过程能够并行执行，极大的提高了程序运行效率。
+
+BSP计算模型的核心思路为超步（Super Step）的提出和使用。在OlapOnDB创建后，在该数据上的计算分为多个超步，比如PageRank，分为多轮迭代，每轮迭代就是一个超步。不同超步之间用存在显式同步，从而保证所有线程在完成同一超步后同时进入下一个超步。在一个超步内部，所有的线程异步执行，利用并行提升计算效率。
+
+利用BSP计算模型能够有效避免死锁，通过障碍同步的方式能够以硬件方式实现粗粒度的全局同步，使得图计算能够并行化执行，而程序员无需在同步互斥上大费周章。
+
+## 3. 算法举例
+
+在这里对PageRank算法分块做解释，大体上分为主函数`Process`和PageRank算法流程`PageRank`函数
+
+### 3.1 主函数
+
+主函数输入有三个参数，`TuGraph`数据库参数`db`，从网页端获取的请求`request`，给网页端的返回值`response`，整体流程可以分为一下几步：
+
+1. 相关参数的获取
+2. 快照类的创建
+3. PageRank算法主流程
+4. 网页端返回值的获取和发送
+
+```C++
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+    
+    // 从网页端请求中获取迭代次数（num_iterations），
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // 读事务的创建以及快照类的创建
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+	
+    // 创建pr数组用于存储每个节点的pr值
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank算法主流程，获取每个节点的pagerank值
+    PageRankCore(olapondb, num_iterations, pr);
+    
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        函数用途：从所有节点中获取pagerank值最大的节点编号
+    
+        函数流程描述：该函数对点集合all_vertices中所有为1的位对应的节点vi（又称为活跃点）执行Func A，再将Func A的返回值作为Func B的第二个输入参数，得到局部最大值（因为第一个输入参数为0，因此实际上返回值就是每个节点的pagerank值），最后再将所有线程的返回值汇总，再次 执行Func B得到全局返回值，并存入max_pr_vi变量中
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+        
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+        
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+    
+    // 网页端返回值的获取和发送
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2 PageRank算法流程
+
+`pagerank`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关数据结构的初始化
+1. 每个节点pagerank值的初始化
+1. 每个节点pagerank值的计算，活跃点为所有点（意味着所有点都需要计算pagerank值）
+1. 得到每个节点经过`num_iterations`次迭代后的pagerank值
+
+```C++
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+    
+    // 相关数据结构的初始化
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // 每个节点pagerank值的初始化，和该节点的出度成反比
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // 总迭代过程
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            函数用途：计算所有节点的pagerank值
+
+            函数流程描述：该函数用于计算所有节点的pagerank值，对all_vertices中所有为1的位对应的节点vi执行Func C，得到本轮迭代中vi的pagerank值，并返回vi节点的pagerank变化值，最终经过函数内部处理汇总所有活跃节点的总变化值并返回，该值被存储在delta变量中
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // 从邻居中获取当前节点的pagerank值
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank值计算核心公式
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+    
+                    // 相关中间变量统计
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // 将本轮迭代得到的pagerank值输出作为下一轮迭代的输入
+        curr.Swap(next);
+    }
+}
+```
+
+## 4. 其他常用函数功能描述
+
+### 4.1 事务的创建
+
+```C++
+//读事务的创建
+auto txn = db.CreateReadTxn();
+
+//写事务的创建
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2 并行化创建有向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3 并行化创建无向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED
+)
+```
+
+### 4.4 获取出度
+
+```C++
+size_t OutDegree(size_t vid)
+```
+
+### 4.5 获取入度
+
+```C++
+size_t InDegree(size_t vid)
+```
+
+### 4.6 获取出边集合
+
+```C++
+/*
+    函数名称：AdjList<EdgeData> OutEdges(size_t vid)
+    数据结构:
+        AdjList 可以理解为类型为AdjUnit结构体的数组
+        AdjUnit 有两个成员变量： 1. size_t neighbour 2. edge_data，其中neighbour表示该出边指向的目标节点编号，如果为有权图，则edge_data数据类型和输入文件中边的权重值相同，否则数据类型为Empty
+
+    使用示例：输出节点vid的所有出度邻居
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7 获取入边集合
+
+```C++
+AdjList<EdgeData> InEdges(size_t vid)
+
+// 使用示例：输出节点vid的所有入度邻居
+for (auto & edge : olapondb.InEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8 获取TuGraph中节点对应OlapOnDB的节点编号
+
+```C++
+size_t OriginalVid(size_t vid)
+
+// 备注： TuGraph中输入的节点编号可以是非数字，比如人名等，在生成OlapOnDB子图的时候，会将人名等转化为数字进行后续处理，因此该方法可能不适用于某些特定场景
+```
+
+### 4.9 获取OlapOnDB中节点对应TuGraph的节点编号
+
+```C++
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10 活跃点的描述
+
+活跃点指的是在批处理函数中需要处理的点，在本例子中只是输出了活跃点的编号，并且汇总活跃点的数量：
+
+```C++
+ParallelBitset temp = 000111;	//当前活跃点为3，4，5号点
+
+size_t delta = ForEachActiveVertex<double>(
+    //void c
+    [&](size_t vi) {
+        printf("active_vertexId = %lu\n",vi);
+        return 1;
+    },
+    all_vertices
+);
+```
+
+函数的运行结果显而易见，因为多线程的关系，一下输出顺序可能有所变化：
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+局部返回值均为1，该函数会在保证线程安全的情况下将所有的局部返回值累加得到最终的返回值，并存储在`delta`变量中，该值最终为3
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..1ece4cc8e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,202 @@
+# OlapOnDisk API
+
+> 此文档主要详细介绍了OlapOnDisk API的使用说明
+
+    
+## 1. 简介
+
+TuGraph的Standalone模式可用于加载图数据文件，其中图数据文件来源可包含text文本文件、BINARY_FILE二进制文件和ODPS源。在该模式下，TuGraph可实现多数据来源快速加载成图，然后在该图上运行如BFS、WCC、SSSP等迭代式算法，并输出最终结果至终端。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph内置了大量的常见图分析算法和丰富的辅助接口，因此用户几乎不需要自己实现具体的图计算过程，只需要在实现自己的存储过程的时候将相应算法库的头文件(.h)包含到自己的程序中，并在编译阶段链接自己的动态库文件即可。
+
+该文档主要介绍了Standalone的常用接口，使用到的辅助函数主要包含在OlapOnDB类。同时为帮助用户理解方便，对BFS算法进行举例说明。
+
+## 2. 算法举例
+
+在这里对BFS算法分块做解释，大体上分为主函数`main`、BFS算法流程`BFSCore`函数和配置类MyConfig。
+
+### 2.1 头文件
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //使用 TuGraph 时需要包含的头文件
+#include "./algo.h"   //包含各种算法逻辑函数的头文件
+```
+
+在使用 TuGraph 实现图数据文件计算应用时，一般首先建立StandaloneGraph类对象graph，将图文件数据加载进graph中，之后通过调用图逻辑函数实现图计算过程，最后对图计算的结果进行打印输出。
+
+### 2.2 配置类MyConfig
+
+MyConfig配置类函数用于提供算法逻辑计算时所需的配置信息，继承于ConfigBase<EdgeData>,其中EdgeDate可根据加载图类型不同选择Empty（无权图）、int（带权图权重为整数）或者double（带权图权重为double）类型。
+
+MyConfig配置类一般根据算法不同，需要额外配置信息如下：
+
+1.算法所需参数
+2.算法名称
+3.配置类内Print函数
+其余公用成员继承与ConfigBase，可参考src/olap/olap_config.h查阅。
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // 算法所需参数初始化
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // 配置文件接受命令行参数，该用例会顺次读取命令行调用算法时的参数，优先使用用户指定数值，若用户并未指定则选择默认参数。
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+### 2.3 主函数
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // 统计内存消耗类MemUsage实例化
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // 配置类MyConfig实例化
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk类实例化
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // 统计图加载消耗时间
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // 创建数组用于统计某节点是否遍历过
+    auto parent = graph.AllocVertexArray<size_t>();
+    // 宽度优先搜索算法，返回图内root_vid根结点连接的节点个数
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // 打印相关信息至终端
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+### 2.4 bfs算法流程
+
+`bfs`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关定义、数据结构的初始化
+2. 使用批处理函数对每个节点进行循环计算，每一轮找到与当前节点相邻的全部节点，并在该轮次终止时进行交换。
+3. 直到找到全部节点，返回节点个数discovered_vertices。
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //分配数组，active_in用于存放上一循环阶段已找到的节点
+  active_in.Add(root);            //把跟节点加入数组中
+  auto active_out = graph.AllocVertexSubset();  //分配数组active_out用于存放当前循环阶段找到的节点
+  parent.Fill((size_t)-1);               //将parent数组中的节点赋值为-1，-1表示未被找到
+  parent[root] = root;
+  size_t num_activations = 1;       //表示当前循环阶段找到的节点个数
+  size_t discovered_vertices = 0;    //表示当前循环阶段找到节点的总个数
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations表示当前循环阶段找到的节点个数
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices表示当前循环阶段找到节点的总个数
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //每一次循环从根节点出发，查找邻近的相邻节点，对其parent值改变，并num_activations+1操作
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //存放当前循环阶段找到的节点
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // 返回全部节点数
+  return discovered_vertices;
+}
+```
+
+## 3. 其他常用函数功能描述
+
+### 3.1 图加载
+
+TuGraph-Standalone对于图数据文件的加载来源主要分为三大类：文本文件、二进制文件和ODPS。二进制文件为将边数据的二进制表示按顺序排列的文件，能够节省大量存储空间。其加载函数分为三种，分别是：
+
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：图数据文件的加载方式，包含两个参数，其含义分别表示：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。其中DUAL_DIRECTION为默认的图加载方式。
+  DUAL_DIRECTION : 输入文件为非对称图，加载图为非对称图。
+  MAKE_SYMMETRIC : 输入文件为非对称图，加载图为对称图。
+  INPUT_SYMMETRIC : 输入文件为对称图，加载图为对称图。
+  对应的详细介绍见lgraph文件夹下的olap_config.h文件的`enum EdgeDirectionPolicy`。
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：将文件中的点-数据对按照点id的顺序加载到数组中。各参数表示意义分别为：
+  - `array`：待读入数据的数组
+  - `path`：读取文件的路径，文件中每行表示一对点-数据对
+  - `parse_line`：用户自定义函数，告诉系统如何将一行文本数据解析为一个点-数据对。
+
+
+### 3.2 图写入
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：把array中数据写回文件中，各参数表示意义分别是：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `array`：待写入数据的数组
+  - `array_size`：待写入数据的数字长度
+  - `name`：算法名称
+  - `filter_output`：写入数据规则函数，待写入数据需要满足该函数的要求。
+
+### 3.3 图解析函数
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：对图数据文件进行解析，加载图为无权图。
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：对图数据文件进行解析，加载图为有权图，权重数据类型可以通过修改<EdgeData>指定。
+
+该函数可通过MyConfig类定义时的构造函数parse_line进行指定。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..0498446303
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,404 @@
+# Python Olap API
+
+> 本文档主要介绍 OlapBase OlapOnDB 和 OlapOnDisk 在Python中的API用法
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统Python接口需要的简单配置，同时结合代码对TuGraph Python API进行解释。关于ParallelBitset、OlapBase各类的作用，详见olap-base-api.md，olap-on-db-api.md和olap-on-disk-api.md
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+- Cython，版本要求3.0.0以上，已测试可运行版本为3.0.0a11
+
+## 3. Cython
+Cython是一种高效的编程语言，是Python的超集。Cython能将py文件翻译为C/C++代码后编译为Python拓展类，在Python中通过import调用。在TuGraph中，所有的Python plugin都由Cython编译为Python拓展类后使用。
+
+Cython的Pure Python模式在保证Python语法的同时具有C/C++的性能，TuGraph Python接口均使用Cython实现。
+
+[Cython 文档](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+见procedures/algo_cython/olap_base.pxd文件，用法与功能基本与C++接口相同，olap_base.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### 原子操作
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `write_min[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_max[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_add[T](a: cython.pointer(T), b: T)-> cython.bint`：将b的值加到a指向的值上。
+- `write_sub[T](a: cython.pointer(T), b: T)-> cython.bint`：将a指向的值减去b的值。
+
+### 点集合类ParallelBitset
+- `Size()-> size_t`：表示Bitmap中的点个数。
+- `ParallelBitset(size: size_t)`：初始化size和data，data长度为(size >> 6)+1
+- `Clear()-> cython.void`：清空集合
+- `Fill()-> cython.void`：将所有点加入集合
+- `Has(size_t i)-> cython.bint`：检查点i是否在集合中
+- `Add(size_t i)-> cython.bint`：将点i加入集合中
+- `Swap(ParallelBitset &other)-> cython.void`：和另一组ParallelBitset集合交换元素
+
+### 点数组类ParallelVector
+- `ParallelVector[T](size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `operator[](i: size_t)-> T`：下标为i的数据
+- `begin()-> cython.pointer(T)`：ParallelVector的起始指针
+- `end()-> cython.pointer(T)`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `Back()-> T`：ParallelVector最后一个数据
+- `Data()-> cython.pointer(T)`：表示数组本身数据
+- `Destroy()-> cython.void`：清空ParallelVector数组内数据并删除数组
+- `Size()-> size_t`：表示ParallelVector中的数据个数
+- `Resize(size: size_t)-> cython.void`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `Clear()-> cython.void`：清空ParallelVector内数据
+- `ReAlloc(capacity: size_t)-> cython.void`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `Fill(elem: T)-> cython.void`：为ParallelVector的全部数据赋值为elem
+- `Append(elem: T, atomic: cython.bint = true)-> cython.void`：向ParallelVector结尾添加一个数据
+- `Swap(other: ParallelVector[T])-> cython.void`：和其他的ParallelVector交换数据
+- `Copy()-> ParallelVector[T]`：复制当前的ParallelVector数据存至Copy数组中
+
+### 自定义数据结构
+- `Empty`：内容为空的特殊数据类型。
+- `EdgeUnit[EdgeData]`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+    - `src: size_t`：边的起始点
+    - `dst: size_t`：边的终点
+    - `edge_data: EdgeData`：边的权值
+- `AdjUnit[EdgeData]`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+    - `neighbour: size_t`：边的邻居点
+    - `edge_data: EdgeData`：边的权值
+- `AdjList[EdgeData]`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+    - `begin()-> cython.pointer(AdjUnit[T])`：列表的起始指针
+    - `end()-> cython.pointer(AdjUnit[T])`：列表的结束指针。
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: 下标为i的数据
+
+### 图类OlapBase
+- `NumVertices()-> size_t`：获取点数
+- `NumEdges()-> size_t`：获取边数
+- `OutDegree(size_t vid)-> size_t`：点vid的出度
+- `InDegree(size_t vid)-> size_t`：点vid的入度
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`：分配一个类型为VertexData的数组，大小为点个数
+- `AllocVertexSubset()-> ParallelBitset`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有出边集合
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有入边集合
+- `Transpose()-> cython.void`：对有向图进行图反转
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+    - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+    - `input_vertices`：指定数组读入图的点个数。
+    - `input_edges`：指定数组读入图的边的条数。
+    - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`：对点vid解锁，所有线程均可访存该锁对应的点数据
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程，在Python中与C++使用方法稍有不同。
+
+```python
+# 函数名称:ProcessVertexInRange[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           lower: size_t, upper: size_t,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#     函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+#     第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#     具体实现请参考include/lgraph/olap_base.h中具体代码
+#
+#     使用示例:统计数组parent数组中有出边的点个数
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython. pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython. pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+其中g为图类OlapBase的实例化对象
+
+```python
+# 函数名称:ProcessVertexActive[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           active: ParallelBitset,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#   函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+#   第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#   具体实现请参考/include/lgraph/olap_base.h中具体代码
+#
+# 使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self.graph.OutDegree(vi)
+        dst: size_t
+        edges = self.graph.OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbour
+            printf("node %lu has neighbour %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+如上面两个例子所展示，在Python中ProcessVertexActive与ProcessVertexInRange比在C++中额外需要一个算法类指针参数，Work函数一般也作为该算法类的成员函数，满足Work函数访问成员变量的需求（如图graph，点数组parent），在调用批处理函数时将Work函数和算法类的self指针传入批处理函数。
+
+其中Work函数会在多线程中调用，因此加上修饰器`@cython.nogil`释放Python全局解释锁，在多线程执行的代码中（例如批处理函数中的Work函数，`cython.parallel.prange`中），不能包含Python对象，最好通过`dst: type`或者`dst = cython.declare(type)`的方式声明变量为C/C++类型。
+
+### 图类OlapOnDB:
+并行化创建有向图：
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+并行化创建无向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING创建有向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### 图类OlapOnDisk
+
+#### ConfigBase：
+- `ConfigBase()`: 构造函数
+- `std::string input_dir`: 图边表数据路径
+- `std::string output_dir`: 输出结果路径
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: 读入图数据
+
+
+## 5. lgraph_db API
+见procedures/algo_cython/lgraph_db.pxd与lgraph_db_python.py文件。
+
+lgraph_db.pxd中接口用法与功能基本与C++接口相同，lgraph_db.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: 获取点的vid
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: 设置用户
+- `SetUser(user: std::string)-> cython.void`: 设置用户
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: 创建GraphDB
+
+### GraphDB：
+- `CreateReadTxn()-> Transaction`: 创建只读事务
+- `CreateWriteTxn()-> Transaction`: 创建写事务
+- `ForkTxn(txn: Transaction)-> Transaction`: 复制事务，只能复制读事务
+
+### Transaction：
+```
+GetVertexIndexIterator(
+                label: std::string,
+                field: std::string,
+                key_start: std::string,
+                key_end: std::string)-> VertexIndexIterator
+```
+获取索引迭代器。迭代器的field值为 [key_start, key_end]。所以在key_start=key_end=v时，返回指向field值为v的点的迭代器
+
+lgraph_db_python.py是lgraph_db.pxd中C++类 Galaxy与GraphDB的包装，将C++类包装为Python类，将lgraph_db_python.py编译为Python拓展后，可以直接在Python文件或Python命令行中`import lgraph_db_python`访问lgraph_db_python.PyGraphDB与PyGraphDB.PyGalaxy。
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(self, user: str password: str)-> void`: 设置用户
+- `SetUser(self, user: std::string)-> void`: 设置用户
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: 创建PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)-> cython.Py_ssize_t`: C++ 类GraphDB的地址
+
+## 6. 算法插件示例
+下面为Python实现的BFS算法的代码示例：
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# 注释作用如下：
+# language_level=3: 使用Python3
+# cpp_locals=True: 需要c++17，使用std::optional管理Python代码中的C++对象，可以避免C++对象的拷贝构造
+# boundscheck=False: 关闭索引的边界检查
+# wraparound=False: 关闭负数下标的处理（类似Python List）
+# initializedcheck=False: 关闭检查内存是否初始化，关闭检查后运行性能更快
+# language = c++: 将此py文件翻译为C++而不是C文件，TuGraph使用大量模板函数，所以都应该使用C++
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# 从procedures/algo_cython/ 中cimportolap_base.pxd与lgraph_db.pxd, 类似C++中#include "xxx.h"
+
+from cython.cimports.libc.stdio import printf
+# 类似C++中#include <stdio.h>
+# 其他常见的还有cython.cimports.libcpp.unordered_map等
+
+import time
+
+
+@cython.cclass
+# cython.cclass 表示BFSCore为C类型的Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty])表示OlapBase[Empty]的指针，类似C++中OlapBase[Empty]*
+    # cython提供了常见类型的指针，如cython.p_int, cython.p_char等，表示int*, char*, ...
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t 声明root为C++ size_t类型变量，等效于root = cython.declare(size_t)
+    # 不声明类型的变量为Python object类型
+    # 声明变量类型会大幅提高性能，同时在多线程部分，只有C/C++类型的变量可以访问
+
+    @cython.cfunc
+    # cython.cfunc 表示Work为C类型的函数，参数与返回值应声明
+    # cfunc性能好，能接受C/C++对象为参数、返回值，但是不能在其他python文件中调用
+    # 类似的有cython.ccall，如Standalone函数，可以在其他python文件中调用
+    @cython.nogil
+    # cython.nogil 表示释放Python全局解释锁，在nogil修饰的部分，不能访问Python对象
+    # 在多线程部分，都应有nogil修饰器
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) 表示禁用异常传播，将忽略函数内部引发的Python异常
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbour
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 表示dst没有被bfs访问过
+                if self.active_out.Add(dst):
+                    # 将dst设置为为活跃节点；ParallelBitmap.Add为原子操作，防止重复计算
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython.size_t:
+        self.graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self.parent.Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self.active_in.Add(self.root)
+        while num_activations > 0:
+            self.active_out.Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self.active_out.Swap(self.active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time.time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # 并行创建OlapOnDB
+    # Cython不支持如 *db 的解引用操作，通过db[0]来解引用
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # 通过 GetVertexIndexIterator 根据root节点label名和filed名与filed值（root_id）
+    # 获取root节点的迭代器，通过迭代器获取vid，在无ID_MAPPING时，该vid与OlapOnDB中的id相同
+    cost = time.time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time.time()
+    count = a.run(cython.address(olapondb), root_vid)
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb.NumVertices()
+    response["num_edges"] = olapondb.NumEdges()
+    return True
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process为embed模式和procedure模式下插件入口，用cython.ccall修饰
+    # Process函数必须名为Process，参数为lgraph_db_python.PyGraphDB与bytes
+    # 返回值必须为(bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # 获取PyGraphDB中GraphDB对象的地址，转换为指针后传递
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..7bf7f3ebf1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,189 @@
+# 内置算法
+
+> 此文档主要详细介绍了TuGraph内置的算法程序，社区版6种算法可参考基础算法报
+
+## 简介
+
+TuGraph目前包含以下6个基础算法28种扩展算法，共34个图算法：
+
+### 基础算法包：
+| 中文算法名 | 英文算法名 | 程序名
+|  :----:  | :----: | :----: |
+| 广度优先搜索 | Breadth-First Search  | bfs 
+| 网页排序 | Pagerank | pagerank 
+| 单源最短路径 | Single-Source Shortest Path | sssp 
+| 弱连通分量 | Weakly Connected Components | wcc 
+| 平均集聚系数 | Local Clustering Coefficient  | lcc
+| 标签传播 | Label Propagation Algorithm | lpa 
+
+### 扩展算法包：
+| 中文算法名 | 英文算法名 | 程序名
+| :----: | :----: | :----: |
+| 全对最短路径 | All-Pair Shortest Path  | apsp 
+| 介数中心度 | Betweenness Centrality | bc 
+| 置信度传播 | Belief Propagation | bp
+| 距离中心度 | Closeness Centrality | clce
+| 共同邻居 | Common Neighborhood | cn 
+| 度数关联度 | Degree Correlation  | dc
+| 直径估计 | Dimension Estimation | de 
+| EgoNet算法 | EgoNet | en
+| 超链接主题搜索 | Hyperlink-Induced Topic Search | hits
+| 杰卡德系数 | Jaccard Index | ji
+| K核算法 | K-core | kcore
+| 鲁汶社区发现 | Louvain | louvain 
+| 多源最短路径 | Multiple-source Shortest Paths | mssp
+| 个性化网页排序 | Personalized PageRank | ppr
+| 强连通分量 | Strongly Connected Components | scc 
+| 监听标签传播 | Speaker-listener Label Propagation Algorithm | slpa
+| 两点间最短路径 | Single-Pair Shortest Path | spsp
+| 三角计数 | Triangle Counting | triangle 
+| 信任指数排名 | Trustrank | trustrank 
+| 带权重的标签传播 | Weighted Label Propagation Algorithm | wlpa 
+| 带权重的网页排序 | Weighted Pagerank Algorithm | wpagerank 
+| 最大独立集算法 | Maximal independent set | mis 
+| sybil检测算法 | Sybil Rank | sybilrank 
+| 子图匹配算法 | Subgraph Isomorphism | subgraph_isomorphism
+| 模式匹配算法 | Motif | motif
+| k阶团计数算法 | Kcliques | kcliques
+| k阶桁架计数算法 | Ktruss | ktruss 
+| 莱顿算法 | Leiden | leiden
+
+## 基础算法包
+
+### 广度优先搜索
+
+广度优先搜索实现了Breadth-first Search算法，从根点开始，沿着图的宽度遍历所有可访问点。返回结果为遍历点个数。算法内容请参考 [https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 网页排序
+
+网页排序程序实现了常用的Pagerank算法。该算法根据图中边和边权值计算所有点的重要性排名，PageRank值越高，表示该点在图中的重要性越高。计算时以点数量的倒数为各点初始Rank值，然后将点的Rank值按照出边平均传递到相邻点，重复该传递过程直到满足给定的收敛阈值或达到给定迭代轮数。每轮传递结束后，所有点的Rank值会有一定的的比例随机传递到任意点上。算法内容请参考 [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 单源最短路径
+
+单源最短路径实现了Single Source Shortest Path算法，根据给定的源点，计算从该源点出发到其他任意点的最短路径长度。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 弱连通分量
+
+弱连通分量程序实现了Weakly Connected Components算法，该算法会计算图中所有的弱连通分量。弱连通分量是图的一个子图，子图中任意两点之间均存在可达路径。算法内容请参考[https://en.wikipedia.org/wiki/Connected_component_(graph_theory)](https://en.wikipedia.org/wiki/Connected_component_(graph_theory) "scc wiki")。
+
+### 平均集聚系数
+
+平均集聚系数程序实现了Local Clustering Coefficient算法，计算图中点之间聚集程度的系数。返回结果包括整体集聚系数和点集聚系数。整体集聚系数反映了图中整体的集聚程度的评估，点集聚系数包括任意点的集聚系数，反映了该点附近的集聚程度。集聚系数越高，表示集聚程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 标签传播
+
+标签传播算法程序实现了Label Propagation Algorithm算法。该算法是基于标签传播的社区发现算法，计算对象为无权图。在标签传递时，每个点对收到的所有标签进行次数累加，在累加和最高的标签中随机选择一个。迭代收敛或执行到给定轮数后算法终止。最终输出结果为每个点的标签，标签值相同的点视为在同一社区。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+
+## 扩展算法包
+
+### 全对最短路径
+
+全对最短路径程序实现了All-Pair Shortest Path算法，计算图中任意两点间的最短路径。返回结果为任意存在路径的点对之间的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 介数中心度
+
+介数中心度程序实现了Betweenness Centrality算法，估算图中所有点的介数中心度值。介数中心度值反映了图中任一最短路径经过该点的可能性，值越高表示有越多的最短路径经过了该点。计算时需给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 置信度传播
+
+置信度传播程序实现了Belief Propagation算法。该算法给定已观测点的边缘分布，利用点之间相互传递消息的机制来估算未观测点的边缘分布。算法内容请参考[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 距离中心度
+
+距离中心度程序实现了Closeness Centrality算法，估算任意点到图中其他点的最短路径的平均长度。距离中心度越小，表示该点到其他点的平均最短距离最小，意味着该点从几何角度看更位于图的中心位置。计算时需要给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki")。
+
+### 共同邻居
+
+共同邻居程序实现了Common Neighborhood算法，计算任意给定相邻点对之间的共同邻居数量。计算时给定待查询的若干个点对，返回结果为待查询的任意点对的共同邻居数量。
+
+### 度数关联度
+
+度数关联度程序实现了Degree Correlation算法，通过计算任意相邻点对之间的Pearson关联系数来计算图的度数关联度，可用来表征图中高度数点之间关联程度。度数关联度越高，表示图中高度数点之间的关联程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 直径估计
+
+直径估计程序实现了Dimension Estimation算法。该算法会计算图中最长的最短路径长度，用来表征图的直径大小。算法内容请参考[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### EgoNet算法
+
+EgoNet算法需要给定根点和K值，以根点为源点进行宽度优先搜索，找出所有K度以内的邻居组成的子图。找到的子图称为根点的EgoNet。
+
+### 超链接主题搜索
+
+超链接主题搜索算法实现了Hyperlink-Induced Topic Search算法，该算法假定每个点具有权威性Authority和枢纽性Hub两个属性，一个好的枢纽点应该指向许多高权威性的点，而一个良好的权威点应该被许多高枢纽型的点指向。算法将返回每个点的权威性值和枢纽性值。算法内容请参考[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 杰卡德系数
+
+杰卡德系数程序实现了Jaccard Index算法。该算法计算了给定点对之间的Jaccard系数，可用来表示这两个点的相似度。Jaccard系数越高，表示点对之间的相似程度越高。计算时给定带查询的若干点对，返回结果为这些点对的Jaccard系数。算法内容请参考[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### k核算法
+
+k核算法实现了k-core算法。该算法计算所有点的核数，或找出图中所有的K核子图。K核子图是一种特殊子图，子图中任意点度数都不小于给定K值。算法内容请参考 [https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)](https://en.wikipedia.org/wiki/Degeneracy_(graph_theory) "kcore wiki")。
+
+### 鲁汶社区发现
+
+鲁汶社区发现程序实现了Fast-unfolding算法。该算法是基于模块度的社区发现算法，通过不断合并点社区来最大化图的模块度，能够发现层次性的社区结构。算法内容请参考 [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 多源最短路径
+
+多源最短路径程序实现了Multiple-source Shortest Paths算法，根据给定的多个源点，从这些源点出发，计算到达任意点的最短路径值。其中，多个源点到某一点的最短路径值为分别从每个源点出发到达该点的最短路径的最小值。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 个性化网页排序
+
+个性化网页排序程序实现了Personalized PageRank算法。该算法根据给定的源点，基于该源点个性化计算所有点对于源点的重要性排名。Rank值越高，表示该点对于源点越重要。与PageRank不同的是，初始化时源点Rank值为1，其余点Rank值为0；并且每轮传递结束后，Rank值会有一定的比例随即传递回源点。算法内容请参考 [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 强连通分量
+
+强连通分量程序实现了Strongly Connected Components算法。该算法计算了图中所有的强连通分量，强连通分量是图的一个子图，子图中可从任意点出发到达其他任意点。算法内容请参考[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 监听标签传播
+
+监听标签传播算法程序实现了Speaker-listener Label Propagation Algorithm算法。该算法是基于标签传播和历史标签记录的社区发现算法，是对标签传播算法的扩展。与标签传播算法不同的是，本算法会对所有点记录其历史标签，在迭代中对标签进行累加时，会将历史标签也计算在内。最终输出结果为每个点的所有历史标签记录。算法内容请参考论文：“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 两点间最短路径
+
+两点间最短路径程序实现了Bidirectional Breadth-First Search算法，在有向无权图上从起点沿着出边做正向宽度优先搜搜，从终点沿着入边做反向宽度优先搜索，通过起点和终点共同遍历到的点来确定从起点到终点的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 三角计数
+
+三角计数实现了Triangle-counting算法，计算无向图中的三角形个数，可用来表征图中点的关联程度。三角形数越多，表示图中点的关联程度越高。算法内容请参考论文：“Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study” 。
+
+### 信任指数排名
+
+信任指数排名算法实现了Trustrank算法，可以根据给定的白名单，计算任意点的信任指数。信任指数越高，表示该点为非法点的可能性越小。算法内容请参考 [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 带权重的标签传播
+
+带权重的标签传播算法程序实现了Weighted Label Propagation Algorithm算法。=与标签传播算法不同的是，标签的传递跟边的权重相关，在标签传递时，每个点会根据标签的入边进行权重累加，在累加和最高的标签中随机选择一个。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 带权重的网页排序
+
+带权重的网页排序算法程序实现了Weighted Pagerank算法。与PageRank算法不同的是，Rank值的传递跟边的权重有关，点的Rank值将按照边权重加权传递到相邻点。算法内容请参考[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 最大独立集算法
+
+最大独立集算法实现了Maximal independent set算法。最大独立集是指在这个独立集之外没有可以加入它的点。一个图可能有许多大小差异很大的 MIS，算法找出其中一个。算法内容请参考 [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### Sybil检测算法
+
+Sybil检测算法实现了Sybil Rank算法。SybilRank算法从非Sybil节点开始进行提前终止的随机游走。算法内容请参考论文：“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 子图匹配算法
+
+子图匹配算法实现了subgraph_isomorphism算法。subgraph_isomorphism算法对全图所有节点匹配子图，最后输出每个节点被匹配的次数。算法内容参考 [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 模式匹配算法
+
+模式匹配算法实现了motif算法。motif算法对指定的节点匹配k阶子图，最后输出每个指定节点每种k阶子图个数，每个k阶子图用一个64位整数表示，整数的第$i \times k + j$位为1表示子图中有边i->j。算法内容参考 [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### k阶团计数算法
+
+k阶团计数算法实现了k-cliques算法。k-cliques算法对计算图中所有的k阶完全子图的个数，最后输出每个节点所在的k阶完全子图个数。算法内容参考 [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### k阶桁架计数算法
+
+k阶桁架计数算法实现了k-truss算法。k-truss指每条边都至少是k-2个三角形的边的子图。k-truss算法找出图的k-truss子图，最后输出每个节点在子图中的邻居节点列表。算法内容参考 [https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+### 莱顿算法
+
+莱顿算法实现了了leiden算法。leiden算法是基于模块度的社区发现算法，与louvain算法优势在于leiden算法检测出社区中的断链，保证每个社区具有良好的连通性。算法内容参考 [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..bc80c68c65
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+分析接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..46813c7cca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,83 @@
+# Learn Tutorial
+
+> 本文档是为 TuGraph 的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对 TuGraph 的图学习运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于 Tugraph 的一个简单的程序实例，我们将重点介绍其使用方式。
+
+## 1.TuGraph 图学习模块简介
+图学习是一种机器学习方法，其核心思想是利用图结构中的拓扑信息，通过顶点之间的联系及规律来进行数据分析和建模。不同于传统机器学习方法，图学习利用的数据形式为图结构，其中顶点表示数据中的实体，而边则表示实体之间的关系。通过对这些顶点和边进行特征提取和模式挖掘，可以揭示出数据中深层次的关联和规律，从而用于各种实际应用中。
+
+这个模块是一个基于图数据库的图学习模块，主要提供了四种采样算子：Neighbor Sampling、Edge Sampling、Random Walk Sampling 和 Negative Sampling。这些算子可以用于对图中的顶点和边进行采样，从而生成训练数据。采样过程是在并行计算环境下完成的，具有高效性和可扩展性。
+
+在采样后，我们可以使用得到的训练数据来训练一个模型。该模型可以用于各种图学习任务，比如预测、分类等。通过训练，模型可以学习到图中的顶点和边之间的关系，从而能够对新的顶点和边进行预测和分类。在实际应用中，这个模块可以被用来处理各种大规模的图数据，比如社交网络、推荐系统、生物信息学等。
+
+## 2. 运行流程
+TuGraph 图学习模块将TuGraph中的图数据采样，采样后的顶点和边作为图学习的特征，进行学习训练。运行流程如下图所示：
+![Alt text](../../../../images/learn_flow_chart_zh.png)
+
+## 3.TuGraph编译及数据准备
+TuGraph编译请参考：[编译](../../5.installation&running/6.compile.md)
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+## 4. 数据导入
+数据导入请参考[数据导入](../../6.utility-tools/1.data-import.md)
+
+导入过程以cora数据集为例：
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+## 5. feature特征转换
+由于图学习中的feature特征一般表示为较长的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+## 6. 采样算子及编译
+TuGraph在cython层实现了一种获取全图数据的算子及4种采样算子，具体如下：
+### 6.1.采样算子介绍
+| 采样算子 | 采样方式 |
+| --- | --- |
+| GetDB | 从数据库中获取图数据并转换成所需数据结构 |
+| Neighbor Sampling | 根据给定的顶点采样其邻居顶点，得到采样子图 |
+| Edge Sampling | 根据采样率采样图中的边，得到采样子图 |
+| Random Walk Sampling | 根据给定的顶点，进行随机游走，得到采样子图 |
+| Negative Sampling | 生成不存在边的子图。 |
+
+### 6.2.编译
+如果TuGraph已编译，可跳过此步骤。
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+得到算子so后，在Python中import 即可使用。
+
+## 7. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+## 8. 模型加载
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+在使用保存的模型之前，首先需要对其进行加载。代码中，使用如上的代码对已训练模型进行加载。
+
+加载之后，我们可以使用模型对新的顶点和边进行预测和分类。在预测时，我们可以输入一个或多个顶点，模型将输出相应的预测结果。在分类时，我们可以将整个图作为输入，模型将对图中的顶点和边进行分类，以实现任务的目标。
+使用已训练的模型可以避免重新训练模型的时间和资源消耗。此外，由于模型已经学习到了图数据中顶点和边之间的关系，它可以很好地适应新的数据，从而提高预测和分类的准确度。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..2a1c0ac8d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,97 @@
+# Sampling API
+
+> 此文档主要详细介绍了Sampling API的使用说明
+
+## 1. 概述
+
+本手册介绍使用TuGraph的Sampling API接口。
+
+## 2. 图数据预处理
+在采样操作之前，根据图数据路径加载图数据，并映射成olapondb图分析类，代码如下：
+
+```python
+galaxy = PyGalaxy(args.db_path) # 根据路径创建一个galaxy实例
+galaxy.SetCurrentUser(args.username, args.password) # 设置当前用户
+db = galaxy.OpenGraph('default', False) # 打开图数据库指定db
+txn = db.CreateReadTxn() # 创建一个事务实例
+olapondb = PyOlapOnDB('Empty', db, txn) # 根据图加载方式、图数据库实例、事务实例实例化OlapOnDB
+del txn
+del db
+del galaxy
+```
+## 3. 图采样算子介绍
+图采样算子在cython层实现，用于对输入的图进行采样处理，生成的NodeInfo用于保存feature属性、label属性等点信息，EdgeInfo用于保存边信息，这些元数据信息可以被用于特征抽取、网络嵌入等任务中。目前TuGraph图学习模块支持GetDB、NeighborSampling、EdgeSampling、RandomWalkSampling、NegativeSampling五种采样算子。
+### 3.1.RandomWalk算子：
+在给定的采样点周围进行指定次数的随机游走，得到采样子图。
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+step: size_t类型，采样步数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.2.NeighborSample算子：
+在给定采样点的一度邻居中采样一定数量的点，得到采样子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+nei_num: size_t类型，邻居采样点数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.3.Nagetive算子：
+采用负采样算法，生成不存在边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+num_samples: size_t类型，生成不存在边的数量。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值： 无。
+
+### 3.4.EdgeSampling算子：
+根据边采样率，生成采样边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list,EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_rate: double类型，采样率。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.5.GetDB算子：
+从数据库中获取图数据并转换成所需数据结构。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+## 4. 用户自定义采样算法
+用户也可以通过TuGraph Olap接口实现自定义采样算法，接口文档参见[此处](../2.olap/5.python-api.md)，该文档主要介绍图采样算法使用的相关函数的接口设计。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..c8dd5e8e1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,101 @@
+# Training
+
+> 本文档详细介绍了如何使用TuGraph进行图神经网络（GNN）的训练。
+
+## 1. 训练
+使用TuGraph 图学习模块进行训练时，可以分为全图训练和mini-batch训练。
+全图训练即把全图从TuGraph db加载到内存中，再进行GNN的训练。而mini-batch训练则使用上面提到的TuGraph 图学习模块的采样算子，将全图数据进行采样后，再送入训练框架中进行训练。
+## 2. Mini-Batch训练
+Mini-Batch训练需要使用TuGraph 图学习模块的采样算子，目前支持Neighbor Sampling、Edge Sampling、Random Walk Sampling和Negative Sampling。
+TuGraph 图学习模块的采样算子进行采样后的结果以List的形式返回。
+下面以Neighbor Sampling为例，介绍如何将采样后的结果，进行格式转换，送入到训练框架中进行训练。
+用户需要提供一个Sample类：
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. 加载图数据
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+
+        # 2. 采样方法，结果存储在NodeInfo和EdgeInfo中
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+
+        # 3. 对结果进行格式转换，使之符合训练格式
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+如代码所示，首先将图数据加载到内存中。然后使用采样算子对图数据进行采样，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+最后对结果进行格式转换，使之符合训练格式。这里我们使用的是DGL训练框架，因此使用结果数据构造了DGL Graph，最终将DGL Graph返回。
+我们提供TuGraphSample类之后，就可以使用它进行Mini-Batch训练了。
+令DGL的数据加载部分使用TuGraphSample的实例sampler：
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+使用DGL进行模型训练：
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+
+## 3. 全图训练
+GNN（图神经网络）的全图训练是一种涉及一次处理整个训练数据集的训练。它是 GNN 最简单、最直接的训练方法之一，整个图被视为单个实例。 在全图训练中，整个数据集被加载到内存中，模型在整个图上进行训练。这种类型的训练对于中小型图特别有用，并且主要用于不随时间变化的静态图。
+在算子调用时，使用以下方式：
+```python
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+获取全图数据，然后将全图送入训练框架中进行训练。
+完整代码：请参考learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..b5c8888189
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,102 @@
+# Heterogeneous Graph
+
+> 本文档介绍如何使用异质图进行训练。
+
+## 1. 异质图简介
+异质图（Heterogeneous Graph）是指由不同类型的节点和边构成的图结构。在异质图中，节点和边可以具有多样化的属性和关系，代表了不同实体以及它们之间的复杂关联。
+
+在异质图中，节点类型可以代表不同的实体，如用户、商品、话题等，而边类型表示不同实体之间的关系，如用户之间的关注关系、用户与商品之间的购买关系等。节点和边可以具有不同的属性。
+
+异质图提供了一种强大的图模型，能够更好地表达和分析具有多种类型实体和复杂关系的现实世界系统。在不同领域的数据分析和应用中，异质图具有广泛的应用前景和研究价值。
+
+## 2. 异质图创建
+在TuGraph中，一个异构图由一系列边关系构成。每个关系由一个字符串三元组定义 (源节点类型, 边类型, 目标节点类型) 。异质图的创建方式与同质图类似，只是在创建图时需要指定字符串三元组定义。如下所示。
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+其中，第四个参数为异质图的边关系定义，可以通过该参数，指定筛选的异质图点边类型。如果不指定该参数，则默认将全部点边类型的数据进行构图训练。
+
+## 3. 异质图查询接口
+为了方便用户使用，当用户给定第四个参数时，TuGraph提供了查询异质图点边类型的接口。示例如下所示：
+
+### 3.1 点类型查询接口
+```python
+olapondb.ntypes()
+```
+返回值为点类型列表，如['node1', 'node2', 'node3']。
+
+### 3.2 边类型查询接口
+```python
+olapondb.etypes()
+```
+返回值为边类型列表，如['edge1', 'edge2', 'edge3']。
+
+### 3.3 点类型和边类型查询接口
+```python
+olapondb.metagraph()
+```
+返回值为字符串三元组定义 (源节点类型, 边类型, 目标节点类型)，如
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')]。
+
+## 4. 异质图输出格式
+和同质图相同的是，异质图的采样数据结果也存储在NodeInfo和EdgeInfo中。
+可通过如下方式获取输出数据。
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+其中getdb为获取全图数据的函数，db为图数据库实例，olapondb为图分析类。feature_len为节点特征长度，NodeInfo和EdgeInfo为输出的节点和边信息。
+
+其存储信息结果如下：
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 边类型 | EdgeInfo[2] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+| 顶点类型 | NodeInfo[3] |
+
+## 5. 异质图训练
+异构图训练的目标是学习图中节点和边的表示，以便于进行后续的任务，如节点分类、链接预测、图聚类等。为了实现这一目标，研究者们提出了多种基于图神经网络（Graph Neural Networks，GNNs）的模型。这些模型通过聚合邻居节点的信息来更新节点的表示，进而捕捉图结构中的复杂关系。
+
+由于异构图中包含多种类型的节点和边，因此在设计GNN模型时需要考虑如何处理这些不同类型的信息。一种常见的方法是设计不同的聚合函数来分别处理不同类型的邻居节点。此外，还需要考虑如何将这些不同类型的信息整合到一起，以便于模型能够有效地学习到节点和边的表示。
+
+TuGraph 提供了使用裁剪版ogbn-mag数据集进行异质图训练的方法，可供使用者参考。
+
+TuGraph提供的官方docker中暂未提供异质图训练的环境，因此需要用户自行安装相关依赖包。
+在训练之前需要下载ogb和pandas包，具体安装方式如下：
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+训练代码如下所示：
+
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+全部训练代码可参考tugraph/learn/examples/train_full_mag.py文件。
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..e79e36ea91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+图学习
+======
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..d4c9759490
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+存储过程和分析接口
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/conf.py b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/conf.py
new file mode 100644
index 0000000000..34515a01b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/development_guide.md b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/development_guide.md
new file mode 100644
index 0000000000..147eff456f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/development_guide.md
@@ -0,0 +1,289 @@
+# 业务开发指南
+## 连接tugraph-db
+### 驱动连接
+tugraph-db兼容neo4j的通讯协议，因此可以使用neo4j的驱动连接tugraph-db的server。
+
+[bolt driver 使用介绍](./7.client-tools/5.bolt-client.md)
+
+[bolt driver 使用例子](https://github.com/TuGraph-family/tugraph-db/tree/master/demo/Bolt)
+
+### 终端连接
+驱动是业务代码里面使用的，对于服务器上终端访问，可以使用cli客户端。
+
+[console client 使用介绍](./7.client-tools/6.bolt-console-client.md)
+
+## 子图操作
+### 创建子图
+```
+CALL dbms.graph.createGraph('graph1')
+```
+### 删除子图
+```
+CALL dbms.graph.deleteGraph('graph1')
+```
+### 清空子图
+#### 删除所有的点边数据和图schema
+```
+CALL db.dropDB()
+```
+#### 只删除所有点边数据, 保留图schema
+```
+CALL db.dropAllVertex()
+```
+### 查看图schema
+```
+CALL dbms.graph.getGraphSchema()
+```
+### 列出所有子图
+```
+CALL dbms.graph.listGraphs()
+```
+
+### 刷新子图文件系统缓存数据
+```
+db.flushDB()
+```
+
+## 点类型操作
+### 创建点类型
+如下json定义了一个点类型，名字是`node1`。
+```json
+{
+	"label": "node1",
+	"primary": "id",
+	"type": "VERTEX",
+	"detach_property": true,
+	"properties": [{
+		"name": "id",
+		"type": "INT32",
+		"optional": false
+	}, {
+		"name": "name",
+		"type": "STRING",
+		"optional": false,
+		"index": true
+	}, {
+		"name": "num",
+		"type": "INT32",
+		"optional": false,
+		"index": true,
+		"unique": true
+	}, {
+		"name": "desc",
+		"type": "STRING",
+		"optional": true
+	}]
+}
+
+```
+把上面这个json序列化成字符串，作为参数传入，建议使用驱动的参数化特性，避免自己拼接语句。
+```
+CALL db.createVertexLabelByJson($json_data)
+```
+
+### 查看点类型schema
+```
+CALL db.getVertexSchema('node1')
+```
+
+### 删除点类型
+>该操作会同步删除所有该类型的点数据，数据量大的时候，有时间消耗。
+
+如下例子删除点类型`node1`以及该类型的所有点数据。
+```
+CALL db.deleteLabel('vertex', 'node1')
+```
+
+### 点类型添加字段
+>该操作会同步变更所有该类型点的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，一次添加了两个字段：`field1`，字符串类型，可选，默认值是 `null`; `field2`，`int64`类型，必选，默认值是0.
+```
+CALL db.alterLabelAddFields('vertex', 'node1', ['field1', string, null ,true], ['field2', int64, 0, false])
+```
+
+### 点类型删除字段
+>该操作会同步变更所有该类型点的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，一次删除了两个字段: `field1` 和 `field2`。
+```
+CALL db.alterLabelDelFields('vertex', 'node1', ['field1', 'field2'])
+```
+
+### 点类型添加索引
+>该操作会同步构建索引数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，给`field1`字段添加了一个非唯一索引。
+```
+CALL db.addIndex('node1', 'field1', false)
+```
+如下例子，对于点类型`node1`，给`field2`字段添加了一个唯一索引。
+```
+CALL db.addIndex('node1', 'field2', true)
+```
+
+### 点类型删除索引
+如下例子，对于点类型`node1`，删除字段`field1`上的索引。
+```
+CALL db.deleteIndex('node1', 'field1')
+```
+
+
+## 边类型操作
+### 创建边类型
+
+如下json定义了一个边的schema，名字是`edge1`。
+```json
+{
+  "label": "edge1",
+  "type": "EDGE",
+  "detach_property": true,
+  "constraints": [
+    ["node1", "node2"]
+  ]
+  "properties": [{
+    "name": "id",
+    "type": "INT32",
+    "optional": false
+  }, {
+    "name": "name",
+    "type": "STRING",
+    "optional": false,
+    "index": true
+  }, {
+    "name": "num",
+    "type": "INT32",
+    "optional": false,
+    "index": true,
+    "unique": true
+  }, {
+    "name": "desc",
+    "type": "STRING",
+    "optional": true
+  }]
+}
+```
+把上面这个json序列化成字符串，作为参数传入，建议使用驱动的参数化特性，避免自己拼接语句。
+```
+CALL db.createEdgeLabelByJson($json_data)
+```
+### 查看边类型schema
+```
+CALL db.getEdgeSchema('edge1')
+```
+
+### 删除边类型
+>该操作会同步删除所有该类型的边，数据量大的时候，有时间消耗。
+
+如下例子，删除边类型`edge1`以及该类型的所有边数据。
+```
+CALL db.deleteLabel('edge', 'edge1')
+```
+
+### 边类型添加字段
+>该操作会同步变更所有该类型边的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于边类型`edge1`，一次添加了两个字段: `field1`，字符串类型，可选，默认值是 `null`; `field2`，`int64`类型，必选，默认值是`0`.
+```
+CALL db.alterLabelAddFields('edge', 'edge1', ['field1', string, null ,true], ['field2', int64, 0, false])
+```
+
+### 边类型删除字段
+>该操作会同步变更所有该类型边的属性数据，数据量大的时候，有时间消耗。
+
+如下操作，对于边类型`edge1`，一次删除了两个字段: `field1` 和 `field2`。
+```
+CALL db.alterLabelDelFields('edge', 'edge1', ['field1', 'field2'])
+```
+
+### 边类型添加索引
+>该操作会同步构建索引数据，数据量大的时候，有时间消耗。
+
+如下例子，对于边类型`edge1`，给字段`field1`添加了一个非唯一索引。
+```
+CALL db.addEdgeIndex('edge1', 'field1', false, false)
+```
+如下例子，对于边类型`edge1`，给字段`field2`添加了一个唯一索引。
+```
+CALL db.addEdgeIndex('edge1', 'field2', true, false)
+```
+
+### 边类型删除索引
+如下例子，对于边类型`edge1`，删除字段`field1`上的索引。
+```
+CALL db.deleteEdgeIndex('edge1', 'field1')
+```
+
+## 实时查看当前点边数据量
+如下例子返回所有的点边类型，以及每种类型当前的数据量是多少。
+
+读的是统计数据，轻操作。
+```
+dbms.meta.countDetail()
+```
+
+## 导入数据
+### 批量upsert点数据
+如果不存在就插入点，如果存在就更新点的属性，根据点的主键字段值判断是否存在。
+
+第二个参数是一个`list`类型，每个`list`里面的元素是个`map`类型，每个`map`里面是点的字段和对应的值。
+
+推荐使用driver里面的参数化特性，第二个参数直接传入一个 `list`结构体，避免自己构造语句。
+```
+db.upsertVertex('node1', [{id:1, name:'name1'},{id:2, name:'name2'}])
+```
+### 批量upsert边数据
+如果两点之间不存在某条类型的边就插入，如果存在就更新该边的属性。
+
+第四个参数是一个`list`类型，每个数组里面的元素是个`map`类型，每个`map`里面是：边的起点类型主键字段和对应的值、边的终点类型主键字段和对应的值、边类型自身的属性字段和值。每个map里面至少有两个元素。
+
+第二个参数和第三个参数是为第四个参数服务的。分别说明了起点和终点的类型是什么，以及第四个参数中那个字段代表起点主键字段值，那个字段代表终点主键字段值。
+
+推荐使用driver里面的参数化特性，避免自己构造语句。
+```
+CALL db.upsertEdge('edge1',{type:'node1',key:'node1_id'}, {type:'node2',key:'node2_id'}, [{node1_id:1,node2_id:2,score:10},{node1_id:3,node2_id:4,score:20}])
+```
+
+### DataX
+
+https://github.com/ljcui/DataX/tree/bolt 自行编译。
+
+这个DataX实现的 tugraph writer 内部调用的是上面描述的`db.upsertVertex`和`db.upsertEdge`。
+
+### 离线脱机导入数据
+如果你有子图的schema以及子图里面所有的点边数据（csv或者json格式），可以利用`lgraph_import`工具离线将这些数据生成图数据。
+
+该方式适合初始阶段，先灌进去一批全量数据。注意server要停机，导入完再启动server，可以看到生成的子图数据。
+
+参考 [lgraph_import 使用介绍](./6.utility-tools/1.data-import.md) 中的**离线全量导入**部分
+
+## 导出数据
+
+### 在线远程流式导出数据
+[lgraph_cli 使用介绍](./7.client-tools/6.bolt-console-client.md)
+
+CSV 格式
+```
+echo "match(n:person) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+```
+JSON 格式
+```
+echo "match(n:person) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
+### 本地导出整个图的所有数据
+[lgraph_export 使用介绍](./6.utility-tools/2.data-export.md)
+
+CSV 格式
+```
+lgraph_export -d your_db_path -e export_data -g default -f json -u admin -p 73@TuGraph
+```
+JSON 格式
+```
+lgraph_export -d your_db_path -e export_data -g default -f json -u admin -p 73@TuGraph
+```
+
+### 跨版本迁移数据
+[lgraph_export 使用介绍](./6.utility-tools/2.data-export.md)
+
+对于不兼容的版本之间迁移数据，可以使用`lgraph_export`将旧版本server里面的数据全部导出成文本（里面包含图schema以及所有的点边数据），然后再选择合适的方法将这些文本数据导入到新版本。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.1/zh-CN/source/index.rst b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/index.rst
new file mode 100644
index 0000000000..88684b85d4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.1/zh-CN/source/index.rst
@@ -0,0 +1,24 @@
+TuGraph高性能图数据库
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   development_guide.md
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-CPP-Procedure-API/Doxyfile b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-CPP-Procedure-API/Doxyfile
new file mode 100644
index 0000000000..cc6c7321ce
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-CPP-Procedure-API/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.3.2
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-CPP-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-CPP-Procedure-API/run.sh
new file mode 100644
index 0000000000..e2455bfbc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-CPP-Procedure-API/run.sh
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+# 0. install: yum install doxygen, graphviz
+# 1. run this script
+doxygen Doxyfile
diff --git a/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/Makefile b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/Makefile
new file mode 100644
index 0000000000..e58ac30a31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+SPHINXPROJ    = TuGraph
+SOURCEDIR     = .
+BUILDDIR      = _build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/conf.py b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/conf.py
new file mode 100644
index 0000000000..8af367a431
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/conf.py
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+#
+# Configuration file for the Sphinx documentation builder.
+#
+# This file does only contain a selection of the most common options. For a
+# full list see the documentation:
+# http://www.sphinx-doc.org/en/master/config
+
+# -- Path setup --------------------------------------------------------------
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#
+import os
+import sys
+sys.path.insert(0, os.path.abspath('../../../build/output/'))
+
+
+# -- Project information -----------------------------------------------------
+
+project = u'TuGraph'
+copyright = u'2018-2022, Ant Group'
+author = u'Ant Group'
+
+# The short X.Y version
+version = u''
+# The full version, including alpha/beta/rc tags
+release = u''
+
+
+# -- General configuration ---------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#
+# needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.autodoc',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+#
+# source_suffix = ['.rst', '.md']
+source_suffix = '.rst'
+
+# The master toctree document.
+master_doc = 'index'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+# This pattern also affects html_static_path and html_extra_path .
+exclude_patterns = [u'_build', 'Thumbs.db', '.DS_Store']
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+
+# -- Options for HTML output -------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+#
+html_theme = 'nature'
+#html_theme = 'haiku'
+#html_theme = 'pyramid'
+#html_theme = 'sphinxdoc'
+#html_theme = 'bizstyle'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#
+# html_theme_options = {}
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Custom sidebar templates, must be a dictionary that maps document names
+# to template names.
+#
+# The default sidebars (for documents that don't match any pattern) are
+# defined by theme itself.  Builtin themes are using these templates by
+# default: ``['localtoc.html', 'relations.html', 'sourcelink.html',
+# 'searchbox.html']``.
+#
+# html_sidebars = {}
+
+
+# -- Options for HTMLHelp output ---------------------------------------------
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'TuGraphdoc'
+
+
+# -- Options for LaTeX output ------------------------------------------------
+
+latex_elements = {
+    # The paper size ('letterpaper' or 'a4paper').
+    #
+    # 'papersize': 'letterpaper',
+
+    # The font size ('10pt', '11pt' or '12pt').
+    #
+    # 'pointsize': '10pt',
+
+    # Additional stuff for the LaTeX preamble.
+    #
+    # 'preamble': '',
+
+    # Latex figure (float) alignment
+    #
+    # 'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'TuGraph.tex', u'TuGraph Documentation',
+     u'Ant Group', 'manual'),
+]
+
+
+# -- Options for manual page output ------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'tugraph', u'TuGraph Documentation',
+     [author], 1)
+]
+
+
+# -- Options for Texinfo output ----------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'TuGraph', u'TuGraph Documentation',
+     author, 'TuGraph', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+
+# -- Extension configuration -------------------------------------------------
diff --git a/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/index.rst b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/index.rst
new file mode 100644
index 0000000000..b527659252
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/index.rst
@@ -0,0 +1,37 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+TuGraph Procedure API - Python
+====================================
+Version: 4.3.2
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Noe4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
+
+
+Indices and tables
+-------------------
+
+* :ref:`genindex`
+* :ref:`modindex`
+* :ref:`search`
diff --git a/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/make.bat b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/make.bat
new file mode 100644
index 0000000000..b1d0c9a1dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=.
+set BUILDDIR=_build
+set SPHINXPROJ=TuGraph
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.http://sphinx-doc.org/
+	exit /b 1
+)
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/run.sh
new file mode 100755
index 0000000000..d10e0a2b1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/autogen/TuGraph-Python-Procedure-API/run.sh
@@ -0,0 +1,7 @@
+# 0. install sphinx-build: yum install python3-sphinx
+# 1. default lgrpah module path: ../../../build/output/lgraph_python.so
+# 2. make lgraph_python
+# 3. run this script
+rm output -rf
+mkdir -p _static _templates
+sphinx-build -W -b html . output
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/.readthedocs.yaml b/docs/docusaurus/versions/version-4.3.2/en-US/.readthedocs.yaml
new file mode 100644
index 0000000000..92cd0965f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/en-US/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/Makefile b/docs/docusaurus/versions/version-4.3.2/en-US/Makefile
new file mode 100644
index 0000000000..a4de0bff18
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?= -W
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/make.bat b/docs/docusaurus/versions/version-4.3.2/en-US/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/1.guide.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/1.guide.md
new file mode 100644
index 0000000000..ad90ea3035
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/1.guide.md
@@ -0,0 +1,76 @@
+# Guide
+
+> Here is the document map that helps users learn and use the TuGraph community version quickly.
+
+## Quick Start
+
+> Understand [What is a Graph](./2.introduction/1.what-is-graph.md),[The application scenarios of graph](./2.introduction/8.scenarios.md),[What is TuGraph](./2.introduction/3.what-is-tugraph.md).
+
+> Quickly Install and deploy TuGraph:[Cloud Deployment](5.installation&running/5.cloud-deployment.md),[Docker Deployment](5.installation&running/3.docker-deployment.md)Rapid deployment TuGraph.
+
+> Quickly get started with DEMO:[Movie](./3.quick-start/2.demo/1.movie.md),[The Wandering Earth](./3.quick-start/2.demo/2.wandering-earth.md),[Three Body](./3.quick-start/2.demo/3.the-three-body.md),[Three Kingdoms](./3.quick-start/2.demo/4.three-kingdoms.md).
+
+> User Guide:[TuGraph Browser](./4.user-guide/1.tugraph-browser.md),[TuGraph Browser Legacy](./4.user-guide/2.tugraph-browser-legacy.md).
+
+## Development Guide
+
+> Client Tools: [Bolt Client](7.client-tools/5.bolt-client.md).
+
+> TuGraph Query Language:[Cypher API](8.query/1.cypher.md).
+
+> Procedure And Algorithm:[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md).
+
+> C++/Python Procedure Interfaces:[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## Community Contribution
+
+> Before starting to contribute, you can learn [how to contribute](12.contributor-manual/1.contributing.md)
+
+> If you want to understand the division of community roles, please visit [community roles](12.contributor-manual/2.community-roles.md)
+
+## Main warehouse
+
+> TuGraph-DB repository: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> Visual interface: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java client: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> Simple test method based on twitter data: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> Test method based on standard LDBC-SNB: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics repository: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## Video Center
+
+> [Get started quickly with TuGraph](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph technology sharing collection](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [Understand graph calculation in 3 minutes](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph-Latest-Version
+
+| Description                      | File                                       | Link                                                                                                                                                                                                     |
+|----------------------------------|--------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 runtime package          | tugraph-4.3.2-1.el7.x86_64.rpm             | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-4.3.2-1.el7.x86_64.rpm)                                                                                         |
+| CentOS8 runtime package          | tugraph-4.3.2-1.el8.x86_64.rpm             | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-4.3.2-1.el8.x86_64.rpm)                                                                                         |
+| Ubuntu18.04 runtime package      | tugraph-4.3.2-1.x86_64.deb                 | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-4.3.2-1.x86_64.deb)                                                                                             |
+| CentOS7 runtime image            | tugraph-runtime-centos7-4.3.2.tar          | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-runtime-centos7-4.3.2.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                   |
+| CentOS8 runtime image            | tugraph-runtime-centos8-4.3.2.tar          | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-runtime-centos8-4.3.2.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8)                   |
+| Ubuntu18.04 runtime image        | tugraph-runtime-ubuntu18.04-4.3.2.tar      | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-runtime-ubuntu18.04-4.3.2.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04)          |
+| CentOS7 mini runtime package     | tugraph-mini-4.3.2-1.el7.x86_64.rpm        | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-mini-4.3.2-1.el7.x86_64.rpm)                                                                                    |
+| CentOS8 mini runtime package     | tugraph-mini-4.3.2-1.el8.x86_64.rpm        | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-mini-4.3.2-1.el8.x86_64.rpm)                                                                                    |
+| Ubuntu18.04 mini runtime package | tugraph-mini-4.3.2-1.x86_64.deb            | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-mini-4.3.2-1.x86_64.deb)                                                                                        |
+| CentOS7 mini runtime image       | tugraph-mini-runtime-centos7-4.3.2.tar     | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-mini-runtime-centos7-4.3.2.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7)        |
+| CentOS8 mini runtime image       | tugraph-mini-runtime-centos8-4.3.2.tar     | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-mini-runtime-centos8-4.3.2.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8)        |
+| Ubuntu18.04 mini runtime image   | tugraph-mini-runtime-ubuntu18.04-4.3.2.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.2/tugraph-mini-runtime-ubuntu18.04-4.3.2.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 compilation image        | tugraph-compile-centos7-1.3.2.tar          | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.3.2.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)          |
+| CentOS8 compilation image        | tugraph-compile-centos8-1.3.2.tar          | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.3.2.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)          |
+| Ubuntu18.04 compilation image    | tugraph-compile-ubuntu18.04-1.3.2.tar      | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.3.2.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04) |
+
+
+For the version update log, see: [Link](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md).
+
+If you don't know how to use installation packages and images, please refer to [Environment and Version Selection](13.best-practices/4.selection.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..c04cb1030c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/1.privilege.md
@@ -0,0 +1,141 @@
+# Privilege
+
+## 1.Introduce
+
+> The permissions of TuGraph are managed based on role-based access control. The permissions that define access control are assigned to roles, and the roles are then assigned to users.
+
+## 2.Level of permissions
+
+- Global layer: indicates global permissions, which have permissions for management and graph operations.
+- Graph layer: control permissions on each graph;
+- Property level (Commercial version only) : control permissions on a property
+
+## 3.Permission keyword
+
+At present, the control of permissions is relatively simple
+
+- The Global layer currently has admin permission, and the admin user is preset.
+
+* The Graph layer has four operation permissions: none, read, write, and full
+
+- none: No permission, no operation permission for the graph
+- read: Read-only permission, only has read permission for the graph
+- write: Read and write permission, not only has read permission for the graph, but also has write permission
+- full: All permissions, not only have read and write permissions for graphs, but also have permissions to delete graphs, modify graphs, and modify schemas
+
+* The Property layer (Commercial version only)  has the following permissions: none, read, and write
+
+- none: No permission, no operation permission for the property
+- read: Read-only permission, only has read permission for the property
+- write: Read and write permission, not only has read permission for the property, but also has write permission
+
+## 4.Common permission operations
+
+### 4.1.User action
+
+- Creating a user
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- Deleting a user
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- Change the password of the current user
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- Changes the password of a specified user
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- Disable or enable a user
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- List all users
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- Lists the current user information
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- Obtain user details
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.Role actions
+
+- Create a role
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- Delete a role
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- List all characters
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- Disable or enable the role
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.Assign roles to users
+
+- Adds the association between the user and the role
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- Deletes the association between the user and the role
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- Clears the relationship between user roles and rebuilds them
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.Role empowerment
+
+- Modifies the access permission of a role to a specified graph
+
+```cypher
+CALL dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP)
+```
+
+Example
+
+```cypher
+CALL dbms.security.modRoleAccessLevel("test_role", {test_graph1:"FULL", test_graph2:"NONE"})
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/2.token.md
new file mode 100644
index 0000000000..dd4ac2e2e5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/2.token.md
@@ -0,0 +1,42 @@
+# Token Usage Guide
+## 1. Introduction to Token
+JWT (JSON Web Token) is an open standard used for authentication and authorization. It is based on the JSON (JavaScript Object Notation) format and is designed for securely transmitting claim information between network applications.
+
+JWT consists of three parts: the header, payload, and signature. The header contains the type of JWT and the signature algorithm used, the payload contains the information to be transmitted, and the signature is used to verify the integrity and authenticity of the JWT.
+
+In TuGraph, JWT is used to implement a stateless authentication and authorization mechanism. After a user logs in successfully, the server generates a JWT and returns it to the client. The client passes this JWT as an identity credential in subsequent requests to the server. Upon receiving the JWT, the server verifies the signature and parses the information in the payload to determine the user's identity and permissions, and decides whether to allow the execution of the request.
+
+## 2. Token Expiration
+### 2.1. Browser Token Interaction Logic
+1. The user opens the browser, enters the username and password, and clicks login.
+2. The frontend calls the login interface and inputs the account and password to the backend.
+3. After receiving the account and password, the backend verifies them and returns a Token.
+4. The frontend stores the Token in the browser cache, and all subsequent requests must carry this Token.
+5. If the frontend actively clicks logout or closes the page, it should actively call the logout interface and pass the Token to the backend.
+6. After receiving the Token, the backend invalidates it, returns a status code 200, and "logout successful". After receiving the message, the frontend clears the Token in the browser memory, and returns to the login page.
+7. The Token expires (initially set to 24 hours), and the user needs to log in again.
+### 2.3. Token Expiration Refresh Mechanism
+Token expiration has a refresh mechanism that is turned off by default. If turned on, the security of the Token will be higher, and there will be two timestamps.
+
+The first timestamp `refresh_time` is used to determine whether the Token has expired (default 24 hours): after expiration, the refresh interface can be called to obtain a new Token, which can be set to a shorter time, such as 1 hour.
+
+The second timestamp `expire_time` is the forced expiration timestamp (default 24 hours): after expiration, the user must log in again.
+
+### 2.4. Token Expiration Modification
+To facilitate developers to develop on their own, TuGraph provides two ways to modify the expiration time, both of which require admin privileges.
+
+* Set through the interface call. The interfaces involved in modifying the expiration time are `update_token_time` and `get_token_time` for querying the expiration time. For details, please refer to the [REST interface document](../7.client-tools/9.restful-api-legacy.md).
+* Set through startup parameters. When the server-side is started, adding the parameter `-unlimited_token 1` can set the Token to be unlimited. Please refer to the [service running document](../5.installation&running/7.tugraph-running.md) for details.
+## 3. Introduction to Token-Related Requests Sent by Clients
+The client handles two types of protocol-related requests: REST and RPC.
+
+### 3.1. REST
+If the client uses the REST protocol (including the browser), because it is a short connection, Token needs to be carried in every request, and a new Token needs to be obtained after it expires.
+
+For self-developed clients, if the REST protocol is used, Token logic needs to be considered.
+
+### 3.2. RPC
+If the client uses the RPC protocol (including the official C++/Java/Python), it uses a long connection to maintain, and no Token operation is involved after login.
+
+## 4. Token upper limit
+The upper limit of Token refers to the maximum number of Tokens that a user can own at the same time. To prevent unlimited logins, the upper limit of Token is 10000 by default. Since the token generation logic is strongly related to time, a token will be generated for storage every time you log in. The validity period of the token is 24 hours by default. Therefore, it is recommended to log out the unused token in time after login.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..706d377c16
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,20 @@
+# Forgot Admin Password
+> TuGraph provides a password reset feature. If you forget the password for the admin account, you can reset it by following these steps.
+
+## 1. Reset Password
+First, stop the TuGraph server.
+
+When starting the TuGraph server again, add the following parameter:
+```bash
+--reset_admin_password 1
+```
+
+Here is an example:
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+This operation will reset the password for the admin account to the default password: 73@TuGraph when starting the TuGraph server.
+If the password reset is successful, you will receive the message "Reset admin password successfully" and the current server process will be closed.
+
+You need to restart the server in normal mode and then use the default account and password to log in. After logging in, you can reset the password to continue using TuGraph.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..6695299a7d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/4.monitoring.md
@@ -0,0 +1,1019 @@
+# Monitoring
+
+> This document mainly introduces the visualization operation and maintenance monitoring of TuGraph.
+
+## 1.Design Concept
+
+Visualization monitoring is not an indispensable part of TuGraph itself. Therefore, in the design, visualization monitoring is regarded as an application in the peripheral ecology of TuGraph to reduce the coupling with TuGraph database and its own impact. TuGraph visualization monitoring adopts the hottest open source solution - TuGraph Monitor + Prometheus + Grafana. Wherein, TuGraph Monitor is the client of TuGraph service, which initiates Procedure requests to TuGraph service through TCP connection. After receiving the request, TuGraph service collects statistics of CPU, memory, disk, IO, and number of requests on its own machine and responds. TuGraph Monitor packages the index data received from TuGraph into the format required by Prometheus and saves it in memory, waiting for Prometheus to obtain it through HTTP request. Prometheus regularly obtains packaged request data from TuGraph Monitor through HTTP requests and saves it in its own time-series database according to the time obtained. Grafana can obtain the statistical data within a certain time period from Prometheus according to user configuration and draw easy-to-understand graphics on the web interface to display the final result. In the entire request chain, the active acquisition, i.e. pull model, is used, which has the advantages of minimizing the coupling between data producers and data consumers, making development simpler, and not requiring data producers to consider the data processing capability of data consumers. Even if the data processing ability of a consumer is weak, it will not be crushed by the data producer producing data too fast. One of the shortcomings of the active pulling model is that the real-time performance of the data is insufficient. However, in this scenario, data does not have high real-time requirements.
+
+### 1.1.TuGraph
+
+TuGraph database provides the ability to collect multiple data information, such as disk, memory, network IO, and query requests, in the service machine, and provides queries through standard Procedure methods. This action of collecting data only occurs when a user queries through the interface, avoiding the impact of TuGraph monitoring service on user business query requests when users do not need the indicators on TuGraph monitoring service machine.
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor is a tool in the peripheral ecology of TuGraph. It communicates with TuGraph through C++ RPC Client as one of the many users of TuGraph and queries the performance indicators of the machine where TuGraph service is located through the Procedure query interface. It packages the results returned by TuGraph into the data model required by Prometheus and waits for Prometheus to obtain them. Users can set the query time interval to minimize the impact of obtaining monitoring indicators on business queries.
+
+### 1.3.Prometheus
+
+Prometheus is an open-source monitoring platform with a dedicated time-series database. It regularly obtains statistical indicators from the TuGraph Monitor service through HTTP requests and saves them in its own time-series database. For details, please refer to the official website:[https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana is an open-source visualization and analysis software. It can obtain data from multiple data sources, including Prometheus, and can convert data in the time-series database into tools for beautiful graphics and visual effects. For specific information, please refer to the official website:[https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.Deployment Solution
+
+### 2.1.Step 1
+
+Start the TuGraph service. For details, please refer to the documentation:[https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.Step 2
+
+Start the TuGraph Monitor tool. The startup command is as follows:
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+The meanings of the parameters are as follows:
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.Step Three
+
++ Download the Prometheus tarball that matches your machine architecture and system version. Download link:[https://prometheus.io/download/](https://prometheus.io/download/)
+
++ Unzip the tarball with the following command:
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ Modify the configuration file prometheus.yml and add the following configuration to enable Prometheus to scrape performance data packaged by TuGraph Monitor.
+
+```
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ Start Prometheus. You can obtain specific startup parameters with the following command:
+
+```shell
+./prometheus -h
+```
+
++ Verify if the Prometheus service is running properly by logging into the Prometheus service through the web portal, and querying whether the monitoring index resources_report has been obtained. If the data can be successfully queried, the operation is successful.
+
+### 2.4.Step Four
+
++ Download the Grafana installation package that matches your machine architecture and system version. Download link:[https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ Install Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Start Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Configure Grafana. First, configure the IP address of Prometheus in the data source settings. After the configuration is completed, verify if the data source is connected successfully by testing the connection function. Then, import the following template and modify the correct interface IP and port in the page according to the actual situation. Finally, set the refresh time and monitoring time range according to the actual situation.
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana",
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{label_name}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "memory",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \n  QPS exceeds 1000",
+        "name": "Request statistics alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "Request statistics",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "disk",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \nCPU usage rate exceeds 90%",
+        "name": "CPU usage rate alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU usage rate",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] Disk IO exceeds 10MB/S",
+        "name": "Disk IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph Monitoring Web",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+Verify the effect by refreshing the browser page. If the pie chart and line chart are displayed correctly, the configuration is completed.
+
+## 3.Future Plans
+
+Currently, visual monitoring only supports single-machine monitoring and can monitor performance indicators such as CPU, disk, network IO, and request QPS of the machine on which the service is located. In the future, monitoring for HA clusters will be implemented, and more meaningful indicators will be included in the monitoring scope.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/5.log.md
new file mode 100644
index 0000000000..caca9a40f7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# Log
+
+> This document mainly introduces the logging function of TuGraph.
+
+## 1.Introduction
+
+TuGraph keeps two types of logs: server logs and audit logs. Server logs record human-readable server status information, while audit logs maintain encrypted information for every operation performed on the server.
+
+## 2.Server log
+
+### 2.1.Server Log Configuration Items
+The output directory of server logs can be specified through the `log_dir` configuration item. The level of log can be specified through the `verbose` configuration item.
+
+The `log_dir` configuration item is empty by default. If `log_dir` configuration item is empty, then all logs will be write to the console(nothing will be written to the console if the `log_dir` configuration item is empty under daemon mode); if `log_dir` configuration item is configured specifically, log files will bew generated under that path. The maximum size of a single log file is 256MB.
+
+The `verbose` configuration item controls the level of log, and is divided into three levels of `0, 1, 2`. Ther verbosity of log record grows as the number grows. The default level is `1`. When the level is set to `2`, the server will print logs in `DEBUG` level and above. When the level is set to `1`, the server will print logs in `INFO` level and above. When the level is set to `0`, the server will print log in `ERROR` level and above.
+
+### 2.2.Example of Server Log Output Macro Usage
+
+If the developer wants to add logs to the code during development, they can refer to the following example:
+
+```
+#include "tools/lgraph_log.h" // add log dependency.
+
+void LogExample() {
+    // The log module has been initialized during the database startup, and developers can directly call the macro.
+    // The log level is divided into five levels: DEBUG, INFO, WARNING, ERROR, and FATAL.
+
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+
+You can also refer to the log macro usage in test/test_lgraph_log.cpp.
+
+### 2.3.Procedure log
+
+Developers can use the log function to output debug information that they need to the log for looking up and assisting development during the development of procedures. Debug information will be output to the same log file as the server log (if `log_dir` configuration item is not specified, it will also be output to the console)
+
+#### 2.3.1.Cpp procedure
+Please use the log macro provided in 2.2 to output debug information, and avoid using output methods such as cout or printf. For specific usage, please refer to the following sample code (see `procedures/demo/log_demo.cpp` for details)
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+After inserting the above sample code into the database as a procedure and running it, you can see the corresponding log entries in the log file.
+
+#### 2.3.1.python procedure
+Please use Python's built-in print to output debug information. The debug information will be merged into a WARN-level log entry and output to the log file after the procedure is executed.
+
+## 3.Audit log
+
+Audit logs record each request and response, as well as the user who sent the request and when the request received. Audit logging can only be turned on or off. The results can be queried using the TuGraph visualization tool and the REST API.
+
+To enable the Audit Log, you need to set the `enable_audit_log` parameter to `true` in the configuration file. For the configuration file and parameter descriptions, see:[Tugraph Running/Service configuration](../../5.installation&running/7.tugraph-running.md)
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/index.rst
new file mode 100644
index 0000000000..4dc0c67422
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Privilege And Operations
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..2cdb8d3f31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# Unit Testing
+
+> This document is the unit testing documentation for TuGraph.
+
+## 1.Introduction
+
+TuGraph unit testing uses the gtest framework, which can choose to run all tests at once or specify certain tests.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..b98cf7f62a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/11.quality/2.integration-testing.md
@@ -0,0 +1,400 @@
+# Integration Testing
+
+> This document mainly introduces how to use the TuGraph integration testing framework.
+
+## 1.The Significance of TuGraph Integration Testing
+
+In unit tests and function tests, some test cases directly use Galaxy or Statemachine to perform tests, which is not a complete process. In the complete CS architecture, user requests are sent to the server through the client, and network communication is essential. To avoid bugs caused by incomplete unit testing, TuGraph uses an integration testing framework to perform end-to-end testing.
+
+## 2.TuGraph Integration Testing Framework
+
+TuGraph uses the Pytest framework as its integration testing framework. Pytest is currently the most widely used CS-side integration testing framework. It is known for its flexibility, ease of use, and the ability to support parameterization. Based on the functionality provided by Pytest, TuGraph abstracts different tools and controls the processing logic of each tool through parameters to facilitate efficient testing code development.
+
+For more information on Pytest, please refer to the official website: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.Component Description
+
+| Component Name    |Component Function      | Implementation Method                              |
+| --------------- | -------------------------- | ------------------------------------------------ |
+| server          | TuGraph standalone service | Start a child process and launch the service       |
+| client          | TuGraph Rpc Client         | Open TuGraph Python Rpc Client in the current process and send requests  |
+| importor        | TuGraph Importor           | Start a child process to process import requests               |
+| exportor        | TuGraph Exportor           | Start a child process to process export requests               |
+| backup_binlog   | TuGraph Backup Binlog      | Start a child process to process binlog backup requests       |
+| backup_copy_dir | TuGraph Backup             | Start a child process to process full db backup requests       |
+| build_so        | Component for compiling C++ dynamic libraries    | Start a child process to handle GCC compilation logic            |
+| copy_snapshot   | TuGraph Copy Snapshot      | Handle backup snapshot requests in the current process                 |
+| copydir         | Folder copy                 | Handle folder copy requests in the current process                     |
+| exec            | Execute C++/Java executable files     | Start a child process to launch the C++ executable file  |
+| algo            | Execute algorithm                   | Start a child process to run the algorithm     |
+| bash            | Execute bash commands               | Start a child process to execute bash commands      |
+| rest            | TuGraph Python Rest Client | Open TuGraph Python Rest Client in the current process and send requests|
+
+### 2.2.Component Usage
+
+#### 2.2.1.server
+
+##### 2.2.1.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The server will be started before the function starts executing, and the server will be stopped and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ host is the IP and port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to the user in the TuGraph Server
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The client will be started before the function starts executing, and the client will be stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.Startup Command
+
+Import the tool through the fixtures component and control the import of different data through startup parameters. The data will be imported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.Startup Command
+
+Import the tool through the fixtures component and control the export of different data through startup parameters. The data will be exported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.Startup Parameters
+采用python字典传入
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different binlogs through startup parameters. The binlogs will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different databases through startup parameters. The database will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command, passed in as a Python list, and multiple so can be compiled at once
++ so_name is the dynamic library that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.Startup Command
+
+Import the tool through the fixtures component and control the compilation of different dynamic libraries through startup parameters. The dynamic libraries will be generated to the specified directory before the function starts executing, and the dynamic libraries specified in the so_name list will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original database
++ dst is the snapshot copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.Startup Command
+Import the tool through the fixtures component and control the copying of different snapshots through startup parameters. The snapshot in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original directory
++ dst is the directory copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.Startup Command
+Import the tool through the fixtures component and control the copying of different directories through startup parameters. The directory in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.Startup Command
+Import the tool through the fixtures component and control the execution of different logic through startup parameters. A child process will be started to execute the command passed in through the cmd parameter before the function starts executing.
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ result is the expected execution result of the algorithm. After execution is completed, the actual result will be compared with the expected result. If they are different, the test will fail.
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.Startup Command
+Import the tool through the fixtures component and control the execution of different algorithm logic through startup parameters. A child process will be started to execute the algorithm passed in through the cmd parameter before the function starts executing. The function body will wait for the algorithm to complete and compare the result with the expected result.
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.Startup Command
+
+Import the tool through the fixtures component and control the execution of different bash commands through startup parameters. A child process will be started to execute the bash command passed in through the cmd parameter before the function starts executing. The function body will wait for the command to complete.
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ port is the port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to user in TuGraph Server
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.Startup Command
+
+Import the tool through the fixtures component and link to different TuGraph Rest Servers through startup parameters. The client will be started before the function starts executing and stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.Test Cases
+
+#### 2.3.1.rest
+
+In the sample code, before the test_get_info function is executed, the server is started, and a rest client is started after the server is started. After entering the test_get_info function, some information about the server is obtained, and assert is used to determine whether cpu information is obtained.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+In the sample code, before the test_flushdb function is executed, the offline data import logic is executed and the server is started. After creating a connection through the client, the function enters the test_flushdb function. The number of points is queried to determine whether the import is successful. After the import is successful, the flushDB operation is executed. assert is used again to determine whether the db can be emptied normally.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+In the sample code, before the test_export_default function is executed, the offline data import logic is executed. After the import is successful, the data of the current db is exported. Then, the offline import logic is used again to import the exported data into a new directory. The newly imported data is used to start the db and create a connection. In the body of the test_export_default function, it is determined whether the data after export and import is consistent with the original data.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.Other Tests
+For more test cases, please refer to the integration test code [https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/11.quality/index.rst
new file mode 100644
index 0000000000..f3b6e0e061
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Quality
+==============================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..bf465539f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,93 @@
+# TuGraph Contribution Guide
+
+## 1. Preface
+
+Thank you for your contribution to TuGraph. We sincerely hope that more students from the community will join in and build a better graph database project together.
+
+For outstanding community contributors, we will award the TuGraph Outstanding Community Contributor Certificate.
+
+## 2. What to contribute
+
+We welcome any contribution at any time, whether it's a simple typo fix, bug fix, or new feature addition. Feel free to ask questions or initiate PRs. We also value documentation and integration with other open source projects, and welcome contributions in this regard. For any modification, especially the more complex modification, it is recommended to create an issue and fill it out according to the BUG or PR template.
+
+## 3. Preparation
+
+## 3.1. Knowing TuGraph
+
+You can get start with TuGraph follow instrcutions in [Guide Doc](../1.guide.md).
+
+## 3.2. Environment
+
+For document contributions, you can directly modify and submit a pull request by clicking on "Edit on GitHub" in the upper right corner of the [documentation](https://tugraph-db.readthedocs.io/en/latest).
+
+For code contributions, it is usually necessary to set up the environment for compilation and execution. You can deploy using [Docker](../5.installation&running/3.docker-deployment.md) or [local package deployment](../5.installation&running/4.local-package-deployment.md).
+
+## 3.3. License Agreement
+
+Before contributing code, please take some time to understand the process of contributing code to TuGraph, and read the [Contributor License Agreement](3.individual-cla.md) or [Corporate Contributor License Agreement](4.corporate-cla.md). Participating in the contribution is deemed to agree to the above agreement.
+
+## 4. Contribute code process
+
+### 4.1. Submit the issue
+
+Whether you are fixing a bug in TuGraph or adding a new feature to TuGraph, before you submit the code, submit an issue on TuGraph's GitHub, describing the problem you want to fix or the function you want to add. There are several advantages to doing this:
+
+- There will be no duplication of work in conflict with other developers or their plans for the project.
+- TuGraph maintainers will discuss the bugs or new features you mentioned to determine whether the modification is necessary, whether there is room for improvement or a better way.
+- After reaching an agreement, develop and submit the code, reducing the cost of communication between the two parties and reducing the rejection of pull requests.
+
+### 4.2. Pull the branch
+
+All modifications of TuGraph are made on branches. After modification, the pull request is submitted and merged into the Master by the project maintenance personnel after Code Review. Therefore, after the source code steps are described, you need:
+
+1. Download the code to a local directory. In this step, you can choose git or https. In recent years, github has stricter permission requirements. The git approach, for example, requires the more complex ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)). https authentication cannot be performed using the user name and password. git clone https://github.com/ Your account name /tugraph-db
+2. Pull branch ready to modify code:
+   git branch add_xxx_feature
+3. After executing the above command, your code repository switches to the appropriate branch. Run the following command to view your current branch: git branch -a
+4. If you want to switch back to Master, run the git checkout -b master command
+5. If you want to switch back to branching, run the following command: git checkout -b "branchName"
+
+### 4.3. Configuring Github Information
+
+Run git config --list on your machine to view git's global username and mailbox. Check whether the displayed user.name and user.email match your github user name and email address.
+
+If a company has its own gitlab in-house or uses other commercial GitLabs, a mismatch may occur. At this point, you need to set up a separate user name and mailbox for the tugraph-db project. For details about how to set the user name and email address, see github's official documentation.
+
+### 4.4. Compile and Run
+
+The process of compile and run can reference [ci script](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. Change the code and submit it locally
+
+Once you've pulled the branch, you're ready to change the code.
+
+**Code modification Notes**
+
+Code style consistency: TuGraph uses cpplint to keep code in the same format, and IDE can use.clang to configure the style. Be sure to check the code style locally before submitting it, or ACI will report an error.
+
+Add unit test code: New changes should pass through existing unit tests. New unit tests should be provided to prove that there are bugs in the previous code and that the new code has resolved these bugs. You can run all tests with the following command:./unit_test
+It can also be run with the help of an IDE.
+
+**Other precautions**
+
+Please keep the code you are editing in the original style, especially the space feed, etc. For unnecessary comments, delete them directly. Add comments where logic and functionality are not easily understood. Keep documentation up to date. After modifying the code, run the following command to submit all the changes to the local computer:
+git commit -am '(feat) Add the xx function 'git commit -am '(fix) fix xx problem' '
+
+Submit the code to the remote repository
+After the code is committed locally, you can then synchronize the code with the remote repository. Run the following command to submit local changes to github: git push origin "branchname"
+
+If you were forking earlier, the origin here is pushed to your code repository, not TuGraph's.
+
+After the code has been submitted to GitHub, you can send a request to merge your changes into the TuGraph Master. At this point, you need to go to your corresponding repository on GitHub and press the pull request button in the upper right corner. Select the target branch, which is usually the master, and the system will notify the TuGraph staff, who will Review your code, and when it meets the requirements, it will join the main branch and become part of TuGraph.
+
+Please note that the CI will be automatically checked, as well as all Commits signing the cla, with green signs on the commits.
+
+### 4.6. Code Review
+
+After you submit your code, your code will be assigned to a maintainer for Review. Please wait patiently. If no one has responded to your submission after two working days, you can leave a message under PR and @ the corresponding person.
+
+Comments on code Review will be directly noted to the corresponding PR or Issue. If you find the suggestions reasonable, please update them to your code.
+
+### 4.7. Merge code into Master
+
+After the code Review is approved, the TuGraph maintainer will put it into the Master. During this process, the maintainer may specify a new Reviewer and put forward new comments that need to be revised. Normally this step is omitted, and after the code is merged, you will receive an indication that the merge was successful.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..27cff88ae8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,72 @@
+# TuGraph community roles
+
+## 1. Preface
+
+This document describes the roles of membership in the TuGraph community, the requirements and permissions for each role.
+
+## 2. Role summary
+
+This is the division of roles in the TuGraph community, describing the responsibilities of each role, the requirements to become and remain a role, and the permissions of the corresponding role.
+
+Our community is divided into three roles based on the Apache specification:
+
+- Contributor
+- Maintainer
+- PMC
+
+The requirements, responsibilities, and authorities for each role are described below.
+
+## 3. Contributor
+
+### 3.1. requirements
+
+Successfully submit a PR and merge in any of TuGraph's official projects.
+
+### 3.2. responsibility
+
+- Actively respond to issues or PR assigned to you
+- Help reply the issue/pr together and assign the issue to the person in charge of the corresponding module
+
+### 3.3. permissions
+
+- Join the TuGraph GitHub organization and become a member of the TuGraph open source community.
+
+## 4 Maintainer
+
+### 4.1. requirements
+
+The new Committer is recommended by the existing PMC and approved by 2/3 of the votes. The Commiter meets at least one of the following conditions:
+
+- Been a community member for more than three months
+- More than 10 PR for PMC approve
+- Complete major functions
+- Fixed serious bugs
+- Follow project development and participate in community discussion
+
+### 4.2. responsibility
+
+- Community counseling support
+- Actively respond to issues or PR assigned to you
+- The right to vote on major community decisions
+- Review community PR
+
+### 4.4. permissions
+
+- Pull Request review permission
+
+## 5. PMC
+
+### 5.1. requirements
+
+- Not open at the moment, if you have a strong desire please contact PMC
+
+### 5.2. responsibility
+
+- Actively participate in community discussions and give guidance to major community decisions
+- Responsible for ensuring that the community activities of open source projects are running smoothly
+
+### 5.3. permissions
+
+- Pull Request review permission
+- Pull Request approve permission
+- Community role member management
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..4798fc9db4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# Individual Contributor License Agreement
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..5ff3ff31e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# Corporate Contributor License Agreement
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..40b9d098f0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,73 @@
+# TuGraph Roadmap
+
+## 1. Introduction
+
+This document outlines the future development plans for TuGraph, including features currently under development, those
+not in the development pipeline, and completed functionalities not included in the open-source version.
+
+TuGraph aims to be an open-source, high-performance graph database. It adopts a centralized storage approach for graph
+data and, in the short term, does not consider data sharding. Instead, it employs a master-slave replication mode to
+address high-concurrency read scenarios, while utilizing cloud-based storage solutions to address storage capacity
+challenges.
+
+## 2. Completed Functionalities
+
+TuGraph was open-sourced on September 1, 2022, and has received regular bug fixes and enhancements based on community
+feedback.
+
+| Version | Functionality                                                                                 | Date       |
+|---------|-----------------------------------------------------------------------------------------------|------------|
+| 3.3.0   | Initial open-source release                                                                   | 2022.9.1   |
+| 3.3.1   | Refactored graph analysis engine with multi-mode support                                      | 2022.10.14 |
+| 3.3.2   | Added OGM support and improved unit test coverage                                             | 2022.11.21 |
+| 3.3.3   | Iterative improvements to link authentication mechanism and addition of English documentation | 2022.12.23 |
+| 3.3.4   | Cloud deployment support and streamlined LDBC SNB Audit process                               | 2023.1.28  |
+| 3.4.0   | Added support for OLAP Python API and upgraded offline data import                            | 2023.3.11  |
+| 3.5.0   | Introduced POG (Procedures On Graph query language), frontend upgrades                        | 2023.6.5   |
+| 3.5.1   | Added learning engine, Procedure Rust API, and storage-property separation                    | 2023.7.14  |
+| 3.6.0   | High availability support, log system upgrade                                                 | 2023.8.11  |
+| 4.0.0   | ISO GQL support, 11 new open-source graph algorithms, m1 Docker support                       | 2023.9.6   |
+| 4.0.1   | Support for temporal edge sorting, 5 new open-source graph algorithms                         | 2023.9.28  |
+| 4.1.0   | Bolt protocol support, fast online full import, support for geospatial data types             | 2023.12.25 |
+
+In addition, TuGraph has established a comprehensive quality system, including automated unit testing, integration
+testing, and performance testing.
+
+For more detailed information, refer to the "[root]/release/CHANGELOG.md" file in the source code directory.
+
+## 3. Functional Updates in 2024
+
+In addition to the aforementioned core functionalities, the following components are planned for development in 2024.
+
+| Version | 	Functionality                                                | 	Planned Date |
+|---------|---------------------------------------------------------------|---------------|
+| 4.2.x   | 	HA support for Witness role and management tools             | 	2024.3       |
+| 4.2.x   | 	Bolt support for stream processing and parameterized queries | 	2024.3       |
+| x.x.x   | 	GeaX support for Cypher                                      | 	2024.6       |
+| x.x.x   | 	Support for composite indexes                                | 	2024.6       |
+| x.x.x   | 	Optimization of data import functionality                    | 	2024.6       |
+| x.x.x   | 	[Community Feature] Support for geospatial data types        | 	2024.6       |
+| x.x.x   | 	Enhanced Cypher capabilities                                 | 	2024.9       |
+| x.x.x   | 	Support for rapid schema changes                             | 	2024.9       |
+| x.x.x   | 	Vectorization support                                        | 	2024.12      |
+| x.x.x   | 	RPQ support                                                  | 	2024.12      |
+| x.x.x   | 	[Optional] Query engine upgrade                              | 	2024.12      |
+| x.x.x   | 	[Community Feature] Support for GraphAr                      | 	2024.12      |
+
+## 4. Community Collaboration Features
+
+Currently, the development team's resources are limited, and we cannot implement all the desired features for TuGraph.
+However, during the feature planning process, we have identified a range of ideas worth exploring. The team has
+conducted some initial exploration, and we welcome community collaboration in developing the following features:
+
+| Version	 | Functionality	                                                | Planned Date |
+|----------|---------------------------------------------------------------|--------------|
+| x.x.x    | Rich graph algorithm library	                                 | 2024.x       |
+| x.x.x    | Support for default attribute values	                         | 2024.x       |
+| x.x.x    | Best practice of embedded TuGraph-DB usage                    | 2024.x       |
+| x.x.x    | Support for transaction in Bolt clients	                      | 2024.x       |
+| x.x.x    | Support for composite data types like List, Map, and Decimal	 | 2024.x       |
+| x.x.x    | Support of multiple storage engine	                           | 2024.x       |
+
+For simpler features, we will label them as "good first issue" on GitHub issues, and we welcome discussions from
+technology enthusiasts interested in graph databases.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..07fee7bd7a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Contributor Manual
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..baef5017a6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# Importing Data from Relational Databases to TuGraph
+
+> Using [DataX](../6.utility-tools/7.tugraph-datax.md)，to be completed.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..c7b094b1b7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,217 @@
+# Using TuGraph Graph Learning Module for Node Classification
+
+## 1. Introduction
+GNN is a powerful tool for many machine learning tasks on graphs. In this introductory tutorial, you will learn the basic workflow of using GNN for node classification, i.e., predicting the category of nodes in a graph.
+
+This document will show how to build a GNN for semi-supervised node classification on the Cora dataset with only a few labels, which is a citation network with papers as nodes and citations as edges. The task is to predict the category of a given paper.
+By completing this tutorial, you will be able to:
+
+Load the Cora dataset.
+
+Sample and build a GNN model using the sampling operator provided by TuGraph.
+Train the GNN model for node classification on CPU or GPU.
+
+This document requires some experience in using graph neural networks and DGL.
+
+## 2. Prerequisites
+The TuGraph graph learning module requires TuGraph-db version 3.5.1 or above.
+
+It is recommended to use Docker image tugraph-compile 1.2.4 or above for TuGraph deployment:
+
+tugraph/tugraph-compile-ubuntu18.04:latest
+
+tugraph/tugraph-compile-centos7:latest
+
+tugraph/tugraph-compile-centos8:latest
+
+The above images can be obtained on DockerHub.
+Please refer to [Quick Start](../3.quick-start/1.preparation.md) for specific operations.
+
+## 3. Import Cora Dataset to TuGraph Database
+### 3.1. Introduction to Cora Dataset
+The Cora dataset consists of 2708 papers, classified into 7 categories. Each paper is represented by a 1433-dimensional bag-of-words feature, indicating whether a certain word appears in the paper. These bag-of-words features have been preprocessed to be normalized to a range from 0 to 1. The edges represent citation relationships between papers.
+
+TuGraph has provided the Cora dataset import tool, which users can use directly.
+
+### 3.2. Data Import
+The Cora dataset is located in the test/integration/data/algo directory and contains the cora_vertices point set and the cora_edge edge set.
+
+First, the Cora dataset needs to be imported into the TuGraph database. Please refer to [Data Import](../6.utility-tools/1.data-import.md).
+
+In the build/output section below the line:
+``` bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+The number of commands related to the relevant document is to be built/output.
+
+Execute the following command in the build/output directory:
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Here, cora.conf is the graph schema file representing the format of graph data, which can be found in test/integration/data/algo/cora.conf. coradb is the name of the graph data file after import, which represents the storage location of graph data.
+
+## 4. Feature Conversion
+Since the features in the Cora dataset are float arrays of length 1433, which are not supported by TuGraph for loading, they can be imported as strings and converted to char* for easier access later. The implementation can be referred to the feature_float.cpp file.
+The specific execution process is as follows:
+
+Compile the import plugin in the build directory.(Can be skipped if TuGraph has been compiled):
+`make feature_float_embed`
+
+Execute the following command in the build/output directory to perform the conversion:
+`./algo/feature_float_embed ./coradb`
+
+## 5. Compile Sampling Operator
+The sampling operator is used to obtain graph data from the database and convert it into the required data structure. The specific execution process is as follows:
+Can be skipped if TuGraph has been compiled.
+Execute the following command in the tugraph-db/build directory:
+`make -j2`
+
+or execute the following command in the tugraph-db/learn/procedures directory:
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *
+import importlib
+getdb = importlib.import_module("getdb")
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+As shown in the code, after obtaining the algorithm .so file, import and use it.
+
+## 6. Model training and saving
+TuGraph calls the operators of the cython layer in the python layer to realize the training of the graph learning model.
+The usage of the TuGraph graph learning module is introduced as follows:
+Execute under the build/output folder
+`python3 train_full_cora.py --model_save_path ./cora_model`
+You can start training.
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+The detailed training process is as follows:
+### 6.1. Data Loading
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+As shown in the code, load the data into memory based on the path of the graph data, username, password, and subgraph name. TuGraph can load multiple subgraphs for graph training, but we only load one subgraph here.
+
+### 6.2. Build Sampler
+During the training process, the GetDB operator is first used to obtain the graph data from the database and convert it into the required data structure. The specific code is as follows:
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+As shown in the code, the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and their stored information is as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Then a sampler is constructed:
+```python
+batch_size = 5
+count = 2708
+sampler = TugraphSample(args)
+dataloader = dgl.dataloading.DataLoader(fake_g,
+    torch.arange(count),
+    sampler,
+    batch_size=batch_size,
+    num_workers=0,
+    )
+```
+
+### 6.3. Convert the results to the required format
+```python
+src = EdgeInfo[0].astype('int64')
+dst = EdgeInfo[1].astype('int64')
+nodes_idx = NodeInfo[0].astype('int64')
+remap(src, dst, nodes_idx)
+features = NodeInfo[1].astype('float32')
+labels = NodeInfo[2].astype('int64')
+g = dgl.graph((src, dst))
+g.ndata['feat'] = torch.tensor(features)
+g.ndata['label'] = torch.tensor(labels)
+return g
+```
+The results are converted to the required format to fit the training format.
+
+### 6.4. Build the GCN model
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+def build_model():
+    in_size = feature_len  # feature_len is the length of features, which is 1433 here
+    out_size = classes  # classes is the number of classes, which is 7 here
+    model = GCN(in_size, 16, out_size)  # 16 is the size of the hidden layer
+    return model
+```
+In this tutorial, a two-layer Graph Convolutional Network (GCN) will be built. Each layer aggregates neighbor information to compute new node representations.
+
+### 6.5. Train the GCN model
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #If you need to save the model, give the model save path
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+As shown in the code, iterative training is performed 50 times according to the defined sampler, optimizer and model, and the trained model is saved to the path model_save_path.
+
+The output is as follows:
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+The graph learning module can be accelerated by using a GPU. If users want to run it on the GPU, they need to install the corresponding GPU driver and environment. For details, please refer to learn/README.md.
+
+The complete code can be found in learn/examples/train_full_cora.py.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..f769293858
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# Data Migration
+
+## 1 Introduction
+Data migration refers to the process of moving data from one system, storage medium, or application to another system, storage medium, or application. When TuGraph needs to be upgraded or the system hardware environment changes,
+The data in the original TuGraph service needs to be migrated. Based on the system hardware environment and software version, this paper divides data migration into three schemes:
+1. Compatible migration: When the system environment before and after the migration is consistent and the TuGraph software is compatible, you can directly use the backup and recovery method to migrate data;
+2. Upgrade and migration: When the system environment before and after the migration is inconsistent or the TuGraph software is not compatible, it is necessary to migrate the data by first exporting the data and then re-importing;
+3. Online migration: When data migration is performed on a high-availability cluster and the network environment of the cluster is good, the original cluster can be smoothly switched to the new cluster by adding or deleting nodes.
+The following article will introduce these three schemes in detail.
+
+## 2. Compatible Migration
+Compatible migration means that when the system environment remains unchanged and the TuGraph software version is compatible, the data and stored procedures of the original service can be used in the new service, so it can be directly migrated.
+Users can first use the `lgraph_backup` tool to back up the data, then transfer the data to a new machine and restart the service. The specific migration steps are as follows:
+
+### 2.1. Backup data
+Backup data using `lgraph_backup` tool
+```bash
+   lgraph_backup -s db -d db.bck
+```
+You can also directly use the `cp` command in this step, but the `cp` command will copy some redundant metadata, and the raft metadata will also be copied in the HA mode, causing the cluster to fail to restart after migration.
+Therefore, it is recommended to use the `lgraph_backup` tool instead of the `cp` command during data migration.
+
+### 2.2. Start a new service
+Use the following command to start the new service, and the stored procedure will be automatically loaded into the new service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. Stop the original service
+Use the following command to stop the original service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. Upgrade migration
+When the user wants to migrate the original service to a differentiated environment (such as migrating from centos7 to ubuntu18.04), or when the version of TuGraph changes greatly and is incompatible (such as 3.4.0 and 3.6.0),
+Users can first use the `lgraph_export` tool to export the data into a file, transfer it to a new machine, and then use the `lgraph_import` tool to re-import and restart the cluster.
+This can ensure that it can be used in the new environment, but the efficiency is low, and the stored procedure needs to be reloaded. The specific migration steps are as follows:
+
+### 3.1. Export data
+Use the `lgraph_export` tool to export the data and transfer the data to the new machine
+```bash
+   lgraph_export -d db -e db.export
+```
+
+### 3.2. Import data
+Use the `lgraph_import` tool to import data and manually load the stored procedure (see [client operation steps](../7.client-tools/2.cpp-client.md) for details)
+```bash
+   lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. Start a new service
+Start the new service with the following command
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. Stop the original service
+Use the following command to stop the original service
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. Online Migration
+When performing data migration on the server cluster deployed by the high-availability version of TuGraph, if the network bandwidth is sufficient, you can directly migrate the service online by adding or deleting nodes. The specific migration steps are as follows:
+
+### 4.1. Copy data
+Use the following commands to copy the data on the leader node and transfer it to the machine nodes of the new cluster. Since the leader node has the most complete raft log, copying the leader's data can minimize
+The time for the log to catch up.
+```bash
+   cp -r db db.cp
+```
+### 4.2. Starting a new node
+Use the following command to join the new node to the cluster. After joining the cluster, the incremental data will be automatically synchronized to the new node
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. Stop the original node
+Stop the original node service, and send subsequent application requests directly to the new cluster
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..62f7a61957
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# Environment and version selection
+
+> This document introduces how to select the system environment and deployment method
+
+## 1 Introduction
+
+TuGraph provides differentiated system environments and deployment methods for users with different needs to meet the needs of different users such as novices, system developers, production operation and maintenance personnel, and researchers.
+
+## 2. Environmental capability selection
+
+Users can choose different environments based on actual usage scenarios. The compilation environment has the most complete capabilities and requires more third-party software. Correspondingly, the streamlined operating environment requires almost no installation of any dependent libraries and can run TuGraph's basic functions except stored procedures.
+
+| Environment                      | Purpose                                     | Remarks                                 |
+|----------------------------------|---------------------------------------------|-----------------------------------------|
+| Compilation environment          | Compile TuGraph from source                 | For developers                          |
+| Running environment              | Run TuGraph installation package            | Applicable to most users                |
+| Simplified operating environment | Run simplified TuGraph installation package | Less dependence on the operating system |
+
+For a detailed introduction to different environments, see [link](../5.installation&running/2.environment-mode.md).
+
+## 3. Deployment method selection
+
+TuGraph deployment only requires one server (high availability mode requires multiple servers), and you can choose a suitable deployment method based on actual resource conditions and usage scenarios.
+
+| Deployment method | Description | Remarks |
+|----------|-----------------------|--------------- -------------------------------------------------- --------------------------|
+| Cloud deployment | Alibaba Cloud Computing Nest one-click deployment, free trial | Suitable for novices, process reference [Link](../5.installation&running/5.cloud-deployment.md) |
+| Docker deployment | Cross-platform deployment through pre-prepared Docker images | Users with hardware requirements, such as performance testing, please refer to [link](../5.developer-manual/1.installation/3.docker-deployment. md) |
+| Local deployment | Tightly coupled deployment in existing systems | Applicable to specified production environment, refer to the process [Link](../5.installation&running/4.local-package-deployment.md) |
+
+## 4. Next steps
+
+After the deployment is completed, you can proceed to [Start Service](../5.installation&running/7.tugraph-running.md) and [Data Import](../5.developer-manual/3. server-tools/1.data-import.md) and other operations, you can also experience the entire process through [Sample Data](../3.quick-start/2.demo/1.movie.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/5.spatial.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/5.spatial.md
new file mode 100644
index 0000000000..686dc41e1d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/5.spatial.md
@@ -0,0 +1,186 @@
+# Examples of geospatial data type usage
+
+## 1. Introduction
+
+TuGraph, a graph database jointly developed by Ant Group and Tsinghua University, has built a comprehensive graph technology system that includes graph storage, graph calculation, graph learning, and a graph development platform, owning a leading-scale graph cluster in the industry.  In recent years, geospatial capabilities have demonstrated significant application value in graph databases. They not only enhance the expressive power of data but also facilitate the fusion analysis of cross-domain data, especially displaying strong practical value in critical fields such as social networks, map exploration, and urban planning. TuGraph is also gradually supporting geospatial capabilities.
+
+## 2. Background Knowledge
+
+EPSG([EPSG.io: Coordinate Systems Worldwide](https://epsg.io/)) is a standardized collection of geospatial reference system identifiers, used to identify different geospatial reference systems, including coordinate systems, geographic coordinate systems, projected coordinate systems, etc. We commonly use EPSG codes to represent the coordinate systems of data, and here we introduce two of the most common geospatial coordinate systems, which are also the types supported by most databases.
+
+### 2.1 WGS84 Coordinate System (EPSG:4326)
+
+Global Positioning System: WGS84 is the foundation of the Global Positioning System (GPS), allowing GPS receivers around the world to determine precise positions. Almost all modern GPS devices provide location information based on the WGS84 coordinate system. Map Making and Geographic Information Systems (GIS): In the field of map making and GIS, WGS84 is widely used to define positions on Earth. This includes various types of map creation, spatial data analysis, and management, etc. ![image.png](../../../images/spatail/EPSG_4326.png)
+
+### 2.2 Cartesian Coordinate System (EPSG:7203)
+
+The Cartesian coordinate system, also known as the rectilinear or orthogonal coordinate system, is the most basic and widely applied coordinate system. It defines a plane with two axes and a space with three axes that are perpendicular to each other, extensively applied in mathematics, physics, engineering, astronomy, and many other fields. ![image.png](../../../images/spatail/EPSG_7203.png)
+
+### 2.3 Data Storage Formats
+
+OGC (Open Geospatial Consortium) has defined standard representation formats for spatial data, namely WKT and WKB formats, for exchanging and storing spatial data between different systems and platforms, which have now been widely adopted. WKT (Well-Known Text) format is a text markup language that is easy to read and write for humans, while WKB (Well-Known Binary) format uses a series of bytes to encode spatial data, which is more suitable for storage in computers.
+
+**WKT:**
+
+```
+POINT(<x> <y>)
+LINESTRING(<x1> <y1>, <x2><y2>, ...)
+```
+
+The WKT format data is as shown above, first specifying the spatial data type, then specifying the coordinates in parentheses, with a pair of coordinates representing a point, separated by commas between each coordinate pair. For Polygon type data, the first coordinate pair needs to be the same as the last coordinate pair to form a closed surface.
+
+**WKB:**
+
+![image.png](../../../images/spatail/WKB.png)
+
+
+The encoding for the EWKB format is explained as follows:
+
+- Positions 0 - 1: Encoding method;
+- Positions 2 - 5: Spatial data type;
+    - 0100: point
+    - 0200: linestring
+    - 0300: polygon
+- Positions 6 - 9: Data dimension;
+    - 0020: two-dimensional
+    - 0030: three-dimensional
+- Positions 10 - 17: EPSG code of the coordinate system;
+- Positions 18 - n: 16-bit hex representation of pairs of double-type coordinates.
+
+### 2.4 Common functions
+
+| Name                 | Description       | Signature                                                                 |
+|----------------------|-------------------|---------------------------------------------------------------------------|
+| `dbms.graph.createGraph` | create a subgraph           | `dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)` |
+| `db.createVertexLabel`  | create a vertex label  | `db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)`      |
+| `db.getLabelSchema`     | get the schema of label  | `db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)` |
+| `db.deleteLabel`        | delete vertex label       | `db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)`         |
+
+更完整详细的函数使用以及插入数据的语句，可以参考 [Cypher API](../8.query/1.cypher.md)
+
+
+## 3. Data Types
+
+Currently, in TuGraph, we support three types of spatial data: Point, Linestring, and Polygon.
+
+- Point: POINT(2.0, 2.0, 7203)
+- Linestring: LINESTRING(0 2,1 1,2 0)
+- Polygon: POLYGON((0 0,0 7,4 2,2 0,0 0))
+
+Coordinates are of double type. Examples for creating graph models and inserting data as follows:
+
+**Create a vertex to mark food locations**
+
+```
+CALL db.createVertexLabel('food', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true) 
+```
+
+![image.png](../../../images/spatail/createVertexLabel.png)
+
+**Insert data to mark food points**
+
+```
+ CREATE (n:food {id:10001, name: 'aco Bell',pointTest:point(3.0,4.0,7203)}) RETURN n
+```
+
+![image.png](../../../images/spatail/createFoodData.png)
+
+**Create a vertex with polyline attributes**
+
+```
+CALL db.createVertexLabel('lineTest', 'id', 'id', int64, false, 'name', string, true,'linestringTest',linestring,true)
+```
+
+![image.png](../../../images/spatail/createVertexLabel_lineTest.png)
+
+**Insert data for vertex with linestring attributes**
+
+```
+CREATE (n:lineTest {id:102, name: 'Tom',linestringTest:linestringwkt('LINESTRING(0 2,1 1,2 0)', 7203)}) RETURN n
+```
+
+![image.png](../../../images/spatail/createLineTestData.png)
+
+**Create a vertex with polygon attributes**
+
+```
+CALL db.createVertexLabel('polygonTest', 'id', 'id', int64, false, 'name', string, true,'polygonTest',polygon,true)
+```
+
+![image.png](../../../images/spatail/createVertexLabel_PolygonTest.png)
+
+**Inser data for vertex with polygon attributes**
+
+```
+CREATE (n:polygonTest {id:103, name: 'polygonTest',polygonTest:polygonwkt('POLYGON((0 0,0 7,4 2,2 0,0 0))', 7203)}) RETURN n
+```
+
+## 4. Function Introduction
+
+| Function Name  | Description | Input Parameters                         | Return Type |
+| --- | --- |------------------------------| --- |
+| Distance() | Calculate the distance between two spatial data (requires the same coordinate system) | Spatial data1, Spatial data2 | double |
+| Disjoint()  |  Determine whether two spatial data intersect (under development) | Spatial data1, Spatial data2 | bool |
+| WithinBBox() | Determine whether a spatial data is within a given rectangular area (under development) | Spatial data, Point1         | bool |
+
+## 5. Food Exploration 
+
+### 5.1 Personalized Recommendations Based on Geographic Location
+
+In this section, we will explore how to use the TuGraph graph database's geospatial capabilities to create a vivid and interesting food exploration application that connects "people" and "food" through geographical locations to achieve personalized food recommendations. Imagine, no matter where you are, with just a gentle tap, the tempting food around you is at a glance – this is precisely the charm of the scene we're about to build.
+
+### 5.2 Data Model Design
+
+We first define two core types of vertex:：
+
+- Food vertex: Each restaurant or snack shop can serve as a Food node, with attributes that include but are not limited to the name, address, rating, food category, etc. Notably, we will attach geographic coordinate information to every Food node to record its precise location accurately.
+
+```
+ CALL db.createVertexLabel('food', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true,'mark',double,true)
+```
+
+Prepare data:
+
+```
+CREATE (n:food {id:10001, name: 'Starbucks',pointTest:point(1.0,1.0,7203),mark:4.8}) RETURN n
+CREATE (n:food {id:10002, name: 'KFC',pointTest:point(2.0,1.0,7203),mark:4.5}) RETURN n
+CREATE (n:food {id:10003, name: 'Pizza Hut',pointTest:point(2.0,5.0,7203),mark:4.5}) RETURN n
+CREATE (n:food {id:10004, name: 'Taco Bell',pointTest:point(3.0,4.0,7203),mark:4.7}) RETURN n
+CREATE (n:food {id:10005, name: 'Pizza Fusion',pointTest:point(5.0,3.0,7203),mark:4.9}) RETURN n
+CREATE (n:food {id:10006, name: 'HaiDiLao Hot Pot',pointTest:point(2.0,2.0,7203),mark:4.8}) RETURN n
+CREATE (n:food {id:10007, name: 'Lao Sze Chuan',pointTest:point(4.0,3.0,7203),mark:4.7}) RETURN n
+```
+
+- Person vertex: Represents the user of the application, with attributes including username, current location, etc. The user's current location is also represented by geographic coordinates, facilitating subsequent geospatial queries.
+
+```
+ CALL db.createVertexLabel('person', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true)
+```
+
+Prepare data:
+
+```
+ CREATE (n:person {id:1, name: 'Tom',pointTest:point(3.0,3.0,7203)}) RETURN n
+```
+
+### 5.3 Building the Food Exploration Query
+
+The ability to find food within a distance of 2.5 based on the user's current location, and sort by distance in ascending order allows users to have a better experience by seeing the distance and rating.
+
+**Query Statement**
+
+```
+match (n:person{id:1}),(m:food) with n.pointTest as p1,m.pointTest as p2,m.name as food,m.mark as mark
+CALL spatial.distance(p1,p2) YIELD distance 
+WHERE distance<2.5
+RETURN food,distance,mark ORDER by distance
+```
+
+![image.png](../../../images/spatail/querryFood.png)
+
+This query first matches a specific Person node (taking the user "Tom" as an example) and then finds all Food nodes. Using the custom distance function, the query calculates the straight-line distance between the current location of the Person node and each Food node, filtering out food within a distance of 2.5. Finally, the results are sorted by distance in ascending order, and the rating is provided as a reference to offer users the best possible recommendations.
+
+## 6. Outlook
+
+The aforementioned sections not only showcase TuGraph's capabilities in handling geospatial data but also depict an attractive food exploration scenario, proving the great potential of graph databases in providing personalized services that combine geographic location information. Whether it's finding a relaxing spot for the weekend or exploring unique cuisines during travel, such applications are set to greatly enrich people's life experiences. 
+TuGraph will continue to implement Disjoint() and WithinBBox() functions, enriching more use cases. Of course, everyone is welcome to participate and collaborate in developing geospatial functionalities.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..4292d5488f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Best Practices
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/14.faq.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/14.faq.md
new file mode 100644
index 0000000000..48704dfccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/14.faq.md
@@ -0,0 +1,58 @@
+# FAQ
+
+During the use of TuGraph, if you encounter problems, you can first check [User Documentation](https://github.com/TuGraph-db/tugraph-db/tree/master/doc/zh-CN). Second, check to see if the FAQ list below matches your question.
+
+1. **[Kernel Engine QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussion-4575385)**
+   
+   1.1 [Does the edge of TuGraph support index? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165379)
+   
+   1.2 [What is the QPS of a single TuGraph machine? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussion-4575381)**
+   
+   2.1 [How to update the tugraph service after the visualization file is built? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165364)
+   
+   2.2 [How to connect the existing tugraph service through npm run dev? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165366)
+   
+   2.3 [TuGraph Browser version 3.3.0 failed to delete node label? ](https://github.com/TuGraph-db/tugraph-db/discussions/82#discussion-4465791)
+3. **[Client QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussion-4575378)**
+   
+   3.1 [What programming languages ​​does the client currently have, and does it support node js? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165351)
+   
+   3.2 [Does the python client support pip install? Where is the client referenced? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165353)
+4. **[Data Import QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussion-4575373)**
+   
+   4.1 [Which common databases can TuGraph connect to? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165335)
+   
+   4.2 [How to import data? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[Stored Procedure QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussion-4575369)**
+   
+   5.1 [How to load stored procedure or algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165313)
+   
+   5.2 [How to call or execute the stored procedure? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165317)
+   
+   5.3 [Where is the open source built-in algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[Installation and deployment QA summary](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussion-4575364)**
+   
+   6.1 [How to install using docker image? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165287)
+   
+   6.2 [After the rpm package and deb package are installed, start the lgraph_server service. Prompt missing 'liblgraph.so' error? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165289)
+   
+   6.3 [How to compile TuGraph on Mac's M1 chip? ](https://github.com/TuGraph-db/tugraph-db/discussions/47#discussion-4393165)
+   
+   6.4 [How to Handle Error: 'jemalloc: Unsupported system page size'? ](https://github.com/TuGraph-family/tugraph-db/issues/477)
+7. **[Cypher QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussion-4575018)**
+   
+   7.1 [Does it support conditional query of indefinite length? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165252)
+   
+   7.2 [How to query the shortest path, how to use the shortestPath function? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165256)
+   
+   7.3 [Using and after the query statement Where to splice the query speed is slow, how should the statement be optimized and improved? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165260)
+   
+   7.4 [How to query the edge of any jump? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165262)
+   
+   7.5 [Is there a date() function in Cypher? ](https://github.com/TuGraph-db/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA Summay](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+   
+   8.1 [What should I do after the error "User has reached the maximum number of tokens" is reported? ](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+If the problem is still not resolved, we recommend you follow up or create a new thread describing your problem. At the same time, the TuGraph QA summary will be updated regularly based on the posts initiated by everyone in the discussion area.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/15.contacts.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/15.contacts.md
new file mode 100644
index 0000000000..fb28a5f1aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/15.contacts.md
@@ -0,0 +1,17 @@
+# Contacts
+
+If you have any feedback or suggestions for the product, You are welcome to join the discussion or make suggestions through the following contact methods.
+
+Official website: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue:
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions:
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack:
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+Contact us via dingtalk, wechat, email and telephone:
+![contacts](../../images/contact-en.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..549043a94c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,15 @@
+# What is Graph
+
+The graph that we're going to introduce today, it's neither a picture, nor a diagram，it's a class of mathematics called graph theory. We can see on the screen that there are two graphs on the left and right, which represent things and their relationship. We abstract it out in a form, and we call such a form a graph.
+
+![alt what is graph](../../../images/what-is-graph-en.png)
+
+The basic elements of a graph are a vertex, and an edge, a vertex is a representation of the thing, of the entity, and an edge is a representation of the relationship between them.
+
+We see the graph on the left, the dots have companies, they have employees, and they have projects. What are their sides? The relationship between the company and the employees is an employment relationship, and there can be a friend relationship between the employees, and there can be a participation relationship between the project and the employees. That is, we can use graphs to abstract things and their relationships.
+
+The diagram on the right is a schematic diagram of a financial transaction. Each of us has a bank account, and when our bank account makes a consumption or makes a transfer, this account is the point on the graph, and this edge can indicate that there is such a transfer relationship between us.
+
+We can also see from this example that edges can attach information and points can attach information. The point can attach which bank this account is in and what the account is. The value of the transaction can be attached to the edge, and many times, if your transaction is large, it indicates that special attention is needed. This edge might not necessarily be the amount of a particular transfer, it might be the amount accumulated over a period of time and so on. Graphs can actually be very expressive.
+
+On the other hand, for a graph like finance, it can be very large. There could be more than a billion points, a hundred billion or even a trillion edges. As you can imagine, it's actually quite challenging to actually work with these graphs.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..935aa4ffa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# What is a graph database
+
+> This document mainly introduce what is a graph database, the advantages of graph database compared with relational database, and the comparison between graph database and relational database
+
+## 1. Introduction
+
+Graph database is a database based on graph model. The main function of graph database is to manage graph data, so it needs to support efficient vertex/edge query and update; To facilitate user use, it is usually necessary to add transaction support to ensure the normal operation of concurrent operations.
+
+## 2. Advantages of graph databases over relational databases
+
+The function of graph database is an extension of traditional relational database. Compared with relational database, the graph structure supported by graph data is more flexible. Graph database is different from other databases in terms of data addition, deletion, query and modification based on graph. On the operation abstraction of graph data, a vertex-based perspective is adopted, for example, a vertex accesses its neighboring vertices through all its outgoing edges. This kind of operation is also the core of the design of graph database system.
+
+The uniqueness of graph database can be reflected in the following three aspects:
+
+### 2.1 Performance
+
+Handling the relationship between data, it is inevitable to use table JOIN operation in relational database, which has a great impact on performance. Graph database is a direct access, similar to pointer access, which is more efficient operation of associated data, compared with relational database performance improvement of 2 to 4 orders of magnitude.
+
+### 2.2 Compatibility
+
+In reality, the process of a project is often evolutionary. The content and even the format of the data are constantly changing. In a relational database, this means that a change in the table structure, or the creation of multiple new tables, significantly changes the source data. In the graph database, you simply add new vertices, edges, and attributes, and set them to the corresponding types. In essence, a table represents a type of data, and a vertex represents a specific data, meaning that relational databases pay more attention to the type of data, while graph databases pay more attention to the individuals of data and identify their association relationships.
+
+### 2.3 Intuitive
+
+Using graphs (or nets) to express real-world relationships is more straightforward and natural, especially in the Internet of Things era. If relational data used, a high degree of abstract thinking required to build a table of characters first, then a table of relations, and finally a map of data. When analyzing and querying the graph data, you can also intuitively find the desired data interactively through the point-edge connection topology, without any professional knowledge.
+
+## 3. Comparison between graph database and relational database
+
+| classification      | model           | advantage                                                            | disadvantage                                                                 | example        |
+| ------------------- | --------------- | -------------------------------------------------------------------- | ---------------------------------------------------------------------------- | -------------- |
+| Relational database | Table structure | Data is highly structured, consistent, and software maturity is high | The multi-hop association query is inefficient or not supported              | MySQL、Oracle  |
+| Graph database      | graph structure | Modeling and manipulating associations is very efficient             | Highly structured data processing is not as powerful as relational databases | Neo4j、TuGraph |
+
+In a word, in the face of massive data storage and processing problems, the traditional relational database has been unable to meet most of the daily data storage needs. Graph database technology can store relational information as entities and expand data model flexibly. Because it provides the most direct expression of related data, and the graph model is naturally tolerant to heterogeneous data. In the future, graph database technology will become one of the most popular technologies, which will provide powerful support for enterprises to store and analyze large-scale graph data.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..da6cbf6318
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,46 @@
+# What is TuGraph
+
+> This document mainly introduces the main features and characteristics of TuGraph Community Edition, as well as the differences between TuGraph Enterprise Edition and Community Edition.
+
+
+## 1.Introduction
+
+Graph database is a non-relational database that stores data by vertices and edges. It can be used to store complex data network models, such as social networks and transaction networks. TuGraph is a graph database developed by Ant Group. This manual introduces the functions and usage of TuGraph.
+
+## 2.TuGraph Community Edition
+
+The Community Edition is a fully functional version of TuGraph, suitable for single-instance deployment. It provides complete basic fuctions of graph database, such as ACID-compatible transactions, programming APIs, and associated tools. It is ideal for learning TuGraph and implementing small projects.
+
+## 3.TuGraph features
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property graph model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+## 4.TuGraph Enterprise Edition
+
+The Enterprise Edition has more comprehensive support for commercial features, including distributed cluster architecture, a one-stop graph platform covering exploration, research and development, service and operation and maintenance throughout the lifecycle, online, near-line, and offline graph computing engines, support for streaming and big data data sources, multi-site and multi-center deployment, making it an ideal choice for commercial solutions.
+
+```text
+    If you need to implement production-level high-availability cluster architecture, operation and maintenance and other enterprise-level services, please contact us to obtain commercial support:
+    Email:tugraph@service.alipay.com
+    Tel:0571-85022088,extension number 83789993#
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..e0e02c1750
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/4.schema.md
@@ -0,0 +1,160 @@
+# TuGraph schema  Instructions
+## 1.The data model
+
+### 1.1.Graph model
+TuGraph is a strong schema, directed property graph database with multi-graph capability.
+
+- Graph Project: Each database service can host multiple graph projects (multi-graphs), and each graph project can have its own access control configuration. The database administrator can create or delete specified graph projects.
+- Vertex: Refers to entity, generally used to express real-world entities, such as a movie or an actor.
+    - Primary Key: User-defined vertex data primary key, unique in the corresponding graph project and vertex type.
+    - VID: Refers to the auto-generated unique ID of the vertex, which cannot be modified by the user.
+    - Upper Limit: Each graph project can store up to 2^(40) vertex data.
+- Edge: Used to express the relationship between vertexs, such as an actor appears in a movie.
+    - Directed Edge: The edge is a directed edge. If you want to simulate an undirected edge, the user can create two edges with opposite directions.
+    - Duplicate Edge: TuGraph currently supports duplicate edges. If you want to ensure the uniqueness of the edge, you need to implement it through business policies.
+    - Upper Limit: Up to 2^(32) edge data can be stored between two vertex data.
+- Property Graph: vertexs and edges can have properties associated with them, and each property can have a different type.
+- Strong-typed: Each vertex and edge has only one label, and after creating a label, there is a cost to modify the number and type of attributes.
+    - Specify the starting/ending vertex type of the edge: You can limit the starting and ending vertex types of the edge, and support different vertex types of the starting and ending vertexs of the same type of edge, such as individuals transferring money to companies, companies transferring money to companies. After specifying the starting/ending vertex type of the edge, you can add multiple sets of starting/ending vertex types, but you cannot delete the restricted starting/ending vertex types.
+    - Unrestricted Mode: Supports creating edge data of this type between any two vertex types without specifying the starting and ending vertex types of the edge. Note: After specifying the starting/ending vertex type of the edge, the unrestricted mode cannot be used again.
+
+### 1.2.The data type
+
+TuGraph Supports a variety of data types that can be used as attributes, the specific supported data types are as follows:
+
+<caption>Table 1. TuGraph supported data types</caption>
+
+| **Type** | **Min**             | **Max**             | **Description**                                  |
+|----------|---------------------|---------------------|--------------------------------------------------|
+| BOOL     | false               | true                | Boolean                                          |
+| INT8     | -128                | 127                 | 8-bit int                                        |
+| INT16    | -32768              | 32767               | 16-bit int                                       |
+| INT32    | - 2^31              | 2^31 - 1            | 32-bit int                                       |
+| INT64    | - 2^63              | 2^63 - 1            | 64-bit int                                       |
+| DATE     | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" Date of format                      |
+| DATETIME | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD hh:mm:ss[.ffffff]"Format of the date and time |
+| FLOAT    |                     |                     | 32-bit float                                     |
+| DOUBLE   |                     |                     | 64-bit float                                     |
+| STRING   |                     |                     | A string of variable length                      |
+| BLOB     |                     |                     | Binary data                                      |
+| POINT    |                     |                     | EWKB format data of point                        |
+| LINESTRING |                   |                     | EWKB format data of linestring                   |
+| POLYGON  |                     |                     | EWKB format data of polygon                      |
+| FLOAT_VECTOR |                 |                     | The dynamic vector containing 32-bit float numbers |
+
+_BLOB data is BASE64 encoded in input and output_
+
+### 1.3.Index
+
+TuGraph supports indexing vertex fields.
+
+Indexes can be unique or non-unique. If a unique index is created for a vertex label, TuGraph will perform a data integrity check to ensure the uniqueness of the index before modifying the vertex of the label.
+
+Each index built on a single field of a label, and multiple fields can be indexed using the same label.
+
+BLOB fields cannot be indexed.
+
+TuGraph supports creating indexes on node or edge attributes to improve query efficiency. Its characteristics are as follows:
+- Indexes include single indexes and composite indexes. A single index is created based on a single property of a node or an edge, while a composite index is created based on multiple properties of a node or an edge (no more than 16). Indexes can be created on multiple sets of properties for the same node or edge.
+- If a unique index is created for a node label, when modifying a node for that label, a data integrity check is first performed to ensure the uniqueness of the index.
+- Attributes of type BLOB cannot be indexed.
+
+There are multiple index types for TuGraph's vertices and edges. Different index types have different functions and restrictions, as follows:
+
+#### 1.3.1 Single index
+#### 1.3.1.1 Node index
+##### 1.3.1.1.1 unique index
+
+The unique index of a node refers to a globally unique index. That is, if a unique index is set for an attribute, in the same graph, the attribute of nodes with the same label will not have the same value.
+The maximum length of a unique index key is 480 bytes. **Unique indexes cannot be created for attributes exceeding 480 bytes**.
+Primary is a special unique index, so the maximum key length is also 480 bytes.
+
+##### 1.3.1.1.2 non_unique index
+
+The non_unique index of a node refers to a non-global unique index, that is, if an attribute is set with a non_unique index,
+In the same graph, nodes with the same label can have the same value for this attribute.
+Since a key in a non_unique index may be mapped to multiple values, in order to speed up search and writing,
+The maximum value of a group of vids with the same index key is added after the user-specified key.
+Each vid is 5 bytes long, so the maximum length of a non_unique index key is 475 bytes.
+However, unlike unique indexes, non_unique indexes can also be established if they exceed 475 bytes.
+However, when indexing such an attribute, only **the first 475 bytes** will be intercepted as the index key (the value stored in the attribute itself will not be affected).
+Moreover, when traversing through an iterator, the first 475 bytes of the query value are automatically intercepted before traversing.
+Therefore, the results may be inconsistent with expectations and require users to filter again.
+
+#### 1.3.1.2 Edge index
+
+##### 1.3.1.2.1 unique index
+
+Similar to node, the unique index of an edge refers to a globally unique index. That is, if an attribute is set to a unique index, in the same graph, the attribute of the edge with the same label will not have the same value.
+The maximum length of a unique index key is 480 bytes. **Unique indexes cannot be created for attributes exceeding 480 bytes**.
+
+##### 1.3.1.2.2 pair_unique index
+
+pair_unique index refers to the unique index between two nodes, that is, if an attribute sets a unique index, between the same set of the starting node and the ending node in the same graph,
+Edges with the same label will not have the same value for this attribute. In order to ensure that the pair_unique index key does not repeat between the starting node and the end node of the same group,
+The index adds the starting and ending vids after the user-specified key. Each vid is 5 bytes in length.
+Therefore, the maximum key length is 470 bytes, and **a pair_unique index cannot be created for attributes exceeding 470 bytes**.
+
+##### 1.3.1.2.3 non_unique index
+
+Similar to node, the non_unique index of an edge refers to a non-global unique index, that is, if an attribute sets a non_unique index,
+In the same graph, edges with the same label can have the same value for this attribute.
+Since a key in a non_unique index may be mapped to multiple values, in order to speed up search and writing,
+The maximum value of a group of eids with the same index key is added after the user-specified key.
+Each eid is 24 bytes in length, so the maximum length of a non_unique index key is 456 bytes.
+However, unlike unique indexes, non_unique indexes can also be established if they exceed 456 bytes.
+However, when indexing such an attribute, only **the first 456 bytes** will be intercepted as the index key (the value stored in the attribute itself will not be affected).
+Moreover, when traversing through an iterator, the first 475 bytes of the query value are automatically intercepted before traversing.
+Therefore, the results may be inconsistent with expectations and require users to filter again.
+
+#### 1.3.2 Composite index
+
+Currently, composite indexes are only supported for multiple properties of a vertex, and not supported for properties of an edge. There are two types of composite indexes: unique indexes and non-unique indexes. The requirements for creating a composite index are as follows:
+1. The number of properties for creating a composite index should be between 2 and 16 (inclusive).
+2. For a unique composite index, the sum of the lengths of the properties cannot exceed 480 - 2 * (number of properties - 1) bytes, while for a non-unique composite index, it cannot exceed 475 - 2 * (number of properties - 1) bytes.
+
+##### 1.3.2.1 Unique index
+Similar to a vertex's single unique index, a vertex's composite unique index refers to a globally unique index, meaning that for a set of properties with a unique index, there will not be another vertex with the same label in the same graph that has the same value for that group of properties.
+Due to the underlying storage design, the composite index key needs to retain the length of the properties; therefore, the maximum length for a composite unique index key is 480 - 2 * (number of properties - 1) bytes. Properties exceeding this length cannot be indexed uniquely.
+
+##### 1.3.2.2 non_unique index
+Similar to a vertex's single non-unique index, a vertex's non-unique index refers to a non-globally unique index, meaning that for a set of properties with a non-unique index, different vertices with the same label in the same graph may have the same value for that group of properties.
+Since a non-unique index key may map to multiple values to accelerate lookups and writing, the maximum value from a group of vertex IDs (vid) has been appended to the user-specified key where the index keys are identical. Each vid is 5 bytes in length; thus, the maximum length for a non-unique index key is 475 - 2 * (number of properties - 1) bytes. Properties exceeding this length cannot be indexed non-uniquely.
+
+## 2. Graph Project, Vertex, Edge, and Attribute Naming Conventions and suggestions
+
+### 2.1 Naming Rules
+Graph projects, vertices, edges, and attributes are identifiers. This section describes the allowed syntax for identifiers in TuGraph.
+The table below describes the maximum length and allowed characters for each type of identifier.
+
+|**Identifier** |**Length** |**Allowed Characters**|
+|---------  |---------  |---------  |
+|User, role, graph project	|1-64 characters	|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+|Vertex type, edge type, attribute	|1-256 characters		|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+
+### 2.2 Usage Restrictions
+
+|**Description**|	**Maximum number**|
+|-------- |--------- |
+|Number of users, number of roles	|65536|
+|Number of graphs	|4096|
+|Number of vertex and edge types per graph	|4096|
+|Number of attributes per type	|1024|
+
+Note:
+1.Special characters and keywords: When using special characters or keywords, they need to be enclosed in backquotes (``) for reference;
+
+Example: ```match (`match`:match) return `match`.id limit 1```
+
+2.Case sensitivity: TuGraph is case-sensitive;
+
+3.Graph project, vertex/edge, and attribute names can be reused, but attribute names under the same vertex or edge cannot be duplicated;
+
+4.Reserved keywords for attribute names: SRC_ID / DST_ID / SKIP.
+
+### 2.3 Naming Suggestions
+|**Identifier**|**Description**|**Suggestions**|
+|-------|-------|--------|
+|Graph project	|Start with a letter or Chinese character	|Examples: graph123, project123, etc.|
+|Vertex/edge type	|Start with a letter or Chinese character and use underscores to separate words		|Examples: person, act_in, etc.|
+|Attribute	|Letters or Chinese characters	|Examples: name, age, etc.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..de894fa1b0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# Performance Oriented
+
+> This document mainly introduces TuGraph's performance-oriented design philosophy as an open-source graph database.
+
+## 1.Introduction
+
+TuGraph is currently the fastest graph database in the world, ranking first in the LDBC SNB Interactive graph database standard evaluation (March 2023). The design of TuGraph is based on performance optimization, and is committed to building a high-performance single-machine graph database. This document describes the core design of TuGraph's storage layer based on performance optimization.
+
+## 2.Characteristics of Graph Operations
+
+Operations on property graphs involve reading, writing, and their attributes, and the access patterns of some special attributes such as timestamps can also affect overall performance. Here, by summarizing the regularities of some graph operation characteristics, we can guide the final performance.
+
+We observe that many graph applications have similar data access patterns. For example, in credit risk control, we use recursive path filtering to search for many-to-one patterns to find suspicious credit fraud users and behaviors. For online gambling, we can identify gambling-related fund accounts by recognizing multiple fund transfers in a short period of time. The equity penetration scenario recursively calculates the equity relationship between entities. These scenarios have common patterns such as multi-hop entity and relationship access, time window constraints, and read/write transactions.
+Furthermore, from the discussion in the introduction and the analysis of graph workloads, the following characteristics can be summarized:
+
+**Characteristic 1** KHop is the most typical operation in a graph, based on the data access pattern of the graph topology of points and edges, and has essential differences from relational databases. The typicality of KHop is not only reflected in the different data access patterns, but it is also the performance point that graph databases need to pay attention to the most.
+
+**Characteristic 2** Data access of graph workloads has a certain degree of locality on the topology, and the edges of the same point are usually accessed simultaneously. When the labels of these edges are the same, there is a greater probability of simultaneous access.
+
+**Characteristic 3** When accessing points and edges in graph workloads, their corresponding attributes are usually accessed as a traversal filter condition.
+
+**Characteristic 4** In time-based graph workloads, filtering of points and edges is usually within a certain time range, such as the past week.
+
+**Characteristic 5** Write operations may be accompanied by a large number of read operations, which need to be processed in a single transaction cycle.
+
+Through the analysis of actual online graph applications, the read/write ratio of graph workloads is about 20:1, although the scenarios are limited to the financial field and the number of clusters is also limited, the scale of the data involved and the number of users are very large, which is representative to some extent. The 20:1 read/write ratio of graph workloads indicates that the impact of read workload on overall performance is greater, and the performance of write workload cannot be ignored either.
+
+## 3.Storage Data Structures
+
+TuGraph uses B+ trees as the underlying data structure to support real-time transactional operations for insertion, deletion, querying, and updating.
+
+In sorting tree data structures, B+ trees and LSM trees are the main representatives. B+ trees use a split and merge method to update sorted data in tree nodes, while LSM trees append updates to logs for delayed data merging. B+ trees were originally used in file system implementations, solving the problem of differences in performance between sequential and random operations on hard disks by storing data in adaptive-length leaf nodes, and have a relatively balanced read/write performance. The main advantage of LSM trees is to use WAL (Write Ahead Log) to perform updates, which turns update operations into sequential operations, especially in the case of small key-value pairs. WAL means that the update of data is deferred until it is merged in batches, which can improve the comprehensive efficiency of batch updates, but also makes the system scheduling more complicated. If the update merge is not completed, and the data is read again, LSM trees need to read several levels of locally merged logs, which will cause read amplification and space amplification, thereby affecting read efficiency.
+
+To sum up, B+ trees have better sequential read/write performance, while LSM trees have advantages in random write data. In addition, the way of LSM trees using background merging makes the performance fluctuation difficult to predict, and the correlation between performance fluctuation and upper-level storage and computation is weak, which increases the overall design cost. Considering the above factors, TuGraph chooses B+ trees as the implementation for read performance optimization.
+
+## 4.Data Encoding
+
+For property graph models, in addition to graph topology encoding, property data also greatly affects functionality and performance. We first discuss how property data can be encoded together with topology data. From current research, there are two ways of encoding properties: discrete encoding, which stores property data separately based on pointer indexes, and compact encoding, which packs property data and topology data together. Discrete encoding can store each property separately or pack each edge's properties separately, and the following discussion applies to both situations.
+
+Vertex Query: Property encoding mainly focuses on edges and does not involve vertex queries.
+
+Single-Edge Query: Discrete encoding locates edges through pointers, while compact encoding requires binary search to locate the edge position. Discrete encoding has a slight advantage.
+
+Edge Traversal: Discrete encoding requires constant random access through pointer jumps during edge traversal, while compact encoding arranges data together in advance, greatly improving efficiency due to its sequential access feature. Since edge traversal operations are common according to Rule 3, compact encoding has obvious advantages in edge traversal.
+
+Single-Edge Update: Discrete encoding only requires finding the corresponding pointer position and modifying the pointer's location before and after inserting data. Compact encoding needs to re-encode the compactly arranged data and rewrite the entire edge value, resulting in significant overhead compared to discrete encoding.
+
+Batch Edge Update: Batch updates can pre-build all edge properties for a vertex in memory and write them in one encoding, making both discrete encoding and compact encoding equivalent. However, compact encoding does not require storing pointer variables, so it has higher storage space efficiency.
+
+The performance issues of discrete encoding and compact encoding for a certain type of query discussed above can be alleviated through optimization. Overall, due to the 20:1 read-write load of graphs and the characteristics of property access revealed by Rule 3, TuGraph tends to use compact encoding to ensure read performance. Its main weakness is the overhead of re-encoding during single-edge updates, which can be solved using adaptive mapping technology.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3407932273
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,33 @@
+# Multi Level Interfaces
+
+> This document mainly introduces the design concept of TuGraph's multi-level interfaces.
+
+## 1.Introduction
+
+The multi-level interface is a balance between usability and high performance that TuGraph has designed to meet a variety of use cases. For example, Cypher, a declarative graph query language, can abstract away the implementation details of a graph database and express queries based on the graph model. However, Cypher's high-level descriptions cannot be efficiently translated into low-level execution, so TuGraph provides a procedural language, Procedure API, to achieve optimal database performance.
+
+Interfaces can be roughly divided into client interfaces and server interfaces. Most operations are performed on the server, and the client only does data encapsulation and parsing. The client and server are connected through a network, and TuGraph supports both flexible short-connection REST protocol and more efficient long-connection RPC protocol, which can be selected according to different business scenarios.
+
+The server interfaces are all at the calculation layer and are logically separated from the graph data storage by a Core API layer.
+
+![Multi Level Interfaces](../../../../images/multi-level-Interfaces-en.png)
+
+### 2.Client Interface
+
+The client interface refers to the interface executed on the client and is typically used for integration into software applications. TuGraph's client interface is relatively simple, including login/logout, data import/export, stored procedure loading and calling, and Cypher operations. Cypher integrates most of the functions, including data operations, graph model operations, operations and account management.
+
+Since the parameters and return values of Cypher are strings, JAVA OGM is a structured wrapper for Cypher, meaning that query results can be encapsulated into a typed object for ease of use.
+
+### 3.Server Interface
+
+The server interface includes Cypher, Procedure API, OLAP API, and GNN PI, which provide services for graph transaction engines, graph analysis engines, and graph neural network engines. The characteristics of each interface are explained in detail below.
+
+> __Cypher__ is an abstract description of query logic that is independent of execution logic and is more user-friendly for graph database applications, similar to the SQL language of relational databases. TuGraph's Cypher language mainly follows the OpenCypher query standard open-sourced by Neo4j and extends auxiliary functions such as operations and maintenance management. Descriptive graph query language will become the main data operation method for graph databases, but generating the optimal execution plan between description and execution still requires a long way to go in both academia and industry.
+
+> __Procedure API__ is designed to bridge the gap between descriptive graph query language and optimal performance. TuGraph's Procedure API provides a simple wrapper on top of the Core API, which maximizes the storage's performance efficiency and is the upper limit of Cypher optimization performance. Python Procedure API is a cross-language wrapper on top of C++ Procedure API, but the copying of values during translation may result in some performance loss, and its advantage lies mainly in the ease of use of the Python language. The traversal API is a parallel-executing Procedure interface that is more similar to set operations in terms of description, such as expanding all outgoing neighbors of a point set to obtain a new point set.
+
+> __OLAP API__ belongs to the category of "graph computing systems" and exports snapshots of graph data from storage that supports insert, update, delete, and query operations to support read-only complex graph analysis in a more compact data storage format. OLAP API encapsulates data structures that support high-concurrency execution, including Vector, Bitmap, and CSR-based graph snapshot data structures, and provides a set of concurrent fast point-edge operation frameworks. After the graph analysis task is completed, the data can be written back to the graph database through the interface.
+
+> __GNN API__ mainly provides the interfaces needed for graph neural network applications and can be integrated with machine learning frameworks such as PyTorch. TuGraph's GNN PI mainly integrates DGL and completes the entire process from graph storage to graph neural network application in the Python language environment.
+
+Except for Cypher's interpretive execution, all other server interfaces are compiled and executed, meaning that the corresponding code needs to be sent to the server and compiled (which may take some time) before execution on the server. Therefore, it is usually necessary to load the program first, then find it in the list of loaded applications, and execute it after passing in the input parameters.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..080cc02e48
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> This document mainly introduces the design philosophy of TuGraph's HTAP.
+
+## 1.Introduction
+
+![htap](../../../../images/htap-en.png)
+
+There are different ways to implement HTAP in architecture: one is to use two different copies to handle OLTP and OLAP tasks separately, with the core being data consistency synchronization and additional resource overhead; the other is to use the same data storage at all times, but this implementation has memory bloat in its data structure and needs further work for industrialization. In TuGraph's design, simple OLAP and OLTP operations share the same data, while complex OLAP operations are exported and handled separately as snapshots.
+
+## 2.Design
+
+In TuGraph, OLTP is the graph transaction engine, corresponding to transaction operations in Figure; OLAP is the graph analysis engine, corresponding to simple graph analysis operations (such as SPSP) and complex graph analysis operations (such as PageRank), the former of which can be executed directly on the graph storage, while the latter requires exporting a snapshot for execution.
+
+- Transaction operations, measured by the graph transaction engine, are local graph add, delete, query and modify operations, typically used for K-hop access.
+- Simple analysis operations are the simpler part of the graph analysis engine, usually local graph analysis operations, such as the shortest path algorithm SPSP and Jaccard algorithm.
+- Complex analysis operations are the more complex part of the graph analysis engine, usually involving multi-round data iteration operations across the entire graph, such as the PageRank algorithm for webpage ranking and the Louvain algorithm for community discovery.
+
+As shown in Figure , external storage is added to the architecture diagram, making the data source for graph analysis not limited to the graph database and can be directly read from text files.
+
+- Graph storage, which is the storage in the graph database, has carefully designed data structures that can perform real-time add, delete, query and modify operations.
+- External storage, which can be an RDBMS or text file, is stored in a simple way as an edge table, only for one-time batch reading and batch result writing. In the calculation layer, it corresponds to the interface in the overall architecture diagram.
+- Cypher, the declarative graph query language, can be executed concurrently.
+- Procedure API, the procedural graph query language, is flexible and can support both transaction operations and graph analysis operations, but its efficiency is not sufficient to complete complex graph analysis operations, and it can be executed concurrently.
+- OLAP API, for multi-round iteration of complex graph analysis. Applications need to first export the graph data in storage into a snapshot in memory, which is only used for fast access and does not need to consider the write support of ACID, so it can be arranged more compactly, and the read efficiency of CSR arrangement is much higher than that of graph storage data arrangement. OLAP API can only be executed serially, and each operation uses full CPU resources.
+
+OLAP API snapshots can be created from external storage, where the edge table data is formatted as CSR, or from the graph storage. It should be noted that OLAP API requires that the IDs of the vertices be consecutive natural numbers, which may require additional ID mapping. This step can be mapped to a specified attribute when creating a snapshot or directly using the attribute value as the ID.
+
+Corresponding to the calculation interface and storage, there are four operating modes.
+
+- Transaction mode, each operation corresponds to a Cypher statement, which is a transaction by default.
+- Plugin mode, call through plugins, after the calculation logic is loaded on the server, also known as stored procedures.
+- Embed mode, which has the same interface as Plugin mode but the graph database service does not need to be started and can directly call the data in the database through the interface. This mode is usually used for debugging Procedure API and OLAP API code, and the debugging information and operation steps are more friendly than Plugin mode.
+- Standalone mode, which maximally separates from the graph database, is more direct when only using the graph analysis engine for data analysis. Standalone mode will directly use the data of the external storage.
+
+The use of the graph neural network engine is similar to the 'complex graph analysis operation', which calls part of the OLAP API and GNN API at the same time, which is not elaborated here.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..b42c13eac8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Characteristics
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..198facd84b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# Architecture
+
+> This document mainly introduces the product architecture of TuGraph.
+
+## 1.Introduction
+
+![Architecture](../../../images/architecture-en.png)
+
+The following diagram shows the overall architecture of an enterprise-level graph database from the perspective of functional modules, using TuGraph as an example, from bottom to top:
+
+- Software and hardware environment. This involves the development and use environment of the graph database. TuGraph is mainly developed based on the underlying C++ language, and is compatible with most operating systems and CPUs on the market.
+- Storage layer, including the KV storage layer and the graph storage layer. The storage layer needs to support various functions required by the calculation layer.
+- Calculation layer. The calculation layer should include the graph transaction engine, graph analysis engine, and graph neural network engine. It also includes a variety of programming interfaces provided by the server, including descriptive query language Cypher, stored procedures, and so on.
+- Client. The client SDK should support multiple languages such as Java, Python, and C++, and also support command-line interaction. The Browser and Explorer reduce the threshold for using the graph database through web-based interaction.
+- In terms of ecological tools, it covers the development, operation, and management links of enterprise-level graph databases, improving usability.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..c8bc65a993
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/7.functionality.md
@@ -0,0 +1,99 @@
+# Functionality
+
+> This document mainly introduces the main functions and features of TuGraph.
+
+## 1.Installation
+
+## 1.1.Installation
+
+Deployment methods TuGraph currently provides three deployment methods: cloud deployment, Docker deployment, and local package deployment. Users can choose the appropriate deployment method according to their actual situation.
+
+## 1.2.Software and Hardware Environment
+
+TuGraph core is developed in C++, and the default compiler used is GCC8.4, using c++14 standard. Some functions use other compilers, such as ApacheLucene-based full-text indexing, which uses JNI interface and requires a Java compiler. In addition, the Python Procedure API is provided in the stored procedure, which requires a Python environment. TuGraph does not require special hardware such as GPUs, and can naturally adapt to general hardware upgrades such as RDMA and HBM with high latency and low bandwidth.
+
+TuGraph has been tested on CPUs based on X86 and ARM, including Intel, AMD, Kunpeng, Hygon, Feiteng, etc., and also runs on multiple operating systems, including mainstream versions of Ubuntu, CentOS, SUSE, Galaxy Kylin, Zhongbiao Kylin, and UOS, without special requirements for operating systems and CPUs.
+
+The software and hardware environment also includes the environment of dependent libraries. Since the default KV storage in TuGraph's storage layer is LMDB, the file system needs to support POSIX interfaces. The compilation and parameter configuration in different environments will be slightly different. For example, in the packaging of point-edge data in graph storage, it should match the page table size of the operating system, which is 4KB by default, and it is recommended to set the system's page table size to 4KB.
+
+## 2.Storage layer
+
+In the graph data model, TUGraph supports the attribute graph model, which can be divided into subgraphs, tags (including vertex tags and edge tags), and attributes according to the hierarchy.
+
+From the perspective of the storage layer, TuGraph uses an intuitive multi-layered tree model, without tags across subgraphs or attributes across tags, and only retains the core logic of the graph model. In terms of subgraph storage, TuGraph has performed data physical isolation for multiple graphs, and each graph corresponds to an instance of LMDB. The metadata description information of multiple graphs is saved in a special public LMDB instance called meta. The storage of vertex and edge tags and their attributes maps graph data adaptively to KV key-value pairs, maximizing read performance. At the same time, multi-threaded writing is implemented at the KV layer, solving the disadvantage of low write performance of LMDB. Primary key indexes and secondary indexes correspond to B+ tables in LMDB, supporting index value addition, deletion, query, and modification based on comparison.
+
+The storage layer also retains some other non-core functional data, including permission data, pre-compiled plugin data, and monitoring data.
+
+## 3.Calculation layer
+
+The calculation layer is divided into three parts in terms of function, including the TP-class graph transaction engine, the AP-class graph analysis engine, and the graph neural network engine.
+
+__The graph transaction engine__ is mainly used to process concurrent graph operations, including single-point queries, neighbor queries, and path traversal. The graph transaction engine focuses on ACID transactions of concurrent operations, ensuring that the operation logic will not interfere with each other. The main performance indicator is QPS, which is the number of completed queries per second.
+
+__The graph analysis engine__ usually operates as a full-graph iteration. Some simple analysis tasks (such as SPSP) can be completed by the graph transaction engine, and complex analysis tasks are completed by the graph analysis engine, which usually takes several seconds to several hours for a single task. Therefore, a single graph analysis task should use all hardware resources in parallel, and the performance indicator is the total time for completing the task.
+
+__The graph neural network engine__ usually operates as a full-graph iteration. In addition to graph topology-based operations, the graph neural network engine also needs to integrate a machine learning framework to handle vector operations, such as PyTorch, MXNet, and TenserFlow.
+
+The logic of the three engines is different and independently configured for resource pools. The graph transaction engine sets up a thread pool based on RPC operations. For each operation received from the client, a thread is taken from the pool to process it, and the number of concurrent executions is equal to the capacity of the RPC thread pool, which is usually configured as the number of server cores. The graph analysis engine has an analysis thread pool, and each graph analysis task is executed concurrently, that is, all threads are used to execute a task to speed up the performance of the operation. The serial execution feature of TuGraph graph analysis operations will restrict the user experience to a certain extent. The demand for concurrent graph analysis can be processed by deploying high-availability, increasing machine resources, or connecting to an external task scheduler to transfer data to a container for real-time scheduling and calculation. Graph neural network operations will reuse the resources of the graph transaction
+
+## 4.Core Features
+
+### 4.1.Query Language
+
+TuGraph provides Cypher graph query language that follows the OpenCypher standard.
+- Supports Procedure embedding.
+- Supports pluggable optimization frameworks with various optimization features.
+- Supports extensible security check framework for Cypher.
+
+### 4.2.Stored Procedures
+
+When users need to express complex query/update logic that Cypher cannot describe, or when high performance is required, TuGraph's stored procedures (Procedure) is a more concise and efficient choice than calling multiple REST requests and completing the entire processing flow on the client-side.
+
+### 4.3.Data Import/Export
+
+Although TuGraph supports data insertion, batch import can greatly improve efficiency. The import function can be divided into importing into an empty database (offline import) and incremental import. The former refers to importing when the subgraph is empty, and the additional assumption can greatly improve the import performance. In TuGraph, the throughput rate of empty database import and incremental import differs by 10 times. Data consistency needs to be considered in data export, which is based on exporting data based on a snapshot.
+
+TuGraph can perform data export on graph data already stored in TuGraph using the command-line tool `lgraph_export`. The export format supports CSV and JSON.
+
+### 4.4.Backup and Restore
+
+ TuGraph's backup function can be divided into active/scheduled, offline/online, and full/incremental backup. The goal is to complete the backup with the smallest storage and computing costs possible. The Restore function can restore to the latest state or a historical marked time point, ensuring that the database is in a consistent state.
+
+### 4.5 Data Warmup
+
+TuGraph is a disk-based graph database, and data is loaded into memory only when it is accessed. Therefore, system performance may deteriorate due to frequent IO operations in the first period after the server is opened. We can improve this problem by preheating the data in advance.
+
+### 4.6 High Availability Mode
+
+High availability means that by configuring a cluster, real-time multi-replica data hot backup can be achieved, and the cluster can still provide services when some replicas are not in use. TuGraph uses the multi-machine hot backup mechanism of the RAFT protocol, which can reduce RPO to near 0. Data synchronization is performed at the computation layer through RPC interfaces for write operations. The high availability cluster of TuGraph adopts a master-slave mode, where only the master node processes write requests, and both master and slave nodes can process read requests. The write request processing of the master node needs to be synchronized to more than half of the total nodes. The write request is considered complete when the majority of the nodes have written successfully.
+
+## 5.Client Tools
+
+Client Tools Client tools mainly include SDKs for various programming languages, OGM, and command-line tools.
+
+The client SDK is mainly used for secondary development and can be linked to the server through RPC or REST protocols. RPC has better performance based on long links, and data needs to be uniformly serialized through protobuf. TuGraph uses brpc, which supports rpc clients in Java, Python, and C++. REST's protocol is more flexible and can be easily adapted to more diverse environments, and different programming languages can easily connect. TuGraph provides a Python REST client instance, and command-line interaction is also implemented using REST.
+
+OGM (Object Graph Mapping) is a graph object mapping tool for TuGraph, which supports mapping JAVA objects (POJO) to TuGraph. Classes in JAVA are mapped to nodes in the graph, collections in classes are mapped to edges, and properties of classes are mapped to properties of graph objects. It also provides corresponding function to operate the graph database. Therefore, JAVA developers can easily use TuGraph database in a familiar ecosystem.
+
+The command-line tool `lgraph_cypher` is a query client that can be used to submit OpenCypher requests to the TuGraph server. `lgraph_cypher` client has two execution modes: single-command mode and interactive mode.
+
+
+## 6.Ecological Tools
+
+Ecological tools are a crucial component of enterprise-level databases, and a rich array of ecological tools can greatly enhance the usability and stability of graph databases.
+
+### 6.1.TuGraph DataX
+
+![Import&Export](../../../images/tugraph-datax.png)
+
+TuGraph's core supports importing and exporting CSV and JSON data, offering both full database and incremental importing modes. In practice, there may be a need to import from multiple data sources such as MySQL, Kafka, and Hive, and TuGraph connects to these sources using DataX. Due to the differences between relational and graph models, data cleaning processes can be quickly processed using SparkSQL. TuGraph focuses only on the reliability and performance of simple CSV and JSON scenario imports.
+
+### 6.2.Visual Interaction
+
+TuGraph Browser is a visual interface for direct users of graph databases, covering most of TuGraph's capabilities, including data import, graph model building, data addition/deletion/query/modify, and monitoring and maintenance operations.
+
+### 6.3.Monitoring
+
+TuGraph uses the Prometheus + Grafana monitoring framework in a loosely coupled manner. Prometheus obtains monitoring information from TuGraph's monitoring interface, stores it in a local time-series database, and then displays it interactively on the web using Grafana.
+
+The monitoring states provided by TuGraph include the state of the graph database and the state of the server. The former includes the database-side status such as read/write load and number of vertices/edges, while the latter includes the real-time status of the server's memory, CPU, and hard disk. If some monitoring state exceeds the expected threshold, proactive alerts are necessary, usually requiring integration with other operations and control systems such as group messaging and email alerts.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..9d5a7ac434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# Scenarios
+
+> This document mainly introduces the application scenarios of graph databases.
+
+## 1.Financial Industry
+
+The entities in the financial industry mainly involve people, companies, accounts, products, etc., and their relationships include transaction relationships, logging relationships, equity relationships, employment relationships, etc. These entities form a financial graph data network. By applying graph databases, we can discover a lot of useful information from the financial graph data network, which helps us make more accurate financial decisions.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Loan review|By analyzing the applicant's relationship and transaction history, etc., it is auxiliary to judge the applicant's repayment ability and willingness. It can be applied to retail loan review, small and micro loan review, supply chain finance, etc. This method can complement the traditional audit mechanism based on the applicant's own information, which is particularly useful for small and micro loan audits with low individual information coverage.|
+|Post-loan|By analyzing the borrower's transaction history, it assists in analyzing whether the borrower has default risk. Compared with the traditional method of issuing alerts only when loan funds flow to specific users, this method can assign a risk value to each account and issue warnings when the loan flows to high-risk accounts.|
+|Missing recovery|By analyzing the social and shopping data of missing borrowers, other contact methods can be found. This method can significantly improve the recovery rate of missing borrowers.|
+|Guarantor loop detection|Special guarantee structures such as cyclic, chain, family-style, and cross can be found in the guarantee relationship graph to expose potential risks. Compared with the JOIN method of a relational database, the solution based on graph algorithms is more efficient, can detect any length of guarantee loop, and can achieve more complex limited condition detection.|
+|Credit card fraud detection|A relationship network of addresses, contact information, etc. in credit card application information is constructed, and a community discovery algorithm is run in the application relationship network to detect suspected fraudulent gangs, thereby rejecting suspected fraudulent applications and reducing economic losses.|
+|Anti-money laundering|Suspected money laundering behaviors and links can be found through the transaction network and medium network. Money laundering is a complex process involving multiple parties. By conducting graph analysis in transaction and social networks, we can more accurately detect money laundering behaviors.|
+|Car insurance anti-fraud|For insurance fraud involving repair shops, by analyzing the relationship between the insured person, the case location, and the repair shop, fraudulent claims can be more accurately identified, reducing economic losses.|
+
+## 2.Industrial Industry
+
+A large amount of heterogeneous data will be generated in the production and manufacturing process, and how to effectively organize and manage these data is one of the most important issues in industrial big data. These data include design documents, equipment data, simulation plans and results, experimental results, experience documents, etc. The relationships between these data are complex, and traditional data management systems can only accumulate data, and they are often unable to search for related materials. Using graph models, these different types of data are organized into a network, which makes it easy to browse and search for data.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Supply chain management|Supply chain data mainly concerns the correspondence between products, components, and parts, the correspondence between parts and suppliers, and sensitive components in parts. Compared with the traditional BOM system, the solution using graph databases can more conveniently maintain complex networks of multiple component levels and multiple supplier levels, thereby providing basic support for a through supply chain.|
+|Document management|Using graph databases can organize different types of documents together organically according to different relationships. For example, design documents for components, component-part relationships, component test documents, relevant experience documents, etc. can be organized together so that all relevant information for the component can be obtained easily when needed.|
+|R&D process management|A large amount of simulation, experimentation, and testing needs to be performed in the product development and verification process. Each test process involves many different steps, the connection between the steps, the data versions used in each step, and the algorithm versions all make up a complicated relationship network. Using graph databases can better manage this relationship network, providing a good foundation for data reuse and process improvement in the R&D process.|
+|Equipment information management|Manufacturing requires the management of a large number of devices, which are interrelated (power supply, feeding, spatial relationship) to form a complex network. Traditional databases are difficult to reflect this complex relationship. Using graph databases can easily represent these relationships, thereby better managing equipment information.|
+
+## 3.Smart City
+
+With the development of technology, intelligent management of cities has become a major trend. Intelligent management requires a strong system software to support it, built on a good information management platform. In an intelligent city management system, an intelligent decision-making system needs to make decisions based on a large amount of different information, including various topology information (such as roads, pipelines, etc.), supply and demand information (such as electricity transmission, drinking water supply, sewage discharge, etc.), environmental information (such as temperature, humidity, rainfall, etc.), and so on. To manage these complex and heterogeneous data organically and make decisions based on them, a mature system is needed. Traditional data management systems based on relational data models are not suitable for managing such complex and heterogeneous data. Using a graph model can solve this problem well. If we manage these different data using a graph database, we can achieve many complex intelligent management scenarios.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Smart Traffic|Based on road topology, road capacity, and current traffic flow, intelligent traffic signal scheduling can be performed to improve traffic efficiency.|
+|Smart Drainage|Based on drainage system information and current rainfall, the drainage system can be scheduled to reduce the occurrence of waterlogging.|
+|Pipeline Management|Organizing the production, installation, topology information, and historical status information of pipelines can help us manage the pipelines throughout their lifecycle, including fault diagnosis, life assessment, etc.|
+|Crowd Evacuation|When a large number of people need to be evacuated, multiple transportation modes such as buses, subways, taxis, shared bicycles, etc., need to be considered, as well as the road carrying capacity. Using a graph database to organically integrate this information can help us make better decisions and provide better support for large public events.|
+
+## 4.Social Governance
+
+Social governance involves public safety, legal affairs, public opinion, network security, and more. Social governance is a comprehensive, multi-system linkage problem. It requires the synthesis of a large amount of data and global considerations to make better decisions. In this multidimensional and complex data problem, the graph data model can provide better adaptability and provide a solid foundation for intelligent social governance decision-making platforms.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Criminal Gang|Conspiratorial gangs will inevitably make contact through some means, including face-to-face meetings (appearing in the same place), phone calls, or internet contacts, and they may also have economic exchanges. If we store all of this data in a unified graph, we can use graph analysis algorithms to identify closely connected groups and then discover and identify the entire criminal gang.|
+|Stakeholder Case Investigation|Stakeholder cases, especially stakeholder economic cases, often involve a large number of personnel and elements (money, location, events, etc.). How to effectively organize this information to provide evidence for handling cases is a difficulty in stakeholder case investigation. Using graph databases to store and analyze this information can help us quickly locate the data, analyze the personnel structure, and provide better technical support for case investigation.|
+|Illegal Website Identification|Illegal websites, phishing websites, yellow websites, and so on, often use different domain names and IPs to avoid being blocked. The filter method based on a blacklist can only block known illegal websites and cannot effectively identify new domain names and IPs. Based on the IP-domain name network mapping relationship, we can create a graph and then use graph calculations to establish a "trustworthiness" model for domain names and IPs to determine whether a website belongs to an illegal website.|
+|Court File Management|Case files are often complex, and different cases may be linked through parties, locations, case nature, judges, and so on. These links constitute a complex network. Using a graph database, we can more conveniently manage these complex relationships and improve case handling and query efficiency.|
+
+## 5.Internet
+
+Social networks and person-product purchase relationships can all form a network. By analyzing this network data, we can provide users with better services, including relevant recommendations, user information collection, important user identification, and spam user identification, and so on.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|ID-Mapping|Graph databases can store all user-related information, including the relationships between users, in one database, and can also use these relationships to identify situations where one person has multiple accounts or multiple people share an account, thus providing decision support for future risk control, recommendations, and other businesses.|
+|Friend Recommendation|Based on the analysis of social networks, we can provide friend recommendations such as "friends of friends" and "common friends".|
+|Product Recommendation|Based on the user-product relationship graph, we can find users with similar interests and recommend other products that similar users have chosen.|
+|Spam User Identification|Traditional spam user identification is mainly based on user account information, such as registration information and posting information, but these types of information are relatively easy to forge. On the other hand, network-based information doesn't have this problem: it's difficult to forge. Therefore, spam user identification based on network information can be more accurate and efficient.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..6f2aa1629a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/9.glossary.md
@@ -0,0 +1,27 @@
+# Glossary
+
+## 1.Graph Technology
+
+> __Graph Computing__:Generalized graph computing, including graph databases, graph analysis, and graph learning; Narrowly defined graph computing only includes graph analysis. The generalized definition is used by default.
+
+> __Graph Database__:Focuses on operations such as adding, deleting, modifying, querying, and transaction processing for graph data, such as TuGraph DB.
+
+> __Graph Analysis__:Focuses on algorithmic analysis and pattern analysis of entire graph data, such as TuGraph Analytics.
+
+> __Graph Learning__:Refers to the same meaning as graph neural networks and graph machine learning, such as TuGraph Learn.
+
+> __Graph Intelligence__:Same as generalized graph computing, including graph databases, graph analysis, and graph learning. It is usually used for conceptual promotion and not for products.
+
+## 2.Specific Concepts
+
+> __Vertex__:Also known as node or point. Avoid using the term "node" as it is often used to refer to the number of servers and can be easily confused. "Node" refers to the meaning of combination, intersection, and crossing; "node" can refer to a milestone on a timeline (key node) or a processing entity in a computer system (such as a server in a computer network).
+
+> __Edge__:Refers to the connection between two vertices.
+
+> __Degree__:Refers to the number of incoming or outgoing edges on a vertex. Note that in non-graph theory scenarios, "hops" are often referred to as "degrees".
+
+> __Hop__:Refers to the number of vertices between two vertices on a path (excluding the starting point and including the endpoint). "K-Hop" in the algorithm performance test refers to this meaning.
+
+> __Vertex Label__:Refers to the type of a vertex, also known as a point label.
+
+> __Edge Label__:Refers to the type of an edge, also known as an edge label.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/index.rst
new file mode 100644
index 0000000000..076b7d0434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph DB Introduction
+=================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..390a685659
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/1.preparation.md
@@ -0,0 +1,90 @@
+# Quick Start
+
+> This document is intended for new users to get started quickly and contains an introduction, features, installation, and use of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property Graph Model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+### 1.1.Supported Platforms
+
+TuGraph supports both X86_64 and ARM64 architectures in physical, virtual, and containerized environments.
+
+### 1.2.Hardware requirements
+
+_You are advised to use NVMe SSDS with large memory configurations for optimal performance。_
+
+| Hardware | Minimum Configuration | Recommended configuration |
+|----------|-----------------------|---------------------------|
+| CPU      | X86_64                | Xeon E5 2670 v4           |
+| Memory   | 4GB                   | 256GB                     |
+| Disk     | 100GB                 | 1TB NVMe SSD              |
+| System   | Linux 2.6             | Ubuntu 18.04, CentOS 7.3  |
+
+## 2.Installation
+
+TuGraph can be installed quickly via Docker Image or locally via RPM /deb packages.In addition, TuGraph offers community edition services on Alibaba Cloud Computing Nest, which means you don't need to purchase your own cloud host to quickly deploy TuGraph services and achieve operational monitoring, thus building your own graph application.
+
+> Installation package/image download: refer to the TuGraph-Latest-Version section in [Download address](../1.guide.md).
+
+> Computing Nest Deployment: You can search for it on Alibaba Cloud Computing Nest, or you can quickly access it through [deployment link] (../5.developer-manual/1.installation/5.cloud-deployment.md).
+
+### 2.1.Fast experience through Docker
+
+1. The Docker environment installed locally
+
+   The docker official documentation：https://docs.docker.com/get-started/
+
+2. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. Start docker
+
+   ```shell
+    docker run -it -d -p 7001:7001 -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 8888:8888 -p 8889:8889 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000 is default http port，for tugraph-db-browser accessing.
+   # 7070 is default http port，for legacy tugraph-web accessing.
+   # 7687 is bolt port, for neo4j client accessing.
+   # 9090 is default RPC port，for RPC client accessing.
+   
+   # The default data directory is /var/lib/lgraph/data and the default log directory is /var/log/lgraph_log,
+   # which is configured in the tugraph configuration file at /usr/local/etc/lgraph.json inside the docker.
+   # This command mounts the data directory and log directory to /root/tugraph/ on the host for persistence,
+   # which you can modify according to your actual situation.
+   ```
+
+4. Open by browser
+
+Accessing tugraph-db-browser: `http://x.x.x.x:8000`. Default account is `admin` and default password is `73@TuGraph`.
+The page will be redirected to the password modification page for the first login. Please modify the password according to the page prompt.
+
+**Note**: 
+Access `http://x.x.x.x:7070` if you want to access legacy tugraph-web, with default account `admin` and default password `73@TuGraph`.
+But please note that legacy web is no longer maintained, it is recommended to use tugraph-db-browser.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..2ec92747d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# DEMO:Movie
+
+> This document mainly introduces the usage of the movie demo.
+
+## 1.Modeling and Data Import
+
+After logging in, click "Help", click "Quick Start", click "One-Click Model Creation", click "One-Click Data Creation", and complete the creation of the Movie Scene Graph.
+
+Movie：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| Label       | Type   | Description                                                                                           |
+|-------------|--------|-------------------------------------------------------------------------------------------------------|
+| movie       | Vertex | Represents a specific movie, such as "Forrest Gump".                                                  |
+| person      | Vertex | Represents a person, who may be an actor, director, or screenwriter for a movie.                      |
+| genre       | Vertex | Represents the genre of a movie, such as drama, horror.                                               |
+| keyword     | Vertex | Represents some keywords related to the movie, such as "save the world", "virtual reality", "subway". |
+| user        | Vertex | Represents a user who watches movies.                                                                 |
+| produce     | Edge   | Represents the relationship between the producer of a movie.                                          |
+| acted_in    | Edge   | Represents the relationship between actors and the movies they have appeared in.                      |
+| direct      | Edge   | Represents the relationship between a movie and its director.                                         |
+| write       | Edge   | Represents the screenwriting relationship of a movie.                                                 |
+| has_genre   | Edge   | Represents the genre classification of a movie.                                                       |
+| has_keyword | Edge   | Represents some keywords of a movie, which are more specific labels for classification.               |
+| rate        | Edge   | Represents the rating given by a user to a movie.                                                     |
+
+## 2.Query Examples
+
+### 2.1.Example One
+
+Query all actors of the movie 'Forrest Gump' and return the subgraph composed of the movie and the actors.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.Example Two
+
+Query all actors of the movie 'Forrest Gump' and list the roles they played in the movie.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.Example Three
+
+Query all movies rated below 3 by Michael.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.Example Four
+
+Query users who have the same dislike of movies as Michael, where the standard for dislike is a rating of less than three.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.Example Five
+
+Recommend movies to Michael by first finding users who dislike the same movies as Michael, and then filtering out the movies that these users like.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.Example Six
+
+Query the movies that Michael's friends like.
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.Example Seven
+
+By querying the movies that people who gave 'Forrest Gump' a high rating also like, recommend similar movies to users who like 'Forrest Gump'.
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..e07192fa2a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,48 @@
+# DEMO:Wandering Earth
+
+> This document mainly introduces the usage of the Wandering Earth demo.
+
+## 1.Demo Scene Design
+
+The demo is based on the story background of The Wandering Earth 1 and The Wandering Earth 2.
+
+- Based on the plot, a graph structure is designed, including three types of points: organization, character, celestial body, and facility, and two types of edges: event and relationship.
+- Prepared data corresponding to the schema based on the plot.
+- Prepared some queries to ask questions about the plot.
+
+## 2.Directory structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to queries.
+- control.sh: Script to control the start and stop of TuGraph Server.
+lgraph_standalone.json: Configuration file for starting TuGraph Server.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 4.Data Import
+
+- Modify DATA_PATH in import.json according to the data storage directory.
+- Refer to the load function in control.sh to load data.
+- Refer to the start function in control.sh to start TuGraph Server.
+- After starting TuGraph Server, access ${HOST_IP}:8888 to open the web page and confirm whether the data is successfully imported.
+
+## 5.Cypher Query
+
+Refer to the Cypher document and enter Cypher in the TuGraph web page frontend for queries.
+
+## 6.Usage Display
+
+### 6.1.Data Import Display
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.Query Display
+Query all event processes related to the crisis on Jupiter.
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+Query all event processes related to all crises.
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..64ea337fa8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# The Three Body
+
+> This document mainly introduces the usage of Three-Body demo.
+
+## 1.Demo Scenario Design
+The demo scenario is designed based on the story background of Three-Body 1, 2, and 3.
+
+According to the setting of the Three-Body story, we have designed 4 types of nodes and 6 types of edges. The nodes include "character", "organization", "plan", and "timeline", while the edges include "character-character relationship", "character-plan relationship", "character-organization relationship", "organization-plan relationship", and "organization-organization relationship". According to the plot, corresponding schema data and some queries have been prepared to propose some questions about the plot.
+
+## 2.Directory Structure
+
+- rawdata: Original plot data and schema definition files.
+- case.cypher: Cypher statements related to the query.
+- control.sh: Script to start and stop TuGraph Server.
+- lgraph_standalone.json: Configuration file for TuGraph Server startup.
+
+## 3.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+### 4.Data Import
+
+- Manual import
+    - Modify DATA_PATH in import.json according to the data storage directory.
+    - Refer to the load function in control.sh to load the data.
+    - Refer to the start function in control.sh to start the TuGraph service.
+    - After starting the TuGraph service, access ${HOST_IP}:8888 to open the web page and confirm whether the data is imported successfully.
+- Automatic creation
+    - Click `New Graph Project`, select Three-Body data, fill in the graph project configuration, and the system will automatically create the Three-Body scenario graph project.
+    - Alternatively, use the pre-installed Three-Body graph project provided by the product.
+
+### 5.Cypher Query
+
+Refer to the TuGraph documentation and enter Cypher in the TuGraph web page frontend to execute a query.
+
+## 6.Usage Demo
+
+### 6.1.Data Import Demo
+
+![data](../../../../images/three-body-data.png)
+
+### 7.Query Demo
+
+#### 7.1.Character Relationship Query
+In the plot of Three-Body 1, a large number of scientists committed suicide all over the world at the beginning, which aroused the attention of the police. During the investigation process, the truth behind it gradually surfaced step by step according to the clues of the character relationships, as shown in the above graph. Shi Qiang and Wang Miao discovered that most people had direct or indirect connections with Ye Wenjie, and sent Wang Miao undercover to finally discover Ye Wenjie's ultimate commander identity. As can be seen in the graph, there are many edge relationships (many one-degree or two-degree neighbors) around Ye Wenjie's vertex.
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.Neighbor Vertex Analysis
+There are many plans in Three-Body, and sometimes we may be confused. At this time, we can use the graph's neighbor vertex query to view the relevant characters and organizations of the plan. For example, in the "Wallfacer Project", we can see that there are four characters related to it, and these four are also the "Wallfacers" who are highly expected by the world.
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.Query Common Neighbors of Node A and B
+We often want to know who are the common related characters between two characters, so that we can quickly grasp the relationship between these two characters. In the case of large amounts of data, it is very convenient to use Cypher for graph relationship analysis!
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.Set/Change Properties
+As the plot progresses, we gradually learn about the various labels on "Ye Wenjie", so we can also update these labels to the "Ye Wenjie" node:
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.Add/Delete Nodes
+Later, we learned about characters such as Luo Ji and Cheng Xin, and organizations such as PIA and the Star Ring Group, and wanted to add them as nodes to the graph:
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..0bb359cbe0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# Three Kingdoms
+
+> This document mainly introduces the usage of the Three Kingdoms demo.
+
+## 1. Introduction
+Due to the lack of historical records, there are often many mysteries surrounding even well-known historical events. Taking the history of the Three Kingdoms as an example, why did Zhuge Liang come out of seclusion to help Liu Bei, and why there was a huge gap in achievements between Cao Cao and Liu Bei, both heroes of the time, are some of the unsolved mysteries. Historians in the past often used two-dimensional relationship analysis of history, and the conclusions drawn were often one-sided. Using TuGraph to import historical figures and events of the Three Kingdoms into a graph model, and analyzing them using graph calculation methods can help us obtain more valuable knowledge from limited information, which is a very meaningful interdisciplinary attempt.
+## 2. Data Modeling
+We designed 5 types of vertices and 5 types of edges. The vertices include "Lord", "Province", "Civilian", "Military Officer", and "Battle"; the edges include "Father", "Brother", "Belongs To", "Native Place", and "Participate In". The specific modeling information is shown below:
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. Data Import
+- Manual import
+    - To import data into TuGraph, you can use the lgraph_import tool to import it offline. The import command of lgraph_import is as follows:
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- Automatic creation
+    - Click `New Graph Project`, select the Three Kingdoms data, fill in the graph project configuration, and the system will automatically create the Three Kingdoms scene graph project.
+    - Or use the built-in Three Kingdoms graph project provided by the product directly.
+## 4. Cypher Query
+### 4.1. Why did Zhuge Liang Choose Liu Bei?
+The following Cypher command can be used to view the relationship between Zhuge Liang, Cao Cao, and Liu Bei:
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+From the graph, we can intuitively see that one of the shortest paths between Cao Cao and Zhuge Liang includes the battle of Xuzhou. Cao Cao once committed a massacre in Xuzhou because his father was killed, and nobody would choose a warlord who had previously massacred their hometown as their lord. In contrast, Liu Bei once prevented Cao Cao's violence during the battle of Xuzhou, which should be one of the reasons why Zhuge Liang had a good impression of Liu Bei.
+
+### 4.2. Why Did Cao Cao Achieve More Than Liu Bei?
+The following Cypher command can be used to view the family's support for Cao Cao's career:
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+The most important thing for pacifying the world is military talent. Cao Cao's father originally had the surname Xiahou, but was adopted into the Cao family. The Cao and Xiahou families were both local big clans in Qiao County, providing Cao Cao with a large number of military talents such as Xiahou Dun, Xiahou Yuan, Cao Ren, and Cao Hong in the early days of his career. In contrast, Liu Bei's father died early and he didn't have any family support. He only gathered his Five Tiger Generals when he was over 50 years old, by which time the best time to fight for land in the chaotic world had passed. Cao Cao had already controlled six of the nine provinces in the world.
+
+### 4.3. Why Did the Most Powerful Wei Kingdom in the Three Kingdoms Perish First?
+The following Cypher command can be used to view the important civilian officials of the Cao Cao group:
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+In fact, Cao Wei was overthrown in the Gao Ping Ling incident in 249 AD, after only 29 years of existence, which was shorter than Shu Han (43 years) and Dong Wu (51 years). The reason why the most powerful Wei Kingdom in the Three Kingdoms perished first was that the civilian official system of Cao Wei (the nine-rank system) made it easy for power to be concentrated in the hands of aristocratic families. From the graph, we can see that almost all the important civilian officials of Cao Cao and Cao Pi's generations were from aristocratic families, such as Xun Clan of Yingchuan, Zhong Clan of Yingchuan, Chen Clan of Yingchuan, Jia Clan of Wuxi, etc. There was even a trend of regionalization, centered on Yingchuan. Ultimately, the regime was usurped by the Sima family of Henei, which had close ties with the Xun Clan of Yingchuan.
+
+### 4.4. What Were the Strengths of Each of the Three Kingdoms?
+The following Cypher command can be used to view the population strength of each group in the Three Kingdoms:
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+The query result is shown in the following table:
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+In ancient society, an important indicator of a country's strength was its population. Since population data is missing, we estimate the population of each province using the birthplace data of all lords, civilians, and military officers in the Three Kingdoms. It is found that among the main characters of the Three Kingdoms, 60 belong to Wei, 23 belong to Wu, and only 2 belong to Shu, which proves that Wei was indeed the most powerful country in the Three Kingdoms.
+
+### 4.5. How Should Cao Cao's Military Ability Be Evaluated?
+The following Cypher command can be used to view the main battles that Cao Cao participated in:
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+From the graph, we can see that Cao Cao participated in 8 out of the 15 major battles in the Three Kingdoms, with a high participation rate. However, Cao Cao only won the battles of Xuzhou, Yanzhou, Guandu, and Xiangyang, while losing the battles of Hanzhong, Wancheng, the Campaign against Dong Zhuo and the Battle of Red Cliffs. His overall win rate was 50%, which proves that Cao Cao was not a very outstanding military strategist.
+
+## 5. Remarks
+More analysis is needed and encouraged to be added by everyone!
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..b2e7d4b257
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Demo:Round The World
+
+> This document mainly introduces the usage of the round-the-world demo.
+
+## Brief
+
+Based on the virtual background of "Around the World in 80 Days" and partial public historical flight data, it helps users design optimal flight plans for multiple cities.
+- Demo designed custom website service
+- The data source is a foreign open source website and does not include mainland city flight data
+- The flight prices in the data are simulated data and do not represent real prices.
+
+## Example
+
+### Login Page
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### Query Page
+
+Click on the login page to enter the query page.
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### Query Example
+
+Select no more than 8 cities from the city list in the lower left corner, click Query to return the recommended flight plan, and return the 10 path plans with the lowest cost and shortest flight time, provided that the interval between previous and later flights is 2-6 hours.
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+For detailed instructions, see the [manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "") document.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..106f943e05
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo example
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..b2ed78a618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+TuGraph DB Quick Start
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..6900158788
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,685 @@
+# TuGraph Browser
+
+> This document focuses on the use of TuGraph Browser.
+
+## 1.Introduction
+
+TuGraph Browser (hereinafter referred to as Browser) is a powerful product visualization development tool that presents graph data in an intuitive visual way, allowing users to easily manage, maintain, and view the database running status. This tool not only supports graph data management and visualization but also supports system account management, providing users with a comprehensive operation and management experience, enabling users to manage and utilize graph databases more efficiently.
+
+## 2.User Guide
+
+### 2.1.Accessing
+
+After the user completes the installation of the graph database, they can access the Browser through a browser. Users only need to enter the IP:Port of the server where TuGraph is located in the browser address bar. The default port used is 8000.
+
+- For example:127.0.0.1:8000
+- Recommend using Chrome
+
+#### 2.1.1. Startup configuration
+
+Before starting Browser, you need to start TuGraph-Server in advance and configure the connection between Browser and TuGraph-Server. The configuration file is the env.json file in the Browser directory. The specific configuration is as follows
+```shell
+# vim /usr/local/share/lgraph/tugraph-db-browser/env.json
+{
+   "tugraph_db_host": "http://127.0.0.1:9090"
+}
+```
+Tugraph_db_host needs to be modified to the address of the actual TuGraph-Server RPC service
+
+#### 2.1.2.Startup method
+There are two ways to start Browser. One is to directly switch to the directory where Browser is located in the docker image and execute the startup command.
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run dev
+```
+The other is to use the rpm/deb installation package in the local environment. In this case, it needs to be built first and then started. Therefore, the Node environment needs to be installed locally in advance. For details, see the source code directory.
+ci/images/tugraph-runtime-*-Dockerfile. When installing TuGraph locally,
+Browser will be installed to the specified local directory, switch to the directory, and execute the following command to build and start
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run bootstrap
+pnpm run dev
+```
+
+### 2.2.Logging in
+
+![login](../../../images/browser/login.png)
+
+- After successfully accessing the Browser, the login page appears first (as shown above), where users need to fill in their account and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- After the user's first login, they will be redirected to the password modification page. Once the password is successfully modified, they can only use the new password to log in.
+
+### 2.3.Quick Start
+
+For first-time users of TuGraph, you can quickly build a graph project with the built-in demo data and get started with graph data projects quickly.
+
+#### 2.3.1.Creating a Graph Project
+
+In the `Graph Project` homepage tab, click `Create New Graph Project` to create a new graph project.
+
+![quickstart-creategraph](../../../images/browser/quickstart-creategraph.png)
+
+Select a built-in demo data, and click the `Next` button.
+
+![quickstart-selectdemo](../../../images/browser/quickstart-selectdemo.png)
+
+In the Fill in Configurations interface, enter the graph project information. Since the demo data is relatively small in size, set the Maximum Storage Space to 1 GB. After entering the graph project information, click the Create button, and the system will automatically create the graph model of the demo data and import the graph data.
+
+![quickstart-configure](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.Starting a Graph Project
+
+After creating a graph project with demo data, you can find the corresponding graph project in the `Graph Project` tab, and then click `Graph Query` to query graph data.
+
+![quickstart-graphtab](../../../images/browser/quickstart-graphtab.png)
+
+Execute the default query statement to browse the graph data in the demo.
+
+![quickstart-result](../../../images/browser/quickstart-result.png)
+
+For more quick start documents, please visit the[Quick Start Documents](../3.quick-start/1.preparation.md)
+
+### 2.4.Graph Project
+
+`Graph Project` provides visualized graph project management and graph data development functions, providing users with a series of convenient graph data visualization operations, including graph project creation, modification, deletion, and other management operations, as well as graph data queries, vertex-edge statistics, and other operations. In addition, it also supports graph model management, making it more convenient for users to manage and maintain graph data.
+
+#### 2.4.1.Graph Project Management
+
+On the `Graph Project` page, you can see the graph projects in the current graph database.
+
+![graphmanagement-homepage](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.Creating a Graph Project
+
+On the `Graph Project` page, click the `Create New Graph Project` button to create a new graph project.
+
+![graphmanagement-creategraph](../../../images/browser/graphmanagement-creategraph.png)
+
+Creating a new graph project requires completing the creation of the graph project through two pages: `Select Template` and `Fill in Configurations`.
+
+- __Select Template__: The product provides two types of templates: empty templates and demo templates.
+    - Empty templates: A brand new graph project where users need to create their own graph model and import graph data, generally used for formal project development.
+    - Demo templates: Built-in demo data in the product. After the graph project is created successfully, the system will automatically create a demo graph model and import demo graph data, usually used for trial and learning.
+
+![graphmanagement-selecttemplate](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __Fill in Configurations__: Users need to fill in basic information about the graph project and click the `Create` button to create the graph project.
+    - Graph Name: The name of the new graph project, which is also the unique primary key of the graph project. Supports Chinese characters, letters, numbers, and underscores, but does not support spaces or other special characters.
+    - Graph Description: The description of the new graph project can be used to describe the background and objectives of the project in detail.
+    - Advanced Configuration - Maximum Storage Space: Set the maximum storage space that the graph project can occupy. It does not actually occupy physical storage space in advance. After the actual data volume reaches the maximum storage space threshold, no more data can be written.
+
+![graphmanagement-configure](../../../images/browser/graphmanagement-configure.png)
+
+After creation, the graph project can be viewed in the graph project tab on the `Graph Project` page.
+
+##### 2.4.1.2.Editing a Graph Project
+
+On the `Graph Project` page, click the `Edit button` (pencil icon) in the graph project tab to edit the basic information of the corresponding graph project.
+
+![graphmanagement-editgraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+graphmanagement-editgraph-button
+
+![graphmanagement-editgraph](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.Deleting a Graph Project
+
+On the `Graph Project` page, click the `Delete` button (trash can icon) in the graph project tab to delete the corresponding graph project.
+
+![graphmanagement-deletegraph-button](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_Note: Graph projects cannot be restored after deletion._
+
+##### 2.4.1.4.Vertex-Edge Statistics
+
+On the `Graph Project` page, click the `Vertex-Edge Statistics` button (line graph icon or refresh icon) in the graph project tab to count the number of vertexs and edges in the corresponding graph project.
+
+![graphmanagement-statistics-button](../../../images/browser/graphmanagement-statistics-button.png)
+
+The statistical results will be displayed on the graph project tab. Graph projects that have not been vertex-edge statistics will display `No vertex-edge data`, and graph projects that have already been vertex-edge statistics need to click the `Refresh` button to count again.
+
+![graphmanagement-statistics](../../../images/browser/graphmanagement-statistics.png)
+
+![graphmanagement-statistics-refresh-button](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.Graph Building
+
+The `Graph Building` function in Browser is mainly used for graph project model definition and data import. On the `Graph Project` page, click the `Graph Building` button in the graph project tab.
+
+![graphbuild-button](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.Model Definition
+
+Browser provides a visualization way to create and maintain graph models.
+
+- Graph models can also be created and maintained through the `Cypher` tool and the `lgraph_import` tool. For details, please refer to the [Cypher API Document](../8.query/1.cypher.md) and [Data Import Document](../6.utility-tools/1.data-import.md).
+
+###### a.Browse Graph Models
+
+On the `Model Definition` page, you can view detailed graph model settings, support list and canvas view of the graph model, support list display of vertex type properties and indexes, edge type properties and start/end vertex types.
+
+![graphbuild](../../../images/browser/graphbuild.png)
+
+- Supports list view of vertex types and edge types.
+    - Supports the display of the number of vertexs or edges in the corresponding vertex type or edge type in the vertex type or edge type tab.
+    - Supports keyword search for vertex type or edge type names. Enter the keyword in the `search box` to display the corresponding vertexs or edges.
+
+        ![graphbuild-list-search](../../../images/browser/graphbuild-list-search.png)
+    - Supports copying vertex type or edge type names. Click the `Copy` button to copy the name of the vertex or edge to the clipboard.
+
+        ![graphbuild-list-copy](../../../images/browser/graphbuild-list-copy.png)
+    - Supports deleting vertex types or edge types. Click the `Delete` button to delete the corresponding vertex or edge.
+
+        ![graphbuild-list-delete](../../../images/browser/graphbuild-list-delete.png)
+- Supports canvas view of vertex types and edge types.
+- Clicking the corresponding vertex type or edge type in the list or canvas can display the model details.
+        ![graphbuild-select](../../../images/browser/graphbuild-select.png)
+
+###### b.Add Vertex
+
+Click the `Add Vertex` button on the `Model Definition` page to add a vertex type in the right sliding window.
+
+![graphbuild-addvertex-button](../../../images/browser/graphbuild-addvertex-button.png)
+
+The user needs to enter the Vertex type name, properties, and indexes, and click the `Complete` button to complete the creation of the Vertex type.
+- Vertex Type Name: The name of the Vertex, which is also the unique identifier of the Vertex.
+- Properties: The attributes of the Vertex, and one attribute needs to be used as the primary key.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating Vertexs.
+- Indexes: The indexing attributes of the Vertex, you need to create attributes first and then set the attribute as an index.
+    - Attribute: The attribute that needs to be indexed.
+    - Unique:Set the attribute field as a unique value.
+    - Primary Key: Whether the corresponding attribute is a primary key. The Unique option must be `Yes` after selecting `Yes`.
+    - Delete: Indexes can be deleted arbitrarily during Vertex creation.
+
+![graphbuild-addvertex](../../../images/browser/graphbuild-addvertex.png)
+
+- Edit Vertex: You can add Vertex properties, modify the data type of existing properties, and add or delete indexes. You need to click the `Save` button for each newly added or modified attribute to take effect.
+_Note: Once the primary key field attribute is created, it cannot be modified._
+
+![graphbuild-editvertex](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.Add Edges
+
+Click the `Add Edge` button on the `Model Definition` page to add an edge type in the right sliding window.
+
+![graphbuild-addedge-button](../../../images/browser/graphbuild-addedge-button.png)
+
+The user needs to enter the edge type name, properties, select the start vertex type and end vertex type, and click the `Complete` button to complete the creation of the edge type.
+- Edge Type Name: The name of the edge, which is also the unique identifier of the edge.
+- Properties: The attributes of the edge, which may not exist on the edge.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating edges.
+- Selecting start vertex type and end vertex type: Set the start vertex type and end vertex type of the edge, and support multiple start vertex types and end vertex types.
+    - Start vertex: Select the vertex type of the start vertex.
+    - End vertex: Select the vertex type of the end vertex.
+    - At least one vertex type needs to be created in advance to set the start vertex type and end vertex of the edge.
+    - If not selected, it means that the start vertex and end vertex can be any vertex type, and the corresponding edge is not displayed on the canvas, and you need to view the edge type in the left list.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+- Edit Edge: You can add edge properties and modify the data type of existing properties. You need to click the `Save` button for each newly added or modified attribute to take effect.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+###### d.Import Model
+
+Click the `Import Model` button on the `Model Definition` page to upload a model file and quickly create a model.
+
+![graphbuild-importmodel-button](../../../images/browser/graphbuild-importmodel-button.png)
+
+Click the `Upload File` button on the `Import Model` page to upload the model file. After the upload is successful, click `OK` to import the graph model.
+
+- Overwrite the current canvas model: If this option is selected, the existing graph model will be cleared before importing the graph model in the model file; if not selected, the vertex types and edge types in the model file will be imported, but the existing vertex types and edge types will not be modified.
+
+![graphbuild-importmodel](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.Export Model
+
+Click the `Export Model` button on the `Model Definition` page to export the graph model in the current graph project to a JSON file.
+
+![graphbuild-exportmodel-button](../../../images/browser/graphbuild-exportmodel-button.png)
+
+The model file is in JSON format and is not recommended to be manually modified.
+
+![graphbuild-exportmodel](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.Data Import
+
+After completing the `Model Definition`, click the `Next` button to enter the data import page.
+
+###### a.Data Preparation
+
+Data needs to be prepared in advance before importing data. The current browser supports the uploading of CSV files, and the data file suffix needs to be ensured to be CSV.
+- The header is not mandatory.
+- Text qualifiers are supported, and the text qualifier is double quotes. Data Import - CSV
+
+![graphbuild-import-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.Upload Files
+
+Upload the required data files on the `Data Import` page and import the data into the graph project.
+
+![graphbuild-import](../../../images/browser/graphbuild-import.png)
+
+- Separator: The column separator of the data file.
+- File upload: Supports uploading multiple files.
+    - Supports selecting multiple upload files in the pop-up window.
+    - Supports dragging and dropping files to upload on the page.
+    - Supports uploading vertex files and edge files at the same time.
+
+###### c.Data Mapping
+
+After the file is successfully uploaded, you need to set the `Data Corresponding Table` on the `Data Import` page to establish a mapping relationship between the data columns in the data file and the target vertexs/edges and corresponding attributes.
+
+- Data Corresponding Table: Displays uploaded data problems.
+    - File Name: The name of the uploaded data file.
+    - File Size: The size of the uploaded data file.
+    - Read Result: The result of uploading the data file, success means uploaded successfully.
+    - Delete: Delete on the page, the local file will not be deleted.
+- Data File Mapping: Each uploaded data file needs to configure a mapping relationship.
+    - Label: Select the corresponding vertex or edge type for the file, and you can only select one type of vertex or one type of edge.
+    - Starting from the Nth row: Start reading data from the Nth row. The system defaults to start reading data from the 0th row. To skip the header, you can enter 1.
+    - Attribute Mapping: Select the attribute field corresponding to the data column from the drop-down list.
+    - Data Preview: The system will pre-read the first 5 rows of the data file.
+
+![graphbuild-import-datamapping](../../../images/browser/graphbuild-import-datamapping.png)
+
+After the file is successfully uploaded, you can click the `Continue Import` button to continue importing other data or click the `Go to Graph Query` button to query the imported data on the `Graph Query` page.
+
+![graphbuild-import-success](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.Graph Query
+
+Click the `Graph Query` button in the `graph project tab` on the `Graph Project` page to query and access graph data in the graph project. The product provides multiple modes for querying graph data, such as Statement Query, Path Query, and Vertex Query, and supports switching between graph projects and query result display.
+
+![query-button](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.Switch Graph Project
+
+The `Graph Query` function can only access one graph project data. Users can select and switch to other graph data in the `Switch Graph Project drop-down list`.
+
+![query-selectgraph](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.Statement Query
+
+The Browser provides a visual way to develop and debug graph query statements. Users can enter graph query statements, execute and return results, and support collecting statements and viewing graph models.
+
+![query-view](../../../images/browser/query-view.png)
+
+###### a.Statement Query Window
+
+Users enter graph query statements in the `Statement Query Window`, click the `Execute` button to run the corresponding statement, and display the result in the `Execution Result tab`.
+
+- Switch Query Language: Provides switching between different graph query language modes.
+    - _Currently only supports Cypher syntax._
+
+![query-selectgql](../../../images/browser/query-selectgql.png)
+
+- Statement Query Window: Provides syntax prompts for the current query language.
+
+![query-gqltips](../../../images/browser/query-gqltips.png)
+
+- Execute: Click the `Execute` button to send the entered query statement to the background for execution.
+
+![query-execute-button](../../../images/browser/query-execute-button.png)
+
+- Bookmark: Click the `Bookmark` button to save the content of the current statement query window as a template for future use.
+
+![query-bookmark-button](../../../images/browser/query-bookmark-button.png)
+
+- Download: Click the `Download` button to save the content of the current statement query window as a text file and download it to the local computer for future use.
+
+![query-download-button](../../../images/browser/query-download-button.png)
+
+For detailed Cypher usage guidelines, please refer to the document: [Cypher API](../8.query/1.cypher.md)
+
+###### b.Bookmark List
+
+Displays the collected query statements in a list, and clicking on a bookmark in the list allows using the statement. Supports keyword search, name modification, and deletion.
+
+![query-bookmark](../../../images/browser/query-bookmark.png)
+
+###### c.View Graph Model
+
+The Browser provides a graph model query for the current graph project, which allows users to query vertex types and edge types conveniently. It supports both list display and canvas graph display, and can be hidden.
+
+![query-schema-list](../../../images/browser/query-schema-list.png)
+![query-schema-graph](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.Path Query
+
+The Browser provides `Path Query templates`. Users can search whether corresponding paths exist in the graph data of the graph project by selecting paths.
+
+![pathquery-result](../../../images/browser/pathquery-result.png)
+
+- Path: Select the path to search in the path selection drop-down list.
+    - Select a Path: Based on the definition of the graph model, the system will automatically match the corresponding first-degree relationship path. Clicking the path drop-down box again will automatically match the next-degree relationship path based on the endvertex vertex type of the path.
+![pathquery-select](../../../images/browser/pathquery-select.png)
+    - Execute: Click the `Execute` button to return the matched paths in the graph project.
+    - Advanced Configuration: Set the number of paths to scan. The default is 100 paths.
+![pathquery-configuration](../../../images/browser/pathquery-configuration.png)
+
+_Note: The edges in the graph model need to set the starting vertex and endvertex. If no edge in the graph project has set the starting vertex and endvertex, the drop-down list will have no results._
+
+##### 2.4.3.4.Vertex Query
+
+The Browser provides `Vertex Query templates`. Users can query vertex data in the graph project by selecting vertex attributes.
+
+![vertexquery](../../../images/browser/vertexquery.png)
+
+- Select Vertex: Select the vertex type to be queried.
+    - Attribute: The system will automatically match the schema of the vertex type, set the corresponding query conditions, and click the execute button to return the results.
+- Return vertex Limit: Set the upper limit of the returned vertex data.
+
+![vertexquery-criteria](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.Execution Result Tab
+
+The Browser provides multiple ways to display graph query results, such as JSON view, JSON text, vertex-edge list, and vertex-edge view. It supports result download, data insertion, and full-screen display.
+
+###### a.JSON View
+
+The Browser provides JSON view to display query results.
+
+![query-result-jsonview](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON Text
+
+![query-result-jsontxt](../../../images/browser/query-result-jsontxt.png)
+
+###### c.Vertex-Edge List
+
+The Browser provides vertex and edge list to display query results.
+
+![query-result-list](../../../images/browser/query-result-list.png)
+
+###### d.Vertex-Edge View
+
+The Browser provides canvas view to display query results.
+
+![query-result-graph](../../../images/browser/query-result-graph.png)
+
+###### e.Data Insertion
+
+The Browser provides a visual way to insert vertex or edge data in the corresponding graph project. Click the `Insert Data` button, select the Vertex Type or Edge Type on the Insert Data tab, enter the attribute values, and click `OK` to complete the data insertion.
+
+![query-result-insert-button](../../../images/browser/query-result-insert-button.png)
+
+![query-result-insert](../../../images/browser/query-result-insert.png)
+
+###### f.Download Execution Result
+
+The Browser provides a function to export graph query results as text files. Click the `Download Execution Result` button, and the system will automatically save the result as a text file and download it to the local computer.
+
+![query-result-download](../../../images/browser/query-result-download.png)
+![query-result-downloadtxt](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.Full-Screen Display
+
+The Browser provides full-screen display for graph query results. Click the `Full-Screen` Display button to display the results in full screen, and click the `Exit Full Screen` button to exit full-screen display.
+
+![query-result-fullscreen-button](../../../images/browser/query-result-fullscreen-button.png)
+![query-result-fullscreen](../../../images/browser/query-result-fullscreen.png)
+![query-result-fullscreen-close](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.Graph Analysis
+
+Click the `Graph Analysis` button in the `Graph Project` tab in the `Graph Project` interface to display and analyze graph data on the canvas. The product provides `Query by Statement` and `Query by Configuration` to query and load data from the graph project to the canvas. It supports filtering, layout adjustment, and canvas operations on the canvas data.
+
+![graphanalysis-button](../../../images/browser/graphanalysis-button.png)
+
+As shown in the figure below, the graph analysis function mainly includes: 1. Operation bar: the main operation functions of graph analysis, including view switching, query filtering, layout style, and canvas operations; 2. Left sidebar: query, filter, and appearance operation area; 3. Canvas area: the area for displaying graph data, displaying vertex and edge data, supporting vertex expansion query, collapsing vertexs, fixing vertexs, deleting vertexs, and providing canvas graph data statistics; 4. Right sidebar: when a vertex or edge data is selected, the corresponding attribute information will be displayed; 5. Switch graph project: switch to different graph projects for analysis.
+
+![graphanalysis-operation-area](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.Query by Statement
+
+In the `Query by Statement` function, users can enter query statements to query graph data and load the data to the canvas area for display.
+- Syntax Description: TuGraph's query language and syntax documentation.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-query](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.Query by Configuration
+
+In the `Query by Configuration` function, users can select vertex types and enter attribute conditions to query graph data and load the data to the canvas area for display.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-configurequery](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.Canvas Analysis
+
+In the `Canvas Analysis` function, users can perform operations and analysis on the vertex or edge data on the canvas, including: expanding queries by selecting vertexs, collapsing/expanding vertexs, fixing vertexs, clearing the canvas, lassoing, vertex/edge retrieval, and canvas legend. The most basic operation on the canvas is dragging vertex data. By selecting a vertex with the left mouse button and moving the mouse, the position of the vertex data can be changed.
+
+###### a.Expand Query
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, move the mouse to `Expand Query`, and a secondary window will pop up. Click on the corresponding expansion degree to perform the query.
+- First-degree Query: Bidirectional expansion of first-degree relationships.
+- Second-degree Query: Bidirectional expansion of second-degree relationships.
+- Third-degree Query: Bidirectional expansion of third-degree relationships.
+- Custom Query: Expand based on selected conditions.
+    - Edge Direction: Set the direction of the expansion relationship, Bidirectional: includes outgoing edges and incoming edges, Outgoing: edges pointing outward from the selected starting vertex, Incoming: edges pointing to the selected starting vertex.
+    - Degree of Diffusion: The degree of expansion.
+    - Custom Return vertex Count: Configure the number of vertexs returned to the front end, default is 100, to prevent exceptions on the front end caused by super vertexs.
+    - Add Filter Group: Set the relationship type and attribute conditions of the expansion, multiple relationship types can be set.
+
+![graphanalysis-canvas-expand-before](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![graphanalysis-canvas-expand-after](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![graphanalysis-canvas-expand-custom](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.Collapse/Expand Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Collapse Vertexs` to hide the first-degree relationship Vertexs of the selected Vertexs; right-click on the collapsed Vertex data again to perform Expand Vertexs operation to show the hidden first-degree relationship Vertexs.
+
+![graphanalysis-canvas-collapse](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![graphanalysis-canvas-expand](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.Fix Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Fix vertexs` to fix the selected vertexs in place. The fixed vertexs cannot be moved (including layout adjustment); right-click on the fixed vertex data again to perform `Unfix vertexs` operation to restore the normal operation of the selected.
+
+![graphanalysis-canvas-fixed](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![graphanalysis-canvas-unfix](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.Delete Vertex
+
+Right-click on a vertex in the `Canvas` area to open the operation window. Click on `Delete Vertex` to remove the selected vertex from the canvas.
+
+![graphanalysis-canvas-delete](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.Clear Canvas
+
+Click on the `Clear Canvas` button in the `Toolbar` area to clear all data on the canvas.
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.Vertex/Edge Retrieval
+
+Select a vertex or edge in the `Vertex/Edge Retrieval` window and enter a keyword to perform a fuzzy search for attribute data on the canvas. After the search, you can locate the data position.
+
+![graphanalysis-canvas-retrieval](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.Canvas Legend
+
+In the legend area of the `Canvas` area, the vertex types in the canvas will be displayed. Click on a vertex type to select the corresponding vertex data. Click on the "More" button to display the statistics, which can be displayed in a list or chart format to show the number of vertexs or edges.
+
+![graphanalysis-canvas-legend-list](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![graphanalysis-canvas-legend-chart](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.Attribute Filter
+
+Click on the `Filter` button in the `Toolbar` area, and click on `Attribute Filter` in the `Sidebar` to perform filter and filtering. Users can select the vertex or edge types to be filtered, and set the corresponding attribute values. After retrieving the filtered group conditions, the corresponding vertex or edge data will be highlighted on the canvas.
+- Please select the vertex/edge type: Select the vertex type or edge type to be searched.
+- Attribute condition: Set the attribute conditions to be searched. Multiple groups can be set to take the union of the filtering results.
+- Add filter group: Multiple filter conditions can be set to take the union of the filtering results.
+- Reset: Clear the filter conditions.
+
+![graphanalysis-queryfilter-attributefilter](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.Statistical Filter
+
+Click on the Filter button in the Toolbar area, and click on Statistical Filter in the Sidebar to perform statistical filtering of canvas data. Users can select the vertex or edge types to be counted, and set the corresponding attribute values. The system will automatically group and count based on the selected vertex/edge types and attributes. The results can be displayed in chart and list formats. Clicking on the values in the chart or list area will highlight the corresponding data on the canvas.
+
+![graphanalysis-queryfilter-statisticalfilter](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![graphanalysis-queryfilter-statisticalfilter-chartswitch](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.Layout Style
+
+Click on the `Layout` button in the `Toolbar` area, and select the corresponding layout method to rearrange the data on the canvas. It supports force-directed layout, concentric circle layout, circular layout, radial layout, Dagre layout, and grid layout. Each layout method has different layout parameters. After adjusting the parameters, the data on the canvas will be rearranged.
+
+![graphanalysis-style-layout-button](../../../images/browser/graphanalysis-style-layout-button.png)
+![graphanalysis-style-layout-parameters](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+For detailed layout parameters, please refer to[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide).
+
+##### 2.4.4.6.Appearance Style
+
+Click on the `Appearance` button in the `Toolbar` area, and click on `Vertex Style` or `Edge Style` in the `Sidebar` to configure the appearance style.
+- Vertex Style
+    - Apply to vertex type: Set the display style for the corresponding vertex type. Multiple vertex types can be configured simultaneously.
+    - Size: The display size for the corresponding vertex type.
+    - Color: The display color for the corresponding vertex type.
+    - Icon: The icon style for the corresponding vertex type.
+    - Display Text: The text content displayed for the corresponding vertex type, defaulting to id.
+    - Advanced Configuration: Mark the corresponding vertex data based on the set conditions.
+- Edge Style
+    - Apply to Edge Type: Set the display style for the corresponding edge type, supports configuring the appearance of multiple edge types simultaneously.
+    - Color: The display color for the corresponding edge type.
+    - Width: The display width for the corresponding edge type.
+    - Display Text: The text content displayed for the corresponding edge type, not displayed by default.
+    - Advanced Configuration: Display the corresponding edge data based on the set conditions.
+
+![graphanalysis-style-appearance](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.Console
+
+The `Console` provides a visualized account management and database information viewing function. It provides users with comprehensive account and role management functions, including adding, deleting, modifying, and disabling accounts and roles. In addition, it also provides users with convenient database information viewing function, allowing users to easily view the basic information and configuration information of the graph database. Basic information mainly includes version number, running time, CPP compilation version number, etc., while database configuration information includes port number, system function parameter configuration, etc.
+
+#### 2.5.1.Account Management
+
+##### 2.5.1.1.Account Management
+
+##### a.Add Account
+
+Click the `Add` button in the `Account Management` interface to create a new account. Users need to enter the account name, account description, account password, and related roles.
+
+- Account Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Related Roles: When creating a new account, you must select a role. After the account is added successfully, the system will automatically generate a role with the same name as the account name.
+
+![account-add-button](../../../images/browser/account-add-button.png)
+![account-add](../../../images/browser/account-add.png)
+
+##### b.Edit Account
+
+Click the `Edit` button in the `Account Management` interface to edit the account description, account password, and related roles.
+
+![account-edit](../../../images/browser/account-edit.png)
+
+##### c.Disable Account
+
+Click the `Disable` button in the `Account Management` interface to prevent the corresponding account from logging in and accessing. Click the `Enable` button to enable the corresponding account login and access permissions.
+
+![account-disable](../../../images/browser/account-disable.png)
+![account-enable](../../../images/browser/account-enable.png)
+
+##### d.Delete Account
+
+Click the `Delete` button in the `Account Management` interface to delete the corresponding account.
+
+![account-delete](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.Role Management
+
+##### a.Add Role
+
+Click the `Add` button in the `Role Management` interface to create a new role. Users need to enter the role name, role description, and graph permissions.
+
+![role-add-button](../../../images/browser/role-add-button.png)
+
+- Role Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Graph Permissions: The browser supports four types of graph permission configurations: All, Read/Write, Read-Only, and None.
+    - All: corresponds to the read and write permissions of the graph, including editing the graph model permissions (schema).
+    - Read/Write: corresponds to the write permission of the graph, but does not include the permission to edit the graph model (schema).
+    - Read-Only: corresponds to the read permission of the graph.
+    - None: cannot access or operate the corresponding graph.
+- Role Conflict: When two roles have different graph permissions for the same graph, and both roles are authorized to the same account, the graph permission of the account for the graph is the union of the graph permissions of the two roles.
+
+![role-add](../../../images/browser/role-add.png)
+
+##### b.Edit Role
+
+Click the `Edit` button in the `Role Management` interface to edit an existing role. Users can edit the role description and graph permissions.
+
+![role-edit](../../../images/browser/role-edit.png)
+
+##### c.Disable Role
+
+Click the `Disable` button in the `Role Management` interface to disable the corresponding role. Click the `Enable` button to enable the corresponding role. After the role is disabled, the corresponding graph permissions of the role become invalid.
+
+- Disabled Role: After the role is disabled, the corresponding graph permissions become invalid.
+    - When a user has two roles with operating permissions on the same graph, if one of the roles is disabled, the permission of the other role is still valid.
+
+![role-disable](../../../images/browser/role-disable.png)
+![role-enable](../../../images/browser/role-enable.png)
+
+##### d.Delete Role
+
+Click the `Delete` button in the `Role Management` interface to delete the corresponding role.
+
+![role-delete](../../../images/browser/role-delete.png)
+
+#### 2.5.2.Database Information
+
+##### 2.5.2.1.Basic Information
+
+`Basic Information` obtains the current running status of the system and displays key information.
+
+![db_basic](../../../images/browser/db_basic.png)
+
+|Parameter    |Meaning    |
+|-------|--------|
+|TuGraph Version Number|The current version number of TuGraph, x.x.x|
+|Running Time|The time from when TuGraph service starts to now|
+|Server Code Version|The current commit of the tugraph-db repository|
+|Front-end Code Version|The current commit of the tugraph-web repository|
+|CPP Compiler Version|The CPP version number when compiling TuGraph|
+|Python Version Number|The Python version number when compiling TuGraph|
+|CPP Compiler ID|The CPP type when compiling TuGraph|
+
+The current running status of the system can also be obtained through commands.
+
+```cypher
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.Database Configuration Information
+
+`Database Configuration Information` obtains the current configuration parameters of the system and displays key information. To adjust the configuration parameters or understand the detailed configuration parameters, please refer to [Database Running-Service Configuration](../5.installation&running/7.tugraph-running.md).
+
+![db_configuration](../../../images/browser/db_configuration.png)
+
+| Parameter                   | Meaning                                                                                                                                         |
+|-----------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------|
+| bind_host                   | The host set when the system starts, usually 0.0.0.0                                                                                            |
+| disable_auth                | Whether to disable the regular update of token authentication. If set to true, the token can be used permanently                                |
+| durable                     | Whether to enable persistent storage of the underlying layer. If set to false, the data is updated asynchronously to the disk                   |
+| enable_audit_log            | Whether to enable audit log                                                                                                                     |
+| enable_backup_log           | Whether to enable real-time incremental backup                                                                                                  |
+| enable_fulltext_index       | Whether to enable full-text indexing                                                                                                            |
+| enable_ip_check             | Whether to enable IP whitelist                                                                                                                  |
+| enable_rpc                  | Whether to enable the RPC port                                                                                                                  |
+| enable_ssl                  | Whether to enable SSL encrypted transmission                                                                                                    |
+| optimistic_txn              | Whether to enable optimistic multi-threaded write transactions                                                                                  |
+| port                        | The REST access port of the current system                                                                                                      |
+| rpc_port                    | The port used by the RPC and HA services                                                                                                        |
+| subprocess_max_idle_seconds | The maximum idle time of the subprocess, a thread pool parameter                                                                                |
+| thread_limit                | The maximum number of threads used by the server at the same time                                                                               |
+| verbose                     | The level of detail of the log output information. It can be set to 0, 1, or 2, with larger values indicating more detailed output information. |
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..c0a3a1674b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# TuGraph Browser(old version)
+
+> This document focuses on the use of TuGraph Browser
+
+## Definition
+
+TuGraph Browser is a visual development tool provided by TuGraph.
+
+## Functionality
+
+TuGraph Browser provides graph database developers with functions such as visual graph data development, graph data management and maintenance.
+
+## How to use it
+
+### 1. Connect to the database
+
+When the user completes the installation of the graph database, you can access it through the Browser, TuGraph Browser tool. The user only needs to type in the browser address bar: IP of the server where TuGraph is located :Port. The default port is 7090.
+
+### 2. Login
+
+![alt Login](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- When the page is opened successfully, the first thing you see is the login page, and the user needs to fill in the account number and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change the initialized password in time after logging in
+
+### 3. Workbench
+
+#### 3.1 Quick Start
+
+- When you log in for the first time, the system will create an empty graph by default
+
+  ![alt quick start](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- The user clicks on the help option and selects Get Started quickly
+
+  ![alt help](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- Then click "One-click Create Model" -- >" One-click Create Data "to complete the construction of the built-in Movie data graph
+
+#### 3.2 Create subgraphs and examples
+
+##### 3.2.1 Create a subgraph
+
+- Click on New subgraph
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- Fill in the form information
+  ![alt Fill out the form](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+- Subgraph name
+- Subgraph description
+- Configuration information
+- Click OK to prompt that creation succeeded
+- Toggle the subgraph
+  ![alt Toggle subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- Click New Example
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- Select the example and click Create
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 query
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 User Interface Layout
+
+- Cypher input box
+- Result set display area
+
+##### 3.3.2 Result set display area function details
+
+- Result set tag display and functions
+  ![alt Result set tag](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+- All types of statistics for the result set are shown here
+- Click on the different "label" to make the following changes
+  -Change the display color
+- Modify the node size or edge thickness
+- Modify default display properties or system properties
+- Layout modification
+- Force guide layout
+- Grid layout
+- Tree layout
+- Environment layout
+- edge polymerization
+- Edges of the same type and direction can be merged
+- Create nodes
+- Click the Create Node button
+- Select the node type
+- Add node content
+- Create relationships
+- Select start and end points in the canvas
+- Select the type that can be matched
+- Enter node information
+- Stop layout
+- When too much data is causing the browser page to stall, you can click this stop layout button to improve the smoothness of the experience
+- Mouse hover
+- Enable this feature to highlight the one-degree neighbors of the mouse-over node
+- Result set export
+- Result sets can be exported as png, json, csv three different file forms
+- the refresh
+- Clicking the refresh button will re-execute the initial cypher statement for the current page and refresh the result set
+  Maximize -
+  -Click Maximize button, the result set display area will be displayed in full screen
+- Result set display mode switching
+  - Support graph, table and text modes
+
+##### 3.3.3 Schema
+
+- model
+  ![Modeling Alt](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- schema supports real-time addition, deletion, modification and query
+
+- schema supports import and export
+
+##### 3.3.4 Data import
+
+- Local data import
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+- Select the file encoding format
+- Select a local CSV file
+- Select the model for the corresponding node or edge
+- Do the data mapping
+- Complete the data import
+- The maximum supported size for a single file is 2GB.
+
+##### 3.3.5 plug-in (Stored Procedure)
+
+- Use of plug-ins
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+- Users can upload the plug-in program written locally, execute it in the visual page, and view the execution result
+- Users can perform, uninstall, execute, and download plug-ins in the visualization page
+
+##### 3.3.6 Help
+
+- where it records how TuGraph-browser is used
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 Console
+
+##### 3.4.1 Basic database information
+
+- Displays basic database configuration information
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 Permission management
+
+- A function module used to create users and roles. Users can manage permissions here
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 Live status
+
+- This shows the database real-time status, including: CPU usage, memory usage, disk usage, number of data requests, disk IO
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 Task Management
+
+- Here the user can see the task in execution and stop the task
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 Audit logs
+
+- Database related audit logs recorded here, used to troubleshoot problems encountered in use
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6c4d063e26
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB User Guide
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..f2cdffe578
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/1.environment.md
@@ -0,0 +1,41 @@
+# Environment
+
+> This document provides an overview of the required hardware and software environment for deploying TuGraph.
+
+## 1.Hardware Environment
+
+### 1.1. CPU
+TuGraph supports X86_64 and ARM64 architectures for both physical, virtual, and containerized environments. Tested and certified hardware platforms include Intel, AMD, Kunpeng, Hygon, Feiteng, and others.
+
+### 1.2. Memory
+We recommend having a memory capacity that is equal to or greater than the actual data size. For optimal performance, caching all data in memory is ideal. In terms of data locality, graph databases have poorer locality compared to relational databases. Therefore, if the data cannot fit in memory, frequent swapping may occur.
+
+### 1.3. Storage
+We strongly recommend using NVMe SSD as external storage. The database performs numerous synchronous write operations, often in a random manner, making the read/write performance of the external storage critical to the overall database performance. Hence, high IOPS and low-latency NVMe SSDs are the optimal choice.
+
+If circumstances permit only the use of SATA interface SSDs or cloud-based network disks, although performance may be affected, TuGraph can still run correctly.
+
+It is recommended to have external storage size at least four times the actual data size. For example, if the data size is 1TB, preparing a 4TB hard drive would be more reliable.
+
+
+
+## 2. Software environment
+
+### 2.1. Operating System
+
+TuGraph is compatible with popular operating systems, including Ubuntu, CentOS, SUSE, Galaxy Kylin, China Standard Software, UOS, and others, all of which have been tested and certified.
+
+Among them, the most stable system versions are Ubuntu 18.04, CentOS 7, and CentOS 8.
+
+### 2.2. System Libraries
+
+The requirements for system libraries differ between the compilation environment and the runtime environment. For specific details, please refer to the[environment mode](2.environment-mode.md)。
+
+## 3.Recommended Configuration
+
+| Hardware | Minimum Configuration	   | Recommended Configuration                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| Memory   | 4GB       | 512GB                    |
+| Storage  | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..98f9820ba2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,24 @@
+# Environment Mode
+
+> This document primarily introduces the three types of environments involved in TuGraph.
+
+## 1.Classification
+
+Based on the different functionalities supported by the environments, they can be categorized into the following:
+
+* The compilation environment has all dependent libraries for TuGraph compilation, including all dependencies of the running environment, and can compile TuGraph source code, but does not include precompiled TuGraph executable files and library files for developers to compile source code.
+
+* Running environment, with GCC/Java/Python environment, can run all functions of TuGraph, and can host full-text indexing, java client, c++ source code uploaded as plugin, and complete functions of python plugin, built-in TuGraph precompiled executable file and library files for customers to install and use directly without compiling source code.
+
+* Simplified operating environment, which is approximately equivalent to a bare system plus precompiled TuGraph. It can only run the basic functions of TuGraph. There is no C++ plugin to compile and run, only so upload, no full-text index, and no python plugin. It is for quick setup and trial use.
+After compiling TuGraph, all the required dependencies are packaged together in the form of .a files, eliminating the need for unnecessary additional dependencies during runtime. However, since TuGraph supports stored procedures, which involve compiling C++ code on the server, the required compilers still need to be present in the environment.
+
+## 2.System Library
+
+For the three types of environments, the required system libraries, excluding the TuGraph runtime package, are as follows:
+
+* Compilation Environment: It includes GCC, Python, Java compilers, as well as libraries such as ANTLR4 and Pybind11. Please refer to the tugraph-compile-*-Dockerfile for more details.
+
+* Runtime Environment: The main dependencies introduced by stored procedures include GCC, Boost, CMake, and others. Please refer to the tugraph-runtime-*-Dockerfile for more details.
+
+* Mini-Runtime Environment: There are no additional system library dependencies. Please refer to the tugraph-mini-runtime-*-Dockerfile for more details.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..96f2dfda63
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,130 @@
+# Docker Deployment
+
+>This document introduces the creation and download of Docker images for TuGraph Compile and TuGraph Runtime.
+
+## 1.Introduction
+
+- TuGraph Compile Image: Provides a compilation environment and can be used for TuGraph compilation and testing.
+- TuGraph Runtime Image: Provides a binary executable environment with TuGraph library and executable files.
+- TuGraph Mini Runtime Image: Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+## 2.Existing Docker Images
+
+### 2.1.Image Download
+
+The images are hosted on [DockerHub]( https://hub.docker.com/u/tugraph ) and can be downloaded and used directly.
+
+For the latest version of Docker address, see the TuGraph-Latest-Version section in [Guide](../../1.guide.md).
+
+### 2.2.Naming Convention
+
+#### 2.2.1.TuGraph Compile Image
+
+Provides a compilation environment and can be used for TuGraph compilation.
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+For example: `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+Provides a binary executable environment with TuGraph library and executable files.
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example:`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example: `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.Common Docker Operations
+
+Docker is generated from Dockerfile. Note that creating images requires downloading dependencies, so network issues may cause slow creation or creation failure. Do not overwrite images unless the tag is `latest`.
+
+build Compile image
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+build Runtime / Mini Runtime image
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+Modify image name
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+push image
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+pull image
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+save image
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+load image
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+Refer to the [docker official documentation](https://docs.docker.com/engine/reference/commandline/cli ) for other Docker operations.
+
+### 2.4. M1 Supports
+
+Running amd64 containers on M1-chip machines may cause unknown errors. TuGraph provides arm64 images for M1 machines. Contains compile and runtime images.
+
+In `tugraph-runtime-centos7:3.6.0` and `tugraph-compile-centos7:1.2.7` and later, `tugraph-runtime-centos7` and `tugraph-compile-centos7` provide images of two architectures: linux/amd64 and linux/arm64/v8. You can obtain the arm64 architecture image through docker pull on the M1 machine.
+
+### 2.5. Running service
+
+1. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7:${VERSION}
+   ```
+
+2. Start docker
+
+   ```shell
+    docker run -it -d -p 7001:7001 -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000 is default http port，for tugraph-db-browser accessing.
+   # 7070 is default http port，for legacy tugraph-web accessing.
+   # 7687 is bolt port, for neo4j client accessing.
+   # 9090 is default RPC port，for RPC client accessing.
+   
+   # The default data directory is /var/lib/lgraph/data and the default log directory is /var/log/lgraph_log,
+   # which is configured in the tugraph configuration file at /usr/local/etc/lgraph.json inside the docker.
+   # This command mounts the data directory and log directory to /root/tugraph/ on the host for persistence,
+   # which you can modify according to your actual situation.
+   ```
+
+## 3. Best Practice in Using and Developing Docker Images for TuGraph-DB
+
+Please carefully read the points below and follow them if you are new to contribute to TuGraph.
+
+- To get rid of too much docker layer, please add your dependency to the Docker with the style writing ENV and RUN in a
+  single line.
+- For the packages/resources you need to build the dependency, use the original ones instead of tweaking them without
+  tracking by VCS. And then contact TuGraph team to upload it to OSS to accelerate the building process, as the urls you
+  see in the Dockerfiles.
+- To make the development more efficient, you would better start from adding dependencies to base TuGraph Compile Images
+  and then reproduce the process in the Dockerfile after confirming the enviroment works.
+- CI uses the docker images. Please check the dependency problems if your CI fails.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..cb40030596
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# Local Package Deployment
+
+> This document describes TuGraph Local Package Deployment.
+
+## 1. Environment preparation
+
+TuGraph local package deployment requires a corresponding environment, and quick verification can use streamlined installation packages, which require almost no third-party libraries.
+
+If you need to use the complete TuGraph function, please refer to the tugraph-db source code directory ci/images/tugraph-runtime-*-Dockerfile. This script contains the complete environment construction process.
+
+## 2. Download the installation package
+
+For the latest version of the installation package address, see "TuGraph-Latest-Version" of [Guide](../../1.guide.md) 
+
+You can also visit Github to download: [TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. Installation method under CentOS
+
+The .rpm installation package for TuGraph installed on CentOS, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.rpm installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+Users can also specify the installation directory by specifying the `--prefix` option.
+
+## 4. Installation method under Ubuntu
+
+A .deb installation package for TuGraph installed on Ubuntu, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.deb` installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+This command installs TuGraph in the `/usr/local` directory by default. Users can also change the installation directory by specifying the `--instdir=<directory>` option.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..77bfda5171
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,128 @@
+# Cloud Deployment
+
+> This document mainly introduces the cloud deployment of TuGraph, and you can also refer to the[Alibaba Cloud ComputeNest deployment document.](https://aliyun-computenest.github.io/quickstart-tugraph/)。
+
+## 1.Introduction
+
+TuGraph (tugraph.antgroup.com) is a high-performance graph database of Alibaba Group. TuGraph provides community version services on ComputeNest, so you can quickly deploy TuGraph services on ComputeNest and achieve operation and maintenance monitoring, thereby building your own graph application. This document introduces how to open TuGraph community version services on ComputeNest, as well as deployment process and usage instructions.
+
+## 2.Instance Description
+
+TuGraph is deployed as a community open source version, and the source code can be found in the Github Repo. Currently, the available instance specifications are as follows:
+
+| Instance Family | vCPU and Memory             | System Disk                | Public Bandwidth         |
+|-----------------|-----------------------------|----------------------------|--------------------------|
+| ecs.r7a.xlarge  | AMD Memory r7a, 4vCPU 32GiB | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+| ecs.r6.xlarge   | Memory r6, 4vCPU 32GiB      | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+
+Estimated costs can be seen in real time when creating instances (currently free). If you need more specifications or other services (such as cluster high availability requirements, enterprise-level support services, etc.), please contact us at tugraph@service.alipay.com.
+
+## 3.Deployment Process
+
+### 3.1.Preparation
+
+Before starting to use, you need an Alibaba Cloud account to access and create resources such as ECS and VPC.
+
+- If you use a personal account, you can directly create a service instance.
+- If you create a service instance using a RAM user and use Alibaba Cloud ComputeNest for the first time:
+    - Before creating a service instance, you need to add permissions for the corresponding resources to the account of the RAM user. For detailed operations on adding RAM permissions, please see Grant RAM user permissions. The required permissions are shown in the following table.
+    - Authorization to create associated roles is also required. Refer to the following figure and select Agree to authorize and create associated roles.
+
+| Permission Policy Name          | Remark                                                                       |
+|---------------------------------|------------------------------------------------------------------------------|
+| AliyunECSFullAccess             | Permissions for managing cloud server services (ECS)                         |
+| AliyunVPCFullAccess             | Permissions for managing Virtual Private Cloud (VPC)                         |
+| AliyunROSFullAccess             | Permissions for managing Resource Orchestration Service (ROS)                |
+| AliyunComputeNestUserFullAccess | Permissions for managing ComputeNest services (ComputeNest) on the user side |
+| AliyunCloudMonitorFullAccess    | Permissions for managing Alibaba Cloud Monitor (CloudMonitor)                |
+
+![Cloud Deployment](../../../images/cloud-deployment-1.png)
+
+### 3.2.Deployment Entrance
+
+You can search in Alibaba Cloud ComputeNest, or quickly access it through the following deployment link.
+
+[Deployment Link](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.Apply for Trial Use
+
+Before formal trial use, you need to apply for trial use, fill in the information as prompted, and create the TuGraph service after passing the review.
+
+![Apply for Trial Use](../../../images/cloud-deployment-2.png)
+
+### 3.4.Create TuGraph Service
+
+#### 3.4.1.Parameter List
+
+During the process of creating a service instance, you need to configure the parameter list of the service instance information. The specific parameters are as follows.
+
+| Parameter Group                              | Parameter Item  | Example                 | Description                                                                                                                            |
+|----------------------------------------------|-----------------|-------------------------|----------------------------------------------------------------------------------------------------------------------------------------|
+| Service Instance Name                        | N/A             | test                    | The name of the instance.                                                                                                              |
+| Region                                       | N/A             | China East 1 (Hangzhou) | Select the region of the service instance. It is recommended to select nearby regions to obtain better network latency.                |
+| Payment Type Configuration                   | Payment Type    | Pay-As-You-Go           | For free use, please select Pay-As-You-Go.                                                                                             |
+| Availability Zone Configuration              | Deployment Area | Availability ZoneI      | Different available zones under the region, ensure that the instance is not empty.                                                     |
+| Select Existing Basic Resource Configuration | VPC ID          | vpc-xxx                 | Select the ID of the Virtual Private Cloud according to the actual situation.                                                          |
+| Select Existing Basic Resource Configuration | Switch ID       | vsw-xxx                 | Select the Switch ID according to the actual situation. If the Switch ID cannot be found, try switching the region and available zone. |
+| ECS Instance Configuration                   | Instance Type   | ecs.r6.xlarge           | Currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications.                                                                    |
+|ECS Instance Configuration|	Instance Password|	**|	Set the instance password. Length of 8-30 characters, must include three items (uppercase letters, lowercase letters, numbers, special characters in ()`~!@#$%^&*_-+={}[]:;'<>,.?/).
+|
+
+#### 3.4.2.Specific Steps
+
+The creation of the service is carried out according to the following steps, refer to the figure below:
+
+- Create an instance name, such as "test" in the figure below
+- Select the region, such as "China East 1 (Hangzhou)" in the figure below
+
+![Create Instance](../../../images/cloud-deployment-3.png)
+
+- Select the instance type, currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications. If there is no model available in the list, try selecting other deployment areas.
+- Select the model
+- Configure the password for the instance
+- Select the deployment area, such as "Availability Zone I" in the figure below
+
+![Select Region](../../../images/cloud-deployment-4.png)
+
+- Click next to enter the order confirmation page
+- Check the checkboxes for "Permission Confirmation" and "Service Terms"
+- Click the green "Start Free Trial" button in the lower left corner to create a service instance
+
+![Confirmation](../../../images/cloud-deployment-5.png)
+
+### 3.5.Start TuGraph Service
+
+- View the service instance: After the service instance is created successfully, it takes about 2 minutes for deployment. After the deployment is complete, you can see the corresponding service instance on the page, as shown in the figure below.
+
+![View Instance](../../../images/cloud-deployment-6.png)
+
+- Click the service instance to access TuGraph. After entering the corresponding service instance, you can get 3 ways to
+  use it on the page: web, rpc, ssh. You can also see the password of user admin on the page.
+
+![Access Method](../../../images/cloud-deployment-7.png)
+
+- Click the link of web to jump to the deployed TuGraph Web. It is recommended that novice users first use the demo to quickly get started with TuGraph.
+    - First, on the TuGraph Web login page, enter the default username (admin) and the password on the page to log in, as shown in the figure below.
+    - After the login is completed, click "New Instance" -> "Create Instance" in sequence, wait for the creation to be completed, and the steps in 3 will change to green in turn, and it will automatically switch to the subgraph MovieDemo1, as shown in the figure below.
+
+![Login](../../../images/cloud-deployment-8.png)
+![Create Demo](../../../images/cloud-deployment-9.png)
+
+## 4.Common FAQs
+
+### No available resources in the selected deployment area
+
+Sometimes, the selected deployment area (such as Availability Zone G) does not have available resources for the selected package, and an error will be reported as shown in the figure below.
+
+![Deployment Error](../../../images/cloud-deployment-10.png)
+
+__Solution__:Try selecting other regions, such as Availability Zone I
+
+### Unaccessible to the web port
+
+It takes some time for the server to get ready. Just wait for a few seconds.
+
+
+### Username or password is not correct
+
+Please make sure that you are using the password on the page instead of the default one.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..bc6baba6aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/6.compile.md
@@ -0,0 +1,30 @@
+# Compile
+
+> This document mainly describes how to compile TuGraph from source code.
+
+## 1.Prerequisites
+
+It is recommended to build TuGraph on a Linux system. Meanwhile, Docker is a good choice. If you want to set up a new environment, please refer to [Dockerfile](3.docker-deployment.md)。
+
+## 2.compile
+
+Here are steps to compile TuGraph:
+
+1. run `deps/build_deps.sh` to build tugraph-web if you need. Skip this step otherwise.
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If compiling on an arm machine (such as a Mac with M1 chip), add `-DENABLE_BUILD_ON_AARCH64=ON`
+4. `make`
+5. `make package` or `cpack --config CPackConfig.cmake`
+
+Example:
+`tugraph/tugraph-compile-centos7`Docker environment
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos7
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..c99107d013
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,203 @@
+# Tugraph Running
+
+> This document describes the operation mode of the TuGraph service, starting, stopping, and restarting operations.And TuGraph's service configuration parameters, configuration file format, and command-line configuration parameters.
+
+## 1. Prerequisites
+TuGraph has the following prerequisites for its execution: a correct [installation of TuGraph](1.environment.md).
+
+TuGraph execution requires ensuring that the library file "liblgraph.so" is located in the environment variable LD_LIBRARY_PATH.
+
+The user running the TuGraph process does not need superuser privileges. However, they need read permissions for the configuration file (usually lgraph.json) and any files referenced within it. Additionally, they should have write permissions for data folders, log files, etc.
+
+## 2.The operation mode
+
+TuGraph can be started as a normal process in the foreground or as a daemon in the background.
+
+When running as a normal process, TuGraph can print logs directly to the terminal, which is handy when debugging server configurations. However, because the foreground process is terminated after the terminal exits, the user must ensure that the terminal remains open while the TuGraph server is running. In daemon mode, on the other hand, the TuGraph server can continue to run even if the terminal that started it exits. If TuGraph needs to run for a long time, it is recommended to start the TuGraph server in daemon mode.
+
+### 2.1.Running a normal process
+
+The `lgraph_server -d run` command runs TuGraph as a normal process. Normal processes depend on the command line terminal, so when the terminal ends, the TuGraph process is automatically terminated. Normal process mode with `--log_dir ""` can output the process log directly to the terminal, so it is easier to debug.Note: When not using the `-d run` command, the default behavior is to run as a normal process.
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d run -c lgraph_standalone.json --log_dir ""
+```
+or:
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+Example of running output in normal mode：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+In normal process mode, the user can prematurely terminate the TuGraph process by pressing 'CTRL+C'.
+
+### 2.2.Run process daemon mode
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+Example output from running in daemon mode:
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+## 3.Service operation
+
+### 3.1.Start the service
+
+TuGraph needs to be started using the 'lgraph_server -d start' command line. The following is an example of the command to start TuGraph:
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph_daemon.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+### 3.2.Stop the service
+
+You can stop the TuGraph daemon using the 'kill' command and the 'lgraph_server -d stop' command. Since it is possible to run multiple TuGraph server processes on the same computer, we distinguish between the different server processes using the '.pid 'file, which is written to the working directory where the process was started. Therefore, you need to run the command 'lgraph_server-d stop' in the same working directory to stop the correct server process.
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.Restart the service
+
+Users can also restart the TuGraph service by 'lgraph_server -d restart' :
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.Service configuration
+
+The TuGraph server loads configurations from the configuration file and command line options at startup, and if different values are specified for the same option in the configuration file and command line, the value specified in the command line will be used preferentially.
+
+### 4.1.Configuration parameters
+
+The parameters and their types are described as follows:
+
+| **Parameter names**          | **<nobr>Type</nobr>** | **Instructions**                                                                                                                                                                                                                                                                                                                                                                            |
+|------------------------------|-----------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                    | string                | Directory where data files are stored. If the directory does not exist, it is automatically created. The default directory is /var/lib/lgraph/data.                                                                                                                                                                                                                                         |
+| durable                      | boolean               | Whether to enable real-time persistence. Turning off persistence can reduce the disk IO overhead when writing, but data may be lost in extreme cases such as machine power failure. The default value is `true`.                                                                                                                                                                            |
+| host                         | string                | The IP address on which the REST server listens. The default address is 0.0.0.0. Note: In HA mode, the host needs to be set to the IP address of the corresponding server and cannot be set to 0.0.0.0.                                                                                                                                                                                     |
+| port                         | int                   | The Port on which the REST server listens. The default port is 7070.                                                                                                                                                                                                                                                                                                                        |
+| enable_rpc                   | boolean               | Whether to use RPC services. The default value is false.                                                                                                                                                                                                                                                                                                                                    |
+| rpc_port                     | int                   | Port used by RPC and HA services. The default port number is 9090.                                                                                                                                                                                                                                                                                                                          |
+| bolt_port                    | int                   | Port used by Bolt Client. The default port number is 7687.                                                                                                                                                                                                                                                                                                                                  |
+| enable_ha                    | boolean               | Whether to enable the HA mode. The default value is false.                                                                                                                                                                                                                                                                                                                                  |
+| ha_log_dir                   | string                | HA log directory. The HA mode needs to be enabled. The default value is null.                                                                                                                                                                                                                                                                                                               |
+| verbose                      | int                   | Detail level of log output information. The value can be 0,1,2. The larger the value, the more detailed the output information. The default value is 1.                                                                                                                                                                                                                                     |
+| log_dir                      | string                | Directory where log files are stored. The default directory is /var/log/lgraph/.                                                                                                                                                                                                                                                                                                            |
+| ssl_auth                     | boolean               | Whether to use SSL authentication. When HTTPS is enabled, only the HTTPS service is enabled on the REST server. The default value is false.                                                                                                                                                                                                                                                 |
+| web                          | string                | The directory where the web files (including the visual part) are located. The default directory is/usr/local/share/lgraph/resource.                                                                                                                                                                                                                                                        |
+| server_cert                  | string                | certificate file path used by the server when SSL authentication is enabled. The default path is/usr/local/etc/lgraph/server - cert.pem.                                                                                                                                                                                                                                                    |
+| server_key                   | string                | The public key file used by the server when SSL authentication is enabled. The default directory is/usr/local/etc/lgraph/server - key.pem。                                                                                                                                                                                                                                                  |
+| enable_audit_log             | boolean               | Whether to enable audit logs. The default value is false.                                                                                                                                                                                                                                                                                                                                   |
+| audit_log_expire             | int                   | When audit logs are enabled, the validity period (hours) of audit logs is automatically cleared upon timeout. If the value is 0, the logs are not cleared. The default value is 0.                                                                                                                                                                                                          |
+| audit_log_dir                | string                | Specifies the directory for storing log files when audit logs are enabled. The default directory is $directory/_audit_log_.                                                                                                                                                                                                                                                                 |
+| load_plugins                 | boolean               | Import all stored procedures when starting the service. The default value is true.                                                                                                                                                                                                                                                                                                          |
+| optimistic_txn               | boolean               | Enable optimistic multithreaded write transactions for Cypher. The default is false.                                                                                                                                                                                                                                                                                                        |
+| disable_auth                 | boolean               | Disable REST authentication. The default is false.                                                                                                                                                                                                                                                                                                                                          |
+| ha_snapshot_interval_s       | int                   | Snapshot interval (in seconds). The default value is 604800. -1 means not to automatically generate snapshots.                                                                                                                                                                                                                                                                              |
+| ha_heartbeat_interval_ms     | int                   | Heartbeat interval in milliseconds. The default value is 1000.                                                                                                                                                                                                                                                                                                                              |
+| ha_node_offline_ms           | int                   | The heartbeat times out and the interval (in milliseconds) between nodes going offline. The default value is 60000.                                                                                                                                                                                                                                                                         |
+| ha_node_remove_ms            | int                   | The interval (in milliseconds) at which a node is considered completely dead and removed from the list. The default value is 120000.                                                                                                                                                                                                                                                        |
+| ha_first_snapshot_start_time | string                | The time when the first snapshot is taken, the format is "HH:MM:SS", which means the first snapshot is taken at the next HH:MM:SS time point, and then every ha_snapshot_interval_s seconds. The default value is "", which means that the first snapshot is taken randomly at any time within 0-ha_snapshot_interval_s, and then a snapshot is taken every ha_snapshot_interval_s seconds. |
+| enable_ip_check              | boolean               | Allow IP address whitelists. The default value is false。                                                                                                                                                                                                                                                                                                                                    |
+| idle_seconds                 | int                   | The maximum number of seconds a child process can be idle. The default value is 600.                                                                                                                                                                                                                                                                                                        |
+| enable_backup_log            | boolean               | Whether to enable backup logging. The default value is false.                                                                                                                                                                                                                                                                                                                               |
+| backup_log_dir               | string                | The directory where backup files are stored. The default value is null.                                                                                                                                                                                                                                                                                                                     |
+| snapshot_dir                 | string                | Directory where snapshot files are stored. The default value is null.                                                                                                                                                                                                                                                                                                                       |
+| thread_limit                 | int                   | The maximum number of threads that can be used simultaneously. The default value is 0, which means that no restriction is imposed. The license file prevails.                                                                                                                                                                                                                               |
+| unlimited_token              | boolean               | Whether to set the link token to be infinite. The default value is false and the validity period is 24 hours.                                                                                                                                                                                                                                                                               |
+| reset_admin_password         | boolean               | Whether to reset the password. The default value is false. When the value is true, the password will be reset to "73@TuGraph"。                                                                                                                                                                                                                                                              |
+| enable_fulltext_index        | boolean               | Whether to enable the full-text index function, the default value is false.                                                                                                                                                                                                                                                                                                                 |
+| fulltext_analyzer            | string                | Full-text index tokenizer type. Can be set to `StandardAnalyzer` or `SmartChineseAnalyzer`. Default is `StandardAnalyzer`                                                                                                                                                                                                                                                                   |
+| fulltext_commit_interval     | int                   | Full-text index data submission period, for write operations, in seconds. The default is 0, which commits immediately.                                                                                                                                                                                                                                                                      |
+| fulltext_refresh_interval    | int                   | Full-text index data refresh cycle, for read operations, in seconds. The default is 0, and the latest written data can be read immediately.                                                                                                                                                                                                                                                 |
+| ha_conf                      | string                | Initialize the HA cluster according to host1:port1,host2:port2,host3:port3, the default value is empty.                                                                                                                                                                                                                                                                                     |
+| ha_node_join_group_s         | int                   | The waiting time for a node to try to join the high availability cluster, in seconds, the default is 10.                                                                                                                                                                                                                                                                                    |
+| ha_bootstrap_role            | int                   | Whether to use bootstrap to start, and the server role to start using this method, 0 means not to use bootstrap to start, 1 means to use bootstrap to start and this node is a leader, 2 means to use bootstrap to start and this node is a follower, only these 3 options. The default value is 0.                                                                                         |
+| help                         | boolean               | Print the help message. The default value is false.                                                                                                                                                                                                                                                                                                                                         |
+
+### 4.2.Server configuration file
+
+TuGraph's configuration file is stored in JSON format. It is recommended that most configuration be stored in configuration files and that some configuration parameters be modified only temporarily using command-line options when needed.
+
+A typical configuration file looks like this:
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7070,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..4f363b5a53
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,168 @@
+# High Availability mode
+
+> This document describes the principles, preparations, and server operations of the high availability mode
+
+## 1.Theory
+
+TuGraph provides high availability (HA) mode through multi-machine hot backup. In high availability mode, write operations to the database will be synchronized to all servers (non-witness), so that even if some servers are down, the availability of the service will not be affected.
+
+When the high-availability mode is started, multiple TuGraph servers form a backup group, which is a high-availability cluster. Each backup group consists of three or more TuGraph servers, one of which serves as the `leader` and the other replication group servers as `followers`. Write requests are served by a `leader`, which replicates and synchronizes each request to a `follower` and can only respond to the client after the request has been synchronized to the server. This way, if any server fails, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically select a new `leader`.
+
+TuGraph's high-availability mode provides two types of nodes: `replica` nodes and `witness` nodes. Among them, the `replica` node is an ordinary node, has logs and data, and can provide services to the outside world. The `witness` node is a node that only receives heartbeats and logs but does not save data. According to deployment requirements, `leader` nodes and `follower` nodes can be flexibly deployed as `replica` nodes or `witness` nodes. Based on this, there are two deployment methods for TuGraph high-availability mode: one is the ordinary deployment mode, and the other is the simple deployment mode with witness.
+
+For normal deployment mode, `leader` and all `followers` are nodes of type `replica`. Write requests are served by a `leader`, which copies each request to a `follower` and cannot respond to the client until the request has been synchronized to more than half of the servers. This way, if less than half of the servers fail, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically elect a new `leader` to ensure data consistency and service availability.
+
+However, when the user server resources are insufficient or a network partition occurs, a normal HA cluster cannot be established. At this time, since the `witness` node has no data and takes up little resources, the `witness` node and the `replica` node can be deployed on one machine. For example, when there are only 2 machines, you can deploy the `replica` node on one machine, and the `replica` node and `witness` node on another machine, which not only saves resources, but also does not require log application To the state machine, there is no need to generate and install snapshots, so the response to requests is very fast, and it can help quickly elect a new leader when the cluster crashes or the network is partitioned. This is the simple deployment mode of the TuGraph HA cluster. Although `witness` nodes have many benefits, since there is no data, the cluster actually adds a node that cannot become `leader`, so the availability will be slightly reduced. To improve the availability of the cluster, you can allow the `witness` node to be the leader temporarily by specifying the `ha_enable_witness_to_leader` parameter as `true`. After the `witness` node synchronizes the new log to other nodes, it will actively switch the leader role to the node with the latest log.
+
+This feature is supported in version 3.6 and above.
+
+## 2.Preparation
+
+To enable high availability mode, users need to:
+
+- Three or more instances of TuGraph servers.
+- To enable high availability mode when starting lgraph_server, the 'enable_ha' option can be set to 'true' using a configuration file or the command line.
+- Set the correct rpc_port through the configuration file or command line
+
+## 3.Start the initial backup group
+
+After installing TuGraph, you can use the `lgraph_server` command to start a high-availability cluster on different machines. This section mainly explains how to start a high-availability cluster. For cluster status management after startup, see [lgraph_peer tool](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.The initial data is consistent
+
+When the data in all servers is the same or there is no data at startup, the user can
+specify `--ha_conf host1:port1,host2:port2` to start the server.
+In this way, all prepared TuGraph instances can be added to the initial backup group at one time,
+All servers in the backup group elect `leader` according to the RAFT protocol, and other
+servers join the backup group with the role of `follower`.
+
+An example command to start an initial backup group is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+After the first server is started, it will elect itself as the 'leader' and organize a backup group with only itself.
+
+### 3.2.Inconsistent initial data
+If there is already data in the first server (imported by the `lgraph_import` tool or transferred from a server in non-high availability mode),
+And it has not been used in high-availability mode before, the user should use the boostrap method to start. Start the server with data in bootstrap
+mode with the `ha_bootstrap_role` parameter as 1, and specify the machine as the `leader` through the `ha_conf`
+parameter. In bootstrap mode, the server will copy its own data to the new server before adding the newly
+joined server to the backup group, so that the data in each server is consistent.
+
+An example command to start a data server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+Other servers without data need to specify the `ha_bootstrap_role` parameter as 2, and specify the `leader` through the `ha_conf` parameter. The command example is as follows
+
+```bash
+**$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**You need to pay attention to two points when using bootstrap to start an HA cluster:**
+1. You need to wait for the `leader` node to generate a snapshot and start successfully before joining the `follower` node, otherwise the `follower` node may fail to join. When starting the `follower` node, you can configure the `ha_node_join_group_s` parameter to be slightly larger to allow multiple waits and timeout retries when joining the HA cluster.
+2. The HA cluster can only use the bootstrap mode when it is started for the first time. It can only be started in the normal mode (see Section 3.1) when it is started later. In particular, multiple nodes of the same cluster cannot be started in the bootstrap mode, otherwise it may cause Data inconsistency
+
+## 4.Start witness node
+
+### 4.1. Witness nodes are not allowed to become leader
+
+The startup method of `witness` node is the same as that of ordinary nodes. You only need to set the `ha_is_witness` parameter to `true`. Note that the number of witness nodes should be less than half of the total number of cluster nodes.
+
+An example command to start the witness node server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+Note: By default, the `witness` node is not allowed to become the `leader` node, which can improve the performance of the cluster, but will reduce the availability of the cluster when the `leader` node crashes.
+
+### 4.1. Allow witness nodes to become leaders
+
+You can specify the `ha_enable_witness_to_leader` parameter as `true`, so that the `witness` node can temporarily become the `leader` node, and then actively switch to the master after the new log synchronization is completed.
+
+An example of the command to start the `witness` node server that is allowed to become the `leader` node is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+Note: Although allowing `witness` nodes to become `leader` nodes can improve the availability of the cluster, it may affect data consistency in extreme cases. Therefore, it should generally be ensured that the number of `witness` nodes + 1 is less than half of the total number of cluster nodes.
+
+## 5.Scale out other servers
+
+After starting the initial backup group, if you want to scale out the backup group, add new servers to the backup group,
+The `--ha_conf HOST:PORT` option should be used, where `HOST` can be the IP address of any server already in this backup group,
+And `PORT` is its RPC port. E.g:
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+This command will start a TuGraph server in high availability mode and try to add it to the backup group containing the server `172.22.224.15:9090`.
+Note that joining a backup group requires a server to synchronize its data with the backup group's `leader` server, and this process may take a considerable amount of time, depending on the size of the data.
+
+## 6.Stopping the Server
+
+When a server goes offline via 'CTRL-C', it will notify the current 'leader' server to remove the server from the backup group. If the leader server goes offline, it will pass the leader identity permission to another server before going offline.
+
+If a server is terminated or disconnected from other servers in the backup group, the server is considered a failed node and the leader server will remove it from the backup group after a specified time limit.
+
+If any server leaves the backup group and wishes to rejoin, it must start with the '--ha_conf {HOST:PORT}' option, where 'HOST' is the IP address of a server in the current backup group.
+
+## 7.Restarting the Server
+
+Restarting the entire backup group is not recommended as it disrupts service. All servers can be shut down if desired. But on reboot,
+It must be ensured that at least N/2+1 servers in the backup group at shutdown can start normally, otherwise the startup will fail. and,
+Regardless of whether `enable_bootstrap` is specified as true when initially starting the replication group, restarting the server only needs to pass
+Specify the `--ha_conf host1:port1,host2:port2` parameter to restart all servers at once. The command example is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker deploys a highly available cluster
+In real business scenarios, it is likely to encounter the need to deploy high-availability clusters on multiple operating systems or architectures.
+Differentiated environments may cause some dependencies to be missing when compiling TuGraph. therefore,
+Compiling software in docker and deploying high-availability clusters is very valuable. Take the centos7 version of docker as an example,
+The steps to deploy a highly available cluster are as follows.
+
+### 8.1.Install mirror
+Use the following command to download TuGraph's compiled docker image environment
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+Then pull the TuGraph source code and compile and install
+
+### 8.2.Create container
+Use the following command to create a container, use `--net=host` to make the container run in host mode, in this mode
+Docker and the host machine share the network namespace, that is, they share the same IP.
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.Start service
+Use the following command to start the service on each server, because docker and the host share IP, so you can directly specify to start the service on the host IP
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.Server Status
+
+The current status of the backup group can be obtained from the TuGraph visualization tool, REST API, and Cypher query.
+
+In the TuGraph visualization tool, you can find the list of servers and their roles in the backup group in the DBInfo section.
+
+With the REST API, you can use `GET /info/peers` to request information.
+
+In Cypher, the `CALL dbms.listServers()` statement is used to query the status information of the current backup group.
+
+## 10.Data synchronization in high availability mode
+
+In high availability mode, different servers in the same backup group may not always be in the same state. For performance reasons, if a request has been synchronized to more than half of the servers, the leader server will consider the request to be in the committed state. Although the rest of the servers will eventually receive the new request, the inconsistent state of the servers will persist for some time. A client may also send a request to a server that has just restarted, thus having an older state and waiting to join a backup group.
+
+To ensure that the client sees consistently continuous data, and in particular to get rid of the 'reverse time travel' problem, where the client reads a state older than it has seen before, each TuGraph server keeps a monotonically increasing data version number. The mapping of the data version number to the database state in the backup group is globally consistent, meaning that if two servers have the same data version number, they must have the same data. When responding to a request, the server includes its data version number in the response. Thus, the client can tell which version it has seen. The client can choose to send this data version number along with the request. Upon receiving a request with a data version number, the server compares the data version number to its current version and rejects the request if its own version is lower than the requested version. This mechanism ensures that the client never reads a state that is older than before.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..bf30d63598
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+Installation And Running
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..8a46e25efe
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,475 @@
+# Data Importing
+
+> This document describes the data import function of TuGraph. These include delimiters in CSV format, sample formats for jsonline, and two modes for importing online and offline.
+
+## 1. Introduction
+
+After the installation is successful, you can use the `lgraph_import` batch import tool to import existing data into TuGraph. `lgraph_import` supports importing data from CSV files and JSON data sources.
+
+> `sonline format, a row of a json array string`
+
+> CSV format
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline format
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph supports two data importing modes：
+
+- _offline_：Read the data and import it into a data file for the specified server, it should only be done when the server is offline.
+- _online_：Read the data and send it to the running server, which then imports the data into its database.
+
+## 2.CSV file format delimiter
+
+    CSV delimiters can be single-character or multi-character strings, which cannot contain 'r' or 'n'. Note that different shells handle input strings differently, so different escape handling may be required for different shell input parameters.
+
+In addition, 'lgraph_import' also supports the following escape characters for entering special symbols:
+
+| Escape character | Instructions                                                                                              |
+| ---------------- | --------------------------------------------------------------------------------------------------------- |
+| \\               | The backslash`\\`                                                                                         |
+| \\a              | ASCII code 0x07                                                                                           |
+| \\f              | form-feed，ASCII code 0x0c                                                                                |
+| \\t              | Horizontal tab characters， ASCII code 0x09                                                               |
+| \\v              | Vertical tab characters， ASCII code 0x0b                                                                 |
+| \\xnn            | Two hexadecimal digits representing one byte，example \\x9A                                               |
+| \\nnn            | A three-digit octal number representing a single byte，example \\001, \\443，data range cannot exceed 255 |
+
+Demo：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.The configuration file
+
+    `lgraph_import`tool configures the environment using the specified configuration file. The configuration file describes the paths to the input files, the vertices/edges they represent, and the vertex/edge format.
+
+### 3.1.Configuration File Format
+
+The configuration file consists of two parts: schema and files. The 'schema' part defines label, and the 'files' part describes the data files to be imported.
+
+#### 3.1.1.The keyword
+
+- schema (Array）
+  - label（required，string）
+  - type（required， VERTEX or EDGE）
+  - properties（Array，required for vertex，If there is no property for the edge, you can leave it unconfigured）
+    - name（required, string）
+    - type （required,，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（optional，Indicates that the field can be configured or not configured）
+    - index（optional，Whether the field needs to be indexed）
+    - unique（optional, whether the field indexed and is of type unique）
+    - pair_unique（optional, whether the field indexed and is of type pair_unique）only one unique and pair_unique can be set. Setting up and running at the same time will terminate due to an input exception
+  - primary (vertex-only configuration, specify a property that uniquely identifies a point in the primary key field)
+  - temproal (edge-only configuration, optional, specifies the timestamp field for storage tier sorting)
+  - temporal_field_order (edge-only configuration, optional, the default value is ASC, indicating the ascending order, or DESC, indicating the descending order)
+  - constraints (edge-only configuration, optional, array form, start and end labels, unconfigured or empty means unrestricted)
+  - detach_property (optional, both Edge and Vertex can config，default is `false`. `true` means the property data is stored in detached model, which can reduce io read amplification in cases with less memory and much property data.)
+- files （Array）
+  - path（required，string，The value can be a file path or a directory path. If it is a directory, all files in the directory will be imported. Ensure that they have the same schema）
+  - header（Optional, numeric, header in the first few lines of the file, or 0）
+  - format（required，JSON or CSV）
+  - label（required，string）
+  - columns（Array）
+    - SRC_ID (Special string，only on the edges,That means this column is the source data)
+    - DST_ID (A special string, only on the edges, indicates that this column is the destination data)
+    - SKIP   (A special string to skip this column of data)
+    - [property]
+  - SRC_ID (Edge-only configuration. The value is the start label)
+  - DST_ID (Edge-only configuration. The value is the destination point label)
+
+#### 3.1.2. Index length
+Because TuGraph has limits on the length of keys, unique indexes do not allow the establishment of indexes that exceed the limit length. Non-unique indexes will truncate attributes that exceed the length limit, and when traversing non-unique indexes through iterators, the key obtained It is also truncated and may not be consistent with expectations. The truncation length is different for different types of non-unique indexes.
+##### 3.1.2.1.unique index
+A unique index is globally unique, and the maximum length of the index key is 480 bytes. Primary is a special unique index, so the maximum key length is also 480 bytes, and no index can be created if it exceeds 480 bytes.
+##### 3.1.2.2.pair_unique index
+A pair_unique index refers to a unique index between two nodes. This type of index can only be created in the edge schema. This type of index adds the vid of the source node and the target node after the user-specified key. Each vid is 5 bytes. length. Therefore, the maximum key length is 470 bytes, and indexing cannot be established if it exceeds 470 bytes.
+##### 3.1.2.3. Non-unique index
+A non-unique index refers to an index that neither unique nor pair_unique is set to 1. In the implementation of TuGraph, one key of this type of index may be mapped to multiple values. In order to speed up search and writing, the user-specified The key is followed by the maximum value in a set of vid or euid. For non-unique indexes created in nodes, the key is followed by vid, and each vid is 5 bytes in length, so the maximum length is 475 bytes.
+For non-unique indexes created in edges, the key is followed by euid, and each euid is 24 bytes long, so the maximum length is 456 bytes. If the index key exceeds the corresponding length, it will be automatically truncated.
+
+### 3.2.Example Configuration File
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+For the above Example Configuration File, three labels defined: two point types' actor 'and' movie ', and one edge type 'role'. Each label describes: the name of the label, the type (dot or edge), which attribute fields are available, and the type of each field. For points, the primary field also defined; For edges, the constraints field also defined, which limits the starting and ending points of the edges.
+
+It also describes three data files, two dot data files' actors.csv 'and' movies.csv ', and one edge data file 'roles.csv'. Each section describes the path of the file, the format of the data, the first few lines of the header, the label of the data, and the corresponding field of each column in each row of data in the file.
+
+For the above configuration files, the import tool will first create labels' actor ', 'movie', and 'role' in TuGraph, and then perform data import of the three files.
+
+## 4.Offline full import
+
+The offline mode can be used only on offline servers. An offline import creates a new graph, so it's more suitable for your first data import on a newly installed TuGraph server.
+
+To use the 'lgraph_import' tool in offline mode, you can specify the 'lgraph_import --online false' option. To see the command-line options available, use 'lgraph_import --online false --help' :
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+Command line arguments:
+
+- **-c, --config_file** `config_file`: Import the configuration file name in the following format:
+- **--log** `log_dir`: Log directory. The default is an empty string, in which case the log information output to the console.
+- **--verbose** `0/1/2`: Log level. The higher the log level, the more detailed the output information is. The default value is 1.
+- **-i, --continue_on_error** `true/false`: If an error occurs, skip the error and continue. The default is false. If an error occurs, exit.
+- **-d, --dir** `{diretory}`:The database directory to which the import tool will write data. Default is'./db '.
+- **--delimiter** `{delimiter}`: Data file separator. This is used only when the data source is in CSV format. The default is', '。
+- **-u, --username** `{user}`: Username of the database. You need to be an administrator to perform offline import.
+- **-p, --password** `{password}`: Specifies the password of the database user
+- **--overwrite** `true/false`: Whether to overwrite data. When set to true, the data directory overwritten if it already exists. Default to 'false'.
+- **-g, --graph** `{graph_name}`: Specify the kind of graph to import.
+- **-h, --help**: The help information displayed.
+
+### 4.1.Offline Import Example
+
+    In this example, we use the movie-actor data described above to demonstrate the use of the import tool. The data to be imported is divided into three files: 'movies.csv', 'actors.csv', and 'roles.csv'.
+
+'movies.csv' contains information about movies, where each movie has an id (as a primary key for retrieval), and each movie also has attributes such as title, year, and rating. (Data from [IMDb](http://www.imdb.com)).
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+> The jsonline format is as follows:
+> All fields can be strings, which will be converted to the corresponding type when imported
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`It contains information about the actors. Each actor also has an id, as well as properties such as name.
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`It contains information about which role an actor played in which movie. Each row records a character played by a given actor in a given movie, corresponding to an edge in the database.`SRC_ID` and `DST_ID` are the source and target vertices of the edge, which are the 'primary' properties defined in 'actors.csv' and 'movies.csv', respectively.
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+'configuration file import.conf', notice that there are two HEADER lines in each file, so we need to specify the 'HEADER=2' option.
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+Using the import configuration file, we can now import data using the following command:
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # Read configuration information from import.conf
+        --dir /data/lgraph_db      # Store the data in /data/lgraph_db
+        --graph mygraph            # Import the graph named mygraph
+```
+
+**Notice**：
+
+- If a graph named 'mygraph' already exists, the import tool will print an error message and exit. To force a graph to be overwritten, use the '--overwrite true' option.
+- Configuration and data files must be stored in UTF-8 encoding (or normal ASCII encoding, which is a subset of UTF-8). If any file uses an encoding other than UTF-8 (for example, UTF-8 with BOM or GBK), the import will fail and output a profiler error.
+
+## 5.Online incremental Import
+
+The online import mode can be used to import a batch of files into an already running instance of TuGraph. This is handy for processing incremental batch updates that typically occur at fixed intervals. The 'lgraph_import --online true' option enables the import tool to work in online mode. Like offline mode, online mode has its own set of command-line options, which can be printed using the '-h, --help' options:
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+The configuration related to the file specified in the configuration file, and its format is exactly the same as' offline mode '. However, instead of importing the data into a local database, we are now sending the data to a running TuGraph instance, which is typically running on a different computer than the client machine on which the import tool is running. Therefore, we need to specify the URL, DB user, and password for the HTTP address of the remote machine.
+
+If the user and password are valid, and the specified graph exists, the import tool sends the data to the server, which then parses the data and writes it to the specified graph. The data will be sent in a packet of about 16 MB, interrupted at the nearest newline. Each package imported atomically, which means that if the package is successfully imported, all data is successfully imported; otherwise, none of the data enters the database. If '--continue_on_error true' is specified, data integrity errors are ignored and offending lines are ignored. Otherwise, the import stops at the first error package and prints out the number of packages that have been imported. In this case, the user can modify the data to eliminate errors, and then use '--skip_packages N' to redo the import to skip the imported packages.
+
+## 6. Online full import
+
+Online full import can be used to import a batch of files into a running TuGraph instance. TuGraph supports importing two different types of data into the instance online:
+1. Original data files of the same type as the offline import (csv, etc.)
+2. The underlying storage file of TuGraph is the data.mdb file. This file can be generated by offline import, or it can be a file of other TuGraph db.
+The applicable scenarios of these two methods are different. The first method is to directly import data into TuGraph. The advantage is that it is automatically imported at one time and the operation steps are simple. However, an offline import thread will be started on the server side, which is only suitable for small-scale data import in a stand-alone situation. The second is to import the prepared underlying storage files into TuGraph. Although the mdb file needs to be prepared in advance, it does not have high requirements on system resources. It also supports remote download and file import, which is very convenient and suitable for high availability. Online import of schema or large-scale data.
+
+### 6.1 Import from original data
+The execution method of importing from the original data is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and The data files of the temporary db are migrated to the new subgraph, and finally the metadata of the instance is refreshed. Compared with online incremental import, online full import has higher performance. The `lgraph_import --online true --online_type 1` option enables the import tool to fully import online. Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+Online full import can be used to import a batch of files into an already running TuGraph instance. The execution method is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and stores the data in the temporary db. The files are migrated to the new subgraph, and finally the instance's metadata is refreshed. Compared with online incremental import, online full import has higher performance and is suitable for processing large-scale data. The `lgraph_import --online true --full true` option enables the import tool to fully import online.
+Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+The relevant configuration of the file is specified in the configuration file, and its format is exactly the same as in `offline mode`. However, instead of importing the data into a local database, we now import the data into a running TuGraph instance, which is typically running on a different machine than the client machine running the import tool. Therefore, we need to specify the URL, DB user and password of the remote computer's HTTP address. Moreover, the configuration file (config_file parameter) is required to be the uri path on the TuGraph instance machine, and its file configuration is also required to be the absolute path of the resource on the TuGraph instance machine.
+
+If the user and password are valid, the import tool will perform an online full import on the server side. If the graph you want to import already exists, you can use the `--overwrite true` option to force overwriting of the subgraph.
+
+### 6.2 Import from database file
+Although the full online import of original data is simple to operate and has high performance, it requires high server resources and takes a long time. A more general way is to first use offline import to import the subgraph in an empty db, obtain the data.mdb file, and then import the file into the TuGraph service online. How to use it is as follows:
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+In addition to the url, user and password parameters used in ordinary online import, the online full import method imported from a database file uses the graph parameter to specify the name of the imported subgraph, the path parameter to specify the file path, and remote to specify whether the file exists remotely or locally. If it is a local file, you need to ensure that all nodes in the HA cluster have the file in the path. If it is a remote file, it will be downloaded first and then imported. It should be noted that since there is only one copy of data.mdb, it is necessary to ensure that the environment of each node of HA and the machine where data.mdb is generated offline are completely consistent to ensure that no environmental problems will occur.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..b1ad57de6f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# Data Export
+
+> This document mainly introduces the data export function of TuGraph.
+
+## 1.Introduction
+
+TuGraph can use the tool `lgraph_export` to export data from the database that has been imported successfully. The 'lgraph_export' tool can export the data of the specified TuGraph database to the specified directory in the form of 'csv' or 'json' file, and export the configuration file 'import.config'. That required for re-importing the data.
+
+## 2.Data Export
+
+The following is an example of a command for the tool:
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+Details:
+
+- `-d {database_dir}` specifies the directory of the database from which the data will be exported. The default value is./testdb '.
+- `-e {export_destination_dir}` specifies the directory where the export file is stored. The default value is./exportdir.
+- `-g {graph_to_use}` specifies the type of graph database. default is' default '.
+- `-u {username}` Specifies the name of the user who performs the export operation.
+- `-p {password}` Specifies the password of the user who performs the export operation.
+- `-s {field_separator}` specifies the separator for the exported file. The default is comma.
+- `-f {output_format}` specifies the format of the exported data. It can be 'json' or 'csv'.
+- `-h` In addition to the specified parameters, you can also use this parameter to view the help of the tool.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..fa1839724b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,32 @@
+# Backup and Restore
+
+> This document mainly introduces the data backup and restore function of TuGraph.
+
+## 1.Data Backup
+
+TuGraph can use the 'lgraph_backup' tool to backup data.
+The 'lgraph_backup' tool can backup data from a TuGraph database to another directory. It can be used as follows:
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+Details:
+
+- `-s {source_dir}` specifies the directory where the database (source database) to be backed up resides.
+- `-d {destination_dir}` specifies the directory where the backup file (destination database) is stored.
+  If the target database is not empty, 'lgraph_backup' prompts you whether to overwrite the database.
+- `-c {true/false}` indicates whether a compaction occurs during backup.
+  Every compaction creates a tighter backup, but every compaction takes longer to create. This option defaults to 'true'.
+
+## 2.Data Restore
+
+The target database `{destination_dir}` obtained using the `lgraph_backup` tool backs up all subgraphs of the source database `{source_dir}`, but does not include the raft information of the HA cluster, thereby ensuring that the service and cluster can be successfully restarted with the backup database and the data is consistent with the source database. The following command can be used to restart the service with the backup database. When the service starts, the storage process of all subgraphs will be restored to ensure that the backup service is completely consistent with the original service.
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+Details
+
+- `-d {destination_dir}` Specify the directory where the backup file (target database) is located.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..6782a43d0e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# Data Warmup
+
+> This document mainly introduces the data Warmup function of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a disk-based database where data loaded into memory only when accessed. Therefore, for a period of time after the server just turned on, the system performance may be degraded due to frequent IO operations. At this point, we can improve this problem by data warm-up.
+
+## 2.lgraph_warmup
+
+Data warmup can be done using the tool lgraph_warmup. An example of its use is as follows:
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+Details:
+
+The - '-d {db_dir}' option specifies the data directory for the TuGraph server
+
+The - '-g {graph_list}' option specifies the names of graphs to be warmed-up, separated by commas
+
+The warm-up process takes different times depending on the data size and the type of disk being used. Preheating a large database on a mechanical disk may take a long time. Please wait patiently.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..d830586b92
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# Cluster management
+
+> This document mainly introduces the management tools of TuGraph HA cluster, including the functions of deleting nodes, leader transfer and generating snapshots.
+
+## 1 Introduction
+
+After the HA cluster is started, you can use the `lgraph_peer` tool for cluster management, which can perform functions such as deleting nodes, transferring leaders, and generating snapshots.
+
+## 2. Delete node
+
+For nodes in the TuGraph HA cluster that are offline for a long time or have network partitions, you can use the `remove_peer` command of `lgraph_peer` to delete the node. An example command is as follows:
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command remove_peer` specifies that the operation to be performed is remove_peer, that is, delete the node.
+- `--peer {peer_id}` specifies the rpc network address of the node to be deleted, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 3. leader transfer
+
+When you need to shut down or restart the master node, in order to reduce the unserviceable time of the cluster, you can use the `transfer_leader` command of `lgraph_peer` to transfer the master node. An example command is as follows:
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command transfer_leader` specifies that the operation to be performed is transfer_leader, that is, transferring the master node.
+- `--peer {peer_id}` specifies the rpc network address to become the master node, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 4. Generate snapshot
+
+For reasons such as setting ha_snapshot_interval_s to -1 when the node starts so that snapshots are not taken by default or other reasons,
+when you need to tell a node generate a snapshot, you can use the `snapshot` command of `lgraph_peer`. An example command is as follows:
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+in:
+
+- `--command snapshot` specifies that the operation to be performed is snapshot, that is, generating a snapshot.
+- `--peer {peer_id}` specifies the rpc network address of the node to generate a snapshot, such as `127.0.0.1:9092`.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..dd74d08869
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,145 @@
+# Tugraph CLI
+
+> This document mainly introduces the CLI tool lgraph_cypher of TuGraph.
+
+## 1.Instructions
+
+The TuGraph release comes with a query client named 'lgraph_cypher' that can be used to submit OpenCypher requests to the TuGraph server. The 'lgraph_cypher' client has two execution modes: single command mode and interactive mode.
+
+## Single command mode
+
+In single-command mode, 'lgraph_cypher' can be used to submit a single Cypher query and print the result directly to the terminal. The printed result can also be easily redirected to a specified file. This is handy when users need to get a lot of results from the server and save them in files.
+
+In this mode, the 'lgraph_cypher' tool has the following options:
+
+### Command line Parameters:
+
+| Parameter | Type   | Instructions                                                                                                                                                                                                                           |
+| --------- | ------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| --help    | \\     | List all parameters and descriptions.                                                                                                                                                                                                  |
+| -example  | \\     | List the command instances.                                                                                                                                                                                                            |
+| -c        | string | A database configuration file used to obtain ip and port information.                                                                                                                                                                  |
+| -h        | string | Database server IP address. Omit this parameter if you have a configuration file. The default value is' 127.0.0.1 '                                                                                               |
+| -p        | string | Database server port. Omit this parameter if you have a configuration file. The default value is 7071                                                                                                                                  |
+| -u        | string | User name for logging in to the database.                                                                                                                                                                                              |
+| -P        | string | Password for logging in to the database.                                                                                                                                                                                               |
+| -f        | string | Contains the path to a single Cypher query single text file.                                                                                                                                                                           |
+| -s        | string | Single-line cypher query command. Start and end with `"`.                                                                                                                                                                              |
+| -t        | int    | Specifies the server timeout threshold for cypher queries. The default value is 150 seconds.                                                                                                                                           |
+| -format   | string | Query result display mode. Supports two formats: 'plain' and 'table'. The 'plain' format prints the query results in a single column. The 'table' format displays the query results in a tabular format. The default value is' table ' |
+
+### Examples:
+
+**cypher command file query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+
+```
+
+**cypher command single-sentence query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+
+```
+
+## Interactive mode
+
+'lgraph_cypher' can also be run in interactive mode. In interactive mode, the client stays connected to the server and interacts with the user in read-evaluate-print-loop.
+
+### Enter lgraph_cypher interaction mode:
+
+If no '-f' or '-s' command line option added, 'lgraph_cypher' will enter interactive mode when running. how to use it:
+
+```
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+
+```
+
+If the login is successful, the corresponding login success message will be displayed:
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2018 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+Now we also provide an interactive shell for users to enter Cypher queries or use the ':help' command to check for available commands.
+
+### Command Description
+
+In addition to the Cypher query, the shell of 'lgraph_cypher' accepts the following commands:
+
+| Command                  | Parameters                                         | instructions                                                                                                                                              |
+| ------------------------ | -------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                                 | Displays the server information and the corresponding description of all commands.                                                                        |
+| :db_info                 | \\                                                 | Query the current server status. /db/info for the corresponding REST API.                                                                                 |
+| :clear                   | \\                                                 | Clear the screen.                                                                                                                                         |
+| :use                     | {Graph Name}                                       | The graph specified with this name defaults to `default`                                                                                                  |
+| :source                  | `-t {Query the timeout value} -f {The query file}` | cypher command file query in interactive mode. The default timeout threshold is 150 seconds. Query file format reference No interactive query parameters. |
+| :exit                    | \\                                                 | Exit interactive mode and return to the original command line.                                                                                            |
+| :format                  | `plain` or `table`                                 | Change the display mode of cypher query results. Support 'plain' and 'table' modes.                                                                       |
+| :save all/command/result | `-f {The file path}` `{Cypher}`                    | The cypher command (command), query result (result) or both (all) are stored. The default location is' /saved_cypher.txt '                                |
+
+**Note:**
+
+- Each command should start with a colon `:`.
+
+**:save command example :**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+
+```
+
+### cypher query command:
+
+In interactive mode, users can also directly input a single sentence cypher command for query, with "'; ` "end. Enter commands that are case insensitive. Here's an example:
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher` supports multi-line input when typing commands. Users can use the `ENTER` key to type long query statements into multiple lines. In the case of multi-line input, the beginning of the command line will change from `>` to `=>`, and the user can continue to type the rest of the query.
+
+Example:
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### Auxiliary Features:
+
+**Input History:** Press the up and down arrow keys in interactive mode to display the input history.
+
+**Auto Completion:** lgraph_cypher will automatically complete based on the input history. In the event of a completion prompt, pressing the right arrow key will automatically complete the command.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..bee9d4c8df
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,440 @@
+# TuGraph DataX
+
+> This document mainly introduces the installation, compilation and usage examples of TuGraph DataX
+
+## 1.Introduction
+
+On the basis of Ali's open source DataX, TuGraph implements the support of writing plug-ins and jsonline data format, and other data sources can write data into TuGraph through DataX.
+TuGraph DataX introduces [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX), Supported features include:
+
+- Import TuGraph from various heterogeneous data sources such as MySQL, SQL Server,Oracle, PostgreSQL, HDFS, Hive, HBase, OTS, ODPS, Kafka and so on. 
+  
+- Import TuGraph to the corresponding target source (to be developed).
+
+Reference for DataX Original Project Introduction [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.Compile and Install
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+The compiled DataX file is in the target directory
+
+## 3.Text data imported into TuGraph with DataX
+
+Using the data from the lgraph_import section of the TuGraph manual as an example, we have three csv data files, as follows:
+`actors.csv`
+
+```
+
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+
+```
+
+`movies.csv`
+
+```
+
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+
+```
+
+`roles.csv`
+
+```
+
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+
+```
+
+Then create three DataX job profiles:
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`/lgraph_server -c lgraph_standalone.json -d 'run'` 'Start TuGraph and run the following commands in sequence:
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## MySQL's data imported into TuGraph with DataX
+
+We create the following table of movies under 'test' database
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+Insert some data into the table
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+Create a DataX job configuration file
+
+`job_mysql_to_tugraph.json`
+
+**Configuring Field**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**Write simple sql**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` Start TuGraph and run the following command：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..a01cf32e66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph Explorer
+
+> TuGraph Explorer has merged to [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..8519247cc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Utility Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..8ebe10da56
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/1.python-client.md
@@ -0,0 +1,222 @@
+# TuGraph Python SDK
+
+> This document is the usage instruction of TuGraph Python SDK
+
+## 1.Overview
+There are two kinds of Python's TuGraph Client. One is the RESTful Client, which uses the HTTP method to send requests to the server. The other is the RPC Client, which uses the RPC method to call the server remote service. Both have their own advantages and disadvantages. The RESTful client is simple to use. You can find the source code file of the Client in the src/client/python/TuGraphClient directory of the project. You can install it directly into the user environment and use it. However, it supports fewer functions and its performance is not high. RPC Client supports both stand-alone servers and high-availability clusters and load balancing. It has many interfaces and powerful functions. However, the usage is more complicated. Users need to compile the TuGraph project themselves to obtain liblgraph_client_python.so, or directly find the dependent library in the /usr/local/lib64 directory when using the runtime image, and introduce it into the python project for normal use. Next, the usage of these two Clients will be introduced in detail.
+
+## 2.RESTful Client
+
+### 2.1. Install Client
+
+TuGraph's Python RESTful client uses the setuptools tool for packaging and distribution. Users can install the client directly into the local environment and introduce it directly when using it.
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+Note: When using the setuptools tool to install the python client, dependencies such as httpx will be installed and need to be executed in an environment with external network access.
+
+### 2.2.Call cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.Call stored procedure
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python's TuGraph Rpc Client is a CPP Client SDK packaged using pybind11. The following table lists the correspondence between Python and CPP Client SDK.
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+The use of Python RPC Client is more complicated. Users can compile TuGraph in the local environment to get liblgraph_client_python.so, or they can use the official runtime image. The dependent library can be found directly in the /usr/local/lib64 directory in the image. It can be used after introducing the user project.
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.Instantiate the client object
+
+#### 3.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+
+#### 3.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 3.2.Call cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.3.Send cypher request to leader
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.4.Call GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.5.Send GQL request to leader
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.6.Calling stored procedures
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.7.Call the stored procedure to the leader
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 3.8.Load stored procedure
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 3.9.List stored procedures
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.10.Delete stored procedures
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 3.11.Import schema from byte stream
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.12.Import edge data from byte stream
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 3.13.Import schema from file
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.14.Import point and edge data from file
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..260a8c6c29
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,339 @@
+# TuGraph C++ SDK
+
+> This document is the usage instruction of TuGraph C++ SDK
+
+## 1.Instructions
+
+C++ Client can use RPC to connect to lgraph_server to import data, execute stored procedures, call Cypher and other operations.
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+#### 2.1.1. Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2. Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3. Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.3. Send cypher request to leader
+```C++
+     std::string str;
+     bool ret = client.CallCypherToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0);
+     @param [out] result The result.
+     @param [in] cypher inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```C++
+     std::string str;
+     bool ret = client.CallGql(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGql(std::string& result, const std::string& gql,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0, const std::string& url = "");
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @param [in] url (Optional) Node address of calling gql.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.5. Send GQL request to leader
+```C++
+     std::string str;
+     bool ret = client.CallGqlToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGqlToLeader(std::string& result, const std::string& gql,
+                  const std::string& graph = "default", bool json_format = true,
+                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```C++
+     std::string str;
+     bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedure(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true,
+                        const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] url (Optional) Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```C++
+     std::string str;
+     bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true);
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+
+### 2.8. Load stored procedure
+```C++
+     std::string str;
+     bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+     bool LoadProcedure(std::string& result, const std::string& source_file,
+                        const std::string& procedure_type, const std::string& procedure_name,
+                        const std::string& code_type, const std::string& procedure_description,
+                        bool read_only, const std::string& version = "v1",
+                        const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] source_file the source_file contain procedure code.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] code_type code type, currently supported PY, SO, CPP, ZIP.
+     @param [in] procedure_description procedure description.
+     @param [in] read_only procedure is read only or not.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```C++
+     std::string str;
+     bool ret = client.ListProcedures(str);
+```
+```
+     bool ListProcedures(std::string& result, const std::string& procedure_type,
+                         const std::string& version = "any",
+                         const std::string& graph = "default", const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type (Optional) the procedure type, "" for all procedures,
+                                  CPP and PY for special type.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] url Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, the request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```C++
+     std::string str;
+     bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+     bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                          const std::string& procedure_name, const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```C++
+     std::string str;
+     bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+     bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                  const std::string& graph = "default", bool json_format = true,
+                                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema the schema to be imported.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```C++
+     std::string str;
+     ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+     bool ImportDataFromContent(std::string& result, const std::string& desc,
+                                const std::string& data, const std::string& delimiter,
+                                bool continue_on_error = false, int thread_nums = 8,
+                                const std::string& graph = "default", bool json_format = true,
+                                double timeout = 0);
+     @param [out] result The result.
+     @param [in] desc data format description.
+     @param [in] data the data to be imported.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+     bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema_file the schema_file contain schema.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+     bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                             const std::string& delimiter, bool continue_on_error = false,
+                             int thread_nums = 8, int skip_packages = 0,
+                             const std::string& graph = "default", bool json_format = true,
+                             double timeout = 0);
+     @param [out] result The result.
+     @param [in] conf_file data file contains format description and data.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] skip_packages (Optional) skip packages number.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..1c560141d3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/3.java-client.md
@@ -0,0 +1,289 @@
+# TuGraph Java SDK
+
+> This document primarily provides usage instructions for the TuGraph Java SDK. It is crucial to note that the TuGraph Java SDK will no longer receive updates or maintenance in the future. Users are strongly advised to utilize [bolt](./5.bolt-client.md) instead.
+
+## 1.Compile java client code
+
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Adding maven dependencies
+
+```xml
+<dependency>
+    <groupId>com.antgroup.tugraph</groupId>
+    <artifactId>tugraph-db-java-rpc-client</artifactId>
+    <version>1.4.1</version>
+</dependency>
+```
+
+Introduce dependencies
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.3. Send cypher request to leader
+```java
+     String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param cypher: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```java
+     String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @param url: (Optional) Node address of calling GQL
+     @return: the result of GQL query execution
+     public String callGql(String gql, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.5. Send GQL request to leader
+```java
+     String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```java
+     String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @param url: (Optional) Node address of calling procedure
+     @return: the result of procedure execution
+     public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph, String url)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```java
+     String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedureToLeader : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @return: the result of procedure execution
+     public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 2.8. Load stored procedure
+```java
+     boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param sourceFile: the source_file contains procedure code
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param codeType: code type, currently supported PY, SO, CPP, ZIP
+     @param procedureDescription: procedure description
+     @param readOnly: procedure is read only or not
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                               String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```java
+     String result = client.listProcedures("CPP", "any", "default");
+     log.info("listProcedures : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @param url: (Optional) Node address of listing procedure
+     @return: the list of procedures
+     public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```java
+     String result = client.deleteProcedure("CPP", "sortstr", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```java
+     boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+     log.info("importSchemaFromContent : " + ret);
+```
+```
+     @param schema: the schema to be imported
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```java
+     boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+     log.info("importDataFromContent : " + ret);
+```
+```
+     @param desc: data format description
+     @param data: the data to be imported
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+             int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```java
+     boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+     log.info("importSchemaFromFile : " + ret);
+```
+```
+     @param schemaFile: the schema_file contains schema
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromFile(String schemaFile, String graph, double timeout)
+             throws UnsupportedEncodingException, IOException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```java
+     boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+     log.info("importDataFromFile : " + ret);
+```
+```
+     @param confFile: data file contains format description and data
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param skipPackages: skip packages number
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+             int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..1a778b73ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,176 @@
+# TuGraph-OGM
+
+@TODO
+
+## 1.Introduction
+
+> TuGraph-OGM project is open source on other repositories.
+
+TuGraph-OGM (Object Graph Mapping) is a graph object mapping tool designed for TuGraph. It supports the mapping of Java objects (POJO) into TuGraph. The classes in Java are mapped to nodes in the graph, the collections in the classes are mapped to edges, and the properties of the classes are mapped to the attributes of the graph objects. It also provides corresponding functions to manipulate the graph database. Therefore, Java developers can easily use TuGraph database in the familiar ecosystem. TuGraph-OGM is also compatible with Neo4j-OGM. Neo4j ecosystem users can migrate seamlessly to TuGraph database.
+
+### 1.1.Functions of TuGraph-OGM
+
+TuGraph-OGM provides the following functions for operating TuGraph:
+
+| Function                            | Usage                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| Insert single vertex/edge                 | void session.save(T object)                                                      |
+| Batch insert vertexs/edges                 | void session.save(T object)                                                      |
+| Delete vertex and its corresponding edges                | void session.delete(T object)                                                    |
+| Delete all vertexs with specific label       | void session.deleteAll(Class\<T> type)                                           |
+| Clear the database                      | void purgeDatabase()                                                             |
+| Update vertex                        | void session.save(T newObject)                                                   |
+| Query single node by id            | T load(Class<T> type, ID id)                                                     |
+| Query multiple nodes by ids           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| Query all nodes with specific label         | Collection\<T> loadAll(Class\<T> type)                                           |
+| Query with conditions                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher query (specify the return type) | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher query                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.Compile TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.Use TuGraph-OGM
+
+Please refer to the detailed examples in TuGraphOGMDemo under the demo folder.How to import dependencies in `pom.xml`.
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // create Movie vertex
+    @Id
+    private Long id;      // Movie id
+    private String title; // title attribute
+    private int released; // released attribute
+
+    // create Edge ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // create Actor vertex
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// configuration
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//Start driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// Open session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.Perform CRUD operations through OGM
+
+```java
+// new
+Movie jokes = new Movie("Jokes", 1990);  // Create Movie-vertex "jokes"
+session.save(jokes);                     // Store "jokes" in TuGraph
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // Connect the "speed" vertex with the "alice" vertex through the ACTS_IN relationship
+session.save(speed);                    // Store two vertexs and one edge
+
+// delete
+session.delete(alice);                  // Delete the "alice" vertex and its connected edge
+Movie m = session.load(Movie.class, jokes.getId());   // Get the "jokes" vertex based on its id
+session.delete(m);                                    // Delete the "jokes" node
+
+// update
+speed.setReleased(2018);
+session.save(speed);                   // Update the "speed" attribute
+
+// get
+Collection<Movie> movies = session.loadAll(Movie.class);  // Get all Movie vertexs
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // Query all movies released before 1995
+
+// Call Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // Query the Movie with "Speed" of 2018
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // Create vertex label "Director"
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // Create edge label "DIRECT"
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // Get the create result
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // View the number of vertexs created
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //View the number of edges created
+
+// Clear the database
+session.deleteAll(Movie.class);        // Delete all Movie vertexs
+session.purgeDatabase();               // Delete all data
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..7861c59a9b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,74 @@
+
+# Bolt client
+
+TuGraph implements Neo4j's bolt protocol, you can use Neo4j's client to access TuGraph.
+
+## Enable bolt port
+
+The Bolt port is enabled by default on port 7687. If you need to change the port, you can do so in the configuration file. For services deployed using the Docker method, the configuration file is located within the container at `/usr/local/etc/lgraph.json`; for services deployed using the RPM package, the configuration file is on the server at `/usr/local/etc/lgraph.json`. To apply the port change, you will need to restart the service. Specific instructions for restarting the service can be found in [Tugraph Running](../../5.installation&running/7.tugraph-running.md). Additionally, for a detailed explanation of the configuration options available in the configuration file, see the "Configuration parameters" section in [Tugraph Running](../../5.installation&running/7.tugraph-running.md).
+
+## Use case example
+
+Add Maven dependency
+
+```xml
+<dependency>
+    <groupId>org.neo4j.driver</groupId>
+    <artifactId>neo4j-java-driver</artifactId>
+    <version>4.4.2</version>
+</dependency>
+```
+
+Instantiate the client as follows:
+
+```java
+    Driver driver = GraphDatabase.driver("bolt://ip:port", AuthTokens.basic("admin", "73@TuGraph"));
+```
+
+Common statements:
+
+```java
+        //Create a session through the driver object, setting the session to connect to a specific database, to execute Cypher statements.
+        Session session = driver.session(SessionConfig.forDatabase("default"));
+        //Clear the graph project, please do not attempt this lightly as it will delete both the schema and data of the selected graph project.
+        session.run("CALL db.dropDB()");
+        //Create vertex
+        session.run("CALL db.createVertexLabel('person', 'id' , 'id' ,INT32, false, 'name' ,STRING, false)");
+        //Create edge
+        session.run("CALL db.createEdgeLabel('is_friend','[[\"person\",\"person\"]]')");
+        //Create index
+        session.run("CALL db.addIndex(\"person\", \"name\", false)");
+        //Insert vertex data
+        session.run("create (n1:person {name:'jack',id:1}), (n2:person {name:'lucy',id:2})");
+        //Insert edge data
+        session.run("match (n1:person {id:1}), (n2:person {id:2}) create (n1)-[r:is_friend]->(n2)");
+        //Query vertices and edges
+        Result res = session.run("match (n)-[r]->(m) return n,r,m");
+        //Parameterized Query
+        String cypherQuery = "MATCH (n1:person {id:$id})-[r]-(n2:person {name:$name}) RETURN n1, r, n2";
+        Result result1 = session.run(cypherQuery, parameters("id", 1, "name", "lucy"));
+        while (result1.hasNext()) {
+        Record record = result1.next();
+        System.out.println("n1: " + record.get("n1").asMap());
+        System.out.println("r: " + record.get("r").asMap());
+        System.out.println("n2: " + record.get("n2").asMap());
+                }        
+        //Delete vertex data
+        session.run("match (n1:person {id:1}) delete n1");
+        //Delete edge data
+        session.run("match (n1:person {id:1})-[r]-(n2:person{id:2}) delete r");
+        //Delete edge
+        session.run("CALL db.deleteLabel('edge', 'is_friend')");
+        //Delete vertex
+        session.run("CALL db.deleteLabel('vertex', 'person')");
+```
+
+Details on the use of Cypher and stored procedures can be found in [Cypher](../../8.query/1.cypher.md)
+
+## Limitations on use
+
+Currently, our system does not fully support all advanced features of the Neo4j Bolt protocol. In particular, immediate transaction processing and flexible weak schema, two unique capabilities of the Neo4j client, are not yet supported. Therefore, when using the client, please make sure to avoid operations that involve these features to ensure smooth running of the application and consistency of data.
+
+## Example of Client Usage
+
+In the code directory under demo/Bolt, there are examples in Golang, JavaScript, Java, JavaScript, Python, and Rust. To learn more, see [Example of Client Usage](https://github.com/TuGraph-family/tugraph-db/tree/master/demo)
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..3ba53fb6f5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,107 @@
+# TuGraph console client
+
+`lgraph_cli` is a console client based on the bolt protocol, written in c++, which requires a connection to tugraph's bolt port.
+
+`lgraph_cypher` is a console client based on http, written in python, which requires a connection to tugraph's http port.
+
+`lgraph_cypher` needs some python libraries to be installed.
+
+`lgraph_cli` is a binary executable file that has no dependencies on other dynamic libraries and can be executed by copying it to a linux server.
+
+## `lgraph_cli`
+
+The statement ends with a semicolon, type `exit`, `quit` or Ctrl-C to exit the client.
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+The statement can be inputed on more than one line.
+
+```
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+non-interactive
+
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+read statements from file
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## online export
+
+lgraph_cli supports streaming read, so just redirect the output to a file. The output format supports csv and json
+
+### csv
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..b5679e97fd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,341 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+## 2.Request And Response Format
+Tugraph HTTP Server receives requests in json format，After authentication, fields in the request are extracted, the request is processed according to the defined interface logic, and the response in json format is returned.
+
+### 2.1.Standard Response Format
+Each response is returned in the standard response format, as follows：
+
+| body parameter  | parameter description  | parameter type | necessary |
+|--------------|------------------------|----------|-----------|
+| errorCode    | error code             | int      | yes       |
+| success      | Whether the request was successful | int      | yes       |
+| errorMessage | error message          | string   | yes         |
+| data         | the response information returned when the request is successful | json string | yes         |
+
+### 2.2. Request Type
+
+#### 2.2.1. User Login
+The user sends the login request to the server with the user name and password. After successful login, the client receives a signed token (the Json Web Token) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token stored by the client and added to the Authorization domain of the request header in subsequent requests. If the login fails, you will receive the Authentication failed error.
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary       |
+| ------- |-----------------------|-------|------------|
+| userName   | name of the user      | string   | yes          |
+| password   | password of the user  | string | yes          |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00 and the token will be included in data
+
+| body parameter  | parameter description  | parameter type   | necessary |
+| ------- |-------|--------|------|
+| authorization   | token | string | yes  |
+| default_password  | whether the password is the default password | bool | yes  |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. User Logout
+When a user logs out, the authenticated token is deleted. and the user needs to log in again to obtain a new token when sending subsequent requests.
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and data is empty
+
+#### 2.2.3. Refresh Token
+If the delivered token becomes invalid, you need to invoke this interface for re-authentication. The token is valid within one hour after the first login and needs to be refreshed
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+The http request header carries the token returned by login interface, and the body has no parameters
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the token will be included in data
+
+| body parameter  | parameter description | parameter type | necessary       |
+| ------- |------|----------------|------------|
+| authorization   | token  | string         | yes          |
+
+#### 2.2.4. Call Cypher
+User manipulation of data and models in tugraph requires calling the cypher interface and is initiated through the standard cypher query language
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------------------|---------|-----------|
+| graph   | the name of the subgraph to be queried | string  | yes       |
+| script   | query statement  | string  | yes         |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00, and the query results will be included in data
+
+| body parameter  | parameter description | parameter type | necessary    |
+| ------- |------|----------------|------------|
+| result   | query results | json string    | yes          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. Upload File
+This interface is used to upload local files to the TuGraph machine. You can upload text/binary files, large files, and small files. For large files, the client must split the files, and each file fragment must not be larger than 1MB. Parameters Begin-Pos and Size correspond to the offset and fragment size of this fragment in the complete file. The parameter must be placed in the header of the http request, and the request body contains only the file fragment content. The request header of this interface contains more than token parameters
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header parameter | parameter description                | parameter type | necessary |
+|------------------|--------------------------------------|---------|-------|
+| File-Name        | the name of the file                 | string  | yes   |
+| Begin-Pos        | Offset of the start position of the current file fragment within the file | string  | yes   |
+| Size             | the current file fragment size       | string | yes   |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+#### 2.2.6. Check File
+this interface is used to check the correctness of uploaded files. If the check succeeds, the system returns a success message when the same file is uploaded again
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description       | parameter type | necessary |
+| ------- |-----------------------------|----------------|-----------|
+| fileName   | the name of the file        | string         | yes       |
+| checkSum   | the checksum of the file    | string  | yes when flag set to "1" |
+| fileSize   | the size of the file        | string  | yes when flag set to "2" |
+| flag   | If flag is "1", check md5. If flag is "2"，check file size | string  | yes       |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------|------|------|
+| pass   | true on success, false otherwise | bool | yes  |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. Delete Cached File
+The admin user can delete all the files uploaded by anyone. Other users can delete their own files. You can delete a file with a specified name, a file uploaded by a specified user, or all files
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type  | necessary |
+| ------- |-----------------------|--------|--------|
+| fileName   | the name of the file  | string | yes when flag set to "0" |
+| userName   | the name of the user  | string | yes when flag set to "1" |
+| flag   | When flag is set to 0, the file specified by fileName is deleted; when flag is set to 1, all files uploaded by userName are deleted; when flag is set to 2, all files are deleted | string | yes    |
+
+- **RESPONSE**:
+If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. Import Schema
+This interface can create a schema model based on the schema information specified by description parameter. For details about the schema format, refer to data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |-----------------------|----------------|-----------|
+| graph   | name of the subgraph  | string         | yes       |
+| description   | schema infomation     | json string    | yes         |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. Import Data
+This interface allows users to specify uploaded and verified files as data files and import them to the subgraph specified by the graph parameter. The import process is asynchronous, and the server returns a task id after receiving the import request
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description     | parameter type | necessary |
+| ------- |---------------------------|--------|-----|
+| graph   | name of the subgraph      | string | yes |
+| schema   | schema infomation         | json string | yes |
+| delimiter   | column delimiter          | string | yes |
+| continueOnError   | Whether to skip the error and continue when an error occurs | boolean | no  |
+| skipPackages   | number of packets skipped | string | no  |
+| taskId   | used to restart the failed task | string | no  |
+| flag   | If flag is set to 1, the data file is deleted after the import is successful | string | no  |
+| other   | other parameter           | string | no  |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                 | parameter type   | necessary       |
+| ------- |---------------------------------------|--------|------------|
+| taskId   | task id is used to find a import task | string | yes          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. Import Progress Query
+This interface is used to query the execution progress of a import task
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter  | parameter description                     | parameter type    | necessary |
+| ------- |-------------------------------------------|---------|----|
+| taskId   | task id returned by import_data interface | string | 是 |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00
+
+| body parameter  | parameter description                | parameter type | necessary |
+| ------- |--------------------------------------|----------------|-----------|
+| success   | 	whether import is successful        | boolean        | yes       |
+| reason   | 	reason of the import failure        | string         | yes if success is false      |
+| progress   | 	import progress at the current time | string         | yes       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..911de26909
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,269 @@
+# RPC API
+
+> This document mainly introduces the details of calling TuGraph's RPC API.
+
+## 1.Introduction
+
+TuGraph provides rich RPC APIs for developers to remotely call the services provided by TuGraph through RPC requests.
+
+RPC (Remote Procedure Call) is a protocol for requesting services from remote computer programs through a network without the need to understand the underlying network technology.
+Compared with REST, RPC is method-oriented and mainly used for calling function methods. It is suitable for more complex communication scenarios and has higher performance.
+brpc is an industrial-grade RPC framework written in C++. Based on brpc, TuGraph provides rich RPC APIs. This document describes how to use TuGraph's RPC API.
+
+## 2.Request
+
+### 2.1.Establishing a Connection
+
+When developers send RPC requests to TuGraph services, they must first establish a connection. Taking C++ as an example, developers create a channel with the specified URL and create a specified service stub (LGraphRPCService_Stub) from the channel. Subsequently, they can send requests to the remote server through the stub like calling local methods.
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.Request Types
+
+TuGraph supports 10 types of RPC requests, and each request's functionality is shown in the following table:
+
+| Request              | Functionality         |
+|-----------------|------------|
+| GraphApiRequest | Vertex-Edge Index   |
+| CypherRequest   | cypher   |
+| PluginRequest   | Stored Procedures     |
+| HARequest       | High Availability    |
+| ImportRequest   | Data Import     |
+| GraphRequest    | Subgraph Operations     |
+| AclRequest      | Access Control     |
+| ConfigRequest   | Configuration     |
+| RestoreRequest  | Backup       |
+| SchemaRequest   | Schema Management |
+
+When a user sends a request, the following parameters need to be passed in:
+- client_version: an optional parameter, in HA mode, it can prevent outdated responses by comparing `client_version` and `server_version`
+- token: a necessary parameter, the client obtains the token after logging in, and the token is passed in with each request to verify the user's identity
+- is_write_op: an optional parameter, indicating whether the request is a write request
+- user: an optional parameter, set user when synchronizing requests between master and slave in HA mode, and no token verification is required After the service processes the RPC request, it sends back a response.
+
+In addition to containing separate response information for each request, the response message also includes the following parameters:
+- error_code: a necessary parameter, indicating the processing status of the request
+- redirect: an optional parameter, when processing fails to send a write request to a follower in HA mode, set redirect as the request forwarding address, that is, the leader address
+- error: an optional parameter, indicating the error information of the request
+- server_version: an optional parameter, set `server_version` in the HA mode request response to avoid reverse time travel when client reads data
+
+:warning:  **Except for CypherRequest, PluginRequest, HARequest and AclRequest, all other RPC interfaces will be gradually deprecated, and their functions will be unified into the CypherRequest interface.**
+
+## 3.Login
+
+The login request message contains the following parameters:
+- user: a necessary parameter, the username
+- pass: a necessary parameter, the password
+
+Taking C++ as an example, the user sends a login request using the constructed service stub:
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+The login response message contains the following parameters:
+- token: a necessary parameter. After successful login, a signed token, namely Json Web Token, will be received. The client stores the token and uses it for each subsequent request. If the login fails, an "Authentication failed" error will be received.
+
+## 4.Query
+Users can interact with TuGraph through Cypher queries. The Cypher request message contains the following parameters:
+- query: a necessary parameter, the Cypher query statement
+- param_names: an optional parameter, the parameter name
+- param_values: an optional parameter, the parameter value
+- result_in_json_format: a necessary parameter, whether to return the query results in JSON format
+- graph: an optional parameter, the subgraph name for executing the Cypher statement
+- timeout: an optional parameter, the timeout for executing the Cypher statement
+
+Taking C++ as an example, the user sends a Cypher request as follows:
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+The Cypher request response contains one of the following two parameters:
+- json_result: the Cypher query result in JSON format
+- binary_result: the Cypher query result in the CypherResult format
+
+## 5.Stored Procedures
+To meet users' more complex query/update logic, TuGraph supports stored procedures written in C and Python. Users can use RPC requests to perform CRUD operations on stored procedures.
+
+### 5.1.Load Stored Procedures
+The request for loading stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- read_only: a necessary parameter, whether it is read-only
+- code: a necessary parameter, the ByteString generated by reading the stored procedure file
+- desc: an optional parameter, the stored procedure description
+- code_type: an optional parameter, the stored procedure code type, which can be PY, SO, CPP, or ZIP
+
+Taking C++ as an example, the user loads the stored procedure as follows:
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for loading the stored procedure does not contain parameters, and if the loading fails, a BadInput exception will be thrown.
+
+### 5.2.Invoke Stored Procedures
+
+The request for invoking stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- param: a necessary parameter, the stored procedure parameters
+- result_in_json_format: an optional parameter, whether to return the invocation result in JSON format
+- in_process: an optional parameter, to be supported in the future
+- timeout: an optional parameter, the timeout for invoking the stored procedure
+
+Taking C++ as an example, the user invokes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+The response for invoking the stored procedure contains one of the following two parameters:
+- reply: the stored procedure invocation result in the ByteString format
+- json_result: the stored procedure invocation result in JSON format
+
+### 5.3.Delete Stored Procedures
+
+The request for deleting stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+
+Taking C++ as an example, the user deletes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for deleting the stored procedure does not contain parameters, and if the deletion fails, a BadInput exception will be thrown.
+
+### 5.4.List Stored Procedures
+
+The request for listing stored procedures does not require parameters. Taking C++ as an example, the user lists the stored procedures as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+The response for listing the stored procedures contains the following parameter:
+- reply: the procedure list in JSON format
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..3ecfbae4cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2738 @@
+# TuGraph RESTful API Legacy
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+:warning: **All the other RESTful APIs excluding the three below will be deprived after 4/30/2023.**
+- **Login**
+- **Query**
+- **Store Procedures**
+
+## 2.Protocols And Data Format
+
+### 2.1.Protocols
+
+Both HTTP and HTTPS protocols are supported by TuGraph. The system uses HTTP protocol by default. To use HTTPS, the `ssl_auth` option should be set to `true` in the DB configuration.
+
+### 2.2.Request
+
+TuGraph supports HTTP GET/POST/PUT/DELETE requests, in which:
+
+- `GET` requests are used for read-only requests, such as getting vertex properties, edge properties, etc.
+
+- `POST` requests are used to create entities, submit Cypher, and to manage and call stored procedures;
+
+- `PUT` requests are used to modify existing entities, for example, to modify vertex properties, edge properties, etc.
+
+- `DELETE` requests are used to delete existing entities, such as vertices, edges, etc.
+
+In high-availability mode, users can set `ServerVersion` in the request header to make sure the request is never served with an outdated version.
+The current `ServerVersion` can be obtained from the header returned by the server.
+
+### 2.3.Response
+
+TuGraph returns the following HTTP status codes:
+
+- **200 OK**: operation is successful.
+- **307 Temporary Redirect**: the operation is redirected, typically in high-availability mode, to the master.
+- **400 Bad Request**: incorrect input, such as URI error, or invalid parameters.
+- **500 Internal Server Error**: server error.
+
+When the operation is successful, the JSON response contains the return value of the operation. When the operation is redirected, the `location` field in the returned HTTP header contains the redirect destination address.
+When an input error or server error occurs, the JSON response contains a `error_message` field that describes the error.
+
+In high-availability mode, the server will set `server_version` field in the header to inform the client of the data version of the current server. When clients switch between several different servers, this version number guarantees that the client will not read from an outdated server.
+
+### 2.4.Data Format
+
+The server and clients exchange data in JSON format. When sending a request, the header of the HTTP request should be set with `Accept:application/json, Content-Type:app/json`.
+For example, to create a new vertex, the request header should look like the following:
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.5.URI Format
+
+TuGraph REST API provides access to: web visualization, login, db info, label, index, node, relationship, cypher, task, cpp_plugin, and python_plugin.
+The URI format used for each function is as follows:
+
+| URI     | Description                     |
+| ------- | ------------------------------- |
+| /web    | web visualization               |
+| /cypher | cypher request                  |
+| /acl    | access control                  |
+| /user   | user management                 |
+| /login  | user login                      |
+| /info   | database status and information |
+| /task   | task management                 |
+| /db     | subgraph management             |
+
+For each subgraph, the following interfaces are provided:
+
+| URI                              | Description                         |
+| -------------------------------- | ----------------------------------- |
+| /db                              | create, modify, and delete subgraph |
+| /db/_{graph_name}_/node          | vertex operations                   |
+| /db/_{graph_name}_/relationship  | edge operations                     |
+| /db/_{graph_name}_/label         | label-related operations            |
+| /db/_{graph_name}_/index         | index-related operations            |
+| /db/_{graph_name}_/cypher        | subgraph-specific cypher operation  |
+| /db/_{graph_name}_/cpp_plugin    | C++ plugin(stored procedure)        |
+| /db/_{graph_name}_/python_plugin | Python plugin(stored procedure)     |
+| /db/_{graph_name}_/import        | online import                       |
+| /db/_{graph_name}_/misc          | other operations                    |
+
+## 3.Login
+
+The system creates an administrator by default, whose username is _admin_ and password is _73@TuGraph_. For security reasons, please remember to change your password after first starting the server.
+
+### 3.1.User Login
+
+TuGraph provides JWT-based user authentication. To log in to the server, the REST client should send a login request containing a username and password. Upon success, the client will receive a signed token in the form of a Json Web Token (JWT) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token should be stored by the client and used for each subsequent request.
+
+- **URI**: `/login`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| user     | username    | String |
+| password | password    | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+| default_password | whether it is the default password | Bool |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.Token Refresh
+
+After the token expires, the front-end initiates a refresh token interface, and the back-end verifies the validity of the token.
+If the verification passes, a new token is generated; if the verification fails, status code 401 is returned.
+
+- **URI**: `/refresh`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.Modify Token Validity Period
+
+To modify the validity period of Token, three parameters need to be transmitted: jwt, refresh_time and expire_time, among which jwt is used to verify the user’s identity. When refresh_time and expire_time are equal to 0, the validity period is indefinite. When refresh_time exceeds, you need to call the refresh interface to obtain a new Token; When expire_time expires, you need to log in again. (This interface call needs to confirm the security by itself, do not call unless necessary)
+
+- **URI**: `/update_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+| refresh_time | Valid time (deafult set to 0) | Int64 |
+| expire_time | Expire time (deafult set to 0) | Int64 |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.Query Token validity period
+To query the validity period of the Token, you need to transmit jwt to verify the user's identity, and return, refresh_time and expire_time, where refresh_time indicates the refresh time, and you need to call the refresh interface to obtain a new Token when it exceeds; expire_time indicates the expiration time, and you need to log in again when it exceeds.
+
+- **URI**: `/get_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return "refresh_time" and "expire_time".
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+### 3.5.Logout
+
+The user logs out and deletes the token at the same time.
+
+- **URI**: `/logout`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+## 4.Query
+
+URI format is:
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.Call Cypher
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description   | Type   |
+| ------ | ------------- | ------ |
+| graph  | subgraph name | String |
+| cypher | Cypher query  | String |
+
+- **RESPONSE**:
+
+| Field   | Description             | Type    |
+| ------- | ----------------------- | ------- |
+| result  | running results         | List    |
+| elapsed | running time in seconds | Float   |
+| header  | header of the results   | List    |
+| size    | number of results       | Integer |
+
+in which `header` is a list with each element in the form of:
+
+| Field | Description                                                | Type   |
+| ----- | ---------------------------------------------------------- | ------ |
+| name  | the name of column                                         | String |
+| type  | column data type, 0 is scalar, 1 is vertex id, 2 is vector |        |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.Call Cypher with Parameters
+
+Cypher supports querying with parameters. When a Cypher query with parameters is called, TuGraph caches the execution plan for that query to speed up the following queries of the same kind.
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type   |
+| ---------- | ------------- | ------ |
+| graph      | subgraph name | String |
+| cypher     | Cypher query  | String |
+| parameters | parameters    | List   |
+
+- **RESPONSE**:
+
+Same as [Call Cypher](#Call-Cypher).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+## 5.Stored Procedures
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.Create Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                                                                       | Type   |
+| ----------- | --------------------------------------------------------------------------------- | ------ |
+| name        | name of the plugin                                                                | String |
+| description | description of the plugin                                                         | String |
+| code_base64 | code of plugin encoded in base64                                                  | String |
+| read_only   | whether it is a read-only stored procedure                                        | Bool   |
+| code_type   | type of plugin code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String |
+
+_Note: read-only plugins are more efficient than write plugins. Always specify `read-only=true` for read-only transactions._
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.so}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 5.2.List Stored Procedures
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list in which each element is a plugin description, in the format of:
+
+| Field       | Description                               | Type   |
+| ----------- | ----------------------------------------- | ------ |
+| name        | name of the stored procedure              | String |
+| description | description of the stored procedure       | String |
+| read_only   | whether the stored procedure is read-only | Bool   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.Retrieve Stored Procedure Detail
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Procedure detail, including code, in the format of:
+
+| Field       | Description                                                                         | Type                   |
+| ----------- | ----------------------------------------------------------------------------------- | ---------------------- |
+| name        | Procedure name                                                                      | String                 |
+| description | Procedure descrition                                                                | String                 |
+| read_only   | Read only or not                                                                    | Bool                   |
+| code_base64 | 存储过程的代码                                                                      | String, Base64 encoded |
+| code_type   | Type of procedue code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String                 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.Call Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: POST
+
+- **REQUEST**: String input.
+
+| Field   | Description                                               | Type   |
+| ------- | --------------------------------------------------------- | ------ |
+| data    | input data                                                | String |
+| timeout | timeout in seconds, defaults to 0, which means no timeout | Float  |
+
+- **RESPONSE**:
+
+| Field  | Description     | Type   |
+| ------ | --------------- | ------ |
+| result | running results | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.Delete Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+## 6.Deprecated
+
+The APIs below will be removed after 4/30/2023.
+
+### 6.1.User Management
+
+#### 6.1.1.Add User
+
+Add a new user and set the initial password for the user. Only administrators have permission to add new users. The username can only have letters, numbers, and underscores, and should not begin with a number. The password can contain any character. The username and password have a maximum length of 64 bytes.
+
+- **URI**: `/user`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                                 | Type   |
+| -------- | ------------------------------------------- | ------ |
+| user     | username                                    | String |
+| password | password                                    | String |
+| is_admin | whether the user is an administrator or not | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "is_admin": false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.Change Password
+
+Users can change their own passwords, in which case the original password needs to be verified.
+
+Administrators can change the passwords of any user and promote non-admin users to administrators, or demote administrator users to regular users. When modifying another user's password, the original password of the user is not needed.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field            | Description                                                                     | Type   |
+| ---------------- | ------------------------------------------------------------------------------- | ------ |
+| current_password | user's current password, if modifying its own password                          | String |
+| new_password     | user's new password                                                             | String |
+| is_admin         | should this user be administrator or not, used when promoting or demoting users | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user/user1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+        "is_admin": true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.3.List All Users
+
+List all users of the database. Only administrators are allowed to perform this operation.
+
+- **URI**: `/user/`
+
+- **METHOD**: GET
+
+- **RESPONSE**: a dictionary of {`user_name`:`is_admin`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+    • 200: OK
+    Output:
+    {
+        "admin": true,
+        "guest1": false
+    }
+
+#### 6.1.4.Delete User
+
+Delete a user from the DB. Only administrators have permission to do so.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.2.Access Control
+
+TuGraph has four access levels. Different users can have different permissions for each subgraph. The four access levels are as follows:
+
+| Access Level | Description                                                                                                               |
+| ------------ | ------------------------------------------------------------------------------------------------------------------------- |
+| NONE         | no access                                                                                                                 |
+| READ         | read-only                                                                                                                 |
+| WRITE        | can read and write vertexes and edges of the subgraph                                                                     |
+| FULL         | full access, including changing metadata (label, index), managing stored procedures and deleting all data in the subgraph |
+
+Administrators have full access on all subgraphs, and a newly created non-admin user does not have access for any subgraph. Users who have full access on a subgraph can set the access level for other users on that subgraph.
+
+#### 6.2.1.Query User's Access Level
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+When both `user` and `graph` are specified, the user's access level for the subgraph is returned, such as `READ`.
+
+When only `user` is specified, all subgraphs that the user can access (access level not `NONE`) are returned, as well as the user's access level on the subgraph.
+
+When only `graph` is specified, all users who have access level on this graph (excluding administrators, who have implicit `FULL` access) and their access levels are returned. This operation requires administrator permission.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/acl/?user=user1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "graph1": "READ",
+      "graph2": "WRITE",
+      "graph3": "FULL"
+    }
+```
+
+#### 6.2.2.Change User's Access Level
+
+- **URI**: `/acl`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field | Description     | Type   |
+| ----- | --------------- | ------ |
+| user  | username        | String |
+| graph | subgraph's name | String |
+| acl   | access level    | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/acl
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "user1",
+        "graph": "graph1",
+        "acl": "FULL"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.Remove User's Access Right
+
+This is equivalent to setting access level to `NONE`.
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/acl/?user=user1&graph=graph1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.Server Status
+
+#### 6.3.1.Modify Server Configuration
+
+Modifying the server configuration will take effect immediately after the configuration modification and will affect all servers. These configurations take precedence over configuration files and command line arguments.
+
+- **URI**: `/config`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+  | Field            | Description                                           | Type |
+  | ---------------- | ----------------------------------------------------- | ---- |
+  | db_async         | Whether to enable asynchronous mode                   | Bool |
+  | optimistic_txn   | Whether to use optimistic transaction lock by default | Bool |
+  | enable_audit_log | Whether to enable audit logging                       | Bool |
+
+- **RESPONSE**: If successful, return status code 200.
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "db_async": true,
+        "enable_audit_log": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.Current Server Status
+
+- **URI**: `/info`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field          | Description                    | Type                                                                                    |
+| -------------- | ------------------------------ | --------------------------------------------------------------------------------------- |
+| lgraph_version | TuGraph version                | String                                                                                  |
+| git_branch     | server's git branch            | String                                                                                  |
+| git_commit     | server's git commit version    | String                                                                                  |
+| web_commit     | web client commit version      | String                                                                                  |
+| cpp_id         | cpp compiler id                | String                                                                                  |
+| cpp_version    | cpp compiler version           | String                                                                                  |
+| python_version | python lib version             | String                                                                                  |
+| cpu            | cpu information                | Dictionary, format refers [CPU Status](#CPU-Status)                                     |
+| disk           | disk IO information            | Dictionary, format refers [Disk Status](#Disk-Status)                                   |
+| memory         | memory information             | Dictionary, format refers [Memory Status](#Memory-Status)                               |
+| db_space       | graph database storage         | Dictionary, format refers [Graph Database Storage](#Graph-Database-Storage)             |
+| db_config      | graph database configuration   | Dictionary, format refers [Graph Database Configuration](#Graph-Database-Configuration) |
+| up_time        | database's online running time | Integer                                                                                 |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.CPU Status
+
+- **URI**: `/info/cpu`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description        | Type    |
+| ------ | ------------------ | ------- |
+| self   | TuGraph CPU usage  | Integer |
+| server | server's CPU usage | Integer |
+| unit   | metric unit        | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.Disk Status
+
+- **URI**: `/info/disk`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description              | Type    |
+| ----- | ------------------------ | ------- |
+| read  | server's disk read rate  | Integer |
+| write | server's disk wrtie rate | Integer |
+| unit  | metric unit              | String  |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.Memory Status
+
+- **URI**: `/info/memory`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description               | Type    |
+| ------------ | ------------------------- | ------- |
+| self         | TuGraph memory usage      | Integer |
+| server_avail | server's available memory | Integer |
+| server_total | server's total memory     | Integer |
+| unit         | metric unit               | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.Database Size
+
+- **URI**: `/info/db_space`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                | Type    |
+| ----- | -------------------------- | ------- |
+| space | total size of the database | Integer |
+| unit  | metric unit                | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.DB Configuration
+
+- **URI**: `/info/db_config`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description                                       | Type    |
+| ------------ | ------------------------------------------------- | ------- |
+| async        | asynchronous mode                                 | Bool    |
+| disable_auth | whether to disable authentication                 | Bool    |
+| enable_ha    | whether to enable high-availability mode          | Bool    |
+| enable_rpc   | whether to enable RPC server                      | Bool    |
+| host         | bound host address                                | String  |
+| port         | port of REST server                               | Integer |
+| rpc_port     | port of RPC server                                | Integer |
+| thread_limit | limit of available threads for the graph database | Integer |
+| use_ssl      | whether to use SSL for authentication             | Bool    |
+| verbose      | verbose level of the output                       | Integer |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "host":"127.0.0.1",
+      "port":7070,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "use_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.7.High Availability Server List
+
+Get a list of replication servers. Valid only in high-availability mode.
+
+- **URI**: `/info/peers`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of server information, each of server information is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+| state        | server state          | String |
+
+The server state can be `MASTER`, `SLAVE`, or `OFFLINE`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.8.Current Leader Information
+
+Get information of current leader. Valid only in HA mode.
+
+- **URI**: `/info/leader`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current leader server information, which is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.9.Server Statistics
+
+- **URI**: `/info/statistics`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current server statistics, which is formatted as:
+
+| Field           | Description                                   | Type    |
+| --------------- | --------------------------------------------- | ------- |
+| requests/second | number of requests processed per second       | Float   |
+| writes/second   | number of write requests processed per second | Float   |
+| running_tasks   | number of requests in progress                | Integer |
+| failure_rate    | request failure rate                          | Float   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 0.023,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.10.Get Audit Logs
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+
+| Field            | Description                                                                                                             | Type      |
+| ---------------- | ----------------------------------------------------------------------------------------------------------------------- | --------- |
+| begin_time       | start time of the queried log (required, format YYYY-mm-dd HH:MM:SS)                                                    | Timestamp |
+| end_time         | end time of the queried log (default is current time, format YYYY-mm-dd HH:MM:SS)                                       | Timestamp |
+| user             | the operator of the queried log (administrator can query all users' logs, ordinary users can only query their own logs) | String    |
+| num_log          | maximum number of logs to return (default 100)                                                                          | Integer   |
+| descending_order | whether to sort the result in descending order(default is true)                                                         | Bool      |
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of audit logs, each of which is an action log in the format of:
+
+| Field      | Description                                        | Type    |
+| ---------- | -------------------------------------------------- | ------- |
+| index      | the index of the operation                         | Integer |
+| begin_time | the start time of the operation                    | String  |
+| end_time   | the end time of the operation                      | String  |
+| user       | the user of the operation                          | String  |
+| graph      | the graph of the operation                         | String  |
+| type       | the type of the operation                          | String  |
+| read_write | the operation is read operation or write operation | String  |
+| success    | whether the operation is successful                | Bool    |
+| content    | the content of the operation                       | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.Task Management
+
+TuGraph tracks long-running tasks such as complex Cypher queries and plugins. Administrators can query currently running tasks through the REST API and choose to abort the queries if necessary.
+
+The URI format for task management is :
+
+```
+    http://{host}:{port}/task/{task_id}
+```
+
+#### 6.4.1.List Running Tasks
+
+- **URI**: `/task`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+The returned JSON is an array, each of which is formatted as follows:
+
+| Field        | Description                                      | Type   |
+| ------------ | ------------------------------------------------ | ------ |
+| description  | the description of the task                      | String |
+| time_elapsed | time the task has been executing for, in seconds | Float  |
+| task_id      | the ID of the task                               | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.Abort Task
+
+- **URI**: `/task/{task_id}`
+
+Where `task_id` is the `task_id` returned by `GET /task` .
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.5.Subgraph Management
+
+TuGraph supports multiple subgraphs and all subgraphs are completely independent from others. Different subgraphs can have different permissions to different users. Administrators can add, modify and delete subgraphs.
+
+#### 6.5.1.Create New Subgraph
+
+- **URI**: `/db`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description                   | Type                                                                |
+| ------ | ----------------------------- | ------------------------------------------------------------------- |
+| name   | the name of subgraph          | String                                                              |
+| config | the configuration of subgraph | Dictionary, in the format of {{column name 1}:{column value 1},...} |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1"
+        "config" : {
+            "max_size_GB":2048,
+            "async":True
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.Delete Subgraph
+
+- **URI**: `/db/{graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.List All Subgraphs
+
+- **URI**: `/db`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of all subgraphs.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_gb":1024,
+            "async":false
+        }
+    }
+```
+
+### 6.6.Label
+
+TuGraph is a strong-schema database. In each subgraph, each vertex and edge need to have a predefined data format. The data format is determined by Label. Users can use the REST API to add, delete, and query labels and their corresponding data format.
+
+The URI format of the Label operation is
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+Where the {type} can be `node` or `relationship`.
+
+#### 6.6.1.Create Label
+
+A label is created with a fixed data format. A label must be defined before any node or relationship can be created with that label.
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field            | Description                  | Type   |
+| ---------------- | ---------------------------- | ------ |
+| name             | the name of label            | String |
+| fields           | data column definition       | List   |
+| is_vertex        | whether it is a vertex Label | Bool   |
+| primary          | vertex primary property      | String |
+| edge_constraints | edge constraints             | List   |
+
+`primary` should be set when `is_vertex` is `true`. This field is only available for Vertex, and must be set when creating Vertex.
+
+`edge_constraints` could be set when `is_vertex` is `false`, This field is only available for Edge. This field limits the combination of starting and ending vertex of the edge, for example: `[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, just leave this field unset.
+
+In which `fields` is an array, in which each element defines a column of data, as follows:
+
+| Field    | Description                                                | Type                                                                                                         |
+| -------- | ---------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------ |
+| name     | the name of the column                                     | String                                                                                                       |
+| type     | the data type of the column                                | String, with following types: int8, int16, int32, int64, float, double, string, date, datetime, binary, blob |
+| optional | whether the data can be empty (optional, default is false) | Bool                                                                                                         |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.List All Labels
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description               | Type |
+| ------ | ------------------------- | ---- |
+| edge   | the list of edge labels   | List |
+| vertex | the list of vertex labels | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.Get Label Data Format
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Data column definition table as a dictionary, in which each key is the column name, and corresponding value is the column definition defined as follows:
+- | Field    | Description                           | Type   |
+  | -------- | ------------------------------------- | ------ |
+  | optional | whether the column value can be empty | Bool   |
+  | type     | the type of the column value          | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema Import
+
+- **URI**: `/db/{graph_name}/schema/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description              | Type   |
+| ----------- | ------------------------ | ------ |
+| description | Graph labels description | String |
+
+The detail description can refer to `TuGraph Manual`.
+
+- **RESPONSE**:
+
+Schema import will check the new schema and original schema in database if compatible or not. If yes, this request will add the label only in new schema. If no, will return an error code.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.Vertex Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+in which `vid` is a unique integer identifying the vertex, which can be obtained when creating new vertexes or by looking up index.
+
+#### 6.7.1.List Vertex and Label Number
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field      | Description                | Type    |
+| ---------- | -------------------------- | ------- |
+| num_label  | the number of vertex label | Integer |
+| num_vertex | the number of vertex       | Integer |
+
+_Note: `num_vertex` returns an estimate of the number of vertexes, not the exact number. To get the exact number, please use Cypher queries._
+
+#### 6.7.2.Create New Vertex
+
+Insert a vertex into the database.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                  | Type       |
+| -------- | ---------------------------- | ---------- |
+| label    | the name of label            | String     |
+| property | the properties of the vertex | Dictionary |
+
+in which `property` is a dictionary of {`column_name`:`column_value`}.
+
+- **RESPONSE**: if successful, return status code 200 and the new vertex's vid, which can be used in later vertex operations.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.Batch Create Vertexes
+
+TuGraph allows multiple vertices to be inserted as one batch to reduce network overhead.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description               | Type   |
+| ------ | ------------------------- | ------ |
+| label  | the name of Label         | String |
+| fields | the column names          | List   |
+| values | the values of each vertex | List   |
+
+in which `fields` is a list of strings specifying column names, and `values` is a list in which each element is a list of `column_values` corresponding to the column names as specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200, and return the vid list of newly added vertices in the JSON content, where each vid corresponds to each vertex in the request.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.Get Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description       | Type                                                             |
+| -------- | ----------------- | ---------------------------------------------------------------- |
+| label    | the name of Label | String                                                           |
+| property | property          | Dictionary, in the format of {column_name_1:column_value_1, ...} |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.Delete Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200, and also the following content in JSON:
+
+| Field | Description                                    | Type    |
+| ----- | ---------------------------------------------- | ------- |
+| in    | number of incoming edges of the deleted vertex | Integer |
+| out   | number of outgoing edges of the deleted vertex | Integer |
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.Get Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Vertex properties as a dictionary of {`column_name`:`column_value`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.Get Vertex Field
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Value corresponding to the specified `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.Update Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description          | Type       |
+| -------- | -------------------- | ---------- |
+| property | properties to update | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "13737299333"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.8.Edge Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+in which `euid` is a string uniquely identifying the edge, which can be obtained when creating edges or by iterating through the edges of a vertex.
+
+#### 6.8.1.Create Edge
+
+- **URI**: `/db/{graph_name}/node/{src_vid}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                     | Type       |
+| ----------- | ------------------------------- | ---------- |
+| label       | the label of edge               | String     |
+| destination | the `vid` of destination vertex | Integer    |
+| property    | the property of edge            | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200 and the `euid` of new created edge (type is String).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.Batch Create Edges
+
+- **URI**: `/db/{graph_name}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description          | Type   |
+| ------ | -------------------- | ------ |
+| label  | the label of edge    | String |
+| fields | the data column name | List   |
+| edge   | the data of edge     | List   |
+
+where the edge is a list of data, each of which specifies and edge, defined as follows:
+
+| Field       | Description           | Type    |
+| ----------- | --------------------- | ------- |
+| source      | source vertex id      | Integer |
+| destination | destination vertex id | Integer |
+| values      | the data list         | List    |
+
+in which `values` is a list of column values, each of which correspond to the a column name specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200 and the list of `euid`s of the newly created edges.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.List Out-going Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of source vertex's out-going edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.List Incoming Edges
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of destination vertex's incoming edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.List All Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                     | Type |
+| ----- | ------------------------------- | ---- |
+| in    | list of incoming edges' `euid`s | List |
+| out   | list of outgoing edges' `euid`s | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.Get Edge Information
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description                | Type       |
+| -------- | -------------------------- | ---------- |
+| label    | the label of the edge      | String     |
+| property | the properties of the edge | Dictionary |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.Delete Edge
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.Get Edge Properties
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The dictionary of edge's properties.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.Get Edge Field
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the value corresponding to given `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.Update Edge Property
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description              | Type       |
+| -------- | ------------------------ | ---------- |
+| property | properties to be updated | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.9.Index
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+#### 6.9.1.Create Index
+
+Create an index on a (label, field) pair. Blocks until the index is successfully built.
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field     | Description                                                                                 | Type   |
+| --------- |---------------------------------------------------------------------------------------------|--------|
+| label     | the name of label                                                                           | String |
+| field     | field to be indexed                                                                         | String |
+| type | the type of index, 0 means nonunique index, 1 means unique index, 2 means pair_unique index | int      |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.List All Indexes
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.List Indexes Related with Specified Label
+
+- **URI**: `/db/{graph_name}/index/{label}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.Delete Index
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.Get Vertex by Index
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of `vid`s.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+
+
+
+### 6.10.Data Import
+
+- **URI**: `/db/{graph_name}/import/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field             | Description                                                                                        | Type                       |
+|-------------------|----------------------------------------------------------------------------------------------------|----------------------------|
+| description       | description of the file content                                                                    | String                     |
+| data              | contents of the file to be imported (recommended to have a size of 16MB, has a hard limit of 17MB) | Strings / Arrays / Objects |
+| continue_on_error | whether to continue import when an error occurred (optional, default is `false`)                   | Bool                       |
+| delimiter         | delimiter used in the data file (optional, default is `“,”`)                                       | String                     |
+
+The details of the `description` field can be found in [TuGraph Import Tool](../6.utility-tools/1.data-import.md).
+
+`delimiter` can be a single character or multi-character string, but must not contain `\r` or `\n`.
+
+`data` can be one of the following:
+
+- String, such as `"1,2\n3,4\n"`
+- Array of ASCII codes, such as `[49,44,50,10,51,44,52,10]`
+- Dictionary shaped like the above array, such as `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+* **RESPONSE**:
+
+The system **will not** automatically perform actions such as creating a new label, adding an index, and so on. Before you do this, please make sure that the label involved already exists and has an appropriate index.
+
+If the import is successful, return code 200 and return log information (possibly empty) in the `log` field. Otherwise, returns status code 400. None of the data is imported on failure, and error message is set in `error_message`.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+Because the request specifies `continue_on_error: true`, the returned `log` indicates that the first edge cannot be inserted because there is no vertex with uid==1, while the second edge was imported successfully.
+
+### 6.11.Miscellany
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.Extract Subgraph
+
+Give a set of `vid`s and return the minimum subgraph which contains the vertex set and the edges between them.
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type |
+| ---------- | ------------- | ---- |
+| vertex_ids | vertex id set | List |
+
+- **RESPONSE**:
+
+| Field         | description        | Type                                                               |
+| ------------- | ------------------ | ------------------------------------------------------------------ |
+| nodes         | vertex information | List, each element contains vid, label, and properties.            |
+| relationships | edge information   | List, each element contains src, dst, euid, label, and properties. |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..8a5a18add0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Client Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..aabaea25e3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/8.query/1.cypher.md
@@ -0,0 +1,2340 @@
+# Cypher API
+
+> This document mainly introduces the detailed usage instructions of TuGraph-Cypher.
+
+## Table of contents
+- [1.Operators](#1operators)
+  - [1.1.Summary](#11summary)
+  - [1.2.General Operators](#12general-operators)
+  - [1.3.Mathematical Operators](#13mathematical-operators)
+  - [1.4.Comparison Operators](#14comparison-operators)
+  - [1.5.String Specific Comparison Operators](#15string-specific-comparison-operators)
+  - [1.6.Boolean Operators](#16boolean-operators)
+  - [1.7.String Operators](#17string-operators)
+  - [1.8.List Operators](#18list-operators)
+- [2.Clauses](#2clauses)
+  - [2.1.Summary](#21summary)
+  - [2.2.Match](#22match)
+  - [2.3.Return](#23return)
+  - [2.4.Where](#24where)
+  - [2.5.Skip](#25skip)
+  - [2.6.Limit](#26limit)
+  - [2.7.Create](#27create)
+  - [2.8.Callyield](#28callyield)
+  - [2.9.Union](#29union)
+- [3.Functions](#3functions)
+  - [3.1.Whole List of Functions](#31whole-list-of-functions)
+  - [3.2.Predicate Functions](#32predicate-functions)
+  - [3.3.Scalar Functions](#33scalar-functions)
+  - [3.4.Aggregating Functions](#34aggregating-functions)
+  - [3.5.List Funtions](#35list-funtions)
+  - [3.6.Mathematical Functions](#36mathematical-functions)
+- [4.Extensions to Opencypher](#4extensions-to-opencypher)
+- [5.Procedures](#5procedures)
+  - [5.1.Procedures Demos](#51procedures-demos)
+  - [5.2.Whole List of Procedures](#52whole-list-of-procedures)
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators support progress overview：
+
+| category                             | supported                                                                                                                                                       | unsupported                                 |
+| ------------------------------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------- |
+| General operators                    | <code>DISTINCT</code>, <code>.</code> for property access                                                                                                       | <code>[]</code> for dynamic property access |
+| Mathematical operators               | <code>+</code>, <code>-</code>, <code>\*</code>, <code>/</code>, <code>%</code>, <code>^</code>                                                                 |                                             |
+| Comparison operators                 | <code>=</code>, <code>&lt;&gt;</code>, <code>&lt;</code>, <code>&gt;</code>, <code>⇐</code>, <code>&gt;=</code>, <code>IS NULL</code>, <code>IS NOT NULL</code> |                                             |
+| String-specific comparison operators | <code>STARTS WITH</code>, <code>ENDS WITH</code>, <code>CONTAINS</code>, <code>REGEXP</code>                                                                    |                                             |
+| Boolean operators                    | <code>AND</code>, <code>OR</code>, <code>XOR</code>, <code>NOT</code>                                                                                           |                                             |
+| String operators                     | <code>+</code> for concatenation                                                                                                                                |                                             |
+| List operators                       | <code>+</code> for concatenation, <code>IN</code> to check existence of an element in a list, <code>[]</code> for accessing element(s)                          |                                             |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+  ```
+  CREATE (a:Person {name: 'Anne', eyeColor: 'blue'}),
+         (b:Person {name: 'Bill', eyeColor: 'brown'}),
+         (c:Person {name: 'Carol', eyeColor: 'blue'})
+  ```
+
+  ```
+  MATCH (p:Person ) RETURN DISTINCT p.eyeColor
+  ```
+
+- ✓ Accessing properties of a nested literal map using the `.` operator
+
+  ```
+  WITH {person: {name: 'Anne', age: 25}} AS p
+  RETURN p.person.name
+  ```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+  ```
+  CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+         (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+         (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+  ```
+  ```
+  MATCH (restaurant:Restaurant), (category:Category)
+  WHERE restaurant["rating_" + category.name] > 6
+  RETURN DISTINCT restaurant.name
+  ```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator `^`
+
+  ```
+  WITH 2 AS number, 3 AS exponent
+  RETURN number ^ exponent AS result
+  ```
+
+- ✓ Using the unary minus operator `-`
+  ```
+  WITH -3 AS a, 4 AS b
+  RETURN b - a AS result
+  ```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+  ```
+  WITH 4 AS one, 3 AS two
+  RETURN one > two AS result
+  ```
+
+### 1.5.String-specific comparison operators
+
+<span id="jump"></span>
+
+- ✓ Using STARTS WITH to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate STARTS WITH 'Jo'
+  RETURN candidate
+  ```
+
+- ✓ Using REGEXP to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate REGEXP 'Jo.*n'
+  RETURN candidate
+  ```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+  ```
+  WITH [2, 4, 7, 9, 12] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number = 4 OR (number > 6 AND number < 10)
+  RETURN number
+  ```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+  More details on string-specific comparison operators can be found [here](#jump)
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+  ```
+  RETURN [1,2,3,4,5]+[6,7] AS myList
+  ```
+- ✓ Using IN to check if a number is in a list
+
+  ```
+  WITH [2, 3, 4, 5] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number IN [2, 3, 8]
+  RETURN number
+  ```
+
+- ✓ Accessing elements in a list using the [] operator
+  ```
+  WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+  RETURN names[1..3] AS result
+  ```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses support progress list：
+
+| Category                | Syntax                                | Notes     |
+| ----------------------- | ------------------------------------- | --------- |
+| Reading clauses         | MATCH                                 | Supported |
+|                         | OPTIONAL MATCH                        | Supported |
+|                         | MANDATORY MATCH                       | Pending   |
+| Projecting clauses      | RETURN … [AS]                         | Supported |
+|                         | WITH … [AS]                           | Supported |
+|                         | UNWIND … [AS]                         | Supported |
+| Reading sub-clauses     | WHERE                                 | Supported |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | Supported |
+|                         | SKIP                                  | Supported |
+|                         | LIMIT                                 | Supported |
+| Writing clauses         | CREATE                                | Supported |
+|                         | DELETE                                | Supported |
+|                         | DETACH DELETE                         | Supported |
+|                         | SET                                   | Supported |
+|                         | REMOVE                                | Supported |
+| Reading/Writing clauses | MERGE                                 | Supported |
+|                         | CALL […YIELD]                         | Supported |
+| Set operations          | UNION                                 | Pending   |
+|                         | UNION ALL                             | Supported |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+    ```
+    MATCH (n)
+    RETURN n
+    ```
+  - ✓ Get all nodes with a label
+    ```
+    MATCH (movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Related nodes
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+  - ✓ Match with labels
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[]->(movie)
+    RETURN movie.title
+    ```
+  - ✓ Directed relationships and variable
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[r]->(movie)
+    RETURN type(r)
+    ```
+  - ✓ Match on relationship type
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})<-[:ACTED_IN]-(actor)
+    RETURN actor.name
+    ```
+  - ✓ Match on multiple relationship types
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[:ACTED_IN|:DIRECTED]-(person)
+    RETURN person.name
+    ```
+  - ✓ Match on relationship type and use a variable
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[r:ACTED_IN]-(actor)
+    RETURN r.role
+    ```
+
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+    ```
+    MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+    RETURN type(r)
+    ```
+  - ✓ Multiple relationships
+    ```
+    MATCH (charlie {name: 'Charlie Sheen'})-[:ACTED_IN]->(movie)<-[:DIRECTED]-(director)
+    RETURN movie.title, director.name
+    ```
+  - ✓ Variable-length relationships
+    ```
+    MATCH (martin {name: 'Charlie Sheen'})-[:ACTED_IN*1..3]-(movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Relationship variable in variable-length relationships
+    ```
+    MATCH p = (actor {name: 'Charlie Sheen'})-[:ACTED_IN*2]-(co_actor)
+    RETURN relationships(p)
+    ```
+  - ❏ Match with properties on a variable-length path
+    ```
+    MATCH p = (charlie:Person)-[* {blocked:false}]-(martin:Person)
+    WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+    RETURN p
+    ```
+  - ✓ Zero-length paths
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})-[*0..1]-(x)
+    RETURN x
+    ```
+  - ✓ Named paths
+
+    ```
+    MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+    ```
+
+  - ✓ Matching on a bound relationship
+
+    ```
+    MATCH (a)-[r]-(b)
+    WHERE id(r)= 0
+    RETURN a,b
+    ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+    ```
+    MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+    CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+    ```
+  - ✓ All shortest paths
+    ```
+    MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+    CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN nodeIds,relationshipIds,cost
+    ```
+
+- Get node or relationship by id
+
+  - ✓ Node by id
+    ```
+    MATCH (n)
+    WHERE id(n)= 0
+    RETURN n
+    ```
+  - ☒ Relationship by id
+    ```
+    MATCH ()-[r]->()
+    WHERE id(r) = 0
+    RETURN r
+    ```
+  - ✓ Multiple nodes by id
+    ```
+    MATCH (n)
+    WHERE id(n) IN [0, 3, 5]
+    RETURN n
+    ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+  ```
+  MATCH (n {name: 'B'}) RETURN n
+  ```
+
+  > **Note**
+  >
+  > Return `id` of n.
+
+- ✓ Return relationships
+
+  ```
+  MATCH (n {name: 'A'})-[r:KNOWS]->(c)
+  RETURN r
+  ```
+
+  > **Note**
+  >
+  > Return `EdgeUid` of r.
+
+- ✓ Return property
+  ```
+  MATCH (n {name: 'A'}) RETURN n.name
+  ```
+- ❏ Return all elements
+  ```
+  MATCH p = (a {name: 'A'})-[r]->(b)
+  RETURN *
+  ```
+- ❏ Variable with uncommon characters
+  ```
+  MATCH (`This isn\'t a common variable`)
+  WHERE `This isn\'t a common variable`.name = 'A'
+  RETURN `This isn\'t a common variable`.happy
+  ```
+- ✓ Aliasing a field
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age AS SomethingTotallyDifferent
+  ```
+- ✓ Optional properties
+  ```
+  MATCH (n)
+  RETURN n.age
+  ```
+- ❏ Other expressions
+
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age > 30, "I'm a literal", (a)-[]->()
+  ```
+
+  `(a)-[]->()` not supported.
+
+- ✓ Unique results
+  ```
+  MATCH (a {name: 'A'})-[]->(b)
+  RETURN DISTINCT b
+  ```
+
+### 2.4.WHERE
+
+- Basic usage
+
+  - ✓ Boolean operations
+    ```
+    MATCH (n)
+    WHERE n.name = 'Peter' XOR (n.age < 30 AND n.name = 'Tobias') OR NOT (n.name =
+    'Tobias' OR n.name = 'Peter')
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node label
+    ```
+    MATCH (n)
+    WHERE n:Swedish
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node property
+    ```
+    MATCH (n)
+    WHERE n.age < 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on relationship property
+    ```
+    MATCH (n)-[k:KNOWS]->(f)
+    WHERE k.since < 2000
+    RETURN f.name, f.age, f.email
+    ```
+  - ❏ Filter on dynamically-computed property
+    ```
+    WITH 'AGE' AS propname
+    MATCH (n)
+    WHERE n[toLower(propname)]< 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Property existence checking
+    ```
+    MATCH (n)
+    WHERE exists(n.belt)
+    RETURN n.name, n.belt
+    ```
+
+- String matching
+
+  - ✓ Match the beginning of a string
+    ```
+    MATCH (n)
+    WHERE n.name STARTS WITH 'Pet'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match the ending of a string
+    ```
+    MATCH (n)
+    WHERE n.name ENDS WITH 'ter'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match anywhere within a string
+    ```
+    MATCH (n)
+    WHERE n.name CONTAINS 'ete'
+    RETURN n.name, n.age
+    ```
+  - ✓ String matching negation
+    ```
+    MATCH (n)
+    WHERE NOT n.name ENDS WITH 's'
+    RETURN n.name, n.age
+    ```
+
+- Using path patterns in `WHERE`
+
+  - ✓ Filter on patterns
+    ```
+    MATCH (tobias {name: 'Tobias'}), (others)
+    WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+    RETURN others.name, others.age
+    ```
+  - ✓ Filter on patterns using NOT
+    ```
+    MATCH (persons), (peter {name: 'Peter'})
+    WHERE NOT (persons)-[]->(peter)
+    RETURN persons.name, persons.age
+    ```
+  - ✓ Filter on patterns with properties
+
+    ```
+    MATCH (n)
+    WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+    RETURN n.name, n.age
+    ```
+
+  - ✓ Filter on relationship type
+    ```
+    MATCH (n)-[r]->()
+    WHERE n.name='Andres' AND type(r) STARTS WITH 'K'
+    RETURN type(r), r.since
+    ```
+
+- Lists
+
+  - ✓ IN operator
+    ```
+    MATCH (a)
+    WHERE a.name IN ['Peter', 'Tobias']
+    RETURN a.name, a.age
+    ```
+
+- Missing properties and values
+
+  - ✓ Default to false if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white'
+    RETURN n.name, n.age, n.belt
+    ```
+  - ✓ Default to true if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+    ORDER BY n.name
+    ```
+  - ✓ Filter on null
+    ```
+    MATCH (person)
+    WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+    person.belt
+    ```
+
+- Using ranges
+
+  - ✓ Simple range
+    ```
+    MATCH (a)
+    WHERE a.name >= 'Peter'
+    RETURN a.name, a.age
+    ```
+  - ✓ Composite range
+    ```
+    MATCH (a)
+    WHERE a.name > 'Andres' AND a.name < 'Tobias'
+    RETURN a.name, a.age
+    ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 3
+  ```
+- ✓ Return middle two records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 1
+  LIMIT 2
+  ```
+- ✓ Using an expression with SKIP to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP toInteger(3*rand())+ 1
+  ```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT 3
+  ```
+- ✓ Using an expression with LIMIT to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT toInteger(3 * rand())+ 1
+  ```
+
+### 2.7.CREATE
+
+- Create nodes
+
+  > **Note**
+  >
+  > TuGraph does not support creating empty nodes and does not support multiple labels.
+
+  - ☒ Create single node
+    ```
+    CREATE (n)
+    ```
+  - ☒ Create multiple nodes
+    ```
+    CREATE (n), (m)
+    ```
+  - ✓ Create a node with a label
+    ```
+    CREATE (n:Person)
+    ```
+  - ☒ Create a node with multiple labels
+    ```
+    CREATE (n:Person:Swedish)
+    ```
+  - ✓ Create node and add labels and properties
+    ```
+    CREATE (n:Person {name: 'Andres', title: 'Developer'})
+    ```
+  - ✓ Return created node
+    ```
+    CREATE (a {name: 'Andres'})
+    RETURN a
+    ```
+
+- Create relationships
+
+  - ✓ Create a relationship between two nodes
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE]->(b)
+    ```
+  - ✓ Create a relationship and set properties
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE {name: a.name + '<->' + b.name}]->(b)
+    ```
+  - ✓ Create a full path
+    ```
+    CREATE p = (andres {name:'Andres'})-[:WORKS_AT]->(neo)<-[:WORKS_AT]-(michael {name:'Michael'})
+    RETURN p
+    ```
+
+- Use parameters with CREATE
+
+  - ❏ Create node with a parameter for the properties
+    ```
+    CREATE (n:Person $props)
+    RETURN n
+    ```
+  - ☒ Create multiple nodes with a parameter for their properties
+    ```
+    UNWIND $props AS map
+    CREATE (n)
+    SET n = map
+    ```
+    cannot create vertex without label.
+
+### 2.8.CALL\[…YIELD\]
+
+- ✓ Call a procedure using CALL
+  ```
+  CALL db.vertexLabels
+  ```
+- ✓ View the signature for a procedure
+  ```
+  CALL dbms.procedures() YIELD name, signature
+  WHERE name='dbms.listConfig'
+  RETURN signature
+  ```
+- ❏ Call a procedure using a quoted namespace and name
+  ```
+  CALL `db`.`vertexLabels`
+  ```
+- ✓ Call a procedure with literal arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+  ```
+- ❏ Call a procedure with parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+  ```
+- ❏ Call a procedure with mixed literal and parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+  ```
+- ✓ Call a procedure with literal and default arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+  ```
+- ✓ Call a procedure within a complex query using CALL…YIELD
+  ```
+  CALL db.vertexLabels() YIELD label
+  RETURN count(label) AS numLabels
+  ```
+- ✓ Call a procedure and filter its results
+  ```
+  CALL db.vertexLabels() YIELD label
+  WHERE label CONTAINS 'User'
+  RETURN count(label) AS numLabels
+  ```
+- ❏ Call a procedure within a complex query and rename its outputs
+  ```
+  CALL db.propertyKeys() YIELD propertyKey AS prop
+  MATCH (n)
+  WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+  ```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION ALL MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+- ❏ Combine two queries and remove duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION
+  MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| Category               | Function          | Notes                                |
+| ---------------------- |------------------ | ------------------------------------ |
+| Predicate functions    | exists()          |                                      |
+|                        | all()             | Not supported                        |
+|                        | any()             | Not supported                        |
+|                        | single()          | Not supported                        |
+|                        | none()            | Not supported                        |
+| Scalar functions       | id()              |                                      |
+|                        | euid()            |                                      |
+|                        | properties()      |                                      |
+|                        | head()             |                                      |
+|                        | last()             |                                      |
+|                        | toBoolean()       |                                      |
+|                        | toFloat()         |                                      |
+|                        | toInteger()       |                                      |
+|                        | toString()        |                                      |
+|                        | type()            |                                      |
+|                        | startnode()       |                                      |
+|                        | endnode()         |                                      |
+|                        | size()            |                                      |
+|                        | length()          |                                      |
+|                        | substring()       |                                      |
+|                        | concat()          |                                      |
+|                        | label()           | OpenCypher extension method          |
+| Aggregating functions  | avg()             |                                      |
+|                        | collect()         |                                      |
+|                        | count()           |                                      |
+|                        | max()             |                                      |
+|                        | min()             |                                      |
+|                        | percentileCont()  |                                      |
+|                        | percentileDisc()  |                                      |
+|                        | stDev()           |                                      |
+|                        | stDevP()          |                                      |
+|                        | variance()        |                                      |
+|                        | varianceP()       |                                      |
+|                        | sum()             |                                      |
+| List functions         | keys()            |                                      |
+|                        | labels()          | Returns a result with only one label |
+|                        | nodes()           |                                      |
+|                        | range()           |                                      |
+|                        | subscript()       | Not supported                        |
+| Mathematical functions | abs()             |                                      |
+|                        | ceil()            |                                      |
+|                        |
+
+			
+
+### 3.2.Predicate functions
+
+- exists()
+
+  judge it whether a vertex or edge has the field .
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE exists(n.belt)
+  RETURN n.name, n.belt
+  ```
+
+  **Example output:**
+
+  | exists(name) |
+  | ------------ |
+  | true         |
+
+### 3.3.Scalar functions
+
+- id()
+
+  get the id of vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  RETURN id(a)
+  ```
+
+  **Example output:**
+
+  | vid |
+  | --- |
+  | 1   |
+  | 2   |
+  | ... |
+
+- properties()
+
+  get a map containing all the properties of a node or relationship.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  CREATE (p:Person {name: 'Stefan', city: 'Berlin'})
+  RETURN properties(p)
+  ```
+
+  **Example output:**
+
+  | properties                |
+  | ------------------------- |
+  | {name:Stefan,city:Berlin} |
+
+- head()
+
+  get the first element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, head(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | head(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "one"         |
+
+- last()
+
+  get the last element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, last(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | last(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "three"       |
+
+- toFloat()
+
+  Converts an integer or string value to a floating point number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toFloat('11.5'), toFloat('not a number')
+  ```
+
+  **Example output:**
+  | float |
+  | ----- |
+  | 11.5 |
+  |null|
+
+- toInteger()
+
+  Converts a floating point or string value to an integer value.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toInteger('2.3') AS integer
+  ```
+
+  **Example output:**
+
+  | integer |
+  | ------- |
+  | 2       |
+
+- toString()
+
+  Converts an integer, float, boolean value to a string.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toString(2.3)
+  ```
+
+- type()
+
+  get the string representation of the relationship type.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name = 'Alice'
+  RETURN type(r)
+  ```
+
+  **Example output:**
+
+  | type     |
+  | -------- |
+  | acted_in |
+  | acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+
+  Returns the average of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN avg(n.age)
+  ```
+
+  **Example output:**
+
+  | avg(n.born)        |
+  | ------------------ |
+  | 1869.2661654135338 |
+
+- collect()
+
+  Returns a list containing the values returned by an expression.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN collect(n.age)
+  ```
+
+  **Example output:**
+
+  | collect(n.born) |
+  | --------------- |
+  | [1967,...]      |
+
+- count()
+
+  Returns the number of values or records.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n {name: 'A'})-[]->(x)
+  RETURN labels(n), n.age, count(*)
+  ```
+
+  **Example output:**
+
+  | labels(n)  | n.age | count(\*) |
+  | ---------- | ----- | --------- |
+  | ["Person"] | 13    | 3         |
+
+- max()
+
+  Returns the maximum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN max(n.age)
+  ```
+
+  **Example output:**
+
+  | max(n.age) |
+  | ---------- |
+  | 44         |
+
+- min()
+
+  Returns the minimum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN min(n.age)
+  ```
+
+  **Example output:**
+
+  | min(n.age) |
+  | ---------- |
+  | 13         |
+
+- percentileCont()
+
+  Returns the percentile of a value over a group using linear interpolation.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileCont(n.age, 0.4)
+  ```
+
+  **Example output:**
+
+  | percentileCont(n.age, 0.4) |
+  | -------------------------- |
+  | 29                         |
+
+* percentileDisc()
+
+  Returns the nearest value to the given percentile over a group using a rounding method.
+
+  **Scope:** whole instance.
+
+  **Output:** the percentile of the given value over a group.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileDisc(n.age, 0.5)
+  ```
+
+  **Example output:**
+
+  | percentileDisc(n.age, 0.5) |
+  | -------------------------- |
+  | 33                         |
+
+* stDev()
+
+  Returns the standard deviation for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDev(n.age)
+  ```
+
+  **Example output:**
+
+  | stDev(n.age)       |
+  | ------------------ |
+  | 15.716233645501712 |
+
+* stDevP()
+
+  Returns the standard deviation for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDevP(n.age)
+  ```
+
+  **Example output:**
+
+  | stDevP(n.age)      |
+  | ------------------ |
+  | 12.832251036613439 |
+
+* variance()
+
+  Returns the variance for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN variance(n.age)
+  ```
+
+  **Example output:**
+
+  | variance(n.age) |
+  | --------------- |
+  | 247             |
+
+* varianceP()
+
+  Returns the variance for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN varianceP(n.age)
+  ```
+
+  **Example output:**
+
+  | varianceP(n.age) |
+  | ---------------- |
+  | 164.66666666667  |
+
+* sum()
+
+  Returns the sum of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN sum(n.age)
+  ```
+
+  **Example output:**
+
+  | sum(n.age) |
+  | ---------- |
+  | 90         |
+
+### 3.5.List Funtions:
+
+- keys()
+
+  get the field names of some vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN keys(a)
+  ```
+
+  **Example output:**
+
+  | keys(a)               |
+  | --------------------- |
+  | ["name","age","eyes"] |
+
+- labels()/label()
+
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN labels(a)
+  ```
+
+  **Example output:**
+
+  | labels                 |
+  | ---------------------- |
+  | ["Person","Developer"] |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice'})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+### 3.6.Mathematical functions
+
+- abs()
+
+  get the absolute value of some data.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a:person {name: 'Laurence Fishburne'}),(e:person {name: 'Carrie-Anne Moss'})
+  RETURN a.born, e.born, abs(a.born-e.born)
+  ```
+
+  **Example output:**
+
+  | a.born | e.born | abs(a.born - e.born) |
+  |--------|--------|-----------------------|
+  | 1961   | 1967   | 6                     |
+
+- ceil()
+
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+  **Example input:**
+
+  ```
+  RETURN ceil(0.1)
+  ```
+
+  **Example output:**
+
+  | ceil(0.1) |
+  | --------- |
+  | 1.0       |
+
+- floor()
+
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN floor(0.9)
+  ```
+
+  **Example output:**
+
+  | floor(0.9) |
+  | ---------- |
+  | 0.0        |
+
+- round()
+
+  Returns the value of a number rounded to the nearest integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN round(3.141592)
+  ```
+
+  **Example output:**
+
+  | round |
+  | ----- |
+  | 3     |
+
+- rand()
+
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN rand()
+  ```
+
+  **Example output:**
+
+  | rand()             |
+  | ------------------ |
+  | 0.9797131960534085 |
+
+- sign()
+
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN sign(-17), sign(0.1)
+  ```
+
+  **Example output:**
+
+  | sign(-17) | sign(0.1) |
+  | --------- | --------- |
+  | -1        | 1         |
+
+## 4.Extensions To OpenCypher
+
+- Number of Labels
+
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+
+  - OpenCypher: One node/relationship may have 0 to many labels.
+
+- Schema.
+
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.Procedures
+
+### 5.1.procedures' demos
+
+- dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                               | name            |
+  | --------------------------------------- | --------------- |
+  | db.vertexLabels() :: (label::STRING)    | db.vertexLabels |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels   |
+  | db.indexes() :: (index::LIST)           | db.indexes      |
+  | ...                                     | ...             |
+
+- db.vertexLabels()
+
+  Lists all available labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+
+  **Example output:**
+
+  | label   |
+  | ------- |
+  | genre   |
+  | keyword |
+  | movie   |
+  | ...     |
+
+- db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edgeLabels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | edgeLabel |
+  | --------- |
+  | acted_in  |
+  | directed  |
+  | ...       |
+
+- db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter     | parameter type | description                   |
+  | ------------- | -------------- | ----------------------------- |
+  | label_name    | string         | name of vertex label          |
+  | primary_field | string         | primary field of vertex label |
+  | field_spec    | list           | specification of a field      |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+  **Output:** If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added label [Person]
+  ```
+
+- db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description                   |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field             |
+  | type       | string     | type of the field             |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name         | type   | optional |
+  | ------------ | ------ | -------- |
+  | id           | INT32  | false    |
+  | born         | INT32  | true     |
+  | name         | STRING | true     |
+  | poster_image | STRING | true     |
+
+- db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | label_type | string         | either 'vertex' or 'edge'                                             |
+  | label_name | string         | name of the label                                                     |
+  | extra      | string         | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list           | specification of a field                                              |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.
+  for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+- db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:**
+
+  | field_name | field_type | description                      |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description                   |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string          | either 'vertex' or 'edge'     |
+  | label_name  | string          | name of the label             |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description               |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string         | either 'vertex' or 'edge' |
+  | label_name       | string         | name of the label         |
+  | field_value_spec | list           | specification of a field  |
+
+  in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, 'optional']`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+  | field_spec | list           | specification of a field  |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelModFields(
+  'vertex',
+  'new_label',
+  ['birth_date', 'DATETIME', '1900-01-01 00:00:00'],
+  ['gender', 'BOOL', false])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description              |
+  | ---------------- | -------------- | ------------------------ |
+  | label_name       | string         | name of the label        |
+  | edge_constraints | string         | edge constraints         |
+  | field_spec       | list           | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for optional fields.
+
+- `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32,true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+- db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+- db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+- | pair_unique  | boolean        | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+- dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description          |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string         | the current password |
+  | new_password     | string         | new password         |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string         | the user's name |
+  | new_password | string         | new password    |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.createUser(user_name, password)
+
+  create new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | ------------------------ |
+  | user_name | string         | the new user name        |
+  | password  | string         | the password of new user |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string         | the user name to be deleted |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string         | the user name               |
+  | is.admin  | boolean        | the permission of this user |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       | ...      |
+
+- dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description           |
+  | --------- | -------------- | --------------------- |
+  | user.user | string         | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+- dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+  a list of ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host         |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...          |
+
+- dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been deleted.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description                      |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string         | the name of new subgraph         |
+  | description | string         | description of new subgraph      |
+  | max_size_GB | integer        | Upper limit of subgraph capacity |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+  | config     | map            | the configuration to be modified     |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.listGraphs()
+
+  get all subgraph in this graph database .
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.config.list()
+
+  get some config of this graph database .
+
+  **Output:**
+
+  a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  | --------- | ------- |
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       | ...     |
+
+- dbms.config.update(updates)
+
+  get some config of this graph database .
+
+  **Output:**
+
+  If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+      enable_ip_check:false,
+      durable:true,
+      optimistic_txn:true,
+      enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+- dbms.takeSnapshot()
+
+  take the snapshot on this current graph database.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+- dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path                       |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+- algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                                                             |
+  | --------- | -------------- | --------------------------------------------------------------------------------------- |
+  | startNode | Node           | the source node of paths                                                                |
+  | endNode   | Node           | the destination node paths                                                              |
+  | config    | MAP            | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+  If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2         | 1         |
+
+- algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+- algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                               |
+  | --------- | -------------- | --------------------------------------------------------- |
+  | id        | ANY            | the id of vertexes or edges , the id must be variable     |
+  | config    | MAP            | the configuration of this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or it is an edge id.
+
+  **Output:**
+
+  If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.Whole List Of Procedures
+
+| Name                                  | Description                                                          | Signature                                                                                                                                                                                |
+|---------------------------------------|----------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.vertexLabels                       | list all vertex labels                                               | db.vertexLabels() :: (label::STRING)                                                                                                                                                     |
+| db.edgeLabels                         | list all edge labels                                                 | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                  |
+| db.indexes                            | list all indexes                                                     | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                     |
+| db.listLabelIndexes                   | list indexes by label                                                | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                           |
+| db.warmup                             | warm up the DB                                                       | db.warmup() :: (time_used::STRING)                                                                                                                                                       |
+| db.createVertexLabel                  | create a vertex label                                                | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                   |
+| db.createLabel                        | create a vertex/edge label                                           | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                              |
+| db.getLabelSchema                     | get the schema of label                                              | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                                |
+| db.getVertexSchema                    | get the schema of vertex label                                       | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                       |
+| db.getEdgeSchema                      | get the schema of edge label                                         | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                         |
+| db.deleteLabel                        | delete vertex/edge label                                             | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                        |
+| db.alterLabelDelFields                | delete some fields of a label on a subgraph                          | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                             |
+| db.alterLabelAddFields                | add some fields of a label on a subgraph                             | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                  |
+| db.alterLabelModFields                | modify some fields of a label on a subgraph                          | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                        |
+| db.createEdgeLabel                    | create a edge label                                                  | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                      |
+| db.addIndex                           | add an index                                                         | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                           |
+| db.addEdgeIndex                       | add an index                                                         | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                  |
+| db.addVertexCompositeIndex            | add composite index                                                  | db.addVertexCompositeIndex(label_name::STRING,field_names::LIST,unique::BOOLEAN) :: (::VOID)                                                                                            |
+| db.deleteIndex                        | delete an index                                                      | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                        |
+| db.backup                             | backup the db                                                        | db.backup(destination::STRING) :: ()                                                                                                                                                     |
+| dbms.procedures                       | list all procedures                                                  | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                    |
+| dbms.security.changePassword          | change current user password                                         | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                  |
+| dbms.security.changeUserPassword      | change user password                                                 | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                     |
+| dbms.security.createUser              | create an account                                                    | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.deleteUser              | delete an account                                                    | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.listUsers               | list all accounts                                                    | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                          |
+| dbms.security.showCurrentUser         | get current user name                                                | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                                |
+| dbms.security.getUserPermissions      | get the permissions of a specified user                              | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                  |
+| dbms.graph.createGraph                | create a subgraph                                                    | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                        |
+| dbms.graph.modGraph                   | modify the config of a subgraph                                      | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                          |
+| dbms.graph.deleteGraph                | delete a subgraph                                                    | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                   |
+| dbms.graph.listGraphs                 | list all subgraphs                                                   | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                       |
+| dbms.graph.getGraphInfo               | get the information of a specified graph                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                     |
+| dbms.security.addAllowedHosts         | add to the trust list                                                | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                         |
+| dbms.security.deleteAllowedHosts      | remove from the trust list                                           | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                              |
+| dbms.security.listAllowedHosts        | list the trust list                                                  | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                       |
+| dbms.config.update                    | update the configuration                                             | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                    |
+| dbms.config.list                      | list the configuration                                               | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                          |
+| algo.shortestPath                     | get a shortest path between two vertexes                             | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                    |
+| algo.allShortestPaths                 | get all the shortest paths between two vertexes                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                     |
+| algo.native.extract                   | get the field values of a list of vertexes or edges specified id     | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                 |
+| db.flushDB                            | flush the db                                                         | db.flushDB() :: (::VOID)                                                                                                                                                                 |
+| dbms.security.listRoles               | list all roles                                                       | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                          |
+| dbms.security.createRole              | create a role                                                        | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                     |
+| dbms.security.deleteRole              | delete a role                                                        | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.getRoleInfo             | get the role information                                             | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                              |
+| dbms.security.disableRole             | enable/disable the role                                              | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.modRoleDesc             | modify the description of a role                                     | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.rebuildRoleAccessLevel  | rebuild the user subgraph access rights                              | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                         |
+| dbms.security.modRoleAccessLevel      | modify the user subgraph access rights                               | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                             |
+| dbms.security.modRoleFieldAccessLevel | modify the user property access rights                               | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                  |
+| dbms.security.getUserInfo             | get the user information                                             | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                              |
+| dbms.security.getUserMemoryUsage      | get the memory usage for a user                                      | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                                |
+| dbms.security.disableUser             | enable/disable the user                                              | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.setCurrentDesc          | set the current user description                                     | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                            |
+| dbms.security.setUserDesc             | set user description                                                 | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.setUserMemoryLimit      | set user memory limit                                                | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                          |
+| dbms.security.deleteUserRoles         | delete roles from the user                                           | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                      |
+| dbms.security.rebuildUserRoles        | rebuild the relationship between the user and the role               | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.addUserRoles            | add the user roles                                                   | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                         |
+| db.plugin.loadPlugin                  | load a plugin                                                        | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN, version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | unload a plugin                                                      | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                              |
+| db.plugin.listPlugin                  | list all plugins                                                     | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                           |
+| db.plugin.getPluginInfo               | get the information of a specified plugin                            | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                           |
+| db.plugin.callPlugin                  | execute the plugins                                                  | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                     |
+| db.importor.dataImportor              | import vertex/edge data                                              | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                              |
+| db.importor.schemaImportor            | import vertex/edge schema                                            | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                              |
+| dbms.meta.count                       | get the total number of vertex and edge                              | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                  |
+| dbms.meta.countDetail                 | get the number of vertex and edge for each label                     | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                        |
+| dbms.meta.refreshCount                | recount the number of vertex and edge, stop writing during the count | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                  |
+| dbms.task.listTasks                   | list running tasks                                                   | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                     |
+| dbms.task.terminateTask               | terminate task                                                       | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                       |
+| dbms.ha.clusterInfo                   | get cluster info in HA mode                                          | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                        |
+| db.dropDB                             | empty the db                                                         | db.dropDB() :: (::VOID)                                                                                                                                                                  |
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/8.query/2.gql.md
new file mode 100644
index 0000000000..ea00f3ceb1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/8.query/2.gql.md
@@ -0,0 +1,392 @@
+# ISO GQL
+
+
+## 1.Introduction to ISO GQL
+
+Graph Query Language (GQL) is an upcoming International Standard language for property graph querying. It builds on the foundations of SQL and integrates proven ideas from the existing [openCypher, PGQL, GSQL, and G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/) languages. The standard is currently in the draft stage.
+
+TuGraph has implemented GQL based on the [ISO GQL (ISO/IEC 39075) Antlr4 grammar file](https://github.com/TuGraph-family/gql-grammar). It includes some extensions and modifications. Not all GQL syntax is fully supported at the moment, but we will continue to improve and enhance it in the future.
+
+## 2.List of Clauses
+
+| Category            | Clauses        |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+
+### 2.1.MATCH
+
+The `MATCH` clause is the most basic clause in GQL, and almost all queries are expanded through `MATCH`.
+
+The `MATCH` clause is used to specify the matching pattern to search in the graph, to match vertices or paths that meet certain conditions.
+
+
+#### Vertex basics
+
+##### Get all vertices
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### Get all vertices with a label
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### Vertex matching with property
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### Vertex matching with filter
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Edge basics
+
+##### Edge pointing right
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### Edge pointing left
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### Edge matching with filter
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+return
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### Path matching
+
+##### Variable length
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+return
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+The `OPTIONAL MATCH` clause matches a graph pattern and returns `null` if there is no match.
+
+
+#### Match found
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### Match Not Found
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+return
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+The `RETURN` clause specifies the results to be returned, including vertices, edges, paths, properties, etc.
+
+#### Return vertices
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+return
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### Return edges
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+return
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### Return property
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Uncommon string used as variable name
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### Alias
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+return
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### Optional property
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### Other expressions
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+return
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### Distinct
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+return
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+The `NEXT` clause is used to connect multiple clauses.
+
+#### Connecting MATCH clauses
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE` clause is used to filter records.
+
+#### Filter vertex
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+returns
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### Filter edge
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+returns
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### Boolean expressions
+
+`AND`, `OR`, `XOR`, and `NOT` Boolean expressions can be used in the `WHERE` clause to filter data.
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+returns
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+### 2.6.ORDER BY
+
+`ORDER BY` is a clause of `RETURN` that sorts the output result.
+
+#### Sorting the Result
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+return
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP` specifies the offset of the result rows.
+
+#### Without SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### Using SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+The `LIMIT` clause is used to limit the number of rows in the result.
+
+#### Using LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/8.query/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/8.query/index.rst
new file mode 100644
index 0000000000..5e736c4232
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/8.query/index.rst
@@ -0,0 +1,9 @@
+Query
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..83ba668355
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,342 @@
+# TuGraph Stored Procedure Guide
+
+> This document mainly explains the instructions for using the TuGraph stored procedure.
+
+## 1. Introduction
+
+When the query/update logic that users need to express is more complex (such as cannot be described by Cypher or has high performance requirements), compared to calling multiple requests and completing the entire processing flow on the client, the stored procedure provided by TuGraph is a more concise and efficient choice.
+
+Similar to traditional databases, the TuGraph stored procedure runs on the server side. Users can encapsulate the processing logic (i.e., multiple operations) into a procedure call, and further improve performance by parallel processing (such as using relevant C++ OLAP interfaces and built-in algorithms) during implementation.
+
+There is a special type of API in the stored procedure for parallel data operations, which we call the Traversal API. Please refer to the [documentation](2.traversal.md) for more information.
+
+## 2. Stored Procedure Version
+
+Currently, TuGraph supports two versions of stored procedures, which are suitable for different scenarios. Version 3.5 only supports v1, which can be directly called through the REST or RPC interface. Starting from version 3.5, v2 is supported, which allows embedding calls in graph query languages ​​(such as Cypher). We call it POG (Procedure On Graph query language, APOC).
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+|Applicable Scenarios	|Extreme performance or complex multi-transaction management scenarios	|General scenarios, highly integrated with Cypher|
+|Transaction	|Created internally in the function, multiple transactions |can be freely controlled	Passed into the external function, single transaction|
+|Signature (parameter definition)	|Not required	|Required|
+|Input and output parameter types	|Not required to specify	|Need to specify parameter types|
+|Cypher Standalone Call	|Supported	|Supported
+|Cypher Embeded Call	|Not supported	|Supported|
+|Language	|C++/Python/Rust	|C++|
+|Calling mode	|Directly pass the string, usually in JSON format	|Through variables in Cypher statements|
+
+
+In TuGraph, stored procedures v1 and v2 are managed separately, and support for create, delete, and query operations is provided. However, it is still not recommended to have the same name for multiple stored procedures.
+
+## 3. Supported Languages
+
+In TuGraph, users can dynamically load, update, and delete stored procedures. TuGraph supports the use of C++, Python, and Rust languages to write stored procedures. Among them, C++ language has the most complete support and the best performance.
+
+Note that the stored procedure is the logic compiled and executed on the server side, which is independent of the language support on the client side.
+
+## 4. Procedure v1 Interface
+
+## 4.1.Write stored procedures
+### 4.1.1.Write C++ stored procedure
+
+Users can write C stored procedures by using core API or Traversal API. An example of a simple C stored procedure is as follows:
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## Count all students whose age is 10
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+From the code, we can see the entry of a TuGraph C++ stored procedure is the `Process` function, with three parameters:
+
+- `db`: the TuGraph database instance
+- `request`: the input data, which can be a binary byte array, or any other format such as JSON string.
+- `response`: the output data, which can be a string or directly return binary data.
+
+The return value of the `Process` function is a boolean value. When it returns `true`, it means that the request is successfully completed, otherwise it means that the stored procedure found an error during execution, and the user can return an error message through `response` to facilitate debugging.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which is `age_10` in the above example. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, age_10.so will be generated, which can then be loaded into the server by the user.
+
+### 4.1.2 Writing Python stored procedures
+
+The following snippet does the same thing as the above C++ stored procedure, but via TuGraph Python API:
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+The Python stored procedure returns a tuple, the first element of which is a Boolean value indicating whether the stored procedure was successfully executed; the second element is a `str`, which contains the result to be returned.
+
+Python stored procedures do not need to be compiled and can be loaded directly.
+
+## 4.2.How to use stored procedures
+
+### 4.2.1.Install Stored Procedures
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `age_10.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+                  headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `age_10.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+### 4.2.2.List Stored Procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.Retrieve Stored Procedures Detail
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.Uninstall Stored Procedures
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+### 4.2.6.Upgrade Stored Procedures
+
+You can upgrade a stored procedure with the following two steps:
+
+1. Uninstall the existing one.
+2. Install the new on.
+
+TuGraph carefully manages the concurrency of stored procedure operations. Upgrading stored procedures will not affect concurrent runs of existing ones.
+
+## 5. Procedure v2 Interface
+
+### 5.1.Writing stored procedures
+
+Users can write C++ stored procedures by using lgraph API. A simple C++ stored procedure example is as follows:
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+From the code we can see:
+- The stored procedure defines a method `GetSignature` to get the signature. This method returns the signature of the stored procedure, which includes input parameter names and their types, and return parameters and their types. This enables the Cypher query statement to use the signature information to verify whether the input data and the returned data are reasonable when calling the stored procedure.
+- The entry function is the `ProcessInTxn` function, which has three parameters, which are:
+
+- `txn`: The transaction of the stored procedure, generally speaking, the transaction of the Cypher statement that calls the stored procedure.
+- `request`: input data, its content is the string of the input parameter type defined in `GetSignature` and the value passed in the Cypher query statement after json serialization. e.g. `{num_iteration: 10}`
+- `response`: output data, in order to ensure compatibility in the Cypher language, users can write the data processed by the stored procedure to `lgraph_api::Result`, and finally use `lgraph_api::Result::Dump` to serialize it into data in json format.
+
+The return value of the `ProcessInTxn` function is a boolean value. When it returns `true`, it means that the request was successfully completed, otherwise it means that the stored procedure found an error during execution.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which in the above example is `custom_pagerank`. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, custom_pagerank.so will be generated, which can then be loaded into the server by the user.
+
+### 5.2.Load stored procedure
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `custom_pagerank.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `custom_pagerank.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+#### 5.2.1.List loaded stored procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.Get stored procedure details
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.Delete stored procedure
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+#### 5.2.5.Update stored procedure
+
+Updating a stored procedure requires the following two steps:
+
+1. Delete the existing stored procedure
+2. Install the new stored procedure
+
+TuGraph carefully manages the concurrency of stored procedure operations, and updating stored procedures will not affect the operation of existing stored procedures.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..e4abd3a263
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,125 @@
+# Traversal API
+
+> This document mainly explains the Traversal API in the stored procedure of TuGraph.
+
+1. Introduction
+The powerful online analytical processing (OLAP) capability of TuGraph is an important feature that sets it apart from other graph databases. With the help of the C++ OLAP API (olap_on_db.h), users can quickly export a subgraph that needs to be analyzed, and then run iterative graph computing processes such as PageRank, connected components, and community detection on it, and then make corresponding decisions based on the results. The export and computation processes can be accelerated through parallel processing, achieving almost real-time analysis and processing, and avoiding the lengthy steps of traditional solutions that require exporting, transforming, and reimporting (ETL) data into dedicated analytical systems for offline processing.
+
+TuGraph has built-in many commonly used graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement specific graph computing processes themselves. They just need to include the header files (.h files) of the corresponding algorithm library in their own programs when implementing their own storage procedures, and link the corresponding dynamic library files (.so) during compilation. In general, the only process that users need to implement themselves is the extraction of the subgraph to be analyzed.
+
+Currently, the Traversal API only supports C++.
+
+## 2. Interface
+
+### 2.1. Snapshot
+
+The Snapshot template class in C++ OLAP API is used to represent extracted static subgraphs. The EdgeData is used to represent the data type of the weight used for each edge in the subgraph. If the edges do not require weights, Empty is used as the EdgeData.
+
+The extracted subgraph can be described using the constructor of the Snapshot class.
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+In the above text, "db" represents the database handle, "txn" represents the transaction handle, and "flags" represents the options used during generation, with the optional values including the following combinations: SNAPSHOT_PARALLEL indicates that multiple threads are used for parallel extraction during export; SNAPSHOT_UNDIRECTED indicates that the exported graph needs to be transformed into an undirected graph.
+
+"vertex_filter" is a user-defined filtering function for vertices, where a return value of true indicates that the vertex needs to be included in the extracted subgraph, and vice versa.
+
+"out_edge_filter" is a user-defined filtering function for edges, where a return value of true indicates that the edge needs to be included in the extracted subgraph, and vice versa.
+
+When the filtering functions are set to default values, it means that all vertices/edges should be included.
+
+For other methods provided by the Snapshot class, please refer to the detailed C++ API documentation (olap_on_db.h).
+
+### 2.2. Traversal
+
+A common type of analysis in graph databases is to start from one or more vertices and iteratively expand and access their neighbors. Although this type of analysis can be done using Cypher, its performance is limited by the serial interpretation and execution when the depth of traversal is large. Writing stored procedures using the C++ Core API eliminates the overhead of interpretation but is still limited by the processing power of a single thread.
+
+In order to enable users to accelerate these types of analysis tasks through parallel processing, we have wrapped a Traversal framework based on the C++ OLAP API. Users can directly use the FrontierTraversal and PathTraversal classes in this framework to perform iterative traversal analysis tasks. For specific usage instructions, please refer to the corresponding C++ API documentation (lgraph_traversal.h).
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+This method can be used to find all vertices that satisfy a certain condition (when the filter returns true). When the "parallel" parameter is set to true, the search process will be executed in parallel.
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+This method can be used to extract (VertexData type) properties from a specified set of vertices (frontier) using the extract method. When the "parallel" parameter is set to true, the extraction process will be executed in parallel.
+
+FrontierTraversal is suitable for cases where only the traversed set of vertices is of interest. When a user needs to access information along the path (vertices/edges along the path) in the traversal process or result, PathTraversal needs to be used. Both types of traversal have four parameters in their constructor, namely the database handle db, transaction handle txn, options flags and capacity. The available options include the following combinations: TRAVERSAL_PARALLEL indicates that multiple threads are used for parallel traversal; TRAVERSAL_ALLOW_REVISITS indicates that vertices can be visited repeatedly during traversal (PathTraversal implicitly includes this option).
+capacity indicates the capacity of the path collection during initialization.
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+Both types of traversal have three ways to set the starting vertex/vertex set for traversal. The first two methods directly specify the vertex ID, while the last method is similar to FindVertices.
+
+Both types of traversal start from the set of vertices in the current layer. They use the extension function to access each outgoing edge/incoming edge/outgoing and incoming edges, and use a user-defined filter function to determine if the extension is successful. If successful, the neighboring vertex/appended path with the edge is added to the set of vertices/paths in the next layer.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+The above describes the three traversal methods of FrontierTraversal. It starts from the current set of vertices and, for each vertex in the set, iterates through each outgoing edge/incoming edge/outgoing and incoming edges. If the edge or neighbor vertex satisfies the user-defined filter conditions (where edge_filter is the filter function for edges and neighbour_filter is the filter function for neighbor vertices), the neighbor vertex is added to the new set of vertices.
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+After the expansion of the current set of vertices is finished, the new set of vertices can be obtained using the above method.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+The three traversal methods of PathTraversal are similar to FrontierTraversal, except that the user-defined filter function adds two additional parameters: Path, which contains the path before the new edge is expanded, and IteratorHelper, which can be used to convert the vertices/edges in the path to corresponding iterators in the database. The relevant documentation can be found in the corresponding C++ API documentation.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.md
new file mode 100644
index 0000000000..04b8900e79
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.md
@@ -0,0 +1,11642 @@
+
+
+             
+  <section id="c-stored-procedures">
+
+<div class="toctree-wrapper compound">
+</div>
+<section id="base64-encode">
+<h2>base64_encode<a class="headerlink" href="#base64-encode" title="Permalink to this headline"></a></h2>
+<p>Base64 encode and decode. Simple implementation, to be used with BLOB fields. If performance is important, look for an optimized implementation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_api">
+<span id="_CPPv310lgraph_api"></span><span id="_CPPv210lgraph_api"></span><span id="lgraph_api"></span><span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><a class="headerlink" href="#_CPPv410lgraph_api" title="Permalink to this definition"></a><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base64E">
+<span id="_CPPv3N10lgraph_api6base64E"></span><span id="_CPPv2N10lgraph_api6base64E"></span><span id="lgraph_api::base64"></span><span class="target" id="namespacelgraph__api_1_1base64"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6base64E" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="lgraph_api::base64::Encode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1a18e9a89247359b1a4abc31183a17f8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to encode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The encoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="lgraph_api::base64::Encode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1c276e294945b5f438b8ea942692e730"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__cCP.s.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac29334d4c57dcc18603ff6ad813e6cb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ret</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string. </p></li>
+<li><p><strong>ret</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__ssCR.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a970296461b9202f8fb91e56590fb160b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">out</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string to decode. </p></li>
+<li><p><strong>out</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="lgraph_api::base64::Decode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac2d795c4f1fcd79f41e3bb8591c03c81"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="lgraph_api::base64::Decode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ab07cfe3bb273d86861a477a435a7686a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph">
+<h2>lgraph<a class="headerlink" href="#lgraph" title="Permalink to this headline"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.LGAPI">
+<span class="target" id="lgraph_8h_1ad89ce29b199ac3372f644ffc910a466a"></span><span class="sig-name descname"><span class="n"><span class="pre">LGAPI</span></span></span><a class="headerlink" href="#c.LGAPI" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12GetSignatureE">
+<span id="_CPPv3N10lgraph_api12GetSignatureE"></span><span id="_CPPv2N10lgraph_api12GetSignatureE"></span><span id="lgraph_api::GetSignature"></span><span class="target" id="namespacelgraph__api_1a0e7238ee4b0e28208b594b2bc334b031"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSignature</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7SigSpecE" title="lgraph_api::SigSpec"><span class="n"><span class="pre">SigSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sig_spec</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12GetSignatureE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7ProcessE">
+<span id="_CPPv3N10lgraph_api7ProcessE"></span><span id="_CPPv2N10lgraph_api7ProcessE"></span><span id="lgraph_api::Process"></span><span class="target" id="namespacelgraph__api_1abc0e7fd5062a22bca6290439450eb245"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Process</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7ProcessE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12ProcessInTxnE">
+<span id="_CPPv3N10lgraph_api12ProcessInTxnE"></span><span id="_CPPv2N10lgraph_api12ProcessInTxnE"></span><span id="lgraph_api::ProcessInTxn"></span><span class="target" id="namespacelgraph__api_1afb8681ba4f3cc04bdc96b9b8ccc17775"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessInTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6ResultE" title="lgraph_api::Result"><span class="n"><span class="pre">Result</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12ProcessInTxnE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-atomic">
+<h2>lgraph_atomic<a class="headerlink" href="#lgraph-atomic" title="Permalink to this headline"></a></h2>
+<p>Implementation of atomic operations, used in lgraph_traversal. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api3casEbP1T1T1T">
+<span id="_CPPv3I0EN10lgraph_api3casEP1T1T1T"></span><span id="_CPPv2I0EN10lgraph_api3casEP1T1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab1806f690b319d23b933206cd295f745"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cas</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">ptr</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">oldv</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">newv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_minEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_minEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_minEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1acd8330b393c3cb2b46c461119f4aa484"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_min</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_maxEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_maxEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_maxEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a451eee503d74e69ad9fc6db943ee446f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_max</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_addEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_addEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_addEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab5f65d4fa238b2bc6675bba789e5d635"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_add__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a17b724a3f516c98594033b9cbf7e2dd6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_add__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1ae1334e7bca1be121f4a9099ee1499872"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="lgraph_api::write_add__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1ab7aec34df35e5fe40f87f17cd8384759"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="lgraph_api::write_add__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a4688a3165d87b264a0f0e0d747add460"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_subEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_subEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_subEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a34d077b3ffee356fb73bdc35a7cb8819"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_sub__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a3e0a202ef30dd1729c3671b217c7a0b3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_sub__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1aa321f049db89fbc2c821e62ede09b00e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="lgraph_api::write_sub__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1adc6709b36af7ba0701e624044f2cf9d0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="lgraph_api::write_sub__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a15cf35d73dc33e1a0fad97647beaca63"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-date-time">
+<h2>lgraph_date_time<a class="headerlink" href="#lgraph-date-time" title="Permalink to this headline"></a></h2>
+<p>Implemnets the DateTime, Date and TimeZone classes. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="lgraph_api::MinDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a7d4a5022a392e2f121804ec89c1f4819"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="lgraph_api::MaxDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a57143a0e3c25aaa249ec45411aeed284"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Maximum days since epoch for date. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MinMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ace6f22166909871827c64134bc108c4f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MaxMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ae9241a416800bd43775b274c3d68b24a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Maximum microseconds since epoch for date time. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api4DateE"></span><span id="lgraph_api::Date"></span><span class="target" id="classlgraph__api_1_1Date"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4DateE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> class. Range of dates is from 0/1/1 to 12/31/9999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateEv">
+<span id="_CPPv3N10lgraph_api4Date4DateEv"></span><span id="_CPPv2N10lgraph_api4Date4DateEv"></span><span id="lgraph_api::Date::Date"></span><span class="target" id="classlgraph__api_1_1Date_1aff49fc2cda4491ff4457ca481bb8edf9"></span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with the date set to 1970/1/1. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::Date::Date__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1Date_1a1d304cb3d2f5bedd0a4585c4a1e6af70"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified time. The time point must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>tp</strong> – Time point to set the date to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay">
+<span id="_CPPv3N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="_CPPv2N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="lgraph_api::Date::Date__YearMonthDayCR"></span><span class="target" id="classlgraph__api_1_1Date_1ac753f0ab0017908da2e04a5601fbbb02"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymd</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified date. The date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>ymd</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateE7int32_t">
+<span id="_CPPv3N10lgraph_api4Date4DateE7int32_t"></span><span id="_CPPv2N10lgraph_api4Date4DateE7int32_t"></span><span id="lgraph_api::Date::Date__int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1afb34a93316bafa170db694675f3ba391"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateE7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to an offset from epoch, i.e. the date is set to the specified number of days from epoch. The result date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days_since_epoch</strong> – Number of days since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="lgraph_api::Date::Date__ssCR"></span><span class="target" id="classlgraph__api_1_1Date_1aa34be0efffbb041680f06e2e51226b64"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from a YYYY-MM-DD string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if the string is not in the correct format.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>str</strong> – The string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv">
+<span id="_CPPv3NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="_CPPv2NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="lgraph_api::Date::GetYearMonthDayC"></span><span class="target" id="classlgraph__api_1_1Date_1ab2d9b29e32b6adb74401c6d85fd5ffb0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYearMonthDay</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The year month day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateplEi">
+<span id="_CPPv3NK10lgraph_api4DateplEi"></span><span id="_CPPv2NK10lgraph_api4DateplEi"></span><span id="lgraph_api::Date::add-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1ad3fe85f66511da6deb3ca8d54edf51bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateplEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a number of days to the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatepLEi">
+<span id="_CPPv3N10lgraph_api4DatepLEi"></span><span id="_CPPv2N10lgraph_api4DatepLEi"></span><span id="lgraph_api::Date::add-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1a3b36b3e6261a05420139a4eba5eea5dd"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatepLEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a number of days to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Reference to the current date. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DatemiEi">
+<span id="_CPPv3NK10lgraph_api4DatemiEi"></span><span id="_CPPv2NK10lgraph_api4DatemiEi"></span><span id="lgraph_api::Date::sub-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1a54622b3edddecff4df3c9f572a7cdcc5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DatemiEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of days from the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatemIEi">
+<span id="_CPPv3N10lgraph_api4DatemIEi"></span><span id="_CPPv2N10lgraph_api4DatemIEi"></span><span id="lgraph_api::Date::sub-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1aaa15a5d3c4427b09ebb8e2bba5de64b5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatemIEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of days from the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Reference to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateltERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateltERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateltERK4Date"></span><span id="lgraph_api::Date::lt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abf811a8c8e2765b24426cc2ff6fe13f9"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateltERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateleERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateleERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateleERK4Date"></span><span id="lgraph_api::Date::lte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1a3c9beee445a203e18d4a9145132f7b2f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateleERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategtERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategtERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategtERK4Date"></span><span id="lgraph_api::Date::gt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1af35d39c86aa4c554db7e553b09708907"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategtERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategeERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategeERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategeERK4Date"></span><span id="lgraph_api::Date::gte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abd180b0c29b2c846b8d58e2b4c9e822a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategeERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateeqERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateeqERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateeqERK4Date"></span><span id="lgraph_api::Date::eq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1ac8e2b0b0dfb86a868f9d602643a58dae"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateeqERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateneERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateneERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateneERK4Date"></span><span id="lgraph_api::Date::neq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1aec998ec2d30eb9705f995cf55907dae4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateneERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="lgraph_api::Date::DaysSinceEpochC"></span><span class="target" id="classlgraph__api_1_1Date_1aba5994b68821ee6127c84c8134823f8a"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DaysSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api4Date10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api4Date10GetStorageEv"></span><span id="lgraph_api::Date::GetStorageC"></span><span class="target" id="classlgraph__api_1_1Date_1ad8100ffff03d1b59ec5eae1e166b7979"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date10GetStorageEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv7int32_tEv">
+<span id="_CPPv3NK10lgraph_api4Datecv7int32_tEv"></span><span id="_CPPv2NK10lgraph_api4Datecv7int32_tEv"></span><span id="lgraph_api::Date::castto-int32_t-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1acdefe8b0c57d12e7de99a1f168a4f60e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv7int32_tEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date9TimePointEv">
+<span id="_CPPv3NK10lgraph_api4Date9TimePointEv"></span><span id="_CPPv2NK10lgraph_api4Date9TimePointEv"></span><span id="lgraph_api::Date::TimePointC"></span><span class="target" id="classlgraph__api_1_1Date_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date9TimePointEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the timepoint corresponding to this date at 00:00 am. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date8ToStringEv">
+<span id="_CPPv3NK10lgraph_api4Date8ToStringEv"></span><span id="_CPPv2NK10lgraph_api4Date8ToStringEv"></span><span id="lgraph_api::Date::ToStringC"></span><span class="target" id="classlgraph__api_1_1Date_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the string representation of the date in the format of YYYY-MM-DD. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv8DateTimeEv">
+<span id="_CPPv3NK10lgraph_api4Datecv8DateTimeEv"></span><span id="_CPPv2NK10lgraph_api4Datecv8DateTimeEv"></span><span id="lgraph_api::Date::castto-DateTime-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1af6857cebc4d28eb784e6bdbac1fe0ba9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv8DateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object corresponding to 00:00 am on this date. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="lgraph_api::Date::Parse__ssCR.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1aad607a219665901350781e377d7b82ee"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="lgraph_api::Date::Parse__cCP.cCP.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1a7c3a61e8da1dbf48e1b7f2b65550d815"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The result.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 10), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date3NowEv">
+<span id="_CPPv3N10lgraph_api4Date3NowEv"></span><span id="_CPPv2N10lgraph_api4Date3NowEv"></span><span id="lgraph_api::Date::Now"></span><span class="target" id="classlgraph__api_1_1Date_1a3e7d4298fa0246f18cb55d621635b2bc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date3NowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date8LocalNowEv">
+<span id="_CPPv3N10lgraph_api4Date8LocalNowEv"></span><span id="_CPPv2N10lgraph_api4Date8LocalNowEv"></span><span id="lgraph_api::Date::LocalNow"></span><span class="target" id="classlgraph__api_1_1Date_1aac31515c859f4e327724992a762ca42f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date8LocalNowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date17days_since_epoch_E">
+<span id="_CPPv3N10lgraph_api4Date17days_since_epoch_E"></span><span id="_CPPv2N10lgraph_api4Date17days_since_epoch_E"></span><span id="lgraph_api::Date::days_since_epoch___int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1ac7f1cae7e807741a698b319ead8869cc"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">days_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date17days_since_epoch_E" title="Permalink to this definition"></a><br></dt>
+<dd><p>The days since epoch. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDayE"></span><span id="lgraph_api::Date::YearMonthDay"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YearMonthDay</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Structure representing a date in the format of year, month and day. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay4yearE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="lgraph_api::Date::YearMonthDay::year__i"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay4yearE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The year, 0-9999. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay5monthE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="lgraph_api::Date::YearMonthDay::month__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay5monthE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Month, 1-12. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay3dayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="lgraph_api::Date::YearMonthDay::day__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay3dayE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Day, 1-31. </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api8DateTimeE"></span><span id="lgraph_api::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimeE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> class that holds <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the range of 0000-01-01 00:00:00.000000 to 9999-12-31 23:59:59.999999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeEv">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeEv"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeEv"></span><span id="lgraph_api::DateTime::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime_1a3e93cd7baeb8b4448482a450df21ab20"></span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the epoch time, i.e., 1970-1-1 00:00:00. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::DateTime::DateTime__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1acf8d529b725b6346cad668a4b7d6f5cf"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified timepoint. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>tp</strong> – Timepoint to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="lgraph_api::DateTime::DateTime__YMDHMSFCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a58680ad139b71f8686734b52e6a4d545"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymdhmsf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in <a class="reference internal" href="#structlgraph__api_1_1DateTime_1_1YMDHMSF"><span class="std std-ref">YMDHMSF</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>ymdhmsf</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and time to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="lgraph_api::DateTime::DateTime__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae5e26b24f48dd42cffd98d526bd74aab"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">microseconds_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to specified number of microseconds since epoch. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>microseconds_since_epoch</strong> – Number of microseconds since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="lgraph_api::DateTime::DateTime__ssCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae891fafda07463e06dbee5b88203da54"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in the form of YYYY-MM-DD HH:MM:SS[.FFFFFF]. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if str has invalid format.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>str</strong> – String representation of the date and time in the form of YYYY-MM-DD HH:MM:SS. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="lgraph_api::DateTime::GetYMDHMSFC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5027ca2fdaa6be6b27f7d4acb2bfabf7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYMDHMSF</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the form of year, month, day, hour, minute, second, fraction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The ymdhmsf. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeplE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimeplE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimeplE7int64_t"></span><span id="lgraph_api::DateTime::add-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5da5a7459ddc40a149081b898ea98951"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeplE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a number of microseconds to the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of micorseconds to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimepLE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimepLE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimepLE7int64_t"></span><span id="lgraph_api::DateTime::add-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5bdd35f5b63bc64bb6af19e96fa9e803"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimepLE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a number of microseconds to the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to add.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimemiE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimemiE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimemiE7int64_t"></span><span id="lgraph_api::DateTime::sub-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1afcd73eec42253057720a4a0d140e5eee"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimemiE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimemIE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimemIE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimemIE7int64_t"></span><span id="lgraph_api::DateTime::sub-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5a80be41155d8105875e8a3eb51c2c7b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimemIE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeltERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="lgraph_api::DateTime::lt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a16dffc2ee84f6e10fd3271e9b0cb5306"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeltERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeleERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="lgraph_api::DateTime::lte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a40adc1eacbf9ed88ac1cc35dc3d51f30"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeleERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegtERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="lgraph_api::DateTime::gt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae96fabdd15f3dfd300e7d399b12305bc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegtERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegeERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="lgraph_api::DateTime::gte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1adc2ea02a36b0f48b50f6e863facd20e6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegeERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="lgraph_api::DateTime::eq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a30d73527665a6b136070874aeb9b4c2e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeneERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="lgraph_api::DateTime::neq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac9b0839d6be50242b118d69b0ead3e24"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeneERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="lgraph_api::DateTime::MicroSecondsSinceEpochC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7576b1eff7b32d33fef2cfc541c0d7ae"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MicroSecondsSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetStorageEv"></span><span id="lgraph_api::DateTime::GetStorageC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a92a5a81985fd01aa29a8923985ee350a"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetStorageEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv7int64_tEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="lgraph_api::DateTime::castto-int64_t-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a9223b52f5d6412f67b24aaa89c360d7c"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv7int64_tEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime9TimePointEv">
+<span id="_CPPv3NK10lgraph_api8DateTime9TimePointEv"></span><span id="_CPPv2NK10lgraph_api8DateTime9TimePointEv"></span><span id="lgraph_api::DateTime::TimePointC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime9TimePointEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the timepoint correponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime8ToStringEv">
+<span id="_CPPv3NK10lgraph_api8DateTime8ToStringEv"></span><span id="_CPPv2NK10lgraph_api8DateTime8ToStringEv"></span><span id="lgraph_api::DateTime::ToStringC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of the date and time in the form of YYYY-MM-DD HH:MM:SS.[ffffff]. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv4DateEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv4DateEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv4DateEv"></span><span id="lgraph_api::DateTime::castto-Date-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a8049aeab68ea779547e65cd4b2058bd1"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv4DateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv">
+<span id="_CPPv3N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="_CPPv2N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="lgraph_api::DateTime::ConvertToUTC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a56e9bf4e6d3c6e9610e1f572f112d13c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToUTC</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the UTC time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a local time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Object converted to an UTC.</p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv">
+<span id="_CPPv3N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="_CPPv2N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="lgraph_api::DateTime::ConvertToLocal"></span><span class="target" id="classlgraph__api_1_1DateTime_1ad05a5ca52a97c6a3c4e4c62bbcdd0ff9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToLocal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the local time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Object converted to a local.</p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="lgraph_api::DateTime::Parse__ssCR.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a53252357cbc4cfe0040f4b0c31a6ca93"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="lgraph_api::DateTime::Parse__cCP.cCP.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7f3b51df42213d000e5cf8499fc9583f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[inout]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 19 or 26), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime3NowEv">
+<span id="_CPPv3N10lgraph_api8DateTime3NowEv"></span><span id="_CPPv2N10lgraph_api8DateTime3NowEv"></span><span id="lgraph_api::DateTime::Now"></span><span class="target" id="classlgraph__api_1_1DateTime_1afdf6bfab9c1625bea9fe0d88052eb9be"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime3NowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8LocalNowEv">
+<span id="_CPPv3N10lgraph_api8DateTime8LocalNowEv"></span><span id="_CPPv2N10lgraph_api8DateTime8LocalNowEv"></span><span id="lgraph_api::DateTime::LocalNow"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac419c09087e3dfbeb9b13a52cf5ca63b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8LocalNowEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E">
+<span id="_CPPv3N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="_CPPv2N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="lgraph_api::DateTime::microseconds_since_epoch___int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a35d4677c58d7dc9be8f6566632ef33ea"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">microseconds_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSFE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSFE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSFE"></span><span id="lgraph_api::DateTime::YMDHMSF"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YMDHMSF</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Representation of a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in year, month, day, hour, minute, second, fraction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="lgraph_api::DateTime::YMDHMSF::year__i"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The year, 0-9999. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="lgraph_api::DateTime::YMDHMSF::month__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The month, 1-12. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="lgraph_api::DateTime::YMDHMSF::day__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The day, 1-31. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="lgraph_api::DateTime::YMDHMSF::hour__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a7f39b6fc12f0b04a38625ff3040dd30c"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">hour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The hour, 0-23. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="lgraph_api::DateTime::YMDHMSF::minute__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a408e3d60d59afc5b5a6f35ac9f5c8fbb"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">minute</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The minute, 0-59. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="lgraph_api::DateTime::YMDHMSF::second__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1af7633c5cbb76481bafd5e3e1ec07ca37"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">second</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The second, 0-59. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="lgraph_api::DateTime::YMDHMSF::fraction__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a4a3d5aea78d5e1e01c7be45e6990456f"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fraction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The fraction 000000-999999. </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZoneE">
+<span id="_CPPv3N10lgraph_api8TimeZoneE"></span><span id="_CPPv2N10lgraph_api8TimeZoneE"></span><span id="lgraph_api::TimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZoneE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>A class that represents a time zone. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone8TimeZoneEi">
+<span id="_CPPv3N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="_CPPv2N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="lgraph_api::TimeZone::TimeZone__i"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a4cbdd9521cf61ed9457984aeff9c4e13"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">time_diff_hours</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone8TimeZoneEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Create a timezone which has time difference with UTC in hours time_diff_hours. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidParameter</span></span></span> – Thrown if time_diff_hours is invalid.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>time_diff_hours</strong> – (Optional) Difference between local timezone and UTC. Must be &gt; =-10 &amp;&amp; &lt;=14. Otherwise the function will throw. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::FromUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae70105315a4e43ef16dcc94d07a69769"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FromUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from UTC time to this time zone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC time.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::ToUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1aa0d29ab9305bb5efa5bd1cdc48647086"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from this timezone to UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="lgraph_api::TimeZone::UTCDiffSecondsC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a9aaed281da56442099de67e51fe47638"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffSeconds</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns diff from UTC in seconds, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of seconds local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="lgraph_api::TimeZone::UTCDiffHoursC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a56914c89b37c60dcfc9db708d3a89446"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffHours</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns diff from UTC in hours, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of hours local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::LocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A const reference to local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::UpdateLocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae9cf01b0a4d1e6cfc21306569d8260f0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpdateLocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Update local timezone, used only when daylight saving time changes. Daylight saving time may change after LocalTZ was initialized, in which case we need to update it. This function will update all references returned by <a class="reference internal" href="#classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"><span class="std std-ref">LocalTimeZone()</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E">
+<span id="_CPPv3N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="_CPPv2N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="lgraph_api::TimeZone::time_diff_microseconds___int64_t"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a32810c21702584e4d3090242818cbb06"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">time_diff_microseconds_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="lgraph_api::TimeZone::GetLocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a27c488e750c5dc4247d99d4db241b0bf"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone7LocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone7LocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone7LocalTZEv"></span><span id="lgraph_api::TimeZone::LocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a8aa7218fc3680021035c689a23159760"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone7LocalTZEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-db">
+<h2>lgraph_db<a class="headerlink" href="#lgraph-db" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46lgraph">
+<span id="_CPPv36lgraph"></span><span id="_CPPv26lgraph"></span><span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><a class="headerlink" href="#_CPPv46lgraph" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskEv"></span><span id="lgraph_api::ShouldKillThisTask"></span><span class="target" id="namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Determine if we should kill current task. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if a KillTask command was issued for this task, either due to user request or timeout. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16GetThreadContextEv">
+<span id="_CPPv3N10lgraph_api16GetThreadContextEv"></span><span id="_CPPv2N10lgraph_api16GetThreadContextEv"></span><span id="lgraph_api::GetThreadContext"></span><span class="target" id="namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"></span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetThreadContext</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api16GetThreadContextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets thread context pointer, which can then be used in ShouldKillThisTask(ctx). Calling <a class="reference internal" href="#namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"><span class="std std-ref">ShouldKillThisTask()</span></a> is equivalent to ShouldKillThisTask(GetThreadContext()). In order to save the cost of <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>, you can store the context and use it in ShouldKillThisTask(ctx). </p>
+<p>Example: ```c++ ThreadContextPtr ctx = <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>; while (HasMoreWorkToDo()) { if (ShouldKillThisTask(ctx)) { break; } DoWork(); } ```</p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The thread context. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="lgraph_api::ShouldKillThisTask__ThreadContextPtr"></span><span class="target" id="namespacelgraph__api_1a842a962cb406dd251be8aeb492510b6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ctx</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr" title="Permalink to this definition"></a><br></dt>
+<dd><p>Determine if we should kill the task currently running in the thread identified by ctx. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>ctx</strong> – The context, as obtained with GetThreadContext.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if a KillTask command was issued for this task. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1a340bf8a3bf351920b9c20fe861372bcf"></span><span class="sig-name descname"><span class="pre">const</span> <span class="pre">typedef</span> <span class="pre">void</span> <span class="pre">*</span> <span class="pre">ThreadContextPtr</span></span></dt>
+<dd><p>Defines an alias representing the thread context pointer. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBE">
+<span id="_CPPv3N10lgraph_api7GraphDBE"></span><span id="_CPPv2N10lgraph_api7GraphDBE"></span><span id="lgraph_api::GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_db.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> represents a graph instance. In TuGraph, each graph instance has its own schema and access control settings. Accessing a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> without appropriate access rights yields WriteNotAllowed. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> becomes invalid if <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a> is called, in which case all transactions and iterators associated with that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> become invalid. Further operation on that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> yields InvalidGraphDB. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="lgraph_api::GraphDB::GraphDB__lgraph::AccessControlledDBP.b.b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8ed8306aab2d4ea17475888d25737f69"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db_with_access_control</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">owns_db</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb" title="Permalink to this definition"></a><br></dt>
+<dd><p>For internal use only. Users should use <a class="reference internal" href="#classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"><span class="std std-ref">Galaxy::OpenGraph()</span></a> to get <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5884af0fb5900e58a13e6cf2c64e9061"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a43a244ebb2089430b84e50667e89d015"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBD0Ev">
+<span id="_CPPv3N10lgraph_api7GraphDBD0Ev"></span><span id="_CPPv2N10lgraph_api7GraphDBD0Ev"></span><span id="lgraph_api::GraphDB::~GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad0d3a9bb78624594d45104c0ec3566d2"></span><span class="sig-name descname"><span class="n"><span class="pre">~GraphDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5CloseEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5CloseEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5CloseEv"></span><span id="lgraph_api::GraphDB::Close"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Close the graph. This will close the graph and release all transactions, iterators associated with the graph. After calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a>, the graph becomes invalid, and cannot be used anymore. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="lgraph_api::GraphDB::CreateReadTxn"></span><span class="target" id="classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateReadTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Creates a read transaction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The new read transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb">
+<span id="_CPPv3N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="_CPPv2N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="lgraph_api::GraphDB::CreateWriteTxn__b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateWriteTxn</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">optimistic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Creates a write transaction. Write operations can only be performed in write transactions, otherwise exceptions will be thrown. A write transaction can be optimistic. Optimistic transactions can run in parallel and any conflict will be detected during commit. If a transaction conflicts with an ealier one, a TxnConflict will be thrown during commit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>optimistic</strong> – (Optional) True to create an optimistic transaction.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The new write transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction">
+<span id="_CPPv3N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="_CPPv2N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="lgraph_api::GraphDB::ForkTxn__TransactionR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForkTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd><p>Forks a read transaction. The resulting read transaction will share the same view as the forked one, meaning that when reads are performed on the same vertex/edge, the results will always be identical, whether they are performed in the original transaction or the forked one. Only read transactions can be forked. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"><span class="std std-ref">ForkTxn()</span></a> on a write txn causes an InvalidFork to be thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidFork</span></span></span> – Thrown when txn is a write transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>txn</strong> – <strong>[in]</strong> The read transaction to be forked.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A new read <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> that shares the same view with txn. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5FlushEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5FlushEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5FlushEv"></span><span id="lgraph_api::GraphDB::Flush"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Flush</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5FlushEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Flushes buffered data to disk. If there have been some async transactions, there could be data that are written to this graph, but not persisted to disk yet. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"><span class="std std-ref">Flush()</span></a> will persist the data and prevent data loss in case of system crash. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB11DropAllDataEv">
+<span id="_CPPv3N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="_CPPv2N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="lgraph_api::GraphDB::DropAllData"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a784e2f7141aaed6b547faaaf52e87880"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB11DropAllDataEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Drop all the data in the graph, including labels, indexes and vertexes/edges.. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="lgraph_api::GraphDB::DropAllVertex"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad51e4783ef7de143949c05311a0f2b54"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Drop all vertex and edges but keep the labels and indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="lgraph_api::GraphDB::EstimateNumVertices"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8434ac9ad087a3f57b96f6c8bed664d6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EstimateNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Estimate number of vertices. We don’t maintain the exact number of vertices, but only the next vid. This function actually returns the next vid to be used. So if you have deleted a lot of vertices, the result can be quite different from actual number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Estimated number of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="lgraph_api::GraphDB::AddVertexLabel__ssCR.std::vector:FieldSpec:CR.VertexOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0c0f79500ca028b8342cc6af9b363c83"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="lgraph_api::VertexOptions"><span class="n"><span class="pre">VertexOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the schema is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>primary_field</strong> – The primary field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteVertexLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6d74b689bd295b71c8857f26b77cb4a2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes a vertex label and all the vertices with this label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a15a25572790ab89a16815409cbc5a869"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes fields in a vertex label. This function also updates the vertex data and indices accordingly to make sure the database remains in consistent state. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or some fields cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – Labels of the fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1abdca8d18155cbb711386a18d8f206c66"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fields to a vertex label. The new fields in existing vertices will be filled with default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field already exists.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The add fields. </p></li>
+<li><p><strong>default_values</strong> – The default values of the newly added fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3becea45eab0d50d4c09232b211944d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify fields in a vertex label, either chage the data type or optional, or both. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The new specification of the modified fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="lgraph_api::GraphDB::AddEdgeLabel__ssCR.std::vector:FieldSpec:CR.EdgeOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3c5434fc9c650a6f09465c32db1b16d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add a edge label, specifying its schema. It is allowed to specify edge constrains, too. An edge can be bound to several (source_label, destination_label) pairs, which makes sure this type of edges will only be added between these types of vertices. By default, the constain is empty, meaning that the edge is not restricted. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if invalid schema (invalid specification, re- definition of the same field, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>temporal_field</strong> – The temporal field for tid. </p></li>
+<li><p><strong>edge_constraints</strong> – (Optional) The edge constraints. An empty constrain means no restriction.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteEdgeLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0bf6aee53c6c7412806a6a1dcdcd6377"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes an edge label and all the edges of this type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="lgraph_api::GraphDB::AlterLabelModEdgeConstraints__ssCR.std::vector:std::pair:ss.ss::CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7ab2ca321e3bd68c1a9f33aeaa3bd747"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterLabelModEdgeConstraints</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify edge constraint. Existing edges that violate the new constrain will be removed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any vertex label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>constraints</strong> – The new edge constraint.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a08241fee881005b37982621a31fb5e00"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes fields in an edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – The fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of edges modified.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab43144d999e3f539a42c5aa6a4ec21c0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fields to an edge label. The new fields in existing edges will be set to default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field already exists, or the default value is of incompatible type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The fields to add. </p></li>
+<li><p><strong>default_values</strong> – The default values. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aae83cf6042c04347d6cc6147289bced0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify fields in an edge label. Data type and OPTIONAL can be modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The modifier fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddVertexIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4e0da14c082f2be3f4d29ef888daad64"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field</strong> – The field name. </p></li>
+<li><p><strong>is_unique</strong> – True if is unique index, false if not.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddEdgeIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aa33f376759b00da1070c16167f8650bf"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>is_unique</strong> – True if the field content is unique for each vertex.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType"></span><span id="lgraph_api::GraphDB::AddVertexCompositeIndex__ssCR.std::vector:ss:CR.CompositeIndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1afffc035485855bc3f44ef01bd488d64b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fields</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="lgraph_api::CompositeIndexType"><span class="n"><span class="pre">CompositeIndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check if this vertex_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check if this edge_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::GraphDB::IsVertexCompositeIndexed__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a2f37f96ce8798934819071be98abb901"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexCompositeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5dd0b2831686ab10c9cf641b1f5a04c8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the index to ‘vertex_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::GraphDB::DeleteVertexCompositeIndex__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac9bde44178388ef9fce8ca86b28d6a4b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fields</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0b04c7d95efa608199ffd43074698a26"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the index to ‘edge_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="lgraph_api::GraphDB::GetDescriptionC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a10eafac774946c9fda6acd8368e6b254"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDescription</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get graph description. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The description. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="lgraph_api::GraphDB::GetMaxSizeC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3cd10a9d8a077a9b838fecc8d894550c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetMaxSize</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get maximum graph size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The maximum size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a1f9045086aaa5274c657b8020ed8d314"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fulltext index to ‘vertex_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad67d845d1e7c6d3a230ebca0eac15138"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Add fulltext index to ‘edge_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2d13791623a99511d3d743e811097b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘vertex_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab7e3ee69c450474f77d621b7310b1621"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘edge_label:field’. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="lgraph_api::GraphDB::RebuildFullTextIndex__std::set:ss:CR.std::set:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6902d07efdba3ff5c2be81311534e752"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RebuildFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_labels</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_labels</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Rebuild the fulltext index of <code class="docutils literal notranslate"><span class="pre">vertex_labels</span></code> and <code class="docutils literal notranslate"><span class="pre">edge_labels</span></code>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_labels</strong> – The vertex labels whose fulltext index need to rebuild. </p></li>
+<li><p><strong>edge_labels</strong> – The edge labels whose fulltext index need to rebuild. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="lgraph_api::GraphDB::ListFullTextIndexes"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ae2b1b58ffc70106433bee030842e3e27"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListFullTextIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List fulltext indexes of vertex and edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Format of returned data : (is_vertex, label_name, property_name) </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryVertexByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a696a8bc40c23002921ccd4983b1e2550"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryVertexByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query vertex by fulltext index. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The vertex label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Vertex vids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryEdgeByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4f09813ea8812322180569bd2b48fe05"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryEdgeByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query edge by fulltext index. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The edge label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Edge uids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12RefreshCountEv">
+<span id="_CPPv3N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="_CPPv2N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="lgraph_api::GraphDB::RefreshCount"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ade8d799b8354403e99298d493a3509f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshCount</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12RefreshCountEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Recount the total number of vertex and edge, stop writing during the count. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3ea21ec359220a8c4e0ea72adb0c1ba0"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copying is disabled. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3bc8ff8539363d5511d9a6936bae7899"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB3db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB3db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB3db_E"></span><span id="lgraph_api::GraphDB::db___lgraph::AccessControlledDBP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a35f581fb0d14734506768c1a61296979"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17should_delete_db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="lgraph_api::GraphDB::should_delete_db___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac2e6f7ca5ee0fc92e2579a7de9303eac"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">should_delete_db_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17should_delete_db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB10read_only_E">
+<span id="_CPPv3N10lgraph_api7GraphDB10read_only_E"></span><span id="_CPPv2N10lgraph_api7GraphDB10read_only_E"></span><span id="lgraph_api::GraphDB::read_only___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac22ad4698a78f7e4ab74ec4450647125"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">read_only_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB10read_only_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-index-iterator">
+<h2>lgraph_edge_index_iterator<a class="headerlink" href="#lgraph-edge-index-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorE"></span><span id="lgraph_api::EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> can be used to access a set of edges that has the same indexed value. If the index is unique (that is, each Edge has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> will only have one edge unique id, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> is valid iff it points to a valid (index_value, euid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ae51a6e1b90b7343b4012be9cc7ae3daa"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a584635e9e5d92688527dbae26f926f80"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="lgraph_api::EdgeIndexIterator::~EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aa1bb455fd404e4102a0e6b637283db00"></span><span class="sig-name descname"><span class="n"><span class="pre">~EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="lgraph_api::EdgeIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="lgraph_api::EdgeIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="lgraph_api::EdgeIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next edge unique id in the list, which consists of all the valid edge unique ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::EdgeIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the current index value. The euids are sorted in ( EdgeIndexValue, euid) order. When <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one euid to next, possibly moving from one EdgeIndexValue to another. This function tells the EdgeIndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="lgraph_api::EdgeIndexIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the Edge Unique Id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="lgraph_api::EdgeIndexIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="lgraph_api::EdgeIndexIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__lgraph::EdgeIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a2266e13c0886456df166e683e4a04cc5"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1acd1c7e3f9d88fcc2a2fa0dbdbb5b2bf8"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1abda22c9f1d7924e06efe4e12a1986292"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="lgraph_api::EdgeIndexIterator::it___std::unique_ptr:lgraph::EdgeIndexIterator:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a8c447e8d8d6d5ae41372b160dec982b1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="lgraph_api::EdgeIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-iterator">
+<h2>lgraph_edge_iterator<a class="headerlink" href="#lgraph-edge-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph5graphE">
+<span id="_CPPv3N6lgraph5graphE"></span><span id="_CPPv2N6lgraph5graphE"></span><span id="lgraph::graph"></span><span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph5graphE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aa64cc73da05613af93f74fbba0e40685"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a92a989ca7aa12f6bf9312acca6a24b9d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aae356ade132bced19db97d69e2693926"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1ad917857534c392eb3de3718007839e87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1acae8199afd0a5a7026d057a2ede19e29"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a623f694634f9b740f6e8432ad5e8fed7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a145cb4680fe351655b20bcefbf1d10c6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a46e696695da45853cbeb5905719210fa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> can be used to iterate through the in-coming edges of a vertex. Edges are sorted in (lid, tid, src, eid) order, and each (dst, lid, tid, src, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> is valid iff it points to a valid in-coming edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a73ca326056d2877cea6b09a683b8c0ba"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a20741057cf223945a84f2ebe4cb73b2f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="lgraph_api::InEdgeIterator::~InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a299e60d91351d2ceb0da9445d3d53ab9"></span><span class="sig-name descname"><span class="n"><span class="pre">~InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="lgraph_api::InEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4NextEv"></span><span id="lgraph_api::InEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next incoming edge to current destination vertex. If there is no more edge, the iterator becomes invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::InEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Go to the edge specified by euid. If the specified edge cannot be found and nearest==true, then try to get the next in-coming edge to the vertex euid.dst, sorted by (label, tid, src, eid). If there is no such edge, iterator is invalidated and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="lgraph_api::InEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the Edge Unique Id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="lgraph_api::InEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="lgraph_api::InEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets destination vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::InEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::InEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets temporal id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The temporal id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="lgraph_api::InEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::InEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::InEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>All field names and values stored as a {(field_name, field_value),…} map. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="lgraph_api::InEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next incoming edge sorted by (lid, tid, src, eid) if there is any. If no in-coming edge is left for this vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="lgraph_api::InEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__lgraph::graph::InEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a92769487b9004274f36dccbc5b26dc1d"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aaf872d62e0bcd4680527d2c086433151"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5110071efc6781255ae9ce68e3634205"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator3it_E"></span><span id="lgraph_api::InEdgeIterator::it___std::unique_ptr:lgraph::graph::InEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a17c31f91df04ddbd378b1d23c6c18568"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4txn_E"></span><span id="lgraph_api::InEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> can be used to iterate through the out-going edges of a vertex. Edges are sorted in (lid, dst, eid) order, and each (src, lid, tid, dst, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> is valid iff it points to a valid out-going edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1abab68117b55783f6c38a899396f169a3"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a088017d735536fa934b5fb2cba592e43"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="lgraph_api::OutEdgeIterator::~OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa0e08e47018ad64858af8310913383b1"></span><span class="sig-name descname"><span class="n"><span class="pre">~OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="lgraph_api::OutEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::OutEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Go to the edge specified by euid. That is, an edge from Vertex euid.src to euid.dst, with LabelId==euid.label, Tid==euid.tid, and EdgeId==euid.eid. If neareast==true and the exact edge was not found, the iterator tries to get the next edge that sorts after the specified edge. The edges are sorted in (label, tid, dst, eid) order. The iterator becomes invalid if there is no outgoing edge from euid.src that sorts after euid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique ID. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if there is no such edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="lgraph_api::OutEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="lgraph_api::OutEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next edge. Invalidates iterator if there is no more out edges from current source vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails (no more out edge from current source). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="lgraph_api::OutEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the Edge Unique Id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="lgraph_api::OutEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets primary id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The primary id of the edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="lgraph_api::OutEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::OutEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – The name of the field to get.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field id. FieldId can be obtained with txn.GetEdgeFieldId() </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>fid</strong> – fid The field id.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::OutEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>All fields in a dictionary of {(field_name, field_value),…}. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value in string representation. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="lgraph_api::OutEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next out-going edge sorted by (label, tid, dst, eid) if there is any. If there is no more out-going edges for this source vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="lgraph_api::OutEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A std::string that represents this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__lgraph::graph::OutEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aec68967791b2a1c92ff94c646853c14a"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ab98d1e207b5ecce1a7dcea1478577558"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a65896ed24e13cd2af266a344a655419c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator3it_E"></span><span id="lgraph_api::OutEdgeIterator::it___std::unique_ptr:lgraph::graph::OutEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa9051f34e34c3c714096054e271c72a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="lgraph_api::OutEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-exceptions">
+<h2>lgraph_exceptions<a class="headerlink" href="#lgraph-exceptions" title="Permalink to this headline"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.ERROR_CODES">
+<span class="target" id="lgraph__exceptions_8h_1a202796cec2c73e6a15b8ae40423102d2"></span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#c.ERROR_CODES" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.X">
+<span class="target" id="lgraph__exceptions_8h_1a1f09736ce2d0b353925675b9c17f9b58"></span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="n"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.X" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THROW_CODE">
+<span class="target" id="lgraph__exceptions_8h_1a0a6acbf1c6c9172f6be1c808cfa03f10"></span><span class="sig-name descname"><span class="n"><span class="pre">THROW_CODE</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="p"><span class="pre">...</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.THROW_CODE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCodeE">
+<span id="_CPPv3N10lgraph_api9ErrorCodeE"></span><span id="_CPPv2N10lgraph_api9ErrorCodeE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05f"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCode</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode1XE">
+<span id="_CPPv3N10lgraph_api9ErrorCode1XE"></span><span id="_CPPv2N10lgraph_api9ErrorCode1XE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa13397c15c68eb3e5e33a0196e8988a24"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode1XE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE">
+<span id="_CPPv3N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span id="_CPPv2N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa0afdd4a4fb13896180b64bd313a17dc2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode">
+<span id="_CPPv3N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="_CPPv2N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="lgraph_api::ErrorCodeToString__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a13525881a01e59b5a69b74c47d95dcd3"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeToString</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode">
+<span id="_CPPv3N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="_CPPv2N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="lgraph_api::ErrorCodeDesc__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a82ab07d2676a279295157e65beeedcbc"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeDesc</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphExceptionE">
+<span id="_CPPv3N10lgraph_api15LgraphExceptionE"></span><span id="_CPPv2N10lgraph_api15LgraphExceptionE"></span><span id="lgraph_api::LgraphException"></span><span class="target" id="classlgraph__api_1_1LgraphException"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><span class="n"><span class="pre">exception</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphExceptionE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_exceptions.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aa1104fdb0328ecad056440c0498affa5"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.ssCR"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af986a8520040b3af5568e7f4f2b3d813"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.cCP"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af81b58e697be8127dd1310a7297a886b"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts">
+<span id="_CPPv3IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span id="_CPPv2IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="p"><span class="pre">...</span></span><span class="sig-name descname"><span class="n"><span class="pre">Ts</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1LgraphException_1a8cc576c0c99e4c712a0fc91ca67868fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">format</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="lgraph_api::LgraphException::LgraphException::Ts"><span class="n"><span class="pre">Ts</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">...</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4codeEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4codeEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4codeEv"></span><span id="lgraph_api::LgraphException::codeC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a833a074d2f56630e12d5c66e6ebb5862"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4codeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException3msgEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException3msgEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException3msgEv"></span><span id="lgraph_api::LgraphException::msgC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1e6c05d855e126b4ecfaa8241f8cca33"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">msg</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException3msgEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4whatEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4whatEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4whatEv"></span><span id="lgraph_api::LgraphException::whatC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aac1c33909e01e1dfc85617cf2477d3eb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">what</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><span class="w"> </span><span class="k"><span class="pre">override</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4whatEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5code_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5code_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5code_E"></span><span id="lgraph_api::LgraphException::code___ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1ac8cce82dda9537fdb72dac589a6ac5f2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5code_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException4msg_E">
+<span id="_CPPv3N10lgraph_api15LgraphException4msg_E"></span><span id="_CPPv2N10lgraph_api15LgraphException4msg_E"></span><span id="lgraph_api::LgraphException::msg___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1da24fcb3b81cddc8a32815f13997437"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">msg_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException4msg_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5what_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5what_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5what_E"></span><span id="lgraph_api::LgraphException::what___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a415baaef606c6f5e5e1104719a84dc72"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">what_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5what_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-galaxy">
+<h2>lgraph_galaxy<a class="headerlink" href="#lgraph-galaxy" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyE">
+<span id="_CPPv3N10lgraph_api6GalaxyE"></span><span id="_CPPv2N10lgraph_api6GalaxyE"></span><span id="lgraph_api::Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_galaxy.h&gt;</em></div>
+<p>A galaxy is the storage engine for one TuGraph instance. It manages a set of User/Role/GraphDBs. </p>
+<p>A galaxy can be opened in async mode, in which case <em>ALL</em> write transactions will be treated as async, whether they declare async or not. This can come in handy if we are performing a lot of writing, but can cause data loss for online processing. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aff4d727c87112ab1ae56882ed7c90ae8"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The TuGraph dir. </p></li>
+<li><p><strong>durable</strong> – (Optional) True to open in durable mode. If set to false, ALL write transactions are async, whether they declare async or not. </p></li>
+<li><p><strong>create_if_not_exist</strong> – (Optional) If true, the TuGraph DB will be created if dir does not exist; otherwise, an exception is thrown. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.ssCR.ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac04eaf83ff6ed47d4e77bbcb06b432f5"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. Open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> and try to login with specified user and password. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is not correct.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The dir. </p></li>
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>durable</strong> – True to open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> in durable mode. </p></li>
+<li><p><strong>create_if_not_exist</strong> – True to create if DB does not exist. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a57bcd86daa9d4cdbfb367a0e43d8b039"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aead55554e77f85378cd82ece56cfde96"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyD0Ev">
+<span id="_CPPv3N10lgraph_api6GalaxyD0Ev"></span><span id="_CPPv2N10lgraph_api6GalaxyD0Ev"></span><span id="lgraph_api::Galaxy::~Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a00577f1737a890a15dbd7b409a2f1cd8"></span><span class="sig-name descname"><span class="n"><span class="pre">~Galaxy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetCurrentUser__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac428a8a912bf43cf72c9a908ef6c7c15"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetCurrentUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Validate and set current user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a568523d4c1b5a1cde2fafa5fd2d702f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set current user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if token is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The current user. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="lgraph_api::Galaxy::CreateGraph__ssCR.ssCR.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a480909a8d20e7b8a904030fc5be34da0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">description</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">max_size</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="m"><span class="pre">1</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">40</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Validate token and set current user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to create graph. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Other input errors such as invalid graph name, size, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph to create. description (Optional) Description of the graph. max_size (Optional) Maximum size of the graph.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if graph already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteGraph__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1f0d94b15f7b718f6aa4f1dc01656f0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Delete a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to delete graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the graph does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="lgraph_api::Galaxy::ModGraph__ssCR.b.ssCR.b.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4d8cdf497e81b2b9d1fc95f980319a0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ModGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_size</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">new_max_size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Modify graph info. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to modify graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph_name</strong> – Name of the graph. </p></li>
+<li><p><strong>mod_desc</strong> – True to modifier description. </p></li>
+<li><p><strong>desc</strong> – The new description. </p></li>
+<li><p><strong>mod_size</strong> – True to modifier size. </p></li>
+<li><p><strong>new_max_size</strong> – New maximum size.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="lgraph_api::Galaxy::ListGraphsC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a4c64be90601e4a55971798b4272ebf"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListGraphs</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List graphs. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to list graphs.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A dictionary of {graph_name: (description, max_size)} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateUser__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a97e43d10d6b95de4d68ca3c7919bcacb"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Creates a user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if other input errors, such as illegal user name, password, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>desc</strong> – (Optional) The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab111a438ea5f846881da6c03d3e34115"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetPassword__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a29f197aed82ca28992c87b797b5e4186"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetPassword</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">old_password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">new_password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the password of the specified user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission, or curr_user==user, but old_password is incorrect. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if new_password is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user to modify. </p></li>
+<li><p><strong>old_password</strong> – The old password, required if curr_user==user. </p></li>
+<li><p><strong>new_password</strong> – The new password.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUserDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aca1ba2352c5365a0e82f522d79b51219"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets user description. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>desc</strong> – The new description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Galaxy::SetUserRoles__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a0c5796bfe855125cf1b3675c4a3b87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserRoles</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">roles</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the roles of the specified user. If you need to add or delete a role, you will need to use GetUserInfo to get the roles first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any role does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>roles</strong> – A list of roles.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="lgraph_api::Galaxy::SetUserGraphAccess__ssCR.ssCR.AccessLevelCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3f0fcfae10bf1776e39ecc3205fc6c85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserGraphAccess</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets user access rights on a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>access</strong> – The access level.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a0edfd7185553ceb6c81f303acdbf163c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Disable a user. A disabled user is not able to login or perform any operation. A user cannot disable itself. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user to disable.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1af07907500b4d6142b9416e74df4557a4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Enables the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListUsersEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="lgraph_api::Galaxy::ListUsersC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a55e8c41afb9c217b63872b76b1486691"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListUsers</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListUsersEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List all users. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A dictionary of {user_name:user_info} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetUserInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab5010716ab86c5f6650672ce885c4bd9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUserInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets user information. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The user information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateRole__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a550aaacf7d2580baf77c3eb7706cafd7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Create a role. A role has different access levels to different graphs. Every user must be assigned some role to get access to graphs. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1add07dbe39e13e5c47e82c4b621963d7f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes the role described by role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6007103b069eebe456d17e6035c763ce"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Disable a role. A disabled role still has the data, but is not effective. i.e., users will not have access rights to graphs that are obtained by having this role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a88b1cf70763b8f517a8a67fd70f45ba6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Enables the role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetRoleDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a09988e113e9709e0ae2d8a9ae55bfd97"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the description of the specified role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRights__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7da90a98fb519cf1557c82f9780bf2aa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRights</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set access of the role to graphs. If you need to add or remove access to part of the graphs, you need to get full graph_access map by using GetRoleInfo first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRightsIncremental__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3ad7fb60a0413742007dceff71f34f9b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRightsIncremental</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Incrementally modify the access right of the specified role. For example, for a role that has access right {graph1:READ, graph2:WRITE}, calling this function with graph_access={graph2:READ, graph3:FULL} will set the access right of this role to {graph1:READ, graph2:READ, graph3:FULL}. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetRoleInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3d2426344ffa4ccd2c3d99af236bbc83"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetRoleInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets role information. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The role information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListRolesEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="lgraph_api::Galaxy::ListRolesC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ae420054434acdb37d8d242926c2eece7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListRoles</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListRolesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List all the roles. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A dictionary of {role_name:<a class="reference internal" href="#structlgraph__api_1_1RoleInfo"><span class="std std-ref">RoleInfo</span></a>} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetAccessLevel__ssCR.ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a9b5d700cf67ddcd6dc08a73271034c66"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAccessLevel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the access level that the specified user have to the graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name or graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The access level. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb">
+<span id="_CPPv3NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="_CPPv2NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="lgraph_api::Galaxy::OpenGraph__ssCR.bC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OpenGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Opens a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>read_only</strong> – (Optional) True to open in read-only mode. A read-only <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> cannot be written to.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5CloseEv">
+<span id="_CPPv3N10lgraph_api6Galaxy5CloseEv"></span><span id="_CPPv2N10lgraph_api6Galaxy5CloseEv"></span><span id="lgraph_api::Galaxy::Close"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a>, turning it into an invalid state. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="lgraph_api::Galaxy::Galaxy__lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a18b1851884f7ba7148f9488f0669212a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aa5da67d606e1c4a26b0733a2f0082f1a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4ea0661db673b9f0f9e2d4fd01cfa2a3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5user_E">
+<span id="_CPPv3N10lgraph_api6Galaxy5user_E"></span><span id="_CPPv2N10lgraph_api6Galaxy5user_E"></span><span id="lgraph_api::Galaxy::user___ss"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a17442452651ea1479fa7d0e652f90810"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5user_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy3db_E">
+<span id="_CPPv3N10lgraph_api6Galaxy3db_E"></span><span id="_CPPv2N10lgraph_api6Galaxy3db_E"></span><span id="lgraph_api::Galaxy::db___lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1d7badecbe92fb1d1d48f412eb80beef"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-result">
+<h2>lgraph_result<a class="headerlink" href="#lgraph-result" title="Permalink to this headline"></a></h2>
+<p>Result interface for plugins and built-in procedures. The result of a plugin should be provided in this format in order for the Cypher engine and the graph visualizer to understand. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46cypher">
+<span id="_CPPv36cypher"></span><span id="_CPPv26cypher"></span><span id="cypher"></span><span class="target" id="namespacecypher"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher</span></span></span><a class="headerlink" href="#_CPPv46cypher" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordE">
+<span id="_CPPv3N10lgraph_api6RecordE"></span><span id="_CPPv2N10lgraph_api6RecordE"></span><span id="lgraph_api::Record"></span><span class="target" id="classlgraph__api_1_1Record"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p>You only initialize the class by <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> instance. <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a> provide some insert method to insert data to the record. eg. Insert, InsertVertexByID, InsertEdgeByID. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERK6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERK6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERK6Record"></span><span id="lgraph_api::Record::Record__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1ac650ba988b5c162c621cabf07c18d497"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERR6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERR6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERR6Record"></span><span id="lgraph_api::Record::Record__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1adb1c42c8dbe94932471cc2fa3b1de7a6"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERK6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERK6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERK6Record"></span><span id="lgraph_api::Record::assign-operator__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1a820a033a9bfbbf0a1a0cff6ae779c715"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERK6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERR6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERR6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERR6Record"></span><span id="lgraph_api::Record::assign-operator__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1ab8d2b9aec7327774226f29c455791dad"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERR6Record" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Record::Insert__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Record_1a38f91b3aee5d1880237939f77fd5c2fb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>fv</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.int64_tC.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a171dbf3555be4830b723f1963518c8d2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertVertexByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId </p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.EdgeUidR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a0947956a5583ac30f6437ccba45e6dbc"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertEdgeByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>euid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t">
+<span id="_CPPv3N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="_CPPv2N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="lgraph_api::Record::InsertVertexByID__ssCR.int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a0445d0d62a48711ddef6e9988bd0fa09"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertVertexByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid">
+<span id="_CPPv3N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="_CPPv2N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="lgraph_api::Record::InsertEdgeByID__ssCR.EdgeUidCR"></span><span class="target" id="classlgraph__api_1_1Record_1abede73c241382ea0e55f76b90e3a7f42"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertEdgeByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">uid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>uid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1af585894e04343f4c80843dcdebdbef9d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>vit</strong> – <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1a1f507fb00296a8e04f98a391ec597ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ieit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>ieit</strong> – <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1aa5d88aae93b2cf484beb632d88420adf"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">oeit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>oeit</strong> – <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a59b5dffacde269b5df6612c00771b9a1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">list</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>list</strong> – LIST OF <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::map:ss.FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a7d99978348600b14abe0049be705b625"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">map</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>map</strong> – MAP OF &lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.traversal::PathCR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a527ac8a8e078306bcda8963a22813afb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversalE" title="lgraph_api::traversal"><span class="n"><span class="pre">traversal</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">path</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><p>insert value into result table. You can insert a value by the function, and value must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>path</strong> – Path of traverse api. </p></li>
+<li><p><strong>txn</strong> – Trasaction </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Record4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Record4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Record4SizeEv"></span><span id="lgraph_api::Record::SizeC"></span><span class="target" id="classlgraph__api_1_1Record_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Record4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the size of record. If record is empty, return 0, max size is not beyond the length of your defined param list. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Size of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="lgraph_api::Record::HasKey__ssCR"></span><span class="target" id="classlgraph__api_1_1Record_1a2a2d1b3e4e37484e8bce95728db6b770"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HasKey</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Check a key is exist or not. The key is the one of titile your defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>key</strong> – The key.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if exsit, otherwise fasle. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Record::Record__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Record_1af5b8557af6ac3c8c4af28c7fc79a6b42"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6recordE">
+<span id="_CPPv3N10lgraph_api6Record6recordE"></span><span id="_CPPv2N10lgraph_api6Record6recordE"></span><span id="lgraph_api::Record::record__std::unordered_map:ss.std::shared_ptr:ResultElement::"></span><span class="target" id="classlgraph__api_1_1Record_1a2248d027c6bbadbd043ee858e5656d7a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6recordE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6headerE">
+<span id="_CPPv3N10lgraph_api6Record6headerE"></span><span id="_CPPv2N10lgraph_api6Record6headerE"></span><span id="lgraph_api::Record::header__std::unordered_map:ss.LGraphType:"></span><span class="target" id="classlgraph__api_1_1Record_1a38c0d41af0c74862a17017322f4171d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6headerE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record7length_E">
+<span id="_CPPv3N10lgraph_api6Record7length_E"></span><span id="_CPPv2N10lgraph_api6Record7length_E"></span><span id="lgraph_api::Record::length___int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a5f8ae7abecbad53a2b4130540267cddf"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">length_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record7length_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Result</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6ResultE">
+<span id="_CPPv3N10lgraph_api6ResultE"></span><span id="_CPPv2N10lgraph_api6ResultE"></span><span id="lgraph_api::Result"></span><span class="target" id="classlgraph__api_1_1Result"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6ResultE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> table, result instance provide [MutableRecord], [ResetHeader], [Dump] and [Load] method. Table also provide some method to view content of table. For example, [Header] and [Recordview]. </p>
+<p>It’s worth noting that you are best to define your header before using result table. eg. auto result = <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a>({title, LGraphType}…) If you do not define header and initialize by <a class="reference internal" href="#classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"><span class="std std-ref">Result()</span></a>, you will get a empty table without header, you just use the table after using [ResetHeader] method to set your header. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultEv">
+<span id="_CPPv3N10lgraph_api6Result6ResultEv"></span><span id="_CPPv2N10lgraph_api6Result6ResultEv"></span><span id="lgraph_api::Result::Result"></span><span class="target" id="classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aec54d6cf6ac1ac561febf2d4db046bd6"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1adbe90e1fe046f2cd689d8dadd67177c9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="lgraph_api::Result::GetType__ss"></span><span class="target" id="classlgraph__api_1_1Result_1a1015a1bde96a85591fc70273ad140b35"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">title</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get type of title. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>title</strong> – One of titles in table.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>LGraphType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aa5f20d3711f82acbdd1fbf2ea28d5ece"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1a45a2260d7f28e56b5c3e5a7b94789766"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result13MutableRecordEv">
+<span id="_CPPv3N10lgraph_api6Result13MutableRecordEv"></span><span id="_CPPv2N10lgraph_api6Result13MutableRecordEv"></span><span id="lgraph_api::Result::MutableRecord"></span><span class="target" id="classlgraph__api_1_1Result_1ad4bea412e4aef69da8464dd0a83b2a64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">MutableRecord</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result13MutableRecordEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Create a new record in the table and return the record. The record is the reference of record in the table, if you want to modify the record, you must assign return value to a reference variable. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The reference of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7ReserveE6size_t">
+<span id="_CPPv3N10lgraph_api6Result7ReserveE6size_t"></span><span id="_CPPv2N10lgraph_api6Result7ReserveE6size_t"></span><span id="lgraph_api::Result::Reserve__s"></span><span class="target" id="classlgraph__api_1_1Result_1a204d25ea43252cdf35dc6e859f765410"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reserve</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7ReserveE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>This function attempts to reserve enough memory for the result vector to hold the specified number of elements. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api6Result6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api6Result6ResizeE6size_t"></span><span id="lgraph_api::Result::Resize__s"></span><span class="target" id="classlgraph__api_1_1Result_1a9b2c775a0d09660185780ee0a7ea6be1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResizeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>This function will resize the vector to the specified number of elements. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result2AtE6size_t">
+<span id="_CPPv3N10lgraph_api6Result2AtE6size_t"></span><span id="_CPPv2N10lgraph_api6Result2AtE6size_t"></span><span id="lgraph_api::Result::At__s"></span><span class="target" id="classlgraph__api_1_1Result_1a030c64fc1715cdb057995bf9ff5870f6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">At</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result2AtE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Provides access to the data contained in the vector. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6HeaderEv">
+<span id="_CPPv3N10lgraph_api6Result6HeaderEv"></span><span id="_CPPv2N10lgraph_api6Result6HeaderEv"></span><span id="lgraph_api::Result::Header"></span><span class="target" id="classlgraph__api_1_1Result_1accfa1228e11954438cbaa8ad4d6be5e9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Header</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6HeaderEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>return header of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>header. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Result4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Result4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Result4SizeEv"></span><span id="lgraph_api::Result::SizeC"></span><span class="target" id="classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Result4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>return size of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>table size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4DumpEb">
+<span id="_CPPv3N10lgraph_api6Result4DumpEb"></span><span id="_CPPv2N10lgraph_api6Result4DumpEb"></span><span id="lgraph_api::Result::Dump__b"></span><span class="target" id="classlgraph__api_1_1Result_1ac839e6ed0453fe8ed7fac29e9a6803d1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Dump</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_standard</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4DumpEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Serialize the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>is_standard</strong> – (Optional) If true, the result will serialize to a standard result, the standard result can be Visualized in web. If false, result will serialize a json object &amp;#8212; SDK result.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Serialize result. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="lgraph_api::Result::Load__ssCR"></span><span class="target" id="classlgraph__api_1_1Result_1a405e30d792103a7989739a05f992c94a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Load</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">json</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deserialize data to result table. This will be clear original data and header, please use this function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>json</strong> – Json string to be deserialized. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result12ClearRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result12ClearRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result12ClearRecordsEv"></span><span id="lgraph_api::Result::ClearRecords"></span><span class="target" id="classlgraph__api_1_1Result_1af629a0e98c5fbb4adf85475b0073f48a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClearRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result12ClearRecordsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Clear all the records, <a class="reference internal" href="#classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"><span class="std std-ref">Size()</span></a> will be 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10BoltHeaderEv">
+<span id="_CPPv3N10lgraph_api6Result10BoltHeaderEv"></span><span id="_CPPv2N10lgraph_api6Result10BoltHeaderEv"></span><span id="lgraph_api::Result::BoltHeader"></span><span class="target" id="classlgraph__api_1_1Result_1a18c695165355bb5431690e26af2a2d28"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltHeader</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10BoltHeaderEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11BoltRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result11BoltRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result11BoltRecordsEv"></span><span id="lgraph_api::Result::BoltRecords"></span><span class="target" id="classlgraph__api_1_1Result_1a55a40428869f85c65c6dfa3389fe75dc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11BoltRecordsEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result16MarkPythonDriverEb">
+<span id="_CPPv3N10lgraph_api6Result16MarkPythonDriverEb"></span><span id="_CPPv2N10lgraph_api6Result16MarkPythonDriverEb"></span><span id="lgraph_api::Result::MarkPythonDriver__b"></span><span class="target" id="classlgraph__api_1_1Result_1aac0dbd9e0db9031bf18adb7e7618aac6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MarkPythonDriver</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_python_driver</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result16MarkPythonDriverEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Mark that the result is returned to python driver. Python driver is special, use the virtual edge id instead of the real edge id. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10RecordViewE7int64_t">
+<span id="_CPPv3N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="_CPPv2N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="lgraph_api::Result::RecordView__int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1abc994177cadf7bb0d070dd81ad8ea8b9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">RecordView</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">row_num</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10RecordViewE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get record of the table, if row number is more bigger than max length of table, throw a exception. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>row_num</strong> – row number of the table.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>One <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6resultE">
+<span id="_CPPv3N10lgraph_api6Result6resultE"></span><span id="_CPPv2N10lgraph_api6Result6resultE"></span><span id="lgraph_api::Result::result__std::vector:Record:"></span><span class="target" id="classlgraph__api_1_1Result_1a81372de9efc3519cb68a6e51335acfd4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6resultE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6headerE">
+<span id="_CPPv3N10lgraph_api6Result6headerE"></span><span id="_CPPv2N10lgraph_api6Result6headerE"></span><span id="lgraph_api::Result::header__std::vector:std::pair:ss.LGraphType::"></span><span class="target" id="classlgraph__api_1_1Result_1ac1d5325a16b7b45115c0e32c73078d4d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6headerE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10row_count_E">
+<span id="_CPPv3N10lgraph_api6Result10row_count_E"></span><span id="_CPPv2N10lgraph_api6Result10row_count_E"></span><span id="lgraph_api::Result::row_count___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0a15002d39b5391c9c693671d605e56c"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">row_count_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10row_count_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result17is_python_driver_E">
+<span id="_CPPv3N10lgraph_api6Result17is_python_driver_E"></span><span id="_CPPv2N10lgraph_api6Result17is_python_driver_E"></span><span id="lgraph_api::Result::is_python_driver___b"></span><span class="target" id="classlgraph__api_1_1Result_1a8714076c1ee8bd005935652057221763"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_python_driver_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result17is_python_driver_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6v_eid_E">
+<span id="_CPPv3N10lgraph_api6Result6v_eid_E"></span><span id="_CPPv2N10lgraph_api6Result6v_eid_E"></span><span id="lgraph_api::Result::v_eid___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0c2a905250ba619da58c3592f54daea7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">v_eid_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6v_eid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">lgraph::StateMachine</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">cypher::PluginAdapter</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-rpc-client">
+<h2>lgraph_rpc_client<a class="headerlink" href="#lgraph-rpc-client" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410fma_common">
+<span id="_CPPv310fma_common"></span><span id="_CPPv210fma_common"></span><span id="fma_common"></span><span class="target" id="namespacefma__common"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fma_common</span></span></span><a class="headerlink" href="#_CPPv410fma_common" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_rpc">
+<span id="_CPPv310lgraph_rpc"></span><span id="_CPPv210lgraph_rpc"></span><span id="lgraph_rpc"></span><span class="target" id="namespacelgraph__rpc"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_rpc</span></span></span><a class="headerlink" href="#_CPPv410lgraph_rpc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryTypeE">
+<span id="_CPPv3N6lgraph14GraphQueryTypeE"></span><span id="_CPPv2N6lgraph14GraphQueryTypeE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType6CYPHERE">
+<span id="_CPPv3N6lgraph14GraphQueryType6CYPHERE"></span><span id="_CPPv2N6lgraph14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType6CYPHERE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType3GQLE">
+<span id="_CPPv3N6lgraph14GraphQueryType3GQLE"></span><span id="_CPPv2N6lgraph14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType3GQLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientTypeE">
+<span id="_CPPv3N6lgraph10ClientTypeE"></span><span id="_CPPv2N6lgraph10ClientTypeE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClientType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a60813255cdc667f2d2f2ddb427d32d44"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98ab892a078fa6077db32721c67735c56fd"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INDIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a43005cd0efa3b1e1373be596db0ee869"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SINGLE_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientE">
+<span id="_CPPv3N6lgraph9RpcClientE"></span><span id="_CPPv2N6lgraph9RpcClientE"></span><span id="lgraph::RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_rpc_client.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a8995083e1c9332090bdbbced0704b1b9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__std::vector:ss:R.ss.ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a59ff51f4744de0edfe8571844287a51a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">urls</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">user</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>urls</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClientD0Ev"></span><span id="lgraph::RpcClient::~RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient_1a0f8219dbf08d58f7cfc0a853538176a4"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallCypher__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a456fdf97ad54654b985ebd5add140db3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a cypher query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallCypherToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1af9ef8ca1182193ef2c18062ecf23eeb7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypherToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a cypher query to leader. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallGql__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a7cfb10baca3d2f668a10ca43e399afc5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a gql query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallGqlToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a189850ee468b61a65982b7e505c8265b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGqlToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a gql query to leader. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="lgraph::RpcClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a93f4c769de4f1979e4ab824afdaa8ead"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::CallProcedureToLeader__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1a3e5b11b2f703f41d40a2afd9c7581376"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedureToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure to leader. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.ssCR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a0081b8bb075d1be82d8c92281d907cdc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load a built-in procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_file</strong> – <strong>[in]</strong> the source_file contain procedure code. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load a built-in procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::ListProcedures__ssR.ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa090037a4c3944d76e3cbf8c07f569b0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>List user-defined procedures. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient6LogoutEv"></span><span id="lgraph::RpcClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient6LogoutEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Client log out. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::IsReadQuery__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a891d9b465df285ae69983ea3aabebde0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Determine whether it is a read-only query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClient__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af77b4e340b5e79a7875f8f065fd221e5"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEb">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEb"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEb"></span><span id="lgraph::RpcClient::GetClient__b"></span><span class="target" id="classlgraph_1_1RpcClient_1ac3415aee2cca8ddb4c12473be63f42a2"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">isReadQuery</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>isReadQuery</strong> – <strong>[in]</strong> read query or not. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClientByNode__ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af935a15699e0f1004779a265afd67c0a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClientByNode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the client according to the node url. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>url</strong> – <strong>[in]</strong> Node address of client connection. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Rpc client connecting to url. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="lgraph::RpcClient::RefreshUserDefinedProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1af85d15b19d971fbe1babd8d06f5ae2c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshUserDefinedProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh User-defined Procedure. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="lgraph::RpcClient::RefreshBuiltInProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1a5d1a4ee81316d67c4d000e598ef41fec"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshBuiltInProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh Built-in Procedure. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="lgraph::RpcClient::RefreshClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1ab683309ba410ef5c7c65ed6a08b085d9"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh the client connection pool according to the cluster status. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="lgraph::RpcClient::LoadBalanceClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1a9b83e575619171ca739b140ffe024207"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadBalanceClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load balance the client pool. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshConnectionEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="lgraph::RpcClient::RefreshConnection"></span><span class="target" id="classlgraph_1_1RpcClient_1a8957fe9842f100f0e80778649ab7ba14"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshConnection</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshConnectionEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Refresh client pool, procedure info. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F">
+<span id="_CPPv3I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span id="_CPPv2I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">F</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph_1_1RpcClient_1a83227aa710bb0fb4cd66dc7e4b00af5a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DoubleCheckQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="lgraph::RpcClient::DoubleCheckQuery::F"><span class="n"><span class="pre">F</span></span></a><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">f</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="Permalink to this definition"></a><br></dt>
+<dd><p>If an exception is thrown in the query, refresh the connection and re-execute. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_typeE">
+<span id="_CPPv3N6lgraph9RpcClient11client_typeE"></span><span id="_CPPv2N6lgraph9RpcClient11client_typeE"></span><span id="lgraph::RpcClient::client_type__ClientType"></span><span class="target" id="classlgraph_1_1RpcClient_1a376acacd121bd1f972b5fb097e220fd9"></span><a class="reference internal" href="#_CPPv4N6lgraph10ClientTypeE" title="lgraph::ClientType"><span class="n"><span class="pre">ClientType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_type</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient4userE"></span><span id="lgraph::RpcClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4userE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient8passwordE"></span><span id="lgraph::RpcClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient8passwordE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11base_clientE">
+<span id="_CPPv3N6lgraph9RpcClient11base_clientE"></span><span id="_CPPv2N6lgraph9RpcClient11base_clientE"></span><span id="lgraph::RpcClient::base_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a58adfed74cd9daeb6b32a267039e925b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11base_clientE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4urlsE">
+<span id="_CPPv3N6lgraph9RpcClient4urlsE"></span><span id="_CPPv2N6lgraph9RpcClient4urlsE"></span><span id="lgraph::RpcClient::urls__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a306ada97a24c8198c1a0c9c3c5b0bb25"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">urls</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4urlsE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13leader_clientE">
+<span id="_CPPv3N6lgraph9RpcClient13leader_clientE"></span><span id="_CPPv2N6lgraph9RpcClient13leader_clientE"></span><span id="lgraph::RpcClient::leader_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a13cc47368956dc5404b8c30b89c359f9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">leader_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13leader_clientE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_poolE">
+<span id="_CPPv3N6lgraph9RpcClient11client_poolE"></span><span id="_CPPv2N6lgraph9RpcClient11client_poolE"></span><span id="lgraph::RpcClient::client_pool__std::deque:std::shared_ptr:lgraph::RpcClient::RpcSingleClient::"></span><span class="target" id="classlgraph_1_1RpcClient_1a844140b131b865884e1233813d5ed217"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">deque</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_pool</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_poolE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient19built_in_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient19built_in_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient19built_in_proceduresE"></span><span id="lgraph::RpcClient::built_in_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1a18060c9aed7ccf4e945b9f88d03142d2"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">built_in_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient19built_in_proceduresE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23user_defined_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="lgraph::RpcClient::user_defined_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1aea4d05a8b62f0732342d07a9495616cf"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_defined_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23user_defined_proceduresE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21cypher_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient21cypher_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient21cypher_write_constantE"></span><span id="lgraph::RpcClient::cypher_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a632dd8c3163187f7e6faa9271b7b4cfc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21cypher_write_constantE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18gql_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient18gql_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient18gql_write_constantE"></span><span id="lgraph::RpcClient::gql_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a9ec0e77daff8924f52eb7f2e177cc1fc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">gql_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18gql_write_constantE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientE"></span><span id="lgraph::RpcClient::RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::RpcSingleClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae26aab72012bcb1ee86fb02e92a9613d"></span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>RpcSingleClient Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="lgraph::RpcClient::RpcSingleClient::~RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a1a143a1804f6bf71869b0ee5a6dc1462"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::RpcSingleClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::RpcSingleClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2b0a265853b25e1e9b36de7acc58c470"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json， Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::ListProcedures__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a44431b16908099e6e5134afbe127ab63"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>List user-defined procedures. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a user-defined procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Import vertex or edge data from content string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallCypher__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aff1bfcba1cd1754363bb2adf51db086a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a cypher query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallGql__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2fb61a89fc5e431b2433d52059467be0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a gql query. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="lgraph::RpcClient::RpcSingleClient::GetUrl"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad4d20fca6bae3f93f4d1e714aacb03cd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUrl</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the url of single client. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>the url of single client. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="lgraph::RpcClient::RpcSingleClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Client log out. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleRequest__LGraphRequestP"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a61415af9341546df1ad67eed0ea2dbaa"></span><span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleRequest</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">LGraphRequest</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">req</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleGraphQueryRequest__lgraph::GraphQueryType.LGraphResponseP.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a63cc8e69616efdad5460f648780a6bb2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleGraphQueryRequest</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">res</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="lgraph::RpcClient::RpcSingleClient::GraphQueryResponseExtractor__GraphQueryResponseCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a4eb9039c5c4d7e1bd1c065e71aaa75d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryResponseExtractor</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">GraphQueryResponse</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="lgraph::RpcClient::RpcSingleClient::url__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae43c7d8d482ec3550b30cbc7dc23b9f0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">url</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="lgraph::RpcClient::RpcSingleClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="lgraph::RpcClient::RpcSingleClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="lgraph::RpcClient::RpcSingleClient::token__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a9f7d94df8d0a73f04a003fe5032ba32d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">token</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="lgraph::RpcClient::RpcSingleClient::server_version__int64_t"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a3de46036a491e337d41dba033c215120"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">server_version</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="lgraph::RpcClient::RpcSingleClient::channel__std::shared_ptr:lgraph_rpc::m_channel:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ac34b00e3851c29e651d8ca31fe21a9be"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">channel</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="lgraph::RpcClient::RpcSingleClient::cntl__std::shared_ptr:lgraph_rpc::m_controller:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a7d9cee7bb74b09c0ff1b71d2a1b4ef8d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_controller</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cntl</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="lgraph::RpcClient::RpcSingleClient::options__std::shared_ptr:lgraph_rpc::m_channel_options:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a18a1c01a5579128138eeddb758b305d6"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel_options</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">options</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-traversal">
+<h2>lgraph_traversal<a class="headerlink" href="#lgraph-traversal" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalE">
+<span id="_CPPv3N10lgraph_api9traversalE"></span><span id="_CPPv2N10lgraph_api9traversalE"></span><span id="lgraph_api::traversal"></span><span class="target" id="namespacelgraph__api_1_1traversal"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">traversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb">
+<span id="_CPPv3N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span id="_CPPv2N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a726096df46599bdfb914a6ca3420ec96"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FindVertices</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">filter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Retrieve all vertices passing the specified filter. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>filter</strong> – <strong>[inout]</strong> The user-defined filter function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The corresponding list of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb">
+<span id="_CPPv3I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span id="_CPPv2I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1aceb3385f1d10f71f5d9aa46fcdd92915"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">frontier</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Extract data from specified vertices. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Template Parameters</dt>
+<dd class="field-even"><p><strong>VertexData</strong> – Type of the vertex data. </p>
+</dd>
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The database. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>frontier</strong> – <strong>[inout]</strong> The vertices to extract data from. </p></li>
+<li><p><strong>extract</strong> – <strong>[inout]</strong> The user-defined extract function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The corresponding extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT">
+<span id="_CPPv3I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span id="_CPPv2I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a860101673fe319842615891bdce356d5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DefaultFilter</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="lgraph_api::traversal::DefaultFilter::IT"><span class="n"><span class="pre">IT</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="Permalink to this definition"></a><br></dt>
+<dd><p>The default filter you may use. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>it</strong> – <strong>[inout]</strong> An iterator class.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Always true. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a0be095f6cae74a9b2b83368bcaa8bb9d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Function closure filtering by label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>label</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a916a3c242ae9447471b4116416ac3200"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Function closure filtering by label id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>label_id</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::eq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a787283b8c440e78fe08f3233ec9927d1"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::neq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a5a867323375932ba84f360b8f7ba104d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::eq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1aca364480fdfefebade068076c782085e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::neq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a2360c3785fed893a88cc4ab67d8a56de"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE">
+<span id="_CPPv3N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="_CPPv2N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="lgraph_api::traversal::MAX_RESULT_SIZE__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a19036385f876c801d15c194fc62e7531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE">
+<span id="_CPPv3N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="_CPPv2N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="lgraph_api::traversal::TRAVERSAL_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a86e405bbe2ac6d2a74230ae2305fd8e0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE">
+<span id="_CPPv3N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="_CPPv2N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="lgraph_api::traversal::TRAVERSAL_ALLOW_REVISITS__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a92a5114a7f6be9af4e24557fa238f8b7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_ALLOW_REVISITS</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4EdgeE">
+<span id="_CPPv3N10lgraph_api9traversal4EdgeE"></span><span id="_CPPv2N10lgraph_api9traversal4EdgeE"></span><span id="lgraph_api::traversal::Edge"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent an edge. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="lgraph_api::traversal::Edge::Edge__s.uint16_t.uint64_t.s.s.b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5fa8e10b10d8db22077e6a8f51c56a4f"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">start</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">tid</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">end</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">eid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">forward</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>start</strong> – The start. </p></li>
+<li><p><strong>lid</strong> – The lid. </p></li>
+<li><p><strong>tid</strong> – The tid. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>eid</strong> – The eid. </p></li>
+<li><p><strong>forward</strong> – True to forward. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="lgraph_api::traversal::Edge::Edge__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1accd38aace77501c9cf5cae967e894970"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="lgraph_api::traversal::Edge::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="lgraph_api::traversal::Edge::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the start vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The start vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="lgraph_api::traversal::Edge::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the end vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The end vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="lgraph_api::traversal::Edge::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a15b074c85865e730723336acec71f79e"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the label ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The label ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="lgraph_api::traversal::Edge::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a02537fe49ffb801dd20bdaae51b29325"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Temporal ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The temporal ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="lgraph_api::traversal::Edge::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a2592e180e605668b296b9251bc4d275a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the edge ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The edge ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="lgraph_api::traversal::Edge::IsForwardC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a41a01f6b828238200fef82f544fd172e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsForward</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the direction of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>true : forward; false: backward. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="lgraph_api::traversal::Edge::GetSrcVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5490526b0251ebb9ad277c9b314eedbb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrcVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the source vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The source vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="lgraph_api::traversal::Edge::GetDstVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ab717cca464319d1b380648aedbaaca1d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDstVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the destination vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The destination vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge6start_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge6start_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge6start_E"></span><span id="lgraph_api::traversal::Edge::start___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ad914f6be659b44fe8e11acc02cf6eeb6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">start_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge6start_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4end_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4end_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4end_E"></span><span id="lgraph_api::traversal::Edge::end___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1afdac24f7adfe72f79983c12b08e566e5"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4end_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4eid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4eid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4eid_E"></span><span id="lgraph_api::traversal::Edge::eid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a74dfb17650dad72d071112c995343f25"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4eid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4lid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4lid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4lid_E"></span><span id="lgraph_api::traversal::Edge::lid___uint16_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4b77269210d4ee2d997719c8dee806ea"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4lid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4tid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4tid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4tid_E"></span><span id="lgraph_api::traversal::Edge::tid___int64_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a6ec1f5936b6351a1911a966a8a08fd42"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4tid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge8forward_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge8forward_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge8forward_E"></span><span id="lgraph_api::traversal::Edge::forward___b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1aae1b80cda1e8b80f4a52f8a6d1f22df8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">forward_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge8forward_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversalE"></span><span id="lgraph_api::traversal::FrontierTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversalE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> provides the most common way to traverse graphs. You can start from a single vertex or a set of vertices (known as the initial frontier), and expand them frontier by frontier, each time visiting neighboring vertices of the current frontier and make those matching specified conditions the new frontier. One powerful feature of <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> is that the traversal can be performed in parallel, accelerating those <em>deep</em> queries significantly. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::FrontierTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a545b378096e3004e11024a15fd17bd27"></span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> object. Note that the transaction must be read- only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Be careful when TRAVERSAL_ALLOW_REVISITS is used, as each vertex may be visited more than once, making the result set huge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::FrontierTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a9c2251578e77394a41833329c9200e72"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ae8aee8d3fccc6f15e21f0e5a4652c33e"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a79b977639f217d9411ac48a32c6e83f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad655c689b55d2072e9212b55ea015bb0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="lgraph_api::traversal::FrontierTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="lgraph_api::traversal::FrontierTraversal::ResetVisited"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aaf986f1e13f0da831c3d8277cdb860f0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetVisited</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset only the visited flags. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="lgraph_api::traversal::FrontierTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="lgraph_api::traversal::FrontierTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="lgraph_api::traversal::FrontierTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::FrontierTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::curr_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a272d864e6eface58376c0d0c08c89401"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::next_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad05308b798bf29c2e2e6fcf6331150c6"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="lgraph_api::traversal::FrontierTraversal::visited___ParallelBitset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ac784cfc9970b0a1fb2e5a1678ed59284"></span><span class="n"><span class="pre">ParallelBitset</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">visited_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelperE">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelperE"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelperE"></span><span id="lgraph_api::traversal::IteratorHelper"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1IteratorHelper"><span class="std std-ref">IteratorHelper</span></a> provides some useful methods, such as casting Vertex/Edge objects to their iterator forms. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="lgraph_api::traversal::IteratorHelper::IteratorHelper__TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a7d72fd8bc5a5a60f16a5eea5b1ae781e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a9db8a753c5773fd00186665e172e8df2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd><p>Casting a <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> to a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vertex</strong> – A <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> object.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> corresponding to vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1ab5ec73c9874f5c269c066857075d67c6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd><p>Casting an <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Edge"><span class="std std-ref">Edge</span></a> to an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>edge</strong> – An edge object.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> corresponding to edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="lgraph_api::traversal::IteratorHelper::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathE">
+<span id="_CPPv3N10lgraph_api9traversal4PathE"></span><span id="_CPPv2N10lgraph_api9traversal4PathE"></span><span id="lgraph_api::traversal::Path"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="lgraph_api::traversal::Path::Path__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abd76ad8cca7c9f5611d89b6c94e88d53"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">start</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>start</strong> – The start. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="lgraph_api::traversal::Path::Path__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a6f0b65d8220590bc0de51a6f9178db0c"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="lgraph_api::traversal::Path::Path__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae8d80e874d2f88e507218f6db1ed2cdc"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERK4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a3640a670cabc7ff15a8bf5e31f83b3e9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERK4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Assignment operator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERR4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae3dcf33db8617fe1de00cedc6541ae98"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERR4Path" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move assignment operator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path6LengthEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path6LengthEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path6LengthEv"></span><span id="lgraph_api::traversal::Path::LengthC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1aa63d0332a20e86302501c8bd1db921c2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Length</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path6LengthEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the length of this path. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The path length. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="lgraph_api::traversal::Path::Append__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab88413d902928384d83cbad1df6de769"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append an edge to the path. Note that the edge’s start vertex should match the current path’s end vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>edge</strong> – edge to append. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="lgraph_api::traversal::Path::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the start vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="lgraph_api::traversal::Path::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the end vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="lgraph_api::traversal::Path::GetLastEdgeC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abf723fca4ce807ccf77dc91e685b5545"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLastEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the last edge of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthEdge__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a7f37b5b5e876c5ec8836bba603e526e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Nth edge of this path. The available range of N is [0, Length). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthVertex__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab6aa8a9295375d526831278b2690558e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Nth vertex of this path. The available range of N is [0, Length]. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5dirs_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5dirs_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5dirs_E"></span><span id="lgraph_api::traversal::Path::dirs___std::vector:b:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a0ad3ec1585be61bf4e9ab8ae94bb4406"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dirs_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5dirs_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5lids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5lids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5lids_E"></span><span id="lgraph_api::traversal::Path::lids___std::vector:uint16_t:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a58d741b575ad6c800db503b3d2db61d3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint16_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5lids_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4ids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path4ids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path4ids_E"></span><span id="lgraph_api::traversal::Path::ids___std::vector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a2a21c3f2f91696ebc1c7d5109b5cc921"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4ids_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversalE"></span><span id="lgraph_api::traversal::PathTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversalE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> behaves similar to <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a>, except that 1) Each vertex could be revisited multiple times. 2) Each traversed path would be stored, and the filter function has access to the path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::PathTraversal::PathTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af738f641e5877af62941a670ceedd359"></span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> object. Note that the transaction must be read-only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Since TRAVERSAL_ALLOW_REVISITS is implied in <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> and storing the Paths also takes a lot of space, the memory consumption could be very large if the filters are not very selective. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::PathTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4664408bde6c8bc833b2d308a7a9c770"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a346ba8aed662685cd78506c8baec815c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a0a54b5500485e208383933b8f2817675"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1abb7d1f2986dde079c71c568410386249"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="lgraph_api::traversal::PathTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="lgraph_api::traversal::PathTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="lgraph_api::traversal::PathTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="lgraph_api::traversal::PathTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::PathTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::curr_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ac73154ee309f0dad63fb1a1790e23025"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::next_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af032087096fefc9f61b4351bc5e9a71d"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6VertexE">
+<span id="_CPPv3N10lgraph_api9traversal6VertexE"></span><span id="_CPPv2N10lgraph_api9traversal6VertexE"></span><span id="lgraph_api::traversal::Vertex"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a vertex. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="lgraph_api::traversal::Vertex::Vertex__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a3f6911c4ec59435701457f131e89af4a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="lgraph_api::traversal::Vertex::Vertex__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a13f7b30a546a536a3dfafd128adb609f"></span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="lgraph_api::traversal::Vertex::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="lgraph_api::traversal::Vertex::GetIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a63765fbd0690661e2af3bc97083475fc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the Id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The Id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex4vid_E">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex4vid_E"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex4vid_E"></span><span id="lgraph_api::traversal::Vertex::vid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a224220636b53e35b1b5bf8c0e88717d0"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex4vid_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-txn">
+<h2>lgraph_txn<a class="headerlink" href="#lgraph-txn" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api11TransactionE"></span><span id="lgraph_api::Transaction"></span><span class="target" id="classlgraph__api_1_1Transaction"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_txn.h&gt;</em></div>
+<p>TuGraph operations happen in transactions. A transaction is sequence of operations that is carried out atomically on the <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. TuGraph transactions provides full ACID guarantees. </p>
+<p>Transactions are created using <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"><span class="std std-ref">GraphDB::CreateReadTxn()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"><span class="std std-ref">GraphDB::CreateWriteTxn()</span></a>. A read transaction can only perform read operations, otherwise an exception is thrown. A write transaction can perform reads as well as writes. There are performance differences between read and write operations. So if you only need read in a transaction, you should create a read transaction.</p>
+<p>Each transaction must be used in one thread only, and they should not be passed from one thread to another unless it is a forked transaction.</p>
+<p>Read transactions can be forked. The new copy of the transaction will have the same view as the forked one, and it can be used in a separate thread. By forking from one read transaction and using the forked copies in different threads, we can parallelize the execution of specific operations. For example, you can implement a parallel BFS with this capability. Also, you can dump a snapshot of the whole graph using </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09c0d46171b7562e16c3a697f77fca90"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERR11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERR11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERR11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3d6029838ae611c2c7bbc3c59afe059"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERR11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a44fabd0e73ed35b6d683051496a3f30f"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERK11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERK11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERK11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1abde1d510a232da04117f21bd23de8143"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERK11Transaction" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6CommitEv">
+<span id="_CPPv3N10lgraph_api11Transaction6CommitEv"></span><span id="_CPPv2N10lgraph_api11Transaction6CommitEv"></span><span id="lgraph_api::Transaction::Commit"></span><span class="target" id="classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Commit</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6CommitEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Commits this transaction. Note that optimistic write transactions may fail to commit (an TxnConflict would be thrown). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5AbortEv">
+<span id="_CPPv3N10lgraph_api11Transaction5AbortEv"></span><span id="_CPPv2N10lgraph_api11Transaction5AbortEv"></span><span id="lgraph_api::Transaction::Abort"></span><span class="target" id="classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Abort</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5AbortEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Aborts this transaction. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction7IsValidEv">
+<span id="_CPPv3NK10lgraph_api11Transaction7IsValidEv"></span><span id="_CPPv2NK10lgraph_api11Transaction7IsValidEv"></span><span id="lgraph_api::Transaction::IsValidC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this transaction is valid. <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> becomes invalid after calling <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"><span class="std std-ref">Abort()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"><span class="std std-ref">Commit()</span></a>. Operations on invalid transaction yields exceptions. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv">
+<span id="_CPPv3NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="_CPPv2NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="lgraph_api::Transaction::IsReadOnlyC"></span><span class="target" id="classlgraph__api_1_1Transaction_1afde2da3cd793a0a0403ea2ea0c9b9ea7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadOnly</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this txn is read only. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if read only, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6GetTxnEv">
+<span id="_CPPv3N10lgraph_api11Transaction6GetTxnEv"></span><span id="_CPPv2N10lgraph_api11Transaction6GetTxnEv"></span><span id="lgraph_api::Transaction::GetTxn"></span><span class="target" id="classlgraph__api_1_1Transaction_1a94bc9b71b14ae6ad7c788d20ec39b769"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6GetTxnEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="lgraph_api::Transaction::GetVertexIterator"></span><span class="target" id="classlgraph__api_1_1Transaction_1a16d76f5c12d744846d85b007cf4e094c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get a vertex iterator pointing to the first vertex. If there is no vertex, the iterator is invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="lgraph_api::Transaction::GetVertexIterator__int64_t.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1af8c95376a78769b0717fd40fdcd274eb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets a vertex iterator pointing to the Vertex with vid. If the vertex does not exist, the iterator is invalid. If nearest==true, the iterator points to the first vertex sorted by vid, with id&gt;=vid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vid</strong> – The vid. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to point to the nearest vertex sorted by vid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9bcd70f9274974a3028ef762228e176e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an out edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1add821551447553956775fac4656f3d94"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an in edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab3bfd10ebeec5f7d0455d1fbc0762e73"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="lgraph_api::Transaction::GetNumVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4b870210a66a2f239535915497e26278"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of vertex labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The number of vertex labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="lgraph_api::Transaction::GetNumEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1aec256df0cdfca791031bad9c43c63061"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of edge labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The number of edge labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="lgraph_api::Transaction::ListVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a5b2320193bfb8ffbfaa157a110d550ad"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Lists all vertex labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="lgraph_api::Transaction::ListEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae77fe52ec78bc3e8d8d92fe8d7a3accb"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List all edge labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1a3769873514b6a5dd62b04414ff627c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label name.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab030e136e6b28679acbb59a08a977090"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1afd8f546dcb187e1be6f86d268c62996b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4afb55d1ce9b5906c6721f5c4b3b3d82"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac461aea7ee379f8669f45f9782cea1f4"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a55194445591f9fa6730dd8deb99e2414"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2d9a2f736cfb96a2f61e4de3072eb811"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetEdgeFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c13f1f3f527b37d3a221d4adb06cc5c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae62bafbd58f35cfcc01255fe4113094f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2c972657b35f86a21527bc2ad1be741e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae57f64149da2f4d2f972f49a53943591"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertVertex__s.s.std::vector:s:CR.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad86ef0cb03585dd0361042f69fb6714c"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">primary_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">unique_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert a vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>primary_pos</strong> – The location of the primary field in field_ids. </p></li>
+<li><p><strong>unique_pos</strong> – The locations of the unique index field in field_ids, can be empty. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>0: nothing happened because of index conflict 1: the vertex is inserted 2: the vertex is updated </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee14b2bcd0e170d5b87924a6a9a3e16f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3452ae2c9cae9850a7e53c2ddcc6240"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add0eea119e67210b57d9b8b6119e88d4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad342ee46d6f7f955529018100a701185"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9663b407c7f5ce18af938c7b670dd3fd"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1af3a3806320f56cb01f5edc7ff364ad80"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1acd0cba3b23983114fdd65784b11a3297"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">unique_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>unique_pos</strong> – The locations of the unique index field in field_ids, can be empty. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>0: nothing happened because of index conflict 1: the vertex is inserted 2: the vertex is updated </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a66d9f07dc220285b2fbec99fb088ad4a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A vector of vertex index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction26ListVertexCompositeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction26ListVertexCompositeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction26ListVertexCompositeIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexCompositeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a35a12d4a7a7fe0dc31d3221e8afcc676"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexSpecE" title="lgraph_api::CompositeIndexSpec"><span class="n"><span class="pre">CompositeIndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexCompositeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction26ListVertexCompositeIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A vector of vertex composite index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="lgraph_api::Transaction::ListEdgeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee4d71f4e5ce213bbe886162db6edba0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>List indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A vector of edge index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aea99efb5e098fca6157f419ec7e4396c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__s.std::vector:s:CR.std::vector:FieldData:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aa4db70c6d33c32018c0279601634e1b6"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e87da96ea73d8c709ef75a92b2bf5c4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add8eaa25484aefe92c14c0340bb35841"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__ssCR.std::vector:ss:CR.std::vector:FieldData:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab13a6cc8d58d716f8388455b1b571e4a"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a49deaf34c918d940432204e5a5a16cff"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09382e2279bb78f1a79443741112a57e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__ssCR.std::vector:ss:CR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c87149e83ca6f4de94e0c5c9bf88a41"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0a484619a92fe73247f86d9db09d2ead"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of vertices. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of edges. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee85d698359c92dc3c9bc9f9e65ecf0f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab94cbd4824258986d5d32d00453c85f7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2eddb62a56cf0030545bce6bef00104f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9af16d5a13268c711610cc3c615592c0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a594aa9d948f61ee8d06d5a3f8925c4e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9cc46853b60d578578649f8bef35d84d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9a16d2c7f0770fbfd38e53a4a95a165f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1adefa9906e0325df0316c499491f22adb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a99a3bbbf134a20c992b10ac015ea4131"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv">
+<span id="_CPPv3N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="_CPPv2N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="lgraph_api::Transaction::GetNumVertices"></span><span class="target" id="classlgraph__api_1_1Transaction_1a84acf46e241f12fe3480c203cbd59d3c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The nubmer of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexPrimaryField__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0b662063aee62d2793c634a132375ae9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexPrimaryField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets vertex primary field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The primary field. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5CountEv">
+<span id="_CPPv3N10lgraph_api11Transaction5CountEv"></span><span id="_CPPv2N10lgraph_api11Transaction5CountEv"></span><span id="lgraph_api::Transaction::Count"></span><span class="target" id="classlgraph__api_1_1Transaction_1a420ff169b39c4ce47b02a25a1eda00ae"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Count</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5CountEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the total number of vertex and edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>std::pair object, first element is vertex number, second is edge number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11CountDetailEv">
+<span id="_CPPv3N10lgraph_api11Transaction11CountDetailEv"></span><span id="_CPPv2N10lgraph_api11Transaction11CountDetailEv"></span><span id="lgraph_api::Transaction::CountDetail"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e88abab9d0a158b1dd1f72d97dcbda1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CountDetail</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11CountDetailEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the total number of vertex or edge for each label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>std::tuple object list, first element indicates whether it is VERTEX or EDGE, second is label name, third is number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="lgraph_api::Transaction::Transaction__lgraph::TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1b5dc38854e41e00ee874297e73343af"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction4txn_E">
+<span id="_CPPv3N10lgraph_api11Transaction4txn_E"></span><span id="_CPPv2N10lgraph_api11Transaction4txn_E"></span><span id="lgraph_api::Transaction::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">GraphDB</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-types">
+<h2>lgraph_types<a class="headerlink" href="#lgraph-types" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15EdgeConstraintsE">
+<span id="_CPPv3N10lgraph_api15EdgeConstraintsE"></span><span id="_CPPv2N10lgraph_api15EdgeConstraintsE"></span><span id="lgraph_api::EdgeConstraints"></span><span class="target" id="namespacelgraph__api_1a7d597d281cbcd87325f58fcce96e5d34"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeConstraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Edge constraints type define. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevelE">
+<span id="_CPPv3N10lgraph_api11AccessLevelE"></span><span id="_CPPv2N10lgraph_api11AccessLevelE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevelE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access level a user or role has on a graph. NONE: no permission. READ: read-only, no write access. WRITE: can read and write vertex and edge, but cannot change meta data such as schema or access. FULL: full access, can modify schema, grant access to other users, or even delete this graph. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4NONEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4READE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4READE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62a3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4READE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ad4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel5WRITEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4FULLE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4FULLE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4FULLE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62aba7de5bc6888294e5884b024a4c894f1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FULL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4FULLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevelE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevelE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevelE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afe"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldAccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afeab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4NONEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4READE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4READE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afea3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4READE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afead4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryTypeE">
+<span id="_CPPv3N10lgraph_api14GraphQueryTypeE"></span><span id="_CPPv2N10lgraph_api14GraphQueryTypeE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType6CYPHERE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType6CYPHERE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType6CYPHERE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType3GQLE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType3GQLE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType3GQLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldTypeE">
+<span id="_CPPv3N10lgraph_api9FieldTypeE"></span><span id="_CPPv2N10lgraph_api9FieldTypeE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1da"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Field and value types. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType3NULE">
+<span id="_CPPv3N10lgraph_api9FieldType3NULE"></span><span id="_CPPv2N10lgraph_api9FieldType3NULE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa4c175fbb65c723226d182dbfd556136a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType3NULE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BOOLE">
+<span id="_CPPv3N10lgraph_api9FieldType4BOOLE"></span><span id="_CPPv2N10lgraph_api9FieldType4BOOLE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daae663dbb8f8244e122acb5bd6b2c216e1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BOOLE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4INT8E">
+<span id="_CPPv3N10lgraph_api9FieldType4INT8E"></span><span id="_CPPv2N10lgraph_api9FieldType4INT8E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daada138aad097eaac8697fe3661c91af95"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4INT8E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT16E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT16E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT16E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac4a99142c241d04e1607af8a319c201b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT16E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT32E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT32E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT32E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac1081c62db14e24ef35a1c3c36cba2e7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT32E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT64E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT64E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT64E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa423a1db7cbc915478f654b15f87f3aac"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT64E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5FLOATE">
+<span id="_CPPv3N10lgraph_api9FieldType5FLOATE"></span><span id="_CPPv2N10lgraph_api9FieldType5FLOATE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa9cf4a0866224b0bb4a7a895da27c9c4c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5FLOATE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api9FieldType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api9FieldType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa33465d1d419b1074fb259ef444609e92"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6DOUBLEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4DATEE">
+<span id="_CPPv3N10lgraph_api9FieldType4DATEE"></span><span id="_CPPv2N10lgraph_api9FieldType4DATEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa0ace72efd9e987dfd807365d0ca50141"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4DATEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType8DATETIMEE">
+<span id="_CPPv3N10lgraph_api9FieldType8DATETIMEE"></span><span id="_CPPv2N10lgraph_api9FieldType8DATETIMEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa86797ee5836338ee241ceee5cfc669e2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATETIME</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType8DATETIMEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6STRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType6STRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType6STRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaee847e634a4297b274316de8a8ca9921"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6STRINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BLOBE">
+<span id="_CPPv3N10lgraph_api9FieldType4BLOBE"></span><span id="_CPPv2N10lgraph_api9FieldType4BLOBE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa3a625432a45f9c83112036bc7a2d2d70"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BLOB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BLOBE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5POINTE">
+<span id="_CPPv3N10lgraph_api9FieldType5POINTE"></span><span id="_CPPv2N10lgraph_api9FieldType5POINTE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa15108ccafa3232b9067f889b6156f565"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5POINTE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaaebdbcb765394d25d6a604589a890f82"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType10LINESTRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType10LINESTRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType10LINESTRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa21af7314ca158a415f7e073333d14447"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType10LINESTRINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaa90611ea278d30580b21af6d65208307"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7POLYGONE">
+<span id="_CPPv3N10lgraph_api9FieldType7POLYGONE"></span><span id="_CPPv2N10lgraph_api9FieldType7POLYGONE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daad5355465780b9a6259ebbc74d47477db"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7POLYGONE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaecdc92bf56d960b73b02ee40125758bc"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7SPATIALE">
+<span id="_CPPv3N10lgraph_api9FieldType7SPATIALE"></span><span id="_CPPv2N10lgraph_api9FieldType7SPATIALE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa608c1acc2033e0e07248c48ea01746ce"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SPATIAL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7SPATIALE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType12FLOAT_VECTORE">
+<span id="_CPPv3N10lgraph_api9FieldType12FLOAT_VECTORE"></span><span id="_CPPv2N10lgraph_api9FieldType12FLOAT_VECTORE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa5ff091452408a36a60227c938e376300"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT_VECTOR</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType12FLOAT_VECTORE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphTypeE">
+<span id="_CPPv3N10lgraph_api10LGraphTypeE"></span><span id="_CPPv2N10lgraph_api10LGraphTypeE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00d"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphType</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">uint16_t</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>a type of value used in result entry and parameter in procedure or plugin signature </p>
+<dl class="field-list simple">
+<dt class="field-odd">Param INTEGER</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param FLOAT</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param DOUBLE</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param BOOLEAN</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param STRING</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param MAP</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param NODE</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>, VertexId </p>
+</dd>
+<dt class="field-even">Param RELATIONSHIP</dt>
+<dd class="field-even"><p><a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> || <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>, <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p>
+</dd>
+<dt class="field-odd">Param PATH</dt>
+<dd class="field-odd"><p>lgraph_api::Path </p>
+</dd>
+<dt class="field-even">Param LIST</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param ANY</dt>
+<dd class="field-odd"><p>like Object in Java, its procedure author’s responsibility to check the underlying concrete type whether valid in runtime. </p>
+</dd>
+</dl>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3NULE">
+<span id="_CPPv3N10lgraph_api10LGraphType3NULE"></span><span id="_CPPv2N10lgraph_api10LGraphType3NULE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3NULE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7INTEGERE">
+<span id="_CPPv3N10lgraph_api10LGraphType7INTEGERE"></span><span id="_CPPv2N10lgraph_api10LGraphType7INTEGERE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5d5cd46919fa987731fb2edefe0f2a0c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INTEGER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7INTEGERE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType5FLOATE">
+<span id="_CPPv3N10lgraph_api10LGraphType5FLOATE"></span><span id="_CPPv2N10lgraph_api10LGraphType5FLOATE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dae738c26bf4ce1037fa81b039a915cbf6"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType5FLOATE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api10LGraphType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api10LGraphType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dafd3e4ece78a7d422280d5ed379482229"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6DOUBLEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7BOOLEANE">
+<span id="_CPPv3N10lgraph_api10LGraphType7BOOLEANE"></span><span id="_CPPv2N10lgraph_api10LGraphType7BOOLEANE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac48d5da12d702e73d6966069f2687376"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOLEAN</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7BOOLEANE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6STRINGE">
+<span id="_CPPv3N10lgraph_api10LGraphType6STRINGE"></span><span id="_CPPv2N10lgraph_api10LGraphType6STRINGE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da63b588d5559f64f89a416e656880b949"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6STRINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4NODEE">
+<span id="_CPPv3N10lgraph_api10LGraphType4NODEE"></span><span id="_CPPv2N10lgraph_api10LGraphType4NODEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da0cc25b606fe928a0c9a58f7f209c4495"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NODE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4NODEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE">
+<span id="_CPPv3N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span id="_CPPv2N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac5a4cec9a456484389b2573c8ae0a8bf"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RELATIONSHIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4PATHE">
+<span id="_CPPv3N10lgraph_api10LGraphType4PATHE"></span><span id="_CPPv2N10lgraph_api10LGraphType4PATHE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5ffb5f0d0de78321df46fc7c93ca64a3"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PATH</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4PATHE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4LISTE">
+<span id="_CPPv3N10lgraph_api10LGraphType4LISTE"></span><span id="_CPPv2N10lgraph_api10LGraphType4LISTE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da298cb25408234de02baf2085803a464a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LIST</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4LISTE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3MAPE">
+<span id="_CPPv3N10lgraph_api10LGraphType3MAPE"></span><span id="_CPPv2N10lgraph_api10LGraphType3MAPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5af1a3a285c2bdee4192223e31e1f833"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3MAPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3ANYE">
+<span id="_CPPv3N10lgraph_api10LGraphType3ANYE"></span><span id="_CPPv2N10lgraph_api10LGraphType3ANYE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da8e1bde3c3d303163521522cf1d62f21f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ANY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3ANYE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeTypeE">
+<span id="_CPPv3N10lgraph_api14PluginCodeTypeE"></span><span id="_CPPv2N10lgraph_api14PluginCodeTypeE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Type of code given when loading a new plugin. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2PYE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2PYE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2PYE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3ae0a77e22f8238541046ba5f9a5941e9e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2PYE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2SOE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2SOE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2SOE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3af9f590fe6d84e72c832e714b75b1604b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SO</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2SOE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3CPPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3CPPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3CPPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aca1ef9dc7006f2011c38e2bcc8f64d16"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CPP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3CPPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3ZIPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3ZIPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3ZIPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aed0690cdc850739d6e2b7b888311e32c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ZIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3ZIPE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexTypeE">
+<span id="_CPPv3N10lgraph_api9IndexTypeE"></span><span id="_CPPv2N10lgraph_api9IndexTypeE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>index type </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType14NonuniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType14NonuniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a5e3e0d5af84f4b5e85c9dca495b47018"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NonuniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is not unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a7f0f75f7fcd7d67aa985f11f3ebf2712"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GlobalUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is a global unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType15PairUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType15PairUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a89627e6fbb7ed5b8b3913ecbd253b52f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PairUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is a pair unique index, for edge index only key of pair unique index is one of the follow case : if src_vid &lt; dst_vid ,key is (index field value + src_vid + dst_vid) if src_vid &gt; dst_vid ,key is (index field value + dst_vid + src_vid) </p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexTypeE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexTypeE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexTypeE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CompositeIndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexType11UniqueIndexE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexType11UniqueIndexE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexType11UniqueIndexE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03afa1a33f381dab5d21a8c1241468b00c4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexType11UniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is unique composite index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexType14NonUniqueIndexE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexType14NonUniqueIndexE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexType14NonUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03a9c33486c379483f58472e3715e160a5a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NonUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexType14NonUniqueIndexE" title="Permalink to this definition"></a><br></dt>
+<dd><p>this is not unique composite index </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK11AccessLevel"></span><span id="lgraph_api::to_string__AccessLevelCR"></span><span class="target" id="namespacelgraph__api_1aaa50da267713908744fd8e2c5a6a4373"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK11AccessLevel" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="lgraph_api::to_string__FieldAccessLevelCR"></span><span class="target" id="namespacelgraph__api_1af06d7db8c2df7831e02af25d45ad43ef"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="lgraph_api::FieldAccessLevel"><span class="n"><span class="pre">FieldAccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK14GraphQueryType">
+<span id="_CPPv3N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="_CPPv2N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="lgraph_api::to_string__GraphQueryTypeCR"></span><span class="target" id="namespacelgraph__api_1acd1e36eab9c9fc42d4192f3d55e4504a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="lgraph_api::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK14GraphQueryType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE9FieldType">
+<span id="_CPPv3N10lgraph_api9to_stringE9FieldType"></span><span id="_CPPv2N10lgraph_api9to_stringE9FieldType"></span><span id="lgraph_api::to_string__FieldType"></span><span class="target" id="namespacelgraph__api_1a584042d80e34528010e1ad8e3e499b1d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the name of the given FieldType. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – when an unrecognizable FieldType is given.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>v</strong> – A FieldType.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Name of the given FieldType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType">
+<span id="_CPPv3N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="_CPPv2N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsField__LGraphType"></span><span class="target" id="namespacelgraph__api_1a4f4fd20c65be1aaa3f4d6e70e7d7218a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsField</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType">
+<span id="_CPPv3N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="_CPPv2N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsGraphElement__LGraphType"></span><span class="target" id="namespacelgraph__api_1a9fb9c1e160b13a90e177a8e8ec0e00fa"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsGraphElement</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType">
+<span id="_CPPv3N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="_CPPv2N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsCollection__LGraphType"></span><span class="target" id="namespacelgraph__api_1a82cc6a5df4119f903835efab9edbf4fe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsCollection</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType">
+<span id="_CPPv3N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="_CPPv2N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsAny__LGraphType"></span><span class="target" id="namespacelgraph__api_1aca1c7356409eb19c5deab724bc4fff2d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsAny</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE10LGraphType">
+<span id="_CPPv3N10lgraph_api9to_stringE10LGraphType"></span><span id="_CPPv2N10lgraph_api9to_stringE10LGraphType"></span><span id="lgraph_api::to_string__LGraphType"></span><span class="target" id="namespacelgraph__api_1a5113ccea82007fb6b30d591032637775"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE10LGraphType" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType">
+<span id="_CPPv3N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="_CPPv2N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="lgraph_api::PluginCodeTypeStr__PluginCodeType"></span><span class="target" id="namespacelgraph__api_1ad94969b6b33bfee0e009c16ba50623a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeTypeStr</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="lgraph_api::PluginCodeType"><span class="n"><span class="pre">PluginCodeType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code_type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the name of plugin code types. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpecE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpecE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpecE"></span><span id="lgraph_api::CompositeIndexSpec"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CompositeIndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A composite index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec5labelE"></span><span id="lgraph_api::CompositeIndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec5labelE" title="Permalink to this definition"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec6fieldsE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec6fieldsE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec6fieldsE"></span><span id="lgraph_api::CompositeIndexSpec::fields__std::vector:ss:"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1acf26f1505f276ea0dbf631c4bf19727a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fields</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec6fieldsE" title="Permalink to this definition"></a><br></dt>
+<dd><p>fields name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec4typeE"></span><span id="lgraph_api::CompositeIndexSpec::type__CompositeIndexType"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1a2112c9c8e7921d5119a2aac88189e894"></span><a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="lgraph_api::CompositeIndexType"><span class="n"><span class="pre">CompositeIndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec4typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptionsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptionsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptionsE"></span><span id="lgraph_api::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Edge label options, contain fields only edge have. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-types">Public Types</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TemporalFieldOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="Permalink to this definition"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439ac6e421eaad140c1bc1a39980502df80c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ASC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439a65a6d757dbb571ccc3af9706e9a5f607"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DESC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="lgraph_api::EdgeOptions::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5708a1309a1260a1c5a7208f9d7f25c2"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="lgraph_api::EdgeOptions::EdgeOptions__EdgeConstraintsCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5a91f7f6cbcd9600e96add55f510a9d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="lgraph_api::EdgeOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions5clearEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions5clearEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions5clearEv"></span><span id="lgraph_api::EdgeOptions::clear"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions5clearEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="lgraph_api::EdgeOptions::edge_constraints__EdgeConstraints"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ab879b0258a59289c195a102d07ae88bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_constraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="lgraph_api::EdgeOptions::temporal_field__ss"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aed02035800f19fa3eb75108a4ed4489a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="lgraph_api::EdgeOptions::temporal_field_order__lgraph_api::EdgeOptions::TemporalFieldOrder"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a7e866158b92a86c3db1a2db0ad830104"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field_order</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="lgraph_api::EdgeOptions::TemporalFieldOrder::ASC"><span class="n"><span class="pre">ASC</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder">
+<span id="_CPPv3N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="_CPPv2N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="lgraph_api::EdgeOptions::to_string__TemporalFieldOrderCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a02b8f61202a7e3f790caaaece23d1cfc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUidE">
+<span id="_CPPv3N10lgraph_api7EdgeUidE"></span><span id="_CPPv2N10lgraph_api7EdgeUidE"></span><span id="lgraph_api::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUidE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="lgraph_api::EdgeUid::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ac4a49320d7fa2c7fba9bdad45e49e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="lgraph_api::EdgeUid::EdgeUid__int64_t.int64_t.uint16_t.int64_t.int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a3ecba2c59d236b1b4f042d4274f51264"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">l</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">e</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7ReverseEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7ReverseEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7ReverseEv"></span><span id="lgraph_api::EdgeUid::Reverse"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae1b551cc51c9d556342b27b466a7c7cb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reverse</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7ReverseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Reverses side of this edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::eq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae10ec79b489d4c829b1b28a4c14b7f7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidneERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidneERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidneERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::neq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a6f4701506d51e0489c36edf7251e9acd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidneERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::lt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1afde4cbd02b63c9acd53e61d5e49787e6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::gt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a92818596b49b9fd47fa4b4ce4c203094"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid8ToStringEv">
+<span id="_CPPv3NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="_CPPv2NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="lgraph_api::EdgeUid::ToStringC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of this object. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3srcE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3srcE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3srcE"></span><span id="lgraph_api::EdgeUid::src__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7d1e8afde8407667e51f6de0ba9d6453"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3srcE" title="Permalink to this definition"></a><br></dt>
+<dd><p>source vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3dstE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3dstE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3dstE"></span><span id="lgraph_api::EdgeUid::dst__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1adbdebae8daea6c03c200361fa8840a80"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3dstE" title="Permalink to this definition"></a><br></dt>
+<dd><p>destination vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3lidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3lidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3lidE"></span><span id="lgraph_api::EdgeUid::lid__uint16_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a16870a9bf8dc2c31ee3c874d7adbd02a"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3lidE" title="Permalink to this definition"></a><br></dt>
+<dd><p>label id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3tidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3tidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3tidE"></span><span id="lgraph_api::EdgeUid::tid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a523c7bbc2f001feab204b52b533f7c87"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3tidE" title="Permalink to this definition"></a><br></dt>
+<dd><p>timestamp </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3eidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3eidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3eidE"></span><span id="lgraph_api::EdgeUid::eid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ea4961b92589517fd8cfafc0f945033"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3eidE" title="Permalink to this definition"></a><br></dt>
+<dd><p>additional edge id to distinguish edges with the same tid </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="lgraph_api::EdgeUid::AnyEdge"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ab5a73d71df790d8768376a4d13608773"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AnyEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of in-coming edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of out-going edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataE">
+<span id="_CPPv3N10lgraph_api9FieldDataE"></span><span id="_CPPv2N10lgraph_api9FieldDataE"></span><span id="lgraph_api::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A class that represents variant type. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEv">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEv"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEv"></span><span id="lgraph_api::FieldData::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a33d34623467e64a3352cd10e53c85ca5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEb">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEb"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEb"></span><span id="lgraph_api::FieldData::FieldData__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a06ad1d80ad369afa643075cbe87f02ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="lgraph_api::FieldData::FieldData__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a265c89b1a86a0bbad89cf42661828f8c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="lgraph_api::FieldData::FieldData__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7e0e988dd1d89abbdacbf4d99fd7b2bf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="lgraph_api::FieldData::FieldData__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1aea814e9fb09dda664977d12f5b350d57"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="lgraph_api::FieldData::FieldData__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a38a8108c47e489a360ebece5e593ca7f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEf">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEf"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEf"></span><span id="lgraph_api::FieldData::FieldData__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab8122e35f0b0a42212299fb31ba8cf8d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEf" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEd">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEd"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEd"></span><span id="lgraph_api::FieldData::FieldData__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad56e5648c7943ef08a593aaf5c231985"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEd" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="lgraph_api::FieldData::FieldData__DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a484a31f1c0cba4531908a803a1782258"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="lgraph_api::FieldData::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="lgraph_api::FieldData::FieldData__DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a870fede3129fb7b07d10096b7adf796f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="lgraph_api::FieldData::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50384efa457e9883b378314910e01ccc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d1752cfc22854c2c44381b0a443fb56"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="lgraph_api::FieldData::FieldData__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a28485df6381f6dc1ba4b30a8087e39fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="lgraph_api::FieldData::FieldData__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a72fde0d7ac627644c3dff536d09a45f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aff76c6792c66514d775ba8be88b789ab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a388fd3199bf652332ce922fe0a25f145"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad19f579289333ecf8515aae8f3bb903a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aafaa13b9ee556736c8992f555e99eda6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a393d9735468c278ddf48b9cf8ef95891"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a59b4b116bc89bf0718ba25b9749c2cce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac81b0f4a81a11954f3afcaa9872b396b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5da2cfc866cfdbe5db69ba9ef1dab2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6vectorIfEE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERKNSt6vectorIfEE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERKNSt6vectorIfEE"></span><span id="lgraph_api::FieldData::FieldData__std::vector:float:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a44746f760b5edf958afb02110bfea77b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6vectorIfEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataD0Ev">
+<span id="_CPPv3N10lgraph_api9FieldDataD0Ev"></span><span id="_CPPv2N10lgraph_api9FieldDataD0Ev"></span><span id="lgraph_api::FieldData::~FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6e58de1884451d88a24994e2875b1d6a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a74cb11c1f4f0a79d6f7a278fc84074ba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5a88873a071ad0c03bcf2c2a498e90bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac721aa38df96b34b841cd4bbc608abdf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b27ecbef11936a80c911800629edd46"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERR9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7integerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7integerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7integerEv"></span><span id="lgraph_api::FieldData::integerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1e5b6bc8e5ac95ae151fdaf8894201e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">integer</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7integerEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as int64. Valid only when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is of INT8, INT16, INT32, or INT64 types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of int types.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>An int64_t. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData4realEv">
+<span id="_CPPv3NK10lgraph_api9FieldData4realEv"></span><span id="_CPPv2NK10lgraph_api9FieldData4realEv"></span><span id="lgraph_api::FieldData::realC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a3f678878dde3a729f94dfefbdc4ef2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">real</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData4realEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as a double. The <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> must be of FLOAT or DOUBLE types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown if the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of FLOAT or DOUBLE types.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A double. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6stringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6stringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6stringEv"></span><span id="lgraph_api::FieldData::stringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7314f49a51859d46439cfeddb9ea06ec"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6stringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as std::string. Valid only for STRING, BLOB and SPATIAL. BLOB data is returned as-is, since std::string can also hold byte array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when a bad cast error condition occurs.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A reference to a const std::string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBoolEv"></span><span id="lgraph_api::FieldData::AsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac488187ef67bf8905cbe686daab95183"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBoolEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="lgraph_api::FieldData::AsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0094a31af359f4684c261a56f780cfb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsInt8Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="lgraph_api::FieldData::AsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aaca113d03918222c50977a094b75c2d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt16Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="lgraph_api::FieldData::AsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0cc24eb0e06a5f5b5476f5739b6ae51e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt32Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="lgraph_api::FieldData::AsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a16e138db4d9a0defc0ab8f03a7864d65"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt64Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsFloatEv"></span><span id="lgraph_api::FieldData::AsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8f86682f960b846e1c3a59eb7fc6ae95"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsFloatEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="lgraph_api::FieldData::AsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2894e904ceb04109370957ba7c48e189"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsDoubleEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1accfbae3969f742ce3621560fee34dbda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Date</span> <span class="pre">AsDate</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1abd4d1fc803c662e145761278c129d3c9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::DateTime</span> <span class="pre">AsDateTime</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsStringEv"></span><span id="lgraph_api::FieldData::AsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5e3562cda960da001597e7dd5679b140"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsStringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBlobEv"></span><span id="lgraph_api::FieldData::AsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9a5a106b2ee0d6fa3c78592852682f0b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBlobEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="lgraph_api::FieldData::AsBase64BlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1afc4b6bc9a7a4d42a981579e04b86b3a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBase64Blob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a8128129ec0fa7689772f0c437fe93a1f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::SRID</span> <span class="pre">GetSRID</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a26726ddebb182026865e77b4e68f8f53"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a31ea41c18cb7507bfefbb18971a3dd0e"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ad5f639edaa8b36e90cff7192554b8723"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1aaef5ea8cbde81ad51459f035a99bdd7f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a7fce7150c8ad873933a8028b16a72a69"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a0015550261b9e976e07e61a3d5790fda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1afb01ecb2663024f0adedfcfe05928d45"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ade0f7fe05edb1eb43c1f4057275967f9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData13AsFloatVectorEv">
+<span id="_CPPv3NK10lgraph_api9FieldData13AsFloatVectorEv"></span><span id="_CPPv2NK10lgraph_api9FieldData13AsFloatVectorEv"></span><span id="lgraph_api::FieldData::AsFloatVectorC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab5a2c72f20b486e19729eaa24d6cb190"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsFloatVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData13AsFloatVectorEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6ToBoltEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6ToBoltEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6ToBoltEv"></span><span id="lgraph_api::FieldData::ToBoltC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3b294f10df124b9d290c7d8fb37e1243"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToBolt</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6ToBoltEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::ToString__ssCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5290ed610cdd3fb38c0d09be107dce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">null_value</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"NUL"</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get string representation of this <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="lgraph_api::FieldData::eq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1360e03268a1c10e4a40573e61f2f5ae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataneERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="lgraph_api::FieldData::neq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade1a5ee8968dbf6e7656e5adf96be546"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataneERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="lgraph_api::FieldData::gt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a936f13e9913fde88ff4beb6ba8cabbba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatageERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="lgraph_api::FieldData::gte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9dbdaf01c34ed106fe44fb5f4df2a43b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatageERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataltERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="lgraph_api::FieldData::lt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b808b6437787ab0de4133d7f1cd077"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataltERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataleERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="lgraph_api::FieldData::lte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a34d5df1f1114d3fe8c15bce452736680"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataleERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7GetTypeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7GetTypeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7GetTypeEv"></span><span id="lgraph_api::FieldData::GetTypeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aacf5cac64e0e4e0fba5962f6f1ecf925"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7GetTypeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7is_nullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7is_nullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7is_nullEv"></span><span id="lgraph_api::FieldData::is_nullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a54e61d2bb6c2a58d7b98180555af09e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_null</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7is_nullEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6is_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6is_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6is_bufEv"></span><span id="lgraph_api::FieldData::is_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a49ddf20e31700f6609ffa379f0d25a8f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6is_bufEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="lgraph_api::FieldData::is_empty_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade6523aa6dc019354f36c47aeb4dfd21"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_empty_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsNullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsNullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsNullEv"></span><span id="lgraph_api::FieldData::IsNullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac4d637a0dec45d546495c1660c9f6047"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsNull</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsNullEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is null. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBoolEv"></span><span id="lgraph_api::FieldData::IsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec3bdef27fa2d4de29db82d2334ad2d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBoolEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is bool. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBlobEv"></span><span id="lgraph_api::FieldData::IsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50d95767570c5cc1599c634b7b33e916"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBlobEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is BLOB. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsStringEv"></span><span id="lgraph_api::FieldData::IsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7c412f98489e7d252ef40ed053a3908c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is string. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="lgraph_api::FieldData::IsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a325f297dbf3554c5dbb109b2dada4a43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsInt8Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT8. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="lgraph_api::FieldData::IsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefe2db06fec008bc80e0d15ab52949c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt16Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT16. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="lgraph_api::FieldData::IsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a480ddcb154c9e18b948ff3850a42c22d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt32Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT32. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="lgraph_api::FieldData::IsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b0be739d239c9d646696e1bfe3b2bae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt64Ev" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is INT64. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsIntegerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="lgraph_api::FieldData::IsIntegerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8543c359835d7977b96446aaef126344"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsIntegerEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Is this a INT8, INT16, INT32 or INT64? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsFloatEv"></span><span id="lgraph_api::FieldData::IsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec0a6f81c7581924db00ea960358d91b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsFloatEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is float. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="lgraph_api::FieldData::IsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a300a2e608e8144e2fbe4588729dd34e3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsDoubleEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is double. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsRealEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsRealEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsRealEv"></span><span id="lgraph_api::FieldData::IsRealC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab6d49b63cf486d609f6286f8b26887f9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsRealEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Is this a FLOAT or DOUBLE? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsDateEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsDateEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsDateEv"></span><span id="lgraph_api::FieldData::IsDateC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8aa76d397e0e2b1d0cb09487316210cc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsDateEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is date. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="lgraph_api::FieldData::IsDateTimeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1b1b2b6676359ff4d4ec77eb7e7ee62e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is date time. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsPointEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsPointEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsPointEv"></span><span id="lgraph_api::FieldData::IsPointC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab50e9ff6a50f06668ea577fe1d963a8b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsPointEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is Point. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12IsLineStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="lgraph_api::FieldData::IsLineStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a795fc6d4d17d385f07d87f82bb247c45"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsLineString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12IsLineStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is LineString. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsPolygonEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="lgraph_api::FieldData::IsPolygonC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a57c2b6137c6ae390b86d5f341b900992"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPolygon</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsPolygonEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is Polygon. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsSpatialEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="lgraph_api::FieldData::IsSpatialC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad51d37e3d848990cec85e7de187309fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsSpatial</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsSpatialEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is spatial. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData13IsFloatVectorEv">
+<span id="_CPPv3NK10lgraph_api9FieldData13IsFloatVectorEv"></span><span id="_CPPv2NK10lgraph_api9FieldData13IsFloatVectorEv"></span><span id="lgraph_api::FieldData::IsFloatVectorC"></span><span class="target" id="structlgraph__api_1_1FieldData_1acc61d62e8a4cfa062827ec02687aff75"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsFloatVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData13IsFloatVectorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this object is float vector. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4typeE">
+<span id="_CPPv3N10lgraph_api9FieldData4typeE"></span><span id="_CPPv2N10lgraph_api9FieldData4typeE"></span><span id="lgraph_api::FieldData::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7booleanE">
+<span id="_CPPv3N10lgraph_api9FieldData7booleanE"></span><span id="_CPPv2N10lgraph_api9FieldData7booleanE"></span><span id="lgraph_api::FieldData::boolean__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a857e4e5a2613b7cf584dbf12dae00525"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">boolean</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7booleanE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4int8E">
+<span id="_CPPv3N10lgraph_api9FieldData4int8E"></span><span id="_CPPv2N10lgraph_api9FieldData4int8E"></span><span id="lgraph_api::FieldData::int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae0a430ab8199def132f3f07af5c84066"></span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4int8E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int16E">
+<span id="_CPPv3N10lgraph_api9FieldData5int16E"></span><span id="_CPPv2N10lgraph_api9FieldData5int16E"></span><span id="lgraph_api::FieldData::int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7cd86ccaa2b7be3ef15423f3f58e929e"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int16E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int32E">
+<span id="_CPPv3N10lgraph_api9FieldData5int32E"></span><span id="_CPPv2N10lgraph_api9FieldData5int32E"></span><span id="lgraph_api::FieldData::int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f658422e832e5e2d56e2245cb84be84"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int32E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int64E">
+<span id="_CPPv3N10lgraph_api9FieldData5int64E"></span><span id="_CPPv2N10lgraph_api9FieldData5int64E"></span><span id="lgraph_api::FieldData::int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a45d113f8d303eebb3734306531862812"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int64E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2spE">
+<span id="_CPPv3N10lgraph_api9FieldData2spE"></span><span id="_CPPv2N10lgraph_api9FieldData2spE"></span><span id="lgraph_api::FieldData::sp__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8d3eff5289da252b05248e40c1cd8188"></span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">sp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2spE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2dpE">
+<span id="_CPPv3N10lgraph_api9FieldData2dpE"></span><span id="_CPPv2N10lgraph_api9FieldData2dpE"></span><span id="lgraph_api::FieldData::dp__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae571d69d755e366904e8663a4c643901"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2dpE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData3bufE">
+<span id="_CPPv3N10lgraph_api9FieldData3bufE"></span><span id="_CPPv2N10lgraph_api9FieldData3bufE"></span><span id="lgraph_api::FieldData::buf__ssP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00201fbea83f2e7a263f58098aa98cd7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">buf</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData3bufE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2vpE">
+<span id="_CPPv3N10lgraph_api9FieldData2vpE"></span><span id="_CPPv2N10lgraph_api9FieldData2vpE"></span><span id="lgraph_api::FieldData::vp__std::vector:float:P"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab23dd3d030e744d4c1b873226056a4ba"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">vp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2vpE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4dataE">
+<span id="_CPPv3N10lgraph_api9FieldData4dataE"></span><span id="_CPPv2N10lgraph_api9FieldData4dataE"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b1a03093018acfa0d961cae96146f6"></span><span class="k"><span class="pre">union</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">[anonymous]</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BoolEb">
+<span id="_CPPv3N10lgraph_api9FieldData4BoolEb"></span><span id="_CPPv2N10lgraph_api9FieldData4BoolEb"></span><span id="lgraph_api::FieldData::Bool__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbaec39a10e97bfc380b60052450b22b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Bool</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BoolEb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4Int8E6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="lgraph_api::FieldData::Int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbc62444e525fdbd056581b349b2a7ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int8</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4Int8E6int8_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int16E7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="lgraph_api::FieldData::Int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f690c1758c4620ba79e4b03bf703531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int16</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int16E7int16_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int32E7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="lgraph_api::FieldData::Int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a99c13db42b1525365635d10480b7d4ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int32</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int32E7int32_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int64E7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="lgraph_api::FieldData::Int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7301552563e8fae5960de9efe235959b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int64</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int64E7int64_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5FloatEf">
+<span id="_CPPv3N10lgraph_api9FieldData5FloatEf"></span><span id="_CPPv2N10lgraph_api9FieldData5FloatEf"></span><span id="lgraph_api::FieldData::Float__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a326651bedfdc7a8f5743e42b7264003b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Float</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5FloatEf" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6DoubleEd">
+<span id="_CPPv3N10lgraph_api9FieldData6DoubleEd"></span><span id="_CPPv2N10lgraph_api9FieldData6DoubleEd"></span><span id="lgraph_api::FieldData::Double__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5304168443248acb485e7e600e150feb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Double</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6DoubleEd" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="lgraph_api::FieldData::Date__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a88a43a9fe1328b1c06a36f469c286b29"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="lgraph_api::FieldData::Date__lgraph_api::DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a217032b1e975d7f3e8c81d0b10ef2eaa"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="lgraph_api::FieldData::DateTime__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a07cfe75d33077c683aa297554049e1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="lgraph_api::FieldData::DateTime__lgraph_api::DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00245f8fabb288c073b2b8b6310c95ae"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a46cdb6bb8f5ed9047595d8a0559960f9"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0abb491f06b5016de61c1a37dc22cca1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc"></span><span id="lgraph_api::FieldData::String__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefd38e03044cc9574ec9f82f8d8646db"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="lgraph_api::FieldData::String__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0500c9ca63c2c826c5f957706676717a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa6b8639fdb113bf8fe4a6556a161386e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1aa9bc69d37ba46872d769a6678058f5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="lgraph_api::FieldData::Point__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aed6deea650cc82d203060e3db07d2d3b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aadeac21d00b14c4fe99ca7356b38c4c5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1134a797ff8e36b78b12ffa26d3fe7ea"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::LineString__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1af7a37b2d5b7065e5f077d5ed9c203c6a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a89db7b33c84d04f622917e6096f32677"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac595c7685df74f6f1e439c1f14b4fb5c"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="lgraph_api::FieldData::Polygon__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac2f0d143ec079d8c6e6d340d383f0ee1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0051c95b3f512cf741e877d7d84e4298"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac60a663a7f4b31bc4a2ff727d6632f00"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="lgraph_api::FieldData::Spatial__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a32852c0236f9dab9f44a4ad88026f3d1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData11FloatVectorERKNSt6vectorIfEE">
+<span id="_CPPv3N10lgraph_api9FieldData11FloatVectorERKNSt6vectorIfEE"></span><span id="_CPPv2N10lgraph_api9FieldData11FloatVectorERKNSt6vectorIfEE"></span><span id="lgraph_api::FieldData::FloatVector__std::vector:float:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a06ede731eec6fa7ba9036372fa9f40f3"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FloatVector</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData11FloatVectorERKNSt6vectorIfEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6277538e024b6bce57fed9ff337fd973"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa40480bb254330540b587feb99e8cded"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="lgraph_api::FieldData::Blob__std::vector:uint8_t:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a07c0ced9778df1c5fed3a4663cc45abd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint8_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructs a Blob from vector of uint8_t, treated as byte array. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="lgraph_api::FieldData::BlobFromBase64__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa1ff897ed22d2524b5caaedb4aadb3dd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BlobFromBase64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">base64_encoded</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructs a BLOB from Base64 encoded string. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="lgraph_api::FieldData::IsBufType__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1abbb98d7d3792559fa61cca3554aeaba7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBufType</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if ‘t’ is BLOB or STRING. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="lgraph_api::FieldData::IsInteger__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae00a13411b0557d842ffb8ea5f89e413"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if ‘t’ is INT8, 16, 32, or 64. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="lgraph_api::FieldData::IsReal__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a884ee60f7e50a01ab3a12179298fb9cb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if ‘t’ is FLLOAT or DOUBLE. </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpecE">
+<span id="_CPPv3N10lgraph_api9FieldSpecE"></span><span id="_CPPv2N10lgraph_api9FieldSpecE"></span><span id="lgraph_api::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Specification for a field. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="lgraph_api::FieldSpec::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1abfe187a3e79a4445a5270bba3bfaf72c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssCR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a8428f3af5f513d918d94feb5c78fa7e0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>n</strong> – Field name </p></li>
+<li><p><strong>t</strong> – Field type </p></li>
+<li><p><strong>nu</strong> – True if field is optional </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssRR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ada0df81c60e30bca34ba912a11fcdd9f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec">
+<span id="_CPPv3NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="_CPPv2NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="lgraph_api::FieldSpec::eq-operator__FieldSpecCRC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ac1104e4f8ee3666f766a09745b03836d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpec8ToStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="lgraph_api::FieldSpec::ToStringC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpec8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the string representation of the <a class="reference internal" href="#structlgraph__api_1_1FieldSpec"><span class="std std-ref">FieldSpec</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4nameE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4nameE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4nameE"></span><span id="lgraph_api::FieldSpec::name__ss"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4nameE" title="Permalink to this definition"></a><br></dt>
+<dd><p>name of the field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4typeE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4typeE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4typeE"></span><span id="lgraph_api::FieldSpec::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4typeE" title="Permalink to this definition"></a><br></dt>
+<dd><p>type of that field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec8optionalE">
+<span id="_CPPv3N10lgraph_api9FieldSpec8optionalE"></span><span id="_CPPv2N10lgraph_api9FieldSpec8optionalE"></span><span id="lgraph_api::FieldSpec::optional__b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a1b3b38329495fc55fd443dfa2246337b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">optional</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec8optionalE" title="Permalink to this definition"></a><br></dt>
+<dd><p>is this field optional? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpecE">
+<span id="_CPPv3N10lgraph_api9IndexSpecE"></span><span id="_CPPv2N10lgraph_api9IndexSpecE"></span><span id="lgraph_api::IndexSpec"></span><span class="target" id="structlgraph__api_1_1IndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>An index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5labelE"></span><span id="lgraph_api::IndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5labelE" title="Permalink to this definition"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5fieldE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5fieldE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5fieldE"></span><span id="lgraph_api::IndexSpec::field__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a97bab0e4c0ea8b12272a606c825360e7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5fieldE" title="Permalink to this definition"></a><br></dt>
+<dd><p>field name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api9IndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api9IndexSpec4typeE"></span><span id="lgraph_api::IndexSpec::type__IndexType"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1ac8263343d7a58ec888a110427f522b64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec4typeE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsE">
+<span id="_CPPv3N10lgraph_api12LabelOptionsE"></span><span id="_CPPv2N10lgraph_api12LabelOptionsE"></span><span id="lgraph_api::LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelOptions</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Label options, base class, define some common fields and methods. </p>
+<p>Subclassed by <a class="reference internal" href="#structlgraph__api_1_1EdgeOptions"><span class="std std-ref">EdgeOptions</span></a>, <a class="reference internal" href="#structlgraph__api_1_1VertexOptions"><span class="std std-ref">VertexOptions</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api12LabelOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="lgraph_api::LabelOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a630c29d66f94446c4292172285d61492"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api12LabelOptions9to_stringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions5clearEv">
+<span id="_CPPv3N10lgraph_api12LabelOptions5clearEv"></span><span id="_CPPv2N10lgraph_api12LabelOptions5clearEv"></span><span id="lgraph_api::LabelOptions::clear"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a5eeb94d22b8366d1b68d0614384802fe"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions5clearEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsD0Ev">
+<span id="_CPPv3N10lgraph_api12LabelOptionsD0Ev"></span><span id="_CPPv2N10lgraph_api12LabelOptionsD0Ev"></span><span id="lgraph_api::LabelOptions::~LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a0c56bbf380b6ce74a532637b65f7e7a4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~LabelOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions15detach_propertyE">
+<span id="_CPPv3N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="_CPPv2N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="lgraph_api::LabelOptions::detach_property__b"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a6057cc32d98316ec805c453db60c48ef"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">detach_property</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions15detach_propertyE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ParameterE">
+<span id="_CPPv3N10lgraph_api9ParameterE"></span><span id="_CPPv2N10lgraph_api9ParameterE"></span><span id="lgraph_api::Parameter"></span><span class="target" id="structlgraph__api_1_1Parameter"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parameter</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ParameterE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>The parameter of procedure/plugin. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4nameE">
+<span id="_CPPv3N10lgraph_api9Parameter4nameE"></span><span id="_CPPv2N10lgraph_api9Parameter4nameE"></span><span id="lgraph_api::Parameter::name__ss"></span><span class="target" id="structlgraph__api_1_1Parameter_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4nameE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter5indexE">
+<span id="_CPPv3N10lgraph_api9Parameter5indexE"></span><span id="_CPPv2N10lgraph_api9Parameter5indexE"></span><span id="lgraph_api::Parameter::index__i"></span><span class="target" id="structlgraph__api_1_1Parameter_1a750b5d744c39a06bfb13e6eb010e35d0"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">index</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter5indexE" title="Permalink to this definition"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>name of the parameter </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4typeE">
+<span id="_CPPv3N10lgraph_api9Parameter4typeE"></span><span id="_CPPv2N10lgraph_api9Parameter4typeE"></span><span id="lgraph_api::Parameter::type__LGraphType"></span><span class="target" id="structlgraph__api_1_1Parameter_1ac8ec89e84ffc9d1ffe1b030f61a76e44"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4typeE" title="Permalink to this definition"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>index of the parameter list in which the parameter stay </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfoE">
+<span id="_CPPv3N10lgraph_api8RoleInfoE"></span><span id="_CPPv2N10lgraph_api8RoleInfoE"></span><span id="lgraph_api::RoleInfo"></span><span class="target" id="structlgraph__api_1_1RoleInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RoleInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfoE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the role. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo4descE">
+<span id="_CPPv3N10lgraph_api8RoleInfo4descE"></span><span id="_CPPv2N10lgraph_api8RoleInfo4descE"></span><span id="lgraph_api::RoleInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo4descE" title="Permalink to this definition"></a><br></dt>
+<dd><p>description </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo12graph_accessE">
+<span id="_CPPv3N10lgraph_api8RoleInfo12graph_accessE"></span><span id="_CPPv2N10lgraph_api8RoleInfo12graph_accessE"></span><span id="lgraph_api::RoleInfo::graph_access__std::map:ss.AccessLevel:"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1ac689f8bad73d3d9b3c2a1c11f1296905"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph_access</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo12graph_accessE" title="Permalink to this definition"></a><br></dt>
+<dd><p>access levels on different graphs </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8RoleInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8RoleInfo8disabledE"></span><span id="lgraph_api::RoleInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo8disabledE" title="Permalink to this definition"></a><br></dt>
+<dd><p>is this role disabled? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpecE">
+<span id="_CPPv3N10lgraph_api7SigSpecE"></span><span id="_CPPv2N10lgraph_api7SigSpecE"></span><span id="lgraph_api::SigSpec"></span><span class="target" id="structlgraph__api_1_1SigSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SigSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpecE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec10input_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec10input_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec10input_listE"></span><span id="lgraph_api::SigSpec::input_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a4f4b1c5201f32fae15b91c8a51021f63"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">input_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec10input_listE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec11result_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec11result_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec11result_listE"></span><span id="lgraph_api::SigSpec::result_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a23e292d0e3f983f3ceba15f9f6249209"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec11result_listE" title="Permalink to this definition"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>input parameter list </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfoE">
+<span id="_CPPv3N10lgraph_api8UserInfoE"></span><span id="_CPPv2N10lgraph_api8UserInfoE"></span><span id="lgraph_api::UserInfo"></span><span class="target" id="structlgraph__api_1_1UserInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UserInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfoE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the user. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo4descE">
+<span id="_CPPv3N10lgraph_api8UserInfo4descE"></span><span id="_CPPv2N10lgraph_api8UserInfo4descE"></span><span id="lgraph_api::UserInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo4descE" title="Permalink to this definition"></a><br></dt>
+<dd><p>description of the user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo5rolesE">
+<span id="_CPPv3N10lgraph_api8UserInfo5rolesE"></span><span id="_CPPv2N10lgraph_api8UserInfo5rolesE"></span><span id="lgraph_api::UserInfo::roles__std::set:ss:"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1f4c5a9d9b2a7c1022128d3201f03648"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">roles</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo5rolesE" title="Permalink to this definition"></a><br></dt>
+<dd><p>roles of this user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8UserInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8UserInfo8disabledE"></span><span id="lgraph_api::UserInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo8disabledE" title="Permalink to this definition"></a><br></dt>
+<dd><p>is this user disabled? </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo12memory_limitE">
+<span id="_CPPv3N10lgraph_api8UserInfo12memory_limitE"></span><span id="_CPPv2N10lgraph_api8UserInfo12memory_limitE"></span><span id="lgraph_api::UserInfo::memory_limit__s"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1943ac86ca89eaf251c01c16772dfc00"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">memory_limit</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo12memory_limitE" title="Permalink to this definition"></a><br></dt>
+<dd><p>memory limit for this user </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptionsE">
+<span id="_CPPv3N10lgraph_api13VertexOptionsE"></span><span id="_CPPv2N10lgraph_api13VertexOptionsE"></span><span id="lgraph_api::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Vertex label options, contain fields only vertex have. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="lgraph_api::VertexOptions::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1afd0ea869dba2b64723f3643ef5f6d2df"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="lgraph_api::VertexOptions::VertexOptions__ssCR"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac769e8bf000b16416a763894714829c7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">primary_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api13VertexOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="lgraph_api::VertexOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api13VertexOptions9to_stringEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions5clearEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions5clearEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions5clearEv"></span><span id="lgraph_api::VertexOptions::clear"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions5clearEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13primary_fieldE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="lgraph_api::VertexOptions::primary_field__ss"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1a72852ec13f99950d76332fad99c71dd0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">primary_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13primary_fieldE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-utils">
+<h2>lgraph_utils<a class="headerlink" href="#lgraph-utils" title="Permalink to this headline"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv44json">
+<span id="_CPPv34json"></span><span id="_CPPv24json"></span><span class="target" id="lgraph__utils_8h_1ab701e3ac61a85b337ec5c1abaad6742d"></span><span class="k"><span class="pre">using</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">json</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><a class="headerlink" href="#_CPPv44json" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8get_timeEv">
+<span id="_CPPv3N10lgraph_api8get_timeEv"></span><span id="_CPPv2N10lgraph_api8get_timeEv"></span><span id="lgraph_api::get_time"></span><span class="target" id="namespacelgraph__api_1ab3691fc022301a72d8cb766dc0c17fdf"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">get_time</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8get_timeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get current time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Digit value of current time. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE">
+<span id="_CPPv3N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="_CPPv2N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="lgraph_api::split_string__ss.std::vector:ss:R.ss"></span><span class="target" id="namespacelgraph__api_1ae25400b1a7ff2282865cd3cc2353a536"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">split_string</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">origin_string</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sub_strings</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">string_delimiter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Split the original string by format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>origin_string</strong> – original string to be split. </p></li>
+<li><p><strong>sub_strings</strong> – split substring. </p></li>
+<li><p><strong>string_delimiter</strong> – Split format. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE">
+<span id="_CPPv3N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="_CPPv2N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="lgraph_api::rc4__ssR.ss.ss"></span><span class="target" id="namespacelgraph__api_1a985e409c942e1068d32b795a27024122"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">rc4</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">key</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mode</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encrypt the input string in ac4 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>input</strong> – input string. </p></li>
+<li><p><strong>key</strong> – encryption key. </p></li>
+<li><p><strong>mode</strong> – encryption mode </p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13encode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="lgraph_api::encode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a2e5f53c59cee61047cb4e283fb6c1950"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">encode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13encode_base64EKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Encode the input string in encode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13decode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="lgraph_api::decode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a047800adaceb796bbb0eb71c016e4fa3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">decode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13decode_base64EKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Decode the input string in decode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Decrypted string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12alloc_bufferE6size_t">
+<span id="_CPPv3N10lgraph_api12alloc_bufferE6size_t"></span><span id="_CPPv2N10lgraph_api12alloc_bufferE6size_t"></span><span id="lgraph_api::alloc_buffer__s"></span><span class="target" id="namespacelgraph__api_1a3274ccf2c4d0f0990a6edbdee20109c4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">alloc_buffer</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12alloc_bufferE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Allocate memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>bytes</strong> – Size in byte of request memory. </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Pointer of allocated memory. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t">
+<span id="_CPPv3N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="_CPPv2N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="lgraph_api::dealloc_buffer__voidP.s"></span><span class="target" id="namespacelgraph__api_1ad6721e43c2327ad8e4c6e19c0996a770"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dealloc_buffer</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buffer</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Free memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>buffer</strong> – Size in bytes of request memory </p></li>
+<li><p><strong>bytes</strong> – Pointer of memory to free. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ae22fdc516fa3fd1ee7f8ad22d877bc64"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a54668379bc6d79cb28f24c532d6ceb28"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse vector parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="lgraph_api::GetVidFromNodeString__ssCR"></span><span class="target" id="namespacelgraph__api_1aa24b1e990b795a8d59c369760c930c7f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVidFromNodeString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">node_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Parse vid from the node passed in by cypher. For V2 procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>node_string</strong> – <strong>[in]</strong> node </p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>vid </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-index-iterator">
+<h2>lgraph_vertex_index_iterator<a class="headerlink" href="#lgraph-vertex-index-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorE"></span><span id="lgraph_api::VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> can be used to access a set of vertices that has the same indexed value. If the index is unique (that is, each vertex has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> will only have one VertexId, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> is valid iff it points to a valid (index_value, vid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a73eb49fc5a21c2eab2d862fb07231061"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1adf8da63a296279030584c1d539dfc7e0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="lgraph_api::VertexIndexIterator::~VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a4a5611b7ffb02851074518d929862608"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="lgraph_api::VertexIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="lgraph_api::VertexIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="lgraph_api::VertexIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next vertex id in the list, which consists of all the valid vertex ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::VertexIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the current index value. The vids are sorted in (IndexValue, Vid) order. When <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one vid to next, possibly moving from one IndexValue to another. This function tells the IndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="lgraph_api::VertexIndexIterator::GetVidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a89f7ed3f184862498c0df7d87b97a1b4"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the current vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The current vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__lgraph::VertexIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a8adfcdcf8d9abeee72c3da1b9f21edaa"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae8421018f7913edfc4d82d2c0f209085"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1abe6ca171051639d874dbfb573a9d4cb3"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator3it_E"></span><span id="lgraph_api::VertexIndexIterator::it___std::unique_ptr:lgraph::VertexIndexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae02cf2beed475be9b6af2ddacf99f077"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="lgraph_api::VertexIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-iterator">
+<h2>lgraph_vertex_iterator<a class="headerlink" href="#lgraph-vertex-iterator" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> can be used to iterate through vertices in the DB. Vertices are sorted according to vertex id in the DB. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> is valid iff it points to a valid vertex. Calling method functions on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> for non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> with the id of a non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"><span class="std std-ref">Delete()</span></a> on the last vertex. </p></li>
+</ol>
+<p></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7888300a9ddafc0d6814c54b7d2f1f11"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac4f5daf4ebb180eb1a0c9d1ba024bf38"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14VertexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14VertexIteratorD0Ev"></span><span id="lgraph_api::VertexIterator::~VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ab031829b35061e00c09bf2f5c951063f"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator5CloseEv"></span><span id="lgraph_api::VertexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator5CloseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Closes this iterator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator4NextEv"></span><span id="lgraph_api::VertexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4NextEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Move to the next vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>True if it succeeds, otherwise return false (no more vertex) and invalidate the iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb">
+<span id="_CPPv3N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="_CPPv2N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="lgraph_api::VertexIterator::Goto__int64_t.b"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Goto the vertex with id src. If there is no vertex with exactly the same vid, and nearest==true, go to the next vertex with id&gt;=vid, otherwise return false and invalidate the iterator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vid</strong> – Vertex id of the vertex to go. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to go to the closest vertex with id&gt;=vid.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false (no such vertex). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator5GetIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="lgraph_api::VertexIterator::GetIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a9fedaf26513596c151c16f829b47038e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator5GetIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a594a8927f27893b46f4f8ce547b5e558"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the first out-going edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1abb6aadfa764244d29f6458a40f5c4f17"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge, and nearest==false an invalid iterator is returned. If the specified out-edge does not exist, and nearest==true, get the first out-edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetInEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the first in-coming edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetInEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a1013d34130e78bd8715e7b7a0759b578"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge and nearest==false, an invalid iterator is returned. If the specified edge does not exist and nearest==true,. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="lgraph_api::VertexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator7IsValidEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="lgraph_api::VertexIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the label of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="lgraph_api::VertexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets label id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="lgraph_api::VertexIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="lgraph_api::VertexIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get field identified by field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="lgraph_api::VertexIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>all fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListSrcVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a910d02e24a65995a2784e2028d6244ac"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListSrcVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>List source vids. Each source vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>List of source vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListDstVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1add92b73ced9e72b3b87fa80f486c27a9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListDstVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>List destination vids. Each vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit of number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>List of desitnation vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumInEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1acba67b0fdb21bf78555353cf53fb4f6f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of incoming edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of in-coming edges to count. When the limit is reached, n_limit is returned. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of incoming edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumOutEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a273dc0f4b8ddf828a89ae68748ed0c74"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Gets number of out-going edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of out-going edges to count. When the limit is reached, n_limit is returned and limit_exceeded is set to true. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of out-going edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t">
+<span id="_CPPv3N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="_CPPv2N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="lgraph_api::VertexIterator::Delete__sP.sP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_in_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_out_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Deletes this vertex, also deletes all incoming and outgoing edges of this vertex. The iterator will point to the next vertex by vid if there is any. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_in_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of in edges the vertex had. </p></li>
+<li><p><strong>n_out_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of out edges the vertex had. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="lgraph_api::VertexIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8ToStringEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the string representation of this vertex. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIterator::VertexIterator__lgraph::graph::VertexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a77858ba7e00cd9e8676e4b168d95f931"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a4b166320bbbeadd713f612c540094bf9"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a25e24a42419e107fee77196a8a9fc488"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator3it_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator3it_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator3it_E"></span><span id="lgraph_api::VertexIterator::it___std::unique_ptr:lgraph::graph::VertexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a26ee2d6416d9ad738ce344fb2b1a2972"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator3it_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator4txn_E"></span><span id="lgraph_api::VertexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-base">
+<h2>olap_base<a class="headerlink" href="#olap-base" title="Permalink to this headline"></a></h2>
+<p>This is an implementation of the TuGraph graph analytics engine. The graph analytics engine is a general-purpose processing engine useful for implementing various graph analytics algorithms such as PageRank, ShortestPath, etc.. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_WORKING">
+<span class="target" id="olap__base_8h_1af8106a969b5fe14011400dcc5de93889"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_WORKING</span></span></span><a class="headerlink" href="#c.THREAD_WORKING" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_STEALING">
+<span class="target" id="olap__base_8h_1a3537fbf36165f2b4f963e4dd7462ec22"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_STEALING</span></span></span><a class="headerlink" href="#c.THREAD_STEALING" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.VERTEX_BATCH_SIZE">
+<span class="target" id="olap__base_8h_1a7655fa441302a14fb0f2f7f74ebe9e64"></span><span class="sig-name descname"><span class="n"><span class="pre">VERTEX_BATCH_SIZE</span></span></span><a class="headerlink" href="#c.VERTEX_BATCH_SIZE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.WORD_OFFSET">
+<span class="target" id="olap__base_8h_1aaa604dee271e714e574fa9a36fd57682"></span><span class="sig-name descname"><span class="n"><span class="pre">WORD_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.WORD_OFFSET" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.BIT_OFFSET">
+<span class="target" id="olap__base_8h_1a5a49e33dd4567ba395e94a35716669b6"></span><span class="sig-name descname"><span class="n"><span class="pre">BIT_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.BIT_OFFSET" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="olap__base_8h_1a539fe76ede7635af5ee150bd33d03317"></span><span class="sig-name descname"><span class="pre">union</span> <span class="pre">@5</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49neighbour">
+<span id="_CPPv39neighbour"></span><span id="_CPPv29neighbour"></span><span id="neighbour__s"></span><span class="target" id="olap__base_8h_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv49neighbour" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49edge_data">
+<span id="_CPPv39edge_data"></span><span id="_CPPv29edge_data"></span><span id="edge_data__EdgeData"></span><span class="target" id="olap__base_8h_1a24f41c52f29d0ba9636668d50ed99a63"></span><span class="n"><span class="pre">EdgeData</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv49edge_data" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43src">
+<span id="_CPPv33src"></span><span id="_CPPv23src"></span><span id="src__s"></span><span class="target" id="olap__base_8h_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv43src" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43dst">
+<span id="_CPPv33dst"></span><span id="_CPPv23dst"></span><span id="dst__s"></span><span class="target" id="olap__base_8h_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv43dst" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olapE">
+<span id="_CPPv3N10lgraph_api4olapE"></span><span id="_CPPv2N10lgraph_api4olapE"></span><span id="lgraph_api::olap"></span><span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olapE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aae"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Define the edge direction policy of graph The policy determines the graph symmetric and undirected feature. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaea17946ea357e5e0a46f7354049d684ba1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DUAL_DIRECTION</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The graph is asymmetric. The edges from input files are outgoing edges. The reversed edges form incoming edges. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeafdc4fc0261af8c2b6f66ab00eed5fe55"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAKE_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The graph is symmetric but the input files are asymmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeaa1b7f74c74bb030bf8360c598fdfc08f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INPUT_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Both the graph and the input files are symmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a944bcbf0349029631b4fbda1660df186"></span><span class="sig-name descname"><span class="pre">template&lt;typename</span> <span class="pre">EdgeData&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a6eded0577caa238e1cf59a742cbc7eeb"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum">
+<span id="_CPPv3I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span id="_CPPv2I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aaa30a5461bdf30947283236f847714e7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reduce_plus</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="Permalink to this definition"></a><br></dt>
+<dd><p>The default reduce function which uses the plus operator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a5bcc917c95bec960faafcf5506201325"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1ac8203a028b53e5841a52737f4a4f3bcd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1abf9e945446fe724862c9960198e7174f"></span><span class="sig-name descname"><span class="pre">struct</span> <span class="pre">lgraph_api::olap::EdgeStringUnit</span> <span class="pre">__attribute__</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="lgraph_api::olap::MAX_NUM_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a8b2861b30aec5ae10d4519bf3a8ce0f2"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_NUM_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The maximum number of edges. Change this value if needed. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjListE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjListE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjListE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1AdjList"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="lgraph_api::olap::AdjList::AdjList"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a8b7b96acd6306a4b7c5b74df226e6f7e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList5beginEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList5beginEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList5beginEv"></span><span id="lgraph_api::olap::AdjList::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a1b44a588619cf9b27a4cf547d290bcf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList5beginEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList3endEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList3endEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList3endEv"></span><span id="lgraph_api::olap::AdjList::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1af77a3b6fb415f06e5b56bfc9be448a70"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList3endEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjListixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap7AdjListixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap7AdjListixE6size_t"></span><span id="lgraph_api::olap::AdjList::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a62df7b80147908931b2be1c979639f43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjListixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="lgraph_api::olap::AdjList::AdjList__AdjUnit:EdgeData:P.AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a50f0d642dca2d5631b139d235bd790f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">begin</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList6begin_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList6begin_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList6begin_E"></span><span id="lgraph_api::olap::AdjList::begin___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1aaf99bb4a670e8aa9cae1d700f1e57c5c"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList6begin_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList4end_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList4end_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList4end_E"></span><span id="lgraph_api::olap::AdjList::end___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a90c044b28a9a95203b0a0c289772e178"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList4end_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">OlapBase&lt;</span> <span class="pre">EdgeData</span> <span class="pre">&gt;</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjUnit&lt;EdgeData&gt; represents an adjacent edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="lgraph_api::olap::AdjUnit::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1aacfa29d2dd368a125e50f21c115ec46f"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@4</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeStringUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeStringUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type, The vertex is of string type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="lgraph_api::olap::EdgeStringUnit::src__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1aac2e7b82f607b746d5b33c401a555ad4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="lgraph_api::olap::EdgeStringUnit::dst__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1a030e02dd512080f9859d50b7c2f10db0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeStringUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="lgraph_api::olap::EdgeStringUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8EdgeUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap8EdgeUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap8EdgeUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="lgraph_api::olap::EdgeUnit::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3srcE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="lgraph_api::olap::EdgeUnit::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3dstE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a4a58050a4c0f1da86ec007813a4ec308"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::EdgeUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@6</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap5EmptyE">
+<span id="_CPPv3N10lgraph_api4olap5EmptyE"></span><span id="_CPPv2N10lgraph_api4olap5EmptyE"></span><span id="lgraph_api::olap::Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1Empty"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Empty</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> is used for representing unweighted graphs. </p>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBaseE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBaseE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBaseE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjList&lt;EdgeData&gt; allows range-based for-loop over AdjUnit&lt;EdgeData&gt;. </p>
+<p>Graph.</p>
+<p>
+EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>EdgeData</strong> – Type of the edge data.</p></li>
+<li><p><strong>EdgeData</strong> – Graph instances represent static (sub)graphs loaded from txt file. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses.</p></li>
+<li><p><strong>EdgeData</strong> – Type of the edge data. </p></li>
+</ul>
+</dd>
+</dl>
+<p>Subclassed by <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB&lt; EdgeData &gt;</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="lgraph_api::olap::OlapBase::OlapBase"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8b1cb218d9ddbe502eda5a2f0d674d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Constructor of Graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapBase::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af1aedb46d1972859e79efafbe6c33ec2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a6c48401f52e77a7286b04c528b98dc5e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the out-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The out-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::InDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aaa9b9b0056536f6d533c1dfed9fc0ef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the in-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The in-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ada8118bd934579318a4ed38d0233b70d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the outgoing edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The outgoing edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::InEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a19e62567748b5c1a224457b9756d4002"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Access the incoming edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The incoming edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="lgraph_api::olap::OlapBase::Transpose"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a109318636af36bc89e9853f19e4369e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transpose</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Transpose the graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="lgraph_api::olap::OlapBase::NumVertices"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a07d9840894a10d114719bcf339a5a20d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get number of vertices of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of vertices of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="lgraph_api::olap::OlapBase::NumEdges"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af16ce4014b334a365ccac510c4e4045d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumEdges</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get number of edges of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>Number of edges of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a010ffba60888eacee4ed8153d69e22d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="lgraph_api::olap::OlapBase::AllocVertexArray::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexArray</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Allocate a vertex array with type VertexData. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>VertexData</strong> – Type of the vertex data.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> with type VertexData. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="lgraph_api::olap::OlapBase::AllocVertexSubset"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a950a6ba41cf3e3885d043c15616f583d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexSubset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Allocate a vertex subset represented with <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> sized |V| of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::AcquireVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac15d778dde37cd4ec7f0471d170fe35a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AcquireVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Lock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::ReleaseVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a3d005cde32497e212181e88217938f25"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReleaseVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Unlock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::GuardVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea1c361387ef31606753020550642cf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="lgraph_api::olap::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GuardVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock/unlock.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> corresponding to the specified vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="lgraph_api::olap::OlapBase::IfSparse__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8096171f84ad9c7c78c9ea965c475a8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IfSparse</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd><p>Judging whether it is sparse mode or dense mode according to the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>active_vertices</strong> – The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> of active_vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="lgraph_api::olap::OlapBase::set_num_vertices__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab0c9ca5cca45f72dcbb4ebe427e64b4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">set_num_vertices</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Assign vertices to the first loaded graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vertices</strong> – The vertex id (in the Graph) to lock/unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="lgraph_api::olap::OlapBase::LoadFromArray__cP.s.s.EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a16c3082aa7057bdc8e80f6491e6d8e88"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadFromArray</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">edge_array</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_vertices</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_edges</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">edge_direction_policy</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy" title="Permalink to this definition"></a><br></dt>
+<dd><p>Load graph data from edge_array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>edge_array</strong> – <strong>[in]</strong> The data in this array is read into the graph. </p></li>
+<li><p><strong>input_vertices</strong> – The number of vertices in the input graph data. </p></li>
+<li><p><strong>input_edges</strong> – The number of edges in the input graph data. </p></li>
+<li><p><strong>edge_direction_policy</strong> – Graph data loading method. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a23cdd3850d0641f99a761cd30318ddae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Execute a parallel-for loop in the range [lower, upper). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Template Parameters</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing the work. </p></li>
+<li><p><strong>lower</strong> – The lower bound of the range (inclusive). </p></li>
+<li><p><strong>upper</strong> – The upper bound of the range (exclusive). </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adbf76a87d17dfdeb4554fc058772f351"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a2115dc228e9cde0ea88fad83d9527ebe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Process a set of active vertices in parallel. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Template Parameters</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing each vertex’s work. </p></li>
+<li><p><strong>active_vertices</strong> – <strong>[inout]</strong> The active vertex set. </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac8cdec9111784ddeb528c899d99ea5bd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-functions">Protected Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="lgraph_api::olap::OlapBase::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ad0df12e23dc13705b7160effdecdca73"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-attributes">Protected Attributes</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="lgraph_api::olap::OlapBase::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="lgraph_api::olap::OlapBase::num_edges___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac4dfd32613a83596fa43818fd979a6e2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_data_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a703092681fc7abbc984632b1644216cd"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::adj_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aec12c1eea29776d600cedb7c8de70b71"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">adj_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea4bca314eba173531bc9f04e35888e7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="lgraph_api::olap::OlapBase::edge_direction_policy___EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a59e5aefcf4de1752fda0c644c4bf920a"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_direction_policy_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="lgraph_api::olap::OlapBase::edge_list___EdgeUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aa463cdb96cdb7fa5bc259c8facc9aed9"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit"><span class="n"><span class="pre">EdgeUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">edge_list_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="lgraph_api::olap::OlapBase::out_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adb8e1bf54dfd199e838ec45066f8f758"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="lgraph_api::olap::OlapBase::in_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a55bb224127fd22ab38d9ea251d83895a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="lgraph_api::olap::OlapBase::out_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af6c2b6632374310efa986cf7aa54fd55"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_index_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="lgraph_api::olap::OlapBase::in_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a8f5032936723f9e23aec62f377b2a3ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_index_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="lgraph_api::olap::OlapBase::out_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a890254f0669f50d5d51c0b7f3c6b94ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="lgraph_api::olap::OlapBase::in_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a35d8cc39082a3468d82e0bf4412aee62"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="lgraph_api::olap::OlapBase::lock_array___ParallelVector:b:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aee90f899c9abd99447bfa22781c5634d"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lock_array_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetE"></span><span id="lgraph_api::olap::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> implements the concurrent bitset data structure, which is usually used to represent active vertex sets. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af71b86fef4aceb1ea4e0c39a4ee73369"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>size</strong> – The size of the bitset (i.e. the number of bits). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7242b92edfd78d370c06883f93674ebe"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::assign-operator__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ab16e3e695d258f2ce3d1ad5eef412a12"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ae83afc3b8694c5e279c03836a293ca1c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a1f67570cf9608fb5b62de10c44519e6e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="lgraph_api::olap::ParallelBitset::~ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7779a66d09a414c3ef215609e2dc9da8"></span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="lgraph_api::olap::ParallelBitset::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Clear the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="lgraph_api::olap::ParallelBitset::Fill"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af5105c0eef86140ad8203af2bf159d57"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Fill the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Has__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ade408d5cd908ff319ee49500dbb898da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Has</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Test a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to test.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Whether the bit is set or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Add__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a9d6d2b50895f5add363b7a1a30b0b804"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Set a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to set.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>Whether the operation is a true addition or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::Swap__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad079bdc6ea46251fa256de71ac77c8db"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset" title="Permalink to this definition"></a><br></dt>
+<dd><p>Swap the current bitset with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other bitset to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="lgraph_api::olap::ParallelBitset::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5503ab878f0444a70c87fcce727a4b3c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="lgraph_api::olap::ParallelBitset::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="lgraph_api::olap::ParallelBitset::data___uint64_tP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad26e57b8e7bb88f06c363fab8e7009a2"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5data_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="lgraph_api::olap::ParallelBitset::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14ParallelVectorE">
+<span id="_CPPv3I0EN10lgraph_api4olap14ParallelVectorE"></span><span id="_CPPv2I0EN10lgraph_api4olap14ParallelVectorE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>ParallelVector&lt;T&gt; aims to mimic std::vector&lt;T&gt;. Note that the deletions other than clearing are not supported. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aef646925bb31e3dcc02a67e584e6d2d4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><p><strong>capacity</strong> – The capacity of the vector. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab1334ee433460a07146e277f7e4c30d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>capacity</strong> – The capacity of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__TP.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a140f4d7cdcdfec667cf096f6d855b155"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt; </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>data</strong> – The initial data of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. And the initial capacity equals initial size. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a3aae6881aa98ab806d5eabd668491187"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1af4d6dc6eecb55e2ddf126fef29b17c79"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::assign-operator__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a70489ba54b4027e4e589c93a6a474666"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ae3fed3af74f330a9856fe2cd42482f44"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Default constructor of ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="lgraph_api::olap::ParallelVector::Destroy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ac919a991060ede6983343719401686de"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Destroy ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="lgraph_api::olap::ParallelVector::~ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2a254fcaade5cc8050f3c5eca1893619"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="lgraph_api::olap::ParallelVector::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5d56cb4cffc7089978d354304eb5a7a6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5beginEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="lgraph_api::olap::ParallelVector::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a23e2fdb99370f37cb764cac10378c721"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5beginEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector3endEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector3endEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector3endEv"></span><span id="lgraph_api::olap::ParallelVector::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5994ad65dce0457b21adb6a10c8642dc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector3endEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4BackEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="lgraph_api::olap::ParallelVector::Back"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9fadc3b5d96a350533f1221345259aab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Back</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4BackEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="lgraph_api::olap::ParallelVector::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab2c9a1b384ad445ddc5da54c669e3136"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4DataEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="lgraph_api::olap::ParallelVector::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="lgraph_api::olap::ParallelVector::Capacity"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2ee0a564b6468179fd94541c4bbf85d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Capacity</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="lgraph_api::olap::ParallelVector::Destroyed"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a907f5acbcd44ca4faa2f02fde7bd2df1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroyed</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="lgraph_api::olap::ParallelVector::Resize__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ad9cf0e91780366986c2f047bd796cdd5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>size</strong> – Value of new size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="lgraph_api::olap::ParallelVector::Resize__s.TCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a4a62b4cde89680b486c2560241cd594a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T" title="Permalink to this definition"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size and initialize the new element with elem. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>size</strong> – Value of new size. </p></li>
+<li><p><strong>elem</strong> – Initial value of new-added element. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="lgraph_api::olap::ParallelVector::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Clear all data and change size to 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ReAlloc__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a1a61eab0948012f137795032a19d4664"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReAlloc</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Destroy elder data and allocate with new capacity. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>capacity</strong> – New capacity value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="lgraph_api::olap::ParallelVector::Fill__T"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a016e89b3314c7d5d0b82b762bad05a28"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T" title="Permalink to this definition"></a><br></dt>
+<dd><p>Assign the vector’s elements with a common value. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>elem</strong> – The common value. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>     <span class="n">This</span> <span class="n">action</span> <span class="ow">is</span> <span class="n">performed</span> <span class="ow">in</span> <span class="n">parallel</span><span class="p">,</span> <span class="n">so</span> <span class="n">you</span> <span class="n">should</span> <span class="ow">not</span> <span class="n">call</span>
+     <span class="n">it</span> <span class="n">inside</span> <span class="n">another</span> <span class="n">parallel</span> <span class="n">region</span> <span class="p">(</span><span class="n">via</span> <span class="n">Worker</span><span class="p">::</span><span class="n">Delegate</span><span class="p">)</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TCR.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a43b8a4f1da7a245932babf7b42aa69db"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append an element to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>elem</strong> – The element. </p></li>
+<li><p><strong>atomic</strong> – (Optional) Whether atomic instructions should be used or not. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TP.s.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a26d7da32681aab4177e5404de5216525"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">count</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append an array of elements to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>buf</strong> – <strong>[inout]</strong> The array pointer. </p></li>
+<li><p><strong>count</strong> – The array length. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="lgraph_api::olap::ParallelVector::Append__ParallelVector:T:R.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9c6d119f42bbb02b422f2abdf5a39a26"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb" title="Permalink to this definition"></a><br></dt>
+<dd><p>Append another vector of elements to this. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>other</strong> – <strong>[inout]</strong> The other vector. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::Swap__ParallelVector:T:R"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1acd7f1912f9dbf8e003bd6e72e4e9efd2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Swap the current vector with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other vector to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="lgraph_api::olap::ParallelVector::Copy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a6ea526f22af350302e37123f3c37e4ff"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Copy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Copy the current vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A new vector with the same copied content. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="lgraph_api::olap::ParallelVector::destroyed___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a62dfd137075e11ff18b5516f41bd50c2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">destroyed_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="lgraph_api::olap::ParallelVector::capacity___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa3099a4c2b0b3ab5ba4188b4a8f59b26"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">capacity_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5data_E"></span><span id="lgraph_api::olap::ParallelVector::data___TP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa5a936fbbc363fa1913fdaadc70d872a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5data_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5size_E"></span><span id="lgraph_api::olap::ParallelVector::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5size_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadStateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadStateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadStateE"></span><span id="lgraph_api::olap::ThreadState"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ThreadState</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadStateE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState4currE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState4currE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState4currE"></span><span id="lgraph_api::olap::ThreadState::curr__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a8eea8ae4d204a609211b5cdf1e0aa19a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState4currE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState3endE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState3endE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState3endE"></span><span id="lgraph_api::olap::ThreadState::end__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1aca05b1afbbe1c83cf087b49df03c441a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState3endE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState5stateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState5stateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState5stateE"></span><span id="lgraph_api::olap::ThreadState::state__i"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a89f234133d3efe315836311cbf21c64b"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">state</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState5stateE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardE">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardE"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardE"></span><span id="lgraph_api::olap::VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> automatically acquires the lock on construction and releases the lock on destruction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__bVP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aca9940bbc3948c4b105cf4edf770aeac"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">volatile</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">lock</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1a89a098e56f889f8015db67136b3c8ee3"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aeb1d045c401b22855341e0084681ec13"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="lgraph_api::olap::VertexLockGuard::~VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aa7fb9013a4d1c11f4bf8c73c079d8e55"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="lgraph_api::olap::VertexLockGuard::lock___bP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1ac56529c72897ed7db313a69efe299cb3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">lock_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerE">
+<span id="_CPPv3N10lgraph_api4olap6WorkerE"></span><span id="_CPPv2N10lgraph_api4olap6WorkerE"></span><span id="lgraph_api::olap::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>All the parallel tasks should be delegated through <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> to prevent a huge number of threads being populated via OpenMP. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6WorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker6WorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker6WorkerEv"></span><span id="lgraph_api::olap::Worker::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1ac243ac161c3b8a4e9b7d8ab6cccceed7"></span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6WorkerEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerD0Ev">
+<span id="_CPPv3N10lgraph_api4olap6WorkerD0Ev"></span><span id="_CPPv2N10lgraph_api4olap6WorkerD0Ev"></span><span id="lgraph_api::olap::Worker::~Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a6c90b9d499e906079194f681b6cb90ca"></span><span class="sig-name descname"><span class="n"><span class="pre">~Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE">
+<span id="_CPPv3N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span id="_CPPv2N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a78582857fb711225979abb2702d89bad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delegate</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Send some work to the <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>work</strong> – The function describing the work. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>             <span class="n">Exceptions</span> <span class="n">can</span> <span class="n">be</span> <span class="n">thrown</span> <span class="ow">in</span> <span class="n">the</span> <span class="n">work</span> <span class="n">function</span> <span class="k">if</span> <span class="n">necessary</span><span class="o">.</span>
+             <span class="n">Note</span> <span class="n">that</span> <span class="n">Delegate</span> <span class="n">cannot</span> <span class="n">be</span> <span class="n">nested</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute">
+<span id="_CPPv3I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span id="_CPPv2I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Compute</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a7515974ca033a44c70f5b965ba736c7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DelegateCompute</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">compute</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="lgraph_api::olap::Worker::SharedWorker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a21214620b0c58b939404d191d78e1415"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">SharedWorker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the global (shared) worker. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Returns</dt>
+<dd class="field-odd"><p>A shared pointer to the global <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9stopping_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9stopping_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9stopping_E"></span><span id="lgraph_api::olap::Worker::stopping___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a72446f290a943941576f6803ea96a0da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">stopping_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9stopping_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9has_work_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9has_work_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9has_work_E"></span><span id="lgraph_api::olap::Worker::has_work___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a3b09e0253be21a64efc11b5ad9887b10"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">has_work_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9has_work_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6mutex_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker6mutex_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker6mutex_E"></span><span id="lgraph_api::olap::Worker::mutex___std::mutex"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a281b5ec791338d4378e22ef44a51b4a1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">mutex</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">mutex_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6mutex_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker3cv_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker3cv_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker3cv_E"></span><span id="lgraph_api::olap::Worker::cv___std::condition_variable"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a5eb1f373ea25b73577b6e0205ad7b399"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">condition_variable</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cv_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker3cv_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker5task_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker5task_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker5task_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a173918333017695d1cb7984078721f78"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">packaged_task</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">task_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker5task_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker7worker_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker7worker_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker7worker_E"></span><span id="lgraph_api::olap::Worker::worker___std::thread"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a2d17662c59ba51130a35fdaa8567db74"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">thread</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">worker_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker7worker_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-on-db">
+<h2>olap_on_db<a class="headerlink" href="#olap-on-db" title="Permalink to this headline"></a></h2>
+<p>TuGraph OLAP interface. To implement a plugin that perform graph analytics on TuGraph, user can load a Snapshot from the database, and then use the Gather-Apply-Scatter style interface to do the computation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="lgraph_api::olap::SNAPSHOT_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a24ed9da8cd6c1132a468b64f9ed37f7a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The available options for (graph construction) flags. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="lgraph_api::olap::SNAPSHOT_UNDIRECTED__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1ac92e5bd74f22a5d50d401c61577c2502"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_UNDIRECTED</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="lgraph_api::olap::SNAPSHOT_IDMAPPING__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1af550d7266e9792ecd7c8d4cec91b8ceb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IDMAPPING</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">2</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a7942e3aa179aef017291e80f6cab14ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">3</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>The following options are not implemented yet. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a5553d31915ca2c1c043688e19a45ac10"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">4</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a1a3bf7fdc6b1674e1dc931f68c1b783e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">5</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a44ce105282f3a854a595cc978fa04693"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">6</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE">
+<span id="_CPPv3I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span id="_CPPv2I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a6f30998cf8b6f4da8c4d3cbb308b08ca"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="lgraph_api::olap::edge_convert_default::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_default</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">1;return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Default Parser for weighted edges for graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE">
+<span id="_CPPv3I0EN10lgraph_api4olap19edge_convert_weightE"></span><span id="_CPPv2I0EN10lgraph_api4olap19edge_convert_weightE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aa93176409e55c8dbf3df1979c99bb07d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="lgraph_api::olap::edge_convert_weight::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_weight</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">eit.GetField("weight").real();return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Example parser for extract from edge property “weight”. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDBE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDBE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDBE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olapE" title="lgraph_api::olap"><span class="n"><span class="pre">olap</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase"><span class="n"><span class="pre">OlapBase</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_on_db.h&gt;</em></div>
+<p>Snapshot is a derived class of Graph. Snapshot instances represent static (sub)graphs exported from LightningGraph. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses. </p>
+<p>EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">Template Parameters</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a49ed16af93c6bfbaff9856aefb2d8f04"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1/V2 Procedures. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a31bb964e9baa8452632dfe0d97f253fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1 Procedures. </p>
+<p>
+Note: read-write transactions are not recommended here for safety, e.g. some vertices might be removed causing inconsistencies of the analysis, and vertex data extraction may not work for deleted vertices). The constructed graph should contain all vertices whose vertex_filter calls return true and all edges <em>sourced from</em> these vertices whose out_edge_filter calls return true. If SNAPSHOT_UNDIRECTED is specified, the graph will be made symmetric (i.e. reversed edges are also added to the graph). </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges.</p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__GraphDBR.TransactionR.std::vector:std::vector:ss::.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a38771d37dea34f28513dd5305385dfa4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_list</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a428105b32ebebb9bd1ad5df715e8b3d5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Generate a graph without LightningGraph. For V2 Procedures. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Throws</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">Parameters</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a384cbed54b1bcd0610dfc176b0b58563"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a80b05d175e882c00a314f5ba518a55d4"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a79cc725b6c20ffac60c4c980e472d7e1"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::assign-operator__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaa45fb6b0cfa2ce83892f4667684d92a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="lgraph_api::olap::OlapOnDB::~OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c2abb48c34772b4ffd882210300572b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a14ebd243f449d5ef5dc6ffc56d0855c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Extract a vertex array from the graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>extract</strong> – The function describing the extraction logic.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> containing each vertex’s extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab5f0b3fee89201df1f5fa5bd06cceb4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToFile</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToFile::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output_file</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Write vertex data to a file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – The parallel vector storing the vertex data. </p></li>
+<li><p><strong>output_file</strong> – The path to the output file. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c18bf21eacc3c981bb129d99ae63f86"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToGraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToGraphDB::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="Permalink to this definition"></a><br></dt>
+<dd><p>Write vertex data to the graph database. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – <strong>[inout]</strong> The parallel vector storing the vertex data. </p></li>
+<li><p><strong>vertex_field</strong> – <strong>[in]</strong> The name of the vertex field. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OriginalVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a514e2403802681b3a6ab6e3e1521f3ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OriginalVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the original vertex id (in LightningGraph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the graph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The original id of the specified vertex in the graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::MappedVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a6ed1fe8e61e5879a68744a79c522ee0a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MappedVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">original_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd><p>Get the mapped vertex id (in the graph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Parameters</dt>
+<dd class="field-odd"><p><strong>original_vid</strong> – The original vertex id (in LightningGraph) to access.</p>
+</dd>
+<dt class="field-even">Returns</dt>
+<dd class="field-even"><p>The mapped id of the specified vertex (in LightningGraph). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="lgraph_api::olap::OlapOnDB::GetTransaction"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a05e20809b4047a9dc2d54f28b3f62528"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetTransaction</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::Init__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a4457f7e41bdf9a2d7fe100d1bdc32ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Init</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">num_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapOnDB::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab7d7ef02dcbc497f1bc8e738188613c8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv" title="Permalink to this definition"></a><br></dt>
+<dd><p>This decision formula is used to determine whether to stop the algorithm running in <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="lgraph_api::olap::OlapOnDB::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a9af72b216eb95e320f0f261d9497c5c1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithVid"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a85b384fc73a534221f880e966c2ca608"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithDegree"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ac2d9a6a8d98a79402d9505ac3270373f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithDegree</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB3db_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="lgraph_api::olap::OlapOnDB::db___GraphDBP"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaaee9f9643b55632219320d15882f548"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB3db_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="lgraph_api::olap::OlapOnDB::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="lgraph_api::olap::OlapOnDB::original_vids___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a82054e1776bcb3b09cb66389c1eeb781"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">original_vids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="lgraph_api::olap::OlapOnDB::vid_map___cuckoohash_map:s.s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a2871a76b39823e6482e093f9b0cacb78"></span><span class="n"><span class="pre">cuckoohash_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_map_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="lgraph_api::olap::OlapOnDB::flags___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a5bb1ec258a7281a0702e64c19bcda816"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vertex_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa4b2136dfe22d40f01778f7b04aa9993"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edge_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-profile">
+<h2>olap_profile<a class="headerlink" href="#olap-profile" title="Permalink to this headline"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsageE"></span><span id="lgraph_api::olap::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsageE" title="Permalink to this definition"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_profile.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="lgraph_api::olap::MemUsage::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac231833949c8ed135c0e8e59af8d7e6c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="lgraph_api::olap::MemUsage::getMaxMemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a4f02170838631103c72261595c35916b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">getMaxMemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5resetEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5resetEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5resetEv"></span><span id="lgraph_api::olap::MemUsage::reset"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ad20897c5c8bd47f5d4005989bead0e55"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5resetEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="lgraph_api::olap::MemUsage::startMemRecord__unsigned-i"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac3db2b796bdfa6e43a1302c5a1072ba3"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">startMemRecord</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">interval</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1000</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5printEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5printEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5printEv"></span><span id="lgraph_api::olap::MemUsage::print"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a388f572c62279f839ee138a9afbdeeb5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">print</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5printEv" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="lgraph_api::olap::MemUsage::parseMemLine__cP"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a07befe13a6e76ab6c84719817c5fadbf"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parseMemLine</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">line</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="lgraph_api::olap::MemUsage::maxMemUsage__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a274bce27e5ba57cce5606ba61eb28489"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">maxMemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE" title="Permalink to this definition"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..8fde487168
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++ Stored Procedures
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.md
new file mode 100644
index 0000000000..51b48434d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.md
@@ -0,0 +1,1547 @@
+
+
+             
+  <section id="python-stored-procedure-api">
+
+<p>Version: 4.3.2</p>
+<p>Copyright (C) 2018-2022 Ant Group.</p>
+<div class="toctree-wrapper compound">
+</div>
+<section id="introduction">
+<h2>Introduction<a class="headerlink" href="#introduction" title="Permalink to this headline"></a></h2>
+<p>Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.</p>
+<p>This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.</p>
+</section>
+<section id="module-liblgraph_python_api">
+<span id="api"></span><h2>API<a class="headerlink" href="#module-liblgraph_python_api" title="Permalink to this headline"></a></h2>
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">AccessLevel</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel" title="Permalink to this definition"></a></dt>
+<dd><p>Access that a user has on a graph.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NONE</p>
+<p>READ</p>
+<p>WRITE</p>
+<p>FULL</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">EdgeUid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid" title="Permalink to this definition"></a></dt>
+<dd><p>Edge identifier.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.dst">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">dst</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.dst" title="Permalink to this definition"></a></dt>
+<dd><p>Destination vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.eid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">eid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.eid" title="Permalink to this definition"></a></dt>
+<dd><p>ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.lid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">lid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.lid" title="Permalink to this definition"></a></dt>
+<dd><p>Label ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.src">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">src</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.src" title="Permalink to this definition"></a></dt>
+<dd><p>Source vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.tid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">tid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.tid" title="Permalink to this definition"></a></dt>
+<dd><p>Temporal ID of the edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldData</span></span><a class="headerlink" href="#liblgraph_python_api.FieldData" title="Permalink to this definition"></a></dt>
+<dd><p>FieldData is the data type of field value.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBlob">
+<span class="sig-name descname"><span class="pre">AsBlob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bytes</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBlob" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBool">
+<span class="sig-name descname"><span class="pre">AsBool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBool" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as bool, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDate">
+<span class="sig-name descname"><span class="pre">AsDate</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDate" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as date, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDateTime">
+<span class="sig-name descname"><span class="pre">AsDateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDateTime" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as datetime, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDouble">
+<span class="sig-name descname"><span class="pre">AsDouble</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDouble" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsFloat">
+<span class="sig-name descname"><span class="pre">AsFloat</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsFloat" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as float, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt16">
+<span class="sig-name descname"><span class="pre">AsInt16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt16" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int16, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt32">
+<span class="sig-name descname"><span class="pre">AsInt32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt32" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int32, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt64">
+<span class="sig-name descname"><span class="pre">AsInt64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt64" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int64, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt8">
+<span class="sig-name descname"><span class="pre">AsInt8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt8" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as int8, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsString">
+<span class="sig-name descname"><span class="pre">AsString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsString" title="Permalink to this definition"></a></dt>
+<dd><p>Get value as string, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Blob">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Blob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bytes</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Blob" title="Permalink to this definition"></a></dt>
+<dd><p>Make a BLOB value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Bool">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Bool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Bool" title="Permalink to this definition"></a></dt>
+<dd><p>Make a BOOL value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Date">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Date</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.Date" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>Date(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+<ol class="arabic simple" start="2">
+<li><p>Date(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.DateTime">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">DateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.DateTime" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>DateTime(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+<ol class="arabic simple" start="2">
+<li><p>DateTime(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Double">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Double</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Double" title="Permalink to this definition"></a></dt>
+<dd><p>Make a DOUBLE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Float">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Float</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Float" title="Permalink to this definition"></a></dt>
+<dd><p>Make a FLOAT value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int16">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int16" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT16 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int32">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int32" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT32 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int64">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int64" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT64 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int8">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int8" title="Permalink to this definition"></a></dt>
+<dd><p>Make a INT8 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.String">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">String</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.String" title="Permalink to this definition"></a></dt>
+<dd><p>Make a STRING value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.ToPython">
+<span class="sig-name descname"><span class="pre">ToPython</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.ToPython" title="Permalink to this definition"></a></dt>
+<dd><p>Convert to corresponding Python type.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.get">
+<span class="sig-name descname"><span class="pre">get</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.get" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.isNull">
+<span class="sig-name descname"><span class="pre">isNull</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.isNull" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.set">
+<span class="sig-name descname"><span class="pre">set</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.set" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldSpec</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec" title="Permalink to this definition"></a></dt>
+<dd><p>Field specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.name" title="Permalink to this definition"></a></dt>
+<dd><p>Name of this field.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.nullable">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">nullable</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.nullable" title="Permalink to this definition"></a></dt>
+<dd><p>Whether this field can be null.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.type">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">type</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.type" title="Permalink to this definition"></a></dt>
+<dd><p>Type of this field, INT8, INT16, …, FLOAT, DOUBLE, STRING.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldType</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType" title="Permalink to this definition"></a></dt>
+<dd><p>Data type of FieldData.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NUL</p>
+<p>BOOL</p>
+<p>INT8</p>
+<p>INT16</p>
+<p>INT32</p>
+<p>INT64</p>
+<p>FLOAT</p>
+<p>DOUBLE</p>
+<p>DATE</p>
+<p>DATETIME</p>
+<p>STRING</p>
+<p>BLOB</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Galaxy</span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy" title="Permalink to this definition"></a></dt>
+<dd><p>A galaxy is a TuGraph instance that holds multiple GraphDBs.
+A galaxy is stored in a directory and manages users and GraphDBs. Each (user, GraphDB) pair can have different access levels. You can use db=Galaxy.OpenGraph(graph) to open a graph. Since garbage collection in Python is automatic, you need to close the galaxy with Galaxy.Close() when you are done with it.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.Close" title="Permalink to this definition"></a></dt>
+<dd><p>Closes this galaxy</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateGraph">
+<span class="sig-name descname"><span class="pre">CreateGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">4398046511104</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Creates a graph.
+name: the name of the graph
+description: description of the graph
+max_size: maximum size of the graph, default 1TB</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateRole">
+<span class="sig-name descname"><span class="pre">CreateRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateRole" title="Permalink to this definition"></a></dt>
+<dd><p>Create a role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateUser">
+<span class="sig-name descname"><span class="pre">CreateUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateUser" title="Permalink to this definition"></a></dt>
+<dd><p>Creates a new user account.
+name: name of the user
+password: password for the user
+desc: description of this user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteGraph">
+<span class="sig-name descname"><span class="pre">DeleteGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes a graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteRole">
+<span class="sig-name descname"><span class="pre">DeleteRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteRole" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteUser">
+<span class="sig-name descname"><span class="pre">DeleteUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteUser" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes a user account</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DisableUser">
+<span class="sig-name descname"><span class="pre">DisableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DisableUser" title="Permalink to this definition"></a></dt>
+<dd><p>Disables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.EnableUser">
+<span class="sig-name descname"><span class="pre">EnableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.EnableUser" title="Permalink to this definition"></a></dt>
+<dd><p>Enables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.GetUserInfo">
+<span class="sig-name descname"><span class="pre">GetUserInfo</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::UserInfo</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.GetUserInfo" title="Permalink to this definition"></a></dt>
+<dd><p>Get information of the specified user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListGraphs">
+<span class="sig-name descname"><span class="pre">ListGraphs</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListGraphs" title="Permalink to this definition"></a></dt>
+<dd><p>Lists graphs and returns a dictionary of {name:(desc, max_size)}</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListUsers">
+<span class="sig-name descname"><span class="pre">ListUsers</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict[str,</span> <span class="pre">lgraph_api::UserInfo]</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListUsers" title="Permalink to this definition"></a></dt>
+<dd><p>Lists all users and whether they are admin</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ModGraph">
+<span class="sig-name descname"><span class="pre">ModGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ModGraph" title="Permalink to this definition"></a></dt>
+<dd><p>mod_size: whether to modify max graph size
+new_max_size: new maximum size of the graph, in bytes</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.OpenGraph">
+<span class="sig-name descname"><span class="pre">OpenGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">read_only</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::GraphDB</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.OpenGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Opens a graph and returns a GraphDB instance.
+graph: name of the graph
+read_only: whether to open the graph in read-only mode</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetCurrentUser">
+<span class="sig-name descname"><span class="pre">SetCurrentUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetCurrentUser" title="Permalink to this definition"></a></dt>
+<dd><p>Validate user password and set current user.
+user: user name
+password: password of the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRights">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRights</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRights" title="Permalink to this definition"></a></dt>
+<dd><p>Set access rights for the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRightsIncremental</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental" title="Permalink to this definition"></a></dt>
+<dd><p>Set access rights for the specified role, only affects the specified graphs</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleDesc">
+<span class="sig-name descname"><span class="pre">SetRoleDesc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleDesc" title="Permalink to this definition"></a></dt>
+<dd><p>Set description of the specified role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUser">
+<span class="sig-name descname"><span class="pre">SetUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUser" title="Permalink to this definition"></a></dt>
+<dd><p>Validate the given user and set current user given in the user.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserGraphAccess">
+<span class="sig-name descname"><span class="pre">SetUserGraphAccess</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">access</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserGraphAccess" title="Permalink to this definition"></a></dt>
+<dd><p>Set the access level of the specified user on the graph.
+user: name of the user
+graph: name of the graph
+access: access level of the user on that graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserPass">
+<span class="sig-name descname"><span class="pre">SetUserPass</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self:</span> <span class="pre">liblgraph_python_api.Galaxy</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">name:</span> <span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">old_password:</span> <span class="pre">str</span> <span class="pre">=</span> <span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_password:</span> <span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserPass" title="Permalink to this definition"></a></dt>
+<dd><p>Modifies user password.
+name: name of the user
+old_password: current password, not needed when modifying another user
+new_password: new password for the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserRoles">
+<span class="sig-name descname"><span class="pre">SetUserRoles</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">roles</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserRoles" title="Permalink to this definition"></a></dt>
+<dd><p>Set the roles for the specified user.
+name: name of the user
+roles: list of roles for this user</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">GraphDB</span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB" title="Permalink to this definition"></a></dt>
+<dd><p>The graph database class.
+A GraphDB stores the data about the graph, including labels, vertices, edges and indexes.Since Garbage Collection in Python is automatic, you need to close the DB with GraphDB.Close() at the end of its lifetime.Make sure you have either committed or aborted every transaction that is using the DB before you close the DB.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddEdgeLabel">
+<span class="sig-name descname"><span class="pre">AddEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">temporal_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">[]</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddEdgeLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Adds an edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexIndex">
+<span class="sig-name descname"><span class="pre">AddVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">is_unique</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexIndex" title="Permalink to this definition"></a></dt>
+<dd><p>Adds an index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexLabel">
+<span class="sig-name descname"><span class="pre">AddVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">primary_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Add a vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields" title="Permalink to this definition"></a></dt>
+<dd><p>Add fields to an edge label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields" title="Permalink to this definition"></a></dt>
+<dd><p>Delete fields from an edge label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModFields" title="Permalink to this definition"></a></dt>
+<dd><p>Modify fields in an edge label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModifyConstraints</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints" title="Permalink to this definition"></a></dt>
+<dd><p>Modify edge constraints</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelAddFields" title="Permalink to this definition"></a></dt>
+<dd><p>Add fields to a vertex label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelDelFields" title="Permalink to this definition"></a></dt>
+<dd><p>Delete fields from a vertex label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelModFields" title="Permalink to this definition"></a></dt>
+<dd><p>Modify fields in a vertex label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Close" title="Permalink to this definition"></a></dt>
+<dd><p>Closes the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateReadTxn">
+<span class="sig-name descname"><span class="pre">CreateReadTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateReadTxn" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateWriteTxn">
+<span class="sig-name descname"><span class="pre">CreateWriteTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">optimistic</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateWriteTxn" title="Permalink to this definition"></a></dt>
+<dd><p>Create a write transaction.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteEdgeLabel">
+<span class="sig-name descname"><span class="pre">DeleteEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteEdgeLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes an edge label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexIndex">
+<span class="sig-name descname"><span class="pre">DeleteVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexIndex" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes the specified index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexLabel">
+<span class="sig-name descname"><span class="pre">DeleteVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes a vertex label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllData">
+<span class="sig-name descname"><span class="pre">DropAllData</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllData" title="Permalink to this definition"></a></dt>
+<dd><p>Drop all the data in this DB.
+All vertices, edges, labels and indexes will be dropped.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllVertex">
+<span class="sig-name descname"><span class="pre">DropAllVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllVertex" title="Permalink to this definition"></a></dt>
+<dd><p>Drops all the vertices and edges in this DB.
+Labels and indexes (though index contents will be cleared due to deletion of vertices) will be preserved.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.EstimateNumVertices">
+<span class="sig-name descname"><span class="pre">EstimateNumVertices</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.EstimateNumVertices" title="Permalink to this definition"></a></dt>
+<dd><p>Gets an estimation of the number of vertices.
+This can be inaccurate if there were vertex removals.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Flush">
+<span class="sig-name descname"><span class="pre">Flush</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Flush" title="Permalink to this definition"></a></dt>
+<dd><p>Flushes written data into disk.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetDescription">
+<span class="sig-name descname"><span class="pre">GetDescription</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetDescription" title="Permalink to this definition"></a></dt>
+<dd><p>Gets description of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetMaxSize">
+<span class="sig-name descname"><span class="pre">GetMaxSize</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetMaxSize" title="Permalink to this definition"></a></dt>
+<dd><p>Gets maximum size of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.IsVertexIndexed" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">InEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>InEdgeIterator can be used to iterate through all the incoming edges of the destination vertex.
+Incoming edges are sorted in (dst, label, src, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Delete" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetAllFields" title="Permalink to this definition"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetDst" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetEdgeId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetField" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetSrc" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetUid" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Goto" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the in edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next in edge to current destination vertex.
+If there is no more in edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetField" title="Permalink to this definition"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.ToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">IndexSpec</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec" title="Permalink to this definition"></a></dt>
+<dd><p>Index specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.field">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">field</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.field" title="Permalink to this definition"></a></dt>
+<dd><p>Name of the field</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.label">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">label</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.label" title="Permalink to this definition"></a></dt>
+<dd><p>Name of the label.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.unique">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">unique</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.unique" title="Permalink to this definition"></a></dt>
+<dd><p>Whether the indexed values are unique.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">LGraphType</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType" title="Permalink to this definition"></a></dt>
+<dd><p>Members:</p>
+<p>NUL : NUL</p>
+<p>INTEGER : INTEGER</p>
+<p>FLOAT : FLOAT</p>
+<p>DOUBLE : DOUBLE</p>
+<p>BOOLEAN : BOOLEAN</p>
+<p>STRING : STRING</p>
+<p>NODE : NODE</p>
+<p>RELATIONSHIP : RELATIONSHIP</p>
+<p>PATH : PATH</p>
+<p>LIST : LIST</p>
+<p>MAP : MAP</p>
+<p>ANY : ANY</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">OutEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>OutEdgeIterator can be used to iterate through all the out-going edges of the source vertex.
+Out-going edges are sorted in (src, lid, dst, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Delete" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetAllFields" title="Permalink to this definition"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetDst" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetEdgeId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetField" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetSrc" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetUid" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Goto" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the out edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next out edge from current source vertex.
+If there is no more out edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetField" title="Permalink to this definition"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_values are FieldData containing the field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the field values as specified in value_dict.
+value_dict specifies the field_name:value dictionary.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.ToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">PluginErrorCode</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode" title="Permalink to this definition"></a></dt>
+<dd><p>ErrorCode of plugin.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>SUCCESS</p>
+<p>INPUT_ERR</p>
+<p>INTERNAL_ERR</p>
+<p>SUCCESS_WITH_SIGNATURE</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode.name" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Transaction</span></span><a class="headerlink" href="#liblgraph_python_api.Transaction" title="Permalink to this definition"></a></dt>
+<dd><p>In embedded mode, all the operations are performed in transactions and thus enjoys the power of
+transactions such as atomicity and isolation. You can commit or abort a transaction at any time
+without worrying about the side effects it has already made.
+Transactions can be either committed or aborted, after which it is destructed and becomes invalid.
+Make sure you have destructed every transaction before you closes the corresponding GraphDB.
+Transactions also track the created iterators and releases all the iterators during destruction.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Abort">
+<span class="sig-name descname"><span class="pre">Abort</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Abort" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddEdge">
+<span class="sig-name descname"><span class="pre">AddEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddEdge" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values in string format.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label id, field ids, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+Returns the id of the newly added edge.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddVertex">
+<span class="sig-name descname"><span class="pre">AddVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddVertex" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values in string format.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label ids, field ids, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_ids are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, value_dict: dict) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name and set the value as specified in value_dict.
+Returns the id of the newly added vertex.
+Fields that are not specified in the dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Commit">
+<span class="sig-name descname"><span class="pre">Commit</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Commit" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.DumpGraph">
+<span class="sig-name descname"><span class="pre">DumpGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.DumpGraph" title="Permalink to this definition"></a></dt>
+<dd><p>Prints the string representation of the WHOLE graph to stdout.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeFieldId">
+<span class="sig-name descname"><span class="pre">GetEdgeFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeFieldId" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_name: str) -&gt; int</p></li>
+</ol>
+<p>Gets the edge field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_names: List[str]) -&gt; List[int]</p></li>
+</ol>
+<p>Gets the edge field ids associated with this (label_id, field_names).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeLabelId">
+<span class="sig-name descname"><span class="pre">GetEdgeLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the edge label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeSchema">
+<span class="sig-name descname"><span class="pre">GetEdgeSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeSchema" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the schema specification of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetInEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator pointing to the in-edge of vertex dst with EdgeUid==euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumEdgeLabels">
+<span class="sig-name descname"><span class="pre">GetNumEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumEdgeLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumVertexLabels">
+<span class="sig-name descname"><span class="pre">GetNumVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumVertexLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetOutEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator pointing to the edge identified by euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexByUniqueIndex">
+<span class="sig-name descname"><span class="pre">GetVertexByUniqueIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexByUniqueIndex" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value_string: str) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value_string specifies the string representation of the indexed field value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value: object) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value specifies the indexed field value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, field_value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+field_value is a FieldData specifying the indexed field value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldId">
+<span class="sig-name descname"><span class="pre">GetVertexFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the vertex field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldIds">
+<span class="sig-name descname"><span class="pre">GetVertexFieldIds</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_names</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldIds" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the vertex field ids associated with this (label_id, [field_names]).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIndexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIndexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIndexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>Gets an VertexIndexIterator pointing to the indexed item which has index value [key_start, key_end].
+key_start=key_end=v returns an iterator pointing to all vertexes that has field value v.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+value is a FieldData containing the indexed value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start_string: str, key_end_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start_string is the string representation of the minimum indexed value.
+key_end_string is the string representation of the maximum indexed value.</p>
+<ol class="arabic simple" start="4">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="5">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value_string is the string representation of the indexed value.</p>
+<ol class="arabic simple" start="6">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value is a FieldData containing the indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the first vertex in the graph.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the vertex specified by vid.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int, nearest: bool) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets VertexIterator with vertex id.
+If nearest==true, go to the first vertex with id &gt;= vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexLabelId">
+<span class="sig-name descname"><span class="pre">GetVertexLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the vertex label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexSchema">
+<span class="sig-name descname"><span class="pre">GetVertexSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexSchema" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the schema specification of the vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsReadOnly">
+<span class="sig-name descname"><span class="pre">IsReadOnly</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsReadOnly" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsValid" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsVertexIndexed" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListEdgeLabels">
+<span class="sig-name descname"><span class="pre">ListEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListEdgeLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexIndexes">
+<span class="sig-name descname"><span class="pre">ListVertexIndexes</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.IndexSpec" title="liblgraph_python_api.IndexSpec"><span class="pre">liblgraph_python_api.IndexSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexIndexes" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the list of all the vertex indexes in the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexLabels">
+<span class="sig-name descname"><span class="pre">ListVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexLabels" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.UpsertEdge">
+<span class="sig-name descname"><span class="pre">UpsertEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.UpsertEdge" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values in string format.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label id, field ids, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.VertexToString">
+<span class="sig-name descname"><span class="pre">VertexToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.VertexToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of the vertex specified by vid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIndexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>VertexIndexIterator can be used to retrieve the id of indexed vertices.
+Vertex ids are sorted in ascending order of (index_value, vertex_id).</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetIndexValue">
+<span class="sig-name descname"><span class="pre">GetIndexValue</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetIndexValue" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the indexed value.
+Since vertex ids are sorted in (index_value, vertex_id) order, calling Next() may change the current indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetVid">
+<span class="sig-name descname"><span class="pre">GetVid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetVid" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the id of the vertex currently pointed to.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd><p>Tells whether this iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next indexed vid.
+If there is no more vertex within the specified key range, the iterator becomes invalid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator" title="Permalink to this definition"></a></dt>
+<dd><p>VertexIterator can be used to retrieve info of a vertex, or to scan through multiple vertices.
+Vertexes are sorted in ascending order of the their ids.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Delete" title="Permalink to this definition"></a></dt>
+<dd><p>Deletes current vertex.
+The iterator will point to the next vertex if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetAllFields" title="Permalink to this definition"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetField" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetId">
+<span class="sig-name descname"><span class="pre">GetId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the integer id of this vertex.
+GraphDB assigns an integer id for each vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetInEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the first in-coming edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the in-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabel" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the label name of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabelId" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the label id of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumInEdges">
+<span class="sig-name descname"><span class="pre">GetNumInEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumInEdges" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the number of in-coming edges of this vertex.
+n_limit specifies the maximum number of edges to scan.
+Returns a tuple containing the number of in-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumOutEdges">
+<span class="sig-name descname"><span class="pre">GetNumOutEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumOutEdges" title="Permalink to this definition"></a></dt>
+<dd><p>Gets the number of out edges of this vertex.
+n_limit specifies the maximum number of vids to scan.Returns a tuple containing the number of out-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetOutEdgeIterator" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the first out-going edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the out-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Goto" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the vertex specified by vid.
+If nearest==true, go to the nearest vertex with id&gt;=vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.IsValid" title="Permalink to this definition"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListDstVids">
+<span class="sig-name descname"><span class="pre">ListDstVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListDstVids" title="Permalink to this definition"></a></dt>
+<dd><p>Lists all destination vids of the out edges.
+n_limit specifies the maximum number of vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListSrcVids">
+<span class="sig-name descname"><span class="pre">ListSrcVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListSrcVids" title="Permalink to this definition"></a></dt>
+<dd><p>Lists all source vids of the in edges.
+n_limit specifies the maximum number of src vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Next" title="Permalink to this definition"></a></dt>
+<dd><p>Goes to the next vertex with id&gt;{current_vid}.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetField" title="Permalink to this definition"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetFields" title="Permalink to this definition"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ToString" title="Permalink to this definition"></a></dt>
+<dd><p>Returns the string representation of current vertex, including properties and edges.</p>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..3b49f13698
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,29 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python stored procedure API
+====================================
+Version: 4.3.2
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..d50c8ecdcf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,17 @@
+# Rust Stored Procedures
+
+## 1. Introduction
+Rust stored procedures currently only support v1 version. TuGraph supports plugins in any language that can be compiled into a dynamic library. Rust, as a rising star in system programming languages, has significant advantages in terms of safety, reliability, and ergonomics compared to C++.
+
+We provide the Rust binding library for TuGraph to support calling lgrahp API in Rust. We also provide the [tugraph-plugin-util](https://crates.io/crates/tugraph-plugin-util ) utility library to help simplify the process of writing Rust plugins.
+
+## 2. How to Use
+
+Using Rust stored procedures involves three steps:
+* Compilation: Compile the Rust source code into a dynamic library (so file). We have prepared a comprehensive plugin development tutorial that covers everything from IDE plugin installation and environment setup to compilation. Please refer to the `rust-tugraph-plugin-tutorial` for detailed instructions.
+* Loading: Load the dynamic library (so file) into the server. This can be done through the REST or RPC interface, similar to the usage of C++ libraries. Please refer to the documentation for more details on the [Procedure v1 API](1.procedure.md).
+* Execution: Once the library is loaded, use it as you would with a C++ stored procedure. The process is the same and does not need further explanation.
+
+## 3. API Documentation
+
+In the Rust community, all code and documentation can be found on [`crates.io`](https://crates.io/crates/tugraph ) and [`docs.rs`](https://docs.rs/tugraph/latest/tugraph ).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..047c26541e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.3.2
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..22403ca19e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..83cc10c52e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..f8acb4076f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,214 @@
+# Bootstrap program
+
+>This document is a bootstrap program designed for TuGraph users. Before reading the detailed documents, users should read this document first to have a general understanding of TuGraph's graph computing operation process, and it will be more convenient to read the detailed documents later. The bootstrap program is a simple instance of a bfs (breadth-first search) program based on Tugraph, and we will focus on how it is used.
+
+## 1.Introduction to TuGraph-Graph Analysis Engine
+
+TuGraph's graph analysis engine is mainly used for full graph/full data analysis tasks. With the help of TuGraph's C++ / Python graph analysis engine API, users can quickly derive a complex subgraph from different data sources, and then run iterative graph algorithms such as PageRank, LPA, WCC on the subgraph, and finally make corresponding countermeasures according to the running results.
+
+In TuGraph, the process of both exporting and computing can be accelerated by in-memory parallel processing, resulting in near-real-time processing and analysis. Compared to traditional methods, this approach can avoid the overhead of data export and disk drop, and can achieve ideal performance by using a compact graph data structure.
+
+TuGraph has 6 built-in algorithms in the community version and 25 built-in algorithms in the commercial version. Users hardly need to implement the specific graph calculation process themselves. For details, please refer to algorithms.md.
+
+According to different data sources and implementations, it can be divided into Procedure, Embed and Standalone, which all inherit from OlapBase API. OlapBase API interface documentation can be found in OlAPBase-APi.md.
+
+The data source of Procedure and Embed is the db data preloaded in the graph database, which can be compiled to generate the.so file used by TuGraph-Web loading and the embed file used by the background terminal respectively. The input graph data are loaded in the form of db. The interface document can refer to olapondb-api.md.
+
+Standalone is used to compile and generate a standalone file. Different from the former, the input graph data of the file is loaded in the form of txt, binary, and ODPS files, and the interface document can refer to olapondisk-api.md.
+
+## 2.Procedure compile and run
+
+This mode is mainly used for visual loading and running on the TuGraph-web interface. The usage method is as follows:
+
+### 2.1.C++
+Run bash make_so.sh bfs in the TuGraph/procedures directory to the BFs.so file in the TuGraph/procedures directory, upload the file as a plug-in to Tugraph-web, input parameters and then execute.
+
+### 2.2.Python
+Upload the python file as a plugin to TuGraph-web, and execute it after inputting parameters.
+
+Example:
+Compile the.so algorithm file at TuGraph/procedures
+`bash make_so.sh bfs`
+
+After loading the bfs.so (or TuGraph/procedures/algo_cython/bfs.py) file as a plug-in to TuGraph-web, enter the following json parameters:
+
+```json
+{
+  "root": "10",
+  "label": "user",
+  "field": "id"
+}
+```
+
+The following result
+
+result:"{"core_cost":0.013641119003295898,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":8.821487426757813e-06,
+"prepare_cost":0.03479194641113281,
+"total_cost":0.04844188690185547}"
+
+The output ：
+
+- num_edges: the number of edges in the graph
+- num_vertices: the number of nodes in the graph
+- prepare_cost: Represents the time required for the preprocessing phase. The preprocessing phase works: loading parameters, graph data loading, index initialization.
+- core_cost: Represents the time required for the algorithm to run.
+- found_vertices: Number of vertices found.
+- output_cost: the time it takes for the algorithm result to be written back to db.。
+- total_cost: The overall running time of the algorithm is executed.
+
+make_so.sh This file is used to compile the graph algorithm files involved in TuGraph-OLAP into a.so file available for TuGraph-web.
+
+## 3.Embed compile and run
+
+This way is mainly used for TuGraph in the background program on the preloaded db graph data algorithm analysis. Its use method is as follows:
+
+To complete the embed_main.cpp file in TuGraph/procedures directory, add the data name, input parameters, data path and other information, as shown in the following example:
+
+### 3.1.C++
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path Specifies the path for saving the preloaded graph data
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // Specifies the name of the graph
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // Enter the algorithm parameters in json format
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+
+Run bash make_so.sh bfs in TuGraph/procedures to bfs_procedure in TuGraph/procedures/algo_cpp.
+`bash make_embed.sh bfs`
+
+Do this in the TuGraph/procedures folder
+`./algo_cpp/bfs_procedure`
+The result is returned.
+
+Input: {"root_id":"0", "label":"node","field":"id"}
+found_vertices = 3829
+{"core_cost":0.025603055953979492,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":9.059906005859375e-06,
+"prepare_cost":0.056738853454589844,
+"total_cost":0.0823509693145752}
+
+`Input` indicates the input parameters.The other parameters are described as above.
+
+### 3.2.Python
+
+To compile bfs.so, run `bash make_so_cython.sh bfs` in TuGraph/procedures or `python3 setup.py build_ext -i` in TuGraph/procedures/algo_cython.
+
+After obtaining bfs.so, it can be imported and used in Python, as shown in TuGraph/procedures/run_embed.py:
+
+```python
+# TuGraph/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+
+# shell
+python3 run_embed.py
+```
+The output is the same as C++
+
+
+## 4.Standalone compile and run
+
+This file is mainly used to load the graph data directly at the terminal and run the printout results. Here's how to use it:
+
+In TuGraph/build directory `make bfs_standalone` (need to include boost/sort/sort.hpp in the g++ default include path) can get bfs_standalone file, the file is generated with TuGraph/build/output/algo folder.
+
+Run: Go to the TuGraph/build directory and do`./output/algo/bfs_standalone -- type [type] -- input_dir [input_dir] --id_mapping [id_mapping] -- vertices [vertices] --root (root) - output_dir [output_dir]`
+
+Ready to run.
+
+- `[type]` : indicates the type source of the input graph file, including text file, BINARY_FILE binary file, and ODPS source.
+
+- `[input_dir]` : indicates the path of the input graph file folder, which may contain one or more input files. TuGraph will read all the files under [input_dir] when reading the input file. It is required that [input_dir] can only contain the input file and cannot contain other files. Parameters cannot be omitted.
+
+- `[id_mapping]`：When reading the side table, whether to do id mapping for the input data to make it conform to the form of algorithm operation. 1 is required for id mapping, 0 is not required. This process will take some time. The parameter can be omitted, and the default value is 0.
+
+- `[vertices]` : represents the number of vertices in the graph. 0 indicates the number of vertices that the user wants the system to automatically recognize. When is non-zero, it indicates the number of vertices that the user wants to customize. The number of user-defined vertices must be greater than the maximum vertex ID. This parameter can be omitted. The default value is 0.
+
+- `[root]` : indicates the starting vertex id for bfs. The argument cannot be omitted.
+
+- `[output_dir]` : indicates the path of the folder where the output data is saved. The output content is saved to this file, and the parameter cannot be omitted.
+
+Example
+
+### 4.1.C++
+
+Compile the standalone algorithm program at TuGraph/build
+
+```shell
+make bfs_standalone
+```
+
+Run the text source file in TuGraph/build/output
+
+```
+    ./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+Result：
+
+```
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+Result Parameter description is the same as above.
+
+If you do not know the required parameters of a new algorithm, run the`./output/algo/bfs_standalone -h` to view the parameters.
+
+### 4.2.Python
+The bfs extension compilation process of the Python language is the same as that of the embed mode. It is called through the `Standalone` interface at runtime. The example is as follows:
+
+```python
+# TuGraph/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(
+        input_dir="../test/integration/data/algo/fb_unweighted",
+        root=0)
+
+# shell
+python3 run_standalone.py
+```
+
+At this point, the process of bfs operation on the figure above by TuGraph is complete.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..af510f95c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,196 @@
+# OlapBase API
+
+> This document will introduce how to use the OlapBase API
+
+## 1.The overview
+
+This manual will introduce the configuration of the TuGraph graph computing system. Combined with the code, several important files and interfaces in TuGraph are introduced.
+
+## 2.Configuration requirements
+
+To develop and compile applications using the TuGraph graph computing system, the configuration required:
+
+- linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+
+- Compiler that supports C++ 14, requires GCC version 5.4.1 or later.
+
+## 3.Atomic operations
+
+TuGraph uses multi-threading technology for batch operations, in which case memory access conflicts may occur. In order to ensure the correctness of modification operations in parallel computing, TuGraph implements atomic operations. The code section can be found in the lgraph_atomic.cpp file under the lgraph folder.
+
+TuGraph also customizes 4 commonly used atomic operations. When we need to modify the data of vertices in multithreaded mode, we should use atomic operations to ensure the correctness of the modification operation in parallel environment. In addition to these four atomic operations, users can also use "cas" to build their own atomic operation functions.
+
+- `bool cas(T \* ptr, T oldv, T newv)` : If the value pointed to by ptr is equal to oldv, the value pointed to by ptr is assigned to newv and returns true. Otherwise, false is returned
+- `bool write_min(T \*a, T b)` : If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `bool write_max(T \*a, T b)` : If b is larger than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `void write_add(T \*a, T b)` : adds the value of b to the value pointed to by a.
+- `void write_sub(T \*a, T b)` : subtract the value of b from the value pointed to by a.
+
+## 4.Vertex Class ParallelBitset
+
+When using TuGraph for batch operations, you need to use a vertex set to represent the vertices you want to process. ParallelBitset implements a vertex collection class that represents vertices in bits and thus saves a significant amount of memory. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 4.1ParallelBitset Class
+
+- `size_t Size()`：Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size_t size)`：Initialize size and data, the length of data is (size >> 6)+1.
+- `void Clear()`：clears the collection.
+- `void Fill()`：add all vertices to the set.
+- `bool Has(size_t i)`：check if vertex i is in the set.
+- `bool Add(size_t i)`：add vertex i to the set.
+- `void Swap(ParallelBitset &other)`：exchange elements with another set of ParallelBitset.
+
+## 5.Vertex Array Class ParallelVector
+
+When using TuGraph for batch operations, you need to use an array of vertices to represent the result of processing vertices. ParallelVector implements the vertex array class. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 5.1.ParallelVector Class
+
+- `ParallelVector(size_t capacity)` Builds ParallelVector. capacity is the initial size of the vertex array
+- `T& operator[](size_t i)` : data with subscript i
+- `T \*begin()` : ParallelVector the starting pointer
+- `T \*end()` : ParallelVector the end pointer to Parallelvector. begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to access an array sequentially
+- `T&Back ()` : ParallelVector the last data
+- `T \*Data()` : represents the data in the array itself
+- `void Destroy()' : empty the ParallelVector array and delete the array
+- `size_t Size()` : indicates the number of data in ParallelVector
+- `size_t Capacity()` : indicates the capacity of ParallelVector
+- `void Resize(size_t size)` : Change ParallelVector to size, which must be greater than or equal to the size before the change
+- `void Clear()` : empty the data in ParallelVector
+- `void ReAlloc(size_t capacity)` : ParallelVector is allocated with new capacity. If data exists in the array, it is migrated to the new memory
+- `void Fill(T elem)` : Assign elem to all data on ParallelVector
+- `void Append(const T&elem, bool atomic = true)` : Add a piece of data at the end of ParallelVector
+- `void Swap(ParallelVector<t> &other)` : to exchange data with other parallelvectors</t>
+- `ParallelVector<t> Copy()` : copies the current ParallelVector data into the Copy array</t>
+
+## 6.Customize data structures
+
+### 6.1.Basic data types
+
+We customize the data structure representation of points and edges to save memory space while covering all vertices:
+
+- 'Empty' : indicates a special data type with empty content.
+
+### 6.2.Combining data structures
+
+In order to facilitate calculation, we define several data structures of point and edge data according to different calculation scenarios, which are as follows:
+
+- `EdgeUnit<edgedata>` : represents an edge of weight type EdgeData, used to parse the input file, and contains three member variables:</edgedata>
+- `size_t src` : the starting vertex of an edge
+- `size_t dst` : the end of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjUnit<edgedata>` : represents an edge of weight type EdgeData, used during batch computation, and contains two member variables:</edgedata>
+- `size_t neighbour` : indicates the neighbor vertex of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjList<edgedata>` : Adjacency list of vertices with weights of type EdgeData, often used to represent the set of incoming and outgoing edges of vertices and containing two member variables:</edgedata>
+- `AdjUnit<t> \* begin` : indicates the start pointer of the list</t>
+- `AdjUnit<t> \* end` : The end pointer of the list.</t> begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to loop through the adjacency list.
+
+## 7.Graph class OlapBase
+
+Graph class OlapBase is the main class for TuGraph to load graphs and calculate graphs. OlapBase is commonly used to represent graphs with weights of type EdgeData. See olap_base.hpp under lgraph folder for the code. This chapter covers the types and API interfaces commonly used in Graph classes. The classes used by the Procedure, Embed, and Standalone functions described above are all subclasses of this class.
+
+### 7.1.Basic Information
+
+- `size_t NumVertices()` : obtains the number of vertices
+
+- `size_t NumEdges()` : Gets the number of edges
+
+- `size_t OutDegree(size_t vid)` : indicates the outdegree of the vid of the vertex
+
+- `size_t InDegree(size_t vid)` : indicates the input degree of vertex vid
+
+### 7.2.node sets and edge sets and their related operations
+
+- `ParallelVector AllocVertexArray()` : Allocates an array of type VertexData with size as the number of vertices
+
+- `void fill_vertex_array(V \* array, V value)` : assigns values to all elements in the array
+
+- `ParallelBitset AllocVertexSubset()` : Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+
+- `AdjList OutEdges(size_t vid)'`: gets the set of all outgoing edges of vertex v
+
+- `AdjList InEdges(size_t vid)` : Obtains the set of all incoming edges of vertex v
+
+- `void Transpose()` : transpose of a directed graph
+
+- `LoadFromArray(char \* edge_array, VertexId input_vertices, EdgeId input_edges, EdgeDirectionPolicy (edge_direction_policy) `: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+`edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+`input_vertices`: specifies the number of vertices read into the graph by the array.
+
+`input_edges` : specifies the number of edges that the array reads into the image.
+
+`edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+### 7.3.Locking mechanism
+
+TuGraph implements a pair of locks to control the program's access to vertex data. Respectively is:
+
+- `void AcquireVertexLock(size_t vid)` : locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(size_t vid)` : unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+- `VertexLockGuard GuardVertexLock(size_t vid)` : When the vid operation is performed, the vertex vid is locked, and the lock is automatically released upon exiting the scope
+
+### 7.4.Batch Processing Operations
+
+TuGraph provides two batch operations to do a point-centered batch process in parallel. Respectively is:
+
+```c++
+/*
+    Function Name:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    The work function executes the work function on nodes whose numbers are between lower and upper in the Graph. The fourth parameter indicates the accumulated base, which defaults to 0.The fifth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+For details, please refer to include/lgraph/olap_base.h
+
+    Example: Count the number of vertices in the parent array that have outgoing edges
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+graph is the instantiated object of graph class OlapBase
+
+```C++
+/*
+    Function Name:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    Function: Execute the work function for the node that corresponds to 1 in active_vertices. The third parameter represents the cumulative cardinality, which is 0 by default.
+
+    The fourth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+
+    For specific implementation, please refer to the specific code in /include/lgraph/olap_base
+
+
+
+    Example: Output all the out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..6015d7e1ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,303 @@
+# OlapOnDB API
+
+> This document provides detailed instructions for using the OlapOnDB API
+
+## 1.Introduction
+
+Generally speaking, users need to implement the process of subgraph extraction by themselves. Then use the rich interface in TuGraph to implement your own graph analysis algorithm.
+
+This document mainly introduces the Procedure and Embed interface design, and introduces some common interface, specific interface information see include/lgraph/olap_on_db.h file.
+
+## 2.Schema
+
+Procedure and Embed auxiliary functions are mainly included in the OlapOnDB class, and some more frequently used functions will be introduced one by one
+
+OLAP is associated with the following common data structures in TuGraph:
+
+1. DB graph analysis class `OlapOnDB`
+
+2. Vertex array `ParallelVector`
+
+3. Vertex set `ParallelBitset`
+
+4. Side data structure `AdjUnit/AdjUnit`
+
+5. Edge collection data structure `AdjList`
+
+### 2.1.Snapshot Based Storage Structure
+
+The OlapOnDB class in TuGraph provides a data "snapshot," that is, a fully usable copy of a given data set that includes a mirror image of the corresponding data at a certain point in time (the point at which the copy was started). Because OLAP operations involve only reads and not writes, OlapOnDB arranges data in a more compact manner, saving space while improving data access locality.
+
+### 2.2.BSP Calculation Model
+
+TuGraph uses the BSP (Bulk Synchronous Parallel) model in the process of calculation, which makes the process can be executed in parallel, and greatly improves the efficiency of the program.
+
+The core idea of BSP calculation model is to propose and use Super Step. After OlapOnDB is created, the computation on this data is divided into multiple supersteps, such as PageRank, which is divided into multiple iterations, and each iteration is a Super Step. There is explicit synchronization between different Super Steps to ensure that all threads proceed to the next Super Step at the same time after completing the same superstep. Within a Super Step, all threads execute asynchronously, using parallelism to improve computational efficiency.
+
+BSP calculation model can effectively avoid deadlock, and achieve coarse-grained global synchronization in hardware mode by means of obstacle synchronization, so that graph computation can be executed in parallel, and programmers do not need to spend much time on synchronization mutual exclusion.
+
+## 3.Algorithm example
+
+Here is an explanation of the PageRank algorithm, which is mainly divided into the main function Process and the PageRank algorithm process function.
+
+### 3.1.Main function
+
+The main function has three input parameters, 'TuGraph' database parameter 'db', the request 'request' obtained from the web side, and the return value 'response' given to the web side. The overall process can be divided into the following steps:
+
+1. Obtain related parameters
+
+2. Create a snapshot class
+
+3. Main process of PageRank algorithm
+
+4. Obtain and send the return value of the web page
+
+```c
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+
+    // Obtain the number of iterations from web side requests (num_iterations)，
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // Read transaction creation and snapshot class creation
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+
+    // Create a pr array to store the pr value for each node
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank algorithm main process, obtain the pagerank value of each node
+    PageRankCore(olapondb, num_iterations, pr);
+
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        Function Purpose: Gets the number of the node with the largest pagerank among all nodes
+
+        Function flow description: This function executes Func A for node vi (also known as the active vertices) corresponding to all bits of 1 in the vertex set all_vertices. The return value of Func A is then used as the second input parameter of Func B to obtain the local maximum value (because the first input parameter is 0. So the return value is actually the pagerank value of each node). Finally, the return value of all threads is summarized, and Func B is executed again to get the global return value, and stored in the max_pr_vi variable
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+
+    // Retrieve and send the return value from the web page
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2.PageRank Algorithm process
+
+`pagerank` main process has two input parameters, snapshot class (subgraph) and iteration times, the overall process can be divided into the following steps:
+
+1. Initialization of related data structures
+2. Initialize the pagerank value of each node
+3. Calculation of pagerank value of each node, active vertices for all vertices (means that all vertices need to calculate pagerank value)
+4. Obtain the pagerank value after 'num_iterations' of each node
+
+```c
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+
+    // Initialization of related data structures
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // The initialization of the pagerank value of each node is inversely proportional to the degree of the node
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // Total iteration process
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            Function Purpose: Calculates the pagerank of all nodes
+
+            Function flow description: This function is used to calculate the pagerank value of all nodes. Execute Func C on node vi corresponding to all the bits of 1 in all_vertices to obtain the pagerank value of vi in the current iteration and return the pagerank change value of vi node. The total change value of all active nodes is finally summarized and returned through the internal processing of the function, which is stored in the delta variable
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // Gets the pagerank value of the current node from its neighbor
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank value calculation core formula
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+
+                    // Statistics of relevant intermediate variables
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // The pagerank value obtained in this iteration is output as the input of the next iteration
+        curr.Swap(next);
+    }
+}
+```
+
+### 4.1.Transaction creation
+
+```c
+// Create a read transaction
+auto txn = db.CreateReadTxn();
+
+// Write transaction creation
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2.Parallelization to create a directed graph
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3.Create undirected graphs in parallel
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED;
+)
+```
+
+### 4.4.Obtain the output degree
+
+```c
+size_t OutDegree(size_t vid)
+```
+
+### 4.5.Obtain the input degree
+
+```c
+size_t InDegree(size_t vid)
+```
+
+### 4.6.Gets the outgoing edge set
+
+```c
+/*
+    Function name: AdjList OutEdges(size_t vid)
+
+    Data structure:
+
+    An AdjList can be understood as an array of structures of type AdjUnit
+
+    AdjUnit has two member variables: 1. size_t neighbour 2. edge_data: neighbour indicates the number of the target node pointed by the outgoing edge. If the value is a licensed graph, the data type of edge_data is the same as the weight value of the edge in the input file
+
+    Example Output all outgoing neighbors of node vid
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7.Gets the incoming edge set
+
+```c
+AdjList<edgedata> InEdges(size_t vid)</edgedata>
+
+// Example: Outputs all inbound neighbors of node vid
+for (auto & edge : olapondb.InEdges(vid)) {
+size_t dst = edge.neighbour;
+printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8.Get the node ID of OlapOnDB corresponding to the node in TuGraph
+
+```c
+size_t OriginalVid(size_t vid)
+
+// Note: The node numbers entered in TuGraph can be non-numbers, such as names. When OlapOnDB subgraphs are generated, names and other names will be converted to numbers for subsequent processing. Therefore, this method may not be applicable to some specific scenarios
+```
+
+### 4.9.Gets the node number of TuGraph corresponding to a node in OlapOnDB
+
+```c
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10.Description of active vertices
+
+Active vertices refer to the vertices that need to be processed in the batch function. In this example, we simply output the number of active vertices and summarize the number of active vertices:
+
+```c
+ParallelBitset temp = 000111; // The current active vertices are vertices 3, 4 and 5
+
+size_t delta = ForEachActiveVertex<double>(</double>
+//void c
+[&](size_t vi) {
+printf("active_vertexId = %lu\n",vi);
+return 1;
+},
+all_vertices
+);
+```
+
+The result of this function is obvious. Because of multiple threads, the output order may vary:
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+The local return value is 1. This function will add all the local return values in a thread-safe manner to the final return value, which is stored in the delta variable, and the final value is 3
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..bb3c784f13
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,213 @@
+# OlapOnDisk API
+
+> This document mainly introduces the usage instructions of OlapOnDisk API in detail
+
+## Table of contents
+
+- [1. Introduction](#1introduction)
+- [2. Algorithm Example](#2algorithm-example)
+     - [2.1 header files](#21head-file)
+     - [2.2 Configuration class MyConfig](#22configuration-class-myconfig)
+     - [2.3 Main function](#23main-function)
+     - [2.4 bfs algorithm flow](#24bfs-algorithm-process)
+- [3. Function description of other commonly used functions](#3description-of-other-commonly-used-functions)
+     - [3.1 Image Loading](#31graph-load)
+     - [3.2 Image writing](#32graph-write)
+     - [3.3 Graph Analysis Function](#33graph-parse-function)
+    
+### 1.Introduction
+
+The Standalone mode of TuGraph can be used to load graph data files, where the sources of graph data files can include text files, BINARY_FILE binary files, and ODPS sources. In this mode, TuGraph can quickly load multiple data sources into a graph, and then run iterative algorithms such as BFS, WCC, SSSP, etc. on the graph, and output the final result to the terminal.
+
+In TuGraph, the export and calculation process can be accelerated through parallel processing in memory, so as to achieve near real-time processing and analysis. Compared with traditional methods, it avoids the overhead of data export and storage, and can use compact Graph data structures achieve desirable performance for computation.
+
+TuGraph has built-in a large number of common graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement the specific graph calculation process by themselves. They only need to include the header file (.h) of the corresponding algorithm library when implementing their own stored procedures. To your own program, and link your own dynamic library files in the compilation phase.
+
+This document mainly introduces the common interfaces of Standalone, and the auxiliary functions used are mainly contained in the OlapOnDB class. At the same time, in order to help users understand and facilitate, the BFS algorithm is illustrated with examples.
+
+### 2.Algorithm example
+
+Here, the BFS algorithm is explained in blocks, which are roughly divided into the main function `main`, the BFS algorithm process `BFSCore` function and the configuration class MyConfig.
+
+#### 2.1.Head file
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //Header files to include when using TuGraph
+#include "./algo.h"   //A header file containing various algorithmic logic functions
+```
+
+When using TuGraph to realize the calculation application of graph data files, generally, the StandaloneGraph class object graph is first created, the graph file data is loaded into the graph, and then the graph calculation process is realized by calling the graph logic function, and finally the result of the graph calculation is printed out.
+
+#### 2.2.Configuration class MyConfig
+
+The MyConfig configuration class function is used to provide the configuration information required for the algorithm logic calculation, inherited from ConfigBase<EdgeData>, where EdgeDate can choose Empty (unweighted graph), int (the weight of the weighted graph is an integer) or double (the weight of the weighted graph is double) type.
+
+The MyConfig configuration class generally depends on the algorithm, and additional configuration information is required as follows:
+
+1. Parameters required by the algorithm
+2. Algorithm name
+3. Configure the Print function in the class
+Other common members inherit from ConfigBase, please refer to src/olap/olap_config.h for reference.
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // The parameters required by the algorithm are initialized
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // The configuration file accepts command line parameters. This use case will sequentially read the parameters when calling the algorithm from the command line. The value specified by the user is preferred. If the user does not specify it, the default parameter is selected.
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+#### 2.3.main function
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // Statistical memory consumption class MemUsage instantiation
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // Configuration class MyConfig instantiation
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk class instantiation
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // Statistical graph loading time consumption
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // Create an array to count whether a node has been traversed
+    auto parent = graph.AllocVertexArray<size_t>();
+    // Breadth-first search algorithm, returns the number of nodes connected to the root_vid root node in the graph
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // Print relevant information to the terminal
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+#### 2.4.bfs algorithm process
+
+The main process of `bfs` has two input parameters, the snapshot class (subgraph) and the number of iterations. The overall process can be divided into the following steps:
+
+1. Relevant definitions and initialization of data structures
+2. Use the batch function to perform cyclic calculations on each node, find all nodes adjacent to the current node in each round, and exchange them when the round ends.
+3. Until all nodes are found, return the number of nodes discovered_vertices.
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //Allocate an array, active_in is used to store the nodes found in the previous cycle stage
+  active_in.Add(root);            //Add the root node to the array
+  auto active_out = graph.AllocVertexSubset();  //Allocate the array active_out to store the nodes found in the current cycle stage
+  parent.Fill((size_t)-1);               //Assign a value of -1 to the node in the parent array, -1 means not found
+  parent[root] = root;
+  size_t num_activations = 1;       //Indicates the number of nodes found in the current loop phase
+  size_t discovered_vertices = 0;    //Indicates the total number of nodes found in the current cycle phase
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations indicates the number of nodes found in the current loop phase
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices indicates the total number of nodes found in the current cycle phase
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //Each cycle starts from the root node, finds adjacent adjacent nodes, changes its parent value, and operates num_activations+1
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //Store the nodes found in the current loop phase
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // return all nodes
+  return discovered_vertices;
+}
+```
+
+### 3.Description of other commonly used functions
+
+#### 3.1.Graph load
+
+TuGraph-StandaloneThe loading sources of graph data files are mainly divided into three categories: text files, binary files, and ODPS. The binary file is a file in which the binary representation of the edge data is arranged in order, which can save a lot of storage space. Its loading function is divided into three types, namely:
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：The loading method of the graph data file contains two parameters, and their meanings represent respectively
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `edge_direction_policy`：Specifies whether the graph is directed or undirected, including three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. Among them, DUAL_DIRECTION is the default graph loading method.
+  DUAL_DIRECTION : The input file is an asymmetric graph and the loaded graph is an asymmetric graph.
+  MAKE_SYMMETRIC : The input file is an asymmetric graph and the loaded graph is a symmetric graph.
+  INPUT_SYMMETRIC : The input file is a symmetric graph and the loaded graph is a symmetric graph.
+  For details, see `enum EdgeDirectionPolicy` in the olap_config.h file under the lgraph folder.
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：Load the vertices in the file into an array in the order of their ids. The meanings of each parameter are:
+  - `array`：array of data to be read
+  - `path`：The path to read the file, each line in the file represents a pair of vertex
+  - `parse_line`：A user-defined function that tells the system how to parse a line of text data into a vertex pair.
+
+
+#### 3.2.Graph write
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：Write the data in the array back to the file, and the meanings of each parameter are:
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `array`：array of data to be written
+  - `array_size`：The length of the number of data to be written
+  - `name`：algorithm name
+  - `filter_output`：Write data rule function, the data to be written needs to meet the requirements of this function.
+
+#### 3.3.graph parse function
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：Parse the graph data file, and load the graph as an unweighted graph.
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：Parse the graph data file, load the graph as a weighted graph, and specify the weight data type by modifying <EdgeData>.
+
+This function can be specified through the constructor parse_line when the MyConfig class is defined.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..9417b31135
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,423 @@
+# Python Olap API
+
+> This document mainly introduces the API usage of OlapBase OlapOnDB and OlapOnDisk in Python
+
+## Table of contents
+- [1.Overview](#1-overview)
+- [2.Configuration Requirements](#2-configuration-requirements)
+- [3.Cython](#3-cython)
+- [4.Olap API](#4-olap-api)
+    - [4.1. Atomic operations](#atomic-operations)
+    - [4.2. Vertex collection class ParallelBitset](#vertex-collection-class-parallelbitset)
+    - [4.3. Vertex array class ParallelVector](#vertex-array-class-parallelvector)
+    - [4.4. Custom data structure](#custom-data-structure)
+    - [4.5.Graph class OlapBase](#graph-class-olapbase)
+    - [4.6. Graph Class OlapOnDB](#graph-class-olapondb)
+    - [4.7.Graph class OlapOnDisk](#graph-class-olapondisk)
+- [5.lgraph DB API](#5-lgraph_db-api)
+- [6.Algorithm plugin example](#6-algorithm-plug-in-example)
+
+## 1 Overview
+
+This manual will introduce the simple configuration required to use the Python interface of the TuGraph graph computing system, and explain the TuGraph Python API in conjunction with the code. For details about the functions of class ParallelBitset, OlapBase, etc., see olap-base-api.md, olap-on-db-api.md and olap-on-disk-api.md.
+
+## 2. Configuration requirements
+
+If you want to use TuGraph to write and compile your own applications, the required configuration requirements are:
+
+- Linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+- A compiler that supports C++17 requires GCC version 5.4.1 or later.
+- Cython, version 3.0a1 or above is required, and the tested version is 3.0.0a11
+
+## 3. Cython
+Cython is an efficient programming language that is a superset of Python. Cython can translate .py files into C/C++ codes and compile them into Python extension modules, which can be called through import in Python. In TuGraph, all Python procedures are compiled into Python extension modules by Cython and then used.
+
+The main advantage of using Cython is that it combines the simplicity and ease of use of Python with the performance of C/C++. The TuGraph Python interface is implemented using Cython.
+
+[Cython Documentation](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+The Olap API is used for graph computing and is implemented in C++. The usage and functions are basically the same as the C++ interface. To use the API in a Python file, the interfaces declared in procedures/algo_cython/olap_base.pxd must be imported using `cython.cimports.olap_base import *`. The Python file can only be run after being compiled by Cython.
+
+### Atomic operations
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`: If the value pointed to by ptr is equal to oldv, assign the value pointed to by ptr to newv and return True, otherwise return False.
+- `write_min[T](a: cython.pointer(T), b: T)->cython.bint`: If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_max[T](a: cython.pointer(T), b: T)->cython.bint`: If b is greater than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_add[T](a: cython.pointer(T), b: T)->cython.bint`: Add the value of b to the value pointed to by a.
+- `write_sub[T](a: cython.pointer(T), b: T)->cython.bint`: Subtract the value pointed to by a from the value of b.
+
+### Vertex collection class ParallelBitset
+- `Size() -> size_t`: Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size: size_t)`: Initializes size and data, where the length of data is (size >> 6) + 1.
+- `Clear() -> cython.void`: Empties the collection.
+- `Fill() -> cython.void`: Adds all vertices to the set.
+- `Has(i: size_t) -> cython.bint`: Checks if vertex i is in the set.
+- `Add(i: size_t) -> cython.bint`: Adds vertex i to the set.
+- `Swap(other: ParallelBitset) -> cython.void`: Exchanges elements with another ParallelBitset set.
+
+### Vertex array class ParallelVector
+- `ParallelVector[T](size_t capacity)`: Constructs a ParallelVector, where capacity is the initial capacity of the vertex array.
+- `operator[](i: size_t) -> T`: Returns the data at index i.
+- `begin() -> cython.pointer(T)`: Returns the start pointer of ParallelVector.
+- `end() -> cython.pointer(T)`: Returns the end pointer of ParallelVector. The usage of begin() and end() is similar to the begin and end pointers of the vector container, and these two pointers can be used to sequentially access the array.
+- `Back() -> T`: Returns the last data of ParallelVector.
+- `Data() -> cython.pointer(T)`: Indicates the data of the array itself.
+- `Destroy() -> cython.void`: Clears the data in the ParallelVector array and deletes the array.
+- `Size() -> size_t`: Indicates the number of data in ParallelVector.
+- `Resize(size: size_t) -> cython.void`: Changes ParallelVector to size, which should be greater than or equal to the size before the change and less than capacity.
+- `Clear() -> cython.void`: Clears the data in ParallelVector.
+- `ReAlloc(capacity: size_t) -> cython.void`: Allocates a new capacity size to ParallelVector. If the array has data, it migrates the data to the new memory.
+- `Fill(elem: T) -> cython.void`: Assigns elem to all data of ParallelVector.
+- `Append(elem: T, atomic: cython.bint = true) -> cython.void`: Adds a data to the end of ParallelVector.
+- `Swap(other: ParallelVector[T]) -> cython.void`: Exchanges data with another ParallelVector.
+- `Copy() -> ParallelVector[T]`: Copies the current ParallelVector data and stores it in the copy array.
+
+
+### Custom Data Structure
+- `Empty`: A special data type whose content is empty.
+- `EdgeUnit[EdgeData]`: Indicates the edge whose weight type is EdgeData, used to parse the input file, including three member variables:
+    - `src: size_t`: starting vertex of the edge
+    - `dst: size_t`: end of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjUnit[EdgeData]`: indicates the edge whose weight type is EdgeData, which is used in the batch calculation process and contains two member variables:
+    - `neighbor: size_t`: neighbor vertex of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjList[EdgeData]`: The adjacency list of vertices whose weight type is EdgeData, often used to represent the set of incoming and outgoing edges of vertices, including three member functions:
+    - `begin()->cython.pointer(AdjUnit[T])`: the starting pointer of the list
+    - `end()->cython.pointer(AdjUnit[T])`: the end pointer of the list
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: the data whose subscript is i
+
+### Graph class OlapBase
+- `NumVertices()->size_t`: get the number of vertices
+- `NumEdges()-> size_t`: get the number of edges
+- `OutDegree(vid: size_t)-> size_t`: out-degree of vertex vid
+- `InDegree(vid: size_t)->size_t`: in-degree of the vertex vid
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`: Allocates an array of type VertexData with size as the number of vertices
+- `AllocVertexSubset()-> ParallelBitset`: Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all outgoing edges of vertex v
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all incoming edges of vertex v
+- `Transpose()->cython.void`: transpose of a directed graph
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+    - `edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+    - `input_vertices`: specifies the number of vertices read into the graph by the array.
+
+    - `input_edges` : specifies the number of edges that the array reads into the image.
+
+    - `edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`: locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`: unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+
+TuGraph provides two batch operations to perform point-centric batch processing in parallel, which is slightly different from C++ in Python.
+
+```python
+# Function name: ProcessVertexInRange[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# lower: size_t, upper: size_t,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Executes the work function on nodes whose node numbers are between lower and upper in the Graph. The fourth parameter indicates the base of accumulation, which is 0 by default.
+# The fifth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in include/lgraph/olap_base.h
+#
+# Example usage: Count the number of vertices with edges in the parent array.
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython.pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+g is the instantiated object of graph class OlapBase
+
+```python
+# Function name: ProcessVertexActive[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# active: ParallelBitset,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Execute the work function on the nodes corresponding to 1 in the active_vertices bitset. The third parameter indicates the base of accumulation, which is 0 by default;
+# The fourth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in /include/lgraph/olap_base.h
+#
+# Usage example: Output all out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes.
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self. graph. OutDegree(vi)
+        dst: size_t
+        edges = self. graph. OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbor
+            printf("node %lu has neighbor %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+As shown in the above two examples, ProcessVertexActive and ProcessVertexInRange in Python require an additional algorithm class pointer parameter compared to their C++ counterparts. The Work function is generally used as a member function of the algorithm class to access member variables, such as in the graph and ParallelVector parent examples shown above. When calling the batch function, the Work function and the self pointer of the algorithm class are passed to the batch function.
+
+The Work function will be called in multiple threads, so the @cython.nogil decorator is added to release the Python global interpretation lock. In code executed by multiple threads, such as the Work function in the batch function, variables are better declared as C/C++ types using `dst: type` or `dst = cython.declare(type)`. This is because Python objects cannot be used in multi-threaded code.
+
+### Graph class OlapOnDB:
+Parallelize to create a directed graph:
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+Parallelize to create an undirected graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING creates a directed graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### Graph class OlapOnDisk
+
+#### ConfigBase:
+- `ConfigBase()`: Constructor
+- `std::string input_dir`: graph edge table data path
+- `std::string output_dir`: output path
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: read in graph data
+
+## 5. lgraph_db API
+Please refer to the files procedures/algo_cython/lgraph_db.pxd and lgraph_db_python.py for the lgraph_db API.
+
+The usage and functions of the interface in lgraph_db.pxd are basically the same as the C++ interface. The interface declared in lgraph_db.pxd is implemented in C++. In the py file, it must be imported by `cython.cimports.olap_db import *` and compiled by the Cython file to run.
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: Get the vid of the vertex
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: constructor, dir_path is the db path
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: set user
+- `SetUser(user: std::string)-> cython.void`: set user
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: create GraphDB
+
+### GraphDB:
+- `CreateReadTxn()-> Transaction`: create a read-only transaction
+- `CreateWriteTxn()-> Transaction`: create a write transaction
+- `ForkTxn(txn: Transaction)-> Transaction`: Copy transactions, only read transactions can be copied
+
+### Transaction:
+```
+GetVertexIndexIterator(
+                 label: std::string,
+                 field: std::string,
+                 key_start: std::string,
+                 key_end: std::string) -> VertexIndexIterator
+```
+Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v
+
+
+
+lgraph_db_python.py packages the C++ classes Galaxy and GraphDB from lgraph_db.pxd as Python classes. After compiling lgraph_db_python.py into a Python extension, you can directly access it in a Python file or from the Python command line by importing it with `import lgraph_db_python`.
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: constructor, dir_path is the db path
+- `SetCurrentUser(self, user: str password: str)-> void`: set user
+- `SetUser(self, user: std::string)-> void`: set user
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: create PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)->cython.Py_ssize_t`: address of C++ class GraphDB
+
+## 6. Algorithm plug-in example
+The following is a code example of the BFS algorithm implemented in Python:
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# Comments work as follows:
+# language_level=3: use Python3
+# cpp_locals=True: C++17 is required, and std::optional is used to manage C++ objects in Python code, which can avoid copy construction of C++ objects
+# boundscheck=False: Turn off bounds checking for indexes
+# wraparound=False: Turn off the processing of negative subscripts (similar to Python List)
+# initializedcheck=False: Turn off checking whether the memory is initialized, and the running performance will be faster after turning off the check
+# language = c++: translate this .py file to C++ instead of C file. TuGraph uses a lot of template functions, so C++ should be used
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# From procedures/algo_cython/ cimportolap_base.pxd and lgraph_db.pxd, similar to #include "xxx.h" in C++
+
+from cython.cimports.libc.stdio import printf
+# Similar to #include <stdio.h> in C++
+# Other common ones include cython.cimports.libcpp.unordered_map, etc.
+
+import time
+
+@cython.cclass
+# cython.cclass indicates that BFSCore is a C-type Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty]) indicates the pointer of OlapBase[Empty], similar to OlapBase[Empty]* in C++
+    # Cython provides common types of pointers, such as cython.p_int, cython.p_char, etc.
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t declares root as a C++ size_t type variable, equivalent to root = cython.declare(size_t)
+    # Variables that do not declare a type are Python object types
+    # Declaring variable types will greatly improve performance, and in the multi-threaded part, only C/C++ type variables can be accessed
+
+    @cython.cfunc
+    # cython.cfunc indicates that Work is a C-type function, and the parameters and return values should be declared
+    # cfunc has good performance and can accept C/C++ objects as parameters and return values, but it cannot be called in other python files
+    # Similar to cython.ccall, such as Standalone function, which can be called in other python files
+    @cython.nogil
+    # cython.nogil means to release the Python global interpretation lock. In the part modified by nogil, Python objects cannot be accessed
+    # In the multi-threaded part, there should be nogil decorator
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) means that exception propagation is disabled, and Python exceptions raised inside the function will be ignored
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbor
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 means that dst has not been visited by bfs
+                if self.active_out.Add(dst):
+                    # Set dst as an active node; ParallelBitmap.Add is an atomic operation to prevent double calculation
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython. size_t:
+        self. graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self. parent. Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self. active_in. Add(self. root)
+        while num_activations > 0:
+            self. active_out. Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self. active_out. Swap(self. active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time. time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # Create OlapOnDB in parallel
+    # Cython does not support dereference operations such as *db, use db[0] to dereference
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # Get the iterator of the root node through GetVertexIndexIterator based on the root node label name, field name and field value (root_id),
+    # and get the vid through the iterator. When there is no ID_MAPPING, the vid is the same as the id in OlapOnDB
+    cost = time. time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time. time()
+    count = a. run(cython. address(olapondb), root_vid)
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb. NumVertices()
+    response["num_edges"] = olapondb. NumEdges()
+    return True
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process is the plug-in entry in embed mode and procedure mode, modified with cython.ccall
+    # The Process function must be named Process, and the parameters are lgraph_db_python.PyGraphDB and bytes
+    # The return value must be (bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # Get the address of the GraphDB object in the PyGraphDB, convert it to a pointer and pass it
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..e496945495
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,191 @@
+# TuGraph Built-in Algorithm Description
+
+> This document mainly introduces the TuGraph built-in algorithm program in detail, the community version of 6 algorithms can refer to the basic algorithm newspaper
+
+## 1.Introduction
+
+TuGraph currently contains the following 6 basic algorithms and 28 extended algorithms, a total of 34 graph algorithms:
+
+### 1.1.Basic algorithms:
+
+|    Algorithm name            | The program name |
+| :--------------------------: | :--------------: |
+|     Breadth-First Search     |       bfs        |
+|           Pagerank           |     pagerank     |
+| Single-Source Shortest Path  |       sssp       |
+| Weakly Connected Components  |       wcc        |
+| Local Clustering Coefficient |       lcc        |
+| Label Propagation Algorithm  |       lpa        |
+
+### 1.2.Extended algorithms:
+
+|            Algorithm name                    |   The program name   |
+| :------------------------------------------: | :------------------: |
+|            All-Pair Shortest Path            |         apsp         |
+|            Betweenness Centrality            |          bc          |
+|              Belief Propagation              |          bp          |
+|             Closeness Centrality             |          clce        |
+|             Common Neighborhood              |          cn          |
+|              Degree Correlation              |          dc          |
+|             Dimension Estimation             |          de          |
+|                    EgoNet                    |          en          |
+|        Hyperlink-Induced Topic Search        |         hits         |
+|                Jaccard Index                 |          ji          |
+|                    K-core                    |        kcore         |
+|                   Louvain                    |       louvain        |
+|        Multiple-source Shortest Paths        |         mssp         |
+|            Personalized PageRank             |         ppr          |
+|        Strongly Connected Components         |         scc          |
+| Speaker-listener Label Propagation Algorithm |         slpa         |
+|          Single-Pair Shortest Path           |         spsp         |
+|              Triangle Counting               |       triangle       |
+|                  Trustrank                   |      trustrank       |
+|     Weighted Label Propagation Algorithm     |         wlpa         |
+|         Weighted Pagerank Algorithm          |      wpagerank       |
+|           Maximal independent set            |         mis          |
+|                  Sybil Rank                  |      sybilrank       |
+|             Subgraph Isomorphism             | subgraph_isomorphism |
+|                    Motif                     |        motif         |
+|                   Kcliques                   |       kcliques       |
+|                    Ktruss                    |        ktruss        |
+|                    Leiden                    |        leiden        |
+
+## 2.Basic algorithms
+
+### 2.1.Breadth-First Search
+
+Breadth first Search implements the Breadth-first Search algorithm, which starts from the root vertex and traverses all accessible vertices along the width of the graph. Returns the number of vertices traversed. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 2.2.Pagerank
+
+Web page sorting program to achieve the commonly used Pagerank algorithm. The algorithm calculates the importance ranking of all vertices according to the edge and edge weight in the graph. The higher the PageRank value, the higher the importance of the vertex in the graph. The reciprocal of the number of vertices is used as the initial Rank value of each vertex, and then the Rank value of the vertices is transferred to the adjacent vertices on average according to the outgoing edges, and the transfer process is repeated until the given convergence threshold is met or the given number of iterations is reached. At the end of each pass round, a certain proportion of the Rank values of all vertices will be randomly transferred to any vertex. Please refer to the algorithm content [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 2.3.Single-Source Shortest Path
+
+The Single Source Shortest Path algorithm realizes the Single Source Shortest Path algorithm. It calculates the shortest path length from a given source vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 2.4.Weakly Connected Components
+
+The program of Weakly Connected Components has implemented the algorithm. It can calculate all the weakly connected components in the graph. A weakly connected component is a subgraph of a graph in which reachable paths exist between any two points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Connected*component*(graph_theory)](<https://en.wikipedia.org/wiki/Connected_component_(graph_theory)> "scc wiki")。
+
+### 2.5.Local Clustering Coefficient
+
+The average Clustering Coefficient program implements the Local Clustering Coefficient algorithm to calculate the coefficient of the degree of clustering between vertices in the graph. The returned results include the overall clustering coefficient and the vertex clustering coefficient. The overall agglomeration coefficient reflects the evaluation of the overall agglomeration degree in the graph, and the vertex agglomeration coefficient includes the agglomeration coefficient of any vertex, which reflects the agglomeration degree near the vertex. The higher the agglomeration coefficient, the higher the agglomeration degree. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 2.6.Label Propagation Algorithm
+
+The program implements Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and computes unauthorised graphs. In label passing, each vertex adds up all the labels received, and randomly selects one of the labels with the highest sum. The iteration converges or the algorithm terminates after a given number of rounds. The final output is a label for each vertex, and vertices with the same label value are considered to be in the same community. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+## 3.Extended algorithms
+
+### 3.1.All-Pair Shortest Path
+
+The All-Pair Shortest Path program realizes the all-pair Shortest Path algorithm and calculates the shortest path between any two points in the graph. Returns the shortest path length between any pair of vertices where the path exists. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 3.2.Betweenness Centrality
+
+Betweenness Centrality algorithm is implemented in Betweenness centrality program to estimate the betweenness centrality value of all vertices in a graph. The value of intermediate centrality reflects the possibility that any shortest path in the graph passes through the vertex, and the higher the value, the more shortest paths pass through the vertex. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 3.3.Belief Propagation
+
+The Belief Propagation algorithm is implemented in the confidence propagation program. Given the edge distribution of the observed vertices, the algorithm estimates the edge distribution of the unobserved vertices by using the mechanism of passing messages among vertices. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 3.4.Closeness Centrality
+
+The Distance Centrality program implements the Closeness Centrality algorithm, which estimates the average shortest path length from any node to other nodes in the graph. A smaller distance centrality value indicates that the node has a smaller average shortest distance to other nodes, meaning it is more centrally located in the graph from a geometric perspective. The calculation requires specifying the number of sampling points, and the algorithm computes the centrality values for each of these sampling points. For the algorithm content, please refer to [https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki").
+
+### 3.5.Common Neighborhood
+
+The Common Neighborhood program implements the common Neighborhood algorithm to count the number of common neighbors between any given pair of neighboring vertices. Given several pairs of vertices to be queried, the result is the number of common neighbors of any pair of vertices to be queried.
+
+### 3.6.Degree Correlation
+
+The Degree Correlation algorithm is implemented in the degree correlation program. It calculates the degree correlation degree of a graph by calculating the Pearson correlation coefficient between any adjacent vertex pairs, which can be used to characterize the correlation degree between high-degree vertices in the graph. A higher degree of correlation indicates a higher degree of correlation between vertices of higher degree in the graph. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 3.7.Dimension Estimation
+
+The diameter Estimation program implements the Dimension Estimation algorithm. The algorithm calculates the length of the longest shortest path in the graph, which is used to characterize the diameter of the graph. Please refer to the algorithm content[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### 3.8.EgoNet
+
+The EgoNet algorithm requires a given root vertex and K value, and takes the root vertex as the source vertex to conduct a width-first search to find the subgraph composed of all neighbors within K degrees. The found subgraph is called the EgoNet of the root vertex.
+
+### 3.9.Hyperlink-Induced Topic Search
+
+The Hyperlink Topic Search algorithm implements the Hyperlink-induced topic search algorithm, which assumes that each vertex has two attributes: Authority and Hub. A good hub vertex should point to many vertices with high authority. And a good authority vertex should be pointed to by many vertices of high pivot type. The algorithm returns the authority value and the hub value for each vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 3.10.Jaccard Index
+
+The Jaccard coefficient program implements the Jaccard Index algorithm. The algorithm calculates the Jaccard coefficient between a given pair of vertices, which can be used to represent the similarity of the two vertices. A higher Jaccard coefficient indicates a higher degree of similarity between pairs of vertices. Given several pairs of vertices with the query, the Jaccard coefficients of these pairs are returned. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### 3.11.K-core
+
+k accounting method implements k-core algorithm. The algorithm computes the number of kernels of all vertices, or finds all K-nucleon graphs in the graph. K-nucleon graph is a special subgraph in which the degree of any vertex is not less than a given K value. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Degeneracy\_(graph_theory)](<https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)> "kcore wiki")。
+
+### 3.12.Louvain
+
+The Louvain community discovery program implements the Fast-unfolding algorithm. The algorithm is a community discovery algorithm based on modularity. It maximizes the modularity of the graph by constantly merging vertex communities, and can discover the hierarchical community structure. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 3.13.Multiple-source Shortest Paths
+
+The multisource Shortest Paths program implements the multiple-source Shortest Paths algorithm to calculate the shortest path value to any vertex from the given Multiple source vertices. Where, the shortest path value of multiple source vertices to a vertex is the minimum value of the shortest path from each source vertex to the vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 3.14.Personalized PageRank
+
+Personalized web ranking program has Personalized PageRank algorithm. According to the given source vertex, the algorithm calculates the importance ranking of all vertices to the source vertex based on the source vertex. The higher the Rank value, the more important the vertex is to the source vertex. Unlike PageRank, the source vertex Rank value is 1, the rest of the vertex Rank value is 0; And a certain proportion of Rank value will be immediately transferred back to the source vertex after each round of transmission. Please refer to the algorithm content [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 3.15.Strongly Connected Components
+
+Strongly Connected component program realizes the Strongly Connected Components algorithm. The algorithm computes all strongly connected components of the graph, which is a subgraph of the graph that can start from any vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 3.16.Speaker-listener Label Propagation Algorithm
+
+The program realizes the Speaker-listener Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and historical tag record, which is an extension of tag propagation algorithm. Different from the label propagation algorithm, this algorithm records the historical labels of all vertices. When the labels are accumulated in the iteration, the historical labels are also counted. The final output is all the historical label records for each vertex. Please refer to the paper for the algorithm content:“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 3.17.Single-Pair Shortest Path
+
+The program of the shortest path between two points implements the Bidirectional point-first Search algorithm. It searches forward width First along the outgoing edge from the starting point and reverse width first along the incoming edge from the end point on the directed undirected graph. The shortest path length from the starting point to the ending point is determined by traversing the vertices of the starting point and the ending point together. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 3.18.Triangle Counting
+
+The Triangle-counting algorithm is implemented to calculate the number of triangles in an undirected graph, which can be used to characterize the correlation degree of the vertices in the graph. The higher the number of triangles, the higher the degree of correlation of the vertices in the graph. For the algorithm content, please refer to the paper, "Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study".
+
+### 3.19.Trustrank
+
+The Trust Index Sorting Algorithm implements the Trustrank algorithm, which can calculate the Trust Index of any vertex based on a given whitelist. The higher the trust score, the less likely the vertex is to be illegal. Please refer to the algorithm content for details. [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 3.20.Weighted Label Propagation Algorithm
+
+Weighted Label Propagation Algorithm is implemented in the program. = Different from the label propagation algorithm, the label transmission is related to the weight of the edge. During label transmission, the weight of each vertex will be accumulated according to the incoming edge of the label, and the label with the highest sum will be randomly selected. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 3.21.Weighted Pagerank Algorithm
+
+Weighted Pagerank is implemented in the weighted Pagerank algorithm. Different from PageRank algorithm, the transfer of Rank value is related to the weight of the edge. The Rank value of the vertex will be transferred to the adjacent vertices according to the weight of the edge. Please refer to the algorithm content[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 3.22.Maximal independent set
+
+Maximal independent set algorithm implements Maximal Independent Set algorithm. A maximum independent set means that there are no vertices outside the independent set that can join it. A graph may have many MIS that vary greatly in size, and the algorithm finds one of them. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### 3.23.Sybil Rank
+
+Sybil detection algorithm implements Sybil Rank algorithm. The SybilRank algorithm starts from non-Sybil nodes and performs a random walk with premature termination. Please refer to the paper for the algorithm content:“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 3.24.Subgraph Isomorphism
+
+The subgraph matching algorithm implements the subgraph_isomorphism algorithm. The subgraph_isomorphism algorithm matches all nodes in the whole graph and outputs the number of times each node is matched. Algorithm Content Reference [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 3.25.Motif
+
+Pattern matching algorithm implements motif algorithm. motif algorithm matches k-order subgraphs for the specified nodes, and finally outputs the number of each kind of K-order subgraphs for each specified node. Each K-order subgraph is represented by a 64-bit integer, and the $i \times k + j$bit is 1, indicating that there is an edge i->j in the subgraph. Algorithm Content Reference [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### 3.26.Kcliques
+
+The K-order clique counting algorithm implements the k-cliques algorithm. The k-cliques algorithm calculates the number of all K-order complete subgraphs in the graph, and finally outputs the number of k-order complete subgraphs of each node. Algorithm Content Reference [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### 3.27.Ktruss
+
+The k-order truss counting algorithm implements the k-truss algorithm. A k-truss is a subgraph in which each edge is the edge of at least k-2 triangles. The k-truss algorithm finds out the k-truss subgraph of the graph, and finally outputs the neighbor node list of each node in the subgraph. Algorithm Content Reference[https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+
+### 3.28.Leiden
+
+Leiden algorithm implements Leiden's algorithm. leiden algorithm is a community discovery algorithm based on modularity. Compared with louvain algorithm, leiden algorithm has the advantage that Leiden algorithm detects the broken links in the community to ensure that each community has good connectivity. Algorithm Content Reference [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..dc955b3b91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..689128d8a0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,100 @@
+# Learning Tutorial
+
+> This document is designed as a guide for TuGraph users. Before reading the detailed documentation, users should first read this document to have a general understanding of the graph learning process of TuGraph, which will make it easier to read the detailed documentation later. The guide program is based on a simple program instance of TuGraph, and we will focus on its usage.
+
+## 1. Introduction to TuGraph Graph Learning Module
+Graph learning is a machine learning method that utilizes the topological information of a graph structure to analyze and model data. Unlike traditional machine learning methods, graph learning uses graph structures where vertices represent entities in data and edges represent relationships between entities. By extracting features and patterns from these vertices and edges, deep associations and patterns can be revealed in data that can be used in various practical applications.
+
+The TuGraph Graph Learning Module is a graph learning module based on a graph database that provides four sampling operators: Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. These operators can be used to sample vertices and edges in a graph to generate training data. The sampling process is performed in a parallel computing environment, providing high efficiency and scalability.
+
+After sampling, the obtained training data can be used to train a model that can be used for various graph learning tasks such as prediction and classification. Through training, the model can learn the relationships between vertices and edges in the graph, allowing for prediction and classification of new vertices and edges. In practical applications, this module can be used to handle large-scale graph data such as social networks, recommendation systems, and bioinformatics.
+
+## 2. Run Process
+The TuGraph graph learning module samples graph data in TuGraph, and the sampled vertices and edges are used as graph learning features for learning and training. The operation process is shown in the figure below:
+
+![Alt text](../../../../images/learn_flow_chart_en.png)
+
+## 3. TuGraph compilation and data preparation
+For TuGraph compilation, please refer to: [Compile](../../5.installation&running/6.compile.md)
+Execute in the build/output directory:
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+This command copies the relevant files of the dataset to the build/output directory.
+
+## 4. Data Import
+Please refer to [Data Import](../../6.utility-tools/1.data-import.md) for data import.
+
+Taking the cora dataset as an example for the import process:
+
+Execute in the build/output directory:
+
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Where cora.conf is the graph schema file representing the format of the graph data. coradb is the imported graph data file name representing the storage location of the graph data.
+
+## 5. Feature Conversion
+Since the features in graph learning are generally represented as long float arrays, TuGraph does not support loading float array types, so they can be imported as string types and converted to char* for subsequent storage and access, and the implementation details can refer to the feature_float.cpp file.
+
+The specific execution process is as follows:
+
+Compile the imported plugin in the build directory.（Skip if TuGraph has been compiled）:
+
+`make feature_float_embed`
+
+Execute in the build/output directory:
+
+`./algo/feature_float_embed ./coradb`
+
+Then the conversion can be performed.
+
+## 6. Sampling Operators and Compilation
+TuGraph implements an operator for obtaining the full graph data and four sampling operators at the cython layer, as follows:
+
+### 6.1.Sampling Operator Introduction
+|Sampling Operator | Sampling Method |
+| --- | --- |
+|GetDB | Get the graph data from the database and convert it into the required data structure |
+|Neighbor Sampling | Sample the neighboring nodes of the given node to obtain the sampling subgraph |
+|Edge Sampling | Sample the edges in the graph according to the sampling rate to obtain the sampling subgraph |
+|Random Walk Sampling | Conduct a random walk based on the given node to obtain the sampling subgraph |
+|Negative Sampling | Generate a subgraph of non-existent edges|
+
+### 6.2.Compilation
+Skip if TuGraph has been compiled.
+Execute in the tugraph-db/build folder:
+
+`make -j2`
+
+Or execute in the tugraph-db/learn/procedures folder:
+
+`python3 setup.py build_ext -i`
+
+Once the algorithm so is obtained, it can be used by importing it in Python.
+
+## 7. Model Training and Storage
+TuGraph calls the cython layer operator at the Python layer to implement graph learning and training.
+
+The usage of the TuGraph graph learning module is as follows:
+
+Execute in the build/output folder:
+
+`python3 train_full_cora.py --model_save_path ./cora_model`
+
+Then training can be performed.
+
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+## 8. Model Loading
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+Before using a saved model, it is necessary to load it first. In the code above, the trained model is loaded using the provided code.
+
+After loading the model, we can use it to make predictions and classifications for new vertices and edges. For prediction, we can input one or multiple vertices and the model will output corresponding prediction results. For classification, we can input the whole graph, and the model will classify the vertices and edges in the graph to achieve the task goal.
+
+Using a trained model can save time and resources compared to retraining the model. Additionally, since the model has already learned the relationships between vertices and edges in the graph, it can adapt well to new data and improve the accuracy of predictions and classifications.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..c649fa50e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,102 @@
+# Sampling API
+
+>This document provides a detailed guide on using the Sampling API of TuGraph.
+
+## 1. Overview
+This manual introduces the Sampling API using TuGraph.
+
+## 2. Graph Data Instantiation
+Before the sampling operation, load the graph data according to the graph data path, and map it into the olapondb graph analysis class, the code is as follows:
+
+```python
+galaxy = PyGalaxy(args.db_path) # Create a galaxy instance based on the path
+galaxy.SetCurrentUser(args.username, args.password) # Set the current user
+db = galaxy.OpenGraph('default', False) # Open the graph database specified by db
+txn = db.CreateReadTxn() # Create a transaction instance
+olapondb = PyOlapOnDB('Empty', db, txn) # Instantiate OlapOnDB based on the graph loading method, graph database instance, and transaction instance
+del txn
+del db
+del galaxy
+```
+## 3. Introduction to Sampling Operators
+The graph sampling operator is implemented in the cython layer and is used to sample the input graph. The generated NodeInfo is used to save point information such as feature attributes and label attributes, and EdgeInfo is used to save edge information. These metadata information can be used for features Extraction, network embedding and other tasks. Currently, the TuGraph graph learning module supports five sampling operators: GetDB, NeighborSampling, EdgeSampling, RandomWalkSampling, and NegativeSampling.
+
+### 3.1.RandomWalk Operator
+Random walks are performed a specified number of times around the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.2.NeighborSampling Operator
+A certain number of nodes are sampled from the first-degree neighbors of the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.3.NegativeSampling Operator
+The negative sampling algorithm is used to generate a subgraph of non-existent edges.
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+num_samples: The number of false edges to be generated.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.4.EdgeSampling Operator
+The edge sampling algorithm is used to generate a subgraph of sampled edges.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_rate: The sampling rate of the edges to be selected.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.5.GetDB Operator
+Get the graph data from the database and convert it into the required data structure.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+## 4. User-Defined Sampling Algorithm
+Users can also implement a custom sampling algorithm through the TuGraph Olap interface. For the interface document, see [here](../2.olap/5.python-api.md). This document mainly introduces the interface of related functions used by the graph sampling algorithm design.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..510f3d4fcd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,96 @@
+# Training
+> This document details how to use TuGraph for training Graph Neural Networks (GNNs).
+
+## 1. Training
+When using TuGraph's graph learning module for training, it can be divided into two categories: full graph training and mini-batch training.
+
+Full graph training involves loading the entire graph from the TuGraph db into memory and training the GNN. Mini-batch training uses the sampling operator of the TuGraph graph learning module to sample the entire graph data and then input it into the training framework for training.
+
+## 2. Mini-Batch Training
+Mini-batch training requires the use of TuGraph's graph learning module's sampling operators, which currently support Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. The sampling result of the TuGraph graph learning module's sampling operator is returned in the form of a List.
+
+The following takes Neighbor Sampling as an example to introduce how to convert the sampled results into the training framework for format conversion.
+The user needs to provide a Sample class:
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. Load graph data
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+        # 2. Sampling method, the result is stored in NodeInfo and EdgeInfo
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+        # 3. Format conversion of the result to fit the training format
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+As shown in the code, the graph data is first loaded into memory. Then use the sampling operator to sample the graph data, and the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and the stored information results are as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Finally, we format the result to fit the training format. Here we use the DGL training framework, so we construct a DGL Graph using the result data, and then return the DGL Graph.
+
+Once we provide the TuGraphSample class, we can use it for Mini-Batch training. Let the data loading part of DGL use the sampler instance of TuGraphSample as follows:
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+Use DGL for model training:
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+## 3. Full-Batch training
+Full-Batch training of GNNs (Graph Neural Networks) is a type of training that involves processing the entire training dataset at once. It is one of the simplest and most straightforward training methods for GNNs, where the entire graph is treated as a single instance. In full-batch training, the entire dataset is loaded into memory and the model is trained on the entire graph. This type of training is especially useful for small to medium-sized graphs, and is mainly used for static graphs that do not change over time.
+```python
+getdb. Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+The full graph are then fed into the training framework for training.
+Full code: learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..556c3c1fd0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,101 @@
+# Heterogeneous Graph
+
+> This document describes how to use heterogeneous graphs for training.
+
+## 1. Introduction to Heterogeneous Graph
+A heterogeneous graph is a graph structure composed of nodes and edges of different types. In a heterogeneous graph, nodes and edges can have diverse attributes and relationships, representing different entities and their complex associations.
+
+In a heterogeneous graph, node types can represent different entities such as users, products, topics, etc., while edge types represent the relationships between different entities, such as the follow relationship between users, or the purchase relationship between users and products. Nodes and edges can have different attributes.
+
+Heterogeneous graphs provide a powerful graph model that can better express and analyze real-world systems with multiple entity types and complex relationships. They have broad application prospects and research value in various fields of data analysis and applications.
+
+## 2. Creating a Heterogeneous Graph
+In TuGraph, a heterogeneous graph is composed of a series of edge relationships. Each relationship is defined by a triplet of strings: (source node type, edge type, target node type). The creation of a heterogeneous graph is similar to that of a homogeneous graph, but the triplet definition needs to be specified when creating the graph. The following example demonstrates:
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+In the code snippet above, the fourth parameter is the edge relationship definition of the heterogeneous graph. By specifying this parameter, you can select specific node and edge types for graph construction and training. If this parameter is not specified, all node and edge types will be used for graph construction by default.
+
+## 3. Heterogeneous graph query interface
+To facilitate user usage, TuGraph provides interfaces for querying node and edge types when the fourth parameter is given. The following examples demonstrate these interfaces:
+
+### 3.1 Querying Node Types
+```python
+olapondb.ntypes()
+```
+The return value is a list of node types, such as ['node1', 'node2', 'node3'].
+
+### 3.2 Querying Edge Types
+```python
+olapondb.etypes()
+``` 
+The return value is a list of edge types, such as ['edge1', 'edge2', 'edge3'].
+
+### 3.3 Querying Node and Edge Types
+```python
+olapondb.metagraph()
+```
+The return value is a list of string triplets (source node type, edge type, target node type), such as
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')].
+
+## 4 Heterogeneous graph output format
+The same as the homogeneous graph, the sampling data results of the heterogeneous graph are also stored in NodeInfo and EdgeInfo.
+Output data can be obtained in the following ways.
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+
+The result of its stored information is as follows:
+| Graph Data | Storage Location |
+| --- | --- |
+| Edge Source | EdgeInfo[0] |
+| Edge Destination | EdgeInfo[1] |
+| Edge Type | EdgeInfo[2] |
+| Vertex ID | NodeInfo[0] |
+| Vertex Feature | NodeInfo[1] |
+| Vertex Label | NodeInfo[2] |
+| Vertex Type | NodeInfo[3] |
+
+## 5. Training Heterogeneous Graphs
+The goal of training a heterogeneous graph is to learn the representation of nodes and edges in the graph for subsequent tasks such as node classification, link prediction, and graph clustering. To achieve this goal, researchers have proposed a variety of models based on graph neural networks (GNNs). These models update the representation of nodes by aggregating the information of neighboring nodes, thereby capturing the complex relationships in the graph structure.
+
+Since heterogeneous graphs contain nodes and edges of multiple types, it is necessary to consider how to process these different types of information when designing GNN models. One common approach is to design different aggregation functions to process different types of neighboring nodes. In addition, it is also necessary to consider how to integrate these different types of information together so that the model can effectively learn the representation of nodes and edges.
+
+TuGraph provides a method for training heterogeneous graphs using the ogbn-mag dataset, which can be used for reference.
+
+The official docker provided by TuGraph does not yet provide an environment for heterogeneous graph training, so users need to install relevant dependency packages by themselves.
+Before training, you need to download the ogb and pandas packages. The specific installation method is as follows:
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+The training code looks like this:
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    # print('load time', load_time - s, 'train_time', train_time - load_time)
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+The complete training code can be found in tugraph/learn/examples/train_full_mag.py.
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..fbc920ad54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+TuGraph Learn
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..f4d9296bec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+Stored Procedures And OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/conf.py b/docs/docusaurus/versions/version-4.3.2/en-US/source/conf.py
new file mode 100644
index 0000000000..7712aee00e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.3.2/en-US/source/index.rst b/docs/docusaurus/versions/version-4.3.2/en-US/source/index.rst
new file mode 100644
index 0000000000..24b08fe10f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/en-US/source/index.rst
@@ -0,0 +1,23 @@
+TuGraph DB
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions/version-4.3.2/images/architecture-en.png b/docs/docusaurus/versions/version-4.3.2/images/architecture-en.png
new file mode 100644
index 0000000000..edf2bc873a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/architecture-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/architecture.png b/docs/docusaurus/versions/version-4.3.2/images/architecture.png
new file mode 100644
index 0000000000..e8eeea87e0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/architecture.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/account-add-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/account-add-button.png
new file mode 100644
index 0000000000..5b9c7e9378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/account-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/account-add.png b/docs/docusaurus/versions/version-4.3.2/images/browser/account-add.png
new file mode 100644
index 0000000000..b0b5068027
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/account-add.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/account-delete.png b/docs/docusaurus/versions/version-4.3.2/images/browser/account-delete.png
new file mode 100644
index 0000000000..bfe49fb093
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/account-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/account-disable.png b/docs/docusaurus/versions/version-4.3.2/images/browser/account-disable.png
new file mode 100644
index 0000000000..f8ff994f21
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/account-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/account-edit.png b/docs/docusaurus/versions/version-4.3.2/images/browser/account-edit.png
new file mode 100644
index 0000000000..939c374f25
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/account-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/account-enable.png b/docs/docusaurus/versions/version-4.3.2/images/browser/account-enable.png
new file mode 100644
index 0000000000..ddc8cef578
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/account-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/account.png b/docs/docusaurus/versions/version-4.3.2/images/browser/account.png
new file mode 100644
index 0000000000..0aa0cd195c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/account.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/db_basic.png b/docs/docusaurus/versions/version-4.3.2/images/browser/db_basic.png
new file mode 100644
index 0000000000..b78298825b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/db_basic.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/db_configuration.png b/docs/docusaurus/versions/version-4.3.2/images/browser/db_configuration.png
new file mode 100644
index 0000000000..2de3da502c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/db_configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-button.png
new file mode 100644
index 0000000000..dd8966d0d3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-clear.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-clear.png
new file mode 100644
index 0000000000..ee5d3c92a9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-clear.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-collapse.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-collapse.png
new file mode 100644
index 0000000000..e053061834
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-collapse.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-delete.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-delete.png
new file mode 100644
index 0000000000..5aefa20c43
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand-after.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand-after.png
new file mode 100644
index 0000000000..371efb6e6b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand-after.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand-before.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand-before.png
new file mode 100644
index 0000000000..80e74174af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand-before.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand-custom.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand-custom.png
new file mode 100644
index 0000000000..bed0a73705
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand-custom.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand.png
new file mode 100644
index 0000000000..75b0caf2b9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-expand.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-fixed.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-fixed.png
new file mode 100644
index 0000000000..aac4a18573
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-fixed.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-lasso.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-lasso.png
new file mode 100644
index 0000000000..53f743925b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-lasso.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-legend-chart.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-legend-chart.png
new file mode 100644
index 0000000000..0ddb63b926
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-legend-chart.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-legend-list.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-legend-list.png
new file mode 100644
index 0000000000..07d0bf0a4c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-legend-list.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-retrieval.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-retrieval.png
new file mode 100644
index 0000000000..57eafece0e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-retrieval.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-unfix.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-unfix.png
new file mode 100644
index 0000000000..80fa2c8b72
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-canvas-unfix.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-operation-area.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-operation-area.png
new file mode 100644
index 0000000000..b251837e26
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-operation-area.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-attributefilter.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-attributefilter.png
new file mode 100644
index 0000000000..8883301d09
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-attributefilter.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-configurequery.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-configurequery.png
new file mode 100644
index 0000000000..d294a8616b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-configurequery.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-query.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-query.png
new file mode 100644
index 0000000000..b745e4d5c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-query.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png
new file mode 100644
index 0000000000..afbaf3bfd5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-statisticalfilter.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-statisticalfilter.png
new file mode 100644
index 0000000000..7c2e3b635e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-queryfilter-statisticalfilter.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-appearance-Button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-appearance-Button.png
new file mode 100644
index 0000000000..dab00330b7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-appearance-Button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-appearance.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-appearance.png
new file mode 100644
index 0000000000..330ad3128e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-appearance.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-layout-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-layout-button.png
new file mode 100644
index 0000000000..49516d6427
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-layout-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-layout-parameters.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-layout-parameters.png
new file mode 100644
index 0000000000..d02772bfd9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphanalysis-style-layout-parameters.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addedge-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addedge-button.png
new file mode 100644
index 0000000000..b38900728e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addedge-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addedge.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addedge.png
new file mode 100644
index 0000000000..39eca4a772
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addedge.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addvertex-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addvertex-button.png
new file mode 100644
index 0000000000..e616ce0f89
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addvertex-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addvertex.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addvertex.png
new file mode 100644
index 0000000000..df56d537bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-addvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-button.png
new file mode 100644
index 0000000000..abf1fab48f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-editedge.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-editedge.png
new file mode 100644
index 0000000000..eb7206b771
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-editedge.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-editvertex.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-editvertex.png
new file mode 100644
index 0000000000..eb252761bf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-editvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-exportmodel-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-exportmodel-button.png
new file mode 100644
index 0000000000..acbaa80189
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-exportmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-exportmodel.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-exportmodel.png
new file mode 100644
index 0000000000..4991dc7378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-exportmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import-csv.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import-csv.png
new file mode 100644
index 0000000000..2301c01cfc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import-csv.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import-datamapping.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import-datamapping.png
new file mode 100644
index 0000000000..5d55861a95
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import-datamapping.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import-success.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import-success.png
new file mode 100644
index 0000000000..20a48beb0f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import-success.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import.png
new file mode 100644
index 0000000000..0154bac688
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-import.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-importmodel-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-importmodel-button.png
new file mode 100644
index 0000000000..bb7822aaef
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-importmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-importmodel.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-importmodel.png
new file mode 100644
index 0000000000..252b082100
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-importmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-list-copy.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-list-copy.png
new file mode 100644
index 0000000000..ea210495fc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-list-copy.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-list-delete.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-list-delete.png
new file mode 100644
index 0000000000..aeba09b532
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-list-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-list-search.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-list-search.png
new file mode 100644
index 0000000000..9313c8eb7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-list-search.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-select.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-select.png
new file mode 100644
index 0000000000..18bfb3be74
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild-select.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild.png
new file mode 100644
index 0000000000..cd1f0bda1c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphbuild.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-configure.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-configure.png
new file mode 100644
index 0000000000..91fa18814f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-creategraph.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-deletegraph-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-deletegraph-button.png
new file mode 100644
index 0000000000..34a4efd42a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-deletegraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-editgraph-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-editgraph-button.png
new file mode 100644
index 0000000000..773798b78b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-editgraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-editgraph.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-editgraph.png
new file mode 100644
index 0000000000..f6cc706f41
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-editgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-homepage.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-homepage.png
new file mode 100644
index 0000000000..c3af5618ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-homepage.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-selecttemplate.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-selecttemplate.png
new file mode 100644
index 0000000000..8a19d8da39
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-selecttemplate.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-statistics-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-statistics-button.png
new file mode 100644
index 0000000000..cdb25ed397
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-statistics-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-statistics-refresh-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-statistics-refresh-button.png
new file mode 100644
index 0000000000..e2ec35cbe1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-statistics-refresh-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-statistics.png b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-statistics.png
new file mode 100644
index 0000000000..49db6e652f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/graphmanagement-statistics.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/login.png b/docs/docusaurus/versions/version-4.3.2/images/browser/login.png
new file mode 100644
index 0000000000..3f4109b059
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/login.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/pathquery-configuration.png b/docs/docusaurus/versions/version-4.3.2/images/browser/pathquery-configuration.png
new file mode 100644
index 0000000000..579a7d99ee
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/pathquery-configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/pathquery-result.png b/docs/docusaurus/versions/version-4.3.2/images/browser/pathquery-result.png
new file mode 100644
index 0000000000..0cd90cad46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/pathquery-result.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/pathquery-select.png b/docs/docusaurus/versions/version-4.3.2/images/browser/pathquery-select.png
new file mode 100644
index 0000000000..3c5d0f7751
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/pathquery-select.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-bookmark-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-bookmark-button.png
new file mode 100644
index 0000000000..9a6f73bf7c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-bookmark-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-bookmark.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-bookmark.png
new file mode 100644
index 0000000000..a93315ab17
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-bookmark.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-button.png
new file mode 100644
index 0000000000..cd00d7f3fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-download-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-download-button.png
new file mode 100644
index 0000000000..ec59f7a0ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-download-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-execute-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-execute-button.png
new file mode 100644
index 0000000000..6c38e68c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-execute-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-gqltips.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-gqltips.png
new file mode 100644
index 0000000000..bdabee92e7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-gqltips.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-download.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-download.png
new file mode 100644
index 0000000000..48890083fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-download.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-downloadtxt.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-downloadtxt.png
new file mode 100644
index 0000000000..3554ef592c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-downloadtxt.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-fullscreen-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-fullscreen-button.png
new file mode 100644
index 0000000000..13925db74f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-fullscreen-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-fullscreen-close.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-fullscreen-close.png
new file mode 100644
index 0000000000..2a63926742
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-fullscreen-close.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-fullscreen.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-fullscreen.png
new file mode 100644
index 0000000000..2dcf0ca0b4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-fullscreen.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-graph.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-graph.png
new file mode 100644
index 0000000000..9b3edecb5f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-insert-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-insert-button.png
new file mode 100644
index 0000000000..8879b2c4bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-insert-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-insert.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-insert.png
new file mode 100644
index 0000000000..2cd23b6e84
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-insert.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-jsontxt.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-jsontxt.png
new file mode 100644
index 0000000000..5f265cfff1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-jsontxt.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-jsonview.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-jsonview.png
new file mode 100644
index 0000000000..8a774f91c9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-jsonview.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-list.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-list.png
new file mode 100644
index 0000000000..4692c49eca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-result-list.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-schema-graph.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-schema-graph.png
new file mode 100644
index 0000000000..ccc9e3126b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-schema-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-schema-list.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-schema-list.png
new file mode 100644
index 0000000000..3649b41272
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-schema-list.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-selectgql.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-selectgql.png
new file mode 100644
index 0000000000..1ea624b81f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-selectgql.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-selectgraph.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-selectgraph.png
new file mode 100644
index 0000000000..6dc14e486d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-selectgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/query-view.png b/docs/docusaurus/versions/version-4.3.2/images/browser/query-view.png
new file mode 100644
index 0000000000..8d1884ad82
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/query-view.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-configure.png b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-configure.png
new file mode 100644
index 0000000000..166e54cb75
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-creategraph.png b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-graphtab.png b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-graphtab.png
new file mode 100644
index 0000000000..0f7980bc46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-graphtab.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-result.png b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-result.png
new file mode 100644
index 0000000000..2a2a59ce02
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-result.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-selectdemo.png b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-selectdemo.png
new file mode 100644
index 0000000000..7dda3f06b0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/quickstart-selectdemo.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/role-add-button.png b/docs/docusaurus/versions/version-4.3.2/images/browser/role-add-button.png
new file mode 100644
index 0000000000..a4590ac431
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/role-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/role-add.png b/docs/docusaurus/versions/version-4.3.2/images/browser/role-add.png
new file mode 100644
index 0000000000..8f56b24bd7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/role-add.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/role-delete.png b/docs/docusaurus/versions/version-4.3.2/images/browser/role-delete.png
new file mode 100644
index 0000000000..3c09e7caa8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/role-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/role-disable.png b/docs/docusaurus/versions/version-4.3.2/images/browser/role-disable.png
new file mode 100644
index 0000000000..eb2e355d58
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/role-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/role-edit.png b/docs/docusaurus/versions/version-4.3.2/images/browser/role-edit.png
new file mode 100644
index 0000000000..7b5db6e48c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/role-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/role-enable.png b/docs/docusaurus/versions/version-4.3.2/images/browser/role-enable.png
new file mode 100644
index 0000000000..40b7909289
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/role-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/vertexquery-criteria.png b/docs/docusaurus/versions/version-4.3.2/images/browser/vertexquery-criteria.png
new file mode 100644
index 0000000000..b5f95c3d83
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/vertexquery-criteria.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/browser/vertexquery.png b/docs/docusaurus/versions/version-4.3.2/images/browser/vertexquery.png
new file mode 100644
index 0000000000..97aa28122b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/browser/vertexquery.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-1.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-1.png
new file mode 100644
index 0000000000..c7202ff3de
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-10.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-10.png
new file mode 100644
index 0000000000..d6ed55c8bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-10.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-2.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-2.png
new file mode 100644
index 0000000000..6fc79fde54
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-3.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-3.png
new file mode 100644
index 0000000000..0e59f028c7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-4.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-4.png
new file mode 100644
index 0000000000..b606ec8bb8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-4.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-5.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-5.png
new file mode 100644
index 0000000000..18d5845ec1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-5.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-6.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-6.png
new file mode 100644
index 0000000000..d939108e3b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-6.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-7.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-7.png
new file mode 100644
index 0000000000..5c5d1800af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-7.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-8.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-8.png
new file mode 100644
index 0000000000..5beb0628b3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-8.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-9.png b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-9.png
new file mode 100644
index 0000000000..d04282d95a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/cloud-deployment-9.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/contact-en.png b/docs/docusaurus/versions/version-4.3.2/images/contact-en.png
new file mode 100644
index 0000000000..47ac8b8297
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/contact-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/contact-zh.png b/docs/docusaurus/versions/version-4.3.2/images/contact-zh.png
new file mode 100644
index 0000000000..75c49540b5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/contact-zh.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/htap-en.png b/docs/docusaurus/versions/version-4.3.2/images/htap-en.png
new file mode 100644
index 0000000000..85479ac1e1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/htap-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/htap.png b/docs/docusaurus/versions/version-4.3.2/images/htap.png
new file mode 100644
index 0000000000..c7764a3fa7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/htap.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/learn_flow_chart_en.png b/docs/docusaurus/versions/version-4.3.2/images/learn_flow_chart_en.png
new file mode 100644
index 0000000000..c9e55a52a5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/learn_flow_chart_en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/learn_flow_chart_zh.png b/docs/docusaurus/versions/version-4.3.2/images/learn_flow_chart_zh.png
new file mode 100644
index 0000000000..9977dcfb6c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/learn_flow_chart_zh.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/multi-level-Interfaces-en.png b/docs/docusaurus/versions/version-4.3.2/images/multi-level-Interfaces-en.png
new file mode 100644
index 0000000000..b7de07422c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/multi-level-Interfaces-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/multi-level-Interfaces.png b/docs/docusaurus/versions/version-4.3.2/images/multi-level-Interfaces.png
new file mode 100644
index 0000000000..2c9694a476
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/multi-level-Interfaces.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/partners/fu.png b/docs/docusaurus/versions/version-4.3.2/images/partners/fu.png
new file mode 100644
index 0000000000..a238d3a5ce
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/partners/fu.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/partners/hust.png b/docs/docusaurus/versions/version-4.3.2/images/partners/hust.png
new file mode 100644
index 0000000000..e1219f932b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/partners/hust.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/partners/oceanbase.png b/docs/docusaurus/versions/version-4.3.2/images/partners/oceanbase.png
new file mode 100755
index 0000000000..978297d9bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/partners/oceanbase.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/partners/secretflow.png b/docs/docusaurus/versions/version-4.3.2/images/partners/secretflow.png
new file mode 100644
index 0000000000..d386ce72fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/partners/secretflow.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/partners/whaleops.png b/docs/docusaurus/versions/version-4.3.2/images/partners/whaleops.png
new file mode 100644
index 0000000000..7ace477cf4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/partners/whaleops.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/partners/zju.png b/docs/docusaurus/versions/version-4.3.2/images/partners/zju.png
new file mode 100644
index 0000000000..704f0bb867
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/partners/zju.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/round-the-world/flight_page.jpg b/docs/docusaurus/versions/version-4.3.2/images/round-the-world/flight_page.jpg
new file mode 100644
index 0000000000..bd296766c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/round-the-world/flight_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/round-the-world/main_page.jpg b/docs/docusaurus/versions/version-4.3.2/images/round-the-world/main_page.jpg
new file mode 100644
index 0000000000..2edc617c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/round-the-world/main_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/round-the-world/search_example.jpg b/docs/docusaurus/versions/version-4.3.2/images/round-the-world/search_example.jpg
new file mode 100644
index 0000000000..154d387721
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/round-the-world/search_example.jpg differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/spatail/EPSG_4326.png b/docs/docusaurus/versions/version-4.3.2/images/spatail/EPSG_4326.png
new file mode 100644
index 0000000000..fa614811a4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/spatail/EPSG_4326.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/spatail/EPSG_7203.png b/docs/docusaurus/versions/version-4.3.2/images/spatail/EPSG_7203.png
new file mode 100644
index 0000000000..9fd0c427ea
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/spatail/EPSG_7203.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/spatail/WKB.png b/docs/docusaurus/versions/version-4.3.2/images/spatail/WKB.png
new file mode 100644
index 0000000000..f68bf49a39
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/spatail/WKB.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/spatail/createFoodData.png b/docs/docusaurus/versions/version-4.3.2/images/spatail/createFoodData.png
new file mode 100644
index 0000000000..7240556dd8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/spatail/createFoodData.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/spatail/createLineTestData.png b/docs/docusaurus/versions/version-4.3.2/images/spatail/createLineTestData.png
new file mode 100644
index 0000000000..0f9d73e09c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/spatail/createLineTestData.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/spatail/createVertexLabel.png b/docs/docusaurus/versions/version-4.3.2/images/spatail/createVertexLabel.png
new file mode 100644
index 0000000000..83f855c460
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/spatail/createVertexLabel.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/spatail/createVertexLabel_PolygonTest.png b/docs/docusaurus/versions/version-4.3.2/images/spatail/createVertexLabel_PolygonTest.png
new file mode 100644
index 0000000000..d22ff426c2
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/spatail/createVertexLabel_PolygonTest.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/spatail/createVertexLabel_lineTest.png b/docs/docusaurus/versions/version-4.3.2/images/spatail/createVertexLabel_lineTest.png
new file mode 100644
index 0000000000..0138cade8a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/spatail/createVertexLabel_lineTest.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/spatail/querryFood.png b/docs/docusaurus/versions/version-4.3.2/images/spatail/querryFood.png
new file mode 100644
index 0000000000..aab7646564
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/spatail/querryFood.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-body-cypher1.png b/docs/docusaurus/versions/version-4.3.2/images/three-body-cypher1.png
new file mode 100644
index 0000000000..3f85fd8412
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-body-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-body-cypher2.png b/docs/docusaurus/versions/version-4.3.2/images/three-body-cypher2.png
new file mode 100644
index 0000000000..41f0f914cc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-body-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-body-cypher3.png b/docs/docusaurus/versions/version-4.3.2/images/three-body-cypher3.png
new file mode 100644
index 0000000000..4776f26d77
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-body-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-body-data.png b/docs/docusaurus/versions/version-4.3.2/images/three-body-data.png
new file mode 100644
index 0000000000..1913b39cbc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-body-data.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher1.png b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher1.png
new file mode 100644
index 0000000000..4b5745b96d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher2.png b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher2.png
new file mode 100644
index 0000000000..fef4592cf3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher3.png b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher3.png
new file mode 100644
index 0000000000..c0790d5d7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher4.png b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher4.png
new file mode 100644
index 0000000000..49a6498d4a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher4.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher5.png b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher5.png
new file mode 100644
index 0000000000..5d3cc55cdf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-cypher5.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-schema.png b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-schema.png
new file mode 100644
index 0000000000..24aebca93a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/three-kingdoms-schema.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/tugraph-datax.png b/docs/docusaurus/versions/version-4.3.2/images/tugraph-datax.png
new file mode 100644
index 0000000000..c2968c0c38
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/tugraph-datax.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/wandering-earth-1.png b/docs/docusaurus/versions/version-4.3.2/images/wandering-earth-1.png
new file mode 100644
index 0000000000..955c565303
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/wandering-earth-1.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/wandering-earth-2.png b/docs/docusaurus/versions/version-4.3.2/images/wandering-earth-2.png
new file mode 100644
index 0000000000..9cb17764ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/wandering-earth-2.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/wandering-earth-3.png b/docs/docusaurus/versions/version-4.3.2/images/wandering-earth-3.png
new file mode 100644
index 0000000000..c6dabbec97
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/wandering-earth-3.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/what-is-graph-en.png b/docs/docusaurus/versions/version-4.3.2/images/what-is-graph-en.png
new file mode 100644
index 0000000000..53d5ba05ca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/what-is-graph-en.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/images/what-is-graph.png b/docs/docusaurus/versions/version-4.3.2/images/what-is-graph.png
new file mode 100644
index 0000000000..6f3aa196fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.3.2/images/what-is-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.3.2/requirements.txt b/docs/docusaurus/versions/version-4.3.2/requirements.txt
new file mode 100644
index 0000000000..0201af0943
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/requirements.txt
@@ -0,0 +1,5 @@
+sphinx
+myst-parser
+sphinx-panels
+sphinx-rtd-theme
+breathe
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/.readthedocs.yaml b/docs/docusaurus/versions/version-4.3.2/zh-CN/.readthedocs.yaml
new file mode 100644
index 0000000000..5b91d3cd6c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/zh-CN/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/Makefile b/docs/docusaurus/versions/version-4.3.2/zh-CN/Makefile
new file mode 100644
index 0000000000..d0c3cbf102
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?=
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/make.bat b/docs/docusaurus/versions/version-4.3.2/zh-CN/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/1.guide.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/1.guide.md
new file mode 100644
index 0000000000..3da03232df
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/1.guide.md
@@ -0,0 +1,74 @@
+# 文档地图
+
+> 这里是文档地图，帮助用户快速学习和使用TuGraph社区版。
+
+## 快速上手
+
+> 可以先了解[什么是图](./2.introduction/1.what-is-graph.md)、图[可以做什么](./2.introduction/8.scenarios.md)、以及[什么是TuGraph](./2.introduction/3.what-is-tugraph.md)。
+
+> 基于[阿里云计算巢](5.installation&running/5.cloud-deployment.md)或[Docker方式](5.installation&running/3.docker-deployment.md)快速部署TuGraph。
+
+> 通过产品内置的场景上手体验：[电影](./3.quick-start/2.demo/1.movie.md)、[流浪地球](./3.quick-start/2.demo/2.wandering-earth.md)、[三体](./3.quick-start/2.demo/3.the-three-body.md)、[三国](./3.quick-start/2.demo/4.three-kingdoms.md)。
+
+> 可视化操作手册看这里：[可视化操作手册](./4.user-guide/1.tugraph-browser.md)、[可视化操作手册（旧版）](./4.user-guide/2.tugraph-browser-legacy.md)。
+
+## 开发指南
+
+> 通过客户端访问TuGraph：[Bolt Client](7.client-tools/5.bolt-client.md)
+
+> 查询语言、语句创建图模型看这里：[Cypher API](8.query/1.cypher.md).
+
+> 存储过程和算法介绍看这里：[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md)。
+
+> C++/Python开发存储过程接口看这里：[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## 参与社区贡献
+
+> 在开始贡献前，可以先了解[如何贡献](12.contributor-manual/1.contributing.md)
+
+> 如果想了解社区角色的划分，请访问[社区角色](12.contributor-manual/2.community-roles.md)
+
+## 主要仓库
+
+> TuGraph-DB 仓库: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> 可视化界面: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> 基于twitter数据的简单测试方法: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> 基于标准LDBC-SNB的测试方法: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics 仓库: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## 视频中心
+
+> [TuGraph快速上手](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph技术分享集合](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [3分钟读懂图计算](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph最新版本
+
+| 描述                  | 文件                                         | 链接                                                                                                                                                                                              |
+|---------------------|--------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 安装包         | tugraph-4.3.1-1.el7.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-4.3.1-1.el7.x86_64.rpm) |
+| CentOS8 安装包         | tugraph-4.3.1-1.el8.x86_64.rpm             | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-4.3.1-1.el8.x86_64.rpm) |
+| Ubuntu18.04 安装包     | tugraph-4.3.1-1.x86_64.deb                 | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-4.3.1-1.x86_64.deb)  |
+| CentOS7 预安装镜像       | tugraph-runtime-centos7-4.3.1.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-runtime-centos7-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                   |
+| CentOS8 预安装镜像       | tugraph-runtime-centos8-4.3.1.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-runtime-centos8-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos8)                   |
+| Ubuntu18.04 预安装镜像   | tugraph-runtime-ubuntu18.04-4.3.1.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-runtime-ubuntu18.04-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-ubuntu18.04)           |
+| CentOS7 精简安装包       | tugraph-mini-4.3.1-1.el7.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-4.3.1-1.el7.x86_64.rpm)                                                                                 |
+| CentOS8 精简安装包       | tugraph-mini-4.3.1-1.el8.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-4.3.1-1.el8.x86_64.rpm)                                                                                 |
+| Ubuntu18.04 精简安装包   | tugraph-mini-4.3.1-1.x86_64.deb            | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-4.3.1-1.x86_64.deb)                                                                                     |
+| CentOS7 精简预安装镜像     | tugraph-mini-runtime-centos7-4.3.1.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-runtime-centos7-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos7)         |
+| CentOS8 精简预安装镜像     | tugraph-mini-runtime-centos8-4.3.1.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-runtime-centos8-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-centos8)         |
+| Ubuntu18.04 精简预安装镜像 | tugraph-mini-runtime-ubuntu18.04-4.3.1.tar | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.3.1/tugraph-mini-runtime-ubuntu18.04-4.3.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-mini-runtime-ubuntu18.04) |
+| CentOS7 编译镜像        | tugraph-compile-centos7-1.3.2.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.3.2.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)          |
+| CentOS8 编译镜像        | tugraph-compile-centos8-1.3.2.tar          | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.3.2.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)          |
+| Ubuntu18.04 编译镜像    | tugraph-compile-ubuntu18.04-1.3.2.tar      | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.3.2.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04)  |
+
+
+版本更新日志见：[链接](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md )。
+
+如果您不清楚使用安装包和镜像，请参考 [环境和版本选择](13.best-practices/4.selection.md)。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..bb808b54b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/1.privilege.md
@@ -0,0 +1,138 @@
+# 用户权限
+
+## 1.介绍
+
+> TuGraph 的权限是基于角色的访问控制进行管理，定义访问控制的权限分配给角色，角色再分配给用户。
+
+## 2.权限层级
+
+- Global 层：即全局权限，对管理、图操作均有权限；
+- Graph 层：即图级别，对每个图的权限；
+- （仅商业化版本支持）Property 层：即属性级别，对某个属性的权限控制
+
+## 3.权限关键字
+
+目前权限的控制较为简洁
+
+- Global 层目前为 admin 权限，并且预置了 admin 用户；
+
+* Graph 层的操作权限分为四种：none，read，write，full
+  - none：无权限，对于图没有任何操作权限
+  - read：只读权限，对于图只具备读取权限
+  - write：读写权限，对于图不仅具备读取权限，还具备了写入的权限
+  - full：所有权限，对于图不仅具备读写权限，同时也具备删除图、修改图、修改 Schema 等权限
+* （仅商业化版本支持）Property 层的权限分别为：none，read，write
+  - none：无权限，对于该属性没有任何操作权限
+  - read：只读权限，对于该属性只具备读取权限
+  - write：读写权限，对于该属性不仅具备读取权限，还具备了写入的权限
+
+## 4.常用权限操作
+
+### 4.1.用户操作
+
+- 创建用户
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- 删除用户
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- 修改当前用户密码
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- 修改指定用户密码
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- 禁用/启用用户
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- 列出所有用户
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- 列出当前用户信息
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- 获取用户详情
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.角色操作
+
+- 创建角色
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- 删除角色
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- 列出所有角色
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- 禁用/启用角色
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.赋予用户角色
+
+- 新增用户与角色的联系
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- 删除用户与角色的联系
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- 清空用户角色的关系并重建
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.角色赋权
+
+- 修改角色对指定图的访问权限
+
+```cypher
+CALL dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP)
+```
+
+示例
+
+```cypher
+CALL dbms.security.modRoleAccessLevel("test_role", {test_graph1:"FULL", test_graph2:"NONE"})
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/2.token.md
new file mode 100644
index 0000000000..02e265cf23
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/2.token.md
@@ -0,0 +1,50 @@
+# Token使用说明
+
+## 1.Token介绍
+JWT（JSON Web Token）是一种用于认证和授权的开放标准。它基于JSON（JavaScript Object Notation）格式，并被设计用于在网络应用之间安全地传输声明（claims）信息。
+
+JWT由三部分组成：头部（Header）、负载（Payload）和签名（Signature）。头部包含了JWT的类型以及所使用的签名算法，负载包含了需要传输的信息，而签名用于验证JWT的完整性和真实性。
+
+在TuGraph中，JWT用于实现无状态的认证和授权机制。当用户登录成功后，服务端会生成一个JWT并将其返回给客户端。客户端在后续的请求中将这个JWT作为身份凭证传递给服务端。服务端收到JWT后，通过验证签名和解析负载中的信息，判断用户的身份和权限，并决定是否允许该请求的执行。
+
+## 2. Token有效期
+
+### 2.1. 浏览器Token交互逻辑
+1. 用户打开浏览器，输入账号密码，并点击登录。
+2. 前端调用登录接口，向后端输入账号和密码。
+3. 后端接收到账号密码后，进行校验，校验成功后，返回Token。
+4. 前端将Token存储在浏览器缓存中，后续请求都要携带此Token。
+5. 如果前端，主动点击登出和关闭页面，前端应主动调用登出接口，向后端传递Token。
+6. 后端接收后，将Token失效，返回状态码200，以及“等出成功”。前端接收到信息后，清空浏览器内存中的Token，并将页面退至登录页。
+7. Token失效（初始设置为24小时），需要用户重新登录。
+
+### 2.3. Token有效期刷新机制
+
+Token有效期存在刷新机制，默认关闭。如果打开后，Token的安全性会更高，实现上则存在两个时间戳。
+
+第一个时间戳`refresh_time`用于判定Token是否过期（默认24小时）：过期后可以调用刷新接口获取新的Token，可以设置为更短的时间，比如1小时。
+
+第二个时间戳`expire_time`为强制过期时间戳（默认24小时）：过期后必须重新登陆。
+
+### 2.4. Token有效期修改
+为了方便开发者自行开发，TuGraph提供了两种方式修改有效期，均需要admin权限。
+
+* 通过接口调用设置。涉及有效期修改的接口`update_token_time`和有效期查询接口`get_token_time`。
+具体可查询[REST接口文档](../7.client-tools/9.restful-api-legacy.md)。
+
+* 通过启动参数设置。server端启动时，添加参数`-unlimited_token 1` 参数可以设置为无期限。可参考[服务运行文档](../5.installation&running/7.tugraph-running.md)。
+
+## 3. 客户端发送Token相关请求介绍
+
+客户端会两种协议处理相关请求，一种是REST，一种是RPC。
+
+### 3.1. REST
+如果客户端使用REST协议（包括Browser浏览器），由于是短链接，在每一次请求中都需要携带Token，过期后需要获取新的Token。
+
+对于自行开发的客户端，若采用REST协议则需要考虑Token的逻辑。
+
+### 3.2. RPC
+如果客户端使用RPC协议（包括官方的C++/Java/Python），使用长连接保持，登陆后不涉及Token操作。
+
+## 4. Token上限
+Token上限是指一个用户最多可以同时拥有的Token数量。为防止无限登陆，Token上限默认为10000。由于Token生成逻辑和时间强相关，每登录一次会生成一个Token进行存储，Token有效期默认为24小时，因此建议登录后不使用的Token及时登出。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..245d6075bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,19 @@
+# 忘记'admin'密码
+> TuGraph 提供了重置密码的功能，当用户忘记管理者账号`admin`密码时，可以通过重置密码的方式来修改密码。
+
+## 1.重置密码
+首先，需要停止TuGraph服务端。再次启动TuGraph服务端时，需要添加如下参数：
+
+```bash
+--reset_admin_password 1
+```
+
+如下所示：
+```bash
+./lgraph_server -c lgraph_standalone.json --reset_admin_password 1 --log_dir ""
+```
+
+这一操作可以使得TuGraph服务端在启动时，重置管理者`admin`的密码为默认密码：`73@TuGraph`。
+密码重置成功会给出相关信息“Reset admin password successfully”并关闭当前服务端进程。
+
+用户需要以正常模式重新启动服务端，然后使用默认账号密码进行登录，登录后重新设置密码即可正常使用。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..b79cc13cc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/4.monitoring.md
@@ -0,0 +1,1020 @@
+# 运维监控
+
+> 此文档主要介绍 TuGraph 的可视化运维监控
+
+## 1.设计思路
+
+可视化监控并不是TuGraph自身不可或缺的一部分，因此在设计时将可视化监控作为TuGraph周边生态中的一个应用，来减少和TuGraph数据库的耦合度，以及对于TuGraph自身的影响。TuGraph可视化监控采用目前最火热的开源解决方案，TuGraph Monitor + Prometheus + Grafana来实现。其中TuGraph Monitor作为TuGraph服务的客户端，通过TCP链接向TuGraph服务发起Procedure请求，TuGraph服务在接收到请求后收集自身所在机器的cpu，memory，disk，io，以及请求数量等指标的统计结果进行响应。TuGraph Monitor在接收到TuGraph响应的指标数据后，将数据包装成prometheus需要的格式，保存在内存中，等待Prometheus服务通过http请求获取。Prometheus服务会定期通过http请求从TuGraph Monitor获取封装好的请求数据，按照获取的时间保存在自己的时序数据库中。Grafana可以根据用户的配置，从Prometheus处获取某个时间段内的统计数据，并在web界面上绘制浅显易懂的图形来展示最终结果。整个请求链路中，都采用了主动获取，即PULL的模型，好处之一是它能最大限度的避免数据生产者和数据消费者之间的耦合度，使得开发更简单，好处之二是数据生产者不需要考虑数据消费者的数据处理能力，即使某个消费者的数据处理能力较弱，也不会因为生产者生产数据过快而压垮消费者。主动拉取模型的不足之处在于数据的实时性不够，但在这个场景中，数据并没有很高的实时性要求。
+
+### 1.1.TuGraph
+
+TuGraph数据库提供了收集服务所在机器中磁盘，内存，网络IO，以及查询请求等多种数据信息的能力，并通过标准Procedure方式提供查询。收集数据这一动作仅在有用户通过接口查询时才会发生，避免了在用户不需要TuGraph监控服务所在机器的指标时对用户业务查询请求带来的影响。
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor是TuGraph周边生态中的一个工具，它作为TuGraph众多用户中的一个，通过C++ RPC Client与TuGraph进行通信，通过Procedure查询接口来查询TuGraph服务所在机器的性能指标，并将TuGraph返回的结果包装成Prometheus需要的数据模型，等待Prometheus获取。用户可以通过设置查询时间间隔来保证获取监控指标对于业务查询的影响最小化。
+
+### 1.3.Prometheus
+
+Prometheus是一个开源的监控平台，并配备有专属的时序数据库，它会定期通过http请求从TuGraph Monitor服务获取统计指标，并保存在自己的时序数据库中。详细信息请参考官网: [https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana是一个开源的可视化和分析软件，它可以从包含Prometheus在内的多个数据源中获取数据，并且可以将时序数据库中的数据转换为精美图形和可视化效果的工具。具体信息请参考官网: [https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.部署方案
+
+### 2.1.第一步
+
+启动TuGraph服务，详细方法请参考文档: [https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.第二步
+
+启动TuGraph Monitor工具，启动命令如下：
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+参数含义如下
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.第三步
+
++ 下载符合您机器架构以及系统版本的Prometheus tar包，下载地址: [https://prometheus.io/download/](https://prometheus.io/download/)
+
++ 解压tar包，命令如下
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ 修改配置文件prometheus.yml，新增如下配置，使其可以抓取TuGraph Monitor包装好的性能数据
+
+```yaml
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ 启动prometheus，具体的启动参数可以通过如下命令获取
+
+```shell
+./prometheus -h
+```
+
++ 验证prometheus服务是否正常，可以通过web端登陆prometheus服务，查询监控指标resources_report是否已经获取到，能成功查询到数据则正确
+
+### 2.4.第四步
+
++ 下载符合您机器架构以及系统版本的Grafana安装包，下载地址: [https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ 安装Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 启动Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 配置Grafana，首先在数据源设置中配置Prometheus的IP地址，配置完成后可以通过测试连接功能，验证是否成功连接数据源。然后，导入如下模版，并在页面中根据实际情况，修改正确的接口IP和端口。最后可以根据实际情况设置刷新时间和监控时间范围
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana"
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {label_name} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "内存",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  QPS超过1000",
+        "name": "请求统计 alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "请求统计",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "磁盘",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\nCPU使用率超过90%",
+        "name": "CPU使用率 alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU使用率",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  磁盘IO超过10MB/S",
+        "name": "磁盘IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph监控页面",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+验证效果，刷新浏览器页面。如果正确显示饼图和折线图，则配置完成。
+
+## 3.未来计划
+
+目前可视化监控只支持单机监控，能监控服务所在机器的cpu，磁盘，网络io，请求qps等性能指标，未来将会实现监控ha集群的功能，也会将更多有意义的指标纳入监控范围
+
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/5.log.md
new file mode 100644
index 0000000000..519b3d675f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# 日志信息
+
+> 此文档主要介绍 TuGraph 的日志功能。
+
+## 1.简介
+
+TuGraph 保留两种类型的日志：服务器日志和审计日志。服务器日志记录人为可读的服务器状态信息，而审核日志维护服务器上执行的每个操作加密后的信息。
+
+## 2.服务器日志
+
+### 2.1.服务器日志配置项
+
+服务器日志的输出位置可以通过`log_dir`配置指定。服务器日志详细程度可通过`verbose`配置项指定。
+
+`log_dir`配置项默认为空。若`log_dir`配置项为空，则所有日志会输出到控制台(daemon模式下若log_dir配置项为空则不会向console输出任何日志)；若手动指定`log_dir`配置项，则日志文件会生成在对应的路径下面。单个日志文件最大大小为256MB。
+
+`verbose`配置项控制日志的详细程度，从粗到细分为`0, 1, 2`三个等级，默认等级为`1`。等级为`2`时，日志记录最详细，服务器将打印`DEBUG`及以上等级的全部日志信息；等级为`1`时，服务器将仅打印`INFO`等级及以上的主要事件的日志；等级为`0`时，服务器将仅打印`ERROR`等级及以上的错误日志。
+
+### 2.2.服务器日志输出宏使用示例
+
+如果开发者在开发过程中希望在代码中添加日志，可以参考如下示例
+
+```
+#include "tools/lgraph_log.h" //添加日志依赖
+
+
+void LogExample() {
+    // 数据库启动阶段已经对日志模块进行了初始化，开发者只需直接调用宏即可
+    // 日志等级分为DEBUG, INFO, WARNING, ERROR, FATAL五个等级
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+更多用法可以参考test/test_lgraph_log.cpp中的日志宏的使用方法
+
+### 2.3.存储过程日志
+
+用户在存储过程的编写过程中可以使用日志功能将所需的调试信息输出到日志中进行查看，辅助开发。调试信息会输出到与服务器日志相同的日志文件中(如未指定`log_dir`则同样输出至console)
+
+#### 2.3.1.cpp存储过程
+请使用2.2中提供的log宏输出调试信息，避免使用cout或者printf等输出方式。具体使用方式可参考如下示例代码（详见`procedures/demo/log_demo.cpp`）
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+将以上示例代码作为存储过程插入数据库并运行后，可以在日志文件中看到相应的日志条目。
+
+#### 2.3.1.python存储过程
+请使用python自带的print输出调试信息，调试信息会在存储过程运行结束后合并为一条WARN等级的日志条目输出至日志文件中。
+
+## 3.审计日志
+
+审核日志记录每个请求和响应，以及发送请求的用户以及收到请求的时间。审核日志只能是打开或关闭状态。可以使用 TuGraph 可视化工具和 REST API 查询结果。
+
+开启审计日志需要在配置文件中将`enable_audit_log`参数设置为`true`。配置文件和配置参数说明详见：[数据库运行/服务配置](../../5.installation&running/7.tugraph-running.md)。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/index.rst
new file mode 100644
index 0000000000..f8e9db5345
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+运维与权限管理
+================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..ff3fcd8048
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# 单元测试
+
+> 该文档是TuGraph的单元测试文档
+
+## 1.简介
+
+TuGraph单元测试采用gtest框架，可以选择一次跑全部test或者制定某些test。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..5d49f35255
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/11.quality/2.integration-testing.md
@@ -0,0 +1,399 @@
+# 集成测试
+
+> 此文档主要介绍 TuGraph 的集成测试框架如何使用
+
+## 1.TuGraph集成测试的意义
+
+在单元测试与功能测试中，有部分用例直接开启galaxy或statemachine来进行测试，这并不是一个完整的流程。在完整的cs架构中，用户请求是通过客户端发往服务端，网络通信是必不可少的，为了避免单元测试不完整带来的bug，针对这种情况，使用集成测试框架进行全链路的完整测试。
+
+## 2.TuGraph集成测试框架
+
+TuGraph采用pytest框架作为自己的集成测试框架，pytest框架作为目前使用最广泛的cs端集成测试框架，以其灵活简单，容易上手，并且支持参数化的使用方式而著称，TuGraph基于pytest提供的功能，抽象出了不同的工具，通过参数来控制各个工具的处理逻辑，以方便大家进行高效的测试代码开发。
+
+更多pytest信息请参考官网: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.组件描述
+
+| 组件名称            | 组件功能                       | 实现方式                                  |
+|-----------------|----------------------------|---------------------------------------|
+| server          | TuGraph单机服务                | 开启子进程并在子进程中启动服务                       |
+| client          | TuGraph Rpc Client         | 当前进程中开启TuGraph Python Rpc Client发送请求  |
+| importor        | TuGraph Importor           | 开启子进程并在子进程中处理导入请求                     |
+| exportor        | TuGraph Exportor           | 开启子进程并在子进程中处理导出请求                     |
+| backup_binlog   | TuGraph Backup Binlog      | 开启子进程并在子进程中处理备份binlog的请求              |
+| backup_copy_dir | TuGraph Backup             | 开启子进程并在子进程中处理备份完整db的请求                |
+| build_so        | 编译c++动态连接库的组件              | 开启子进程并在子进程中处理gcc编译逻辑                  |
+| copy_snapshot   | TuGraph Copy Snapshot      | 当前进程中处理备份snapshot的请求                  |
+| copydir         | 文件夹拷贝                      | 当前进程中处理文件夹拷贝请求                        |
+| exec            | 执行c++/java可执行文件            | 开启子进程并在子进程中启动C++可执行文件                 |
+| algo            | 执行算法                       | 开启子进程并在子进程中执行算法                       |
+| bash            | 执行bash命令                   | 开启子进程并在子进程中执行bash命令                   |
+| rest            | TuGraph Python Rest Client | 当前进程中开启TuGraph Python Rest Client发送请求 |
+
+### 2.2.组件用法
+
+#### 2.2.1.server
+
+##### 2.2.1.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动server，函数执行完成后会停止server，并清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.启动参数
+采用python字典传入
++ host是TuGraph Server的ip和端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导入不同的数据，函数开始执行前会导入数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导出不同的数据，函数开始执行前会导出数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的binlog，函数开始执行前会拷贝binlog到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的db，函数开始执行前会拷贝db到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.启动参数
+采用python字典传入
++ cmd是启动命令，采用python列表传入，可以一次编译多个so
++ so_name是执行完成后需要清理的so，可以是多个，通过python列表传入
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制编译不同的so，函数开始执行前会生成so到指定的目录，函数执行完成后会清理so_name列表指定的动态库
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的snapshot，函数开始执行前会拷贝src中的snapshot到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的目录，函数开始执行前会拷贝src到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的命令
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ result是算法预期的执行结果，执行完成会通过实际结果与预期结果进行比较，不同则测试失败
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的算法逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的算法，函数主体等待算法执行完成后对比结果
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的bash命令，函数开始执行前会开启子进程执行通过cmd参数传入的bash命令，函数主体等待算法执行完成
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.启动参数
+采用python字典传入
++ port是TuGraph Server的端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来链接不同的TuGraph Rest Server，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.测试样例
+
+#### 2.3.1.rest
+
+样例代码中在test_get_info函数执行之前先启动server，server启动后启动了rest client，进入test_get_info函数后获取server的一些信息，并通过assert判断是否有获取到cpu的信息。
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+样例代码中在test_flushdb函数执行之前先执行了数据离线导入逻辑，并启动server后，通过client创建链接，进入test_flushdb函数后，通过查询点的个数判断导入是否成功，导入成功后执行flushDB操作，再次通过assert判断是否能正常清空db
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+     assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+样例代码中在test_export_default函数执行之前先执行了数据离线导入逻辑，导入成功后将当前db的数据导出，然后再次通过离线导入逻辑将exportor导出的数据导入到新的目录中，以新导入的数据启动db，并且创建链接。在test_export_default函数主体中判断导出后再次导入的数据是否与原始数据一致
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.其他测试
+更多用例请参考集成测试代码 [https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration)
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/11.quality/index.rst
new file mode 100644
index 0000000000..9b190aa284
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+测试与质量保障
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..18c9c1daec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,91 @@
+# 如何贡献
+
+## 1. 前言
+感谢您为TuGraph做出贡献，我们由衷地希望有更多社区的同学加入进来，一起建设一个更好的图数据库项目。
+
+对于优秀社区贡献者，我们将颁发TuGraph优秀社区贡献者证书。
+
+## 2. 贡献什么
+我们随时都欢迎任何贡献，无论是简单的错别字修正，BUG 修复还是增加新功能。请踊跃提出问题或发起 PR。我们同样重视文档以及与其它开源项目的整合，欢迎在这方面做出贡献。
+对于任何修改，尤其是较为复杂的修改，建议新建一个issue ，按照BUG或者PR的模板填写。
+
+## 3. 准备工作
+
+### 3.1. 了解TuGraph
+
+建议您从[文档地图](../1.guide.md)开始，了解TuGraph的特性和接口。
+
+### 3.2. 准备环境
+
+对于文档贡献，可以直接通过[文档](https://tugraph-db.readthedocs.io/zh_CN/latest)，点击右上角的"在GitHub上编译"直接修改并提PR。
+
+对于代码贡献，通常需要在搭建编译执行的环境，可以采用[Docker部署](../5.installation&running/3.docker-deployment.md)或[本地部署](../5.installation&running/4.local-package-deployment.md)。
+
+### 3.3. 许可协议
+
+在贡献代码之前，请您稍微花一些时间了解为TuGraph贡献代码的流程，并阅读 [个人贡献者许可协议](3.individual-cla.md) 或 [公司贡献者许可协议](4.corporate-cla.md)，参与贡献则视为同意上述协议。
+
+## 4. 贡献代码流程
+### 4.1. 提交issue
+不论您是修复 TuGraph 的 bug 还是新增 TuGraph 的功能，在您提交代码之前，请在 TuGraph 的 GitHub 上提交一个 issue，描述您要修复的问题或者要增加的功能。这么做有几个好处:
+
+- 不会与其它开发者或是他们对这个项目的计划发生冲突，产生重复工作。
+- TuGraph 的维护人员会对您提的 bug 或者新增功能进行相关讨论，确定该修改是不是必要，有没有提升的空间或更好的办法。
+- 在达成一致后再开发，并提交代码，减少双方沟通成本，也减少 pull request 被拒绝的情况。
+### 4.2. 获取源码
+要修改或新增功能，在提交 issue 后，fork一份 TuGraph  Master代码到您的代码仓库。
+### 4.3. 拉分支
+TuGraph 所有修改都在分支上进行，修改完成后提交 pull request，在 Code Review 后由项目维护人员 Merge 到 Master。 因此，在获取源码步骤介绍后，您需要:
+
+1. 下载代码到本地，这一步您可以选择git/https方式，近年github的权限要求更加严格，比如git方式需要更复杂的ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent))，https方式不能直接使用用户名密码验证，请按照指引授权。 git clone https://github.com/您的账号名/tugraph-db
+2. 拉分支准备修改代码:
+git branch add_xxx_feature 
+3. 执行完上述命令后，您的代码仓库就切换到相应分支了。执行如下命令可以看到您当前分支: git branch -a 
+4. 如果您想切换回 Master，执行下面命令: git checkout -b master
+5. 如果您想切换回分支，执行下面命令: git checkout -b "branchName"
+
+### 4.4. 编译运行
+
+代码的编译运行流程可以参考[ci脚本](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. 配置 Github 信息
+在您的机器执行 git config  --list ，查看 git 的全局用户名和邮箱。检查显示的 user.name 和 user.email 是不是与自己 github 的用户名和邮箱相匹配。
+
+如果公司内部有自己的 gitlab 或者使用了其他商业化的 gitlab，则可能会出现不匹配的情况。这时候，您需要为 TuGraph DB 项目单独设置用户名和邮箱。设置用户名和邮箱的方式请参考 github 官方文档。
+
+### 4.6. 修改代码提交到本地
+
+拉完分支后，就可以修改代码了。
+
+**修改代码注意事项 **
+
+代码⻛格保持一致：TuGraph 通过 cpplint 来保持代码格式一致，IDE可以通过.clang来配置风格。在提交代码前，务必本地检查代码风格，否则ACI将报错。
+
+补充单元测试代码：新有修改应该通过已有的单元测试,应该提供新的单元测试来证明以前的代码存在 bug，而新的代码已经解决了这些 bug ,您可以用如下命令运行所有测试: ./unit_test
+也可以通过IDE来辅助运行。
+
+**其它注意事项 **
+
+请保持您编辑的代码的原有⻛格，尤其是空格、换行等。 对于无用的注释，请直接删除。 对逻辑和功能不容易被理解的地方添加注释。 及时更新文档。 修改完代码后，请按照如下格式执行命令提交所有的修改到本地:
+git commit -am '(feat) 添加xx功能' git commit -am '(fix) 修复xx问题'`
+
+### 4.7. 提交代码到远程仓库
+在代码提交到本地后，接下来就可以与远程仓库同步代码了，执行如下命令提交本地修改到 github 上: git push origin "branchname"
+
+如果前面您是通过 fork 来做的，那么这里的 origin 是 push 到您的代码仓库，而不是 TuGraph 的代码仓库。
+
+提交合并代码到 Master 的请求 在的代码提交到 GitHub 后，您就可以发送请求来把您改好的代码合入 TuGraph Master 代码了。此时您需要进入您在 GitHub 上的对应仓库，按右上⻆的 pull request 按钮。选择目标分支，一般就是 master，系统会通知 TuGraph 的人员， TuGraph 人员会 Review 您的代码，符合要求后就会合入主干，成为 TuGraph 的一部分。 
+
+请注意会自动检查CI，以及所有Commits中的贡献者是否签署了cla，通过后会有绿色的标识。
+
+### 4.8. 代码 Review
+
+在您提交代码后，您的代码会被指派给维护人员 Review，请耐心等待。如果两个工作日后，仍然没有人对您的提交给予任何回复，可以在 PR 下面留言，并 @ 对应的人员。
+
+对于代码 Review 的意⻅会直接备注到到对应 PR 或者 Issue。如果觉得建议是合理的，也请您把这些建议更新到您的代码中。
+
+### 4.9. 合并代码到Master
+
+在代码 Review 通过后，就由 TuGraph 维护人员操作合入 Master，在此过程中维护人员可能会指定新的Reviewer，提出新的意见需要修改。一般这一步不用参与，代码合并之后，您会收到合并成功的提示。
+
+
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..109a1d8f04
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,57 @@
+# 社区角色
+
+## 1. 前言
+本文档描述 TuGraph 社区中成员身份的⻆色，对每种⻆色的要求及权限。 
+
+## 2. ⻆色摘要
+
+这是 TuGraph 社区的⻆色划分，描述了每种⻆色的职责，成为某种⻆色并保持该⻆色的要求，以及相应⻆色的权限。
+
+TuGraph 社区参照 Apache 规范划分为以下三种⻆色：
+
+- Contributor 
+- Maintainer 
+- PMC 
+
+以下描述了每种⻆色的要求、职责和权限。 		 						 					
+## 3. Contributor
+### 3.1. 要求
+在 TuGraph 的任何一个正式项目中成功提交一个 PR 并合并。 
+### 3.2. 职责
+
+- 积极响应指派给您的 Issue 或 PR
+- 一起帮忙回复 Issue 或 PR，把 Issue 分配给对应模块的负责人
+### 3.3. 权限
+
+- 加入 TuGraph GitHub 组织，成为 TuGraph 开源社区的一员。 
+## 4. Maintainer
+### 4.1. 要求
+新的 Committer 由已有的 PMC 推荐，并通过 2/3 以上投票通过，Committer 至少满足以下一个条件：
+
+- 成为社区成员时间超过三个月 
+- 超过 10 个 PMC approve 的 PR 
+- 完成重大功能 
+- 修复严重 Bug 
+- 长期关注项目发展并参与社区讨论
+### 4.2. 职责
+
+- 社区咨询支持
+- 积极响应指派给您的 Issue 或 PR
+- 对于社区重大决定的投票权
+- Review 社区的 PR 
+### 4.3. 权限
+
+- Pull Request review 权限 
+## 5. PMC
+### 5.1. 要求
+
+- 暂不开放，如有强烈愿望请联系PMC
+### 5.2. 职责
+
+- 积极参与社区讨论，对社区重大决策给予指导 
+- 负责保证开源项目的社区活动都能运转良好 
+### 5.3. 权限
+
+- Pull Request review 权限 
+- Pull Request approve 权限 
+- 社区角色成员管理
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..514825b414
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# 个人贡献者许可协议
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..d1f5e1f62d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# 公司贡献者许可协议
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..6668c91d5e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,66 @@
+# 技术规划
+
+## 1. 简介
+
+该文档是 TuGraph-DB 未来开发的规划，包括正在开发中、不在开发计划里、已经开发完成但不在开源版本里的功能等。
+
+TuGraph-DB定位开源高性能图数据库，图数据采用集中存储的方式，短期 **不会** 考虑基于分片（Sharding）的数据切分，
+而将支持主备复制的模式来解决高并发读的场景，采用云上存储解决存储容量的问题。
+
+## 2. 已完成功能
+
+TuGraph-DB于2022年9月1日开源，TuGraph-DB在社区的反馈声中，进行日常BUG修复，自身能力得到了完善。
+
+| 版本号   | 功能                               | 时间         |
+|-------|----------------------------------|------------|
+| 3.3.0 | 开源初版                             | 2022.9.1   |
+| 3.3.1 | 图分析引擎重构，多模式支持                    | 2022.10.14 |
+| 3.3.2 | OGM支持，UT覆盖率提升                    | 2022.11.21 |
+| 3.3.3 | 链接认证机制迭代，加入英文文档                  | 2022.12.23 |
+| 3.3.4 | 支持上云，梳理LDBC SNB Audit流程          | 2023.1.28  |
+| 3.4.0 | 支持OLAP Python API, 离线导入升级        | 2023.3.11  |
+| 3.5.0 | 支持POG，前端升级，文档梳理                  | 2023.6.5   |
+| 3.5.1 | 图学习引擎，Procedure Rust API，存储属性分离  | 2023.7.14  |
+| 3.6.0 | 高可用开源，日志系统升级                     | 2023.8.11  |
+| 4.0.0 | ISO GQL支持，新增11个开源图算法，支持m1 Docker | 2023.9.6   |
+| 4.0.1 | 支持时序边排序，新增5个开源图算法                | 2023.9.28  |
+| 4.1.0 | 支持Bolt协议，支持快速在线全量导入，支持地理空间数据类型   | 2023.12.25 |
+
+除此之外，TuGraph-DB搭建了较为完善的质量体系，涵盖自动化的单元测试、集成测试、性能测试等。
+
+更详细的描述可以在源码目录在的 "[root]/release/CHANGELOG.md" 文件查看。
+
+## 3. 2024年功能更新
+
+在2024年度，我们计划的功能更新包括：
+
+| 版本号   | 功能                 | 计划时间    |
+|-------|--------------------|---------|
+| 4.2.x | HA支持Witness角色和管理工具 | 2024.3  |
+| 4.2.x | Bolt支持流处理和参数化查询    | 2024.3  |
+| x.x.x | GeaX支持Cypher       | 2024.6  |
+| x.x.x | 支持组合索引             | 2024.6  |
+| x.x.x | 数据导入功能优化           | 2024.6  |
+| x.x.x | 【社区功能】支持地理数据类型使用   | 2024.6  |
+| x.x.x | Cypher能力提升         | 2024.9  |
+| x.x.x | 支持Schema快速变更       | 2024.9  |
+| x.x.x | 向量化支持              | 2024.12 |
+| x.x.x | RPQ支持              | 2024.12 |
+| x.x.x | 【可选】查询引擎升级         | 2024.12 |
+| x.x.x | 【社区功能】支持GraphAr    | 2024.12 |
+
+## 4. 期望社区共创的功能
+
+目前团队研发精力并不能实现我们对TuGraph-DB的全部期望，在功能的梳理中，我们发现有一系列值得挖掘的想法，
+团队也有一些初步的探索，期望下面功能能够在社区中共同研发。
+
+| 版本号   | 功能                      | 计划时间   |
+|-------|-------------------------|--------|
+| x.x.x | 图算法库丰富                  | 2024.x |
+| x.x.x | 属性默认值支持                 | 2024.x |
+| x.x.x | Embedded TuGraph-DB最佳实践 | 2024.x |
+| x.x.x | Bolt显式事务支持              | 2024.x |
+| x.x.x | List、Map和Decimal等数据类型扩展 | 2024.x |
+| x.x.x | 探索多存储引擎                 | 2024.x |
+
+一些更加简单的功能，我们会在github的issue中打上 good first issue 的标签，欢迎对图数据库感兴趣的技术爱好者共同研讨。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..f2319d2358
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+贡献者文档
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..addc159170
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# 从关系型数据库导入TuGraph
+
+> 使用 [DataX](../6.utility-tools/7.tugraph-datax.md)，待完善
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..01171c1f11
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,223 @@
+# 使用 TuGraph 图学习模块进行点分类
+
+## 1.简介
+GNN 是许多图上机器学习任务的强大工具。在本介绍性教程中，您将学习使用 GNN 进行点分类的基本工作流程，即预测图中点的类别。
+
+此文档将展示如何构建一个 GNN 用于在 Cora 数据集上仅使用少量标签进行半监督点分类，这是一个以论文为点、引文为边的引文网络。任务是预测给定论文的类别。
+
+通过完成本教程，您可以
+
+使用 TuGraph 加载 cora 数据集。
+
+使用 TuGraph 提供的采样算子采样，并构建 GNN 模型。
+
+在 CPU 或 GPU 上训练用于点分类的 GNN 模型。
+
+此文档需要对图神经网络、DGL等使用有一定经验。
+
+## 2. 前置条件
+
+TuGraph图学习模块需要TuGraph-db 3.5.1及以上版本。
+
+TuGraph部署推荐采用Docker镜像tugraph-compile 1.2.4及以上版本:
+
+tugraph / tugraph-compile-ubuntu18.04:latest
+
+tugraph / tugraph-compile-centos7:latest
+
+tugraph / tugraph-compile-centos8:latest
+
+以上镜像均可在DockerHub上获取。
+具体操作请参考[快速上手](../3.quick-start/1.preparation.md)。
+
+## 3. Cora 数据集导入TuGraph数据库
+### 3.1. Cora 数据集介绍
+Cora 数据集由 2708 篇论文组成，分为 7 个类别。每篇论文由一个 1433 维的词袋表示，表示论文中的单词是否出现。这些词袋特征已经预处理，以从 0 到 1 的范围归一化。边表示论文之间的引用关系。
+
+TuGraph中已经提供了Cora数据集的导入工具，用户可以直接使用。
+
+### 3.2. 数据导入
+Cora数据集在test/integration/data/algo目录下，包含点集cora_vertices和边集cora_edge。
+
+首先需要将Cora数据集导入到TuGraph数据库中，详细操作可参考[数据导入](../6.utility-tools/1.data-import.md)。
+
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+然后进行数据导入：
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式,可参考test/integration/data/algo/cora.conf。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+
+## 4. feature特征转换
+由于Cora数据集中的feature特征为长度为1433的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+
+## 5. 编译采样算子
+采样算子用于从数据库中获取图数据并转换成所需数据结构，具体执行过程如下(如果TuGraph已编译，可跳过此步骤)：
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *  # 导入tugraph-db的python接口模块
+import importlib  # 导入importlib模块
+getdb = importlib.import_module("getdb")  #获取getdb算子
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo) #调用getdb算子
+```
+
+如代码所示，得到算子so文件后，import 导入使用。
+
+## 6. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+训练详细过程如下：
+### 6.1.数据加载
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+如代码所示，根据图数据路径、用户名、密码和子图名称将数据加载到内存中。TuGraph可以载入多个子图用于图训练，在此处我们只载入一个子图。
+
+### 6.2.构建采样器
+训练过程中，首先使用GetDB算子从数据库中获取图数据并转换成所需数据结构，具体代码如下：
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+如代码所示，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+然后构建采样器
+```python
+    batch_size = 5
+    count = 2708
+    sampler = TugraphSample(args)
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(count),
+        sampler,
+        batch_size=batch_size,
+        num_workers=0,
+        )
+```
+
+### 6.3.对结果进行格式转换
+```python
+    src = EdgeInfo[0].astype('int64')
+    dst = EdgeInfo[1].astype('int64')
+    nodes_idx = NodeInfo[0].astype('int64')
+    remap(src, dst, nodes_idx)
+    features = NodeInfo[1].astype('float32')
+    labels = NodeInfo[2].astype('int64')
+    g = dgl.graph((src, dst))
+    g.ndata['feat'] = torch.tensor(features)
+    g.ndata['label'] = torch.tensor(labels)
+    return g
+```
+对结果进行格式转换，使之符合训练格式
+
+### 6.4.构建GCN模型
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+
+def build_model():
+    in_size = feature_len  #feature_len为feature的长度，在此处为1433
+    out_size = classes  #classes为类别数，在此处为7
+    model = GCN(in_size, 16, out_size)  #16为隐藏层大小
+    return model
+```
+本教程将构建一个两层图卷积网络（GCN）。每层通过聚合邻居信息来计算新的点表示。
+
+### 6.5.训练GCN模型
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #如果需要保存模型，则给出模型保存路径
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+如代码所示，根据定义好的采样器、优化器和模型进行迭代训练50次，训练后的模型保存至model_save_path路径中。
+
+输出结果如下：
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+同时，图学习模块可采用GPU进行加速，用户如果需要再GPU上运行，需要用户自行安装相应的GPU驱动和环境。具体可参考learn/README.md。
+
+完整代码可参考learn/examples/train_full_cora.py
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..df74c5c673
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# 数据迁移
+
+## 1. 简介
+   数据迁移是指将数据从一个系统、存储介质或应用程序迁移到另一个系统、存储介质或应用程序的过程。当TuGraph要升级或者系统硬件环境发生变化时，
+需要对原TuGraph服务中的数据进行迁移。以系统硬件环境和软件版本为依据进行划分，本文将数据迁移分为三种方案：
+1. 兼容迁移：当迁移前后系统环境一致且TuGraph软件兼容时，可以直接使用备份恢复的方式迁移数据；
+2. 升级迁移：当迁移前后系统环境不一致或TuGraph软件不兼容时，需要使用先导出数据再重新导入的方式迁移数据；
+3. 在线迁移：当对高可用集群进行数据迁移且集群网络环境良好时，可以使用增删节点的的方式将原集群平滑切换到新集群。
+接下来本文将详细介绍这三种方案。
+
+## 2. 兼容迁移
+兼容迁移指的是在系统环境不变，且TuGraph软件版本兼容时，原服务的数据和存储过程可以在新服务中使用，所以可以直接迁移。
+用户可以先使用`lgraph_backup`工具备份数据，然后将数据传输到新机器中并重启服务。具体迁移步骤如下：
+
+### 2.1. 备份数据
+使用`lgraph_backup`工具备份数据
+```bash
+  lgraph_backup -s db -d db.bck
+```
+本步骤也可以直接使用`cp`命令，不过`cp`命令会拷贝一些多余的元数据，HA模式下也会拷贝raft的元数据导致迁移之后集群重启失败，
+因此建议数据迁移时使用`lgraph_backup`工具替代`cp`命令。
+
+### 2.2. 启动新服务
+使用如下命令启动新服务，存储过程会自动加载到新服务中
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. 停止原服务
+使用如下命令停止原服务
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. 升级迁移
+当用户要把原始服务迁移到一个差异化环境中（比如从centos7迁移到ubuntu18.04），或者TuGraph版本变化较大前后不兼容时（如3.4.0和3.6.0），
+用户可以先使用`lgraph_export`工具将数据导出成文件，传输到新机器中，再使用`lgraph_import`工具重新导入并重启集群。
+这样可以保证在新环境上能够使用，但是效率较低，存储过程也需要重新加载。具体的迁移步骤如下：
+
+### 3.1. 导出数据
+使用`lgraph_export`工具导出数据，并将数据传输到新机器上
+```bash
+  lgraph_export -d db -e db.export
+```
+
+### 3.2. 导入数据
+使用`lgraph_import`工具导入数据，并手动加载存储过程（详见[client操作步骤](../7.client-tools/2.cpp-client.md)）
+```bash
+  lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. 启动新服务
+使用如下命令启动新服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. 停止原服务
+使用如下命令停止原服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. 在线迁移
+当对TuGraph高可用版本部署的服务器集群进行数据迁移时，如果网络带宽充足，可以直接使用增删节点的方式对服务进行在线迁移。具体迁移步骤如下所示：
+
+### 4.1. 拷贝数据
+使用如下命令拷贝leader节点上的数据，并且传输到新集群的机器节点上。由于leader节点上有最完整的raft日志，拷贝leader的数据可以最大程度地减少
+日志追赶的时间。
+```bash
+  cp -r db db.cp
+```
+### 4.2. 启动新节点
+使用如下命令将新节点加入集群，加入集群后，增量数据自动同步到新节点
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. 停止原节点
+停止原节点服务，后续应用请求直接发给新集群
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..dd635f6f27
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# 环境和版本选择
+
+> 该文档介绍如何选择系统环境，以及部署方式
+
+## 1. 简介
+
+TuGraph为不同需求的用户提供了差异化的系统环境和部署方式，来满足新手、系统开发者、生产运维人员、研究人员等不同用户的需求。
+
+## 2. 环境能力选择
+
+用户可以根据实际使用场景，来选择不同的环境。编译环境的能力最完备，所需的第三方软件也越多。与其相对应的，精简运行环境几乎不需要安装任何依赖库，能运行TuGraph除存储过程外的基础功能。
+
+| 环境     | 用途             | 备注        |
+|--------|----------------|-----------|
+| 编译环境   | 从源码编译TuGraph   | 适用于开发人员   |
+| 运行环境   | 运行TuGraph安装包   | 适用于大部分用户  |
+| 精简运行环境 | 运行精简TuGraph安装包 | 对系运行统依赖较小 |
+
+不同环境的具体介绍参见 [链接](../5.installation&running/2.environment-mode.md)。
+
+## 3. 部署方式选择
+
+TuGraph部署仅需一台服务器（高可用模式需要多台），可根据实际资源情况和使用场景，选择适合的部署方式。
+
+| 部署方式     | 描述                   | 备注                                                                                      |
+|----------|----------------------|-----------------------------------------------------------------------------------------|
+| 云部署      | 阿里云计算巢一键部署，免费试用      | 新手适用，流程参考 [链接](../5.installation&running/5.cloud-deployment.md)              |
+| Docker部署 | 通过预先准备的Docker镜像跨平台部署 | 对硬件有要求的用户，比如性能测试，流程参考 [链接](../5.installation&running/3.docker-deployment.md) |
+| 本地部署     | 在现有系统紧耦合部署           | 指定生产环境适用，流程参考 [链接](../5.installation&running/4.local-package-deployment.md)  |
+
+## 4. 后续步骤
+
+部署完成后，后续可以进行[启动服务](../5.installation&running/7.tugraph-running.md)、[数据导入](../6.utility-tools/1.data-import.md)等操作，也可以通过[样例数据](../3.quick-start/2.demo/1.movie.md)来体验整个流程。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/5.spatial.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/5.spatial.md
new file mode 100644
index 0000000000..72f4dc020b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/5.spatial.md
@@ -0,0 +1,184 @@
+# 地理空间数据类型使用示例
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群。近年来，地理空间功能在图数据库中的应用价值显著，它不仅增强了数据的表达能力，还促进了跨领域数据的融合分析，尤其在社交网络、地图探索、城市规划等关键领域展现了强大的实用价值。TuGraph也正在逐步支持地理空间功能。
+
+## 2. 预备知识
+
+EPSG([EPSG.io: Coordinate Systems Worldwide](https://epsg.io/)) 是一个标准化的地理空间参考系统标识符集合， 用于标识不同的地理空间参考系统，包括坐标系统、地理坐标系、投影坐标系等。我们常用EPSG编码表示数据的坐标系，这里我们介绍两种最常见的空间地理坐标系，也是大部分数据库支持的坐标系类型。
+
+### 2.1 WGS84坐标系 EPSG: 4326
+
+全球GPS定位系统: WGS84是全球定位系统(GPS)的基础，允许全球的GPS接收器确定精确位置。几乎所有现代GPS设备都是基于WGS84坐标系来提供位置信息。地图制作和地理信息系统(GIS): 在地图制作和GIS领域，WGS84被广泛用于定义地球上的位置。这包括各种类型的地图创建、空间数据分析和管理等。![image.png](../../../images/spatail/EPSG_4326.png)
+
+### 2.2 Cartesian(笛卡尔)坐标系 EPSG: 7203
+
+直角坐标系，是一种最基本、最广泛应用的坐标系统。它通过两条数轴定义一个平面，三条数轴定义一个空间，这些轴互相垂直，在数学、物理、工程、天文和许多其他领域中有着广泛的应用。![image.png](../../../images/spatail/EPSG_7203.png)
+
+### 2.3 数据存储格式
+
+OGC(Open Geospatial Consortium) 定义了空间数据的标准表示格式，分别为WKT与WKB格式，用于在不同系统和平台之间交换和存储空间数据，现已被广泛采用。其中WKT(well-kown text)格式, 是一种文本标记语言,易于人类阅读和编写，而WKB(Well-Known Binary)格式采用一系列字节来编码空间数据，更适合在计算机中存储;
+
+**WKT:**
+
+```
+POINT(<x> <y>)
+LINESTRING(<x1> <y1>, <x2><y2>, ...)
+```
+
+WKT格式的数据如上例所示，先指定空间数据类型，再在括号内指定具体的坐标，一个坐标对表示一个点，每个坐标对之间用逗号隔开。对于Polygon类型的数据，第一个坐标对需要与最后一个坐标对相同，形成闭合的面。
+
+**WKB:**
+
+![image.png](../../../images/spatail/WKB.png)
+
+
+针对EWKB格式的编码，说明如下:
+
+- 第0 - 1位: 编码方式;
+- 第2 - 5位: 空间数据类型;
+    - 0100: point
+    - 0200: linestring
+    - 0300: polygon
+- 第6 - 9位: 数据维度;
+    - 0020: 二维
+    - 0030: 三维
+- 第10 - 17位: 坐标系的EPSG编码;
+- 第18 - n位: double类型的坐标对的16进制表示。
+
+### 2.4 常用函数
+
+| Name                 | Description           | Signature                                                                 |
+|----------------------|-----------------------|---------------------------------------------------------------------------|
+| `dbms.graph.createGraph` | 创建子图           | `dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)` |
+| `db.createVertexLabel`  | 创建Vertex Label      | `db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)`      |
+| `db.getLabelSchema`     | 列出label schema      | `db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)` |
+| `db.deleteLabel`        | 删除Vertex            | `db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)`         |
+
+更完整详细的函数使用以及插入数据的语句，可以参考 [Cypher API](../8.query/1.cypher.md)
+
+## 3. 数据类型
+
+目前在TuGraph中，我们已经支持了Point, Linestring与Polygon三种类型:
+
+- Point：点    point(2.0, 2.0, 7203)
+- Linestring：折线 LINESTRING(0 2,1 1,2 0)
+- Polygon：多边形  POLYGON((0 0,0 7,4 2,2 0,0 0))
+
+其中坐标点都是double型，创建图模型和插入数据示例如下：
+
+**创建标记美食位置的点模型**
+
+```
+CALL db.createVertexLabel('food', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true) 
+```
+
+![image.png](../../../images/spatail/createVertexLabel.png)
+
+**插入标记美食点的数据**
+
+```
+ CREATE (n:food {id:10001, name: 'aco Bell',pointTest:point(3.0,4.0,7203)}) RETURN n
+```
+
+![image.png](../../../images/spatail/createFoodData.png)
+
+**创建具有折线属性的点模型**
+
+```
+CALL db.createVertexLabel('lineTest', 'id', 'id', int64, false, 'name', string, true,'linestringTest',linestring,true)
+```
+
+![image.png](../../../images/spatail/createVertexLabel_lineTest.png)
+
+**插入具有折线属性的点数据**
+
+```
+CREATE (n:lineTest {id:102, name: 'Tom',linestringTest:linestringwkt('LINESTRING(0 2,1 1,2 0)', 7203)}) RETURN n
+```
+
+![image.png](../../../images/spatail/createLineTestData.png)
+
+**创建具有多边型属性的点模型**
+
+```
+CALL db.createVertexLabel('polygonTest', 'id', 'id', int64, false, 'name', string, true,'polygonTest',polygon,true)
+```
+
+![image.png](../../../images/spatail/createVertexLabel_PolygonTest.png)
+
+**插入具有多边型属性的点数据**
+
+```
+CREATE (n:polygonTest {id:103, name: 'polygonTest',polygonTest:polygonwkt('POLYGON((0 0,0 7,4 2,2 0,0 0))', 7203)}) RETURN n
+```
+
+## 4. 函数介绍
+
+| 函数名  | 描述 | 输入参数                         | 返回值类型 |
+| --- | --- |------------------------------| --- |
+| Distance() | 计算两个空间数据间的距离(要求坐标系相同) | Spatial data1, Spatial data2 | double |
+| Disjoint()  |  判断两个空间数据是否相交（开发中） | Spatial data1, Spatial data2 | bool |
+| WithinBBox() | 判断某个空间数据是否在给定的长方形区域内（开发中） | Spatial data, Point1         | bool |
+
+## 5. 美食探索
+### 5.1 基于地理位置的个性化推荐
+
+在本章节中，我们将探索如何利用Tugraph图数据库的地理空间功能，构建一个生动有趣的美食探索应用，将“人”与“美食”通过地理位置紧密相连，实现个性化美食推荐。想象一下，无论身处何方，只需轻轻一点，周围诱人美食便尽收眼底，这正是我们即将构建的场景魅力所在。
+
+### 5.2 数据模型设计
+我们首先定义两种核心节点类型：
+
+- Food（美食）节点：每一家餐厅或小吃店都可以作为一个Food节点，其属性包括但不限于名称、地址、评分、美食类别等。特别地，我们将在每个Food节点上附加地理坐标信息，用以精确记录其地理位置。
+
+```
+ CALL db.createVertexLabel('food', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true,'mark',double,true)
+```
+
+准备数据：
+
+```
+CREATE (n:food {id:10001, name: 'Starbucks',pointTest:point(1.0,1.0,7203),mark:4.8}) RETURN n
+CREATE (n:food {id:10002, name: 'KFC',pointTest:point(2.0,1.0,7203),mark:4.5}) RETURN n
+CREATE (n:food {id:10003, name: 'Pizza Hut',pointTest:point(2.0,5.0,7203),mark:4.5}) RETURN n
+CREATE (n:food {id:10004, name: 'Taco Bell',pointTest:point(3.0,4.0,7203),mark:4.7}) RETURN n
+CREATE (n:food {id:10005, name: 'Pizza Fusion',pointTest:point(5.0,3.0,7203),mark:4.9}) RETURN n
+CREATE (n:food {id:10006, name: 'HaiDiLao Hot Pot',pointTest:point(2.0,2.0,7203),mark:4.8}) RETURN n
+CREATE (n:food {id:10007, name: 'Lao Sze Chuan',pointTest:point(4.0,3.0,7203),mark:4.7}) RETURN n
+```
+
+- Person（人物）节点：代表应用的用户，属性包含用户名、当前位置等。用户的当前位置同样通过地理坐标表示，便于后续的地理空间查询。
+
+```
+ CALL db.createVertexLabel('person', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true)
+```
+
+准备数据：
+
+```
+ CREATE (n:person {id:1, name: 'Tom',pointTest:point(3.0,3.0,7203)}) RETURN n
+```
+
+### 5.3 构建美食探索查询
+
+能够根据用户的当前位置，寻找距离2.5以内的美食,根据距离进行升序排列。返回距离和评分让用户得倒更好的体验。
+
+**查询语句**
+
+```
+match (n:person{id:1}),(m:food) with n.pointTest as p1,m.pointTest as p2,m.name as food,m.mark as mark
+CALL spatial.distance(p1,p2) YIELD distance 
+WHERE distance<2.5
+RETURN food,distance,mark ORDER by distance
+```
+
+![image.png](../../../images/spatail/querryFood.png)
+
+此查询首先匹配特定的Person节点（以用户名“Tom”为例），然后找到所有Food节点，利用自定义的distance函数，计算Person节点当前位置与每个Food节点之间的直线距离，筛选出距离在2.5之内的美食。最后，按照美食的距离升序排列结果，附带评分参考，为用户提供最优质的推荐。
+
+## 6. 展望
+
+通过上述章节，我们不仅展示了TuGraph在地理空间数据处理的能力，也描绘了一个富有吸引力的美食探索场景，证明了图数据库在结合地理位置信息进行个性化服务方面具有巨大潜力。无论是寻找周末的休闲去处，还是探索旅行途中的特色美食，这样的应用都将极大地丰富人们的生活体验。
+
+TuGraph将来会继续实现Disjoint() 、WithinBBox()，会丰富更多使用场景。当然，也欢迎大家一起参与，共同开发地理空间功能。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..dc5546f1d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+最佳实践
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/14.faq.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/14.faq.md
new file mode 100644
index 0000000000..596cab6378
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/14.faq.md
@@ -0,0 +1,59 @@
+# FAQ
+
+在 TuGraph 使用过程中，如果遇到问题可优先查看[用户文档](https://github.com/TuGraph-family/tugraph-db/tree/master/doc/zh-CN) 。其次，请查看如下 FAQ 列表是否能够匹配您的问题。
+
+1. **[内核引擎 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussion-4575385)**
+
+   1.1 [TuGraph 的边是否支持索引？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165379)
+
+   1.2 [TuGraph 单机的 QPS 是多少？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussion-4575381)**
+
+   2.1 [可视化文件 build 后如何更新到 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165364)
+
+   2.2 [如何通过 npm run dev，连接已有的 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165366)
+
+   2.3 [3.3.0 版本 TuGraph Browser 删除 node label 失败？](https://github.com/TuGraph-family/tugraph-db/discussions/82#discussion-4465791)
+3. **[客户端 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussion-4575378)**
+
+   3.1 [Client 目前有哪些编程语言，是否支持 Node.js？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165351)
+
+   3.2 [Python Client 是否支持 pip install？Client 在哪里进行引用？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165353)
+
+4. **[数据导入 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussion-4575373)**
+
+   4.1 [TuGraph 可以对接哪些常用数据库？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165335)
+
+   4.2 [如何进行数据导入？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[存储过程 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussion-4575369)**
+
+   5.1 [如何加载存储过程或算法包？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165313)
+
+   5.2 [如何调用或执行存储过程？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165317)
+
+   5.3 [开源内置的算法包在哪里？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[安装部署 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussion-4575364)**
+
+   6.1 [如何使用 docker 镜像安装？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165287)
+
+   6.2 [rpm 包和 deb 包安装后，启动 lgraph_server 服务，提示缺少'liblgraph.so'报错？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165289)
+
+   6.3 [如何在 Mac 的 M1 芯片上编译 TuGraph？](https://github.com/TuGraph-family/tugraph-db/discussions/47#discussion-4393165)
+
+   6.4 [安装报错 jemalloc: Unsupported system page size 该如何处理？](https://github.com/TuGraph-family/tugraph-db/issues/477)
+7. **[Cypher QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussion-4575018)**
+
+   7.1 [是否支持不定长边的条件查询？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165252)
+
+   7.2 [如何查询最短路径，shortestPath 函数如何使用？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165256)
+
+   7.3 [查询语句 Where 后使用 and 进行拼接查询速度较慢，语句应如何优化改进？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165260)
+
+   7.4 [如何查询任意跳的边？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165262)
+
+   7.5 [Cypher 是否 date()函数？](https://github.com/TuGraph-family/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+
+   8.1 [报错“User has reached the maximum number of tokens”后该如何处理？](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+如果问题仍然无法得到解决，我们推荐您在[Discussions](https://github.com/TuGraph-family/tugraph-db/discussions)跟帖或发起新贴来描述您的问题。同时 TuGraph QA 大汇总也会根据大家在讨论区发起的帖子，进行定期的更新。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/15.contacts.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/15.contacts.md
new file mode 100644
index 0000000000..e003ef4098
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/15.contacts.md
@@ -0,0 +1,17 @@
+# 联系方式
+
+您有任何对产品的意见和建议，欢迎通过以下联系方式加入讨论，或提出建议。
+
+官网: [www.tugraph.org](https://www.tugraph.org)
+
+Github Issue (错误反馈、功能讨论)
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions (技术讨论)
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack (在线开发沟通):
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+通过钉钉群、微信群、微信公众号、邮箱和电话联系我们:
+![contacts](../../images/contact-zh.png)
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..4cbe4ce767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,13 @@
+# 什么是图
+
+> 本文面向初学者，介绍图（Graph）的基本概念。
+
+我们今天介绍的图，是图论中使用点和边表示的图（Graph），而非图像的图（Image）。
+
+![alt what is graph](../../../images/what-is-graph.png)
+
+图的基本元素是点和边，其中点表示事物或实体，边表示点之间的关联关系。
+
+如上图左侧所示，点表示的有公司、员工、项目。边表示的是他们之间的关系，包括：公司和员工之间的雇佣关系，员工和员工之间的好友关系，项目和员工之间的参与关系。除此之外，点和边上可以附加属性，比如员工的工号，雇佣的时间，这样的图是属性图。也就是说，我们可以用图的方式来抽象地表示实体及其关联关系，图有非常丰富的表达能力。
+
+除了上述的员工图谱，图还可以用于金融、工业、医疗等各个领域。在实际应用中，图的规模越来越大，比如金融交易图，点边规模可能到达百亿，与其同时，基于图的查询通常会复杂，最典型的是K跳查询，每增加一跳访问的数据都呈指数增长。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..eeb4dfd11f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# 什么是图数据库
+
+> 本文主要介绍什么是图数据库，图数据库相比于关系型数据库的优势，以及两者特点的对比。
+
+## 1. 图数据库介绍
+
+图数据库是基于图模型的数据库。与关系型数据库相比，图数据库真正注重“关系”。图数据库的主要功能是管理图数据，因此需要支持高效的点、边查询和更新；为方便用户使用，通常还需要增加对事务（transaction）的支持，以确保并发操作下的正常运行。
+
+## 2. 图数据库相比较于关系型数据库的优势
+
+图数据库的功能是传统关系型数据库的扩展。与关系型数据库仅支持的“表结构”相比，图数据库所支持的“图结构”更为灵活。图数据库在基于图的增加、删除、查询和修改方面采用不同于其他数据库的设计。在图数据操作抽象上，采用基于点的视角，例如点通过其所有“出边”（从一个点出发，连接到其他点的边）访问其邻接点。这是图数据库系统设计的核心。
+
+图数据库的独特性体现在以下三个方面:
+
+### 2.1. 性能
+
+在关联关系处理上，使用关系型数据库不可避免地要使用表的JOIN操作，这会对性能产生较大影响；而图数据库则直接跳转访问类指针，操作关联数据的效率更高，比关系型数据库提高2到4个数量级的性能。
+
+### 2.2. 兼容性
+
+现实中，项目进程通常不断演变，数据的内容甚至数据格式也在不断变化。在关系型数据库中，这意味着表结构的变化或建立多个新表，对源数据的修改非常大。而在图数据库中，仅需添加新的点、边和属性，并将其设置为对应的类型即可。从本质上说，一个表代表一种类型的数据，一个点代表一个特定的数据。这意味着关系型数据库更关注数据类型，而图数据库更关注数据个体及其关联关系。
+
+### 2.3. 直观性
+
+使用图的方式表达现实世界的关系更直接和自然，在万物互联的时代尤为突出。如果使用关系型数据，先建立实体表，再建立关系表，最后映射数据，需要高度的抽象思维。在图数据上进行分析查询时，可以直观地通过点边连接的拓扑结构找到所需数据，无需任何专业知识。
+
+## 3. 图数据库与关系型数据库对比
+
+| 分类         | 模型   | 优势                                   | 劣势                                     | 举例           |
+| ------------ | ------ | -------------------------------------- | ---------------------------------------- | -------------- |
+| 关系型数据库 | 表结构 | 数据高度结构化，一致性强，软件成熟度高 | 面向多跳的关联关系查询低效或不支持       | MySQL、Oracle  |
+| 图数据库     | 图结构 | 针对关联关系的建模建模和操作效率非常高 | 高度结构化的数据处理能力不及关系型数据库 | Neo4j、TuGraph |
+
+总之，面对海量数据的存储和处理问题，传统的关系数据库已经无法满足大部分的日常数据存储需求。图数据库技术可以将关系信息存储为实体，灵活拓展数据模型。由于提供了对关联数据最直接的表达方式和图模型对异构数据的天然包容性，图数据库技术必将成为未来最热点的技术之一，为企业提供存储和分析大规模图数据的有力支持。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..41ed5c6aa5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,49 @@
+# 什么是TuGraph
+
+> 本文主要介绍TuGraph社区版的主要功能和特性，以及TuGraph企业版和社区版的差异。
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群，解决了图数据分析面临的大数据量、高吞吐率和低延迟等重大挑战，是蚂蚁集团金融风控能力的重要基础设施，显著提升了欺诈洗钱等金融风险的实时识别能力和审理分析效率，并面向金融、工业、政务服务等行业客户。
+
+## 2. TuGraph社区版
+
+2022年9月，TuGraph单机版开源，提供了完备的图数据库基础功能和成熟的产品设计，支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台。
+
+TuGraph社区版于2022年9月开源，提供了完整的图数据库基础功能和成熟的产品设计（如ACID兼容的事务、编程API和配套工具等），适用于单实例部署。社区版支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台，是学习TuGraph和实现小型项目的理想选择。
+
+## 3. TuGraph特性
+
+TuGraph是支持大数据量、低延迟查找和快速图分析功能的高效图数据库。TuGraph也是基于磁盘的数据库，支持存储多达数十TB的数据。TuGraph提供多种API，使用户能够轻松构建应用程序，并使其易于扩展和优化。
+
+它具有如下功能特征：
+
+- 属性图模型
+- 实时增删查改
+- 多重图（点间允许多重边）
+- 多图（大图与多个子图）
+- 完善的ACID事务处理，隔离级别为可串行化（serializable）
+- 点边索引
+- 混合事务和分析处理（HTAP），支持图查询、图分析、图学习
+- 主流图查询语言（OpenCypher、ISO GQL等）
+- 支持OLAP API，内置30多种图分析算法
+- 基于C++/Python的存储过程，含事务内并行Traversal API
+- 提供图可视化工具
+
+在性能和可扩展性方面的支持：
+
+- 千万点/秒的高吞吐率
+- TB级大容量
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线的备份恢复
+
+## 4. TuGraph企业版
+
+企业版对商业化功能支持更加完善，包括分布式集群架构，覆盖探索、研发、服务、运维管理全生命周期的一站式图平台，在线、近线、离线的图计算引擎，支持流式、大数据类数据源，多地多中心的部署形态，以及专家支持服务等。企业版是商业化解决方案的理想选择。
+
+如需商业支持，请联系我们：
+
+- 电话：400-903-0809
+- 邮件：tugraph@service.alipay.com
+- 官网：https://tugraph.antgroup.com
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..0433420751
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/4.schema.md
@@ -0,0 +1,158 @@
+# TuGraph图模型说明
+## 1. 数据模型
+
+### 1.1. 图模型
+
+TuGraph是一个具备多图能力的强类型、有向属性图数据库。
+
+- 图项目：每个数据库服务可以承载多个图项目（多图），每个图项目可以有自己的访问控制配置，数据库管理员可以创建或删除指定图项目。
+- 点：指实体，一般用于表达现实中的实体对象，如一部电影、一个演员。
+    - 主键：用户自定义的点数据主键，默认唯一索引，在对应的点类型中唯一。
+    - VID：点在存储层自动分配图项目中的唯一ID，用户不可修改。
+    - 上限：每个图项目存储最多2^(40)个点数据。
+- 边：用于表达点与点之间的关系，如演员出演电影。
+    - 有向边：边为有向边。若要模拟无向边，用户可以创建两个方向相反的边。
+    - 多条边：两个点数据之间可以有多条边数据。当前TuGraph支持重复边，如要确保边边唯一，需要通过业务策略实现。
+    - 上限：两个点数据之间存储最多2^(32)条边数据。
+- 属性图：点和边可以具有与其关联的属性，每个属性可以有不同的类型。
+- 强类型：每个点和边有且仅有一个标签，创建标签后，修改属性数量及类型有代价。
+    - 指定边的起/终点类型：可限制边的起点和终点点类型，支持同类型边的起点和终点的点类型不同，如个人转账给公司、公司转账给公司；当指定边的起/终点类型后，可增加多组起/终点类型，不可删除已限制的起/终点类型。
+    - 无限制模式：支持不指定边的起点和终点的点类型，任意两个点类型间均可创建该类型的边数据。注：当指定边的起/终点类型后无法再采用无限制模式。
+
+### 1.2. 数据类型
+
+TuGraph支持多种可用于属性的数据类型。具体支持的数据类型如下：
+
+| **数据类型** | **最小值**          | **最大值**          | **描述**                            |
+| ------------ | ------------------- | ------------------- | ----------------------------------- |
+| BOOL         | false               | true                | 布尔值                              |
+| INT8         | -128                | 127                 | 8位整型                          |
+| INT16        | -32768              | 32767               | 16位整型                         |
+| INT32        | - 2^31              | 2^31 - 1            | 32位整型                         |
+| INT64        | - 2^63              | 2^63 - 1            | 64位整型                         |
+| DATE         | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" 格式的日期             |
+| DATETIME     | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD HH:mm:ss[.ffffff]" 格式的日期时间 |
+| FLOAT        |                     |                     | 32位浮点数                       |
+| DOUBLE       |                     |                     | 64位浮点数                       |
+| STRING       |                     |                     | 不定长度的字符串                    |
+| BLOB         |                     |                     | 二进制数据（在输入输出时使用Base64编码） |
+| POINT        |                     |                     | EWKB格式数据，表示点              |
+| LINESTRING   |                     |                     | EWKB格式数据，表示线              |
+| POLYGON      |                     |                     | EWKB格式数据，表示面(多边形)       |
+| FLOAT_VECTOR |                     |                     | 包含32位浮点数的动态向量               |
+
+### 1.3. 索引
+
+TuGraph支持对点或边的属性创建索引，以提升查询效率。其特点如下：
+- 索引包括普通索引和组合索引，普通索引基于一个点或边的一个属性创建，而组合索引基于一个点或边的多个属性创建（不超过16个），可以对同一点或边的多个（组）属性创建索引。
+- 如果为点标签创建了唯一索引，在修改该标签的点时，会先执行数据完整性检查，以确保该索引的唯一性。
+- BLOB类型的属性不能建立索引。
+
+TuGraph的点边均有多种索引类型，不同的索引类型的功能和限制不同，具体如下：
+
+#### 1.3.1 普通索引
+##### 1.3.1.1 点索引
+###### 1.3.1.1.1 unique索引
+
+点的unique索引指的是全局唯一的索引，即若一个属性设置了unique索引，在同一个图中，相同label的点的该属性不会存在相同的值，
+unique索引key的最大长度是480bytes，**超过480bytes的属性不能建立unique索引**。
+primary作为特殊的unique索引，因此最大key的长度也是480bytes。
+
+###### 1.3.1.1.2 non_unique索引
+
+点的non_unique索引指的是非全局唯一的索引，即若一个属性设置了non_unique索引，
+在同一个图中，相同label的点的该属性可以存在相同的值。
+由于non_unique索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组vid的最大值。
+每个vid是5bytes长度，因此non_unique索引key最大长度是475bytes。
+但是，不同于unique索引，超过475bytes也可以建立non_unique索引。
+只不过在对这样的属性建立索引时会只截取**前475bytes**作为索引key（属性本身存储的值不受影响）。
+并且，在通过迭代器遍历时，也是先自动截取查询值的前475bytes再进行遍历，
+所以结果可能和预期不一致，需要用户再过滤。
+
+##### 1.3.1.2 边索引
+
+###### 1.3.1.2.1 unique索引
+
+和点类似，边的unique索引指的是全局唯一的索引，即若一个属性设置了unique索引，在同一个图中，相同label的边的该属性不会存在相同的值，
+unique索引key的最大长度是480bytes，**超过480bytes的属性不能建立unique索引**。
+
+###### 1.3.1.2.2 pair_unique索引
+
+pair_unique索引指的是两点间的唯一索引，即若一个属性设置了unique索引，在同一个图的同一组起点和终点之间，
+相同label的边的该属性不会存在相同的值。为了保证pair_unique索引key在同一组起点和终点之间不重复，
+索引在用户指定的key后面加上了起点和终点的vid，每个vid是5bytes长度。
+因此最大key的长度是470bytes，**超过470bytes的属性不能建立pair_unique索引**。
+
+###### 1.3.1.2.3 non_unique索引
+
+和点类似，边的non_unique索引指的是非全局唯一的索引，即若一个属性设置了non_unique索引，
+在同一个图中，相同label的边的该属性可以存在相同的值。
+由于non_unique索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组eid的最大值。
+每个eid是24bytes长度，因此non_unique索引key最大长度是456bytes。
+但是，不同于unique索引，超过456bytes也可以建立non_unique索引。
+只不过在对这样的属性建立索引时会只截取**前456bytes**作为索引key（属性本身存储的值不受影响）。
+并且，在通过迭代器遍历时，也是先自动截取查询值的前456bytes再进行遍历，
+所以结果可能和预期不一致，需要用户再过滤。
+
+#### 1.3.2 组合索引
+
+目前只支持对点的多个属性建立组合索引，不支持对边的属性建立组合索引。组合索引支持唯一索引和非唯一索引两种类型，建立索引的要求如下：
+1. 建立组合索引的属性个数在2到16个之间（含）
+2. 唯一组合索引的属性长度之和不能超过480-2*(属性个数-1)字节，非唯一组合索引的属性长度之和不能超过475-2*(属性个数-1)字节
+
+##### 1.3.2.1 唯一索引
+
+和点的普通唯一索引类似，点的组合唯一索引指的是全局唯一的索引，即若一组属性设置了unique索引，
+在同一个图中，相同label的点的该组属性不会存在相同的值。
+由于底层存储设计，组合索引key需要保存属性的长度，因此，
+组合唯一索引key的最大长度是480-2*(属性个数-1) bytes，**超过的属性不能建立唯一索引**。
+
+##### 1.3.2.2 非唯一索引
+
+和点的普通非唯一索引类似，点的非唯一索引指的是非全局唯一的索引，即若一组属性设置了非唯一索引，
+在同一个图中，相同label的点的该组属性可以存在相同的值。
+由于非唯一索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组vid的最大值。
+每个vid是5bytes长度，因此non_unique索引key最大长度是475-2*(属性个数-1) bytes，
+**超过的属性不能建立非唯一索引**。
+
+## 2. 图项目、点、边、属性命名规则和建议
+
+### 2.1 命名规则
+图项目、点、边和属性是识别符。该节描述了在TuGraph中识别符的允许的语法。
+下面的表描述了每类识别符的最大长度和允许的字符。
+
+|**识别符** |**长度** |**允许的字符**|
+|---------  |---------  |---------  |
+|用户、角色、图项目	|1-64字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+|点类型、边类型、属性	|1~256字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+
+### 2.2 使用限制
+
+|**描述**|	**最大个数**|
+|-------- |--------- |
+|用户数、角色数	|65536|
+|图项目的个数	|4096|
+|每个图项目的点和边类型数量之和	|4096|
+|每个点或边类型的属性数量	|1024|
+
+注：
+1、特殊字符和关键字说明：使用特殊字符或非保留关键字时，需要使用反单引号/backquote（``）进行引用；
+
+示例： ```match (`match`:match) return `match`.id limit 1```
+
+2、大小写敏感性：TuGraph大小写敏感；
+
+3、图项目、点/边、属性名称之间可以重复使用，同一点或边下的属性名称不可以重复；
+
+4、属性名字保留关键字：SRC_ID / DST_ID / SKIP
+
+
+### 2.3 命名建议
+|**识别符**|**描述**|**建议**|
+|-------|-------|--------|
+|图项目	|字母或中文开头	|如graph123、project123等|
+|点/边类型	|字母或中文开头，使用下划线区分单词	|如person、act_in等|
+|属性	|字母或中文	|如name、age等|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..ddb01d4a54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# 性能优先
+
+> 此文档主要介绍 TuGraph 性能优先的设计理念。
+
+## 1.简介
+
+TuGraph目前是世界上最快的图数据库，在图数据库标准评测LDBC SNB Interactive位居榜首（2023.3）。TuGraph的设计基于性能优先，致力于打造高性能的单机图数据库。该文档是TuGraph基于性能优先在存储层的核心设计。
+
+## 2.图操作的特性
+
+在属性图上的操作涉及读、写及其属性，对一些特殊的属性比如时间戳也访问模式也会影响到整体性能。这里通过对一些图操作特性的规律总结，来指导最终的性能。
+
+我们观察到很多图应用有类似的数据访问模式。例如，在信贷风险控制中，我们使用递归路径过滤搜索多对一模式，以找到可疑的信用欺诈用户和行为。针对网络赌博，可以通过识别短时间内的多笔资金转移，来发现涉赌的资金账号。股权穿透场景对实体间的股权关系进行递归计算。这些场景具有多跳实体和关系访问、时间窗口约束和读写事务等常见模式。
+更进一步，从介绍中的讨论和图负载的分析中，归纳出以下特征:
+
+**规律一** KHop是图中最典型的操作，它基于点和边的图拓扑的数据访问模式，和关系型数据库有着本质的区别。KHop 的典型性除了表现在数据访问模式不同，它同时也是图数据库最需要关注的性能点。
+
+**规律二** 图负载的数据访问在拓扑上有一定的局部性，同一个点的边通常会被同时访问。当这些边的标签相同时，有更大的概率会被同时访问。
+
+**规律三** 图负载在访问点边时，通常会访问其对应的属性，来作为遍历过滤的条件。
+
+**规律四** 在基于时序的图负载，对点边的过滤通常是在某个时间范围，比如最近的一周。
+
+**规律五** 写操作可能伴随着大量的读操作，需要在单个事务周期里处理。
+
+通过对实际线上图应用的分析，图负载的读写比率大约为 20:1，虽然场景局限在金融场景，集群数也有限，但涉及的数据规模和用户量非常庞大，具有一定代表性。20:1 的图负载读写比率，说明读工作负载对整体性能的影响更大， 而写工作负载的性能也不能忽视。
+
+## 3.存储数据结构
+
+TuGraph底层采用B+树来支持实时的增删查改事务。
+
+在排序树的数据结构中，B+树和LSM树为主要代表。B+树在树节点中使用拆分和合并式来更新排序数据，而 LSM 树在日志中追加更新，以进行延迟数据合并。B+ 早期用在文件系统的实现中，通过将数据保存 在自适应长度的叶子节点中，解决硬盘顺序操作和随机操作性能存在数据量级差别的问题，有较均衡的读写性能。LSM 树的主要优势使用 WAL(Write Ahead Log) 进行更新，将更新操作变成顺序操作，在键值较小时性能优势尤为突出。WAL 意味着将数据的更新合并推迟，批量更新能提升综合效率，也使得系统的调度变得复杂。如果更新合并完成前，恰好对其中的数据继续读取，LSM 树就需要读取几个层级局部合并的日志，会导致读取放大和空间放大，从而影响读效率。
+
+总结来说，B+ 树有较好的顺序读写性能，而 LSM 树在数据随机写方面占优。此外 LSM 树采用后台合并的方式，使得性能的波动难以预期，性能波动和上层存储和计算的关联性较弱，增加了整体设计的成本。综上考虑，TuGraph 选用 B+ 树作为读性能优先的实现。
+
+## 4.数据编码
+
+对于属性图模型而言，除了图拓扑编码外，属性数据也会很大程度影响功能和性能，我们先讨论属性数据如何与拓扑数据共存的编码格式。从目前的调研来看，属性编码有两种方式，我们称之为基于指针索引将属性数据单独存储的离散编码，和将属性数据和拓扑数据打包在一起的紧凑编码。离散编码根据程度的不同，可以每个属性都单独存储，或者每条边的属性打包后各自存储，下面的讨论对两种情况都适用。
+
+点查询。属性编码主要针对边，不涉及点查询。
+
+单边查询。离散编码通过指针定位边，紧凑编码则需要二分查找定位边的位置，离散编码有略微的优势。
+
+边遍历。离散编码在边遍历过程需要不断地进行指针跳转进行随机数据访问，而紧凑编码提前把数据排列在一起，顺序访问的特性使得效率大大提升。 由规律三知对边的遍历操作很普遍，紧凑编码在边遍历的优势明显。
+
+单边更新。离散编码对边的更新仅需找到对应的指针位置，插入数据后修改前后指针指向。紧凑编码则需要对紧凑排列的数据进行重编码，对整个边值进行重新写入，开销显著大于离散编码的情形。
+
+批量边更新。批量更新可以在内存中预先构建点的所有边属性，一次性编码写入，离散编码和紧凑编码相当。但紧凑编码不需要存储指针变量，更少的存储空间效率也会更高。
+
+以上离散编码和紧凑编码在某一类的查询的性能问题，可以通过优化的来缓解。整体上说，由于图负载读写 20:1 的特性，读性能在整体性能中占比更高。以及规律三所揭示的对属性访问的特征，TuGraph 更倾向于采用紧凑编码来保证读性能。其主要弱势为单边更新时重编码的开销，可以用自适应映射的技术来解决。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3f89389b2b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,34 @@
+# 多层级接口
+
+
+> 此文档主要介绍 TuGraph 的多层级接口的设计理念。
+
+## 1.简介
+
+多层级接口是 TuGraph 针对多丰富的使用场景，在易用性和高性中作出的平衡。比如描述式图查询语言 Cypher 能够抹去图数据库实现的细节，基于图模型的抽象来进行表达。Cypher 过于高层的表述，无法高效转化成底层的执行，因此提供了 Procedure API 的过程式语言，来发挥图数据库的最佳性能。
+
+接口可以大致分为客户端接口和服务端接口，大部分操作都在服务端完成，客户端只做数据的封装和解析。客户端和服务端通过网络连接，TuGraph 支持更加灵活的短连接 REST 协议，以及更加高效的长链接 RPC 协议，可根据不同的业务场景来选择。
+
+服务端接口均处在计算层，和图数据存储间用一层 Core API 在逻辑上隔开。
+
+![多层级接口架构](../../../../images/multi-level-Interfaces.png)
+
+## 2.客户端接口
+
+客户端接口指在客户端执行的接口，通常用于集成到软件应用中。TuGraph 的客户端的接口比较简单，包括登录登出、数据导入导出、存储过程加载调用、Cypher操作等。其中 Cypher 中集成了大部分的功能，包括数据操作、图模型操作、运维管理、账户管理等。
+
+由于 Cypher 的参数和返回值都是字符串，JAVA OGM 是对 Cypher 的结构化封装，即查询结果能够被封装为一个有类型的对象，方便使用。
+
+## 3.服务端接口
+
+服务端接口包括描述式图查询语言 Cypher、过程式图查询语言 Procedure API、图分析编程框架 OLAP API 和图神经网络编程框架 GNN PI，为图事务引擎、图分析引擎、图神经网络引擎提供服务，下面先展开介绍各个接口的特点。
+
+> __描述式图查询语言__ 是对查询逻辑的抽象描述，而与执行逻辑无关，对图数据库应用者比较友好，类比关系型数据库的 SQL 语言。TuGraph 的 Cypher 语言主要依照 Neo4j 开源的 OpenCypher 查询标准，同时对运维管理等辅助功能进行了扩展，在功能上囊括了 TuGraph 的大部分操作。描述式图查询语言会成为图数据库的主要数据操作方式，但由于描述到执行之间需要生成执行计划（Execution Plan），生成最优执行计划在学术界和工业界均有很长的路要走。
+
+> __过程式图查询语言__ 是为了解决描述式图查询语言与最优性能间的鸿沟。TuGraph的 Procedure API 是在 Core API 上做了一层简单的封装，C++ Procedure API的灵活性和高效性能够充分发挥存储的极致性能，也是 Cypher 优化的上限性能。Python Procedure API 是 C++ Procedure API 上的一层跨语言封装，翻译过程中值的拷贝会带来一定的性能损失，优势则主要是 python 语言本身的易用性。raversal API 是并行执行的 Procedure 接口，描述上更接近于集合的操作，比如扩展点集合所有出度邻居，获得一个新的点集。
+
+> __图分析编程框架__ 属于 ‘图计算系统’ 的范畴，会将图数据从支持增删改查的存储中导出快照，以更紧凑的数据存储格式来支持只读的复杂图分析，这里叫做OLAP API。OLAP API 封装了高并发执行的数据结构，包括 Vector、Bitmap等，以及基于 CSR 格式的图快照数据结构，然后提供一套并发的快速点边操作框架。在图分析任务完成后，数据可以通过接口写回图数据库。
+
+> __图神经网络编程框架__ 主要提供了图神经网络应用编程所需要的接口，能够对接PyTorch 等机器学习框架。TuGraph 的图神经网络编程框架主要集成了 DGL，在 Python 的语言环境中完成从图存储到图神经网络应用的完整流程。
+
+除了 Cypher 是解释执行外，其余服务端接口都是编译执行，即需要将对应代码传到服务端后，进行编译（可能会有时间开销），再在服务端执行。所以通常需要先加载，然后再已加载的应用列表中找到程序，传输入参数后执行。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..e895545616
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> 此文档主要介绍 TuGraph 的HTAP的设计理念。
+
+## 1.简介
+
+![htap架构](../../../../images/htap.png)
+
+HTAP 的实现在架构上有多种不同的方式：一是用两个不同的副本来分别处理 OLTP 和 OLAP 的任务，核心是数据的一致性同步和额外的资源开销；二是在任何时候都使用同一份数据存储，该实现的数据结构存在内存膨胀，在工业化落地还需要进一步工作。在 TuGraph 的设计中，简单的 OLAP 操作和 OLTP 操作共用一份数据，而复杂的 OLAP 操作则单独导出快照处理。
+
+## 2.设计
+
+在 TuGraph 中，OLTP 为图事务引擎，在图 4.4对应事务操作；OLAP 为图分析引擎，对应简单图分析操作（比如 SPSP）和复杂图分析操作（比如 PageRank），前者可以直接在图存储上执行，而后者需要额外导出快照执行。
+
+- 事务操作，即图事务引擎测的操作，为局部图的增删查改操作，典型的应用为 K 跳访问 K-Hop。
+- 简单分析操作，是图分析引擎中较为简单的部分，通常也是局部的图分析操作，比如两点间最短路算法 SPSP、Jaccard 算法。
+- 复杂分析操作，是图分析引擎中较为复杂的部分，通常涉及全图的多轮数据迭代操作，比如网页排序算法 PageRank、社区发现算法 Louvain。
+
+如架构图所示，我们在图中增加了外部存储，使得图分析的数据源不局限在图数据库中，可以直接从文本文件读取。
+
+- 图存储，即图数据库中的存储，有精心设计的数据结构，能够完成实时增删查改。
+- 外部存储，可以是 RDBMS 或文本文件，以边表的简单方式存储，仅供一次性批量读取，和批量结果写入。在计算层，和整体架构图中的接口对应。
+- Cypher，描述式图查询语言，可以并发执行。
+- Procedure API，过程式图查询语言，其灵活性能够同时支持事务操作和图分析操作，但效率上不足以完成复杂图分析操作，可以并发执行。
+- OLAP API，针对多轮迭代的复杂图分析。应用需要先将存储中的图数据导出成内存中的一个快照，该快照仅用来快速访问，而不需要考虑 ACID 的写支持，因此可以排布地更加紧凑，CSR 排布的读效率要远高于图存储的数据排布。OLAP API 只能串行执行，每个操作都用满 CPU 资源。
+
+OLAP API 的快照可以从外部存储创建，即将边表数据构成件 CSR 的格式；或者从图存储中创建。需要注意的是，OLAP API 要求点的 ID 是连续的自然数，可能需要额外的 ID 映射，该步骤在创建快照时可以在指定一个属性进行映射，或直接取属性值作为 ID。
+
+与计算接口和存储相对应，有四种运行模式。
+
+- 事务模式，每个操作对应一条 Cypher 语句，默认是一个事务。
+- Plugin 模式，通过插件的方式，在计算逻辑加载到服务端后调用，也叫存储过程。
+- Embed 模式，和 Plugin 模式的使用接口一致，区别是图数据库服务不需要起来，就可以直接用接口调用数据库中的数据，通常用于调试 Procedure API 和OLAP API 的代码，调试信息和操作步骤比 Plugin 模式更加友好。
+- Standalone 模式，最大程度剥离与图数据库的关系，仅想用图分析引擎做数据分析时，该模式会比较直接。Standalone 模式会直接使用外部存储的数据。
+
+图神经网络引擎的使用方式和 ‘复杂图分析操作’ 类似，会同时调用部分 OLAP API 和 GNN API，不在这里展开。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..c055f3df01
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,10 @@
+产品特点
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
+    
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..cf901d31cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# TuGraph产品架构
+
+> 此文档主要介绍 TuGraph 的产品架构。
+
+## 1.简介
+
+![产品架构](../../../images/architecture.png)
+
+上图从功能模块的角度，以 TuGraph 为例，给出了企业级图数据库的整体架构，自下而上包括：
+
+- 软硬件环境。涉及图数据库的开发和使用环境。TuGraph 主要基于底层的 C++语言开发，能够兼容市面上大部分操作系统和 CPU。
+- 存储层，包括 KV 存储层和图存储层。存储层需要支持计算层所需的各个功能。
+- 计算层。计算层应包括图事务引擎、图分析引擎和图神经网络引擎，也包含了服务端提供的多种编程接口，包括描述式查询语言 Cypher，存储过程等。
+- 客户端。客户端 SDK 应支持 Java、Python、C++ 等多种语言，也支持命令行的交互方式。Browser 和 Explorer 通过网页端交互的方式，降低了图数据库的使用门槛。
+- 在生态工具方面，覆盖了企业级图数据库的开发、运维、管理等链路，提升可用性。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..c24881b9cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/7.functionality.md
@@ -0,0 +1,110 @@
+# 功能概览
+
+> 此文档主要介绍 TuGraph 的主要功能和特性。
+
+## 1.安装部署
+
+## 1.1.部署方式
+
+TuGraph目前提供云部署、Docker部署以及安装包部署三种部署方式，用户可根据实际情况选择适合的部署方式。
+
+## 1.2.软硬件环境
+
+TuGraph核心是由C++开发，默认使用的编译器为GCC8.4，使用c++17标准。此外，存储过程中额外提供了Python Procedure API，该功能需要Python环境。TuGraph不需要特殊的硬件比如GPU，对RDMA、HBM等高延迟低带宽的通用硬件升级可以天然适配。
+
+TuGraph测试过基于X86和ARM的CPU，包括Intel、AMD、Kunpeng、Hygon、飞腾等，也同时在多个操作系统上运行，包括Ubuntu、CentOS、SUSE、银河麒麟、中标麒麟、UOS的主流版本，对操作系统和CPU没有特殊的要求。
+
+软硬件环境也包括依赖库的环境，由于TuGraph的存储层中默认的KV存储是LMDB，需要文件系统能够支持POSIX接口。在不同的环境下编译和参数配置会略有不同，比如在图存储的点边数据打包中，应和操作系统的页表大小匹配，默认为4KB，建议将系统的页表大小也设置为4KB。
+
+## 2.存储层
+
+在图数据模型上，TuGraph支持属性图模型，按照层次可以分为子图、标签（包括点标签和边标签）、属性。从存储层看，TuGraph使用使用直观的多层的树状模型，没有跨子图的标签，也没有跨标签的属性，仅保留图模型的核心逻辑。
+
+在子图的存储上，TuGraph对多图做了数据的物理隔离，每个图对应一个LMDB的实例。多图的元数据描述信息，保存在meta的特殊的公共LMDB实例中。点边标签及其属性的存储，通过将图数据自适应地映射到KV键值对，最大程度发挥读性能。同时在KV层实现了多线程写，解决了LMDB写性能较低的劣势。主键索引和二级索引，对应LMDB中B+的表，支持基于比较的索引值增删查改。
+
+存储层还保留了一些其他非核心功能的数据，包括权限数据、预编译的插件数据、监控数据等。
+
+## 3.计算层
+
+计算层在功能上分成三个部分，包括TP类的图事务引擎，AP类的图分析引擎和图神经网络引擎。
+
+- __图事务引擎__，主要用来处理并发的图操作，包括单点查询、邻居查询、路径遍历。图事务引擎侧重并发操作的ACID事务，确保操作逻辑不会互相干扰，主要性能指标为 QPS，即每秒完成的查询数量。
+
+- __图分析引擎__，操作类型通常为全图迭代。部分简单的分析任务（比如SPSP）可以由图事务引擎完成，复杂的分析任务均由图分析引擎完成，单个任务通常需要数秒至数小时。因此单个图分析任务要并发利用所有的硬件资源，性能指标为任务完成的总时长。
+
+- __图神经网络引擎__，通常也为全图迭代。图神经网络引擎除了基于图拓扑的操作，也需要集成一个机器学习的框架来处理向量操作，比如 PyTorch、MXNet、TenserFlow。
+
+三个引擎的操作逻辑不尽相同，独立配置资源池。事图事务引擎基于RPC操作设置了一个线程池，每接受客户端的一个操作，从线程中取一个线程来处理，并发执行的数量等于RPC线程池的容量，通常配置为服务器的核数。图分析引擎有一个分析线程池，每个图分析任务会并发执行，即用所有的线程来执行一个任务，来加速操作的性能。TuGraph图分析操作串行执行的特性会一定程度限制用户的使用体验，并发的图分析的需求可以通过高可用部署的方式，增加机器资源来处理，或者接入外部的任务调度器，将数据传到实时调度的容器来计算。图神经网络操作在图上的操作会复用图事务引擎或图分析引擎的资源，向量的操作会起单独的资源，在机器学习框架中可以使用GPU等单独的加速硬件。
+
+## 4.核心功能
+
+### 4.1.查询语言
+
+TuGraph 提供 Cypher 图查询语言，遵循OpenCypher标准。
+- __支持Procedure嵌入__
+
+- __可插拔优化框架__ 各类优化功能
+
+- __可扩展安全性检查框架__ 对于cypher进行
+
+### 4.2.存储过程
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个 REST 请求并在客户端完成整个
+处理流程的方式，TuGraph 提供的存储过程（Procedure）是更简洁和高效的选择。
+
+从 3.5 版本开始，TuGraph 重新设计了新的存储过程编程范式，支持定义标准的签名和结果，支持POG编程。
+
+TuGraph 支持 POG (Procedres on Graph Query Languages) 编程和 POG 库，其中“Graph Query Languages”包含 Cypher 以及
+制定中的 ISO GQL 等图查询语言。POG 库提供在查询语言中对用户定义的存储过程的访问，打破了查询语言和存储过程之间的界限，扩展了查询
+语言的使用范围。
+
+> 这个文档描述了 [新的 Procedure 编程范式以及 POG](../9.olap&procedure/1.procedure/1.procedure.md)。
+
+### 4.3.数据导入导出
+
+尽管TuGraph本身支持数据的插入，但批量导入能够大幅提升的效率。导入的功能可以分为空库导入（离线导入）和增量导入，前者指子图是空的时候进行导入，额外的假设能够大幅提升导入的性能，在 TuGraph 中，空库导入和增量导入的吞吐率差了10 倍。在数据导出中，需要考虑导出数据的一致性，即是基于一个快照数据导出的。
+
+TuGraph 可以通过 命令行工具`lgraph_export` 来对已经存放在TuGraph的图数据进行数据导出，导出格式支持CSV和JSON。
+
+### 4.4.备份恢复
+
+TUGraph的备份在功能上可分为主动/定时、离线/在线、全量/增量备份，用尽量小的存储和计算代价来完成备份。恢复功能可以恢复到最新的状态，或者历史标注的时间点，需要保证数据库是一致的状态。
+
+### 4.5 数据预热
+
+TuGraph 是基于磁盘的图数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+### 4.6 高可用
+
+高可用是指通过通过集群配置，做到实时多副本数据热备，在部分副本不用时，集群仍然能正常提供服务，TuGraph采用 RAFT 协议的多机热备机制，能够将 RPO 降低到接近 0 的程度。TuGraph 选择在计算层进行数据同步，同步的对象是写操作，通过 RPC 接口快速同步。TuGraph 的高可用集群采用主从模式，只有主节点处理写请求，主从节点均能处理读请求。主节点的写请求处理需要同步到多于二分之一的总节点上，多数节点写成功，该写请求才算完成。
+
+## 5.客户端工具
+
+客户端主要分为各种编程语言的SDK，OGM以及命令行工具。
+
+客户端 SDK 主要用于二次开发，可以通过 RPC 或 REST 协议链接服务端。RPC 基于长链接有较好的性能，数据需要通过 protobuf 统一序列化。TuGraph 使用brpc，支持 Java、Python、C++ 的 rpc 客户端。REST 的协议比较宽泛，能够简单适配更加多样的环境，不同的编程语言能够简单对接。TuGraph 给出了 Python 的REST 客户端实例，命令行的交互也是用 REST 实现。
+
+OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。
+
+命令行工具`lgraph_cypher`是查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+
+## 6.生态工具
+
+生态工具是企业级数据库一个非常重要的组成部分，丰富的生态工具能够大大提升图数据库的可用性，稳定性。
+
+### 6.1.TuGraph DataX
+
+![导入导出](../../../images/tugraph-datax.png)
+
+TuGraph 核心支持 CSV 和 JSON 合适的导入导出，提供空库导入和增量导入的模式。实际中会存在 MySQL、Kafka、Hive 等多数据源导入的需求，TuGraph 通过 DataX 做多数据源的对接。由于关系模型和图模型存在的差异，数据清洗的流程可以使用 SparkSQL 快速处理，TuGraph 本身仅关注 CSV 和 JSON 的简单场景导入可靠性和性能。
+
+### 6.2.可视化交互
+
+TuGraph Browser 是面向图数据库直接使用者的可视化交互界面，功能上覆盖了 TuGraph 的绝大部分能力，包括数据导入、图模型建立、数据增删查改、监控运维等操作链路。
+
+### 6.3.运维监控
+
+TuGraph 使用 Prometheus 加 Grafana 的监控框架，采用松耦合的方式。Prometheus 从 TuGraph 的监控接口获取监控信息，存储在本地时序数据库中，然后通过 Grafana 在网页端交互展示。
+
+TuGraph 提供的监控的状态包括图数据库的状态和服务器的状态，前者包括读写负载、点边数量等数据库端的状态，后者包括内存、CPU、硬盘等服务器的实时状态。如果某些监控状态超过了预期的阈值，就需要主动告警，通常需要对接其他运维管控系统，比如群消息、邮件告警等。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..4cc5c0c10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# 应用场景
+
+> 此文档主要介绍图数据库适用的应用场景。
+
+## 1. 金融领域
+
+金融领域的实体主要涉及人、公司、账户、产品等，它们之间的关系包括交易关系、登录关系、股权关系、雇佣关系等。这些实体构成了一张金融图数据网络。应用图数据库，我们可以从金融图数据网络里发掘出大量有用信息，帮助我们做出更准确的金融决策。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|贷款审核|通过分析申请人的关联关系、交易情况等辅助判断申请人的偿还能力和偿还意愿，可应用于零售贷款审核、小微贷款审核、供应链金融等。此方法可与传统的基于申请人自身信息的审核机制互补，在个体信息录覆盖较低的小微贷款审核中尤其有用。|
+|贷后管理|通过分析借款人交易情况，辅助分析借款人是否有逾期风险。相比于传统只在贷款资金流向特定用户的情况下发出警报的方式不同，该方法可以给每个账户赋予一个风险值，并在贷款流向高风险账户时给出预警。|
+|失联修复|通过分析失联贷款人的社交和购物数据，找出其它联系方式。该方法可以大幅改进失联修复率。|
+|担保环检测|可在担保关系图中找出环状、链式、家族式、交叉等特殊担保结构，揭露潜在风险。相比于关系型数据库的JOIN方法，基于图算法的方案更高效，可以检测出任意长的担保环，且可以实现更复杂限定条件的检测。|
+|信用卡团伙欺诈检测|构建信用卡申请信息中的地址、联系方式等关系网络，在申请关系网络中运行社区发现算法，可以检测出疑似欺诈的团伙，从而拒绝涉嫌欺诈的申请件，减少经济损失。|
+|反洗钱|通过交易网络和介质网络，找出疑似洗钱的行为和链路。洗钱是一个复杂的多方参与的过程，通过在交易和社交网络中进行图分析，我们可以更精准的检测出洗钱行为。|
+|车险反欺诈|针对有修理厂参与的骗保行为，通过分析被保人、案件地点和修理厂之间的关系，可以更精准的识别出骗保行为，减少经济损失。|
+
+## 2. 工业领域
+
+在生产和制造过程中会产生大量异构数据，如何有效的组织和管理这些数据是工业大数据中最重要的问题之一。这些数据包括设计文档、设备数据、仿真方案和结果、实验结果、经验文档等，关系错综复杂。传统的数据管理系统只能累积数据，而查找相关材料则往往力不从心。使用图模型，将这些不同类型的数据组织成一张网络，就可以方便地浏览和查找数据。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|供应链管理|供应链数据主要关心产品—部件—零件的对应关系、零件与供应商的对应关系、零件中的敏感成分等。相比于传统的物料管理（BOM）系统，使用图数据库的方案可以更方便地维护多个部件层次、多个供应商级别的复杂网络，从而为穿透式供应链提供基础支持。|
+|文档管理|使用图数据库可以将不同类型的文档按不同关系有机地组织在一起。例如将部件设计文档、部件—零件关系、部件测试文档、相关经验文档等组织起来，在需要查找时就可以方便获取该部件的所有相关信息。|
+|研发过程管理|产品研发和验证过程中需要进行大量仿真、试验和测试，每一个测试流程都会涉及大量不同的步骤。步骤之间的连接关系、每个步骤中使用的数据版本、算法版本等就构成了一张复杂的关系网络。使用图数据库可以更好管理这个关系网络，从而为研发过程中的数据复用、流程改进提供良好基础。|
+|设备信息管理|制造业需要管理大量设备，设备之间又互相关联（供电关系、供料关系、空间关系），从而形成了一张复杂的网络。传统的数据库很难体现这种复杂关系。而使用图数据库则可以便捷表示这些关系，从而更好的管理设备信息。|
+
+## 3. 智慧城市
+
+随着科技的发展，城市的智能化管理已成为一个大趋势。智能化管理需要建立在良好的信息管理平台之上，因此需要强大的系统软件做支撑。在智能化城市管理系统中，智能化决策系统需要基于大量不同信息做出决策，这些信息包括各种拓扑信息（道路、管线），供求信息（电力输送、饮用水供应、污水排放），环境信息（温度、湿度、雨量）等。要将这些复杂的异构数据有机管理起来，并基于它们做出决策，就需要一个成熟的系统。传统的数据管理系统基于关系数据模型，并不适合管理这种复杂异构数据。而使用图模型就可以很好的解决这一问题。如果我们将这些不同的数据利用图数据库进行管理，就可以实现很多复杂的智能管理场景。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|智能交通|基于道路拓扑、道路容量及当前流量，可以进行智能信号灯调度，从而提高通行效率。|
+|智能排水|基于排水系统信息及当前雨量，可以对排水系统进行调度，从而减少内涝的产生。|
+|管线管理|将管线的生产、安装、拓扑信息，以及历史状态信息有机组织起来，可以帮助我们对管线进行全周期管理，包括故障排查、寿命评估等。|
+|人群疏散|大量人群需要疏散时，需要考虑公交、地铁、出租车、共享单车等多种交通方式，同时还需要考虑道路承载量。使用图数据库将这些信息有机整合在一起，可以帮助我们更好的做出决策，以便为大型公共活动提供更好的支持。|
+
+## 4. 社会治理
+
+社会治理包括公共安全、法律事务、舆论、网络安全等多方面。社会治理是一个综合性的、多系统联动问题。它需要综合大量数据、全局考量才能做出更好的决策。在这种多维度复杂数据问题上，图数据模型可以提供更好的适应性，从而为智能化的社会治理决策平台提供坚实的基础。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|犯罪团伙发现|合谋团伙必然会通过某些方式产生联系，这种联系包括面谈（出现在同一地点）、电话联系、或者互联网联系，他们还可能有经济往来。如果我们将这些数据统一存放在一张图中，我们就可以通过图分析算法查找出联系紧密的群体，从而发现和识别整个犯罪团伙。|
+|涉众案件调查|涉众案件，特别是涉众经济案件往往涉及大量的人员和要素（货币、地点、事件等）。如何有效的组织这些资料，从而为办案提供证据支持是涉众案件调查的一个难点。使用图数据库来存储和分析这些资料，可以让我们快速定位资料、分析人员构成、为案件调查提供更好的技术支持。|
+|违法网站甄别|违法网站、钓鱼网站、黄色网站等往往通过使用不同的域名和IP来避免被封杀。基于黑名单的过滤方法只能封禁已知的违法网站，无法对新出现的域名和IP进行有效甄别。基于IP—域名网络的映射关系，我们可以建立一张图，然后通过图计算建立起域名和IP的“可信度”模型，利用该模型来判断网站是否属于违法网站。|
+|法院卷宗管理|卷宗往往错综复杂，不同的案件之间可能通过当事人产生联系，也可能通过案发地、案件性质、审判人员等产生联系。这些联系构成了一张复杂的网络。使用图数据库我们可以更方便的管理这些复杂关系，提高办案和查询效率。|
+
+## 5. 互联网
+
+人—人关系的社交网络、人—商品的购买关系都能构成图。通过分析这些网络数据，我们可以为用户提供更优质的服务，包括相关推荐、用户信息归集、重要用户识别、垃圾用户识别等。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|ID映射|图数据库可以将用户相关的所有信息，包括用户之间的关系统一存储在一个数据库中，同时还能通过这些关系来找出疑似单人多号和多人一号的情况，从而为后期的风控、推荐等业务提供决策支持。|
+|好友推荐|基于分析社交网络，我们可以提供“好友的好友”，“共同好友”等好友推荐。|
+|商品推荐|基于用户—商品关系图，我们可以找出兴趣爱好类似的用户，向他们推荐类似用户选择的其他商品。|
+|垃圾用户识别|传统的垃圾用户识别主要基于用户账号本身的信息，如注册信息、发帖信息等，但是这些信息都比较容易伪造。而基于网络的信息则不存在这个问题：它们很难被伪造。因此基于网络信息的垃圾用户识别可以更加精准和高效。|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..5171d5ece8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/9.glossary.md
@@ -0,0 +1,38 @@
+# 名词解释
+
+## 1.图技术
+
+> __图计算__：广义图计算，技术上包括图查询、图分析、图学习；狭义图计算，包括图计算任务和图分析。
+
+> __图查询__：指图数据库的查询能力，通常通过Cypher/ISO GQL等查询语言实现。
+
+> __图分析__：侧重于对全图数据的算法分析、模式分析等。
+
+> __图学习__：与图神经网络、图机器学习含义相同。
+
+> __图智能__：等于广义图计算，包括图数据库、图分析、图学习，通常用于概念推广，不用于产品。
+
+## 2.图产品
+
+> __图计算系统__：一般包括图数据库、图分析系统、图学习系统，有时也特指图分析系统。
+
+> __图数据库__：侧重于对图数据的增删改查、事务性操作等，如TuGraph DB、Neo4j、JanusGraph等。
+
+> __图分析系统__：解决图分析问题，可以细分为流水图分析、离线图分析，如TuGraph Analytics、GraphX等。
+
+> __图学习系统__：解决图学习问题，比如TuGraph Learn、DGL等。
+
+## 3.具体概念
+
+
+> __Vertex__：点，也叫顶点，也指 Vertex Value。尽量避免Node（结点、节点）的叫法，一般用Node表示服务器个数，容易叫混。结点指结合、交结、交叉的意思；节点可以指一个时间线上的里程碑（关键节点）或计算机系统里的一个处理实体（如计算机网络里的一台服务器）。
+
+> __Edge__：边，也指 Edge Value。
+
+> __Vertex Label__：点类型，也叫 Vertex Type。
+
+> __Edge Label__：边类型，也叫 Edge Type。
+
+> __Degree__：度，入度/出度，表示一个点的入边、出边的条数。注意，在非图论的场景中，往往把“跳”也称作“度”。
+
+> __Hop__：跳，表示一个点到另一个点之间的路径经过的点数（不含起点、含终点）。算法性能测试里K-Hop即为此义。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/index.rst
new file mode 100644
index 0000000000..efe03a5128
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph入门
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..f42394fc70
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/1.preparation.md
@@ -0,0 +1,88 @@
+# 快速上手
+
+> 此文档主要用于新用户快速上手，其中包含了 TuGraph 的简介、特征、安装和使用。
+
+## 1.简介
+
+TuGraph 是蚂蚁集团自主研发的大规模图计算系统，提供图数据库引擎和图分析引擎。其主要特点是大数据量存储和计算，高吞吐率，以及灵活的 API，同时支持高效的在线事务处理（OLTP）和在线分析处理（OLAP）。 LightGraph、GeaGraph 是 TuGraph 的曾用名。
+
+主要功能特征包括：
+
+- 标签属性图模型
+- 支持多图
+- 完善的 ACID 事务处理
+- 内置 34 图分析算法
+- 基于 web 客户端的图可视化工具
+- 支持 RESTful API 和 RPC
+- OpenCypher 图查询语言
+- 基于 C++/Python 的存储过程
+- 适用于高效图算法开发的 Traversal API
+
+性能及可扩展性特征包括：
+
+- TB 级大容量
+- 千万点/秒的高吞吐率
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线备份
+
+
+### 1.1.支持的平台
+
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的的平台。
+
+### 1.2.硬件要求
+
+_目前我们建议用户使用 NVMe SSD 配合较大的内存配置以获取最佳性能。_
+
+| 硬件   | 最低配置      | 建议配置                     |
+|------|-----------|--------------------------|
+| CPU  | X86_64    | Xeon E5 2670 v4          |
+| 内存   | 4GB       | 256GB                    |
+| 硬盘   | 100GB     | 1TB NVMe SSD             |
+| 操作系统 | Linux 2.6 | Ubuntu 18.04, CentOS 7.3 |
+
+## 2.安装
+
+TuGraph 可以通过 Docker Image 快速安装，或者通过 rpm/deb 包本地安装。另外TuGraph在阿里云计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。
+
+> 安装包/镜像下载：参考[下载地址](../1.guide.md)中的“TuGraph最新版本”章节。
+
+> 计算巢部署：可以在阿里云计算巢自行搜索，也可以通过[部署链接]( ../5.installation&running/5.cloud-deployment.md )快速访问。
+
+### 2.1.通过docker快速体验
+
+1. 本地安装 docker 环境
+
+   参考 docker 官方文档：https://docs.docker.com/get-started/
+
+2. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. 启动docker
+   ```shell
+    docker run -it -d -p 7001:7001 -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000是默认的http端口，访问tugraph-db-browser使用。
+   # 7070是默认的http端口，访问legacy tugraph-web访问使用。
+   # 7687是bolt端口，bolt client访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   
+   # 根据/usr/local/etc/lgraph.json的tugraph启动的默认配置，
+   # /var/lib/lgraph/data是容器内的默认数据目录，/var/log/lgraph_log是容器内的默认日志目录
+   # 命令将数据目录和日志目录挂载到了宿主机的/root/tugraph/上进行持久化，您可以根据实际情况修改。
+   ```
+
+4. 前端访问
+
+访问tugraph-db-browser: `http://x.x.x.x:8000`，默认用户名为 `admin`，密码为 `73@TuGraph`。
+首次登录会默认跳转修改密码页面，请尽快修改默认密码避免安全风险。
+
+**注意**：
+如果需要使用legacy tugraph-web，访问`http://x.x.x.x:7070`，默认用户名为 `admin`，密码为 `73@TuGraph`。 
+但请注意，legacy web是不再维护的版本，建议使用tugraph-db-browser。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..b8dd8d03ec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# 影视场景Demo
+
+> 此文档主要介绍 影视场景Demo 的使用方法。
+
+## 1.建模和数据导入
+
+完成登录后，点击`新建图项目`，选择movie数据，填写图项目配置，系统会自动完成Movie场景图项目创建。或者直接使用产品自带的movie图项目（带有官方图标）。
+
+Movie 场景图：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| 标签          | 类型  | 说明                                  |
+|-------------|-----|-------------------------------------|
+| movie       | 实体  | 表示某一部具体的影片，比如"阿甘正传"。                |
+| person      | 实体  | 表示个人，对影片来说可能是演员、导演，或编剧。             |
+| genre       | 实体  | 表示影片的类型，比如剧情片、恐怖片。                  |
+| keyword     | 实体  | 表示与影片相关的一些关键字，比如"拯救世界"、"虚拟现实"、"地铁"。 |
+| user        | 实体  | 表示观影的用户。                            |
+| produce     | 关系  | 表示影片的出品人关系。                         |
+| acted_in    | 关系  | 表示演员出演了哪些影片。                        |
+| direct      | 关系  | 表示影片的导演是谁。                          |
+| write       | 关系  | 表示影片的编剧关系。                          |
+| has_genre   | 关系  | 表示影片的类型分类。                          |
+| has_keyword | 关系  | 表示影片的一些关键字，即更细分类的标签。                |
+| rate        | 关系  | 表示用户对影片的打分。                         |
+
+## 2.查询示例
+
+### 2.1.示例一
+
+查询影片 'Forrest Gump' 的所有演员，返回影片和演员构成的子图。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.示例二
+
+查询影片 'Forrest Gump' 的所有演员，列出演员在影片中扮演的角色。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.示例三
+
+查询 Michael 所有评分低于 3 分的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.示例四
+
+查询和 Michael 有相同讨厌的影片的用户，讨厌标准为评分小于三分。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.示例五
+
+给 Michael 推荐影片，方法为先找出和 Michael 讨厌同样影片的用户，再筛选出这部分用户喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.示例六
+
+查询 Michael 的好友们喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.示例七
+
+通过查询给'Forrest Gump'打高分的人也喜欢哪些影片，给喜欢'Forrest Gump'的用户推荐类似的影片。
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..fee5e77f3e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,62 @@
+# 场景：流浪地球
+
+> 此文档主要介绍 流浪地球 demo的使用方法。
+
+## 1.Demo场景设计
+
+Demo背景基于流浪地球1、流浪地球2的故事背景进行设计
+
+- 基于剧情，设计了图结构，包含组织、角色、天体与设施3类点，事件、关系两类边
+- 根据剧情准备了对应Schema的数据
+- 准备了一些query，提出一些关于剧情的问题
+
+## 2.目录结构
+
+- rawdata: 原始剧情数据和schema定义文件
+- case.cypher: 查询相关的Cypher语句
+- control.sh: 控制TuGraph Server启动停止的脚本
+- lgraph_standalone.json: TuGraph Server启动的配置文件
+
+## 3.使用说明
+
+前置条件：TuGraph已安装
+
+## 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8000，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择流浪地球数据，填写图项目配置，系统会自动完成流浪地球场景图项目创建。
+    - 或者直接使用产品自带的流浪地球图项目（带有官方图标）。
+
+## 5.Cypher查询
+
+参考cypher文档，在TuGraph的Web页面前端输入Cypher进行查询
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 6.2.查询展示
+查询木星危机的所有事件经过
+
+```
+MATCH (n)-[e:事件关系]-(m) where e.title='木星危机' RETURN n,e
+```
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+查询所以危机的相关事件经过
+
+```cypher
+MATCH (n)-[e1]-(m)-[e2]-(p)
+where e1.title REGEXP ".*危机" and e2.title REGEXP ".*危机" and e1.title <> e2.title
+RETURN n,e1,e2,p
+```
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..41b58b1dfd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,88 @@
+# 场景：三体
+
+> 此文档主要介绍 三体 demo的使用方法。
+
+## 1.Demo场景设计
+Demo背景基于三体1、三体2、三体3的故事背景进行设计。
+
+根据三体故事的设定，我们设计了4类点和6类边，点包括“人物”、“组织”、“计划”、“时间线”，边包括“人物-人物关系”、“人物-计划关系”、“人物-组织关系”、“组织-计划关系”、“组织-组织关系”。
+根据剧情准备了对应Schema的数据，准备了一些query，提出一些关于剧情的问题。
+
+## 2.目录结构
+rawdata: 原始剧情数据和schema定义文件。
+case.cypher: 查询相关的Cypher语句。
+control.sh: 控制TuGraph Server启动停止的脚本。
+lgraph_standalone.json: TuGraph Server启动的配置文件。
+
+## 3.使用说明
+
+前置条件：TuGraph已安装。
+
+### 4.数据导入
+
+- 手动导入
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。
+    - 参考control.sh中的load函数，加载数据。
+    - 参考control.sh中的start函数，启动TuGraph服务。
+    - 启动TuGraph服务后，访问${HOST_IP}:8000，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三体数据，填写图项目配置，系统会自动完成三体场景图项目创建。
+    - 或者直接使用产品自带的三体图项目（带有官方图标）。
+
+### 5.Cypher查询
+
+参考TuGraph文档，在TuGraph的Web页面前端输入Cypher进行查询。
+
+## 6.使用展示
+
+### 6.1.数据导入的展示
+
+![data](../../../../images/three-body-data.png)
+
+### 7.查询展示
+
+#### 7.1.人物关系查询
+三体一剧情中，一开始全世界各地发生了大量科学家自杀事件，引起了警方重视，查案过程根据人物关系线索一步步排查，就如上面的图所示，随着线索越来越多，背后的真相逐步浮出水面。史强和汪淼发现大多数人都和叶文洁有着直接或者间接的联系，并派汪淼卧底，最终发现叶文洁的最终统帅身份。在图中也可以看出，叶文洁顶点周围有很多边关系（一度或二度邻居很多）。
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+#### 7.2.邻域顶点分析
+三体中的各种计划比较多，有的时候可能会被绕晕，这时候我们可以通过图的邻居顶点查询来查看该计划的相关人物和组织等。如"面壁计划"中,我们可以看到有四位人物与之相关，这四位也是被世人所寄予厚望的“面壁者”。
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+#### 7.3.查询a节点和b节点的共同邻居
+我们往往希望知道两个人物之间的共同关联的人物都有谁，这样就能很快的掌握这两个人物之间的关系，在大数据量的情况下，使用cypher进行图关系分析就很方便！
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+#### 7.4.设置/更改属性
+随着剧情推进，我们逐步了解了"叶文洁"身上的多个标签，那么我们也可以将这些标签更新至“叶文洁”节点上：
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+#### 7.5.增加/删除节点
+后续我们了解到了罗辑、程心等等人物和PIA、星环集团等组织，希望把这些作为节点添加至图中：
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..3252a13eb5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# 场景：三国
+
+> 此文档主要介绍 三国 demo的使用方法。
+
+## 1. 简介
+由于史料的缺失，一些即使为人们熟知的历史事件也往往存在着很多未解之谜。以三国历史为例，诸葛亮为什么出山帮助当时势力弱小的刘备，同为天下英雄的曹操和刘备为什么成就差距巨大等等。以往学者往往采用二维关系分析历史，这样得出的结论往往比较片面。使用TuGraph将三国的历史人物和事件导入图模型中，使用图计算方式进行分析，能够帮助我们从有限的信息中获得更有价值的知识，是一种非常有意义的跨学科尝试。
+## 2. 数据建模
+我们设计了5类顶点和5类边，点包括“主公”，“州”，“文臣”，“武将”，“战役”，边包括“父亲”，“兄长”，“隶属”，“籍贯”，“参战”。其具体建模信息如下所示：
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. 数据导入
+- 手动导入
+    - 向TuGraph导入数据，既可以使用TuGraph的`lgraph_import`工具离线导入。lgraph_import导入命令如下所示
+```shell
+lgraph_import -c import.json --overwrite true --continue_on_error true
+```
+- 自动创建
+    - 点击`新建图项目`，选择三国数据，填写图项目配置，系统会自动完成三国场景图项目创建。
+    - 或者直接使用产品自带的三国图项目（带有官方图标）。
+## 4. Cypher分析
+### 4.1. 诸葛亮为什么选择刘备
+通过如下cypher命令可以查看诸葛亮和曹操、刘备之间的关系
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+从图中可以很直观的看出，曹操和诸葛亮之间的最短路径之一包含徐州之战，曹操曾经因父亲被杀对徐州进行过屠城，而诸葛亮是徐州琅琊郡人，任何人都断然不会选择一个屠杀过自己家乡的军阀作为主公。而相反，刘备曾经在徐州之战中阻止过曹操的暴行，这应当是诸葛亮对刘备好感的原因之一。
+
+### 4.2. 曹操为什么成就比刘备高
+通过如下cypher命令可以查看家族对曹操创业的助力
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+平定天下最重要的就是军事人才，曹操其父本姓夏侯，过继于曹氏，曹氏和夏侯氏在谯县都属于地方大族，在曹操创业初期提供了夏侯惇，夏侯渊，曹仁，曹洪在内大量的军事人才。而刘备其父早丧，没有家族助力，年过50才凑齐了自己的五虎上将，而这时已经过了天下大乱争夺地盘的最佳时机，曹操已经天下九州居其六了。
+
+### 4.3. 三国中最强大的魏国为何最先灭亡
+通过如下cypher命令可以查看曹操集团的重要文官组成
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+曹魏事实上于249年灭亡于高平陵之变，立国29年，少于蜀汉（43年）和东吴（51年）。三国中实力最强大的魏国最先灭亡的原因就在于曹魏的文官制度（九品中正制）使得权力很容易集中在世家大族手中。从图中可以看出，曹操曹丕父子两代的重要文臣几乎都是世家大族，颍川荀氏，颍川钟氏，颍川陈氏，武威贾氏等，甚至还出现了地区化趋势，集中于颍川，最终政权也为和颍川荀氏关系密切的河内司马氏所篡夺。
+
+### 4.4. 三国各自的实力究竟如何
+通过如下cypher命令可以查看三国各集团的人口实力
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+得到的查询结果如下表所示
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+古代社会衡量一个国家实力的重要指标是人口数量，由于人口数据缺失，我们使用三国所有主公和文臣武将的籍贯数据估计每个州的人口数量。发现三国主要人物中，按籍贯有60个属于魏国，有23个属于吴国，仅有2个属于蜀国，证明魏国确实是三国中最强大的国家。
+
+### 4.5. 曹操的军事能力如何评价
+通过如下cypher命令可以查看曹操参与的主要战役
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+从图中可以看出，曹操在三国主要的15场战役中参加了8场，出场率比较高。但是曹操只获胜了徐州之战、兖州之战、官渡之战和襄樊之战，汉中之战、宛城之战、群雄讨董和赤壁之战都失败了，综合胜率50%，证明曹操并不算一个非常优秀的军事家。
+
+## 5. 备注
+更多的分析有待大家积极补充和尝试！
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..976b97e0ac
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Round The World Demo
+
+> 此文档主要介绍了基于tugraph-db开发的环球旅行（Round The World）demo
+
+## 简介
+
+基于"80天环游世界"的虚拟背景，基于部分公开历史航班数据，帮助用户设计多个城市的最优航班规划。
+- demo设计了自定义网站服务
+- 数据来源为国外某开源网站，不包含大陆城市航班数据
+- 数据中航班价格为模拟数据，不代表真实价格
+
+## 示例
+
+### 登录页面
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### 查询页面
+
+在登录页面点击后进入查询页面
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### 查询示例
+
+在左下角的城市列表中选择不超过8个城市，点击查询可返回推荐的航班规划，在满足前后航班间隔在2-6小时的要求下，返回费用最低和飞行时间最短的10条路径规划。
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+详细使用说明见[manual.md](https://github.com/TuGraph-family/tugraph-db-demo/blob/main/round_the_world/manual.md "")文档。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..4a29f62826
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo示例
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..e630bd12bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+快速上手
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..2cfd4197a9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,685 @@
+# 可视化操作手册
+
+> 此文档主要介绍 TuGraph Browser 的使用和操作方法。
+
+## 1.简介
+
+TuGraph Browser（以下简称Browser）是一款功能强大的产品可视化开发工具，它以直观的可视化方式呈现图数据，使用户可以轻松地管理、维护和查看数据库运行状态。此工具不仅支持图数据的管理和可视化，还支持对系统账户的管理，为用户提供了全面的操作和管理体验，让用户能够更加高效地管理和利用图数据库。
+
+## 2.操作指南
+
+### 2.1.访问
+
+当用户完成图数据库的安装后，可以通过浏览器访问Browser。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 8000。
+
+- 例如：127.0.0.1:8000
+- 推荐使用Chrome
+
+#### 2.1.1.启动配置
+
+在启动Browser之前，需要提前启动TuGraph-Server并配置好Browser与TuGraph-Server连接，配置文件在Browser目录下的env.json文件，具体配置如下所示
+```shell
+# vim /usr/local/share/lgraph/tugraph-db-browser/env.json
+{
+  "tugraph_db_host": "http://127.0.0.1:9090"
+}
+```
+需要把tugraph_db_host修改为实际TuGraph-Server RPC服务的地址
+
+#### 2.1.2.启动方式
+Browser的启动方式分为两种，一种是在docker image中，直接切到Browser所在目录，执行启动命令即可
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run dev
+```
+另一种是在本地环境中使用rpm/deb安装包，此时需要先构建后启动，因此需要在本地提前安装Node环境，具体详见源码目录下的
+ci/images/tugraph-runtime-*-Dockerfile。在本地安装TuGraph时，
+Browser会安装到本地的指定目录，切到该目录，执行如下命令即可构建并启动
+```shell
+cd /usr/local/share/lgraph/tugraph-db-browser
+pnpm run bootstrap
+pnpm run dev
+```
+
+### 2.2.登录
+
+![login](../../../images/browser/login.png)
+
+- 浏览器成功访问Browser后，首先进入的是登录页面（如上图所示），用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 用户首次登录后，会跳转至修改密码页面，密码修改成功后，使用新密码重新登录方可使用。
+
+### 2.3.快速上手
+
+对于首次使用TuGraph的用户，可以通过产品内置的demo数据快速构建一个图项目，快速上手图数据项目。
+
+#### 2.3.1.创建图项目
+
+在`图项目`首页的选项卡中，点击`新建图项目`创建新的图项目。
+
+![快速上手-新建图项目](../../../images/browser/quickstart-creategraph.png)
+
+选择一个产品内置的demo数据，点击`下一步`按钮。
+
+![快速上手-选择一个demo](../../../images/browser/quickstart-selectdemo.png)
+
+在`填写配置`界面输入图项目信息，demo数据量都相对较小，`最大存储空间`设置为1G即可。输入完图项目信息后，点击`创建`按钮后，系统会自动创建demo数据的图模型、导入图数据。
+
+![快速上手-填写配置](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.开始图项目
+
+demo数据的图项目创建完成后，可以在`图项目`的选项卡中找到相应的图项目，可以点击`图查询`查询图数据。
+
+![快速上手-图项目选项卡](../../../images/browser/quickstart-graphtab.png)
+
+执行默认的查询语句，浏览demo里的图数据。
+
+![快速上手-验证结果](../../../images/browser/quickstart-result.png)
+
+更多快速上手文档请浏览[快速上手文档](../3.quick-start/1.preparation.md)
+
+### 2.4.图项目
+
+`图项目`提供可视化的图项目管理和图数据研发功能，它为用户提供了一系列便捷的图数据可视化操作，包括图项目的创建、修改、删除等管理操作，以及图数据的查询、点边统计等操作。此外，它也支持图模型的管理，使用户可以更加方便地进行图数据的管理和维护。
+
+#### 2.4.1.图项目管理
+
+在`图项目`界面，可以看到当前图数据库中的图项目。
+
+![图项目-首页](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.新建图项目
+
+在`图项目`界面，点击`新建图项目`按钮创建一个新的图项目。
+
+![图项目-新建图项目按钮](../../../images/browser/graphmanagement-creategraph.png)
+
+新建图项目需要通过`选择模板`和`填写配置`两个页面完成图项目的创建。
+
+- __选择模板__：产品提供空模板和demo模板两类模板。
+    - 空模板：全新的图项目，用户需要自己创建图模型和导入图数据，一般用于正式项目开发。
+    - demo模板：产品内置的demo数据，图项目创建成功后，系统会自动创建demo图模型并导入demo图数据，一般用于试用和学习。
+
+![图项目-选择模板](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __填写配置__：用户需要填写图项目基本信息，并点击`创建`按钮创建图项目。
+    - 图名称：新建图项目的名称，同时作为该图项目的唯一主键。支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+    - 图描述：新建图项目的描述，可用于详细说明该项目的背景和目标。
+    - 高级配置-最大存储空间：设置图项目最大可占用的存储空间，实际并不会提前占用物理存储空间，实际数据量达到最大存储空间阈值后不可再写入数据。
+
+![图项目-填写配置](../../../images/browser/graphmanagement-configure.png)
+
+创建成功后，可在`图项目`页面的图项目选项卡中查看。
+
+##### 2.4.1.2.编辑图项目
+
+在`图项目`界面，点击图项目选项卡中的`编辑`按钮（笔形图标），编辑对应图项目的基础信息。
+
+![图项目-编辑图项目按钮](../../../images/browser/graphmanagement-editgraph-button.png)
+
+编辑图项目功能可以修改`图名称`和`图描述`。
+
+![图项目-编辑图项目](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.删除图项目
+
+在`图项目`界面，点击图项目选项卡中的`删除`按钮（垃圾桶图标），删除对应的图项目。
+
+![图项目-删除图项目按钮](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_需要注意：图项目删除后无法恢复_。
+
+##### 2.4.1.4.点边统计
+
+在`图项目`界面，点击图项目选项卡中的`点边统计`按钮（折线图标或刷新图标），统计对应图项目的点边数量。
+
+![图项目-点边统计按钮](../../../images/browser/graphmanagement-statistics-button.png)
+
+统计结果将展示展示图项目选项卡上，未进行过点边统计的图项目会显示`暂无点边数据`，已经统计过点边数据的图项目再次统计需要点击`刷新`按钮。
+
+![图项目-点边统计](../../../images/browser/graphmanagement-statistics.png)
+
+![图项目-刷新点边统计按钮](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+#### 2.4.2.图构建
+
+Browser的`图构建`功能主要用于图项目的模型定义和数据导入。在`图项目`页面中，点击图项目选项卡中的`图构建`按钮。
+
+![图构建-按钮](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.模型定义
+
+Browser提供可视化的方式创建和维护图模型。
+
+- 也可用通过`cypher`工具和`lgraph_import`工具创建和维护图模型，详见[Cypher API](../8.query/1.cypher.md)和[数据导入](../6.utility-tools/1.data-import.md)文档。
+
+###### a.浏览图模型
+
+在`模型定义`界面可以查看详细的图模型设置，支持列表和画布方式查看图模型，支持列表展示点类型的属性和索引、边类型的属性和起点/终点类型。
+
+![图构建-浏览图模型](../../../images/browser/graphbuild.png)
+
+- 支持列表查看点类型和边类型。
+    - 支持点类型和边类型的个数展示，在点类型或边类型页签中展示对应的点或边数量。
+    - 支持点类型和边类型的名称关键字搜索，在`搜索框`输入关键字可展示对应的点或边。
+
+        ![图构建-浏览图模型-搜索](../../../images/browser/graphbuild-list-search.png)
+    - 支持点类型和边类型的名称复制，点击`复制`按钮可以复制点或边的名称至粘贴板。
+
+        ![图构建-浏览图模型-复制](../../../images/browser/graphbuild-list-copy.png)
+    - 支持点类型和边类型的删除，点击`删除`按钮可以删除对应的点或边。
+
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-list-delete.png)
+- 支持画布方式查看点类型和边类型。
+- 在列表或画布中点击相应的点类型或边类型，可以展示模型详情。
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-select.png)
+
+###### b.添加点
+
+在`模型定义`界面点击`添加点`按钮，在右侧滑动窗口中添加点类型。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex-button.png)
+
+用户需要输入点类型名称、属性和索引，点击`完成`按钮完成点类型的创建。
+- 点类型名称：点的名称，也是该点的唯一标识。
+- 属性：点的属性，需要一个属性作为主键。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建点时可以任意删除属性。
+- 索引：点的索引属性，需要先创建属性再设置该属性为索引，索引创建成功后无法修改。
+    - 属性：需要配置索引的属性。
+    - 唯一：设置该属性字段为唯一值。
+    - 主键：对应属性是否为主键，选择`是`后`唯一`选项必须为`是`。
+    - 删除：在创建点时可以任意删除索引。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex.png)
+
+- 编辑点：可以增加点的属性和修改已有属性的数据类型，新增或删除索引。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+_注：主键字段的属性创建后无修改_
+
+![图构建-编辑点](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.添加边
+
+在`模型定义`界面点击`添加边`按钮，在右侧滑动窗口中添加边类型。
+
+![图构建-添加边按钮](../../../images/browser/graphbuild-addedge-button.png)
+
+用户需要输入边类型名称、属性、选择起点类型和终点类型，点击`完成`按钮完成边类型的创建。
+- 边类型名称：边的名称，也是该边的唯一标识。
+- 属性：边的属性，边上可以没有属性。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建边时可以任意删除属性。
+- 选择起点类型和终点类型：设置边的起点点类型和终点点类型，支持多个起点类型和终点类型。
+    - 起点：选择起点的点类型。
+    - 终点：选择终点的点类型。
+    - 需要提前创建至少一个点类型才能设置边的起点类型和终点。
+    - 如果不选择则表示起点和终点可以为任意点类型，同时画布上不展示对应的边，需要在左侧列表查看边类型。
+
+![图构建-添加边](../../../images/browser/graphbuild-addedge.png)
+
+- 编辑边：可以增加边的属性和修改已有属性的数据类型。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+
+![图构建-编辑边](../../../images/browser/graphbuild-editedge.png)
+
+###### d.导入模型
+
+在`模型定义`界面点击`导入模型`按钮，可以上传模型文件快速创建模型。
+
+![图构建-导入模型按钮](../../../images/browser/graphbuild-importmodel-button.png)
+
+在`导入模型`界面点击`上传文件`按钮，上传模型文件成功后，点击确定可以导入图模型。
+
+- 覆盖当前画布中的模型：选中该选项，导入时会先清空已有图模型再导入模型文件中的图模型；不选择，会导入模型文件中新增的点类型和边类型，但不会修改已有的点类型和边类型。
+
+![图构建-导入模型](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.导出模型
+
+在`模型定义`界面点击`导出模型`按钮，可以将当前图项目中的图模型导出成json文件。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel-button.png)
+
+模型文件为json格式，不建议手动修改。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.数据导入
+
+完成`模型定义`之后，点击`下一步`按钮进入数据导入页面。
+
+###### a.数据准备
+
+在数据导入前需要提前准备数据，当前Browser支持CSV文件的上传，需要保证数据文件后缀为csv。
+- 不强制要求包含表头。
+- 支持文本限定符，文本限定符为双引号。
+
+![数据导入-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.上传文件
+
+在`数据导入`页面上传需要导入的数据文件，将数据导入到图项目中。
+
+![数据导入-上传文件](../../../images/browser/graphbuild-import.png)
+
+- 分隔符：数据文件的列分隔符。
+- 文件上传：支持上传多个文件。
+    - 支持弹窗中选择多个上传文件。
+    - 支持将文件拖拽至页面中上传。
+    - 支持同时上传点文件和边文件。
+
+###### c.数据映射
+
+文件上传成功后，需要在`数据导入`页面设置`数据对应表`，将数据文件中的数据列和目标点/边、对应属性建立映射关系。
+
+- 数据对应表：展示已经上传的数据问题。
+    - 文件名称：上传的数据文件名称。
+    - 文件大小：上传的数据文件大小。
+    - 读取结果：数据文件上传结果，success为读取成功。
+    - 删除：在页面中删除，不会删除本地文件。
+- 数据文件映射：每个已上传的数据文件都需要配置映射关系。
+    - 标签：选择该文件对应的点或边类型，只能选择一类点或一类边。
+    - 从第N行，开始：从第N行开始读取数据，系统默认从第0行开始读取数据，如需跳过表头可输入1。
+    - 属性映射：下拉选择数据列对应的属性字段。
+    - 数据预览：系统会预读数据文件的前5行。
+
+![数据导入-数据映射](../../../images/browser/graphbuild-import-datamapping.png)
+
+文件上传成功后，可以点击`继续导入`按钮继续导入其他数据，或者点击`前往图查询`按钮在`图查询`页面查询已导入的数据。
+
+![数据导入-导入成功](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.图查询
+
+在`图项目`界面点击图项目选项卡中的`图查询`按钮，可以查询和访问图项目中的图数据，产品提供`语句查询`、`路径查询`、`点查询`等多种模式查询图数据，支持切换图项目和查询结果展示。
+
+![图查询-按钮](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.切换图项目
+
+`图查询`功能只能访问一个图项目数据，用户可以在`切换图项目`下拉框中选择并切换至其他图数据。
+
+![图查询-切换图项目](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.语句查询
+
+Browser提供可视化方式开发和调试图查询语句，用户可以输入图查询语句、执行并返回结果，支持收藏语句和查看图模型。
+
+![图查询-语句查询](../../../images/browser/query-view.png)
+
+###### a.语句查询窗口
+
+用户在`语句查询窗口`输入图查询语句，点击`执行`按钮可以运行对应语句，并在`执行结果页签`展示结果。
+
+- 切换查询语言：提供不同图查询语言模式的切换。_当前只支持Cypher语法_
+
+![图查询-切换语言](../../../images/browser/query-selectgql.png)
+
+- 语句查询窗口：提供当前查询语言的语法提示。
+
+![图查询-语法提示](../../../images/browser/query-gqltips.png)
+
+- 执行：点击`执行`按钮，发送输入的查询语句至后台运行。
+
+![图查询-执行按钮](../../../images/browser/query-execute-button.png)
+
+- 收藏：点击`收藏`按钮，将当前语句查询窗口的内容保存成模板，以便下次使用。
+
+![图查询-收藏按钮](../../../images/browser/query-bookmark-button.png)
+
+- 下载：点击`下载`按钮，将当前语句查询窗口的内容保存成文本文件并下载至本地，以便下次使用。
+
+![图查询-下载按钮](../../../images/browser/query-download-button.png)
+
+详细Cypher使用指南请参考文档：[Cypher API](../8.query/1.cypher.md)
+
+###### b.收藏列表
+
+以列表方式展示已经收藏的查询语句，点击列表中的收藏模板可以使用其中的语句。支持关键字搜索、名称修改以及删除。
+
+![图查询-语句收藏](../../../images/browser/query-bookmark.png)
+
+###### c.查看图模型
+
+Browser提供当前图项目中的图模型查询，方便用户查询有些点类型和边类型，支持列表展示和画布图谱展示方式，支持隐藏查看图模型窗口。
+
+![图查询-图模型列表](../../../images/browser/query-schema-list.png)
+![图查询-图模型图谱](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.路径查询
+
+Browser提供`路径查询`模板，用户可以通过选择路径的方式，查找图项目中的图数据是否存在相应的路径。
+
+![路径查询](../../../images/browser/pathquery-result.png)
+
+- 路径：在路径选择下拉框内选择需要查找的路径。
+    - 选择路径：根据图模型的定义，系统会自动匹配出对应的一度关系路径；再次点击路径下拉框会，系统会根据路径终点的点类型自动匹配下一度关系路径。
+![路径查询-选择路径](../../../images/browser/pathquery-select.png)
+    - 执行：点击`执行`按钮返回图项目中匹配的路径。
+    - 高级配置：设置扫描的路径数目，默认为100条路径。
+![路径查询-高级配置](../../../images/browser/pathquery-configuration.png)
+
+_注：需要图模型中的边设置起点和终点，如果图项目中的边均未设置起点和终点，下拉选项无结果_
+
+##### 2.4.3.4.点查询
+
+Browser提供`点查询`模板，用户可以通过选择点属性进行查询，查找图项目中的点数据。
+
+![点查询](../../../images/browser/vertexquery.png)
+
+- 选择点：选择需要查询的点类型。
+    - 属性：系统会自动匹配点类型的schema，设置相应的查询条件，点击执行按钮返回结果。
+- 返回节点数目：设置返回点数据的上限。
+
+![点查询-条件](../../../images/browser/vertexquery-criteria.png)
+
+##### 2.4.3.5.执行结果页签
+
+Browser提供JSON视图、JSON文本、点边列表、点边视图等多种方式展示图查询结果，支持结果下载、插入数据、全屏展示。
+
+###### a.JSON视图
+
+Browser提供以JSON视图方式展示查询结果。
+
+![JSON视图](../../../images/browser/query-result-jsonview.png)
+
+###### b.JSON文本
+
+![JSON文本](../../../images/browser/query-result-jsontxt.png)
+
+###### c.点边列表
+
+Browser提供以点和边列表方式展示查询结果。
+
+![点边列表](../../../images/browser/query-result-list.png)
+
+###### d.点边视图
+
+Browser提供以画布方式展示查询结果。
+
+![点边视图](../../../images/browser/query-result-graph.png)
+
+###### e.插入数据
+
+Browser提供可视化方式在对应图项目中插入点或边数据。点击`插入数据`按钮，在`插入数据`页签选择点类型或边类型，输入属性值，点击确定完成数据插入。
+
+![插入数据-按钮](../../../images/browser/query-result-insert-button.png)
+
+![插入数据](../../../images/browser/query-result-insert.png)
+
+###### f.下载执行结果
+
+Browser提供图查询结果导出成文本文件功能。点击`下载执行结果`按钮，系统会自动将结果保存成文本文件并下载至本地。
+
+![下载执行结果-按钮](../../../images/browser/query-result-download.png)
+![下载执行结果-按钮](../../../images/browser/query-result-downloadtxt.png)
+
+###### g.全屏展示
+
+Browser提供全屏方式展示图查询结果，点击`全屏显示`按钮全屏展示结果，点击`退出全屏`按钮退出全屏展示。
+
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-button.png)
+![全屏展示](../../../images/browser/query-result-fullscreen.png)
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.图分析
+
+在`图项目`界面点击图项目选项卡中的`图分析`按钮，可以在画布中展示和分析图数据，产品提供`语句查询`和`配置查询`将图项目中的数据查询并加载至画布，支持画布数据的筛选、布局样式调整以及画布操作。
+
+![图分析-按钮](../../../images/browser/graphanalysis-button.png)
+
+如下图所示，图分析功能主要包括：1、操作栏：图分析主要操作功能，包括视图切换、查询过滤、布局样式以及画布操作；2、左边栏：查询、筛选、外观功能操作区域；3、画布区域：展示图数据的区域，展示点和边数据，支持点扩展查询、收起节点、固定节点、删除节点，提供画布图数据统计等功能；4：右边栏：选中一个点数据或边数据后，会展示对应的属性信息；5、切换图项目：切换不同的图项目进行分析。
+
+![图分析-操作区域](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.语句查询
+
+在`语句查询`功能中，用户可以输入查询语句来查询图数据，并加载数据至画布区域进行展示。
+- 语法说明：TuGraph的查询语言及语法说明文档。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-语句查询](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.模板查询
+
+在`模板查询`功能中，用户可以选择节点类型和输入属性条件来查询图数据，并加载数据至画布区域进行展示。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-模板查询](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.画布分析
+
+在`画布分析`功能中，用户可以对画布中的节点或边数据进行操作和分析，主要包括：选中节点进行扩展查询、收起/展开节点、固定节点，清空画布，套索，点/边检索，画布图例等。画布上的最基础操作是拖拽点数据，鼠标左键选住一个节点并移动鼠标，可以完成点数据位置的移动。
+
+###### a.扩展查询
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，鼠标移至`扩展查询`处弹出二级悬窗，点击对应的扩展度数进行查询。
+- 一度查询：双向扩展一度关系。
+- 二度查询：双向扩展二度关系。
+- 三度查询：双向扩展三度关系。
+- 自定义查询：根据选择的条件进行扩展。
+    -边的方向：设置扩展关系的方向，双向：包含出边和入边，出边：选中起点向外指向的边，入边：指向选中起点的边。
+    -扩散度数：扩展的度数。
+    -自定义返回节点数量：配置返回至前端的节点数量，默认为100，防止遇到超级节点导致前端异常的情况。
+    -添加筛选组：设置扩展的关系类型和关系的属性条件，可以设置多组关系类型。
+
+![图分析-画布分析-扩展查询-按钮](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![图分析-画布分析-扩展查询-查询后](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+![图分析-画布分析-扩展查询-自定义查询](../../../images/browser/graphanalysis-canvas-expand-custom.png)
+
+###### b.收起/展开节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`收起节点`会隐藏所选节点的一度关系节点；再次右键已`收起节点`的点数据可以进行`展开节点`操作，展示已隐藏的一度关系节点。
+
+![图分析-画布分析-收起节点](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![图分析-画布分析-展开节点](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.固定节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`固定节点`会将所选节点固定在原处，固定后的节点不可移动（包括重新布局）；再次右键已`固定节点`的点数据可以进行`解除固定`操作，恢复所选节点的正常操作。
+
+![图分析-画布分析-固定节点](../../../images/browser/graphanalysis-canvas-fixed.png)
+
+![图分析-画布分析-解除固定](../../../images/browser/graphanalysis-canvas-unfix.png)
+
+###### d.删除节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`删除节点`会将所选节点移出画布。
+
+![图分析-画布分析-删除节点](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### e.清空画布
+
+在`操作栏`区域点击`清空画布`按钮，会清除所有画布中的数据。
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### f.点/边检索
+
+在`点/边检索`窗口选择点或边，并输入关键字，会模糊检索画布中的属性数据，检索后可定位至数据位置。
+
+![图分析-画布分析-检索](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### g.画布图例
+
+在`画布`区域的图例位置，会展示画布中的点类型，点击点类型可以选中对应的点数据，点击更多按钮可以展示统计情况，支持列表或图表方式展示点或边的数量。
+
+![图分析-画布分析-列表](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![图分析-画布分析-图表](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+##### 2.4.4.4.属性筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`属性筛选`进行筛选过滤。用户可以选择要筛选的点或边类型，以及对应的属性值进行设置，检索到筛选组条件的数据后会在画布上高亮选中对应的点或边数据。
+- 请选择点/边类型：选择需要检索的点类型或边类型。
+- 属性条件：设置需要检索的属性条件，可以设置多组，取并集筛选结果。
+- 添加筛选组：可以多组筛选条件，取并集筛选结果。
+- 重置：可以清空筛选条件。
+
+![图分析-筛选-属性筛选](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.统计筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`统计筛选`进行画布数据统计。用户可以选择要统计的点或边类型，以及对应的属性值进行设置，系统会自动根据用户选择的点/边类型和属性进行分组统计，支持按照图表和列表两种方式展示结果，同时点击图表或列表区域的数值可以高亮选中画布中的数据。
+
+![图分析-筛选-统计筛选](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![图分析-统计筛选-图表切换](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.7.布局样式
+
+在`操作栏`区域点击`布局`按钮，选择对应的布局方式会将画布中的数据进行重新排布，支持力导向布局、同心圆布局、圆形布局、辐射布局、Dagre布局以及网格布局，每种布局方式均有不同布局参数，调整参数后画布中的数据会进行重新排布。
+
+![图分析-布局样式-按钮](../../../images/browser/graphanalysis-style-layout-button.png)
+![图分析-布局样式-布局参数](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+详细布局参数可参考[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide)。
+
+##### 2.4.4.6.外观样式
+
+在`操作栏`区域点击`外观`按钮，在`左边栏`点击`点样式`或`边样式`进行外观样式配置。
+- 点样式
+    - 应用点类型：设置对应点类型的展示样式，支持同时配置多个点类型外观。
+    - 大小：对应点类型的展示大小。
+    - 颜色：对应点类型的展示颜色。
+    - 图标：对应点类型的图标样式。
+    - 显示文本：对应点类型显示的文本内容，默认为id。
+    - 高级配置：根据设置的条件标记对应的点数据。
+- 边样式
+    - 应用边类型：设置对应边类型的展示样式，支持同时配置多个边类型外观。
+    - 颜色：对应点类型的展示颜色。
+    - 边宽：对应边类型的展示宽度。
+    - 显示文本：对应边类型显示的文本内容，默认不显示。
+    - 高级配置：根据设置的条件按颜色展示对应的边数据。
+
+![图分析-外观](../../../images/browser/graphanalysis-style-appearance.png)
+
+### 2.5.控制台
+
+`控制台`提供可视化的的账户管理和数据库信息查看功能，它为用户提供了全面的账户和角色管理功能，包括账户的增删改查以及禁用，角色的增删改查以及禁用。此外，它也为用户提供了便捷的数据库信息查看功能，让用户可以轻松地查看图数据库的基础信息和配置信息。其中，基础信息主要包括版本号、运行时间、CPP编译版本号等，而数据库配置信息则包括端口号、系统功能参数配置等。
+
+#### 2.5.1.账户管理
+
+##### 2.5.1.1.账户管理
+
+###### a.添加账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户需要输入账户名称、账户描述、账户密码以及相关角色。
+
+![账户管理-添加账户按钮](../../../images/browser/account-add-button.png)
+
+- 账户名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 相关角色：新建账户时必须要选择一个角色，在账户添加成功后，系统会自动生成一个与账户名称一样的角色。
+
+![账户管理-添加账户](../../../images/browser/account-add.png)
+
+###### b.编辑账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户可以编辑账户描述、账户密码以及相关角色。
+
+![账户管理-编辑账户](../../../images/browser/account-edit.png)
+
+###### c.禁用账户
+
+在`账户管理`界面点击`禁用`按钮禁止对应的账户登录和访问，点击`启用`按钮开启对应的账户登录和访问权限。
+
+![账户管理-禁用](../../../images/browser/account-disable.png)
+![账户管理-启用](../../../images/browser/account-enable.png)
+
+###### d.删除账户
+
+在`账户管理`界面点击`删除`按钮删除对应的账户。
+
+![账户管理-删除](../../../images/browser/account-delete.png)
+
+##### 2.5.1.2.角色管理
+
+###### a.添加角色
+
+在`角色管理`界面点击`添加`按钮创建新的角色，用户需要输入角色名称、角色描述以及图权限。
+
+![角色管理-添加角色按钮](../../../images/browser/role-add-button.png)
+
+- 角色名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 图权限：browser支持全部、读、写和无共四类图权限配置。
+    - 全部：对应图的读和写权限，包含编辑图模型权限（schema）。
+    - 读写：对应图的写权限，不包含编辑图模型权限（schema）。
+    - 只读：对应图的读权限。
+    - 无：无法访问和操作对应图。
+- 角色冲突：当两个角色对同一个图有不同图权限，同时对一个账户授权了这两个角色，该账户对该图的图权限为两个角色的并集。
+
+![角色管理-添加角色](../../../images/browser/role-add.png)
+
+###### b.编辑角色
+
+在`角色管理`界面点击`编辑`按钮编辑已有角色，用户可以编辑角色描述以及图权限。
+
+![角色管理-编辑角色](../../../images/browser/role-edit.png)
+
+###### c.禁用角色
+
+在`角色管理`界面点击`禁用`按钮禁止对应的角色，点击`启用`按钮开启对应的角色。禁用角色后，对应角色图访问权限失效。
+
+- 禁用角色：禁用之后，对应角色图访问权限失效。
+    - 当一个用户拥有两个角色对同一个图有操作权限时，当禁用其中一个角色时，另一个角色权限同样有效。
+
+![角色管理-禁用](../../../images/browser/role-disable.png)
+![角色管理-启用](../../../images/browser/role-enable.png)
+
+###### d.删除角色
+
+在`角色管理`界面点击`删除`按钮删除对应的角色。
+
+![角色管理-删除](../../../images/browser/role-delete.png)
+
+#### 2.5.2.数据库信息
+
+##### 2.5.2.1.基础信息
+
+`基础信息`获取当前系统运行的状态，并展示关键信息。
+
+![数据库信息-基础信息](../../../images/browser/db_basic.png)
+
+|参数    |含义    |
+|-------|--------|
+|TuGraph版本号|当前TuGraph的版本号，x.x.x|
+|运行时间|TuGraph服务启动到现在的时间|
+|服务器代码版本|tugraph-db仓库的当前commit|
+|前端代码版本|tugraph-web仓库的当前commit|
+|CPP编译器版本号|编译TuGraph时的CPP版本号|
+|Python版本号|编译TuGraph时的Python版本号|
+|CPP编译器ID|编译TuGraph时的CPP类型|
+
+也可以通过命令获取当前系统运行状态。
+
+```
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.数据库配置信息
+
+`数据库配置信息`获取当前系统运行的配置参数，并展示关键信息。调整配置参数或了解详细配置参数请参考[数据库运行-服务配置](../5.installation&running/7.tugraph-running.md)。
+
+![数据库信息-数据库配置信息](../../../images/browser/db_configuration.png)
+
+| 参数                          | 含义                                  |
+|-----------------------------|-------------------------------------|
+| bind_host                   | 系统启动时设置的host，一般为0.0.0.0             |
+| disable_auth                | 是否关闭token认证的定期更新，如为true则token可以永久使用 |
+| durable                     | 是否开启存储底层持久化，如为false，数据异步更新到磁盘       |
+| enable_audit_log            | 是否开启审计日志                            |
+| enable_backup_log           | 是否开启实时增量备份                          |
+| enable_fulltext_index       | 是否开启全文索引                            |
+| enable_ip_check             | 是否开启IP白名单                           |
+| enable_rpc                  | 是否开启RPC端口                           |
+| enable_ssl                  | 是否开启ssl加密传输                         |
+| optimistic_txn              | 是否开启乐观多线程写入事务                       |
+| port                        | 当前系统的REST访问端口                       |
+| rpc_port                    | RPC 及 HA 服务所用端口                     |
+| subprocess_max_idle_seconds | 自进程最大空闲时间，线程池参数                     |
+| thread_limit                | 服务端同时使用的最大线程数                       |
+| verbose                     | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。  |
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..0815c0865d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# 可视化操作手册（旧版）
+
+> 此文档主要介绍 TuGraph Browser 的使用
+
+## 定义
+
+TuGraph Browser 是 TuGraph 提供的可视化开发工具。
+
+## 作用
+
+TuGraph Browser 的主要功能是为使用图数据库的开发人员，提供可视化的图数据开发，图数据管理和维护等功能。
+
+## 操作详情
+
+### 1.连接数据库
+
+当用户完成图数据库的安装后，可以通过浏览器进行访问，TuGraph Browser 工具。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7090。
+
+### 2.登录数据库
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- 页面打开成功会，首先进图的是登录页面，用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 3.工作台
+
+#### 3.1 快速上手
+
+- 首次登录，系统会默认创建 default 空图
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- 用户点击帮助选项，并选择快速上手
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- 然后点击“一键创建模型”——>"一键创建数据"，就可以完成内置的 Movie 数据图谱的构建
+
+#### 3.2 创建子图和示例
+
+##### 3.2.1 创建子图
+
+- 点击新建子图
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- 填写表单信息
+  ![alt 填写表单](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+  - 子图名称
+  - 子图描述
+  - 配置信息
+  - 点击确认，提示创建成功
+- 切换子图
+  ![alt 切换子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- 点击新建示例
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- 选择示例并点击创建
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 查询
+
+![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 页面组成
+
+- cypher 输入框
+- 结果集展示区域
+
+##### 3.3.2 结果集展示区域功能详情
+
+- 结果集标签展示及功能
+  ![alt 结果集标签](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+  - 这里展示了结果集的所有类型统计
+  - 点击不同的“label（标签）”，可以进行以下修改操作
+    - 修改展示颜色
+    - 修改节点大小或边的粗细
+    - 修改默认展示属性或系统属性
+    - 布局修改
+      - 力导布局
+      - 网格布局
+      - 树形布局
+      - 环境布局
+    - 边聚合
+      - 相同类型，方向的边可以进行合并
+    - 创建节点
+      - 点击创建节点按钮
+      - 选择节点类型
+      - 添写节点内容
+    - 创建关系
+      - 在画布中选择起点和终点
+      - 选择可以匹配的类型
+      - 填写节点信息
+    - 停止布局
+      - 当数据量过大，导致浏览器页面卡顿时候，可以点击这个停止布局的按钮，能够提高体验的流畅度
+    - 鼠标悬停
+      - 开启此功能，可以高亮显示鼠标悬停节点的一度邻居节点
+    - 结果集导出
+      - 可以将结果集导出为 png，json，csv 三种不同的文件形式
+    - 刷新
+      - 点击刷新按钮，会重新执行当前页面的初始 cypher 语句，并刷新结果集
+    - 最大化
+      - 点击最大化，结果集展示区域将全屏展示
+    - 结果集展示形式切换
+      - 支持图谱、表格、文本三种形式
+
+##### 3.3.3 建模
+
+- 点边模型
+  ![alt 建模](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- 点边模型支持实时的、增、删、改、查
+
+- 点边模型支持导入和导出
+
+##### 3.3.4 数据导入
+
+- 本地数据导入
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+  - 选择文件编码格式
+  - 选择本地 CSV 文件
+  - 选择对应的节点或边的模型
+  - 进行数据映射
+  - 完成数据导入
+  - 单个文件最大支持2GB
+
+##### 3.3.5 插件
+
+- 存储过程的使用
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+  - 用户可以上传本地编写的 Plugin 程序，并在可视化页面进行执行，并查看执行结果
+  - 用户可以在可视化对插件进行、卸载、执行、下载等操作
+
+##### 3.3.6 帮助
+
+- 其中记录了 TuGraph-browser 的使用方式
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 控制台
+
+##### 3.4.1 数据库基础信息
+
+- 展示数据库相关的基础配置信息
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 权限管理
+
+- 用来创建用户和角色的功能模块，用户可以在这里进行权限的管理操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 实时状态
+
+- 这里展示了数据库实时状态，包括：CPU 使用率、内存用率、磁盘使用率、数据请求次数、磁盘 IO
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 任务管理
+
+- 在这里用户可以看到在正在执行中的任务，可以在此进行停止任务的操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 审计日志
+
+- 这里记录的数据库相关的审计日志，用来排查使用遇到的问题
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..811fbf0563
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+可视化操作指南
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..e2524b4134
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/1.environment.md
@@ -0,0 +1,40 @@
+# 环境准备
+
+> 此文档主要介绍 TuGraph 部署时所需的软硬件环境。
+
+## 1.硬件环境
+
+### 1.1. CPU
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的硬件平台，测试认证过的硬件平台包括 Intel、AMD、Kunpeng、Hygon、飞腾等。
+
+### 1.2. 内存
+
+我们建议内存容量不小于实际的数据大小。如果最求极致的性能，把所有的数据缓存到内存里是最理想的。在数据访问的局部性上，图数据库的局部性要比关系型数据库差，因此如果数据在内存中放不下，通常会频繁地换入换出。
+
+### 1.3. 外存
+我们强烈建议用户使用 NVMe SSD 作为外存，数据库有大量的写操作需要同步的外存，通常为随机写，外存的读写性能很容易成为整体数据库运行的性能瓶颈。因此，高IOPS、低延迟的 NVMe SSD 是最优的选择。
+
+如果现实条件只能使用 SATA接口的SSD，或者云上的网盘，性能虽然会受到影响，但 TuGraph 依然能正确的运行。
+
+外存大小建议为实际数据大小的4倍，比如数据为1TB，则准备4TB的硬盘会比较稳妥。
+
+## 2.软件环境
+
+### 2.1. 操作系统
+
+TuGraph 能够兼容主流操作系统，包括Ubuntu、CentOS、SUSE、银河麒麟、 中标麒麟、UOS等，均通过测试认证。
+
+其中最稳定使用的系统版本是 Ubuntu 18.04、CentOS 7、CentOS 8。
+
+### 2.2. 系统库
+
+编译环境和运行环境对系统库的要求不一样，具体请参考[环境分类](2.environment-mode.md)。
+
+## 3.典型配置推荐
+
+| 硬件      | 最低配置   | 建议配置                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| 内存      | 4GB       | 512GB                    |
+| 外存      | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..3dbbe91ee5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,22 @@
+# 环境分类
+
+> 此文档主要介绍 TuGraph 涉及的三种环境。
+
+## 1.分类
+
+根据环境所承载功能的不同，区分为编译环境，运行环境，以及精简运行环境。
+* 编译环境，具备TuGraph编译的所有依赖库，包含运行环境的所有依赖，并且能够编译TuGraph源码，但不包含预编译好的TuGraph可执行文件和库文件，供开发者编译源码使用。
+* 运行环境，具备GCC/Java/Python环境，能够运行TuGraph的所有功能，并且能承载全文索引，java client，c++源码上传为plugin，以及python plugin的完整功能，内置TuGraph预编译好的可执行文件和库文件，供客户直接安装使用，无需编译源码。
+* 精简运行环境，约等于裸系统加预编译TuGraph，仅能运行TuGraph的基本功能，无C++ plugin编译运行，仅so上传，无全文索引，无python plugin，供快速搭建试用。
+
+TuGraph编译后，会把所有的依赖库以.a的形式打包在一起，因此原则上运行不需要的其他的依赖库。但TuGraph支持存储过程，即在服务端编译C++代码，因此在环境中依然需要涉及的编译器。
+
+## 2.依赖系统库
+
+针对三种环境，除去TuGraph的运行包，所需要的系统库如下：
+* 编译环境，包括gcc、python、java等编译器，也包含antlr4、pybind11等，具体参见tugraph-db源码目录 ci/images/tugraph-compile-*-Dockerfile。
+* 运行环境，主要由存储过程引入，包括gcc、boost、cmake等，具体参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile。
+* 精简运行环境，无，可以参见tugraph-db源码目录 ci/images/ tugraph-mini-runtime-*-Dockerfile。
+
+
+
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..a266cd3072
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,125 @@
+# Docker部署
+
+>本文档介绍TuGraph Compile及TuGraph Runtime的Docker镜像的创建、下载。
+
+## 1.简介
+
+- TuGraph Compile Image：提供编译环境，可以用于TuGraph的编译，测试；
+- TuGraph Runtime Image：提供二进制可运行环境，附带TuGraph库和可执行文件；
+- TuGraph Mini Runtime Image: 提供二进制可运行环境，不包含TuGraph中Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+## 2.现有Docker Image
+
+### 2.1.镜像下载方式
+
+镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用。
+
+最新版本的Docker地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+### 2.2.命名规范
+
+#### 2.2.1.TuGraph Compile Image
+
+提供编译环境，可以用于TuGraph的编译。
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+例如： `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+提供二进制可运行环境，附带TuGraph库和可执行文件。
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如：`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+提供二进制可运行环境，不包含TuGraph种Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如： `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.常见Docker操作
+
+Docker由Dockerfile生成，注意创建镜像需要下载依赖，因此网络问题可能会导致创建较慢或者创建失败。注意不要覆盖镜像，除非tag为 `latest`。
+
+创建Compile镜像
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+创建Runtime / Mini Runtine镜像
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+修改镜像名称
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+上传镜像
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+获取镜像
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+导出镜像
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+导入镜像
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+其他Docker操作请参考[docker官方文档](https://docs.docker.com/engine/reference/commandline/cli )
+
+
+### 2.4. M1芯片支持
+
+在 M1 芯片的机器上运行 amd64 容器可能造成未知错误。TuGraph提供 arm64 的镜像供 M1 机器使用。
+包含compile和runtime两种镜像。
+
+在`tugraph-runtime-centos7:3.6.0`与`tugraph-compile-centos7:1.2.7`及之后，`tugraph-runtime-centos7`与`tugraph-compile-centos7`提供linux/amd64和linux/arm64/v8两种架构的镜像，可以在 M1 机器上通过docker pull获取arm64架构镜像。
+
+### 2.5. 运行服务
+
+1. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7:${VERSION}
+   ```
+
+2. 启动docker
+   ```shell
+    docker run -it -d -p 7001:7001 -p 7070:7070 -p 7687:7687 -p 8000:8000 -p 9090:9090 \
+    -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo tugraph/tugraph-runtime-centos7:${VERSION} /bin/bash
+   
+   docker exec -d tugraph_demo bash /setup.sh
+   # 8000是默认的http端口，访问tugraph-db-browser使用。
+   # 7070是默认的http端口，访问legacy tugraph-web访问使用。
+   # 7687是bolt端口，bolt client访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   
+   # 根据/usr/local/etc/lgraph.json的tugraph启动的默认配置，
+   # /var/lib/lgraph/data是容器内的默认数据目录，/var/log/lgraph_log是容器内的默认日志目录
+   # 命令将数据目录和日志目录挂载到了宿主机的/root/tugraph/上进行持久化，您可以根据实际情况修改。
+   ```
+
+## 3. 使用和开发TuGraph-DB Docker镜像时的最佳实践
+
+在您刚开始为TuGraph做出贡献时，请仔细阅读以下要点，并遵循它们。
+
+- 为了避免过多的Docker Layer，请尽量像现有的Dockerfile一样单行的写ENV和RUN将您的依赖项添加到Docker中。
+- 对于您需要构建依赖项的软件包/资源，请使用原始的软件包/资源，而不是在没有VCS跟踪的情况下修改这些资源。之后联系TuGraph团队将其上传到OSS以加速构建过程，如同您在Dockerfiles中看到的URL一样。
+- 为了使开发更加高效，最好从Base TuGraph编译镜像添加依赖项开始，完成开发确认依赖没问题后在Dockerfile中重新复制该过程。
+- CI使用了Docker镜像。如果您的CI失败，请检查依赖项问题。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..04125f35c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# 本地包部署
+
+> 此文档主要介绍 TuGraph 的本地包部署。
+
+## 1. 环境准备
+
+TuGraph本地包部署需要对应的环境，快速验证可以使用精简安装包，几乎不需要任何第三方库。
+
+如果您需要使用完整的TuGraph功能，请参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile，该脚本包含完整的环境构建流程。
+
+## 2. 安装包下载
+
+最新版本的安装包地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+也可以访问Github进行下载：[TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. CentOS 下的安装方法
+
+用于在 CentOS 上安装的 TuGraph 的.rpm 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.rpm 安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+用户也可以通过指定`--prefix`选项指定安装目录。
+
+## 4. Ubuntu 下的安装方法
+
+用于在 Ubuntu 上安装的 TuGraph 的.deb 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.deb`安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+该命令默认将 TuGraph 安装于`/usr/local`目录下。用户也可以通过指定 `--instdir=<directory>` 选项更改安装目录。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..7ac7e1cfc0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,125 @@
+# 云部署
+
+> 此文档主要介绍 TuGraph 的云部署，也可参见[阿里云计算巢部署文档]( https://aliyun-computenest.github.io/quickstart-tugraph/ )。
+
+## 1.简介
+
+TuGraph（tugraph.antgroup.com）是蚂蚁集团研发的高性能图数据库（Graph Database）。TuGraph在计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。本文向您介绍如何开通计算巢上的TuGraph社区版服务，以及部署流程和使用说明。
+
+## 2.实例说明
+
+TuGraph部署的为社区开源版本，源码参考Github Repo，目前可以选择的实例规格如下：
+
+| 规格族         | vCPU与内存                 | 系统盘              | 公网带宽      |
+|----------------|-------------------------|-------------------|-----------|
+| ecs.r7a.xlarge | AMD 内存型 r7a，4vCPU 32GiB | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+| ecs.r6.xlarge  | 内存型r6，4vCPU 32GiB       | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+
+预估费用在创建实例时可实时看到（目前为免费）。 如需更多规格、其他服务（如集群高可用性要求、企业级支持服务等），请联系我们 tugraph@service.alipay.com。
+
+## 3.部署流程
+
+### 3.1.准备工作
+
+在正式开始使用前，您需要一个阿里云账号，对ECS、VPC等资源进行访问和创建操作。
+
+- 若您使用个人账号，可以直接创建服务实例
+- 若您使用RAM用户创建服务实例，且是第一次使用阿里云计算巢
+    - 需要在创建服务实例前，对使用的RAM用户的账号添加相应资源的权限。添加RAM权限的详细操作，请参见为 __RAM用户授权__。所需权限如下表所示。
+    - 且需要授权创建关联角色，参考下图，选中 __同意授权并创建关联角色__
+
+| 权限策略名称                    | 备注                                    |
+|---------------------------------|---------------------------------------|
+| AliyunECSFullAccess             | 管理云服务器服务（ECS）的权限             |
+| AliyunVPCFullAccess             | 管理专有网络（VPC）的权限                 |
+| AliyunROSFullAccess             | 管理资源编排服务（ROS）的权限             |
+| AliyunComputeNestUserFullAccess | 管理计算巢服务（ComputeNest）的用户侧权限 |
+| AliyunCloudMonitorFullAccess    | 管理云监控（CloudMonitor）的权限          |
+
+![同意授权并创建关联角色](../../../images/cloud-deployment-1.png)
+
+### 3.2.部署入口
+
+您可以在阿里云计算巢自行搜索，也可以通过下述部署链接快速到达。
+
+[部署链接](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.申请试用
+
+在正式试用前，需要申请试用，按照提示填写信息，在审核通过后就可以创建TuGraph服务。
+
+![申请试用](../../../images/cloud-deployment-2.png)
+
+### 3.4.创建TuGraph服务
+
+#### 3.4.1.参数列表
+
+您在创建服务实例的过程中，需要配置服务实例信息的参数列表，具体如下。
+
+| 参数组               | 参数项   | 示例          | 说明                                                           |
+|--------------------|----------|---------------|--------------------------------------------------------------|
+| 服务实例名称         | N/A      | test          | 实例的名称                                                     |
+| 地域                 | N/A      | 华东1（杭州）   | 选中服务实例的地域，建议就近选中，以获取更好的网络延时。          |
+| 付费类型配置         | 付费类型 | 按量付费      | 免费使用请选用按量付费                                         |
+| 可用区配置           | 部署区域 | 可用区I       | 地域下的不同可用区域，确保实例非空                              |
+| 选择已有基础资源配置 | VPC ID   | vpc-xxx       | 按实际情况，选择专有网络的ID。                                   |
+| 选择已有基础资源配置 | 交换机ID | vsw-xxx       | 按实际情况，选择交换机ID。若找不到交换机, 可尝试切换地域和可用区 |
+| ECS实例配置          | 实例类型 | ecs.r6.xlarge | 当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格                      |
+|ECS实例配置|	实例密码|	**|	设置实例密码。长度8~30个字符，必须包含三项（大写字母、小写字母、数字、 ()`~!@#$%^&*_-+={}[]:;'<>,.?/ 中的特殊符号）。|
+
+#### 3.4.2.具体步骤
+
+创建服务按如下步骤进行，参考下图：
+
+- 创建实例名称，如下图中“test”
+- 选择地域，如下图中“华东1（杭州）”
+
+![创建实例](../../../images/cloud-deployment-3.png)
+
+- 选择实例类型，当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格。如果列表中无机型可选，请尝试选择其他的部署区域
+- 选中机型
+- 配置实例的密码
+- 选择部署区域，如下图中“可用区I”
+
+![选择区域](../../../images/cloud-deployment-4.png)
+
+- 点击下一步，进入订单确认页面
+- 勾选“权限确认”和“服务条款”中的复选框
+- 点击左下角绿色背景的开始免费试用，即可创建服务实例
+
+![确认](../../../images/cloud-deployment-5.png)
+
+### 3.5.启动TuGraph服务
+
+- 查看服务实例：服务实例创建成功后，部署时间大约需要2分钟。部署完成后，页面上可以看到对应的服务实例，如下图
+
+![查看实例](../../../images/cloud-deployment-6.png)
+
+- 点击该服务实例访问TuGraph。进入到对应的服务实例后，可以在页面上获取到web、rpc、ssh共3种使用方式，并且页面上展示了admin用户的密码
+
+![访问方式](../../../images/cloud-deployment-7.png)
+
+- 点击web的链接，即可跳转访问已经部署好的TuGraph Web。建议新手先通过TuGraph Web，快速使用demo上手。
+    - 首先在TuGraph Web的登录页面上，输入默认用户名admin和页面上展示的admin用户的密码进行登录，参考下图
+    - 登录完成后，选择任意一个带有官方图标的图项目，其中内置了demo数据，开启图数据的探索和发现！
+
+![登录](../../../images/cloud-deployment-8.png)
+![创建demo](../../../images/cloud-deployment-9.png)
+
+## 4.常见FAQ
+
+### 问题一：部署区域无可用资源
+
+有时，所选部署区域（如可用区G）没有所选套餐的可用资源，会报错如下图所示
+
+![部署区域错误](../../../images/cloud-deployment-10.png)
+
+__解决办法__：尝试选择其他区域，如可用区I等
+
+### 问题二: 启动后web访问不通
+
+web的启动需要一点点时间，请稍后刷新页面即可。
+
+### 问题三: 登录时的用户名密码不正确
+
+请注意检查，登录时使用的密码应为详情页面展示的密码。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..08da97c191
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/6.compile.md
@@ -0,0 +1,28 @@
+# 从源码编译
+
+> 本文档主要描述 TuGraph 从源码进行编译。
+
+## 1.前置条件
+
+推荐在linux系统下搭建TuGraph。同时docker环境是个不错的选择,如果你想设置一个新的环境，请参考[Dockerfile](3.docker-deployment.md)。
+
+## 2.编译介绍
+
+以下是编译TuGraph的步骤：
+
+1. 如果需要web接口运行`deps/build_deps.sh`，不需要web接口则跳过此步骤
+2. 根据容器系统信息执行`cmake .. -DOURSYSTEM=centos`或者`cmake .. -DOURSYSTEM=ubuntu`，如果在arm机器编译（如M1芯片的Mac中，需要加上` -DENABLE_BUILD_ON_AARCH64=ON`）
+3. `make`
+4. `make package` 或者 `cpack --config CPackConfig.cmake`
+
+示例：`tugraph/tugraph-compile-centos7`Docker环境
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos7
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..d94f7dd0c2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,202 @@
+# 数据库运行
+
+> 本文档主要描述 TuGraph 服务的运行模式、启动、停止和重启的操作,以及 TuGraph 的服务配置参数、配置文件格式和命令行配置参数。
+
+## 1.前置条件
+
+TuGraph 运行的前置条件为 TuGraph 正确安装，参考[安装流程](1.environment.md)。
+
+TuGraph 运行需要保证库文件 liblgraph.so 的文件位置在环境变量 LD_LIBRARY_PATH。
+
+运行 TuGraph 进程的用户不需要超级权限，但需要对配置文件（一般为lgraph.json）及文件中涉及的文件有读权限，并且对数据文件夹、日志文件夹等有写权限。
+
+## 2.运行模式
+
+TuGraph 可以作为前台普通进程启动，也可以作为后台守护进程启动。
+当作为普通进程运行时，TuGraph 可以直接将日志打印到终端，这在调试服务器配置时非常方便。但是，由于前台进程在终端退出后被终止，因此用户须确保在 TuGraph 服务器处于运行状态时，终端保持打开状态。另一方面，在守护进程模式下，即使启动它的终端退出，TuGraph 服务器也可以继续运行。因此，在长时间运行的服务器下推荐以守护进程模式启动 TuGraph 服务器。
+
+### 2.1.运行普通进程
+
+`lgraph_server -d run`命令可以将 TuGraph 作为普通进程运行。普通进程依赖命令行终端，因此终端结束时，TuGraph 进程也会自动终止。普通进程模式配合`--log_dir ""`可以将进程日志直接输出到终端，因此更方便调试。注：当不使用`-d run`命令时，将默认运行普通进程。
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d run -c lgraph_standalone.json --log_dir ""
+```
+或者：
+```shell
+$ ./lgraph_server -c lgraph_standalone.json --log_dir ""
+```
+
+普通模式的运行输出示例：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v3.6.0                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:               0
+  DB directory:                    ./lgraph_db
+  HA enable:                       0
+  HTTP port:                       7071
+  HTTP web dir:                    ./resource
+  RPC enable:                      1
+  RPC port:                        9091
+  SSL enable:                      0
+  Whether the token is unlimited:  0
+  audit log enable:                0
+  bind host:                       0.0.0.0
+  disable auth:                    0
+  durable:                         0
+  log dir:                         ""
+  log verbose:                     2
+  optimistic transaction:          0
+  subprocess idle limit:           600
+  thread limit:                    0
+[2023-Aug-23 15:35:29.172716] [INFO] - [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[2023-Aug-23 15:35:29.174881] [INFO] - Listening for RPC on port 9091
+[2023-Aug-23 15:35:29.176401] [DEBUG] [Galaxy] - Loading DB state from disk
+[2023-Aug-23 15:35:29.185353] [INFO] [RestServer] - Listening for REST on port 7071
+[2023-Aug-23 15:35:29.185585] [INFO] - Server started.
+```
+
+普通进程模式下，用户可以通过按 `CTRL+C` 来提前终止 TuGraph 进程。
+
+### 2.2.运行进程守护模式
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d start -c lgraph_daemon.json
+```
+
+守护模式的运行输出示例：
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+## 3.服务操作
+
+### 3.1.启动服务
+
+TuGraph 需要通过 `lgraph_server -d start` 命令行启动，启动命令示例如下：
+
+```bash
+$ ./lgraph_server -d start -c lgraph_daemon.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph_daemon.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+### 3.2.停止服务
+
+用户可以使用`kill`命令以及`lgraph_server -d stop`命令停止 TuGraph 守护进程。由于可能在同一台计算机上运行多个 TuGraph 服务器进程，因此我们使用`.pid`文件区分不同的服务器进程，该文件写入启动该进程的工作目录。因此，需要在相同工作目录中运行`lgraph_server-d stop`命令，以停止正确的服务器进程。
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph_standalone.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph_standalone.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.重启服务
+
+用户也可以通过`lgraph_server -d restart`来重启 TuGraph 服务：
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+## 4.服务配置
+
+TuGraph 服务器在启动时从配置文件和命令行选项加载配置，如果在配置文件和命令行中同一选项指定了不同的值，将优先使用命令行中指定的值。
+
+### 4.1.配置参数
+
+具体参数及其类型描述如下：
+
+| **参数名**                      | **<nobr>参数类型</nobr>** | **参数说明**                                                                                                                                                                          |
+|------------------------------|-----------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                    | 字符串                   | 数据文件所在目录。如果目录不存在 ，则自动创建。默认目录为 /var/lib/lgraph/data。                                                                                                                               |
+| durable                      | 布尔值                   | 是否开启实时持久化。关闭持久化可以减少写入时的磁盘 IO 开销，但是在机器断电等极端情况下可能丢失数据。默认值为 `true`。                                                                                                                  |
+| host                         | 字符串                   | REST 服务器监听时使用的地址，一般为服务器的 IP 地址。默认地址为 0.0.0.0。注：在HA模式下，host需要设置为对应服务器的IP地址，不能设置为0.0.0.0。                                                                                           |
+| port                         | 整型                    | REST 服务器监听时使用的端口。默认端口为 7070。                                                                                                                                                      |
+| enable_rpc                   | 布尔值                   | 是否使用 RPC 服务。默认值为 false。                                                                                                                                                           |
+| rpc_port                     | 整型                    | RPC 及 HA 服务所用端口。默认端口为 9090。                                                                                                                                                       |
+| bolt_port                    | 整型                    | Bolt 客户端端口。默认端口为 7687。                                                                                                                                                            |
+| enable_ha                    | 布尔值                   | 是否启动高可用模式。默认值为 false。                                                                                                                                                             |
+| ha_log_dir                   | 字符串                   | HA 日志所在目录，需要启动 HA 模式。默认值为空。                                                                                                                                                       |
+| verbose                      | 整型                    | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。默认值为 1。                                                                                                                                         |
+| log_dir                      | 字符串                   | 日志文件所在的目录。默认目录为 /var/log/lgraph/。                                                                                                                                                 |
+| ssl_auth                     | 布尔值                   | 是否使用 SSL 安全认证。当开启时，REST 服务器只开启 HTTPS 服务。默认值为 false。                                                                                                                               |
+| web                          | 字符串                   | web 文件（包含可视化部分）所在目录。默认目录为 /usr/local/share/lgraph/resource。                                                                                                                       |
+| server_cert                  | 字符串                   | 在 SSL 认证开启时，服务器所使用的 certificate 文件路径。默认路径为 /usr/local/etc/lgraph/server-cert.pem。                                                                                                 |
+| server_key                   | 字符串                   | 在 SSL 认证开启时，服务器所使用的公钥文件。默认目录为 /usr/local/etc/lgraph/server-key.pem。                                                                                                               |
+| enable_audit_log             | 布尔值                   | 是否启用审计日志，默认值为 false。                                                                                                                                                              |
+| audit_log_expire             | 整型                    | 启用审计日志时，日志的有效时间（小时），超时自动清理，值为 0 时表示不清理。默认值为 0。                                                                                                                                    |
+| audit_log_dir                | 字符串                   | 启用审计日志时，日志文件的存放目录。默认目录为 $directory/_audit_log_。                                                                                                                                   |
+| load_plugins                 | 布尔值                   | 启动服务时导入所有存储过程。默认值为 true。                                                                                                                                                          |
+| optimistic_txn               | 布尔值                   | 为 Cypher 开启乐观多线程写入事务。默认为 false。                                                                                                                                                   |
+| disable_auth                 | 布尔值                   | 关闭 REST 验证。默认为 false。                                                                                                                                                             |
+| ha_snapshot_interval_s       | 整型                    | 快照间隔（以秒为单位），默认值为 604800。-1表示不自动生成快照。                                                                                                                                              |
+| ha_heartbeat_interval_ms     | 整型                    | 心跳间隔（以毫秒为单位）。 默认值为 1000。                                                                                                                                                          |
+| ha_node_offline_ms           | 整型                    | 心跳超时且节点下线间隔（以毫秒为单位）。默认为 60000。                                                                                                                                                    |
+| ha_node_remove_ms            | 整型                    | 节点被视为完全死亡并从列表中删除的间隔（以毫秒为单位）。默认值为 120000。                                                                                                                                          |
+| ha_first_snapshot_start_time | 字符串                   | 第一次打快照的时间，格式为"HH:MM:SS"，表示为在下一个HH:MM:SS时间点第一次打snapshot，以后每ha_snapshot_interval_s秒打一次。默认值为""，表示在0-ha_snapshot_interval_s内的任一时刻随机打第一次snapshot，以后每ha_snapshot_interval_s秒打一次snapshot |
+| enable_ip_check              | 布尔值                   | 允许 IP 白名单，默认值为 false。                                                                                                                                                             |
+| idle_seconds                 | 整型                    | 子进程可以处于空闲状态的最大秒数。 默认值为 600。                                                                                                                                                       |
+| enable_backup_log            | 布尔值                   | 是否启用备份日志记录。 默认值为 false。                                                                                                                                                           |
+| backup_log_dir               | 字符串                   | 存储备份文件的目录。 默认值为空。                                                                                                                                                                 |
+| snapshot_dir                 | 字符串                   | 存储快照文件的目录。 默认值为空。                                                                                                                                                                 |
+| thread_limit                 | 整型                    | 同时使用的最大线程数。 默认值为 0，即不做限制，以 license 为准。                                                                                                                                            |
+| unlimited_token              | 布尔值                   | 是否将链接token设置为无期限。 默认值为 false，有效期为24小时。                                                                                                                                            |
+| reset_admin_password         | 布尔值                   | 是否重置管理者密码。 默认值为 false。 为 true 时，密码重置为`73@TuGraph`。                                                                                                                                |
+| enable_fulltext_index        | 布尔值                   | 是否启用全文索引功能，默认值为 false。                                                                                                                                                            |
+| fulltext_analyzer            | 字符串                   | 全文索引分词器类型。可设为`StandardAnalyzer`或者`SmartChineseAnalyzer`。默认是`StandardAnalyzer`                                                                                                     |
+| fulltext_commit_interval     | 整形                    | 全文索引数据提交周期,针对写操作，单位秒。默认是 0，立即提交。                                                                                                                                                  |
+| fulltext_refresh_interval    | 整形                    | 全文索引数据刷新周期，针对读操作，单位秒。默认是 0，立即可以读到最新写入的数据。                                                                                                                                         |
+| ha_conf                      | 字符串                   | 根据 host1:port1,host2:port2,host3:port3 初始化HA集群，默认值为空。                                                                                                                             |
+| ha_node_join_group_s         | 整形                    | 节点尝试加入高可用集群的等待时长，单位秒，默认是 10。                                                                                                                                                      |
+| ha_bootstrap_role            | 整形                    | 是否使用bootstrap方式启动，以及使用该方式启动的服务器角色，0代表不使用bootstrap方式启动，1代表使用bootstrap方式启动且本节点为leader，2代表使用bootstrap方式启动且本节点为follower，只有这3种选项。 默认值为 0。                                              |
+| help                         | 布尔值                   | 打印此帮助消息。 默认值为 false。                                                                                                                                                              |
+
+### 4.2.服务器配置文件
+
+TuGraph 的配置文件以 JSON 格式存储。建议将大多数配置存储在配置文件中，并且仅在需要时使用命令行选项临时修改某些配置参数。
+一个典型的配置文件如下：
+
+```json
+{
+  "directory": "/var/lib/lgraph/data",
+
+  "port": 7070,
+  "rpc_port": 9090,
+  "enable_ha": false,
+
+  "verbose": 1,
+  "log_dir": "/var/log/lgraph/",
+
+  "ssl_auth": false,
+  "server_key": "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert": "/usr/local/etc/lgraph/server-cert.pem"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..1d38b39017
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,179 @@
+# 部署高可用模式
+
+> 此文档主要介绍了高可用模式的原理、准备工作、以及服务器的操作说明
+
+## 1.原理
+
+TuGraph 通过多机热备份来提供高可用（HA）模式。在高可用模式下，对数据库的写操作会被同步到所有服务器（非witness）上，这样即使有部分服务器宕机也不会影响服务的可用性。
+
+高可用模式启动时，多个 TuGraph 服务器组成一个备份组，即高可用集群。每个备份组由三个或更多 TuGraph 服务器组成，其中某台服务器会作为`leader`，而其他复制组服务器则作为`follower`。写入请求由`leader`
+提供服务，该`leader`将每个请求复制同步到`follower`，并在请求同步到服务器后才能响应客户端。这样，如果任何服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选择出新的`leader`。
+
+TuGraph的高可用模式提供两种类型的节点：`replica`节点和`witness`节点。其中，`replica`节点是普通节点，有日志有数据，可对外提供服务。
+而`witness`节点是一种只接收心跳和日志但不保存数据的节点。根据部署需求，`leader`节点和`follower`节点可以灵活的部署为`replica`节点或`witness`节点。
+基于此，TuGraph高可用模式的部署方式有两种：一是普通部署模式，二是带witness的简约部署模式。
+
+对于普通部署模式，`leader`和所有`follower`均为`replica`类型的节点。写入请求由`leader`提供服务，该`leader`将每个请求复制同步到`follower`，
+并在请求同步到超过半数的服务器后才能响应客户端。这样，如果少于半数的服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选举出新的`leader`，通过这种方式保证数据的一致性和服务的可用性。
+
+然而，在用户服务器资源不够或者发生网络分区时，不能建立正常的HA集群。此时，由于`witness`节点没有数据，对资源占用小，可以将`witness`节点和`replica`节点部署在一台机器上。
+例如，当只有2台机器的情况下，可以在一台机器上部署`replica`节点，在另一台机器上部署`replica`节点和`witness`节点，不仅节省资源，而且不需要把日志应用到状态机上，
+也不需要生成和安装快照，因此响应请求的速度很快，可以在集群崩溃或网络分区时协助快速选举出新的`leader`，这就是TuGraph HA集群的简约部署模式。
+尽管`witness`节点有诸多好处，但是由于没有数据，集群实际上增加了一个不能成为`leader`的节点，因此可用性会略有降低。为提高集群的可用性，
+可通过指定`ha_enable_witness_to_leader`参数为`true`，允许`witness`节点临时当主。`witness`节点在把新日志同步到其他节点之后，
+会将leader角色主动切换到有最新日志的节点。
+
+v3.6及以上版本支持此功能。
+
+## 2.准备工作
+
+要启用高可用模式，用户需要：
+
+- 三台及以上的 TuGraph 服务器实例。
+
+- 在启动 lgraph_server 时打开高可用模式，可以使用配置文件或者命令行将`enable_ha`选项设置为`true`。
+
+- 设置正确的`rpc_port`，可通过配置文件或者命令行设置。
+
+## 3.启动初始备份组
+
+安装好TuGraph之后，可以使用`lgraph_server`命令在不同的机器上启动高可用集群。本节主要讲解高可用集群的启动方式，启动之后的集群状态管理参见[lgraph_peer工具](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.初始数据一致
+
+当启动时所有服务器中的数据相同或没有数据时，用户可以通过指定`--ha_conf host1:port1,host2:port2`启动服务器。
+这种方式可以将准备好的所有TuGraph实例一次性加入初始备份组，由备份组中的所有服务器根据raft协议选举出`leader`，并将其他服务器以`follower`的角色加入备份组。
+
+启动初始备份组的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+### 3.2.初始数据不一致
+
+如果第一台服务器中已有数据（以`lgraph_import`工具导入或从非高可用模式的服务器传输得到），
+并且之前并未在高可用模式下使用，则用户应使用boostrap方式启动。
+以`ha_bootstrap_role`参数为1在bootstrap模式下启动有数据的服务器，并通过`ha_conf`参数指定本机为`leader`。
+在bootstrap模式下，服务器在将新加入的服务器添加到备份组之前会将自己的
+数据复制到新服务器中，以使每个服务器中的数据保持一致。
+
+启动有数据服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+其他无数据的服务器需要指定`ha_bootstrap_role`参数为2，并通过`ha_conf`参数指定`leader`即可，命令示例如下所示
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**使用bootstrap启动HA集群时需要注意两点：**
+1. 需要等待`leader`节点生成snapshot并且成功启动之后再加入`follower`节点，否则`follower`节点可能加入失败。在启动`follower`节点时可以将`ha_node_join_group_s`参数配置的稍大，以在加入HA集群时多次等待和超时重试。
+2. HA集群只有在第一次启动时可以使用bootstrap模式，后续再启动时只能使用普通模式(见3.1节)启动，尤其不能让同一个集群的多个节点以bootstrap模式启动，否则可能产生数据不一致的情况
+
+## 4.启动witness节点
+
+### 4.1.不允许witness节点成为leader
+
+`witness`节点的启动方式和普通节点的启动方式一致，只需要设置`ha_is_witness`参数为`true`即可。需注意，witness节点的数量应少于集群节点总数量的一半。
+
+启动`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+注：默认不允许`witness`节点成为`leader`节点，这可以提高集群的性能，但是在`leader`节点崩溃时会降低集群的可用性。
+
+### 4.2.允许witness节点成为leader
+
+可以通过指定`ha_enable_witness_to_leader`参数为`true`，使得`witness`节点可以临时成为`leader`节点，在将新日志同步完成之后再主动切主
+
+启动允许成为`leader`节点的`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+注：尽管允许`witness`节点成为`leader`节点可以提高集群的可用性，但是在极端情况下可能会影响数据的一致性。因此一般应保证`witness`节点数量+1少于集群节点总数量的一半。
+
+## 5.横向扩展其他服务器
+
+启动初始备份组后，如果想对备份组进行横向扩展，要将新服务器添加到备份组，
+应使用`--ha_conf HOST：PORT`选项，其中`HOST`可以是该备份组中已有的任何服务器的 IP 地址，
+而`PORT`是其 RPC 端口。例如：
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+此命令将启动一台高可用模式的 TuGraph 服务器，并尝试将其添加到包含服务器`172.22.224.15:9090`的备份组中。
+请注意，加入备份组需要服务器将其数据与备份组的`leader`服务器同步，此过程可能需要相当长的时间，具体取决于数据的大小。
+
+## 6.停止服务器
+
+当服务器通过`CTRL-C`下线时，它将通知当前的`leader`服务器，告知其从备份组中删除该下线的服务器。如果`leader`服务器下线，
+它将在下线前将`leader`身份权限传给另一台服务器。
+
+如果服务器被终止或者与备份组中的其他服务器失去连接，则该服务器将被视为失败节点，`leader`服务器将在特定时限后将其从备份组中删除。
+
+如果任何服务器离开备份组并希望重新加入，则必须从`--ha_conf HOST:PORT`选项开始，其中`HOST`是当前备份组中的某台服务器的 IP 地址。
+
+## 7.重启服务器
+
+不建议重新启动整个备份组，因为它会中断服务。如果需要，可以关闭所有服务器。但在重新启动时，
+必须保证关闭时的备份组中至少有N/2+1的服务器能正常启动，否则启动失败。 并且，
+无论初始启动复制组时是否指定`enable_bootstrap`为true，重启服务器时都只需通过
+指定`--ha_conf host1:port1,host2:port2`参数一次性重启所有服务器即可，命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker部署高可用集群
+
+在真实业务场景中，很可能遇到在多种操作系统或架构上部署高可用集群的需求。
+差异化的环境可能导致编译TuGraph时缺少某些依赖。因此，
+在docker中编译软件并部署高可用集群是非常有应用价值的。以centos7版本的docker为例，
+部署高可用集群的步骤如下所示。
+
+### 8.1.安装镜像
+使用如下命令下载TuGraph的编译docker镜像环境
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+然后拉取TuGraph源码并编译安装
+
+### 8.2.创建容器
+使用如下命令创建容器，使用`--net=host`使得容器运行在host模式，此模式下
+docker和宿主机和共享网络namespace，即共用同一个IP。
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.启动服务
+在每台服务器上使用如下命令启动服务，因为docker和宿主机共享IP，所以可以直接指定在宿主机IP上启动服务
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.查看服务器状态
+
+备份组的当前状态可以在 TuGraph 可视化工具、REST API 以及 Cypher 查询中获取。
+
+在 TuGraph 可视化工具中，可以在 DBInfo 部分中找到备份组中的服务器及其角色列表。
+
+使用 REST API 时，可以使用`GET /info/peers` 请求获取信息。
+
+在 Cypher 中，使用`CALL dbms.listServers()`语句来查询当前备份组的状态信息。
+
+## 10.高可用模式下数据同步问题
+
+在高可用模式下，同一备份组中的不同服务器可能并不总是处于相同的状态。出于性能原因，如果请求已同步到超过一半的服务器，则`leader`服务器将认为该请求属于`committed`状态。尽管其余服务器最终将收到新请求，但服务器的状态不一致将持续一段时间。客户端也可能向刚刚重新启动的服务器发送请求，从而具有较旧的状态。
+
+为了确保客户端看到一致连续的数据，特别是为了摆脱`反向时间旅行`问题（其中客户端读取比以前看到的状态更旧的状态），每个 TuGraph 服务器都会保持一个单调增加的数据版本号。备份组中数据版本号到数据库状态的映射全局一致，这意味着如果两台服务器具有相同的数据版本号，则它们必须具有相同的数据。响应请求时，服务器在响应中包含了其数据版本号。因此，客户端可以知道它看到了哪个版本。客户端收到旧版本的数据之后可以重新向Leader发送请求，从而获取到最新的数据。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..f2bf6bb3a5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+安装和运行
+============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..30a7d25af3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,483 @@
+# 数据导入
+
+> 此文档主要介绍 TuGraph 的数据导入功能。其中包括 CSV 格式的分隔符，jsonline 的格式示例，以及导入在线和离线的两种模式。
+
+## 1.简介
+
+在图数据库服务安装成功后，您可以使用`lgraph_import`批量导入工具将现有数据导入 TuGraph。`lgraph_import`支持从 CSV 文件和 JSON 数据源导入数据。
+
+> CSV 格式
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline 格式
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph 支持两种导入模式：
+
+- _离线模式_：读取数据并将其导入指定服务器的数据文件，应仅在服务器离线时完成。
+- _在线模式_：读取数据并将其发送到工作中的服务器，然后将数据导入其数据库。
+
+## 2.CSV文件格式分隔符
+
+    CSV格式的分隔符可以是单字符或多字符组成的字符串，其中不能包含`\r`或`\n`。注意不同的shell会对输入字符串做不同的处理，因此针对不同的shell输入参数可能需要不同的转义处理。
+
+此外，`lgraph_import`还支持以下转义字符，以便输入特殊符号：
+
+| 转义符 | 说明                                                             |
+| ------ | ---------------------------------------------------------------- |
+| \\     | 反斜杠`\\`                                                       |
+| \\a    | 响铃，即 ASCII 码 0x07                                           |
+| \\f    | form-feed，即 ASCII 码 0x0c                                      |
+| \\t    | 水平制表符，即 ASCII 码 0x09                                     |
+| \\v    | 垂直制表符，即 ASCII 码 0x0b                                     |
+| \\xnn  | 两位十六进制数，表示一个字节，如\\x9A                            |
+| \\nnn  | 三位八进制数，表示一个字节，如\\001, \\443，数值范围不能超过 255 |
+
+例：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.配置文件
+
+`lgraph_import`工具通过指定的配置文件进行环境配置。配置文件描述输入文件的路径、它们所代表的点/边以及点/边的格式。
+
+### 3.1.配置文件格式
+
+配置文件包含两部分：schema 和 files。`schema`部分定义 label，`files`部分描述要导入的数据文件。
+
+#### 3.1.1.关键字
+
+- schema (数组形式）
+  - label（必选，字符串形式）
+  - type（必选，值只能是 VERTEX 或者 EDGE）
+  - properties（数组形式，对于点必选，对于边如果没有属性可以不配置）
+    - name（必选，字符串形式）
+    - type （必选，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（可选，代表该字段可以配置，也可以不配置）
+    - index（可选，该字段是否需要建索引）
+    - unique（可选，该字段是否建索引，并且是 unique 类型的，即全局唯一）
+    - pair_unique（可选，该字段是否建索引，并且是 pari_unique 类型的，即两点间唯一，仅用于边索引）unique与pair_unique只能设置一个，同时设置并运行将会因为输入异常而终止
+  - primary (仅点配置，必选，主键字段，需指定一个 property，用来唯一确定一个点)
+  - temproal (仅边配置，可选，指定时间戳属性用于存储层排序)
+  - temporal_field_order (仅边配置，可选，默认为"ASC"，表示升序，也可配置为"DESC"，表示降序)
+  - constraints (仅边配置，可选，数组形式，起点和终点的 label，不配置或者为空代表不限制)
+  - detach_property (点边都可配置，可选，默认是`false`。`true` 代表属性数据单独存放，在内存不够，属性数据比较多的场景下可以减少io读放大)
+- files （数组形式）
+  - path（必选，字符串，可以是文件路径或者目录的路径，如果是目录会导入此目录下的所有文件，需要保证有相同的 schema）
+  - header（可选，数字，头信息占文件起始的几行，没有就是 0）
+  - format（必须选，只能是 JSON 或者 CSV）
+  - label（必选，字符串）
+  - columns（数组形式）
+    - SRC_ID (特殊字符串，仅边有，代表这列是起始点数据)
+    - DST_ID (特殊字符串，仅边有，代表这列是目的点数据)
+    - SKIP   (特殊字符串，代表跳过这列数据)
+    - [property]
+  - SRC_ID (仅边配置，值是起始点标签)
+  - DST_ID (仅边配置，值是目的点标签)
+
+#### 3.1.2.索引长度
+因为TuGraph对key的长度有限制，唯一索引不允许建立超过限制长度的索引，而非唯一索引会对超过长度限制的属性进行截断处理，并且在通过迭代器遍历非唯一索引时，拿到的key也是经过截断的，可能和预期不一致。针对不同类型的非唯一索引，截断长度是不同的。
+##### 3.1.2.1.unique索引
+unique索引是全局唯一的，该索引key的最大长度是480bytes。primary作为特殊的unique索引，因此最大key的长度也是480bytes，超过无法建立索引。
+##### 3.1.2.2.pair_unique索引
+pair_unique索引是指两点间唯一的索引，这种类型的索引只能创建于边的schema中，这种索引在用户指定的key后面加上了源点和目标点的vid，每个vid是5bytes长度。因此最大key的长度是470bytes，超过无法建立索引。
+##### 3.1.2.3.非唯一索引
+非唯一索引是指既没有设置unique为1，也没有设置pair_unique为1的索引，在TuGraph的实现中，此类索引一个key可能映射到多个值，为了加速查找和写入，在用户指定的key后面加上了一组vid或euid中的最大值。其中对于创建于点中的非唯一索引，key后面跟着vid，每个vid是5bytes长度，因此最大长度是475bytes。
+对于创建于边中的非唯一索引，key后面跟着euid，每个euid是24bytes长度，因此最大长度是456bytes。索引key超过对应长度则会自动截断。
+
+### 3.2.配置文件示例
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+对于上述配置文件，定义了三个 label：两个点类型`actor`和`movie`，一个边类型`role`。每个 label 都描述了：label 的名字、类型（点还是边）、属性字段有哪些以及每个字段的类型。对于点，另外定义了 primary 字段是哪个；对于边，另外定义了 constraints 字段，用来限制边的起点和终点只能是哪些组合。
+
+还描述了三个数据文件，两个点的数据文件`actors.csv`和`movies.csv`，一个边的数据文件`roles.csv`。每个部分都描述了：文件的路径（path）、数据类型（format）、信息头占开头几行（header）、是哪个 label 的数据（label）、文件中每行数据中的每个列对应的字段是哪个。
+
+对于上述配置文件，import 工具在执行的过程中会先在 TuGraph 中创建`actor`、`movie`、`role`这三个 label，然后再执行三个文件的数据导入。
+
+## 4.离线全量导入
+
+离线模式只能在离线状态的服务器使用。离线导入会创建一张新图，因此更适合新安装的 TuGraph 服务器上的第一次数据导入。
+要在离线模式下使用`lgraph_import`工具，可以指定`lgraph_import --online false`选项。要了解可用的命令行选项，请使用`lgraph_import --online false --help`：
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+命令行参数：
+
+- **-c, --config_file** `config_file`: 导入配置文件名，其格式要求见下述。
+- **--log** `log_dir`: 日志目录。默认为空字符串，此时将日志信息输出到控制台。
+- **--verbose** `0/1/2`: 日志等级，等级越高输出信息越详细。默认为 1。
+- **-i, --continue_on_error** `true/false`: 在碰到错误时跳过错误并继续，默认为 false，碰到错误立即退出。
+- **-d, --dir** `{diretory}`: 数据库目录，导入工具会将数据写到这个目录。默认为`./db`。
+- **--delimiter** `{delimiter}`: 数据文件分隔符。只在数据源是 CSV 格式时使用，默认为`","`。
+- **-u, --username** `{user}`: 数据库用户名。需要是管理员用户才能执行离线导入。
+- **-p, --password** `{password}`: 指定的数据库用户的密码
+- **--overwrite** `true/false`: 是否覆盖数据。设为 true 时，如果数据目录已经存在，则覆盖数据。默认为`false`。
+- **-g, --graph** `{graph_name}`: 指定需要导入的图种类。
+- **-h, --help**: 输出帮助信息。
+
+### 4.1.离线导入示例
+
+在这个例子中，我们使用上面描述的电影-演员数据来演示导入工具的使用方法。待导入数据分为三个文件：`movies.csv`，`actors.csv`，`roles.csv`。
+
+`movies.csv`包含的是电影的信息，其中每部电影有一个 id（作为检索的 primary key），此外每部电影还拥有 title、year 和 rating 等属性。（数据来自[IMDb](http://www.imdb.com)）。
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+对应的 jsonline 格式如下:
+也可以所有字段都是字符串形式，导入的时候会转换成对应的类型
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`包含的是演员的信息。每个演员也拥有一个 id，以及 name 等属性。
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> 对应的 jsonline 格式如下:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`则包含了演员在哪个电影中扮演了哪个角色的信息。其中每一行记录的是指定演员在指定电影里饰演的角色，对应数据库中的一条边。`SRC_ID` 和 `DST_ID` 分别是边的源点和目标点，他们分别是`actors.csv`和`movies.csv`中定义的`primary`属性。
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+对应的 jsonline 格式如下:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+`配置文件import.conf`，注意每个文件中有两个标题行，因此我们需要指定`HEADER=2`选项。
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+使用导入配置文件，我们现在可以使用以下命令导入数据：
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # 从import.conf读取配置信息
+        --dir /data/lgraph_db      # 将数据存放在/data/lgraph_db
+        --graph mygraph            # 导入名为 mygraph 的图
+```
+
+**注意**：
+
+- 如果名为`mygraph`的图已存在，导入工具将打印错误消息并退出。要强制覆盖图形，可以使用`--overwrite true` 选项。
+- 配置文件和数据文件必须使用 UTF-8 编码（或普通 ASCII 编码，即 UTF-8 的子集）存储。如果任何文件使用 UTF-8 以外的编码（例如，带有 BOM 或 GBK 的 UTF-8）编码，则导入将失败，并输出分析器错误。
+
+## 5.在线增量导入
+
+在线导入模式可用于将一批文件导入已在运行中的 TuGraph 实例中。这对于处理通常以固定的时间间隔进行的增量批处理更新非常便利。`lgraph_import --online true`选项使导入工具能够在线模式工作。与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据发送到正在运行的 TuGraph 实例中，该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+
+如果用户和密码有效，并且指定的图存在，导入工具将将数据发送到服务器，服务器随后解析数据并将其写入指定的图。数据将以大约 16MB 大小的包发送，在最近的换行符处中断。每个包都是以原子方式导入的，这意味着如果成功导入包，则成功导入所有数据，否则，任何数据都不会进入数据库。如果指定了`--continue_on_error true`，则忽略数据完整性错误，并忽略违规行。否则，导入将在第一个错误包处停止，并打印出已导入的包数。在这种情况下，用户可以修改数据以消除错误，然后使用`--skip_packages N`重做导入以跳过已导入的包。
+
+## 6.在线全量导入
+
+在线全量导入可用于将一批文件导入运行中的TuGraph实例，TuGraph支持将两种不同类型的数据在线导入到实例中：
+1. 和离线导入类型相同的原数据文件（csv等）
+2. TuGraph的底层存储文件，即data.mdb文件，该文件可以由离线导入生成，也可以是其他TuGraph db的文件。
+这两种方式的适用场景不同，第一种是直接将数据导入到TuGraph中，优点是一次性自动导入，操作步骤简单。但是会在server端启动一个离线导入线程，
+只适合单机情况下的小规模数据导入。第二种是将已经准备好的底层存储文件导入到TuGraph中，虽然需要提前准备好mdb文件，但是对系统资源却没有很高的要求，
+而且支持远程下载文件导入，非常方便，适用于高可用模式或者大规模数据的在线导入。
+
+### 6.1 从原数据导入
+从原数据导入的执行方式是向运行中的TuGraph实例发送导入请求，
+实例接到请求后先使用离线导入（V3）的方式将数据导入一个临时的db中，然后在实例中新建子图并将临时db的数据文件迁移到新子图中，最后刷新实例的元数据。
+相比在线增量导入，在线全量导入的性能更高。
+`lgraph_import --online true --online_type 1`选项使导入工具能够在线全量导入。
+与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --full              Whether to full import online. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据导入正在运行的 TuGraph 实例中，
+该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+并且，配置文件（config_file参数）要求是 TuGraph 实例机器上的uri路径，其file配置也要求是 TuGraph 实例机器上资源的绝对路径。
+
+如果用户和密码有效，导入工具将在服务器端执行在线全量导入。如果想导入的图已存在，可以使用`--overwrite true` 选项强制覆盖子图。
+
+### 6.2 从数据库文件导入
+从原数据在线全量导入尽管操作简单、性能较高，但是对服务器资源要求较高，且耗时较长。
+一种更加通用的方式是先使用离线导入在一个空db中导入子图，得到data.mdb文件，然后把该文件在线导入到
+TuGraph服务中。其使用方式如下所示：
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+除普通在线导入用到的url, user和password参数之外，从数据库文件导入的在线全量导入方式
+使用graph参数指定导入的子图名称，path参数指定文件路径，remote指定文件存在在远程或者本地。
+如果是本地文件，则需要保证HA集群中所有的节点在path路径下都有该文件。如果是远程文件，则会先下载再导入。
+需要注意的是，由于data.mdb只有一份，需要保证HA的各个节点和离线导入生成data.mdb的机器的环境完全一致，
+以保证不会出现环境问题。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..5544169de0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# 数据导出
+
+> 此文档主要介绍 TuGraph 的数据导出功能。
+
+## 1.简介
+
+TuGraph 可以通过 `lgraph_export` 工具来对已经存放在TuGraph的图数据进行数据导出。 `lgraph_export` 工具可以将指定 TuGraph 数据库的数据以 `csv` 或者 `json` 文件形式导出到指定目录，同时导出这些数据进行再导入时需要的配置文件 `import.config` ，详细描述可参见[配置文件](1.data-import.md)。
+
+## 2.导出命令
+
+该工具的命令示例如下：
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+其中：
+
+- `-d {database_dir}` 指定需要进行数据导出的数据库所在目录，默认值为 `./testdb`。
+- `-e {export_destination_dir}` 指定导出文件存放的目录，默认值为 `./exportdir`。
+- `-g {graph_to_use}` 指定图数据库的种类，默认为 `default` 。
+- `-u {username}` 指定进行该导出操作的用户的用户名。
+- `-p {password}` 指定进行该导出操作的用户的用户密码。
+- `-s {field_separator}` 指定导出文件的分隔符，默认为逗号。
+- `-f {output_format}` 指定导出数据的格式，`json`或者`csv`，默认为`csv`。
+- `-h` 除上述指定参数外，也可以使用该参数查看该工具的使用帮助。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..ce113ad0a4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,35 @@
+# 备份恢复
+
+> 此文档主要介绍 TuGraph 的数据备份和恢复功能。
+
+## 1.数据备份
+
+TuGraph 可以通过 `lgraph_backup` 工具来进行数据备份。
+`lgraph_backup` 工具可以将一个 TuGraph 数据库中的数据备份到另一个目录下，它的用法如下：
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+其中：
+
+- `-s {source_dir}` 指定需要备份的数据库（源数据库）所在目录。
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
+  如果目标数据库不为空，`lgraph_backup` 会提示是否覆盖该数据库。
+- `-c {true/false}` 指明是否在备份过程中进行 compaction。
+  compaction 能使产生的备份文件更紧凑，但备份时间也会变长。该选项默认为 `true`。
+
+## 2.数据恢复
+
+使用`lgraph_backup` 工具得到的目标数据库`{destination_dir}`备份了源数据库
+`{source_dir}`的所有子图，但不包含HA集群的raft信息，从而保证服务和集群能
+以备份数据库成功重启并与源数据库的数据一致。使用如下命令可以用备份数据库重启服务，
+在服务启动时会恢复所有子图的存储过程，保证备份服务和原服务完全一致。
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+其中：
+
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..c0c5afb7eb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# 数据预热
+
+> 此文档主要介绍 TuGraph 的数据预热功能。
+
+## 1.简介
+
+TuGraph 是基于磁盘的数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+## 1.数据预热命令
+
+数据预热可以通过工具 `lgraph_warmup` 来进行。它的使用示例如下：
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+其中：
+
+- `-d {db_dir}` 选项指定了 TuGraph 服务器的数据目录
+
+- `-g {graph_list}` 选项指定需要进行数据预热的图名称，用逗号分隔
+
+根据数据大小和所使用的磁盘类型不同，预热过程运行时间也不同。机械磁盘上预热一个大数据库可能耗时较长，请耐心等待。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..0a113bfa78
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# 集群管理
+
+> 此文档主要介绍 TuGraph HA 集群的管理工具，主要包括删除节点、leader转移和生成snapshot功能
+
+## 1. 简介
+
+HA集群启动之后，可以使用`lgraph_peer`工具进行集群管理，可以执行删除节点，转移leader和生成snapshot等功能。
+
+## 2. 删除节点
+
+对于TuGraph HA集群中长期离线或者产生网络分区的节点，可以使用`lgraph_peer`的`remove_peer`命令删除节点。命令示例如下所示：
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command remove_peer` 指定要执行的操作为remove_peer，即删除节点。
+- `--peer {peer_id}` 指定要删除节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 3. leader 转移
+
+当需要对主节点执行停机或重启操作时，为减少集群的不可服务时间，可以使用`lgraph_peer`的`transfer_leader`命令转移主节点。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command transfer_leader` 指定要执行的操作为transfer_leader，即转移主节点。
+- `--peer {peer_id}` 指定要成为主节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 4. 生成snapshot
+
+出于节点启动时设置ha_snapshot_interval_s为-1以默认不打snapshot或其他原因，
+当需要让某个节点手动生成snapshot时，可以使用`lgraph_peer`的`snapshot`命令。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+其中：
+
+- `--command snapshot` 指定要执行的操作为snapshot，即生成快照。
+- `--peer {peer_id}` 指定要生成快照的节点的rpc网络地址，如 `127.0.0.1:9092`。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..72b6187767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,134 @@
+# 命令行工具
+
+> 此文档主要介绍 lgraph_cypher 文档的使用，注意不再更新维护，请使用 [lgraph_cli](../7.client-tools/6.bolt-console-client.md)
+
+TuGraph 发布版本附带名为`lgraph_cypher`的查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+## 1.单命令模式
+
+在单命令模式下，`lgraph_cypher`可用于提交单个 Cypher 查询并将结果直接打印到终端，打印结果也可以容易地重定向写入指定文件。当用户需要从服务器获取大量结果并将其保存在文件中时，这非常便利。
+在此模式下，`lgraph_cypher`工具具有以下选项：
+
+### 1.1.命令行参数:
+
+| 参数     | 类型   | 说明                                                                     |
+| -------- | ------ | ------------------------------------------------------------------------ | ------ | ----------------------------------------------------------------------------------------------------------------------------------------- |
+| --help   | \\     | 列出所有参数及说明。                                                     |
+| -example | \\     | 列出命令实例。                                                           |
+| -c       | string | 数据库的配置文件，用于获取 ip 与 port 信息。                             |
+| -h       | string | 数据库服务器 ip 地址，如有配置文件则可舍去此参数。默认值为`127.0.0.1` 。 |
+| -p       | string | 数据库服务器端口，如有配置文件则可舍去此参数。默认值为`7071` 。          |
+| -u       | string | 数据库登录用户名。                                                       |
+| -P       | string | 数据库登录密码。                                                         |
+| -f       | string | 包含单条 Cypher 查询单文本文件的路径。                                   |
+| -s       | string | 单行 cypher 查询命令。以`"`开头结尾。                                    |
+| -t       | int    | 进行 cypher 查询时服务器的超时阈值。默认值为`150`秒。 -format            | string | 查询结果显示模式。支持`plain`与`table`两种格式。`plain`格式会将查询结果单列打印。`table`格式会将查询结果以表格方式显示。默认值为`table`。 |
+
+### 1.2.命令示例:
+
+**cypher 命令文件查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+```
+
+**cypher 命令单句查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+```
+
+## 2.交互模式
+
+`lgraph_cypher`也可以在交互模式下运行。在交互式模式下，客户端与服务器保持连接，并在读取-评估-打印-循环中与用户进行交互。
+
+### 2.1.进入 lgraph_cypher 交互模式:
+
+如不加`-f`或`-s`命令行选项，运行`lgraph_cypher`时将会进入交互模式。使用方式如下：
+
+```
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+```
+
+如成功进入则会显示相应登录成功信息：
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2023 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+现在我们也提供一个交互式 shell ，用于用户输入 Cypher 查询语句或使用`:help`命令来检查可用命令。
+
+### 2.2.command种类与说明:
+
+除 Cypher 查询外，`lgraph_cypher` 的 shell 还接受以下命令：
+
+| 命令                     | 对应参数                           | 说明                                                                                                |
+| ------------------------ | ---------------------------------- | --------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                 | 显示服务器信息与所有 command 对应说明。                                                             |
+| :db_info                 | \\                                 | 当前服务器状态查询。对应 REST API 的/db/info。                                                      |
+| :clear                   | \\                                 | 清空屏幕。                                                                                          |
+| :use                     | {图的名称}                         | 使用该名称指定的图，默认值为`default` 。                                                            |
+| :source                  | `-t {查询timeout值} -f {查询文件}` | 可交互模式下的 cypher 命令文件查询。超时阈值默认值为`150`秒。查询文件格式参考无交互式查询参数。     |
+| :exit                    | \\                                 | 退出交互模式并返回原命令行。                                                                        |
+| :format                  | `plain` or `table`                 | 更改 cypher 查询结果的显示模式。支持`plain`与`table`模式。                                          |
+| :save all/command/result | `-f {文件路径}` `{cypher语句}`     | 存储 cypher 命令（command）或查询结果（result）或以上二者（all）。默认存储位置为`/saved_cypher.txt` |
+
+**注意:**
+
+- 每条命令都应该以冒号开始 `:`.
+
+**:save 命令例子:**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+```
+
+### 2.3.cypher 查询命令:
+
+在交互模式下，用户也可直接输入单句 cypher 命令进行查询，以"`;`"结束。输入命令不区分大小写。例子如下：
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher`输入命令时支持多行输入，用户可使用`ENTER`键将长查询语句分多行输入。多行输入情况下命令行开头会从`>`变为`=>`，然后用户可以继续输入查询的其余部分。
+
+例子如下：
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### 2.4.辅助功能:
+
+**历史查询：** 在交互模式下按上下方向键可查询输入历史。
+
+**自动补全：** lgraph_cypher 会根据输入历史进行自动补全。在补全提示出现的情况下，按下右方向键就会自动补全命令。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..643597f2bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,435 @@
+# TuGraph-DataX
+
+> 此文档主要介绍 TuGraph DataX 的安装编译和使用示例
+
+## 1.简介
+
+TuGraph 在阿里开源的 DataX 基础上添加了 TuGraph 的写插件以及 TuGraph jsonline 数据格式的支持，其他数据源可以通过 DataX 往 TuGraph 里面写数据。
+TuGraph DataX 介绍 [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX)，支持的功能包括：
+
+- 从 MySQL、SQL Server、Oracle、PostgreSQL、HDFS、Hive、HBase、OTS、ODPS、Kafka 等各种异构数据源导入 TuGraph
+- 将 TuGraph 导入相应的目标源 （待开发）
+
+![导入导出](../../../images/tugraph-datax.png)
+
+DataX 原始项目介绍参考 [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.编译安装
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+编译出来的 DataX 文件在 target 目录下
+
+## 3.文本数据通过DataX导入TuGraph
+
+我们以 TuGraph 手册中导入工具 lgraph_import 章节举的数据为例子，有三个 csv 数据文件，如下：
+`actors.csv`
+
+```
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+```
+
+`movies.csv`
+
+```
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+`roles.csv`
+
+```
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+```
+
+然后建三个 DataX 的 job 配置文件：
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后依次执行如下三个命令：
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+## 4.MySQL数据通过DataX导入TuGraph
+
+我们在 `test` database 下建立如下电影 `movies` 表
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+往表中插入几条数据
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+建立一个 DataX 的 job 配置文件
+
+`job_mysql_to_tugraph.json`
+
+**配置字段方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**写简单 sql 方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后执行如下命令：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..ea866abf5d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph-Explorer
+
+> TuGraph Explorer 已经合并到 [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/9.restful.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/9.restful.md
new file mode 100644
index 0000000000..1a62bd27a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/9.restful.md
@@ -0,0 +1,198 @@
+# TuGraph-Restful-Server
+
+> TuGraph Restful Server 强依赖 TuGraph，Restful Server 与 Tugraph 共存
+
+## 1.TuGraph-Restful-Server 简介
+TuGraph Restful Server 使用brpc框架支持的http协议，提供restful接口查询功能，在实现中，restful server 与rpc server 使用同一个端口。目前restful接口提供文件上传，数据导入，导入进度查询，cypher查询，文件删除等功能
+
+## 2.启动 TuGraph-Restful-Server
+需要在启动Tugraph时设置enable_rpc参数为true的方式，正常启动TuGraph
+
+## 3.连接 TuGraph-Restful-Server
+TuGraph正常启动后，Restful Server 将监听在rpc_port上， 通过访问 http://${ip}:${rpc_port}/LGraphHttpService/Query/ url可以链接到TuGraph
+
+## 4.数据格式
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+## 5.返回值
+
+通用返回格式
+
+|  body参数  | 参数说明  |  参数类型  |  是否必填  |
+|:--------:|:-----:|:------:| :-----: |
+| errorCode |  状态码  |  字符串  |  是  |
+| errorMessage | 错误信息  |  字符串  |  是  |
+| data | 返回的数据 |  字符串  |  是  |
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 401 Unauthorized: 未通过鉴权认证，例如用户名密码错误，token超过有效期等
+- 500 Internal Server Error: 服务器端错误
+  当操作成功时，返回的 data 中包含操作的返回值。
+  当发生输入错误或者服务器错误时，返回的 errorMessage 中包含错误提示。
+
+## 6.URI格式
+
+| URI               | 说明                 |
+|-------------------|--------------------|
+| /cypher           | 执行cypher查询请求       |
+| /refresh          | 刷新token请求          |
+| /login            | 用户登陆请求             |
+| /logout           | 用户登出请求             |
+| /upload_files     | 上传文件请求             |
+| /clear_cache      | 清理用户上传文件请求         |
+| /check_file       | 文件认证请求             |
+| /import_data      | 数据导入请求             |
+| /import_progress  | 导入进度查询请求           |
+| /import_schema    | 批量创建schema请求       |
+
+## 7.接口
+### 7.1 用户登陆
+用于用户第一次与服务端通信时的鉴权操作，请求报文在 http body 中携带用户名和密码，响应报文在 http body 中会返回一个带有有效期的token，后续请求中需要在http header中携带该token作为凭证
+#### 7.1.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/login
+#### 7.1.2 REQUEST
+|  body参数  |  参数说明  |  参数类型  |  是否必填  |
+|:--------:|:------:|:------:| :-----: |
+ | userName |  用户名  |  字符串  |  是  |
+ | password |   密码   |  字符串  |  是  |
+#### 7.1.3 RESPONSE
+|    body参数     | 参数说明  |  参数类型  |  是否必填  |
+|:-------------:|:-----:|:------:| :-----: |
+| authorization | token |  字符串  |  是  |
+
+### 7.2 刷新token
+token到期后将无法使用此token与服务端正常通信，需要获取新的token作为后续请求的凭证，请求报文在http header中携带旧的token，响应报文在http body中返回新的token
+#### 7.2.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/refresh
+#### 7.2.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+#### 7.2.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| authorization | 新的token |  字符串  |  是  |
+
+### 7.3 用户登出
+用户不再需要与服务端进行通信时，需要请求登出接口，释放自己的token。请求报文在http header中携带旧的token，如果拿到返回errorCode为200的响应报文即为正常登出
+#### 7.3.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/logout
+#### 7.3.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+### 7.4 执行cypher查询请求
+用户通过此类请求发cypher给server端执行并获取执行结果，请求报文在http body 中将执行的cypher语句和目标子图发送给server，server执行完成后在响应报文的http body中返回执行结果
+#### 7.4.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/cypher
+
+#### 7.4.2 REQUEST
+| body参数 |    参数说明    |  参数类型  |  是否必填  |
+|:------:|:----------:|:------:| :-----: |
+| graph  |   查询目标子图   |  字符串  |  是  |
+| script | cypher查询语句 |  字符串  |  是  |
+
+#### 7.4.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| result | 返回结果 |  字符串  |  是  |
+
+### 7.5 上传文件请求
+用户通过此类请求向server发送文件，可以对文件进行分片，分片大小不大于1MB，支持多线程乱序发送，请求报文在http header 中包含文件名，第一字节内容在文件中的偏移和分片大小，在body中包含文件内容，server收到请求后将验证分片大小是否与分片内容一致，一致时将文件分段写入文件。不一致时将返回errorCode为400的响应
+#### 7.5.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/upload_files
+
+#### 7.5.2 REQUEST
+| header参数  |    参数说明    |  参数类型  |  是否必填  |
+|:---------:|:----------:|:------:| :-----: |
+| File-Name |   文件名   |  字符串  |  是  |
+| Begin-Pos | 开始位置在文件内的偏移 |  字符串  |  是  |
+|   Size    | 文件分片大小 |  字符串  |  是  |
+|  body参数   |  参数说明   |  参数类型  |  是否必填  |
+|     -     | 文件内容 |  字符串  |  是  |
+
+### 7.6 文件认证请求
+用户通过此类请求验证发送到server端的文件是否与期望一致，server端使用两种验证方式，md5值和文件长度，目前已支持文件长度验证。
+#### 7.6.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/check_file
+#### 7.6.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| fileName |           文件名           |  字符串  |  是  |
+| checkSum |        文件对应md5值         |  字符串  |  否  |
+| fileSize |       文件长度(以字节计算)       |  字符串  |  否  |
+| flag | 标记位，为1时校验md5值，为2时校验文件长度 |  字符串  |  是  |
+
+#### 7.6.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| pass | 检查成功为true，否则为false |  bool  |  是  |
+
+### 7.7 批量创建schema请求
+用户通过此类请求批量创建schema，请求报文在http body 中将创建schema的目标子图和schema信息发送给server，如果拿到返回errorCode为200的响应报文即为正常创建
+#### 7.7.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_schema
+#### 7.7.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| graph |   创建目标子图   |  字符串  |  是  |
+| schema | schema描述信息 |  字符串  |  是  |
+
+### 7.8 数据导入请求
+用户通过此类请求导入已经上传的数据文件。导入不论成功或失败，都将删除已上传文件。数据导入请求在server中实现为一个异步任务，响应返回并不意味着导入已完成，返回的是任务id，后续可以通过此任务id查询导入进度
+#### 7.8.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_data
+#### 7.8.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  | 是否必填 |
+|:--------:|:-----------------------:|:------:|:----:|
+| graph |         导入目标子图          |  字符串  |  是   |
+| schema |       导入schema描述        | json字符串  |  是   |
+| delimiter |           分隔符           |  字符串  |  是   |
+| continueOnError |     单行数据出错是否跳过错误并继续     |  boolean  |  否   |
+| skipPackages |         跳过的包个数          |  字符串  |  否   |
+| taskId |  任务id   |  字符串  |  否   |
+| other | 其他参数 |  json字符串  |  否   |
+
+#### 7.8.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| taskId | 任务编号 |  字符串  |  是  |
+
+### 7.9 清理用户上传文件请求
+用户通过此类请求清理已经上传的文件，如果拿到返回errorCode为200的响应报文即为正常清理
+#### 7.9.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/clear_cache
+#### 7.9.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| fileName |    文件名称    |  字符串  |  否  |
+| userName |    用户名称    |  字符串  |  否  |
+| flag | 标记位， flag = 0时删除fileName指定文件, flag = 1时删除userName指定用户已经上传的所有文件， flag = 2时删除所有用户上传的文件 |  字符串  |  是  |
+
+### 7.10. 导入进度查询请求
+用户通过此类请求获得导入任务的状态
+#### 7.10.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_progress
+#### 7.10.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| taskId |           任务编号           |  字符串  |  是  |
+
+#### 7.10.3 RESPONSE
+| body参数 |                  参数说明                   |  参数类型  |  是否必填  |
+|:------:|:---------------------------------------:|:------:| :-----: |
+| state  | 状态标记，为0表示准备导入，为1表示导入中，为2表示导入成功，为3表示导入失败 |  字符串  |  是  |
+|  progress  |             导入进度，state为1时包含             |  字符串  |  否  |
+|  reason  |             失败原因，state为3时包含             |  字符串  |  否  |
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..00a7df7efb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+实用工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..cacf2d18bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/1.python-client.md
@@ -0,0 +1,237 @@
+# Python客户端
+
+> 此文档主要是TuGraph Python SDK的使用说明, 注意将来不再更新维护，建议使用 [bolt客户端](./5.bolt-client.md)
+
+## 1. 概述
+Python的TuGraph Client有两种，一种是RESTful的Client，使用HTTP方法向server发送请求，另一种是RPC的Client，使用RPC方法调用server远程服务，两者各有优劣。
+RESTful client的使用方式简单，在项目的src/client/python/TuGraphClient目录下可以找到Client的源码文件，直接安装到用户环境中即可使用，但是支持的功能较少，
+性能也不高。RPC Client既支持单机的server，也支持高可用集群和负载均衡，接口较多，功能强大。但是使用方式较为复杂，需要用户自己编译TuGraph项目得到liblgraph_client_python.so，
+或者使用runtime镜像时直接在/usr/local/lib64目录下找到该依赖库，将其引入python项目即可正常使用。接下来将详细介绍这两种Client的使用方式。
+
+## 2. RESTful Client
+
+### 2.1.安装Client
+
+TuGraph的Python RESTful client使用setuptools工具进行打包和分发，用户可以将client直接安装到本地环境中，在使用时即可直接引入。
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+注：使用setuptools工具安装python client时会安装httpx等依赖，需要在通外网的环境下执行。
+
+### 2.2.调用Cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = await aclient.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.调用存储过程
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+res = await aclient.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python的TuGraph Rpc Client是使用pybind11包装的CPP Client SDK，下表列出了Python和CPP Client SDK的对应关系。
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+Python RPC Client的使用方式较为复杂，用户可以在本地环境中编译TuGraph得到liblgraph_client_python.so，也可以使用官方提供的runtime镜像，
+在镜像中的/usr/local/lib64目录下可以直接找到该依赖库，引入用户项目即可使用。
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.实例化client对象
+
+#### 3.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 3.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 3.2.调用cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.3.向leader发送cypher请求
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.4.调用GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.5.向leader发送GQL请求
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.6.调用存储过程
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.7.向leader调用存储过程
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 3.8.加载存储过程
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 3.9.列举存储过程
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.10.删除存储过程
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 3.11.从字节流中导入schema
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.12.从字节流中导入点边数据
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 3.13.从文件中导入schema
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.14.从文件中导入点边数据
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..ce29ac4bf4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,340 @@
+# C++客户端
+
+> 此文档主要是TuGraph C++ SDK的使用说明。
+
+## 1.概述
+C++ Client 能够使用 RPC 连接lgraph_server，进行数据导入、执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直接连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化。
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.3.向leader发送cypher请求
+```C++
+    std::string str;
+    bool ret = client.CallCypherToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```C++
+    std::string str;
+    bool ret = client.CallGql(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGql(std::string& result, const std::string& gql,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling gql.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.5.向leader发送GQL请求
+```C++
+    std::string str;
+    bool ret = client.CallGqlToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGqlToLeader(std::string& result, const std::string& gql,
+                 const std::string& graph = "default", bool json_format = true,
+                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true);
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+
+### 2.8.加载存储过程
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送请求。
+
+### 2.10.删除存储过程
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..7abfeb9639
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/3.java-client.md
@@ -0,0 +1,290 @@
+# Java客户端
+
+> 此文档主要是TuGraph Java SDK的使用说明，需要注意的是TuGraph Java SDK将来不再更新维护，建议使用 [bolt客户端](./5.bolt-client.md)
+
+## 1.编译java client代码
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+## 2.使用示例
+
+### 2.1.实例化client对象
+
+添加maven依赖
+
+```xml
+<dependency>
+    <groupId>com.antgroup.tugraph</groupId>
+    <artifactId>tugraph-db-java-rpc-client</artifactId>
+    <version>1.4.1</version>
+</dependency>
+```
+
+引入依赖
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.3.向leader发送cypher请求
+```java
+    String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```java
+    String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling GQL
+    @return: the result of GQL query execution
+    public String callGql(String gql, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.5.向leader发送GQL请求
+```java
+    String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```java
+    String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedureToLeader : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @return: the result of procedure execution
+    public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 2.8.加载存储过程
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.10.删除存储过程
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException 
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout) 
+            throws UnsupportedEncodingException, IOException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..a9c06de71b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,174 @@
+# TuGraph-OGM
+
+## 1.简介
+
+> TuGraph-OGM 项目在其他仓库开源。
+
+TuGraph-OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。同时 TuGraph-OGM 兼容 Neo4j-OGM，Neo4j 生态用户可以无缝迁移到 TuGraph 数据库上。
+
+### 1.1.TuGraph-OGM 功能
+
+TuGraph-OGM 提供以下函数操作 TuGraph：
+
+| 功能                            | 用法                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| 插入单个节点\边                 | void session.save(T object)                                                      |
+| 批量插入节点\边                 | void session.save(T object)                                                      |
+| 删除节点与对应边                | void session.delete(T object)                                                    |
+| 删除指定 label 的全部节点       | void session.deleteAll(Class\<T> type)                                           |
+| 清空数据库                      | void purgeDatabase()                                                             |
+| 更新节点                        | void session.save(T newObject)                                                   |
+| 根据 id 查询单个节点            | T load(Class<T> type, ID id)                                                     |
+| 根据 ids 查询多个节点           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| 根据 label 查询全部节点         | Collection\<T> loadAll(Class\<T> type)                                           |
+| 条件查询                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher 查询（指定返回结果类型） | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher 查询                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.编译 TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.使用 TuGraph-OGM
+
+详细示例请参考 demo 文件夹下的 TuGraphOGMDemo ###在`pom.xml`中引入依赖
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // 构建Movie节点
+    @Id
+    private Long id;      // Movie节点的id
+    private String title; // title属性
+    private int released; // released属性
+
+    // 构建边ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // 构建Actor节点
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// 配置
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//启动driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// 开启session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.通过OGM进行增删改查
+
+```java
+// 增
+Movie jokes = new Movie("Jokes", 1990);  // 新建Movie节点jokes
+session.save(jokes);                     // 将jokes存储在TuGraph中
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // 将speed节点与alice节点通过ACTS_IN进行连接
+session.save(speed);                    // 存储两个节点与一条边
+
+// 删
+session.delete(alice);                  // 删除alice节点以及相连的边
+Movie m = session.load(Movie.class, jokes.getId());   // 根据jokes节点的id获取jokes节点
+session.delete(m);                                    // 删除jokes节点
+
+// 改
+speed.setReleased(2018);
+session.save(speed);                   // 更新speed节点属性
+
+// 查
+Collection<Movie> movies = session.loadAll(Movie.class);  // 获取所有Movie节点
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // 查询所有小于1995年发布的电影
+
+// 调用Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // 查询Speed为2018的Movie
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // 创建节点Label Director
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // 创建边Label DIRECT
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // 获取create结果
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // 查看创建节点数目
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //查看创建边数目
+
+// 清空数据库
+session.deleteAll(Movie.class);        // 删除所有Movie节点
+session.purgeDatabase();               // 删除全部数据
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..c00f3f0120
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,72 @@
+# Bolt客户端
+
+TuGraph目前兼容了Neo4j的Bolt协议，可以直接使用Neo4j的客户端访问TuGraph。
+
+## 开启Bolt端口
+
+Bolt端口是默认开启的，默认端口是7687。如果需要修改端口，请在配置文件中自行修改。基于docker方式部署的服务，配置文件在容器内 `/usr/local/etc/lgraph.json`文件中；如果是用rpm包部署的服务，配置文件在服务器的`/usr/local/etc/lgraph.json`。 修改端口后为了使端口生效，需要重启服务，重启服务的具体操作可见[数据库运行](../../5.installation&running/7.tugraph-running.md)。另外，配置文件中的详细配置项，可见[数据库运行](../../5.installation&running/7.tugraph-running.md)中的服务配置章节。
+
+## 使用示例
+
+添加Maven依赖
+
+```xml
+<dependency>
+    <groupId>org.neo4j.driver</groupId>
+    <artifactId>neo4j-java-driver</artifactId>
+    <version>4.4.2</version>
+</dependency>
+```
+Client按照如下格式进行实例化:
+
+```java
+    Driver driver = GraphDatabase.driver("bolt://ip:port", AuthTokens.basic("admin", "73@TuGraph"));
+```
+
+常用语句
+
+```java
+        //通过 driver 对象创建一个 Session，设置会话连接到特定的数据库，用于执行Cypher语句
+        Session session = driver.session(SessionConfig.forDatabase("default"));
+        //清空图项目，请不要轻易尝试，它会清空你选中的图项目的模型以及数据
+        session.run("CALL db.dropDB()");
+        //创建点模型
+        session.run("CALL db.createVertexLabel('person', 'id' , 'id' ,INT32, false, 'name' ,STRING, false)");
+        //创建边模型
+        session.run("CALL db.createEdgeLabel('is_friend','[[\"person\",\"person\"]]')");
+        //创建索引
+        session.run("CALL db.addIndex(\"person\", \"name\", false)");
+        //插入点数据
+        session.run("create (n1:person {name:'jack',id:1}), (n2:person {name:'lucy',id:2})");
+        //插入边数据
+        session.run("match (n1:person {id:1}), (n2:person {id:2}) create (n1)-[r:is_friend]->(n2)");
+        //查询点和边
+        Result res = session.run("match (n)-[r]->(m) return n,r,m");
+        //Parameterized Query
+        String cypherQuery = "MATCH (n1:person {id:$id})-[r]-(n2:person {name:$name}) RETURN n1, r, n2";
+        Result result1 = session.run(cypherQuery, parameters("id", 1, "name", "lucy"));
+        while (result1.hasNext()) {
+        Record record = result1.next();
+        System.out.println("n1: " + record.get("n1").asMap());
+        System.out.println("r: " + record.get("r").asMap());
+        System.out.println("n2: " + record.get("n2").asMap());
+                }
+        //删除点数据
+        session.run("match (n1:person {id:1}) delete n1");
+        //删除边数据
+        session.run("match (n1:person {id:1})-[r]-(n2:person{id:2}) delete r");
+        //删除边模型
+        session.run("CALL db.deleteLabel('edge', 'is_friend')");
+        //删除点模型
+        session.run("CALL db.deleteLabel('vertex', 'person')");
+```
+
+详细Cypher和存储过程的使用可见[Cypher](../../8.query/1.cypher.md)
+
+## Neo4j客户端使用限制
+
+目前，我们的系统尚未全面兼容Neo4j Bolt协议的所有高级特性。特别地，对于Neo4j客户端所具备的即时事务处理功能及弱schema灵活性这两项独特能力，当前尚不提供支持。因此，在采用客户端进行操作时，请务必留意规避涉及此类特性的操作，以确保应用的顺畅运行与数据的一致性。
+
+## 客户端示例
+
+在代码目录中的demo/Bolt下面有Golang、Java、JavaScript、Python、Rust 这几个语言的的例子。想要了解更多可见[客户端示例](https://github.com/TuGraph-family/tugraph-db/tree/master/demo)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..bd3ff0f0ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,102 @@
+# TuGraph console client
+
+`lgraph_cli` 是基于bolt协议的 console client，c++编写，使用时需要连接tugraph的bolt端口。
+
+`lgraph_cli` 是一个二进制的可执行文件，不依赖其他动态库，拷贝到一台linux机器上就可执行。
+
+## `lgraph_cli`使用
+
+语句以分号结束，输入`exit`, `quit`或者Ctrl-C退出客户端。
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+语句可以中间换行，多行输入。
+
+```powershell
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+非交互式
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+从文件读取多条命令
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## 在线数据导出
+
+lgraph_cli 支持流式读取，导出数据只需要把lgraph_cli的输出重定向到文件中即可，导出格式支持csv和json。
+
+### csv格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..beb44d41aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,340 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+## 2.请求与响应格式
+TuGraph HTTP Server 接收json格式的请求，经过鉴权后开始提取请求中的字段，根据定义好的接口逻辑处理请求，并返回json格式的响应。
+
+### 2.1.标准响应格式
+每一个响应都以标准响应格式返回，格式如下：
+
+| body参数  | 参数说明         | 参数类型        | 是否必填       |
+| ------- |--------------|-------------|------------|
+| errorCode   | 业务级错误码       | int类型       | 是          |
+| success   | 请求是否成功       | int类型       | 是          |
+| errorMessage   | 业务级错误信息      | 字符串类型       | 是          |
+| data   | 请求成功时返回的响应信息 | json字符串     | 是          |
+
+### 2.2请求类型
+
+#### 2.2.1. 用户登陆
+用户在登陆请求中携带用户名和密码发送到服务端。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，在后续的请求中将令牌加入请求头的Authorization域中。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| userName   | 用户名  | 字符串类型   | 是          |
+| password   | 用户密码 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+| default_password  | 默认密码 | 布尔类型 | 是          |
+
+**Example request.**
+
+```
+    {"userName" : "test", "password" : "123456"}
+```
+
+#### 2.2.2. 用户登出
+用户登出，同时删除已经认证的token，用户后续发送请求时，需要重新登陆，并获取新的token。
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+如果成功，返回的响应信息中success为00，data为空
+
+#### 2.2.3. 身份刷新
+已下发的token失效后，需要调用本接口重新认证。后端验证token合法性。token在初次登录后，1小时内有效，过期需要刷新
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口时返回的token，body中没有参数
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数  | 参数说明 | 参数类型  | 是否必填       |
+| ------- |------|-------|------------|
+| authorization   | 令牌  | 字符串类型   | 是          |
+
+#### 2.2.4. 调用cypher
+用户对TuGraph的增删改查请求需要调用cypher接口，并通过标准的cypher查询语言发起
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明     | 参数类型  | 是否必填       |
+| ------- |----------|-------|------------|
+| graph   | 查询的子图名称  | 字符串类型   | 是          |
+| script   | cypher语句 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含查询结果
+
+| body参数  | 参数说明 | 参数类型    | 是否必填       |
+| ------- |------|---------|------------|
+| result   | 查询结果 | json字符串 | 是          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
+
+#### 2.2.5. 上传文件
+接口用于将本地文件上传至TuGraph所在机器。可以上传文本文件，二进制文件，可以上传大文件，也可以上传小文件，对于大文件，客户端在上传时应该对文件做切分，每个文件分片不大于1MB，参数Begin-Pos和Size对应本次分片在完整文件中的偏移量与分片大小。参数需要放在http请求的报文头，请求内容对应文件分片内容。本接口请求头不止有token参数
+
+- **URI**:     /upload_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header参数  | 参数说明        | 参数类型             | 是否必填       |
+| ------- |-------------|------------------|------------|
+| File-Name   | 文件名称        | 字符串类型            | 是          |
+| Begin-Pos   | 开始位置在文件内的偏移 | 可以转成size_t类型的字符串 | 是          |
+| Size   | 本次请求文件分片大小    | 可以转成size_t类型的字符串 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+#### 2.2.6. 检查文件
+本接口用于检查已上传文件正确性，如果成功通过检查，再次上传同一文件时，直接返回成功
+
+- **URI**:     /check_file
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明           | 参数类型          | 是否必填        |
+| ------- |----------------|---------------|-------------|
+| fileName   | 文件名称           | 字符串类型         | 是           |
+| checkSum   | 文件对应md5值       | 可以转成int类型的字符串 | flag为"1"时必填 |
+| fileSize   | 文件长度(以字节计算)    | 可以转成int类型的字符串  | flag为"2"时必填 |
+| flag   | 标记位，flag为1时校验md5。flag为2时校验文件长度 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| pass   | 检查成功为true，否则为false | bool类型 | 是          |
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "checkSum" : "$MD5", "flag" : “1”}
+```
+
+#### 2.2.7. 清理缓存文件
+admin用户可以删除所有用户上传的文件，其他用户可以删除自己的上传的文件，可以删除指定名称的文件，指定用户上传的文件，也可以删除所有文件
+
+- **URI**:     /clear_cache
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明        | 参数类型          | 是否必填        |
+| ------- |-------------|---------------|-------------|
+| fileName   | 文件名称        | 字符串类型         | flag为"0"时必填 |
+| userName   | 用户名称        | 字符串类型 | flag为"1"时必填 |
+| flag   | 标记位，flag为0时删除fileName指定文件, flag为1时删除userName指定用户已经上传的所有文件，flag为2时删除所有用户上传的文件 | 可以转成int类型的字符串         | 是           |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{"fileName" : "test.csv", "userName" : "test", "flag" : “1”}
+```
+
+#### 2.2.8. 导入schema
+本接口可以根据用户指定的schema信息创建schema模型，schema的详细格式信息请参考data-import.md
+
+- **URI**:     /import_schema
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明       | 参数类型          | 是否必填        |
+| ------- |------------|---------------|-------------|
+| graph   | 子图名称       | 字符串         | 是           |
+| description   | schema描述信息 | json字符串 | 是 |
+
+- **RESPONSE**:
+  如果成功，返回中success为00
+
+**Example request.**
+
+```
+{
+	"graph": "test_graph",
+	"description": {
+		"schema": [{
+			"label": "Person",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}, {
+				"name": "birthyear",
+				"type": "INT16",
+				"optional": true
+			}, {
+				"name": "phone",
+				"type": "INT16",
+				"unique": true,
+				"index": true
+			}]
+		}, {
+			"label": "City",
+			"type": "VERTEX",
+			"primary": "name",
+			"properties": [{
+				"name": "name",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "Film",
+			"type": "VERTEX",
+			"primary": "title",
+			"properties": [{
+				"name": "title",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "HAS_CHILD",
+			"type": "EDGE"
+		}, {
+			"label": "MARRIED",
+			"type": "EDGE"
+		}, {
+			"label": "BORN_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "weight",
+				"type": "FLOAT",
+				"optional": true
+			}]
+		}, {
+			"label": "DIRECTED",
+			"type": "EDGE"
+		}, {
+			"label": "WROTE_MUSIC_FOR",
+			"type": "EDGE"
+		}, {
+			"label": "ACTED_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "charactername",
+				"type": "STRING"
+			}]
+		}, {
+			"label": "PLAY_IN",
+			"type": "EDGE",
+			"properties": [{
+				"name": "role",
+				"type": "STRING",
+				"optional": true
+			}],
+			"constraints": [
+				["Person", "Film"]
+			]
+		}]
+	}
+}
+```
+
+#### 2.2.9. 导入数据
+本接口允许用户指定已经通过上传，校验的文件作为数据文件，按照schema参数描述的配置信息，导入到graph参数指定的子图中。导入过程是异步的，server在接收到导入请求后，返回一个任务id
+
+- **URI**:     /import_data
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明  | 参数类型    | 是否必填 |
+| ------- |-------|---------|----|
+| graph   | 子图名称  | 字符串类型   | 是  |
+| schema   | 导入schema描述 | json字符串 | 是  |
+| delimiter   | 分隔符   | 字符串类型   | 是  |
+| continueOnError   | 单行数据出错是否跳过错误并继续 | boolean类型 | 否  |
+| skipPackages   | 跳过的包个数 | 可以转成int类型的字符串 | 否  |
+| taskId   | 任务id，用于重启出错的任务 | 字符串类型 | 否 |
+| flag   | 标记位，flag为1时导入成功将删除数据文件 | 可以转成int类型的字符串 | 否 |
+| other   | 其他参数 | 可以转成int类型的字符串 | 否  |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明 | 参数类型   | 是否必填       |
+| ------- |------|--------|------------|
+| taskId   | 任务编号 | 字符串类型 | 是          |
+
+**Example request.**
+
+```
+{
+   "graph": "default",         //导入的子图名称
+   "delimiter": ",",						//数据分隔符
+   "continueOnError": true,		//遇到错误时是否跳过错误数据并继续导入
+   "skipPackages": “0”,					//跳过的包个数
+   "flag" : "1",
+	 "schema": {
+		"files": [{
+			"DST_ID": "Film",				//终点label类型
+			"SRC_ID": "Person",			//起点label类型
+			"columns": [						//数据格式说明
+				"SRC_ID",							//起点id
+				"DST_ID",							//终点id
+                "SKIP",								//表示跳过此列数据
+				"charactername"				//属性名称
+			],
+			"format": "CSV",				//数据文件格式类型,支持csv和json
+			"path": "acted_in.csv",	//数据文件名称
+			"header": 0, 						//数据从第几行开始
+			"label": "ACTED_IN"			//边的类型
+		}]
+	}
+}
+```
+
+#### 2.2.10. 导入进度查询
+本接口用于查询导入任务的执行进度
+
+- **URI**:     /import_progress
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数  | 参数说明                 | 参数类型    | 是否必填 |
+| ------- |----------------------|---------|----|
+| taskId   | import_data接口返回的任务id | 字符串类型 | 是 |
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00
+
+| body参数  | 参数说明    | 参数类型             | 是否必填    |
+| ------- |---------|------------------|---------|
+| success   | 	是否成功导入 | boolean类型        | 是       |
+| reason   | 	导入失败原因 | 字符串类型            | success为false时必填 |
+| progress   | 	当前导入进度 | 可以转成double类型的字符串 | 是       |
+
+**Example request.**
+
+```
+{"taskId" : "$taskId"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..21ad033477
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,273 @@
+# RPC API
+
+> 此文档主要介绍 TuGraph 的 RPC API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供丰富的 RPC API，以供开发者通过 RPC 请求远程调用 TuGraph 提供的服务。
+
+RPC（远程过程调用）是一种通过网络从远程计算机程序上请求服务，而不需要了解底层网络技术的协议。
+相比REST，RPC 面向方法，主要用于函数方法的调用，可以适合更复杂通信需求的场景，且性能更高。
+brpc是用c++语言编写的工业级RPC框架，基于brpc，TuGraph 提供了丰富的RPC API，本文档描述
+TuGraph 的 RPC API 使用方式。
+
+## 2.请求
+
+### 2.1.建立连接
+
+开发者向TuGraph服务发送RPC请求，首先要建立连接。以C++语言为例，开发者创建指定url的通道（channel），
+由通道创建指定的服务存根（LGraphRPCService_Stub），后续即可通过存根像调用本地方法一样向远程
+服务器发送请求。
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.请求类型
+
+TuGraph支持10种RPC请求，其中每种请求的功能如下表所示：
+
+| 请求              | 功能         |
+|-----------------|------------|
+| GraphApiRequest | 点边索引操作请求   |
+| CypherRequest   | cypher请求   |
+| PluginRequest   | 存储过程请求     |
+| HARequest       | 高可用模式请求    |
+| ImportRequest   | 数据导入请求     |
+| GraphRequest    | 子图操作请求     |
+| AclRequest      | 权限管理请求     |
+| ConfigRequest   | 配置管理请求     |
+| RestoreRequest  | 备份请求       |
+| SchemaRequest   | schema管理请求 |
+
+用户发送请求时，需要传入以下参数：
+- client_version: 可选参数，HA模式下可通过对比`client_version`和`server_version`防止响应过时的请求
+- token: 必要参数，客户端登陆之后获得token，每次请求传入token以校验用户身份
+- is_write_op: 可选参数，标志请求是否是写请求
+- user: 可选参数，HA模式下主从之间同步请求时设置user，不需验证token
+
+服务处理完RPC请求之后发回响应，响应消息中除了包含每个请求的单独响应信息之外，还包含以下参数：
+- error_code: 必要参数，标志请求处理状态
+- redirect: 可选参数，HA模式下向follower发送写请求时处理失败，设置redirect为请求转发地址，即leader地址
+- error: 可选参数，请求错误信息
+- server_version: 可选参数，HA模式的请求响应中设置`server_version`以避免client读取数据时发生反向时间旅行问题
+
+:warning:  **除CypherRequest、PluginRequest、HARequest和AclRequest外，其余RPC接口将逐步废弃，其功能统一至CypherRequest接口。**
+
+## 3.登录
+
+登录请求信息包含以下参数：
+- user: 必要参数，用户名
+- pass: 必要参数，密码
+以C++为例，用户使用构建好的服务存根发送登录请求：
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+登录响应信息包含以下参数：
+- token: 必要参数，登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。
+如果登录失败会收到“Authentication failed”错误。
+
+## 4.查询
+用户可以通过Cypher查询和TuGraph进行绝大多数的交互，Cypher请求信息包含以下参数：
+- query: 必要参数，Cypher查询语句
+- param_names: 可选参数，参数名
+- param_values: 可选参数，参数值
+- result_in_json_format: 必要参数，查询结果是否以JSON格式返回
+- graph: 可选参数，Cypher语句执行的子图名称
+- timeout: 可选参数，Cypher语句执行的超时时间
+
+以C++为例，用户发送Cypher请求的方式如下所示：
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+Cypher请求响应为以下两个参数之一：
+- json_result: JSON格式的cypher查询结果
+- binary_result: CypherResult格式的cypher查询结果
+
+## 5.存储过程
+为满足用户较为复杂的查询/更新逻辑，TuGraph支持 C 语言和 Python 语言编写的存储过程。
+用户可以使用RPC请求对存储过程进行增删改查操作。
+
+### 5.1.加载存储过程
+加载存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- read_only: 必要参数，是否只读
+- code: 必要参数，存储过程文件读入生成的ByteString
+- desc: 可选参数，存储过程描述
+- code_type: 可选参数，存储过程代码类型，PY、SO、CPP、ZIP四者之一
+
+以C++为例，用户加载存储过程的方式如下所示：
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+加载存储过程的响应不包含参数，如果加载失败则抛出BadInput异常
+
+### 5.2.调用存储过程
+
+调用存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- param: 必要参数，存储过程参数
+- result_in_json_format: 可选参数，调用结果是否以JSON格式返回
+- in_process: 可选参数，未来支持
+- timeout: 可选参数，调用存储过程的超时时间
+
+以C++为例，用户调用存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+调用存储过程的响应为以下两个参数之一：
+- reply: ByteString格式的存储过程调用结果
+- json_result: JSON格式的存储过程调用结果
+
+### 5.3.删除存储过程
+
+删除存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+
+以C++为例，用户删除存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+删除存储过程的响应不包含参数，如果删除失败则抛出BadInput异常
+
+### 5.4.列举存储过程
+
+列举存储过程请求不需要参数，以C++为例，用户列举存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+列举存储过程的响应的参数如下所示：
+- reply: JSON格式的procedure列表
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..1928d70f07
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2918 @@
+# RESTful API Legacy
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+**注意：除"登陆"、"查询"和"存储过程"外，其余接口自 **2023年4月30日** 起将不再提供支持，统一使用Cypher接口提供服务。**
+
+## 2.请求与数据格式
+
+### 2.1请求
+
+TuGraph 支持 HTTP GET/POST/PUT/DELETE 请求。其中：
+
+- GET 请求用于只读请求，如读取点属性，边属性等操作；
+- POST 请求用于创建实体，提交 Cypher，以及加载和调用存储过程；
+- PUT 请求用于修改已有实体，如修改点属性，边属性等；
+- DELETE 请求用于删除已有实体，如删除点，边等。
+
+在高可用模式下，用户可以在请求的报头(request header)中设置 `server_version` 来保证请求的服务器有足够新的数据。
+当前的 `server_version` 可以从服务器返回的报头中获取。
+
+### 2.2.数据格式
+
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.3.返回值
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 307 Temporary Redirect: 操作被重定向，一般用于高可用模式下，把操作重定向到 master 上
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 500 Internal Server Error: 服务器端错误
+
+当操作成功时，返回的 JSON 中包含操作的返回值。当操作重定向时，返回的 HTTP 报头中的 `location` 域包含重定向目的地址。
+当发生输入错误或者服务器错误时，返回的 JSON 中包含 `error_message` 域，其内容是错误提示。
+
+在高可用模式下，服务器还会在报头中设置 `server_version`，以告知客户端当前服务器的数据版本号。当客户端在不同的服务器之间切换时，该数据版本号可以保证客户端不会读到错误的历史数据。
+
+### 2.4.URI格式
+
+TuGraph REST API 提供以下功能：Service Root, login, info, label, index, node, relationship, cypher, cpp_plugin, 以及 python_plugin。
+各功能使用的 URI 格式如下：
+
+| URI     | 说明                 |
+| ------- | -------------------- |
+| /web    | web 可视化界面       |
+| /cypher | cypher 请求          |
+| /acl    | 权限控制             |
+| /user   | 用户管理             |
+| /login  | 用户登录             |
+| /info   | 数据库状态及提示信息 |
+| /task   | 任务管理             |
+| /db     | 子图操作             |
+
+其中子图操作又分为：
+
+| URI                              | 说明                 |
+| -------------------------------- | -------------------- |
+| /db                              | 子图的创建，删除     |
+| /db/_{graph_name}_/node          | 点操作             |
+| /db/_{graph_name}_/relationship  | 边操作               |
+| /db/_{graph_name}_/label         | Label 相关操作       |
+| /db/_{graph_name}_/index         | 索引相关操作         |
+| /db/_{graph_name}_/cypher        | 子图相关 cypher 操作 |
+| /db/_{graph_name}_/cpp_plugin    | C++存储过程          |
+| /db/_{graph_name}_/python_plugin | Python 存储过程      |
+| /db/_{graph_name}_/import        | 在线导入             |
+| /db/_{graph_name}_/misc          | 其它操作             |
+
+## 3.登录
+
+TuGraph 提供基于 JWT 的用户认证方式，可以使用 HTTP 或 HTTPS 协议进行传输。系统默认使用 HTTP 协议，如果需要使用 HTTPS，需要在 lgraph.json 配置文件中将 ssl_auth 设为 1。
+
+### 3.1.登录
+
+用户通过用户名和密码发送登录请求。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，并且用于以后的每次发送请求。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**: `/login`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+  | default_password | 是否为默认密码 | 布尔值 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.身份刷新
+Token失效后，前端发起刷新token接口，后端验证token合法性。初次登录后，1小时内有效，需刷新使用。即使刷新，24小时后也会强制退出，需要重新登陆。
+验证通过，生成新的token；验证失败返回状态码401。
+
+- **URI**: `/refresh`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.修改Token有效期
+修改Token有效期，需要传输jwt，refresh_time和expire_time三个参数，其中jwt用于校验用户身份，refresh_time和expire_time等于0时，有效期为无期限，超过refresh_time时，需要调用refresh接口获取新的Token;超过expire_time时，需要重新登录。
+
+- **URI**: `/update_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+  | refresh_time | 有效时间（默认设置为0） | Int64 |
+  | expire_time | 有效时间（默认设置为0） | Int64 |
+
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0,
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.查询Token有效期
+查询Token有效期，需要传输jwt，用于校验用户身份，返回，refresh_time和expire_time，其中refresh_time表示刷新时间，超过时需要调用refresh接口获取新的Token;expire_time表示过期时间，超过时需要重新登录。
+- **URI**: `/get_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+
+- **RESPONSE**:  如果成功，返回"refresh_time"和"expire_time"。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+
+### 3.5.登出
+用户登出，同时删除token。
+
+- **URI**: `/logout`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/logout
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 4.查询
+
+URI 格式为
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.调用Cypher
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 列表 |
+  | elapsed | 运行时间（秒） | 浮点数 |
+  | header | 返回结果的表头 | 列表 |
+  | size | 结果数 | 整型 |
+
+其中 header 是一个列表，每一元素格式如下：
+
+| 域名 | 说明                                        | 类型   |
+| ---- | ------------------------------------------- | ------ |
+| name | 列名                                        | 字符串 |
+| type | 列数据类型，0 为标量，1 为点 id，2 为向量 |        |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.调用带参数的 Cypher
+
+Cypher 支持使用参数进行查询。当调用带参数的 Cypher 查询时，TuGraph 会缓存该查询的
+执行计划（execution plan），以加速后续同类查询的速度。
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+  | parameters | 参数 | 列表 |
+
+- **RESPONSE**:
+
+与 [调用 Cypher](#%E8%B0%83%E7%94%A8Cypher) 相同。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+
+## 5.存储过程
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.加载存储过程
+
+TuGraph 服务启动时，如果 load_plugins 为真，则会自动加载 plugin 目录下的所有 plugin。否则需要手动加载。此外，如果服务器运行过程中，管理员更新了 plugin 文件，也需要手动重新加载。重新加载 plugin 的调用格式为：
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 插件名称 | 字符串 |
+  | description | 插件说明 | 字符串 |
+  | code_base64 | 插件代码 | 字符串，使用 base64 编码 |
+  | read_only | 是否为只读存储过程 | 布尔值 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 5.2.列出所有存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程列表，其中每个元素是一个 plugin 的描述，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.获取存储过程的详细信息
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程信息，包括代码，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+  | code_base64 | 存储过程的代码 | 字符串，使用 base64 编码 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.调用存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: POST
+- **REQUEST**: 字符串输入
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | data | 输入数据 | 字符串 |
+  | timeout | 超时长度（秒，可选，缺省值为 0） | 浮点 |
+  | in_process | 是否在本进程调用（可选，缺省值为 false） | 布尔值 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.删除存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 6.Deprecated
+
+以下接口将在4/30/2023之后被删除。
+
+### 6.1.用户管理
+
+系统默认创建一个管理员，管理员用户名为 _admin_，密码为 _73@TuGraph_。为了安全起见，请用户在第一次启动服务器后更改密码。
+
+
+#### 6.1.1.添加用户
+
+添加一个新的用户，并为其设置初始密码。只有管理员有权限进行此操作。其中用户名只能由字母，数字以及下划线构成，密码则可以包含任意字符。用户名和密码长度不能超过 64 字节。添加用户时还可以为用户增加一个描述，用户描述可以包含任意字符，最长不超过 512 字节。
+
+新用户默认拥有同名的角色，不具备任何图的权限。
+
+- **URI**: `/user`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "description": "This is a user"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.列出所有用户
+
+列出数据库的所有用户。只有管理员拥有该操作权限。
+
+- **URI**: `/user/`
+- **METHOD**: GET
+- **RESPONSE**: 所有用户及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin admin user",
+        "roles": ["admin"]
+    },
+    "guest1": {
+        "disabled": true,
+        "description": "",
+        "roles": ["guest1", "some_other_role"]
+    }
+}
+```
+
+#### 6.1.3.获取用户信息
+
+列出给定用户的信息。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "A guest user"
+    "roles": ["guest1", "some_other_role"]
+}
+```
+
+#### 6.1.4.列出用户权限
+
+列出给定用户有权限访问的所有图及相应权限。
+
+- **URI**: `/user/{user_name}/graph`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1/graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "graph1" : "FULL",
+    "graph2" : "READ"
+}
+```
+
+#### 6.1.5.更改用户密码
+
+用户可以更改自己的密码，更改密码时需要同时提供原密码。管理员可以更改所有用户的密码。管理员更改其它用户密码时，可以不提供当前密码。
+
+- **URI**: `/user/{user_name}/password`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | current_password | 当前密码 | 字符串 |
+  | new_password | 新密码 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/password
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.6.修改用户描述
+
+用户可以修改自己的描述。管理员可以修改任意用户的描述。
+
+- **URI**: `/user/{user_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "New description for this user."
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.7.删除用户
+
+删除用户及其所有相关权限，只有管理员拥有该操作权限。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.8.禁用用户
+
+用户可以被禁用。被禁用的用户将不能登陆，但是其资料仍然保存。被禁用的用户可以被重新启用。
+
+- **URI**: `/user/{user_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.9.启用用户
+
+启用一个被禁用的用户。
+
+- **URI**: `/user/{user_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.10.设置用户角色
+
+为指定用户设置角色。只有管理员可以执行此操作。
+
+用户角色列表必须是“全量列表”，即该列表需要包含该用户需要的所有角色。唯一的例外是用户的同名角色，即使列表中不含该角色，它也会被加到用户角色中。
+
+- **URI**: `/user/{user_name}/role`
+- **METHOD**: POST
+- **REQUEST**: 角色列表
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+        ["role1", "role2"]
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+此时用户`guest1`拥有角色`guest1`, `role1`和`role2`。
+
+### 6.2.角色管理
+
+TuGraph 使用基于角色的权限管理。
+
+同一用户可以拥有多个角色。新用户默认拥有与其同名的角色。删除用户时，同名角色也会被删除。如果新建用户时同名角色已经存在，则创建失败。
+
+同一角色可以对多个图有不同的权限。用户对某张图的权限由其所有角色对该图的最高权限决定。
+
+TuGraph 使用四级权限，不用的用户对不同的子图可以有不同的权限，四种权限及其说明如下：
+
+| 权限  | 说明                                                                             |
+| ----- | -------------------------------------------------------------------------------- |
+| NONE  | 无权限                                                                           |
+| READ  | 只读                                                                             |
+| WRITE | 可读写子图中的点和边                                                           |
+| FULL  | 完全权限，包括更改元数据（label, index），管理存储过程，以及删除子图中的所有数据 |
+
+管理员对所有子图都有完全权限，新建的用户对所有子图都没有权限。将用户加入管理员角色中可以将用户提升为管理员。
+
+#### 6.2.1.添加角色
+
+添加一个新的角色，并设置其描述。只有管理员有权限进行此操作。
+
+角色名只能由字母，数字以及下划线构成，密码则可以包含任意字符。角色名长度不能超过 64 字节。
+
+角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | role | 角色名 | 字符串 |
+  | description | 角色描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "role": "new_role",
+        "description": "This is a new role.",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.2.修改角色描述
+
+修改角色的描述。只有管理员有权限进行此操作。角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role/{role_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 新描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "modified description"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.列出所有角色
+
+列出数据库的所有角色。只有管理员拥有该操作权限。
+
+- **URI**: `/role/`
+- **METHOD**: GET
+- **RESPONSE**: 所有角色及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin administrator group.",
+        "permissions": {"default":"FULL", "graph1":"FULL"}
+    },
+    "role1": {
+        "disabled": true,
+        "description": "Another role",
+        "permissions": {"default":"READ"}
+    }
+}
+```
+
+#### 6.2.4.获取角色信息
+
+列出给定角色的信息。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: GET
+- **RESPONSE**: 角色信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "Another role",
+    "permissions": {"default":"READ"}
+}
+```
+
+#### 6.2.5.删除角色
+
+删除指定角色，只有管理员拥有该操作权限。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.6.禁用角色
+
+角色可以被禁用。角色被禁用后，具有该角色的用户将不再从该角色中获得任何权限。只有管理员可以执行此操作。
+
+- **URI**: `/role/{role_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.7.启用角色
+
+启用一个被禁用的角色。
+
+- **URI**: `/role/{role_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.8.设置角色权限
+
+为指定角色设置权限。只有管理员可以执行此操作。
+
+角色权限列表必须是“全量列表”，即该列表需要包含该角色能操作的所有图及其权限。
+
+- **URI**: `/role/{role_name}/permissions`
+- **METHOD**: POST
+- **REQUEST**: 图名称及相应权限的字典。
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/permissions
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "graph1" : "FULL",
+        "graph2" : "READ"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.服务器状态
+
+#### 6.3.1.修改服务器配置
+
+修改服务器配置，配置修改后立即生效，并将影响所有服务器。这些配置的优先级高于配置文件以及命令行参数。
+
+- **URI**: `/config`
+- **METHOD**: PUT
+- **REQUEST**:
+
+请求为一个字典，使用 `{"opt1":v1}` 可以将名为`opt1`的配置修改为`v1`。
+
+| 配置名               | 说明                   | 值类型 |
+| -------------------- | ---------------------- | ------ |
+| OPT_DB_ASYNC         | 是否启用异步模式       | 布尔值 |
+| OPT_TXN_OPTIMISTIC   | 是否默认使用乐观事务锁 | 布尔值 |
+| OPT_AUDIT_LOG_ENABLE | 是否启用审计日志       | 布尔值 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "OPT_DB_ASYNC": true,
+        "OPT_AUDIT_LOG_ENABLE": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.当前服务器状态
+
+- **URI**: `/info`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | lgraph_version | 服务器版本号 | 字符串 |
+  | git_branch | 服务器代码分支 | 字符串 |
+  | git_commit | 服务器代码版本 | 字符串 |
+  | web_commit | 前端码版本 | 字符串 |
+  | cpp_id | CPP 编译器 ID | 字符串 |
+  | cpp_version | CPP 编译器版本 | 字符串 |
+  | python_version | PYTHON 版本 | 字符串 |
+  | node | 点 uri | 字符串 |
+  | relationship | 边 uri | 字符串 |
+  | cpu | cpu 信息 | 字典，格式参见[服务器 CPU 状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8CPU%E7%8A%B6%E6%80%81) |
+  | disk | 硬盘 IO 信息 | 字典，格式参见[服务器硬盘状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%A1%AC%E7%9B%98%E7%8A%B6%E6%80%81) |
+  | memory | 内存信息 | 字典，格式参见[服务器内存状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%86%85%E5%AD%98%E7%8A%B6%E6%80%81) |
+  | db_space | 图数据库占用空间 | 字典，格式参见[图数据库占用空间](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8D%A0%E7%94%A8%E7%A9%BA%E9%97%B4) |
+  | db_config | 图数据库配置信息 | 字典，格式参见[图数据库配置信息](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E9%85%8D%E7%BD%AE%E4%BF%A1%E6%81%AF) |
+  | up_time | 数据库在线时长（秒） | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.服务器 CPU 状态
+
+- **URI**: `/info/cpu`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序 CPU 使用率 | 整型 |
+  | server | 服务器 CPU 使用率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.服务器硬盘状态
+
+- **URI**: `/info/disk`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | read | 服务器硬盘读速率 | 整型 |
+  | write | 服务器硬盘写速率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.服务器内存状态
+
+- **URI**: `/info/memory`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序内存使用量 | 整型 |
+  | server_avail | 服务器可用内存 | 整型 |
+  | server_total | 服务器总内存 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.图数据库占用空间
+
+- **URI**: `/info/db_space`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | space | 图数据库占用空间 | 整型 |
+  | disk_avail | 图数据库可用空间 | 整型 |
+  | disk_total | 服务器硬盘总空间 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "disk_avail"::360074579968,
+      "disk_total"::984373800960,
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.图数据库配置信息
+
+- **URI**: `/info/db_config`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | db_async | 图数据库工作模式（同步或异步） | 布尔值 |
+  | disable_auth | 是否禁用身份验证 | 布尔值 |
+  | enable_ha | 是否启用高可用模式 | 布尔值 |
+  | enable_rpc | 是否启用 RPC 服务器 | 布尔值 |
+  | bind_host | REST 服务器的主机 | 字符串 |
+  | enable_audit_log | 是否启用日志审计 | 布尔值 |
+  | port | REST 服务器的端口 | 整型 |
+  | rpc_port | RPC 服务器的端口 | 整型 |
+  | optimistic_txn | 是否默认使用乐观事务锁 | 布尔值 |
+  | thread_limit | 图数据库应用程序的可用线程数 | 整型 |
+  | enable_ssl | 是否使用 SSL 进行身份验证 | 布尔值 |
+  | verbose | 输出的详细程度 | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "db_async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "bind_host":"127.0.0.1",
+      "enable_audit_log":false,
+      "port":7070,
+      "optimistic_txn":false,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "enable_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.8.高可用服务器列表
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/peers`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回一个服务器信息列表，其中每个服务器信息格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+  | state | 服务器状态 | 字符串 |
+
+其中服务器状态可为 `MASTER`,`SLAVE`,`OFFLINE`。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.9.当前 Leader 信息
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/leader`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前 leader 服务器信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.10.服务器统计信息
+
+- **URI**: `/info/statistics`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前服务器统计信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | requests/second | 每秒处理的请求数量 | 浮点型 |
+  | writes/second | 每秒处理的写请求数量 | 浮点型 |
+  | running_tasks | 正在执行的请求数量 | 整型 |
+  | failure_rate | 请求失败率 | 浮点型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 2.3,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.11.审计日志信息
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | begin_time | 查询日志的起始时间(必填，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | end_time | 查询日志的结束时间(默认为当前时间，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | user | 查询日志的操作者(管理员可查询所有用户的日志，普通用户只能查询本人日志) | 字符串 |
+  | num_log | 查询日志的数量(默认为 100) | 整型 |
+  | descending_order | 查询结果是否降序输出(默认为 true) | 布尔值 |
+
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回审计日志列表，其中每个元素是一条操作日志，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | index | 该操作的索引值 | 整型 |
+  | begin_time | 该操作的开始时间 | 字符串 |
+  | end_time | 该操作的结束时间 | 字符串 |
+  | user | 该操作的发起者 | 字符串 |
+  | graph | 该操作的图 | 字符串 |
+  | type | 该操作的类型 | 字符串 |
+  | read_write | 该操作为读操作或者写操作 | 字符串 |
+  | success | 该操作是否成功 | 布尔值 |
+  | content | 该操作的简要内容 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.任务管理
+
+TuGraph 提供长任务的跟踪和中止功能。用户可以通过 REST API 来查询当前正在运行的在 Cypher 和存储过程查询，并选择中止正在执行的查询。
+
+任务管理对应的 URI 格式为
+
+```
+    http://{host}:{port}/task/{thread_id}/{task_id}
+```
+
+#### 6.4.1.查询正在执行的任务
+
+- **URI**: `/task`
+- **METHOD**: GET
+- **RESPONSE**:
+
+返回的 JSON 为一个数组，其中每一个元素格式如下：
+
+| 域名         | 说明                         | 类型   |
+| ------------ | ---------------------------- | ------ |
+| description  | 任务描述                     | 字符串 |
+| time_elapsed | 任务已经执行的时间，单位为秒 | 浮点   |
+| task_id      | 任务 ID                      | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.中止任务
+
+- **URI**: `/task/{task_id}`
+  其中 `{task_id}` 是 `GET /task` 返回结果中的 `task_id`。
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.5.子图管理
+
+TuGraph 支持多子图，子图之间完全独立，不同的子图可以对不同用户开放不同权限。管理员可以添加和删除子图。
+
+#### 6.5.1.创建新子图
+
+- **URI**: `/db`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 子图名 | 字符串 |
+  | config | 配置 | 字典，格式为 { {列名 1}:{列值 1},... } |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1",
+        "config" : {
+            "max_size_GB":2048,
+            "description": "description of graph1"
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.删除子图
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.列出所有子图
+
+- **URI**: `/db`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_GB":1024,
+            "description":"description of graph1"
+        }
+    }
+```
+
+#### 6.5.4.获取子图信息
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "max_size_GB":1024,
+        "description":"description of graph1"
+    }
+```
+
+### 6.6.元数据管理
+
+TuGraph 是一个具备多图能力的强模式属性图数据库。在每一张子图中，每种点和边都需要有预定义的数据格式。数据格式由 Label 决定，每种 Label 都有自己的数据格式。用户可以使用 REST API 添加，删除和查询 Label 及其对应的数据格式。
+
+Label 操作对应的 URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+其中{type}可以是 node 或者 relationship。
+
+#### 6.6.1.创建Label
+
+创建 Label 的过程同时也是定义其数据类型的过程。只有创建了 Label 才能在图中插入相应类型的点或者边。
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | Label 名 | 字符串 |
+  | fields | 数据列定义 | 列表 |
+  | is_vertex | 是否是点 Label | 布尔值 |
+  | primary | 点的主键属性 | 字符串 |
+  | edge_constraints | 边的约束 | 列表 |
+
+`primary` 在 `is_vertex` 为 `true` 的时候设置，这个字段只有点才有, 创建点的时候必须设置。
+
+`edge_constraints` 在 `is_vertex` 为 `false` 的时候设置，这个字段只有边有。这个字段限制了该边的起点和终点只能是哪些点的组合，比如：`[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`，限制了该边只能是从 `vertex_label1` 到 `vertex_label2` 和 从 `vertex_label3` 到 `vertex_label4`。如果不想有任何限制，不设置该字段即可。
+
+其中`fields`为一个数组，其中每个元素定义数据的一列，内容如下：
+
+| 域名     | 说明                                     | 类型                                                                                                |
+| -------- | ---------------------------------------- | --------------------------------------------------------------------------------------------------- |
+| name     | 列名                                     | 字符串                                                                                              |
+| type     | 列数据类型                               | 字符串，有以下类型： int8, int16, int32, int64, float, double, string, date, datetime, binary, bool |
+| optional | 数据是否可以为空（可选，缺省值为 false） | 布尔值                                                                                              |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.列出所有 Label
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | edge | 边 Label 列表 | 列表 |
+  | vertex | 点 Label 列表 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.获取 Label 的数据格式定义
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+- **METHOD**: GET
+- **RESPONSE**: 数据列定义表，类型是一个词典，key 为列名，value 为列定义，列定义见如下：
+-
+
+| 域名     | 说明             | 类型   |
+| -------- | ---------------- | ------ |
+| optional | 该列值是否可为空 | 布尔值 |
+| type     | 列值类型         | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema 导入
+
+- **URI**: `/db/{graph_name}/schema/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+- **RESPONSE**:
+
+Schema 导入会根据 description 比较新的 Schema 和数据库中原有的 Schema 是否兼容，检查的粒度为 Label。如果不一致则出错，如果一致则添加原先 Schema 中不存在的 Label，返回 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串:
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.点操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+Nodes 提供节点（Vertex）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。
+
+#### 6.7.1.列出点数量和label数量
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | num_label | 点 label 数量 | 整数 |
+  | num_vertex | 点数量 | 整数 |
+
+_注意 num_vertex 返回的并不是准确的点数量，只是一个估计值。_
+
+#### 6.7.2.创建一个点
+
+向数据库中插入一个点。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 点属性 | 字典，其中 key 是列名，value 是相应值。value 必须是与列类型相应的类型，如列为 int32，则 value 只能是整数。 |
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新点 vid。该 ID 可用于后续的点操作中。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.批量创建点
+
+TuGraph 允许一次性插入多个点，以减少网络开销。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | fields | 点属性 | 列表 |
+  | values | 点数据 | 列表 |
+
+其中 fields 是一个字符串列表，列出一系列列名；values 是一个列表，其中每个元素是一个列表，列表中每个元素是列数据。
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新增加的点的 vid 列表，该列表中每一个 vid 按顺序对应请求中的每一个点。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.获取点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 属性 | 字典，格式为 { {列名 1}:{列值 1},...} |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.删除点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 被删掉的点的入边数量 | 整数值 |
+  | out | 被删掉的点的出边数量 | 整数值 |
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.获取点所有属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+- **METHOD**: GET
+- **RESPONSE**: Node 所有属性（字典）
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.获取点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: Node 某一属性
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.更新点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 点属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "********"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.8.边操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+与 Nodes 功能类似，Relationships 提供边（edge）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。每一条边都可以由一个唯一 ID（euid）来标识。这个 ID 可以从在插入边时获得，或者在 [列出所有边](#%E5%88%97%E5%87%BA%E6%89%80%E6%9C%89%E8%BE%B9) 操作中得到。
+
+#### 6.8.1.创建一条边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | destination | 目的点 ID | 整数值 |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid（字符串）。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.批量创建边
+
+- **URI**: `/db/{graph_name}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | fields | 数据列名 | 列表 |
+  | edge | 边数据 | 列表 |
+
+其中 edge 是一个数据列表，其中每个元素都是一条边，其定义如下：
+
+| 域名        | 说明     | 类型                                                   |
+| ----------- | -------- | ------------------------------------------------------ |
+| source      | 起点 id  | 整数                                                   |
+| destination | 终点 id  | 整数                                                   |
+| values      | 数据列表 | 列表，每列对应 fields 中的一个列，类型是该列对应的类型 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid 列表。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.列出所有出边（outgoing relationships）
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+- **METHOD**: GET
+- **RESPONSE**: 点 src 的所有出边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.列出所有入边（incoming relationships）
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+- **METHOD**: GET
+- **RESPONSE**: 点 dst 的所有入边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.列出所有边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 入边 | 列表 |
+  | out | 出边 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationships/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.获取边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | property | 边属性 | 字典 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.删除边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.获取边的所有属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+- **METHOD**: GET
+- **RESPONSE**: 边属性字典
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.获取边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功,返回代码 200,同时返回边的属性。如果失败,返回代码 400,同时返回 "Illegal field."。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.更新边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.9.索引
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+提供索引操作，接受 GET/POST 请求。
+
+#### 6.9.1.创建索引
+
+该操作会启动一个创建索引的后台任务，用户可以通过列出该 Label 相关的所有索引来检查新建索引的状态。
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: POST
+- **REQUEST**:
+
+| 域名    | 说明     | 类型                                  |
+|-------|--------|-------------------------------------|
+| label | Label 名 | 字符串                                 |
+| field | 域名     | 字符串                                 |
+| type  | 索引类型   | int类型，0表示非唯一索引，1表示全局唯一索引，2表示两点间唯一索引 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.列出所有索引
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.列出所有与某个 Label 相关的索引
+
+- **URI**: `/db/{graph_name}/index/{label}`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.删除索引
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.根据索引获取点
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+- **METHOD**: GET
+- **RESPONSE**: 点 vid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+### 6.10.在线增量导入
+
+#### 6.10.1.指定文件内容导入
+
+- **URI**: `/db/{graph_name}/import/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+  | data | 要导入的文件内容（建议最大在 16MB 左右，最长不超过 17MB） | 字符串 / 数组 / 对象 |
+  | continue_on_error | 出错后是否继续导入（可选，默认为`false`
+  ） | 布尔值 |
+  | delimiter | 分隔符（可选，默认为`“,”`
+  ） | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+分隔符可以是单字符，也可以是字符串，但不能包含`\r`或者`\n`。
+
+data 可以是如下形式之一：
+
+- 字符串如 `"1,2\n3,4\n"`
+- ASCII 码组成的数组如 `[49,44,50,10,51,44,52,10]`
+- 形如上述数组的字典如 `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+- **RESPONSE**:
+
+系统**不会**自动执行新建 label、添加索引等操作。在此操作之前需要保证涉及的 label 已经存在并具有适当的索引。
+
+如果成功导入完毕，返回代码 200，并在 `log` 字段返回一些日志信息（可能为空）；否则，保证所有的数据均未被导入，并在 `error_message` 字段返回错误信息。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true,
+      "delimiter": ","
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+由于请求中指定了在出错时继续，该返回信息说明 SRC_ID 为 1 的边没有被导入，而其他信息导入成功。
+
+### 6.11.其他
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.提取子图
+
+给出点 id 集合，返回包含该集合的最小子图。
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | vertex_ids | 点 id 集合 | 列表 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | nodes | 点数据 | 列表，每元素包含 vid, label, 以及属性 |
+  | relationships | 边数据 | 列表，每元素包含 src, dst, euid, label, 以及属性 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example response.**
+
+```
+• 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..f35f8d98d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+客户端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..0d4cd9d0de
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/8.query/1.cypher.md
@@ -0,0 +1,2351 @@
+# Cypher API
+
+> 此文档主要介绍了TuGraph-Cypher的详细使用说明
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators支持进度一览：
+
+| 类别                                 | 支持                                                                                                        | 待支持                             |
+| ------------------------------------ | ----------------------------------------------------------------------------------------------------------- | ---------------------------------- |
+| General operators                    | `DISTINCT`, `.` for property access                                                                     | `[]` for dynamic property access |
+| Mathematical operators               | `+`, `-`, `*`, `/`, `%`, `^`                                                                    |                                    |
+| Comparison operators                 | `=`, `<>`, `<`, `>`, `<=`, `>=`, `IS NULL`, `IS NOT NULL`                                   |                                    |
+| String-specific comparison operators | `STARTS WITH`, `ENDS WITH`, `CONTAINS`, `REGEXP`                                                    |                                    |
+| Boolean operators                    | `AND`, `OR`, `XOR`, `NOT`                                                                           |                                    |
+| String operators                     | `+` for concatenation                                                                                     |                                    |
+| List operators                       | `+` for concatenation, `IN` to check existence of an element in a list, `[]` for accessing element(s) |                                    |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+```
+MATCH (p:person) RETURN DISTINCT p.born
+```
+
+- ❏ Accessing properties of a nested literal map using the `.` operator
+
+```
+WITH {person: {name: 'Anne', age: 25}} AS p
+RETURN p.person.name
+```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+
+```
+CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+       (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+       (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+```
+
+```
+MATCH (restaurant:Restaurant), (category:Category)
+WHERE restaurant["rating_" + category.name] > 6
+RETURN DISTINCT restaurant.name
+```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator  `^`
+
+```
+WITH 2 AS number, 3 AS exponent
+RETURN number ^ exponent AS result
+```
+
+- ✓ Using the unary minus operator `-`
+
+```
+WITH -3 AS a, 4 AS b
+RETURN b - a AS result
+```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+
+```
+WITH 4 AS one, 3 AS two
+RETURN one > two AS result
+```
+ 
+### 1.5.String-specific comparison operators
+
+- ✓ Using STARTS WITH to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate STARTS WITH 'Jo'
+RETURN candidate
+```
+
+- ✓ Using REGEXP to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate REGEXP 'Jo.*n'
+RETURN candidate
+```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+```
+WITH [2, 4, 7, 9, 12] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number = 4 OR (number > 6 AND number < 10)
+RETURN number
+```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+
+```
+RETURN [1,2,3,4,5]+[6,7] AS myList
+```
+
+- ✓ Using IN to check if a number is in a list
+
+```
+WITH [2, 3, 4, 5] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number IN [2, 3, 8]
+RETURN number
+```
+
+- ✓ Accessing elements in a list using the [] operator
+
+```
+WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+RETURN names[1..3] AS result
+```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses支持进度一览：
+
+| 类别                    | 语法                                  | 备注   |
+| ----------------------- | ------------------------------------- | ------ |
+| Reading clauses         | MATCH                                 | 支持   |
+|                         | OPTIONAL MATCH                        | 支持   |
+|                         | MANDATORY MATCH                       | 待支持 |
+| Projecting clauses      | RETURN … [AS]                        | 支持   |
+|                         | WITH … [AS]                          | 支持   |
+|                         | UNWIND … [AS]                        | 支持   |
+| Reading sub-clauses     | WHERE                                 | 支持   |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | 支持   |
+|                         | SKIP                                  | 支持   |
+|                         | LIMIT                                 | 支持   |
+| Writing clauses         | CREATE                                | 支持   |
+|                         | DELETE                                | 支持   |
+|                         | DETACH DELETE                         | 支持   |
+|                         | SET                                   | 支持   |
+|                         | REMOVE                                | 支持   |
+| Reading/Writing clauses | MERGE                                 | 支持   |
+|                         | CALL […YIELD]                        | 支持   |
+| Set operations          | UNION                                 | 待支持 |
+|                         | UNION ALL                             | 支持   |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+
+  ```
+  MATCH (n)
+  RETURN n
+  ```
+
+  - ✓ Get all nodes with a label
+
+  ```
+  MATCH (movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Related nodes
+
+  ```
+  MATCH (person {name: 'Laurence Fishburne'})-[]-(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Match with labels
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]-(movie:movie)
+  RETURN movie.title
+  ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]->(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Directed relationships and variable
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[r]->(movie)
+  RETURN type(r)
+  ```
+
+  - ✓ Match on relationship type
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})<-[:acted_in]-(actor)
+  RETURN actor.name
+  ```
+
+  - ✓ Match on multiple relationship types
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[:acted_in|:directed]-(person)
+  RETURN person.name
+  ```
+
+  - ✓ Match on relationship type and use a variable
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[r:acted_in]-(actor)
+  RETURN r.role
+  ```
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+
+  ```
+  MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+  RETURN type(r)
+  ```
+
+  - ✓ Multiple relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in]->(movie)<-[:directed]-(director)
+  RETURN movie.title, director.name
+  ```
+
+  - ✓ Variable-length relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in*1..3]-(movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Relationship variable in variable-length relationships
+
+  ```
+  MATCH p = (laurence {name: 'Laurence Fishburne'})-[:acted_in*2]-(co_actor)
+  RETURN p
+  ```
+
+  - ❏ Match with properties on a variable-length path
+
+  ```
+  MATCH p = (charlie:person)-[* {blocked:false}]-(martin:person)
+  WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+  RETURN p
+  ```
+
+  - ✓ Zero-length paths
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})-[*0..1]-(x)
+  RETURN x
+  ```
+
+  - ✓ Named paths
+
+  ```
+  MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+  ```
+
+  - ✓ Matching on a bound relationship
+
+  ```
+  MATCH (a)-[r]->(b)
+  WHERE euid(r)="0_3937_0_0_0"
+  RETURN a,b
+  ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+  CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+  ```
+
+  - ✓ All shortest paths
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+  CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN nodeIds,relationshipIds,cost
+  ```
+- Get node or relationship by id
+
+  - ✓ Node by id
+
+  ```
+  MATCH (n)
+  WHERE id(n)= 0
+  RETURN n
+  ```
+
+  - ✓ Relationship by id
+
+  ```
+  MATCH ()-[r]->()
+  WHERE euid(r) = "0_3937_0_0_0"
+  RETURN r
+  ```
+
+  - ✓ Multiple nodes by id
+
+  ```
+  MATCH (n)
+  WHERE id(n) IN [0, 3, 5]
+  RETURN n
+  ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n
+```
+
+- ✓ Return relationships
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'})-[r:acted_in]->(c)
+RETURN r
+```
+
+- ✓ Return property
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n.born
+```
+
+- ❏ Return all elements
+
+```
+MATCH p = (a {name: 'A'})-[r]->(b)
+RETURN *
+```
+
+- ❏ Variable with uncommon characters
+
+```
+MATCH (`This isn\'t a common variable`)
+WHERE `This isn\'t a common variable`.name = 'A'
+RETURN `This isn\'t a common variable`.happy
+```
+
+- ✓ Aliasing a field
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born AS SomethingTotallyDifferent
+```
+
+- ✓ Optional properties
+
+```
+MATCH (n)
+RETURN n.age
+```
+
+- ❏ Other expressions
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born > 1900, "I'm a literal", (a)-[]->()
+```
+
+`(a)-[]->()`  not supported.
+
+- ✓ Unique results
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})-[]->(b)
+RETURN DISTINCT b
+```
+
+### 2.4.WHERE
+
+- Basic usage
+  - ✓ Boolean operations
+
+  ```
+  MATCH (n)
+  WHERE n.name = 'Laurence Fishburne' XOR (n.born > 1965 AND n.name = 'Carrie-Anne Moss')
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node label
+
+  ```
+  MATCH (n)
+  WHERE n:person
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node property
+
+  ```
+  MATCH (n)
+  WHERE n.born > 2000
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on relationship property
+
+  ```
+  MATCH (n)-[k:acted_in]->(f)
+  WHERE k.role = "Trinity"
+  RETURN f.title
+  ```
+
+  - ❏ Filter on dynamically-computed property
+
+  ```
+  WITH 'AGE' AS propname
+  MATCH (n)
+  WHERE n[toLower(propname)]< 30
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Property existence checking
+
+  ```
+  MATCH (n)
+  WHERE exists(n.born)
+  RETURN n.name, n.born
+  ```
+
+- String matching
+  - ✓ Match the beginning of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name STARTS WITH 'Pet'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match the ending of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name ENDS WITH 'ter'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match anywhere within a string
+
+  ```
+  MATCH (n)
+  WHERE n.name CONTAINS 'ete'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ String matching negation
+
+  ```
+  MATCH (n)
+  WHERE NOT n.name ENDS WITH 's'
+  RETURN n.name, n.born
+  ```
+
+- Using path patterns in `WHERE`
+  - ❏ Filter on patterns
+
+  ```
+  MATCH (tobias {name: 'Tobias'}), (others)
+  WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+  RETURN others.name, others.age
+  ```
+
+  - ❏ Filter on patterns using NOT
+
+  ```
+  MATCH (persons), (peter {name: 'Peter'})
+  WHERE NOT (persons)-[]->(peter)
+  RETURN persons.name, persons.age
+  ```
+
+  - ❏ Filter on patterns with properties
+
+  ```
+  MATCH (n)
+  WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Filter on relationship type
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name='Laurence Fishburne' AND type(r) STARTS WITH 'ac'
+  RETURN type(r), r.role
+  ```
+
+- Lists
+  - ✓ IN operator
+
+  ```
+  MATCH (a)
+  WHERE a.name IN ['Laurence Fishburne', 'Tobias']
+  RETURN a.name, a.born
+  ```
+
+- Missing properties and values
+  - ✓ Default to false if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white'
+  RETURN n.name, n.age, n.belt
+  ```
+
+  - ✓ Default to true if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+  ORDER BY n.name
+  ```
+
+  - ✓ Filter on null
+
+  ```
+  MATCH (person)
+  WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+  person.belt
+  ```
+
+- Using ranges
+  - ✓ Simple range
+
+  ```
+  MATCH (a)
+  WHERE a.name >= 'Peter'
+  RETURN a.name, a.born
+  ```
+
+  - ✓ Composite range
+
+  ```
+  MATCH (a)
+  WHERE a.name > 'Andres' AND a.name < 'Tobias'
+  RETURN a.name, a.born
+  ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 3
+```
+
+- ✓ Return middle two records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 1
+LIMIT 2
+```
+
+- ❏ Using an expression with SKIP to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP toInteger(3*rand())+ 1
+```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT 3
+```
+
+- ❏ Using an expression with LIMIT to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT toInteger(3 * rand())+ 1
+```
+
+### 2.7.CREATE
+
+- Create nodes
+
+> **Note**
+> TuGraph不支持创建空的nodes，不支持多labels。
+
+  - ☒ Create single node
+
+  ```
+  CREATE (n)
+  ```
+
+  - ☒ Create multiple nodes
+
+  ```
+  CREATE (n), (m)
+  ```
+
+  - ☒ Create a node with a label
+
+  ```
+  CREATE (n:person)
+  ```
+
+  - ☒ Create a node with multiple labels
+
+  ```
+  CREATE (n:Person:Swedish)
+  ```
+
+  - ✓ Create node and add labels and properties
+
+  ```
+  CREATE (n:person {id:2001, name: 'Andres'})
+  ```
+
+  - ✓ Return created node
+
+  ```
+  CREATE (n:person {id:2002, name: 'Andres'})
+  RETURN n
+  ```
+
+- Create relationships
+  - ✓ Create a relationship between two nodes
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:write]->(m)
+  ```
+
+  - ✓ Create a relationship and set properties
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:acted_in{role: 'Trinity'}]->(m)
+  ```
+
+  - ❏ Create a full path
+
+  ```
+  CREATE p = (andres:person {id: 2005, name:'Andres'})-[:acted_in {role: 'Trinity'}]->
+  (m:movie {id: 2006})<-[:acted_in {role: 'Trinity'}]-(michael {id: 2006, name:'Michael'})
+  RETURN p
+  ```
+
+- Use parameters with CREATE
+  - ❏ Create node with a parameter for the properties
+
+  ```
+  CREATE (n:Person $props)
+  RETURN n
+  ```
+
+  - ☒ Create multiple nodes with a parameter for their properties
+
+  ```
+  UNWIND $props AS map
+  CREATE (n)
+  SET n = map
+  ```
+  cannot create vertex without label.
+
+### 2.8.CALL[…YIELD]
+
+- ✓ Call a procedure using CALL
+
+```
+CALL db.vertexLabels
+```
+
+- ✓ View the signature for a procedure
+
+```
+CALL dbms.procedures() YIELD name, signature
+RETURN signature
+```
+
+- ❏ Call a procedure using a quoted namespace and name
+
+```
+CALL `db`.`vertexLabels`
+```
+
+- ✓ Call a procedure with literal arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+```
+
+- ❏ Call a procedure with parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+```
+
+- ❏ Call a procedure with mixed literal and parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+```
+
+- ✓ Call a procedure with literal and default arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+```
+
+- ✓ Call a procedure within a complex query using CALL…YIELD
+
+```
+CALL db.vertexLabels() YIELD label
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure and filter its results
+
+```
+CALL db.vertexLabels() YIELD label
+WHERE label CONTAINS 'User'
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure within a complex query and rename its outputs
+
+```
+CALL db.propertyKeys() YIELD propertyKey AS prop
+MATCH (n)
+WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+
+```
+MATCH (n:person)
+RETURN n.name AS name
+UNION ALL MATCH (n:movie)
+RETURN n.title AS name
+```
+
+- ❏ Combine two queries and remove duplicates
+
+```
+MATCH (n:Actor)
+RETURN n.name AS name
+UNION
+MATCH (n:Movie)
+RETURN n.title AS name
+```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| 种类                   | 功能               | 备注                      |
+| ---------------------- |------------------| ------------------------- |
+| Predicate functions    | exists()         |                           |
+|                        | all()            | 不支持                    |
+|                        | any()            | 不支持                    |
+|                        | single()         | 不支持                    |
+|                        | none()           | 不支持                    |
+| Scalar functions       | id()             |                           |
+|                        | euid()           |                           |
+|                        | properties()     |                           |
+|                        | head()           |                           |
+|                        | last()           |                           |
+|                        | toBoolean()      |                           |
+|                        | toFloat()        |                           |
+|                        | toInteger()      |                           |
+|                        | toString()       |                           |
+|                        | type()           |                           |
+|                        | startnode()      |                           |
+|                        | endnode()        |                           |
+|                        | size()           |                           |
+|                        | length()         |                           |
+|                        | substring()      |                           |
+|                        | concat()         |                           |
+|                        | label()          | OpenCypher扩展方法      |
+| Aggregating functions  | avg()            |                           |
+|                        | collect()        |                           |
+|                        | count()          |                           |
+|                        | max()            |                           |
+|                        | min()            |                           |
+|                        | percentileCont() |                           |
+|                        | percentileDisc() |                           |
+|                        | stDev()          |                           |
+|                        | stDevP()         |                           |
+|                        | variance()       |                           |
+|                        | varianceP()      |                           |
+|                        | sum()            |                           |
+| List functions         | keys()           |                           |
+|                        | labels()         | 返回结果有且只有一个label |
+|                        | nodes()          |                           |
+|                        | range()          |                           |
+|                        | subscript()      | 不支持                    |
+| Mathematical functions | abs()            |                           |
+|                        | ceil()           |                           |
+|                        | floor()          |                           |
+|                        | rand()           |                           |
+|                        | round()          |                           |
+|                        | sign()           |                           |
+| String functions       | /                |                           |
+
+### 3.2.Predicate functions
+
+- exists()
+  judge it whether a vertex or edge has the field  .
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+WHERE exists(n.born)
+RETURN n.name, n.born
+```
+
+**Example output:**
+
+| exists(name) |
+| ------------ |
+| true         |
+
+### 3.3.Scalar functions
+
+- id()
+  get the id of vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN id(a)
+```
+
+**Example output:**
+
+| vid |
+| --- |
+| 1   |
+| 2   |
+| ... |
+
+- properties()
+  get  a map containing all the properties of a node or relationship.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person {name: 'Laurence Fishburne'})
+RETURN n
+```
+
+- head()
+  get the first element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, head(coll)
+```
+
+**Example output:**
+
+| coll                  | head(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "one"         |
+
+- last()
+  get the last element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, last(coll)
+```
+
+**Example output:**
+
+| coll                  | last(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "three"       |
+
+- toFloat()
+  Converts an integer or string value to a floating point number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toFloat('11.5')
+```
+
+**Example output:**
+
+| float |
+| ----- |
+| 11.5  |
+
+- toInteger()
+  Converts a floating point or string value to an integer value.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toInteger('2.3') AS integer
+```
+
+**Example output:**
+
+| integer |
+| ------- |
+| 2       |
+
+- toString()
+  Converts an integer, float, boolean value to a string.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toString(2.3)
+```
+
+- type()
+  get the string representation of the relationship type.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)-[r]->()
+WHERE n.name = 'Laurence Fishburne'
+RETURN type(r)
+```
+
+**Example output:**
+
+| type     |
+| -------- |
+| acted_in |
+| acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+  Returns the average of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN avg(n.born)
+```
+
+**Example output:**
+
+| avg(n.born)        |
+| ------------------ |
+| 1869.2661654135338 |
+
+- collect()
+  Returns a list containing the values returned by an expression.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN collect(n.born)
+```
+
+**Example output:**
+
+| collect(n.born) |
+| --------------- |
+| [1967,...]      |
+
+- count()
+  Returns the number of values or records.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n {name: 'Laurence Fishburne'})-[]->(x)
+RETURN labels(n), n.born, count(*)
+```
+
+**Example output:**
+
+| labels(n)  | n.born | count(*) |
+| ---------- | ------ | -------- |
+| ["person"] | 1961   | 3        |
+
+- max()
+  Returns the maximum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN max(n.born)
+```
+
+**Example output:**
+
+| max(n.born) |
+| ----------- |
+| 2003        |
+
+- min()
+  Returns the minimum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN min(n.born)
+```
+
+**Example output:**
+
+| min(n.born) |
+| ----------- |
+| 1000        |
+
+- percentileCont()
+  Returns the percentile of a value over a group using linear interpolation.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileCont(n.born, 0.4)
+```
+
+**Example output:**
+
+| percentileCont(n.born, 0.4) |
+| --------------------------- |
+| 1953                        |
+
+- percentileDisc()
+  Returns the nearest value to the given percentile over a group using a rounding method.
+  **Scope:** whole instance.
+  **Output:** the percentile of the given value over a group.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileDisc(n.born, 0.5)
+```
+
+**Example output:**
+
+| percentileDisc(n.age, 0.5) |
+| -------------------------- |
+| 1959                       |
+
+- stDev()
+  Returns the standard deviation for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDev(n.born)
+```
+
+**Example output:**
+
+| stDev(n.born)      |
+| ------------------ |
+| 279.53117993401725 |
+
+- stDevP()
+  Returns the standard deviation for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDevP(n.born)
+```
+
+**Example output:**
+
+| stDevP(n.born)     |
+| ------------------ |
+| 279.3209270423399  |
+
+- variance()
+  Returns the variance for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN variance(n.born)
+```
+
+**Example output:**
+
+| variance(n.age)   |
+| ----------------- |
+| 78137.68055530392 |
+
+- varianceP()
+  Returns the variance for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN varianceP(n.born)
+```
+
+**Example output:**
+
+| varianceP(n.age)  |
+| ----------------- |
+| 78020.18028379219 |
+
+- sum()
+  Returns the sum of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN sum(n.born)
+```
+
+**Example output:**
+
+| sum(n.born) |
+| ----------- |
+| 1243062     |
+
+### 3.5.List Funtions:
+
+- keys()
+  get the field names of some vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN keys(a) LIMIT 1
+```
+
+**Example output:**
+
+| keys(a)               |
+| --------------------- |
+| ["name","age","eyes"] |
+
+- labels()/label()
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN labels(a) LIMIT 1
+```
+
+**Example output:**
+
+| labels                 |
+| ---------------------- |
+| ["Person"]             |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice"})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+
+### 3.6.Mathematical functions
+
+- abs()
+  get the absolute value of some data.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a:person {name: 'Laurence Fishburne'}),(e:person {name: 'Carrie-Anne Moss'})
+RETURN a.born, e.born, abs(a.born-e.born)
+```
+
+**Example output:**
+
+  | a.born | e.born | abs(a.born - e.born) |
+  |--------|--------|-----------------------|
+  | 1961   | 1967   | 6                     |
+
+- ceil()
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN ceil(0.1)
+```
+
+**Example output:**
+
+| ceil(0.1) |
+| --------- |
+| 1.0       |
+
+- floor()
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN floor(0.9)
+```
+
+**Example output:**
+
+| floor(0.9) |
+| ---------- |
+| 0.0        |
+
+- round()
+  Returns the value of a number rounded to the nearest integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN round(3.141592)
+```
+
+**Example output:**
+
+| round |
+| ----- |
+| 3     |
+
+- rand()
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN rand()
+```
+
+**Example output:**
+
+| rand()             |
+| ------------------ |
+| 0.9797131960534085 |
+
+- sign()
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN sign(-17), sign(0.1)
+```
+
+**Example output:**
+
+| sign(-17) | sign(0.1) |
+| --------- | --------- |
+| -1        | 1         |
+
+TuGraph 查询语言与 OpenCypher 的不同点如下：
+
+- Label 数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 4.附录1. 语法扩充及不同
+
+TuGraph查询语言与OpenCypher的不同点如下：
+
+- Label数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.附录2. 内置procedures列表
+### 5.1.procedures样例
+
+* dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                        | name         |
+  | ---------------------------------------------------- | -------------------- |
+  | db.vertexLabels() :: (label::STRING)               | db.vertexLabels        |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels |
+  | db.indexes() :: (index::LIST)            | db.indexes       |
+  | ...                          | ...          |
+
+* db.subgraph()
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | vids       | list           | list of vertex id                                                     |
+
+  **Output:**
+
+  Get a json containing all the properties of nodes and relationships.
+
+  **Example input:**
+
+  ```
+  CALL db.subgraph([3937,4126,4066,4010])
+  ```
+
+  **Example output**
+
+  | subgraph |
+  | -------- |
+  | {"nodes":[{"identity":3937,"label":"movie","properties":{"duration":136,"id":1,"poster_image":"http://image.tmdb.org/t/p/w185/gynBNzwyaHKtXqlEKKLioNkjKgN.jpg","rated":"R","summary":"Thomas A. Anderson is a man living two lives. By day he is an average computer programmer and by night a malevolent hacker known as Neo who finds himself targeted by the police when he is contacted by Morpheus a legendary computer hacker who reveals the shocking truth about our reality.","tagline":"Welcome to the Real World.","title":"The Matrix"}},{"identity":4010,"label":"user","properties":{"id":44,"login":"Howard"}},{"identity":4066,"label":"user","properties":{"id":202,"login":"Enoch"}},{"identity":4126,"label":"user","properties":{"id":464,"login":"Wilburn"}}],"relationships":[{"dst":4126,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4010,"temporal_id":0},{"dst":4010,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4066,"temporal_id":0},{"dst":4066,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4126,"temporal_id":0}]} |
+
+* db.vertexLabels()
+
+  Lists all available vertex labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+  **Example output:**
+
+    | label   |
+    | ------- |
+    | genre   |
+    | keyword |
+    | movie   |
+    | ...     |
+
+* db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edge labels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | relationshipType |
+  | ---------------- |
+  | acted_in     |
+  | directed     |
+  | ...          |
+
+* db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of  vertex label    |
+  | primary_field | string  | primary field of vertex label |
+  | field_spec | list       | specification of a field |
+
+   in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+    **Output:** If successful, it returns a success message.
+
+    **Example input:**
+
+    ```
+    CALL db.createVertexLabel('Person', 'id', 'id', int64, false, 'name', string, true)
+    ```
+
+    **Example output:**
+
+    ```
+    Added label [Person]
+    ```
+
+* db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description           |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field         |
+  | type       | string     | type of the field         |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name     | type   | optional |
+  | ------------ | ------ | -------- |
+  | id       | INT32  | false    |
+  | born     | INT32  | true     |
+  | name     | STRING | true     |
+  | poster_image | STRING | true     |
+
+* db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | extra      | string     | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.
+    for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id',int32,false], ['name',string, true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id',int32,false], ['name', string, true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+* db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:**
+
+  | field_name | field_type | description              |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description           |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string      | either 'vertex' or 'edge'     |
+  | label_name  | string      | name of the label         |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description           |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string     | either 'vertex' or 'edge' |
+  | label_name       | string     | name of the label     |
+  | field_value_spec | list       | specification of a field  |
+
+    in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, optional]`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+    ```
+    CALL db.alterLabelModFields(
+    'vertex',
+    'new_label',
+    ['birth_date', DATETIME, true],
+    ['gender', BOOL, true])
+    ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of the label    |
+  | edge_constraints | string | edge constraints |
+  | field_spec | list       | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for  optional fields.
+
+  `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', int32, true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+* db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+
+   **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+   **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+* db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+  | pair_unique | boolean    | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+* dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description      |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string     | the current password |
+  | new_password     | string     | new password     |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+   **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string     | the user's name |
+  | new_password | string     | new password    |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.createUser(user_name, password)
+
+  create  new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | -------------------------------- |
+  | user_name | string     | the new user name        |
+  | password  | string     | the password of new user     |
+  
+   **Output:**
+  
+    If successful, it returns a success message.
+  
+   **Example input:**
+  
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+  
+   **Example output:**
+  
+  ```
+  true
+  ```
+  
+* dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string     | the user name to be deleted |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+   a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string     | the user name           |
+  | is.admin  | boolean    | the permission of this user |
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       |  ...    |
+
+* dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+    a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description       |
+  | --------- | -------------- | --------------------- |
+  | user.user | string     | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+* dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+   a list of  ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host     |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...      |
+
+* dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+   the number of ip which been deleted.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+    the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description              |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string     | the name of new subgraph     |
+  | description | string     | description of new subgraph      |
+  | max_size_GB | integer    | Upper limit of subgraph capacity |
+
+   **Output:**
+
+    if successful , it will return true.
+
+   **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+   **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+  | config     | map        | the configuration to be modified     |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.listGraphs()
+
+  get all subgraphs in this graph database.
+
+  **Output:**
+
+    a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+
+* dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+    | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+* dbms.config.list()
+
+  get config of this graph database.
+
+  **Output:**
+
+    a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  |-----------| ---------|
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       |  ...    |
+
+* dbms.config.update(updates)
+
+  get some config of this graph database.
+
+  **Output:**
+
+    If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+    enable_ip_check:false,
+    durable:true,
+    optimistic_txn:true,
+    enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+* dbms.takeSnapshot()
+
+  take the  snapshot  on this current graph database.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+* dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path               |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+* algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                          |
+  | --------- | -------------- | ------------------------------------------------------------ |
+  | startNode | Node       | the source node of paths                     |
+  | endNode   | Node       | the destination node paths                   |
+  | config    | MAP        | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+    If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2     | 1     |
+
+* algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+* algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                        |
+  | --------- | -------------- | ---------------------------------------------------------- |
+  | id    | ANY        | the id of vertexes or edges , the id must be variable      |
+  | config    | MAP        | the configuration of  this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or  it is an edge id.
+
+  **Output:**
+
+    If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.内置procedures完整列表
+
+| Name                                  | Description                           | Signature                                                                                                                                                                               |
+|---------------------------------------|---------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.subgraph                           | 列出点的子图                                | db.subgraph(vids::LIST) :: (subgraph::STRING)                                                                                                                                           |
+| db.vertexLabels                       | 列出所有Vertex Label                      | db.vertexLabels() :: (label::STRING)                                                                                                                                                    |
+| db.edgeLabels                         | 列出所有Edge Label                        | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                 |
+| db.indexes                            | 列出所有索引                                | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                    |
+| db.listLabelIndexes                   | 列出所有与某个Label相关的索引                     | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                          |
+| db.warmup                             | 预热数据                                  | db.warmup() :: (time_used::STRING)                                                                                                                                                      |
+| db.createVertexLabel                  | 创建Vertex Label                        | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                  |
+| db.createLabel                        | 创建Vertex/Edge Label                   | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                             |
+| db.getLabelSchema                     | 列出label schema                        | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                               |
+| db.getVertexSchema                    | 列出点的 schema                           | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                      |
+| db.getEdgeSchema                      | 列出边的 schema                           | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                        |
+| db.deleteLabel                        | 删除Vertex/Edge Label                   | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                       |
+| db.alterLabelDelFields                | 修改label删除属性                           | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                            |
+| db.alterLabelAddFields                | 修改label添加field                        | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                 |
+| db.alterLabelModFields                | 修改label field                         | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                       |
+| db.createEdgeLabel                    | 创建Edge Label                          | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                     |
+| db.addIndex                           | 创建索引                                  | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                          |
+| db.addEdgeIndex                       | 创建索引                                  | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                 |
+| db.addVertexCompositeIndex            | 创建组合索引                                | db.addVertexCompositeIndex(label_name::STRING,field_names::LIST,unique::BOOLEAN) :: (::VOID)                                                                                            |
+| db.deleteIndex                        | 删除索引                                  | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                       |
+| db.deleteCompositeIndex               | 删除组合索引                                | db.deleteIndex(label_name::STRING,field_names::LIST) :: (::VOID)                                                                                                                        |
+| db.backup                             | 备份数据                                  | db.backup(destination::STRING) :: ()                                                                                                                                                    |
+| dbms.procedures                       | 列出所有procedures                        | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                   |
+| dbms.security.changePassword          | 更改当前用户的密码                             | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                 |
+| dbms.security.changeUserPassword      | 更改指定用户的密码                             | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.createUser              | 创建用户                                  | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                |
+| dbms.security.deleteUser              | 删除用户                                  | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.listUsers               | 列出所有用户                                | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                         |
+| dbms.security.showCurrentUser         | 列出当前用户信息                              | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                               |
+| dbms.security.getUserPermissions      | 列出指定用户的权限                             | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                 |
+| dbms.graph.createGraph                | 创建子图                                  | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                       |
+| dbms.graph.modGraph                   | 修改子图属性                                | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                         |
+| dbms.graph.deleteGraph                | 删除子图                                  | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.graph.listGraphs                 | 列出所有子图                                | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                      |
+| dbms.graph.getGraphInfo               | 列出指定子图的信息                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                    |
+| dbms.security.addAllowedHosts         | 添加ip到信任列表                             | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                        |
+| dbms.security.deleteAllowedHosts      | 从信任列表删除ip                             | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                             |
+| dbms.security.listAllowedHosts        | 列出信任列表中的主机ip                          | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                      |
+| dbms.config.update                    | 更新TuGraph配置                           | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                   |
+| dbms.config.list                      | 列出TuGraph配置                           | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                         |
+| algo.shortestPath                     | 查询两个点间的最短路径                           | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                   |
+| algo.allShortestPaths                 | 查询两个点间的所有最短路径                         | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                    |
+| algo.native.extract                   | 查询指定VertexId/EdgeUid（列表）指定field的值（列表） | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                |
+| db.flushDB                            | 刷新db                                  | db.flushDB() :: (::VOID)                                                                                                                                                                |
+| dbms.security.listRoles               | 列出所有角色                                | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                         |
+| dbms.security.createRole              | 创建角色                                  | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                    |
+| dbms.security.deleteRole              | 删除角色                                  | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.getRoleInfo             | 获取角色详细信息                              | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                             |
+| dbms.security.disableRole             | 禁用/启用角色                               | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.modRoleDesc             | 修改角色描述信息                              | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.rebuildRoleAccessLevel  | 删除角色权限并重建                             | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                        |
+| dbms.security.modRoleAccessLevel      | 修改角色对指定图的访问权限                         | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                            |
+| dbms.security.modRoleFieldAccessLevel | 修改角色对指定属性的访问权限                        | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                 |
+| dbms.security.getUserInfo             | 获取用户详细信息                              | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                             |
+| dbms.security.disableUser             | 禁用/启用用户                               | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.setCurrentDesc          | 设置当前用户描述信息                            | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                           |
+| dbms.security.setUserDesc             | 设置用户描述信息                              | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.getUserMemoryUsage      | 获取用户内存用量                              | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                               |
+| dbms.security.setUserMemoryLimit      | 设置用户内存限制                              | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                         |
+| dbms.security.deleteUserRoles         | 删除用户与角色的联系                            | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.rebuildUserRoles        | 清空用户角色的关系并重建                          | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                    |
+| dbms.security.addUserRoles            | 新增用户与角色的联系                            | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                        |
+| db.plugin.loadPlugin                  | 装载plugin                              | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN,version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | 删除plugin                              | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                             |
+| db.plugin.listPlugin                  | 列出已装载的plugin                          | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | 获取plugin的详细信息                         | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                          |
+| db.plugin.callPlugin                  | 执行plugin                              | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                    |
+| db.importor.dataImportor              | 导入点或边数据                               | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                             |
+| db.importor.schemaImportor            | 导入点或边schema                           | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                             |
+| db.addFullTextIndex                   | 添加全文索引                                | db.addFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                             |
+| db.deleteFullTextIndex                | 删除全文索引                                | db.deleteFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                          |
+| db.rebuildFullTextIndex               | 重建全文索引                                | db.rebuildFullTextIndex(vertex_labels::STRING, edge_labels::STRING) :: (::VOID)                                                                                                         |
+| db.fullTextIndexes                    | 查看全文索引                                | db.fullTextIndexes() :: (is_vertex::BOOLEAN, label::STRING, field::STRING)                                                                                                              |
+| dbms.meta.count                       | 查看点边总数                                | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                 |
+| dbms.meta.countDetail                 | 查看点边总数详情                              | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                       |
+| dbms.meta.refreshCount                | 重新统计点边数量，统计期间停写。                      | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                 |
+| dbms.task.listTasks                   | 查询正在执行的任务                             | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                    |
+| dbms.task.terminateTask               | 中止任务                                  | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                      |
+| dbms.ha.clusterInfo                   | HA模式下查看集群状态                           | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                       |
+| db.dropDB                             | 清空数据库                                 | db.dropDB() :: (::VOID)                                                                                                                                                                 |
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/8.query/2.gql.md
new file mode 100644
index 0000000000..a5234f46aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/8.query/2.gql.md
@@ -0,0 +1,388 @@
+# ISO GQL
+
+
+## 1.GQL简介
+Graph Query Language(GQL, 图查询语言)是一种国际标准语言，用于属性图查询，该语言建立在SQL的基础上，并整合了现有的[openCypher、PGQL、GSQL和G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/)语言的成熟思想。目前该标准仍然处于草稿阶段。
+
+TuGraph基于[ISO GQL (ISO/IEC 39075) Antlr4 语法文件](https://github.com/TuGraph-family/gql-grammar)实现了GQL，并做了一些扩展与改造。目前并未完全支持所有的GQL语法，我们会在未来逐步完善。
+
+## 2.Clauses
+
+| 类别                | 子句           |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+### 2.1.MATCH
+
+`MATCH`子句式是GQL最基础的子句，几乎所有查询都是通过 `MATCH`展开。
+
+`MATCH`子句用于指定在图中搜索的匹配模式，用来匹配满足一定条件的点或者路径。
+
+#### 点查询
+
+##### 查询所有点
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### 查询特定标签的点
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### 通过属性匹配点
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### 通过过滤条件匹配点
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 边查询
+
+##### 出边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### 入边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### 带过滤条件的边匹配
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+返回结果
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### 路径匹配
+
+##### 不定跳查询
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+`OPTIONAL MATCH`匹配图模式，如果未命中，则返回`null`。
+
+#### 查询命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### 查询未命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+返回结果
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+`RETURN`子句指定返回结果，包括返回点、边、路径、属性等。
+
+#### 返回点
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### 返回边
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### 返回属性
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 不常见字符串作为变量名
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### 列别名
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### 可选属性
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### 其它表达式
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### 结果唯一性
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+返回结果
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+`NEXT`子句用于连接多个子句。
+
+#### 连接MATCH
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE`子句用于过滤记录。
+
+#### 过滤点
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### 过滤边
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+返回结果
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### 布尔表达式
+
+`AND`, `OR`, `XOR`和 `NOT`布尔表达式可以用在 `WHERE`中用来过滤数据。
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+
+### 2.6.ORDER BY
+
+`ORDER BY`是`RETURN`的子句，对输出的结果进行排序。
+
+#### 对结果排序
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+返回结果
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP`指定结果偏移行数。
+
+#### 未使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### 使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+`LIMIT`限制结果行数。
+
+#### 使用LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/8.query/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/8.query/index.rst
new file mode 100644
index 0000000000..0571c71701
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/8.query/index.rst
@@ -0,0 +1,9 @@
+查询语言
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..1748f19794
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,349 @@
+# Procedure API
+
+> 此文档主要讲解 TuGraph 的存储过程使用说明
+
+## 1.简介
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个请求并在客户端完成整个处理流程的方式，TuGraph 提供的存储过程是更简洁和高效的选择。
+
+与传统数据库类似，TuGraph 的存储过程运行在服务器端，用户通过将处理逻辑（即多个操作）封装到一个过程单次调用，并且可以在实现时通过并行处理的方式（例如使用相关的 C++ OLAP 接口以及基于其实现的内置算法）进一步提升性能。
+
+存储过程中有一类特殊的API来进行数据的并行操作，我们叫 Traversal API，见[文档](2.traversal.md)。
+
+## 2.存储过程的版本支持
+
+目前TuGraph支持两个版本的存储过程，适用于不同的场景，v3.5版本只支持v1，可通过REST或RPC接口直接调用；从v3.5版本开始支持v2，能够在图查询语言（比如Cypher）中嵌入调用，我们称之为POG（Procedure On Graph query language，APOC）。
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+| 适用场景                 | 极致性能，或者复杂的多事务管理情形       | 一般情况，与Cypher高度联动 |
+| 事务                    | 函数内部创建，可自由控制多事务          | 外部传入函数，单一事务     |
+| 签名（参数定义）          | 无                                 | 有                    |
+| 输入输出参数类型          | 不需要指定                           | 需要指定参数类型        |
+| Cypher Standalone Call | 支持                                | 支持                  |
+| Cypher Embeded Call    | 不支持                              | 支持                  |
+| 语言                    | C++/Python/Rust                    | C++                  |
+| 调用模式                 | 直接传字符串，一般为JSON               | 通过Cypher语句中的变量  |
+
+在TuGraph中，存储过程v1和v2单独管理，支持增删查，但仍不建议重名。
+
+## 3.存储过程语言支持
+
+在 TuGraph 中，用户可以动态的加载，更新和删除存储过程。TuGraph 支持 C++ 语言、 Python 语言和 Rust 语言编写存储过程。在性能上 C++ 语言支持的最完整，性能最优。
+
+注意存储过程是在服务端编译执行的逻辑，和客户端的语言支持无关。
+
+## 4.Procedure v1接口
+
+## 4.1.编写存储过程
+
+### 4.1.1.编写C++存储过程
+
+用户可以通过使用 Procedure API 或者 Traversal API 来编写 C 存储过程。一个简单的 C 存储过程举例如下：
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## 统计所有年龄为10的学生数量
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+从代码中我们可以看到，存储过程的入口函数是`Process`函数，它的参数有三个，分别为：
+
+- `db`: 数据库实例
+- `request`: 输入请求数据，可以是二进制字节数组，或者 JSON 串等其它任意格式。
+- `response`: 输出数据，可以是字符串，也可以直接返回二进制数据。
+
+`Process`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误，此时用户可以通过`response`来返回错误信息以方便调试。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`age_10`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 age_10.so，然后用户就可以将它加载到服务器中了。
+
+### 4.1.2.编写Python存储过程
+
+与 C++类似，Python 存储过程也可以调用 core API，一个简单的例子如下：
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+Python 存储过程返回的是一个 tuple，其中第一个元素是一个布尔值，表示该存储过程是否成功执行；第二个元素是一个`str`，里面是需要返回的结果。
+
+Python 存储过程不需要编译，可以直接加载。
+
+## 4.2.如何使用存储过程
+### 4.2.1.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`age_10.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`age_10.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+### 4.2.2.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+### 4.2.6.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
+
+## 5.Procedure v2接口
+
+下面的说明以 REST API 为例，介绍存储过程v2的调用。
+
+### 5.1.编写存储过程
+
+
+用户可以通过使用 lgraph API 来编写 C++ 存储过程。一个简单的 C++ 存储过程举例如下：
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+从代码中我们可以看到：
+- 存储过程定义了一个获取签名的方法`GetSignature`。该方法返回了存储过程的签名，其中包含输入参数名称及其类型，返回参数及其类型。这使得Cypher查询语句在调用存储过程能够利用签名信息校验输入数据以及返回数据是否合理。
+- 入口函数是`ProcessInTxn`函数，它的参数有三个，分别为：
+
+- `txn`: 存储过程所处的事务，通常来说即调用该存储过程的Cypher语句所处事务。
+- `request`: 输入数据，其内容为`GetSignature`中定义的输入参数类型及其Cypher查询语句中传入的值经过json序列化后的字符串。e.g. `{num_iteration: 10}`
+- `response`: 输出数据，为保证在Cypher语言中能够兼容，用户可以通过往`lgraph_api::Result` 写入存储过程处理后的数据，最后用`lgraph_api::Result::Dump`来序列化成json格式的数据。
+
+`ProcessInTxn`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`custom_pagerank`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 custom_pagerank.so，然后用户就可以将它加载到服务器中了。
+
+
+### 5.2.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`custom_pagerank.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`custom_pagerank.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+#### 5.2.1.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+#### 5.2.5.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..9613828c50
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,128 @@
+# Traversal API
+
+> 此文档主要讲解 TuGraph 的存储过程中的Traversal API
+
+## 1. 简介
+
+TuGraph 强大的在线分析处理（OLAP）能力是其区别于其它图数据库的一个重要特性。
+借助 C++ OLAP API（olap_on_db.h），用户可以快速地导出一个需要进行复杂分析的子图，然后在其上运行诸如 PageRank、连通分量、社区发现等迭代式图计算过程，最后根据结果做出相应决策。
+导出和计算的过程都可以通过并行处理的方式进行加速，从而实现几乎实时的分析处理，避免了传统解决方案需要将数据导出、转换、再导入（ETL）到专门的分析系统进行离线处理的冗长步骤。
+
+TuGraph 内置了大量常用的图分析算法和丰富的辅助接口，因此用户几乎不需要自己来实现具体的图计算过程，只需在实现自己的存储过程时将相应算法库的头文件（.h 文件）包含到自己程序中，并在编译时链接相应的动态库文件（.so）即可。
+一般情况下，用户需要自己实现的只有将需要分析的子图抽取出来的过程。
+
+目前 Traversal API 仅支持 C++。
+
+## 2. 接口说明
+
+### 2.1. Snapshot
+
+C++ OLAP API 中的 Snapshot 模版类用于表示抽取出来的静态子图，其中 EdgeData 用来表示该子图上每条边所用权值的数据类型（如果边不需要权值，使用 Empty 作为 EdgeData 即可）。
+
+抽取的子图通过 Snapshot 类的构造函数来描述：
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+其中，db 为数据库句柄，txn 为事务句柄，flags 为生成时使用的选项，可选值包括以下的组合：SNAPSHOT_PARALLEL 表示导出时使用多个线程进行并行；SNAPSHOT_UNDIRECTED 表示需要将导出的图变为无向图。
+vertex_filter 是面向点的用户自定义过滤函数，返回值为 true 表示该点需要被包含到待抽取的子图中，反之则表示需要被排除。
+out_edge_filter 是面向边的用户自定义过滤函数，返回值为 true 表示该边需要被包含到待抽取的子图中，反之则表示需要被排除。
+当过滤函数为缺省值时，则表示需要将所有点/边都包含进来。
+
+Snapshot 类提供的其它方法请参考详细的 C++ API 文档（olap_on_db.h）。
+
+### 2.2. Traversal
+
+图数据库中十分常见的一大类分析是基于一个或多个点出发，逐层地拓展并访问邻居。
+尽管这类分析也可以使用 Cypher 完成，但是当访问的层数较深时，其性能会受到串行解释执行的限制。
+使用 C++ Core API 编写存储过程尽管避免了解释执行，但依然受限于单个线程的处理能力。
+为了让用户能够方便地通过并行处理的方式加速这一类应用场景，我们基于 C++ OLAP API 封装了一个 Traversal 框架，用户可以直接使用其中的 FrontierTraversal 和 PathTraversal 类来完成这种逐层遍历的分析任务，具体的使用方法可以参考相应的 C++ API 文档（lgraph_traversal.h）。
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+该方法可用于找到所有满足条件（filter 返回 true）的点，当 parallel 为 true 时则会并行该查找过程。
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+该方法可用于从指定点集（frontier）中（通过 extract 方法）抽取（类型为 VertexData 的）属性，当 parallel 为 true 时会并行该抽取过程。
+
+FrontierTraversal 适用于只关注遍历扩展到的点集的情况；当用户在遍历过程或是结果中需要访问路径上的信息（路径上的点/边）时，则需要使用 PathTraversal。
+两类 Traversal 的构造函数均有四个参数，分别为数据库句柄 db、事务句柄 txn、选项 flags 和 初始化数组容量 capacity。
+选项的可选值包括以下的组合：TRAVERSAL_PARALLEL 表示遍历时使用多个线程并行；TRAVERSAL_ALLOW_REVISITS 表示遍历时允许重复地访问点（PathTraversal 隐含了该选项）。capacity 表示初始化时路径集合的容量。
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+两类 Traversal 设置遍历的起始点/点集有上述三种方式，前两种通过点 ID 直接指定，最后一种方式则类似于 FindVertices。
+
+两类 Traversal 的遍历都是从当前层的点集合出发，根据使用的扩展函数访问每条出边/入边/出边和入边，通过用户自定义的过滤函数决定扩展是否成功，若成功则将邻居点/追加了该条边的路径加入下一层的点/路径集合。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+上述为 FrontierTraversal 的三种遍历方式，即从当前的点集合出发，对集合中的每个点，依次访问每条出边/入边/出边和入边，若满足用户自定义的过滤条件（其中，edge_filter 为面向边的过滤函数，neighbour_filter 则为面向邻居点的过滤函数），则将邻居点加入新的点集合。
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+当前点集合的扩展结束后，新的点集合可以通过上述方法取得。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+PathTraversal 的三种遍历方式与 FrontierTraversal 类似，只是用户自定义的过滤函数中增加了两个参数，其中：Path 包含了到新扩展的这条边之前的路径，IteratorHelper 可用于将路径中的点/边转为数据库中对应的迭代器，相关文档可参考对应的 C++ API 文档。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.md
new file mode 100644
index 0000000000..be3db1d292
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.md
@@ -0,0 +1,11642 @@
+
+
+             
+  <section id="c">
+
+<div class="toctree-wrapper compound">
+</div>
+<section id="base64-encode">
+<h2>base64_encode<a class="headerlink" href="#base64-encode" title="永久链接至标题"></a></h2>
+<p>Base64 encode and decode. Simple implementation, to be used with BLOB fields. If performance is important, look for an optimized implementation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_api">
+<span id="_CPPv310lgraph_api"></span><span id="_CPPv210lgraph_api"></span><span id="lgraph_api"></span><span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><a class="headerlink" href="#_CPPv410lgraph_api" title="永久链接至目标"></a><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base64E">
+<span id="_CPPv3N10lgraph_api6base64E"></span><span id="_CPPv2N10lgraph_api6base64E"></span><span id="lgraph_api::base64"></span><span class="target" id="namespacelgraph__api_1_1base64"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6base64E" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646EncodeEPKc6size_t"></span><span id="lgraph_api::base64::Encode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1a18e9a89247359b1a4abc31183a17f8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to encode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The encoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646EncodeERKNSt6stringE"></span><span id="lgraph_api::base64::Encode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a1c276e294945b5f438b8ea942692e730"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Encode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646EncodeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Encodes a string to Base64. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__cCP.s.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac29334d4c57dcc18603ff6ad813e6cb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ret</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeEPKc6size_tRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string. </p></li>
+<li><p><strong>ret</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE"></span><span id="lgraph_api::base64::TryDecode__ssCR.ssR"></span><span class="target" id="namespacelgraph__api_1_1base64_1a970296461b9202f8fb91e56590fb160b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TryDecode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">out</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base649TryDecodeERKNSt6stringERNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Tries to decode a Base64 string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string to decode. </p></li>
+<li><p><strong>out</strong> – <strong>[out]</strong> The decoded string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the string was decoded successfully, false otherwise. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeEPKc6size_t">
+<span id="_CPPv3N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="_CPPv2N10lgraph_api6base646DecodeEPKc6size_t"></span><span id="lgraph_api::base64::Decode__cCP.s"></span><span class="target" id="namespacelgraph__api_1_1base64_1ac2d795c4f1fcd79f41e3bb8591c03c81"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>p</strong> – The string to decode. </p></li>
+<li><p><strong>s</strong> – Size of the string.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6base646DecodeERKNSt6stringE"></span><span id="lgraph_api::base64::Decode__ssCR"></span><span class="target" id="namespacelgraph__api_1_1base64_1ab07cfe3bb273d86861a477a435a7686a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Decode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6base646DecodeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Decode a Base64 string and throw exception if fails. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the string is not a valid Base64 string.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>str</strong> – The string to decode.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The decoded string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph">
+<h2>lgraph<a class="headerlink" href="#lgraph" title="永久链接至标题"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.LGAPI">
+<span class="target" id="lgraph_8h_1ad89ce29b199ac3372f644ffc910a466a"></span><span class="sig-name descname"><span class="n"><span class="pre">LGAPI</span></span></span><a class="headerlink" href="#c.LGAPI" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12GetSignatureE">
+<span id="_CPPv3N10lgraph_api12GetSignatureE"></span><span id="_CPPv2N10lgraph_api12GetSignatureE"></span><span id="lgraph_api::GetSignature"></span><span class="target" id="namespacelgraph__api_1a0e7238ee4b0e28208b594b2bc334b031"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSignature</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7SigSpecE" title="lgraph_api::SigSpec"><span class="n"><span class="pre">SigSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sig_spec</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12GetSignatureE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7ProcessE">
+<span id="_CPPv3N10lgraph_api7ProcessE"></span><span id="_CPPv2N10lgraph_api7ProcessE"></span><span id="lgraph_api::Process"></span><span class="target" id="namespacelgraph__api_1abc0e7fd5062a22bca6290439450eb245"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Process</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7ProcessE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12ProcessInTxnE">
+<span id="_CPPv3N10lgraph_api12ProcessInTxnE"></span><span id="_CPPv2N10lgraph_api12ProcessInTxnE"></span><span id="lgraph_api::ProcessInTxn"></span><span class="target" id="namespacelgraph__api_1afb8681ba4f3cc04bdc96b9b8ccc17775"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessInTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6ResultE" title="lgraph_api::Result"><span class="n"><span class="pre">Result</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12ProcessInTxnE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-atomic">
+<h2>lgraph_atomic<a class="headerlink" href="#lgraph-atomic" title="永久链接至标题"></a></h2>
+<p>Implementation of atomic operations, used in lgraph_traversal. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api3casEbP1T1T1T">
+<span id="_CPPv3I0EN10lgraph_api3casEP1T1T1T"></span><span id="_CPPv2I0EN10lgraph_api3casEP1T1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab1806f690b319d23b933206cd295f745"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cas</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">ptr</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">oldv</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="lgraph_api::cas::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">newv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api3casEbP1T1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_minEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_minEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_minEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1acd8330b393c3cb2b46c461119f4aa484"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_min</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="lgraph_api::write_min::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_minEbP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_maxEbP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_maxEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_maxEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a451eee503d74e69ad9fc6db943ee446f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_max</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="lgraph_api::write_max::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_maxEbP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_addEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_addEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_addEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ab5f65d4fa238b2bc6675bba789e5d635"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="lgraph_api::write_add::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_addEvP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_add__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a17b724a3f516c98594033b9cbf7e2dd6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint64_t8uint64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_add__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1ae1334e7bca1be121f4a9099ee1499872"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP8uint32_t8uint32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int64_t7int64_t"></span><span id="lgraph_api::write_add__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1ab7aec34df35e5fe40f87f17cd8384759"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int64_t7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_addEP7int32_t7int32_t"></span><span id="lgraph_api::write_add__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a4688a3165d87b264a0f0e0d747add460"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_addEP7int32_t7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9write_subEvP1T1T">
+<span id="_CPPv3I0EN10lgraph_api9write_subEP1T1T"></span><span id="_CPPv2I0EN10lgraph_api9write_subEP1T1T"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a34d077b3ffee356fb73bdc35a7cb8819"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="lgraph_api::write_sub::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9write_subEvP1T1T" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint64_t8uint64_t"></span><span id="lgraph_api::write_sub__uint64_tP.uint64_t"></span><span class="target" id="namespacelgraph__api_1a3e0a202ef30dd1729c3671b217c7a0b3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint64_t8uint64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP8uint32_t8uint32_t"></span><span id="lgraph_api::write_sub__uint32_tP.uint32_t"></span><span class="target" id="namespacelgraph__api_1aa321f049db89fbc2c821e62ede09b00e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">uint32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP8uint32_t8uint32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int64_t7int64_t"></span><span id="lgraph_api::write_sub__int64_tP.int64_t"></span><span class="target" id="namespacelgraph__api_1adc6709b36af7ba0701e624044f2cf9d0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int64_t7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t">
+<span id="_CPPv3N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="_CPPv2N10lgraph_api9write_subEP7int32_t7int32_t"></span><span id="lgraph_api::write_sub__int32_tP.int32_t"></span><span class="target" id="namespacelgraph__api_1a15cf35d73dc33e1a0fad97647beaca63"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">write_sub</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">a</span></span>, <span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9write_subEP7int32_t7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-date-time">
+<h2>lgraph_date_time<a class="headerlink" href="#lgraph-date-time" title="永久链接至标题"></a></h2>
+<p>Implemnets the DateTime, Date and TimeZone classes. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MinDaysSinceEpochForDateEv"></span><span id="lgraph_api::MinDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a7d4a5022a392e2f121804ec89c1f4819"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MinDaysSinceEpochForDateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv">
+<span id="_CPPv3N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="_CPPv2N10lgraph_api24MaxDaysSinceEpochForDateEv"></span><span id="lgraph_api::MaxDaysSinceEpochForDateCE"></span><span class="target" id="namespacelgraph__api_1a57143a0e3c25aaa249ec45411aeed284"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxDaysSinceEpochForDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api24MaxDaysSinceEpochForDateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Maximum days since epoch for date </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MinMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ace6f22166909871827c64134bc108c4f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MinMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MinMicroSecondsSinceEpochForDateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>min and max values that <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> can hold </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv">
+<span id="_CPPv3N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="_CPPv2N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv"></span><span id="lgraph_api::MaxMicroSecondsSinceEpochForDateTimeCE"></span><span class="target" id="namespacelgraph__api_1ae9241a416800bd43775b274c3d68b24a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MaxMicroSecondsSinceEpochForDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api36MaxMicroSecondsSinceEpochForDateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Maximum microseconds since epoch for date time </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api4DateE"></span><span id="lgraph_api::Date"></span><span class="target" id="classlgraph__api_1_1Date"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4DateE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> class. Range of dates is from 0/1/1 to 12/31/9999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateEv">
+<span id="_CPPv3N10lgraph_api4Date4DateEv"></span><span id="_CPPv2N10lgraph_api4Date4DateEv"></span><span id="lgraph_api::Date::Date"></span><span class="target" id="classlgraph__api_1_1Date_1aff49fc2cda4491ff4457ca481bb8edf9"></span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with the date set to 1970/1/1. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::Date::Date__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1Date_1a1d304cb3d2f5bedd0a4585c4a1e6af70"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6chrono12system_clock10time_pointE" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified time. The time point must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>tp</strong> – Time point to set the date to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay">
+<span id="_CPPv3N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="_CPPv2N10lgraph_api4Date4DateERK12YearMonthDay"></span><span id="lgraph_api::Date::Date__YearMonthDayCR"></span><span class="target" id="classlgraph__api_1_1Date_1ac753f0ab0017908da2e04a5601fbbb02"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymd</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERK12YearMonthDay" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to the specified date. The date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>ymd</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateE7int32_t">
+<span id="_CPPv3N10lgraph_api4Date4DateE7int32_t"></span><span id="_CPPv2N10lgraph_api4Date4DateE7int32_t"></span><span id="lgraph_api::Date::Date__int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1afb34a93316bafa170db694675f3ba391"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateE7int32_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object with date set to an offset from epoch, i.e. the date is set to the specified number of days from epoch. The result date must be in the range of 0/1/1 to 12/31/9999. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days_since_epoch</strong> – Number of days since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api4Date4DateERKNSt6stringE"></span><span id="lgraph_api::Date::Date__ssCR"></span><span class="target" id="classlgraph__api_1_1Date_1aa34be0efffbb041680f06e2e51226b64"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date4DateERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from a YYYY-MM-DD string. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if the string is not in the correct format.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>str</strong> – The string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv">
+<span id="_CPPv3NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="_CPPv2NK10lgraph_api4Date15GetYearMonthDayEv"></span><span id="lgraph_api::Date::GetYearMonthDayC"></span><span class="target" id="classlgraph__api_1_1Date_1ab2d9b29e32b6adb74401c6d85fd5ffb0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="lgraph_api::Date::YearMonthDay"><span class="n"><span class="pre">YearMonthDay</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYearMonthDay</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date15GetYearMonthDayEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in the form of year, month and day. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The year month day. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateplEi">
+<span id="_CPPv3NK10lgraph_api4DateplEi"></span><span id="_CPPv2NK10lgraph_api4DateplEi"></span><span id="lgraph_api::Date::add-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1ad3fe85f66511da6deb3ca8d54edf51bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateplEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a number of days to the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatepLEi">
+<span id="_CPPv3N10lgraph_api4DatepLEi"></span><span id="_CPPv2N10lgraph_api4DatepLEi"></span><span id="lgraph_api::Date::add-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1a3b36b3e6261a05420139a4eba5eea5dd"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatepLEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a number of days to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Reference to the current date. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DatemiEi">
+<span id="_CPPv3NK10lgraph_api4DatemiEi"></span><span id="_CPPv2NK10lgraph_api4DatemiEi"></span><span id="lgraph_api::Date::sub-operator__iC"></span><span class="target" id="classlgraph__api_1_1Date_1a54622b3edddecff4df3c9f572a7cdcc5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DatemiEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of days from the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4DatemIEi">
+<span id="_CPPv3N10lgraph_api4DatemIEi"></span><span id="_CPPv2N10lgraph_api4DatemIEi"></span><span id="lgraph_api::Date::sub-assign-operator__i"></span><span class="target" id="classlgraph__api_1_1Date_1aaa15a5d3c4427b09ebb8e2bba5de64b5"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">days</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4DatemIEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of days from the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. In case of overflow, current object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting date is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>days</strong> – Number of days to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Reference to the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateltERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateltERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateltERK4Date"></span><span id="lgraph_api::Date::lt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abf811a8c8e2765b24426cc2ff6fe13f9"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateltERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateleERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateleERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateleERK4Date"></span><span id="lgraph_api::Date::lte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1a3c9beee445a203e18d4a9145132f7b2f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateleERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategtERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategtERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategtERK4Date"></span><span id="lgraph_api::Date::gt-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1af35d39c86aa4c554db7e553b09708907"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategtERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DategeERK4Date">
+<span id="_CPPv3NK10lgraph_api4DategeERK4Date"></span><span id="_CPPv2NK10lgraph_api4DategeERK4Date"></span><span id="lgraph_api::Date::gte-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1abd180b0c29b2c846b8d58e2b4c9e822a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DategeERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateeqERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateeqERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateeqERK4Date"></span><span id="lgraph_api::Date::eq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1ac8e2b0b0dfb86a868f9d602643a58dae"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateeqERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4DateneERK4Date">
+<span id="_CPPv3NK10lgraph_api4DateneERK4Date"></span><span id="_CPPv2NK10lgraph_api4DateneERK4Date"></span><span id="lgraph_api::Date::neq-operator__DateCRC"></span><span class="target" id="classlgraph__api_1_1Date_1aec998ec2d30eb9705f995cf55907dae4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4DateneERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api4Date14DaysSinceEpochEv"></span><span id="lgraph_api::Date::DaysSinceEpochC"></span><span class="target" id="classlgraph__api_1_1Date_1aba5994b68821ee6127c84c8134823f8a"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DaysSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date14DaysSinceEpochEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api4Date10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api4Date10GetStorageEv"></span><span id="lgraph_api::Date::GetStorageC"></span><span class="target" id="classlgraph__api_1_1Date_1ad8100ffff03d1b59ec5eae1e166b7979"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date10GetStorageEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv7int32_tEv">
+<span id="_CPPv3NK10lgraph_api4Datecv7int32_tEv"></span><span id="_CPPv2NK10lgraph_api4Datecv7int32_tEv"></span><span id="lgraph_api::Date::castto-int32_t-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1acdefe8b0c57d12e7de99a1f168a4f60e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv7int32_tEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the number of days this date is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date9TimePointEv">
+<span id="_CPPv3NK10lgraph_api4Date9TimePointEv"></span><span id="_CPPv2NK10lgraph_api4Date9TimePointEv"></span><span id="lgraph_api::Date::TimePointC"></span><span class="target" id="classlgraph__api_1_1Date_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date9TimePointEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the timepoint corresponding to this date at 00:00 am. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Date8ToStringEv">
+<span id="_CPPv3NK10lgraph_api4Date8ToStringEv"></span><span id="_CPPv2NK10lgraph_api4Date8ToStringEv"></span><span id="lgraph_api::Date::ToStringC"></span><span class="target" id="classlgraph__api_1_1Date_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Date8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the string representation of the date in the format of YYYY-MM-DD. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api4Datecv8DateTimeEv">
+<span id="_CPPv3NK10lgraph_api4Datecv8DateTimeEv"></span><span id="_CPPv2NK10lgraph_api4Datecv8DateTimeEv"></span><span id="lgraph_api::Date::castto-DateTime-operatorC"></span><span class="target" id="classlgraph__api_1_1Date_1af6857cebc4d28eb784e6bdbac1fe0ba9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api4Datecv8DateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object corresponding to 00:00 am on this date. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseERKNSt6stringER4Date"></span><span id="lgraph_api::Date::Parse__ssCR.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1aad607a219665901350781e377d7b82ee"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseERKNSt6stringER4Date" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The resulting <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date">
+<span id="_CPPv3N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="_CPPv2N10lgraph_api4Date5ParseEPKcPKcR4Date"></span><span id="lgraph_api::Date::Parse__cCP.cCP.DateR"></span><span class="target" id="classlgraph__api_1_1Date_1a7c3a61e8da1dbf48e1b7f2b65550d815"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date5ParseEPKcPKcR4Date" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD, save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> The result.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 10), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date3NowEv">
+<span id="_CPPv3N10lgraph_api4Date3NowEv"></span><span id="_CPPv2N10lgraph_api4Date3NowEv"></span><span id="lgraph_api::Date::Now"></span><span class="target" id="classlgraph__api_1_1Date_1a3e7d4298fa0246f18cb55d621635b2bc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date3NowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date8LocalNowEv">
+<span id="_CPPv3N10lgraph_api4Date8LocalNowEv"></span><span id="_CPPv2N10lgraph_api4Date8LocalNowEv"></span><span id="lgraph_api::Date::LocalNow"></span><span class="target" id="classlgraph__api_1_1Date_1aac31515c859f4e327724992a762ca42f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date8LocalNowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns the current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Current <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date17days_since_epoch_E">
+<span id="_CPPv3N10lgraph_api4Date17days_since_epoch_E"></span><span id="_CPPv2N10lgraph_api4Date17days_since_epoch_E"></span><span id="lgraph_api::Date::days_since_epoch___int32_t"></span><span class="target" id="classlgraph__api_1_1Date_1ac7f1cae7e807741a698b319ead8869cc"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">days_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date17days_since_epoch_E" title="永久链接至目标"></a><br></dt>
+<dd><p>The days since epoch </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDayE"></span><span id="lgraph_api::Date::YearMonthDay"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YearMonthDay</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDayE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Structure representing a date in the format of year, month and day. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay4yearE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay4yearE"></span><span id="lgraph_api::Date::YearMonthDay::year__i"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay4yearE" title="永久链接至目标"></a><br></dt>
+<dd><p>The year, 0-9999 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay5monthE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay5monthE"></span><span id="lgraph_api::Date::YearMonthDay::month__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay5monthE" title="永久链接至目标"></a><br></dt>
+<dd><p>Month, 1-12 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4Date12YearMonthDay3dayE">
+<span id="_CPPv3N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="_CPPv2N10lgraph_api4Date12YearMonthDay3dayE"></span><span id="lgraph_api::Date::YearMonthDay::day__unsigned"></span><span class="target" id="structlgraph__api_1_1Date_1_1YearMonthDay_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4Date12YearMonthDay3dayE" title="永久链接至目标"></a><br></dt>
+<dd><p>Day, 1-31 </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api8DateTimeE"></span><span id="lgraph_api::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimeE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Implements a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> class that holds <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the range of 0000-01-01 00:00:00.000000 to 9999-12-31 23:59:59.999999. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeEv">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeEv"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeEv"></span><span id="lgraph_api::DateTime::DateTime"></span><span class="target" id="classlgraph__api_1_1DateTime_1a3e93cd7baeb8b4448482a450df21ab20"></span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the epoch time, i.e., 1970-1-1 00:00:00. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE"></span><span id="lgraph_api::DateTime::DateTime__std::chrono::system_clock::time_pointCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1acf8d529b725b6346cad668a4b7d6f5cf"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">tp</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6chrono12system_clock10time_pointE" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified timepoint. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>tp</strong> – Timepoint to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERK7YMDHMSF"></span><span id="lgraph_api::DateTime::DateTime__YMDHMSFCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a58680ad139b71f8686734b52e6a4d545"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ymdhmsf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERK7YMDHMSF" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in <a class="reference internal" href="#structlgraph__api_1_1DateTime_1_1YMDHMSF"><span class="std std-ref">YMDHMSF</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>ymdhmsf</strong> – <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and time to set the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeE7int64_t"></span><span id="lgraph_api::DateTime::DateTime__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae5e26b24f48dd42cffd98d526bd74aab"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">microseconds_since_epoch</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to specified number of microseconds since epoch. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>microseconds_since_epoch</strong> – Number of microseconds since epoch. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api8DateTime8DateTimeERKNSt6stringE"></span><span id="lgraph_api::DateTime::DateTime__ssCR"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae891fafda07463e06dbee5b88203da54"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8DateTimeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a new <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object with date set to the specified date and time given in the form of YYYY-MM-DD HH:MM:SS[.FFFFFF]. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the time point is out of range. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if str has invalid format.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>str</strong> – String representation of the date and time in the form of YYYY-MM-DD HH:MM:SS. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetYMDHMSFEv"></span><span id="lgraph_api::DateTime::GetYMDHMSFC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5027ca2fdaa6be6b27f7d4acb2bfabf7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="lgraph_api::DateTime::YMDHMSF"><span class="n"><span class="pre">YMDHMSF</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetYMDHMSF</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetYMDHMSFEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in the form of year, month, day, hour, minute, second, fraction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The ymdhmsf. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeplE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimeplE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimeplE7int64_t"></span><span id="lgraph_api::DateTime::add-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5da5a7459ddc40a149081b898ea98951"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeplE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a number of microseconds to the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of micorseconds to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimepLE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimepLE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimepLE7int64_t"></span><span id="lgraph_api::DateTime::add-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5bdd35f5b63bc64bb6af19e96fa9e803"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">+=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimepLE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a number of microseconds to the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to add.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimemiE7int64_t">
+<span id="_CPPv3NK10lgraph_api8DateTimemiE7int64_t"></span><span id="_CPPv2NK10lgraph_api8DateTimemiE7int64_t"></span><span id="lgraph_api::DateTime::sub-operator__int64_tC"></span><span class="target" id="classlgraph__api_1_1DateTime_1afcd73eec42253057720a4a0d140e5eee"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimemiE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTimemIE7int64_t">
+<span id="_CPPv3N10lgraph_api8DateTimemIE7int64_t"></span><span id="_CPPv2N10lgraph_api8DateTimemIE7int64_t"></span><span id="lgraph_api::DateTime::sub-assign-operator__int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a5a80be41155d8105875e8a3eb51c2c7b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">-=</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_microseconds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTimemIE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Subtract a number of microseconds from the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object. In case of overflow, the current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> object is not modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>n_microseconds</strong> – Number of microseconds to subtract.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A reference to current object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeltERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeltERK8DateTime"></span><span id="lgraph_api::DateTime::lt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a16dffc2ee84f6e10fd3271e9b0cb5306"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeltERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeleERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeleERK8DateTime"></span><span id="lgraph_api::DateTime::lte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a40adc1eacbf9ed88ac1cc35dc3d51f30"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeleERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegtERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegtERK8DateTime"></span><span id="lgraph_api::DateTime::gt-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ae96fabdd15f3dfd300e7d399b12305bc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegtERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimegeERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimegeERK8DateTime"></span><span id="lgraph_api::DateTime::gte-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1adc2ea02a36b0f48b50f6e863facd20e6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimegeERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeeqERK8DateTime"></span><span id="lgraph_api::DateTime::eq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a30d73527665a6b136070874aeb9b4c2e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeeqERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimeneERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8DateTimeneERK8DateTime"></span><span id="lgraph_api::DateTime::neq-operator__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac9b0839d6be50242b118d69b0ead3e24"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimeneERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv">
+<span id="_CPPv3NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="_CPPv2NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv"></span><span id="lgraph_api::DateTime::MicroSecondsSinceEpochC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7576b1eff7b32d33fef2cfc541c0d7ae"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MicroSecondsSinceEpoch</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime22MicroSecondsSinceEpochEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime10GetStorageEv">
+<span id="_CPPv3NK10lgraph_api8DateTime10GetStorageEv"></span><span id="_CPPv2NK10lgraph_api8DateTime10GetStorageEv"></span><span id="lgraph_api::DateTime::GetStorageC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a92a5a81985fd01aa29a8923985ee350a"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStorage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime10GetStorageEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv7int64_tEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv7int64_tEv"></span><span id="lgraph_api::DateTime::castto-int64_t-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a9223b52f5d6412f67b24aaa89c360d7c"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv7int64_tEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the number of microseconds this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is since epoch. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime9TimePointEv">
+<span id="_CPPv3NK10lgraph_api8DateTime9TimePointEv"></span><span id="_CPPv2NK10lgraph_api8DateTime9TimePointEv"></span><span id="lgraph_api::DateTime::TimePointC"></span><span class="target" id="classlgraph__api_1_1DateTime_1ace653be276446beede7086a26415f8a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">chrono</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">system_clock</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">time_point</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimePoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime9TimePointEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the timepoint correponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTime8ToStringEv">
+<span id="_CPPv3NK10lgraph_api8DateTime8ToStringEv"></span><span id="_CPPv2NK10lgraph_api8DateTime8ToStringEv"></span><span id="lgraph_api::DateTime::ToStringC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a136052cbdb7e701984c3b391c5508590"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTime8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of the date and time in the form of YYYY-MM-DD HH:MM:SS.[ffffff] </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8DateTimecv4DateEv">
+<span id="_CPPv3NK10lgraph_api8DateTimecv4DateEv"></span><span id="_CPPv2NK10lgraph_api8DateTimecv4DateEv"></span><span id="lgraph_api::DateTime::castto-Date-operatorC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a8049aeab68ea779547e65cd4b2058bd1"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8DateTimecv4DateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> object corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv">
+<span id="_CPPv3N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="_CPPv2N10lgraph_api8DateTime12ConvertToUTCEv"></span><span id="lgraph_api::DateTime::ConvertToUTC"></span><span class="target" id="classlgraph__api_1_1DateTime_1a56e9bf4e6d3c6e9610e1f572f112d13c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToUTC</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime12ConvertToUTCEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the UTC time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a local time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Object converted to an UTC.</p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv">
+<span id="_CPPv3N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="_CPPv2N10lgraph_api8DateTime14ConvertToLocalEv"></span><span id="lgraph_api::DateTime::ConvertToLocal"></span><span class="target" id="classlgraph__api_1_1DateTime_1ad05a5ca52a97c6a3c4e4c62bbcdd0ff9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConvertToLocal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime14ConvertToLocalEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the local time corresponding to this <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>, assuming current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is a UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> is out of range. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Object converted to a local.</p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime"></span><span id="lgraph_api::DateTime::Parse__ssCR.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a53252357cbc4cfe0040f4b0c31a6ca93"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseERKNSt6stringER8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>str</strong> – The string. </p></li>
+<li><p><strong>d</strong> – <strong>[out]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if success, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime">
+<span id="_CPPv3N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="_CPPv2N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime"></span><span id="lgraph_api::DateTime::Parse__cCP.cCP.DateTimeR"></span><span class="target" id="classlgraph__api_1_1DateTime_1a7f3b51df42213d000e5cf8499fc9583f"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parse</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">beg</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime5ParseEPKcPKcR8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse date from YYYY-MM-DD HH:MM:SS(.FFFFFF), save value in d. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>beg</strong> – The beg. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>d</strong> – <strong>[inout]</strong> A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> to process.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Number of bytes parsed (must be 19 or 26), 0 if failed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime3NowEv">
+<span id="_CPPv3N10lgraph_api8DateTime3NowEv"></span><span id="_CPPv2N10lgraph_api8DateTime3NowEv"></span><span id="lgraph_api::DateTime::Now"></span><span class="target" id="classlgraph__api_1_1DateTime_1afdf6bfab9c1625bea9fe0d88052eb9be"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Now</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime3NowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime8LocalNowEv">
+<span id="_CPPv3N10lgraph_api8DateTime8LocalNowEv"></span><span id="_CPPv2N10lgraph_api8DateTime8LocalNowEv"></span><span id="lgraph_api::DateTime::LocalNow"></span><span class="target" id="classlgraph__api_1_1DateTime_1ac419c09087e3dfbeb9b13a52cf5ca63b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LocalNow</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime8LocalNowEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E">
+<span id="_CPPv3N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="_CPPv2N10lgraph_api8DateTime25microseconds_since_epoch_E"></span><span id="lgraph_api::DateTime::microseconds_since_epoch___int64_t"></span><span class="target" id="classlgraph__api_1_1DateTime_1a35d4677c58d7dc9be8f6566632ef33ea"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">microseconds_since_epoch_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime25microseconds_since_epoch_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSFE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSFE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSFE"></span><span id="lgraph_api::DateTime::YMDHMSF"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">YMDHMSF</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSFE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>Representation of a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in year, month, day, hour, minute, second, fraction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4yearE"></span><span id="lgraph_api::DateTime::YMDHMSF::year__i"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1abeac221e38b7b9ce7df8722c842bf671"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">year</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4yearE" title="永久链接至目标"></a><br></dt>
+<dd><p>The year, 0-9999 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF5monthE"></span><span id="lgraph_api::DateTime::YMDHMSF::month__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a1f902d56334cc3e0a86d4b08f34bfff6"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">month</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF5monthE" title="永久链接至目标"></a><br></dt>
+<dd><p>The month, 1-12 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF3dayE"></span><span id="lgraph_api::DateTime::YMDHMSF::day__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a2ce67e633b6747257e9cfc74288fcc31"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">day</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF3dayE" title="永久链接至目标"></a><br></dt>
+<dd><p>The day, 1-31 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF4hourE"></span><span id="lgraph_api::DateTime::YMDHMSF::hour__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a7f39b6fc12f0b04a38625ff3040dd30c"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">hour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF4hourE" title="永久链接至目标"></a><br></dt>
+<dd><p>The hour, 0-23 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6minuteE"></span><span id="lgraph_api::DateTime::YMDHMSF::minute__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a408e3d60d59afc5b5a6f35ac9f5c8fbb"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">minute</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6minuteE" title="永久链接至目标"></a><br></dt>
+<dd><p>The minute, 0-59 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF6secondE"></span><span id="lgraph_api::DateTime::YMDHMSF::second__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1af7633c5cbb76481bafd5e3e1ec07ca37"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">second</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF6secondE" title="永久链接至目标"></a><br></dt>
+<dd><p>The second, 0-59 </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE">
+<span id="_CPPv3N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="_CPPv2N10lgraph_api8DateTime7YMDHMSF8fractionE"></span><span id="lgraph_api::DateTime::YMDHMSF::fraction__unsigned"></span><span class="target" id="structlgraph__api_1_1DateTime_1_1YMDHMSF_1a4a3d5aea78d5e1e01c7be45e6990456f"></span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fraction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8DateTime7YMDHMSF8fractionE" title="永久链接至目标"></a><br></dt>
+<dd><p>The fraction 000000-999999 </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZoneE">
+<span id="_CPPv3N10lgraph_api8TimeZoneE"></span><span id="_CPPv2N10lgraph_api8TimeZoneE"></span><span id="lgraph_api::TimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZoneE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_date_time.h&gt;</em></div>
+<p>A class that represents a time zone. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone8TimeZoneEi">
+<span id="_CPPv3N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="_CPPv2N10lgraph_api8TimeZone8TimeZoneEi"></span><span id="lgraph_api::TimeZone::TimeZone__i"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a4cbdd9521cf61ed9457984aeff9c4e13"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TimeZone</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">time_diff_hours</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone8TimeZoneEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Create a timezone which has time difference with UTC in hours time_diff_hours. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidParameter</span></span></span> – Thrown if time_diff_hours is invalid.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>time_diff_hours</strong> – (Optional) Difference between local timezone and UTC. Must be &gt; =-10 &amp;&amp; &lt;=14. Otherwise the function will throw. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone7FromUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::FromUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae70105315a4e43ef16dcc94d07a69769"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FromUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone7FromUTCERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from UTC time to this time zone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC time.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime">
+<span id="_CPPv3NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="_CPPv2NK10lgraph_api8TimeZone5ToUTCERK8DateTime"></span><span id="lgraph_api::TimeZone::ToUTC__DateTimeCRC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1aa0d29ab9305bb5efa5bd1cdc48647086"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToUTC</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dt</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone5ToUTCERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd><p>Convert a <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> from this timezone to UTC time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">OutOfRange</span></span></span> – Thrown if the resulting value is out of range.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>dt</strong> – <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in local timezone.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a> in UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone14UTCDiffSecondsEv"></span><span id="lgraph_api::TimeZone::UTCDiffSecondsC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a9aaed281da56442099de67e51fe47638"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffSeconds</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone14UTCDiffSecondsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns diff from UTC in seconds, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a></p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of seconds local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv">
+<span id="_CPPv3NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="_CPPv2NK10lgraph_api8TimeZone12UTCDiffHoursEv"></span><span id="lgraph_api::TimeZone::UTCDiffHoursC"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a56914c89b37c60dcfc9db708d3a89446"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UTCDiffHours</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api8TimeZone12UTCDiffHoursEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns diff from UTC in hours, this is used in <a class="reference internal" href="#classlgraph__api_1_1Date"><span class="std std-ref">Date</span></a> and <a class="reference internal" href="#classlgraph__api_1_1DateTime"><span class="std std-ref">DateTime</span></a></p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of hours local timezone is from UTC. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone13LocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::LocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone13LocalTimeZoneEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get local timezone. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A const reference to local timezone. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv">
+<span id="_CPPv3N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="_CPPv2N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv"></span><span id="lgraph_api::TimeZone::UpdateLocalTimeZone"></span><span class="target" id="classlgraph__api_1_1TimeZone_1ae9cf01b0a4d1e6cfc21306569d8260f0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpdateLocalTimeZone</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone19UpdateLocalTimeZoneEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Update local timezone, used only when daylight saving time changes. Daylight saving time may change after LocalTZ was initialized, in which case we need to update it. This function will update all references returned by <a class="reference internal" href="#classlgraph__api_1_1TimeZone_1a44edf4fbfa95ef98f037ea7ab70dac02"><span class="std std-ref">LocalTimeZone()</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E">
+<span id="_CPPv3N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="_CPPv2N10lgraph_api8TimeZone23time_diff_microseconds_E"></span><span id="lgraph_api::TimeZone::time_diff_microseconds___int64_t"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a32810c21702584e4d3090242818cbb06"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">time_diff_microseconds_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone23time_diff_microseconds_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone10GetLocalTZEv"></span><span id="lgraph_api::TimeZone::GetLocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a27c488e750c5dc4247d99d4db241b0bf"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone10GetLocalTZEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8TimeZone7LocalTZEv">
+<span id="_CPPv3N10lgraph_api8TimeZone7LocalTZEv"></span><span id="_CPPv2N10lgraph_api8TimeZone7LocalTZEv"></span><span id="lgraph_api::TimeZone::LocalTZ"></span><span class="target" id="classlgraph__api_1_1TimeZone_1a8aa7218fc3680021035c689a23159760"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8TimeZoneE" title="lgraph_api::TimeZone"><span class="n"><span class="pre">TimeZone</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">LocalTZ</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8TimeZone7LocalTZEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-db">
+<h2>lgraph_db<a class="headerlink" href="#lgraph-db" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46lgraph">
+<span id="_CPPv36lgraph"></span><span id="_CPPv26lgraph"></span><span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><a class="headerlink" href="#_CPPv46lgraph" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskEv"></span><span id="lgraph_api::ShouldKillThisTask"></span><span class="target" id="namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Determine if we should kill current task. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if a KillTask command was issued for this task, either due to user request or timeout. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16GetThreadContextEv">
+<span id="_CPPv3N10lgraph_api16GetThreadContextEv"></span><span id="_CPPv2N10lgraph_api16GetThreadContextEv"></span><span id="lgraph_api::GetThreadContext"></span><span class="target" id="namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"></span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetThreadContext</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api16GetThreadContextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets thread context pointer, which can then be used in ShouldKillThisTask(ctx). Calling <a class="reference internal" href="#namespacelgraph__api_1a1a65e54207e7d002a1ca5f46f3752c70"><span class="std std-ref">ShouldKillThisTask()</span></a> is equivalent to ShouldKillThisTask(GetThreadContext()). In order to save the cost of <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>, you can store the context and use it in ShouldKillThisTask(ctx). </p>
+<p>Example: ```c++ ThreadContextPtr ctx = <a class="reference internal" href="#namespacelgraph__api_1ae4e1bd62c72e8a3a285f0689bc0a1dde"><span class="std std-ref">GetThreadContext()</span></a>; while (HasMoreWorkToDo()) { if (ShouldKillThisTask(ctx)) { break; } DoWork(); } ```</p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The thread context. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr">
+<span id="_CPPv3N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="_CPPv2N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr"></span><span id="lgraph_api::ShouldKillThisTask__ThreadContextPtr"></span><span class="target" id="namespacelgraph__api_1a842a962cb406dd251be8aeb492510b6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ShouldKillThisTask</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ThreadContextPtr</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ctx</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api18ShouldKillThisTaskE16ThreadContextPtr" title="永久链接至目标"></a><br></dt>
+<dd><p>Determine if we should kill the task currently running in the thread identified by ctx. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>ctx</strong> – The context, as obtained with GetThreadContext.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if a KillTask command was issued for this task. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1a340bf8a3bf351920b9c20fe861372bcf"></span><span class="sig-name descname"><span class="pre">const</span> <span class="pre">typedef</span> <span class="pre">void</span> <span class="pre">*</span> <span class="pre">ThreadContextPtr</span></span></dt>
+<dd><p>Defines an alias representing the thread context pointer </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBE">
+<span id="_CPPv3N10lgraph_api7GraphDBE"></span><span id="_CPPv2N10lgraph_api7GraphDBE"></span><span id="lgraph_api::GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_db.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> represents a graph instance. In TuGraph, each graph instance has its own schema and access control settings. Accessing a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> without appropriate access rights yields WriteNotAllowed. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> becomes invalid if <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a> is called, in which case all transactions and iterators associated with that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> become invalid. Further operation on that <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> yields InvalidGraphDB. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb"></span><span id="lgraph_api::GraphDB::GraphDB__lgraph::AccessControlledDBP.b.b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8ed8306aab2d4ea17475888d25737f69"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db_with_access_control</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">owns_db</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBEPN6lgraph18AccessControlledDBEbb" title="永久链接至目标"></a><br></dt>
+<dd><p>For internal use only. Users should use <a class="reference internal" href="#classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"><span class="std std-ref">Galaxy::OpenGraph()</span></a> to get <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERR7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5884af0fb5900e58a13e6cf2c64e9061"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERR7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERR7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBRR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a43a244ebb2089430b84e50667e89d015"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERR7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBD0Ev">
+<span id="_CPPv3N10lgraph_api7GraphDBD0Ev"></span><span id="_CPPv2N10lgraph_api7GraphDBD0Ev"></span><span id="lgraph_api::GraphDB::~GraphDB"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad0d3a9bb78624594d45104c0ec3566d2"></span><span class="sig-name descname"><span class="n"><span class="pre">~GraphDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5CloseEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5CloseEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5CloseEv"></span><span id="lgraph_api::GraphDB::Close"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Close the graph. This will close the graph and release all transactions, iterators associated with the graph. After calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a7f7a3199c392465d0767c6506c1af5b4"><span class="std std-ref">Close()</span></a>, the graph becomes invalid, and cannot be used anymore. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13CreateReadTxnEv"></span><span id="lgraph_api::GraphDB::CreateReadTxn"></span><span class="target" id="classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateReadTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13CreateReadTxnEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Creates a read transaction. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The new read transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb">
+<span id="_CPPv3N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="_CPPv2N10lgraph_api7GraphDB14CreateWriteTxnEb"></span><span id="lgraph_api::GraphDB::CreateWriteTxn__b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateWriteTxn</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">optimistic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14CreateWriteTxnEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Creates a write transaction. Write operations can only be performed in write transactions, otherwise exceptions will be thrown. A write transaction can be optimistic. Optimistic transactions can run in parallel and any conflict will be detected during commit. If a transaction conflicts with an ealier one, a TxnConflict will be thrown during commit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>optimistic</strong> – (Optional) True to create an optimistic transaction.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The new write transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction">
+<span id="_CPPv3N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="_CPPv2N10lgraph_api7GraphDB7ForkTxnER11Transaction"></span><span id="lgraph_api::GraphDB::ForkTxn__TransactionR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForkTxn</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7ForkTxnER11Transaction" title="永久链接至目标"></a><br></dt>
+<dd><p>Forks a read transaction. The resulting read transaction will share the same view as the forked one, meaning that when reads are performed on the same vertex/edge, the results will always be identical, whether they are performed in the original transaction or the forked one. Only read transactions can be forked. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a126509b9c0fe94f230d4dc78bf5f4638"><span class="std std-ref">ForkTxn()</span></a> on a write txn causes an InvalidFork to be thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidFork</span></span></span> – Thrown when txn is a write transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>txn</strong> – <strong>[in]</strong> The read transaction to be forked.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A new read <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> that shares the same view with txn. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB5FlushEv">
+<span id="_CPPv3N10lgraph_api7GraphDB5FlushEv"></span><span id="_CPPv2N10lgraph_api7GraphDB5FlushEv"></span><span id="lgraph_api::GraphDB::Flush"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Flush</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB5FlushEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Flushes buffered data to disk. If there have been some async transactions, there could be data that are written to this graph, but not persisted to disk yet. Calling <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a0e2644b2df3c228e8d71a55b60723f31"><span class="std std-ref">Flush()</span></a> will persist the data and prevent data loss in case of system crash. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB11DropAllDataEv">
+<span id="_CPPv3N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="_CPPv2N10lgraph_api7GraphDB11DropAllDataEv"></span><span id="lgraph_api::GraphDB::DropAllData"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a784e2f7141aaed6b547faaaf52e87880"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB11DropAllDataEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Drop all the data in the graph, including labels, indexes and vertexes/edges.. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv">
+<span id="_CPPv3N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="_CPPv2N10lgraph_api7GraphDB13DropAllVertexEv"></span><span id="lgraph_api::GraphDB::DropAllVertex"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad51e4783ef7de143949c05311a0f2b54"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DropAllVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13DropAllVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Drop all vertex and edges but keep the labels and indexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19EstimateNumVerticesEv"></span><span id="lgraph_api::GraphDB::EstimateNumVertices"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a8434ac9ad087a3f57b96f6c8bed664d6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EstimateNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19EstimateNumVerticesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Estimate number of vertices. We don’t maintain the exact number of vertices, but only the next vid. This function actually returns the next vid to be used. So if you have deleted a lot of vertices, the result can be quite different from actual number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Estimated number of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions"></span><span id="lgraph_api::GraphDB::AddVertexLabel__ssCR.std::vector:FieldSpec:CR.VertexOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0c0f79500ca028b8342cc6af9b363c83"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="lgraph_api::VertexOptions"><span class="n"><span class="pre">VertexOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK13VertexOptions" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if the schema is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>primary_field</strong> – The primary field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteVertexLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6d74b689bd295b71c8857f26b77cb4a2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexLabelERKNSt6stringEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes a vertex label and all the vertices with this label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a15a25572790ab89a16815409cbc5a869"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes fields in a vertex label. This function also updates the vertex data and indices accordingly to make sure the database remains in consistent state. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or some fields cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – Labels of the fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1abdca8d18155cbb711386a18d8f206c66"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fields to a vertex label. The new fields in existing vertices will be filled with default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field already exists.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The add fields. </p></li>
+<li><p><strong>default_values</strong> – The default values of the newly added fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterVertexLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3becea45eab0d50d4c09232b211944d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterVertexLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25AlterVertexLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify fields in a vertex label, either chage the data type or optional, or both. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field not found, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The new specification of the modified fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of modified vertices.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions"></span><span id="lgraph_api::GraphDB::AddEdgeLabel__ssCR.std::vector:FieldSpec:CR.EdgeOptionsCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3c5434fc9c650a6f09465c32db1b16d2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fds</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">options</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeLabelERKNSt6stringERKNSt6vectorI9FieldSpecEERK11EdgeOptions" title="永久链接至目标"></a><br></dt>
+<dd><p>Add a edge label, specifying its schema. It is allowed to specify edge constrains, too. An edge can be bound to several (source_label, destination_label) pairs, which makes sure this type of edges will only be added between these types of vertices. By default, the constain is empty, meaning that the edge is not restricted. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – if invalid schema (invalid specification, re- definition of the same field, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>fds</strong> – The field specifications. </p></li>
+<li><p><strong>temporal_field</strong> – The temporal field for tid. </p></li>
+<li><p><strong>edge_constraints</strong> – (Optional) The edge constraints. An empty constrain means no restriction.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t"></span><span id="lgraph_api::GraphDB::DeleteEdgeLabel__ssCR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0bf6aee53c6c7412806a6a1dcdcd6377"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeLabel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeLabelERKNSt6stringEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes an edge label and all the edges of this type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of deleted edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE"></span><span id="lgraph_api::GraphDB::AlterLabelModEdgeConstraints__ssCR.std::vector:std::pair:ss.ss::CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a7ab2ca321e3bd68c1a9f33aeaa3bd747"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterLabelModEdgeConstraints</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB28AlterLabelModEdgeConstraintsERKNSt6stringERKNSt6vectorINSt4pairINSt6stringENSt6stringEEEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify edge constraint. Existing edges that violate the new constrain will be removed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any vertex label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>constraints</strong> – The new edge constraint.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelDelFields__ssCR.std::vector:ss:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a08241fee881005b37982621a31fb5e00"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelDelFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">del_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelDelFieldsERKNSt6stringERKNSt6vectorINSt6stringEEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes fields in an edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or cannot be deleted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>del_fields</strong> – The fields to be deleted. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[out]</strong> (Optional) If non-null, return the number of edges modified.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelAddFields__ssCR.std::vector:FieldSpec:CR.std::vector:FieldData:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab43144d999e3f539a42c5aa6a4ec21c0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelAddFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">add_fields</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">default_values</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelAddFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEERKNSt6vectorI9FieldDataEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fields to an edge label. The new fields in existing edges will be set to default values. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field already exists, or the default value is of incompatible type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>add_fields</strong> – The fields to add. </p></li>
+<li><p><strong>default_values</strong> – The default values. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the edge label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t">
+<span id="_CPPv3N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="_CPPv2N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t"></span><span id="lgraph_api::GraphDB::AlterEdgeLabelModFields__ssCR.std::vector:FieldSpec:CR.sP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aae83cf6042c04347d6cc6147289bced0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AlterEdgeLabelModFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">mod_fields</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_modified</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AlterEdgeLabelModFieldsERKNSt6stringERKNSt6vectorI9FieldSpecEEP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify fields in an edge label. Data type and OPTIONAL can be modified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist, or is of incompatible data type.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>mod_fields</strong> – The modifier fields. </p></li>
+<li><p><strong>n_modified</strong> – <strong>[inout]</strong> (Optional) If non-null, return the number of modified edges.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the label does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddVertexIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4e0da14c082f2be3f4d29ef888daad64"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB14AddVertexIndexERKNSt6stringERKNSt6stringE9IndexType" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field</strong> – The field name. </p></li>
+<li><p><strong>is_unique</strong> – True if is unique index, false if not.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType"></span><span id="lgraph_api::GraphDB::AddEdgeIndex__ssCR.ssCR.IndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1aa33f376759b00da1070c16167f8650bf"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12AddEdgeIndexERKNSt6stringERKNSt6stringE9IndexType" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an index to ‘label:field’. This function blocks until the index is fully created. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist, or not indexable.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>is_unique</strong> – True if the field content is unique for each vertex.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType">
+<span id="_CPPv3N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType"></span><span id="_CPPv2N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType"></span><span id="lgraph_api::GraphDB::AddVertexCompositeIndex__ssCR.std::vector:ss:CR.CompositeIndexType"></span><span class="target" id="classlgraph__api_1_1GraphDB_1afffc035485855bc3f44ef01bd488d64b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fields</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="lgraph_api::CompositeIndexType"><span class="n"><span class="pre">CompositeIndexType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23AddVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE18CompositeIndexType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Check if this vertex_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Check if this edge_label:field is indexed. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label:field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if index exists, false if label:field exists but not indexed. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::GraphDB::IsVertexCompositeIndexed__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a2f37f96ce8798934819071be98abb901"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexCompositeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24IsVertexCompositeIndexedERKNSt6stringERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a5dd0b2831686ab10c9cf641b1f5a04c8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17DeleteVertexIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the index to ‘vertex_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::GraphDB::DeleteVertexCompositeIndex__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac9bde44178388ef9fce8ca86b28d6a4b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fields</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26DeleteVertexCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0b04c7d95efa608199ffd43074698a26"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB15DeleteEdgeIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the index to ‘edge_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB14GetDescriptionEv"></span><span id="lgraph_api::GraphDB::GetDescriptionC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a10eafac774946c9fda6acd8368e6b254"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDescription</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB14GetDescriptionEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get graph description </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The description. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv">
+<span id="_CPPv3NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="_CPPv2NK10lgraph_api7GraphDB10GetMaxSizeEv"></span><span id="lgraph_api::GraphDB::GetMaxSizeC"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3cd10a9d8a077a9b838fecc8d894550c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetMaxSize</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7GraphDB10GetMaxSizeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get maximum graph size </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The maximum size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a1f9045086aaa5274c657b8020ed8d314"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB22AddVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fulltext index to ‘vertex_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::AddEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ad67d845d1e7c6d3a230ebca0eac15138"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20AddEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Add fulltext index to ‘edge_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteVertexFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a0e2d13791623a99511d3d743e811097b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteVertexFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB25DeleteVertexFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘vertex_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if vertex label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vertex_label</strong> – The vertex label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::GraphDB::DeleteEdgeFullTextIndex__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ab7e3ee69c450474f77d621b7310b1621"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteEdgeFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB23DeleteEdgeFullTextIndexERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Delete the fulltext index of ‘edge_label:field’ </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if edge label or field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>edge_label</strong> – The edge label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the fulltext index does not exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE"></span><span id="lgraph_api::GraphDB::RebuildFullTextIndex__std::set:ss:CR.std::set:ss:CR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a6902d07efdba3ff5c2be81311534e752"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RebuildFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_labels</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_labels</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB20RebuildFullTextIndexERKNSt3setINSt6stringEEERKNSt3setINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Rebuild the fulltext index of <code class="docutils literal notranslate"><span class="pre">vertex_labels</span></code> and <code class="docutils literal notranslate"><span class="pre">edge_labels</span></code>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_labels</strong> – The vertex labels whose fulltext index need to rebuild. </p></li>
+<li><p><strong>edge_labels</strong> – The edge labels whose fulltext index need to rebuild. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv">
+<span id="_CPPv3N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="_CPPv2N10lgraph_api7GraphDB19ListFullTextIndexesEv"></span><span id="lgraph_api::GraphDB::ListFullTextIndexes"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ae2b1b58ffc70106433bee030842e3e27"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListFullTextIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB19ListFullTextIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List fulltext indexes of vertex and edge </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Format of returned data : (is_vertex, label_name, property_name) </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryVertexByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a696a8bc40c23002921ccd4983b1e2550"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryVertexByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB26QueryVertexByFullTextIndexERKNSt6stringERKNSt6stringEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Query vertex by fulltext index. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The vertex label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Vertex vids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi">
+<span id="_CPPv3N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="_CPPv2N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi"></span><span id="lgraph_api::GraphDB::QueryEdgeByFullTextIndex__ssCR.ssCR.i"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a4f09813ea8812322180569bd2b48fe05"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">QueryEdgeByFullTextIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">top_n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB24QueryEdgeByFullTextIndexERKNSt6stringERKNSt6stringEi" title="永久链接至目标"></a><br></dt>
+<dd><p>Query edge by fulltext index </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if label does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>label</strong> – The edge label. </p></li>
+<li><p><strong>query</strong> – Lucene query language. </p></li>
+<li><p><strong>top_n</strong> – return top n data.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Edge uids and score. Throws exception on error. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB12RefreshCountEv">
+<span id="_CPPv3N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="_CPPv2N10lgraph_api7GraphDB12RefreshCountEv"></span><span id="lgraph_api::GraphDB::RefreshCount"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ade8d799b8354403e99298d493a3509f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshCount</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB12RefreshCountEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Recount the total number of vertex and edge, stop writing during the count </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGraphDB</span></span></span> – Thrown when currently <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called on a <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> with read-only access level. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDB7GraphDBERK7GraphDB"></span><span id="lgraph_api::GraphDB::GraphDB__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3ea21ec359220a8c4e0ea72adb0c1ba0"></span><span class="sig-name descname"><span class="n"><span class="pre">GraphDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="lgraph_api::GraphDB::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB7GraphDBERK7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd><p>Copying is disabled. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB">
+<span id="_CPPv3N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="_CPPv2N10lgraph_api7GraphDBaSERK7GraphDB"></span><span id="lgraph_api::GraphDB::assign-operator__GraphDBCR"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a3bc8ff8539363d5511d9a6936bae7899"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDBaSERK7GraphDB" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB3db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB3db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB3db_E"></span><span id="lgraph_api::GraphDB::db___lgraph::AccessControlledDBP"></span><span class="target" id="classlgraph__api_1_1GraphDB_1a35f581fb0d14734506768c1a61296979"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">AccessControlledDB</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB17should_delete_db_E">
+<span id="_CPPv3N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="_CPPv2N10lgraph_api7GraphDB17should_delete_db_E"></span><span id="lgraph_api::GraphDB::should_delete_db___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac2e6f7ca5ee0fc92e2579a7de9303eac"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">should_delete_db_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB17should_delete_db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7GraphDB10read_only_E">
+<span id="_CPPv3N10lgraph_api7GraphDB10read_only_E"></span><span id="_CPPv2N10lgraph_api7GraphDB10read_only_E"></span><span id="lgraph_api::GraphDB::read_only___b"></span><span class="target" id="classlgraph__api_1_1GraphDB_1ac22ad4698a78f7e4ab74ec4450647125"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">read_only_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7GraphDB10read_only_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-index-iterator">
+<h2>lgraph_edge_index_iterator<a class="headerlink" href="#lgraph-edge-index-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorE"></span><span id="lgraph_api::EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> can be used to access a set of edges that has the same indexed value. If the index is unique (that is, each Edge has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> will only have one edge unique id, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> is valid iff it points to a valid (index_value, euid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator"><span class="std std-ref">EdgeIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ae51a6e1b90b7343b4012be9cc7ae3daa"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERR17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a584635e9e5d92688527dbae26f926f80"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERR17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratorD0Ev"></span><span id="lgraph_api::EdgeIndexIterator::~EdgeIndexIterator"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aa1bb455fd404e4102a0e6b637283db00"></span><span class="sig-name descname"><span class="n"><span class="pre">~EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator5CloseEv"></span><span id="lgraph_api::EdgeIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator7IsValidEv"></span><span id="lgraph_api::EdgeIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4NextEv"></span><span id="lgraph_api::EdgeIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next edge unique id in the list, which consists of all the valid edge unique ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::EdgeIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator13GetIndexValueEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the current index value. The euids are sorted in ( EdgeIndexValue, euid) order. When <a class="reference internal" href="#classlgraph__api_1_1EdgeIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one euid to next, possibly moving from one EdgeIndexValue to another. This function tells the EdgeIndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetUidEv"></span><span id="lgraph_api::EdgeIndexIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetUidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the Edge Unique Id </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetSrcEv"></span><span id="lgraph_api::EdgeIndexIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetSrcEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator6GetDstEv"></span><span id="lgraph_api::EdgeIndexIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator6GetDstEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv"></span><span id="lgraph_api::EdgeIndexIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api17EdgeIndexIterator9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__lgraph::EdgeIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a2266e13c0886456df166e683e4a04cc5"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERRN6lgraph17EdgeIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::EdgeIndexIterator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1acd1c7e3f9d88fcc2a2fa0dbdbb5b2bf8"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="lgraph_api::EdgeIndexIterator::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator17EdgeIndexIteratorERK17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator"></span><span id="lgraph_api::EdgeIndexIterator::assign-operator__EdgeIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1abda22c9f1d7924e06efe4e12a1986292"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIteratoraSERK17EdgeIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator3it_E"></span><span id="lgraph_api::EdgeIndexIterator::it___std::unique_ptr:lgraph::EdgeIndexIterator:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a8c447e8d8d6d5ae41372b160dec982b1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">EdgeIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api17EdgeIndexIterator4txn_E"></span><span id="lgraph_api::EdgeIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1EdgeIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17EdgeIndexIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-edge-iterator">
+<h2>lgraph_edge_iterator<a class="headerlink" href="#lgraph-edge-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph5graphE">
+<span id="_CPPv3N6lgraph5graphE"></span><span id="_CPPv2N6lgraph5graphE"></span><span id="lgraph::graph"></span><span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph5graphE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aa64cc73da05613af93f74fbba0e40685"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a92a989ca7aa12f6bf9312acca6a24b9d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK15OutEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1aae356ade132bced19db97d69e2693926"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::eq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1ad917857534c392eb3de3718007839e87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apieqERK14InEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1acae8199afd0a5a7026d057a2ede19e29"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__OutEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a623f694634f9b740f6e8432ad5e8fed7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK15OutEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.OutEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a145cb4680fe351655b20bcefbf1d10c6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator"></span><span id="lgraph_api::neq-operator__InEdgeIteratorCR.InEdgeIteratorCR"></span><span class="target" id="namespacelgraph__api_1a46e696695da45853cbeb5905719210fa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_apineERK14InEdgeIteratorRK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd><p>Check whether lhs and rhs points to the same edge. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> can be used to iterate through the in-coming edges of a vertex. Edges are sorted in (lid, tid, src, eid) order, and each (dst, lid, tid, src, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> is valid iff it points to a valid in-coming edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last in-coming edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a73ca326056d2877cea6b09a683b8c0ba"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERR14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a20741057cf223945a84f2ebe4cb73b2f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERR14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratorD0Ev"></span><span id="lgraph_api::InEdgeIterator::~InEdgeIterator"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a299e60d91351d2ceb0da9445d3d53ab9"></span><span class="sig-name descname"><span class="n"><span class="pre">~InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator5CloseEv"></span><span id="lgraph_api::InEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4NextEv"></span><span id="lgraph_api::InEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next incoming edge to current destination vertex. If there is no more edge, the iterator becomes invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::InEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4GotoE7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Go to the edge specified by euid. If the specified edge cannot be found and nearest==true, then try to get the next in-coming edge to the vertex euid.dst, sorted by (label, tid, src, eid). If there is no such edge, iterator is invalidated and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetUidEv"></span><span id="lgraph_api::InEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetUidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the Edge Unique Id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetSrcEv"></span><span id="lgraph_api::InEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetSrcEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator6GetDstEv"></span><span id="lgraph_api::InEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator6GetDstEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets destination vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::InEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::InEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator13GetTemporalIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets temporal id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The temporal id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator7IsValidEv"></span><span id="lgraph_api::InEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetLabelEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetLabelEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::InEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::InEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::InEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8GetFieldE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field_name </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14InEdgeIteratorixE6size_t"></span><span id="lgraph_api::InEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIteratorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::InEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator12GetAllFieldsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>All field names and values stored as a {(field_name, field_value),…} map. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::InEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator8SetFieldE6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if field does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::InEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any field does not exist or field value type is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator6DeleteEv"></span><span id="lgraph_api::InEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator6DeleteEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next incoming edge sorted by (lid, tid, src, eid) if there is any. If no in-coming edge is left for this vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown if the transaction is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown if the iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown if called inside a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14InEdgeIterator8ToStringEv"></span><span id="lgraph_api::InEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14InEdgeIterator8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__lgraph::graph::InEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a92769487b9004274f36dccbc5b26dc1d"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERRN6lgraph5graph14InEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::InEdgeIterator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1aaf872d62e0bcd4680527d2c086433151"></span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="lgraph_api::InEdgeIterator::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator14InEdgeIteratorERK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator">
+<span id="_CPPv3N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="_CPPv2N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator"></span><span id="lgraph_api::InEdgeIterator::assign-operator__InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a5110071efc6781255ae9ce68e3634205"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIteratoraSERK14InEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator3it_E"></span><span id="lgraph_api::InEdgeIterator::it___std::unique_ptr:lgraph::graph::InEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a17c31f91df04ddbd378b1d23c6c18568"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">InEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14InEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14InEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14InEdgeIterator4txn_E"></span><span id="lgraph_api::InEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1InEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14InEdgeIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_edge_iterator.h&gt;</em></div>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> can be used to iterate through the out-going edges of a vertex. Edges are sorted in (lid, dst, eid) order, and each (src, lid, tid, dst, eid) tuple is guaranteed to uniquely identify an edge. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> is valid iff it points to a valid out-going edge, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> for non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"><span class="std std-ref">Goto()</span></a> with the id of a non-existing edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"><span class="std std-ref">Delete()</span></a> on the last out-going edge.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"><span class="std std-ref">Close()</span></a> on the iterator.</p></li>
+</ol>
+<p></p>
+<p>In TuGraph, every iterator belongs to a transaction, and can only be used when the transaction is valid. Calling member functions on an iterator inside an invalid transaction yields InvalidTxn, except for Invalid(). </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1abab68117b55783f6c38a899396f169a3"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERR15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorRR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a088017d735536fa934b5fb2cba592e43"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERR15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratorD0Ev"></span><span id="lgraph_api::OutEdgeIterator::~OutEdgeIterator"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa0e08e47018ad64858af8310913383b1"></span><span class="sig-name descname"><span class="n"><span class="pre">~OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator5CloseEv"></span><span id="lgraph_api::OutEdgeIterator::Close"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a89634b2f140e79d6fd93030747f9e927"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator. The iterator turns invalid after being closed. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb"></span><span id="lgraph_api::OutEdgeIterator::Goto__EdgeUid.b"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a13a70a437c20c75202f8920f4530286f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4GotoE7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Go to the edge specified by euid. That is, an edge from Vertex euid.src to euid.dst, with LabelId==euid.label, Tid==euid.tid, and EdgeId==euid.eid. If neareast==true and the exact edge was not found, the iterator tries to get the next edge that sorts after the specified edge. The edges are sorted in (label, tid, dst, eid) order. The iterator becomes invalid if there is no outgoing edge from euid.src that sorts after euid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique ID. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to get the nearest edge if the specified one cannot be found.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if there is no such edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator7IsValidEv"></span><span id="lgraph_api::OutEdgeIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a472f705194218179e9cf26ffb288da6c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4NextEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4NextEv"></span><span id="lgraph_api::OutEdgeIterator::Next"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next edge. Invalidates iterator if there is no more out edges from current source vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails (no more out edge from current source). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetUidEv"></span><span id="lgraph_api::OutEdgeIterator::GetUidC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af021703045cdd2a486c60f2da9bc758c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetUidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the Edge Unique Id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The UID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetDstEv"></span><span id="lgraph_api::OutEdgeIterator::GetDstC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a511087e98143aacee7b1ee02c4dee32e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDst</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetDstEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets destination of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The destination vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a99c4a11cae5751166a8508f572038ac9"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac5e6f9b3945c9efe2e6d1ebaafa1696f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator13GetTemporalIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets primary id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The primary id of the edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator6GetSrcEv"></span><span id="lgraph_api::OutEdgeIterator::GetSrcC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aabf59d0f49bc83fdf9a837c3d9d441f7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrc</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator6GetSrcEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the source vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The source vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetLabelEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetLabelEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the label of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator10GetLabelIdEv"></span><span id="lgraph_api::OutEdgeIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ac3fdb21de91fe0206abf93167ad5ce"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::OutEdgeIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator9GetFieldsERKNSt6vectorI6size_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t"></span><span id="lgraph_api::OutEdgeIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8GetFieldE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field_name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – The name of the field to get.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIteratorixE6size_t"></span><span id="lgraph_api::OutEdgeIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIteratorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field id. FieldId can be obtained with txn.GetEdgeFieldId() </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>fid</strong> – fid The field id.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv"></span><span id="lgraph_api::OutEdgeIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator12GetAllFieldsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>All fields in a dictionary of {(field_name, field_value),…}. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::OutEdgeIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator8SetFieldE6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value in string representation. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::OutEdgeIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator6DeleteEv"></span><span id="lgraph_api::OutEdgeIterator::Delete"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ac2e5aab0612d67400354a4fe71278a21"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator6DeleteEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes this edge. The iterator will point to the next out-going edge sorted by (label, tid, dst, eid) if there is any. If there is no more out-going edges for this source vertex, the iterator becomes invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api15OutEdgeIterator8ToStringEv"></span><span id="lgraph_api::OutEdgeIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15OutEdgeIterator8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of the edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A std::string that represents this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__lgraph::graph::OutEdgeIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aec68967791b2a1c92ff94c646853c14a"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERRN6lgraph5graph15OutEdgeIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructors are private, use <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"><span class="std std-ref">Transaction::GetInEdgeIterator()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"><span class="std std-ref">VertexIterator::GetInEdgeIterator()</span></a> instead. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::OutEdgeIterator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1ab98d1e207b5ecce1a7dcea1478577558"></span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="lgraph_api::OutEdgeIterator::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator15OutEdgeIteratorERK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator">
+<span id="_CPPv3N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="_CPPv2N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator"></span><span id="lgraph_api::OutEdgeIterator::assign-operator__OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a65896ed24e13cd2af266a344a655419c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIteratoraSERK15OutEdgeIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator3it_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator3it_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator3it_E"></span><span id="lgraph_api::OutEdgeIterator::it___std::unique_ptr:lgraph::graph::OutEdgeIterator:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1aa9051f34e34c3c714096054e271c72a0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">OutEdgeIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15OutEdgeIterator4txn_E">
+<span id="_CPPv3N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="_CPPv2N10lgraph_api15OutEdgeIterator4txn_E"></span><span id="lgraph_api::OutEdgeIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1OutEdgeIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15OutEdgeIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">VertexIterator</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-exceptions">
+<h2>lgraph_exceptions<a class="headerlink" href="#lgraph-exceptions" title="永久链接至标题"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.ERROR_CODES">
+<span class="target" id="lgraph__exceptions_8h_1a202796cec2c73e6a15b8ae40423102d2"></span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#c.ERROR_CODES" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.X">
+<span class="target" id="lgraph__exceptions_8h_1a1f09736ce2d0b353925675b9c17f9b58"></span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="n"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.X" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THROW_CODE">
+<span class="target" id="lgraph__exceptions_8h_1a0a6acbf1c6c9172f6be1c808cfa03f10"></span><span class="sig-name descname"><span class="n"><span class="pre">THROW_CODE</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">code</span></span>, <span class="p"><span class="pre">...</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.THROW_CODE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCodeE">
+<span id="_CPPv3N10lgraph_api9ErrorCodeE"></span><span id="_CPPv2N10lgraph_api9ErrorCodeE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05f"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCode</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode1XE">
+<span id="_CPPv3N10lgraph_api9ErrorCode1XE"></span><span id="_CPPv2N10lgraph_api9ErrorCode1XE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa13397c15c68eb3e5e33a0196e8988a24"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">X</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode1XE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE">
+<span id="_CPPv3N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span id="_CPPv2N10lgraph_api9ErrorCode11ERROR_CODESE"></span><span class="target" id="namespacelgraph__api_1a59e56af19e754a6aa26a612ebf91d05fa0afdd4a4fb13896180b64bd313a17dc2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ERROR_CODES</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ErrorCode11ERROR_CODESE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode">
+<span id="_CPPv3N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="_CPPv2N10lgraph_api17ErrorCodeToStringE9ErrorCode"></span><span id="lgraph_api::ErrorCodeToString__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a13525881a01e59b5a69b74c47d95dcd3"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeToString</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17ErrorCodeToStringE9ErrorCode" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode">
+<span id="_CPPv3N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="_CPPv2N10lgraph_api13ErrorCodeDescE9ErrorCode"></span><span id="lgraph_api::ErrorCodeDesc__ErrorCode"></span><span class="target" id="namespacelgraph__api_1a82ab07d2676a279295157e65beeedcbc"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">ErrorCodeDesc</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13ErrorCodeDescE9ErrorCode" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphExceptionE">
+<span id="_CPPv3N10lgraph_api15LgraphExceptionE"></span><span id="_CPPv2N10lgraph_api15LgraphExceptionE"></span><span id="lgraph_api::LgraphException"></span><span class="target" id="classlgraph__api_1_1LgraphException"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><span class="n"><span class="pre">exception</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphExceptionE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_exceptions.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aa1104fdb0328ecad056440c0498affa5"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCode" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.ssCR"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af986a8520040b3af5568e7f4f2b3d813"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodeRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc">
+<span id="_CPPv3N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="_CPPv2N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc"></span><span id="lgraph_api::LgraphException::LgraphException__ErrorCode.cCP"></span><span class="target" id="classlgraph__api_1_1LgraphException_1af81b58e697be8127dd1310a7297a886b"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">msg</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts">
+<span id="_CPPv3IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span id="_CPPv2IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="p"><span class="pre">...</span></span><span class="sig-name descname"><span class="n"><span class="pre">Ts</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1LgraphException_1a8cc576c0c99e4c712a0fc91ca67868fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LgraphException</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">format</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="lgraph_api::LgraphException::LgraphException::Ts"><span class="n"><span class="pre">Ts</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">...</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">ds</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4IDpEN10lgraph_api15LgraphException15LgraphExceptionE9ErrorCodePKcDpRK2Ts" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4codeEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4codeEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4codeEv"></span><span id="lgraph_api::LgraphException::codeC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a833a074d2f56630e12d5c66e6ebb5862"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4codeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException3msgEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException3msgEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException3msgEv"></span><span id="lgraph_api::LgraphException::msgC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1e6c05d855e126b4ecfaa8241f8cca33"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">msg</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException3msgEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api15LgraphException4whatEv">
+<span id="_CPPv3NK10lgraph_api15LgraphException4whatEv"></span><span id="_CPPv2NK10lgraph_api15LgraphException4whatEv"></span><span id="lgraph_api::LgraphException::whatC"></span><span class="target" id="classlgraph__api_1_1LgraphException_1aac1c33909e01e1dfc85617cf2477d3eb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">what</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="k"><span class="pre">noexcept</span></span><span class="w"> </span><span class="k"><span class="pre">override</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api15LgraphException4whatEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5code_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5code_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5code_E"></span><span id="lgraph_api::LgraphException::code___ErrorCode"></span><span class="target" id="classlgraph__api_1_1LgraphException_1ac8cce82dda9537fdb72dac589a6ac5f2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ErrorCodeE" title="lgraph_api::ErrorCode"><span class="n"><span class="pre">ErrorCode</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">code_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5code_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException4msg_E">
+<span id="_CPPv3N10lgraph_api15LgraphException4msg_E"></span><span id="_CPPv2N10lgraph_api15LgraphException4msg_E"></span><span id="lgraph_api::LgraphException::msg___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a1da24fcb3b81cddc8a32815f13997437"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">msg_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException4msg_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LgraphException5what_E">
+<span id="_CPPv3N10lgraph_api15LgraphException5what_E"></span><span id="_CPPv2N10lgraph_api15LgraphException5what_E"></span><span id="lgraph_api::LgraphException::what___ss"></span><span class="target" id="classlgraph__api_1_1LgraphException_1a415baaef606c6f5e5e1104719a84dc72"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">what_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LgraphException5what_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-galaxy">
+<h2>lgraph_galaxy<a class="headerlink" href="#lgraph-galaxy" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyE">
+<span id="_CPPv3N10lgraph_api6GalaxyE"></span><span id="_CPPv2N10lgraph_api6GalaxyE"></span><span id="lgraph_api::Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_galaxy.h&gt;</em></div>
+<p>A galaxy is the storage engine for one TuGraph instance. It manages a set of User/Role/GraphDBs. </p>
+<p>A galaxy can be opened in async mode, in which case <em>ALL</em> write transactions will be treated as async, whether they declare async or not. This can come in handy if we are performing a lot of writing, but can cause data loss for online processing. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aff4d727c87112ab1ae56882ed7c90ae8"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringEbb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The TuGraph dir. </p></li>
+<li><p><strong>durable</strong> – (Optional) True to open in durable mode. If set to false, ALL write transactions are async, whether they declare async or not. </p></li>
+<li><p><strong>create_if_not_exist</strong> – (Optional) If true, the TuGraph DB will be created if dir does not exist; otherwise, an exception is thrown. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb"></span><span id="lgraph_api::Galaxy::Galaxy__ssCR.ssCR.ssCR.b.b"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac04eaf83ff6ed47d4e77bbcb06b432f5"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">dir</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">durable</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">create_if_not_exist</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERKNSt6stringERKNSt6stringERKNSt6stringEbb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor. Open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> and try to login with specified user and password. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">DBNotExist</span></span></span> – Thrown if DB does not exist and create_if_not_exist is false. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">IOError</span></span></span> – Thrown if DB does not exist, but we failed to create the DB due to IO error. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if there are other input errors. e.g., dir is actually a plain file, or DB is corruptted. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is not correct.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>dir</strong> – The dir. </p></li>
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>durable</strong> – True to open the <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a> in durable mode. </p></li>
+<li><p><strong>create_if_not_exist</strong> – True to create if DB does not exist. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERR6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a57bcd86daa9d4cdbfb367a0e43d8b039"></span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERR6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERR6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyRR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aead55554e77f85378cd82ece56cfde96"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERR6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyD0Ev">
+<span id="_CPPv3N10lgraph_api6GalaxyD0Ev"></span><span id="_CPPv2N10lgraph_api6GalaxyD0Ev"></span><span id="lgraph_api::Galaxy::~Galaxy"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a00577f1737a890a15dbd7b409a2f1cd8"></span><span class="sig-name descname"><span class="n"><span class="pre">~Galaxy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetCurrentUser__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ac428a8a912bf43cf72c9a908ef6c7c15"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetCurrentUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy14SetCurrentUserERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Validate and set current user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user/password is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy7SetUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a568523d4c1b5a1cde2fafa5fd2d702f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy7SetUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set current user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if token is incorrect.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The current user. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t"></span><span id="lgraph_api::Galaxy::CreateGraph__ssCR.ssCR.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a480909a8d20e7b8a904030fc5be34da0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">description</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">max_size</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="m"><span class="pre">1</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">40</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11CreateGraphERKNSt6stringERKNSt6stringE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Validate token and set current user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to create graph. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Other input errors such as invalid graph name, size, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph to create. description (Optional) Description of the graph. max_size (Optional) Maximum size of the graph.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if graph already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteGraph__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1f0d94b15f7b718f6aa4f1dc01656f0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DeleteGraphERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Delete a graph </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to delete graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>graph_name</strong> – Name of the graph.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the graph does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t">
+<span id="_CPPv3N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="_CPPv2N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t"></span><span id="lgraph_api::Galaxy::ModGraph__ssCR.b.ssCR.b.s"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4d8cdf497e81b2b9d1fc95f980319a0a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ModGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_name</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mod_size</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">new_max_size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy8ModGraphERKNSt6stringEbRKNSt6stringEb6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Modify graph info </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to modify graph.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph_name</strong> – Name of the graph. </p></li>
+<li><p><strong>mod_desc</strong> – True to modifier description. </p></li>
+<li><p><strong>desc</strong> – The new description. </p></li>
+<li><p><strong>mod_size</strong> – True to modifier size. </p></li>
+<li><p><strong>new_max_size</strong> – New maximum size.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy10ListGraphsEv"></span><span id="lgraph_api::Galaxy::ListGraphsC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a4c64be90601e4a55971798b4272ebf"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListGraphs</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy10ListGraphsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List graphs </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission to list graphs.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A dictionary of {graph_name: (description, max_size)} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateUser__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a97e43d10d6b95de4d68ca3c7919bcacb"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateUserERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Creates a user </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if other input errors, such as illegal user name, password, etc.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+<li><p><strong>desc</strong> – (Optional) The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab111a438ea5f846881da6c03d3e34115"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetPassword__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a29f197aed82ca28992c87b797b5e4186"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetPassword</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">old_password</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">new_password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetPasswordERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the password of the specified user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission, or curr_user==user, but old_password is incorrect. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if new_password is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user to modify. </p></li>
+<li><p><strong>old_password</strong> – The old password, required if curr_user==user. </p></li>
+<li><p><strong>new_password</strong> – The new password.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetUserDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aca1ba2352c5365a0e82f522d79b51219"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetUserDescERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets user description. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>desc</strong> – The new description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Galaxy::SetUserRoles__ssCR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7a0c5796bfe855125cf1b3675c4a3b87"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserRoles</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">roles</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy12SetUserRolesERKNSt6stringERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the roles of the specified user. If you need to add or delete a role, you will need to use GetUserInfo to get the roles first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if any role does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>roles</strong> – A list of roles.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel"></span><span id="lgraph_api::Galaxy::SetUserGraphAccess__ssCR.ssCR.AccessLevelCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3f0fcfae10bf1776e39ecc3205fc6c85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetUserGraphAccess</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy18SetUserGraphAccessERKNSt6stringERKNSt6stringERK11AccessLevel" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets user access rights on a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>access</strong> – The access level.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if it user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a0edfd7185553ceb6c81f303acdbf163c"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Disable a user. A disabled user is not able to login or perform any operation. A user cannot disable itself. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user to disable.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableUserERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableUser__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1af07907500b4d6142b9416e74df4557a4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableUser</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableUserERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Enables the user. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if user does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListUsersEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListUsersEv"></span><span id="lgraph_api::Galaxy::ListUsersC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a55e8c41afb9c217b63872b76b1486691"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListUsers</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListUsersEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List all users </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A dictionary of {user_name:user_info} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetUserInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ab5010716ab86c5f6650672ce885c4bd9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8UserInfoE" title="lgraph_api::UserInfo"><span class="n"><span class="pre">UserInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUserInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetUserInfoERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets user information </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>user</strong> – The user.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The user information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::CreateRole__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a550aaacf7d2580baf77c3eb7706cafd7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CreateRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10CreateRoleERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Create a role. A role has different access levels to different graphs. Every user must be assigned some role to get access to graphs. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role already exists. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DeleteRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1add07dbe39e13e5c47e82c4b621963d7f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10DeleteRoleERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes the role described by role </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::DisableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6007103b069eebe456d17e6035c763ce"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DisableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11DisableRoleERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Disable a role. A disabled role still has the data, but is not effective. i.e., users will not have access rights to graphs that are obtained by having this role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if the role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE"></span><span id="lgraph_api::Galaxy::EnableRole__ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a88b1cf70763b8f517a8a67fd70f45ba6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EnableRole</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy10EnableRoleERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Enables the role. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::SetRoleDesc__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a09988e113e9709e0ae2d8a9ae55bfd97"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleDesc</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy11SetRoleDescERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the description of the specified role </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or desc is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>desc</strong> – The description.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRights__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7da90a98fb519cf1557c82f9780bf2aa"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRights</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy19SetRoleAccessRightsERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set access of the role to graphs. If you need to add or remove access to part of the graphs, you need to get full graph_access map by using GetRoleInfo first. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE">
+<span id="_CPPv3N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="_CPPv2N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE"></span><span id="lgraph_api::Galaxy::SetRoleAccessRightsIncremental__ssCR.std::map:ss.AccessLevel:CR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3ad7fb60a0413742007dceff71f34f9b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetRoleAccessRightsIncremental</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph_access</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy30SetRoleAccessRightsIncrementalERKNSt6stringERKNSt3mapINSt6stringE11AccessLevelEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Incrementally modify the access right of the specified role. For example, for a role that has access right {graph1:READ, graph2:WRITE}, calling this function with graph_access={graph2:READ, graph3:FULL} will set the access right of this role to {graph1:READ, graph2:READ, graph3:FULL} </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name or any of the graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>role</strong> – The role. </p></li>
+<li><p><strong>graph_access</strong> – The graph access.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, false if role does not exist. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetRoleInfo__ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a3d2426344ffa4ccd2c3d99af236bbc83"></span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetRoleInfo</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">role</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy11GetRoleInfoERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets role information </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if role name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>role</strong> – The role.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The role information. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9ListRolesEv">
+<span id="_CPPv3NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="_CPPv2NK10lgraph_api6Galaxy9ListRolesEv"></span><span id="lgraph_api::Galaxy::ListRolesC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1ae420054434acdb37d8d242926c2eece7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api8RoleInfoE" title="lgraph_api::RoleInfo"><span class="n"><span class="pre">RoleInfo</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListRoles</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9ListRolesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List all the roles </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A dictionary of {role_name:<a class="reference internal" href="#structlgraph__api_1_1RoleInfo"><span class="std std-ref">RoleInfo</span></a>} </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Galaxy::GetAccessLevel__ssCR.ssCRC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a9b5d700cf67ddcd6dc08a73271034c66"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAccessLevel</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy14GetAccessLevelERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the access level that the specified user have to the graph </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if user name or graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>user</strong> – The user. </p></li>
+<li><p><strong>graph</strong> – The graph.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The access level. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb">
+<span id="_CPPv3NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="_CPPv2NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb"></span><span id="lgraph_api::Galaxy::OpenGraph__ssCR.bC"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a6fb2b45705dfd8a1b6b357e12a40c53d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OpenGraph</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Galaxy9OpenGraphERKNSt6stringEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Opens a graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidGalaxy</span></span></span> – Thrown if current galaxy is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">Unauthorized</span></span></span> – Thrown if user does not have permission. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown if graph name is illegal.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>graph</strong> – The graph. </p></li>
+<li><p><strong>read_only</strong> – (Optional) True to open in read-only mode. A read-only <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> cannot be written to.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5CloseEv">
+<span id="_CPPv3N10lgraph_api6Galaxy5CloseEv"></span><span id="_CPPv2N10lgraph_api6Galaxy5CloseEv"></span><span id="lgraph_api::Galaxy::Close"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this <a class="reference internal" href="#classlgraph__api_1_1Galaxy"><span class="std std-ref">Galaxy</span></a>, turning it into an invalid state. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE"></span><span id="lgraph_api::Galaxy::Galaxy__lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a18b1851884f7ba7148f9488f0669212a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyEPN6lgraph6GalaxyE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6Galaxy6GalaxyERK6Galaxy"></span><span id="lgraph_api::Galaxy::Galaxy__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1aa5da67d606e1c4a26b0733a2f0082f1a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Galaxy</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="lgraph_api::Galaxy::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy6GalaxyERK6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy">
+<span id="_CPPv3N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="_CPPv2N10lgraph_api6GalaxyaSERK6Galaxy"></span><span id="lgraph_api::Galaxy::assign-operator__GalaxyCR"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a4ea0661db673b9f0f9e2d4fd01cfa2a3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6GalaxyE" title="lgraph_api::Galaxy"><span class="n"><span class="pre">Galaxy</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6GalaxyaSERK6Galaxy" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy5user_E">
+<span id="_CPPv3N10lgraph_api6Galaxy5user_E"></span><span id="_CPPv2N10lgraph_api6Galaxy5user_E"></span><span id="lgraph_api::Galaxy::user___ss"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a17442452651ea1479fa7d0e652f90810"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy5user_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Galaxy3db_E">
+<span id="_CPPv3N10lgraph_api6Galaxy3db_E"></span><span id="_CPPv2N10lgraph_api6Galaxy3db_E"></span><span id="lgraph_api::Galaxy::db___lgraph::GalaxyP"></span><span class="target" id="classlgraph__api_1_1Galaxy_1a1d7badecbe92fb1d1d48f412eb80beef"></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Galaxy</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Galaxy3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-result">
+<h2>lgraph_result<a class="headerlink" href="#lgraph-result" title="永久链接至标题"></a></h2>
+<p>Result interface for plugins and built-in procedures. The result of a plugin should be provided in this format in order for the Cypher engine and the graph visualizer to understand. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv46cypher">
+<span id="_CPPv36cypher"></span><span id="_CPPv26cypher"></span><span id="cypher"></span><span class="target" id="namespacecypher"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher</span></span></span><a class="headerlink" href="#_CPPv46cypher" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordE">
+<span id="_CPPv3N10lgraph_api6RecordE"></span><span id="_CPPv2N10lgraph_api6RecordE"></span><span id="lgraph_api::Record"></span><span class="target" id="classlgraph__api_1_1Record"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p>You only initialize the class by <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> instance. <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a> provide some insert method to insert data to the record. eg. Insert, InsertVertexByID, InsertEdgeByID. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERK6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERK6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERK6Record"></span><span id="lgraph_api::Record::Record__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1ac650ba988b5c162c621cabf07c18d497"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERK6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERR6Record">
+<span id="_CPPv3N10lgraph_api6Record6RecordERR6Record"></span><span id="_CPPv2N10lgraph_api6Record6RecordERR6Record"></span><span id="lgraph_api::Record::Record__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1adb1c42c8dbe94932471cc2fa3b1de7a6"></span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="lgraph_api::Record::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERR6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERK6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERK6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERK6Record"></span><span id="lgraph_api::Record::assign-operator__RecordCR"></span><span class="target" id="classlgraph__api_1_1Record_1a820a033a9bfbbf0a1a0cff6ae779c715"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERK6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6RecordaSERR6Record">
+<span id="_CPPv3N10lgraph_api6RecordaSERR6Record"></span><span id="_CPPv2N10lgraph_api6RecordaSERR6Record"></span><span id="lgraph_api::Record::assign-operator__RecordRR"></span><span class="target" id="classlgraph__api_1_1Record_1ab8d2b9aec7327774226f29c455791dad"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6RecordaSERR6Record" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Record::Insert__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Record_1a38f91b3aee5d1880237939f77fd5c2fb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>fv</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.int64_tC.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a171dbf3555be4830b723f1963518c8d2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringEK7int64_tPN10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertVertexByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId </p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.EdgeUidR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a0947956a5583ac30f6437ccba45e6dbc"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringER7EdgeUidPN10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. You can get properties and label from the interface, this is different from InsertEdgeByID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>euid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p></li>
+<li><p><strong>txn</strong> – <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t">
+<span id="_CPPv3N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="_CPPv2N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t"></span><span id="lgraph_api::Record::InsertVertexByID__ssCR.int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a0445d0d62a48711ddef6e9988bd0fa09"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertVertexByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record16InsertVertexByIDERKNSt6stringE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – Field name you defined earlier. </p></li>
+<li><p><strong>vid</strong> – VertextId. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid">
+<span id="_CPPv3N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="_CPPv2N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid"></span><span id="lgraph_api::Record::InsertEdgeByID__ssCR.EdgeUidCR"></span><span class="target" id="classlgraph__api_1_1Record_1abede73c241382ea0e55f76b90e3a7f42"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InsertEdgeByID</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">uid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record14InsertEdgeByIDERKNSt6stringERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – title name you defined earlier. </p></li>
+<li><p><strong>uid</strong> – <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1af585894e04343f4c80843dcdebdbef9d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14VertexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>vit</strong> – <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::InEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1a1f507fb00296a8e04f98a391ec597ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">ieit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api14InEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>ieit</strong> – <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE"></span><span id="lgraph_api::Record::Insert__ssCR.lgraph_api::OutEdgeIteratorCR"></span><span class="target" id="classlgraph__api_1_1Record_1aa5d88aae93b2cf484beb632d88420adf"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">oeit</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN10lgraph_api15OutEdgeIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>oeit</strong> – <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a59b5dffacde269b5df6612c00771b9a1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">list</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>list</strong> – LIST OF <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE"></span><span id="lgraph_api::Record::Insert__ssCR.std::map:ss.FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Record_1a7d99978348600b14abe0049be705b625"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">map</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKNSt3mapINSt6stringE9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert a value to result table. You can insert a value by insert function, and value type must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>map</strong> – MAP OF &lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE"></span><span id="lgraph_api::Record::Insert__ssCR.traversal::PathCR.lgraph_api::TransactionP"></span><span class="target" id="classlgraph__api_1_1Record_1a527ac8a8e078306bcda8963a22813afb"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Insert</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fname</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversalE" title="lgraph_api::traversal"><span class="n"><span class="pre">traversal</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">path</span></span>, <a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6InsertERKNSt6stringERKN9traversal4PathEPN10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><p>insert value into result table. You can insert a value by the function, and value must be same as you defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>fname</strong> – one of title name you defined earlier. </p></li>
+<li><p><strong>path</strong> – Path of traverse api. </p></li>
+<li><p><strong>txn</strong> – Trasaction </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Record4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Record4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Record4SizeEv"></span><span id="lgraph_api::Record::SizeC"></span><span class="target" id="classlgraph__api_1_1Record_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Record4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the size of record. If record is empty, return 0, max size is not beyond the length of your defined param list </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Size of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Record6HasKeyERKNSt6stringE"></span><span id="lgraph_api::Record::HasKey__ssCR"></span><span class="target" id="classlgraph__api_1_1Record_1a2a2d1b3e4e37484e8bce95728db6b770"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HasKey</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6HasKeyERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Check a key is exist or not. The key is the one of titile your defined earlier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>key</strong> – The key.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if exsit, otherwise fasle. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Record::Record__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Record_1af5b8557af6ac3c8c4af28c7fc79a6b42"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Record</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6RecordERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6recordE">
+<span id="_CPPv3N10lgraph_api6Record6recordE"></span><span id="_CPPv2N10lgraph_api6Record6recordE"></span><span id="lgraph_api::Record::record__std::unordered_map:ss.std::shared_ptr:ResultElement::"></span><span class="target" id="classlgraph__api_1_1Record_1a2248d027c6bbadbd043ee858e5656d7a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">record</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6recordE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record6headerE">
+<span id="_CPPv3N10lgraph_api6Record6headerE"></span><span id="_CPPv2N10lgraph_api6Record6headerE"></span><span id="lgraph_api::Record::header__std::unordered_map:ss.LGraphType:"></span><span class="target" id="classlgraph__api_1_1Record_1a38c0d41af0c74862a17017322f4171d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record6headerE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Record7length_E">
+<span id="_CPPv3N10lgraph_api6Record7length_E"></span><span id="_CPPv2N10lgraph_api6Record7length_E"></span><span id="lgraph_api::Record::length___int64_t"></span><span class="target" id="classlgraph__api_1_1Record_1a5f8ae7abecbad53a2b4130540267cddf"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">length_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Record7length_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Result</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6ResultE">
+<span id="_CPPv3N10lgraph_api6ResultE"></span><span id="_CPPv2N10lgraph_api6ResultE"></span><span id="lgraph_api::Result"></span><span class="target" id="classlgraph__api_1_1Result"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6ResultE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_result.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a> table, result instance provide [MutableRecord], [ResetHeader], [Dump] and [Load] method. Table also provide some method to view content of table. For example, [Header] and [Recordview]. </p>
+<p>It’s worth noting that you are best to define your header before using result table. eg. auto result = <a class="reference internal" href="#classlgraph__api_1_1Result"><span class="std std-ref">Result</span></a>({title, LGraphType}…) If you do not define header and initialize by <a class="reference internal" href="#classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"><span class="std std-ref">Result()</span></a>, you will get a empty table without header, you just use the table after using [ResetHeader] method to set your header. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultEv">
+<span id="_CPPv3N10lgraph_api6Result6ResultEv"></span><span id="_CPPv2N10lgraph_api6Result6ResultEv"></span><span id="lgraph_api::Result::Result"></span><span class="target" id="classlgraph__api_1_1Result_1a6f00c89a8bbfd566f848740f9e563604"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aec54d6cf6ac1ac561febf2d4db046bd6"></span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::Result__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1adbe90e1fe046f2cd689d8dadd67177c9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Result</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResultERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result7GetTypeENSt6stringE"></span><span id="lgraph_api::Result::GetType__ss"></span><span class="target" id="classlgraph__api_1_1Result_1a1015a1bde96a85591fc70273ad140b35"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">title</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7GetTypeENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get type of title. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>title</strong> – One of titles in table.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>LGraphType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::vector:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1aa5f20d3711f82acbdd1fbf2ea28d5ece"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt6vectorINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE">
+<span id="_CPPv3N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="_CPPv2N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE"></span><span id="lgraph_api::Result::ResetHeader__std::initializer_list:std::pair:ss.LGraphType::CR"></span><span class="target" id="classlgraph__api_1_1Result_1a45a2260d7f28e56b5c3e5a7b94789766"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetHeader</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">initializer_list</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">header</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11ResetHeaderERKNSt16initializer_listINSt4pairINSt6stringE10LGraphTypeEEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset your header, the operation will clear the original data and header, please use the function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>header</strong> – List of &lt;title, LGraphType&gt; </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result13MutableRecordEv">
+<span id="_CPPv3N10lgraph_api6Result13MutableRecordEv"></span><span id="_CPPv2N10lgraph_api6Result13MutableRecordEv"></span><span id="lgraph_api::Result::MutableRecord"></span><span class="target" id="classlgraph__api_1_1Result_1ad4bea412e4aef69da8464dd0a83b2a64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">MutableRecord</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result13MutableRecordEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Create a new record in the table and return the record. The record is the reference of record in the table, if you want to modify the record, you must assign return value to a reference variable. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The reference of record. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result7ReserveE6size_t">
+<span id="_CPPv3N10lgraph_api6Result7ReserveE6size_t"></span><span id="_CPPv2N10lgraph_api6Result7ReserveE6size_t"></span><span id="lgraph_api::Result::Reserve__s"></span><span class="target" id="classlgraph__api_1_1Result_1a204d25ea43252cdf35dc6e859f765410"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reserve</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result7ReserveE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>This function attempts to reserve enough memory for the result vector to hold the specified number of elements. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api6Result6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api6Result6ResizeE6size_t"></span><span id="lgraph_api::Result::Resize__s"></span><span class="target" id="classlgraph__api_1_1Result_1a9b2c775a0d09660185780ee0a7ea6be1"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6ResizeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>This function will resize the vector to the specified number of elements </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result2AtE6size_t">
+<span id="_CPPv3N10lgraph_api6Result2AtE6size_t"></span><span id="_CPPv2N10lgraph_api6Result2AtE6size_t"></span><span id="lgraph_api::Result::At__s"></span><span class="target" id="classlgraph__api_1_1Result_1a030c64fc1715cdb057995bf9ff5870f6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">At</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result2AtE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Provides access to the data contained in the vector. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6HeaderEv">
+<span id="_CPPv3N10lgraph_api6Result6HeaderEv"></span><span id="_CPPv2N10lgraph_api6Result6HeaderEv"></span><span id="lgraph_api::Result::Header"></span><span class="target" id="classlgraph__api_1_1Result_1accfa1228e11954438cbaa8ad4d6be5e9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Header</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6HeaderEv" title="永久链接至目标"></a><br></dt>
+<dd><p>return header of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>header. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api6Result4SizeEv">
+<span id="_CPPv3NK10lgraph_api6Result4SizeEv"></span><span id="_CPPv2NK10lgraph_api6Result4SizeEv"></span><span id="lgraph_api::Result::SizeC"></span><span class="target" id="classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api6Result4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>return size of the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>table size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4DumpEb">
+<span id="_CPPv3N10lgraph_api6Result4DumpEb"></span><span id="_CPPv2N10lgraph_api6Result4DumpEb"></span><span id="lgraph_api::Result::Dump__b"></span><span class="target" id="classlgraph__api_1_1Result_1ac839e6ed0453fe8ed7fac29e9a6803d1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Dump</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_standard</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4DumpEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Serialize the table. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>is_standard</strong> – (Optional) If true, the result will serialize to a standard result, the standard result can be Visualized in web. If false, result will serialize a json object &amp;#8212; SDK result.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Serialize result. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api6Result4LoadERKNSt6stringE"></span><span id="lgraph_api::Result::Load__ssCR"></span><span class="target" id="classlgraph__api_1_1Result_1a405e30d792103a7989739a05f992c94a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Load</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">json</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result4LoadERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Deserialize data to result table. This will be clear original data and header, please use this function carefully. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>json</strong> – Json string to be deserialized. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result12ClearRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result12ClearRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result12ClearRecordsEv"></span><span id="lgraph_api::Result::ClearRecords"></span><span class="target" id="classlgraph__api_1_1Result_1af629a0e98c5fbb4adf85475b0073f48a"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClearRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result12ClearRecordsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Clear all the records, <a class="reference internal" href="#classlgraph__api_1_1Result_1a572bd92c25ebc67c72137fd59e53f6d6"><span class="std std-ref">Size()</span></a> will be 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10BoltHeaderEv">
+<span id="_CPPv3N10lgraph_api6Result10BoltHeaderEv"></span><span id="_CPPv2N10lgraph_api6Result10BoltHeaderEv"></span><span id="lgraph_api::Result::BoltHeader"></span><span class="target" id="classlgraph__api_1_1Result_1a18c695165355bb5431690e26af2a2d28"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltHeader</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10BoltHeaderEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result11BoltRecordsEv">
+<span id="_CPPv3N10lgraph_api6Result11BoltRecordsEv"></span><span id="_CPPv2N10lgraph_api6Result11BoltRecordsEv"></span><span id="lgraph_api::Result::BoltRecords"></span><span class="target" id="classlgraph__api_1_1Result_1a55a40428869f85c65c6dfa3389fe75dc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BoltRecords</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result11BoltRecordsEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result16MarkPythonDriverEb">
+<span id="_CPPv3N10lgraph_api6Result16MarkPythonDriverEb"></span><span id="_CPPv2N10lgraph_api6Result16MarkPythonDriverEb"></span><span id="lgraph_api::Result::MarkPythonDriver__b"></span><span class="target" id="classlgraph__api_1_1Result_1aac0dbd9e0db9031bf18adb7e7618aac6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MarkPythonDriver</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">is_python_driver</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result16MarkPythonDriverEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Mark that the result is returned to python driver. Python driver is special, use the virtual edge id instead of the real edge id </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10RecordViewE7int64_t">
+<span id="_CPPv3N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="_CPPv2N10lgraph_api6Result10RecordViewE7int64_t"></span><span id="lgraph_api::Result::RecordView__int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1abc994177cadf7bb0d070dd81ad8ea8b9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unordered_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">ResultElement</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">RecordView</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">row_num</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10RecordViewE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get record of the table, if row number is more bigger than max length of table, throw a exception. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>row_num</strong> – row number of the table.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>One <a class="reference internal" href="#classlgraph__api_1_1Record"><span class="std std-ref">Record</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6resultE">
+<span id="_CPPv3N10lgraph_api6Result6resultE"></span><span id="_CPPv2N10lgraph_api6Result6resultE"></span><span id="lgraph_api::Result::result__std::vector:Record:"></span><span class="target" id="classlgraph__api_1_1Result_1a81372de9efc3519cb68a6e51335acfd4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api6RecordE" title="lgraph_api::Record"><span class="n"><span class="pre">Record</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6resultE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6headerE">
+<span id="_CPPv3N10lgraph_api6Result6headerE"></span><span id="_CPPv2N10lgraph_api6Result6headerE"></span><span id="lgraph_api::Result::header__std::vector:std::pair:ss.LGraphType::"></span><span class="target" id="classlgraph__api_1_1Result_1ac1d5325a16b7b45115c0e32c73078d4d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">header</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6headerE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result10row_count_E">
+<span id="_CPPv3N10lgraph_api6Result10row_count_E"></span><span id="_CPPv2N10lgraph_api6Result10row_count_E"></span><span id="lgraph_api::Result::row_count___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0a15002d39b5391c9c693671d605e56c"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">row_count_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result10row_count_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result17is_python_driver_E">
+<span id="_CPPv3N10lgraph_api6Result17is_python_driver_E"></span><span id="_CPPv2N10lgraph_api6Result17is_python_driver_E"></span><span id="lgraph_api::Result::is_python_driver___b"></span><span class="target" id="classlgraph__api_1_1Result_1a8714076c1ee8bd005935652057221763"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_python_driver_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result17is_python_driver_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api6Result6v_eid_E">
+<span id="_CPPv3N10lgraph_api6Result6v_eid_E"></span><span id="_CPPv2N10lgraph_api6Result6v_eid_E"></span><span id="lgraph_api::Result::v_eid___int64_t"></span><span class="target" id="classlgraph__api_1_1Result_1a0c2a905250ba619da58c3592f54daea7"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">v_eid_</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api6Result6v_eid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">lgraph::StateMachine</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">cypher::PluginAdapter</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-rpc-client">
+<h2>lgraph_rpc_client<a class="headerlink" href="#lgraph-rpc-client" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410fma_common">
+<span id="_CPPv310fma_common"></span><span id="_CPPv210fma_common"></span><span id="fma_common"></span><span class="target" id="namespacefma__common"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fma_common</span></span></span><a class="headerlink" href="#_CPPv410fma_common" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv410lgraph_rpc">
+<span id="_CPPv310lgraph_rpc"></span><span id="_CPPv210lgraph_rpc"></span><span id="lgraph_rpc"></span><span class="target" id="namespacelgraph__rpc"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_rpc</span></span></span><a class="headerlink" href="#_CPPv410lgraph_rpc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryTypeE">
+<span id="_CPPv3N6lgraph14GraphQueryTypeE"></span><span id="_CPPv2N6lgraph14GraphQueryTypeE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType6CYPHERE">
+<span id="_CPPv3N6lgraph14GraphQueryType6CYPHERE"></span><span id="_CPPv2N6lgraph14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType6CYPHERE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph14GraphQueryType3GQLE">
+<span id="_CPPv3N6lgraph14GraphQueryType3GQLE"></span><span id="_CPPv2N6lgraph14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph14GraphQueryType3GQLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientTypeE">
+<span id="_CPPv3N6lgraph10ClientTypeE"></span><span id="_CPPv2N6lgraph10ClientTypeE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ClientType</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType20DIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a60813255cdc667f2d2f2ddb427d32d44"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType20DIRECT_HA_CONNECTIONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98ab892a078fa6077db32721c67735c56fd"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INDIRECT_HA_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType22INDIRECT_HA_CONNECTIONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE">
+<span id="_CPPv3N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span id="_CPPv2N6lgraph10ClientType17SINGLE_CONNECTIONE"></span><span class="target" id="namespacelgraph_1af7f22c7d662171af2c3a5b74f621dc98a43005cd0efa3b1e1373be596db0ee869"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SINGLE_CONNECTION</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph10ClientType17SINGLE_CONNECTIONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientE">
+<span id="_CPPv3N6lgraph9RpcClientE"></span><span id="_CPPv2N6lgraph9RpcClientE"></span><span id="lgraph::RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_rpc_client.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a8995083e1c9332090bdbbced0704b1b9"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE"></span><span id="lgraph::RpcClient::RpcClient__std::vector:ss:R.ss.ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a59ff51f4744de0edfe8571844287a51a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcClient</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">urls</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">user</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9RpcClientERNSt6vectorINSt6stringEEENSt6stringENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p><a class="reference internal" href="#classlgraph_1_1RpcClient"><span class="std std-ref">RpcClient</span></a> Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>urls</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClientD0Ev"></span><span id="lgraph::RpcClient::~RpcClient"></span><span class="target" id="classlgraph_1_1RpcClient_1a0f8219dbf08d58f7cfc0a853538176a4"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClientD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallCypher__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a456fdf97ad54654b985ebd5add140db3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a cypher query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallCypherToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1af9ef8ca1182193ef2c18062ecf23eeb7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypherToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18CallCypherToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a cypher query to leader </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE"></span><span id="lgraph::RpcClient::CallGql__ssR.ssCR.ssCR.b.double.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a7cfb10baca3d2f668a10ca43e399afc5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbdRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a gql query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling cypher. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::CallGqlToLeader__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a189850ee468b61a65982b7e505c8265b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGqlToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15CallGqlToLeaderERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a gql query to leader </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE"></span><span id="lgraph::RpcClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a93f4c769de4f1979e4ab824afdaa8ead"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEbRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> (Optional) Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::CallProcedureToLeader__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1a3e5b11b2f703f41d40a2afd9c7581376"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedureToLeader</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21CallProcedureToLeaderERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure to leader </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.ssCR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a0081b8bb075d1be82d8c92281d907cdc"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Load a built-in procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_file</strong> – <strong>[in]</strong> the source_file contain procedure code. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Load a built-in procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::ListProcedures__ssR.ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1aa090037a4c3944d76e3cbf8c07f569b0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">""</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>List user-defined procedures </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>url</strong> – <strong>[in]</strong> Node address of calling procedure. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient6LogoutEv"></span><span id="lgraph::RpcClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient6LogoutEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Client log out </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::IsReadQuery__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1a891d9b465df285ae69983ea3aabebde0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11IsReadQueryEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Determine whether it is a read-only query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClient__lgraph::GraphQueryType.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af77b4e340b5e79a7875f8f065fd221e5"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEN6lgraph14GraphQueryTypeERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>type</strong> – <strong>[in]</strong> inquire query type. </p></li>
+<li><p><strong>query</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient9GetClientEb">
+<span id="_CPPv3N6lgraph9RpcClient9GetClientEb"></span><span id="_CPPv2N6lgraph9RpcClient9GetClientEb"></span><span id="lgraph::RpcClient::GetClient__b"></span><span class="target" id="classlgraph_1_1RpcClient_1ac3415aee2cca8ddb4c12473be63f42a2"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClient</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">isReadQuery</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient9GetClientEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Return rpc client based on whether it is a read-only query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>isReadQuery</strong> – <strong>[in]</strong> read query or not. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Master rpc client if cypher is not read-only, slaver rpc client if cypher is read-only. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE"></span><span id="lgraph::RpcClient::GetClientByNode__ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1af935a15699e0f1004779a265afd67c0a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetClientByNode</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15GetClientByNodeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the client according to the node url </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>url</strong> – <strong>[in]</strong> Node address of client connection. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Rpc client connecting to url. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient27RefreshUserDefinedProcedureEv"></span><span id="lgraph::RpcClient::RefreshUserDefinedProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1af85d15b19d971fbe1babd8d06f5ae2c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshUserDefinedProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient27RefreshUserDefinedProcedureEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh User-defined Procedure </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv">
+<span id="_CPPv3N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="_CPPv2N6lgraph9RpcClient23RefreshBuiltInProcedureEv"></span><span id="lgraph::RpcClient::RefreshBuiltInProcedure"></span><span class="target" id="classlgraph_1_1RpcClient_1a5d1a4ee81316d67c4d000e598ef41fec"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshBuiltInProcedure</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23RefreshBuiltInProcedureEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh Built-in Procedure </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshClientPoolEv"></span><span id="lgraph::RpcClient::RefreshClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1ab683309ba410ef5c7c65ed6a08b085d9"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshClientPoolEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh the client connection pool according to the cluster status </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv">
+<span id="_CPPv3N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="_CPPv2N6lgraph9RpcClient21LoadBalanceClientPoolEv"></span><span id="lgraph::RpcClient::LoadBalanceClientPool"></span><span class="target" id="classlgraph_1_1RpcClient_1a9b83e575619171ca739b140ffe024207"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadBalanceClientPool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21LoadBalanceClientPoolEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Load balance the client pool </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient17RefreshConnectionEv">
+<span id="_CPPv3N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="_CPPv2N6lgraph9RpcClient17RefreshConnectionEv"></span><span id="lgraph::RpcClient::RefreshConnection"></span><span class="target" id="classlgraph_1_1RpcClient_1a8957fe9842f100f0e80778649ab7ba14"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RefreshConnection</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient17RefreshConnectionEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Refresh client pool, procedure info </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F">
+<span id="_CPPv3I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span id="_CPPv2I0EN6lgraph9RpcClient16DoubleCheckQueryERK1F"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">F</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph_1_1RpcClient_1a83227aa710bb0fb4cd66dc7e4b00af5a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DoubleCheckQuery</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="lgraph::RpcClient::DoubleCheckQuery::F"><span class="n"><span class="pre">F</span></span></a><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">f</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN6lgraph9RpcClient16DoubleCheckQueryEbRK1F" title="永久链接至目标"></a><br></dt>
+<dd><p>If an exception is thrown in the query, refresh the connection and re-execute </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_typeE">
+<span id="_CPPv3N6lgraph9RpcClient11client_typeE"></span><span id="_CPPv2N6lgraph9RpcClient11client_typeE"></span><span id="lgraph::RpcClient::client_type__ClientType"></span><span class="target" id="classlgraph_1_1RpcClient_1a376acacd121bd1f972b5fb097e220fd9"></span><a class="reference internal" href="#_CPPv4N6lgraph10ClientTypeE" title="lgraph::ClientType"><span class="n"><span class="pre">ClientType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_type</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient4userE"></span><span id="lgraph::RpcClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4userE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient8passwordE"></span><span id="lgraph::RpcClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient8passwordE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11base_clientE">
+<span id="_CPPv3N6lgraph9RpcClient11base_clientE"></span><span id="_CPPv2N6lgraph9RpcClient11base_clientE"></span><span id="lgraph::RpcClient::base_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a58adfed74cd9daeb6b32a267039e925b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">base_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11base_clientE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient4urlsE">
+<span id="_CPPv3N6lgraph9RpcClient4urlsE"></span><span id="_CPPv2N6lgraph9RpcClient4urlsE"></span><span id="lgraph::RpcClient::urls__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a306ada97a24c8198c1a0c9c3c5b0bb25"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">urls</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient4urlsE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient13leader_clientE">
+<span id="_CPPv3N6lgraph9RpcClient13leader_clientE"></span><span id="_CPPv2N6lgraph9RpcClient13leader_clientE"></span><span id="lgraph::RpcClient::leader_client__std::shared_ptr:lgraph::RpcClient::RpcSingleClient:"></span><span class="target" id="classlgraph_1_1RpcClient_1a13cc47368956dc5404b8c30b89c359f9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">leader_client</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient13leader_clientE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient11client_poolE">
+<span id="_CPPv3N6lgraph9RpcClient11client_poolE"></span><span id="_CPPv2N6lgraph9RpcClient11client_poolE"></span><span id="lgraph::RpcClient::client_pool__std::deque:std::shared_ptr:lgraph::RpcClient::RpcSingleClient::"></span><span class="target" id="classlgraph_1_1RpcClient_1a844140b131b865884e1233813d5ed217"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">deque</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClientE" title="lgraph::RpcClient"><span class="n"><span class="pre">RpcClient</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="lgraph::RpcClient::RpcSingleClient"><span class="n"><span class="pre">RpcSingleClient</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">client_pool</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient11client_poolE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient19built_in_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient19built_in_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient19built_in_proceduresE"></span><span id="lgraph::RpcClient::built_in_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1a18060c9aed7ccf4e945b9f88d03142d2"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">built_in_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient19built_in_proceduresE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient23user_defined_proceduresE">
+<span id="_CPPv3N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="_CPPv2N6lgraph9RpcClient23user_defined_proceduresE"></span><span id="lgraph::RpcClient::user_defined_procedures__nlohmann::json"></span><span class="target" id="classlgraph_1_1RpcClient_1aea4d05a8b62f0732342d07a9495616cf"></span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user_defined_procedures</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="p"><span class="pre">{</span></span><span class="p"><span class="pre">}</span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient23user_defined_proceduresE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient21cypher_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient21cypher_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient21cypher_write_constantE"></span><span id="lgraph::RpcClient::cypher_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a632dd8c3163187f7e6faa9271b7b4cfc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cypher_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient21cypher_write_constantE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient18gql_write_constantE">
+<span id="_CPPv3N6lgraph9RpcClient18gql_write_constantE"></span><span id="_CPPv2N6lgraph9RpcClient18gql_write_constantE"></span><span id="lgraph::RpcClient::gql_write_constant__std::vector:ss:"></span><span class="target" id="classlgraph_1_1RpcClient_1a9ec0e77daff8924f52eb7f2e177cc1fc"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">gql_write_constant</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient18gql_write_constantE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientE"></span><span id="lgraph::RpcClient::RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientE" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::RpcSingleClient__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae26aab72012bcb1ee86fb02e92a9613d"></span><span class="sig-name descname"><span class="n"><span class="pre">RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">url</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">user</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">password</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15RpcSingleClientERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>RpcSingleClient Login. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>url</strong> – Login address. </p></li>
+<li><p><strong>user</strong> – The username. </p></li>
+<li><p><strong>password</strong> – The password. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClientD0Ev"></span><span id="lgraph::RpcClient::RpcSingleClient::~RpcSingleClient"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a1a143a1804f6bf71869b0ee5a6dc1462"></span><span class="sig-name descname"><span class="n"><span class="pre">~RpcSingleClient</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClientD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE"></span><span id="lgraph::RpcClient::RpcSingleClient::Restore__std::vector:BackupLogEntry:CR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abff1fd14918bd3ca71f8a272f47d38c5"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Restore</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">BackupLogEntry</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">requests</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7RestoreERKNSt6vectorI14BackupLogEntryEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::LoadProcedure__ssR.std::vector:ss:CR.ssCR.ssCR.ssCR.ssCR.b.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aa972f97de06754627150767d7809f011"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">source_files</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">code_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_description</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">read_only</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"v1"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13LoadProcedureERNSt6stringERKNSt6vectorINSt6stringEEERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbRKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Load a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>source_files</strong> – <strong>[in]</strong> the source_file list contain procedure code(only for code_type cpp) </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>code_type</strong> – <strong>[in]</strong> code type, currently supported PY, SO, CPP, ZIP. </p></li>
+<li><p><strong>procedure_description</strong> – <strong>[in]</strong> procedure description. </p></li>
+<li><p><strong>read_only</strong> – <strong>[in]</strong> procedure is read only or not. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb"></span><span id="lgraph::RpcClient::RpcSingleClient::CallProcedure__ssR.ssCR.ssCR.ssCR.double.b.ssCR.b"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2b0a265853b25e1e9b36de7acc58c470"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">param</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">procedure_time_out</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0.0</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_process</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13CallProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEdbRKNSt6stringEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>param</strong> – <strong>[in]</strong> the execution parameters. </p></li>
+<li><p><strong>procedure_time_out</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted. </p></li>
+<li><p><strong>in_process</strong> – <strong>[in]</strong> (Optional) support in future. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json， Otherwise, binary format. </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::ListProcedures__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a44431b16908099e6e5134afbe127ab63"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListProcedures</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">version</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"any"</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14ListProceduresERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>List user-defined procedures </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> (Optional) the procedure type, “” for all procedures, CPP and PY for special type. </p></li>
+<li><p><strong>version</strong> – <strong>[in]</strong> (Optional) the version of procedure. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph::RpcClient::RpcSingleClient::DeleteProcedure__ssR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad005df9e86dce72d2953abf20c0f3f85"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DeleteProcedure</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_type</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">procedure_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient15DeleteProcedureERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a user-defined procedure </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>procedure_type</strong> – <strong>[in]</strong> the procedure type, currently supported CPP and PY. </p></li>
+<li><p><strong>procedure_name</strong> – <strong>[in]</strong> procedure name. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromFile__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abd0ca5419539fa5588446421cf1bd2ee"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient20ImportSchemaFromFileERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema_file</strong> – <strong>[in]</strong> the schema_file contain schema. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromFile__ssR.ssCR.ssCR.b.i.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1abb553bafed1931f0b23190634a32c842"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromFile</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">conf_file</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">skip_packages</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient18ImportDataFromFileERNSt6stringERKNSt6stringERKNSt6stringEbiiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from file </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>conf_file</strong> – <strong>[in]</strong> data file contain format description and data. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>skip_packages</strong> – <strong>[in]</strong> (Optional) skip packages number. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportSchemaFromContent__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aded7509ddab23675c3ca2341048b5196"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportSchemaFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">schema</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23ImportSchemaFromContentERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge schema from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>schema</strong> – <strong>[in]</strong> the schema to be imported. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::ImportDataFromContent__ssR.ssCR.ssCR.ssCR.b.i.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a8bd821f0ff70ff0ec5215ea3bc3a02b3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ImportDataFromContent</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">desc</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">delimiter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">continue_on_error</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span>, <span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">thread_nums</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient21ImportDataFromContentERNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringEbiRKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Import vertex or edge data from content string </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>desc</strong> – <strong>[in]</strong> data format description. </p></li>
+<li><p><strong>data</strong> – <strong>[in]</strong> the data to be imported. </p></li>
+<li><p><strong>delimiter</strong> – <strong>[in]</strong> data separator. </p></li>
+<li><p><strong>continue_on_error</strong> – <strong>[in]</strong> (Optional) whether to continue when importing data fails. </p></li>
+<li><p><strong>thread_nums</strong> – <strong>[in]</strong> (Optional) maximum number of threads. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallCypher__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1aff1bfcba1cd1754363bb2adf51db086a"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallCypher</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient10CallCypherERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a cypher query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>cypher</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::CallGql__ssR.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a2fb61a89fc5e431b2433d52059467be0"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CallGql</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">result</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">gql</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"default"</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7CallGqlERNSt6stringERKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a gql query </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>result</strong> – <strong>[out]</strong> The result. </p></li>
+<li><p><strong>gql</strong> – <strong>[in]</strong> inquire statement. </p></li>
+<li><p><strong>graph</strong> – <strong>[in]</strong> (Optional) the graph to query. </p></li>
+<li><p><strong>json_format</strong> – <strong>[in]</strong> (Optional) Returns the format， true is json，Otherwise, binary format. </p></li>
+<li><p><strong>timeout</strong> – <strong>[in]</strong> (Optional) Maximum execution time, overruns will be interrupted.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, false if it fails. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6GetUrlEv"></span><span id="lgraph::RpcClient::RpcSingleClient::GetUrl"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ad4d20fca6bae3f93f4d1e714aacb03cd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetUrl</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6GetUrlEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the url of single client. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>the url of single client. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient6LogoutEv"></span><span id="lgraph::RpcClient::RpcSingleClient::Logout"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a83581631b98984ecc1053a07d492fe87"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Logout</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient6LogoutEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Client log out </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleRequest__LGraphRequestP"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a61415af9341546df1ad67eed0ea2dbaa"></span><span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleRequest</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">LGraphRequest</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">req</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient13HandleRequestEP13LGraphRequest" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd"></span><span id="lgraph::RpcClient::RpcSingleClient::HandleGraphQueryRequest__lgraph::GraphQueryType.LGraphResponseP.ssCR.ssCR.b.double"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a63cc8e69616efdad5460f648780a6bb2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">HandleGraphQueryRequest</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph14GraphQueryTypeE" title="lgraph::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span>, <span class="n"><span class="pre">LGraphResponse</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">res</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">query</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">graph</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">json_format</span></span>, <span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">timeout</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient23HandleGraphQueryRequestEN6lgraph14GraphQueryTypeEP14LGraphResponseRKNSt6stringERKNSt6stringEbd" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse"></span><span id="lgraph::RpcClient::RpcSingleClient::GraphQueryResponseExtractor__GraphQueryResponseCR"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a4eb9039c5c4d7e1bd1c065e71aaa75d4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryResponseExtractor</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">GraphQueryResponse</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">cypher</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient27GraphQueryResponseExtractorERK18GraphQueryResponse" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient3urlE"></span><span id="lgraph::RpcClient::RpcSingleClient::url__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ae43c7d8d482ec3550b30cbc7dc23b9f0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">url</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient3urlE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4userE"></span><span id="lgraph::RpcClient::RpcSingleClient::user__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a6dfa0071362986f2680867cd51fa2ea8"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">user</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4userE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient8passwordE"></span><span id="lgraph::RpcClient::RpcSingleClient::password__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a36531f1b290721250b384bbae34f9f1f"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">password</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient8passwordE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient5tokenE"></span><span id="lgraph::RpcClient::RpcSingleClient::token__ss"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a9f7d94df8d0a73f04a003fe5032ba32d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">token</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient5tokenE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient14server_versionE"></span><span id="lgraph::RpcClient::RpcSingleClient::server_version__int64_t"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a3de46036a491e337d41dba033c215120"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">server_version</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient14server_versionE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7channelE"></span><span id="lgraph::RpcClient::RpcSingleClient::channel__std::shared_ptr:lgraph_rpc::m_channel:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1ac34b00e3851c29e651d8ca31fe21a9be"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">channel</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7channelE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient4cntlE"></span><span id="lgraph::RpcClient::RpcSingleClient::cntl__std::shared_ptr:lgraph_rpc::m_controller:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a7d9cee7bb74b09c0ff1b71d2a1b4ef8d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_controller</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cntl</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient4cntlE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE">
+<span id="_CPPv3N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="_CPPv2N6lgraph9RpcClient15RpcSingleClient7optionsE"></span><span id="lgraph::RpcClient::RpcSingleClient::options__std::shared_ptr:lgraph_rpc::m_channel_options:"></span><span class="target" id="classlgraph_1_1RpcClient_1_1RpcSingleClient_1a18a1c01a5579128138eeddb758b305d6"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv410lgraph_rpc" title="lgraph_rpc"><span class="n"><span class="pre">lgraph_rpc</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">m_channel_options</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">options</span></span></span><a class="headerlink" href="#_CPPv4N6lgraph9RpcClient15RpcSingleClient7optionsE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-traversal">
+<h2>lgraph_traversal<a class="headerlink" href="#lgraph-traversal" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalE">
+<span id="_CPPv3N10lgraph_api9traversalE"></span><span id="_CPPv2N10lgraph_api9traversalE"></span><span id="lgraph_api::traversal"></span><span class="target" id="namespacelgraph__api_1_1traversal"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">traversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalE" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb">
+<span id="_CPPv3N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span id="_CPPv2N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a726096df46599bdfb914a6ca3420ec96"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FindVertices</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">filter</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal12FindVerticesER7GraphDBR11TransactionNSt8functionIFbR14VertexIteratorEEEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Retrieve all vertices passing the specified filter. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>filter</strong> – <strong>[inout]</strong> The user-defined filter function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The corresponding list of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb">
+<span id="_CPPv3I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span id="_CPPv2I0EN10lgraph_api9traversal17ExtractVertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1aceb3385f1d10f71f5d9aa46fcdd92915"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">frontier</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="lgraph_api::traversal::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal17ExtractVertexDataE14ParallelVectorI10VertexDataER7GraphDBR11TransactionR14ParallelVectorI6size_tENSt8functionIFvR14VertexIteratorR10VertexDataEEEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Extract data from specified vertices. Note that if the transaction is not read-only, parallel will be ignored (i.e. parallelism will not be available). </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">模板参数</dt>
+<dd class="field-even"><p><strong>VertexData</strong> – Type of the vertex data. </p>
+</dd>
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The database. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>frontier</strong> – <strong>[inout]</strong> The vertices to extract data from. </p></li>
+<li><p><strong>extract</strong> – <strong>[inout]</strong> The user-defined extract function. </p></li>
+<li><p><strong>parallel</strong> – (Optional) Enable parallelism or not.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The corresponding extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT">
+<span id="_CPPv3I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span id="_CPPv2I0EN10lgraph_api9traversal13DefaultFilterER2IT"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a860101673fe319842615891bdce356d5"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DefaultFilter</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="lgraph_api::traversal::DefaultFilter::IT"><span class="n"><span class="pre">IT</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal13DefaultFilterEbR2IT" title="永久链接至目标"></a><br></dt>
+<dd><p>The default filter you may use. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>it</strong> – <strong>[inout]</strong> An iterator class.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Always true. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a0be095f6cae74a9b2b83368bcaa8bb9d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Function closure filtering by label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>label</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span id="_CPPv2I0EN10lgraph_api9traversal11LabelEqualsE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IT</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1traversal_1a916a3c242ae9447471b4116416ac3200"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="lgraph_api::traversal::LabelEquals::IT"><span class="n"><span class="pre">IT</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelEquals</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api9traversal11LabelEqualsENSt8functionIFbR2ITEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Function closure filtering by label id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>IT</strong> – Type of the iterator. </p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>label_id</strong> – An iterator class.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversaleqERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::eq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a787283b8c440e78fe08f3233ec9927d1"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK6VertexRK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversalneERK6VertexRK6Vertex"></span><span id="lgraph_api::traversal::neq-operator__VertexCR.VertexCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a5a867323375932ba84f360b8f7ba104d"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK6VertexRK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversaleqERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::eq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1aca364480fdfefebade068076c782085e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversaleqERK4EdgeRK4Edge" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge">
+<span id="_CPPv3N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="_CPPv2N10lgraph_api9traversalneERK4EdgeRK4Edge"></span><span id="lgraph_api::traversal::neq-operator__EdgeCR.EdgeCR"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a2360c3785fed893a88cc4ab67d8a56de"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversalneERK4EdgeRK4Edge" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE">
+<span id="_CPPv3N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="_CPPv2N10lgraph_api9traversal15MAX_RESULT_SIZEE"></span><span id="lgraph_api::traversal::MAX_RESULT_SIZE__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a19036385f876c801d15c194fc62e7531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE">
+<span id="_CPPv3N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="_CPPv2N10lgraph_api9traversal18TRAVERSAL_PARALLELE"></span><span id="lgraph_api::traversal::TRAVERSAL_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a86e405bbe2ac6d2a74230ae2305fd8e0"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal18TRAVERSAL_PARALLELE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE">
+<span id="_CPPv3N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="_CPPv2N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE"></span><span id="lgraph_api::traversal::TRAVERSAL_ALLOW_REVISITS__s"></span><span class="target" id="namespacelgraph__api_1_1traversal_1a92a5114a7f6be9af4e24557fa238f8b7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TRAVERSAL_ALLOW_REVISITS</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal24TRAVERSAL_ALLOW_REVISITSE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4EdgeE">
+<span id="_CPPv3N10lgraph_api9traversal4EdgeE"></span><span id="_CPPv2N10lgraph_api9traversal4EdgeE"></span><span id="lgraph_api::traversal::Edge"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent an edge. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb"></span><span id="lgraph_api::traversal::Edge::Edge__s.uint16_t.uint64_t.s.s.b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5fa8e10b10d8db22077e6a8f51c56a4f"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">start</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span>, <span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">tid</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">end</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">eid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">forward</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeE6size_t8uint16_t8uint64_t6size_t6size_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>start</strong> – The start. </p></li>
+<li><p><strong>lid</strong> – The lid. </p></li>
+<li><p><strong>tid</strong> – The tid. </p></li>
+<li><p><strong>end</strong> – The end. </p></li>
+<li><p><strong>eid</strong> – The eid. </p></li>
+<li><p><strong>forward</strong> – True to forward. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4EdgeERK4Edge"></span><span id="lgraph_api::traversal::Edge::Edge__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1accd38aace77501c9cf5cae967e894970"></span><span class="sig-name descname"><span class="n"><span class="pre">Edge</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="lgraph_api::traversal::Edge::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4EdgeERK4Edge" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge14GetStartVertexEv"></span><span id="lgraph_api::traversal::Edge::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge14GetStartVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the start vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The start vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetEndVertexEv"></span><span id="lgraph_api::traversal::Edge::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetEndVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the end vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The end vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge10GetLabelIdEv"></span><span id="lgraph_api::traversal::Edge::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a15b074c85865e730723336acec71f79e"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the label ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The label ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge13GetTemporalIdEv"></span><span id="lgraph_api::traversal::Edge::GetTemporalIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a02537fe49ffb801dd20bdaae51b29325"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTemporalId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge13GetTemporalIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Temporal ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The temporal ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9GetEdgeIdEv"></span><span id="lgraph_api::traversal::Edge::GetEdgeIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a2592e180e605668b296b9251bc4d275a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9GetEdgeIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the edge ID. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The edge ID. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge9IsForwardEv"></span><span id="lgraph_api::traversal::Edge::IsForwardC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a41a01f6b828238200fef82f544fd172e"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsForward</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge9IsForwardEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the direction of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>true : forward; false: backward. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetSrcVertexEv"></span><span id="lgraph_api::traversal::Edge::GetSrcVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a5490526b0251ebb9ad277c9b314eedbb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetSrcVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetSrcVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the source vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The source vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Edge12GetDstVertexEv"></span><span id="lgraph_api::traversal::Edge::GetDstVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ab717cca464319d1b380648aedbaaca1d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetDstVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Edge12GetDstVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the destination vertex of this edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The destination vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge6start_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge6start_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge6start_E"></span><span id="lgraph_api::traversal::Edge::start___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1ad914f6be659b44fe8e11acc02cf6eeb6"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">start_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge6start_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4end_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4end_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4end_E"></span><span id="lgraph_api::traversal::Edge::end___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1afdac24f7adfe72f79983c12b08e566e5"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4end_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4eid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4eid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4eid_E"></span><span id="lgraph_api::traversal::Edge::eid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a74dfb17650dad72d071112c995343f25"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4eid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4lid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4lid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4lid_E"></span><span id="lgraph_api::traversal::Edge::lid___uint16_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a4b77269210d4ee2d997719c8dee806ea"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4lid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge4tid_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge4tid_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge4tid_E"></span><span id="lgraph_api::traversal::Edge::tid___int64_t"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1a6ec1f5936b6351a1911a966a8a08fd42"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge4tid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Edge8forward_E">
+<span id="_CPPv3N10lgraph_api9traversal4Edge8forward_E"></span><span id="_CPPv2N10lgraph_api9traversal4Edge8forward_E"></span><span id="lgraph_api::traversal::Edge::forward___b"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Edge_1aae1b80cda1e8b80f4a52f8a6d1f22df8"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">forward_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Edge8forward_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversalE"></span><span id="lgraph_api::traversal::FrontierTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversalE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> provides the most common way to traverse graphs. You can start from a single vertex or a set of vertices (known as the initial frontier), and expand them frontier by frontier, each time visiting neighboring vertices of the current frontier and make those matching specified conditions the new frontier. One powerful feature of <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> is that the traversal can be performed in parallel, accelerating those <em>deep</em> queries significantly. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::FrontierTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a545b378096e3004e11024a15fd17bd27"></span><span class="sig-name descname"><span class="n"><span class="pre">FrontierTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal17FrontierTraversalER7GraphDBR11Transaction6size_t6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a> object. Note that the transaction must be read- only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Be careful when TRAVERSAL_ALLOW_REVISITS is used, as each vertex may be visited more than once, making the result set huge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::FrontierTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a9c2251578e77394a41833329c9200e72"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11GetFrontierEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::FrontierTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierER14ParallelVectorI6size_tE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ae8aee8d3fccc6f15e21f0e5a4652c33e"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a79b977639f217d9411ac48a32c6e83f2"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad655c689b55d2072e9212b55ea015bb0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorEEENSt8functionIFbR14InEdgeIteratorEEENSt8functionIFbR14VertexIteratorEEENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. Note that the default value for the two filters (nullptr) means all the expansions of this level should succeed and enables some optimizations. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal5ResetEv"></span><span id="lgraph_api::traversal::FrontierTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal5ResetEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv"></span><span id="lgraph_api::traversal::FrontierTraversal::ResetVisited"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aaf986f1e13f0da831c3d8277cdb860f0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ResetVisited</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal12ResetVisitedEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset only the visited flags. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal3db_E"></span><span id="lgraph_api::traversal::FrontierTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal4txn_E"></span><span id="lgraph_api::traversal::FrontierTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal6flags_E"></span><span id="lgraph_api::traversal::FrontierTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal6flags_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::FrontierTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal13num_vertices_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::curr_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1a272d864e6eface58376c0d0c08c89401"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14curr_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::FrontierTraversal::next_frontier___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ad05308b798bf29c2e2e6fcf6331150c6"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal14next_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E">
+<span id="_CPPv3N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="_CPPv2N10lgraph_api9traversal17FrontierTraversal8visited_E"></span><span id="lgraph_api::traversal::FrontierTraversal::visited___ParallelBitset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1FrontierTraversal_1ac784cfc9970b0a1fb2e5a1678ed59284"></span><span class="n"><span class="pre">ParallelBitset</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">visited_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal17FrontierTraversal8visited_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelperE">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelperE"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelperE"></span><span id="lgraph_api::traversal::IteratorHelper"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1IteratorHelper"><span class="std std-ref">IteratorHelper</span></a> provides some useful methods, such as casting Vertex/Edge objects to their iterator forms. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction"></span><span id="lgraph_api::traversal::IteratorHelper::IteratorHelper__TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a7d72fd8bc5a5a60f16a5eea5b1ae781e"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IteratorHelper</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper14IteratorHelperER11Transaction" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a9db8a753c5773fd00186665e172e8df2"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd><p>Casting a <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> to a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vertex</strong> – A <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Vertex"><span class="std std-ref">Vertex</span></a> object.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> corresponding to vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4CastERK4Edge"></span><span id="lgraph_api::traversal::IteratorHelper::Cast__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1ab5ec73c9874f5c269c066857075d67c6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Cast</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4CastERK4Edge" title="永久链接至目标"></a><br></dt>
+<dd><p>Casting an <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1Edge"><span class="std std-ref">Edge</span></a> to an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>edge</strong> – An edge object.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>An <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> corresponding to edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal14IteratorHelper4txn_E"></span><span id="lgraph_api::traversal::IteratorHelper::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1IteratorHelper_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal14IteratorHelper4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathE">
+<span id="_CPPv3N10lgraph_api9traversal4PathE"></span><span id="_CPPv2N10lgraph_api9traversal4PathE"></span><span id="lgraph_api::traversal::Path"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK6Vertex"></span><span id="lgraph_api::traversal::Path::Path__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abd76ad8cca7c9f5611d89b6c94e88d53"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">start</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>start</strong> – The start. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERK4Path"></span><span id="lgraph_api::traversal::Path::Path__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a6f0b65d8220590bc0de51a6f9178db0c"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERK4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4PathERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4Path4PathERR4Path"></span><span id="lgraph_api::traversal::Path::Path__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae8d80e874d2f88e507218f6db1ed2cdc"></span><span class="sig-name descname"><span class="n"><span class="pre">Path</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="lgraph_api::traversal::Path::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4PathERR4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Move constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERK4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERK4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERK4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a3640a670cabc7ff15a8bf5e31f83b3e9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERK4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Assignment operator </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4PathaSERR4Path">
+<span id="_CPPv3N10lgraph_api9traversal4PathaSERR4Path"></span><span id="_CPPv2N10lgraph_api9traversal4PathaSERR4Path"></span><span id="lgraph_api::traversal::Path::assign-operator__PathRR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ae3dcf33db8617fe1de00cedc6541ae98"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4PathaSERR4Path" title="永久链接至目标"></a><br></dt>
+<dd><p>Move assignment operator </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – <strong>[inout]</strong> The right hand side.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A shallow copy of this object. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path6LengthEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path6LengthEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path6LengthEv"></span><span id="lgraph_api::traversal::Path::LengthC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1aa63d0332a20e86302501c8bd1db921c2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Length</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path6LengthEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the length of this path. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The path length. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge">
+<span id="_CPPv3N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="_CPPv2N10lgraph_api9traversal4Path6AppendERK4Edge"></span><span id="lgraph_api::traversal::Path::Append__EdgeCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab88413d902928384d83cbad1df6de769"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path6AppendERK4Edge" title="永久链接至目标"></a><br></dt>
+<dd><p>Append an edge to the path. Note that the edge’s start vertex should match the current path’s end vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>edge</strong> – edge to append. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path14GetStartVertexEv"></span><span id="lgraph_api::traversal::Path::GetStartVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1adf9c3be7e7e392d43d3427535127399e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetStartVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path14GetStartVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the start vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetEndVertexEv"></span><span id="lgraph_api::traversal::Path::GetEndVertexC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a4bcd4f57125bd1c7dd5160c5a973a080"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEndVertex</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetEndVertexEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the end vertex of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv">
+<span id="_CPPv3NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="_CPPv2NK10lgraph_api9traversal4Path11GetLastEdgeEv"></span><span id="lgraph_api::traversal::Path::GetLastEdgeC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1abf723fca4ce807ccf77dc91e685b5545"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLastEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path11GetLastEdgeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the last edge of this path. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthEdge__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a7f37b5b5e876c5ec8836bba603e526e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4EdgeE" title="lgraph_api::traversal::Edge"><span class="n"><span class="pre">Edge</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path10GetNthEdgeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Nth edge of this path. The available range of N is [0, Length). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t">
+<span id="_CPPv3NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="_CPPv2NK10lgraph_api9traversal4Path12GetNthVertexE6size_t"></span><span id="lgraph_api::traversal::Path::GetNthVertex__sC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1ab6aa8a9295375d526831278b2690558e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="lgraph_api::traversal::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNthVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal4Path12GetNthVertexE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Nth vertex of this path. The available range of N is [0, Length]. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5dirs_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5dirs_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5dirs_E"></span><span id="lgraph_api::traversal::Path::dirs___std::vector:b:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a0ad3ec1585be61bf4e9ab8ae94bb4406"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dirs_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5dirs_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path5lids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path5lids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path5lids_E"></span><span id="lgraph_api::traversal::Path::lids___std::vector:uint16_t:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a58d741b575ad6c800db503b3d2db61d3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint16_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path5lids_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal4Path4ids_E">
+<span id="_CPPv3N10lgraph_api9traversal4Path4ids_E"></span><span id="_CPPv2N10lgraph_api9traversal4Path4ids_E"></span><span id="lgraph_api::traversal::Path::ids___std::vector:s:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Path_1a2a21c3f2f91696ebc1c7d5109b5cc921"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal4Path4ids_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversalE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversalE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversalE"></span><span id="lgraph_api::traversal::PathTraversal"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversalE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> behaves similar to <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1FrontierTraversal"><span class="std std-ref">FrontierTraversal</span></a>, except that 1) Each vertex could be revisited multiple times. 2) Each traversed path would be stored, and the filter function has access to the path. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t"></span><span id="lgraph_api::traversal::PathTraversal::PathTraversal__GraphDBR.TransactionR.s.s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af738f641e5877af62941a670ceedd359"></span><span class="sig-name descname"><span class="n"><span class="pre">PathTraversal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal15MAX_RESULT_SIZEE" title="lgraph_api::traversal::MAX_RESULT_SIZE"><span class="n"><span class="pre">MAX_RESULT_SIZE</span></span></a><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13PathTraversalER7GraphDBR11Transaction6size_t6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct the <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> object. Note that the transaction must be read-only if you want to perform the traversals in parallel (i.e. TRAVERSAL_PARALLEL is specified in flags). Since TRAVERSAL_ALLOW_REVISITS is implied in <a class="reference internal" href="#classlgraph__api_1_1traversal_1_1PathTraversal"><span class="std std-ref">PathTraversal</span></a> and storing the Paths also takes a lot of space, the memory consumption could be very large if the filters are not very selective. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – The options used during traversals. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11GetFrontierEv"></span><span id="lgraph_api::traversal::PathTraversal::GetFrontier"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4664408bde6c8bc833b2d308a7a9c770"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetFrontier</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11GetFrontierEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Retrieve the current (i.e. latest) frontier. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The frontier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a44130ad12e0943766d35569bec355b2b"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a single vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vid</strong> – The identifer for the starting vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE"></span><span id="lgraph_api::traversal::PathTraversal::SetFrontier__ParallelVector:s:R"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ad36f30dad07fe9a443ea23406a635aa0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">root_vids</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierER14ParallelVectorI6size_tE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier to contain a set of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vids</strong> – <strong>[inout]</strong> The starting vertex identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a2bb94d3fa981b82033fbf6c819f2ada5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFrontier</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">root_vertex_filter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11SetFrontierENSt8functionIFbR14VertexIteratorEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Set the (initial) frontier by using a filter function. Each vertex will be checked against the specified filter. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>root_vertex_filter</strong> – <strong>[inout]</strong> The filter function. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a346ba8aed662685cd78506c8baec815c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14ExpandOutEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through outgoing edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a0a54b5500485e208383933b8f2817675"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13ExpandInEdgesENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through incoming edges using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1abb7d1f2986dde079c71c568410386249"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExpandEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal14IteratorHelperE" title="lgraph_api::traversal::IteratorHelper"><span class="n"><span class="pre">IteratorHelper</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">in_neighbour_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal11ExpandEdgesENSt8functionIFbR15OutEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14InEdgeIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEENSt8functionIFbR14VertexIteratorR4PathR14IteratorHelperEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Expand the current frontier through both directions using filters. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an outgoing edge. </p></li>
+<li><p><strong>in_edge_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an incoming edge. </p></li>
+<li><p><strong>out_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an destination vertex. </p></li>
+<li><p><strong>in_neighbour_filter</strong> – <strong>[inout]</strong> (Optional) The filter for an source vertex. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal5ResetEv"></span><span id="lgraph_api::traversal::PathTraversal::Reset"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a372de693ad40b3f42839c8ec6ac845f4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal5ResetEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reset the traversal. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal3db_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal3db_E"></span><span id="lgraph_api::traversal::PathTraversal::db___GraphDBR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a09449420d0682d10bed97fe3a12e4cb6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal4txn_E"></span><span id="lgraph_api::traversal::PathTraversal::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal6flags_E"></span><span id="lgraph_api::traversal::PathTraversal::flags___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal6flags_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal13num_vertices_E"></span><span id="lgraph_api::traversal::PathTraversal::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal13num_vertices_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14curr_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::curr_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1ac73154ee309f0dad63fb1a1790e23025"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14curr_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E">
+<span id="_CPPv3N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="_CPPv2N10lgraph_api9traversal13PathTraversal14next_frontier_E"></span><span id="lgraph_api::traversal::PathTraversal::next_frontier___ParallelVector:Path:"></span><span class="target" id="classlgraph__api_1_1traversal_1_1PathTraversal_1af032087096fefc9f61b4351bc5e9a71d"></span><span class="n"><span class="pre">ParallelVector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal4PathE" title="lgraph_api::traversal::Path"><span class="n"><span class="pre">Path</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">next_frontier_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal13PathTraversal14next_frontier_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6VertexE">
+<span id="_CPPv3N10lgraph_api9traversal6VertexE"></span><span id="_CPPv2N10lgraph_api9traversal6VertexE"></span><span id="lgraph_api::traversal::Vertex"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6VertexE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_traversal.h&gt;</em></div>
+<p>Represent a vertex. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexE6size_t"></span><span id="lgraph_api::traversal::Vertex::Vertex__s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a3f6911c4ec59435701457f131e89af4a"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vid. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex6VertexERK6Vertex"></span><span id="lgraph_api::traversal::Vertex::Vertex__VertexCR"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a13f7b30a546a536a3dfafd128adb609f"></span><span class="sig-name descname"><span class="n"><span class="pre">Vertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="lgraph_api::traversal::Vertex::Vertex"><span class="n"><span class="pre">Vertex</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex6VertexERK6Vertex" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>rhs</strong> – The right hand side. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv">
+<span id="_CPPv3NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="_CPPv2NK10lgraph_api9traversal6Vertex5GetIdEv"></span><span id="lgraph_api::traversal::Vertex::GetIdC"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a63765fbd0690661e2af3bc97083475fc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9traversal6Vertex5GetIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the Id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The Id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9traversal6Vertex4vid_E">
+<span id="_CPPv3N10lgraph_api9traversal6Vertex4vid_E"></span><span id="_CPPv2N10lgraph_api9traversal6Vertex4vid_E"></span><span id="lgraph_api::traversal::Vertex::vid___s"></span><span class="target" id="classlgraph__api_1_1traversal_1_1Vertex_1a224220636b53e35b1b5bf8c0e88717d0"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9traversal6Vertex4vid_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Path</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">IteratorHelper</span></dt>
+</dl>
+
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">PathTraversal</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-txn">
+<h2>lgraph_txn<a class="headerlink" href="#lgraph-txn" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionE">
+<span id="_CPPv3N10lgraph_api11TransactionE"></span><span id="_CPPv2N10lgraph_api11TransactionE"></span><span id="lgraph_api::Transaction"></span><span class="target" id="classlgraph__api_1_1Transaction"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_txn.h&gt;</em></div>
+<p>TuGraph operations happen in transactions. A transaction is sequence of operations that is carried out atomically on the <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a>. TuGraph transactions provides full ACID guarantees. </p>
+<p>Transactions are created using <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1af1601dcee2e9c15563e0d8e73b7bff14"><span class="std std-ref">GraphDB::CreateReadTxn()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1GraphDB_1a69cef34bae9c6bf907389c88056cbb74"><span class="std std-ref">GraphDB::CreateWriteTxn()</span></a>. A read transaction can only perform read operations, otherwise an exception is thrown. A write transaction can perform reads as well as writes. There are performance differences between read and write operations. So if you only need read in a transaction, you should create a read transaction.</p>
+<p>Each transaction must be used in one thread only, and they should not be passed from one thread to another unless it is a forked transaction.</p>
+<p>Read transactions can be forked. The new copy of the transaction will have the same view as the forked one, and it can be used in a separate thread. By forking from one read transaction and using the forked copies in different threads, we can parallelize the execution of specific operations. For example, you can implement a parallel BFS with this capability. Also, you can dump a snapshot of the whole graph using </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERR11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09c0d46171b7562e16c3a697f77fca90"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERR11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERR11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERR11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERR11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3d6029838ae611c2c7bbc3c59afe059"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERR11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERK11Transaction"></span><span id="lgraph_api::Transaction::Transaction__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a44fabd0e73ed35b6d683051496a3f30f"></span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="lgraph_api::Transaction::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERK11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11TransactionaSERK11Transaction">
+<span id="_CPPv3N10lgraph_api11TransactionaSERK11Transaction"></span><span id="_CPPv2N10lgraph_api11TransactionaSERK11Transaction"></span><span id="lgraph_api::Transaction::assign-operator__TransactionCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1abde1d510a232da04117f21bd23de8143"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11TransactionaSERK11Transaction" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6CommitEv">
+<span id="_CPPv3N10lgraph_api11Transaction6CommitEv"></span><span id="_CPPv2N10lgraph_api11Transaction6CommitEv"></span><span id="lgraph_api::Transaction::Commit"></span><span class="target" id="classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Commit</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6CommitEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Commits this transaction. Note that optimistic write transactions may fail to commit (an TxnConflict would be thrown). </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5AbortEv">
+<span id="_CPPv3N10lgraph_api11Transaction5AbortEv"></span><span id="_CPPv2N10lgraph_api11Transaction5AbortEv"></span><span id="lgraph_api::Transaction::Abort"></span><span class="target" id="classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Abort</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5AbortEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Aborts this transaction. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction7IsValidEv">
+<span id="_CPPv3NK10lgraph_api11Transaction7IsValidEv"></span><span id="_CPPv2NK10lgraph_api11Transaction7IsValidEv"></span><span id="lgraph_api::Transaction::IsValidC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this transaction is valid. <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a> becomes invalid after calling <a class="reference internal" href="#classlgraph__api_1_1Transaction_1a12b9283f52eaf7610afe4b04fbca2ff0"><span class="std std-ref">Abort()</span></a> or <a class="reference internal" href="#classlgraph__api_1_1Transaction_1aca6f43ce4724910499fa7cadb5caa01f"><span class="std std-ref">Commit()</span></a>. Operations on invalid transaction yields exceptions. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv">
+<span id="_CPPv3NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="_CPPv2NK10lgraph_api11Transaction10IsReadOnlyEv"></span><span id="lgraph_api::Transaction::IsReadOnlyC"></span><span class="target" id="classlgraph__api_1_1Transaction_1afde2da3cd793a0a0403ea2ea0c9b9ea7"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReadOnly</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11Transaction10IsReadOnlyEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this txn is read only </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if read only, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction6GetTxnEv">
+<span id="_CPPv3N10lgraph_api11Transaction6GetTxnEv"></span><span id="_CPPv2N10lgraph_api11Transaction6GetTxnEv"></span><span id="lgraph_api::Transaction::GetTxn"></span><span class="target" id="classlgraph__api_1_1Transaction_1a94bc9b71b14ae6ad7c788d20ec39b769"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetTxn</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction6GetTxnEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get <a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1Transaction"><span class="std std-ref">Transaction</span></a></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorEv"></span><span id="lgraph_api::Transaction::GetVertexIterator"></span><span class="target" id="classlgraph__api_1_1Transaction_1a16d76f5c12d744846d85b007cf4e094c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get a vertex iterator pointing to the first vertex. If there is no vertex, the iterator is invalid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb"></span><span id="lgraph_api::Transaction::GetVertexIterator__int64_t.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1af8c95376a78769b0717fd40fdcd274eb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexIteratorE7int64_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets a vertex iterator pointing to the Vertex with vid. If the vertex does not exist, the iterator is invalid. If nearest==true, the iterator points to the first vertex sorted by vid, with id&gt;=vid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vid</strong> – The vid. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to point to the nearest vertex sorted by vid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9bcd70f9274974a3028ef762228e176e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an out edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetOutEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1add821551447553956775fac4656f3d94"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetOutEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__EdgeUidCR.b"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7deebf477600e17ac66f7666bad41e8b"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an in edge iterator pointing to the edge specified by euid. If nearest==true, and the specified edge does not exist, return the first edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>euid</strong> – Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If true, get the first edge that sorts after the specified one if the specified one does not exist.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t">
+<span id="_CPPv3N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="_CPPv2N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t"></span><span id="lgraph_api::Transaction::GetInEdgeIterator__int64_tC.int64_tC.int16_tC"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab3bfd10ebeec5f7d0455d1fbc0762e73"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetInEdgeIteratorEK7int64_tK7int64_tK7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction18GetNumVertexLabelsEv"></span><span id="lgraph_api::Transaction::GetNumVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4b870210a66a2f239535915497e26278"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction18GetNumVertexLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of vertex labels </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The number of vertex labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16GetNumEdgeLabelsEv"></span><span id="lgraph_api::Transaction::GetNumEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1aec256df0cdfca791031bad9c43c63061"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetNumEdgeLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of edge labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The number of edge labels. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction16ListVertexLabelsEv"></span><span id="lgraph_api::Transaction::ListVertexLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1a5b2320193bfb8ffbfaa157a110d550ad"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16ListVertexLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Lists all vertex labels. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv">
+<span id="_CPPv3N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="_CPPv2N10lgraph_api11Transaction14ListEdgeLabelsEv"></span><span id="lgraph_api::Transaction::ListEdgeLabels"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae77fe52ec78bc3e8d8d92fe8d7a3accb"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeLabels</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14ListEdgeLabelsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List all edge labels </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Label names. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1a3769873514b6a5dd62b04414ff627c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexLabelIdERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label name.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeLabelId__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab030e136e6b28679acbb59a08a977090"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeLabelId</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeLabelIdERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge label id corresponding to the label name. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge label id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1afd8f546dcb187e1be6f86d268c62996b"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetVertexSchemaERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the vertex label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeSchema__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4afb55d1ce9b5906c6721f5c4b3b3d82"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeSchema</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13GetEdgeSchemaERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge schema definition corresponding to the edge label. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>label</strong> – The label.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge schema. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac461aea7ee379f8669f45f9782cea1f4"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction16GetVertexFieldIdE6size_tRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a55194445591f9fa6730dd8deb99e2414"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17GetVertexFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex field identifiers. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeFieldId__s.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2d9a2f736cfb96a2f61e4de3072eb811"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldId</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetEdgeFieldIdE6size_tRKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge field id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_name</strong> – Field name.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetEdgeFieldIds__s.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c13f1f3f527b37d3a221d4adb06cc5c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeFieldIds</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15GetEdgeFieldIdsE6size_tRKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge field ids. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_names</strong> – Field names.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The edge field identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae62bafbd58f35cfcc01255fe4113094f"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2c972657b35f86a21527bc2ad1be741e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddVertex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ae57f64149da2f4d2f972f49a53943591"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction9AddVertexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds a vertex. All non-nullable fields must be specified. VertexIndex is also updated. If a unique_id is indexed for the vertex, and the same unique_id exists, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Vertex id of the new vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertVertex__s.s.std::vector:s:CR.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad86ef0cb03585dd0361042f69fb6714c"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertVertex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">primary_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">unique_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction12UpsertVertexE6size_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert a vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Label id. </p></li>
+<li><p><strong>primary_pos</strong> – The location of the primary field in field_ids. </p></li>
+<li><p><strong>unique_pos</strong> – The locations of the unique index field in field_ids, can be empty. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – The field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>0: nothing happened because of index conflict 1: the vertex is inserted 2: the vertex is updated </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee14b2bcd0e170d5b87924a6a9a3e16f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ac3452ae2c9cae9850a7e53c2ddcc6240"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::AddEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add0eea119e67210b57d9b8b6119e88d4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AddEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction7AddEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Adds an edge. All non-nullable fields must be specified. An exception is thrown if src or dst does not exist. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p><a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of the new edge. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad342ee46d6f7f955529018100a701185"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_value_strings</strong> – List of field values in string representation.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9663b407c7f5ce18af938c7b670dd3fd"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_tRKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label</strong> – The label name. </p></li>
+<li><p><strong>field_names</strong> – List of field names. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1af3a3806320f56cb01f5edc7ff364ad80"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. If the edge exists and the label differs from specified label, an exception is thrown. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if the edge is inserted, false if the edge is updated. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::UpsertEdge__int64_t.int64_t.s.std::vector:s:CR.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1acd0cba3b23983114fdd65784b11a3297"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UpsertEdge</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">src</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">dst</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">unique_pos</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction10UpsertEdgeE7int64_t7int64_t6size_tRKNSt6vectorI6size_tEERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Upsert edge. If there is no src-&gt;dst edge, insert it. Otherwise, try to update the edge’s property. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>src</strong> – Source vertex id. </p></li>
+<li><p><strong>dst</strong> – Destination vertex id. </p></li>
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>unique_pos</strong> – The locations of the unique index field in field_ids, can be empty. </p></li>
+<li><p><strong>field_ids</strong> – List of field ids. </p></li>
+<li><p><strong>field_values</strong> – List of field values.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>0: nothing happened because of index conflict 1: the vertex is inserted 2: the vertex is updated </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction17ListVertexIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a66d9f07dc220285b2fbec99fb088ad4a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction17ListVertexIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List indexes </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A vector of vertex index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction26ListVertexCompositeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction26ListVertexCompositeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction26ListVertexCompositeIndexesEv"></span><span id="lgraph_api::Transaction::ListVertexCompositeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1a35a12d4a7a7fe0dc31d3221e8afcc676"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexSpecE" title="lgraph_api::CompositeIndexSpec"><span class="n"><span class="pre">CompositeIndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListVertexCompositeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction26ListVertexCompositeIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List indexes </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A vector of vertex composite index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv">
+<span id="_CPPv3N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="_CPPv2N10lgraph_api11Transaction15ListEdgeIndexesEv"></span><span id="lgraph_api::Transaction::ListEdgeIndexes"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee4d71f4e5ce213bbe886162db6edba0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexSpecE" title="lgraph_api::IndexSpec"><span class="n"><span class="pre">IndexSpec</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListEdgeIndexes</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15ListEdgeIndexesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>List indexes </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A vector of edge index specs. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aea99efb5e098fca6157f419ec7e4396c"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__s.std::vector:s:CR.std::vector:FieldData:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aa4db70c6d33c32018c0279601634e1b6"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__s.s.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e87da96ea73d8c709ef75a92b2bf5c4"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorE6size_t6size_tRK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – The label id. </p></li>
+<li><p><strong>field_id</strong> – The field id. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1add8eaa25484aefe92c14c0340bb35841"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__ssCR.std::vector:ss:CR.std::vector:FieldData:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab13a6cc8d58d716f8388455b1b571e4a"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.FieldDataCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a49deaf34c918d940432204e5a5a16cff"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERK9FieldDataRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end, inclusive.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a09382e2279bb78f1a79443741112a57e"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexCompositeIndexIterator__ssCR.std::vector:ss:CR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a8c87149e83ca6f4de94e0c5c9bf88a41"></span><span class="n"><span class="pre">VertexCompositeIndexIterator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexCompositeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexCompositeIndexIteratorERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeIndexIterator__ssCR.ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0a484619a92fe73247f86d9db09d2ead"></span><a class="reference internal" href="#_CPPv4N10lgraph_api17EdgeIndexIteratorE" title="lgraph_api::EdgeIndexIterator"><span class="n"><span class="pre">EdgeIndexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_start</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">key_end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeIndexIteratorERKNSt6stringERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all edges that has field value v. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field. </p></li>
+<li><p><strong>key_start</strong> – The key start. </p></li>
+<li><p><strong>key_end</strong> – The key end.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The index iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsVertexIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ad50a79870b8a8c77c6d2553d047f8e8f"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsVertexIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction15IsVertexIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of vertices. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::IsEdgeIndexed__ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a756786aa9a73934882b57cea8d808cf6"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsEdgeIndexed</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction13IsEdgeIndexedERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if index is ready for use. This should be used only to decide whether to use an index. To wait for an index to be ready, use lgraphDB::WaitIndexReady(). </p>
+<p>VertexIndex building is async, especially when added for a (label, field) that already has a lot of edges. This function tells us if the index building is finished.</p>
+<p>DO NOT wait for index building in a transaction. Write transactions block other write transactions, so blocking in a write transaction is always a bad idea. And long-living read transactions interfere with GC, making the DB grow unexpectly.</p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label</strong> – The label. </p></li>
+<li><p><strong>field</strong> – The field.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if index ready, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1aee85d698359c92dc3c9bc9f9e65ecf0f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__ssCR.std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1ab94cbd4824258986d5d32d00453c85f7"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a2eddb62a56cf0030545bce6bef00104f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value_string</strong> – The field value string.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9af16d5a13268c711610cc3c615592c0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__ssCR.std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a594aa9d948f61ee8d06d5a3f8925c4e6"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexERKNSt6stringERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__ssCR.ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9cc46853b60d578578649f8bef35d84d"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexERKNSt6stringERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_name</strong> – Name of the label. </p></li>
+<li><p><strong>field_name</strong> – Name of the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetVertexByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a9a16d2c7f0770fbfd38e53a4a95a165f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction22GetVertexByUniqueIndexE6size_t6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::Transaction::GetVertexByUniqueCompositeIndex__s.std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1Transaction_1adefa9906e0325df0316c499491f22adb"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexByUniqueCompositeIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction31GetVertexByUniqueCompositeIndexE6size_tRKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData"></span><span id="lgraph_api::Transaction::GetEdgeByUniqueIndex__s.s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a99a3bbbf134a20c992b10ac015ea4131"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetEdgeByUniqueIndex</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_id</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction20GetEdgeByUniqueIndexE6size_t6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets edge by unique index. Throws exception if there is no such vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>label_id</strong> – Identifier for the label. </p></li>
+<li><p><strong>field_id</strong> – Identifier for the field. </p></li>
+<li><p><strong>field_value</strong> – The field value.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The vertex by unique index. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv">
+<span id="_CPPv3N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="_CPPv2N10lgraph_api11Transaction14GetNumVerticesEv"></span><span id="lgraph_api::Transaction::GetNumVertices"></span><span class="target" id="classlgraph__api_1_1Transaction_1a84acf46e241f12fe3480c203cbd59d3c"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction14GetNumVerticesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The nubmer of vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE"></span><span id="lgraph_api::Transaction::GetVertexPrimaryField__ssCR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a0b662063aee62d2793c634a132375ae9"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetVertexPrimaryField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">label</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction21GetVertexPrimaryFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets vertex primary field </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The primary field. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction5CountEv">
+<span id="_CPPv3N10lgraph_api11Transaction5CountEv"></span><span id="_CPPv2N10lgraph_api11Transaction5CountEv"></span><span id="lgraph_api::Transaction::Count"></span><span class="target" id="classlgraph__api_1_1Transaction_1a420ff169b39c4ce47b02a25a1eda00ae"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Count</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction5CountEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the total number of vertex and edge </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>std::pair object, first element is vertex number, second is edge number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11CountDetailEv">
+<span id="_CPPv3N10lgraph_api11Transaction11CountDetailEv"></span><span id="_CPPv2N10lgraph_api11Transaction11CountDetailEv"></span><span id="lgraph_api::Transaction::CountDetail"></span><span class="target" id="classlgraph__api_1_1Transaction_1a4e88abab9d0a158b1dd1f72d97dcbda1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">tuple</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CountDetail</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11CountDetailEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the total number of vertex or edge for each label </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>std::tuple object list, first element indicates whether it is VERTEX or EDGE, second is label name, third is number. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE">
+<span id="_CPPv3N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="_CPPv2N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE"></span><span id="lgraph_api::Transaction::Transaction__lgraph::TransactionRR"></span><span class="target" id="classlgraph__api_1_1Transaction_1a1b5dc38854e41e00ee874297e73343af"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transaction</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction11TransactionERRN6lgraph11TransactionE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11Transaction4txn_E">
+<span id="_CPPv3N10lgraph_api11Transaction4txn_E"></span><span id="_CPPv2N10lgraph_api11Transaction4txn_E"></span><span id="lgraph_api::Transaction::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1Transaction_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11Transaction4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">GraphDB</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-types">
+<h2>lgraph_types<a class="headerlink" href="#lgraph-types" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15EdgeConstraintsE">
+<span id="_CPPv3N10lgraph_api15EdgeConstraintsE"></span><span id="_CPPv2N10lgraph_api15EdgeConstraintsE"></span><span id="lgraph_api::EdgeConstraints"></span><span class="target" id="namespacelgraph__api_1a7d597d281cbcd87325f58fcce96e5d34"></span><span class="k"><span class="pre">typedef</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">pair</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeConstraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="永久链接至目标"></a><br></dt>
+<dd><p>Edge constraints type define </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevelE">
+<span id="_CPPv3N10lgraph_api11AccessLevelE"></span><span id="_CPPv2N10lgraph_api11AccessLevelE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevelE" title="永久链接至目标"></a><br></dt>
+<dd><p>Access level a user or role has on a graph. NONE: no permission. READ: read-only, no write access. WRITE: can read and write vertex and edge, but cannot change meta data such as schema or access. FULL: full access, can modify schema, grant access to other users, or even delete this graph. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4NONEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4READE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4READE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62a3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4READE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api11AccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api11AccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62ad4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel5WRITEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11AccessLevel4FULLE">
+<span id="_CPPv3N10lgraph_api11AccessLevel4FULLE"></span><span id="_CPPv2N10lgraph_api11AccessLevel4FULLE"></span><span class="target" id="namespacelgraph__api_1ac3ad458848da53ee8d70876ec05d2c62aba7de5bc6888294e5884b024a4c894f1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FULL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11AccessLevel4FULLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevelE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevelE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevelE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afe"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldAccessLevel</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4NONEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4NONEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4NONEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afeab50339a10e1de285ac99d4c3990b8693"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NONE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4NONEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel4READE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel4READE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel4READE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afea3466fab4975481651940ed328aa990e4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">READ</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel4READE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE">
+<span id="_CPPv3N10lgraph_api16FieldAccessLevel5WRITEE"></span><span id="_CPPv2N10lgraph_api16FieldAccessLevel5WRITEE"></span><span class="target" id="namespacelgraph__api_1aad7795226513c96993e5d52ea4a07afead4b9e47f65b6e79b010582f15785867e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WRITE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api16FieldAccessLevel5WRITEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryTypeE">
+<span id="_CPPv3N10lgraph_api14GraphQueryTypeE"></span><span id="_CPPv2N10lgraph_api14GraphQueryTypeE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GraphQueryType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType6CYPHERE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType6CYPHERE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType6CYPHERE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777ade6059f420d77a2f1a688071cf6714f7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CYPHER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType6CYPHERE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14GraphQueryType3GQLE">
+<span id="_CPPv3N10lgraph_api14GraphQueryType3GQLE"></span><span id="_CPPv2N10lgraph_api14GraphQueryType3GQLE"></span><span class="target" id="namespacelgraph__api_1ad13d6d9811909e67631d0814e17ce777adc3f93a57ef0c1e0a09741a725e18816"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GQL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14GraphQueryType3GQLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldTypeE">
+<span id="_CPPv3N10lgraph_api9FieldTypeE"></span><span id="_CPPv2N10lgraph_api9FieldTypeE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1da"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>Field and value types. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType3NULE">
+<span id="_CPPv3N10lgraph_api9FieldType3NULE"></span><span id="_CPPv2N10lgraph_api9FieldType3NULE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa4c175fbb65c723226d182dbfd556136a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType3NULE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BOOLE">
+<span id="_CPPv3N10lgraph_api9FieldType4BOOLE"></span><span id="_CPPv2N10lgraph_api9FieldType4BOOLE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daae663dbb8f8244e122acb5bd6b2c216e1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BOOLE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4INT8E">
+<span id="_CPPv3N10lgraph_api9FieldType4INT8E"></span><span id="_CPPv2N10lgraph_api9FieldType4INT8E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daada138aad097eaac8697fe3661c91af95"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4INT8E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT16E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT16E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT16E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac4a99142c241d04e1607af8a319c201b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT16E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT32E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT32E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT32E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daac1081c62db14e24ef35a1c3c36cba2e7"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT32E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5INT64E">
+<span id="_CPPv3N10lgraph_api9FieldType5INT64E"></span><span id="_CPPv2N10lgraph_api9FieldType5INT64E"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa423a1db7cbc915478f654b15f87f3aac"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INT64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5INT64E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5FLOATE">
+<span id="_CPPv3N10lgraph_api9FieldType5FLOATE"></span><span id="_CPPv2N10lgraph_api9FieldType5FLOATE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa9cf4a0866224b0bb4a7a895da27c9c4c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5FLOATE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api9FieldType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api9FieldType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa33465d1d419b1074fb259ef444609e92"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6DOUBLEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4DATEE">
+<span id="_CPPv3N10lgraph_api9FieldType4DATEE"></span><span id="_CPPv2N10lgraph_api9FieldType4DATEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa0ace72efd9e987dfd807365d0ca50141"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4DATEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType8DATETIMEE">
+<span id="_CPPv3N10lgraph_api9FieldType8DATETIMEE"></span><span id="_CPPv2N10lgraph_api9FieldType8DATETIMEE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa86797ee5836338ee241ceee5cfc669e2"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DATETIME</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType8DATETIMEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType6STRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType6STRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType6STRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaee847e634a4297b274316de8a8ca9921"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType6STRINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType4BLOBE">
+<span id="_CPPv3N10lgraph_api9FieldType4BLOBE"></span><span id="_CPPv2N10lgraph_api9FieldType4BLOBE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa3a625432a45f9c83112036bc7a2d2d70"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BLOB</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType4BLOBE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType5POINTE">
+<span id="_CPPv3N10lgraph_api9FieldType5POINTE"></span><span id="_CPPv2N10lgraph_api9FieldType5POINTE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa15108ccafa3232b9067f889b6156f565"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType5POINTE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaaebdbcb765394d25d6a604589a890f82"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POINT</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType10LINESTRINGE">
+<span id="_CPPv3N10lgraph_api9FieldType10LINESTRINGE"></span><span id="_CPPv2N10lgraph_api9FieldType10LINESTRINGE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa21af7314ca158a415f7e073333d14447"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType10LINESTRINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaa90611ea278d30580b21af6d65208307"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LINESTRING</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7POLYGONE">
+<span id="_CPPv3N10lgraph_api9FieldType7POLYGONE"></span><span id="_CPPv2N10lgraph_api9FieldType7POLYGONE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daad5355465780b9a6259ebbc74d47477db"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7POLYGONE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daaecdc92bf56d960b73b02ee40125758bc"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">POLYGON</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType7SPATIALE">
+<span id="_CPPv3N10lgraph_api9FieldType7SPATIALE"></span><span id="_CPPv2N10lgraph_api9FieldType7SPATIALE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa608c1acc2033e0e07248c48ea01746ce"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SPATIAL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType7SPATIALE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldType12FLOAT_VECTORE">
+<span id="_CPPv3N10lgraph_api9FieldType12FLOAT_VECTORE"></span><span id="_CPPv2N10lgraph_api9FieldType12FLOAT_VECTORE"></span><span class="target" id="namespacelgraph__api_1aa01498a3ceb2fa74dc9536c16caef1daa5ff091452408a36a60227c938e376300"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT_VECTOR</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldType12FLOAT_VECTORE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphTypeE">
+<span id="_CPPv3N10lgraph_api10LGraphTypeE"></span><span id="_CPPv2N10lgraph_api10LGraphTypeE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00d"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphType</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">uint16_t</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>a type of value used in result entry and parameter in procedure or plugin signature </p>
+<dl class="field-list simple">
+<dt class="field-odd">Param INTEGER</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param FLOAT</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param DOUBLE</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param BOOLEAN</dt>
+<dd class="field-even"><p></p>
+</dd>
+<dt class="field-odd">Param STRING</dt>
+<dd class="field-odd"><p></p>
+</dd>
+<dt class="field-even">Param MAP</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param NODE</dt>
+<dd class="field-odd"><p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>, VertexId </p>
+</dd>
+<dt class="field-even">Param RELATIONSHIP</dt>
+<dd class="field-even"><p><a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> || <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>, <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a></p>
+</dd>
+<dt class="field-odd">Param PATH</dt>
+<dd class="field-odd"><p>lgraph_api::Path </p>
+</dd>
+<dt class="field-even">Param LIST</dt>
+<dd class="field-even"><p>&lt;string, <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>&gt; </p>
+</dd>
+<dt class="field-odd">Param ANY</dt>
+<dd class="field-odd"><p>like Object in Java, its procedure author’s responsibility to check the underlying concrete type whether valid in runtime. </p>
+</dd>
+</dl>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3NULE">
+<span id="_CPPv3N10lgraph_api10LGraphType3NULE"></span><span id="_CPPv2N10lgraph_api10LGraphType3NULE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da890f5fe6581170eeff26bec1c1e6a023"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NUL</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3NULE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7INTEGERE">
+<span id="_CPPv3N10lgraph_api10LGraphType7INTEGERE"></span><span id="_CPPv2N10lgraph_api10LGraphType7INTEGERE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5d5cd46919fa987731fb2edefe0f2a0c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INTEGER</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7INTEGERE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType5FLOATE">
+<span id="_CPPv3N10lgraph_api10LGraphType5FLOATE"></span><span id="_CPPv2N10lgraph_api10LGraphType5FLOATE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dae738c26bf4ce1037fa81b039a915cbf6"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FLOAT</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType5FLOATE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6DOUBLEE">
+<span id="_CPPv3N10lgraph_api10LGraphType6DOUBLEE"></span><span id="_CPPv2N10lgraph_api10LGraphType6DOUBLEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dafd3e4ece78a7d422280d5ed379482229"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DOUBLE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6DOUBLEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType7BOOLEANE">
+<span id="_CPPv3N10lgraph_api10LGraphType7BOOLEANE"></span><span id="_CPPv2N10lgraph_api10LGraphType7BOOLEANE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac48d5da12d702e73d6966069f2687376"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BOOLEAN</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType7BOOLEANE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType6STRINGE">
+<span id="_CPPv3N10lgraph_api10LGraphType6STRINGE"></span><span id="_CPPv2N10lgraph_api10LGraphType6STRINGE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da63b588d5559f64f89a416e656880b949"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">STRING</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType6STRINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4NODEE">
+<span id="_CPPv3N10lgraph_api10LGraphType4NODEE"></span><span id="_CPPv2N10lgraph_api10LGraphType4NODEE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da0cc25b606fe928a0c9a58f7f209c4495"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NODE</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4NODEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE">
+<span id="_CPPv3N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span id="_CPPv2N10lgraph_api10LGraphType12RELATIONSHIPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00dac5a4cec9a456484389b2573c8ae0a8bf"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RELATIONSHIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType12RELATIONSHIPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4PATHE">
+<span id="_CPPv3N10lgraph_api10LGraphType4PATHE"></span><span id="_CPPv2N10lgraph_api10LGraphType4PATHE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5ffb5f0d0de78321df46fc7c93ca64a3"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PATH</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4PATHE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType4LISTE">
+<span id="_CPPv3N10lgraph_api10LGraphType4LISTE"></span><span id="_CPPv2N10lgraph_api10LGraphType4LISTE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da298cb25408234de02baf2085803a464a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LIST</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType4LISTE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3MAPE">
+<span id="_CPPv3N10lgraph_api10LGraphType3MAPE"></span><span id="_CPPv2N10lgraph_api10LGraphType3MAPE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da5af1a3a285c2bdee4192223e31e1f833"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3MAPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api10LGraphType3ANYE">
+<span id="_CPPv3N10lgraph_api10LGraphType3ANYE"></span><span id="_CPPv2N10lgraph_api10LGraphType3ANYE"></span><span class="target" id="namespacelgraph__api_1ae24d7f9d64ea376583986fdaa27dd00da8e1bde3c3d303163521522cf1d62f21f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ANY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api10LGraphType3ANYE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeTypeE">
+<span id="_CPPv3N10lgraph_api14PluginCodeTypeE"></span><span id="_CPPv2N10lgraph_api14PluginCodeTypeE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>Type of code given when loading a new plugin. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2PYE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2PYE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2PYE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3ae0a77e22f8238541046ba5f9a5941e9e"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PY</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2PYE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType2SOE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType2SOE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType2SOE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3af9f590fe6d84e72c832e714b75b1604b"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SO</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType2SOE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3CPPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3CPPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3CPPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aca1ef9dc7006f2011c38e2bcc8f64d16"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CPP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3CPPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14PluginCodeType3ZIPE">
+<span id="_CPPv3N10lgraph_api14PluginCodeType3ZIPE"></span><span id="_CPPv2N10lgraph_api14PluginCodeType3ZIPE"></span><span class="target" id="namespacelgraph__api_1a6b0ba3fce237b80685922f54a411b5e3aed0690cdc850739d6e2b7b888311e32c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ZIP</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14PluginCodeType3ZIPE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexTypeE">
+<span id="_CPPv3N10lgraph_api9IndexTypeE"></span><span id="_CPPv2N10lgraph_api9IndexTypeE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p>index type </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType14NonuniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType14NonuniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a5e3e0d5af84f4b5e85c9dca495b47018"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NonuniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType14NonuniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is not unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType17GlobalUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a7f0f75f7fcd7d67aa985f11f3ebf2712"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GlobalUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType17GlobalUniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is a global unique index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE">
+<span id="_CPPv3N10lgraph_api9IndexType15PairUniqueIndexE"></span><span id="_CPPv2N10lgraph_api9IndexType15PairUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1a2bfb0a0ff1c379a8b4e8f9d24fdd4839a89627e6fbb7ed5b8b3913ecbd253b52f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PairUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexType15PairUniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is a pair unique index, for edge index only key of pair unique index is one of the follow case : if src_vid &lt; dst_vid ,key is (index field value + src_vid + dst_vid) if src_vid &gt; dst_vid ,key is (index field value + dst_vid + src_vid) </p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexTypeE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexTypeE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexTypeE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CompositeIndexType</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexType11UniqueIndexE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexType11UniqueIndexE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexType11UniqueIndexE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03afa1a33f381dab5d21a8c1241468b00c4"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexType11UniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is unique composite index </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexType14NonUniqueIndexE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexType14NonUniqueIndexE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexType14NonUniqueIndexE"></span><span class="target" id="namespacelgraph__api_1ae7b289647b71f09141675aeb75d18b03a9c33486c379483f58472e3715e160a5a"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NonUniqueIndex</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexType14NonUniqueIndexE" title="永久链接至目标"></a><br></dt>
+<dd><p>this is not unique composite index </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK11AccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK11AccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK11AccessLevel"></span><span id="lgraph_api::to_string__AccessLevelCR"></span><span class="target" id="namespacelgraph__api_1aaa50da267713908744fd8e2c5a6a4373"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK11AccessLevel" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel">
+<span id="_CPPv3N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="_CPPv2N10lgraph_api9to_stringERK16FieldAccessLevel"></span><span id="lgraph_api::to_string__FieldAccessLevelCR"></span><span class="target" id="namespacelgraph__api_1af06d7db8c2df7831e02af25d45ad43ef"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api16FieldAccessLevelE" title="lgraph_api::FieldAccessLevel"><span class="n"><span class="pre">FieldAccessLevel</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK16FieldAccessLevel" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringERK14GraphQueryType">
+<span id="_CPPv3N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="_CPPv2N10lgraph_api9to_stringERK14GraphQueryType"></span><span id="lgraph_api::to_string__GraphQueryTypeCR"></span><span class="target" id="namespacelgraph__api_1acd1e36eab9c9fc42d4192f3d55e4504a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14GraphQueryTypeE" title="lgraph_api::GraphQueryType"><span class="n"><span class="pre">GraphQueryType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringERK14GraphQueryType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE9FieldType">
+<span id="_CPPv3N10lgraph_api9to_stringE9FieldType"></span><span id="_CPPv2N10lgraph_api9to_stringE9FieldType"></span><span id="lgraph_api::to_string__FieldType"></span><span class="target" id="namespacelgraph__api_1a584042d80e34528010e1ad8e3e499b1d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the name of the given FieldType. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – when an unrecognizable FieldType is given.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>v</strong> – A FieldType.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Name of the given FieldType. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType">
+<span id="_CPPv3N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="_CPPv2N10lgraph_api17LGraphTypeIsFieldE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsField__LGraphType"></span><span class="target" id="namespacelgraph__api_1a4f4fd20c65be1aaa3f4d6e70e7d7218a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsField</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api17LGraphTypeIsFieldE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType">
+<span id="_CPPv3N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="_CPPv2N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsGraphElement__LGraphType"></span><span class="target" id="namespacelgraph__api_1a9fb9c1e160b13a90e177a8e8ec0e00fa"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsGraphElement</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api24LGraphTypeIsGraphElementE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType">
+<span id="_CPPv3N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="_CPPv2N10lgraph_api22LGraphTypeIsCollectionE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsCollection__LGraphType"></span><span class="target" id="namespacelgraph__api_1a82cc6a5df4119f903835efab9edbf4fe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsCollection</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api22LGraphTypeIsCollectionE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType">
+<span id="_CPPv3N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="_CPPv2N10lgraph_api15LGraphTypeIsAnyE10LGraphType"></span><span id="lgraph_api::LGraphTypeIsAny__LGraphType"></span><span class="target" id="namespacelgraph__api_1aca1c7356409eb19c5deab724bc4fff2d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">auto</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LGraphTypeIsAny</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="o"><span class="pre">-&gt;</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api15LGraphTypeIsAnyE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9to_stringE10LGraphType">
+<span id="_CPPv3N10lgraph_api9to_stringE10LGraphType"></span><span id="_CPPv2N10lgraph_api9to_stringE10LGraphType"></span><span id="lgraph_api::to_string__LGraphType"></span><span class="target" id="namespacelgraph__api_1a5113ccea82007fb6b30d591032637775"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9to_stringE10LGraphType" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType">
+<span id="_CPPv3N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="_CPPv2N10lgraph_api17PluginCodeTypeStrE14PluginCodeType"></span><span id="lgraph_api::PluginCodeTypeStr__PluginCodeType"></span><span class="target" id="namespacelgraph__api_1ad94969b6b33bfee0e009c16ba50623a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">PluginCodeTypeStr</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14PluginCodeTypeE" title="lgraph_api::PluginCodeType"><span class="n"><span class="pre">PluginCodeType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">code_type</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api17PluginCodeTypeStrE14PluginCodeType" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the name of plugin code types. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpecE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpecE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpecE"></span><span id="lgraph_api::CompositeIndexSpec"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CompositeIndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A composite index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec5labelE"></span><span id="lgraph_api::CompositeIndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec5labelE" title="永久链接至目标"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec6fieldsE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec6fieldsE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec6fieldsE"></span><span id="lgraph_api::CompositeIndexSpec::fields__std::vector:ss:"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1acf26f1505f276ea0dbf631c4bf19727a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">fields</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec6fieldsE" title="永久链接至目标"></a><br></dt>
+<dd><p>fields name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api18CompositeIndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api18CompositeIndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api18CompositeIndexSpec4typeE"></span><span id="lgraph_api::CompositeIndexSpec::type__CompositeIndexType"></span><span class="target" id="structlgraph__api_1_1CompositeIndexSpec_1a2112c9c8e7921d5119a2aac88189e894"></span><a class="reference internal" href="#_CPPv4N10lgraph_api18CompositeIndexTypeE" title="lgraph_api::CompositeIndexType"><span class="n"><span class="pre">CompositeIndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api18CompositeIndexSpec4typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptionsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptionsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptionsE"></span><span id="lgraph_api::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Edge label options, contain fields only edge have </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-types">Public Types</p>
+<dl class="cpp enum-class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrderE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">TemporalFieldOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="永久链接至目标"></a><br></dt>
+<dd><p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439ac6e421eaad140c1bc1a39980502df80c"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ASC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aa04a6aee11f553b01b2aa41df03f8439a65a6d757dbb571ccc3af9706e9a5f607"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DESC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder4DESCE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsEv"></span><span id="lgraph_api::EdgeOptions::EdgeOptions"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5708a1309a1260a1c5a7208f9d7f25c2"></span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints">
+<span id="_CPPv3N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="_CPPv2N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints"></span><span id="lgraph_api::EdgeOptions::EdgeOptions__EdgeConstraintsCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a5a91f7f6cbcd9600e96add55f510a9d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">edge_constraints</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions11EdgeOptionsERK15EdgeConstraints" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api11EdgeOptions9to_stringEv"></span><span id="lgraph_api::EdgeOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api11EdgeOptions9to_stringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions5clearEv">
+<span id="_CPPv3N10lgraph_api11EdgeOptions5clearEv"></span><span id="_CPPv2N10lgraph_api11EdgeOptions5clearEv"></span><span id="lgraph_api::EdgeOptions::clear"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions5clearEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions16edge_constraintsE"></span><span id="lgraph_api::EdgeOptions::edge_constraints__EdgeConstraints"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1ab879b0258a59289c195a102d07ae88bf"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15EdgeConstraintsE" title="lgraph_api::EdgeConstraints"><span class="n"><span class="pre">EdgeConstraints</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_constraints</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions16edge_constraintsE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions14temporal_fieldE"></span><span id="lgraph_api::EdgeOptions::temporal_field__ss"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1aed02035800f19fa3eb75108a4ed4489a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions14temporal_fieldE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE">
+<span id="_CPPv3N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="_CPPv2N10lgraph_api11EdgeOptions20temporal_field_orderE"></span><span id="lgraph_api::EdgeOptions::temporal_field_order__lgraph_api::EdgeOptions::TemporalFieldOrder"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a7e866158b92a86c3db1a2db0ad830104"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptionsE" title="lgraph_api::EdgeOptions"><span class="n"><span class="pre">EdgeOptions</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">temporal_field_order</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrder3ASCE" title="lgraph_api::EdgeOptions::TemporalFieldOrder::ASC"><span class="n"><span class="pre">ASC</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions20temporal_field_orderE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder">
+<span id="_CPPv3N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="_CPPv2N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder"></span><span id="lgraph_api::EdgeOptions::to_string__TemporalFieldOrderCR"></span><span class="target" id="structlgraph__api_1_1EdgeOptions_1a02b8f61202a7e3f790caaaece23d1cfc"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11EdgeOptions18TemporalFieldOrderE" title="lgraph_api::EdgeOptions::TemporalFieldOrder"><span class="n"><span class="pre">TemporalFieldOrder</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">v</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api11EdgeOptions9to_stringERK18TemporalFieldOrder" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUidE">
+<span id="_CPPv3N10lgraph_api7EdgeUidE"></span><span id="_CPPv2N10lgraph_api7EdgeUidE"></span><span id="lgraph_api::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUidE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidEv"></span><span id="lgraph_api::EdgeUid::EdgeUid"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ac4a49320d7fa2c7fba9bdad45e49e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t">
+<span id="_CPPv3N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="_CPPv2N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t"></span><span id="lgraph_api::EdgeUid::EdgeUid__int64_t.int64_t.uint16_t.int64_t.int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a3ecba2c59d236b1b4f042d4274f51264"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span>, <span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">l</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">e</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7EdgeUidE7int64_t7int64_t8uint16_t7int64_t7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7ReverseEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7ReverseEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7ReverseEv"></span><span id="lgraph_api::EdgeUid::Reverse"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae1b551cc51c9d556342b27b466a7c7cb"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Reverse</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7ReverseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Reverses side of this edge </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUideqERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::eq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ae10ec79b489d4c829b1b28a4c14b7f7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUideqERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidneERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidneERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidneERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::neq-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a6f4701506d51e0489c36edf7251e9acd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidneERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidltERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::lt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1afde4cbd02b63c9acd53e61d5e49787e6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidltERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUidgtERK7EdgeUid"></span><span id="lgraph_api::EdgeUid::gt-operator__EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a92818596b49b9fd47fa4b4ce4c203094"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUidgtERK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid8ToStringEv">
+<span id="_CPPv3NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="_CPPv2NK10lgraph_api7EdgeUid8ToStringEv"></span><span id="lgraph_api::EdgeUid::ToStringC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of this object </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3srcE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3srcE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3srcE"></span><span id="lgraph_api::EdgeUid::src__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7d1e8afde8407667e51f6de0ba9d6453"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3srcE" title="永久链接至目标"></a><br></dt>
+<dd><p>source vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3dstE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3dstE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3dstE"></span><span id="lgraph_api::EdgeUid::dst__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1adbdebae8daea6c03c200361fa8840a80"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3dstE" title="永久链接至目标"></a><br></dt>
+<dd><p>destination vertex id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3lidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3lidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3lidE"></span><span id="lgraph_api::EdgeUid::lid__uint16_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a16870a9bf8dc2c31ee3c874d7adbd02a"></span><span class="n"><span class="pre">uint16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3lidE" title="永久链接至目标"></a><br></dt>
+<dd><p>label id </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3tidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3tidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3tidE"></span><span id="lgraph_api::EdgeUid::tid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a523c7bbc2f001feab204b52b533f7c87"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">tid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3tidE" title="永久链接至目标"></a><br></dt>
+<dd><p>timestamp </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid3eidE">
+<span id="_CPPv3N10lgraph_api7EdgeUid3eidE"></span><span id="_CPPv2N10lgraph_api7EdgeUid3eidE"></span><span id="lgraph_api::EdgeUid::eid__int64_t"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1a7ea4961b92589517fd8cfafc0f945033"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">eid</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid3eidE" title="永久链接至目标"></a><br></dt>
+<dd><p>additional edge id to distinguish edges with the same tid </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv">
+<span id="_CPPv3N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="_CPPv2N10lgraph_api7EdgeUid7AnyEdgeEv"></span><span id="lgraph_api::EdgeUid::AnyEdge"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1ab5a73d71df790d8768376a4d13608773"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AnyEdge</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid7AnyEdgeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid15InEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid15InEdgeSortOrderE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of in-coming edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::InEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1InEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid15InEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE">
+<span id="_CPPv3N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="_CPPv2N10lgraph_api7EdgeUid16OutEdgeSortOrderE"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdgeSortOrder</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7EdgeUid16OutEdgeSortOrderE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Comparator for <a class="reference internal" href="#structlgraph__api_1_1EdgeUid"><span class="std std-ref">EdgeUid</span></a> of out-going edges. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid">
+<span id="_CPPv3NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="_CPPv2NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid"></span><span id="lgraph_api::EdgeUid::OutEdgeSortOrder::call-operator__EdgeUidCR.EdgeUidCRC"></span><span class="target" id="structlgraph__api_1_1EdgeUid_1_1OutEdgeSortOrder_1abb4302ba14373be138a9022b0bead7bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">()</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">lhs</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api7EdgeUid16OutEdgeSortOrderclERK7EdgeUidRK7EdgeUid" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataE">
+<span id="_CPPv3N10lgraph_api9FieldDataE"></span><span id="_CPPv2N10lgraph_api9FieldDataE"></span><span id="lgraph_api::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>A class that represents variant type. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEv">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEv"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEv"></span><span id="lgraph_api::FieldData::FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a33d34623467e64a3352cd10e53c85ca5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEb">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEb"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEb"></span><span id="lgraph_api::FieldData::FieldData__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a06ad1d80ad369afa643075cbe87f02ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE6int8_t"></span><span id="lgraph_api::FieldData::FieldData__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a265c89b1a86a0bbad89cf42661828f8c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE6int8_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int16_t"></span><span id="lgraph_api::FieldData::FieldData__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7e0e988dd1d89abbdacbf4d99fd7b2bf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int32_t"></span><span id="lgraph_api::FieldData::FieldData__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1aea814e9fb09dda664977d12f5b350d57"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataE7int64_t"></span><span id="lgraph_api::FieldData::FieldData__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a38a8108c47e489a360ebece5e593ca7f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">integer</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataE7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEf">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEf"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEf"></span><span id="lgraph_api::FieldData::FieldData__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab8122e35f0b0a42212299fb31ba8cf8d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEf" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEd">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEd"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEd"></span><span id="lgraph_api::FieldData::FieldData__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad56e5648c7943ef08a593aaf5c231985"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">real</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEd" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK4Date"></span><span id="lgraph_api::FieldData::FieldData__DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a484a31f1c0cba4531908a803a1782258"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="lgraph_api::FieldData::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK4Date" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK8DateTime"></span><span id="lgraph_api::FieldData::FieldData__DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a870fede3129fb7b07d10096b7adf796f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="lgraph_api::FieldData::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK8DateTime" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERKNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50384efa457e9883b378314910e01ccc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERRNSt6stringE"></span><span id="lgraph_api::FieldData::FieldData__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d1752cfc22854c2c44381b0a443fb56"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc"></span><span id="lgraph_api::FieldData::FieldData__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a28485df6381f6dc1ba4b30a8087e39fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataEPKc6size_t"></span><span id="lgraph_api::FieldData::FieldData__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a72fde0d7ac627644c3dff536d09a45f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aff76c6792c66514d775ba8be88b789ab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a388fd3199bf652332ce922fe0a25f145"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="lgraph_api::FieldData::Point"><span class="n"><span class="pre">Point</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK5PointI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad19f579289333ecf8515aae8f3bb903a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aafaa13b9ee556736c8992f555e99eda6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="lgraph_api::FieldData::LineString"><span class="n"><span class="pre">LineString</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK10LineStringI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a393d9735468c278ddf48b9cf8ef95891"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a59b4b116bc89bf0718ba25b9749c2cce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="lgraph_api::FieldData::Polygon"><span class="n"><span class="pre">Polygon</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7PolygonI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac81b0f4a81a11954f3afcaa9872b396b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI9CartesianE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E"></span><span id="lgraph_api::FieldData::FieldData__Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5da2cfc866cfdbe5db69ba9ef1dab2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="lgraph_api::FieldData::Spatial"><span class="n"><span class="pre">Spatial</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK7SpatialI5Wgs84E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6vectorIfEE">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERKNSt6vectorIfEE"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERKNSt6vectorIfEE"></span><span id="lgraph_api::FieldData::FieldData__std::vector:float:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a44746f760b5edf958afb02110bfea77b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERKNSt6vectorIfEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataD0Ev">
+<span id="_CPPv3N10lgraph_api9FieldDataD0Ev"></span><span id="_CPPv2N10lgraph_api9FieldDataD0Ev"></span><span id="lgraph_api::FieldData::~FieldData"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6e58de1884451d88a24994e2875b1d6a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~FieldData</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERK9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a74cb11c1f4f0a79d6f7a278fc84074ba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldData9FieldDataERR9FieldData"></span><span id="lgraph_api::FieldData::FieldData__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5a88873a071ad0c03bcf2c2a498e90bc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldData</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="lgraph_api::FieldData::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9FieldDataERR9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERK9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERK9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac721aa38df96b34b841cd4bbc608abdf"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldDataaSERR9FieldData">
+<span id="_CPPv3N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="_CPPv2N10lgraph_api9FieldDataaSERR9FieldData"></span><span id="lgraph_api::FieldData::assign-operator__FieldDataRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b27ecbef11936a80c911800629edd46"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldDataaSERR9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7integerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7integerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7integerEv"></span><span id="lgraph_api::FieldData::integerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1e5b6bc8e5ac95ae151fdaf8894201e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">integer</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7integerEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as int64. Valid only when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is of INT8, INT16, INT32, or INT64 types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of int types.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>An int64_t. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData4realEv">
+<span id="_CPPv3NK10lgraph_api9FieldData4realEv"></span><span id="_CPPv2NK10lgraph_api9FieldData4realEv"></span><span id="lgraph_api::FieldData::realC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a3f678878dde3a729f94dfefbdc4ef2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">real</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData4realEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as a double. The <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> must be of FLOAT or DOUBLE types. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown if the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> is not of FLOAT or DOUBLE types.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A double. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6stringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6stringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6stringEv"></span><span id="lgraph_api::FieldData::stringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7314f49a51859d46439cfeddb9ea06ec"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6stringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a> as std::string. Valid only for STRING, BLOB and SPATIAL. BLOB data is returned as-is, since std::string can also hold byte array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">bad_cast</span></span></span> – Thrown when a bad cast error condition occurs.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A reference to a const std::string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBoolEv"></span><span id="lgraph_api::FieldData::AsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac488187ef67bf8905cbe686daab95183"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBoolEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsInt8Ev"></span><span id="lgraph_api::FieldData::AsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0094a31af359f4684c261a56f780cfb3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsInt8Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt16Ev"></span><span id="lgraph_api::FieldData::AsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aaca113d03918222c50977a094b75c2d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt16Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt32Ev"></span><span id="lgraph_api::FieldData::AsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0cc24eb0e06a5f5b5476f5739b6ae51e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt32Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsInt64Ev"></span><span id="lgraph_api::FieldData::AsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a16e138db4d9a0defc0ab8f03a7864d65"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsInt64Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7AsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7AsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7AsFloatEv"></span><span id="lgraph_api::FieldData::AsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8f86682f960b846e1c3a59eb7fc6ae95"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7AsFloatEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsDoubleEv"></span><span id="lgraph_api::FieldData::AsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2894e904ceb04109370957ba7c48e189"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsDoubleEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1accfbae3969f742ce3621560fee34dbda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Date</span> <span class="pre">AsDate</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1abd4d1fc803c662e145761278c129d3c9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::DateTime</span> <span class="pre">AsDateTime</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8AsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8AsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8AsStringEv"></span><span id="lgraph_api::FieldData::AsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5e3562cda960da001597e7dd5679b140"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8AsStringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6AsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6AsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6AsBlobEv"></span><span id="lgraph_api::FieldData::AsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9a5a106b2ee0d6fa3c78592852682f0b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6AsBlobEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12AsBase64BlobEv"></span><span id="lgraph_api::FieldData::AsBase64BlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1afc4b6bc9a7a4d42a981579e04b86b3a7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsBase64Blob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12AsBase64BlobEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a8128129ec0fa7689772f0c437fe93a1f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::SRID</span> <span class="pre">GetSRID</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a26726ddebb182026865e77b4e68f8f53"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a31ea41c18cb7507bfefbb18971a3dd0e"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Point&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPoint</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ad5f639edaa8b36e90cff7192554b8723"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1aaef5ea8cbde81ad51459f035a99bdd7f"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::LineString&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianLineString</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a7fce7150c8ad873933a8028b16a72a69"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1a0015550261b9e976e07e61a3d5790fda"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Polygon&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianPolygon</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1afb01ecb2663024f0adedfcfe05928d45"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Wgs84</span> <span class="pre">&gt;</span> <span class="pre">AsWgsSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1FieldData_1ade0f7fe05edb1eb43c1f4057275967f9"></span><span class="sig-name descname"><span class="pre">inline</span> <span class="pre">inline</span> <span class="pre">::lgraph_api::Spatial&lt;::lgraph_api::Cartesian</span> <span class="pre">&gt;</span> <span class="pre">AsCartesianSpatial</span> <span class="pre">()</span> <span class="pre">const</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData13AsFloatVectorEv">
+<span id="_CPPv3NK10lgraph_api9FieldData13AsFloatVectorEv"></span><span id="_CPPv2NK10lgraph_api9FieldData13AsFloatVectorEv"></span><span id="lgraph_api::FieldData::AsFloatVectorC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab5a2c72f20b486e19729eaa24d6cb190"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AsFloatVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData13AsFloatVectorEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6ToBoltEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6ToBoltEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6ToBoltEv"></span><span id="lgraph_api::FieldData::ToBoltC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3b294f10df124b9d290c7d8fb37e1243"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">any</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToBolt</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6ToBoltEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api9FieldData8ToStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::ToString__ssCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6d5290ed610cdd3fb38c0d09be107dce"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">null_value</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="s"><span class="pre">"NUL"</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8ToStringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get string representation of this <a class="reference internal" href="#structlgraph__api_1_1FieldData"><span class="std std-ref">FieldData</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataeqERK9FieldData"></span><span id="lgraph_api::FieldData::eq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1360e03268a1c10e4a40573e61f2f5ae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataeqERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataneERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataneERK9FieldData"></span><span id="lgraph_api::FieldData::neq-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade1a5ee8968dbf6e7656e5adf96be546"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">!=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataneERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatagtERK9FieldData"></span><span id="lgraph_api::FieldData::gt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a936f13e9913fde88ff4beb6ba8cabbba"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatagtERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDatageERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDatageERK9FieldData"></span><span id="lgraph_api::FieldData::gte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a9dbdaf01c34ed106fe44fb5f4df2a43b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&gt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDatageERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataltERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataltERK9FieldData"></span><span id="lgraph_api::FieldData::lt-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b808b6437787ab0de4133d7f1cd077"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataltERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldDataleERK9FieldData">
+<span id="_CPPv3NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="_CPPv2NK10lgraph_api9FieldDataleERK9FieldData"></span><span id="lgraph_api::FieldData::lte-operator__FieldDataCRC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a34d5df1f1114d3fe8c15bce452736680"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">&lt;=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldDataleERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7GetTypeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7GetTypeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7GetTypeEv"></span><span id="lgraph_api::FieldData::GetTypeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aacf5cac64e0e4e0fba5962f6f1ecf925"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetType</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7GetTypeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7is_nullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7is_nullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7is_nullEv"></span><span id="lgraph_api::FieldData::is_nullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a54e61d2bb6c2a58d7b98180555af09e4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_null</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7is_nullEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6is_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6is_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6is_bufEv"></span><span id="lgraph_api::FieldData::is_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a49ddf20e31700f6609ffa379f0d25a8f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6is_bufEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12is_empty_bufEv"></span><span id="lgraph_api::FieldData::is_empty_bufC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ade6523aa6dc019354f36c47aeb4dfd21"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">is_empty_buf</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12is_empty_bufEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsNullEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsNullEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsNullEv"></span><span id="lgraph_api::FieldData::IsNullC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac4d637a0dec45d546495c1660c9f6047"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsNull</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsNullEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is null </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBoolEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBoolEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBoolEv"></span><span id="lgraph_api::FieldData::IsBoolC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec3bdef27fa2d4de29db82d2334ad2d8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBool</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBoolEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is bool </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsBlobEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsBlobEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsBlobEv"></span><span id="lgraph_api::FieldData::IsBlobC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a50d95767570c5cc1599c634b7b33e916"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBlob</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsBlobEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is BLOB </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsStringEv"></span><span id="lgraph_api::FieldData::IsStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7c412f98489e7d252ef40ed053a3908c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is string </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsInt8Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsInt8Ev"></span><span id="lgraph_api::FieldData::IsInt8C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a325f297dbf3554c5dbb109b2dada4a43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt8</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsInt8Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT8 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt16Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt16Ev"></span><span id="lgraph_api::FieldData::IsInt16C"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefe2db06fec008bc80e0d15ab52949c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt16</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt16Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT16 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt32Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt32Ev"></span><span id="lgraph_api::FieldData::IsInt32C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a480ddcb154c9e18b948ff3850a42c22d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt32</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt32Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT32 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsInt64Ev">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsInt64Ev"></span><span id="lgraph_api::FieldData::IsInt64C"></span><span class="target" id="structlgraph__api_1_1FieldData_1a2b0be739d239c9d646696e1bfe3b2bae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInt64</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsInt64Ev" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is INT64 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsIntegerEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsIntegerEv"></span><span id="lgraph_api::FieldData::IsIntegerC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8543c359835d7977b96446aaef126344"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsIntegerEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Is this a INT8, INT16, INT32 or INT64? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsFloatEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsFloatEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsFloatEv"></span><span id="lgraph_api::FieldData::IsFloatC"></span><span class="target" id="structlgraph__api_1_1FieldData_1aec0a6f81c7581924db00ea960358d91b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsFloat</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsFloatEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is float </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData8IsDoubleEv">
+<span id="_CPPv3NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="_CPPv2NK10lgraph_api9FieldData8IsDoubleEv"></span><span id="lgraph_api::FieldData::IsDoubleC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a300a2e608e8144e2fbe4588729dd34e3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDouble</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData8IsDoubleEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is double </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsRealEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsRealEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsRealEv"></span><span id="lgraph_api::FieldData::IsRealC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab6d49b63cf486d609f6286f8b26887f9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsRealEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Is this a FLOAT or DOUBLE? </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData6IsDateEv">
+<span id="_CPPv3NK10lgraph_api9FieldData6IsDateEv"></span><span id="_CPPv2NK10lgraph_api9FieldData6IsDateEv"></span><span id="lgraph_api::FieldData::IsDateC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8aa76d397e0e2b1d0cb09487316210cc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDate</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData6IsDateEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is date </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv">
+<span id="_CPPv3NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="_CPPv2NK10lgraph_api9FieldData10IsDateTimeEv"></span><span id="lgraph_api::FieldData::IsDateTimeC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1b1b2b6676359ff4d4ec77eb7e7ee62e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsDateTime</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData10IsDateTimeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is date time </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData7IsPointEv">
+<span id="_CPPv3NK10lgraph_api9FieldData7IsPointEv"></span><span id="_CPPv2NK10lgraph_api9FieldData7IsPointEv"></span><span id="lgraph_api::FieldData::IsPointC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab50e9ff6a50f06668ea577fe1d963a8b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPoint</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData7IsPointEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is Point</p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData12IsLineStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldData12IsLineStringEv"></span><span id="lgraph_api::FieldData::IsLineStringC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a795fc6d4d17d385f07d87f82bb247c45"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsLineString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData12IsLineStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is LineString</p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsPolygonEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsPolygonEv"></span><span id="lgraph_api::FieldData::IsPolygonC"></span><span class="target" id="structlgraph__api_1_1FieldData_1a57c2b6137c6ae390b86d5f341b900992"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsPolygon</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsPolygonEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is Polygon</p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData9IsSpatialEv">
+<span id="_CPPv3NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="_CPPv2NK10lgraph_api9FieldData9IsSpatialEv"></span><span id="lgraph_api::FieldData::IsSpatialC"></span><span class="target" id="structlgraph__api_1_1FieldData_1ad51d37e3d848990cec85e7de187309fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsSpatial</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData9IsSpatialEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is spatial </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldData13IsFloatVectorEv">
+<span id="_CPPv3NK10lgraph_api9FieldData13IsFloatVectorEv"></span><span id="_CPPv2NK10lgraph_api9FieldData13IsFloatVectorEv"></span><span id="lgraph_api::FieldData::IsFloatVectorC"></span><span class="target" id="structlgraph__api_1_1FieldData_1acc61d62e8a4cfa062827ec02687aff75"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsFloatVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldData13IsFloatVectorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this object is float vector </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4typeE">
+<span id="_CPPv3N10lgraph_api9FieldData4typeE"></span><span id="_CPPv2N10lgraph_api9FieldData4typeE"></span><span id="lgraph_api::FieldData::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7booleanE">
+<span id="_CPPv3N10lgraph_api9FieldData7booleanE"></span><span id="_CPPv2N10lgraph_api9FieldData7booleanE"></span><span id="lgraph_api::FieldData::boolean__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1a857e4e5a2613b7cf584dbf12dae00525"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">boolean</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7booleanE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4int8E">
+<span id="_CPPv3N10lgraph_api9FieldData4int8E"></span><span id="_CPPv2N10lgraph_api9FieldData4int8E"></span><span id="lgraph_api::FieldData::int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae0a430ab8199def132f3f07af5c84066"></span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int8</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4int8E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int16E">
+<span id="_CPPv3N10lgraph_api9FieldData5int16E"></span><span id="_CPPv2N10lgraph_api9FieldData5int16E"></span><span id="lgraph_api::FieldData::int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7cd86ccaa2b7be3ef15423f3f58e929e"></span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int16</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int16E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int32E">
+<span id="_CPPv3N10lgraph_api9FieldData5int32E"></span><span id="_CPPv2N10lgraph_api9FieldData5int32E"></span><span id="lgraph_api::FieldData::int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f658422e832e5e2d56e2245cb84be84"></span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int32</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int32E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5int64E">
+<span id="_CPPv3N10lgraph_api9FieldData5int64E"></span><span id="_CPPv2N10lgraph_api9FieldData5int64E"></span><span id="lgraph_api::FieldData::int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a45d113f8d303eebb3734306531862812"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">int64</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5int64E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2spE">
+<span id="_CPPv3N10lgraph_api9FieldData2spE"></span><span id="_CPPv2N10lgraph_api9FieldData2spE"></span><span id="lgraph_api::FieldData::sp__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a8d3eff5289da252b05248e40c1cd8188"></span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">sp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2spE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2dpE">
+<span id="_CPPv3N10lgraph_api9FieldData2dpE"></span><span id="_CPPv2N10lgraph_api9FieldData2dpE"></span><span id="lgraph_api::FieldData::dp__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae571d69d755e366904e8663a4c643901"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2dpE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData3bufE">
+<span id="_CPPv3N10lgraph_api9FieldData3bufE"></span><span id="_CPPv2N10lgraph_api9FieldData3bufE"></span><span id="lgraph_api::FieldData::buf__ssP"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00201fbea83f2e7a263f58098aa98cd7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">buf</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData3bufE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData2vpE">
+<span id="_CPPv3N10lgraph_api9FieldData2vpE"></span><span id="_CPPv2N10lgraph_api9FieldData2vpE"></span><span id="lgraph_api::FieldData::vp__std::vector:float:P"></span><span class="target" id="structlgraph__api_1_1FieldData_1ab23dd3d030e744d4c1b873226056a4ba"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">vp</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData2vpE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4dataE">
+<span id="_CPPv3N10lgraph_api9FieldData4dataE"></span><span id="_CPPv2N10lgraph_api9FieldData4dataE"></span><span class="target" id="structlgraph__api_1_1FieldData_1af8b1a03093018acfa0d961cae96146f6"></span><span class="k"><span class="pre">union</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">[anonymous]</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BoolEb">
+<span id="_CPPv3N10lgraph_api9FieldData4BoolEb"></span><span id="_CPPv2N10lgraph_api9FieldData4BoolEb"></span><span id="lgraph_api::FieldData::Bool__b"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbaec39a10e97bfc380b60052450b22b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Bool</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BoolEb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4Int8E6int8_t">
+<span id="_CPPv3N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="_CPPv2N10lgraph_api9FieldData4Int8E6int8_t"></span><span id="lgraph_api::FieldData::Int8__int8_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1acbc62444e525fdbd056581b349b2a7ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int8</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int8_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4Int8E6int8_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int16E7int16_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int16E7int16_t"></span><span id="lgraph_api::FieldData::Int16__int16_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a4f690c1758c4620ba79e4b03bf703531"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int16</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int16_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int16E7int16_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int32E7int32_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int32E7int32_t"></span><span id="lgraph_api::FieldData::Int32__int32_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a99c13db42b1525365635d10480b7d4ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int32</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int32_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int32E7int32_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5Int64E7int64_t">
+<span id="_CPPv3N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="_CPPv2N10lgraph_api9FieldData5Int64E7int64_t"></span><span id="lgraph_api::FieldData::Int64__int64_t"></span><span class="target" id="structlgraph__api_1_1FieldData_1a7301552563e8fae5960de9efe235959b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Int64</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5Int64E7int64_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5FloatEf">
+<span id="_CPPv3N10lgraph_api9FieldData5FloatEf"></span><span id="_CPPv2N10lgraph_api9FieldData5FloatEf"></span><span id="lgraph_api::FieldData::Float__float"></span><span class="target" id="structlgraph__api_1_1FieldData_1a326651bedfdc7a8f5743e42b7264003b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Float</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">float</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5FloatEf" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6DoubleEd">
+<span id="_CPPv3N10lgraph_api9FieldData6DoubleEd"></span><span id="_CPPv2N10lgraph_api9FieldData6DoubleEd"></span><span id="lgraph_api::FieldData::Double__double"></span><span class="target" id="structlgraph__api_1_1FieldData_1a5304168443248acb485e7e600e150feb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Double</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6DoubleEd" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKNSt6stringE"></span><span id="lgraph_api::FieldData::Date__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a88a43a9fe1328b1c06a36f469c286b29"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE">
+<span id="_CPPv3N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="_CPPv2N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE"></span><span id="lgraph_api::FieldData::Date__lgraph_api::DateCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a217032b1e975d7f3e8c81d0b10ef2eaa"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Date</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4DateE" title="lgraph_api::Date"><span class="n"><span class="pre">Date</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4DateERKN10lgraph_api4DateE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKNSt6stringE"></span><span id="lgraph_api::FieldData::DateTime__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a3a07cfe75d33077c683aa297554049e1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE">
+<span id="_CPPv3N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="_CPPv2N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE"></span><span id="lgraph_api::FieldData::DateTime__lgraph_api::DateTimeCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a00245f8fabb288c073b2b8b6310c95ae"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DateTime</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api8DateTimeE" title="lgraph_api::DateTime"><span class="n"><span class="pre">DateTime</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">d</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData8DateTimeERKN10lgraph_api8DateTimeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERKNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a46cdb6bb8f5ed9047595d8a0559960f9"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData6StringERRNSt6stringE"></span><span id="lgraph_api::FieldData::String__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0abb491f06b5016de61c1a37dc22cca1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringERRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc"></span><span id="lgraph_api::FieldData::String__cCP"></span><span class="target" id="structlgraph__api_1_1FieldData_1aefd38e03044cc9574ec9f82f8d8646db"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t">
+<span id="_CPPv3N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="_CPPv2N10lgraph_api9FieldData6StringEPKc6size_t"></span><span id="lgraph_api::FieldData::String__cCP.s"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0500c9ca63c2c826c5f957706676717a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">String</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">p</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6StringEPKc6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa6b8639fdb113bf8fe4a6556a161386e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE"></span><span id="lgraph_api::FieldData::Point__lgraph_api::Point:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1aa9bc69d37ba46872d769a6678058f5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Point</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKN10lgraph_api5PointI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData5PointERKNSt6stringE"></span><span id="lgraph_api::FieldData::Point__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aed6deea650cc82d203060e3db07d2d3b"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Point</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData5PointERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aadeac21d00b14c4fe99ca7356b38c4c5"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE"></span><span id="lgraph_api::FieldData::LineString__lgraph_api::LineString:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a1134a797ff8e36b78b12ffa26d3fe7ea"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">LineString</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">l</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKN10lgraph_api10LineStringI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData10LineStringERKNSt6stringE"></span><span id="lgraph_api::FieldData::LineString__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1af7a37b2d5b7065e5f077d5ed9c203c6a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LineString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData10LineStringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a89db7b33c84d04f622917e6096f32677"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE"></span><span id="lgraph_api::FieldData::Polygon__lgraph_api::Polygon:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac595c7685df74f6f1e439c1f14b4fb5c"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Polygon</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">p</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKN10lgraph_api7PolygonI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7PolygonERKNSt6stringE"></span><span id="lgraph_api::FieldData::Polygon__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac2f0d143ec079d8c6e6d340d383f0ee1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Polygon</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7PolygonERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Cartesian:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a0051c95b3f512cf741e877d7d84e4298"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Cartesian</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI9CartesianEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE"></span><span id="lgraph_api::FieldData::Spatial__lgraph_api::Spatial:Wgs84:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1ac60a663a7f4b31bc4a2ff727d6632f00"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Spatial</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">Wgs84</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">s</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKN10lgraph_api7SpatialI5Wgs84EE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData7SpatialERKNSt6stringE"></span><span id="lgraph_api::FieldData::Spatial__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a32852c0236f9dab9f44a4ad88026f3d1"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Spatial</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData7SpatialERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData11FloatVectorERKNSt6vectorIfEE">
+<span id="_CPPv3N10lgraph_api9FieldData11FloatVectorERKNSt6vectorIfEE"></span><span id="_CPPv2N10lgraph_api9FieldData11FloatVectorERKNSt6vectorIfEE"></span><span id="lgraph_api::FieldData::FloatVector__std::vector:float:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a06ede731eec6fa7ba9036372fa9f40f3"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FloatVector</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">float</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">fv</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData11FloatVectorERKNSt6vectorIfEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a6277538e024b6bce57fed9ff337fd973"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERRNSt6stringE"></span><span id="lgraph_api::FieldData::Blob__ssRR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa40480bb254330540b587feb99e8cded"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERRNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE">
+<span id="_CPPv3N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="_CPPv2N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE"></span><span id="lgraph_api::FieldData::Blob__std::vector:uint8_t:CR"></span><span class="target" id="structlgraph__api_1_1FieldData_1a07c0ced9778df1c5fed3a4663cc45abd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Blob</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">uint8_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">str</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData4BlobERKNSt6vectorI7uint8_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructs a Blob from vector of uint8_t, treated as byte array. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE"></span><span id="lgraph_api::FieldData::BlobFromBase64__ssCR"></span><span class="target" id="structlgraph__api_1_1FieldData_1aa1ff897ed22d2524b5caaedb4aadb3dd"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">BlobFromBase64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">base64_encoded</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData14BlobFromBase64ERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructs a BLOB from Base64 encoded string. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-static-functions">Private Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsBufTypeE9FieldType"></span><span id="lgraph_api::FieldData::IsBufType__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1abbb98d7d3792559fa61cca3554aeaba7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsBufType</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsBufTypeE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if ‘t’ is BLOB or STRING </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData9IsIntegerE9FieldType"></span><span id="lgraph_api::FieldData::IsInteger__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1ae00a13411b0557d842ffb8ea5f89e413"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsInteger</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData9IsIntegerE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if ‘t’ is INT8, 16, 32, or 64 </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType">
+<span id="_CPPv3N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="_CPPv2N10lgraph_api9FieldData6IsRealE9FieldType"></span><span id="lgraph_api::FieldData::IsReal__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldData_1a884ee60f7e50a01ab3a12179298fb9cb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsReal</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldData6IsRealE9FieldType" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if ‘t’ is FLLOAT or DOUBLE </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpecE">
+<span id="_CPPv3N10lgraph_api9FieldSpecE"></span><span id="_CPPv2N10lgraph_api9FieldSpecE"></span><span id="lgraph_api::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Specification for a field. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecEv"></span><span id="lgraph_api::FieldSpec::FieldSpec"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1abfe187a3e79a4445a5270bba3bfaf72c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssCR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a8428f3af5f513d918d94feb5c78fa7e0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERKNSt6stringE9FieldTypeb" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>n</strong> – Field name </p></li>
+<li><p><strong>t</strong> – Field type </p></li>
+<li><p><strong>nu</strong> – True if field is optional </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb">
+<span id="_CPPv3N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="_CPPv2N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb"></span><span id="lgraph_api::FieldSpec::FieldSpec__ssRR.FieldType.b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ada0df81c60e30bca34ba912a11fcdd9f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">FieldSpec</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">n</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">t</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nu</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec9FieldSpecERRNSt6stringE9FieldTypeb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec">
+<span id="_CPPv3NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="_CPPv2NK10lgraph_api9FieldSpeceqERK9FieldSpec"></span><span id="lgraph_api::FieldSpec::eq-operator__FieldSpecCRC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1ac1104e4f8ee3666f766a09745b03836d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">==</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldSpecE" title="lgraph_api::FieldSpec"><span class="n"><span class="pre">FieldSpec</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpeceqERK9FieldSpec" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api9FieldSpec8ToStringEv">
+<span id="_CPPv3NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="_CPPv2NK10lgraph_api9FieldSpec8ToStringEv"></span><span id="lgraph_api::FieldSpec::ToStringC"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api9FieldSpec8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the string representation of the <a class="reference internal" href="#structlgraph__api_1_1FieldSpec"><span class="std std-ref">FieldSpec</span></a>. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4nameE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4nameE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4nameE"></span><span id="lgraph_api::FieldSpec::name__ss"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4nameE" title="永久链接至目标"></a><br></dt>
+<dd><p>name of the field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec4typeE">
+<span id="_CPPv3N10lgraph_api9FieldSpec4typeE"></span><span id="_CPPv2N10lgraph_api9FieldSpec4typeE"></span><span id="lgraph_api::FieldSpec::type__FieldType"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a7b816c8a27ed4e0e4dfb2f4727b6b341"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldTypeE" title="lgraph_api::FieldType"><span class="n"><span class="pre">FieldType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec4typeE" title="永久链接至目标"></a><br></dt>
+<dd><p>type of that field </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9FieldSpec8optionalE">
+<span id="_CPPv3N10lgraph_api9FieldSpec8optionalE"></span><span id="_CPPv2N10lgraph_api9FieldSpec8optionalE"></span><span id="lgraph_api::FieldSpec::optional__b"></span><span class="target" id="structlgraph__api_1_1FieldSpec_1a1b3b38329495fc55fd443dfa2246337b"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">optional</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9FieldSpec8optionalE" title="永久链接至目标"></a><br></dt>
+<dd><p>is this field optional? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpecE">
+<span id="_CPPv3N10lgraph_api9IndexSpecE"></span><span id="_CPPv2N10lgraph_api9IndexSpecE"></span><span id="lgraph_api::IndexSpec"></span><span class="target" id="structlgraph__api_1_1IndexSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IndexSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>An index specifier. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5labelE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5labelE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5labelE"></span><span id="lgraph_api::IndexSpec::label__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a1dd28f5ea7b5b0780013e960944ddaa0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">label</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5labelE" title="永久链接至目标"></a><br></dt>
+<dd><p>label name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec5fieldE">
+<span id="_CPPv3N10lgraph_api9IndexSpec5fieldE"></span><span id="_CPPv2N10lgraph_api9IndexSpec5fieldE"></span><span id="lgraph_api::IndexSpec::field__ss"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1a97bab0e4c0ea8b12272a606c825360e7"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec5fieldE" title="永久链接至目标"></a><br></dt>
+<dd><p>field name </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9IndexSpec4typeE">
+<span id="_CPPv3N10lgraph_api9IndexSpec4typeE"></span><span id="_CPPv2N10lgraph_api9IndexSpec4typeE"></span><span id="lgraph_api::IndexSpec::type__IndexType"></span><span class="target" id="structlgraph__api_1_1IndexSpec_1ac8263343d7a58ec888a110427f522b64"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9IndexTypeE" title="lgraph_api::IndexType"><span class="n"><span class="pre">IndexType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9IndexSpec4typeE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsE">
+<span id="_CPPv3N10lgraph_api12LabelOptionsE"></span><span id="_CPPv2N10lgraph_api12LabelOptionsE"></span><span id="lgraph_api::LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LabelOptions</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Label options, base class, define some common fields and methods </p>
+<p>Subclassed by <a class="reference internal" href="#structlgraph__api_1_1EdgeOptions"><span class="std std-ref">EdgeOptions</span></a>, <a class="reference internal" href="#structlgraph__api_1_1VertexOptions"><span class="std std-ref">VertexOptions</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api12LabelOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api12LabelOptions9to_stringEv"></span><span id="lgraph_api::LabelOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a630c29d66f94446c4292172285d61492"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api12LabelOptions9to_stringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions5clearEv">
+<span id="_CPPv3N10lgraph_api12LabelOptions5clearEv"></span><span id="_CPPv2N10lgraph_api12LabelOptions5clearEv"></span><span id="lgraph_api::LabelOptions::clear"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a5eeb94d22b8366d1b68d0614384802fe"></span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions5clearEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptionsD0Ev">
+<span id="_CPPv3N10lgraph_api12LabelOptionsD0Ev"></span><span id="_CPPv2N10lgraph_api12LabelOptionsD0Ev"></span><span id="lgraph_api::LabelOptions::~LabelOptions"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a0c56bbf380b6ce74a532637b65f7e7a4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~LabelOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptionsD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12LabelOptions15detach_propertyE">
+<span id="_CPPv3N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="_CPPv2N10lgraph_api12LabelOptions15detach_propertyE"></span><span id="lgraph_api::LabelOptions::detach_property__b"></span><span class="target" id="structlgraph__api_1_1LabelOptions_1a6057cc32d98316ec805c453db60c48ef"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">detach_property</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api12LabelOptions15detach_propertyE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9ParameterE">
+<span id="_CPPv3N10lgraph_api9ParameterE"></span><span id="_CPPv2N10lgraph_api9ParameterE"></span><span id="lgraph_api::Parameter"></span><span class="target" id="structlgraph__api_1_1Parameter"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Parameter</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9ParameterE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>The parameter of procedure/plugin </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4nameE">
+<span id="_CPPv3N10lgraph_api9Parameter4nameE"></span><span id="_CPPv2N10lgraph_api9Parameter4nameE"></span><span id="lgraph_api::Parameter::name__ss"></span><span class="target" id="structlgraph__api_1_1Parameter_1a9b45b3e13bd9167aab02e17e08916231"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">name</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4nameE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter5indexE">
+<span id="_CPPv3N10lgraph_api9Parameter5indexE"></span><span id="_CPPv2N10lgraph_api9Parameter5indexE"></span><span id="lgraph_api::Parameter::index__i"></span><span class="target" id="structlgraph__api_1_1Parameter_1a750b5d744c39a06bfb13e6eb010e35d0"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">index</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter5indexE" title="永久链接至目标"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>name of the parameter </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api9Parameter4typeE">
+<span id="_CPPv3N10lgraph_api9Parameter4typeE"></span><span id="_CPPv2N10lgraph_api9Parameter4typeE"></span><span id="lgraph_api::Parameter::type__LGraphType"></span><span class="target" id="structlgraph__api_1_1Parameter_1ac8ec89e84ffc9d1ffe1b030f61a76e44"></span><a class="reference internal" href="#_CPPv4N10lgraph_api10LGraphTypeE" title="lgraph_api::LGraphType"><span class="n"><span class="pre">LGraphType</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">type</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api9Parameter4typeE" title="永久链接至目标"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>index of the parameter list in which the parameter stay </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfoE">
+<span id="_CPPv3N10lgraph_api8RoleInfoE"></span><span id="_CPPv2N10lgraph_api8RoleInfoE"></span><span id="lgraph_api::RoleInfo"></span><span class="target" id="structlgraph__api_1_1RoleInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">RoleInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfoE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the role. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo4descE">
+<span id="_CPPv3N10lgraph_api8RoleInfo4descE"></span><span id="_CPPv2N10lgraph_api8RoleInfo4descE"></span><span id="lgraph_api::RoleInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo4descE" title="永久链接至目标"></a><br></dt>
+<dd><p>description </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo12graph_accessE">
+<span id="_CPPv3N10lgraph_api8RoleInfo12graph_accessE"></span><span id="_CPPv2N10lgraph_api8RoleInfo12graph_accessE"></span><span id="lgraph_api::RoleInfo::graph_access__std::map:ss.AccessLevel:"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1ac689f8bad73d3d9b3c2a1c11f1296905"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11AccessLevelE" title="lgraph_api::AccessLevel"><span class="n"><span class="pre">AccessLevel</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph_access</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo12graph_accessE" title="永久链接至目标"></a><br></dt>
+<dd><p>access levels on different graphs </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8RoleInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8RoleInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8RoleInfo8disabledE"></span><span id="lgraph_api::RoleInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1RoleInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8RoleInfo8disabledE" title="永久链接至目标"></a><br></dt>
+<dd><p>is this role disabled? </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpecE">
+<span id="_CPPv3N10lgraph_api7SigSpecE"></span><span id="_CPPv2N10lgraph_api7SigSpecE"></span><span id="lgraph_api::SigSpec"></span><span class="target" id="structlgraph__api_1_1SigSpec"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SigSpec</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpecE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec10input_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec10input_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec10input_listE"></span><span id="lgraph_api::SigSpec::input_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a4f4b1c5201f32fae15b91c8a51021f63"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">input_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec10input_listE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api7SigSpec11result_listE">
+<span id="_CPPv3N10lgraph_api7SigSpec11result_listE"></span><span id="_CPPv2N10lgraph_api7SigSpec11result_listE"></span><span id="lgraph_api::SigSpec::result_list__std::vector:Parameter:"></span><span class="target" id="structlgraph__api_1_1SigSpec_1a23e292d0e3f983f3ceba15f9f6249209"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9ParameterE" title="lgraph_api::Parameter"><span class="n"><span class="pre">Parameter</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">result_list</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api7SigSpec11result_listE" title="永久链接至目标"></a><br></dt>
+<dd><p></p><blockquote>
+<div><p>input parameter list </p>
+</div></blockquote>
+<p></p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfoE">
+<span id="_CPPv3N10lgraph_api8UserInfoE"></span><span id="_CPPv2N10lgraph_api8UserInfoE"></span><span id="lgraph_api::UserInfo"></span><span class="target" id="structlgraph__api_1_1UserInfo"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">UserInfo</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfoE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Information about the user. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo4descE">
+<span id="_CPPv3N10lgraph_api8UserInfo4descE"></span><span id="_CPPv2N10lgraph_api8UserInfo4descE"></span><span id="lgraph_api::UserInfo::desc__ss"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a378e4473b8cd1fccf534804887f2bc85"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">desc</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo4descE" title="永久链接至目标"></a><br></dt>
+<dd><p>description of the user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo5rolesE">
+<span id="_CPPv3N10lgraph_api8UserInfo5rolesE"></span><span id="_CPPv2N10lgraph_api8UserInfo5rolesE"></span><span id="lgraph_api::UserInfo::roles__std::set:ss:"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1f4c5a9d9b2a7c1022128d3201f03648"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">set</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">roles</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo5rolesE" title="永久链接至目标"></a><br></dt>
+<dd><p>roles of this user </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo8disabledE">
+<span id="_CPPv3N10lgraph_api8UserInfo8disabledE"></span><span id="_CPPv2N10lgraph_api8UserInfo8disabledE"></span><span id="lgraph_api::UserInfo::disabled__b"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a4295e1a543aa3694e2987c6731c226ad"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">disabled</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo8disabledE" title="永久链接至目标"></a><br></dt>
+<dd><p>is this user disabled? </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8UserInfo12memory_limitE">
+<span id="_CPPv3N10lgraph_api8UserInfo12memory_limitE"></span><span id="_CPPv2N10lgraph_api8UserInfo12memory_limitE"></span><span id="lgraph_api::UserInfo::memory_limit__s"></span><span class="target" id="structlgraph__api_1_1UserInfo_1a1943ac86ca89eaf251c01c16772dfc00"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">memory_limit</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api8UserInfo12memory_limitE" title="永久链接至目标"></a><br></dt>
+<dd><p>memory limit for this user </p>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptionsE">
+<span id="_CPPv3N10lgraph_api13VertexOptionsE"></span><span id="_CPPv2N10lgraph_api13VertexOptionsE"></span><span id="lgraph_api::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api12LabelOptionsE" title="lgraph_api::LabelOptions"><span class="n"><span class="pre">LabelOptions</span></span></a><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptionsE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_types.h&gt;</em></div>
+<p>Vertex label options, contain fields only vertex have </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsEv"></span><span id="lgraph_api::VertexOptions::VertexOptions"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1afd0ea869dba2b64723f3643ef5f6d2df"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE"></span><span id="lgraph_api::VertexOptions::VertexOptions__ssCR"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac769e8bf000b16416a763894714829c7"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexOptions</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">primary_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13VertexOptionsERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api13VertexOptions9to_stringEv">
+<span id="_CPPv3NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="_CPPv2NK10lgraph_api13VertexOptions9to_stringEv"></span><span id="lgraph_api::VertexOptions::to_stringC"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1aac993ecccd3d88aafefb6b8e3caa1dee"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">to_string</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api13VertexOptions9to_stringEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions5clearEv">
+<span id="_CPPv3N10lgraph_api13VertexOptions5clearEv"></span><span id="_CPPv2N10lgraph_api13VertexOptions5clearEv"></span><span id="lgraph_api::VertexOptions::clear"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1ac8bb3912a3ce86b15842e79d0b421204"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions5clearEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13VertexOptions13primary_fieldE">
+<span id="_CPPv3N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="_CPPv2N10lgraph_api13VertexOptions13primary_fieldE"></span><span id="lgraph_api::VertexOptions::primary_field__ss"></span><span class="target" id="structlgraph__api_1_1VertexOptions_1a72852ec13f99950d76332fad99c71dd0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">primary_field</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api13VertexOptions13primary_fieldE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-utils">
+<h2>lgraph_utils<a class="headerlink" href="#lgraph-utils" title="永久链接至标题"></a></h2>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-typedefs">Typedefs</p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv44json">
+<span id="_CPPv34json"></span><span id="_CPPv24json"></span><span class="target" id="lgraph__utils_8h_1ab701e3ac61a85b337ec5c1abaad6742d"></span><span class="k"><span class="pre">using</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">json</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">nlohmann</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">json</span></span><a class="headerlink" href="#_CPPv44json" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api8get_timeEv">
+<span id="_CPPv3N10lgraph_api8get_timeEv"></span><span id="_CPPv2N10lgraph_api8get_timeEv"></span><span id="lgraph_api::get_time"></span><span class="target" id="namespacelgraph__api_1ab3691fc022301a72d8cb766dc0c17fdf"></span><span class="kt"><span class="pre">double</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">get_time</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api8get_timeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get current time. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Digit value of current time. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE">
+<span id="_CPPv3N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="_CPPv2N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE"></span><span id="lgraph_api::split_string__ss.std::vector:ss:R.ss"></span><span class="target" id="namespacelgraph__api_1ae25400b1a7ff2282865cd3cc2353a536"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">split_string</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">origin_string</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">sub_strings</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">string_delimiter</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12split_stringENSt6stringERNSt6vectorINSt6stringEEENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Split the original string by format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>origin_string</strong> – original string to be split. </p></li>
+<li><p><strong>sub_strings</strong> – split substring. </p></li>
+<li><p><strong>string_delimiter</strong> – Split format. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE">
+<span id="_CPPv3N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="_CPPv2N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE"></span><span id="lgraph_api::rc4__ssR.ss.ss"></span><span class="target" id="namespacelgraph__api_1a985e409c942e1068d32b795a27024122"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">rc4</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">key</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">mode</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api3rc4ERNSt6stringENSt6stringENSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Encrypt the input string in ac4 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>input</strong> – input string. </p></li>
+<li><p><strong>key</strong> – encryption key. </p></li>
+<li><p><strong>mode</strong> – encryption mode </p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13encode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13encode_base64EKNSt6stringE"></span><span id="lgraph_api::encode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a2e5f53c59cee61047cb4e283fb6c1950"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">encode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13encode_base64EKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Encode the input string in encode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Encrypted string </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api13decode_base64EKNSt6stringE">
+<span id="_CPPv3N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="_CPPv2N10lgraph_api13decode_base64EKNSt6stringE"></span><span id="lgraph_api::decode_base64__ssC"></span><span class="target" id="namespacelgraph__api_1a047800adaceb796bbb0eb71c016e4fa3"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">decode_base64</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api13decode_base64EKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Decode the input string in decode_base64 format. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>input</strong> – input string. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Decrypted string. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api12alloc_bufferE6size_t">
+<span id="_CPPv3N10lgraph_api12alloc_bufferE6size_t"></span><span id="_CPPv2N10lgraph_api12alloc_bufferE6size_t"></span><span id="lgraph_api::alloc_buffer__s"></span><span class="target" id="namespacelgraph__api_1a3274ccf2c4d0f0990a6edbdee20109c4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">alloc_buffer</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api12alloc_bufferE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Allocate memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>bytes</strong> – Size in byte of request memory. </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Pointer of allocated memory. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t">
+<span id="_CPPv3N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="_CPPv2N10lgraph_api14dealloc_bufferEPv6size_t"></span><span id="lgraph_api::dealloc_buffer__voidP.s"></span><span class="target" id="namespacelgraph__api_1ad6721e43c2327ad8e4c6e19c0996a770"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dealloc_buffer</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buffer</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">bytes</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14dealloc_bufferEPv6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Free memory with size in byte. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>buffer</strong> – Size in bytes of request memory </p></li>
+<li><p><strong>bytes</strong> – Pointer of memory to free. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonER8DataTypePKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1ae22fdc516fa3fd1ee7f8ad22d877bc64"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvR8DataTypePKcR4json" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json">
+<span id="_CPPv3I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span id="_CPPv2I0EN10lgraph_api15parse_from_jsonERNSt6vectorI8DataTypeEEPKcR4json"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DataType</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1a54668379bc6d79cb28f24c532d6ceb28"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parse_from_json</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="lgraph_api::parse_from_json::DataType"><span class="n"><span class="pre">DataType</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">value</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">key</span></span>, <a class="reference internal" href="#_CPPv44json" title="json"><span class="n"><span class="pre">json</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">input</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api15parse_from_jsonEvRNSt6vectorI8DataTypeEEPKcR4json" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse vector parameter from nlohmann::json. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>value</strong> – <strong>[out]</strong> value to store parameter </p></li>
+<li><p><strong>key</strong> – key of the parameter in the input </p></li>
+<li><p><strong>input</strong> – input json </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE">
+<span id="_CPPv3N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="_CPPv2N10lgraph_api20GetVidFromNodeStringERKNSt6stringE"></span><span id="lgraph_api::GetVidFromNodeString__ssCR"></span><span class="target" id="namespacelgraph__api_1aa24b1e990b795a8d59c369760c930c7f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVidFromNodeString</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">node_string</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api20GetVidFromNodeStringERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Parse vid from the node passed in by cypher. For V2 procedure. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>node_string</strong> – <strong>[in]</strong> node </p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>vid </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-index-iterator">
+<h2>lgraph_vertex_index_iterator<a class="headerlink" href="#lgraph-vertex-index-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorE"></span><span id="lgraph_api::VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_index_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> can be used to access a set of vertices that has the same indexed value. If the index is unique (that is, each vertex has a unique index value), then each <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> will only have one VertexId, and will become invalid after <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called. </p>
+<p>An <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> is valid iff it points to a valid (index_value, vid) pair, otherwise it is invalid. Calling member function on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator"><span class="std std-ref">VertexIndexIterator</span></a> throws an exception, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> function. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a73eb49fc5a21c2eab2d862fb07231061"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERR19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1adf8da63a296279030584c1d539dfc7e0"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERR19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratorD0Ev"></span><span id="lgraph_api::VertexIndexIterator::~VertexIndexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a4a5611b7ffb02851074518d929862608"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator5CloseEv"></span><span id="lgraph_api::VertexIndexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator7IsValidEv"></span><span id="lgraph_api::VertexIndexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid, i.e. the Key and Vid can be queried. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4NextEv"></span><span id="lgraph_api::VertexIndexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next vertex id in the list, which consists of all the valid vertex ids of the iterator and is sorted from small to large. If we hit the end of the list, iterator will become invalid and false is returned. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator13GetIndexValueEv"></span><span id="lgraph_api::VertexIndexIterator::GetIndexValueC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a3a20821948e78ea506ec4b39f93fbc6f"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetIndexValue</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator13GetIndexValueEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the current index value. The vids are sorted in (IndexValue, Vid) order. When <a class="reference internal" href="#classlgraph__api_1_1VertexIndexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> is called, the iterator moves from one vid to next, possibly moving from one IndexValue to another. This function tells the IndexValue currently pointed to. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The key. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv">
+<span id="_CPPv3NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="_CPPv2NK10lgraph_api19VertexIndexIterator6GetVidEv"></span><span id="lgraph_api::VertexIndexIterator::GetVidC"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a89f7ed3f184862498c0df7d87b97a1b4"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api19VertexIndexIterator6GetVidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the current vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The current vertex id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__lgraph::VertexIndexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a8adfcdcf8d9abeee72c3da1b9f21edaa"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">it</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERRN6lgraph19VertexIndexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::VertexIndexIterator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae8421018f7913edfc4d82d2c0f209085"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIndexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="lgraph_api::VertexIndexIterator::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator19VertexIndexIteratorERK19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator">
+<span id="_CPPv3N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="_CPPv2N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator"></span><span id="lgraph_api::VertexIndexIterator::assign-operator__VertexIndexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1abe6ca171051639d874dbfb573a9d4cb3"></span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api19VertexIndexIteratorE" title="lgraph_api::VertexIndexIterator"><span class="n"><span class="pre">VertexIndexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIteratoraSERK19VertexIndexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator3it_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator3it_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator3it_E"></span><span id="lgraph_api::VertexIndexIterator::it___std::unique_ptr:lgraph::VertexIndexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1ae02cf2beed475be9b6af2ddacf99f077"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIndexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api19VertexIndexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api19VertexIndexIterator4txn_E"></span><span id="lgraph_api::VertexIndexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIndexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api19VertexIndexIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="lgraph-vertex-iterator">
+<h2>lgraph_vertex_iterator<a class="headerlink" href="#lgraph-vertex-iterator" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph_1_1graph"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">graph</span></span></span><br></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorE">
+<span id="_CPPv3N10lgraph_api14VertexIteratorE"></span><span id="_CPPv2N10lgraph_api14VertexIteratorE"></span><span id="lgraph_api::VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;lgraph_vertex_iterator.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> can be used to iterate through vertices in the DB. Vertices are sorted according to vertex id in the DB. </p>
+<p>A <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> is valid iff it points to a valid vertex. Calling method functions on an invalid <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> throws an InvalidIterator, except for the <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"><span class="std std-ref">IsValid()</span></a> and <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> functions.</p>
+<p>The following operations invalidates a <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a>:</p><ol class="lowerroman simple">
+<li><p>Constructing an <a class="reference internal" href="#classlgraph__api_1_1VertexIterator"><span class="std std-ref">VertexIterator</span></a> for non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"><span class="std std-ref">Goto()</span></a> with the id of a non-existing vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"><span class="std std-ref">Next()</span></a> on the last vertex.</p></li>
+<li><p>Calling <a class="reference internal" href="#classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"><span class="std std-ref">Delete()</span></a> on the last vertex. </p></li>
+</ol>
+<p></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7888300a9ddafc0d6814c54b7d2f1f11"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERR14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERR14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorRR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac4f5daf4ebb180eb1a0c9d1ba024bf38"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERR14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratorD0Ev">
+<span id="_CPPv3N10lgraph_api14VertexIteratorD0Ev"></span><span id="_CPPv2N10lgraph_api14VertexIteratorD0Ev"></span><span id="lgraph_api::VertexIterator::~VertexIterator"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ab031829b35061e00c09bf2f5c951063f"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator5CloseEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator5CloseEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator5CloseEv"></span><span id="lgraph_api::VertexIterator::Close"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7f7a3199c392465d0767c6506c1af5b4"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Close</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator5CloseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Closes this iterator </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4NextEv">
+<span id="_CPPv3N10lgraph_api14VertexIterator4NextEv"></span><span id="_CPPv2N10lgraph_api14VertexIterator4NextEv"></span><span id="lgraph_api::VertexIterator::Next"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a3947d19ac087ef2cd68c2409920339c4"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Next</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4NextEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Move to the next vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>True if it succeeds, otherwise return false (no more vertex) and invalidate the iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb">
+<span id="_CPPv3N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="_CPPv2N10lgraph_api14VertexIterator4GotoE7int64_tb"></span><span id="lgraph_api::VertexIterator::Goto__int64_t.b"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a819e93dbf674b25c461534b19241cb91"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Goto</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4GotoE7int64_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Goto the vertex with id src. If there is no vertex with exactly the same vid, and nearest==true, go to the next vertex with id&gt;=vid, otherwise return false and invalidate the iterator. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>vid</strong> – Vertex id of the vertex to go. </p></li>
+<li><p><strong>nearest</strong> – (Optional) True to go to the closest vertex with id&gt;=vid.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if it succeeds, otherwise false (no such vertex). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator5GetIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator5GetIdEv"></span><span id="lgraph_api::VertexIterator::GetIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a9fedaf26513596c151c16f829b47038e"></span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator5GetIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the vertex id. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The id. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a594a8927f27893b46f4f8ce547b5e558"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the first out-going edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetOutEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1abb6aadfa764244d29f6458a40f5c4f17"></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetOutEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator18GetOutEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1OutEdgeIterator"><span class="std std-ref">OutEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge, and nearest==false an invalid iterator is returned. If the specified out-edge does not exist, and nearest==true, get the first out-edge that sorts after the specified one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The out edge iterator. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv"></span><span id="lgraph_api::VertexIterator::GetInEdgeIteratorC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5fc0c60548bc9633f50358a4e5f575c1"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the first in-coming edge. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb">
+<span id="_CPPv3NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="_CPPv2NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb"></span><span id="lgraph_api::VertexIterator::GetInEdgeIterator__EdgeUidCR.bC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a1013d34130e78bd8715e7b7a0759b578"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14InEdgeIteratorE" title="lgraph_api::InEdgeIterator"><span class="n"><span class="pre">InEdgeIterator</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetInEdgeIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api7EdgeUidE" title="lgraph_api::EdgeUid"><span class="n"><span class="pre">EdgeUid</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">euid</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">nearest</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">false</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator17GetInEdgeIteratorERK7EdgeUidb" title="永久链接至目标"></a><br></dt>
+<dd><p>Returns an <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a> pointing to the edge specified by euid. If there is no such edge and nearest==false, an invalid iterator is returned. If the specified edge does not exist and nearest==true, </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>euid</strong> – The Edge Unique Id. </p></li>
+<li><p><strong>nearest</strong> – (Optional) If set to true and the specified edge does not exist, get the edge that sorts right after it.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The <a class="reference internal" href="#classlgraph__api_1_1InEdgeIterator"><span class="std std-ref">InEdgeIterator</span></a>. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator7IsValidEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator7IsValidEv"></span><span id="lgraph_api::VertexIterator::IsValidC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac532c4b500b1a85ea22217f2c65a70ed"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IsValid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator7IsValidEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Query if this iterator is valid. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>True if valid, false if not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetLabelEv"></span><span id="lgraph_api::VertexIterator::GetLabelC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a5bc50d316d2112a9bd5123442a27f88d"></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetLabel</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetLabelEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the label of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator10GetLabelIdEv"></span><span id="lgraph_api::VertexIterator::GetLabelIdC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a6d11d952e737b05b4c2a43ac71fb2043"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetLabelId</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator10GetLabelIdEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets label id of this vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The label identifier. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:ss:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1adb133596cc9b635e7b26c8b435173144"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_names</strong> – List of names of the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::GetField__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a44ba5fa1ef8c2020dea346bb59f7ae79"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Field name.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE">
+<span id="_CPPv3NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="_CPPv2NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE"></span><span id="lgraph_api::VertexIterator::GetFields__std::vector:s:CRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1af03224cecdf28947b891dbb660561e36"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator9GetFieldsERKNSt6vectorI6size_tEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_ids</strong> – List of ids for the fields.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8GetFieldE6size_t"></span><span id="lgraph_api::VertexIterator::GetField__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac32646dab3106cccbe63eb01e90a5cb9"></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8GetFieldE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets the field specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_id</strong> – Field ID.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Field value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixERKNSt6stringE"></span><span id="lgraph_api::VertexIterator::subscript-operator__ssCRC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a0ddd3541e2fedada454d6e8cc1dceb9b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field_name </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>field_name</strong> – Filename of the file.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIteratorixE6size_t">
+<span id="_CPPv3NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="_CPPv2NK10lgraph_api14VertexIteratorixE6size_t"></span><span id="lgraph_api::VertexIterator::subscript-operator__sC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a2ab59fde24cef910c9221fc100788b15"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">fid</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIteratorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get field identified by field id </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>fid</strong> – The field id.</p>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>The indexed value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator12GetAllFieldsEv"></span><span id="lgraph_api::VertexIterator::GetAllFieldsC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a04394035782ec218b2c33b7ff1cb910c"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetAllFields</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator12GetAllFieldsEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets all fields of current vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>all fields. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__ssCR.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad16d315b3830e09258354ef9de3da6c5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_name</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldERKNSt6stringERK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_name</strong> – Field name. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData">
+<span id="_CPPv3N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="_CPPv2N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData"></span><span id="lgraph_api::VertexIterator::SetField__s.FieldDataCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ac23e6ce40bd59fe5f99d31e51b100b5d"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetField</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">field_id</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator8SetFieldE6size_tRK9FieldData" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the specified field. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_id</strong> – Field id. </p></li>
+<li><p><strong>field_value</strong> – Field value. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:ss:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1aadf161745d3c02e6eaf08648ec96f819"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_value_strings</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorINSt6stringEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_value_strings</strong> – The field value strings. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:ss:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1afb6c0299a2328b950f187d77a0998f23"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_names</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorINSt6stringEEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_names</strong> – List of names of the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE"></span><span id="lgraph_api::VertexIterator::SetFields__std::vector:s:CR.std::vector:FieldData:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad17acf7669cdf080182e21db444dd5ad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SetFields</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_ids</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api9FieldDataE" title="lgraph_api::FieldData"><span class="n"><span class="pre">FieldData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">field_values</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator9SetFieldsERKNSt6vectorI6size_tEERKNSt6vectorI9FieldDataEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Sets the fields specified. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InputError</span></span></span> – Thrown on other input errors (field not exist, etc.).</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>field_ids</strong> – List of identifiers for the fields. </p></li>
+<li><p><strong>field_values</strong> – The field values. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListSrcVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a910d02e24a65995a2784e2028d6244ac"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListSrcVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListSrcVidsE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>List source vids. Each source vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>List of source vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb"></span><span id="lgraph_api::VertexIterator::ListDstVids__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1add92b73ced9e72b3b87fa80f486c27a9"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ListDstVids</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator11ListDstVidsE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>List destination vids. Each vid is stored only once in the result. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit of number of vids to return. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, returns whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>List of desitnation vids. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumInEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1acba67b0fdb21bf78555353cf53fb4f6f"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumInEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator13GetNumInEdgesE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of incoming edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of in-coming edges to count. When the limit is reached, n_limit is returned. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of incoming edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb">
+<span id="_CPPv3N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="_CPPv2N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb"></span><span id="lgraph_api::VertexIterator::GetNumOutEdges__s.bP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a273dc0f4b8ddf828a89ae68748ed0c74"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GetNumOutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">n_limit</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">numeric_limits</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">max</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">more_to_go</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14GetNumOutEdgesE6size_tPb" title="永久链接至目标"></a><br></dt>
+<dd><p>Gets number of out-going edges, stopping on limit. This function can come in handy if we need to filter on large vertexes. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_limit</strong> – (Optional) The limit on number of out-going edges to count. When the limit is reached, n_limit is returned and limit_exceeded is set to true. </p></li>
+<li><p><strong>more_to_go</strong> – <strong>[out]</strong> (Optional) If non-null, return whether the limit is exceeded.</p></li>
+</ul>
+</dd>
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of out-going edges. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t">
+<span id="_CPPv3N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="_CPPv2N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t"></span><span id="lgraph_api::VertexIterator::Delete__sP.sP"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1ad257f9e02e38c86faaf00dd065361f5c"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delete</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_in_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">n_out_edges</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator6DeleteEP6size_tP6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Deletes this vertex, also deletes all incoming and outgoing edges of this vertex. The iterator will point to the next vertex by vid if there is any. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidTxn</span></span></span> – Thrown when called inside an invalid transaction. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">InvalidIterator</span></span></span> – Thrown when current iterator is invalid. </p></li>
+<li><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">WriteNotAllowed</span></span></span> – Thrown when called in a read-only transaction.</p></li>
+</ul>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>n_in_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of in edges the vertex had. </p></li>
+<li><p><strong>n_out_edges</strong> – <strong>[out]</strong> (Optional) If non-null, the number of out edges the vertex had. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4NK10lgraph_api14VertexIterator8ToStringEv">
+<span id="_CPPv3NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="_CPPv2NK10lgraph_api14VertexIterator8ToStringEv"></span><span id="lgraph_api::VertexIterator::ToStringC"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a19c380b03cea21d7ac7325136a131ff0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ToString</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="k"><span class="pre">const</span></span><a class="headerlink" href="#_CPPv4NK10lgraph_api14VertexIterator8ToStringEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the string representation of this vertex. </p>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE"></span><span id="lgraph_api::VertexIterator::VertexIterator__lgraph::graph::VertexIteratorRR.std::shared_ptr:lgraph::Transaction:CR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a77858ba7e00cd9e8676e4b168d95f931"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERRN6lgraph5graph14VertexIteratorERKNSt10shared_ptrIN6lgraph11TransactionEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::VertexIterator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a4b166320bbbeadd713f612c540094bf9"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexIterator</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="lgraph_api::VertexIterator::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator14VertexIteratorERK14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator">
+<span id="_CPPv3N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="_CPPv2N10lgraph_api14VertexIteratoraSERK14VertexIterator"></span><span id="lgraph_api::VertexIterator::assign-operator__VertexIteratorCR"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a25e24a42419e107fee77196a8a9fc488"></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIteratoraSERK14VertexIterator" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator3it_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator3it_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator3it_E"></span><span id="lgraph_api::VertexIterator::it___std::unique_ptr:lgraph::graph::VertexIterator:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a26ee2d6416d9ad738ce344fb2b1a2972"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">unique_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N6lgraph5graphE" title="lgraph::graph"><span class="n"><span class="pre">graph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">VertexIterator</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">it_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator3it_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api14VertexIterator4txn_E">
+<span id="_CPPv3N10lgraph_api14VertexIterator4txn_E"></span><span id="_CPPv2N10lgraph_api14VertexIterator4txn_E"></span><span id="lgraph_api::VertexIterator::txn___std::shared_ptr:lgraph::Transaction:"></span><span class="target" id="classlgraph__api_1_1VertexIterator_1a7a915079ac46b7ce836af799c15b588a"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv46lgraph" title="lgraph"><span class="n"><span class="pre">lgraph</span></span></a><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">Transaction</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api14VertexIterator4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">Transaction</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-base">
+<h2>olap_base<a class="headerlink" href="#olap-base" title="永久链接至标题"></a></h2>
+<p>This is an implementation of the TuGraph graph analytics engine. The graph analytics engine is a general-purpose processing engine useful for implementing various graph analytics algorithms such as PageRank, ShortestPath, etc.. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-defines">Defines</p>
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_WORKING">
+<span class="target" id="olap__base_8h_1af8106a969b5fe14011400dcc5de93889"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_WORKING</span></span></span><a class="headerlink" href="#c.THREAD_WORKING" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.THREAD_STEALING">
+<span class="target" id="olap__base_8h_1a3537fbf36165f2b4f963e4dd7462ec22"></span><span class="sig-name descname"><span class="n"><span class="pre">THREAD_STEALING</span></span></span><a class="headerlink" href="#c.THREAD_STEALING" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.VERTEX_BATCH_SIZE">
+<span class="target" id="olap__base_8h_1a7655fa441302a14fb0f2f7f74ebe9e64"></span><span class="sig-name descname"><span class="n"><span class="pre">VERTEX_BATCH_SIZE</span></span></span><a class="headerlink" href="#c.VERTEX_BATCH_SIZE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.WORD_OFFSET">
+<span class="target" id="olap__base_8h_1aaa604dee271e714e574fa9a36fd57682"></span><span class="sig-name descname"><span class="n"><span class="pre">WORD_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.WORD_OFFSET" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp macro">
+<dt class="sig sig-object cpp" id="c.BIT_OFFSET">
+<span class="target" id="olap__base_8h_1a5a49e33dd4567ba395e94a35716669b6"></span><span class="sig-name descname"><span class="n"><span class="pre">BIT_OFFSET</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#c.BIT_OFFSET" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="olap__base_8h_1a539fe76ede7635af5ee150bd33d03317"></span><span class="sig-name descname"><span class="pre">union</span> <span class="pre">@5</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49neighbour">
+<span id="_CPPv39neighbour"></span><span id="_CPPv29neighbour"></span><span id="neighbour__s"></span><span class="target" id="olap__base_8h_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv49neighbour" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv49edge_data">
+<span id="_CPPv39edge_data"></span><span id="_CPPv29edge_data"></span><span id="edge_data__EdgeData"></span><span class="target" id="olap__base_8h_1a24f41c52f29d0ba9636668d50ed99a63"></span><span class="n"><span class="pre">EdgeData</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv49edge_data" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43src">
+<span id="_CPPv33src"></span><span id="_CPPv23src"></span><span id="src__s"></span><span class="target" id="olap__base_8h_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv43src" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv43dst">
+<span id="_CPPv33dst"></span><span id="_CPPv23dst"></span><span id="dst__s"></span><span class="target" id="olap__base_8h_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv43dst" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olapE">
+<span id="_CPPv3N10lgraph_api4olapE"></span><span id="_CPPv2N10lgraph_api4olapE"></span><span id="lgraph_api::olap"></span><span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olapE" title="永久链接至目标"></a><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-enums">Enums</p>
+<dl class="cpp enum">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicyE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aae"></span><span class="k"><span class="pre">enum</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="永久链接至目标"></a><br></dt>
+<dd><p>Define the edge direction policy of graph The policy determines the graph symmetric and undirected feature. </p>
+<p><em>Values:</em></p>
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaea17946ea357e5e0a46f7354049d684ba1"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DUAL_DIRECTION</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14DUAL_DIRECTIONE" title="永久链接至目标"></a><br></dt>
+<dd><p>The graph is asymmetric. The edges from input files are outgoing edges. The reversed edges form incoming edges. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeafdc4fc0261af8c2b6f66ab00eed5fe55"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAKE_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy14MAKE_SYMMETRICE" title="永久链接至目标"></a><br></dt>
+<dd><p>The graph is symmetric but the input files are asymmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+<dl class="cpp enumerator">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE">
+<span id="_CPPv3N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span id="_CPPv2N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE"></span><span class="target" id="namespacelgraph__api_1_1olap_1a75e96925fdfd908d94ef5a9b23e55aaeaa1b7f74c74bb030bf8360c598fdfc08f"></span><span class="k"><span class="pre">enumerator</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">INPUT_SYMMETRIC</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicy15INPUT_SYMMETRICE" title="永久链接至目标"></a><br></dt>
+<dd><p>Both the graph and the input files are symmetric. The outgoing and incoming edges are identical. </p>
+</dd></dl>
+
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-functions">Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a944bcbf0349029631b4fbda1660df186"></span><span class="sig-name descname"><span class="pre">template&lt;typename</span> <span class="pre">EdgeData&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1a6eded0577caa238e1cf59a742cbc7eeb"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">struct</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum">
+<span id="_CPPv3I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span id="_CPPv2I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aaa30a5461bdf30947283236f847714e7"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reduce_plus</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">a</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">b</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="永久链接至目标"></a><br></dt>
+<dd><p>The default reduce function which uses the plus operator. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a5bcc917c95bec960faafcf5506201325"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexE1TR7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIFvR11TransactionR14VertexIteratorR1TEEENSt8functionIFvRK1TR1TEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t">
+<span id="_CPPv3I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span id="_CPPv2I0EN10lgraph_api4olap13ForEachVertexER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1ac8203a028b53e5841a52737f4a4f3bcd"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ForEachVertex</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">workers</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">int64_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertices</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="lgraph_api::olap::ForEachVertex::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">parallel_factor</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">8</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap13ForEachVertexENSt6vectorI1TEER7GraphDBR11TransactionRNSt6vectorI6WorkerEERKNSt6vectorI7int64_tEENSt8functionIF1TR11TransactionR14VertexIterator6size_tEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap_1abf9e945446fe724862c9960198e7174f"></span><span class="sig-name descname"><span class="pre">struct</span> <span class="pre">lgraph_api::olap::EdgeStringUnit</span> <span class="pre">__attribute__</span></span></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap13MAX_NUM_EDGESE"></span><span id="lgraph_api::olap::MAX_NUM_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a8b2861b30aec5ae10d4519bf3a8ce0f2"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MAX_NUM_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">36</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap13MAX_NUM_EDGESE" title="永久链接至目标"></a><br></dt>
+<dd><p>The maximum number of edges. Change this value if needed. </p>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjListE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjListE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjListE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1AdjList"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEv"></span><span id="lgraph_api::olap::AdjList::AdjList"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a8b7b96acd6306a4b7c5b74df226e6f7e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList5beginEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList5beginEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList5beginEv"></span><span id="lgraph_api::olap::AdjList::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a1b44a588619cf9b27a4cf547d290bcf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList5beginEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList3endEv">
+<span id="_CPPv3N10lgraph_api4olap7AdjList3endEv"></span><span id="_CPPv2N10lgraph_api4olap7AdjList3endEv"></span><span id="lgraph_api::olap::AdjList::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1af77a3b6fb415f06e5b56bfc9be448a70"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList3endEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjListixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap7AdjListixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap7AdjListixE6size_t"></span><span id="lgraph_api::olap::AdjList::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a62df7b80147908931b2be1c979639f43"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjListixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE"></span><span id="lgraph_api::olap::AdjList::AdjList__AdjUnit:EdgeData:P.AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a50f0d642dca2d5631b139d235bd790f4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjList</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">begin</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">end</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList7AdjListEP7AdjUnitI8EdgeDataEP7AdjUnitI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList6begin_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList6begin_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList6begin_E"></span><span id="lgraph_api::olap::AdjList::begin___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1aaf99bb4a670e8aa9cae1d700f1e57c5c"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList6begin_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjList4end_E">
+<span id="_CPPv3N10lgraph_api4olap7AdjList4end_E"></span><span id="_CPPv2N10lgraph_api4olap7AdjList4end_E"></span><span id="lgraph_api::olap::AdjList::end___AdjUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1AdjList_1a90c044b28a9a95203b0a0c289772e178"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjList4end_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-friends">Friends</p>
+<dl>
+<dt class="sig sig-object cpp">
+<em class="property"><span class="pre">friend</span> <span class="pre">class</span></em> <span class="pre">OlapBase&lt;</span> <span class="pre">EdgeData</span> <span class="pre">&gt;</span></dt>
+</dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap7AdjUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap7AdjUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap7AdjUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjUnit&lt;EdgeData&gt; represents an adjacent edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9neighbourE"></span><span id="lgraph_api::olap::AdjUnit::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9neighbourE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnit9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnit9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap7AdjUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AdjUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap7AdjUnitI5EmptyEE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1aacfa29d2dd368a125e50f21c115ec46f"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::AdjUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@4</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::neighbour__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a2c593b212290a95a21b89a16e36c4fd1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">neighbour</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9neighbourE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::AdjUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1AdjUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap7AdjUnitI5EmptyE9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap14EdgeStringUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeStringUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeStringUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type, The vertex is of string type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3srcE"></span><span id="lgraph_api::olap::EdgeStringUnit::src__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1aac2e7b82f607b746d5b33c401a555ad4"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3srcE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit3dstE"></span><span id="lgraph_api::olap::EdgeStringUnit::dst__ss"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1a030e02dd512080f9859d50b7c2f10db0"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit3dstE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap14EdgeStringUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeStringUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeStringUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14EdgeStringUnitE" title="lgraph_api::olap::EdgeStringUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14EdgeStringUnit9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8EdgeUnitE">
+<span id="_CPPv3I0EN10lgraph_api4olap8EdgeUnitE"></span><span id="_CPPv2I0EN10lgraph_api4olap8EdgeUnitE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>EdgeUnit&lt;EdgeData&gt; represents an edge with EdgeData as the weight type. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3srcE"></span><span id="lgraph_api::olap::EdgeUnit::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3srcE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit3dstE"></span><span id="lgraph_api::olap::EdgeUnit::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit3dstE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnit9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit::edge_data__EdgeData"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_1abef8516834bac6d3876322f9b3e1eff1"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnit9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE">
+<span id="_CPPv3IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span id="_CPPv2IEN10lgraph_api4olap8EdgeUnitI5EmptyEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeUnit</span></span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4IEN10lgraph_api4olap8EdgeUnitI5EmptyEE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp">
+<span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a4a58050a4c0f1da86ec007813a4ec308"></span><span class="sig-name descname"><span class="pre">template&lt;&gt;</span> <span class="pre">union</span> <span class="pre">lgraph_api::olap::EdgeUnit&lt;</span> <span class="pre">Empty</span> <span class="pre">&gt;::@6</span> <span class="pre">__attribute__</span> <span class="pre">((packed))</span></span></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::src__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a8648ffe7342bea77e2698690589da3c1"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">src</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3srcE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::dst__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a720827d53e80d32b23f708768099d331"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">dst</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE3dstE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE">
+<span id="_CPPv3N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="_CPPv2N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE"></span><span id="lgraph_api::olap::EdgeUnit:Empty:::edge_data__Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1EdgeUnit_3_01Empty_01_4_1a24f41c52f29d0ba9636668d50ed99a63"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="lgraph_api::olap::Empty"><span class="n"><span class="pre">Empty</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8EdgeUnitI5EmptyE9edge_dataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap5EmptyE">
+<span id="_CPPv3N10lgraph_api4olap5EmptyE"></span><span id="_CPPv2N10lgraph_api4olap5EmptyE"></span><span id="lgraph_api::olap::Empty"></span><span class="target" id="structlgraph__api_1_1olap_1_1Empty"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Empty</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap5EmptyE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> is used for representing unweighted graphs. </p>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBaseE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBaseE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBaseE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>AdjList&lt;EdgeData&gt; allows range-based for-loop over AdjUnit&lt;EdgeData&gt;. </p>
+<p>Graph</p>
+<p>
+EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>EdgeData</strong> – Type of the edge data.</p></li>
+<li><p><strong>EdgeData</strong> – Graph instances represent static (sub)graphs loaded from txt file. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses.</p></li>
+<li><p><strong>EdgeData</strong> – Type of the edge data. </p></li>
+</ul>
+</dd>
+</dl>
+<p>Subclassed by <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB&lt; EdgeData &gt;</span></a></p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OlapBaseEv"></span><span id="lgraph_api::olap::OlapBase::OlapBase"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8b1cb218d9ddbe502eda5a2f0d674d1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapBase</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OlapBaseEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Constructor of Graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapBase::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af1aedb46d1972859e79efafbe6c33ec2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17CheckKillThisTaskEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9OutDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a6c48401f52e77a7286b04c528b98dc5e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9OutDegreeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the out-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The out-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8InDegreeE6size_t"></span><span id="lgraph_api::olap::OlapBase::InDegree__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aaa9b9b0056536f6d533c1dfed9fc0ef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InDegree</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8InDegreeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the in-degree of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The in-degree of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8OutEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::OutEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ada8118bd934579318a4ed38d0233b70d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OutEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8OutEdgesE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the outgoing edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The outgoing edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase7InEdgesE6size_t"></span><span id="lgraph_api::olap::OlapBase::InEdges__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a19e62567748b5c1a224457b9756d4002"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjListE" title="lgraph_api::olap::AdjList"><span class="n"><span class="pre">AdjList</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">InEdges</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase7InEdgesE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Access the incoming edges of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The incoming edges of the specified vertex in the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9TransposeEv"></span><span id="lgraph_api::olap::OlapBase::Transpose"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a109318636af36bc89e9853f19e4369e2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Transpose</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9TransposeEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Transpose the graph. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11NumVerticesEv"></span><span id="lgraph_api::olap::OlapBase::NumVertices"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a07d9840894a10d114719bcf339a5a20d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumVertices</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11NumVerticesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get number of vertices of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of vertices of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8NumEdgesEv"></span><span id="lgraph_api::olap::OlapBase::NumEdges"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af16ce4014b334a365ccac510c4e4045d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">NumEdges</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8NumEdgesEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get number of edges of the Graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>Number of edges of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayEv"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a010ffba60888eacee4ed8153d69e22d6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="lgraph_api::olap::OlapBase::AllocVertexArray::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexArray</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase16AllocVertexArrayE14ParallelVectorI10VertexDataEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Allocate a vertex array with type VertexData. </p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>VertexData</strong> – Type of the vertex data.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> with type VertexData. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv"></span><span id="lgraph_api::olap::OlapBase::AllocVertexSubset"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a950a6ba41cf3e3885d043c15616f583d"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AllocVertexSubset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AllocVertexSubsetEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Allocate a vertex subset represented with <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> sized |V| of the Graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::AcquireVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac15d778dde37cd4ec7f0471d170fe35a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">AcquireVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17AcquireVertexLockE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Lock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::ReleaseVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a3d005cde32497e212181e88217938f25"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReleaseVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase17ReleaseVertexLockE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Unlock some vertex to ensure correct concurrent updates. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t"></span><span id="lgraph_api::olap::OlapBase::GuardVertexLock__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea1c361387ef31606753020550642cf9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="lgraph_api::olap::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">GuardVertexLock</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15GuardVertexLockE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the Graph) to lock/unlock.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> corresponding to the specified vertex. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset"></span><span id="lgraph_api::olap::OlapBase::IfSparse__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab8096171f84ad9c7c78c9ea965c475a8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">IfSparse</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase8IfSparseER14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd><p>Judging whether it is sparse mode or dense mode according to the number of vertices. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>active_vertices</strong> – The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> of active_vertices. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t"></span><span id="lgraph_api::olap::OlapBase::set_num_vertices__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ab0c9ca5cca45f72dcbb4ebe427e64b4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">set_num_vertices</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase16set_num_verticesE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Assign vertices to the first loaded graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vertices</strong> – The vertex id (in the Graph) to lock/unlock. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy"></span><span id="lgraph_api::olap::OlapBase::LoadFromArray__cP.s.s.EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a16c3082aa7057bdc8e80f6491e6d8e88"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">LoadFromArray</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">edge_array</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_vertices</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">input_edges</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">edge_direction_policy</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13LoadFromArrayEPc6size_t6size_t19EdgeDirectionPolicy" title="永久链接至目标"></a><br></dt>
+<dd><p>Load graph data from edge_array. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>edge_array</strong> – <strong>[in]</strong> The data in this array is read into the graph. </p></li>
+<li><p><strong>input_vertices</strong> – The number of vertices in the input graph data. </p></li>
+<li><p><strong>input_edges</strong> – The number of edges in the input graph data. </p></li>
+<li><p><strong>edge_direction_policy</strong> – Graph data loading method. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a23cdd3850d0641f99a761cd30318ddae"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum6size_tEEE6size_t6size_t10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Execute a parallel-for loop in the range [lower, upper). </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">模板参数</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing the work. </p></li>
+<li><p><strong>lower</strong> – The lower bound of the range (inclusive). </p></li>
+<li><p><strong>upper</strong> – The upper bound of the range (exclusive). </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeENSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adbf76a87d17dfdeb4554fc058772f351"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexInRange</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">lower</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">upper</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexInRange::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase20ProcessVertexInRangeE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEE6size_t6size_t9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a2115dc228e9cde0ea88fad83d9527ebe"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum6size_tEEER14ParallelBitset10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Process a set of active vertices in parallel. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">模板参数</dt>
+<dd class="field-even"><p><strong>ReducedSum</strong> – Type of the reduced sum. </p>
+</dd>
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>work</strong> – The function describing each vertex’s work. </p></li>
+<li><p><strong>active_vertices</strong> – <strong>[inout]</strong> The active vertex set. </p></li>
+<li><p><strong>zero</strong> – (Optional) The initial value for reduction. </p></li>
+<li><p><strong>reduce</strong> – (Optional) The function describing the reduction logic.</p></li>
+</ul>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A reduction value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE">
+<span id="_CPPv3I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span id="_CPPv2I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveENSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReducedSum</span></span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Algorithm</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac8cdec9111784ddeb528c899d99ea5bd"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ProcessVertexActive</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">active_vertices</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::Algorithm"><span class="n"><span class="pre">Algorithm</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">algorithm</span></span>, <a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">zero</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">reduce</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap11reduce_plusE10ReducedSum10ReducedSum10ReducedSum" title="lgraph_api::olap::reduce_plus"><span class="n"><span class="pre">reduce_plus</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="lgraph_api::olap::OlapBase::ProcessVertexActive::ReducedSum"><span class="n"><span class="pre">ReducedSum</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I00EN10lgraph_api4olap8OlapBase19ProcessVertexActiveE10ReducedSumNSt8functionIF10ReducedSum9Algorithm6size_tEEER14ParallelBitset9Algorithm10ReducedSumNSt8functionIF10ReducedSum10ReducedSum10ReducedSumEEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-functions">Protected Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9ConstructEv"></span><span id="lgraph_api::olap::OlapBase::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ad0df12e23dc13705b7160effdecdca73"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9ConstructEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-protected-attributes">Protected Attributes</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase13num_vertices_E"></span><span id="lgraph_api::olap::OlapBase::num_vertices___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a4761ec310a7a2ec3d0f7becfb3824964"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_vertices_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase13num_vertices_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10num_edges_E"></span><span id="lgraph_api::olap::OlapBase::num_edges___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1ac4dfd32613a83596fa43818fd979a6e2"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">num_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10num_edges_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_data_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_data_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a703092681fc7abbc984632b1644216cd"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_data_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_data_size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase14adj_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::adj_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aec12c1eea29776d600cedb7c8de70b71"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">adj_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase14adj_unit_size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase15edge_unit_size_E"></span><span id="lgraph_api::olap::OlapBase::edge_unit_size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aea4bca314eba173531bc9f04e35888e7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_unit_size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase15edge_unit_size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase22edge_direction_policy_E"></span><span id="lgraph_api::olap::OlapBase::edge_direction_policy___EdgeDirectionPolicy"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a59e5aefcf4de1752fda0c644c4bf920a"></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap19EdgeDirectionPolicyE" title="lgraph_api::olap::EdgeDirectionPolicy"><span class="n"><span class="pre">EdgeDirectionPolicy</span></span></a><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_direction_policy_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase22edge_direction_policy_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10edge_list_E"></span><span id="lgraph_api::olap::OlapBase::edge_list___EdgeUnit:EdgeData:P"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aa463cdb96cdb7fa5bc259c8facc9aed9"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8EdgeUnitE" title="lgraph_api::olap::EdgeUnit"><span class="n"><span class="pre">EdgeUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">edge_list_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10edge_list_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11out_degree_E"></span><span id="lgraph_api::olap::OlapBase::out_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1adb8e1bf54dfd199e838ec45066f8f758"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11out_degree_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10in_degree_E"></span><span id="lgraph_api::olap::OlapBase::in_degree___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a55bb224127fd22ab38d9ea251d83895a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_degree_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10in_degree_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_index_E"></span><span id="lgraph_api::olap::OlapBase::out_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1af6c2b6632374310efa986cf7aa54fd55"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_index_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_index_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_index_E"></span><span id="lgraph_api::olap::OlapBase::in_index___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a8f5032936723f9e23aec62f377b2a3ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_index_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_index_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase10out_edges_E"></span><span id="lgraph_api::olap::OlapBase::out_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a890254f0669f50d5d51c0b7f3c6b94ef"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase10out_edges_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase9in_edges_E"></span><span id="lgraph_api::olap::OlapBase::in_edges___ParallelVector:AdjUnit:EdgeData::"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1a35d8cc39082a3468d82e0bf4412aee62"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap7AdjUnitE" title="lgraph_api::olap::AdjUnit"><span class="n"><span class="pre">AdjUnit</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">in_edges_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase9in_edges_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapBase11lock_array_E"></span><span id="lgraph_api::olap::OlapBase::lock_array___ParallelVector:b:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapBase_1aee90f899c9abd99447bfa22781c5634d"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lock_array_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapBase11lock_array_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetE"></span><span id="lgraph_api::olap::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p><a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a> implements the concurrent bitset data structure, which is usually used to represent active vertex sets. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af71b86fef4aceb1ea4e0c39a4ee73369"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelBitset"><span class="std std-ref">ParallelBitset</span></a>. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>size</strong> – The size of the bitset (i.e. the number of bits). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7242b92edfd78d370c06883f93674ebe"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERK14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::assign-operator__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ab16e3e695d258f2ce3d1ad5eef412a12"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetaSERR14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset__ParallelBitsetRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ae83afc3b8694c5e279c03836a293ca1c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="lgraph_api::olap::ParallelBitset::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetERR14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv"></span><span id="lgraph_api::olap::ParallelBitset::ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a1f67570cf9608fb5b62de10c44519e6e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset14ParallelBitsetEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitsetD0Ev"></span><span id="lgraph_api::olap::ParallelBitset::~ParallelBitset"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7779a66d09a414c3ef215609e2dc9da8"></span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelBitset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5ClearEv"></span><span id="lgraph_api::olap::ParallelBitset::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5ClearEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Clear the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4FillEv"></span><span id="lgraph_api::olap::ParallelBitset::Fill"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1af5105c0eef86140ad8203af2bf159d57"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4FillEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Fill the bitset. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3HasE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Has__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ade408d5cd908ff319ee49500dbb898da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Has</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3HasE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Test a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to test.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Whether the bit is set or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset3AddE6size_t"></span><span id="lgraph_api::olap::ParallelBitset::Add__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a9d6d2b50895f5add363b7a1a30b0b804"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Add</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset3AddE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Set a specified bit. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>i</strong> – The bit to set.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>Whether the operation is a true addition or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset"></span><span id="lgraph_api::olap::ParallelBitset::Swap__ParallelBitsetR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad079bdc6ea46251fa256de71ac77c8db"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelBitsetE" title="lgraph_api::olap::ParallelBitset"><span class="n"><span class="pre">ParallelBitset</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SwapER14ParallelBitset" title="永久链接至目标"></a><br></dt>
+<dd><p>Swap the current bitset with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other bitset to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4DataEv"></span><span id="lgraph_api::olap::ParallelBitset::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5503ab878f0444a70c87fcce727a4b3c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4DataEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset4SizeEv"></span><span id="lgraph_api::olap::ParallelBitset::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5data_E"></span><span id="lgraph_api::olap::ParallelBitset::data___uint64_tP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1ad26e57b8e7bb88f06c363fab8e7009a2"></span><span class="n"><span class="pre">uint64_t</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5data_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelBitset5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelBitset5size_E"></span><span id="lgraph_api::olap::ParallelBitset::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelBitset_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelBitset5size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap14ParallelVectorE">
+<span id="_CPPv3I0EN10lgraph_api4olap14ParallelVectorE"></span><span id="_CPPv2I0EN10lgraph_api4olap14ParallelVectorE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">T</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>ParallelVector&lt;T&gt; aims to mimic std::vector&lt;T&gt;. Note that the deletions other than clearing are not supported. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aef646925bb31e3dcc02a67e584e6d2d4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><p><strong>capacity</strong> – The capacity of the vector. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__s.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab1334ee433460a07146e277f7e4c30d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorE6size_t6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt;. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>capacity</strong> – The capacity of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__TP.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a140f4d7cdcdfec667cf096f6d855b155"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">data</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEP1T6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Construct a ParallelVector&lt;T&gt; </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>data</strong> – The initial data of the vector. </p></li>
+<li><p><strong>size</strong> – The initial size of the vector. And the initial capacity equals initial size. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a3aae6881aa98ab806d5eabd668491187"></span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERK14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1af4d6dc6eecb55e2ddf126fef29b17c79"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="lgraph_api::olap::ParallelVector::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorERR14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::assign-operator__ParallelVector:T:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a70489ba54b4027e4e589c93a6a474666"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectoraSERR14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector14ParallelVectorEv"></span><span id="lgraph_api::olap::ParallelVector::ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ae3fed3af74f330a9856fe2cd42482f44"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector14ParallelVectorEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Default constructor of ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7DestroyEv"></span><span id="lgraph_api::olap::ParallelVector::Destroy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ac919a991060ede6983343719401686de"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7DestroyEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Destroy ParallelVector&lt;T&gt;. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorD0Ev"></span><span id="lgraph_api::olap::ParallelVector::~ParallelVector"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2a254fcaade5cc8050f3c5eca1893619"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~ParallelVector</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVectorixE6size_t"></span><span id="lgraph_api::olap::ParallelVector::subscript-operator__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5d56cb4cffc7089978d354304eb5a7a6"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">[]</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">i</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVectorixE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5beginEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5beginEv"></span><span id="lgraph_api::olap::ParallelVector::begin"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a23e2fdb99370f37cb764cac10378c721"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">begin</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5beginEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector3endEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector3endEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector3endEv"></span><span id="lgraph_api::olap::ParallelVector::end"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5994ad65dce0457b21adb6a10c8642dc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector3endEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4BackEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4BackEv"></span><span id="lgraph_api::olap::ParallelVector::Back"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9fadc3b5d96a350533f1221345259aab"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">Back</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4BackEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4DataEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4DataEv"></span><span id="lgraph_api::olap::ParallelVector::Data"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ab2c9a1b384ad445ddc5da54c669e3136"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">Data</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4DataEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SizeEv"></span><span id="lgraph_api::olap::ParallelVector::Size"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a7b470b21b5807f0a9162bef72aebfef9"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Size</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SizeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector8CapacityEv"></span><span id="lgraph_api::olap::ParallelVector::Capacity"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a2ee0a564b6468179fd94541c4bbf85d3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Capacity</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector8CapacityEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9DestroyedEv"></span><span id="lgraph_api::olap::ParallelVector::Destroyed"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a907f5acbcd44ca4faa2f02fde7bd2df1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Destroyed</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9DestroyedEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_t"></span><span id="lgraph_api::olap::ParallelVector::Resize__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1ad9cf0e91780366986c2f047bd796cdd5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>size</strong> – Value of new size. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T"></span><span id="lgraph_api::olap::ParallelVector::Resize__s.TCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a4a62b4cde89680b486c2560241cd594a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Resize</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">size</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6ResizeE6size_tRK1T" title="永久链接至目标"></a><br></dt>
+<dd><p>Change <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> size and initialize the new element with elem. Note the new size should be larger than or equal to elder size. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>size</strong> – Value of new size. </p></li>
+<li><p><strong>elem</strong> – Initial value of new-added element. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5ClearEv"></span><span id="lgraph_api::olap::ParallelVector::Clear"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa71d36872f416feaa853788a7a7a7ef8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Clear</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5ClearEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Clear all data and change size to 0. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector7ReAllocE6size_t"></span><span id="lgraph_api::olap::ParallelVector::ReAlloc__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a1a61eab0948012f137795032a19d4664"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ReAlloc</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">capacity</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector7ReAllocE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Destroy elder data and allocate with new capacity. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>capacity</strong> – New capacity value. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4FillE1T"></span><span id="lgraph_api::olap::ParallelVector::Fill__T"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a016e89b3314c7d5d0b82b762bad05a28"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Fill</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="n sig-param"><span class="pre">elem</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4FillE1T" title="永久链接至目标"></a><br></dt>
+<dd><p>Assign the vector’s elements with a common value. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>elem</strong> – The common value. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>     <span class="n">This</span> <span class="n">action</span> <span class="ow">is</span> <span class="n">performed</span> <span class="ow">in</span> <span class="n">parallel</span><span class="p">,</span> <span class="n">so</span> <span class="n">you</span> <span class="n">should</span> <span class="ow">not</span> <span class="n">call</span>
+     <span class="n">it</span> <span class="n">inside</span> <span class="n">another</span> <span class="n">parallel</span> <span class="n">region</span> <span class="p">(</span><span class="n">via</span> <span class="n">Worker</span><span class="p">::</span><span class="n">Delegate</span><span class="p">)</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendERK1Tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TCR.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a43b8a4f1da7a245932babf7b42aa69db"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">elem</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendERK1Tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Append an element to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>elem</strong> – The element. </p></li>
+<li><p><strong>atomic</strong> – (Optional) Whether atomic instructions should be used or not. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb"></span><span id="lgraph_api::olap::ParallelVector::Append__TP.s.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a26d7da32681aab4177e5404de5216525"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">buf</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">count</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendEP1T6size_tb" title="永久链接至目标"></a><br></dt>
+<dd><p>Append an array of elements to the vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>buf</strong> – <strong>[inout]</strong> The array pointer. </p></li>
+<li><p><strong>count</strong> – The array length. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb"></span><span id="lgraph_api::olap::ParallelVector::Append__ParallelVector:T:R.b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a9c6d119f42bbb02b422f2abdf5a39a26"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Append</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span>, <span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">atomic</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">true</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector6AppendER14ParallelVectorI1TEb" title="永久链接至目标"></a><br></dt>
+<dd><p>Append another vector of elements to this. </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>other</strong> – <strong>[inout]</strong> The other vector. </p></li>
+<li><p><strong>atomic</strong> – (Optional) True to atomic. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE"></span><span id="lgraph_api::olap::ParallelVector::Swap__ParallelVector:T:R"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1acd7f1912f9dbf8e003bd6e72e4e9efd2"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Swap</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">other</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4SwapER14ParallelVectorI1TE" title="永久链接至目标"></a><br></dt>
+<dd><p>Swap the current vector with another one. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>other</strong> – <strong>[inout]</strong> The other vector to swap with. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector4CopyEv"></span><span id="lgraph_api::olap::ParallelVector::Copy"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a6ea526f22af350302e37123f3c37e4ff"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Copy</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector4CopyEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Copy the current vector. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A new vector with the same copied content. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector10destroyed_E"></span><span id="lgraph_api::olap::ParallelVector::destroyed___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a62dfd137075e11ff18b5516f41bd50c2"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">destroyed_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector10destroyed_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector9capacity_E"></span><span id="lgraph_api::olap::ParallelVector::capacity___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa3099a4c2b0b3ab5ba4188b4a8f59b26"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">capacity_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector9capacity_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5data_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5data_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5data_E"></span><span id="lgraph_api::olap::ParallelVector::data___TP"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1aa5a936fbbc363fa1913fdaadc70d872a"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector::T"><span class="n"><span class="pre">T</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">data_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5data_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap14ParallelVector5size_E">
+<span id="_CPPv3N10lgraph_api4olap14ParallelVector5size_E"></span><span id="_CPPv2N10lgraph_api4olap14ParallelVector5size_E"></span><span id="lgraph_api::olap::ParallelVector::size___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1ParallelVector_1a5f31775800bbb46b35b5791def1f3acc"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">size_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap14ParallelVector5size_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp struct">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadStateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadStateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadStateE"></span><span id="lgraph_api::olap::ThreadState"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState"></span><span class="k"><span class="pre">struct</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ThreadState</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadStateE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-members">Public Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState4currE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState4currE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState4currE"></span><span id="lgraph_api::olap::ThreadState::curr__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a8eea8ae4d204a609211b5cdf1e0aa19a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">curr</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState4currE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState3endE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState3endE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState3endE"></span><span id="lgraph_api::olap::ThreadState::end__s"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1aca05b1afbbe1c83cf087b49df03c441a"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">end</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState3endE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap11ThreadState5stateE">
+<span id="_CPPv3N10lgraph_api4olap11ThreadState5stateE"></span><span id="_CPPv2N10lgraph_api4olap11ThreadState5stateE"></span><span id="lgraph_api::olap::ThreadState::state__i"></span><span class="target" id="structlgraph__api_1_1olap_1_1ThreadState_1a89f234133d3efe315836311cbf21c64b"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">state</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap11ThreadState5stateE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardE">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardE"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardE"></span><span id="lgraph_api::olap::VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>The <a class="reference internal" href="#classlgraph__api_1_1olap_1_1VertexLockGuard"><span class="std std-ref">VertexLockGuard</span></a> automatically acquires the lock on construction and releases the lock on destruction. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__bVP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aca9940bbc3948c4b105cf4edf770aeac"></span><span class="k"><span class="pre">explicit</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">volatile</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">lock</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardEPVb" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardCR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1a89a098e56f889f8015db67136b3c8ee3"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERK15VertexLockGuard" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard"></span><span id="lgraph_api::olap::VertexLockGuard::VertexLockGuard__VertexLockGuardRR"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aeb1d045c401b22855341e0084681ec13"></span><span class="sig-name descname"><span class="n"><span class="pre">VertexLockGuard</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="lgraph_api::olap::VertexLockGuard::VertexLockGuard"><span class="n"><span class="pre">VertexLockGuard</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard15VertexLockGuardERR15VertexLockGuard" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuardD0Ev"></span><span id="lgraph_api::olap::VertexLockGuard::~VertexLockGuard"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1aa7fb9013a4d1c11f4bf8c73c079d8e55"></span><span class="sig-name descname"><span class="n"><span class="pre">~VertexLockGuard</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuardD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E">
+<span id="_CPPv3N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="_CPPv2N10lgraph_api4olap15VertexLockGuard5lock_E"></span><span id="lgraph_api::olap::VertexLockGuard::lock___bP"></span><span class="target" id="classlgraph__api_1_1olap_1_1VertexLockGuard_1ac56529c72897ed7db313a69efe299cb3"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">lock_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap15VertexLockGuard5lock_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerE">
+<span id="_CPPv3N10lgraph_api4olap6WorkerE"></span><span id="_CPPv2N10lgraph_api4olap6WorkerE"></span><span id="lgraph_api::olap::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_base.h&gt;</em></div>
+<p>All the parallel tasks should be delegated through <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> to prevent a huge number of threads being populated via OpenMP. </p>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6WorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker6WorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker6WorkerEv"></span><span id="lgraph_api::olap::Worker::Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1ac243ac161c3b8a4e9b7d8ab6cccceed7"></span><span class="sig-name descname"><span class="n"><span class="pre">Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6WorkerEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6WorkerD0Ev">
+<span id="_CPPv3N10lgraph_api4olap6WorkerD0Ev"></span><span id="_CPPv2N10lgraph_api4olap6WorkerD0Ev"></span><span id="lgraph_api::olap::Worker::~Worker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a6c90b9d499e906079194f681b6cb90ca"></span><span class="sig-name descname"><span class="n"><span class="pre">~Worker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6WorkerD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE">
+<span id="_CPPv3N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span id="_CPPv2N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a78582857fb711225979abb2702d89bad"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Delegate</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker8DelegateERKNSt8functionIFvvEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Send some work to the <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>work</strong> – The function describing the work. </p><div class="highlight-default notranslate"><div class="highlight"><pre><span></span>             <span class="n">Exceptions</span> <span class="n">can</span> <span class="n">be</span> <span class="n">thrown</span> <span class="ow">in</span> <span class="n">the</span> <span class="n">work</span> <span class="n">function</span> <span class="k">if</span> <span class="n">necessary</span><span class="o">.</span>
+             <span class="n">Note</span> <span class="n">that</span> <span class="n">Delegate</span> <span class="n">cannot</span> <span class="n">be</span> <span class="n">nested</span><span class="o">.</span>
+</pre></div>
+</div>
+<p></p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute">
+<span id="_CPPv3I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span id="_CPPv2I0EN10lgraph_api4olap6Worker15DelegateComputeERKNSt8functionIFvR7ComputeEEER7Compute"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Compute</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a7515974ca033a44c70f5b965ba736c7b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">DelegateCompute</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">work</span></span>, <a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="lgraph_api::olap::Worker::DelegateCompute::Compute"><span class="n"><span class="pre">Compute</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">compute</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap6Worker15DelegateComputeEvRKNSt8functionIFvR7ComputeEEER7Compute" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-static-functions">Public Static Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv">
+<span id="_CPPv3N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="_CPPv2N10lgraph_api4olap6Worker12SharedWorkerEv"></span><span id="lgraph_api::olap::Worker::SharedWorker"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a21214620b0c58b939404d191d78e1415"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap6WorkerE" title="lgraph_api::olap::Worker"><span class="n"><span class="pre">Worker</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">SharedWorker</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker12SharedWorkerEv" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the global (shared) worker. </p>
+<dl class="field-list simple">
+<dt class="field-odd">返回</dt>
+<dd class="field-odd"><p>A shared pointer to the global <a class="reference internal" href="#classlgraph__api_1_1olap_1_1Worker"><span class="std std-ref">Worker</span></a> instance. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9stopping_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9stopping_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9stopping_E"></span><span id="lgraph_api::olap::Worker::stopping___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a72446f290a943941576f6803ea96a0da"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">stopping_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9stopping_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker9has_work_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker9has_work_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker9has_work_E"></span><span id="lgraph_api::olap::Worker::has_work___b"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a3b09e0253be21a64efc11b5ad9887b10"></span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">has_work_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker9has_work_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker6mutex_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker6mutex_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker6mutex_E"></span><span id="lgraph_api::olap::Worker::mutex___std::mutex"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a281b5ec791338d4378e22ef44a51b4a1"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">mutex</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">mutex_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker6mutex_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker3cv_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker3cv_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker3cv_E"></span><span id="lgraph_api::olap::Worker::cv___std::condition_variable"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a5eb1f373ea25b73577b6e0205ad7b399"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">condition_variable</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">cv_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker3cv_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker5task_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker5task_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker5task_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a173918333017695d1cb7984078721f78"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">shared_ptr</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">packaged_task</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">task_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker5task_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap6Worker7worker_E">
+<span id="_CPPv3N10lgraph_api4olap6Worker7worker_E"></span><span id="_CPPv2N10lgraph_api4olap6Worker7worker_E"></span><span id="lgraph_api::olap::Worker::worker___std::thread"></span><span class="target" id="classlgraph__api_1_1olap_1_1Worker_1a2d17662c59ba51130a35fdaa8567db74"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">thread</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">worker_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap6Worker7worker_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-on-db">
+<h2>olap_on_db<a class="headerlink" href="#olap-on-db" title="永久链接至标题"></a></h2>
+<p>TuGraph OLAP interface. To implement a plugin that perform graph analytics on TuGraph, user can load a Snapshot from the database, and then use the Gather-Apply-Scatter style interface to do the computation. </p>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-variables">Variables</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_PARALLELE"></span><span id="lgraph_api::olap::SNAPSHOT_PARALLEL__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a24ed9da8cd6c1132a468b64f9ed37f7a"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_PARALLEL</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_PARALLELE" title="永久链接至目标"></a><br></dt>
+<dd><p>The available options for (graph construction) flags. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE"></span><span id="lgraph_api::olap::SNAPSHOT_UNDIRECTED__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1ac92e5bd74f22a5d50d401c61577c2502"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_UNDIRECTED</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">1</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_UNDIRECTEDE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE"></span><span id="lgraph_api::olap::SNAPSHOT_IDMAPPING__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1af550d7266e9792ecd7c8d4cec91b8ceb"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IDMAPPING</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">2</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IDMAPPINGE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a7942e3aa179aef017291e80f6cab14ca"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">3</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap19SNAPSHOT_OUT_DEGREEE" title="永久链接至目标"></a><br></dt>
+<dd><p>The following options are not implemented yet. </p>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_DEGREE__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a5553d31915ca2c1c043688e19a45ac10"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_DEGREE</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">4</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_IN_DEGREEE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_OUT_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a1a3bf7fdc6b1674e1dc931f68c1b783e"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_OUT_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">5</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap18SNAPSHOT_OUT_EDGESE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE">
+<span id="_CPPv3N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="_CPPv2N10lgraph_api4olap17SNAPSHOT_IN_EDGESE"></span><span id="lgraph_api::olap::SNAPSHOT_IN_EDGES__s"></span><span class="target" id="namespacelgraph__api_1_1olap_1a44ce105282f3a854a595cc978fa04693"></span><span class="k"><span class="pre">static</span></span><span class="w"> </span><span class="k"><span class="pre">constexpr</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">SNAPSHOT_IN_EDGES</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1ul</span></span><span class="w"> </span><span class="o"><span class="pre">&lt;&lt;</span></span><span class="w"> </span><span class="m"><span class="pre">6</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap17SNAPSHOT_IN_EDGESE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE">
+<span id="_CPPv3I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span id="_CPPv2I0EN10lgraph_api4olap20edge_convert_defaultE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1a6f30998cf8b6f4da8c4d3cbb308b08ca"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="lgraph_api::olap::edge_convert_default::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_default</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">1;return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap20edge_convert_defaultE" title="永久链接至目标"></a><br></dt>
+<dd><p>Default Parser for weighted edges for graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE">
+<span id="_CPPv3I0EN10lgraph_api4olap19edge_convert_weightE"></span><span id="_CPPv2I0EN10lgraph_api4olap19edge_convert_weightE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="namespacelgraph__api_1_1olap_1aa93176409e55c8dbf3df1979c99bb07d"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="lgraph_api::olap::edge_convert_weight::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">edge_convert_weight</span></span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><code class="docutils literal notranslate"><span class="pre">[](OutEdgeIterator</span> <span class="pre">&amp;eit,</span> <span class="pre">EdgeData</span> <span class="pre">&amp;edge_data)</span> <span class="pre">-&gt;</span> <span class="pre">bool</span> <span class="pre">{</span>&nbsp;&nbsp;&nbsp;&nbsp; <span class="pre">edge_data=</span> <span class="pre">eit.GetField("weight").real();return</span> <span class="pre">true;}</span></code><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap19edge_convert_weightE" title="永久链接至目标"></a><br></dt>
+<dd><p>Example parser for extract from edge property “weight” </p>
+<dl class="field-list simple">
+<dt class="field-odd">Return</dt>
+<dd class="field-odd"><p>Edge is converted into graph or not. </p>
+</dd>
+</dl>
+</dd></dl>
+
+</div>
+<dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDBE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDBE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDBE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">EdgeData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="w"> </span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="k"><span class="pre">public</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv410lgraph_api" title="lgraph_api"><span class="n"><span class="pre">lgraph_api</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api4olapE" title="lgraph_api::olap"><span class="n"><span class="pre">olap</span></span></a><span class="p"><span class="pre">::</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapBaseE" title="lgraph_api::olap::OlapBase"><span class="n"><span class="pre">OlapBase</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_on_db.h&gt;</em></div>
+<p>Snapshot is a derived class of Graph. Snapshot instances represent static (sub)graphs exported from LightningGraph. The internal organization uses compressed sparse matrix formats which are optimized for read-only accesses. </p>
+<p>EdgeData is used for representing edge weights (the default type is <a class="reference internal" href="#structlgraph__api_1_1olap_1_1Empty"><span class="std std-ref">Empty</span></a> which is used for unweighted graphs).</p>
+<dl class="field-list simple">
+<dt class="field-odd">模板参数</dt>
+<dd class="field-odd"><p><strong>EdgeData</strong> – Type of the edge data. </p>
+</dd>
+</dl>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a49ed16af93c6bfbaff9856aefb2d8f04"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEP7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1/V2 Procedures </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a31bb964e9baa8452632dfe0d97f253fc"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Generate a graph with LightningGraph. For V1 Procedures </p>
+<p>
+Note: read-write transactions are not recommended here for safety, e.g. some vertices might be removed causing inconsistencies of the analysis, and vertex data extraction may not work for deleted vertices). The constructed graph should contain all vertices whose vertex_filter calls return true and all edges <em>sourced from</em> these vertices whose out_edge_filter calls return true. If SNAPSHOT_UNDIRECTED is specified, the graph will be made symmetric (i.e. reversed edges are also added to the graph). </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>db</strong> – <strong>[inout]</strong> The <a class="reference internal" href="#classlgraph__api_1_1GraphDB"><span class="std std-ref">GraphDB</span></a> instance. </p></li>
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges.</p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__GraphDBR.TransactionR.std::vector:std::vector:ss::.s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a38771d37dea34f28513dd5305385dfa4"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">db</span></span>, <a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">vector</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="p"><span class="pre">&gt;</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">label_list</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER7GraphDBR11TransactionNSt6vectorINSt6vectorINSt6stringEEEEE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a428105b32ebebb9bd1ad5df715e8b3d5"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">txn</span></span>, <span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">flags</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">0</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vertex_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span>, <span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">out_edge_filter</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">nullptr</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBER11Transaction6size_tNSt8functionIFbR14VertexIteratorEEENSt8functionIFbR15OutEdgeIteratorR8EdgeDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Generate a graph without LightningGraph. For V2 Procedures </p>
+<dl class="field-list simple">
+<dt class="field-odd">抛出</dt>
+<dd class="field-odd"><p><span><span class="cpp-expr sig sig-inline cpp"><span class="n">std</span><span class="p">::</span><span class="n">runtime_error</span></span></span> – Raised when a runtime error condition occurs.</p>
+</dd>
+<dt class="field-even">参数</dt>
+<dd class="field-even"><ul class="simple">
+<li><p><strong>txn</strong> – <strong>[inout]</strong> The transaction. </p></li>
+<li><p><strong>flags</strong> – (Optional) The generation flags. </p></li>
+<li><p><strong>vertex_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering vertices. </p></li>
+<li><p><strong>out_edge_filter</strong> – <strong>[inout]</strong> (Optional) A function filtering out edges. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBEv"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a384cbed54b1bcd0610dfc176b0b58563"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:CR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a80b05d175e882c00a314f5ba518a55d4"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="k"><span class="pre">const</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">delete</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERK8OlapOnDBI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::OlapOnDB__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a79cc725b6c20ffac60c4c980e472d7e1"></span><span class="sig-name descname"><span class="n"><span class="pre">OlapOnDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="lgraph_api::olap::OlapOnDB::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="k"><span class="pre">default</span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8OlapOnDBERR8OlapOnDBI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE"></span><span id="lgraph_api::olap::OlapOnDB::assign-operator__OlapOnDB:EdgeData:RR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaa45fb6b0cfa2ce83892f4667684d92a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="k"><span class="pre">operator</span></span><span class="o"><span class="pre">=</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB"><span class="n"><span class="pre">OlapOnDB</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">rhs</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBaSERR8OlapOnDBI8EdgeDataE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDBD0Ev"></span><span id="lgraph_api::olap::OlapOnDB::~OlapOnDB"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c2abb48c34772b4ffd882210300572b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">~OlapOnDB</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDBD0Ev" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a14ebd243f449d5ef5dc6ffc56d0855c3"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ExtractVertexData</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">void</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="lgraph_api::olap::OlapOnDB::ExtractVertexData::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">extract</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB17ExtractVertexDataE14ParallelVectorI10VertexDataENSt8functionIFvR14VertexIteratorR10VertexDataEEE" title="永久链接至目标"></a><br></dt>
+<dd><p>Extract a vertex array from the graph. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>extract</strong> – The function describing the extraction logic.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>A <a class="reference internal" href="#classlgraph__api_1_1olap_1_1ParallelVector"><span class="std std-ref">ParallelVector</span></a> containing each vertex’s extracted data. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB11WriteToFileER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab5f0b3fee89201df1f5fa5bd06cceb4e"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToFile</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToFile::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">output_file</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB11WriteToFileEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Write vertex data to a file. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – The parallel vector storing the vertex data. </p></li>
+<li><p><strong>output_file</strong> – The path to the output file. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE">
+<span id="_CPPv3I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span id="_CPPv2I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBER14ParallelVectorI10VertexDataERKNSt6stringE"></span><span class="k"><span class="pre">template</span></span><span class="p"><span class="pre">&lt;</span></span><span class="k"><span class="pre">typename</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">VertexData</span></span></span><span class="p"><span class="pre">&gt;</span></span><br><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a0c18bf21eacc3c981bb129d99ae63f86"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">WriteToGraphDB</span></span></span><span class="sig-paren">(</span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="lgraph_api::olap::OlapOnDB::WriteToGraphDB::VertexData"><span class="n"><span class="pre">VertexData</span></span></a><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_data</span></span>, <span class="k"><span class="pre">const</span></span><span class="w"> </span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">string</span></span><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="n sig-param"><span class="pre">vertex_field</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDB14WriteToGraphDBEvR14ParallelVectorI10VertexDataERKNSt6stringE" title="永久链接至目标"></a><br></dt>
+<dd><p>Write vertex data to the graph database. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><ul class="simple">
+<li><p><strong>vertex_data</strong> – <strong>[inout]</strong> The parallel vector storing the vertex data. </p></li>
+<li><p><strong>vertex_field</strong> – <strong>[in]</strong> The name of the vertex field. </p></li>
+</ul>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::OriginalVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a514e2403802681b3a6ab6e3e1521f3ad"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">OriginalVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB11OriginalVidE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the original vertex id (in LightningGraph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>vid</strong> – The vertex id (in the graph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The original id of the specified vertex in the graph. </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::MappedVid__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a6ed1fe8e61e5879a68744a79c522ee0a"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MappedVid</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">original_vid</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9MappedVidE6size_t" title="永久链接至目标"></a><br></dt>
+<dd><p>Get the mapped vertex id (in the graph) of some vertex. </p>
+<dl class="field-list simple">
+<dt class="field-odd">参数</dt>
+<dd class="field-odd"><p><strong>original_vid</strong> – The original vertex id (in LightningGraph) to access.</p>
+</dd>
+<dt class="field-even">返回</dt>
+<dd class="field-even"><p>The mapped id of the specified vertex (in LightningGraph). </p>
+</dd>
+</dl>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14GetTransactionEv"></span><span id="lgraph_api::olap::OlapOnDB::GetTransaction"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a05e20809b4047a9dc2d54f28b3f62528"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">GetTransaction</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14GetTransactionEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4InitE6size_t"></span><span id="lgraph_api::olap::OlapOnDB::Init__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a4457f7e41bdf9a2d7fe100d1bdc32ff0"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Init</span></span></span><span class="sig-paren">(</span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">num_vertices</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4InitE6size_t" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv"></span><span id="lgraph_api::olap::OlapOnDB::CheckKillThisTask"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ab7d7ef02dcbc497f1bc8e738188613c8"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">bool</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">CheckKillThisTask</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB17CheckKillThisTaskEv" title="永久链接至目标"></a><br></dt>
+<dd><p>This decision formula is used to determine whether to stop the algorithm running in <a class="reference internal" href="#classlgraph__api_1_1olap_1_1OlapOnDB"><span class="std std-ref">OlapOnDB</span></a>. </p>
+</dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB9ConstructEv"></span><span id="lgraph_api::olap::OlapOnDB::Construct"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a9af72b216eb95e320f0f261d9497c5c1"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="k"><span class="pre">virtual</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">Construct</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB9ConstructEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithVid"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a85b384fc73a534221f880e966c2ca608"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithVid</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16ConstructWithVidEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv"></span><span id="lgraph_api::olap::OlapOnDB::ConstructWithDegree"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1ac2d9a6a8d98a79402d9505ac3270373f"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">ConstructWithDegree</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB19ConstructWithDegreeEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB3db_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB3db_E"></span><span id="lgraph_api::olap::OlapOnDB::db___GraphDBP"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aaaee9f9643b55632219320d15882f548"></span><a class="reference internal" href="#_CPPv4N10lgraph_api7GraphDBE" title="lgraph_api::GraphDB"><span class="n"><span class="pre">GraphDB</span></span></a><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="sig-name descname"><span class="n"><span class="pre">db_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB3db_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB4txn_E"></span><span id="lgraph_api::olap::OlapOnDB::txn___TransactionR"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a773035c2221a293c85f9d2fbb72c5a86"></span><a class="reference internal" href="#_CPPv4N10lgraph_api11TransactionE" title="lgraph_api::Transaction"><span class="n"><span class="pre">Transaction</span></span></a><span class="w"> </span><span class="p"><span class="pre">&amp;</span></span><span class="sig-name descname"><span class="n"><span class="pre">txn_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB4txn_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14original_vids_E"></span><span id="lgraph_api::olap::OlapOnDB::original_vids___ParallelVector:s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a82054e1776bcb3b09cb66389c1eeb781"></span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap14ParallelVectorE" title="lgraph_api::olap::ParallelVector"><span class="n"><span class="pre">ParallelVector</span></span></a><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">original_vids_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14original_vids_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB8vid_map_E"></span><span id="lgraph_api::olap::OlapOnDB::vid_map___cuckoohash_map:s.s:"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a2871a76b39823e6482e093f9b0cacb78"></span><span class="n"><span class="pre">cuckoohash_map</span></span><span class="p"><span class="pre">&lt;</span></span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="n"><span class="pre">size_t</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vid_map_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB8vid_map_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB6flags_E"></span><span id="lgraph_api::olap::OlapOnDB::flags___s"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa1145990d6091cb5d849d2fd09441aa7"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">flags_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB6flags_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB14vertex_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1a5bb1ec258a7281a0702e64c19bcda816"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api14VertexIteratorE" title="lgraph_api::VertexIterator"><span class="n"><span class="pre">VertexIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">vertex_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB14vertex_filter_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E">
+<span id="_CPPv3N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span id="_CPPv2N10lgraph_api4olap8OlapOnDB16out_edge_filter_E"></span><span class="target" id="classlgraph__api_1_1olap_1_1OlapOnDB_1aa4b2136dfe22d40f01778f7b04aa9993"></span><span class="n"><span class="pre">std</span></span><span class="p"><span class="pre">::</span></span><span class="n"><span class="pre">function</span></span><span class="p"><span class="pre">&lt;</span></span><span class="kt"><span class="pre">bool</span></span><span class="p"><span class="pre">(</span></span><a class="reference internal" href="#_CPPv4N10lgraph_api15OutEdgeIteratorE" title="lgraph_api::OutEdgeIterator"><span class="n"><span class="pre">OutEdgeIterator</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#_CPPv4I0EN10lgraph_api4olap8OlapOnDBE" title="lgraph_api::olap::OlapOnDB::EdgeData"><span class="n"><span class="pre">EdgeData</span></span></a><span class="p"><span class="pre">&amp;</span></span><span class="p"><span class="pre">)</span></span><span class="p"><span class="pre">&gt;</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">out_edge_filter_</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8OlapOnDB16out_edge_filter_E" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+<section id="olap-profile">
+<h2>olap_profile<a class="headerlink" href="#olap-profile" title="永久链接至标题"></a></h2>
+<dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">lgraph_api</span></span></span><br></dt>
+<dd><dl class="cpp type">
+<dt class="sig sig-object cpp">
+<span class="target" id="namespacelgraph__api_1_1olap"></span><span class="k"><span class="pre">namespace</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">olap</span></span></span><br></dt>
+<dd><dl class="cpp class">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsageE"></span><span id="lgraph_api::olap::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage"></span><span class="k"><span class="pre">class</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsageE" title="永久链接至目标"></a><br></dt>
+<dd><div class="docutils container">
+<em>#include &lt;olap_profile.h&gt;</em></div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-public-functions">Public Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage8MemUsageEv"></span><span id="lgraph_api::olap::MemUsage::MemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac231833949c8ed135c0e8e59af8d7e6c"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">MemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage8MemUsageEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14getMaxMemUsageEv"></span><span id="lgraph_api::olap::MemUsage::getMaxMemUsage"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a4f02170838631103c72261595c35916b"></span><span class="k"><span class="pre">inline</span></span><span class="w"> </span><span class="n"><span class="pre">int64_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">getMaxMemUsage</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14getMaxMemUsageEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5resetEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5resetEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5resetEv"></span><span id="lgraph_api::olap::MemUsage::reset"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ad20897c5c8bd47f5d4005989bead0e55"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">reset</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5resetEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage14startMemRecordEj"></span><span id="lgraph_api::olap::MemUsage::startMemRecord__unsigned-i"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1ac3db2b796bdfa6e43a1302c5a1072ba3"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">startMemRecord</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">unsigned</span></span><span class="w"> </span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="n sig-param"><span class="pre">interval</span></span><span class="w"> </span><span class="p"><span class="pre">=</span></span><span class="w"> </span><span class="m"><span class="pre">1000</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage14startMemRecordEj" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage5printEv">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage5printEv"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage5printEv"></span><span id="lgraph_api::olap::MemUsage::print"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a388f572c62279f839ee138a9afbdeeb5"></span><span class="kt"><span class="pre">void</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">print</span></span></span><span class="sig-paren">(</span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage5printEv" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-functions">Private Functions</p>
+<dl class="cpp function">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage12parseMemLineEPc"></span><span id="lgraph_api::olap::MemUsage::parseMemLine__cP"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a07befe13a6e76ab6c84719817c5fadbf"></span><span class="kt"><span class="pre">int</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">parseMemLine</span></span></span><span class="sig-paren">(</span><span class="kt"><span class="pre">char</span></span><span class="w"> </span><span class="p"><span class="pre">*</span></span><span class="n sig-param"><span class="pre">line</span></span><span class="sig-paren">)</span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage12parseMemLineEPc" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+<div class="breathe-sectiondef docutils container">
+<p class="breathe-sectiondef-title rubric" id="breathe-section-title-private-members">Private Members</p>
+<dl class="cpp var">
+<dt class="sig sig-object cpp" id="_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE">
+<span id="_CPPv3N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="_CPPv2N10lgraph_api4olap8MemUsage11maxMemUsageE"></span><span id="lgraph_api::olap::MemUsage::maxMemUsage__s"></span><span class="target" id="classlgraph__api_1_1olap_1_1MemUsage_1a274bce27e5ba57cce5606ba61eb28489"></span><span class="n"><span class="pre">size_t</span></span><span class="w"> </span><span class="sig-name descname"><span class="n"><span class="pre">maxMemUsage</span></span></span><a class="headerlink" href="#_CPPv4N10lgraph_api4olap8MemUsage11maxMemUsageE" title="永久链接至目标"></a><br></dt>
+<dd></dd></dl>
+
+</div>
+</dd></dl>
+
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..7773487052
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++存储过程接口
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.md
new file mode 100644
index 0000000000..c525412f94
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.md
@@ -0,0 +1,1543 @@
+
+
+             
+  <section id="python">
+
+<p>Version: 4.3.1</p>
+<p>Copyright (C) 2018-2022 Ant Group.</p>
+<div class="toctree-wrapper compound">
+</div>
+<section id="id1">
+<h2>介绍<a class="headerlink" href="#id1" title="永久链接至标题"></a></h2>
+<p>与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。</p>
+<p>这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。</p>
+</section>
+<section id="module-liblgraph_python_api">
+<span id="id2"></span><h2>接口<a class="headerlink" href="#module-liblgraph_python_api" title="永久链接至标题"></a></h2>
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">AccessLevel</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel" title="永久链接至目标"></a></dt>
+<dd><p>Access that a user has on a graph.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NONE</p>
+<p>READ</p>
+<p>WRITE</p>
+<p>FULL</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.AccessLevel.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.AccessLevel.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">EdgeUid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid" title="永久链接至目标"></a></dt>
+<dd><p>Edge identifier.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.dst">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">dst</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.dst" title="永久链接至目标"></a></dt>
+<dd><p>Destination vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.eid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">eid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.eid" title="永久链接至目标"></a></dt>
+<dd><p>ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.lid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">lid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.lid" title="永久链接至目标"></a></dt>
+<dd><p>Label ID of the edge.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.src">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">src</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.src" title="永久链接至目标"></a></dt>
+<dd><p>Source vertex ID.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.EdgeUid.tid">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">tid</span></span><a class="headerlink" href="#liblgraph_python_api.EdgeUid.tid" title="永久链接至目标"></a></dt>
+<dd><p>Temporal ID of the edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldData</span></span><a class="headerlink" href="#liblgraph_python_api.FieldData" title="永久链接至目标"></a></dt>
+<dd><p>FieldData is the data type of field value.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBlob">
+<span class="sig-name descname"><span class="pre">AsBlob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bytes</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBlob" title="永久链接至目标"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsBool">
+<span class="sig-name descname"><span class="pre">AsBool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsBool" title="永久链接至目标"></a></dt>
+<dd><p>Get value as bool, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDate">
+<span class="sig-name descname"><span class="pre">AsDate</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDate" title="永久链接至目标"></a></dt>
+<dd><p>Get value as date, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDateTime">
+<span class="sig-name descname"><span class="pre">AsDateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">datetime.datetime</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDateTime" title="永久链接至目标"></a></dt>
+<dd><p>Get value as datetime, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsDouble">
+<span class="sig-name descname"><span class="pre">AsDouble</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsDouble" title="永久链接至目标"></a></dt>
+<dd><p>Get value as double, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsFloat">
+<span class="sig-name descname"><span class="pre">AsFloat</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">float</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsFloat" title="永久链接至目标"></a></dt>
+<dd><p>Get value as float, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt16">
+<span class="sig-name descname"><span class="pre">AsInt16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt16" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int16, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt32">
+<span class="sig-name descname"><span class="pre">AsInt32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt32" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int32, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt64">
+<span class="sig-name descname"><span class="pre">AsInt64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt64" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int64, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsInt8">
+<span class="sig-name descname"><span class="pre">AsInt8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsInt8" title="永久链接至目标"></a></dt>
+<dd><p>Get value as int8, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.AsString">
+<span class="sig-name descname"><span class="pre">AsString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.AsString" title="永久链接至目标"></a></dt>
+<dd><p>Get value as string, throws exception on type mismatch</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Blob">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Blob</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bytes</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Blob" title="永久链接至目标"></a></dt>
+<dd><p>Make a BLOB value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Bool">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Bool</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Bool" title="永久链接至目标"></a></dt>
+<dd><p>Make a BOOL value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Date">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Date</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.Date" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>Date(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+<ol class="arabic simple" start="2">
+<li><p>Date(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.DateTime">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">DateTime</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.FieldData.DateTime" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>DateTime(arg0: str) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+<ol class="arabic simple" start="2">
+<li><p>DateTime(arg0: datetime.datetime) -&gt; liblgraph_python_api.FieldData</p></li>
+</ol>
+<p>Make a DATETIME value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Double">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Double</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Double" title="永久链接至目标"></a></dt>
+<dd><p>Make a DOUBLE value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Float">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Float</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">float</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Float" title="永久链接至目标"></a></dt>
+<dd><p>Make a FLOAT value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int16">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int16</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int16" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT16 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int32">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int32</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int32" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT32 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int64">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int64</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int64" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT64 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.Int8">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">Int8</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.Int8" title="永久链接至目标"></a></dt>
+<dd><p>Make a INT8 value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.String">
+<em class="property"><span class="pre">static</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">String</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.String" title="永久链接至目标"></a></dt>
+<dd><p>Make a STRING value</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.ToPython">
+<span class="sig-name descname"><span class="pre">ToPython</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.ToPython" title="永久链接至目标"></a></dt>
+<dd><p>Convert to corresponding Python type.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.get">
+<span class="sig-name descname"><span class="pre">get</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">object</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.get" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.isNull">
+<span class="sig-name descname"><span class="pre">isNull</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.isNull" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldData.set">
+<span class="sig-name descname"><span class="pre">set</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.FieldData.set" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldSpec</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec" title="永久链接至目标"></a></dt>
+<dd><p>Field specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.name" title="永久链接至目标"></a></dt>
+<dd><p>Name of this field.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.nullable">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">nullable</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.nullable" title="永久链接至目标"></a></dt>
+<dd><p>Whether this field can be null.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldSpec.type">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">type</span></span><a class="headerlink" href="#liblgraph_python_api.FieldSpec.type" title="永久链接至目标"></a></dt>
+<dd><p>Type of this field, INT8, INT16, …, FLOAT, DOUBLE, STRING.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">FieldType</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType" title="永久链接至目标"></a></dt>
+<dd><p>Data type of FieldData.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>NUL</p>
+<p>BOOL</p>
+<p>INT8</p>
+<p>INT16</p>
+<p>INT32</p>
+<p>INT64</p>
+<p>FLOAT</p>
+<p>DOUBLE</p>
+<p>DATE</p>
+<p>DATETIME</p>
+<p>STRING</p>
+<p>BLOB</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.FieldType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.FieldType.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Galaxy</span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy" title="永久链接至目标"></a></dt>
+<dd><p>A galaxy is a TuGraph instance that holds multiple GraphDBs.
+A galaxy is stored in a directory and manages users and GraphDBs. Each (user, GraphDB) pair can have different access levels. You can use db=Galaxy.OpenGraph(graph) to open a graph. Since garbage collection in Python is automatic, you need to close the galaxy with Galaxy.Close() when you are done with it.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.Close" title="永久链接至目标"></a></dt>
+<dd><p>Closes this galaxy</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateGraph">
+<span class="sig-name descname"><span class="pre">CreateGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">4398046511104</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateGraph" title="永久链接至目标"></a></dt>
+<dd><p>Creates a graph.
+name: the name of the graph
+description: description of the graph
+max_size: maximum size of the graph, default 1TB</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateRole">
+<span class="sig-name descname"><span class="pre">CreateRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateRole" title="永久链接至目标"></a></dt>
+<dd><p>Create a role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.CreateUser">
+<span class="sig-name descname"><span class="pre">CreateUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.CreateUser" title="永久链接至目标"></a></dt>
+<dd><p>Creates a new user account.
+name: name of the user
+password: password for the user
+desc: description of this user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteGraph">
+<span class="sig-name descname"><span class="pre">DeleteGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteGraph" title="永久链接至目标"></a></dt>
+<dd><p>Deletes a graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteRole">
+<span class="sig-name descname"><span class="pre">DeleteRole</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteRole" title="永久链接至目标"></a></dt>
+<dd><p>Deletes the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DeleteUser">
+<span class="sig-name descname"><span class="pre">DeleteUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DeleteUser" title="永久链接至目标"></a></dt>
+<dd><p>Deletes a user account</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.DisableUser">
+<span class="sig-name descname"><span class="pre">DisableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.DisableUser" title="永久链接至目标"></a></dt>
+<dd><p>Disables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.EnableUser">
+<span class="sig-name descname"><span class="pre">EnableUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.EnableUser" title="永久链接至目标"></a></dt>
+<dd><p>Enables a user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.GetUserInfo">
+<span class="sig-name descname"><span class="pre">GetUserInfo</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::UserInfo</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.GetUserInfo" title="永久链接至目标"></a></dt>
+<dd><p>Get information of the specified user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListGraphs">
+<span class="sig-name descname"><span class="pre">ListGraphs</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListGraphs" title="永久链接至目标"></a></dt>
+<dd><p>Lists graphs and returns a dictionary of {name:(desc, max_size)}</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ListUsers">
+<span class="sig-name descname"><span class="pre">ListUsers</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Dict[str,</span> <span class="pre">lgraph_api::UserInfo]</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ListUsers" title="永久链接至目标"></a></dt>
+<dd><p>Lists all users and whether they are admin</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.ModGraph">
+<span class="sig-name descname"><span class="pre">ModGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">description</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_max_size</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.ModGraph" title="永久链接至目标"></a></dt>
+<dd><p>mod_size: whether to modify max graph size
+new_max_size: new maximum size of the graph, in bytes</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.OpenGraph">
+<span class="sig-name descname"><span class="pre">OpenGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">read_only</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::GraphDB</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.OpenGraph" title="永久链接至目标"></a></dt>
+<dd><p>Opens a graph and returns a GraphDB instance.
+graph: name of the graph
+read_only: whether to open the graph in read-only mode</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetCurrentUser">
+<span class="sig-name descname"><span class="pre">SetCurrentUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">password</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetCurrentUser" title="永久链接至目标"></a></dt>
+<dd><p>Validate user password and set current user.
+user: user name
+password: password of the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRights">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRights</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRights" title="永久链接至目标"></a></dt>
+<dd><p>Set access rights for the specified role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental">
+<span class="sig-name descname"><span class="pre">SetRoleAccessRightsIncremental</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg0</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">arg1</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">Dict</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleAccessRightsIncremental" title="永久链接至目标"></a></dt>
+<dd><p>Set access rights for the specified role, only affects the specified graphs</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetRoleDesc">
+<span class="sig-name descname"><span class="pre">SetRoleDesc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">desc</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetRoleDesc" title="永久链接至目标"></a></dt>
+<dd><p>Set description of the specified role.
+name: name of the role
+desc: description of the role</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUser">
+<span class="sig-name descname"><span class="pre">SetUser</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUser" title="永久链接至目标"></a></dt>
+<dd><p>Validate the given user and set current user given in the user.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserGraphAccess">
+<span class="sig-name descname"><span class="pre">SetUserGraphAccess</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">user</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">graph</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">access</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.AccessLevel" title="liblgraph_python_api.AccessLevel"><span class="pre">liblgraph_python_api.AccessLevel</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserGraphAccess" title="永久链接至目标"></a></dt>
+<dd><p>Set the access level of the specified user on the graph.
+user: name of the user
+graph: name of the graph
+access: access level of the user on that graph</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserPass">
+<span class="sig-name descname"><span class="pre">SetUserPass</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self:</span> <span class="pre">liblgraph_python_api.Galaxy</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">name:</span> <span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">old_password:</span> <span class="pre">str</span> <span class="pre">=</span> <span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">new_password:</span> <span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserPass" title="永久链接至目标"></a></dt>
+<dd><p>Modifies user password.
+name: name of the user
+old_password: current password, not needed when modifying another user
+new_password: new password for the user</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Galaxy.SetUserRoles">
+<span class="sig-name descname"><span class="pre">SetUserRoles</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Galaxy" title="liblgraph_python_api.Galaxy"><span class="pre">liblgraph_python_api.Galaxy</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">roles</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Galaxy.SetUserRoles" title="永久链接至目标"></a></dt>
+<dd><p>Set the roles for the specified user.
+name: name of the user
+roles: list of roles for this user</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">GraphDB</span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB" title="永久链接至目标"></a></dt>
+<dd><p>The graph database class.
+A GraphDB stores the data about the graph, including labels, vertices, edges and indexes.Since Garbage Collection in Python is automatic, you need to close the DB with GraphDB.Close() at the end of its lifetime.Make sure you have either committed or aborted every transaction that is using the DB before you close the DB.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddEdgeLabel">
+<span class="sig-name descname"><span class="pre">AddEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">temporal_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">''</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">[]</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddEdgeLabel" title="永久链接至目标"></a></dt>
+<dd><p>Adds an edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexIndex">
+<span class="sig-name descname"><span class="pre">AddVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">is_unique</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexIndex" title="永久链接至目标"></a></dt>
+<dd><p>Adds an index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AddVertexLabel">
+<span class="sig-name descname"><span class="pre">AddVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_specs</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">primary_field</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AddVertexLabel" title="永久链接至目标"></a></dt>
+<dd><p>Add a vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelAddFields" title="永久链接至目标"></a></dt>
+<dd><p>Add fields to an edge label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelDelFields" title="永久链接至目标"></a></dt>
+<dd><p>Delete fields from an edge label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModFields" title="永久链接至目标"></a></dt>
+<dd><p>Modify fields in an edge label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints">
+<span class="sig-name descname"><span class="pre">AlterEdgeLabelModifyConstraints</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">constraints</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">str</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterEdgeLabelModifyConstraints" title="永久链接至目标"></a></dt>
+<dd><p>Modify edge constraints</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelAddFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelAddFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">add_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em>, <em class="sig-param"><span class="n"><span class="pre">default_values</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelAddFields" title="永久链接至目标"></a></dt>
+<dd><p>Add fields to a vertex label
+label: name of the label
+add_fields: list of FieldSpec for the newly added fields
+default_values: default values of the added fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelDelFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelDelFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">del_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelDelFields" title="永久链接至目标"></a></dt>
+<dd><p>Delete fields from a vertex label
+label: name of the label
+del_fields: list of field names</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.AlterVertexLabelModFields">
+<span class="sig-name descname"><span class="pre">AlterVertexLabelModFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">mod_fields</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.AlterVertexLabelModFields" title="永久链接至目标"></a></dt>
+<dd><p>Modify fields in a vertex label
+label: name of the label
+mod_fields: list of FieldSpec for the modified fields</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Close">
+<span class="sig-name descname"><span class="pre">Close</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Close" title="永久链接至目标"></a></dt>
+<dd><p>Closes the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateReadTxn">
+<span class="sig-name descname"><span class="pre">CreateReadTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateReadTxn" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.CreateWriteTxn">
+<span class="sig-name descname"><span class="pre">CreateWriteTxn</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">optimistic</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">lgraph_api::Transaction</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.CreateWriteTxn" title="永久链接至目标"></a></dt>
+<dd><p>Create a write transaction.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteEdgeLabel">
+<span class="sig-name descname"><span class="pre">DeleteEdgeLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteEdgeLabel" title="永久链接至目标"></a></dt>
+<dd><p>Deletes an edge label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexIndex">
+<span class="sig-name descname"><span class="pre">DeleteVertexIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexIndex" title="永久链接至目标"></a></dt>
+<dd><p>Deletes the specified index.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DeleteVertexLabel">
+<span class="sig-name descname"><span class="pre">DeleteVertexLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DeleteVertexLabel" title="永久链接至目标"></a></dt>
+<dd><p>Deletes a vertex label</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllData">
+<span class="sig-name descname"><span class="pre">DropAllData</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllData" title="永久链接至目标"></a></dt>
+<dd><p>Drop all the data in this DB.
+All vertices, edges, labels and indexes will be dropped.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.DropAllVertex">
+<span class="sig-name descname"><span class="pre">DropAllVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.DropAllVertex" title="永久链接至目标"></a></dt>
+<dd><p>Drops all the vertices and edges in this DB.
+Labels and indexes (though index contents will be cleared due to deletion of vertices) will be preserved.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.EstimateNumVertices">
+<span class="sig-name descname"><span class="pre">EstimateNumVertices</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.EstimateNumVertices" title="永久链接至目标"></a></dt>
+<dd><p>Gets an estimation of the number of vertices.
+This can be inaccurate if there were vertex removals.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.Flush">
+<span class="sig-name descname"><span class="pre">Flush</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.Flush" title="永久链接至目标"></a></dt>
+<dd><p>Flushes written data into disk.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetDescription">
+<span class="sig-name descname"><span class="pre">GetDescription</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetDescription" title="永久链接至目标"></a></dt>
+<dd><p>Gets description of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.GetMaxSize">
+<span class="sig-name descname"><span class="pre">GetMaxSize</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.GetMaxSize" title="永久链接至目标"></a></dt>
+<dd><p>Gets maximum size of the graph.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.GraphDB.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.GraphDB" title="liblgraph_python_api.GraphDB"><span class="pre">liblgraph_python_api.GraphDB</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.GraphDB.IsVertexIndexed" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">InEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>InEdgeIterator can be used to iterate through all the incoming edges of the destination vertex.
+Incoming edges are sorted in (dst, label, src, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Delete" title="永久链接至目标"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetAllFields" title="永久链接至目标"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetDst" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetEdgeId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetField" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.InEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabel" title="永久链接至目标"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetSrc" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.GetUid" title="永久链接至目标"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Goto" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the in edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next in edge to current destination vertex.
+If there is no more in edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetField" title="永久链接至目标"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.SetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.InEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.InEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.InEdgeIterator" title="liblgraph_python_api.InEdgeIterator"><span class="pre">liblgraph_python_api.InEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.InEdgeIterator.ToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">IndexSpec</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec" title="永久链接至目标"></a></dt>
+<dd><p>Index specification.</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.field">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">field</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.field" title="永久链接至目标"></a></dt>
+<dd><p>Name of the field</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.label">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">label</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.label" title="永久链接至目标"></a></dt>
+<dd><p>Name of the label.</p>
+</dd></dl>
+
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.IndexSpec.unique">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">unique</span></span><a class="headerlink" href="#liblgraph_python_api.IndexSpec.unique" title="永久链接至目标"></a></dt>
+<dd><p>Whether the indexed values are unique.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">LGraphType</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType" title="永久链接至目标"></a></dt>
+<dd><p>Members:</p>
+<p>NUL : NUL</p>
+<p>INTEGER : INTEGER</p>
+<p>FLOAT : FLOAT</p>
+<p>DOUBLE : DOUBLE</p>
+<p>BOOLEAN : BOOLEAN</p>
+<p>STRING : STRING</p>
+<p>NODE : NODE</p>
+<p>RELATIONSHIP : RELATIONSHIP</p>
+<p>PATH : PATH</p>
+<p>LIST : LIST</p>
+<p>MAP : MAP</p>
+<p>ANY : ANY</p>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.LGraphType.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.LGraphType.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">OutEdgeIterator</span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>OutEdgeIterator can be used to iterate through all the out-going edges of the source vertex.
+Out-going edges are sorted in (src, lid, dst, eid) order.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Delete" title="永久链接至目标"></a></dt>
+<dd><p>Deletes current edge.
+The iterator will point to the next out edge if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetAllFields" title="永久链接至目标"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetDst">
+<span class="sig-name descname"><span class="pre">GetDst</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetDst" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the destination vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetEdgeId">
+<span class="sig-name descname"><span class="pre">GetEdgeId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetEdgeId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of current edge. Edge id is unique across the same (src, dst) set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetField" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.OutEdgeIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabel" title="永久链接至目标"></a></dt>
+<dd><p>Returns the name of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetSrc">
+<span class="sig-name descname"><span class="pre">GetSrc</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetSrc" title="永久链接至目标"></a></dt>
+<dd><p>Returns the id of the source vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.GetUid">
+<span class="sig-name descname"><span class="pre">GetUid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.GetUid" title="永久链接至目标"></a></dt>
+<dd><p>Returns the EdgeUid of the edge.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">euid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.EdgeUid" title="liblgraph_python_api.EdgeUid"><span class="pre">liblgraph_python_api.EdgeUid</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">False</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Goto" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the out edge specified by euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next out edge from current source vertex.
+If there is no more out edge left, the iterator becomes invalid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetField" title="永久链接至目标"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.SetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_values are FieldData containing the field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the field values as specified in value_dict.
+value_dict specifies the field_name:value dictionary.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.OutEdgeIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.OutEdgeIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.OutEdgeIterator" title="liblgraph_python_api.OutEdgeIterator"><span class="pre">liblgraph_python_api.OutEdgeIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.OutEdgeIterator.ToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of current edge.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">PluginErrorCode</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode" title="永久链接至目标"></a></dt>
+<dd><p>ErrorCode of plugin.</p>
+<p>Members:</p>
+<blockquote>
+<div><p>SUCCESS</p>
+<p>INPUT_ERR</p>
+<p>INTERNAL_ERR</p>
+<p>SUCCESS_WITH_SIGNATURE</p>
+</div></blockquote>
+<dl class="py property">
+<dt class="sig sig-object py" id="liblgraph_python_api.PluginErrorCode.name">
+<em class="property"><span class="pre">property</span><span class="w"> </span></em><span class="sig-name descname"><span class="pre">name</span></span><a class="headerlink" href="#liblgraph_python_api.PluginErrorCode.name" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">Transaction</span></span><a class="headerlink" href="#liblgraph_python_api.Transaction" title="永久链接至目标"></a></dt>
+<dd><p>In embedded mode, all the operations are performed in transactions and thus enjoys the power of
+transactions such as atomicity and isolation. You can commit or abort a transaction at any time
+without worrying about the side effects it has already made.
+Transactions can be either committed or aborted, after which it is destructed and becomes invalid.
+Make sure you have destructed every transaction before you closes the corresponding GraphDB.
+Transactions also track the created iterators and releases all the iterators during destruction.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Abort">
+<span class="sig-name descname"><span class="pre">Abort</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Abort" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddEdge">
+<span class="sig-name descname"><span class="pre">AddEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddEdge" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values in string format.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label name, field names, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label id, field ids, and field values.
+Returns the id of the newly added edge.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; liblgraph_python_api.EdgeUid</p></li>
+</ol>
+<p>Adds an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+Returns the id of the newly added edge.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.AddVertex">
+<span class="sig-name descname"><span class="pre">AddVertex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.AddVertex" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values in string format.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name, field names, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label ids, field ids, and field values.
+Returns the id of the newly added vertex.
+Fields that are not in field_ids are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>AddVertex(self: liblgraph_python_api.Transaction, label_name: str, value_dict: dict) -&gt; int</p></li>
+</ol>
+<p>Adds a vertex with the specified label name and set the value as specified in value_dict.
+Returns the id of the newly added vertex.
+Fields that are not specified in the dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.Commit">
+<span class="sig-name descname"><span class="pre">Commit</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.Commit" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.DumpGraph">
+<span class="sig-name descname"><span class="pre">DumpGraph</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.DumpGraph" title="永久链接至目标"></a></dt>
+<dd><p>Prints the string representation of the WHOLE graph to stdout.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeFieldId">
+<span class="sig-name descname"><span class="pre">GetEdgeFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeFieldId" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_name: str) -&gt; int</p></li>
+</ol>
+<p>Gets the edge field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetEdgeFieldId(self: liblgraph_python_api.Transaction, label_id: int, field_names: List[str]) -&gt; List[int]</p></li>
+</ol>
+<p>Gets the edge field ids associated with this (label_id, field_names).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeLabelId">
+<span class="sig-name descname"><span class="pre">GetEdgeLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the edge label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetEdgeSchema">
+<span class="sig-name descname"><span class="pre">GetEdgeSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetEdgeSchema" title="永久链接至目标"></a></dt>
+<dd><p>Gets the schema specification of the edge label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetInEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator pointing to the in-edge of vertex dst with EdgeUid==euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumEdgeLabels">
+<span class="sig-name descname"><span class="pre">GetNumEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumEdgeLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetNumVertexLabels">
+<span class="sig-name descname"><span class="pre">GetNumVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetNumVertexLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetOutEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, euid: liblgraph_python_api.EdgeUid, nearest: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator pointing to the edge identified by euid.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEdgeIterator from src to dst with label specified by label_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexByUniqueIndex">
+<span class="sig-name descname"><span class="pre">GetVertexByUniqueIndex</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexByUniqueIndex" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value_string: str) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value_string specifies the string representation of the indexed field value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, field_value: object) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_name specifies the name of the indexed label.
+field_name specifies the name of the indexed field.
+field_value specifies the indexed field value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexByUniqueIndex(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, field_value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets vertex iterator by unique index.
+Throws exception if there is no such vertex.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+field_value is a FieldData specifying the indexed field value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldId">
+<span class="sig-name descname"><span class="pre">GetVertexFieldId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the vertex field id associated with this (label_id, field_name).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexFieldIds">
+<span class="sig-name descname"><span class="pre">GetVertexFieldIds</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_id</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_names</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexFieldIds" title="永久链接至目标"></a></dt>
+<dd><p>Gets the vertex field ids associated with this (label_id, [field_names]).
+GraphDB assigns integer ids to each field of the same label. Using field id instead of field name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIndexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIndexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIndexIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>Gets an VertexIndexIterator pointing to the indexed item which has index value [key_start, key_end].
+key_start=key_end=v returns an iterator pointing to all vertexes that has field value v.
+label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_id: int, field_id: int, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_id specifies the id of the indexed label.
+field_id specifies the id of the indexed field.
+value is a FieldData containing the indexed value.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start_string: str, key_end_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start_string is the string representation of the minimum indexed value.
+key_end_string is the string representation of the maximum indexed value.</p>
+<ol class="arabic simple" start="4">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, key_start: liblgraph_python_api.FieldData, key_end: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+key_start is a FieldData containing the minimum indexed value.
+key_end is a FieldData containing the maximum indexed value.</p>
+<ol class="arabic simple" start="5">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value_string: str) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value_string is the string representation of the indexed value.</p>
+<ol class="arabic simple" start="6">
+<li><p>GetVertexIndexIterator(self: liblgraph_python_api.Transaction, label_name: str, field_name: str, value: liblgraph_python_api.FieldData) -&gt; lgraph_api::VertexIndexIterator</p></li>
+</ol>
+<p>label_name specifies the name of the indexed label.
+field_id specifies the name of the indexed field.
+value is a FieldData containing the indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexIterator">
+<span class="sig-name descname"><span class="pre">GetVertexIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the first vertex in the graph.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Returns a VertexIterator pointing to the vertex specified by vid.</p>
+<ol class="arabic simple" start="3">
+<li><p>GetVertexIterator(self: liblgraph_python_api.Transaction, vid: int, nearest: bool) -&gt; lgraph_api::VertexIterator</p></li>
+</ol>
+<p>Gets VertexIterator with vertex id.
+If nearest==true, go to the first vertex with id &gt;= vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexLabelId">
+<span class="sig-name descname"><span class="pre">GetVertexLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the vertex label id associated with this label.
+GraphDB assigns integer ids to each label. Using label id instead of label name can have performance benefits.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.GetVertexSchema">
+<span class="sig-name descname"><span class="pre">GetVertexSchema</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.FieldSpec" title="liblgraph_python_api.FieldSpec"><span class="pre">liblgraph_python_api.FieldSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.GetVertexSchema" title="永久链接至目标"></a></dt>
+<dd><p>Gets the schema specification of the vertex label.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsReadOnly">
+<span class="sig-name descname"><span class="pre">IsReadOnly</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsReadOnly" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsValid" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.IsVertexIndexed">
+<span class="sig-name descname"><span class="pre">IsVertexIndexed</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">label_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.IsVertexIndexed" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether the specified field is indexed.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListEdgeLabels">
+<span class="sig-name descname"><span class="pre">ListEdgeLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListEdgeLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexIndexes">
+<span class="sig-name descname"><span class="pre">ListVertexIndexes</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><a class="reference internal" href="#liblgraph_python_api.IndexSpec" title="liblgraph_python_api.IndexSpec"><span class="pre">liblgraph_python_api.IndexSpec</span></a><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexIndexes" title="永久链接至目标"></a></dt>
+<dd><p>Gets the list of all the vertex indexes in the DB.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.ListVertexLabels">
+<span class="sig-name descname"><span class="pre">ListVertexLabels</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">str</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.ListVertexLabels" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.UpsertEdge">
+<span class="sig-name descname"><span class="pre">UpsertEdge</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.Transaction.UpsertEdge" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_value_strings: List[str]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values in string format.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="2">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_id: int, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label id, field ids, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="3">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label name, field names, and field values.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in field_names are considered null.</p>
+<ol class="arabic simple" start="4">
+<li><p>UpsertEdge(self: liblgraph_python_api.Transaction, src: int, dst: int, label_name: str, value_dict: dict) -&gt; bool</p></li>
+</ol>
+<p>Upserts an edge from src to dst with the specified label, and fill it with the values given in value_dict.
+If an src-&gt;dst edge already exists, it is updated with the new value. Otherwise a new edge is created.
+Returns True if the edge is created, False if the edge is updated.
+Fields that are not in value_dict are considered null.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.Transaction.VertexToString">
+<span class="sig-name descname"><span class="pre">VertexToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.Transaction" title="liblgraph_python_api.Transaction"><span class="pre">liblgraph_python_api.Transaction</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.Transaction.VertexToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of the vertex specified by vid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIndexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator" title="永久链接至目标"></a></dt>
+<dd><p>VertexIndexIterator can be used to retrieve the id of indexed vertices.
+Vertex ids are sorted in ascending order of (index_value, vertex_id).</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetIndexValue">
+<span class="sig-name descname"><span class="pre">GetIndexValue</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><a class="reference internal" href="#liblgraph_python_api.FieldData" title="liblgraph_python_api.FieldData"><span class="pre">liblgraph_python_api.FieldData</span></a></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetIndexValue" title="永久链接至目标"></a></dt>
+<dd><p>Gets the indexed value.
+Since vertex ids are sorted in (index_value, vertex_id) order, calling Next() may change the current indexed value.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.GetVid">
+<span class="sig-name descname"><span class="pre">GetVid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.GetVid" title="永久链接至目标"></a></dt>
+<dd><p>Gets the id of the vertex currently pointed to.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd><p>Tells whether this iterator is valid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIndexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIndexIterator" title="liblgraph_python_api.VertexIndexIterator"><span class="pre">liblgraph_python_api.VertexIndexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIndexIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next indexed vid.
+If there is no more vertex within the specified key range, the iterator becomes invalid.</p>
+</dd></dl>
+
+</dd></dl>
+
+<dl class="py class">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator">
+<em class="property"><span class="pre">class</span><span class="w"> </span></em><span class="sig-prename descclassname"><span class="pre">liblgraph_python_api.</span></span><span class="sig-name descname"><span class="pre">VertexIterator</span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator" title="永久链接至目标"></a></dt>
+<dd><p>VertexIterator can be used to retrieve info of a vertex, or to scan through multiple vertices.
+Vertexes are sorted in ascending order of the their ids.</p>
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Delete">
+<span class="sig-name descname"><span class="pre">Delete</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">int</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Delete" title="永久链接至目标"></a></dt>
+<dd><p>Deletes current vertex.
+The iterator will point to the next vertex if there is any.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetAllFields">
+<span class="sig-name descname"><span class="pre">GetAllFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">dict</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetAllFields" title="永久链接至目标"></a></dt>
+<dd><p>Gets all the field values and return as a dict.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetField">
+<span class="sig-name descname"><span class="pre">GetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetField" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_name: str) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_name.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetField(self: liblgraph_python_api.VertexIterator, field_id: int) -&gt; object</p></li>
+</ol>
+<p>Gets the field value of the field specified by field_id.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetFields">
+<span class="sig-name descname"><span class="pre">GetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_names.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int]) -&gt; list</p></li>
+</ol>
+<p>Gets the field values of the fields specified by field_ids.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetId">
+<span class="sig-name descname"><span class="pre">GetId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the integer id of this vertex.
+GraphDB assigns an integer id for each vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetInEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetInEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetInEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the first in-coming edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetInEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::InEdgeIterator</p></li>
+</ol>
+<p>Gets an InEgdeIterator pointing to the in-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabel">
+<span class="sig-name descname"><span class="pre">GetLabel</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabel" title="永久链接至目标"></a></dt>
+<dd><p>Gets the label name of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetLabelId">
+<span class="sig-name descname"><span class="pre">GetLabelId</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">int</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetLabelId" title="永久链接至目标"></a></dt>
+<dd><p>Gets the label id of current vertex.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumInEdges">
+<span class="sig-name descname"><span class="pre">GetNumInEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumInEdges" title="永久链接至目标"></a></dt>
+<dd><p>Gets the number of in-coming edges of this vertex.
+n_limit specifies the maximum number of edges to scan.
+Returns a tuple containing the number of in-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetNumOutEdges">
+<span class="sig-name descname"><span class="pre">GetNumOutEdges</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetNumOutEdges" title="永久链接至目标"></a></dt>
+<dd><p>Gets the number of out edges of this vertex.
+n_limit specifies the maximum number of vids to scan.Returns a tuple containing the number of out-edges and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.GetOutEdgeIterator">
+<span class="sig-name descname"><span class="pre">GetOutEdgeIterator</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.GetOutEdgeIterator" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the first out-going edge of this edge.</p>
+<ol class="arabic simple" start="2">
+<li><p>GetOutEdgeIterator(self: liblgraph_python_api.VertexIterator, arg0: liblgraph_python_api.EdgeUid, arg1: bool) -&gt; lgraph_api::OutEdgeIterator</p></li>
+</ol>
+<p>Gets an OutEgdeIterator pointing to the out-edge of this vertex with EdgeUid==euid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Goto">
+<span class="sig-name descname"><span class="pre">Goto</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">vid</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">nearest</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">bool</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Goto" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the vertex specified by vid.
+If nearest==true, go to the nearest vertex with id&gt;=vid.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.IsValid">
+<span class="sig-name descname"><span class="pre">IsValid</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.IsValid" title="永久链接至目标"></a></dt>
+<dd></dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListDstVids">
+<span class="sig-name descname"><span class="pre">ListDstVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListDstVids" title="永久链接至目标"></a></dt>
+<dd><p>Lists all destination vids of the out edges.
+n_limit specifies the maximum number of vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ListSrcVids">
+<span class="sig-name descname"><span class="pre">ListSrcVids</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">n_limit</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">int</span></span><span class="w"> </span><span class="o"><span class="pre">=</span></span><span class="w"> </span><span class="default_value"><span class="pre">18446744073709551615</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">Tuple</span><span class="p"><span class="pre">[</span></span><span class="pre">List</span><span class="p"><span class="pre">[</span></span><span class="pre">int</span><span class="p"><span class="pre">]</span></span><span class="p"><span class="pre">,</span></span><span class="w"> </span><span class="pre">bool</span><span class="p"><span class="pre">]</span></span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ListSrcVids" title="永久链接至目标"></a></dt>
+<dd><p>Lists all source vids of the in edges.
+n_limit specifies the maximum number of src vids to return.
+Returns a tuple containing a list of vids and a bool value indicating whether the limit is exceeded.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.Next">
+<span class="sig-name descname"><span class="pre">Next</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">bool</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.Next" title="永久链接至目标"></a></dt>
+<dd><p>Goes to the next vertex with id&gt;{current_vid}.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetField">
+<span class="sig-name descname"><span class="pre">SetField</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_name</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">str</span></span></em>, <em class="sig-param"><span class="n"><span class="pre">field_value_object</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><span class="pre">object</span></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">None</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetField" title="永久链接至目标"></a></dt>
+<dd><p>Sets the specified field</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.SetFields">
+<span class="sig-name descname"><span class="pre">SetFields</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="o"><span class="pre">*</span></span><span class="n"><span class="pre">args</span></span></em>, <em class="sig-param"><span class="o"><span class="pre">**</span></span><span class="n"><span class="pre">kwargs</span></span></em><span class="sig-paren">)</span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.SetFields" title="永久链接至目标"></a></dt>
+<dd><p>Overloaded function.</p>
+<ol class="arabic simple">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_value_strings: List[str]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with field values in string representation.
+field_names specifies the names of the fields to set.
+field_value_strings are the field values in string representation.</p>
+<ol class="arabic simple" start="2">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_names: List[str], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_names with new values.
+field_names specifies the names of the fields to set.
+field_values are the FieldData containing field values.</p>
+<ol class="arabic simple" start="3">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, value_dict: dict) -&gt; None</p></li>
+</ol>
+<p>Sets the fields with values as specified in value_dict.
+value_dict specifies the field_name:value dict.</p>
+<ol class="arabic simple" start="4">
+<li><p>SetFields(self: liblgraph_python_api.VertexIterator, field_ids: List[int], field_values: List[liblgraph_python_api.FieldData]) -&gt; None</p></li>
+</ol>
+<p>Sets the fields specified by field_ids with field values.
+field_ids specifies the ids of the fields to set.
+field_values are the field values to be set.</p>
+</dd></dl>
+
+<dl class="py method">
+<dt class="sig sig-object py" id="liblgraph_python_api.VertexIterator.ToString">
+<span class="sig-name descname"><span class="pre">ToString</span></span><span class="sig-paren">(</span><em class="sig-param"><span class="n"><span class="pre">self</span></span><span class="p"><span class="pre">:</span></span><span class="w"> </span><span class="n"><a class="reference internal" href="#liblgraph_python_api.VertexIterator" title="liblgraph_python_api.VertexIterator"><span class="pre">liblgraph_python_api.VertexIterator</span></a></span></em><span class="sig-paren">)</span> <span class="sig-return"><span class="sig-return-icon">→</span> <span class="sig-return-typehint"><span class="pre">str</span></span></span><a class="headerlink" href="#liblgraph_python_api.VertexIterator.ToString" title="永久链接至目标"></a></dt>
+<dd><p>Returns the string representation of current vertex, including properties and edges.</p>
+</dd></dl>
+
+</dd></dl>
+
+</section>
+</section>
+
+
+           
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..ffd8771f0c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,25 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python存储过程接口
+====================================
+Version: 4.3.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+介绍
+------------------
+与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。
+
+这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。
+
+接口
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..1db9127da9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,19 @@
+# Rust 存储过程
+
+## 1. 介绍
+Rust 存储过程目前仅支持v1版本，TuGraph能够支持一切编译成动态库的语言作为插件。Rust语言作为系统编程语言的新起之秀，在安全性上、可靠性以及人体工程学上相较于C++具有较大优势。
+
+我们提供了TuGraph的[Rust binding]库来支持在Rust中调用lgrahp api，同时提供[tugraph-plugin-util] 工具库来帮助大家更加简洁地编写Rust插件代码。
+
+[Rust binding]: https://crates.io/crates/tugraph
+[tugraph-plugin-util]: https://crates.io/crates/tugraph-plugin-util
+
+## 2. 如何使用
+
+Rust存储过程的使用分三步：
+* 编译，从rust源码编译出so库。我们准备了一份一站式的插件编写教程，从IDE的插件安装，环境配置，到编译，详细参考`rust-tugraph-plugin-tutorial`。
+* 加载，将so库加载到服务端，可以通过REST或RPC接口，这一步和C++库的使用方式类似，可以参考[文档](1.procedure.md)。
+* 运行，和c++ procdure使用方式相同，不在赘述。
+
+## 3.API文档
+Rust社区习惯，所有的代码和文档都可以从[`crates.io`](https://crates.io/crates/tugraph )以及[`docs.rs`](https://docs.rs/tugraph/latest/tugraph )找到。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..dbca101674
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.3.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = Chinese
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..27a86697ca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..81b77be986
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..fccb77789a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,207 @@
+# OLAP API
+
+> 本文档是为TuGraph的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对TuGraph的图计算运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于Tugraph的一个简单的[BFS(宽度优先搜索)](https://en.wikipedia.org/wiki/Breadth-first_search "wikipedia")程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图分析引擎介绍
+
+TuGraph的图分析引擎，面向的场景主要是全图/全量数据分析类的任务。借助TuGraph的 C++ / Python 图分析引擎 API ，用户可以对不同数据来源的图数据快速导出一个待处理的复杂子图，然后在该子图上运行诸如PageRank、LPA、WCC等迭代式图算法，最后根据运行结果做出相应的对策。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph图计算系统社区版内置6个算法，商业版内置了25种算法，用户几乎不需要自己实现具体的图计算过程。其详细介绍可参考algorithms.md。
+
+根据数据来源及实现不同，可分为Procedure、Embed和Standalone三种运行方式，均继承于OlapBase API，OlapBase API接口文档可参考olapbase-api.md。
+
+其中Procedure和Embed的数据来源是图数据库中预加载的db数据，可以分别编译生成tugraph-web加载使用的.so文件和后台终端使用的embed文件，输入的图数据均通过db的加载形式，其接口文档可参考olapondb-api.md。
+Standalone用于编译生成standalone文件，区别于前者，该文件的输入图数据通过txt、二进制、ODPS文件的形式加载，其接口文档可参考olapondisk-api.md。
+
+## 2. Procedure 编译与运行
+
+该种方式主要用于tugraph-web界面进行可视化加载及运行。使用方法如下：
+
+### C++:
+在tugraph-db/procedures 目录下执行`bash make_so_cpp.sh bfs`即可在tugraph-db/procedures目录下得到bfs.so文件，将该文件以插件形式上传至tugraph-web，输入参数后即可执行。
+
+### Python:
+在tugraph-web的前端将python文件以插件形式上传，输入参数后即可执行。
+
+示例：
+在tugraph-db/procedures 编译.so算法文件
+`bash make_so_cpp.sh bfs`
+
+将bfs.so（或tugraph-db/procedures/algo_cython/bfs.py）文件以插件形式加载至tugraph-web后，输入如下json参数：
+
+```json
+{
+    "root":"10",
+    "label":"user",
+    "field":"id"
+}
+```
+即可得到返回结果如下。
+
+```json
+{
+  "core_cost": 0.013641119003295898,
+  "found_vertices": 3829,
+  "num_edges": 88234,
+  "num_vertices": 4039,
+  "output_cost": 8.821487426757813e-06,
+  "prepare_cost": 0.03479194641113281,
+  "total_cost": 0.04844188690185547
+}
+```
+
+输出内容解释如下：
+- core_cost: 表示算法运行所需要的时间。
+- found_vertices: 表示查找到点的个数。
+- num_edges: 表示该图数据的边数量。
+- num_vertices: 表示该图数据点的数量。
+- output_cost: 表示算法结果写回db所需要的时间。
+- prepare_cost: 表示预处理阶段所需要的时间。预处理阶段的工作：加载参数、图数据加载、索引初始化等。
+- total_cost: 表示执行该算法整体运行时间。
+
+make_so.sh文件介绍：该文件用于将TuGraph-OLAP所涉及到的图算法文件编译成一个可供tugraph-web使用的.so文件。
+
+## 3. Embed 编译与运行
+
+该种方式主要用于TuGraph在后台程序中对预加载的db图数据进行算法分析。其使用方法如下：
+在tugraph-db/procedures 目录下对embed_main.cpp文件完善，补充数据名称、输入参数、数据路径等信息，示例如下：
+
+### C++:
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path表示预加载图数据存放的路径
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // 指定图数据的名称
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // 以json形式输入算法参数
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+保存后在tugraph-db/procedures 目录下执行`bash make_embed.sh bfs`即可在tugraph-db/procedures/algo_cpp 目录下得到bfs_procedure文件。
+
+在tugraph-db/procedures 文件夹下执行`./algo_cpp/bfs_procedure` 即可得到返回结果：
+
+```json
+{
+  "core_cost":0.025603055953979492,
+  "found_vertices":3829,
+  "num_edges":88234,
+  "num_vertices":4039,
+  "output_cost":9.059906005859375e-06,
+  "prepare_cost":0.056738853454589844,
+  "total_cost":0.0823509693145752
+}
+```
+
+参数解释同上。
+
+### Python：
+在tugraph-db/procedures文件夹下执行
+`bash make_so_cython.sh bfs`
+或在tugraph-db/procedures/algo_cython文件夹下执行
+`python3 setup.py build_ext -i`
+得到bfs.so后，在Python中import bfs可使用，如tugraph-db/procedures/run_embed.py所示
+
+```python
+# tugraph-db/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+```
+通过如下命令执行
+
+```bash
+python3 run_embed.py
+```
+
+输出结果与C++相同。
+
+## 4. Standalone 编译与运行
+
+该文件主要用于在终端处直接加载图数据，并运行打印输出结果。使用方法如下：
+在tugraph-db/build目录下执行`make bfs_standalone` (需要在g++默认include路径中包含boost/sort/sort.hpp)即可得到bfs_standalone文件,该文件生成于tugraph-db/build/output/algo文件夹下。
+运行方式：在tugraph-db/build目录下执行`./output/algo/bfs_standalone -–type [type] –-input_dir [input_dir] --id_mapping [id_mapping] -–vertices [vertices] --root [root] –-output_dir [output_dir]`即可运行。
+
+- `[type]`：表示输入图文件的类型来源，包含text文本文件、BINARY_FILE二进制文件和ODPS源。
+- `[input_dir]`：表示输入图文件的文件夹路径，文件夹下可包含一个或多个输入文件。TuGraph在读取输入文件时会读取[input_dir]下的所有文件，要求[input_dir]下只能包含输入文件，不能包含其它文件。参数不可省略。
+- `[id_mapping]`：当读入边表时，是否对输入数据做id映射，使达到符合算法运行的形式。1为需要做id映射，0为不需要做。该过程会消耗一定时间。参数可省略，默认值为0。
+- `[vertices]`：表示图的点个数，为0时表示用户希望系统自动识别点数量；为非零值时表示用户希望自定义点个数，要求用户自定义点个数需大于最大的点ID。参数可省略，默认值为0。
+- `[root]`：表示进行bfs的起始点id。参数不可省略。
+- `[output_dir]`：表示输出数据保存的文件夹路径，将输出内容保存至该文件中，参数不可省略。
+
+示例：
+
+### C++:
+在tugraph-db/build编译standalone算法程序
+
+```bash
+make bfs_standalone
+```
+
+在tugraph-db/build/output目录下运行text源文件
+
+```bash
+./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+得到运行结果：
+
+```text
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+结果参数解释同上。
+
+对于新的算法，运行时不了解该算法的所需参数时，可通过`./output/algo/bfs_standalone -h`进行查阅对应参数。
+
+### Python:
+Python语言的bfs拓展编译过程与embed模式无区别，在运行时通过`Standalone`接口调用，示例如下：
+```python
+# tugraph-db/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(input_dir=
+                             "../test/integration/data/algo/fb_unweighted",
+                             root=0)
+```
+
+通过如下命令执行
+
+```bash
+python3 run_standalone.py
+```
+
+至此，通过TuGraph对上图进行bfs运算的过程已经完成。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..6991d63290
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,179 @@
+# OlapBase API
+
+> 此文档主要详细介绍了OlapBase API的使用说明
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统需要的简单配置，同时结合代码对TuGraph中几个共同的重要文件和接口进行解释。
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+
+## 3. 原子操作
+
+TuGraph使用了多线程技术进行批处理操作，在这种情况下可能会出现访存冲突现象。为了保证并行计算时修改操作的正确性，TuGraph实现了原子操作。代码部分见lgraph文件夹下的lgraph_atomic.cpp文件。
+TuGraph还自定义了4个常用的原子操作。当我们需要在多线程模式下修改点的数据时，我们都应该使用原子操作来确保并行环境下修改操作的正确性。除了这4个原子操作外，用户也可以使用“cas”来构建自己的原子操作函数。
+
+- `bool cas(T * ptr, T oldv, T newv)`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `bool write_min(T *a, T b)`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `bool write_max(T *a, T b)`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `void write_add(T *a, T b)`：将b的值加到a指向的值上。
+- `void write_sub(T *a, T b)`：将a指向的值减去b的值。
+
+## 4. 点集合类ParallelBitset
+
+在使用TuGraph进行批处理操作时，需要使用点集合来表示需要处理的点。ParallelBitset实现了点集合类，以bit为单位表示点，因此能够节省大量内存。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 4.1 ParallelBitset类成员
+
+- `size_t Size()`：表示Bitmap中的点个数。
+- `ParallelBitset(size_t size)`：初始化size和data，data长度为(size >> 6)+1
+- `void Clear()`：清空集合
+- `void Fill()`：将所有点加入集合
+- `bool Has(size_t i)`：检查点i是否在集合中
+- `bool Add(size_t i)`：将点i加入集合中
+- `void Swap(ParallelBitset &other)`：和另一组ParallelBitset集合交换元素
+
+## 5. 点数组类ParallelVector
+
+在使用TuGraph进行批处理操作时，需要使用点数组来表示对点的处理结果。ParallelVector实现了点数组类。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 5.1 ParallelVector类成员
+
+- `ParallelVector(size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `T &operator[](size_t i)`：下标为i的数据
+- `T *begin()`：ParallelVector的起始指针
+- `T *end()`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `T &Back()`：ParallelVector最后一个数据
+- `T *Data()`：表示数组本身数据
+- `void Destroy()`：清空ParallelVector数组内数据并删除数组
+- `size_t Size()`：表示ParallelVector中的数据个数
+- `size_t Capacity()`：表示ParallelVector的容量大小
+- `void Resize(size_t size)`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `void Clear()`：清空ParallelVector内数据
+- `void ReAlloc(size_t capacity)`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `void Fill(T elem)`：为ParallelVector的全部数据赋值为elem
+- `void Append(const T &elem, bool atomic = true)`：向ParallelVector结尾添加一个数据
+- `void Swap(ParallelVector<T> &other)`：和其他的ParallelVector交换数据
+- `ParallelVector<T> Copy()`：复制当前的ParallelVector数据存至Copy数组中
+
+## 6. 自定义数据结构
+
+### 6.1 基本数据类型
+
+我们自定义了点和边的数据结构表示，用于在覆盖所有点的同时节省内存空间：
+
+- `Empty`：内容为空的特殊数据类型。
+
+### 6.2 组合数据结构
+
+为了便于计算，我们根据计算场景不同，定义了几种点和边数据的数据结构，分别是：
+
+- `EdgeUnit<EdgeData>`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+  - `size_t src`：边的起始点
+  - `size_t dst`：边的终点
+  - `EdgeData edge_data`：边的权值
+- `AdjUnit<EdgeData>`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+  - `size_t neighbour`：边的邻居点
+  - `EdgeData edge_data`：边的权值
+- `AdjList<EdgeData>`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+  - `AdjUnit<T> * begin`：列表的起始指针
+  - `AdjUnit<T> * end`：列表的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对邻接表进行循环访问。
+
+## 7. 图类OlapBase
+
+图类OlapBase是TuGraph用于加载图以及进行图计算操作的主类，常用OlapBase<EdgeData>表示权值类型为EdgeData的图，代码部分见lgraph文件夹下的olap_base.hpp。本章将介绍Graph类中常用的类型和API接口。上文介绍Procedure、Embed及Standalone功能所使用的类均为该类的子类。
+
+### 7.1 基本信息
+
+- `size_t NumVertices()`：获取点数
+- `size_t NumEdges()`：获取边数
+- `size_t OutDegree(size_t vid)`：点vid的出度
+- `size_t InDegree(size_t vid)`：点vid的入度
+
+### 7.2 点集和边集及其相关操作
+
+- `ParallelVector<VertexData> AllocVertexArray<VertexData>()`：分配一个类型为VertexData的数组，大小为点个数
+- `void fill_vertex_array<V>(V * array, V value)`：将数组array中的所有元素赋值为value
+- `ParallelBitset AllocVertexSubset()`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `AdjList<EdgeData> OutEdges(size_t vid)`：获取点v的所有出边集合
+- `AdjList<EdgeData> InEdges(size_t vid)`：获取点v的所有入边集合
+- `void Transpose()`：对有向图进行图反转
+- `LoadFromArray(char * edge_array, VertexId input_vertices, EdgeId input_edges,  EdgeDirectionPolicy edge_direction_policy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+  - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+  - `input_vertices`：指定数组读入图的点个数。
+  - `input_edges`：指定数组读入图的边的条数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+### 7.3 锁机制
+
+TuGraph实现了一对锁机制，来控制程序对于点数据的访存权限。分别是：
+
+- `void AcquireVertexLock(size_t vid)`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(size_t vid)`：对点vid解锁，所有线程均可访存该锁对应的点数据
+- `VertexLockGuard GuardVertexLock(size_t vid)`：在对vid操作时，对点vid加锁，退出作用域时时自动释放锁
+
+### 7.4 批处理操作
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程。分别是：
+
+```c++
+/*
+    函数名称:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+    第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考include/lgraph/olap_base.h中具体代码
+
+    使用示例:统计数组parent数组中有出边的点个数
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+其中graph为图类OlapBase的实例化对象
+
+```C++
+/*
+    函数名称:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+    第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考/include/lgraph/olap_base.h中具体代码
+    
+    使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..1e94fb946e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,296 @@
+# OlapOnDB API
+
+> 此文档主要详细介绍了OlapOnDB API的使用说明
+
+
+## 1. 简介
+
+一般用户需要自己实现的只是将需要分析的子图抽取出来的过程。用户也可以通过使用TuGraph中丰富的辅助接口实现自己的图分析算法。
+
+该文档主要介绍Procedure及Embed的接口设计，并介绍部分常用接口，具体的接口信息参见include/lgraph/olap_on_db.h文件。
+
+## 2. 模型
+
+Procedure及Embed使用到的辅助函数主要包含在OlapOnDB类，还有一些使用频率较高的函数都会逐一介绍
+
+在TuGraph中OLAP相关的有以下常用的数据结构：
+
+1. DB图分析类 `OlapOnDB<EdgeData>`
+2. 点数组`ParallelVector<VertexData>`
+3. 点集合`ParallelBitset`
+4. 边数据结构`AdjUnit/AdjUnit<Empty>`
+5. 边集合数据结构`AdjList<EdgeData>`
+
+### 2.1 基于快照的存储结构
+
+TuGraph中的OlapOnDB类能够提供数据“快照”，即建立一个对指定数据集的完全可用拷贝，该拷贝包括相应数据在某个时间点（拷贝开始的时间点）的镜像。由于OLAP的操作仅涉及读操作而不涉及写操作，OlapOnDB会以一种更紧凑的方式对数据进行排布，在节省空间的同时，提高数据访问的局部性。
+
+### 2.2 BSP计算模型
+
+TuGraph在计算的过程中使用了BSP（Bulk Synchronous Parallel）模型，使得该过程能够并行执行，极大的提高了程序运行效率。
+
+BSP计算模型的核心思路为超步（Super Step）的提出和使用。在OlapOnDB创建后，在该数据上的计算分为多个超步，比如PageRank，分为多轮迭代，每轮迭代就是一个超步。不同超步之间用存在显式同步，从而保证所有线程在完成同一超步后同时进入下一个超步。在一个超步内部，所有的线程异步执行，利用并行提升计算效率。
+
+利用BSP计算模型能够有效避免死锁，通过障碍同步的方式能够以硬件方式实现粗粒度的全局同步，使得图计算能够并行化执行，而程序员无需在同步互斥上大费周章。
+
+## 3. 算法举例
+
+在这里对PageRank算法分块做解释，大体上分为主函数`Process`和PageRank算法流程`PageRank`函数
+
+### 3.1 主函数
+
+主函数输入有三个参数，`TuGraph`数据库参数`db`，从网页端获取的请求`request`，给网页端的返回值`response`，整体流程可以分为一下几步：
+
+1. 相关参数的获取
+2. 快照类的创建
+3. PageRank算法主流程
+4. 网页端返回值的获取和发送
+
+```C++
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+    
+    // 从网页端请求中获取迭代次数（num_iterations），
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // 读事务的创建以及快照类的创建
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+	
+    // 创建pr数组用于存储每个节点的pr值
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank算法主流程，获取每个节点的pagerank值
+    PageRankCore(olapondb, num_iterations, pr);
+    
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        函数用途：从所有节点中获取pagerank值最大的节点编号
+    
+        函数流程描述：该函数对点集合all_vertices中所有为1的位对应的节点vi（又称为活跃点）执行Func A，再将Func A的返回值作为Func B的第二个输入参数，得到局部最大值（因为第一个输入参数为0，因此实际上返回值就是每个节点的pagerank值），最后再将所有线程的返回值汇总，再次 执行Func B得到全局返回值，并存入max_pr_vi变量中
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+        
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+        
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+    
+    // 网页端返回值的获取和发送
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2 PageRank算法流程
+
+`pagerank`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关数据结构的初始化
+1. 每个节点pagerank值的初始化
+1. 每个节点pagerank值的计算，活跃点为所有点（意味着所有点都需要计算pagerank值）
+1. 得到每个节点经过`num_iterations`次迭代后的pagerank值
+
+```C++
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+    
+    // 相关数据结构的初始化
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // 每个节点pagerank值的初始化，和该节点的出度成反比
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // 总迭代过程
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            函数用途：计算所有节点的pagerank值
+
+            函数流程描述：该函数用于计算所有节点的pagerank值，对all_vertices中所有为1的位对应的节点vi执行Func C，得到本轮迭代中vi的pagerank值，并返回vi节点的pagerank变化值，最终经过函数内部处理汇总所有活跃节点的总变化值并返回，该值被存储在delta变量中
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // 从邻居中获取当前节点的pagerank值
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank值计算核心公式
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+    
+                    // 相关中间变量统计
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // 将本轮迭代得到的pagerank值输出作为下一轮迭代的输入
+        curr.Swap(next);
+    }
+}
+```
+
+## 4. 其他常用函数功能描述
+
+### 4.1 事务的创建
+
+```C++
+//读事务的创建
+auto txn = db.CreateReadTxn();
+
+//写事务的创建
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2 并行化创建有向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3 并行化创建无向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED
+)
+```
+
+### 4.4 获取出度
+
+```C++
+size_t OutDegree(size_t vid)
+```
+
+### 4.5 获取入度
+
+```C++
+size_t InDegree(size_t vid)
+```
+
+### 4.6 获取出边集合
+
+```C++
+/*
+    函数名称：AdjList<EdgeData> OutEdges(size_t vid)
+    数据结构:
+        AdjList 可以理解为类型为AdjUnit结构体的数组
+        AdjUnit 有两个成员变量： 1. size_t neighbour 2. edge_data，其中neighbour表示该出边指向的目标节点编号，如果为有权图，则edge_data数据类型和输入文件中边的权重值相同，否则数据类型为Empty
+
+    使用示例：输出节点vid的所有出度邻居
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7 获取入边集合
+
+```C++
+AdjList<EdgeData> InEdges(size_t vid)
+
+// 使用示例：输出节点vid的所有入度邻居
+for (auto & edge : olapondb.InEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8 获取TuGraph中节点对应OlapOnDB的节点编号
+
+```C++
+size_t OriginalVid(size_t vid)
+
+// 备注： TuGraph中输入的节点编号可以是非数字，比如人名等，在生成OlapOnDB子图的时候，会将人名等转化为数字进行后续处理，因此该方法可能不适用于某些特定场景
+```
+
+### 4.9 获取OlapOnDB中节点对应TuGraph的节点编号
+
+```C++
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10 活跃点的描述
+
+活跃点指的是在批处理函数中需要处理的点，在本例子中只是输出了活跃点的编号，并且汇总活跃点的数量：
+
+```C++
+ParallelBitset temp = 000111;	//当前活跃点为3，4，5号点
+
+size_t delta = ForEachActiveVertex<double>(
+    //void c
+    [&](size_t vi) {
+        printf("active_vertexId = %lu\n",vi);
+        return 1;
+    },
+    all_vertices
+);
+```
+
+函数的运行结果显而易见，因为多线程的关系，一下输出顺序可能有所变化：
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+局部返回值均为1，该函数会在保证线程安全的情况下将所有的局部返回值累加得到最终的返回值，并存储在`delta`变量中，该值最终为3
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..1ece4cc8e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,202 @@
+# OlapOnDisk API
+
+> 此文档主要详细介绍了OlapOnDisk API的使用说明
+
+    
+## 1. 简介
+
+TuGraph的Standalone模式可用于加载图数据文件，其中图数据文件来源可包含text文本文件、BINARY_FILE二进制文件和ODPS源。在该模式下，TuGraph可实现多数据来源快速加载成图，然后在该图上运行如BFS、WCC、SSSP等迭代式算法，并输出最终结果至终端。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph内置了大量的常见图分析算法和丰富的辅助接口，因此用户几乎不需要自己实现具体的图计算过程，只需要在实现自己的存储过程的时候将相应算法库的头文件(.h)包含到自己的程序中，并在编译阶段链接自己的动态库文件即可。
+
+该文档主要介绍了Standalone的常用接口，使用到的辅助函数主要包含在OlapOnDB类。同时为帮助用户理解方便，对BFS算法进行举例说明。
+
+## 2. 算法举例
+
+在这里对BFS算法分块做解释，大体上分为主函数`main`、BFS算法流程`BFSCore`函数和配置类MyConfig。
+
+### 2.1 头文件
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //使用 TuGraph 时需要包含的头文件
+#include "./algo.h"   //包含各种算法逻辑函数的头文件
+```
+
+在使用 TuGraph 实现图数据文件计算应用时，一般首先建立StandaloneGraph类对象graph，将图文件数据加载进graph中，之后通过调用图逻辑函数实现图计算过程，最后对图计算的结果进行打印输出。
+
+### 2.2 配置类MyConfig
+
+MyConfig配置类函数用于提供算法逻辑计算时所需的配置信息，继承于ConfigBase<EdgeData>,其中EdgeDate可根据加载图类型不同选择Empty（无权图）、int（带权图权重为整数）或者double（带权图权重为double）类型。
+
+MyConfig配置类一般根据算法不同，需要额外配置信息如下：
+
+1.算法所需参数
+2.算法名称
+3.配置类内Print函数
+其余公用成员继承与ConfigBase，可参考src/olap/olap_config.h查阅。
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // 算法所需参数初始化
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // 配置文件接受命令行参数，该用例会顺次读取命令行调用算法时的参数，优先使用用户指定数值，若用户并未指定则选择默认参数。
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+### 2.3 主函数
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // 统计内存消耗类MemUsage实例化
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // 配置类MyConfig实例化
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk类实例化
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // 统计图加载消耗时间
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // 创建数组用于统计某节点是否遍历过
+    auto parent = graph.AllocVertexArray<size_t>();
+    // 宽度优先搜索算法，返回图内root_vid根结点连接的节点个数
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // 打印相关信息至终端
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+### 2.4 bfs算法流程
+
+`bfs`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关定义、数据结构的初始化
+2. 使用批处理函数对每个节点进行循环计算，每一轮找到与当前节点相邻的全部节点，并在该轮次终止时进行交换。
+3. 直到找到全部节点，返回节点个数discovered_vertices。
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //分配数组，active_in用于存放上一循环阶段已找到的节点
+  active_in.Add(root);            //把跟节点加入数组中
+  auto active_out = graph.AllocVertexSubset();  //分配数组active_out用于存放当前循环阶段找到的节点
+  parent.Fill((size_t)-1);               //将parent数组中的节点赋值为-1，-1表示未被找到
+  parent[root] = root;
+  size_t num_activations = 1;       //表示当前循环阶段找到的节点个数
+  size_t discovered_vertices = 0;    //表示当前循环阶段找到节点的总个数
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations表示当前循环阶段找到的节点个数
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices表示当前循环阶段找到节点的总个数
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //每一次循环从根节点出发，查找邻近的相邻节点，对其parent值改变，并num_activations+1操作
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //存放当前循环阶段找到的节点
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // 返回全部节点数
+  return discovered_vertices;
+}
+```
+
+## 3. 其他常用函数功能描述
+
+### 3.1 图加载
+
+TuGraph-Standalone对于图数据文件的加载来源主要分为三大类：文本文件、二进制文件和ODPS。二进制文件为将边数据的二进制表示按顺序排列的文件，能够节省大量存储空间。其加载函数分为三种，分别是：
+
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：图数据文件的加载方式，包含两个参数，其含义分别表示：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。其中DUAL_DIRECTION为默认的图加载方式。
+  DUAL_DIRECTION : 输入文件为非对称图，加载图为非对称图。
+  MAKE_SYMMETRIC : 输入文件为非对称图，加载图为对称图。
+  INPUT_SYMMETRIC : 输入文件为对称图，加载图为对称图。
+  对应的详细介绍见lgraph文件夹下的olap_config.h文件的`enum EdgeDirectionPolicy`。
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：将文件中的点-数据对按照点id的顺序加载到数组中。各参数表示意义分别为：
+  - `array`：待读入数据的数组
+  - `path`：读取文件的路径，文件中每行表示一对点-数据对
+  - `parse_line`：用户自定义函数，告诉系统如何将一行文本数据解析为一个点-数据对。
+
+
+### 3.2 图写入
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：把array中数据写回文件中，各参数表示意义分别是：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `array`：待写入数据的数组
+  - `array_size`：待写入数据的数字长度
+  - `name`：算法名称
+  - `filter_output`：写入数据规则函数，待写入数据需要满足该函数的要求。
+
+### 3.3 图解析函数
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：对图数据文件进行解析，加载图为无权图。
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：对图数据文件进行解析，加载图为有权图，权重数据类型可以通过修改<EdgeData>指定。
+
+该函数可通过MyConfig类定义时的构造函数parse_line进行指定。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..0498446303
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,404 @@
+# Python Olap API
+
+> 本文档主要介绍 OlapBase OlapOnDB 和 OlapOnDisk 在Python中的API用法
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统Python接口需要的简单配置，同时结合代码对TuGraph Python API进行解释。关于ParallelBitset、OlapBase各类的作用，详见olap-base-api.md，olap-on-db-api.md和olap-on-disk-api.md
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+- Cython，版本要求3.0.0以上，已测试可运行版本为3.0.0a11
+
+## 3. Cython
+Cython是一种高效的编程语言，是Python的超集。Cython能将py文件翻译为C/C++代码后编译为Python拓展类，在Python中通过import调用。在TuGraph中，所有的Python plugin都由Cython编译为Python拓展类后使用。
+
+Cython的Pure Python模式在保证Python语法的同时具有C/C++的性能，TuGraph Python接口均使用Cython实现。
+
+[Cython 文档](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+见procedures/algo_cython/olap_base.pxd文件，用法与功能基本与C++接口相同，olap_base.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### 原子操作
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `write_min[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_max[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_add[T](a: cython.pointer(T), b: T)-> cython.bint`：将b的值加到a指向的值上。
+- `write_sub[T](a: cython.pointer(T), b: T)-> cython.bint`：将a指向的值减去b的值。
+
+### 点集合类ParallelBitset
+- `Size()-> size_t`：表示Bitmap中的点个数。
+- `ParallelBitset(size: size_t)`：初始化size和data，data长度为(size >> 6)+1
+- `Clear()-> cython.void`：清空集合
+- `Fill()-> cython.void`：将所有点加入集合
+- `Has(size_t i)-> cython.bint`：检查点i是否在集合中
+- `Add(size_t i)-> cython.bint`：将点i加入集合中
+- `Swap(ParallelBitset &other)-> cython.void`：和另一组ParallelBitset集合交换元素
+
+### 点数组类ParallelVector
+- `ParallelVector[T](size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `operator[](i: size_t)-> T`：下标为i的数据
+- `begin()-> cython.pointer(T)`：ParallelVector的起始指针
+- `end()-> cython.pointer(T)`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `Back()-> T`：ParallelVector最后一个数据
+- `Data()-> cython.pointer(T)`：表示数组本身数据
+- `Destroy()-> cython.void`：清空ParallelVector数组内数据并删除数组
+- `Size()-> size_t`：表示ParallelVector中的数据个数
+- `Resize(size: size_t)-> cython.void`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `Clear()-> cython.void`：清空ParallelVector内数据
+- `ReAlloc(capacity: size_t)-> cython.void`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `Fill(elem: T)-> cython.void`：为ParallelVector的全部数据赋值为elem
+- `Append(elem: T, atomic: cython.bint = true)-> cython.void`：向ParallelVector结尾添加一个数据
+- `Swap(other: ParallelVector[T])-> cython.void`：和其他的ParallelVector交换数据
+- `Copy()-> ParallelVector[T]`：复制当前的ParallelVector数据存至Copy数组中
+
+### 自定义数据结构
+- `Empty`：内容为空的特殊数据类型。
+- `EdgeUnit[EdgeData]`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+    - `src: size_t`：边的起始点
+    - `dst: size_t`：边的终点
+    - `edge_data: EdgeData`：边的权值
+- `AdjUnit[EdgeData]`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+    - `neighbour: size_t`：边的邻居点
+    - `edge_data: EdgeData`：边的权值
+- `AdjList[EdgeData]`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+    - `begin()-> cython.pointer(AdjUnit[T])`：列表的起始指针
+    - `end()-> cython.pointer(AdjUnit[T])`：列表的结束指针。
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: 下标为i的数据
+
+### 图类OlapBase
+- `NumVertices()-> size_t`：获取点数
+- `NumEdges()-> size_t`：获取边数
+- `OutDegree(size_t vid)-> size_t`：点vid的出度
+- `InDegree(size_t vid)-> size_t`：点vid的入度
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`：分配一个类型为VertexData的数组，大小为点个数
+- `AllocVertexSubset()-> ParallelBitset`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有出边集合
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有入边集合
+- `Transpose()-> cython.void`：对有向图进行图反转
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+    - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+    - `input_vertices`：指定数组读入图的点个数。
+    - `input_edges`：指定数组读入图的边的条数。
+    - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`：对点vid解锁，所有线程均可访存该锁对应的点数据
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程，在Python中与C++使用方法稍有不同。
+
+```python
+# 函数名称:ProcessVertexInRange[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           lower: size_t, upper: size_t,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#     函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+#     第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#     具体实现请参考include/lgraph/olap_base.h中具体代码
+#
+#     使用示例:统计数组parent数组中有出边的点个数
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython. pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython. pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+其中g为图类OlapBase的实例化对象
+
+```python
+# 函数名称:ProcessVertexActive[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           active: ParallelBitset,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#   函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+#   第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#   具体实现请参考/include/lgraph/olap_base.h中具体代码
+#
+# 使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self.graph.OutDegree(vi)
+        dst: size_t
+        edges = self.graph.OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbour
+            printf("node %lu has neighbour %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+如上面两个例子所展示，在Python中ProcessVertexActive与ProcessVertexInRange比在C++中额外需要一个算法类指针参数，Work函数一般也作为该算法类的成员函数，满足Work函数访问成员变量的需求（如图graph，点数组parent），在调用批处理函数时将Work函数和算法类的self指针传入批处理函数。
+
+其中Work函数会在多线程中调用，因此加上修饰器`@cython.nogil`释放Python全局解释锁，在多线程执行的代码中（例如批处理函数中的Work函数，`cython.parallel.prange`中），不能包含Python对象，最好通过`dst: type`或者`dst = cython.declare(type)`的方式声明变量为C/C++类型。
+
+### 图类OlapOnDB:
+并行化创建有向图：
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+并行化创建无向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING创建有向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### 图类OlapOnDisk
+
+#### ConfigBase：
+- `ConfigBase()`: 构造函数
+- `std::string input_dir`: 图边表数据路径
+- `std::string output_dir`: 输出结果路径
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: 读入图数据
+
+
+## 5. lgraph_db API
+见procedures/algo_cython/lgraph_db.pxd与lgraph_db_python.py文件。
+
+lgraph_db.pxd中接口用法与功能基本与C++接口相同，lgraph_db.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: 获取点的vid
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: 设置用户
+- `SetUser(user: std::string)-> cython.void`: 设置用户
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: 创建GraphDB
+
+### GraphDB：
+- `CreateReadTxn()-> Transaction`: 创建只读事务
+- `CreateWriteTxn()-> Transaction`: 创建写事务
+- `ForkTxn(txn: Transaction)-> Transaction`: 复制事务，只能复制读事务
+
+### Transaction：
+```
+GetVertexIndexIterator(
+                label: std::string,
+                field: std::string,
+                key_start: std::string,
+                key_end: std::string)-> VertexIndexIterator
+```
+获取索引迭代器。迭代器的field值为 [key_start, key_end]。所以在key_start=key_end=v时，返回指向field值为v的点的迭代器
+
+lgraph_db_python.py是lgraph_db.pxd中C++类 Galaxy与GraphDB的包装，将C++类包装为Python类，将lgraph_db_python.py编译为Python拓展后，可以直接在Python文件或Python命令行中`import lgraph_db_python`访问lgraph_db_python.PyGraphDB与PyGraphDB.PyGalaxy。
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(self, user: str password: str)-> void`: 设置用户
+- `SetUser(self, user: std::string)-> void`: 设置用户
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: 创建PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)-> cython.Py_ssize_t`: C++ 类GraphDB的地址
+
+## 6. 算法插件示例
+下面为Python实现的BFS算法的代码示例：
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# 注释作用如下：
+# language_level=3: 使用Python3
+# cpp_locals=True: 需要c++17，使用std::optional管理Python代码中的C++对象，可以避免C++对象的拷贝构造
+# boundscheck=False: 关闭索引的边界检查
+# wraparound=False: 关闭负数下标的处理（类似Python List）
+# initializedcheck=False: 关闭检查内存是否初始化，关闭检查后运行性能更快
+# language = c++: 将此py文件翻译为C++而不是C文件，TuGraph使用大量模板函数，所以都应该使用C++
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# 从procedures/algo_cython/ 中cimportolap_base.pxd与lgraph_db.pxd, 类似C++中#include "xxx.h"
+
+from cython.cimports.libc.stdio import printf
+# 类似C++中#include <stdio.h>
+# 其他常见的还有cython.cimports.libcpp.unordered_map等
+
+import time
+
+
+@cython.cclass
+# cython.cclass 表示BFSCore为C类型的Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty])表示OlapBase[Empty]的指针，类似C++中OlapBase[Empty]*
+    # cython提供了常见类型的指针，如cython.p_int, cython.p_char等，表示int*, char*, ...
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t 声明root为C++ size_t类型变量，等效于root = cython.declare(size_t)
+    # 不声明类型的变量为Python object类型
+    # 声明变量类型会大幅提高性能，同时在多线程部分，只有C/C++类型的变量可以访问
+
+    @cython.cfunc
+    # cython.cfunc 表示Work为C类型的函数，参数与返回值应声明
+    # cfunc性能好，能接受C/C++对象为参数、返回值，但是不能在其他python文件中调用
+    # 类似的有cython.ccall，如Standalone函数，可以在其他python文件中调用
+    @cython.nogil
+    # cython.nogil 表示释放Python全局解释锁，在nogil修饰的部分，不能访问Python对象
+    # 在多线程部分，都应有nogil修饰器
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) 表示禁用异常传播，将忽略函数内部引发的Python异常
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbour
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 表示dst没有被bfs访问过
+                if self.active_out.Add(dst):
+                    # 将dst设置为为活跃节点；ParallelBitmap.Add为原子操作，防止重复计算
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython.size_t:
+        self.graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self.parent.Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self.active_in.Add(self.root)
+        while num_activations > 0:
+            self.active_out.Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self.active_out.Swap(self.active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time.time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # 并行创建OlapOnDB
+    # Cython不支持如 *db 的解引用操作，通过db[0]来解引用
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # 通过 GetVertexIndexIterator 根据root节点label名和filed名与filed值（root_id）
+    # 获取root节点的迭代器，通过迭代器获取vid，在无ID_MAPPING时，该vid与OlapOnDB中的id相同
+    cost = time.time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time.time()
+    count = a.run(cython.address(olapondb), root_vid)
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb.NumVertices()
+    response["num_edges"] = olapondb.NumEdges()
+    return True
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process为embed模式和procedure模式下插件入口，用cython.ccall修饰
+    # Process函数必须名为Process，参数为lgraph_db_python.PyGraphDB与bytes
+    # 返回值必须为(bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # 获取PyGraphDB中GraphDB对象的地址，转换为指针后传递
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..7bf7f3ebf1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,189 @@
+# 内置算法
+
+> 此文档主要详细介绍了TuGraph内置的算法程序，社区版6种算法可参考基础算法报
+
+## 简介
+
+TuGraph目前包含以下6个基础算法28种扩展算法，共34个图算法：
+
+### 基础算法包：
+| 中文算法名 | 英文算法名 | 程序名
+|  :----:  | :----: | :----: |
+| 广度优先搜索 | Breadth-First Search  | bfs 
+| 网页排序 | Pagerank | pagerank 
+| 单源最短路径 | Single-Source Shortest Path | sssp 
+| 弱连通分量 | Weakly Connected Components | wcc 
+| 平均集聚系数 | Local Clustering Coefficient  | lcc
+| 标签传播 | Label Propagation Algorithm | lpa 
+
+### 扩展算法包：
+| 中文算法名 | 英文算法名 | 程序名
+| :----: | :----: | :----: |
+| 全对最短路径 | All-Pair Shortest Path  | apsp 
+| 介数中心度 | Betweenness Centrality | bc 
+| 置信度传播 | Belief Propagation | bp
+| 距离中心度 | Closeness Centrality | clce
+| 共同邻居 | Common Neighborhood | cn 
+| 度数关联度 | Degree Correlation  | dc
+| 直径估计 | Dimension Estimation | de 
+| EgoNet算法 | EgoNet | en
+| 超链接主题搜索 | Hyperlink-Induced Topic Search | hits
+| 杰卡德系数 | Jaccard Index | ji
+| K核算法 | K-core | kcore
+| 鲁汶社区发现 | Louvain | louvain 
+| 多源最短路径 | Multiple-source Shortest Paths | mssp
+| 个性化网页排序 | Personalized PageRank | ppr
+| 强连通分量 | Strongly Connected Components | scc 
+| 监听标签传播 | Speaker-listener Label Propagation Algorithm | slpa
+| 两点间最短路径 | Single-Pair Shortest Path | spsp
+| 三角计数 | Triangle Counting | triangle 
+| 信任指数排名 | Trustrank | trustrank 
+| 带权重的标签传播 | Weighted Label Propagation Algorithm | wlpa 
+| 带权重的网页排序 | Weighted Pagerank Algorithm | wpagerank 
+| 最大独立集算法 | Maximal independent set | mis 
+| sybil检测算法 | Sybil Rank | sybilrank 
+| 子图匹配算法 | Subgraph Isomorphism | subgraph_isomorphism
+| 模式匹配算法 | Motif | motif
+| k阶团计数算法 | Kcliques | kcliques
+| k阶桁架计数算法 | Ktruss | ktruss 
+| 莱顿算法 | Leiden | leiden
+
+## 基础算法包
+
+### 广度优先搜索
+
+广度优先搜索实现了Breadth-first Search算法，从根点开始，沿着图的宽度遍历所有可访问点。返回结果为遍历点个数。算法内容请参考 [https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 网页排序
+
+网页排序程序实现了常用的Pagerank算法。该算法根据图中边和边权值计算所有点的重要性排名，PageRank值越高，表示该点在图中的重要性越高。计算时以点数量的倒数为各点初始Rank值，然后将点的Rank值按照出边平均传递到相邻点，重复该传递过程直到满足给定的收敛阈值或达到给定迭代轮数。每轮传递结束后，所有点的Rank值会有一定的的比例随机传递到任意点上。算法内容请参考 [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 单源最短路径
+
+单源最短路径实现了Single Source Shortest Path算法，根据给定的源点，计算从该源点出发到其他任意点的最短路径长度。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 弱连通分量
+
+弱连通分量程序实现了Weakly Connected Components算法，该算法会计算图中所有的弱连通分量。弱连通分量是图的一个子图，子图中任意两点之间均存在可达路径。算法内容请参考[https://en.wikipedia.org/wiki/Connected_component_(graph_theory)](https://en.wikipedia.org/wiki/Connected_component_(graph_theory) "scc wiki")。
+
+### 平均集聚系数
+
+平均集聚系数程序实现了Local Clustering Coefficient算法，计算图中点之间聚集程度的系数。返回结果包括整体集聚系数和点集聚系数。整体集聚系数反映了图中整体的集聚程度的评估，点集聚系数包括任意点的集聚系数，反映了该点附近的集聚程度。集聚系数越高，表示集聚程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 标签传播
+
+标签传播算法程序实现了Label Propagation Algorithm算法。该算法是基于标签传播的社区发现算法，计算对象为无权图。在标签传递时，每个点对收到的所有标签进行次数累加，在累加和最高的标签中随机选择一个。迭代收敛或执行到给定轮数后算法终止。最终输出结果为每个点的标签，标签值相同的点视为在同一社区。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+
+## 扩展算法包
+
+### 全对最短路径
+
+全对最短路径程序实现了All-Pair Shortest Path算法，计算图中任意两点间的最短路径。返回结果为任意存在路径的点对之间的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 介数中心度
+
+介数中心度程序实现了Betweenness Centrality算法，估算图中所有点的介数中心度值。介数中心度值反映了图中任一最短路径经过该点的可能性，值越高表示有越多的最短路径经过了该点。计算时需给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 置信度传播
+
+置信度传播程序实现了Belief Propagation算法。该算法给定已观测点的边缘分布，利用点之间相互传递消息的机制来估算未观测点的边缘分布。算法内容请参考[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 距离中心度
+
+距离中心度程序实现了Closeness Centrality算法，估算任意点到图中其他点的最短路径的平均长度。距离中心度越小，表示该点到其他点的平均最短距离最小，意味着该点从几何角度看更位于图的中心位置。计算时需要给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki")。
+
+### 共同邻居
+
+共同邻居程序实现了Common Neighborhood算法，计算任意给定相邻点对之间的共同邻居数量。计算时给定待查询的若干个点对，返回结果为待查询的任意点对的共同邻居数量。
+
+### 度数关联度
+
+度数关联度程序实现了Degree Correlation算法，通过计算任意相邻点对之间的Pearson关联系数来计算图的度数关联度，可用来表征图中高度数点之间关联程度。度数关联度越高，表示图中高度数点之间的关联程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 直径估计
+
+直径估计程序实现了Dimension Estimation算法。该算法会计算图中最长的最短路径长度，用来表征图的直径大小。算法内容请参考[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### EgoNet算法
+
+EgoNet算法需要给定根点和K值，以根点为源点进行宽度优先搜索，找出所有K度以内的邻居组成的子图。找到的子图称为根点的EgoNet。
+
+### 超链接主题搜索
+
+超链接主题搜索算法实现了Hyperlink-Induced Topic Search算法，该算法假定每个点具有权威性Authority和枢纽性Hub两个属性，一个好的枢纽点应该指向许多高权威性的点，而一个良好的权威点应该被许多高枢纽型的点指向。算法将返回每个点的权威性值和枢纽性值。算法内容请参考[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 杰卡德系数
+
+杰卡德系数程序实现了Jaccard Index算法。该算法计算了给定点对之间的Jaccard系数，可用来表示这两个点的相似度。Jaccard系数越高，表示点对之间的相似程度越高。计算时给定带查询的若干点对，返回结果为这些点对的Jaccard系数。算法内容请参考[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### k核算法
+
+k核算法实现了k-core算法。该算法计算所有点的核数，或找出图中所有的K核子图。K核子图是一种特殊子图，子图中任意点度数都不小于给定K值。算法内容请参考 [https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)](https://en.wikipedia.org/wiki/Degeneracy_(graph_theory) "kcore wiki")。
+
+### 鲁汶社区发现
+
+鲁汶社区发现程序实现了Fast-unfolding算法。该算法是基于模块度的社区发现算法，通过不断合并点社区来最大化图的模块度，能够发现层次性的社区结构。算法内容请参考 [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 多源最短路径
+
+多源最短路径程序实现了Multiple-source Shortest Paths算法，根据给定的多个源点，从这些源点出发，计算到达任意点的最短路径值。其中，多个源点到某一点的最短路径值为分别从每个源点出发到达该点的最短路径的最小值。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 个性化网页排序
+
+个性化网页排序程序实现了Personalized PageRank算法。该算法根据给定的源点，基于该源点个性化计算所有点对于源点的重要性排名。Rank值越高，表示该点对于源点越重要。与PageRank不同的是，初始化时源点Rank值为1，其余点Rank值为0；并且每轮传递结束后，Rank值会有一定的比例随即传递回源点。算法内容请参考 [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 强连通分量
+
+强连通分量程序实现了Strongly Connected Components算法。该算法计算了图中所有的强连通分量，强连通分量是图的一个子图，子图中可从任意点出发到达其他任意点。算法内容请参考[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 监听标签传播
+
+监听标签传播算法程序实现了Speaker-listener Label Propagation Algorithm算法。该算法是基于标签传播和历史标签记录的社区发现算法，是对标签传播算法的扩展。与标签传播算法不同的是，本算法会对所有点记录其历史标签，在迭代中对标签进行累加时，会将历史标签也计算在内。最终输出结果为每个点的所有历史标签记录。算法内容请参考论文：“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 两点间最短路径
+
+两点间最短路径程序实现了Bidirectional Breadth-First Search算法，在有向无权图上从起点沿着出边做正向宽度优先搜搜，从终点沿着入边做反向宽度优先搜索，通过起点和终点共同遍历到的点来确定从起点到终点的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 三角计数
+
+三角计数实现了Triangle-counting算法，计算无向图中的三角形个数，可用来表征图中点的关联程度。三角形数越多，表示图中点的关联程度越高。算法内容请参考论文：“Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study” 。
+
+### 信任指数排名
+
+信任指数排名算法实现了Trustrank算法，可以根据给定的白名单，计算任意点的信任指数。信任指数越高，表示该点为非法点的可能性越小。算法内容请参考 [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 带权重的标签传播
+
+带权重的标签传播算法程序实现了Weighted Label Propagation Algorithm算法。=与标签传播算法不同的是，标签的传递跟边的权重相关，在标签传递时，每个点会根据标签的入边进行权重累加，在累加和最高的标签中随机选择一个。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 带权重的网页排序
+
+带权重的网页排序算法程序实现了Weighted Pagerank算法。与PageRank算法不同的是，Rank值的传递跟边的权重有关，点的Rank值将按照边权重加权传递到相邻点。算法内容请参考[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 最大独立集算法
+
+最大独立集算法实现了Maximal independent set算法。最大独立集是指在这个独立集之外没有可以加入它的点。一个图可能有许多大小差异很大的 MIS，算法找出其中一个。算法内容请参考 [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### Sybil检测算法
+
+Sybil检测算法实现了Sybil Rank算法。SybilRank算法从非Sybil节点开始进行提前终止的随机游走。算法内容请参考论文：“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 子图匹配算法
+
+子图匹配算法实现了subgraph_isomorphism算法。subgraph_isomorphism算法对全图所有节点匹配子图，最后输出每个节点被匹配的次数。算法内容参考 [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 模式匹配算法
+
+模式匹配算法实现了motif算法。motif算法对指定的节点匹配k阶子图，最后输出每个指定节点每种k阶子图个数，每个k阶子图用一个64位整数表示，整数的第$i \times k + j$位为1表示子图中有边i->j。算法内容参考 [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### k阶团计数算法
+
+k阶团计数算法实现了k-cliques算法。k-cliques算法对计算图中所有的k阶完全子图的个数，最后输出每个节点所在的k阶完全子图个数。算法内容参考 [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### k阶桁架计数算法
+
+k阶桁架计数算法实现了k-truss算法。k-truss指每条边都至少是k-2个三角形的边的子图。k-truss算法找出图的k-truss子图，最后输出每个节点在子图中的邻居节点列表。算法内容参考 [https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+### 莱顿算法
+
+莱顿算法实现了了leiden算法。leiden算法是基于模块度的社区发现算法，与louvain算法优势在于leiden算法检测出社区中的断链，保证每个社区具有良好的连通性。算法内容参考 [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..bc80c68c65
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+分析接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..46813c7cca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,83 @@
+# Learn Tutorial
+
+> 本文档是为 TuGraph 的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对 TuGraph 的图学习运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于 Tugraph 的一个简单的程序实例，我们将重点介绍其使用方式。
+
+## 1.TuGraph 图学习模块简介
+图学习是一种机器学习方法，其核心思想是利用图结构中的拓扑信息，通过顶点之间的联系及规律来进行数据分析和建模。不同于传统机器学习方法，图学习利用的数据形式为图结构，其中顶点表示数据中的实体，而边则表示实体之间的关系。通过对这些顶点和边进行特征提取和模式挖掘，可以揭示出数据中深层次的关联和规律，从而用于各种实际应用中。
+
+这个模块是一个基于图数据库的图学习模块，主要提供了四种采样算子：Neighbor Sampling、Edge Sampling、Random Walk Sampling 和 Negative Sampling。这些算子可以用于对图中的顶点和边进行采样，从而生成训练数据。采样过程是在并行计算环境下完成的，具有高效性和可扩展性。
+
+在采样后，我们可以使用得到的训练数据来训练一个模型。该模型可以用于各种图学习任务，比如预测、分类等。通过训练，模型可以学习到图中的顶点和边之间的关系，从而能够对新的顶点和边进行预测和分类。在实际应用中，这个模块可以被用来处理各种大规模的图数据，比如社交网络、推荐系统、生物信息学等。
+
+## 2. 运行流程
+TuGraph 图学习模块将TuGraph中的图数据采样，采样后的顶点和边作为图学习的特征，进行学习训练。运行流程如下图所示：
+![Alt text](../../../../images/learn_flow_chart_zh.png)
+
+## 3.TuGraph编译及数据准备
+TuGraph编译请参考：[编译](../../5.installation&running/6.compile.md)
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+## 4. 数据导入
+数据导入请参考[数据导入](../../6.utility-tools/1.data-import.md)
+
+导入过程以cora数据集为例：
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+## 5. feature特征转换
+由于图学习中的feature特征一般表示为较长的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+## 6. 采样算子及编译
+TuGraph在cython层实现了一种获取全图数据的算子及4种采样算子，具体如下：
+### 6.1.采样算子介绍
+| 采样算子 | 采样方式 |
+| --- | --- |
+| GetDB | 从数据库中获取图数据并转换成所需数据结构 |
+| Neighbor Sampling | 根据给定的顶点采样其邻居顶点，得到采样子图 |
+| Edge Sampling | 根据采样率采样图中的边，得到采样子图 |
+| Random Walk Sampling | 根据给定的顶点，进行随机游走，得到采样子图 |
+| Negative Sampling | 生成不存在边的子图。 |
+
+### 6.2.编译
+如果TuGraph已编译，可跳过此步骤。
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+得到算子so后，在Python中import 即可使用。
+
+## 7. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+## 8. 模型加载
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+在使用保存的模型之前，首先需要对其进行加载。代码中，使用如上的代码对已训练模型进行加载。
+
+加载之后，我们可以使用模型对新的顶点和边进行预测和分类。在预测时，我们可以输入一个或多个顶点，模型将输出相应的预测结果。在分类时，我们可以将整个图作为输入，模型将对图中的顶点和边进行分类，以实现任务的目标。
+使用已训练的模型可以避免重新训练模型的时间和资源消耗。此外，由于模型已经学习到了图数据中顶点和边之间的关系，它可以很好地适应新的数据，从而提高预测和分类的准确度。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..2a1c0ac8d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,97 @@
+# Sampling API
+
+> 此文档主要详细介绍了Sampling API的使用说明
+
+## 1. 概述
+
+本手册介绍使用TuGraph的Sampling API接口。
+
+## 2. 图数据预处理
+在采样操作之前，根据图数据路径加载图数据，并映射成olapondb图分析类，代码如下：
+
+```python
+galaxy = PyGalaxy(args.db_path) # 根据路径创建一个galaxy实例
+galaxy.SetCurrentUser(args.username, args.password) # 设置当前用户
+db = galaxy.OpenGraph('default', False) # 打开图数据库指定db
+txn = db.CreateReadTxn() # 创建一个事务实例
+olapondb = PyOlapOnDB('Empty', db, txn) # 根据图加载方式、图数据库实例、事务实例实例化OlapOnDB
+del txn
+del db
+del galaxy
+```
+## 3. 图采样算子介绍
+图采样算子在cython层实现，用于对输入的图进行采样处理，生成的NodeInfo用于保存feature属性、label属性等点信息，EdgeInfo用于保存边信息，这些元数据信息可以被用于特征抽取、网络嵌入等任务中。目前TuGraph图学习模块支持GetDB、NeighborSampling、EdgeSampling、RandomWalkSampling、NegativeSampling五种采样算子。
+### 3.1.RandomWalk算子：
+在给定的采样点周围进行指定次数的随机游走，得到采样子图。
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+step: size_t类型，采样步数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.2.NeighborSample算子：
+在给定采样点的一度邻居中采样一定数量的点，得到采样子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+nei_num: size_t类型，邻居采样点数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.3.Nagetive算子：
+采用负采样算法，生成不存在边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+num_samples: size_t类型，生成不存在边的数量。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值： 无。
+
+### 3.4.EdgeSampling算子：
+根据边采样率，生成采样边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list,EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_rate: double类型，采样率。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.5.GetDB算子：
+从数据库中获取图数据并转换成所需数据结构。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+## 4. 用户自定义采样算法
+用户也可以通过TuGraph Olap接口实现自定义采样算法，接口文档参见[此处](../2.olap/5.python-api.md)，该文档主要介绍图采样算法使用的相关函数的接口设计。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..c8dd5e8e1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,101 @@
+# Training
+
+> 本文档详细介绍了如何使用TuGraph进行图神经网络（GNN）的训练。
+
+## 1. 训练
+使用TuGraph 图学习模块进行训练时，可以分为全图训练和mini-batch训练。
+全图训练即把全图从TuGraph db加载到内存中，再进行GNN的训练。而mini-batch训练则使用上面提到的TuGraph 图学习模块的采样算子，将全图数据进行采样后，再送入训练框架中进行训练。
+## 2. Mini-Batch训练
+Mini-Batch训练需要使用TuGraph 图学习模块的采样算子，目前支持Neighbor Sampling、Edge Sampling、Random Walk Sampling和Negative Sampling。
+TuGraph 图学习模块的采样算子进行采样后的结果以List的形式返回。
+下面以Neighbor Sampling为例，介绍如何将采样后的结果，进行格式转换，送入到训练框架中进行训练。
+用户需要提供一个Sample类：
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. 加载图数据
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+
+        # 2. 采样方法，结果存储在NodeInfo和EdgeInfo中
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+
+        # 3. 对结果进行格式转换，使之符合训练格式
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+如代码所示，首先将图数据加载到内存中。然后使用采样算子对图数据进行采样，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+最后对结果进行格式转换，使之符合训练格式。这里我们使用的是DGL训练框架，因此使用结果数据构造了DGL Graph，最终将DGL Graph返回。
+我们提供TuGraphSample类之后，就可以使用它进行Mini-Batch训练了。
+令DGL的数据加载部分使用TuGraphSample的实例sampler：
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+使用DGL进行模型训练：
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+
+## 3. 全图训练
+GNN（图神经网络）的全图训练是一种涉及一次处理整个训练数据集的训练。它是 GNN 最简单、最直接的训练方法之一，整个图被视为单个实例。 在全图训练中，整个数据集被加载到内存中，模型在整个图上进行训练。这种类型的训练对于中小型图特别有用，并且主要用于不随时间变化的静态图。
+在算子调用时，使用以下方式：
+```python
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+获取全图数据，然后将全图送入训练框架中进行训练。
+完整代码：请参考learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..b5c8888189
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,102 @@
+# Heterogeneous Graph
+
+> 本文档介绍如何使用异质图进行训练。
+
+## 1. 异质图简介
+异质图（Heterogeneous Graph）是指由不同类型的节点和边构成的图结构。在异质图中，节点和边可以具有多样化的属性和关系，代表了不同实体以及它们之间的复杂关联。
+
+在异质图中，节点类型可以代表不同的实体，如用户、商品、话题等，而边类型表示不同实体之间的关系，如用户之间的关注关系、用户与商品之间的购买关系等。节点和边可以具有不同的属性。
+
+异质图提供了一种强大的图模型，能够更好地表达和分析具有多种类型实体和复杂关系的现实世界系统。在不同领域的数据分析和应用中，异质图具有广泛的应用前景和研究价值。
+
+## 2. 异质图创建
+在TuGraph中，一个异构图由一系列边关系构成。每个关系由一个字符串三元组定义 (源节点类型, 边类型, 目标节点类型) 。异质图的创建方式与同质图类似，只是在创建图时需要指定字符串三元组定义。如下所示。
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+其中，第四个参数为异质图的边关系定义，可以通过该参数，指定筛选的异质图点边类型。如果不指定该参数，则默认将全部点边类型的数据进行构图训练。
+
+## 3. 异质图查询接口
+为了方便用户使用，当用户给定第四个参数时，TuGraph提供了查询异质图点边类型的接口。示例如下所示：
+
+### 3.1 点类型查询接口
+```python
+olapondb.ntypes()
+```
+返回值为点类型列表，如['node1', 'node2', 'node3']。
+
+### 3.2 边类型查询接口
+```python
+olapondb.etypes()
+```
+返回值为边类型列表，如['edge1', 'edge2', 'edge3']。
+
+### 3.3 点类型和边类型查询接口
+```python
+olapondb.metagraph()
+```
+返回值为字符串三元组定义 (源节点类型, 边类型, 目标节点类型)，如
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')]。
+
+## 4. 异质图输出格式
+和同质图相同的是，异质图的采样数据结果也存储在NodeInfo和EdgeInfo中。
+可通过如下方式获取输出数据。
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+其中getdb为获取全图数据的函数，db为图数据库实例，olapondb为图分析类。feature_len为节点特征长度，NodeInfo和EdgeInfo为输出的节点和边信息。
+
+其存储信息结果如下：
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 边类型 | EdgeInfo[2] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+| 顶点类型 | NodeInfo[3] |
+
+## 5. 异质图训练
+异构图训练的目标是学习图中节点和边的表示，以便于进行后续的任务，如节点分类、链接预测、图聚类等。为了实现这一目标，研究者们提出了多种基于图神经网络（Graph Neural Networks，GNNs）的模型。这些模型通过聚合邻居节点的信息来更新节点的表示，进而捕捉图结构中的复杂关系。
+
+由于异构图中包含多种类型的节点和边，因此在设计GNN模型时需要考虑如何处理这些不同类型的信息。一种常见的方法是设计不同的聚合函数来分别处理不同类型的邻居节点。此外，还需要考虑如何将这些不同类型的信息整合到一起，以便于模型能够有效地学习到节点和边的表示。
+
+TuGraph 提供了使用裁剪版ogbn-mag数据集进行异质图训练的方法，可供使用者参考。
+
+TuGraph提供的官方docker中暂未提供异质图训练的环境，因此需要用户自行安装相关依赖包。
+在训练之前需要下载ogb和pandas包，具体安装方式如下：
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+训练代码如下所示：
+
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+全部训练代码可参考tugraph/learn/examples/train_full_mag.py文件。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..e79e36ea91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+图学习
+======
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..d4c9759490
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+存储过程和分析接口
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/conf.py b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/conf.py
new file mode 100644
index 0000000000..34515a01b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/development_guide.md b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/development_guide.md
new file mode 100644
index 0000000000..bd55ee10bf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/development_guide.md
@@ -0,0 +1,289 @@
+# 业务开发指南
+## 连接tugraph-db
+### 驱动连接
+tugraph-db兼容neo4j的通讯协议，因此可以使用neo4j的驱动连接tugraph-db的server。
+
+[bolt driver 使用介绍](./7.client-tools/5.bolt-client.md)
+
+[bolt driver 使用例子](https://github.com/TuGraph-family/tugraph-db/tree/master/demo/Bolt)
+
+### 终端连接
+驱动是业务代码里面使用的，对于服务器上终端访问，可以使用cli客户端。
+
+[console client 使用介绍](./7.client-tools/6.bolt-console-client.md)
+
+## 子图操作
+### 创建子图
+```
+CALL dbms.graph.createGraph('graph1')
+```
+### 删除子图
+```
+CALL dbms.graph.deleteGraph('graph1')
+```
+### 清空子图
+#### 删除所有的点边数据和图schema
+```
+CALL db.dropDB()
+```
+#### 只删除所有点边数据, 保留图schema
+```
+CALL db.dropAllVertex()
+```
+### 查看图schema
+```
+CALL dbms.graph.getGraphSchema()
+```
+### 列出所有子图
+```
+CALL dbms.graph.listGraphs()
+```
+
+### 刷新子图文件系统缓存数据
+```
+CALL db.flushDB()
+```
+
+## 点类型操作
+### 创建点类型
+如下json定义了一个点类型，名字是`node1`。
+```json
+{
+	"label": "node1",
+	"primary": "id",
+	"type": "VERTEX",
+	"detach_property": true,
+	"properties": [{
+		"name": "id",
+		"type": "INT32",
+		"optional": false
+	}, {
+		"name": "name",
+		"type": "STRING",
+		"optional": false,
+		"index": true
+	}, {
+		"name": "num",
+		"type": "INT32",
+		"optional": false,
+		"index": true,
+		"unique": true
+	}, {
+		"name": "desc",
+		"type": "STRING",
+		"optional": true
+	}]
+}
+
+```
+把上面这个json序列化成字符串，作为参数传入，建议使用驱动的参数化特性，避免自己拼接语句。
+```
+CALL db.createVertexLabelByJson($json_data)
+```
+
+### 查看点类型schema
+```
+CALL db.getVertexSchema('node1')
+```
+
+### 删除点类型
+>该操作会同步删除所有该类型的点数据，数据量大的时候，有时间消耗。
+
+如下例子删除点类型`node1`以及该类型的所有点数据。
+```
+CALL db.deleteLabel('vertex', 'node1')
+```
+
+### 点类型添加字段
+>该操作会同步变更所有该类型点的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，一次添加了两个字段：`field1`，字符串类型，可选，默认值是 `null`; `field2`，`int64`类型，必选，默认值是0.
+```
+CALL db.alterLabelAddFields('vertex', 'node1', ['field1', string, null ,true], ['field2', int64, 0, false])
+```
+
+### 点类型删除字段
+>该操作会同步变更所有该类型点的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，一次删除了两个字段: `field1` 和 `field2`。
+```
+CALL db.alterLabelDelFields('vertex', 'node1', ['field1', 'field2'])
+```
+
+### 点类型添加索引
+>该操作会同步构建索引数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，给`field1`字段添加了一个非唯一索引。
+```
+CALL db.addIndex('node1', 'field1', false)
+```
+如下例子，对于点类型`node1`，给`field2`字段添加了一个唯一索引。
+```
+CALL db.addIndex('node1', 'field2', true)
+```
+
+### 点类型删除索引
+如下例子，对于点类型`node1`，删除字段`field1`上的索引。
+```
+CALL db.deleteIndex('node1', 'field1')
+```
+
+
+## 边类型操作
+### 创建边类型
+
+如下json定义了一个边的schema，名字是`edge1`。
+```json
+{
+  "label": "edge1",
+  "type": "EDGE",
+  "detach_property": true,
+  "constraints": [
+    ["node1", "node2"]
+  ]
+  "properties": [{
+    "name": "id",
+    "type": "INT32",
+    "optional": false
+  }, {
+    "name": "name",
+    "type": "STRING",
+    "optional": false,
+    "index": true
+  }, {
+    "name": "num",
+    "type": "INT32",
+    "optional": false,
+    "index": true,
+    "unique": true
+  }, {
+    "name": "desc",
+    "type": "STRING",
+    "optional": true
+  }]
+}
+```
+把上面这个json序列化成字符串，作为参数传入，建议使用驱动的参数化特性，避免自己拼接语句。
+```
+CALL db.createEdgeLabelByJson($json_data)
+```
+### 查看边类型schema
+```
+CALL db.getEdgeSchema('edge1')
+```
+
+### 删除边类型
+>该操作会同步删除所有该类型的边，数据量大的时候，有时间消耗。
+
+如下例子，删除边类型`edge1`以及该类型的所有边数据。
+```
+CALL db.deleteLabel('edge', 'edge1')
+```
+
+### 边类型添加字段
+>该操作会同步变更所有该类型边的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于边类型`edge1`，一次添加了两个字段: `field1`，字符串类型，可选，默认值是 `null`; `field2`，`int64`类型，必选，默认值是`0`.
+```
+CALL db.alterLabelAddFields('edge', 'edge1', ['field1', string, null ,true], ['field2', int64, 0, false])
+```
+
+### 边类型删除字段
+>该操作会同步变更所有该类型边的属性数据，数据量大的时候，有时间消耗。
+
+如下操作，对于边类型`edge1`，一次删除了两个字段: `field1` 和 `field2`。
+```
+CALL db.alterLabelDelFields('edge', 'edge1', ['field1', 'field2'])
+```
+
+### 边类型添加索引
+>该操作会同步构建索引数据，数据量大的时候，有时间消耗。
+
+如下例子，对于边类型`edge1`，给字段`field1`添加了一个非唯一索引。
+```
+CALL db.addEdgeIndex('edge1', 'field1', false, false)
+```
+如下例子，对于边类型`edge1`，给字段`field2`添加了一个唯一索引。
+```
+CALL db.addEdgeIndex('edge1', 'field2', true, false)
+```
+
+### 边类型删除索引
+如下例子，对于边类型`edge1`，删除字段`field1`上的索引。
+```
+CALL db.deleteEdgeIndex('edge1', 'field1')
+```
+
+## 实时查看当前点边数据量
+如下例子返回所有的点边类型，以及每种类型当前的数据量是多少。
+
+读的是统计数据，轻操作。
+```
+CALL dbms.meta.countDetail()
+```
+
+## 导入数据
+### 批量upsert点数据
+如果不存在就插入点，如果存在就更新点的属性，根据点的主键字段值判断是否存在。
+
+第二个参数是一个`list`类型，每个`list`里面的元素是个`map`类型，每个`map`里面是点的字段和对应的值。
+
+推荐使用driver里面的参数化特性，第二个参数直接传入一个 `list`结构体，避免自己构造语句。
+```
+CALL db.upsertVertex('node1', [{id:1, name:'name1'},{id:2, name:'name2'}])
+```
+### 批量upsert边数据
+如果两点之间不存在某条类型的边就插入，如果存在就更新该边的属性。
+
+第四个参数是一个`list`类型，每个数组里面的元素是个`map`类型，每个`map`里面是：边的起点类型主键字段和对应的值、边的终点类型主键字段和对应的值、边类型自身的属性字段和值。每个map里面至少有两个元素。
+
+第二个参数和第三个参数是为第四个参数服务的。分别说明了起点和终点的类型是什么，以及第四个参数中那个字段代表起点主键字段值，那个字段代表终点主键字段值。
+
+推荐使用driver里面的参数化特性，避免自己构造语句。
+```
+CALL db.upsertEdge('edge1',{type:'node1',key:'node1_id'}, {type:'node2',key:'node2_id'}, [{node1_id:1,node2_id:2,score:10},{node1_id:3,node2_id:4,score:20}])
+```
+
+### DataX
+
+https://github.com/ljcui/DataX/tree/bolt 自行编译。
+
+这个DataX实现的 tugraph writer 内部调用的是上面描述的`db.upsertVertex`和`db.upsertEdge`。
+
+### 离线脱机导入数据
+如果你有子图的schema以及子图里面所有的点边数据（csv或者json格式），可以利用`lgraph_import`工具离线将这些数据生成图数据。
+
+该方式适合初始阶段，先灌进去一批全量数据。注意server要停机，导入完再启动server，可以看到生成的子图数据。
+
+参考 [lgraph_import 使用介绍](./6.utility-tools/1.data-import.md) 中的**离线全量导入**部分
+
+## 导出数据
+
+### 在线远程流式导出数据
+[lgraph_cli 使用介绍](./7.client-tools/6.bolt-console-client.md)
+
+CSV 格式
+```
+echo "match(n:person) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+```
+JSON 格式
+```
+echo "match(n:person) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
+### 本地导出整个图的所有数据
+[lgraph_export 使用介绍](./6.utility-tools/2.data-export.md)
+
+CSV 格式
+```
+lgraph_export -d your_db_path -e export_data -g default -f json -u admin -p 73@TuGraph
+```
+JSON 格式
+```
+lgraph_export -d your_db_path -e export_data -g default -f json -u admin -p 73@TuGraph
+```
+
+### 跨版本迁移数据
+[lgraph_export 使用介绍](./6.utility-tools/2.data-export.md)
+
+对于不兼容的版本之间迁移数据，可以使用`lgraph_export`将旧版本server里面的数据全部导出成文本（里面包含图schema以及所有的点边数据），然后再选择合适的方法将这些文本数据导入到新版本。
diff --git a/docs/docusaurus/versions/version-4.3.2/zh-CN/source/index.rst b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/index.rst
new file mode 100644
index 0000000000..88684b85d4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.3.2/zh-CN/source/index.rst
@@ -0,0 +1,24 @@
+TuGraph高性能图数据库
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   development_guide.md
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile
new file mode 100644
index 0000000000..939b2ba108
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-CPP-Procedure-API/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.5.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-CPP-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-CPP-Procedure-API/run.sh
new file mode 100644
index 0000000000..e2455bfbc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-CPP-Procedure-API/run.sh
@@ -0,0 +1,5 @@
+#!/bin/bash
+
+# 0. install: yum install doxygen, graphviz
+# 1. run this script
+doxygen Doxyfile
diff --git a/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/Makefile b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/Makefile
new file mode 100644
index 0000000000..e58ac30a31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+SPHINXPROJ    = TuGraph
+SOURCEDIR     = .
+BUILDDIR      = _build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/conf.py b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/conf.py
new file mode 100644
index 0000000000..8af367a431
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/conf.py
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+#
+# Configuration file for the Sphinx documentation builder.
+#
+# This file does only contain a selection of the most common options. For a
+# full list see the documentation:
+# http://www.sphinx-doc.org/en/master/config
+
+# -- Path setup --------------------------------------------------------------
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#
+import os
+import sys
+sys.path.insert(0, os.path.abspath('../../../build/output/'))
+
+
+# -- Project information -----------------------------------------------------
+
+project = u'TuGraph'
+copyright = u'2018-2022, Ant Group'
+author = u'Ant Group'
+
+# The short X.Y version
+version = u''
+# The full version, including alpha/beta/rc tags
+release = u''
+
+
+# -- General configuration ---------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#
+# needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.autodoc',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+#
+# source_suffix = ['.rst', '.md']
+source_suffix = '.rst'
+
+# The master toctree document.
+master_doc = 'index'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+# This pattern also affects html_static_path and html_extra_path .
+exclude_patterns = [u'_build', 'Thumbs.db', '.DS_Store']
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+
+# -- Options for HTML output -------------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+#
+html_theme = 'nature'
+#html_theme = 'haiku'
+#html_theme = 'pyramid'
+#html_theme = 'sphinxdoc'
+#html_theme = 'bizstyle'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#
+# html_theme_options = {}
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Custom sidebar templates, must be a dictionary that maps document names
+# to template names.
+#
+# The default sidebars (for documents that don't match any pattern) are
+# defined by theme itself.  Builtin themes are using these templates by
+# default: ``['localtoc.html', 'relations.html', 'sourcelink.html',
+# 'searchbox.html']``.
+#
+# html_sidebars = {}
+
+
+# -- Options for HTMLHelp output ---------------------------------------------
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'TuGraphdoc'
+
+
+# -- Options for LaTeX output ------------------------------------------------
+
+latex_elements = {
+    # The paper size ('letterpaper' or 'a4paper').
+    #
+    # 'papersize': 'letterpaper',
+
+    # The font size ('10pt', '11pt' or '12pt').
+    #
+    # 'pointsize': '10pt',
+
+    # Additional stuff for the LaTeX preamble.
+    #
+    # 'preamble': '',
+
+    # Latex figure (float) alignment
+    #
+    # 'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'TuGraph.tex', u'TuGraph Documentation',
+     u'Ant Group', 'manual'),
+]
+
+
+# -- Options for manual page output ------------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'tugraph', u'TuGraph Documentation',
+     [author], 1)
+]
+
+
+# -- Options for Texinfo output ----------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'TuGraph', u'TuGraph Documentation',
+     author, 'TuGraph', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+
+# -- Extension configuration -------------------------------------------------
diff --git a/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/index.rst b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/index.rst
new file mode 100644
index 0000000000..64dd129bdf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/index.rst
@@ -0,0 +1,37 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+TuGraph Procedure API - Python
+====================================
+Version: 4.5.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Noe4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
+
+
+Indices and tables
+-------------------
+
+* :ref:`genindex`
+* :ref:`modindex`
+* :ref:`search`
diff --git a/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/make.bat b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/make.bat
new file mode 100644
index 0000000000..b1d0c9a1dd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=.
+set BUILDDIR=_build
+set SPHINXPROJ=TuGraph
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.http://sphinx-doc.org/
+	exit /b 1
+)
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/run.sh b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/run.sh
new file mode 100755
index 0000000000..d10e0a2b1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/autogen/TuGraph-Python-Procedure-API/run.sh
@@ -0,0 +1,7 @@
+# 0. install sphinx-build: yum install python3-sphinx
+# 1. default lgrpah module path: ../../../build/output/lgraph_python.so
+# 2. make lgraph_python
+# 3. run this script
+rm output -rf
+mkdir -p _static _templates
+sphinx-build -W -b html . output
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/.readthedocs.yaml b/docs/docusaurus/versions/version-4.5.1/en-US/.readthedocs.yaml
new file mode 100644
index 0000000000..92cd0965f1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/en-US/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/Makefile b/docs/docusaurus/versions/version-4.5.1/en-US/Makefile
new file mode 100644
index 0000000000..a4de0bff18
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?= -W
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/make.bat b/docs/docusaurus/versions/version-4.5.1/en-US/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/1.guide.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/1.guide.md
new file mode 100644
index 0000000000..1bd040f9bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/1.guide.md
@@ -0,0 +1,68 @@
+# Guide
+
+> Here is the document map that helps users learn and use the TuGraph community version quickly.
+
+## Quick Start
+
+> Understand [What is a Graph](./2.introduction/1.what-is-graph.md),[The application scenarios of graph](./2.introduction/8.scenarios.md),[What is TuGraph](./2.introduction/3.what-is-tugraph.md).
+
+> Quickly Install and deploy TuGraph:[Cloud Deployment](5.installation&running/5.cloud-deployment.md),[Docker Deployment](5.installation&running/3.docker-deployment.md)Rapid deployment TuGraph.
+
+> Quickly get started with DEMO:[Movie](./3.quick-start/2.demo/1.movie.md),[The Wandering Earth](./3.quick-start/2.demo/2.wandering-earth.md),[Three Body](./3.quick-start/2.demo/3.the-three-body.md),[Three Kingdoms](./3.quick-start/2.demo/4.three-kingdoms.md).
+
+> User Guide:[TuGraph Browser](./4.user-guide/1.tugraph-browser.md),[TuGraph Browser Legacy](./4.user-guide/2.tugraph-browser-legacy.md).
+
+## Development Guide
+
+> Client Tools: [Bolt Client](7.client-tools/5.bolt-client.md).
+
+> TuGraph Query Language:[Cypher API](8.query/1.cypher.md).
+
+> Procedure And Algorithm:[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md).
+
+> C++/Python Procedure Interfaces:[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## Community Contribution
+
+> Before starting to contribute, you can learn [how to contribute](12.contributor-manual/1.contributing.md)
+
+> If you want to understand the division of community roles, please visit [community roles](12.contributor-manual/2.community-roles.md)
+
+## Main warehouse
+
+> TuGraph-DB repository: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> Visual interface: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> Java client: [https://github.com/TuGraph-family/tugraph-db-client-java](https://github.com/TuGraph-family/tugraph-db-client-java)
+
+> Simple test method based on twitter data: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> Test method based on standard LDBC-SNB: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics repository: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## Video Center
+
+> [Get started quickly with TuGraph](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph technology sharing collection](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [Understand graph calculation in 3 minutes](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph-Latest-Version
+
+| Description                      | File                                  | Link                                                                                                                                                                                                     |
+|----------------------------------|---------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 runtime package          | tugraph-4.5.1-1.el7.x86_64.rpm        | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.5.1/tugraph-4.5.1-1.el7.x86_64.rpm)                                                                                         |
+| CentOS8 runtime package          | tugraph-4.5.1-1.el8.x86_64.rpm        | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.5.1/tugraph-4.5.1-1.el8.x86_64.rpm)                                                                                         |
+| Ubuntu18.04 runtime package      | tugraph-4.5.1-1.x86_64.deb            | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.5.1/tugraph-4.5.1-1.x86_64.deb)                                                                                             |
+| CentOS7 runtime image            | tugraph-runtime-centos7-4.5.1.tar     | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.5.1/tugraph-runtime-centos7-4.5.1.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                   |
+| CentOS7 compilation image        | tugraph-compile-centos7-1.3.4.tar     | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.3.4.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)          |
+| CentOS8 compilation image        | tugraph-compile-centos8-1.3.4.tar     | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.3.4.tar), [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)          |
+| Ubuntu18.04 compilation image    | tugraph-compile-ubuntu18.04-1.3.4.tar | [Download](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.3.4.tar) , [Visit](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04) |
+
+
+For the version update log, see: [Link](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md).
+
+If you don't know how to use installation packages and images, please refer to [Environment and Version Selection](13.best-practices/4.selection.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..c04cb1030c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/1.privilege.md
@@ -0,0 +1,141 @@
+# Privilege
+
+## 1.Introduce
+
+> The permissions of TuGraph are managed based on role-based access control. The permissions that define access control are assigned to roles, and the roles are then assigned to users.
+
+## 2.Level of permissions
+
+- Global layer: indicates global permissions, which have permissions for management and graph operations.
+- Graph layer: control permissions on each graph;
+- Property level (Commercial version only) : control permissions on a property
+
+## 3.Permission keyword
+
+At present, the control of permissions is relatively simple
+
+- The Global layer currently has admin permission, and the admin user is preset.
+
+* The Graph layer has four operation permissions: none, read, write, and full
+
+- none: No permission, no operation permission for the graph
+- read: Read-only permission, only has read permission for the graph
+- write: Read and write permission, not only has read permission for the graph, but also has write permission
+- full: All permissions, not only have read and write permissions for graphs, but also have permissions to delete graphs, modify graphs, and modify schemas
+
+* The Property layer (Commercial version only)  has the following permissions: none, read, and write
+
+- none: No permission, no operation permission for the property
+- read: Read-only permission, only has read permission for the property
+- write: Read and write permission, not only has read permission for the property, but also has write permission
+
+## 4.Common permission operations
+
+### 4.1.User action
+
+- Creating a user
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- Deleting a user
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- Change the password of the current user
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- Changes the password of a specified user
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- Disable or enable a user
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- List all users
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- Lists the current user information
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- Obtain user details
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.Role actions
+
+- Create a role
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- Delete a role
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- List all characters
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- Disable or enable the role
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.Assign roles to users
+
+- Adds the association between the user and the role
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- Deletes the association between the user and the role
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- Clears the relationship between user roles and rebuilds them
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.Role empowerment
+
+- Modifies the access permission of a role to a specified graph
+
+```cypher
+CALL dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP)
+```
+
+Example
+
+```cypher
+CALL dbms.security.modRoleAccessLevel("test_role", {test_graph1:"FULL", test_graph2:"NONE"})
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/2.token.md
new file mode 100644
index 0000000000..dd4ac2e2e5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/2.token.md
@@ -0,0 +1,42 @@
+# Token Usage Guide
+## 1. Introduction to Token
+JWT (JSON Web Token) is an open standard used for authentication and authorization. It is based on the JSON (JavaScript Object Notation) format and is designed for securely transmitting claim information between network applications.
+
+JWT consists of three parts: the header, payload, and signature. The header contains the type of JWT and the signature algorithm used, the payload contains the information to be transmitted, and the signature is used to verify the integrity and authenticity of the JWT.
+
+In TuGraph, JWT is used to implement a stateless authentication and authorization mechanism. After a user logs in successfully, the server generates a JWT and returns it to the client. The client passes this JWT as an identity credential in subsequent requests to the server. Upon receiving the JWT, the server verifies the signature and parses the information in the payload to determine the user's identity and permissions, and decides whether to allow the execution of the request.
+
+## 2. Token Expiration
+### 2.1. Browser Token Interaction Logic
+1. The user opens the browser, enters the username and password, and clicks login.
+2. The frontend calls the login interface and inputs the account and password to the backend.
+3. After receiving the account and password, the backend verifies them and returns a Token.
+4. The frontend stores the Token in the browser cache, and all subsequent requests must carry this Token.
+5. If the frontend actively clicks logout or closes the page, it should actively call the logout interface and pass the Token to the backend.
+6. After receiving the Token, the backend invalidates it, returns a status code 200, and "logout successful". After receiving the message, the frontend clears the Token in the browser memory, and returns to the login page.
+7. The Token expires (initially set to 24 hours), and the user needs to log in again.
+### 2.3. Token Expiration Refresh Mechanism
+Token expiration has a refresh mechanism that is turned off by default. If turned on, the security of the Token will be higher, and there will be two timestamps.
+
+The first timestamp `refresh_time` is used to determine whether the Token has expired (default 24 hours): after expiration, the refresh interface can be called to obtain a new Token, which can be set to a shorter time, such as 1 hour.
+
+The second timestamp `expire_time` is the forced expiration timestamp (default 24 hours): after expiration, the user must log in again.
+
+### 2.4. Token Expiration Modification
+To facilitate developers to develop on their own, TuGraph provides two ways to modify the expiration time, both of which require admin privileges.
+
+* Set through the interface call. The interfaces involved in modifying the expiration time are `update_token_time` and `get_token_time` for querying the expiration time. For details, please refer to the [REST interface document](../7.client-tools/9.restful-api-legacy.md).
+* Set through startup parameters. When the server-side is started, adding the parameter `-unlimited_token 1` can set the Token to be unlimited. Please refer to the [service running document](../5.installation&running/7.tugraph-running.md) for details.
+## 3. Introduction to Token-Related Requests Sent by Clients
+The client handles two types of protocol-related requests: REST and RPC.
+
+### 3.1. REST
+If the client uses the REST protocol (including the browser), because it is a short connection, Token needs to be carried in every request, and a new Token needs to be obtained after it expires.
+
+For self-developed clients, if the REST protocol is used, Token logic needs to be considered.
+
+### 3.2. RPC
+If the client uses the RPC protocol (including the official C++/Java/Python), it uses a long connection to maintain, and no Token operation is involved after login.
+
+## 4. Token upper limit
+The upper limit of Token refers to the maximum number of Tokens that a user can own at the same time. To prevent unlimited logins, the upper limit of Token is 10000 by default. Since the token generation logic is strongly related to time, a token will be generated for storage every time you log in. The validity period of the token is 24 hours by default. Therefore, it is recommended to log out the unused token in time after login.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..139d4abcf8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,32 @@
+# Forgot Admin Password
+> TuGraph provides a password reset feature. If you forget the password for the admin account, you can reset it by following these steps.
+
+## 1. Reset Password
+Firstly, the TuGraph server needs to be stopped. If it is deployed within a container, you will need to enter the container and execute the following command:
+
+```bash
+lgraph_server -c /usr/local/etc/lgraph.json -d stop
+```
+
+When starting the TuGraph server again, add the following parameter:
+
+```bash
+--reset_admin_password 1
+```
+
+Here is an example:
+```bash
+lgraph_server -c /usr/local/etc/lgraph.json --reset_admin_password 1 --log_dir ""
+```
+
+This operation will reset the password for the admin account to the default password: 73@TuGraph when starting the TuGraph server.
+If the password reset is successful, you will receive the message "Reset admin password successfully" and the current server process will be closed.
+
+## 2.Restart the Service
+
+You need to restart the server in normal mode and then use the default account and password to log in. After logging in, you can reset the password to continue using TuGraph.
+The command to restart the TuGraph service is as follows:
+
+```bash
+lgraph_server -c /usr/local/etc/lgraph.json -d start
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..6695299a7d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/4.monitoring.md
@@ -0,0 +1,1019 @@
+# Monitoring
+
+> This document mainly introduces the visualization operation and maintenance monitoring of TuGraph.
+
+## 1.Design Concept
+
+Visualization monitoring is not an indispensable part of TuGraph itself. Therefore, in the design, visualization monitoring is regarded as an application in the peripheral ecology of TuGraph to reduce the coupling with TuGraph database and its own impact. TuGraph visualization monitoring adopts the hottest open source solution - TuGraph Monitor + Prometheus + Grafana. Wherein, TuGraph Monitor is the client of TuGraph service, which initiates Procedure requests to TuGraph service through TCP connection. After receiving the request, TuGraph service collects statistics of CPU, memory, disk, IO, and number of requests on its own machine and responds. TuGraph Monitor packages the index data received from TuGraph into the format required by Prometheus and saves it in memory, waiting for Prometheus to obtain it through HTTP request. Prometheus regularly obtains packaged request data from TuGraph Monitor through HTTP requests and saves it in its own time-series database according to the time obtained. Grafana can obtain the statistical data within a certain time period from Prometheus according to user configuration and draw easy-to-understand graphics on the web interface to display the final result. In the entire request chain, the active acquisition, i.e. pull model, is used, which has the advantages of minimizing the coupling between data producers and data consumers, making development simpler, and not requiring data producers to consider the data processing capability of data consumers. Even if the data processing ability of a consumer is weak, it will not be crushed by the data producer producing data too fast. One of the shortcomings of the active pulling model is that the real-time performance of the data is insufficient. However, in this scenario, data does not have high real-time requirements.
+
+### 1.1.TuGraph
+
+TuGraph database provides the ability to collect multiple data information, such as disk, memory, network IO, and query requests, in the service machine, and provides queries through standard Procedure methods. This action of collecting data only occurs when a user queries through the interface, avoiding the impact of TuGraph monitoring service on user business query requests when users do not need the indicators on TuGraph monitoring service machine.
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor is a tool in the peripheral ecology of TuGraph. It communicates with TuGraph through C++ RPC Client as one of the many users of TuGraph and queries the performance indicators of the machine where TuGraph service is located through the Procedure query interface. It packages the results returned by TuGraph into the data model required by Prometheus and waits for Prometheus to obtain them. Users can set the query time interval to minimize the impact of obtaining monitoring indicators on business queries.
+
+### 1.3.Prometheus
+
+Prometheus is an open-source monitoring platform with a dedicated time-series database. It regularly obtains statistical indicators from the TuGraph Monitor service through HTTP requests and saves them in its own time-series database. For details, please refer to the official website:[https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana is an open-source visualization and analysis software. It can obtain data from multiple data sources, including Prometheus, and can convert data in the time-series database into tools for beautiful graphics and visual effects. For specific information, please refer to the official website:[https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.Deployment Solution
+
+### 2.1.Step 1
+
+Start the TuGraph service. For details, please refer to the documentation:[https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.Step 2
+
+Start the TuGraph Monitor tool. The startup command is as follows:
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+The meanings of the parameters are as follows:
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.Step Three
+
++ Download the Prometheus tarball that matches your machine architecture and system version. Download link:[https://prometheus.io/download/](https://prometheus.io/download/)
+
++ Unzip the tarball with the following command:
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ Modify the configuration file prometheus.yml and add the following configuration to enable Prometheus to scrape performance data packaged by TuGraph Monitor.
+
+```
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ Start Prometheus. You can obtain specific startup parameters with the following command:
+
+```shell
+./prometheus -h
+```
+
++ Verify if the Prometheus service is running properly by logging into the Prometheus service through the web portal, and querying whether the monitoring index resources_report has been obtained. If the data can be successfully queried, the operation is successful.
+
+### 2.4.Step Four
+
++ Download the Grafana installation package that matches your machine architecture and system version. Download link:[https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ Install Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Start Grafana. For details, refer to:[ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ Configure Grafana. First, configure the IP address of Prometheus in the data source settings. After the configuration is completed, verify if the data source is connected successfully by testing the connection function. Then, import the following template and modify the correct interface IP and port in the page according to the actual situation. Finally, set the refresh time and monitoring time range according to the actual situation.
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana",
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{label_name}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "memory",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \n  QPS exceeds 1000",
+        "name": "Request statistics alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "Request statistics",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__",
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "disk",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] \nCPU usage rate exceeds 90%",
+        "name": "CPU usage rate alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU usage rate",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "[Production Graph Database Grafana] Disk IO exceeds 10MB/S",
+        "name": "Disk IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus",
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus",
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{{type}}",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph Monitoring Web",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+Verify the effect by refreshing the browser page. If the pie chart and line chart are displayed correctly, the configuration is completed.
+
+## 3.Future Plans
+
+Currently, visual monitoring only supports single-machine monitoring and can monitor performance indicators such as CPU, disk, network IO, and request QPS of the machine on which the service is located. In the future, monitoring for HA clusters will be implemented, and more meaningful indicators will be included in the monitoring scope.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/5.log.md
new file mode 100644
index 0000000000..caca9a40f7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# Log
+
+> This document mainly introduces the logging function of TuGraph.
+
+## 1.Introduction
+
+TuGraph keeps two types of logs: server logs and audit logs. Server logs record human-readable server status information, while audit logs maintain encrypted information for every operation performed on the server.
+
+## 2.Server log
+
+### 2.1.Server Log Configuration Items
+The output directory of server logs can be specified through the `log_dir` configuration item. The level of log can be specified through the `verbose` configuration item.
+
+The `log_dir` configuration item is empty by default. If `log_dir` configuration item is empty, then all logs will be write to the console(nothing will be written to the console if the `log_dir` configuration item is empty under daemon mode); if `log_dir` configuration item is configured specifically, log files will bew generated under that path. The maximum size of a single log file is 256MB.
+
+The `verbose` configuration item controls the level of log, and is divided into three levels of `0, 1, 2`. Ther verbosity of log record grows as the number grows. The default level is `1`. When the level is set to `2`, the server will print logs in `DEBUG` level and above. When the level is set to `1`, the server will print logs in `INFO` level and above. When the level is set to `0`, the server will print log in `ERROR` level and above.
+
+### 2.2.Example of Server Log Output Macro Usage
+
+If the developer wants to add logs to the code during development, they can refer to the following example:
+
+```
+#include "tools/lgraph_log.h" // add log dependency.
+
+void LogExample() {
+    // The log module has been initialized during the database startup, and developers can directly call the macro.
+    // The log level is divided into five levels: DEBUG, INFO, WARNING, ERROR, and FATAL.
+
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+
+You can also refer to the log macro usage in test/test_lgraph_log.cpp.
+
+### 2.3.Procedure log
+
+Developers can use the log function to output debug information that they need to the log for looking up and assisting development during the development of procedures. Debug information will be output to the same log file as the server log (if `log_dir` configuration item is not specified, it will also be output to the console)
+
+#### 2.3.1.Cpp procedure
+Please use the log macro provided in 2.2 to output debug information, and avoid using output methods such as cout or printf. For specific usage, please refer to the following sample code (see `procedures/demo/log_demo.cpp` for details)
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+After inserting the above sample code into the database as a procedure and running it, you can see the corresponding log entries in the log file.
+
+#### 2.3.1.python procedure
+Please use Python's built-in print to output debug information. The debug information will be merged into a WARN-level log entry and output to the log file after the procedure is executed.
+
+## 3.Audit log
+
+Audit logs record each request and response, as well as the user who sent the request and when the request received. Audit logging can only be turned on or off. The results can be queried using the TuGraph visualization tool and the REST API.
+
+To enable the Audit Log, you need to set the `enable_audit_log` parameter to `true` in the configuration file. For the configuration file and parameter descriptions, see:[Tugraph Running/Service configuration](../../5.installation&running/7.tugraph-running.md)
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/index.rst
new file mode 100644
index 0000000000..4dc0c67422
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Privilege And Operations
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..2cdb8d3f31
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# Unit Testing
+
+> This document is the unit testing documentation for TuGraph.
+
+## 1.Introduction
+
+TuGraph unit testing uses the gtest framework, which can choose to run all tests at once or specify certain tests.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..b98cf7f62a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/11.quality/2.integration-testing.md
@@ -0,0 +1,400 @@
+# Integration Testing
+
+> This document mainly introduces how to use the TuGraph integration testing framework.
+
+## 1.The Significance of TuGraph Integration Testing
+
+In unit tests and function tests, some test cases directly use Galaxy or Statemachine to perform tests, which is not a complete process. In the complete CS architecture, user requests are sent to the server through the client, and network communication is essential. To avoid bugs caused by incomplete unit testing, TuGraph uses an integration testing framework to perform end-to-end testing.
+
+## 2.TuGraph Integration Testing Framework
+
+TuGraph uses the Pytest framework as its integration testing framework. Pytest is currently the most widely used CS-side integration testing framework. It is known for its flexibility, ease of use, and the ability to support parameterization. Based on the functionality provided by Pytest, TuGraph abstracts different tools and controls the processing logic of each tool through parameters to facilitate efficient testing code development.
+
+For more information on Pytest, please refer to the official website: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.Component Description
+
+| Component Name    |Component Function      | Implementation Method                              |
+| --------------- | -------------------------- | ------------------------------------------------ |
+| server          | TuGraph standalone service | Start a child process and launch the service       |
+| client          | TuGraph Rpc Client         | Open TuGraph Python Rpc Client in the current process and send requests  |
+| importor        | TuGraph Importor           | Start a child process to process import requests               |
+| exportor        | TuGraph Exportor           | Start a child process to process export requests               |
+| backup_binlog   | TuGraph Backup Binlog      | Start a child process to process binlog backup requests       |
+| backup_copy_dir | TuGraph Backup             | Start a child process to process full db backup requests       |
+| build_so        | Component for compiling C++ dynamic libraries    | Start a child process to handle GCC compilation logic            |
+| copy_snapshot   | TuGraph Copy Snapshot      | Handle backup snapshot requests in the current process                 |
+| copydir         | Folder copy                 | Handle folder copy requests in the current process                     |
+| exec            | Execute C++/Java executable files     | Start a child process to launch the C++ executable file  |
+| algo            | Execute algorithm                   | Start a child process to run the algorithm     |
+| bash            | Execute bash commands               | Start a child process to execute bash commands      |
+| rest            | TuGraph Python Rest Client | Open TuGraph Python Rest Client in the current process and send requests|
+
+### 2.2.Component Usage
+
+#### 2.2.1.server
+
+##### 2.2.1.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The server will be started before the function starts executing, and the server will be stopped and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ host is the IP and port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to the user in the TuGraph Server
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.Startup Command
+Import the tool through the fixtures component and control different processing logic through startup parameters. The client will be started before the function starts executing, and the client will be stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.Startup Command
+
+Import the tool through the fixtures component and control the import of different data through startup parameters. The data will be imported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.Startup Command
+
+Import the tool through the fixtures component and control the export of different data through startup parameters. The data will be exported to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.Startup Parameters
+采用python字典传入
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different binlogs through startup parameters. The binlogs will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ cleanup_dir is the directory that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.Startup Command
+
+Import the tool through the fixtures component and control the backup of different databases through startup parameters. The database will be copied to the specified directory before the function starts executing, and the directories specified in cleanup_dir will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command, passed in as a Python list, and multiple so can be compiled at once
++ so_name is the dynamic library that needs to be cleaned up after execution, which can be multiple, passed in as a Python list
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.Startup Command
+
+Import the tool through the fixtures component and control the compilation of different dynamic libraries through startup parameters. The dynamic libraries will be generated to the specified directory before the function starts executing, and the dynamic libraries specified in the so_name list will be cleaned up after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original database
++ dst is the snapshot copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.Startup Command
+Import the tool through the fixtures component and control the copying of different snapshots through startup parameters. The snapshot in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ src is the original directory
++ dst is the directory copied after the backup
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.Startup Command
+Import the tool through the fixtures component and control the copying of different directories through startup parameters. The directory in src will be copied to the directory specified in dst before the function starts executing.
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.Startup Command
+Import the tool through the fixtures component and control the execution of different logic through startup parameters. A child process will be started to execute the command passed in through the cmd parameter before the function starts executing.
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
++ result is the expected execution result of the algorithm. After execution is completed, the actual result will be compared with the expected result. If they are different, the test will fail.
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.Startup Command
+Import the tool through the fixtures component and control the execution of different algorithm logic through startup parameters. A child process will be started to execute the algorithm passed in through the cmd parameter before the function starts executing. The function body will wait for the algorithm to complete and compare the result with the expected result.
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ cmd is the startup command
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.Startup Command
+
+Import the tool through the fixtures component and control the execution of different bash commands through startup parameters. A child process will be started to execute the bash command passed in through the cmd parameter before the function starts executing. The function body will wait for the command to complete.
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.Startup Parameters
+Use a Python dictionary to pass in the parameters:
++ port is the port of the TuGraph Server
++ user is the username of the TuGraph Server
++ password is the password corresponding to user in TuGraph Server
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.Startup Command
+
+Import the tool through the fixtures component and link to different TuGraph Rest Servers through startup parameters. The client will be started before the function starts executing and stopped after the function finishes executing.
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.Test Cases
+
+#### 2.3.1.rest
+
+In the sample code, before the test_get_info function is executed, the server is started, and a rest client is started after the server is started. After entering the test_get_info function, some information about the server is obtained, and assert is used to determine whether cpu information is obtained.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+In the sample code, before the test_flushdb function is executed, the offline data import logic is executed and the server is started. After creating a connection through the client, the function enters the test_flushdb function. The number of points is queried to determine whether the import is successful. After the import is successful, the flushDB operation is executed. assert is used again to determine whether the db can be emptied normally.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+In the sample code, before the test_export_default function is executed, the offline data import logic is executed. After the import is successful, the data of the current db is exported. Then, the offline import logic is used again to import the exported data into a new directory. The newly imported data is used to start the db and create a connection. In the body of the test_export_default function, it is determined whether the data after export and import is consistent with the original data.
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.Other Tests
+For more test cases, please refer to the integration test code [https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-db/tugraph-db/tree/master/test/integration)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/11.quality/index.rst
new file mode 100644
index 0000000000..f3b6e0e061
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Quality
+==============================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..bf465539f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,93 @@
+# TuGraph Contribution Guide
+
+## 1. Preface
+
+Thank you for your contribution to TuGraph. We sincerely hope that more students from the community will join in and build a better graph database project together.
+
+For outstanding community contributors, we will award the TuGraph Outstanding Community Contributor Certificate.
+
+## 2. What to contribute
+
+We welcome any contribution at any time, whether it's a simple typo fix, bug fix, or new feature addition. Feel free to ask questions or initiate PRs. We also value documentation and integration with other open source projects, and welcome contributions in this regard. For any modification, especially the more complex modification, it is recommended to create an issue and fill it out according to the BUG or PR template.
+
+## 3. Preparation
+
+## 3.1. Knowing TuGraph
+
+You can get start with TuGraph follow instrcutions in [Guide Doc](../1.guide.md).
+
+## 3.2. Environment
+
+For document contributions, you can directly modify and submit a pull request by clicking on "Edit on GitHub" in the upper right corner of the [documentation](https://tugraph-db.readthedocs.io/en/latest).
+
+For code contributions, it is usually necessary to set up the environment for compilation and execution. You can deploy using [Docker](../5.installation&running/3.docker-deployment.md) or [local package deployment](../5.installation&running/4.local-package-deployment.md).
+
+## 3.3. License Agreement
+
+Before contributing code, please take some time to understand the process of contributing code to TuGraph, and read the [Contributor License Agreement](3.individual-cla.md) or [Corporate Contributor License Agreement](4.corporate-cla.md). Participating in the contribution is deemed to agree to the above agreement.
+
+## 4. Contribute code process
+
+### 4.1. Submit the issue
+
+Whether you are fixing a bug in TuGraph or adding a new feature to TuGraph, before you submit the code, submit an issue on TuGraph's GitHub, describing the problem you want to fix or the function you want to add. There are several advantages to doing this:
+
+- There will be no duplication of work in conflict with other developers or their plans for the project.
+- TuGraph maintainers will discuss the bugs or new features you mentioned to determine whether the modification is necessary, whether there is room for improvement or a better way.
+- After reaching an agreement, develop and submit the code, reducing the cost of communication between the two parties and reducing the rejection of pull requests.
+
+### 4.2. Pull the branch
+
+All modifications of TuGraph are made on branches. After modification, the pull request is submitted and merged into the Master by the project maintenance personnel after Code Review. Therefore, after the source code steps are described, you need:
+
+1. Download the code to a local directory. In this step, you can choose git or https. In recent years, github has stricter permission requirements. The git approach, for example, requires the more complex ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)). https authentication cannot be performed using the user name and password. git clone https://github.com/ Your account name /tugraph-db
+2. Pull branch ready to modify code:
+   git branch add_xxx_feature
+3. After executing the above command, your code repository switches to the appropriate branch. Run the following command to view your current branch: git branch -a
+4. If you want to switch back to Master, run the git checkout -b master command
+5. If you want to switch back to branching, run the following command: git checkout -b "branchName"
+
+### 4.3. Configuring Github Information
+
+Run git config --list on your machine to view git's global username and mailbox. Check whether the displayed user.name and user.email match your github user name and email address.
+
+If a company has its own gitlab in-house or uses other commercial GitLabs, a mismatch may occur. At this point, you need to set up a separate user name and mailbox for the tugraph-db project. For details about how to set the user name and email address, see github's official documentation.
+
+### 4.4. Compile and Run
+
+The process of compile and run can reference [ci script](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. Change the code and submit it locally
+
+Once you've pulled the branch, you're ready to change the code.
+
+**Code modification Notes**
+
+Code style consistency: TuGraph uses cpplint to keep code in the same format, and IDE can use.clang to configure the style. Be sure to check the code style locally before submitting it, or ACI will report an error.
+
+Add unit test code: New changes should pass through existing unit tests. New unit tests should be provided to prove that there are bugs in the previous code and that the new code has resolved these bugs. You can run all tests with the following command:./unit_test
+It can also be run with the help of an IDE.
+
+**Other precautions**
+
+Please keep the code you are editing in the original style, especially the space feed, etc. For unnecessary comments, delete them directly. Add comments where logic and functionality are not easily understood. Keep documentation up to date. After modifying the code, run the following command to submit all the changes to the local computer:
+git commit -am '(feat) Add the xx function 'git commit -am '(fix) fix xx problem' '
+
+Submit the code to the remote repository
+After the code is committed locally, you can then synchronize the code with the remote repository. Run the following command to submit local changes to github: git push origin "branchname"
+
+If you were forking earlier, the origin here is pushed to your code repository, not TuGraph's.
+
+After the code has been submitted to GitHub, you can send a request to merge your changes into the TuGraph Master. At this point, you need to go to your corresponding repository on GitHub and press the pull request button in the upper right corner. Select the target branch, which is usually the master, and the system will notify the TuGraph staff, who will Review your code, and when it meets the requirements, it will join the main branch and become part of TuGraph.
+
+Please note that the CI will be automatically checked, as well as all Commits signing the cla, with green signs on the commits.
+
+### 4.6. Code Review
+
+After you submit your code, your code will be assigned to a maintainer for Review. Please wait patiently. If no one has responded to your submission after two working days, you can leave a message under PR and @ the corresponding person.
+
+Comments on code Review will be directly noted to the corresponding PR or Issue. If you find the suggestions reasonable, please update them to your code.
+
+### 4.7. Merge code into Master
+
+After the code Review is approved, the TuGraph maintainer will put it into the Master. During this process, the maintainer may specify a new Reviewer and put forward new comments that need to be revised. Normally this step is omitted, and after the code is merged, you will receive an indication that the merge was successful.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..27cff88ae8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,72 @@
+# TuGraph community roles
+
+## 1. Preface
+
+This document describes the roles of membership in the TuGraph community, the requirements and permissions for each role.
+
+## 2. Role summary
+
+This is the division of roles in the TuGraph community, describing the responsibilities of each role, the requirements to become and remain a role, and the permissions of the corresponding role.
+
+Our community is divided into three roles based on the Apache specification:
+
+- Contributor
+- Maintainer
+- PMC
+
+The requirements, responsibilities, and authorities for each role are described below.
+
+## 3. Contributor
+
+### 3.1. requirements
+
+Successfully submit a PR and merge in any of TuGraph's official projects.
+
+### 3.2. responsibility
+
+- Actively respond to issues or PR assigned to you
+- Help reply the issue/pr together and assign the issue to the person in charge of the corresponding module
+
+### 3.3. permissions
+
+- Join the TuGraph GitHub organization and become a member of the TuGraph open source community.
+
+## 4 Maintainer
+
+### 4.1. requirements
+
+The new Committer is recommended by the existing PMC and approved by 2/3 of the votes. The Commiter meets at least one of the following conditions:
+
+- Been a community member for more than three months
+- More than 10 PR for PMC approve
+- Complete major functions
+- Fixed serious bugs
+- Follow project development and participate in community discussion
+
+### 4.2. responsibility
+
+- Community counseling support
+- Actively respond to issues or PR assigned to you
+- The right to vote on major community decisions
+- Review community PR
+
+### 4.4. permissions
+
+- Pull Request review permission
+
+## 5. PMC
+
+### 5.1. requirements
+
+- Not open at the moment, if you have a strong desire please contact PMC
+
+### 5.2. responsibility
+
+- Actively participate in community discussions and give guidance to major community decisions
+- Responsible for ensuring that the community activities of open source projects are running smoothly
+
+### 5.3. permissions
+
+- Pull Request review permission
+- Pull Request approve permission
+- Community role member management
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..4798fc9db4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# Individual Contributor License Agreement
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..5ff3ff31e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# Corporate Contributor License Agreement
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..40b9d098f0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,73 @@
+# TuGraph Roadmap
+
+## 1. Introduction
+
+This document outlines the future development plans for TuGraph, including features currently under development, those
+not in the development pipeline, and completed functionalities not included in the open-source version.
+
+TuGraph aims to be an open-source, high-performance graph database. It adopts a centralized storage approach for graph
+data and, in the short term, does not consider data sharding. Instead, it employs a master-slave replication mode to
+address high-concurrency read scenarios, while utilizing cloud-based storage solutions to address storage capacity
+challenges.
+
+## 2. Completed Functionalities
+
+TuGraph was open-sourced on September 1, 2022, and has received regular bug fixes and enhancements based on community
+feedback.
+
+| Version | Functionality                                                                                 | Date       |
+|---------|-----------------------------------------------------------------------------------------------|------------|
+| 3.3.0   | Initial open-source release                                                                   | 2022.9.1   |
+| 3.3.1   | Refactored graph analysis engine with multi-mode support                                      | 2022.10.14 |
+| 3.3.2   | Added OGM support and improved unit test coverage                                             | 2022.11.21 |
+| 3.3.3   | Iterative improvements to link authentication mechanism and addition of English documentation | 2022.12.23 |
+| 3.3.4   | Cloud deployment support and streamlined LDBC SNB Audit process                               | 2023.1.28  |
+| 3.4.0   | Added support for OLAP Python API and upgraded offline data import                            | 2023.3.11  |
+| 3.5.0   | Introduced POG (Procedures On Graph query language), frontend upgrades                        | 2023.6.5   |
+| 3.5.1   | Added learning engine, Procedure Rust API, and storage-property separation                    | 2023.7.14  |
+| 3.6.0   | High availability support, log system upgrade                                                 | 2023.8.11  |
+| 4.0.0   | ISO GQL support, 11 new open-source graph algorithms, m1 Docker support                       | 2023.9.6   |
+| 4.0.1   | Support for temporal edge sorting, 5 new open-source graph algorithms                         | 2023.9.28  |
+| 4.1.0   | Bolt protocol support, fast online full import, support for geospatial data types             | 2023.12.25 |
+
+In addition, TuGraph has established a comprehensive quality system, including automated unit testing, integration
+testing, and performance testing.
+
+For more detailed information, refer to the "[root]/release/CHANGELOG.md" file in the source code directory.
+
+## 3. Functional Updates in 2024
+
+In addition to the aforementioned core functionalities, the following components are planned for development in 2024.
+
+| Version | 	Functionality                                                | 	Planned Date |
+|---------|---------------------------------------------------------------|---------------|
+| 4.2.x   | 	HA support for Witness role and management tools             | 	2024.3       |
+| 4.2.x   | 	Bolt support for stream processing and parameterized queries | 	2024.3       |
+| x.x.x   | 	GeaX support for Cypher                                      | 	2024.6       |
+| x.x.x   | 	Support for composite indexes                                | 	2024.6       |
+| x.x.x   | 	Optimization of data import functionality                    | 	2024.6       |
+| x.x.x   | 	[Community Feature] Support for geospatial data types        | 	2024.6       |
+| x.x.x   | 	Enhanced Cypher capabilities                                 | 	2024.9       |
+| x.x.x   | 	Support for rapid schema changes                             | 	2024.9       |
+| x.x.x   | 	Vectorization support                                        | 	2024.12      |
+| x.x.x   | 	RPQ support                                                  | 	2024.12      |
+| x.x.x   | 	[Optional] Query engine upgrade                              | 	2024.12      |
+| x.x.x   | 	[Community Feature] Support for GraphAr                      | 	2024.12      |
+
+## 4. Community Collaboration Features
+
+Currently, the development team's resources are limited, and we cannot implement all the desired features for TuGraph.
+However, during the feature planning process, we have identified a range of ideas worth exploring. The team has
+conducted some initial exploration, and we welcome community collaboration in developing the following features:
+
+| Version	 | Functionality	                                                | Planned Date |
+|----------|---------------------------------------------------------------|--------------|
+| x.x.x    | Rich graph algorithm library	                                 | 2024.x       |
+| x.x.x    | Support for default attribute values	                         | 2024.x       |
+| x.x.x    | Best practice of embedded TuGraph-DB usage                    | 2024.x       |
+| x.x.x    | Support for transaction in Bolt clients	                      | 2024.x       |
+| x.x.x    | Support for composite data types like List, Map, and Decimal	 | 2024.x       |
+| x.x.x    | Support of multiple storage engine	                           | 2024.x       |
+
+For simpler features, we will label them as "good first issue" on GitHub issues, and we welcome discussions from
+technology enthusiasts interested in graph databases.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..07fee7bd7a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Contributor Manual
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..baef5017a6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# Importing Data from Relational Databases to TuGraph
+
+> Using [DataX](../6.utility-tools/7.tugraph-datax.md)，to be completed.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..c7b094b1b7
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,217 @@
+# Using TuGraph Graph Learning Module for Node Classification
+
+## 1. Introduction
+GNN is a powerful tool for many machine learning tasks on graphs. In this introductory tutorial, you will learn the basic workflow of using GNN for node classification, i.e., predicting the category of nodes in a graph.
+
+This document will show how to build a GNN for semi-supervised node classification on the Cora dataset with only a few labels, which is a citation network with papers as nodes and citations as edges. The task is to predict the category of a given paper.
+By completing this tutorial, you will be able to:
+
+Load the Cora dataset.
+
+Sample and build a GNN model using the sampling operator provided by TuGraph.
+Train the GNN model for node classification on CPU or GPU.
+
+This document requires some experience in using graph neural networks and DGL.
+
+## 2. Prerequisites
+The TuGraph graph learning module requires TuGraph-db version 3.5.1 or above.
+
+It is recommended to use Docker image tugraph-compile 1.2.4 or above for TuGraph deployment:
+
+tugraph/tugraph-compile-ubuntu18.04:latest
+
+tugraph/tugraph-compile-centos7:latest
+
+tugraph/tugraph-compile-centos8:latest
+
+The above images can be obtained on DockerHub.
+Please refer to [Quick Start](../3.quick-start/1.preparation.md) for specific operations.
+
+## 3. Import Cora Dataset to TuGraph Database
+### 3.1. Introduction to Cora Dataset
+The Cora dataset consists of 2708 papers, classified into 7 categories. Each paper is represented by a 1433-dimensional bag-of-words feature, indicating whether a certain word appears in the paper. These bag-of-words features have been preprocessed to be normalized to a range from 0 to 1. The edges represent citation relationships between papers.
+
+TuGraph has provided the Cora dataset import tool, which users can use directly.
+
+### 3.2. Data Import
+The Cora dataset is located in the test/integration/data/algo directory and contains the cora_vertices point set and the cora_edge edge set.
+
+First, the Cora dataset needs to be imported into the TuGraph database. Please refer to [Data Import](../6.utility-tools/1.data-import.md).
+
+In the build/output section below the line:
+``` bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+The number of commands related to the relevant document is to be built/output.
+
+Execute the following command in the build/output directory:
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Here, cora.conf is the graph schema file representing the format of graph data, which can be found in test/integration/data/algo/cora.conf. coradb is the name of the graph data file after import, which represents the storage location of graph data.
+
+## 4. Feature Conversion
+Since the features in the Cora dataset are float arrays of length 1433, which are not supported by TuGraph for loading, they can be imported as strings and converted to char* for easier access later. The implementation can be referred to the feature_float.cpp file.
+The specific execution process is as follows:
+
+Compile the import plugin in the build directory.(Can be skipped if TuGraph has been compiled):
+`make feature_float_embed`
+
+Execute the following command in the build/output directory to perform the conversion:
+`./algo/feature_float_embed ./coradb`
+
+## 5. Compile Sampling Operator
+The sampling operator is used to obtain graph data from the database and convert it into the required data structure. The specific execution process is as follows:
+Can be skipped if TuGraph has been compiled.
+Execute the following command in the tugraph-db/build directory:
+`make -j2`
+
+or execute the following command in the tugraph-db/learn/procedures directory:
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *
+import importlib
+getdb = importlib.import_module("getdb")
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+As shown in the code, after obtaining the algorithm .so file, import and use it.
+
+## 6. Model training and saving
+TuGraph calls the operators of the cython layer in the python layer to realize the training of the graph learning model.
+The usage of the TuGraph graph learning module is introduced as follows:
+Execute under the build/output folder
+`python3 train_full_cora.py --model_save_path ./cora_model`
+You can start training.
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+The detailed training process is as follows:
+### 6.1. Data Loading
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+As shown in the code, load the data into memory based on the path of the graph data, username, password, and subgraph name. TuGraph can load multiple subgraphs for graph training, but we only load one subgraph here.
+
+### 6.2. Build Sampler
+During the training process, the GetDB operator is first used to obtain the graph data from the database and convert it into the required data structure. The specific code is as follows:
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+As shown in the code, the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and their stored information is as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Then a sampler is constructed:
+```python
+batch_size = 5
+count = 2708
+sampler = TugraphSample(args)
+dataloader = dgl.dataloading.DataLoader(fake_g,
+    torch.arange(count),
+    sampler,
+    batch_size=batch_size,
+    num_workers=0,
+    )
+```
+
+### 6.3. Convert the results to the required format
+```python
+src = EdgeInfo[0].astype('int64')
+dst = EdgeInfo[1].astype('int64')
+nodes_idx = NodeInfo[0].astype('int64')
+remap(src, dst, nodes_idx)
+features = NodeInfo[1].astype('float32')
+labels = NodeInfo[2].astype('int64')
+g = dgl.graph((src, dst))
+g.ndata['feat'] = torch.tensor(features)
+g.ndata['label'] = torch.tensor(labels)
+return g
+```
+The results are converted to the required format to fit the training format.
+
+### 6.4. Build the GCN model
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+def build_model():
+    in_size = feature_len  # feature_len is the length of features, which is 1433 here
+    out_size = classes  # classes is the number of classes, which is 7 here
+    model = GCN(in_size, 16, out_size)  # 16 is the size of the hidden layer
+    return model
+```
+In this tutorial, a two-layer Graph Convolutional Network (GCN) will be built. Each layer aggregates neighbor information to compute new node representations.
+
+### 6.5. Train the GCN model
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #If you need to save the model, give the model save path
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+As shown in the code, iterative training is performed 50 times according to the defined sampler, optimizer and model, and the trained model is saved to the path model_save_path.
+
+The output is as follows:
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+The graph learning module can be accelerated by using a GPU. If users want to run it on the GPU, they need to install the corresponding GPU driver and environment. For details, please refer to learn/README.md.
+
+The complete code can be found in learn/examples/train_full_cora.py.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..f769293858
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# Data Migration
+
+## 1 Introduction
+Data migration refers to the process of moving data from one system, storage medium, or application to another system, storage medium, or application. When TuGraph needs to be upgraded or the system hardware environment changes,
+The data in the original TuGraph service needs to be migrated. Based on the system hardware environment and software version, this paper divides data migration into three schemes:
+1. Compatible migration: When the system environment before and after the migration is consistent and the TuGraph software is compatible, you can directly use the backup and recovery method to migrate data;
+2. Upgrade and migration: When the system environment before and after the migration is inconsistent or the TuGraph software is not compatible, it is necessary to migrate the data by first exporting the data and then re-importing;
+3. Online migration: When data migration is performed on a high-availability cluster and the network environment of the cluster is good, the original cluster can be smoothly switched to the new cluster by adding or deleting nodes.
+The following article will introduce these three schemes in detail.
+
+## 2. Compatible Migration
+Compatible migration means that when the system environment remains unchanged and the TuGraph software version is compatible, the data and stored procedures of the original service can be used in the new service, so it can be directly migrated.
+Users can first use the `lgraph_backup` tool to back up the data, then transfer the data to a new machine and restart the service. The specific migration steps are as follows:
+
+### 2.1. Backup data
+Backup data using `lgraph_backup` tool
+```bash
+   lgraph_backup -s db -d db.bck
+```
+You can also directly use the `cp` command in this step, but the `cp` command will copy some redundant metadata, and the raft metadata will also be copied in the HA mode, causing the cluster to fail to restart after migration.
+Therefore, it is recommended to use the `lgraph_backup` tool instead of the `cp` command during data migration.
+
+### 2.2. Start a new service
+Use the following command to start the new service, and the stored procedure will be automatically loaded into the new service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. Stop the original service
+Use the following command to stop the original service
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. Upgrade migration
+When the user wants to migrate the original service to a differentiated environment (such as migrating from centos7 to ubuntu18.04), or when the version of TuGraph changes greatly and is incompatible (such as 3.4.0 and 3.6.0),
+Users can first use the `lgraph_export` tool to export the data into a file, transfer it to a new machine, and then use the `lgraph_import` tool to re-import and restart the cluster.
+This can ensure that it can be used in the new environment, but the efficiency is low, and the stored procedure needs to be reloaded. The specific migration steps are as follows:
+
+### 3.1. Export data
+Use the `lgraph_export` tool to export the data and transfer the data to the new machine
+```bash
+   lgraph_export -d db -e db.export
+```
+
+### 3.2. Import data
+Use the `lgraph_import` tool to import data and manually load the stored procedure (see [client operation steps](../7.client-tools/2.cpp-client.md) for details)
+```bash
+   lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. Start a new service
+Start the new service with the following command
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. Stop the original service
+Use the following command to stop the original service
+```bash
+    lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. Online Migration
+When performing data migration on the server cluster deployed by the high-availability version of TuGraph, if the network bandwidth is sufficient, you can directly migrate the service online by adding or deleting nodes. The specific migration steps are as follows:
+
+### 4.1. Copy data
+Use the following commands to copy the data on the leader node and transfer it to the machine nodes of the new cluster. Since the leader node has the most complete raft log, copying the leader's data can minimize
+The time for the log to catch up.
+```bash
+   cp -r db db.cp
+```
+### 4.2. Starting a new node
+Use the following command to join the new node to the cluster. After joining the cluster, the incremental data will be automatically synchronized to the new node
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. Stop the original node
+Stop the original node service, and send subsequent application requests directly to the new cluster
+```bash
+   lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..62f7a61957
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# Environment and version selection
+
+> This document introduces how to select the system environment and deployment method
+
+## 1 Introduction
+
+TuGraph provides differentiated system environments and deployment methods for users with different needs to meet the needs of different users such as novices, system developers, production operation and maintenance personnel, and researchers.
+
+## 2. Environmental capability selection
+
+Users can choose different environments based on actual usage scenarios. The compilation environment has the most complete capabilities and requires more third-party software. Correspondingly, the streamlined operating environment requires almost no installation of any dependent libraries and can run TuGraph's basic functions except stored procedures.
+
+| Environment                      | Purpose                                     | Remarks                                 |
+|----------------------------------|---------------------------------------------|-----------------------------------------|
+| Compilation environment          | Compile TuGraph from source                 | For developers                          |
+| Running environment              | Run TuGraph installation package            | Applicable to most users                |
+| Simplified operating environment | Run simplified TuGraph installation package | Less dependence on the operating system |
+
+For a detailed introduction to different environments, see [link](../5.installation&running/2.environment-mode.md).
+
+## 3. Deployment method selection
+
+TuGraph deployment only requires one server (high availability mode requires multiple servers), and you can choose a suitable deployment method based on actual resource conditions and usage scenarios.
+
+| Deployment method | Description | Remarks |
+|----------|-----------------------|--------------- -------------------------------------------------- --------------------------|
+| Cloud deployment | Alibaba Cloud Computing Nest one-click deployment, free trial | Suitable for novices, process reference [Link](../5.installation&running/5.cloud-deployment.md) |
+| Docker deployment | Cross-platform deployment through pre-prepared Docker images | Users with hardware requirements, such as performance testing, please refer to [link](../5.developer-manual/1.installation/3.docker-deployment. md) |
+| Local deployment | Tightly coupled deployment in existing systems | Applicable to specified production environment, refer to the process [Link](../5.installation&running/4.local-package-deployment.md) |
+
+## 4. Next steps
+
+After the deployment is completed, you can proceed to [Start Service](../5.installation&running/7.tugraph-running.md) and [Data Import](../5.developer-manual/3. server-tools/1.data-import.md) and other operations, you can also experience the entire process through [Sample Data](../3.quick-start/2.demo/1.movie.md).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/5.spatial.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/5.spatial.md
new file mode 100644
index 0000000000..686dc41e1d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/5.spatial.md
@@ -0,0 +1,186 @@
+# Examples of geospatial data type usage
+
+## 1. Introduction
+
+TuGraph, a graph database jointly developed by Ant Group and Tsinghua University, has built a comprehensive graph technology system that includes graph storage, graph calculation, graph learning, and a graph development platform, owning a leading-scale graph cluster in the industry.  In recent years, geospatial capabilities have demonstrated significant application value in graph databases. They not only enhance the expressive power of data but also facilitate the fusion analysis of cross-domain data, especially displaying strong practical value in critical fields such as social networks, map exploration, and urban planning. TuGraph is also gradually supporting geospatial capabilities.
+
+## 2. Background Knowledge
+
+EPSG([EPSG.io: Coordinate Systems Worldwide](https://epsg.io/)) is a standardized collection of geospatial reference system identifiers, used to identify different geospatial reference systems, including coordinate systems, geographic coordinate systems, projected coordinate systems, etc. We commonly use EPSG codes to represent the coordinate systems of data, and here we introduce two of the most common geospatial coordinate systems, which are also the types supported by most databases.
+
+### 2.1 WGS84 Coordinate System (EPSG:4326)
+
+Global Positioning System: WGS84 is the foundation of the Global Positioning System (GPS), allowing GPS receivers around the world to determine precise positions. Almost all modern GPS devices provide location information based on the WGS84 coordinate system. Map Making and Geographic Information Systems (GIS): In the field of map making and GIS, WGS84 is widely used to define positions on Earth. This includes various types of map creation, spatial data analysis, and management, etc. ![image.png](../../../images/spatail/EPSG_4326.png)
+
+### 2.2 Cartesian Coordinate System (EPSG:7203)
+
+The Cartesian coordinate system, also known as the rectilinear or orthogonal coordinate system, is the most basic and widely applied coordinate system. It defines a plane with two axes and a space with three axes that are perpendicular to each other, extensively applied in mathematics, physics, engineering, astronomy, and many other fields. ![image.png](../../../images/spatail/EPSG_7203.png)
+
+### 2.3 Data Storage Formats
+
+OGC (Open Geospatial Consortium) has defined standard representation formats for spatial data, namely WKT and WKB formats, for exchanging and storing spatial data between different systems and platforms, which have now been widely adopted. WKT (Well-Known Text) format is a text markup language that is easy to read and write for humans, while WKB (Well-Known Binary) format uses a series of bytes to encode spatial data, which is more suitable for storage in computers.
+
+**WKT:**
+
+```
+POINT(<x> <y>)
+LINESTRING(<x1> <y1>, <x2><y2>, ...)
+```
+
+The WKT format data is as shown above, first specifying the spatial data type, then specifying the coordinates in parentheses, with a pair of coordinates representing a point, separated by commas between each coordinate pair. For Polygon type data, the first coordinate pair needs to be the same as the last coordinate pair to form a closed surface.
+
+**WKB:**
+
+![image.png](../../../images/spatail/WKB.png)
+
+
+The encoding for the EWKB format is explained as follows:
+
+- Positions 0 - 1: Encoding method;
+- Positions 2 - 5: Spatial data type;
+    - 0100: point
+    - 0200: linestring
+    - 0300: polygon
+- Positions 6 - 9: Data dimension;
+    - 0020: two-dimensional
+    - 0030: three-dimensional
+- Positions 10 - 17: EPSG code of the coordinate system;
+- Positions 18 - n: 16-bit hex representation of pairs of double-type coordinates.
+
+### 2.4 Common functions
+
+| Name                 | Description       | Signature                                                                 |
+|----------------------|-------------------|---------------------------------------------------------------------------|
+| `dbms.graph.createGraph` | create a subgraph           | `dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)` |
+| `db.createVertexLabel`  | create a vertex label  | `db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)`      |
+| `db.getLabelSchema`     | get the schema of label  | `db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)` |
+| `db.deleteLabel`        | delete vertex label       | `db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)`         |
+
+更完整详细的函数使用以及插入数据的语句，可以参考 [Cypher API](../8.query/1.cypher.md)
+
+
+## 3. Data Types
+
+Currently, in TuGraph, we support three types of spatial data: Point, Linestring, and Polygon.
+
+- Point: POINT(2.0, 2.0, 7203)
+- Linestring: LINESTRING(0 2,1 1,2 0)
+- Polygon: POLYGON((0 0,0 7,4 2,2 0,0 0))
+
+Coordinates are of double type. Examples for creating graph models and inserting data as follows:
+
+**Create a vertex to mark food locations**
+
+```
+CALL db.createVertexLabel('food', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true) 
+```
+
+![image.png](../../../images/spatail/createVertexLabel.png)
+
+**Insert data to mark food points**
+
+```
+ CREATE (n:food {id:10001, name: 'aco Bell',pointTest:point(3.0,4.0,7203)}) RETURN n
+```
+
+![image.png](../../../images/spatail/createFoodData.png)
+
+**Create a vertex with polyline attributes**
+
+```
+CALL db.createVertexLabel('lineTest', 'id', 'id', int64, false, 'name', string, true,'linestringTest',linestring,true)
+```
+
+![image.png](../../../images/spatail/createVertexLabel_lineTest.png)
+
+**Insert data for vertex with linestring attributes**
+
+```
+CREATE (n:lineTest {id:102, name: 'Tom',linestringTest:linestringwkt('LINESTRING(0 2,1 1,2 0)', 7203)}) RETURN n
+```
+
+![image.png](../../../images/spatail/createLineTestData.png)
+
+**Create a vertex with polygon attributes**
+
+```
+CALL db.createVertexLabel('polygonTest', 'id', 'id', int64, false, 'name', string, true,'polygonTest',polygon,true)
+```
+
+![image.png](../../../images/spatail/createVertexLabel_PolygonTest.png)
+
+**Inser data for vertex with polygon attributes**
+
+```
+CREATE (n:polygonTest {id:103, name: 'polygonTest',polygonTest:polygonwkt('POLYGON((0 0,0 7,4 2,2 0,0 0))', 7203)}) RETURN n
+```
+
+## 4. Function Introduction
+
+| Function Name  | Description | Input Parameters                         | Return Type |
+| --- | --- |------------------------------| --- |
+| Distance() | Calculate the distance between two spatial data (requires the same coordinate system) | Spatial data1, Spatial data2 | double |
+| Disjoint()  |  Determine whether two spatial data intersect (under development) | Spatial data1, Spatial data2 | bool |
+| WithinBBox() | Determine whether a spatial data is within a given rectangular area (under development) | Spatial data, Point1         | bool |
+
+## 5. Food Exploration 
+
+### 5.1 Personalized Recommendations Based on Geographic Location
+
+In this section, we will explore how to use the TuGraph graph database's geospatial capabilities to create a vivid and interesting food exploration application that connects "people" and "food" through geographical locations to achieve personalized food recommendations. Imagine, no matter where you are, with just a gentle tap, the tempting food around you is at a glance – this is precisely the charm of the scene we're about to build.
+
+### 5.2 Data Model Design
+
+We first define two core types of vertex:：
+
+- Food vertex: Each restaurant or snack shop can serve as a Food node, with attributes that include but are not limited to the name, address, rating, food category, etc. Notably, we will attach geographic coordinate information to every Food node to record its precise location accurately.
+
+```
+ CALL db.createVertexLabel('food', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true,'mark',double,true)
+```
+
+Prepare data:
+
+```
+CREATE (n:food {id:10001, name: 'Starbucks',pointTest:point(1.0,1.0,7203),mark:4.8}) RETURN n
+CREATE (n:food {id:10002, name: 'KFC',pointTest:point(2.0,1.0,7203),mark:4.5}) RETURN n
+CREATE (n:food {id:10003, name: 'Pizza Hut',pointTest:point(2.0,5.0,7203),mark:4.5}) RETURN n
+CREATE (n:food {id:10004, name: 'Taco Bell',pointTest:point(3.0,4.0,7203),mark:4.7}) RETURN n
+CREATE (n:food {id:10005, name: 'Pizza Fusion',pointTest:point(5.0,3.0,7203),mark:4.9}) RETURN n
+CREATE (n:food {id:10006, name: 'HaiDiLao Hot Pot',pointTest:point(2.0,2.0,7203),mark:4.8}) RETURN n
+CREATE (n:food {id:10007, name: 'Lao Sze Chuan',pointTest:point(4.0,3.0,7203),mark:4.7}) RETURN n
+```
+
+- Person vertex: Represents the user of the application, with attributes including username, current location, etc. The user's current location is also represented by geographic coordinates, facilitating subsequent geospatial queries.
+
+```
+ CALL db.createVertexLabel('person', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true)
+```
+
+Prepare data:
+
+```
+ CREATE (n:person {id:1, name: 'Tom',pointTest:point(3.0,3.0,7203)}) RETURN n
+```
+
+### 5.3 Building the Food Exploration Query
+
+The ability to find food within a distance of 2.5 based on the user's current location, and sort by distance in ascending order allows users to have a better experience by seeing the distance and rating.
+
+**Query Statement**
+
+```
+match (n:person{id:1}),(m:food) with n.pointTest as p1,m.pointTest as p2,m.name as food,m.mark as mark
+CALL spatial.distance(p1,p2) YIELD distance 
+WHERE distance<2.5
+RETURN food,distance,mark ORDER by distance
+```
+
+![image.png](../../../images/spatail/querryFood.png)
+
+This query first matches a specific Person node (taking the user "Tom" as an example) and then finds all Food nodes. Using the custom distance function, the query calculates the straight-line distance between the current location of the Person node and each Food node, filtering out food within a distance of 2.5. Finally, the results are sorted by distance in ascending order, and the rating is provided as a reference to offer users the best possible recommendations.
+
+## 6. Outlook
+
+The aforementioned sections not only showcase TuGraph's capabilities in handling geospatial data but also depict an attractive food exploration scenario, proving the great potential of graph databases in providing personalized services that combine geographic location information. Whether it's finding a relaxing spot for the weekend or exploring unique cuisines during travel, such applications are set to greatly enrich people's life experiences. 
+TuGraph will continue to implement Disjoint() and WithinBBox() functions, enriching more use cases. Of course, everyone is welcome to participate and collaborate in developing geospatial functionalities.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..4292d5488f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Best Practices
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/14.faq.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/14.faq.md
new file mode 100644
index 0000000000..48704dfccd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/14.faq.md
@@ -0,0 +1,58 @@
+# FAQ
+
+During the use of TuGraph, if you encounter problems, you can first check [User Documentation](https://github.com/TuGraph-db/tugraph-db/tree/master/doc/zh-CN). Second, check to see if the FAQ list below matches your question.
+
+1. **[Kernel Engine QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussion-4575385)**
+   
+   1.1 [Does the edge of TuGraph support index? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165379)
+   
+   1.2 [What is the QPS of a single TuGraph machine? ](https://github.com/TuGraph-db/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussion-4575381)**
+   
+   2.1 [How to update the tugraph service after the visualization file is built? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165364)
+   
+   2.2 [How to connect the existing tugraph service through npm run dev? ](https://github.com/TuGraph-db/tugraph-db/discussions/111#discussioncomment-4165366)
+   
+   2.3 [TuGraph Browser version 3.3.0 failed to delete node label? ](https://github.com/TuGraph-db/tugraph-db/discussions/82#discussion-4465791)
+3. **[Client QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussion-4575378)**
+   
+   3.1 [What programming languages ​​does the client currently have, and does it support node js? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165351)
+   
+   3.2 [Does the python client support pip install? Where is the client referenced? ](https://github.com/TuGraph-db/tugraph-db/discussions/109#discussioncomment-4165353)
+4. **[Data Import QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussion-4575373)**
+   
+   4.1 [Which common databases can TuGraph connect to? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165335)
+   
+   4.2 [How to import data? ](https://github.com/TuGraph-db/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[Stored Procedure QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussion-4575369)**
+   
+   5.1 [How to load stored procedure or algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165313)
+   
+   5.2 [How to call or execute the stored procedure? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165317)
+   
+   5.3 [Where is the open source built-in algorithm package? ](https://github.com/TuGraph-db/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[Installation and deployment QA summary](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussion-4575364)**
+   
+   6.1 [How to install using docker image? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165287)
+   
+   6.2 [After the rpm package and deb package are installed, start the lgraph_server service. Prompt missing 'liblgraph.so' error? ](https://github.com/TuGraph-db/tugraph-db/discussions/103#discussioncomment-4165289)
+   
+   6.3 [How to compile TuGraph on Mac's M1 chip? ](https://github.com/TuGraph-db/tugraph-db/discussions/47#discussion-4393165)
+   
+   6.4 [How to Handle Error: 'jemalloc: Unsupported system page size'? ](https://github.com/TuGraph-family/tugraph-db/issues/477)
+7. **[Cypher QA Summary](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussion-4575018)**
+   
+   7.1 [Does it support conditional query of indefinite length? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165252)
+   
+   7.2 [How to query the shortest path, how to use the shortestPath function? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165256)
+   
+   7.3 [Using and after the query statement Where to splice the query speed is slow, how should the statement be optimized and improved? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165260)
+   
+   7.4 [How to query the edge of any jump? ](https://github.com/TuGraph-db/tugraph-db/discussions/102#discussioncomment-4165262)
+   
+   7.5 [Is there a date() function in Cypher? ](https://github.com/TuGraph-db/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA Summay](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+   
+   8.1 [What should I do after the error "User has reached the maximum number of tokens" is reported? ](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+If the problem is still not resolved, we recommend you follow up or create a new thread describing your problem. At the same time, the TuGraph QA summary will be updated regularly based on the posts initiated by everyone in the discussion area.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/15.contacts.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/15.contacts.md
new file mode 100644
index 0000000000..edde354f9a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/15.contacts.md
@@ -0,0 +1,17 @@
+# Contacts
+
+If you have any feedback or suggestions for the product, You are welcome to join the discussion or make suggestions through the following contact methods.
+
+Official website: [tugraph.tech](https://tugraph.tech)
+
+Github Issue:
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions:
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack:
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+Contact us via dingtalk, wechat, email and telephone:
+![contacts](../../images/contact-en.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..549043a94c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,15 @@
+# What is Graph
+
+The graph that we're going to introduce today, it's neither a picture, nor a diagram，it's a class of mathematics called graph theory. We can see on the screen that there are two graphs on the left and right, which represent things and their relationship. We abstract it out in a form, and we call such a form a graph.
+
+![alt what is graph](../../../images/what-is-graph-en.png)
+
+The basic elements of a graph are a vertex, and an edge, a vertex is a representation of the thing, of the entity, and an edge is a representation of the relationship between them.
+
+We see the graph on the left, the dots have companies, they have employees, and they have projects. What are their sides? The relationship between the company and the employees is an employment relationship, and there can be a friend relationship between the employees, and there can be a participation relationship between the project and the employees. That is, we can use graphs to abstract things and their relationships.
+
+The diagram on the right is a schematic diagram of a financial transaction. Each of us has a bank account, and when our bank account makes a consumption or makes a transfer, this account is the point on the graph, and this edge can indicate that there is such a transfer relationship between us.
+
+We can also see from this example that edges can attach information and points can attach information. The point can attach which bank this account is in and what the account is. The value of the transaction can be attached to the edge, and many times, if your transaction is large, it indicates that special attention is needed. This edge might not necessarily be the amount of a particular transfer, it might be the amount accumulated over a period of time and so on. Graphs can actually be very expressive.
+
+On the other hand, for a graph like finance, it can be very large. There could be more than a billion points, a hundred billion or even a trillion edges. As you can imagine, it's actually quite challenging to actually work with these graphs.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..935aa4ffa0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# What is a graph database
+
+> This document mainly introduce what is a graph database, the advantages of graph database compared with relational database, and the comparison between graph database and relational database
+
+## 1. Introduction
+
+Graph database is a database based on graph model. The main function of graph database is to manage graph data, so it needs to support efficient vertex/edge query and update; To facilitate user use, it is usually necessary to add transaction support to ensure the normal operation of concurrent operations.
+
+## 2. Advantages of graph databases over relational databases
+
+The function of graph database is an extension of traditional relational database. Compared with relational database, the graph structure supported by graph data is more flexible. Graph database is different from other databases in terms of data addition, deletion, query and modification based on graph. On the operation abstraction of graph data, a vertex-based perspective is adopted, for example, a vertex accesses its neighboring vertices through all its outgoing edges. This kind of operation is also the core of the design of graph database system.
+
+The uniqueness of graph database can be reflected in the following three aspects:
+
+### 2.1 Performance
+
+Handling the relationship between data, it is inevitable to use table JOIN operation in relational database, which has a great impact on performance. Graph database is a direct access, similar to pointer access, which is more efficient operation of associated data, compared with relational database performance improvement of 2 to 4 orders of magnitude.
+
+### 2.2 Compatibility
+
+In reality, the process of a project is often evolutionary. The content and even the format of the data are constantly changing. In a relational database, this means that a change in the table structure, or the creation of multiple new tables, significantly changes the source data. In the graph database, you simply add new vertices, edges, and attributes, and set them to the corresponding types. In essence, a table represents a type of data, and a vertex represents a specific data, meaning that relational databases pay more attention to the type of data, while graph databases pay more attention to the individuals of data and identify their association relationships.
+
+### 2.3 Intuitive
+
+Using graphs (or nets) to express real-world relationships is more straightforward and natural, especially in the Internet of Things era. If relational data used, a high degree of abstract thinking required to build a table of characters first, then a table of relations, and finally a map of data. When analyzing and querying the graph data, you can also intuitively find the desired data interactively through the point-edge connection topology, without any professional knowledge.
+
+## 3. Comparison between graph database and relational database
+
+| classification      | model           | advantage                                                            | disadvantage                                                                 | example        |
+| ------------------- | --------------- | -------------------------------------------------------------------- | ---------------------------------------------------------------------------- | -------------- |
+| Relational database | Table structure | Data is highly structured, consistent, and software maturity is high | The multi-hop association query is inefficient or not supported              | MySQL、Oracle  |
+| Graph database      | graph structure | Modeling and manipulating associations is very efficient             | Highly structured data processing is not as powerful as relational databases | Neo4j、TuGraph |
+
+In a word, in the face of massive data storage and processing problems, the traditional relational database has been unable to meet most of the daily data storage needs. Graph database technology can store relational information as entities and expand data model flexibly. Because it provides the most direct expression of related data, and the graph model is naturally tolerant to heterogeneous data. In the future, graph database technology will become one of the most popular technologies, which will provide powerful support for enterprises to store and analyze large-scale graph data.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..da6cbf6318
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,46 @@
+# What is TuGraph
+
+> This document mainly introduces the main features and characteristics of TuGraph Community Edition, as well as the differences between TuGraph Enterprise Edition and Community Edition.
+
+
+## 1.Introduction
+
+Graph database is a non-relational database that stores data by vertices and edges. It can be used to store complex data network models, such as social networks and transaction networks. TuGraph is a graph database developed by Ant Group. This manual introduces the functions and usage of TuGraph.
+
+## 2.TuGraph Community Edition
+
+The Community Edition is a fully functional version of TuGraph, suitable for single-instance deployment. It provides complete basic fuctions of graph database, such as ACID-compatible transactions, programming APIs, and associated tools. It is ideal for learning TuGraph and implementing small projects.
+
+## 3.TuGraph features
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property graph model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+## 4.TuGraph Enterprise Edition
+
+The Enterprise Edition has more comprehensive support for commercial features, including distributed cluster architecture, a one-stop graph platform covering exploration, research and development, service and operation and maintenance throughout the lifecycle, online, near-line, and offline graph computing engines, support for streaming and big data data sources, multi-site and multi-center deployment, making it an ideal choice for commercial solutions.
+
+```text
+    If you need to implement production-level high-availability cluster architecture, operation and maintenance and other enterprise-level services, please contact us to obtain commercial support:
+    Email:tugraph@service.alipay.com
+    Tel:0571-85022088,extension number 83789993#
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..e0e02c1750
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/4.schema.md
@@ -0,0 +1,160 @@
+# TuGraph schema  Instructions
+## 1.The data model
+
+### 1.1.Graph model
+TuGraph is a strong schema, directed property graph database with multi-graph capability.
+
+- Graph Project: Each database service can host multiple graph projects (multi-graphs), and each graph project can have its own access control configuration. The database administrator can create or delete specified graph projects.
+- Vertex: Refers to entity, generally used to express real-world entities, such as a movie or an actor.
+    - Primary Key: User-defined vertex data primary key, unique in the corresponding graph project and vertex type.
+    - VID: Refers to the auto-generated unique ID of the vertex, which cannot be modified by the user.
+    - Upper Limit: Each graph project can store up to 2^(40) vertex data.
+- Edge: Used to express the relationship between vertexs, such as an actor appears in a movie.
+    - Directed Edge: The edge is a directed edge. If you want to simulate an undirected edge, the user can create two edges with opposite directions.
+    - Duplicate Edge: TuGraph currently supports duplicate edges. If you want to ensure the uniqueness of the edge, you need to implement it through business policies.
+    - Upper Limit: Up to 2^(32) edge data can be stored between two vertex data.
+- Property Graph: vertexs and edges can have properties associated with them, and each property can have a different type.
+- Strong-typed: Each vertex and edge has only one label, and after creating a label, there is a cost to modify the number and type of attributes.
+    - Specify the starting/ending vertex type of the edge: You can limit the starting and ending vertex types of the edge, and support different vertex types of the starting and ending vertexs of the same type of edge, such as individuals transferring money to companies, companies transferring money to companies. After specifying the starting/ending vertex type of the edge, you can add multiple sets of starting/ending vertex types, but you cannot delete the restricted starting/ending vertex types.
+    - Unrestricted Mode: Supports creating edge data of this type between any two vertex types without specifying the starting and ending vertex types of the edge. Note: After specifying the starting/ending vertex type of the edge, the unrestricted mode cannot be used again.
+
+### 1.2.The data type
+
+TuGraph Supports a variety of data types that can be used as attributes, the specific supported data types are as follows:
+
+<caption>Table 1. TuGraph supported data types</caption>
+
+| **Type** | **Min**             | **Max**             | **Description**                                  |
+|----------|---------------------|---------------------|--------------------------------------------------|
+| BOOL     | false               | true                | Boolean                                          |
+| INT8     | -128                | 127                 | 8-bit int                                        |
+| INT16    | -32768              | 32767               | 16-bit int                                       |
+| INT32    | - 2^31              | 2^31 - 1            | 32-bit int                                       |
+| INT64    | - 2^63              | 2^63 - 1            | 64-bit int                                       |
+| DATE     | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" Date of format                      |
+| DATETIME | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD hh:mm:ss[.ffffff]"Format of the date and time |
+| FLOAT    |                     |                     | 32-bit float                                     |
+| DOUBLE   |                     |                     | 64-bit float                                     |
+| STRING   |                     |                     | A string of variable length                      |
+| BLOB     |                     |                     | Binary data                                      |
+| POINT    |                     |                     | EWKB format data of point                        |
+| LINESTRING |                   |                     | EWKB format data of linestring                   |
+| POLYGON  |                     |                     | EWKB format data of polygon                      |
+| FLOAT_VECTOR |                 |                     | The dynamic vector containing 32-bit float numbers |
+
+_BLOB data is BASE64 encoded in input and output_
+
+### 1.3.Index
+
+TuGraph supports indexing vertex fields.
+
+Indexes can be unique or non-unique. If a unique index is created for a vertex label, TuGraph will perform a data integrity check to ensure the uniqueness of the index before modifying the vertex of the label.
+
+Each index built on a single field of a label, and multiple fields can be indexed using the same label.
+
+BLOB fields cannot be indexed.
+
+TuGraph supports creating indexes on node or edge attributes to improve query efficiency. Its characteristics are as follows:
+- Indexes include single indexes and composite indexes. A single index is created based on a single property of a node or an edge, while a composite index is created based on multiple properties of a node or an edge (no more than 16). Indexes can be created on multiple sets of properties for the same node or edge.
+- If a unique index is created for a node label, when modifying a node for that label, a data integrity check is first performed to ensure the uniqueness of the index.
+- Attributes of type BLOB cannot be indexed.
+
+There are multiple index types for TuGraph's vertices and edges. Different index types have different functions and restrictions, as follows:
+
+#### 1.3.1 Single index
+#### 1.3.1.1 Node index
+##### 1.3.1.1.1 unique index
+
+The unique index of a node refers to a globally unique index. That is, if a unique index is set for an attribute, in the same graph, the attribute of nodes with the same label will not have the same value.
+The maximum length of a unique index key is 480 bytes. **Unique indexes cannot be created for attributes exceeding 480 bytes**.
+Primary is a special unique index, so the maximum key length is also 480 bytes.
+
+##### 1.3.1.1.2 non_unique index
+
+The non_unique index of a node refers to a non-global unique index, that is, if an attribute is set with a non_unique index,
+In the same graph, nodes with the same label can have the same value for this attribute.
+Since a key in a non_unique index may be mapped to multiple values, in order to speed up search and writing,
+The maximum value of a group of vids with the same index key is added after the user-specified key.
+Each vid is 5 bytes long, so the maximum length of a non_unique index key is 475 bytes.
+However, unlike unique indexes, non_unique indexes can also be established if they exceed 475 bytes.
+However, when indexing such an attribute, only **the first 475 bytes** will be intercepted as the index key (the value stored in the attribute itself will not be affected).
+Moreover, when traversing through an iterator, the first 475 bytes of the query value are automatically intercepted before traversing.
+Therefore, the results may be inconsistent with expectations and require users to filter again.
+
+#### 1.3.1.2 Edge index
+
+##### 1.3.1.2.1 unique index
+
+Similar to node, the unique index of an edge refers to a globally unique index. That is, if an attribute is set to a unique index, in the same graph, the attribute of the edge with the same label will not have the same value.
+The maximum length of a unique index key is 480 bytes. **Unique indexes cannot be created for attributes exceeding 480 bytes**.
+
+##### 1.3.1.2.2 pair_unique index
+
+pair_unique index refers to the unique index between two nodes, that is, if an attribute sets a unique index, between the same set of the starting node and the ending node in the same graph,
+Edges with the same label will not have the same value for this attribute. In order to ensure that the pair_unique index key does not repeat between the starting node and the end node of the same group,
+The index adds the starting and ending vids after the user-specified key. Each vid is 5 bytes in length.
+Therefore, the maximum key length is 470 bytes, and **a pair_unique index cannot be created for attributes exceeding 470 bytes**.
+
+##### 1.3.1.2.3 non_unique index
+
+Similar to node, the non_unique index of an edge refers to a non-global unique index, that is, if an attribute sets a non_unique index,
+In the same graph, edges with the same label can have the same value for this attribute.
+Since a key in a non_unique index may be mapped to multiple values, in order to speed up search and writing,
+The maximum value of a group of eids with the same index key is added after the user-specified key.
+Each eid is 24 bytes in length, so the maximum length of a non_unique index key is 456 bytes.
+However, unlike unique indexes, non_unique indexes can also be established if they exceed 456 bytes.
+However, when indexing such an attribute, only **the first 456 bytes** will be intercepted as the index key (the value stored in the attribute itself will not be affected).
+Moreover, when traversing through an iterator, the first 475 bytes of the query value are automatically intercepted before traversing.
+Therefore, the results may be inconsistent with expectations and require users to filter again.
+
+#### 1.3.2 Composite index
+
+Currently, composite indexes are only supported for multiple properties of a vertex, and not supported for properties of an edge. There are two types of composite indexes: unique indexes and non-unique indexes. The requirements for creating a composite index are as follows:
+1. The number of properties for creating a composite index should be between 2 and 16 (inclusive).
+2. For a unique composite index, the sum of the lengths of the properties cannot exceed 480 - 2 * (number of properties - 1) bytes, while for a non-unique composite index, it cannot exceed 475 - 2 * (number of properties - 1) bytes.
+
+##### 1.3.2.1 Unique index
+Similar to a vertex's single unique index, a vertex's composite unique index refers to a globally unique index, meaning that for a set of properties with a unique index, there will not be another vertex with the same label in the same graph that has the same value for that group of properties.
+Due to the underlying storage design, the composite index key needs to retain the length of the properties; therefore, the maximum length for a composite unique index key is 480 - 2 * (number of properties - 1) bytes. Properties exceeding this length cannot be indexed uniquely.
+
+##### 1.3.2.2 non_unique index
+Similar to a vertex's single non-unique index, a vertex's non-unique index refers to a non-globally unique index, meaning that for a set of properties with a non-unique index, different vertices with the same label in the same graph may have the same value for that group of properties.
+Since a non-unique index key may map to multiple values to accelerate lookups and writing, the maximum value from a group of vertex IDs (vid) has been appended to the user-specified key where the index keys are identical. Each vid is 5 bytes in length; thus, the maximum length for a non-unique index key is 475 - 2 * (number of properties - 1) bytes. Properties exceeding this length cannot be indexed non-uniquely.
+
+## 2. Graph Project, Vertex, Edge, and Attribute Naming Conventions and suggestions
+
+### 2.1 Naming Rules
+Graph projects, vertices, edges, and attributes are identifiers. This section describes the allowed syntax for identifiers in TuGraph.
+The table below describes the maximum length and allowed characters for each type of identifier.
+
+|**Identifier** |**Length** |**Allowed Characters**|
+|---------  |---------  |---------  |
+|User, role, graph project	|1-64 characters	|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+|Vertex type, edge type, attribute	|1-256 characters		|Chinese, letters, numbers, underscore, and the first character cannot be a number|
+
+### 2.2 Usage Restrictions
+
+|**Description**|	**Maximum number**|
+|-------- |--------- |
+|Number of users, number of roles	|65536|
+|Number of graphs	|4096|
+|Number of vertex and edge types per graph	|4096|
+|Number of attributes per type	|1024|
+
+Note:
+1.Special characters and keywords: When using special characters or keywords, they need to be enclosed in backquotes (``) for reference;
+
+Example: ```match (`match`:match) return `match`.id limit 1```
+
+2.Case sensitivity: TuGraph is case-sensitive;
+
+3.Graph project, vertex/edge, and attribute names can be reused, but attribute names under the same vertex or edge cannot be duplicated;
+
+4.Reserved keywords for attribute names: SRC_ID / DST_ID / SKIP.
+
+### 2.3 Naming Suggestions
+|**Identifier**|**Description**|**Suggestions**|
+|-------|-------|--------|
+|Graph project	|Start with a letter or Chinese character	|Examples: graph123, project123, etc.|
+|Vertex/edge type	|Start with a letter or Chinese character and use underscores to separate words		|Examples: person, act_in, etc.|
+|Attribute	|Letters or Chinese characters	|Examples: name, age, etc.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..de894fa1b0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# Performance Oriented
+
+> This document mainly introduces TuGraph's performance-oriented design philosophy as an open-source graph database.
+
+## 1.Introduction
+
+TuGraph is currently the fastest graph database in the world, ranking first in the LDBC SNB Interactive graph database standard evaluation (March 2023). The design of TuGraph is based on performance optimization, and is committed to building a high-performance single-machine graph database. This document describes the core design of TuGraph's storage layer based on performance optimization.
+
+## 2.Characteristics of Graph Operations
+
+Operations on property graphs involve reading, writing, and their attributes, and the access patterns of some special attributes such as timestamps can also affect overall performance. Here, by summarizing the regularities of some graph operation characteristics, we can guide the final performance.
+
+We observe that many graph applications have similar data access patterns. For example, in credit risk control, we use recursive path filtering to search for many-to-one patterns to find suspicious credit fraud users and behaviors. For online gambling, we can identify gambling-related fund accounts by recognizing multiple fund transfers in a short period of time. The equity penetration scenario recursively calculates the equity relationship between entities. These scenarios have common patterns such as multi-hop entity and relationship access, time window constraints, and read/write transactions.
+Furthermore, from the discussion in the introduction and the analysis of graph workloads, the following characteristics can be summarized:
+
+**Characteristic 1** KHop is the most typical operation in a graph, based on the data access pattern of the graph topology of points and edges, and has essential differences from relational databases. The typicality of KHop is not only reflected in the different data access patterns, but it is also the performance point that graph databases need to pay attention to the most.
+
+**Characteristic 2** Data access of graph workloads has a certain degree of locality on the topology, and the edges of the same point are usually accessed simultaneously. When the labels of these edges are the same, there is a greater probability of simultaneous access.
+
+**Characteristic 3** When accessing points and edges in graph workloads, their corresponding attributes are usually accessed as a traversal filter condition.
+
+**Characteristic 4** In time-based graph workloads, filtering of points and edges is usually within a certain time range, such as the past week.
+
+**Characteristic 5** Write operations may be accompanied by a large number of read operations, which need to be processed in a single transaction cycle.
+
+Through the analysis of actual online graph applications, the read/write ratio of graph workloads is about 20:1, although the scenarios are limited to the financial field and the number of clusters is also limited, the scale of the data involved and the number of users are very large, which is representative to some extent. The 20:1 read/write ratio of graph workloads indicates that the impact of read workload on overall performance is greater, and the performance of write workload cannot be ignored either.
+
+## 3.Storage Data Structures
+
+TuGraph uses B+ trees as the underlying data structure to support real-time transactional operations for insertion, deletion, querying, and updating.
+
+In sorting tree data structures, B+ trees and LSM trees are the main representatives. B+ trees use a split and merge method to update sorted data in tree nodes, while LSM trees append updates to logs for delayed data merging. B+ trees were originally used in file system implementations, solving the problem of differences in performance between sequential and random operations on hard disks by storing data in adaptive-length leaf nodes, and have a relatively balanced read/write performance. The main advantage of LSM trees is to use WAL (Write Ahead Log) to perform updates, which turns update operations into sequential operations, especially in the case of small key-value pairs. WAL means that the update of data is deferred until it is merged in batches, which can improve the comprehensive efficiency of batch updates, but also makes the system scheduling more complicated. If the update merge is not completed, and the data is read again, LSM trees need to read several levels of locally merged logs, which will cause read amplification and space amplification, thereby affecting read efficiency.
+
+To sum up, B+ trees have better sequential read/write performance, while LSM trees have advantages in random write data. In addition, the way of LSM trees using background merging makes the performance fluctuation difficult to predict, and the correlation between performance fluctuation and upper-level storage and computation is weak, which increases the overall design cost. Considering the above factors, TuGraph chooses B+ trees as the implementation for read performance optimization.
+
+## 4.Data Encoding
+
+For property graph models, in addition to graph topology encoding, property data also greatly affects functionality and performance. We first discuss how property data can be encoded together with topology data. From current research, there are two ways of encoding properties: discrete encoding, which stores property data separately based on pointer indexes, and compact encoding, which packs property data and topology data together. Discrete encoding can store each property separately or pack each edge's properties separately, and the following discussion applies to both situations.
+
+Vertex Query: Property encoding mainly focuses on edges and does not involve vertex queries.
+
+Single-Edge Query: Discrete encoding locates edges through pointers, while compact encoding requires binary search to locate the edge position. Discrete encoding has a slight advantage.
+
+Edge Traversal: Discrete encoding requires constant random access through pointer jumps during edge traversal, while compact encoding arranges data together in advance, greatly improving efficiency due to its sequential access feature. Since edge traversal operations are common according to Rule 3, compact encoding has obvious advantages in edge traversal.
+
+Single-Edge Update: Discrete encoding only requires finding the corresponding pointer position and modifying the pointer's location before and after inserting data. Compact encoding needs to re-encode the compactly arranged data and rewrite the entire edge value, resulting in significant overhead compared to discrete encoding.
+
+Batch Edge Update: Batch updates can pre-build all edge properties for a vertex in memory and write them in one encoding, making both discrete encoding and compact encoding equivalent. However, compact encoding does not require storing pointer variables, so it has higher storage space efficiency.
+
+The performance issues of discrete encoding and compact encoding for a certain type of query discussed above can be alleviated through optimization. Overall, due to the 20:1 read-write load of graphs and the characteristics of property access revealed by Rule 3, TuGraph tends to use compact encoding to ensure read performance. Its main weakness is the overhead of re-encoding during single-edge updates, which can be solved using adaptive mapping technology.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3407932273
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,33 @@
+# Multi Level Interfaces
+
+> This document mainly introduces the design concept of TuGraph's multi-level interfaces.
+
+## 1.Introduction
+
+The multi-level interface is a balance between usability and high performance that TuGraph has designed to meet a variety of use cases. For example, Cypher, a declarative graph query language, can abstract away the implementation details of a graph database and express queries based on the graph model. However, Cypher's high-level descriptions cannot be efficiently translated into low-level execution, so TuGraph provides a procedural language, Procedure API, to achieve optimal database performance.
+
+Interfaces can be roughly divided into client interfaces and server interfaces. Most operations are performed on the server, and the client only does data encapsulation and parsing. The client and server are connected through a network, and TuGraph supports both flexible short-connection REST protocol and more efficient long-connection RPC protocol, which can be selected according to different business scenarios.
+
+The server interfaces are all at the calculation layer and are logically separated from the graph data storage by a Core API layer.
+
+![Multi Level Interfaces](../../../../images/multi-level-Interfaces-en.png)
+
+### 2.Client Interface
+
+The client interface refers to the interface executed on the client and is typically used for integration into software applications. TuGraph's client interface is relatively simple, including login/logout, data import/export, stored procedure loading and calling, and Cypher operations. Cypher integrates most of the functions, including data operations, graph model operations, operations and account management.
+
+Since the parameters and return values of Cypher are strings, JAVA OGM is a structured wrapper for Cypher, meaning that query results can be encapsulated into a typed object for ease of use.
+
+### 3.Server Interface
+
+The server interface includes Cypher, Procedure API, OLAP API, and GNN PI, which provide services for graph transaction engines, graph analysis engines, and graph neural network engines. The characteristics of each interface are explained in detail below.
+
+> __Cypher__ is an abstract description of query logic that is independent of execution logic and is more user-friendly for graph database applications, similar to the SQL language of relational databases. TuGraph's Cypher language mainly follows the OpenCypher query standard open-sourced by Neo4j and extends auxiliary functions such as operations and maintenance management. Descriptive graph query language will become the main data operation method for graph databases, but generating the optimal execution plan between description and execution still requires a long way to go in both academia and industry.
+
+> __Procedure API__ is designed to bridge the gap between descriptive graph query language and optimal performance. TuGraph's Procedure API provides a simple wrapper on top of the Core API, which maximizes the storage's performance efficiency and is the upper limit of Cypher optimization performance. Python Procedure API is a cross-language wrapper on top of C++ Procedure API, but the copying of values during translation may result in some performance loss, and its advantage lies mainly in the ease of use of the Python language. The traversal API is a parallel-executing Procedure interface that is more similar to set operations in terms of description, such as expanding all outgoing neighbors of a point set to obtain a new point set.
+
+> __OLAP API__ belongs to the category of "graph computing systems" and exports snapshots of graph data from storage that supports insert, update, delete, and query operations to support read-only complex graph analysis in a more compact data storage format. OLAP API encapsulates data structures that support high-concurrency execution, including Vector, Bitmap, and CSR-based graph snapshot data structures, and provides a set of concurrent fast point-edge operation frameworks. After the graph analysis task is completed, the data can be written back to the graph database through the interface.
+
+> __GNN API__ mainly provides the interfaces needed for graph neural network applications and can be integrated with machine learning frameworks such as PyTorch. TuGraph's GNN PI mainly integrates DGL and completes the entire process from graph storage to graph neural network application in the Python language environment.
+
+Except for Cypher's interpretive execution, all other server interfaces are compiled and executed, meaning that the corresponding code needs to be sent to the server and compiled (which may take some time) before execution on the server. Therefore, it is usually necessary to load the program first, then find it in the list of loaded applications, and execute it after passing in the input parameters.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..080cc02e48
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> This document mainly introduces the design philosophy of TuGraph's HTAP.
+
+## 1.Introduction
+
+![htap](../../../../images/htap-en.png)
+
+There are different ways to implement HTAP in architecture: one is to use two different copies to handle OLTP and OLAP tasks separately, with the core being data consistency synchronization and additional resource overhead; the other is to use the same data storage at all times, but this implementation has memory bloat in its data structure and needs further work for industrialization. In TuGraph's design, simple OLAP and OLTP operations share the same data, while complex OLAP operations are exported and handled separately as snapshots.
+
+## 2.Design
+
+In TuGraph, OLTP is the graph transaction engine, corresponding to transaction operations in Figure; OLAP is the graph analysis engine, corresponding to simple graph analysis operations (such as SPSP) and complex graph analysis operations (such as PageRank), the former of which can be executed directly on the graph storage, while the latter requires exporting a snapshot for execution.
+
+- Transaction operations, measured by the graph transaction engine, are local graph add, delete, query and modify operations, typically used for K-hop access.
+- Simple analysis operations are the simpler part of the graph analysis engine, usually local graph analysis operations, such as the shortest path algorithm SPSP and Jaccard algorithm.
+- Complex analysis operations are the more complex part of the graph analysis engine, usually involving multi-round data iteration operations across the entire graph, such as the PageRank algorithm for webpage ranking and the Louvain algorithm for community discovery.
+
+As shown in Figure , external storage is added to the architecture diagram, making the data source for graph analysis not limited to the graph database and can be directly read from text files.
+
+- Graph storage, which is the storage in the graph database, has carefully designed data structures that can perform real-time add, delete, query and modify operations.
+- External storage, which can be an RDBMS or text file, is stored in a simple way as an edge table, only for one-time batch reading and batch result writing. In the calculation layer, it corresponds to the interface in the overall architecture diagram.
+- Cypher, the declarative graph query language, can be executed concurrently.
+- Procedure API, the procedural graph query language, is flexible and can support both transaction operations and graph analysis operations, but its efficiency is not sufficient to complete complex graph analysis operations, and it can be executed concurrently.
+- OLAP API, for multi-round iteration of complex graph analysis. Applications need to first export the graph data in storage into a snapshot in memory, which is only used for fast access and does not need to consider the write support of ACID, so it can be arranged more compactly, and the read efficiency of CSR arrangement is much higher than that of graph storage data arrangement. OLAP API can only be executed serially, and each operation uses full CPU resources.
+
+OLAP API snapshots can be created from external storage, where the edge table data is formatted as CSR, or from the graph storage. It should be noted that OLAP API requires that the IDs of the vertices be consecutive natural numbers, which may require additional ID mapping. This step can be mapped to a specified attribute when creating a snapshot or directly using the attribute value as the ID.
+
+Corresponding to the calculation interface and storage, there are four operating modes.
+
+- Transaction mode, each operation corresponds to a Cypher statement, which is a transaction by default.
+- Plugin mode, call through plugins, after the calculation logic is loaded on the server, also known as stored procedures.
+- Embed mode, which has the same interface as Plugin mode but the graph database service does not need to be started and can directly call the data in the database through the interface. This mode is usually used for debugging Procedure API and OLAP API code, and the debugging information and operation steps are more friendly than Plugin mode.
+- Standalone mode, which maximally separates from the graph database, is more direct when only using the graph analysis engine for data analysis. Standalone mode will directly use the data of the external storage.
+
+The use of the graph neural network engine is similar to the 'complex graph analysis operation', which calls part of the OLAP API and GNN API at the same time, which is not elaborated here.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..b42c13eac8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Characteristics
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..198facd84b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# Architecture
+
+> This document mainly introduces the product architecture of TuGraph.
+
+## 1.Introduction
+
+![Architecture](../../../images/architecture-en.png)
+
+The following diagram shows the overall architecture of an enterprise-level graph database from the perspective of functional modules, using TuGraph as an example, from bottom to top:
+
+- Software and hardware environment. This involves the development and use environment of the graph database. TuGraph is mainly developed based on the underlying C++ language, and is compatible with most operating systems and CPUs on the market.
+- Storage layer, including the KV storage layer and the graph storage layer. The storage layer needs to support various functions required by the calculation layer.
+- Calculation layer. The calculation layer should include the graph transaction engine, graph analysis engine, and graph neural network engine. It also includes a variety of programming interfaces provided by the server, including descriptive query language Cypher, stored procedures, and so on.
+- Client. The client SDK should support multiple languages such as Java, Python, and C++, and also support command-line interaction. The Browser and Explorer reduce the threshold for using the graph database through web-based interaction.
+- In terms of ecological tools, it covers the development, operation, and management links of enterprise-level graph databases, improving usability.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..c8bc65a993
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/7.functionality.md
@@ -0,0 +1,99 @@
+# Functionality
+
+> This document mainly introduces the main functions and features of TuGraph.
+
+## 1.Installation
+
+## 1.1.Installation
+
+Deployment methods TuGraph currently provides three deployment methods: cloud deployment, Docker deployment, and local package deployment. Users can choose the appropriate deployment method according to their actual situation.
+
+## 1.2.Software and Hardware Environment
+
+TuGraph core is developed in C++, and the default compiler used is GCC8.4, using c++14 standard. Some functions use other compilers, such as ApacheLucene-based full-text indexing, which uses JNI interface and requires a Java compiler. In addition, the Python Procedure API is provided in the stored procedure, which requires a Python environment. TuGraph does not require special hardware such as GPUs, and can naturally adapt to general hardware upgrades such as RDMA and HBM with high latency and low bandwidth.
+
+TuGraph has been tested on CPUs based on X86 and ARM, including Intel, AMD, Kunpeng, Hygon, Feiteng, etc., and also runs on multiple operating systems, including mainstream versions of Ubuntu, CentOS, SUSE, Galaxy Kylin, Zhongbiao Kylin, and UOS, without special requirements for operating systems and CPUs.
+
+The software and hardware environment also includes the environment of dependent libraries. Since the default KV storage in TuGraph's storage layer is LMDB, the file system needs to support POSIX interfaces. The compilation and parameter configuration in different environments will be slightly different. For example, in the packaging of point-edge data in graph storage, it should match the page table size of the operating system, which is 4KB by default, and it is recommended to set the system's page table size to 4KB.
+
+## 2.Storage layer
+
+In the graph data model, TUGraph supports the attribute graph model, which can be divided into subgraphs, tags (including vertex tags and edge tags), and attributes according to the hierarchy.
+
+From the perspective of the storage layer, TuGraph uses an intuitive multi-layered tree model, without tags across subgraphs or attributes across tags, and only retains the core logic of the graph model. In terms of subgraph storage, TuGraph has performed data physical isolation for multiple graphs, and each graph corresponds to an instance of LMDB. The metadata description information of multiple graphs is saved in a special public LMDB instance called meta. The storage of vertex and edge tags and their attributes maps graph data adaptively to KV key-value pairs, maximizing read performance. At the same time, multi-threaded writing is implemented at the KV layer, solving the disadvantage of low write performance of LMDB. Primary key indexes and secondary indexes correspond to B+ tables in LMDB, supporting index value addition, deletion, query, and modification based on comparison.
+
+The storage layer also retains some other non-core functional data, including permission data, pre-compiled plugin data, and monitoring data.
+
+## 3.Calculation layer
+
+The calculation layer is divided into three parts in terms of function, including the TP-class graph transaction engine, the AP-class graph analysis engine, and the graph neural network engine.
+
+__The graph transaction engine__ is mainly used to process concurrent graph operations, including single-point queries, neighbor queries, and path traversal. The graph transaction engine focuses on ACID transactions of concurrent operations, ensuring that the operation logic will not interfere with each other. The main performance indicator is QPS, which is the number of completed queries per second.
+
+__The graph analysis engine__ usually operates as a full-graph iteration. Some simple analysis tasks (such as SPSP) can be completed by the graph transaction engine, and complex analysis tasks are completed by the graph analysis engine, which usually takes several seconds to several hours for a single task. Therefore, a single graph analysis task should use all hardware resources in parallel, and the performance indicator is the total time for completing the task.
+
+__The graph neural network engine__ usually operates as a full-graph iteration. In addition to graph topology-based operations, the graph neural network engine also needs to integrate a machine learning framework to handle vector operations, such as PyTorch, MXNet, and TenserFlow.
+
+The logic of the three engines is different and independently configured for resource pools. The graph transaction engine sets up a thread pool based on RPC operations. For each operation received from the client, a thread is taken from the pool to process it, and the number of concurrent executions is equal to the capacity of the RPC thread pool, which is usually configured as the number of server cores. The graph analysis engine has an analysis thread pool, and each graph analysis task is executed concurrently, that is, all threads are used to execute a task to speed up the performance of the operation. The serial execution feature of TuGraph graph analysis operations will restrict the user experience to a certain extent. The demand for concurrent graph analysis can be processed by deploying high-availability, increasing machine resources, or connecting to an external task scheduler to transfer data to a container for real-time scheduling and calculation. Graph neural network operations will reuse the resources of the graph transaction
+
+## 4.Core Features
+
+### 4.1.Query Language
+
+TuGraph provides Cypher graph query language that follows the OpenCypher standard.
+- Supports Procedure embedding.
+- Supports pluggable optimization frameworks with various optimization features.
+- Supports extensible security check framework for Cypher.
+
+### 4.2.Stored Procedures
+
+When users need to express complex query/update logic that Cypher cannot describe, or when high performance is required, TuGraph's stored procedures (Procedure) is a more concise and efficient choice than calling multiple REST requests and completing the entire processing flow on the client-side.
+
+### 4.3.Data Import/Export
+
+Although TuGraph supports data insertion, batch import can greatly improve efficiency. The import function can be divided into importing into an empty database (offline import) and incremental import. The former refers to importing when the subgraph is empty, and the additional assumption can greatly improve the import performance. In TuGraph, the throughput rate of empty database import and incremental import differs by 10 times. Data consistency needs to be considered in data export, which is based on exporting data based on a snapshot.
+
+TuGraph can perform data export on graph data already stored in TuGraph using the command-line tool `lgraph_export`. The export format supports CSV and JSON.
+
+### 4.4.Backup and Restore
+
+ TuGraph's backup function can be divided into active/scheduled, offline/online, and full/incremental backup. The goal is to complete the backup with the smallest storage and computing costs possible. The Restore function can restore to the latest state or a historical marked time point, ensuring that the database is in a consistent state.
+
+### 4.5 Data Warmup
+
+TuGraph is a disk-based graph database, and data is loaded into memory only when it is accessed. Therefore, system performance may deteriorate due to frequent IO operations in the first period after the server is opened. We can improve this problem by preheating the data in advance.
+
+### 4.6 High Availability Mode
+
+High availability means that by configuring a cluster, real-time multi-replica data hot backup can be achieved, and the cluster can still provide services when some replicas are not in use. TuGraph uses the multi-machine hot backup mechanism of the RAFT protocol, which can reduce RPO to near 0. Data synchronization is performed at the computation layer through RPC interfaces for write operations. The high availability cluster of TuGraph adopts a master-slave mode, where only the master node processes write requests, and both master and slave nodes can process read requests. The write request processing of the master node needs to be synchronized to more than half of the total nodes. The write request is considered complete when the majority of the nodes have written successfully.
+
+## 5.Client Tools
+
+Client Tools Client tools mainly include SDKs for various programming languages, OGM, and command-line tools.
+
+The client SDK is mainly used for secondary development and can be linked to the server through RPC or REST protocols. RPC has better performance based on long links, and data needs to be uniformly serialized through protobuf. TuGraph uses brpc, which supports rpc clients in Java, Python, and C++. REST's protocol is more flexible and can be easily adapted to more diverse environments, and different programming languages can easily connect. TuGraph provides a Python REST client instance, and command-line interaction is also implemented using REST.
+
+OGM (Object Graph Mapping) is a graph object mapping tool for TuGraph, which supports mapping JAVA objects (POJO) to TuGraph. Classes in JAVA are mapped to nodes in the graph, collections in classes are mapped to edges, and properties of classes are mapped to properties of graph objects. It also provides corresponding function to operate the graph database. Therefore, JAVA developers can easily use TuGraph database in a familiar ecosystem.
+
+The command-line tool `lgraph_cypher` is a query client that can be used to submit OpenCypher requests to the TuGraph server. `lgraph_cypher` client has two execution modes: single-command mode and interactive mode.
+
+
+## 6.Ecological Tools
+
+Ecological tools are a crucial component of enterprise-level databases, and a rich array of ecological tools can greatly enhance the usability and stability of graph databases.
+
+### 6.1.TuGraph DataX
+
+![Import&Export](../../../images/tugraph-datax.png)
+
+TuGraph's core supports importing and exporting CSV and JSON data, offering both full database and incremental importing modes. In practice, there may be a need to import from multiple data sources such as MySQL, Kafka, and Hive, and TuGraph connects to these sources using DataX. Due to the differences between relational and graph models, data cleaning processes can be quickly processed using SparkSQL. TuGraph focuses only on the reliability and performance of simple CSV and JSON scenario imports.
+
+### 6.2.Visual Interaction
+
+TuGraph Browser is a visual interface for direct users of graph databases, covering most of TuGraph's capabilities, including data import, graph model building, data addition/deletion/query/modify, and monitoring and maintenance operations.
+
+### 6.3.Monitoring
+
+TuGraph uses the Prometheus + Grafana monitoring framework in a loosely coupled manner. Prometheus obtains monitoring information from TuGraph's monitoring interface, stores it in a local time-series database, and then displays it interactively on the web using Grafana.
+
+The monitoring states provided by TuGraph include the state of the graph database and the state of the server. The former includes the database-side status such as read/write load and number of vertices/edges, while the latter includes the real-time status of the server's memory, CPU, and hard disk. If some monitoring state exceeds the expected threshold, proactive alerts are necessary, usually requiring integration with other operations and control systems such as group messaging and email alerts.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..9d5a7ac434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# Scenarios
+
+> This document mainly introduces the application scenarios of graph databases.
+
+## 1.Financial Industry
+
+The entities in the financial industry mainly involve people, companies, accounts, products, etc., and their relationships include transaction relationships, logging relationships, equity relationships, employment relationships, etc. These entities form a financial graph data network. By applying graph databases, we can discover a lot of useful information from the financial graph data network, which helps us make more accurate financial decisions.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Loan review|By analyzing the applicant's relationship and transaction history, etc., it is auxiliary to judge the applicant's repayment ability and willingness. It can be applied to retail loan review, small and micro loan review, supply chain finance, etc. This method can complement the traditional audit mechanism based on the applicant's own information, which is particularly useful for small and micro loan audits with low individual information coverage.|
+|Post-loan|By analyzing the borrower's transaction history, it assists in analyzing whether the borrower has default risk. Compared with the traditional method of issuing alerts only when loan funds flow to specific users, this method can assign a risk value to each account and issue warnings when the loan flows to high-risk accounts.|
+|Missing recovery|By analyzing the social and shopping data of missing borrowers, other contact methods can be found. This method can significantly improve the recovery rate of missing borrowers.|
+|Guarantor loop detection|Special guarantee structures such as cyclic, chain, family-style, and cross can be found in the guarantee relationship graph to expose potential risks. Compared with the JOIN method of a relational database, the solution based on graph algorithms is more efficient, can detect any length of guarantee loop, and can achieve more complex limited condition detection.|
+|Credit card fraud detection|A relationship network of addresses, contact information, etc. in credit card application information is constructed, and a community discovery algorithm is run in the application relationship network to detect suspected fraudulent gangs, thereby rejecting suspected fraudulent applications and reducing economic losses.|
+|Anti-money laundering|Suspected money laundering behaviors and links can be found through the transaction network and medium network. Money laundering is a complex process involving multiple parties. By conducting graph analysis in transaction and social networks, we can more accurately detect money laundering behaviors.|
+|Car insurance anti-fraud|For insurance fraud involving repair shops, by analyzing the relationship between the insured person, the case location, and the repair shop, fraudulent claims can be more accurately identified, reducing economic losses.|
+
+## 2.Industrial Industry
+
+A large amount of heterogeneous data will be generated in the production and manufacturing process, and how to effectively organize and manage these data is one of the most important issues in industrial big data. These data include design documents, equipment data, simulation plans and results, experimental results, experience documents, etc. The relationships between these data are complex, and traditional data management systems can only accumulate data, and they are often unable to search for related materials. Using graph models, these different types of data are organized into a network, which makes it easy to browse and search for data.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Supply chain management|Supply chain data mainly concerns the correspondence between products, components, and parts, the correspondence between parts and suppliers, and sensitive components in parts. Compared with the traditional BOM system, the solution using graph databases can more conveniently maintain complex networks of multiple component levels and multiple supplier levels, thereby providing basic support for a through supply chain.|
+|Document management|Using graph databases can organize different types of documents together organically according to different relationships. For example, design documents for components, component-part relationships, component test documents, relevant experience documents, etc. can be organized together so that all relevant information for the component can be obtained easily when needed.|
+|R&D process management|A large amount of simulation, experimentation, and testing needs to be performed in the product development and verification process. Each test process involves many different steps, the connection between the steps, the data versions used in each step, and the algorithm versions all make up a complicated relationship network. Using graph databases can better manage this relationship network, providing a good foundation for data reuse and process improvement in the R&D process.|
+|Equipment information management|Manufacturing requires the management of a large number of devices, which are interrelated (power supply, feeding, spatial relationship) to form a complex network. Traditional databases are difficult to reflect this complex relationship. Using graph databases can easily represent these relationships, thereby better managing equipment information.|
+
+## 3.Smart City
+
+With the development of technology, intelligent management of cities has become a major trend. Intelligent management requires a strong system software to support it, built on a good information management platform. In an intelligent city management system, an intelligent decision-making system needs to make decisions based on a large amount of different information, including various topology information (such as roads, pipelines, etc.), supply and demand information (such as electricity transmission, drinking water supply, sewage discharge, etc.), environmental information (such as temperature, humidity, rainfall, etc.), and so on. To manage these complex and heterogeneous data organically and make decisions based on them, a mature system is needed. Traditional data management systems based on relational data models are not suitable for managing such complex and heterogeneous data. Using a graph model can solve this problem well. If we manage these different data using a graph database, we can achieve many complex intelligent management scenarios.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Smart Traffic|Based on road topology, road capacity, and current traffic flow, intelligent traffic signal scheduling can be performed to improve traffic efficiency.|
+|Smart Drainage|Based on drainage system information and current rainfall, the drainage system can be scheduled to reduce the occurrence of waterlogging.|
+|Pipeline Management|Organizing the production, installation, topology information, and historical status information of pipelines can help us manage the pipelines throughout their lifecycle, including fault diagnosis, life assessment, etc.|
+|Crowd Evacuation|When a large number of people need to be evacuated, multiple transportation modes such as buses, subways, taxis, shared bicycles, etc., need to be considered, as well as the road carrying capacity. Using a graph database to organically integrate this information can help us make better decisions and provide better support for large public events.|
+
+## 4.Social Governance
+
+Social governance involves public safety, legal affairs, public opinion, network security, and more. Social governance is a comprehensive, multi-system linkage problem. It requires the synthesis of a large amount of data and global considerations to make better decisions. In this multidimensional and complex data problem, the graph data model can provide better adaptability and provide a solid foundation for intelligent social governance decision-making platforms.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|Criminal Gang|Conspiratorial gangs will inevitably make contact through some means, including face-to-face meetings (appearing in the same place), phone calls, or internet contacts, and they may also have economic exchanges. If we store all of this data in a unified graph, we can use graph analysis algorithms to identify closely connected groups and then discover and identify the entire criminal gang.|
+|Stakeholder Case Investigation|Stakeholder cases, especially stakeholder economic cases, often involve a large number of personnel and elements (money, location, events, etc.). How to effectively organize this information to provide evidence for handling cases is a difficulty in stakeholder case investigation. Using graph databases to store and analyze this information can help us quickly locate the data, analyze the personnel structure, and provide better technical support for case investigation.|
+|Illegal Website Identification|Illegal websites, phishing websites, yellow websites, and so on, often use different domain names and IPs to avoid being blocked. The filter method based on a blacklist can only block known illegal websites and cannot effectively identify new domain names and IPs. Based on the IP-domain name network mapping relationship, we can create a graph and then use graph calculations to establish a "trustworthiness" model for domain names and IPs to determine whether a website belongs to an illegal website.|
+|Court File Management|Case files are often complex, and different cases may be linked through parties, locations, case nature, judges, and so on. These links constitute a complex network. Using a graph database, we can more conveniently manage these complex relationships and improve case handling and query efficiency.|
+
+## 5.Internet
+
+Social networks and person-product purchase relationships can all form a network. By analyzing this network data, we can provide users with better services, including relevant recommendations, user information collection, important user identification, and spam user identification, and so on.
+
+| **Scenario**         | **Description**               |
+|-----------------| -----------------------|
+|ID-Mapping|Graph databases can store all user-related information, including the relationships between users, in one database, and can also use these relationships to identify situations where one person has multiple accounts or multiple people share an account, thus providing decision support for future risk control, recommendations, and other businesses.|
+|Friend Recommendation|Based on the analysis of social networks, we can provide friend recommendations such as "friends of friends" and "common friends".|
+|Product Recommendation|Based on the user-product relationship graph, we can find users with similar interests and recommend other products that similar users have chosen.|
+|Spam User Identification|Traditional spam user identification is mainly based on user account information, such as registration information and posting information, but these types of information are relatively easy to forge. On the other hand, network-based information doesn't have this problem: it's difficult to forge. Therefore, spam user identification based on network information can be more accurate and efficient.|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..6f2aa1629a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/9.glossary.md
@@ -0,0 +1,27 @@
+# Glossary
+
+## 1.Graph Technology
+
+> __Graph Computing__:Generalized graph computing, including graph databases, graph analysis, and graph learning; Narrowly defined graph computing only includes graph analysis. The generalized definition is used by default.
+
+> __Graph Database__:Focuses on operations such as adding, deleting, modifying, querying, and transaction processing for graph data, such as TuGraph DB.
+
+> __Graph Analysis__:Focuses on algorithmic analysis and pattern analysis of entire graph data, such as TuGraph Analytics.
+
+> __Graph Learning__:Refers to the same meaning as graph neural networks and graph machine learning, such as TuGraph Learn.
+
+> __Graph Intelligence__:Same as generalized graph computing, including graph databases, graph analysis, and graph learning. It is usually used for conceptual promotion and not for products.
+
+## 2.Specific Concepts
+
+> __Vertex__:Also known as node or point. Avoid using the term "node" as it is often used to refer to the number of servers and can be easily confused. "Node" refers to the meaning of combination, intersection, and crossing; "node" can refer to a milestone on a timeline (key node) or a processing entity in a computer system (such as a server in a computer network).
+
+> __Edge__:Refers to the connection between two vertices.
+
+> __Degree__:Refers to the number of incoming or outgoing edges on a vertex. Note that in non-graph theory scenarios, "hops" are often referred to as "degrees".
+
+> __Hop__:Refers to the number of vertices between two vertices on a path (excluding the starting point and including the endpoint). "K-Hop" in the algorithm performance test refers to this meaning.
+
+> __Vertex Label__:Refers to the type of a vertex, also known as a point label.
+
+> __Edge Label__:Refers to the type of an edge, also known as an edge label.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/index.rst
new file mode 100644
index 0000000000..076b7d0434
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph DB Introduction
+=================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..3b527a1b1a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/1.preparation.md
@@ -0,0 +1,113 @@
+# Quick Start
+
+> This document is intended for new users to get started quickly and contains an introduction, features, installation, and use of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a large-scale graph computing system independently developed by Ant Group, providing graph database engine and graph analysis engine. Its main features are large data storage and computation, high throughput, and flexible API, while supporting efficient online transaction processing (OLTP) and online analytical processing (OLAP). LightGraph and GeaGraph are former names of TuGraph.
+
+The main functional features include:
+
+- Labeled property Graph Model
+- Support multiple Graphs
+- Full ACID transaction processing
+- Built-in 34 graph analysis algorithm
+- Graph visualization tool based on Web client
+- RESTful API and RPC are supported
+- OpenCypher graph query language
+- Stored procedure based on C++/Python/Java
+- The Traversal API for efficient graph algorithm development
+
+Performance and scalability features include:
+
+- TB large capacity
+- High throughput of ten million vertices per second
+- High Availability Support (Enterprise Edition)
+- High-performance Batch Import
+- Online/offline backup
+
+### 1.1.Supported Platforms
+
+TuGraph supports both X86_64 and ARM64 architectures in physical, virtual, and containerized environments.
+
+### 1.2.Hardware requirements
+
+_You are advised to use NVMe SSDS with large memory configurations for optimal performance。_
+
+| Hardware | Minimum Configuration | Recommended configuration |
+|----------|-----------------------|---------------------------|
+| CPU      | X86_64                | Xeon E5 2670 v4           |
+| Memory   | 4GB                   | 256GB                     |
+| Disk     | 100GB                 | 1TB NVMe SSD              |
+| System   | Linux 2.6             | Ubuntu 18.04, CentOS 7.3  |
+
+## 2.Installation
+
+TuGraph can be installed quickly via Docker Image or locally via RPM /deb packages.In addition, TuGraph offers community edition services on Alibaba Cloud Computing Nest, which means you don't need to purchase your own cloud host to quickly deploy TuGraph services and achieve operational monitoring, thus building your own graph application.
+
+> Installation package/image download: refer to the TuGraph-Latest-Version section in [Download address](../1.guide.md).
+
+> Computing Nest Deployment: You can search for it on Alibaba Cloud Computing Nest, or you can quickly access it through [deployment link] (../5.developer-manual/1.installation/5.cloud-deployment.md).
+
+### 2.1.Fast experience through Docker
+
+1. The Docker environment installed locally
+
+   The docker official documentation：https://docs.docker.com/get-started/
+
+2. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. Start docker
+
+The TuGraph service can be started in two ways. The first method integrates the image pull with the service startup, allowing users to execute the container-running operation to simultaneously start the TuGraph service. The second method involves manually entering the container after creating the TuGraph container to trigger the service startup. While this method may involve more initial steps, it offers greater flexibility for password resets in cases such as forgetting the password.
+
+**Method One**
+
+   ```shell
+    docker run -d -p 7070:7070  -p 7687:7687 -p 9090:9090 -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo ${REPOSITORY}:${VERSION}
+   
+   # ${REPOSITORY} is the image address,${VERSION} is the version number.
+   # 7070  is default http port，for tugraph-db-browser accessing..
+   # 7687 is bolt port, for neo4j client accessing.
+   # 9090 is default RPC port，for RPC client accessing.
+   
+   # The default data directory is /var/lib/lgraph/data and the default log directory is /var/log/lgraph_log,
+   # which is configured in the tugraph configuration file at /usr/local/etc/lgraph.json inside the docker.
+   # This command mounts the data directory and log directory to /root/tugraph/ on the host for persistence,
+   # which you can modify according to your actual situation.
+   ```
+
+**Method Two**
+
+   ```shell
+    docker run -dt -p 7070:7070  -p 7687:7687 -p 9090:9090 -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo ${REPOSITORY}:${VERSION} /bin/bash
+    
+    docker exec -it tugraph_demo bash
+    lgraph_server -c /usr/local/etc/lgraph.json -d start
+   
+   # ${REPOSITORY} is the image address,${VERSION} is the version number.
+   # 7070  is default http port，for tugraph-db-browser accessing..
+   # 7687 is bolt port, for neo4j client accessing.
+   # 9090 is default RPC port，for RPC client accessing.
+   
+   # The default data directory is /var/lib/lgraph/data and the default log directory is /var/log/lgraph_log,
+   # which is configured in the tugraph configuration file at /usr/local/etc/lgraph.json inside the docker.
+   # This command mounts the data directory and log directory to /root/tugraph/ on the host for persistence,
+   # which you can modify according to your actual situation.
+   ```
+
+
+4. Open by browser
+
+Accessing tugraph-db-browser: `http://x.x.x.x:7070`. The database address format is `bolt://ip:bolt_port`,Default account is `admin` and default password is `73@TuGraph`.
+The page will be redirected to the password modification page for the first login. Please modify the password according to the page prompt.
+
+### 2.2.Description of New and Old Front-ends.
+
+To access the container and choose between the old and new versions of the frontend, modify the configuration file located at "/usr/local/etc/lgraph.json". For the old version, change the value of the "web" parameter to "/usr/local/share/lgraph/resource"; for the new version, set it to "/usr/local/share/lgraph/browser-resource". Once you've finished editing the configuration file, run the command  `docker restart tugraph` to apply the changes. Bear in mind that the new version is the default selection.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..ddbb0f24f0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# DEMO:Movie
+
+> This document mainly introduces the usage of the movie demo.
+
+## 1.Modeling and Data Import
+
+After logging in, click "Create Graph Project", select the movie dataset, fill in the graph project configuration, and the system will automatically complete the creation of the Movie scenario graph project.Other scenarios can also be created in the same manner.
+
+Movie：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| Label       | Type   | Description                                                                                           |
+|-------------|--------|-------------------------------------------------------------------------------------------------------|
+| movie       | Vertex | Represents a specific movie, such as "Forrest Gump".                                                  |
+| person      | Vertex | Represents a person, who may be an actor, director, or screenwriter for a movie.                      |
+| genre       | Vertex | Represents the genre of a movie, such as drama, horror.                                               |
+| keyword     | Vertex | Represents some keywords related to the movie, such as "save the world", "virtual reality", "subway". |
+| user        | Vertex | Represents a user who watches movies.                                                                 |
+| produce     | Edge   | Represents the relationship between the producer of a movie.                                          |
+| acted_in    | Edge   | Represents the relationship between actors and the movies they have appeared in.                      |
+| direct      | Edge   | Represents the relationship between a movie and its director.                                         |
+| write       | Edge   | Represents the screenwriting relationship of a movie.                                                 |
+| has_genre   | Edge   | Represents the genre classification of a movie.                                                       |
+| has_keyword | Edge   | Represents some keywords of a movie, which are more specific labels for classification.               |
+| rate        | Edge   | Represents the rating given by a user to a movie.                                                     |
+
+## 2.Query Examples
+
+### 2.1.Example One
+
+Query all actors of the movie 'Forrest Gump' and return the subgraph composed of the movie and the actors.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.Example Two
+
+Query all actors of the movie 'Forrest Gump' and list the roles they played in the movie.
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.Example Three
+
+Query all movies rated below 3 by Michael.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.Example Four
+
+Query users who have the same dislike of movies as Michael, where the standard for dislike is a rating of less than three.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.Example Five
+
+Recommend movies to Michael by first finding users who dislike the same movies as Michael, and then filtering out the movies that these users like.
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.Example Six
+
+Query the movies that Michael's friends like.
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.Example Seven
+
+By querying the movies that people who gave 'Forrest Gump' a high rating also like, recommend similar movies to users who like 'Forrest Gump'.
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..0e2d1aec3c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,40 @@
+# DEMO:Wandering Earth
+
+> This document mainly introduces the usage of the Wandering Earth demo.
+
+## 1.Demo Scene Design
+
+The demo is based on the story background of The Wandering Earth 1 and The Wandering Earth 2.
+
+- Based on the plot, a graph structure is designed, including three types of points: organization, character, celestial body, and facility, and two types of edges: event and relationship.
+- Prepared data corresponding to the schema based on the plot.
+- Prepared some queries to ask questions about the plot.
+
+## 2.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 3.Data Import
+
+- Data storage directory: https://github.com/TuGraph-family/tugraph-db-demo.
+- Modify the DATA_PATH in import.json according to the corresponding data storage directory. For more details, please refer to [Data Importing](../../6.utility-tools/1.data-import.md).
+- After starting the TuGraph service, access ${HOST_IP}:7070 to open the web page and confirm whether the data is imported successfully.
+
+## 4.Cypher Query
+
+Refer to the Cypher document and enter Cypher in the TuGraph web page frontend for queries.
+
+## 5.Usage Display
+
+### 5.1.Data Import Display
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 5.2.Query Display
+Query all event processes related to the crisis on Jupiter.
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+Query all event processes related to all crises.
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..0e7791adc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,79 @@
+# The Three Body
+
+> This document mainly introduces the usage of Three-Body demo.
+
+## 1.Demo Scenario Design
+The demo scenario is designed based on the story background of Three-Body 1, 2, and 3.
+
+According to the setting of the Three-Body story, we have designed 4 types of nodes and 6 types of edges. The nodes include "character", "organization", "plan", and "timeline", while the edges include "character-character relationship", "character-plan relationship", "character-organization relationship", "organization-plan relationship", and "organization-organization relationship". According to the plot, corresponding schema data and some queries have been prepared to propose some questions about the plot.
+
+## 2.Instructions for Use
+
+Prerequisite: TuGraph is installed.
+
+## 3.Data Import
+
+- Manual import
+    - Data storage directory: https://github.com/TuGraph-family/tugraph-db-demo.
+    - Modify the DATA_PATH in import.json according to the corresponding data storage directory. For more details, please refer to [Data Importing](../../6.utility-tools/1.data-import.md).
+    - After starting the TuGraph service, access ${HOST_IP}:7070 to open the web page and confirm whether the data is imported successfully.
+- Automatic creation
+    - Click `New Graph Project`, select Three-Body data, fill in the graph project configuration, and the system will automatically create the Three-Body scenario graph project.
+
+## 4.Cypher Query
+
+Refer to the TuGraph documentation and enter Cypher in the TuGraph web page frontend to execute a query.
+
+## 5.Usage Demo
+
+### 5.1.Data Import Demo
+
+![data](../../../../images/three-body-data.png)
+
+## 6.Query Demo
+
+### 6.1.Character Relationship Query
+In the plot of Three-Body 1, a large number of scientists committed suicide all over the world at the beginning, which aroused the attention of the police. During the investigation process, the truth behind it gradually surfaced step by step according to the clues of the character relationships, as shown in the above graph. Shi Qiang and Wang Miao discovered that most people had direct or indirect connections with Ye Wenjie, and sent Wang Miao undercover to finally discover Ye Wenjie's ultimate commander identity. As can be seen in the graph, there are many edge relationships (many one-degree or two-degree neighbors) around Ye Wenjie's vertex.
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+### 6.2.Neighbor Vertex Analysis
+There are many plans in Three-Body, and sometimes we may be confused. At this time, we can use the graph's neighbor vertex query to view the relevant characters and organizations of the plan. For example, in the "Wallfacer Project", we can see that there are four characters related to it, and these four are also the "Wallfacers" who are highly expected by the world.
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+### 6.3.Query Common Neighbors of Node A and B
+We often want to know who are the common related characters between two characters, so that we can quickly grasp the relationship between these two characters. In the case of large amounts of data, it is very convenient to use Cypher for graph relationship analysis!
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+### 6.4.Set/Change Properties
+As the plot progresses, we gradually learn about the various labels on "Ye Wenjie", so we can also update these labels to the "Ye Wenjie" node:
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+### 6.5.Add/Delete Nodes
+Later, we learned about characters such as Luo Ji and Cheng Xin, and organizations such as PIA and the Star Ring Group, and wanted to add them as nodes to the graph:
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..9f48702097
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# Three Kingdoms
+
+> This document mainly introduces the usage of the Three Kingdoms demo.
+
+## 1. Introduction
+Due to the lack of historical records, there are often many mysteries surrounding even well-known historical events. Taking the history of the Three Kingdoms as an example, why did Zhuge Liang come out of seclusion to help Liu Bei, and why there was a huge gap in achievements between Cao Cao and Liu Bei, both heroes of the time, are some of the unsolved mysteries. Historians in the past often used two-dimensional relationship analysis of history, and the conclusions drawn were often one-sided. Using TuGraph to import historical figures and events of the Three Kingdoms into a graph model, and analyzing them using graph calculation methods can help us obtain more valuable knowledge from limited information, which is a very meaningful interdisciplinary attempt.
+## 2. Data Modeling
+We designed 5 types of vertices and 5 types of edges. The vertices include "Lord", "Province", "Civilian", "Military Officer", and "Battle"; the edges include "Father", "Brother", "Belongs To", "Native Place", and "Participate In". The specific modeling information is shown below:
+![image.png](../../../../images/three-kingdoms-schema.png)
+## 3. Data Import
+- Manual import
+    - Data storage directory: https://github.com/TuGraph-family/tugraph-db-demo.
+    - Modify the DATA_PATH in import.json according to the corresponding data storage directory. For more details, please refer to [Data Importing](../../6.utility-tools/1.data-import.md).
+    - After starting the TuGraph service, access ${HOST_IP}:7070 to open the web page and confirm whether the data is imported successfully.
+
+- Automatic creation
+    - Click `New Graph Project`, select the Three Kingdoms data, fill in the graph project configuration, and the system will automatically create the Three Kingdoms scene graph project.
+
+## 4. Cypher Query
+### 4.1. Why did Zhuge Liang Choose Liu Bei?
+The following Cypher command can be used to view the relationship between Zhuge Liang, Cao Cao, and Liu Bei:
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+From the graph, we can intuitively see that one of the shortest paths between Cao Cao and Zhuge Liang includes the battle of Xuzhou. Cao Cao once committed a massacre in Xuzhou because his father was killed, and nobody would choose a warlord who had previously massacred their hometown as their lord. In contrast, Liu Bei once prevented Cao Cao's violence during the battle of Xuzhou, which should be one of the reasons why Zhuge Liang had a good impression of Liu Bei.
+
+### 4.2. Why Did Cao Cao Achieve More Than Liu Bei?
+The following Cypher command can be used to view the family's support for Cao Cao's career:
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+The most important thing for pacifying the world is military talent. Cao Cao's father originally had the surname Xiahou, but was adopted into the Cao family. The Cao and Xiahou families were both local big clans in Qiao County, providing Cao Cao with a large number of military talents such as Xiahou Dun, Xiahou Yuan, Cao Ren, and Cao Hong in the early days of his career. In contrast, Liu Bei's father died early and he didn't have any family support. He only gathered his Five Tiger Generals when he was over 50 years old, by which time the best time to fight for land in the chaotic world had passed. Cao Cao had already controlled six of the nine provinces in the world.
+
+### 4.3. Why Did the Most Powerful Wei Kingdom in the Three Kingdoms Perish First?
+The following Cypher command can be used to view the important civilian officials of the Cao Cao group:
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+In fact, Cao Wei was overthrown in the Gao Ping Ling incident in 249 AD, after only 29 years of existence, which was shorter than Shu Han (43 years) and Dong Wu (51 years). The reason why the most powerful Wei Kingdom in the Three Kingdoms perished first was that the civilian official system of Cao Wei (the nine-rank system) made it easy for power to be concentrated in the hands of aristocratic families. From the graph, we can see that almost all the important civilian officials of Cao Cao and Cao Pi's generations were from aristocratic families, such as Xun Clan of Yingchuan, Zhong Clan of Yingchuan, Chen Clan of Yingchuan, Jia Clan of Wuxi, etc. There was even a trend of regionalization, centered on Yingchuan. Ultimately, the regime was usurped by the Sima family of Henei, which had close ties with the Xun Clan of Yingchuan.
+
+### 4.4. What Were the Strengths of Each of the Three Kingdoms?
+The following Cypher command can be used to view the population strength of each group in the Three Kingdoms:
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+The query result is shown in the following table:
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+In ancient society, an important indicator of a country's strength was its population. Since population data is missing, we estimate the population of each province using the birthplace data of all lords, civilians, and military officers in the Three Kingdoms. It is found that among the main characters of the Three Kingdoms, 60 belong to Wei, 23 belong to Wu, and only 2 belong to Shu, which proves that Wei was indeed the most powerful country in the Three Kingdoms.
+
+### 4.5. How Should Cao Cao's Military Ability Be Evaluated?
+The following Cypher command can be used to view the main battles that Cao Cao participated in:
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+The query result is shown in the following figure:
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+From the graph, we can see that Cao Cao participated in 8 out of the 15 major battles in the Three Kingdoms, with a high participation rate. However, Cao Cao only won the battles of Xuzhou, Yanzhou, Guandu, and Xiangyang, while losing the battles of Hanzhong, Wancheng, the Campaign against Dong Zhuo and the Battle of Red Cliffs. His overall win rate was 50%, which proves that Cao Cao was not a very outstanding military strategist.
+
+## 5. Remarks
+More analysis is needed and encouraged to be added by everyone!
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..42bf42db51
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Demo:Round The World
+
+> This document mainly introduces the usage of the round-the-world demo.
+
+## Brief
+
+Based on the virtual background of "Around the World in 80 Days" and partial public historical flight data, it helps users design optimal flight plans for multiple cities.
+- Demo designed custom website service
+- The data source is a foreign open source website and does not include mainland city flight data
+- The flight prices in the data are simulated data and do not represent real prices.
+
+## Example
+
+### Login Page
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### Query Page
+
+Click on the login page to enter the query page.
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### Query Example
+
+Select no more than 8 cities from the city list in the lower left corner, click Query to return the recommended flight plan, and return the 10 path plans with the lowest cost and shortest flight time, provided that the interval between previous and later flights is 2-6 hours.
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+For detailed instructions, see the [Round The World Demo](https://github.com/TuGraph-family/tugraph-db-demo/tree/main/round_the_world) document.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..106f943e05
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo example
+=============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..b2ed78a618
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+TuGraph DB Quick Start
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..f92f4766ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,662 @@
+# TuGraph Browser
+
+> This document focuses on the use of TuGraph Browser.
+
+## 1.Introduction
+
+TuGraph Browser (hereinafter referred to as Browser) is a powerful product visualization development tool that presents graph data in an intuitive visual way, allowing users to easily manage, maintain, and view the database running status. This tool not only supports graph data management and visualization but also supports system account management, providing users with a comprehensive operation and management experience, enabling users to manage and utilize graph databases more efficiently.
+
+## 2.User Guide
+
+### 2.1.Accessing
+
+After the user completes the installation of the graph database, they can access the Browser through a browser. Users only need to enter the IP:Port of the server where TuGraph is located in the browser address bar. The default port used is 7070.
+
+- For example:127.0.0.1:7070.
+- Recommend using Chrome.
+
+### 2.2.Logging in
+
+![login](../../../images/browser/login.png)
+
+- After successfully accessing the Browser, the login page appears first (as shown above), where users need to fill in their account and password to log in.
+- The database address format: bolt://ip:bolt_port.
+- Default account: admin.
+- Default password: 73@TuGraph.
+- After the user's first login, they will be redirected to the password modification page. Once the password is successfully modified, they can only use the new password to log in.
+
+### 2.3.Quick Start
+
+For first-time users of TuGraph, you can quickly build a graph project with the built-in demo data and get started with graph data projects quickly.
+
+#### 2.3.1.Creating a Graph Project
+
+In the `Graph Project` homepage tab, click `Create New Graph Project` to create a new graph project.
+
+![quickstart-creategraph](../../../images/browser/quickstart-creategraph.png)
+
+Select a built-in demo data, and click the `Next` button.
+
+![quickstart-selectdemo](../../../images/browser/quickstart-selectdemo.png)
+
+In the Fill in Configurations interface, enter the graph project information. Since the demo data is relatively small in size, set the Maximum Storage Space to 1 GB. After entering the graph project information, click the Create button, and the system will automatically create the graph model of the demo data and import the graph data.
+
+![quickstart-configure](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.Starting a Graph Project
+
+After creating a graph project with demo data, you can find the corresponding graph project in the `Graph Project` tab, and then click `Graph Query` to query graph data.
+
+![quickstart-graphtab](../../../images/browser/quickstart-graphtab.png)
+
+Execute the default query statement to browse the graph data in the demo.
+
+![quickstart-result](../../../images/browser/quickstart-result.png)
+
+For more quick start documents, please visit the[Quick Start Documents](../3.quick-start/1.preparation.md)
+
+### 2.4.Graph Project
+
+`Graph Project` provides visualized graph project management and graph data development functions, providing users with a series of convenient graph data visualization operations, including graph project creation, modification, deletion, and other management operations, as well as graph data queries, vertex-edge statistics, and other operations. In addition, it also supports graph model management, making it more convenient for users to manage and maintain graph data.
+
+#### 2.4.1.Graph Project Management
+
+On the `Graph Project` page, you can see the graph projects in the current graph database.
+
+![graphmanagement-homepage](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.Creating a Graph Project
+
+On the `Graph Project` page, click the `Create New Graph Project` button to create a new graph project.
+
+![graphmanagement-creategraph](../../../images/browser/graphmanagement-creategraph.png)
+
+Creating a new graph project requires completing the creation of the graph project through two pages: `Select Template` and `Fill in Configurations`.
+
+- __Select Template__: The product provides two types of templates: empty templates and demo templates.
+    - Empty templates: A brand new graph project where users need to create their own graph model and import graph data, generally used for formal project development.
+    - Demo templates: Built-in demo data in the product. After the graph project is created successfully, the system will automatically create a demo graph model and import demo graph data, usually used for trial and learning.
+
+![graphmanagement-selecttemplate](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __Fill in Configurations__: Users need to fill in basic information about the graph project and click the `Create` button to create the graph project.
+    - Graph Name: The name of the new graph project, which is also the unique primary key of the graph project. Supports Chinese characters, letters, numbers, and underscores, but does not support spaces or other special characters.
+    - Graph Description: The description of the new graph project can be used to describe the background and objectives of the project in detail.
+    - Advanced Configuration - Maximum Storage Space: Set the maximum storage space that the graph project can occupy. It does not actually occupy physical storage space in advance. After the actual data volume reaches the maximum storage space threshold, no more data can be written.
+
+![graphmanagement-configure](../../../images/browser/graphmanagement-configure.png)
+
+After creation, the graph project can be viewed in the graph project tab on the `Graph Project` page.
+
+##### 2.4.1.2.Editing a Graph Project
+
+On the `Graph Project` page, click the `Edit button` (pencil icon) in the graph project tab to edit the basic information of the corresponding graph project.
+
+![graphmanagement-editgraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+graphmanagement-editgraph-button
+
+![graphmanagement-editgraph](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.Deleting a Graph Project
+
+On the `Graph Project` page, click the `Delete` button (trash can icon) in the graph project tab to delete the corresponding graph project.
+
+![graphmanagement-deletegraph-button](../../../images/browser/graphmanagement-editgraph-button.png)
+
+_Note: Graph projects cannot be restored after deletion._
+
+##### 2.4.1.4.Vertex-Edge Statistics
+
+On the `Graph Project` page, click the `Vertex-Edge Statistics` button (line graph icon or refresh icon) in the graph project tab to count the number of vertexs and edges in the corresponding graph project.
+
+![graphmanagement-statistics-button](../../../images/browser/graphmanagement-statistics-button.png)
+
+The statistical results will be displayed on the graph project tab. Graph projects that have not been vertex-edge statistics will display `No vertex-edge data`, and graph projects that have already been vertex-edge statistics need to click the `Refresh` button to count again.
+
+![graphmanagement-statistics](../../../images/browser/graphmanagement-statistics.png)
+
+![graphmanagement-statistics-refresh-button](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+##### 2.4.1.5.Procedure
+
+In the `Graph Project` interface, click the `Procedure` button (the icon on the far right of the tab) to navigate to the page for operating stored procedures.
+
+![graphmanagement-procedure-button](../../../images/browser/graphmanagement-procedure-button.png)
+
+On the `Procedure` page, you can create a new stored procedure. When creating a new one, you need to fill in the "Stored Procedure Name," "Stored Procedure Type," and "Stored Procedure Description," and then select the "Version" and whether to modify the database during execution.
+
+![graphmanagement-procedure](../../../images/browser/graphmanagement-procedure.png)
+
+For more operations related to stored procedures, please refer to [Procedure](../9.olap&procedure/1.procedure/1.procedure.md)
+
+#### 2.4.2.Graph Building
+
+The `Graph Building` function in Browser is mainly used for graph project model definition and data import. On the `Graph Project` page, click the `Graph Building` button in the graph project tab.
+
+![graphbuild-button](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.Model Definition
+
+Browser provides a visualization way to create and maintain graph models.
+
+- Graph models can also be created and maintained through the `Cypher` tool and the `lgraph_import` tool. For details, please refer to the [Cypher API Document](../8.query/1.cypher.md) and [Data Import Document](../6.utility-tools/1.data-import.md).
+
+###### a.Browse Graph Models
+
+On the `Model Definition` page, you can view detailed graph model settings, support list and canvas view of the graph model, support list display of vertex type properties and indexes, edge type properties and start/end vertex types.
+
+![graphbuild](../../../images/browser/graphbuild.png)
+
+- Supports list view of vertex types and edge types.
+    - Supports the display of the number of vertexs or edges in the corresponding vertex type or edge type in the vertex type or edge type tab.
+    - Supports keyword search for vertex type or edge type names. Enter the keyword in the `search box` to display the corresponding vertexs or edges.
+
+        ![graphbuild-list-search](../../../images/browser/graphbuild-list-search.png)
+    - Supports copying vertex type or edge type names. Click the `Copy` button to copy the name of the vertex or edge to the clipboard.
+
+        ![graphbuild-list-copy](../../../images/browser/graphbuild-list-copy.png)
+    - Supports deleting vertex types or edge types. Click the `Delete` button to delete the corresponding vertex or edge.
+
+        ![graphbuild-list-delete](../../../images/browser/graphbuild-list-delete.png)
+- Supports canvas view of vertex types and edge types.
+- Clicking the corresponding vertex type or edge type in the list or canvas can display the model details.
+        ![graphbuild-select](../../../images/browser/graphbuild-select.png)
+
+###### b.Add Vertex
+
+Click the `Add Vertex` button on the `Model Definition` page to add a vertex type in the right sliding window.
+
+![graphbuild-addvertex-button](../../../images/browser/graphbuild-addvertex-button.png)
+
+The user needs to enter the Vertex type name, properties, and indexes, and click the `Complete` button to complete the creation of the Vertex type.
+- Vertex Type Name: The name of the Vertex, which is also the unique identifier of the Vertex.
+- Properties: The attributes of the Vertex, and one attribute needs to be used as the primary key.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating Vertexs.
+- Indexes: The indexing attributes of the Vertex, you need to create attributes first and then set the attribute as an index.
+    - Attribute: The attribute that needs to be indexed.
+    - Unique:Set the attribute field as a unique value.
+    - Primary Key: Whether the corresponding attribute is a primary key. The Unique option must be `Yes` after selecting `Yes`.
+    - Delete: Indexes can be deleted arbitrarily during Vertex creation.
+
+![graphbuild-addvertex](../../../images/browser/graphbuild-addvertex.png)
+
+- Edit Vertex: You can add Vertex properties, modify the data type of existing properties, and add or delete indexes. You need to click the `Save` button for each newly added or modified attribute to take effect.
+_Note: Once the primary key field attribute is created, it cannot be modified._
+
+![graphbuild-editvertex](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.Add Edges
+
+Click the `Add Edge` button on the `Model Definition` page to add an edge type in the right sliding window.
+
+![graphbuild-addedge-button](../../../images/browser/graphbuild-addedge-button.png)
+
+The user needs to enter the edge type name, properties, select the start vertex type and end vertex type, and click the `Complete` button to complete the creation of the edge type.
+- Edge Type Name: The name of the edge, which is also the unique identifier of the edge.
+- Properties: The attributes of the edge, which may not exist on the edge.
+    - Data Type: The data type of the attribute field, supports types such as INT, STRING, DOUBLE, DATE, DATETIME, BLOB, BOOL.
+    - Optional: Whether the attribute can be null.
+    - Delete: Attributes can be deleted arbitrarily when creating edges.
+- Selecting start vertex type and end vertex type: Set the start vertex type and end vertex type of the edge, and support multiple start vertex types and end vertex types.
+    - Start vertex: Select the vertex type of the start vertex.
+    - End vertex: Select the vertex type of the end vertex.
+    - At least one vertex type needs to be created in advance to set the start vertex type and end vertex of the edge.
+    - If not selected, it means that the start vertex and end vertex can be any vertex type, and the corresponding edge is not displayed on the canvas, and you need to view the edge type in the left list.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+- Edit Edge: You can add edge properties and modify the data type of existing properties. You need to click the `Save` button for each newly added or modified attribute to take effect.
+
+![graphbuild-addedge](../../../images/browser/graphbuild-addedge.png)
+
+###### d.Import Model
+
+Click the `Import Model` button on the `Model Definition` page to upload a model file and quickly create a model.
+
+![graphbuild-importmodel-button](../../../images/browser/graphbuild-importmodel-button.png)
+
+Click the `Upload File` button on the `Import Model` page to upload the model file. After the upload is successful, click `OK` to import the graph model.
+
+- Overwrite the current canvas model: If this option is selected, the existing graph model will be cleared before importing the graph model in the model file; if not selected, the vertex types and edge types in the model file will be imported, but the existing vertex types and edge types will not be modified.
+
+![graphbuild-importmodel](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.Export Model
+
+Click the `Export Model` button on the `Model Definition` page to export the graph model in the current graph project to a JSON file.
+
+![graphbuild-exportmodel-button](../../../images/browser/graphbuild-exportmodel-button.png)
+
+The model file is in JSON format and is not recommended to be manually modified.
+
+![graphbuild-exportmodel](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.Data Import
+
+After completing the `Model Definition`, click the `Next` button to enter the data import page.
+
+###### a.Data Preparation
+
+Data needs to be prepared in advance before importing data. The current browser supports the uploading of CSV files, and the data file suffix needs to be ensured to be CSV.
+- The header is not mandatory.
+- Text qualifiers are supported, and the text qualifier is double quotes. Data Import - CSV
+
+![graphbuild-import-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.Upload Files
+
+Upload the required data files on the `Data Import` page and import the data into the graph project.
+
+![graphbuild-import](../../../images/browser/graphbuild-import.png)
+
+- Separator: The column separator of the data file.
+- File upload: Supports uploading multiple files.
+    - Supports selecting multiple upload files in the pop-up window.
+    - Supports dragging and dropping files to upload on the page.
+    - Supports uploading vertex files and edge files at the same time.
+
+###### c.Data Mapping
+
+After the file is successfully uploaded, you need to set the `Data Corresponding Table` on the `Data Import` page to establish a mapping relationship between the data columns in the data file and the target vertexs/edges and corresponding attributes.
+
+- Data Corresponding Table: Displays uploaded data problems.
+    - File Name: The name of the uploaded data file.
+    - File Size: The size of the uploaded data file.
+    - Read Result: The result of uploading the data file, success means uploaded successfully.
+    - Delete: Delete on the page, the local file will not be deleted.
+- Data File Mapping: Each uploaded data file needs to configure a mapping relationship.
+    - Label: Select the corresponding vertex or edge type for the file, and you can only select one type of vertex or one type of edge.
+    - Starting from the Nth row: Start reading data from the Nth row. The system defaults to start reading data from the 0th row. To skip the header, you can enter 1.
+    - Attribute Mapping: Select the attribute field corresponding to the data column from the drop-down list.
+    - Data Preview: The system will pre-read the first 5 rows of the data file.
+
+![graphbuild-import-datamapping](../../../images/browser/graphbuild-import-datamapping.png)
+
+After the file is successfully uploaded, you can click the `Continue Import` button to continue importing other data or click the `Go to Graph Query` button to query the imported data on the `Graph Query` page.
+
+![graphbuild-import-success](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.Graph Query
+
+Click the `Graph Query` button in the `graph project tab` on the `Graph Project` page to query and access graph data in the graph project. The product provides multiple modes for querying graph data, such as Statement Query, Path Query, and Vertex Query, and supports switching between graph projects and query result display.
+
+![query-button](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.Switch Graph Project
+
+The `Graph Query` function can only access one graph project data. Users can select and switch to other graph data in the `Switch Graph Project drop-down list`.
+
+![query-selectgraph](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.Statement Query
+
+The Browser provides a visual way to develop and debug graph query statements. Users can enter graph query statements, execute and return results, and support collecting statements and viewing graph models.
+
+![query-view](../../../images/browser/query-view.png)
+
+###### a.Statement Query Window
+
+Users enter graph query statements in the `Statement Query Window`, click the `Execute` button to run the corresponding statement, and display the result in the `Execution Result tab`.
+
+- Switch Query Language: Provides switching between different graph query language modes.
+    - _Currently only supports Cypher syntax._
+
+![query-selectgql](../../../images/browser/query-selectgql.png)
+
+- Statement Query Window: Provides syntax prompts for the current query language.
+
+![query-gqltips](../../../images/browser/query-gqltips.png)
+
+- Execute: Click the `Execute` button to send the entered query statement to the background for execution.
+
+![query-execute-button](../../../images/browser/query-execute-button.png)
+
+- Bookmark: Click the `Bookmark` button to save the content of the current statement query window as a template for future use.
+
+![query-bookmark-button](../../../images/browser/query-bookmark-button.png)
+
+- Download: Click the `Download` button to save the content of the current statement query window as a text file and download it to the local computer for future use.
+
+![query-download-button](../../../images/browser/query-download-button.png)
+
+For detailed Cypher usage guidelines, please refer to the document: [Cypher API](../8.query/1.cypher.md)
+
+###### b.Bookmark List
+
+Displays the collected query statements in a list, and clicking on a bookmark in the list allows using the statement. Supports keyword search, name modification, and deletion.
+
+![query-bookmark](../../../images/browser/query-bookmark.png)
+
+###### c.View Graph Model
+
+The Browser provides a graph model query for the current graph project, which allows users to query vertex types and edge types conveniently. It supports both list display and canvas graph display, and can be hidden.
+
+![query-schema-list](../../../images/browser/query-schema-list.png)
+![query-schema-graph](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.Path Query
+
+The Browser provides `Path Query templates`. Users can search whether corresponding paths exist in the graph data of the graph project by selecting paths.
+
+![pathquery-result](../../../images/browser/pathquery-result.png)
+
+- Path: Select the path to search in the path selection drop-down list.
+    - Select a Path: Based on the definition of the graph model, the system will automatically match the corresponding first-degree relationship path. Clicking the path drop-down box again will automatically match the next-degree relationship path based on the endvertex vertex type of the path.
+![pathquery-select](../../../images/browser/pathquery-select.png)
+    - Execute: Click the `Execute` button to return the matched paths in the graph project.
+    - Advanced Configuration: Set the number of paths to scan. The default is 100 paths.
+![pathquery-configuration](../../../images/browser/pathquery-configuration.png)
+
+_Note: The edges in the graph model need to set the starting vertex and endvertex. If no edge in the graph project has set the starting vertex and endvertex, the drop-down list will have no results._
+
+##### 2.4.3.4.Vertex Query
+
+The Browser provides `Vertex Query templates`. Users can query vertex data in the graph project by selecting vertex attributes.
+
+![vertexquery](../../../images/browser/vertexquery.png)
+
+##### 2.4.3.5.Execution Result Tab
+
+The Browser provides multiple ways to display graph query results, such as JSON view, JSON text, vertex-edge list, and vertex-edge view. It supports result download, data insertion, and full-screen display.
+
+###### a.Text
+
+![query-result-jsontxt](../../../images/browser/query-result-txt.png)
+
+###### b.Vertex-Edge View
+
+The Browser provides canvas view to display query results.
+
+![query-result-graph](../../../images/browser/query-result-graph.png)
+
+###### c.Data Insertion
+
+The Browser provides a visual way to insert vertex or edge data in the corresponding graph project. Click the `Insert Data` button, select the Vertex Type or Edge Type on the Insert Data tab, enter the attribute values, and click `OK` to complete the data insertion.
+
+![query-result-insert-button](../../../images/browser/query-result-insert-button.png)
+
+![query-result-insert](../../../images/browser/query-result-insert.png)
+
+###### d.Download Execution Result
+
+The Browser provides a function to export graph query results as text files. Click the `Download Execution Result` button, and the system will automatically save the result as a text file and download it to the local computer.
+
+![query-result-download](../../../images/browser/query-result-download.png)
+![query-result-downloadtxt](../../../images/browser/query-result-downloadtxt.png)
+
+###### e.Full-Screen Display
+
+The Browser provides full-screen display for graph query results. Click the `Full-Screen` Display button to display the results in full screen, and click the `Exit Full Screen` button to exit full-screen display.
+
+![query-result-fullscreen-button](../../../images/browser/query-result-fullscreen-button.png)
+![query-result-fullscreen](../../../images/browser/query-result-fullscreen.png)
+![query-result-fullscreen-close](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.Graph Analysis
+
+Click the `Graph Analysis` button in the `Graph Project` tab in the `Graph Project` interface to display and analyze graph data on the canvas. The product provides `Query by Statement` and `Query by Configuration` to query and load data from the graph project to the canvas. It supports filtering, layout adjustment, and canvas operations on the canvas data.
+
+![graphanalysis-button](../../../images/browser/graphanalysis-button.png)
+
+As shown in the figure below, the graph analysis function mainly includes: 1. Operation bar: the main operation functions of graph analysis, including view switching, query filtering, layout style, and canvas operations; 2. Left sidebar: query, filter, and appearance operation area; 3. Canvas area: the area for displaying graph data, displaying vertex and edge data, supporting vertex expansion query, collapsing vertexs, fixing vertexs, deleting vertexs, and providing canvas graph data statistics; 4. Right sidebar: when a vertex or edge data is selected, the corresponding attribute information will be displayed; 5. Switch graph project: switch to different graph projects for analysis.
+
+![graphanalysis-operation-area](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.Query by Statement
+
+In the `Query by Statement` function, users can enter query statements to query graph data and load the data to the canvas area for display.
+- Syntax Description: TuGraph's query language and syntax documentation.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-query](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.Query by Configuration
+
+In the `Query by Configuration` function, users can select vertex types and enter attribute conditions to query graph data and load the data to the canvas area for display.
+- Clear Canvas Data: If this button is not selected, the results of each query will be appended to the canvas area; if this button is selected, the canvas will be cleared before each query.
+
+![graphanalysis-queryfilter-configurequery](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.Canvas Analysis
+
+In the `Canvas Analysis` function, users can perform operations and analysis on the vertex or edge data on the canvas, including: expanding queries by selecting vertexs, collapsing/expanding vertexs, fixing vertexs, clearing the canvas, lassoing, vertex/edge retrieval, and canvas legend. The most basic operation on the canvas is dragging vertex data. By selecting a vertex with the left mouse button and moving the mouse, the position of the vertex data can be changed.
+
+###### a.Expand Query
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, move the mouse to `Expand Query`, and a secondary window will pop up. Click on the corresponding expansion degree to perform the query.
+- First-degree Query: Bidirectional expansion of first-degree relationships.
+- Second-degree Query: Bidirectional expansion of second-degree relationships.
+- Third-degree Query: Bidirectional expansion of third-degree relationships.
+
+![graphanalysis-canvas-expand-before](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![graphanalysis-canvas-expand-after](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+
+###### b.Collapse/Expand Vertexs
+
+Right-click on a vertex data in the `Canvas` area, a pop-up operation window will appear, click on `Collapse Vertexs` to hide the first-degree relationship Vertexs of the selected Vertexs; right-click on the collapsed Vertex data again to perform Expand Vertexs operation to show the hidden first-degree relationship Vertexs.
+
+![graphanalysis-canvas-collapse](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![graphanalysis-canvas-expand](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.Delete Vertex
+
+Right-click on a vertex in the `Canvas` area to open the operation window. Click on `Delete Vertex` to remove the selected vertex from the canvas.
+
+![graphanalysis-canvas-delete](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### d.Clear Canvas
+
+Click on the `Clear Canvas` button in the `Toolbar` area to clear all data on the canvas.
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### e.Vertex/Edge Retrieval
+
+Select a vertex or edge in the `Vertex/Edge Retrieval` window and enter a keyword to perform a fuzzy search for attribute data on the canvas. After the search, you can locate the data position.
+
+![graphanalysis-canvas-retrieval](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### f.Canvas Legend
+
+In the legend area of the `Canvas` area, the vertex types in the canvas will be displayed. Click on a vertex type to select the corresponding vertex data. Click on the "More" button to display the statistics, which can be displayed in a list or chart format to show the number of vertexs or edges.
+
+![graphanalysis-canvas-legend-list](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![graphanalysis-canvas-legend-chart](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+###### g.Zoom/Center
+
+You can zoom in and out using the mouse wheel and the zoom buttons.
+![graphanalysis-canvas-zoom](../../../images/browser/graphanalysis-canvas-zoom.png)
+![graphanalysis-canvas-center](../../../images/browser/graphanalysis-canvas-center.png)
+
+##### 2.4.4.4.Attribute Filter
+
+Click on the `Filter` button in the `Toolbar` area, and click on `Attribute Filter` in the `Sidebar` to perform filter and filtering. Users can select the vertex or edge types to be filtered, and set the corresponding attribute values. After retrieving the filtered group conditions, the corresponding vertex or edge data will be highlighted on the canvas.
+- Please select the vertex/edge type: Select the vertex type or edge type to be searched.
+- Attribute condition: Set the attribute conditions to be searched. Multiple groups can be set to take the union of the filtering results.
+- Add filter group: Multiple filter conditions can be set to take the union of the filtering results.
+- Reset: Clear the filter conditions.
+
+![graphanalysis-queryfilter-attributefilter](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.Statistical Filter
+
+Click on the Filter button in the Toolbar area, and click on Statistical Filter in the Sidebar to perform statistical filtering of canvas data. Users can select the vertex or edge types to be counted, and set the corresponding attribute values. The system will automatically group and count based on the selected vertex/edge types and attributes. The results can be displayed in chart and list formats. Clicking on the values in the chart or list area will highlight the corresponding data on the canvas.
+
+![graphanalysis-queryfilter-statisticalfilter](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![graphanalysis-queryfilter-statisticalfilter-chartswitch](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.6.Layout Style
+
+Click on the `Layout` button in the `Toolbar` area, and select the corresponding layout method to rearrange the data on the canvas. It supports force-directed layout, concentric circle layout, circular layout, radial layout, Dagre layout, and grid layout. Each layout method has different layout parameters. After adjusting the parameters, the data on the canvas will be rearranged.
+
+![graphanalysis-style-layout-button](../../../images/browser/graphanalysis-style-layout-button.png)
+![graphanalysis-style-layout-parameters](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+For detailed layout parameters, please refer to[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide).
+
+##### 2.4.4.7.Appearance Style
+
+Click on the `Appearance` button in the `Toolbar` area, and click on `Vertex Style` or `Edge Style` in the `Sidebar` to configure the appearance style.
+- Vertex Style
+    - Apply to vertex type: Set the display style for the corresponding vertex type. Multiple vertex types can be configured simultaneously.
+    - Size: The display size for the corresponding vertex type.
+    - Color: The display color for the corresponding vertex type.
+    - Icon: The icon style for the corresponding vertex type.
+    - Display Text: The text content displayed for the corresponding vertex type, defaulting to id.
+    - Advanced Configuration: Mark the corresponding vertex data based on the set conditions.
+- Edge Style
+    - Apply to Edge Type: Set the display style for the corresponding edge type, supports configuring the appearance of multiple edge types simultaneously.
+    - Color: The display color for the corresponding edge type.
+    - Width: The display width for the corresponding edge type.
+    - Display Text: The text content displayed for the corresponding edge type, not displayed by default.
+    - Advanced Configuration: Display the corresponding edge data based on the set conditions.
+
+![graphanalysis-style-appearance](../../../images/browser/graphanalysis-style-appearance.png)
+
+##### 2.4.4.8.View Switch
+
+In graph analysis, 2D graph view, list view, and JSON view are supported.
+![图分析-视图-2D](../../../images/browser/graphanalysis-view-2D.png)
+![图分析-视图-list](../../../images/browser/graphanalysis-view-list.png)
+![图分析-视图-json](../../../images/browser/graphanalysis-view-json.png)
+
+##### 2.4.4.9.Label/Card Layout Switch
+
+Graph analysis supports label layout and card layout.
+![图分析-标签](../../../images/browser/graphanalysis-tag.png)
+![图分析-卡片](../../../images/browser/graphanalysis-card.png)
+
+### 2.5.Console
+
+The `Console` provides a visualized account management and database information viewing function. It provides users with comprehensive account and role management functions, including adding, deleting, modifying, and disabling accounts and roles. In addition, it also provides users with convenient database information viewing function, allowing users to easily view the basic information and configuration information of the graph database. Basic information mainly includes version number, running time, CPP compilation version number, etc., while database configuration information includes port number, system function parameter configuration, etc.
+
+#### 2.5.1.Account Management
+
+##### 2.5.1.1.Account Management
+
+##### a.Add Account
+
+Click the `Add` button in the `Account Management` interface to create a new account. Users need to enter the account name, account description, account password, and related roles.
+
+- Account Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Related Roles: When creating a new account, you must select a role. After the account is added successfully, the system will automatically generate a role with the same name as the account name.
+
+![account-add-button](../../../images/browser/account-add-button.png)
+![account-add](../../../images/browser/account-add.png)
+
+##### b.Edit Account
+
+Click the `Edit` button in the `Account Management` interface to edit the account description, account password, and related roles.
+
+![account-edit](../../../images/browser/account-edit.png)
+
+##### c.Disable Account
+
+Click the `Disable` button in the `Account Management` interface to prevent the corresponding account from logging in and accessing. Click the `Enable` button to enable the corresponding account login and access permissions.
+
+![account-disable](../../../images/browser/account-disable.png)
+![account-enable](../../../images/browser/account-enable.png)
+
+##### d.Delete Account
+
+Click the `Delete` button in the `Account Management` interface to delete the corresponding account.
+
+![account-delete](../../../images/browser/account-delete.png)
+
+#### 2.5.1.2.Role Management
+
+##### a.Add Role
+
+Click the `Add` button in the `Role Management` interface to create a new role. Users need to enter the role name, role description, and graph permissions.
+
+![role-add-button](../../../images/browser/role-add-button.png)
+
+- Role Name: supports Chinese, letters, numbers, and underscores, but does not support spaces or other special characters.
+- Graph Permissions: The browser supports four types of graph permission configurations: All, Read/Write, Read-Only, and None.
+    - All: corresponds to the read and write permissions of the graph, including editing the graph model permissions (schema).
+    - Read/Write: corresponds to the write permission of the graph, but does not include the permission to edit the graph model (schema).
+    - Read-Only: corresponds to the read permission of the graph.
+    - None: cannot access or operate the corresponding graph.
+- Role Conflict: When two roles have different graph permissions for the same graph, and both roles are authorized to the same account, the graph permission of the account for the graph is the union of the graph permissions of the two roles.
+
+![role-add](../../../images/browser/role-add.png)
+
+##### b.Edit Role
+
+Click the `Edit` button in the `Role Management` interface to edit an existing role. Users can edit the role description and graph permissions.
+
+![role-edit](../../../images/browser/role-edit.png)
+
+##### c.Disable Role
+
+Click the `Disable` button in the `Role Management` interface to disable the corresponding role. Click the `Enable` button to enable the corresponding role. After the role is disabled, the corresponding graph permissions of the role become invalid.
+
+- Disabled Role: After the role is disabled, the corresponding graph permissions become invalid.
+    - When a user has two roles with operating permissions on the same graph, if one of the roles is disabled, the permission of the other role is still valid.
+
+![role-disable](../../../images/browser/role-disable.png)
+![role-enable](../../../images/browser/role-enable.png)
+
+##### d.Delete Role
+
+Click the `Delete` button in the `Role Management` interface to delete the corresponding role.
+
+![role-delete](../../../images/browser/role-delete.png)
+
+#### 2.5.2.Database Information
+
+##### 2.5.2.1.Basic Information
+
+`Basic Information` obtains the current running status of the system and displays key information.
+
+![db_basic](../../../images/browser/db_basic.png)
+
+|Parameter    |Meaning    |
+|-------|--------|
+|TuGraph Version Number|The current version number of TuGraph, x.x.x|
+|Running Time|The time from when TuGraph service starts to now|
+|Server Code Version|The current commit of the tugraph-db repository|
+|Front-end Code Version|The current commit of the tugraph-web repository|
+|CPP Compiler Version|The CPP version number when compiling TuGraph|
+|Python Version Number|The Python version number when compiling TuGraph|
+|CPP Compiler ID|The CPP type when compiling TuGraph|
+
+The current running status of the system can also be obtained through commands.
+
+```cypher
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.Database Configuration Information
+
+`Database Configuration Information` obtains the current configuration parameters of the system and displays key information. To adjust the configuration parameters or understand the detailed configuration parameters, please refer to [Database Running-Service Configuration](../5.installation&running/7.tugraph-running.md).
+
+![db_configuration](../../../images/browser/db_configuration.png)
+
+| Parameter                   | Meaning                                                                                                                                 |
+|-----------------------------|-----------------------------------------------------------------------------------------------------------------------------------------|
+| bind_host                   | The host set when the system starts, usually 0.0.0.0                                                                                    |
+| browser.credential_timeout                   | Browser cache expiration time for usernames and passwords                                                                               |
+| browser.retain_connection_credentials                   |  whether the browser caches usernames and passwords                                                                                     |
+| disable_auth                | Whether to disable the regular update of token authentication. If set to true, the token can be used permanently                        |
+| durable                     | Whether to enable persistent storage of the underlying layer. If set to false, the data is updated asynchronously to the disk           |
+| enable_audit_log            | Whether to enable audit log                                                                                                             |
+| enable_backup_log           | Whether to enable real-time incremental backup                                                                                          |
+| enable_fulltext_index       | Whether to enable full-text indexing                                                                                                    |
+| enable_ha       | Whether to enable ha                                                                                                                    |
+| enable_ip_check             | Whether to enable IP whitelist                                                                                                          |
+| enable_rpc                  | Whether to enable the RPC port                                                                                                          |
+| enable_ssl                  | Whether to enable SSL encrypted transmission                                                                                            |
+| optimistic_txn              | Whether to enable optimistic multi-threaded write transactions                                                                          |
+| port                        | The REST access port of the current system                                                                                              |
+| rpc_port                    | The port used by the RPC and HA services                                                                                                |
+| subprocess_max_idle_seconds | The maximum idle time of the subprocess, a thread pool parameter                                                                        |
+| thread_limit                | The maximum number of threads used by the server at the same time                                                                       |
+| verbose                     | The level of detail of the log output information. It can be set to 0, 1, or 2, with larger values indicating more detailed output information |
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..c0a3a1674b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# TuGraph Browser(old version)
+
+> This document focuses on the use of TuGraph Browser
+
+## Definition
+
+TuGraph Browser is a visual development tool provided by TuGraph.
+
+## Functionality
+
+TuGraph Browser provides graph database developers with functions such as visual graph data development, graph data management and maintenance.
+
+## How to use it
+
+### 1. Connect to the database
+
+When the user completes the installation of the graph database, you can access it through the Browser, TuGraph Browser tool. The user only needs to type in the browser address bar: IP of the server where TuGraph is located :Port. The default port is 7090.
+
+### 2. Login
+
+![alt Login](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- When the page is opened successfully, the first thing you see is the login page, and the user needs to fill in the account number and password to log in.
+- Default account: admin
+- Default password: 73@TuGraph
+- It is recommended that users change the initialized password in time after logging in
+
+### 3. Workbench
+
+#### 3.1 Quick Start
+
+- When you log in for the first time, the system will create an empty graph by default
+
+  ![alt quick start](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- The user clicks on the help option and selects Get Started quickly
+
+  ![alt help](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- Then click "One-click Create Model" -- >" One-click Create Data "to complete the construction of the built-in Movie data graph
+
+#### 3.2 Create subgraphs and examples
+
+##### 3.2.1 Create a subgraph
+
+- Click on New subgraph
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- Fill in the form information
+  ![alt Fill out the form](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+- Subgraph name
+- Subgraph description
+- Configuration information
+- Click OK to prompt that creation succeeded
+- Toggle the subgraph
+  ![alt Toggle subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- Click New Example
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- Select the example and click Create
+  ![alt Create subgraph](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 query
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 User Interface Layout
+
+- Cypher input box
+- Result set display area
+
+##### 3.3.2 Result set display area function details
+
+- Result set tag display and functions
+  ![alt Result set tag](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+- All types of statistics for the result set are shown here
+- Click on the different "label" to make the following changes
+  -Change the display color
+- Modify the node size or edge thickness
+- Modify default display properties or system properties
+- Layout modification
+- Force guide layout
+- Grid layout
+- Tree layout
+- Environment layout
+- edge polymerization
+- Edges of the same type and direction can be merged
+- Create nodes
+- Click the Create Node button
+- Select the node type
+- Add node content
+- Create relationships
+- Select start and end points in the canvas
+- Select the type that can be matched
+- Enter node information
+- Stop layout
+- When too much data is causing the browser page to stall, you can click this stop layout button to improve the smoothness of the experience
+- Mouse hover
+- Enable this feature to highlight the one-degree neighbors of the mouse-over node
+- Result set export
+- Result sets can be exported as png, json, csv three different file forms
+- the refresh
+- Clicking the refresh button will re-execute the initial cypher statement for the current page and refresh the result set
+  Maximize -
+  -Click Maximize button, the result set display area will be displayed in full screen
+- Result set display mode switching
+  - Support graph, table and text modes
+
+##### 3.3.3 Schema
+
+- model
+  ![Modeling Alt](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- schema supports real-time addition, deletion, modification and query
+
+- schema supports import and export
+
+##### 3.3.4 Data import
+
+- Local data import
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+- Select the file encoding format
+- Select a local CSV file
+- Select the model for the corresponding node or edge
+- Do the data mapping
+- Complete the data import
+- The maximum supported size for a single file is 2GB.
+
+##### 3.3.5 plug-in (Stored Procedure)
+
+- Use of plug-ins
+
+![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+- Users can upload the plug-in program written locally, execute it in the visual page, and view the execution result
+- Users can perform, uninstall, execute, and download plug-ins in the visualization page
+
+##### 3.3.6 Help
+
+- where it records how TuGraph-browser is used
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 Console
+
+##### 3.4.1 Basic database information
+
+- Displays basic database configuration information
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 Permission management
+
+- A function module used to create users and roles. Users can manage permissions here
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 Live status
+
+- This shows the database real-time status, including: CPU usage, memory usage, disk usage, number of data requests, disk IO
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 Task Management
+
+- Here the user can see the task in execution and stop the task
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 Audit logs
+
+- Database related audit logs recorded here, used to troubleshoot problems encountered in use
+  ![alt Query](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..6c4d063e26
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB User Guide
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..f2cdffe578
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/1.environment.md
@@ -0,0 +1,41 @@
+# Environment
+
+> This document provides an overview of the required hardware and software environment for deploying TuGraph.
+
+## 1.Hardware Environment
+
+### 1.1. CPU
+TuGraph supports X86_64 and ARM64 architectures for both physical, virtual, and containerized environments. Tested and certified hardware platforms include Intel, AMD, Kunpeng, Hygon, Feiteng, and others.
+
+### 1.2. Memory
+We recommend having a memory capacity that is equal to or greater than the actual data size. For optimal performance, caching all data in memory is ideal. In terms of data locality, graph databases have poorer locality compared to relational databases. Therefore, if the data cannot fit in memory, frequent swapping may occur.
+
+### 1.3. Storage
+We strongly recommend using NVMe SSD as external storage. The database performs numerous synchronous write operations, often in a random manner, making the read/write performance of the external storage critical to the overall database performance. Hence, high IOPS and low-latency NVMe SSDs are the optimal choice.
+
+If circumstances permit only the use of SATA interface SSDs or cloud-based network disks, although performance may be affected, TuGraph can still run correctly.
+
+It is recommended to have external storage size at least four times the actual data size. For example, if the data size is 1TB, preparing a 4TB hard drive would be more reliable.
+
+
+
+## 2. Software environment
+
+### 2.1. Operating System
+
+TuGraph is compatible with popular operating systems, including Ubuntu, CentOS, SUSE, Galaxy Kylin, China Standard Software, UOS, and others, all of which have been tested and certified.
+
+Among them, the most stable system versions are Ubuntu 18.04, CentOS 7, and CentOS 8.
+
+### 2.2. System Libraries
+
+The requirements for system libraries differ between the compilation environment and the runtime environment. For specific details, please refer to the[environment mode](2.environment-mode.md)。
+
+## 3.Recommended Configuration
+
+| Hardware | Minimum Configuration	   | Recommended Configuration                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| Memory   | 4GB       | 512GB                    |
+| Storage  | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..98f9820ba2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,24 @@
+# Environment Mode
+
+> This document primarily introduces the three types of environments involved in TuGraph.
+
+## 1.Classification
+
+Based on the different functionalities supported by the environments, they can be categorized into the following:
+
+* The compilation environment has all dependent libraries for TuGraph compilation, including all dependencies of the running environment, and can compile TuGraph source code, but does not include precompiled TuGraph executable files and library files for developers to compile source code.
+
+* Running environment, with GCC/Java/Python environment, can run all functions of TuGraph, and can host full-text indexing, java client, c++ source code uploaded as plugin, and complete functions of python plugin, built-in TuGraph precompiled executable file and library files for customers to install and use directly without compiling source code.
+
+* Simplified operating environment, which is approximately equivalent to a bare system plus precompiled TuGraph. It can only run the basic functions of TuGraph. There is no C++ plugin to compile and run, only so upload, no full-text index, and no python plugin. It is for quick setup and trial use.
+After compiling TuGraph, all the required dependencies are packaged together in the form of .a files, eliminating the need for unnecessary additional dependencies during runtime. However, since TuGraph supports stored procedures, which involve compiling C++ code on the server, the required compilers still need to be present in the environment.
+
+## 2.System Library
+
+For the three types of environments, the required system libraries, excluding the TuGraph runtime package, are as follows:
+
+* Compilation Environment: It includes GCC, Python, Java compilers, as well as libraries such as ANTLR4 and Pybind11. Please refer to the tugraph-compile-*-Dockerfile for more details.
+
+* Runtime Environment: The main dependencies introduced by stored procedures include GCC, Boost, CMake, and others. Please refer to the tugraph-runtime-*-Dockerfile for more details.
+
+* Mini-Runtime Environment: There are no additional system library dependencies. Please refer to the tugraph-mini-runtime-*-Dockerfile for more details.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..ae8728f68d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,128 @@
+# Docker Deployment
+
+>This document introduces the creation and download of Docker images for TuGraph Compile and TuGraph Runtime.
+
+## 1.Introduction
+
+- TuGraph Compile Image: Provides a compilation environment and can be used for TuGraph compilation and testing.
+- TuGraph Runtime Image: Provides a binary executable environment with TuGraph library and executable files.
+- TuGraph Mini Runtime Image: Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+## 2.Existing Docker Images
+
+### 2.1.Image Download
+
+The images are hosted on [DockerHub]( https://hub.docker.com/u/tugraph ) and can be downloaded and used directly.
+
+For the latest version of Docker address, see the TuGraph-Latest-Version section in [Guide](../../1.guide.md).
+
+### 2.2.Naming Convention
+
+#### 2.2.1.TuGraph Compile Image
+
+Provides a compilation environment and can be used for TuGraph compilation.
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+For example: `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+Provides a binary executable environment with TuGraph library and executable files.
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example:`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+Provides a binary executable environment without Java and Python functions in TuGraph, no C++ plugin compilation and execution, only so upload.
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+For example: `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.Common Docker Operations
+
+Docker is generated from Dockerfile. Note that creating images requires downloading dependencies, so network issues may cause slow creation or creation failure. Do not overwrite images unless the tag is `latest`.
+
+build Compile image
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+build Runtime / Mini Runtime image
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+Modify image name
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+push image
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+pull image
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+save image
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+load image
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+Refer to the [docker official documentation](https://docs.docker.com/engine/reference/commandline/cli ) for other Docker operations.
+
+### 2.4. M1 Supports
+
+Running amd64 containers on M1-chip machines may cause unknown errors. TuGraph provides arm64 images for M1 machines. Contains compile and runtime images.
+
+In `tugraph-runtime-centos7:3.6.0` and `tugraph-compile-centos7:1.2.7` and later, `tugraph-runtime-centos7` and `tugraph-compile-centos7` provide images of two architectures: linux/amd64 and linux/arm64/v8. You can obtain the arm64 architecture image through docker pull on the M1 machine.
+
+### 2.5. Running service
+
+1. Pull the docker images
+
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7:${VERSION}
+   ```
+
+2. Start docker
+
+   ```shell
+    docker run -d -p 7070:7070  -p 7687:7687 -p 9090:9090 -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo ${REPOSITORY}:${VERSION}
+   
+   # ${REPOSITORY} is the image address,${VERSION}is the version number.
+   # 7070  is default http port，for tugraph-db-browser accessing..
+   # 7687 is bolt port, for neo4j client accessing.
+   # 9090 is default RPC port，for RPC client accessing.
+   
+   # The default data directory is /var/lib/lgraph/data and the default log directory is /var/log/lgraph_log,
+   # which is configured in the tugraph configuration file at /usr/local/etc/lgraph.json inside the docker.
+   # This command mounts the data directory and log directory to /root/tugraph/ on the host for persistence,
+   # which you can modify according to your actual situation.
+   ```
+
+## 3. Best Practice in Using and Developing Docker Images for TuGraph-DB
+
+Please carefully read the points below and follow them if you are new to contribute to TuGraph.
+
+- To get rid of too much docker layer, please add your dependency to the Docker with the style writing ENV and RUN in a
+  single line.
+- For the packages/resources you need to build the dependency, use the original ones instead of tweaking them without
+  tracking by VCS. And then contact TuGraph team to upload it to OSS to accelerate the building process, as the urls you
+  see in the Dockerfiles.
+- To make the development more efficient, you would better start from adding dependencies to base TuGraph Compile Images
+  and then reproduce the process in the Dockerfile after confirming the enviroment works.
+- CI uses the docker images. Please check the dependency problems if your CI fails.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..cb40030596
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# Local Package Deployment
+
+> This document describes TuGraph Local Package Deployment.
+
+## 1. Environment preparation
+
+TuGraph local package deployment requires a corresponding environment, and quick verification can use streamlined installation packages, which require almost no third-party libraries.
+
+If you need to use the complete TuGraph function, please refer to the tugraph-db source code directory ci/images/tugraph-runtime-*-Dockerfile. This script contains the complete environment construction process.
+
+## 2. Download the installation package
+
+For the latest version of the installation package address, see "TuGraph-Latest-Version" of [Guide](../../1.guide.md) 
+
+You can also visit Github to download: [TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. Installation method under CentOS
+
+The .rpm installation package for TuGraph installed on CentOS, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.rpm installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+Users can also specify the installation directory by specifying the `--prefix` option.
+
+## 4. Installation method under Ubuntu
+
+A .deb installation package for TuGraph installed on Ubuntu, which contains the TuGraph executable file as well as header files and related library files required for writing embedded programs and stored procedures.
+
+Use the downloaded `tugraph_x.y.z.deb` installation package to install it in the terminal. You only need to run the following command:
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+This command installs TuGraph in the `/usr/local` directory by default. Users can also change the installation directory by specifying the `--instdir=<directory>` option.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..77bfda5171
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,128 @@
+# Cloud Deployment
+
+> This document mainly introduces the cloud deployment of TuGraph, and you can also refer to the[Alibaba Cloud ComputeNest deployment document.](https://aliyun-computenest.github.io/quickstart-tugraph/)。
+
+## 1.Introduction
+
+TuGraph (tugraph.antgroup.com) is a high-performance graph database of Alibaba Group. TuGraph provides community version services on ComputeNest, so you can quickly deploy TuGraph services on ComputeNest and achieve operation and maintenance monitoring, thereby building your own graph application. This document introduces how to open TuGraph community version services on ComputeNest, as well as deployment process and usage instructions.
+
+## 2.Instance Description
+
+TuGraph is deployed as a community open source version, and the source code can be found in the Github Repo. Currently, the available instance specifications are as follows:
+
+| Instance Family | vCPU and Memory             | System Disk                | Public Bandwidth         |
+|-----------------|-----------------------------|----------------------------|--------------------------|
+| ecs.r7a.xlarge  | AMD Memory r7a, 4vCPU 32GiB | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+| ecs.r6.xlarge   | Memory r6, 4vCPU 32GiB      | ESSD Cloud Disk 200GiB PL0 | Fixed bandwidth of 1Mbps |
+
+Estimated costs can be seen in real time when creating instances (currently free). If you need more specifications or other services (such as cluster high availability requirements, enterprise-level support services, etc.), please contact us at tugraph@service.alipay.com.
+
+## 3.Deployment Process
+
+### 3.1.Preparation
+
+Before starting to use, you need an Alibaba Cloud account to access and create resources such as ECS and VPC.
+
+- If you use a personal account, you can directly create a service instance.
+- If you create a service instance using a RAM user and use Alibaba Cloud ComputeNest for the first time:
+    - Before creating a service instance, you need to add permissions for the corresponding resources to the account of the RAM user. For detailed operations on adding RAM permissions, please see Grant RAM user permissions. The required permissions are shown in the following table.
+    - Authorization to create associated roles is also required. Refer to the following figure and select Agree to authorize and create associated roles.
+
+| Permission Policy Name          | Remark                                                                       |
+|---------------------------------|------------------------------------------------------------------------------|
+| AliyunECSFullAccess             | Permissions for managing cloud server services (ECS)                         |
+| AliyunVPCFullAccess             | Permissions for managing Virtual Private Cloud (VPC)                         |
+| AliyunROSFullAccess             | Permissions for managing Resource Orchestration Service (ROS)                |
+| AliyunComputeNestUserFullAccess | Permissions for managing ComputeNest services (ComputeNest) on the user side |
+| AliyunCloudMonitorFullAccess    | Permissions for managing Alibaba Cloud Monitor (CloudMonitor)                |
+
+![Cloud Deployment](../../../images/cloud-deployment-1.png)
+
+### 3.2.Deployment Entrance
+
+You can search in Alibaba Cloud ComputeNest, or quickly access it through the following deployment link.
+
+[Deployment Link](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.Apply for Trial Use
+
+Before formal trial use, you need to apply for trial use, fill in the information as prompted, and create the TuGraph service after passing the review.
+
+![Apply for Trial Use](../../../images/cloud-deployment-2.png)
+
+### 3.4.Create TuGraph Service
+
+#### 3.4.1.Parameter List
+
+During the process of creating a service instance, you need to configure the parameter list of the service instance information. The specific parameters are as follows.
+
+| Parameter Group                              | Parameter Item  | Example                 | Description                                                                                                                            |
+|----------------------------------------------|-----------------|-------------------------|----------------------------------------------------------------------------------------------------------------------------------------|
+| Service Instance Name                        | N/A             | test                    | The name of the instance.                                                                                                              |
+| Region                                       | N/A             | China East 1 (Hangzhou) | Select the region of the service instance. It is recommended to select nearby regions to obtain better network latency.                |
+| Payment Type Configuration                   | Payment Type    | Pay-As-You-Go           | For free use, please select Pay-As-You-Go.                                                                                             |
+| Availability Zone Configuration              | Deployment Area | Availability ZoneI      | Different available zones under the region, ensure that the instance is not empty.                                                     |
+| Select Existing Basic Resource Configuration | VPC ID          | vpc-xxx                 | Select the ID of the Virtual Private Cloud according to the actual situation.                                                          |
+| Select Existing Basic Resource Configuration | Switch ID       | vsw-xxx                 | Select the Switch ID according to the actual situation. If the Switch ID cannot be found, try switching the region and available zone. |
+| ECS Instance Configuration                   | Instance Type   | ecs.r6.xlarge           | Currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications.                                                                    |
+|ECS Instance Configuration|	Instance Password|	**|	Set the instance password. Length of 8-30 characters, must include three items (uppercase letters, lowercase letters, numbers, special characters in ()`~!@#$%^&*_-+={}[]:;'<>,.?/).
+|
+
+#### 3.4.2.Specific Steps
+
+The creation of the service is carried out according to the following steps, refer to the figure below:
+
+- Create an instance name, such as "test" in the figure below
+- Select the region, such as "China East 1 (Hangzhou)" in the figure below
+
+![Create Instance](../../../images/cloud-deployment-3.png)
+
+- Select the instance type, currently supports ecs.r6.xlarge and ecs.r7a.xlarge specifications. If there is no model available in the list, try selecting other deployment areas.
+- Select the model
+- Configure the password for the instance
+- Select the deployment area, such as "Availability Zone I" in the figure below
+
+![Select Region](../../../images/cloud-deployment-4.png)
+
+- Click next to enter the order confirmation page
+- Check the checkboxes for "Permission Confirmation" and "Service Terms"
+- Click the green "Start Free Trial" button in the lower left corner to create a service instance
+
+![Confirmation](../../../images/cloud-deployment-5.png)
+
+### 3.5.Start TuGraph Service
+
+- View the service instance: After the service instance is created successfully, it takes about 2 minutes for deployment. After the deployment is complete, you can see the corresponding service instance on the page, as shown in the figure below.
+
+![View Instance](../../../images/cloud-deployment-6.png)
+
+- Click the service instance to access TuGraph. After entering the corresponding service instance, you can get 3 ways to
+  use it on the page: web, rpc, ssh. You can also see the password of user admin on the page.
+
+![Access Method](../../../images/cloud-deployment-7.png)
+
+- Click the link of web to jump to the deployed TuGraph Web. It is recommended that novice users first use the demo to quickly get started with TuGraph.
+    - First, on the TuGraph Web login page, enter the default username (admin) and the password on the page to log in, as shown in the figure below.
+    - After the login is completed, click "New Instance" -> "Create Instance" in sequence, wait for the creation to be completed, and the steps in 3 will change to green in turn, and it will automatically switch to the subgraph MovieDemo1, as shown in the figure below.
+
+![Login](../../../images/cloud-deployment-8.png)
+![Create Demo](../../../images/cloud-deployment-9.png)
+
+## 4.Common FAQs
+
+### No available resources in the selected deployment area
+
+Sometimes, the selected deployment area (such as Availability Zone G) does not have available resources for the selected package, and an error will be reported as shown in the figure below.
+
+![Deployment Error](../../../images/cloud-deployment-10.png)
+
+__Solution__:Try selecting other regions, such as Availability Zone I
+
+### Unaccessible to the web port
+
+It takes some time for the server to get ready. Just wait for a few seconds.
+
+
+### Username or password is not correct
+
+Please make sure that you are using the password on the page instead of the default one.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..bc6baba6aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/6.compile.md
@@ -0,0 +1,30 @@
+# Compile
+
+> This document mainly describes how to compile TuGraph from source code.
+
+## 1.Prerequisites
+
+It is recommended to build TuGraph on a Linux system. Meanwhile, Docker is a good choice. If you want to set up a new environment, please refer to [Dockerfile](3.docker-deployment.md)。
+
+## 2.compile
+
+Here are steps to compile TuGraph:
+
+1. run `deps/build_deps.sh` to build tugraph-web if you need. Skip this step otherwise.
+2. `cmake .. -DOURSYSTEM=centos` or `cmake .. -DOURSYSTEM=ubuntu`
+3. If compiling on an arm machine (such as a Mac with M1 chip), add `-DENABLE_BUILD_ON_AARCH64=ON`
+4. `make`
+5. `make package` or `cpack --config CPackConfig.cmake`
+
+Example:
+`tugraph/tugraph-compile-centos7`Docker environment
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos7
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..d9fbcf94fe
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,217 @@
+# Tugraph Running
+
+> This document describes the operation mode of the TuGraph service, starting, stopping, and restarting operations.And TuGraph's service configuration parameters, configuration file format, and command-line configuration parameters.
+
+## 1. Prerequisites
+TuGraph has the following prerequisites for its execution: a correct [installation of TuGraph](1.environment.md).
+
+TuGraph execution requires ensuring that the library file "liblgraph.so" is located in the environment variable LD_LIBRARY_PATH.
+
+The user running the TuGraph process does not need superuser privileges. However, they need read permissions for the configuration file (usually lgraph.json) and any files referenced within it. Additionally, they should have write permissions for data folders, log files, etc.
+
+## 2.The operation mode
+
+TuGraph can be started as a normal process in the foreground or as a daemon in the background.
+
+When running as a normal process, TuGraph can print logs directly to the terminal, which is handy when debugging server configurations. However, because the foreground process is terminated after the terminal exits, the user must ensure that the terminal remains open while the TuGraph server is running. In daemon mode, on the other hand, the TuGraph server can continue to run even if the terminal that started it exits. If TuGraph needs to run for a long time, it is recommended to start the TuGraph server in daemon mode.
+
+### 2.1.Running a normal process
+
+The `lgraph_server -d run` command runs TuGraph as a normal process. Normal processes depend on the command line terminal, so when the terminal ends, the TuGraph process is automatically terminated. Normal process mode with `--log_dir ""` can output the process log directly to the terminal, so it is easier to debug.Note: When not using the `-d run` command, the default behavior is to run as a normal process.
+
+The default path for lgraph_server is: /usr/local/bin/lgraph_server.
+
+The default path for lgraph.json is: /usr/local/etc/lgraph.json.
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d run -c lgraph.json --log_dir ""
+```
+or:
+```shell
+$ ./lgraph_server -c lgraph.json --log_dir ""
+```
+
+Example of running output in normal mode：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v4.3.2                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:                   0
+  DB directory:                        /var/lib/lgraph/data
+  HA enable:                           0
+  HTTP port:                           7070
+  HTTP web dir:                        /usr/local/share/lgraph/browser-resource
+  RPC enable:                          1
+  RPC port:                            9090
+  SSL enable:                          0
+  Whether the token is unlimited:      0
+  audit log enable:                    0
+  bind host:                           0.0.0.0
+  bolt port:                           7687
+  disable auth:                        0
+  durable:                             0
+  log dir:                             ""
+  log verbose:                         1
+  number of bolt io threads:           1
+  optimistic transaction:              0
+  reset admin password if you forget:  0
+  subprocess idle limit:               600
+  thread limit:                        0
+[20240730 15:34:27.848783 0x00007f81bb3889c0 INFO  src/server/lgraph_server.h:78] [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[20240730 15:34:27.849116 0x00007f81bb3889c0 INFO  src/server/lgraph_server.cpp:268] Listening for RPC on port 9090
+[20240730 15:34:27.868819 0x00007f81bb3889c0 INFO  src/restful/server/rest_server.cpp:479] Listening for REST on port 7070
+[20240730 15:34:27.869970 0x00006e7d435ff700 INFO  src/server/bolt_server.cpp:36] bolt server run
+[20240730 15:34:27.870040 0x00007f81bb3889c0 INFO  src/server/lgraph_server.cpp:302] Server started.
+```
+
+In normal process mode, the user can prematurely terminate the TuGraph process by pressing 'CTRL+C'.
+
+### 2.2.Run process daemon mode
+
+Start the command：
+
+```shell
+$ ./lgraph_server -d start -c lgraph.json
+```
+
+Example output from running in daemon mode:
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+## 3.Service operation
+
+### 3.1.Start the service
+
+TuGraph needs to be started using the 'lgraph_server -d start' command line. The following is an example of the command to start TuGraph:
+
+```bash
+$ ./lgraph_server -d start -c lgraph.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+The TuGraph server process started by this command is a daemon process that loads the relevant configuration from the file 'lgraph.json'. After the server starts, it will start printing logs in a log file that can then be used to determine the status of the server.
+
+### 3.2.Stop the service
+
+You can stop the TuGraph daemon using the 'kill' command and the 'lgraph_server -d stop' command. Since it is possible to run multiple TuGraph server processes on the same computer, we distinguish between the different server processes using the '.pid 'file, which is written to the working directory where the process was started. Therefore, you need to run the command 'lgraph_server-d stop' in the same working directory to stop the correct server process.
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.Restart the service
+
+Users can also restart the TuGraph service by 'lgraph_server -d restart' :
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+### 3.4.Switch between old and new front-end
+
+To access the container and choose between the old and new versions of the frontend, modify the configuration file located at "/usr/local/etc/lgraph.json". For the old version, change the value of the "web" parameter to "/usr/local/share/lgraph/resource"; for the new version, set it to "/usr/local/share/lgraph/browser-resource". Once you've finished editing the configuration file, run the command  `docker restart tugraph` to apply the changes. Bear in mind that the new version is the default selection.
+
+## 4.Service configuration
+
+The TuGraph server loads configurations from the configuration file and command line options at startup, and if different values are specified for the same option in the configuration file and command line, the value specified in the command line will be used preferentially.
+
+### 4.1.Configuration parameters
+
+The parameters and their types are described as follows:
+
+| **Parameter names**          | **<nobr>Type</nobr>** | **Instructions**                                                                                                                                                                                                                                                                                                                                                                            |
+|------------------------------|-----------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                    | string                | Directory where data files are stored. If the directory does not exist, it is automatically created. The default directory is /var/lib/lgraph/data.                                                                                                                                                                                                                                         |
+| durable                      | boolean               | Whether to enable real-time persistence. Turning off persistence can reduce the disk IO overhead when writing, but data may be lost in extreme cases such as machine power failure. The default value is `true`.                                                                                                                                                                            |
+| host                         | string                | The IP address on which the REST server listens. The default address is 0.0.0.0. Note: In HA mode, the host needs to be set to the IP address of the corresponding server and cannot be set to 0.0.0.0.                                                                                                                                                                                     |
+| port                         | int                   | The Port on which the REST server listens. The default port is 7070.                                                                                                                                                                                                                                                                                                                        |
+| enable_rpc                   | boolean               | Whether to use RPC services. The default value is false.                                                                                                                                                                                                                                                                                                                                    |
+| rpc_port                     | int                   | Port used by RPC and HA services. The default port number is 9090.                                                                                                                                                                                                                                                                                                                          |
+| bolt_port                    | int                   | Port used by Bolt Client. The default port number is 7687.                                                                                                                                                                                                                                                                                                                                  |
+| enable_ha                    | boolean               | Whether to enable the HA mode. The default value is false.                                                                                                                                                                                                                                                                                                                                  |
+| ha_log_dir                   | string                | HA log directory. The HA mode needs to be enabled. The default value is null.                                                                                                                                                                                                                                                                                                               |
+| verbose                      | int                   | Detail level of log output information. The value can be 0,1,2. The larger the value, the more detailed the output information. The default value is 1.                                                                                                                                                                                                                                     |
+| log_dir                      | string                | Directory where log files are stored. The default directory is /var/log/lgraph/.                                                                                                                                                                                                                                                                                                            |
+| ssl_auth                     | boolean               | Whether to use SSL authentication. When HTTPS is enabled, only the HTTPS service is enabled on the REST server. The default value is false.                                                                                                                                                                                                                                                 |
+| web                          | string                | The storage location for web files (including visualization components) is set by default in the directory /usr/local/share/lgraph/browser-resource. For previous older versions, this directory was situated at /usr/local/share/lgraph/resource .                                                                                                                                         |
+| server_cert                  | string                | certificate file path used by the server when SSL authentication is enabled. The default path is/usr/local/etc/lgraph/server - cert.pem.                                                                                                                                                                                                                                                    |
+| server_key                   | string                | The public key file used by the server when SSL authentication is enabled. The default directory is/usr/local/etc/lgraph/server - key.pem。                                                                                                                                                                                                                                                  |
+| enable_audit_log             | boolean               | Whether to enable audit logs. The default value is false.                                                                                                                                                                                                                                                                                                                                   |
+| audit_log_expire             | int                   | When audit logs are enabled, the validity period (hours) of audit logs is automatically cleared upon timeout. If the value is 0, the logs are not cleared. The default value is 0.                                                                                                                                                                                                          |
+| audit_log_dir                | string                | Specifies the directory for storing log files when audit logs are enabled. The default directory is $directory/_audit_log_.                                                                                                                                                                                                                                                                 |
+| load_plugins                 | boolean               | Import all stored procedures when starting the service. The default value is true.                                                                                                                                                                                                                                                                                                          |
+| optimistic_txn               | boolean               | Enable optimistic multithreaded write transactions for Cypher. The default is false.                                                                                                                                                                                                                                                                                                        |
+| disable_auth                 | boolean               | Disable REST authentication. The default is false.                                                                                                                                                                                                                                                                                                                                          |
+| ha_snapshot_interval_s       | int                   | Snapshot interval (in seconds). The default value is 604800. -1 means not to automatically generate snapshots.                                                                                                                                                                                                                                                                              |
+| ha_heartbeat_interval_ms     | int                   | Heartbeat interval in milliseconds. The default value is 1000.                                                                                                                                                                                                                                                                                                                              |
+| ha_node_offline_ms           | int                   | The heartbeat times out and the interval (in milliseconds) between nodes going offline. The default value is 60000.                                                                                                                                                                                                                                                                         |
+| ha_node_remove_ms            | int                   | The interval (in milliseconds) at which a node is considered completely dead and removed from the list. The default value is 120000.                                                                                                                                                                                                                                                        |
+| ha_first_snapshot_start_time | string                | The time when the first snapshot is taken, the format is "HH:MM:SS", which means the first snapshot is taken at the next HH:MM:SS time point, and then every ha_snapshot_interval_s seconds. The default value is "", which means that the first snapshot is taken randomly at any time within 0-ha_snapshot_interval_s, and then a snapshot is taken every ha_snapshot_interval_s seconds. |
+| enable_ip_check              | boolean               | Allow IP address whitelists. The default value is false。                                                                                                                                                                                                                                                                                                                                    |
+| idle_seconds                 | int                   | The maximum number of seconds a child process can be idle. The default value is 600.                                                                                                                                                                                                                                                                                                        |
+| enable_backup_log            | boolean               | Whether to enable backup logging. The default value is false.                                                                                                                                                                                                                                                                                                                               |
+| backup_log_dir               | string                | The directory where backup files are stored. The default value is null.                                                                                                                                                                                                                                                                                                                     |
+| snapshot_dir                 | string                | Directory where snapshot files are stored. The default value is null.                                                                                                                                                                                                                                                                                                                       |
+| thread_limit                 | int                   | The maximum number of threads that can be used simultaneously. The default value is 0, which means that no restriction is imposed. The license file prevails.                                                                                                                                                                                                                               |
+| unlimited_token              | boolean               | Whether to set the link token to be infinite. The default value is false and the validity period is 24 hours.                                                                                                                                                                                                                                                                               |
+| reset_admin_password         | boolean               | Whether to reset the password. The default value is false. When the value is true, the password will be reset to "73@TuGraph"。                                                                                                                                                                                                                                                              |
+| enable_fulltext_index        | boolean               | Whether to enable the full-text index function, the default value is false.                                                                                                                                                                                                                                                                                                                 |
+| fulltext_analyzer            | string                | Full-text index tokenizer type. Can be set to `StandardAnalyzer` or `SmartChineseAnalyzer`. Default is `StandardAnalyzer`                                                                                                                                                                                                                                                                   |
+| fulltext_commit_interval     | int                   | Full-text index data submission period, for write operations, in seconds. The default is 0, which commits immediately.                                                                                                                                                                                                                                                                      |
+| fulltext_refresh_interval    | int                   | Full-text index data refresh cycle, for read operations, in seconds. The default is 0, and the latest written data can be read immediately.                                                                                                                                                                                                                                                 |
+| ha_conf                      | string                | Initialize the HA cluster according to host1:port1,host2:port2,host3:port3, the default value is empty.                                                                                                                                                                                                                                                                                     |
+| ha_node_join_group_s         | int                   | The waiting time for a node to try to join the high availability cluster, in seconds, the default is 10.                                                                                                                                                                                                                                                                                    |
+| ha_bootstrap_role            | int                   | Whether to use bootstrap to start, and the server role to start using this method, 0 means not to use bootstrap to start, 1 means to use bootstrap to start and this node is a leader, 2 means to use bootstrap to start and this node is a follower, only these 3 options. The default value is 0.                                                                                         |
+| help                         | boolean               | Print the help message. The default value is false.                                                                                                                                                                                                                                                                                                                                         |
+| browser.credential_timeout                          | int                   | Browser cache expiration time for usernames and passwords.                                                                                                                                                                                                                                                                                                                                         |
+| browser.retain_connection_credentials                         | boolean               | whether the browser caches usernames and passwords..                                                                                                                                                                                                                                                                                                                                         |
+
+### 4.2.Server configuration file
+
+TuGraph's configuration file is stored in JSON format. It is recommended that most configuration be stored in configuration files and that some configuration parameters be modified only temporarily using command-line options when needed.
+
+A typical configuration file looks like this:
+
+```json
+{
+  "directory" : "/var/lib/lgraph/data",
+  "host" : "0.0.0.0",
+  "port" : 7070,
+  "rpc_port" : 9090,
+  "enable_rpc" : true,
+  "bolt_port": 7687,
+  "enable_ha" : false,
+  "verbose" : 1,
+  "log_dir" : "/var/log/lgraph_log",
+  "disable_auth" : false,
+  "ssl_auth" : false,
+  "server_key" : "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert" : "/usr/local/etc/lgraph/server-cert.pem",
+  "web" : "/usr/local/share/lgraph/browser-resource"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..4f363b5a53
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,168 @@
+# High Availability mode
+
+> This document describes the principles, preparations, and server operations of the high availability mode
+
+## 1.Theory
+
+TuGraph provides high availability (HA) mode through multi-machine hot backup. In high availability mode, write operations to the database will be synchronized to all servers (non-witness), so that even if some servers are down, the availability of the service will not be affected.
+
+When the high-availability mode is started, multiple TuGraph servers form a backup group, which is a high-availability cluster. Each backup group consists of three or more TuGraph servers, one of which serves as the `leader` and the other replication group servers as `followers`. Write requests are served by a `leader`, which replicates and synchronizes each request to a `follower` and can only respond to the client after the request has been synchronized to the server. This way, if any server fails, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically select a new `leader`.
+
+TuGraph's high-availability mode provides two types of nodes: `replica` nodes and `witness` nodes. Among them, the `replica` node is an ordinary node, has logs and data, and can provide services to the outside world. The `witness` node is a node that only receives heartbeats and logs but does not save data. According to deployment requirements, `leader` nodes and `follower` nodes can be flexibly deployed as `replica` nodes or `witness` nodes. Based on this, there are two deployment methods for TuGraph high-availability mode: one is the ordinary deployment mode, and the other is the simple deployment mode with witness.
+
+For normal deployment mode, `leader` and all `followers` are nodes of type `replica`. Write requests are served by a `leader`, which copies each request to a `follower` and cannot respond to the client until the request has been synchronized to more than half of the servers. This way, if less than half of the servers fail, the other servers will still have all the data written so far. If the `leader` server fails, other servers will automatically elect a new `leader` to ensure data consistency and service availability.
+
+However, when the user server resources are insufficient or a network partition occurs, a normal HA cluster cannot be established. At this time, since the `witness` node has no data and takes up little resources, the `witness` node and the `replica` node can be deployed on one machine. For example, when there are only 2 machines, you can deploy the `replica` node on one machine, and the `replica` node and `witness` node on another machine, which not only saves resources, but also does not require log application To the state machine, there is no need to generate and install snapshots, so the response to requests is very fast, and it can help quickly elect a new leader when the cluster crashes or the network is partitioned. This is the simple deployment mode of the TuGraph HA cluster. Although `witness` nodes have many benefits, since there is no data, the cluster actually adds a node that cannot become `leader`, so the availability will be slightly reduced. To improve the availability of the cluster, you can allow the `witness` node to be the leader temporarily by specifying the `ha_enable_witness_to_leader` parameter as `true`. After the `witness` node synchronizes the new log to other nodes, it will actively switch the leader role to the node with the latest log.
+
+This feature is supported in version 3.6 and above.
+
+## 2.Preparation
+
+To enable high availability mode, users need to:
+
+- Three or more instances of TuGraph servers.
+- To enable high availability mode when starting lgraph_server, the 'enable_ha' option can be set to 'true' using a configuration file or the command line.
+- Set the correct rpc_port through the configuration file or command line
+
+## 3.Start the initial backup group
+
+After installing TuGraph, you can use the `lgraph_server` command to start a high-availability cluster on different machines. This section mainly explains how to start a high-availability cluster. For cluster status management after startup, see [lgraph_peer tool](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.The initial data is consistent
+
+When the data in all servers is the same or there is no data at startup, the user can
+specify `--ha_conf host1:port1,host2:port2` to start the server.
+In this way, all prepared TuGraph instances can be added to the initial backup group at one time,
+All servers in the backup group elect `leader` according to the RAFT protocol, and other
+servers join the backup group with the role of `follower`.
+
+An example command to start an initial backup group is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+After the first server is started, it will elect itself as the 'leader' and organize a backup group with only itself.
+
+### 3.2.Inconsistent initial data
+If there is already data in the first server (imported by the `lgraph_import` tool or transferred from a server in non-high availability mode),
+And it has not been used in high-availability mode before, the user should use the boostrap method to start. Start the server with data in bootstrap
+mode with the `ha_bootstrap_role` parameter as 1, and specify the machine as the `leader` through the `ha_conf`
+parameter. In bootstrap mode, the server will copy its own data to the new server before adding the newly
+joined server to the backup group, so that the data in each server is consistent.
+
+An example command to start a data server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+Other servers without data need to specify the `ha_bootstrap_role` parameter as 2, and specify the `leader` through the `ha_conf` parameter. The command example is as follows
+
+```bash
+**$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**You need to pay attention to two points when using bootstrap to start an HA cluster:**
+1. You need to wait for the `leader` node to generate a snapshot and start successfully before joining the `follower` node, otherwise the `follower` node may fail to join. When starting the `follower` node, you can configure the `ha_node_join_group_s` parameter to be slightly larger to allow multiple waits and timeout retries when joining the HA cluster.
+2. The HA cluster can only use the bootstrap mode when it is started for the first time. It can only be started in the normal mode (see Section 3.1) when it is started later. In particular, multiple nodes of the same cluster cannot be started in the bootstrap mode, otherwise it may cause Data inconsistency
+
+## 4.Start witness node
+
+### 4.1. Witness nodes are not allowed to become leader
+
+The startup method of `witness` node is the same as that of ordinary nodes. You only need to set the `ha_is_witness` parameter to `true`. Note that the number of witness nodes should be less than half of the total number of cluster nodes.
+
+An example command to start the witness node server is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+Note: By default, the `witness` node is not allowed to become the `leader` node, which can improve the performance of the cluster, but will reduce the availability of the cluster when the `leader` node crashes.
+
+### 4.1. Allow witness nodes to become leaders
+
+You can specify the `ha_enable_witness_to_leader` parameter as `true`, so that the `witness` node can temporarily become the `leader` node, and then actively switch to the master after the new log synchronization is completed.
+
+An example of the command to start the `witness` node server that is allowed to become the `leader` node is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+Note: Although allowing `witness` nodes to become `leader` nodes can improve the availability of the cluster, it may affect data consistency in extreme cases. Therefore, it should generally be ensured that the number of `witness` nodes + 1 is less than half of the total number of cluster nodes.
+
+## 5.Scale out other servers
+
+After starting the initial backup group, if you want to scale out the backup group, add new servers to the backup group,
+The `--ha_conf HOST:PORT` option should be used, where `HOST` can be the IP address of any server already in this backup group,
+And `PORT` is its RPC port. E.g:
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+This command will start a TuGraph server in high availability mode and try to add it to the backup group containing the server `172.22.224.15:9090`.
+Note that joining a backup group requires a server to synchronize its data with the backup group's `leader` server, and this process may take a considerable amount of time, depending on the size of the data.
+
+## 6.Stopping the Server
+
+When a server goes offline via 'CTRL-C', it will notify the current 'leader' server to remove the server from the backup group. If the leader server goes offline, it will pass the leader identity permission to another server before going offline.
+
+If a server is terminated or disconnected from other servers in the backup group, the server is considered a failed node and the leader server will remove it from the backup group after a specified time limit.
+
+If any server leaves the backup group and wishes to rejoin, it must start with the '--ha_conf {HOST:PORT}' option, where 'HOST' is the IP address of a server in the current backup group.
+
+## 7.Restarting the Server
+
+Restarting the entire backup group is not recommended as it disrupts service. All servers can be shut down if desired. But on reboot,
+It must be ensured that at least N/2+1 servers in the backup group at shutdown can start normally, otherwise the startup will fail. and,
+Regardless of whether `enable_bootstrap` is specified as true when initially starting the replication group, restarting the server only needs to pass
+Specify the `--ha_conf host1:port1,host2:port2` parameter to restart all servers at once. The command example is as follows:
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker deploys a highly available cluster
+In real business scenarios, it is likely to encounter the need to deploy high-availability clusters on multiple operating systems or architectures.
+Differentiated environments may cause some dependencies to be missing when compiling TuGraph. therefore,
+Compiling software in docker and deploying high-availability clusters is very valuable. Take the centos7 version of docker as an example,
+The steps to deploy a highly available cluster are as follows.
+
+### 8.1.Install mirror
+Use the following command to download TuGraph's compiled docker image environment
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+Then pull the TuGraph source code and compile and install
+
+### 8.2.Create container
+Use the following command to create a container, use `--net=host` to make the container run in host mode, in this mode
+Docker and the host machine share the network namespace, that is, they share the same IP.
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.Start service
+Use the following command to start the service on each server, because docker and the host share IP, so you can directly specify to start the service on the host IP
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.Server Status
+
+The current status of the backup group can be obtained from the TuGraph visualization tool, REST API, and Cypher query.
+
+In the TuGraph visualization tool, you can find the list of servers and their roles in the backup group in the DBInfo section.
+
+With the REST API, you can use `GET /info/peers` to request information.
+
+In Cypher, the `CALL dbms.listServers()` statement is used to query the status information of the current backup group.
+
+## 10.Data synchronization in high availability mode
+
+In high availability mode, different servers in the same backup group may not always be in the same state. For performance reasons, if a request has been synchronized to more than half of the servers, the leader server will consider the request to be in the committed state. Although the rest of the servers will eventually receive the new request, the inconsistent state of the servers will persist for some time. A client may also send a request to a server that has just restarted, thus having an older state and waiting to join a backup group.
+
+To ensure that the client sees consistently continuous data, and in particular to get rid of the 'reverse time travel' problem, where the client reads a state older than it has seen before, each TuGraph server keeps a monotonically increasing data version number. The mapping of the data version number to the database state in the backup group is globally consistent, meaning that if two servers have the same data version number, they must have the same data. When responding to a request, the server includes its data version number in the response. Thus, the client can tell which version it has seen. The client can choose to send this data version number along with the request. Upon receiving a request with a data version number, the server compares the data version number to its current version and rejects the request if its own version is lower than the requested version. This mechanism ensures that the client never reads a state that is older than before.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..bf30d63598
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+Installation And Running
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..8a46e25efe
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,475 @@
+# Data Importing
+
+> This document describes the data import function of TuGraph. These include delimiters in CSV format, sample formats for jsonline, and two modes for importing online and offline.
+
+## 1. Introduction
+
+After the installation is successful, you can use the `lgraph_import` batch import tool to import existing data into TuGraph. `lgraph_import` supports importing data from CSV files and JSON data sources.
+
+> `sonline format, a row of a json array string`
+
+> CSV format
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline format
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph supports two data importing modes：
+
+- _offline_：Read the data and import it into a data file for the specified server, it should only be done when the server is offline.
+- _online_：Read the data and send it to the running server, which then imports the data into its database.
+
+## 2.CSV file format delimiter
+
+    CSV delimiters can be single-character or multi-character strings, which cannot contain 'r' or 'n'. Note that different shells handle input strings differently, so different escape handling may be required for different shell input parameters.
+
+In addition, 'lgraph_import' also supports the following escape characters for entering special symbols:
+
+| Escape character | Instructions                                                                                              |
+| ---------------- | --------------------------------------------------------------------------------------------------------- |
+| \\               | The backslash`\\`                                                                                         |
+| \\a              | ASCII code 0x07                                                                                           |
+| \\f              | form-feed，ASCII code 0x0c                                                                                |
+| \\t              | Horizontal tab characters， ASCII code 0x09                                                               |
+| \\v              | Vertical tab characters， ASCII code 0x0b                                                                 |
+| \\xnn            | Two hexadecimal digits representing one byte，example \\x9A                                               |
+| \\nnn            | A three-digit octal number representing a single byte，example \\001, \\443，data range cannot exceed 255 |
+
+Demo：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.The configuration file
+
+    `lgraph_import`tool configures the environment using the specified configuration file. The configuration file describes the paths to the input files, the vertices/edges they represent, and the vertex/edge format.
+
+### 3.1.Configuration File Format
+
+The configuration file consists of two parts: schema and files. The 'schema' part defines label, and the 'files' part describes the data files to be imported.
+
+#### 3.1.1.The keyword
+
+- schema (Array）
+  - label（required，string）
+  - type（required， VERTEX or EDGE）
+  - properties（Array，required for vertex，If there is no property for the edge, you can leave it unconfigured）
+    - name（required, string）
+    - type （required,，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（optional，Indicates that the field can be configured or not configured）
+    - index（optional，Whether the field needs to be indexed）
+    - unique（optional, whether the field indexed and is of type unique）
+    - pair_unique（optional, whether the field indexed and is of type pair_unique）only one unique and pair_unique can be set. Setting up and running at the same time will terminate due to an input exception
+  - primary (vertex-only configuration, specify a property that uniquely identifies a point in the primary key field)
+  - temproal (edge-only configuration, optional, specifies the timestamp field for storage tier sorting)
+  - temporal_field_order (edge-only configuration, optional, the default value is ASC, indicating the ascending order, or DESC, indicating the descending order)
+  - constraints (edge-only configuration, optional, array form, start and end labels, unconfigured or empty means unrestricted)
+  - detach_property (optional, both Edge and Vertex can config，default is `false`. `true` means the property data is stored in detached model, which can reduce io read amplification in cases with less memory and much property data.)
+- files （Array）
+  - path（required，string，The value can be a file path or a directory path. If it is a directory, all files in the directory will be imported. Ensure that they have the same schema）
+  - header（Optional, numeric, header in the first few lines of the file, or 0）
+  - format（required，JSON or CSV）
+  - label（required，string）
+  - columns（Array）
+    - SRC_ID (Special string，only on the edges,That means this column is the source data)
+    - DST_ID (A special string, only on the edges, indicates that this column is the destination data)
+    - SKIP   (A special string to skip this column of data)
+    - [property]
+  - SRC_ID (Edge-only configuration. The value is the start label)
+  - DST_ID (Edge-only configuration. The value is the destination point label)
+
+#### 3.1.2. Index length
+Because TuGraph has limits on the length of keys, unique indexes do not allow the establishment of indexes that exceed the limit length. Non-unique indexes will truncate attributes that exceed the length limit, and when traversing non-unique indexes through iterators, the key obtained It is also truncated and may not be consistent with expectations. The truncation length is different for different types of non-unique indexes.
+##### 3.1.2.1.unique index
+A unique index is globally unique, and the maximum length of the index key is 480 bytes. Primary is a special unique index, so the maximum key length is also 480 bytes, and no index can be created if it exceeds 480 bytes.
+##### 3.1.2.2.pair_unique index
+A pair_unique index refers to a unique index between two nodes. This type of index can only be created in the edge schema. This type of index adds the vid of the source node and the target node after the user-specified key. Each vid is 5 bytes. length. Therefore, the maximum key length is 470 bytes, and indexing cannot be established if it exceeds 470 bytes.
+##### 3.1.2.3. Non-unique index
+A non-unique index refers to an index that neither unique nor pair_unique is set to 1. In the implementation of TuGraph, one key of this type of index may be mapped to multiple values. In order to speed up search and writing, the user-specified The key is followed by the maximum value in a set of vid or euid. For non-unique indexes created in nodes, the key is followed by vid, and each vid is 5 bytes in length, so the maximum length is 475 bytes.
+For non-unique indexes created in edges, the key is followed by euid, and each euid is 24 bytes long, so the maximum length is 456 bytes. If the index key exceeds the corresponding length, it will be automatically truncated.
+
+### 3.2.Example Configuration File
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+For the above Example Configuration File, three labels defined: two point types' actor 'and' movie ', and one edge type 'role'. Each label describes: the name of the label, the type (dot or edge), which attribute fields are available, and the type of each field. For points, the primary field also defined; For edges, the constraints field also defined, which limits the starting and ending points of the edges.
+
+It also describes three data files, two dot data files' actors.csv 'and' movies.csv ', and one edge data file 'roles.csv'. Each section describes the path of the file, the format of the data, the first few lines of the header, the label of the data, and the corresponding field of each column in each row of data in the file.
+
+For the above configuration files, the import tool will first create labels' actor ', 'movie', and 'role' in TuGraph, and then perform data import of the three files.
+
+## 4.Offline full import
+
+The offline mode can be used only on offline servers. An offline import creates a new graph, so it's more suitable for your first data import on a newly installed TuGraph server.
+
+To use the 'lgraph_import' tool in offline mode, you can specify the 'lgraph_import --online false' option. To see the command-line options available, use 'lgraph_import --online false --help' :
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+Command line arguments:
+
+- **-c, --config_file** `config_file`: Import the configuration file name in the following format:
+- **--log** `log_dir`: Log directory. The default is an empty string, in which case the log information output to the console.
+- **--verbose** `0/1/2`: Log level. The higher the log level, the more detailed the output information is. The default value is 1.
+- **-i, --continue_on_error** `true/false`: If an error occurs, skip the error and continue. The default is false. If an error occurs, exit.
+- **-d, --dir** `{diretory}`:The database directory to which the import tool will write data. Default is'./db '.
+- **--delimiter** `{delimiter}`: Data file separator. This is used only when the data source is in CSV format. The default is', '。
+- **-u, --username** `{user}`: Username of the database. You need to be an administrator to perform offline import.
+- **-p, --password** `{password}`: Specifies the password of the database user
+- **--overwrite** `true/false`: Whether to overwrite data. When set to true, the data directory overwritten if it already exists. Default to 'false'.
+- **-g, --graph** `{graph_name}`: Specify the kind of graph to import.
+- **-h, --help**: The help information displayed.
+
+### 4.1.Offline Import Example
+
+    In this example, we use the movie-actor data described above to demonstrate the use of the import tool. The data to be imported is divided into three files: 'movies.csv', 'actors.csv', and 'roles.csv'.
+
+'movies.csv' contains information about movies, where each movie has an id (as a primary key for retrieval), and each movie also has attributes such as title, year, and rating. (Data from [IMDb](http://www.imdb.com)).
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+> The jsonline format is as follows:
+> All fields can be strings, which will be converted to the corresponding type when imported
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`It contains information about the actors. Each actor also has an id, as well as properties such as name.
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`It contains information about which role an actor played in which movie. Each row records a character played by a given actor in a given movie, corresponding to an edge in the database.`SRC_ID` and `DST_ID` are the source and target vertices of the edge, which are the 'primary' properties defined in 'actors.csv' and 'movies.csv', respectively.
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+> The corresponding jsonline format is as follows:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+'configuration file import.conf', notice that there are two HEADER lines in each file, so we need to specify the 'HEADER=2' option.
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+Using the import configuration file, we can now import data using the following command:
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # Read configuration information from import.conf
+        --dir /data/lgraph_db      # Store the data in /data/lgraph_db
+        --graph mygraph            # Import the graph named mygraph
+```
+
+**Notice**：
+
+- If a graph named 'mygraph' already exists, the import tool will print an error message and exit. To force a graph to be overwritten, use the '--overwrite true' option.
+- Configuration and data files must be stored in UTF-8 encoding (or normal ASCII encoding, which is a subset of UTF-8). If any file uses an encoding other than UTF-8 (for example, UTF-8 with BOM or GBK), the import will fail and output a profiler error.
+
+## 5.Online incremental Import
+
+The online import mode can be used to import a batch of files into an already running instance of TuGraph. This is handy for processing incremental batch updates that typically occur at fixed intervals. The 'lgraph_import --online true' option enables the import tool to work in online mode. Like offline mode, online mode has its own set of command-line options, which can be printed using the '-h, --help' options:
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+The configuration related to the file specified in the configuration file, and its format is exactly the same as' offline mode '. However, instead of importing the data into a local database, we are now sending the data to a running TuGraph instance, which is typically running on a different computer than the client machine on which the import tool is running. Therefore, we need to specify the URL, DB user, and password for the HTTP address of the remote machine.
+
+If the user and password are valid, and the specified graph exists, the import tool sends the data to the server, which then parses the data and writes it to the specified graph. The data will be sent in a packet of about 16 MB, interrupted at the nearest newline. Each package imported atomically, which means that if the package is successfully imported, all data is successfully imported; otherwise, none of the data enters the database. If '--continue_on_error true' is specified, data integrity errors are ignored and offending lines are ignored. Otherwise, the import stops at the first error package and prints out the number of packages that have been imported. In this case, the user can modify the data to eliminate errors, and then use '--skip_packages N' to redo the import to skip the imported packages.
+
+## 6. Online full import
+
+Online full import can be used to import a batch of files into a running TuGraph instance. TuGraph supports importing two different types of data into the instance online:
+1. Original data files of the same type as the offline import (csv, etc.)
+2. The underlying storage file of TuGraph is the data.mdb file. This file can be generated by offline import, or it can be a file of other TuGraph db.
+The applicable scenarios of these two methods are different. The first method is to directly import data into TuGraph. The advantage is that it is automatically imported at one time and the operation steps are simple. However, an offline import thread will be started on the server side, which is only suitable for small-scale data import in a stand-alone situation. The second is to import the prepared underlying storage files into TuGraph. Although the mdb file needs to be prepared in advance, it does not have high requirements on system resources. It also supports remote download and file import, which is very convenient and suitable for high availability. Online import of schema or large-scale data.
+
+### 6.1 Import from original data
+The execution method of importing from the original data is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and The data files of the temporary db are migrated to the new subgraph, and finally the metadata of the instance is refreshed. Compared with online incremental import, online full import has higher performance. The `lgraph_import --online true --online_type 1` option enables the import tool to fully import online. Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+Online full import can be used to import a batch of files into an already running TuGraph instance. The execution method is to send an import request to the running TuGraph instance. After receiving the request, the instance first uses offline import (V3) to import the data into a temporary db, and then creates a new subgraph in the instance and stores the data in the temporary db. The files are migrated to the new subgraph, and finally the instance's metadata is refreshed. Compared with online incremental import, online full import has higher performance and is suitable for processing large-scale data. The `lgraph_import --online true --full true` option enables the import tool to fully import online.
+Like `offline mode`, online mode has its own set of command line options, which can be printed using the `-h, --help` option:
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+The relevant configuration of the file is specified in the configuration file, and its format is exactly the same as in `offline mode`. However, instead of importing the data into a local database, we now import the data into a running TuGraph instance, which is typically running on a different machine than the client machine running the import tool. Therefore, we need to specify the URL, DB user and password of the remote computer's HTTP address. Moreover, the configuration file (config_file parameter) is required to be the uri path on the TuGraph instance machine, and its file configuration is also required to be the absolute path of the resource on the TuGraph instance machine.
+
+If the user and password are valid, the import tool will perform an online full import on the server side. If the graph you want to import already exists, you can use the `--overwrite true` option to force overwriting of the subgraph.
+
+### 6.2 Import from database file
+Although the full online import of original data is simple to operate and has high performance, it requires high server resources and takes a long time. A more general way is to first use offline import to import the subgraph in an empty db, obtain the data.mdb file, and then import the file into the TuGraph service online. How to use it is as follows:
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+In addition to the url, user and password parameters used in ordinary online import, the online full import method imported from a database file uses the graph parameter to specify the name of the imported subgraph, the path parameter to specify the file path, and remote to specify whether the file exists remotely or locally. If it is a local file, you need to ensure that all nodes in the HA cluster have the file in the path. If it is a remote file, it will be downloaded first and then imported. It should be noted that since there is only one copy of data.mdb, it is necessary to ensure that the environment of each node of HA and the machine where data.mdb is generated offline are completely consistent to ensure that no environmental problems will occur.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..b1ad57de6f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# Data Export
+
+> This document mainly introduces the data export function of TuGraph.
+
+## 1.Introduction
+
+TuGraph can use the tool `lgraph_export` to export data from the database that has been imported successfully. The 'lgraph_export' tool can export the data of the specified TuGraph database to the specified directory in the form of 'csv' or 'json' file, and export the configuration file 'import.config'. That required for re-importing the data.
+
+## 2.Data Export
+
+The following is an example of a command for the tool:
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+Details:
+
+- `-d {database_dir}` specifies the directory of the database from which the data will be exported. The default value is./testdb '.
+- `-e {export_destination_dir}` specifies the directory where the export file is stored. The default value is./exportdir.
+- `-g {graph_to_use}` specifies the type of graph database. default is' default '.
+- `-u {username}` Specifies the name of the user who performs the export operation.
+- `-p {password}` Specifies the password of the user who performs the export operation.
+- `-s {field_separator}` specifies the separator for the exported file. The default is comma.
+- `-f {output_format}` specifies the format of the exported data. It can be 'json' or 'csv'.
+- `-h` In addition to the specified parameters, you can also use this parameter to view the help of the tool.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..fa1839724b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,32 @@
+# Backup and Restore
+
+> This document mainly introduces the data backup and restore function of TuGraph.
+
+## 1.Data Backup
+
+TuGraph can use the 'lgraph_backup' tool to backup data.
+The 'lgraph_backup' tool can backup data from a TuGraph database to another directory. It can be used as follows:
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+Details:
+
+- `-s {source_dir}` specifies the directory where the database (source database) to be backed up resides.
+- `-d {destination_dir}` specifies the directory where the backup file (destination database) is stored.
+  If the target database is not empty, 'lgraph_backup' prompts you whether to overwrite the database.
+- `-c {true/false}` indicates whether a compaction occurs during backup.
+  Every compaction creates a tighter backup, but every compaction takes longer to create. This option defaults to 'true'.
+
+## 2.Data Restore
+
+The target database `{destination_dir}` obtained using the `lgraph_backup` tool backs up all subgraphs of the source database `{source_dir}`, but does not include the raft information of the HA cluster, thereby ensuring that the service and cluster can be successfully restarted with the backup database and the data is consistent with the source database. The following command can be used to restart the service with the backup database. When the service starts, the storage process of all subgraphs will be restored to ensure that the backup service is completely consistent with the original service.
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+Details
+
+- `-d {destination_dir}` Specify the directory where the backup file (target database) is located.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..6782a43d0e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# Data Warmup
+
+> This document mainly introduces the data Warmup function of TuGraph.
+
+## 1.Introduction
+
+TuGraph is a disk-based database where data loaded into memory only when accessed. Therefore, for a period of time after the server just turned on, the system performance may be degraded due to frequent IO operations. At this point, we can improve this problem by data warm-up.
+
+## 2.lgraph_warmup
+
+Data warmup can be done using the tool lgraph_warmup. An example of its use is as follows:
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+Details:
+
+The - '-d {db_dir}' option specifies the data directory for the TuGraph server
+
+The - '-g {graph_list}' option specifies the names of graphs to be warmed-up, separated by commas
+
+The warm-up process takes different times depending on the data size and the type of disk being used. Preheating a large database on a mechanical disk may take a long time. Please wait patiently.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..d830586b92
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# Cluster management
+
+> This document mainly introduces the management tools of TuGraph HA cluster, including the functions of deleting nodes, leader transfer and generating snapshots.
+
+## 1 Introduction
+
+After the HA cluster is started, you can use the `lgraph_peer` tool for cluster management, which can perform functions such as deleting nodes, transferring leaders, and generating snapshots.
+
+## 2. Delete node
+
+For nodes in the TuGraph HA cluster that are offline for a long time or have network partitions, you can use the `remove_peer` command of `lgraph_peer` to delete the node. An example command is as follows:
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command remove_peer` specifies that the operation to be performed is remove_peer, that is, delete the node.
+- `--peer {peer_id}` specifies the rpc network address of the node to be deleted, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 3. leader transfer
+
+When you need to shut down or restart the master node, in order to reduce the unserviceable time of the cluster, you can use the `transfer_leader` command of `lgraph_peer` to transfer the master node. An example command is as follows:
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+in:
+
+- `--command transfer_leader` specifies that the operation to be performed is transfer_leader, that is, transferring the master node.
+- `--peer {peer_id}` specifies the rpc network address to become the master node, such as `127.0.0.1:9092`.
+- `--conf {group_conf}` specifies the member configuration of the HA cluster (as long as it can be connected to the master node), such as `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094`.
+
+## 4. Generate snapshot
+
+For reasons such as setting ha_snapshot_interval_s to -1 when the node starts so that snapshots are not taken by default or other reasons,
+when you need to tell a node generate a snapshot, you can use the `snapshot` command of `lgraph_peer`. An example command is as follows:
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+in:
+
+- `--command snapshot` specifies that the operation to be performed is snapshot, that is, generating a snapshot.
+- `--peer {peer_id}` specifies the rpc network address of the node to generate a snapshot, such as `127.0.0.1:9092`.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..dd74d08869
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,145 @@
+# Tugraph CLI
+
+> This document mainly introduces the CLI tool lgraph_cypher of TuGraph.
+
+## 1.Instructions
+
+The TuGraph release comes with a query client named 'lgraph_cypher' that can be used to submit OpenCypher requests to the TuGraph server. The 'lgraph_cypher' client has two execution modes: single command mode and interactive mode.
+
+## Single command mode
+
+In single-command mode, 'lgraph_cypher' can be used to submit a single Cypher query and print the result directly to the terminal. The printed result can also be easily redirected to a specified file. This is handy when users need to get a lot of results from the server and save them in files.
+
+In this mode, the 'lgraph_cypher' tool has the following options:
+
+### Command line Parameters:
+
+| Parameter | Type   | Instructions                                                                                                                                                                                                                           |
+| --------- | ------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| --help    | \\     | List all parameters and descriptions.                                                                                                                                                                                                  |
+| -example  | \\     | List the command instances.                                                                                                                                                                                                            |
+| -c        | string | A database configuration file used to obtain ip and port information.                                                                                                                                                                  |
+| -h        | string | Database server IP address. Omit this parameter if you have a configuration file. The default value is' 127.0.0.1 '                                                                                               |
+| -p        | string | Database server port. Omit this parameter if you have a configuration file. The default value is 7071                                                                                                                                  |
+| -u        | string | User name for logging in to the database.                                                                                                                                                                                              |
+| -P        | string | Password for logging in to the database.                                                                                                                                                                                               |
+| -f        | string | Contains the path to a single Cypher query single text file.                                                                                                                                                                           |
+| -s        | string | Single-line cypher query command. Start and end with `"`.                                                                                                                                                                              |
+| -t        | int    | Specifies the server timeout threshold for cypher queries. The default value is 150 seconds.                                                                                                                                           |
+| -format   | string | Query result display mode. Supports two formats: 'plain' and 'table'. The 'plain' format prints the query results in a single column. The 'table' format displays the query results in a tabular format. The default value is' table ' |
+
+### Examples:
+
+**cypher command file query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+
+```
+
+**cypher command single-sentence query:**
+
+```powershell
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+
+```
+
+## Interactive mode
+
+'lgraph_cypher' can also be run in interactive mode. In interactive mode, the client stays connected to the server and interacts with the user in read-evaluate-print-loop.
+
+### Enter lgraph_cypher interaction mode:
+
+If no '-f' or '-s' command line option added, 'lgraph_cypher' will enter interactive mode when running. how to use it:
+
+```
+
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+
+```
+
+If the login is successful, the corresponding login success message will be displayed:
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2018 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+Now we also provide an interactive shell for users to enter Cypher queries or use the ':help' command to check for available commands.
+
+### Command Description
+
+In addition to the Cypher query, the shell of 'lgraph_cypher' accepts the following commands:
+
+| Command                  | Parameters                                         | instructions                                                                                                                                              |
+| ------------------------ | -------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                                 | Displays the server information and the corresponding description of all commands.                                                                        |
+| :db_info                 | \\                                                 | Query the current server status. /db/info for the corresponding REST API.                                                                                 |
+| :clear                   | \\                                                 | Clear the screen.                                                                                                                                         |
+| :use                     | {Graph Name}                                       | The graph specified with this name defaults to `default`                                                                                                  |
+| :source                  | `-t {Query the timeout value} -f {The query file}` | cypher command file query in interactive mode. The default timeout threshold is 150 seconds. Query file format reference No interactive query parameters. |
+| :exit                    | \\                                                 | Exit interactive mode and return to the original command line.                                                                                            |
+| :format                  | `plain` or `table`                                 | Change the display mode of cypher query results. Support 'plain' and 'table' modes.                                                                       |
+| :save all/command/result | `-f {The file path}` `{Cypher}`                    | The cypher command (command), query result (result) or both (all) are stored. The default location is' /saved_cypher.txt '                                |
+
+**Note:**
+
+- Each command should start with a colon `:`.
+
+**:save command example :**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+
+```
+
+### cypher query command:
+
+In interactive mode, users can also directly input a single sentence cypher command for query, with "'; ` "end. Enter commands that are case insensitive. Here's an example:
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher` supports multi-line input when typing commands. Users can use the `ENTER` key to type long query statements into multiple lines. In the case of multi-line input, the beginning of the command line will change from `>` to `=>`, and the user can continue to type the rest of the query.
+
+Example:
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### Auxiliary Features:
+
+**Input History:** Press the up and down arrow keys in interactive mode to display the input history.
+
+**Auto Completion:** lgraph_cypher will automatically complete based on the input history. In the event of a completion prompt, pressing the right arrow key will automatically complete the command.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..053962a0f2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,515 @@
+# TuGraph DataX
+
+> This document mainly introduces the installation, compilation and usage examples of TuGraph DataX
+
+## 1.Introduction
+
+On the basis of Ali's open source DataX, TuGraph implements the support of writing plug-ins and jsonline data format, and other data sources can write data into TuGraph through DataX.
+TuGraph DataX introduces [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX), Supported features include:
+
+- Import TuGraph from various heterogeneous data sources such as MySQL, SQL Server,Oracle, PostgreSQL, HDFS, Hive, HBase, OTS, ODPS, Kafka and so on. 
+  
+- Import TuGraph to the corresponding target source (to be developed).
+
+Reference for DataX Original Project Introduction [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.Compile and Install
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+yum install maven
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+The compiled DataX file is in the target directory
+
+## 3.Import TuGraph
+
+### 3.1.Text data imported into TuGraph with DataX
+
+Using the data from the lgraph_import section of the TuGraph manual as an example, we have three csv data files, as follows:
+`actors.csv`
+
+```
+
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+
+```
+
+`movies.csv`
+
+```
+
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+
+```
+
+`roles.csv`
+
+```
+
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+
+```
+
+Then create three DataX job profiles:
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "actor",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "aid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" }
+                ],
+                "primary": "aid"
+              }
+            ],
+            "files": [
+              {
+                "label": "actor",
+                "format": "JSON",
+                "columns": ["aid", "name"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "play_in",
+                "type": "EDGE",
+                "properties": [{ "name": "role", "type": "STRING" }]
+              }
+            ],
+            "files": [
+              {
+                "label": "play_in",
+                "format": "JSON",
+                "SRC_ID": "actor",
+                "DST_ID": "movie",
+                "columns": ["SRC_ID", "role", "DST_ID"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`/lgraph_server -c lgraph_standalone.json -d 'run'` 'Start TuGraph and run the following commands in sequence:
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+### 3.2.MySQL's data imported into TuGraph with DataX
+
+We create the following table of movies under 'test' database
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+Insert some data into the table
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+Create a DataX job configuration file
+
+`job_mysql_to_tugraph.json`
+
+**Configuring Field**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**Write simple sql**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "host": "127.0.0.1",
+            "port": 7071,
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "schema": [
+              {
+                "label": "movie",
+                "type": "VERTEX",
+                "properties": [
+                  { "name": "mid", "type": "STRING" },
+                  { "name": "name", "type": "STRING" },
+                  { "name": "year", "type": "STRING" },
+                  { "name": "rate", "type": "FLOAT", "optional": true }
+                ],
+                "primary": "mid"
+              }
+            ],
+            "files": [
+              {
+                "label": "movie",
+                "format": "JSON",
+                "columns": ["mid", "name", "year", "rate"]
+              }
+            ]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` Start TuGraph and run the following command：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
+
+## 4.Export TuGraph
+
+### 4.1. Configuration example
+
+TuGraph supports exporting data using DataX. Use the following configuration to export data to text data
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "tugraphreader",
+          "parameter": {
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "Movie_8C5C",
+            "queryCypher": "match (n:person) return n.id,n.name,n.born;",
+            "url": "bolt://100.83.30.35:27687"
+          }
+        },
+        "writer": {
+          "name": "txtfilewriter",
+          "parameter": {
+            "path": "./result",
+            "fileName": "luohw",
+            "writeMode": "truncate"
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+Using this configuration file, you can export all the id, name and born attributes of the person node in the TuGraph Movie_8C5C subgraph,
+export them to the result directory under the current directory, and the file name is luohw+random suffix.
+
+### 4.2. Parameter Description
+
+When using DataX to export TuGraph data, you need to set the reader to tugraphreader and configure the following 5 parameters:
+
+* **url**
+  * Description: TuGraph's bolt server address <br />
+  * Required: Yes <br />
+  * Default value: None <br />
+
+* **username**
+  * Description: TuGraph's username <br />
+  * Required: Yes <br />
+  * Default value: None <br />
+
+* **password**
+  * Description: TuGraph's password <br />
+  * Required: Yes <br />
+  * Default value: None <br />
+
+* **graphName**
+  * Description: The selected TuGraph subgraph to be synchronized <br />
+  * Required: Yes <br />
+  * Default value: None <br />
+
+* **queryCypher**
+  * Description: Read data in TuGraph through cypher statements <br />
+  * Required: No <br />
+  * Default value: None <br />
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..a01cf32e66
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph Explorer
+
+> TuGraph Explorer has merged to [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..8519247cc9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Utility Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..8ebe10da56
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/1.python-client.md
@@ -0,0 +1,222 @@
+# TuGraph Python SDK
+
+> This document is the usage instruction of TuGraph Python SDK
+
+## 1.Overview
+There are two kinds of Python's TuGraph Client. One is the RESTful Client, which uses the HTTP method to send requests to the server. The other is the RPC Client, which uses the RPC method to call the server remote service. Both have their own advantages and disadvantages. The RESTful client is simple to use. You can find the source code file of the Client in the src/client/python/TuGraphClient directory of the project. You can install it directly into the user environment and use it. However, it supports fewer functions and its performance is not high. RPC Client supports both stand-alone servers and high-availability clusters and load balancing. It has many interfaces and powerful functions. However, the usage is more complicated. Users need to compile the TuGraph project themselves to obtain liblgraph_client_python.so, or directly find the dependent library in the /usr/local/lib64 directory when using the runtime image, and introduce it into the python project for normal use. Next, the usage of these two Clients will be introduced in detail.
+
+## 2.RESTful Client
+
+### 2.1. Install Client
+
+TuGraph's Python RESTful client uses the setuptools tool for packaging and distribution. Users can install the client directly into the local environment and introduce it directly when using it.
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+Note: When using the setuptools tool to install the python client, dependencies such as httpx will be installed and need to be executed in an environment with external network access.
+
+### 2.2.Call cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.Call stored procedure
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python's TuGraph Rpc Client is a CPP Client SDK packaged using pybind11. The following table lists the correspondence between Python and CPP Client SDK.
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+The use of Python RPC Client is more complicated. Users can compile TuGraph in the local environment to get liblgraph_client_python.so, or they can use the official runtime image. The dependent library can be found directly in the /usr/local/lib64 directory in the image. It can be used after introducing the user project.
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.Instantiate the client object
+
+#### 3.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+
+#### 3.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 3.2.Call cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.3.Send cypher request to leader
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.4.Call GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.5.Send GQL request to leader
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 3.6.Calling stored procedures
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.7.Call the stored procedure to the leader
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 3.8.Load stored procedure
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 3.9.List stored procedures
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 3.10.Delete stored procedures
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 3.11.Import schema from byte stream
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.12.Import edge data from byte stream
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 3.13.Import schema from file
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 3.14.Import point and edge data from file
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..260a8c6c29
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,339 @@
+# TuGraph C++ SDK
+
+> This document is the usage instruction of TuGraph C++ SDK
+
+## 1.Instructions
+
+C++ Client can use RPC to connect to lgraph_server to import data, execute stored procedures, call Cypher and other operations.
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Introduce dependencies and instantiate
+
+#### 2.1.1. Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2. Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3. Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.3. Send cypher request to leader
+```C++
+     std::string str;
+     bool ret = client.CallCypherToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0);
+     @param [out] result The result.
+     @param [in] cypher inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```C++
+     std::string str;
+     bool ret = client.CallGql(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGql(std::string& result, const std::string& gql,
+                     const std::string& graph = "default", bool json_format = true,
+                     double timeout = 0, const std::string& url = "");
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @param [in] url (Optional) Node address of calling gql.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.5. Send GQL request to leader
+```C++
+     std::string str;
+     bool ret = client.CallGqlToLeader(str,
+         "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+     bool CallGqlToLeader(std::string& result, const std::string& gql,
+                  const std::string& graph = "default", bool json_format = true,
+                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] gql inquire statement.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```C++
+     std::string str;
+     bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedure(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true,
+                        const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] url (Optional) Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```C++
+     std::string str;
+     bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+     bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                        const std::string& procedure_name, const std::string& param,
+                        double procedure_time_out = 0.0, bool in_process = false,
+                        const std::string& graph = "default", bool json_format = true);
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] param the execution parameters.
+     @param [in] procedure_time_out (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @param [in] in_process (Optional) support in future.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in json format. Specifying jsonFormat as false can return the execution result in string format.
+
+### 2.8. Load stored procedure
+```C++
+     std::string str;
+     bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+     bool LoadProcedure(std::string& result, const std::string& source_file,
+                        const std::string& procedure_type, const std::string& procedure_name,
+                        const std::string& code_type, const std::string& procedure_description,
+                        bool read_only, const std::string& version = "v1",
+                        const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] source_file the source_file contain procedure code.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] code_type code type, currently supported PY, SO, CPP, ZIP.
+     @param [in] procedure_description procedure description.
+     @param [in] read_only procedure is read only or not.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```C++
+     std::string str;
+     bool ret = client.ListProcedures(str);
+```
+```
+     bool ListProcedures(std::string& result, const std::string& procedure_type,
+                         const std::string& version = "any",
+                         const std::string& graph = "default", const std::string& url = "");
+     @param [out] result The result.
+     @param [in] procedure_type (Optional) the procedure type, "" for all procedures,
+                                  CPP and PY for special type.
+     @param [in] version (Optional) the version of procedure.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] url Node address of calling procedure.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, the request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```C++
+     std::string str;
+     bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+     bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                          const std::string& procedure_name, const std::string& graph = "default");
+     @param [out] result The result.
+     @param [in] procedure_type the procedure type, currently supported CPP and PY.
+     @param [in] procedure_name procedure name.
+     @param [in] graph (Optional) the graph to query.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```C++
+     std::string str;
+     bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+     bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                  const std::string& graph = "default", bool json_format = true,
+                                  double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema the schema to be imported.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```C++
+     std::string str;
+     ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+     bool ImportDataFromContent(std::string& result, const std::string& desc,
+                                const std::string& data, const std::string& delimiter,
+                                bool continue_on_error = false, int thread_nums = 8,
+                                const std::string& graph = "default", bool json_format = true,
+                                double timeout = 0);
+     @param [out] result The result.
+     @param [in] desc data format description.
+     @param [in] data the data to be imported.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+     bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+     @param [out] result The result.
+     @param [in] schema_file the schema_file contain schema.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, otherwise, binary
+                              format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```C++
+     std::string conf_file("./yago.conf");
+     std::string str;
+     ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+     bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                             const std::string& delimiter, bool continue_on_error = false,
+                             int thread_nums = 8, int skip_packages = 0,
+                             const std::string& graph = "default", bool json_format = true,
+                             double timeout = 0);
+     @param [out] result The result.
+     @param [in] conf_file data file contains format description and data.
+     @param [in] delimiter data separator.
+     @param [in] continue_on_error (Optional) whether to continue when importing data fails.
+     @param [in] thread_nums (Optional) maximum number of threads.
+     @param [in] skip_packages (Optional) skip packages number.
+     @param [in] graph (Optional) the graph to query.
+     @param [in] json_format (Optional) Returns the format, true is json, Otherwise,
+                                      binary format.
+     @param [in] timeout (Optional) Maximum execution time, overruns will be
+                                      interrupted.
+     @returns True if it succeeds, false if it fails.
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..1c560141d3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/3.java-client.md
@@ -0,0 +1,289 @@
+# TuGraph Java SDK
+
+> This document primarily provides usage instructions for the TuGraph Java SDK. It is crucial to note that the TuGraph Java SDK will no longer receive updates or maintenance in the future. Users are strongly advised to utilize [bolt](./5.bolt-client.md) instead.
+
+## 1.Compile java client code
+
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+
+## 2.Demo
+
+### 2.1.Instantiate the client object
+
+Adding maven dependencies
+
+```xml
+<dependency>
+    <groupId>com.antgroup.tugraph</groupId>
+    <artifactId>tugraph-db-java-rpc-client</artifactId>
+    <version>1.4.1</version>
+</dependency>
+```
+
+Introduce dependencies
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.Instantiate a single node client object
+When starting the server in single-node mode, the client is instantiated in the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.Instantiate the HA cluster to directly connect to the client object
+When the HA cluster deployed on the server can be directly connected using the URL configured in ha_conf, the client is instantiated according to the following format
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+The user only needs to pass in the url of any node in the HA cluster, and the client will automatically maintain the connection pool based on the query information returned by the server, and there is no need to manually restart the client when the HA cluster expands horizontally.
+
+#### 2.1.3.Instantiate the HA cluster to indirectly connect to the client object
+When the HA cluster deployed on the server cannot use the URL configured in ha_conf to connect directly but must use an indirect URL (such as the Alibaba Cloud public network URL), the client is instantiated according to the following format.
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+Because the URL that the user connects to is different from the information configured when the server starts, the client connection pool cannot be automatically updated by sending a request to the cluster, so it is necessary to manually pass in the URLs of all nodes in the cluster when starting the client, and when the cluster node changes Manually restart the client.
+
+### 2.2.Call cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.3. Send cypher request to leader
+```java
+     String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param cypher: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.4. Call GQL
+```java
+     String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @param url: (Optional) Node address of calling GQL
+     @return: the result of GQL query execution
+     public String callGql(String gql, String graph, double timeout, String url)
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+Note: JAVA does not support default parameters, therefore, default parameters in JAVA are implemented using overloaded functions.
+
+### 2.5. Send GQL request to leader
+```java
+     String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+     log.info("db.edgeLabels() : " + res);
+```
+```
+     @param gql: inquire statement.
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of cypher query execution
+     public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+This interface only supports use in HA mode. In the client in HA mode, in order to prevent requests from being sent to followers with unsynchronized data,
+Users can directly send requests to the leader, and the leader is elected by the cluster.
+
+### 2.6. Calling stored procedures
+```java
+     String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @param url: (Optional) Node address of calling procedure
+     @return: the result of procedure execution
+     public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph, String url)
+```
+This interface supports use in stand-alone mode and HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.7. Call the stored procedure to the leader
+```java
+     String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+     log.info("testCallProcedureToLeader : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param param: the execution parameters
+     @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+     @param inProcess: Running query or not
+     @param graph: the graph to query
+     @param jsonFormat: (Optional) Return format of calling stored procedure
+     @return: the result of procedure execution
+     public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+             boolean inProcess, String graph)
+```
+This interface supports use in HA mode. By default, the execution result of the stored procedure is directly returned in string format. Specifying jsonFormat as true can return the execution result in json format.
+
+### 2.8. Load stored procedure
+```java
+     boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param sourceFile: the source_file contains procedure code
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param codeType: code type, currently supported PY, SO, CPP, ZIP
+     @param procedureDescription: procedure description
+     @param readOnly: procedure is read only or not
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                               String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since loading a stored procedure is a write request, the client in HA mode can only send a request to load a stored procedure to the leader.
+
+### 2.9. List stored procedures
+```java
+     String result = client.listProcedures("CPP", "any", "default");
+     log.info("listProcedures : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param version: The version of procedure
+     @param graph: the graph to query.
+     @param url: (Optional) Node address of listing procedure
+     @return: the list of procedures
+     public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, in the client in HA mode, a read request can be directed to a server by specifying the url parameter.
+
+### 2.10. Delete stored procedures
+```java
+     String result = client.deleteProcedure("CPP", "sortstr", "default");
+     log.info("loadProcedure : " + result);
+```
+```
+     @param procedureType: the procedure type, currently supported CPP and PY
+     @param procedureName: procedure name
+     @param graph: the graph to query.
+     @return: the result of procedure execution
+     public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since deleting a stored procedure is a write request, the client in HA mode can only send a delete request to the leader.
+
+### 2.11. Import schema from byte stream
+```java
+     boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+     log.info("importSchemaFromContent : " + ret);
+```
+```
+     @param schema: the schema to be imported
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.12. Import edge data from byte stream
+```java
+     boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+     log.info("importDataFromContent : " + ret);
+```
+```
+     @param desc: data format description
+     @param data: the data to be imported
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+             int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
+
+### 2.13. Import schema from file
+```java
+     boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+     log.info("importSchemaFromFile : " + ret);
+```
+```
+     @param schemaFile: the schema_file contains schema
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import schema
+     public boolean importSchemaFromFile(String schemaFile, String graph, double timeout)
+             throws UnsupportedEncodingException, IOException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing schema is a write request, the client in HA mode can only send an import schema request to the leader.
+
+### 2.14. Import point and edge data from file
+```java
+     boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+     log.info("importDataFromFile : " + ret);
+```
+```
+     @param confFile: data file contains format description and data
+     @param delimiter: data separator
+     @param continueOnError: whether to continue when importing data fails
+     @param threadNums: maximum number of threads
+     @param skipPackages: skip packages number
+     @param graph: the graph to query.
+     @param timeout: Maximum execution time, overruns will be interrupted
+     @return: the result of import data
+     public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+             int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+This interface supports use in stand-alone mode and HA mode. Among them, since importing point and edge data is a write request, the client in HA mode can only send a request to import point and edge data to the leader.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..1a778b73ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,176 @@
+# TuGraph-OGM
+
+@TODO
+
+## 1.Introduction
+
+> TuGraph-OGM project is open source on other repositories.
+
+TuGraph-OGM (Object Graph Mapping) is a graph object mapping tool designed for TuGraph. It supports the mapping of Java objects (POJO) into TuGraph. The classes in Java are mapped to nodes in the graph, the collections in the classes are mapped to edges, and the properties of the classes are mapped to the attributes of the graph objects. It also provides corresponding functions to manipulate the graph database. Therefore, Java developers can easily use TuGraph database in the familiar ecosystem. TuGraph-OGM is also compatible with Neo4j-OGM. Neo4j ecosystem users can migrate seamlessly to TuGraph database.
+
+### 1.1.Functions of TuGraph-OGM
+
+TuGraph-OGM provides the following functions for operating TuGraph:
+
+| Function                            | Usage                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| Insert single vertex/edge                 | void session.save(T object)                                                      |
+| Batch insert vertexs/edges                 | void session.save(T object)                                                      |
+| Delete vertex and its corresponding edges                | void session.delete(T object)                                                    |
+| Delete all vertexs with specific label       | void session.deleteAll(Class\<T> type)                                           |
+| Clear the database                      | void purgeDatabase()                                                             |
+| Update vertex                        | void session.save(T newObject)                                                   |
+| Query single node by id            | T load(Class<T> type, ID id)                                                     |
+| Query multiple nodes by ids           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| Query all nodes with specific label         | Collection\<T> loadAll(Class\<T> type)                                           |
+| Query with conditions                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher query (specify the return type) | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher query                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.Compile TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.Use TuGraph-OGM
+
+Please refer to the detailed examples in TuGraphOGMDemo under the demo folder.How to import dependencies in `pom.xml`.
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // create Movie vertex
+    @Id
+    private Long id;      // Movie id
+    private String title; // title attribute
+    private int released; // released attribute
+
+    // create Edge ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // create Actor vertex
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// configuration
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//Start driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// Open session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.Perform CRUD operations through OGM
+
+```java
+// new
+Movie jokes = new Movie("Jokes", 1990);  // Create Movie-vertex "jokes"
+session.save(jokes);                     // Store "jokes" in TuGraph
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // Connect the "speed" vertex with the "alice" vertex through the ACTS_IN relationship
+session.save(speed);                    // Store two vertexs and one edge
+
+// delete
+session.delete(alice);                  // Delete the "alice" vertex and its connected edge
+Movie m = session.load(Movie.class, jokes.getId());   // Get the "jokes" vertex based on its id
+session.delete(m);                                    // Delete the "jokes" node
+
+// update
+speed.setReleased(2018);
+session.save(speed);                   // Update the "speed" attribute
+
+// get
+Collection<Movie> movies = session.loadAll(Movie.class);  // Get all Movie vertexs
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // Query all movies released before 1995
+
+// Call Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // Query the Movie with "Speed" of 2018
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // Create vertex label "Director"
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // Create edge label "DIRECT"
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // Get the create result
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // View the number of vertexs created
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //View the number of edges created
+
+// Clear the database
+session.deleteAll(Movie.class);        // Delete all Movie vertexs
+session.purgeDatabase();               // Delete all data
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..7861c59a9b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,74 @@
+
+# Bolt client
+
+TuGraph implements Neo4j's bolt protocol, you can use Neo4j's client to access TuGraph.
+
+## Enable bolt port
+
+The Bolt port is enabled by default on port 7687. If you need to change the port, you can do so in the configuration file. For services deployed using the Docker method, the configuration file is located within the container at `/usr/local/etc/lgraph.json`; for services deployed using the RPM package, the configuration file is on the server at `/usr/local/etc/lgraph.json`. To apply the port change, you will need to restart the service. Specific instructions for restarting the service can be found in [Tugraph Running](../../5.installation&running/7.tugraph-running.md). Additionally, for a detailed explanation of the configuration options available in the configuration file, see the "Configuration parameters" section in [Tugraph Running](../../5.installation&running/7.tugraph-running.md).
+
+## Use case example
+
+Add Maven dependency
+
+```xml
+<dependency>
+    <groupId>org.neo4j.driver</groupId>
+    <artifactId>neo4j-java-driver</artifactId>
+    <version>4.4.2</version>
+</dependency>
+```
+
+Instantiate the client as follows:
+
+```java
+    Driver driver = GraphDatabase.driver("bolt://ip:port", AuthTokens.basic("admin", "73@TuGraph"));
+```
+
+Common statements:
+
+```java
+        //Create a session through the driver object, setting the session to connect to a specific database, to execute Cypher statements.
+        Session session = driver.session(SessionConfig.forDatabase("default"));
+        //Clear the graph project, please do not attempt this lightly as it will delete both the schema and data of the selected graph project.
+        session.run("CALL db.dropDB()");
+        //Create vertex
+        session.run("CALL db.createVertexLabel('person', 'id' , 'id' ,INT32, false, 'name' ,STRING, false)");
+        //Create edge
+        session.run("CALL db.createEdgeLabel('is_friend','[[\"person\",\"person\"]]')");
+        //Create index
+        session.run("CALL db.addIndex(\"person\", \"name\", false)");
+        //Insert vertex data
+        session.run("create (n1:person {name:'jack',id:1}), (n2:person {name:'lucy',id:2})");
+        //Insert edge data
+        session.run("match (n1:person {id:1}), (n2:person {id:2}) create (n1)-[r:is_friend]->(n2)");
+        //Query vertices and edges
+        Result res = session.run("match (n)-[r]->(m) return n,r,m");
+        //Parameterized Query
+        String cypherQuery = "MATCH (n1:person {id:$id})-[r]-(n2:person {name:$name}) RETURN n1, r, n2";
+        Result result1 = session.run(cypherQuery, parameters("id", 1, "name", "lucy"));
+        while (result1.hasNext()) {
+        Record record = result1.next();
+        System.out.println("n1: " + record.get("n1").asMap());
+        System.out.println("r: " + record.get("r").asMap());
+        System.out.println("n2: " + record.get("n2").asMap());
+                }        
+        //Delete vertex data
+        session.run("match (n1:person {id:1}) delete n1");
+        //Delete edge data
+        session.run("match (n1:person {id:1})-[r]-(n2:person{id:2}) delete r");
+        //Delete edge
+        session.run("CALL db.deleteLabel('edge', 'is_friend')");
+        //Delete vertex
+        session.run("CALL db.deleteLabel('vertex', 'person')");
+```
+
+Details on the use of Cypher and stored procedures can be found in [Cypher](../../8.query/1.cypher.md)
+
+## Limitations on use
+
+Currently, our system does not fully support all advanced features of the Neo4j Bolt protocol. In particular, immediate transaction processing and flexible weak schema, two unique capabilities of the Neo4j client, are not yet supported. Therefore, when using the client, please make sure to avoid operations that involve these features to ensure smooth running of the application and consistency of data.
+
+## Example of Client Usage
+
+In the code directory under demo/Bolt, there are examples in Golang, JavaScript, Java, JavaScript, Python, and Rust. To learn more, see [Example of Client Usage](https://github.com/TuGraph-family/tugraph-db/tree/master/demo)
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..3ba53fb6f5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,107 @@
+# TuGraph console client
+
+`lgraph_cli` is a console client based on the bolt protocol, written in c++, which requires a connection to tugraph's bolt port.
+
+`lgraph_cypher` is a console client based on http, written in python, which requires a connection to tugraph's http port.
+
+`lgraph_cypher` needs some python libraries to be installed.
+
+`lgraph_cli` is a binary executable file that has no dependencies on other dynamic libraries and can be executed by copying it to a linux server.
+
+## `lgraph_cli`
+
+The statement ends with a semicolon, type `exit`, `quit` or Ctrl-C to exit the client.
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+The statement can be inputed on more than one line.
+
+```
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+non-interactive
+
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+read statements from file
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## online export
+
+lgraph_cli supports streaming read, so just redirect the output to a file. The output format supports csv and json
+
+### csv
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..fed821e48b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,118 @@
+# TuGraph RESTful API
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+## 2.Request And Response Format
+Tugraph HTTP Server receives requests in json format，After authentication, fields in the request are extracted, the request is processed according to the defined interface logic, and the response in json format is returned.
+
+### 2.1.Standard Response Format
+Each response is returned in the standard response format, as follows：
+
+| body parameter  | parameter description  | parameter type | necessary |
+|--------------|------------------------|----------|-----------|
+| errorCode    | error code             | int      | yes       |
+| success      | Whether the request was successful | int      | yes       |
+| errorMessage | error message          | string   | yes         |
+| data         | the response information returned when the request is successful | json string | yes         |
+
+### 2.2. Request Type
+
+#### 2.2.1. User Login
+The user sends the login request to the server with the user name and password. After successful login, the client receives a signed token (the Json Web Token) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token stored by the client and added to the Authorization domain of the request header in subsequent requests. If the login fails, you will receive the Authentication failed error.
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body parameter | parameter description | parameter type  | necessary       |
+|----------------|-----------------------|-------|------------|
+| user           | name of the user      | string   | yes          |
+| password       | password of the user  | string | yes          |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00 and the token will be included in data
+
+| body parameter            | parameter description         | parameter type |
+|------------------|------------------|----------------|
+| jwt              | token               | string         |
+| is_admin         | Whether the user is an admin     | bool           |
+| default_password | Whether it is the default password           | bool           |
+
+**Example request.**
+
+```
+    {"user" : "admin", "password" : "73@TuGraph"}
+```
+
+#### 2.2.2. User Logout
+When a user logs out, the authenticated token is deleted. and the user needs to log in again to obtain a new token when sending subsequent requests.
+
+- **URI**:     /logout
+- **METHOD**:  POST
+- **REQUEST**:
+  The http request header carries the token returned by login interface. The specific string to be filled is `Bearer ${jwt}`, where `${jwt}` is the "jwt" returned from the login interface，and the body has no parameters
+
+| header parameter           | parameter description | parameter type   |
+|------------------|-----------------------|------------|
+| Authorization              | Bearer ${jwt}         | string |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00, and data is
+
+| body parameter         | parameter description           | parameter type |
+|------------------|--------------------|----------------|
+| is_admin         | Whether the user is an admin    | bool           |
+
+#### 2.2.3. Refresh Token
+If the delivered token becomes invalid, you need to invoke this interface for re-authentication. The token is valid within one hour after the first login and needs to be refreshed
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+  The http request header carries the token returned by login interface. The specific string to be filled is `Bearer ${jwt}`, where `${jwt}` is the "jwt" returned from the login interface，and the body has no parameters
+
+| header parameter           | parameter description | parameter type   |
+|------------------|-----------------------|------------|
+| Authorization              | Bearer ${jwt}         | string |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00, and the token will be included in data
+
+| body parameter | parameter description | parameter type |
+|----------------|------|----------------|
+| jwt            | token  | string         |
+| is_admin       | Whether the user is an admin    | bool           |
+
+#### 2.2.4. Call Cypher
+User manipulation of data and models in tugraph requires calling the cypher interface and is initiated through the standard cypher query language
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header parameter           | parameter description | parameter type   |
+|------------------|-----------------------|------------|
+| Authorization              | Bearer ${jwt}         | string |
+
+| body parameter  | parameter description | parameter type | necessary |
+| ------- |------------------|---------|-----------|
+| graph   | the name of the subgraph to be queried | string  | yes       |
+| script   | query statement  | string  | yes         |
+
+- **RESPONSE**:
+  If successful, the success field in the returned response message will be set to 00, and the query results will be included in data
+
+| body parameter  | parameter description | parameter type | necessary    |
+| ------- |------|----------------|------------|
+| result   | query results | json string    | yes          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..911de26909
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,269 @@
+# RPC API
+
+> This document mainly introduces the details of calling TuGraph's RPC API.
+
+## 1.Introduction
+
+TuGraph provides rich RPC APIs for developers to remotely call the services provided by TuGraph through RPC requests.
+
+RPC (Remote Procedure Call) is a protocol for requesting services from remote computer programs through a network without the need to understand the underlying network technology.
+Compared with REST, RPC is method-oriented and mainly used for calling function methods. It is suitable for more complex communication scenarios and has higher performance.
+brpc is an industrial-grade RPC framework written in C++. Based on brpc, TuGraph provides rich RPC APIs. This document describes how to use TuGraph's RPC API.
+
+## 2.Request
+
+### 2.1.Establishing a Connection
+
+When developers send RPC requests to TuGraph services, they must first establish a connection. Taking C++ as an example, developers create a channel with the specified URL and create a specified service stub (LGraphRPCService_Stub) from the channel. Subsequently, they can send requests to the remote server through the stub like calling local methods.
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.Request Types
+
+TuGraph supports 10 types of RPC requests, and each request's functionality is shown in the following table:
+
+| Request              | Functionality         |
+|-----------------|------------|
+| GraphApiRequest | Vertex-Edge Index   |
+| CypherRequest   | cypher   |
+| PluginRequest   | Stored Procedures     |
+| HARequest       | High Availability    |
+| ImportRequest   | Data Import     |
+| GraphRequest    | Subgraph Operations     |
+| AclRequest      | Access Control     |
+| ConfigRequest   | Configuration     |
+| RestoreRequest  | Backup       |
+| SchemaRequest   | Schema Management |
+
+When a user sends a request, the following parameters need to be passed in:
+- client_version: an optional parameter, in HA mode, it can prevent outdated responses by comparing `client_version` and `server_version`
+- token: a necessary parameter, the client obtains the token after logging in, and the token is passed in with each request to verify the user's identity
+- is_write_op: an optional parameter, indicating whether the request is a write request
+- user: an optional parameter, set user when synchronizing requests between master and slave in HA mode, and no token verification is required After the service processes the RPC request, it sends back a response.
+
+In addition to containing separate response information for each request, the response message also includes the following parameters:
+- error_code: a necessary parameter, indicating the processing status of the request
+- redirect: an optional parameter, when processing fails to send a write request to a follower in HA mode, set redirect as the request forwarding address, that is, the leader address
+- error: an optional parameter, indicating the error information of the request
+- server_version: an optional parameter, set `server_version` in the HA mode request response to avoid reverse time travel when client reads data
+
+:warning:  **Except for CypherRequest, PluginRequest, HARequest and AclRequest, all other RPC interfaces will be gradually deprecated, and their functions will be unified into the CypherRequest interface.**
+
+## 3.Login
+
+The login request message contains the following parameters:
+- user: a necessary parameter, the username
+- pass: a necessary parameter, the password
+
+Taking C++ as an example, the user sends a login request using the constructed service stub:
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+The login response message contains the following parameters:
+- token: a necessary parameter. After successful login, a signed token, namely Json Web Token, will be received. The client stores the token and uses it for each subsequent request. If the login fails, an "Authentication failed" error will be received.
+
+## 4.Query
+Users can interact with TuGraph through Cypher queries. The Cypher request message contains the following parameters:
+- query: a necessary parameter, the Cypher query statement
+- param_names: an optional parameter, the parameter name
+- param_values: an optional parameter, the parameter value
+- result_in_json_format: a necessary parameter, whether to return the query results in JSON format
+- graph: an optional parameter, the subgraph name for executing the Cypher statement
+- timeout: an optional parameter, the timeout for executing the Cypher statement
+
+Taking C++ as an example, the user sends a Cypher request as follows:
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+The Cypher request response contains one of the following two parameters:
+- json_result: the Cypher query result in JSON format
+- binary_result: the Cypher query result in the CypherResult format
+
+## 5.Stored Procedures
+To meet users' more complex query/update logic, TuGraph supports stored procedures written in C and Python. Users can use RPC requests to perform CRUD operations on stored procedures.
+
+### 5.1.Load Stored Procedures
+The request for loading stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- read_only: a necessary parameter, whether it is read-only
+- code: a necessary parameter, the ByteString generated by reading the stored procedure file
+- desc: an optional parameter, the stored procedure description
+- code_type: an optional parameter, the stored procedure code type, which can be PY, SO, CPP, or ZIP
+
+Taking C++ as an example, the user loads the stored procedure as follows:
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for loading the stored procedure does not contain parameters, and if the loading fails, a BadInput exception will be thrown.
+
+### 5.2.Invoke Stored Procedures
+
+The request for invoking stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+- param: a necessary parameter, the stored procedure parameters
+- result_in_json_format: an optional parameter, whether to return the invocation result in JSON format
+- in_process: an optional parameter, to be supported in the future
+- timeout: an optional parameter, the timeout for invoking the stored procedure
+
+Taking C++ as an example, the user invokes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+The response for invoking the stored procedure contains one of the following two parameters:
+- reply: the stored procedure invocation result in the ByteString format
+- json_result: the stored procedure invocation result in JSON format
+
+### 5.3.Delete Stored Procedures
+
+The request for deleting stored procedures contains the following parameters:
+- name: a necessary parameter, the stored procedure name
+
+Taking C++ as an example, the user deletes the stored procedure as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+The response for deleting the stored procedure does not contain parameters, and if the deletion fails, a BadInput exception will be thrown.
+
+### 5.4.List Stored Procedures
+
+The request for listing stored procedures does not require parameters. Taking C++ as an example, the user lists the stored procedures as follows:
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+The response for listing the stored procedures contains the following parameter:
+- reply: the procedure list in JSON format
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..3ecfbae4cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2738 @@
+# TuGraph RESTful API Legacy
+
+> This document describes how to call the Rest API of TuGrpah.
+
+## 1.Introduction
+
+TuGraph provides HTTP RESTful APIs, which allow users to access TuGraph servers through HTTP requests remotely.
+
+This document specifiers the TuGraph HTTP RESTful API.
+
+:warning: **All the other RESTful APIs excluding the three below will be deprived after 4/30/2023.**
+- **Login**
+- **Query**
+- **Store Procedures**
+
+## 2.Protocols And Data Format
+
+### 2.1.Protocols
+
+Both HTTP and HTTPS protocols are supported by TuGraph. The system uses HTTP protocol by default. To use HTTPS, the `ssl_auth` option should be set to `true` in the DB configuration.
+
+### 2.2.Request
+
+TuGraph supports HTTP GET/POST/PUT/DELETE requests, in which:
+
+- `GET` requests are used for read-only requests, such as getting vertex properties, edge properties, etc.
+
+- `POST` requests are used to create entities, submit Cypher, and to manage and call stored procedures;
+
+- `PUT` requests are used to modify existing entities, for example, to modify vertex properties, edge properties, etc.
+
+- `DELETE` requests are used to delete existing entities, such as vertices, edges, etc.
+
+In high-availability mode, users can set `ServerVersion` in the request header to make sure the request is never served with an outdated version.
+The current `ServerVersion` can be obtained from the header returned by the server.
+
+### 2.3.Response
+
+TuGraph returns the following HTTP status codes:
+
+- **200 OK**: operation is successful.
+- **307 Temporary Redirect**: the operation is redirected, typically in high-availability mode, to the master.
+- **400 Bad Request**: incorrect input, such as URI error, or invalid parameters.
+- **500 Internal Server Error**: server error.
+
+When the operation is successful, the JSON response contains the return value of the operation. When the operation is redirected, the `location` field in the returned HTTP header contains the redirect destination address.
+When an input error or server error occurs, the JSON response contains a `error_message` field that describes the error.
+
+In high-availability mode, the server will set `server_version` field in the header to inform the client of the data version of the current server. When clients switch between several different servers, this version number guarantees that the client will not read from an outdated server.
+
+### 2.4.Data Format
+
+The server and clients exchange data in JSON format. When sending a request, the header of the HTTP request should be set with `Accept:application/json, Content-Type:app/json`.
+For example, to create a new vertex, the request header should look like the following:
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.5.URI Format
+
+TuGraph REST API provides access to: web visualization, login, db info, label, index, node, relationship, cypher, task, cpp_plugin, and python_plugin.
+The URI format used for each function is as follows:
+
+| URI     | Description                     |
+| ------- | ------------------------------- |
+| /web    | web visualization               |
+| /cypher | cypher request                  |
+| /acl    | access control                  |
+| /user   | user management                 |
+| /login  | user login                      |
+| /info   | database status and information |
+| /task   | task management                 |
+| /db     | subgraph management             |
+
+For each subgraph, the following interfaces are provided:
+
+| URI                              | Description                         |
+| -------------------------------- | ----------------------------------- |
+| /db                              | create, modify, and delete subgraph |
+| /db/_{graph_name}_/node          | vertex operations                   |
+| /db/_{graph_name}_/relationship  | edge operations                     |
+| /db/_{graph_name}_/label         | label-related operations            |
+| /db/_{graph_name}_/index         | index-related operations            |
+| /db/_{graph_name}_/cypher        | subgraph-specific cypher operation  |
+| /db/_{graph_name}_/cpp_plugin    | C++ plugin(stored procedure)        |
+| /db/_{graph_name}_/python_plugin | Python plugin(stored procedure)     |
+| /db/_{graph_name}_/import        | online import                       |
+| /db/_{graph_name}_/misc          | other operations                    |
+
+## 3.Login
+
+The system creates an administrator by default, whose username is _admin_ and password is _73@TuGraph_. For security reasons, please remember to change your password after first starting the server.
+
+### 3.1.User Login
+
+TuGraph provides JWT-based user authentication. To log in to the server, the REST client should send a login request containing a username and password. Upon success, the client will receive a signed token in the form of a Json Web Token (JWT) and a Boolean variable (default_password) to determine whether it is the default password. The jwt token should be stored by the client and used for each subsequent request.
+
+- **URI**: `/login`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| user     | username    | String |
+| password | password    | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+| default_password | whether it is the default password | Bool |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.Token Refresh
+
+After the token expires, the front-end initiates a refresh token interface, and the back-end verifies the validity of the token.
+If the verification passes, a new token is generated; if the verification fails, status code 401 is returned.
+
+- **URI**: `/refresh`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**:
+
+| Field | Description | Type   |
+| ----- | ----------- | ------ |
+| jwt   | token       | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.Modify Token Validity Period
+
+To modify the validity period of Token, three parameters need to be transmitted: jwt, refresh_time and expire_time, among which jwt is used to verify the user’s identity. When refresh_time and expire_time are equal to 0, the validity period is indefinite. When refresh_time exceeds, you need to call the refresh interface to obtain a new Token; When expire_time expires, you need to log in again. (This interface call needs to confirm the security by itself, do not call unless necessary)
+
+- **URI**: `/update_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+| refresh_time | Valid time (deafult set to 0) | Int64 |
+| expire_time | Expire time (deafult set to 0) | Int64 |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.Query Token validity period
+To query the validity period of the Token, you need to transmit jwt to verify the user's identity, and return, refresh_time and expire_time, where refresh_time indicates the refresh time, and you need to call the refresh interface to obtain a new Token when it exceeds; expire_time indicates the expiration time, and you need to log in again when it exceeds.
+
+- **URI**: `/get_token_time`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return "refresh_time" and "expire_time".
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+### 3.5.Logout
+
+The user logs out and deletes the token at the same time.
+
+- **URI**: `/logout`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description | Type   |
+| -------- | ----------- | ------ |
+| Authorization      | token       | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+## 4.Query
+
+URI format is:
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.Call Cypher
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description   | Type   |
+| ------ | ------------- | ------ |
+| graph  | subgraph name | String |
+| cypher | Cypher query  | String |
+
+- **RESPONSE**:
+
+| Field   | Description             | Type    |
+| ------- | ----------------------- | ------- |
+| result  | running results         | List    |
+| elapsed | running time in seconds | Float   |
+| header  | header of the results   | List    |
+| size    | number of results       | Integer |
+
+in which `header` is a list with each element in the form of:
+
+| Field | Description                                                | Type   |
+| ----- | ---------------------------------------------------------- | ------ |
+| name  | the name of column                                         | String |
+| type  | column data type, 0 is scalar, 1 is vertex id, 2 is vector |        |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.Call Cypher with Parameters
+
+Cypher supports querying with parameters. When a Cypher query with parameters is called, TuGraph caches the execution plan for that query to speed up the following queries of the same kind.
+
+- **URI**: `/cypher`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type   |
+| ---------- | ------------- | ------ |
+| graph      | subgraph name | String |
+| cypher     | Cypher query  | String |
+| parameters | parameters    | List   |
+
+- **RESPONSE**:
+
+Same as [Call Cypher](#Call-Cypher).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+## 5.Stored Procedures
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.Create Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                                                                       | Type   |
+| ----------- | --------------------------------------------------------------------------------- | ------ |
+| name        | name of the plugin                                                                | String |
+| description | description of the plugin                                                         | String |
+| code_base64 | code of plugin encoded in base64                                                  | String |
+| read_only   | whether it is a read-only stored procedure                                        | Bool   |
+| code_type   | type of plugin code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String |
+
+_Note: read-only plugins are more efficient than write plugins. Always specify `read-only=true` for read-only transactions._
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.so}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 5.2.List Stored Procedures
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list in which each element is a plugin description, in the format of:
+
+| Field       | Description                               | Type   |
+| ----------- | ----------------------------------------- | ------ |
+| name        | name of the stored procedure              | String |
+| description | description of the stored procedure       | String |
+| read_only   | whether the stored procedure is read-only | Bool   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.Retrieve Stored Procedure Detail
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Procedure detail, including code, in the format of:
+
+| Field       | Description                                                                         | Type                   |
+| ----------- | ----------------------------------------------------------------------------------- | ---------------------- |
+| name        | Procedure name                                                                      | String                 |
+| description | Procedure descrition                                                                | String                 |
+| read_only   | Read only or not                                                                    | Bool                   |
+| code_base64 | 存储过程的代码                                                                      | String, Base64 encoded |
+| code_type   | Type of procedue code, can be zip/cpp/so for cpp_plugin, while py for python_plugin | String                 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.Call Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: POST
+
+- **REQUEST**: String input.
+
+| Field   | Description                                               | Type   |
+| ------- | --------------------------------------------------------- | ------ |
+| data    | input data                                                | String |
+| timeout | timeout in seconds, defaults to 0, which means no timeout | Float  |
+
+- **RESPONSE**:
+
+| Field  | Description     | Type   |
+| ------ | --------------- | ------ |
+| result | running results | String |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.Delete Stored Procedure
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+## 6.Deprecated
+
+The APIs below will be removed after 4/30/2023.
+
+### 6.1.User Management
+
+#### 6.1.1.Add User
+
+Add a new user and set the initial password for the user. Only administrators have permission to add new users. The username can only have letters, numbers, and underscores, and should not begin with a number. The password can contain any character. The username and password have a maximum length of 64 bytes.
+
+- **URI**: `/user`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                                 | Type   |
+| -------- | ------------------------------------------- | ------ |
+| user     | username                                    | String |
+| password | password                                    | String |
+| is_admin | whether the user is an administrator or not | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "is_admin": false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.Change Password
+
+Users can change their own passwords, in which case the original password needs to be verified.
+
+Administrators can change the passwords of any user and promote non-admin users to administrators, or demote administrator users to regular users. When modifying another user's password, the original password of the user is not needed.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field            | Description                                                                     | Type   |
+| ---------------- | ------------------------------------------------------------------------------- | ------ |
+| current_password | user's current password, if modifying its own password                          | String |
+| new_password     | user's new password                                                             | String |
+| is_admin         | should this user be administrator or not, used when promoting or demoting users | Bool   |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/user/user1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+        "is_admin": true
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.1.3.List All Users
+
+List all users of the database. Only administrators are allowed to perform this operation.
+
+- **URI**: `/user/`
+
+- **METHOD**: GET
+
+- **RESPONSE**: a dictionary of {`user_name`:`is_admin`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+    • 200: OK
+    Output:
+    {
+        "admin": true,
+        "guest1": false
+    }
+
+#### 6.1.4.Delete User
+
+Delete a user from the DB. Only administrators have permission to do so.
+
+- **URI**: `/user/{user_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.2.Access Control
+
+TuGraph has four access levels. Different users can have different permissions for each subgraph. The four access levels are as follows:
+
+| Access Level | Description                                                                                                               |
+| ------------ | ------------------------------------------------------------------------------------------------------------------------- |
+| NONE         | no access                                                                                                                 |
+| READ         | read-only                                                                                                                 |
+| WRITE        | can read and write vertexes and edges of the subgraph                                                                     |
+| FULL         | full access, including changing metadata (label, index), managing stored procedures and deleting all data in the subgraph |
+
+Administrators have full access on all subgraphs, and a newly created non-admin user does not have access for any subgraph. Users who have full access on a subgraph can set the access level for other users on that subgraph.
+
+#### 6.2.1.Query User's Access Level
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+When both `user` and `graph` are specified, the user's access level for the subgraph is returned, such as `READ`.
+
+When only `user` is specified, all subgraphs that the user can access (access level not `NONE`) are returned, as well as the user's access level on the subgraph.
+
+When only `graph` is specified, all users who have access level on this graph (excluding administrators, who have implicit `FULL` access) and their access levels are returned. This operation requires administrator permission.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/acl/?user=user1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "graph1": "READ",
+      "graph2": "WRITE",
+      "graph3": "FULL"
+    }
+```
+
+#### 6.2.2.Change User's Access Level
+
+- **URI**: `/acl`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field | Description     | Type   |
+| ----- | --------------- | ------ |
+| user  | username        | String |
+| graph | subgraph's name | String |
+| acl   | access level    | String |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/acl
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "user1",
+        "graph": "graph1",
+        "acl": "FULL"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.Remove User's Access Right
+
+This is equivalent to setting access level to `NONE`.
+
+- **URI**: `/acl/?user={user_name}&graph={graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/acl/?user=user1&graph=graph1
+    • Accept: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.Server Status
+
+#### 6.3.1.Modify Server Configuration
+
+Modifying the server configuration will take effect immediately after the configuration modification and will affect all servers. These configurations take precedence over configuration files and command line arguments.
+
+- **URI**: `/config`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+  | Field            | Description                                           | Type |
+  | ---------------- | ----------------------------------------------------- | ---- |
+  | db_async         | Whether to enable asynchronous mode                   | Bool |
+  | optimistic_txn   | Whether to use optimistic transaction lock by default | Bool |
+  | enable_audit_log | Whether to enable audit logging                       | Bool |
+
+- **RESPONSE**: If successful, return status code 200.
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "db_async": true,
+        "enable_audit_log": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.Current Server Status
+
+- **URI**: `/info`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field          | Description                    | Type                                                                                    |
+| -------------- | ------------------------------ | --------------------------------------------------------------------------------------- |
+| lgraph_version | TuGraph version                | String                                                                                  |
+| git_branch     | server's git branch            | String                                                                                  |
+| git_commit     | server's git commit version    | String                                                                                  |
+| web_commit     | web client commit version      | String                                                                                  |
+| cpp_id         | cpp compiler id                | String                                                                                  |
+| cpp_version    | cpp compiler version           | String                                                                                  |
+| python_version | python lib version             | String                                                                                  |
+| cpu            | cpu information                | Dictionary, format refers [CPU Status](#CPU-Status)                                     |
+| disk           | disk IO information            | Dictionary, format refers [Disk Status](#Disk-Status)                                   |
+| memory         | memory information             | Dictionary, format refers [Memory Status](#Memory-Status)                               |
+| db_space       | graph database storage         | Dictionary, format refers [Graph Database Storage](#Graph-Database-Storage)             |
+| db_config      | graph database configuration   | Dictionary, format refers [Graph Database Configuration](#Graph-Database-Configuration) |
+| up_time        | database's online running time | Integer                                                                                 |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.CPU Status
+
+- **URI**: `/info/cpu`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description        | Type    |
+| ------ | ------------------ | ------- |
+| self   | TuGraph CPU usage  | Integer |
+| server | server's CPU usage | Integer |
+| unit   | metric unit        | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.Disk Status
+
+- **URI**: `/info/disk`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description              | Type    |
+| ----- | ------------------------ | ------- |
+| read  | server's disk read rate  | Integer |
+| write | server's disk wrtie rate | Integer |
+| unit  | metric unit              | String  |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.Memory Status
+
+- **URI**: `/info/memory`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description               | Type    |
+| ------------ | ------------------------- | ------- |
+| self         | TuGraph memory usage      | Integer |
+| server_avail | server's available memory | Integer |
+| server_total | server's total memory     | Integer |
+| unit         | metric unit               | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.Database Size
+
+- **URI**: `/info/db_space`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                | Type    |
+| ----- | -------------------------- | ------- |
+| space | total size of the database | Integer |
+| unit  | metric unit                | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.DB Configuration
+
+- **URI**: `/info/db_config`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field        | Description                                       | Type    |
+| ------------ | ------------------------------------------------- | ------- |
+| async        | asynchronous mode                                 | Bool    |
+| disable_auth | whether to disable authentication                 | Bool    |
+| enable_ha    | whether to enable high-availability mode          | Bool    |
+| enable_rpc   | whether to enable RPC server                      | Bool    |
+| host         | bound host address                                | String  |
+| port         | port of REST server                               | Integer |
+| rpc_port     | port of RPC server                                | Integer |
+| thread_limit | limit of available threads for the graph database | Integer |
+| use_ssl      | whether to use SSL for authentication             | Bool    |
+| verbose      | verbose level of the output                       | Integer |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "host":"127.0.0.1",
+      "port":7070,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "use_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.7.High Availability Server List
+
+Get a list of replication servers. Valid only in high-availability mode.
+
+- **URI**: `/info/peers`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of server information, each of server information is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+| state        | server state          | String |
+
+The server state can be `MASTER`, `SLAVE`, or `OFFLINE`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.8.Current Leader Information
+
+Get information of current leader. Valid only in HA mode.
+
+- **URI**: `/info/leader`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current leader server information, which is formatted as:
+
+| Field        | Description           | Type   |
+| ------------ | --------------------- | ------ |
+| rpc_address  | server's RPC address  | String |
+| rest_address | server's REST address | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.9.Server Statistics
+
+- **URI**: `/info/statistics`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the current server statistics, which is formatted as:
+
+| Field           | Description                                   | Type    |
+| --------------- | --------------------------------------------- | ------- |
+| requests/second | number of requests processed per second       | Float   |
+| writes/second   | number of write requests processed per second | Float   |
+| running_tasks   | number of requests in progress                | Integer |
+| failure_rate    | request failure rate                          | Float   |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 0.023,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.10.Get Audit Logs
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+
+| Field            | Description                                                                                                             | Type      |
+| ---------------- | ----------------------------------------------------------------------------------------------------------------------- | --------- |
+| begin_time       | start time of the queried log (required, format YYYY-mm-dd HH:MM:SS)                                                    | Timestamp |
+| end_time         | end time of the queried log (default is current time, format YYYY-mm-dd HH:MM:SS)                                       | Timestamp |
+| user             | the operator of the queried log (administrator can query all users' logs, ordinary users can only query their own logs) | String    |
+| num_log          | maximum number of logs to return (default 100)                                                                          | Integer   |
+| descending_order | whether to sort the result in descending order(default is true)                                                         | Bool      |
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and a list of audit logs, each of which is an action log in the format of:
+
+| Field      | Description                                        | Type    |
+| ---------- | -------------------------------------------------- | ------- |
+| index      | the index of the operation                         | Integer |
+| begin_time | the start time of the operation                    | String  |
+| end_time   | the end time of the operation                      | String  |
+| user       | the user of the operation                          | String  |
+| graph      | the graph of the operation                         | String  |
+| type       | the type of the operation                          | String  |
+| read_write | the operation is read operation or write operation | String  |
+| success    | whether the operation is successful                | Bool    |
+| content    | the content of the operation                       | String  |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.Task Management
+
+TuGraph tracks long-running tasks such as complex Cypher queries and plugins. Administrators can query currently running tasks through the REST API and choose to abort the queries if necessary.
+
+The URI format for task management is :
+
+```
+    http://{host}:{port}/task/{task_id}
+```
+
+#### 6.4.1.List Running Tasks
+
+- **URI**: `/task`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+The returned JSON is an array, each of which is formatted as follows:
+
+| Field        | Description                                      | Type   |
+| ------------ | ------------------------------------------------ | ------ |
+| description  | the description of the task                      | String |
+| time_elapsed | time the task has been executing for, in seconds | Float  |
+| task_id      | the ID of the task                               | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.Abort Task
+
+- **URI**: `/task/{task_id}`
+
+Where `task_id` is the `task_id` returned by `GET /task` .
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.5.Subgraph Management
+
+TuGraph supports multiple subgraphs and all subgraphs are completely independent from others. Different subgraphs can have different permissions to different users. Administrators can add, modify and delete subgraphs.
+
+#### 6.5.1.Create New Subgraph
+
+- **URI**: `/db`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description                   | Type                                                                |
+| ------ | ----------------------------- | ------------------------------------------------------------------- |
+| name   | the name of subgraph          | String                                                              |
+| config | the configuration of subgraph | Dictionary, in the format of {{column name 1}:{column value 1},...} |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1"
+        "config" : {
+            "max_size_GB":2048,
+            "async":True
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.Delete Subgraph
+
+- **URI**: `/db/{graph_name}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.List All Subgraphs
+
+- **URI**: `/db`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of all subgraphs.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_gb":1024,
+            "async":false
+        }
+    }
+```
+
+### 6.6.Label
+
+TuGraph is a strong-schema database. In each subgraph, each vertex and edge need to have a predefined data format. The data format is determined by Label. Users can use the REST API to add, delete, and query labels and their corresponding data format.
+
+The URI format of the Label operation is
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+Where the {type} can be `node` or `relationship`.
+
+#### 6.6.1.Create Label
+
+A label is created with a fixed data format. A label must be defined before any node or relationship can be created with that label.
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field            | Description                  | Type   |
+| ---------------- | ---------------------------- | ------ |
+| name             | the name of label            | String |
+| fields           | data column definition       | List   |
+| is_vertex        | whether it is a vertex Label | Bool   |
+| primary          | vertex primary property      | String |
+| edge_constraints | edge constraints             | List   |
+
+`primary` should be set when `is_vertex` is `true`. This field is only available for Vertex, and must be set when creating Vertex.
+
+`edge_constraints` could be set when `is_vertex` is `false`, This field is only available for Edge. This field limits the combination of starting and ending vertex of the edge, for example: `[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, just leave this field unset.
+
+In which `fields` is an array, in which each element defines a column of data, as follows:
+
+| Field    | Description                                                | Type                                                                                                         |
+| -------- | ---------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------ |
+| name     | the name of the column                                     | String                                                                                                       |
+| type     | the data type of the column                                | String, with following types: int8, int16, int32, int64, float, double, string, date, datetime, binary, blob |
+| optional | whether the data can be empty (optional, default is false) | Bool                                                                                                         |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.List All Labels
+
+- **URI**: `/db/{graph_name}/label`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field  | Description               | Type |
+| ------ | ------------------------- | ---- |
+| edge   | the list of edge labels   | List |
+| vertex | the list of vertex labels | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.Get Label Data Format
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Data column definition table as a dictionary, in which each key is the column name, and corresponding value is the column definition defined as follows:
+- | Field    | Description                           | Type   |
+  | -------- | ------------------------------------- | ------ |
+  | optional | whether the column value can be empty | Bool   |
+  | type     | the type of the column value          | String |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema Import
+
+- **URI**: `/db/{graph_name}/schema/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description              | Type   |
+| ----------- | ------------------------ | ------ |
+| description | Graph labels description | String |
+
+The detail description can refer to `TuGraph Manual`.
+
+- **RESPONSE**:
+
+Schema import will check the new schema and original schema in database if compatible or not. If yes, this request will add the label only in new schema. If no, will return an error code.
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.Vertex Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+in which `vid` is a unique integer identifying the vertex, which can be obtained when creating new vertexes or by looking up index.
+
+#### 6.7.1.List Vertex and Label Number
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field      | Description                | Type    |
+| ---------- | -------------------------- | ------- |
+| num_label  | the number of vertex label | Integer |
+| num_vertex | the number of vertex       | Integer |
+
+_Note: `num_vertex` returns an estimate of the number of vertexes, not the exact number. To get the exact number, please use Cypher queries._
+
+#### 6.7.2.Create New Vertex
+
+Insert a vertex into the database.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field    | Description                  | Type       |
+| -------- | ---------------------------- | ---------- |
+| label    | the name of label            | String     |
+| property | the properties of the vertex | Dictionary |
+
+in which `property` is a dictionary of {`column_name`:`column_value`}.
+
+- **RESPONSE**: if successful, return status code 200 and the new vertex's vid, which can be used in later vertex operations.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.Batch Create Vertexes
+
+TuGraph allows multiple vertices to be inserted as one batch to reduce network overhead.
+
+- **URI**: `/db/{graph_name}/node`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description               | Type   |
+| ------ | ------------------------- | ------ |
+| label  | the name of Label         | String |
+| fields | the column names          | List   |
+| values | the values of each vertex | List   |
+
+in which `fields` is a list of strings specifying column names, and `values` is a list in which each element is a list of `column_values` corresponding to the column names as specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200, and return the vid list of newly added vertices in the JSON content, where each vid corresponds to each vertex in the request.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.Get Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description       | Type                                                             |
+| -------- | ----------------- | ---------------------------------------------------------------- |
+| label    | the name of Label | String                                                           |
+| property | property          | Dictionary, in the format of {column_name_1:column_value_1, ...} |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.Delete Vertex
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200, and also the following content in JSON:
+
+| Field | Description                                    | Type    |
+| ----- | ---------------------------------------------- | ------- |
+| in    | number of incoming edges of the deleted vertex | Integer |
+| out   | number of outgoing edges of the deleted vertex | Integer |
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.Get Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Vertex properties as a dictionary of {`column_name`:`column_value`}
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.Get Vertex Field
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: Value corresponding to the specified `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.Update Vertex Property
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description          | Type       |
+| -------- | -------------------- | ---------- |
+| property | properties to update | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "13737299333"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.8.Edge Operation
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+in which `euid` is a string uniquely identifying the edge, which can be obtained when creating edges or by iterating through the edges of a vertex.
+
+#### 6.8.1.Create Edge
+
+- **URI**: `/db/{graph_name}/node/{src_vid}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field       | Description                     | Type       |
+| ----------- | ------------------------------- | ---------- |
+| label       | the label of edge               | String     |
+| destination | the `vid` of destination vertex | Integer    |
+| property    | the property of edge            | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200 and the `euid` of new created edge (type is String).
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.Batch Create Edges
+
+- **URI**: `/db/{graph_name}/relationship`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field  | Description          | Type   |
+| ------ | -------------------- | ------ |
+| label  | the label of edge    | String |
+| fields | the data column name | List   |
+| edge   | the data of edge     | List   |
+
+where the edge is a list of data, each of which specifies and edge, defined as follows:
+
+| Field       | Description           | Type    |
+| ----------- | --------------------- | ------- |
+| source      | source vertex id      | Integer |
+| destination | destination vertex id | Integer |
+| values      | the data list         | List    |
+
+in which `values` is a list of column values, each of which correspond to the a column name specified in `fields`.
+
+- **RESPONSE**: if successful, return status code 200 and the list of `euid`s of the newly created edges.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.List Out-going Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of source vertex's out-going edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.List Incoming Edges
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The list of `euid`s of destination vertex's incoming edges.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.List All Edges
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field | Description                     | Type |
+| ----- | ------------------------------- | ---- |
+| in    | list of incoming edges' `euid`s | List |
+| out   | list of outgoing edges' `euid`s | List |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.Get Edge Information
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: GET
+
+- **RESPONSE**:
+
+| Field    | Description                | Type       |
+| -------- | -------------------------- | ---------- |
+| label    | the label of the edge      | String     |
+| property | the properties of the edge | Dictionary |
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.Delete Edge
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.Get Edge Properties
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+
+- **METHOD**: GET
+
+- **RESPONSE**: The dictionary of edge's properties.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.Get Edge Field
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: if successful, return status code 200 and the value corresponding to given `field`.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.Update Edge Property
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+
+- **METHOD**: PUT
+
+- **REQUEST**:
+
+| Field    | Description              | Type       |
+| -------- | ------------------------ | ---------- |
+| property | properties to be updated | Dictionary |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+### 6.9.Index
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+#### 6.9.1.Create Index
+
+Create an index on a (label, field) pair. Blocks until the index is successfully built.
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field     | Description                                                                                 | Type   |
+| --------- |---------------------------------------------------------------------------------------------|--------|
+| label     | the name of label                                                                           | String |
+| field     | field to be indexed                                                                         | String |
+| type | the type of index, 0 means nonunique index, 1 means unique index, 2 means pair_unique index | int      |
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.List All Indexes
+
+- **URI**: `/db/{graph_name}/index`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.List Indexes Related with Specified Label
+
+- **URI**: `/db/{graph_name}/index/{label}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of index specifications, each of which has the same format as use in [Create Index](#Create-Index).
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.Delete Index
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+
+- **METHOD**: DELETE
+
+- **RESPONSE**: if successful, return status code 200.
+
+**Example Request:**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.Get Vertex by Index
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+
+- **METHOD**: GET
+
+- **RESPONSE**: A list of `vid`s.
+
+**Example Request:**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+
+
+
+### 6.10.Data Import
+
+- **URI**: `/db/{graph_name}/import/text`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field             | Description                                                                                        | Type                       |
+|-------------------|----------------------------------------------------------------------------------------------------|----------------------------|
+| description       | description of the file content                                                                    | String                     |
+| data              | contents of the file to be imported (recommended to have a size of 16MB, has a hard limit of 17MB) | Strings / Arrays / Objects |
+| continue_on_error | whether to continue import when an error occurred (optional, default is `false`)                   | Bool                       |
+| delimiter         | delimiter used in the data file (optional, default is `“,”`)                                       | String                     |
+
+The details of the `description` field can be found in [TuGraph Import Tool](../6.utility-tools/1.data-import.md).
+
+`delimiter` can be a single character or multi-character string, but must not contain `\r` or `\n`.
+
+`data` can be one of the following:
+
+- String, such as `"1,2\n3,4\n"`
+- Array of ASCII codes, such as `[49,44,50,10,51,44,52,10]`
+- Dictionary shaped like the above array, such as `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+* **RESPONSE**:
+
+The system **will not** automatically perform actions such as creating a new label, adding an index, and so on. Before you do this, please make sure that the label involved already exists and has an appropriate index.
+
+If the import is successful, return code 200 and return log information (possibly empty) in the `log` field. Otherwise, returns status code 400. None of the data is imported on failure, and error message is set in `error_message`.
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true
+    }
+```
+
+The value of the above description is the following json serialized string :
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+Because the request specifies `continue_on_error: true`, the returned `log` indicates that the first edge cannot be inserted because there is no vertex with uid==1, while the second edge was imported successfully.
+
+### 6.11.Miscellany
+
+URI format is:
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.Extract Subgraph
+
+Give a set of `vid`s and return the minimum subgraph which contains the vertex set and the edges between them.
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+
+- **METHOD**: POST
+
+- **REQUEST**:
+
+| Field      | Description   | Type |
+| ---------- | ------------- | ---- |
+| vertex_ids | vertex id set | List |
+
+- **RESPONSE**:
+
+| Field         | description        | Type                                                               |
+| ------------- | ------------------ | ------------------------------------------------------------------ |
+| nodes         | vertex information | List, each element contains vid, label, and properties.            |
+| relationships | edge information   | List, each element contains src, dst, euid, label, and properties. |
+
+**Example Request:**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example Response:**
+
+```
+    • 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..8a5a18add0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+TuGraph DB Client Tools
+==========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..6e3064ecf8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/8.query/1.cypher.md
@@ -0,0 +1,2340 @@
+# Cypher API
+
+> This document mainly introduces the detailed usage instructions of TuGraph-Cypher.
+
+## Table of contents
+- [1.Operators](#1operators)
+  - [1.1.Summary](#11summary)
+  - [1.2.General Operators](#12general-operators)
+  - [1.3.Mathematical Operators](#13mathematical-operators)
+  - [1.4.Comparison Operators](#14comparison-operators)
+  - [1.5.String Specific Comparison Operators](#15string-specific-comparison-operators)
+  - [1.6.Boolean Operators](#16boolean-operators)
+  - [1.7.String Operators](#17string-operators)
+  - [1.8.List Operators](#18list-operators)
+- [2.Clauses](#2clauses)
+  - [2.1.Summary](#21summary)
+  - [2.2.Match](#22match)
+  - [2.3.Return](#23return)
+  - [2.4.Where](#24where)
+  - [2.5.Skip](#25skip)
+  - [2.6.Limit](#26limit)
+  - [2.7.Create](#27create)
+  - [2.8.Callyield](#28callyield)
+  - [2.9.Union](#29union)
+- [3.Functions](#3functions)
+  - [3.1.Whole List of Functions](#31whole-list-of-functions)
+  - [3.2.Predicate Functions](#32predicate-functions)
+  - [3.3.Scalar Functions](#33scalar-functions)
+  - [3.4.Aggregating Functions](#34aggregating-functions)
+  - [3.5.List Funtions](#35list-funtions)
+  - [3.6.Mathematical Functions](#36mathematical-functions)
+- [4.Extensions to Opencypher](#4extensions-to-opencypher)
+- [5.Procedures](#5procedures)
+  - [5.1.Procedures Demos](#51procedures-demos)
+  - [5.2.Whole List of Procedures](#52whole-list-of-procedures)
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators support progress overview：
+
+| category                             | supported                                                                                                                                                       | unsupported                                 |
+| ------------------------------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------- |
+| General operators                    | <code>DISTINCT</code>, <code>.</code> for property access                                                                                                       | <code>[]</code> for dynamic property access |
+| Mathematical operators               | <code>+</code>, <code>-</code>, <code>\*</code>, <code>/</code>, <code>%</code>, <code>^</code>                                                                 |                                             |
+| Comparison operators                 | <code>=</code>, <code>&lt;&gt;</code>, <code>&lt;</code>, <code>&gt;</code>, <code>⇐</code>, <code>&gt;=</code>, <code>IS NULL</code>, <code>IS NOT NULL</code> |                                             |
+| String-specific comparison operators | <code>STARTS WITH</code>, <code>ENDS WITH</code>, <code>CONTAINS</code>, <code>REGEXP</code>                                                                    |                                             |
+| Boolean operators                    | <code>AND</code>, <code>OR</code>, <code>XOR</code>, <code>NOT</code>                                                                                           |                                             |
+| String operators                     | <code>+</code> for concatenation                                                                                                                                |                                             |
+| List operators                       | <code>+</code> for concatenation, <code>IN</code> to check existence of an element in a list, <code>[]</code> for accessing element(s)                          |                                             |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+  ```
+  CREATE (a:Person {name: 'Anne', eyeColor: 'blue'}),
+         (b:Person {name: 'Bill', eyeColor: 'brown'}),
+         (c:Person {name: 'Carol', eyeColor: 'blue'})
+  ```
+
+  ```
+  MATCH (p:Person ) RETURN DISTINCT p.eyeColor
+  ```
+
+- ✓ Accessing properties of a nested literal map using the `.` operator
+
+  ```
+  WITH {person: {name: 'Anne', age: 25}} AS p
+  RETURN p.person.name
+  ```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+  ```
+  CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+         (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+         (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+  ```
+  ```
+  MATCH (restaurant:Restaurant), (category:Category)
+  WHERE restaurant["rating_" + category.name] > 6
+  RETURN DISTINCT restaurant.name
+  ```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator `^`
+
+  ```
+  WITH 2 AS number, 3 AS exponent
+  RETURN number ^ exponent AS result
+  ```
+
+- ✓ Using the unary minus operator `-`
+  ```
+  WITH -3 AS a, 4 AS b
+  RETURN b - a AS result
+  ```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+  ```
+  WITH 4 AS one, 3 AS two
+  RETURN one > two AS result
+  ```
+
+### 1.5.String-specific comparison operators
+
+<span id="jump"></span>
+
+- ✓ Using STARTS WITH to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate STARTS WITH 'Jo'
+  RETURN candidate
+  ```
+
+- ✓ Using REGEXP to filter names
+
+  ```
+  WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+  UNWIND somenames AS names
+  WITH names AS candidate
+  WHERE candidate REGEXP 'Jo.*n'
+  RETURN candidate
+  ```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+  ```
+  WITH [2, 4, 7, 9, 12] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number = 4 OR (number > 6 AND number < 10)
+  RETURN number
+  ```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+  More details on string-specific comparison operators can be found [here](#jump)
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+  ```
+  RETURN [1,2,3,4,5]+[6,7] AS myList
+  ```
+- ✓ Using IN to check if a number is in a list
+
+  ```
+  WITH [2, 3, 4, 5] AS numberlist
+  UNWIND numberlist AS number
+  WITH number
+  WHERE number IN [2, 3, 8]
+  RETURN number
+  ```
+
+- ✓ Accessing elements in a list using the [] operator
+  ```
+  WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+  RETURN names[1..3] AS result
+  ```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses support progress list：
+
+| Category                | Syntax                                | Notes     |
+| ----------------------- | ------------------------------------- | --------- |
+| Reading clauses         | MATCH                                 | Supported |
+|                         | OPTIONAL MATCH                        | Supported |
+|                         | MANDATORY MATCH                       | Pending   |
+| Projecting clauses      | RETURN … [AS]                         | Supported |
+|                         | WITH … [AS]                           | Supported |
+|                         | UNWIND … [AS]                         | Supported |
+| Reading sub-clauses     | WHERE                                 | Supported |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | Supported |
+|                         | SKIP                                  | Supported |
+|                         | LIMIT                                 | Supported |
+| Writing clauses         | CREATE                                | Supported |
+|                         | DELETE                                | Supported |
+|                         | DETACH DELETE                         | Supported |
+|                         | SET                                   | Supported |
+|                         | REMOVE                                | Supported |
+| Reading/Writing clauses | MERGE                                 | Supported |
+|                         | CALL […YIELD]                         | Supported |
+| Set operations          | UNION                                 | Pending   |
+|                         | UNION ALL                             | Supported |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+    ```
+    MATCH (n)
+    RETURN n
+    ```
+  - ✓ Get all nodes with a label
+    ```
+    MATCH (movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Related nodes
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+  - ✓ Match with labels
+    ```
+    MATCH (director {name: 'Oliver Stone'})-[]-(movie)
+    RETURN movie.title
+    ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[]->(movie)
+    RETURN movie.title
+    ```
+  - ✓ Directed relationships and variable
+    ```
+    MATCH (:Person {name: 'Oliver Stone'})-[r]->(movie)
+    RETURN type(r)
+    ```
+  - ✓ Match on relationship type
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})<-[:ACTED_IN]-(actor)
+    RETURN actor.name
+    ```
+  - ✓ Match on multiple relationship types
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[:ACTED_IN|:DIRECTED]-(person)
+    RETURN person.name
+    ```
+  - ✓ Match on relationship type and use a variable
+    ```
+    MATCH (wallstreet {title: 'Wall Street'})<-[r:ACTED_IN]-(actor)
+    RETURN r.role
+    ```
+
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+    ```
+    MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+    RETURN type(r)
+    ```
+  - ✓ Multiple relationships
+    ```
+    MATCH (charlie {name: 'Charlie Sheen'})-[:ACTED_IN]->(movie)<-[:DIRECTED]-(director)
+    RETURN movie.title, director.name
+    ```
+  - ✓ Variable-length relationships
+    ```
+    MATCH (martin {name: 'Charlie Sheen'})-[:ACTED_IN*1..3]-(movie:Movie)
+    RETURN movie.title
+    ```
+  - ✓ Relationship variable in variable-length relationships
+    ```
+    MATCH p = (actor {name: 'Charlie Sheen'})-[:ACTED_IN*2]-(co_actor)
+    RETURN relationships(p)
+    ```
+  - ❏ Match with properties on a variable-length path
+    ```
+    MATCH p = (charlie:Person)-[* {blocked:false}]-(martin:Person)
+    WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+    RETURN p
+    ```
+  - ✓ Zero-length paths
+    ```
+    MATCH (wallstreet:Movie {title: 'Wall Street'})-[*0..1]-(x)
+    RETURN x
+    ```
+  - ✓ Named paths
+
+    ```
+    MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+    ```
+
+  - ✓ Matching on a bound relationship
+
+    ```
+    MATCH (a)-[r]-(b)
+    WHERE id(r)= 0
+    RETURN a,b
+    ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+    ```
+    MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+    CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+    ```
+  - ✓ All shortest paths
+    ```
+    MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+    CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN nodeIds,relationshipIds,cost
+    ```
+
+- Get node or relationship by id
+
+  - ✓ Node by id
+    ```
+    MATCH (n)
+    WHERE id(n)= 0
+    RETURN n
+    ```
+  - ☒ Relationship by id
+    ```
+    MATCH ()-[r]->()
+    WHERE id(r) = 0
+    RETURN r
+    ```
+  - ✓ Multiple nodes by id
+    ```
+    MATCH (n)
+    WHERE id(n) IN [0, 3, 5]
+    RETURN n
+    ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+  ```
+  MATCH (n {name: 'B'}) RETURN n
+  ```
+
+  > **Note**
+  >
+  > Return `id` of n.
+
+- ✓ Return relationships
+
+  ```
+  MATCH (n {name: 'A'})-[r:KNOWS]->(c)
+  RETURN r
+  ```
+
+  > **Note**
+  >
+  > Return `EdgeUid` of r.
+
+- ✓ Return property
+  ```
+  MATCH (n {name: 'A'}) RETURN n.name
+  ```
+- ❏ Return all elements
+  ```
+  MATCH p = (a {name: 'A'})-[r]->(b)
+  RETURN *
+  ```
+- ❏ Variable with uncommon characters
+  ```
+  MATCH (`This isn\'t a common variable`)
+  WHERE `This isn\'t a common variable`.name = 'A'
+  RETURN `This isn\'t a common variable`.happy
+  ```
+- ✓ Aliasing a field
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age AS SomethingTotallyDifferent
+  ```
+- ✓ Optional properties
+  ```
+  MATCH (n)
+  RETURN n.age
+  ```
+- ❏ Other expressions
+
+  ```
+  MATCH (a {name: 'A'})
+  RETURN a.age > 30, "I'm a literal", (a)-[]->()
+  ```
+
+  `(a)-[]->()` not supported.
+
+- ✓ Unique results
+  ```
+  MATCH (a {name: 'A'})-[]->(b)
+  RETURN DISTINCT b
+  ```
+
+### 2.4.WHERE
+
+- Basic usage
+
+  - ✓ Boolean operations
+    ```
+    MATCH (n)
+    WHERE n.name = 'Peter' XOR (n.age < 30 AND n.name = 'Tobias') OR NOT (n.name =
+    'Tobias' OR n.name = 'Peter')
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node label
+    ```
+    MATCH (n)
+    WHERE n:Swedish
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on node property
+    ```
+    MATCH (n)
+    WHERE n.age < 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Filter on relationship property
+    ```
+    MATCH (n)-[k:KNOWS]->(f)
+    WHERE k.since < 2000
+    RETURN f.name, f.age, f.email
+    ```
+  - ❏ Filter on dynamically-computed property
+    ```
+    WITH 'AGE' AS propname
+    MATCH (n)
+    WHERE n[toLower(propname)]< 30
+    RETURN n.name, n.age
+    ```
+  - ✓ Property existence checking
+    ```
+    MATCH (n)
+    WHERE exists(n.belt)
+    RETURN n.name, n.belt
+    ```
+
+- String matching
+
+  - ✓ Match the beginning of a string
+    ```
+    MATCH (n)
+    WHERE n.name STARTS WITH 'Pet'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match the ending of a string
+    ```
+    MATCH (n)
+    WHERE n.name ENDS WITH 'ter'
+    RETURN n.name, n.age
+    ```
+  - ✓ Match anywhere within a string
+    ```
+    MATCH (n)
+    WHERE n.name CONTAINS 'ete'
+    RETURN n.name, n.age
+    ```
+  - ✓ String matching negation
+    ```
+    MATCH (n)
+    WHERE NOT n.name ENDS WITH 's'
+    RETURN n.name, n.age
+    ```
+
+- Using path patterns in `WHERE`
+
+  - ✓ Filter on patterns
+    ```
+    MATCH (tobias {name: 'Tobias'}), (others)
+    WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+    RETURN others.name, others.age
+    ```
+  - ✓ Filter on patterns using NOT
+    ```
+    MATCH (persons), (peter {name: 'Peter'})
+    WHERE NOT (persons)-[]->(peter)
+    RETURN persons.name, persons.age
+    ```
+  - ✓ Filter on patterns with properties
+
+    ```
+    MATCH (n)
+    WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+    RETURN n.name, n.age
+    ```
+
+  - ✓ Filter on relationship type
+    ```
+    MATCH (n)-[r]->()
+    WHERE n.name='Andres' AND type(r) STARTS WITH 'K'
+    RETURN type(r), r.since
+    ```
+
+- Lists
+
+  - ✓ IN operator
+    ```
+    MATCH (a)
+    WHERE a.name IN ['Peter', 'Tobias']
+    RETURN a.name, a.age
+    ```
+
+- Missing properties and values
+
+  - ✓ Default to false if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white'
+    RETURN n.name, n.age, n.belt
+    ```
+  - ✓ Default to true if property is missing
+    ```
+    MATCH (n)
+    WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+    ORDER BY n.name
+    ```
+  - ✓ Filter on null
+    ```
+    MATCH (person)
+    WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+    person.belt
+    ```
+
+- Using ranges
+
+  - ✓ Simple range
+    ```
+    MATCH (a)
+    WHERE a.name >= 'Peter'
+    RETURN a.name, a.age
+    ```
+  - ✓ Composite range
+    ```
+    MATCH (a)
+    WHERE a.name > 'Andres' AND a.name < 'Tobias'
+    RETURN a.name, a.age
+    ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 3
+  ```
+- ✓ Return middle two records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP 1
+  LIMIT 2
+  ```
+- ✓ Using an expression with SKIP to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  ORDER BY n.name
+  SKIP toInteger(3*rand())+ 1
+  ```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT 3
+  ```
+- ✓ Using an expression with LIMIT to return a subset of the records
+  ```
+  MATCH (n)
+  RETURN n.name
+  LIMIT toInteger(3 * rand())+ 1
+  ```
+
+### 2.7.CREATE
+
+- Create nodes
+
+  > **Note**
+  >
+  > TuGraph does not support creating empty nodes and does not support multiple labels.
+
+  - ☒ Create single node
+    ```
+    CREATE (n)
+    ```
+  - ☒ Create multiple nodes
+    ```
+    CREATE (n), (m)
+    ```
+  - ✓ Create a node with a label
+    ```
+    CREATE (n:Person)
+    ```
+  - ☒ Create a node with multiple labels
+    ```
+    CREATE (n:Person:Swedish)
+    ```
+  - ✓ Create node and add labels and properties
+    ```
+    CREATE (n:Person {name: 'Andres', title: 'Developer'})
+    ```
+  - ✓ Return created node
+    ```
+    CREATE (a {name: 'Andres'})
+    RETURN a
+    ```
+
+- Create relationships
+
+  - ✓ Create a relationship between two nodes
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE]->(b)
+    ```
+  - ✓ Create a relationship and set properties
+    ```
+    MATCH (a:Person), (b:Person)
+    WHERE a.name = 'Node A' AND b.name = 'Node B'
+    CREATE (a)-[r:RELTYPE {name: a.name + '<->' + b.name}]->(b)
+    ```
+  - ✓ Create a full path
+    ```
+    CREATE p = (andres {name:'Andres'})-[:WORKS_AT]->(neo)<-[:WORKS_AT]-(michael {name:'Michael'})
+    RETURN p
+    ```
+
+- Use parameters with CREATE
+
+  - ❏ Create node with a parameter for the properties
+    ```
+    CREATE (n:Person $props)
+    RETURN n
+    ```
+  - ☒ Create multiple nodes with a parameter for their properties
+    ```
+    UNWIND $props AS map
+    CREATE (n)
+    SET n = map
+    ```
+    cannot create vertex without label.
+
+### 2.8.CALL\[…YIELD\]
+
+- ✓ Call a procedure using CALL
+  ```
+  CALL db.vertexLabels
+  ```
+- ✓ View the signature for a procedure
+  ```
+  CALL dbms.procedures() YIELD name, signature
+  WHERE name='dbms.listConfig'
+  RETURN signature
+  ```
+- ❏ Call a procedure using a quoted namespace and name
+  ```
+  CALL `db`.`vertexLabels`
+  ```
+- ✓ Call a procedure with literal arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+  ```
+- ❏ Call a procedure with parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+  ```
+- ❏ Call a procedure with mixed literal and parameter arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+  ```
+- ✓ Call a procedure with literal and default arguments
+  ```
+  CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+  ```
+- ✓ Call a procedure within a complex query using CALL…YIELD
+  ```
+  CALL db.vertexLabels() YIELD label
+  RETURN count(label) AS numLabels
+  ```
+- ✓ Call a procedure and filter its results
+  ```
+  CALL db.vertexLabels() YIELD label
+  WHERE label CONTAINS 'User'
+  RETURN count(label) AS numLabels
+  ```
+- ❏ Call a procedure within a complex query and rename its outputs
+  ```
+  CALL db.propertyKeys() YIELD propertyKey AS prop
+  MATCH (n)
+  WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+  ```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION ALL MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+- ❏ Combine two queries and remove duplicates
+  ```
+  MATCH (n:Actor)
+  RETURN n.name AS name
+  UNION
+  MATCH (n:Movie)
+  RETURN n.title AS name
+  ```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| Category               | Function          | Notes                                |
+| ---------------------- |------------------ | ------------------------------------ |
+| Predicate functions    | exists()          |                                      |
+|                        | all()             | Not supported                        |
+|                        | any()             | Not supported                        |
+|                        | single()          | Not supported                        |
+|                        | none()            | Not supported                        |
+| Scalar functions       | id()              |                                      |
+|                        | euid()            |                                      |
+|                        | properties()      |                                      |
+|                        | head()             |                                      |
+|                        | last()             |                                      |
+|                        | toBoolean()       |                                      |
+|                        | toFloat()         |                                      |
+|                        | toInteger()       |                                      |
+|                        | toString()        |                                      |
+|                        | type()            |                                      |
+|                        | startnode()       |                                      |
+|                        | endnode()         |                                      |
+|                        | size()            |                                      |
+|                        | length()          |                                      |
+|                        | substring()       |                                      |
+|                        | concat()          |                                      |
+|                        | label()           | OpenCypher extension method          |
+| Aggregating functions  | avg()             |                                      |
+|                        | collect()         |                                      |
+|                        | count()           |                                      |
+|                        | max()             |                                      |
+|                        | min()             |                                      |
+|                        | percentileCont()  |                                      |
+|                        | percentileDisc()  |                                      |
+|                        | stDev()           |                                      |
+|                        | stDevP()          |                                      |
+|                        | variance()        |                                      |
+|                        | varianceP()       |                                      |
+|                        | sum()             |                                      |
+| List functions         | keys()            |                                      |
+|                        | labels()          | Returns a result with only one label |
+|                        | nodes()           |                                      |
+|                        | range()           |                                      |
+|                        | subscript()       | Not supported                        |
+| Mathematical functions | abs()             |                                      |
+|                        | ceil()            |                                      |
+|                        |
+
+			
+
+### 3.2.Predicate functions
+
+- exists()
+
+  judge it whether a vertex or edge has the field .
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE exists(n.belt)
+  RETURN n.name, n.belt
+  ```
+
+  **Example output:**
+
+  | exists(name) |
+  | ------------ |
+  | true         |
+
+### 3.3.Scalar functions
+
+- id()
+
+  get the id of vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  RETURN id(a)
+  ```
+
+  **Example output:**
+
+  | vid |
+  | --- |
+  | 1   |
+  | 2   |
+  | ... |
+
+- properties()
+
+  get a map containing all the properties of a node or relationship.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  CREATE (p:Person {name: 'Stefan', city: 'Berlin'})
+  RETURN properties(p)
+  ```
+
+  **Example output:**
+
+  | properties                |
+  | ------------------------- |
+  | {name:Stefan,city:Berlin} |
+
+- head()
+
+  get the first element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, head(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | head(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "one"         |
+
+- last()
+
+  get the last element of a list.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Eskil'
+  RETURN a.array, last(a.array)
+  ```
+
+  **Example output:**
+
+  | a.array               | last(a.array) |
+  | --------------------- | ------------- |
+  | ["one","two","three"] | "three"       |
+
+- toFloat()
+
+  Converts an integer or string value to a floating point number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toFloat('11.5'), toFloat('not a number')
+  ```
+
+  **Example output:**
+  | float |
+  | ----- |
+  | 11.5 |
+  |null|
+
+- toInteger()
+
+  Converts a floating point or string value to an integer value.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toInteger('2.3') AS integer
+  ```
+
+  **Example output:**
+
+  | integer |
+  | ------- |
+  | 2       |
+
+- toString()
+
+  Converts an integer, float, boolean value to a string.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN toString(2.3)
+  ```
+
+- type()
+
+  get the string representation of the relationship type.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name = 'Alice'
+  RETURN type(r)
+  ```
+
+  **Example output:**
+
+  | type     |
+  | -------- |
+  | acted_in |
+  | acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+
+  Returns the average of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN avg(n.age)
+  ```
+
+  **Example output:**
+
+  | avg(n.born)        |
+  | ------------------ |
+  | 1869.2661654135338 |
+
+- collect()
+
+  Returns a list containing the values returned by an expression.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN collect(n.age)
+  ```
+
+  **Example output:**
+
+  | collect(n.born) |
+  | --------------- |
+  | [1967,...]      |
+
+- count()
+
+  Returns the number of values or records.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n {name: 'A'})-[]->(x)
+  RETURN labels(n), n.age, count(*)
+  ```
+
+  **Example output:**
+
+  | labels(n)  | n.age | count(\*) |
+  | ---------- | ----- | --------- |
+  | ["Person"] | 13    | 3         |
+
+- max()
+
+  Returns the maximum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN max(n.age)
+  ```
+
+  **Example output:**
+
+  | max(n.age) |
+  | ---------- |
+  | 44         |
+
+- min()
+
+  Returns the minimum value in a set of values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN min(n.age)
+  ```
+
+  **Example output:**
+
+  | min(n.age) |
+  | ---------- |
+  | 13         |
+
+- percentileCont()
+
+  Returns the percentile of a value over a group using linear interpolation.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileCont(n.age, 0.4)
+  ```
+
+  **Example output:**
+
+  | percentileCont(n.age, 0.4) |
+  | -------------------------- |
+  | 29                         |
+
+* percentileDisc()
+
+  Returns the nearest value to the given percentile over a group using a rounding method.
+
+  **Scope:** whole instance.
+
+  **Output:** the percentile of the given value over a group.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN percentileDisc(n.age, 0.5)
+  ```
+
+  **Example output:**
+
+  | percentileDisc(n.age, 0.5) |
+  | -------------------------- |
+  | 33                         |
+
+* stDev()
+
+  Returns the standard deviation for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDev(n.age)
+  ```
+
+  **Example output:**
+
+  | stDev(n.age)       |
+  | ------------------ |
+  | 15.716233645501712 |
+
+* stDevP()
+
+  Returns the standard deviation for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN stDevP(n.age)
+  ```
+
+  **Example output:**
+
+  | stDevP(n.age)      |
+  | ------------------ |
+  | 12.832251036613439 |
+
+* variance()
+
+  Returns the variance for the given value over a group for a sample of a population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN variance(n.age)
+  ```
+
+  **Example output:**
+
+  | variance(n.age) |
+  | --------------- |
+  | 247             |
+
+* varianceP()
+
+  Returns the variance for the given value over a group for an entire population.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n)
+  WHERE n.name IN ['A', 'B', 'C']
+  RETURN varianceP(n.age)
+  ```
+
+  **Example output:**
+
+  | varianceP(n.age) |
+  | ---------------- |
+  | 164.66666666667  |
+
+* sum()
+
+  Returns the sum of a set of numeric values.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (n:Person)
+  RETURN sum(n.age)
+  ```
+
+  **Example output:**
+
+  | sum(n.age) |
+  | ---------- |
+  | 90         |
+
+### 3.5.List Funtions:
+
+- keys()
+
+  get the field names of some vertex.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN keys(a)
+  ```
+
+  **Example output:**
+
+  | keys(a)               |
+  | --------------------- |
+  | ["name","age","eyes"] |
+
+- labels()/label()
+
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a)
+  WHERE a.name = 'Alice'
+  RETURN labels(a)
+  ```
+
+  **Example output:**
+
+  | labels                 |
+  | ---------------------- |
+  | ["Person","Developer"] |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice'})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+### 3.6.Mathematical functions
+
+- abs()
+
+  get the absolute value of some data.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH (a:person {name: 'Laurence Fishburne'}),(e:person {name: 'Carrie-Anne Moss'})
+  RETURN a.born, e.born, abs(a.born-e.born)
+  ```
+
+  **Example output:**
+
+  | a.born | e.born | abs(a.born - e.born) |
+  |--------|--------|-----------------------|
+  | 1961   | 1967   | 6                     |
+
+- ceil()
+
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+  **Example input:**
+
+  ```
+  RETURN ceil(0.1)
+  ```
+
+  **Example output:**
+
+  | ceil(0.1) |
+  | --------- |
+  | 1.0       |
+
+- floor()
+
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN floor(0.9)
+  ```
+
+  **Example output:**
+
+  | floor(0.9) |
+  | ---------- |
+  | 0.0        |
+
+- round()
+
+  Returns the value of a number rounded to the nearest integer.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN round(3.141592)
+  ```
+
+  **Example output:**
+
+  | round |
+  | ----- |
+  | 3     |
+
+- rand()
+
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN rand()
+  ```
+
+  **Example output:**
+
+  | rand()             |
+  | ------------------ |
+  | 0.9797131960534085 |
+
+- sign()
+
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  RETURN sign(-17), sign(0.1)
+  ```
+
+  **Example output:**
+
+  | sign(-17) | sign(0.1) |
+  | --------- | --------- |
+  | -1        | 1         |
+
+## 4.Extensions To OpenCypher
+
+- Number of Labels
+
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+
+  - OpenCypher: One node/relationship may have 0 to many labels.
+
+- Schema.
+
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.Procedures
+
+### 5.1.procedures' demos
+
+- dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                               | name            |
+  | --------------------------------------- | --------------- |
+  | db.vertexLabels() :: (label::STRING)    | db.vertexLabels |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels   |
+  | db.indexes() :: (index::LIST)           | db.indexes      |
+  | ...                                     | ...             |
+
+- db.vertexLabels()
+
+  Lists all available labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+
+  **Example output:**
+
+  | label   |
+  | ------- |
+  | genre   |
+  | keyword |
+  | movie   |
+  | ...     |
+
+- db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edgeLabels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | edgeLabel |
+  | --------- |
+  | acted_in  |
+  | directed  |
+  | ...       |
+
+- db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter     | parameter type | description                   |
+  | ------------- | -------------- | ----------------------------- |
+  | label_name    | string         | name of vertex label          |
+  | primary_field | string         | primary field of vertex label |
+  | field_spec    | list           | specification of a field      |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+  **Output:** If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createVertexLabel('Person', 'id', 'id', 'int64', false, 'name', 'string', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added label [Person]
+  ```
+
+- db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description                   |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field             |
+  | type       | string     | type of the field             |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name         | type   | optional |
+  | ------------ | ------ | -------- |
+  | id           | INT32  | false    |
+  | born         | INT32  | true     |
+  | name         | STRING | true     |
+  | poster_image | STRING | true     |
+
+- db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | label_type | string         | either 'vertex' or 'edge'                                             |
+  | label_name | string         | name of the label                                                     |
+  | extra      | string         | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list           | specification of a field                                              |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.
+  for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id','int32',false], ['name','string', true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id','int32',false], ['name', 'string', true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+- db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+
+  **Output:**
+
+  | field_name | field_type | description                      |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description                   |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string          | either 'vertex' or 'edge'     |
+  | label_name  | string          | name of the label             |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description               |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string         | either 'vertex' or 'edge' |
+  | label_name       | string         | name of the label         |
+  | field_value_spec | list           | specification of a field  |
+
+  in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, 'optional']`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description               |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string         | either 'vertex' or 'edge' |
+  | label_name | string         | name of the label         |
+  | field_spec | list           | specification of a field  |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, 'optional']`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description                       |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelModFields(
+  'vertex',
+  'new_label',
+  ['birth_date', 'DATETIME', '1900-01-01 00:00:00'],
+  ['gender', 'BOOL', false])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+- db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description              |
+  | ---------------- | -------------- | ------------------------ |
+  | label_name       | string         | name of the label        |
+  | edge_constraints | string         | edge constraints         |
+  | field_spec       | list           | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for optional fields.
+
+- `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', 'int32',true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+- db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+
+- db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                           |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string         | name of the label                     |
+  | field_name | string         | specification of a field              |
+  | unique  | boolean        | Specifies whether the index is unique |
+- | pair_unique  | boolean        | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+- dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter        | parameter type | description          |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string         | the current password |
+  | new_password     | string         | new password         |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string         | the user's name |
+  | new_password | string         | new password    |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.createUser(user_name, password)
+
+  create new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | ------------------------ |
+  | user_name | string         | the new user name        |
+  | password  | string         | the password of new user |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string         | the user name to be deleted |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+- dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description                 |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string         | the user name               |
+  | is.admin  | boolean        | the permission of this user |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       | ...      |
+
+- dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+  a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description           |
+  | --------- | -------------- | --------------------- |
+  | user.user | string         | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+- dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+  a list of ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host         |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...          |
+
+- dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been deleted.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+  the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+- dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description                      |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string         | the name of new subgraph         |
+  | description | string         | description of new subgraph      |
+  | max_size_GB | integer        | Upper limit of subgraph capacity |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                          |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string         | the name of subgraph to been deleted |
+  | config     | map            | the configuration to be modified     |
+
+  **Output:**
+
+  if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+- dbms.graph.listGraphs()
+
+  get all subgraph in this graph database .
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}         |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...        | ...                                           |
+
+- dbms.config.list()
+
+  get some config of this graph database .
+
+  **Output:**
+
+  a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  | --------- | ------- |
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       | ...     |
+
+- dbms.config.update(updates)
+
+  get some config of this graph database .
+
+  **Output:**
+
+  If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+      enable_ip_check:false,
+      durable:true,
+      optimistic_txn:true,
+      enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+- dbms.takeSnapshot()
+
+  take the snapshot on this current graph database.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+- dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path                       |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+- algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                                                             |
+  | --------- | -------------- | --------------------------------------------------------------------------------------- |
+  | startNode | Node           | the source node of paths                                                                |
+  | endNode   | Node           | the destination node paths                                                              |
+  | config    | MAP            | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+  If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2         | 1         |
+
+- algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+  If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+- algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                                               |
+  | --------- | -------------- | --------------------------------------------------------- |
+  | id        | ANY            | the id of vertexes or edges , the id must be variable     |
+  | config    | MAP            | the configuration of this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or it is an edge id.
+
+  **Output:**
+
+  If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.Whole List Of Procedures
+
+| Name                                  | Description                                                          | Signature                                                                                                                                                                                |
+|---------------------------------------|----------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.vertexLabels                       | list all vertex labels                                               | db.vertexLabels() :: (label::STRING)                                                                                                                                                     |
+| db.edgeLabels                         | list all edge labels                                                 | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                  |
+| db.indexes                            | list all indexes                                                     | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                     |
+| db.listLabelIndexes                   | list indexes by label                                                | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                           |
+| db.warmup                             | warm up the DB                                                       | db.warmup() :: (time_used::STRING)                                                                                                                                                       |
+| db.createVertexLabel                  | create a vertex label                                                | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                   |
+| db.createLabel                        | create a vertex/edge label                                           | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                              |
+| db.getLabelSchema                     | get the schema of label                                              | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                                |
+| db.getVertexSchema                    | get the schema of vertex label                                       | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                       |
+| db.getEdgeSchema                      | get the schema of edge label                                         | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                         |
+| db.deleteLabel                        | delete vertex/edge label                                             | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                        |
+| db.alterLabelDelFields                | delete some fields of a label on a subgraph                          | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                             |
+| db.alterLabelAddFields                | add some fields of a label on a subgraph                             | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                  |
+| db.alterLabelModFields                | modify some fields of a label on a subgraph                          | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                        |
+| db.createEdgeLabel                    | create a edge label                                                  | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                      |
+| db.addIndex                           | add an index                                                         | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                           |
+| db.addEdgeIndex                       | add an index                                                         | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                  |
+| db.addVertexCompositeIndex            | add composite index                                                  | db.addVertexCompositeIndex(label_name::STRING,field_names::LIST,unique::BOOLEAN) :: (::VOID)                                                                                            |
+| db.deleteIndex                        | delete an index                                                      | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                        |
+| db.backup                             | backup the db                                                        | db.backup(destination::STRING) :: ()                                                                                                                                                     |
+| dbms.procedures                       | list all procedures                                                  | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                    |
+| dbms.security.changePassword          | change current user password                                         | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                  |
+| dbms.security.changeUserPassword      | change user password                                                 | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                     |
+| dbms.security.createUser              | create an account                                                    | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.deleteUser              | delete an account                                                    | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.listUsers               | list all accounts                                                    | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                          |
+| dbms.security.showCurrentUser         | get current user name                                                | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                                |
+| dbms.security.getUserPermissions      | get the permissions of a specified user                              | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                  |
+| dbms.graph.createGraph                | create a subgraph                                                    | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                        |
+| dbms.graph.modGraph                   | modify the config of a subgraph                                      | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                          |
+| dbms.graph.deleteGraph                | delete a subgraph                                                    | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                   |
+| dbms.graph.listGraphs                 | list all subgraphs                                                   | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                       |
+| dbms.graph.getGraphInfo               | get the information of a specified graph                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                     |
+| dbms.security.addAllowedHosts         | add to the trust list                                                | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                         |
+| dbms.security.deleteAllowedHosts      | remove from the trust list                                           | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                              |
+| dbms.security.listAllowedHosts        | list the trust list                                                  | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                       |
+| dbms.config.update                    | update the configuration                                             | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                    |
+| dbms.config.list                      | list the configuration                                               | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                          |
+| algo.shortestPath                     | get a shortest path between two vertexes                             | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                    |
+| algo.allShortestPaths                 | get all the shortest paths between two vertexes                      | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                     |
+| algo.native.extract                   | get the field values of a list of vertexes or edges specified id     | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                 |
+| db.flushDB                            | flush the db                                                         | db.flushDB() :: (::VOID)                                                                                                                                                                 |
+| dbms.security.listRoles               | list all roles                                                       | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                          |
+| dbms.security.createRole              | create a role                                                        | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                     |
+| dbms.security.deleteRole              | delete a role                                                        | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.security.getRoleInfo             | get the role information                                             | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                              |
+| dbms.security.disableRole             | enable/disable the role                                              | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.modRoleDesc             | modify the description of a role                                     | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.rebuildRoleAccessLevel  | rebuild the user subgraph access rights                              | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                         |
+| dbms.security.modRoleAccessLevel      | modify the user subgraph access rights                               | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                             |
+| dbms.security.modRoleFieldAccessLevel | modify the user property access rights                               | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                  |
+| dbms.security.getUserInfo             | get the user information                                             | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                              |
+| dbms.security.getUserMemoryUsage      | get the memory usage for a user                                      | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                                |
+| dbms.security.disableUser             | enable/disable the user                                              | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                     |
+| dbms.security.setCurrentDesc          | set the current user description                                     | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                            |
+| dbms.security.setUserDesc             | set user description                                                 | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                  |
+| dbms.security.setUserMemoryLimit      | set user memory limit                                                | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                          |
+| dbms.security.deleteUserRoles         | delete roles from the user                                           | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                      |
+| dbms.security.rebuildUserRoles        | rebuild the relationship between the user and the role               | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.addUserRoles            | add the user roles                                                   | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                         |
+| db.plugin.loadPlugin                  | load a plugin                                                        | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN, version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | unload a plugin                                                      | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                              |
+| db.plugin.listPlugin                  | list all plugins                                                     | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                           |
+| db.plugin.getPluginInfo               | get the information of a specified plugin                            | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                           |
+| db.plugin.callPlugin                  | execute the plugins                                                  | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                     |
+| db.importor.dataImportor              | import vertex/edge data                                              | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                              |
+| db.importor.schemaImportor            | import vertex/edge schema                                            | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                              |
+| dbms.meta.count                       | get the total number of vertex and edge                              | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                  |
+| dbms.meta.countDetail                 | get the number of vertex and edge for each label                     | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                        |
+| dbms.meta.refreshCount                | recount the number of vertex and edge, stop writing during the count | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                  |
+| dbms.task.listTasks                   | list running tasks                                                   | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                     |
+| dbms.task.terminateTask               | terminate task                                                       | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                       |
+| dbms.ha.clusterInfo                   | get cluster info in HA mode                                          | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                        |
+| db.dropDB                             | empty the db                                                         | db.dropDB() :: (::VOID)                                                                                                                                                                  |
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/8.query/2.gql.md
new file mode 100644
index 0000000000..ea00f3ceb1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/8.query/2.gql.md
@@ -0,0 +1,392 @@
+# ISO GQL
+
+
+## 1.Introduction to ISO GQL
+
+Graph Query Language (GQL) is an upcoming International Standard language for property graph querying. It builds on the foundations of SQL and integrates proven ideas from the existing [openCypher, PGQL, GSQL, and G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/) languages. The standard is currently in the draft stage.
+
+TuGraph has implemented GQL based on the [ISO GQL (ISO/IEC 39075) Antlr4 grammar file](https://github.com/TuGraph-family/gql-grammar). It includes some extensions and modifications. Not all GQL syntax is fully supported at the moment, but we will continue to improve and enhance it in the future.
+
+## 2.List of Clauses
+
+| Category            | Clauses        |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+
+### 2.1.MATCH
+
+The `MATCH` clause is the most basic clause in GQL, and almost all queries are expanded through `MATCH`.
+
+The `MATCH` clause is used to specify the matching pattern to search in the graph, to match vertices or paths that meet certain conditions.
+
+
+#### Vertex basics
+
+##### Get all vertices
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### Get all vertices with a label
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### Vertex matching with property
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### Vertex matching with filter
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Edge basics
+
+##### Edge pointing right
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### Edge pointing left
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+return
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### Edge matching with filter
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+return
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### Path matching
+
+##### Variable length
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+return
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+The `OPTIONAL MATCH` clause matches a graph pattern and returns `null` if there is no match.
+
+
+#### Match found
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+return
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### Match Not Found
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+return
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+The `RETURN` clause specifies the results to be returned, including vertices, edges, paths, properties, etc.
+
+#### Return vertices
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+return
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### Return edges
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+return
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### Return property
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### Uncommon string used as variable name
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### Alias
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+return
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### Optional property
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+return
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### Other expressions
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+return
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### Distinct
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+return
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+The `NEXT` clause is used to connect multiple clauses.
+
+#### Connecting MATCH clauses
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+return
+
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE` clause is used to filter records.
+
+#### Filter vertex
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+returns
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### Filter edge
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+returns
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### Boolean expressions
+
+`AND`, `OR`, `XOR`, and `NOT` Boolean expressions can be used in the `WHERE` clause to filter data.
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+returns
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+### 2.6.ORDER BY
+
+`ORDER BY` is a clause of `RETURN` that sorts the output result.
+
+#### Sorting the Result
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+return
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP` specifies the offset of the result rows.
+
+#### Without SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+return
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### Using SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+return
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+The `LIMIT` clause is used to limit the number of rows in the result.
+
+#### Using LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+return
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/8.query/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/8.query/index.rst
new file mode 100644
index 0000000000..5e736c4232
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/8.query/index.rst
@@ -0,0 +1,9 @@
+Query
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..83ba668355
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,342 @@
+# TuGraph Stored Procedure Guide
+
+> This document mainly explains the instructions for using the TuGraph stored procedure.
+
+## 1. Introduction
+
+When the query/update logic that users need to express is more complex (such as cannot be described by Cypher or has high performance requirements), compared to calling multiple requests and completing the entire processing flow on the client, the stored procedure provided by TuGraph is a more concise and efficient choice.
+
+Similar to traditional databases, the TuGraph stored procedure runs on the server side. Users can encapsulate the processing logic (i.e., multiple operations) into a procedure call, and further improve performance by parallel processing (such as using relevant C++ OLAP interfaces and built-in algorithms) during implementation.
+
+There is a special type of API in the stored procedure for parallel data operations, which we call the Traversal API. Please refer to the [documentation](2.traversal.md) for more information.
+
+## 2. Stored Procedure Version
+
+Currently, TuGraph supports two versions of stored procedures, which are suitable for different scenarios. Version 3.5 only supports v1, which can be directly called through the REST or RPC interface. Starting from version 3.5, v2 is supported, which allows embedding calls in graph query languages ​​(such as Cypher). We call it POG (Procedure On Graph query language, APOC).
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+|Applicable Scenarios	|Extreme performance or complex multi-transaction management scenarios	|General scenarios, highly integrated with Cypher|
+|Transaction	|Created internally in the function, multiple transactions |can be freely controlled	Passed into the external function, single transaction|
+|Signature (parameter definition)	|Not required	|Required|
+|Input and output parameter types	|Not required to specify	|Need to specify parameter types|
+|Cypher Standalone Call	|Supported	|Supported
+|Cypher Embeded Call	|Not supported	|Supported|
+|Language	|C++/Python/Rust	|C++|
+|Calling mode	|Directly pass the string, usually in JSON format	|Through variables in Cypher statements|
+
+
+In TuGraph, stored procedures v1 and v2 are managed separately, and support for create, delete, and query operations is provided. However, it is still not recommended to have the same name for multiple stored procedures.
+
+## 3. Supported Languages
+
+In TuGraph, users can dynamically load, update, and delete stored procedures. TuGraph supports the use of C++, Python, and Rust languages to write stored procedures. Among them, C++ language has the most complete support and the best performance.
+
+Note that the stored procedure is the logic compiled and executed on the server side, which is independent of the language support on the client side.
+
+## 4. Procedure v1 Interface
+
+## 4.1.Write stored procedures
+### 4.1.1.Write C++ stored procedure
+
+Users can write C stored procedures by using core API or Traversal API. An example of a simple C stored procedure is as follows:
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## Count all students whose age is 10
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+From the code, we can see the entry of a TuGraph C++ stored procedure is the `Process` function, with three parameters:
+
+- `db`: the TuGraph database instance
+- `request`: the input data, which can be a binary byte array, or any other format such as JSON string.
+- `response`: the output data, which can be a string or directly return binary data.
+
+The return value of the `Process` function is a boolean value. When it returns `true`, it means that the request is successfully completed, otherwise it means that the stored procedure found an error during execution, and the user can return an error message through `response` to facilitate debugging.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which is `age_10` in the above example. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, age_10.so will be generated, which can then be loaded into the server by the user.
+
+### 4.1.2 Writing Python stored procedures
+
+The following snippet does the same thing as the above C++ stored procedure, but via TuGraph Python API:
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+The Python stored procedure returns a tuple, the first element of which is a Boolean value indicating whether the stored procedure was successfully executed; the second element is a `str`, which contains the result to be returned.
+
+Python stored procedures do not need to be compiled and can be loaded directly.
+
+## 4.2.How to use stored procedures
+
+### 4.2.1.Install Stored Procedures
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `age_10.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+                  headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `age_10.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+### 4.2.2.List Stored Procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.Retrieve Stored Procedures Detail
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.Uninstall Stored Procedures
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+### 4.2.6.Upgrade Stored Procedures
+
+You can upgrade a stored procedure with the following two steps:
+
+1. Uninstall the existing one.
+2. Install the new on.
+
+TuGraph carefully manages the concurrency of stored procedure operations. Upgrading stored procedures will not affect concurrent runs of existing ones.
+
+## 5. Procedure v2 Interface
+
+### 5.1.Writing stored procedures
+
+Users can write C++ stored procedures by using lgraph API. A simple C++ stored procedure example is as follows:
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+From the code we can see:
+- The stored procedure defines a method `GetSignature` to get the signature. This method returns the signature of the stored procedure, which includes input parameter names and their types, and return parameters and their types. This enables the Cypher query statement to use the signature information to verify whether the input data and the returned data are reasonable when calling the stored procedure.
+- The entry function is the `ProcessInTxn` function, which has three parameters, which are:
+
+- `txn`: The transaction of the stored procedure, generally speaking, the transaction of the Cypher statement that calls the stored procedure.
+- `request`: input data, its content is the string of the input parameter type defined in `GetSignature` and the value passed in the Cypher query statement after json serialization. e.g. `{num_iteration: 10}`
+- `response`: output data, in order to ensure compatibility in the Cypher language, users can write the data processed by the stored procedure to `lgraph_api::Result`, and finally use `lgraph_api::Result::Dump` to serialize it into data in json format.
+
+The return value of the `ProcessInTxn` function is a boolean value. When it returns `true`, it means that the request was successfully completed, otherwise it means that the stored procedure found an error during execution.
+
+After the C++ stored procedure is written, it needs to be compiled into a dynamic link library. TuGraph provides `compile.sh` script to help users automatically compile stored procedures. The `compile.sh` script has only one parameter, which is the name of the stored procedure, which in the above example is `custom_pagerank`. Compile and call the command line as follows:
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+If the compilation goes well, custom_pagerank.so will be generated, which can then be loaded into the server by the user.
+
+### 5.2.Load stored procedure
+
+Users can load stored procedures through REST API and RPC. Taking the REST API as an example, the C++ code to load `custom_pagerank.so` is as follows:
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+It should be noted that `data['code']` at this time is a base64-processed string, and the binary code in `custom_pagerank.so` cannot be directly transmitted through JSON. In addition, the loading and deletion of stored procedures can only be operated by users with administrator privileges.
+
+After the stored procedure is loaded, it will be saved in the database, and it will be automatically loaded after the server restarts. Also, if an update to the stored procedure is required, the same REST API is called. It is recommended that users update the corresponding descriptions when updating stored procedures, so as to distinguish stored procedures of different versions.
+
+#### 5.2.1.List loaded stored procedures
+
+During the running of the server, the user can obtain the list of stored procedures at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.Get stored procedure details
+
+While the server is running, users can obtain the details of a single stored procedure, including codes, at any time. Its call is as follows:
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.Call stored procedure
+
+An example code for calling a stored procedure is as follows:
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.Delete stored procedure
+
+Deleting a stored procedure requires only the following call:
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+Similar to loading stored procedures, only admin users can delete stored procedures.
+
+#### 5.2.5.Update stored procedure
+
+Updating a stored procedure requires the following two steps:
+
+1. Delete the existing stored procedure
+2. Install the new stored procedure
+
+TuGraph carefully manages the concurrency of stored procedure operations, and updating stored procedures will not affect the operation of existing stored procedures.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..e4abd3a263
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,125 @@
+# Traversal API
+
+> This document mainly explains the Traversal API in the stored procedure of TuGraph.
+
+1. Introduction
+The powerful online analytical processing (OLAP) capability of TuGraph is an important feature that sets it apart from other graph databases. With the help of the C++ OLAP API (olap_on_db.h), users can quickly export a subgraph that needs to be analyzed, and then run iterative graph computing processes such as PageRank, connected components, and community detection on it, and then make corresponding decisions based on the results. The export and computation processes can be accelerated through parallel processing, achieving almost real-time analysis and processing, and avoiding the lengthy steps of traditional solutions that require exporting, transforming, and reimporting (ETL) data into dedicated analytical systems for offline processing.
+
+TuGraph has built-in many commonly used graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement specific graph computing processes themselves. They just need to include the header files (.h files) of the corresponding algorithm library in their own programs when implementing their own storage procedures, and link the corresponding dynamic library files (.so) during compilation. In general, the only process that users need to implement themselves is the extraction of the subgraph to be analyzed.
+
+Currently, the Traversal API only supports C++.
+
+## 2. Interface
+
+### 2.1. Snapshot
+
+The Snapshot template class in C++ OLAP API is used to represent extracted static subgraphs. The EdgeData is used to represent the data type of the weight used for each edge in the subgraph. If the edges do not require weights, Empty is used as the EdgeData.
+
+The extracted subgraph can be described using the constructor of the Snapshot class.
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+In the above text, "db" represents the database handle, "txn" represents the transaction handle, and "flags" represents the options used during generation, with the optional values including the following combinations: SNAPSHOT_PARALLEL indicates that multiple threads are used for parallel extraction during export; SNAPSHOT_UNDIRECTED indicates that the exported graph needs to be transformed into an undirected graph.
+
+"vertex_filter" is a user-defined filtering function for vertices, where a return value of true indicates that the vertex needs to be included in the extracted subgraph, and vice versa.
+
+"out_edge_filter" is a user-defined filtering function for edges, where a return value of true indicates that the edge needs to be included in the extracted subgraph, and vice versa.
+
+When the filtering functions are set to default values, it means that all vertices/edges should be included.
+
+For other methods provided by the Snapshot class, please refer to the detailed C++ API documentation (olap_on_db.h).
+
+### 2.2. Traversal
+
+A common type of analysis in graph databases is to start from one or more vertices and iteratively expand and access their neighbors. Although this type of analysis can be done using Cypher, its performance is limited by the serial interpretation and execution when the depth of traversal is large. Writing stored procedures using the C++ Core API eliminates the overhead of interpretation but is still limited by the processing power of a single thread.
+
+In order to enable users to accelerate these types of analysis tasks through parallel processing, we have wrapped a Traversal framework based on the C++ OLAP API. Users can directly use the FrontierTraversal and PathTraversal classes in this framework to perform iterative traversal analysis tasks. For specific usage instructions, please refer to the corresponding C++ API documentation (lgraph_traversal.h).
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+This method can be used to find all vertices that satisfy a certain condition (when the filter returns true). When the "parallel" parameter is set to true, the search process will be executed in parallel.
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+This method can be used to extract (VertexData type) properties from a specified set of vertices (frontier) using the extract method. When the "parallel" parameter is set to true, the extraction process will be executed in parallel.
+
+FrontierTraversal is suitable for cases where only the traversed set of vertices is of interest. When a user needs to access information along the path (vertices/edges along the path) in the traversal process or result, PathTraversal needs to be used. Both types of traversal have four parameters in their constructor, namely the database handle db, transaction handle txn, options flags and capacity. The available options include the following combinations: TRAVERSAL_PARALLEL indicates that multiple threads are used for parallel traversal; TRAVERSAL_ALLOW_REVISITS indicates that vertices can be visited repeatedly during traversal (PathTraversal implicitly includes this option).
+capacity indicates the capacity of the path collection during initialization.
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+Both types of traversal have three ways to set the starting vertex/vertex set for traversal. The first two methods directly specify the vertex ID, while the last method is similar to FindVertices.
+
+Both types of traversal start from the set of vertices in the current layer. They use the extension function to access each outgoing edge/incoming edge/outgoing and incoming edges, and use a user-defined filter function to determine if the extension is successful. If successful, the neighboring vertex/appended path with the edge is added to the set of vertices/paths in the next layer.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+The above describes the three traversal methods of FrontierTraversal. It starts from the current set of vertices and, for each vertex in the set, iterates through each outgoing edge/incoming edge/outgoing and incoming edges. If the edge or neighbor vertex satisfies the user-defined filter conditions (where edge_filter is the filter function for edges and neighbour_filter is the filter function for neighbor vertices), the neighbor vertex is added to the new set of vertices.
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+After the expansion of the current set of vertices is finished, the new set of vertices can be obtained using the above method.
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+The three traversal methods of PathTraversal are similar to FrontierTraversal, except that the user-defined filter function adds two additional parameters: Path, which contains the path before the new edge is expanded, and IteratorHelper, which can be used to convert the vertices/edges in the path to corresponding iterators in the database. The relevant documentation can be found in the corresponding C++ API documentation.
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..8fde487168
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++ Stored Procedures
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..5a503c83c5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,29 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python stored procedure API
+====================================
+Version: 4.5.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+Introduction
+------------------
+Similar to SQLite and Neo4j, TuGraph can work in embedded mode. In embedded mode, it works
+like a library. You can write your own application and call the library functions to create, query
+and modify the graph. In this case, all the data exchange between the application and the graph
+database goes in the same process. It is very simple and efficient.
+
+This is the python API document for TuGraph embedded mode. With the embedded API, the user
+can open or create a database, and then query or modify the database.
+
+API
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..d50c8ecdcf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,17 @@
+# Rust Stored Procedures
+
+## 1. Introduction
+Rust stored procedures currently only support v1 version. TuGraph supports plugins in any language that can be compiled into a dynamic library. Rust, as a rising star in system programming languages, has significant advantages in terms of safety, reliability, and ergonomics compared to C++.
+
+We provide the Rust binding library for TuGraph to support calling lgrahp API in Rust. We also provide the [tugraph-plugin-util](https://crates.io/crates/tugraph-plugin-util ) utility library to help simplify the process of writing Rust plugins.
+
+## 2. How to Use
+
+Using Rust stored procedures involves three steps:
+* Compilation: Compile the Rust source code into a dynamic library (so file). We have prepared a comprehensive plugin development tutorial that covers everything from IDE plugin installation and environment setup to compilation. Please refer to the `rust-tugraph-plugin-tutorial` for detailed instructions.
+* Loading: Load the dynamic library (so file) into the server. This can be done through the REST or RPC interface, similar to the usage of C++ libraries. Please refer to the documentation for more details on the [Procedure v1 API](1.procedure.md).
+* Execution: Once the library is loaded, use it as you would with a C++ stored procedure. The process is the same and does not need further explanation.
+
+## 3. API Documentation
+
+In the Rust community, all code and documentation can be found on [`crates.io`](https://crates.io/crates/tugraph ) and [`docs.rs`](https://docs.rs/tugraph/latest/tugraph ).
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..1d4eb5287b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.5.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..22403ca19e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..83cc10c52e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+Stored Procedures
+========================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..f8acb4076f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,214 @@
+# Bootstrap program
+
+>This document is a bootstrap program designed for TuGraph users. Before reading the detailed documents, users should read this document first to have a general understanding of TuGraph's graph computing operation process, and it will be more convenient to read the detailed documents later. The bootstrap program is a simple instance of a bfs (breadth-first search) program based on Tugraph, and we will focus on how it is used.
+
+## 1.Introduction to TuGraph-Graph Analysis Engine
+
+TuGraph's graph analysis engine is mainly used for full graph/full data analysis tasks. With the help of TuGraph's C++ / Python graph analysis engine API, users can quickly derive a complex subgraph from different data sources, and then run iterative graph algorithms such as PageRank, LPA, WCC on the subgraph, and finally make corresponding countermeasures according to the running results.
+
+In TuGraph, the process of both exporting and computing can be accelerated by in-memory parallel processing, resulting in near-real-time processing and analysis. Compared to traditional methods, this approach can avoid the overhead of data export and disk drop, and can achieve ideal performance by using a compact graph data structure.
+
+TuGraph has 6 built-in algorithms in the community version and 25 built-in algorithms in the commercial version. Users hardly need to implement the specific graph calculation process themselves. For details, please refer to algorithms.md.
+
+According to different data sources and implementations, it can be divided into Procedure, Embed and Standalone, which all inherit from OlapBase API. OlapBase API interface documentation can be found in OlAPBase-APi.md.
+
+The data source of Procedure and Embed is the db data preloaded in the graph database, which can be compiled to generate the.so file used by TuGraph-Web loading and the embed file used by the background terminal respectively. The input graph data are loaded in the form of db. The interface document can refer to olapondb-api.md.
+
+Standalone is used to compile and generate a standalone file. Different from the former, the input graph data of the file is loaded in the form of txt, binary, and ODPS files, and the interface document can refer to olapondisk-api.md.
+
+## 2.Procedure compile and run
+
+This mode is mainly used for visual loading and running on the TuGraph-web interface. The usage method is as follows:
+
+### 2.1.C++
+Run bash make_so.sh bfs in the TuGraph/procedures directory to the BFs.so file in the TuGraph/procedures directory, upload the file as a plug-in to Tugraph-web, input parameters and then execute.
+
+### 2.2.Python
+Upload the python file as a plugin to TuGraph-web, and execute it after inputting parameters.
+
+Example:
+Compile the.so algorithm file at TuGraph/procedures
+`bash make_so.sh bfs`
+
+After loading the bfs.so (or TuGraph/procedures/algo_cython/bfs.py) file as a plug-in to TuGraph-web, enter the following json parameters:
+
+```json
+{
+  "root": "10",
+  "label": "user",
+  "field": "id"
+}
+```
+
+The following result
+
+result:"{"core_cost":0.013641119003295898,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":8.821487426757813e-06,
+"prepare_cost":0.03479194641113281,
+"total_cost":0.04844188690185547}"
+
+The output ：
+
+- num_edges: the number of edges in the graph
+- num_vertices: the number of nodes in the graph
+- prepare_cost: Represents the time required for the preprocessing phase. The preprocessing phase works: loading parameters, graph data loading, index initialization.
+- core_cost: Represents the time required for the algorithm to run.
+- found_vertices: Number of vertices found.
+- output_cost: the time it takes for the algorithm result to be written back to db.。
+- total_cost: The overall running time of the algorithm is executed.
+
+make_so.sh This file is used to compile the graph algorithm files involved in TuGraph-OLAP into a.so file available for TuGraph-web.
+
+## 3.Embed compile and run
+
+This way is mainly used for TuGraph in the background program on the preloaded db graph data algorithm analysis. Its use method is as follows:
+
+To complete the embed_main.cpp file in TuGraph/procedures directory, add the data name, input parameters, data path and other information, as shown in the following example:
+
+### 3.1.C++
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path Specifies the path for saving the preloaded graph data
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // Specifies the name of the graph
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // Enter the algorithm parameters in json format
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+
+Run bash make_so.sh bfs in TuGraph/procedures to bfs_procedure in TuGraph/procedures/algo_cpp.
+`bash make_embed.sh bfs`
+
+Do this in the TuGraph/procedures folder
+`./algo_cpp/bfs_procedure`
+The result is returned.
+
+Input: {"root_id":"0", "label":"node","field":"id"}
+found_vertices = 3829
+{"core_cost":0.025603055953979492,
+"found_vertices":3829,
+"num_edges":88234,
+"num_vertices":4039,
+"output_cost":9.059906005859375e-06,
+"prepare_cost":0.056738853454589844,
+"total_cost":0.0823509693145752}
+
+`Input` indicates the input parameters.The other parameters are described as above.
+
+### 3.2.Python
+
+To compile bfs.so, run `bash make_so_cython.sh bfs` in TuGraph/procedures or `python3 setup.py build_ext -i` in TuGraph/procedures/algo_cython.
+
+After obtaining bfs.so, it can be imported and used in Python, as shown in TuGraph/procedures/run_embed.py:
+
+```python
+# TuGraph/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+
+# shell
+python3 run_embed.py
+```
+The output is the same as C++
+
+
+## 4.Standalone compile and run
+
+This file is mainly used to load the graph data directly at the terminal and run the printout results. Here's how to use it:
+
+In TuGraph/build directory `make bfs_standalone` (need to include boost/sort/sort.hpp in the g++ default include path) can get bfs_standalone file, the file is generated with TuGraph/build/output/algo folder.
+
+Run: Go to the TuGraph/build directory and do`./output/algo/bfs_standalone -- type [type] -- input_dir [input_dir] --id_mapping [id_mapping] -- vertices [vertices] --root (root) - output_dir [output_dir]`
+
+Ready to run.
+
+- `[type]` : indicates the type source of the input graph file, including text file, BINARY_FILE binary file, and ODPS source.
+
+- `[input_dir]` : indicates the path of the input graph file folder, which may contain one or more input files. TuGraph will read all the files under [input_dir] when reading the input file. It is required that [input_dir] can only contain the input file and cannot contain other files. Parameters cannot be omitted.
+
+- `[id_mapping]`：When reading the side table, whether to do id mapping for the input data to make it conform to the form of algorithm operation. 1 is required for id mapping, 0 is not required. This process will take some time. The parameter can be omitted, and the default value is 0.
+
+- `[vertices]` : represents the number of vertices in the graph. 0 indicates the number of vertices that the user wants the system to automatically recognize. When is non-zero, it indicates the number of vertices that the user wants to customize. The number of user-defined vertices must be greater than the maximum vertex ID. This parameter can be omitted. The default value is 0.
+
+- `[root]` : indicates the starting vertex id for bfs. The argument cannot be omitted.
+
+- `[output_dir]` : indicates the path of the folder where the output data is saved. The output content is saved to this file, and the parameter cannot be omitted.
+
+Example
+
+### 4.1.C++
+
+Compile the standalone algorithm program at TuGraph/build
+
+```shell
+make bfs_standalone
+```
+
+Run the text source file in TuGraph/build/output
+
+```
+    ./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+Result：
+
+```
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+Result Parameter description is the same as above.
+
+If you do not know the required parameters of a new algorithm, run the`./output/algo/bfs_standalone -h` to view the parameters.
+
+### 4.2.Python
+The bfs extension compilation process of the Python language is the same as that of the embed mode. It is called through the `Standalone` interface at runtime. The example is as follows:
+
+```python
+# TuGraph/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(
+        input_dir="../test/integration/data/algo/fb_unweighted",
+        root=0)
+
+# shell
+python3 run_standalone.py
+```
+
+At this point, the process of bfs operation on the figure above by TuGraph is complete.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..af510f95c9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,196 @@
+# OlapBase API
+
+> This document will introduce how to use the OlapBase API
+
+## 1.The overview
+
+This manual will introduce the configuration of the TuGraph graph computing system. Combined with the code, several important files and interfaces in TuGraph are introduced.
+
+## 2.Configuration requirements
+
+To develop and compile applications using the TuGraph graph computing system, the configuration required:
+
+- linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+
+- Compiler that supports C++ 14, requires GCC version 5.4.1 or later.
+
+## 3.Atomic operations
+
+TuGraph uses multi-threading technology for batch operations, in which case memory access conflicts may occur. In order to ensure the correctness of modification operations in parallel computing, TuGraph implements atomic operations. The code section can be found in the lgraph_atomic.cpp file under the lgraph folder.
+
+TuGraph also customizes 4 commonly used atomic operations. When we need to modify the data of vertices in multithreaded mode, we should use atomic operations to ensure the correctness of the modification operation in parallel environment. In addition to these four atomic operations, users can also use "cas" to build their own atomic operation functions.
+
+- `bool cas(T \* ptr, T oldv, T newv)` : If the value pointed to by ptr is equal to oldv, the value pointed to by ptr is assigned to newv and returns true. Otherwise, false is returned
+- `bool write_min(T \*a, T b)` : If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `bool write_max(T \*a, T b)` : If b is larger than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `void write_add(T \*a, T b)` : adds the value of b to the value pointed to by a.
+- `void write_sub(T \*a, T b)` : subtract the value of b from the value pointed to by a.
+
+## 4.Vertex Class ParallelBitset
+
+When using TuGraph for batch operations, you need to use a vertex set to represent the vertices you want to process. ParallelBitset implements a vertex collection class that represents vertices in bits and thus saves a significant amount of memory. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 4.1ParallelBitset Class
+
+- `size_t Size()`：Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size_t size)`：Initialize size and data, the length of data is (size >> 6)+1.
+- `void Clear()`：clears the collection.
+- `void Fill()`：add all vertices to the set.
+- `bool Has(size_t i)`：check if vertex i is in the set.
+- `bool Add(size_t i)`：add vertex i to the set.
+- `void Swap(ParallelBitset &other)`：exchange elements with another set of ParallelBitset.
+
+## 5.Vertex Array Class ParallelVector
+
+When using TuGraph for batch operations, you need to use an array of vertices to represent the result of processing vertices. ParallelVector implements the vertex array class. The corresponding code can be found in the olap_base.h file in the lgraph folder.
+
+### 5.1.ParallelVector Class
+
+- `ParallelVector(size_t capacity)` Builds ParallelVector. capacity is the initial size of the vertex array
+- `T& operator[](size_t i)` : data with subscript i
+- `T \*begin()` : ParallelVector the starting pointer
+- `T \*end()` : ParallelVector the end pointer to Parallelvector. begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to access an array sequentially
+- `T&Back ()` : ParallelVector the last data
+- `T \*Data()` : represents the data in the array itself
+- `void Destroy()' : empty the ParallelVector array and delete the array
+- `size_t Size()` : indicates the number of data in ParallelVector
+- `size_t Capacity()` : indicates the capacity of ParallelVector
+- `void Resize(size_t size)` : Change ParallelVector to size, which must be greater than or equal to the size before the change
+- `void Clear()` : empty the data in ParallelVector
+- `void ReAlloc(size_t capacity)` : ParallelVector is allocated with new capacity. If data exists in the array, it is migrated to the new memory
+- `void Fill(T elem)` : Assign elem to all data on ParallelVector
+- `void Append(const T&elem, bool atomic = true)` : Add a piece of data at the end of ParallelVector
+- `void Swap(ParallelVector<t> &other)` : to exchange data with other parallelvectors</t>
+- `ParallelVector<t> Copy()` : copies the current ParallelVector data into the Copy array</t>
+
+## 6.Customize data structures
+
+### 6.1.Basic data types
+
+We customize the data structure representation of points and edges to save memory space while covering all vertices:
+
+- 'Empty' : indicates a special data type with empty content.
+
+### 6.2.Combining data structures
+
+In order to facilitate calculation, we define several data structures of point and edge data according to different calculation scenarios, which are as follows:
+
+- `EdgeUnit<edgedata>` : represents an edge of weight type EdgeData, used to parse the input file, and contains three member variables:</edgedata>
+- `size_t src` : the starting vertex of an edge
+- `size_t dst` : the end of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjUnit<edgedata>` : represents an edge of weight type EdgeData, used during batch computation, and contains two member variables:</edgedata>
+- `size_t neighbour` : indicates the neighbor vertex of an edge
+- `EdgeData edge_data` : edge weight
+- `AdjList<edgedata>` : Adjacency list of vertices with weights of type EdgeData, often used to represent the set of incoming and outgoing edges of vertices and containing two member variables:</edgedata>
+- `AdjUnit<t> \* begin` : indicates the start pointer of the list</t>
+- `AdjUnit<t> \* end` : The end pointer of the list.</t> begin and end are similar to the begin and end Pointers of a vector. You can use these Pointers to loop through the adjacency list.
+
+## 7.Graph class OlapBase
+
+Graph class OlapBase is the main class for TuGraph to load graphs and calculate graphs. OlapBase is commonly used to represent graphs with weights of type EdgeData. See olap_base.hpp under lgraph folder for the code. This chapter covers the types and API interfaces commonly used in Graph classes. The classes used by the Procedure, Embed, and Standalone functions described above are all subclasses of this class.
+
+### 7.1.Basic Information
+
+- `size_t NumVertices()` : obtains the number of vertices
+
+- `size_t NumEdges()` : Gets the number of edges
+
+- `size_t OutDegree(size_t vid)` : indicates the outdegree of the vid of the vertex
+
+- `size_t InDegree(size_t vid)` : indicates the input degree of vertex vid
+
+### 7.2.node sets and edge sets and their related operations
+
+- `ParallelVector AllocVertexArray()` : Allocates an array of type VertexData with size as the number of vertices
+
+- `void fill_vertex_array(V \* array, V value)` : assigns values to all elements in the array
+
+- `ParallelBitset AllocVertexSubset()` : Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+
+- `AdjList OutEdges(size_t vid)'`: gets the set of all outgoing edges of vertex v
+
+- `AdjList InEdges(size_t vid)` : Obtains the set of all incoming edges of vertex v
+
+- `void Transpose()` : transpose of a directed graph
+
+- `LoadFromArray(char \* edge_array, VertexId input_vertices, EdgeId input_edges, EdgeDirectionPolicy (edge_direction_policy) `: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+`edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+`input_vertices`: specifies the number of vertices read into the graph by the array.
+
+`input_edges` : specifies the number of edges that the array reads into the image.
+
+`edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+### 7.3.Locking mechanism
+
+TuGraph implements a pair of locks to control the program's access to vertex data. Respectively is:
+
+- `void AcquireVertexLock(size_t vid)` : locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(size_t vid)` : unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+- `VertexLockGuard GuardVertexLock(size_t vid)` : When the vid operation is performed, the vertex vid is locked, and the lock is automatically released upon exiting the scope
+
+### 7.4.Batch Processing Operations
+
+TuGraph provides two batch operations to do a point-centered batch process in parallel. Respectively is:
+
+```c++
+/*
+    Function Name:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    The work function executes the work function on nodes whose numbers are between lower and upper in the Graph. The fourth parameter indicates the accumulated base, which defaults to 0.The fifth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+For details, please refer to include/lgraph/olap_base.h
+
+    Example: Count the number of vertices in the parent array that have outgoing edges
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+graph is the instantiated object of graph class OlapBase
+
+```C++
+/*
+    Function Name:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+
+    Function: Execute the work function for the node that corresponds to 1 in active_vertices. The third parameter represents the cumulative cardinality, which is 0 by default.
+
+    The fourth parameter indicates that the iteration reduce function operation is performed on the return value of each node processed by work, and the default operation is the accumulation operation.
+
+    For specific implementation, please refer to the specific code in /include/lgraph/olap_base
+
+
+
+    Example: Output all the out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..6015d7e1ef
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,303 @@
+# OlapOnDB API
+
+> This document provides detailed instructions for using the OlapOnDB API
+
+## 1.Introduction
+
+Generally speaking, users need to implement the process of subgraph extraction by themselves. Then use the rich interface in TuGraph to implement your own graph analysis algorithm.
+
+This document mainly introduces the Procedure and Embed interface design, and introduces some common interface, specific interface information see include/lgraph/olap_on_db.h file.
+
+## 2.Schema
+
+Procedure and Embed auxiliary functions are mainly included in the OlapOnDB class, and some more frequently used functions will be introduced one by one
+
+OLAP is associated with the following common data structures in TuGraph:
+
+1. DB graph analysis class `OlapOnDB`
+
+2. Vertex array `ParallelVector`
+
+3. Vertex set `ParallelBitset`
+
+4. Side data structure `AdjUnit/AdjUnit`
+
+5. Edge collection data structure `AdjList`
+
+### 2.1.Snapshot Based Storage Structure
+
+The OlapOnDB class in TuGraph provides a data "snapshot," that is, a fully usable copy of a given data set that includes a mirror image of the corresponding data at a certain point in time (the point at which the copy was started). Because OLAP operations involve only reads and not writes, OlapOnDB arranges data in a more compact manner, saving space while improving data access locality.
+
+### 2.2.BSP Calculation Model
+
+TuGraph uses the BSP (Bulk Synchronous Parallel) model in the process of calculation, which makes the process can be executed in parallel, and greatly improves the efficiency of the program.
+
+The core idea of BSP calculation model is to propose and use Super Step. After OlapOnDB is created, the computation on this data is divided into multiple supersteps, such as PageRank, which is divided into multiple iterations, and each iteration is a Super Step. There is explicit synchronization between different Super Steps to ensure that all threads proceed to the next Super Step at the same time after completing the same superstep. Within a Super Step, all threads execute asynchronously, using parallelism to improve computational efficiency.
+
+BSP calculation model can effectively avoid deadlock, and achieve coarse-grained global synchronization in hardware mode by means of obstacle synchronization, so that graph computation can be executed in parallel, and programmers do not need to spend much time on synchronization mutual exclusion.
+
+## 3.Algorithm example
+
+Here is an explanation of the PageRank algorithm, which is mainly divided into the main function Process and the PageRank algorithm process function.
+
+### 3.1.Main function
+
+The main function has three input parameters, 'TuGraph' database parameter 'db', the request 'request' obtained from the web side, and the return value 'response' given to the web side. The overall process can be divided into the following steps:
+
+1. Obtain related parameters
+
+2. Create a snapshot class
+
+3. Main process of PageRank algorithm
+
+4. Obtain and send the return value of the web page
+
+```c
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+
+    // Obtain the number of iterations from web side requests (num_iterations)，
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // Read transaction creation and snapshot class creation
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+
+    // Create a pr array to store the pr value for each node
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank algorithm main process, obtain the pagerank value of each node
+    PageRankCore(olapondb, num_iterations, pr);
+
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        Function Purpose: Gets the number of the node with the largest pagerank among all nodes
+
+        Function flow description: This function executes Func A for node vi (also known as the active vertices) corresponding to all bits of 1 in the vertex set all_vertices. The return value of Func A is then used as the second input parameter of Func B to obtain the local maximum value (because the first input parameter is 0. So the return value is actually the pagerank value of each node). Finally, the return value of all threads is summarized, and Func B is executed again to get the global return value, and stored in the max_pr_vi variable
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+
+    // Retrieve and send the return value from the web page
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2.PageRank Algorithm process
+
+`pagerank` main process has two input parameters, snapshot class (subgraph) and iteration times, the overall process can be divided into the following steps:
+
+1. Initialization of related data structures
+2. Initialize the pagerank value of each node
+3. Calculation of pagerank value of each node, active vertices for all vertices (means that all vertices need to calculate pagerank value)
+4. Obtain the pagerank value after 'num_iterations' of each node
+
+```c
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+
+    // Initialization of related data structures
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // The initialization of the pagerank value of each node is inversely proportional to the degree of the node
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // Total iteration process
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            Function Purpose: Calculates the pagerank of all nodes
+
+            Function flow description: This function is used to calculate the pagerank value of all nodes. Execute Func C on node vi corresponding to all the bits of 1 in all_vertices to obtain the pagerank value of vi in the current iteration and return the pagerank change value of vi node. The total change value of all active nodes is finally summarized and returned through the internal processing of the function, which is stored in the delta variable
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // Gets the pagerank value of the current node from its neighbor
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank value calculation core formula
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+
+                    // Statistics of relevant intermediate variables
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // The pagerank value obtained in this iteration is output as the input of the next iteration
+        curr.Swap(next);
+    }
+}
+```
+
+### 4.1.Transaction creation
+
+```c
+// Create a read transaction
+auto txn = db.CreateReadTxn();
+
+// Write transaction creation
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2.Parallelization to create a directed graph
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3.Create undirected graphs in parallel
+
+```c
+OlapOnDB<empty> olapondb(</empty>
+db,
+txn,
+SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED;
+)
+```
+
+### 4.4.Obtain the output degree
+
+```c
+size_t OutDegree(size_t vid)
+```
+
+### 4.5.Obtain the input degree
+
+```c
+size_t InDegree(size_t vid)
+```
+
+### 4.6.Gets the outgoing edge set
+
+```c
+/*
+    Function name: AdjList OutEdges(size_t vid)
+
+    Data structure:
+
+    An AdjList can be understood as an array of structures of type AdjUnit
+
+    AdjUnit has two member variables: 1. size_t neighbour 2. edge_data: neighbour indicates the number of the target node pointed by the outgoing edge. If the value is a licensed graph, the data type of edge_data is the same as the weight value of the edge in the input file
+
+    Example Output all outgoing neighbors of node vid
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7.Gets the incoming edge set
+
+```c
+AdjList<edgedata> InEdges(size_t vid)</edgedata>
+
+// Example: Outputs all inbound neighbors of node vid
+for (auto & edge : olapondb.InEdges(vid)) {
+size_t dst = edge.neighbour;
+printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8.Get the node ID of OlapOnDB corresponding to the node in TuGraph
+
+```c
+size_t OriginalVid(size_t vid)
+
+// Note: The node numbers entered in TuGraph can be non-numbers, such as names. When OlapOnDB subgraphs are generated, names and other names will be converted to numbers for subsequent processing. Therefore, this method may not be applicable to some specific scenarios
+```
+
+### 4.9.Gets the node number of TuGraph corresponding to a node in OlapOnDB
+
+```c
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10.Description of active vertices
+
+Active vertices refer to the vertices that need to be processed in the batch function. In this example, we simply output the number of active vertices and summarize the number of active vertices:
+
+```c
+ParallelBitset temp = 000111; // The current active vertices are vertices 3, 4 and 5
+
+size_t delta = ForEachActiveVertex<double>(</double>
+//void c
+[&](size_t vi) {
+printf("active_vertexId = %lu\n",vi);
+return 1;
+},
+all_vertices
+);
+```
+
+The result of this function is obvious. Because of multiple threads, the output order may vary:
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+The local return value is 1. This function will add all the local return values in a thread-safe manner to the final return value, which is stored in the delta variable, and the final value is 3
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..bb3c784f13
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,213 @@
+# OlapOnDisk API
+
+> This document mainly introduces the usage instructions of OlapOnDisk API in detail
+
+## Table of contents
+
+- [1. Introduction](#1introduction)
+- [2. Algorithm Example](#2algorithm-example)
+     - [2.1 header files](#21head-file)
+     - [2.2 Configuration class MyConfig](#22configuration-class-myconfig)
+     - [2.3 Main function](#23main-function)
+     - [2.4 bfs algorithm flow](#24bfs-algorithm-process)
+- [3. Function description of other commonly used functions](#3description-of-other-commonly-used-functions)
+     - [3.1 Image Loading](#31graph-load)
+     - [3.2 Image writing](#32graph-write)
+     - [3.3 Graph Analysis Function](#33graph-parse-function)
+    
+### 1.Introduction
+
+The Standalone mode of TuGraph can be used to load graph data files, where the sources of graph data files can include text files, BINARY_FILE binary files, and ODPS sources. In this mode, TuGraph can quickly load multiple data sources into a graph, and then run iterative algorithms such as BFS, WCC, SSSP, etc. on the graph, and output the final result to the terminal.
+
+In TuGraph, the export and calculation process can be accelerated through parallel processing in memory, so as to achieve near real-time processing and analysis. Compared with traditional methods, it avoids the overhead of data export and storage, and can use compact Graph data structures achieve desirable performance for computation.
+
+TuGraph has built-in a large number of common graph analysis algorithms and rich auxiliary interfaces, so users hardly need to implement the specific graph calculation process by themselves. They only need to include the header file (.h) of the corresponding algorithm library when implementing their own stored procedures. To your own program, and link your own dynamic library files in the compilation phase.
+
+This document mainly introduces the common interfaces of Standalone, and the auxiliary functions used are mainly contained in the OlapOnDB class. At the same time, in order to help users understand and facilitate, the BFS algorithm is illustrated with examples.
+
+### 2.Algorithm example
+
+Here, the BFS algorithm is explained in blocks, which are roughly divided into the main function `main`, the BFS algorithm process `BFSCore` function and the configuration class MyConfig.
+
+#### 2.1.Head file
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //Header files to include when using TuGraph
+#include "./algo.h"   //A header file containing various algorithmic logic functions
+```
+
+When using TuGraph to realize the calculation application of graph data files, generally, the StandaloneGraph class object graph is first created, the graph file data is loaded into the graph, and then the graph calculation process is realized by calling the graph logic function, and finally the result of the graph calculation is printed out.
+
+#### 2.2.Configuration class MyConfig
+
+The MyConfig configuration class function is used to provide the configuration information required for the algorithm logic calculation, inherited from ConfigBase<EdgeData>, where EdgeDate can choose Empty (unweighted graph), int (the weight of the weighted graph is an integer) or double (the weight of the weighted graph is double) type.
+
+The MyConfig configuration class generally depends on the algorithm, and additional configuration information is required as follows:
+
+1. Parameters required by the algorithm
+2. Algorithm name
+3. Configure the Print function in the class
+Other common members inherit from ConfigBase, please refer to src/olap/olap_config.h for reference.
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // The parameters required by the algorithm are initialized
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // The configuration file accepts command line parameters. This use case will sequentially read the parameters when calling the algorithm from the command line. The value specified by the user is preferred. If the user does not specify it, the default parameter is selected.
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+#### 2.3.main function
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // Statistical memory consumption class MemUsage instantiation
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // Configuration class MyConfig instantiation
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk class instantiation
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // Statistical graph loading time consumption
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // Create an array to count whether a node has been traversed
+    auto parent = graph.AllocVertexArray<size_t>();
+    // Breadth-first search algorithm, returns the number of nodes connected to the root_vid root node in the graph
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // Print relevant information to the terminal
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+#### 2.4.bfs algorithm process
+
+The main process of `bfs` has two input parameters, the snapshot class (subgraph) and the number of iterations. The overall process can be divided into the following steps:
+
+1. Relevant definitions and initialization of data structures
+2. Use the batch function to perform cyclic calculations on each node, find all nodes adjacent to the current node in each round, and exchange them when the round ends.
+3. Until all nodes are found, return the number of nodes discovered_vertices.
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //Allocate an array, active_in is used to store the nodes found in the previous cycle stage
+  active_in.Add(root);            //Add the root node to the array
+  auto active_out = graph.AllocVertexSubset();  //Allocate the array active_out to store the nodes found in the current cycle stage
+  parent.Fill((size_t)-1);               //Assign a value of -1 to the node in the parent array, -1 means not found
+  parent[root] = root;
+  size_t num_activations = 1;       //Indicates the number of nodes found in the current loop phase
+  size_t discovered_vertices = 0;    //Indicates the total number of nodes found in the current cycle phase
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations indicates the number of nodes found in the current loop phase
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices indicates the total number of nodes found in the current cycle phase
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //Each cycle starts from the root node, finds adjacent adjacent nodes, changes its parent value, and operates num_activations+1
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //Store the nodes found in the current loop phase
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // return all nodes
+  return discovered_vertices;
+}
+```
+
+### 3.Description of other commonly used functions
+
+#### 3.1.Graph load
+
+TuGraph-StandaloneThe loading sources of graph data files are mainly divided into three categories: text files, binary files, and ODPS. The binary file is a file in which the binary representation of the edge data is arranged in order, which can save a lot of storage space. Its loading function is divided into three types, namely:
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：The loading method of the graph data file contains two parameters, and their meanings represent respectively
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `edge_direction_policy`：Specifies whether the graph is directed or undirected, including three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. Among them, DUAL_DIRECTION is the default graph loading method.
+  DUAL_DIRECTION : The input file is an asymmetric graph and the loaded graph is an asymmetric graph.
+  MAKE_SYMMETRIC : The input file is an asymmetric graph and the loaded graph is a symmetric graph.
+  INPUT_SYMMETRIC : The input file is a symmetric graph and the loaded graph is a symmetric graph.
+  For details, see `enum EdgeDirectionPolicy` in the olap_config.h file under the lgraph folder.
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：Load the vertices in the file into an array in the order of their ids. The meanings of each parameter are:
+  - `array`：array of data to be read
+  - `path`：The path to read the file, each line in the file represents a pair of vertex
+  - `parse_line`：A user-defined function that tells the system how to parse a line of text data into a vertex pair.
+
+
+#### 3.2.Graph write
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：Write the data in the array back to the file, and the meanings of each parameter are:
+  - `config`：Configuration parameters to load. This parameter saves the general information of the graph (such as data source, algorithm name, data input and output paths, number of vertices, etc.) and different information parameters configured according to different data sources and different algorithms.
+  - `array`：array of data to be written
+  - `array_size`：The length of the number of data to be written
+  - `name`：algorithm name
+  - `filter_output`：Write data rule function, the data to be written needs to meet the requirements of this function.
+
+#### 3.3.graph parse function
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：Parse the graph data file, and load the graph as an unweighted graph.
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：Parse the graph data file, load the graph as a weighted graph, and specify the weight data type by modifying <EdgeData>.
+
+This function can be specified through the constructor parse_line when the MyConfig class is defined.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..9417b31135
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,423 @@
+# Python Olap API
+
+> This document mainly introduces the API usage of OlapBase OlapOnDB and OlapOnDisk in Python
+
+## Table of contents
+- [1.Overview](#1-overview)
+- [2.Configuration Requirements](#2-configuration-requirements)
+- [3.Cython](#3-cython)
+- [4.Olap API](#4-olap-api)
+    - [4.1. Atomic operations](#atomic-operations)
+    - [4.2. Vertex collection class ParallelBitset](#vertex-collection-class-parallelbitset)
+    - [4.3. Vertex array class ParallelVector](#vertex-array-class-parallelvector)
+    - [4.4. Custom data structure](#custom-data-structure)
+    - [4.5.Graph class OlapBase](#graph-class-olapbase)
+    - [4.6. Graph Class OlapOnDB](#graph-class-olapondb)
+    - [4.7.Graph class OlapOnDisk](#graph-class-olapondisk)
+- [5.lgraph DB API](#5-lgraph_db-api)
+- [6.Algorithm plugin example](#6-algorithm-plug-in-example)
+
+## 1 Overview
+
+This manual will introduce the simple configuration required to use the Python interface of the TuGraph graph computing system, and explain the TuGraph Python API in conjunction with the code. For details about the functions of class ParallelBitset, OlapBase, etc., see olap-base-api.md, olap-on-db-api.md and olap-on-disk-api.md.
+
+## 2. Configuration requirements
+
+If you want to use TuGraph to write and compile your own applications, the required configuration requirements are:
+
+- Linux operating system, currently running successfully on Ubuntu16.04.2 and Centos7 systems.
+- A compiler that supports C++17 requires GCC version 5.4.1 or later.
+- Cython, version 3.0a1 or above is required, and the tested version is 3.0.0a11
+
+## 3. Cython
+Cython is an efficient programming language that is a superset of Python. Cython can translate .py files into C/C++ codes and compile them into Python extension modules, which can be called through import in Python. In TuGraph, all Python procedures are compiled into Python extension modules by Cython and then used.
+
+The main advantage of using Cython is that it combines the simplicity and ease of use of Python with the performance of C/C++. The TuGraph Python interface is implemented using Cython.
+
+[Cython Documentation](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+The Olap API is used for graph computing and is implemented in C++. The usage and functions are basically the same as the C++ interface. To use the API in a Python file, the interfaces declared in procedures/algo_cython/olap_base.pxd must be imported using `cython.cimports.olap_base import *`. The Python file can only be run after being compiled by Cython.
+
+### Atomic operations
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`: If the value pointed to by ptr is equal to oldv, assign the value pointed to by ptr to newv and return True, otherwise return False.
+- `write_min[T](a: cython.pointer(T), b: T)->cython.bint`: If b is smaller than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_max[T](a: cython.pointer(T), b: T)->cython.bint`: If b is greater than the value pointed to by a, then assign the value pointed to by a to b and return true, otherwise return false.
+- `write_add[T](a: cython.pointer(T), b: T)->cython.bint`: Add the value of b to the value pointed to by a.
+- `write_sub[T](a: cython.pointer(T), b: T)->cython.bint`: Subtract the value pointed to by a from the value of b.
+
+### Vertex collection class ParallelBitset
+- `Size() -> size_t`: Indicates the number of vertices in the Bitmap.
+- `ParallelBitset(size: size_t)`: Initializes size and data, where the length of data is (size >> 6) + 1.
+- `Clear() -> cython.void`: Empties the collection.
+- `Fill() -> cython.void`: Adds all vertices to the set.
+- `Has(i: size_t) -> cython.bint`: Checks if vertex i is in the set.
+- `Add(i: size_t) -> cython.bint`: Adds vertex i to the set.
+- `Swap(other: ParallelBitset) -> cython.void`: Exchanges elements with another ParallelBitset set.
+
+### Vertex array class ParallelVector
+- `ParallelVector[T](size_t capacity)`: Constructs a ParallelVector, where capacity is the initial capacity of the vertex array.
+- `operator[](i: size_t) -> T`: Returns the data at index i.
+- `begin() -> cython.pointer(T)`: Returns the start pointer of ParallelVector.
+- `end() -> cython.pointer(T)`: Returns the end pointer of ParallelVector. The usage of begin() and end() is similar to the begin and end pointers of the vector container, and these two pointers can be used to sequentially access the array.
+- `Back() -> T`: Returns the last data of ParallelVector.
+- `Data() -> cython.pointer(T)`: Indicates the data of the array itself.
+- `Destroy() -> cython.void`: Clears the data in the ParallelVector array and deletes the array.
+- `Size() -> size_t`: Indicates the number of data in ParallelVector.
+- `Resize(size: size_t) -> cython.void`: Changes ParallelVector to size, which should be greater than or equal to the size before the change and less than capacity.
+- `Clear() -> cython.void`: Clears the data in ParallelVector.
+- `ReAlloc(capacity: size_t) -> cython.void`: Allocates a new capacity size to ParallelVector. If the array has data, it migrates the data to the new memory.
+- `Fill(elem: T) -> cython.void`: Assigns elem to all data of ParallelVector.
+- `Append(elem: T, atomic: cython.bint = true) -> cython.void`: Adds a data to the end of ParallelVector.
+- `Swap(other: ParallelVector[T]) -> cython.void`: Exchanges data with another ParallelVector.
+- `Copy() -> ParallelVector[T]`: Copies the current ParallelVector data and stores it in the copy array.
+
+
+### Custom Data Structure
+- `Empty`: A special data type whose content is empty.
+- `EdgeUnit[EdgeData]`: Indicates the edge whose weight type is EdgeData, used to parse the input file, including three member variables:
+    - `src: size_t`: starting vertex of the edge
+    - `dst: size_t`: end of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjUnit[EdgeData]`: indicates the edge whose weight type is EdgeData, which is used in the batch calculation process and contains two member variables:
+    - `neighbor: size_t`: neighbor vertex of the edge
+    - `edge_data: EdgeData`: edge weight
+- `AdjList[EdgeData]`: The adjacency list of vertices whose weight type is EdgeData, often used to represent the set of incoming and outgoing edges of vertices, including three member functions:
+    - `begin()->cython.pointer(AdjUnit[T])`: the starting pointer of the list
+    - `end()->cython.pointer(AdjUnit[T])`: the end pointer of the list
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: the data whose subscript is i
+
+### Graph class OlapBase
+- `NumVertices()->size_t`: get the number of vertices
+- `NumEdges()-> size_t`: get the number of edges
+- `OutDegree(vid: size_t)-> size_t`: out-degree of vertex vid
+- `InDegree(vid: size_t)->size_t`: in-degree of the vertex vid
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`: Allocates an array of type VertexData with size as the number of vertices
+- `AllocVertexSubset()-> ParallelBitset`: Assigns a subset of ParallelBitsets to denote whether the state of all vertices is activated
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all outgoing edges of vertex v
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`: Get the list of all incoming edges of vertex v
+- `Transpose()->cython.void`: transpose of a directed graph
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`: Loads the graph data from the array, contains four parameters, the meaning of which are respectively:
+
+    - `edge_array` : reads the data from the array into the graph. Normally, the array contains multiple edges.
+
+    - `input_vertices`: specifies the number of vertices read into the graph by the array.
+
+    - `input_edges` : specifies the number of edges that the array reads into the image.
+
+    - `edge_direction_policy` : indicates that the graph is directed or undirected. The graph can be divided into three modes: DUAL_DIRECTION, MAKE_SYMMETRIC, and INPUT_SYMMETRIC. For details, see 'enum EdgeDirectionPolicy' in the config.h file in the core folder.
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`: locks a vertex vid and prohibits other threads from accessing the vertex data corresponding to this lock
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`: unlocks the vertex vid and all threads can access the vertex data corresponding to the lock
+
+TuGraph provides two batch operations to perform point-centric batch processing in parallel, which is slightly different from C++ in Python.
+
+```python
+# Function name: ProcessVertexInRange[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# lower: size_t, upper: size_t,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Executes the work function on nodes whose node numbers are between lower and upper in the Graph. The fourth parameter indicates the base of accumulation, which is 0 by default.
+# The fifth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in include/lgraph/olap_base.h
+#
+# Example usage: Count the number of vertices with edges in the parent array.
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython.pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+g is the instantiated object of graph class OlapBase
+
+```python
+# Function name: ProcessVertexActive[ReducedSum, Algorithm](
+# work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+# active: ParallelBitset,
+# algo: Algorithm,
+# zero: ReducedSum = 0,
+# reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+# Function purpose: Execute the work function on the nodes corresponding to 1 in the active_vertices bitset. The third parameter indicates the base of accumulation, which is 0 by default;
+# The fourth parameter indicates that the iterative reduce function operation is performed on the node return value after each work process, and the default is the accumulation operation.
+# For specific implementation, please refer to the specific code in /include/lgraph/olap_base.h
+#
+# Usage example: Output all out-degree neighbors of nodes 1, 2, and 3 in the Graph, and count the total out-degree of these three nodes.
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self. graph. OutDegree(vi)
+        dst: size_t
+        edges = self. graph. OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbor
+            printf("node %lu has neighbor %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+As shown in the above two examples, ProcessVertexActive and ProcessVertexInRange in Python require an additional algorithm class pointer parameter compared to their C++ counterparts. The Work function is generally used as a member function of the algorithm class to access member variables, such as in the graph and ParallelVector parent examples shown above. When calling the batch function, the Work function and the self pointer of the algorithm class are passed to the batch function.
+
+The Work function will be called in multiple threads, so the @cython.nogil decorator is added to release the Python global interpretation lock. In code executed by multiple threads, such as the Work function in the batch function, variables are better declared as C/C++ types using `dst: type` or `dst = cython.declare(type)`. This is because Python objects cannot be used in multi-threaded code.
+
+### Graph class OlapOnDB:
+Parallelize to create a directed graph:
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+Parallelize to create an undirected graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING creates a directed graph
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### Graph class OlapOnDisk
+
+#### ConfigBase:
+- `ConfigBase()`: Constructor
+- `std::string input_dir`: graph edge table data path
+- `std::string output_dir`: output path
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: read in graph data
+
+## 5. lgraph_db API
+Please refer to the files procedures/algo_cython/lgraph_db.pxd and lgraph_db_python.py for the lgraph_db API.
+
+The usage and functions of the interface in lgraph_db.pxd are basically the same as the C++ interface. The interface declared in lgraph_db.pxd is implemented in C++. In the py file, it must be imported by `cython.cimports.olap_db import *` and compiled by the Cython file to run.
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: Get the vid of the vertex
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: constructor, dir_path is the db path
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: set user
+- `SetUser(user: std::string)-> cython.void`: set user
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: create GraphDB
+
+### GraphDB:
+- `CreateReadTxn()-> Transaction`: create a read-only transaction
+- `CreateWriteTxn()-> Transaction`: create a write transaction
+- `ForkTxn(txn: Transaction)-> Transaction`: Copy transactions, only read transactions can be copied
+
+### Transaction:
+```
+GetVertexIndexIterator(
+                 label: std::string,
+                 field: std::string,
+                 key_start: std::string,
+                 key_end: std::string) -> VertexIndexIterator
+```
+Gets index iterator. The iterator has field value [key_start, key_end]. So key_start=key_end=v returns an iterator pointing to all vertexes that has field value v
+
+
+
+lgraph_db_python.py packages the C++ classes Galaxy and GraphDB from lgraph_db.pxd as Python classes. After compiling lgraph_db_python.py into a Python extension, you can directly access it in a Python file or from the Python command line by importing it with `import lgraph_db_python`.
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: constructor, dir_path is the db path
+- `SetCurrentUser(self, user: str password: str)-> void`: set user
+- `SetUser(self, user: std::string)-> void`: set user
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: create PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)->cython.Py_ssize_t`: address of C++ class GraphDB
+
+## 6. Algorithm plug-in example
+The following is a code example of the BFS algorithm implemented in Python:
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# Comments work as follows:
+# language_level=3: use Python3
+# cpp_locals=True: C++17 is required, and std::optional is used to manage C++ objects in Python code, which can avoid copy construction of C++ objects
+# boundscheck=False: Turn off bounds checking for indexes
+# wraparound=False: Turn off the processing of negative subscripts (similar to Python List)
+# initializedcheck=False: Turn off checking whether the memory is initialized, and the running performance will be faster after turning off the check
+# language = c++: translate this .py file to C++ instead of C file. TuGraph uses a lot of template functions, so C++ should be used
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# From procedures/algo_cython/ cimportolap_base.pxd and lgraph_db.pxd, similar to #include "xxx.h" in C++
+
+from cython.cimports.libc.stdio import printf
+# Similar to #include <stdio.h> in C++
+# Other common ones include cython.cimports.libcpp.unordered_map, etc.
+
+import time
+
+@cython.cclass
+# cython.cclass indicates that BFSCore is a C-type Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty]) indicates the pointer of OlapBase[Empty], similar to OlapBase[Empty]* in C++
+    # Cython provides common types of pointers, such as cython.p_int, cython.p_char, etc.
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t declares root as a C++ size_t type variable, equivalent to root = cython.declare(size_t)
+    # Variables that do not declare a type are Python object types
+    # Declaring variable types will greatly improve performance, and in the multi-threaded part, only C/C++ type variables can be accessed
+
+    @cython.cfunc
+    # cython.cfunc indicates that Work is a C-type function, and the parameters and return values should be declared
+    # cfunc has good performance and can accept C/C++ objects as parameters and return values, but it cannot be called in other python files
+    # Similar to cython.ccall, such as Standalone function, which can be called in other python files
+    @cython.nogil
+    # cython.nogil means to release the Python global interpretation lock. In the part modified by nogil, Python objects cannot be accessed
+    # In the multi-threaded part, there should be nogil decorator
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) means that exception propagation is disabled, and Python exceptions raised inside the function will be ignored
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbor
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 means that dst has not been visited by bfs
+                if self.active_out.Add(dst):
+                    # Set dst as an active node; ParallelBitmap.Add is an atomic operation to prevent double calculation
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython. size_t:
+        self. graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self. parent. Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self. active_in. Add(self. root)
+        while num_activations > 0:
+            self. active_out. Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self. active_out. Swap(self. active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time. time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # Create OlapOnDB in parallel
+    # Cython does not support dereference operations such as *db, use db[0] to dereference
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # Get the iterator of the root node through GetVertexIndexIterator based on the root node label name, field name and field value (root_id),
+    # and get the vid through the iterator. When there is no ID_MAPPING, the vid is the same as the id in OlapOnDB
+    cost = time. time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time. time()
+    count = a. run(cython. address(olapondb), root_vid)
+    cost = time. time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb. NumVertices()
+    response["num_edges"] = olapondb. NumEdges()
+    return True
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process is the plug-in entry in embed mode and procedure mode, modified with cython.ccall
+    # The Process function must be named Process, and the parameters are lgraph_db_python.PyGraphDB and bytes
+    # The return value must be (bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # Get the address of the GraphDB object in the PyGraphDB, convert it to a pointer and pass it
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..e496945495
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,191 @@
+# TuGraph Built-in Algorithm Description
+
+> This document mainly introduces the TuGraph built-in algorithm program in detail, the community version of 6 algorithms can refer to the basic algorithm newspaper
+
+## 1.Introduction
+
+TuGraph currently contains the following 6 basic algorithms and 28 extended algorithms, a total of 34 graph algorithms:
+
+### 1.1.Basic algorithms:
+
+|    Algorithm name            | The program name |
+| :--------------------------: | :--------------: |
+|     Breadth-First Search     |       bfs        |
+|           Pagerank           |     pagerank     |
+| Single-Source Shortest Path  |       sssp       |
+| Weakly Connected Components  |       wcc        |
+| Local Clustering Coefficient |       lcc        |
+| Label Propagation Algorithm  |       lpa        |
+
+### 1.2.Extended algorithms:
+
+|            Algorithm name                    |   The program name   |
+| :------------------------------------------: | :------------------: |
+|            All-Pair Shortest Path            |         apsp         |
+|            Betweenness Centrality            |          bc          |
+|              Belief Propagation              |          bp          |
+|             Closeness Centrality             |          clce        |
+|             Common Neighborhood              |          cn          |
+|              Degree Correlation              |          dc          |
+|             Dimension Estimation             |          de          |
+|                    EgoNet                    |          en          |
+|        Hyperlink-Induced Topic Search        |         hits         |
+|                Jaccard Index                 |          ji          |
+|                    K-core                    |        kcore         |
+|                   Louvain                    |       louvain        |
+|        Multiple-source Shortest Paths        |         mssp         |
+|            Personalized PageRank             |         ppr          |
+|        Strongly Connected Components         |         scc          |
+| Speaker-listener Label Propagation Algorithm |         slpa         |
+|          Single-Pair Shortest Path           |         spsp         |
+|              Triangle Counting               |       triangle       |
+|                  Trustrank                   |      trustrank       |
+|     Weighted Label Propagation Algorithm     |         wlpa         |
+|         Weighted Pagerank Algorithm          |      wpagerank       |
+|           Maximal independent set            |         mis          |
+|                  Sybil Rank                  |      sybilrank       |
+|             Subgraph Isomorphism             | subgraph_isomorphism |
+|                    Motif                     |        motif         |
+|                   Kcliques                   |       kcliques       |
+|                    Ktruss                    |        ktruss        |
+|                    Leiden                    |        leiden        |
+
+## 2.Basic algorithms
+
+### 2.1.Breadth-First Search
+
+Breadth first Search implements the Breadth-first Search algorithm, which starts from the root vertex and traverses all accessible vertices along the width of the graph. Returns the number of vertices traversed. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 2.2.Pagerank
+
+Web page sorting program to achieve the commonly used Pagerank algorithm. The algorithm calculates the importance ranking of all vertices according to the edge and edge weight in the graph. The higher the PageRank value, the higher the importance of the vertex in the graph. The reciprocal of the number of vertices is used as the initial Rank value of each vertex, and then the Rank value of the vertices is transferred to the adjacent vertices on average according to the outgoing edges, and the transfer process is repeated until the given convergence threshold is met or the given number of iterations is reached. At the end of each pass round, a certain proportion of the Rank values of all vertices will be randomly transferred to any vertex. Please refer to the algorithm content [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 2.3.Single-Source Shortest Path
+
+The Single Source Shortest Path algorithm realizes the Single Source Shortest Path algorithm. It calculates the shortest path length from a given source vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 2.4.Weakly Connected Components
+
+The program of Weakly Connected Components has implemented the algorithm. It can calculate all the weakly connected components in the graph. A weakly connected component is a subgraph of a graph in which reachable paths exist between any two points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Connected*component*(graph_theory)](<https://en.wikipedia.org/wiki/Connected_component_(graph_theory)> "scc wiki")。
+
+### 2.5.Local Clustering Coefficient
+
+The average Clustering Coefficient program implements the Local Clustering Coefficient algorithm to calculate the coefficient of the degree of clustering between vertices in the graph. The returned results include the overall clustering coefficient and the vertex clustering coefficient. The overall agglomeration coefficient reflects the evaluation of the overall agglomeration degree in the graph, and the vertex agglomeration coefficient includes the agglomeration coefficient of any vertex, which reflects the agglomeration degree near the vertex. The higher the agglomeration coefficient, the higher the agglomeration degree. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 2.6.Label Propagation Algorithm
+
+The program implements Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and computes unauthorised graphs. In label passing, each vertex adds up all the labels received, and randomly selects one of the labels with the highest sum. The iteration converges or the algorithm terminates after a given number of rounds. The final output is a label for each vertex, and vertices with the same label value are considered to be in the same community. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+## 3.Extended algorithms
+
+### 3.1.All-Pair Shortest Path
+
+The All-Pair Shortest Path program realizes the all-pair Shortest Path algorithm and calculates the shortest path between any two points in the graph. Returns the shortest path length between any pair of vertices where the path exists. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 3.2.Betweenness Centrality
+
+Betweenness Centrality algorithm is implemented in Betweenness centrality program to estimate the betweenness centrality value of all vertices in a graph. The value of intermediate centrality reflects the possibility that any shortest path in the graph passes through the vertex, and the higher the value, the more shortest paths pass through the vertex. During calculation, the number of sampling points should be given, and the calculation should be carried out based on these sampling points. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 3.3.Belief Propagation
+
+The Belief Propagation algorithm is implemented in the confidence propagation program. Given the edge distribution of the observed vertices, the algorithm estimates the edge distribution of the unobserved vertices by using the mechanism of passing messages among vertices. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 3.4.Closeness Centrality
+
+The Distance Centrality program implements the Closeness Centrality algorithm, which estimates the average shortest path length from any node to other nodes in the graph. A smaller distance centrality value indicates that the node has a smaller average shortest distance to other nodes, meaning it is more centrally located in the graph from a geometric perspective. The calculation requires specifying the number of sampling points, and the algorithm computes the centrality values for each of these sampling points. For the algorithm content, please refer to [https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki").
+
+### 3.5.Common Neighborhood
+
+The Common Neighborhood program implements the common Neighborhood algorithm to count the number of common neighbors between any given pair of neighboring vertices. Given several pairs of vertices to be queried, the result is the number of common neighbors of any pair of vertices to be queried.
+
+### 3.6.Degree Correlation
+
+The Degree Correlation algorithm is implemented in the degree correlation program. It calculates the degree correlation degree of a graph by calculating the Pearson correlation coefficient between any adjacent vertex pairs, which can be used to characterize the correlation degree between high-degree vertices in the graph. A higher degree of correlation indicates a higher degree of correlation between vertices of higher degree in the graph. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 3.7.Dimension Estimation
+
+The diameter Estimation program implements the Dimension Estimation algorithm. The algorithm calculates the length of the longest shortest path in the graph, which is used to characterize the diameter of the graph. Please refer to the algorithm content[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### 3.8.EgoNet
+
+The EgoNet algorithm requires a given root vertex and K value, and takes the root vertex as the source vertex to conduct a width-first search to find the subgraph composed of all neighbors within K degrees. The found subgraph is called the EgoNet of the root vertex.
+
+### 3.9.Hyperlink-Induced Topic Search
+
+The Hyperlink Topic Search algorithm implements the Hyperlink-induced topic search algorithm, which assumes that each vertex has two attributes: Authority and Hub. A good hub vertex should point to many vertices with high authority. And a good authority vertex should be pointed to by many vertices of high pivot type. The algorithm returns the authority value and the hub value for each vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 3.10.Jaccard Index
+
+The Jaccard coefficient program implements the Jaccard Index algorithm. The algorithm calculates the Jaccard coefficient between a given pair of vertices, which can be used to represent the similarity of the two vertices. A higher Jaccard coefficient indicates a higher degree of similarity between pairs of vertices. Given several pairs of vertices with the query, the Jaccard coefficients of these pairs are returned. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### 3.11.K-core
+
+k accounting method implements k-core algorithm. The algorithm computes the number of kernels of all vertices, or finds all K-nucleon graphs in the graph. K-nucleon graph is a special subgraph in which the degree of any vertex is not less than a given K value. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Degeneracy\_(graph_theory)](<https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)> "kcore wiki")。
+
+### 3.12.Louvain
+
+The Louvain community discovery program implements the Fast-unfolding algorithm. The algorithm is a community discovery algorithm based on modularity. It maximizes the modularity of the graph by constantly merging vertex communities, and can discover the hierarchical community structure. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 3.13.Multiple-source Shortest Paths
+
+The multisource Shortest Paths program implements the multiple-source Shortest Paths algorithm to calculate the shortest path value to any vertex from the given Multiple source vertices. Where, the shortest path value of multiple source vertices to a vertex is the minimum value of the shortest path from each source vertex to the vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 3.14.Personalized PageRank
+
+Personalized web ranking program has Personalized PageRank algorithm. According to the given source vertex, the algorithm calculates the importance ranking of all vertices to the source vertex based on the source vertex. The higher the Rank value, the more important the vertex is to the source vertex. Unlike PageRank, the source vertex Rank value is 1, the rest of the vertex Rank value is 0; And a certain proportion of Rank value will be immediately transferred back to the source vertex after each round of transmission. Please refer to the algorithm content [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 3.15.Strongly Connected Components
+
+Strongly Connected component program realizes the Strongly Connected Components algorithm. The algorithm computes all strongly connected components of the graph, which is a subgraph of the graph that can start from any vertex to any other vertex. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 3.16.Speaker-listener Label Propagation Algorithm
+
+The program realizes the Speaker-listener Label Propagation Algorithm. This algorithm is a community discovery algorithm based on tag propagation and historical tag record, which is an extension of tag propagation algorithm. Different from the label propagation algorithm, this algorithm records the historical labels of all vertices. When the labels are accumulated in the iteration, the historical labels are also counted. The final output is all the historical label records for each vertex. Please refer to the paper for the algorithm content:“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 3.17.Single-Pair Shortest Path
+
+The program of the shortest path between two points implements the Bidirectional point-first Search algorithm. It searches forward width First along the outgoing edge from the starting point and reverse width first along the incoming edge from the end point on the directed undirected graph. The shortest path length from the starting point to the ending point is determined by traversing the vertices of the starting point and the ending point together. Please refer to the algorithm content[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 3.18.Triangle Counting
+
+The Triangle-counting algorithm is implemented to calculate the number of triangles in an undirected graph, which can be used to characterize the correlation degree of the vertices in the graph. The higher the number of triangles, the higher the degree of correlation of the vertices in the graph. For the algorithm content, please refer to the paper, "Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study".
+
+### 3.19.Trustrank
+
+The Trust Index Sorting Algorithm implements the Trustrank algorithm, which can calculate the Trust Index of any vertex based on a given whitelist. The higher the trust score, the less likely the vertex is to be illegal. Please refer to the algorithm content for details. [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 3.20.Weighted Label Propagation Algorithm
+
+Weighted Label Propagation Algorithm is implemented in the program. = Different from the label propagation algorithm, the label transmission is related to the weight of the edge. During label transmission, the weight of each vertex will be accumulated according to the incoming edge of the label, and the label with the highest sum will be randomly selected. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 3.21.Weighted Pagerank Algorithm
+
+Weighted Pagerank is implemented in the weighted Pagerank algorithm. Different from PageRank algorithm, the transfer of Rank value is related to the weight of the edge. The Rank value of the vertex will be transferred to the adjacent vertices according to the weight of the edge. Please refer to the algorithm content[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 3.22.Maximal independent set
+
+Maximal independent set algorithm implements Maximal Independent Set algorithm. A maximum independent set means that there are no vertices outside the independent set that can join it. A graph may have many MIS that vary greatly in size, and the algorithm finds one of them. Please refer to the algorithm content [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### 3.23.Sybil Rank
+
+Sybil detection algorithm implements Sybil Rank algorithm. The SybilRank algorithm starts from non-Sybil nodes and performs a random walk with premature termination. Please refer to the paper for the algorithm content:“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 3.24.Subgraph Isomorphism
+
+The subgraph matching algorithm implements the subgraph_isomorphism algorithm. The subgraph_isomorphism algorithm matches all nodes in the whole graph and outputs the number of times each node is matched. Algorithm Content Reference [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 3.25.Motif
+
+Pattern matching algorithm implements motif algorithm. motif algorithm matches k-order subgraphs for the specified nodes, and finally outputs the number of each kind of K-order subgraphs for each specified node. Each K-order subgraph is represented by a 64-bit integer, and the $i \times k + j$bit is 1, indicating that there is an edge i->j in the subgraph. Algorithm Content Reference [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### 3.26.Kcliques
+
+The K-order clique counting algorithm implements the k-cliques algorithm. The k-cliques algorithm calculates the number of all K-order complete subgraphs in the graph, and finally outputs the number of k-order complete subgraphs of each node. Algorithm Content Reference [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### 3.27.Ktruss
+
+The k-order truss counting algorithm implements the k-truss algorithm. A k-truss is a subgraph in which each edge is the edge of at least k-2 triangles. The k-truss algorithm finds out the k-truss subgraph of the graph, and finally outputs the neighbor node list of each node in the subgraph. Algorithm Content Reference[https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+
+### 3.28.Leiden
+
+Leiden algorithm implements Leiden's algorithm. leiden algorithm is a community discovery algorithm based on modularity. Compared with louvain algorithm, leiden algorithm has the advantage that Leiden algorithm detects the broken links in the community to ensure that each community has good connectivity. Algorithm Content Reference [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..dc955b3b91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+TuGraph DB OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..689128d8a0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,100 @@
+# Learning Tutorial
+
+> This document is designed as a guide for TuGraph users. Before reading the detailed documentation, users should first read this document to have a general understanding of the graph learning process of TuGraph, which will make it easier to read the detailed documentation later. The guide program is based on a simple program instance of TuGraph, and we will focus on its usage.
+
+## 1. Introduction to TuGraph Graph Learning Module
+Graph learning is a machine learning method that utilizes the topological information of a graph structure to analyze and model data. Unlike traditional machine learning methods, graph learning uses graph structures where vertices represent entities in data and edges represent relationships between entities. By extracting features and patterns from these vertices and edges, deep associations and patterns can be revealed in data that can be used in various practical applications.
+
+The TuGraph Graph Learning Module is a graph learning module based on a graph database that provides four sampling operators: Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. These operators can be used to sample vertices and edges in a graph to generate training data. The sampling process is performed in a parallel computing environment, providing high efficiency and scalability.
+
+After sampling, the obtained training data can be used to train a model that can be used for various graph learning tasks such as prediction and classification. Through training, the model can learn the relationships between vertices and edges in the graph, allowing for prediction and classification of new vertices and edges. In practical applications, this module can be used to handle large-scale graph data such as social networks, recommendation systems, and bioinformatics.
+
+## 2. Run Process
+The TuGraph graph learning module samples graph data in TuGraph, and the sampled vertices and edges are used as graph learning features for learning and training. The operation process is shown in the figure below:
+
+![Alt text](../../../../images/learn_flow_chart_en.png)
+
+## 3. TuGraph compilation and data preparation
+For TuGraph compilation, please refer to: [Compile](../../5.installation&running/6.compile.md)
+Execute in the build/output directory:
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+This command copies the relevant files of the dataset to the build/output directory.
+
+## 4. Data Import
+Please refer to [Data Import](../../6.utility-tools/1.data-import.md) for data import.
+
+Taking the cora dataset as an example for the import process:
+
+Execute in the build/output directory:
+
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+Where cora.conf is the graph schema file representing the format of the graph data. coradb is the imported graph data file name representing the storage location of the graph data.
+
+## 5. Feature Conversion
+Since the features in graph learning are generally represented as long float arrays, TuGraph does not support loading float array types, so they can be imported as string types and converted to char* for subsequent storage and access, and the implementation details can refer to the feature_float.cpp file.
+
+The specific execution process is as follows:
+
+Compile the imported plugin in the build directory.（Skip if TuGraph has been compiled）:
+
+`make feature_float_embed`
+
+Execute in the build/output directory:
+
+`./algo/feature_float_embed ./coradb`
+
+Then the conversion can be performed.
+
+## 6. Sampling Operators and Compilation
+TuGraph implements an operator for obtaining the full graph data and four sampling operators at the cython layer, as follows:
+
+### 6.1.Sampling Operator Introduction
+|Sampling Operator | Sampling Method |
+| --- | --- |
+|GetDB | Get the graph data from the database and convert it into the required data structure |
+|Neighbor Sampling | Sample the neighboring nodes of the given node to obtain the sampling subgraph |
+|Edge Sampling | Sample the edges in the graph according to the sampling rate to obtain the sampling subgraph |
+|Random Walk Sampling | Conduct a random walk based on the given node to obtain the sampling subgraph |
+|Negative Sampling | Generate a subgraph of non-existent edges|
+
+### 6.2.Compilation
+Skip if TuGraph has been compiled.
+Execute in the tugraph-db/build folder:
+
+`make -j2`
+
+Or execute in the tugraph-db/learn/procedures folder:
+
+`python3 setup.py build_ext -i`
+
+Once the algorithm so is obtained, it can be used by importing it in Python.
+
+## 7. Model Training and Storage
+TuGraph calls the cython layer operator at the Python layer to implement graph learning and training.
+
+The usage of the TuGraph graph learning module is as follows:
+
+Execute in the build/output folder:
+
+`python3 train_full_cora.py --model_save_path ./cora_model`
+
+Then training can be performed.
+
+If the final printed loss value is less than 0.9, the training is successful. So far, the graph model training is completed, and the model is saved in the cora_model file.
+
+## 8. Model Loading
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+Before using a saved model, it is necessary to load it first. In the code above, the trained model is loaded using the provided code.
+
+After loading the model, we can use it to make predictions and classifications for new vertices and edges. For prediction, we can input one or multiple vertices and the model will output corresponding prediction results. For classification, we can input the whole graph, and the model will classify the vertices and edges in the graph to achieve the task goal.
+
+Using a trained model can save time and resources compared to retraining the model. Additionally, since the model has already learned the relationships between vertices and edges in the graph, it can adapt well to new data and improve the accuracy of predictions and classifications.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..c649fa50e8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,102 @@
+# Sampling API
+
+>This document provides a detailed guide on using the Sampling API of TuGraph.
+
+## 1. Overview
+This manual introduces the Sampling API using TuGraph.
+
+## 2. Graph Data Instantiation
+Before the sampling operation, load the graph data according to the graph data path, and map it into the olapondb graph analysis class, the code is as follows:
+
+```python
+galaxy = PyGalaxy(args.db_path) # Create a galaxy instance based on the path
+galaxy.SetCurrentUser(args.username, args.password) # Set the current user
+db = galaxy.OpenGraph('default', False) # Open the graph database specified by db
+txn = db.CreateReadTxn() # Create a transaction instance
+olapondb = PyOlapOnDB('Empty', db, txn) # Instantiate OlapOnDB based on the graph loading method, graph database instance, and transaction instance
+del txn
+del db
+del galaxy
+```
+## 3. Introduction to Sampling Operators
+The graph sampling operator is implemented in the cython layer and is used to sample the input graph. The generated NodeInfo is used to save point information such as feature attributes and label attributes, and EdgeInfo is used to save edge information. These metadata information can be used for features Extraction, network embedding and other tasks. Currently, the TuGraph graph learning module supports five sampling operators: GetDB, NeighborSampling, EdgeSampling, RandomWalkSampling, and NegativeSampling.
+
+### 3.1.RandomWalk Operator
+Random walks are performed a specified number of times around the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.2.NeighborSampling Operator
+A certain number of nodes are sampled from the first-degree neighbors of the sampling nodes to obtain the sampling subgraph.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_node: A list of nodes to be sampled.
+nei_num: The number of neighbor nodes to be sampled for each node.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.3.NegativeSampling Operator
+The negative sampling algorithm is used to generate a subgraph of non-existent edges.
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+num_samples: The number of false edges to be generated.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.4.EdgeSampling Operator
+The edge sampling algorithm is used to generate a subgraph of sampled edges.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+sample_rate: The sampling rate of the edges to be selected.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+### 3.5.GetDB Operator
+Get the graph data from the database and convert it into the required data structure.
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+Parameter list:
+
+db_: An instance of the graph database.
+olapondb: Graph analysis class.
+feature_num: The length of the feature vectors for the nodes.
+NodeInfo: A list of dictionaries containing metadata information for the nodes.
+EdgeInfo: A list of dictionaries containing metadata information for the edges.
+Return value: This function does not return anything.
+
+## 4. User-Defined Sampling Algorithm
+Users can also implement a custom sampling algorithm through the TuGraph Olap interface. For the interface document, see [here](../2.olap/5.python-api.md). This document mainly introduces the interface of related functions used by the graph sampling algorithm design.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..510f3d4fcd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,96 @@
+# Training
+> This document details how to use TuGraph for training Graph Neural Networks (GNNs).
+
+## 1. Training
+When using TuGraph's graph learning module for training, it can be divided into two categories: full graph training and mini-batch training.
+
+Full graph training involves loading the entire graph from the TuGraph db into memory and training the GNN. Mini-batch training uses the sampling operator of the TuGraph graph learning module to sample the entire graph data and then input it into the training framework for training.
+
+## 2. Mini-Batch Training
+Mini-batch training requires the use of TuGraph's graph learning module's sampling operators, which currently support Neighbor Sampling, Edge Sampling, Random Walk Sampling, and Negative Sampling. The sampling result of the TuGraph graph learning module's sampling operator is returned in the form of a List.
+
+The following takes Neighbor Sampling as an example to introduce how to convert the sampled results into the training framework for format conversion.
+The user needs to provide a Sample class:
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. Load graph data
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+        # 2. Sampling method, the result is stored in NodeInfo and EdgeInfo
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+        # 3. Format conversion of the result to fit the training format
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+As shown in the code, the graph data is first loaded into memory. Then use the sampling operator to sample the graph data, and the results are stored in NodeInfo and EdgeInfo. NodeInfo and EdgeInfo are python list results, and the stored information results are as follows:
+
+|Graph Data | Storage Position |
+| --- | --- |
+|Edge source | EdgeInfo[0] |
+|Edge destination | EdgeInfo[1] |
+|Vertex ID | NodeInfo[0] |
+|Vertex features | NodeInfo[1] |
+|Vertex label | NodeInfo[2] |
+
+Finally, we format the result to fit the training format. Here we use the DGL training framework, so we construct a DGL Graph using the result data, and then return the DGL Graph.
+
+Once we provide the TuGraphSample class, we can use it for Mini-Batch training. Let the data loading part of DGL use the sampler instance of TuGraphSample as follows:
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+Use DGL for model training:
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+## 3. Full-Batch training
+Full-Batch training of GNNs (Graph Neural Networks) is a type of training that involves processing the entire training dataset at once. It is one of the simplest and most straightforward training methods for GNNs, where the entire graph is treated as a single instance. In full-batch training, the entire dataset is loaded into memory and the model is trained on the entire graph. This type of training is especially useful for small to medium-sized graphs, and is mainly used for static graphs that do not change over time.
+```python
+getdb. Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+The full graph are then fed into the training framework for training.
+Full code: learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..556c3c1fd0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,101 @@
+# Heterogeneous Graph
+
+> This document describes how to use heterogeneous graphs for training.
+
+## 1. Introduction to Heterogeneous Graph
+A heterogeneous graph is a graph structure composed of nodes and edges of different types. In a heterogeneous graph, nodes and edges can have diverse attributes and relationships, representing different entities and their complex associations.
+
+In a heterogeneous graph, node types can represent different entities such as users, products, topics, etc., while edge types represent the relationships between different entities, such as the follow relationship between users, or the purchase relationship between users and products. Nodes and edges can have different attributes.
+
+Heterogeneous graphs provide a powerful graph model that can better express and analyze real-world systems with multiple entity types and complex relationships. They have broad application prospects and research value in various fields of data analysis and applications.
+
+## 2. Creating a Heterogeneous Graph
+In TuGraph, a heterogeneous graph is composed of a series of edge relationships. Each relationship is defined by a triplet of strings: (source node type, edge type, target node type). The creation of a heterogeneous graph is similar to that of a homogeneous graph, but the triplet definition needs to be specified when creating the graph. The following example demonstrates:
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+In the code snippet above, the fourth parameter is the edge relationship definition of the heterogeneous graph. By specifying this parameter, you can select specific node and edge types for graph construction and training. If this parameter is not specified, all node and edge types will be used for graph construction by default.
+
+## 3. Heterogeneous graph query interface
+To facilitate user usage, TuGraph provides interfaces for querying node and edge types when the fourth parameter is given. The following examples demonstrate these interfaces:
+
+### 3.1 Querying Node Types
+```python
+olapondb.ntypes()
+```
+The return value is a list of node types, such as ['node1', 'node2', 'node3'].
+
+### 3.2 Querying Edge Types
+```python
+olapondb.etypes()
+``` 
+The return value is a list of edge types, such as ['edge1', 'edge2', 'edge3'].
+
+### 3.3 Querying Node and Edge Types
+```python
+olapondb.metagraph()
+```
+The return value is a list of string triplets (source node type, edge type, target node type), such as
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')].
+
+## 4 Heterogeneous graph output format
+The same as the homogeneous graph, the sampling data results of the heterogeneous graph are also stored in NodeInfo and EdgeInfo.
+Output data can be obtained in the following ways.
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+
+The result of its stored information is as follows:
+| Graph Data | Storage Location |
+| --- | --- |
+| Edge Source | EdgeInfo[0] |
+| Edge Destination | EdgeInfo[1] |
+| Edge Type | EdgeInfo[2] |
+| Vertex ID | NodeInfo[0] |
+| Vertex Feature | NodeInfo[1] |
+| Vertex Label | NodeInfo[2] |
+| Vertex Type | NodeInfo[3] |
+
+## 5. Training Heterogeneous Graphs
+The goal of training a heterogeneous graph is to learn the representation of nodes and edges in the graph for subsequent tasks such as node classification, link prediction, and graph clustering. To achieve this goal, researchers have proposed a variety of models based on graph neural networks (GNNs). These models update the representation of nodes by aggregating the information of neighboring nodes, thereby capturing the complex relationships in the graph structure.
+
+Since heterogeneous graphs contain nodes and edges of multiple types, it is necessary to consider how to process these different types of information when designing GNN models. One common approach is to design different aggregation functions to process different types of neighboring nodes. In addition, it is also necessary to consider how to integrate these different types of information together so that the model can effectively learn the representation of nodes and edges.
+
+TuGraph provides a method for training heterogeneous graphs using the ogbn-mag dataset, which can be used for reference.
+
+The official docker provided by TuGraph does not yet provide an environment for heterogeneous graph training, so users need to install relevant dependency packages by themselves.
+Before training, you need to download the ogb and pandas packages. The specific installation method is as follows:
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+The training code looks like this:
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    # print('load time', load_time - s, 'train_time', train_time - load_time)
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+The complete training code can be found in tugraph/learn/examples/train_full_mag.py.
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..fbc920ad54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+TuGraph Learn
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..f4d9296bec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+Stored Procedures And OLAP
+========================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/conf.py b/docs/docusaurus/versions/version-4.5.1/en-US/source/conf.py
new file mode 100644
index 0000000000..7712aee00e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#project-information
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.5.1/en-US/source/index.rst b/docs/docusaurus/versions/version-4.5.1/en-US/source/index.rst
new file mode 100644
index 0000000000..24b08fe10f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/en-US/source/index.rst
@@ -0,0 +1,23 @@
+TuGraph DB
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions/version-4.5.1/images/architecture-en.png b/docs/docusaurus/versions/version-4.5.1/images/architecture-en.png
new file mode 100644
index 0000000000..edf2bc873a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/architecture-en.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/architecture.png b/docs/docusaurus/versions/version-4.5.1/images/architecture.png
new file mode 100644
index 0000000000..e8eeea87e0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/architecture.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/account-add-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/account-add-button.png
new file mode 100644
index 0000000000..5b9c7e9378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/account-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/account-add.png b/docs/docusaurus/versions/version-4.5.1/images/browser/account-add.png
new file mode 100644
index 0000000000..b0b5068027
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/account-add.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/account-delete.png b/docs/docusaurus/versions/version-4.5.1/images/browser/account-delete.png
new file mode 100644
index 0000000000..bfe49fb093
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/account-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/account-disable.png b/docs/docusaurus/versions/version-4.5.1/images/browser/account-disable.png
new file mode 100644
index 0000000000..f8ff994f21
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/account-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/account-edit.png b/docs/docusaurus/versions/version-4.5.1/images/browser/account-edit.png
new file mode 100644
index 0000000000..939c374f25
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/account-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/account-enable.png b/docs/docusaurus/versions/version-4.5.1/images/browser/account-enable.png
new file mode 100644
index 0000000000..ddc8cef578
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/account-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/account.png b/docs/docusaurus/versions/version-4.5.1/images/browser/account.png
new file mode 100644
index 0000000000..0aa0cd195c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/account.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/db_basic.png b/docs/docusaurus/versions/version-4.5.1/images/browser/db_basic.png
new file mode 100644
index 0000000000..b9eb703478
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/db_basic.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/db_configuration.png b/docs/docusaurus/versions/version-4.5.1/images/browser/db_configuration.png
new file mode 100644
index 0000000000..96ec2085d8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/db_configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-button.png
new file mode 100644
index 0000000000..c06324ddbf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-center.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-center.png
new file mode 100644
index 0000000000..1057626aa5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-center.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-clear.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-clear.png
new file mode 100644
index 0000000000..9f133aaab5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-clear.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-collapse.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-collapse.png
new file mode 100644
index 0000000000..0295e60410
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-collapse.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-delete.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-delete.png
new file mode 100644
index 0000000000..fede307652
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand-after.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand-after.png
new file mode 100644
index 0000000000..371efb6e6b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand-after.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand-before.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand-before.png
new file mode 100644
index 0000000000..9647150b7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand-before.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand-custom.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand-custom.png
new file mode 100644
index 0000000000..bed0a73705
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand-custom.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand.png
new file mode 100644
index 0000000000..dec9d3d5a5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-expand.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-fixed.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-fixed.png
new file mode 100644
index 0000000000..aac4a18573
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-fixed.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-lasso.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-lasso.png
new file mode 100644
index 0000000000..53f743925b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-lasso.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-legend-chart.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-legend-chart.png
new file mode 100644
index 0000000000..a1d8b31a0c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-legend-chart.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-legend-list.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-legend-list.png
new file mode 100644
index 0000000000..b4634e61ef
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-legend-list.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-retrieval.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-retrieval.png
new file mode 100644
index 0000000000..52dbdd34b8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-retrieval.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-unfix.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-unfix.png
new file mode 100644
index 0000000000..80fa2c8b72
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-unfix.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-zoom.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-zoom.png
new file mode 100644
index 0000000000..04d19ad06f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-canvas-zoom.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-card.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-card.png
new file mode 100644
index 0000000000..be3cc15f09
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-card.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-operation-area.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-operation-area.png
new file mode 100644
index 0000000000..5400f95407
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-operation-area.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-attributefilter.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-attributefilter.png
new file mode 100644
index 0000000000..d45a0c18b7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-attributefilter.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-configurequery.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-configurequery.png
new file mode 100644
index 0000000000..dc659c45e8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-configurequery.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-query.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-query.png
new file mode 100644
index 0000000000..d8a532b1a8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-query.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png
new file mode 100644
index 0000000000..54cb78461d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-statisticalfilter.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-statisticalfilter.png
new file mode 100644
index 0000000000..3b4d4b1b2f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-queryfilter-statisticalfilter.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-appearance-Button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-appearance-Button.png
new file mode 100644
index 0000000000..dab00330b7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-appearance-Button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-appearance.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-appearance.png
new file mode 100644
index 0000000000..c96195d393
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-appearance.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-layout-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-layout-button.png
new file mode 100644
index 0000000000..633b3d4ecc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-layout-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-layout-parameters.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-layout-parameters.png
new file mode 100644
index 0000000000..3ce6033532
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-style-layout-parameters.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-tag.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-tag.png
new file mode 100644
index 0000000000..62d53f0749
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-tag.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-view-2D.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-view-2D.png
new file mode 100644
index 0000000000..80c3ce1b5a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-view-2D.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-view-json.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-view-json.png
new file mode 100644
index 0000000000..b329e8f034
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-view-json.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-view-list.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-view-list.png
new file mode 100644
index 0000000000..b4928a491f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphanalysis-view-list.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addedge-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addedge-button.png
new file mode 100644
index 0000000000..9e27358bcc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addedge-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addedge.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addedge.png
new file mode 100644
index 0000000000..39eca4a772
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addedge.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addvertex-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addvertex-button.png
new file mode 100644
index 0000000000..b304f36b1e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addvertex-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addvertex.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addvertex.png
new file mode 100644
index 0000000000..e65260e89d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-addvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-button.png
new file mode 100644
index 0000000000..83becf8158
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-dataimport.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-dataimport.png
new file mode 100644
index 0000000000..5fdcdbbdba
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-dataimport.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-editedge.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-editedge.png
new file mode 100644
index 0000000000..eb7206b771
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-editedge.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-editvertex.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-editvertex.png
new file mode 100644
index 0000000000..eb252761bf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-editvertex.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-exportmodel-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-exportmodel-button.png
new file mode 100644
index 0000000000..acbaa80189
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-exportmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-exportmodel.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-exportmodel.png
new file mode 100644
index 0000000000..4991dc7378
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-exportmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import-csv.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import-csv.png
new file mode 100644
index 0000000000..2301c01cfc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import-csv.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import-datamapping.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import-datamapping.png
new file mode 100644
index 0000000000..5d55861a95
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import-datamapping.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import-success.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import-success.png
new file mode 100644
index 0000000000..20a48beb0f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import-success.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import.png
new file mode 100644
index 0000000000..0154bac688
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-import.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-importmodel-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-importmodel-button.png
new file mode 100644
index 0000000000..bb7822aaef
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-importmodel-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-importmodel.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-importmodel.png
new file mode 100644
index 0000000000..e7ef251ec7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-importmodel.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-list-copy.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-list-copy.png
new file mode 100644
index 0000000000..ea210495fc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-list-copy.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-list-delete.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-list-delete.png
new file mode 100644
index 0000000000..aeba09b532
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-list-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-list-search.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-list-search.png
new file mode 100644
index 0000000000..9313c8eb7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-list-search.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-select.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-select.png
new file mode 100644
index 0000000000..18bfb3be74
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild-select.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild.png
new file mode 100644
index 0000000000..cd1f0bda1c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphbuild.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-configure.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-configure.png
new file mode 100644
index 0000000000..91fa18814f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-creategraph.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-creategraph.png
new file mode 100644
index 0000000000..9fcb254164
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-deletegraph-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-deletegraph-button.png
new file mode 100644
index 0000000000..25c0087071
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-deletegraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-editgraph-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-editgraph-button.png
new file mode 100644
index 0000000000..6313befd0c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-editgraph-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-editgraph.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-editgraph.png
new file mode 100644
index 0000000000..f6cc706f41
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-editgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-homepage.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-homepage.png
new file mode 100644
index 0000000000..24229ad6f5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-homepage.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-procedure-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-procedure-button.png
new file mode 100644
index 0000000000..bbadada211
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-procedure-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-procedure.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-procedure.png
new file mode 100644
index 0000000000..dcb428a9f9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-procedure.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-selecttemplate.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-selecttemplate.png
new file mode 100644
index 0000000000..8a19d8da39
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-selecttemplate.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-statistics-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-statistics-button.png
new file mode 100644
index 0000000000..21d5cf4175
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-statistics-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-statistics-refresh-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-statistics-refresh-button.png
new file mode 100644
index 0000000000..64a47c021e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-statistics-refresh-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-statistics.png b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-statistics.png
new file mode 100644
index 0000000000..8ef243df06
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/graphmanagement-statistics.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/login.png b/docs/docusaurus/versions/version-4.5.1/images/browser/login.png
new file mode 100644
index 0000000000..5c737f4dec
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/login.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/pathquery-configuration.png b/docs/docusaurus/versions/version-4.5.1/images/browser/pathquery-configuration.png
new file mode 100644
index 0000000000..579a7d99ee
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/pathquery-configuration.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/pathquery-result.png b/docs/docusaurus/versions/version-4.5.1/images/browser/pathquery-result.png
new file mode 100644
index 0000000000..0cd90cad46
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/pathquery-result.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/pathquery-select.png b/docs/docusaurus/versions/version-4.5.1/images/browser/pathquery-select.png
new file mode 100644
index 0000000000..3c5d0f7751
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/pathquery-select.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-bookmark-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-bookmark-button.png
new file mode 100644
index 0000000000..9a6f73bf7c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-bookmark-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-bookmark.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-bookmark.png
new file mode 100644
index 0000000000..a93315ab17
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-bookmark.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-button.png
new file mode 100644
index 0000000000..7a30d37317
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-download-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-download-button.png
new file mode 100644
index 0000000000..ec59f7a0ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-download-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-execute-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-execute-button.png
new file mode 100644
index 0000000000..6c38e68c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-execute-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-gqltips.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-gqltips.png
new file mode 100644
index 0000000000..9f173eed10
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-gqltips.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-download.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-download.png
new file mode 100644
index 0000000000..48890083fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-download.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-downloadtxt.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-downloadtxt.png
new file mode 100644
index 0000000000..3554ef592c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-downloadtxt.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-fullscreen-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-fullscreen-button.png
new file mode 100644
index 0000000000..13925db74f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-fullscreen-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-fullscreen-close.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-fullscreen-close.png
new file mode 100644
index 0000000000..2a63926742
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-fullscreen-close.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-fullscreen.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-fullscreen.png
new file mode 100644
index 0000000000..391c3c3cc5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-fullscreen.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-graph.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-graph.png
new file mode 100644
index 0000000000..7754a8d46a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-insert-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-insert-button.png
new file mode 100644
index 0000000000..8879b2c4bb
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-insert-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-insert.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-insert.png
new file mode 100644
index 0000000000..2cd23b6e84
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-insert.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-jsontxt.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-jsontxt.png
new file mode 100644
index 0000000000..5f265cfff1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-jsontxt.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-jsonview.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-jsonview.png
new file mode 100644
index 0000000000..8a774f91c9
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-jsonview.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-list.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-list.png
new file mode 100644
index 0000000000..4692c49eca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-list.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-txt.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-txt.png
new file mode 100644
index 0000000000..9a30a2737f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-result-txt.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-schema-graph.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-schema-graph.png
new file mode 100644
index 0000000000..ccc9e3126b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-schema-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-schema-list.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-schema-list.png
new file mode 100644
index 0000000000..3649b41272
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-schema-list.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-selectgql.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-selectgql.png
new file mode 100644
index 0000000000..1ea624b81f
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-selectgql.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-selectgraph.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-selectgraph.png
new file mode 100644
index 0000000000..6dc14e486d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-selectgraph.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/query-view.png b/docs/docusaurus/versions/version-4.5.1/images/browser/query-view.png
new file mode 100644
index 0000000000..bc1dff02b0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/query-view.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-configure.png b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-configure.png
new file mode 100644
index 0000000000..166e54cb75
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-configure.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-creategraph.png b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-creategraph.png
new file mode 100644
index 0000000000..4343dd4c9a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-creategraph.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-graphtab.png b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-graphtab.png
new file mode 100644
index 0000000000..9d12211729
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-graphtab.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-result.png b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-result.png
new file mode 100644
index 0000000000..e21e4595b3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-result.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-selectdemo.png b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-selectdemo.png
new file mode 100644
index 0000000000..7dda3f06b0
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/quickstart-selectdemo.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/role-add-button.png b/docs/docusaurus/versions/version-4.5.1/images/browser/role-add-button.png
new file mode 100644
index 0000000000..a4590ac431
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/role-add-button.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/role-add.png b/docs/docusaurus/versions/version-4.5.1/images/browser/role-add.png
new file mode 100644
index 0000000000..8f56b24bd7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/role-add.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/role-delete.png b/docs/docusaurus/versions/version-4.5.1/images/browser/role-delete.png
new file mode 100644
index 0000000000..3c09e7caa8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/role-delete.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/role-disable.png b/docs/docusaurus/versions/version-4.5.1/images/browser/role-disable.png
new file mode 100644
index 0000000000..eb2e355d58
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/role-disable.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/role-edit.png b/docs/docusaurus/versions/version-4.5.1/images/browser/role-edit.png
new file mode 100644
index 0000000000..7b5db6e48c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/role-edit.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/role-enable.png b/docs/docusaurus/versions/version-4.5.1/images/browser/role-enable.png
new file mode 100644
index 0000000000..40b7909289
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/role-enable.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/vertexquery-criteria.png b/docs/docusaurus/versions/version-4.5.1/images/browser/vertexquery-criteria.png
new file mode 100644
index 0000000000..b5f95c3d83
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/vertexquery-criteria.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/browser/vertexquery.png b/docs/docusaurus/versions/version-4.5.1/images/browser/vertexquery.png
new file mode 100644
index 0000000000..95d9870971
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/browser/vertexquery.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-1.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-1.png
new file mode 100644
index 0000000000..c7202ff3de
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-1.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-10.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-10.png
new file mode 100644
index 0000000000..d6ed55c8bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-10.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-2.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-2.png
new file mode 100644
index 0000000000..6fc79fde54
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-2.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-3.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-3.png
new file mode 100644
index 0000000000..0e59f028c7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-3.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-4.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-4.png
new file mode 100644
index 0000000000..b606ec8bb8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-4.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-5.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-5.png
new file mode 100644
index 0000000000..18d5845ec1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-5.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-6.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-6.png
new file mode 100644
index 0000000000..d939108e3b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-6.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-7.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-7.png
new file mode 100644
index 0000000000..5c5d1800af
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-7.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-8.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-8.png
new file mode 100644
index 0000000000..5beb0628b3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-8.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-9.png b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-9.png
new file mode 100644
index 0000000000..d04282d95a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/cloud-deployment-9.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/contact-en.png b/docs/docusaurus/versions/version-4.5.1/images/contact-en.png
new file mode 100644
index 0000000000..47ac8b8297
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/contact-en.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/contact-zh.png b/docs/docusaurus/versions/version-4.5.1/images/contact-zh.png
new file mode 100644
index 0000000000..75c49540b5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/contact-zh.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/htap-en.png b/docs/docusaurus/versions/version-4.5.1/images/htap-en.png
new file mode 100644
index 0000000000..85479ac1e1
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/htap-en.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/htap.png b/docs/docusaurus/versions/version-4.5.1/images/htap.png
new file mode 100644
index 0000000000..c7764a3fa7
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/htap.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/learn_flow_chart_en.png b/docs/docusaurus/versions/version-4.5.1/images/learn_flow_chart_en.png
new file mode 100644
index 0000000000..c9e55a52a5
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/learn_flow_chart_en.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/learn_flow_chart_zh.png b/docs/docusaurus/versions/version-4.5.1/images/learn_flow_chart_zh.png
new file mode 100644
index 0000000000..9977dcfb6c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/learn_flow_chart_zh.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/multi-level-Interfaces-en.png b/docs/docusaurus/versions/version-4.5.1/images/multi-level-Interfaces-en.png
new file mode 100644
index 0000000000..b7de07422c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/multi-level-Interfaces-en.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/multi-level-Interfaces.png b/docs/docusaurus/versions/version-4.5.1/images/multi-level-Interfaces.png
new file mode 100644
index 0000000000..2c9694a476
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/multi-level-Interfaces.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/partners/fu.png b/docs/docusaurus/versions/version-4.5.1/images/partners/fu.png
new file mode 100644
index 0000000000..a238d3a5ce
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/partners/fu.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/partners/hust.png b/docs/docusaurus/versions/version-4.5.1/images/partners/hust.png
new file mode 100644
index 0000000000..e1219f932b
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/partners/hust.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/partners/oceanbase.png b/docs/docusaurus/versions/version-4.5.1/images/partners/oceanbase.png
new file mode 100755
index 0000000000..978297d9bc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/partners/oceanbase.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/partners/secretflow.png b/docs/docusaurus/versions/version-4.5.1/images/partners/secretflow.png
new file mode 100644
index 0000000000..d386ce72fe
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/partners/secretflow.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/partners/whaleops.png b/docs/docusaurus/versions/version-4.5.1/images/partners/whaleops.png
new file mode 100644
index 0000000000..7ace477cf4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/partners/whaleops.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/partners/zju.png b/docs/docusaurus/versions/version-4.5.1/images/partners/zju.png
new file mode 100644
index 0000000000..704f0bb867
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/partners/zju.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/round-the-world/flight_page.jpg b/docs/docusaurus/versions/version-4.5.1/images/round-the-world/flight_page.jpg
new file mode 100644
index 0000000000..bd296766c3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/round-the-world/flight_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/round-the-world/main_page.jpg b/docs/docusaurus/versions/version-4.5.1/images/round-the-world/main_page.jpg
new file mode 100644
index 0000000000..2edc617c62
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/round-the-world/main_page.jpg differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/round-the-world/search_example.jpg b/docs/docusaurus/versions/version-4.5.1/images/round-the-world/search_example.jpg
new file mode 100644
index 0000000000..154d387721
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/round-the-world/search_example.jpg differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/spatail/EPSG_4326.png b/docs/docusaurus/versions/version-4.5.1/images/spatail/EPSG_4326.png
new file mode 100644
index 0000000000..fa614811a4
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/spatail/EPSG_4326.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/spatail/EPSG_7203.png b/docs/docusaurus/versions/version-4.5.1/images/spatail/EPSG_7203.png
new file mode 100644
index 0000000000..9fd0c427ea
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/spatail/EPSG_7203.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/spatail/WKB.png b/docs/docusaurus/versions/version-4.5.1/images/spatail/WKB.png
new file mode 100644
index 0000000000..f68bf49a39
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/spatail/WKB.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/spatail/createFoodData.png b/docs/docusaurus/versions/version-4.5.1/images/spatail/createFoodData.png
new file mode 100644
index 0000000000..7240556dd8
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/spatail/createFoodData.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/spatail/createLineTestData.png b/docs/docusaurus/versions/version-4.5.1/images/spatail/createLineTestData.png
new file mode 100644
index 0000000000..0f9d73e09c
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/spatail/createLineTestData.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/spatail/createVertexLabel.png b/docs/docusaurus/versions/version-4.5.1/images/spatail/createVertexLabel.png
new file mode 100644
index 0000000000..83f855c460
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/spatail/createVertexLabel.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/spatail/createVertexLabel_PolygonTest.png b/docs/docusaurus/versions/version-4.5.1/images/spatail/createVertexLabel_PolygonTest.png
new file mode 100644
index 0000000000..d22ff426c2
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/spatail/createVertexLabel_PolygonTest.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/spatail/createVertexLabel_lineTest.png b/docs/docusaurus/versions/version-4.5.1/images/spatail/createVertexLabel_lineTest.png
new file mode 100644
index 0000000000..0138cade8a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/spatail/createVertexLabel_lineTest.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/spatail/querryFood.png b/docs/docusaurus/versions/version-4.5.1/images/spatail/querryFood.png
new file mode 100644
index 0000000000..aab7646564
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/spatail/querryFood.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-body-cypher1.png b/docs/docusaurus/versions/version-4.5.1/images/three-body-cypher1.png
new file mode 100644
index 0000000000..3f85fd8412
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-body-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-body-cypher2.png b/docs/docusaurus/versions/version-4.5.1/images/three-body-cypher2.png
new file mode 100644
index 0000000000..41f0f914cc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-body-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-body-cypher3.png b/docs/docusaurus/versions/version-4.5.1/images/three-body-cypher3.png
new file mode 100644
index 0000000000..4776f26d77
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-body-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-body-data.png b/docs/docusaurus/versions/version-4.5.1/images/three-body-data.png
new file mode 100644
index 0000000000..1913b39cbc
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-body-data.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher1.png b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher1.png
new file mode 100644
index 0000000000..4b5745b96d
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher1.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher2.png b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher2.png
new file mode 100644
index 0000000000..fef4592cf3
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher2.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher3.png b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher3.png
new file mode 100644
index 0000000000..c0790d5d7e
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher3.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher4.png b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher4.png
new file mode 100644
index 0000000000..49a6498d4a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher4.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher5.png b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher5.png
new file mode 100644
index 0000000000..5d3cc55cdf
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-cypher5.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-schema.png b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-schema.png
new file mode 100644
index 0000000000..24aebca93a
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/three-kingdoms-schema.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/tugraph-datax.png b/docs/docusaurus/versions/version-4.5.1/images/tugraph-datax.png
new file mode 100644
index 0000000000..c2968c0c38
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/tugraph-datax.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/wandering-earth-1.png b/docs/docusaurus/versions/version-4.5.1/images/wandering-earth-1.png
new file mode 100644
index 0000000000..955c565303
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/wandering-earth-1.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/wandering-earth-2.png b/docs/docusaurus/versions/version-4.5.1/images/wandering-earth-2.png
new file mode 100644
index 0000000000..9cb17764ed
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/wandering-earth-2.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/wandering-earth-3.png b/docs/docusaurus/versions/version-4.5.1/images/wandering-earth-3.png
new file mode 100644
index 0000000000..c6dabbec97
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/wandering-earth-3.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/what-is-graph-en.png b/docs/docusaurus/versions/version-4.5.1/images/what-is-graph-en.png
new file mode 100644
index 0000000000..53d5ba05ca
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/what-is-graph-en.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/images/what-is-graph.png b/docs/docusaurus/versions/version-4.5.1/images/what-is-graph.png
new file mode 100644
index 0000000000..6f3aa196fa
Binary files /dev/null and b/docs/docusaurus/versions/version-4.5.1/images/what-is-graph.png differ
diff --git a/docs/docusaurus/versions/version-4.5.1/requirements.txt b/docs/docusaurus/versions/version-4.5.1/requirements.txt
new file mode 100644
index 0000000000..0201af0943
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/requirements.txt
@@ -0,0 +1,5 @@
+sphinx
+myst-parser
+sphinx-panels
+sphinx-rtd-theme
+breathe
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/.readthedocs.yaml b/docs/docusaurus/versions/version-4.5.1/zh-CN/.readthedocs.yaml
new file mode 100644
index 0000000000..5b91d3cd6c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/.readthedocs.yaml
@@ -0,0 +1,30 @@
+# .readthedocs.yaml
+# Read the Docs configuration file
+# See https://docs.readthedocs.io/en/stable/config-file/v2.html for details
+
+# Required
+version: 2
+
+# Set the version of Python and other tools you might need
+build:
+  os: ubuntu-20.04
+  tools:
+    python: "3.6"
+    # You can also specify other tool versions:
+    # nodejs: "19"
+    # rust: "1.64"
+    # golang: "1.19"
+
+# Build documentation in the docs/ directory with Sphinx
+sphinx:
+    builder: html
+    configuration: docs/zh-CN/source/conf.py
+
+# If using Sphinx, optionally build your docs in additional formats such as PDF
+# formats:
+#    - pdf
+
+# Optionally declare the Python requirements required to build your docs
+python:
+   install:
+   - requirements: docs/requirements.txt
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/Makefile b/docs/docusaurus/versions/version-4.5.1/zh-CN/Makefile
new file mode 100644
index 0000000000..d0c3cbf102
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/Makefile
@@ -0,0 +1,20 @@
+# Minimal makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line, and also
+# from the environment for the first two.
+SPHINXOPTS    ?=
+SPHINXBUILD   ?= sphinx-build
+SOURCEDIR     = source
+BUILDDIR      = build
+
+# Put it first so that "make" without argument is like "make help".
+help:
+	@$(SPHINXBUILD) -M help "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
+
+.PHONY: help Makefile
+
+# Catch-all target: route all unknown targets to Sphinx using the new
+# "make mode" option.  $(O) is meant as a shortcut for $(SPHINXOPTS).
+%: Makefile
+	@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/make.bat b/docs/docusaurus/versions/version-4.5.1/zh-CN/make.bat
new file mode 100644
index 0000000000..ef1658545e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/make.bat
@@ -0,0 +1,36 @@
+@ECHO OFF
+
+pushd %~dp0
+
+REM Command file for Sphinx documentation
+
+if "%SPHINXBUILD%" == "" (
+	set SPHINXBUILD=sphinx-build
+)
+set SOURCEDIR=source
+set BUILDDIR=build
+set SPHINXOPTS=-W
+
+%SPHINXBUILD% >NUL 2>NUL
+if errorlevel 9009 (
+	echo.
+	echo.The 'sphinx-build' command was not found. Make sure you have Sphinx
+	echo.installed, then set the SPHINXBUILD environment variable to point
+	echo.to the full path of the 'sphinx-build' executable. Alternatively you
+	echo.may add the Sphinx directory to PATH.
+	echo.
+	echo.If you don't have Sphinx installed, grab it from
+	echo.https://www.sphinx-doc.org/
+	exit /b 1
+)
+
+if "%1" == "" goto help
+
+%SPHINXBUILD% -M %1 %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+goto end
+
+:help
+%SPHINXBUILD% -M help %SOURCEDIR% %BUILDDIR% %SPHINXOPTS% %O%
+
+:end
+popd
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/1.guide.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/1.guide.md
new file mode 100644
index 0000000000..f4cd33bf78
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/1.guide.md
@@ -0,0 +1,66 @@
+# 文档地图
+
+> 这里是文档地图，帮助用户快速学习和使用TuGraph社区版。
+
+## 快速上手
+
+> 可以先了解[什么是图](./2.introduction/1.what-is-graph.md)、图[可以做什么](./2.introduction/8.scenarios.md)、以及[什么是TuGraph](./2.introduction/3.what-is-tugraph.md)。
+
+> 基于[阿里云计算巢](5.installation&running/5.cloud-deployment.md)或[Docker方式](5.installation&running/3.docker-deployment.md)快速部署TuGraph。
+
+> 通过产品内置的场景上手体验：[电影](./3.quick-start/2.demo/1.movie.md)、[流浪地球](./3.quick-start/2.demo/2.wandering-earth.md)、[三体](./3.quick-start/2.demo/3.the-three-body.md)、[三国](./3.quick-start/2.demo/4.three-kingdoms.md)。
+
+> 可视化操作手册看这里：[可视化操作手册](./4.user-guide/1.tugraph-browser.md)、[可视化操作手册（旧版）](./4.user-guide/2.tugraph-browser-legacy.md)。
+
+## 开发指南
+
+> 通过客户端访问TuGraph：[Bolt Client](7.client-tools/5.bolt-client.md)
+
+> 查询语言、语句创建图模型看这里：[Cypher API](8.query/1.cypher.md).
+
+> 存储过程和算法介绍看这里：[Procedure API (POG API)](9.olap&procedure/1.procedure/1.procedure.md)、[OLAP API](9.olap&procedure/2.olap/1.tutorial.md)。
+
+> C++/Python开发存储过程接口看这里：[C++/Python Procedure API](9.olap&procedure/1.procedure/index.rst)。
+
+## 参与社区贡献
+
+> 在开始贡献前，可以先了解[如何贡献](12.contributor-manual/1.contributing.md)
+
+> 如果想了解社区角色的划分，请访问[社区角色](12.contributor-manual/2.community-roles.md)
+
+## 主要仓库
+
+> TuGraph-DB 仓库: [https://github.com/TuGraph-family/tugraph-db](https://github.com/TuGraph-family/tugraph-db)
+
+> 可视化界面: [https://github.com/TuGraph-family/tugraph-db-browser](https://github.com/TuGraph-family/tugraph-db-browser)
+
+> 基于twitter数据的简单测试方法: [https://github.com/TuGraph-family/gdbms-microbenchmark](https://github.com/TuGraph-family/gdbms-microbenchmark)
+
+> 基于标准LDBC-SNB的测试方法: [https://github.com/TuGraph-family/tugraph-snb-interactive](https://github.com/TuGraph-family/tugraph-snb-interactive)
+
+> TuGraph-Analytics 仓库: [https://github.com/TuGraph-family/tugraph-analytics](https://github.com/TuGraph-family/tugraph-analytics)
+
+## 视频中心
+
+> [TuGraph快速上手](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=2593741)
+
+> [TuGraph技术分享集合](https://space.bilibili.com/1196053065/channel/seriesdetail?sid=3009777)
+
+> [3分钟读懂图计算](https://www.bilibili.com/video/BV15U4y1r7AW/)
+
+## TuGraph最新版本
+
+| 描述                  | 文件                                    | 链接                                                                                                                                                                                             |
+|---------------------|---------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| CentOS7 安装包         | tugraph-4.5.1-1.el7.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.5.1/tugraph-4.5.1-1.el7.x86_64.rpm)                                                                                     |
+| CentOS8 安装包         | tugraph-4.5.1-1.el8.x86_64.rpm        | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.5.1/tugraph-4.5.1-1.el8.x86_64.rpm)                                                                                     |
+| Ubuntu18.04 安装包     | tugraph-4.5.1-1.x86_64.deb            | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.5.1/tugraph-4.5.1-1.x86_64.deb)                                                                                         |
+| CentOS7 预安装镜像       | tugraph-runtime-centos7-4.5.1.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-4.5.1/tugraph-runtime-centos7-4.5.1.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-runtime-centos7)                  |
+| CentOS7 编译镜像        | tugraph-compile-centos7-1.3.4.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos7-1.3.4.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos7)         |
+| CentOS8 编译镜像        | tugraph-compile-centos8-1.3.4.tar     | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-centos8-1.3.4.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-centos8)         |
+| Ubuntu18.04 编译镜像    | tugraph-compile-ubuntu18.04-1.3.4.tar | [下载](https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/tugraph-docker-compile/tugraph-compile-ubuntu18.04-1.3.4.tar) 、[访问](https://hub.docker.com/r/tugraph/tugraph-compile-ubuntu18.04) |
+
+
+版本更新日志见：[链接](https://github.com/TuGraph-family/tugraph-db/blob/master/release/CHANGELOG_CN.md )。
+
+如果您不清楚使用安装包和镜像，请参考 [环境和版本选择](13.best-practices/4.selection.md)。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/1.privilege.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/1.privilege.md
new file mode 100644
index 0000000000..bb808b54b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/1.privilege.md
@@ -0,0 +1,138 @@
+# 用户权限
+
+## 1.介绍
+
+> TuGraph 的权限是基于角色的访问控制进行管理，定义访问控制的权限分配给角色，角色再分配给用户。
+
+## 2.权限层级
+
+- Global 层：即全局权限，对管理、图操作均有权限；
+- Graph 层：即图级别，对每个图的权限；
+- （仅商业化版本支持）Property 层：即属性级别，对某个属性的权限控制
+
+## 3.权限关键字
+
+目前权限的控制较为简洁
+
+- Global 层目前为 admin 权限，并且预置了 admin 用户；
+
+* Graph 层的操作权限分为四种：none，read，write，full
+  - none：无权限，对于图没有任何操作权限
+  - read：只读权限，对于图只具备读取权限
+  - write：读写权限，对于图不仅具备读取权限，还具备了写入的权限
+  - full：所有权限，对于图不仅具备读写权限，同时也具备删除图、修改图、修改 Schema 等权限
+* （仅商业化版本支持）Property 层的权限分别为：none，read，write
+  - none：无权限，对于该属性没有任何操作权限
+  - read：只读权限，对于该属性只具备读取权限
+  - write：读写权限，对于该属性不仅具备读取权限，还具备了写入的权限
+
+## 4.常用权限操作
+
+### 4.1.用户操作
+
+- 创建用户
+
+```cypher
+CALL dbms.security.createUser(user_name::STRING,password::STRING)
+```
+
+- 删除用户
+
+```cypher
+CALL dbms.security.deleteUser(user_name::STRING)
+```
+
+- 修改当前用户密码
+
+```cypher
+CALL dbms.security.changePassword(current_password::STRING,new_password::STRING)
+```
+
+- 修改指定用户密码
+
+```cypher
+
+CALL dbms.security.changeUserPassword(user_name::STRING,new_password::STRING)
+```
+
+- 禁用/启用用户
+
+```cypher
+CALL dbms.security.disableUser(user::STRING,disable::BOOLEAN)
+```
+
+- 列出所有用户
+
+```cypher
+CALL dbms.security.listUsers()
+```
+
+- 列出当前用户信息
+
+```cypher
+CALL dbms.security.showCurrentUser()
+```
+
+- 获取用户详情
+
+```cypher
+CALL dbms.security.getUserInfo(user::STRING)
+```
+
+### 4.2.角色操作
+
+- 创建角色
+
+```cypher
+CALL dbms.security.createRole(role_name::STRING,desc::STRING)
+```
+
+- 删除角色
+
+```cypher
+CALL dbms.security.deleteRole(role_name::STRING
+```
+
+- 列出所有角色
+
+```cypher
+CALL dbms.security.listRoles()
+```
+
+- 禁用/启用角色
+
+```cypher
+CALL dbms.security.disableRole(role::STRING,disable::BOOLEAN)
+```
+
+### 4.3.赋予用户角色
+
+- 新增用户与角色的联系
+
+```cypher
+CALL dbms.security.addUserRoles(user::STRING,roles::LIST)
+```
+
+- 删除用户与角色的联系
+
+CALL dbms.security.deleteUserRoles(user::STRING,roles::LIST)
+
+- 清空用户角色的关系并重建
+
+```cypher
+CALL dbms.security.rebuildUserRoles(user::STRING,roles::LIST)
+```
+
+### 4.4.角色赋权
+
+- 修改角色对指定图的访问权限
+
+```cypher
+CALL dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP)
+```
+
+示例
+
+```cypher
+CALL dbms.security.modRoleAccessLevel("test_role", {test_graph1:"FULL", test_graph2:"NONE"})
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/2.token.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/2.token.md
new file mode 100644
index 0000000000..02e265cf23
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/2.token.md
@@ -0,0 +1,50 @@
+# Token使用说明
+
+## 1.Token介绍
+JWT（JSON Web Token）是一种用于认证和授权的开放标准。它基于JSON（JavaScript Object Notation）格式，并被设计用于在网络应用之间安全地传输声明（claims）信息。
+
+JWT由三部分组成：头部（Header）、负载（Payload）和签名（Signature）。头部包含了JWT的类型以及所使用的签名算法，负载包含了需要传输的信息，而签名用于验证JWT的完整性和真实性。
+
+在TuGraph中，JWT用于实现无状态的认证和授权机制。当用户登录成功后，服务端会生成一个JWT并将其返回给客户端。客户端在后续的请求中将这个JWT作为身份凭证传递给服务端。服务端收到JWT后，通过验证签名和解析负载中的信息，判断用户的身份和权限，并决定是否允许该请求的执行。
+
+## 2. Token有效期
+
+### 2.1. 浏览器Token交互逻辑
+1. 用户打开浏览器，输入账号密码，并点击登录。
+2. 前端调用登录接口，向后端输入账号和密码。
+3. 后端接收到账号密码后，进行校验，校验成功后，返回Token。
+4. 前端将Token存储在浏览器缓存中，后续请求都要携带此Token。
+5. 如果前端，主动点击登出和关闭页面，前端应主动调用登出接口，向后端传递Token。
+6. 后端接收后，将Token失效，返回状态码200，以及“等出成功”。前端接收到信息后，清空浏览器内存中的Token，并将页面退至登录页。
+7. Token失效（初始设置为24小时），需要用户重新登录。
+
+### 2.3. Token有效期刷新机制
+
+Token有效期存在刷新机制，默认关闭。如果打开后，Token的安全性会更高，实现上则存在两个时间戳。
+
+第一个时间戳`refresh_time`用于判定Token是否过期（默认24小时）：过期后可以调用刷新接口获取新的Token，可以设置为更短的时间，比如1小时。
+
+第二个时间戳`expire_time`为强制过期时间戳（默认24小时）：过期后必须重新登陆。
+
+### 2.4. Token有效期修改
+为了方便开发者自行开发，TuGraph提供了两种方式修改有效期，均需要admin权限。
+
+* 通过接口调用设置。涉及有效期修改的接口`update_token_time`和有效期查询接口`get_token_time`。
+具体可查询[REST接口文档](../7.client-tools/9.restful-api-legacy.md)。
+
+* 通过启动参数设置。server端启动时，添加参数`-unlimited_token 1` 参数可以设置为无期限。可参考[服务运行文档](../5.installation&running/7.tugraph-running.md)。
+
+## 3. 客户端发送Token相关请求介绍
+
+客户端会两种协议处理相关请求，一种是REST，一种是RPC。
+
+### 3.1. REST
+如果客户端使用REST协议（包括Browser浏览器），由于是短链接，在每一次请求中都需要携带Token，过期后需要获取新的Token。
+
+对于自行开发的客户端，若采用REST协议则需要考虑Token的逻辑。
+
+### 3.2. RPC
+如果客户端使用RPC协议（包括官方的C++/Java/Python），使用长连接保持，登陆后不涉及Token操作。
+
+## 4. Token上限
+Token上限是指一个用户最多可以同时拥有的Token数量。为防止无限登陆，Token上限默认为10000。由于Token生成逻辑和时间强相关，每登录一次会生成一个Token进行存储，Token有效期默认为24小时，因此建议登录后不使用的Token及时登出。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/3.reset_admin_password.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/3.reset_admin_password.md
new file mode 100644
index 0000000000..4e982696cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/3.reset_admin_password.md
@@ -0,0 +1,32 @@
+# 忘记'admin'密码
+> TuGraph 提供了重置密码的功能，当用户忘记管理者账号`admin`密码时，可以通过重置密码的方式来修改密码。
+
+## 1.重置密码
+首先，需要停止TuGraph服务端。如果是容器内部署，需要进入容器中执行如下命令：
+
+```bash
+lgraph_server -c /usr/local/etc/lgraph.json -d stop
+```
+
+再次启动TuGraph服务端时，需要添加如下参数：
+
+```bash
+--reset_admin_password 1
+```
+
+如下所示：
+```bash
+lgraph_server -c /usr/local/etc/lgraph.json --reset_admin_password 1 --log_dir ""
+```
+
+这一操作可以使得TuGraph服务端在启动时，重置管理者`admin`的密码为默认密码：`73@TuGraph`。
+密码重置成功会给出相关信息“Reset admin password successfully”并关闭当前服务端进程。
+
+## 2.重启服务
+
+用户需要以正常模式重新启动服务端，然后使用默认账号密码进行登录，登录后重新设置密码即可正常使用。
+重新启动TuGraph服务的命令如下：
+
+```bash
+lgraph_server -c /usr/local/etc/lgraph.json -d start
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/4.monitoring.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/4.monitoring.md
new file mode 100644
index 0000000000..b79cc13cc6
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/4.monitoring.md
@@ -0,0 +1,1020 @@
+# 运维监控
+
+> 此文档主要介绍 TuGraph 的可视化运维监控
+
+## 1.设计思路
+
+可视化监控并不是TuGraph自身不可或缺的一部分，因此在设计时将可视化监控作为TuGraph周边生态中的一个应用，来减少和TuGraph数据库的耦合度，以及对于TuGraph自身的影响。TuGraph可视化监控采用目前最火热的开源解决方案，TuGraph Monitor + Prometheus + Grafana来实现。其中TuGraph Monitor作为TuGraph服务的客户端，通过TCP链接向TuGraph服务发起Procedure请求，TuGraph服务在接收到请求后收集自身所在机器的cpu，memory，disk，io，以及请求数量等指标的统计结果进行响应。TuGraph Monitor在接收到TuGraph响应的指标数据后，将数据包装成prometheus需要的格式，保存在内存中，等待Prometheus服务通过http请求获取。Prometheus服务会定期通过http请求从TuGraph Monitor获取封装好的请求数据，按照获取的时间保存在自己的时序数据库中。Grafana可以根据用户的配置，从Prometheus处获取某个时间段内的统计数据，并在web界面上绘制浅显易懂的图形来展示最终结果。整个请求链路中，都采用了主动获取，即PULL的模型，好处之一是它能最大限度的避免数据生产者和数据消费者之间的耦合度，使得开发更简单，好处之二是数据生产者不需要考虑数据消费者的数据处理能力，即使某个消费者的数据处理能力较弱，也不会因为生产者生产数据过快而压垮消费者。主动拉取模型的不足之处在于数据的实时性不够，但在这个场景中，数据并没有很高的实时性要求。
+
+### 1.1.TuGraph
+
+TuGraph数据库提供了收集服务所在机器中磁盘，内存，网络IO，以及查询请求等多种数据信息的能力，并通过标准Procedure方式提供查询。收集数据这一动作仅在有用户通过接口查询时才会发生，避免了在用户不需要TuGraph监控服务所在机器的指标时对用户业务查询请求带来的影响。
+
+### 1.2.TuGraph Monitor
+
+TuGraph Monitor是TuGraph周边生态中的一个工具，它作为TuGraph众多用户中的一个，通过C++ RPC Client与TuGraph进行通信，通过Procedure查询接口来查询TuGraph服务所在机器的性能指标，并将TuGraph返回的结果包装成Prometheus需要的数据模型，等待Prometheus获取。用户可以通过设置查询时间间隔来保证获取监控指标对于业务查询的影响最小化。
+
+### 1.3.Prometheus
+
+Prometheus是一个开源的监控平台，并配备有专属的时序数据库，它会定期通过http请求从TuGraph Monitor服务获取统计指标，并保存在自己的时序数据库中。详细信息请参考官网: [https://prometheus.io/docs/introduction/first_steps](https://prometheus.io/docs/introduction/first_steps)
+
+### 1.4.Grafana
+
+Grafana是一个开源的可视化和分析软件，它可以从包含Prometheus在内的多个数据源中获取数据，并且可以将时序数据库中的数据转换为精美图形和可视化效果的工具。具体信息请参考官网: [https://grafana.com/docs/grafana/v7.5/getting-started/](https://grafana.com/docs/grafana/v7.5/getting-started/)
+
+## 2.部署方案
+
+### 2.1.第一步
+
+启动TuGraph服务，详细方法请参考文档: [https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md](https://github.com/TuGraph-db/tugraph-db/blob/master/doc/zh-CN/1.guide/3.quick-start.md)
+
+### 2.2.第二步
+
+启动TuGraph Monitor工具，启动命令如下：
+
+```shell
+./lgraph_monitor --server_host 127.0.0.1:9091 -u admin -p your_password \
+			--monitor_host 127.0.0.1:9999  --sampling_interval_ms 1000
+```
+
+参数含义如下
+
+```shell
+Available command line options:
+    --server_host       Host on which the tugraph rpc server runs.
+                        Default=127.0.0.1:9091.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    --monitor_host      Host on which the monitor restful server runs.
+                        Default=127.0.0.1:9999.
+    --sampling_interval_ms
+                        sampling interval in millisecond. Default=1.5e2.
+    -h, --help          Print this help message. Default=0.
+```
+
+### 2.3.第三步
+
++ 下载符合您机器架构以及系统版本的Prometheus tar包，下载地址: [https://prometheus.io/download/](https://prometheus.io/download/)
+
++ 解压tar包，命令如下
+
+```shell
+tar -zxvf prometheus-2.37.5.linux-amd64.tar.gz
+```
+
++ 修改配置文件prometheus.yml，新增如下配置，使其可以抓取TuGraph Monitor包装好的性能数据
+
+```yaml
+scrape_configs:
+  # The job name is added as a label `job=<job_name>` to any timeseries scraped from this config.
+  - job_name: "tugraph"
+
+    # metrics_path defaults to '/metrics'
+    # scheme defaults to 'http'.
+
+    static_configs:
+      - targets: ["localhost:9111"]
+```
+
++ 启动prometheus，具体的启动参数可以通过如下命令获取
+
+```shell
+./prometheus -h
+```
+
++ 验证prometheus服务是否正常，可以通过web端登陆prometheus服务，查询监控指标resources_report是否已经获取到，能成功查询到数据则正确
+
+### 2.4.第四步
+
++ 下载符合您机器架构以及系统版本的Grafana安装包，下载地址: [https://grafana.com/grafana/download](https://grafana.com/grafana/download)
+
++ 安装Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 启动Grafana，细节请参考: [ https://grafana.com/docs/grafana/v7.5/installation/]( https://grafana.com/docs/grafana/v7.5/installation/)
+
++ 配置Grafana，首先在数据源设置中配置Prometheus的IP地址，配置完成后可以通过测试连接功能，验证是否成功连接数据源。然后，导入如下模版，并在页面中根据实际情况，修改正确的接口IP和端口。最后可以根据实际情况设置刷新时间和监控时间范围
+
+```json
+{
+  "annotations": {
+    "list": [
+      {
+        "builtIn": 1,
+        "datasource": {
+          "type": "grafana"
+        },
+        "enable": true,
+        "hide": true,
+        "iconColor": "rgba(0, 211, 255, 1)",
+        "name": "Annotations & Alerts",
+        "target": {
+          "limit": 100,
+          "matchAny": false,
+          "tags": [],
+          "type": "dashboard"
+        },
+        "type": "dashboard"
+      }
+    ]
+  },
+  "editable": true,
+  "fiscalYearStartMonth": 0,
+  "graphTooltip": 0,
+  "id": 2,
+  "links": [],
+  "liveNow": false,
+  "panels": [
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "kbytes"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D {__name__=\"resources_report\", instance=\"localhost:7010\", job=\"TuGraph\", resouces_type=\"memory\", type=\"available\"}"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              },
+              {
+                "id": "displayName",
+                "value": "others"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "others"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 0,
+        "y": 0
+      },
+      "id": 14,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "values": [
+            "percent",
+            "value"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"self\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"available\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"memory\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {label_name} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C -$A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "内存",
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                1000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  QPS超过1000",
+        "name": "请求统计 alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": " "
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-blue",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 12,
+        "x": 6,
+        "y": 0
+      },
+      "id": 4,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"request\",type=~\"total|write\"}",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 1000,
+          "visible": true
+        }
+      ],
+      "title": "请求统计",
+      "type": "timeseries"
+    },
+    {
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            }
+          },
+          "mappings": [],
+          "unit": "decbits"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "available"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "D"
+            },
+            "properties": [
+              {
+                "id": "displayName",
+                "value": "other"
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "other"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 16,
+        "w": 6,
+        "x": 18,
+        "y": 0
+      },
+      "id": 12,
+      "options": {
+        "displayLabels": [
+          "name",
+          "value"
+        ],
+        "legend": {
+          "displayMode": "table",
+          "placement": "bottom",
+          "sortBy": "Value",
+          "sortDesc": true,
+          "values": [
+            "value",
+            "percent"
+          ]
+        },
+        "pieType": "pie",
+        "reduceOptions": {
+          "calcs": [
+            "lastNotNull"
+          ],
+          "fields": "",
+          "values": false
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "exemplar": false,
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"available\"}",
+          "format": "time_series",
+          "instant": false,
+          "interval": "",
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "B"
+        },
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk\",type=\"total\"}",
+          "hide": true,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "C"
+        },
+        {
+          "datasource": {
+            "type": "__expr__"
+          },
+          "expression": "$C - $A - $B",
+          "hide": false,
+          "refId": "D",
+          "type": "math"
+        }
+      ],
+      "title": "磁盘",
+      "transformations": [
+        {
+          "id": "configFromData",
+          "options": {
+            "applyTo": {
+              "id": "byFrameRefID"
+            },
+            "configRefId": "config",
+            "mappings": []
+          }
+        }
+      ],
+      "type": "piechart"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                90
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\nCPU使用率超过90%",
+        "name": "CPU使用率 alert",
+        "noDataState": "no_data",
+        "notifications": [
+          {
+          }
+        ]
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "description": "",
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 4,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "linear",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "percent"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "graph_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-orange",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total_used"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "self"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "total"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "light-purple",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 0,
+        "y": 16
+      },
+      "id": 6,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "code",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"cpu\",type=~\"total|self\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 90,
+          "visible": true
+        }
+      ],
+      "title": "CPU使用率",
+      "type": "timeseries"
+    },
+    {
+      "alert": {
+        "alertRuleTags": {},
+        "conditions": [
+          {
+            "evaluator": {
+              "params": [
+                10000
+              ],
+              "type": "gt"
+            },
+            "operator": {
+              "type": "and"
+            },
+            "query": {
+              "params": [
+                "A",
+                "5m",
+                "now"
+              ]
+            },
+            "reducer": {
+              "params": [],
+              "type": "avg"
+            },
+            "type": "query"
+          }
+        ],
+        "executionErrorState": "alerting",
+        "for": "5m",
+        "frequency": "1m",
+        "handler": 1,
+        "message": "【生产图数据库Grafana】\n  磁盘IO超过10MB/S",
+        "name": "磁盘IO alert",
+        "noDataState": "no_data",
+        "notifications": []
+      },
+      "datasource": {
+        "type": "prometheus"
+      },
+      "fieldConfig": {
+        "defaults": {
+          "color": {
+            "mode": "palette-classic"
+          },
+          "custom": {
+            "axisLabel": "",
+            "axisPlacement": "auto",
+            "barAlignment": 0,
+            "drawStyle": "line",
+            "fillOpacity": 7,
+            "gradientMode": "none",
+            "hideFrom": {
+              "legend": false,
+              "tooltip": false,
+              "viz": false
+            },
+            "lineInterpolation": "smooth",
+            "lineWidth": 1,
+            "pointSize": 5,
+            "scaleDistribution": {
+              "type": "linear"
+            },
+            "showPoints": "auto",
+            "spanNulls": false,
+            "stacking": {
+              "group": "A",
+              "mode": "none"
+            },
+            "thresholdsStyle": {
+              "mode": "off"
+            }
+          },
+          "mappings": [],
+          "thresholds": {
+            "mode": "absolute",
+            "steps": [
+              {
+                "color": "green",
+                "value": null
+              },
+              {
+                "color": "red",
+                "value": 80
+              }
+            ]
+          },
+          "unit": "bps"
+        },
+        "overrides": [
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "read"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-green",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          },
+          {
+            "matcher": {
+              "id": "byName",
+              "options": "write"
+            },
+            "properties": [
+              {
+                "id": "color",
+                "value": {
+                  "fixedColor": "super-light-red",
+                  "mode": "fixed"
+                }
+              }
+            ]
+          }
+        ]
+      },
+      "gridPos": {
+        "h": 14,
+        "w": 12,
+        "x": 12,
+        "y": 16
+      },
+      "id": 2,
+      "options": {
+        "legend": {
+          "calcs": [
+            "min",
+            "max",
+            "mean",
+            "last"
+          ],
+          "displayMode": "table",
+          "placement": "bottom"
+        },
+        "tooltip": {
+          "mode": "single",
+          "sort": "none"
+        }
+      },
+      "targets": [
+        {
+          "datasource": {
+            "type": "prometheus"
+          },
+          "editorMode": "builder",
+          "expr": "resources_report{instance=\"localhost:7010\",job=\"TuGraph\",resouces_type=\"disk_rate\",type=~\"read|write\"}",
+          "hide": false,
+          "legendFormat": "{ {type} }",
+          "range": true,
+          "refId": "A"
+        }
+      ],
+      "thresholds": [
+        {
+          "colorMode": "critical",
+          "op": "gt",
+          "value": 10000,
+          "visible": true
+        }
+      ],
+      "title": "磁盘IO",
+      "type": "timeseries"
+    }
+  ],
+  "refresh": "",
+  "schemaVersion": 36,
+  "style": "dark",
+  "tags": [],
+  "templating": {
+    "list": []
+  },
+  "time": {
+    "from": "now-24h",
+    "to": "now"
+  },
+  "timepicker": {
+    "hidden": false,
+    "refresh_intervals": [
+      "10s"
+    ]
+  },
+  "timezone": "",
+  "title": "TuGraph监控页面",
+  "version": 20,
+  "weekStart": ""
+}
+```
+
+验证效果，刷新浏览器页面。如果正确显示饼图和折线图，则配置完成。
+
+## 3.未来计划
+
+目前可视化监控只支持单机监控，能监控服务所在机器的cpu，磁盘，网络io，请求qps等性能指标，未来将会实现监控ha集群的功能，也会将更多有意义的指标纳入监控范围
+
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/5.log.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/5.log.md
new file mode 100644
index 0000000000..519b3d675f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/5.log.md
@@ -0,0 +1,74 @@
+# 日志信息
+
+> 此文档主要介绍 TuGraph 的日志功能。
+
+## 1.简介
+
+TuGraph 保留两种类型的日志：服务器日志和审计日志。服务器日志记录人为可读的服务器状态信息，而审核日志维护服务器上执行的每个操作加密后的信息。
+
+## 2.服务器日志
+
+### 2.1.服务器日志配置项
+
+服务器日志的输出位置可以通过`log_dir`配置指定。服务器日志详细程度可通过`verbose`配置项指定。
+
+`log_dir`配置项默认为空。若`log_dir`配置项为空，则所有日志会输出到控制台(daemon模式下若log_dir配置项为空则不会向console输出任何日志)；若手动指定`log_dir`配置项，则日志文件会生成在对应的路径下面。单个日志文件最大大小为256MB。
+
+`verbose`配置项控制日志的详细程度，从粗到细分为`0, 1, 2`三个等级，默认等级为`1`。等级为`2`时，日志记录最详细，服务器将打印`DEBUG`及以上等级的全部日志信息；等级为`1`时，服务器将仅打印`INFO`等级及以上的主要事件的日志；等级为`0`时，服务器将仅打印`ERROR`等级及以上的错误日志。
+
+### 2.2.服务器日志输出宏使用示例
+
+如果开发者在开发过程中希望在代码中添加日志，可以参考如下示例
+
+```
+#include "tools/lgraph_log.h" //添加日志依赖
+
+
+void LogExample() {
+    // 数据库启动阶段已经对日志模块进行了初始化，开发者只需直接调用宏即可
+    // 日志等级分为DEBUG, INFO, WARNING, ERROR, FATAL五个等级
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+    LOG_FATAL() << "This is a fatal level log message.";
+}
+```
+更多用法可以参考test/test_lgraph_log.cpp中的日志宏的使用方法
+
+### 2.3.存储过程日志
+
+用户在存储过程的编写过程中可以使用日志功能将所需的调试信息输出到日志中进行查看，辅助开发。调试信息会输出到与服务器日志相同的日志文件中(如未指定`log_dir`则同样输出至console)
+
+#### 2.3.1.cpp存储过程
+请使用2.2中提供的log宏输出调试信息，避免使用cout或者printf等输出方式。具体使用方式可参考如下示例代码（详见`procedures/demo/log_demo.cpp`）
+
+```
+#include <stdlib.h>
+#include "lgraph/lgraph.h"
+#include "tools/lgraph_log.h"  // add log dependency
+using namespace lgraph_api;
+
+void LogExample() {
+    LOG_DEBUG() << "This is a debug level log message.";
+    LOG_INFO() << "This is a info level log message.";
+    LOG_WARN() << "This is a warning level log message.";
+    LOG_ERROR() << "This is a error level log message.";
+}
+
+extern "C" bool Process(GraphDB& db, const std::string& request, std::string& response) {
+    response = "TuGraph log demo";
+    LogExample();
+    return true;
+}
+```
+将以上示例代码作为存储过程插入数据库并运行后，可以在日志文件中看到相应的日志条目。
+
+#### 2.3.1.python存储过程
+请使用python自带的print输出调试信息，调试信息会在存储过程运行结束后合并为一条WARN等级的日志条目输出至日志文件中。
+
+## 3.审计日志
+
+审核日志记录每个请求和响应，以及发送请求的用户以及收到请求的时间。审核日志只能是打开或关闭状态。可以使用 TuGraph 可视化工具和 REST API 查询结果。
+
+开启审计日志需要在配置文件中将`enable_audit_log`参数设置为`true`。配置文件和配置参数说明详见：[数据库运行/服务配置](../../5.installation&running/7.tugraph-running.md)。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/index.rst
new file mode 100644
index 0000000000..f8e9db5345
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/10.permission/index.rst
@@ -0,0 +1,9 @@
+运维与权限管理
+================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/11.quality/1.unit-testing.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/11.quality/1.unit-testing.md
new file mode 100644
index 0000000000..ff3fcd8048
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/11.quality/1.unit-testing.md
@@ -0,0 +1,7 @@
+# 单元测试
+
+> 该文档是TuGraph的单元测试文档
+
+## 1.简介
+
+TuGraph单元测试采用gtest框架，可以选择一次跑全部test或者制定某些test。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/11.quality/2.integration-testing.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/11.quality/2.integration-testing.md
new file mode 100644
index 0000000000..5d49f35255
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/11.quality/2.integration-testing.md
@@ -0,0 +1,399 @@
+# 集成测试
+
+> 此文档主要介绍 TuGraph 的集成测试框架如何使用
+
+## 1.TuGraph集成测试的意义
+
+在单元测试与功能测试中，有部分用例直接开启galaxy或statemachine来进行测试，这并不是一个完整的流程。在完整的cs架构中，用户请求是通过客户端发往服务端，网络通信是必不可少的，为了避免单元测试不完整带来的bug，针对这种情况，使用集成测试框架进行全链路的完整测试。
+
+## 2.TuGraph集成测试框架
+
+TuGraph采用pytest框架作为自己的集成测试框架，pytest框架作为目前使用最广泛的cs端集成测试框架，以其灵活简单，容易上手，并且支持参数化的使用方式而著称，TuGraph基于pytest提供的功能，抽象出了不同的工具，通过参数来控制各个工具的处理逻辑，以方便大家进行高效的测试代码开发。
+
+更多pytest信息请参考官网: [https://docs.pytest.org/en/7.2.x/getting-started.html](https://docs.pytest.org/en/7.2.x/getting-started.html)
+
+### 2.1.组件描述
+
+| 组件名称            | 组件功能                       | 实现方式                                  |
+|-----------------|----------------------------|---------------------------------------|
+| server          | TuGraph单机服务                | 开启子进程并在子进程中启动服务                       |
+| client          | TuGraph Rpc Client         | 当前进程中开启TuGraph Python Rpc Client发送请求  |
+| importor        | TuGraph Importor           | 开启子进程并在子进程中处理导入请求                     |
+| exportor        | TuGraph Exportor           | 开启子进程并在子进程中处理导出请求                     |
+| backup_binlog   | TuGraph Backup Binlog      | 开启子进程并在子进程中处理备份binlog的请求              |
+| backup_copy_dir | TuGraph Backup             | 开启子进程并在子进程中处理备份完整db的请求                |
+| build_so        | 编译c++动态连接库的组件              | 开启子进程并在子进程中处理gcc编译逻辑                  |
+| copy_snapshot   | TuGraph Copy Snapshot      | 当前进程中处理备份snapshot的请求                  |
+| copydir         | 文件夹拷贝                      | 当前进程中处理文件夹拷贝请求                        |
+| exec            | 执行c++/java可执行文件            | 开启子进程并在子进程中启动C++可执行文件                 |
+| algo            | 执行算法                       | 开启子进程并在子进程中执行算法                       |
+| bash            | 执行bash命令                   | 开启子进程并在子进程中执行bash命令                   |
+| rest            | TuGraph Python Rest Client | 当前进程中开启TuGraph Python Rest Client发送请求 |
+
+### 2.2.组件用法
+
+#### 2.2.1.server
+
+##### 2.2.1.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+```
+
+##### 2.2.1.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动server，函数执行完成后会停止server，并清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+def test_server(self, server):
+    pass
+```
+
+#### 2.2.2.client
+
+##### 2.2.2.1.启动参数
+采用python字典传入
++ host是TuGraph Server的ip和端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+```python
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.2.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制不同的处理逻辑，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_client(self, server, client):
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0]
+    ret = client.callCypher("CALL db.createEdgeLabel('followed', '[]', 'address', string, false, 'date', int32, false)", "default")
+    assert ret[0] == False
+```
+
+#### 2.2.3.importor
+
+##### 2.2.3.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+```
+
+##### 2.2.3.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导入不同的数据，函数开始执行前会导入数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+def test_importor(self, importor):
+    pass
+```
+
+#### 2.2.4.exportor
+
+##### 2.2.4.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+```
+
+##### 2.2.4.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制导出不同的数据，函数开始执行前会导出数据到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+def test_exportor(self, exportor):
+    pass
+```
+
+#### 2.2.5.backup_binlog
+
+##### 2.2.5.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BINLOGOPT = {"cmd" : "./lgraph_binlog -a restore --host 127.0.0.1 --port 9093 -u admin -p 73@TuGraph -f ./testdb/binlog/*",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.5.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的binlog，函数开始执行前会拷贝binlog到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_binlog", [BINLOGOPT], indirect=True)
+def test_backup_binlog(self, backup_binlog):
+    pass
+```
+
+#### 2.2.6.backup_copy_dir
+
+##### 2.2.6.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ cleanup_dir是执行完成后需要清理的目录，可以是多个，通过python列表传入
+
+```python
+BACKUPOPT = {"cmd" : "./lgraph_backup --src ./testdb -dst ./testdb1",
+             "cleanup_dir":[]}
+```
+
+##### 2.2.6.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制备份不同的db，函数开始执行前会拷贝db到指定的目录，函数执行完成后会清理cleanup_dir指定的目录
+
+```python
+@pytest.mark.parametrize("backup_copy_dir", [BACKUPOPT], indirect=True)
+def test_backup_copy_dir(self, backup_copy_dir):
+	pass
+```
+
+#### 2.2.7.build_so
+
+##### 2.2.7.1.启动参数
+采用python字典传入
++ cmd是启动命令，采用python列表传入，可以一次编译多个so
++ so_name是执行完成后需要清理的so，可以是多个，通过python列表传入
+
+```python
+BUILDOPT = {"cmd":["g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./scan_graph.so ../../test/test_procedures/scan_graph.cpp ./liblgraph.so -shared",
+                       "g++ -fno-gnu-unique -fPIC -g --std=c++17 -I ../../include -I ../../deps/install/include -rdynamic -O3 -fopenmp -DNDEBUG -o ./sortstr.so ../../test/test_procedures/sortstr.cpp ./liblgraph.so -shared"],
+                "so_name":["./scan_graph.so", "./sortstr.so"]}
+```
+
+##### 2.2.7.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制编译不同的so，函数开始执行前会生成so到指定的目录，函数执行完成后会清理so_name列表指定的动态库
+
+```python
+@pytest.mark.parametrize("build_so", [BUILDOPT], indirect=True)
+def test_build_so(self, build_so):
+    pass
+```
+
+#### 2.2.8.copy_snapshot
+
+##### 2.2.8.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.8.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的snapshot，函数开始执行前会拷贝src中的snapshot到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_snapshot", [COPYSNAPOPT], indirect=True)
+def test_copy_snapshot(self, copy_snapshot):
+    pass
+```
+
+#### 2.2.9.copy_dir
+
+##### 2.2.9.1.启动参数
+采用python字典传入
++ src是原db
++ dst是拷贝后的snapshot
+
+```python
+COPYSNAPOPT = {"src" : "./testdb", "dst" : "./testdb1"}
+```
+
+##### 2.2.9.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制拷贝不同的目录，函数开始执行前会拷贝src到dst指定的目录
+
+```python
+@pytest.mark.parametrize("copy_dir", [COPYDIR], indirect=True)
+def test_copy_dir(self, copy_dir):
+    pass
+```
+
+#### 2.2.10.exec
+
+##### 2.2.10.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+EXECOPT = {
+        "cmd" : "test_rpc_client/cpp/CppClientTest/build/clienttest"
+    }
+```
+
+##### 2.2.10.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的命令
+
+```python
+@pytest.mark.parametrize("exec", [EXECOPT], indirect=True)
+def test_exec(self, exec):
+        pass
+```
+
+#### 2.2.11.algo
+
+##### 2.2.11.1.启动参数
+采用python字典传入
++ cmd是启动命令
++ result是算法预期的执行结果，执行完成会通过实际结果与预期结果进行比较，不同则测试失败
+
+```python
+BFSEMBEDOPT = {
+        "cmd" : "algo/bfs_embed ./testdb",
+        "result" : ["found_vertices = 3829"]
+    }
+```
+
+##### 2.2.11.2.启动命令
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的算法逻辑，函数开始执行前会开启子进程执行通过cmd参数传入的算法，函数主体等待算法执行完成后对比结果
+
+```python
+@pytest.mark.parametrize("algo", [BFSEMBEDOPT], indirect=True)
+def test_exec_bfs_embed(self, algo):
+    pass
+```
+
+#### 2.2.12.bash
+
+##### 2.2.12.1.启动参数
+采用python字典传入
++ cmd是启动命令
+
+```python
+BASHOPT = {
+        "cmd" : "sh ./test_rpc_client/cpp/CppClientTest/compile.sh"
+    }
+```
+
+##### 2.2.12.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来控制执行不同的bash命令，函数开始执行前会开启子进程执行通过cmd参数传入的bash命令，函数主体等待算法执行完成
+
+```python
+@pytest.mark.parametrize("bash", [BASHOPT], indirect=True)
+def test_bash(self, bash):
+    pass
+```
+
+#### 2.2.13.rest
+
+##### 2.2.13.1.启动参数
+采用python字典传入
++ port是TuGraph Server的端口
++ user是TuGraph Server的用户名
++ password是TuGraph Server 中user对应的密码
+
+
+```python
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+```
+
+##### 2.2.13.2.启动命令
+
+通过fixtures组件引入工具，并通过启动参数来链接不同的TuGraph Rest Server，函数开始执行前会启动客户端，函数执行结束后会结束客户端
+
+```python
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+	pass
+```
+
+### 2.3.测试样例
+
+#### 2.3.1.rest
+
+样例代码中在test_get_info函数执行之前先启动server，server启动后启动了rest client，进入test_get_info函数后获取server的一些信息，并通过assert判断是否有获取到cpu的信息。
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+               "cleanup_dir":["./testdb"]}
+RESTTOPT = {"port":"7073", "user":"admin", "password":"73@TuGraph"}
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("rest", [RESTTOPT], indirect=True)
+def test_get_info(self, server, rest):
+    res = rest.get_server_info()
+    log.info("res : %s", res)
+    assert('cpu' in res)
+```
+
+#### 2.3.2.client
+
+样例代码中在test_flushdb函数执行之前先执行了数据离线导入逻辑，并启动server后，通过client创建链接，进入test_flushdb函数后，通过查询点的个数判断导入是否成功，导入成功后执行flushDB操作，再次通过assert判断是否能正常清空db
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7072 --rpc_port 9092",
+             "cleanup_dir":["./testdb"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9092", "user":"admin", "password":"73@TuGraph"}
+
+IMPORTOPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./testdb", "./.import_tmp"]}
+
+@pytest.mark.parametrize("importor", [IMPORTOPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_flushdb(self, importor, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    assert len(res) == 21
+    ret = client.callCypher("CALL db.flushDB()", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+     assert res == None
+```
+
+#### 2.3.3.exportor/importor
+
+样例代码中在test_export_default函数执行之前先执行了数据离线导入逻辑，导入成功后将当前db的数据导出，然后再次通过离线导入逻辑将exportor导出的数据导入到新的目录中，以新导入的数据启动db，并且创建链接。在test_export_default函数主体中判断导出后再次导入的数据是否与原始数据一致
+
+```python
+SERVEROPT = {"cmd":"./lgraph_server -c lgraph_standalone.json --directory ./testdb1 --license _FMA_IGNORE_LICENSE_CHECK_SALTED_ --port 7073 --rpc_port 9093",
+             "cleanup_dir":["./testdb1"]}
+
+CLIENTOPT = {"host":"127.0.0.1:9093", "user":"admin", "password":"73@TuGraph"}
+
+IMPORT_YAGO_OPT = {"cmd":"./lgraph_import --config_file ./data/yago/yago.conf --dir ./testdb --user admin --password 73@TuGraph --graph default --overwrite 1",
+             "cleanup_dir":["./.import_tmp", "./testdb"]}
+
+IMPORT_DEF_OPT = {"cmd":"./lgraph_import -c ./export/default/import.config -d ./testdb1",
+             "cleanup_dir":["./.import_tmp", "./testdb1"]}
+
+EXPORT_DEF_OPT = {"cmd":"./lgraph_export -d ./testdb -e ./export/default -g default -u admin -p 73@TuGraph",
+                  "cleanup_dir":["./export"]}
+
+@pytest.mark.parametrize("importor", [IMPORT_YAGO_OPT], indirect=True)
+@pytest.mark.parametrize("exportor", [EXPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("importor_1", [IMPORT_DEF_OPT], indirect=True)
+@pytest.mark.parametrize("server", [SERVEROPT], indirect=True)
+@pytest.mark.parametrize("client", [CLIENTOPT], indirect=True)
+def test_export_default(self, importor, exportor, importor_1, server, client):
+    ret = client.callCypher("MATCH (n) RETURN n LIMIT 100", "default")
+    assert ret[0]
+    res = json.loads(ret[1])
+    log.info("res : %s", res)
+    assert len(res) == 21
+```
+
+#### 2.3.4.其他测试
+更多用例请参考集成测试代码 [https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration](https://github.com/TuGraph-family/tugraph-db/tree/master/test/integration)
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/11.quality/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/11.quality/index.rst
new file mode 100644
index 0000000000..9b190aa284
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/11.quality/index.rst
@@ -0,0 +1,9 @@
+测试与质量保障
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/1.contributing.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/1.contributing.md
new file mode 100644
index 0000000000..18c9c1daec
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/1.contributing.md
@@ -0,0 +1,91 @@
+# 如何贡献
+
+## 1. 前言
+感谢您为TuGraph做出贡献，我们由衷地希望有更多社区的同学加入进来，一起建设一个更好的图数据库项目。
+
+对于优秀社区贡献者，我们将颁发TuGraph优秀社区贡献者证书。
+
+## 2. 贡献什么
+我们随时都欢迎任何贡献，无论是简单的错别字修正，BUG 修复还是增加新功能。请踊跃提出问题或发起 PR。我们同样重视文档以及与其它开源项目的整合，欢迎在这方面做出贡献。
+对于任何修改，尤其是较为复杂的修改，建议新建一个issue ，按照BUG或者PR的模板填写。
+
+## 3. 准备工作
+
+### 3.1. 了解TuGraph
+
+建议您从[文档地图](../1.guide.md)开始，了解TuGraph的特性和接口。
+
+### 3.2. 准备环境
+
+对于文档贡献，可以直接通过[文档](https://tugraph-db.readthedocs.io/zh_CN/latest)，点击右上角的"在GitHub上编译"直接修改并提PR。
+
+对于代码贡献，通常需要在搭建编译执行的环境，可以采用[Docker部署](../5.installation&running/3.docker-deployment.md)或[本地部署](../5.installation&running/4.local-package-deployment.md)。
+
+### 3.3. 许可协议
+
+在贡献代码之前，请您稍微花一些时间了解为TuGraph贡献代码的流程，并阅读 [个人贡献者许可协议](3.individual-cla.md) 或 [公司贡献者许可协议](4.corporate-cla.md)，参与贡献则视为同意上述协议。
+
+## 4. 贡献代码流程
+### 4.1. 提交issue
+不论您是修复 TuGraph 的 bug 还是新增 TuGraph 的功能，在您提交代码之前，请在 TuGraph 的 GitHub 上提交一个 issue，描述您要修复的问题或者要增加的功能。这么做有几个好处:
+
+- 不会与其它开发者或是他们对这个项目的计划发生冲突，产生重复工作。
+- TuGraph 的维护人员会对您提的 bug 或者新增功能进行相关讨论，确定该修改是不是必要，有没有提升的空间或更好的办法。
+- 在达成一致后再开发，并提交代码，减少双方沟通成本，也减少 pull request 被拒绝的情况。
+### 4.2. 获取源码
+要修改或新增功能，在提交 issue 后，fork一份 TuGraph  Master代码到您的代码仓库。
+### 4.3. 拉分支
+TuGraph 所有修改都在分支上进行，修改完成后提交 pull request，在 Code Review 后由项目维护人员 Merge 到 Master。 因此，在获取源码步骤介绍后，您需要:
+
+1. 下载代码到本地，这一步您可以选择git/https方式，近年github的权限要求更加严格，比如git方式需要更复杂的ssh key([https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent](https://docs.github.com/en/authentication/connecting-to-github-with-ssh/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent))，https方式不能直接使用用户名密码验证，请按照指引授权。 git clone https://github.com/您的账号名/tugraph-db
+2. 拉分支准备修改代码:
+git branch add_xxx_feature 
+3. 执行完上述命令后，您的代码仓库就切换到相应分支了。执行如下命令可以看到您当前分支: git branch -a 
+4. 如果您想切换回 Master，执行下面命令: git checkout -b master
+5. 如果您想切换回分支，执行下面命令: git checkout -b "branchName"
+
+### 4.4. 编译运行
+
+代码的编译运行流程可以参考[ci脚本](https://github.com/TuGraph-family/tugraph-db/blob/master/ci/github_ci.sh)
+
+### 4.5. 配置 Github 信息
+在您的机器执行 git config  --list ，查看 git 的全局用户名和邮箱。检查显示的 user.name 和 user.email 是不是与自己 github 的用户名和邮箱相匹配。
+
+如果公司内部有自己的 gitlab 或者使用了其他商业化的 gitlab，则可能会出现不匹配的情况。这时候，您需要为 TuGraph DB 项目单独设置用户名和邮箱。设置用户名和邮箱的方式请参考 github 官方文档。
+
+### 4.6. 修改代码提交到本地
+
+拉完分支后，就可以修改代码了。
+
+**修改代码注意事项 **
+
+代码⻛格保持一致：TuGraph 通过 cpplint 来保持代码格式一致，IDE可以通过.clang来配置风格。在提交代码前，务必本地检查代码风格，否则ACI将报错。
+
+补充单元测试代码：新有修改应该通过已有的单元测试,应该提供新的单元测试来证明以前的代码存在 bug，而新的代码已经解决了这些 bug ,您可以用如下命令运行所有测试: ./unit_test
+也可以通过IDE来辅助运行。
+
+**其它注意事项 **
+
+请保持您编辑的代码的原有⻛格，尤其是空格、换行等。 对于无用的注释，请直接删除。 对逻辑和功能不容易被理解的地方添加注释。 及时更新文档。 修改完代码后，请按照如下格式执行命令提交所有的修改到本地:
+git commit -am '(feat) 添加xx功能' git commit -am '(fix) 修复xx问题'`
+
+### 4.7. 提交代码到远程仓库
+在代码提交到本地后，接下来就可以与远程仓库同步代码了，执行如下命令提交本地修改到 github 上: git push origin "branchname"
+
+如果前面您是通过 fork 来做的，那么这里的 origin 是 push 到您的代码仓库，而不是 TuGraph 的代码仓库。
+
+提交合并代码到 Master 的请求 在的代码提交到 GitHub 后，您就可以发送请求来把您改好的代码合入 TuGraph Master 代码了。此时您需要进入您在 GitHub 上的对应仓库，按右上⻆的 pull request 按钮。选择目标分支，一般就是 master，系统会通知 TuGraph 的人员， TuGraph 人员会 Review 您的代码，符合要求后就会合入主干，成为 TuGraph 的一部分。 
+
+请注意会自动检查CI，以及所有Commits中的贡献者是否签署了cla，通过后会有绿色的标识。
+
+### 4.8. 代码 Review
+
+在您提交代码后，您的代码会被指派给维护人员 Review，请耐心等待。如果两个工作日后，仍然没有人对您的提交给予任何回复，可以在 PR 下面留言，并 @ 对应的人员。
+
+对于代码 Review 的意⻅会直接备注到到对应 PR 或者 Issue。如果觉得建议是合理的，也请您把这些建议更新到您的代码中。
+
+### 4.9. 合并代码到Master
+
+在代码 Review 通过后，就由 TuGraph 维护人员操作合入 Master，在此过程中维护人员可能会指定新的Reviewer，提出新的意见需要修改。一般这一步不用参与，代码合并之后，您会收到合并成功的提示。
+
+
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/2.community-roles.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/2.community-roles.md
new file mode 100644
index 0000000000..109a1d8f04
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/2.community-roles.md
@@ -0,0 +1,57 @@
+# 社区角色
+
+## 1. 前言
+本文档描述 TuGraph 社区中成员身份的⻆色，对每种⻆色的要求及权限。 
+
+## 2. ⻆色摘要
+
+这是 TuGraph 社区的⻆色划分，描述了每种⻆色的职责，成为某种⻆色并保持该⻆色的要求，以及相应⻆色的权限。
+
+TuGraph 社区参照 Apache 规范划分为以下三种⻆色：
+
+- Contributor 
+- Maintainer 
+- PMC 
+
+以下描述了每种⻆色的要求、职责和权限。 		 						 					
+## 3. Contributor
+### 3.1. 要求
+在 TuGraph 的任何一个正式项目中成功提交一个 PR 并合并。 
+### 3.2. 职责
+
+- 积极响应指派给您的 Issue 或 PR
+- 一起帮忙回复 Issue 或 PR，把 Issue 分配给对应模块的负责人
+### 3.3. 权限
+
+- 加入 TuGraph GitHub 组织，成为 TuGraph 开源社区的一员。 
+## 4. Maintainer
+### 4.1. 要求
+新的 Committer 由已有的 PMC 推荐，并通过 2/3 以上投票通过，Committer 至少满足以下一个条件：
+
+- 成为社区成员时间超过三个月 
+- 超过 10 个 PMC approve 的 PR 
+- 完成重大功能 
+- 修复严重 Bug 
+- 长期关注项目发展并参与社区讨论
+### 4.2. 职责
+
+- 社区咨询支持
+- 积极响应指派给您的 Issue 或 PR
+- 对于社区重大决定的投票权
+- Review 社区的 PR 
+### 4.3. 权限
+
+- Pull Request review 权限 
+## 5. PMC
+### 5.1. 要求
+
+- 暂不开放，如有强烈愿望请联系PMC
+### 5.2. 职责
+
+- 积极参与社区讨论，对社区重大决策给予指导 
+- 负责保证开源项目的社区活动都能运转良好 
+### 5.3. 权限
+
+- Pull Request review 权限 
+- Pull Request approve 权限 
+- 社区角色成员管理
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/3.individual-cla.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/3.individual-cla.md
new file mode 100644
index 0000000000..514825b414
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/3.individual-cla.md
@@ -0,0 +1,73 @@
+# 个人贡献者许可协议
+
+Ant_Group_Open_Source_Individual_CLA_English_Chinese_2021
+
+Ant Group
+
+Individual Contributor License Agreement
+
+蚂蚁集团
+
+个人贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows an individual to submit Contributions to the applicable project.  If you are making a submission on behalf of a legal entity, then you should sign the separation Corporate Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许个人向相应项目提交贡献内容。如果您是以公司名义进行提交，您应当另行签署一份公司贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+
+1. Definitions.
+1. 定义。
+
+   "You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+   “您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+   "Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule A. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+   “贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录A中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license.
+4. 您保证您依法有权授予上述许可。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。   
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Full name全名: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/4.corporate-cla.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/4.corporate-cla.md
new file mode 100644
index 0000000000..d1f5e1f62d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/4.corporate-cla.md
@@ -0,0 +1,84 @@
+# 公司贡献者许可协议
+
+Ant_Group_Open_Source_Corporate_CLA_English_Chinese_2021
+
+Ant Group
+
+Corporate Contributor License Agreement
+
+蚂蚁集团
+
+公司贡献者许可协议
+
+Thank you for your interest in contributing documentation and related software code to a project hosted or managed by Ant Group, or any of its affiliates. In order to clarify the intellectual property license granted with Contributions from any person or entity, Ant Group must have a Contributor License Agreement ("CLA") on file that has been signed by each Contributor, indicating agreement to the license terms below.  This version of the Contributor License Agreement allows a legal entity (the "Corporation") to submit Contributions to the applicable project.  If you are an individual making a submission on your own behalf, then you should sign the separation Individual Contributor License Agreement.
+
+感谢您对向蚂蚁集团或其任何关联方主办或管理的项目贡献文档和相关软件代码的兴趣。为厘清就个人或实体贡献内容而授予的知识产权许可，蚂蚁集团必须对每位贡献者签署的贡献者许可协议（“CLA”）进行归档，以证明就以下许可条件达成的一致。此版本的贡献者许可协议允许法人实体（“公司”）向相应项目提交贡献内容。如果您是以自身名义进行提交的个人，您应当另行签署一份个人贡献者许可协议。
+
+You accept and agree to the following terms and conditions for Your present and future Contributions submitted to Ant Group. Except for the license granted herein to Ant Group and recipients of documentation and software distributed by Ant Group, You reserve all right, title, and interest in and to Your Contributions.
+
+就您目前和将来向蚂蚁集团提交的贡献内容，您接受并同意以下条款和条件。除了根据本协议向蚂蚁集团和蚂蚁集团发布文档和软件的接收方授予的许可，您对于您的贡献内容保留所有权利、所有权和利益。
+1. Definitions.
+1. 定义。
+
+"You" (or "Your") shall mean the copyright owner or legal entity authorized by the copyright owner that is making this Agreement with Ant Group. For legal entities, the entity making a Contribution and all other entities that control, are controlled by, or are under common control with that entity are considered to be a single Contributor. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+“您”（或“您的”）系指与蚂蚁集团签署本协议的著作权人或经著作权人授权的法律实体。对于法律实体而言，提交贡献内容的实体以及其他任何控制该实体、受其控制或与其受到同一主体控制的实体被视为单个贡献者。为本定义之目的，“控制” 系指（i）通过合同或其他方式，直接或间接对该实体进行指导和管理的权力，（ii）持有该实体百分之五十（50%）或更多的已发行股份，或（iii）间接持有该实体权益。
+
+"Contribution" shall mean any original work of authorship, including any modifications or additions to an existing work, that is intentionally submitted by You to Ant Group for inclusion in, or documentation of, any of the products or projects owned or managed by Ant Group (the "Work"), including without limitation any Work described in Schedule B. For the purposes of this definition, "submitted" means any form of electronic or written communication sent to Ant Group or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, Ant Group for the purpose of discussing and improving the Work.
+
+“贡献内容”系指由您有意地向蚂蚁集团提交，以便被包含或记载在任何蚂蚁集团拥有或管理的产品或项目（“作品”，包括但不限于任何在附录B中列举的作品）中的任何原创作品，包括对既存作品的任何修改和增加。为本定义之目的，“提交”系指向蚂蚁集团或其代表进行的任何形式的电子或书面交流，包括但不限于为讨论和改善作品为目的，通过蚂蚁集团管理的（或以蚂蚁集团名义管理的）电子邮件列表、源代码控制系统和问题跟踪系统进行的交流。
+
+2. Grant of Copyright License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, sublicense, and distribute Your Contributions and such derivative works.
+2. 著作权许可的授予。受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销的著作权许可，以复制、衍生、公开展示、公开执行、转授权和发布您的贡献内容和该等衍生作品。
+
+3. Grant of Patent License. Subject to the terms and conditions of this Agreement, You hereby grant to Ant Group and to recipients of documentation and software distributed by Ant Group a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by You that are necessarily infringed by Your Contribution(s) alone or by combination of Your Contribution(s) with the Work to which such Contribution(s) was submitted. If any entity institutes patent litigation against You or any other entity (including a cross-claim or counterclaim in a lawsuit) alleging that your Contribution, or the Work to which you have contributed, constitutes direct or contributory patent infringement, then any patent licenses granted to that entity under this Agreement for that Contribution or Work shall terminate as of the date such litigation is filed.
+3. 专利许可的授予。  受限于本协议的条款和条件，您在此授予蚂蚁集团以及蚂蚁集团发布文档和软件的接收方永久性的、全球范围内的、非排他的、完全无须许可费的、完全无须版权费的和不可撤销（本节规定的情形除外）的专利许可，以开发、利用、要约出售、出售、导入或以其他方式转让作品，但该许可仅适用于您有权许可的，且必然会被您的贡献内容侵权（贡献内容单独构成侵权、或与贡献内容的相关作品一同构成侵权）的专利申请范围。如果任何实体针对您或其他实体提起专利诉讼（包括诉讼中的交叉请求或反诉），主张您的贡献内容（或您参与贡献的作品）造成了直接性或辅助性的专利侵权，则任何根据本协议针对该贡献内容或作品授予该实体的专利许可应当在起诉之日终止。
+
+4. You represent that you are legally entitled to grant the above license. You represent further that each employee of the Corporation designated on Schedule A below (or in a subsequent written modification to that Schedule) is authorized to submit Contributions on behalf of the Corporation.
+4. 您保证您依法有权授予上述许可。您进一步保证下文附表A（该附表可通过书面方式进行后续更改）所指定的任意公司员工均有权以公司名义提交贡献内容。
+
+5. You represent that each of Your Contributions is Your original creation (see section 7 for submissions on behalf of others).  You represent that Your Contribution submissions include complete details of any third-party license or other restriction (including, but not limited to, related patents and trademarks) of which you are personally aware and which are associated with any part of Your Contributions.
+5. 您保证您所有的贡献内容均为您的原创作品（关于为他人提交作品的规定，可参见第7节）。您保证您提交的贡献内容包括任何第三方许可或其他限制（包括但不限于相关专利或商标）的全部细节，只要该等许可或其他限制为您个人所知悉且与您的贡献内容的任何部分相关。
+
+6. You are not expected to provide support for Your Contributions, except to the extent You desire to provide support. You may provide support for free, for a fee, or not at all. Unless required by applicable law or agreed to in writing, You provide Your Contributions on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON- INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE.
+6. 在您自愿提供支持的范围之外，您无需对您的贡献内容提供支持。您可以提供免费支持或收费支持，也可以完全不提供支持。除非适用法律另有规定或另有书面约定，您“按照现状”提供您的贡献内容，而不对其提供任何类型的保证或条件，无论明示还是默示，包括但不限于为任何特定目的对所有权、无侵权、适销性或适当性的保证或条件。
+
+7. Should You wish to submit work that is not Your original creation, You may submit it to Ant Group separately from any Contribution, identifying the complete details of its source and of any license or other restriction (including, but not limited to, related patents, trademarks, and license agreements) of which you are personally aware, and conspicuously marking the work as "Submitted on behalf of a third-party: [named here]".
+7. 如果您希望提交并非您原创的作品，您可以在任何贡献内容之外单独向蚂蚁集团提交，标注关于其来源和您个人所知悉的任何许可或其他限制（包括但不限于相关专利、商标和许可协议）的完整信息，并以显著方式标明该作品属于“以第三方名义提交：【填写姓名】”。
+
+8. You agree to notify Ant Group of any facts or circumstances of which you become aware that would make these representations inaccurate in any respect.
+8. 您同意在您获悉任何可能导致上述保证在任何方面不准确的事实或情况之时通知蚂蚁集团。
+
+9. This Agreement will be governed by and construed in accordance with the laws of the People's Republic of China excluding that body of laws known as conflict of laws.  The parties expressly agree that the United Nations Convention on Contracts for the International Sale of Goods will not apply.  Any legal action or proceeding arising under this Agreement will be brought exclusively in the courts located in Hangzhou, China, and the parties hereby irrevocably consent to the personal jurisdiction and venue therein.
+9. 本协议受中华人民共和国法律管辖，并依据其进行解释，但冲突法规则除外。协议各方明确同意排除《联合国国际货物销售合同公约》的适用。任何由本协议产生的法律诉讼或程序均应排他性地提交至中国杭州的法院进行审理，且各方在此不可撤销地同意该等关于属人管辖和法院地的安排。
+
+10. For your reading convenience, this Agreement is written in parallel English and Chinese sections. To the extent there is a conflict between the English and Chinese sections, the English sections shall govern.
+10. 为了您的阅读方便，本协议同时提供了英文和中文段落。如果英文和中文段落有矛盾，则以英文段落为准。
+
+Please sign请签署: __________________________________ Date日期: ____________
+
+Company Name公司名称: ________________________________________________
+
+Full name全名: _____________________________________________________
+
+Title职务: _____________________________________________________
+
+Mailing Address信件地址: ________________________________________________
+
+Country国家: _____________________________________________________
+
+Telephone电话: _____________________________________________________
+
+E-Mail电子邮箱:    ______________________________________________________
+
+Schedule A附录A:
+
+Please provide an initial list of designated employees authorized to submit Contributions on behalf of the Corporation:
+
+请提供一份有权以公司名义提交贡献内容的指定员工的初始名单：
+
+Schedule B 附录B:
+
+Description of Initial Contribution:
+
+描述初始贡献内容：
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/5.roadmap.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/5.roadmap.md
new file mode 100644
index 0000000000..6668c91d5e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/5.roadmap.md
@@ -0,0 +1,66 @@
+# 技术规划
+
+## 1. 简介
+
+该文档是 TuGraph-DB 未来开发的规划，包括正在开发中、不在开发计划里、已经开发完成但不在开源版本里的功能等。
+
+TuGraph-DB定位开源高性能图数据库，图数据采用集中存储的方式，短期 **不会** 考虑基于分片（Sharding）的数据切分，
+而将支持主备复制的模式来解决高并发读的场景，采用云上存储解决存储容量的问题。
+
+## 2. 已完成功能
+
+TuGraph-DB于2022年9月1日开源，TuGraph-DB在社区的反馈声中，进行日常BUG修复，自身能力得到了完善。
+
+| 版本号   | 功能                               | 时间         |
+|-------|----------------------------------|------------|
+| 3.3.0 | 开源初版                             | 2022.9.1   |
+| 3.3.1 | 图分析引擎重构，多模式支持                    | 2022.10.14 |
+| 3.3.2 | OGM支持，UT覆盖率提升                    | 2022.11.21 |
+| 3.3.3 | 链接认证机制迭代，加入英文文档                  | 2022.12.23 |
+| 3.3.4 | 支持上云，梳理LDBC SNB Audit流程          | 2023.1.28  |
+| 3.4.0 | 支持OLAP Python API, 离线导入升级        | 2023.3.11  |
+| 3.5.0 | 支持POG，前端升级，文档梳理                  | 2023.6.5   |
+| 3.5.1 | 图学习引擎，Procedure Rust API，存储属性分离  | 2023.7.14  |
+| 3.6.0 | 高可用开源，日志系统升级                     | 2023.8.11  |
+| 4.0.0 | ISO GQL支持，新增11个开源图算法，支持m1 Docker | 2023.9.6   |
+| 4.0.1 | 支持时序边排序，新增5个开源图算法                | 2023.9.28  |
+| 4.1.0 | 支持Bolt协议，支持快速在线全量导入，支持地理空间数据类型   | 2023.12.25 |
+
+除此之外，TuGraph-DB搭建了较为完善的质量体系，涵盖自动化的单元测试、集成测试、性能测试等。
+
+更详细的描述可以在源码目录在的 "[root]/release/CHANGELOG.md" 文件查看。
+
+## 3. 2024年功能更新
+
+在2024年度，我们计划的功能更新包括：
+
+| 版本号   | 功能                 | 计划时间    |
+|-------|--------------------|---------|
+| 4.2.x | HA支持Witness角色和管理工具 | 2024.3  |
+| 4.2.x | Bolt支持流处理和参数化查询    | 2024.3  |
+| x.x.x | GeaX支持Cypher       | 2024.6  |
+| x.x.x | 支持组合索引             | 2024.6  |
+| x.x.x | 数据导入功能优化           | 2024.6  |
+| x.x.x | 【社区功能】支持地理数据类型使用   | 2024.6  |
+| x.x.x | Cypher能力提升         | 2024.9  |
+| x.x.x | 支持Schema快速变更       | 2024.9  |
+| x.x.x | 向量化支持              | 2024.12 |
+| x.x.x | RPQ支持              | 2024.12 |
+| x.x.x | 【可选】查询引擎升级         | 2024.12 |
+| x.x.x | 【社区功能】支持GraphAr    | 2024.12 |
+
+## 4. 期望社区共创的功能
+
+目前团队研发精力并不能实现我们对TuGraph-DB的全部期望，在功能的梳理中，我们发现有一系列值得挖掘的想法，
+团队也有一些初步的探索，期望下面功能能够在社区中共同研发。
+
+| 版本号   | 功能                      | 计划时间   |
+|-------|-------------------------|--------|
+| x.x.x | 图算法库丰富                  | 2024.x |
+| x.x.x | 属性默认值支持                 | 2024.x |
+| x.x.x | Embedded TuGraph-DB最佳实践 | 2024.x |
+| x.x.x | Bolt显式事务支持              | 2024.x |
+| x.x.x | List、Map和Decimal等数据类型扩展 | 2024.x |
+| x.x.x | 探索多存储引擎                 | 2024.x |
+
+一些更加简单的功能，我们会在github的issue中打上 good first issue 的标签，欢迎对图数据库感兴趣的技术爱好者共同研讨。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/index.rst
new file mode 100644
index 0000000000..f2319d2358
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/12.contributor-manual/index.rst
@@ -0,0 +1,9 @@
+贡献者文档
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
new file mode 100644
index 0000000000..addc159170
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/1.rdbms-to-tugraph.md
@@ -0,0 +1,3 @@
+# 从关系型数据库导入TuGraph
+
+> 使用 [DataX](../6.utility-tools/7.tugraph-datax.md)，待完善
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/2.learn_practices.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/2.learn_practices.md
new file mode 100644
index 0000000000..01171c1f11
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/2.learn_practices.md
@@ -0,0 +1,223 @@
+# 使用 TuGraph 图学习模块进行点分类
+
+## 1.简介
+GNN 是许多图上机器学习任务的强大工具。在本介绍性教程中，您将学习使用 GNN 进行点分类的基本工作流程，即预测图中点的类别。
+
+此文档将展示如何构建一个 GNN 用于在 Cora 数据集上仅使用少量标签进行半监督点分类，这是一个以论文为点、引文为边的引文网络。任务是预测给定论文的类别。
+
+通过完成本教程，您可以
+
+使用 TuGraph 加载 cora 数据集。
+
+使用 TuGraph 提供的采样算子采样，并构建 GNN 模型。
+
+在 CPU 或 GPU 上训练用于点分类的 GNN 模型。
+
+此文档需要对图神经网络、DGL等使用有一定经验。
+
+## 2. 前置条件
+
+TuGraph图学习模块需要TuGraph-db 3.5.1及以上版本。
+
+TuGraph部署推荐采用Docker镜像tugraph-compile 1.2.4及以上版本:
+
+tugraph / tugraph-compile-ubuntu18.04:latest
+
+tugraph / tugraph-compile-centos7:latest
+
+tugraph / tugraph-compile-centos8:latest
+
+以上镜像均可在DockerHub上获取。
+具体操作请参考[快速上手](../3.quick-start/1.preparation.md)。
+
+## 3. Cora 数据集导入TuGraph数据库
+### 3.1. Cora 数据集介绍
+Cora 数据集由 2708 篇论文组成，分为 7 个类别。每篇论文由一个 1433 维的词袋表示，表示论文中的单词是否出现。这些词袋特征已经预处理，以从 0 到 1 的范围归一化。边表示论文之间的引用关系。
+
+TuGraph中已经提供了Cora数据集的导入工具，用户可以直接使用。
+
+### 3.2. 数据导入
+Cora数据集在test/integration/data/algo目录下，包含点集cora_vertices和边集cora_edge。
+
+首先需要将Cora数据集导入到TuGraph数据库中，详细操作可参考[数据导入](../6.utility-tools/1.data-import.md)。
+
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+然后进行数据导入：
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式,可参考test/integration/data/algo/cora.conf。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+
+## 4. feature特征转换
+由于Cora数据集中的feature特征为长度为1433的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+
+## 5. 编译采样算子
+采样算子用于从数据库中获取图数据并转换成所需数据结构，具体执行过程如下(如果TuGraph已编译，可跳过此步骤)：
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+```python
+from lgraph_db_python import *  # 导入tugraph-db的python接口模块
+import importlib  # 导入importlib模块
+getdb = importlib.import_module("getdb")  #获取getdb算子
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo) #调用getdb算子
+```
+
+如代码所示，得到算子so文件后，import 导入使用。
+
+## 6. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+训练详细过程如下：
+### 6.1.数据加载
+```python
+galaxy = PyGalaxy(args.db_path)
+galaxy.SetCurrentUser(args.username, args.password)
+db = galaxy.OpenGraph(args.graph_name, False)
+```
+如代码所示，根据图数据路径、用户名、密码和子图名称将数据加载到内存中。TuGraph可以载入多个子图用于图训练，在此处我们只载入一个子图。
+
+### 6.2.构建采样器
+训练过程中，首先使用GetDB算子从数据库中获取图数据并转换成所需数据结构，具体代码如下：
+```python
+    GetDB.Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+如代码所示，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+然后构建采样器
+```python
+    batch_size = 5
+    count = 2708
+    sampler = TugraphSample(args)
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(count),
+        sampler,
+        batch_size=batch_size,
+        num_workers=0,
+        )
+```
+
+### 6.3.对结果进行格式转换
+```python
+    src = EdgeInfo[0].astype('int64')
+    dst = EdgeInfo[1].astype('int64')
+    nodes_idx = NodeInfo[0].astype('int64')
+    remap(src, dst, nodes_idx)
+    features = NodeInfo[1].astype('float32')
+    labels = NodeInfo[2].astype('int64')
+    g = dgl.graph((src, dst))
+    g.ndata['feat'] = torch.tensor(features)
+    g.ndata['label'] = torch.tensor(labels)
+    return g
+```
+对结果进行格式转换，使之符合训练格式
+
+### 6.4.构建GCN模型
+```python
+class GCN(nn.Module):
+    def __init__(self, in_size, hid_size, out_size):
+        super().__init__()
+        self.layers = nn.ModuleList()
+        # two-layer GCN
+        self.layers.append(dgl.nn.GraphConv(in_size, hid_size, activation=F.relu))
+        self.layers.append(dgl.nn.GraphConv(hid_size, out_size))
+        self.dropout = nn.Dropout(0.5)
+
+    def forward(self, g, features):
+        h = features
+        for i, layer in enumerate(self.layers):
+            if i != 0:
+                h = self.dropout(h)
+            h = layer(g, h)
+        return h
+
+def build_model():
+    in_size = feature_len  #feature_len为feature的长度，在此处为1433
+    out_size = classes  #classes为类别数，在此处为7
+    model = GCN(in_size, 16, out_size)  #16为隐藏层大小
+    return model
+```
+本教程将构建一个两层图卷积网络（GCN）。每层通过聚合邻居信息来计算新的点表示。
+
+### 6.5.训练GCN模型
+```python
+loss_fcn = nn.CrossEntropyLoss()
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":   #如果需要保存模型，则给出模型保存路径
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+
+for epoch in range(50):
+    model.train()
+    total_loss = 0
+    loss = train(g, model)
+    if epoch % 5 == 0:
+        print('In epoch', epoch, ', loss', loss)
+    sys.stdout.flush()
+```
+如代码所示，根据定义好的采样器、优化器和模型进行迭代训练50次，训练后的模型保存至model_save_path路径中。
+
+输出结果如下：
+```bash
+In epoch 0 , loss 1.9586775302886963
+In epoch 5 , loss 1.543689250946045
+In epoch 10 , loss 1.160698413848877
+In epoch 15 , loss 0.8862786889076233
+In epoch 20 , loss 0.6973256468772888
+In epoch 25 , loss 0.5770673751831055
+In epoch 30 , loss 0.5271289348602295
+In epoch 35 , loss 0.45514997839927673
+In epoch 40 , loss 0.43748989701271057
+In epoch 45 , loss 0.3906335234642029
+```
+
+同时，图学习模块可采用GPU进行加速，用户如果需要再GPU上运行，需要用户自行安装相应的GPU驱动和环境。具体可参考learn/README.md。
+
+完整代码可参考learn/examples/train_full_cora.py
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/3.data_migration.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/3.data_migration.md
new file mode 100644
index 0000000000..df74c5c673
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/3.data_migration.md
@@ -0,0 +1,82 @@
+# 数据迁移
+
+## 1. 简介
+   数据迁移是指将数据从一个系统、存储介质或应用程序迁移到另一个系统、存储介质或应用程序的过程。当TuGraph要升级或者系统硬件环境发生变化时，
+需要对原TuGraph服务中的数据进行迁移。以系统硬件环境和软件版本为依据进行划分，本文将数据迁移分为三种方案：
+1. 兼容迁移：当迁移前后系统环境一致且TuGraph软件兼容时，可以直接使用备份恢复的方式迁移数据；
+2. 升级迁移：当迁移前后系统环境不一致或TuGraph软件不兼容时，需要使用先导出数据再重新导入的方式迁移数据；
+3. 在线迁移：当对高可用集群进行数据迁移且集群网络环境良好时，可以使用增删节点的的方式将原集群平滑切换到新集群。
+接下来本文将详细介绍这三种方案。
+
+## 2. 兼容迁移
+兼容迁移指的是在系统环境不变，且TuGraph软件版本兼容时，原服务的数据和存储过程可以在新服务中使用，所以可以直接迁移。
+用户可以先使用`lgraph_backup`工具备份数据，然后将数据传输到新机器中并重启服务。具体迁移步骤如下：
+
+### 2.1. 备份数据
+使用`lgraph_backup`工具备份数据
+```bash
+  lgraph_backup -s db -d db.bck
+```
+本步骤也可以直接使用`cp`命令，不过`cp`命令会拷贝一些多余的元数据，HA模式下也会拷贝raft的元数据导致迁移之后集群重启失败，
+因此建议数据迁移时使用`lgraph_backup`工具替代`cp`命令。
+
+### 2.2. 启动新服务
+使用如下命令启动新服务，存储过程会自动加载到新服务中
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d start
+```
+
+### 2.3. 停止原服务
+使用如下命令停止原服务
+```bash
+  lgraph_server -c /usr/local/etc/lgraph.json --directory db.bck -d stop
+```
+
+## 3. 升级迁移
+当用户要把原始服务迁移到一个差异化环境中（比如从centos7迁移到ubuntu18.04），或者TuGraph版本变化较大前后不兼容时（如3.4.0和3.6.0），
+用户可以先使用`lgraph_export`工具将数据导出成文件，传输到新机器中，再使用`lgraph_import`工具重新导入并重启集群。
+这样可以保证在新环境上能够使用，但是效率较低，存储过程也需要重新加载。具体的迁移步骤如下：
+
+### 3.1. 导出数据
+使用`lgraph_export`工具导出数据，并将数据传输到新机器上
+```bash
+  lgraph_export -d db -e db.export
+```
+
+### 3.2. 导入数据
+使用`lgraph_import`工具导入数据，并手动加载存储过程（详见[client操作步骤](../7.client-tools/2.cpp-client.md)）
+```bash
+  lgraph_import -c db.export/import.config -d db
+```
+
+### 3.3. 启动新服务
+使用如下命令启动新服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d start
+```
+
+### 3.4. 停止原服务
+使用如下命令停止原服务
+```bash
+   lgraph_server -c /usr/local/etc/lgraph.json --directory db.export -d stop
+```
+
+## 4. 在线迁移
+当对TuGraph高可用版本部署的服务器集群进行数据迁移时，如果网络带宽充足，可以直接使用增删节点的方式对服务进行在线迁移。具体迁移步骤如下所示：
+
+### 4.1. 拷贝数据
+使用如下命令拷贝leader节点上的数据，并且传输到新集群的机器节点上。由于leader节点上有最完整的raft日志，拷贝leader的数据可以最大程度地减少
+日志追赶的时间。
+```bash
+  cp -r db db.cp
+```
+### 4.2. 启动新节点
+使用如下命令将新节点加入集群，加入集群后，增量数据自动同步到新节点
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d start
+```
+### 4.3. 停止原节点
+停止原节点服务，后续应用请求直接发给新集群
+```bash
+  lgraph_server -c /usr/local/etc/lgraph_ha.json --directory db.cp --ha_conf 192.168.0.1:9090,192.168.0.2:9090,192.168.0.3:9090 -d stop
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/4.selection.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/4.selection.md
new file mode 100644
index 0000000000..dd635f6f27
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/4.selection.md
@@ -0,0 +1,33 @@
+# 环境和版本选择
+
+> 该文档介绍如何选择系统环境，以及部署方式
+
+## 1. 简介
+
+TuGraph为不同需求的用户提供了差异化的系统环境和部署方式，来满足新手、系统开发者、生产运维人员、研究人员等不同用户的需求。
+
+## 2. 环境能力选择
+
+用户可以根据实际使用场景，来选择不同的环境。编译环境的能力最完备，所需的第三方软件也越多。与其相对应的，精简运行环境几乎不需要安装任何依赖库，能运行TuGraph除存储过程外的基础功能。
+
+| 环境     | 用途             | 备注        |
+|--------|----------------|-----------|
+| 编译环境   | 从源码编译TuGraph   | 适用于开发人员   |
+| 运行环境   | 运行TuGraph安装包   | 适用于大部分用户  |
+| 精简运行环境 | 运行精简TuGraph安装包 | 对系运行统依赖较小 |
+
+不同环境的具体介绍参见 [链接](../5.installation&running/2.environment-mode.md)。
+
+## 3. 部署方式选择
+
+TuGraph部署仅需一台服务器（高可用模式需要多台），可根据实际资源情况和使用场景，选择适合的部署方式。
+
+| 部署方式     | 描述                   | 备注                                                                                      |
+|----------|----------------------|-----------------------------------------------------------------------------------------|
+| 云部署      | 阿里云计算巢一键部署，免费试用      | 新手适用，流程参考 [链接](../5.installation&running/5.cloud-deployment.md)              |
+| Docker部署 | 通过预先准备的Docker镜像跨平台部署 | 对硬件有要求的用户，比如性能测试，流程参考 [链接](../5.installation&running/3.docker-deployment.md) |
+| 本地部署     | 在现有系统紧耦合部署           | 指定生产环境适用，流程参考 [链接](../5.installation&running/4.local-package-deployment.md)  |
+
+## 4. 后续步骤
+
+部署完成后，后续可以进行[启动服务](../5.installation&running/7.tugraph-running.md)、[数据导入](../6.utility-tools/1.data-import.md)等操作，也可以通过[样例数据](../3.quick-start/2.demo/1.movie.md)来体验整个流程。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/5.spatial.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/5.spatial.md
new file mode 100644
index 0000000000..72f4dc020b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/5.spatial.md
@@ -0,0 +1,184 @@
+# 地理空间数据类型使用示例
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群。近年来，地理空间功能在图数据库中的应用价值显著，它不仅增强了数据的表达能力，还促进了跨领域数据的融合分析，尤其在社交网络、地图探索、城市规划等关键领域展现了强大的实用价值。TuGraph也正在逐步支持地理空间功能。
+
+## 2. 预备知识
+
+EPSG([EPSG.io: Coordinate Systems Worldwide](https://epsg.io/)) 是一个标准化的地理空间参考系统标识符集合， 用于标识不同的地理空间参考系统，包括坐标系统、地理坐标系、投影坐标系等。我们常用EPSG编码表示数据的坐标系，这里我们介绍两种最常见的空间地理坐标系，也是大部分数据库支持的坐标系类型。
+
+### 2.1 WGS84坐标系 EPSG: 4326
+
+全球GPS定位系统: WGS84是全球定位系统(GPS)的基础，允许全球的GPS接收器确定精确位置。几乎所有现代GPS设备都是基于WGS84坐标系来提供位置信息。地图制作和地理信息系统(GIS): 在地图制作和GIS领域，WGS84被广泛用于定义地球上的位置。这包括各种类型的地图创建、空间数据分析和管理等。![image.png](../../../images/spatail/EPSG_4326.png)
+
+### 2.2 Cartesian(笛卡尔)坐标系 EPSG: 7203
+
+直角坐标系，是一种最基本、最广泛应用的坐标系统。它通过两条数轴定义一个平面，三条数轴定义一个空间，这些轴互相垂直，在数学、物理、工程、天文和许多其他领域中有着广泛的应用。![image.png](../../../images/spatail/EPSG_7203.png)
+
+### 2.3 数据存储格式
+
+OGC(Open Geospatial Consortium) 定义了空间数据的标准表示格式，分别为WKT与WKB格式，用于在不同系统和平台之间交换和存储空间数据，现已被广泛采用。其中WKT(well-kown text)格式, 是一种文本标记语言,易于人类阅读和编写，而WKB(Well-Known Binary)格式采用一系列字节来编码空间数据，更适合在计算机中存储;
+
+**WKT:**
+
+```
+POINT(<x> <y>)
+LINESTRING(<x1> <y1>, <x2><y2>, ...)
+```
+
+WKT格式的数据如上例所示，先指定空间数据类型，再在括号内指定具体的坐标，一个坐标对表示一个点，每个坐标对之间用逗号隔开。对于Polygon类型的数据，第一个坐标对需要与最后一个坐标对相同，形成闭合的面。
+
+**WKB:**
+
+![image.png](../../../images/spatail/WKB.png)
+
+
+针对EWKB格式的编码，说明如下:
+
+- 第0 - 1位: 编码方式;
+- 第2 - 5位: 空间数据类型;
+    - 0100: point
+    - 0200: linestring
+    - 0300: polygon
+- 第6 - 9位: 数据维度;
+    - 0020: 二维
+    - 0030: 三维
+- 第10 - 17位: 坐标系的EPSG编码;
+- 第18 - n位: double类型的坐标对的16进制表示。
+
+### 2.4 常用函数
+
+| Name                 | Description           | Signature                                                                 |
+|----------------------|-----------------------|---------------------------------------------------------------------------|
+| `dbms.graph.createGraph` | 创建子图           | `dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)` |
+| `db.createVertexLabel`  | 创建Vertex Label      | `db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)`      |
+| `db.getLabelSchema`     | 列出label schema      | `db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)` |
+| `db.deleteLabel`        | 删除Vertex            | `db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)`         |
+
+更完整详细的函数使用以及插入数据的语句，可以参考 [Cypher API](../8.query/1.cypher.md)
+
+## 3. 数据类型
+
+目前在TuGraph中，我们已经支持了Point, Linestring与Polygon三种类型:
+
+- Point：点    point(2.0, 2.0, 7203)
+- Linestring：折线 LINESTRING(0 2,1 1,2 0)
+- Polygon：多边形  POLYGON((0 0,0 7,4 2,2 0,0 0))
+
+其中坐标点都是double型，创建图模型和插入数据示例如下：
+
+**创建标记美食位置的点模型**
+
+```
+CALL db.createVertexLabel('food', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true) 
+```
+
+![image.png](../../../images/spatail/createVertexLabel.png)
+
+**插入标记美食点的数据**
+
+```
+ CREATE (n:food {id:10001, name: 'aco Bell',pointTest:point(3.0,4.0,7203)}) RETURN n
+```
+
+![image.png](../../../images/spatail/createFoodData.png)
+
+**创建具有折线属性的点模型**
+
+```
+CALL db.createVertexLabel('lineTest', 'id', 'id', int64, false, 'name', string, true,'linestringTest',linestring,true)
+```
+
+![image.png](../../../images/spatail/createVertexLabel_lineTest.png)
+
+**插入具有折线属性的点数据**
+
+```
+CREATE (n:lineTest {id:102, name: 'Tom',linestringTest:linestringwkt('LINESTRING(0 2,1 1,2 0)', 7203)}) RETURN n
+```
+
+![image.png](../../../images/spatail/createLineTestData.png)
+
+**创建具有多边型属性的点模型**
+
+```
+CALL db.createVertexLabel('polygonTest', 'id', 'id', int64, false, 'name', string, true,'polygonTest',polygon,true)
+```
+
+![image.png](../../../images/spatail/createVertexLabel_PolygonTest.png)
+
+**插入具有多边型属性的点数据**
+
+```
+CREATE (n:polygonTest {id:103, name: 'polygonTest',polygonTest:polygonwkt('POLYGON((0 0,0 7,4 2,2 0,0 0))', 7203)}) RETURN n
+```
+
+## 4. 函数介绍
+
+| 函数名  | 描述 | 输入参数                         | 返回值类型 |
+| --- | --- |------------------------------| --- |
+| Distance() | 计算两个空间数据间的距离(要求坐标系相同) | Spatial data1, Spatial data2 | double |
+| Disjoint()  |  判断两个空间数据是否相交（开发中） | Spatial data1, Spatial data2 | bool |
+| WithinBBox() | 判断某个空间数据是否在给定的长方形区域内（开发中） | Spatial data, Point1         | bool |
+
+## 5. 美食探索
+### 5.1 基于地理位置的个性化推荐
+
+在本章节中，我们将探索如何利用Tugraph图数据库的地理空间功能，构建一个生动有趣的美食探索应用，将“人”与“美食”通过地理位置紧密相连，实现个性化美食推荐。想象一下，无论身处何方，只需轻轻一点，周围诱人美食便尽收眼底，这正是我们即将构建的场景魅力所在。
+
+### 5.2 数据模型设计
+我们首先定义两种核心节点类型：
+
+- Food（美食）节点：每一家餐厅或小吃店都可以作为一个Food节点，其属性包括但不限于名称、地址、评分、美食类别等。特别地，我们将在每个Food节点上附加地理坐标信息，用以精确记录其地理位置。
+
+```
+ CALL db.createVertexLabel('food', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true,'mark',double,true)
+```
+
+准备数据：
+
+```
+CREATE (n:food {id:10001, name: 'Starbucks',pointTest:point(1.0,1.0,7203),mark:4.8}) RETURN n
+CREATE (n:food {id:10002, name: 'KFC',pointTest:point(2.0,1.0,7203),mark:4.5}) RETURN n
+CREATE (n:food {id:10003, name: 'Pizza Hut',pointTest:point(2.0,5.0,7203),mark:4.5}) RETURN n
+CREATE (n:food {id:10004, name: 'Taco Bell',pointTest:point(3.0,4.0,7203),mark:4.7}) RETURN n
+CREATE (n:food {id:10005, name: 'Pizza Fusion',pointTest:point(5.0,3.0,7203),mark:4.9}) RETURN n
+CREATE (n:food {id:10006, name: 'HaiDiLao Hot Pot',pointTest:point(2.0,2.0,7203),mark:4.8}) RETURN n
+CREATE (n:food {id:10007, name: 'Lao Sze Chuan',pointTest:point(4.0,3.0,7203),mark:4.7}) RETURN n
+```
+
+- Person（人物）节点：代表应用的用户，属性包含用户名、当前位置等。用户的当前位置同样通过地理坐标表示，便于后续的地理空间查询。
+
+```
+ CALL db.createVertexLabel('person', 'id', 'id', int64, false, 'name', string, true,'pointTest',point,true)
+```
+
+准备数据：
+
+```
+ CREATE (n:person {id:1, name: 'Tom',pointTest:point(3.0,3.0,7203)}) RETURN n
+```
+
+### 5.3 构建美食探索查询
+
+能够根据用户的当前位置，寻找距离2.5以内的美食,根据距离进行升序排列。返回距离和评分让用户得倒更好的体验。
+
+**查询语句**
+
+```
+match (n:person{id:1}),(m:food) with n.pointTest as p1,m.pointTest as p2,m.name as food,m.mark as mark
+CALL spatial.distance(p1,p2) YIELD distance 
+WHERE distance<2.5
+RETURN food,distance,mark ORDER by distance
+```
+
+![image.png](../../../images/spatail/querryFood.png)
+
+此查询首先匹配特定的Person节点（以用户名“Tom”为例），然后找到所有Food节点，利用自定义的distance函数，计算Person节点当前位置与每个Food节点之间的直线距离，筛选出距离在2.5之内的美食。最后，按照美食的距离升序排列结果，附带评分参考，为用户提供最优质的推荐。
+
+## 6. 展望
+
+通过上述章节，我们不仅展示了TuGraph在地理空间数据处理的能力，也描绘了一个富有吸引力的美食探索场景，证明了图数据库在结合地理位置信息进行个性化服务方面具有巨大潜力。无论是寻找周末的休闲去处，还是探索旅行途中的特色美食，这样的应用都将极大地丰富人们的生活体验。
+
+TuGraph将来会继续实现Disjoint() 、WithinBBox()，会丰富更多使用场景。当然，也欢迎大家一起参与，共同开发地理空间功能。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/index.rst
new file mode 100644
index 0000000000..dc5546f1d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/13.best-practices/index.rst
@@ -0,0 +1,9 @@
+最佳实践
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/14.faq.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/14.faq.md
new file mode 100644
index 0000000000..596cab6378
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/14.faq.md
@@ -0,0 +1,59 @@
+# FAQ
+
+在 TuGraph 使用过程中，如果遇到问题可优先查看[用户文档](https://github.com/TuGraph-family/tugraph-db/tree/master/doc/zh-CN) 。其次，请查看如下 FAQ 列表是否能够匹配您的问题。
+
+1. **[内核引擎 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussion-4575385)**
+
+   1.1 [TuGraph 的边是否支持索引？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165379)
+
+   1.2 [TuGraph 单机的 QPS 是多少？](https://github.com/TuGraph-family/tugraph-db/discussions/113#discussioncomment-4165388)
+2. **[TuGraph Browser QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussion-4575381)**
+
+   2.1 [可视化文件 build 后如何更新到 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165364)
+
+   2.2 [如何通过 npm run dev，连接已有的 TuGraph 服务？](https://github.com/TuGraph-family/tugraph-db/discussions/111#discussioncomment-4165366)
+
+   2.3 [3.3.0 版本 TuGraph Browser 删除 node label 失败？](https://github.com/TuGraph-family/tugraph-db/discussions/82#discussion-4465791)
+3. **[客户端 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussion-4575378)**
+
+   3.1 [Client 目前有哪些编程语言，是否支持 Node.js？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165351)
+
+   3.2 [Python Client 是否支持 pip install？Client 在哪里进行引用？](https://github.com/TuGraph-family/tugraph-db/discussions/109#discussioncomment-4165353)
+
+4. **[数据导入 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussion-4575373)**
+
+   4.1 [TuGraph 可以对接哪些常用数据库？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165335)
+
+   4.2 [如何进行数据导入？](https://github.com/TuGraph-family/tugraph-db/discussions/107#discussioncomment-4165336)
+5. **[存储过程 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussion-4575369)**
+
+   5.1 [如何加载存储过程或算法包？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165313)
+
+   5.2 [如何调用或执行存储过程？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165317)
+
+   5.3 [开源内置的算法包在哪里？](https://github.com/TuGraph-family/tugraph-db/discussions/105#discussioncomment-4165322)
+6. **[安装部署 QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussion-4575364)**
+
+   6.1 [如何使用 docker 镜像安装？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165287)
+
+   6.2 [rpm 包和 deb 包安装后，启动 lgraph_server 服务，提示缺少'liblgraph.so'报错？](https://github.com/TuGraph-family/tugraph-db/discussions/103#discussioncomment-4165289)
+
+   6.3 [如何在 Mac 的 M1 芯片上编译 TuGraph？](https://github.com/TuGraph-family/tugraph-db/discussions/47#discussion-4393165)
+
+   6.4 [安装报错 jemalloc: Unsupported system page size 该如何处理？](https://github.com/TuGraph-family/tugraph-db/issues/477)
+7. **[Cypher QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussion-4575018)**
+
+   7.1 [是否支持不定长边的条件查询？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165252)
+
+   7.2 [如何查询最短路径，shortestPath 函数如何使用？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165256)
+
+   7.3 [查询语句 Where 后使用 and 进行拼接查询速度较慢，语句应如何优化改进？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165260)
+
+   7.4 [如何查询任意跳的边？](https://github.com/TuGraph-family/tugraph-db/discussions/102#discussioncomment-4165262)
+
+   7.5 [Cypher 是否 date()函数？](https://github.com/TuGraph-family/tugraph-db/discussions/91#discussion-4482858)
+8. **[Jwt Token QA 汇总](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussion-5574402)**
+
+   8.1 [报错“User has reached the maximum number of tokens”后该如何处理？](https://github.com/TuGraph-family/tugraph-db/discussions/282#discussioncomment-6861785)
+
+如果问题仍然无法得到解决，我们推荐您在[Discussions](https://github.com/TuGraph-family/tugraph-db/discussions)跟帖或发起新贴来描述您的问题。同时 TuGraph QA 大汇总也会根据大家在讨论区发起的帖子，进行定期的更新。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/15.contacts.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/15.contacts.md
new file mode 100644
index 0000000000..787d8c1e49
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/15.contacts.md
@@ -0,0 +1,17 @@
+# 联系方式
+
+您有任何对产品的意见和建议，欢迎通过以下联系方式加入讨论，或提出建议。
+
+官网: [tugraph.tech](https://tugraph.tech)
+
+Github Issue (错误反馈、功能讨论)
+[Issue](https://github.com/TuGraph-db/tugraph-db/issues)
+
+Github Discussions (技术讨论)
+[Discussions](https://github.com/TuGraph-db/tugraph-db/discussions)
+
+Slack (在线开发沟通):
+[TuGraph.slack](https://join.slack.com/t/tugraph/shared_invite/zt-1hha8nuli-bqdkwn~w4zH1vlk0QvqIfg)
+
+通过钉钉群、微信群、微信公众号、邮箱和电话联系我们:
+![contacts](../../images/contact-zh.png)
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/1.what-is-graph.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/1.what-is-graph.md
new file mode 100644
index 0000000000..4cbe4ce767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/1.what-is-graph.md
@@ -0,0 +1,13 @@
+# 什么是图
+
+> 本文面向初学者，介绍图（Graph）的基本概念。
+
+我们今天介绍的图，是图论中使用点和边表示的图（Graph），而非图像的图（Image）。
+
+![alt what is graph](../../../images/what-is-graph.png)
+
+图的基本元素是点和边，其中点表示事物或实体，边表示点之间的关联关系。
+
+如上图左侧所示，点表示的有公司、员工、项目。边表示的是他们之间的关系，包括：公司和员工之间的雇佣关系，员工和员工之间的好友关系，项目和员工之间的参与关系。除此之外，点和边上可以附加属性，比如员工的工号，雇佣的时间，这样的图是属性图。也就是说，我们可以用图的方式来抽象地表示实体及其关联关系，图有非常丰富的表达能力。
+
+除了上述的员工图谱，图还可以用于金融、工业、医疗等各个领域。在实际应用中，图的规模越来越大，比如金融交易图，点边规模可能到达百亿，与其同时，基于图的查询通常会复杂，最典型的是K跳查询，每增加一跳访问的数据都呈指数增长。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/2.what-is-gdbms.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/2.what-is-gdbms.md
new file mode 100644
index 0000000000..eeb4dfd11f
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/2.what-is-gdbms.md
@@ -0,0 +1,34 @@
+# 什么是图数据库
+
+> 本文主要介绍什么是图数据库，图数据库相比于关系型数据库的优势，以及两者特点的对比。
+
+## 1. 图数据库介绍
+
+图数据库是基于图模型的数据库。与关系型数据库相比，图数据库真正注重“关系”。图数据库的主要功能是管理图数据，因此需要支持高效的点、边查询和更新；为方便用户使用，通常还需要增加对事务（transaction）的支持，以确保并发操作下的正常运行。
+
+## 2. 图数据库相比较于关系型数据库的优势
+
+图数据库的功能是传统关系型数据库的扩展。与关系型数据库仅支持的“表结构”相比，图数据库所支持的“图结构”更为灵活。图数据库在基于图的增加、删除、查询和修改方面采用不同于其他数据库的设计。在图数据操作抽象上，采用基于点的视角，例如点通过其所有“出边”（从一个点出发，连接到其他点的边）访问其邻接点。这是图数据库系统设计的核心。
+
+图数据库的独特性体现在以下三个方面:
+
+### 2.1. 性能
+
+在关联关系处理上，使用关系型数据库不可避免地要使用表的JOIN操作，这会对性能产生较大影响；而图数据库则直接跳转访问类指针，操作关联数据的效率更高，比关系型数据库提高2到4个数量级的性能。
+
+### 2.2. 兼容性
+
+现实中，项目进程通常不断演变，数据的内容甚至数据格式也在不断变化。在关系型数据库中，这意味着表结构的变化或建立多个新表，对源数据的修改非常大。而在图数据库中，仅需添加新的点、边和属性，并将其设置为对应的类型即可。从本质上说，一个表代表一种类型的数据，一个点代表一个特定的数据。这意味着关系型数据库更关注数据类型，而图数据库更关注数据个体及其关联关系。
+
+### 2.3. 直观性
+
+使用图的方式表达现实世界的关系更直接和自然，在万物互联的时代尤为突出。如果使用关系型数据，先建立实体表，再建立关系表，最后映射数据，需要高度的抽象思维。在图数据上进行分析查询时，可以直观地通过点边连接的拓扑结构找到所需数据，无需任何专业知识。
+
+## 3. 图数据库与关系型数据库对比
+
+| 分类         | 模型   | 优势                                   | 劣势                                     | 举例           |
+| ------------ | ------ | -------------------------------------- | ---------------------------------------- | -------------- |
+| 关系型数据库 | 表结构 | 数据高度结构化，一致性强，软件成熟度高 | 面向多跳的关联关系查询低效或不支持       | MySQL、Oracle  |
+| 图数据库     | 图结构 | 针对关联关系的建模建模和操作效率非常高 | 高度结构化的数据处理能力不及关系型数据库 | Neo4j、TuGraph |
+
+总之，面对海量数据的存储和处理问题，传统的关系数据库已经无法满足大部分的日常数据存储需求。图数据库技术可以将关系信息存储为实体，灵活拓展数据模型。由于提供了对关联数据最直接的表达方式和图模型对异构数据的天然包容性，图数据库技术必将成为未来最热点的技术之一，为企业提供存储和分析大规模图数据的有力支持。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/3.what-is-tugraph.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/3.what-is-tugraph.md
new file mode 100644
index 0000000000..41ed5c6aa5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/3.what-is-tugraph.md
@@ -0,0 +1,49 @@
+# 什么是TuGraph
+
+> 本文主要介绍TuGraph社区版的主要功能和特性，以及TuGraph企业版和社区版的差异。
+
+## 1. 简介
+
+TuGraph图数据库由蚂蚁集团与清华大学联合研发，构建了一套包含图存储、图计算、图学习、图研发平台的完善的图技术体系，拥有业界领先规模的图集群，解决了图数据分析面临的大数据量、高吞吐率和低延迟等重大挑战，是蚂蚁集团金融风控能力的重要基础设施，显著提升了欺诈洗钱等金融风险的实时识别能力和审理分析效率，并面向金融、工业、政务服务等行业客户。
+
+## 2. TuGraph社区版
+
+2022年9月，TuGraph单机版开源，提供了完备的图数据库基础功能和成熟的产品设计，支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台。
+
+TuGraph社区版于2022年9月开源，提供了完整的图数据库基础功能和成熟的产品设计（如ACID兼容的事务、编程API和配套工具等），适用于单实例部署。社区版支持TB级别的数据规模，为用户管理和分析复杂关联数据提供了高效、易用、可靠的平台，是学习TuGraph和实现小型项目的理想选择。
+
+## 3. TuGraph特性
+
+TuGraph是支持大数据量、低延迟查找和快速图分析功能的高效图数据库。TuGraph也是基于磁盘的数据库，支持存储多达数十TB的数据。TuGraph提供多种API，使用户能够轻松构建应用程序，并使其易于扩展和优化。
+
+它具有如下功能特征：
+
+- 属性图模型
+- 实时增删查改
+- 多重图（点间允许多重边）
+- 多图（大图与多个子图）
+- 完善的ACID事务处理，隔离级别为可串行化（serializable）
+- 点边索引
+- 混合事务和分析处理（HTAP），支持图查询、图分析、图学习
+- 主流图查询语言（OpenCypher、ISO GQL等）
+- 支持OLAP API，内置30多种图分析算法
+- 基于C++/Python的存储过程，含事务内并行Traversal API
+- 提供图可视化工具
+
+在性能和可扩展性方面的支持：
+
+- 千万点/秒的高吞吐率
+- TB级大容量
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线的备份恢复
+
+## 4. TuGraph企业版
+
+企业版对商业化功能支持更加完善，包括分布式集群架构，覆盖探索、研发、服务、运维管理全生命周期的一站式图平台，在线、近线、离线的图计算引擎，支持流式、大数据类数据源，多地多中心的部署形态，以及专家支持服务等。企业版是商业化解决方案的理想选择。
+
+如需商业支持，请联系我们：
+
+- 电话：400-903-0809
+- 邮件：tugraph@service.alipay.com
+- 官网：https://tugraph.antgroup.com
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/4.schema.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/4.schema.md
new file mode 100644
index 0000000000..0433420751
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/4.schema.md
@@ -0,0 +1,158 @@
+# TuGraph图模型说明
+## 1. 数据模型
+
+### 1.1. 图模型
+
+TuGraph是一个具备多图能力的强类型、有向属性图数据库。
+
+- 图项目：每个数据库服务可以承载多个图项目（多图），每个图项目可以有自己的访问控制配置，数据库管理员可以创建或删除指定图项目。
+- 点：指实体，一般用于表达现实中的实体对象，如一部电影、一个演员。
+    - 主键：用户自定义的点数据主键，默认唯一索引，在对应的点类型中唯一。
+    - VID：点在存储层自动分配图项目中的唯一ID，用户不可修改。
+    - 上限：每个图项目存储最多2^(40)个点数据。
+- 边：用于表达点与点之间的关系，如演员出演电影。
+    - 有向边：边为有向边。若要模拟无向边，用户可以创建两个方向相反的边。
+    - 多条边：两个点数据之间可以有多条边数据。当前TuGraph支持重复边，如要确保边边唯一，需要通过业务策略实现。
+    - 上限：两个点数据之间存储最多2^(32)条边数据。
+- 属性图：点和边可以具有与其关联的属性，每个属性可以有不同的类型。
+- 强类型：每个点和边有且仅有一个标签，创建标签后，修改属性数量及类型有代价。
+    - 指定边的起/终点类型：可限制边的起点和终点点类型，支持同类型边的起点和终点的点类型不同，如个人转账给公司、公司转账给公司；当指定边的起/终点类型后，可增加多组起/终点类型，不可删除已限制的起/终点类型。
+    - 无限制模式：支持不指定边的起点和终点的点类型，任意两个点类型间均可创建该类型的边数据。注：当指定边的起/终点类型后无法再采用无限制模式。
+
+### 1.2. 数据类型
+
+TuGraph支持多种可用于属性的数据类型。具体支持的数据类型如下：
+
+| **数据类型** | **最小值**          | **最大值**          | **描述**                            |
+| ------------ | ------------------- | ------------------- | ----------------------------------- |
+| BOOL         | false               | true                | 布尔值                              |
+| INT8         | -128                | 127                 | 8位整型                          |
+| INT16        | -32768              | 32767               | 16位整型                         |
+| INT32        | - 2^31              | 2^31 - 1            | 32位整型                         |
+| INT64        | - 2^63              | 2^63 - 1            | 64位整型                         |
+| DATE         | 0000-00-00          | 9999-12-31          | "YYYY-MM-DD" 格式的日期             |
+| DATETIME     | 0000-00-00 00:00:00.000000 | 9999-12-31 23:59:59.999999 | "YYYY-MM-DD HH:mm:ss[.ffffff]" 格式的日期时间 |
+| FLOAT        |                     |                     | 32位浮点数                       |
+| DOUBLE       |                     |                     | 64位浮点数                       |
+| STRING       |                     |                     | 不定长度的字符串                    |
+| BLOB         |                     |                     | 二进制数据（在输入输出时使用Base64编码） |
+| POINT        |                     |                     | EWKB格式数据，表示点              |
+| LINESTRING   |                     |                     | EWKB格式数据，表示线              |
+| POLYGON      |                     |                     | EWKB格式数据，表示面(多边形)       |
+| FLOAT_VECTOR |                     |                     | 包含32位浮点数的动态向量               |
+
+### 1.3. 索引
+
+TuGraph支持对点或边的属性创建索引，以提升查询效率。其特点如下：
+- 索引包括普通索引和组合索引，普通索引基于一个点或边的一个属性创建，而组合索引基于一个点或边的多个属性创建（不超过16个），可以对同一点或边的多个（组）属性创建索引。
+- 如果为点标签创建了唯一索引，在修改该标签的点时，会先执行数据完整性检查，以确保该索引的唯一性。
+- BLOB类型的属性不能建立索引。
+
+TuGraph的点边均有多种索引类型，不同的索引类型的功能和限制不同，具体如下：
+
+#### 1.3.1 普通索引
+##### 1.3.1.1 点索引
+###### 1.3.1.1.1 unique索引
+
+点的unique索引指的是全局唯一的索引，即若一个属性设置了unique索引，在同一个图中，相同label的点的该属性不会存在相同的值，
+unique索引key的最大长度是480bytes，**超过480bytes的属性不能建立unique索引**。
+primary作为特殊的unique索引，因此最大key的长度也是480bytes。
+
+###### 1.3.1.1.2 non_unique索引
+
+点的non_unique索引指的是非全局唯一的索引，即若一个属性设置了non_unique索引，
+在同一个图中，相同label的点的该属性可以存在相同的值。
+由于non_unique索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组vid的最大值。
+每个vid是5bytes长度，因此non_unique索引key最大长度是475bytes。
+但是，不同于unique索引，超过475bytes也可以建立non_unique索引。
+只不过在对这样的属性建立索引时会只截取**前475bytes**作为索引key（属性本身存储的值不受影响）。
+并且，在通过迭代器遍历时，也是先自动截取查询值的前475bytes再进行遍历，
+所以结果可能和预期不一致，需要用户再过滤。
+
+##### 1.3.1.2 边索引
+
+###### 1.3.1.2.1 unique索引
+
+和点类似，边的unique索引指的是全局唯一的索引，即若一个属性设置了unique索引，在同一个图中，相同label的边的该属性不会存在相同的值，
+unique索引key的最大长度是480bytes，**超过480bytes的属性不能建立unique索引**。
+
+###### 1.3.1.2.2 pair_unique索引
+
+pair_unique索引指的是两点间的唯一索引，即若一个属性设置了unique索引，在同一个图的同一组起点和终点之间，
+相同label的边的该属性不会存在相同的值。为了保证pair_unique索引key在同一组起点和终点之间不重复，
+索引在用户指定的key后面加上了起点和终点的vid，每个vid是5bytes长度。
+因此最大key的长度是470bytes，**超过470bytes的属性不能建立pair_unique索引**。
+
+###### 1.3.1.2.3 non_unique索引
+
+和点类似，边的non_unique索引指的是非全局唯一的索引，即若一个属性设置了non_unique索引，
+在同一个图中，相同label的边的该属性可以存在相同的值。
+由于non_unique索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组eid的最大值。
+每个eid是24bytes长度，因此non_unique索引key最大长度是456bytes。
+但是，不同于unique索引，超过456bytes也可以建立non_unique索引。
+只不过在对这样的属性建立索引时会只截取**前456bytes**作为索引key（属性本身存储的值不受影响）。
+并且，在通过迭代器遍历时，也是先自动截取查询值的前456bytes再进行遍历，
+所以结果可能和预期不一致，需要用户再过滤。
+
+#### 1.3.2 组合索引
+
+目前只支持对点的多个属性建立组合索引，不支持对边的属性建立组合索引。组合索引支持唯一索引和非唯一索引两种类型，建立索引的要求如下：
+1. 建立组合索引的属性个数在2到16个之间（含）
+2. 唯一组合索引的属性长度之和不能超过480-2*(属性个数-1)字节，非唯一组合索引的属性长度之和不能超过475-2*(属性个数-1)字节
+
+##### 1.3.2.1 唯一索引
+
+和点的普通唯一索引类似，点的组合唯一索引指的是全局唯一的索引，即若一组属性设置了unique索引，
+在同一个图中，相同label的点的该组属性不会存在相同的值。
+由于底层存储设计，组合索引key需要保存属性的长度，因此，
+组合唯一索引key的最大长度是480-2*(属性个数-1) bytes，**超过的属性不能建立唯一索引**。
+
+##### 1.3.2.2 非唯一索引
+
+和点的普通非唯一索引类似，点的非唯一索引指的是非全局唯一的索引，即若一组属性设置了非唯一索引，
+在同一个图中，相同label的点的该组属性可以存在相同的值。
+由于非唯一索引一个key可能映射到多个值，为了加速查找和写入，
+在用户指定的key后面加上了索引key相同的一组vid的最大值。
+每个vid是5bytes长度，因此non_unique索引key最大长度是475-2*(属性个数-1) bytes，
+**超过的属性不能建立非唯一索引**。
+
+## 2. 图项目、点、边、属性命名规则和建议
+
+### 2.1 命名规则
+图项目、点、边和属性是识别符。该节描述了在TuGraph中识别符的允许的语法。
+下面的表描述了每类识别符的最大长度和允许的字符。
+
+|**识别符** |**长度** |**允许的字符**|
+|---------  |---------  |---------  |
+|用户、角色、图项目	|1-64字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+|点类型、边类型、属性	|1~256字符	|允许中文、字母、数字、下划线，且首字符不为数字|
+
+### 2.2 使用限制
+
+|**描述**|	**最大个数**|
+|-------- |--------- |
+|用户数、角色数	|65536|
+|图项目的个数	|4096|
+|每个图项目的点和边类型数量之和	|4096|
+|每个点或边类型的属性数量	|1024|
+
+注：
+1、特殊字符和关键字说明：使用特殊字符或非保留关键字时，需要使用反单引号/backquote（``）进行引用；
+
+示例： ```match (`match`:match) return `match`.id limit 1```
+
+2、大小写敏感性：TuGraph大小写敏感；
+
+3、图项目、点/边、属性名称之间可以重复使用，同一点或边下的属性名称不可以重复；
+
+4、属性名字保留关键字：SRC_ID / DST_ID / SKIP
+
+
+### 2.3 命名建议
+|**识别符**|**描述**|**建议**|
+|-------|-------|--------|
+|图项目	|字母或中文开头	|如graph123、project123等|
+|点/边类型	|字母或中文开头，使用下划线区分单词	|如person、act_in等|
+|属性	|字母或中文	|如name、age等|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
new file mode 100644
index 0000000000..ddb01d4a54
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/1.performance-oriented.md
@@ -0,0 +1,50 @@
+# 性能优先
+
+> 此文档主要介绍 TuGraph 性能优先的设计理念。
+
+## 1.简介
+
+TuGraph目前是世界上最快的图数据库，在图数据库标准评测LDBC SNB Interactive位居榜首（2023.3）。TuGraph的设计基于性能优先，致力于打造高性能的单机图数据库。该文档是TuGraph基于性能优先在存储层的核心设计。
+
+## 2.图操作的特性
+
+在属性图上的操作涉及读、写及其属性，对一些特殊的属性比如时间戳也访问模式也会影响到整体性能。这里通过对一些图操作特性的规律总结，来指导最终的性能。
+
+我们观察到很多图应用有类似的数据访问模式。例如，在信贷风险控制中，我们使用递归路径过滤搜索多对一模式，以找到可疑的信用欺诈用户和行为。针对网络赌博，可以通过识别短时间内的多笔资金转移，来发现涉赌的资金账号。股权穿透场景对实体间的股权关系进行递归计算。这些场景具有多跳实体和关系访问、时间窗口约束和读写事务等常见模式。
+更进一步，从介绍中的讨论和图负载的分析中，归纳出以下特征:
+
+**规律一** KHop是图中最典型的操作，它基于点和边的图拓扑的数据访问模式，和关系型数据库有着本质的区别。KHop 的典型性除了表现在数据访问模式不同，它同时也是图数据库最需要关注的性能点。
+
+**规律二** 图负载的数据访问在拓扑上有一定的局部性，同一个点的边通常会被同时访问。当这些边的标签相同时，有更大的概率会被同时访问。
+
+**规律三** 图负载在访问点边时，通常会访问其对应的属性，来作为遍历过滤的条件。
+
+**规律四** 在基于时序的图负载，对点边的过滤通常是在某个时间范围，比如最近的一周。
+
+**规律五** 写操作可能伴随着大量的读操作，需要在单个事务周期里处理。
+
+通过对实际线上图应用的分析，图负载的读写比率大约为 20:1，虽然场景局限在金融场景，集群数也有限，但涉及的数据规模和用户量非常庞大，具有一定代表性。20:1 的图负载读写比率，说明读工作负载对整体性能的影响更大， 而写工作负载的性能也不能忽视。
+
+## 3.存储数据结构
+
+TuGraph底层采用B+树来支持实时的增删查改事务。
+
+在排序树的数据结构中，B+树和LSM树为主要代表。B+树在树节点中使用拆分和合并式来更新排序数据，而 LSM 树在日志中追加更新，以进行延迟数据合并。B+ 早期用在文件系统的实现中，通过将数据保存 在自适应长度的叶子节点中，解决硬盘顺序操作和随机操作性能存在数据量级差别的问题，有较均衡的读写性能。LSM 树的主要优势使用 WAL(Write Ahead Log) 进行更新，将更新操作变成顺序操作，在键值较小时性能优势尤为突出。WAL 意味着将数据的更新合并推迟，批量更新能提升综合效率，也使得系统的调度变得复杂。如果更新合并完成前，恰好对其中的数据继续读取，LSM 树就需要读取几个层级局部合并的日志，会导致读取放大和空间放大，从而影响读效率。
+
+总结来说，B+ 树有较好的顺序读写性能，而 LSM 树在数据随机写方面占优。此外 LSM 树采用后台合并的方式，使得性能的波动难以预期，性能波动和上层存储和计算的关联性较弱，增加了整体设计的成本。综上考虑，TuGraph 选用 B+ 树作为读性能优先的实现。
+
+## 4.数据编码
+
+对于属性图模型而言，除了图拓扑编码外，属性数据也会很大程度影响功能和性能，我们先讨论属性数据如何与拓扑数据共存的编码格式。从目前的调研来看，属性编码有两种方式，我们称之为基于指针索引将属性数据单独存储的离散编码，和将属性数据和拓扑数据打包在一起的紧凑编码。离散编码根据程度的不同，可以每个属性都单独存储，或者每条边的属性打包后各自存储，下面的讨论对两种情况都适用。
+
+点查询。属性编码主要针对边，不涉及点查询。
+
+单边查询。离散编码通过指针定位边，紧凑编码则需要二分查找定位边的位置，离散编码有略微的优势。
+
+边遍历。离散编码在边遍历过程需要不断地进行指针跳转进行随机数据访问，而紧凑编码提前把数据排列在一起，顺序访问的特性使得效率大大提升。 由规律三知对边的遍历操作很普遍，紧凑编码在边遍历的优势明显。
+
+单边更新。离散编码对边的更新仅需找到对应的指针位置，插入数据后修改前后指针指向。紧凑编码则需要对紧凑排列的数据进行重编码，对整个边值进行重新写入，开销显著大于离散编码的情形。
+
+批量边更新。批量更新可以在内存中预先构建点的所有边属性，一次性编码写入，离散编码和紧凑编码相当。但紧凑编码不需要存储指针变量，更少的存储空间效率也会更高。
+
+以上离散编码和紧凑编码在某一类的查询的性能问题，可以通过优化的来缓解。整体上说，由于图负载读写 20:1 的特性，读性能在整体性能中占比更高。以及规律三所揭示的对属性访问的特征，TuGraph 更倾向于采用紧凑编码来保证读性能。其主要弱势为单边更新时重编码的开销，可以用自适应映射的技术来解决。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
new file mode 100644
index 0000000000..3f89389b2b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/2.multi-level-Interfaces.md
@@ -0,0 +1,34 @@
+# 多层级接口
+
+
+> 此文档主要介绍 TuGraph 的多层级接口的设计理念。
+
+## 1.简介
+
+多层级接口是 TuGraph 针对多丰富的使用场景，在易用性和高性中作出的平衡。比如描述式图查询语言 Cypher 能够抹去图数据库实现的细节，基于图模型的抽象来进行表达。Cypher 过于高层的表述，无法高效转化成底层的执行，因此提供了 Procedure API 的过程式语言，来发挥图数据库的最佳性能。
+
+接口可以大致分为客户端接口和服务端接口，大部分操作都在服务端完成，客户端只做数据的封装和解析。客户端和服务端通过网络连接，TuGraph 支持更加灵活的短连接 REST 协议，以及更加高效的长链接 RPC 协议，可根据不同的业务场景来选择。
+
+服务端接口均处在计算层，和图数据存储间用一层 Core API 在逻辑上隔开。
+
+![多层级接口架构](../../../../images/multi-level-Interfaces.png)
+
+## 2.客户端接口
+
+客户端接口指在客户端执行的接口，通常用于集成到软件应用中。TuGraph 的客户端的接口比较简单，包括登录登出、数据导入导出、存储过程加载调用、Cypher操作等。其中 Cypher 中集成了大部分的功能，包括数据操作、图模型操作、运维管理、账户管理等。
+
+由于 Cypher 的参数和返回值都是字符串，JAVA OGM 是对 Cypher 的结构化封装，即查询结果能够被封装为一个有类型的对象，方便使用。
+
+## 3.服务端接口
+
+服务端接口包括描述式图查询语言 Cypher、过程式图查询语言 Procedure API、图分析编程框架 OLAP API 和图神经网络编程框架 GNN PI，为图事务引擎、图分析引擎、图神经网络引擎提供服务，下面先展开介绍各个接口的特点。
+
+> __描述式图查询语言__ 是对查询逻辑的抽象描述，而与执行逻辑无关，对图数据库应用者比较友好，类比关系型数据库的 SQL 语言。TuGraph 的 Cypher 语言主要依照 Neo4j 开源的 OpenCypher 查询标准，同时对运维管理等辅助功能进行了扩展，在功能上囊括了 TuGraph 的大部分操作。描述式图查询语言会成为图数据库的主要数据操作方式，但由于描述到执行之间需要生成执行计划（Execution Plan），生成最优执行计划在学术界和工业界均有很长的路要走。
+
+> __过程式图查询语言__ 是为了解决描述式图查询语言与最优性能间的鸿沟。TuGraph的 Procedure API 是在 Core API 上做了一层简单的封装，C++ Procedure API的灵活性和高效性能够充分发挥存储的极致性能，也是 Cypher 优化的上限性能。Python Procedure API 是 C++ Procedure API 上的一层跨语言封装，翻译过程中值的拷贝会带来一定的性能损失，优势则主要是 python 语言本身的易用性。raversal API 是并行执行的 Procedure 接口，描述上更接近于集合的操作，比如扩展点集合所有出度邻居，获得一个新的点集。
+
+> __图分析编程框架__ 属于 ‘图计算系统’ 的范畴，会将图数据从支持增删改查的存储中导出快照，以更紧凑的数据存储格式来支持只读的复杂图分析，这里叫做OLAP API。OLAP API 封装了高并发执行的数据结构，包括 Vector、Bitmap等，以及基于 CSR 格式的图快照数据结构，然后提供一套并发的快速点边操作框架。在图分析任务完成后，数据可以通过接口写回图数据库。
+
+> __图神经网络编程框架__ 主要提供了图神经网络应用编程所需要的接口，能够对接PyTorch 等机器学习框架。TuGraph 的图神经网络编程框架主要集成了 DGL，在 Python 的语言环境中完成从图存储到图神经网络应用的完整流程。
+
+除了 Cypher 是解释执行外，其余服务端接口都是编译执行，即需要将对应代码传到服务端后，进行编译（可能会有时间开销），再在服务端执行。所以通常需要先加载，然后再已加载的应用列表中找到程序，传输入参数后执行。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/3.htap.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/3.htap.md
new file mode 100644
index 0000000000..e895545616
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/3.htap.md
@@ -0,0 +1,36 @@
+# HTAP
+
+> 此文档主要介绍 TuGraph 的HTAP的设计理念。
+
+## 1.简介
+
+![htap架构](../../../../images/htap.png)
+
+HTAP 的实现在架构上有多种不同的方式：一是用两个不同的副本来分别处理 OLTP 和 OLAP 的任务，核心是数据的一致性同步和额外的资源开销；二是在任何时候都使用同一份数据存储，该实现的数据结构存在内存膨胀，在工业化落地还需要进一步工作。在 TuGraph 的设计中，简单的 OLAP 操作和 OLTP 操作共用一份数据，而复杂的 OLAP 操作则单独导出快照处理。
+
+## 2.设计
+
+在 TuGraph 中，OLTP 为图事务引擎，在图 4.4对应事务操作；OLAP 为图分析引擎，对应简单图分析操作（比如 SPSP）和复杂图分析操作（比如 PageRank），前者可以直接在图存储上执行，而后者需要额外导出快照执行。
+
+- 事务操作，即图事务引擎测的操作，为局部图的增删查改操作，典型的应用为 K 跳访问 K-Hop。
+- 简单分析操作，是图分析引擎中较为简单的部分，通常也是局部的图分析操作，比如两点间最短路算法 SPSP、Jaccard 算法。
+- 复杂分析操作，是图分析引擎中较为复杂的部分，通常涉及全图的多轮数据迭代操作，比如网页排序算法 PageRank、社区发现算法 Louvain。
+
+如架构图所示，我们在图中增加了外部存储，使得图分析的数据源不局限在图数据库中，可以直接从文本文件读取。
+
+- 图存储，即图数据库中的存储，有精心设计的数据结构，能够完成实时增删查改。
+- 外部存储，可以是 RDBMS 或文本文件，以边表的简单方式存储，仅供一次性批量读取，和批量结果写入。在计算层，和整体架构图中的接口对应。
+- Cypher，描述式图查询语言，可以并发执行。
+- Procedure API，过程式图查询语言，其灵活性能够同时支持事务操作和图分析操作，但效率上不足以完成复杂图分析操作，可以并发执行。
+- OLAP API，针对多轮迭代的复杂图分析。应用需要先将存储中的图数据导出成内存中的一个快照，该快照仅用来快速访问，而不需要考虑 ACID 的写支持，因此可以排布地更加紧凑，CSR 排布的读效率要远高于图存储的数据排布。OLAP API 只能串行执行，每个操作都用满 CPU 资源。
+
+OLAP API 的快照可以从外部存储创建，即将边表数据构成件 CSR 的格式；或者从图存储中创建。需要注意的是，OLAP API 要求点的 ID 是连续的自然数，可能需要额外的 ID 映射，该步骤在创建快照时可以在指定一个属性进行映射，或直接取属性值作为 ID。
+
+与计算接口和存储相对应，有四种运行模式。
+
+- 事务模式，每个操作对应一条 Cypher 语句，默认是一个事务。
+- Plugin 模式，通过插件的方式，在计算逻辑加载到服务端后调用，也叫存储过程。
+- Embed 模式，和 Plugin 模式的使用接口一致，区别是图数据库服务不需要起来，就可以直接用接口调用数据库中的数据，通常用于调试 Procedure API 和OLAP API 的代码，调试信息和操作步骤比 Plugin 模式更加友好。
+- Standalone 模式，最大程度剥离与图数据库的关系，仅想用图分析引擎做数据分析时，该模式会比较直接。Standalone 模式会直接使用外部存储的数据。
+
+图神经网络引擎的使用方式和 ‘复杂图分析操作’ 类似，会同时调用部分 OLAP API 和 GNN API，不在这里展开。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/index.rst
new file mode 100644
index 0000000000..c055f3df01
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/5.characteristics/index.rst
@@ -0,0 +1,10 @@
+产品特点
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
+    
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/6.architecture.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/6.architecture.md
new file mode 100644
index 0000000000..cf901d31cb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/6.architecture.md
@@ -0,0 +1,15 @@
+# TuGraph产品架构
+
+> 此文档主要介绍 TuGraph 的产品架构。
+
+## 1.简介
+
+![产品架构](../../../images/architecture.png)
+
+上图从功能模块的角度，以 TuGraph 为例，给出了企业级图数据库的整体架构，自下而上包括：
+
+- 软硬件环境。涉及图数据库的开发和使用环境。TuGraph 主要基于底层的 C++语言开发，能够兼容市面上大部分操作系统和 CPU。
+- 存储层，包括 KV 存储层和图存储层。存储层需要支持计算层所需的各个功能。
+- 计算层。计算层应包括图事务引擎、图分析引擎和图神经网络引擎，也包含了服务端提供的多种编程接口，包括描述式查询语言 Cypher，存储过程等。
+- 客户端。客户端 SDK 应支持 Java、Python、C++ 等多种语言，也支持命令行的交互方式。Browser 和 Explorer 通过网页端交互的方式，降低了图数据库的使用门槛。
+- 在生态工具方面，覆盖了企业级图数据库的开发、运维、管理等链路，提升可用性。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/7.functionality.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/7.functionality.md
new file mode 100644
index 0000000000..c24881b9cf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/7.functionality.md
@@ -0,0 +1,110 @@
+# 功能概览
+
+> 此文档主要介绍 TuGraph 的主要功能和特性。
+
+## 1.安装部署
+
+## 1.1.部署方式
+
+TuGraph目前提供云部署、Docker部署以及安装包部署三种部署方式，用户可根据实际情况选择适合的部署方式。
+
+## 1.2.软硬件环境
+
+TuGraph核心是由C++开发，默认使用的编译器为GCC8.4，使用c++17标准。此外，存储过程中额外提供了Python Procedure API，该功能需要Python环境。TuGraph不需要特殊的硬件比如GPU，对RDMA、HBM等高延迟低带宽的通用硬件升级可以天然适配。
+
+TuGraph测试过基于X86和ARM的CPU，包括Intel、AMD、Kunpeng、Hygon、飞腾等，也同时在多个操作系统上运行，包括Ubuntu、CentOS、SUSE、银河麒麟、中标麒麟、UOS的主流版本，对操作系统和CPU没有特殊的要求。
+
+软硬件环境也包括依赖库的环境，由于TuGraph的存储层中默认的KV存储是LMDB，需要文件系统能够支持POSIX接口。在不同的环境下编译和参数配置会略有不同，比如在图存储的点边数据打包中，应和操作系统的页表大小匹配，默认为4KB，建议将系统的页表大小也设置为4KB。
+
+## 2.存储层
+
+在图数据模型上，TuGraph支持属性图模型，按照层次可以分为子图、标签（包括点标签和边标签）、属性。从存储层看，TuGraph使用使用直观的多层的树状模型，没有跨子图的标签，也没有跨标签的属性，仅保留图模型的核心逻辑。
+
+在子图的存储上，TuGraph对多图做了数据的物理隔离，每个图对应一个LMDB的实例。多图的元数据描述信息，保存在meta的特殊的公共LMDB实例中。点边标签及其属性的存储，通过将图数据自适应地映射到KV键值对，最大程度发挥读性能。同时在KV层实现了多线程写，解决了LMDB写性能较低的劣势。主键索引和二级索引，对应LMDB中B+的表，支持基于比较的索引值增删查改。
+
+存储层还保留了一些其他非核心功能的数据，包括权限数据、预编译的插件数据、监控数据等。
+
+## 3.计算层
+
+计算层在功能上分成三个部分，包括TP类的图事务引擎，AP类的图分析引擎和图神经网络引擎。
+
+- __图事务引擎__，主要用来处理并发的图操作，包括单点查询、邻居查询、路径遍历。图事务引擎侧重并发操作的ACID事务，确保操作逻辑不会互相干扰，主要性能指标为 QPS，即每秒完成的查询数量。
+
+- __图分析引擎__，操作类型通常为全图迭代。部分简单的分析任务（比如SPSP）可以由图事务引擎完成，复杂的分析任务均由图分析引擎完成，单个任务通常需要数秒至数小时。因此单个图分析任务要并发利用所有的硬件资源，性能指标为任务完成的总时长。
+
+- __图神经网络引擎__，通常也为全图迭代。图神经网络引擎除了基于图拓扑的操作，也需要集成一个机器学习的框架来处理向量操作，比如 PyTorch、MXNet、TenserFlow。
+
+三个引擎的操作逻辑不尽相同，独立配置资源池。事图事务引擎基于RPC操作设置了一个线程池，每接受客户端的一个操作，从线程中取一个线程来处理，并发执行的数量等于RPC线程池的容量，通常配置为服务器的核数。图分析引擎有一个分析线程池，每个图分析任务会并发执行，即用所有的线程来执行一个任务，来加速操作的性能。TuGraph图分析操作串行执行的特性会一定程度限制用户的使用体验，并发的图分析的需求可以通过高可用部署的方式，增加机器资源来处理，或者接入外部的任务调度器，将数据传到实时调度的容器来计算。图神经网络操作在图上的操作会复用图事务引擎或图分析引擎的资源，向量的操作会起单独的资源，在机器学习框架中可以使用GPU等单独的加速硬件。
+
+## 4.核心功能
+
+### 4.1.查询语言
+
+TuGraph 提供 Cypher 图查询语言，遵循OpenCypher标准。
+- __支持Procedure嵌入__
+
+- __可插拔优化框架__ 各类优化功能
+
+- __可扩展安全性检查框架__ 对于cypher进行
+
+### 4.2.存储过程
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个 REST 请求并在客户端完成整个
+处理流程的方式，TuGraph 提供的存储过程（Procedure）是更简洁和高效的选择。
+
+从 3.5 版本开始，TuGraph 重新设计了新的存储过程编程范式，支持定义标准的签名和结果，支持POG编程。
+
+TuGraph 支持 POG (Procedres on Graph Query Languages) 编程和 POG 库，其中“Graph Query Languages”包含 Cypher 以及
+制定中的 ISO GQL 等图查询语言。POG 库提供在查询语言中对用户定义的存储过程的访问，打破了查询语言和存储过程之间的界限，扩展了查询
+语言的使用范围。
+
+> 这个文档描述了 [新的 Procedure 编程范式以及 POG](../9.olap&procedure/1.procedure/1.procedure.md)。
+
+### 4.3.数据导入导出
+
+尽管TuGraph本身支持数据的插入，但批量导入能够大幅提升的效率。导入的功能可以分为空库导入（离线导入）和增量导入，前者指子图是空的时候进行导入，额外的假设能够大幅提升导入的性能，在 TuGraph 中，空库导入和增量导入的吞吐率差了10 倍。在数据导出中，需要考虑导出数据的一致性，即是基于一个快照数据导出的。
+
+TuGraph 可以通过 命令行工具`lgraph_export` 来对已经存放在TuGraph的图数据进行数据导出，导出格式支持CSV和JSON。
+
+### 4.4.备份恢复
+
+TUGraph的备份在功能上可分为主动/定时、离线/在线、全量/增量备份，用尽量小的存储和计算代价来完成备份。恢复功能可以恢复到最新的状态，或者历史标注的时间点，需要保证数据库是一致的状态。
+
+### 4.5 数据预热
+
+TuGraph 是基于磁盘的图数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+### 4.6 高可用
+
+高可用是指通过通过集群配置，做到实时多副本数据热备，在部分副本不用时，集群仍然能正常提供服务，TuGraph采用 RAFT 协议的多机热备机制，能够将 RPO 降低到接近 0 的程度。TuGraph 选择在计算层进行数据同步，同步的对象是写操作，通过 RPC 接口快速同步。TuGraph 的高可用集群采用主从模式，只有主节点处理写请求，主从节点均能处理读请求。主节点的写请求处理需要同步到多于二分之一的总节点上，多数节点写成功，该写请求才算完成。
+
+## 5.客户端工具
+
+客户端主要分为各种编程语言的SDK，OGM以及命令行工具。
+
+客户端 SDK 主要用于二次开发，可以通过 RPC 或 REST 协议链接服务端。RPC 基于长链接有较好的性能，数据需要通过 protobuf 统一序列化。TuGraph 使用brpc，支持 Java、Python、C++ 的 rpc 客户端。REST 的协议比较宽泛，能够简单适配更加多样的环境，不同的编程语言能够简单对接。TuGraph 给出了 Python 的REST 客户端实例，命令行的交互也是用 REST 实现。
+
+OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。
+
+命令行工具`lgraph_cypher`是查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+
+## 6.生态工具
+
+生态工具是企业级数据库一个非常重要的组成部分，丰富的生态工具能够大大提升图数据库的可用性，稳定性。
+
+### 6.1.TuGraph DataX
+
+![导入导出](../../../images/tugraph-datax.png)
+
+TuGraph 核心支持 CSV 和 JSON 合适的导入导出，提供空库导入和增量导入的模式。实际中会存在 MySQL、Kafka、Hive 等多数据源导入的需求，TuGraph 通过 DataX 做多数据源的对接。由于关系模型和图模型存在的差异，数据清洗的流程可以使用 SparkSQL 快速处理，TuGraph 本身仅关注 CSV 和 JSON 的简单场景导入可靠性和性能。
+
+### 6.2.可视化交互
+
+TuGraph Browser 是面向图数据库直接使用者的可视化交互界面，功能上覆盖了 TuGraph 的绝大部分能力，包括数据导入、图模型建立、数据增删查改、监控运维等操作链路。
+
+### 6.3.运维监控
+
+TuGraph 使用 Prometheus 加 Grafana 的监控框架，采用松耦合的方式。Prometheus 从 TuGraph 的监控接口获取监控信息，存储在本地时序数据库中，然后通过 Grafana 在网页端交互展示。
+
+TuGraph 提供的监控的状态包括图数据库的状态和服务器的状态，前者包括读写负载、点边数量等数据库端的状态，后者包括内存、CPU、硬盘等服务器的实时状态。如果某些监控状态超过了预期的阈值，就需要主动告警，通常需要对接其他运维管控系统，比如群消息、邮件告警等。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/8.scenarios.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/8.scenarios.md
new file mode 100644
index 0000000000..4cc5c0c10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/8.scenarios.md
@@ -0,0 +1,61 @@
+# 应用场景
+
+> 此文档主要介绍图数据库适用的应用场景。
+
+## 1. 金融领域
+
+金融领域的实体主要涉及人、公司、账户、产品等，它们之间的关系包括交易关系、登录关系、股权关系、雇佣关系等。这些实体构成了一张金融图数据网络。应用图数据库，我们可以从金融图数据网络里发掘出大量有用信息，帮助我们做出更准确的金融决策。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|贷款审核|通过分析申请人的关联关系、交易情况等辅助判断申请人的偿还能力和偿还意愿，可应用于零售贷款审核、小微贷款审核、供应链金融等。此方法可与传统的基于申请人自身信息的审核机制互补，在个体信息录覆盖较低的小微贷款审核中尤其有用。|
+|贷后管理|通过分析借款人交易情况，辅助分析借款人是否有逾期风险。相比于传统只在贷款资金流向特定用户的情况下发出警报的方式不同，该方法可以给每个账户赋予一个风险值，并在贷款流向高风险账户时给出预警。|
+|失联修复|通过分析失联贷款人的社交和购物数据，找出其它联系方式。该方法可以大幅改进失联修复率。|
+|担保环检测|可在担保关系图中找出环状、链式、家族式、交叉等特殊担保结构，揭露潜在风险。相比于关系型数据库的JOIN方法，基于图算法的方案更高效，可以检测出任意长的担保环，且可以实现更复杂限定条件的检测。|
+|信用卡团伙欺诈检测|构建信用卡申请信息中的地址、联系方式等关系网络，在申请关系网络中运行社区发现算法，可以检测出疑似欺诈的团伙，从而拒绝涉嫌欺诈的申请件，减少经济损失。|
+|反洗钱|通过交易网络和介质网络，找出疑似洗钱的行为和链路。洗钱是一个复杂的多方参与的过程，通过在交易和社交网络中进行图分析，我们可以更精准的检测出洗钱行为。|
+|车险反欺诈|针对有修理厂参与的骗保行为，通过分析被保人、案件地点和修理厂之间的关系，可以更精准的识别出骗保行为，减少经济损失。|
+
+## 2. 工业领域
+
+在生产和制造过程中会产生大量异构数据，如何有效的组织和管理这些数据是工业大数据中最重要的问题之一。这些数据包括设计文档、设备数据、仿真方案和结果、实验结果、经验文档等，关系错综复杂。传统的数据管理系统只能累积数据，而查找相关材料则往往力不从心。使用图模型，将这些不同类型的数据组织成一张网络，就可以方便地浏览和查找数据。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|供应链管理|供应链数据主要关心产品—部件—零件的对应关系、零件与供应商的对应关系、零件中的敏感成分等。相比于传统的物料管理（BOM）系统，使用图数据库的方案可以更方便地维护多个部件层次、多个供应商级别的复杂网络，从而为穿透式供应链提供基础支持。|
+|文档管理|使用图数据库可以将不同类型的文档按不同关系有机地组织在一起。例如将部件设计文档、部件—零件关系、部件测试文档、相关经验文档等组织起来，在需要查找时就可以方便获取该部件的所有相关信息。|
+|研发过程管理|产品研发和验证过程中需要进行大量仿真、试验和测试，每一个测试流程都会涉及大量不同的步骤。步骤之间的连接关系、每个步骤中使用的数据版本、算法版本等就构成了一张复杂的关系网络。使用图数据库可以更好管理这个关系网络，从而为研发过程中的数据复用、流程改进提供良好基础。|
+|设备信息管理|制造业需要管理大量设备，设备之间又互相关联（供电关系、供料关系、空间关系），从而形成了一张复杂的网络。传统的数据库很难体现这种复杂关系。而使用图数据库则可以便捷表示这些关系，从而更好的管理设备信息。|
+
+## 3. 智慧城市
+
+随着科技的发展，城市的智能化管理已成为一个大趋势。智能化管理需要建立在良好的信息管理平台之上，因此需要强大的系统软件做支撑。在智能化城市管理系统中，智能化决策系统需要基于大量不同信息做出决策，这些信息包括各种拓扑信息（道路、管线），供求信息（电力输送、饮用水供应、污水排放），环境信息（温度、湿度、雨量）等。要将这些复杂的异构数据有机管理起来，并基于它们做出决策，就需要一个成熟的系统。传统的数据管理系统基于关系数据模型，并不适合管理这种复杂异构数据。而使用图模型就可以很好的解决这一问题。如果我们将这些不同的数据利用图数据库进行管理，就可以实现很多复杂的智能管理场景。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|智能交通|基于道路拓扑、道路容量及当前流量，可以进行智能信号灯调度，从而提高通行效率。|
+|智能排水|基于排水系统信息及当前雨量，可以对排水系统进行调度，从而减少内涝的产生。|
+|管线管理|将管线的生产、安装、拓扑信息，以及历史状态信息有机组织起来，可以帮助我们对管线进行全周期管理，包括故障排查、寿命评估等。|
+|人群疏散|大量人群需要疏散时，需要考虑公交、地铁、出租车、共享单车等多种交通方式，同时还需要考虑道路承载量。使用图数据库将这些信息有机整合在一起，可以帮助我们更好的做出决策，以便为大型公共活动提供更好的支持。|
+
+## 4. 社会治理
+
+社会治理包括公共安全、法律事务、舆论、网络安全等多方面。社会治理是一个综合性的、多系统联动问题。它需要综合大量数据、全局考量才能做出更好的决策。在这种多维度复杂数据问题上，图数据模型可以提供更好的适应性，从而为智能化的社会治理决策平台提供坚实的基础。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|犯罪团伙发现|合谋团伙必然会通过某些方式产生联系，这种联系包括面谈（出现在同一地点）、电话联系、或者互联网联系，他们还可能有经济往来。如果我们将这些数据统一存放在一张图中，我们就可以通过图分析算法查找出联系紧密的群体，从而发现和识别整个犯罪团伙。|
+|涉众案件调查|涉众案件，特别是涉众经济案件往往涉及大量的人员和要素（货币、地点、事件等）。如何有效的组织这些资料，从而为办案提供证据支持是涉众案件调查的一个难点。使用图数据库来存储和分析这些资料，可以让我们快速定位资料、分析人员构成、为案件调查提供更好的技术支持。|
+|违法网站甄别|违法网站、钓鱼网站、黄色网站等往往通过使用不同的域名和IP来避免被封杀。基于黑名单的过滤方法只能封禁已知的违法网站，无法对新出现的域名和IP进行有效甄别。基于IP—域名网络的映射关系，我们可以建立一张图，然后通过图计算建立起域名和IP的“可信度”模型，利用该模型来判断网站是否属于违法网站。|
+|法院卷宗管理|卷宗往往错综复杂，不同的案件之间可能通过当事人产生联系，也可能通过案发地、案件性质、审判人员等产生联系。这些联系构成了一张复杂的网络。使用图数据库我们可以更方便的管理这些复杂关系，提高办案和查询效率。|
+
+## 5. 互联网
+
+人—人关系的社交网络、人—商品的购买关系都能构成图。通过分析这些网络数据，我们可以为用户提供更优质的服务，包括相关推荐、用户信息归集、重要用户识别、垃圾用户识别等。
+
+| **场景**         | **描述**               |
+|-----------------| -----------------------|
+|ID映射|图数据库可以将用户相关的所有信息，包括用户之间的关系统一存储在一个数据库中，同时还能通过这些关系来找出疑似单人多号和多人一号的情况，从而为后期的风控、推荐等业务提供决策支持。|
+|好友推荐|基于分析社交网络，我们可以提供“好友的好友”，“共同好友”等好友推荐。|
+|商品推荐|基于用户—商品关系图，我们可以找出兴趣爱好类似的用户，向他们推荐类似用户选择的其他商品。|
+|垃圾用户识别|传统的垃圾用户识别主要基于用户账号本身的信息，如注册信息、发帖信息等，但是这些信息都比较容易伪造。而基于网络的信息则不存在这个问题：它们很难被伪造。因此基于网络信息的垃圾用户识别可以更加精准和高效。|
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/9.glossary.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/9.glossary.md
new file mode 100644
index 0000000000..5171d5ece8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/9.glossary.md
@@ -0,0 +1,38 @@
+# 名词解释
+
+## 1.图技术
+
+> __图计算__：广义图计算，技术上包括图查询、图分析、图学习；狭义图计算，包括图计算任务和图分析。
+
+> __图查询__：指图数据库的查询能力，通常通过Cypher/ISO GQL等查询语言实现。
+
+> __图分析__：侧重于对全图数据的算法分析、模式分析等。
+
+> __图学习__：与图神经网络、图机器学习含义相同。
+
+> __图智能__：等于广义图计算，包括图数据库、图分析、图学习，通常用于概念推广，不用于产品。
+
+## 2.图产品
+
+> __图计算系统__：一般包括图数据库、图分析系统、图学习系统，有时也特指图分析系统。
+
+> __图数据库__：侧重于对图数据的增删改查、事务性操作等，如TuGraph DB、Neo4j、JanusGraph等。
+
+> __图分析系统__：解决图分析问题，可以细分为流水图分析、离线图分析，如TuGraph Analytics、GraphX等。
+
+> __图学习系统__：解决图学习问题，比如TuGraph Learn、DGL等。
+
+## 3.具体概念
+
+
+> __Vertex__：点，也叫顶点，也指 Vertex Value。尽量避免Node（结点、节点）的叫法，一般用Node表示服务器个数，容易叫混。结点指结合、交结、交叉的意思；节点可以指一个时间线上的里程碑（关键节点）或计算机系统里的一个处理实体（如计算机网络里的一台服务器）。
+
+> __Edge__：边，也指 Edge Value。
+
+> __Vertex Label__：点类型，也叫 Vertex Type。
+
+> __Edge Label__：边类型，也叫 Edge Type。
+
+> __Degree__：度，入度/出度，表示一个点的入边、出边的条数。注意，在非图论的场景中，往往把“跳”也称作“度”。
+
+> __Hop__：跳，表示一个点到另一个点之间的路径经过的点数（不含起点、含终点）。算法性能测试里K-Hop即为此义。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/index.rst
new file mode 100644
index 0000000000..efe03a5128
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/2.introduction/index.rst
@@ -0,0 +1,17 @@
+TuGraph入门
+===========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.what-is-graph
+   2.what-is-gdbms
+   3.what-is-tugraph
+   4.schema
+   5.characteristics/index.rst
+   6.architecture
+   7.functionality
+   8.scenarios
+   9.glossary
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/1.preparation.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/1.preparation.md
new file mode 100644
index 0000000000..be6423bff2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/1.preparation.md
@@ -0,0 +1,106 @@
+# 快速上手
+
+> 此文档主要用于新用户快速上手，其中包含了 TuGraph 的简介、特征、安装和使用。
+
+## 1.简介
+
+TuGraph 是蚂蚁集团自主研发的大规模图计算系统，提供图数据库引擎和图分析引擎。其主要特点是大数据量存储和计算，高吞吐率，以及灵活的 API，同时支持高效的在线事务处理（OLTP）和在线分析处理（OLAP）。 LightGraph、GeaGraph 是 TuGraph 的曾用名。
+
+主要功能特征包括：
+
+- 标签属性图模型
+- 支持多图
+- 完善的 ACID 事务处理
+- 内置 34 图分析算法
+- 基于 web 客户端的图可视化工具
+- 支持 RESTful API 和 RPC
+- OpenCypher 图查询语言
+- 基于 C++/Python 的存储过程
+- 适用于高效图算法开发的 Traversal API
+
+性能及可扩展性特征包括：
+
+- TB 级大容量
+- 千万点/秒的高吞吐率
+- 高可用性支持
+- 高性能批量导入
+- 在线/离线备份
+
+
+### 1.1.支持的平台
+
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的的平台。
+
+### 1.2.硬件要求
+
+_目前我们建议用户使用 NVMe SSD 配合较大的内存配置以获取最佳性能。_
+
+| 硬件   | 最低配置      | 建议配置                     |
+|------|-----------|--------------------------|
+| CPU  | X86_64    | Xeon E5 2670 v4          |
+| 内存   | 4GB       | 256GB                    |
+| 硬盘   | 100GB     | 1TB NVMe SSD             |
+| 操作系统 | Linux 2.6 | Ubuntu 18.04, CentOS 7.3 |
+
+## 2.安装
+
+TuGraph 可以通过 Docker Image 快速安装，或者通过 rpm/deb 包本地安装。另外TuGraph在阿里云计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。
+
+> 安装包/镜像下载：参考[下载地址](../1.guide.md)中的“TuGraph最新版本”章节。
+
+> 计算巢部署：可以在阿里云计算巢自行搜索，也可以通过[部署链接]( ../5.installation&running/5.cloud-deployment.md )快速访问。
+
+### 2.1.通过docker快速体验
+
+1. 本地安装 docker 环境
+
+   参考 docker 官方文档：https://docs.docker.com/get-started/
+
+2. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7
+   ```
+
+3. 启动docker
+
+启动 TuGraph 服务可以通过两种方式来实现。第一种方式将镜像拉取与服务启动整合在一起，用户只需执行运行容器的操作，即可同时启动 TuGraph 服务。第二种方式则是在创建 TuGraph 容器后，手动进入容器内部以触发服务启动。尽管这种方法初期步骤稍显繁琐，但在如忘记密码的情况下，它提供了更灵活的密码重置选项。
+
+**方式一**
+
+   ```shell
+    docker run -d -p 7070:7070  -p 7687:7687 -p 9090:9090 -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo ${REPOSITORY}:${VERSION}
+   
+   # ${REPOSITORY}是镜像地址，${VERSION}是版本号。
+   # 7070是默认的http端口，访问tugraph-db-browser使用。   
+   # 7687是bolt端口，bolt client访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   # /var/lib/lgraph/data是容器内的默认数据目录，/var/log/lgraph_log是容器内的默认日志目录
+   # 命令将数据目录和日志目录挂载到了宿主机的/root/tugraph/上进行持久化，您可以根据实际情况修改。
+   ```
+
+**方式二**
+
+   ```shell
+    docker run -dt -p 7070:7070  -p 7687:7687 -p 9090:9090 -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo ${REPOSITORY}:${VERSION} /bin/bash
+    
+    docker exec -it tugraph_demo bash
+    lgraph_server -c /usr/local/etc/lgraph.json -d start
+    
+   # ${REPOSITORY}是镜像地址，${VERSION}是版本号。
+   # 7070是默认的http端口，访问tugraph-db-browser使用。   
+   # 7687是bolt端口，bolt client访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   # /var/lib/lgraph/data是容器内的默认数据目录，/var/log/lgraph_log是容器内的默认日志目录
+   # 命令将数据目录和日志目录挂载到了宿主机的/root/tugraph/上进行持久化，您可以根据实际情况修改。
+   ```
+
+5. 前端访问
+
+访问tugraph-db-browser: `http://x.x.x.x:7070`，数据库地址格式为 `bolt://ip:bolt_port`（老版本不用填），默认用户名为 `admin`，密码为 `73@TuGraph`。
+首次登录会默认跳转修改密码页面，请尽快修改默认密码避免安全风险。   
+
+### 2.2.新旧前端说明
+进入容器，可以通过修改配置文件"/usr/local/etc/lgraph.json"中的"web"参数来选择使用老版本或新版本的前端。对于老版本，可以将"web"的值设为"/usr/local/share/lgraph/resource"；对于新版本，可以将"web"的值设为"/usr/local/share/lgraph/browser-resource"。完成配置文件的修改后，请执行命令 `docker restart tugraph` 以使更改生效。需要注意的是，新版本是默认选项。
+
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/1.movie.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/1.movie.md
new file mode 100644
index 0000000000..afd04dadb8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/1.movie.md
@@ -0,0 +1,84 @@
+# 场景：影视
+
+> 此文档主要介绍 影视场景Demo 的使用方法。
+
+## 1.建模和数据导入
+
+完成登录后，点击`新建图项目`，选择movie数据，填写图项目配置，系统会自动完成Movie场景图项目创建。其余场景也可用相同方式创建。
+
+Movie 场景图：
+
+<img src="https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/1.Guide/2.quick-start.png" alt="movie_schema" style="zoom: 25%;" />
+
+| 标签          | 类型  | 说明                                  |
+|-------------|-----|-------------------------------------|
+| movie       | 实体  | 表示某一部具体的影片，比如"阿甘正传"。                |
+| person      | 实体  | 表示个人，对影片来说可能是演员、导演，或编剧。             |
+| genre       | 实体  | 表示影片的类型，比如剧情片、恐怖片。                  |
+| keyword     | 实体  | 表示与影片相关的一些关键字，比如"拯救世界"、"虚拟现实"、"地铁"。 |
+| user        | 实体  | 表示观影的用户。                            |
+| produce     | 关系  | 表示影片的出品人关系。                         |
+| acted_in    | 关系  | 表示演员出演了哪些影片。                        |
+| direct      | 关系  | 表示影片的导演是谁。                          |
+| write       | 关系  | 表示影片的编剧关系。                          |
+| has_genre   | 关系  | 表示影片的类型分类。                          |
+| has_keyword | 关系  | 表示影片的一些关键字，即更细分类的标签。                |
+| rate        | 关系  | 表示用户对影片的打分。                         |
+
+## 2.查询示例
+
+### 2.1.示例一
+
+查询影片 'Forrest Gump' 的所有演员，返回影片和演员构成的子图。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[:acted_in]-(a:person) RETURN a, m
+```
+
+### 2.2.示例二
+
+查询影片 'Forrest Gump' 的所有演员，列出演员在影片中扮演的角色。
+
+```
+MATCH (m:movie {title: 'Forrest Gump'})<-[r:acted_in]-(a:person) RETURN a.name,r.role
+```
+
+### 2.3.示例三
+
+查询 Michael 所有评分低于 3 分的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie) WHERE r.stars < 3 RETURN m.title, r.stars
+```
+
+### 2.4.示例四
+
+查询和 Michael 有相同讨厌的影片的用户，讨厌标准为评分小于三分。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v) WHERE r.stars < 3 AND s.stars < 3 RETURN u, m, v
+```
+
+### 2.5.示例五
+
+给 Michael 推荐影片，方法为先找出和 Michael 讨厌同样影片的用户，再筛选出这部分用户喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[r:rate]->(m:movie)<-[s:rate]-(v)-[r2:rate]->(m2:movie) WHERE r.stars < 3 AND s.stars < 3 AND r2.stars > 3 RETURN u, m, v, m2
+```
+
+### 2.6.示例六
+
+查询 Michael 的好友们喜欢的影片。
+
+```
+MATCH (u:user {login: 'Michael'})-[:is_friend]->(v:user)-[r:rate]->(m:movie) WHERE r.stars > 3 RETURN u, v, m
+```
+
+### 2.7.示例七
+
+通过查询给'Forrest Gump'打高分的人也喜欢哪些影片，给喜欢'Forrest Gump'的用户推荐类似的影片。
+
+```
+MATCH (m:movie {title:'Forrest Gump'})<-[r:rate]-(u:user)-[r2:rate]->(m2:movie) WHERE r.stars>3 AND r2.stars>3 RETURN m, u,m2
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
new file mode 100644
index 0000000000..7a8bba59b9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/2.wandering-earth.md
@@ -0,0 +1,53 @@
+# 场景：流浪地球
+
+> 此文档主要介绍 流浪地球 demo的使用方法。
+
+## 1.Demo场景设计
+
+Demo背景基于流浪地球1、流浪地球2的故事背景进行设计
+
+- 基于剧情，设计了图结构，包含组织、角色、天体与设施3类点，事件、关系两类边
+- 根据剧情准备了对应Schema的数据
+- 准备了一些query，提出一些关于剧情的问题
+
+## 2.使用说明
+
+前置条件：TuGraph已安装
+
+## 3.数据导入
+
+- 手动导入
+  - 数据存放目录：https://github.com/TuGraph-family/tugraph-db-demo
+  - 根据数据存放目录对应修改import.json里面的DATA_PATH。具体可以参考[数据导入](../../6.utility-tools/1.data-import.md)
+  - 启动TuGraph服务后，访问${HOST_IP}:7070，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择流浪地球数据，填写图项目配置，系统会自动完成流浪地球场景图项目创建。
+
+## 4.Cypher查询
+
+参考cypher文档，在TuGraph的Web页面前端输入Cypher进行查询
+
+## 5.使用展示
+
+### 5.1.数据导入的展示
+
+![数据导入展示](../../../../images/wandering-earth-1.png)
+
+### 5.2.查询展示
+查询木星危机的所有事件经过
+
+```
+MATCH (n)-[e:事件关系]-(m) where e.title='木星危机' RETURN n,e
+```
+
+![数据导入展示](../../../../images/wandering-earth-2.png)
+
+查询所以危机的相关事件经过
+
+```cypher
+MATCH (n)-[e1]-(m)-[e2]-(p)
+where e1.title REGEXP ".*危机" and e2.title REGEXP ".*危机" and e1.title <> e2.title
+RETURN n,e1,e2,p
+```
+
+![数据导入展示](../../../../images/wandering-earth-3.png)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
new file mode 100644
index 0000000000..bd13877f5d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/3.the-three-body.md
@@ -0,0 +1,80 @@
+# 场景：三体
+
+> 此文档主要介绍 三体 demo的使用方法。
+
+## 1.Demo场景设计
+Demo背景基于三体1、三体2、三体3的故事背景进行设计。
+
+根据三体故事的设定，我们设计了4类点和6类边，点包括“人物”、“组织”、“计划”、“时间线”，边包括“人物-人物关系”、“人物-计划关系”、“人物-组织关系”、“组织-计划关系”、“组织-组织关系”。
+根据剧情准备了对应Schema的数据，准备了一些query，提出一些关于剧情的问题。
+
+## 2.使用说明
+
+前置条件：TuGraph已安装。
+
+## 3.数据导入
+
+- 手动导入
+    - 数据存放目录：https://github.com/TuGraph-family/tugraph-db-demo
+    - 根据数据存放目录对应修改import.json里面的DATA_PATH。具体可以参考[数据导入](../../6.utility-tools/1.data-import.md)
+    - 启动TuGraph服务后，访问${HOST_IP}:7070，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三体数据，填写图项目配置，系统会自动完成三体场景图项目创建。
+
+## 4.Cypher查询
+
+参考TuGraph文档，在TuGraph的Web页面前端输入Cypher进行查询。
+
+## 5.使用展示
+
+### 5.1.数据导入的展示
+
+![data](../../../../images/three-body-data.png)
+
+## 6.查询展示
+
+### 6.1.人物关系查询
+三体一剧情中，一开始全世界各地发生了大量科学家自杀事件，引起了警方重视，查案过程根据人物关系线索一步步排查，就如上面的图所示，随着线索越来越多，背后的真相逐步浮出水面。史强和汪淼发现大多数人都和叶文洁有着直接或者间接的联系，并派汪淼卧底，最终发现叶文洁的最终统帅身份。在图中也可以看出，叶文洁顶点周围有很多边关系（一度或二度邻居很多）。
+
+```cypher
+MATCH (n)-[e:person_person]-(m) RETURN n,e,m
+```
+
+![data](../../../../images/three-body-cypher1.png)
+
+### 6.2.邻域顶点分析
+三体中的各种计划比较多，有的时候可能会被绕晕，这时候我们可以通过图的邻居顶点查询来查看该计划的相关人物和组织等。如"面壁计划"中,我们可以看到有四位人物与之相关，这四位也是被世人所寄予厚望的“面壁者”。
+
+```cypher
+MATCH (p:plan {name: "面壁计划"})-[e]-(neighbor:person)
+RETURN neighbor,p,e
+```
+
+![data](../../../../images/three-body-cypher2.png)
+
+### 6.3.查询a节点和b节点的共同邻居
+我们往往希望知道两个人物之间的共同关联的人物都有谁，这样就能很快的掌握这两个人物之间的关系，在大数据量的情况下，使用cypher进行图关系分析就很方便！
+
+```cypher
+MATCH (a:person {name: "叶文洁"})-[e1:person_person]->(n)<-[e2:person_person]-(b:person {name: "汪淼"})
+RETURN a,b,n,e1,e2
+```
+
+![data](../../../../images/three-body-cypher3.png)
+
+### 6.4.设置/更改属性
+随着剧情推进，我们逐步了解了"叶文洁"身上的多个标签，那么我们也可以将这些标签更新至“叶文洁”节点上：
+
+```cypher
+MATCH (p:person {name: "叶文洁"})
+SET p.introduce = "清华大学教授、ETO精神领袖、首位和三体人交流的人"
+RETURN p
+```
+
+### 6.5.增加/删除节点
+后续我们了解到了罗辑、程心等等人物和PIA、星环集团等组织，希望把这些作为节点添加至图中：
+
+```cypher
+CREATE (a:person {introduce: "物理学教授", name: "bbb"})
+RETURN a
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
new file mode 100644
index 0000000000..540da5697a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/4.three-kingdoms.md
@@ -0,0 +1,69 @@
+# 场景：三国
+
+> 此文档主要介绍 三国 demo的使用方法。
+
+## 1. 简介
+由于史料的缺失，一些即使为人们熟知的历史事件也往往存在着很多未解之谜。以三国历史为例，诸葛亮为什么出山帮助当时势力弱小的刘备，同为天下英雄的曹操和刘备为什么成就差距巨大等等。以往学者往往采用二维关系分析历史，这样得出的结论往往比较片面。使用TuGraph将三国的历史人物和事件导入图模型中，使用图计算方式进行分析，能够帮助我们从有限的信息中获得更有价值的知识，是一种非常有意义的跨学科尝试。
+## 2. 数据建模
+我们设计了5类顶点和5类边，点包括“主公”，“州”，“文臣”，“武将”，“战役”，边包括“父亲”，“兄长”，“隶属”，“籍贯”，“参战”。其具体建模信息如下所示：
+![image.png](../../../../images/three-kingdoms-schema.png)
+
+## 3. 数据导入
+- 手动导入
+  - 数据存放目录：https://github.com/TuGraph-family/tugraph-db-demo
+  - 根据数据存放目录对应修改import.json里面的DATA_PATH。具体可以参考[数据导入](../../6.utility-tools/1.data-import.md)
+  - 启动TuGraph服务后，访问${HOST_IP}:7070，打开web页面，确认数据是否导入成功。
+- 自动创建
+    - 点击`新建图项目`，选择三国数据，填写图项目配置，系统会自动完成三国场景图项目创建。
+
+## 4. Cypher分析
+### 4.1. 诸葛亮为什么选择刘备
+通过如下cypher命令可以查看诸葛亮和曹操、刘备之间的关系
+```
+MATCH p = (cc:主公 {name: '曹操'})-[*1..3]-(zgl:文臣 {name: '诸葛亮'}) RETURN p
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher1.png)
+从图中可以很直观的看出，曹操和诸葛亮之间的最短路径之一包含徐州之战，曹操曾经因父亲被杀对徐州进行过屠城，而诸葛亮是徐州琅琊郡人，任何人都断然不会选择一个屠杀过自己家乡的军阀作为主公。而相反，刘备曾经在徐州之战中阻止过曹操的暴行，这应当是诸葛亮对刘备好感的原因之一。
+
+### 4.2. 曹操为什么成就比刘备高
+通过如下cypher命令可以查看家族对曹操创业的助力
+```
+MATCH (cc:主公{name:"曹操"})<-[r:隶属]-(wj:武将) WHERE wj.name REGEXP "曹.*" OR wj.name REGEXP "夏侯.*" return cc,wj,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher2.png)
+平定天下最重要的就是军事人才，曹操其父本姓夏侯，过继于曹氏，曹氏和夏侯氏在谯县都属于地方大族，在曹操创业初期提供了夏侯惇，夏侯渊，曹仁，曹洪在内大量的军事人才。而刘备其父早丧，没有家族助力，年过50才凑齐了自己的五虎上将，而这时已经过了天下大乱争夺地盘的最佳时机，曹操已经天下九州居其六了。
+
+### 4.3. 三国中最强大的魏国为何最先灭亡
+通过如下cypher命令可以查看曹操集团的重要文官组成
+```
+MATCH (cc:主公)<-[r:隶属]-(wc) WHERE cc.name REGEXP "曹.*" AND (label(wc) = "文臣" OR label(wc) = "主公") return cc,wc,r
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher3.png)
+曹魏事实上于249年灭亡于高平陵之变，立国29年，少于蜀汉（43年）和东吴（51年）。三国中实力最强大的魏国最先灭亡的原因就在于曹魏的文官制度（九品中正制）使得权力很容易集中在世家大族手中。从图中可以看出，曹操曹丕父子两代的重要文臣几乎都是世家大族，颍川荀氏，颍川钟氏，颍川陈氏，武威贾氏等，甚至还出现了地区化趋势，集中于颍川，最终政权也为和颍川荀氏关系密切的河内司马氏所篡夺。
+
+### 4.4. 三国各自的实力究竟如何
+通过如下cypher命令可以查看三国各集团的人口实力
+```
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["幽州","冀州","青州","并州","凉州","司州","豫州","兖州","徐州"] WITH COUNT(p) AS w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["益州"] WITH COUNT(p) AS s,w
+MATCH (p) WHERE (label(p)="主公" OR label(p)="文臣" OR label(p)="武将") AND p.hometown IN ["扬州","荆州","交州"]
+RETURN w as 魏人口,s as 蜀人口,count(p) as 吴人口
+```
+得到的查询结果如下表所示
+![image.png](../../../../images/three-kingdoms-cypher4.png)
+古代社会衡量一个国家实力的重要指标是人口数量，由于人口数据缺失，我们使用三国所有主公和文臣武将的籍贯数据估计每个州的人口数量。发现三国主要人物中，按籍贯有60个属于魏国，有23个属于吴国，仅有2个属于蜀国，证明魏国确实是三国中最强大的国家。
+
+### 4.5. 曹操的军事能力如何评价
+通过如下cypher命令可以查看曹操参与的主要战役
+```
+MATCH (cc:主公{name:"曹操"})-[e]-(zy:战役) RETURN cc,zy,e
+```
+得到的查询结果如下图所示
+![image.png](../../../../images/three-kingdoms-cypher5.png)
+从图中可以看出，曹操在三国主要的15场战役中参加了8场，出场率比较高。但是曹操只获胜了徐州之战、兖州之战、官渡之战和襄樊之战，汉中之战、宛城之战、群雄讨董和赤壁之战都失败了，综合胜率50%，证明曹操并不算一个非常优秀的军事家。
+
+## 5. 备注
+更多的分析有待大家积极补充和尝试！
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
new file mode 100644
index 0000000000..d5385b88fc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/5.round-the-world.md
@@ -0,0 +1,30 @@
+# Round The World Demo
+
+> 此文档主要介绍了基于tugraph-db开发的环球旅行（Round The World）demo
+
+## 简介
+
+基于"80天环游世界"的虚拟背景，基于部分公开历史航班数据，帮助用户设计多个城市的最优航班规划。
+- demo设计了自定义网站服务
+- 数据来源为国外某开源网站，不包含大陆城市航班数据
+- 数据中航班价格为模拟数据，不代表真实价格
+
+## 示例
+
+### 登录页面
+
+![data](../../../../images/round-the-world/main_page.jpg)
+
+### 查询页面
+
+在登录页面点击后进入查询页面
+
+![data](../../../../images/round-the-world/flight_page.jpg)
+
+### 查询示例
+
+在左下角的城市列表中选择不超过8个城市，点击查询可返回推荐的航班规划，在满足前后航班间隔在2-6小时的要求下，返回费用最低和飞行时间最短的10条路径规划。
+
+![data](../../../../images/round-the-world/search_example.jpg)
+
+详细使用说明见 [Round The World Demo](https://github.com/TuGraph-family/tugraph-db-demo/tree/main/round_the_world) 文档。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/index.rst
new file mode 100644
index 0000000000..4a29f62826
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/2.demo/index.rst
@@ -0,0 +1,9 @@
+demo示例
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/index.rst
new file mode 100644
index 0000000000..e630bd12bb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/3.quick-start/index.rst
@@ -0,0 +1,10 @@
+快速上手
+========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.preparation.md
+   2.demo/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/4.user-guide/1.tugraph-browser.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/4.user-guide/1.tugraph-browser.md
new file mode 100644
index 0000000000..b98bca4d70
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/4.user-guide/1.tugraph-browser.md
@@ -0,0 +1,672 @@
+# 可视化操作手册
+
+> 此文档主要介绍 TuGraph Browser 的使用和操作方法。
+
+## 1.简介
+
+TuGraph Browser（以下简称Browser）是一款功能强大的产品可视化开发工具，它以直观的可视化方式呈现图数据，使用户可以轻松地管理、维护和查看数据库运行状态。此工具不仅支持图数据的管理和可视化，还支持对系统账户的管理，为用户提供了全面的操作和管理体验，让用户能够更加高效地管理和利用图数据库。
+
+## 2.操作指南
+
+### 2.1.访问
+
+当用户完成图数据库的安装后，可以通过浏览器访问Browser。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7070。
+
+- 例如：127.0.0.1:7070。
+- 推荐使用Chrome。
+
+### 2.2.登录
+
+![login](../../../images/browser/login.png)
+
+- 浏览器成功访问Browser后，首先进入的是登录页面（如上图所示），用户需要填写账号和密码进行登录。
+- 数据库地址格式为：ip:bolt_port。
+- 默认账号：admin。
+- 默认密码：73@TuGraph。
+- 用户首次登录后，会跳转至修改密码页面，密码修改成功后，使用新密码重新登录即可使用。
+
+### 2.3.快速上手
+
+对于首次使用TuGraph的用户，可以通过产品内置的demo数据快速构建一个图项目，快速上手图数据项目。
+
+#### 2.3.1.创建图项目
+
+在`图项目`首页的选项卡中，点击`新建图项目`创建新的图项目。
+
+![快速上手-新建图项目](../../../images/browser/quickstart-creategraph.png)
+
+选择一个产品内置的demo数据，点击`下一步`按钮。
+
+![快速上手-选择一个demo](../../../images/browser/quickstart-selectdemo.png)
+
+在`填写配置`界面输入图项目信息，demo数据量都相对较小，`最大存储空间`设置为1G即可。输入完图项目信息后，点击`创建`按钮后，系统会自动创建demo数据的图模型、导入图数据。
+
+![快速上手-填写配置](../../../images/browser/quickstart-configure.png)
+
+#### 2.3.2.开始图项目
+
+demo数据的图项目创建完成后，可以在`图项目`的选项卡中找到相应的图项目，可以点击`图查询`查询图数据。
+
+![快速上手-图项目选项卡](../../../images/browser/quickstart-graphtab.png)
+
+执行默认的查询语句，浏览demo里的图数据。
+
+![快速上手-验证结果](../../../images/browser/quickstart-result.png)
+
+更多MovieDemo的操作请浏览[影视场景](../3.quick-start/2.demo/1.movie.md)
+
+### 2.4.图项目
+
+`图项目`提供可视化的图项目管理和图数据研发功能，它为用户提供了一系列便捷的图数据可视化操作，包括图项目的创建、修改、删除等管理操作，以及图数据的查询、点边统计等操作。此外，它也支持图模型的管理，使用户可以更加方便地进行图数据的管理和维护。
+
+#### 2.4.1.图项目管理
+
+在`图项目`界面，可以看到当前图数据库中的图项目。
+
+![图项目-首页](../../../images/browser/graphmanagement-homepage.png)
+
+##### 2.4.1.1.新建图项目
+
+在`图项目`界面，点击`新建图项目`按钮创建一个新的图项目。
+
+![图项目-新建图项目按钮](../../../images/browser/graphmanagement-creategraph.png)
+
+新建图项目需要通过`选择模板`和`填写配置`两个页面完成图项目的创建。
+
+- __选择模板__：产品提供空模板和demo模板两类模板。
+    - 空模板：全新的图项目，用户需要自己创建图模型和导入图数据，一般用于正式项目开发。
+    - demo模板：产品内置的demo数据，图项目创建成功后，系统会自动创建demo图模型并导入demo图数据，一般用于试用和学习。
+
+![图项目-选择模板](../../../images/browser/graphmanagement-selecttemplate.png)
+
+- __填写配置__：用户需要填写图项目基本信息，并点击`创建`按钮创建图项目。
+    - 图名称：新建图项目的名称，同时作为该图项目的唯一主键。支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+    - 图描述：新建图项目的描述，可用于详细说明该项目的背景和目标。
+    - 高级配置-最大存储空间：设置图项目最大可占用的存储空间，实际并不会提前占用物理存储空间，实际数据量达到最大存储空间阈值后不可再写入数据。
+
+![图项目-填写配置](../../../images/browser/graphmanagement-configure.png)
+
+创建成功后，可在`图项目`页面的图项目选项卡中查看。
+
+##### 2.4.1.2.编辑图项目
+
+在`图项目`界面，点击图项目选项卡中的`编辑`按钮（笔形图标），编辑对应图项目的基础信息。
+
+![图项目-编辑图项目按钮](../../../images/browser/graphmanagement-editgraph-button.png)
+
+编辑图项目功能可以修改`图描述`和`最大存储空间`。
+
+![图项目-编辑图项目](../../../images/browser/graphmanagement-editgraph.png)
+
+##### 2.4.1.3.删除图项目
+
+在`图项目`界面，点击图项目选项卡中的`删除`按钮（垃圾桶图标），删除对应的图项目。
+
+![图项目-删除图项目按钮](../../../images/browser/graphmanagement-deletegraph-button.png)
+
+_需要注意：图项目删除后无法恢复_。
+
+##### 2.4.1.4.点边统计
+
+在`图项目`界面，点击图项目选项卡中的`点边统计`按钮（刷新图标），统计对应图项目当前时间节点的点边数量。
+
+![图项目-点边统计按钮](../../../images/browser/graphmanagement-statistics-button.png)
+
+统计结果将展示在图项目选项卡上，已经统计过点边数据的图项目再次统计需要点击`刷新`按钮。
+
+![图项目-点边统计](../../../images/browser/graphmanagement-statistics.png)
+
+![图项目-刷新点边统计按钮](../../../images/browser/graphmanagement-statistics-refresh-button.png)
+
+##### 2.4.1.5.存储过程
+
+在`图项目`界面，点击图项目选项卡中的`存储过程`按钮（卡片最右侧图标），跳转到操作存储过程的图页面。
+
+![图项目-存储过程按钮](../../../images/browser/graphmanagement-procedure-button.png)
+
+在`存储过程`页面，可以新建存储过程，新建时需要填写"存储过程名称"、"存储过程类型"、"存储过程描述"，然后选择"版本"和"执行时是否修改数据库"
+
+![图项目-存储过程](../../../images/browser/graphmanagement-procedure.png)
+
+更多存储过程的相关操作可见 [存储过程](../9.olap&procedure/1.procedure/1.procedure.md)
+
+#### 2.4.2.图构建
+
+Browser的`图构建`功能主要用于图项目的模型定义和数据导入。在`图项目`页面中，点击图项目选项卡中的`图构建`按钮。
+
+![图构建-按钮](../../../images/browser/graphbuild-button.png)
+
+##### 2.4.2.1.模型定义
+
+Browser提供可视化的方式创建和维护图模型。
+
+- 也可用通过`cypher`工具和`lgraph_import`工具创建和维护图模型，详见[Cypher API](../8.query/1.cypher.md)和[数据导入](../6.utility-tools/1.data-import.md)文档。
+
+###### a.浏览图模型
+
+在`模型定义`界面可以查看详细的图模型设置，支持列表和画布方式查看图模型，支持列表展示点类型的属性和索引、边类型的属性和起点/终点类型。
+
+![图构建-浏览图模型](../../../images/browser/graphbuild.png)
+
+- 支持列表查看点类型和边类型。
+    - 支持点类型和边类型的个数展示，在点类型或边类型页签中展示对应的点或边数量。
+    - 支持点类型和边类型的名称关键字搜索，在`搜索框`输入关键字可展示对应的点或边。
+
+        ![图构建-浏览图模型-搜索](../../../images/browser/graphbuild-list-search.png)
+    - 支持点类型和边类型的名称复制，点击`复制`按钮可以复制点或边的名称至粘贴板。
+
+        ![图构建-浏览图模型-复制](../../../images/browser/graphbuild-list-copy.png)
+    - 支持点类型和边类型的删除，点击`删除`按钮可以删除对应的点或边。
+
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-list-delete.png)
+- 支持画布方式查看点类型和边类型。
+- 在列表或画布中点击相应的点类型或边类型，可以展示模型详情。
+        ![图构建-浏览图模型-删除](../../../images/browser/graphbuild-select.png)
+
+###### b.添加点
+
+在`模型定义`界面点击`添加点`按钮，在右侧滑动窗口中添加点类型。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex-button.png)
+
+用户需要输入点类型名称、属性和索引，点击`完成`按钮完成点类型的创建。
+- 点类型名称：点的名称，也是该点的唯一标识。
+- 属性：点的属性，需要一个属性作为主键。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建点时可以任意删除属性。
+- 索引：点的索引属性，需要先创建属性再设置该属性为索引，索引创建成功后无法修改。
+    - 属性：需要配置索引的属性。
+    - 唯一：设置该属性字段为唯一值。
+    - 主键：对应属性是否为主键，选择`是`后`唯一`选项必须为`是`。
+    - 删除：在创建点时可以任意删除索引。
+
+![图构建-添加点按钮](../../../images/browser/graphbuild-addvertex.png)
+
+- 编辑点：可以增加点的属性和修改已有属性的数据类型，新增或删除索引。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+_注：主键字段的属性创建后无修改_
+
+![图构建-编辑点](../../../images/browser/graphbuild-editvertex.png)
+
+###### c.添加边
+
+在`模型定义`界面点击`添加边`按钮，在右侧滑动窗口中添加边类型。
+
+![图构建-添加边按钮](../../../images/browser/graphbuild-addedge-button.png)
+
+用户需要输入边类型名称、属性、选择起点类型和终点类型，点击`完成`按钮完成边类型的创建。
+- 边类型名称：边的名称，也是该边的唯一标识。
+- 属性：边的属性，边上可以没有属性。
+    - 数据类型：属性字段的数据类型，支持INT、STRING、DOUBLE、DATE、DATETIME、BLOB、BOOL等类型。
+    - 选填：该属性是否可以为空值。
+    - 删除：在创建边时可以任意删除属性。
+- 选择起点类型和终点类型：设置边的起点点类型和终点点类型，支持多个起点类型和终点类型。
+    - 起点：选择起点的点类型。
+    - 终点：选择终点的点类型。
+    - 需要提前创建至少一个点类型才能设置边的起点类型和终点。
+    - 如果不选择则表示起点和终点可以为任意点类型，同时画布上不展示对应的边，需要在左侧列表查看边类型。
+
+![图构建-添加边](../../../images/browser/graphbuild-addedge.png)
+
+- 编辑边：可以增加边的属性和修改已有属性的数据类型。需要对每个新增或修改的属性点击`保存`按钮才可以生效。
+
+![图构建-编辑边](../../../images/browser/graphbuild-editedge.png)
+
+###### d.导入模型
+
+在`模型定义`界面点击`导入模型`按钮，可以上传模型文件快速创建模型。
+
+![图构建-导入模型按钮](../../../images/browser/graphbuild-importmodel-button.png)
+
+在`导入模型`界面点击`上传文件`按钮，上传模型文件成功后，点击确定可以导入图模型。
+
+- 覆盖当前画布中的模型：选中该选项，导入时会先清空已有图模型再导入模型文件中的图模型；不选择，会导入模型文件中新增的点类型和边类型，但不会修改已有的点类型和边类型。
+
+![图构建-导入模型](../../../images/browser/graphbuild-importmodel.png)
+
+###### e.导出模型
+
+在`模型定义`界面点击`导出模型`按钮，可以将当前图项目中的图模型导出成json文件。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel-button.png)
+
+模型文件为json格式，不建议手动修改。
+
+![图构建-导出模型按钮](../../../images/browser/graphbuild-exportmodel.png)
+
+##### 2.4.2.2.数据导入
+
+完成`模型定义`之后，点击`数据导入`按钮进入数据导入页面。
+
+![图构建-数据导入](../../../images/browser/graphbuild-dataimport.png)
+
+###### a.数据准备
+
+在数据导入前需要提前准备数据，当前Browser支持CSV文件的上传，需要保证数据文件后缀为csv。
+- 不强制要求包含表头。
+- 支持文本限定符，文本限定符为双引号。
+
+![数据导入-csv](../../../images/browser/graphbuild-import-csv.png)
+
+###### b.上传文件
+
+在`数据导入`页面上传需要导入的数据文件，将数据导入到图项目中。
+
+![数据导入-上传文件](../../../images/browser/graphbuild-import.png)
+
+- 分隔符：数据文件的列分隔符。
+- 文件上传：支持上传多个文件。
+    - 支持弹窗中选择多个上传文件。
+    - 支持将文件拖拽至页面中上传。
+    - 支持同时上传点文件和边文件。
+
+###### c.数据映射
+
+文件上传成功后，需要在`数据导入`页面设置`数据对应表`，将数据文件中的数据列和目标点/边、对应属性建立映射关系。
+
+- 数据对应表：展示已经上传的数据问题。
+    - 文件名称：上传的数据文件名称。
+    - 文件大小：上传的数据文件大小。
+    - 读取结果：数据文件上传结果，success为读取成功。
+    - 删除：在页面中删除，不会删除本地文件。
+- 数据文件映射：每个已上传的数据文件都需要配置映射关系。
+    - 标签：选择该文件对应的点或边类型，只能选择一类点或一类边。
+    - 从第N行，开始：从第N行开始读取数据，系统默认从第0行开始读取数据，如需跳过表头可输入1。
+    - 属性映射：下拉选择数据列对应的属性字段。
+    - 数据预览：系统会预读数据文件的前5行。
+
+![数据导入-数据映射](../../../images/browser/graphbuild-import-datamapping.png)
+
+文件上传成功后，可以点击`继续导入`按钮继续导入其他数据，或者点击`前往图查询`按钮在`图查询`页面查询已导入的数据。
+
+![数据导入-导入成功](../../../images/browser/graphbuild-import-success.png)
+
+#### 2.4.3.图查询
+
+在`图项目`界面点击图项目选项卡中的`图查询`按钮，可以查询和访问图项目中的图数据，产品提供`语句查询`、`路径查询`、`点查询`等多种模式查询图数据，支持切换图项目和查询结果展示。
+
+![图查询-按钮](../../../images/browser/query-button.png)
+
+##### 2.4.3.1.切换图项目
+
+`图查询`功能只能访问一个图项目数据，用户可以在`切换图项目`下拉框中选择并切换至其他图数据。
+
+![图查询-切换图项目](../../../images/browser/query-selectgraph.png)
+
+##### 2.4.3.2.语句查询
+
+Browser提供可视化方式开发和调试图查询语句，用户可以输入图查询语句、执行并返回结果，支持收藏语句和查看图模型。
+
+![图查询-语句查询](../../../images/browser/query-view.png)
+
+###### a.语句查询窗口
+
+用户在`语句查询窗口`输入图查询语句，点击`执行`按钮可以运行对应语句，并在`执行结果页签`展示结果。
+
+- 切换查询语言：提供不同图查询语言模式的切换。_当前只支持Cypher语法_
+
+![图查询-切换语言](../../../images/browser/query-selectgql.png)
+
+- 语句查询窗口：提供当前查询语言的语法提示。
+
+![图查询-语法提示](../../../images/browser/query-gqltips.png)
+
+- 执行：点击`执行`按钮，发送输入的查询语句至后台运行。
+
+![图查询-执行按钮](../../../images/browser/query-execute-button.png)
+
+- 收藏：点击`收藏`按钮，将当前语句查询窗口的内容保存成模板，以便下次使用。
+
+![图查询-收藏按钮](../../../images/browser/query-bookmark-button.png)
+
+- 下载：点击`下载`按钮，将当前语句查询窗口的内容保存成文本文件并下载至本地，以便下次使用。
+
+![图查询-下载按钮](../../../images/browser/query-download-button.png)
+
+详细Cypher使用指南请参考文档：[Cypher API](../8.query/1.cypher.md)
+
+###### b.收藏列表
+
+以列表方式展示已经收藏的查询语句，点击列表中的收藏模板可以使用其中的语句。支持关键字搜索、名称修改以及删除。
+
+![图查询-语句收藏](../../../images/browser/query-bookmark.png)
+
+###### c.查看图模型
+
+Browser提供当前图项目中的图模型查询，方便用户清晰点边类型模型，支持列表展示和画布图谱展示方式，支持隐藏查看图模型窗口。
+
+![图查询-图模型列表](../../../images/browser/query-schema-list.png)
+![图查询-图模型图谱](../../../images/browser/query-schema-graph.png)
+
+##### 2.4.3.3.路径查询
+
+Browser提供`路径查询`模板，用户可以通过选择路径的方式，查找图项目中的图数据是否存在相应的路径。
+
+![路径查询](../../../images/browser/pathquery-result.png)
+
+- 路径：在路径选择下拉框内选择需要查找的路径。
+    - 选择路径：根据图模型的定义，系统会自动匹配出对应的一度关系路径；再次点击路径下拉框会，系统会根据路径终点的点类型自动匹配下一度关系路径。
+![路径查询-选择路径](../../../images/browser/pathquery-select.png)
+    - 执行：点击`执行`按钮返回图项目中匹配的路径。
+    - 高级配置：设置扫描的路径数目，默认为100条路径。
+![路径查询-高级配置](../../../images/browser/pathquery-configuration.png)
+
+_注：需要图模型中的边设置起点和终点，如果图项目中的边均未设置起点和终点，下拉选项无结果_
+
+##### 2.4.3.4.点查询
+
+Browser提供`点查询`模板，用户可以通过选择点属性进行查询，查找图项目中的点数据。
+
+![点查询](../../../images/browser/vertexquery.png)
+
+##### 2.4.3.5.执行结果页签
+
+Browser提供表格文本、点边视图等多种方式展示图查询结果，支持结果下载、插入数据、全屏展示。
+
+###### a.表格文本
+
+Browser提供以表格文本方式展示查询结果。
+
+![JSON视图](../../../images/browser/query-result-txt.png)
+
+###### b.点边视图
+
+Browser提供以画布方式展示查询结果。
+
+![点边视图](../../../images/browser/query-result-graph.png)
+
+###### c.插入数据
+
+Browser提供可视化方式在对应图项目中插入点或边数据。点击`插入数据`按钮，在`插入数据`页签选择点类型或边类型，输入属性值，点击确定完成数据插入。
+
+![插入数据-按钮](../../../images/browser/query-result-insert-button.png)
+
+![插入数据](../../../images/browser/query-result-insert.png)
+
+###### d.下载执行结果
+
+Browser提供图查询结果导出成文本文件功能。点击`下载执行结果`按钮，系统会自动将结果保存成文本文件并下载至本地。
+
+![下载执行结果-按钮](../../../images/browser/query-result-download.png)
+![下载执行结果-按钮](../../../images/browser/query-result-downloadtxt.png)
+
+###### e.全屏展示
+
+Browser提供全屏方式展示图查询结果，点击`全屏显示`按钮全屏展示结果，点击`退出全屏`按钮退出全屏展示。
+
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-button.png)
+![全屏展示](../../../images/browser/query-result-fullscreen.png)
+![全屏展示-按钮](../../../images/browser/query-result-fullscreen-close.png)
+
+#### 2.4.4.图分析
+
+在`图项目`界面点击图项目选项卡中的`图分析`按钮，可以在画布中展示和分析图数据，产品提供`语句查询`和`配置查询`将图项目中的数据查询并加载至画布，支持画布数据的筛选、布局样式调整以及画布操作。
+
+![图分析-按钮](../../../images/browser/graphanalysis-button.png)
+
+如下图所示，图分析功能主要包括：
+
+  1、操作栏：图分析主要操作功能，包括布局切换、查询过滤、布局、样式以及画布操作；
+  2、左边栏：查询、筛选、外观功能操作区域；
+  3、画布区域：展示图数据的区域，展示点和边数据，支持点扩展查询、收起节点、固定节点、删除节点、画布图数据统计、缩放、居中等功能；
+  4、右边栏：选中一个点数据或边数据后，会展示对应的属性信息；
+  5、布局切换：标签布局和卡片布局的切换。
+
+![图分析-操作区域](../../../images/browser/graphanalysis-operation-area.png)
+
+##### 2.4.4.1.语句查询
+
+在`语句查询`功能中，用户可以输入查询语句来查询图数据，并加载数据至画布区域进行展示。
+- 语法说明：TuGraph的[查询语言及语法说明文档](../8.query/1.cypher.md)。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-语句查询](../../../images/browser/graphanalysis-queryfilter-query.png)
+
+##### 2.4.4.2.配置查询
+
+在`配置查询`功能中，用户可以选择节点类型和输入属性条件来查询图数据，并加载数据至画布区域进行展示。
+- 清空画布数据：未选择此按钮，每次执行查询的结果会追加至画布区域；选择此按钮，每次执行查询前会先清空画布。
+
+![图分析-模板查询](../../../images/browser/graphanalysis-queryfilter-configurequery.png)
+
+##### 2.4.4.3.画布分析
+
+在`画布分析`功能中，用户可以对画布中的节点或边数据进行操作和分析，主要包括：选中节点进行扩展查询、收起/展开节点、固定节点，清空画布，套索，点/边检索，画布图例等。画布上的最基础操作是拖拽点数据，鼠标左键选住一个节点并移动鼠标，可以完成点数据位置的移动。
+
+###### a.扩展查询
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，鼠标移至`扩展查询`处弹出二级悬窗，点击对应的扩展度数进行查询。
+- 一度查询：双向扩展一度关系。
+- 二度查询：双向扩展二度关系。
+- 三度查询：双向扩展三度关系。
+
+![图分析-画布分析-扩展查询-按钮](../../../images/browser/graphanalysis-canvas-expand-before.png)
+
+![图分析-画布分析-扩展查询-查询后](../../../images/browser/graphanalysis-canvas-expand-after.png)
+
+###### b.收起/展开节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`收起节点`会隐藏所选节点的一度关系节点；再次右键已`收起节点`的点数据可以进行`展开节点`操作，展示已隐藏的一度关系节点。
+
+![图分析-画布分析-收起节点](../../../images/browser/graphanalysis-canvas-collapse.png)
+
+![图分析-画布分析-展开节点](../../../images/browser/graphanalysis-canvas-expand.png)
+
+###### c.删除节点
+
+在`画布`区域右键点击一个节点数据，弹出操作悬窗，点击`删除节点`会将所选节点移出画布。
+
+![图分析-画布分析-删除节点](../../../images/browser/graphanalysis-canvas-delete.png)
+
+###### d.清空画布
+
+在`操作栏`区域点击`清空画布`按钮，会清除所有画布中的数据。
+
+![图分析-画布分析-清空画布](../../../images/browser/graphanalysis-canvas-clear.png)
+
+###### e.点/边检索
+
+在`点/边检索`窗口选择点或边，并输入关键字，会模糊检索画布中的属性数据，检索后可定位至数据位置。
+
+![图分析-画布分析-检索](../../../images/browser/graphanalysis-canvas-retrieval.png)
+
+###### f.画布图例
+
+在`画布`区域的图例位置，会展示画布中的点类型，点击点类型可以选中对应的点数据，点击更多按钮可以展示统计情况，支持列表或图表方式展示点或边的数量。
+
+![图分析-画布分析-列表](../../../images/browser/graphanalysis-canvas-legend-list.png)
+![图分析-画布分析-图表](../../../images/browser/graphanalysis-canvas-legend-chart.png)
+
+###### g.缩放/居中
+
+可以使用鼠标滚轮和缩放按钮进行缩放。
+![图分析-画布分析-缩放](../../../images/browser/graphanalysis-canvas-zoom.png)
+![图分析-画布分析-缩放](../../../images/browser/graphanalysis-canvas-center.png)
+
+
+##### 2.4.4.4.属性筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`属性筛选`进行筛选过滤。用户可以选择要筛选的点或边类型，以及对应的属性值进行设置，检索到筛选组条件的数据后会在画布上高亮选中对应的点或边数据。
+- 请选择点/边类型：选择需要检索的点类型或边类型。
+- 属性条件：设置需要检索的属性条件，可以设置多组，取并集筛选结果。
+- 添加筛选组：可以多组筛选条件，取并集筛选结果。
+- 重置：可以清空筛选条件。
+
+![图分析-筛选-属性筛选](../../../images/browser/graphanalysis-queryfilter-attributefilter.png)
+
+##### 2.4.4.5.统计筛选
+
+在`操作栏`区域点击`筛选`按钮，在`左边栏`点击`统计筛选`进行画布数据统计。用户可以选择要统计的点或边类型，以及对应的属性值进行设置，系统会自动根据用户选择的点/边类型和属性进行分组统计，支持按照图表和列表两种方式展示结果，同时点击图表或列表区域的数值可以高亮选中画布中的数据。
+
+![图分析-筛选-统计筛选](../../../images/browser/graphanalysis-queryfilter-statisticalfilter.png)
+![图分析-统计筛选-图表切换](../../../images/browser/graphanalysis-queryfilter-statisticalfilter-chartswitch.png)
+
+##### 2.4.4.6.点边布局
+
+在`操作栏`区域点击`布局`按钮，选择对应的布局方式会将画布中的数据进行重新排布，支持力导向布局、同心圆布局、圆形布局、辐射布局、Dagre布局以及网格布局，每种布局方式均有不同布局参数，调整参数后画布中的数据会进行重新排布。
+
+![图分析-布局样式-按钮](../../../images/browser/graphanalysis-style-layout-button.png)
+![图分析-布局样式-布局参数](../../../images/browser/graphanalysis-style-layout-parameters.png)
+
+详细布局参数可参考[AntV-G6](https://g6.antv.antgroup.com/api/graph-layout/guide)。
+
+##### 2.4.4.7.外观样式
+
+在`操作栏`区域点击`外观`按钮，在`左边栏`点击`点样式`或`边样式`进行外观样式配置。
+- 点样式
+    - 应用点类型：设置对应点类型的展示样式，支持同时配置多个点类型外观。
+    - 大小：对应点类型的展示大小。
+    - 颜色：对应点类型的展示颜色。
+    - 图标：对应点类型的图标样式。
+    - 显示文本：对应点类型显示的文本内容，默认为id。
+    - 高级配置：根据设置的条件标记对应的点数据。
+- 边样式
+    - 应用边类型：设置对应边类型的展示样式。
+    - 颜色：对应点类型的展示颜色。
+    - 边宽：对应边类型的展示宽度。
+    - 显示文本：对应边类型显示的文本内容，默认不显示。
+    - 高级配置：根据设置的条件按颜色展示对应的边数据，支持同时配置多个边类型外观。
+
+![图分析-外观](../../../images/browser/graphanalysis-style-appearance.png)
+
+##### 2.4.4.8.视图切换
+
+图分析中支持2D图谱视图、列表视图以及JSON视图。
+![图分析-视图-2D](../../../images/browser/graphanalysis-view-2D.png)
+![图分析-视图-list](../../../images/browser/graphanalysis-view-list.png)
+![图分析-视图-json](../../../images/browser/graphanalysis-view-json.png)
+
+##### 2.4.4.9.标签/卡片布局切换
+
+图分析支持标签布局和卡片布局。
+![图分析-标签](../../../images/browser/graphanalysis-tag.png)
+![图分析-卡片](../../../images/browser/graphanalysis-card.png)
+
+### 2.5.控制台
+
+`控制台`提供可视化的的账户管理和数据库信息查看功能，它为用户提供了全面的账户和角色管理功能，包括账户的增删改查以及禁用，角色的增删改查以及禁用。此外，它也为用户提供了便捷的数据库信息查看功能，让用户可以轻松地查看图数据库的基础信息和配置信息。其中，基础信息主要包括版本号、运行时间、CPP编译版本号等，而数据库配置信息则包括端口号、系统功能参数配置等。
+
+#### 2.5.1.账户管理
+
+##### 2.5.1.1.账户管理
+
+###### a.添加账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户需要输入账户名称、账户描述、账户密码以及相关角色。
+
+![账户管理-添加账户按钮](../../../images/browser/account-add-button.png)
+
+- 账户名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 相关角色：新建账户时必须要选择一个角色，在账户添加成功后，系统会自动生成一个与账户名称一样的角色。
+
+![账户管理-添加账户](../../../images/browser/account-add.png)
+
+###### b.编辑账户
+
+在`账户管理`界面点击`添加`按钮创建新的账户，用户可以编辑账户描述、账户密码以及相关角色。
+
+![账户管理-编辑账户](../../../images/browser/account-edit.png)
+
+###### c.禁用账户
+
+在`账户管理`界面点击`禁用`按钮禁止对应的账户登录和访问，点击`启用`按钮开启对应的账户登录和访问权限。
+
+![账户管理-禁用](../../../images/browser/account-disable.png)
+![账户管理-启用](../../../images/browser/account-enable.png)
+
+###### d.删除账户
+
+在`账户管理`界面点击`删除`按钮删除对应的账户。
+
+![账户管理-删除](../../../images/browser/account-delete.png)
+
+##### 2.5.1.2.角色管理
+
+###### a.添加角色
+
+在`角色管理`界面点击`添加`按钮创建新的角色，用户需要输入角色名称、角色描述以及图权限。
+
+![角色管理-添加角色按钮](../../../images/browser/role-add-button.png)
+
+- 角色名称：支持中文、字母、数字以及下划线，不支持空格以及其他特殊符号。
+- 图权限：browser支持全部、读、写和无共四类图权限配置。
+    - 全部：对应图的读和写权限，包含编辑图模型权限（schema）。
+    - 读写：对应图的写权限，不包含编辑图模型权限（schema）。
+    - 只读：对应图的读权限。
+    - 无：无法访问和操作对应图。
+- 角色冲突：当两个角色对同一个图有不同图权限，同时对一个账户授权了这两个角色，该账户对该图的图权限为两个角色的并集。
+
+![角色管理-添加角色](../../../images/browser/role-add.png)
+
+###### b.编辑角色
+
+在`角色管理`界面点击`编辑`按钮编辑已有角色，用户可以编辑角色描述以及图权限。
+
+![角色管理-编辑角色](../../../images/browser/role-edit.png)
+
+###### c.禁用角色
+
+在`角色管理`界面点击`禁用`按钮禁止对应的角色，点击`启用`按钮开启对应的角色。禁用角色后，对应角色图访问权限失效。
+
+- 禁用角色：禁用之后，对应角色图访问权限失效。
+    - 当一个用户拥有两个角色对同一个图有操作权限时，当禁用其中一个角色时，另一个角色权限同样有效。
+
+![角色管理-禁用](../../../images/browser/role-disable.png)
+![角色管理-启用](../../../images/browser/role-enable.png)
+
+###### d.删除角色
+
+在`角色管理`界面点击`删除`按钮删除对应的角色。
+
+![角色管理-删除](../../../images/browser/role-delete.png)
+
+#### 2.5.2.数据库信息
+
+##### 2.5.2.1.基础信息
+
+`基础信息`获取当前系统运行的状态，并展示关键信息。
+
+![数据库信息-基础信息](../../../images/browser/db_basic.png)
+
+|参数    |含义    |
+|-------|--------|
+|TuGraph版本号|当前TuGraph的版本号，x.x.x|
+|运行时间|TuGraph服务启动到现在的时间|
+|服务器代码版本|tugraph-db仓库的当前commit|
+|前端代码版本|tugraph-web仓库的当前commit|
+|CPP编译器版本号|编译TuGraph时的CPP版本号|
+|Python版本号|编译TuGraph时的Python版本号|
+|CPP编译器ID|编译TuGraph时的CPP类型|
+
+也可以通过命令获取当前系统运行状态。
+
+```
+CALL dbms.system.info()
+```
+
+##### 2.5.2.2.数据库配置信息
+
+`数据库配置信息`获取当前系统运行的配置参数，并展示关键信息。调整配置参数或了解详细配置参数请参考[数据库运行-服务配置](../5.installation&running/7.tugraph-running.md)。
+
+![数据库信息-数据库配置信息](../../../images/browser/db_configuration.png)
+
+| 参数                          | 含义                                 |
+|-----------------------------|------------------------------------|
+| bind_host                   | 系统启动时设置的host，一般为0.0.0.0            |
+| browser.credential_timeout                   | 浏览器缓存的用户名和密码过期时间                   |
+| browser.retain_connection_credentials                   | 浏览器是否缓存用户名和密码                      |
+| disable_auth                | 是否关闭token认证的定期更新，如为true则token可以永久使用 |
+| durable                     | 是否开启存储底层持久化，如为false，数据异步更新到磁盘      |
+| enable_audit_log            | 是否开启审计日志                           |
+| enable_backup_log           | 是否开启实时增量备份                         |
+| enable_fulltext_index       | 是否开启全文索引                           |
+| enable_ha       | 是否开启高可用                            |
+| enable_ip_check             | 是否开启IP白名单                          |
+| enable_rpc                  | 是否开启RPC端口                          |
+| enable_ssl                  | 是否开启ssl加密传输                        |
+| optimistic_txn              | 是否开启乐观多线程写入事务                      |
+| port                        | 当前系统的REST访问端口                      |
+| rpc_port                    | RPC 及 HA 服务所用端口                    |
+| subprocess_max_idle_seconds | 自进程最大空闲时间，线程池参数                    |
+| thread_limit                | 服务端同时使用的最大线程数                      |
+| verbose                     | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细  |
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
new file mode 100644
index 0000000000..0815c0865d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/4.user-guide/2.tugraph-browser-legacy.md
@@ -0,0 +1,168 @@
+# 可视化操作手册（旧版）
+
+> 此文档主要介绍 TuGraph Browser 的使用
+
+## 定义
+
+TuGraph Browser 是 TuGraph 提供的可视化开发工具。
+
+## 作用
+
+TuGraph Browser 的主要功能是为使用图数据库的开发人员，提供可视化的图数据开发，图数据管理和维护等功能。
+
+## 操作详情
+
+### 1.连接数据库
+
+当用户完成图数据库的安装后，可以通过浏览器进行访问，TuGraph Browser 工具。用户只需要在浏览器地址栏输入：TuGraph 所在服务器的 IP:Port。默认的端口使用的是 7090。
+
+### 2.登录数据库
+
+![alt 登录](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/1.tugraph-browser-lpgin.png)
+
+- 页面打开成功会，首先进图的是登录页面，用户需要填写账号和密码进行登录。
+- 默认账号：admin
+- 默认密码：73@TuGraph
+- 建议用户登录后，及时修改初始化的密码
+
+### 3.工作台
+
+#### 3.1 快速上手
+
+- 首次登录，系统会默认创建 default 空图
+
+  ![alt 快速上手](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/2.tugraph-browser-quickstart-01.png)
+
+- 用户点击帮助选项，并选择快速上手
+
+  ![alt 帮助](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/3.tugraph-browser-quickstart-02.png)
+
+- 然后点击“一键创建模型”——>"一键创建数据"，就可以完成内置的 Movie 数据图谱的构建
+
+#### 3.2 创建子图和示例
+
+##### 3.2.1 创建子图
+
+- 点击新建子图
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/4.tugraph-browser-create-subgraph-01.png)
+- 填写表单信息
+  ![alt 填写表单](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/5.tugraph-browser-create-subgraph-02.png)
+  - 子图名称
+  - 子图描述
+  - 配置信息
+  - 点击确认，提示创建成功
+- 切换子图
+  ![alt 切换子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/6.tugraph-browser-use-graph-01.png)
+
+- 点击新建示例
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-scene-01.png)
+- 选择示例并点击创建
+  ![alt 创建子图](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/select-scene.png)
+
+#### 3.3 查询
+
+![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/7.tugraph-browser-query-01.png)
+
+##### 3.3.1 页面组成
+
+- cypher 输入框
+- 结果集展示区域
+
+##### 3.3.2 结果集展示区域功能详情
+
+- 结果集标签展示及功能
+  ![alt 结果集标签](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/tugraph-browser-result.png)
+  - 这里展示了结果集的所有类型统计
+  - 点击不同的“label（标签）”，可以进行以下修改操作
+    - 修改展示颜色
+    - 修改节点大小或边的粗细
+    - 修改默认展示属性或系统属性
+    - 布局修改
+      - 力导布局
+      - 网格布局
+      - 树形布局
+      - 环境布局
+    - 边聚合
+      - 相同类型，方向的边可以进行合并
+    - 创建节点
+      - 点击创建节点按钮
+      - 选择节点类型
+      - 添写节点内容
+    - 创建关系
+      - 在画布中选择起点和终点
+      - 选择可以匹配的类型
+      - 填写节点信息
+    - 停止布局
+      - 当数据量过大，导致浏览器页面卡顿时候，可以点击这个停止布局的按钮，能够提高体验的流畅度
+    - 鼠标悬停
+      - 开启此功能，可以高亮显示鼠标悬停节点的一度邻居节点
+    - 结果集导出
+      - 可以将结果集导出为 png，json，csv 三种不同的文件形式
+    - 刷新
+      - 点击刷新按钮，会重新执行当前页面的初始 cypher 语句，并刷新结果集
+    - 最大化
+      - 点击最大化，结果集展示区域将全屏展示
+    - 结果集展示形式切换
+      - 支持图谱、表格、文本三种形式
+
+##### 3.3.3 建模
+
+- 点边模型
+  ![alt 建模](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/3.3.0-image/create-schema.png)
+- 点边模型支持实时的、增、删、改、查
+
+- 点边模型支持导入和导出
+
+##### 3.3.4 数据导入
+
+- 本地数据导入
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/14.tugraph-browser-import-data-01.png)
+
+  - 选择文件编码格式
+  - 选择本地 CSV 文件
+  - 选择对应的节点或边的模型
+  - 进行数据映射
+  - 完成数据导入
+  - 单个文件最大支持2GB
+
+##### 3.3.5 插件
+
+- 存储过程的使用
+
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/15.tugraph-browser-plugin.png)
+
+  - 用户可以上传本地编写的 Plugin 程序，并在可视化页面进行执行，并查看执行结果
+  - 用户可以在可视化对插件进行、卸载、执行、下载等操作
+
+##### 3.3.6 帮助
+
+- 其中记录了 TuGraph-browser 的使用方式
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/16.TuGraph-browser-help.png)
+
+#### 3.4 控制台
+
+##### 3.4.1 数据库基础信息
+
+- 展示数据库相关的基础配置信息
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/17.tugraph-browser-config.png)
+
+##### 3.4.2 权限管理
+
+- 用来创建用户和角色的功能模块，用户可以在这里进行权限的管理操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/18.tugraph-browser-auth.png)
+
+##### 3.4.3 实时状态
+
+- 这里展示了数据库实时状态，包括：CPU 使用率、内存用率、磁盘使用率、数据请求次数、磁盘 IO
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/19.tugraph-browser-status.png)
+
+##### 3.4.4 任务管理
+
+- 在这里用户可以看到在正在执行中的任务，可以在此进行停止任务的操作
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/20.tugraph-browser-task.png)
+
+##### 3.4.5 审计日志
+
+- 这里记录的数据库相关的审计日志，用来排查使用遇到的问题
+  ![alt 查询](https://tugraph-web-static.oss-cn-beijing.aliyuncs.com/%E6%96%87%E6%A1%A3/2.Operating/21.tugraph-browser-log.png)
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/4.user-guide/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/4.user-guide/index.rst
new file mode 100644
index 0000000000..811fbf0563
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/4.user-guide/index.rst
@@ -0,0 +1,9 @@
+可视化操作指南
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/1.environment.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/1.environment.md
new file mode 100644
index 0000000000..e2524b4134
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/1.environment.md
@@ -0,0 +1,40 @@
+# 环境准备
+
+> 此文档主要介绍 TuGraph 部署时所需的软硬件环境。
+
+## 1.硬件环境
+
+### 1.1. CPU
+TuGraph 无论是物理、虚拟还是容器化环境，均支持 X86_64 和 ARM64 架构的硬件平台，测试认证过的硬件平台包括 Intel、AMD、Kunpeng、Hygon、飞腾等。
+
+### 1.2. 内存
+
+我们建议内存容量不小于实际的数据大小。如果最求极致的性能，把所有的数据缓存到内存里是最理想的。在数据访问的局部性上，图数据库的局部性要比关系型数据库差，因此如果数据在内存中放不下，通常会频繁地换入换出。
+
+### 1.3. 外存
+我们强烈建议用户使用 NVMe SSD 作为外存，数据库有大量的写操作需要同步的外存，通常为随机写，外存的读写性能很容易成为整体数据库运行的性能瓶颈。因此，高IOPS、低延迟的 NVMe SSD 是最优的选择。
+
+如果现实条件只能使用 SATA接口的SSD，或者云上的网盘，性能虽然会受到影响，但 TuGraph 依然能正确的运行。
+
+外存大小建议为实际数据大小的4倍，比如数据为1TB，则准备4TB的硬盘会比较稳妥。
+
+## 2.软件环境
+
+### 2.1. 操作系统
+
+TuGraph 能够兼容主流操作系统，包括Ubuntu、CentOS、SUSE、银河麒麟、 中标麒麟、UOS等，均通过测试认证。
+
+其中最稳定使用的系统版本是 Ubuntu 18.04、CentOS 7、CentOS 8。
+
+### 2.2. 系统库
+
+编译环境和运行环境对系统库的要求不一样，具体请参考[环境分类](2.environment-mode.md)。
+
+## 3.典型配置推荐
+
+| 硬件      | 最低配置   | 建议配置                   |
+| -------- | --------- | ------------------------ |
+| CPU      | 4 Cores   | 64 Cores                 |
+| 内存      | 4GB       | 512GB                    |
+| 外存      | 100GB     | 2TB NVMe SSD             |
+| OS       | Linux 4.9 | CentOS 7.3               |
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/2.environment-mode.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/2.environment-mode.md
new file mode 100644
index 0000000000..3dbbe91ee5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/2.environment-mode.md
@@ -0,0 +1,22 @@
+# 环境分类
+
+> 此文档主要介绍 TuGraph 涉及的三种环境。
+
+## 1.分类
+
+根据环境所承载功能的不同，区分为编译环境，运行环境，以及精简运行环境。
+* 编译环境，具备TuGraph编译的所有依赖库，包含运行环境的所有依赖，并且能够编译TuGraph源码，但不包含预编译好的TuGraph可执行文件和库文件，供开发者编译源码使用。
+* 运行环境，具备GCC/Java/Python环境，能够运行TuGraph的所有功能，并且能承载全文索引，java client，c++源码上传为plugin，以及python plugin的完整功能，内置TuGraph预编译好的可执行文件和库文件，供客户直接安装使用，无需编译源码。
+* 精简运行环境，约等于裸系统加预编译TuGraph，仅能运行TuGraph的基本功能，无C++ plugin编译运行，仅so上传，无全文索引，无python plugin，供快速搭建试用。
+
+TuGraph编译后，会把所有的依赖库以.a的形式打包在一起，因此原则上运行不需要的其他的依赖库。但TuGraph支持存储过程，即在服务端编译C++代码，因此在环境中依然需要涉及的编译器。
+
+## 2.依赖系统库
+
+针对三种环境，除去TuGraph的运行包，所需要的系统库如下：
+* 编译环境，包括gcc、python、java等编译器，也包含antlr4、pybind11等，具体参见tugraph-db源码目录 ci/images/tugraph-compile-*-Dockerfile。
+* 运行环境，主要由存储过程引入，包括gcc、boost、cmake等，具体参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile。
+* 精简运行环境，无，可以参见tugraph-db源码目录 ci/images/ tugraph-mini-runtime-*-Dockerfile。
+
+
+
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/3.docker-deployment.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/3.docker-deployment.md
new file mode 100644
index 0000000000..7f64ab0db8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/3.docker-deployment.md
@@ -0,0 +1,122 @@
+# Docker部署
+
+>本文档介绍TuGraph Compile及TuGraph Runtime的Docker镜像的创建、下载。
+
+## 1.简介
+
+- TuGraph Compile Image：提供编译环境，可以用于TuGraph的编译，测试；
+- TuGraph Runtime Image：提供二进制可运行环境，附带TuGraph库和可执行文件；
+- TuGraph Mini Runtime Image: 提供二进制可运行环境，不包含TuGraph中Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+## 2.现有Docker Image
+
+### 2.1.镜像下载方式
+
+镜像托管在[DockerHub]( https://hub.docker.com/u/tugraph )，可直接下载使用。
+
+最新版本的Docker地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+### 2.2.命名规范
+
+#### 2.2.1.TuGraph Compile Image
+
+提供编译环境，可以用于TuGraph的编译。
+
+`tugraph/tugraph-compile-[os name & version]:[tugraph compile version]`
+
+例如： `tugraph/tugraph-compile-centos7:1.2.0`
+
+#### 2.2.2.TuGraph Runtime Image
+
+提供二进制可运行环境，附带TuGraph库和可执行文件。
+
+`tugraph/tugraph-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如：`tugraph/tugraph-runtime-centos7:3.4.0`
+
+#### 2.2.3.TuGraph Mini Runtime Image
+
+提供二进制可运行环境，不包含TuGraph种Java、Python相关的功能，无C++ plugin编译运行，仅so上传。
+
+`tugraph/tugraph-mini-runtime-[os name & version]:[tugraph-runtime version]`
+
+例如： `tugraph/tugraph-mini-runtime-centos7:3.4.0`
+
+### 2.3.常见Docker操作
+
+Docker由Dockerfile生成，注意创建镜像需要下载依赖，因此网络问题可能会导致创建较慢或者创建失败。注意不要覆盖镜像，除非tag为 `latest`。
+
+创建Compile镜像
+```bash
+docker build -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+创建Runtime / Mini Runtine镜像
+```bash
+docker build --build-arg FILEPATH="${rpm_path_in_oss}" --build-arg FILENAME="${rpm_name}" -f tugraph-compile-centos7-Dockerfile -t tugraph/tugraph-runtime-centos7:1.2.0 .
+```
+
+修改镜像名称
+```bash
+docker tag ${image_name}:${image_tag} tugraph/tugraph-runtime-centos7:3.3.0
+```
+
+上传镜像
+```bash
+docker push tugraph/tugraph-compile-centos7:1.2.0 .
+```
+
+获取镜像
+```bash
+docker pull tugraph/tugraph-compile-centos7:1.2.0
+```
+
+导出镜像
+```bash
+docker save ${image_name}:${image_tag} | gzip > lgraph_latest.tar.gz
+```
+
+导入镜像
+```bash
+docker load --input lgraph_latest.tar.gz
+```
+
+其他Docker操作请参考[docker官方文档](https://docs.docker.com/engine/reference/commandline/cli )
+
+
+### 2.4. M1芯片支持
+
+在 M1 芯片的机器上运行 amd64 容器可能造成未知错误。TuGraph提供 arm64 的镜像供 M1 机器使用。
+包含compile和runtime两种镜像。
+
+在`tugraph-runtime-centos7:3.6.0`与`tugraph-compile-centos7:1.2.7`及之后，`tugraph-runtime-centos7`与`tugraph-compile-centos7`提供linux/amd64和linux/arm64/v8两种架构的镜像，可以在 M1 机器上通过docker pull获取arm64架构镜像。
+
+### 2.5. 运行服务
+
+1. 拉取镜像
+   ```shell
+   docker pull tugraph/tugraph-runtime-centos7:${VERSION}
+   ```
+
+2. 启动docker
+
+   ```shell
+    docker run -d -p 7070:7070  -p 7687:7687 -p 9090:9090 -v /root/tugraph/data:/var/lib/lgraph/data  -v /root/tugraph/log:/var/log/lgraph_log \
+    --name tugraph_demo ${REPOSITORY}:${VERSION}
+   
+   # ${REPOSITORY}是镜像地址，${VERSION}是版本号。
+   # 7070是默认的http端口，访问tugraph-db-browser使用。   
+   # 7687是bolt端口，bolt client访问使用。
+   # 9090是默认的rpc端口，rpc client访问使用。
+   # /var/lib/lgraph/data是容器内的默认数据目录，/var/log/lgraph_log是容器内的默认日志目录
+   # 命令将数据目录和日志目录挂载到了宿主机的/root/tugraph/上进行持久化，您可以根据实际情况修改。
+   ```
+
+## 3. 使用和开发TuGraph-DB Docker镜像时的最佳实践
+
+在您刚开始为TuGraph做出贡献时，请仔细阅读以下要点，并遵循它们。
+
+- 为了避免过多的Docker Layer，请尽量像现有的Dockerfile一样单行的写ENV和RUN将您的依赖项添加到Docker中。
+- 对于您需要构建依赖项的软件包/资源，请使用原始的软件包/资源，而不是在没有VCS跟踪的情况下修改这些资源。之后联系TuGraph团队将其上传到OSS以加速构建过程，如同您在Dockerfiles中看到的URL一样。
+- 为了使开发更加高效，最好从Base TuGraph编译镜像添加依赖项开始，完成开发确认依赖没问题后在Dockerfile中重新复制该过程。
+- CI使用了Docker镜像。如果您的CI失败，请检查依赖项问题。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/4.local-package-deployment.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/4.local-package-deployment.md
new file mode 100644
index 0000000000..04125f35c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/4.local-package-deployment.md
@@ -0,0 +1,39 @@
+# 本地包部署
+
+> 此文档主要介绍 TuGraph 的本地包部署。
+
+## 1. 环境准备
+
+TuGraph本地包部署需要对应的环境，快速验证可以使用精简安装包，几乎不需要任何第三方库。
+
+如果您需要使用完整的TuGraph功能，请参见tugraph-db源码目录 ci/images/tugraph-runtime-*-Dockerfile，该脚本包含完整的环境构建流程。
+
+## 2. 安装包下载
+
+最新版本的安装包地址参见 [文档地图](../../1.guide.md)的"TuGraph最新版本"章节。
+
+也可以访问Github进行下载：[TuGraph Release](https://github.com/TuGraph-family/tugraph-db/releases)
+
+## 3. CentOS 下的安装方法
+
+用于在 CentOS 上安装的 TuGraph 的.rpm 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.rpm 安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ rpm -ivh tugraph-x.y.z.rpm
+```
+
+用户也可以通过指定`--prefix`选项指定安装目录。
+
+## 4. Ubuntu 下的安装方法
+
+用于在 Ubuntu 上安装的 TuGraph 的.deb 安装包，其中包含了 TuGraph 可执行文件以及编写嵌入式程序和存储过程所需的头文件和相关库文件。
+
+使用已经下载完成的`tugraph_x.y.z.deb`安装包在终端下安装，只需要运行以下命令：
+
+```shell
+$ sudo dpkg -i tugraph-x.y.z.deb
+```
+
+该命令默认将 TuGraph 安装于`/usr/local`目录下。用户也可以通过指定 `--instdir=<directory>` 选项更改安装目录。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/5.cloud-deployment.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/5.cloud-deployment.md
new file mode 100644
index 0000000000..7ac7e1cfc0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/5.cloud-deployment.md
@@ -0,0 +1,125 @@
+# 云部署
+
+> 此文档主要介绍 TuGraph 的云部署，也可参见[阿里云计算巢部署文档]( https://aliyun-computenest.github.io/quickstart-tugraph/ )。
+
+## 1.简介
+
+TuGraph（tugraph.antgroup.com）是蚂蚁集团研发的高性能图数据库（Graph Database）。TuGraph在计算巢上提供了社区版服务，您无需自行购置云主机，即可在计算巢上快速部署TuGraph服务、实现运维监控，从而搭建您自己的图应用。本文向您介绍如何开通计算巢上的TuGraph社区版服务，以及部署流程和使用说明。
+
+## 2.实例说明
+
+TuGraph部署的为社区开源版本，源码参考Github Repo，目前可以选择的实例规格如下：
+
+| 规格族         | vCPU与内存                 | 系统盘              | 公网带宽      |
+|----------------|-------------------------|-------------------|-----------|
+| ecs.r7a.xlarge | AMD 内存型 r7a，4vCPU 32GiB | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+| ecs.r6.xlarge  | 内存型r6，4vCPU 32GiB       | ESSD云盘 200GiB PL0 | 固定带宽1Mbps |
+
+预估费用在创建实例时可实时看到（目前为免费）。 如需更多规格、其他服务（如集群高可用性要求、企业级支持服务等），请联系我们 tugraph@service.alipay.com。
+
+## 3.部署流程
+
+### 3.1.准备工作
+
+在正式开始使用前，您需要一个阿里云账号，对ECS、VPC等资源进行访问和创建操作。
+
+- 若您使用个人账号，可以直接创建服务实例
+- 若您使用RAM用户创建服务实例，且是第一次使用阿里云计算巢
+    - 需要在创建服务实例前，对使用的RAM用户的账号添加相应资源的权限。添加RAM权限的详细操作，请参见为 __RAM用户授权__。所需权限如下表所示。
+    - 且需要授权创建关联角色，参考下图，选中 __同意授权并创建关联角色__
+
+| 权限策略名称                    | 备注                                    |
+|---------------------------------|---------------------------------------|
+| AliyunECSFullAccess             | 管理云服务器服务（ECS）的权限             |
+| AliyunVPCFullAccess             | 管理专有网络（VPC）的权限                 |
+| AliyunROSFullAccess             | 管理资源编排服务（ROS）的权限             |
+| AliyunComputeNestUserFullAccess | 管理计算巢服务（ComputeNest）的用户侧权限 |
+| AliyunCloudMonitorFullAccess    | 管理云监控（CloudMonitor）的权限          |
+
+![同意授权并创建关联角色](../../../images/cloud-deployment-1.png)
+
+### 3.2.部署入口
+
+您可以在阿里云计算巢自行搜索，也可以通过下述部署链接快速到达。
+
+[部署链接](https://computenest.console.aliyun.com/user/cn-hangzhou/serviceInstanceCreate?ServiceId=service-7b50ea3d20e643da95bf&&isTrial=true)
+
+### 3.3.申请试用
+
+在正式试用前，需要申请试用，按照提示填写信息，在审核通过后就可以创建TuGraph服务。
+
+![申请试用](../../../images/cloud-deployment-2.png)
+
+### 3.4.创建TuGraph服务
+
+#### 3.4.1.参数列表
+
+您在创建服务实例的过程中，需要配置服务实例信息的参数列表，具体如下。
+
+| 参数组               | 参数项   | 示例          | 说明                                                           |
+|--------------------|----------|---------------|--------------------------------------------------------------|
+| 服务实例名称         | N/A      | test          | 实例的名称                                                     |
+| 地域                 | N/A      | 华东1（杭州）   | 选中服务实例的地域，建议就近选中，以获取更好的网络延时。          |
+| 付费类型配置         | 付费类型 | 按量付费      | 免费使用请选用按量付费                                         |
+| 可用区配置           | 部署区域 | 可用区I       | 地域下的不同可用区域，确保实例非空                              |
+| 选择已有基础资源配置 | VPC ID   | vpc-xxx       | 按实际情况，选择专有网络的ID。                                   |
+| 选择已有基础资源配置 | 交换机ID | vsw-xxx       | 按实际情况，选择交换机ID。若找不到交换机, 可尝试切换地域和可用区 |
+| ECS实例配置          | 实例类型 | ecs.r6.xlarge | 当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格                      |
+|ECS实例配置|	实例密码|	**|	设置实例密码。长度8~30个字符，必须包含三项（大写字母、小写字母、数字、 ()`~!@#$%^&*_-+={}[]:;'<>,.?/ 中的特殊符号）。|
+
+#### 3.4.2.具体步骤
+
+创建服务按如下步骤进行，参考下图：
+
+- 创建实例名称，如下图中“test”
+- 选择地域，如下图中“华东1（杭州）”
+
+![创建实例](../../../images/cloud-deployment-3.png)
+
+- 选择实例类型，当前支持ecs.r6.xlarge和ecs.r7a.xlarge规格。如果列表中无机型可选，请尝试选择其他的部署区域
+- 选中机型
+- 配置实例的密码
+- 选择部署区域，如下图中“可用区I”
+
+![选择区域](../../../images/cloud-deployment-4.png)
+
+- 点击下一步，进入订单确认页面
+- 勾选“权限确认”和“服务条款”中的复选框
+- 点击左下角绿色背景的开始免费试用，即可创建服务实例
+
+![确认](../../../images/cloud-deployment-5.png)
+
+### 3.5.启动TuGraph服务
+
+- 查看服务实例：服务实例创建成功后，部署时间大约需要2分钟。部署完成后，页面上可以看到对应的服务实例，如下图
+
+![查看实例](../../../images/cloud-deployment-6.png)
+
+- 点击该服务实例访问TuGraph。进入到对应的服务实例后，可以在页面上获取到web、rpc、ssh共3种使用方式，并且页面上展示了admin用户的密码
+
+![访问方式](../../../images/cloud-deployment-7.png)
+
+- 点击web的链接，即可跳转访问已经部署好的TuGraph Web。建议新手先通过TuGraph Web，快速使用demo上手。
+    - 首先在TuGraph Web的登录页面上，输入默认用户名admin和页面上展示的admin用户的密码进行登录，参考下图
+    - 登录完成后，选择任意一个带有官方图标的图项目，其中内置了demo数据，开启图数据的探索和发现！
+
+![登录](../../../images/cloud-deployment-8.png)
+![创建demo](../../../images/cloud-deployment-9.png)
+
+## 4.常见FAQ
+
+### 问题一：部署区域无可用资源
+
+有时，所选部署区域（如可用区G）没有所选套餐的可用资源，会报错如下图所示
+
+![部署区域错误](../../../images/cloud-deployment-10.png)
+
+__解决办法__：尝试选择其他区域，如可用区I等
+
+### 问题二: 启动后web访问不通
+
+web的启动需要一点点时间，请稍后刷新页面即可。
+
+### 问题三: 登录时的用户名密码不正确
+
+请注意检查，登录时使用的密码应为详情页面展示的密码。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/6.compile.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/6.compile.md
new file mode 100644
index 0000000000..08da97c191
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/6.compile.md
@@ -0,0 +1,28 @@
+# 从源码编译
+
+> 本文档主要描述 TuGraph 从源码进行编译。
+
+## 1.前置条件
+
+推荐在linux系统下搭建TuGraph。同时docker环境是个不错的选择,如果你想设置一个新的环境，请参考[Dockerfile](3.docker-deployment.md)。
+
+## 2.编译介绍
+
+以下是编译TuGraph的步骤：
+
+1. 如果需要web接口运行`deps/build_deps.sh`，不需要web接口则跳过此步骤
+2. 根据容器系统信息执行`cmake .. -DOURSYSTEM=centos`或者`cmake .. -DOURSYSTEM=ubuntu`，如果在arm机器编译（如M1芯片的Mac中，需要加上` -DENABLE_BUILD_ON_AARCH64=ON`）
+3. `make`
+4. `make package` 或者 `cpack --config CPackConfig.cmake`
+
+示例：`tugraph/tugraph-compile-centos7`Docker环境
+
+```bash
+$ git clone --recursive https://github.com/TuGraph-family/tugraph-db.git
+$ cd tugraph-db
+$ deps/build_deps.sh
+$ mkdir build && cd build
+$ cmake .. -DOURSYSTEM=centos7
+$ make
+$ make package
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/7.tugraph-running.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/7.tugraph-running.md
new file mode 100644
index 0000000000..f28babfe65
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/7.tugraph-running.md
@@ -0,0 +1,217 @@
+# 数据库运行
+
+> 本文档主要描述 TuGraph 服务的运行模式、启动、停止和重启的操作,以及 TuGraph 的服务配置参数、配置文件格式和命令行配置参数。
+
+## 1.前置条件
+
+TuGraph 运行的前置条件为 TuGraph 正确安装，参考[安装流程](1.environment.md)。
+
+TuGraph 运行需要保证库文件 liblgraph.so 的文件位置在环境变量 LD_LIBRARY_PATH。
+
+运行 TuGraph 进程的用户不需要超级权限，但需要对配置文件（一般为lgraph.json）及文件中涉及的文件有读权限，并且对数据文件夹、日志文件夹等有写权限。
+
+## 2.运行模式
+
+TuGraph 可以作为前台普通进程启动，也可以作为后台守护进程启动。
+当作为普通进程运行时，TuGraph 可以直接将日志打印到终端，这在调试服务器配置时非常方便。但是，由于前台进程在终端退出后被终止，因此用户须确保在 TuGraph 服务器处于运行状态时，终端保持打开状态。另一方面，在守护进程模式下，即使启动它的终端退出，TuGraph 服务器也可以继续运行。因此，在长时间运行的服务器下推荐以守护进程模式启动 TuGraph 服务器。
+
+### 2.1.运行普通进程
+
+`lgraph_server -d run`命令可以将 TuGraph 作为普通进程运行。普通进程依赖命令行终端，因此终端结束时，TuGraph 进程也会自动终止。普通进程模式配合`--log_dir ""`可以将进程日志直接输出到终端，因此更方便调试。注：当不使用`-d run`命令时，将默认运行普通进程。
+
+lgraph_server的默认路径为：/usr/local/bin/lgraph_server 。
+
+lgraph.json的默认路径为：/usr/local/etc/lgraph.json 。
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d run -c lgraph.json --log_dir ""
+```
+或者：
+```shell
+$ ./lgraph_server -c lgraph.json --log_dir ""
+```
+
+普通模式的运行输出示例：
+
+```shell
+**********************************************************************
+*                  TuGraph Graph Database v4.3.2                     *
+*                                                                    *
+*    Copyright(C) 2018-2023 Ant Group. All rights reserved.          *
+*                                                                    *
+**********************************************************************
+Server is configured with the following parameters:
+  Backup log enable:                   0
+  DB directory:                        /var/lib/lgraph/data
+  HA enable:                           0
+  HTTP port:                           7070
+  HTTP web dir:                        /usr/local/share/lgraph/browser-resource
+  RPC enable:                          1
+  RPC port:                            9090
+  SSL enable:                          0
+  Whether the token is unlimited:      0
+  audit log enable:                    0
+  bind host:                           0.0.0.0
+  bolt port:                           7687
+  disable auth:                        0
+  durable:                             0
+  log dir:                             ""
+  log verbose:                         1
+  number of bolt io threads:           1
+  optimistic transaction:              0
+  reset admin password if you forget:  0
+  subprocess idle limit:               600
+  thread limit:                        0
+[20240730 15:34:27.848783 0x00007f81bb3889c0 INFO  src/server/lgraph_server.h:78] [StateMachine] Builtin services are disabled according to ServerOptions.has_builtin_services
+[20240730 15:34:27.849116 0x00007f81bb3889c0 INFO  src/server/lgraph_server.cpp:268] Listening for RPC on port 9090
+[20240730 15:34:27.868819 0x00007f81bb3889c0 INFO  src/restful/server/rest_server.cpp:479] Listening for REST on port 7070
+[20240730 15:34:27.869970 0x00006e7d435ff700 INFO  src/server/bolt_server.cpp:36] bolt server run
+[20240730 15:34:27.870040 0x00007f81bb3889c0 INFO  src/server/lgraph_server.cpp:302] Server started.
+```
+
+普通进程模式下，用户可以通过按 `CTRL+C` 来提前终止 TuGraph 进程。
+
+### 2.2.运行进程守护模式
+
+启动命令：
+
+```shell
+$ ./lgraph_server -d start -c lgraph.json
+```
+
+守护模式的运行输出示例：
+
+```shell
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+## 3.服务操作
+
+### 3.1.启动服务
+
+TuGraph 需要通过 `lgraph_server -d start` 命令行启动，启动命令示例如下：
+
+```bash
+$ ./lgraph_server -d start -c lgraph.json
+Starting lgraph...
+The service process is started at pid 12109.
+```
+
+此命令启动的 TuGraph 服务器进程为守护进程，它将从文件`lgraph.json`加载相关配置。服务器启动后，它将开始在日志文件中打印日志，之后可用该日志文件确定服务器的状态。
+
+### 3.2.停止服务
+
+用户可以使用`kill`命令以及`lgraph_server -d stop`命令停止 TuGraph 守护进程。由于可能在同一台计算机上运行多个 TuGraph 服务器进程，因此我们使用`.pid`文件区分不同的服务器进程，该文件写入启动该进程的工作目录。因此，需要在相同工作目录中运行`lgraph_server-d stop`命令，以停止正确的服务器进程。
+
+```shell
+user@host:~/tugraph$ ./lgraph_server -d start -c lgraph.json
+20200508122306.378: Starting lgraph...
+20200508122306.379: The service process is started at pid 93.
+
+user@host:~/tugraph$ cat ./lgraph.pid
+93
+
+user@host:~/tugraph$ ./lgraph_server -d stop -c lgraph.json
+20200508122334.857: Stopping lgraph...
+20200508122334.857: Process stopped.
+```
+
+### 3.3.重启服务
+
+用户也可以通过`lgraph_server -d restart`来重启 TuGraph 服务：
+
+```bash
+$ ./lgraph_server -d restart
+Stopping lgraph...
+Process stopped.
+Starting lgraph...
+The service process is started at pid 20899.
+```
+
+### 3.4.新旧前端切换
+
+进入容器，可以通过修改配置文件"/usr/local/etc/lgraph.json"中的"web"参数来选择使用老版本或新版本的前端。对于老版本，可以将"web"的值设为"/usr/local/share/lgraph/resource"；对于新版本，可以将"web"的值设为"/usr/local/share/lgraph/browser-resource"。完成配置文件的修改后，请执行命令 `docker restart tugraph` 以使更改生效。需要注意的是，新版本是默认选项。
+
+## 4.服务配置
+
+TuGraph 服务器在启动时从配置文件和命令行选项加载配置，如果在配置文件和命令行中同一选项指定了不同的值，将优先使用命令行中指定的值。
+
+### 4.1.配置参数
+
+具体参数及其类型描述如下：
+
+| **参数名**                      | **<nobr>参数类型</nobr>** | **参数说明**                                                                                                                                                                          |
+|------------------------------|-----------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| directory                    | 字符串                   | 数据文件所在目录。如果目录不存在 ，则自动创建。默认目录为 /var/lib/lgraph/data。                                                                                                                               |
+| durable                      | 布尔值                   | 是否开启实时持久化。关闭持久化可以减少写入时的磁盘 IO 开销，但是在机器断电等极端情况下可能丢失数据。默认值为 `true`。                                                                                                                  |
+| host                         | 字符串                   | REST 服务器监听时使用的地址，一般为服务器的 IP 地址。默认地址为 0.0.0.0。注：在HA模式下，host需要设置为对应服务器的IP地址，不能设置为0.0.0.0。                                                                                           |
+| port                         | 整型                    | REST 服务器监听时使用的端口。默认端口为 7070。                                                                                                                                                      |
+| enable_rpc                   | 布尔值                   | 是否使用 RPC 服务。默认值为 false。                                                                                                                                                           |
+| rpc_port                     | 整型                    | RPC 及 HA 服务所用端口。默认端口为 9090。                                                                                                                                                       |
+| bolt_port                    | 整型                    | Bolt 客户端端口。默认端口为 7687。                                                                                                                                                            |
+| enable_ha                    | 布尔值                   | 是否启动高可用模式。默认值为 false。                                                                                                                                                             |
+| ha_log_dir                   | 字符串                   | HA 日志所在目录，需要启动 HA 模式。默认值为空。                                                                                                                                                       |
+| verbose                      | 整型                    | 日志输出信息的详细程度。可设为 0，1，2，值越大则输出信息越详细。默认值为 1。                                                                                                                                         |
+| log_dir                      | 字符串                   | 日志文件所在的目录。默认目录为 /var/log/lgraph/。                                                                                                                                                 |
+| ssl_auth                     | 布尔值                   | 是否使用 SSL 安全认证。当开启时，REST 服务器只开启 HTTPS 服务。默认值为 false。                                                                                                                               |
+| web                          | 字符串                   | Web 文件（包括可视化组件）的存储位置，默认设置在 /usr/local/share/lgraph/browser-resource 目录下。而对于之前的老版本，该目录则位于 /usr/local/share/lgraph/resource 。                                                       |
+| server_cert                  | 字符串                   | 在 SSL 认证开启时，服务器所使用的 certificate 文件路径。默认路径为 /usr/local/etc/lgraph/server-cert.pem。                                                                                                 |
+| server_key                   | 字符串                   | 在 SSL 认证开启时，服务器所使用的公钥文件。默认目录为 /usr/local/etc/lgraph/server-key.pem。                                                                                                               |
+| enable_audit_log             | 布尔值                   | 是否启用审计日志，默认值为 false。                                                                                                                                                              |
+| audit_log_expire             | 整型                    | 启用审计日志时，日志的有效时间（小时），超时自动清理，值为 0 时表示不清理。默认值为 0。                                                                                                                                    |
+| audit_log_dir                | 字符串                   | 启用审计日志时，日志文件的存放目录。默认目录为 $directory/_audit_log_。                                                                                                                                   |
+| load_plugins                 | 布尔值                   | 启动服务时导入所有存储过程。默认值为 true。                                                                                                                                                          |
+| optimistic_txn               | 布尔值                   | 为 Cypher 开启乐观多线程写入事务。默认为 false。                                                                                                                                                   |
+| disable_auth                 | 布尔值                   | 关闭 REST 验证。默认为 false。                                                                                                                                                             |
+| ha_snapshot_interval_s       | 整型                    | 快照间隔（以秒为单位），默认值为 604800。-1表示不自动生成快照。                                                                                                                                              |
+| ha_heartbeat_interval_ms     | 整型                    | 心跳间隔（以毫秒为单位）。 默认值为 1000。                                                                                                                                                          |
+| ha_node_offline_ms           | 整型                    | 心跳超时且节点下线间隔（以毫秒为单位）。默认为 60000。                                                                                                                                                    |
+| ha_node_remove_ms            | 整型                    | 节点被视为完全死亡并从列表中删除的间隔（以毫秒为单位）。默认值为 120000。                                                                                                                                          |
+| ha_first_snapshot_start_time | 字符串                   | 第一次打快照的时间，格式为"HH:MM:SS"，表示为在下一个HH:MM:SS时间点第一次打snapshot，以后每ha_snapshot_interval_s秒打一次。默认值为""，表示在0-ha_snapshot_interval_s内的任一时刻随机打第一次snapshot，以后每ha_snapshot_interval_s秒打一次snapshot |
+| enable_ip_check              | 布尔值                   | 允许 IP 白名单，默认值为 false。                                                                                                                                                             |
+| idle_seconds                 | 整型                    | 子进程可以处于空闲状态的最大秒数。 默认值为 600。                                                                                                                                                       |
+| enable_backup_log            | 布尔值                   | 是否启用备份日志记录。 默认值为 false。                                                                                                                                                           |
+| backup_log_dir               | 字符串                   | 存储备份文件的目录。 默认值为空。                                                                                                                                                                 |
+| snapshot_dir                 | 字符串                   | 存储快照文件的目录。 默认值为空。                                                                                                                                                                 |
+| thread_limit                 | 整型                    | 同时使用的最大线程数。 默认值为 0，即不做限制，以 license 为准。                                                                                                                                            |
+| unlimited_token              | 布尔值                   | 是否将链接token设置为无期限。 默认值为 false，有效期为24小时。                                                                                                                                            |
+| reset_admin_password         | 布尔值                   | 是否重置管理者密码。 默认值为 false。 为 true 时，密码重置为`73@TuGraph`。                                                                                                                                |
+| enable_fulltext_index        | 布尔值                   | 是否启用全文索引功能，默认值为 false。                                                                                                                                                            |
+| fulltext_analyzer            | 字符串                   | 全文索引分词器类型。可设为`StandardAnalyzer`或者`SmartChineseAnalyzer`。默认是`StandardAnalyzer`                                                                                                     |
+| fulltext_commit_interval     | 整形                    | 全文索引数据提交周期,针对写操作，单位秒。默认是 0，立即提交。                                                                                                                                                  |
+| fulltext_refresh_interval    | 整形                    | 全文索引数据刷新周期，针对读操作，单位秒。默认是 0，立即可以读到最新写入的数据。                                                                                                                                         |
+| ha_conf                      | 字符串                   | 根据 host1:port1,host2:port2,host3:port3 初始化HA集群，默认值为空。                                                                                                                             |
+| ha_node_join_group_s         | 整形                    | 节点尝试加入高可用集群的等待时长，单位秒，默认是 10。                                                                                                                                                      |
+| ha_bootstrap_role            | 整形                    | 是否使用bootstrap方式启动，以及使用该方式启动的服务器角色，0代表不使用bootstrap方式启动，1代表使用bootstrap方式启动且本节点为leader，2代表使用bootstrap方式启动且本节点为follower，只有这3种选项。 默认值为 0。                                              |
+| help                         | 布尔值                   | 打印此帮助消息。 默认值为 false。                                                                                                                                                              |
+| browser.credential_timeout                         | 整形                    | 浏览器缓存的用户名和密码过期时间。                                                                                                                                                                 |
+| browser.retain_connection_credentials                         | 布尔值                   | 浏览器是否缓存用户名和密码。                                                                                                                                                              |
+
+### 4.2.服务器配置文件
+
+TuGraph 的配置文件以 JSON 格式存储。建议将大多数配置存储在配置文件中，并且仅在需要时使用命令行选项临时修改某些配置参数。
+一个典型的配置文件如下：
+
+```json
+{
+  "directory" : "/var/lib/lgraph/data",
+  "host" : "0.0.0.0",
+  "port" : 7070,
+  "rpc_port" : 9090,
+  "enable_rpc" : true,
+  "bolt_port": 7687,
+  "enable_ha" : false,
+  "verbose" : 1,
+  "log_dir" : "/var/log/lgraph_log",
+  "disable_auth" : false,
+  "ssl_auth" : false,
+  "server_key" : "/usr/local/etc/lgraph/server-key.pem",
+  "server_cert" : "/usr/local/etc/lgraph/server-cert.pem",
+  "web" : "/usr/local/share/lgraph/browser-resource"
+}
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/8.high-availability-mode.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/8.high-availability-mode.md
new file mode 100644
index 0000000000..1d38b39017
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/8.high-availability-mode.md
@@ -0,0 +1,179 @@
+# 部署高可用模式
+
+> 此文档主要介绍了高可用模式的原理、准备工作、以及服务器的操作说明
+
+## 1.原理
+
+TuGraph 通过多机热备份来提供高可用（HA）模式。在高可用模式下，对数据库的写操作会被同步到所有服务器（非witness）上，这样即使有部分服务器宕机也不会影响服务的可用性。
+
+高可用模式启动时，多个 TuGraph 服务器组成一个备份组，即高可用集群。每个备份组由三个或更多 TuGraph 服务器组成，其中某台服务器会作为`leader`，而其他复制组服务器则作为`follower`。写入请求由`leader`
+提供服务，该`leader`将每个请求复制同步到`follower`，并在请求同步到服务器后才能响应客户端。这样，如果任何服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选择出新的`leader`。
+
+TuGraph的高可用模式提供两种类型的节点：`replica`节点和`witness`节点。其中，`replica`节点是普通节点，有日志有数据，可对外提供服务。
+而`witness`节点是一种只接收心跳和日志但不保存数据的节点。根据部署需求，`leader`节点和`follower`节点可以灵活的部署为`replica`节点或`witness`节点。
+基于此，TuGraph高可用模式的部署方式有两种：一是普通部署模式，二是带witness的简约部署模式。
+
+对于普通部署模式，`leader`和所有`follower`均为`replica`类型的节点。写入请求由`leader`提供服务，该`leader`将每个请求复制同步到`follower`，
+并在请求同步到超过半数的服务器后才能响应客户端。这样，如果少于半数的服务器发生故障，其他服务器仍将具有到目前为止已写入的所有数据。如果`leader`
+服务器发生故障，其他服务器将自动选举出新的`leader`，通过这种方式保证数据的一致性和服务的可用性。
+
+然而，在用户服务器资源不够或者发生网络分区时，不能建立正常的HA集群。此时，由于`witness`节点没有数据，对资源占用小，可以将`witness`节点和`replica`节点部署在一台机器上。
+例如，当只有2台机器的情况下，可以在一台机器上部署`replica`节点，在另一台机器上部署`replica`节点和`witness`节点，不仅节省资源，而且不需要把日志应用到状态机上，
+也不需要生成和安装快照，因此响应请求的速度很快，可以在集群崩溃或网络分区时协助快速选举出新的`leader`，这就是TuGraph HA集群的简约部署模式。
+尽管`witness`节点有诸多好处，但是由于没有数据，集群实际上增加了一个不能成为`leader`的节点，因此可用性会略有降低。为提高集群的可用性，
+可通过指定`ha_enable_witness_to_leader`参数为`true`，允许`witness`节点临时当主。`witness`节点在把新日志同步到其他节点之后，
+会将leader角色主动切换到有最新日志的节点。
+
+v3.6及以上版本支持此功能。
+
+## 2.准备工作
+
+要启用高可用模式，用户需要：
+
+- 三台及以上的 TuGraph 服务器实例。
+
+- 在启动 lgraph_server 时打开高可用模式，可以使用配置文件或者命令行将`enable_ha`选项设置为`true`。
+
+- 设置正确的`rpc_port`，可通过配置文件或者命令行设置。
+
+## 3.启动初始备份组
+
+安装好TuGraph之后，可以使用`lgraph_server`命令在不同的机器上启动高可用集群。本节主要讲解高可用集群的启动方式，启动之后的集群状态管理参见[lgraph_peer工具](../6.utility-tools/5.ha-cluster-management.md)
+
+### 3.1.初始数据一致
+
+当启动时所有服务器中的数据相同或没有数据时，用户可以通过指定`--ha_conf host1:port1,host2:port2`启动服务器。
+这种方式可以将准备好的所有TuGraph实例一次性加入初始备份组，由备份组中的所有服务器根据raft协议选举出`leader`，并将其他服务器以`follower`的角色加入备份组。
+
+启动初始备份组的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+### 3.2.初始数据不一致
+
+如果第一台服务器中已有数据（以`lgraph_import`工具导入或从非高可用模式的服务器传输得到），
+并且之前并未在高可用模式下使用，则用户应使用boostrap方式启动。
+以`ha_bootstrap_role`参数为1在bootstrap模式下启动有数据的服务器，并通过`ha_conf`参数指定本机为`leader`。
+在bootstrap模式下，服务器在将新加入的服务器添加到备份组之前会将自己的
+数据复制到新服务器中，以使每个服务器中的数据保持一致。
+
+启动有数据服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 1
+```
+
+其他无数据的服务器需要指定`ha_bootstrap_role`参数为2，并通过`ha_conf`参数指定`leader`即可，命令示例如下所示
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_bootstrap_role 2
+```
+
+**使用bootstrap启动HA集群时需要注意两点：**
+1. 需要等待`leader`节点生成snapshot并且成功启动之后再加入`follower`节点，否则`follower`节点可能加入失败。在启动`follower`节点时可以将`ha_node_join_group_s`参数配置的稍大，以在加入HA集群时多次等待和超时重试。
+2. HA集群只有在第一次启动时可以使用bootstrap模式，后续再启动时只能使用普通模式(见3.1节)启动，尤其不能让同一个集群的多个节点以bootstrap模式启动，否则可能产生数据不一致的情况
+
+## 4.启动witness节点
+
+### 4.1.不允许witness节点成为leader
+
+`witness`节点的启动方式和普通节点的启动方式一致，只需要设置`ha_is_witness`参数为`true`即可。需注意，witness节点的数量应少于集群节点总数量的一半。
+
+启动`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1
+```
+
+注：默认不允许`witness`节点成为`leader`节点，这可以提高集群的性能，但是在`leader`节点崩溃时会降低集群的可用性。
+
+### 4.2.允许witness节点成为leader
+
+可以通过指定`ha_enable_witness_to_leader`参数为`true`，使得`witness`节点可以临时成为`leader`节点，在将新日志同步完成之后再主动切主
+
+启动允许成为`leader`节点的`witness`节点服务器的命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090 --ha_is_witness 1 --ha_enable_witness_to_leader 1
+```
+
+注：尽管允许`witness`节点成为`leader`节点可以提高集群的可用性，但是在极端情况下可能会影响数据的一致性。因此一般应保证`witness`节点数量+1少于集群节点总数量的一半。
+
+## 5.横向扩展其他服务器
+
+启动初始备份组后，如果想对备份组进行横向扩展，要将新服务器添加到备份组，
+应使用`--ha_conf HOST：PORT`选项，其中`HOST`可以是该备份组中已有的任何服务器的 IP 地址，
+而`PORT`是其 RPC 端口。例如：
+
+```bash
+./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090
+```
+
+此命令将启动一台高可用模式的 TuGraph 服务器，并尝试将其添加到包含服务器`172.22.224.15:9090`的备份组中。
+请注意，加入备份组需要服务器将其数据与备份组的`leader`服务器同步，此过程可能需要相当长的时间，具体取决于数据的大小。
+
+## 6.停止服务器
+
+当服务器通过`CTRL-C`下线时，它将通知当前的`leader`服务器，告知其从备份组中删除该下线的服务器。如果`leader`服务器下线，
+它将在下线前将`leader`身份权限传给另一台服务器。
+
+如果服务器被终止或者与备份组中的其他服务器失去连接，则该服务器将被视为失败节点，`leader`服务器将在特定时限后将其从备份组中删除。
+
+如果任何服务器离开备份组并希望重新加入，则必须从`--ha_conf HOST:PORT`选项开始，其中`HOST`是当前备份组中的某台服务器的 IP 地址。
+
+## 7.重启服务器
+
+不建议重新启动整个备份组，因为它会中断服务。如果需要，可以关闭所有服务器。但在重新启动时，
+必须保证关闭时的备份组中至少有N/2+1的服务器能正常启动，否则启动失败。 并且，
+无论初始启动复制组时是否指定`enable_bootstrap`为true，重启服务器时都只需通过
+指定`--ha_conf host1:port1,host2:port2`参数一次性重启所有服务器即可，命令示例如下所示：
+
+```bash
+$ ./lgraph_server -c lgraph.json --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 8.docker部署高可用集群
+
+在真实业务场景中，很可能遇到在多种操作系统或架构上部署高可用集群的需求。
+差异化的环境可能导致编译TuGraph时缺少某些依赖。因此，
+在docker中编译软件并部署高可用集群是非常有应用价值的。以centos7版本的docker为例，
+部署高可用集群的步骤如下所示。
+
+### 8.1.安装镜像
+使用如下命令下载TuGraph的编译docker镜像环境
+```shell
+docker pull tugraph/tugraph-compile-centos7
+```
+然后拉取TuGraph源码并编译安装
+
+### 8.2.创建容器
+使用如下命令创建容器，使用`--net=host`使得容器运行在host模式，此模式下
+docker和宿主机和共享网络namespace，即共用同一个IP。
+```shell
+docker run --net=host -itd -p -v {src_dir}:{dst_dir} --name tugraph_ha tugraph/tugraph-compile-centos7 /bin/bash
+```
+
+### 8.3.启动服务
+在每台服务器上使用如下命令启动服务，因为docker和宿主机共享IP，所以可以直接指定在宿主机IP上启动服务
+```shell
+$ lgraph_server -c lgraph.json --host 172.22.224.15 --rpc_port 9090 --enable_ha true --ha_conf 172.22.224.15:9090,172.22.224.16:9090,172.22.224.17:9090
+```
+
+## 9.查看服务器状态
+
+备份组的当前状态可以在 TuGraph 可视化工具、REST API 以及 Cypher 查询中获取。
+
+在 TuGraph 可视化工具中，可以在 DBInfo 部分中找到备份组中的服务器及其角色列表。
+
+使用 REST API 时，可以使用`GET /info/peers` 请求获取信息。
+
+在 Cypher 中，使用`CALL dbms.listServers()`语句来查询当前备份组的状态信息。
+
+## 10.高可用模式下数据同步问题
+
+在高可用模式下，同一备份组中的不同服务器可能并不总是处于相同的状态。出于性能原因，如果请求已同步到超过一半的服务器，则`leader`服务器将认为该请求属于`committed`状态。尽管其余服务器最终将收到新请求，但服务器的状态不一致将持续一段时间。客户端也可能向刚刚重新启动的服务器发送请求，从而具有较旧的状态。
+
+为了确保客户端看到一致连续的数据，特别是为了摆脱`反向时间旅行`问题（其中客户端读取比以前看到的状态更旧的状态），每个 TuGraph 服务器都会保持一个单调增加的数据版本号。备份组中数据版本号到数据库状态的映射全局一致，这意味着如果两台服务器具有相同的数据版本号，则它们必须具有相同的数据。响应请求时，服务器在响应中包含了其数据版本号。因此，客户端可以知道它看到了哪个版本。客户端收到旧版本的数据之后可以重新向Leader发送请求，从而获取到最新的数据。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/index.rst
new file mode 100644
index 0000000000..f2bf6bb3a5
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/5.installation&running/index.rst
@@ -0,0 +1,9 @@
+安装和运行
+============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/1.data-import.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/1.data-import.md
new file mode 100644
index 0000000000..30a7d25af3
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/1.data-import.md
@@ -0,0 +1,483 @@
+# 数据导入
+
+> 此文档主要介绍 TuGraph 的数据导入功能。其中包括 CSV 格式的分隔符，jsonline 的格式示例，以及导入在线和离线的两种模式。
+
+## 1.简介
+
+在图数据库服务安装成功后，您可以使用`lgraph_import`批量导入工具将现有数据导入 TuGraph。`lgraph_import`支持从 CSV 文件和 JSON 数据源导入数据。
+
+> CSV 格式
+
+```
+[movies.csv]
+id, name, year, rating
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+> jsonline 格式
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+TuGraph 支持两种导入模式：
+
+- _离线模式_：读取数据并将其导入指定服务器的数据文件，应仅在服务器离线时完成。
+- _在线模式_：读取数据并将其发送到工作中的服务器，然后将数据导入其数据库。
+
+## 2.CSV文件格式分隔符
+
+    CSV格式的分隔符可以是单字符或多字符组成的字符串，其中不能包含`\r`或`\n`。注意不同的shell会对输入字符串做不同的处理，因此针对不同的shell输入参数可能需要不同的转义处理。
+
+此外，`lgraph_import`还支持以下转义字符，以便输入特殊符号：
+
+| 转义符 | 说明                                                             |
+| ------ | ---------------------------------------------------------------- |
+| \\     | 反斜杠`\\`                                                       |
+| \\a    | 响铃，即 ASCII 码 0x07                                           |
+| \\f    | form-feed，即 ASCII 码 0x0c                                      |
+| \\t    | 水平制表符，即 ASCII 码 0x09                                     |
+| \\v    | 垂直制表符，即 ASCII 码 0x0b                                     |
+| \\xnn  | 两位十六进制数，表示一个字节，如\\x9A                            |
+| \\nnn  | 三位八进制数，表示一个字节，如\\001, \\443，数值范围不能超过 255 |
+
+例：
+
+```bash
+$ ./lgraph_import -c ./import.config --delimiter "\001\002"
+```
+
+## 3.配置文件
+
+`lgraph_import`工具通过指定的配置文件进行环境配置。配置文件描述输入文件的路径、它们所代表的点/边以及点/边的格式。
+
+### 3.1.配置文件格式
+
+配置文件包含两部分：schema 和 files。`schema`部分定义 label，`files`部分描述要导入的数据文件。
+
+#### 3.1.1.关键字
+
+- schema (数组形式）
+  - label（必选，字符串形式）
+  - type（必选，值只能是 VERTEX 或者 EDGE）
+  - properties（数组形式，对于点必选，对于边如果没有属性可以不配置）
+    - name（必选，字符串形式）
+    - type （必选，BOOL，INT8，INT16，INT32，INT64，DATE，DATETIME，FLOAT，DOUBLE，STRING，BLOB）
+    - optional（可选，代表该字段可以配置，也可以不配置）
+    - index（可选，该字段是否需要建索引）
+    - unique（可选，该字段是否建索引，并且是 unique 类型的，即全局唯一）
+    - pair_unique（可选，该字段是否建索引，并且是 pari_unique 类型的，即两点间唯一，仅用于边索引）unique与pair_unique只能设置一个，同时设置并运行将会因为输入异常而终止
+  - primary (仅点配置，必选，主键字段，需指定一个 property，用来唯一确定一个点)
+  - temproal (仅边配置，可选，指定时间戳属性用于存储层排序)
+  - temporal_field_order (仅边配置，可选，默认为"ASC"，表示升序，也可配置为"DESC"，表示降序)
+  - constraints (仅边配置，可选，数组形式，起点和终点的 label，不配置或者为空代表不限制)
+  - detach_property (点边都可配置，可选，默认是`false`。`true` 代表属性数据单独存放，在内存不够，属性数据比较多的场景下可以减少io读放大)
+- files （数组形式）
+  - path（必选，字符串，可以是文件路径或者目录的路径，如果是目录会导入此目录下的所有文件，需要保证有相同的 schema）
+  - header（可选，数字，头信息占文件起始的几行，没有就是 0）
+  - format（必须选，只能是 JSON 或者 CSV）
+  - label（必选，字符串）
+  - columns（数组形式）
+    - SRC_ID (特殊字符串，仅边有，代表这列是起始点数据)
+    - DST_ID (特殊字符串，仅边有，代表这列是目的点数据)
+    - SKIP   (特殊字符串，代表跳过这列数据)
+    - [property]
+  - SRC_ID (仅边配置，值是起始点标签)
+  - DST_ID (仅边配置，值是目的点标签)
+
+#### 3.1.2.索引长度
+因为TuGraph对key的长度有限制，唯一索引不允许建立超过限制长度的索引，而非唯一索引会对超过长度限制的属性进行截断处理，并且在通过迭代器遍历非唯一索引时，拿到的key也是经过截断的，可能和预期不一致。针对不同类型的非唯一索引，截断长度是不同的。
+##### 3.1.2.1.unique索引
+unique索引是全局唯一的，该索引key的最大长度是480bytes。primary作为特殊的unique索引，因此最大key的长度也是480bytes，超过无法建立索引。
+##### 3.1.2.2.pair_unique索引
+pair_unique索引是指两点间唯一的索引，这种类型的索引只能创建于边的schema中，这种索引在用户指定的key后面加上了源点和目标点的vid，每个vid是5bytes长度。因此最大key的长度是470bytes，超过无法建立索引。
+##### 3.1.2.3.非唯一索引
+非唯一索引是指既没有设置unique为1，也没有设置pair_unique为1的索引，在TuGraph的实现中，此类索引一个key可能映射到多个值，为了加速查找和写入，在用户指定的key后面加上了一组vid或euid中的最大值。其中对于创建于点中的非唯一索引，key后面跟着vid，每个vid是5bytes长度，因此最大长度是475bytes。
+对于创建于边中的非唯一索引，key后面跟着euid，每个euid是24bytes长度，因此最大长度是456bytes。索引key超过对应长度则会自动截断。
+
+### 3.2.配置文件示例
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid",
+      "detach_property": false
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+对于上述配置文件，定义了三个 label：两个点类型`actor`和`movie`，一个边类型`role`。每个 label 都描述了：label 的名字、类型（点还是边）、属性字段有哪些以及每个字段的类型。对于点，另外定义了 primary 字段是哪个；对于边，另外定义了 constraints 字段，用来限制边的起点和终点只能是哪些组合。
+
+还描述了三个数据文件，两个点的数据文件`actors.csv`和`movies.csv`，一个边的数据文件`roles.csv`。每个部分都描述了：文件的路径（path）、数据类型（format）、信息头占开头几行（header）、是哪个 label 的数据（label）、文件中每行数据中的每个列对应的字段是哪个。
+
+对于上述配置文件，import 工具在执行的过程中会先在 TuGraph 中创建`actor`、`movie`、`role`这三个 label，然后再执行三个文件的数据导入。
+
+## 4.离线全量导入
+
+离线模式只能在离线状态的服务器使用。离线导入会创建一张新图，因此更适合新安装的 TuGraph 服务器上的第一次数据导入。
+要在离线模式下使用`lgraph_import`工具，可以指定`lgraph_import --online false`选项。要了解可用的命令行选项，请使用`lgraph_import --online false --help`：
+
+```shell
+$ ./lgraph_import --online false -help
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    ...
+    -h, --help          Print this help message. Default=0.
+```
+
+命令行参数：
+
+- **-c, --config_file** `config_file`: 导入配置文件名，其格式要求见下述。
+- **--log** `log_dir`: 日志目录。默认为空字符串，此时将日志信息输出到控制台。
+- **--verbose** `0/1/2`: 日志等级，等级越高输出信息越详细。默认为 1。
+- **-i, --continue_on_error** `true/false`: 在碰到错误时跳过错误并继续，默认为 false，碰到错误立即退出。
+- **-d, --dir** `{diretory}`: 数据库目录，导入工具会将数据写到这个目录。默认为`./db`。
+- **--delimiter** `{delimiter}`: 数据文件分隔符。只在数据源是 CSV 格式时使用，默认为`","`。
+- **-u, --username** `{user}`: 数据库用户名。需要是管理员用户才能执行离线导入。
+- **-p, --password** `{password}`: 指定的数据库用户的密码
+- **--overwrite** `true/false`: 是否覆盖数据。设为 true 时，如果数据目录已经存在，则覆盖数据。默认为`false`。
+- **-g, --graph** `{graph_name}`: 指定需要导入的图种类。
+- **-h, --help**: 输出帮助信息。
+
+### 4.1.离线导入示例
+
+在这个例子中，我们使用上面描述的电影-演员数据来演示导入工具的使用方法。待导入数据分为三个文件：`movies.csv`，`actors.csv`，`roles.csv`。
+
+`movies.csv`包含的是电影的信息，其中每部电影有一个 id（作为检索的 primary key），此外每部电影还拥有 title、year 和 rating 等属性。（数据来自[IMDb](http://www.imdb.com)）。
+
+```
+  [movies.csv]
+  id, name, year, rating
+  tt0188766,King of Comedy,1999,7.3
+  tt0286112,Shaolin Soccer,2001,7.3
+  tt4701660,The Mermaid,2016,6.3
+```
+
+对应的 jsonline 格式如下:
+也可以所有字段都是字符串形式，导入的时候会转换成对应的类型
+
+```json
+["tt0188766","King of Comedy",1999,7.3]
+["tt0286112","Shaolin Soccer",2001,7.3]
+["tt4701660","The Mermaid",2016,6.3]
+```
+
+```json
+["tt0188766","King of Comedy","1999","7.3"]
+["tt0286112","Shaolin Soccer","2001","7.3"]
+["tt4701660","The Mermaid","2016","6.3"]
+```
+
+`actors.csv`包含的是演员的信息。每个演员也拥有一个 id，以及 name 等属性。
+
+```
+  [actors.csv]
+  id, name
+  nm015950,Stephen Chow
+  nm0628806,Man-Tat Ng
+  nm0156444,Cecilia Cheung
+  nm2514879,Yuqi Zhang
+```
+
+> 对应的 jsonline 格式如下:
+
+```json
+["nm015950","Stephen Chow"]
+["nm0628806","Man-Tat Ng"]
+["nm0156444","Cecilia Cheung"]
+["nm2514879","Yuqi Zhang"]
+```
+
+`roles.csv`则包含了演员在哪个电影中扮演了哪个角色的信息。其中每一行记录的是指定演员在指定电影里饰演的角色，对应数据库中的一条边。`SRC_ID` 和 `DST_ID` 分别是边的源点和目标点，他们分别是`actors.csv`和`movies.csv`中定义的`primary`属性。
+
+```
+  [roles.csv]
+  actor, role, movie
+  nm015950,Tianchou Yin,tt0188766
+  nm015950,Steel Leg,tt0286112
+  nm0628806,,tt0188766
+  nm0628806,coach,tt0286112
+  nm0156444,PiaoPiao Liu,tt0188766
+  nm2514879,Ruolan Li,tt4701660
+```
+
+对应的 jsonline 格式如下:
+
+```json
+["nm015950","Tianchou Yin","tt0188766"]
+["nm015950","Steel Leg","tt0286112"]
+["nm0628806",null,"tt0188766"]
+["nm0628806","coach","tt0286112"]
+["nm0156444","PiaoPiao Liu","tt0188766"]
+["nm2514879","Ruolan Li","tt4701660"]
+```
+
+`配置文件import.conf`，注意每个文件中有两个标题行，因此我们需要指定`HEADER=2`选项。
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "aid", "type": "STRING" },
+        { "name": "name", "type": "STRING" }
+      ],
+      "primary": "aid"
+    },
+    {
+      "label": "movie",
+      "type": "VERTEX",
+      "properties": [
+        { "name": "mid", "type": "STRING" },
+        { "name": "name", "type": "STRING" },
+        { "name": "year", "type": "INT16" },
+        { "name": "rate", "type": "FLOAT", "optional": true }
+      ],
+      "primary": "mid"
+    },
+    {
+      "label": "play_in",
+      "type": "EDGE",
+      "properties": [{ "name": "role", "type": "STRING", "optional": true }],
+      "constraints": [["actor", "movie"]]
+    }
+  ],
+  "files": [
+    {
+      "path": "actors.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "actor",
+      "columns": ["aid", "name"]
+    },
+    {
+      "path": "movies.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "movie",
+      "columns": ["mid", "name", "year", "rate"]
+    },
+    {
+      "path": "roles.csv",
+      "header": 2,
+      "format": "CSV",
+      "label": "play_in",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+使用导入配置文件，我们现在可以使用以下命令导入数据：
+
+```shell
+$ ./lgraph_import
+        -c import.conf             # 从import.conf读取配置信息
+        --dir /data/lgraph_db      # 将数据存放在/data/lgraph_db
+        --graph mygraph            # 导入名为 mygraph 的图
+```
+
+**注意**：
+
+- 如果名为`mygraph`的图已存在，导入工具将打印错误消息并退出。要强制覆盖图形，可以使用`--overwrite true` 选项。
+- 配置文件和数据文件必须使用 UTF-8 编码（或普通 ASCII 编码，即 UTF-8 的子集）存储。如果任何文件使用 UTF-8 以外的编码（例如，带有 BOM 或 GBK 的 UTF-8）编码，则导入将失败，并输出分析器错误。
+
+## 5.在线增量导入
+
+在线导入模式可用于将一批文件导入已在运行中的 TuGraph 实例中。这对于处理通常以固定的时间间隔进行的增量批处理更新非常便利。`lgraph_import --online true`选项使导入工具能够在线模式工作。与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true -h
+Available command line options:
+    --online            Whether to import online.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --log               Log file to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --username      DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --skip_packages     How many packages should we skip. Default=0.
+    --delimiter         Delimiter used in the CSV files
+    --breakpoint_continue
+                        When the transmission process is interrupted,whether
+                        to re-transmit from zero package next time. Default=false
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据发送到正在运行的 TuGraph 实例中，该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+
+如果用户和密码有效，并且指定的图存在，导入工具将将数据发送到服务器，服务器随后解析数据并将其写入指定的图。数据将以大约 16MB 大小的包发送，在最近的换行符处中断。每个包都是以原子方式导入的，这意味着如果成功导入包，则成功导入所有数据，否则，任何数据都不会进入数据库。如果指定了`--continue_on_error true`，则忽略数据完整性错误，并忽略违规行。否则，导入将在第一个错误包处停止，并打印出已导入的包数。在这种情况下，用户可以修改数据以消除错误，然后使用`--skip_packages N`重做导入以跳过已导入的包。
+
+## 6.在线全量导入
+
+在线全量导入可用于将一批文件导入运行中的TuGraph实例，TuGraph支持将两种不同类型的数据在线导入到实例中：
+1. 和离线导入类型相同的原数据文件（csv等）
+2. TuGraph的底层存储文件，即data.mdb文件，该文件可以由离线导入生成，也可以是其他TuGraph db的文件。
+这两种方式的适用场景不同，第一种是直接将数据导入到TuGraph中，优点是一次性自动导入，操作步骤简单。但是会在server端启动一个离线导入线程，
+只适合单机情况下的小规模数据导入。第二种是将已经准备好的底层存储文件导入到TuGraph中，虽然需要提前准备好mdb文件，但是对系统资源却没有很高的要求，
+而且支持远程下载文件导入，非常方便，适用于高可用模式或者大规模数据的在线导入。
+
+### 6.1 从原数据导入
+从原数据导入的执行方式是向运行中的TuGraph实例发送导入请求，
+实例接到请求后先使用离线导入（V3）的方式将数据导入一个临时的db中，然后在实例中新建子图并将临时db的数据文件迁移到新子图中，最后刷新实例的元数据。
+相比在线增量导入，在线全量导入的性能更高。
+`lgraph_import --online true --online_type 1`选项使导入工具能够在线全量导入。
+与`离线模式`一样，在线模式有自己的命令行选项集，可以使用`-h，--help`选项进行打印输出：
+
+```shell
+$ lgraph_import --online true --online_type 1 -h
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --full              Whether to full import online. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -c, --config_file   Config file path.
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -i, --continue_on_error
+                        When we hit a duplicate uid or missing uid, should we
+                        continue or abort. Default=0.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --delimiter         Delimiter used in the CSV files. Default=,.
+    --log               Log dir to use, empty means stderr. Default="".
+    -v, --verbose       Verbose level to use, higher means more verbose.
+                        Default=1.
+    --overwrite         Whether to overwrite the existing DB if it already
+                        exists. Default=0.
+    --parse_block_size  Block size per parse. Default=8388608.
+    --parse_block_threads
+                        How many threads to parse the data block. Default=5.
+    --parse_file_threadsHow many threads to parse the files. Default=5.
+    --generate_sst_threads
+                        How many threads to generate sst files. Default=15.
+    --read_rocksdb_threads
+                        How many threads to read rocksdb in the final stage.
+                        Default=15.
+    --vid_num_per_reading
+                        How many vertex data to read each time. Default=10000.
+    --max_size_per_reading
+                        Maximum size of kvs per reading. Default=33554432.
+    --compact           Whether to compact. Default=0.
+    --keep_vid_in_memoryWhether to keep vids in memory. Default=1.
+    --enable_fulltext_index
+                        Whether to enable fulltext index. Default=0.
+    --fulltext_index_analyzer
+                        fulltext index analyzer. Default=StandardAnalyzer.
+                        Possible values: {<2>: SmartChineseAnalyzer,
+                        StandardAnalyzer}
+    -h, --help          Print this help message. Default=0.
+```
+
+文件的相关配置在配置文件中指定，其格式与`离线模式`完全相同。但是，我们现在不是将数据导入本地数据库，而是将数据导入正在运行的 TuGraph 实例中，
+该实例通常运行在与运行导入工具的客户端计算机不同的计算机上。因此，我们需要指定远程计算机的 HTTP 地址的URL、DB用户和密码。
+并且，配置文件（config_file参数）要求是 TuGraph 实例机器上的uri路径，其file配置也要求是 TuGraph 实例机器上资源的绝对路径。
+
+如果用户和密码有效，导入工具将在服务器端执行在线全量导入。如果想导入的图已存在，可以使用`--overwrite true` 选项强制覆盖子图。
+
+### 6.2 从数据库文件导入
+从原数据在线全量导入尽管操作简单、性能较高，但是对服务器资源要求较高，且耗时较长。
+一种更加通用的方式是先使用离线导入在一个空db中导入子图，得到data.mdb文件，然后把该文件在线导入到
+TuGraph服务中。其使用方式如下所示：
+
+```shell
+$ ./lgraph_import --online true --online_type 2 -h
+Available command line options:
+    --online            Whether to import online. Default=0.
+    --v3                Whether to use lgraph import V3. Default=1.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    --online_type       The type of import online, 0 for increment, 1 for full
+                        import data,2 for full import file. Default=0.
+    -h, --help          Print this help message. Default=0.
+
+Available command line options:
+    -r, --url           DB REST API address.
+    -u, --user          DB username.
+    -p, --password      DB password.
+    -g, --graph         The name of the graph to import into. Default=default.
+    --path              The path of data file.
+    --remote            Whether to download file from remote server. Default=0.
+    -h, --help          Print this help message. Default=0.
+```
+
+除普通在线导入用到的url, user和password参数之外，从数据库文件导入的在线全量导入方式
+使用graph参数指定导入的子图名称，path参数指定文件路径，remote指定文件存在在远程或者本地。
+如果是本地文件，则需要保证HA集群中所有的节点在path路径下都有该文件。如果是远程文件，则会先下载再导入。
+需要注意的是，由于data.mdb只有一份，需要保证HA的各个节点和离线导入生成data.mdb的机器的环境完全一致，
+以保证不会出现环境问题。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/2.data-export.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/2.data-export.md
new file mode 100644
index 0000000000..5544169de0
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/2.data-export.md
@@ -0,0 +1,26 @@
+# 数据导出
+
+> 此文档主要介绍 TuGraph 的数据导出功能。
+
+## 1.简介
+
+TuGraph 可以通过 `lgraph_export` 工具来对已经存放在TuGraph的图数据进行数据导出。 `lgraph_export` 工具可以将指定 TuGraph 数据库的数据以 `csv` 或者 `json` 文件形式导出到指定目录，同时导出这些数据进行再导入时需要的配置文件 `import.config` ，详细描述可参见[配置文件](1.data-import.md)。
+
+## 2.导出命令
+
+该工具的命令示例如下：
+
+```bash
+$ lgraph_export -d {database_dir} -e {export_destination_dir} -g {graph_to_use} -u {username} -p {password} -f {output_format}
+```
+
+其中：
+
+- `-d {database_dir}` 指定需要进行数据导出的数据库所在目录，默认值为 `./testdb`。
+- `-e {export_destination_dir}` 指定导出文件存放的目录，默认值为 `./exportdir`。
+- `-g {graph_to_use}` 指定图数据库的种类，默认为 `default` 。
+- `-u {username}` 指定进行该导出操作的用户的用户名。
+- `-p {password}` 指定进行该导出操作的用户的用户密码。
+- `-s {field_separator}` 指定导出文件的分隔符，默认为逗号。
+- `-f {output_format}` 指定导出数据的格式，`json`或者`csv`，默认为`csv`。
+- `-h` 除上述指定参数外，也可以使用该参数查看该工具的使用帮助。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/3.backup-and-restore.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/3.backup-and-restore.md
new file mode 100644
index 0000000000..ce113ad0a4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/3.backup-and-restore.md
@@ -0,0 +1,35 @@
+# 备份恢复
+
+> 此文档主要介绍 TuGraph 的数据备份和恢复功能。
+
+## 1.数据备份
+
+TuGraph 可以通过 `lgraph_backup` 工具来进行数据备份。
+`lgraph_backup` 工具可以将一个 TuGraph 数据库中的数据备份到另一个目录下，它的用法如下：
+
+```bash
+$ lgraph_backup -s {source_dir} -d {destination_dir} -c {true/false}
+```
+
+其中：
+
+- `-s {source_dir}` 指定需要备份的数据库（源数据库）所在目录。
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
+  如果目标数据库不为空，`lgraph_backup` 会提示是否覆盖该数据库。
+- `-c {true/false}` 指明是否在备份过程中进行 compaction。
+  compaction 能使产生的备份文件更紧凑，但备份时间也会变长。该选项默认为 `true`。
+
+## 2.数据恢复
+
+使用`lgraph_backup` 工具得到的目标数据库`{destination_dir}`备份了源数据库
+`{source_dir}`的所有子图，但不包含HA集群的raft信息，从而保证服务和集群能
+以备份数据库成功重启并与源数据库的数据一致。使用如下命令可以用备份数据库重启服务，
+在服务启动时会恢复所有子图的存储过程，保证备份服务和原服务完全一致。
+
+```bash
+$ lgraph_server -c lgraph.json --directory {destination_dir} -d start
+```
+
+其中：
+
+- `-d {destination_dir}` 指定备份文件（目标数据库）所在目录。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/4.data-warmup.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/4.data-warmup.md
new file mode 100644
index 0000000000..c0c5afb7eb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/4.data-warmup.md
@@ -0,0 +1,23 @@
+# 数据预热
+
+> 此文档主要介绍 TuGraph 的数据预热功能。
+
+## 1.简介
+
+TuGraph 是基于磁盘的数据库，仅当访问数据时，数据才会加载到内存中。因此在服务器刚开启后的一段时间内，系统性能可能会由于频繁的 IO 操作而变差。此时我们可以通过事先进行数据预热来改善这一问题。
+
+## 1.数据预热命令
+
+数据预热可以通过工具 `lgraph_warmup` 来进行。它的使用示例如下：
+
+```bash
+$ lgraph_warmup -d {directory} -g {graph_list}
+```
+
+其中：
+
+- `-d {db_dir}` 选项指定了 TuGraph 服务器的数据目录
+
+- `-g {graph_list}` 选项指定需要进行数据预热的图名称，用逗号分隔
+
+根据数据大小和所使用的磁盘类型不同，预热过程运行时间也不同。机械磁盘上预热一个大数据库可能耗时较长，请耐心等待。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/5.ha-cluster-management.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
new file mode 100644
index 0000000000..0a113bfa78
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/5.ha-cluster-management.md
@@ -0,0 +1,48 @@
+# 集群管理
+
+> 此文档主要介绍 TuGraph HA 集群的管理工具，主要包括删除节点、leader转移和生成snapshot功能
+
+## 1. 简介
+
+HA集群启动之后，可以使用`lgraph_peer`工具进行集群管理，可以执行删除节点，转移leader和生成snapshot等功能。
+
+## 2. 删除节点
+
+对于TuGraph HA集群中长期离线或者产生网络分区的节点，可以使用`lgraph_peer`的`remove_peer`命令删除节点。命令示例如下所示：
+```shell
+$ lgraph_peer --command remove_peer --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command remove_peer` 指定要执行的操作为remove_peer，即删除节点。
+- `--peer {peer_id}` 指定要删除节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 3. leader 转移
+
+当需要对主节点执行停机或重启操作时，为减少集群的不可服务时间，可以使用`lgraph_peer`的`transfer_leader`命令转移主节点。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command transfer_leader --peer {peer_id} --conf {group_conf}
+```
+
+其中：
+
+- `--command transfer_leader` 指定要执行的操作为transfer_leader，即转移主节点。
+- `--peer {peer_id}` 指定要成为主节点的rpc网络地址，如 `127.0.0.1:9092`。
+- `--conf {group_conf}` 指定HA集群的成员配置（可连通主节点即可），如 `127.0.0.1:9092,127.0.0.1:9093,127.0.0.1:9094` 。
+
+## 4. 生成snapshot
+
+出于节点启动时设置ha_snapshot_interval_s为-1以默认不打snapshot或其他原因，
+当需要让某个节点手动生成snapshot时，可以使用`lgraph_peer`的`snapshot`命令。命令示例如下所示：
+
+```shell
+$ lgraph_peer --command snapshot --peer {peer_id}
+```
+
+其中：
+
+- `--command snapshot` 指定要执行的操作为snapshot，即生成快照。
+- `--peer {peer_id}` 指定要生成快照的节点的rpc网络地址，如 `127.0.0.1:9092`。
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/6.tugraph-cli.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/6.tugraph-cli.md
new file mode 100644
index 0000000000..72b6187767
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/6.tugraph-cli.md
@@ -0,0 +1,134 @@
+# 命令行工具
+
+> 此文档主要介绍 lgraph_cypher 文档的使用，注意不再更新维护，请使用 [lgraph_cli](../7.client-tools/6.bolt-console-client.md)
+
+TuGraph 发布版本附带名为`lgraph_cypher`的查询客户端，可用于向 TuGraph 服务器提交 OpenCypher 请求。`lgraph_cypher`客户端有两种执行模式：单命令模式和交互式模式。
+
+## 1.单命令模式
+
+在单命令模式下，`lgraph_cypher`可用于提交单个 Cypher 查询并将结果直接打印到终端，打印结果也可以容易地重定向写入指定文件。当用户需要从服务器获取大量结果并将其保存在文件中时，这非常便利。
+在此模式下，`lgraph_cypher`工具具有以下选项：
+
+### 1.1.命令行参数:
+
+| 参数     | 类型   | 说明                                                                     |
+| -------- | ------ | ------------------------------------------------------------------------ | ------ | ----------------------------------------------------------------------------------------------------------------------------------------- |
+| --help   | \\     | 列出所有参数及说明。                                                     |
+| -example | \\     | 列出命令实例。                                                           |
+| -c       | string | 数据库的配置文件，用于获取 ip 与 port 信息。                             |
+| -h       | string | 数据库服务器 ip 地址，如有配置文件则可舍去此参数。默认值为`127.0.0.1` 。 |
+| -p       | string | 数据库服务器端口，如有配置文件则可舍去此参数。默认值为`7071` 。          |
+| -u       | string | 数据库登录用户名。                                                       |
+| -P       | string | 数据库登录密码。                                                         |
+| -f       | string | 包含单条 Cypher 查询单文本文件的路径。                                   |
+| -s       | string | 单行 cypher 查询命令。以`"`开头结尾。                                    |
+| -t       | int    | 进行 cypher 查询时服务器的超时阈值。默认值为`150`秒。 -format            | string | 查询结果显示模式。支持`plain`与`table`两种格式。`plain`格式会将查询结果单列打印。`table`格式会将查询结果以表格方式显示。默认值为`table`。 |
+
+### 1.2.命令示例:
+
+**cypher 命令文件查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -f /home/usr/cypher.json
+```
+
+**cypher 命令单句查询：**
+
+```powershell
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u user -P password -s "MATCH (n) RETURN n"
+```
+
+## 2.交互模式
+
+`lgraph_cypher`也可以在交互模式下运行。在交互式模式下，客户端与服务器保持连接，并在读取-评估-打印-循环中与用户进行交互。
+
+### 2.1.进入 lgraph_cypher 交互模式:
+
+如不加`-f`或`-s`命令行选项，运行`lgraph_cypher`时将会进入交互模式。使用方式如下：
+
+```
+$ ./lgraph_cypher.py -c /home/usr/lgraph_standalone.json -u admin -P 73@TuGraph
+```
+
+如成功进入则会显示相应登录成功信息：
+
+```
+**********************************************************************
+*                  TuGraph Graph Database X.Y.Z                      *
+*                                                                    *
+*        Copyright(C) 2023 Ant Group. All rights reserved.           *
+*                                                                    *
+**********************************************************************
+login success
+----------------------------------
+Host: 127.0.0.1
+Port: 7071
+Username: admin
+----------------------------------
+type ":help" to see all commands.
+>
+```
+
+现在我们也提供一个交互式 shell ，用于用户输入 Cypher 查询语句或使用`:help`命令来检查可用命令。
+
+### 2.2.command种类与说明:
+
+除 Cypher 查询外，`lgraph_cypher` 的 shell 还接受以下命令：
+
+| 命令                     | 对应参数                           | 说明                                                                                                |
+| ------------------------ | ---------------------------------- | --------------------------------------------------------------------------------------------------- |
+| :help                    | \\                                 | 显示服务器信息与所有 command 对应说明。                                                             |
+| :db_info                 | \\                                 | 当前服务器状态查询。对应 REST API 的/db/info。                                                      |
+| :clear                   | \\                                 | 清空屏幕。                                                                                          |
+| :use                     | {图的名称}                         | 使用该名称指定的图，默认值为`default` 。                                                            |
+| :source                  | `-t {查询timeout值} -f {查询文件}` | 可交互模式下的 cypher 命令文件查询。超时阈值默认值为`150`秒。查询文件格式参考无交互式查询参数。     |
+| :exit                    | \\                                 | 退出交互模式并返回原命令行。                                                                        |
+| :format                  | `plain` or `table`                 | 更改 cypher 查询结果的显示模式。支持`plain`与`table`模式。                                          |
+| :save all/command/result | `-f {文件路径}` `{cypher语句}`     | 存储 cypher 命令（command）或查询结果（result）或以上二者（all）。默认存储位置为`/saved_cypher.txt` |
+
+**注意:**
+
+- 每条命令都应该以冒号开始 `:`.
+
+**:save 命令例子:**
+
+```
+:save all -f /home/usr/saved.txt match (n) where return n, n.name limit 1000
+```
+
+### 2.3.cypher 查询命令:
+
+在交互模式下，用户也可直接输入单句 cypher 命令进行查询，以"`;`"结束。输入命令不区分大小写。例子如下：
+
+```
+login success
+>MATCH (n) RETURN n, n.name;
++---+---+-------------+
+|   | n |n.name       |
++---+---+-------------+
+| 0 | 0 |david        |
+| 1 | 1 |Ann          |
+| 2 | 2 |first movie  |
+| 3 | 3 |Andres       |
++---+---+-------------+
+time spent: 0.000520706176758
+size of query: 4
+>
+```
+
+`lgraph_cypher`输入命令时支持多行输入，用户可使用`ENTER`键将长查询语句分多行输入。多行输入情况下命令行开头会从`>`变为`=>`，然后用户可以继续输入查询的其余部分。
+
+例子如下：
+
+```
+login success
+>MATCH (n)
+=>WHERE n.uid='M11'
+=>RETURN n, n.name;
+```
+
+### 2.4.辅助功能:
+
+**历史查询：** 在交互模式下按上下方向键可查询输入历史。
+
+**自动补全：** lgraph_cypher 会根据输入历史进行自动补全。在补全提示出现的情况下，按下右方向键就会自动补全命令。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/7.tugraph-datax.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/7.tugraph-datax.md
new file mode 100644
index 0000000000..5022bb28cd
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/7.tugraph-datax.md
@@ -0,0 +1,433 @@
+# TuGraph-DataX
+
+> 此文档主要介绍 TuGraph DataX 的安装编译和使用示例
+
+## 1.简介
+
+TuGraph 在阿里开源的 DataX 基础上添加了 TuGraph 的写插件以及 TuGraph jsonline 数据格式的支持，其他数据源可以通过 DataX 往 TuGraph 里面写数据。
+TuGraph DataX 介绍 [https://github.com/TuGraph-family/DataX](https://github.com/TuGraph-family/DataX)，支持的功能包括：
+
+- 从 MySQL、SQL Server、Oracle、PostgreSQL、HDFS、Hive、HBase、OTS、ODPS、Kafka 等各种异构数据源导入 TuGraph
+- 将 TuGraph 导入相应的目标源 （待开发）
+
+![导入导出](../../../images/tugraph-datax.png)
+
+DataX 原始项目介绍参考 [https://github.com/alibaba/DataX](https://github.com/alibaba/DataX)
+
+## 2.编译安装
+
+```bash
+git clone https://github.com/TuGraph-family/DataX.git
+yum install maven
+mvn -U clean package assembly:assembly -Dmaven.test.skip=true
+```
+
+编译出来的 DataX 文件在 target 目录下
+
+## 3. 导入TuGraph
+
+### 3.1.文本数据通过DataX导入TuGraph
+
+我们以 TuGraph 手册中导入工具 lgraph_import 章节举的数据为例子，有三个 csv 数据文件，如下：
+`actors.csv`
+
+```
+nm015950,Stephen Chow
+nm0628806,Man-Tat Ng
+nm0156444,Cecilia Cheung
+nm2514879,Yuqi Zhang
+```
+
+`movies.csv`
+
+```
+tt0188766,King of Comedy,1999,7.3
+tt0286112,Shaolin Soccer,2001,7.3
+tt4701660,The Mermaid,2016,6.3
+```
+
+`roles.csv`
+
+```
+nm015950,Tianchou Yin,tt0188766
+nm015950,Steel Leg,tt0286112
+nm0628806,,tt0188766
+nm0628806,coach,tt0286112
+nm0156444,PiaoPiao Liu,tt0188766
+nm2514879,Ruolan Li,tt4701660
+```
+
+然后建三个 DataX 的 job 配置文件：
+`job_actors.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["actors.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "url": "bolt://127.0.0.1:27687",
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "labelType": "VERTEX",
+            "labelName": "actor",
+            "batchNum": 1000,
+            "properties": ["aid", "name"]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_movies.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["movies.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              },
+              {
+                "index": 3,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "url": "bolt://127.0.0.1:27687",
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "labelType": "VERTEX",
+            "labelName": "movie",
+            "batchNum": 1000,
+            "properties": ["mid", "name", "year", "rate"]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`job_roles.json`
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "txtfilereader",
+          "parameter": {
+            "path": ["roles.csv"],
+            "encoding": "UTF-8",
+            "column": [
+              {
+                "index": 0,
+                "type": "string"
+              },
+              {
+                "index": 1,
+                "type": "string"
+              },
+              {
+                "index": 2,
+                "type": "string"
+              }
+            ],
+            "fieldDelimiter": ","
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "url": "bolt://127.0.0.1:27687",
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "labelType": "EDGE",
+            "labelName": "play_in",
+            "batchNum": 1000,
+            "properties": ["SRC_ID", "role", "DST_ID"],
+            "startLabel": {"type": "actor", "key": "SRC_ID"},
+            "endLabel": {"type": "movie", "key": "DST_ID"}
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后依次执行如下三个命令：
+
+```
+python3 datax/bin/datax.py  job_actors.json
+```
+
+```
+python3 datax/bin/datax.py  job_movies.json
+```
+
+```
+python3 datax/bin/datax.py  job_roles.json
+```
+
+### 3.2.MySQL数据通过DataX导入TuGraph
+
+我们在 `test` database 下建立如下电影 `movies` 表
+
+```sql
+CREATE TABLE `movies` (
+  `mid`  varchar(200) NOT NULL,
+  `name` varchar(100) NOT NULL,
+  `year` int(11) NOT NULL,
+  `rate` float(5,2) unsigned NOT NULL,
+  PRIMARY KEY (`mid`)
+);
+```
+
+往表中插入几条数据
+
+```sql
+insert into
+test.movies (mid, name, year, rate)
+values
+('tt0188766', 'King of Comedy', 1999, 7.3),
+('tt0286112', 'Shaolin Soccer', 2001, 7.3),
+('tt4701660', 'The Mermaid',   2016,  6.3);
+```
+
+建立一个 DataX 的 job 配置文件
+
+`job_mysql_to_tugraph.json`
+
+**配置字段方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "column": ["mid", "name", "year", "rate"],
+            "splitPk": "mid",
+            "connection": [
+              {
+                "table": ["movies"],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "url": "bolt://127.0.0.1:27687",
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "labelType": "VERTEX",
+            "labelName": "movie",
+            "batchNum": 1000,
+            "properties": ["mid", "name", "year", "rate"]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+**写简单 sql 方式**
+
+```json
+{
+  "job": {
+    "setting": {
+      "speed": {
+        "channel": 1
+      }
+    },
+    "content": [
+      {
+        "reader": {
+          "name": "mysqlreader",
+          "parameter": {
+            "username": "root",
+            "password": "root",
+            "connection": [
+              {
+                "querySql": [
+                  "select mid, name, year, rate from test.movies where year > 2000;"
+                ],
+                "jdbcUrl": ["jdbc:mysql://127.0.0.1:3306/test?useSSL=false"]
+              }
+            ]
+          }
+        },
+        "writer": {
+          "name": "tugraphwriter",
+          "parameter": {
+            "url": "bolt://127.0.0.1:27687",
+            "username": "admin",
+            "password": "73@TuGraph",
+            "graphName": "default",
+            "labelType": "VERTEX",
+            "labelName": "movie",
+            "batchNum": 1000,
+            "properties": ["mid", "name", "year", "rate"]
+          }
+        }
+      }
+    ]
+  }
+}
+```
+
+`./lgraph_server -c lgraph_standalone.json -d 'run'` 启动 TuGraph 后执行如下命令：
+
+```shell
+python3 datax/bin/datax.py  job_mysql_to_tugraph.json
+```
+
+## 4.导出TuGraph
+
+### 4.1.配置样例
+
+TuGraph支持使用DataX导出数据，使用如下配置即可将数据导出到文本数据中
+
+```json
+{
+    "job": {
+        "setting": {
+            "speed": {
+                 "channel":1
+            }
+        },
+        "content": [
+            {
+                "reader": {
+                    "name": "tugraphreader",
+                    "parameter": {
+                        "username": "admin",
+                        "password": "73@TuGraph",
+                        "graphName": "Movie_8C5C",
+                        "queryCypher": "match (n:person) return n.id,n.name,n.born;",
+                        "url": "bolt://127.0.0.1:27687"
+                    }
+                },
+                "writer": {
+                    "name": "txtfilewriter",
+                    "parameter": {
+                        "path": "./result",
+                        "fileName": "luohw",
+                        "writeMode": "truncate"
+                    }
+                }
+            }
+        ]
+    }
+}
+```
+
+使用这个配置文件，可以把TuGraph Movie_8C5C子图中person节点的id,name和born属性全部导出出来，
+导出到当前目录下的result目录中，文件名称为luohw+随机后缀。
+
+### 4.2.参数说明
+
+在使用DataX导出TuGraph数据时，需要将reader设置为tugraphreader并配置以下5个参数：
+
+* **url**
+    * 描述：TuGraph的bolt server地址 <br />
+    * 必选：是 <br />
+    * 默认值：无 <br />
+
+* **username**
+    * 描述：TuGraph的用户名 <br />
+    * 必选：是 <br />
+    * 默认值：无 <br />
+
+* **password**
+    * 描述：TuGraph的密码 <br />
+    * 必选：是 <br />
+    * 默认值：无 <br />
+
+* **graphName**
+    * 描述：所选取的需要同步的TuGraph子图 <br />
+    * 必选：是 <br />
+    * 默认值：无 <br />
+
+* **queryCypher**
+    * 描述：通过cypher语句读取TuGraph中的数据 <br />
+    * 必选：否 <br />
+    * 默认值：无 <br />
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/8.tugraph-explorer.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
new file mode 100644
index 0000000000..ea866abf5d
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/8.tugraph-explorer.md
@@ -0,0 +1,3 @@
+# TuGraph-Explorer
+
+> TuGraph Explorer 已经合并到 [TuGraph Browser](../4.user-guide/1.tugraph-browser.md)
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/9.restful.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/9.restful.md
new file mode 100644
index 0000000000..1a62bd27a2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/9.restful.md
@@ -0,0 +1,198 @@
+# TuGraph-Restful-Server
+
+> TuGraph Restful Server 强依赖 TuGraph，Restful Server 与 Tugraph 共存
+
+## 1.TuGraph-Restful-Server 简介
+TuGraph Restful Server 使用brpc框架支持的http协议，提供restful接口查询功能，在实现中，restful server 与rpc server 使用同一个端口。目前restful接口提供文件上传，数据导入，导入进度查询，cypher查询，文件删除等功能
+
+## 2.启动 TuGraph-Restful-Server
+需要在启动Tugraph时设置enable_rpc参数为true的方式，正常启动TuGraph
+
+## 3.连接 TuGraph-Restful-Server
+TuGraph正常启动后，Restful Server 将监听在rpc_port上， 通过访问 http://${ip}:${rpc_port}/LGraphHttpService/Query/ url可以链接到TuGraph
+
+## 4.数据格式
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+## 5.返回值
+
+通用返回格式
+
+|  body参数  | 参数说明  |  参数类型  |  是否必填  |
+|:--------:|:-----:|:------:| :-----: |
+| errorCode |  状态码  |  字符串  |  是  |
+| errorMessage | 错误信息  |  字符串  |  是  |
+| data | 返回的数据 |  字符串  |  是  |
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 401 Unauthorized: 未通过鉴权认证，例如用户名密码错误，token超过有效期等
+- 500 Internal Server Error: 服务器端错误
+  当操作成功时，返回的 data 中包含操作的返回值。
+  当发生输入错误或者服务器错误时，返回的 errorMessage 中包含错误提示。
+
+## 6.URI格式
+
+| URI               | 说明                 |
+|-------------------|--------------------|
+| /cypher           | 执行cypher查询请求       |
+| /refresh          | 刷新token请求          |
+| /login            | 用户登陆请求             |
+| /logout           | 用户登出请求             |
+| /upload_files     | 上传文件请求             |
+| /clear_cache      | 清理用户上传文件请求         |
+| /check_file       | 文件认证请求             |
+| /import_data      | 数据导入请求             |
+| /import_progress  | 导入进度查询请求           |
+| /import_schema    | 批量创建schema请求       |
+
+## 7.接口
+### 7.1 用户登陆
+用于用户第一次与服务端通信时的鉴权操作，请求报文在 http body 中携带用户名和密码，响应报文在 http body 中会返回一个带有有效期的token，后续请求中需要在http header中携带该token作为凭证
+#### 7.1.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/login
+#### 7.1.2 REQUEST
+|  body参数  |  参数说明  |  参数类型  |  是否必填  |
+|:--------:|:------:|:------:| :-----: |
+ | userName |  用户名  |  字符串  |  是  |
+ | password |   密码   |  字符串  |  是  |
+#### 7.1.3 RESPONSE
+|    body参数     | 参数说明  |  参数类型  |  是否必填  |
+|:-------------:|:-----:|:------:| :-----: |
+| authorization | token |  字符串  |  是  |
+
+### 7.2 刷新token
+token到期后将无法使用此token与服务端正常通信，需要获取新的token作为后续请求的凭证，请求报文在http header中携带旧的token，响应报文在http body中返回新的token
+#### 7.2.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/refresh
+#### 7.2.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+#### 7.2.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| authorization | 新的token |  字符串  |  是  |
+
+### 7.3 用户登出
+用户不再需要与服务端进行通信时，需要请求登出接口，释放自己的token。请求报文在http header中携带旧的token，如果拿到返回errorCode为200的响应报文即为正常登出
+#### 7.3.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/logout
+#### 7.3.2 REQUEST
+|   header参数    |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| Authorization | 旧的token |  字符串  |  是  |
+
+### 7.4 执行cypher查询请求
+用户通过此类请求发cypher给server端执行并获取执行结果，请求报文在http body 中将执行的cypher语句和目标子图发送给server，server执行完成后在响应报文的http body中返回执行结果
+#### 7.4.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/cypher
+
+#### 7.4.2 REQUEST
+| body参数 |    参数说明    |  参数类型  |  是否必填  |
+|:------:|:----------:|:------:| :-----: |
+| graph  |   查询目标子图   |  字符串  |  是  |
+| script | cypher查询语句 |  字符串  |  是  |
+
+#### 7.4.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| result | 返回结果 |  字符串  |  是  |
+
+### 7.5 上传文件请求
+用户通过此类请求向server发送文件，可以对文件进行分片，分片大小不大于1MB，支持多线程乱序发送，请求报文在http header 中包含文件名，第一字节内容在文件中的偏移和分片大小，在body中包含文件内容，server收到请求后将验证分片大小是否与分片内容一致，一致时将文件分段写入文件。不一致时将返回errorCode为400的响应
+#### 7.5.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/upload_files
+
+#### 7.5.2 REQUEST
+| header参数  |    参数说明    |  参数类型  |  是否必填  |
+|:---------:|:----------:|:------:| :-----: |
+| File-Name |   文件名   |  字符串  |  是  |
+| Begin-Pos | 开始位置在文件内的偏移 |  字符串  |  是  |
+|   Size    | 文件分片大小 |  字符串  |  是  |
+|  body参数   |  参数说明   |  参数类型  |  是否必填  |
+|     -     | 文件内容 |  字符串  |  是  |
+
+### 7.6 文件认证请求
+用户通过此类请求验证发送到server端的文件是否与期望一致，server端使用两种验证方式，md5值和文件长度，目前已支持文件长度验证。
+#### 7.6.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/check_file
+#### 7.6.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| fileName |           文件名           |  字符串  |  是  |
+| checkSum |        文件对应md5值         |  字符串  |  否  |
+| fileSize |       文件长度(以字节计算)       |  字符串  |  否  |
+| flag | 标记位，为1时校验md5值，为2时校验文件长度 |  字符串  |  是  |
+
+#### 7.6.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| pass | 检查成功为true，否则为false |  bool  |  是  |
+
+### 7.7 批量创建schema请求
+用户通过此类请求批量创建schema，请求报文在http body 中将创建schema的目标子图和schema信息发送给server，如果拿到返回errorCode为200的响应报文即为正常创建
+#### 7.7.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_schema
+#### 7.7.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| graph |   创建目标子图   |  字符串  |  是  |
+| schema | schema描述信息 |  字符串  |  是  |
+
+### 7.8 数据导入请求
+用户通过此类请求导入已经上传的数据文件。导入不论成功或失败，都将删除已上传文件。数据导入请求在server中实现为一个异步任务，响应返回并不意味着导入已完成，返回的是任务id，后续可以通过此任务id查询导入进度
+#### 7.8.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_data
+#### 7.8.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  | 是否必填 |
+|:--------:|:-----------------------:|:------:|:----:|
+| graph |         导入目标子图          |  字符串  |  是   |
+| schema |       导入schema描述        | json字符串  |  是   |
+| delimiter |           分隔符           |  字符串  |  是   |
+| continueOnError |     单行数据出错是否跳过错误并继续     |  boolean  |  否   |
+| skipPackages |         跳过的包个数          |  字符串  |  否   |
+| taskId |  任务id   |  字符串  |  否   |
+| other | 其他参数 |  json字符串  |  否   |
+
+#### 7.8.3 RESPONSE
+|    body参数     |  参数说明   |  参数类型  |  是否必填  |
+|:-------------:|:-------:|:------:| :-----: |
+| taskId | 任务编号 |  字符串  |  是  |
+
+### 7.9 清理用户上传文件请求
+用户通过此类请求清理已经上传的文件，如果拿到返回errorCode为200的响应报文即为正常清理
+#### 7.9.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/clear_cache
+#### 7.9.2 REQUEST
+|  body参数  |    参数说明    |  参数类型  |  是否必填  |
+|:--------:|:----------:|:------:| :-----: |
+| fileName |    文件名称    |  字符串  |  否  |
+| userName |    用户名称    |  字符串  |  否  |
+| flag | 标记位， flag = 0时删除fileName指定文件, flag = 1时删除userName指定用户已经上传的所有文件， flag = 2时删除所有用户上传的文件 |  字符串  |  是  |
+
+### 7.10. 导入进度查询请求
+用户通过此类请求获得导入任务的状态
+#### 7.10.1 URL
+http://${ip}:${rpc_port}/LGraphHttpService/Query/import_progress
+#### 7.10.2 REQUEST
+|  body参数  |          参数说明           |  参数类型  |  是否必填  |
+|:--------:|:-----------------------:|:------:| :-----: |
+| taskId |           任务编号           |  字符串  |  是  |
+
+#### 7.10.3 RESPONSE
+| body参数 |                  参数说明                   |  参数类型  |  是否必填  |
+|:------:|:---------------------------------------:|:------:| :-----: |
+| state  | 状态标记，为0表示准备导入，为1表示导入中，为2表示导入成功，为3表示导入失败 |  字符串  |  是  |
+|  progress  |             导入进度，state为1时包含             |  字符串  |  否  |
+|  reason  |             失败原因，state为3时包含             |  字符串  |  否  |
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/index.rst
new file mode 100644
index 0000000000..00a7df7efb
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/6.utility-tools/index.rst
@@ -0,0 +1,9 @@
+实用工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/1.python-client.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/1.python-client.md
new file mode 100644
index 0000000000..cacf2d18bc
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/1.python-client.md
@@ -0,0 +1,237 @@
+# Python客户端
+
+> 此文档主要是TuGraph Python SDK的使用说明, 注意将来不再更新维护，建议使用 [bolt客户端](./5.bolt-client.md)
+
+## 1. 概述
+Python的TuGraph Client有两种，一种是RESTful的Client，使用HTTP方法向server发送请求，另一种是RPC的Client，使用RPC方法调用server远程服务，两者各有优劣。
+RESTful client的使用方式简单，在项目的src/client/python/TuGraphClient目录下可以找到Client的源码文件，直接安装到用户环境中即可使用，但是支持的功能较少，
+性能也不高。RPC Client既支持单机的server，也支持高可用集群和负载均衡，接口较多，功能强大。但是使用方式较为复杂，需要用户自己编译TuGraph项目得到liblgraph_client_python.so，
+或者使用runtime镜像时直接在/usr/local/lib64目录下找到该依赖库，将其引入python项目即可正常使用。接下来将详细介绍这两种Client的使用方式。
+
+## 2. RESTful Client
+
+### 2.1.安装Client
+
+TuGraph的Python RESTful client使用setuptools工具进行打包和分发，用户可以将client直接安装到本地环境中，在使用时即可直接引入。
+```shell
+cd src/client/python/TuGraphClient
+python3 setup.py build
+python3 setup.py install
+```
+注：使用setuptools工具安装python client时会安装httpx等依赖，需要在通外网的环境下执行。
+
+### 2.2.调用Cypher
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = client.call_cypher(cypher)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+cypher = "match (n) return properties(n) limit 1"
+res = await aclient.call_cypher(cypher)
+print(res)
+```
+
+### 2.3.调用存储过程
+
+```python
+from TuGraphClient import TuGraphClient, AsyncTuGraphClient
+
+client = TuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+plugin_type = "cpp"
+plugin_name = "khop"
+plugin_input = "{\"root\": 10, \"hop\": 3}"
+res = client.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+
+aclient = AsyncTuGraphClient("127.0.0.1:7071" , "admin", "73@TuGraph")
+res = await aclient.call_plugin(plugin_type, plguin_name, plugin_input)
+print(res)
+```
+
+## 3.RPC Client
+
+Python的TuGraph Rpc Client是使用pybind11包装的CPP Client SDK，下表列出了Python和CPP Client SDK的对应关系。
+
+| Python Client SDK                                                                                                                                                                                                     | CPP Client SDK                                                                                                                                                                                                                                                                              |
+|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| client(self: liblgraph_client_python.client, url: str, user: str, password: str)                                                                                                                                      | RpcClient(const std::string& url, const std::string& user, const std::string& password)                                                                                                                                                                                                     |
+| client(self: liblgraph_client_python.client, urls: list, user: str, password: str)                                                                                                                                    | RpcClient(std::vector<std::string>& urls, std::string user, std::string password)                                                                                                                                                                                                           |
+| callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                 | bool CallCypher(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                         |
+| callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                   | bool CallCypherToLeader(std::string& result, const std::string& cypher, const std::string& graph, bool json_format, double timeout)                                                                                                                                                         |
+| callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)                                                                                       | bool CallGql(std::string& result, const std::string& gql, const std::string& graph, bool json_format, double timeout, const std::string& url)                                                                                                                                               |
+| callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                                         | bool CallGqlToLeader(std::string& result, const std::string& gql, const std::string& graph = "default", bool json_format = true, double timeout = 0)                                                                                                                                        |
+| callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)        | bool CallProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format, const std::string& url)                                     |
+| callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)          | CallProcedureToLeader(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& param, double procedure_time_out, bool in_process, const std::string& graph, bool json_format)                                                          |
+| loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str) | bool LoadProcedure(std::string& result, const std::string& source_file, const std::string& procedure_type, const std::string& procedure_name, const std::string& code_type, const std::string& procedure_description, bool read_only, const std::string& version, const std::string& graph) |
+| listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)                                                                                          | bool ListProcedures(std::string& result, const std::string& procedure_type, const std::string& version, const std::string& graph, const std::string& url)                                                                                                                                   |
+| deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)                                                                                            | bool DeleteProcedure(std::string& result, const std::string& procedure_type, const std::string& procedure_name, const std::string& graph)                                                                                                                                                   |
+| importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                              | bool ImportSchemaFromContent(std::string& result, const std::string& schema, const std::string& graph, bool json_format, double timeout)                                                                                                                                                    |
+| importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)            | ImportDataFromContent(std::string& result, const std::string& desc, const std::string& data, const std::string& delimiter, bool continue_on_error, int thread_nums, const std::string& graph, bool json_format, double timeout)                                                             |
+| importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)                                                                            | ImportSchemaFromFile(std::string& result, const std::string& schema_file, const std::string& graph, bool json_format, double timeout)                                                                                                                                                       |
+| importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str) | ImportDataFromFile(std::string& result, const std::string& conf_file, const std::string& delimiter, bool continue_on_error, int thread_nums, int skip_packages, const std::string& graph, bool json_format, double timeout)                                                                 |
+
+Python RPC Client的使用方式较为复杂，用户可以在本地环境中编译TuGraph得到liblgraph_client_python.so，也可以使用官方提供的runtime镜像，
+在镜像中的/usr/local/lib64目录下可以直接找到该依赖库，引入用户项目即可使用。
+
+```python
+import liblgraph_client_python
+```
+
+### 3.1.实例化client对象
+
+#### 3.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+
+#### 3.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```python
+client = liblgraph_client_python.client("127.0.0.1:19099", "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, url: str, user: str, password: str)
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 3.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```python
+client = liblgraph_client_python.client(["189.33.97.23:9091","189.33.97.24:9091", "189.33.97.25:9091"], "admin", "73@TuGraph")
+```
+```
+client(self: liblgraph_client_python.client, urls: list, user: str, password: str)
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 3.2.调用cypher
+```python
+ret, res = client.callCypher("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypher(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.3.向leader发送cypher请求
+```python
+ret, res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callCypherToLeader(self: liblgraph_client_python.client, cypher: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.4.调用GQL
+```python
+ret, res = client.callGql("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGql(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.5.向leader发送GQL请求
+```python
+ret, res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10)
+```
+```
+callGqlToLeader(self: liblgraph_client_python.client, gql: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 3.6.调用存储过程
+```python
+ret, res = client.callProcedure("CPP", "test_plugin1", "bcefg", 1000, False, "default")
+```
+```
+callProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.7.向leader调用存储过程
+```python
+ret, res = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default")
+```
+```
+callProcedureToLeader(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, param: str, procedure_time_out: float, in_process: bool, graph: str, json_format: bool) -> (bool, str)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 3.8.加载存储过程
+```python
+ret, res = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+```
+```
+loadProcedure(self: liblgraph_client_python.client, source_file: str, procedure_type: str, procedure_name: str, code_type: str, procedure_description: str, read_only: bool, version: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 3.9.列举存储过程
+```python
+ret, res = client.listProcedures("CPP", "any", "default")
+```
+```
+listProcedures(self: liblgraph_client_python.client, procedure_type: str, version: str, graph: str, url: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 3.10.删除存储过程
+```python
+ret, res = client.deleteProcedure("CPP", "sortstr", "default")
+```
+```
+deleteProcedure(self: liblgraph_client_python.client, procedure_type: str, procedure_name: str, graph: str) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 3.11.从字节流中导入schema
+```python
+ret, res = client.importSchemaFromContent(schema, "default", 1000)
+```
+```
+importSchemaFromContent(self: liblgraph_client_python.client, schema: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.12.从字节流中导入点边数据
+```python
+ret, res = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000)
+```
+```
+importDataFromContent(self: liblgraph_client_python.client, desc: str, data: str, delimiter: str, continue_on_error: bool, thread_nums: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 3.13.从文件中导入schema
+```python
+ret, res = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000)
+```
+```
+importSchemaFromFile(self: liblgraph_client_python.client, schema_file: str, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 3.14.从文件中导入点边数据
+```python
+ret, res = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000)
+```
+```
+importDataFromFile(self: liblgraph_client_python.client, conf_file: str, delimiter: str, continue_on_error: bool, thread_nums: int, skip_packages: int, graph: str, json_format: bool, timeout: float) -> (bool, str)
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/2.cpp-client.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/2.cpp-client.md
new file mode 100644
index 0000000000..ce29ac4bf4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/2.cpp-client.md
@@ -0,0 +1,340 @@
+# C++客户端
+
+> 此文档主要是TuGraph C++ SDK的使用说明。
+
+## 1.概述
+C++ Client 能够使用 RPC 连接lgraph_server，进行数据导入、执行存储过程、调用Cypher等操作。
+
+## 2.使用示例
+
+### 2.1.实例化client对象
+引入依赖并实例化
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直接连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化
+``` C++
+RpcClient client("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+RpcClient(const std::string& url, const std::string& user, const std::string& password);
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化。
+```java
+std::vector<std::string> urls = {"189.33.97.23:9091", "189.33.97.24:9091", "189.33.97.25:9091"};
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+RpcClient(std::vector<std::string>& urls, std::string user, std::string password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```C++
+    std::string str;
+    bool ret = client.CallCypher(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+
+```
+```
+    bool CallCypher(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling cypher.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.3.向leader发送cypher请求
+```C++
+    std::string str;
+    bool ret = client.CallCypherToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallCypherToLeader(std::string& result, const std::string& cypher,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  cypher      inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```C++
+    std::string str;
+    bool ret = client.CallGql(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGql(std::string& result, const std::string& gql,
+                    const std::string& graph = "default", bool json_format = true,
+                    double timeout = 0, const std::string& url = "");
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @param [in]  url         (Optional) Node address of calling gql.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.5.向leader发送GQL请求
+```C++
+    std::string str;
+    bool ret = client.CallGqlToLeader(str,
+        "CALL db.createVertexLabel('actor', 'name', 'name', string, false, 'age', int8, true)");
+```
+```
+    bool CallGqlToLeader(std::string& result, const std::string& gql,
+                 const std::string& graph = "default", bool json_format = true,
+                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  gql         inquire statement.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedure(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedure(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true,
+                       const std::string& url = "");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  url                 (Optional) Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```C++
+    std::string str;
+    bool ret = client.CallProcedureToLeader(str, "CPP", "test_plugin1", "bcefg");
+```
+```
+    bool CallProcedureToLeader(std::string& result, const std::string& procedure_type,
+                       const std::string& procedure_name, const std::string& param,
+                       double procedure_time_out = 0.0, bool in_process = false,
+                       const std::string& graph = "default", bool json_format = true);
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  param               the execution parameters.
+    @param [in]  procedure_time_out  (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @param [in]  in_process          (Optional) support in future.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在HA模式下使用，默认以json格式直接返回存储过程的执行结果，指定jsonFormat为false可以返回字符串格式的执行结果。
+
+### 2.8.加载存储过程
+```C++
+    std::string str;
+    bool ret = client.LoadProcedure(str, code_sleep, "PY", "python_plugin1", "PY", "this is a test plugin", true)
+```
+```
+    bool LoadProcedure(std::string& result, const std::string& source_file,
+                       const std::string& procedure_type, const std::string& procedure_name,
+                       const std::string& code_type, const std::string& procedure_description,
+                       bool read_only, const std::string& version = "v1",
+                       const std::string& graph = "default");
+    @param [out] result                  The result.
+    @param [in]  source_file             the source_file contain procedure code.
+    @param [in]  procedure_type          the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name          procedure name.
+    @param [in]  code_type               code type, currently supported PY, SO, CPP, ZIP.
+    @param [in]  procedure_description   procedure description.
+    @param [in]  read_only               procedure is read only or not.
+    @param [in]  version                 (Optional) the version of procedure.
+    @param [in]  graph                   (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```C++
+    std::string str;
+    bool ret = client.ListProcedures(str);
+```
+```
+    bool ListProcedures(std::string& result, const std::string& procedure_type,
+                        const std::string& version = "any",
+                        const std::string& graph = "default", const std::string& url = "");
+    @param [out] result          The result.
+    @param [in]  procedure_type  (Optional) the procedure type, "" for all procedures,
+                                 CPP and PY for special type.
+    @param [in]  version         (Optional) the version of procedure.
+    @param [in]  graph           (Optional) the graph to query.
+    @param [in]  url             Node address of calling procedure.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送请求。
+
+### 2.10.删除存储过程
+```C++
+    std::string str;
+    bool ret = client.DeleteProcedure(str, "CPP", "test_plugin1");
+```
+```
+    bool DeleteProcedure(std::string& result, const std::string& procedure_type,
+                         const std::string& procedure_name, const std::string& graph = "default");
+    @param [out] result              The result.
+    @param [in]  procedure_type      the procedure type, currently supported CPP and PY.
+    @param [in]  procedure_name      procedure name.
+    @param [in]  graph               (Optional) the graph to query.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```C++
+    std::string str;
+    bool ret = client.ImportSchemaFromContent(str, sImportContent["schema"]);
+```
+```
+    bool ImportSchemaFromContent(std::string& result, const std::string& schema,
+                                 const std::string& graph = "default", bool json_format = true,
+                                 double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema      the schema to be imported.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```C++
+    std::string str;
+    ret = client.ImportDataFromContent(str, sImportContent["person_desc"], sImportContent["person"],",");
+```
+```
+    bool ImportDataFromContent(std::string& result, const std::string& desc,
+                               const std::string& data, const std::string& delimiter,
+                               bool continue_on_error = false, int thread_nums = 8,
+                               const std::string& graph = "default", bool json_format = true,
+                               double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  desc                data format description.
+    @param [in]  data                the data to be imported.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportSchemaFromFile(str, conf_file);
+```
+```
+    bool ImportSchemaFromFile(std::string& result, const std::string& schema_file,
+                              const std::string& graph = "default", bool json_format = true,
+                              double timeout = 0);
+    @param [out] result      The result.
+    @param [in]  schema_file the schema_file contain schema.
+    @param [in]  graph       (Optional) the graph to query.
+    @param [in]  json_format (Optional) Returns the format， true is json，Otherwise, binary
+                             format.
+    @param [in]  timeout     (Optional) Maximum execution time, overruns will be interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```C++
+    std::string conf_file("./yago.conf");
+    std::string str;
+    ret = client.ImportDataFromFile(str, conf_file, ",");
+```
+```
+    bool ImportDataFromFile(std::string& result, const std::string& conf_file,
+                            const std::string& delimiter, bool continue_on_error = false,
+                            int thread_nums = 8, int skip_packages = 0,
+                            const std::string& graph = "default", bool json_format = true,
+                            double timeout = 0);
+    @param [out] result              The result.
+    @param [in]  conf_file           data file contain format description and data.
+    @param [in]  delimiter           data separator.
+    @param [in]  continue_on_error   (Optional) whether to continue when importing data fails.
+    @param [in]  thread_nums         (Optional) maximum number of threads.
+    @param [in]  skip_packages       (Optional) skip packages number.
+    @param [in]  graph               (Optional) the graph to query.
+    @param [in]  json_format         (Optional) Returns the format， true is json，Otherwise,
+                                     binary format.
+    @param [in]  timeout             (Optional) Maximum execution time, overruns will be
+                                     interrupted.
+    @returns True if it succeeds, false if it fails.
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/3.java-client.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/3.java-client.md
new file mode 100644
index 0000000000..7abfeb9639
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/3.java-client.md
@@ -0,0 +1,290 @@
+# Java客户端
+
+> 此文档主要是TuGraph Java SDK的使用说明，需要注意的是TuGraph Java SDK将来不再更新维护，建议使用 [bolt客户端](./5.bolt-client.md)
+
+## 1.编译java client代码
+```shell
+cd deps/tugraph-db-client-java
+sh local_build.sh
+```
+## 2.使用示例
+
+### 2.1.实例化client对象
+
+添加maven依赖
+
+```xml
+<dependency>
+    <groupId>com.antgroup.tugraph</groupId>
+    <artifactId>tugraph-db-java-rpc-client</artifactId>
+    <version>1.4.1</version>
+</dependency>
+```
+
+引入依赖
+```java
+import com.antgroup.tugraph.TuGraphDbRpcClient;
+```
+
+#### 2.1.1.实例化单节点client对象
+当以单节点模式启动server时，client按照如下格式进行实例化
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name
+@param password: login password
+```
+
+#### 2.1.2.实例化HA集群直连连接client对象
+当服务器上部署的HA集群可以使用ha_conf中配置的网址直接连接时，client按照如下格式进行实例化。
+```java
+TuGraphDbRpcClient client = new TuGraphDbRpcClient("127.0.0.1:19099", "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(String url, String user, String pass)
+@param url: tugraph host looks like ip:port
+@param user: login user name 
+@param password: login password
+```
+用户只需要传入HA集群中的任意一个节点的url即可，client会根据server端返回的查询信息自动维护连接池，在HA集群横向扩容时
+也不需要手动重启client。
+
+#### 2.1.3.实例化HA集群间接连接client对象
+当服务器上部署的HA集群不能使用ha_conf中配置的网址直接连接而必须使用间接网址（如阿里云公网网址）连接时，
+client按照如下格式进行实例化
+```java
+List<String> urls = new ArrayList<>();
+urls.add("189.33.97.23:9091");
+urls.add("189.33.97.24:9091");
+urls.add("189.33.97.25:9091");
+TuGraphDbRpcClient client = new TuGraphDbRpcClient(urls, "admin", "73@TuGraph");
+```
+```
+public TuGraphDbRpcClient(List<String> urls, String user, String password)
+@param urls: tugraph host list
+@param user: login user name
+@param password: login password
+```
+因为用户连接的网址和server启动时配置的信息不同，不能通过向集群发请求的方式自动更新client连接池，所以需要在启动
+client时手动传入所有集群中节点的网址，并在集群节点变更时手动重启client。
+
+### 2.2.调用cypher
+```java
+    String res = client.callCypher("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling cypher
+    @return: the result of cypher query execution
+    public String callCypher(String cypher, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.3.向leader发送cypher请求
+```java
+    String res = client.callCypherToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param cypher: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callCypherToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.4.调用GQL
+```java
+    String res = client.callGql("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @param url: (Optional) Node address of calling GQL
+    @return: the result of GQL query execution
+    public String callGql(String gql, String graph, double timeout, String url)
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+注：JAVA不支持默认参数，因此，JAVA中的默认参数是使用重载函数实现的。
+
+### 2.5.向leader发送GQL请求
+```java
+    String res = client.callGqlToLeader("CALL db.edgeLabels()", "default", 10);
+    log.info("db.edgeLabels() : " + res);
+```
+```
+    @param gql: inquire statement.
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of cypher query execution
+    public String callGqlToLeader(String cypher, String graph, double timeout)
+```
+本接口只支持在HA模式下使用，在HA模式下的client中，为防止向未同步数据的follower发送请求，
+用户可以直接向leader发送请求，leader由集群选出。
+
+### 2.6.调用存储过程
+```java
+    String result = client.callProcedure("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @param url: (Optional) Node address of calling procedure
+    @return: the result of procedure execution
+    public String callProcedure(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph, String url)
+```
+本接口支持在单机模式和HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.7.向leader调用存储过程
+```java
+    String result = client.callProcedureToLeader("CPP", "khop", kHopParamGen(), 1000, false, "default");
+    log.info("testCallProcedureToLeader : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param param: the execution parameters
+    @param procedureTimeOut: Maximum execution time, overruns will be interrupted
+    @param inProcess: Running query or not
+    @param graph: the graph to query
+    @param jsonFormat: (Optional) Return format of calling stored procedure
+    @return: the result of procedure execution
+    public String callProcedureToLeader(String procedureType, String procedureName, String param, double procedureTimeOut,
+            boolean inProcess, String graph)
+```
+本接口支持在HA模式下使用，默认以字符串格式直接返回存储过程的执行结果，指定jsonFormat为true可以返回json格式的执行结果。
+
+### 2.8.加载存储过程
+```java
+    boolean result = client.loadProcedure("./test/procedure/khop.so", "CPP", "khop", "SO", "test loadprocedure", true, "v1", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param sourceFile: the source_file contain procedure code
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param codeType: code type, currently supported PY, SO, CPP, ZIP
+    @param procedureDescription: procedure description
+    @param readOnly: procedure is read only or not
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean loadProcedure(String sourceFile, String procedureType, String procedureName, String codeType,
+                              String procedureDescription, boolean readOnly, String version, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于加载存储过程是写请求，HA模式下的client只能向leader发送加载存储过程请求。
+
+### 2.9.列举存储过程
+```java
+    String result = client.listProcedures("CPP", "any", "default");
+    log.info("listProcedures : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param version: The version of procedure
+    @param graph: the graph to query.
+    @param url: (Optional) Node address of listing procedure
+    @return: the list of procedure
+    public String listProcedures(String procedureType, String version, String graph, String url) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，在HA模式下的client中，通过指定url参数可以定向向某个server发送读请求。
+
+### 2.10.删除存储过程
+```java
+    String result = client.deleteProcedure("CPP", "sortstr", "default");
+    log.info("loadProcedure : " + result);
+```
+```
+    @param procedureType: the procedure type, currently supported CPP and PY
+    @param procedureName: procedure name
+    @param graph: the graph to query.
+    @return: the result of procedure execution
+    public boolean deleteProcedure(String procedureType, String procedureName, String graph) throws Exception
+```
+本接口支持在单机模式和HA模式下使用。其中，由于删除存储过程是写请求，HA模式下的client只能向leader发送删除存储过程请求。
+
+### 2.11.从字节流中导入schema
+```java
+    boolean ret = client.importSchemaFromContent(schema, "default", 1000);
+    log.info("importSchemaFromContent : " + ret);
+```
+```
+    @param schema: the schema to be imported
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromContent(String schema, String graph, double timeout) throws UnsupportedEncodingException 
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.12.从字节流中导入点边数据
+```java
+    boolean ret = client.importDataFromContent(personDesc, person, ",", true, 16, "default", 1000);
+    log.info("importDataFromContent : " + ret);
+```
+```
+    @param desc: data format description
+    @param data: the data to be imported
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromContent(String desc, String data, String delimiter, boolean continueOnError,
+            int threadNums, String graph, double timeout) throws UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
+
+### 2.13.从文件中导入schema
+```java
+    boolean ret = client.importSchemaFromFile("./test/data/yago.conf", "default", 1000);
+    log.info("importSchemaFromFile : " + ret);
+```
+```
+    @param schemaFile: the schema_file contain schema
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import schema
+    public boolean importSchemaFromFile(String schemaFile, String graph, double timeout) 
+            throws UnsupportedEncodingException, IOException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入schema是写请求，HA模式下的client只能向leader发送导入schema请求。
+
+### 2.14.从文件中导入点边数据
+```java
+    boolean ret = client.importDataFromFile("./test/data/yago.conf", ",", true, 16, 0, "default", 1000000000);
+    log.info("importDataFromFile : " + ret);
+```
+```
+    @param confFile: data file contain format description and data
+    @param delimiter: data separator
+    @param continueOnError: whether to continue when importing data fails
+    @param threadNums: maximum number of threads
+    @param skipPackages: skip packages number
+    @param graph: the graph to query.
+    @param timeout: Maximum execution time, overruns will be interrupted
+    @return: the result of import data
+    public boolean importDataFromFile(String confFile, String delimiter, boolean continueOnError, int threadNums,
+            int skipPackages, String graph, double timeout) throws IOException, UnsupportedEncodingException
+```
+本接口支持在单机模式和HA模式下使用。其中，由于导入点边数据是写请求，HA模式下的client只能向leader发送导入点边数据请求。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/4.tugraph-ogm.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/4.tugraph-ogm.md
new file mode 100644
index 0000000000..a9c06de71b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/4.tugraph-ogm.md
@@ -0,0 +1,174 @@
+# TuGraph-OGM
+
+## 1.简介
+
+> TuGraph-OGM 项目在其他仓库开源。
+
+TuGraph-OGM(Object Graph Mapping)为面向 TuGraph 的图对象映射工具，支持将 JAVA 对象（POJO）映射到 TuGraph 中，JAVA 中的类映射为图中的节点、类中的集合映射为边、类的属性映射为图对象的属性，并提供了对应的函数操作图数据库，因此 JAVA 开发人员可以在熟悉的生态中轻松地使用 TuGraph 数据库。同时 TuGraph-OGM 兼容 Neo4j-OGM，Neo4j 生态用户可以无缝迁移到 TuGraph 数据库上。
+
+### 1.1.TuGraph-OGM 功能
+
+TuGraph-OGM 提供以下函数操作 TuGraph：
+
+| 功能                            | 用法                                                                             |
+| ------------------------------- | -------------------------------------------------------------------------------- |
+| 插入单个节点\边                 | void session.save(T object)                                                      |
+| 批量插入节点\边                 | void session.save(T object)                                                      |
+| 删除节点与对应边                | void session.delete(T object)                                                    |
+| 删除指定 label 的全部节点       | void session.deleteAll(Class\<T> type)                                           |
+| 清空数据库                      | void purgeDatabase()                                                             |
+| 更新节点                        | void session.save(T newObject)                                                   |
+| 根据 id 查询单个节点            | T load(Class<T> type, ID id)                                                     |
+| 根据 ids 查询多个节点           | Collection\<T> loadAll(Class\<T> type, Collection<ID> ids)                       |
+| 根据 label 查询全部节点         | Collection\<T> loadAll(Class\<T> type)                                           |
+| 条件查询                        | Collection\<T> loadAll(Class\<T> type, Filters filters)                          |
+| Cypher 查询（指定返回结果类型） | T queryForObject(Class\<T> objectType, String cypher, Map<String, ?> parameters) |
+| Cypher 查询                     | Result query(String cypher, Map<String, ?> parameters)                           |
+
+## 2.编译 TuGraph-OGM
+
+```shell
+cd tugraph-ogm
+mvn clean install -DskipTests -Denforcer.skip=true
+```
+
+## 3.使用 TuGraph-OGM
+
+详细示例请参考 demo 文件夹下的 TuGraphOGMDemo ###在`pom.xml`中引入依赖
+
+```
+<dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-api</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>neo4j-ogm-core</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+
+    <dependency>
+        <groupId>org.neo4j</groupId>
+        <artifactId>tugraph-rpc-driver</artifactId>
+        <version>0.1.0-SNAPSHOT</version>
+    </dependency>
+```
+
+### 3.1.构建图对象
+
+```java
+@NodeEntity
+public class Movie {      // 构建Movie节点
+    @Id
+    private Long id;      // Movie节点的id
+    private String title; // title属性
+    private int released; // released属性
+
+    // 构建边ACTS_IN    (actor)-[:ACTS_IN]->(movie)
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.INCOMING)
+    Set<Actor> actors = new HashSet<>();
+
+    public Movie(String title, int year) {
+        this.title = title;
+        this.released = year;
+    }
+
+    public Long getId() {
+        return id;
+    }
+
+    public void setReleased(int released) {
+        this.released = released;
+    }
+}
+
+@NodeEntity
+public class Actor {      // 构建Actor节点
+    @Id
+    private Long id;
+    private String name;
+
+    @Relationship(type = "ACTS_IN", direction = Relationship.Direction.OUTGOING)
+    private Set<Movie> movies = new HashSet<>();
+
+    public Actor(String name) {
+        this.name = name;
+    }
+
+    public void actsIn(Movie movie) {
+        movies.add(movie);
+        movie.getActors().add(this);
+    }
+}
+```
+
+### 3.2.与TuGraph建立连接
+
+```java
+// 配置
+String databaseUri = "list://ip:port";
+String username = "admin";
+String password = "73@TuGraph";
+//启动driver
+Driver driver = new RpcDriver();
+Configuration.Builder baseConfigurationBuilder = new Configuration.Builder()
+                            .uri(databaseUri)
+                            .verifyConnection(true)
+                            .credentials(username, password);
+                            driver.configure(baseConfigurationBuilder.build());
+driver.configure(baseConfigurationBuilder.build());
+// 开启session
+SessionFactory sessionFactory = new SessionFactory(driver, "entity_path");
+Session session = sessionFactory.openSession();
+```
+
+### 3.3.通过OGM进行增删改查
+
+```java
+// 增
+Movie jokes = new Movie("Jokes", 1990);  // 新建Movie节点jokes
+session.save(jokes);                     // 将jokes存储在TuGraph中
+
+Movie speed = new Movie("Speed", 2019);
+Actor alice = new Actor("Alice Neeves");
+alice.actsIn(speed);                    // 将speed节点与alice节点通过ACTS_IN进行连接
+session.save(speed);                    // 存储两个节点与一条边
+
+// 删
+session.delete(alice);                  // 删除alice节点以及相连的边
+Movie m = session.load(Movie.class, jokes.getId());   // 根据jokes节点的id获取jokes节点
+session.delete(m);                                    // 删除jokes节点
+
+// 改
+speed.setReleased(2018);
+session.save(speed);                   // 更新speed节点属性
+
+// 查
+Collection<Movie> movies = session.loadAll(Movie.class);  // 获取所有Movie节点
+Collection<Movie> moviesFilter = session.loadAll(Movie.class,
+        new Filter("released", ComparisonOperator.LESS_THAN, 1995));  // 查询所有小于1995年发布的电影
+
+// 调用Cypher
+HashMap<String, Object> parameters = new HashMap<>();
+parameters.put("Speed", 2018);
+Movie cm = session.queryForObject(Movie.class,
+        "MATCH (cm:Movie{Speed: $Speed}) RETURN *", parameters);      // 查询Speed为2018的Movie
+
+session.query("CALL db.createVertexLabel('Director', 'name', 'name'," +
+        "STRING, false, 'age', INT16, true)", emptyMap());            // 创建节点Label Director
+session.query("CALL db.createEdgeLabel('DIRECT', '[]')", emptyMap()); // 创建边Label DIRECT
+Result createResult = session.query(
+        "CREATE (n:Movie{title:\"The Shawshank Redemption\", released:1994})" +
+        "<-[r:DIRECT]-" +
+        "(n2:Director{name:\"Frank Darabont\", age:63})",
+        emptyMap());
+QueryStatistics statistics = createResult.queryStatistics();          // 获取create结果
+System.out.println("created " + statistics.getNodesCreated() + " vertices");    // 查看创建节点数目
+System.out.println("created " + statistics.getRelationshipsCreated() + " edges");  //查看创建边数目
+
+// 清空数据库
+session.deleteAll(Movie.class);        // 删除所有Movie节点
+session.purgeDatabase();               // 删除全部数据
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/5.bolt-client.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/5.bolt-client.md
new file mode 100644
index 0000000000..c00f3f0120
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/5.bolt-client.md
@@ -0,0 +1,72 @@
+# Bolt客户端
+
+TuGraph目前兼容了Neo4j的Bolt协议，可以直接使用Neo4j的客户端访问TuGraph。
+
+## 开启Bolt端口
+
+Bolt端口是默认开启的，默认端口是7687。如果需要修改端口，请在配置文件中自行修改。基于docker方式部署的服务，配置文件在容器内 `/usr/local/etc/lgraph.json`文件中；如果是用rpm包部署的服务，配置文件在服务器的`/usr/local/etc/lgraph.json`。 修改端口后为了使端口生效，需要重启服务，重启服务的具体操作可见[数据库运行](../../5.installation&running/7.tugraph-running.md)。另外，配置文件中的详细配置项，可见[数据库运行](../../5.installation&running/7.tugraph-running.md)中的服务配置章节。
+
+## 使用示例
+
+添加Maven依赖
+
+```xml
+<dependency>
+    <groupId>org.neo4j.driver</groupId>
+    <artifactId>neo4j-java-driver</artifactId>
+    <version>4.4.2</version>
+</dependency>
+```
+Client按照如下格式进行实例化:
+
+```java
+    Driver driver = GraphDatabase.driver("bolt://ip:port", AuthTokens.basic("admin", "73@TuGraph"));
+```
+
+常用语句
+
+```java
+        //通过 driver 对象创建一个 Session，设置会话连接到特定的数据库，用于执行Cypher语句
+        Session session = driver.session(SessionConfig.forDatabase("default"));
+        //清空图项目，请不要轻易尝试，它会清空你选中的图项目的模型以及数据
+        session.run("CALL db.dropDB()");
+        //创建点模型
+        session.run("CALL db.createVertexLabel('person', 'id' , 'id' ,INT32, false, 'name' ,STRING, false)");
+        //创建边模型
+        session.run("CALL db.createEdgeLabel('is_friend','[[\"person\",\"person\"]]')");
+        //创建索引
+        session.run("CALL db.addIndex(\"person\", \"name\", false)");
+        //插入点数据
+        session.run("create (n1:person {name:'jack',id:1}), (n2:person {name:'lucy',id:2})");
+        //插入边数据
+        session.run("match (n1:person {id:1}), (n2:person {id:2}) create (n1)-[r:is_friend]->(n2)");
+        //查询点和边
+        Result res = session.run("match (n)-[r]->(m) return n,r,m");
+        //Parameterized Query
+        String cypherQuery = "MATCH (n1:person {id:$id})-[r]-(n2:person {name:$name}) RETURN n1, r, n2";
+        Result result1 = session.run(cypherQuery, parameters("id", 1, "name", "lucy"));
+        while (result1.hasNext()) {
+        Record record = result1.next();
+        System.out.println("n1: " + record.get("n1").asMap());
+        System.out.println("r: " + record.get("r").asMap());
+        System.out.println("n2: " + record.get("n2").asMap());
+                }
+        //删除点数据
+        session.run("match (n1:person {id:1}) delete n1");
+        //删除边数据
+        session.run("match (n1:person {id:1})-[r]-(n2:person{id:2}) delete r");
+        //删除边模型
+        session.run("CALL db.deleteLabel('edge', 'is_friend')");
+        //删除点模型
+        session.run("CALL db.deleteLabel('vertex', 'person')");
+```
+
+详细Cypher和存储过程的使用可见[Cypher](../../8.query/1.cypher.md)
+
+## Neo4j客户端使用限制
+
+目前，我们的系统尚未全面兼容Neo4j Bolt协议的所有高级特性。特别地，对于Neo4j客户端所具备的即时事务处理功能及弱schema灵活性这两项独特能力，当前尚不提供支持。因此，在采用客户端进行操作时，请务必留意规避涉及此类特性的操作，以确保应用的顺畅运行与数据的一致性。
+
+## 客户端示例
+
+在代码目录中的demo/Bolt下面有Golang、Java、JavaScript、Python、Rust 这几个语言的的例子。想要了解更多可见[客户端示例](https://github.com/TuGraph-family/tugraph-db/tree/master/demo)
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/6.bolt-console-client.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/6.bolt-console-client.md
new file mode 100644
index 0000000000..bd3ff0f0ae
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/6.bolt-console-client.md
@@ -0,0 +1,102 @@
+# TuGraph console client
+
+`lgraph_cli` 是基于bolt协议的 console client，c++编写，使用时需要连接tugraph的bolt端口。
+
+`lgraph_cli` 是一个二进制的可执行文件，不依赖其他动态库，拷贝到一台linux机器上就可执行。
+
+## `lgraph_cli`使用
+
+语句以分号结束，输入`exit`, `quit`或者Ctrl-C退出客户端。
+
+```powershell
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
+
+Welcome to the TuGraph console client. Commands end with ';'.
+Copyright(C) 2018-2023 Ant Group. All rights reserved.
+Type 'exit', 'quit' or Ctrl-C to exit.
+
+TuGraph> match(n) return n limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+语句可以中间换行，多行输入。
+
+```powershell
+TuGraph> match(n)
+      -> return n
+      -> limit 1;
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+
+TuGraph>
+```
+
+非交互式
+```powershell
+
+echo "match(n) return n limit 1;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+1 rows
+
+```
+
+从文件读取多条命令
+
+```powershell
+
+cat query.txt
+match(n) return n limit 1;
+match(n) return n limit 1;
+
+lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph < query.txt
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+
++-------------------------------------------------------------------------------------------------------------------------------------+
+| n                                                                                                                                   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:2,born:1961,poster_image:"https://image.tmdb.org/t/p/w185/mh0lZ1XsT84FayMNiT6Erh91mVu.jpg",name:"Laurence Fishburne"}) |
++-------------------------------------------------------------------------------------------------------------------------------------+
+| (:person {id:3,born:1967,poster_image:"https://image.tmdb.org/t/p/w185/8iATAc5z5XOKFFARLsvaawa8MTY.jpg",name:"Carrie-Anne Moss"})   |
++-------------------------------------------------------------------------------------------------------------------------------------+
+2 rows
+```
+
+## 在线数据导出
+
+lgraph_cli 支持流式读取，导出数据只需要把lgraph_cli的输出重定向到文件中即可，导出格式支持csv和json。
+
+### csv格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+
+```
+
+### json格式
+
+```powershell
+
+echo "match(n) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/7.restful-api.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/7.restful-api.md
new file mode 100644
index 0000000000..e8f090a1c8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/7.restful-api.md
@@ -0,0 +1,118 @@
+# RESTful API
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+## 2.请求与响应格式
+TuGraph HTTP Server 接收json格式的请求，经过鉴权后开始提取请求中的字段，根据定义好的接口逻辑处理请求，并返回json格式的响应。
+
+### 2.1.标准响应格式
+每一个响应都以标准响应格式返回，格式如下：
+
+| body参数  | 参数说明         | 参数类型        | 是否必填       |
+| ------- |--------------|-------------|------------|
+| errorCode   | 业务级错误码       | int类型       | 是          |
+| success   | 请求是否成功       | int类型       | 是          |
+| errorMessage   | 业务级错误信息      | 字符串类型       | 是          |
+| data   | 请求成功时返回的响应信息 | json字符串     | 是          |
+
+### 2.2请求类型
+
+#### 2.2.1. 用户登陆
+用户在登陆请求中携带用户名和密码发送到服务端。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，在后续的请求中将令牌加入请求头的Authorization域中。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**:     /login
+- **METHOD**:  POST
+- **REQUEST**:
+
+| body参数 | 参数说明 | 参数类型  | 是否必填       |
+| ------ |------|-------|------------|
+| user   | 用户名  | 字符串类型   | 是          |
+| password | 用户密码 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数          | 参数说明           | 参数类型   |
+|------------------|--------------------|------------|
+| jwt              | 令牌               | 字符串类型 |
+| is_admin         | 是否是admin用户    | 布尔类型   |
+| default_password  | 默认密码           | 布尔类型   |
+
+**Example request.**
+
+```
+    {"user" : "admin", "password" : "73@TuGraph"}
+```
+
+#### 2.2.2. 用户登出
+用户登出，同时删除已经认证的token，用户后续发送请求时，需要重新登陆，并获取新的token。
+
+- **URI**:     /logout
+- **METHOD**:  POST
+  - **REQUEST**:
+    http request header中携带调用login接口时返回的token，具体填写的字符串是`Bearer ${jwt}`，`${jwt}`就是login接口返回的jwt，body中没有参数
+
+| header参数           | 参数说明          | 参数类型   |
+|------------------|---------------|------------|
+| Authorization              | Bearer ${jwt} | 字符串类型 |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含
+
+| body参数          | 参数说明           | 参数类型   |
+|------------------|--------------------|------------|
+| is_admin         | 是否是admin用户    | 布尔类型   |
+
+#### 2.2.3. 身份刷新
+已下发的token失效后，需要调用本接口重新认证。后端验证token合法性。token在初次登录后，1小时内有效，过期需要刷新
+
+- **URI**:     /refresh
+- **METHOD**:  POST
+- **REQUEST**:
+  http request header中携带调用login接口返回的token，具体填写的字符串是`Bearer ${jwt}`，`${jwt}`就是login接口返回的jwt，body中没有参数
+
+| header参数           | 参数说明          | 参数类型   |
+|------------------|---------------|------------|
+| Authorization              | Bearer ${jwt} | 字符串类型 |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含令牌
+
+| body参数          | 参数说明           | 参数类型   |
+|------------------|--------------------|------------|
+| jwt              | 令牌               | 字符串类型 |
+| is_admin         | 是否是admin用户    | 布尔类型   |
+
+#### 2.2.4. 调用cypher
+用户对TuGraph的增删改查请求需要调用cypher接口，并通过标准的cypher查询语言发起
+
+- **URI**:     /cypher
+- **METHOD**:  POST
+- **REQUEST**:
+
+| header参数           | 参数说明          | 参数类型   |
+|------------------|---------------|------------|
+| Authorization              | Bearer ${jwt} | 字符串类型 |
+
+| body参数  | 参数说明     | 参数类型  | 是否必填       |
+| ------- |----------|-------|------------|
+| graph   | 查询的子图名称  | 字符串类型   | 是          |
+| script   | cypher语句 | 字符串类型 | 是          |
+
+- **RESPONSE**:
+  如果成功，返回的响应信息中success为00，data中包含查询结果
+
+| body参数  | 参数说明 | 参数类型    | 是否必填       |
+| ------- |------|---------|------------|
+| result   | 查询结果 | json字符串 | 是          |
+
+**Example request.**
+
+```
+    {"script" : "Match (n) return n", "graph" : "default"}
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/8.rpc-api.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/8.rpc-api.md
new file mode 100644
index 0000000000..21ad033477
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/8.rpc-api.md
@@ -0,0 +1,273 @@
+# RPC API
+
+> 此文档主要介绍 TuGraph 的 RPC API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供丰富的 RPC API，以供开发者通过 RPC 请求远程调用 TuGraph 提供的服务。
+
+RPC（远程过程调用）是一种通过网络从远程计算机程序上请求服务，而不需要了解底层网络技术的协议。
+相比REST，RPC 面向方法，主要用于函数方法的调用，可以适合更复杂通信需求的场景，且性能更高。
+brpc是用c++语言编写的工业级RPC框架，基于brpc，TuGraph 提供了丰富的RPC API，本文档描述
+TuGraph 的 RPC API 使用方式。
+
+## 2.请求
+
+### 2.1.建立连接
+
+开发者向TuGraph服务发送RPC请求，首先要建立连接。以C++语言为例，开发者创建指定url的通道（channel），
+由通道创建指定的服务存根（LGraphRPCService_Stub），后续即可通过存根像调用本地方法一样向远程
+服务器发送请求。
+
+```C++
+    std::shared_ptr<lgraph_rpc::m_channel_options> options = std::make_shared<lgraph_rpc::m_channel_options>();
+    options->protocol = "baidu_std";
+    options->connection_type = "";
+    options->timeout_ms = 60 * 60 * 1000 /*milliseconds*/;
+    options->max_retry = 3;
+    std::string load_balancer = "";
+    std::shared_ptr<lgraph_rpc::m_channel> channel = std::make_shared<lgraph_rpc::m_channel>();
+    if (channel->Init(url.c_str(), load_balancer, options.get()) != 0)
+        throw RpcException("Fail to initialize channel");
+    LGraphRPCService_Stub stub(channel.get());
+```
+
+### 2.2.请求类型
+
+TuGraph支持10种RPC请求，其中每种请求的功能如下表所示：
+
+| 请求              | 功能         |
+|-----------------|------------|
+| GraphApiRequest | 点边索引操作请求   |
+| CypherRequest   | cypher请求   |
+| PluginRequest   | 存储过程请求     |
+| HARequest       | 高可用模式请求    |
+| ImportRequest   | 数据导入请求     |
+| GraphRequest    | 子图操作请求     |
+| AclRequest      | 权限管理请求     |
+| ConfigRequest   | 配置管理请求     |
+| RestoreRequest  | 备份请求       |
+| SchemaRequest   | schema管理请求 |
+
+用户发送请求时，需要传入以下参数：
+- client_version: 可选参数，HA模式下可通过对比`client_version`和`server_version`防止响应过时的请求
+- token: 必要参数，客户端登陆之后获得token，每次请求传入token以校验用户身份
+- is_write_op: 可选参数，标志请求是否是写请求
+- user: 可选参数，HA模式下主从之间同步请求时设置user，不需验证token
+
+服务处理完RPC请求之后发回响应，响应消息中除了包含每个请求的单独响应信息之外，还包含以下参数：
+- error_code: 必要参数，标志请求处理状态
+- redirect: 可选参数，HA模式下向follower发送写请求时处理失败，设置redirect为请求转发地址，即leader地址
+- error: 可选参数，请求错误信息
+- server_version: 可选参数，HA模式的请求响应中设置`server_version`以避免client读取数据时发生反向时间旅行问题
+
+:warning:  **除CypherRequest、PluginRequest、HARequest和AclRequest外，其余RPC接口将逐步废弃，其功能统一至CypherRequest接口。**
+
+## 3.登录
+
+登录请求信息包含以下参数：
+- user: 必要参数，用户名
+- pass: 必要参数，密码
+以C++为例，用户使用构建好的服务存根发送登录请求：
+```C++
+    auto* req = request.mutable_acl_request();
+    auto* auth = req->mutable_auth_request()->mutable_login();
+    auth->set_user(user);
+    auth->set_password(pass);
+    // send data
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req->set_client_version(server_version);
+    req->set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), req, &resp, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    token = res.acl_response().auth_response().token();
+```
+登录响应信息包含以下参数：
+- token: 必要参数，登录成功会收到带有签名的令牌，即 Json Web Token，客户端储存该令牌，并且用于以后的每次发送请求。
+如果登录失败会收到“Authentication failed”错误。
+
+## 4.查询
+用户可以通过Cypher查询和TuGraph进行绝大多数的交互，Cypher请求信息包含以下参数：
+- query: 必要参数，Cypher查询语句
+- param_names: 可选参数，参数名
+- param_values: 可选参数，参数值
+- result_in_json_format: 必要参数，查询结果是否以JSON格式返回
+- graph: 可选参数，Cypher语句执行的子图名称
+- timeout: 可选参数，Cypher语句执行的超时时间
+
+以C++为例，用户发送Cypher请求的方式如下所示：
+```C++
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    LGraphRequest req;
+    req.set_client_version(server_version);
+    req.set_token(token);
+    lgraph::CypherRequest* cypher_req = req.mutable_cypher_request();
+    cypher_req->set_graph(graph);
+    cypher_req->set_query(query);
+    cypher_req->set_timeout(timeout);
+    cypher_req->set_result_in_json_format(true);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    server_version = std::max(server_version, res.server_version());
+    CypherResponse cypher_res = res.cypher_response();
+```
+Cypher请求响应为以下两个参数之一：
+- json_result: JSON格式的cypher查询结果
+- binary_result: CypherResult格式的cypher查询结果
+
+## 5.存储过程
+为满足用户较为复杂的查询/更新逻辑，TuGraph支持 C 语言和 Python 语言编写的存储过程。
+用户可以使用RPC请求对存储过程进行增删改查操作。
+
+### 5.1.加载存储过程
+加载存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- read_only: 必要参数，是否只读
+- code: 必要参数，存储过程文件读入生成的ByteString
+- desc: 可选参数，存储过程描述
+- code_type: 可选参数，存储过程代码类型，PY、SO、CPP、ZIP四者之一
+
+以C++为例，用户加载存储过程的方式如下所示：
+```C++
+    std::string content;
+    if (!FieldSpecSerializer::FileReader(source_file, content)) {
+        std::swap(content, result);
+        return false;
+    }
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->set_version(version);
+    lgraph::LoadPluginRequest* loadPluginRequest = pluginRequest->mutable_load_plugin_request();
+    loadPluginRequest->set_code_type([](const std::string& type) {
+        std::unordered_map<std::string, lgraph::LoadPluginRequest_CodeType> um{
+            {"SO", lgraph::LoadPluginRequest::SO},
+            {"PY", lgraph::LoadPluginRequest::PY},
+            {"ZIP", lgraph::LoadPluginRequest::ZIP},
+            {"CPP", lgraph::LoadPluginRequest::CPP}};
+        return um[type];
+    }(code_type));
+    loadPluginRequest->set_name(procedure_name);
+    loadPluginRequest->set_desc(procedure_description);
+    loadPluginRequest->set_read_only(read_only);
+    loadPluginRequest->set_code(content);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+加载存储过程的响应不包含参数，如果加载失败则抛出BadInput异常
+
+### 5.2.调用存储过程
+
+调用存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+- param: 必要参数，存储过程参数
+- result_in_json_format: 可选参数，调用结果是否以JSON格式返回
+- in_process: 可选参数，未来支持
+- timeout: 可选参数，调用存储过程的超时时间
+
+以C++为例，用户调用存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::CallPluginRequest *cpRequest = pluginRequest->mutable_call_plugin_request();
+    cpRequest->set_name(procedure_name);
+    cpRequest->set_in_process(in_process);
+    cpRequest->set_param(param);
+    cpRequest->set_timeout(procedure_time_out);
+    cpRequest->set_result_in_json_format(json_format);
+    LGraphResponse res;
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    if (json_format) {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->json_result();
+    } else {
+        result = res.mutable_plugin_response()->mutable_call_plugin_response()->reply();
+    }
+```
+调用存储过程的响应为以下两个参数之一：
+- reply: ByteString格式的存储过程调用结果
+- json_result: JSON格式的存储过程调用结果
+
+### 5.3.删除存储过程
+
+删除存储过程的请求包含以下参数：
+- name: 必要参数，存储过程名称
+
+以C++为例，用户删除存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(true);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    lgraph::DelPluginRequest* dpRequest = pluginRequest->mutable_del_plugin_request();
+    dpRequest->set_name(procedure_name);
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+```
+删除存储过程的响应不包含参数，如果删除失败则抛出BadInput异常
+
+### 5.4.列举存储过程
+
+列举存储过程请求不需要参数，以C++为例，用户列举存储过程的方式如下所示：
+```C++
+    LGraphRequest req;
+    req.set_is_write_op(false);
+    lgraph::PluginRequest* pluginRequest = req.mutable_plugin_request();
+    pluginRequest->set_graph(graph);
+    pluginRequest->set_type(procedure_type == "CPP" ? lgraph::PluginRequest::CPP
+                                                    : lgraph::PluginRequest::PYTHON);
+    pluginRequest->mutable_list_plugin_request();
+    cntl->Reset();
+    cntl->request_attachment().append(FLAGS_attachment);
+    req.set_client_version(server_version);
+    req.set_token(token);
+    LGraphRPCService_Stub stub(channel.get());
+    LGraphResponse res;
+    stub.HandleRequest(cntl.get(), &req, &res, nullptr);
+    if (cntl->Failed()) throw RpcConnectionException(cntl->ErrorText());
+    server_version = std::max(server_version, res.server_version());
+    if (res.error_code() != LGraphResponse::SUCCESS) throw RpcStatusException(res.error());
+    result = res.mutable_plugin_response()->mutable_list_plugin_response()->reply();
+```
+列举存储过程的响应的参数如下所示：
+- reply: JSON格式的procedure列表
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/9.restful-api-legacy.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/9.restful-api-legacy.md
new file mode 100644
index 0000000000..1928d70f07
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/9.restful-api-legacy.md
@@ -0,0 +1,2918 @@
+# RESTful API Legacy
+
+> 此文档主要介绍 TuGrpah 的 Rest API 的调用详情。
+
+## 1.简介
+
+TuGraph 提供遵从 REST 规范的 HTTP API，以供开发者通过 HTTP 请求远程调用 TuGraph 提供的服务。
+
+本文档描述 TuGraph 的 HTTP API 使用方式。
+
+**注意：除"登陆"、"查询"和"存储过程"外，其余接口自 **2023年4月30日** 起将不再提供支持，统一使用Cypher接口提供服务。**
+
+## 2.请求与数据格式
+
+### 2.1请求
+
+TuGraph 支持 HTTP GET/POST/PUT/DELETE 请求。其中：
+
+- GET 请求用于只读请求，如读取点属性，边属性等操作；
+- POST 请求用于创建实体，提交 Cypher，以及加载和调用存储过程；
+- PUT 请求用于修改已有实体，如修改点属性，边属性等；
+- DELETE 请求用于删除已有实体，如删除点，边等。
+
+在高可用模式下，用户可以在请求的报头(request header)中设置 `server_version` 来保证请求的服务器有足够新的数据。
+当前的 `server_version` 可以从服务器返回的报头中获取。
+
+### 2.2.数据格式
+
+客户端与服务端数据交互的格式是 JSON。在发送请求时，请将发送数据的请求的报头设置为 `Accept:application/json, Content-Type:application/json`。
+例如在创建一个点时，请求报头包含以下内容：
+
+```
+    Accept: application/json; charset=UTF-8
+    Content-Type: application/json
+    server_version: 12
+```
+
+### 2.3.返回值
+
+TuGraph 返回的 HTTP 状态码包含以下四种：
+
+- 200 OK: 操作成功
+- 307 Temporary Redirect: 操作被重定向，一般用于高可用模式下，把操作重定向到 master 上
+- 400 Bad Request: 输入有误，例如 URI 错误，或者请求中的 JSON 参数错误
+- 500 Internal Server Error: 服务器端错误
+
+当操作成功时，返回的 JSON 中包含操作的返回值。当操作重定向时，返回的 HTTP 报头中的 `location` 域包含重定向目的地址。
+当发生输入错误或者服务器错误时，返回的 JSON 中包含 `error_message` 域，其内容是错误提示。
+
+在高可用模式下，服务器还会在报头中设置 `server_version`，以告知客户端当前服务器的数据版本号。当客户端在不同的服务器之间切换时，该数据版本号可以保证客户端不会读到错误的历史数据。
+
+### 2.4.URI格式
+
+TuGraph REST API 提供以下功能：Service Root, login, info, label, index, node, relationship, cypher, cpp_plugin, 以及 python_plugin。
+各功能使用的 URI 格式如下：
+
+| URI     | 说明                 |
+| ------- | -------------------- |
+| /web    | web 可视化界面       |
+| /cypher | cypher 请求          |
+| /acl    | 权限控制             |
+| /user   | 用户管理             |
+| /login  | 用户登录             |
+| /info   | 数据库状态及提示信息 |
+| /task   | 任务管理             |
+| /db     | 子图操作             |
+
+其中子图操作又分为：
+
+| URI                              | 说明                 |
+| -------------------------------- | -------------------- |
+| /db                              | 子图的创建，删除     |
+| /db/_{graph_name}_/node          | 点操作             |
+| /db/_{graph_name}_/relationship  | 边操作               |
+| /db/_{graph_name}_/label         | Label 相关操作       |
+| /db/_{graph_name}_/index         | 索引相关操作         |
+| /db/_{graph_name}_/cypher        | 子图相关 cypher 操作 |
+| /db/_{graph_name}_/cpp_plugin    | C++存储过程          |
+| /db/_{graph_name}_/python_plugin | Python 存储过程      |
+| /db/_{graph_name}_/import        | 在线导入             |
+| /db/_{graph_name}_/misc          | 其它操作             |
+
+## 3.登录
+
+TuGraph 提供基于 JWT 的用户认证方式，可以使用 HTTP 或 HTTPS 协议进行传输。系统默认使用 HTTP 协议，如果需要使用 HTTPS，需要在 lgraph.json 配置文件中将 ssl_auth 设为 1。
+
+### 3.1.登录
+
+用户通过用户名和密码发送登录请求。登录成功会收到带有签名的令牌(Json Web Token)和判断是否为默认密码的布尔型变量，客户端储存该令牌，并且用于以后的每次发送请求。如果登录失败会收到“Authentication failed”错误。
+
+- **URI**: `/login`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+  | default_password | 是否为默认密码 | 布尔值 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/login
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "user":"admin",
+      "password":"73@TuGraph"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek",
+        "default_password": true
+    }
+```
+
+### 3.2.身份刷新
+Token失效后，前端发起刷新token接口，后端验证token合法性。初次登录后，1小时内有效，需刷新使用。即使刷新，24小时后也会强制退出，需要重新登陆。
+验证通过，生成新的token；验证失败返回状态码401。
+
+- **URI**: `/refresh`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | jwt | 令牌 | 字符串 |
+
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/refresh
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization": "Bearer eyJhbGciOiJIUz32NiIsInR5cCI6IkpXVDJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byj3fYVAH4D88dfTD_zYQ_uAvdizTMek"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "jwt": "eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek"
+    }
+```
+
+### 3.3.修改Token有效期
+修改Token有效期，需要传输jwt，refresh_time和expire_time三个参数，其中jwt用于校验用户身份，refresh_time和expire_time等于0时，有效期为无期限，超过refresh_time时，需要调用refresh接口获取新的Token;超过expire_time时，需要重新登录。
+
+- **URI**: `/update_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+  | refresh_time | 有效时间（默认设置为0） | Int64 |
+  | expire_time | 有效时间（默认设置为0） | Int64 |
+
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/update_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+        "refresh_time":0,
+        "expire_time":0
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 3.4.查询Token有效期
+查询Token有效期，需要传输jwt，用于校验用户身份，返回，refresh_time和expire_time，其中refresh_time表示刷新时间，超过时需要调用refresh接口获取新的Token;expire_time表示过期时间，超过时需要重新登录。
+- **URI**: `/get_token_time`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+
+- **RESPONSE**:  如果成功，返回"refresh_time"和"expire_time"。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/get_token_time
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "refresh_time":600,
+        "expire_time":3600
+    }
+```
+
+### 3.5.登出
+用户登出，同时删除token。
+
+- **URI**: `/logout`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | Authorization | 令牌 | 字符串 |
+- **RESPONSE**:  如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/logout
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "Authorization" : "Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJmbWEuYWkiLCJwYXNzd29yZCI6IjczQFR1R3JhcGgiLCJ1c2VyIjoiYWRtaW4ifQ.o_yb5veSJkuy-ieBp4MqTk-tC1grcKotgVbgNJ0TyTU"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 4.查询
+
+URI 格式为
+
+```
+    http://{host}:{port}/cypher
+```
+
+### 4.1.调用Cypher
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 列表 |
+  | elapsed | 运行时间（秒） | 浮点数 |
+  | header | 返回结果的表头 | 列表 |
+  | size | 结果数 | 整型 |
+
+其中 header 是一个列表，每一元素格式如下：
+
+| 域名 | 说明                                        | 类型   |
+| ---- | ------------------------------------------- | ------ |
+| name | 列名                                        | 字符串 |
+| type | 列数据类型，0 为标量，1 为点 id，2 为向量 |        |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "graph": "default",
+        "script": "MATCH (n) RETURN n,n.name LIMIT 10"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.001224517822265625,
+        "header": [
+            {
+                "name": "n",
+                "type": 1
+            },
+            {
+                "name": "n.name",
+                "type": 0
+            }
+        ]
+        "result": [
+            [
+                0,
+                "Rachel Kempson"
+            ],
+            [
+                1,
+                "Michael Redgrave"
+            ],
+            [
+                2,
+                "Vanessa Redgrave"
+            ]
+        ],
+        "size": 3
+    }
+```
+
+### 4.2.调用带参数的 Cypher
+
+Cypher 支持使用参数进行查询。当调用带参数的 Cypher 查询时，TuGraph 会缓存该查询的
+执行计划（execution plan），以加速后续同类查询的速度。
+
+- **URI**: `/cypher`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | graph | 数据库 | 字符串 |
+  | cypher | 查询语句 | 字符串 |
+  | parameters | 参数 | 列表 |
+
+- **RESPONSE**:
+
+与 [调用 Cypher](#%E8%B0%83%E7%94%A8Cypher) 相同。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cypher
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "graph": "default",
+      "script": "MATCH (n:Person {name:$param1}) RETURN n.birthyear",
+      "parameters": {
+        "$param1": "Lindsay Lohan"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "elapsed": 0.005886077880859375,
+        "header": [
+            {
+                "name": "n.birthyear",
+                "type": 0
+            }
+        ],
+        "result": [
+            [
+                1986
+            ]
+        ],
+        "size": 1
+    }
+```
+
+
+## 5.存储过程
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/cpp_plugin|python_plugin
+```
+
+### 5.1.加载存储过程
+
+TuGraph 服务启动时，如果 load_plugins 为真，则会自动加载 plugin 目录下的所有 plugin。否则需要手动加载。此外，如果服务器运行过程中，管理员更新了 plugin 文件，也需要手动重新加载。重新加载 plugin 的调用格式为：
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 插件名称 | 字符串 |
+  | description | 插件说明 | 字符串 |
+  | code_base64 | 插件代码 | 字符串，使用 base64 编码 |
+  | read_only | 是否为只读存储过程 | 布尔值 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 5.2.列出所有存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程列表，其中每个元素是一个 plugin 的描述，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            {
+                "description":"adds a vertex label to the db",
+                "name":"add_label",
+                "read_only":false
+            },
+            {
+                "description": "scans graph and get number of edges",
+                "name": "scan_graph",
+                "read_only": true
+            }
+        ]
+    }
+```
+
+### 5.3.获取存储过程的详细信息
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: GET
+- **RESPONSE**: 存储过程信息，包括代码，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 存储过程名 | 字符串 |
+  | description | 存储过程描述 | 字符串 |
+  | read_only | 存储过程是否只读 | 布尔值 |
+  | code_base64 | 存储过程的代码 | 字符串，使用 base64 编码 |
+  | code_type | 上传代码的类型，C++类型可选 zip/so/cpp，Python 为 py | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/cpp_plugin/echo
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "name" : "echo",
+        "description" : "A test plugin that returns the input",
+        "code_base64" : "{base64 encoded echo.zip}",
+        "read_only" : true,
+        "code_type" : "zip"
+    }
+```
+
+### 5.4.调用存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: POST
+- **REQUEST**: 字符串输入
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | data | 输入数据 | 字符串 |
+  | timeout | 超时长度（秒，可选，缺省值为 0） | 浮点 |
+  | in_process | 是否在本进程调用（可选，缺省值为 false） | 布尔值 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | result | 运行结果 | 字符串 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/python_plugin/echo
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+        data : "Hello!\n你好！\nKonichiwa!",
+        timeout : 0,
+        in_process : true
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+      "result": "Hello!\n你好！\nKonichiwa!"
+    }
+```
+
+### 5.5.删除存储过程
+
+- **URI**: `/db/{graph_name}/cpp_plugin|python_plugin/{plugin_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/cpp_plugin/example_plugin
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+## 6.Deprecated
+
+以下接口将在4/30/2023之后被删除。
+
+### 6.1.用户管理
+
+系统默认创建一个管理员，管理员用户名为 _admin_，密码为 _73@TuGraph_。为了安全起见，请用户在第一次启动服务器后更改密码。
+
+
+#### 6.1.1.添加用户
+
+添加一个新的用户，并为其设置初始密码。只有管理员有权限进行此操作。其中用户名只能由字母，数字以及下划线构成，密码则可以包含任意字符。用户名和密码长度不能超过 64 字节。添加用户时还可以为用户增加一个描述，用户描述可以包含任意字符，最长不超过 512 字节。
+
+新用户默认拥有同名的角色，不具备任何图的权限。
+
+- **URI**: `/user`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | user | 用户名 | 字符串 |
+  | password | 密码 | 字符串 |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "user": "USER1",
+        "password": "AN_INITIAL_PASSWORD",
+        "description": "This is a user"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.2.列出所有用户
+
+列出数据库的所有用户。只有管理员拥有该操作权限。
+
+- **URI**: `/user/`
+- **METHOD**: GET
+- **RESPONSE**: 所有用户及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin admin user",
+        "roles": ["admin"]
+    },
+    "guest1": {
+        "disabled": true,
+        "description": "",
+        "roles": ["guest1", "some_other_role"]
+    }
+}
+```
+
+#### 6.1.3.获取用户信息
+
+列出给定用户的信息。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "A guest user"
+    "roles": ["guest1", "some_other_role"]
+}
+```
+
+#### 6.1.4.列出用户权限
+
+列出给定用户有权限访问的所有图及相应权限。
+
+- **URI**: `/user/{user_name}/graph`
+- **METHOD**: GET
+- **RESPONSE**: 用户信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/user/guest1/graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "graph1" : "FULL",
+    "graph2" : "READ"
+}
+```
+
+#### 6.1.5.更改用户密码
+
+用户可以更改自己的密码，更改密码时需要同时提供原密码。管理员可以更改所有用户的密码。管理员更改其它用户密码时，可以不提供当前密码。
+
+- **URI**: `/user/{user_name}/password`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | current_password | 当前密码 | 字符串 |
+  | new_password | 新密码 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/password
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "current_password": "THE_CURRENT_PASSWORD"
+        "new_password": "A_NEW_PASSWORD"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.6.修改用户描述
+
+用户可以修改自己的描述。管理员可以修改任意用户的描述。
+
+- **URI**: `/user/{user_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 用户描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/user1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "New description for this user."
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.7.删除用户
+
+删除用户及其所有相关权限，只有管理员拥有该操作权限。
+
+- **URI**: `/user/{user_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.8.禁用用户
+
+用户可以被禁用。被禁用的用户将不能登陆，但是其资料仍然保存。被禁用的用户可以被重新启用。
+
+- **URI**: `/user/{user_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.9.启用用户
+
+启用一个被禁用的用户。
+
+- **URI**: `/user/{user_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.1.10.设置用户角色
+
+为指定用户设置角色。只有管理员可以执行此操作。
+
+用户角色列表必须是“全量列表”，即该列表需要包含该用户需要的所有角色。唯一的例外是用户的同名角色，即使列表中不含该角色，它也会被加到用户角色中。
+
+- **URI**: `/user/{user_name}/role`
+- **METHOD**: POST
+- **REQUEST**: 角色列表
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/user/guest1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+        ["role1", "role2"]
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+此时用户`guest1`拥有角色`guest1`, `role1`和`role2`。
+
+### 6.2.角色管理
+
+TuGraph 使用基于角色的权限管理。
+
+同一用户可以拥有多个角色。新用户默认拥有与其同名的角色。删除用户时，同名角色也会被删除。如果新建用户时同名角色已经存在，则创建失败。
+
+同一角色可以对多个图有不同的权限。用户对某张图的权限由其所有角色对该图的最高权限决定。
+
+TuGraph 使用四级权限，不用的用户对不同的子图可以有不同的权限，四种权限及其说明如下：
+
+| 权限  | 说明                                                                             |
+| ----- | -------------------------------------------------------------------------------- |
+| NONE  | 无权限                                                                           |
+| READ  | 只读                                                                             |
+| WRITE | 可读写子图中的点和边                                                           |
+| FULL  | 完全权限，包括更改元数据（label, index），管理存储过程，以及删除子图中的所有数据 |
+
+管理员对所有子图都有完全权限，新建的用户对所有子图都没有权限。将用户加入管理员角色中可以将用户提升为管理员。
+
+#### 6.2.1.添加角色
+
+添加一个新的角色，并设置其描述。只有管理员有权限进行此操作。
+
+角色名只能由字母，数字以及下划线构成，密码则可以包含任意字符。角色名长度不能超过 64 字节。
+
+角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | role | 角色名 | 字符串 |
+  | description | 角色描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "role": "new_role",
+        "description": "This is a new role.",
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.2.修改角色描述
+
+修改角色的描述。只有管理员有权限进行此操作。角色描述可以是任意字符串，长度不超过 512 字节。
+
+- **URI**: `/role/{role_name}/description`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 新描述 | 字符串 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/description
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "description": "modified description"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.3.列出所有角色
+
+列出数据库的所有角色。只有管理员拥有该操作权限。
+
+- **URI**: `/role/`
+- **METHOD**: GET
+- **RESPONSE**: 所有角色及其信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "admin": {
+        "disabled": false,
+        "description": "Builtin administrator group.",
+        "permissions": {"default":"FULL", "graph1":"FULL"}
+    },
+    "role1": {
+        "disabled": true,
+        "description": "Another role",
+        "permissions": {"default":"READ"}
+    }
+}
+```
+
+#### 6.2.4.获取角色信息
+
+列出给定角色的信息。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: GET
+- **RESPONSE**: 角色信息。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+• 200: OK
+Output:
+{
+    "disabled": true,
+    "description": "Another role",
+    "permissions": {"default":"READ"}
+}
+```
+
+#### 6.2.5.删除角色
+
+删除指定角色，只有管理员拥有该操作权限。
+
+- **URI**: `/role/{role_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/role/role1
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.6.禁用角色
+
+角色可以被禁用。角色被禁用后，具有该角色的用户将不再从该角色中获得任何权限。只有管理员可以执行此操作。
+
+- **URI**: `/role/{role_name}/disable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/disable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.7.启用角色
+
+启用一个被禁用的角色。
+
+- **URI**: `/role/{role_name}/enable`
+- **METHOD**: POST
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/enable
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.2.8.设置角色权限
+
+为指定角色设置权限。只有管理员可以执行此操作。
+
+角色权限列表必须是“全量列表”，即该列表需要包含该角色能操作的所有图及其权限。
+
+- **URI**: `/role/{role_name}/permissions`
+- **METHOD**: POST
+- **REQUEST**: 图名称及相应权限的字典。
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/role/role1/permissions
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    • Authorization: Bearer eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJhZG1pbiI6dHJ1ZSwiaXNzIjoiZm1hLmFpIiwidXNlcl9pZCI6ImFkbWluIn0.SHaqrjKLaI4byjbEYVAH4D88dOTD_zYQ_uAvdizTMek
+    Input:
+    {
+        "graph1" : "FULL",
+        "graph2" : "READ"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+
+### 6.3.服务器状态
+
+#### 6.3.1.修改服务器配置
+
+修改服务器配置，配置修改后立即生效，并将影响所有服务器。这些配置的优先级高于配置文件以及命令行参数。
+
+- **URI**: `/config`
+- **METHOD**: PUT
+- **REQUEST**:
+
+请求为一个字典，使用 `{"opt1":v1}` 可以将名为`opt1`的配置修改为`v1`。
+
+| 配置名               | 说明                   | 值类型 |
+| -------------------- | ---------------------- | ------ |
+| OPT_DB_ASYNC         | 是否启用异步模式       | 布尔值 |
+| OPT_TXN_OPTIMISTIC   | 是否默认使用乐观事务锁 | 布尔值 |
+| OPT_AUDIT_LOG_ENABLE | 是否启用审计日志       | 布尔值 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/config
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "OPT_DB_ASYNC": true,
+        "OPT_AUDIT_LOG_ENABLE": false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.3.2.当前服务器状态
+
+- **URI**: `/info`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | lgraph_version | 服务器版本号 | 字符串 |
+  | git_branch | 服务器代码分支 | 字符串 |
+  | git_commit | 服务器代码版本 | 字符串 |
+  | web_commit | 前端码版本 | 字符串 |
+  | cpp_id | CPP 编译器 ID | 字符串 |
+  | cpp_version | CPP 编译器版本 | 字符串 |
+  | python_version | PYTHON 版本 | 字符串 |
+  | node | 点 uri | 字符串 |
+  | relationship | 边 uri | 字符串 |
+  | cpu | cpu 信息 | 字典，格式参见[服务器 CPU 状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8CPU%E7%8A%B6%E6%80%81) |
+  | disk | 硬盘 IO 信息 | 字典，格式参见[服务器硬盘状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E7%A1%AC%E7%9B%98%E7%8A%B6%E6%80%81) |
+  | memory | 内存信息 | 字典，格式参见[服务器内存状态](#%E6%9C%8D%E5%8A%A1%E5%99%A8%E5%86%85%E5%AD%98%E7%8A%B6%E6%80%81) |
+  | db_space | 图数据库占用空间 | 字典，格式参见[图数据库占用空间](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E5%8D%A0%E7%94%A8%E7%A9%BA%E9%97%B4) |
+  | db_config | 图数据库配置信息 | 字典，格式参见[图数据库配置信息](#%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93%E9%85%8D%E7%BD%AE%E4%BF%A1%E6%81%AF) |
+  | up_time | 数据库在线时长（秒） | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "lgraph_version": "1.2.0",
+      "git_branch": "master",
+      "git_commit": "9e2977d",
+      "web_commit": "1e2823d",
+      "cpu_id": "GUN",
+      "cpu_version": "4.8.5",
+      "python_version": "3.2",
+      "node": "/node",
+      "relationship": "/relationship",
+      "cpu": {
+        "self": 25,
+        "server": 35,
+        "unit": "%"
+      },
+      "disk": {
+        "read": 2000,
+        "write": 2000,
+        "unit": "B/s"
+      },
+      "memory": {
+        "self": 25016,
+        "server_avail": 46865636,
+        "server_total": 65860552,
+        "unit": "KB"
+      },
+      "db_space": {
+        "space": 57344,
+        "unit": "B"
+      },
+      "db_config": {
+        "db_async": false,
+        "disable_auth": false,
+        "enable_ha": false,
+        ...
+      },
+      "up_time": 3235
+    }
+```
+
+#### 6.3.3.服务器 CPU 状态
+
+- **URI**: `/info/cpu`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序 CPU 使用率 | 整型 |
+  | server | 服务器 CPU 使用率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/cpu
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25,
+      "server": 35,
+      "unit": "%"
+    }
+```
+
+#### 6.3.4.服务器硬盘状态
+
+- **URI**: `/info/disk`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | read | 服务器硬盘读速率 | 整型 |
+  | write | 服务器硬盘写速率 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/disk
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "read": 2000,
+      "write": 2000,
+      "unit": "B/s"
+    }
+```
+
+#### 6.3.5.服务器内存状态
+
+- **URI**: `/info/memory`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | self | 图数据库应用程序内存使用量 | 整型 |
+  | server_avail | 服务器可用内存 | 整型 |
+  | server_total | 服务器总内存 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/memory
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "self": 25016,
+      "server_avail": 46865636,
+      "server_total": 65860552,
+      "unit": "KB"
+    }
+```
+
+#### 6.3.6.图数据库占用空间
+
+- **URI**: `/info/db_space`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | space | 图数据库占用空间 | 整型 |
+  | disk_avail | 图数据库可用空间 | 整型 |
+  | disk_total | 服务器硬盘总空间 | 整型 |
+  | unit | 单位 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_space
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "disk_avail"::360074579968,
+      "disk_total"::984373800960,
+      "space": 57344,
+      "unit": "B"
+    }
+```
+
+#### 6.3.7.图数据库配置信息
+
+- **URI**: `/info/db_config`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | db_async | 图数据库工作模式（同步或异步） | 布尔值 |
+  | disable_auth | 是否禁用身份验证 | 布尔值 |
+  | enable_ha | 是否启用高可用模式 | 布尔值 |
+  | enable_rpc | 是否启用 RPC 服务器 | 布尔值 |
+  | bind_host | REST 服务器的主机 | 字符串 |
+  | enable_audit_log | 是否启用日志审计 | 布尔值 |
+  | port | REST 服务器的端口 | 整型 |
+  | rpc_port | RPC 服务器的端口 | 整型 |
+  | optimistic_txn | 是否默认使用乐观事务锁 | 布尔值 |
+  | thread_limit | 图数据库应用程序的可用线程数 | 整型 |
+  | enable_ssl | 是否使用 SSL 进行身份验证 | 布尔值 |
+  | verbose | 输出的详细程度 | 整型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/db_config
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "db_async":false,
+      "disable_auth":false,
+      "enable_ha":false,
+      "enable_rpc":false,
+      "bind_host":"127.0.0.1",
+      "enable_audit_log":false,
+      "port":7070,
+      "optimistic_txn":false,
+      "rpc_port":9091,
+      "thread_limit":0,
+      "enable_ssl":false,
+      "verbose":2
+    }
+```
+
+#### 6.3.8.高可用服务器列表
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/peers`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回一个服务器信息列表，其中每个服务器信息格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+  | state | 服务器状态 | 字符串 |
+
+其中服务器状态可为 `MASTER`,`SLAVE`,`OFFLINE`。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/peers
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      [
+          {
+              "rest_address":"192.168.1.22:17071",
+              "rpc_address":"192.168.1.22:19091",
+              "state":"MASTER"
+          },
+          {
+              "rest_address":"192.168.1.22:17072",
+              "rpc_address":"192.168.1.22:19092",
+              "state":"SLAVE"
+          }
+      ]
+    }
+```
+
+#### 6.3.9.当前 Leader 信息
+
+_(仅在高可用模式下有效)_
+
+- **URI**: `/info/leader`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前 leader 服务器信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | rpc_address | 服务器 RPC 地址 | 字符串 |
+  | rest_address | 服务器 REST 地址 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/leader
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+      "rest_address":"192.168.1.22:17071",
+      "rpc_address":"192.168.1.22:19091"
+    }
+```
+
+#### 6.3.10.服务器统计信息
+
+- **URI**: `/info/statistics`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回当前服务器统计信息，格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | requests/second | 每秒处理的请求数量 | 浮点型 |
+  | writes/second | 每秒处理的写请求数量 | 浮点型 |
+  | running_tasks | 正在执行的请求数量 | 整型 |
+  | failure_rate | 请求失败率 | 浮点型 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/statistics
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "failure_rate": 2.3,
+        "requests/second": 122.3,
+        "running_tasks": 10,
+        "writes/second": 12.4
+    }
+```
+
+#### 6.3.11.审计日志信息
+
+- **URI**: `/info/log/?begin_time={begin_time}&end_time={end_time}&user={user}&num_log={num_log}&descending_order={descending_order}`
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | begin_time | 查询日志的起始时间(必填，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | end_time | 查询日志的结束时间(默认为当前时间，格式为 YYYY-mm-dd HH:MM:SS) | 时间戳 |
+  | user | 查询日志的操作者(管理员可查询所有用户的日志，普通用户只能查询本人日志) | 字符串 |
+  | num_log | 查询日志的数量(默认为 100) | 整型 |
+  | descending_order | 查询结果是否降序输出(默认为 true) | 布尔值 |
+
+- **METHOD**: GET
+- **RESPONSE**: 如果成功，则返回 200 代码，并返回审计日志列表，其中每个元素是一条操作日志，其格式为：
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | index | 该操作的索引值 | 整型 |
+  | begin_time | 该操作的开始时间 | 字符串 |
+  | end_time | 该操作的结束时间 | 字符串 |
+  | user | 该操作的发起者 | 字符串 |
+  | graph | 该操作的图 | 字符串 |
+  | type | 该操作的类型 | 字符串 |
+  | read_write | 该操作为读操作或者写操作 | 字符串 |
+  | success | 该操作是否成功 | 布尔值 |
+  | content | 该操作的简要内容 | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/info/log/?begin_time=2020-02-17%2015:00:00&end_time=2020-02-20%2012:00:00&user=admin&num_log=100&descending_order=false
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "post /login    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "",
+                "index": 1,
+                "read_write": "read",
+                "success": true,
+                "type": "Security",
+                "user":"admin"
+            },
+            {
+                "begin_time": "2020-02-17 15:27:15",
+                "content": "Load plugin : `echo`    Successful",
+                "end_time": "2020-02-17 15:27:15",
+                "graph": "default",
+                "index": 2,
+                "read_write": "write",
+                "success": true,
+                "type": "Plugin",
+                "user": "admin"
+            },
+            ...
+        ]
+    }
+```
+
+### 6.4.任务管理
+
+TuGraph 提供长任务的跟踪和中止功能。用户可以通过 REST API 来查询当前正在运行的在 Cypher 和存储过程查询，并选择中止正在执行的查询。
+
+任务管理对应的 URI 格式为
+
+```
+    http://{host}:{port}/task/{thread_id}/{task_id}
+```
+
+#### 6.4.1.查询正在执行的任务
+
+- **URI**: `/task`
+- **METHOD**: GET
+- **RESPONSE**:
+
+返回的 JSON 为一个数组，其中每一个元素格式如下：
+
+| 域名         | 说明                         | 类型   |
+| ------------ | ---------------------------- | ------ |
+| description  | 任务描述                     | 字符串 |
+| time_elapsed | 任务已经执行的时间，单位为秒 | 浮点   |
+| task_id      | 任务 ID                      | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/task
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "description" : "[CPP_PLUGIN] scan_graph",
+                "time_elapsed" : 13.987,
+                "task_id" : "3_10"
+            },
+            {
+                "description" : "[CYPHER] MATCH(n) return n",
+                "time_elapsed" : 30.887,
+                "task_id" : "2_6"
+            }
+        ]
+    }
+```
+
+#### 6.4.2.中止任务
+
+- **URI**: `/task/{task_id}`
+  其中 `{task_id}` 是 `GET /task` 返回结果中的 `task_id`。
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/task/3_10
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.5.子图管理
+
+TuGraph 支持多子图，子图之间完全独立，不同的子图可以对不同用户开放不同权限。管理员可以添加和删除子图。
+
+#### 6.5.1.创建新子图
+
+- **URI**: `/db`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | 子图名 | 字符串 |
+  | config | 配置 | 字典，格式为 { {列名 1}:{列值 1},... } |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"graph1",
+        "config" : {
+            "max_size_GB":2048,
+            "description": "description of graph1"
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.2.删除子图
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.5.3.列出所有子图
+
+- **URI**: `/db`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "graph1": {
+            "max_size_GB":1024,
+            "description":"description of graph1"
+        }
+    }
+```
+
+#### 6.5.4.获取子图信息
+
+- **URI**: `/db/{graph_name}`
+- **METHOD**: GET
+- **RESPONSE**: 子图列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "max_size_GB":1024,
+        "description":"description of graph1"
+    }
+```
+
+### 6.6.元数据管理
+
+TuGraph 是一个具备多图能力的强模式属性图数据库。在每一张子图中，每种点和边都需要有预定义的数据格式。数据格式由 Label 决定，每种 Label 都有自己的数据格式。用户可以使用 REST API 添加，删除和查询 Label 及其对应的数据格式。
+
+Label 操作对应的 URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/label/{type}/{label_name}
+```
+
+其中{type}可以是 node 或者 relationship。
+
+#### 6.6.1.创建Label
+
+创建 Label 的过程同时也是定义其数据类型的过程。只有创建了 Label 才能在图中插入相应类型的点或者边。
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | name | Label 名 | 字符串 |
+  | fields | 数据列定义 | 列表 |
+  | is_vertex | 是否是点 Label | 布尔值 |
+  | primary | 点的主键属性 | 字符串 |
+  | edge_constraints | 边的约束 | 列表 |
+
+`primary` 在 `is_vertex` 为 `true` 的时候设置，这个字段只有点才有, 创建点的时候必须设置。
+
+`edge_constraints` 在 `is_vertex` 为 `false` 的时候设置，这个字段只有边有。这个字段限制了该边的起点和终点只能是哪些点的组合，比如：`[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]`，限制了该边只能是从 `vertex_label1` 到 `vertex_label2` 和 从 `vertex_label3` 到 `vertex_label4`。如果不想有任何限制，不设置该字段即可。
+
+其中`fields`为一个数组，其中每个元素定义数据的一列，内容如下：
+
+| 域名     | 说明                                     | 类型                                                                                                |
+| -------- | ---------------------------------------- | --------------------------------------------------------------------------------------------------- |
+| name     | 列名                                     | 字符串                                                                                              |
+| type     | 列数据类型                               | 字符串，有以下类型： int8, int16, int32, int64, float, double, string, date, datetime, binary, bool |
+| optional | 数据是否可以为空（可选，缺省值为 false） | 布尔值                                                                                              |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "name":"Actor",
+        "fields": [
+                {"name":"uid", "type":"int64", "optional":false},
+                {"name":"name", "type":"string", "optional":true}
+        ],
+        "is_vertex":true,
+        "primary" : "uid"
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.6.2.列出所有 Label
+
+- **URI**: `/db/{graph_name}/label`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | edge | 边 Label 列表 | 列表 |
+  | vertex | 点 Label 列表 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "edge": [
+            "HAS_CHILD",
+            "MARRIED",
+            "BORN_IN",
+            "DIRECTED",
+            "WROTE_MUSIC_FOR",
+            "ACTED_IN"
+        ],
+        "vertex": [
+            "Person",
+            "City",
+            "Film"
+        ]
+    }
+```
+
+#### 6.6.3.获取 Label 的数据格式定义
+
+- **URI**: `/db/{graph_name}/label/{[node|relationship]}/{label_name}`
+- **METHOD**: GET
+- **RESPONSE**: 数据列定义表，类型是一个词典，key 为列名，value 为列定义，列定义见如下：
+-
+
+| 域名     | 说明             | 类型   |
+| -------- | ---------------- | ------ |
+| optional | 该列值是否可为空 | 布尔值 |
+| type     | 列值类型         | 字符串 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/label/node/person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "age":{
+            "optional":false,
+            "type":"int16"
+        },
+        "id":{
+            "optional":false,
+            "type":"int8"
+        },
+        "name":{
+            "optional":false,
+            "type":"string"
+        }
+    }
+```
+
+#### 6.6.4.Schema 导入
+
+- **URI**: `/db/{graph_name}/schema/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+- **RESPONSE**:
+
+Schema 导入会根据 description 比较新的 Schema 和数据库中原有的 Schema 是否兼容，检查的粒度为 Label。如果不一致则出错，如果一致则添加原先 Schema 中不存在的 Label，返回 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/schema/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"schema\\":[{\\"label\\":\\"actor\\",\\"primary\\":\\"aid\\",\\"properties\\":[{\\"name\\":\\"aid\\",\\"type\\":\\"STRING\\"}],\\"type\\":\\"VERTEX\\"}]}"
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串:
+
+```json
+{
+  "schema": [
+    {
+      "label": "actor",
+      "type": "VERTEX",
+      "properties": [{ "name": "aid", "type": "STRING" }],
+      "primary": "aid"
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": ""
+    }
+```
+
+### 6.7.点操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/node/{vid}
+```
+
+Nodes 提供节点（Vertex）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。
+
+#### 6.7.1.列出点数量和label数量
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | num_label | 点 label 数量 | 整数 |
+  | num_vertex | 点数量 | 整数 |
+
+_注意 num_vertex 返回的并不是准确的点数量，只是一个估计值。_
+
+#### 6.7.2.创建一个点
+
+向数据库中插入一个点。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 点属性 | 字典，其中 key 是列名，value 是相应值。value 必须是与列类型相应的类型，如列为 int32，则 value 只能是整数。 |
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新点 vid。该 ID 可用于后续的点操作中。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "property" : {
+            "name" : "Passerby A",
+            "birthyear" : 1989
+        }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        21
+    }
+```
+
+#### 6.7.3.批量创建点
+
+TuGraph 允许一次性插入多个点，以减少网络开销。
+
+- **URI**: `/db/{graph_name}/node`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | fields | 点属性 | 列表 |
+  | values | 点数据 | 列表 |
+
+其中 fields 是一个字符串列表，列出一系列列名；values 是一个列表，其中每个元素是一个列表，列表中每个元素是列数据。
+
+- **RESPONSE**: 如果成功，返回代码 200。并在 JSON 内容中返回新增加的点的 vid 列表，该列表中每一个 vid 按顺序对应请求中的每一个点。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+        "label" : "Person",
+        "fields" : ["name", "birthyear"],
+        "values" : [["alex", 2000],
+                    ["bob", 1999]]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            22,
+            23
+        ]
+    }
+```
+
+#### 6.7.4.获取点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | Label 名 | 字符串 |
+  | property | 属性 | 字典，格式为 { {列名 1}:{列值 1},...} |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+            "birthyear": 1963,
+            "name": "Natasha Richardson"
+        },
+        "label": "Person"
+    }
+```
+
+#### 6.7.5.删除点
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 被删掉的点的入边数量 | 整数值 |
+  | out | 被删掉的点的出边数量 | 整数值 |
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/{graph_name}/node/4
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "in": 0,
+        "out": 0
+    }
+```
+
+#### 6.7.6.获取点所有属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property`
+- **METHOD**: GET
+- **RESPONSE**: Node 所有属性（字典）
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "birthyear": 1963,
+        "name": "Natasha Richardson"
+    }
+```
+
+#### 6.7.7.获取点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: Node 某一属性
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/5/property/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Natasha Richardson"
+    }
+```
+
+#### 6.7.8.更新点属性
+
+- **URI**: `/db/{graph_name}/node/{vertex_id}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 点属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/{graph_name}/node/5
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "birthyear" : 1964,
+        "mobile" : "********"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.8.边操作
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/relationship/{euid}
+```
+
+与 Nodes 功能类似，Relationships 提供边（edge）的 CRUD 操作，接受 GET/POST/PUT/DELETE 请求。每一条边都可以由一个唯一 ID（euid）来标识。这个 ID 可以从在插入边时获得，或者在 [列出所有边](#%E5%88%97%E5%87%BA%E6%89%80%E6%9C%89%E8%BE%B9) 操作中得到。
+
+#### 6.8.1.创建一条边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | destination | 目的点 ID | 整数值 |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid（字符串）。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/node/{src}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "destination" : 14,
+      "label" : "BORN_IN",
+      "property" : {}
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "1_14_1_0"
+    }
+```
+
+#### 6.8.2.批量创建边
+
+- **URI**: `/db/{graph_name}/relationship`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | fields | 数据列名 | 列表 |
+  | edge | 边数据 | 列表 |
+
+其中 edge 是一个数据列表，其中每个元素都是一条边，其定义如下：
+
+| 域名        | 说明     | 类型                                                   |
+| ----------- | -------- | ------------------------------------------------------ |
+| source      | 起点 id  | 整数                                                   |
+| destination | 终点 id  | 整数                                                   |
+| values      | 数据列表 | 列表，每列对应 fields 中的一个列，类型是该列对应的类型 |
+
+- **RESPONSE**: 如果成功，返回代码 200，同时返回新建立的边的 euid 列表。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/{graph_name}/relationship
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label" : "knows",
+      "fields" : ["from_year", "weight"],
+      "edge" : [
+          {"source":0, "destination":1, "values":[2011, 0.8]},
+          {"source":1, "destination":2, "values":[2008, 0.9]}
+      ]
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_1_0_0",
+            "1_2_0_0"
+        ]
+    }
+```
+
+#### 6.8.3.列出所有出边（outgoing relationships）
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/out`
+- **METHOD**: GET
+- **RESPONSE**: 点 src 的所有出边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/out
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "4_5_0_0",
+            "4_7_1_2"
+        ]
+    }
+```
+
+#### 6.8.4.列出所有入边（incoming relationships）
+
+- **URI**: `/db/{graph_name}/node/{dst}/relationship/in`
+- **METHOD**: GET
+- **RESPONSE**: 点 dst 的所有入边 euid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationship/in
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.5.列出所有边
+
+- **URI**: `/db/{graph_name}/node/{src}/relationship/all`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | in | 入边 | 列表 |
+  | out | 出边 | 列表 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/{graph_name}/node/4/relationships/all
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "out": [
+            "4_5_0_0",
+            "4_7_1_2"
+        ],
+        "in": [
+            "0_4_0_0",
+            "3_4_3_1"
+        ]
+    }
+```
+
+#### 6.8.6.获取边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: GET
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | label | 边 Label | 字符串 |
+  | property | 边属性 | 字典 |
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/0_4_0_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "property": {
+        },
+        "label": "MARRIED"
+    }
+```
+
+#### 6.8.7.删除边
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/relationship/14_0_1_0
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.8.8.获取边的所有属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property`
+- **METHOD**: GET
+- **RESPONSE**: 边属性字典
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/14_0_2_0/property
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        {
+            "weight": 0.8,
+            "begin": 20180922
+        }
+    }
+```
+
+#### 6.8.9.获取边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}/property/{field}`
+- **METHOD**: GET
+- **RESPONSE**: 如果成功,返回代码 200,同时返回边的属性。如果失败,返回代码 400,同时返回 "Illegal field."。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/relationship/17_0_2_2/property/charactername
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        "Henri Ducard"
+    }
+```
+
+#### 6.8.10.更新边的属性
+
+- **URI**: `/db/{graph_name}/relationship/{euid}`
+- **METHOD**: PUT
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | property | 边属性 | 字典 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • PUT http://localhost:7070/db/graph1/relationship/17_0_2_2
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "property" : {
+        "charactername" : "Henri Ducard/passer a"
+      }
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+### 6.9.索引
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/index/{label}/{field}
+```
+
+提供索引操作，接受 GET/POST 请求。
+
+#### 6.9.1.创建索引
+
+该操作会启动一个创建索引的后台任务，用户可以通过列出该 Label 相关的所有索引来检查新建索引的状态。
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: POST
+- **REQUEST**:
+
+| 域名    | 说明     | 类型                                  |
+|-------|--------|-------------------------------------|
+| label | Label 名 | 字符串                                 |
+| field | 域名     | 字符串                                 |
+| type  | 索引类型   | int类型，0表示非唯一索引，1表示全局唯一索引，2表示两点间唯一索引 |
+
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json
+    Input:
+    {
+      "label": "Person",
+      "field": "birthyear",
+      "is_unique" : false
+    }
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.2.列出所有索引
+
+- **URI**: `/db/{graph_name}/index`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "field": "name",
+                "label": "City",
+                "is_unique": false
+            },
+            {
+                "field": "title",
+                "label": "Film",
+                "is_unique": false
+            },
+            {
+                "field": "name",
+                "label": "Person",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.3.列出所有与某个 Label 相关的索引
+
+- **URI**: `/db/{graph_name}/index/{label}`
+- **METHOD**: GET
+- **RESPONSE**: 索引列表，其中每一个元素是一个索引描述，格式与[创建索引](#indexspec)时使用格式相同。
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    • Content-Type: application/json; charset=UTF-8
+    Output:
+    {
+        [
+            {
+                "label": "Person",
+                "field": "name",
+                "is_unique": true
+            },
+            {
+                "label": "Person",
+                "field": "age",
+                "is_unique": false
+            }
+        ]
+    }
+```
+
+#### 6.9.4.删除索引
+
+- **URI**: `/db/{graph_name}/index/{label}/{field}`
+- **METHOD**: DELETE
+- **RESPONSE**: 如果成功，返回代码 200。
+
+**Example request.**
+
+```
+    • DELETE http://localhost:7070/db/graph1/index/Person/name
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+```
+
+#### 6.9.5.根据索引获取点
+
+- **URI**: `/db/{graph_name}/index/{label}/?field={field}&value={value}`
+- **METHOD**: GET
+- **RESPONSE**: 点 vid 列表
+
+**Example request.**
+
+```
+    • GET http://localhost:7070/db/graph1/index/Person/?field=birthyear&value=1986
+    • Accept: application/json; charset=UTF-8
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        [
+            1,
+            8
+        ]
+    }
+```
+
+
+### 6.10.在线增量导入
+
+#### 6.10.1.指定文件内容导入
+
+- **URI**: `/db/{graph_name}/import/text`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | description | 文件内容描述 | 字符串 |
+  | data | 要导入的文件内容（建议最大在 16MB 左右，最长不超过 17MB） | 字符串 / 数组 / 对象 |
+  | continue_on_error | 出错后是否继续导入（可选，默认为`false`
+  ） | 布尔值 |
+  | delimiter | 分隔符（可选，默认为`“,”`
+  ） | 字符串 |
+
+description 的具体描述方法见《TuGraph 操作手册》中数据导入配置文件的相关内容。
+
+分隔符可以是单字符，也可以是字符串，但不能包含`\r`或者`\n`。
+
+data 可以是如下形式之一：
+
+- 字符串如 `"1,2\n3,4\n"`
+- ASCII 码组成的数组如 `[49,44,50,10,51,44,52,10]`
+- 形如上述数组的字典如 `{"0":49,"1":44,"2":50,"3":10,"4":51,"5":44,"6":52,"7":10}`
+
+- **RESPONSE**:
+
+系统**不会**自动执行新建 label、添加索引等操作。在此操作之前需要保证涉及的 label 已经存在并具有适当的索引。
+
+如果成功导入完毕，返回代码 200，并在 `log` 字段返回一些日志信息（可能为空）；否则，保证所有的数据均未被导入，并在 `error_message` 字段返回错误信息。
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/import/text
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "description": "{\\"files\\":[{\\"columns\\":[\\"SRC_ID\\",\\"role\\",\\"DST_ID\\"],\\"format\\":\\"CSV\\",\\"label\\":\\"role\\",\\"SRC_ID\\":\\"actor\\",\\"DST_ID\\":\\"movie\\"}]}"}",
+      "data": "1,Role1,2\n3,Role2,4\n",
+      "continue_on_error": true,
+      "delimiter": ","
+    }
+```
+
+上述 description 的值是如下 json 序列化后的字符串
+
+```json
+{
+  "files": [
+    {
+      "format": "CSV",
+      "label": "role",
+      "SRC_ID": "actor",
+      "DST_ID": "movie",
+      "columns": ["SRC_ID", "role", "DST_ID"]
+    }
+  ]
+}
+```
+
+**Example response.**
+
+```
+    • 200: OK
+    Output:
+    {
+        "log": "Missing src uid 1\n"
+    }
+```
+
+由于请求中指定了在出错时继续，该返回信息说明 SRC_ID 为 1 的边没有被导入，而其他信息导入成功。
+
+### 6.11.其他
+
+URI 格式为
+
+```
+    http://{host}:{port}/db/{graph_name}/misc
+```
+
+#### 6.11.1.提取子图
+
+给出点 id 集合，返回包含该集合的最小子图。
+
+- **URI**: `/db/{graph_name}/misc/sub_graph`
+- **METHOD**: POST
+- **REQUEST**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | vertex_ids | 点 id 集合 | 列表 |
+
+- **RESPONSE**:
+  | 域名 | 说明 | 类型 |
+  | --- | --- | --- |
+  | nodes | 点数据 | 列表，每元素包含 vid, label, 以及属性 |
+  | relationships | 边数据 | 列表，每元素包含 src, dst, euid, label, 以及属性 |
+
+**Example request.**
+
+```
+    • POST http://localhost:7070/db/graph1/misc/sub_graph
+    • Accept: application/json; charset=UTF-8
+    • Content-Type: application/json; charset=UTF-8
+    Input:
+    {
+      "vertex_ids": [2, 5, 14, 20]
+    }
+```
+
+**Example response.**
+
+```
+• 200: OK
+    Output:
+    {
+        "nodes": [
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "vid": 2
+            },
+            {
+                "label": "Person",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "vid": 5
+            },
+            {
+                "label": "City",
+                "properties": {
+                    "name": "London"
+                },
+                "vid": 14
+            },
+            {
+                "label": "Film",
+                "properties": {
+                    "title": "Camelot"
+                },
+                "vid": 20
+            }
+        ],
+        "relationships": [
+            {
+                "destination": 5,
+                "label": "HAS_CHILD",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 20,
+                "label": "ACTED_IN",
+                "properties": {
+                    "birthyear": 1937,
+                    "charactername": "Guenevere",
+                    "name": "Vanessa Redgrave"
+                },
+                "source": 2
+            },
+            {
+                "destination": 14,
+                "label": "BORN_IN",
+                "properties": {
+                    "birthyear": 1963,
+                    "name": "Natasha Richardson"
+                },
+                "source": 5
+            }
+        ]
+    }
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/index.rst
new file mode 100644
index 0000000000..f35f8d98d8
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/7.client-tools/index.rst
@@ -0,0 +1,9 @@
+客户端工具
+==========
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/1.cypher.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/1.cypher.md
new file mode 100644
index 0000000000..b175605f84
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/1.cypher.md
@@ -0,0 +1,2351 @@
+# Cypher API
+
+> 此文档主要介绍了TuGraph-Cypher的详细使用说明
+
+## 1.Operators
+
+### 1.1.Summary
+
+Operators支持进度一览：
+
+| 类别                                 | 支持                                                                                                        | 待支持                             |
+| ------------------------------------ | ----------------------------------------------------------------------------------------------------------- | ---------------------------------- |
+| General operators                    | `DISTINCT`, `.` for property access                                                                     | `[]` for dynamic property access |
+| Mathematical operators               | `+`, `-`, `*`, `/`, `%`, `^`                                                                    |                                    |
+| Comparison operators                 | `=`, `<>`, `<`, `>`, `<=`, `>=`, `IS NULL`, `IS NOT NULL`                                   |                                    |
+| String-specific comparison operators | `STARTS WITH`, `ENDS WITH`, `CONTAINS`, `REGEXP`                                                    |                                    |
+| Boolean operators                    | `AND`, `OR`, `XOR`, `NOT`                                                                           |                                    |
+| String operators                     | `+` for concatenation                                                                                     |                                    |
+| List operators                       | `+` for concatenation, `IN` to check existence of an element in a list, `[]` for accessing element(s) |                                    |
+
+### 1.2.General operators
+
+- ✓ Using the DISTINCT operator
+
+```
+MATCH (p:person) RETURN DISTINCT p.born
+```
+
+- ❏ Accessing properties of a nested literal map using the `.` operator
+
+```
+WITH {person: {name: 'Anne', age: 25}} AS p
+RETURN p.person.name
+```
+
+- ❏ Filtering on a dynamically-computed property key using the `[]` operator
+
+```
+CREATE (a:Restaurant {name: 'Hungry Jo', rating_hygiene: 10, rating_food: 7}),
+       (b:Restaurant {name: 'Buttercup Tea Rooms', rating_hygiene: 5, rating_food:6}),
+       (c1:Category {name: 'hygiene'}), (c2:Category {name: 'food'})
+```
+
+```
+MATCH (restaurant:Restaurant), (category:Category)
+WHERE restaurant["rating_" + category.name] > 6
+RETURN DISTINCT restaurant.name
+```
+
+### 1.3.Mathematical operators
+
+- ✓ Using the exponentiation operator  `^`
+
+```
+WITH 2 AS number, 3 AS exponent
+RETURN number ^ exponent AS result
+```
+
+- ✓ Using the unary minus operator `-`
+
+```
+WITH -3 AS a, 4 AS b
+RETURN b - a AS result
+```
+
+### 1.4.Comparison operators
+
+- ✓ Comparing two numbers
+
+```
+WITH 4 AS one, 3 AS two
+RETURN one > two AS result
+```
+ 
+### 1.5.String-specific comparison operators
+
+- ✓ Using STARTS WITH to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate STARTS WITH 'Jo'
+RETURN candidate
+```
+
+- ✓ Using REGEXP to filter names
+
+```
+WITH ['John', 'Mark', 'Jonathan', 'Bill'] AS somenames
+UNWIND somenames AS names
+WITH names AS candidate
+WHERE candidate REGEXP 'Jo.*n'
+RETURN candidate
+```
+
+### 1.6.Boolean operators
+
+- ✓ Using boolean operators to filter numbers
+
+```
+WITH [2, 4, 7, 9, 12] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number = 4 OR (number > 6 AND number < 10)
+RETURN number
+```
+
+### 1.7.String operators
+
+String operators comprise:
+
+- ✓ concatenating strings: `+`
+
+### 1.8.List operators
+
+- ✓ Concatenating two lists using +
+
+```
+RETURN [1,2,3,4,5]+[6,7] AS myList
+```
+
+- ✓ Using IN to check if a number is in a list
+
+```
+WITH [2, 3, 4, 5] AS numberlist
+UNWIND numberlist AS number
+WITH number
+WHERE number IN [2, 3, 8]
+RETURN number
+```
+
+- ✓ Accessing elements in a list using the [] operator
+
+```
+WITH ['Anne', 'John', 'Bill', 'Diane', 'Eve'] AS names
+RETURN names[1..3] AS result
+```
+
+## 2.Clauses
+
+### 2.1.Summary
+
+Clauses支持进度一览：
+
+| 类别                    | 语法                                  | 备注   |
+| ----------------------- | ------------------------------------- | ------ |
+| Reading clauses         | MATCH                                 | 支持   |
+|                         | OPTIONAL MATCH                        | 支持   |
+|                         | MANDATORY MATCH                       | 待支持 |
+| Projecting clauses      | RETURN … [AS]                        | 支持   |
+|                         | WITH … [AS]                          | 支持   |
+|                         | UNWIND … [AS]                        | 支持   |
+| Reading sub-clauses     | WHERE                                 | 支持   |
+|                         | ORDER BY [ASC[ENDING] / DESC[ENDING]] | 支持   |
+|                         | SKIP                                  | 支持   |
+|                         | LIMIT                                 | 支持   |
+| Writing clauses         | CREATE                                | 支持   |
+|                         | DELETE                                | 支持   |
+|                         | DETACH DELETE                         | 支持   |
+|                         | SET                                   | 支持   |
+|                         | REMOVE                                | 支持   |
+| Reading/Writing clauses | MERGE                                 | 支持   |
+|                         | CALL […YIELD]                        | 支持   |
+| Set operations          | UNION                                 | 待支持 |
+|                         | UNION ALL                             | 支持   |
+
+### 2.2.MATCH
+
+- Basic node finding
+
+  - ✓ Get all nodes
+
+  ```
+  MATCH (n)
+  RETURN n
+  ```
+
+  - ✓ Get all nodes with a label
+
+  ```
+  MATCH (movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Related nodes
+
+  ```
+  MATCH (person {name: 'Laurence Fishburne'})-[]-(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Match with labels
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]-(movie:movie)
+  RETURN movie.title
+  ```
+
+- Relationship basics
+
+  - ✓ Outgoing relationships
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[]->(movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Directed relationships and variable
+
+  ```
+  MATCH (:person {name: 'Laurence Fishburne'})-[r]->(movie)
+  RETURN type(r)
+  ```
+
+  - ✓ Match on relationship type
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})<-[:acted_in]-(actor)
+  RETURN actor.name
+  ```
+
+  - ✓ Match on multiple relationship types
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[:acted_in|:directed]-(person)
+  RETURN person.name
+  ```
+
+  - ✓ Match on relationship type and use a variable
+
+  ```
+  MATCH (matrix {title: 'The Matrix'})<-[r:acted_in]-(actor)
+  RETURN r.role
+  ```
+- Relationships in depth
+
+  - ❏ Relationship types with uncommon characters
+
+  ```
+  MATCH (n {name: 'Rob Reiner'})-[r:`TYPE WITH SPACE`]->()
+  RETURN type(r)
+  ```
+
+  - ✓ Multiple relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in]->(movie)<-[:directed]-(director)
+  RETURN movie.title, director.name
+  ```
+
+  - ✓ Variable-length relationships
+
+  ```
+  MATCH (laurence {name: 'Laurence Fishburne'})-[:acted_in*1..3]-(movie:movie)
+  RETURN movie.title
+  ```
+
+  - ✓ Relationship variable in variable-length relationships
+
+  ```
+  MATCH p = (laurence {name: 'Laurence Fishburne'})-[:acted_in*2]-(co_actor)
+  RETURN p
+  ```
+
+  - ❏ Match with properties on a variable-length path
+
+  ```
+  MATCH p = (charlie:person)-[* {blocked:false}]-(martin:person)
+  WHERE charlie.name = 'Charlie Sheen' AND martin.name = 'Martin Sheen'
+  RETURN p
+  ```
+
+  - ✓ Zero-length paths
+
+  ```
+  MATCH (matrix:movie {title: 'The Matrix'})-[*0..1]-(x)
+  RETURN x
+  ```
+
+  - ✓ Named paths
+
+  ```
+  MATCH p = (michael {name: 'Michael Douglas'})-[]->() RETURN p
+  ```
+
+  - ✓ Matching on a bound relationship
+
+  ```
+  MATCH (a)-[r]->(b)
+  WHERE euid(r)="0_3937_0_0_0"
+  RETURN a,b
+  ```
+
+- Shortest path
+
+  - ✓ Single shortest path
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'})
+  CALL algo.shortestPath(martin, laurence) YIELD nodeCount,totalCost,path RETURN nodeCount,totalCost,path
+  ```
+
+  - ✓ All shortest paths
+
+  ```
+  MATCH (martin:person {name: 'Carrie-Anne Moss'}), (laurence:person {name: 'Laurence Fishburne'}) WITH martin, laurence
+  CALL algo.allShortestPaths(martin, laurence) YIELD nodeIds,relationshipIds,cost RETURN nodeIds,relationshipIds,cost
+  ```
+- Get node or relationship by id
+
+  - ✓ Node by id
+
+  ```
+  MATCH (n)
+  WHERE id(n)= 0
+  RETURN n
+  ```
+
+  - ✓ Relationship by id
+
+  ```
+  MATCH ()-[r]->()
+  WHERE euid(r) = "0_3937_0_0_0"
+  RETURN r
+  ```
+
+  - ✓ Multiple nodes by id
+
+  ```
+  MATCH (n)
+  WHERE id(n) IN [0, 3, 5]
+  RETURN n
+  ```
+
+### 2.3.RETURN
+
+- ✓ Return nodes
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n
+```
+
+- ✓ Return relationships
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'})-[r:acted_in]->(c)
+RETURN r
+```
+
+- ✓ Return property
+
+```
+MATCH (n {name: 'Carrie-Anne Moss'}) RETURN n.born
+```
+
+- ❏ Return all elements
+
+```
+MATCH p = (a {name: 'A'})-[r]->(b)
+RETURN *
+```
+
+- ❏ Variable with uncommon characters
+
+```
+MATCH (`This isn\'t a common variable`)
+WHERE `This isn\'t a common variable`.name = 'A'
+RETURN `This isn\'t a common variable`.happy
+```
+
+- ✓ Aliasing a field
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born AS SomethingTotallyDifferent
+```
+
+- ✓ Optional properties
+
+```
+MATCH (n)
+RETURN n.age
+```
+
+- ❏ Other expressions
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})
+RETURN a.born > 1900, "I'm a literal", (a)-[]->()
+```
+
+`(a)-[]->()`  not supported.
+
+- ✓ Unique results
+
+```
+MATCH (a {name: 'Carrie-Anne Moss'})-[]->(b)
+RETURN DISTINCT b
+```
+
+### 2.4.WHERE
+
+- Basic usage
+  - ✓ Boolean operations
+
+  ```
+  MATCH (n)
+  WHERE n.name = 'Laurence Fishburne' XOR (n.born > 1965 AND n.name = 'Carrie-Anne Moss')
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node label
+
+  ```
+  MATCH (n)
+  WHERE n:person
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on node property
+
+  ```
+  MATCH (n)
+  WHERE n.born > 2000
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Filter on relationship property
+
+  ```
+  MATCH (n)-[k:acted_in]->(f)
+  WHERE k.role = "Trinity"
+  RETURN f.title
+  ```
+
+  - ❏ Filter on dynamically-computed property
+
+  ```
+  WITH 'AGE' AS propname
+  MATCH (n)
+  WHERE n[toLower(propname)]< 30
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Property existence checking
+
+  ```
+  MATCH (n)
+  WHERE exists(n.born)
+  RETURN n.name, n.born
+  ```
+
+- String matching
+  - ✓ Match the beginning of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name STARTS WITH 'Pet'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match the ending of a string
+
+  ```
+  MATCH (n)
+  WHERE n.name ENDS WITH 'ter'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ Match anywhere within a string
+
+  ```
+  MATCH (n)
+  WHERE n.name CONTAINS 'ete'
+  RETURN n.name, n.born
+  ```
+
+  - ✓ String matching negation
+
+  ```
+  MATCH (n)
+  WHERE NOT n.name ENDS WITH 's'
+  RETURN n.name, n.born
+  ```
+
+- Using path patterns in `WHERE`
+  - ❏ Filter on patterns
+
+  ```
+  MATCH (tobias {name: 'Tobias'}), (others)
+  WHERE others.name IN ['Andres', 'Peter'] AND (tobias)<-[]-(others)
+  RETURN others.name, others.age
+  ```
+
+  - ❏ Filter on patterns using NOT
+
+  ```
+  MATCH (persons), (peter {name: 'Peter'})
+  WHERE NOT (persons)-[]->(peter)
+  RETURN persons.name, persons.age
+  ```
+
+  - ❏ Filter on patterns with properties
+
+  ```
+  MATCH (n)
+  WHERE (n)-[:KNOWS]-({name: 'Tobias'})
+  RETURN n.name, n.age
+  ```
+
+  - ✓ Filter on relationship type
+
+  ```
+  MATCH (n)-[r]->()
+  WHERE n.name='Laurence Fishburne' AND type(r) STARTS WITH 'ac'
+  RETURN type(r), r.role
+  ```
+
+- Lists
+  - ✓ IN operator
+
+  ```
+  MATCH (a)
+  WHERE a.name IN ['Laurence Fishburne', 'Tobias']
+  RETURN a.name, a.born
+  ```
+
+- Missing properties and values
+  - ✓ Default to false if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white'
+  RETURN n.name, n.age, n.belt
+  ```
+
+  - ✓ Default to true if property is missing
+
+  ```
+  MATCH (n)
+  WHERE n.belt = 'white' OR n.belt IS NULL RETURN n.name, n.age, n.belt
+  ORDER BY n.name
+  ```
+
+  - ✓ Filter on null
+
+  ```
+  MATCH (person)
+  WHERE person.name = 'Peter' AND person.belt IS NULL RETURN person.name, person.age,
+  person.belt
+  ```
+
+- Using ranges
+  - ✓ Simple range
+
+  ```
+  MATCH (a)
+  WHERE a.name >= 'Peter'
+  RETURN a.name, a.born
+  ```
+
+  - ✓ Composite range
+
+  ```
+  MATCH (a)
+  WHERE a.name > 'Andres' AND a.name < 'Tobias'
+  RETURN a.name, a.born
+  ```
+
+### 2.5.SKIP
+
+- ✓ Skip first three records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 3
+```
+
+- ✓ Return middle two records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP 1
+LIMIT 2
+```
+
+- ❏ Using an expression with SKIP to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+ORDER BY n.name
+SKIP toInteger(3*rand())+ 1
+```
+
+### 2.6.LIMIT
+
+- ✓ Return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT 3
+```
+
+- ❏ Using an expression with LIMIT to return a subset of the records
+
+```
+MATCH (n:person)
+RETURN n.name
+LIMIT toInteger(3 * rand())+ 1
+```
+
+### 2.7.CREATE
+
+- Create nodes
+
+> **Note**
+> TuGraph不支持创建空的nodes，不支持多labels。
+
+  - ☒ Create single node
+
+  ```
+  CREATE (n)
+  ```
+
+  - ☒ Create multiple nodes
+
+  ```
+  CREATE (n), (m)
+  ```
+
+  - ☒ Create a node with a label
+
+  ```
+  CREATE (n:person)
+  ```
+
+  - ☒ Create a node with multiple labels
+
+  ```
+  CREATE (n:Person:Swedish)
+  ```
+
+  - ✓ Create node and add labels and properties
+
+  ```
+  CREATE (n:person {id:2001, name: 'Andres'})
+  ```
+
+  - ✓ Return created node
+
+  ```
+  CREATE (n:person {id:2002, name: 'Andres'})
+  RETURN n
+  ```
+
+- Create relationships
+  - ✓ Create a relationship between two nodes
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:write]->(m)
+  ```
+
+  - ✓ Create a relationship and set properties
+
+  ```
+  MATCH (n:person), (m:movie)
+  WHERE n.name = 'Jada Pinkett Smith' AND m.title = 'The Matrix'
+  CREATE (n)-[r:acted_in{role: 'Trinity'}]->(m)
+  ```
+
+  - ❏ Create a full path
+
+  ```
+  CREATE p = (andres:person {id: 2005, name:'Andres'})-[:acted_in {role: 'Trinity'}]->
+  (m:movie {id: 2006})<-[:acted_in {role: 'Trinity'}]-(michael {id: 2006, name:'Michael'})
+  RETURN p
+  ```
+
+- Use parameters with CREATE
+  - ❏ Create node with a parameter for the properties
+
+  ```
+  CREATE (n:Person $props)
+  RETURN n
+  ```
+
+  - ☒ Create multiple nodes with a parameter for their properties
+
+  ```
+  UNWIND $props AS map
+  CREATE (n)
+  SET n = map
+  ```
+  cannot create vertex without label.
+
+### 2.8.CALL[…YIELD]
+
+- ✓ Call a procedure using CALL
+
+```
+CALL db.vertexLabels
+```
+
+- ✓ View the signature for a procedure
+
+```
+CALL dbms.procedures() YIELD name, signature
+RETURN signature
+```
+
+- ❏ Call a procedure using a quoted namespace and name
+
+```
+CALL `db`.`vertexLabels`
+```
+
+- ✓ Call a procedure with literal arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0, 'name')
+```
+
+- ❏ Call a procedure with parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex($indexName,$node,$propKey)
+```
+
+- ❏ Call a procedure with mixed literal and parameter arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', $node, 'name')
+```
+
+- ✓ Call a procedure with literal and default arguments
+
+```
+CALL org.opencypher.procedure.example.addNodeToIndex('users', 0)
+```
+
+- ✓ Call a procedure within a complex query using CALL…YIELD
+
+```
+CALL db.vertexLabels() YIELD label
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure and filter its results
+
+```
+CALL db.vertexLabels() YIELD label
+WHERE label CONTAINS 'User'
+RETURN count(label) AS numLabels
+```
+
+- ❏ Call a procedure within a complex query and rename its outputs
+
+```
+CALL db.propertyKeys() YIELD propertyKey AS prop
+MATCH (n)
+WHERE n[prop] IS NOT NULL RETURN prop, count(n) AS numNodes
+```
+
+### 2.9.UNION
+
+- ✓ Combine two queries and retain duplicates
+
+```
+MATCH (n:person)
+RETURN n.name AS name
+UNION ALL MATCH (n:movie)
+RETURN n.title AS name
+```
+
+- ❏ Combine two queries and remove duplicates
+
+```
+MATCH (n:Actor)
+RETURN n.name AS name
+UNION
+MATCH (n:Movie)
+RETURN n.title AS name
+```
+
+## 3.Functions
+
+### 3.1.Whole List Of Functions
+
+| 种类                   | 功能               | 备注                      |
+| ---------------------- |------------------| ------------------------- |
+| Predicate functions    | exists()         |                           |
+|                        | all()            | 不支持                    |
+|                        | any()            | 不支持                    |
+|                        | single()         | 不支持                    |
+|                        | none()           | 不支持                    |
+| Scalar functions       | id()             |                           |
+|                        | euid()           |                           |
+|                        | properties()     |                           |
+|                        | head()           |                           |
+|                        | last()           |                           |
+|                        | toBoolean()      |                           |
+|                        | toFloat()        |                           |
+|                        | toInteger()      |                           |
+|                        | toString()       |                           |
+|                        | type()           |                           |
+|                        | startnode()      |                           |
+|                        | endnode()        |                           |
+|                        | size()           |                           |
+|                        | length()         |                           |
+|                        | substring()      |                           |
+|                        | concat()         |                           |
+|                        | label()          | OpenCypher扩展方法      |
+| Aggregating functions  | avg()            |                           |
+|                        | collect()        |                           |
+|                        | count()          |                           |
+|                        | max()            |                           |
+|                        | min()            |                           |
+|                        | percentileCont() |                           |
+|                        | percentileDisc() |                           |
+|                        | stDev()          |                           |
+|                        | stDevP()         |                           |
+|                        | variance()       |                           |
+|                        | varianceP()      |                           |
+|                        | sum()            |                           |
+| List functions         | keys()           |                           |
+|                        | labels()         | 返回结果有且只有一个label |
+|                        | nodes()          |                           |
+|                        | range()          |                           |
+|                        | subscript()      | 不支持                    |
+| Mathematical functions | abs()            |                           |
+|                        | ceil()           |                           |
+|                        | floor()          |                           |
+|                        | rand()           |                           |
+|                        | round()          |                           |
+|                        | sign()           |                           |
+| String functions       | /                |                           |
+
+### 3.2.Predicate functions
+
+- exists()
+  judge it whether a vertex or edge has the field  .
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+WHERE exists(n.born)
+RETURN n.name, n.born
+```
+
+**Example output:**
+
+| exists(name) |
+| ------------ |
+| true         |
+
+### 3.3.Scalar functions
+
+- id()
+  get the id of vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN id(a)
+```
+
+**Example output:**
+
+| vid |
+| --- |
+| 1   |
+| 2   |
+| ... |
+
+- properties()
+  get  a map containing all the properties of a node or relationship.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person {name: 'Laurence Fishburne'})
+RETURN n
+```
+
+- head()
+  get the first element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, head(coll)
+```
+
+**Example output:**
+
+| coll                  | head(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "one"         |
+
+- last()
+  get the last element of a list.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+WITH ['one','two','three'] AS coll RETURN coll, last(coll)
+```
+
+**Example output:**
+
+| coll                  | last(coll)    |
+| --------------------- | ------------- |
+| ["one","two","three"] | "three"       |
+
+- toFloat()
+  Converts an integer or string value to a floating point number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toFloat('11.5')
+```
+
+**Example output:**
+
+| float |
+| ----- |
+| 11.5  |
+
+- toInteger()
+  Converts a floating point or string value to an integer value.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toInteger('2.3') AS integer
+```
+
+**Example output:**
+
+| integer |
+| ------- |
+| 2       |
+
+- toString()
+  Converts an integer, float, boolean value to a string.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN toString(2.3)
+```
+
+- type()
+  get the string representation of the relationship type.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)-[r]->()
+WHERE n.name = 'Laurence Fishburne'
+RETURN type(r)
+```
+
+**Example output:**
+
+| type     |
+| -------- |
+| acted_in |
+| acted_in |
+
+### 3.4.Aggregating functions
+
+- avg()
+  Returns the average of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN avg(n.born)
+```
+
+**Example output:**
+
+| avg(n.born)        |
+| ------------------ |
+| 1869.2661654135338 |
+
+- collect()
+  Returns a list containing the values returned by an expression.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN collect(n.born)
+```
+
+**Example output:**
+
+| collect(n.born) |
+| --------------- |
+| [1967,...]      |
+
+- count()
+  Returns the number of values or records.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n {name: 'Laurence Fishburne'})-[]->(x)
+RETURN labels(n), n.born, count(*)
+```
+
+**Example output:**
+
+| labels(n)  | n.born | count(*) |
+| ---------- | ------ | -------- |
+| ["person"] | 1961   | 3        |
+
+- max()
+  Returns the maximum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN max(n.born)
+```
+
+**Example output:**
+
+| max(n.born) |
+| ----------- |
+| 2003        |
+
+- min()
+  Returns the minimum value in a set of values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN min(n.born)
+```
+
+**Example output:**
+
+| min(n.born) |
+| ----------- |
+| 1000        |
+
+- percentileCont()
+  Returns the percentile of a value over a group using linear interpolation.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileCont(n.born, 0.4)
+```
+
+**Example output:**
+
+| percentileCont(n.born, 0.4) |
+| --------------------------- |
+| 1953                        |
+
+- percentileDisc()
+  Returns the nearest value to the given percentile over a group using a rounding method.
+  **Scope:** whole instance.
+  **Output:** the percentile of the given value over a group.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN percentileDisc(n.born, 0.5)
+```
+
+**Example output:**
+
+| percentileDisc(n.age, 0.5) |
+| -------------------------- |
+| 1959                       |
+
+- stDev()
+  Returns the standard deviation for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDev(n.born)
+```
+
+**Example output:**
+
+| stDev(n.born)      |
+| ------------------ |
+| 279.53117993401725 |
+
+- stDevP()
+  Returns the standard deviation for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN stDevP(n.born)
+```
+
+**Example output:**
+
+| stDevP(n.born)     |
+| ------------------ |
+| 279.3209270423399  |
+
+- variance()
+  Returns the variance for the given value over a group for a sample of a population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN variance(n.born)
+```
+
+**Example output:**
+
+| variance(n.age)   |
+| ----------------- |
+| 78137.68055530392 |
+
+- varianceP()
+  Returns the variance for the given value over a group for an entire population.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n)
+RETURN varianceP(n.born)
+```
+
+**Example output:**
+
+| varianceP(n.age)  |
+| ----------------- |
+| 78020.18028379219 |
+
+- sum()
+  Returns the sum of a set of numeric values.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (n:person)
+RETURN sum(n.born)
+```
+
+**Example output:**
+
+| sum(n.born) |
+| ----------- |
+| 1243062     |
+
+### 3.5.List Funtions:
+
+- keys()
+  get the field names of some vertex.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN keys(a) LIMIT 1
+```
+
+**Example output:**
+
+| keys(a)               |
+| --------------------- |
+| ["name","age","eyes"] |
+
+- labels()/label()
+  Returns a list containing the string representations for all the property names of a node, relationship, or map.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a)
+RETURN labels(a) LIMIT 1
+```
+
+**Example output:**
+
+| labels                 |
+| ---------------------- |
+| ["Person"]             |
+
+- nodes()
+
+  Get vertex ids of a path
+
+  **Scope:** whole instance.
+
+  **Example input:**
+
+  ```
+  MATCH p = (from {name: 'Bob'})-[*1..]->(to {name: 'Alice"})
+  RETURN nodes(p)
+  ```
+
+  **Example output:**
+
+  | nodes(p)       |
+  | -------------- |
+  | [0, 1, 10, 12] |
+
+
+### 3.6.Mathematical functions
+
+- abs()
+  get the absolute value of some data.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+MATCH (a:person {name: 'Laurence Fishburne'}),(e:person {name: 'Carrie-Anne Moss'})
+RETURN a.born, e.born, abs(a.born-e.born)
+```
+
+**Example output:**
+
+  | a.born | e.born | abs(a.born - e.born) |
+  |--------|--------|-----------------------|
+  | 1961   | 1967   | 6                     |
+
+- ceil()
+  Returns the smallest floating point number that is greater than or equal to a number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN ceil(0.1)
+```
+
+**Example output:**
+
+| ceil(0.1) |
+| --------- |
+| 1.0       |
+
+- floor()
+  get the largest floating point number that is less than or equal to the given number and equal to a mathematical integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN floor(0.9)
+```
+
+**Example output:**
+
+| floor(0.9) |
+| ---------- |
+| 0.0        |
+
+- round()
+  Returns the value of a number rounded to the nearest integer.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN round(3.141592)
+```
+
+**Example output:**
+
+| round |
+| ----- |
+| 3     |
+
+- rand()
+  Returns returns a random floating point number in the range from 0 (inclusive) to 1 exclusive).
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN rand()
+```
+
+**Example output:**
+
+| rand()             |
+| ------------------ |
+| 0.9797131960534085 |
+
+- sign()
+  Get the signum of the given number: 0 if the number is 0, -1 for any negative number, and 1 for any positive number.
+  **Scope:** whole instance.
+  **Example input:**
+
+```
+RETURN sign(-17), sign(0.1)
+```
+
+**Example output:**
+
+| sign(-17) | sign(0.1) |
+| --------- | --------- |
+| -1        | 1         |
+
+TuGraph 查询语言与 OpenCypher 的不同点如下：
+
+- Label 数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 4.附录1. 语法扩充及不同
+
+TuGraph查询语言与OpenCypher的不同点如下：
+
+- Label数量
+  - TuGraph: Each node/relationship must have one and only one label. So error occurs when there is no label, and the 1st label will be picked as the label if there are more than one label.
+  - OpenCypher: One node/relationship may have 0 to many labels.
+- Schema.
+  - TuGraph: TuGraph has strong schema
+  - OpenCypher: schema-less
+
+## 5.附录2. 内置procedures列表
+### 5.1.procedures样例
+
+* dbms.procedures()
+
+  Lists all available procedures.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`signature`, `name`}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.procedures()
+  ```
+
+  **Example output:**
+
+  | signature                        | name         |
+  | ---------------------------------------------------- | -------------------- |
+  | db.vertexLabels() :: (label::STRING)               | db.vertexLabels        |
+  | db.edgeLabels() :: (edgeLabels::STRING) | db.edgeLabels |
+  | db.indexes() :: (index::LIST)            | db.indexes       |
+  | ...                          | ...          |
+
+* db.subgraph()
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description                                                           |
+  | ---------- | -------------- | --------------------------------------------------------------------- |
+  | vids       | list           | list of vertex id                                                     |
+
+  **Output:**
+
+  Get a json containing all the properties of nodes and relationships.
+
+  **Example input:**
+
+  ```
+  CALL db.subgraph([3937,4126,4066,4010])
+  ```
+
+  **Example output**
+
+  | subgraph |
+  | -------- |
+  | {"nodes":[{"identity":3937,"label":"movie","properties":{"duration":136,"id":1,"poster_image":"http://image.tmdb.org/t/p/w185/gynBNzwyaHKtXqlEKKLioNkjKgN.jpg","rated":"R","summary":"Thomas A. Anderson is a man living two lives. By day he is an average computer programmer and by night a malevolent hacker known as Neo who finds himself targeted by the police when he is contacted by Morpheus a legendary computer hacker who reveals the shocking truth about our reality.","tagline":"Welcome to the Real World.","title":"The Matrix"}},{"identity":4010,"label":"user","properties":{"id":44,"login":"Howard"}},{"identity":4066,"label":"user","properties":{"id":202,"login":"Enoch"}},{"identity":4126,"label":"user","properties":{"id":464,"login":"Wilburn"}}],"relationships":[{"dst":4126,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4010,"temporal_id":0},{"dst":4010,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4066,"temporal_id":0},{"dst":4066,"forward":true,"identity":0,"label":"is_friend","label_id":3,"src":4126,"temporal_id":0}]} |
+
+* db.vertexLabels()
+
+  Lists all available vertex labels of vertex.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {`name`}.
+
+  **Example input:**
+
+  ```
+  CALL db.vertexLabels()
+  ```
+  **Example output:**
+
+    | label   |
+    | ------- |
+    | genre   |
+    | keyword |
+    | movie   |
+    | ...     |
+
+* db.edgeLabels()
+
+  Lists all available labels of edges.
+
+  **Scope:** whole instance.
+
+  **Output:** a list of {edge labels}.
+
+  **Example input:**
+
+  ```
+  CALL db.edgeLabels()
+  ```
+
+  **Example output:**
+
+  | relationshipType |
+  | ---------------- |
+  | acted_in     |
+  | directed     |
+  | ...          |
+
+* db.createVertexLabel(label_name, primary_field, field_spec...)
+
+  Create a vertex label.
+
+  **Scope:** whole instance.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of  vertex label    |
+  | primary_field | string  | primary field of vertex label |
+  | field_spec | list       | specification of a field |
+
+   in which each `field_spec` is a list of string in the form of `[field_name, field_type, true]`, where true is specified only for optional fields.
+
+    **Output:** If successful, it returns a success message.
+
+    **Example input:**
+
+    ```
+    CALL db.createVertexLabel('Person', 'id', 'id', 'int64', false, 'name', 'string', true)
+    ```
+
+    **Example output:**
+
+    ```
+    Added label [Person]
+    ```
+
+* db.getLabelSchema(label_type, label_name)
+
+  Get the schema definition of the label in a subgraph.
+
+  **Scope:** subgraph, as specified in the `graph` parameter in REST or RPC request.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:** a list of label specifications, in which each element is a list of the following fields:
+
+  | field_name | field_type | description           |
+  | ---------- | ---------- | ----------------------------- |
+  | name       | string     | name of the field         |
+  | type       | string     | type of the field         |
+  | optional   | boolean    | whether the field is optional |
+
+  **Example input:**
+
+  ```
+  CALL db.getLabelSchema('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | name     | type   | optional |
+  | ------------ | ------ | -------- |
+  | id       | INT32  | false    |
+  | born     | INT32  | true     |
+  | name     | STRING | true     |
+  | poster_image | STRING | true     |
+
+* db.createLabel(label_type, label_name, extra, field_spec...)
+
+  Create a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | extra      | string     | for edge, it means constraints; for vertex, it means primary property |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.
+    for edge, `extra` should be a json array string, like this `[["label1","label2"], ["label3","label4"]]`, if edge has no constraints, give an empty json array, like this `[]`
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.createLabel('vertex', 'new_label', 'id', ['id','int32',false], ['name','string', true]);
+  CALL db.createLabel('edge', 'new_edge', '[["id1","id2"]]', ['id','int32',false], ['name', 'string', true]);
+  ```
+
+  **Example output:**
+
+  ```
+  Vertex label [new_label] successfully added.
+  ```
+
+* db.deleteLabel(label_type, label_name)
+
+  Delete a vertex or edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+
+  **Output:**
+
+  | field_name | field_type | description              |
+  | ---------- | ---------- | -------------------------------- |
+  | affected   | integer    | number of vertexes/edges deleted |
+
+  **Example input:**
+
+  ```
+  CALL db.deleteLabel('vertex', 'Person')
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelDelFields(label_type, label_name, field_names)
+
+  Delete specified fields from the label.
+
+  **Parameters:**
+
+  | parameter   | parameter type  | description           |
+  | ----------- | --------------- | ----------------------------- |
+  | label_type  | string      | either 'vertex' or 'edge'     |
+  | label_name  | string      | name of the label         |
+  | field_names | list of strings | names of the fields to delete |
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelDelFields('vertex', 'Person', ['name', 'image'])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelAddFields(label_type, label_name, field_value_spec...)
+
+  Adds specified fields to the label.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description           |
+  | ---------------- | -------------- | ------------------------- |
+  | label_type       | string     | either 'vertex' or 'edge' |
+  | label_name       | string     | name of the label     |
+  | field_value_spec | list       | specification of a field  |
+
+    in which each `field_value_spec` is a list of string in the form of `[field_name, field_type, field_value, optional]`, where: `field_value` is the default value of the field.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+  ```
+  CALL db.alterLabelAddFields(
+  'vertex',
+  'new_label',
+  ['birth_date', DATE, '', true],
+  ['img', BLOB, '', true])
+  ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.alterLabelModFields(label_type, label_name, field_spec...)
+
+  Modifies the specified fields in the label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description           |
+  | ---------- | -------------- | ------------------------- |
+  | label_type | string     | either 'vertex' or 'edge' |
+  | label_name | string     | name of the label     |
+  | field_spec | list       | specification of a field  |
+
+    in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`.The target field should exist.
+
+  **Output:**
+
+  | field_name | field_type | description               |
+  | ---------- | ---------- | --------------------------------- |
+  | affected   | integer    | number of vertexes/edges modified |
+
+  **Example input:**
+
+    ```
+    CALL db.alterLabelModFields(
+    'vertex',
+    'new_label',
+    ['birth_date', DATETIME, true],
+    ['gender', BOOL, true])
+    ```
+
+  **Example output:**
+
+  | affected |
+  | -------- |
+  | 1024     |
+
+* db.createEdgeLabel( label_name, field_spec...)
+
+  Create an edge label.
+
+  **Parameters:**
+
+  | parameter  | parameter type | description          |
+  | ---------- | -------------- | ------------------------ |
+  | label_name | string     | name of the label    |
+  | edge_constraints | string | edge constraints |
+  | field_spec | list       | specification of a field |
+
+  in which each `field_spec` is a list of string in the form of `[field_name, field_type, optional]`, where optional is specified as true, only for  optional fields.
+
+  `edge_constraints` is a json array string, This parameter limits the combination of starting and ending vertex of the edge, for example: `'[["vertex_label1","vertex_label2"],["vertex_label3","vertex_label4"]]'`, which limits the edge direction can only be from `vertex_label1` to `vertex_label2` or from `vertex_label3` to `vertex_label4`. If you don't want to have any constraints, give an empty array string, like this `'[]'`
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.createEdgeLabel('KNOWS', '[]', 'name', 'int32', true)
+  ```
+
+  **Example output:**
+
+  ```
+  Added type [KNOWS]
+  ```
+
+* db.addIndex(label_name, field_name, unique)
+
+  create an index on some field of one vertex label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+  | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+
+   **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL db.addIndex('Person', 'id', true)
+  ```
+
+   **Example output:**
+
+  ```
+  Added index [Perosn:id]
+  ```
+* db.addEdgeIndex(label_name, field_name, unique, pair_unique)
+
+  create an index on some field of one edge label .
+
+  **Parameters:**
+
+  | parameter | parameter type | description               |
+    | ---------- | -------------- | ------------------------------------- |
+  | label_name | string     | name of the label             |
+  | field_name | string     | specification of a field          |
+  | unique  | boolean    | Specifies whether the index is unique |
+  | pair_unique | boolean    | Specifies whether the index is pair_unique |
+
+  **Output:**
+
+  If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL db.addEdgeIndex('BornIn', 'id', true, false)
+  ```
+
+  **Example output:**
+
+  ```
+  Added index [BornIn:id]
+  ```
+
+* dbms.security.changePassword(current_password ,new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description      |
+  | ---------------- | -------------- | -------------------- |
+  | current_password | string     | the current password |
+  | new_password     | string     | new password     |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changePassword('73@TuGraph','admin')
+  ```
+
+   **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.changeUserPassword(user_name, new_password)
+
+  Change the current user's password.
+
+  **Parameters:**
+
+  | parameter    | parameter type | description     |
+  | ------------ | -------------- | --------------- |
+  | user_name    | string     | the user's name |
+  | new_password | string     | new password    |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.changeUserPassword('quest','73@TuGraph')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.createUser(user_name, password)
+
+  create  new user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description              |
+  | --------- | -------------- | -------------------------------- |
+  | user_name | string     | the new user name        |
+  | password  | string     | the password of new user     |
+  
+   **Output:**
+  
+    If successful, it returns a success message.
+  
+   **Example input:**
+  
+  ```
+  CALL dbms.security.createUser('quest',"admin")
+  ```
+  
+   **Example output:**
+  
+  ```
+  true
+  ```
+  
+* dbms.security.deleteUser(user_name)
+
+  delete user on this graph database.
+
+  **Parameters:**
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user_name | string     | the user name to be deleted |
+
+  **Output:**
+
+    If successful, it returns a success message.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.deleteUser('quest')
+  ```
+
+  **Example output:**
+
+  ```
+  true
+  ```
+
+* dbms.security.listUsers()
+
+  get all user's name of the graph database.
+
+  **Output:**
+
+   a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description         |
+  | --------- | -------------- | --------------------------- |
+  | user.name | string     | the user name           |
+  | is.admin  | boolean    | the permission of this user |
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.listUsers()
+  ```
+
+  **Example output:**
+
+  | user.name | is.admin |
+  | --------- | -------- |
+  | admin     | true     |
+  | ...       |  ...    |
+
+* dbms.security.showCurrentUser()
+
+  get current user's name.
+
+  **Output:**
+
+    a list of user names, in which each element is a list of the following fields:
+
+  | parameter | parameter type | description       |
+  | --------- | -------------- | --------------------- |
+  | user.user | string     | the current user name |
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.showCurrentUser()
+  ```
+
+  **Example output:**
+
+  | user.name |
+  | --------- |
+  | admin     |
+
+* dbms.security.listAllowedHosts()
+
+  get the list of ips to be allowed .
+
+  **Output:**
+
+   a list of  ips which are allowed.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.listAllowedHosts()
+  ```
+
+  **Example output:**
+
+  | host     |
+  | ------------ |
+  | 192.168.1.22 |
+  | ...      |
+
+* dbms.security.deleteAllowedHosts(hosts)
+
+  delete some ips from the list of ips to be allowed .
+
+  **Output:**
+
+   the number of ip which been deleted.
+
+   **Example input:**
+
+  ```
+  CALL dbms.security.deleteAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.security.addAllowedHosts(hosts)
+
+  add some ips from the list of ips to be allowed .
+
+  **Output:**
+
+    the number of ip which been added.
+
+  **Example input:**
+
+  ```
+  CALL dbms.security.addAllowedHosts('192.168.1.22','192.168.1.23')
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | 2       |
+
+* dbms.graph.createGraph(graph_name, description, max_size_GB)
+
+  create a new subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter   | parameter type | description              |
+  | ----------- | -------------- | -------------------------------- |
+  | graph_name  | string     | the name of new subgraph     |
+  | description | string     | description of new subgraph      |
+  | max_size_GB | integer    | Upper limit of subgraph capacity |
+
+   **Output:**
+
+    if successful , it will return true.
+
+   **Example input:**
+
+  ```
+  CALL dbms.graph.createGraph('graph1', 'description', 2045)
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.deleteGraph(graph_name)
+
+  delete a subgraph in this graph database .
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.deleteGraph('graph1')
+  ```
+
+   **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.modGraph(graph_name, config)
+
+  delete a subgraph in this graph database .
+
+  **Parameters:**
+
+  | parameter  | parameter type | description              |
+  | ---------- | -------------- | ------------------------------------ |
+  | graph_name | string     | the name of subgraph to been deleted |
+  | config     | map        | the configuration to be modified     |
+
+  **Output:**
+
+    if successful , it will return true.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.modGraph('graph1',{description:'this graph', max_size_GB:20})
+  ```
+
+  **Example output:**
+
+  | success |
+  | ------- |
+  | true    |
+
+* dbms.graph.listGraphs()
+
+  get all subgraphs in this graph database.
+
+  **Output:**
+
+    a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listGraphs()
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+  | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+
+* dbms.graph.listUserGraphs(user_name)
+
+  get subgraph list which specified user can read or write
+
+  **Output:**
+
+  a list of {subgraph and configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.graph.listUserGraphs("test_user")
+  ```
+
+  **Example output:**
+
+  | graph.name | configuration                 |
+    | ---------- | --------------------------------------------- |
+  | default    | {"description":"","max_size_GB":1024}     |
+  | graph1     | {"description":"this graph","max_size_GB":20} |
+  | ...    |         ...                  |
+
+* dbms.config.list()
+
+  get config of this graph database.
+
+  **Output:**
+
+    a list of {configuration}.
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.list()
+  ```
+
+  **Example output:**
+
+  | name      | value   |
+  |-----------| ---------|
+  | bind_host | 0.0.0.0 |
+  | durable   | true    |
+  | ...       |  ...    |
+
+* dbms.config.update(updates)
+
+  get some config of this graph database.
+
+  **Output:**
+
+    If successful, it returns a success message
+
+  **Example input:**
+
+  ```
+  CALL dbms.config.update({
+    enable_ip_check:false,
+    durable:true,
+    optimistic_txn:true,
+    enable_audit_log:true})
+  ```
+
+  **Example output:**
+
+  ```
+  Update succeeded.
+  ```
+
+* dbms.takeSnapshot()
+
+  take the  snapshot  on this current graph database.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.takeSnapshot()
+  ```
+
+  **Example output:**
+
+  | path                |
+  | ----------------------------------- |
+  | log/db/snapshot/2020-07-20_17.20.03 |
+
+* dbms.listBackupFiles()
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  CALL dbms.listBackupFiles()
+  ```
+
+  **Example output:**
+
+  | path               |
+  | -------------------------- |
+  | tugraph/db/binlog/binlog_0 |
+
+* algo.shortestPath(startNode, endNode, config)
+
+  get one of the shortest paths between two vertexes.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                          |
+  | --------- | -------------- | ------------------------------------------------------------ |
+  | startNode | Node       | the source node of paths                     |
+  | endNode   | Node       | the destination node paths                   |
+  | config    | MAP        | the filter of shortest paths, the formate as {maxHops:3, relationshipQuery:'HAS_CHILD'} |
+
+  **Output:**
+
+    If successful, it will returns one group result of the shortest path.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.shortestPath(n1,n2) YIELD nodeCount,totalCost RETURN nodeCount,totalCost
+  ```
+
+  **Example output:**
+
+  | nodeCount | totalCost |
+  | --------- | --------- |
+  | 2     | 1     |
+
+* algo.allShortestPaths(startNode, endNode, config))
+
+  get the path of backuped files.
+
+  **Output:**
+
+    If successful, it returns the path of snapshot.
+
+  **Example input:**
+
+  ```
+  MATCH (n1 {name:'Hugo Weaving'}),(n2 {title:'The Matrix'})
+  CALL algo.allShortestPaths(n1,n2) YIELD nodeIds,cost RETURN nodeIds,cost
+  ```
+
+  **Example output:**
+
+  | nodeIds | cost |
+  | ------- | ---- |
+  | [2,665] | 1    |
+  | ...     |      |
+
+* algo.algo.native.extract(id, config))
+
+  get the field values of a list of vertexes or edges.
+
+  **Parameters:**
+
+  | parameter | parameter type | description                        |
+  | --------- | -------------- | ---------------------------------------------------------- |
+  | id    | ANY        | the id of vertexes or edges , the id must be variable      |
+  | config    | MAP        | the configuration of  this extraction of vertexes or edges |
+
+  in which each `config` is a map in the form of `{isNode:true, filed:'HAS_CHILD'}`, if `isNode` is specified true, the `id` is a vertex id, or  it is an edge id.
+
+  **Output:**
+
+    If successful, it returns a list of the value of vertexes or edges specified field .
+
+  **Example input:**
+
+  ```
+  with [2,3] as vids CALL algo.native.extract(vids,{isNode:true, field:'id'})
+  YIELD value  RETURN value
+  ```
+
+  **Example output:**
+
+  | value |
+  | ----- |
+  | [4,5] |
+
+### 5.2.内置procedures完整列表
+
+| Name                                  | Description                           | Signature                                                                                                                                                                               |
+|---------------------------------------|---------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
+| db.subgraph                           | 列出点的子图                                | db.subgraph(vids::LIST) :: (subgraph::STRING)                                                                                                                                           |
+| db.vertexLabels                       | 列出所有Vertex Label                      | db.vertexLabels() :: (label::STRING)                                                                                                                                                    |
+| db.edgeLabels                         | 列出所有Edge Label                        | db.edgeLabels() :: (edgeLabels::STRING)                                                                                                                                                 |
+| db.indexes                            | 列出所有索引                                | db.indexes() :: (label::STRING,field::STRING,label_type:STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                                                    |
+| db.listLabelIndexes                   | 列出所有与某个Label相关的索引                     | db.listLabelIndexes(label_name:STRING,label_type:STRING) :: (label::STRING,field::STRING,unique::BOOLEAN,pair_unique::BOOLEAN)                                                          |
+| db.warmup                             | 预热数据                                  | db.warmup() :: (time_used::STRING)                                                                                                                                                      |
+| db.createVertexLabel                  | 创建Vertex Label                        | db.createVertexLabel(label_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                  |
+| db.createLabel                        | 创建Vertex/Edge Label                   | db.createLabel(label_type::STRING,label_name::STRING,extra::STRING,field_specs::LIST) :: ()                                                                                             |
+| db.getLabelSchema                     | 列出label schema                        | db.getLabelSchema(label_type::STRING,label_name::STRING) :: (name::STRING,type::STRING,optional::BOOLEAN)                                                                               |
+| db.getVertexSchema                    | 列出点的 schema                           | db.getVertexSchema(label::STRING) :: (schema::MAP)                                                                                                                                      |
+| db.getEdgeSchema                      | 列出边的 schema                           | db.getEdgeSchema(label::STRING) :: (schema::MAP)                                                                                                                                        |
+| db.deleteLabel                        | 删除Vertex/Edge Label                   | db.deleteLabel(label_type::STRING,label_name::STRING) :: (::VOID)                                                                                                                       |
+| db.alterLabelDelFields                | 修改label删除属性                           | db.alterLabelDelFields(label_type::STRING,label_name::STRING,del_fields::LIST) :: (record_affected::INTEGER)                                                                            |
+| db.alterLabelAddFields                | 修改label添加field                        | db.alterLabelAddFields(label_type::STRING,label_name::STRING,add_field_spec_values::LIST) :: (record_affected::INTEGER)                                                                 |
+| db.alterLabelModFields                | 修改label field                         | db.alterLabelModFields(label_type::STRING,label_name::STRING,mod_field_specs::LIST) :: (record_affected::INTEGER)                                                                       |
+| db.createEdgeLabel                    | 创建Edge Label                          | db.createEdgeLabel(type_name::STRING,field_specs::LIST) :: (::VOID)                                                                                                                     |
+| db.addIndex                           | 创建索引                                  | db.addIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN) :: (::VOID)                                                                                                          |
+| db.addEdgeIndex                       | 创建索引                                  | db.addEdgeIndex(label_name::STRING,field_name::STRING,unique::BOOLEAN,pair_unique::BOOLEAN) :: (::VOID)                                                                                 |
+| db.addVertexCompositeIndex            | 创建组合索引                                | db.addVertexCompositeIndex(label_name::STRING,field_names::LIST,unique::BOOLEAN) :: (::VOID)                                                                                            |
+| db.deleteIndex                        | 删除索引                                  | db.deleteIndex(label_name::STRING,field_name::STRING) :: (::VOID)                                                                                                                       |
+| db.deleteCompositeIndex               | 删除组合索引                                | db.deleteIndex(label_name::STRING,field_names::LIST) :: (::VOID)                                                                                                                        |
+| db.backup                             | 备份数据                                  | db.backup(destination::STRING) :: ()                                                                                                                                                    |
+| dbms.procedures                       | 列出所有procedures                        | dbms.procedures() :: (name::STRING,signature::STRING)                                                                                                                                   |
+| dbms.security.changePassword          | 更改当前用户的密码                             | dbms.security.changePassword(current_password::STRING,new_password::STRING) :: (::VOID)                                                                                                 |
+| dbms.security.changeUserPassword      | 更改指定用户的密码                             | dbms.security.changeUserPassword(user_name::STRING,new_password::STRING) :: (::VOID)                                                                                                    |
+| dbms.security.createUser              | 创建用户                                  | dbms.security.createUser(user_name::STRING,password::STRING) :: (::VOID)                                                                                                                |
+| dbms.security.deleteUser              | 删除用户                                  | dbms.security.deleteUser(user_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.listUsers               | 列出所有用户                                | dbms.security.listUsers() :: (user_name::STRING,user_info::MAP)                                                                                                                         |
+| dbms.security.showCurrentUser         | 列出当前用户信息                              | dbms.security.showCurrentUser() :: (current_user::STRING)                                                                                                                               |
+| dbms.security.getUserPermissions      | 列出指定用户的权限                             | dbms.security.getUserPermissions(user_name::STRING) :: (user_info::MAP)                                                                                                                 |
+| dbms.graph.createGraph                | 创建子图                                  | dbms.graph.createGraph(graph_name::STRING, description::STRING, max_size_GB::INTEGER) :: (::VOID)                                                                                       |
+| dbms.graph.modGraph                   | 修改子图属性                                | dbms.graph.modGraph(graph_name::STRING,config::MAP) :: (::VOID)                                                                                                                         |
+| dbms.graph.deleteGraph                | 删除子图                                  | dbms.graph.deleteGraph(graph_name::STRING) :: (::VOID)                                                                                                                                  |
+| dbms.graph.listGraphs                 | 列出所有子图                                | dbms.graph.listGraphs() :: (graph_name::STRING,configuration::MAP)                                                                                                                      |
+| dbms.graph.getGraphInfo               | 列出指定子图的信息                             | dbms.graph.getGraphInfo(graph_name::STRING)::(graph_name::STRING,configuration::MAP)                                                                                                    |
+| dbms.security.addAllowedHosts         | 添加ip到信任列表                             | dbms.security.addAllowedHosts(hosts::LIST) :: (num_new::INTEGER)                                                                                                                        |
+| dbms.security.deleteAllowedHosts      | 从信任列表删除ip                             | dbms.security.deleteAllowedHosts(hosts::LIST) :: (record_affected::INTEGER)                                                                                                             |
+| dbms.security.listAllowedHosts        | 列出信任列表中的主机ip                          | dbms.security.listAllowedHosts() :: (host::STRING)                                                                                                                                      |
+| dbms.config.update                    | 更新TuGraph配置                           | dbms.config.update(updates::MAP) :: (message::STRING)                                                                                                                                   |
+| dbms.config.list                      | 列出TuGraph配置                           | dbms.config.list() :: (name::STRING,value::ANY)                                                                                                                                         |
+| algo.shortestPath                     | 查询两个点间的最短路径                           | algo.shortestPath(startNode::NODE,endNode::NODE,config::MAP) :: (nodeCount::INTEGER,totalCost::FLOAT)                                                                                   |
+| algo.allShortestPaths                 | 查询两个点间的所有最短路径                         | algo.allShortestPaths(startNode::NODE,endNode::NODE,config::MAP) :: (nodeIds::LIST,relationshipIds::LIST,cost::LIST)                                                                    |
+| algo.native.extract                   | 查询指定VertexId/EdgeUid（列表）指定field的值（列表） | algo.native.extract(id::ANY,config::MAP) :: (value::ANY)                                                                                                                                |
+| db.flushDB                            | 刷新db                                  | db.flushDB() :: (::VOID)                                                                                                                                                                |
+| dbms.security.listRoles               | 列出所有角色                                | dbms.security.listRoles() :: (role_name::STRING,role_info::MAP)                                                                                                                         |
+| dbms.security.createRole              | 创建角色                                  | dbms.security.createRole(role_name::STRING,desc::STRING) :: (::VOID)                                                                                                                    |
+| dbms.security.deleteRole              | 删除角色                                  | dbms.security.deleteRole(role_name::STRING) :: (::VOID)                                                                                                                                 |
+| dbms.security.getRoleInfo             | 获取角色详细信息                              | dbms.security.getRoleInfo(role::STRING) :: (role_info::MAP)                                                                                                                             |
+| dbms.security.disableRole             | 禁用/启用角色                               | dbms.security.disableRole(role::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.modRoleDesc             | 修改角色描述信息                              | dbms.security.modRoleDesc(role::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.rebuildRoleAccessLevel  | 删除角色权限并重建                             | dbms.security.rebuildRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                        |
+| dbms.security.modRoleAccessLevel      | 修改角色对指定图的访问权限                         | dbms.security.modRoleAccessLevel(role::STRING,access_level::MAP) :: (::VOID)                                                                                                            |
+| dbms.security.modRoleFieldAccessLevel | 修改角色对指定属性的访问权限                        | dbms.security.modRoleFieldAccessLevel(role::STRING,graph::STRING,label::STRING,field::STRING,label_type::STRING,field_access_level::STRING) :: (::VOID)                                 |
+| dbms.security.getUserInfo             | 获取用户详细信息                              | dbms.security.getUserInfo(user::STRING) :: (user_info::MAP)                                                                                                                             |
+| dbms.security.disableUser             | 禁用/启用用户                               | dbms.security.disableUser(user::STRING,disable::BOOLEAN) :: (::VOID)                                                                                                                    |
+| dbms.security.setCurrentDesc          | 设置当前用户描述信息                            | dbms.security.setCurrentDesc(description::STRING) :: (::VOID)                                                                                                                           |
+| dbms.security.setUserDesc             | 设置用户描述信息                              | dbms.security.setUserDesc(user::STRING,description::STRING) :: (::VOID)                                                                                                                 |
+| dbms.security.getUserMemoryUsage      | 获取用户内存用量                              | dbms.security.getUserMemoryUsage(user::STRING) :: (memory_usage::INTEGER)                                                                                                               |
+| dbms.security.setUserMemoryLimit      | 设置用户内存限制                              | dbms.security.setUserMemoryLimit(user::STRING,memorylimit::INTEGER) :: (::VOID)                                                                                                         |
+| dbms.security.deleteUserRoles         | 删除用户与角色的联系                            | dbms.security.deleteUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                     |
+| dbms.security.rebuildUserRoles        | 清空用户角色的关系并重建                          | dbms.security.rebuildUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                    |
+| dbms.security.addUserRoles            | 新增用户与角色的联系                            | dbms.security.addUserRoles(user::STRING,roles::LIST) :: (::VOID)                                                                                                                        |
+| db.plugin.loadPlugin                  | 装载plugin                              | db.plugin.loadPlugin(plugin_type::STRING,plugin_name::STRING,plugin_content::STRING or MAP,code_type::STRING,plugin_description::STRING,read_only::BOOLEAN,version::STRING) :: (::VOID) |
+| db.plugin.deletePlugin                | 删除plugin                              | db.plugin.deletePlugin(plugin_type::STRING,plugin_name::STRING) :: (::VOID)                                                                                                             |
+| db.plugin.listPlugin                  | 列出已装载的plugin                          | db.plugin.listPlugin(plugin_type::STRING,plugin_version::STRING) :: (plugin_description::LIST)                                                                                          |
+| db.plugin.getPluginInfo               | 获取plugin的详细信息                         | db.plugin.getPluginInfo(plugin_type::STRING,plugin_name::STRING,show_code::BOOLEAN)::(plugin_description::MAP)                                                                          |
+| db.plugin.callPlugin                  | 执行plugin                              | db.plugin.callPlugin(plugin_type::STRING,plugin_name::STRING,param::STRING,timeout::DOUBLE,in_process::BOOLEAN) :: (success::BOOLEAN,result::STRING)                                    |
+| db.importor.dataImportor              | 导入点或边数据                               | db.importor.dataImportor(description::STRING,content::STRING,continue_on_error::BOOLEAN,thread_nums::INTEGER,delimiter::STRING) :: (::VOID)                                             |
+| db.importor.schemaImportor            | 导入点或边schema                           | db.importor.schemaImportor(description::STRING) :: (::VOID)                                                                                                                             |
+| db.addFullTextIndex                   | 添加全文索引                                | db.addFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                             |
+| db.deleteFullTextIndex                | 删除全文索引                                | db.deleteFullTextIndex(is_vertex::BOOLEAN, label_name::STRING, field_name::STRING) :: (::VOID)                                                                                          |
+| db.rebuildFullTextIndex               | 重建全文索引                                | db.rebuildFullTextIndex(vertex_labels::STRING, edge_labels::STRING) :: (::VOID)                                                                                                         |
+| db.fullTextIndexes                    | 查看全文索引                                | db.fullTextIndexes() :: (is_vertex::BOOLEAN, label::STRING, field::STRING)                                                                                                              |
+| dbms.meta.count                       | 查看点边总数                                | db.dbms.meta.count() :: (type::STRING, number::INTEGER)                                                                                                                                 |
+| dbms.meta.countDetail                 | 查看点边总数详情                              | db.dbms.meta.countDetail() :: (is_vertex::BOOLEAN, label::STRING, count::INTEGER)                                                                                                       |
+| dbms.meta.refreshCount                | 重新统计点边数量，统计期间停写。                      | db.dbms.meta.refreshCount() :: (::VOID)                                                                                                                                                 |
+| dbms.task.listTasks                   | 查询正在执行的任务                             | dbms.task.listTasks()::(tasks::LIST)                                                                                                                                                    |
+| dbms.task.terminateTask               | 中止任务                                  | dbms.task.terminateTask(task_id::STRING)::(::VOID)                                                                                                                                      |
+| dbms.ha.clusterInfo                   | HA模式下查看集群状态                           | dbms.ha.clusterInfo() :: (cluster_info::LIST, is_master::BOOLEAN)                                                                                                                       |
+| db.dropDB                             | 清空数据库                                 | db.dropDB() :: (::VOID)                                                                                                                                                                 |
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/2.gql.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/2.gql.md
new file mode 100644
index 0000000000..a5234f46aa
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/2.gql.md
@@ -0,0 +1,388 @@
+# ISO GQL
+
+
+## 1.GQL简介
+Graph Query Language(GQL, 图查询语言)是一种国际标准语言，用于属性图查询，该语言建立在SQL的基础上，并整合了现有的[openCypher、PGQL、GSQL和G-CORE](https://gql.today/comparing-cypher-pgql-and-g-core/)语言的成熟思想。目前该标准仍然处于草稿阶段。
+
+TuGraph基于[ISO GQL (ISO/IEC 39075) Antlr4 语法文件](https://github.com/TuGraph-family/gql-grammar)实现了GQL，并做了一些扩展与改造。目前并未完全支持所有的GQL语法，我们会在未来逐步完善。
+
+## 2.Clauses
+
+| 类别                | 子句           |
+| ------------------- | -------------- |
+| Reading clauses     | MATCH          |
+|                     | OPTIONAL MATCH |
+| Projecting clauses  | RETURN         |
+|                     | NEXT           |
+| Reading sub-clauses | WHERE          |
+|                     | ORDER BY       |
+|                     | SKIP           |
+|                     | LIMIT          |
+
+### 2.1.MATCH
+
+`MATCH`子句式是GQL最基础的子句，几乎所有查询都是通过 `MATCH`展开。
+
+`MATCH`子句用于指定在图中搜索的匹配模式，用来匹配满足一定条件的点或者路径。
+
+#### 点查询
+
+##### 查询所有点
+
+```
+MATCH (n)
+RETURN n
+```
+
+##### 查询特定标签的点
+
+```
+MATCH (n:Person)
+RETURN n
+```
+
+##### 通过属性匹配点
+
+```
+MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+##### 通过过滤条件匹配点
+
+
+```
+MATCH (n:Person WHERE n.birthyear > 1910)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 边查询
+
+##### 出边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1970)-[e]->(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"BORN_IN","m.name":"London","n.name":"Christopher Nolan"},{"label(e)":"DIRECTED","m.name":null,"n.name":"Christopher Nolan"}]
+```
+
+##### 入边匹配
+
+```
+MATCH (n:Person WHERE n.birthyear = 1939)<-[e]-(m)
+RETURN n.name, label(e), m.name
+```
+
+返回结果
+```JSON
+[{"label(e)":"HAS_CHILD","m.name":"Rachel Kempson","n.name":"Corin Redgrave"},{"label(e)":"HAS_CHILD","m.name":"Michael Redgrave","n.name":"Corin Redgrave"}]
+```
+
+##### 带过滤条件的边匹配
+
+```
+MATCH (n:Person)-[e:BORN_IN WHERE e.weight > 20]->(m)
+RETURN n.name, e.weight, m.name
+```
+
+返回结果
+```JSON
+[{"e.weight":20.549999237060547,"m.name":"New York","n.name":"John Williams"},{"e.weight":20.6200008392334,"m.name":"New York","n.name":"Lindsay Lohan"}]
+```
+
+#### 路径匹配
+
+##### 不定跳查询
+
+```
+MATCH (n:Person)-[e]->{2,3}(m:Person)
+RETURN m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Liam Neeson"},{"m.name":"Natasha Richardson"}]
+```
+
+### 2.2.OPTIONAL MATCH
+
+`OPTIONAL MATCH`匹配图模式，如果未命中，则返回`null`。
+
+#### 查询命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Michael Redgrave'})
+RETURN n.birthyear
+```
+
+返回结果
+```JSON
+[{"n.birthyear":1908}]
+```
+
+#### 查询未命中
+
+```
+OPTIONAL MATCH (n:Person{name:'Redgrave Michael'})
+RETURN n.birthyear
+```
+
+返回结果
+
+```JSON
+[{"n.birthyear":null}]
+```
+
+### 2.3.RETURN
+
+`RETURN`子句指定返回结果，包括返回点、边、路径、属性等。
+
+#### 返回点
+
+```
+MATCH (n)
+RETURN n LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n":{"identity":0,"label":"Person","properties":{"birthyear":1910,"name":"Rachel Kempson"}}},{"n":{"identity":1,"label":"Person","properties":{"birthyear":1908,"name":"Michael Redgrave"}}}]
+```
+
+#### 返回边
+
+```
+MATCH (n)-[e]->(m)
+RETURN e LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"e":{"dst":2,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}},{"e":{"dst":3,"forward":false,"identity":0,"label":"HAS_CHILD","label_id":0,"src":0,"temporal_id":0}}]
+```
+
+#### 返回属性
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
+
+#### 不常见字符串作为变量名
+
+```
+MATCH (`/uncommon variable`:Person)
+RETURN `/uncommon variable`.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"`/uncommon variable`.name":"Christopher Nolan"},{"`/uncommon variable`.name":"Corin Redgrave"},{"`/uncommon variable`.name":"Dennis Quaid"}]
+```
+
+#### 列别名
+
+```
+MATCH (n:Person)
+RETURN n.name AS nname LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"nname":"Christopher Nolan"},{"nname":"Corin Redgrave"}]
+```
+
+#### 可选属性
+
+```
+MATCH (n:Person)
+RETURN n.age LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n.age":null},{"n.age":null}]
+```
+
+#### 其它表达式
+
+```
+MATCH (n:Person)
+RETURN n.birthyear > 1970, "I'm a literal", 1 + 2, abs(-2)
+LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false},{"\"I'm a literal\"":"I'm a literal","1 + 2":3,"abs(-2)":2,"n.birthyear > 1970":false}]
+```
+
+#### 结果唯一性
+
+
+```
+MATCH (n)
+RETURN DISTINCT label(n) AS label
+```
+
+返回结果
+
+```JSON
+[{"label":"Person"},{"label":"City"},{"label":"Film"}]
+```
+
+### 2.4.NEXT
+
+`NEXT`子句用于连接多个子句。
+
+#### 连接MATCH
+
+```
+MATCH (n:Person) WHERE n.birthyear = 1970
+RETURN n
+NEXT
+MATCH (m:Person) WHERE m.birthyear < 1968
+RETURN n.name, n.birthyear, m.name LIMIT 2
+```
+
+返回结果
+```JSON
+[{"m.name":"Rachel Kempson","n.birthyear":1970,"n.name":"Christopher Nolan"},{"m.name":"Michael Redgrave","n.birthyear":1970,"n.name":"Christopher Nolan"}]
+```
+
+### 2.5.WHERE
+
+`WHERE`子句用于过滤记录。
+
+#### 过滤点
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)
+RETURN n.name
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Lindsay Lohan"}]
+```
+
+#### 过滤边
+
+```
+MATCH (n:Person WHERE n.birthyear > 1965)-[e:ACTED_IN]->(m:Film)
+WHERE e.charactername = 'Halle/Annie'
+RETURN m.title
+```
+
+返回结果
+
+```JSON
+[{"m.title":"The Parent Trap"}]
+```
+
+#### 布尔表达式
+
+`AND`, `OR`, `XOR`和 `NOT`布尔表达式可以用在 `WHERE`中用来过滤数据。
+
+```
+MATCH (n:Person)
+WHERE
+	n.birthyear > 1930 AND (n.birthyear < 1950 OR n.name = 'Corin Redgrave')
+RETURN n LIMIT 2
+```
+
+返回结果
+
+```JSON
+[{"n":{"identity":3,"label":"Person","properties":{"birthyear":1939,"name":"Corin Redgrave"}}},{"n":{"identity":11,"label":"Person","properties":{"birthyear":1932,"name":"John Williams"}}}]
+```
+
+
+### 2.6.ORDER BY
+
+`ORDER BY`是`RETURN`的子句，对输出的结果进行排序。
+
+#### 对结果排序
+
+```
+MATCH (n:Person WHERE n.birthyear < 1970)
+RETURN n.birthyear AS q
+ORDER BY q ASC
+LIMIT 5
+```
+
+返回结果
+```JSON
+[{"q":1873},{"q":1908},{"q":1910},{"q":1930},{"q":1932}]
+```
+
+### 2.7.SKIP
+
+`SKIP`指定结果偏移行数。
+
+#### 未使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 3
+```
+
+返回结果
+
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+#### 使用SKIP
+
+```
+MATCH (n:Person)
+RETURN n.name SKIP 1 LIMIT 2
+```
+
+返回结果
+```JSON
+[{"n.name":"Corin Redgrave"},{"n.name":"Dennis Quaid"}]
+```
+
+### 2.8.LIMIT
+
+`LIMIT`限制结果行数。
+
+#### 使用LIMIT
+
+```
+MATCH (n:Person)
+RETURN n.name LIMIT 2;
+```
+
+返回结果
+```JSON
+[{"n.name":"Christopher Nolan"},{"n.name":"Corin Redgrave"}]
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/3.vector_index.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/3.vector_index.md
new file mode 100644
index 0000000000..9b4c79764c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/3.vector_index.md
@@ -0,0 +1,85 @@
+# Vector index
+## 创建向量索引
+如下json定义了一个点类型，名字是`person`, 里面有个字段是`embedding`，类型是`FLOAT_VECTOR`，用来存储向量数据。
+目前向量数据只能在点上创建。
+
+```json
+{
+	"label": "person",
+	"primary": "id",
+	"type": "VERTEX",
+	"properties": [{
+		"name": "id",
+		"type": "INT32",
+		"optional": false
+	}, {
+		"name": "age",
+		"type": "INT32",
+		"optional": false
+	}, {
+		"name": "embedding",
+		"type": "FLOAT_VECTOR",
+		"optional": false
+	}]
+}
+
+```
+把上面这个json序列化成字符串，作为参数传入，建议使用驱动的参数化特性，避免自己拼接语句。
+```
+CALL db.createVertexLabelByJson($json_data)
+```
+给`embedding`字段添加向量索引，第三个参数是个map，里面可以设置一些向量索引的配置参数，如下，`dimension`设置向量维度是4
+```
+CALL db.addVertexVectorIndex('person','embedding', {dimension: 4});
+```
+
+再定义一个边，用来测试，如下json定义了一个边类型，名字是`like`。
+```json
+{
+  "label": "like",
+  "type": "EDGE",
+  "constraints": [
+    ["person", "person"]
+  ],
+  "properties": []
+}
+```
+把上面这个json序列化成字符串，作为参数传入。
+```
+CALL db.createEdgeLabelByJson($json_data)
+```
+
+写入几条测试数据
+```
+CREATE (n1:person {id:1, age:10, embedding: [1.0,1.0,1.0,1.0]})
+CREATE (n2:person {id:2, age:20, embedding: [2.0,2.0,2.0,2.0]})
+CREATE (n3:person {id:3, age:30, embedding: [3.0,3.0,3.0,3.0]})
+CREATE (n1)-[r:like]->(n2),
+       (n2)-[r:like]->(n3),
+       (n3)-[r:like]->(n1);
+```
+## 向量查询
+### KnnSearch
+根据向量搜索出点，第四个参数是个map，里面可以指定一些向量搜索的参数。
+```
+CALL db.vertexVectorKnnSearch('person','embedding', [1.0,2.0,3.0,4.0], {top_k:2, hnsw_ef_search:10})
+yield node return node
+```
+根据向量搜索出点，返回`age`小于30的
+```
+CALL db.vertexVectorKnnSearch('person','embedding',[1.0,2.0,3.0,4.0], {top_k:2, hnsw_ef_search:10})
+yield node where node.age < 30 return node
+```
+根据向量搜索出点，返回age小于30的点，然后再查这些点的一度邻居是谁。
+```
+CALL db.vertexVectorKnnSearch('person','embedding',[1.0,2.0,3.0,4.0], {top_k:2, hnsw_ef_search:10})
+yield node where node.age < 30 with node as p
+match(p)-[r]->(m) return m
+```
+### RangeSearch
+根据向量搜索出距离小于10的、age小于30的点，然后再查这些点的一度邻居是谁。
+```
+CALL db.vertexVectorRangeSearch('person','embedding',[1.0,2.0,3.0,4.0], {radius:10.0, hnsw_ef_search:10})
+yield node where node.age < 30 with node as p
+match(p)-[r]->(m) return m
+```
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/index.rst
new file mode 100644
index 0000000000..0571c71701
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/8.query/index.rst
@@ -0,0 +1,9 @@
+查询语言
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   *
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
new file mode 100644
index 0000000000..1748f19794
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/1.procedure.md
@@ -0,0 +1,349 @@
+# Procedure API
+
+> 此文档主要讲解 TuGraph 的存储过程使用说明
+
+## 1.简介
+
+当用户需要表达的查询/更新逻辑较为复杂（例如 Cypher 无法描述，或是对性能要求较高）时，相比调用多个请求并在客户端完成整个处理流程的方式，TuGraph 提供的存储过程是更简洁和高效的选择。
+
+与传统数据库类似，TuGraph 的存储过程运行在服务器端，用户通过将处理逻辑（即多个操作）封装到一个过程单次调用，并且可以在实现时通过并行处理的方式（例如使用相关的 C++ OLAP 接口以及基于其实现的内置算法）进一步提升性能。
+
+存储过程中有一类特殊的API来进行数据的并行操作，我们叫 Traversal API，见[文档](2.traversal.md)。
+
+## 2.存储过程的版本支持
+
+目前TuGraph支持两个版本的存储过程，适用于不同的场景，v3.5版本只支持v1，可通过REST或RPC接口直接调用；从v3.5版本开始支持v2，能够在图查询语言（比如Cypher）中嵌入调用，我们称之为POG（Procedure On Graph query language，APOC）。
+
+|                        | Procedure v1                       | Procedure v2               |
+| ---------------------- | ---------------------------------- | -------------------------- |
+| 适用场景                 | 极致性能，或者复杂的多事务管理情形       | 一般情况，与Cypher高度联动 |
+| 事务                    | 函数内部创建，可自由控制多事务          | 外部传入函数，单一事务     |
+| 签名（参数定义）          | 无                                 | 有                    |
+| 输入输出参数类型          | 不需要指定                           | 需要指定参数类型        |
+| Cypher Standalone Call | 支持                                | 支持                  |
+| Cypher Embeded Call    | 不支持                              | 支持                  |
+| 语言                    | C++/Python/Rust                    | C++                  |
+| 调用模式                 | 直接传字符串，一般为JSON               | 通过Cypher语句中的变量  |
+
+在TuGraph中，存储过程v1和v2单独管理，支持增删查，但仍不建议重名。
+
+## 3.存储过程语言支持
+
+在 TuGraph 中，用户可以动态的加载，更新和删除存储过程。TuGraph 支持 C++ 语言、 Python 语言和 Rust 语言编写存储过程。在性能上 C++ 语言支持的最完整，性能最优。
+
+注意存储过程是在服务端编译执行的逻辑，和客户端的语言支持无关。
+
+## 4.Procedure v1接口
+
+## 4.1.编写存储过程
+
+### 4.1.1.编写C++存储过程
+
+用户可以通过使用 Procedure API 或者 Traversal API 来编写 C 存储过程。一个简单的 C 存储过程举例如下：
+
+```
+#include <iostream>
+#include "lgraph.h"
+using namespace lgraph_api;
+
+extern "C" LGAPI bool Process(GraphDB& db, const std::string& request, std::string& response) {
+	auto txn = db.CreateReadTxn();
+	size_t n = 0;
+	for (auto vit = txn.GetVertexIterator(); vit.IsValid(); vit.Next()) {
+        if (vit.GetLabel() == "student") {
+            auto age = vit.GetField("age");
+            if (!age.is_null() && age.integer() == 10) n++; ## 统计所有年龄为10的学生数量
+        }
+	}
+    output = std::to_string(n);
+    return true;
+}
+```
+
+从代码中我们可以看到，存储过程的入口函数是`Process`函数，它的参数有三个，分别为：
+
+- `db`: 数据库实例
+- `request`: 输入请求数据，可以是二进制字节数组，或者 JSON 串等其它任意格式。
+- `response`: 输出数据，可以是字符串，也可以直接返回二进制数据。
+
+`Process`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误，此时用户可以通过`response`来返回错误信息以方便调试。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`age_10`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o age_10.so age_10.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 age_10.so，然后用户就可以将它加载到服务器中了。
+
+### 4.1.2.编写Python存储过程
+
+与 C++类似，Python 存储过程也可以调用 core API，一个简单的例子如下：
+
+```python
+def Process(db, input):
+    txn = db.CreateReadTxn()
+    it = txn.GetVertexIterator()
+    n = 0
+    while it.IsValid():
+        if it.GetLabel() == 'student' and it['age'] and it['age'] == 10:
+            n = n + 1
+        it.Next()
+    return (True, str(nv))
+```
+
+Python 存储过程返回的是一个 tuple，其中第一个元素是一个布尔值，表示该存储过程是否成功执行；第二个元素是一个`str`，里面是需要返回的结果。
+
+Python 存储过程不需要编译，可以直接加载。
+
+## 4.2.如何使用存储过程
+### 4.2.1.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`age_10.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'age_10'}
+f = open('./age_10.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`age_10.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+### 4.2.2.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true}]}'
+```
+
+### 4.2.3.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"age_10", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+### 4.2.4.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```
+>>> r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10', data='',
+                headers={'Content-Type':'application/json'})
+>>> r.status_code
+200
+>>> r.text
+9
+```
+
+### 4.2.5.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/age_10')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+### 4.2.6.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
+
+## 5.Procedure v2接口
+
+下面的说明以 REST API 为例，介绍存储过程v2的调用。
+
+### 5.1.编写存储过程
+
+
+用户可以通过使用 lgraph API 来编写 C++ 存储过程。一个简单的 C++ 存储过程举例如下：
+
+```c++
+// peek_some_node_salt.cpp
+#include <cstdlib>
+#include "lgraph/lgraph.h"
+#include "lgraph/lgraph_types.h"
+#include "lgraph/lgraph_result.h"
+
+#include "tools/json.hpp"
+
+using json = nlohmann::json;
+using namespace lgraph_api;
+
+extern "C" LGAPI bool GetSignature(SigSpec &sig_spec) {
+    sig_spec.input_list = {
+        {.name = "limit", .index = 0, .type = LGraphType::INTEGER},
+    };
+    sig_spec.result_list = {
+        {.name = "node", .index = 0, .type = LGraphType::NODE},
+        {.name = "salt", .index = 1, .type = LGraphType::FLOAT}
+    };
+    return true;
+}
+
+extern "C" LGAPI bool ProcessInTxn(Transaction &txn,
+                                   const std::string &request,
+                                   Result &response) {
+    int64_t limit;
+    try {
+        json input = json::parse(request);
+        limit = input["limit"].get<int64_t>();
+    } catch (std::exception &e) {
+        response.ResetHeader({
+            {"errMsg", LGraphType::STRING}
+        });
+        response.MutableRecord()->Insert(
+            "errMsg",
+            FieldData::String(std::string("error parsing json: ") + e.what()));
+        return false;
+    }
+
+    response.ResetHeader({
+        {"node", LGraphType::NODE},
+        {"salt", LGraphType::FLOAT}
+    });
+    for (size_t i = 0; i < limit; i++) {
+        auto r = response.MutableRecord();
+        auto vit = txn.GetVertexIterator(i);
+        r->Insert("node", vit);
+        r->Insert("salt", FieldData::Float(20.23*float(i)));
+    }
+    return true;
+}
+```
+
+从代码中我们可以看到：
+- 存储过程定义了一个获取签名的方法`GetSignature`。该方法返回了存储过程的签名，其中包含输入参数名称及其类型，返回参数及其类型。这使得Cypher查询语句在调用存储过程能够利用签名信息校验输入数据以及返回数据是否合理。
+- 入口函数是`ProcessInTxn`函数，它的参数有三个，分别为：
+
+- `txn`: 存储过程所处的事务，通常来说即调用该存储过程的Cypher语句所处事务。
+- `request`: 输入数据，其内容为`GetSignature`中定义的输入参数类型及其Cypher查询语句中传入的值经过json序列化后的字符串。e.g. `{num_iteration: 10}`
+- `response`: 输出数据，为保证在Cypher语言中能够兼容，用户可以通过往`lgraph_api::Result` 写入存储过程处理后的数据，最后用`lgraph_api::Result::Dump`来序列化成json格式的数据。
+
+`ProcessInTxn`函数的返回值是一个布尔值。当它返回`true`的时候，表示该请求顺利完成，反之表示这个存储过程在执行过程中发现了错误。
+
+C++存储过程编写完毕后需要编译成动态链接库。TuGraph 提供了`compile.sh`脚本来帮助用户自动编译存储过程。`compile.sh`脚本只有一个参数，是该存储过程的名称，在上面的例子中就是`custom_pagerank`。编译调用命令行如下：
+
+```bash
+g++ -fno-gnu-unique -fPIC -g --std=c++14 -I/usr/local/include/lgraph -rdynamic -O3 -fopenmp -o custom_pagerank.so custom_pagerank.cpp /usr/local/lib64/liblgraph.so -shared
+```
+
+如果编译顺利，会生成 custom_pagerank.so，然后用户就可以将它加载到服务器中了。
+
+
+### 5.2.加载存储过程
+
+用户可以通过 REST API 和 RPC 来加载存储过程。以 REST API 为例，加载`custom_pagerank.so`的 C++代码如下：
+
+```python
+import requests
+import json
+import base64
+
+data = {'name':'custom_pagerank'}
+f = open('./custom_pagerank.so','rb')
+content = f.read()
+data['code_base64'] = base64.b64encode(content).decode()
+data['description'] = 'Custom Page Rank Procedure'
+data['read_only'] = true
+data['code_type'] = 'so'
+js = json.dumps(data)
+r = requests.post(url='http://127.0.0.1:7071/db/school/cpp_plugin', data=js,
+            headers={'Content-Type':'application/json'})
+print(r.status_code)    ## 正常时返回200
+```
+
+需要注意的是，这时的`data['code']`是一个经过 base64 处理的字符串，`custom_pagerank.so`中的二进制代码是无法通过 JSON 直接传输的。此外，存储过程的加载和删除都只能由具有管理员权限的用户来操作。
+
+存储过程加载之后会被保存在数据库中，在服务器重启后也会被自动加载。此外，如果需要对存储过程进行更新，调用的 REST API 也是同样的。建议用户在更新存储过程时更新相应描述，以便区分不同版本的存储过程。
+
+
+#### 5.2.1.列出已加载的存储过程
+
+在服务器运行过程中，用户可以随时获取存储过程列表。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin')
+>>> r.status_code
+200
+>>> r.text
+'{"plugins":[{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true}]}'
+```
+
+#### 5.2.2.获取存储过程详情
+
+在服务器运行过程中，用户可以随时获取单个存储过程的详情，包括代码。其调用如下：
+
+```python
+>>> r = requests.get('http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+>>> r.text
+'{"description":"Custom Page Rank Procedure", "name":"custom_pagerank", "read_only":true, "code_base64":<CODE>, "code_type":"so"}'
+```
+
+#### 5.2.3.调用存储过程
+
+调用存储过程的代码示例如下：
+
+```Cypher
+CALL plugin.cpp.custom_pagerank(10)
+YIELD node, pr WITH node, pr
+MATCH(node)-[r]->(n) RETURN node, r, n, pr
+```
+
+#### 5.2.4.删除存储过程
+
+删除存储过程只需要如下调用：
+
+```python
+>>> r = requests.delete(url='http://127.0.0.1:7071/db/school/cpp_plugin/custom_pagerank')
+>>> r.status_code
+200
+```
+
+与加载存储过程类似，只有管理员用户才能删除存储过程。
+
+#### 5.2.5.更新存储过程
+
+更新存储过程需要执行如下两个步骤：
+
+1.  删除已存在的存储过程
+2.  安装新的存储过程
+
+TuGraph 较为谨慎地管理存储过程操作的并发性，更新存储过程不会影响现有存储过程的运行。
+
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
new file mode 100644
index 0000000000..9613828c50
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/2.traversal.md
@@ -0,0 +1,128 @@
+# Traversal API
+
+> 此文档主要讲解 TuGraph 的存储过程中的Traversal API
+
+## 1. 简介
+
+TuGraph 强大的在线分析处理（OLAP）能力是其区别于其它图数据库的一个重要特性。
+借助 C++ OLAP API（olap_on_db.h），用户可以快速地导出一个需要进行复杂分析的子图，然后在其上运行诸如 PageRank、连通分量、社区发现等迭代式图计算过程，最后根据结果做出相应决策。
+导出和计算的过程都可以通过并行处理的方式进行加速，从而实现几乎实时的分析处理，避免了传统解决方案需要将数据导出、转换、再导入（ETL）到专门的分析系统进行离线处理的冗长步骤。
+
+TuGraph 内置了大量常用的图分析算法和丰富的辅助接口，因此用户几乎不需要自己来实现具体的图计算过程，只需在实现自己的存储过程时将相应算法库的头文件（.h 文件）包含到自己程序中，并在编译时链接相应的动态库文件（.so）即可。
+一般情况下，用户需要自己实现的只有将需要分析的子图抽取出来的过程。
+
+目前 Traversal API 仅支持 C++。
+
+## 2. 接口说明
+
+### 2.1. Snapshot
+
+C++ OLAP API 中的 Snapshot 模版类用于表示抽取出来的静态子图，其中 EdgeData 用来表示该子图上每条边所用权值的数据类型（如果边不需要权值，使用 Empty 作为 EdgeData 即可）。
+
+抽取的子图通过 Snapshot 类的构造函数来描述：
+
+```c
+Snapshot::Snapshot(
+    GraphDB & db,
+    Transaction & txn,
+    size_t flags = 0,
+    std::function<bool(VertexIterator &)> vertex_filter = nullptr,
+    std::function<bool(OutEdgeIterator &, EdgeData &)> out_edge_filter = nullptr
+);
+```
+
+其中，db 为数据库句柄，txn 为事务句柄，flags 为生成时使用的选项，可选值包括以下的组合：SNAPSHOT_PARALLEL 表示导出时使用多个线程进行并行；SNAPSHOT_UNDIRECTED 表示需要将导出的图变为无向图。
+vertex_filter 是面向点的用户自定义过滤函数，返回值为 true 表示该点需要被包含到待抽取的子图中，反之则表示需要被排除。
+out_edge_filter 是面向边的用户自定义过滤函数，返回值为 true 表示该边需要被包含到待抽取的子图中，反之则表示需要被排除。
+当过滤函数为缺省值时，则表示需要将所有点/边都包含进来。
+
+Snapshot 类提供的其它方法请参考详细的 C++ API 文档（olap_on_db.h）。
+
+### 2.2. Traversal
+
+图数据库中十分常见的一大类分析是基于一个或多个点出发，逐层地拓展并访问邻居。
+尽管这类分析也可以使用 Cypher 完成，但是当访问的层数较深时，其性能会受到串行解释执行的限制。
+使用 C++ Core API 编写存储过程尽管避免了解释执行，但依然受限于单个线程的处理能力。
+为了让用户能够方便地通过并行处理的方式加速这一类应用场景，我们基于 C++ OLAP API 封装了一个 Traversal 框架，用户可以直接使用其中的 FrontierTraversal 和 PathTraversal 类来完成这种逐层遍历的分析任务，具体的使用方法可以参考相应的 C++ API 文档（lgraph_traversal.h）。
+
+```c
+ParallelVector<size_t> FindVertices(
+    GraphDB & db,
+    Transaction & txn,
+    std::function<bool(VertexIterator &)> filter,
+    bool parallel = false
+);
+```
+
+该方法可用于找到所有满足条件（filter 返回 true）的点，当 parallel 为 true 时则会并行该查找过程。
+
+```c
+template <typename VertexData>
+ParallelVector<VertexData> ExtractVertexData(
+    GraphDB & db,
+    Transaction & txn,
+    ParallelVector<size_t> & frontier,
+    std::function<void(VertexIterator &, VertexData &)> extract,
+    bool parallel = false
+);
+```
+
+该方法可用于从指定点集（frontier）中（通过 extract 方法）抽取（类型为 VertexData 的）属性，当 parallel 为 true 时会并行该抽取过程。
+
+FrontierTraversal 适用于只关注遍历扩展到的点集的情况；当用户在遍历过程或是结果中需要访问路径上的信息（路径上的点/边）时，则需要使用 PathTraversal。
+两类 Traversal 的构造函数均有四个参数，分别为数据库句柄 db、事务句柄 txn、选项 flags 和 初始化数组容量 capacity。
+选项的可选值包括以下的组合：TRAVERSAL_PARALLEL 表示遍历时使用多个线程并行；TRAVERSAL_ALLOW_REVISITS 表示遍历时允许重复地访问点（PathTraversal 隐含了该选项）。capacity 表示初始化时路径集合的容量。
+
+```c
+void SetFrontier(size_t root_vid);
+void SetFrontier(ParallelVector<size_t> & root_vids);
+void SetFrontier(std::function<bool(VertexIterator &)> root_vertex_filter);
+```
+
+两类 Traversal 设置遍历的起始点/点集有上述三种方式，前两种通过点 ID 直接指定，最后一种方式则类似于 FindVertices。
+
+两类 Traversal 的遍历都是从当前层的点集合出发，根据使用的扩展函数访问每条出边/入边/出边和入边，通过用户自定义的过滤函数决定扩展是否成功，若成功则将邻居点/追加了该条边的路径加入下一层的点/路径集合。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &)> in_neighbour_filter = nullptr
+);
+```
+
+上述为 FrontierTraversal 的三种遍历方式，即从当前的点集合出发，对集合中的每个点，依次访问每条出边/入边/出边和入边，若满足用户自定义的过滤条件（其中，edge_filter 为面向边的过滤函数，neighbour_filter 则为面向邻居点的过滤函数），则将邻居点加入新的点集合。
+
+```c
+ParallelVector<size_t> & GetFrontier();
+```
+
+当前点集合的扩展结束后，新的点集合可以通过上述方法取得。
+
+```c
+void ExpandOutEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr
+);
+void ExpandInEdges(
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+void ExpandEdges(
+    std::function<bool(OutEdgeIterator &, Path &, IteratorHelper &)> out_edge_filter = nullptr,
+    std::function<bool(InEdgeIterator &, Path &, IteratorHelper &)> in_edge_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> out_neighbour_filter = nullptr,
+    std::function<bool(VertexIterator &, Path &, IteratorHelper &)> in_neighbour_filter = nullptr
+);
+```
+
+PathTraversal 的三种遍历方式与 FrontierTraversal 类似，只是用户自定义的过滤函数中增加了两个参数，其中：Path 包含了到新扩展的这条边之前的路径，IteratorHelper 可用于将路径中的点/边转为数据库中对应的迭代器，相关文档可参考对应的 C++ API 文档。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
new file mode 100644
index 0000000000..7773487052
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/3.C++-procedure.rst
@@ -0,0 +1,128 @@
+C++存储过程接口
+====================================
+
+.. toctree::
+   :maxdepth: 2
+
+
+
+
+base64_encode
+------------------
+
+.. doxygenfile:: base64_encode.h
+   :project: cpp_procedure
+
+lgraph
+------------------
+
+.. doxygenfile:: lgraph.h
+   :project: cpp_procedure
+
+lgraph_atomic
+------------------
+
+.. doxygenfile:: lgraph_atomic.h
+   :project: cpp_procedure
+
+lgraph_date_time
+------------------
+
+.. doxygenfile:: lgraph_date_time.h
+   :project: cpp_procedure
+
+lgraph_db
+------------------
+
+.. doxygenfile:: lgraph_db.h
+   :project: cpp_procedure
+
+lgraph_edge_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_edge_iterator
+------------------
+
+.. doxygenfile:: lgraph_edge_iterator.h
+   :project: cpp_procedure
+
+lgraph_exceptions
+------------------
+
+.. doxygenfile:: lgraph_exceptions.h
+   :project: cpp_procedure
+
+lgraph_galaxy
+------------------
+
+.. doxygenfile:: lgraph_galaxy.h
+   :project: cpp_procedure
+
+lgraph_result
+------------------
+
+.. doxygenfile:: lgraph_result.h
+   :project: cpp_procedure
+
+lgraph_rpc_client
+------------------
+
+.. doxygenfile:: lgraph_rpc_client.h
+   :project: cpp_procedure
+
+lgraph_traversal
+------------------
+
+.. doxygenfile:: lgraph_traversal.h
+   :project: cpp_procedure
+
+lgraph_txn
+------------------
+
+.. doxygenfile:: lgraph_txn.h
+   :project: cpp_procedure
+
+lgraph_types
+------------------
+
+.. doxygenfile:: lgraph_types.h
+   :project: cpp_procedure
+
+lgraph_utils
+------------------
+
+.. doxygenfile:: lgraph_utils.h
+   :project: cpp_procedure
+
+lgraph_vertex_index_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_index_iterator.h
+   :project: cpp_procedure
+
+lgraph_vertex_iterator
+------------------
+
+.. doxygenfile:: lgraph_vertex_iterator.h
+   :project: cpp_procedure
+
+olap_base
+------------------
+
+.. doxygenfile:: olap_base.h
+   :project: cpp_procedure
+
+olap_on_db
+------------------
+
+.. doxygenfile:: olap_on_db.h
+   :project: cpp_procedure
+
+olap_profile
+------------------
+
+.. doxygenfile:: olap_profile.h
+   :project: cpp_procedure
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
new file mode 100644
index 0000000000..696c9e4fcf
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/4.Python-procedure.rst
@@ -0,0 +1,25 @@
+.. TuGraph documentation master file, created by
+   sphinx-quickstart on Mon Jul 16 10:29:17 2018.
+   You can adapt this file completely to your liking, but it should at least
+   contain the root `toctree` directive.
+
+Python存储过程接口
+====================================
+Version: 4.5.1
+
+Copyright (C) 2018-2022 Ant Group.
+
+
+.. toctree::
+   :maxdepth: 2
+
+介绍
+------------------
+与 SQLite 和 Noe4j 类似，TuGraph 可以在嵌入式模式下工作。 在嵌入式模式下，它就像一个库。 您可以编写自己的应用程序并调用库函数来创建、查询和修改图。 在这种情况下，应用程序和图数据库之间的所有数据交换都在同一个进程中进行。 它非常简单高效。
+
+这是 TuGraph 嵌入模式的 python API 文档。 通过嵌入式API，用户可以打开或创建数据库，然后查询或修改数据库。
+
+接口
+------------------
+.. automodule:: liblgraph_python_api
+   :members:
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
new file mode 100644
index 0000000000..1db9127da9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/5.Rust-procedure.md
@@ -0,0 +1,19 @@
+# Rust 存储过程
+
+## 1. 介绍
+Rust 存储过程目前仅支持v1版本，TuGraph能够支持一切编译成动态库的语言作为插件。Rust语言作为系统编程语言的新起之秀，在安全性上、可靠性以及人体工程学上相较于C++具有较大优势。
+
+我们提供了TuGraph的[Rust binding]库来支持在Rust中调用lgrahp api，同时提供[tugraph-plugin-util] 工具库来帮助大家更加简洁地编写Rust插件代码。
+
+[Rust binding]: https://crates.io/crates/tugraph
+[tugraph-plugin-util]: https://crates.io/crates/tugraph-plugin-util
+
+## 2. 如何使用
+
+Rust存储过程的使用分三步：
+* 编译，从rust源码编译出so库。我们准备了一份一站式的插件编写教程，从IDE的插件安装，环境配置，到编译，详细参考`rust-tugraph-plugin-tutorial`。
+* 加载，将so库加载到服务端，可以通过REST或RPC接口，这一步和C++库的使用方式类似，可以参考[文档](1.procedure.md)。
+* 运行，和c++ procdure使用方式相同，不在赘述。
+
+## 3.API文档
+Rust社区习惯，所有的代码和文档都可以从[`crates.io`](https://crates.io/crates/tugraph )以及[`docs.rs`](https://docs.rs/tugraph/latest/tugraph )找到。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
new file mode 100644
index 0000000000..596b1b7f4b
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/Doxyfile
@@ -0,0 +1,2427 @@
+# Doxyfile 1.8.11
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "TuGraph Procedure API - C++"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         = 4.5.1
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = ./build
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = Chinese
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = YES
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../../../../../include/lgraph
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f, *.for, *.tcl,
+# *.vhd, *.vhdl, *.ucf, *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = YES
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst
new file mode 100644
index 0000000000..27a86697ca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst
@@ -0,0 +1,12 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   3.C++-procedure.rst
+   4.Python-procedure.rst
+   5.Rust-procedure.md
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
new file mode 100644
index 0000000000..81b77be986
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/1.procedure/index.rst.aci
@@ -0,0 +1,10 @@
+存储过程
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   1.procedure.md
+   2.traversal.md
+   5.Rust-procedure.md
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
new file mode 100644
index 0000000000..fccb77789a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/1.tutorial.md
@@ -0,0 +1,207 @@
+# OLAP API
+
+> 本文档是为TuGraph的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对TuGraph的图计算运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于Tugraph的一个简单的[BFS(宽度优先搜索)](https://en.wikipedia.org/wiki/Breadth-first_search "wikipedia")程序实例，我们将重点介绍其使用方式。
+
+## 1. TuGraph 图分析引擎介绍
+
+TuGraph的图分析引擎，面向的场景主要是全图/全量数据分析类的任务。借助TuGraph的 C++ / Python 图分析引擎 API ，用户可以对不同数据来源的图数据快速导出一个待处理的复杂子图，然后在该子图上运行诸如PageRank、LPA、WCC等迭代式图算法，最后根据运行结果做出相应的对策。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph图计算系统社区版内置6个算法，商业版内置了25种算法，用户几乎不需要自己实现具体的图计算过程。其详细介绍可参考algorithms.md。
+
+根据数据来源及实现不同，可分为Procedure、Embed和Standalone三种运行方式，均继承于OlapBase API，OlapBase API接口文档可参考olapbase-api.md。
+
+其中Procedure和Embed的数据来源是图数据库中预加载的db数据，可以分别编译生成tugraph-web加载使用的.so文件和后台终端使用的embed文件，输入的图数据均通过db的加载形式，其接口文档可参考olapondb-api.md。
+Standalone用于编译生成standalone文件，区别于前者，该文件的输入图数据通过txt、二进制、ODPS文件的形式加载，其接口文档可参考olapondisk-api.md。
+
+## 2. Procedure 编译与运行
+
+该种方式主要用于tugraph-web界面进行可视化加载及运行。使用方法如下：
+
+### C++:
+在tugraph-db/procedures 目录下执行`bash make_so_cpp.sh bfs`即可在tugraph-db/procedures目录下得到bfs.so文件，将该文件以插件形式上传至tugraph-web，输入参数后即可执行。
+
+### Python:
+在tugraph-web的前端将python文件以插件形式上传，输入参数后即可执行。
+
+示例：
+在tugraph-db/procedures 编译.so算法文件
+`bash make_so_cpp.sh bfs`
+
+将bfs.so（或tugraph-db/procedures/algo_cython/bfs.py）文件以插件形式加载至tugraph-web后，输入如下json参数：
+
+```json
+{
+    "root":"10",
+    "label":"user",
+    "field":"id"
+}
+```
+即可得到返回结果如下。
+
+```json
+{
+  "core_cost": 0.013641119003295898,
+  "found_vertices": 3829,
+  "num_edges": 88234,
+  "num_vertices": 4039,
+  "output_cost": 8.821487426757813e-06,
+  "prepare_cost": 0.03479194641113281,
+  "total_cost": 0.04844188690185547
+}
+```
+
+输出内容解释如下：
+- core_cost: 表示算法运行所需要的时间。
+- found_vertices: 表示查找到点的个数。
+- num_edges: 表示该图数据的边数量。
+- num_vertices: 表示该图数据点的数量。
+- output_cost: 表示算法结果写回db所需要的时间。
+- prepare_cost: 表示预处理阶段所需要的时间。预处理阶段的工作：加载参数、图数据加载、索引初始化等。
+- total_cost: 表示执行该算法整体运行时间。
+
+make_so.sh文件介绍：该文件用于将TuGraph-OLAP所涉及到的图算法文件编译成一个可供tugraph-web使用的.so文件。
+
+## 3. Embed 编译与运行
+
+该种方式主要用于TuGraph在后台程序中对预加载的db图数据进行算法分析。其使用方法如下：
+在tugraph-db/procedures 目录下对embed_main.cpp文件完善，补充数据名称、输入参数、数据路径等信息，示例如下：
+
+### C++:
+
+```C++
+#include <iostream>
+#include "lgraph/lgraph.h"
+#include "lgraph/olap_base.h"
+using namespace std;
+
+extern "C" bool Process(lgraph_api::GraphDB &db, const std::string &request, std::string &response);
+
+int main(int argc, char **argv) {
+    // db_path表示预加载图数据存放的路径
+    std::string db_path = "../fb_db/";
+    if (argc > 1)
+        db_path = argv[1];
+    lgraph_api::Galaxy g(db_path);
+    g.SetCurrentUser("admin", "73@TuGraph");
+    // 指定图数据的名称
+    lgraph_api::GraphDB db = g.OpenGraph("fb_db");
+    std::string resp;
+    // 以json形式输入算法参数
+    bool r = Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}", resp);
+    cout << r << endl;
+    cout << resp << endl;
+    return 0;
+}
+```
+保存后在tugraph-db/procedures 目录下执行`bash make_embed.sh bfs`即可在tugraph-db/procedures/algo_cpp 目录下得到bfs_procedure文件。
+
+在tugraph-db/procedures 文件夹下执行`./algo_cpp/bfs_procedure` 即可得到返回结果：
+
+```json
+{
+  "core_cost":0.025603055953979492,
+  "found_vertices":3829,
+  "num_edges":88234,
+  "num_vertices":4039,
+  "output_cost":9.059906005859375e-06,
+  "prepare_cost":0.056738853454589844,
+  "total_cost":0.0823509693145752
+}
+```
+
+参数解释同上。
+
+### Python：
+在tugraph-db/procedures文件夹下执行
+`bash make_so_cython.sh bfs`
+或在tugraph-db/procedures/algo_cython文件夹下执行
+`python3 setup.py build_ext -i`
+得到bfs.so后，在Python中import bfs可使用，如tugraph-db/procedures/run_embed.py所示
+
+```python
+# tugraph-db/procedures/run_embed.py
+from lgraph_db_python import *
+
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    galaxy = PyGalaxy("../build/output/lgraph_db")
+    galaxy.SetCurrentUser("admin", "73@TuGraph")
+    db = galaxy.OpenGraph("default", False)
+    res = python_plugin.Process(db, "{\"root_id\":\"0\", \"label\":\"node\",\"field\":\"id\"}".encode('utf-8'))
+    print(res)
+    del db
+    del galaxy
+```
+通过如下命令执行
+
+```bash
+python3 run_embed.py
+```
+
+输出结果与C++相同。
+
+## 4. Standalone 编译与运行
+
+该文件主要用于在终端处直接加载图数据，并运行打印输出结果。使用方法如下：
+在tugraph-db/build目录下执行`make bfs_standalone` (需要在g++默认include路径中包含boost/sort/sort.hpp)即可得到bfs_standalone文件,该文件生成于tugraph-db/build/output/algo文件夹下。
+运行方式：在tugraph-db/build目录下执行`./output/algo/bfs_standalone -–type [type] –-input_dir [input_dir] --id_mapping [id_mapping] -–vertices [vertices] --root [root] –-output_dir [output_dir]`即可运行。
+
+- `[type]`：表示输入图文件的类型来源，包含text文本文件、BINARY_FILE二进制文件和ODPS源。
+- `[input_dir]`：表示输入图文件的文件夹路径，文件夹下可包含一个或多个输入文件。TuGraph在读取输入文件时会读取[input_dir]下的所有文件，要求[input_dir]下只能包含输入文件，不能包含其它文件。参数不可省略。
+- `[id_mapping]`：当读入边表时，是否对输入数据做id映射，使达到符合算法运行的形式。1为需要做id映射，0为不需要做。该过程会消耗一定时间。参数可省略，默认值为0。
+- `[vertices]`：表示图的点个数，为0时表示用户希望系统自动识别点数量；为非零值时表示用户希望自定义点个数，要求用户自定义点个数需大于最大的点ID。参数可省略，默认值为0。
+- `[root]`：表示进行bfs的起始点id。参数不可省略。
+- `[output_dir]`：表示输出数据保存的文件夹路径，将输出内容保存至该文件中，参数不可省略。
+
+示例：
+
+### C++:
+在tugraph-db/build编译standalone算法程序
+
+```bash
+make bfs_standalone
+```
+
+在tugraph-db/build/output目录下运行text源文件
+
+```bash
+./output/algo/bfs_standalone --type text --input_dir ../test/integration/data/algo/fb_unweighted --root 0
+```
+
+得到运行结果：
+
+```text
+prepare_cost = 0.10(s)
+core_cost = 0.02(s)
+found_vertices = 3829
+output_cost = 0.00(s)
+total_cost = 0.11(s)
+DONE.
+```
+
+结果参数解释同上。
+
+对于新的算法，运行时不了解该算法的所需参数时，可通过`./output/algo/bfs_standalone -h`进行查阅对应参数。
+
+### Python:
+Python语言的bfs拓展编译过程与embed模式无区别，在运行时通过`Standalone`接口调用，示例如下：
+```python
+# tugraph-db/procedures/run_standalone.py
+import bfs as python_plugin
+
+if __name__ == "__main__":
+    python_plugin.Standalone(input_dir=
+                             "../test/integration/data/algo/fb_unweighted",
+                             root=0)
+```
+
+通过如下命令执行
+
+```bash
+python3 run_standalone.py
+```
+
+至此，通过TuGraph对上图进行bfs运算的过程已经完成。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
new file mode 100644
index 0000000000..6991d63290
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/2.olap-base-api.md
@@ -0,0 +1,179 @@
+# OlapBase API
+
+> 此文档主要详细介绍了OlapBase API的使用说明
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统需要的简单配置，同时结合代码对TuGraph中几个共同的重要文件和接口进行解释。
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+
+## 3. 原子操作
+
+TuGraph使用了多线程技术进行批处理操作，在这种情况下可能会出现访存冲突现象。为了保证并行计算时修改操作的正确性，TuGraph实现了原子操作。代码部分见lgraph文件夹下的lgraph_atomic.cpp文件。
+TuGraph还自定义了4个常用的原子操作。当我们需要在多线程模式下修改点的数据时，我们都应该使用原子操作来确保并行环境下修改操作的正确性。除了这4个原子操作外，用户也可以使用“cas”来构建自己的原子操作函数。
+
+- `bool cas(T * ptr, T oldv, T newv)`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `bool write_min(T *a, T b)`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `bool write_max(T *a, T b)`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `void write_add(T *a, T b)`：将b的值加到a指向的值上。
+- `void write_sub(T *a, T b)`：将a指向的值减去b的值。
+
+## 4. 点集合类ParallelBitset
+
+在使用TuGraph进行批处理操作时，需要使用点集合来表示需要处理的点。ParallelBitset实现了点集合类，以bit为单位表示点，因此能够节省大量内存。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 4.1 ParallelBitset类成员
+
+- `size_t Size()`：表示Bitmap中的点个数。
+- `ParallelBitset(size_t size)`：初始化size和data，data长度为(size >> 6)+1
+- `void Clear()`：清空集合
+- `void Fill()`：将所有点加入集合
+- `bool Has(size_t i)`：检查点i是否在集合中
+- `bool Add(size_t i)`：将点i加入集合中
+- `void Swap(ParallelBitset &other)`：和另一组ParallelBitset集合交换元素
+
+## 5. 点数组类ParallelVector
+
+在使用TuGraph进行批处理操作时，需要使用点数组来表示对点的处理结果。ParallelVector实现了点数组类。对应的代码见lgraph文件夹下的olap_base.h文件。
+
+### 5.1 ParallelVector类成员
+
+- `ParallelVector(size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `T &operator[](size_t i)`：下标为i的数据
+- `T *begin()`：ParallelVector的起始指针
+- `T *end()`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `T &Back()`：ParallelVector最后一个数据
+- `T *Data()`：表示数组本身数据
+- `void Destroy()`：清空ParallelVector数组内数据并删除数组
+- `size_t Size()`：表示ParallelVector中的数据个数
+- `size_t Capacity()`：表示ParallelVector的容量大小
+- `void Resize(size_t size)`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `void Clear()`：清空ParallelVector内数据
+- `void ReAlloc(size_t capacity)`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `void Fill(T elem)`：为ParallelVector的全部数据赋值为elem
+- `void Append(const T &elem, bool atomic = true)`：向ParallelVector结尾添加一个数据
+- `void Swap(ParallelVector<T> &other)`：和其他的ParallelVector交换数据
+- `ParallelVector<T> Copy()`：复制当前的ParallelVector数据存至Copy数组中
+
+## 6. 自定义数据结构
+
+### 6.1 基本数据类型
+
+我们自定义了点和边的数据结构表示，用于在覆盖所有点的同时节省内存空间：
+
+- `Empty`：内容为空的特殊数据类型。
+
+### 6.2 组合数据结构
+
+为了便于计算，我们根据计算场景不同，定义了几种点和边数据的数据结构，分别是：
+
+- `EdgeUnit<EdgeData>`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+  - `size_t src`：边的起始点
+  - `size_t dst`：边的终点
+  - `EdgeData edge_data`：边的权值
+- `AdjUnit<EdgeData>`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+  - `size_t neighbour`：边的邻居点
+  - `EdgeData edge_data`：边的权值
+- `AdjList<EdgeData>`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+  - `AdjUnit<T> * begin`：列表的起始指针
+  - `AdjUnit<T> * end`：列表的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对邻接表进行循环访问。
+
+## 7. 图类OlapBase
+
+图类OlapBase是TuGraph用于加载图以及进行图计算操作的主类，常用OlapBase<EdgeData>表示权值类型为EdgeData的图，代码部分见lgraph文件夹下的olap_base.hpp。本章将介绍Graph类中常用的类型和API接口。上文介绍Procedure、Embed及Standalone功能所使用的类均为该类的子类。
+
+### 7.1 基本信息
+
+- `size_t NumVertices()`：获取点数
+- `size_t NumEdges()`：获取边数
+- `size_t OutDegree(size_t vid)`：点vid的出度
+- `size_t InDegree(size_t vid)`：点vid的入度
+
+### 7.2 点集和边集及其相关操作
+
+- `ParallelVector<VertexData> AllocVertexArray<VertexData>()`：分配一个类型为VertexData的数组，大小为点个数
+- `void fill_vertex_array<V>(V * array, V value)`：将数组array中的所有元素赋值为value
+- `ParallelBitset AllocVertexSubset()`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `AdjList<EdgeData> OutEdges(size_t vid)`：获取点v的所有出边集合
+- `AdjList<EdgeData> InEdges(size_t vid)`：获取点v的所有入边集合
+- `void Transpose()`：对有向图进行图反转
+- `LoadFromArray(char * edge_array, VertexId input_vertices, EdgeId input_edges,  EdgeDirectionPolicy edge_direction_policy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+  - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+  - `input_vertices`：指定数组读入图的点个数。
+  - `input_edges`：指定数组读入图的边的条数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+### 7.3 锁机制
+
+TuGraph实现了一对锁机制，来控制程序对于点数据的访存权限。分别是：
+
+- `void AcquireVertexLock(size_t vid)`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(size_t vid)`：对点vid解锁，所有线程均可访存该锁对应的点数据
+- `VertexLockGuard GuardVertexLock(size_t vid)`：在对vid操作时，对点vid加锁，退出作用域时时自动释放锁
+
+### 7.4 批处理操作
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程。分别是：
+
+```c++
+/*
+    函数名称:ReducedSum ProcessVertexInRange(std::function<ReducedSum(size_t)> work, size_t lower, size_t upper,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+    第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考include/lgraph/olap_base.h中具体代码
+
+    使用示例:统计数组parent数组中有出边的点个数
+*/
+
+auto vertex_num = graph.ProcessVertexInRange<size_t>(
+    [&](size_t i) {
+        if (graph.OutDegree(parent[i]) > 0) {
+            return 1;
+        }
+    },
+    0, parent.Size()
+);
+printf("the number is %lu\n",vertex_num);
+```
+
+其中graph为图类OlapBase的实例化对象
+
+```C++
+/*
+    函数名称:ReducedSum ProcessVertexActive(std::function<ReducedSum(size_t)> work, ParallelBitset &active_vertices,
+                ReducedSum zero = 0,std::function<ReducedSum(ReducedSum, ReducedSum)> reduce =reduce_plus<ReducedSum>)
+				
+    函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+    第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+    具体实现请参考/include/lgraph/olap_base.h中具体代码
+    
+    使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+*/
+
+auto active_in = graph.AllocVertexSubset();
+active_in.Add(1);
+active_in.Add(2);
+active_in.Add(3);
+auto total_outdegree = graph.ProcessVertexActive<size_t>(
+    [&](size_t vi) {
+        size_t local_outdegree = 0;
+        for (auto & edge : graph.OutEdges(vi)) {
+            size_t dst = edge.neighbour;
+            printf("node %lu has neighbour %lu\n",vi,dst);
+            local_outdegree += 1;
+        }
+        return local_outdegree;
+    },
+    active_in
+);
+printf("total outdegree of node1,2,3 is %lu\n",total_outdegree);
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
new file mode 100644
index 0000000000..1e94fb946e
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/3.olap-on-db-api.md
@@ -0,0 +1,296 @@
+# OlapOnDB API
+
+> 此文档主要详细介绍了OlapOnDB API的使用说明
+
+
+## 1. 简介
+
+一般用户需要自己实现的只是将需要分析的子图抽取出来的过程。用户也可以通过使用TuGraph中丰富的辅助接口实现自己的图分析算法。
+
+该文档主要介绍Procedure及Embed的接口设计，并介绍部分常用接口，具体的接口信息参见include/lgraph/olap_on_db.h文件。
+
+## 2. 模型
+
+Procedure及Embed使用到的辅助函数主要包含在OlapOnDB类，还有一些使用频率较高的函数都会逐一介绍
+
+在TuGraph中OLAP相关的有以下常用的数据结构：
+
+1. DB图分析类 `OlapOnDB<EdgeData>`
+2. 点数组`ParallelVector<VertexData>`
+3. 点集合`ParallelBitset`
+4. 边数据结构`AdjUnit/AdjUnit<Empty>`
+5. 边集合数据结构`AdjList<EdgeData>`
+
+### 2.1 基于快照的存储结构
+
+TuGraph中的OlapOnDB类能够提供数据“快照”，即建立一个对指定数据集的完全可用拷贝，该拷贝包括相应数据在某个时间点（拷贝开始的时间点）的镜像。由于OLAP的操作仅涉及读操作而不涉及写操作，OlapOnDB会以一种更紧凑的方式对数据进行排布，在节省空间的同时，提高数据访问的局部性。
+
+### 2.2 BSP计算模型
+
+TuGraph在计算的过程中使用了BSP（Bulk Synchronous Parallel）模型，使得该过程能够并行执行，极大的提高了程序运行效率。
+
+BSP计算模型的核心思路为超步（Super Step）的提出和使用。在OlapOnDB创建后，在该数据上的计算分为多个超步，比如PageRank，分为多轮迭代，每轮迭代就是一个超步。不同超步之间用存在显式同步，从而保证所有线程在完成同一超步后同时进入下一个超步。在一个超步内部，所有的线程异步执行，利用并行提升计算效率。
+
+利用BSP计算模型能够有效避免死锁，通过障碍同步的方式能够以硬件方式实现粗粒度的全局同步，使得图计算能够并行化执行，而程序员无需在同步互斥上大费周章。
+
+## 3. 算法举例
+
+在这里对PageRank算法分块做解释，大体上分为主函数`Process`和PageRank算法流程`PageRank`函数
+
+### 3.1 主函数
+
+主函数输入有三个参数，`TuGraph`数据库参数`db`，从网页端获取的请求`request`，给网页端的返回值`response`，整体流程可以分为一下几步：
+
+1. 相关参数的获取
+2. 快照类的创建
+3. PageRank算法主流程
+4. 网页端返回值的获取和发送
+
+```C++
+extern "C" bool Process(GraphDB & db, const std::string & request, std::string & response) {
+    
+    // 从网页端请求中获取迭代次数（num_iterations），
+    int num_iterations = 20;
+    try {
+        json input = json::parse(request);
+        num_iterations = input["num_iterations"].get<int>();
+    } catch (std::exception & e) {
+        throw std::runtime_error("json parse error");
+        return false;
+    }
+
+    // 读事务的创建以及快照类的创建
+    auto txn = db.CreateReadTxn();
+    OlapOnDB<Empty> olapondb(
+        db,
+        txn,
+        SNAPSHOT_PARALLEL
+    );
+	
+    // 创建pr数组用于存储每个节点的pr值
+    ParallelVector<double> pr = olapondb.AllocVertexArray<double>();
+    // pagerank算法主流程，获取每个节点的pagerank值
+    PageRankCore(olapondb, num_iterations, pr);
+    
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    /*
+        函数用途：从所有节点中获取pagerank值最大的节点编号
+    
+        函数流程描述：该函数对点集合all_vertices中所有为1的位对应的节点vi（又称为活跃点）执行Func A，再将Func A的返回值作为Func B的第二个输入参数，得到局部最大值（因为第一个输入参数为0，因此实际上返回值就是每个节点的pagerank值），最后再将所有线程的返回值汇总，再次 执行Func B得到全局返回值，并存入max_pr_vi变量中
+    */
+    size_t max_pr_vi = olapondb.ProcessVertexActive<size_t>(
+        
+        //Func A
+        [&](size_t vi) {
+            return vi;
+        },
+        all_vertices,
+        0,
+        
+        //Func B
+        [&](size_t a, size_t b) {
+            return pr[a] > pr[b] ? a : b;
+        }
+    );
+    
+    // 网页端返回值的获取和发送
+    json output;
+    output["max_pr_vid"] = olapondb.OriginalVid(max_pr_vi);
+    output["max_pr_val"] = pr[max_pr_vi];
+    response = output.dump();
+    return true;
+}
+```
+
+### 3.2 PageRank算法流程
+
+`pagerank`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关数据结构的初始化
+1. 每个节点pagerank值的初始化
+1. 每个节点pagerank值的计算，活跃点为所有点（意味着所有点都需要计算pagerank值）
+1. 得到每个节点经过`num_iterations`次迭代后的pagerank值
+
+```C++
+void PageRankCore(OlapBase<Empty>& graph, int num_iterations, ParallelVector<double>& curr) {
+    
+    // 相关数据结构的初始化
+    auto all_vertices = olapondb.AllocVertexSubset();
+    all_vertices.Fill();
+    auto curr = olapondb.AllocVertexArray<double>();
+    auto next = olapondb.AllocVertexArray<double>();
+    size_t num_vertices = olapondb.NumVertices();
+    double one_over_n = (double)1 / num_vertices;
+
+    // 每个节点pagerank值的初始化，和该节点的出度成反比
+    double delta = graph.ProcessVertexActive<double>(
+        [&](size_t vi) {
+            curr[vi] = one_over_n;
+            if (olapondb.OutDegree(vi) > 0) {
+                curr[vi] /= olapondb.OutDegree(vi);
+            }
+            return one_over_n;
+        },
+        all_vertices);
+
+    // 总迭代过程
+    double d = (double)0.85;
+        for (int ii = 0;ii < num_iterations;ii ++) {
+        printf("delta(%d)=%lf\n", ii, delta);
+        next.Fill((double)0);
+
+        /*
+            函数用途：计算所有节点的pagerank值
+
+            函数流程描述：该函数用于计算所有节点的pagerank值，对all_vertices中所有为1的位对应的节点vi执行Func C，得到本轮迭代中vi的pagerank值，并返回vi节点的pagerank变化值，最终经过函数内部处理汇总所有活跃节点的总变化值并返回，该值被存储在delta变量中
+        */
+        delta = graph.ProcessVertexActive<double>(
+            // Func C
+            [&](size_t vi) {
+                double sum = 0;
+
+                // 从邻居中获取当前节点的pagerank值
+                for (auto & edge : olapondb.InEdges(vi)) {
+                    size_t src = edge.neighbour;
+                    sum += curr[src];
+                }
+                next[vi] = sum;
+
+                // pagerank值计算核心公式
+                next[vi] = (1 - d) * one_over_n + d * next[vi];
+                if (ii == num_iterations - 1) {
+                    return (double)0;
+                } else {
+    
+                    // 相关中间变量统计
+                    if (olapondb.OutDegree(vi) > 0) {
+                        next[vi] /= olapondb.OutDegree(vi);
+                        return fabs(next[vi] - curr[vi]) * olapondb.OutDegree(vi);
+                    } else {
+                        return fabs(next[vi] - curr[vi]);
+                    }
+                }
+            },
+            all_vertices
+        );
+
+        // 将本轮迭代得到的pagerank值输出作为下一轮迭代的输入
+        curr.Swap(next);
+    }
+}
+```
+
+## 4. 其他常用函数功能描述
+
+### 4.1 事务的创建
+
+```C++
+//读事务的创建
+auto txn = db.CreateReadTxn();
+
+//写事务的创建
+auto txn = db.CreateWriteTxn();
+```
+
+### 4.2 并行化创建有向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL
+)
+```
+
+### 4.3 并行化创建无向图
+
+```C++
+OlapOnDB<Empty> olapondb(
+    db,
+    txn,
+    SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED
+)
+```
+
+### 4.4 获取出度
+
+```C++
+size_t OutDegree(size_t vid)
+```
+
+### 4.5 获取入度
+
+```C++
+size_t InDegree(size_t vid)
+```
+
+### 4.6 获取出边集合
+
+```C++
+/*
+    函数名称：AdjList<EdgeData> OutEdges(size_t vid)
+    数据结构:
+        AdjList 可以理解为类型为AdjUnit结构体的数组
+        AdjUnit 有两个成员变量： 1. size_t neighbour 2. edge_data，其中neighbour表示该出边指向的目标节点编号，如果为有权图，则edge_data数据类型和输入文件中边的权重值相同，否则数据类型为Empty
+
+    使用示例：输出节点vid的所有出度邻居
+*/
+for (auto & edge : olapondb.OutEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.7 获取入边集合
+
+```C++
+AdjList<EdgeData> InEdges(size_t vid)
+
+// 使用示例：输出节点vid的所有入度邻居
+for (auto & edge : olapondb.InEdges(vid)) {
+    size_t dst = edge.neighbour;
+    printf("src = %lu,dst = %lu\n",vid,dst);
+}
+```
+
+### 4.8 获取TuGraph中节点对应OlapOnDB的节点编号
+
+```C++
+size_t OriginalVid(size_t vid)
+
+// 备注： TuGraph中输入的节点编号可以是非数字，比如人名等，在生成OlapOnDB子图的时候，会将人名等转化为数字进行后续处理，因此该方法可能不适用于某些特定场景
+```
+
+### 4.9 获取OlapOnDB中节点对应TuGraph的节点编号
+
+```C++
+size_t MappedVid(size_t original_vid)
+```
+
+### 4.10 活跃点的描述
+
+活跃点指的是在批处理函数中需要处理的点，在本例子中只是输出了活跃点的编号，并且汇总活跃点的数量：
+
+```C++
+ParallelBitset temp = 000111;	//当前活跃点为3，4，5号点
+
+size_t delta = ForEachActiveVertex<double>(
+    //void c
+    [&](size_t vi) {
+        printf("active_vertexId = %lu\n",vi);
+        return 1;
+    },
+    all_vertices
+);
+```
+
+函数的运行结果显而易见，因为多线程的关系，一下输出顺序可能有所变化：
+
+```
+active_vertexId = 3
+active_vertexId = 4
+active_vertexId = 5
+```
+
+局部返回值均为1，该函数会在保证线程安全的情况下将所有的局部返回值累加得到最终的返回值，并存储在`delta`变量中，该值最终为3
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
new file mode 100644
index 0000000000..1ece4cc8e2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/4.olap-on-disk-api.md
@@ -0,0 +1,202 @@
+# OlapOnDisk API
+
+> 此文档主要详细介绍了OlapOnDisk API的使用说明
+
+    
+## 1. 简介
+
+TuGraph的Standalone模式可用于加载图数据文件，其中图数据文件来源可包含text文本文件、BINARY_FILE二进制文件和ODPS源。在该模式下，TuGraph可实现多数据来源快速加载成图，然后在该图上运行如BFS、WCC、SSSP等迭代式算法，并输出最终结果至终端。
+
+在TuGraph中，导出和计算过程均可以通过在内存中并行处理的方式进行加速，从而达到近乎实时的处理分析，和传统方法相比，即避免了数据导出落盘的开销，又能使用紧凑的图数据结构获得计算的理想性能。
+
+TuGraph内置了大量的常见图分析算法和丰富的辅助接口，因此用户几乎不需要自己实现具体的图计算过程，只需要在实现自己的存储过程的时候将相应算法库的头文件(.h)包含到自己的程序中，并在编译阶段链接自己的动态库文件即可。
+
+该文档主要介绍了Standalone的常用接口，使用到的辅助函数主要包含在OlapOnDB类。同时为帮助用户理解方便，对BFS算法进行举例说明。
+
+## 2. 算法举例
+
+在这里对BFS算法分块做解释，大体上分为主函数`main`、BFS算法流程`BFSCore`函数和配置类MyConfig。
+
+### 2.1 头文件
+
+```C++
+#include "olap/olap_on_disk.h"   
+#include "tools/json.hpp"      //使用 TuGraph 时需要包含的头文件
+#include "./algo.h"   //包含各种算法逻辑函数的头文件
+```
+
+在使用 TuGraph 实现图数据文件计算应用时，一般首先建立StandaloneGraph类对象graph，将图文件数据加载进graph中，之后通过调用图逻辑函数实现图计算过程，最后对图计算的结果进行打印输出。
+
+### 2.2 配置类MyConfig
+
+MyConfig配置类函数用于提供算法逻辑计算时所需的配置信息，继承于ConfigBase<EdgeData>,其中EdgeDate可根据加载图类型不同选择Empty（无权图）、int（带权图权重为整数）或者double（带权图权重为double）类型。
+
+MyConfig配置类一般根据算法不同，需要额外配置信息如下：
+
+1.算法所需参数
+2.算法名称
+3.配置类内Print函数
+其余公用成员继承与ConfigBase，可参考src/olap/olap_config.h查阅。
+
+```C++
+class MyConfig : public ConfigBase<Empty> {
+ public:
+
+    // 算法所需参数初始化
+    size_t root = 0;
+    std::string name = std::string("bfs");
+    void AddParameter(fma_common::Configuration & config) {
+        ConfigBase<Empty>::AddParameter(config);
+        config.Add(root, "root", true)
+                .Comment("the root of bfs");
+    }
+    void Print() {
+        ConfigBase<Empty>::Print();
+        std::cout << "  name: " << name << std::endl;
+        if (root != size_t(-1)) {
+            std::cout << "  root: " << root << std::endl;
+        } else {
+            std::cout << "  root: UNSET" << std::endl;
+        }
+    }
+    // 配置文件接受命令行参数，该用例会顺次读取命令行调用算法时的参数，优先使用用户指定数值，若用户并未指定则选择默认参数。
+    MyConfig(int &argc, char** &argv): ConfigBase<Empty>(argc, argv) {
+        fma_common::Configuration config;
+        AddParameter(config);
+        config.ExitAfterHelp(true);
+        config.ParseAndFinalize(argc, argv);
+        Print();
+    }
+};
+```
+
+### 2.3 主函数
+
+```C++
+int main(int argc, char** argv) {
+    double start_time;
+    // 统计内存消耗类MemUsage实例化
+    MemUsage memUsage;
+    memUsage.startMemRecord();
+
+    // prepare
+    start_time = get_time();
+    // 配置类MyConfig实例化
+    MyConfig config(argc, argv);
+    size_t root_vid = config.root;
+    // OlapOnDisk类实例化
+    OlapOnDisk<Empty> graph;
+    graph.Load(config, DUAL_DIRECTION);
+    memUsage.print();
+    memUsage.reset();
+    // 统计图加载消耗时间
+    auto prepare_cost = get_time() - start_time;
+    printf("prepare_cost = %.2lf(s)\n", prepare_cost);
+
+    // core
+    start_time = get_time();
+    // 创建数组用于统计某节点是否遍历过
+    auto parent = graph.AllocVertexArray<size_t>();
+    // 宽度优先搜索算法，返回图内root_vid根结点连接的节点个数
+    size_t count = BFSCore(graph, root_vid, parent);
+    memUsage.print();
+    memUsage.reset();
+    auto core_cost = get_time() - start_time;
+    printf("core_cost = %.2lf(s)\n", core_cost);
+
+    // output
+    start_time = get_time();
+    // 打印相关信息至终端
+    printf("found_vertices = %ld\n", count);
+    auto output_cost = get_time() - start_time;
+    printf("output_cost = %.2lf(s)\n", output_cost);
+
+    printf("total_cost = %.2lf(s)\n", prepare_cost + core_cost + output_cost);
+    printf("DONE.");
+
+    return 0;
+}
+```
+
+### 2.4 bfs算法流程
+
+`bfs`主流程有两个输入参数，快照类（子图）还有迭代次数，整体流程可以分为以下几步：
+
+1. 相关定义、数据结构的初始化
+2. 使用批处理函数对每个节点进行循环计算，每一轮找到与当前节点相邻的全部节点，并在该轮次终止时进行交换。
+3. 直到找到全部节点，返回节点个数discovered_vertices。
+
+```C++
+size_t BFSCore(Graph<Empty>& graph, size_t root_vid, ParallelVector<size_t>& parent){
+
+  size_t root = root_vid;
+  auto active_in = graph.AllocVertexSubset();   //分配数组，active_in用于存放上一循环阶段已找到的节点
+  active_in.Add(root);            //把跟节点加入数组中
+  auto active_out = graph.AllocVertexSubset();  //分配数组active_out用于存放当前循环阶段找到的节点
+  parent.Fill((size_t)-1);               //将parent数组中的节点赋值为-1，-1表示未被找到
+  parent[root] = root;
+  size_t num_activations = 1;       //表示当前循环阶段找到的节点个数
+  size_t discovered_vertices = 0;    //表示当前循环阶段找到节点的总个数
+
+  for (int ii = 0; num_activations != 0; ii++) {       //num_activations表示当前循环阶段找到的节点个数
+      printf("activates(%d) <= %lu\n", ii, num_activations);
+      discovered_vertices += num_activations;         //discovered_vertices表示当前循环阶段找到节点的总个数
+      active_out.Clear();
+      num_activations = graph.ProcessVertexActive<size_t>(
+          [&](size_t vi) {
+              size_t num_activations = 0;
+              for (auto& edge : graph.OutEdges(vi)) {   //每一次循环从根节点出发，查找邻近的相邻节点，对其parent值改变，并num_activations+1操作
+                  size_t dst = edge.neighbour;
+                  if (parent[dst] == (size_t)-1) {
+                      auto lock = graph.GuardVertexLock(dst);
+                      if (parent[dst] == (size_t)-1) {
+                          parent[dst] = vi;
+                          num_activations += 1;
+                          active_out.Add(dst);       //存放当前循环阶段找到的节点
+                      }
+                  }
+              }
+              return num_activations;
+          },
+          active_in);
+      active_in.Swap(active_out);
+  }
+  // 返回全部节点数
+  return discovered_vertices;
+}
+```
+
+## 3. 其他常用函数功能描述
+
+### 3.1 图加载
+
+TuGraph-Standalone对于图数据文件的加载来源主要分为三大类：文本文件、二进制文件和ODPS。二进制文件为将边数据的二进制表示按顺序排列的文件，能够节省大量存储空间。其加载函数分为三种，分别是：
+
+- `void Load(ConfigBase<EdgeData> config,EdgeDirectionPolicy edge_direction_policy = DUAL_DIRECTION)`：图数据文件的加载方式，包含两个参数，其含义分别表示：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。其中DUAL_DIRECTION为默认的图加载方式。
+  DUAL_DIRECTION : 输入文件为非对称图，加载图为非对称图。
+  MAKE_SYMMETRIC : 输入文件为非对称图，加载图为对称图。
+  INPUT_SYMMETRIC : 输入文件为对称图，加载图为对称图。
+  对应的详细介绍见lgraph文件夹下的olap_config.h文件的`enum EdgeDirectionPolicy`。
+
+- `void LoadVertexArrayTxt<V>(V * array, std::string path, std::function<size_t(const char *, const char *, VertexUnit<V> &)> parse_line)`：将文件中的点-数据对按照点id的顺序加载到数组中。各参数表示意义分别为：
+  - `array`：待读入数据的数组
+  - `path`：读取文件的路径，文件中每行表示一对点-数据对
+  - `parse_line`：用户自定义函数，告诉系统如何将一行文本数据解析为一个点-数据对。
+
+
+### 3.2 图写入
+- `void Write(ConfigBase<EdgeData> & config, ParallelVector<VertexData>& array, size_t array_size, std::string name, std::function<bool(VertexData &)> filter_output = filter_output_default<VertexData&>)`：把array中数据写回文件中，各参数表示意义分别是：
+  - `config`：需要加载的配置参数。该参数内保存了该图的一般信息（如数据来源，算法名称，数据输入、输出路径，点个数等）以及根据不同数据来源、不同算法所配置的不同信息参数。
+  - `array`：待写入数据的数组
+  - `array_size`：待写入数据的数字长度
+  - `name`：算法名称
+  - `filter_output`：写入数据规则函数，待写入数据需要满足该函数的要求。
+
+### 3.3 图解析函数
+- `std::tuple<size_t, bool> parse_line_unweighted(const char *p, const char *end, EdgeUnit<EdgeData> &e)`：对图数据文件进行解析，加载图为无权图。
+
+- `std::tuple<size_t, bool> parse_line_weighted(const char* p, const char* end, EdgeUnit<EdgeData>& e)`：对图数据文件进行解析，加载图为有权图，权重数据类型可以通过修改<EdgeData>指定。
+
+该函数可通过MyConfig类定义时的构造函数parse_line进行指定。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
new file mode 100644
index 0000000000..0498446303
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/5.python-api.md
@@ -0,0 +1,404 @@
+# Python Olap API
+
+> 本文档主要介绍 OlapBase OlapOnDB 和 OlapOnDisk 在Python中的API用法
+
+
+## 1. 概述
+
+本手册将介绍使用TuGraph图计算系统Python接口需要的简单配置，同时结合代码对TuGraph Python API进行解释。关于ParallelBitset、OlapBase各类的作用，详见olap-base-api.md，olap-on-db-api.md和olap-on-disk-api.md
+
+## 2. 配置要求
+
+如果要使用TuGraph图计算编写以及编译自己的应用程序，需要的配置要求为：
+
+- linux操作系统，目前在Ubuntu16.04, Ubuntu18.04, Ubuntu20.04和Centos7, Centos8系统上可成功运行。
+- 支持C++17的编译器，要求GCC版本为8.4.0或更新的版本。
+- Cython，版本要求3.0.0以上，已测试可运行版本为3.0.0a11
+
+## 3. Cython
+Cython是一种高效的编程语言，是Python的超集。Cython能将py文件翻译为C/C++代码后编译为Python拓展类，在Python中通过import调用。在TuGraph中，所有的Python plugin都由Cython编译为Python拓展类后使用。
+
+Cython的Pure Python模式在保证Python语法的同时具有C/C++的性能，TuGraph Python接口均使用Cython实现。
+
+[Cython 文档](https://cython.readthedocs.io/en/latest/index.html)
+
+## 4. Olap API
+见procedures/algo_cython/olap_base.pxd文件，用法与功能基本与C++接口相同，olap_base.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### 原子操作
+- `cas[T](ptr: cython.pointer(T), oldv: T, newv: T)-> cython.bint`：如果ptr指向的值等于oldv，则将ptr指向的值赋为newv并返回true，否则返回false
+- `write_min[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更小，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_max[T](a: cython.pointer(T), b: T)-> cython.bint`：如果b比a指向的值更大，那么将a指向的值赋为b并返回true，否则返回false。
+- `write_add[T](a: cython.pointer(T), b: T)-> cython.bint`：将b的值加到a指向的值上。
+- `write_sub[T](a: cython.pointer(T), b: T)-> cython.bint`：将a指向的值减去b的值。
+
+### 点集合类ParallelBitset
+- `Size()-> size_t`：表示Bitmap中的点个数。
+- `ParallelBitset(size: size_t)`：初始化size和data，data长度为(size >> 6)+1
+- `Clear()-> cython.void`：清空集合
+- `Fill()-> cython.void`：将所有点加入集合
+- `Has(size_t i)-> cython.bint`：检查点i是否在集合中
+- `Add(size_t i)-> cython.bint`：将点i加入集合中
+- `Swap(ParallelBitset &other)-> cython.void`：和另一组ParallelBitset集合交换元素
+
+### 点数组类ParallelVector
+- `ParallelVector[T](size_t capacity)` 构建ParallelVector，capacity为点数组的初始容量大小
+- `operator[](i: size_t)-> T`：下标为i的数据
+- `begin()-> cython.pointer(T)`：ParallelVector的起始指针
+- `end()-> cython.pointer(T)`：ParallelVector的结束指针。begin和end的用法类似于vector容器的begin和end指针，可以使用这两个指针对数组进行顺序访问
+- `Back()-> T`：ParallelVector最后一个数据
+- `Data()-> cython.pointer(T)`：表示数组本身数据
+- `Destroy()-> cython.void`：清空ParallelVector数组内数据并删除数组
+- `Size()-> size_t`：表示ParallelVector中的数据个数
+- `Resize(size: size_t)-> cython.void`：更改ParallelVector为size大小，该size应大于等于更改前的大小且小于capacity
+- `Clear()-> cython.void`：清空ParallelVector内数据
+- `ReAlloc(capacity: size_t)-> cython.void`：给ParallelVector分配新的容量大小，若数组有数据则将数据迁移至新内存
+- `Fill(elem: T)-> cython.void`：为ParallelVector的全部数据赋值为elem
+- `Append(elem: T, atomic: cython.bint = true)-> cython.void`：向ParallelVector结尾添加一个数据
+- `Swap(other: ParallelVector[T])-> cython.void`：和其他的ParallelVector交换数据
+- `Copy()-> ParallelVector[T]`：复制当前的ParallelVector数据存至Copy数组中
+
+### 自定义数据结构
+- `Empty`：内容为空的特殊数据类型。
+- `EdgeUnit[EdgeData]`：表示权值类型为EdgeData的边，用于解析输入文件，包含三个成员变量：
+    - `src: size_t`：边的起始点
+    - `dst: size_t`：边的终点
+    - `edge_data: EdgeData`：边的权值
+- `AdjUnit[EdgeData]`：表示权值类型为EdgeData的边，用于批处理计算过程中，包含两个成员变量：
+    - `neighbour: size_t`：边的邻居点
+    - `edge_data: EdgeData`：边的权值
+- `AdjList[EdgeData]`：权值类型为EdgeData的点的邻接表，常用于表示点的入边和出边集合，包含两个成员变量：
+    - `begin()-> cython.pointer(AdjUnit[T])`：列表的起始指针
+    - `end()-> cython.pointer(AdjUnit[T])`：列表的结束指针。
+    - `operator[](i: size_t)-> AdjUnit[EdgeData]`: 下标为i的数据
+
+### 图类OlapBase
+- `NumVertices()-> size_t`：获取点数
+- `NumEdges()-> size_t`：获取边数
+- `OutDegree(size_t vid)-> size_t`：点vid的出度
+- `InDegree(size_t vid)-> size_t`：点vid的入度
+
+- `AllocVertexArray[VertexData]() ->ParallelVector[VertexData]`：分配一个类型为VertexData的数组，大小为点个数
+- `AllocVertexSubset()-> ParallelBitset`：分配一个ParallelBitset集合，用于表示所有点的状态是否激活
+- `OutEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有出边集合
+- `InEdges(vid: size_t)-> AdjList[EdgeData]`：获取点v的所有入边集合
+- `Transpose()-> cython.void`：对有向图进行图反转
+- `LoadFromArray(edge_array: cython.p_char, input_vertices: size_t, input_edges: size_t, edge_direction_policy: EdgeDirectionPolicy)`：从数组中加载图数据，包含四个参数，其含义分别表示：
+    - `edge_array`：将该数组中的数据读入图，一般情况下该数组包含多条边。
+    - `input_vertices`：指定数组读入图的点个数。
+    - `input_edges`：指定数组读入图的边的条数。
+    - `edge_direction_policy`：指定图为有向或无向，包含三种模式，分别为DUAL_DIRECTION、MAKE_SYMMETRIC以及INPUT_SYMMETRIC。对应的详细介绍见include/lgraph/olap_base.h文件的`enum EdgeDirectionPolicy`。
+
+- `AcquireVertexLock(vid: size_t)-> cython.void`：对点vid加锁，禁止其它线程对该锁对应的点数据进行访存
+- `void ReleaseVertexLock(vid: size_t)-> cython.void`：对点vid解锁，所有线程均可访存该锁对应的点数据
+
+TuGraph提供了两个批处理操作来并行地进行以点为中心的批处理过程，在Python中与C++使用方法稍有不同。
+
+```python
+# 函数名称:ProcessVertexInRange[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           lower: size_t, upper: size_t,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#     函数用途:对Graph中节点编号介于lower和upper之间的节点执行work函数。第四个参数表示累加的基数，默认为0；
+#     第五个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#     具体实现请参考include/lgraph/olap_base.h中具体代码
+#
+#     使用示例:统计数组parent数组中有出边的点个数
+
+import cython
+from cython.cimports.olap_base import *
+
+
+@cython.cclass
+class CountCore:
+    graph: cython. pointer(OlapBase[Empty])
+    parent: ParallelVector[size_t]
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        if self.graph.OutDegree(self.parent[vi]) > 0:
+            return 1
+        return 0
+
+    def run(self, pointer_g: cython. pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.parent = self.graph.AllocVertexArray[size_t]()
+        vertex_num: size_t
+        vertex_num = self.graph.ProcessVertexInRange[size_t, CountCore](self.Work, 0, self.parent.Size(), self)
+        print("the number is", vertex_num)
+
+if __name__ == "__main__":
+    count_core = CountCore()
+    count_core.run(cython.address(g))
+```
+其中g为图类OlapBase的实例化对象
+
+```python
+# 函数名称:ProcessVertexActive[ReducedSum, Algorithm](
+#           work: (algo: Algorithm, vi: size_t)-> ReducedSum,
+#           active: ParallelBitset,
+#           algo: Algorithm,
+#           zero: ReducedSum = 0,
+#           reduce: (a: ReducedSum, b: ReducedSum)-> ReducedSum = reduce_plus[ReducedSum])
+#
+#   函数用途:对active_vertices中对应为1的节点执行work函数，第三个参数表示累加的基数，默认为0；
+#   第四个参数表示对每个work处理后的节点返回值进行迭代reduce函数操作，默认为累加操作。
+#   具体实现请参考/include/lgraph/olap_base.h中具体代码
+#
+# 使用示例:输出Graph中节点1，2，3的所有出度邻居，并统计这三个节点的总出度
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.libc.stdio import printf
+
+
+@cython.cclass
+class NeighborCore:
+    graph: cython.pointer(OlapBase[Empty])
+    active_in: ParallelBitset
+
+    @cython.cfunc
+    @cython.nogil
+    def Work(self, vi: size_t) -> size_t:
+        degree = self.graph.OutDegree(vi)
+        dst: size_t
+        edges = self.graph.OutEdges(vi)
+        local_out_degree: size_t
+        for i in range(degree):
+            dst = edges[i].neighbour
+            printf("node %lu has neighbour %lu\n", vi, dst)
+            local_out_degree += 1
+        return local_out_degree
+
+    def run(self, pointer_g: cython.pointer(OlapBase[Empty])):
+        self.graph = pointer_g
+        self.active_in = self.graph.AllocVertexSubset()
+        self. active_in. Add(1)
+        self. active_in. Add(2)
+        self. active_in. Add(3)
+        total_outdegree = cython.declare(
+            size_t,
+            self.graph.ProcessVertexActive[size_t, CountCore](self.Work, self.active_in, self))
+        printf("total outdegree of node1,2,3 is %lu\n",total_outdegree)
+
+if __name__ == "__main__":
+    neighbor_core = NeighborCore()
+    neighbor_core.run(cython.address(g))
+```
+
+如上面两个例子所展示，在Python中ProcessVertexActive与ProcessVertexInRange比在C++中额外需要一个算法类指针参数，Work函数一般也作为该算法类的成员函数，满足Work函数访问成员变量的需求（如图graph，点数组parent），在调用批处理函数时将Work函数和算法类的self指针传入批处理函数。
+
+其中Work函数会在多线程中调用，因此加上修饰器`@cython.nogil`释放Python全局解释锁，在多线程执行的代码中（例如批处理函数中的Work函数，`cython.parallel.prange`中），不能包含Python对象，最好通过`dst: type`或者`dst = cython.declare(type)`的方式声明变量为C/C++类型。
+
+### 图类OlapOnDB:
+并行化创建有向图：
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL)
+```
+并行化创建无向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_UNDIRECTED)
+```
+ID_MAPPING创建有向图
+```python
+olapondb = OlapOnDB[Empty](db, txn, SNAPSHOT_PARALLEL | SNAPSHOT_IDMAPPING)
+```
+
+### 图类OlapOnDisk
+
+#### ConfigBase：
+- `ConfigBase()`: 构造函数
+- `std::string input_dir`: 图边表数据路径
+- `std::string output_dir`: 输出结果路径
+
+
+- `Load(config: ConfigBase[EdgeData], edge_direction_policy: EdgeDirectionPolicy)-> void`: 读入图数据
+
+
+## 5. lgraph_db API
+见procedures/algo_cython/lgraph_db.pxd与lgraph_db_python.py文件。
+
+lgraph_db.pxd中接口用法与功能基本与C++接口相同，lgraph_db.pxd中声明的接口都由C++实现，在py文件中必须通过`from cython.cimports.olap_base import *`的方式导入，由Cython编译py文件后才能运行。
+
+### VertexIndexIterator
+- `GetVid()-> int64_t`: 获取点的vid
+
+### Galaxy
+- `Galaxy(dir_path: std::string)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(user: std::string, password: std::string)-> cython.void`: 设置用户
+- `SetUser(user: std::string)-> cython.void`: 设置用户
+- `OpenGraph(graph: std::string, read_only: bint)-> GraphDB`: 创建GraphDB
+
+### GraphDB：
+- `CreateReadTxn()-> Transaction`: 创建只读事务
+- `CreateWriteTxn()-> Transaction`: 创建写事务
+- `ForkTxn(txn: Transaction)-> Transaction`: 复制事务，只能复制读事务
+
+### Transaction：
+```
+GetVertexIndexIterator(
+                label: std::string,
+                field: std::string,
+                key_start: std::string,
+                key_end: std::string)-> VertexIndexIterator
+```
+获取索引迭代器。迭代器的field值为 [key_start, key_end]。所以在key_start=key_end=v时，返回指向field值为v的点的迭代器
+
+lgraph_db_python.py是lgraph_db.pxd中C++类 Galaxy与GraphDB的包装，将C++类包装为Python类，将lgraph_db_python.py编译为Python拓展后，可以直接在Python文件或Python命令行中`import lgraph_db_python`访问lgraph_db_python.PyGraphDB与PyGraphDB.PyGalaxy。
+
+### PyGalaxy:
+- `PyGalaxy(self, dir_path: str)`: 构造函数，dir_path为db路径
+- `SetCurrentUser(self, user: str password: str)-> void`: 设置用户
+- `SetUser(self, user: std::string)-> void`: 设置用户
+- `OpenGraph(self, graph: str, read_only: bool)-> PyGraphDB`: 创建PyGraphDB
+
+### PyGraphDB:
+- `get_pointer(self)-> cython.Py_ssize_t`: C++ 类GraphDB的地址
+
+## 6. 算法插件示例
+下面为Python实现的BFS算法的代码示例：
+```python
+# cython: language_level=3, cpp_locals=True, boundscheck=False, wraparound=False, initializedcheck=False
+# distutils: language = c++
+
+# 注释作用如下：
+# language_level=3: 使用Python3
+# cpp_locals=True: 需要c++17，使用std::optional管理Python代码中的C++对象，可以避免C++对象的拷贝构造
+# boundscheck=False: 关闭索引的边界检查
+# wraparound=False: 关闭负数下标的处理（类似Python List）
+# initializedcheck=False: 关闭检查内存是否初始化，关闭检查后运行性能更快
+# language = c++: 将此py文件翻译为C++而不是C文件，TuGraph使用大量模板函数，所以都应该使用C++
+
+import json
+
+import cython
+from cython.cimports.olap_base import *
+from cython.cimports.lgraph_db import *
+# 从procedures/algo_cython/ 中cimportolap_base.pxd与lgraph_db.pxd, 类似C++中#include "xxx.h"
+
+from cython.cimports.libc.stdio import printf
+# 类似C++中#include <stdio.h>
+# 其他常见的还有cython.cimports.libcpp.unordered_map等
+
+import time
+
+
+@cython.cclass
+# cython.cclass 表示BFSCore为C类型的Class
+class BFSCore:
+    graph: cython.pointer(OlapBase[Empty])
+    # cython.pointer(OlapBase[Empty])表示OlapBase[Empty]的指针，类似C++中OlapBase[Empty]*
+    # cython提供了常见类型的指针，如cython.p_int, cython.p_char等，表示int*, char*, ...
+    parent: ParallelVector[size_t]
+    active_in: ParallelBitset
+    active_out: ParallelBitset
+    root: size_t
+    # root: size_t 声明root为C++ size_t类型变量，等效于root = cython.declare(size_t)
+    # 不声明类型的变量为Python object类型
+    # 声明变量类型会大幅提高性能，同时在多线程部分，只有C/C++类型的变量可以访问
+
+    @cython.cfunc
+    # cython.cfunc 表示Work为C类型的函数，参数与返回值应声明
+    # cfunc性能好，能接受C/C++对象为参数、返回值，但是不能在其他python文件中调用
+    # 类似的有cython.ccall，如Standalone函数，可以在其他python文件中调用
+    @cython.nogil
+    # cython.nogil 表示释放Python全局解释锁，在nogil修饰的部分，不能访问Python对象
+    # 在多线程部分，都应有nogil修饰器
+    @cython.exceptval(check=False)
+    # cython.exceptval(check=False) 表示禁用异常传播，将忽略函数内部引发的Python异常
+    def Work(self, vi: size_t) -> size_t:
+        degree = cython.declare(size_t, self.graph.OutDegree(vi))
+        out_edges = cython.declare(AdjList[Empty], self.graph.OutEdges(vi))
+        i = cython.declare(size_t, 0)
+        local_num_activations = cython.declare(size_t, 0)
+        dst: size_t
+        for i in range(degree):
+            dst = out_edges[i].neighbour
+            if self.parent[dst] == cython.cast(size_t, -1):
+                # parent[dst] == -1 表示dst没有被bfs访问过
+                if self.active_out.Add(dst):
+                    # 将dst设置为为活跃节点；ParallelBitmap.Add为原子操作，防止重复计算
+                    self.parent[dst] = vi
+                    local_num_activations += 1
+        return local_num_activations
+
+    @cython.cfunc
+    @cython.nogil
+    @cython.exceptval(check=False)
+    def run(self, g: cython.pointer(OlapBase[Empty]), r: size_t) -> cython.size_t:
+        self.graph = g
+        self.root = r
+        self.active_in = g.AllocVertexSubset()
+        self.active_out = g.AllocVertexSubset()
+        self.parent = g.AllocVertexArray[size_t]()
+        self.parent.Fill(-1)
+        num_vertices = cython.declare(size_t, self.graph.NumVertices())
+        printf("num_vertices = %lu\n", num_vertices)
+        self.parent[self.root] = self.root
+        num_activations = cython.declare(size_t, 1)
+        discovered_vertices = cython.declare(size_t, num_activations)
+        self.active_in.Add(self.root)
+        while num_activations > 0:
+            self.active_out.Clear()
+            num_activations = g.ProcessVertexActive[size_t, BFSCore](self.Work, self.active_in, self)
+            discovered_vertices += num_activations
+            self.active_out.Swap(self.active_in)
+            printf("num_activations = %lu\n", num_activations)
+        return discovered_vertices
+
+
+@cython.cfunc
+def procedure_process(db: cython.pointer(GraphDB), request: dict, response: dict) -> cython.bint:
+    cost = time.time()
+    root_id = "0"
+    label = "node"
+    field = "id"
+    if "root" in request:
+        root_id = request["root"]
+    if "label" in request:
+        label = request["label"]
+    if "field" in request:
+        field = request["field"]
+
+    txn = db.CreateReadTxn()
+    olapondb = OlapOnDB[Empty](db[0], txn, SNAPSHOT_PARALLEL)
+    # 并行创建OlapOnDB
+    # Cython不支持如 *db 的解引用操作，通过db[0]来解引用
+    root_vid = txn.GetVertexIndexIterator(
+        label.encode('utf-8'), field.encode('utf-8'),
+        root_id.encode('utf-8'), root_id.encode('utf-8')
+    ).GetVid()
+    # 通过 GetVertexIndexIterator 根据root节点label名和filed名与filed值（root_id）
+    # 获取root节点的迭代器，通过迭代器获取vid，在无ID_MAPPING时，该vid与OlapOnDB中的id相同
+    cost = time.time() - cost
+    printf("prepare_cost = %lf s\n", cython.cast(cython.double, cost))
+    a = BFSCore()
+    cost = time.time()
+    count = a.run(cython.address(olapondb), root_vid)
+    cost = time.time() - cost
+    printf("core_cost = %lf s\n", cython.cast(cython.double, cost))
+    response["found_vertices"] = count
+    response["num_vertices"] = olapondb.NumVertices()
+    response["num_edges"] = olapondb.NumEdges()
+    return True
+
+
+@cython.ccall
+def Process(db: lgraph_db_python.PyGraphDB, inp: bytes):
+    # Process为embed模式和procedure模式下插件入口，用cython.ccall修饰
+    # Process函数必须名为Process，参数为lgraph_db_python.PyGraphDB与bytes
+    # 返回值必须为(bool, str)
+    _inp = inp.decode("utf-8")
+    request = json.loads(_inp)
+    response = {}
+    addr = cython.declare(cython.Py_ssize_t, db.get_pointer())
+    # 获取PyGraphDB中GraphDB对象的地址，转换为指针后传递
+    procedure_process(cython.cast(cython.pointer(GraphDB), addr),
+                      request, response)
+    return (True, json.dumps(response))
+
+```
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
new file mode 100644
index 0000000000..7bf7f3ebf1
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/6.algorithms.md
@@ -0,0 +1,189 @@
+# 内置算法
+
+> 此文档主要详细介绍了TuGraph内置的算法程序，社区版6种算法可参考基础算法报
+
+## 简介
+
+TuGraph目前包含以下6个基础算法28种扩展算法，共34个图算法：
+
+### 基础算法包：
+| 中文算法名 | 英文算法名 | 程序名
+|  :----:  | :----: | :----: |
+| 广度优先搜索 | Breadth-First Search  | bfs 
+| 网页排序 | Pagerank | pagerank 
+| 单源最短路径 | Single-Source Shortest Path | sssp 
+| 弱连通分量 | Weakly Connected Components | wcc 
+| 平均集聚系数 | Local Clustering Coefficient  | lcc
+| 标签传播 | Label Propagation Algorithm | lpa 
+
+### 扩展算法包：
+| 中文算法名 | 英文算法名 | 程序名
+| :----: | :----: | :----: |
+| 全对最短路径 | All-Pair Shortest Path  | apsp 
+| 介数中心度 | Betweenness Centrality | bc 
+| 置信度传播 | Belief Propagation | bp
+| 距离中心度 | Closeness Centrality | clce
+| 共同邻居 | Common Neighborhood | cn 
+| 度数关联度 | Degree Correlation  | dc
+| 直径估计 | Dimension Estimation | de 
+| EgoNet算法 | EgoNet | en
+| 超链接主题搜索 | Hyperlink-Induced Topic Search | hits
+| 杰卡德系数 | Jaccard Index | ji
+| K核算法 | K-core | kcore
+| 鲁汶社区发现 | Louvain | louvain 
+| 多源最短路径 | Multiple-source Shortest Paths | mssp
+| 个性化网页排序 | Personalized PageRank | ppr
+| 强连通分量 | Strongly Connected Components | scc 
+| 监听标签传播 | Speaker-listener Label Propagation Algorithm | slpa
+| 两点间最短路径 | Single-Pair Shortest Path | spsp
+| 三角计数 | Triangle Counting | triangle 
+| 信任指数排名 | Trustrank | trustrank 
+| 带权重的标签传播 | Weighted Label Propagation Algorithm | wlpa 
+| 带权重的网页排序 | Weighted Pagerank Algorithm | wpagerank 
+| 最大独立集算法 | Maximal independent set | mis 
+| sybil检测算法 | Sybil Rank | sybilrank 
+| 子图匹配算法 | Subgraph Isomorphism | subgraph_isomorphism
+| 模式匹配算法 | Motif | motif
+| k阶团计数算法 | Kcliques | kcliques
+| k阶桁架计数算法 | Ktruss | ktruss 
+| 莱顿算法 | Leiden | leiden
+
+## 基础算法包
+
+### 广度优先搜索
+
+广度优先搜索实现了Breadth-first Search算法，从根点开始，沿着图的宽度遍历所有可访问点。返回结果为遍历点个数。算法内容请参考 [https://en.wikipedia.org/wiki/Breadth-first_search](https://en.wikipedia.org/wiki/Breadth-first_search "bfs wiki")。
+
+### 网页排序
+
+网页排序程序实现了常用的Pagerank算法。该算法根据图中边和边权值计算所有点的重要性排名，PageRank值越高，表示该点在图中的重要性越高。计算时以点数量的倒数为各点初始Rank值，然后将点的Rank值按照出边平均传递到相邻点，重复该传递过程直到满足给定的收敛阈值或达到给定迭代轮数。每轮传递结束后，所有点的Rank值会有一定的的比例随机传递到任意点上。算法内容请参考 [https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank "pagerank wiki")。
+
+### 单源最短路径
+
+单源最短路径实现了Single Source Shortest Path算法，根据给定的源点，计算从该源点出发到其他任意点的最短路径长度。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 弱连通分量
+
+弱连通分量程序实现了Weakly Connected Components算法，该算法会计算图中所有的弱连通分量。弱连通分量是图的一个子图，子图中任意两点之间均存在可达路径。算法内容请参考[https://en.wikipedia.org/wiki/Connected_component_(graph_theory)](https://en.wikipedia.org/wiki/Connected_component_(graph_theory) "scc wiki")。
+
+### 平均集聚系数
+
+平均集聚系数程序实现了Local Clustering Coefficient算法，计算图中点之间聚集程度的系数。返回结果包括整体集聚系数和点集聚系数。整体集聚系数反映了图中整体的集聚程度的评估，点集聚系数包括任意点的集聚系数，反映了该点附近的集聚程度。集聚系数越高，表示集聚程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Clustering_coefficient](https://en.wikipedia.org/wiki/Clustering_coefficient "lcc wiki")。
+
+### 标签传播
+
+标签传播算法程序实现了Label Propagation Algorithm算法。该算法是基于标签传播的社区发现算法，计算对象为无权图。在标签传递时，每个点对收到的所有标签进行次数累加，在累加和最高的标签中随机选择一个。迭代收敛或执行到给定轮数后算法终止。最终输出结果为每个点的标签，标签值相同的点视为在同一社区。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+
+## 扩展算法包
+
+### 全对最短路径
+
+全对最短路径程序实现了All-Pair Shortest Path算法，计算图中任意两点间的最短路径。返回结果为任意存在路径的点对之间的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm](https://en.wikipedia.org/wiki/Floyd-Warshall_algorithm "Floyd-Warshall algorighm wiki")
+
+### 介数中心度
+
+介数中心度程序实现了Betweenness Centrality算法，估算图中所有点的介数中心度值。介数中心度值反映了图中任一最短路径经过该点的可能性，值越高表示有越多的最短路径经过了该点。计算时需给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Betweenness_centrality](https://en.wikipedia.org/wiki/Betweenness_centrality "bc wiki")。
+
+### 置信度传播
+
+置信度传播程序实现了Belief Propagation算法。该算法给定已观测点的边缘分布，利用点之间相互传递消息的机制来估算未观测点的边缘分布。算法内容请参考[https://en.wikipedia.org/wiki/Belief_propagation](https://en.wikipedia.org/wiki/Belief_propagation)。
+
+### 距离中心度
+
+距离中心度程序实现了Closeness Centrality算法，估算任意点到图中其他点的最短路径的平均长度。距离中心度越小，表示该点到其他点的平均最短距离最小，意味着该点从几何角度看更位于图的中心位置。计算时需要给定抽样点个数，分别以这些抽样点为中心进行计算。算法内容请参考[https://en.wikipedia.org/wiki/Closeness_centrality](https://en.wikipedia.org/wiki/Closeness_centrality "clce wiki")。
+
+### 共同邻居
+
+共同邻居程序实现了Common Neighborhood算法，计算任意给定相邻点对之间的共同邻居数量。计算时给定待查询的若干个点对，返回结果为待查询的任意点对的共同邻居数量。
+
+### 度数关联度
+
+度数关联度程序实现了Degree Correlation算法，通过计算任意相邻点对之间的Pearson关联系数来计算图的度数关联度，可用来表征图中高度数点之间关联程度。度数关联度越高，表示图中高度数点之间的关联程度越高。算法内容请参考[https://en.wikipedia.org/wiki/Pearson_correlation_coefficient](https://en.wikipedia.org/wiki/Pearson_correlation_coefficient "dc wiki")
+
+### 直径估计
+
+直径估计程序实现了Dimension Estimation算法。该算法会计算图中最长的最短路径长度，用来表征图的直径大小。算法内容请参考[http://mathworld.wolfram.com/GraphDiameter.html](http://mathworld.wolfram.com/GraphDiameter.html "graph diameter")。
+
+### EgoNet算法
+
+EgoNet算法需要给定根点和K值，以根点为源点进行宽度优先搜索，找出所有K度以内的邻居组成的子图。找到的子图称为根点的EgoNet。
+
+### 超链接主题搜索
+
+超链接主题搜索算法实现了Hyperlink-Induced Topic Search算法，该算法假定每个点具有权威性Authority和枢纽性Hub两个属性，一个好的枢纽点应该指向许多高权威性的点，而一个良好的权威点应该被许多高枢纽型的点指向。算法将返回每个点的权威性值和枢纽性值。算法内容请参考[https://en.wikipedia.org/wiki/HITS_algorithm](https://en.wikipedia.org/wiki/HITS_algorithm "HITS algorithm")。
+
+### 杰卡德系数
+
+杰卡德系数程序实现了Jaccard Index算法。该算法计算了给定点对之间的Jaccard系数，可用来表示这两个点的相似度。Jaccard系数越高，表示点对之间的相似程度越高。计算时给定带查询的若干点对，返回结果为这些点对的Jaccard系数。算法内容请参考[https://en.wikipedia.org/wiki/Jaccard_index](https://en.wikipedia.org/wiki/Jaccard_index "ji wiki")。
+
+### k核算法
+
+k核算法实现了k-core算法。该算法计算所有点的核数，或找出图中所有的K核子图。K核子图是一种特殊子图，子图中任意点度数都不小于给定K值。算法内容请参考 [https://en.wikipedia.org/wiki/Degeneracy_(graph_theory)](https://en.wikipedia.org/wiki/Degeneracy_(graph_theory) "kcore wiki")。
+
+### 鲁汶社区发现
+
+鲁汶社区发现程序实现了Fast-unfolding算法。该算法是基于模块度的社区发现算法，通过不断合并点社区来最大化图的模块度，能够发现层次性的社区结构。算法内容请参考 [https://en.wikipedia.org/wiki/Louvain_Modularity](https://en.wikipedia.org/wiki/Louvain_Modularity "louvain modularity wiki")。
+
+### 多源最短路径
+
+多源最短路径程序实现了Multiple-source Shortest Paths算法，根据给定的多个源点，从这些源点出发，计算到达任意点的最短路径值。其中，多个源点到某一点的最短路径值为分别从每个源点出发到达该点的最短路径的最小值。算法内容请参考 [https://en.wikipedia.org/wiki/Shortest_path_problem](https://en.wikipedia.org/wiki/Shortest_path_problem "shortest path wiki")。
+
+### 个性化网页排序
+
+个性化网页排序程序实现了Personalized PageRank算法。该算法根据给定的源点，基于该源点个性化计算所有点对于源点的重要性排名。Rank值越高，表示该点对于源点越重要。与PageRank不同的是，初始化时源点Rank值为1，其余点Rank值为0；并且每轮传递结束后，Rank值会有一定的比例随即传递回源点。算法内容请参考 [https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf](https://cs.stanford.edu/people/plofgren/Fast-PPR_KDD_Talk.pdf)。
+
+### 强连通分量
+
+强连通分量程序实现了Strongly Connected Components算法。该算法计算了图中所有的强连通分量，强连通分量是图的一个子图，子图中可从任意点出发到达其他任意点。算法内容请参考[https://en.wikipedia.org/wiki/Strongly_connected_component](https://en.wikipedia.org/wiki/Strongly_connected_component "scc wiki")。
+
+### 监听标签传播
+
+监听标签传播算法程序实现了Speaker-listener Label Propagation Algorithm算法。该算法是基于标签传播和历史标签记录的社区发现算法，是对标签传播算法的扩展。与标签传播算法不同的是，本算法会对所有点记录其历史标签，在迭代中对标签进行累加时，会将历史标签也计算在内。最终输出结果为每个点的所有历史标签记录。算法内容请参考论文：“SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process”。
+
+### 两点间最短路径
+
+两点间最短路径程序实现了Bidirectional Breadth-First Search算法，在有向无权图上从起点沿着出边做正向宽度优先搜搜，从终点沿着入边做反向宽度优先搜索，通过起点和终点共同遍历到的点来确定从起点到终点的最短路径长度。算法内容请参考[https://en.wikipedia.org/wiki/Bidirectional_search](https://en.wikipedia.org/wiki/Bidirectional_search "Bidirectional search")。
+
+### 三角计数
+
+三角计数实现了Triangle-counting算法，计算无向图中的三角形个数，可用来表征图中点的关联程度。三角形数越多，表示图中点的关联程度越高。算法内容请参考论文：“Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study” 。
+
+### 信任指数排名
+
+信任指数排名算法实现了Trustrank算法，可以根据给定的白名单，计算任意点的信任指数。信任指数越高，表示该点为非法点的可能性越小。算法内容请参考 [https://en.wikipedia.org/wiki/TrustRank](https://en.wikipedia.org/wiki/TrustRank "trustrank wiki")。
+
+### 带权重的标签传播
+
+带权重的标签传播算法程序实现了Weighted Label Propagation Algorithm算法。=与标签传播算法不同的是，标签的传递跟边的权重相关，在标签传递时，每个点会根据标签的入边进行权重累加，在累加和最高的标签中随机选择一个。算法内容请参考 [https://en.wikipedia.org/wiki/Label_Propagation_Algorithm](https://en.wikipedia.org/wiki/Label_Propagation_Algorithm "lpa wiki")。
+
+### 带权重的网页排序
+
+带权重的网页排序算法程序实现了Weighted Pagerank算法。与PageRank算法不同的是，Rank值的传递跟边的权重有关，点的Rank值将按照边权重加权传递到相邻点。算法内容请参考[https://en.wikipedia.org/wiki/PageRank](https://en.wikipedia.org/wiki/PageRank)。
+
+### 最大独立集算法
+
+最大独立集算法实现了Maximal independent set算法。最大独立集是指在这个独立集之外没有可以加入它的点。一个图可能有许多大小差异很大的 MIS，算法找出其中一个。算法内容请参考 [https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm](https://en.wikipedia.org/wiki/Maximal_independent_set#Sequential_algorithm "Maximal independent set wiki")。
+
+### Sybil检测算法
+
+Sybil检测算法实现了Sybil Rank算法。SybilRank算法从非Sybil节点开始进行提前终止的随机游走。算法内容请参考论文：“Aiding the Detection of Fake Accounts in Large Scale Social Online Services”。
+
+### 子图匹配算法
+
+子图匹配算法实现了subgraph_isomorphism算法。subgraph_isomorphism算法对全图所有节点匹配子图，最后输出每个节点被匹配的次数。算法内容参考 [https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105](https://www.jsjkx.com/CN/article/openArticlePDF.jsp?id=18105)
+
+### 模式匹配算法
+
+模式匹配算法实现了motif算法。motif算法对指定的节点匹配k阶子图，最后输出每个指定节点每种k阶子图个数，每个k阶子图用一个64位整数表示，整数的第$i \times k + j$位为1表示子图中有边i->j。算法内容参考 [https://en.wikipedia.org/wiki/Network_motif#mfinder](https://en.wikipedia.org/wiki/Network_motif#mfinder)
+
+### k阶团计数算法
+
+k阶团计数算法实现了k-cliques算法。k-cliques算法对计算图中所有的k阶完全子图的个数，最后输出每个节点所在的k阶完全子图个数。算法内容参考 [https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size](https://en.wikipedia.org/wiki/Clique_problem#Cliques_of_fixed_size)
+
+### k阶桁架计数算法
+
+k阶桁架计数算法实现了k-truss算法。k-truss指每条边都至少是k-2个三角形的边的子图。k-truss算法找出图的k-truss子图，最后输出每个节点在子图中的邻居节点列表。算法内容参考 [https://louridas.github.io/rwa/assignments/finding-trusses/](https://louridas.github.io/rwa/assignments/finding-trusses/)
+### 莱顿算法
+
+莱顿算法实现了了leiden算法。leiden算法是基于模块度的社区发现算法，与louvain算法优势在于leiden算法检测出社区中的断链，保证每个社区具有良好的连通性。算法内容参考 [https://www.nature.com/articles/s41598-019-41695-z#Sec4](https://www.nature.com/articles/s41598-019-41695-z#Sec4)
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/index.rst
new file mode 100644
index 0000000000..bc80c68c65
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/2.olap/index.rst
@@ -0,0 +1,8 @@
+分析接口
+========
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
new file mode 100644
index 0000000000..46813c7cca
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/1.tutorial.md
@@ -0,0 +1,83 @@
+# Learn Tutorial
+
+> 本文档是为 TuGraph 的用户设计的引导程序，用户在阅读详细的文档之前，应该首先阅读该文档，对 TuGraph 的图学习运行流程有一个大致的了解，之后再阅读详细文档会更加方便。引导程序是基于 Tugraph 的一个简单的程序实例，我们将重点介绍其使用方式。
+
+## 1.TuGraph 图学习模块简介
+图学习是一种机器学习方法，其核心思想是利用图结构中的拓扑信息，通过顶点之间的联系及规律来进行数据分析和建模。不同于传统机器学习方法，图学习利用的数据形式为图结构，其中顶点表示数据中的实体，而边则表示实体之间的关系。通过对这些顶点和边进行特征提取和模式挖掘，可以揭示出数据中深层次的关联和规律，从而用于各种实际应用中。
+
+这个模块是一个基于图数据库的图学习模块，主要提供了四种采样算子：Neighbor Sampling、Edge Sampling、Random Walk Sampling 和 Negative Sampling。这些算子可以用于对图中的顶点和边进行采样，从而生成训练数据。采样过程是在并行计算环境下完成的，具有高效性和可扩展性。
+
+在采样后，我们可以使用得到的训练数据来训练一个模型。该模型可以用于各种图学习任务，比如预测、分类等。通过训练，模型可以学习到图中的顶点和边之间的关系，从而能够对新的顶点和边进行预测和分类。在实际应用中，这个模块可以被用来处理各种大规模的图数据，比如社交网络、推荐系统、生物信息学等。
+
+## 2. 运行流程
+TuGraph 图学习模块将TuGraph中的图数据采样，采样后的顶点和边作为图学习的特征，进行学习训练。运行流程如下图所示：
+![Alt text](../../../../images/learn_flow_chart_zh.png)
+
+## 3.TuGraph编译及数据准备
+TuGraph编译请参考：[编译](../../5.installation&running/6.compile.md)
+在build/output目录下执行：
+```bash
+cp -r ../../test/integration/data/ ./ && cp -r ../../learn/examples/* ./
+```
+
+该指令将数据集相关文件拷贝到build/output目录下。
+
+## 4. 数据导入
+数据导入请参考[数据导入](../../6.utility-tools/1.data-import.md)
+
+导入过程以cora数据集为例：
+
+在build/output目录下执行
+```bash
+./lgraph_import -c ./data/algo/cora.conf --dir ./coradb --overwrite 1
+```
+其中cora.conf为图schema文件，代表图数据的格式。coradb为导入后的图数据文件名称，代表图数据的存储位置。
+## 5. feature特征转换
+由于图学习中的feature特征一般表示为较长的float类型数组，TuGraph暂不支持float数组类型加载，因此可将其按照string类型导入后，转换成char*方便后续存取，具体实现可参考feature_float.cpp文件。
+具体执行过程如下：
+
+在build目录下编译导入plugin(如果TuGraph已编译可跳过)：
+`make feature_float_embed`
+
+在build/output目录下执行
+`./algo/feature_float_embed ./coradb`
+即可进行转换。
+## 6. 采样算子及编译
+TuGraph在cython层实现了一种获取全图数据的算子及4种采样算子，具体如下：
+### 6.1.采样算子介绍
+| 采样算子 | 采样方式 |
+| --- | --- |
+| GetDB | 从数据库中获取图数据并转换成所需数据结构 |
+| Neighbor Sampling | 根据给定的顶点采样其邻居顶点，得到采样子图 |
+| Edge Sampling | 根据采样率采样图中的边，得到采样子图 |
+| Random Walk Sampling | 根据给定的顶点，进行随机游走，得到采样子图 |
+| Negative Sampling | 生成不存在边的子图。 |
+
+### 6.2.编译
+如果TuGraph已编译，可跳过此步骤。
+在tugraph-db/build文件夹下执行
+`make -j2`
+
+或在tugraph-db/learn/procedures文件夹下执行
+`python3 setup.py build_ext -i`
+
+得到算子so后，在Python中import 即可使用。
+
+## 7. 模型训练及保存
+TuGraph在python层调用cython层的算子，实现图学习模型的训练。
+使用 TuGraph 图学习模块使用方式介绍如下:
+在build/output文件夹下执行
+`python3 train_full_cora.py --model_save_path ./cora_model`
+即可进行训练。
+最终打印loss数值小于0.9，即为训练成功。至此，图模型训练完成，模型保存在cora_model文件。
+
+## 8. 模型加载
+```python
+model = build_model()
+model.load_state_dict(torch.load(model_save_path))
+model.eval()
+```
+在使用保存的模型之前，首先需要对其进行加载。代码中，使用如上的代码对已训练模型进行加载。
+
+加载之后，我们可以使用模型对新的顶点和边进行预测和分类。在预测时，我们可以输入一个或多个顶点，模型将输出相应的预测结果。在分类时，我们可以将整个图作为输入，模型将对图中的顶点和边进行分类，以实现任务的目标。
+使用已训练的模型可以避免重新训练模型的时间和资源消耗。此外，由于模型已经学习到了图数据中顶点和边之间的关系，它可以很好地适应新的数据，从而提高预测和分类的准确度。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
new file mode 100644
index 0000000000..2a1c0ac8d9
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/2.sampling_api.md
@@ -0,0 +1,97 @@
+# Sampling API
+
+> 此文档主要详细介绍了Sampling API的使用说明
+
+## 1. 概述
+
+本手册介绍使用TuGraph的Sampling API接口。
+
+## 2. 图数据预处理
+在采样操作之前，根据图数据路径加载图数据，并映射成olapondb图分析类，代码如下：
+
+```python
+galaxy = PyGalaxy(args.db_path) # 根据路径创建一个galaxy实例
+galaxy.SetCurrentUser(args.username, args.password) # 设置当前用户
+db = galaxy.OpenGraph('default', False) # 打开图数据库指定db
+txn = db.CreateReadTxn() # 创建一个事务实例
+olapondb = PyOlapOnDB('Empty', db, txn) # 根据图加载方式、图数据库实例、事务实例实例化OlapOnDB
+del txn
+del db
+del galaxy
+```
+## 3. 图采样算子介绍
+图采样算子在cython层实现，用于对输入的图进行采样处理，生成的NodeInfo用于保存feature属性、label属性等点信息，EdgeInfo用于保存边信息，这些元数据信息可以被用于特征抽取、网络嵌入等任务中。目前TuGraph图学习模块支持GetDB、NeighborSampling、EdgeSampling、RandomWalkSampling、NegativeSampling五种采样算子。
+### 3.1.RandomWalk算子：
+在给定的采样点周围进行指定次数的随机游走，得到采样子图。
+
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, step: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+step: size_t类型，采样步数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.2.NeighborSample算子：
+在给定采样点的一度邻居中采样一定数量的点，得到采样子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_node: list, nei_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_node: list类型，采样点列表。
+nei_num: size_t类型，邻居采样点数。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.3.Nagetive算子：
+采用负采样算法，生成不存在边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb: lgraph_db_python.PyOlapOnDB, feature_num: size_t, num_samples: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+num_samples: size_t类型，生成不存在边的数量。
+NodeInfo: list类型，点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，边属性字典的列表，表示边的元数据信息。
+返回值： 无。
+
+### 3.4.EdgeSampling算子：
+根据边采样率，生成采样边的子图。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, sample_rate: double, NodeInfo: list, EdgeInfo: list,EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+sample_rate: double类型，采样率。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+### 3.5.GetDB算子：
+从数据库中获取图数据并转换成所需数据结构。
+```python
+Process(db_: lgraph_db_python.PyGraphDB, olapondb:lgraph_db_python.PyOlapOnDB, feature_num: size_t, NodeInfo: list, EdgeInfo: list)
+```
+参数列表：
+db_: 图数据库实例。
+olapondb: 图分析类。
+feature_num: size_t类型，feature特征向量的长度。
+NodeInfo: list类型，一个点属性字典的列表，表示点的元数据信息。
+EdgeInfo: list类型，一个边属性字典的列表，表示边的元数据信息。
+返回值: 无。
+
+## 4. 用户自定义采样算法
+用户也可以通过TuGraph Olap接口实现自定义采样算法，接口文档参见[此处](../2.olap/5.python-api.md)，该文档主要介绍图采样算法使用的相关函数的接口设计。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/3.training.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/3.training.md
new file mode 100644
index 0000000000..c8dd5e8e1c
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/3.training.md
@@ -0,0 +1,101 @@
+# Training
+
+> 本文档详细介绍了如何使用TuGraph进行图神经网络（GNN）的训练。
+
+## 1. 训练
+使用TuGraph 图学习模块进行训练时，可以分为全图训练和mini-batch训练。
+全图训练即把全图从TuGraph db加载到内存中，再进行GNN的训练。而mini-batch训练则使用上面提到的TuGraph 图学习模块的采样算子，将全图数据进行采样后，再送入训练框架中进行训练。
+## 2. Mini-Batch训练
+Mini-Batch训练需要使用TuGraph 图学习模块的采样算子，目前支持Neighbor Sampling、Edge Sampling、Random Walk Sampling和Negative Sampling。
+TuGraph 图学习模块的采样算子进行采样后的结果以List的形式返回。
+下面以Neighbor Sampling为例，介绍如何将采样后的结果，进行格式转换，送入到训练框架中进行训练。
+用户需要提供一个Sample类：
+```python
+class TuGraphSample(object):
+    def __init__(self, args=None):
+        super(TuGraphSample, self).__init__()
+        self.args = args
+
+    def sample(self, g, seed_nodes):
+        args = self.args
+        # 1. 加载图数据
+        galaxy = PyGalaxy(args.db_path)
+        galaxy.SetCurrentUser(args.username, args.password)
+        db = galaxy.OpenGraph(args.graph_name, False)
+
+        sample_node = seed_nodes.tolist()
+        length = args.randomwalk_length
+        NodeInfo = []
+        EdgeInfo = []
+
+        # 2. 采样方法，结果存储在NodeInfo和EdgeInfo中
+        if args.sample_method == 'randomwalk':
+            randomwalk.Process(db, 100, sample_node, length, NodeInfo, EdgeInfo)
+        elif args.sample_method == 'negative':
+            negativesample.Process(db, 100)
+        else:
+            neighborsample(db, 100, sample_node, args.nbor_sample_num, NodeInfo, EdgeInfo)
+        del db
+        del galaxy
+
+        # 3. 对结果进行格式转换，使之符合训练格式
+        remap(EdgeInfo[0], EdgeInfo[1], NodeInfo[0])
+        g = dgl.graph((EdgeInfo[0], EdgeInfo[1]))
+        g.ndata['feat'] = torch.tensor(NodeInfo[1])
+        g.ndata['label'] = torch.tensor(NodeInfo[2])
+        return g
+```
+如代码所示，首先将图数据加载到内存中。然后使用采样算子对图数据进行采样，结果存储在NodeInfo和EdgeInfo中。NodeInfo和EdgeInfo是python list结果，其存储的信息结果如下：
+
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+
+最后对结果进行格式转换，使之符合训练格式。这里我们使用的是DGL训练框架，因此使用结果数据构造了DGL Graph，最终将DGL Graph返回。
+我们提供TuGraphSample类之后，就可以使用它进行Mini-Batch训练了。
+令DGL的数据加载部分使用TuGraphSample的实例sampler：
+```python
+    sampler = TugraphSample(args)
+    fake_g = construct_graph() # just make dgl happy
+    dataloader = dgl.dataloading.DataLoader(fake_g,
+        torch.arange(train_nids),
+        sampler,
+        batch_size=batch_size,
+        device=device,
+        use_ddp=True,
+        num_workers=0,
+        drop_last=False,
+        )
+```
+使用DGL进行模型训练：
+```python
+def train(dataloader, model):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    for graph in dataloader:
+        load_time = time.time()
+        graph = dgl.add_self_loop(graph)
+        logits = model(graph, graph.ndata['feat'])
+        loss = loss_fcn(logits, graph.ndata['label'])
+        optimizer.zero_grad()
+        loss.backward()
+        optimizer.step()
+        train_time = time.time()
+        print('load time', load_time - s, 'train_time', train_time - load_time)
+        s = time.time()
+    return float(loss)
+```
+
+## 3. 全图训练
+GNN（图神经网络）的全图训练是一种涉及一次处理整个训练数据集的训练。它是 GNN 最简单、最直接的训练方法之一，整个图被视为单个实例。 在全图训练中，整个数据集被加载到内存中，模型在整个图上进行训练。这种类型的训练对于中小型图特别有用，并且主要用于不随时间变化的静态图。
+在算子调用时，使用以下方式：
+```python
+getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+获取全图数据，然后将全图送入训练框架中进行训练。
+完整代码：请参考learn/examples/train_full_cora.py。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
new file mode 100644
index 0000000000..b5c8888189
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/4.heterogeneous_graph.md
@@ -0,0 +1,102 @@
+# Heterogeneous Graph
+
+> 本文档介绍如何使用异质图进行训练。
+
+## 1. 异质图简介
+异质图（Heterogeneous Graph）是指由不同类型的节点和边构成的图结构。在异质图中，节点和边可以具有多样化的属性和关系，代表了不同实体以及它们之间的复杂关联。
+
+在异质图中，节点类型可以代表不同的实体，如用户、商品、话题等，而边类型表示不同实体之间的关系，如用户之间的关注关系、用户与商品之间的购买关系等。节点和边可以具有不同的属性。
+
+异质图提供了一种强大的图模型，能够更好地表达和分析具有多种类型实体和复杂关系的现实世界系统。在不同领域的数据分析和应用中，异质图具有广泛的应用前景和研究价值。
+
+## 2. 异质图创建
+在TuGraph中，一个异构图由一系列边关系构成。每个关系由一个字符串三元组定义 (源节点类型, 边类型, 目标节点类型) 。异质图的创建方式与同质图类似，只是在创建图时需要指定字符串三元组定义。如下所示。
+    
+```python
+    olapondb = PyOlapOnDB('Empty', db, txn, [("node", "edge", "node")])
+```
+其中，第四个参数为异质图的边关系定义，可以通过该参数，指定筛选的异质图点边类型。如果不指定该参数，则默认将全部点边类型的数据进行构图训练。
+
+## 3. 异质图查询接口
+为了方便用户使用，当用户给定第四个参数时，TuGraph提供了查询异质图点边类型的接口。示例如下所示：
+
+### 3.1 点类型查询接口
+```python
+olapondb.ntypes()
+```
+返回值为点类型列表，如['node1', 'node2', 'node3']。
+
+### 3.2 边类型查询接口
+```python
+olapondb.etypes()
+```
+返回值为边类型列表，如['edge1', 'edge2', 'edge3']。
+
+### 3.3 点类型和边类型查询接口
+```python
+olapondb.metagraph()
+```
+返回值为字符串三元组定义 (源节点类型, 边类型, 目标节点类型)，如
+[('node1', 'edge1', 'node2'), ('node2', 'edge2', 'node3')]。
+
+## 4. 异质图输出格式
+和同质图相同的是，异质图的采样数据结果也存储在NodeInfo和EdgeInfo中。
+可通过如下方式获取输出数据。
+```python
+    NodeInfo = []
+    EdgeInfo = []
+    getdb.Process(db, olapondb, feature_len, NodeInfo, EdgeInfo)
+```
+其中getdb为获取全图数据的函数，db为图数据库实例，olapondb为图分析类。feature_len为节点特征长度，NodeInfo和EdgeInfo为输出的节点和边信息。
+
+其存储信息结果如下：
+| 图数据 | 存储信息位置 |
+| --- | --- |
+| 边起点 | EdgeInfo[0] |
+| 边终点 | EdgeInfo[1] |
+| 边类型 | EdgeInfo[2] |
+| 顶点ID | NodeInfo[0] |
+| 顶点特征 | NodeInfo[1] |
+| 顶点标签 | NodeInfo[2] |
+| 顶点类型 | NodeInfo[3] |
+
+## 5. 异质图训练
+异构图训练的目标是学习图中节点和边的表示，以便于进行后续的任务，如节点分类、链接预测、图聚类等。为了实现这一目标，研究者们提出了多种基于图神经网络（Graph Neural Networks，GNNs）的模型。这些模型通过聚合邻居节点的信息来更新节点的表示，进而捕捉图结构中的复杂关系。
+
+由于异构图中包含多种类型的节点和边，因此在设计GNN模型时需要考虑如何处理这些不同类型的信息。一种常见的方法是设计不同的聚合函数来分别处理不同类型的邻居节点。此外，还需要考虑如何将这些不同类型的信息整合到一起，以便于模型能够有效地学习到节点和边的表示。
+
+TuGraph 提供了使用裁剪版ogbn-mag数据集进行异质图训练的方法，可供使用者参考。
+
+TuGraph提供的官方docker中暂未提供异质图训练的环境，因此需要用户自行安装相关依赖包。
+在训练之前需要下载ogb和pandas包，具体安装方式如下：
+```shell
+pip3 install ogb
+pip3 install pandas==0.24.2
+```
+
+训练代码如下所示：
+
+```python
+def train(graph, model, model_save_path):
+    optimizer = torch.optim.Adam(model.parameters(), lr=1e-2, weight_decay=5e-4)
+    model.train()
+    s = time.time()
+    load_time = time.time()
+    graph = dgl.add_self_loop(graph)
+    logits = model(graph, graph.ndata['feat'])
+    loss = loss_fcn(logits, graph.ndata['label'])
+    optimizer.zero_grad()
+    loss.backward()
+    optimizer.step()
+    train_time = time.time()
+    current_loss = float(loss)
+    if model_save_path != "":
+        if 'min_loss' not in train.__dict__:
+            train.min_loss = current_loss
+        elif current_loss < train.min_loss:
+            train.min_loss = current_loss
+            model_save_path = 'best_model.pth'
+        torch.save(model.state_dict(), model_save_path)
+    return current_loss
+```
+全部训练代码可参考tugraph/learn/examples/train_full_mag.py文件。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/index.rst
new file mode 100644
index 0000000000..e79e36ea91
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/3.learn/index.rst
@@ -0,0 +1,8 @@
+图学习
+======
+
+.. toctree::
+   :maxdepth: 2
+   :glob:
+
+   *
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/index.rst
new file mode 100644
index 0000000000..d4c9759490
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/9.olap&procedure/index.rst
@@ -0,0 +1,11 @@
+存储过程和分析接口
+================================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.procedure/index.rst
+   2.olap/index.rst
+   3.learn/index.rst
\ No newline at end of file
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/conf.py b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/conf.py
new file mode 100644
index 0000000000..34515a01b2
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/conf.py
@@ -0,0 +1,50 @@
+# Configuration file for the Sphinx documentation builder.
+#
+# For the full list of built-in configuration values, see the documentation:
+# https://www.sphinx-doc.org/en/master/usage/configuration.html
+
+# -- Project information -----------------------------------------------------
+
+import os, subprocess, sys, shlex
+project = 'TuGraph'
+
+copyright = '2023, Ant Group'
+author = 'Ant Group'
+
+# -- General configuration ---------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#general-configuration
+
+extensions = ['myst_parser',
+              'sphinx_panels',
+              'sphinx.ext.autodoc',
+              'sphinx.ext.napoleon',
+              'sphinx.ext.viewcode']
+
+templates_path = ['../../_templates']
+exclude_patterns = []
+
+
+
+# -- Options for HTML output -------------------------------------------------
+# https://www.sphinx-doc.org/en/master/usage/configuration.html#options-for-html-output
+
+html_theme = 'sphinx_rtd_theme'
+
+read_the_docs_build = os.environ.get('READTHEDOCS', None) == 'True'
+if read_the_docs_build:
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph_python_api.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/liblgraph.so"))
+    subprocess.run(shlex.split("wget https://tugraph-web.oss-cn-beijing.aliyuncs.com/tugraph/doc_deps/libjvm.so"))
+    sys.path.insert(0, os.path.abspath('9.olap&procedure/1.procedure/'))
+    # doxygen & breathe
+    extensions.append("breathe")
+    subprocess.run(shlex.split("doxygen"), cwd="9.olap&procedure/1.procedure/")
+    breathe_projects = {"cpp_procedure": "9.olap&procedure/1.procedure/build/xml"}
+    breathe_default_project = "cpp_procedure"
+else:
+    if os.path.exists("9.olap&procedure/1.procedure/3.C++-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/4.Python-procedure.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst") and \
+            os.path.exists("9.olap&procedure/1.procedure/index.rst.aci"):
+        subprocess.run(shlex.split("rm -rf 3.C++-procedure.rst 4.Python-procedure.rst index.rst"), cwd="9.olap&procedure/1.procedure/")
+        subprocess.run(shlex.split("mv index.rst.aci index.rst"), cwd="9.olap&procedure/1.procedure/")
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/development_guide.md b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/development_guide.md
new file mode 100644
index 0000000000..2d8f22e10a
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/development_guide.md
@@ -0,0 +1,304 @@
+# 业务开发指南
+## 连接tugraph-db
+### 驱动连接
+tugraph-db兼容neo4j的通讯协议，因此可以使用neo4j的驱动连接tugraph-db的server。
+
+[bolt driver 使用介绍](./7.client-tools/5.bolt-client.md)
+
+[bolt driver 使用例子](https://github.com/TuGraph-family/tugraph-db/tree/master/demo/Bolt)
+
+### 终端连接
+驱动是业务代码里面使用的，对于服务器上终端访问，可以使用cli客户端。
+
+[console client 使用介绍](./7.client-tools/6.bolt-console-client.md)
+
+## 子图操作
+### 创建子图
+```
+CALL dbms.graph.createGraph('graph1')
+```
+### 删除子图
+```
+CALL dbms.graph.deleteGraph('graph1')
+```
+### 清空子图
+#### 删除所有的点边数据和图schema
+```
+CALL db.dropDB()
+```
+#### 只删除所有点边数据, 保留图schema
+```
+CALL db.dropAllVertex()
+```
+### 查看图schema
+```
+CALL dbms.graph.getGraphSchema()
+```
+### 列出所有子图
+```
+CALL dbms.graph.listGraphs()
+```
+
+### 刷新子图文件系统缓存数据
+```
+CALL db.flushDB()
+```
+
+## 点类型操作
+### 创建点类型
+如下json定义了一个点类型，名字是`node1`。
+```json
+{
+	"label": "node1",
+	"primary": "id",
+	"type": "VERTEX",
+	"detach_property": true,
+	"properties": [{
+		"name": "id",
+		"type": "INT32",
+		"optional": false
+	}, {
+		"name": "name",
+		"type": "STRING",
+		"optional": false,
+		"index": true
+	}, {
+		"name": "num",
+		"type": "INT32",
+		"optional": false,
+		"index": true,
+		"unique": true
+	}, {
+		"name": "desc",
+		"type": "STRING",
+		"optional": true
+	}]
+}
+
+```
+把上面这个json序列化成字符串，作为参数传入，建议使用驱动的参数化特性，避免自己拼接语句。
+```
+CALL db.createVertexLabelByJson($json_data)
+```
+
+### 查看点类型schema
+```
+CALL db.getVertexSchema('node1')
+```
+
+### 删除点类型
+>该操作会同步删除所有该类型的点数据，数据量大的时候，有时间消耗。
+
+如下例子删除点类型`node1`以及该类型的所有点数据。
+```
+CALL db.deleteLabel('vertex', 'node1')
+```
+
+### 点类型添加字段
+>该操作会同步变更所有该类型点的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，一次添加了两个字段：`field1`，字符串类型，可选，默认值是 `null`; `field2`，`int64`类型，必选，默认值是0.
+```
+CALL db.alterLabelAddFields('vertex', 'node1', ['field1', string, null ,true], ['field2', int64, 0, false])
+```
+
+### 点类型删除字段
+>该操作会同步变更所有该类型点的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，一次删除了两个字段: `field1` 和 `field2`。
+```
+CALL db.alterLabelDelFields('vertex', 'node1', ['field1', 'field2'])
+```
+
+### 点类型添加索引
+>该操作会同步构建索引数据，数据量大的时候，有时间消耗。
+
+如下例子，对于点类型`node1`，给`field1`字段添加了一个非唯一索引。
+```
+CALL db.addIndex('node1', 'field1', false)
+```
+如下例子，对于点类型`node1`，给`field2`字段添加了一个唯一索引。
+```
+CALL db.addIndex('node1', 'field2', true)
+```
+
+### 点类型删除索引
+如下例子，对于点类型`node1`，删除字段`field1`上的索引。
+```
+CALL db.deleteIndex('node1', 'field1')
+```
+
+
+## 边类型操作
+### 创建边类型
+
+如下json定义了一个边的schema，名字是`edge1`。
+```json
+{
+  "label": "edge1",
+  "type": "EDGE",
+  "detach_property": true,
+  "constraints": [
+    ["node1", "node2"]
+  ],
+  "properties": [{
+    "name": "id",
+    "type": "INT32",
+    "optional": false
+  }, {
+    "name": "name",
+    "type": "STRING",
+    "optional": false,
+    "index": true
+  }, {
+    "name": "num",
+    "type": "INT32",
+    "optional": false,
+    "index": true,
+    "unique": true
+  }, {
+    "name": "desc",
+    "type": "STRING",
+    "optional": true
+  }]
+}
+```
+把上面这个json序列化成字符串，作为参数传入，建议使用驱动的参数化特性，避免自己拼接语句。
+```
+CALL db.createEdgeLabelByJson($json_data)
+```
+### 查看边类型schema
+```
+CALL db.getEdgeSchema('edge1')
+```
+
+### 删除边类型
+>该操作会同步删除所有该类型的边，数据量大的时候，有时间消耗。
+
+如下例子，删除边类型`edge1`以及该类型的所有边数据。
+```
+CALL db.deleteLabel('edge', 'edge1')
+```
+
+### 边类型添加字段
+>该操作会同步变更所有该类型边的属性数据，数据量大的时候，有时间消耗。
+
+如下例子，对于边类型`edge1`，一次添加了两个字段: `field1`，字符串类型，可选，默认值是 `null`; `field2`，`int64`类型，必选，默认值是`0`.
+```
+CALL db.alterLabelAddFields('edge', 'edge1', ['field1', string, null ,true], ['field2', int64, 0, false])
+```
+
+### 边类型删除字段
+>该操作会同步变更所有该类型边的属性数据，数据量大的时候，有时间消耗。
+
+如下操作，对于边类型`edge1`，一次删除了两个字段: `field1` 和 `field2`。
+```
+CALL db.alterLabelDelFields('edge', 'edge1', ['field1', 'field2'])
+```
+
+### 边类型添加索引
+>该操作会同步构建索引数据，数据量大的时候，有时间消耗。
+
+如下例子，对于边类型`edge1`，给字段`field1`添加了一个非唯一索引。
+```
+CALL db.addEdgeIndex('edge1', 'field1', false, false)
+```
+如下例子，对于边类型`edge1`，给字段`field2`添加了一个唯一索引。
+```
+CALL db.addEdgeIndex('edge1', 'field2', true, false)
+```
+
+### 边类型删除索引
+如下例子，对于边类型`edge1`，删除字段`field1`上的索引。
+```
+CALL db.deleteEdgeIndex('edge1', 'field1')
+```
+
+## 实时查看当前点边数据量
+如下例子返回所有的点边类型，以及每种类型当前的数据量是多少。
+
+读的是统计数据，轻操作。
+```
+CALL dbms.meta.countDetail()
+```
+
+## 导入数据
+### 批量upsert点数据
+如果不存在就插入点，如果存在就更新点的属性，根据点的主键字段值判断是否存在。
+
+第二个参数是一个`list`类型，每个`list`里面的元素是个`map`类型，每个`map`里面是点的字段和对应的值。
+
+推荐使用driver里面的参数化特性，第二个参数直接传入一个 `list`结构体，避免自己构造语句。
+```
+CALL db.upsertVertex('node1', [{id:1, name:'name1'},{id:2, name:'name2'}])
+```
+### 批量upsert边数据
+如果两点之间不存在某条类型的边就插入，如果存在就更新该边的属性，也就是两点之间同类型的边只能有一条。
+
+第四个参数是一个`list`类型，每个数组里面的元素是个`map`类型，每个`map`里面是：边的起点类型主键字段和对应的值、边的终点类型主键字段和对应的值、边类型自身的属性字段和值。每个map里面至少有两个元素。
+
+第二个参数和第三个参数是为第四个参数服务的。分别说明了起点和终点的类型是什么，以及第四个参数中那个字段代表起点主键字段值，那个字段代表终点主键字段值。
+
+注：第二个参数和第三个参数中配置的起点和终点的主键字段并不是起点和终点schema中的主键字段名，只是起一个占位和区别的作用，方便识别第四个参数中哪个字段代表起点和终点的主键字段。
+
+推荐使用driver里面的参数化特性，避免自己构造语句。
+```
+CALL db.upsertEdge('edge1',{type:'node1',key:'node1_id'}, {type:'node2',key:'node2_id'}, [{node1_id:1,node2_id:2,score:10},{node1_id:3,node2_id:4,score:20}])
+```
+
+### 批量upsert边数据-根据边的属性确定唯一
+上面描述的upsert逻辑是两点之间同类型的边只能有一条，如果要求两点之间同类型的边可以有多条，并且根据边上的某个属性来确定唯一，需要在原来的基础上多加一个字段，如下：
+```
+CALL db.upsertEdge('edge1',{type:'node1',key:'node1_id'}, {type:'node2',key:'node2_id'}, [{node1_id:1,node2_id:2,score:10},{node1_id:3,node2_id:4,score:20}], 'score')
+```
+在最后多了一个字段`score`, 逻辑变成：如果两点之间不存在一条`edge1`类型的边，并且`score`值等于某个值，就插入；否则就更新改边的属性。
+边上的`score`字段需要提前加上一个特殊的`pair unique`索引，如下：
+```
+CALL db.addEdgeIndex('edge1', 'score', false, true)
+```
+
+### DataX
+
+https://github.com/ljcui/DataX/tree/bolt 自行编译。
+
+这个DataX实现的 tugraph writer 内部调用的是上面描述的`db.upsertVertex`和`db.upsertEdge`，
+tugraph reader 内部调用的是TuGraph 的 bolt client，支持流式读取，
+具体使用方式见[TuGraph-DataX 使用介绍](./6.utility-tools/7.tugraph-datax.md)
+
+### 离线脱机导入数据
+如果你有子图的schema以及子图里面所有的点边数据（csv或者json格式），可以利用`lgraph_import`工具离线将这些数据生成图数据。
+
+该方式适合初始阶段，先灌进去一批全量数据。注意server要停机，导入完再启动server，可以看到生成的子图数据。
+
+参考 [lgraph_import 使用介绍](./6.utility-tools/1.data-import.md) 中的**离线全量导入**部分
+
+## 导出数据
+
+### 在线远程流式导出数据
+[lgraph_cli 使用介绍](./7.client-tools/6.bolt-console-client.md)
+
+CSV 格式
+```
+echo "match(n:person) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format csv > output.txt
+```
+JSON 格式
+```
+echo "match(n:person) return n.id, n.name;" | lgraph_cli --ip 127.0.0.1 --port 7687 --graph default --user admin --password 73@TuGraph --format json > output.txt
+
+```
+### 本地导出整个图的所有数据
+[lgraph_export 使用介绍](./6.utility-tools/2.data-export.md)
+
+CSV 格式
+```
+lgraph_export -d your_db_path -e export_data -g default -f json -u admin -p 73@TuGraph
+```
+JSON 格式
+```
+lgraph_export -d your_db_path -e export_data -g default -f json -u admin -p 73@TuGraph
+```
+
+### 跨版本迁移数据
+[lgraph_export 使用介绍](./6.utility-tools/2.data-export.md)
+
+对于不兼容的版本之间迁移数据，可以使用`lgraph_export`将旧版本server里面的数据全部导出成文本（里面包含图schema以及所有的点边数据），然后再选择合适的方法将这些文本数据导入到新版本。
diff --git a/docs/docusaurus/versions/version-4.5.1/zh-CN/source/index.rst b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/index.rst
new file mode 100644
index 0000000000..88684b85d4
--- /dev/null
+++ b/docs/docusaurus/versions/version-4.5.1/zh-CN/source/index.rst
@@ -0,0 +1,24 @@
+TuGraph高性能图数据库
+=====================
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   :glob:
+
+   1.guide.md
+   2.introduction/index.rst
+   3.quick-start/index.rst
+   4.user-guide/index.rst
+   development_guide.md
+   5.installation&running/index.rst
+   6.utility-tools/index.rst
+   7.client-tools/index.rst
+   8.query/index.rst
+   9.olap&procedure/index.rst
+   10.permission/index.rst
+   11.quality/index.rst
+   12.contributor-manual/index.rst
+   13.best-practices/index.rst
+   14.faq.md
+   15.contacts.md
diff --git a/docs/docusaurus/versions_sidebars/version-3.5.1_en.ts b/docs/docusaurus/versions_sidebars/version-3.5.1_en.ts
new file mode 100644
index 0000000000..510690f715
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-3.5.1_en.ts
@@ -0,0 +1,18 @@
+import type {SidebarsConfig} from '@docusaurus/plugin-content-docs';
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-3.5.1_zh.ts b/docs/docusaurus/versions_sidebars/version-3.5.1_zh.ts
new file mode 100644
index 0000000000..30879a7004
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-3.5.1_zh.ts
@@ -0,0 +1,207 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    "guide",
+    {
+      type: "category",
+      label: "Tugraph 入门",
+      items: [
+        "introduction/what-is-graph",
+        "introduction/what-is-gdbms",
+        "introduction/what-is-tugraph",
+        {
+          type: "category",
+          label: "产品特点",
+          items: [
+            "introduction/characteristics/performance-oriented",
+            "introduction/characteristics/multi-level-Interfaces",
+            "introduction/characteristics/htap",
+          ],
+        },
+        "introduction/architecture",
+        "introduction/functionality",
+        "introduction/scenarios",
+        "introduction/glossary",
+      ],
+    },
+    {
+      type: "category",
+      label: "快速上手",
+      items: [
+        "quick-start/preparation",
+        {
+          type: "category",
+          label: "demo 示例",
+          items: [
+            "quick-start/demo/movie",
+            "quick-start/demo/wandering-earth",
+            "quick-start/demo/the-three-body",
+            "quick-start/demo/three-kingdoms",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "操作指南",
+      items: [
+        "user-guide/tugraph-browser",
+        "user-guide/tugraph-browser-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "用户手册",
+      items: [
+        {
+          type: "category",
+          label: "安装",
+          items: [
+            "developer-manual/installation/environment",
+            "developer-manual/installation/environment-mode",
+            "developer-manual/installation/docker-deployment",
+            "developer-manual/installation/local-package-deployment",
+            "developer-manual/installation/cloud-deployment",
+          ],
+        },
+        {
+          type: "category",
+          label: "运行",
+          items: [
+            "developer-manual/running/compile",
+            "developer-manual/running/tugraph-running",
+            "developer-manual/running/high-availability-mode",
+          ],
+        },
+        {
+          type: "category",
+          label: "服务端工具",
+          items: [
+            "developer-manual/server-tools/data-import",
+            "developer-manual/server-tools/data-export",
+            "developer-manual/server-tools/backup-and-restore",
+            "developer-manual/server-tools/data-warmup",
+          ],
+        },
+        {
+          type: "category",
+          label: "客户端工具",
+          items: [
+            "developer-manual/client-tools/python-client",
+            "developer-manual/client-tools/cpp-client",
+            "developer-manual/client-tools/java-client",
+            "developer-manual/client-tools/tugraph-ogm",
+            "developer-manual/client-tools/tugraph-cli",
+          ],
+        },
+        {
+          type: "category",
+          label: "生态工具",
+          items: [
+            "developer-manual/ecosystem-tools/monitoring",
+            "developer-manual/ecosystem-tools/tugraph-datax",
+            "developer-manual/ecosystem-tools/tugraph-explorer",
+            "developer-manual/ecosystem-tools/log",
+            "developer-manual/ecosystem-tools/restful",
+          ],
+        },
+        {
+          type: "category",
+          label: "编程接口",
+          items: [
+            "developer-manual/interface/cypher",
+            {
+              type: "category",
+              label: "分析接口",
+              items: [
+                "developer-manual/interface/olap/tutorial",
+                "developer-manual/interface/olap/olap-base-api",
+                "developer-manual/interface/olap/olap-on-db-api",
+                "developer-manual/interface/olap/olap-on-disk-api",
+                "developer-manual/interface/olap/python-api",
+                "developer-manual/interface/olap/algorithms",
+              ],
+            },
+            {
+              type: "category",
+              label: "存储过程",
+              items: [
+                "developer-manual/interface/procedure/procedure",
+                "developer-manual/interface/procedure/traversal",
+                "developer-manual/interface/procedure/Rust-procedure",
+              ],
+            },
+            {
+              type: "category",
+              label: "网络协议",
+              items: [
+                "developer-manual/interface/protocol/rpc-api",
+                "developer-manual/interface/protocol/restful-api",
+              ],
+            },
+            {
+              type: "category",
+              label: "图学习",
+              items: [
+                "developer-manual/interface/learn/tutorial",
+                "developer-manual/interface/learn/sampling_api",
+                "developer-manual/interface/learn/training",
+              ],
+            },
+          ],
+        },
+        {
+          type: "category",
+          label: "测试与质量保证",
+          items: [
+            "developer-manual/quality/unit-testing",
+            "developer-manual/quality/integration-testing",
+          ],
+        },
+        {
+          type: "category",
+          label: "权限管理",
+          items: [
+            "developer-manual/other/privilege",
+            "developer-manual/other/token",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "开发者文档",
+      items: [
+        "community-manual/contributing",
+        "community-manual/community-roles",
+        "community-manual/individual-cla",
+        "community-manual/corporate-cla",
+        "community-manual/roadmap",
+      ],
+    },
+    {
+      type: "category",
+      label: "最佳实践",
+      items: ["best-practices/rdbms-to-tugraph"],
+    },
+    "faq",
+    "contacts",
+  ],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-3.6.0_en.ts b/docs/docusaurus/versions_sidebars/version-3.6.0_en.ts
new file mode 100644
index 0000000000..510690f715
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-3.6.0_en.ts
@@ -0,0 +1,18 @@
+import type {SidebarsConfig} from '@docusaurus/plugin-content-docs';
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-3.6.0_zh.ts b/docs/docusaurus/versions_sidebars/version-3.6.0_zh.ts
new file mode 100644
index 0000000000..25dfaecaad
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-3.6.0_zh.ts
@@ -0,0 +1,210 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    "guide",
+    {
+      type: "category",
+      label: "Tugraph 入门",
+      items: [
+        "introduction/what-is-graph",
+        "introduction/what-is-gdbms",
+        "introduction/what-is-tugraph",
+        {
+          type: "category",
+          label: "产品特点",
+          items: [
+            "introduction/characteristics/performance-oriented",
+            "introduction/characteristics/multi-level-Interfaces",
+            "introduction/characteristics/htap",
+          ],
+        },
+        "introduction/architecture",
+        "introduction/functionality",
+        "introduction/scenarios",
+        "introduction/glossary",
+      ],
+    },
+    {
+      type: "category",
+      label: "快速上手",
+      items: [
+        "quick-start/preparation",
+        {
+          type: "category",
+          label: "demo 示例",
+          items: [
+            "quick-start/demo/movie",
+            "quick-start/demo/wandering-earth",
+            "quick-start/demo/the-three-body",
+            "quick-start/demo/three-kingdoms",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "操作指南",
+      items: [
+        "user-guide/tugraph-browser",
+        "user-guide/tugraph-browser-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "用户手册",
+      items: [
+        {
+          type: "category",
+          label: "安装",
+          items: [
+            "developer-manual/installation/environment",
+            "developer-manual/installation/environment-mode",
+            "developer-manual/installation/docker-deployment",
+            "developer-manual/installation/local-package-deployment",
+            "developer-manual/installation/cloud-deployment",
+          ],
+        },
+        {
+          type: "category",
+          label: "运行",
+          items: [
+            "developer-manual/running/compile",
+            "developer-manual/running/tugraph-running",
+            "developer-manual/running/high-availability-mode",
+          ],
+        },
+        {
+          type: "category",
+          label: "服务端工具",
+          items: [
+            "developer-manual/server-tools/data-import",
+            "developer-manual/server-tools/data-export",
+            "developer-manual/server-tools/backup-and-restore",
+            "developer-manual/server-tools/data-warmup",
+          ],
+        },
+        {
+          type: "category",
+          label: "客户端工具",
+          items: [
+            "developer-manual/client-tools/python-client",
+            "developer-manual/client-tools/cpp-client",
+            "developer-manual/client-tools/java-client",
+            "developer-manual/client-tools/tugraph-ogm",
+            "developer-manual/client-tools/tugraph-cli",
+          ],
+        },
+        {
+          type: "category",
+          label: "生态工具",
+          items: [
+            "developer-manual/ecosystem-tools/monitoring",
+            "developer-manual/ecosystem-tools/tugraph-datax",
+            "developer-manual/ecosystem-tools/tugraph-explorer",
+            "developer-manual/ecosystem-tools/log",
+            "developer-manual/ecosystem-tools/restful",
+          ],
+        },
+        {
+          type: "category",
+          label: "编程接口",
+          items: [
+            "developer-manual/interface/cypher",
+            {
+              type: "category",
+              label: "分析接口",
+              items: [
+                "developer-manual/interface/olap/tutorial",
+                "developer-manual/interface/olap/olap-base-api",
+                "developer-manual/interface/olap/olap-on-db-api",
+                "developer-manual/interface/olap/olap-on-disk-api",
+                "developer-manual/interface/olap/python-api",
+                "developer-manual/interface/olap/algorithms",
+              ],
+            },
+            {
+              type: "category",
+              label: "存储过程",
+              items: [
+                "developer-manual/interface/procedure/procedure",
+                "developer-manual/interface/procedure/traversal",
+                "developer-manual/interface/procedure/Rust-procedure",
+              ],
+            },
+            {
+              type: "category",
+              label: "网络协议",
+              items: [
+                "developer-manual/interface/protocol/rpc-api",
+                "developer-manual/interface/protocol/restful-api",
+              ],
+            },
+            {
+              type: "category",
+              label: "图学习",
+              items: [
+                "developer-manual/interface/learn/tutorial",
+                "developer-manual/interface/learn/sampling_api",
+                "developer-manual/interface/learn/training",
+              ],
+            },
+          ],
+        },
+        {
+          type: "category",
+          label: "测试与质量保证",
+          items: [
+            "developer-manual/quality/unit-testing",
+            "developer-manual/quality/integration-testing",
+          ],
+        },
+        {
+          type: "category",
+          label: "权限管理",
+          items: [
+            "developer-manual/other/privilege",
+            "developer-manual/other/token",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "开发者文档",
+      items: [
+        "community-manual/contributing",
+        "community-manual/community-roles",
+        "community-manual/individual-cla",
+        "community-manual/corporate-cla",
+        "community-manual/roadmap",
+      ],
+    },
+    {
+      type: "category",
+      label: "最佳实践",
+      items: [
+        "best-practices/rdbms-to-tugraph",
+        "best-practices/learn_practices",
+      ],
+    },
+    "faq",
+    "contacts",
+  ],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.0.1_en.ts b/docs/docusaurus/versions_sidebars/version-4.0.1_en.ts
new file mode 100644
index 0000000000..510690f715
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.0.1_en.ts
@@ -0,0 +1,18 @@
+import type {SidebarsConfig} from '@docusaurus/plugin-content-docs';
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.0.1_zh.ts b/docs/docusaurus/versions_sidebars/version-4.0.1_zh.ts
new file mode 100644
index 0000000000..298e054092
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.0.1_zh.ts
@@ -0,0 +1,239 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    "guide",
+    {
+      type: "category",
+      label: "Tugraph 入门",
+      items: [
+        "introduction/what-is-graph",
+        "introduction/what-is-gdbms",
+        "introduction/what-is-tugraph",
+        {
+          type: "category",
+          label: "产品特点",
+          items: [
+            "introduction/characteristics/performance-oriented",
+            "introduction/characteristics/multi-level-Interfaces",
+            "introduction/characteristics/htap",
+          ],
+        },
+        "introduction/architecture",
+        "introduction/functionality",
+        "introduction/scenarios",
+        "introduction/glossary",
+      ],
+    },
+    {
+      type: "category",
+      label: "快速上手",
+      items: [
+        "quick-start/preparation",
+        {
+          type: "category",
+          label: "demo 示例",
+          items: [
+            "quick-start/demo/movie",
+            "quick-start/demo/wandering-earth",
+            "quick-start/demo/the-three-body",
+            "quick-start/demo/three-kingdoms",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "可视化操作指南",
+      items: [
+        "user-guide/tugraph-browser",
+        "user-guide/tugraph-browser-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "开发者文档",
+      items: [
+        {
+          type: "category",
+          label: "安装",
+          items: [
+            "developer-manual/installation/environment",
+            "developer-manual/installation/environment-mode",
+            "developer-manual/installation/docker-deployment",
+            "developer-manual/installation/local-package-deployment",
+            "developer-manual/installation/cloud-deployment",
+          ],
+        },
+        {
+          type: "category",
+          label: "运行",
+          items: [
+            "developer-manual/running/compile",
+            "developer-manual/running/tugraph-running",
+            "developer-manual/running/high-availability-mode",
+          ],
+        },
+        {
+          type: "category",
+          label: "服务端工具",
+          items: [
+            "developer-manual/server-tools/data-import",
+            "developer-manual/server-tools/data-export",
+            "developer-manual/server-tools/backup-and-restore",
+            "developer-manual/server-tools/data-warmup",
+          ],
+        },
+        {
+          type: "category",
+          label: "客户端工具",
+          items: [
+            "developer-manual/client-tools/python-client",
+            "developer-manual/client-tools/cpp-client",
+            "developer-manual/client-tools/java-client",
+            "developer-manual/client-tools/tugraph-ogm",
+            "developer-manual/client-tools/tugraph-cli",
+          ],
+        },
+        {
+          type: "category",
+          label: "生态工具",
+          items: [
+            "developer-manual/ecosystem-tools/monitoring",
+            "developer-manual/ecosystem-tools/tugraph-datax",
+            "developer-manual/ecosystem-tools/tugraph-explorer",
+            "developer-manual/ecosystem-tools/log",
+            "developer-manual/ecosystem-tools/restful",
+          ],
+        },
+        {
+          type: "category",
+          label: "编程接口",
+          items: [
+            {
+              type: "category",
+              label: "查询语句",
+              items: [
+                "developer-manual/interface/query/cypher",
+                {
+                  type: "category",
+                  label: "GQL",
+                  items: [
+                    "developer-manual/interface/query/gql/intro",
+                    {
+                      type: "category",
+                      label: "GQL子句",
+                      items: [
+                        "developer-manual/interface/query/gql/clauses/match",
+                        "developer-manual/interface/query/gql/clauses/optional_match",
+                        "developer-manual/interface/query/gql/clauses/return",
+                        "developer-manual/interface/query/gql/clauses/next",
+                        "developer-manual/interface/query/gql/clauses/where",
+                        "developer-manual/interface/query/gql/clauses/orderby",
+                        "developer-manual/interface/query/gql/clauses/skip",
+                        "developer-manual/interface/query/gql/clauses/limit",
+                      ],
+                    },
+                  ],
+                },
+              ],
+            },
+            {
+              type: "category",
+              label: "分析接口",
+              items: [
+                "developer-manual/interface/olap/tutorial",
+                "developer-manual/interface/olap/olap-base-api",
+                "developer-manual/interface/olap/olap-on-db-api",
+                "developer-manual/interface/olap/olap-on-disk-api",
+                "developer-manual/interface/olap/python-api",
+                "developer-manual/interface/olap/algorithms",
+              ],
+            },
+            {
+              type: "category",
+              label: "存储过程",
+              items: [
+                "developer-manual/interface/procedure/procedure",
+                "developer-manual/interface/procedure/traversal",
+                "developer-manual/interface/procedure/Rust-procedure",
+              ],
+            },
+            {
+              type: "category",
+              label: "网络协议",
+              items: [
+                "developer-manual/interface/protocol/rpc-api",
+                "developer-manual/interface/protocol/restful-api",
+              ],
+            },
+            {
+              type: "category",
+              label: "图学习",
+              items: [
+                "developer-manual/interface/learn/tutorial",
+                "developer-manual/interface/learn/sampling_api",
+                "developer-manual/interface/learn/training",
+              ],
+            },
+          ],
+        },
+        {
+          type: "category",
+          label: "测试与质量保证",
+          items: [
+            "developer-manual/quality/unit-testing",
+            "developer-manual/quality/integration-testing",
+          ],
+        },
+        {
+          type: "category",
+          label: "权限管理",
+          items: [
+            "developer-manual/other/privilege",
+            "developer-manual/other/token",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "贡献者文档",
+      items: [
+        "contributor-manual/contributing",
+        "contributor-manual/community-roles",
+        "contributor-manual/individual-cla",
+        "contributor-manual/corporate-cla",
+        "contributor-manual/roadmap",
+      ],
+    },
+    {
+      type: "category",
+      label: "最佳实践",
+      items: [
+        "best-practices/rdbms-to-tugraph",
+        "best-practices/learn_practices",
+        "best-practices/data_migration",
+        "best-practices/selection",
+      ],
+    },
+    "faq",
+    "contacts",
+  ],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.1.0_en.ts b/docs/docusaurus/versions_sidebars/version-4.1.0_en.ts
new file mode 100644
index 0000000000..510690f715
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.1.0_en.ts
@@ -0,0 +1,18 @@
+import type {SidebarsConfig} from '@docusaurus/plugin-content-docs';
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.1.0_zh.ts b/docs/docusaurus/versions_sidebars/version-4.1.0_zh.ts
new file mode 100644
index 0000000000..277d56fe52
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.1.0_zh.ts
@@ -0,0 +1,245 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    "guide",
+    {
+      type: "category",
+      label: "Tugraph 入门",
+      items: [
+        "introduction/what-is-graph",
+        "introduction/what-is-gdbms",
+        "introduction/what-is-tugraph",
+        {
+          type: "category",
+          label: "产品特点",
+          items: [
+            "introduction/characteristics/performance-oriented",
+            "introduction/characteristics/multi-level-Interfaces",
+            "introduction/characteristics/htap",
+          ],
+        },
+        "introduction/architecture",
+        "introduction/functionality",
+        "introduction/scenarios",
+        "introduction/glossary",
+      ],
+    },
+    {
+      type: "category",
+      label: "快速上手",
+      items: [
+        "quick-start/preparation",
+        {
+          type: "category",
+          label: "demo 示例",
+          items: [
+            "quick-start/demo/movie",
+            "quick-start/demo/wandering-earth",
+            "quick-start/demo/the-three-body",
+            "quick-start/demo/three-kingdoms",
+            "quick-start/demo/round-the-world",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "可视化操作指南",
+      items: [
+        "user-guide/tugraph-browser",
+        "user-guide/tugraph-browser-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "开发者文档",
+      items: [
+        {
+          type: "category",
+          label: "安装",
+          items: [
+            "developer-manual/installation/environment",
+            "developer-manual/installation/environment-mode",
+            "developer-manual/installation/docker-deployment",
+            "developer-manual/installation/local-package-deployment",
+            "developer-manual/installation/cloud-deployment",
+          ],
+        },
+        {
+          type: "category",
+          label: "运行",
+          items: [
+            "developer-manual/running/compile",
+            "developer-manual/running/tugraph-running",
+            "developer-manual/running/high-availability-mode",
+          ],
+        },
+        {
+          type: "category",
+          label: "服务端工具",
+          items: [
+            "developer-manual/server-tools/data-import",
+            "developer-manual/server-tools/data-export",
+            "developer-manual/server-tools/backup-and-restore",
+            "developer-manual/server-tools/data-warmup",
+          ],
+        },
+        {
+          type: "category",
+          label: "客户端工具",
+          items: [
+            "developer-manual/client-tools/python-client",
+            "developer-manual/client-tools/cpp-client",
+            "developer-manual/client-tools/java-client",
+            "developer-manual/client-tools/tugraph-ogm",
+            "developer-manual/client-tools/tugraph-cli",
+            "developer-manual/client-tools/bolt-client",
+            "developer-manual/client-tools/bolt-console-client",
+          ],
+        },
+        {
+          type: "category",
+          label: "生态工具",
+          items: [
+            "developer-manual/ecosystem-tools/monitoring",
+            "developer-manual/ecosystem-tools/tugraph-datax",
+            "developer-manual/ecosystem-tools/tugraph-explorer",
+            "developer-manual/ecosystem-tools/log",
+            "developer-manual/ecosystem-tools/restful",
+          ],
+        },
+        {
+          type: "category",
+          label: "编程接口",
+          items: [
+            {
+              type: "category",
+              label: "查询语句",
+              items: [
+                "developer-manual/interface/query/cypher",
+                {
+                  type: "category",
+                  label: "GQL",
+                  items: [
+                    "developer-manual/interface/query/gql/intro",
+                    {
+                      type: "category",
+                      label: "GQL子句",
+                      items: [
+                        "developer-manual/interface/query/gql/clauses/match",
+                        "developer-manual/interface/query/gql/clauses/optional_match",
+                        "developer-manual/interface/query/gql/clauses/return",
+                        "developer-manual/interface/query/gql/clauses/next",
+                        "developer-manual/interface/query/gql/clauses/where",
+                        "developer-manual/interface/query/gql/clauses/orderby",
+                        "developer-manual/interface/query/gql/clauses/skip",
+                        "developer-manual/interface/query/gql/clauses/limit",
+                      ],
+                    },
+                  ],
+                },
+              ],
+            },
+            {
+              type: "category",
+              label: "分析接口",
+              items: [
+                "developer-manual/interface/olap/tutorial",
+                "developer-manual/interface/olap/olap-base-api",
+                "developer-manual/interface/olap/olap-on-db-api",
+                "developer-manual/interface/olap/olap-on-disk-api",
+                "developer-manual/interface/olap/python-api",
+                "developer-manual/interface/olap/algorithms",
+              ],
+            },
+            {
+              type: "category",
+              label: "存储过程",
+              items: [
+                "developer-manual/interface/procedure/procedure",
+                "developer-manual/interface/procedure/traversal",
+                "developer-manual/interface/procedure/Rust-procedure",
+              ],
+            },
+            {
+              type: "category",
+              label: "网络协议",
+              items: [
+                "developer-manual/interface/protocol/restful-api-legacy",
+                "developer-manual/interface/protocol/rpc-api",
+                "developer-manual/interface/protocol/restful-api",
+              ],
+            },
+            {
+              type: "category",
+              label: "图学习",
+              items: [
+                "developer-manual/interface/learn/tutorial",
+                "developer-manual/interface/learn/sampling_api",
+                "developer-manual/interface/learn/training",
+                "developer-manual/interface/learn/heterogeneous_graph",
+              ],
+            },
+          ],
+        },
+        {
+          type: "category",
+          label: "测试与质量保证",
+          items: [
+            "developer-manual/quality/unit-testing",
+            "developer-manual/quality/integration-testing",
+          ],
+        },
+        {
+          type: "category",
+          label: "权限管理",
+          items: [
+            "developer-manual/other/privilege",
+            "developer-manual/other/token",
+            "developer-manual/other/reset_admin_password",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "贡献者文档",
+      items: [
+        "contributor-manual/contributing",
+        "contributor-manual/community-roles",
+        "contributor-manual/individual-cla",
+        "contributor-manual/corporate-cla",
+        "contributor-manual/roadmap",
+      ],
+    },
+    {
+      type: "category",
+      label: "最佳实践",
+      items: [
+        "best-practices/rdbms-to-tugraph",
+        "best-practices/learn_practices",
+        "best-practices/data_migration",
+        "best-practices/selection",
+      ],
+    },
+    "faq",
+    "contacts",
+  ],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.2.0_en.ts b/docs/docusaurus/versions_sidebars/version-4.2.0_en.ts
new file mode 100644
index 0000000000..510690f715
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.2.0_en.ts
@@ -0,0 +1,18 @@
+import type {SidebarsConfig} from '@docusaurus/plugin-content-docs';
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.2.0_zh.ts b/docs/docusaurus/versions_sidebars/version-4.2.0_zh.ts
new file mode 100644
index 0000000000..e2b05478fc
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.2.0_zh.ts
@@ -0,0 +1,202 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    "guide",
+    {
+      type: "category",
+      label: "Tugraph 入门",
+      items: [
+        "introduction/what-is-graph",
+        "introduction/what-is-gdbms",
+        "introduction/what-is-tugraph",
+        "introduction/schema",
+        {
+          type: "category",
+          label: "产品特点",
+          items: [
+            "introduction/characteristics/performance-oriented",
+            "introduction/characteristics/multi-level-Interfaces",
+            "introduction/characteristics/htap",
+          ],
+        },
+        "introduction/architecture",
+        "introduction/functionality",
+        "introduction/scenarios",
+        "introduction/glossary",
+      ],
+    },
+    {
+      type: "category",
+      label: "快速上手",
+      items: [
+        "quick-start/preparation",
+        {
+          type: "category",
+          label: "demo 示例",
+          items: [
+            "quick-start/demo/movie",
+            "quick-start/demo/wandering-earth",
+            "quick-start/demo/the-three-body",
+            "quick-start/demo/three-kingdoms",
+            "quick-start/demo/round-the-world",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "可视化操作指南",
+      items: [
+        "user-guide/tugraph-browser",
+        "user-guide/tugraph-browser-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "安装和运行",
+      items: [
+        "installation&running/environment",
+        "installation&running/environment-mode",
+        "installation&running/docker-deployment",
+        "installation&running/local-package-deployment",
+        "installation&running/cloud-deployment",
+        "installation&running/compile",
+        "installation&running/tugraph-running",
+        "installation&running/high-availability-mode",
+      ],
+    },
+    {
+      type: "category",
+      label: "实用工具",
+      items: [
+        "utility-tools/data-import",
+        "utility-tools/data-export",
+        "utility-tools/backup-and-restore",
+        "utility-tools/data-warmup",
+        "utility-tools/ha-cluster-management",
+        "utility-tools/tugraph-cli",
+        "utility-tools/tugraph-datax",
+        "utility-tools/tugraph-explorer",
+        "utility-tools/restful",
+      ],
+    },
+    {
+      type: "category",
+      label: "客户端工具",
+      items: [
+        "client-tools/python-client",
+        "client-tools/cpp-client",
+        "client-tools/java-client",
+        "client-tools/tugraph-ogm",
+        "client-tools/bolt-client",
+        "client-tools/bolt-console-client",
+        "client-tools/restful-api",
+        "client-tools/rpc-api",
+        "client-tools/restful-api-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "查询语言",
+      items: ["query/cypher", "query/gql"],
+    },
+    {
+      type: "category",
+      label: "存储过程和分析接口",
+      items: [
+        {
+          type: "category",
+          label: "存储过程",
+          link: {
+            type: "doc",
+            id: "olap&procedure/procedure/procedure",
+          },
+          items: [
+            "olap&procedure/procedure/traversal",
+            'olap&procedure/procedure/C++-procedure',
+            'olap&procedure/procedure/Python-procedure',
+            "olap&procedure/procedure/Rust-procedure",
+          ],
+        },
+        {
+          type: "category",
+          label: "分析接口",
+          items: [
+            "olap&procedure/olap/tutorial",
+            "olap&procedure/olap/olap-base-api",
+            "olap&procedure/olap/olap-on-db-api",
+            "olap&procedure/olap/olap-on-disk-api",
+            "olap&procedure/olap/python-api",
+            "olap&procedure/olap/algorithms",
+          ],
+        },
+        {
+          type: "category",
+          label: "图学习",
+          items: [
+            "olap&procedure/learn/tutorial",
+            "olap&procedure/learn/sampling_api",
+            "olap&procedure/learn/training",
+            "olap&procedure/learn/heterogeneous_graph",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "运维和权限管理",
+      items: [
+        "permission/privilege",
+        "permission/token",
+        "permission/reset_admin_password",
+        "permission/monitoring",
+        "permission/log",
+      ],
+    },
+    {
+      type: "category",
+      label: "测试与质量保障",
+      items: ["quality/unit-testing", "quality/integration-testing"],
+    },
+    {
+      type: "category",
+      label: "贡献者文档",
+      items: [
+        "contributor-manual/contributing",
+        "contributor-manual/community-roles",
+        "contributor-manual/individual-cla",
+        "contributor-manual/corporate-cla",
+        "contributor-manual/roadmap",
+      ],
+    },
+    {
+      type: "category",
+      label: "最佳实践",
+      items: [
+        "best-practices/rdbms-to-tugraph",
+        "best-practices/learn_practices",
+        "best-practices/data_migration",
+        "best-practices/selection",
+      ],
+    },
+    "faq",
+    "contacts",
+  ],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.3.0_en.ts b/docs/docusaurus/versions_sidebars/version-4.3.0_en.ts
new file mode 100644
index 0000000000..d7f3b40e7a
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.3.0_en.ts
@@ -0,0 +1,18 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{ type: "autogenerated", dirName: "." }],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.3.0_zh.ts b/docs/docusaurus/versions_sidebars/version-4.3.0_zh.ts
new file mode 100644
index 0000000000..1a688ac5b6
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.3.0_zh.ts
@@ -0,0 +1,203 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    "guide",
+    {
+      type: "category",
+      label: "Tugraph 入门",
+      items: [
+        "introduction/what-is-graph",
+        "introduction/what-is-gdbms",
+        "introduction/what-is-tugraph",
+        "introduction/schema",
+        {
+          type: "category",
+          label: "产品特点",
+          items: [
+            "introduction/characteristics/performance-oriented",
+            "introduction/characteristics/multi-level-Interfaces",
+            "introduction/characteristics/htap",
+          ],
+        },
+        "introduction/architecture",
+        "introduction/functionality",
+        "introduction/scenarios",
+        "introduction/glossary",
+      ],
+    },
+    {
+      type: "category",
+      label: "快速上手",
+      items: [
+        "quick-start/preparation",
+        {
+          type: "category",
+          label: "demo 示例",
+          items: [
+            "quick-start/demo/movie",
+            "quick-start/demo/wandering-earth",
+            "quick-start/demo/the-three-body",
+            "quick-start/demo/three-kingdoms",
+            "quick-start/demo/round-the-world",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "可视化操作指南",
+      items: [
+        "user-guide/tugraph-browser",
+        "user-guide/tugraph-browser-legacy",
+      ],
+    },
+    "development_guide",
+    {
+      type: "category",
+      label: "安装和运行",
+      items: [
+        "installation&running/environment",
+        "installation&running/environment-mode",
+        "installation&running/docker-deployment",
+        "installation&running/local-package-deployment",
+        "installation&running/cloud-deployment",
+        "installation&running/compile",
+        "installation&running/tugraph-running",
+        "installation&running/high-availability-mode",
+      ],
+    },
+    {
+      type: "category",
+      label: "实用工具",
+      items: [
+        "utility-tools/data-import",
+        "utility-tools/data-export",
+        "utility-tools/backup-and-restore",
+        "utility-tools/data-warmup",
+        "utility-tools/ha-cluster-management",
+        "utility-tools/tugraph-cli",
+        "utility-tools/tugraph-datax",
+        "utility-tools/tugraph-explorer",
+        "utility-tools/restful",
+      ],
+    },
+    {
+      type: "category",
+      label: "客户端工具",
+      items: [
+        "client-tools/python-client",
+        "client-tools/cpp-client",
+        "client-tools/java-client",
+        "client-tools/tugraph-ogm",
+        "client-tools/bolt-client",
+        "client-tools/bolt-console-client",
+        "client-tools/restful-api",
+        "client-tools/rpc-api",
+        "client-tools/restful-api-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "查询语言",
+      items: ["query/cypher", "query/gql"],
+    },
+    {
+      type: "category",
+      label: "存储过程和分析接口",
+      items: [
+        {
+          type: "category",
+          label: "存储过程",
+          link: {
+            type: "doc",
+            id: "olap&procedure/procedure/procedure",
+          },
+          items: [
+            "olap&procedure/procedure/traversal",
+            'olap&procedure/procedure/C++-procedure',
+            'olap&procedure/procedure/Python-procedure',
+            "olap&procedure/procedure/Rust-procedure",
+          ],
+        },
+        {
+          type: "category",
+          label: "分析接口",
+          items: [
+            "olap&procedure/olap/tutorial",
+            "olap&procedure/olap/olap-base-api",
+            "olap&procedure/olap/olap-on-db-api",
+            "olap&procedure/olap/olap-on-disk-api",
+            "olap&procedure/olap/python-api",
+            "olap&procedure/olap/algorithms",
+          ],
+        },
+        {
+          type: "category",
+          label: "图学习",
+          items: [
+            "olap&procedure/learn/tutorial",
+            "olap&procedure/learn/sampling_api",
+            "olap&procedure/learn/training",
+            "olap&procedure/learn/heterogeneous_graph",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "运维和权限管理",
+      items: [
+        "permission/privilege",
+        "permission/token",
+        "permission/reset_admin_password",
+        "permission/monitoring",
+        "permission/log",
+      ],
+    },
+    {
+      type: "category",
+      label: "测试与质量保障",
+      items: ["quality/unit-testing", "quality/integration-testing"],
+    },
+    {
+      type: "category",
+      label: "贡献者文档",
+      items: [
+        "contributor-manual/contributing",
+        "contributor-manual/community-roles",
+        "contributor-manual/individual-cla",
+        "contributor-manual/corporate-cla",
+        "contributor-manual/roadmap",
+      ],
+    },
+    {
+      type: "category",
+      label: "最佳实践",
+      items: [
+        "best-practices/rdbms-to-tugraph",
+        "best-practices/learn_practices",
+        "best-practices/data_migration",
+        "best-practices/selection",
+      ],
+    },
+    "faq",
+    "contacts",
+  ],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.3.1_en.ts b/docs/docusaurus/versions_sidebars/version-4.3.1_en.ts
new file mode 100644
index 0000000000..510690f715
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.3.1_en.ts
@@ -0,0 +1,18 @@
+import type {SidebarsConfig} from '@docusaurus/plugin-content-docs';
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.3.1_zh.ts b/docs/docusaurus/versions_sidebars/version-4.3.1_zh.ts
new file mode 100644
index 0000000000..f2976bf412
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.3.1_zh.ts
@@ -0,0 +1,203 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    "guide",
+    {
+      type: "category",
+      label: "Tugraph 入门",
+      items: [
+        "introduction/what-is-graph",
+        "introduction/what-is-gdbms",
+        "introduction/what-is-tugraph",
+        "introduction/schema",
+        {
+          type: "category",
+          label: "产品特点",
+          items: [
+            "introduction/characteristics/performance-oriented",
+            "introduction/characteristics/multi-level-Interfaces",
+            "introduction/characteristics/htap",
+          ],
+        },
+        "introduction/architecture",
+        "introduction/functionality",
+        "introduction/scenarios",
+        "introduction/glossary",
+      ],
+    },
+    {
+      type: "category",
+      label: "快速上手",
+      items: [
+        "quick-start/preparation",
+        {
+          type: "category",
+          label: "demo 示例",
+          items: [
+            "quick-start/demo/movie",
+            "quick-start/demo/wandering-earth",
+            "quick-start/demo/the-three-body",
+            "quick-start/demo/three-kingdoms",
+            "quick-start/demo/round-the-world",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "可视化操作指南",
+      items: [
+        "user-guide/tugraph-browser",
+        "user-guide/tugraph-browser-legacy",
+      ],
+    },
+    "development_guide",
+    {
+      type: "category",
+      label: "安装和运行",
+      items: [
+        "installation&running/environment",
+        "installation&running/environment-mode",
+        "installation&running/docker-deployment",
+        "installation&running/local-package-deployment",
+        "installation&running/cloud-deployment",
+        "installation&running/compile",
+        "installation&running/tugraph-running",
+        "installation&running/high-availability-mode",
+      ],
+    },
+    {
+      type: "category",
+      label: "实用工具",
+      items: [
+        "utility-tools/data-import",
+        "utility-tools/data-export",
+        "utility-tools/backup-and-restore",
+        "utility-tools/data-warmup",
+        "utility-tools/ha-cluster-management",
+        "utility-tools/tugraph-cli",
+        "utility-tools/tugraph-datax",
+        "utility-tools/tugraph-explorer",
+        "utility-tools/restful",
+      ],
+    },
+    {
+      type: "category",
+      label: "客户端工具",
+      items: [
+        "client-tools/python-client",
+        "client-tools/cpp-client",
+        "client-tools/java-client",
+        "client-tools/tugraph-ogm",
+        "client-tools/bolt-client",
+        "client-tools/bolt-console-client",
+        "client-tools/restful-api",
+        "client-tools/rpc-api",
+        "client-tools/restful-api-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "查询语言",
+      items: ["query/cypher", "query/gql"],
+    },
+    {
+      type: "category",
+      label: "存储过程和分析接口",
+      items: [
+        {
+          type: "category",
+          label: "存储过程",
+          link: {
+            type: "doc",
+            id: "olap&procedure/procedure/procedure",
+          },
+          items: [
+            "olap&procedure/procedure/traversal",
+            // 'olap&procedure/procedure/C++-procedure',
+            // 'olap&procedure/procedure/Python-procedure',
+            "olap&procedure/procedure/Rust-procedure",
+          ],
+        },
+        {
+          type: "category",
+          label: "分析接口",
+          items: [
+            "olap&procedure/olap/tutorial",
+            "olap&procedure/olap/olap-base-api",
+            "olap&procedure/olap/olap-on-db-api",
+            "olap&procedure/olap/olap-on-disk-api",
+            "olap&procedure/olap/python-api",
+            "olap&procedure/olap/algorithms",
+          ],
+        },
+        {
+          type: "category",
+          label: "图学习",
+          items: [
+            "olap&procedure/learn/tutorial",
+            "olap&procedure/learn/sampling_api",
+            "olap&procedure/learn/training",
+            "olap&procedure/learn/heterogeneous_graph",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "运维和权限管理",
+      items: [
+        "permission/privilege",
+        "permission/token",
+        "permission/reset_admin_password",
+        "permission/monitoring",
+        "permission/log",
+      ],
+    },
+    {
+      type: "category",
+      label: "测试与质量保障",
+      items: ["quality/unit-testing", "quality/integration-testing"],
+    },
+    {
+      type: "category",
+      label: "贡献者文档",
+      items: [
+        "contributor-manual/contributing",
+        "contributor-manual/community-roles",
+        "contributor-manual/individual-cla",
+        "contributor-manual/corporate-cla",
+        "contributor-manual/roadmap",
+      ],
+    },
+    {
+      type: "category",
+      label: "最佳实践",
+      items: [
+        "best-practices/rdbms-to-tugraph",
+        "best-practices/learn_practices",
+        "best-practices/data_migration",
+        "best-practices/selection",
+      ],
+    },
+    "faq",
+    "contacts",
+  ],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.3.2_en.ts b/docs/docusaurus/versions_sidebars/version-4.3.2_en.ts
new file mode 100644
index 0000000000..510690f715
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.3.2_en.ts
@@ -0,0 +1,18 @@
+import type {SidebarsConfig} from '@docusaurus/plugin-content-docs';
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.3.2_zh.ts b/docs/docusaurus/versions_sidebars/version-4.3.2_zh.ts
new file mode 100644
index 0000000000..9aad35774e
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.3.2_zh.ts
@@ -0,0 +1,204 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    "guide",
+    {
+      type: "category",
+      label: "Tugraph 入门",
+      items: [
+        "introduction/what-is-graph",
+        "introduction/what-is-gdbms",
+        "introduction/what-is-tugraph",
+        "introduction/schema",
+        {
+          type: "category",
+          label: "产品特点",
+          items: [
+            "introduction/characteristics/performance-oriented",
+            "introduction/characteristics/multi-level-Interfaces",
+            "introduction/characteristics/htap",
+          ],
+        },
+        "introduction/architecture",
+        "introduction/functionality",
+        "introduction/scenarios",
+        "introduction/glossary",
+      ],
+    },
+    {
+      type: "category",
+      label: "快速上手",
+      items: [
+        "quick-start/preparation",
+        {
+          type: "category",
+          label: "demo 示例",
+          items: [
+            "quick-start/demo/movie",
+            "quick-start/demo/wandering-earth",
+            "quick-start/demo/the-three-body",
+            "quick-start/demo/three-kingdoms",
+            "quick-start/demo/round-the-world",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "可视化操作指南",
+      items: [
+        "user-guide/tugraph-browser",
+        "user-guide/tugraph-browser-legacy",
+      ],
+    },
+    "development_guide",
+    {
+      type: "category",
+      label: "安装和运行",
+      items: [
+        "installation&running/environment",
+        "installation&running/environment-mode",
+        "installation&running/docker-deployment",
+        "installation&running/local-package-deployment",
+        "installation&running/cloud-deployment",
+        "installation&running/compile",
+        "installation&running/tugraph-running",
+        "installation&running/high-availability-mode",
+      ],
+    },
+    {
+      type: "category",
+      label: "实用工具",
+      items: [
+        "utility-tools/data-import",
+        "utility-tools/data-export",
+        "utility-tools/backup-and-restore",
+        "utility-tools/data-warmup",
+        "utility-tools/ha-cluster-management",
+        "utility-tools/tugraph-cli",
+        "utility-tools/tugraph-datax",
+        "utility-tools/tugraph-explorer",
+        "utility-tools/restful",
+      ],
+    },
+    {
+      type: "category",
+      label: "客户端工具",
+      items: [
+        "client-tools/python-client",
+        "client-tools/cpp-client",
+        "client-tools/java-client",
+        "client-tools/tugraph-ogm",
+        "client-tools/bolt-client",
+        "client-tools/bolt-console-client",
+        "client-tools/restful-api",
+        "client-tools/rpc-api",
+        "client-tools/restful-api-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "查询语言",
+      items: ["query/cypher", "query/gql"],
+    },
+    {
+      type: "category",
+      label: "存储过程和分析接口",
+      items: [
+        {
+          type: "category",
+          label: "存储过程",
+          link: {
+            type: "doc",
+            id: "olap&procedure/procedure/procedure",
+          },
+          items: [
+            "olap&procedure/procedure/traversal",
+            'olap&procedure/procedure/C++-procedure',
+            'olap&procedure/procedure/Python-procedure',
+            "olap&procedure/procedure/Rust-procedure",
+          ],
+        },
+        {
+          type: "category",
+          label: "分析接口",
+          items: [
+            "olap&procedure/olap/tutorial",
+            "olap&procedure/olap/olap-base-api",
+            "olap&procedure/olap/olap-on-db-api",
+            "olap&procedure/olap/olap-on-disk-api",
+            "olap&procedure/olap/python-api",
+            "olap&procedure/olap/algorithms",
+          ],
+        },
+        {
+          type: "category",
+          label: "图学习",
+          items: [
+            "olap&procedure/learn/tutorial",
+            "olap&procedure/learn/sampling_api",
+            "olap&procedure/learn/training",
+            "olap&procedure/learn/heterogeneous_graph",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "运维和权限管理",
+      items: [
+        "permission/privilege",
+        "permission/token",
+        "permission/reset_admin_password",
+        "permission/monitoring",
+        "permission/log",
+      ],
+    },
+    {
+      type: "category",
+      label: "测试与质量保障",
+      items: ["quality/unit-testing", "quality/integration-testing"],
+    },
+    {
+      type: "category",
+      label: "贡献者文档",
+      items: [
+        "contributor-manual/contributing",
+        "contributor-manual/community-roles",
+        "contributor-manual/individual-cla",
+        "contributor-manual/corporate-cla",
+        "contributor-manual/roadmap",
+      ],
+    },
+    {
+      type: "category",
+      label: "最佳实践",
+      items: [
+        "best-practices/rdbms-to-tugraph",
+        "best-practices/learn_practices",
+        "best-practices/data_migration",
+        "best-practices/selection",
+        "best-practices/spatial",
+      ],
+    },
+    "faq",
+    "contacts",
+  ],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.5.1_en.ts b/docs/docusaurus/versions_sidebars/version-4.5.1_en.ts
new file mode 100644
index 0000000000..d7f3b40e7a
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.5.1_en.ts
@@ -0,0 +1,18 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  tutorialSidebar: [{ type: "autogenerated", dirName: "." }],
+};
+
+export default sidebars;
diff --git a/docs/docusaurus/versions_sidebars/version-4.5.1_zh.ts b/docs/docusaurus/versions_sidebars/version-4.5.1_zh.ts
new file mode 100644
index 0000000000..4e464ba6f4
--- /dev/null
+++ b/docs/docusaurus/versions_sidebars/version-4.5.1_zh.ts
@@ -0,0 +1,204 @@
+import type { SidebarsConfig } from "@docusaurus/plugin-content-docs";
+
+/**
+ * Creating a sidebar enables you to:
+ - create an ordered group of docs
+ - render a sidebar for each doc of that group
+ - provide next/previous navigation
+
+ The sidebars can be generated from the filesystem, or explicitly defined here.
+
+ Create as many sidebars as you want.
+ */
+const sidebars: SidebarsConfig = {
+  // By default, Docusaurus generates a sidebar from the docs folder structure
+  // tutorialSidebar: [{type: 'autogenerated', dirName: '.'}],
+
+  // But you can create a sidebar manually
+  tutorialSidebar: [
+    "guide",
+    {
+      type: "category",
+      label: "Tugraph 入门",
+      items: [
+        "introduction/what-is-graph",
+        "introduction/what-is-gdbms",
+        "introduction/what-is-tugraph",
+        "introduction/schema",
+        {
+          type: "category",
+          label: "产品特点",
+          items: [
+            "introduction/characteristics/performance-oriented",
+            "introduction/characteristics/multi-level-Interfaces",
+            "introduction/characteristics/htap",
+          ],
+        },
+        "introduction/architecture",
+        "introduction/functionality",
+        "introduction/scenarios",
+        "introduction/glossary",
+      ],
+    },
+    {
+      type: "category",
+      label: "快速上手",
+      items: [
+        "quick-start/preparation",
+        {
+          type: "category",
+          label: "demo 示例",
+          items: [
+            "quick-start/demo/movie",
+            "quick-start/demo/wandering-earth",
+            "quick-start/demo/the-three-body",
+            "quick-start/demo/three-kingdoms",
+            "quick-start/demo/round-the-world",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "可视化操作指南",
+      items: [
+        "user-guide/tugraph-browser",
+        "user-guide/tugraph-browser-legacy",
+      ],
+    },
+    "development_guide",
+    {
+      type: "category",
+      label: "安装和运行",
+      items: [
+        "installation&running/environment",
+        "installation&running/environment-mode",
+        "installation&running/docker-deployment",
+        "installation&running/local-package-deployment",
+        "installation&running/cloud-deployment",
+        "installation&running/compile",
+        "installation&running/tugraph-running",
+        "installation&running/high-availability-mode",
+      ],
+    },
+    {
+      type: "category",
+      label: "实用工具",
+      items: [
+        "utility-tools/data-import",
+        "utility-tools/data-export",
+        "utility-tools/backup-and-restore",
+        "utility-tools/data-warmup",
+        "utility-tools/ha-cluster-management",
+        "utility-tools/tugraph-cli",
+        "utility-tools/tugraph-datax",
+        "utility-tools/tugraph-explorer",
+        "utility-tools/restful",
+      ],
+    },
+    {
+      type: "category",
+      label: "客户端工具",
+      items: [
+        "client-tools/python-client",
+        "client-tools/cpp-client",
+        "client-tools/java-client",
+        "client-tools/tugraph-ogm",
+        "client-tools/bolt-client",
+        "client-tools/bolt-console-client",
+        "client-tools/restful-api",
+        "client-tools/rpc-api",
+        "client-tools/restful-api-legacy",
+      ],
+    },
+    {
+      type: "category",
+      label: "查询语言",
+      items: ["query/cypher", "query/gql", "query/vector_index"],
+    },
+    {
+      type: "category",
+      label: "存储过程和分析接口",
+      items: [
+        {
+          type: "category",
+          label: "存储过程",
+          link: {
+            type: "doc",
+            id: "olap&procedure/procedure/procedure",
+          },
+          items: [
+            "olap&procedure/procedure/traversal",
+            // "olap&procedure/procedure/C++-procedure",
+            // "olap&procedure/procedure/Python-procedure",
+            "olap&procedure/procedure/Rust-procedure",
+          ],
+        },
+        {
+          type: "category",
+          label: "分析接口",
+          items: [
+            "olap&procedure/olap/tutorial",
+            "olap&procedure/olap/olap-base-api",
+            "olap&procedure/olap/olap-on-db-api",
+            "olap&procedure/olap/olap-on-disk-api",
+            "olap&procedure/olap/python-api",
+            "olap&procedure/olap/algorithms",
+          ],
+        },
+        {
+          type: "category",
+          label: "图学习",
+          items: [
+            "olap&procedure/learn/tutorial",
+            "olap&procedure/learn/sampling_api",
+            "olap&procedure/learn/training",
+            "olap&procedure/learn/heterogeneous_graph",
+          ],
+        },
+      ],
+    },
+    {
+      type: "category",
+      label: "运维和权限管理",
+      items: [
+        "permission/privilege",
+        "permission/token",
+        "permission/reset_admin_password",
+        "permission/monitoring",
+        "permission/log",
+      ],
+    },
+    {
+      type: "category",
+      label: "测试与质量保障",
+      items: ["quality/unit-testing", "quality/integration-testing"],
+    },
+    {
+      type: "category",
+      label: "贡献者文档",
+      items: [
+        "contributor-manual/contributing",
+        "contributor-manual/community-roles",
+        "contributor-manual/individual-cla",
+        "contributor-manual/corporate-cla",
+        "contributor-manual/roadmap",
+      ],
+    },
+    {
+      type: "category",
+      label: "最佳实践",
+      items: [
+        "best-practices/rdbms-to-tugraph",
+        "best-practices/learn_practices",
+        "best-practices/data_migration",
+        "best-practices/selection",
+        "best-practices/spatial",
+      ],
+    },
+    "faq",
+    "contacts",
+  ],
+};
+
+export default sidebars;